synergy-1.4.12-Source/0000700000175000017500000000000012140644175014511 5ustar synergysynergysynergy-1.4.12-Source/.gitignore0000600000175000017500000000034011557776337016521 0ustar synergysynergy#Vim backup files *~ #Python compiled files *.pyc #Git-svn created .gitignore /Release /Debug /vc90.pdb /synergy.ncb /synergy.vcproj.ADOBENET.ssbarnea.user /bin /tool /config.h /tags #doxygen /doc/doxygen /doc/doxygen.cfg synergy-1.4.12-Source/.lvimrc0000600000175000017500000000050711376310263016010 0ustar synergysynergy"Instructions "Download vim script 411 "http://www.vim.org/scripts/script.php?script_id=441 "Install localvimrc.vim to .vim/plugin " " Hint: You can disable it asking before sourcing a file by adding this to " your .vimrc: let g:localvimrc_ask=0 set nosmarttab set noexpandtab set shiftwidth=8 set softtabstop=0 set tabstop=4 synergy-1.4.12-Source/ChangeLog100777 0 0 10657 12141167271 11461 01.4.12 ====== Bug #3565 - Encryption fails when typing fast (Invalid message from client) Bug #3606 - GUI is elevated after setup Bug #3572 - Mac caps lock causes disconnect 1.4.11 ====== Feature #12 - Encryption Feature #421 - Portable version Bug #2855 - Mouse cursor remains hidden on Mac client (intermittently/randomly) Bug #3281 - server start on OS X defaults to 'interactive' Bug #3310 - P&ort in settings screen 1.4.10 ====== Bug #2799 - Right shift broken (Windows server, Mac OS X client) Bug #3302 - GUI does not show/hide when tray icon is double clicked (Windows) Bug #3303 - Mac OS X IPC integ test fails intermittently Feature #2974 - Gesture Support for Magic Mouse/Trackpad Feature #3172 - Button to stop Synergy when in service mode Feature #3241 - Option to elevate synergyc/s when in service mode Feature #3242 - Show a list of available IP addresses and screen name on the main screen Feature #3296 - 64-bit Windows installer should display helpful message on 32-bit Windows Feature #3300 - Make service mode default mode (now that we have elevate option) Feature #3301 - Add process mode option to settings (remove startup wizard page) Feature #3306 - Gatekeeper compatibility on Mac OS X 10.8 1.4.9 ===== Bug #3159 - In service mode, server doesn't start unless GUI is running Bug #3214 - Client sometimes can't connect if GUI is closed Bug #56 - Mac OS X server not sending keystrokes to client Bug #3161 - First time GUI appears, service doesn't send logging Bug #3164 - In service mode, you need to add a firewall exception Bug #3166 - Service shutdown stalls when GUI is closed Bug #3216 - Fatal error if plugins folder doesn't exist Bug #3221 - ERROR: could not connect to service, error: 2 Feature #3192 - Add support for JOYINFOEX structure to poll game device info Feature #3202 - Plugin support (sending for primary screen events on Windows only) Feature #3155 - Cross-platform TCP IPC between GUI and service Task #3177 - Fix Mac buildslave to build multiple versions Task #3193 - Add Micro Synergy to repository Task #3275 - Change hostname label to "IP address or hostname" Task #3276 - Installation recovery mechanism for synrgyhk.dll 1.4.8 ===== Bug #143: Cursor on Mac OS X goes to center when inactive Bug #146: Screen Resize causes problems with moving off right-hand side of screen Bug #3058: Modifier keys not working on Mac OS X server Bug #3139: Double click too strict (click, move, click should not count) Bug #3195: Service install can fail first time Bug #3196: Wizard buttons not visible Bug #3197: GUI doesn't take focus after install Bug #3202: Hook DLL (synrgyhk.dll) is not released Feature #3143: Setup wizard for first time users Feature #3145: Check for updates Feature #3174: Startup mode wizard page Feature #3184: New service for process management 1.4.7 ===== Bug #3132: GUI hides before successful connection Bug #3133: Can't un-hide GUI on Mac Feature #3054: Hide synergy[cs] dock icon (Mac OS X) Feature #3135: Integrate log into main window Task #3134: Move hotkey warnings to DEBUG 1.4.6 ===== Bug #155: Build error on FreeBSD (missing sentinel in function call) Bug #571: Synergy SegFaults with "Unknown Quartz Event type: 0x1d" Bug #617: xrandr rotation on client confines cursor in wrong area Bug #642: `synergyc --help` segfaults on sparc64 architecture Bug #652: Stack overflow in getIDForKey Bug #1071: Can't copy from the Firefox address bar on Linux Bug #1662: Copying text from remote computer crashes java programs. Bug #1731: YouTube can cause server to freeze randomly Bug #2752: Use SAS for ctrl+alt+del on win7 Bug #2763: Double-click broken on Mac OS Bug #2817: Keypad Subtract has wrong keycode on OS X Bug #2958: GNOME 3 mouse problem (gnome-shell) Bug #2962: Clipboard not working on mac client Bug #3063: Segfault in copy buffer Bug #3066: Server segfault on clipboard paste Bug #3089: Comma and Period translated wrong when using the NEO2-layout Bug #3092: Wrong screen rotation detected Bug #3105: There doesn't seem to be a system tray available. Quitting Bug #3116: Memory Leak due to the XInput2 patches Bug #3117: Dual monitors not detected properly anymore Feature #3073: Re-introduce auto-start GUI (Windows) Feature #3076: Re-introduce auto-start backend Feature #3077: Re-introduce hidden on start Feature #3091: Add option to remap altgr modifier Feature #3119: Mac OS X secondary screen Task #2905: Unit tests: Clipboard classes Task #3072: Downgrade Linux build machines Task #3090: CXWindowsKeyState integ test args wrong synergy-1.4.12-Source/CMakeLists.txt0000600000175000017500000003042612131675456017266 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . # Version number for Synergy set(VERSION_MAJOR 1) set(VERSION_MINOR 4) set(VERSION_REV 12) set(VERSION "${VERSION_MAJOR}.${VERSION_MINOR}.${VERSION_REV}") # The check for 2.6 may be too strict (consider lowering). cmake_minimum_required(VERSION 2.4.7) # CMake complains if we don't have this. if (COMMAND cmake_policy) cmake_policy(SET CMP0003 NEW) endif() # We're escaping quotes in the Windows version number, because # for some reason CMake won't do it at config version 2.4.7 # It seems that this restores the newer behaviour where define # args are not auto-escaped. if (COMMAND cmake_policy) cmake_policy(SET CMP0005 NEW) endif() # First, declare project (important for prerequisite checks). project(synergy C CXX) # put binaries in a different dir to make them easier to find. set(EXECUTABLE_OUTPUT_PATH ${PROJECT_SOURCE_DIR}/bin) set(LIBRARY_OUTPUT_PATH ${PROJECT_SOURCE_DIR}/lib) # for unix, put debug files in a separate bin "debug" dir. # release bin files should stay in the root of the bin dir. if (CMAKE_GENERATOR STREQUAL "Unix Makefiles") if (CMAKE_BUILD_TYPE STREQUAL Debug) set(EXECUTABLE_OUTPUT_PATH ${PROJECT_SOURCE_DIR}/bin/debug) set(LIBRARY_OUTPUT_PATH ${PROJECT_SOURCE_DIR}/lib/debug) endif() endif() # Set some easy to type variables. set(root_dir ${CMAKE_SOURCE_DIR}) set(cmake_dir ${root_dir}/res) set(bin_dir ${root_dir}/bin) set(doc_dir ${root_dir}/doc) set(doc_dir ${root_dir}/doc) # Declare libs, so we can use list in linker later. There's probably # a more elegant way of doing this; with SCons, when you check for the # lib, it is automatically passed to the linker. set(libs) # Depending on the platform, pass in the required defines. if (UNIX) # For config.h, detect the libraries, functions, etc. include(CheckIncludeFiles) include(CheckLibraryExists) include(CheckFunctionExists) include(CheckTypeSize) include(CheckIncludeFileCXX) include(CheckSymbolExists) include(CheckCSourceCompiles) check_include_file_cxx(istream HAVE_ISTREAM) check_include_file_cxx(ostream HAVE_OSTREAM) check_include_file_cxx(sstream HAVE_SSTREAM) check_include_files(inttypes.h HAVE_INTTYPES_H) check_include_files(locale.h HAVE_LOCALE_H) check_include_files(memory.h HAVE_MEMORY_H) check_include_files(stdlib.h HAVE_STDLIB_H) check_include_files(strings.h HAVE_STRINGS_H) check_include_files(string.h HAVE_STRING_H) check_include_files(sys/select.h HAVE_SYS_SELECT_H) check_include_files(sys/socket.h HAVE_SYS_SOCKET_H) check_include_files(sys/stat.h HAVE_SYS_STAT_H) check_include_files(sys/time.h HAVE_SYS_TIME_H) check_include_files(sys/utsname.h HAVE_SYS_UTSNAME_H) check_include_files(unistd.h HAVE_UNISTD_H) check_include_files(wchar.h HAVE_WCHAR_H) check_function_exists(getpwuid_r HAVE_GETPWUID_R) check_function_exists(gmtime_r HAVE_GMTIME_R) check_function_exists(nanosleep HAVE_NANOSLEEP) check_function_exists(poll HAVE_POLL) check_function_exists(sigwait HAVE_POSIX_SIGWAIT) check_function_exists(strftime HAVE_STRFTIME) check_function_exists(vsnprintf HAVE_VSNPRINTF) check_function_exists(inet_aton HAVE_INET_ATON) # For some reason, the check_function_exists macro doesn't detect # the inet_aton on some pure Unix platforms (e.g. sunos5). So we # need to do a more detailed check and also include some extra libs. if (NOT HAVE_INET_ATON) set(CMAKE_REQUIRED_LIBRARIES nsl) check_c_source_compiles( "#include \n int main() { inet_aton(0, 0); }" HAVE_INET_ATON_ADV) set(CMAKE_REQUIRED_LIBRARIES) if (HAVE_INET_ATON_ADV) # Override the previous fail. set(HAVE_INET_ATON 1) # Assume that both nsl and socket will be needed, # it seems safe to add socket on the back of nsl, # since socket only ever needed when nsl is needed. list(APPEND libs nsl socket) endif() endif() check_type_size(char SIZEOF_CHAR) check_type_size(int SIZEOF_INT) check_type_size(long SIZEOF_LONG) check_type_size(short SIZEOF_SHORT) # pthread is used on both Linux and Mac check_library_exists("pthread" pthread_create "" HAVE_PTHREAD) if (HAVE_PTHREAD) list(APPEND libs pthread) else (HAVE_PTHREAD) message(FATAL_ERROR "Missing library: pthread") endif() if (APPLE) exec_program(uname ARGS -v OUTPUT_VARIABLE DARWIN_VERSION) string(REGEX MATCH "[0-9]+" DARWIN_VERSION ${DARWIN_VERSION}) message(STATUS "DARWIN_VERSION=${DARWIN_VERSION}") if (DARWIN_VERSION LESS 9) # 10.4: universal (32-bit intel and power pc) set(CMAKE_OSX_ARCHITECTURES "ppc;i386" CACHE STRING "" FORCE) else() # 10.5+: 32-bit only -- missing funcs in 64-bit os libs # such as GetGlobalMouse. set(CMAKE_OSX_ARCHITECTURES "i386" CACHE STRING "" FORCE) endif() set(CMAKE_CXX_FLAGS "--sysroot ${CMAKE_OSX_SYSROOT} ${CMAKE_CXX_FLAGS}") find_library(lib_ScreenSaver ScreenSaver) find_library(lib_IOKit IOKit) find_library(lib_ApplicationServices ApplicationServices) find_library(lib_Foundation Foundation) find_library(lib_Carbon Carbon) list(APPEND libs ${lib_ScreenSaver} ${lib_IOKit} ${lib_ApplicationServices} ${lib_Foundation} ${lib_Carbon} ) else() # add include dir for bsd (posix uses /usr/include/) set(CMAKE_INCLUDE_PATH "${CMAKE_INCLUDE_PATH}:/usr/local/include") set(XKBlib "X11/Xlib.h;X11/XKBlib.h") check_symbol_exists("XRRNotifyEvent" "${XKBlib};X11/extensions/Xrandr.h" HAVE_X11_EXTENSIONS_XRANDR_H) check_include_files("${XKBlib};X11/extensions/dpms.h" HAVE_X11_EXTENSIONS_DPMS_H) check_include_files("X11/extensions/Xinerama.h" HAVE_X11_EXTENSIONS_XINERAMA_H) check_include_files("${XKBlib};X11/extensions/XKBstr.h" HAVE_X11_EXTENSIONS_XKBSTR_H) check_include_files("X11/extensions/XKB.h" HAVE_XKB_EXTENSION) check_include_files("X11/extensions/XTest.h" HAVE_X11_EXTENSIONS_XTEST_H) check_include_files("${XKBlib}" HAVE_X11_XKBLIB_H) check_include_files("X11/extensions/XInput2.h" HAVE_XI2) if (HAVE_X11_EXTENSIONS_DPMS_H) # Assume that function prototypes declared, when include exists. set(HAVE_DPMS_PROTOTYPES 1) endif() if (NOT HAVE_X11_XKBLIB_H) message(FATAL_ERROR "Missing header: " ${XKBlib}) endif() check_library_exists("SM;ICE" IceConnectionNumber "" HAVE_ICE) check_library_exists("Xext;X11" DPMSQueryExtension "" HAVE_Xext) check_library_exists("Xtst;Xext;X11" XTestQueryExtension "" HAVE_Xtst) check_library_exists("Xinerama" XineramaQueryExtension "" HAVE_Xinerama) check_library_exists("Xi" XISelectEvents "" HAVE_Xi) check_library_exists("Xrandr" XRRQueryExtension "" HAVE_Xrandr) if (HAVE_ICE) # Assume we have SM if we have ICE. set(HAVE_SM 1) list(APPEND libs SM ICE) endif() if (HAVE_Xtst) # Xtxt depends on X11. set(HAVE_X11) list(APPEND libs Xtst X11) else() message(FATAL_ERROR "Missing library: Xtst") endif() if (HAVE_Xext) list(APPEND libs Xext) endif() if (HAVE_Xinerama) list(APPEND libs Xinerama) else (HAVE_Xinerama) if (HAVE_X11_EXTENSIONS_XINERAMA_H) set(HAVE_X11_EXTENSIONS_XINERAMA_H 0) message(WARNING "Old Xinerama implementation detected, disabled") endif() endif() if (HAVE_Xrandr) list(APPEND libs Xrandr) endif() endif() IF(HAVE_Xi) LIST(APPEND libs Xi) ENDIF() # For config.h, set some static values; it may be a good idea to make # these values dynamic for non-standard UNIX compilers. set(ACCEPT_TYPE_ARG3 socklen_t) set(HAVE_CXX_BOOL 1) set(HAVE_CXX_CASTS 1) set(HAVE_CXX_EXCEPTIONS 1) set(HAVE_CXX_MUTABLE 1) set(HAVE_CXX_STDLIB 1) set(HAVE_PTHREAD_SIGNAL 1) set(SELECT_TYPE_ARG1 int) set(SELECT_TYPE_ARG234 "(fd_set *)") set(SELECT_TYPE_ARG5 "(struct timeval *)") set(STDC_HEADERS 1) set(TIME_WITH_SYS_TIME 1) set(HAVE_SOCKLEN_T 1) # For config.h, save the results based on a template (config.h.in). configure_file(res/config.h.in ${root_dir}/config.h) add_definitions(-DSYSAPI_UNIX=1 -DHAVE_CONFIG_H) if (APPLE) add_definitions(-DWINAPI_CARBON=1 -D_THREAD_SAFE) else (APPLE) add_definitions(-DWINAPI_XWINDOWS=1) endif() else (UNIX) list(APPEND libs Wtsapi32 Userenv) add_definitions( /DWIN32 /D_WINDOWS /D_CRT_SECURE_NO_WARNINGS /DVERSION=\"${VERSION}\" ) if (MSVC_VERSION EQUAL 1600) set(SLN_FILENAME "${CMAKE_CURRENT_BINARY_DIR}/synergy.sln") if (EXISTS "${SLN_FILENAME}" ) file(APPEND "${SLN_FILENAME}" "\n# This should be regenerated!\n") endif() endif() endif() if (GAME_DEVICE_SUPPORT) add_definitions(-DGAME_DEVICE_SUPPORT) endif() if (VNC_SUPPORT) add_definitions(-DVNC_SUPPORT) endif() add_subdirectory(src) add_subdirectory(tools) if (WIN32) # add /analyze in order to unconver potential bugs in the source code # Details: http://msdn.microsoft.com/en-us/library/fwkeyyhe.aspx # add /FR to generate browse information (ncb files) usefull for using IDE #define _BIND_TO_CURRENT_CRT_VERSION 1 #define _BIND_TO_CURRENT_ATL_VERSION 1 #define _BIND_TO_CURRENT_MFC_VERSION 1 #define _BIND_TO_CURRENT_OPENMP_VERSION 1 # next line replaced the previous 4 ones: #define _BIND_TO_CURRENT_VCLIBS_VERSION 1; # compiler: /MP - use multi cores to compile # added _SECURE_SCL=1 for finding bugs with iterators - http://msdn.microsoft.com/en-us/library/aa985965.aspx # common args between all vs builds set(VS_ARGS "/FR /MP /D _BIND_TO_CURRENT_VCLIBS_VERSION=1 /D _SECURE_SCL=1 ${VS_ARGS_EXTRA}") # we may use `cmake -D VS_ARGS_EXTRA="/analyze"` for example to specify # analyze mode (since we don't always want to use it; e.g. on non-team # or non-x86 compiler editions where there's no support) set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} ${VS_ARGS}") set(CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS_DEBUG} ${VS_ARGS}") # this line removes "/D NDEBUG" from release, we want them in order to # find bugs even on release builds. set(CMAKE_CXX_FLAGS_RELEASE "/MD /O2 /Ob2") endif() if (CONF_CPACK) if (WIN32) message(FATAL_ERROR "CPack support for Windows has been removed.") endif() if (UNIX) if (APPLE) message(FATAL_ERROR "CPack support for Apple has been removed.") else () install(FILES bin/synergy DESTINATION bin PERMISSIONS OWNER_READ OWNER_WRITE OWNER_EXECUTE GROUP_READ GROUP_EXECUTE WORLD_READ WORLD_EXECUTE) # install gnome menu item install(FILES res/synergy.desktop DESTINATION share/applications) install(FILES res/synergy.ico DESTINATION share/icons) endif() endif() # The default CPack behaviour is not to append the system processor # type, which is undesirable in our case, since we want to support # both 32-bit and 64-bit processors. set(CPACK_SYSTEM_NAME ${CMAKE_SYSTEM_NAME}-${CMAKE_SYSTEM_PROCESSOR}) set(CPACK_PACKAGE_NAME "synergy") set(CPACK_PACKAGE_VENDOR "The Synergy Project") set(CPACK_PACKAGE_DESCRIPTION_SUMMARY "Synergy server and client") set(CPACK_PACKAGE_VERSION_MAJOR ${VERSION_MAJOR}) set(CPACK_PACKAGE_VERSION_MINOR ${VERSION_MINOR}) set(CPACK_PACKAGE_VERSION_PATCH ${VERSION_REV}) set(CPACK_PACKAGE_VERSION ${VERSION}) set(CPACK_PACKAGE_CONTACT http://synergy-foss.org/) set(CPACK_RESOURCE_FILE_LICENSE "${cmake_dir}/License.rtf") set(CPACK_RESOURCE_FILE_README "${cmake_dir}/Readme.txt") # Must be last (since it relies of CPACK_ vars). include(CPack) endif() if (CONF_DOXYGEN) set(VERSION, "${VERSION}") # For doxygen.cfg, save the results based on a template (doxygen.cfg.in). configure_file(${cmake_dir}/doxygen.cfg.in ${doc_dir}/doxygen.cfg) endif() if (${CMAKE_SYSTEM_NAME} MATCHES "IRIX") set_target_properties(synergys PROPERTIES LINK_FLAGS "-all -woff 33 -woff 84 -woff 15") set_target_properties(synergyc PROPERTIES LINK_FLAGS "-all -woff 33 -woff 84 -woff 15") set_target_properties(synergyd PROPERTIES LINK_FLAGS "-all -woff 33 -woff 84 -woff 15") endif() synergy-1.4.12-Source/COMPILE0000600000175000017500000000010011514217303015506 0ustar synergysynergySee: http://synergy-foss.org/pm/projects/synergy/wiki/Compiling synergy-1.4.12-Source/configure0000700000175000017500000000007011753214167016420 0ustar synergysynergycmake -G "Unix Makefiles" -DCMAKE_BUILD_TYPE=Release . synergy-1.4.12-Source/COPYING0000600000175000017500000003603012021261364015541 0ustar synergysynergysynergy -- mouse and keyboard sharing utility Copyright (C) 2012 Bolton Software Ltd. Copyright (C) 2008-2012 Nick Bolton Copyright (C) 2002-2012 Chris Schoeneman 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 synergy-1.4.12-Source/doc/0000700000175000017500000000000012140644175015256 5ustar synergysynergysynergy-1.4.12-Source/doc/MacReadme.txt0000700000175000017500000000136111517101665017640 0ustar synergysynergyMac OS X Readme =============== To install on Mac OS X with the .zip distribution (first seen in 1.3.6) you must follow these steps: 1. Extract the zip file to any location (usually double click will do this) 2. Open Terminal, and cd to the extracted directory (e.g. /Users/my-name/Downloads/extracted-dir/) 3. Change to super user (use the su command) 4. Copy the binaries to /usr/bin using: cp synergy* /usr/bin How to enable the root user in Mac OS X: http://support.apple.com/kb/ht1528 Once the binaries have been copied to /usr/bin, you should follow the configuration guide: http://synergy2.sourceforge.net/configuration.html If you have any problems, see the [[Support]] page: http://synergy-foss.org/support synergy-1.4.12-Source/doc/org.synergy-foss.org.synergyc.plist0000600000175000017500000000131411674770713024233 0ustar synergysynergy Label org.synergy-foss.org.synergyc.plist OnDemand ProgramArguments /usr/bin/synergyc 192.168.0.2 RunAtLoad synergy-1.4.12-Source/doc/org.synergy-foss.org.synergys.plist0000600000175000017500000000150411514640634024243 0ustar synergysynergy Label org.synergy-foss.org.synergys.plist OnDemand ProgramArguments /usr/bin/synergys --no-daemon --config /Users/snorp/.synergy.conf RunAtLoad synergy-1.4.12-Source/doc/synergy.conf.example0000600000175000017500000000143111517101665021257 0ustar synergysynergy# sample synergy configuration file # # comments begin with the # character and continue to the end of # line. comments may appear anywhere the syntax permits. section: screens # three hosts named: moe, larry, and curly moe: larry: curly: end section: links # larry is to the right of moe and curly is above moe moe: right = larry up = curly # moe is to the left of larry and curly is above larry. # note that curly is above both moe and larry and moe # and larry have a symmetric connection (they're in # opposite directions of each other). larry: left = moe up = curly # larry is below curly. if you move up from moe and then # down, you'll end up on larry. curly: down = larry end section: aliases # curly is also known as shemp curly: shemp end synergy-1.4.12-Source/doc/synergy.conf.example-advanced0000600000175000017500000000331511517101665023025 0ustar synergysynergy# sample synergy configuration file # # comments begin with the # character and continue to the end of # line. comments may appear anywhere the syntax permits. # This example uses 3 computers. A laptop and two desktops (one a mac) # They are arranged in the following configuration with Desktop1 acting as the server # Desktop 2 has 3 screens arranged around desktop1 # # +--------+ +---------+ # |Desktop2| |Desktop2 | # | | | | # +--------+ +---------+ # +-------+ +--------+ +---------+ # |Laptop | |Desktop1| |Desktop2 | # | | | | | | # +-------+ +--------+ +---------+ # # The laptop comes and goes but that doesn't really affect this configuration # The screens section is for the logical or short name of the computers section: screens # three computers that are logically named: desktop1, desktop2, and laptop desktop1: desktop2: laptop: end section: links # larry is to the right of moe and curly is above moe moe: right = larry up = curly # moe is to the left of larry and curly is above larry. # note that curly is above both moe and larry and moe # and larry have a symmetric connection (they're in # opposite directions of each other). larry: left = moe up = curly # larry is below curly. if you move up from moe and then # down, you'll end up on larry. curly: down = larry end # The aliases section is to map the full names of the computers to their logical names used in the screens section # One way to find the actual name of a comptuer is to run hostname from a command window section: aliases # Laptop is actually known as John-Smiths-MacBook-3.local desktop2: John-Smiths-MacBook-3.local end synergy-1.4.12-Source/doc/synergy.conf.example-basic0000600000175000017500000000214011517101665022334 0ustar synergysynergy# sample synergy configuration file # # comments begin with the # character and continue to the end of # line. comments may appear anywhere the syntax permits. # +-------+ +--------+ +---------+ # |Laptop | |Desktop1| |iMac | # | | | | | | # +-------+ +--------+ +---------+ section: screens # three hosts named: Laptop, Desktop1, and iMac # These are the nice names of the hosts to make it easy to write the config file # The aliases section below contain the "actual" names of the hosts (their hostnames) Laptop: Desktop1: iMac: end section: links # iMac is to the right of Desktop1 # Laptop is to the left of Desktop1 Desktop1: right = iMac left = Laptop # Desktop1 is to the right of Laptop Laptop: right = Desktop1 # Desktop1 is to the left of iMac iMac: left = Desktop1 end section: aliases # The "real" name of iMac is John-Smiths-iMac-3.local. If we wanted we could remove this alias and instead use John-Smiths-iMac-3.local everywhere iMac is above. Hopefully it should be easy to see why using an alias is nicer iMac: John-Smiths-iMac-3.local end synergy-1.4.12-Source/doc/synergyc.man0000600000175000017500000000304111514640634017616 0ustar synergysynergy.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH SYNERGYC "1" "June 2010" "synergyc 1.5.0, protocol version 1.3" "User Commands" .SH NAME synergyc \- manual page for synergyc 1.5.0, protocol version 1.3 .SH SYNOPSIS .B synergyc [\fI--yscroll \fR] [\fI--daemon|--no-daemon\fR] [\fI--name \fR] [\fI--restart|--no-restart\fR] [\fI--debug \fR] \fI\fR .SH DESCRIPTION Connect to a synergy mouse/keyboard sharing server. .TP \fB\-d\fR, \fB\-\-debug\fR filter out log messages with priority below level. level may be: FATAL, ERROR, WARNING, NOTE, INFO, DEBUG, DEBUGn (1\-5). .TP \fB\-n\fR, \fB\-\-name\fR use screen\-name instead the hostname to identify this screen in the configuration. .TP \fB\-1\fR, \fB\-\-no\-restart\fR do not try to restart on failure. .PP * \fB\-\-restart\fR restart the server automatically if it fails. .TP \fB\-l\fR \fB\-\-log\fR write log messages to file. .TP \fB\-f\fR, \fB\-\-no\-daemon\fR run in the foreground. .PP * \fB\-\-daemon\fR run as a daemon. .TP \fB\-\-yscroll\fR defines the vertical scrolling delta, which is .TP \fB\-h\fR, \fB\-\-help\fR display this help and exit. .TP \fB\-\-version\fR display version information and exit. .PP * marks defaults. .PP The server address is of the form: [][:]. The hostname must be the address or hostname of the server. The port overrides the default port, 24800. .SH COPYRIGHT Copyright \(co 2010 Chris Schoeneman, Nick Bolton, Sorin Sbarnea synergy-1.4.12-Source/doc/synergys.man0000600000175000017500000000356611514640634017652 0ustar synergysynergy.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH SYNERGYS "1" "June 2010" "synergys 1.5.0, protocol version 1.3" "User Commands" .SH NAME synergys \- manual page for synergys 1.5.0, protocol version 1.3 .SH SYNOPSIS .B synergys [\fI--address
\fR] [\fI--config \fR] [\fI--daemon|--no-daemon\fR] [\fI--name \fR] [\fI--restart|--no-restart\fR] [\fI--debug \fR] .SH DESCRIPTION Start the synergy mouse/keyboard sharing server. .TP \fB\-a\fR, \fB\-\-address\fR
listen for clients on the given address. .TP \fB\-c\fR, \fB\-\-config\fR use the named configuration file instead. .TP \fB\-d\fR, \fB\-\-debug\fR filter out log messages with priority below level. level may be: FATAL, ERROR, WARNING, NOTE, INFO, DEBUG, DEBUGn (1\-5). .TP \fB\-n\fR, \fB\-\-name\fR use screen\-name instead the hostname to identify this screen in the configuration. .TP \fB\-1\fR, \fB\-\-no\-restart\fR do not try to restart on failure. .PP * \fB\-\-restart\fR restart the server automatically if it fails. .TP \fB\-l\fR \fB\-\-log\fR write log messages to file. .TP \fB\-f\fR, \fB\-\-no\-daemon\fR run in the foreground. .PP * \fB\-\-daemon\fR run as a daemon. .TP \fB\-h\fR, \fB\-\-help\fR display this help and exit. .TP \fB\-\-version\fR display version information and exit. .PP * marks defaults. .PP The argument for \fB\-\-address\fR is of the form: [][:]. The hostname must be the address or hostname of an interface on the system. The default is to listen on all interfaces. The port overrides the default port, 24800. .PP If no configuration file pathname is provided then the first of the following to load successfully sets the configuration: .IP $HOME/.synergy.conf /etc/synergy.conf .SH COPYRIGHT Copyright \(co 2010 Chris Schoeneman, Nick Bolton, Sorin Sbarnea synergy-1.4.12-Source/hm.cmd0000600000175000017500000000005611273646171015611 0ustar synergysynergy@echo off python hm.py %* exit /b %errorlevel%synergy-1.4.12-Source/hm.py0000600000175000017500000001345612127372004015474 0ustar synergysynergy#! /usr/bin/env python # synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . # hm.py: 'Help Me', is a simple wrapper for all build tools. # # This script was created for the Synergy project. # http://synergy-foss.org/ # # The idea behind this is to simplify the build system, # however, it's not a dependancy of building Synergy. # In other words, you don't need to use this script! # # If you don't wish to run this script, simply run: # cmake . # make # This will create an in-source UNIX Makefile. import sys, os sys.path.append('tools') # if old build src dir exists, move it, as this will now be used for build # output. if os.path.exists('build/toolchain.py'): print "Removing legacy build dir." os.rename('build', 'build.old') from build import toolchain from getopt import gnu_getopt # minimum required version. # 2.6 needed for ZipFile.extractall. # do not change to 2.7, as the build machines are still at 2.6 # and are a massive pain in the ass to upgrade. requiredMajor = 2 requiredMinor = 6 # options used by all commands globalOptions = 'v' globalOptionsLong = ['no-prompts', 'generator=', 'verbose', 'make-gui'] # list of valid commands as keys. the values are optarg strings, but most # are None for now (this is mainly for extensibility) cmd_opt_dict = { 'about' : ['', []], 'setup' : ['g:', []], 'configure' : ['g:dr', ['debug', 'release', 'game-device', 'vnc', 'mac-sdk=']], 'build' : ['dr', ['debug', 'release']], 'clean' : ['dr', ['debug', 'release']], 'update' : ['', []], 'install' : ['', []], 'doxygen' : ['', []], 'dist' : ['', ['vcredist-dir=', 'qt-dir=']], 'distftp' : ['', ['host=', 'user=', 'pass=', 'dir=']], 'kill' : ['', []], 'usage' : ['', []], 'revision' : ['', []], 'reformat' : ['', []], 'open' : ['', []], 'genlist' : ['', []], 'reset' : ['', []], 'signwin' : ['', ['pfx=', 'pwd=', 'dist']], 'signmac' : ['', ['identity=']] } # aliases to valid commands cmd_alias_dict = { 'info' : 'about', 'help' : 'usage', 'package' : 'dist', 'docs' : 'doxygen', 'make' : 'build', 'cmake' : 'configure', } def complete_command(arg): completions = [] for cmd, optarg in cmd_opt_dict.iteritems(): # if command was matched fully, return only this, so that # if `dist` is typed, it will return only `dist` and not # `dist` and `distftp` for example. if cmd == arg: return [cmd,] if cmd.startswith(arg): completions.append(cmd) for alias, cmd in cmd_alias_dict.iteritems(): # don't know if this will work just like above, but it's # probably worth adding. if alias == arg: return [alias,] if alias.startswith(arg): completions.append(alias) return completions def start_cmd(argv): cmd_arg = '' if len(argv) > 1: cmd_arg = argv[1] # change common help args to help command if cmd_arg in ('--help', '-h', '--usage', '-u', '/?'): cmd_arg = 'usage' completions = complete_command(cmd_arg) if cmd_arg and len(completions) > 0: if len(completions) == 1: # get the only completion (since in this case we have 1) cmd = completions[0] # build up the first part of the map (for illustrative purposes) cmd_map = list() if cmd_arg != cmd: cmd_map.append(cmd_arg) cmd_map.append(cmd) # map an alias to the command, and build up the map if cmd in cmd_alias_dict.keys(): alias = cmd if cmd_arg == cmd: cmd_map.append(alias) cmd = cmd_alias_dict[cmd] cmd_map.append(cmd) # show command map to avoid confusion if len(cmd_map) != 0: print 'Mapping command: %s' % ' -> '.join(cmd_map) run_cmd(cmd, argv[2:]) return 0 else: print ( 'Command `%s` too ambiguous, ' 'could mean any of: %s' ) % (cmd_arg, ', '.join(completions)) else: if len(argv) == 1: print 'No command specified, showing usage.\n' else: print 'Command not recognised: %s\n' % cmd_arg run_cmd('usage') # generic error code if not returned sooner return 1 def run_cmd(cmd, argv = []): verbose = False try: options_pair = cmd_opt_dict[cmd] options = globalOptions + options_pair[0] options_long = [] options_long.extend(globalOptionsLong) options_long.extend(options_pair[1]) opts, args = gnu_getopt(argv, options, options_long) for o, a in opts: if o in ('-v', '--verbose'): verbose = True # pass args and optarg data to command handler, which figures out # how to handle the arguments handler = toolchain.CommandHandler(argv, opts, args, verbose) # use reflection to get the function pointer cmd_func = getattr(handler, cmd) cmd_func() except: if not verbose: # print friendly error for users sys.stderr.write('Error: ' + sys.exc_info()[1].__str__() + '\n') sys.exit(1) else: # if user wants to be verbose let python do it's thing raise def main(argv): if sys.version_info < (requiredMajor, requiredMinor): print ('Python version must be at least ' + str(requiredMajor) + '.' + str(requiredMinor) + ', but is ' + str(sys.version_info[0]) + '.' + str(sys.version_info[1])) sys.exit(1) try: start_cmd(argv) except KeyboardInterrupt: print '\n\nUser aborted, exiting.' # Start the program. main(sys.argv) synergy-1.4.12-Source/hm.sh0000700000175000017500000000004011407213524015441 0ustar synergysynergy#! /bin/bash python hm.py "$@" synergy-1.4.12-Source/INSTALL0000600000175000017500000000007411514217303015536 0ustar synergysynergySee: http://synergy-foss.org/pm/projects/synergy/wiki/Setup synergy-1.4.12-Source/README0000600000175000017500000000104711514217303015366 0ustar synergysynergySee: http://synergy-foss.org/pm/projects/synergy/wiki/Readme Announcement | 2009-08-04 ========================= We have recently switched to CMake, to replace Automake. Plese read the Compiling wiki page for help with CMake: http://synergy-foss.org/pm/projects/synergy/wiki/Compiling Linux/Mac --------- Instead of using the traditional GNU style `./configure; make` commands, you will now need to use CMake. Windows ------- Instead of using the VS2005 and VS2008 directories, you now need to generate the Visual Studio project files using CMake. synergy-1.4.12-Source/res/0000700000175000017500000000000012140644175015302 5ustar synergysynergysynergy-1.4.12-Source/res/config.h.in0000600000175000017500000001433011675114350017327 0ustar synergysynergy/* Define version here for Unix, but using /D for Windows. */ #cmakedefine VERSION "${VERSION}" /* Define to the base type of arg 3 for `accept`. */ #cmakedefine ACCEPT_TYPE_ARG3 ${ACCEPT_TYPE_ARG3} /* Define if your compiler has bool support. */ #cmakedefine HAVE_CXX_BOOL ${HAVE_CXX_BOOL} /* Define if your compiler has C++ cast support. */ #cmakedefine HAVE_CXX_CASTS ${HAVE_CXX_CASTS} /* Define if your compiler has exceptions support. */ #cmakedefine HAVE_CXX_EXCEPTIONS ${HAVE_CXX_EXCEPTIONS} /* Define if your compiler has mutable support. */ #cmakedefine HAVE_CXX_MUTABLE ${HAVE_CXX_MUTABLE} /* Define if your compiler has standard C++ library support. */ #cmakedefine HAVE_CXX_STDLIB ${HAVE_CXX_STDLIB} /* Define if the header file declares function prototypes. */ #cmakedefine HAVE_DPMS_PROTOTYPES ${HAVE_DPMS_PROTOTYPES} /* Define if you have a working `getpwuid_r` function. */ #cmakedefine HAVE_GETPWUID_R ${HAVE_GETPWUID_R} /* Define to 1 if you have the `gmtime_r` function. */ #cmakedefine HAVE_GMTIME_R ${HAVE_GMTIME_R} /* Define if you have the `inet_aton` function. */ #cmakedefine HAVE_INET_ATON ${HAVE_INET_ATON} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_INTTYPES_H ${HAVE_INTTYPES_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_ISTREAM ${HAVE_ISTREAM} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_LOCALE_H ${HAVE_LOCALE_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_MEMORY_H ${HAVE_MEMORY_H} /* Define if you have the `nanosleep` function. */ #cmakedefine HAVE_NANOSLEEP ${HAVE_NANOSLEEP} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_OSTREAM ${HAVE_OSTREAM} /* Define if you have the `poll` function. */ #cmakedefine HAVE_POLL ${HAVE_POLL} /* Define if you have a POSIX `sigwait` function. */ #cmakedefine HAVE_POSIX_SIGWAIT ${HAVE_POSIX_SIGWAIT} /* Define if you have POSIX threads libraries and header files. */ #cmakedefine HAVE_PTHREAD ${HAVE_PTHREAD} /* Define if you have `pthread_sigmask` and `pthread_kill` functions. */ #cmakedefine HAVE_PTHREAD_SIGNAL ${HAVE_PTHREAD_SIGNAL} /* Define if your compiler defines socklen_t. */ #cmakedefine HAVE_SOCKLEN_T ${HAVE_SOCKLEN_T} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SSTREAM ${HAVE_SSTREAM} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_STDINT_H ${HAVE_STDINT_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_STDLIB_H ${HAVE_STDLIB_H} /* Define to 1 if you have the `strftime` function. */ #cmakedefine HAVE_STRFTIME ${HAVE_STRFTIME} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_STRINGS_H ${HAVE_STRINGS_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_STRING_H ${HAVE_STRING_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_SELECT_H ${HAVE_SYS_SELECT_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_SOCKET_H ${HAVE_SYS_SOCKET_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_STAT_H ${HAVE_SYS_STAT_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_TIME_H ${HAVE_SYS_TIME_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_TYPES_H ${HAVE_SYS_TYPES_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_SYS_UTSNAME_H ${HAVE_SYS_UTSNAME_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_UNISTD_H ${HAVE_UNISTD_H} /* Define to 1 if you have the `vsnprintf` function. */ #cmakedefine HAVE_VSNPRINTF ${HAVE_VSNPRINTF} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_WCHAR_H ${HAVE_WCHAR_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_EXTENSIONS_XRANDR_H ${HAVE_X11_EXTENSIONS_XRANDR_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_EXTENSIONS_DPMS_H ${HAVE_X11_EXTENSIONS_DPMS_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_EXTENSIONS_XINERAMA_H ${HAVE_X11_EXTENSIONS_XINERAMA_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_EXTENSIONS_XKBSTR_H ${HAVE_X11_EXTENSIONS_XKBSTR_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_EXTENSIONS_XTEST_H ${HAVE_X11_EXTENSIONS_XTEST_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_X11_XKBLIB_H ${HAVE_X11_XKBLIB_H} /* Define to 1 if you have the header file. */ #cmakedefine HAVE_XI2 ${HAVE_XI2} /* Define this if the XKB extension is available. */ #cmakedefine HAVE_XKB_EXTENSION ${HAVE_XKB_EXTENSION} /* Define to necessary symbol if this constant uses a non-standard name on your system. */ #cmakedefine PTHREAD_CREATE_JOINABLE ${PTHREAD_CREATE_JOINABLE} /* Define to the type of arg 1 for `select`. */ #cmakedefine SELECT_TYPE_ARG1 ${SELECT_TYPE_ARG1} /* Define to the type of args 2, 3 and 4 for `select`. */ #cmakedefine SELECT_TYPE_ARG234 ${SELECT_TYPE_ARG234} /* Define to the type of arg 5 for `select`. */ #cmakedefine SELECT_TYPE_ARG5 ${SELECT_TYPE_ARG5} /* The size of `char`, as computed by sizeof. */ #cmakedefine SIZEOF_CHAR ${SIZEOF_CHAR} /* The size of `int`, as computed by sizeof. */ #cmakedefine SIZEOF_INT ${SIZEOF_INT} /* The size of `long`, as computed by sizeof. */ #cmakedefine SIZEOF_LONG ${SIZEOF_LONG} /* The size of `short`, as computed by sizeof. */ #cmakedefine SIZEOF_SHORT ${SIZEOF_SHORT} /* Define to 1 if you have the ANSI C header files. */ #cmakedefine STDC_HEADERS ${STDC_HEADERS} /* Define to 1 if you can safely include both and . */ #cmakedefine TIME_WITH_SYS_TIME ${TIME_WITH_SYS_TIME} /* Define to 1 if your declares `struct tm`. */ #cmakedefine TM_IN_SYS_TIME ${TM_IN_SYS_TIME} /* Define to 1 if the X Window System is missing or not being used. */ #cmakedefine X_DISPLAY_MISSING ${X_DISPLAY_MISSING} /* Define to `unsigned int` if does not define. */ #cmakedefine size_t ${size_t} synergy-1.4.12-Source/res/DefineIfExist.nsh0000600000175000017500000000216712000631423020475 0ustar synergysynergy; synergy -- mouse and keyboard sharing utility ; Copyright (C) 2012 Nick Bolton ; ; This package is free software; you can redistribute it and/or ; modify it under the terms of the GNU General Public License ; found in the file COPYING that should have accompanied this file. ; ; This package 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 . !macro !defineifexist _VAR_NAME _FILE_NAME !tempfile _TEMPFILE !ifdef NSIS_WIN32_MAKENSIS ; Windows - cmd.exe !system 'if exist "${_FILE_NAME}" echo !define ${_VAR_NAME} > "${_TEMPFILE}"' !else ; Posix - sh !system 'if [ -e "${_FILE_NAME}" ]; then echo "!define ${_VAR_NAME}" > "${_TEMPFILE}"; fi' !endif !include '${_TEMPFILE}' !delfile '${_TEMPFILE}' !undef _TEMPFILE !macroend !define !defineifexist "!insertmacro !defineifexist" synergy-1.4.12-Source/res/doxygen.cfg.in0000600000175000017500000020522511757022520020052 0ustar synergysynergy# Doxyfile 1.7.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 a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "Synergy" # 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 = "${VERSION}" # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc/doxygen # 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-Cyrilic, 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 = NO # 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. 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 is your file systems # 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 = # 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 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 make 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 to 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 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 penality. # 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 rougly 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 #--------------------------------------------------------------------------- # 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_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 namespace 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 # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define 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 defines 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 # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # 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. The 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 = #--------------------------------------------------------------------------- # 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 = YES # 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 = NO # 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 # This WARN_NO_PARAMDOC option can be abled 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 = # 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++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.cpp \ *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = YES # The EXCLUDE tag can be used to specify files and/or directories that should # 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. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem 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 = */.svn/* \ */.git/* \ */tools/* \ */src/vnc/* \ */src/gui/* \ */src/test/guitests/debug/moc_* \ */src/test/guitests/release/moc_* \ */src/qsynergy-build-desktop/* # 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, INPUT_FILTER # is applied to all files. 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 #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = 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 and C++ 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 = 3 # 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 = # 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. 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 the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. # Doxygen will adjust the colors in the stylesheet 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_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = 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. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # 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 at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # 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. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # 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 # 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 = NO # When the SERVER_BASED_SEARCH tag is enabled the search engine will be # implemented using a PHP enabled web server instead of at the web client # using Javascript. Doxygen will generate the search PHP script and index # file to put on the web server. The advantage of the server # based approach is that it scales better to large projects and allows # full text search. The disadvances is that it is more difficult to setup # and does not have live searching capabilities. SERVER_BASED_SEARCH = NO #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = # 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, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # 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 = # 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 = NO # 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 = NO # 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 #--------------------------------------------------------------------------- # 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 = # 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 stylesheet 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 = # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = # 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 = YES # 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 # in the INCLUDE_PATH (see below) will be search if 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. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and 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. # Optionally an initial location of the external documentation # can be added for each tagfile. 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. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # 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 = #--------------------------------------------------------------------------- # 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 is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = NO # 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 = @HAVE_DOT@ # 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 write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need 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 = FreeSans.ttf # 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 output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. 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 # 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 set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # 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 graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES 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 png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # 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 DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES synergy-1.4.12-Source/res/Installer.nsi.in0000600000175000017500000000162511775150300020360 0ustar synergysynergy; synergy -- mouse and keyboard sharing utility ; Copyright (C) 2012 Nick Bolton ; ; This package is free software; you can redistribute it and/or ; modify it under the terms of the GNU General Public License ; found in the file COPYING that should have accompanied this file. ; ; This package 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 . ; template variables !define version ${in:version} !define arch ${in:arch} !define vcRedistDir ${in:vcRedistDir} !define qtDir ${in:qtDir} !define installDirVar ${in:installDirVar} !addincludedir ..\res !include "synergy.nsh" synergy-1.4.12-Source/res/License.rtf0000600000175000017500000004030111271252675017405 0ustar synergysynergy{\rtf1\ansi\ansicpg1252\cocoartf949\cocoasubrtf460 {\fonttbl\f0\fswiss\fcharset0 Helvetica;\f1\froman\fcharset0 Times-Roman;} {\colortbl;\red255\green255\blue255;} {\info {\title Original file was gpl-2.0.tex} {\doccomm Created using latex2rtf 1.9.19a on Sun Jul 12 19:21:22 2009}}\paperw12280\paperh15900\margl2680\margr2700\margb1760\margt2540\vieww12280\viewh15900\viewkind1 \deftab720 \pard\pardeftab720\ri0\qj \f0\fs24 \cf0 \ \pard\pardeftab720\ri0\qc \f1\fs30 \cf0 GNU GENERAL PUBLIC LICENSE \f0\fs24 \ \ \ \pard\pardeftab720\ri0\qc \f1 \cf0 Version 2, June 1991\ \ \ Copyright \'a9 1989, 1991 Free Software Foundation, Inc.\ \pard\pardeftab720\ri0\sb240\qc \cf0 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA\ \pard\pardeftab720\ri0\qc \cf0 Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. \ \pard\pardeftab720\ri0\qc \b\fs26 \cf0 Preamble \b0\fs24 \ \pard\pardeftab720\ri0\qj \cf0 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\'97to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation\'92s software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library 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\'92s 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\'92 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\'92s free use or not licensed at all.\ The precise terms and conditions for copying, distribution and modification follow.\ \pard\pardeftab720\ri0\qc \fs31 \cf0 Terms and Conditions For Copying, Distribution and Modification \fs24 \ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 1. 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 \'93Program\'94, below, refers to any such program or work, and a \'93work based on the Program\'94 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 \'93modification\'94.) Each licensee is addressed as \'93you\'94.\ \pard\pardeftab720\li600\ri0\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 2. You may copy and distribute verbatim copies of the Program\'92s 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.\ \pard\pardeftab720\li600\ri0\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 3. 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:\ \pard\pardeftab720\li1200\fi-300\ri0\sb50\qj \cf0 (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.)\ \pard\pardeftab720\li600\ri0\sb100\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 4. 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:\ \pard\pardeftab720\li1200\fi-300\ri0\sb50\qj \cf0 (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.)\ \pard\pardeftab720\li600\ri0\sb100\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 5. 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.\ 6. 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.\ 7. 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\'92 exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License.\ 8. 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.\ \pard\pardeftab720\li600\ri0\qj \cf0 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 9. 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.\ 10. 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.\ \pard\pardeftab720\li600\ri0\qj \cf0 Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and \'93any later version\'94, 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.\ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 11. 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.\ \pard\pardeftab720\li600\ri0\qc \fs31 \cf0 No Warranty \fs24 \ \pard\pardeftab720\li600\fi-300\ri0\sb50\qj \cf0 12. 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 \'93as is\'94 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. \f0 \ \f1 13. 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. \f0 \ \pard\pardeftab720\ri0\sb100\qc \f1\fs31 \cf0 End of Terms and Conditions \fs24 }synergy-1.4.12-Source/res/License.tex0000600000175000017500000004400511271252675017417 0ustar synergysynergy\documentclass[11pt]{article} \title{GNU GENERAL PUBLIC LICENSE} \date{Version 2, June 1991} \begin{document} \maketitle \begin{center} {\parindent 0in Copyright \copyright\ 1989, 1991 Free Software Foundation, Inc. \bigskip 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA \bigskip Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. } \end{center} \begin{center} {\bf\large Preamble} \end{center} 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 Library 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. \begin{center} {\Large \sc Terms and Conditions For Copying, Distribution and Modification} \end{center} %\renewcommand{\theenumi}{\alpha{enumi}} \begin{enumerate} \addtocounter{enumi}{-1} \item 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. \item 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. \item 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: \begin{enumerate} \item You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. \item 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. \item 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.) \end{enumerate} 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. \item 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: \begin{enumerate} \item 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, \item 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, \item 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.) \end{enumerate} 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. \item 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. \item 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. \item 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. \item 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. \item 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. \item 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. \item 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. \begin{center} {\Large\sc No Warranty } \end{center} \item {\sc 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.} \item {\sc 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{enumerate} \begin{center} {\Large\sc End of Terms and Conditions} \end{center} \pagebreak[2] \section*{Appendix: 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. \begin{quote} one line to give the program's name and a brief 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. \end{quote} 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: \begin{quote} Gnomovision version 69, Copyright (C) yyyy 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. \end{quote} The hypothetical commands {\tt show w} and {\tt show c} should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than {\tt show w} and {\tt 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: \begin{quote} 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 \end{quote} 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 Library General Public License instead of this License. \end{document} synergy-1.4.12-Source/res/Readme.txt0000600000175000017500000000046511514217303017240 0ustar synergysynergyThank you for chosing Synergy! http://synergy-foss.org/ Synergy allows you to share your keyboard and mouse between computers over a network. For FAQ, setup, and usage instructions, please visit our online Readme: http://synergy-foss.org/pm/projects/synergy/wiki/Readme Have fun! Thanks, The Synergy Team synergy-1.4.12-Source/res/ShellExecAsUser.dll0000600000175000017500000001600012004774603020774 0ustar synergysynergyMZÿÿ¸@º´ Í!¸LÍ!This program cannot be run in DOS mode. $¢Z}|æ;/æ;/æ;/e'/ç;/‰$/â;/‰$/ä;/ïC€/ä;/%4L/ä;/æ;/×;/%4N/ë;/Ð/ç;/Ð/ç;//ç;/Richæ;/PEL”–…Nà!  ¡ P€%Vø ´@  Ô.textD   `.rdataÖ @@.dataÜ0@À.relocª@@BU‹ìì”…lÿÿÿÇ…lÿÿÿ”Pÿ@ …Àtƒ½|ÿÿÿuƒ½pÿÿÿrjXÉÃ3ÀÉÃéh,0h 0ÿ$ Pÿ8 £¨2ÃU‹ìƒì VEøW3ÿPj¾@€‰}øÿ Pÿ …ÀtCEô‰}üPEüjPj‰}ôÿuøÿ …Àt3À9}ü”À‹ð‹E;Çt 3É9}ü•Á‰ÿuøÿ ‹Æ_^ÉÃ|$uNƒ= 2tEV‹5 h\0ÿÖjjh ÿ5¬2ÿ” jÿÿ5 2ÿ ÿ5 2ÿ h<0ÿÖ^3ÀÃU‹ìƒì0V3öj0EÐVPèh¡¤2ƒÄ ‰EäEÐPÇEø„0ÇEØ‹ÇEÐ0ÿ  ÿu·ÀÿuäVjýVVVVVh¸2PVÿ ^ÉÃU‹ì‹E HtiHt\-t"Htÿuÿuÿu ÿuÿ¬ ]Ãÿuÿ° ëMVjëÿuÿ´ ‹uÿ¶8Ž6QN2QVPè*VèÁƒÄ^ëjÿ¸ ë‹Eÿ0jëÿuÿœ 3À]ÃU‹ìƒì@SV‹u3Û;óWu2ÀéÄjÿÿu迉E‹E Y;ÃYf‰]Ðf‰]àt 8t PMÐèÝ‹E;Ãt 8t PMàèɃ}ÿf‰]Àf‰]ðt ÿuMðè1‹ƒìuð‹ü¥¥¥¥ƒìuЋüƒì¥¥¥¥uÀ‹ü¥¥¥¥ƒìuà‹ü¥ÿu¥ÿu¥¥ÿP|‹5p ‹Ø÷ÛEðÛPþÃÿÖEÀPÿÖEàPÿÖEÐPÿÖÿuÿx ŠÃ_^[ÉÃU‹ìSV3ÛWSSÿu ‹= ÿuSSÿ׋ðNVSÿt ;ÉE t VPjÿÿuSSÿ׋E _^[]ÃU‹ìSVW‹ùWÿp 3Û;Ã}fÇ ‰G9]fÇt/ÿuÿ ‹ðF6ƒÀ$üèN‹ÜVSjÿÿu3Àf‰PPÿ Sÿl …À‰Gu9Et fÇ ÇG€eô‹Ç_^[]ÂV‹ñfƒ>tVÿp …À}fÇ ‰FfÇ‹D$‰F‹Æ^ÂU‹ììp‹ES£°2‹E £À2‹E£Ä2‹E3ÛV9´2W£È2ux‹Ej^hÓ‰5´2ÿ5¤2ÿP èÊûÿÿ…ÀtJSè!üÿÿ…ÀYu?SSVSÿ< ‹ðSSVh›SSÿT ƒÄ;ã 2t jÿVÿ Vÿ hè0ëh 0ÿ 9¬2th<èOY‹ðëµúÿÿVè¶F2Pè­¾6Wè¡EÌPè˜EÌPèEY‰†8‹ ¬2;ËtVSh Qÿ” ëPŠöØÀS#ÇPF2PŠöØÀ#ÆPSÿ€ _^[ÉÃU‹ìƒì(‹EVW€8t`ƒeèÇEìT1ÇEðD1ÇEô01ÇEø1ÇEü1ÇEØ ÇEÜÇEàÇEä3ÿuìÿ6ÿuÿ( …ÀtGƒÆƒÿrèjX_^ÉËD½ØëöU‹ìƒì SW3ÿWÿÄ EüP襋Y;ßt‹SÿP‹Eü;Çt‹PÿQ;߸¸1u¸ˆ1Pÿ ;ßt Sè=ûÿÿY£¬2ÿuÿ, 9=¬2t2V‹5˜ WWEàWPÿÖ…À~EàPÿ¤ EàPÿ¨ WWEàWPëÝ^;ßt‹SÿPÿÈ hd1ÿ _3À[ÉÂU‹ìì”VEðWP3öhH2jVhè ‰uðÿÌ …ÀŒ’‹EðUøRUàjRUÐjRUЉuøf‰uЋRPÿQ<;Æ…6Eü‰uüPh82hØ ÿuøÿˆ …ÀŒ‹EüUì‰uìR‹PÿQ<‹EìUèR‰uè‹h(2VPÿQ<…ÀŒ½‹Eè‰uô;Æ„¼‹UôRh2Pÿ‹Eô;Æ„–Uä‰uä‹RPÿQ…À|k‹}‹Eä;Ɖ7t‹Wh2Pÿ‹Eä;Æt‹PÿQ‹Eô;Æt‹PÿQ‹Eè;Æt‹PÿQ‹Eì;Æt‹PÿQ‹Eü;Æt‹PÿQ‹Eø;Æ„€‹PÿQëx‹Eä;Æt‹PÿQ‹Eô;Æt‹PÿQ‹Eè;Æt‹PÿQ‹Eì;Æt‹PÿQ‹Eü;Æt+‹PÿQë#P…lÿÿÿhØ1Pÿ¼ ƒÄ …lÿÿÿPÿ ‹Eø;Æt‹PÿQ‹}‰7‹Eð;Æt‹PÿQ‹Ç_^ÉÃ|$uh|2ÿ ‹D$£¤2ëƒ|$u hX2ÿ jX ¡Ä2V…Àt/‹0…öt)ƒ|$tFPÿt$ ÿ4 ¡Ä2‹V‰ÿ0 3ÀëjX^Âÿ%` ÿ%\ ÌÌÌÌÌÌÌÌÌÌÌÌQ=L$ré-…=sì+È‹Ä…‹á‹‹@PÃÌÿ%X ‹D$…Àu9¼2~.ÿ ¼2‹ d ƒø‹ ‰ Ì2u?h€ÿH …ÀY£Ô2u3Àëfƒ ¡Ô2h0h0£Ð2èêÿ¼2YYë=…Àu9¡Ô2…Àt0‹ Ð2Vqü;ðr‹…ÉtÿÑ¡Ô2ƒîëêPÿP ƒ%Ô2Y^jX U‹ìS‹]V‹u W‹}…öu ƒ=¼2ë&ƒþtƒþu"¡Ø2…Àt WVSÿÐ…Àt WVSèÿÿÿ…Àu3ÀëNWVSèBþÿÿƒþ‰E u …Àu7WPSèñþÿÿ…ötƒþu&WVSèàþÿÿ…Àu!E ƒ} t¡Ø2…ÀtWVSÿЉE ‹E _^[] ÿ%L R$h$¶"Ê"Ø"î"##¢"6#B#N#\#"&#€"\%P%H%*%% %%f%€ €€€Š$°€†#v#,$¬#˜#$$ò#â#Ð#¾#:$¸$¦$È$@¾–L\‘ϙӪJè7rY ›¨öϤB É 9¸!h# <"F$ ¬!|$ ,"š$€ p"Ü$Ä "æ$l 4"ô$ˆ ô!<%H R$h$¶"Ê"Ø"î"##¢"6#B#N#\#"&#€"\%P%H%*%% %%f%€ €€€Š$°€†#v#,$¬#˜#$$ò#â#Ð#¾#:$¸$¦$È$éGetVersionExA GetProcAddressGetModuleHandleABGetCurrentProcess4CloseHandleWaitForSingleObjectOutputDebugStringAuMultiByteToWideCharÌlstrlenAOCreateEventAÀlstrcmpASetEventÿGlobalFreeÆlstrcpyAKERNEL32.dllPostMessageA`CreateWindowExARegisterClassExA€SetWindowLongAPostQuitMessagenGetWindowLongA™DestroyWindowŽDefWindowProcA¡DispatchMessageAªTranslateMessage:GetMessageA×wsprintfAUSER32.dllGetTokenInformation¬OpenProcessTokenADVAPI32.dllShellExecuteASHELL32.dlliCoUninitialize;CoInitializeCoCreateInstanceole32.dllOLEAUT32.dllSHLWAPI.dll™memset??3@YAXPAX@Z??2@YAPAXI@Z¦_beginthreadexMSVCRT.dll^free_initterm‘malloc_adjust_fdiv”–…N²%¨%¬%°%áÆ%ShellExecAsUser.dllShellExecAsUser?kernel32IsWow64ProcessExecShellAsUser: NSPIM_UNLOADExecShellAsUser: NSPIM_UNLOAD wait...NSIS_DESKTOP_LAUNCH_CLASSExecShellAsUser: process is not elevated, will fallback to ShellExecuteExecShellAsUser: elevated process detectedSW_HIDESW_SHOWMINIMIZEDSW_SHOWMAXIMIZEDSW_SHOWNORMALSW_SHOWDEFAULTExecShellAsUser: thread finishedExecShellAsUser: failed to retrieve desktop!ExecShellAsUser: got desktopShellExecAsUser: FindWindowSW failed: %x,‰Æ¤©;ÒêÀO±ab€¯¡ç–MÏ– €Çôî…ÀFâÀFiË…•MÏ– €Çôî…ExecShellAsUser: DLL_PROCESS_DETACHExecShellAsUser: DLL_PROCESS_ATTACH0E0J0P0W0\0{0‚0¡0É0Ü0æ0ë0ü01 1111!1A1R1Y1f1|1„1¯1º1È1÷1 2¿2è233=3^3„3‹3¿3ï3÷3ÿ3 444$4*4K4U4]4g4r4y4~4…4‹4‘4â4ô4555<5C5J5Q5}5¨5Ò5Ù5à5ð5ù5ÿ566)6C6H6N6l6t6}6½6Â6Ë6ô67M7ó7ú7 8;8A8J8X8^8i8‰8Ž8™8ª8°8ò89999&9.9<9A9F9K9V9c9m9‚9Ž9”9¶9È9$:@:0 0synergy-1.4.12-Source/res/synergy.desktop0000600000175000017500000000024511653136445020404 0ustar synergysynergy[Desktop Entry] Name=Synergy Comment=Share your keyboard and mouse over a network Exec=synergy Icon=/usr/share/icons/synergy.ico Type=Application Categories=Utility synergy-1.4.12-Source/res/synergy.ico0000600000175000017500000106227611557776337017537 0ustar synergysynergy ( V00 ¨%~   ¨&F ˆ ÎV hV`( ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ñïï çêî2ëîòìïóëîòíïðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííííííííééé(ãááOãááOãááOßÝÝcÚØØyÖÔÔ€ÖÔÔ€ÖÔÔÿÍÐÔÿÍÐÔÿÎÑÕÿÐÓ×ÿÒÔÕƒÒÔÕƒÕÕÕ€×××~ßßßYâââEäæç;æèé2äçë;æéí2êíòîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëæææ2àààOÔÖÖ€ÊÐÏÿÃÎÌÿ¿ÊÈÿµÂÀÿ²¿½ÿ­º¸ÿ«³²ÿ¦®­ÿ¦«ªÿ¥ª©ÿ¤©¨ÿ¤§ÿš¡¤ÿ›££ÿ£§¨ÿ¥ª¨ÿ©ª¨ÿ¬­©ÿ±²®ÿ³²®ÿ¹¸´ÿ¿À¼ÿÄÅÁÿÅÈÆÿÌÏÍÿÕ××ÿÜÞÞcàáßYæçå;îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ çéé2ÞààYÕ××€ÕÐщÊÅÆʾ¾¾ÿ···ÿ©««ÿœ¢¡ÿ’›ÿŽ™—ÿ‰–”ÿ‚ÿz‡…ÿz‚ÿz‚ÿ|€ÿz~ÿv{zÿsz}ÿry|ÿrzzÿw{|ÿx}{ÿ}~|ÿ‚~ÿ„…ÿ‰ˆ„ÿŒˆÿ‘’Žÿ–—“ÿ™œšÿ £¡ÿ©««ÿ°²²ÿÀÁ¿ÿÈÉÇÿÑÒЉÙÚØyÝÞÜcãäâEìíëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêììãååEÕÚÙ€ÊÏÎÿ¿ÅÄÿ´º¹ÿ¶®¯ÿ¨ ¡ÿ—••ÿŠŒŒÿw‚€ÿjxvÿ_tqÿXqmÿId`ÿJeaÿNgcÿUjgÿZmjÿ_mkÿ]kiÿ]hfÿgroÿmtqÿkrmÿgkfÿejaÿlmdÿlnbÿmk`ÿhgYÿgfXÿgeZÿki^ÿsqgÿ}{qÿ†…{ÿŒ‹ÿ‘’Žÿœ™ÿ¬­©ÿº»·ÿÂÿÿÊËÇÿØÙ×~åæä;éêè(îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÜÜÜcÏÑÑÂÄÄÿ¯´³ÿŸ¤£ÿŽ”“ÿ‡†ÿ{stÿumnÿljjÿgiiÿ]hfÿZhfÿWliÿTmiÿb}yÿoŠ†ÿš–ÿŽ£ ÿ“¦£ÿ—¥£ÿ—¥£ÿœ§¥ÿ¦±®ÿ¯¶³ÿ¬³®ÿ¥©¤ÿ¡¦ÿ¨© ÿ¦¨œÿ¤¢—ÿœ›ÿ‘‚ÿtÿushÿomcÿlj`ÿih^ÿgf\ÿfgcÿklhÿvwsÿ„…ÿ‘ÿ›œ˜ÿ«¬ªÿº»¹ÿÊËÉÿÔÕÓƒãäâEîïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëßßßYÖÖÖ~ÂÂÂܳ³³ÿž£¢ÿ’‘ÿ{€ÿoutÿckjÿYa`ÿFjdÿEvnÿUˆ€ÿ\˜Žÿ]¡–ÿ`¬ ÿe·ªÿcº¬ÿjŶÿtÏÀÿ‚ÚÌÿ‹àÒÿ‘áÔÿ•áÕÿšäØÿ¥çÜÿÛâÝÿáæÝÿÝåÚÿÚÞÓÿØÛÌÿÛÚÌÿÚÚÈÿÙÕÃÿÖѼÿÍȳÿÁ»¨ÿ·±žÿ°ª—ÿª¤‘ÿ¡Šÿœ—ˆÿ‚„~ÿqsmÿ`b\ÿ]_Yÿcd`ÿnokÿ|}yÿ‰Š†ÿžŸ›ÿ«¬¨ÿ¾¿½ÿÏÐÎÝÞÜcèéç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÞÜÜcÍËË¥¶¶¶ÿ¨¨¨ÿ———ÿ………ÿotsÿchgÿagfÿkqpÿu}|ÿy€ÿq•ÿz«£ÿ”Ç¿ÿžÚÐÿœàÕÿšæÚÿ™ëÞÿ“êÜÿëÜÿèÙÿŒäÖÿâÔÿ“ãÖÿšæÚÿ êÞÿªìáÿÞåàÿáæÝÿÝåÚÿÝáÖÿÚÝÎÿÙØÊÿÖÖÄÿÙÕÃÿÝØÃÿÜ×ÂÿÜÖÃÿàÚÇÿãÝÊÿâÜÉÿÛ×ÄÿÖÑÂÿÂľÿ§©£ÿŒŽˆÿ€‚|ÿ{|xÿstpÿjkgÿefbÿmnjÿz{wÿŽÿ¡¢ ÿ³´²ÿÅÆÄÊ×ØÖ~âãáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòæä;êáÞYÊÁ¾ÿ¿··ÿ¯«ªÿŽÿy|zÿdolÿWniÿ@ibÿ5jaÿCˆ}ÿf¸«ÿÜÍÿ~è×ÿoîÕÿmìÓÿlèÐÿjåÑÿ^åÏÿVäÑÿMäÐÿIäÏÿIäÏÿDäÎÿBæÍÿCçÎÿPéÐÿlçÓÿ‰éØÿ¨êÞÿÈë×ÿØçÒÿÚæÒÿãåÏÿèáÈÿëÛ·ÿçÕ¦ÿæÔ™ÿáÓ‹ÿàÓ‡ÿáÖ†ÿã؈ÿåÕÿçÔ—ÿëÒ ÿîÕ£ÿèà¥ÿìä©ÿêß­ÿçÙ¯ÿãÔ³ÿÑĪÿ§™‡ÿzndÿrhaÿngdÿokjÿxywÿ‰ŒŠÿ˜Ÿœÿª´®ÿ»Å¿ÿÓÓÓƒãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíçÛÙyÌÀ¾ÿÄ»¸ÿµ¬©ÿ–ŽŽÿrnmÿ][ZÿUXVÿ\gdÿxŠÿ¹²ÿ™ÎÅÿ‘ÖËÿ‹ÝÐÿ„áÒÿxâÑÿhçÎÿfåÌÿfâÊÿdßËÿZáËÿRàÍÿIàÌÿFáÌÿFáÌÿAáËÿ?ãÊÿAåÌÿMæÍÿiäÐÿ†æÕÿ¥çÛÿÆéÕÿ×æÑÿØäÐÿàâÌÿäÝÄÿåÕ±ÿáÏ ÿàΓÿÜΆÿÛ΂ÿÛЀÿÜÑÿÞΉÿÞËŽÿâÉ—ÿåÌšÿÔÌ‘ÿÝÕšÿåÚ¨ÿæØ®ÿãÔ³ÿÝжÿ×É·ÿÌÀ¶ÿ¿µ®ÿ§ ÿxtsÿUVTÿZ][ÿjqnÿ}‡ÿ“—ÿ³³³ÿÎÎÎÒÓщßàÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïôò îïíèààOÖÎηµ´ÿž¥¢ÿ~‰†ÿXojÿ8ZTÿFumÿcŸ•ÿbªžÿg»¯ÿrÓÅÿ|éÙÿuïÝÿdêÖÿRåÏÿMâÎÿBãÍÿ2çËÿ1æÊÿ4âÊÿ4âÊÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿçÛÿÅêÖÿÖéÐÿ×çÏÿßåÆÿãÞ·ÿãסÿáÒÿàÓ}ÿÝÔmÿÛÖcÿÚ×]ÿÚ×]ÿÜÕ`ÿÜÔcÿßÓgÿáÒnÿØÑtÿÙÏ{ÿÚÓ~ÿÞÕ…ÿàØ‹ÿäÙ•ÿêà¤ÿðè³ÿçÞ³ÿßÖ´ÿÄ» ÿ¬¥’ÿŸ—Šÿ{upÿc\Yÿjefÿÿ   ÿ¯®°ÿÌËÍ¥ÙÛÜyæèé2îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìõòãèæEÕÖÔÿû»ÿª¢¢ÿ‰‡†ÿszwÿZebÿczuÿc…ÿu¤œÿ—ÓÉÿ¢êÞÿ–êÞÿ„å×ÿrßÏÿaÛÉÿWÝÉÿNáËÿKàÌÿ@áËÿ0åÉÿ/äÈÿ3áÉÿ3áÉÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿœæÚÿÅêÖÿ×êÑÿØèÐÿàæÇÿâݶÿáÕŸÿàÑŒÿßÒ|ÿÜÓlÿÚÕbÿØÕ[ÿØÕ[ÿÚÓ^ÿÙÑ`ÿÛÏcÿÝÎjÿÚÓvÿÓÉuÿÍÆqÿÑÈxÿÓË~ÿÔÉ…ÿÓÉÿÒÊ•ÿÖÍ¢ÿßÖ´ÿåÜÁÿèáÎÿÜÔÇÿ«¥ ÿ‚{xÿxstÿlllÿdddÿ|{}ÿ›šœÿ¨ª«ÿÊÌÍÿÞàáYäæç;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßçæYÏ×Ö»ÃÂÿ¤¬«ÿŒ‘ÿtywÿKmgÿ?vmÿ=xpÿnº¯ÿŠéÛÿ€ðßÿjêÙÿTäÑÿGâÍÿ:âËÿ5âÌÿ/åÍÿ.æÎÿ)åÌÿ"ãÉÿ áÇÿ#åÎÿ"äÍÿ(ãÍÿ(ãÍÿ"ãÎÿ"ãÎÿ"ãÎÿ%âÍÿ*áÌÿ1àÌÿ0âËÿ9ãÍÿFäÌÿbâÏÿ|åÒÿ™äÖÿ»åÚÿÑáÚÿÒãÕÿÝáÈÿàÚµÿâÑžÿáψÿäÐyÿåÒkÿâÔ\ÿàÕUÿàÕUÿáÕWÿàÓYÿàÑ]ÿáÐaÿÚÍ_ÿÜÏaÿÝÐbÿÝÐbÿÜÑbÿÝÒcÿÚÒgÿÛÐnÿØÍqÿÚÏÿàÔŽÿã×ÿêܬÿòß¼ÿëÙºÿÛÆ°ÿš—‰ÿe`Wÿlj`ÿyupÿ‰‡†ÿ¥¢¤ÿ²´µÿÊÊÐ¥ÛÛánëëñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîììàââOÍÕÔš¶¾½ÿ•œÿx€ÿinlÿ]b`ÿnŠÿ’ÉÀÿšÕÍÿÜÑÿàÒÿnÞÍÿ_ßÎÿLÜÉÿAÜÇÿ7ßÈÿ4áËÿ,âÊÿ&ÞÆÿ!ÝÄÿßÅÿ áÇÿ"äÍÿ!ãÌÿ&áËÿ&áËÿ áÌÿ áÌÿàËÿ"ßÊÿ(ßÊÿ/ÞÊÿ-ßÈÿ6àÊÿCáÉÿ_ßÌÿyâÏÿ—âÔÿ¹ãØÿÎÞ×ÿÎßÑÿÚÞÅÿÞسÿáÐÿß͆ÿâÎwÿâÏhÿÞÐXÿÜÑQÿÝÒRÿÞÒTÿÞÑWÿÞÏ[ÿßÎ_ÿÙÌ^ÿÝÐbÿÞÑcÿÛÎ`ÿÚÏ`ÿÞÓdÿÜÔiÿÛÐnÿÜÑuÿÓÈxÿÔÈ‚ÿÑÅ‹ÿÐÂ’ÿÞ˨ÿæÔµÿÜDZÿÎ˽ÿþµÿ®¬¢ÿea\ÿZXWÿ|y{ÿÿ¨¨®ÿÂÂÈÿÙÙßyíîòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóèê(åÚÜnÒÇÉÿ¯­­ÿ€‹‰ÿVmiÿJnhÿh‘Šÿxµ«ÿrÔÆÿuè×ÿkâÓÿXÜËÿNáÍÿ>ÞÈÿ9åÍÿ0äËÿ(âÊÿ(âÊÿ'áÉÿ&àÈÿ)áÉÿ*âÊÿ+âÍÿ/âÍÿ-ßÈÿ0ÝÇÿ2ÛÈÿ2ÛÈÿ*ÛÇÿ*ÛÇÿ(ÚÃÿ'ÙÂÿ0ÜÄÿ2ÚÃÿ1ÝÁÿ6ÝÂÿ?ßÁÿWÞÄÿmâÉÿáÎÿ³âÒÿÆÜÐÿÈÜÉÿÓÛ½ÿÚÔ¯ÿÝÌ™ÿÜÆ„ÿâÅtÿáÅgÿÞÅ_ÿÜÄZÿÝÅ[ÿßÆ`ÿßÄbÿßÁhÿàÂiÿãÍdÿâÍ`ÿàË^ÿÞÊZÿÞÍXÿáÐ[ÿàÐXÿÞÎVÿÝÑ[ÿÚË]ÿÞÐfÿåÔsÿßÐtÿßÍzÿæÖƒÿîÚ“ÿãÙ©ÿáسÿáسÿļŸÿ¢œ…ÿ{vgÿge[ÿ}|ÿ›šœÿ¸¶¼ÿÑÑ׉ááçOðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéãäEØÍϚ·¹ÿŸ”–ÿywwÿfqoÿg~zÿy—ÿ›Ä½ÿ¤á×ÿ€âÔÿmàÏÿgÞÏÿYÝÌÿPãÏÿ:ÚÄÿ4àÈÿ)ÝÄÿ%ßÇÿ'áÉÿ(âÊÿ&àÈÿ'ßÇÿ'ßÇÿ&ÝÈÿ(ÛÆÿ*ÜÅÿ.ÛÅÿ0ÙÆÿ/ØÅÿ(ÙÅÿ'ØÄÿ&ØÁÿ$Ö¿ÿ+׿ÿ-Õ¾ÿ+×»ÿ1ؽÿ:Ú¼ÿRÙ¿ÿhÝÄÿŠÜÉÿ¯ÞÎÿÁ×ËÿÂÖÃÿÍÕ·ÿÔΩÿ×Æ“ÿÕ¿}ÿÚ½lÿÞÂdÿÚÁ[ÿØÀVÿÙÁWÿÛÂ\ÿÜÁ_ÿܾeÿܾeÿÜÆ]ÿÞÉ\ÿàË^ÿáÍ]ÿßÎYÿÝÌWÿÞÎVÿáÑYÿÛÏYÿßÐbÿÛÍcÿÙÈgÿÙÊnÿÙÇtÿ×ÇtÿÛÇ€ÿ×ÍÿÖͨÿØϪÿæÞÁÿÕϸÿ·²£ÿ‹ÿljiÿmlnÿ‹‘ÿ¬¬²ÿÅÅËÿàßáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììäää;ÍÍÍš§§§ÿ‰Žÿ_qpÿOplÿa—ÿvĹÿ}ßÑÿzç×ÿdçÓÿDáÌÿ<âËÿ7ßÈÿ3ßÇÿ,ßÆÿ)àÆÿ'àÆÿ&ßÅÿ'àÆÿ+ßÆÿ+ßÆÿ-ÝÅÿ,ÜÄÿ.ÚÂÿ-ÙÁÿ,ØÀÿ&Ú½ÿ%Ù¼ÿ&Ö¸ÿ&Ö¸ÿظÿ×·ÿÕµÿÒ³ÿ$Юÿ%ѯÿ%Ô¯ÿ&Õ°ÿ1ײÿDÙ·ÿTÞ¼ÿ|ÛÀÿ¦Ú¼ÿ»Ù¶ÿ¾Ù²ÿÈÖ¦ÿÎÏ—ÿÑŃÿÒ¾qÿÓ»cÿÓ¼YÿÓºTÿѸPÿѸPÿÓºTÿÔ¹WÿÖ·ZÿÕ¶YÿÔ¾UÿÖÀWÿÙÃZÿÛÅ\ÿÝÅ[ÿÞÆ\ÿÞÇZÿßÈ[ÿßË\ÿßË\ÿÞË\ÿßÌ]ÿÞÍ^ÿßÎ_ÿÝÏ_ÿÜÎ^ÿÙÈqÿ×Ç{ÿàÒ†ÿäÕ–ÿäÙ ÿíâ¶ÿØÏ­ÿ©¡Šÿ…€qÿtqiÿ€~}ÿ¢¢¨ÿ¼¿ÄÿÏÐÚäåï;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ ÖÖÖ~ÂÂÂÿ©©©ÿƒƒƒÿglmÿp‚ÿ‰ª¦ÿ—ÍÆÿÛÐÿzÜÎÿnÛËÿZÝÉÿAÞÉÿ9ßÈÿ6ÞÇÿ2ÞÆÿ,ßÆÿ)àÆÿ'àÆÿ'àÆÿ%ÞÄÿ)ÝÄÿ(ÜÃÿ+ÛÃÿ)ÙÁÿ+׿ÿ*Ö¾ÿ)Õ½ÿ!Õ¸ÿÓ¶ÿ"Ò´ÿ"Ò´ÿÔ´ÿÓ³ÿѱÿÍ®ÿ!Í«ÿ"άÿ Ϫÿ Ϫÿ)Ϫÿ;ЮÿKÕ³ÿsÒ·ÿ Ô¶ÿ´Ò¯ÿµÐ©ÿ¾ÌœÿÃÄŒÿȼzÿʶiÿÌ´\ÿ̵RÿεOÿÍ´LÿÍ´LÿεOÿÏ´RÿѲUÿÒ³VÿϹPÿкQÿÒ¼SÿÓ½TÿÖ¾TÿØÀVÿÛÄWÿÝÆYÿÜÈYÿÜÈYÿÜÉZÿÝÊ[ÿÜË\ÿÝÌ]ÿÛÍ]ÿÛÍ]ÿØÇpÿÓÃwÿØÊ~ÿØÉŠÿÖË’ÿáÖªÿãÚ¸ÿÔ̵ÿ¹´¥ÿŽ‹ƒÿomlÿuu{ÿ“–›ÿ¶·ÁÿÑÒ܉ßàêYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçè2ÛÕրĿÀÿ–––ÿhvuÿTwsÿV‘‰ÿe¹­ÿtßÏÿgìØÿVéÓÿ?ãÊÿ5ÞÄÿ-ÞÃÿ(âÅÿ'áÄÿ%áÄÿ$àÃÿ$àÃÿ$àÃÿ#àÁÿ'ßÁÿ%Û¼ÿ(Û¼ÿ'Ú¹ÿ&Ù¸ÿ%Ø·ÿ#ÖµÿÕ³ÿÔ²ÿÔ¬ÿѪÿЩÿϨÿЧÿÎ¥ÿË£ÿ!È¡ÿ)ÄŸÿ.Ä ÿ-ÆŸÿ2Æ ÿ9Ç¢ÿLʧÿ`άÿ}Í°ÿŸÎ´ÿ³É°ÿ²È«ÿ»Äœÿ¼¼ŒÿÀ´zÿ¾­jÿÁª_ÿ¼¦TÿÀ¨Nÿ¾¨Iÿ¾¨Iÿ¾¨HÿÄ«KÿÉ­Nÿ˯PÿÉ´KÿʵLÿ̶Mÿ͵QÿζRÿѸXÿÖº[ÿؼ]ÿÛ¿`ÿÜÀaÿÛÂ`ÿÜÅ_ÿÜÈ]ÿÝÉ^ÿÞÊ]ÿÞÊ]ÿàÌ_ÿÞÉ`ÿßÌeÿÞÌmÿÛÊsÿÜÌ€ÿãÕ“ÿêܧÿäÛ¯ÿÏÆ¥ÿ¢ž†ÿ{wlÿwtpÿ‘”ÿµ·¿ÿÏÑÙàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÓÔƒº´µÿŸš›ÿwwwÿftsÿwš–ÿ’ÍÅÿ‹ßÓÿwâÒÿVÛÇÿHÛÅÿ<àÇÿ6ßÅÿ.ßÄÿ(âÅÿ'áÄÿ$àÃÿ#ßÂÿ"ÞÁÿ!ÝÀÿܽÿ!Ù»ÿ!׸ÿ$׸ÿ#Öµÿ!Ô³ÿÒ±ÿЯÿÏ­ÿÍ«ÿΦÿÌ¥ÿÊ£ÿÈ¡ÿÈŸÿÇžÿÅÿÃœÿ&Áœÿ,žÿ.Ç ÿ7Ë¥ÿAϪÿVÔ±ÿkÙ·ÿˆØ»ÿ¨×½ÿ¾Ô»ÿ¾Ô·ÿÉÒªÿËË›ÿΈÿʹvÿË´iÿÁ«YÿÁ©Oÿ¼¦Gÿ¸¢Cÿ·¡Aÿ¼£CÿÁ¥Fÿ¦GÿîEÿįFÿDZHÿɱMÿ˳Oÿ̳SÿдUÿдUÿÔ¸YÿÖº[ÿÕ¼Zÿ×ÀZÿØÄYÿÙÅZÿÛÇZÿÛÇZÿÞÊ]ÿÝÈ_ÿÚÇ`ÿÚÈiÿÚÉrÿÒÂvÿÏÁÿÖÈ“ÿÕÌ ÿâÙ¸ÿÕѹÿ«§œÿ|xÿmlpÿ„†Žÿ­¯·ÿÉÉÉ°ãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêèè(ÐÎΰµ´ÿ…–“ÿ]xuÿXˆ‚ÿs¸®ÿvÕÇÿmãÑÿ\ëÕÿFäÌÿ.ÝÂÿ+ßÆÿ(áÇÿ$ßÅÿ$ßÅÿ+áÃÿ*àÂÿ&ÞÀÿ%Ý¿ÿ#ܼÿ!Úºÿ ×µÿ!Ô³ÿ"Ô¯ÿ$Ó®ÿ%Ò¬ÿ"Ï©ÿΦÿË£ÿÊŸÿÉžÿ Řÿ&×ÿ'–ÿ&Á•ÿ'–ÿ)Ęÿ1›ÿ=ÁœÿOÅ¢ÿWȦÿ]έÿfÓ³ÿpعÿ…ÜÀÿ›ßÆÿ±àÊÿÀàÕÿÏÞÖÿÓàÒÿÛÝÉÿÜؼÿÞÏ®ÿÙÇžÿÚÓÿι‚ÿ˳yÿÀ«mÿ½¥cÿ¼£]ÿ¼¡Wÿ¸Sÿ¹›Nÿ¼¢Hÿ¼¢Hÿ¾£IÿÀ¥KÿèNÿŪPÿÉ«RÿË­TÿË®SÿÍ°UÿδVÿжXÿÒ¹WÿÔ»YÿÖ¿[ÿ×À\ÿÛÈYÿÜÉZÿ×ÄUÿÙÅZÿßÍbÿÞÉfÿÙÇhÿÞÌyÿØÊ~ÿßБÿåÚ¦ÿâØ°ÿ¾¸›ÿ‹„sÿwteÿ‡…}ÿªªªÿÇÇǽáááOïïï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿååå;ÖÔÔ€°®®ÿ†‹Šÿgxuÿi„ÿˆ¸²ÿœá×ÿ„ãÕÿeÛÉÿOÞÈÿ?ÝÅÿ0ßÄÿ,àÇÿ'àÆÿ!ÜÂÿ!ÜÂÿ&ܾÿ%Û½ÿ"Ú¼ÿ غÿظÿÕµÿÓ±ÿЯÿϪÿͨÿË¥ÿÉ£ÿÇŸÿÅÿÅšÿÄ™ÿÁ”ÿ$Á•ÿ'–ÿ)Ęÿ-Èœÿ1Ì ÿ<ͦÿJΩÿ[Ñ®ÿbÓ±ÿgØ·ÿoܼÿxàÁÿŠáÅÿŸãÊÿ´ãÍÿÄäÙÿÒáÙÿÕâÔÿÝßËÿàÜÀÿåÖµÿäÒ©ÿçРÿßÊ“ÿÝÅ‹ÿÔ¿ÿÓ»yÿÒ¹sÿÏ´jÿŪ`ÿ¤Wÿ¼¢Hÿº Fÿ¸Cÿ·œBÿ¹žDÿ½¢HÿÃ¥LÿƨOÿŨMÿǪOÿɯQÿ˱SÿÍ´RÿзUÿÒ»WÿÔ½YÿÕÂSÿÛÈYÿÙÆWÿ×ÃXÿÚÈ]ÿÛÆcÿ×ÅfÿÚÈuÿÖÈ|ÿÓÄ…ÿÔÉ•ÿàÖ®ÿßÙ¼ÿü«ÿ–“„ÿwumÿ{{{ÿ   ÿËËËÿãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÎÎί±±ÿ‘““ÿa|xÿZ†ÿp¿´ÿyâÓÿhæÓÿNáËÿBàÈÿ5ÛÂÿ1ÙÂÿ/ÛÃÿ+ÛÃÿ*ÚÂÿ(ÛÂÿ%Ø¿ÿ*Öºÿ)Õ¹ÿ$Ô¶ÿ"Ò´ÿ!Ò±ÿЯÿΩÿ ̨ÿ É¢ÿ!Æ ÿ#Å›ÿ#Á˜ÿ%À”ÿ%À”ÿ%À“ÿ%À“ÿ4Á–ÿ:˜ÿ?Å›ÿBÈžÿEÍ£ÿIѧÿRÓ¬ÿ`Ô¯ÿpÓ³ÿrÕµÿu×¹ÿyÛ½ÿ€ÝÂÿÞÅÿ¤ßËÿµßÎÿÅâÒÿÒßÑÿÔßËÿÙÜÆÿÝÙ½ÿßÔ¶ÿàÏ®ÿàͨÿÙÆ ÿÚÄšÿ×Á—ÿÙÁ“ÿÙÀŽÿؼ†ÿÓ´}ÿЮsÿǧfÿÅ¢^ÿ¾œVÿ¹™Nÿ¹˜Iÿ»›Hÿ½ŸHÿ¿¢GÿÀ¤Fÿ§EÿƬHÿÈ®JÿÈ°LÿʲNÿ͵QÿиTÿ̼RÿÒÂXÿÔÅWÿ×ÃVÿÚÆWÿÙÅVÿ×ÃVÿÙÄ[ÿÖÃbÿÚÆqÿ×Æ}ÿÒŇÿÛОÿàÙ²ÿËÞÿž™„ÿuuuÿ€€€ÿ£££ÿÊÊÊ¥ÞÞÞYîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììÒÒÒƒ³³³ÿ‹ÿsuuÿn‰…ÿ¹ÿ‘àÕÿvßÐÿ\ÚÇÿHÛÅÿ=ÛÃÿ3ÙÀÿ5ÝÆÿ3ßÇÿ(ØÀÿ'׿ÿ'ÚÁÿ$×¾ÿ(Ô¸ÿ'Ó·ÿ!ѳÿϱÿέÿÌ«ÿÊ¥ÿȤÿÅžÿÂœÿÀ–ÿ½”ÿ"½‘ÿ"½‘ÿ#¾‘ÿ$¿’ÿ7Ä™ÿ=Å›ÿCÉŸÿFÌ¢ÿGÏ¥ÿJÒ¨ÿRÓ¬ÿ^Ò­ÿpÓ³ÿrÕµÿtÖ¸ÿwÙ»ÿÜÁÿÞÅÿ¥àÌÿ·áÐÿÅâÒÿÔáÓÿ×âÎÿÝàÊÿàÜÀÿàÕ·ÿßέÿÞ˦ÿ×ÄžÿÙÙÿ×Á—ÿØÀ’ÿØ¿ÿÙ½‡ÿع‚ÿض{ÿ×·vÿÔ±mÿË©cÿ¢Wÿ¾Nÿ»›Hÿ¹›Dÿ·š?ÿºž@ÿ½¢@ÿÀ¦Bÿ¨DÿªFÿëGÿÆ®JÿɱMÿɹOÿʺPÿ˼NÿÒ¾QÿØÄUÿÚÆWÿÚÆYÿÚÅ\ÿÓÀ_ÿÔÀkÿÔÃzÿÍÀ‚ÿËÀŽÿÕΧÿÞÖ±ÿÏʵÿžžžÿtttÿwwwÿ§§§ÿËËËÿàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîüú áîìOÑÖÕ‰¹®°ÿ–‹ÿJ}uÿIžÿr;ÿzêØÿ_åÑÿ>ÚÂÿ1ÚÀÿ*ÛÀÿ'ÜÀÿ'ÜÀÿ(Ü¿ÿ'Û¾ÿ'Ý»ÿ$Ú¸ÿ!ضÿÖ´ÿ$Õªÿ&Ò¨ÿ"Шÿ#Ì¥ÿ É¢ÿ ÅŸÿÚÿÀ˜ÿ!Á—ÿ!½”ÿ¼Žÿ ¹Œÿ$¼‹ÿ'¿Žÿ+Ä‘ÿ.Ç”ÿBŤÿKƦÿPÈ©ÿUÊ«ÿ[Ë©ÿZʨÿXÊ¥ÿSʤÿPÌ¢ÿOË¡ÿPÌ ÿVÏ£ÿaÑ¢ÿiУÿpÕ¨ÿƒ×­ÿœÖ³ÿ¯Ô´ÿ´Ó¬ÿÂÍ¥ÿÉÆ™ÿÒ»ÿÒ¶€ÿѳzÿϱvÿΰuÿÌ´xÿи|ÿηÿÏ·ƒÿѶƒÿβƒÿѱˆÿ̬ƒÿʬ{ÿŪqÿ½£aÿ¶ŸTÿ²Lÿ¯—Cÿ®˜@ÿ³˜Aÿ¶›Dÿ»Fÿ½ŸHÿÅ¢LÿɤOÿ˦QÿÅ®HÿȱKÿÌ´PÿÏ·SÿѹUÿÔ¼Xÿ×ÁXÿÚÄ[ÿÚÆ[ÿÚÆ[ÿØÇ`ÿÚÆgÿÚÆoÿàÉ{ÿìÕŠÿøÛ¢ÿÜÈ·ÿ±¨šÿŒ…tÿ||nÿŸ¨›ÿÈÓÉ°ÕâÚ€êõòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöô(ÞìêYÐÝÛÿ¶»ºÿœ‘“ÿ…z|ÿiœ”ÿsȺÿ‰äÕÿnÞÌÿNÔÀÿ@ÜÄÿ6ßÅÿ%Ö»ÿ%Ú¾ÿ%Ú¾ÿ$Ø»ÿ#׺ÿ!×µÿÕ³ÿѯÿÏ­ÿΣÿË¡ÿÉ¡ÿÅžÿÃœÿ¿™ÿ¾•ÿ»“ÿºÿ¸ÿºŒÿ!ºÿ'¿Žÿ+Ã’ÿ/È•ÿ2˘ÿAÄ£ÿG¢ÿHÀ¡ÿKÀ¡ÿQÁŸÿPÀžÿM¿šÿG¾˜ÿ@¼’ÿ=¹ÿ:¶Šÿ<µ‰ÿF¶‡ÿP·ŠÿY¾‘ÿn˜ÿ†Àÿ—¼œÿ›º“ÿ§²Šÿ«¨{ÿ²›mÿ±•_ÿ¯‘Xÿ°’Wÿ®Uÿ­•Yÿ²š^ÿ´eÿ½¥qÿǬyÿȬ}ÿƦ}ÿƦ}ÿʬ{ÿË°wÿƬjÿÀ©^ÿº¥Tÿ¶žJÿ®˜@ÿ²—@ÿ²—@ÿ¶˜Aÿ¸šCÿ¿œFÿÂHÿÄŸJÿÀ©CÿìFÿǯKÿʲNÿÌ´PÿÏ·SÿÒ¼SÿÔ¾UÿÕÁVÿÖÂWÿÔÃ\ÿÕÁbÿÔÀiÿØÁsÿßÈ}ÿèË’ÿáͼÿÓʼÿ±ª™ÿ……wÿ}†yÿ¨žÿÅÒÊÿÜçäcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëÛÖ×ÿ¼ÄÃÿ‚“ÿbyuÿl˜‘ÿq̽ÿoãÐÿoèÔÿQÚÄÿ;Ô»ÿ1Û¿ÿ*ÞÁÿ'Û¾ÿ$Ú»ÿ#Ùºÿ$׶ÿ%Ô³ÿ#Ò°ÿ Ï­ÿͨÿ˦ÿ!ÉžÿÆ›ÿÄ–ÿ”ÿÀ’ÿ¾ÿ¼ÿ»ŒÿºŠÿº‹ÿ$¼‹ÿ-½ÿ3¿ÿ<À’ÿ@“ÿAÔÿ9Åÿ4À‹ÿ/»†ÿ,¸ƒÿ*¸ƒÿ&¸‚ÿ·€ÿµ~ÿ´|ÿ´|ÿ´~ÿ·ÿ(¸„ÿ7ºˆÿ?¿ŽÿUÁ“ÿ~Ñÿ–¾Žÿ—»‡ÿž²}ÿ£§lÿ¦›_ÿ¨’PÿªHÿ¨‹@ÿ§‡<ÿ¨ˆ<ÿ­‰=ÿ­‰=ÿµBÿ¿’HÿÀ’Kÿ»™Sÿ¾œVÿÇ¥_ÿÍ«eÿ˨dÿɦbÿÉ£bÿÄž]ÿ¾˜Wÿ»•Tÿ¶’Lÿ´‘Gÿ´”Aÿ¶˜Aÿ¸œ>ÿºž@ÿ¾¡FÿÁ¤IÿŨMÿÈ«PÿÊ­Rÿ̯TÿÏ´RÿѸRÿÓ½TÿÔ¾UÿÓÀWÿÕÁ\ÿÓ¿`ÿÔ¿dÿÖÂjÿÛÃwÿÝÌ”ÿíݹÿÝѯÿ³«”ÿ„„tÿ€|ÿ®°°ÿÎÐÐéëë(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåàáOËÆÇÿ”œ›ÿevsÿsŠ†ÿ›ÇÀÿ„ßÐÿkßÌÿ]ÖÂÿLÕ¿ÿAÚÁÿ.ؼÿ!Õ¸ÿ'Û¾ÿ"عÿ Ö·ÿ Ó²ÿ!ЯÿάÿË©ÿÊ¥ÿÈ£ÿÅšÿØÿÁ“ÿ¾ÿ½ÿ¼Žÿ»Œÿº‹ÿ»‹ÿ ¼ÿ&¾ÿ.¾Žÿ1½Žÿ7»ÿ7¹Šÿ7¹Šÿ-¹„ÿ*¶ÿ&²}ÿ#¯zÿ ®yÿ°zÿ²{ÿ²{ÿµ}ÿ·ÿ»…ÿ#¿‰ÿ1ÁÿAÄ’ÿHÈ—ÿ]É›ÿ‡ÌšÿŸÇ—ÿ¡Å‘ÿ©½ˆÿ¯³xÿ²§kÿ³[ÿµ˜Sÿ­Eÿ­Bÿ­Aÿ°Œ@ÿ«‡;ÿ¬„9ÿ°ƒ9ÿ¬~7ÿ©‡Aÿ«‰Cÿ²Jÿ¸–Pÿº—Sÿ¿œXÿÆ _ÿÆ _ÿÅŸ^ÿÂœ[ÿ¼˜Rÿ¶“Iÿ²’?ÿ²”=ÿ´˜:ÿ·›=ÿºBÿ¼ŸDÿ¿¢GÿÂ¥JÿŨMÿÈ«PÿË°NÿÍ´NÿϹPÿÑ»RÿнTÿÓ¿ZÿÒ¾_ÿÓ¾cÿÓ¿gÿÕ½qÿÌ»ƒÿØȤÿßÓ±ÿÖηÿ©©™ÿ~}yÿ‰‹‹ÿ°²²ÿ×ÙÙ~èêê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÜnÏÇȽ«£¤ÿcxuÿYŒ„ÿxǹÿvâÏÿUãÌÿHâÉÿ8×½ÿ,Ó¸ÿ)ܽÿ&ܽÿÕµÿÓ³ÿÔ±ÿ Ò¯ÿ"Ï©ÿ#˦ÿ"É¢ÿÆŸÿÄ›ÿ™ÿÁ‘ÿ¿ÿ½Šÿ»ˆÿ»„ÿ¹ƒÿº‚ÿ¹‚ÿ ºƒÿ$º„ÿ(»‡ÿ*º†ÿ*·†ÿ,´„ÿ+±ƒÿ*°‚ÿ·yÿ·yÿ·zÿ¶zÿ´|ÿ"µÿ&º„ÿ,»Šÿ/¾ÿ7¼‘ÿ>¼’ÿJ»–ÿV¼™ÿgÀŸÿpƨÿ…ƬÿšË¯ÿ«É¬ÿ­Æªÿ±À¡ÿµ¶–ÿ´ªˆÿ³¢{ÿ´œrÿ­–fÿ¬‘^ÿ­’Zÿ®Uÿ®ŒPÿ°‹Oÿµ‰Lÿ±…Hÿ©…7ÿ§ƒ5ÿª†8ÿ­ˆ>ÿ°ˆ@ÿ¶ŒIÿÀ”TÿÖYÿÖYÿÄ—ZÿÀ—Xÿ¼•Qÿ´’Fÿ°?ÿ®’;ÿ°”=ÿ¶”@ÿ·”Dÿº—Gÿ½šJÿÀžKÿÄ¢OÿǧNÿɪMÿ̱OÿεOÿϹPÿÑ»RÿÓ¾UÿÕÀWÿÕÂ[ÿÕÀ]ÿÕÂgÿÖÁvÿÞÌÿåÔ©ÿÖÊ®ÿ¥š’ÿ‚zzÿ”ÿÀ¿»ÿÛÚÖ~ððêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñéê(ØÐщª¢£ÿyzÿp…‚ÿŒ¿·ÿ’áÓÿlØÅÿLÚÃÿBÜÃÿ9ؾÿ-Ô¹ÿ%عÿ"عÿÖ¶ÿÔ´ÿÒ¯ÿЭÿ̦ÿ È£ÿÅžÿ›ÿ¿–ÿ½”ÿ½ÿ»‹ÿº‡ÿ¸…ÿ¸ÿ·ÿ¸€ÿ·€ÿ¸ÿ"¸‚ÿ#¶‚ÿ$´€ÿ#°ÿ$¬|ÿ%«}ÿ%«}ÿ ¶xÿ¹{ÿ¼ÿ½ÿ$½…ÿ+¾Šÿ0ÄŽÿ8Ç–ÿ@ÏžÿLѦÿXÖ¬ÿhÙ´ÿvܹÿˆáÀÿåÇÿ¢ãÉÿ³äÈÿÅãÆÿÉâƽÐßÀì×ظÿÚЮÿÜˤÿßÇÿÕ¾ŽÿÏ´ÿÈ­uÿ¤iÿ½›_ÿ¼—[ÿ¿“Vÿ¹Pÿ²Ž@ÿ­‰;ÿ«‡9ÿ¨ƒ9ÿ¨€8ÿª€=ÿ°„Dÿ°ƒFÿµˆKÿºPÿ¼“Tÿ½–Rÿ·•Iÿ²‘Aÿ®’;ÿ­‘:ÿ²<ÿ³@ÿµ’Bÿ¹–Fÿ¼šGÿ¿Jÿ¢IÿÄ¥HÿÈ­KÿʱKÿ˵LÿÍ·NÿιPÿÒ½TÿÒ¿XÿÓ¾[ÿÒ¿dÿÓ¾sÿÖÄ…ÿÔØÿÝѵÿÌÁ¹ÿ˜ÿ„€ÿš™•ÿÀ¿»ÿããÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëêÐÑ϶·µÿ~Œˆÿfˆÿx½°ÿäÒÿcáËÿ?Ú¿ÿ/ÜÀÿ%׺ÿ"عÿ$Ú»ÿ×µÿÓ±ÿÔ®ÿ Õ¯ÿϧÿ!Ì¥ÿ#ÊŸÿ$Æœÿ"ÖÿÀ“ÿ½ÿ»ÿ»…ÿ¸ƒÿ·€ÿ¶ÿ·|ÿ!·|ÿ!·{ÿ!·{ÿ!·{ÿ µ}ÿ´|ÿ±|ÿ¯zÿ®}ÿ±€ÿ³†ÿ'·ÿ2¸”ÿ?½šÿQ¡ÿdƨÿuɱÿ†Î¸ÿ•Î¿ÿ§ØÊÿ·ÞÖÿÅèÞÿÕîêÿÞóñYéõõ(îöö íõõéöø(ê÷ùí÷÷ÿÿÿÿÿÿÿÿÿøïìøðé(ìæÛnàÛÌšÕѾÿÍÇ°ÿÀ»¢ÿº²•ÿ°¨‹ÿ¨}ÿ¶™rÿ²”eÿ«\ÿ¨ŠQÿ£„Eÿ¤ƒ=ÿ¤„8ÿ¤€4ÿ«‡;ÿ±‰>ÿ¶ŽCÿ¹Hÿ¹Kÿ¸JÿµŒGÿ´‹Fÿ²Œ>ÿ³?ÿ´Ž@ÿ·‘Cÿº•Eÿ½˜HÿÀ›IÿÁžHÿÄ¥JÿȪKÿÉ®Lÿ˲Lÿ˵KÿϹOÿÒ¾QÿÓ¿RÿÓ¾QÿØÂYÿÙÄiÿÖÂ{ÿÜÌ—ÿäÕ´ÿɼ¦ÿ”Šÿ‡zÿ£ œÿÈÇÃÜëéé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòðï âàßYÂÃÁÿˆ‰‡ÿv„€ÿ–¸±ÿ”ÙÌÿyÜÊÿ\ÚÄÿ>Ù¾ÿ-Ú¾ÿ$Ö¹ÿ!׸ÿ Ö·ÿÒ°ÿÒ°ÿÒ¬ÿÈ¢ÿÈ ÿÆŸÿÄ™ÿÁ—ÿÀ“ÿ½ÿºŒÿ¸Šÿ·ÿµ€ÿ´}ÿ³|ÿ´yÿµzÿµyÿ´xÿ°tÿ°xÿ°xÿ¯zÿ°{ÿµ„ÿ$¼‹ÿ)À“ÿ5Å›ÿ@Æ¢ÿQϬÿhÙ¸ÿ‚äÆÿšîÖÿ­õßÿ½öçÿÇøê½Ôûó€Ýÿöcæÿû2ëÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúõæ2öòßYöðÙyïêщéáÄÊÛÓ¶ÿÐÅ¥ÿαŠÿȪ{ÿ¾ oÿ¸šaÿ°‘Rÿ¯ŽHÿ¬Œ@ÿª†:ÿ©…9ÿ«ƒ8ÿ¬„9ÿ¯…>ÿ²‰DÿµŒGÿµŒGÿ´‹Fÿ¯‰;ÿ°Š<ÿ°Š<ÿ²Œ>ÿµ@ÿ¸“Cÿº•Cÿ»˜Bÿ¼Bÿ¤EÿŪHÿÆ­GÿDZGÿ˵KÿÏ»NÿмOÿÓ¾QÿÑ»RÿϺ_ÿÒ¾wÿË»†ÿÖǦÿßÒ¼ÿº±§ÿ†€yÿ‘ŽŠÿ«ª¦ÿÖÔÔ€ðñï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéäãEÍÈÇÿ—¢ŸÿZƒ{ÿb¨›ÿãÑÿcâÉÿIáÄÿ;Ù»ÿ.Ù¹ÿ#Ù·ÿ!×µÿÕ²ÿÓ°ÿÒ¬ÿϪÿ̤ÿÊžÿƘÿ ÖÿÁ‘ÿ½Žÿ»‰ÿ¹‡ÿ¸„ÿ·ƒÿ³{ÿ³{ÿµyÿ¶zÿ´xÿ±uÿ°tÿ°uÿ²wÿ¯yÿ#°}ÿ+²„ÿ1´‰ÿ9¶ÿCÀ™ÿVɨÿ“ƾÿ¬ÒÌÿ¼âÜÿÌêåÿÛðínëøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíøè(æíÞYÜÖÏÿ×ÉÃÿĺ¨ÿ´ªŒÿ¨Ÿsÿ¤—_ÿ¡“Qÿ£Gÿ¥ŽBÿ¤…:ÿ¤7ÿ¨7ÿ©8ÿ±?ÿ¹‡Eÿ»‰Gÿ²=ÿ±Œ<ÿ°‹;ÿ¯Š:ÿ²‹<ÿµŽ?ÿ¸‘Bÿº“Dÿ½™EÿÀœHÿ¡KÿŦKÿƪKÿÊ°LÿεOÿиNÿÒ¸LÿÕ»OÿÖÀWÿÒÀcÿÐÁkÿÐÄ~ÿØÍ™ÿÝÕ°ÿµ¯˜ÿ‰†~ÿ’Žÿ¸¸¸ÿÝßßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèé(ÕÐ϶±°ÿ|‡„ÿp™‘ÿ}öÿxÜÊÿ_ÞÅÿBÚ½ÿ9×¹ÿ(Ó³ÿ Ö´ÿÕ³ÿÒ¯ÿЭÿÏ©ÿ˦ÿÉ¡ÿÇ›ÿÕÿÀ“ÿ¾Žÿº‹ÿ¹‡ÿ·…ÿ¶‚ÿµÿ´|ÿ²zÿ²vÿ²vÿ±uÿ°tÿ±uÿ²wÿ°uÿ ´~ÿ,¹†ÿ6½ÿ?—ÿMÊ£ÿ]Ú³ÿqäÃÿ»îæÿÏõï×ý÷~áÿúOêÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõüíüöï üîè(îäÒƒá×¹ÿÒÉÿƹÿ´¦dÿ«˜Oÿ©’Fÿª‹@ÿ«ˆ>ÿ­†<ÿ©8ÿ­};ÿ³?ÿ´‚@ÿ®‰9ÿ®‰9ÿ®‰9ÿ®‰9ÿ°‰:ÿ²‹<ÿµŽ?ÿ¶@ÿ·“?ÿº–Bÿ»šDÿ¿ EÿÀ¤EÿéEÿȯIÿ˳IÿδHÿÑ·KÿÑ»RÿÍ»^ÿÊ»eÿɽwÿÎÃÿÓ˦ÿÑË´ÿ©¦žÿˆƒ„ÿÿÇÉɽàââOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÛÜn²·µÿ„•‘ÿ[ƒÿo³ÿläÌÿDÞÁÿ5âÂÿ)Ö¶ÿ+Ö¶ÿ'Ò²ÿ$Ô¯ÿ"Ò­ÿ Ï©ÿ"ͧÿ#Ê¡ÿ#Çžÿ!Ùÿ!Á“ÿ¿ÿ ½‹ÿº‡ÿ¸…ÿ·ÿµÿ´|ÿ²{ÿ²wÿ°uÿ¯uÿ°vÿ±wÿ°zÿ²|ÿ³‚ÿ%³†ÿ<¶ÿQ½™ÿhÂ¥ÿƒÌ²ÿ¥ÜÉÿ»ðÜÿÚøënÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó÷ëéíÚnÞÝÃÿÅ£ÿ´«…ÿ¬Ÿsÿ©•fÿ¨Zÿ©‰Nÿ¥‚Bÿ©9ÿª‚7ÿ§4ÿªƒ8ÿ«„9ÿ¬‡7ÿ­ˆ8ÿ­‡5ÿ®ˆ6ÿ°‰:ÿ²‹<ÿµŽ@ÿ·Bÿ¹”Dÿ¼—Gÿ½œFÿÁ¢GÿĨIÿÇ«LÿȯMÿʱOÿθOÿкQÿλTÿμ]ÿÑÃqÿÓƈÿÜÓ§ÿÍÆ­ÿ ÿ’Šÿ¨©¥ÿÌÍÉ°ìñè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêåæ;ÏÊË¥šŸÿx‰…ÿ€²¨ÿˆÛÌÿjâÊÿ>Ø»ÿ0ݽÿ%Ò²ÿ(Ó³ÿ'Ò²ÿ!ѬÿϪÿ̦ÿÉ£ÿÆÿÚÿ¿•ÿ½ÿ»‰ÿ¹‡ÿ·„ÿµ‚ÿ´~ÿ³}ÿ²zÿ°yÿ¯tÿ®sÿ°vÿ²xÿµ{ÿµÿ¹ƒÿ#»Šÿ2À“ÿMÇ¡ÿgÓ¯ÿƒÝÀÿ£ìÒÿÅüéÊÓÿôƒèÿù(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿíüûáOíêË¥âÙ³ÿÎÁ•ÿï€ÿ¸jÿ²’Wÿ®‹Kÿ²ŠBÿ¯‡<ÿ©6ÿ¨6ÿ©‚7ÿª…5ÿ¬‡7ÿ¬†4ÿ«…3ÿ¬…6ÿ¯ˆ9ÿ³Œ>ÿµŽ@ÿ¶‘Aÿ¹”Dÿº™Cÿ¾ŸDÿÁ¥FÿĨIÿŬJÿÇ®Lÿ˵LÿÍ·Nÿ˸QÿʸYÿÉ»iÿʽÿË–ÿÏȯÿ¿±ÿ–“ŽÿŽ‹ÿº»·ÿÙÞÕ€îóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ÔÙØ€¤±¯ÿr“Œÿg¥™ÿ{×ÄÿlæÎÿCÙ¼ÿ0Ö·ÿ%×´ÿ"Ô±ÿ Ò¯ÿ άÿ"Ï©ÿ#˦ÿ"É ÿ"Æÿ#Ùÿ#Á“ÿ½Žÿ »ˆÿ¹ƒÿ·ÿµ~ÿ³|ÿ³zÿ²yÿ°xÿ¯wÿ±uÿ±uÿ°yÿ°~ÿ%±‚ÿ4±‰ÿA·”ÿVºžÿpÆ®ÿ‘ÕÄÿ¶çÙÿÔóì€ëüøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÔ€×ʼÿÁ³œÿ´¡~ÿ¨”dÿ¨Tÿ£Hÿ£†Aÿ§}:ÿ§}:ÿ¨€8ÿ©‚7ÿ©„4ÿ¨ƒ3ÿ«„5ÿ®‡8ÿ¯‡<ÿ±‰>ÿ³ŒAÿµŽCÿ¶“Cÿ¹—Cÿ¼ŸDÿ¿¢GÿÀ¥Nÿ§PÿÇ®NÿαNÿϳNÿѵPÿѹYÿÏ»fÿÑÂ}ÿÕÉ“ÿØѪÿ¯«“ÿŽŽ~ÿ§¢ŸÿÎÉÊÿîéê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèææ2¾ÃÂÿˆ•“ÿs”ÿ‡Å¹ÿÛÈÿdÞÆÿ=Ó¶ÿ/Õ¶ÿÑ®ÿ%×´ÿ Ò¯ÿɧÿË¥ÿ È£ÿÅœÿ™ÿ¿•ÿ½ÿ¹Šÿ¸…ÿ¶€ÿµÿ³|ÿ²{ÿ²yÿ±xÿ°xÿ¯wÿ²vÿ²vÿ±zÿ°~ÿ&²ƒÿ;¸ÿPÆ£ÿjβÿæÎÿ°ôãÿÒÿõƒæÿþ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüïáOëÝƽ×Ä¡ÿ¿«{ÿ³›_ÿ¨”Mÿ§ŠEÿ«>ÿ§}:ÿ¦~6ÿ¨6ÿ¨ƒ3ÿ§‚2ÿªƒ4ÿ®‡8ÿ­…:ÿ®†;ÿ°‰>ÿ²‹@ÿ²?ÿ¶”@ÿ¸›@ÿºBÿ½¢Kÿ¾£LÿÄ«Kÿ̯LÿβMÿϳNÿζVÿË·bÿȹtÿÏÃÿÑÊ£ÿËǯÿ¢¢’ÿŽ‰†ÿ¸³´ÿáÜÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëéé(ÓÑщ¡ª§ÿu”ÿp°¤ÿ{ÙÈÿcÛÃÿF×»ÿ9Ó¶ÿ.Ѳÿ(Ï®ÿ&Ò°ÿͪÿʧÿÈžÿÅœÿ—ÿ¾”ÿ»ÿ¹Šÿ¶…ÿ¶€ÿµ~ÿ³|ÿ³zÿ±yÿ°xÿ°xÿ®wÿ®wÿ°wÿ³zÿ%µÿ:¶ŠÿQ»—ÿrƪÿ˜ØÅÿ»åÚÿÝøôcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòèÖ~ÙϱÿƸŽÿ°¥sÿ¥”[ÿ²ŠPÿ¯ƒFÿ©>ÿ©€;ÿ¨‚4ÿ§3ÿ©‚3ÿ¬…6ÿªƒ8ÿ¬…:ÿ®‡<ÿ°‰>ÿ°=ÿ³‘=ÿ´—<ÿ¶™>ÿ·Iÿ¹ŸKÿĤKÿ̪MÿÓ­MÿÔ®NÿÓ²QÿзUÿųZÿοvÿÏÇ‹ÿÙÓªÿ½¤ÿ–‰ÿ¤–¢ÿȾÊÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞÞY¾¼¼ÿ–“ÿž—ÿŠÊ¾ÿy×ÆÿcÛÃÿ?дÿ7Ñ´ÿ&ɪÿ)ЯÿʨÿÅ¢ÿ˨ÿÆœÿ™ÿ¿”ÿ»‘ÿ¸Œÿ·ˆÿ³‚ÿ³}ÿ³|ÿ²{ÿ²yÿ°xÿ°xÿ¯wÿ®wÿ®wÿ±xÿ¸ÿ0ÀŒÿKÇ›ÿfЬÿŒàÄÿ¶öãÿÜÿûcèÿÿ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï þôÖ~ìÞ´ÿÌÁÿ¸§nÿ½•[ÿ·‹Nÿ®„Cÿ«‚=ÿª„6ÿ§3ÿ§€1ÿªƒ4ÿ§€5ÿ©‚7ÿ¬…:ÿ®‡<ÿ­Š:ÿ¯9ÿ°“8ÿ²•:ÿ²˜Dÿ´šFÿ¿ŸFÿÇ¥HÿΨHÿЪJÿÏ®Mÿ˲PÿųZÿĵlÿûÿÈ™ÿÑ̳ÿ±¨¤ÿ”†’ÿ°¦²ÿÛÛÛnîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçèEÜÔÕ€¬¤¥ÿx™’ÿh·©ÿbêÐÿ9ܽÿ*Úµÿ%Õ°ÿ)Ϫÿ&̧ÿ%Ì¥ÿ#Ê£ÿ!Çžÿ!šÿ%Ãÿ#Á‹ÿÀŒÿ¼Œÿ·Šÿ´ˆÿ²ƒÿ±~ÿ ±xÿ µwÿ²tÿ°sÿ ¯vÿ­xÿ­wÿ°‚ÿ$¯‰ÿ>¶—ÿV¼ ÿ~űÿ±ÞÎÿäòì;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ØÖ~¸¹·ÿ©¤ƒÿž“_ÿŸŒOÿ¦ŠCÿª2ÿ¬~0ÿ³‚8ÿ®{5ÿ¥}5ÿ£€7ÿ¡ˆ2ÿ£Š4ÿ¦‹4ÿ¯Œ6ÿ¸Š<ÿ¹‹=ÿ»”?ÿ»˜Bÿ½›Gÿ½ Kÿ¿¤Mÿ©MÿÆ®JÿÍ°Mÿ̯LÿØ»XÿÕ»aÿÚÄ‚ÿØÆ—ÿÔƯÿ—†ÿ˜™ÿÈÊËÿæèé2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚßànÈÀÁÿ¥žÿ‡¨¡ÿvÅ·ÿ[ãÉÿ4׸ÿ'ײÿ#Ó®ÿ'ͨÿ$Ê¥ÿ#Ê£ÿ!È¡ÿÄ›ÿÀ˜ÿ#Á‹ÿ!¿‰ÿ½‰ÿºŠÿµˆÿ²†ÿ±‚ÿ°}ÿ ²yÿ µwÿ²tÿ°sÿ ¯vÿ ®yÿ°zÿ³…ÿ,·‘ÿJ£ÿkѵÿ™àÌÿÆóã½ìúôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíÜÝÛnÅÀŸÿ²§sÿ©–Yÿ¬Iÿ¯†7ÿ¯3ÿ²7ÿ®{5ÿ¥}5ÿ£€7ÿ ‡1ÿ¡ˆ2ÿ¥Š3ÿ®‹5ÿ·‰;ÿ¹‹=ÿ¹’=ÿ¹–@ÿº˜DÿºHÿ¼¡Jÿ¿¦JÿĬHÿË®KÿË®KÿÒµRÿδZÿÒ¼zÿÔ“ÿÒÄ­ÿ´ª£ÿž™šÿ¬®¯ÿÞàáYîíïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêïîÈÐÏ° ¨§ÿœšÿ…¿´ÿw×ÆÿJܾÿ.ѱÿ&Ò®ÿ"Ϊÿ$ˤÿ"É¢ÿ!ÈŸÿÅœÿ—ÿ½“ÿ¿ˆÿ¼†ÿ¹…ÿ´…ÿ²ƒÿ°ÿ¯}ÿ°yÿ¯tÿ°uÿ¯sÿ¯sÿ°yÿ¯}ÿ#±„ÿ;µÿ`½¢ÿ‰Ë¸ÿ§äÐÿÌ÷êÿéÿø(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäàÎʾ¢ÿµ¥{ÿ¯—cÿ«ŒGÿª„<ÿ«‚9ÿ§~5ÿ§~9ÿ¨:ÿ¤8ÿ¥‚9ÿ¨„8ÿ­†7ÿ´‰8ÿ¶‹:ÿ¶Ž;ÿµ‘=ÿµ•Bÿ¸˜Eÿ¸›Fÿ¼¡Gÿ¦GÿÅ©JÿÊ­KÿÊ­KÿÈ®TÿÍ´nÿп‡ÿÓßÿÔË°ÿ¤ž“ÿ‘‘‘ÿÌÌÌÿãááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàåäO²º¹ÿ‘™˜ÿ—¤¢ÿ‘ËÀÿzÚÉÿAÓµÿ,ϯÿ"Ϊÿ˧ÿ"É¢ÿ Ç ÿÅœÿ™ÿ¿”ÿºÿ½†ÿ¹ƒÿ¶‚ÿ±‚ÿ°ÿ®ÿ­{ÿ¯xÿ¯tÿ°uÿ¯sÿ°tÿ²{ÿ!´‚ÿ,ºÿGÁ›ÿsеÿŸáÎÿ¼ùåÿÙÿ÷yìÿûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýùç2ëßÃÜÔÄšÿëwÿ¶—Rÿ°ŠBÿ¯†=ÿ«‚9ÿ¨:ÿ§~9ÿ£€7ÿ¤8ÿ§ƒ7ÿ«„5ÿ°…4ÿ³ˆ7ÿ³‹8ÿ²Ž:ÿ±‘>ÿ³“@ÿ´—Bÿ¸Cÿ¿£Dÿ¦GÿÈ«IÿǪHÿƬRÿÆ­gÿÈ·ÿ̼˜ÿØÏ´ÿª¤™ÿÿ²²²ÿÙ××~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ×Öƒ˜©¦ÿƒŸ™ÿ€¾²ÿvÕÁÿXØ¿ÿ0Ï­ÿ,Эÿ#Ì¥ÿ!Ê£ÿ!ÇžÿÅœÿÄ™ÿÀ•ÿ¼ÿ·‹ÿºƒÿ·ÿ³~ÿ±|ÿ¯zÿ®yÿ¯wÿ®vÿ!¯tÿ"°uÿ°tÿ°yÿ´ƒÿ&¹ÿG¿œÿwȯÿ»ÙÌÿÝíæcîÿö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûòï çÞщ˿£ÿ³¡xÿ§“Zÿ§Gÿ©†Bÿ¦:ÿ§}8ÿ¨y;ÿª{=ÿ«~;ÿ«8ÿ«…3ÿ­‡5ÿ¯Š6ÿ±Œ8ÿ°=ÿ²?ÿ³“@ÿ·—Dÿ½DÿÁ¢EÿȨIÿȨIÿÈ«PÿêZÿÅ°lÿÌ»‚ÿ×É•ÿÄ»šÿ¤¤˜ÿš–ÿÎÍÉ°ìêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéçç2ÁÆÅ쎟œÿ‘­§ÿŒÊ¾ÿtÓ¿ÿMÍ´ÿ,Ë©ÿ*Ϋÿ É¢ÿÇ ÿÅœÿ™ÿÁ–ÿ¾“ÿ¹Œÿµ‰ÿ¸ÿµÿ²}ÿ°{ÿ¯zÿ®yÿ®vÿ­uÿ ®sÿ ®sÿ°tÿ²{ÿ!¹ˆÿ-À”ÿTÌ©ÿˆÙÀÿÏíàìüõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóæ2åÙ½ÿ˹ÿ¶¢iÿ­“Mÿ¬‰Eÿ§€;ÿ§}8ÿ§x:ÿª{=ÿ«~;ÿª~7ÿª„2ÿ­‡5ÿ­ˆ4ÿ®‰5ÿ®‹;ÿ°=ÿ°=ÿ´”AÿºšAÿ¾ŸBÿÅ¥FÿƦGÿÆ©Nÿ½¤Tÿ¿ªfÿƵ|ÿʼˆÿÔ˪ÿ¯¯£ÿŒˆÿ¼»·ÿÞÜÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞÜÜc«·±ÿ¤šÿ³ÿpѽÿRغÿ2άÿ$Ê¥ÿ%˦ÿ#Çžÿ!ÅœÿÄ—ÿÁ”ÿ¿ÿ¼ÿ¸ˆÿµ†ÿ³~ÿ²}ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ®rÿ­rÿ­vÿ¯yÿ%´‡ÿ=¼•ÿeêÿ’ÔÁÿÃæÜÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéë(ÕÑƽ¼²”ÿªškÿ©“Qÿ©Š?ÿ­‚9ÿ¯|6ÿ¯{9ÿ­{9ÿ¨{8ÿ¥€6ÿ©…7ÿª„2ÿ¬†4ÿ¬ˆ:ÿ®Š<ÿ°Œ>ÿ´Bÿº•Cÿ½šDÿÁžDÿàFÿŦKÿÀ¤Mÿ«[ÿÆ°hÿκsÿßÏ”ÿ½¹¡ÿ™Žÿ­¨ŸÿÍÊÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëÕÓÓƒ ¬¦ÿƒ¨žÿˆË¼ÿl͹ÿQ×¹ÿ2άÿ"È£ÿ!Ç¢ÿ"Æÿ Ä›ÿ•ÿ¿’ÿ½Žÿº‹ÿ·‡ÿ´…ÿ²}ÿ±|ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ­qÿ¯tÿ!°yÿ"´~ÿ-¼ÿIÈ¡ÿtÒ¹ÿ¥çÔÿÙüòyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðìáOÒȪÿ¸¨yÿµŸ]ÿ°‘Fÿ²‡>ÿ±~8ÿ¯{9ÿ¬z8ÿ¦y6ÿ£~4ÿ§ƒ5ÿ©ƒ1ÿ«…3ÿ«‡9ÿ­‰;ÿ¯‹=ÿ³Aÿ¸“Aÿ»˜Bÿ¾›AÿÀCÿÄ¥JÿÀ¤Mÿì\ÿ¾¨`ÿË·pÿÒ‡ÿÅÁ©ÿ³¯¤ÿ¢”ÿÀ½¸ÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååEº¼¼ÿ­¢ÿ…ƶÿu׿ÿRÖ¸ÿ/Ñ­ÿ$Ê¥ÿÇÿÈžÿ ÖÿÁ”ÿ¿ÿ½ÿ¼‰ÿ¸†ÿµÿ²ÿ °|ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ°qÿ®sÿ²wÿµƒÿ1¸ŒÿV½žÿ‡Ì·ÿ¸ÞÒÿâíêEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäßàYÈħÿµ§wÿ­œSÿ°Eÿ±‡:ÿ¬‚5ÿ©}6ÿª}:ÿ§€<ÿ¥~:ÿ¨2ÿ¨2ÿªƒ8ÿ­†;ÿ°‰>ÿ²‹@ÿ¶Aÿ¹“Aÿ¼˜@ÿ½™AÿÁŸEÿÁ¤IÿÁ¥NÿÁ§Sÿ̲^ÿÓ»oÿÍÂœÿÍÅ®ÿ—„ÿ³¯¤ÿÚÙÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÙÙ~©««ÿ‹« ÿ„ŵÿsÕ½ÿOÓµÿ+Í©ÿ!Ç¢ÿÆœÿÆœÿ•ÿÀ“ÿ¾Žÿ»‹ÿº‡ÿ¶„ÿ´€ÿ±~ÿ¯{ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ±rÿ°uÿ³xÿ#ºˆÿ9À”ÿ`Ǩÿ—ÜÇÿÊðä¥ïú÷ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÜ¿ÿÍ¿ÿ¸§^ÿ·—Lÿ´Š=ÿ¯…8ÿª~7ÿª}:ÿ¦;ÿ¥~:ÿ¨2ÿ¨2ÿ©‚7ÿ¬…:ÿ®‡<ÿ°‰>ÿ´?ÿ·‘?ÿ¹•=ÿ»—?ÿ¾œBÿ¾¡Fÿ¾¢Kÿ¾¤PÿÇ­YÿζjÿÆ»•ÿÈÀ©ÿ¥ŸŒÿ­©žÿÎÍÉ°ìíñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÈÎÍ°ž¤£ÿt² ÿlÌ´ÿ^غÿ9Ñ®ÿ!Ê£ÿÅžÿÚÿÄ—ÿÀ‘ÿ¿Œÿ¼ˆÿº†ÿ¸‚ÿ¶€ÿ³{ÿ±yÿ ­zÿ¬yÿ ±tÿ °sÿ±sÿ±sÿ²uÿ±yÿ²€ÿ4»“ÿ_Á£ÿŽÌ¼ÿÎãÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEØгÿ¿°‚ÿ³Ÿ^ÿªEÿª‡>ÿ¦7ÿ¥|3ÿ¦{8ÿ¦{8ÿ¨€5ÿ§4ÿ¨6ÿ«‚9ÿ­„;ÿ®…<ÿ±‰>ÿµŽ?ÿ·’@ÿ¸•?ÿ»›Bÿ¿ŸFÿ¾ GÿÁ£JÿÉ«RÿÒ³^ÿμ‡ÿΠÿ¾´–ÿ¬¦“ÿÀ½µÿàáåOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¾ÄÃÿ¢¨§ÿ|º¨ÿnζÿZÔ¶ÿ3˨ÿÆŸÿÄÿ™ÿÁ”ÿ¾ÿ½Šÿº†ÿ¸„ÿ¶€ÿ´~ÿ²zÿ°xÿ¬yÿ«xÿ °sÿ °sÿ °rÿ±sÿ²uÿ³{ÿ&¹‡ÿ<ÛÿkͯÿÛËÿÜñécÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøöìêâÅÊÓÄ–ÿÀ¬kÿ±–Lÿ¯ŒCÿ©„:ÿ¦}4ÿ¥z7ÿ§|9ÿ¨€5ÿ§4ÿ¨6ÿª8ÿ«‚9ÿ¬ƒ:ÿ¯‡<ÿ³Œ=ÿµ>ÿ·”>ÿ¹™@ÿ½Dÿ½ŸFÿ¿¡HÿŧNÿˬWÿǵ€ÿʾœÿÍÃ¥ÿª¤‘ÿ°­¥ÿÓÔ؃íðøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìôóÎÖÕ­¸¶ÿ¢°®ÿu˳ÿV׸ÿCÓ°ÿ*Ç¢ÿÄ›ÿÄ›ÿ!•ÿ¿ÿ¾‹ÿ¼‰ÿ¸‚ÿ¶€ÿ ´~ÿ²|ÿ³yÿ±wÿ¯yÿ¬wÿ®sÿ®sÿ­rÿ®sÿ²zÿ$´„ÿ>½–ÿhêÿšÑÂÿÐä߉ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ñìØпÿ³“ÿ¬škÿª‘Sÿ¨ŠCÿ¦7ÿ«~4ÿ­€6ÿ©€7ÿ¨6ÿª6ÿ«€7ÿ¬8ÿ­‚9ÿ®‡9ÿ±Š<ÿ°Ž;ÿ²=ÿ´•@ÿ·˜Cÿ¹›Dÿ¿œFÿÅ KÿÉ£QÿêjÿÈ·†ÿÔÈ ÿ¯¥ÿª¦›ÿÊÊÊÿéìñ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÃËÊÿ¡¬ªÿ¥³±ÿ|ÒºÿUÖ·ÿ=ͪÿ&ÞÿÚÿ™ÿ¿’ÿ½ÿ¼‰ÿº‡ÿ·ÿµÿ²|ÿ±{ÿ²xÿ°vÿ¯yÿ¬wÿ­rÿ®sÿ®sÿ¯tÿµ}ÿ*ºŠÿDÃœÿq̳ÿ§ÞÏÿÝñìcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèàÏÑ¢ÿ¸¦wÿ²™[ÿ«Fÿ§‚8ÿ«~4ÿ«~4ÿ¨6ÿ§~5ÿ©~5ÿ«€7ÿ¬8ÿ¬8ÿ¬…7ÿ¯ˆ:ÿ®Œ9ÿ±<ÿ²“>ÿµ–Aÿ¸šCÿ¾›EÿÂHÿÅŸMÿ¾¥eÿ±€ÿÒÆžÿ·­•ÿª¦›ÿÀÀÀÿàãèOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëE¹ÇÅÿ™§¥ÿ£¶³ÿfÔ¸ÿHÓ²ÿ,ɤÿ$Áœÿ"˜ÿ¿•ÿ»ÿ»ÿ»Šÿ¹„ÿ¶~ÿ³|ÿ ±zÿ°yÿ±uÿ ±tÿ °wÿ®uÿ#ªrÿ$«sÿ ­tÿ°vÿ'¸„ÿ1¿”ÿbèÿ”ÑÃÿÒã߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëØÉǽ¼¬•ÿ±›qÿ«Rÿ¨†:ÿ®‚/ÿ«,ÿ§}6ÿ¦|5ÿ©~5ÿ«€7ÿ«6ÿ«6ÿ«„6ÿ®‡9ÿ®‹;ÿ°=ÿ±‘>ÿ³“@ÿ¸–Cÿ¾˜FÿÛIÿÄœJÿÀ¤]ÿïvÿÑÁ“ÿ¸šÿ¯¬ÿ¸¸¸ÿÖÙÞ~íðõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêòñÜçåc¶ÄÂÿ—¥£ÿ¤·´ÿbдÿBͬÿ(Å ÿ"¿šÿ!Á—ÿ¼’ÿ¹‹ÿ»ÿº‰ÿ¸ƒÿµ}ÿ²{ÿ°yÿ¯xÿ±uÿ °sÿ °wÿ®uÿ#ªrÿ%¬tÿ!®uÿ!³yÿ+¼ˆÿ6Ä™ÿjË°ÿŸÜÎÿÝîêcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåÖԀɹ¢ÿº¤zÿ±•Xÿ­‹?ÿ±…2ÿ¬€-ÿ¦|5ÿ¥{4ÿ¨}4ÿª6ÿ«6ÿ«6ÿªƒ5ÿ­†8ÿ«ˆ8ÿ­Š:ÿ®Ž;ÿ°=ÿµ“@ÿ¼–DÿÀ˜FÿÁ™GÿºžWÿ»§nÿȸŠÿÅ»ÿ²¯ ÿ³³³ÿÐÓØÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÙØy©º¶ÿ…»®ÿlʲÿ@Ö²ÿ4ʦÿ*Ãœÿ&¿˜ÿ ¼“ÿ¼Žÿ¼Šÿ¸†ÿ¸„ÿ¶‚ÿµ}ÿ²{ÿ°yÿ¯xÿ®vÿ­uÿ®uÿ«rÿ®rÿ­qÿ)­xÿ/²€ÿ3·ŽÿEǦÿ´Ã»ÿÓßßÿéøú(ïþÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëáOÊǹÿ²©•ÿ¬œrÿ§ŒTÿ«ƒ1ÿª‚0ÿ¥€0ÿ¤}2ÿ¥}2ÿ§4ÿ©€7ÿ©€7ÿª8ÿ¬ƒ:ÿ®†;ÿ¯‡<ÿ±Œ<ÿ³Ž>ÿ´’>ÿ·•AÿºšAÿ¼œCÿÀMÿÌ¥aÿȲpÿÕÅ–ÿ½¸—ÿ©©›ÿËÍÕÿååñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíñÑÍÌš¢³¯ÿˆ¾±ÿrиÿ<Ò®ÿ1Ç£ÿ'À™ÿ$½–ÿº‘ÿ»ÿ»‰ÿ·…ÿ¶‚ÿµÿ´|ÿ±zÿ°yÿ¯xÿ®vÿ®vÿ°wÿ­tÿ°tÿ°tÿ-±|ÿ4·…ÿ:¾•ÿMÏ®ÿ¿ÎÆÿÛççníüþðÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôòè(×Ôƽ¾µ¡ÿµ¥{ÿ®“[ÿ°ˆ6ÿ¬„2ÿ¦1ÿ¥~3ÿ¦~3ÿ¨€5ÿ©€7ÿ¨6ÿ©€7ÿ«‚9ÿ¬„9ÿ®†;ÿ¯Š:ÿ²=ÿ²<ÿµ“?ÿ¸˜?ÿºšAÿ¼™IÿÈ¡]ÿ¬jÿÏ¿ÿ¼·–ÿ¦¦˜ÿÀÂÊÿÜÜècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõçë2¿ÂÀÿŽ°¥ÿ~ijÿlÕºÿ:Ψÿ/Ãÿ(½•ÿ%º’ÿ ¹Œÿ¸‹ÿ¹‡ÿµƒÿ´~ÿ²}ÿ²{ÿ¯yÿ¯wÿ­vÿ­vÿ­vÿ®vÿ«sÿ¯vÿ°wÿ*³ÿ=¹‹ÿK›ÿqеÿÐÛÓÿçïï2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäâØyÈIJÿ¹­‰ÿ°™gÿ¯Aÿ¬…:ÿ©6ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿ«8ÿ­‚9ÿ®ƒ:ÿ¯ˆ:ÿ±Š<ÿ²;ÿµ>ÿ¶”@ÿ¸–Bÿ»–DÿÆŸUÿÁ©aÿμ‡ÿû–ÿ«©—ÿ¹»»ÿØ×à~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòäè;¹¼ºÿ¯¤ÿ~ijÿgеÿ6ʤÿ,Àšÿ&»“ÿ$¹‘ÿ·Šÿ¶‰ÿ·…ÿ´‚ÿ³}ÿ±|ÿ±zÿ®xÿ®vÿ¬uÿ¬uÿ¬uÿ­uÿªrÿ¯vÿ²yÿ,µÿ@¼ŽÿPÇ ÿyؽÿÙäÜyìôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEÒμÿ¿³ÿ´kÿ´’Fÿ­†;ÿª‚7ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿª~7ÿ¬8ÿ­‚9ÿ­†8ÿ°‰;ÿ±Œ:ÿ³Ž<ÿ´’>ÿ¶”@ÿº•Cÿ›Qÿ¼¤\ÿȶÿƾ™ÿ±¯ÿ´¶¶ÿÕÔÝ€ïîø ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçáâO­¼¸ÿ‚µ§ÿnȱÿPÍ­ÿ,ËŸÿ#–ÿ½ÿ»ÿº‡ÿ¸…ÿ·ƒÿ´€ÿµ|ÿ³{ÿ²xÿ°wÿ®uÿ­uÿ¬tÿ¬tÿ®vÿ«sÿ¯wÿ³~ÿ,¹†ÿI¾—ÿsǪÿ¥ÙÈÿäêå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿññëÖÔÊ¥½¶›ÿ² wÿ«”Vÿ¬‡Cÿªƒ9ÿª6ÿ¨}4ÿ©~5ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ¬8ÿ­‚9ÿ¯…:ÿ±‡<ÿ±Š;ÿ³Œ=ÿ´=ÿ¶‘?ÿº”Bÿ¾˜Fÿº Tÿ¯rÿȽ‘ÿ¸³šÿ²³ªÿÓÏÔÿîëôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞØÙy¬»·ÿ…¸ªÿnȱÿLÉ©ÿ)Èœÿ!À”ÿ¼Žÿ»ÿ¹†ÿ·„ÿ¶‚ÿ³ÿ´{ÿ²zÿ²xÿ¯vÿ®uÿ¬tÿ¬tÿ¬tÿ­uÿ«sÿ°xÿµ€ÿ/¼‰ÿM›ÿwË®ÿ«ßÎÿìòíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞԀƿ¤ÿ¹§~ÿ²›]ÿ±ŒHÿ«„:ÿª6ÿ§|3ÿ¨}4ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ«€7ÿ­‚9ÿ®„9ÿ°†;ÿ°‰:ÿ²‹<ÿ³Ž<ÿµ>ÿº”Bÿº”Bÿ¹ŸSÿ»¨kÿøŒÿºµœÿ®¯¦ÿÌÈÍÿìéò(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïïï ÓÓÓƒ£¾µÿ|¾«ÿZ˯ÿ>Ê¥ÿ'Å—ÿ½ÿº‹ÿ¹Šÿ·ƒÿ¶‚ÿ¶~ÿ³{ÿ³yÿ²xÿ±uÿ°tÿ¯sÿ®sÿ®sÿ®sÿ­rÿ©sÿ°{ÿ!µ…ÿ5½“ÿUáÿ•É·ÿÎßÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ÍÉ·ÿº¯ÿ±nÿ¬Sÿ®‡<ÿ¬‚7ÿ§}2ÿ§}2ÿ©~5ÿ©~5ÿ«~5ÿ¬6ÿ­€6ÿ®7ÿ­ƒ6ÿ¯…8ÿ¯ˆ9ÿ°‰:ÿ³;ÿ´Ž<ÿº“>ÿ¹’=ÿ½ Oÿ¼¦dÿĶ‚ÿú™ÿ·¯¢ÿÊÆÅÿêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ÐÐÐÿ¥À·ÿ~À­ÿYÊ®ÿ<È£ÿ$”ÿ»ÿ¸‰ÿ·ˆÿ¶‚ÿµÿµ}ÿ³{ÿ²xÿ±wÿ±uÿ°tÿ¯sÿ®sÿ¯tÿ¯tÿ¯tÿ«uÿ²}ÿ%¹‰ÿ9Á—ÿZȦÿšÎ¼ÿÓäÛƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÕÑ¿ÿÀµ•ÿµ¡rÿ®’Uÿ°‰>ÿ­ƒ8ÿ¨~3ÿ§}2ÿ¨}4ÿ¨}4ÿ«~5ÿ«~5ÿ¬5ÿ­€6ÿ­ƒ6ÿ®„7ÿ®‡8ÿ¯ˆ9ÿ²Œ:ÿ³;ÿ¶:ÿ´8ÿ»žMÿ¸¢`ÿÁ³ÿÄ»šÿ¸°£ÿÇÃÂÿçæê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéîí(ÄÉÈÿš¼±ÿ€É³ÿJͬÿ:Ç ÿ'¾ÿ#º‰ÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ²~ÿ3»‘ÿBÀœÿfĬÿÀÑÈÿâéæEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïóÔÔÈÿ¾¶Ÿÿ¯¡}ÿ«’`ÿ²ŽBÿ©6ÿ¤|1ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿ«4ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¹‘?ÿ´•Fÿ³Uÿijzÿø’ÿ»±ŸÿÆ¿¼ÿàßãYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÃÈÇÿš¼±ÿÊ´ÿJͬÿ9ÆŸÿ&½Œÿ"¹ˆÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ ³ÿ4¼’ÿCÁÿhÆ®ÿÃÔËÿæíê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòö ÙÙ͚û¤ÿ³¥ÿ¯–dÿ´Dÿ«ƒ8ÿ¥}2ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿª€3ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¸>ÿ³”Eÿ²œTÿÁ°wÿÁ¶ÿº°žÿĽºÿÞÝácÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêé;ÁÇÂÿš¼±ÿÊ´ÿMͪÿ4Æœÿ!¾Œÿºˆÿ·„ÿ¶ƒÿ¶€ÿ´~ÿ²{ÿ²{ÿ±xÿ±xÿ°wÿ°wÿ¯vÿ¯vÿ¯vÿ®vÿ°xÿ ¯xÿ*´„ÿB¼–ÿTÀ£ÿ„´ÿÑÔÒ‰îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜÞØyÆ¿®ÿ³¨ÿ°›nÿµ•Jÿ¬‡=ÿ¥€6ÿ¦7ÿ¤5ÿ¤5ÿ§€6ÿ§€6ÿ§€5ÿ¨6ÿ©‚7ÿªƒ8ÿ©…7ÿ«‡9ÿ®Š<ÿ¯‹=ÿ²‹=ÿ¶Dÿ²’Gÿ´™VÿÁ®uÿųŽÿ»°šÿÄ»¸ÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçæE¾Ä¿ÿ™»°ÿÊ´ÿLÌ©ÿ2Äšÿ!¾Œÿ»‰ÿ¸…ÿ·„ÿ·ÿµÿ³|ÿ³|ÿ³zÿ²yÿ²yÿ±xÿ±xÿ±xÿ±xÿ°xÿ³{ÿ$³|ÿ.¸ˆÿFÀšÿWæÿ†Ä¶ÿÔ×Õ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâäÞYËijÿ¶«ÿµ sÿ¸˜Mÿ°‹Aÿ¨ƒ9ÿ¨ƒ9ÿ¦7ÿ¦7ÿ©‚8ÿ©‚8ÿ©‚7ÿªƒ8ÿ«„9ÿ¬…:ÿ«‡9ÿ­‰;ÿ¯‹=ÿ±?ÿ³Œ>ÿ¶Dÿ³“Hÿ´™Vÿ¾«rÿIJÿ¼±›ÿú·ÿÙÕÚ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿœº­ÿ„ʳÿP̨ÿ8˜ÿ+¾Œÿ'ºˆÿ$·…ÿ$·…ÿ#¶‚ÿ!´€ÿ ´~ÿ ´~ÿ³{ÿ³{ÿ³{ÿ²zÿ±{ÿ±{ÿ±{ÿ±{ÿ$³|ÿ-³~ÿ:¸ŽÿW¾Ÿÿt¿ªÿ˜Â»ÿÚ×Ù~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ËŸÿ´¬•ÿ·¥|ÿº™Tÿ®Hÿ¦…@ÿ¥„?ÿ¤=ÿ¥‚>ÿ©„@ÿ¨ƒ?ÿ§ƒ=ÿ¨„>ÿ©…?ÿª†@ÿ«‡Aÿ­‰Cÿ­‹Eÿ®ŒFÿ²‹Gÿ³ŒHÿ³’Mÿ³™Wÿ½ªqÿIJÿ½²œÿÁ¸µÿ×Ó؃ïðô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿ»®ÿ…Ë´ÿRΪÿ;Å›ÿ-ÀŽÿ*½‹ÿ'ºˆÿ&¹‡ÿ&¹…ÿ$·ƒÿ#·ÿ#·ÿ"·ÿ"·ÿ!¶~ÿ!¶~ÿ!µÿ!µÿ!µÿ!µÿ&µ~ÿ0¶ÿ>¼’ÿ[£ÿvÁ¬ÿ™Ã¼ÿÛØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéç2Ìƹÿ¶®—ÿ¾¬ƒÿ¿žYÿ³’Mÿ¬‹Fÿª‰Dÿ©†Bÿª‡Cÿ®‰Eÿ¬‡Cÿ¬ˆBÿ­‰Cÿ®ŠDÿ¯‹Eÿ¯‹Eÿ°ŒFÿ°ŽHÿ±Iÿ¶Kÿ¶Kÿ·–Qÿ¶œZÿ½ªqÿųŽÿ¾³ÿÀ·´ÿÕÑÖÿîïó ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Á¾ÿ¢¼¯ÿŒÍ·ÿVÒ®ÿKÈ ÿQÀ”ÿM¼ÿKºŽÿJ¹ÿJº‹ÿI¹ŠÿH¸ˆÿH¸ˆÿG·‡ÿF¶†ÿF¶†ÿF¶†ÿD·†ÿD·†ÿD¶‡ÿD¶‡ÿ9»†ÿ<¾‰ÿOšÿkǪÿ‹Â³ÿ¬ÂÀÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçéé2ÍǼÿ¹±šÿƳŽÿÁ¥eÿº™Zÿ³’Sÿ°Pÿ°Nÿ²Pÿ´Pÿ²ŽNÿ²ŽNÿ³Oÿ´Pÿ´Pÿµ‘Qÿµ‘Qÿµ’Rÿ¶“Sÿ¼–Vÿº”Tÿ»›Zÿº¡cÿÁ¬xÿȶ‘ÿÁ¶¢ÿÀ·³ÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Âÿÿ£½°ÿŽÏ¹ÿYÕ±ÿNË£ÿVÅ™ÿS–ÿP¿“ÿP¿“ÿPÀ‘ÿN¾ÿM½ÿN¾ŽÿM½ÿL¼ŒÿL¼ŒÿL¼ŒÿJ½ŒÿJ½ŒÿJ¼ÿJ¼ÿAÃŽÿDÆ‘ÿVÉ¡ÿqÍ°ÿÆ·ÿ®ÄÂÿÞÚßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèêê(ÎȽÿ»³œÿ̹”ÿÉ­mÿ¡bÿ»š[ÿ¸—Xÿ¸•Vÿ¹–Wÿ»—Wÿ¸”Tÿ¹•Uÿº–Vÿ»—Wÿ»—Wÿ»—Wÿ»—Wÿ»˜Xÿ¼™YÿÃ]ÿÁ›[ÿ¢aÿÀ§iÿį{ÿ˹”ÿĹ¥ÿ¹µÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞàèY¾ÀÈÿ©¼¹ÿ­Í¼ÿЪÿŒÈ ÿÚÿ{¿–ÿ|À—ÿ}Á˜ÿ{¿–ÿz¾•ÿz¾•ÿy½”ÿx¼“ÿx¼“ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿ€¼“ÿ‰½•ÿ•Ç¥ÿŸÆ­ÿ¬Ç·ÿµÅ¾ÿÖÞÝ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2ÆÁÂÿ±³ ÿº¼žÿ¼±ÿ²£rÿªœhÿ­šgÿ«™dÿ®˜dÿ±™cÿ°˜bÿ²šdÿ³›eÿ³›eÿ´œfÿ³iÿ³iÿ²iÿ²iÿµŸoÿµŸoÿ±¤pÿ±©tÿ·µ…ÿ¿½šÿº¹¤ÿ½ºµÿÖÓÕÿòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßáéY¿ÁÉÿ«¾»ÿ¯Ï¾ÿ Ó­ÿ̤ÿƒÇžÿÚÿÚÿÅœÿ~™ÿ~™ÿ~™ÿ}Á˜ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ†Â™ÿÛÿšÌªÿ¤Ë²ÿ®É¹ÿ´Ä½ÿÕÝÜ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÇÂÃÿ³µ¢ÿ¾À¢ÿÀµƒÿ¶§vÿ® lÿ°jÿ®œgÿ±›gÿµgÿ´œfÿ´œfÿ´œfÿµgÿ¶žhÿ´žjÿµŸkÿ´Ÿkÿ´Ÿkÿ·¡qÿ·¡qÿ³¦rÿ³«vÿ¹·‡ÿÁ¿œÿ¼»¦ÿ¿¼·ÿÖÓÕƒòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæâèEÆÂÈÿ½½·ÿÉͺÿÃѨÿºÈŸÿÅ¿šÿÀº•ÿÁ»–ÿ¼—ÿÀº•ÿ¿¹”ÿÀº•ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¿¹”ÿ¿¹”ÿÀº•ÿ´¿—ÿ¶Á™ÿÀË«ÿÂʳÿ¿Æ·ÿ¼ÀºÿØÛÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÅÀÁÿ²³£ÿ¼Ã¢ÿ¹µ€ÿ°¨sÿ¦¡jÿ¨žhÿ¦dÿ©œdÿªždÿ­œcÿ®dÿ®dÿ­Ÿeÿ­Ÿeÿ¬Ÿgÿ¬Ÿgÿ¬¡hÿ¬¡hÿ± mÿ°Ÿlÿ­¦mÿ­«qÿ³·ƒÿ»½™ÿ¸¼£ÿÀ¾¶ÿ×ÕÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçãéEÇÃÉÿ¼¼¶ÿÆÊ·ÿÀÎ¥ÿ¶Ä›ÿÁ»–ÿ½·’ÿ½·’ÿ¾¸“ÿ»µÿ»µÿ¼¶‘ÿ»µÿ»µÿ»µÿ»µÿ»µÿ»µÿ¼¶‘ÿ¼¶‘ÿ¼¶‘ÿ¯º’ÿ²½•ÿ¾É©ÿÁɲÿ½Äµÿ¸¼¶ÿÕØÖ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2½¾ÿ­®žÿ·¾ÿ²®yÿ¨ kÿ˜aÿŸ•_ÿ”[ÿ¡”\ÿ¡•[ÿ¤“Zÿ¥”[ÿ¥”[ÿ£•[ÿ¤–\ÿ¢•]ÿ£–^ÿ¢—^ÿ£˜_ÿ¨—dÿ§–cÿ¤dÿ¥£iÿª®zÿ³µ‘ÿ³·žÿ¾¼´ÿØÖÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçé2ÕÄÈÿÓ¹³ÿäïÿèÅšÿé¸ÿî°ˆÿꬄÿꬄÿë­…ÿ誂ÿ誂ÿ髃ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ髃ÿâ«„ÿÞ®Šÿç¾ÿáÁªÿÓ¿®ÿ¶°ÿ×ÔÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçäæ;½º¼ÿ¦ª—ÿ®¸”ÿ£¨kÿ™™]ÿSÿQÿ‹ŒNÿŒOÿ‘ŒMÿŠKÿŠKÿŠKÿŠKÿŠKÿŽ‹NÿŒOÿŒOÿŽPÿ™ŽTÿ˜Sÿ”“Vÿ–™[ÿ¦nÿ§¯‡ÿ­³šÿ¼½´ÿÙØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêìØÇËÿÔº´ÿã®ÿãÀ•ÿ㲊ÿ誂ÿã¥}ÿã¥}ÿä¦~ÿá£{ÿá£{ÿâ¤|ÿá£{ÿâ¤|ÿâ¤|ÿá£{ÿá£{ÿá£{ÿá£{ÿá£{ÿâ¤|ÿÜ¥~ÿקƒÿà·–ÿܼ¥ÿκ©ÿ¼°ªÿÑÎÉ°ðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäáãO»¸ºÿ¢¦“ÿ¦°ŒÿšŸbÿSÿ„„Hÿ‚‚Fÿ‚Dÿ„Dÿ†Bÿ„@ÿ…€Aÿ„@ÿ„@ÿ„@ÿƒ€Cÿ„Dÿƒ‚Eÿƒ‚EÿŒGÿ‹€Fÿˆ‡JÿŠOÿ’›cÿ ¨€ÿ«±˜ÿ¿À·ÿÜÛÝnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿííí×ÊÌÿܺ­ÿó½¤ÿÿ¶Šÿÿ©{ÿû¡rÿöœmÿõ›lÿöœmÿôškÿó™jÿ÷›lÿöškÿöškÿöškÿôškÿôškÿôškÿõ›lÿõ›lÿõ›lÿûœpÿûšvÿþ¬‰ÿòµ›ÿÞ´¡ÿ¿« ÿËÉÁÿêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÚÜn³´²ÿ™¢ˆÿž¨~ÿŽ•Rÿ†Cÿsz7ÿqx5ÿtv4ÿuw5ÿuw5ÿrt2ÿuv4ÿuv4ÿtu3ÿtu3ÿtv4ÿuw5ÿtx6ÿuy7ÿyw6ÿwu4ÿw|7ÿz„>ÿ…‘Wÿ—¡wÿ¦¯•ÿ¾Á¸ÿÜÞßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ×ÊÌÿÛ¹¬ÿÿû°„ÿ÷¡sÿôškÿï•fÿî”eÿï•fÿì’cÿì’cÿð”eÿï“dÿï“dÿï“dÿí“dÿí“dÿî”eÿï•fÿï•fÿð–gÿõ–jÿõ”pÿø¦ƒÿí°–ÿÚ°ÿ»§œÿÇŽÿæææ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíìðÔÓÕƒ­®¬ÿ“œ‚ÿ•Ÿuÿ„‹Hÿt{8ÿip-ÿgn+ÿjl*ÿjl*ÿjl*ÿhj(ÿij(ÿij(ÿij(ÿhi'ÿhj(ÿik)ÿhl*ÿim+ÿom,ÿmk*ÿns.ÿq{5ÿ}‰Oÿ‘›qÿ£¬’ÿ½À·ÿÞàáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÔÔÔÿؾ®ÿí¶›ÿÿ­ƒÿÿ›lÿÿ’^ÿÿ\ÿÿ[ÿÿ[ÿÿŽ[ÿÿZÿÿŒYÿÿŒYÿÿZÿÿZÿÿZÿÿZÿþŽZÿÿ[ÿÿ\ÿÿ\ÿÿ^ÿÿ–hÿÿŸxÿõªŠÿæ²›ÿ¾¤”ÿ¾½³ÿÞãáYíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëñÍÌÎÿª¬¦ÿ“ž~ÿ›kÿ‡@ÿqu.ÿjn'ÿei"ÿcg ÿfj#ÿde!ÿde!ÿcd ÿcd ÿcd ÿcd ÿcg ÿcg ÿdh!ÿdh!ÿdf ÿeg!ÿem&ÿht,ÿw†IÿŒ™mÿ¡¬’ÿÃÈ¿ÿæçë2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëóòÖÖÖÿÚÀ°ÿí¶›ÿþ¬‚ÿÿ›lÿÿ‘]ÿþŽZÿýYÿýYÿÿŒYÿþ‹XÿÿŠWÿÿ‹Xÿÿ‹Xÿÿ‹Xÿþ‹Xÿþ‹XÿýYÿþŽZÿþŽZÿÿ[ÿþ]ÿÿ“eÿÿœuÿò§‡ÿ屚ÿÀ¦–ÿ½¼²ÿÙÞÜÿíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåãéEÂÁÃÿ£¥ŸÿŽ™yÿ…‘aÿz‚;ÿmq*ÿfj#ÿaeÿ`dÿbfÿabÿabÿ`aÿ`aÿ`aÿ`aÿ_cÿ`dÿ`dÿ`dÿacÿceÿck$ÿgs+ÿw†Iÿšnÿ¤¯•ÿÆËÂÿèéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëöôÒÝÛÿ×ĵÿç¸ÿõ«‡ÿÿmÿÿZÿÿŒWÿþŠUÿÿ‹VÿÿŠVÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰UÿÿŠVÿÿ‹VÿÿŒWÿÿXÿÿXÿüWÿþ•\ÿÿšmÿü¤€ÿð°—ÿÏ©—ÿ¾¸«ÿÏÖÓÿæôó2ïýü ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÜàc¹·¶ÿ £”ÿšrÿ|ŽQÿ{4ÿjn#ÿdgÿ`cÿ^aÿ`cÿ^`ÿ^`ÿ__ÿ__ÿ__ÿ__ÿ]_ÿ]_ÿ^aÿ^aÿ]`ÿ^aÿ_hÿdo)ÿuƒIÿ™oÿ¦°™ÿÉÍÇÿêêðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîù÷ ×âà~Ûȹÿç¸ÿôª†ÿÿmÿÿZÿÿ‹VÿüˆSÿý‰Tÿÿ‰UÿþˆTÿÿˆTÿÿˆTÿÿˆTÿÿˆTÿÿ‰Uÿÿ‰Uÿÿ‹VÿÿŒWÿþŒWÿÿXÿüWÿü“Zÿý˜kÿû£ÿð°—ÿÓ­›ÿ¸²¥ÿÂÉÆÿßíìÿëùøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÕÙ€¯­¬ÿ ‘ÿ›sÿy‹Nÿx|1ÿhl!ÿcfÿ`cÿ^aÿ`cÿ]_ÿ]_ÿ^^ÿ^^ÿ^^ÿ^^ÿ\^ÿ]_ÿ]`ÿ]`ÿ\_ÿ]`ÿ^gÿdo)ÿv„Jÿœrÿª´ÿÎÒÌšîîô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝèæcÛÌÃÿâ·¢ÿíª‹ÿürÿû‘[ÿúWÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰Tÿù‰TÿúŠUÿùŒVÿúWÿúŽXÿúŽXÿõ“Sÿõ—Vÿýšfÿÿ¡~ÿÿ°•ÿä° ÿ¾«žÿ¹º¶ÿØçãÿèöõ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîëíÏÌΚ©¦¡ÿ›žˆÿ‘mÿyŒGÿxz.ÿikÿefÿbcÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ]`ÿ]`ÿ]`ÿ`aÿabÿ`h!ÿgq.ÿz‡Oÿ• xÿ°¹¤ÿÔØÓƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëEàÑÈÿ乤ÿî«Œÿÿ uÿý“]ÿûŽXÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰TÿúŠUÿû‹VÿúWÿûŽXÿúŽXÿúŽXÿö”Tÿö˜WÿýšfÿÿŸ|ÿÿ®“ÿç³£ÿ¸¥˜ÿ¯°¬ÿÏÞÚÿäòñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåâäEÄÁÃÿ¤¡œÿ™œ†ÿ™iÿv‰Dÿuw+ÿhjÿefÿcdÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ\_ÿ]`ÿ]`ÿ_`ÿabÿai"ÿis0ÿ}ŠRÿ™¤|ÿ´½¨ÿÙÝØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìðñæÕÌÿ滪ÿî«ÿý¡~ÿÿ”`ÿÿZÿûˆUÿý‡TÿþˆUÿÿ‡Uÿÿ†Tÿÿ†Tÿÿ…Sÿÿ†TÿÿˆVÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿô–Tÿö˜Vÿþ˜cÿÿxÿÿªÿñ³£ÿ¾ •ÿª©¥ÿÂÐÎÿÜêècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñíØÖÖ~¶´´ÿ ž–ÿ—›‚ÿˆ—]ÿv†?ÿrv*ÿeiÿcgÿaeÿ_cÿacÿ]aÿ]aÿ\`ÿ\`ÿ[_ÿ[_ÿ\_ÿ\_ÿ]aÿ]aÿ]^ÿ`_ÿci"ÿlu2ÿƒUÿ ¨ƒÿ¼Ã®ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïóô éØÏÿ转ÿ﬑ÿÿ£€ÿÿ•aÿÿŽ[ÿûˆUÿý‡TÿþˆUÿÿ†Tÿÿ†Tÿÿ…Sÿÿ…Sÿÿ†Tÿÿ‡Uÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿõ—Uÿö˜Vÿý—bÿÿšuÿÿ§Œÿò´¤ÿ¼ž“ÿ¨§£ÿ¶ÄÂÿÔâà€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéå;ÊÈÈÿ©§§ÿš˜ÿ”˜ÿƒ’Xÿr‚;ÿqu)ÿeiÿdhÿbfÿ`dÿacÿ]aÿ^bÿ]aÿ]aÿ\`ÿ\`ÿ]`ÿ]`ÿ]aÿ]aÿ^_ÿbaÿfl%ÿqz7ÿˆ”Zÿ¦®‰ÿÃʵÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï÷ö èãÚnàÅ·ÿá­ ÿí¦‹ÿ÷›fÿûŽ[ÿûˆVÿþ‡Vÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰Tÿÿ‹WÿÿŒXÿÿŒXÿÿXÿýZÿÿ”`ÿý”cÿü“`ÿÿ£sÿÿª|ÿð±‹ÿ㻞ÿ´¦ÿ²³©ÿÑÎÐïìõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÝÝnÀÃÁÿ˜–•ÿœŸ…ÿ›¡rÿƒAÿy0ÿsr"ÿnmÿffÿeeÿceÿbdÿ_cÿ_cÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿa_ÿa_ÿ]aÿ[dÿai-ÿpxIÿŠoÿ¬±œÿÑÕÉÿìíé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéàOèÍ¿ÿæ²¥ÿð©Žÿùhÿý]ÿü‰WÿÿˆWÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰TÿÿŠVÿÿŒXÿÿŒXÿÿXÿýZÿÿ’^ÿþ•dÿý”aÿÿŸoÿÿ¨zÿñ²Œÿå½ ÿµ§‘ÿš›‘ÿÅÂÄÿäáêOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéëë(ÌÎΚ®±¯ÿ™—–ÿ †ÿ™Ÿpÿ‹?ÿw}.ÿsr"ÿmlÿggÿffÿdfÿbdÿ_cÿ^bÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿ`^ÿa_ÿ[_ÿ\eÿem1ÿu}Nÿ‘–vÿµº¥ÿÙÝщñòî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôñé(í×Ëÿß¼®ÿí¬—ÿú¡nÿÿ’bÿü‹YÿÿˆWÿÿ†Sÿÿ†Sÿþ‰Rÿú‰Qÿø‰Qÿø‰QÿþˆTÿÿŠVÿÿŒXÿÿŒXÿþŽYÿüZÿú’]ÿÿ—bÿû•`ÿÿœkÿü¤uÿù²ŒÿﾞÿË«”ÿŸƒÿ¸´³ÿÓÖÛƒîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¸½¼ÿšŸ–ÿ› ‹ÿ¤yÿ•aÿ€Š7ÿtz(ÿpq!ÿklÿhhÿggÿdfÿbdÿ^bÿ^bÿ]`ÿ]`ÿ^aÿ]`ÿ^_ÿ^_ÿ^_ÿ^_ÿY`ÿ^i ÿjr6ÿ{‚Wÿ˜ ÿÁĵÿãæÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú÷ï õßÓƒæõÿð¯šÿþ¥rÿÿ•eÿýŒZÿÿ‰Xÿÿ†Sÿÿ†Sÿþ‰Rÿú‰QÿùŠRÿø‰QÿþˆTÿÿŠVÿÿ‹WÿÿŒXÿþŽYÿý‘[ÿû“^ÿþ–aÿü–aÿÿ›jÿú¢sÿõ®ˆÿî½ÿÖ¶Ÿÿ­‘ÿ¤ ŸÿÁÄÉÿæéî2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÔÙØ€ª¯®ÿ’‰ÿž£Žÿ™ uÿ‹“Wÿ{…2ÿqw%ÿop ÿklÿhhÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ^aÿ_`ÿ^_ÿ]^ÿ]^ÿ[bÿbm$ÿpx<ÿˆ]ÿ ¨‰ÿÌÏÀÿëîå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñåßYÛÈÀÿⱡÿù¨{ÿÿ–jÿù^ÿÿˆWÿÿ‡Qÿÿ‡Qÿÿ‰Qÿü‰PÿûŠRÿú‰Qÿý‡SÿÿŠVÿÿŒWÿÿŒWÿüYÿû‘[ÿü•^ÿý–_ÿü—`ÿÿiÿþ¢oÿø¨ÿþ·•ÿõ¿¦ÿÑ°¡ÿšŠ„ÿ¨­¬ÿÓÚ݃åîñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîñö Ýàåc½ÁÂÿ›¢›ÿŒ—}ÿ¤¬ƒÿ—¢dÿˆCÿy‚'ÿsxÿoqÿkkÿiiÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ]`ÿ\_ÿ\_ÿ\_ÿ\_ÿ[dÿdo)ÿr{Bÿ†Žeÿª±–ÿÖ×Íšòóï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ëå;ãÐÈÿè·§ÿþ­€ÿÿšnÿû`ÿÿ‰Xÿÿ‡Qÿÿ‡Qÿÿ‰QÿûˆOÿûŠRÿú‰Qÿý‡Sÿÿ‰UÿÿŒWÿÿŒWÿüYÿû‘[ÿý–_ÿü•^ÿý˜aÿÿžjÿþ¢oÿô¤{ÿù²ÿø©ÿÛº«ÿ˜ˆ‚ÿ•š™ÿ¼ÃÆÿØáäyïøû ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéî2ÏÒ×ÿ ¤¥ÿŽ•Žÿ‘œ‚ÿ¡©€ÿ’_ÿƒ‹>ÿu~#ÿqvÿoqÿllÿiiÿhhÿdfÿacÿ]aÿ]aÿ]`ÿ]`ÿ]`ÿ]`ÿ\_ÿ\_ÿ\_ÿ]`ÿ^gÿfq+ÿxHÿ‘™pÿ¸¿¤ÿâãÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôóï àÚÕ€Û¸ÿö²ÿþŸwÿõ’fÿýŠ]ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿþ•\ÿÿ–]ÿþ›aÿýgÿÿ¡lÿÿ£vÿÿ«†ÿÿ»Ÿÿñ¿©ÿ¾¡“ÿ”“‰ÿ¤©§ÿÇÒÐÿâëîEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕØà€¶¹ÁÿŽ”“ÿŒ”ƒÿŸ«ÿ¨jÿŒšHÿŠ0ÿx|ÿswÿoqÿllÿgjÿfiÿdfÿacÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ\^ÿZ^ÿ[_ÿ\`ÿ^bÿ_j$ÿgt6ÿˆUÿ §„ÿÇϸÿëíç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæàÛnâÉ¿ÿú¶‘ÿÿ¢zÿ÷”hÿþ‹^ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿý”[ÿÿ—^ÿÿœbÿüœfÿÿ¡lÿÿ¥xÿÿ¨ƒÿý³—ÿóÁ«ÿÙ¼®ÿ‘†ÿ”’ÿ·ÂÀÿÓÜ߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçìë2ÄÇÏÊž¡©ÿŒ’‘ÿ˜‡ÿ§³‰ÿ• bÿ„’@ÿ~‡-ÿw{ÿtxÿoqÿllÿhkÿfiÿceÿ`bÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ[]ÿZ^ÿ[_ÿ]aÿ_cÿcn(ÿly;ÿ‡]ÿ«²ÿÒÚÃÜòôî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÙÕÐÿ黣ÿ÷©…ÿî™sÿù‘fÿÿŠWÿÿˆQÿÿ‰Nÿÿ‰NÿýŠQÿüˆSÿý‡Tÿÿ‰VÿÿŒWÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿŸoÿÿ§zÿÿ®‰ÿÿ¿žÿù˳ÿ¹¦‘ÿ“‚ÿ¦© ÿÊÊÊ¥ìåê;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëðîÒ×Õƒ³¸·ÿ€…„ÿ’™Šÿ«±Žÿ£¬sÿŽ–Iÿ…Ž3ÿ~ƒ(ÿvwÿvwÿnr ÿknÿhkÿehÿcfÿbcÿ`aÿ__ÿ\^ÿ^`ÿ[_ÿ[_ÿ\_ÿZ]ÿZ_ÿaf!ÿ`l0ÿv‚RÿŒ—oÿ¶½¢ÿáèÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòð àÜ×~îÀ¨ÿû­‰ÿòwÿû“hÿÿŒYÿÿˆQÿÿ‰NÿÿˆMÿýŠQÿüˆSÿý‡Tÿÿ‰Vÿÿ‹VÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿžnÿÿ¦yÿÿ­ˆÿú·–ÿöÈ°ÿ×įÿœ–‹ÿŠ„ÿ­­­ÿÕÎÓöïô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñï Üáßc¼Á¿ÿ‘–•ÿ’‘ÿ›¢“ÿ¦¬‰ÿ™¢iÿˆCÿŠ/ÿ|&ÿvwÿuvÿnr ÿknÿgjÿdgÿcfÿabÿ`aÿ^^ÿ]_ÿ^`ÿ[_ÿZ^ÿ[^ÿZ]ÿZ_ÿch#ÿht8ÿ~ŠZÿš¥}ÿÇγÿìóä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãèçEåɸÿæµ›ÿ棄ÿî™qÿû_ÿü‹Sÿý‰NÿüˆMÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿŒUÿýSÿü’Uÿÿ“]ÿü•^ÿþ™bÿÿžfÿÿ hÿþ¡iÿÿ¦qÿÿ­ÿý±‡ÿÿžÿÿѲÿέ™ÿ›‹{ÿ‘ÿ¼±³ÿàÚÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàààOÊÏÍÿ™¡–ÿxpÿœ£ˆÿ®µŠÿ¦ªoÿ”™Nÿ†Œ5ÿ€†'ÿ}~ ÿwxÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ^^ÿ]_ÿ]_ÿZ]ÿZ]ÿY^ÿX]ÿ\dÿfn(ÿoyJÿ†Žoÿ©²—ÿ×ÝÊ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìñððÔÃÜﾤÿíª‹ÿòuÿý‘aÿýŒTÿÿ‹PÿþŠOÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿ‹TÿýSÿü’Uÿþ’\ÿü•^ÿþ™bÿÿžfÿÿŸgÿþ¡iÿÿ¥pÿÿª|ÿú®„ÿú¼˜ÿóŦÿçƲÿµ¥•ÿ}ÿ¤™›ÿ¼½ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáàäOÒÒÒƒ¬±¯ÿyvÿ†wÿ¦­’ÿ¯¶‹ÿ›Ÿdÿ‰ŽCÿ‚ˆ1ÿ}ƒ$ÿ{|ÿxyÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ__ÿ\^ÿ]_ÿZ]ÿ[^ÿZ_ÿZ_ÿ`h"ÿmu/ÿx‚Sÿ“›|ÿ»Ä©ÿåëØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæÝÔ€äƵÿã°–ÿè ~ÿò“gÿùWÿÿQÿþŒPÿþ‹RÿüˆSÿý†UÿÿˆWÿÿ‰Vÿÿ‹TÿÿQÿþ‘Sÿþ\ÿþ”_ÿÿ˜aÿÿœeÿûŸdÿú¢fÿù¨kÿû¬sÿÿ±|ÿÿ¹‹ÿÿ½—ÿÿαÿ廨ÿ§Šÿ“ˆ„ÿ¢žÿÇÇǽççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíØ×Ù~·¶¸ÿ‡‰ƒÿ|‚oÿ¢¬‚ÿ¶½„ÿ«µhÿ—DÿŠŽ.ÿˆ‰)ÿ€€"ÿ{{ÿvzÿrtÿlqÿjmÿfjÿdgÿcfÿbcÿ`aÿ__ÿ\^ÿ\^ÿZ]ÿ[^ÿY`ÿY`ÿaj'ÿpy6ÿ…fÿ¡§”ÿÍÕÄÊðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñèßYïÑÀì븞ÿ暈ÿö—kÿûYÿÿQÿý‹Oÿþ‹RÿüˆSÿý†Uÿþ‡Vÿÿ‰VÿÿŠSÿÿŽPÿþ‘Sÿþ\ÿý“^ÿþ—`ÿþšcÿúžcÿú¢fÿù¨kÿùªqÿÿ±|ÿý°‚ÿÿ¼–ÿÿŨÿôÊ·ÿα¨ÿ’‡ƒÿ‚~}ÿ¨¨¨ÿÎÎÎêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÔÓƒ¾½¿ÿŽÿuwqÿ£ÿ·Á—ÿ¬³zÿ›¥XÿŽ”;ÿ‡‹+ÿ‡ˆ(ÿ!ÿ{{ÿvzÿrtÿkpÿilÿeiÿcfÿbeÿabÿ`aÿ__ÿ]_ÿ\^ÿZ]ÿ\_ÿZaÿ[bÿen+ÿx>ÿŒ’sÿµ»¨ÿÞæÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìßщìıÿò²“ÿø¡uÿü”_ÿûUÿûŠQÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿþ˜cÿùbÿö£fÿôªjÿ÷­mÿÿ±vÿþ­zÿÿ¶Œÿÿº›ÿÿ˵ÿ÷ÐÂÿ±¨žÿ„}ÿŠŠŠÿ§§§ÿÌÌÌšâââEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÜÝÔ€´µ¬ÿ’’’ÿyyyÿ‰‚ÿ·½žÿ´À†ÿœ¨Vÿ’ 6ÿ”+ÿŠ‹#ÿ…†ÿ}~ÿ{{ÿvzÿqsÿjoÿgjÿdhÿbeÿadÿ`aÿ_`ÿ^^ÿ^_ÿ]^ÿ[^ÿ]`ÿ\c ÿah%ÿox5ÿ…ŽKÿ¡¥’ÿÌÒǽêòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöéÛnöλÿü¼ÿÿ¨|ÿÿ™dÿý‘Wÿü‹Rÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿý—bÿøœaÿö£fÿôªjÿ÷­mÿý¯tÿÿ²ÿÿ°†ÿÿ¶—ÿû¿©ÿöÏÁÿØÏÅÿ¥¢žÿtttÿ†††ÿ­­­ÿËËË¥ççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÙÙÙy¸¹°ÿž•ÿrrrÿÿ¦ªŸÿ°¶—ÿ£¯uÿ” NÿŠ˜.ÿ’)ÿ‰Š"ÿ‚ÿ{|ÿ{{ÿuyÿprÿinÿfiÿcgÿadÿ`cÿ_`ÿ^_ÿ]]ÿ^_ÿ]^ÿ[^ÿ^aÿ`g$ÿgn+ÿy‚?ÿ‘šWÿ¸¼©ÿàæÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìÿÿÞñöYíÙÔÿðijÿô®‘ÿú›sÿõ’`ÿûYÿû‹VÿÿˆTÿÿ‡Uÿÿ†Tÿÿ†RÿþˆTÿúUÿøSÿþ[ÿÿ]ÿÿ’_ÿþ•bÿüšdÿüŸhÿý¥iÿü©lÿÿ¯rÿý°wÿü´~ÿþ¸‰ÿÿ¿–ÿÿƤÿÿήÿÿлÿ©š‘ÿ‡zxÿ“‡…ÿ²ª«ÿÐÊË¥áÝâcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêæì2ÓÏÛ¿»Çÿ•”˜ÿtwnÿƒjÿ­´‡ÿ¿Ç†ÿ®¹cÿ¨Bÿ—8ÿŽ’+ÿˆŒ%ÿ‚„$ÿ€$ÿy{!ÿuv ÿorÿiqÿbnÿ`lÿ`fÿ``ÿ`] ÿc[ÿc]ÿc^ÿ\] ÿ`fÿYbÿVdÿ_m+ÿdr<ÿu…Uÿ˜¡†ÿÏÏÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëþÿåøý;ùåàOúνÿý·šÿÿ¥}ÿþ›iÿÿ‘]ÿüŒWÿÿˆTÿÿ‡Uÿÿ‡Uÿÿ‡Sÿÿ‰UÿúUÿøSÿýŒZÿÿŽ\ÿþ‘^ÿý”aÿû™cÿúfÿü¤hÿû¨kÿü¬oÿú­tÿù±{ÿûµ†ÿúº‘ÿÿÀžÿÿȨÿÿ˶ÿѹÿ¥˜–ÿymkÿ‰‚ÿ«¥¦ÿÏËÐ¥ÜÛßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêçé2ØÔÚ€µ±½ÿ•‘ÿlkoÿ‚yÿ¥©ÿ¹À“ÿ±¹xÿ «Uÿ—¢<ÿ’˜3ÿ‹(ÿ†Š#ÿ€‚"ÿ}~"ÿxz ÿtuÿnqÿhpÿbnÿ`lÿ_eÿ``ÿ`] ÿc[ÿc]ÿb]ÿ`aÿ_eÿYbÿZhÿes1ÿkyCÿƒ“cÿ¯¸ÿÞÞÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÜЉîÄ­ÿð°‘ÿïžxÿøeÿþŒ]ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿþŒWÿüŠUÿþ‹XÿÿZÿþ\ÿý“^ÿü–aÿüšdÿüŸgÿý¤kÿþªpÿþ­sÿþ°{ÿû´‚ÿú·Šÿú¾”ÿÿÆžÿÿɬÿý×ÅÿÛ¿´ÿ«†ÿƒpiÿ‚~ÿ¤ Ÿÿ»¿Àÿ×ÛÜ~ëðñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïíóáàâOÊËǽª­¤ÿ‡Žÿr{fÿ~‚eÿ¦ªÿ¿Ç’ÿ¸Â|ÿ£­Zÿ˜¤@ÿ’œ1ÿ‹‘&ÿ‰#ÿ„‡ ÿ~€ ÿ|{#ÿux"ÿqs!ÿkoÿimÿbjÿaiÿ_dÿ`^ÿa\ÿa\ÿ`]ÿ_]ÿ_bÿ]cÿXbÿal&ÿnyAÿx‚Wÿ™¤„ÿÌÒ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëßYýÓ¼ÿúº›ÿõ¤~ÿý•jÿÿŽ_ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿý‹VÿúˆSÿýŠWÿÿŒYÿý[ÿü’]ÿú”_ÿû™cÿûžfÿû¢iÿý©oÿþ­sÿþ°{ÿù²€ÿ÷´‡ÿöºÿþÁ™ÿüħÿò̺ÿìÐÅÿæËÁÿ®›”ÿ„yuÿwsrÿ•™šÿ®²³ÿÉÎÏ°Üáâcéîí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæãìEÕÓÙƒÁÀÂÿ¡¢žÿ‚yÿqxkÿw€kÿ°´—ÿ¼À—ÿµ½ˆÿ£­gÿ˜¢Oÿ‘9ÿ‹•*ÿˆŽ#ÿ‡‹!ÿƒ†ÿ}ÿ{z"ÿtw!ÿpr ÿimÿgkÿaiÿ`hÿ^cÿ`^ÿa\ÿ`[ÿ_\ÿ^\ÿ_bÿ^dÿ^hÿit.ÿz…MÿŒ–kÿ²½ÿãéÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéåÚnçɶÿè°—ÿô£‚ÿø’hÿú‹[ÿúˆSÿû‰TÿúˆSÿû‰TÿÿˆVÿÿ†Tÿÿ‹TÿÿŒUÿÿZÿþ‘[ÿý“^ÿü–aÿÿ›eÿþžhÿÿ¤lÿÿ©pÿÿ®uÿý¯zÿø²}ÿù¶…ÿû¾Œÿþ˜ÿûàÿÿϳÿÿÖ¾ÿðϼÿ®™Šÿƒxpÿxtoÿ‡Šˆÿ¤«¨ÿÁÆÇÿ×ÜÝ~ãåæEîðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñöíèìç2ÛÜànÏÐÔº¹½ÿ˜—›ÿvwmÿko\ÿ†Œuÿ¬´ŒÿÅ͆ÿ¿Èqÿ­¸\ÿŸ©Eÿ—¢4ÿ‘™'ÿ‹’ÿ‰ÿ‡Œÿ‚„ ÿ}~ ÿzy#ÿsv!ÿnoÿflÿdhÿaeÿ`cÿ`aÿ_^ÿ_]ÿ^\ÿ]^ÿ]^ÿ[_ÿ^gÿbl)ÿlw?ÿ„Ždÿ¢«‘ÿËÒÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöòç2õ×ÄÊô¼£ÿý¬‹ÿÿšpÿÿ`ÿý‹VÿüŠUÿû‰Tÿû‰TÿÿˆVÿÿ†TÿþŠSÿÿŒUÿÿŽYÿýZÿü’]ÿú”_ÿý™cÿüœfÿÿ£kÿÿ§nÿý¬sÿü®yÿø²}ÿøµ„ÿù¼Šÿú¾”ÿùÁžÿûÉ­ÿ÷˳ÿôÓÀÿäÏÀÿ´©¡ÿ~zuÿgjhÿx|ÿ•š›ÿ²·¸ÿÈÊËÿÖØÙ~éæè2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöúï ðôé(âçÞYÓ×Òÿ¹º¾ÿ¦§«ÿŠ‰ÿqptÿstjÿŒ}ÿ«±šÿÁÉ¡ÿ¶¾wÿ®·`ÿŸªNÿ•Ÿ;ÿš,ÿ—%ÿ‹’ÿ†ÿ…Šÿ€‚ÿ{|ÿxw!ÿqtÿmnÿdjÿbfÿ`dÿ_bÿ_`ÿ_^ÿ_]ÿ_]ÿ^_ÿ^_ÿ\`ÿaj!ÿhr/ÿu€Hÿ•Ÿuÿ¼Å«ÿáèÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéàOå̼ÿ趟ÿð¦‚ÿû˜lÿüZÿÿXÿÿŠSÿÿŠSÿÿ‰VÿþˆUÿþŠQÿÿŒSÿÿŒUÿþŽZÿýŽ\ÿü‘^ÿÿ•bÿÿ™eÿÿ iÿÿ¤lÿÿ©pÿÿ®tÿþ±xÿÿ¶|ÿþ¼ÿþ¾‡ÿÿÂÿÿÆšÿÿͤÿ÷ʨÿÿãÉÿîÓ¿ÿ®ÿ‘‚yÿsjaÿuojÿ‰…€ÿ¥£¢ÿº»¹ÿÍÌΚÞßãYëìðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîòíáçâOÔÚÕÿÀÄÅÿ«¯°ÿ•—˜ÿ{xzÿgd_ÿzxfÿ¨©‡ÿÉËÿÃÇ“ÿ³ºqÿ±»Qÿ§­@ÿ¤5ÿ•ž*ÿ—"ÿŽ–!ÿŽ“ ÿ„‡ÿ‚†ÿ}~ÿuwÿsr!ÿlpÿhkÿciÿaeÿbcÿ``ÿ__ÿ^^ÿ\_ÿ]`ÿ[bÿ[bÿ]eÿdm.ÿp{Cÿˆ‘iÿ¯¶›ÿÖÜщïòö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøßÏöÄ­ÿ÷­‰ÿÿqÿÿ”^ÿÿZÿÿŒUÿÿŠSÿÿŠWÿÿ‰Vÿý‰Pÿÿ‹Rÿÿ‹TÿýYÿü[ÿû]ÿþ“`ÿý—cÿÿfÿÿ hÿþ¥lÿþªpÿü¯vÿý´zÿú¸}ÿù¹‚ÿü½Šÿú½‘ÿýÇžÿýЮÿïÊ°ÿ÷ÜÈÿîÚÉÿÏÀ·ÿ§ž•ÿ|vqÿgc^ÿrpoÿ†‡…ÿ Ÿ¡ÿ¼½ÁÿÏÐÔãâæEêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíáåàOÓ×Òƒ¿ÅÀÿ«±¬ÿ“”ÿuyzÿdfgÿgdfÿ}zuÿ©§•ÿÇȦÿÆÈšÿ²¶‚ÿª±hÿ£­Cÿš 3ÿ˜Ÿ0ÿ— ,ÿ• ÿˆÿ‹ÿ†‰ÿ€„ÿ{|ÿrtÿpoÿjnÿfiÿagÿ`dÿabÿ``ÿ^^ÿ^^ÿ\_ÿ^aÿ[bÿ\cÿfn'ÿmv7ÿ~‰QÿŸ¨€ÿÊѶÿìòç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðïå;ðÚÈÿë¿¢ÿﮈÿõšmÿý]ÿÿYÿÿYÿýYÿüŒXÿü‰Pÿþ‹RÿüUÿýYÿûŒZÿü[ÿý]ÿÿ’_ÿÿ™cÿÿfÿÿ¢hÿÿ§lÿÿ¬oÿÿ°sÿÿ¶zÿÿº~ÿü½€ÿýÁ†ÿýÃÿþŘÿüÉ¡ÿÿϯÿÿؽÿÿÝÊÿùØÅÿÅ«›ÿˆyÿ…wkÿtkbÿvsnÿ‘‹ÿ¡¤¢ÿº¹½ÿÈÇ˽×ØÜ~âãçEæéí2ìïóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçæê2ÔÝЉÎ×Ê¥¿ÅÀÿ¤§«ÿ”•Ÿÿ‚~‰ÿfclÿnhmÿxvlÿ™˜~ÿ¿¿‘ÿÎÏ‘ÿÆÊxÿ¹¾[ÿ¯·Eÿ­±@ÿ ¥2ÿšŸ,ÿ”™&ÿ‘–#ÿ“"ÿ‹Ž!ÿ†‡ÿ„„ ÿ}}ÿzyÿrsÿnmÿhlÿgjÿciÿ_cÿcdÿ_`ÿ_cÿ^bÿ\cÿZaÿW`ÿak)ÿdo1ÿu€Nÿ‘šrÿ¿Ä©ÿåëÚnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø÷íÿëÙyüгÿú¹“ÿû sÿÿ–cÿÿ’^ÿÿŽZÿþŽZÿÿ\ÿÿŒSÿþ‹RÿùŠRÿù‰UÿùŠXÿü[ÿý]ÿÿ’_ÿÿ—aÿÿ›dÿÿ fÿÿ¥jÿþ«nÿÿ¯rÿþµyÿþ¸|ÿý¾ÿýÁ†ÿýÃÿüÖÿ÷Äœÿ÷Ʀÿù̱ÿ÷ϼÿûÚÇÿòØÈÿéÔÅÿÅ·«ÿŒƒzÿjgbÿlpjÿx{yÿŒÿ£¢¦ÿ¸¹½ÿÂÃÇÿÊÍÑÿÙÜàyâçèEãèéEêïðíòóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëêîæåé;ßÞâYÒÑÕ‰ÆÅÉÊÀɼÿ£¬Ÿÿ•›–ÿƒ†Šÿijtÿ_[fÿifoÿŒ†‹ÿ¾¼²ÿÅĪÿÉÉ›ÿÂÃ…ÿ¶ºhÿ¬±Nÿ£«9ÿŸ£2ÿ› -ÿ–›(ÿ‘–#ÿŽ“ ÿ‹ÿ†‰ÿ‚ƒÿ€€ÿxxÿutÿopÿnmÿimÿfiÿ`fÿ]aÿ^_ÿ^_ÿ_cÿ\`ÿ[bÿ^eÿ]fÿeo-ÿq|>ÿ‰”bÿ­¶ŽÿÚßÄÊõûêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïæÒƒìÈ°ÿæ«‹ÿòœxÿù•kÿø^ÿ÷Zÿÿ“_ÿÿ’\ÿûŽXÿö‰Uÿõ‡Wÿ÷‰Yÿû]ÿý]ÿþ‘^ÿÿ–]ÿÿ™`ÿÿbÿÿ¢fÿÿ¦kÿÿ«oÿÿ°vÿÿµzÿþ»~ÿþ¿‚ÿÿˆÿÿÄŽÿÿÓÿÿÆ™ÿÿÈ ÿÿ̧ÿÿÑ­ÿÿÕ´ÿÿÞÂÿýÞÅÿâʶÿ½­œÿŒ†sÿaXNÿe\Yÿypmÿ‰†ÿ¡š—ÿª¦¥ÿ´µ³ÿÁÄÂÿÊÍËÿÎÓÒÿÒ×ÖƒÙÞÝyÞãâYãçèEæêë2êîïìðñðïëðïëìíëëìêíííïïï éëì(ãåæEàâãOÚÜÝnÖÖÖ~ÐÐЉÊËÉÿ½¾¼ÿ®­©ÿ Ÿ›ÿ‹‹‘ÿssyÿdfgÿWUTÿa_Wÿ™™ÿÄÅžÿÇÊ“ÿÏÔ‰ÿÉÐuÿ¿Æ]ÿ´¼Gÿ¬³:ÿª®1ÿ¥¨*ÿ £%ÿ˜œ+ÿ”—*ÿ“&ÿŽ&ÿ†ˆ$ÿ‚"ÿ}|!ÿ|z"ÿvw!ÿpoÿikÿggÿdgÿbeÿ_dÿ`dÿ]^ÿ`aÿ`dÿX_ÿXaÿ[f ÿ_h)ÿgp=ÿz„Yÿ ¦‡ÿÉϸÿñòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøä;ÿÜÄÊù¾žÿþ¨„ÿÿ›qÿû’aÿù‘\ÿÿ”`ÿÿ—aÿÿ”^ÿûŽZÿøŠZÿøŠZÿúŒ\ÿü\ÿý]ÿÿ”[ÿÿ–]ÿÿš_ÿÿžbÿü¢gÿþ¨lÿÿ­sÿý±vÿú·zÿú»~ÿþ¾„ÿÿÁ‹ÿÿÁ‘ÿÿÄ—ÿÿÆžÿÿɤÿÿÕ±ÿþÑ°ÿøѵÿøÙÀÿùáÍÿîÞÍÿÇÁ®ÿž•‹ÿ›’ÿtkhÿWPMÿ_XUÿtpoÿ‚€ÿ“‘ÿ¡¤¢ÿ¦«ªÿ¬±°ÿµº¹ÿ¾ÃÂÿÅÉÊÿÉÍÎÿÍÑÒÿÏÓÔÿÔÓÏÿÕÔÐÿÓÔÒÿÒÓÑÿÓÓÓÿÓÓÓÿÉËÌÿÀÂÃÿ¾ÀÁÿ³µ¶ÿ©©©ÿ¢¢¢ÿ—˜–ÿ†‡…ÿvuqÿkjfÿTTZÿZZ`ÿwyzÿ“‘ÿ£¡™ÿÀÀ¨ÿÎϨÿÁÄÿ¶»pÿ³º_ÿ®µLÿ¨°;ÿ£ª1ÿ£§*ÿ¡¤&ÿž¡#ÿ”˜'ÿ‘”'ÿŽ‘$ÿ‹Œ$ÿ„†"ÿ~ÿzyÿzx ÿtuÿonÿhjÿggÿcfÿ_bÿ^cÿbfÿcdÿbcÿbfÿ[bÿ[dÿ_j$ÿir3ÿy‚Oÿ“rÿ½Ã¤ÿáçЉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõðç2ëÖǽ廤ÿ榇ÿî™qÿý“dÿû‘bÿÿ˜gÿÿ—fÿþ”eÿúaÿù]ÿ÷‹[ÿùŒXÿùŒXÿþ‘Yÿÿ’Zÿÿ—\ÿþš_ÿÿžfÿÿ¡lÿÿ¦sÿý©uÿÿ³zÿÿ¶|ÿÿºÿÿ½„ÿÿ¿ˆÿÿŠÿÿÆŽÿÿÈ”ÿüÆ‘ÿþË™ÿÿÑ¡ÿüЧÿùÓ°ÿÿÜÀÿÿæÎÿÿèÓÿåË»ÿ´œÿ’znÿ‹xkÿ‡wjÿsg]ÿj`Vÿnf_ÿrpfÿzvqÿ†ƒ~ÿ’Žÿš–•ÿžš™ÿ œ›ÿ¡œÿ¥£¢ÿ§¥¤ÿ¥¦¤ÿ¡¢ ÿžŸÿ›œšÿ“—’ÿŒ‹ÿƒ‡ÿ{vÿswkÿkq`ÿciVÿ`fSÿfnWÿsv`ÿzzhÿ‰wÿ®¯ÿÑÕ¡ÿØÞ—ÿÊÓxÿÁËaÿ¾ÉOÿ´Â>ÿ±¼8ÿ«³0ÿ¤¬)ÿŸ¥(ÿ› 'ÿ˜›'ÿ—™(ÿŽ”%ÿ‹%ÿˆ‹$ÿ…†$ÿ€"ÿyyÿtuÿsr!ÿkmÿjjÿgjÿghÿdfÿ`aÿ``ÿccÿgi#ÿacÿ`dÿ]eÿ_h%ÿdm5ÿu|Oÿ‘˜wÿ¸½¨ÿÞßÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÛnúйÿö¶—ÿø£{ÿÿ—hÿúaÿÿ–eÿÿ—fÿÿ—hÿÿ•fÿý‘aÿù]ÿùŒXÿø‹WÿýXÿþ‘Yÿü”Yÿû—\ÿü›cÿüžiÿû¢oÿù¥qÿü¯vÿü³yÿþ·~ÿýºÿþ½†ÿþÁ‰ÿÿÅÿÿÇ“ÿÿÉ”ÿþË™ÿýÏŸÿüЧÿöЭÿôϳÿôÒºÿõÖÁÿ÷ÝÍÿõÝÑÿöÞÒÿæÓÆÿ¿¯¢ÿŽ‚xÿpf\ÿf^Wÿig]ÿkgbÿmjeÿokjÿqmlÿuqpÿyutÿ|xwÿtrqÿusrÿstrÿrsqÿpqoÿpqoÿptoÿqupÿhlfÿek`ÿ`dXÿY_NÿZ`Mÿoubÿ–ž‡ÿº½§ÿÍÍ»ÿÓϽÿÄÅ¥ÿ¼ÀŒÿ¼Â{ÿ·Àeÿ°ºPÿ§²8ÿ¥³/ÿ¢­)ÿž¦#ÿœ¤!ÿ£&ÿ› 'ÿ—š&ÿ“•$ÿ‹‘"ÿˆŒ"ÿ„‡ ÿ‚ƒ!ÿ}~ ÿxxÿrsÿqpÿkmÿiiÿcfÿabÿacÿcdÿhh"ÿkk%ÿjl&ÿacÿaeÿai"ÿen+ÿmv>ÿ†`ÿ«²‘ÿØÝÈ°õöíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçÚnòζÿô³”ÿÿsÿÿ”jÿú“fÿü•hÿÿ˜kÿÿ™lÿÿ™iÿþ•bÿü’]ÿýXÿý‘Wÿý‘Wÿý’Xÿû”]ÿü˜bÿü›iÿûoÿú qÿþ¨rÿþ¬uÿþ±yÿÿ¶~ÿü½ÿýÁ…ÿúLjÿýÊ‹ÿüÌŒÿýÍÿüÌ’ÿÿÍ›ÿÿѦÿÿϬÿÿбÿÿÔ¸ÿùÓ»ÿüÙÅÿÿÞÇÿùÙÆÿîÓ¿ÿæͽÿß˺ÿØǺÿɹ¬ÿº®¤ÿ¥›‘ÿŽ‚|ÿxngÿk_]ÿeZVÿcWWÿ\ZZÿZXXÿWWWÿZZZÿ[\Xÿ\]Yÿ`d^ÿgmbÿ†wÿ‘š†ÿª³™ÿ·Á£ÿ¸Ã¢ÿ·ÄžÿºÈŸÿÃÍ¢ÿÃЀÿÈÔpÿ½Ëaÿ½ÊWÿ¸ÆHÿ­¹7ÿ­µ2ÿ«°-ÿ©«0ÿ¤¤.ÿ Ÿ/ÿ Ÿ/ÿœ¡.ÿ—œ)ÿŽ™ÿŠ•ÿˆÿ„‰ ÿ}„ÿ{€ÿy| ÿuwÿorÿnoÿilÿfhÿ`bÿ]^ÿcdÿnm)ÿsq0ÿsq0ÿfi$ÿadÿcg%ÿfn/ÿqy=ÿ‚Š[ÿ¤©‰ÿÍÒ½ÿìîè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþøëÿâÊ¥ÿ£ÿÿ¨~ÿÿžtÿú“fÿü•hÿÿ˜kÿÿœoÿÿŸoÿÿjÿÿ™dÿÿ”\ÿý‘WÿüVÿü‘Wÿú“\ÿú–`ÿú™gÿúœnÿøžoÿú¤nÿú¨qÿû®vÿý³{ÿùº~ÿù½ÿõƒÿöÄÿúÊŠÿýÍÿüÌ’ÿýʘÿþË ÿþÈ¥ÿýǨÿþÌ°ÿõÏ·ÿóмÿõÓ¼ÿóÓÀÿõÚÆÿùàÐÿ÷ãÒÿðßÒÿêÚÍÿáÕËÿÖÌÂÿË¿¹ÿÁ·°ÿ»¯­ÿº¯«ÿ»¯¯ÿ³±±ÿ­««ÿ¨¨¨ÿªªªÿ¨©¥ÿ¥¦¢ÿ¥©£ÿ¬²§ÿ°·¨ÿµ¾ªÿ¾Ç­ÿÁË­ÿÁÌ«ÿ¼É£ÿµÃšÿ²¼‘ÿ¶Ãsÿ¸Ä`ÿ¬ºPÿ¬¹Fÿ¦´6ÿ¥±/ÿ­µ2ÿ¤©&ÿ£¥*ÿ¡¡+ÿž-ÿœ›+ÿ”™&ÿ”!ÿ‹–ÿŒ—ÿ…ÿ„ÿxÿv{ÿuxÿrtÿloÿjkÿbeÿbdÿacÿdeÿop(ÿ{z6ÿyw6ÿpn-ÿ`cÿadÿhl*ÿnv7ÿ‰Mÿž¦wÿÆË«ÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôìöÞØyÚÀ¹ÿТšÿý¢kÿøfÿò™gÿ÷œoÿýyÿÿ›xÿÿ›yÿÿœzÿÿ—nÿþ•iÿó“^ÿïXÿó’Xÿû—]ÿÿ˜_ÿÿ˜_ÿÿžjÿÿ£nÿÿ¨qÿÿ¬uÿÿ°xÿÿ³{ÿÿ¸}ÿÿ»ÿÿÀ…ÿÿÇÿÿÈ‹ÿÿÊ‘ÿüÍ•ÿûЗÿúÒ˜ÿûÓ™ÿþÒÿÿÒ¢ÿÿÖ¥ÿÿתÿÿÙ­ÿÿÙ²ÿÿÚ³ÿÿÚ·ÿÿÞ»ÿÿß¾ÿÿàÂÿÿáÊÿþãÏÿýã×ÿûäÜÿøäßÿóäáÿñâßÿòæÚÿïèÏÿêäÁÿåã³ÿàâ§ÿÛÝ—ÿÕ؈ÿÓÕ|ÿÑÔqÿÐÒhÿÈÌ[ÿÆÈPÿÁÄFÿº½?ÿ»½Aÿ¶¸<ÿ°²6ÿ¬®2ÿ©«0ÿ§©.ÿ¤§,ÿ¢¤-ÿ¢¦/ÿž¡.ÿ—›*ÿ”—*ÿ’”*ÿ‘*ÿ‹Œ%ÿ‡†$ÿ}€*ÿwz$ÿqvÿpuÿltÿiqÿenÿekÿ`eÿeg%ÿkl.ÿst6ÿ{|<ÿ|}=ÿor-ÿ_cÿMeÿZr$ÿav8ÿw†Zÿš¤†ÿÀĸÿåèæ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõï ÷ÝÖ~ë½µÿÿ²{ÿÿ¦oÿô›iÿõšmÿýyÿÿž{ÿÿ{ÿÿ{ÿÿžuÿÿžrÿþžiÿ÷˜`ÿõ”Zÿø”Zÿÿ”[ÿÿ•\ÿþ›gÿüžiÿÿ¢kÿÿ¦oÿÿ«sÿÿ°xÿÿ·|ÿÿ»ÿÿ¾ƒÿÿÀ„ÿûćÿûÆÿ÷ÈÿöË’ÿöΔÿøЖÿúΙÿûÍÿùПÿûѤÿùÒ¦ÿûÒ«ÿúÓ¬ÿûÓ°ÿý×´ÿûØ·ÿûÙ»ÿúÚÃÿøÝÉÿøÞÒÿöß×ÿôàÛÿïàÝÿìÝÚÿëßÓÿåÞÅÿÝ×´ÿÖÔ¤ÿÎЕÿÈÊ„ÿÀÃsÿ¾Àgÿ½À]ÿ¼¾Tÿ·»Jÿ¸ºBÿ¶¹;ÿ±´6ÿ°²6ÿ¬®2ÿ¨ª.ÿ¥§+ÿ¤¦+ÿ£¥*ÿ £(ÿŸ¡*ÿ™&ÿ˜›(ÿ”˜'ÿ‘”'ÿŒŽ$ÿ†‡ ÿ‚ƒÿ€ÿwz$ÿvy#ÿtyÿqvÿjrÿfnÿdmÿgmÿlq&ÿqs1ÿ~Aÿ‰ŠLÿ…†Fÿtu5ÿeh#ÿ_cÿ[s%ÿkƒ5ÿwŒNÿ•¤xÿ¿É«ÿäèÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóìøØÓƒîèÿí°ÿè›zÿõ”rÿÿ™sÿÿ uÿÿ¤vÿý¥vÿó©yÿó©yÿó¦xÿñ sÿ÷™nÿþ”kÿÿ’gÿÿeÿõ–dÿø™gÿúžiÿþ¢mÿÿ§pÿÿ«sÿÿ¯uÿÿ±vÿÿ·|ÿÿº~ÿÿ½‚ÿÿÁ…ÿÿĉÿÿÈÿÿÌÿÿÎ’ÿÿÍ”ÿÿ͘ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿРÿýÒŸÿþÒ£ÿüÒ£ÿýÒ§ÿýÕ«ÿüÖ´ÿûÙ¼ÿûÚÆÿýÜÌÿøÞÐÿîáÓÿëÞÐÿéáÄÿåß²ÿÙÙ™ÿÔÕ…ÿÊÐqÿÄË\ÿºÃNÿ¶¾Aÿ²»<ÿ²¸5ÿ­´.ÿ­´.ÿ®³.ÿª¯*ÿ¨¬+ÿ¦ª)ÿ¤¨'ÿ£§&ÿ¡¥'ÿ £(ÿœ¡&ÿšž'ÿ•›&ÿ“—&ÿŽ“&ÿŠŽ%ÿ†Š#ÿƒ†#ÿ€ƒ ÿ~!ÿqw ÿos!ÿkoÿhkÿghÿjj$ÿqq+ÿxv5ÿ€>ÿƒ„BÿˆŒJÿ‡‹Iÿu|9ÿbi&ÿ[d!ÿbk(ÿdv;ÿ{ˆZÿ“ zÿ»ÄªÿåêÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìç2ÿÛÀìÿÅ¥ÿö©ˆÿú™wÿÿ—qÿÿrÿÿ¤vÿÿ¨yÿõ«{ÿôªzÿô§yÿø§zÿÿ¦{ÿÿ¤{ÿÿrÿÿ–kÿ÷˜fÿ÷˜fÿöšeÿøœgÿú iÿú¥mÿüªpÿû­rÿÿ³xÿþ¶zÿý¹~ÿý¾‚ÿýÁ†ÿýÅŠÿÿÉÿÿËÿÿË’ÿÿÌ—ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿÏŸÿüÑžÿýÑ¢ÿúСÿûÐ¥ÿúÒ¨ÿúÔ²ÿù׺ÿùØÄÿüÛËÿ÷ÝÏÿîáÓÿëÞÐÿéáÄÿäÞ±ÿÖÖ–ÿÏЀÿÄÊkÿ¼ÃTÿµ¾Iÿ±¹<ÿ¬µ6ÿ­³0ÿ©°*ÿª±+ÿ¬±,ÿ©®)ÿ§«*ÿ¦ª)ÿ¤¨'ÿ£§&ÿ ¤&ÿž¡&ÿ™ž#ÿ—›$ÿ‘—"ÿŒÿ…Šÿƒ‡ÿ‚†ÿ€ƒ ÿy|ÿtuÿkqÿjnÿhlÿjmÿqr(ÿ||6ÿ……?ÿŠˆGÿNÿ‘Oÿ‡‹Iÿvz8ÿcj'ÿ^e"ÿfo,ÿqz7ÿs…Jÿ‘žpÿ¶ÃÿàéÏøýî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúîî ïÚÜníÁ´ÿë«’ÿò wÿóŸoÿ÷¥nÿüªsÿõ®|ÿôª€ÿô¨„ÿõ¨ˆÿýª‹ÿÿ«ÿÿ¨†ÿý¤ÿû£tÿø qÿñœlÿî™iÿï›gÿóŸkÿø¦oÿüªsÿü­tÿþ¯vÿÿ³zÿÿ¶}ÿÿ»ÿÿ½ÿÿÀ„ÿÿÁ…ÿþÇŠÿýÊŒÿþÍÿÿÐ’ÿþÒ“ÿþÒ“ÿþÔ“ÿþÔ“ÿþÕ–ÿÿÕšÿýÖŸÿýקÿüÙ±ÿýÜ»ÿÿàÁÿÿßÌÿòßØÿîÛÔÿìÞÂÿçÛ«ÿØÔÿÎÍrÿÃÇVÿ»À?ÿ²º1ÿ¬´+ÿª±(ÿ¨¯&ÿ¦ª)ÿ¨ª.ÿ¨ª3ÿ¥§0ÿ£¨'ÿ¢§&ÿŸ§%ÿœ¢%ÿ˜ $ÿ”š#ÿ–#ÿ“$ÿˆŽ#ÿ…‰"ÿ€„$ÿ}€$ÿw|!ÿsv ÿkqÿgkÿhpÿot)ÿxy5ÿ~Bÿ‰‚Pÿ‘ŠXÿ”ŽYÿ”ŽYÿ—–ZÿŽŽNÿ|<ÿhr,ÿ^h&ÿ_l.ÿn}@ÿ}‡Xÿ—žƒÿ½À±ÿàäØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïñ ÿÜÏÿÄ«ÿÿ°‡ÿø¤tÿô¢kÿö¤mÿö¯}ÿù¯…ÿû¯‹ÿù¬Œÿýª‹ÿÿªŒÿÿ®Œÿÿ°‹ÿÿ°ÿÿ­~ÿÿªzÿû¦vÿù¥qÿö¢nÿô¢kÿò iÿô¥lÿö§nÿø«rÿû®uÿü´xÿÿ·{ÿÿ»ÿÿ½ÿøÁ„ÿøŇÿùÈŠÿüËÿúÎÿûÏÿúÐÿûÑÿüÓ”ÿüÒ—ÿúÓœÿùÓ£ÿùÖ®ÿúÙ¸ÿýÞ¿ÿýÝÊÿïÜÕÿìÙÒÿêÜÀÿåÙ©ÿ×ÓŒÿÍÌqÿÃÇVÿ»À?ÿ¯·.ÿ©±(ÿ§®%ÿ¦­$ÿ£§&ÿ£¥)ÿ¢¤-ÿŸ¡*ÿž£"ÿ¢!ÿš¢ ÿ— ÿ’šÿŽ”ÿŠ‘ÿˆŽÿ‡ÿ€„ÿ{ÿuxÿnsÿorÿu{$ÿ{-ÿ~†3ÿ‰ŽCÿ“”Pÿ•”Xÿ˜‘_ÿ›”bÿœ–aÿš”_ÿ”“Wÿ?ÿjo*ÿcm'ÿeo-ÿkx:ÿƒ’Uÿž¨yÿÅ̱ÿéìÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêâÕ€ãγÿ⸕ÿæ¨ÿôœwÿÿ¢ÿÿ©†ÿÿ­ÿÿ°ÿú°Žÿó±Žÿò´Žÿô¶ÿÿ¶ÿÿ·ÿÿ·ÿÿ·ÿÿ¶Šÿø¯ƒÿó¨zÿî£uÿñ¥tÿò¦uÿó¨tÿô©uÿø¬wÿû¯zÿÿ³~ÿÿµ€ÿú¹‚ÿü»„ÿþ¿…ÿÿÁ‡ÿþŇÿÿljÿÿˈÿÿ̉ÿÿ΋ÿÿÍŽÿÿÎ’ÿÿÏ›ÿÿÑ¥ÿÿÔ°ÿÿÙ·ÿÿÙÂÿîÙÑÿëÖÎÿéÙ¼ÿåצÿØЊÿÐËpÿÇÆXÿ¾½Cÿ²´2ÿ¬®,ÿ§¬)ÿ¤§)ÿŸ¡)ÿž-ÿ››/ÿ——+ÿ“š'ÿ’™&ÿ•$ÿŒ‘$ÿ‡Œ#ÿ„ˆ#ÿ…&ÿ€‚(ÿuz%ÿux(ÿtx,ÿtw/ÿvz3ÿ~€>ÿŠŒJÿ“”Vÿ”œ]ÿ˜žcÿ›Ÿdÿœšdÿ›™cÿ›eÿš˜^ÿ“‘WÿEÿlq4ÿ`f+ÿfo7ÿp{Iÿ‚Ždÿ¤µŠÿÈÔ¶ÿéêæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷êûæË¥øΫÿóµŒÿû£~ÿþšwÿÿ¢ÿÿªŒÿÿ³“ÿÿ¸–ÿû¹–ÿõ·‘ÿñ³ÿÿº“ÿÿº“ÿÿº“ÿÿ»”ÿÿ¾’ÿÿ¾’ÿÿ¼ŽÿÿºŒÿý±€ÿü°ÿù®zÿö«wÿõ©tÿöªuÿø¬wÿú®yÿöµ~ÿ÷¶ÿ÷¸~ÿùº€ÿ÷¾€ÿúÁƒÿûƃÿýÈ…ÿÿʇÿÿÊ‹ÿþÊŽÿýË—ÿÿ΢ÿÿÑ­ÿÿ×µÿÿ×ÀÿëÖÎÿçÒÊÿåÕ¸ÿßÑ ÿÑɃÿÈÃhÿ¾½Oÿ¶µ;ÿ¬®,ÿ¦¨&ÿ¡¦#ÿŸ¢$ÿ›%ÿ›š*ÿ™™-ÿ••)ÿŽ•"ÿ”!ÿŠÿ†‹ÿ†ÿ~‚ÿz~ÿz|"ÿ{€+ÿ~1ÿ…‰=ÿ‘”Lÿ¡Zÿ¤¦dÿ¤¦dÿ¢£eÿž¦gÿ£hÿ›Ÿdÿ›eÿ¢ jÿ£¡kÿ—•[ÿ…ƒIÿll0ÿhm0ÿkq6ÿvGÿ‡’`ÿ¥±‡ÿÌݲÿíùÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïëàOñÐÁÿï·¤ÿö£ÿõÿùŸ|ÿÿ¬‰ÿÿº“ÿÿ¼”ÿø¼’ÿø¼’ÿ÷ºšÿõ¸˜ÿö¹™ÿù¼œÿýÀžÿþÁŸÿÿžÿÿžÿÿÂœÿÿÀšÿÿ¾—ÿûº“ÿù·Žÿô²‰ÿñ°„ÿî­ÿú¬ÿú¬ÿ÷¯€ÿø°ÿù´‚ÿý¸†ÿÿ½†ÿÿ¿ˆÿÿ¿ˆÿÿÀ‰ÿÿÀÿÿÁ•ÿÿÄžÿÿȪÿÿʵÿÿйÿèØ»ÿåÕ¸ÿáÖªÿÚÏ–ÿÊÄ{ÿÁ¼gÿ¶´Pÿªª>ÿŸ¢/ÿš*ÿ•˜%ÿ“”&ÿ“$ÿŠŽ$ÿ‡ ÿ†‹"ÿ~‚)ÿ‚-ÿ€ƒ.ÿ€1ÿ5ÿ…†>ÿŒKÿ“’Uÿ˜—]ÿ¤¢lÿ«ªwÿª¨xÿ¦¦vÿ¨¨xÿ¥¨wÿ¡¢vÿ¡wÿž¢xÿ¤©uÿ£¨kÿ¡©cÿ™¡[ÿ~†@ÿjr,ÿci0ÿkn=ÿy|Uÿ’sÿ«±˜ÿÑÙÈ°ïùé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþúï ÿêÛnÿÚǽÿ»¥ÿÿ¬Žÿú }ÿÿ¥‚ÿÿ³Œÿÿ¼”ÿþ˜ÿÿÅ›ÿü¿ŸÿýÀ ÿýÀ ÿü¿Ÿÿü¿ÿÿ ÿÿÅ¡ÿÿÇ£ÿÿÇ¡ÿÿÇ¡ÿÿÈ¡ÿÿÈ¡ÿÿÉ ÿÿÇžÿÿÇ›ÿÿÆšÿÿ»ÿÿ¹Žÿÿ¸‰ÿýµ†ÿù´‚ÿø³ÿù¶ÿù¶ÿû¸ÿü¹‚ÿú¸…ÿú¹ÿû¼–ÿþÀ¢ÿÿ­ÿþȱÿßϲÿÜ̯ÿ×Ì ÿÑÆÿÁ»rÿ·²]ÿ­«Gÿ¢¢6ÿ™œ)ÿ•˜%ÿ’•"ÿ“”&ÿ–'ÿ”*ÿ‘—*ÿ’—.ÿ”;ÿ“–Aÿ™œGÿ ¡Qÿ¥§[ÿ¬­eÿ°±oÿ³²uÿ¸·}ÿ¸¶€ÿ´³€ÿ±¯ÿ­­}ÿ¬¬|ÿª­|ÿ©ª~ÿ¥©ÿ¤¨~ÿ¬±}ÿ¨­pÿ•Wÿ~†@ÿlt.ÿks-ÿsy@ÿƒ†Uÿ›žwÿ¸½žÿÜâÉ°õýìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòãÓƒìË·ÿã³—ÿ꧆ÿò¨„ÿù¯‹ÿÿ»•ÿÿÄžÿýŨÿüħÿø¤ÿõ¿¡ÿöÁ¦ÿûÆ«ÿýÈ­ÿûÆ«ÿüÊ®ÿý˯ÿÿͯÿÿϱÿÿвÿÿвÿÿѱÿÿаÿÿÑ°ÿÿЯÿÿÏ­ÿü̪ÿø˦ÿõÈ£ÿõÇžÿôÆÿñÚÿð™ÿíÀšÿêÀÿèÀ£ÿéĪÿìdzÿêɵÿßжÿÛ̲ÿ×ʪÿÎÄœÿÀ¹ˆÿµ±wÿ¬ªjÿ£¢^ÿ››Uÿ™™Sÿš›SÿžVÿ¡¢Xÿ¥¦\ÿª«aÿ®¯eÿ¶¶zÿ¸·ÿº»ƒÿ¾½ŠÿÂÁÿÃÀ“ÿÀ¿“ÿ¾¼”ÿ¶µÿ²±‹ÿ°¯‰ÿ±°Šÿ¯°‰ÿ¬­†ÿ«¬„ÿ­®†ÿ®±Šÿ¬¯ˆÿ¥«zÿŠ“Zÿq};ÿht2ÿhv6ÿs~Fÿ†dÿ¨­ŽÿÉιÿçèßYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûëÿêÖ~ÿÓ·ÿýº™ÿó©…ÿÿô­‡ÿÿ¹“ÿþÆ©ÿÿÊ­ÿÿÌ®ÿþȪÿúŪÿûÆ«ÿüǬÿúŪÿüÊ®ÿý˯ÿþÌ®ÿÿͯÿÿϱÿÿвÿÿѱÿÿÒ²ÿÿÕ´ÿÿ׶ÿÿÚ¸ÿÿÛ¹ÿÿÜ·ÿÿÚµÿÿÙ°ÿÿ×®ÿÿدÿÿ×®ÿÿÕ¯ÿþÔ±ÿüÔ·ÿûÖ¼ÿü×ÃÿúÙÅÿîßÅÿêÛÁÿèÛ»ÿâØ°ÿØÑ ÿÑÍ“ÿËɉÿÄÃÿÅÅÿÄÄ~ÿÅÆ~ÿÈÉÿÊËÿÌ̓ÿÐчÿÓÔŠÿÍÍ‘ÿÌË“ÿÈÉ‘ÿÆÅ’ÿÃÂÿÀ½ÿ»ºŽÿ¹·ÿº¹“ÿ·¶ÿ¶µÿ¶µÿµ¶ÿ´µŽÿ´µÿ·¸ÿ´·ÿ¡¤}ÿŠ_ÿmv=ÿam+ÿlx6ÿ}‹Kÿ‘œdÿ³¼‘ÿ×ܽÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðè(õÚÌšéÁ¯ÿä®—ÿ਋ÿå©Œÿõ·™ÿÿĦÿÿгÿÿÑ´ÿÿ̯ÿþȯÿüɯÿúɳÿ÷Ë´ÿ÷Ë´ÿõʵÿ÷Ì·ÿ÷θÿúÑ»ÿúÓ½ÿûÔ¾ÿñÔ¹ÿòÕºÿó׿ÿõÙÁÿôÚÂÿôÚÂÿõÚÀÿôÙ¿ÿøÝÂÿøÝÂÿ÷ßÃÿùßÇÿ÷ãÊÿõäÏÿõèÒÿöæÙÿúæáÿöâÝÿòå×ÿîâÐÿâÝÄÿÝÙ¼ÿÙضÿÔÓ±ÿË̪ÿÊË©ÿËʨÿÊɧÿÉƧÿÆäÿÈâÿÉÄ£ÿÅÄžÿÄÃÿÂÃœÿ¿¾œÿ½¼šÿ¼ºœÿ½»ÿ½»ÿ½»œÿ»¹šÿ·¸–ÿ¸»”ÿ½Á˜ÿÁÆ™ÿ¾Ä•ÿ¸¾ÿŸ§xÿ}…VÿhrCÿirGÿr|Qÿˆeÿ• €ÿ¶¾§ÿÞçÓƒñ÷ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöè(ÿåÓƒÿйÿô¼Ÿÿ믒ÿ樊ÿì®ÿôºÿÿǪÿÿÒµÿÿÕ¼ÿÿÕ»ÿÿÒ¼ÿüйÿüйÿúϺÿúϺÿúÑ»ÿûÒ¼ÿûÔ¾ÿüÕ¿ÿöÙ¾ÿöÙ¾ÿôØÀÿôØÀÿóÙÁÿõÛÃÿøÝÃÿùÞÄÿøÝÂÿùÞÃÿùáÅÿûáÉÿøäËÿöåÐÿôçÑÿõåØÿüèãÿ÷ãÞÿóæØÿðäÒÿäßÆÿßÛ¾ÿÛÚ¸ÿ×Ö´ÿÑÒ°ÿÏЮÿÐÏ­ÿÐÏ­ÿÏÌ­ÿËÈ©ÿËÆ¥ÿËÆ¥ÿÇÆ ÿÈÇ¡ÿÇÈ¡ÿÆÅ£ÿÄáÿÃÁ£ÿÃÁ£ÿĤÿÀ¾ŸÿÁ¿ ÿÂáÿÅÈ¡ÿÇË¢ÿ½Â•ÿ¦¬}ÿ‘—hÿv~Oÿgo@ÿhrCÿ{„Yÿ– uÿ³º—ÿËÖ¶ÿæî×~øÿíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñè(òàÏùкÿþ¹˜ÿô¯Žÿî«Šÿö¶˜ÿÿƨÿÿжÿÿÓºÿÿÔ¾ÿÿÖÀÿÿÖÃÿÿÔÃÿûÕÃÿøÔÂÿøÔÂÿöÕÂÿöÕÂÿÿ×Äÿÿ×ÄÿþÖÄÿÿÕÈÿþÖÊÿÿ×ËÿÿÙÌÿÿÚÍÿÿÚËÿÿÛÌÿÿÜÊÿÿÝËÿÿßÏÿÿßÒÿþáÒÿüâÖÿùæßÿñáÚÿîãÕÿéãÐÿßÞÂÿÖÛ»ÿÐÛµÿÍزÿÈÓ­ÿÅέÿÄÌ­ÿÉ̲ÿÉ̲ÿÌÉ´ÿÌƳÿÌƳÿÊË«ÿÊË«ÿÉÉ«ÿÈȪÿÇƪÿÆÅ©ÿÅĨÿæÿÏϱÿÍάÿÈˤÿÁÅ›ÿ±·†ÿš¢mÿ€‰QÿpyAÿp|@ÿ‹Oÿ–Ÿtÿ©®ÿÃƶÿãçâEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûêÿñÛnÿÛºÿÿ˪ÿýº™ÿò²”ÿì°’ÿí´šÿø©ÿÿÑ»ÿÿÚÄÿÿÚÇÿÿÚÉÿÿÜÊÿÿÜÊÿÿÜÊÿýÜÉÿüÛÈÿÿÚÇÿÿÛÈÿÿÜÊÿÿÛÎÿÿÛÏÿÿÛÏÿÿÚÍÿÿÙÌÿÿÛÌÿÿÛÌÿÿÝËÿÿÞÌÿÿàÐÿÿáÔÿÿäÕÿÿæÚÿùæßÿñáÚÿîãÕÿêäÑÿâáÅÿÙÞ¾ÿÔß¹ÿÑܶÿÐÛµÿÌÕ´ÿÊÒ³ÿÎÑ·ÿÏÒ¸ÿÑιÿÒ̹ÿÑ˸ÿÎϯÿÌÍ­ÿËË­ÿÎΰÿÒѵÿÕÔ¸ÿÕÔ¸ÿÔÓ·ÿÑѳÿÃÄ¢ÿ°³Œÿ™sÿ‡Vÿs{FÿxIÿ†Wÿ‘aÿ¨´xÿÊÓ¨ÿâçÈ°óöæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþûìùïÝcîÜËÿçɶÿâ¹£ÿâ®—ÿð­–ÿö³œÿÿìÿÿͶÿÿÚÄÿÿáÌÿÿäÑÿúãÓÿïâÒÿíàÐÿõàÊÿõàÊÿõàÊÿöáËÿúãÍÿûäÎÿúáÍÿøßËÿûáÐÿüâÑÿüâÒÿýãÓÿþäÔÿÿæÖÿÿèØÿÿèÝÿñèÞÿïæÜÿêä×ÿçáÔÿâßÐÿßÜÍÿÙÚÆÿ×ØÄÿÓÖ½ÿÒÕ¼ÿÑÔºÿÐÓ¹ÿÏÔµÿÏÔµÿÏÔµÿÐÕ¶ÿÙÒÁÿÖϾÿÚÖ¾ÿÛؼÿÙÛ·ÿàä»ÿ×à®ÿ¾Ç•ÿ¬¸„ÿ–¢nÿ}ŠVÿuQÿrSÿvYÿŠ˜oÿ§³ÿÌÌÌšÚÚÚnìììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþìÿøç2ÿîÛnÿàÊ¥ÿ̵ÿýº£ÿô±šÿñ®—ÿù¶Ÿÿû¬ÿùÌ·ÿ÷ÖÃÿößÏÿôç×ÿøëÛÿÿêÔÿþéÓÿýèÒÿûæÐÿüåÏÿüåÏÿþåÑÿÿæÒÿüâÑÿûáÐÿûáÑÿüâÒÿþäÔÿÿç×ÿÿéÙÿÿéÞÿõìâÿôëáÿðêÝÿíçÚÿçäÕÿäáÒÿÞßËÿÝÞÊÿÚÝÄÿØÛÂÿÖÙ¿ÿÖÙ¿ÿ×ܽÿÙÞ¿ÿÚßÀÿÚßÀÿèáÐÿçàÏÿëçÏÿãàÄÿÌΪÿ¾Â™ÿ­¶„ÿ— nÿ‚ŽZÿ{‡Sÿu‚Nÿ~ŠZÿ’Ÿsÿ«¶ŽÿÂЧÿØäÀìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûïå;ïßÏêÒÀÿÝ¿¬ÿἦÿḡÿ浟ÿí»¥ÿþDzÿÿÒ¾ÿÿÙÅÿÿàÜÿÿåáÿÿëçÿÿíéÿÿìçÿÿéäÿÿèäÿÿèäÿûçâÿ÷çáÿôåâÿòçãÿñèäÿïëæÿðíèÿðíèÿöêêÿöêêÿóééÿðææÿêãàÿæßÜÿáÝØÿàÜ×ÿáàÖÿßÞÔÿààÔÿãã×ÿèèÚÿêêÜÿéêÚÿæç×ÿÝãÀÿÒصÿÉЫÿ·¾™ÿ™¢zÿ‡hÿŠbÿy„\ÿz„`ÿ‹“tÿš£‰ÿ­´ŸÿÈÏÀìâèÝcðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüìÿõãEÿéÖ~ÿàÊ¥øϸÿð¿©ÿë¹£ÿ︣ÿõº¦ÿõº¦ÿëÆÂÿóÎÊÿüÙÕÿÿâÞÿÿçâÿÿèãÿÿêæÿÿëçÿÿîéÿÿðêÿþïìÿûðìÿùðìÿõñìÿõòíÿ÷ôïÿüððÿþòòÿýóóÿüòòÿøñîÿöïìÿòîéÿòîéÿðïåÿìëáÿççÛÿååÙÿááÓÿÚÚÌÿÏÐÀÿÇȸÿ°¶“ÿž¤ÿ–qÿ†hÿ|…]ÿ}†^ÿŠ•mÿ–¡yÿ®¸”ÿÉѲÿÝæÌšéðÛnóúëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóå;ûçÖ~÷ÛÊÿøÏÀÿí±ÿë¹¥ÿï¹¢ÿðº£ÿó½¦ÿø«ÿýɲÿÿѺÿÿØÁÿÿÞÆÿÿëÓÿÿïÖÿÿôÚÿÿöÜÿÿöÛÿÿ÷ÜÿÿúßÿÿýâÿýûÝÿþüÞÿüüÞÿúúÜÿõøØÿòõÕÿìóÐÿëòÏÿÞèÄÿÔÞºÿÆÑ«ÿ¸Ãÿ­¸ÿ¡¬„ÿ”ŸwÿŒ—oÿ…‘mÿ~‰iÿŒkÿ™{ÿš¦ˆÿ©´šÿ¾È±ÿÏØÄÊáèÙyðöëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíÿùè(ÿðáOÿäÓƒÿÛǽÿйÿÿʳÿ÷Áªÿò¼¥ÿﻤÿð¼¥ÿｦÿí¿§ÿé½¥ÿê©ÿíÈ®ÿëÊ°ÿêͲÿíеÿðÕºÿôÙ¾ÿæäÆÿãáÃÿÚÚ¼ÿÒÒ´ÿÆÉ©ÿ½À ÿ±¸•ÿ¬³ÿž¨„ÿ—¡}ÿ˜rÿ‡’lÿ‡’jÿŠ•mÿŽ™qÿ‘œtÿ›§ƒÿ¤¯ÿ´¿žÿÈÒ´ÿÕáÃÜàëщí÷àOùÿîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôùä;ñòÞYìë×ÿèâÏÿæÚÈÿáÑÀÿÞʹÿàôÿݼ¬ÿ们ÿ纬ÿ뺬ÿï»®ÿõ¾±ÿúÁ²ÿüôÿÔѼÿÏÌ·ÿÆîÿ½º¥ÿ°²œÿ¦¨’ÿ›Ÿ†ÿ”˜ÿ‘—~ÿ’˜ÿ”ƒÿ›¤Šÿ¦¯•ÿ´½£ÿÃ̲ÿÌÕ»ÿÓÚË¥ÞäÙyèïâEîóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð ÿÿíÿþëÿúè(ÿõä;ÿïÞYÿêÛnÿåÕ€ÿßЉÿØÊ¥ÿÔƽÿÓƽÿÔǽÿÕƽÿÔÅÊÞÛƽÚ×ÂÜÖÓ¾ÿÕÒ½ÿÑÓ½ÿÏÑ»ÿÉÍ´ÿÅÉ°ÿÈεÿÏÕ¼ÿÕÞÄÊÝæÌšãìÒƒéòØyðùßYõþä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîíåäêãââââåææíïï ÜÚÚ6ÔÏÐj½À¿¦¬±°¶¦¦¦Á £¤äž£¥à¦§¤Á±±¯µ¾Á®ÓÔÔràáÞ4ìíë îïíâãáÚÚÙÝßÞæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîîæåðèçãàá*ÆÄÄ}¢¢¢Ú…‰‰ÿw‹ˆÿg‘Šÿkž–ÿ€«¤ÿš®ªÿ¨«¤ÿ¦¦šÿš—ŠÿŒ‚ÿˆˆƒÿˆŠˆþ¢£¢ÔÈÊÈáâà'ßßÞÞàßæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççðõóìãâ1Á¸¶¬ŠŒ‹ôp‹†ÿj©Ÿÿfͼÿ`ßÊÿVçÓÿMêÔÿfíØÿ¿ðàÿééÓÿçÚ«ÿâÙŽÿäÖ•ÿÙΚÿÇ¿˜ÿª¡ÿ‹‡ƒÿŠŽó¶¸¸›Þàà,êìïééîééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëíêêîììÄÈÇš‹Žõi–ŽÿiǹÿYãÐÿAéÒÿ-çÎÿ(äÍÿ#âÍÿ(âÌÿMäÎÿ®æÙÿßáÈÿãшÿÞÓYÿÞÓYÿÞÐgÿÞÓoÿâØÿÝÓ›ÿöÿ”Ž‡ÿôÂÃÈ”ìíòëëñááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææñîïçâã6«£¥ÓsŒÿoĸÿYåÒÿ8åÍÿ%áÉÿ&ßÇÿ(ÝÆÿ)ÚÃÿ!ØÀÿ%Öºÿ=Ú¼ÿ˜ÜÈÿÎÔ³ÿØÂxÿÙÀTÿÚÀZÿÜÄ^ÿÞËYÿÞÍWÿÝÍ`ÿãÑtÿàÓ–ÿûšÿ‘Ž†ÿ¦¥«ÑÞßè:ååçíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòëêêÝ××V‘––ôl© ÿ\àÍÿ8åËÿ$áÄÿ"ÞÁÿ%Ú¼ÿ$Ö·ÿÑ­ÿÍ¥ÿÉ¢ÿ+Æ¢ÿEЬÿ—Õ»ÿÆͨÿÊ·sÿëPÿÁ§IÿÆ­IÿÌ´NÿÕºXÿÚÁ[ÿÛÇYÿÜÉ^ÿáÏxÿÝКÿ§¡Žÿ••šð×ØÚPòññìóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôèøõíù÷ÙÔÕ\†“‘ùn¿´ÿPåÏÿ*ßÅÿ$ÛÁÿ$عÿÒ°ÿ ʤÿÄ™ÿ"–ÿ6ÆœÿHͦÿiÓ³ÿ…ßÂÿ¿ãÔÿÞàÍÿâÑ«ÿÖÀŽÿеyÿƨ_ÿ¼žLÿ¾¡HÿÆ«KÿÍ´RÿÓÀTÿÙÅVÿÚÇeÿÞÐÿ¸±•ÿ”“’ùØØÙ[ï÷ôêõóêõóêõóêõóêõóÿÿÿÿÿÿÿÿÿÿÿÿêóòêóòêóòêóòî÷õÛàßu‹—–ùkƸÿDâÊÿ$Ú¾ÿ#عÿÑ­ÿÉ¡ÿÁ˜ÿ»ÿ)¾Žÿ:Ä—ÿF›ÿCÁ—ÿ9À‘ÿIÕÿ„Ë£ÿ³¿•ÿ¼£kÿº^ÿÃ¥iÿɧsÿƨiÿºŸQÿµ™Dÿ½DÿĪIÿ͵QÿÕ¿TÿÕÂ]ÿáÌ€ÿƸžÿ—š‘ú×àÞYñõòíòíîòíîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòïïòïïòïïôòñìáâ0—œ›÷kôÿDàÇÿ"عÿÔ²ÿ Ê¥ÿ˜ÿ¼Šÿ¹„ÿ ¹„ÿ*µ…ÿ ³ÿ´zÿ'·„ÿ9Á“ÿ^Ê¥ô•Ó³æ¹Ç¡àÀ­è·›aÿ°ŒMÿ«…>ÿ¯‰@ÿ»‘Pÿ½”Sÿ²’Aÿµ•?ÿ¿JÿÉ«MÿϹOÿÒ¾VÿÝÊ}ÿÁ¶ÿ¡Ÿ ìéèä2óóîððëððìððìÿÿÿÿÿÿÿÿÿÿÿÿñíìñíìòííõïï«®¬Ór¼®ÿBàÄÿÖ¶ÿѬÿÈÿ¿‘ÿ·…ÿ´{ÿ³vÿ°vÿ±ÿFßÿŠÚÅÞ«ëØ–Ëöëméúø&îøüÞæÓ îåÖòìÜFàÛÂ}ÑèɷŸoÿ£ˆ?ÿ©„8ÿ³†Bÿ²Š>ÿ³>ÿ»—DÿĦHÿ̵KÿÓ¼OÿØÇÿµ­˜ÿ±°°ÇðòððóîïòíïòíÿÿÿÿÿÿÿÿÿÿÿÿñííñííöñòËÇLJv¯¤ÿBàÂÿ"Ô²ÿΨÿ Äšÿ¼Šÿµ€ÿ±xÿ¯tÿ°{ÿF¿˜ÿ–áÈÏÎ÷íZêÿþÐúîÓþóíüûî÷üÜäÐìãÔøóãñðÙúøñòïßAÓΧ¸³›iÿ§=ÿ©5ÿ«…5ÿ°‰:ÿ¸‘CÿÀ¡FÿɯKÿ͹RÿÓƇÿª¦šÿËÍɉòöîîñêîñêÿÿÿÿÿÿÿÿÿÿÿÿééêëëìèãã,’¬§õ]Ô½ÿ(Ô³ÿ̧ÿÙÿ¹Šÿ´}ÿ±xÿ®uÿ#³€ÿvÏ´ðÈôìvâÿúßÿöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéù÷çñìÓîãÓRǹŠæ§…Fÿ§3ÿªƒ4ÿ­‡<ÿ³’=ÿ»ŸHÿͬKÿÏ·ZÿÉÀÿ¯§¨õéçê!ðïïîíîÿÿÿÿÿÿÿÿÿÿÿÿåëêéïïÆÂħp¿°ÿ+صÿ"ɤÿ–ÿ»ˆÿ±ƒÿ±vÿ®tÿ'²†ÿˆ×Àõäüõ2èÿÿÛþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËüöæõô玡˫‰Bÿª}2ÿ¢‚6ÿ¯‰7ÿ¸’?ÿ¼ŸGÿȬGÿÓ»jÿº¯žÿÇÇË–ðïðëêëÿÿÿÿÿÿÿÿÿÿÿÿêééåãã"›´¯õVзÿË¥ÿÙÿºŠÿ³~ÿ®xÿ­rÿ²~ÿ€Ò¹åçýö:ðÿþåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËùóâ÷÷ëûöì̼˜Ø¦…@ÿ¨z8ÿ«€6ÿ®Š6ÿ²‘?ÿÁ¡DÿƪRÿȺ‰ÿ²°©îäããçååÿÿÿÿÿÿÿÿÿÿÿÿíííÑÑÐvyÁ°ÿ.ЬÿÄ™ÿ½ÿ´‚ÿ°xÿ°qÿ¯wÿdȪùÛõíMíÿúìÿüåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåëæÊùóáõôçü÷íîéå/¼­{ô­‚6ÿ¨|7ÿ¨‚4ÿ¯‰=ÿº•@ÿÀ Eÿʳdÿº²˜ÿÒÒÑmíîñÿÿÿÿÿÿÿÿÿÿÿÿíññ´Â¿ÏUË®ÿÇžÿ¾Žÿ·‚ÿ±zÿ®tÿ¯qÿ8»‘ÿ¾äÙ‡òúøíùöëýùäýûÙþôÚýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéöôäòðØùõêöõêöôéøöïæàʆ±˜Uÿ¦}4ÿ¨~5ÿ«‚9ÿ²Œ=ÿ¹™@ÿÅ¥LÿÅ´†ÿÂÀ»Çîñùÿÿÿÿÿÿÿÿÿÿÿÿæëë2œ½¶ÿ:Ì©ÿ¾“ÿº‡ÿ³{ÿ°vÿ¬rÿ±yÿ}Ϲîéöôæ÷õå÷ôå÷ôæ÷öâýøÞýöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷ôäóòèñíëòîêòîêòïëóïî ĵ™à©„8ÿ¨}1ÿª6ÿ­‡9ÿ±‘>ÿ¾˜CÿŬnÿ¼¹«úäèï0ÿÿÿÿÿÿÿÿÿÿÿÿâÚÜ\vðÿ)Åÿ¹Œÿµÿ°yÿ­uÿ­sÿ5¹ŠÿÀâÛŸøÿÿñÿÿñÿÿñÿÿñÿÿñÿÿñÿÿëÿþÉ÷êÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÔ÷öëôñæòðæñïæñïæñïæñïåõóëÚ×Ê’®’Uÿ§~/ÿ¨6ÿ«8ÿ°‰;ÿ¶“=ÿãVÿ¼µ—ÿ×Ùã`ÿÿÿÿÿÿÿÿÿÿÿÿÏÒцZèÿÀ’ÿ·„ÿ³{ÿ¯uÿ¬sÿ®wÿZÅ þàíç<ï÷ôì÷ôì÷ôì÷ôì÷ôì÷ôí÷óìøõÇ÷éÏüñëûúí÷ûÜäÐìãÓ÷ñàîìÖîòéííèíîèîîèîîèîîèîîèïðêçèá@¸¥xÿ©€5ÿ©}4ÿ¬7ÿ®…9ÿ³Œ;ÿ»˜Fÿ»°…ÿÕÔØÿÿÿÿÿÿÿÿÿÿÿÿÂÒδHÄ¢ÿ¹‡ÿ³~ÿ°wÿ®sÿ­qÿ²}ÿͶæéìéâëæâëæâëæâëæâëæâëæâëæãëæÜîçØüôêüúí÷ûÜäÐìãÒöòçíððìïñìïñìïñìïñìïñìïñìïñíðòìðóÁ¶šîª„<ÿ¦|1ÿª4ÿ¬‚4ÿ¯‰7ÿµ<ÿ»ªvÿÐÍË¢ÿÿÿÿÿÿÿÿÿÿÿÿ¼ÎÇÁFÄŸÿ¹…ÿ´~ÿ²zÿ±xÿ¯vÿ-¶‡ÿ¡ÍûíçëææçææèææèææèææèææèææèææçèåçãëêêúùíøüÜäÐéãÔéëèçêêçêéçêéçêéçêéçêéçêéçêéçêééííɯ̮ŽJÿ¥€6ÿ¨‚8ÿª„:ÿ­‰=ÿ²Aÿº¤pÿÏÈŶÿÿÿÿÿÿÿÿÿÿÿÿ¾ÌÈÁaÉ¥ÿH¿‘ÿG¼ÿE»ŠÿCº‰ÿ@ºˆÿXšÿ¸ÍʵßÙÞÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÛÞàãéôõåìåççæçèèçèèçèèçèèçèèçèèçèèçèèçèèçèèêëìÎɼú gÿ±Rÿ³‘Sÿ¶“Tÿ·•Wÿº™Yÿ¾«{ÿÎÊÆÖÿÿÿÿÿÿÿÿÿÿÿÿÊÌÎîɦÿ¥¾—ÿ¥½—ÿ£»•ÿ£»•ÿ¢½•ÿ¬Æ¦ÿÆÏɶÚÝÝ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛÙÞÝëíìîîíìçéìæçëæçëæçëæçëæçëæçëæçëæçëæçëæçîèëÊÉÁIJ¬|ÿ©›eÿ®œdÿ°eÿ¯žiÿ°¡lÿ³²„ÿÌËŸÿÿÿÿÿÿÿÿÿÿÿÿßÎ˹éµÿë¥zÿè£zÿé£zÿè£zÿè£yÿã°‘ÿÐŽÊëíîëììëëìëëìëëìëëìëëìëëìëëìëììêëëæéêîïîîîìééêèåèéæééçééçééçééçééçééçééçééçéìéí½¿µË•\ÿ€Bÿ„Aÿ„€Aÿ„‚Dÿ‡ƒDÿ“›fÿÆÉÁªÿÿÿÿÿÿÿÿÿÿÿÿàÕιú£yÿýŽZÿü[ÿý[ÿüŽ[ÿþ[ÿûœvÿθ«óèõõ%ðûúïúùïúùïúùïúùïúùïúùîúùïûùæììâççîïîîîìèéêããæëéîèçìèçìèçìèçìèçìèçìèçìéèíéç﩯Ÿðt|8ÿbfÿcd ÿbcÿbeÿafÿy†MÿÌÐÊÿÿÿÿÿÿÿÿÿÿÿÿßßÙ‘ô£|ÿý‰RÿýˆSÿþˆSÿþŠVÿüTÿþ›iÿÕ¯ ÿÙééëûùéøöéøöéøöéøöéøöéø÷êøøêóóäééãçèîïîîîìèéêÝÞßäâæéçêëéêëéêëéêëéêëéêëéêíëìáÞãC™ …ÿmt(ÿ^`ÿ]_ÿ]^ÿ\^ÿ[_ÿ{‡PÿÔØÔtÿÿÿÿÿÿÿÿÿÿÿÿèçå^ñ©ŠÿýŠUÿý†Sÿü‡SÿþŠWÿüWÿÿšfÿݨ“ÿÅÏΧëðõçìðèìðèìðçìðèìñçìïâæéçêíäééãçèîïîîîìèéêÞßààßãäæãîðëìíêìíêìíêìíêìíêðòïÍÌΡ”mÿlq"ÿacÿ^aÿ\_ÿ]_ÿ]`ÿŠ“dÿßáÝPÿÿÿÿÿÿÿÿÿÿÿÿóóí#ì¹¢öþZÿþ†Rÿù‰RÿÿŠVÿýZÿÿ˜dÿÿº±«èêîöñõúðóùðóùðôùîðöéçìáâæçëîäééãçèîïîîîìèéêÞßààßãÝàÝíñêîñïìïóëîòëîòíðôéì类§í‰Rÿmnÿeeÿ^aÿ]`ÿ]^ÿ]dÿ ¦‰ñðòíÿÿÿÿÿÿÿÿÿÿÿÿöôðë;¾ü“fÿÿ†Oÿü‰PÿþŠVÿü‘Yÿý˜`ÿÿ­ƒÿħšÿÂÍЛñùüíô÷íô÷ìôöéìîåäèâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóêíñìêëñíðòíïññôöÈËÒ›”ž€ÿ‚‹6ÿlmÿdfÿ]aÿ]_ÿZ^ÿeo,ÿ¿Å®¼õöóÿÿÿÿÿÿÿÿÿÿÿÿïôôéâÜjó¡}ÿþˆQÿþˆPÿþŠVÿü‘Xÿþš`ÿÿ¤sÿÿ¨¥žöçâç2õïóðêïåèéçèêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëêîèèçìððîôóòãæå@¢Ÿö–Ÿfÿ{€!ÿmoÿceÿ^_ÿ[^ÿY]ÿxƒOÿÜâÑlñöìÿÿÿÿÿÿÿÿÿÿÿÿîîëííè긟îùWÿþˆPÿþˆVÿþUÿþ˜aÿü£hÿÿ¹ŠÿÓ®œÿ«¨©ÓèééàßââçèèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïéåãéëéëîì짩©Øœ¥{ÿ‘•<ÿy{ÿknÿbeÿ^_ÿZ\ÿ\cÿ ¨ˆîïõéíóæÿÿÿÿÿÿÿÿÿÿÿÿî÷óîøõïÙÍ­úšjÿüˆQÿþ‡TÿþTÿý“_ÿø£fÿý¯vÿÿäÿ´£›ÿ¬ª¬ÀââååêëèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïééçíëè«Ì—›„ÿ «Vÿ…ˆÿwxÿfmÿaaÿ_^ÿX^ÿnx;ÿÎÓÅ~îôïéðéÿÿÿÿÿÿÿÿÿÿÿÿëÿÿéÿÿññï1÷¶—ôüŠYÿþ‡RÿüŠUÿþ\ÿü›dÿý«pÿü¸‡ÿüÊ®ÿ²–ÿ Ÿ ×ÚááKîïðææêâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞñõíòõïÝÜãJž ŸØ•›€ÿª´fÿ•&ÿ ÿorÿahÿ`]ÿ^]ÿ[fÿ˜£~ðãæÝàãÚàãÙÿÿÿÿÿÿÿÿÿÿÿÿëýþêýþôöïðÝÏ÷žvÿþ‰RÿþˆSÿþŒVÿý“`ÿÿ¢kÿü°xÿþ¿Žÿüѱÿ´¦šÿŠŠˆÿº»¼¤ååé(çéíêîñåêêãçèîïîîîìèéêßàáãáæäçäéîç7¼¿À·Š‰‹ü¡ƒÿ²»eÿ•Ÿ,ÿ‡ÿyzÿhlÿ`aÿ^^ÿY^ÿuGÿÕÛÏxíñîèíèèíèÿÿÿÿÿÿÿÿÿÿÿÿôöíôöíõõëööí õʯÑû‘`ÿþVÿûŠTÿû[ÿÿ™bÿÿ©mÿþ¸{ÿþÄÿÿÒ³ÿÝÀ®ÿ›‘†ÿŒŒ‹ò´³·µÕÙÛmàåå9æëìòóòóóðììîÝÞà*ÔÓÖ_±´²±ˆŠùŠˆƒÿ²´€ÿ¸¼Wÿ›¡,ÿ‘!ÿ€ÿppÿbfÿ^aÿY`ÿ`j)ÿ·¾žÏøýó ôùñóøñóøñÿÿÿÿÿÿÿÿÿÿÿÿø÷íø÷íø÷íùùîûóâ-òµ—îý‘_ÿý’bÿúŒZÿý‘Wÿþœdÿü¬uÿþ»ÿÿÅÿÿÒ£ÿüÙºÿй«ÿ¢‘‰ÿ‰ƒ|ÿŒŒ‰ÿ—––ñ›š™î™ššî”–—ð‰Šù…zÿÿ¬¯ƒÿ¿Çfÿ®¶9ÿ¢#ÿ”"ÿ‚„"ÿtsÿefÿcdÿcdÿ[cÿ˜Ÿzñïñå0øüîõúêõúêõúêÿÿÿÿÿÿÿÿÿÿÿÿüøëüøëüøëýøëþúíûìÞOõªŠóû—fÿÿšoÿý”aÿø“[ÿü›gÿþ¬tÿü½€ÿýȉÿýÍšÿÿÖ®ÿÿÛ»ÿïÒ¸ÿÛŲÿð§ÿ¶«©ÿ­© ÿ§ªŒÿ³¸ƒÿºÂzÿ¾Æfÿ³»@ÿ¦«)ÿœž)ÿ‘”$ÿ€†ÿqvÿfjÿjl&ÿrr.ÿ\fÿˆ‘büãæÙVùùòõõíõõíõõíõõíÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿúòúæÝVô«‹öýœpÿ÷©zÿù uÿþ˜jÿøœgÿû§oÿþµzÿýÂ…ÿþËŽÿþИÿÿÔ ÿÿØ©ÿÿáÅÿüçÝÿìä½ÿÍÒoÿ¶¾=ÿ¯´,ÿ©¬&ÿ¢¥$ÿ˜$ÿ‰Ž!ÿ{~ÿnrÿpq'ÿ‚>ÿ‚…Cÿai%ÿ\þÞåÓgøüñöúí÷úî÷úî÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìÿóñúäÜNð´Œöú¢{ÿü±‘ÿú³ÿû°…ÿø¬|ÿ÷ªvÿù®wÿû¶}ÿûÀ„ÿýɇÿþÍŽÿÿÓ©ÿöÚÌÿàÕ¨ÿÀÀLÿ¥ª ÿ›$ÿ“—!ÿ‰ÿ€… ÿ}€,ÿ‚†<ÿ’Oÿžœeÿ‘ŽUÿfl.ÿšiúÜáÐ^ôùéúÿðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþ÷ðûîß?ø¼¤Õø«†ÿû¾˜ÿûäÿýĤÿþÅ¢ÿüÄžÿüÀ˜ÿü¾“ÿúÀŽÿúÀŽÿùÄ£ÿîйÿÓÊ™ÿ±¯Vÿž9ÿ›ž<ÿŸKÿ¡¢\ÿ¨¨oÿ­¬}ÿ°°„ÿ¬¯†ÿ•Vÿox7ÿ¢¦„áèñÝBëðâîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿùëþõåöмœñµ—ÿú¿ ÿýÍ´ÿüÑ»ÿüÒ¼ÿûÖ¾ÿùÙÁÿùÚÁÿúÚ¿ÿøÞÇÿöâÖÿèÞÈÿÑÒªÿÇÊ¡ÿÊÈ¢ÿËÉ¡ÿÇÆ¢ÿÆæÿÄâÿ³¶Šÿ‡\ÿ}†Yÿ¾È©«ðôåï÷äçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿôäÿòæýíÙKõεÃó¾¦ÿúÉ´ÿúÙÆÿùáÏÿüâÑÿýáÒÿýßÑÿþäÖÿúçàÿêä×ÿÙÝÅÿÒ×¾ÿÖ×ÀÿÚ×ÀÿÕÔ·ÿ½Â›ÿ˜ sÿŠ”eÿ®µ”±ßãÑHêòßïóäìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿúêÿ÷åûæÖ=õÔ¿—óË·æö̼ÿúÖÉÿüßÒÿùçÚÿöìßÿøñåÿóíâÿåäÕÿÕÙÄÿÆ˲ÿ´º›ÿ ¨„ÿž©…ê¼Å©ŸßçÔAßáÛèëÞäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿøçÿóàþòáÿñÞÿóäúáÍJõâΘñÖðòμÂøμÍíØÂÐÏÑ·Þ¸½¡ß­·˜Ö¸Ã£»Ã̵‹ÓÝÈQìôáîõåêòâÙÜÓæéÛäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿþÿÿøÿÿàÿÿÀÿÿ€ÿÿÿþü?øøðð?þðÿÿàÿÿ€àÿÿÀÀÿÿàÀÿÿàÀÿÿðÀÿÿðÀÿÿðÀÿÿðÀÿÿøÀÿÿøÀÿÿøÀÿÿðÀÿÿðÀÿÿðÀÿÿààÿÿààÿÿÀàÿÿ€ðÿÿðþøøøü?þÿÿÿ€ÿÿÀÿÿàÿÿøÿÿüÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèìèèêîíôíìåÝÝ$¿»»~¡¦¥À‹ª¤ô~®§ÿ”±¬ÿ¬®§ÿ¬©ÿ¨§Ÿù¤¥¤Çº»¼…×ÙÙ-àâáåçêèèíçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèðììééè¾»¹ŽŒ¨£ð`±¥ÿKÏ»ÿCâÎÿ=èÒÿ•îßÿéäÆÿä×ÿÞÓ~ÿ˃ÿ±©‡ÿ¦£›ö±±´•ÝÞä(ííòçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóññíîÞÔÖK“¤¡äc¿±ÿ@ßÉÿ,çÏÿ$àÈÿÙÀÿ×¹ÿsÝÅÿÒÐ¥ÿØ¿UÿØÁQÿÞËYÿäÓfÿÞÎyÿÁ·ÿ¥£ìÉÊÔdìëííòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿç÷ôç÷ôçøõîø÷ÎÉÊg®¨÷HÖÂÿ+äÉÿÚ»ÿЭÿ É¢ÿ-É¢ÿJÏ«ÿ’ÜÄÿÕÓ³ÿÒºxÿǬ]ÿÄ©OÿË°OÿÕ¾SÿßÍbÿÕÇÿ¬§–ÿÆÆÉwð÷ôêöóêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿëóñëóññ÷ö×ÖÖez²©ÿ>ÜÄÿ Û¼ÿΩÿ˜ÿ!»ÿ.½ÿ6½ÿ8¿ÿoË¢ÿ¸¼‘ÿ¼aÿ¾œ_ÿ¾œ[ÿ¹™Kÿ¼EÿÉ®LÿÖÀUÿÜÈuÿ´¬–ÿÆÌÌ}ó÷óîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòííöñðçÝÝ5‰³«ò;Ù¾ÿÕ²ÿÆœÿºˆÿ´xÿ±zÿ<½“ÿnұɖâË¥ÆìàdÕÛÁWÝΰÊ·Žº¸œfó­ˆBÿ±ˆ=ÿ´@ÿÁ GÿζKÿÖÃpÿµ­üÜÜÜCóöððñìÿÿÿÿÿÿÿÿÿÿÿÿïìíóìíª¾¹ÂCÒ·ÿÒ­ÿÁ–ÿ¶ÿ¯sÿ"´ÿ}׺ÅÍøíUÞýøÛþöóúþâæÕöïáöõåôðá/Ï›«°ŽPÿ§0ÿ¯ˆ:ÿ»šCÿʱIÿ̼tÿº¹²×ìîëïòíÿÿÿÿÿÿÿÿÿÿÿÿêííØÖ×Udñÿ!ѬÿÀ“ÿ³ÿ­qÿ6¸ŒÿºëÝ‹ëÿÿÝÿöÔùñÒûðíøúàäÒóëÚòïÝ÷óâùõâèäÑW²–\ø¥|0ÿ«‡8ÿ»™Bÿ˯LÿÀ±‰ÿÑÏÔqïîïÿÿÿÿÿÿÿÿÿÿÿÿíèéªÅ¿Ç7Ì«ÿ–ÿµÿ®sÿ!³ÿ®æÕ÷ÿÿäÿûØýóÔùñÒûðíøúàäÒóëÚòïÝöñàôïÙþýôçàÎa®Pü¨{2ÿ­ˆ9ÿ¼š@ÿȱcÿþ­Øçæé ÿÿÿÿÿÿÿÿÿÿÿÿååå0tðÿÆšÿ¸„ÿ®vÿ¯rÿ†Ó»Éñûøëüùáýø×ýóÔùñÒûðíøúàäÒóëÚòïÜ÷òàõòáøõìûùõÖË©¦¦6ÿ¨~5ÿ±‹<ÿÁ DÿÀ¯ƒÿÚÜáRÿÿÿÿÿÿÿÿÿÿÿÿ×ÝÜfIƧÿ»‹ÿ²{ÿ¬qÿ3¸‰ÿØñîMòýýìüüìýýêÿýÖúóÑûðíøúàäÒóëÚóïÛöñæòðæòïçôòêëéâ0±˜aý¦|/ÿ«ƒ8ÿµ‘<ÿÁ¨gÿÒÒÐÿÿÿÿÿÿÿÿÿÿÿÿ¹ÒË¡(À–ÿµÿ¯uÿ «qÿhȧèðõóíöóìöóìöóïöóÛöîÒüòíøúàäÒôìÜïïâîïíîïëîïëîïëðòñŸ—Õ§|1ÿ«~5ÿ°‡6ÿ¸šJÿÍȹÁÿÿÿÿÿÿÿÿÿÿÿÿ¦ÎÂÈ ¼Œÿ³{ÿ°vÿ°yÿ—Ï¿­ïéëäææäææäææäææäææâðîëùùßåÒíëãêîïéíîéíîéíîéíîìñõÓÍ»ª…<ÿ¨5ÿ­…8ÿ´‘DÿǼ¦Ùÿÿÿÿÿÿÿÿÿÿÿÿ²ÍÃËdØÿa½ÿ]»Žÿ`À”ÿ·ÒÉ—ßÚÞÙÙÛÙÙÛÙÙÛÙÙÛÙØÛÙØÚåëìèìèèçèèççèèçèèçèèçèèçëëìÙÔʈ¶ždÿ´•Yÿ·˜\ÿ¹ bÿŽ¨çÿÿÿÿÿÿÿÿÿÿÿÿÜÊÁÈâ¬ÿá¦}ÿà¦|ÿ૆ÿ×Ì­åêëåèçåèçåèçåèçåèçâåäéëëîíìéæéìèëëçêëèêëèêëçêïëðÍÍÅ“Tÿ‰„FÿŠ†IÿŠŠKÿµº¡Ôÿÿÿÿÿÿÿÿÿÿÿÿæ϶ÿŽ[ÿÿˆTÿÿŠUÿÿ‘^ÿÛº©êçúúíúùìúøìúøíúùîúùäëëêììííìâãåéçëëéîëéíëéíëéíïíô´·¨Êfl$ÿ]_ÿ]_ÿ\dÿ¯¶»ÿÿÿÿÿÿÿÿÿÿÿÿëÞÖwú‘bÿý…Pÿý‰Tÿÿ’ZÿÛªÿÜæë7íñ÷êïôëïõèíñåéìâççêììííìàáãáááëìèìíëëìëíîìççê$š€ùfiÿ\_ÿ[]ÿ_dÿÁƲŒÿÿÿÿÿÿÿÿÿÿÿÿòëå5÷ yÿþ…MÿýŠTÿÿ“[ÿð§ÿÇÇÇ©ñøýñõúîòöæåéäæéâççêììííìáâäÞßßéîæíððìîòñôøÇÌÍ’‰Sÿijÿ^aÿZ\ÿmt8ÿÜÞÔ[ÿÿÿÿÿÿÿÿÿÿÿÿíòñÙý†Nÿþ‰Sÿý”Yÿÿ§uÿȬšÿØØÛIñïóæéêåäèäçêâççêììííìáâäÞßßêïæêëëññòâäç5Ÿ¦÷€…+ÿhjÿ^`ÿTXÿ‘™míðöëÿÿÿÿÿÿÿÿÿÿÿÿîõñîßÔqû’`ÿÿ†PÿþYÿü£gÿù¹ÿ¹«¦åÑÓ×8ëîïååèäçêâççêììííìáâäÞßßêïæððñàÞä+§© ß–Mÿz|ÿeiÿ]]ÿ\dÿÂɲƒïôîÿÿÿÿÿÿÿÿÿÿÿÿéÿÿíûû÷²“àþ…Oÿþ‹Vÿý™bÿÿ²{ÿﾟÿ­¤ŸóÃÈÊkæçë êíñäêêëííîîíãäæäååîóëÏÏÖ^¡£›ç ª^ÿŠ#ÿpsÿ`bÿXYÿŠ”dìäèâ!äçáÿÿÿÿÿÿÿÿÿÿÿÿòùóôúòôç×PùœoÿþˆQÿüŽZÿÿ¢hÿÿ½ƒÿöÉ¥ÿÀ¬ÿ¨¥¤Î»½¿Ð××Pâåå0æææ.Ö×Û@¼½Âx¤¦¨È ¢ÿ«¯Tÿ–š&ÿ|}ÿegÿZ\ÿfo.ÿØßËeøý÷ò÷ïÿÿÿÿÿÿÿÿÿÿÿÿû÷ëû÷ìüýñø׆ú•gÿý‘`ÿü”[ÿü¦nÿÿ¿„ÿÿÔ¡ÿèƪÿ¼§—ÿ²¨Ÿÿ¯¨§ÿ§§¢ÿŸ¤ÿ™Ÿuÿª¯aÿ±·=ÿ—œ ÿ}ÿjlÿfgÿ_g!ÿµ»ž«ûýóöøìõøëÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþùëÿûòøͼ•ùŸsÿù¢uÿüžoÿú¥mÿý·yÿÿÈŒÿÿןÿÿÙ«ÿúÞÐÿÞÙ§ÿºÀGÿ¯´/ÿ ¥ÿ‹ÿy}ÿwy,ÿ<ÿgo,ÿ­¸”³ûüô øüï÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþ÷íÿõòøÖ¿†ú®Œþû·“ÿüº•ÿûºÿûº‹ÿûÀ‰ÿüÆÿùÒºÿÒÊŽÿ¤¦1ÿ—š0ÿ•˜?ÿššXÿŸ¡kÿ–š`ÿ€ƒJÿµ½ž¡ðõè úÿðøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿóîÿùíûåÕGõèÛûǬÿüлÿúØÂÿúÙÂÿûÛÃÿùáÓÿãÜÄÿÉ̦ÿËɦÿËɨÿ¾¾œÿ£©|ÿ’špåÑØÀeò÷éíòãøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿôæÿôâúÞËcöѽ¿ùØÇóúÛÍÿøßÒÿøéÝÿèäÖÿÎÓ¾ÿÇʱÿ¼À¡û­¶“ÈÃ̱yãç×ðõäêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿñâÿõäþïßÿñßýìÛ$÷èÖj÷ÓÃ…ôÓÁ‘Ë̵ŸºÁ¦œÌÕ¼pÙãÏ.íõãêðáãæ×ëñÞêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿþü?øðàààøÀ?üÀ?þÀþÀþÀÿÿÀÿÿÀÿÿÀþÀþÀþÀ?üàøààðøüþ?ÿÿÿ€ÿÿðÿÿÿÿÿÿÿÿÿ(0 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèòñëééïðïïäãËÄÅ^¨º·«ˆ¹±Ô“ºµä¶·¬æ·´¢×¹¸²±ÄÅÈhÖØÚêëïçæêìñïêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèóòòííÖÒÒT“·±ÕUÀ±ÿ;ÛÆÿ%àÉÿiæÓÿßÙ§ÿßËdÿØÊsÿÁ·ÿ³¯ŸÝËÌÒaèèííòðêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿçöôèøöîõôÂÄÄ‚a¿³ÿ,ÞÄÿݽÿѬÿ(̧ÿlÖ¹ÿÍÈ™ÿÍ°ZÿͳPÿØÀUÿÝËfÿ¿µ†ÿ¿¾¿•ìóòë÷óêõòÿÿÿÿÿÿÿÿÿÿÿÿîòñôôôÉÍÌVǵÿ"Ú»ÿÉ ÿºŠÿ%¸…ÿ9À‘ÿqЬóÀ¿•í¿ždÿ·“Pÿ·”DÿÂ¥EÿÕ¾Vÿȹ}ÿÄÅÚñõòïòíÿÿÿÿÿÿÿÿÿÿÿÿöðñâÜÜ. !define product "Synergy" !define productOld "Synergy+" !define packageName "synergy" !define packageNameOld "synergy-plus" !define platform "Windows" !define publisher "The Synergy Project" !define publisherOld "The Synergy+ Project" !define helpUrl "http://synergy-foss.org/support" !define vcRedistFile "vcredist_${arch}.exe" !define startMenuApp "synergy.exe" !define binDir "..\bin" !define uninstall "uninstall.exe" !define icon "..\res\synergy.ico" !define controlPanelReg "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall" !addplugindir "..\res" !define MUI_ICON ${icon} !define MUI_UNICON ${icon} !include "MUI2.nsh" !include "DefineIfExist.nsh" ${!defineifexist} gameDeviceSupport "${binDir}\Release\synxinhk.dll" !insertmacro MUI_PAGE_LICENSE "..\\res\\License.rtf" !insertmacro MUI_PAGE_DIRECTORY !insertmacro MUI_PAGE_INSTFILES !insertmacro MUI_UNPAGE_WELCOME !insertmacro MUI_UNPAGE_INSTFILES !insertmacro MUI_LANGUAGE "English" Name ${product} OutFile "..\bin\${packageName}-${version}-${platform}-${arch}.exe" InstallDir "${installDirVar}\${product}" InstallDirRegKey HKEY_LOCAL_MACHINE "SOFTWARE\${product}" "" ; delete files we installed, and then dir if it's empty !macro DeleteFiles dir Delete "${dir}\synergy.exe" Delete "${dir}\synergyc.exe" Delete "${dir}\synergys.exe" Delete "${dir}\synergyd.exe" Delete "${dir}\synergyd.log" Delete "${dir}\launcher.exe" Delete "${dir}\synrgyhk.dll" Delete "${dir}\libgcc_s_dw2-1.dll" Delete "${dir}\mingwm10.dll" Delete "${dir}\QtCore4.dll" Delete "${dir}\QtGui4.dll" Delete "${dir}\QtNetwork4.dll" Delete "${dir}\Uninstall.exe" Delete "${dir}\uninstall.exe" Delete "${dir}\synxinhk.dll" Delete "${dir}\sxinpx13.dll" RMDir "${dir}" !macroend Function .onInit IfFileExists $WINDIR\SYSWOW64\*.* end is32bit is32bit: ${If} ${arch} == "x64" MessageBox MB_OK "It is not possible to use the 64-bit Synergy installer \ on a 32-bit system. Please download the 32-bit Synergy installer." Abort ${EndIf} end: FunctionEnd Section SetShellVarContext all SetOutPath "$INSTDIR" ; stops and removes all services (including legacy) ExecWait "$INSTDIR\synergyd.exe /uninstall" ; give the daemon a chance to close cleanly. Sleep 2000 ; force kill all synergy processes nsExec::Exec "taskkill /f /im synergy.exe" nsExec::Exec "taskkill /f /im qsynergy.exe" nsExec::Exec "taskkill /f /im launcher.exe" nsExec::Exec "taskkill /f /im synergys.exe" nsExec::Exec "taskkill /f /im synergyc.exe" nsExec::Exec "taskkill /f /im synergyd.exe" ; clean up legacy files that may exist (but leave user files) !insertmacro DeleteFiles "$PROGRAMFILES32\${product}\bin" !insertmacro DeleteFiles "$PROGRAMFILES64\${product}\bin" !insertmacro DeleteFiles "$PROGRAMFILES32\${productOld}\bin" !insertmacro DeleteFiles "$PROGRAMFILES64\${productOld}\bin" !insertmacro DeleteFiles "$PROGRAMFILES32\${product}" !insertmacro DeleteFiles "$PROGRAMFILES64\${product}" !insertmacro DeleteFiles "$PROGRAMFILES32\${productOld}" !insertmacro DeleteFiles "$PROGRAMFILES64\${productOld}" ; clean up legacy start menu entries RMDir /R "$SMPROGRAMS\${product}" RMDir /R "$SMPROGRAMS\${productOld}" ; always delete any existing uninstall info DeleteRegKey HKLM "${controlPanelReg}\${product}" DeleteRegKey HKLM "${controlPanelReg}\${productOld}" DeleteRegKey HKLM "${controlPanelReg}\${publisher}" DeleteRegKey HKLM "${controlPanelReg}\${publisherOld}" DeleteRegKey HKLM "${controlPanelReg}\${packageNameOld}" DeleteRegKey HKLM "SOFTWARE\${product}" DeleteRegKey HKLM "SOFTWARE\${productOld}" DeleteRegKey HKLM "SOFTWARE\${publisher}" DeleteRegKey HKLM "SOFTWARE\${publisherOld}" ; create uninstaller (used for control panel icon) WriteUninstaller "$INSTDIR\${uninstall}" ; add new uninstall info WriteRegStr HKLM "${controlPanelReg}\${product}" "" $INSTDIR WriteRegStr HKLM "${controlPanelReg}\${product}" "DisplayName" "${product}" WriteRegStr HKLM "${controlPanelReg}\${product}" "DisplayVersion" "${version}" WriteRegStr HKLM "${controlPanelReg}\${product}" "DisplayIcon" "$INSTDIR\uninstall.exe" WriteRegStr HKLM "${controlPanelReg}\${product}" "Publisher" "${publisher}" WriteRegStr HKLM "${controlPanelReg}\${product}" "UninstallString" "$INSTDIR\uninstall.exe" WriteRegStr HKLM "${controlPanelReg}\${product}" "URLInfoAbout" "${helpUrl}" SectionEnd Section "Visual C++ Redistributable" vcredist ; this must run first, as some sections run ; binaries that require a vcredist to be installed. ; copy redist file, run it, then delete when done File "${vcRedistDir}\${vcRedistFile}" ExecWait "$INSTDIR\${vcRedistFile} /install /q /norestart" Delete $INSTDIR\${vcRedistFile} SectionEnd Section "Server and Client" core ; client and server files File "${binDir}\Release\synergys.exe" File "${binDir}\Release\synergyc.exe" File "${binDir}\Release\synergyd.exe" ; if the hook file exists, skip, assuming it couldn't be deleted ; because it was in use by some process. ${If} ${FileExists} "synrgyhk.dll" DetailPrint "Skipping synrgyhk.dll, file already exists." ${Else} File "${binDir}\Release\synrgyhk.dll" ${EndIf} ; windows firewall exception DetailPrint "Adding firewall exception" nsExec::ExecToStack "netsh firewall add allowedprogram $\"$INSTDIR\synergys.exe$\" Synergy ENABLE" ; install and run the service ExecWait "$INSTDIR\synergyd.exe /install" SectionEnd !ifdef gameDeviceSupport Section "Game Device Support" gamedev ; files for xinput support File "${binDir}\Release\synxinhk.dll" File "${binDir}\Release\sxinpx13.dll" SectionEnd !endif Section "Graphical User Interface" gui ; gui and qt libs File "${binDir}\Release\synergy.exe" File "${qtDir}\qt\bin\libgcc_s_dw2-1.dll" File "${qtDir}\qt\bin\mingwm10.dll" File "${qtDir}\qt\bin\QtGui4.dll" File "${qtDir}\qt\bin\QtCore4.dll" File "${qtDir}\qt\bin\QtNetwork4.dll" ; gui start menu shortcut SetShellVarContext all CreateShortCut "$SMPROGRAMS\${product}.lnk" "$INSTDIR\${startMenuApp}" SectionEnd Section Uninstall SetShellVarContext all ; stop and uninstall the service ExecWait "$INSTDIR\synergyd.exe /uninstall" ; give the daemon a chance to close cleanly. Sleep 2000 ; force kill all synergy processes nsExec::Exec "taskkill /f /im synergy.exe" nsExec::Exec "taskkill /f /im qsynergy.exe" nsExec::Exec "taskkill /f /im launcher.exe" nsExec::Exec "taskkill /f /im synergys.exe" nsExec::Exec "taskkill /f /im synergyc.exe" nsExec::Exec "taskkill /f /im synergyd.exe" ; delete start menu shortcut Delete "$SMPROGRAMS\${product}.lnk" ; delete all registry keys DeleteRegKey HKLM "SOFTWARE\${product}" DeleteRegKey HKLM "${controlPanelReg}\${product}" ; note: edit macro to delete more files. !insertmacro DeleteFiles $INSTDIR Delete "$INSTDIR\${uninstall}" ; delete (only if empty, so we don't delete user files) RMDir "$INSTDIR" SectionEnd Function .onInstSuccess ; relies on !addplugindir ShellExecAsUser::ShellExecAsUser "" "$INSTDIR\synergy.exe" SW_SHOWNORMAL FunctionEnd synergy-1.4.12-Source/src/0000700000175000017500000000000012140644175015300 5ustar synergysynergysynergy-1.4.12-Source/src/CMakeLists.txt0000600000175000017500000000156612021262215020037 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2011 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . add_subdirectory(lib) add_subdirectory(cmd) if (NOT ${CMAKE_SYSTEM_NAME} MATCHES "IRIX") add_subdirectory(test) endif() add_subdirectory(plugin) add_subdirectory(micro) synergy-1.4.12-Source/src/cmd/0000700000175000017500000000000012140644175016043 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/CMakeLists.txt0000600000175000017500000000154112120644363020603 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2011 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . add_subdirectory(synergyc) add_subdirectory(synergys) add_subdirectory(synergyd) add_subdirectory(usynergy) if (WIN32) add_subdirectory(synergyp) endif() synergy-1.4.12-Source/src/cmd/synergyc/0000700000175000017500000000000012140644175017706 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/synergyc/.gitignore0000600000175000017500000000000711376315317021700 0ustar synergysynergy/*.aps synergy-1.4.12-Source/src/cmd/synergyc/CMakeLists.txt0000600000175000017500000000313612127576354022463 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src synergyc.cpp ) if (WIN32) list(APPEND src CMSWindowsClientTaskBarReceiver.cpp CMSWindowsClientTaskBarReceiver.h resource.h synergyc.ico synergyc.rc tb_error.ico tb_idle.ico tb_run.ico tb_wait.ico ) elseif (APPLE) list(APPEND src COSXClientTaskBarReceiver.cpp) elseif (UNIX) list(APPEND src CXWindowsClientTaskBarReceiver.cpp) endif() set(inc ../../lib/arch ../../lib/base ../../lib/client ../../lib/common ../../lib/io ../../lib/ipc ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() if (VNC_SUPPORT) list(APPEND libs vnc_server vnc_client) endif() include_directories(${inc}) add_executable(synergyc ${src}) target_link_libraries(synergyc arch base client common io mt net ipc platform server synergy cryptopp ${libs}) if (CONF_CPACK) install(TARGETS synergyc COMPONENT core DESTINATION bin) endif() synergy-1.4.12-Source/src/cmd/synergyc/CMSWindowsClientTaskBarReceiver.cpp0000600000175000017500000002112112021261364026473 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClientTaskBarReceiver.h" #include "CClient.h" #include "CMSWindowsClipboard.h" #include "LogOutputters.h" #include "BasicTypes.h" #include "CArch.h" #include "CArchTaskBarWindows.h" #include "CArchMiscWindows.h" #include "resource.h" #include "CMSWindowsScreen.h" // // CMSWindowsClientTaskBarReceiver // const UINT CMSWindowsClientTaskBarReceiver::s_stateToIconID[kMaxState] = { IDI_TASKBAR_NOT_RUNNING, IDI_TASKBAR_NOT_WORKING, IDI_TASKBAR_NOT_CONNECTED, IDI_TASKBAR_NOT_CONNECTED, IDI_TASKBAR_CONNECTED }; CMSWindowsClientTaskBarReceiver::CMSWindowsClientTaskBarReceiver( HINSTANCE appInstance, const CBufferedLogOutputter* logBuffer) : CClientTaskBarReceiver(), m_appInstance(appInstance), m_window(NULL), m_logBuffer(logBuffer) { for (UInt32 i = 0; i < kMaxState; ++i) { m_icon[i] = loadIcon(s_stateToIconID[i]); } m_menu = LoadMenu(m_appInstance, MAKEINTRESOURCE(IDR_TASKBAR)); // don't create the window yet. we'll create it on demand. this // has the side benefit of being created in the thread used for // the task bar. that's good because it means the existence of // the window won't prevent changing the main thread's desktop. // add ourself to the task bar ARCH->addReceiver(this); } CMSWindowsClientTaskBarReceiver::~CMSWindowsClientTaskBarReceiver() { cleanup(); } void CMSWindowsClientTaskBarReceiver::cleanup() { ARCH->removeReceiver(this); for (UInt32 i = 0; i < kMaxState; ++i) { deleteIcon(m_icon[i]); } DestroyMenu(m_menu); destroyWindow(); } void CMSWindowsClientTaskBarReceiver::showStatus() { // create the window createWindow(); // lock self while getting status lock(); // get the current status std::string status = getToolTip(); // done getting status unlock(); // update dialog HWND child = GetDlgItem(m_window, IDC_TASKBAR_STATUS_STATUS); SendMessage(child, WM_SETTEXT, 0, (LPARAM)status.c_str()); if (!IsWindowVisible(m_window)) { // position it by the mouse POINT cursorPos; GetCursorPos(&cursorPos); RECT windowRect; GetWindowRect(m_window, &windowRect); int x = cursorPos.x; int y = cursorPos.y; int fw = GetSystemMetrics(SM_CXDLGFRAME); int fh = GetSystemMetrics(SM_CYDLGFRAME); int ww = windowRect.right - windowRect.left; int wh = windowRect.bottom - windowRect.top; int sw = GetSystemMetrics(SM_CXFULLSCREEN); int sh = GetSystemMetrics(SM_CYFULLSCREEN); if (fw < 1) { fw = 1; } if (fh < 1) { fh = 1; } if (x + ww - fw > sw) { x -= ww - fw; } else { x -= fw; } if (x < 0) { x = 0; } if (y + wh - fh > sh) { y -= wh - fh; } else { y -= fh; } if (y < 0) { y = 0; } SetWindowPos(m_window, HWND_TOPMOST, x, y, ww, wh, SWP_SHOWWINDOW); } } void CMSWindowsClientTaskBarReceiver::runMenu(int x, int y) { // do popup menu. we need a window to pass to TrackPopupMenu(). // the SetForegroundWindow() and SendMessage() calls around // TrackPopupMenu() are to get the menu to be dismissed when // another window gets activated and are just one of those // win32 weirdnesses. createWindow(); SetForegroundWindow(m_window); HMENU menu = GetSubMenu(m_menu, 0); SetMenuDefaultItem(menu, IDC_TASKBAR_STATUS, FALSE); HMENU logLevelMenu = GetSubMenu(menu, 3); CheckMenuRadioItem(logLevelMenu, 0, 6, CLOG->getFilter() - kERROR, MF_BYPOSITION); int n = TrackPopupMenu(menu, TPM_NONOTIFY | TPM_RETURNCMD | TPM_LEFTBUTTON | TPM_RIGHTBUTTON, x, y, 0, m_window, NULL); SendMessage(m_window, WM_NULL, 0, 0); // perform the requested operation switch (n) { case IDC_TASKBAR_STATUS: showStatus(); break; case IDC_TASKBAR_LOG: copyLog(); break; case IDC_TASKBAR_SHOW_LOG: ARCH->showConsole(true); break; case IDC_TASKBAR_LOG_LEVEL_ERROR: CLOG->setFilter(kERROR); break; case IDC_TASKBAR_LOG_LEVEL_WARNING: CLOG->setFilter(kWARNING); break; case IDC_TASKBAR_LOG_LEVEL_NOTE: CLOG->setFilter(kNOTE); break; case IDC_TASKBAR_LOG_LEVEL_INFO: CLOG->setFilter(kINFO); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG: CLOG->setFilter(kDEBUG); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG1: CLOG->setFilter(kDEBUG1); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG2: CLOG->setFilter(kDEBUG2); break; case IDC_TASKBAR_QUIT: quit(); break; } } void CMSWindowsClientTaskBarReceiver::primaryAction() { showStatus(); } const IArchTaskBarReceiver::Icon CMSWindowsClientTaskBarReceiver::getIcon() const { return reinterpret_cast(m_icon[getStatus()]); } void CMSWindowsClientTaskBarReceiver::copyLog() const { if (m_logBuffer != NULL) { // collect log buffer CString data; for (CBufferedLogOutputter::const_iterator index = m_logBuffer->begin(); index != m_logBuffer->end(); ++index) { data += *index; data += "\n"; } // copy log to clipboard if (!data.empty()) { CMSWindowsClipboard clipboard(m_window); clipboard.open(0); clipboard.emptyUnowned(); clipboard.add(IClipboard::kText, data); clipboard.close(); } } } void CMSWindowsClientTaskBarReceiver::onStatusChanged() { if (IsWindowVisible(m_window)) { showStatus(); } } HICON CMSWindowsClientTaskBarReceiver::loadIcon(UINT id) { HANDLE icon = LoadImage(m_appInstance, MAKEINTRESOURCE(id), IMAGE_ICON, 0, 0, LR_DEFAULTCOLOR); return reinterpret_cast(icon); } void CMSWindowsClientTaskBarReceiver::deleteIcon(HICON icon) { if (icon != NULL) { DestroyIcon(icon); } } void CMSWindowsClientTaskBarReceiver::createWindow() { // ignore if already created if (m_window != NULL) { return; } // get the status dialog m_window = CreateDialogParam(m_appInstance, MAKEINTRESOURCE(IDD_TASKBAR_STATUS), NULL, (DLGPROC)&CMSWindowsClientTaskBarReceiver::staticDlgProc, reinterpret_cast( reinterpret_cast(this))); // window should appear on top of everything, including (especially) // the task bar. LONG_PTR style = GetWindowLongPtr(m_window, GWL_EXSTYLE); style |= WS_EX_TOOLWINDOW | WS_EX_TOPMOST; SetWindowLongPtr(m_window, GWL_EXSTYLE, style); // tell the task bar about this dialog CArchTaskBarWindows::addDialog(m_window); } void CMSWindowsClientTaskBarReceiver::destroyWindow() { if (m_window != NULL) { CArchTaskBarWindows::removeDialog(m_window); DestroyWindow(m_window); m_window = NULL; } } BOOL CMSWindowsClientTaskBarReceiver::dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM) { switch (msg) { case WM_INITDIALOG: // use default focus return TRUE; case WM_ACTIVATE: // hide when another window is activated if (LOWORD(wParam) == WA_INACTIVE) { ShowWindow(hwnd, SW_HIDE); } break; } return FALSE; } BOOL CALLBACK CMSWindowsClientTaskBarReceiver::staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { // if msg is WM_INITDIALOG, extract the CMSWindowsClientTaskBarReceiver* // and put it in the extra window data then forward the call. CMSWindowsClientTaskBarReceiver* self = NULL; if (msg == WM_INITDIALOG) { self = reinterpret_cast( reinterpret_cast(lParam)); SetWindowLongPtr(hwnd, GWLP_USERDATA, (LONG_PTR) lParam); } else { // get the extra window data and forward the call LONG_PTR data = GetWindowLongPtr(hwnd, GWLP_USERDATA); if (data != 0) { self = (CMSWindowsClientTaskBarReceiver*) data; } } // forward the message if (self != NULL) { return self->dlgProc(hwnd, msg, wParam, lParam); } else { return (msg == WM_INITDIALOG) ? TRUE : FALSE; } } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { CArchMiscWindows::setIcons( (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 32, 32, LR_SHARED), (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 16, 16, LR_SHARED)); return new CMSWindowsClientTaskBarReceiver( CMSWindowsScreen::getWindowInstance(), logBuffer); } synergy-1.4.12-Source/src/cmd/synergyc/CMSWindowsClientTaskBarReceiver.h0000600000175000017500000000371012021261364026144 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIENTTASKBARRECEIVER_H #define CMSWINDOWSCLIENTTASKBARRECEIVER_H #define WIN32_LEAN_AND_MEAN #include "CClientTaskBarReceiver.h" #include class CBufferedLogOutputter; //! Implementation of CClientTaskBarReceiver for Microsoft Windows class CMSWindowsClientTaskBarReceiver : public CClientTaskBarReceiver { public: CMSWindowsClientTaskBarReceiver(HINSTANCE, const CBufferedLogOutputter*); virtual ~CMSWindowsClientTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; void cleanup(); protected: void copyLog() const; // CClientTaskBarReceiver overrides virtual void onStatusChanged(); private: HICON loadIcon(UINT); void deleteIcon(HICON); void createWindow(); void destroyWindow(); BOOL dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); static BOOL CALLBACK staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); private: HINSTANCE m_appInstance; HWND m_window; HMENU m_menu; HICON m_icon[kMaxState]; const CBufferedLogOutputter* m_logBuffer; static const UINT s_stateToIconID[]; }; #endif synergy-1.4.12-Source/src/cmd/synergyc/COSXClientTaskBarReceiver.cpp0000600000175000017500000000274412021261364025264 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClientTaskBarReceiver.h" #include "CArch.h" // // COSXClientTaskBarReceiver // COSXClientTaskBarReceiver::COSXClientTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } COSXClientTaskBarReceiver::~COSXClientTaskBarReceiver() { ARCH->removeReceiver(this); } void COSXClientTaskBarReceiver::showStatus() { // do nothing } void COSXClientTaskBarReceiver::runMenu(int, int) { // do nothing } void COSXClientTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon COSXClientTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new COSXClientTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergyc/COSXClientTaskBarReceiver.h0000600000175000017500000000240312021261364024721 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXCLIENTTASKBARRECEIVER_H #define COSXCLIENTTASKBARRECEIVER_H #include "CClientTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CClientTaskBarReceiver for OS X class COSXClientTaskBarReceiver : public CClientTaskBarReceiver { public: COSXClientTaskBarReceiver(const CBufferedLogOutputter*); virtual ~COSXClientTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; #endif synergy-1.4.12-Source/src/cmd/synergyc/CXWindowsClientTaskBarReceiver.cpp0000600000175000017500000000303212021261364026364 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClientTaskBarReceiver.h" #include "CArch.h" // // CXWindowsClientTaskBarReceiver // CXWindowsClientTaskBarReceiver::CXWindowsClientTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } CXWindowsClientTaskBarReceiver::~CXWindowsClientTaskBarReceiver() { ARCH->removeReceiver(this); } void CXWindowsClientTaskBarReceiver::showStatus() { // do nothing } void CXWindowsClientTaskBarReceiver::runMenu(int, int) { // do nothing } void CXWindowsClientTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon CXWindowsClientTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new CXWindowsClientTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergyc/CXWindowsClientTaskBarReceiver.h0000600000175000017500000000244112021261364026034 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIENTTASKBARRECEIVER_H #define CXWINDOWSCLIENTTASKBARRECEIVER_H #include "CClientTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CClientTaskBarReceiver for X Windows class CXWindowsClientTaskBarReceiver : public CClientTaskBarReceiver { public: CXWindowsClientTaskBarReceiver(const CBufferedLogOutputter*); virtual ~CXWindowsClientTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; #endif synergy-1.4.12-Source/src/cmd/synergyc/resource.h0000600000175000017500000000254611151752223021712 0ustar synergysynergy//{{NO_DEPENDENCIES}} // Microsoft Developer Studio generated include file. // Used by synergyc.rc // #define IDS_FAILED 1 #define IDS_INIT_FAILED 2 #define IDS_UNCAUGHT_EXCEPTION 3 #define IDI_SYNERGY 101 #define IDI_TASKBAR_NOT_RUNNING 102 #define IDI_TASKBAR_NOT_WORKING 103 #define IDI_TASKBAR_NOT_CONNECTED 104 #define IDI_TASKBAR_CONNECTED 105 #define IDR_TASKBAR 107 #define IDD_TASKBAR_STATUS 108 #define IDC_TASKBAR_STATUS_STATUS 1000 #define IDC_TASKBAR_QUIT 40001 #define IDC_TASKBAR_STATUS 40002 #define IDC_TASKBAR_LOG 40003 #define IDC_TASKBAR_SHOW_LOG 40004 #define IDC_TASKBAR_LOG_LEVEL_ERROR 40009 #define IDC_TASKBAR_LOG_LEVEL_WARNING 40010 #define IDC_TASKBAR_LOG_LEVEL_NOTE 40011 #define IDC_TASKBAR_LOG_LEVEL_INFO 40012 #define IDC_TASKBAR_LOG_LEVEL_DEBUG 40013 #define IDC_TASKBAR_LOG_LEVEL_DEBUG1 40014 #define IDC_TASKBAR_LOG_LEVEL_DEBUG2 40015 // Next default values for new objects // #ifdef APSTUDIO_INVOKED #ifndef APSTUDIO_READONLY_SYMBOLS #define _APS_NEXT_RESOURCE_VALUE 109 #define _APS_NEXT_COMMAND_VALUE 40016 #define _APS_NEXT_CONTROL_VALUE 1001 #define _APS_NEXT_SYMED_VALUE 101 #endif #endif synergy-1.4.12-Source/src/cmd/synergyc/synergyc.cpp0000600000175000017500000000251512120644363022257 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientApp.h" #include "CLog.h" #include "CArch.h" #include "CEventQueue.h" #if WINAPI_MSWINDOWS #include "CMSWindowsClientTaskBarReceiver.h" #elif WINAPI_XWINDOWS #include "CXWindowsClientTaskBarReceiver.h" #elif WINAPI_CARBON #include "COSXClientTaskBarReceiver.h" #else #error Platform not supported. #endif int main(int argc, char** argv) { #if SYSAPI_WIN32 // record window instance for tray icon, etc CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; CEventQueue events; CClientApp app(createTaskBarReceiver); return app.run(argc, argv); } synergy-1.4.12-Source/src/cmd/synergyc/synergyc.ico0000600000175000017500000106227611267632744022275 0ustar synergysynergy ( V00 ¨%~   ¨&F ˆ ÎV hV`( ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ñïï çêî2ëîòìïóëîòíïðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííííííííééé(ãááOãááOãááOßÝÝcÚØØyÖÔÔ€ÖÔÔ€ÖÔÔÿÍÐÔÿÍÐÔÿÎÑÕÿÐÓ×ÿÒÔÕƒÒÔÕƒÕÕÕ€×××~ßßßYâââEäæç;æèé2äçë;æéí2êíòîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëæææ2àààOÔÖÖ€ÊÐÏÿÃÎÌÿ¿ÊÈÿµÂÀÿ²¿½ÿ­º¸ÿ«³²ÿ¦®­ÿ¦«ªÿ¥ª©ÿ¤©¨ÿ¤§ÿš¡¤ÿ›££ÿ£§¨ÿ¥ª¨ÿ©ª¨ÿ¬­©ÿ±²®ÿ³²®ÿ¹¸´ÿ¿À¼ÿÄÅÁÿÅÈÆÿÌÏÍÿÕ××ÿÜÞÞcàáßYæçå;îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ çéé2ÞààYÕ××€ÕÐщÊÅÆʾ¾¾ÿ···ÿ©««ÿœ¢¡ÿ’›ÿŽ™—ÿ‰–”ÿ‚ÿz‡…ÿz‚ÿz‚ÿ|€ÿz~ÿv{zÿsz}ÿry|ÿrzzÿw{|ÿx}{ÿ}~|ÿ‚~ÿ„…ÿ‰ˆ„ÿŒˆÿ‘’Žÿ–—“ÿ™œšÿ £¡ÿ©««ÿ°²²ÿÀÁ¿ÿÈÉÇÿÑÒЉÙÚØyÝÞÜcãäâEìíëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêììãååEÕÚÙ€ÊÏÎÿ¿ÅÄÿ´º¹ÿ¶®¯ÿ¨ ¡ÿ—••ÿŠŒŒÿw‚€ÿjxvÿ_tqÿXqmÿId`ÿJeaÿNgcÿUjgÿZmjÿ_mkÿ]kiÿ]hfÿgroÿmtqÿkrmÿgkfÿejaÿlmdÿlnbÿmk`ÿhgYÿgfXÿgeZÿki^ÿsqgÿ}{qÿ†…{ÿŒ‹ÿ‘’Žÿœ™ÿ¬­©ÿº»·ÿÂÿÿÊËÇÿØÙ×~åæä;éêè(îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÜÜÜcÏÑÑÂÄÄÿ¯´³ÿŸ¤£ÿŽ”“ÿ‡†ÿ{stÿumnÿljjÿgiiÿ]hfÿZhfÿWliÿTmiÿb}yÿoŠ†ÿš–ÿŽ£ ÿ“¦£ÿ—¥£ÿ—¥£ÿœ§¥ÿ¦±®ÿ¯¶³ÿ¬³®ÿ¥©¤ÿ¡¦ÿ¨© ÿ¦¨œÿ¤¢—ÿœ›ÿ‘‚ÿtÿushÿomcÿlj`ÿih^ÿgf\ÿfgcÿklhÿvwsÿ„…ÿ‘ÿ›œ˜ÿ«¬ªÿº»¹ÿÊËÉÿÔÕÓƒãäâEîïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëßßßYÖÖÖ~ÂÂÂܳ³³ÿž£¢ÿ’‘ÿ{€ÿoutÿckjÿYa`ÿFjdÿEvnÿUˆ€ÿ\˜Žÿ]¡–ÿ`¬ ÿe·ªÿcº¬ÿjŶÿtÏÀÿ‚ÚÌÿ‹àÒÿ‘áÔÿ•áÕÿšäØÿ¥çÜÿÛâÝÿáæÝÿÝåÚÿÚÞÓÿØÛÌÿÛÚÌÿÚÚÈÿÙÕÃÿÖѼÿÍȳÿÁ»¨ÿ·±žÿ°ª—ÿª¤‘ÿ¡Šÿœ—ˆÿ‚„~ÿqsmÿ`b\ÿ]_Yÿcd`ÿnokÿ|}yÿ‰Š†ÿžŸ›ÿ«¬¨ÿ¾¿½ÿÏÐÎÝÞÜcèéç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÞÜÜcÍËË¥¶¶¶ÿ¨¨¨ÿ———ÿ………ÿotsÿchgÿagfÿkqpÿu}|ÿy€ÿq•ÿz«£ÿ”Ç¿ÿžÚÐÿœàÕÿšæÚÿ™ëÞÿ“êÜÿëÜÿèÙÿŒäÖÿâÔÿ“ãÖÿšæÚÿ êÞÿªìáÿÞåàÿáæÝÿÝåÚÿÝáÖÿÚÝÎÿÙØÊÿÖÖÄÿÙÕÃÿÝØÃÿÜ×ÂÿÜÖÃÿàÚÇÿãÝÊÿâÜÉÿÛ×ÄÿÖÑÂÿÂľÿ§©£ÿŒŽˆÿ€‚|ÿ{|xÿstpÿjkgÿefbÿmnjÿz{wÿŽÿ¡¢ ÿ³´²ÿÅÆÄÊ×ØÖ~âãáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòæä;êáÞYÊÁ¾ÿ¿··ÿ¯«ªÿŽÿy|zÿdolÿWniÿ@ibÿ5jaÿCˆ}ÿf¸«ÿÜÍÿ~è×ÿoîÕÿmìÓÿlèÐÿjåÑÿ^åÏÿVäÑÿMäÐÿIäÏÿIäÏÿDäÎÿBæÍÿCçÎÿPéÐÿlçÓÿ‰éØÿ¨êÞÿÈë×ÿØçÒÿÚæÒÿãåÏÿèáÈÿëÛ·ÿçÕ¦ÿæÔ™ÿáÓ‹ÿàÓ‡ÿáÖ†ÿã؈ÿåÕÿçÔ—ÿëÒ ÿîÕ£ÿèà¥ÿìä©ÿêß­ÿçÙ¯ÿãÔ³ÿÑĪÿ§™‡ÿzndÿrhaÿngdÿokjÿxywÿ‰ŒŠÿ˜Ÿœÿª´®ÿ»Å¿ÿÓÓÓƒãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíçÛÙyÌÀ¾ÿÄ»¸ÿµ¬©ÿ–ŽŽÿrnmÿ][ZÿUXVÿ\gdÿxŠÿ¹²ÿ™ÎÅÿ‘ÖËÿ‹ÝÐÿ„áÒÿxâÑÿhçÎÿfåÌÿfâÊÿdßËÿZáËÿRàÍÿIàÌÿFáÌÿFáÌÿAáËÿ?ãÊÿAåÌÿMæÍÿiäÐÿ†æÕÿ¥çÛÿÆéÕÿ×æÑÿØäÐÿàâÌÿäÝÄÿåÕ±ÿáÏ ÿàΓÿÜΆÿÛ΂ÿÛЀÿÜÑÿÞΉÿÞËŽÿâÉ—ÿåÌšÿÔÌ‘ÿÝÕšÿåÚ¨ÿæØ®ÿãÔ³ÿÝжÿ×É·ÿÌÀ¶ÿ¿µ®ÿ§ ÿxtsÿUVTÿZ][ÿjqnÿ}‡ÿ“—ÿ³³³ÿÎÎÎÒÓщßàÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïôò îïíèààOÖÎηµ´ÿž¥¢ÿ~‰†ÿXojÿ8ZTÿFumÿcŸ•ÿbªžÿg»¯ÿrÓÅÿ|éÙÿuïÝÿdêÖÿRåÏÿMâÎÿBãÍÿ2çËÿ1æÊÿ4âÊÿ4âÊÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿçÛÿÅêÖÿÖéÐÿ×çÏÿßåÆÿãÞ·ÿãסÿáÒÿàÓ}ÿÝÔmÿÛÖcÿÚ×]ÿÚ×]ÿÜÕ`ÿÜÔcÿßÓgÿáÒnÿØÑtÿÙÏ{ÿÚÓ~ÿÞÕ…ÿàØ‹ÿäÙ•ÿêà¤ÿðè³ÿçÞ³ÿßÖ´ÿÄ» ÿ¬¥’ÿŸ—Šÿ{upÿc\Yÿjefÿÿ   ÿ¯®°ÿÌËÍ¥ÙÛÜyæèé2îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìõòãèæEÕÖÔÿû»ÿª¢¢ÿ‰‡†ÿszwÿZebÿczuÿc…ÿu¤œÿ—ÓÉÿ¢êÞÿ–êÞÿ„å×ÿrßÏÿaÛÉÿWÝÉÿNáËÿKàÌÿ@áËÿ0åÉÿ/äÈÿ3áÉÿ3áÉÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿœæÚÿÅêÖÿ×êÑÿØèÐÿàæÇÿâݶÿáÕŸÿàÑŒÿßÒ|ÿÜÓlÿÚÕbÿØÕ[ÿØÕ[ÿÚÓ^ÿÙÑ`ÿÛÏcÿÝÎjÿÚÓvÿÓÉuÿÍÆqÿÑÈxÿÓË~ÿÔÉ…ÿÓÉÿÒÊ•ÿÖÍ¢ÿßÖ´ÿåÜÁÿèáÎÿÜÔÇÿ«¥ ÿ‚{xÿxstÿlllÿdddÿ|{}ÿ›šœÿ¨ª«ÿÊÌÍÿÞàáYäæç;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßçæYÏ×Ö»ÃÂÿ¤¬«ÿŒ‘ÿtywÿKmgÿ?vmÿ=xpÿnº¯ÿŠéÛÿ€ðßÿjêÙÿTäÑÿGâÍÿ:âËÿ5âÌÿ/åÍÿ.æÎÿ)åÌÿ"ãÉÿ áÇÿ#åÎÿ"äÍÿ(ãÍÿ(ãÍÿ"ãÎÿ"ãÎÿ"ãÎÿ%âÍÿ*áÌÿ1àÌÿ0âËÿ9ãÍÿFäÌÿbâÏÿ|åÒÿ™äÖÿ»åÚÿÑáÚÿÒãÕÿÝáÈÿàÚµÿâÑžÿáψÿäÐyÿåÒkÿâÔ\ÿàÕUÿàÕUÿáÕWÿàÓYÿàÑ]ÿáÐaÿÚÍ_ÿÜÏaÿÝÐbÿÝÐbÿÜÑbÿÝÒcÿÚÒgÿÛÐnÿØÍqÿÚÏÿàÔŽÿã×ÿêܬÿòß¼ÿëÙºÿÛÆ°ÿš—‰ÿe`Wÿlj`ÿyupÿ‰‡†ÿ¥¢¤ÿ²´µÿÊÊÐ¥ÛÛánëëñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîììàââOÍÕÔš¶¾½ÿ•œÿx€ÿinlÿ]b`ÿnŠÿ’ÉÀÿšÕÍÿÜÑÿàÒÿnÞÍÿ_ßÎÿLÜÉÿAÜÇÿ7ßÈÿ4áËÿ,âÊÿ&ÞÆÿ!ÝÄÿßÅÿ áÇÿ"äÍÿ!ãÌÿ&áËÿ&áËÿ áÌÿ áÌÿàËÿ"ßÊÿ(ßÊÿ/ÞÊÿ-ßÈÿ6àÊÿCáÉÿ_ßÌÿyâÏÿ—âÔÿ¹ãØÿÎÞ×ÿÎßÑÿÚÞÅÿÞسÿáÐÿß͆ÿâÎwÿâÏhÿÞÐXÿÜÑQÿÝÒRÿÞÒTÿÞÑWÿÞÏ[ÿßÎ_ÿÙÌ^ÿÝÐbÿÞÑcÿÛÎ`ÿÚÏ`ÿÞÓdÿÜÔiÿÛÐnÿÜÑuÿÓÈxÿÔÈ‚ÿÑÅ‹ÿÐÂ’ÿÞ˨ÿæÔµÿÜDZÿÎ˽ÿþµÿ®¬¢ÿea\ÿZXWÿ|y{ÿÿ¨¨®ÿÂÂÈÿÙÙßyíîòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóèê(åÚÜnÒÇÉÿ¯­­ÿ€‹‰ÿVmiÿJnhÿh‘Šÿxµ«ÿrÔÆÿuè×ÿkâÓÿXÜËÿNáÍÿ>ÞÈÿ9åÍÿ0äËÿ(âÊÿ(âÊÿ'áÉÿ&àÈÿ)áÉÿ*âÊÿ+âÍÿ/âÍÿ-ßÈÿ0ÝÇÿ2ÛÈÿ2ÛÈÿ*ÛÇÿ*ÛÇÿ(ÚÃÿ'ÙÂÿ0ÜÄÿ2ÚÃÿ1ÝÁÿ6ÝÂÿ?ßÁÿWÞÄÿmâÉÿáÎÿ³âÒÿÆÜÐÿÈÜÉÿÓÛ½ÿÚÔ¯ÿÝÌ™ÿÜÆ„ÿâÅtÿáÅgÿÞÅ_ÿÜÄZÿÝÅ[ÿßÆ`ÿßÄbÿßÁhÿàÂiÿãÍdÿâÍ`ÿàË^ÿÞÊZÿÞÍXÿáÐ[ÿàÐXÿÞÎVÿÝÑ[ÿÚË]ÿÞÐfÿåÔsÿßÐtÿßÍzÿæÖƒÿîÚ“ÿãÙ©ÿáسÿáسÿļŸÿ¢œ…ÿ{vgÿge[ÿ}|ÿ›šœÿ¸¶¼ÿÑÑ׉ááçOðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéãäEØÍϚ·¹ÿŸ”–ÿywwÿfqoÿg~zÿy—ÿ›Ä½ÿ¤á×ÿ€âÔÿmàÏÿgÞÏÿYÝÌÿPãÏÿ:ÚÄÿ4àÈÿ)ÝÄÿ%ßÇÿ'áÉÿ(âÊÿ&àÈÿ'ßÇÿ'ßÇÿ&ÝÈÿ(ÛÆÿ*ÜÅÿ.ÛÅÿ0ÙÆÿ/ØÅÿ(ÙÅÿ'ØÄÿ&ØÁÿ$Ö¿ÿ+׿ÿ-Õ¾ÿ+×»ÿ1ؽÿ:Ú¼ÿRÙ¿ÿhÝÄÿŠÜÉÿ¯ÞÎÿÁ×ËÿÂÖÃÿÍÕ·ÿÔΩÿ×Æ“ÿÕ¿}ÿÚ½lÿÞÂdÿÚÁ[ÿØÀVÿÙÁWÿÛÂ\ÿÜÁ_ÿܾeÿܾeÿÜÆ]ÿÞÉ\ÿàË^ÿáÍ]ÿßÎYÿÝÌWÿÞÎVÿáÑYÿÛÏYÿßÐbÿÛÍcÿÙÈgÿÙÊnÿÙÇtÿ×ÇtÿÛÇ€ÿ×ÍÿÖͨÿØϪÿæÞÁÿÕϸÿ·²£ÿ‹ÿljiÿmlnÿ‹‘ÿ¬¬²ÿÅÅËÿàßáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììäää;ÍÍÍš§§§ÿ‰Žÿ_qpÿOplÿa—ÿvĹÿ}ßÑÿzç×ÿdçÓÿDáÌÿ<âËÿ7ßÈÿ3ßÇÿ,ßÆÿ)àÆÿ'àÆÿ&ßÅÿ'àÆÿ+ßÆÿ+ßÆÿ-ÝÅÿ,ÜÄÿ.ÚÂÿ-ÙÁÿ,ØÀÿ&Ú½ÿ%Ù¼ÿ&Ö¸ÿ&Ö¸ÿظÿ×·ÿÕµÿÒ³ÿ$Юÿ%ѯÿ%Ô¯ÿ&Õ°ÿ1ײÿDÙ·ÿTÞ¼ÿ|ÛÀÿ¦Ú¼ÿ»Ù¶ÿ¾Ù²ÿÈÖ¦ÿÎÏ—ÿÑŃÿÒ¾qÿÓ»cÿÓ¼YÿÓºTÿѸPÿѸPÿÓºTÿÔ¹WÿÖ·ZÿÕ¶YÿÔ¾UÿÖÀWÿÙÃZÿÛÅ\ÿÝÅ[ÿÞÆ\ÿÞÇZÿßÈ[ÿßË\ÿßË\ÿÞË\ÿßÌ]ÿÞÍ^ÿßÎ_ÿÝÏ_ÿÜÎ^ÿÙÈqÿ×Ç{ÿàÒ†ÿäÕ–ÿäÙ ÿíâ¶ÿØÏ­ÿ©¡Šÿ…€qÿtqiÿ€~}ÿ¢¢¨ÿ¼¿ÄÿÏÐÚäåï;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ ÖÖÖ~ÂÂÂÿ©©©ÿƒƒƒÿglmÿp‚ÿ‰ª¦ÿ—ÍÆÿÛÐÿzÜÎÿnÛËÿZÝÉÿAÞÉÿ9ßÈÿ6ÞÇÿ2ÞÆÿ,ßÆÿ)àÆÿ'àÆÿ'àÆÿ%ÞÄÿ)ÝÄÿ(ÜÃÿ+ÛÃÿ)ÙÁÿ+׿ÿ*Ö¾ÿ)Õ½ÿ!Õ¸ÿÓ¶ÿ"Ò´ÿ"Ò´ÿÔ´ÿÓ³ÿѱÿÍ®ÿ!Í«ÿ"άÿ Ϫÿ Ϫÿ)Ϫÿ;ЮÿKÕ³ÿsÒ·ÿ Ô¶ÿ´Ò¯ÿµÐ©ÿ¾ÌœÿÃÄŒÿȼzÿʶiÿÌ´\ÿ̵RÿεOÿÍ´LÿÍ´LÿεOÿÏ´RÿѲUÿÒ³VÿϹPÿкQÿÒ¼SÿÓ½TÿÖ¾TÿØÀVÿÛÄWÿÝÆYÿÜÈYÿÜÈYÿÜÉZÿÝÊ[ÿÜË\ÿÝÌ]ÿÛÍ]ÿÛÍ]ÿØÇpÿÓÃwÿØÊ~ÿØÉŠÿÖË’ÿáÖªÿãÚ¸ÿÔ̵ÿ¹´¥ÿŽ‹ƒÿomlÿuu{ÿ“–›ÿ¶·ÁÿÑÒ܉ßàêYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçè2ÛÕրĿÀÿ–––ÿhvuÿTwsÿV‘‰ÿe¹­ÿtßÏÿgìØÿVéÓÿ?ãÊÿ5ÞÄÿ-ÞÃÿ(âÅÿ'áÄÿ%áÄÿ$àÃÿ$àÃÿ$àÃÿ#àÁÿ'ßÁÿ%Û¼ÿ(Û¼ÿ'Ú¹ÿ&Ù¸ÿ%Ø·ÿ#ÖµÿÕ³ÿÔ²ÿÔ¬ÿѪÿЩÿϨÿЧÿÎ¥ÿË£ÿ!È¡ÿ)ÄŸÿ.Ä ÿ-ÆŸÿ2Æ ÿ9Ç¢ÿLʧÿ`άÿ}Í°ÿŸÎ´ÿ³É°ÿ²È«ÿ»Äœÿ¼¼ŒÿÀ´zÿ¾­jÿÁª_ÿ¼¦TÿÀ¨Nÿ¾¨Iÿ¾¨Iÿ¾¨HÿÄ«KÿÉ­Nÿ˯PÿÉ´KÿʵLÿ̶Mÿ͵QÿζRÿѸXÿÖº[ÿؼ]ÿÛ¿`ÿÜÀaÿÛÂ`ÿÜÅ_ÿÜÈ]ÿÝÉ^ÿÞÊ]ÿÞÊ]ÿàÌ_ÿÞÉ`ÿßÌeÿÞÌmÿÛÊsÿÜÌ€ÿãÕ“ÿêܧÿäÛ¯ÿÏÆ¥ÿ¢ž†ÿ{wlÿwtpÿ‘”ÿµ·¿ÿÏÑÙàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÓÔƒº´µÿŸš›ÿwwwÿftsÿwš–ÿ’ÍÅÿ‹ßÓÿwâÒÿVÛÇÿHÛÅÿ<àÇÿ6ßÅÿ.ßÄÿ(âÅÿ'áÄÿ$àÃÿ#ßÂÿ"ÞÁÿ!ÝÀÿܽÿ!Ù»ÿ!׸ÿ$׸ÿ#Öµÿ!Ô³ÿÒ±ÿЯÿÏ­ÿÍ«ÿΦÿÌ¥ÿÊ£ÿÈ¡ÿÈŸÿÇžÿÅÿÃœÿ&Áœÿ,žÿ.Ç ÿ7Ë¥ÿAϪÿVÔ±ÿkÙ·ÿˆØ»ÿ¨×½ÿ¾Ô»ÿ¾Ô·ÿÉÒªÿËË›ÿΈÿʹvÿË´iÿÁ«YÿÁ©Oÿ¼¦Gÿ¸¢Cÿ·¡Aÿ¼£CÿÁ¥Fÿ¦GÿîEÿįFÿDZHÿɱMÿ˳Oÿ̳SÿдUÿдUÿÔ¸YÿÖº[ÿÕ¼Zÿ×ÀZÿØÄYÿÙÅZÿÛÇZÿÛÇZÿÞÊ]ÿÝÈ_ÿÚÇ`ÿÚÈiÿÚÉrÿÒÂvÿÏÁÿÖÈ“ÿÕÌ ÿâÙ¸ÿÕѹÿ«§œÿ|xÿmlpÿ„†Žÿ­¯·ÿÉÉÉ°ãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêèè(ÐÎΰµ´ÿ…–“ÿ]xuÿXˆ‚ÿs¸®ÿvÕÇÿmãÑÿ\ëÕÿFäÌÿ.ÝÂÿ+ßÆÿ(áÇÿ$ßÅÿ$ßÅÿ+áÃÿ*àÂÿ&ÞÀÿ%Ý¿ÿ#ܼÿ!Úºÿ ×µÿ!Ô³ÿ"Ô¯ÿ$Ó®ÿ%Ò¬ÿ"Ï©ÿΦÿË£ÿÊŸÿÉžÿ Řÿ&×ÿ'–ÿ&Á•ÿ'–ÿ)Ęÿ1›ÿ=ÁœÿOÅ¢ÿWȦÿ]έÿfÓ³ÿpعÿ…ÜÀÿ›ßÆÿ±àÊÿÀàÕÿÏÞÖÿÓàÒÿÛÝÉÿÜؼÿÞÏ®ÿÙÇžÿÚÓÿι‚ÿ˳yÿÀ«mÿ½¥cÿ¼£]ÿ¼¡Wÿ¸Sÿ¹›Nÿ¼¢Hÿ¼¢Hÿ¾£IÿÀ¥KÿèNÿŪPÿÉ«RÿË­TÿË®SÿÍ°UÿδVÿжXÿÒ¹WÿÔ»YÿÖ¿[ÿ×À\ÿÛÈYÿÜÉZÿ×ÄUÿÙÅZÿßÍbÿÞÉfÿÙÇhÿÞÌyÿØÊ~ÿßБÿåÚ¦ÿâØ°ÿ¾¸›ÿ‹„sÿwteÿ‡…}ÿªªªÿÇÇǽáááOïïï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿååå;ÖÔÔ€°®®ÿ†‹Šÿgxuÿi„ÿˆ¸²ÿœá×ÿ„ãÕÿeÛÉÿOÞÈÿ?ÝÅÿ0ßÄÿ,àÇÿ'àÆÿ!ÜÂÿ!ÜÂÿ&ܾÿ%Û½ÿ"Ú¼ÿ غÿظÿÕµÿÓ±ÿЯÿϪÿͨÿË¥ÿÉ£ÿÇŸÿÅÿÅšÿÄ™ÿÁ”ÿ$Á•ÿ'–ÿ)Ęÿ-Èœÿ1Ì ÿ<ͦÿJΩÿ[Ñ®ÿbÓ±ÿgØ·ÿoܼÿxàÁÿŠáÅÿŸãÊÿ´ãÍÿÄäÙÿÒáÙÿÕâÔÿÝßËÿàÜÀÿåÖµÿäÒ©ÿçРÿßÊ“ÿÝÅ‹ÿÔ¿ÿÓ»yÿÒ¹sÿÏ´jÿŪ`ÿ¤Wÿ¼¢Hÿº Fÿ¸Cÿ·œBÿ¹žDÿ½¢HÿÃ¥LÿƨOÿŨMÿǪOÿɯQÿ˱SÿÍ´RÿзUÿÒ»WÿÔ½YÿÕÂSÿÛÈYÿÙÆWÿ×ÃXÿÚÈ]ÿÛÆcÿ×ÅfÿÚÈuÿÖÈ|ÿÓÄ…ÿÔÉ•ÿàÖ®ÿßÙ¼ÿü«ÿ–“„ÿwumÿ{{{ÿ   ÿËËËÿãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÎÎί±±ÿ‘““ÿa|xÿZ†ÿp¿´ÿyâÓÿhæÓÿNáËÿBàÈÿ5ÛÂÿ1ÙÂÿ/ÛÃÿ+ÛÃÿ*ÚÂÿ(ÛÂÿ%Ø¿ÿ*Öºÿ)Õ¹ÿ$Ô¶ÿ"Ò´ÿ!Ò±ÿЯÿΩÿ ̨ÿ É¢ÿ!Æ ÿ#Å›ÿ#Á˜ÿ%À”ÿ%À”ÿ%À“ÿ%À“ÿ4Á–ÿ:˜ÿ?Å›ÿBÈžÿEÍ£ÿIѧÿRÓ¬ÿ`Ô¯ÿpÓ³ÿrÕµÿu×¹ÿyÛ½ÿ€ÝÂÿÞÅÿ¤ßËÿµßÎÿÅâÒÿÒßÑÿÔßËÿÙÜÆÿÝÙ½ÿßÔ¶ÿàÏ®ÿàͨÿÙÆ ÿÚÄšÿ×Á—ÿÙÁ“ÿÙÀŽÿؼ†ÿÓ´}ÿЮsÿǧfÿÅ¢^ÿ¾œVÿ¹™Nÿ¹˜Iÿ»›Hÿ½ŸHÿ¿¢GÿÀ¤Fÿ§EÿƬHÿÈ®JÿÈ°LÿʲNÿ͵QÿиTÿ̼RÿÒÂXÿÔÅWÿ×ÃVÿÚÆWÿÙÅVÿ×ÃVÿÙÄ[ÿÖÃbÿÚÆqÿ×Æ}ÿÒŇÿÛОÿàÙ²ÿËÞÿž™„ÿuuuÿ€€€ÿ£££ÿÊÊÊ¥ÞÞÞYîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììÒÒÒƒ³³³ÿ‹ÿsuuÿn‰…ÿ¹ÿ‘àÕÿvßÐÿ\ÚÇÿHÛÅÿ=ÛÃÿ3ÙÀÿ5ÝÆÿ3ßÇÿ(ØÀÿ'׿ÿ'ÚÁÿ$×¾ÿ(Ô¸ÿ'Ó·ÿ!ѳÿϱÿέÿÌ«ÿÊ¥ÿȤÿÅžÿÂœÿÀ–ÿ½”ÿ"½‘ÿ"½‘ÿ#¾‘ÿ$¿’ÿ7Ä™ÿ=Å›ÿCÉŸÿFÌ¢ÿGÏ¥ÿJÒ¨ÿRÓ¬ÿ^Ò­ÿpÓ³ÿrÕµÿtÖ¸ÿwÙ»ÿÜÁÿÞÅÿ¥àÌÿ·áÐÿÅâÒÿÔáÓÿ×âÎÿÝàÊÿàÜÀÿàÕ·ÿßέÿÞ˦ÿ×ÄžÿÙÙÿ×Á—ÿØÀ’ÿØ¿ÿÙ½‡ÿع‚ÿض{ÿ×·vÿÔ±mÿË©cÿ¢Wÿ¾Nÿ»›Hÿ¹›Dÿ·š?ÿºž@ÿ½¢@ÿÀ¦Bÿ¨DÿªFÿëGÿÆ®JÿɱMÿɹOÿʺPÿ˼NÿÒ¾QÿØÄUÿÚÆWÿÚÆYÿÚÅ\ÿÓÀ_ÿÔÀkÿÔÃzÿÍÀ‚ÿËÀŽÿÕΧÿÞÖ±ÿÏʵÿžžžÿtttÿwwwÿ§§§ÿËËËÿàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîüú áîìOÑÖÕ‰¹®°ÿ–‹ÿJ}uÿIžÿr;ÿzêØÿ_åÑÿ>ÚÂÿ1ÚÀÿ*ÛÀÿ'ÜÀÿ'ÜÀÿ(Ü¿ÿ'Û¾ÿ'Ý»ÿ$Ú¸ÿ!ضÿÖ´ÿ$Õªÿ&Ò¨ÿ"Шÿ#Ì¥ÿ É¢ÿ ÅŸÿÚÿÀ˜ÿ!Á—ÿ!½”ÿ¼Žÿ ¹Œÿ$¼‹ÿ'¿Žÿ+Ä‘ÿ.Ç”ÿBŤÿKƦÿPÈ©ÿUÊ«ÿ[Ë©ÿZʨÿXÊ¥ÿSʤÿPÌ¢ÿOË¡ÿPÌ ÿVÏ£ÿaÑ¢ÿiУÿpÕ¨ÿƒ×­ÿœÖ³ÿ¯Ô´ÿ´Ó¬ÿÂÍ¥ÿÉÆ™ÿÒ»ÿÒ¶€ÿѳzÿϱvÿΰuÿÌ´xÿи|ÿηÿÏ·ƒÿѶƒÿβƒÿѱˆÿ̬ƒÿʬ{ÿŪqÿ½£aÿ¶ŸTÿ²Lÿ¯—Cÿ®˜@ÿ³˜Aÿ¶›Dÿ»Fÿ½ŸHÿÅ¢LÿɤOÿ˦QÿÅ®HÿȱKÿÌ´PÿÏ·SÿѹUÿÔ¼Xÿ×ÁXÿÚÄ[ÿÚÆ[ÿÚÆ[ÿØÇ`ÿÚÆgÿÚÆoÿàÉ{ÿìÕŠÿøÛ¢ÿÜÈ·ÿ±¨šÿŒ…tÿ||nÿŸ¨›ÿÈÓÉ°ÕâÚ€êõòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöô(ÞìêYÐÝÛÿ¶»ºÿœ‘“ÿ…z|ÿiœ”ÿsȺÿ‰äÕÿnÞÌÿNÔÀÿ@ÜÄÿ6ßÅÿ%Ö»ÿ%Ú¾ÿ%Ú¾ÿ$Ø»ÿ#׺ÿ!×µÿÕ³ÿѯÿÏ­ÿΣÿË¡ÿÉ¡ÿÅžÿÃœÿ¿™ÿ¾•ÿ»“ÿºÿ¸ÿºŒÿ!ºÿ'¿Žÿ+Ã’ÿ/È•ÿ2˘ÿAÄ£ÿG¢ÿHÀ¡ÿKÀ¡ÿQÁŸÿPÀžÿM¿šÿG¾˜ÿ@¼’ÿ=¹ÿ:¶Šÿ<µ‰ÿF¶‡ÿP·ŠÿY¾‘ÿn˜ÿ†Àÿ—¼œÿ›º“ÿ§²Šÿ«¨{ÿ²›mÿ±•_ÿ¯‘Xÿ°’Wÿ®Uÿ­•Yÿ²š^ÿ´eÿ½¥qÿǬyÿȬ}ÿƦ}ÿƦ}ÿʬ{ÿË°wÿƬjÿÀ©^ÿº¥Tÿ¶žJÿ®˜@ÿ²—@ÿ²—@ÿ¶˜Aÿ¸šCÿ¿œFÿÂHÿÄŸJÿÀ©CÿìFÿǯKÿʲNÿÌ´PÿÏ·SÿÒ¼SÿÔ¾UÿÕÁVÿÖÂWÿÔÃ\ÿÕÁbÿÔÀiÿØÁsÿßÈ}ÿèË’ÿáͼÿÓʼÿ±ª™ÿ……wÿ}†yÿ¨žÿÅÒÊÿÜçäcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëÛÖ×ÿ¼ÄÃÿ‚“ÿbyuÿl˜‘ÿq̽ÿoãÐÿoèÔÿQÚÄÿ;Ô»ÿ1Û¿ÿ*ÞÁÿ'Û¾ÿ$Ú»ÿ#Ùºÿ$׶ÿ%Ô³ÿ#Ò°ÿ Ï­ÿͨÿ˦ÿ!ÉžÿÆ›ÿÄ–ÿ”ÿÀ’ÿ¾ÿ¼ÿ»ŒÿºŠÿº‹ÿ$¼‹ÿ-½ÿ3¿ÿ<À’ÿ@“ÿAÔÿ9Åÿ4À‹ÿ/»†ÿ,¸ƒÿ*¸ƒÿ&¸‚ÿ·€ÿµ~ÿ´|ÿ´|ÿ´~ÿ·ÿ(¸„ÿ7ºˆÿ?¿ŽÿUÁ“ÿ~Ñÿ–¾Žÿ—»‡ÿž²}ÿ£§lÿ¦›_ÿ¨’PÿªHÿ¨‹@ÿ§‡<ÿ¨ˆ<ÿ­‰=ÿ­‰=ÿµBÿ¿’HÿÀ’Kÿ»™Sÿ¾œVÿÇ¥_ÿÍ«eÿ˨dÿɦbÿÉ£bÿÄž]ÿ¾˜Wÿ»•Tÿ¶’Lÿ´‘Gÿ´”Aÿ¶˜Aÿ¸œ>ÿºž@ÿ¾¡FÿÁ¤IÿŨMÿÈ«PÿÊ­Rÿ̯TÿÏ´RÿѸRÿÓ½TÿÔ¾UÿÓÀWÿÕÁ\ÿÓ¿`ÿÔ¿dÿÖÂjÿÛÃwÿÝÌ”ÿíݹÿÝѯÿ³«”ÿ„„tÿ€|ÿ®°°ÿÎÐÐéëë(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåàáOËÆÇÿ”œ›ÿevsÿsŠ†ÿ›ÇÀÿ„ßÐÿkßÌÿ]ÖÂÿLÕ¿ÿAÚÁÿ.ؼÿ!Õ¸ÿ'Û¾ÿ"عÿ Ö·ÿ Ó²ÿ!ЯÿάÿË©ÿÊ¥ÿÈ£ÿÅšÿØÿÁ“ÿ¾ÿ½ÿ¼Žÿ»Œÿº‹ÿ»‹ÿ ¼ÿ&¾ÿ.¾Žÿ1½Žÿ7»ÿ7¹Šÿ7¹Šÿ-¹„ÿ*¶ÿ&²}ÿ#¯zÿ ®yÿ°zÿ²{ÿ²{ÿµ}ÿ·ÿ»…ÿ#¿‰ÿ1ÁÿAÄ’ÿHÈ—ÿ]É›ÿ‡ÌšÿŸÇ—ÿ¡Å‘ÿ©½ˆÿ¯³xÿ²§kÿ³[ÿµ˜Sÿ­Eÿ­Bÿ­Aÿ°Œ@ÿ«‡;ÿ¬„9ÿ°ƒ9ÿ¬~7ÿ©‡Aÿ«‰Cÿ²Jÿ¸–Pÿº—Sÿ¿œXÿÆ _ÿÆ _ÿÅŸ^ÿÂœ[ÿ¼˜Rÿ¶“Iÿ²’?ÿ²”=ÿ´˜:ÿ·›=ÿºBÿ¼ŸDÿ¿¢GÿÂ¥JÿŨMÿÈ«PÿË°NÿÍ´NÿϹPÿÑ»RÿнTÿÓ¿ZÿÒ¾_ÿÓ¾cÿÓ¿gÿÕ½qÿÌ»ƒÿØȤÿßÓ±ÿÖηÿ©©™ÿ~}yÿ‰‹‹ÿ°²²ÿ×ÙÙ~èêê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÜnÏÇȽ«£¤ÿcxuÿYŒ„ÿxǹÿvâÏÿUãÌÿHâÉÿ8×½ÿ,Ó¸ÿ)ܽÿ&ܽÿÕµÿÓ³ÿÔ±ÿ Ò¯ÿ"Ï©ÿ#˦ÿ"É¢ÿÆŸÿÄ›ÿ™ÿÁ‘ÿ¿ÿ½Šÿ»ˆÿ»„ÿ¹ƒÿº‚ÿ¹‚ÿ ºƒÿ$º„ÿ(»‡ÿ*º†ÿ*·†ÿ,´„ÿ+±ƒÿ*°‚ÿ·yÿ·yÿ·zÿ¶zÿ´|ÿ"µÿ&º„ÿ,»Šÿ/¾ÿ7¼‘ÿ>¼’ÿJ»–ÿV¼™ÿgÀŸÿpƨÿ…ƬÿšË¯ÿ«É¬ÿ­Æªÿ±À¡ÿµ¶–ÿ´ªˆÿ³¢{ÿ´œrÿ­–fÿ¬‘^ÿ­’Zÿ®Uÿ®ŒPÿ°‹Oÿµ‰Lÿ±…Hÿ©…7ÿ§ƒ5ÿª†8ÿ­ˆ>ÿ°ˆ@ÿ¶ŒIÿÀ”TÿÖYÿÖYÿÄ—ZÿÀ—Xÿ¼•Qÿ´’Fÿ°?ÿ®’;ÿ°”=ÿ¶”@ÿ·”Dÿº—Gÿ½šJÿÀžKÿÄ¢OÿǧNÿɪMÿ̱OÿεOÿϹPÿÑ»RÿÓ¾UÿÕÀWÿÕÂ[ÿÕÀ]ÿÕÂgÿÖÁvÿÞÌÿåÔ©ÿÖÊ®ÿ¥š’ÿ‚zzÿ”ÿÀ¿»ÿÛÚÖ~ððêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñéê(ØÐщª¢£ÿyzÿp…‚ÿŒ¿·ÿ’áÓÿlØÅÿLÚÃÿBÜÃÿ9ؾÿ-Ô¹ÿ%عÿ"عÿÖ¶ÿÔ´ÿÒ¯ÿЭÿ̦ÿ È£ÿÅžÿ›ÿ¿–ÿ½”ÿ½ÿ»‹ÿº‡ÿ¸…ÿ¸ÿ·ÿ¸€ÿ·€ÿ¸ÿ"¸‚ÿ#¶‚ÿ$´€ÿ#°ÿ$¬|ÿ%«}ÿ%«}ÿ ¶xÿ¹{ÿ¼ÿ½ÿ$½…ÿ+¾Šÿ0ÄŽÿ8Ç–ÿ@ÏžÿLѦÿXÖ¬ÿhÙ´ÿvܹÿˆáÀÿåÇÿ¢ãÉÿ³äÈÿÅãÆÿÉâƽÐßÀì×ظÿÚЮÿÜˤÿßÇÿÕ¾ŽÿÏ´ÿÈ­uÿ¤iÿ½›_ÿ¼—[ÿ¿“Vÿ¹Pÿ²Ž@ÿ­‰;ÿ«‡9ÿ¨ƒ9ÿ¨€8ÿª€=ÿ°„Dÿ°ƒFÿµˆKÿºPÿ¼“Tÿ½–Rÿ·•Iÿ²‘Aÿ®’;ÿ­‘:ÿ²<ÿ³@ÿµ’Bÿ¹–Fÿ¼šGÿ¿Jÿ¢IÿÄ¥HÿÈ­KÿʱKÿ˵LÿÍ·NÿιPÿÒ½TÿÒ¿XÿÓ¾[ÿÒ¿dÿÓ¾sÿÖÄ…ÿÔØÿÝѵÿÌÁ¹ÿ˜ÿ„€ÿš™•ÿÀ¿»ÿããÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëêÐÑ϶·µÿ~Œˆÿfˆÿx½°ÿäÒÿcáËÿ?Ú¿ÿ/ÜÀÿ%׺ÿ"عÿ$Ú»ÿ×µÿÓ±ÿÔ®ÿ Õ¯ÿϧÿ!Ì¥ÿ#ÊŸÿ$Æœÿ"ÖÿÀ“ÿ½ÿ»ÿ»…ÿ¸ƒÿ·€ÿ¶ÿ·|ÿ!·|ÿ!·{ÿ!·{ÿ!·{ÿ µ}ÿ´|ÿ±|ÿ¯zÿ®}ÿ±€ÿ³†ÿ'·ÿ2¸”ÿ?½šÿQ¡ÿdƨÿuɱÿ†Î¸ÿ•Î¿ÿ§ØÊÿ·ÞÖÿÅèÞÿÕîêÿÞóñYéõõ(îöö íõõéöø(ê÷ùí÷÷ÿÿÿÿÿÿÿÿÿøïìøðé(ìæÛnàÛÌšÕѾÿÍÇ°ÿÀ»¢ÿº²•ÿ°¨‹ÿ¨}ÿ¶™rÿ²”eÿ«\ÿ¨ŠQÿ£„Eÿ¤ƒ=ÿ¤„8ÿ¤€4ÿ«‡;ÿ±‰>ÿ¶ŽCÿ¹Hÿ¹Kÿ¸JÿµŒGÿ´‹Fÿ²Œ>ÿ³?ÿ´Ž@ÿ·‘Cÿº•Eÿ½˜HÿÀ›IÿÁžHÿÄ¥JÿȪKÿÉ®Lÿ˲Lÿ˵KÿϹOÿÒ¾QÿÓ¿RÿÓ¾QÿØÂYÿÙÄiÿÖÂ{ÿÜÌ—ÿäÕ´ÿɼ¦ÿ”Šÿ‡zÿ£ œÿÈÇÃÜëéé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòðï âàßYÂÃÁÿˆ‰‡ÿv„€ÿ–¸±ÿ”ÙÌÿyÜÊÿ\ÚÄÿ>Ù¾ÿ-Ú¾ÿ$Ö¹ÿ!׸ÿ Ö·ÿÒ°ÿÒ°ÿÒ¬ÿÈ¢ÿÈ ÿÆŸÿÄ™ÿÁ—ÿÀ“ÿ½ÿºŒÿ¸Šÿ·ÿµ€ÿ´}ÿ³|ÿ´yÿµzÿµyÿ´xÿ°tÿ°xÿ°xÿ¯zÿ°{ÿµ„ÿ$¼‹ÿ)À“ÿ5Å›ÿ@Æ¢ÿQϬÿhÙ¸ÿ‚äÆÿšîÖÿ­õßÿ½öçÿÇøê½Ôûó€Ýÿöcæÿû2ëÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúõæ2öòßYöðÙyïêщéáÄÊÛÓ¶ÿÐÅ¥ÿαŠÿȪ{ÿ¾ oÿ¸šaÿ°‘Rÿ¯ŽHÿ¬Œ@ÿª†:ÿ©…9ÿ«ƒ8ÿ¬„9ÿ¯…>ÿ²‰DÿµŒGÿµŒGÿ´‹Fÿ¯‰;ÿ°Š<ÿ°Š<ÿ²Œ>ÿµ@ÿ¸“Cÿº•Cÿ»˜Bÿ¼Bÿ¤EÿŪHÿÆ­GÿDZGÿ˵KÿÏ»NÿмOÿÓ¾QÿÑ»RÿϺ_ÿÒ¾wÿË»†ÿÖǦÿßÒ¼ÿº±§ÿ†€yÿ‘ŽŠÿ«ª¦ÿÖÔÔ€ðñï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéäãEÍÈÇÿ—¢ŸÿZƒ{ÿb¨›ÿãÑÿcâÉÿIáÄÿ;Ù»ÿ.Ù¹ÿ#Ù·ÿ!×µÿÕ²ÿÓ°ÿÒ¬ÿϪÿ̤ÿÊžÿƘÿ ÖÿÁ‘ÿ½Žÿ»‰ÿ¹‡ÿ¸„ÿ·ƒÿ³{ÿ³{ÿµyÿ¶zÿ´xÿ±uÿ°tÿ°uÿ²wÿ¯yÿ#°}ÿ+²„ÿ1´‰ÿ9¶ÿCÀ™ÿVɨÿ“ƾÿ¬ÒÌÿ¼âÜÿÌêåÿÛðínëøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíøè(æíÞYÜÖÏÿ×ÉÃÿĺ¨ÿ´ªŒÿ¨Ÿsÿ¤—_ÿ¡“Qÿ£Gÿ¥ŽBÿ¤…:ÿ¤7ÿ¨7ÿ©8ÿ±?ÿ¹‡Eÿ»‰Gÿ²=ÿ±Œ<ÿ°‹;ÿ¯Š:ÿ²‹<ÿµŽ?ÿ¸‘Bÿº“Dÿ½™EÿÀœHÿ¡KÿŦKÿƪKÿÊ°LÿεOÿиNÿÒ¸LÿÕ»OÿÖÀWÿÒÀcÿÐÁkÿÐÄ~ÿØÍ™ÿÝÕ°ÿµ¯˜ÿ‰†~ÿ’Žÿ¸¸¸ÿÝßßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèé(ÕÐ϶±°ÿ|‡„ÿp™‘ÿ}öÿxÜÊÿ_ÞÅÿBÚ½ÿ9×¹ÿ(Ó³ÿ Ö´ÿÕ³ÿÒ¯ÿЭÿÏ©ÿ˦ÿÉ¡ÿÇ›ÿÕÿÀ“ÿ¾Žÿº‹ÿ¹‡ÿ·…ÿ¶‚ÿµÿ´|ÿ²zÿ²vÿ²vÿ±uÿ°tÿ±uÿ²wÿ°uÿ ´~ÿ,¹†ÿ6½ÿ?—ÿMÊ£ÿ]Ú³ÿqäÃÿ»îæÿÏõï×ý÷~áÿúOêÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõüíüöï üîè(îäÒƒá×¹ÿÒÉÿƹÿ´¦dÿ«˜Oÿ©’Fÿª‹@ÿ«ˆ>ÿ­†<ÿ©8ÿ­};ÿ³?ÿ´‚@ÿ®‰9ÿ®‰9ÿ®‰9ÿ®‰9ÿ°‰:ÿ²‹<ÿµŽ?ÿ¶@ÿ·“?ÿº–Bÿ»šDÿ¿ EÿÀ¤EÿéEÿȯIÿ˳IÿδHÿÑ·KÿÑ»RÿÍ»^ÿÊ»eÿɽwÿÎÃÿÓ˦ÿÑË´ÿ©¦žÿˆƒ„ÿÿÇÉɽàââOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÛÜn²·µÿ„•‘ÿ[ƒÿo³ÿläÌÿDÞÁÿ5âÂÿ)Ö¶ÿ+Ö¶ÿ'Ò²ÿ$Ô¯ÿ"Ò­ÿ Ï©ÿ"ͧÿ#Ê¡ÿ#Çžÿ!Ùÿ!Á“ÿ¿ÿ ½‹ÿº‡ÿ¸…ÿ·ÿµÿ´|ÿ²{ÿ²wÿ°uÿ¯uÿ°vÿ±wÿ°zÿ²|ÿ³‚ÿ%³†ÿ<¶ÿQ½™ÿhÂ¥ÿƒÌ²ÿ¥ÜÉÿ»ðÜÿÚøënÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó÷ëéíÚnÞÝÃÿÅ£ÿ´«…ÿ¬Ÿsÿ©•fÿ¨Zÿ©‰Nÿ¥‚Bÿ©9ÿª‚7ÿ§4ÿªƒ8ÿ«„9ÿ¬‡7ÿ­ˆ8ÿ­‡5ÿ®ˆ6ÿ°‰:ÿ²‹<ÿµŽ@ÿ·Bÿ¹”Dÿ¼—Gÿ½œFÿÁ¢GÿĨIÿÇ«LÿȯMÿʱOÿθOÿкQÿλTÿμ]ÿÑÃqÿÓƈÿÜÓ§ÿÍÆ­ÿ ÿ’Šÿ¨©¥ÿÌÍÉ°ìñè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêåæ;ÏÊË¥šŸÿx‰…ÿ€²¨ÿˆÛÌÿjâÊÿ>Ø»ÿ0ݽÿ%Ò²ÿ(Ó³ÿ'Ò²ÿ!ѬÿϪÿ̦ÿÉ£ÿÆÿÚÿ¿•ÿ½ÿ»‰ÿ¹‡ÿ·„ÿµ‚ÿ´~ÿ³}ÿ²zÿ°yÿ¯tÿ®sÿ°vÿ²xÿµ{ÿµÿ¹ƒÿ#»Šÿ2À“ÿMÇ¡ÿgÓ¯ÿƒÝÀÿ£ìÒÿÅüéÊÓÿôƒèÿù(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿíüûáOíêË¥âÙ³ÿÎÁ•ÿï€ÿ¸jÿ²’Wÿ®‹Kÿ²ŠBÿ¯‡<ÿ©6ÿ¨6ÿ©‚7ÿª…5ÿ¬‡7ÿ¬†4ÿ«…3ÿ¬…6ÿ¯ˆ9ÿ³Œ>ÿµŽ@ÿ¶‘Aÿ¹”Dÿº™Cÿ¾ŸDÿÁ¥FÿĨIÿŬJÿÇ®Lÿ˵LÿÍ·Nÿ˸QÿʸYÿÉ»iÿʽÿË–ÿÏȯÿ¿±ÿ–“ŽÿŽ‹ÿº»·ÿÙÞÕ€îóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ÔÙØ€¤±¯ÿr“Œÿg¥™ÿ{×ÄÿlæÎÿCÙ¼ÿ0Ö·ÿ%×´ÿ"Ô±ÿ Ò¯ÿ άÿ"Ï©ÿ#˦ÿ"É ÿ"Æÿ#Ùÿ#Á“ÿ½Žÿ »ˆÿ¹ƒÿ·ÿµ~ÿ³|ÿ³zÿ²yÿ°xÿ¯wÿ±uÿ±uÿ°yÿ°~ÿ%±‚ÿ4±‰ÿA·”ÿVºžÿpÆ®ÿ‘ÕÄÿ¶çÙÿÔóì€ëüøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÔ€×ʼÿÁ³œÿ´¡~ÿ¨”dÿ¨Tÿ£Hÿ£†Aÿ§}:ÿ§}:ÿ¨€8ÿ©‚7ÿ©„4ÿ¨ƒ3ÿ«„5ÿ®‡8ÿ¯‡<ÿ±‰>ÿ³ŒAÿµŽCÿ¶“Cÿ¹—Cÿ¼ŸDÿ¿¢GÿÀ¥Nÿ§PÿÇ®NÿαNÿϳNÿѵPÿѹYÿÏ»fÿÑÂ}ÿÕÉ“ÿØѪÿ¯«“ÿŽŽ~ÿ§¢ŸÿÎÉÊÿîéê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèææ2¾ÃÂÿˆ•“ÿs”ÿ‡Å¹ÿÛÈÿdÞÆÿ=Ó¶ÿ/Õ¶ÿÑ®ÿ%×´ÿ Ò¯ÿɧÿË¥ÿ È£ÿÅœÿ™ÿ¿•ÿ½ÿ¹Šÿ¸…ÿ¶€ÿµÿ³|ÿ²{ÿ²yÿ±xÿ°xÿ¯wÿ²vÿ²vÿ±zÿ°~ÿ&²ƒÿ;¸ÿPÆ£ÿjβÿæÎÿ°ôãÿÒÿõƒæÿþ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüïáOëÝƽ×Ä¡ÿ¿«{ÿ³›_ÿ¨”Mÿ§ŠEÿ«>ÿ§}:ÿ¦~6ÿ¨6ÿ¨ƒ3ÿ§‚2ÿªƒ4ÿ®‡8ÿ­…:ÿ®†;ÿ°‰>ÿ²‹@ÿ²?ÿ¶”@ÿ¸›@ÿºBÿ½¢Kÿ¾£LÿÄ«Kÿ̯LÿβMÿϳNÿζVÿË·bÿȹtÿÏÃÿÑÊ£ÿËǯÿ¢¢’ÿŽ‰†ÿ¸³´ÿáÜÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëéé(ÓÑщ¡ª§ÿu”ÿp°¤ÿ{ÙÈÿcÛÃÿF×»ÿ9Ó¶ÿ.Ѳÿ(Ï®ÿ&Ò°ÿͪÿʧÿÈžÿÅœÿ—ÿ¾”ÿ»ÿ¹Šÿ¶…ÿ¶€ÿµ~ÿ³|ÿ³zÿ±yÿ°xÿ°xÿ®wÿ®wÿ°wÿ³zÿ%µÿ:¶ŠÿQ»—ÿrƪÿ˜ØÅÿ»åÚÿÝøôcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòèÖ~ÙϱÿƸŽÿ°¥sÿ¥”[ÿ²ŠPÿ¯ƒFÿ©>ÿ©€;ÿ¨‚4ÿ§3ÿ©‚3ÿ¬…6ÿªƒ8ÿ¬…:ÿ®‡<ÿ°‰>ÿ°=ÿ³‘=ÿ´—<ÿ¶™>ÿ·Iÿ¹ŸKÿĤKÿ̪MÿÓ­MÿÔ®NÿÓ²QÿзUÿųZÿοvÿÏÇ‹ÿÙÓªÿ½¤ÿ–‰ÿ¤–¢ÿȾÊÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞÞY¾¼¼ÿ–“ÿž—ÿŠÊ¾ÿy×ÆÿcÛÃÿ?дÿ7Ñ´ÿ&ɪÿ)ЯÿʨÿÅ¢ÿ˨ÿÆœÿ™ÿ¿”ÿ»‘ÿ¸Œÿ·ˆÿ³‚ÿ³}ÿ³|ÿ²{ÿ²yÿ°xÿ°xÿ¯wÿ®wÿ®wÿ±xÿ¸ÿ0ÀŒÿKÇ›ÿfЬÿŒàÄÿ¶öãÿÜÿûcèÿÿ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï þôÖ~ìÞ´ÿÌÁÿ¸§nÿ½•[ÿ·‹Nÿ®„Cÿ«‚=ÿª„6ÿ§3ÿ§€1ÿªƒ4ÿ§€5ÿ©‚7ÿ¬…:ÿ®‡<ÿ­Š:ÿ¯9ÿ°“8ÿ²•:ÿ²˜Dÿ´šFÿ¿ŸFÿÇ¥HÿΨHÿЪJÿÏ®Mÿ˲PÿųZÿĵlÿûÿÈ™ÿÑ̳ÿ±¨¤ÿ”†’ÿ°¦²ÿÛÛÛnîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçèEÜÔÕ€¬¤¥ÿx™’ÿh·©ÿbêÐÿ9ܽÿ*Úµÿ%Õ°ÿ)Ϫÿ&̧ÿ%Ì¥ÿ#Ê£ÿ!Çžÿ!šÿ%Ãÿ#Á‹ÿÀŒÿ¼Œÿ·Šÿ´ˆÿ²ƒÿ±~ÿ ±xÿ µwÿ²tÿ°sÿ ¯vÿ­xÿ­wÿ°‚ÿ$¯‰ÿ>¶—ÿV¼ ÿ~űÿ±ÞÎÿäòì;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ØÖ~¸¹·ÿ©¤ƒÿž“_ÿŸŒOÿ¦ŠCÿª2ÿ¬~0ÿ³‚8ÿ®{5ÿ¥}5ÿ£€7ÿ¡ˆ2ÿ£Š4ÿ¦‹4ÿ¯Œ6ÿ¸Š<ÿ¹‹=ÿ»”?ÿ»˜Bÿ½›Gÿ½ Kÿ¿¤Mÿ©MÿÆ®JÿÍ°Mÿ̯LÿØ»XÿÕ»aÿÚÄ‚ÿØÆ—ÿÔƯÿ—†ÿ˜™ÿÈÊËÿæèé2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚßànÈÀÁÿ¥žÿ‡¨¡ÿvÅ·ÿ[ãÉÿ4׸ÿ'ײÿ#Ó®ÿ'ͨÿ$Ê¥ÿ#Ê£ÿ!È¡ÿÄ›ÿÀ˜ÿ#Á‹ÿ!¿‰ÿ½‰ÿºŠÿµˆÿ²†ÿ±‚ÿ°}ÿ ²yÿ µwÿ²tÿ°sÿ ¯vÿ ®yÿ°zÿ³…ÿ,·‘ÿJ£ÿkѵÿ™àÌÿÆóã½ìúôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíÜÝÛnÅÀŸÿ²§sÿ©–Yÿ¬Iÿ¯†7ÿ¯3ÿ²7ÿ®{5ÿ¥}5ÿ£€7ÿ ‡1ÿ¡ˆ2ÿ¥Š3ÿ®‹5ÿ·‰;ÿ¹‹=ÿ¹’=ÿ¹–@ÿº˜DÿºHÿ¼¡Jÿ¿¦JÿĬHÿË®KÿË®KÿÒµRÿδZÿÒ¼zÿÔ“ÿÒÄ­ÿ´ª£ÿž™šÿ¬®¯ÿÞàáYîíïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêïîÈÐÏ° ¨§ÿœšÿ…¿´ÿw×ÆÿJܾÿ.ѱÿ&Ò®ÿ"Ϊÿ$ˤÿ"É¢ÿ!ÈŸÿÅœÿ—ÿ½“ÿ¿ˆÿ¼†ÿ¹…ÿ´…ÿ²ƒÿ°ÿ¯}ÿ°yÿ¯tÿ°uÿ¯sÿ¯sÿ°yÿ¯}ÿ#±„ÿ;µÿ`½¢ÿ‰Ë¸ÿ§äÐÿÌ÷êÿéÿø(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäàÎʾ¢ÿµ¥{ÿ¯—cÿ«ŒGÿª„<ÿ«‚9ÿ§~5ÿ§~9ÿ¨:ÿ¤8ÿ¥‚9ÿ¨„8ÿ­†7ÿ´‰8ÿ¶‹:ÿ¶Ž;ÿµ‘=ÿµ•Bÿ¸˜Eÿ¸›Fÿ¼¡Gÿ¦GÿÅ©JÿÊ­KÿÊ­KÿÈ®TÿÍ´nÿп‡ÿÓßÿÔË°ÿ¤ž“ÿ‘‘‘ÿÌÌÌÿãááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàåäO²º¹ÿ‘™˜ÿ—¤¢ÿ‘ËÀÿzÚÉÿAÓµÿ,ϯÿ"Ϊÿ˧ÿ"É¢ÿ Ç ÿÅœÿ™ÿ¿”ÿºÿ½†ÿ¹ƒÿ¶‚ÿ±‚ÿ°ÿ®ÿ­{ÿ¯xÿ¯tÿ°uÿ¯sÿ°tÿ²{ÿ!´‚ÿ,ºÿGÁ›ÿsеÿŸáÎÿ¼ùåÿÙÿ÷yìÿûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýùç2ëßÃÜÔÄšÿëwÿ¶—Rÿ°ŠBÿ¯†=ÿ«‚9ÿ¨:ÿ§~9ÿ£€7ÿ¤8ÿ§ƒ7ÿ«„5ÿ°…4ÿ³ˆ7ÿ³‹8ÿ²Ž:ÿ±‘>ÿ³“@ÿ´—Bÿ¸Cÿ¿£Dÿ¦GÿÈ«IÿǪHÿƬRÿÆ­gÿÈ·ÿ̼˜ÿØÏ´ÿª¤™ÿÿ²²²ÿÙ××~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ×Öƒ˜©¦ÿƒŸ™ÿ€¾²ÿvÕÁÿXØ¿ÿ0Ï­ÿ,Эÿ#Ì¥ÿ!Ê£ÿ!ÇžÿÅœÿÄ™ÿÀ•ÿ¼ÿ·‹ÿºƒÿ·ÿ³~ÿ±|ÿ¯zÿ®yÿ¯wÿ®vÿ!¯tÿ"°uÿ°tÿ°yÿ´ƒÿ&¹ÿG¿œÿwȯÿ»ÙÌÿÝíæcîÿö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûòï çÞщ˿£ÿ³¡xÿ§“Zÿ§Gÿ©†Bÿ¦:ÿ§}8ÿ¨y;ÿª{=ÿ«~;ÿ«8ÿ«…3ÿ­‡5ÿ¯Š6ÿ±Œ8ÿ°=ÿ²?ÿ³“@ÿ·—Dÿ½DÿÁ¢EÿȨIÿȨIÿÈ«PÿêZÿÅ°lÿÌ»‚ÿ×É•ÿÄ»šÿ¤¤˜ÿš–ÿÎÍÉ°ìêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéçç2ÁÆÅ쎟œÿ‘­§ÿŒÊ¾ÿtÓ¿ÿMÍ´ÿ,Ë©ÿ*Ϋÿ É¢ÿÇ ÿÅœÿ™ÿÁ–ÿ¾“ÿ¹Œÿµ‰ÿ¸ÿµÿ²}ÿ°{ÿ¯zÿ®yÿ®vÿ­uÿ ®sÿ ®sÿ°tÿ²{ÿ!¹ˆÿ-À”ÿTÌ©ÿˆÙÀÿÏíàìüõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóæ2åÙ½ÿ˹ÿ¶¢iÿ­“Mÿ¬‰Eÿ§€;ÿ§}8ÿ§x:ÿª{=ÿ«~;ÿª~7ÿª„2ÿ­‡5ÿ­ˆ4ÿ®‰5ÿ®‹;ÿ°=ÿ°=ÿ´”AÿºšAÿ¾ŸBÿÅ¥FÿƦGÿÆ©Nÿ½¤Tÿ¿ªfÿƵ|ÿʼˆÿÔ˪ÿ¯¯£ÿŒˆÿ¼»·ÿÞÜÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞÜÜc«·±ÿ¤šÿ³ÿpѽÿRغÿ2άÿ$Ê¥ÿ%˦ÿ#Çžÿ!ÅœÿÄ—ÿÁ”ÿ¿ÿ¼ÿ¸ˆÿµ†ÿ³~ÿ²}ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ®rÿ­rÿ­vÿ¯yÿ%´‡ÿ=¼•ÿeêÿ’ÔÁÿÃæÜÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéë(ÕÑƽ¼²”ÿªškÿ©“Qÿ©Š?ÿ­‚9ÿ¯|6ÿ¯{9ÿ­{9ÿ¨{8ÿ¥€6ÿ©…7ÿª„2ÿ¬†4ÿ¬ˆ:ÿ®Š<ÿ°Œ>ÿ´Bÿº•Cÿ½šDÿÁžDÿàFÿŦKÿÀ¤Mÿ«[ÿÆ°hÿκsÿßÏ”ÿ½¹¡ÿ™Žÿ­¨ŸÿÍÊÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëÕÓÓƒ ¬¦ÿƒ¨žÿˆË¼ÿl͹ÿQ×¹ÿ2άÿ"È£ÿ!Ç¢ÿ"Æÿ Ä›ÿ•ÿ¿’ÿ½Žÿº‹ÿ·‡ÿ´…ÿ²}ÿ±|ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ­qÿ¯tÿ!°yÿ"´~ÿ-¼ÿIÈ¡ÿtÒ¹ÿ¥çÔÿÙüòyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðìáOÒȪÿ¸¨yÿµŸ]ÿ°‘Fÿ²‡>ÿ±~8ÿ¯{9ÿ¬z8ÿ¦y6ÿ£~4ÿ§ƒ5ÿ©ƒ1ÿ«…3ÿ«‡9ÿ­‰;ÿ¯‹=ÿ³Aÿ¸“Aÿ»˜Bÿ¾›AÿÀCÿÄ¥JÿÀ¤Mÿì\ÿ¾¨`ÿË·pÿÒ‡ÿÅÁ©ÿ³¯¤ÿ¢”ÿÀ½¸ÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååEº¼¼ÿ­¢ÿ…ƶÿu׿ÿRÖ¸ÿ/Ñ­ÿ$Ê¥ÿÇÿÈžÿ ÖÿÁ”ÿ¿ÿ½ÿ¼‰ÿ¸†ÿµÿ²ÿ °|ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ°qÿ®sÿ²wÿµƒÿ1¸ŒÿV½žÿ‡Ì·ÿ¸ÞÒÿâíêEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäßàYÈħÿµ§wÿ­œSÿ°Eÿ±‡:ÿ¬‚5ÿ©}6ÿª}:ÿ§€<ÿ¥~:ÿ¨2ÿ¨2ÿªƒ8ÿ­†;ÿ°‰>ÿ²‹@ÿ¶Aÿ¹“Aÿ¼˜@ÿ½™AÿÁŸEÿÁ¤IÿÁ¥NÿÁ§Sÿ̲^ÿÓ»oÿÍÂœÿÍÅ®ÿ—„ÿ³¯¤ÿÚÙÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÙÙ~©««ÿ‹« ÿ„ŵÿsÕ½ÿOÓµÿ+Í©ÿ!Ç¢ÿÆœÿÆœÿ•ÿÀ“ÿ¾Žÿ»‹ÿº‡ÿ¶„ÿ´€ÿ±~ÿ¯{ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ±rÿ°uÿ³xÿ#ºˆÿ9À”ÿ`Ǩÿ—ÜÇÿÊðä¥ïú÷ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÜ¿ÿÍ¿ÿ¸§^ÿ·—Lÿ´Š=ÿ¯…8ÿª~7ÿª}:ÿ¦;ÿ¥~:ÿ¨2ÿ¨2ÿ©‚7ÿ¬…:ÿ®‡<ÿ°‰>ÿ´?ÿ·‘?ÿ¹•=ÿ»—?ÿ¾œBÿ¾¡Fÿ¾¢Kÿ¾¤PÿÇ­YÿζjÿÆ»•ÿÈÀ©ÿ¥ŸŒÿ­©žÿÎÍÉ°ìíñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÈÎÍ°ž¤£ÿt² ÿlÌ´ÿ^غÿ9Ñ®ÿ!Ê£ÿÅžÿÚÿÄ—ÿÀ‘ÿ¿Œÿ¼ˆÿº†ÿ¸‚ÿ¶€ÿ³{ÿ±yÿ ­zÿ¬yÿ ±tÿ °sÿ±sÿ±sÿ²uÿ±yÿ²€ÿ4»“ÿ_Á£ÿŽÌ¼ÿÎãÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEØгÿ¿°‚ÿ³Ÿ^ÿªEÿª‡>ÿ¦7ÿ¥|3ÿ¦{8ÿ¦{8ÿ¨€5ÿ§4ÿ¨6ÿ«‚9ÿ­„;ÿ®…<ÿ±‰>ÿµŽ?ÿ·’@ÿ¸•?ÿ»›Bÿ¿ŸFÿ¾ GÿÁ£JÿÉ«RÿÒ³^ÿμ‡ÿΠÿ¾´–ÿ¬¦“ÿÀ½µÿàáåOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¾ÄÃÿ¢¨§ÿ|º¨ÿnζÿZÔ¶ÿ3˨ÿÆŸÿÄÿ™ÿÁ”ÿ¾ÿ½Šÿº†ÿ¸„ÿ¶€ÿ´~ÿ²zÿ°xÿ¬yÿ«xÿ °sÿ °sÿ °rÿ±sÿ²uÿ³{ÿ&¹‡ÿ<ÛÿkͯÿÛËÿÜñécÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøöìêâÅÊÓÄ–ÿÀ¬kÿ±–Lÿ¯ŒCÿ©„:ÿ¦}4ÿ¥z7ÿ§|9ÿ¨€5ÿ§4ÿ¨6ÿª8ÿ«‚9ÿ¬ƒ:ÿ¯‡<ÿ³Œ=ÿµ>ÿ·”>ÿ¹™@ÿ½Dÿ½ŸFÿ¿¡HÿŧNÿˬWÿǵ€ÿʾœÿÍÃ¥ÿª¤‘ÿ°­¥ÿÓÔ؃íðøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìôóÎÖÕ­¸¶ÿ¢°®ÿu˳ÿV׸ÿCÓ°ÿ*Ç¢ÿÄ›ÿÄ›ÿ!•ÿ¿ÿ¾‹ÿ¼‰ÿ¸‚ÿ¶€ÿ ´~ÿ²|ÿ³yÿ±wÿ¯yÿ¬wÿ®sÿ®sÿ­rÿ®sÿ²zÿ$´„ÿ>½–ÿhêÿšÑÂÿÐä߉ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ñìØпÿ³“ÿ¬škÿª‘Sÿ¨ŠCÿ¦7ÿ«~4ÿ­€6ÿ©€7ÿ¨6ÿª6ÿ«€7ÿ¬8ÿ­‚9ÿ®‡9ÿ±Š<ÿ°Ž;ÿ²=ÿ´•@ÿ·˜Cÿ¹›Dÿ¿œFÿÅ KÿÉ£QÿêjÿÈ·†ÿÔÈ ÿ¯¥ÿª¦›ÿÊÊÊÿéìñ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÃËÊÿ¡¬ªÿ¥³±ÿ|ÒºÿUÖ·ÿ=ͪÿ&ÞÿÚÿ™ÿ¿’ÿ½ÿ¼‰ÿº‡ÿ·ÿµÿ²|ÿ±{ÿ²xÿ°vÿ¯yÿ¬wÿ­rÿ®sÿ®sÿ¯tÿµ}ÿ*ºŠÿDÃœÿq̳ÿ§ÞÏÿÝñìcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèàÏÑ¢ÿ¸¦wÿ²™[ÿ«Fÿ§‚8ÿ«~4ÿ«~4ÿ¨6ÿ§~5ÿ©~5ÿ«€7ÿ¬8ÿ¬8ÿ¬…7ÿ¯ˆ:ÿ®Œ9ÿ±<ÿ²“>ÿµ–Aÿ¸šCÿ¾›EÿÂHÿÅŸMÿ¾¥eÿ±€ÿÒÆžÿ·­•ÿª¦›ÿÀÀÀÿàãèOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëE¹ÇÅÿ™§¥ÿ£¶³ÿfÔ¸ÿHÓ²ÿ,ɤÿ$Áœÿ"˜ÿ¿•ÿ»ÿ»ÿ»Šÿ¹„ÿ¶~ÿ³|ÿ ±zÿ°yÿ±uÿ ±tÿ °wÿ®uÿ#ªrÿ$«sÿ ­tÿ°vÿ'¸„ÿ1¿”ÿbèÿ”ÑÃÿÒã߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëØÉǽ¼¬•ÿ±›qÿ«Rÿ¨†:ÿ®‚/ÿ«,ÿ§}6ÿ¦|5ÿ©~5ÿ«€7ÿ«6ÿ«6ÿ«„6ÿ®‡9ÿ®‹;ÿ°=ÿ±‘>ÿ³“@ÿ¸–Cÿ¾˜FÿÛIÿÄœJÿÀ¤]ÿïvÿÑÁ“ÿ¸šÿ¯¬ÿ¸¸¸ÿÖÙÞ~íðõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêòñÜçåc¶ÄÂÿ—¥£ÿ¤·´ÿbдÿBͬÿ(Å ÿ"¿šÿ!Á—ÿ¼’ÿ¹‹ÿ»ÿº‰ÿ¸ƒÿµ}ÿ²{ÿ°yÿ¯xÿ±uÿ °sÿ °wÿ®uÿ#ªrÿ%¬tÿ!®uÿ!³yÿ+¼ˆÿ6Ä™ÿjË°ÿŸÜÎÿÝîêcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåÖԀɹ¢ÿº¤zÿ±•Xÿ­‹?ÿ±…2ÿ¬€-ÿ¦|5ÿ¥{4ÿ¨}4ÿª6ÿ«6ÿ«6ÿªƒ5ÿ­†8ÿ«ˆ8ÿ­Š:ÿ®Ž;ÿ°=ÿµ“@ÿ¼–DÿÀ˜FÿÁ™GÿºžWÿ»§nÿȸŠÿÅ»ÿ²¯ ÿ³³³ÿÐÓØÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÙØy©º¶ÿ…»®ÿlʲÿ@Ö²ÿ4ʦÿ*Ãœÿ&¿˜ÿ ¼“ÿ¼Žÿ¼Šÿ¸†ÿ¸„ÿ¶‚ÿµ}ÿ²{ÿ°yÿ¯xÿ®vÿ­uÿ®uÿ«rÿ®rÿ­qÿ)­xÿ/²€ÿ3·ŽÿEǦÿ´Ã»ÿÓßßÿéøú(ïþÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëáOÊǹÿ²©•ÿ¬œrÿ§ŒTÿ«ƒ1ÿª‚0ÿ¥€0ÿ¤}2ÿ¥}2ÿ§4ÿ©€7ÿ©€7ÿª8ÿ¬ƒ:ÿ®†;ÿ¯‡<ÿ±Œ<ÿ³Ž>ÿ´’>ÿ·•AÿºšAÿ¼œCÿÀMÿÌ¥aÿȲpÿÕÅ–ÿ½¸—ÿ©©›ÿËÍÕÿååñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíñÑÍÌš¢³¯ÿˆ¾±ÿrиÿ<Ò®ÿ1Ç£ÿ'À™ÿ$½–ÿº‘ÿ»ÿ»‰ÿ·…ÿ¶‚ÿµÿ´|ÿ±zÿ°yÿ¯xÿ®vÿ®vÿ°wÿ­tÿ°tÿ°tÿ-±|ÿ4·…ÿ:¾•ÿMÏ®ÿ¿ÎÆÿÛççníüþðÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôòè(×Ôƽ¾µ¡ÿµ¥{ÿ®“[ÿ°ˆ6ÿ¬„2ÿ¦1ÿ¥~3ÿ¦~3ÿ¨€5ÿ©€7ÿ¨6ÿ©€7ÿ«‚9ÿ¬„9ÿ®†;ÿ¯Š:ÿ²=ÿ²<ÿµ“?ÿ¸˜?ÿºšAÿ¼™IÿÈ¡]ÿ¬jÿÏ¿ÿ¼·–ÿ¦¦˜ÿÀÂÊÿÜÜècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõçë2¿ÂÀÿŽ°¥ÿ~ijÿlÕºÿ:Ψÿ/Ãÿ(½•ÿ%º’ÿ ¹Œÿ¸‹ÿ¹‡ÿµƒÿ´~ÿ²}ÿ²{ÿ¯yÿ¯wÿ­vÿ­vÿ­vÿ®vÿ«sÿ¯vÿ°wÿ*³ÿ=¹‹ÿK›ÿqеÿÐÛÓÿçïï2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäâØyÈIJÿ¹­‰ÿ°™gÿ¯Aÿ¬…:ÿ©6ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿ«8ÿ­‚9ÿ®ƒ:ÿ¯ˆ:ÿ±Š<ÿ²;ÿµ>ÿ¶”@ÿ¸–Bÿ»–DÿÆŸUÿÁ©aÿμ‡ÿû–ÿ«©—ÿ¹»»ÿØ×à~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòäè;¹¼ºÿ¯¤ÿ~ijÿgеÿ6ʤÿ,Àšÿ&»“ÿ$¹‘ÿ·Šÿ¶‰ÿ·…ÿ´‚ÿ³}ÿ±|ÿ±zÿ®xÿ®vÿ¬uÿ¬uÿ¬uÿ­uÿªrÿ¯vÿ²yÿ,µÿ@¼ŽÿPÇ ÿyؽÿÙäÜyìôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEÒμÿ¿³ÿ´kÿ´’Fÿ­†;ÿª‚7ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿª~7ÿ¬8ÿ­‚9ÿ­†8ÿ°‰;ÿ±Œ:ÿ³Ž<ÿ´’>ÿ¶”@ÿº•Cÿ›Qÿ¼¤\ÿȶÿƾ™ÿ±¯ÿ´¶¶ÿÕÔÝ€ïîø ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçáâO­¼¸ÿ‚µ§ÿnȱÿPÍ­ÿ,ËŸÿ#–ÿ½ÿ»ÿº‡ÿ¸…ÿ·ƒÿ´€ÿµ|ÿ³{ÿ²xÿ°wÿ®uÿ­uÿ¬tÿ¬tÿ®vÿ«sÿ¯wÿ³~ÿ,¹†ÿI¾—ÿsǪÿ¥ÙÈÿäêå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿññëÖÔÊ¥½¶›ÿ² wÿ«”Vÿ¬‡Cÿªƒ9ÿª6ÿ¨}4ÿ©~5ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ¬8ÿ­‚9ÿ¯…:ÿ±‡<ÿ±Š;ÿ³Œ=ÿ´=ÿ¶‘?ÿº”Bÿ¾˜Fÿº Tÿ¯rÿȽ‘ÿ¸³šÿ²³ªÿÓÏÔÿîëôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞØÙy¬»·ÿ…¸ªÿnȱÿLÉ©ÿ)Èœÿ!À”ÿ¼Žÿ»ÿ¹†ÿ·„ÿ¶‚ÿ³ÿ´{ÿ²zÿ²xÿ¯vÿ®uÿ¬tÿ¬tÿ¬tÿ­uÿ«sÿ°xÿµ€ÿ/¼‰ÿM›ÿwË®ÿ«ßÎÿìòíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞԀƿ¤ÿ¹§~ÿ²›]ÿ±ŒHÿ«„:ÿª6ÿ§|3ÿ¨}4ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ«€7ÿ­‚9ÿ®„9ÿ°†;ÿ°‰:ÿ²‹<ÿ³Ž<ÿµ>ÿº”Bÿº”Bÿ¹ŸSÿ»¨kÿøŒÿºµœÿ®¯¦ÿÌÈÍÿìéò(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïïï ÓÓÓƒ£¾µÿ|¾«ÿZ˯ÿ>Ê¥ÿ'Å—ÿ½ÿº‹ÿ¹Šÿ·ƒÿ¶‚ÿ¶~ÿ³{ÿ³yÿ²xÿ±uÿ°tÿ¯sÿ®sÿ®sÿ®sÿ­rÿ©sÿ°{ÿ!µ…ÿ5½“ÿUáÿ•É·ÿÎßÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ÍÉ·ÿº¯ÿ±nÿ¬Sÿ®‡<ÿ¬‚7ÿ§}2ÿ§}2ÿ©~5ÿ©~5ÿ«~5ÿ¬6ÿ­€6ÿ®7ÿ­ƒ6ÿ¯…8ÿ¯ˆ9ÿ°‰:ÿ³;ÿ´Ž<ÿº“>ÿ¹’=ÿ½ Oÿ¼¦dÿĶ‚ÿú™ÿ·¯¢ÿÊÆÅÿêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ÐÐÐÿ¥À·ÿ~À­ÿYÊ®ÿ<È£ÿ$”ÿ»ÿ¸‰ÿ·ˆÿ¶‚ÿµÿµ}ÿ³{ÿ²xÿ±wÿ±uÿ°tÿ¯sÿ®sÿ¯tÿ¯tÿ¯tÿ«uÿ²}ÿ%¹‰ÿ9Á—ÿZȦÿšÎ¼ÿÓäÛƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÕÑ¿ÿÀµ•ÿµ¡rÿ®’Uÿ°‰>ÿ­ƒ8ÿ¨~3ÿ§}2ÿ¨}4ÿ¨}4ÿ«~5ÿ«~5ÿ¬5ÿ­€6ÿ­ƒ6ÿ®„7ÿ®‡8ÿ¯ˆ9ÿ²Œ:ÿ³;ÿ¶:ÿ´8ÿ»žMÿ¸¢`ÿÁ³ÿÄ»šÿ¸°£ÿÇÃÂÿçæê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéîí(ÄÉÈÿš¼±ÿ€É³ÿJͬÿ:Ç ÿ'¾ÿ#º‰ÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ²~ÿ3»‘ÿBÀœÿfĬÿÀÑÈÿâéæEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïóÔÔÈÿ¾¶Ÿÿ¯¡}ÿ«’`ÿ²ŽBÿ©6ÿ¤|1ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿ«4ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¹‘?ÿ´•Fÿ³Uÿijzÿø’ÿ»±ŸÿÆ¿¼ÿàßãYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÃÈÇÿš¼±ÿÊ´ÿJͬÿ9ÆŸÿ&½Œÿ"¹ˆÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ ³ÿ4¼’ÿCÁÿhÆ®ÿÃÔËÿæíê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòö ÙÙ͚û¤ÿ³¥ÿ¯–dÿ´Dÿ«ƒ8ÿ¥}2ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿª€3ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¸>ÿ³”Eÿ²œTÿÁ°wÿÁ¶ÿº°žÿĽºÿÞÝácÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêé;ÁÇÂÿš¼±ÿÊ´ÿMͪÿ4Æœÿ!¾Œÿºˆÿ·„ÿ¶ƒÿ¶€ÿ´~ÿ²{ÿ²{ÿ±xÿ±xÿ°wÿ°wÿ¯vÿ¯vÿ¯vÿ®vÿ°xÿ ¯xÿ*´„ÿB¼–ÿTÀ£ÿ„´ÿÑÔÒ‰îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜÞØyÆ¿®ÿ³¨ÿ°›nÿµ•Jÿ¬‡=ÿ¥€6ÿ¦7ÿ¤5ÿ¤5ÿ§€6ÿ§€6ÿ§€5ÿ¨6ÿ©‚7ÿªƒ8ÿ©…7ÿ«‡9ÿ®Š<ÿ¯‹=ÿ²‹=ÿ¶Dÿ²’Gÿ´™VÿÁ®uÿųŽÿ»°šÿÄ»¸ÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçæE¾Ä¿ÿ™»°ÿÊ´ÿLÌ©ÿ2Äšÿ!¾Œÿ»‰ÿ¸…ÿ·„ÿ·ÿµÿ³|ÿ³|ÿ³zÿ²yÿ²yÿ±xÿ±xÿ±xÿ±xÿ°xÿ³{ÿ$³|ÿ.¸ˆÿFÀšÿWæÿ†Ä¶ÿÔ×Õ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâäÞYËijÿ¶«ÿµ sÿ¸˜Mÿ°‹Aÿ¨ƒ9ÿ¨ƒ9ÿ¦7ÿ¦7ÿ©‚8ÿ©‚8ÿ©‚7ÿªƒ8ÿ«„9ÿ¬…:ÿ«‡9ÿ­‰;ÿ¯‹=ÿ±?ÿ³Œ>ÿ¶Dÿ³“Hÿ´™Vÿ¾«rÿIJÿ¼±›ÿú·ÿÙÕÚ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿœº­ÿ„ʳÿP̨ÿ8˜ÿ+¾Œÿ'ºˆÿ$·…ÿ$·…ÿ#¶‚ÿ!´€ÿ ´~ÿ ´~ÿ³{ÿ³{ÿ³{ÿ²zÿ±{ÿ±{ÿ±{ÿ±{ÿ$³|ÿ-³~ÿ:¸ŽÿW¾Ÿÿt¿ªÿ˜Â»ÿÚ×Ù~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ËŸÿ´¬•ÿ·¥|ÿº™Tÿ®Hÿ¦…@ÿ¥„?ÿ¤=ÿ¥‚>ÿ©„@ÿ¨ƒ?ÿ§ƒ=ÿ¨„>ÿ©…?ÿª†@ÿ«‡Aÿ­‰Cÿ­‹Eÿ®ŒFÿ²‹Gÿ³ŒHÿ³’Mÿ³™Wÿ½ªqÿIJÿ½²œÿÁ¸µÿ×Ó؃ïðô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿ»®ÿ…Ë´ÿRΪÿ;Å›ÿ-ÀŽÿ*½‹ÿ'ºˆÿ&¹‡ÿ&¹…ÿ$·ƒÿ#·ÿ#·ÿ"·ÿ"·ÿ!¶~ÿ!¶~ÿ!µÿ!µÿ!µÿ!µÿ&µ~ÿ0¶ÿ>¼’ÿ[£ÿvÁ¬ÿ™Ã¼ÿÛØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéç2Ìƹÿ¶®—ÿ¾¬ƒÿ¿žYÿ³’Mÿ¬‹Fÿª‰Dÿ©†Bÿª‡Cÿ®‰Eÿ¬‡Cÿ¬ˆBÿ­‰Cÿ®ŠDÿ¯‹Eÿ¯‹Eÿ°ŒFÿ°ŽHÿ±Iÿ¶Kÿ¶Kÿ·–Qÿ¶œZÿ½ªqÿųŽÿ¾³ÿÀ·´ÿÕÑÖÿîïó ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Á¾ÿ¢¼¯ÿŒÍ·ÿVÒ®ÿKÈ ÿQÀ”ÿM¼ÿKºŽÿJ¹ÿJº‹ÿI¹ŠÿH¸ˆÿH¸ˆÿG·‡ÿF¶†ÿF¶†ÿF¶†ÿD·†ÿD·†ÿD¶‡ÿD¶‡ÿ9»†ÿ<¾‰ÿOšÿkǪÿ‹Â³ÿ¬ÂÀÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçéé2ÍǼÿ¹±šÿƳŽÿÁ¥eÿº™Zÿ³’Sÿ°Pÿ°Nÿ²Pÿ´Pÿ²ŽNÿ²ŽNÿ³Oÿ´Pÿ´Pÿµ‘Qÿµ‘Qÿµ’Rÿ¶“Sÿ¼–Vÿº”Tÿ»›Zÿº¡cÿÁ¬xÿȶ‘ÿÁ¶¢ÿÀ·³ÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Âÿÿ£½°ÿŽÏ¹ÿYÕ±ÿNË£ÿVÅ™ÿS–ÿP¿“ÿP¿“ÿPÀ‘ÿN¾ÿM½ÿN¾ŽÿM½ÿL¼ŒÿL¼ŒÿL¼ŒÿJ½ŒÿJ½ŒÿJ¼ÿJ¼ÿAÃŽÿDÆ‘ÿVÉ¡ÿqÍ°ÿÆ·ÿ®ÄÂÿÞÚßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèêê(ÎȽÿ»³œÿ̹”ÿÉ­mÿ¡bÿ»š[ÿ¸—Xÿ¸•Vÿ¹–Wÿ»—Wÿ¸”Tÿ¹•Uÿº–Vÿ»—Wÿ»—Wÿ»—Wÿ»—Wÿ»˜Xÿ¼™YÿÃ]ÿÁ›[ÿ¢aÿÀ§iÿį{ÿ˹”ÿĹ¥ÿ¹µÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞàèY¾ÀÈÿ©¼¹ÿ­Í¼ÿЪÿŒÈ ÿÚÿ{¿–ÿ|À—ÿ}Á˜ÿ{¿–ÿz¾•ÿz¾•ÿy½”ÿx¼“ÿx¼“ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿ€¼“ÿ‰½•ÿ•Ç¥ÿŸÆ­ÿ¬Ç·ÿµÅ¾ÿÖÞÝ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2ÆÁÂÿ±³ ÿº¼žÿ¼±ÿ²£rÿªœhÿ­šgÿ«™dÿ®˜dÿ±™cÿ°˜bÿ²šdÿ³›eÿ³›eÿ´œfÿ³iÿ³iÿ²iÿ²iÿµŸoÿµŸoÿ±¤pÿ±©tÿ·µ…ÿ¿½šÿº¹¤ÿ½ºµÿÖÓÕÿòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßáéY¿ÁÉÿ«¾»ÿ¯Ï¾ÿ Ó­ÿ̤ÿƒÇžÿÚÿÚÿÅœÿ~™ÿ~™ÿ~™ÿ}Á˜ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ†Â™ÿÛÿšÌªÿ¤Ë²ÿ®É¹ÿ´Ä½ÿÕÝÜ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÇÂÃÿ³µ¢ÿ¾À¢ÿÀµƒÿ¶§vÿ® lÿ°jÿ®œgÿ±›gÿµgÿ´œfÿ´œfÿ´œfÿµgÿ¶žhÿ´žjÿµŸkÿ´Ÿkÿ´Ÿkÿ·¡qÿ·¡qÿ³¦rÿ³«vÿ¹·‡ÿÁ¿œÿ¼»¦ÿ¿¼·ÿÖÓÕƒòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæâèEÆÂÈÿ½½·ÿÉͺÿÃѨÿºÈŸÿÅ¿šÿÀº•ÿÁ»–ÿ¼—ÿÀº•ÿ¿¹”ÿÀº•ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¿¹”ÿ¿¹”ÿÀº•ÿ´¿—ÿ¶Á™ÿÀË«ÿÂʳÿ¿Æ·ÿ¼ÀºÿØÛÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÅÀÁÿ²³£ÿ¼Ã¢ÿ¹µ€ÿ°¨sÿ¦¡jÿ¨žhÿ¦dÿ©œdÿªždÿ­œcÿ®dÿ®dÿ­Ÿeÿ­Ÿeÿ¬Ÿgÿ¬Ÿgÿ¬¡hÿ¬¡hÿ± mÿ°Ÿlÿ­¦mÿ­«qÿ³·ƒÿ»½™ÿ¸¼£ÿÀ¾¶ÿ×ÕÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçãéEÇÃÉÿ¼¼¶ÿÆÊ·ÿÀÎ¥ÿ¶Ä›ÿÁ»–ÿ½·’ÿ½·’ÿ¾¸“ÿ»µÿ»µÿ¼¶‘ÿ»µÿ»µÿ»µÿ»µÿ»µÿ»µÿ¼¶‘ÿ¼¶‘ÿ¼¶‘ÿ¯º’ÿ²½•ÿ¾É©ÿÁɲÿ½Äµÿ¸¼¶ÿÕØÖ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2½¾ÿ­®žÿ·¾ÿ²®yÿ¨ kÿ˜aÿŸ•_ÿ”[ÿ¡”\ÿ¡•[ÿ¤“Zÿ¥”[ÿ¥”[ÿ£•[ÿ¤–\ÿ¢•]ÿ£–^ÿ¢—^ÿ£˜_ÿ¨—dÿ§–cÿ¤dÿ¥£iÿª®zÿ³µ‘ÿ³·žÿ¾¼´ÿØÖÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçé2ÕÄÈÿÓ¹³ÿäïÿèÅšÿé¸ÿî°ˆÿꬄÿꬄÿë­…ÿ誂ÿ誂ÿ髃ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ髃ÿâ«„ÿÞ®Šÿç¾ÿáÁªÿÓ¿®ÿ¶°ÿ×ÔÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçäæ;½º¼ÿ¦ª—ÿ®¸”ÿ£¨kÿ™™]ÿSÿQÿ‹ŒNÿŒOÿ‘ŒMÿŠKÿŠKÿŠKÿŠKÿŠKÿŽ‹NÿŒOÿŒOÿŽPÿ™ŽTÿ˜Sÿ”“Vÿ–™[ÿ¦nÿ§¯‡ÿ­³šÿ¼½´ÿÙØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêìØÇËÿÔº´ÿã®ÿãÀ•ÿ㲊ÿ誂ÿã¥}ÿã¥}ÿä¦~ÿá£{ÿá£{ÿâ¤|ÿá£{ÿâ¤|ÿâ¤|ÿá£{ÿá£{ÿá£{ÿá£{ÿá£{ÿâ¤|ÿÜ¥~ÿקƒÿà·–ÿܼ¥ÿκ©ÿ¼°ªÿÑÎÉ°ðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäáãO»¸ºÿ¢¦“ÿ¦°ŒÿšŸbÿSÿ„„Hÿ‚‚Fÿ‚Dÿ„Dÿ†Bÿ„@ÿ…€Aÿ„@ÿ„@ÿ„@ÿƒ€Cÿ„Dÿƒ‚Eÿƒ‚EÿŒGÿ‹€Fÿˆ‡JÿŠOÿ’›cÿ ¨€ÿ«±˜ÿ¿À·ÿÜÛÝnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿííí×ÊÌÿܺ­ÿó½¤ÿÿ¶Šÿÿ©{ÿû¡rÿöœmÿõ›lÿöœmÿôškÿó™jÿ÷›lÿöškÿöškÿöškÿôškÿôškÿôškÿõ›lÿõ›lÿõ›lÿûœpÿûšvÿþ¬‰ÿòµ›ÿÞ´¡ÿ¿« ÿËÉÁÿêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÚÜn³´²ÿ™¢ˆÿž¨~ÿŽ•Rÿ†Cÿsz7ÿqx5ÿtv4ÿuw5ÿuw5ÿrt2ÿuv4ÿuv4ÿtu3ÿtu3ÿtv4ÿuw5ÿtx6ÿuy7ÿyw6ÿwu4ÿw|7ÿz„>ÿ…‘Wÿ—¡wÿ¦¯•ÿ¾Á¸ÿÜÞßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ×ÊÌÿÛ¹¬ÿÿû°„ÿ÷¡sÿôškÿï•fÿî”eÿï•fÿì’cÿì’cÿð”eÿï“dÿï“dÿï“dÿí“dÿí“dÿî”eÿï•fÿï•fÿð–gÿõ–jÿõ”pÿø¦ƒÿí°–ÿÚ°ÿ»§œÿÇŽÿæææ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíìðÔÓÕƒ­®¬ÿ“œ‚ÿ•Ÿuÿ„‹Hÿt{8ÿip-ÿgn+ÿjl*ÿjl*ÿjl*ÿhj(ÿij(ÿij(ÿij(ÿhi'ÿhj(ÿik)ÿhl*ÿim+ÿom,ÿmk*ÿns.ÿq{5ÿ}‰Oÿ‘›qÿ£¬’ÿ½À·ÿÞàáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÔÔÔÿؾ®ÿí¶›ÿÿ­ƒÿÿ›lÿÿ’^ÿÿ\ÿÿ[ÿÿ[ÿÿŽ[ÿÿZÿÿŒYÿÿŒYÿÿZÿÿZÿÿZÿÿZÿþŽZÿÿ[ÿÿ\ÿÿ\ÿÿ^ÿÿ–hÿÿŸxÿõªŠÿæ²›ÿ¾¤”ÿ¾½³ÿÞãáYíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëñÍÌÎÿª¬¦ÿ“ž~ÿ›kÿ‡@ÿqu.ÿjn'ÿei"ÿcg ÿfj#ÿde!ÿde!ÿcd ÿcd ÿcd ÿcd ÿcg ÿcg ÿdh!ÿdh!ÿdf ÿeg!ÿem&ÿht,ÿw†IÿŒ™mÿ¡¬’ÿÃÈ¿ÿæçë2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëóòÖÖÖÿÚÀ°ÿí¶›ÿþ¬‚ÿÿ›lÿÿ‘]ÿþŽZÿýYÿýYÿÿŒYÿþ‹XÿÿŠWÿÿ‹Xÿÿ‹Xÿÿ‹Xÿþ‹Xÿþ‹XÿýYÿþŽZÿþŽZÿÿ[ÿþ]ÿÿ“eÿÿœuÿò§‡ÿ屚ÿÀ¦–ÿ½¼²ÿÙÞÜÿíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåãéEÂÁÃÿ£¥ŸÿŽ™yÿ…‘aÿz‚;ÿmq*ÿfj#ÿaeÿ`dÿbfÿabÿabÿ`aÿ`aÿ`aÿ`aÿ_cÿ`dÿ`dÿ`dÿacÿceÿck$ÿgs+ÿw†Iÿšnÿ¤¯•ÿÆËÂÿèéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëöôÒÝÛÿ×ĵÿç¸ÿõ«‡ÿÿmÿÿZÿÿŒWÿþŠUÿÿ‹VÿÿŠVÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰UÿÿŠVÿÿ‹VÿÿŒWÿÿXÿÿXÿüWÿþ•\ÿÿšmÿü¤€ÿð°—ÿÏ©—ÿ¾¸«ÿÏÖÓÿæôó2ïýü ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÜàc¹·¶ÿ £”ÿšrÿ|ŽQÿ{4ÿjn#ÿdgÿ`cÿ^aÿ`cÿ^`ÿ^`ÿ__ÿ__ÿ__ÿ__ÿ]_ÿ]_ÿ^aÿ^aÿ]`ÿ^aÿ_hÿdo)ÿuƒIÿ™oÿ¦°™ÿÉÍÇÿêêðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîù÷ ×âà~Ûȹÿç¸ÿôª†ÿÿmÿÿZÿÿ‹VÿüˆSÿý‰Tÿÿ‰UÿþˆTÿÿˆTÿÿˆTÿÿˆTÿÿˆTÿÿ‰Uÿÿ‰Uÿÿ‹VÿÿŒWÿþŒWÿÿXÿüWÿü“Zÿý˜kÿû£ÿð°—ÿÓ­›ÿ¸²¥ÿÂÉÆÿßíìÿëùøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÕÙ€¯­¬ÿ ‘ÿ›sÿy‹Nÿx|1ÿhl!ÿcfÿ`cÿ^aÿ`cÿ]_ÿ]_ÿ^^ÿ^^ÿ^^ÿ^^ÿ\^ÿ]_ÿ]`ÿ]`ÿ\_ÿ]`ÿ^gÿdo)ÿv„Jÿœrÿª´ÿÎÒÌšîîô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝèæcÛÌÃÿâ·¢ÿíª‹ÿürÿû‘[ÿúWÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰Tÿù‰TÿúŠUÿùŒVÿúWÿúŽXÿúŽXÿõ“Sÿõ—Vÿýšfÿÿ¡~ÿÿ°•ÿä° ÿ¾«žÿ¹º¶ÿØçãÿèöõ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîëíÏÌΚ©¦¡ÿ›žˆÿ‘mÿyŒGÿxz.ÿikÿefÿbcÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ]`ÿ]`ÿ]`ÿ`aÿabÿ`h!ÿgq.ÿz‡Oÿ• xÿ°¹¤ÿÔØÓƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëEàÑÈÿ乤ÿî«Œÿÿ uÿý“]ÿûŽXÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰TÿúŠUÿû‹VÿúWÿûŽXÿúŽXÿúŽXÿö”Tÿö˜WÿýšfÿÿŸ|ÿÿ®“ÿç³£ÿ¸¥˜ÿ¯°¬ÿÏÞÚÿäòñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåâäEÄÁÃÿ¤¡œÿ™œ†ÿ™iÿv‰Dÿuw+ÿhjÿefÿcdÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ\_ÿ]`ÿ]`ÿ_`ÿabÿai"ÿis0ÿ}ŠRÿ™¤|ÿ´½¨ÿÙÝØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìðñæÕÌÿ滪ÿî«ÿý¡~ÿÿ”`ÿÿZÿûˆUÿý‡TÿþˆUÿÿ‡Uÿÿ†Tÿÿ†Tÿÿ…Sÿÿ†TÿÿˆVÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿô–Tÿö˜Vÿþ˜cÿÿxÿÿªÿñ³£ÿ¾ •ÿª©¥ÿÂÐÎÿÜêècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñíØÖÖ~¶´´ÿ ž–ÿ—›‚ÿˆ—]ÿv†?ÿrv*ÿeiÿcgÿaeÿ_cÿacÿ]aÿ]aÿ\`ÿ\`ÿ[_ÿ[_ÿ\_ÿ\_ÿ]aÿ]aÿ]^ÿ`_ÿci"ÿlu2ÿƒUÿ ¨ƒÿ¼Ã®ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïóô éØÏÿ转ÿ﬑ÿÿ£€ÿÿ•aÿÿŽ[ÿûˆUÿý‡TÿþˆUÿÿ†Tÿÿ†Tÿÿ…Sÿÿ…Sÿÿ†Tÿÿ‡Uÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿõ—Uÿö˜Vÿý—bÿÿšuÿÿ§Œÿò´¤ÿ¼ž“ÿ¨§£ÿ¶ÄÂÿÔâà€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéå;ÊÈÈÿ©§§ÿš˜ÿ”˜ÿƒ’Xÿr‚;ÿqu)ÿeiÿdhÿbfÿ`dÿacÿ]aÿ^bÿ]aÿ]aÿ\`ÿ\`ÿ]`ÿ]`ÿ]aÿ]aÿ^_ÿbaÿfl%ÿqz7ÿˆ”Zÿ¦®‰ÿÃʵÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï÷ö èãÚnàÅ·ÿá­ ÿí¦‹ÿ÷›fÿûŽ[ÿûˆVÿþ‡Vÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰Tÿÿ‹WÿÿŒXÿÿŒXÿÿXÿýZÿÿ”`ÿý”cÿü“`ÿÿ£sÿÿª|ÿð±‹ÿ㻞ÿ´¦ÿ²³©ÿÑÎÐïìõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÝÝnÀÃÁÿ˜–•ÿœŸ…ÿ›¡rÿƒAÿy0ÿsr"ÿnmÿffÿeeÿceÿbdÿ_cÿ_cÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿa_ÿa_ÿ]aÿ[dÿai-ÿpxIÿŠoÿ¬±œÿÑÕÉÿìíé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéàOèÍ¿ÿæ²¥ÿð©Žÿùhÿý]ÿü‰WÿÿˆWÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰TÿÿŠVÿÿŒXÿÿŒXÿÿXÿýZÿÿ’^ÿþ•dÿý”aÿÿŸoÿÿ¨zÿñ²Œÿå½ ÿµ§‘ÿš›‘ÿÅÂÄÿäáêOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéëë(ÌÎΚ®±¯ÿ™—–ÿ †ÿ™Ÿpÿ‹?ÿw}.ÿsr"ÿmlÿggÿffÿdfÿbdÿ_cÿ^bÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿ`^ÿa_ÿ[_ÿ\eÿem1ÿu}Nÿ‘–vÿµº¥ÿÙÝщñòî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôñé(í×Ëÿß¼®ÿí¬—ÿú¡nÿÿ’bÿü‹YÿÿˆWÿÿ†Sÿÿ†Sÿþ‰Rÿú‰Qÿø‰Qÿø‰QÿþˆTÿÿŠVÿÿŒXÿÿŒXÿþŽYÿüZÿú’]ÿÿ—bÿû•`ÿÿœkÿü¤uÿù²ŒÿﾞÿË«”ÿŸƒÿ¸´³ÿÓÖÛƒîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¸½¼ÿšŸ–ÿ› ‹ÿ¤yÿ•aÿ€Š7ÿtz(ÿpq!ÿklÿhhÿggÿdfÿbdÿ^bÿ^bÿ]`ÿ]`ÿ^aÿ]`ÿ^_ÿ^_ÿ^_ÿ^_ÿY`ÿ^i ÿjr6ÿ{‚Wÿ˜ ÿÁĵÿãæÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú÷ï õßÓƒæõÿð¯šÿþ¥rÿÿ•eÿýŒZÿÿ‰Xÿÿ†Sÿÿ†Sÿþ‰Rÿú‰QÿùŠRÿø‰QÿþˆTÿÿŠVÿÿ‹WÿÿŒXÿþŽYÿý‘[ÿû“^ÿþ–aÿü–aÿÿ›jÿú¢sÿõ®ˆÿî½ÿÖ¶Ÿÿ­‘ÿ¤ ŸÿÁÄÉÿæéî2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÔÙØ€ª¯®ÿ’‰ÿž£Žÿ™ uÿ‹“Wÿ{…2ÿqw%ÿop ÿklÿhhÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ^aÿ_`ÿ^_ÿ]^ÿ]^ÿ[bÿbm$ÿpx<ÿˆ]ÿ ¨‰ÿÌÏÀÿëîå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñåßYÛÈÀÿⱡÿù¨{ÿÿ–jÿù^ÿÿˆWÿÿ‡Qÿÿ‡Qÿÿ‰Qÿü‰PÿûŠRÿú‰Qÿý‡SÿÿŠVÿÿŒWÿÿŒWÿüYÿû‘[ÿü•^ÿý–_ÿü—`ÿÿiÿþ¢oÿø¨ÿþ·•ÿõ¿¦ÿÑ°¡ÿšŠ„ÿ¨­¬ÿÓÚ݃åîñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîñö Ýàåc½ÁÂÿ›¢›ÿŒ—}ÿ¤¬ƒÿ—¢dÿˆCÿy‚'ÿsxÿoqÿkkÿiiÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ]`ÿ\_ÿ\_ÿ\_ÿ\_ÿ[dÿdo)ÿr{Bÿ†Žeÿª±–ÿÖ×Íšòóï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ëå;ãÐÈÿè·§ÿþ­€ÿÿšnÿû`ÿÿ‰Xÿÿ‡Qÿÿ‡Qÿÿ‰QÿûˆOÿûŠRÿú‰Qÿý‡Sÿÿ‰UÿÿŒWÿÿŒWÿüYÿû‘[ÿý–_ÿü•^ÿý˜aÿÿžjÿþ¢oÿô¤{ÿù²ÿø©ÿÛº«ÿ˜ˆ‚ÿ•š™ÿ¼ÃÆÿØáäyïøû ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéî2ÏÒ×ÿ ¤¥ÿŽ•Žÿ‘œ‚ÿ¡©€ÿ’_ÿƒ‹>ÿu~#ÿqvÿoqÿllÿiiÿhhÿdfÿacÿ]aÿ]aÿ]`ÿ]`ÿ]`ÿ]`ÿ\_ÿ\_ÿ\_ÿ]`ÿ^gÿfq+ÿxHÿ‘™pÿ¸¿¤ÿâãÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôóï àÚÕ€Û¸ÿö²ÿþŸwÿõ’fÿýŠ]ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿþ•\ÿÿ–]ÿþ›aÿýgÿÿ¡lÿÿ£vÿÿ«†ÿÿ»Ÿÿñ¿©ÿ¾¡“ÿ”“‰ÿ¤©§ÿÇÒÐÿâëîEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕØà€¶¹ÁÿŽ”“ÿŒ”ƒÿŸ«ÿ¨jÿŒšHÿŠ0ÿx|ÿswÿoqÿllÿgjÿfiÿdfÿacÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ\^ÿZ^ÿ[_ÿ\`ÿ^bÿ_j$ÿgt6ÿˆUÿ §„ÿÇϸÿëíç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæàÛnâÉ¿ÿú¶‘ÿÿ¢zÿ÷”hÿþ‹^ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿý”[ÿÿ—^ÿÿœbÿüœfÿÿ¡lÿÿ¥xÿÿ¨ƒÿý³—ÿóÁ«ÿÙ¼®ÿ‘†ÿ”’ÿ·ÂÀÿÓÜ߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçìë2ÄÇÏÊž¡©ÿŒ’‘ÿ˜‡ÿ§³‰ÿ• bÿ„’@ÿ~‡-ÿw{ÿtxÿoqÿllÿhkÿfiÿceÿ`bÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ[]ÿZ^ÿ[_ÿ]aÿ_cÿcn(ÿly;ÿ‡]ÿ«²ÿÒÚÃÜòôî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÙÕÐÿ黣ÿ÷©…ÿî™sÿù‘fÿÿŠWÿÿˆQÿÿ‰Nÿÿ‰NÿýŠQÿüˆSÿý‡Tÿÿ‰VÿÿŒWÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿŸoÿÿ§zÿÿ®‰ÿÿ¿žÿù˳ÿ¹¦‘ÿ“‚ÿ¦© ÿÊÊÊ¥ìåê;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëðîÒ×Õƒ³¸·ÿ€…„ÿ’™Šÿ«±Žÿ£¬sÿŽ–Iÿ…Ž3ÿ~ƒ(ÿvwÿvwÿnr ÿknÿhkÿehÿcfÿbcÿ`aÿ__ÿ\^ÿ^`ÿ[_ÿ[_ÿ\_ÿZ]ÿZ_ÿaf!ÿ`l0ÿv‚RÿŒ—oÿ¶½¢ÿáèÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòð àÜ×~îÀ¨ÿû­‰ÿòwÿû“hÿÿŒYÿÿˆQÿÿ‰NÿÿˆMÿýŠQÿüˆSÿý‡Tÿÿ‰Vÿÿ‹VÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿžnÿÿ¦yÿÿ­ˆÿú·–ÿöÈ°ÿ×įÿœ–‹ÿŠ„ÿ­­­ÿÕÎÓöïô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñï Üáßc¼Á¿ÿ‘–•ÿ’‘ÿ›¢“ÿ¦¬‰ÿ™¢iÿˆCÿŠ/ÿ|&ÿvwÿuvÿnr ÿknÿgjÿdgÿcfÿabÿ`aÿ^^ÿ]_ÿ^`ÿ[_ÿZ^ÿ[^ÿZ]ÿZ_ÿch#ÿht8ÿ~ŠZÿš¥}ÿÇγÿìóä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãèçEåɸÿæµ›ÿ棄ÿî™qÿû_ÿü‹Sÿý‰NÿüˆMÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿŒUÿýSÿü’Uÿÿ“]ÿü•^ÿþ™bÿÿžfÿÿ hÿþ¡iÿÿ¦qÿÿ­ÿý±‡ÿÿžÿÿѲÿέ™ÿ›‹{ÿ‘ÿ¼±³ÿàÚÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàààOÊÏÍÿ™¡–ÿxpÿœ£ˆÿ®µŠÿ¦ªoÿ”™Nÿ†Œ5ÿ€†'ÿ}~ ÿwxÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ^^ÿ]_ÿ]_ÿZ]ÿZ]ÿY^ÿX]ÿ\dÿfn(ÿoyJÿ†Žoÿ©²—ÿ×ÝÊ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìñððÔÃÜﾤÿíª‹ÿòuÿý‘aÿýŒTÿÿ‹PÿþŠOÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿ‹TÿýSÿü’Uÿþ’\ÿü•^ÿþ™bÿÿžfÿÿŸgÿþ¡iÿÿ¥pÿÿª|ÿú®„ÿú¼˜ÿóŦÿçƲÿµ¥•ÿ}ÿ¤™›ÿ¼½ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáàäOÒÒÒƒ¬±¯ÿyvÿ†wÿ¦­’ÿ¯¶‹ÿ›Ÿdÿ‰ŽCÿ‚ˆ1ÿ}ƒ$ÿ{|ÿxyÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ__ÿ\^ÿ]_ÿZ]ÿ[^ÿZ_ÿZ_ÿ`h"ÿmu/ÿx‚Sÿ“›|ÿ»Ä©ÿåëØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæÝÔ€äƵÿã°–ÿè ~ÿò“gÿùWÿÿQÿþŒPÿþ‹RÿüˆSÿý†UÿÿˆWÿÿ‰Vÿÿ‹TÿÿQÿþ‘Sÿþ\ÿþ”_ÿÿ˜aÿÿœeÿûŸdÿú¢fÿù¨kÿû¬sÿÿ±|ÿÿ¹‹ÿÿ½—ÿÿαÿ廨ÿ§Šÿ“ˆ„ÿ¢žÿÇÇǽççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíØ×Ù~·¶¸ÿ‡‰ƒÿ|‚oÿ¢¬‚ÿ¶½„ÿ«µhÿ—DÿŠŽ.ÿˆ‰)ÿ€€"ÿ{{ÿvzÿrtÿlqÿjmÿfjÿdgÿcfÿbcÿ`aÿ__ÿ\^ÿ\^ÿZ]ÿ[^ÿY`ÿY`ÿaj'ÿpy6ÿ…fÿ¡§”ÿÍÕÄÊðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñèßYïÑÀì븞ÿ暈ÿö—kÿûYÿÿQÿý‹Oÿþ‹RÿüˆSÿý†Uÿþ‡Vÿÿ‰VÿÿŠSÿÿŽPÿþ‘Sÿþ\ÿý“^ÿþ—`ÿþšcÿúžcÿú¢fÿù¨kÿùªqÿÿ±|ÿý°‚ÿÿ¼–ÿÿŨÿôÊ·ÿα¨ÿ’‡ƒÿ‚~}ÿ¨¨¨ÿÎÎÎêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÔÓƒ¾½¿ÿŽÿuwqÿ£ÿ·Á—ÿ¬³zÿ›¥XÿŽ”;ÿ‡‹+ÿ‡ˆ(ÿ!ÿ{{ÿvzÿrtÿkpÿilÿeiÿcfÿbeÿabÿ`aÿ__ÿ]_ÿ\^ÿZ]ÿ\_ÿZaÿ[bÿen+ÿx>ÿŒ’sÿµ»¨ÿÞæÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìßщìıÿò²“ÿø¡uÿü”_ÿûUÿûŠQÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿþ˜cÿùbÿö£fÿôªjÿ÷­mÿÿ±vÿþ­zÿÿ¶Œÿÿº›ÿÿ˵ÿ÷ÐÂÿ±¨žÿ„}ÿŠŠŠÿ§§§ÿÌÌÌšâââEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÜÝÔ€´µ¬ÿ’’’ÿyyyÿ‰‚ÿ·½žÿ´À†ÿœ¨Vÿ’ 6ÿ”+ÿŠ‹#ÿ…†ÿ}~ÿ{{ÿvzÿqsÿjoÿgjÿdhÿbeÿadÿ`aÿ_`ÿ^^ÿ^_ÿ]^ÿ[^ÿ]`ÿ\c ÿah%ÿox5ÿ…ŽKÿ¡¥’ÿÌÒǽêòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöéÛnöλÿü¼ÿÿ¨|ÿÿ™dÿý‘Wÿü‹Rÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿý—bÿøœaÿö£fÿôªjÿ÷­mÿý¯tÿÿ²ÿÿ°†ÿÿ¶—ÿû¿©ÿöÏÁÿØÏÅÿ¥¢žÿtttÿ†††ÿ­­­ÿËËË¥ççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÙÙÙy¸¹°ÿž•ÿrrrÿÿ¦ªŸÿ°¶—ÿ£¯uÿ” NÿŠ˜.ÿ’)ÿ‰Š"ÿ‚ÿ{|ÿ{{ÿuyÿprÿinÿfiÿcgÿadÿ`cÿ_`ÿ^_ÿ]]ÿ^_ÿ]^ÿ[^ÿ^aÿ`g$ÿgn+ÿy‚?ÿ‘šWÿ¸¼©ÿàæÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìÿÿÞñöYíÙÔÿðijÿô®‘ÿú›sÿõ’`ÿûYÿû‹VÿÿˆTÿÿ‡Uÿÿ†Tÿÿ†RÿþˆTÿúUÿøSÿþ[ÿÿ]ÿÿ’_ÿþ•bÿüšdÿüŸhÿý¥iÿü©lÿÿ¯rÿý°wÿü´~ÿþ¸‰ÿÿ¿–ÿÿƤÿÿήÿÿлÿ©š‘ÿ‡zxÿ“‡…ÿ²ª«ÿÐÊË¥áÝâcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêæì2ÓÏÛ¿»Çÿ•”˜ÿtwnÿƒjÿ­´‡ÿ¿Ç†ÿ®¹cÿ¨Bÿ—8ÿŽ’+ÿˆŒ%ÿ‚„$ÿ€$ÿy{!ÿuv ÿorÿiqÿbnÿ`lÿ`fÿ``ÿ`] ÿc[ÿc]ÿc^ÿ\] ÿ`fÿYbÿVdÿ_m+ÿdr<ÿu…Uÿ˜¡†ÿÏÏÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëþÿåøý;ùåàOúνÿý·šÿÿ¥}ÿþ›iÿÿ‘]ÿüŒWÿÿˆTÿÿ‡Uÿÿ‡Uÿÿ‡Sÿÿ‰UÿúUÿøSÿýŒZÿÿŽ\ÿþ‘^ÿý”aÿû™cÿúfÿü¤hÿû¨kÿü¬oÿú­tÿù±{ÿûµ†ÿúº‘ÿÿÀžÿÿȨÿÿ˶ÿѹÿ¥˜–ÿymkÿ‰‚ÿ«¥¦ÿÏËÐ¥ÜÛßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêçé2ØÔÚ€µ±½ÿ•‘ÿlkoÿ‚yÿ¥©ÿ¹À“ÿ±¹xÿ «Uÿ—¢<ÿ’˜3ÿ‹(ÿ†Š#ÿ€‚"ÿ}~"ÿxz ÿtuÿnqÿhpÿbnÿ`lÿ_eÿ``ÿ`] ÿc[ÿc]ÿb]ÿ`aÿ_eÿYbÿZhÿes1ÿkyCÿƒ“cÿ¯¸ÿÞÞÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÜЉîÄ­ÿð°‘ÿïžxÿøeÿþŒ]ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿþŒWÿüŠUÿþ‹XÿÿZÿþ\ÿý“^ÿü–aÿüšdÿüŸgÿý¤kÿþªpÿþ­sÿþ°{ÿû´‚ÿú·Šÿú¾”ÿÿÆžÿÿɬÿý×ÅÿÛ¿´ÿ«†ÿƒpiÿ‚~ÿ¤ Ÿÿ»¿Àÿ×ÛÜ~ëðñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïíóáàâOÊËǽª­¤ÿ‡Žÿr{fÿ~‚eÿ¦ªÿ¿Ç’ÿ¸Â|ÿ£­Zÿ˜¤@ÿ’œ1ÿ‹‘&ÿ‰#ÿ„‡ ÿ~€ ÿ|{#ÿux"ÿqs!ÿkoÿimÿbjÿaiÿ_dÿ`^ÿa\ÿa\ÿ`]ÿ_]ÿ_bÿ]cÿXbÿal&ÿnyAÿx‚Wÿ™¤„ÿÌÒ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëßYýÓ¼ÿúº›ÿõ¤~ÿý•jÿÿŽ_ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿý‹VÿúˆSÿýŠWÿÿŒYÿý[ÿü’]ÿú”_ÿû™cÿûžfÿû¢iÿý©oÿþ­sÿþ°{ÿù²€ÿ÷´‡ÿöºÿþÁ™ÿüħÿò̺ÿìÐÅÿæËÁÿ®›”ÿ„yuÿwsrÿ•™šÿ®²³ÿÉÎÏ°Üáâcéîí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæãìEÕÓÙƒÁÀÂÿ¡¢žÿ‚yÿqxkÿw€kÿ°´—ÿ¼À—ÿµ½ˆÿ£­gÿ˜¢Oÿ‘9ÿ‹•*ÿˆŽ#ÿ‡‹!ÿƒ†ÿ}ÿ{z"ÿtw!ÿpr ÿimÿgkÿaiÿ`hÿ^cÿ`^ÿa\ÿ`[ÿ_\ÿ^\ÿ_bÿ^dÿ^hÿit.ÿz…MÿŒ–kÿ²½ÿãéÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéåÚnçɶÿè°—ÿô£‚ÿø’hÿú‹[ÿúˆSÿû‰TÿúˆSÿû‰TÿÿˆVÿÿ†Tÿÿ‹TÿÿŒUÿÿZÿþ‘[ÿý“^ÿü–aÿÿ›eÿþžhÿÿ¤lÿÿ©pÿÿ®uÿý¯zÿø²}ÿù¶…ÿû¾Œÿþ˜ÿûàÿÿϳÿÿÖ¾ÿðϼÿ®™Šÿƒxpÿxtoÿ‡Šˆÿ¤«¨ÿÁÆÇÿ×ÜÝ~ãåæEîðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñöíèìç2ÛÜànÏÐÔº¹½ÿ˜—›ÿvwmÿko\ÿ†Œuÿ¬´ŒÿÅ͆ÿ¿Èqÿ­¸\ÿŸ©Eÿ—¢4ÿ‘™'ÿ‹’ÿ‰ÿ‡Œÿ‚„ ÿ}~ ÿzy#ÿsv!ÿnoÿflÿdhÿaeÿ`cÿ`aÿ_^ÿ_]ÿ^\ÿ]^ÿ]^ÿ[_ÿ^gÿbl)ÿlw?ÿ„Ždÿ¢«‘ÿËÒÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöòç2õ×ÄÊô¼£ÿý¬‹ÿÿšpÿÿ`ÿý‹VÿüŠUÿû‰Tÿû‰TÿÿˆVÿÿ†TÿþŠSÿÿŒUÿÿŽYÿýZÿü’]ÿú”_ÿý™cÿüœfÿÿ£kÿÿ§nÿý¬sÿü®yÿø²}ÿøµ„ÿù¼Šÿú¾”ÿùÁžÿûÉ­ÿ÷˳ÿôÓÀÿäÏÀÿ´©¡ÿ~zuÿgjhÿx|ÿ•š›ÿ²·¸ÿÈÊËÿÖØÙ~éæè2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöúï ðôé(âçÞYÓ×Òÿ¹º¾ÿ¦§«ÿŠ‰ÿqptÿstjÿŒ}ÿ«±šÿÁÉ¡ÿ¶¾wÿ®·`ÿŸªNÿ•Ÿ;ÿš,ÿ—%ÿ‹’ÿ†ÿ…Šÿ€‚ÿ{|ÿxw!ÿqtÿmnÿdjÿbfÿ`dÿ_bÿ_`ÿ_^ÿ_]ÿ_]ÿ^_ÿ^_ÿ\`ÿaj!ÿhr/ÿu€Hÿ•Ÿuÿ¼Å«ÿáèÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéàOå̼ÿ趟ÿð¦‚ÿû˜lÿüZÿÿXÿÿŠSÿÿŠSÿÿ‰VÿþˆUÿþŠQÿÿŒSÿÿŒUÿþŽZÿýŽ\ÿü‘^ÿÿ•bÿÿ™eÿÿ iÿÿ¤lÿÿ©pÿÿ®tÿþ±xÿÿ¶|ÿþ¼ÿþ¾‡ÿÿÂÿÿÆšÿÿͤÿ÷ʨÿÿãÉÿîÓ¿ÿ®ÿ‘‚yÿsjaÿuojÿ‰…€ÿ¥£¢ÿº»¹ÿÍÌΚÞßãYëìðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîòíáçâOÔÚÕÿÀÄÅÿ«¯°ÿ•—˜ÿ{xzÿgd_ÿzxfÿ¨©‡ÿÉËÿÃÇ“ÿ³ºqÿ±»Qÿ§­@ÿ¤5ÿ•ž*ÿ—"ÿŽ–!ÿŽ“ ÿ„‡ÿ‚†ÿ}~ÿuwÿsr!ÿlpÿhkÿciÿaeÿbcÿ``ÿ__ÿ^^ÿ\_ÿ]`ÿ[bÿ[bÿ]eÿdm.ÿp{Cÿˆ‘iÿ¯¶›ÿÖÜщïòö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøßÏöÄ­ÿ÷­‰ÿÿqÿÿ”^ÿÿZÿÿŒUÿÿŠSÿÿŠWÿÿ‰Vÿý‰Pÿÿ‹Rÿÿ‹TÿýYÿü[ÿû]ÿþ“`ÿý—cÿÿfÿÿ hÿþ¥lÿþªpÿü¯vÿý´zÿú¸}ÿù¹‚ÿü½Šÿú½‘ÿýÇžÿýЮÿïÊ°ÿ÷ÜÈÿîÚÉÿÏÀ·ÿ§ž•ÿ|vqÿgc^ÿrpoÿ†‡…ÿ Ÿ¡ÿ¼½ÁÿÏÐÔãâæEêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíáåàOÓ×Òƒ¿ÅÀÿ«±¬ÿ“”ÿuyzÿdfgÿgdfÿ}zuÿ©§•ÿÇȦÿÆÈšÿ²¶‚ÿª±hÿ£­Cÿš 3ÿ˜Ÿ0ÿ— ,ÿ• ÿˆÿ‹ÿ†‰ÿ€„ÿ{|ÿrtÿpoÿjnÿfiÿagÿ`dÿabÿ``ÿ^^ÿ^^ÿ\_ÿ^aÿ[bÿ\cÿfn'ÿmv7ÿ~‰QÿŸ¨€ÿÊѶÿìòç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðïå;ðÚÈÿë¿¢ÿﮈÿõšmÿý]ÿÿYÿÿYÿýYÿüŒXÿü‰Pÿþ‹RÿüUÿýYÿûŒZÿü[ÿý]ÿÿ’_ÿÿ™cÿÿfÿÿ¢hÿÿ§lÿÿ¬oÿÿ°sÿÿ¶zÿÿº~ÿü½€ÿýÁ†ÿýÃÿþŘÿüÉ¡ÿÿϯÿÿؽÿÿÝÊÿùØÅÿÅ«›ÿˆyÿ…wkÿtkbÿvsnÿ‘‹ÿ¡¤¢ÿº¹½ÿÈÇ˽×ØÜ~âãçEæéí2ìïóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçæê2ÔÝЉÎ×Ê¥¿ÅÀÿ¤§«ÿ”•Ÿÿ‚~‰ÿfclÿnhmÿxvlÿ™˜~ÿ¿¿‘ÿÎÏ‘ÿÆÊxÿ¹¾[ÿ¯·Eÿ­±@ÿ ¥2ÿšŸ,ÿ”™&ÿ‘–#ÿ“"ÿ‹Ž!ÿ†‡ÿ„„ ÿ}}ÿzyÿrsÿnmÿhlÿgjÿciÿ_cÿcdÿ_`ÿ_cÿ^bÿ\cÿZaÿW`ÿak)ÿdo1ÿu€Nÿ‘šrÿ¿Ä©ÿåëÚnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø÷íÿëÙyüгÿú¹“ÿû sÿÿ–cÿÿ’^ÿÿŽZÿþŽZÿÿ\ÿÿŒSÿþ‹RÿùŠRÿù‰UÿùŠXÿü[ÿý]ÿÿ’_ÿÿ—aÿÿ›dÿÿ fÿÿ¥jÿþ«nÿÿ¯rÿþµyÿþ¸|ÿý¾ÿýÁ†ÿýÃÿüÖÿ÷Äœÿ÷Ʀÿù̱ÿ÷ϼÿûÚÇÿòØÈÿéÔÅÿÅ·«ÿŒƒzÿjgbÿlpjÿx{yÿŒÿ£¢¦ÿ¸¹½ÿÂÃÇÿÊÍÑÿÙÜàyâçèEãèéEêïðíòóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëêîæåé;ßÞâYÒÑÕ‰ÆÅÉÊÀɼÿ£¬Ÿÿ•›–ÿƒ†Šÿijtÿ_[fÿifoÿŒ†‹ÿ¾¼²ÿÅĪÿÉÉ›ÿÂÃ…ÿ¶ºhÿ¬±Nÿ£«9ÿŸ£2ÿ› -ÿ–›(ÿ‘–#ÿŽ“ ÿ‹ÿ†‰ÿ‚ƒÿ€€ÿxxÿutÿopÿnmÿimÿfiÿ`fÿ]aÿ^_ÿ^_ÿ_cÿ\`ÿ[bÿ^eÿ]fÿeo-ÿq|>ÿ‰”bÿ­¶ŽÿÚßÄÊõûêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïæÒƒìÈ°ÿæ«‹ÿòœxÿù•kÿø^ÿ÷Zÿÿ“_ÿÿ’\ÿûŽXÿö‰Uÿõ‡Wÿ÷‰Yÿû]ÿý]ÿþ‘^ÿÿ–]ÿÿ™`ÿÿbÿÿ¢fÿÿ¦kÿÿ«oÿÿ°vÿÿµzÿþ»~ÿþ¿‚ÿÿˆÿÿÄŽÿÿÓÿÿÆ™ÿÿÈ ÿÿ̧ÿÿÑ­ÿÿÕ´ÿÿÞÂÿýÞÅÿâʶÿ½­œÿŒ†sÿaXNÿe\Yÿypmÿ‰†ÿ¡š—ÿª¦¥ÿ´µ³ÿÁÄÂÿÊÍËÿÎÓÒÿÒ×ÖƒÙÞÝyÞãâYãçèEæêë2êîïìðñðïëðïëìíëëìêíííïïï éëì(ãåæEàâãOÚÜÝnÖÖÖ~ÐÐЉÊËÉÿ½¾¼ÿ®­©ÿ Ÿ›ÿ‹‹‘ÿssyÿdfgÿWUTÿa_Wÿ™™ÿÄÅžÿÇÊ“ÿÏÔ‰ÿÉÐuÿ¿Æ]ÿ´¼Gÿ¬³:ÿª®1ÿ¥¨*ÿ £%ÿ˜œ+ÿ”—*ÿ“&ÿŽ&ÿ†ˆ$ÿ‚"ÿ}|!ÿ|z"ÿvw!ÿpoÿikÿggÿdgÿbeÿ_dÿ`dÿ]^ÿ`aÿ`dÿX_ÿXaÿ[f ÿ_h)ÿgp=ÿz„Yÿ ¦‡ÿÉϸÿñòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøä;ÿÜÄÊù¾žÿþ¨„ÿÿ›qÿû’aÿù‘\ÿÿ”`ÿÿ—aÿÿ”^ÿûŽZÿøŠZÿøŠZÿúŒ\ÿü\ÿý]ÿÿ”[ÿÿ–]ÿÿš_ÿÿžbÿü¢gÿþ¨lÿÿ­sÿý±vÿú·zÿú»~ÿþ¾„ÿÿÁ‹ÿÿÁ‘ÿÿÄ—ÿÿÆžÿÿɤÿÿÕ±ÿþÑ°ÿøѵÿøÙÀÿùáÍÿîÞÍÿÇÁ®ÿž•‹ÿ›’ÿtkhÿWPMÿ_XUÿtpoÿ‚€ÿ“‘ÿ¡¤¢ÿ¦«ªÿ¬±°ÿµº¹ÿ¾ÃÂÿÅÉÊÿÉÍÎÿÍÑÒÿÏÓÔÿÔÓÏÿÕÔÐÿÓÔÒÿÒÓÑÿÓÓÓÿÓÓÓÿÉËÌÿÀÂÃÿ¾ÀÁÿ³µ¶ÿ©©©ÿ¢¢¢ÿ—˜–ÿ†‡…ÿvuqÿkjfÿTTZÿZZ`ÿwyzÿ“‘ÿ£¡™ÿÀÀ¨ÿÎϨÿÁÄÿ¶»pÿ³º_ÿ®µLÿ¨°;ÿ£ª1ÿ£§*ÿ¡¤&ÿž¡#ÿ”˜'ÿ‘”'ÿŽ‘$ÿ‹Œ$ÿ„†"ÿ~ÿzyÿzx ÿtuÿonÿhjÿggÿcfÿ_bÿ^cÿbfÿcdÿbcÿbfÿ[bÿ[dÿ_j$ÿir3ÿy‚Oÿ“rÿ½Ã¤ÿáçЉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõðç2ëÖǽ廤ÿ榇ÿî™qÿý“dÿû‘bÿÿ˜gÿÿ—fÿþ”eÿúaÿù]ÿ÷‹[ÿùŒXÿùŒXÿþ‘Yÿÿ’Zÿÿ—\ÿþš_ÿÿžfÿÿ¡lÿÿ¦sÿý©uÿÿ³zÿÿ¶|ÿÿºÿÿ½„ÿÿ¿ˆÿÿŠÿÿÆŽÿÿÈ”ÿüÆ‘ÿþË™ÿÿÑ¡ÿüЧÿùÓ°ÿÿÜÀÿÿæÎÿÿèÓÿåË»ÿ´œÿ’znÿ‹xkÿ‡wjÿsg]ÿj`Vÿnf_ÿrpfÿzvqÿ†ƒ~ÿ’Žÿš–•ÿžš™ÿ œ›ÿ¡œÿ¥£¢ÿ§¥¤ÿ¥¦¤ÿ¡¢ ÿžŸÿ›œšÿ“—’ÿŒ‹ÿƒ‡ÿ{vÿswkÿkq`ÿciVÿ`fSÿfnWÿsv`ÿzzhÿ‰wÿ®¯ÿÑÕ¡ÿØÞ—ÿÊÓxÿÁËaÿ¾ÉOÿ´Â>ÿ±¼8ÿ«³0ÿ¤¬)ÿŸ¥(ÿ› 'ÿ˜›'ÿ—™(ÿŽ”%ÿ‹%ÿˆ‹$ÿ…†$ÿ€"ÿyyÿtuÿsr!ÿkmÿjjÿgjÿghÿdfÿ`aÿ``ÿccÿgi#ÿacÿ`dÿ]eÿ_h%ÿdm5ÿu|Oÿ‘˜wÿ¸½¨ÿÞßÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÛnúйÿö¶—ÿø£{ÿÿ—hÿúaÿÿ–eÿÿ—fÿÿ—hÿÿ•fÿý‘aÿù]ÿùŒXÿø‹WÿýXÿþ‘Yÿü”Yÿû—\ÿü›cÿüžiÿû¢oÿù¥qÿü¯vÿü³yÿþ·~ÿýºÿþ½†ÿþÁ‰ÿÿÅÿÿÇ“ÿÿÉ”ÿþË™ÿýÏŸÿüЧÿöЭÿôϳÿôÒºÿõÖÁÿ÷ÝÍÿõÝÑÿöÞÒÿæÓÆÿ¿¯¢ÿŽ‚xÿpf\ÿf^Wÿig]ÿkgbÿmjeÿokjÿqmlÿuqpÿyutÿ|xwÿtrqÿusrÿstrÿrsqÿpqoÿpqoÿptoÿqupÿhlfÿek`ÿ`dXÿY_NÿZ`Mÿoubÿ–ž‡ÿº½§ÿÍÍ»ÿÓϽÿÄÅ¥ÿ¼ÀŒÿ¼Â{ÿ·Àeÿ°ºPÿ§²8ÿ¥³/ÿ¢­)ÿž¦#ÿœ¤!ÿ£&ÿ› 'ÿ—š&ÿ“•$ÿ‹‘"ÿˆŒ"ÿ„‡ ÿ‚ƒ!ÿ}~ ÿxxÿrsÿqpÿkmÿiiÿcfÿabÿacÿcdÿhh"ÿkk%ÿjl&ÿacÿaeÿai"ÿen+ÿmv>ÿ†`ÿ«²‘ÿØÝÈ°õöíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçÚnòζÿô³”ÿÿsÿÿ”jÿú“fÿü•hÿÿ˜kÿÿ™lÿÿ™iÿþ•bÿü’]ÿýXÿý‘Wÿý‘Wÿý’Xÿû”]ÿü˜bÿü›iÿûoÿú qÿþ¨rÿþ¬uÿþ±yÿÿ¶~ÿü½ÿýÁ…ÿúLjÿýÊ‹ÿüÌŒÿýÍÿüÌ’ÿÿÍ›ÿÿѦÿÿϬÿÿбÿÿÔ¸ÿùÓ»ÿüÙÅÿÿÞÇÿùÙÆÿîÓ¿ÿæͽÿß˺ÿØǺÿɹ¬ÿº®¤ÿ¥›‘ÿŽ‚|ÿxngÿk_]ÿeZVÿcWWÿ\ZZÿZXXÿWWWÿZZZÿ[\Xÿ\]Yÿ`d^ÿgmbÿ†wÿ‘š†ÿª³™ÿ·Á£ÿ¸Ã¢ÿ·ÄžÿºÈŸÿÃÍ¢ÿÃЀÿÈÔpÿ½Ëaÿ½ÊWÿ¸ÆHÿ­¹7ÿ­µ2ÿ«°-ÿ©«0ÿ¤¤.ÿ Ÿ/ÿ Ÿ/ÿœ¡.ÿ—œ)ÿŽ™ÿŠ•ÿˆÿ„‰ ÿ}„ÿ{€ÿy| ÿuwÿorÿnoÿilÿfhÿ`bÿ]^ÿcdÿnm)ÿsq0ÿsq0ÿfi$ÿadÿcg%ÿfn/ÿqy=ÿ‚Š[ÿ¤©‰ÿÍÒ½ÿìîè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþøëÿâÊ¥ÿ£ÿÿ¨~ÿÿžtÿú“fÿü•hÿÿ˜kÿÿœoÿÿŸoÿÿjÿÿ™dÿÿ”\ÿý‘WÿüVÿü‘Wÿú“\ÿú–`ÿú™gÿúœnÿøžoÿú¤nÿú¨qÿû®vÿý³{ÿùº~ÿù½ÿõƒÿöÄÿúÊŠÿýÍÿüÌ’ÿýʘÿþË ÿþÈ¥ÿýǨÿþÌ°ÿõÏ·ÿóмÿõÓ¼ÿóÓÀÿõÚÆÿùàÐÿ÷ãÒÿðßÒÿêÚÍÿáÕËÿÖÌÂÿË¿¹ÿÁ·°ÿ»¯­ÿº¯«ÿ»¯¯ÿ³±±ÿ­««ÿ¨¨¨ÿªªªÿ¨©¥ÿ¥¦¢ÿ¥©£ÿ¬²§ÿ°·¨ÿµ¾ªÿ¾Ç­ÿÁË­ÿÁÌ«ÿ¼É£ÿµÃšÿ²¼‘ÿ¶Ãsÿ¸Ä`ÿ¬ºPÿ¬¹Fÿ¦´6ÿ¥±/ÿ­µ2ÿ¤©&ÿ£¥*ÿ¡¡+ÿž-ÿœ›+ÿ”™&ÿ”!ÿ‹–ÿŒ—ÿ…ÿ„ÿxÿv{ÿuxÿrtÿloÿjkÿbeÿbdÿacÿdeÿop(ÿ{z6ÿyw6ÿpn-ÿ`cÿadÿhl*ÿnv7ÿ‰Mÿž¦wÿÆË«ÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôìöÞØyÚÀ¹ÿТšÿý¢kÿøfÿò™gÿ÷œoÿýyÿÿ›xÿÿ›yÿÿœzÿÿ—nÿþ•iÿó“^ÿïXÿó’Xÿû—]ÿÿ˜_ÿÿ˜_ÿÿžjÿÿ£nÿÿ¨qÿÿ¬uÿÿ°xÿÿ³{ÿÿ¸}ÿÿ»ÿÿÀ…ÿÿÇÿÿÈ‹ÿÿÊ‘ÿüÍ•ÿûЗÿúÒ˜ÿûÓ™ÿþÒÿÿÒ¢ÿÿÖ¥ÿÿתÿÿÙ­ÿÿÙ²ÿÿÚ³ÿÿÚ·ÿÿÞ»ÿÿß¾ÿÿàÂÿÿáÊÿþãÏÿýã×ÿûäÜÿøäßÿóäáÿñâßÿòæÚÿïèÏÿêäÁÿåã³ÿàâ§ÿÛÝ—ÿÕ؈ÿÓÕ|ÿÑÔqÿÐÒhÿÈÌ[ÿÆÈPÿÁÄFÿº½?ÿ»½Aÿ¶¸<ÿ°²6ÿ¬®2ÿ©«0ÿ§©.ÿ¤§,ÿ¢¤-ÿ¢¦/ÿž¡.ÿ—›*ÿ”—*ÿ’”*ÿ‘*ÿ‹Œ%ÿ‡†$ÿ}€*ÿwz$ÿqvÿpuÿltÿiqÿenÿekÿ`eÿeg%ÿkl.ÿst6ÿ{|<ÿ|}=ÿor-ÿ_cÿMeÿZr$ÿav8ÿw†Zÿš¤†ÿÀĸÿåèæ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõï ÷ÝÖ~ë½µÿÿ²{ÿÿ¦oÿô›iÿõšmÿýyÿÿž{ÿÿ{ÿÿ{ÿÿžuÿÿžrÿþžiÿ÷˜`ÿõ”Zÿø”Zÿÿ”[ÿÿ•\ÿþ›gÿüžiÿÿ¢kÿÿ¦oÿÿ«sÿÿ°xÿÿ·|ÿÿ»ÿÿ¾ƒÿÿÀ„ÿûćÿûÆÿ÷ÈÿöË’ÿöΔÿøЖÿúΙÿûÍÿùПÿûѤÿùÒ¦ÿûÒ«ÿúÓ¬ÿûÓ°ÿý×´ÿûØ·ÿûÙ»ÿúÚÃÿøÝÉÿøÞÒÿöß×ÿôàÛÿïàÝÿìÝÚÿëßÓÿåÞÅÿÝ×´ÿÖÔ¤ÿÎЕÿÈÊ„ÿÀÃsÿ¾Àgÿ½À]ÿ¼¾Tÿ·»Jÿ¸ºBÿ¶¹;ÿ±´6ÿ°²6ÿ¬®2ÿ¨ª.ÿ¥§+ÿ¤¦+ÿ£¥*ÿ £(ÿŸ¡*ÿ™&ÿ˜›(ÿ”˜'ÿ‘”'ÿŒŽ$ÿ†‡ ÿ‚ƒÿ€ÿwz$ÿvy#ÿtyÿqvÿjrÿfnÿdmÿgmÿlq&ÿqs1ÿ~Aÿ‰ŠLÿ…†Fÿtu5ÿeh#ÿ_cÿ[s%ÿkƒ5ÿwŒNÿ•¤xÿ¿É«ÿäèÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóìøØÓƒîèÿí°ÿè›zÿõ”rÿÿ™sÿÿ uÿÿ¤vÿý¥vÿó©yÿó©yÿó¦xÿñ sÿ÷™nÿþ”kÿÿ’gÿÿeÿõ–dÿø™gÿúžiÿþ¢mÿÿ§pÿÿ«sÿÿ¯uÿÿ±vÿÿ·|ÿÿº~ÿÿ½‚ÿÿÁ…ÿÿĉÿÿÈÿÿÌÿÿÎ’ÿÿÍ”ÿÿ͘ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿРÿýÒŸÿþÒ£ÿüÒ£ÿýÒ§ÿýÕ«ÿüÖ´ÿûÙ¼ÿûÚÆÿýÜÌÿøÞÐÿîáÓÿëÞÐÿéáÄÿåß²ÿÙÙ™ÿÔÕ…ÿÊÐqÿÄË\ÿºÃNÿ¶¾Aÿ²»<ÿ²¸5ÿ­´.ÿ­´.ÿ®³.ÿª¯*ÿ¨¬+ÿ¦ª)ÿ¤¨'ÿ£§&ÿ¡¥'ÿ £(ÿœ¡&ÿšž'ÿ•›&ÿ“—&ÿŽ“&ÿŠŽ%ÿ†Š#ÿƒ†#ÿ€ƒ ÿ~!ÿqw ÿos!ÿkoÿhkÿghÿjj$ÿqq+ÿxv5ÿ€>ÿƒ„BÿˆŒJÿ‡‹Iÿu|9ÿbi&ÿ[d!ÿbk(ÿdv;ÿ{ˆZÿ“ zÿ»ÄªÿåêÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìç2ÿÛÀìÿÅ¥ÿö©ˆÿú™wÿÿ—qÿÿrÿÿ¤vÿÿ¨yÿõ«{ÿôªzÿô§yÿø§zÿÿ¦{ÿÿ¤{ÿÿrÿÿ–kÿ÷˜fÿ÷˜fÿöšeÿøœgÿú iÿú¥mÿüªpÿû­rÿÿ³xÿþ¶zÿý¹~ÿý¾‚ÿýÁ†ÿýÅŠÿÿÉÿÿËÿÿË’ÿÿÌ—ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿÏŸÿüÑžÿýÑ¢ÿúСÿûÐ¥ÿúÒ¨ÿúÔ²ÿù׺ÿùØÄÿüÛËÿ÷ÝÏÿîáÓÿëÞÐÿéáÄÿäÞ±ÿÖÖ–ÿÏЀÿÄÊkÿ¼ÃTÿµ¾Iÿ±¹<ÿ¬µ6ÿ­³0ÿ©°*ÿª±+ÿ¬±,ÿ©®)ÿ§«*ÿ¦ª)ÿ¤¨'ÿ£§&ÿ ¤&ÿž¡&ÿ™ž#ÿ—›$ÿ‘—"ÿŒÿ…Šÿƒ‡ÿ‚†ÿ€ƒ ÿy|ÿtuÿkqÿjnÿhlÿjmÿqr(ÿ||6ÿ……?ÿŠˆGÿNÿ‘Oÿ‡‹Iÿvz8ÿcj'ÿ^e"ÿfo,ÿqz7ÿs…Jÿ‘žpÿ¶ÃÿàéÏøýî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúîî ïÚÜníÁ´ÿë«’ÿò wÿóŸoÿ÷¥nÿüªsÿõ®|ÿôª€ÿô¨„ÿõ¨ˆÿýª‹ÿÿ«ÿÿ¨†ÿý¤ÿû£tÿø qÿñœlÿî™iÿï›gÿóŸkÿø¦oÿüªsÿü­tÿþ¯vÿÿ³zÿÿ¶}ÿÿ»ÿÿ½ÿÿÀ„ÿÿÁ…ÿþÇŠÿýÊŒÿþÍÿÿÐ’ÿþÒ“ÿþÒ“ÿþÔ“ÿþÔ“ÿþÕ–ÿÿÕšÿýÖŸÿýקÿüÙ±ÿýÜ»ÿÿàÁÿÿßÌÿòßØÿîÛÔÿìÞÂÿçÛ«ÿØÔÿÎÍrÿÃÇVÿ»À?ÿ²º1ÿ¬´+ÿª±(ÿ¨¯&ÿ¦ª)ÿ¨ª.ÿ¨ª3ÿ¥§0ÿ£¨'ÿ¢§&ÿŸ§%ÿœ¢%ÿ˜ $ÿ”š#ÿ–#ÿ“$ÿˆŽ#ÿ…‰"ÿ€„$ÿ}€$ÿw|!ÿsv ÿkqÿgkÿhpÿot)ÿxy5ÿ~Bÿ‰‚Pÿ‘ŠXÿ”ŽYÿ”ŽYÿ—–ZÿŽŽNÿ|<ÿhr,ÿ^h&ÿ_l.ÿn}@ÿ}‡Xÿ—žƒÿ½À±ÿàäØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïñ ÿÜÏÿÄ«ÿÿ°‡ÿø¤tÿô¢kÿö¤mÿö¯}ÿù¯…ÿû¯‹ÿù¬Œÿýª‹ÿÿªŒÿÿ®Œÿÿ°‹ÿÿ°ÿÿ­~ÿÿªzÿû¦vÿù¥qÿö¢nÿô¢kÿò iÿô¥lÿö§nÿø«rÿû®uÿü´xÿÿ·{ÿÿ»ÿÿ½ÿøÁ„ÿøŇÿùÈŠÿüËÿúÎÿûÏÿúÐÿûÑÿüÓ”ÿüÒ—ÿúÓœÿùÓ£ÿùÖ®ÿúÙ¸ÿýÞ¿ÿýÝÊÿïÜÕÿìÙÒÿêÜÀÿåÙ©ÿ×ÓŒÿÍÌqÿÃÇVÿ»À?ÿ¯·.ÿ©±(ÿ§®%ÿ¦­$ÿ£§&ÿ£¥)ÿ¢¤-ÿŸ¡*ÿž£"ÿ¢!ÿš¢ ÿ— ÿ’šÿŽ”ÿŠ‘ÿˆŽÿ‡ÿ€„ÿ{ÿuxÿnsÿorÿu{$ÿ{-ÿ~†3ÿ‰ŽCÿ“”Pÿ•”Xÿ˜‘_ÿ›”bÿœ–aÿš”_ÿ”“Wÿ?ÿjo*ÿcm'ÿeo-ÿkx:ÿƒ’Uÿž¨yÿÅ̱ÿéìÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêâÕ€ãγÿ⸕ÿæ¨ÿôœwÿÿ¢ÿÿ©†ÿÿ­ÿÿ°ÿú°Žÿó±Žÿò´Žÿô¶ÿÿ¶ÿÿ·ÿÿ·ÿÿ·ÿÿ¶Šÿø¯ƒÿó¨zÿî£uÿñ¥tÿò¦uÿó¨tÿô©uÿø¬wÿû¯zÿÿ³~ÿÿµ€ÿú¹‚ÿü»„ÿþ¿…ÿÿÁ‡ÿþŇÿÿljÿÿˈÿÿ̉ÿÿ΋ÿÿÍŽÿÿÎ’ÿÿÏ›ÿÿÑ¥ÿÿÔ°ÿÿÙ·ÿÿÙÂÿîÙÑÿëÖÎÿéÙ¼ÿåצÿØЊÿÐËpÿÇÆXÿ¾½Cÿ²´2ÿ¬®,ÿ§¬)ÿ¤§)ÿŸ¡)ÿž-ÿ››/ÿ——+ÿ“š'ÿ’™&ÿ•$ÿŒ‘$ÿ‡Œ#ÿ„ˆ#ÿ…&ÿ€‚(ÿuz%ÿux(ÿtx,ÿtw/ÿvz3ÿ~€>ÿŠŒJÿ“”Vÿ”œ]ÿ˜žcÿ›Ÿdÿœšdÿ›™cÿ›eÿš˜^ÿ“‘WÿEÿlq4ÿ`f+ÿfo7ÿp{Iÿ‚Ždÿ¤µŠÿÈÔ¶ÿéêæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷êûæË¥øΫÿóµŒÿû£~ÿþšwÿÿ¢ÿÿªŒÿÿ³“ÿÿ¸–ÿû¹–ÿõ·‘ÿñ³ÿÿº“ÿÿº“ÿÿº“ÿÿ»”ÿÿ¾’ÿÿ¾’ÿÿ¼ŽÿÿºŒÿý±€ÿü°ÿù®zÿö«wÿõ©tÿöªuÿø¬wÿú®yÿöµ~ÿ÷¶ÿ÷¸~ÿùº€ÿ÷¾€ÿúÁƒÿûƃÿýÈ…ÿÿʇÿÿÊ‹ÿþÊŽÿýË—ÿÿ΢ÿÿÑ­ÿÿ×µÿÿ×ÀÿëÖÎÿçÒÊÿåÕ¸ÿßÑ ÿÑɃÿÈÃhÿ¾½Oÿ¶µ;ÿ¬®,ÿ¦¨&ÿ¡¦#ÿŸ¢$ÿ›%ÿ›š*ÿ™™-ÿ••)ÿŽ•"ÿ”!ÿŠÿ†‹ÿ†ÿ~‚ÿz~ÿz|"ÿ{€+ÿ~1ÿ…‰=ÿ‘”Lÿ¡Zÿ¤¦dÿ¤¦dÿ¢£eÿž¦gÿ£hÿ›Ÿdÿ›eÿ¢ jÿ£¡kÿ—•[ÿ…ƒIÿll0ÿhm0ÿkq6ÿvGÿ‡’`ÿ¥±‡ÿÌݲÿíùÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïëàOñÐÁÿï·¤ÿö£ÿõÿùŸ|ÿÿ¬‰ÿÿº“ÿÿ¼”ÿø¼’ÿø¼’ÿ÷ºšÿõ¸˜ÿö¹™ÿù¼œÿýÀžÿþÁŸÿÿžÿÿžÿÿÂœÿÿÀšÿÿ¾—ÿûº“ÿù·Žÿô²‰ÿñ°„ÿî­ÿú¬ÿú¬ÿ÷¯€ÿø°ÿù´‚ÿý¸†ÿÿ½†ÿÿ¿ˆÿÿ¿ˆÿÿÀ‰ÿÿÀÿÿÁ•ÿÿÄžÿÿȪÿÿʵÿÿйÿèØ»ÿåÕ¸ÿáÖªÿÚÏ–ÿÊÄ{ÿÁ¼gÿ¶´Pÿªª>ÿŸ¢/ÿš*ÿ•˜%ÿ“”&ÿ“$ÿŠŽ$ÿ‡ ÿ†‹"ÿ~‚)ÿ‚-ÿ€ƒ.ÿ€1ÿ5ÿ…†>ÿŒKÿ“’Uÿ˜—]ÿ¤¢lÿ«ªwÿª¨xÿ¦¦vÿ¨¨xÿ¥¨wÿ¡¢vÿ¡wÿž¢xÿ¤©uÿ£¨kÿ¡©cÿ™¡[ÿ~†@ÿjr,ÿci0ÿkn=ÿy|Uÿ’sÿ«±˜ÿÑÙÈ°ïùé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþúï ÿêÛnÿÚǽÿ»¥ÿÿ¬Žÿú }ÿÿ¥‚ÿÿ³Œÿÿ¼”ÿþ˜ÿÿÅ›ÿü¿ŸÿýÀ ÿýÀ ÿü¿Ÿÿü¿ÿÿ ÿÿÅ¡ÿÿÇ£ÿÿÇ¡ÿÿÇ¡ÿÿÈ¡ÿÿÈ¡ÿÿÉ ÿÿÇžÿÿÇ›ÿÿÆšÿÿ»ÿÿ¹Žÿÿ¸‰ÿýµ†ÿù´‚ÿø³ÿù¶ÿù¶ÿû¸ÿü¹‚ÿú¸…ÿú¹ÿû¼–ÿþÀ¢ÿÿ­ÿþȱÿßϲÿÜ̯ÿ×Ì ÿÑÆÿÁ»rÿ·²]ÿ­«Gÿ¢¢6ÿ™œ)ÿ•˜%ÿ’•"ÿ“”&ÿ–'ÿ”*ÿ‘—*ÿ’—.ÿ”;ÿ“–Aÿ™œGÿ ¡Qÿ¥§[ÿ¬­eÿ°±oÿ³²uÿ¸·}ÿ¸¶€ÿ´³€ÿ±¯ÿ­­}ÿ¬¬|ÿª­|ÿ©ª~ÿ¥©ÿ¤¨~ÿ¬±}ÿ¨­pÿ•Wÿ~†@ÿlt.ÿks-ÿsy@ÿƒ†Uÿ›žwÿ¸½žÿÜâÉ°õýìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòãÓƒìË·ÿã³—ÿ꧆ÿò¨„ÿù¯‹ÿÿ»•ÿÿÄžÿýŨÿüħÿø¤ÿõ¿¡ÿöÁ¦ÿûÆ«ÿýÈ­ÿûÆ«ÿüÊ®ÿý˯ÿÿͯÿÿϱÿÿвÿÿвÿÿѱÿÿаÿÿÑ°ÿÿЯÿÿÏ­ÿü̪ÿø˦ÿõÈ£ÿõÇžÿôÆÿñÚÿð™ÿíÀšÿêÀÿèÀ£ÿéĪÿìdzÿêɵÿßжÿÛ̲ÿ×ʪÿÎÄœÿÀ¹ˆÿµ±wÿ¬ªjÿ£¢^ÿ››Uÿ™™Sÿš›SÿžVÿ¡¢Xÿ¥¦\ÿª«aÿ®¯eÿ¶¶zÿ¸·ÿº»ƒÿ¾½ŠÿÂÁÿÃÀ“ÿÀ¿“ÿ¾¼”ÿ¶µÿ²±‹ÿ°¯‰ÿ±°Šÿ¯°‰ÿ¬­†ÿ«¬„ÿ­®†ÿ®±Šÿ¬¯ˆÿ¥«zÿŠ“Zÿq};ÿht2ÿhv6ÿs~Fÿ†dÿ¨­ŽÿÉιÿçèßYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûëÿêÖ~ÿÓ·ÿýº™ÿó©…ÿÿô­‡ÿÿ¹“ÿþÆ©ÿÿÊ­ÿÿÌ®ÿþȪÿúŪÿûÆ«ÿüǬÿúŪÿüÊ®ÿý˯ÿþÌ®ÿÿͯÿÿϱÿÿвÿÿѱÿÿÒ²ÿÿÕ´ÿÿ׶ÿÿÚ¸ÿÿÛ¹ÿÿÜ·ÿÿÚµÿÿÙ°ÿÿ×®ÿÿدÿÿ×®ÿÿÕ¯ÿþÔ±ÿüÔ·ÿûÖ¼ÿü×ÃÿúÙÅÿîßÅÿêÛÁÿèÛ»ÿâØ°ÿØÑ ÿÑÍ“ÿËɉÿÄÃÿÅÅÿÄÄ~ÿÅÆ~ÿÈÉÿÊËÿÌ̓ÿÐчÿÓÔŠÿÍÍ‘ÿÌË“ÿÈÉ‘ÿÆÅ’ÿÃÂÿÀ½ÿ»ºŽÿ¹·ÿº¹“ÿ·¶ÿ¶µÿ¶µÿµ¶ÿ´µŽÿ´µÿ·¸ÿ´·ÿ¡¤}ÿŠ_ÿmv=ÿam+ÿlx6ÿ}‹Kÿ‘œdÿ³¼‘ÿ×ܽÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðè(õÚÌšéÁ¯ÿä®—ÿ਋ÿå©Œÿõ·™ÿÿĦÿÿгÿÿÑ´ÿÿ̯ÿþȯÿüɯÿúɳÿ÷Ë´ÿ÷Ë´ÿõʵÿ÷Ì·ÿ÷θÿúÑ»ÿúÓ½ÿûÔ¾ÿñÔ¹ÿòÕºÿó׿ÿõÙÁÿôÚÂÿôÚÂÿõÚÀÿôÙ¿ÿøÝÂÿøÝÂÿ÷ßÃÿùßÇÿ÷ãÊÿõäÏÿõèÒÿöæÙÿúæáÿöâÝÿòå×ÿîâÐÿâÝÄÿÝÙ¼ÿÙضÿÔÓ±ÿË̪ÿÊË©ÿËʨÿÊɧÿÉƧÿÆäÿÈâÿÉÄ£ÿÅÄžÿÄÃÿÂÃœÿ¿¾œÿ½¼šÿ¼ºœÿ½»ÿ½»ÿ½»œÿ»¹šÿ·¸–ÿ¸»”ÿ½Á˜ÿÁÆ™ÿ¾Ä•ÿ¸¾ÿŸ§xÿ}…VÿhrCÿirGÿr|Qÿˆeÿ• €ÿ¶¾§ÿÞçÓƒñ÷ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöè(ÿåÓƒÿйÿô¼Ÿÿ믒ÿ樊ÿì®ÿôºÿÿǪÿÿÒµÿÿÕ¼ÿÿÕ»ÿÿÒ¼ÿüйÿüйÿúϺÿúϺÿúÑ»ÿûÒ¼ÿûÔ¾ÿüÕ¿ÿöÙ¾ÿöÙ¾ÿôØÀÿôØÀÿóÙÁÿõÛÃÿøÝÃÿùÞÄÿøÝÂÿùÞÃÿùáÅÿûáÉÿøäËÿöåÐÿôçÑÿõåØÿüèãÿ÷ãÞÿóæØÿðäÒÿäßÆÿßÛ¾ÿÛÚ¸ÿ×Ö´ÿÑÒ°ÿÏЮÿÐÏ­ÿÐÏ­ÿÏÌ­ÿËÈ©ÿËÆ¥ÿËÆ¥ÿÇÆ ÿÈÇ¡ÿÇÈ¡ÿÆÅ£ÿÄáÿÃÁ£ÿÃÁ£ÿĤÿÀ¾ŸÿÁ¿ ÿÂáÿÅÈ¡ÿÇË¢ÿ½Â•ÿ¦¬}ÿ‘—hÿv~Oÿgo@ÿhrCÿ{„Yÿ– uÿ³º—ÿËÖ¶ÿæî×~øÿíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñè(òàÏùкÿþ¹˜ÿô¯Žÿî«Šÿö¶˜ÿÿƨÿÿжÿÿÓºÿÿÔ¾ÿÿÖÀÿÿÖÃÿÿÔÃÿûÕÃÿøÔÂÿøÔÂÿöÕÂÿöÕÂÿÿ×Äÿÿ×ÄÿþÖÄÿÿÕÈÿþÖÊÿÿ×ËÿÿÙÌÿÿÚÍÿÿÚËÿÿÛÌÿÿÜÊÿÿÝËÿÿßÏÿÿßÒÿþáÒÿüâÖÿùæßÿñáÚÿîãÕÿéãÐÿßÞÂÿÖÛ»ÿÐÛµÿÍزÿÈÓ­ÿÅέÿÄÌ­ÿÉ̲ÿÉ̲ÿÌÉ´ÿÌƳÿÌƳÿÊË«ÿÊË«ÿÉÉ«ÿÈȪÿÇƪÿÆÅ©ÿÅĨÿæÿÏϱÿÍάÿÈˤÿÁÅ›ÿ±·†ÿš¢mÿ€‰QÿpyAÿp|@ÿ‹Oÿ–Ÿtÿ©®ÿÃƶÿãçâEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûêÿñÛnÿÛºÿÿ˪ÿýº™ÿò²”ÿì°’ÿí´šÿø©ÿÿÑ»ÿÿÚÄÿÿÚÇÿÿÚÉÿÿÜÊÿÿÜÊÿÿÜÊÿýÜÉÿüÛÈÿÿÚÇÿÿÛÈÿÿÜÊÿÿÛÎÿÿÛÏÿÿÛÏÿÿÚÍÿÿÙÌÿÿÛÌÿÿÛÌÿÿÝËÿÿÞÌÿÿàÐÿÿáÔÿÿäÕÿÿæÚÿùæßÿñáÚÿîãÕÿêäÑÿâáÅÿÙÞ¾ÿÔß¹ÿÑܶÿÐÛµÿÌÕ´ÿÊÒ³ÿÎÑ·ÿÏÒ¸ÿÑιÿÒ̹ÿÑ˸ÿÎϯÿÌÍ­ÿËË­ÿÎΰÿÒѵÿÕÔ¸ÿÕÔ¸ÿÔÓ·ÿÑѳÿÃÄ¢ÿ°³Œÿ™sÿ‡Vÿs{FÿxIÿ†Wÿ‘aÿ¨´xÿÊÓ¨ÿâçÈ°óöæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþûìùïÝcîÜËÿçɶÿâ¹£ÿâ®—ÿð­–ÿö³œÿÿìÿÿͶÿÿÚÄÿÿáÌÿÿäÑÿúãÓÿïâÒÿíàÐÿõàÊÿõàÊÿõàÊÿöáËÿúãÍÿûäÎÿúáÍÿøßËÿûáÐÿüâÑÿüâÒÿýãÓÿþäÔÿÿæÖÿÿèØÿÿèÝÿñèÞÿïæÜÿêä×ÿçáÔÿâßÐÿßÜÍÿÙÚÆÿ×ØÄÿÓÖ½ÿÒÕ¼ÿÑÔºÿÐÓ¹ÿÏÔµÿÏÔµÿÏÔµÿÐÕ¶ÿÙÒÁÿÖϾÿÚÖ¾ÿÛؼÿÙÛ·ÿàä»ÿ×à®ÿ¾Ç•ÿ¬¸„ÿ–¢nÿ}ŠVÿuQÿrSÿvYÿŠ˜oÿ§³ÿÌÌÌšÚÚÚnìììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþìÿøç2ÿîÛnÿàÊ¥ÿ̵ÿýº£ÿô±šÿñ®—ÿù¶Ÿÿû¬ÿùÌ·ÿ÷ÖÃÿößÏÿôç×ÿøëÛÿÿêÔÿþéÓÿýèÒÿûæÐÿüåÏÿüåÏÿþåÑÿÿæÒÿüâÑÿûáÐÿûáÑÿüâÒÿþäÔÿÿç×ÿÿéÙÿÿéÞÿõìâÿôëáÿðêÝÿíçÚÿçäÕÿäáÒÿÞßËÿÝÞÊÿÚÝÄÿØÛÂÿÖÙ¿ÿÖÙ¿ÿ×ܽÿÙÞ¿ÿÚßÀÿÚßÀÿèáÐÿçàÏÿëçÏÿãàÄÿÌΪÿ¾Â™ÿ­¶„ÿ— nÿ‚ŽZÿ{‡Sÿu‚Nÿ~ŠZÿ’Ÿsÿ«¶ŽÿÂЧÿØäÀìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûïå;ïßÏêÒÀÿÝ¿¬ÿἦÿḡÿ浟ÿí»¥ÿþDzÿÿÒ¾ÿÿÙÅÿÿàÜÿÿåáÿÿëçÿÿíéÿÿìçÿÿéäÿÿèäÿÿèäÿûçâÿ÷çáÿôåâÿòçãÿñèäÿïëæÿðíèÿðíèÿöêêÿöêêÿóééÿðææÿêãàÿæßÜÿáÝØÿàÜ×ÿáàÖÿßÞÔÿààÔÿãã×ÿèèÚÿêêÜÿéêÚÿæç×ÿÝãÀÿÒصÿÉЫÿ·¾™ÿ™¢zÿ‡hÿŠbÿy„\ÿz„`ÿ‹“tÿš£‰ÿ­´ŸÿÈÏÀìâèÝcðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüìÿõãEÿéÖ~ÿàÊ¥øϸÿð¿©ÿë¹£ÿ︣ÿõº¦ÿõº¦ÿëÆÂÿóÎÊÿüÙÕÿÿâÞÿÿçâÿÿèãÿÿêæÿÿëçÿÿîéÿÿðêÿþïìÿûðìÿùðìÿõñìÿõòíÿ÷ôïÿüððÿþòòÿýóóÿüòòÿøñîÿöïìÿòîéÿòîéÿðïåÿìëáÿççÛÿååÙÿááÓÿÚÚÌÿÏÐÀÿÇȸÿ°¶“ÿž¤ÿ–qÿ†hÿ|…]ÿ}†^ÿŠ•mÿ–¡yÿ®¸”ÿÉѲÿÝæÌšéðÛnóúëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóå;ûçÖ~÷ÛÊÿøÏÀÿí±ÿë¹¥ÿï¹¢ÿðº£ÿó½¦ÿø«ÿýɲÿÿѺÿÿØÁÿÿÞÆÿÿëÓÿÿïÖÿÿôÚÿÿöÜÿÿöÛÿÿ÷ÜÿÿúßÿÿýâÿýûÝÿþüÞÿüüÞÿúúÜÿõøØÿòõÕÿìóÐÿëòÏÿÞèÄÿÔÞºÿÆÑ«ÿ¸Ãÿ­¸ÿ¡¬„ÿ”ŸwÿŒ—oÿ…‘mÿ~‰iÿŒkÿ™{ÿš¦ˆÿ©´šÿ¾È±ÿÏØÄÊáèÙyðöëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíÿùè(ÿðáOÿäÓƒÿÛǽÿйÿÿʳÿ÷Áªÿò¼¥ÿﻤÿð¼¥ÿｦÿí¿§ÿé½¥ÿê©ÿíÈ®ÿëÊ°ÿêͲÿíеÿðÕºÿôÙ¾ÿæäÆÿãáÃÿÚÚ¼ÿÒÒ´ÿÆÉ©ÿ½À ÿ±¸•ÿ¬³ÿž¨„ÿ—¡}ÿ˜rÿ‡’lÿ‡’jÿŠ•mÿŽ™qÿ‘œtÿ›§ƒÿ¤¯ÿ´¿žÿÈÒ´ÿÕáÃÜàëщí÷àOùÿîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôùä;ñòÞYìë×ÿèâÏÿæÚÈÿáÑÀÿÞʹÿàôÿݼ¬ÿ们ÿ纬ÿ뺬ÿï»®ÿõ¾±ÿúÁ²ÿüôÿÔѼÿÏÌ·ÿÆîÿ½º¥ÿ°²œÿ¦¨’ÿ›Ÿ†ÿ”˜ÿ‘—~ÿ’˜ÿ”ƒÿ›¤Šÿ¦¯•ÿ´½£ÿÃ̲ÿÌÕ»ÿÓÚË¥ÞäÙyèïâEîóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð ÿÿíÿþëÿúè(ÿõä;ÿïÞYÿêÛnÿåÕ€ÿßЉÿØÊ¥ÿÔƽÿÓƽÿÔǽÿÕƽÿÔÅÊÞÛƽÚ×ÂÜÖÓ¾ÿÕÒ½ÿÑÓ½ÿÏÑ»ÿÉÍ´ÿÅÉ°ÿÈεÿÏÕ¼ÿÕÞÄÊÝæÌšãìÒƒéòØyðùßYõþä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîíåäêãââââåææíïï ÜÚÚ6ÔÏÐj½À¿¦¬±°¶¦¦¦Á £¤äž£¥à¦§¤Á±±¯µ¾Á®ÓÔÔràáÞ4ìíë îïíâãáÚÚÙÝßÞæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîîæåðèçãàá*ÆÄÄ}¢¢¢Ú…‰‰ÿw‹ˆÿg‘Šÿkž–ÿ€«¤ÿš®ªÿ¨«¤ÿ¦¦šÿš—ŠÿŒ‚ÿˆˆƒÿˆŠˆþ¢£¢ÔÈÊÈáâà'ßßÞÞàßæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççðõóìãâ1Á¸¶¬ŠŒ‹ôp‹†ÿj©Ÿÿfͼÿ`ßÊÿVçÓÿMêÔÿfíØÿ¿ðàÿééÓÿçÚ«ÿâÙŽÿäÖ•ÿÙΚÿÇ¿˜ÿª¡ÿ‹‡ƒÿŠŽó¶¸¸›Þàà,êìïééîééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëíêêîììÄÈÇš‹Žõi–ŽÿiǹÿYãÐÿAéÒÿ-çÎÿ(äÍÿ#âÍÿ(âÌÿMäÎÿ®æÙÿßáÈÿãшÿÞÓYÿÞÓYÿÞÐgÿÞÓoÿâØÿÝÓ›ÿöÿ”Ž‡ÿôÂÃÈ”ìíòëëñááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææñîïçâã6«£¥ÓsŒÿoĸÿYåÒÿ8åÍÿ%áÉÿ&ßÇÿ(ÝÆÿ)ÚÃÿ!ØÀÿ%Öºÿ=Ú¼ÿ˜ÜÈÿÎÔ³ÿØÂxÿÙÀTÿÚÀZÿÜÄ^ÿÞËYÿÞÍWÿÝÍ`ÿãÑtÿàÓ–ÿûšÿ‘Ž†ÿ¦¥«ÑÞßè:ååçíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòëêêÝ××V‘––ôl© ÿ\àÍÿ8åËÿ$áÄÿ"ÞÁÿ%Ú¼ÿ$Ö·ÿÑ­ÿÍ¥ÿÉ¢ÿ+Æ¢ÿEЬÿ—Õ»ÿÆͨÿÊ·sÿëPÿÁ§IÿÆ­IÿÌ´NÿÕºXÿÚÁ[ÿÛÇYÿÜÉ^ÿáÏxÿÝКÿ§¡Žÿ••šð×ØÚPòññìóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôèøõíù÷ÙÔÕ\†“‘ùn¿´ÿPåÏÿ*ßÅÿ$ÛÁÿ$عÿÒ°ÿ ʤÿÄ™ÿ"–ÿ6ÆœÿHͦÿiÓ³ÿ…ßÂÿ¿ãÔÿÞàÍÿâÑ«ÿÖÀŽÿеyÿƨ_ÿ¼žLÿ¾¡HÿÆ«KÿÍ´RÿÓÀTÿÙÅVÿÚÇeÿÞÐÿ¸±•ÿ”“’ùØØÙ[ï÷ôêõóêõóêõóêõóêõóÿÿÿÿÿÿÿÿÿÿÿÿêóòêóòêóòêóòî÷õÛàßu‹—–ùkƸÿDâÊÿ$Ú¾ÿ#عÿÑ­ÿÉ¡ÿÁ˜ÿ»ÿ)¾Žÿ:Ä—ÿF›ÿCÁ—ÿ9À‘ÿIÕÿ„Ë£ÿ³¿•ÿ¼£kÿº^ÿÃ¥iÿɧsÿƨiÿºŸQÿµ™Dÿ½DÿĪIÿ͵QÿÕ¿TÿÕÂ]ÿáÌ€ÿƸžÿ—š‘ú×àÞYñõòíòíîòíîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòïïòïïòïïôòñìáâ0—œ›÷kôÿDàÇÿ"عÿÔ²ÿ Ê¥ÿ˜ÿ¼Šÿ¹„ÿ ¹„ÿ*µ…ÿ ³ÿ´zÿ'·„ÿ9Á“ÿ^Ê¥ô•Ó³æ¹Ç¡àÀ­è·›aÿ°ŒMÿ«…>ÿ¯‰@ÿ»‘Pÿ½”Sÿ²’Aÿµ•?ÿ¿JÿÉ«MÿϹOÿÒ¾VÿÝÊ}ÿÁ¶ÿ¡Ÿ ìéèä2óóîððëððìððìÿÿÿÿÿÿÿÿÿÿÿÿñíìñíìòííõïï«®¬Ór¼®ÿBàÄÿÖ¶ÿѬÿÈÿ¿‘ÿ·…ÿ´{ÿ³vÿ°vÿ±ÿFßÿŠÚÅÞ«ëØ–Ëöëméúø&îøüÞæÓ îåÖòìÜFàÛÂ}ÑèɷŸoÿ£ˆ?ÿ©„8ÿ³†Bÿ²Š>ÿ³>ÿ»—DÿĦHÿ̵KÿÓ¼OÿØÇÿµ­˜ÿ±°°ÇðòððóîïòíïòíÿÿÿÿÿÿÿÿÿÿÿÿñííñííöñòËÇLJv¯¤ÿBàÂÿ"Ô²ÿΨÿ Äšÿ¼Šÿµ€ÿ±xÿ¯tÿ°{ÿF¿˜ÿ–áÈÏÎ÷íZêÿþÐúîÓþóíüûî÷üÜäÐìãÔøóãñðÙúøñòïßAÓΧ¸³›iÿ§=ÿ©5ÿ«…5ÿ°‰:ÿ¸‘CÿÀ¡FÿɯKÿ͹RÿÓƇÿª¦šÿËÍɉòöîîñêîñêÿÿÿÿÿÿÿÿÿÿÿÿééêëëìèãã,’¬§õ]Ô½ÿ(Ô³ÿ̧ÿÙÿ¹Šÿ´}ÿ±xÿ®uÿ#³€ÿvÏ´ðÈôìvâÿúßÿöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéù÷çñìÓîãÓRǹŠæ§…Fÿ§3ÿªƒ4ÿ­‡<ÿ³’=ÿ»ŸHÿͬKÿÏ·ZÿÉÀÿ¯§¨õéçê!ðïïîíîÿÿÿÿÿÿÿÿÿÿÿÿåëêéïïÆÂħp¿°ÿ+صÿ"ɤÿ–ÿ»ˆÿ±ƒÿ±vÿ®tÿ'²†ÿˆ×Àõäüõ2èÿÿÛþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËüöæõô玡˫‰Bÿª}2ÿ¢‚6ÿ¯‰7ÿ¸’?ÿ¼ŸGÿȬGÿÓ»jÿº¯žÿÇÇË–ðïðëêëÿÿÿÿÿÿÿÿÿÿÿÿêééåãã"›´¯õVзÿË¥ÿÙÿºŠÿ³~ÿ®xÿ­rÿ²~ÿ€Ò¹åçýö:ðÿþåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËùóâ÷÷ëûöì̼˜Ø¦…@ÿ¨z8ÿ«€6ÿ®Š6ÿ²‘?ÿÁ¡DÿƪRÿȺ‰ÿ²°©îäããçååÿÿÿÿÿÿÿÿÿÿÿÿíííÑÑÐvyÁ°ÿ.ЬÿÄ™ÿ½ÿ´‚ÿ°xÿ°qÿ¯wÿdȪùÛõíMíÿúìÿüåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåëæÊùóáõôçü÷íîéå/¼­{ô­‚6ÿ¨|7ÿ¨‚4ÿ¯‰=ÿº•@ÿÀ Eÿʳdÿº²˜ÿÒÒÑmíîñÿÿÿÿÿÿÿÿÿÿÿÿíññ´Â¿ÏUË®ÿÇžÿ¾Žÿ·‚ÿ±zÿ®tÿ¯qÿ8»‘ÿ¾äÙ‡òúøíùöëýùäýûÙþôÚýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéöôäòðØùõêöõêöôéøöïæàʆ±˜Uÿ¦}4ÿ¨~5ÿ«‚9ÿ²Œ=ÿ¹™@ÿÅ¥LÿÅ´†ÿÂÀ»Çîñùÿÿÿÿÿÿÿÿÿÿÿÿæëë2œ½¶ÿ:Ì©ÿ¾“ÿº‡ÿ³{ÿ°vÿ¬rÿ±yÿ}Ϲîéöôæ÷õå÷ôå÷ôæ÷öâýøÞýöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷ôäóòèñíëòîêòîêòïëóïî ĵ™à©„8ÿ¨}1ÿª6ÿ­‡9ÿ±‘>ÿ¾˜CÿŬnÿ¼¹«úäèï0ÿÿÿÿÿÿÿÿÿÿÿÿâÚÜ\vðÿ)Åÿ¹Œÿµÿ°yÿ­uÿ­sÿ5¹ŠÿÀâÛŸøÿÿñÿÿñÿÿñÿÿñÿÿñÿÿñÿÿëÿþÉ÷êÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÔ÷öëôñæòðæñïæñïæñïæñïåõóëÚ×Ê’®’Uÿ§~/ÿ¨6ÿ«8ÿ°‰;ÿ¶“=ÿãVÿ¼µ—ÿ×Ùã`ÿÿÿÿÿÿÿÿÿÿÿÿÏÒцZèÿÀ’ÿ·„ÿ³{ÿ¯uÿ¬sÿ®wÿZÅ þàíç<ï÷ôì÷ôì÷ôì÷ôì÷ôì÷ôí÷óìøõÇ÷éÏüñëûúí÷ûÜäÐìãÓ÷ñàîìÖîòéííèíîèîîèîîèîîèîîèïðêçèá@¸¥xÿ©€5ÿ©}4ÿ¬7ÿ®…9ÿ³Œ;ÿ»˜Fÿ»°…ÿÕÔØÿÿÿÿÿÿÿÿÿÿÿÿÂÒδHÄ¢ÿ¹‡ÿ³~ÿ°wÿ®sÿ­qÿ²}ÿͶæéìéâëæâëæâëæâëæâëæâëæâëæãëæÜîçØüôêüúí÷ûÜäÐìãÒöòçíððìïñìïñìïñìïñìïñìïñìïñíðòìðóÁ¶šîª„<ÿ¦|1ÿª4ÿ¬‚4ÿ¯‰7ÿµ<ÿ»ªvÿÐÍË¢ÿÿÿÿÿÿÿÿÿÿÿÿ¼ÎÇÁFÄŸÿ¹…ÿ´~ÿ²zÿ±xÿ¯vÿ-¶‡ÿ¡ÍûíçëææçææèææèææèææèææèææèææçèåçãëêêúùíøüÜäÐéãÔéëèçêêçêéçêéçêéçêéçêéçêéçêéçêééííɯ̮ŽJÿ¥€6ÿ¨‚8ÿª„:ÿ­‰=ÿ²Aÿº¤pÿÏÈŶÿÿÿÿÿÿÿÿÿÿÿÿ¾ÌÈÁaÉ¥ÿH¿‘ÿG¼ÿE»ŠÿCº‰ÿ@ºˆÿXšÿ¸ÍʵßÙÞÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÛÞàãéôõåìåççæçèèçèèçèèçèèçèèçèèçèèçèèçèèçèèêëìÎɼú gÿ±Rÿ³‘Sÿ¶“Tÿ·•Wÿº™Yÿ¾«{ÿÎÊÆÖÿÿÿÿÿÿÿÿÿÿÿÿÊÌÎîɦÿ¥¾—ÿ¥½—ÿ£»•ÿ£»•ÿ¢½•ÿ¬Æ¦ÿÆÏɶÚÝÝ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛÙÞÝëíìîîíìçéìæçëæçëæçëæçëæçëæçëæçëæçëæçëæçîèëÊÉÁIJ¬|ÿ©›eÿ®œdÿ°eÿ¯žiÿ°¡lÿ³²„ÿÌËŸÿÿÿÿÿÿÿÿÿÿÿÿßÎ˹éµÿë¥zÿè£zÿé£zÿè£zÿè£yÿã°‘ÿÐŽÊëíîëììëëìëëìëëìëëìëëìëëìëëìëììêëëæéêîïîîîìééêèåèéæééçééçééçééçééçééçééçééçéìéí½¿µË•\ÿ€Bÿ„Aÿ„€Aÿ„‚Dÿ‡ƒDÿ“›fÿÆÉÁªÿÿÿÿÿÿÿÿÿÿÿÿàÕιú£yÿýŽZÿü[ÿý[ÿüŽ[ÿþ[ÿûœvÿθ«óèõõ%ðûúïúùïúùïúùïúùïúùïúùîúùïûùæììâççîïîîîìèéêããæëéîèçìèçìèçìèçìèçìèçìèçìéèíéç﩯Ÿðt|8ÿbfÿcd ÿbcÿbeÿafÿy†MÿÌÐÊÿÿÿÿÿÿÿÿÿÿÿÿßßÙ‘ô£|ÿý‰RÿýˆSÿþˆSÿþŠVÿüTÿþ›iÿÕ¯ ÿÙééëûùéøöéøöéøöéøöéøöéø÷êøøêóóäééãçèîïîîîìèéêÝÞßäâæéçêëéêëéêëéêëéêëéêëéêíëìáÞãC™ …ÿmt(ÿ^`ÿ]_ÿ]^ÿ\^ÿ[_ÿ{‡PÿÔØÔtÿÿÿÿÿÿÿÿÿÿÿÿèçå^ñ©ŠÿýŠUÿý†Sÿü‡SÿþŠWÿüWÿÿšfÿݨ“ÿÅÏΧëðõçìðèìðèìðçìðèìñçìïâæéçêíäééãçèîïîîîìèéêÞßààßãäæãîðëìíêìíêìíêìíêìíêðòïÍÌΡ”mÿlq"ÿacÿ^aÿ\_ÿ]_ÿ]`ÿŠ“dÿßáÝPÿÿÿÿÿÿÿÿÿÿÿÿóóí#ì¹¢öþZÿþ†Rÿù‰RÿÿŠVÿýZÿÿ˜dÿÿº±«èêîöñõúðóùðóùðôùîðöéçìáâæçëîäééãçèîïîîîìèéêÞßààßãÝàÝíñêîñïìïóëîòëîòíðôéì类§í‰Rÿmnÿeeÿ^aÿ]`ÿ]^ÿ]dÿ ¦‰ñðòíÿÿÿÿÿÿÿÿÿÿÿÿöôðë;¾ü“fÿÿ†Oÿü‰PÿþŠVÿü‘Yÿý˜`ÿÿ­ƒÿħšÿÂÍЛñùüíô÷íô÷ìôöéìîåäèâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóêíñìêëñíðòíïññôöÈËÒ›”ž€ÿ‚‹6ÿlmÿdfÿ]aÿ]_ÿZ^ÿeo,ÿ¿Å®¼õöóÿÿÿÿÿÿÿÿÿÿÿÿïôôéâÜjó¡}ÿþˆQÿþˆPÿþŠVÿü‘Xÿþš`ÿÿ¤sÿÿ¨¥žöçâç2õïóðêïåèéçèêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëêîèèçìððîôóòãæå@¢Ÿö–Ÿfÿ{€!ÿmoÿceÿ^_ÿ[^ÿY]ÿxƒOÿÜâÑlñöìÿÿÿÿÿÿÿÿÿÿÿÿîîëííè긟îùWÿþˆPÿþˆVÿþUÿþ˜aÿü£hÿÿ¹ŠÿÓ®œÿ«¨©ÓèééàßââçèèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïéåãéëéëîì짩©Øœ¥{ÿ‘•<ÿy{ÿknÿbeÿ^_ÿZ\ÿ\cÿ ¨ˆîïõéíóæÿÿÿÿÿÿÿÿÿÿÿÿî÷óîøõïÙÍ­úšjÿüˆQÿþ‡TÿþTÿý“_ÿø£fÿý¯vÿÿäÿ´£›ÿ¬ª¬ÀââååêëèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïééçíëè«Ì—›„ÿ «Vÿ…ˆÿwxÿfmÿaaÿ_^ÿX^ÿnx;ÿÎÓÅ~îôïéðéÿÿÿÿÿÿÿÿÿÿÿÿëÿÿéÿÿññï1÷¶—ôüŠYÿþ‡RÿüŠUÿþ\ÿü›dÿý«pÿü¸‡ÿüÊ®ÿ²–ÿ Ÿ ×ÚááKîïðææêâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞñõíòõïÝÜãJž ŸØ•›€ÿª´fÿ•&ÿ ÿorÿahÿ`]ÿ^]ÿ[fÿ˜£~ðãæÝàãÚàãÙÿÿÿÿÿÿÿÿÿÿÿÿëýþêýþôöïðÝÏ÷žvÿþ‰RÿþˆSÿþŒVÿý“`ÿÿ¢kÿü°xÿþ¿Žÿüѱÿ´¦šÿŠŠˆÿº»¼¤ååé(çéíêîñåêêãçèîïîîîìèéêßàáãáæäçäéîç7¼¿À·Š‰‹ü¡ƒÿ²»eÿ•Ÿ,ÿ‡ÿyzÿhlÿ`aÿ^^ÿY^ÿuGÿÕÛÏxíñîèíèèíèÿÿÿÿÿÿÿÿÿÿÿÿôöíôöíõõëööí õʯÑû‘`ÿþVÿûŠTÿû[ÿÿ™bÿÿ©mÿþ¸{ÿþÄÿÿÒ³ÿÝÀ®ÿ›‘†ÿŒŒ‹ò´³·µÕÙÛmàåå9æëìòóòóóðììîÝÞà*ÔÓÖ_±´²±ˆŠùŠˆƒÿ²´€ÿ¸¼Wÿ›¡,ÿ‘!ÿ€ÿppÿbfÿ^aÿY`ÿ`j)ÿ·¾žÏøýó ôùñóøñóøñÿÿÿÿÿÿÿÿÿÿÿÿø÷íø÷íø÷íùùîûóâ-òµ—îý‘_ÿý’bÿúŒZÿý‘Wÿþœdÿü¬uÿþ»ÿÿÅÿÿÒ£ÿüÙºÿй«ÿ¢‘‰ÿ‰ƒ|ÿŒŒ‰ÿ—––ñ›š™î™ššî”–—ð‰Šù…zÿÿ¬¯ƒÿ¿Çfÿ®¶9ÿ¢#ÿ”"ÿ‚„"ÿtsÿefÿcdÿcdÿ[cÿ˜Ÿzñïñå0øüîõúêõúêõúêÿÿÿÿÿÿÿÿÿÿÿÿüøëüøëüøëýøëþúíûìÞOõªŠóû—fÿÿšoÿý”aÿø“[ÿü›gÿþ¬tÿü½€ÿýȉÿýÍšÿÿÖ®ÿÿÛ»ÿïÒ¸ÿÛŲÿð§ÿ¶«©ÿ­© ÿ§ªŒÿ³¸ƒÿºÂzÿ¾Æfÿ³»@ÿ¦«)ÿœž)ÿ‘”$ÿ€†ÿqvÿfjÿjl&ÿrr.ÿ\fÿˆ‘büãæÙVùùòõõíõõíõõíõõíÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿúòúæÝVô«‹öýœpÿ÷©zÿù uÿþ˜jÿøœgÿû§oÿþµzÿýÂ…ÿþËŽÿþИÿÿÔ ÿÿØ©ÿÿáÅÿüçÝÿìä½ÿÍÒoÿ¶¾=ÿ¯´,ÿ©¬&ÿ¢¥$ÿ˜$ÿ‰Ž!ÿ{~ÿnrÿpq'ÿ‚>ÿ‚…Cÿai%ÿ\þÞåÓgøüñöúí÷úî÷úî÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìÿóñúäÜNð´Œöú¢{ÿü±‘ÿú³ÿû°…ÿø¬|ÿ÷ªvÿù®wÿû¶}ÿûÀ„ÿýɇÿþÍŽÿÿÓ©ÿöÚÌÿàÕ¨ÿÀÀLÿ¥ª ÿ›$ÿ“—!ÿ‰ÿ€… ÿ}€,ÿ‚†<ÿ’Oÿžœeÿ‘ŽUÿfl.ÿšiúÜáÐ^ôùéúÿðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþ÷ðûîß?ø¼¤Õø«†ÿû¾˜ÿûäÿýĤÿþÅ¢ÿüÄžÿüÀ˜ÿü¾“ÿúÀŽÿúÀŽÿùÄ£ÿîйÿÓÊ™ÿ±¯Vÿž9ÿ›ž<ÿŸKÿ¡¢\ÿ¨¨oÿ­¬}ÿ°°„ÿ¬¯†ÿ•Vÿox7ÿ¢¦„áèñÝBëðâîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿùëþõåöмœñµ—ÿú¿ ÿýÍ´ÿüÑ»ÿüÒ¼ÿûÖ¾ÿùÙÁÿùÚÁÿúÚ¿ÿøÞÇÿöâÖÿèÞÈÿÑÒªÿÇÊ¡ÿÊÈ¢ÿËÉ¡ÿÇÆ¢ÿÆæÿÄâÿ³¶Šÿ‡\ÿ}†Yÿ¾È©«ðôåï÷äçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿôäÿòæýíÙKõεÃó¾¦ÿúÉ´ÿúÙÆÿùáÏÿüâÑÿýáÒÿýßÑÿþäÖÿúçàÿêä×ÿÙÝÅÿÒ×¾ÿÖ×ÀÿÚ×ÀÿÕÔ·ÿ½Â›ÿ˜ sÿŠ”eÿ®µ”±ßãÑHêòßïóäìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿúêÿ÷åûæÖ=õÔ¿—óË·æö̼ÿúÖÉÿüßÒÿùçÚÿöìßÿøñåÿóíâÿåäÕÿÕÙÄÿÆ˲ÿ´º›ÿ ¨„ÿž©…ê¼Å©ŸßçÔAßáÛèëÞäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿøçÿóàþòáÿñÞÿóäúáÍJõâΘñÖðòμÂøμÍíØÂÐÏÑ·Þ¸½¡ß­·˜Ö¸Ã£»Ã̵‹ÓÝÈQìôáîõåêòâÙÜÓæéÛäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿþÿÿøÿÿàÿÿÀÿÿ€ÿÿÿþü?øøðð?þðÿÿàÿÿ€àÿÿÀÀÿÿàÀÿÿàÀÿÿðÀÿÿðÀÿÿðÀÿÿðÀÿÿøÀÿÿøÀÿÿøÀÿÿðÀÿÿðÀÿÿðÀÿÿààÿÿààÿÿÀàÿÿ€ðÿÿðþøøøü?þÿÿÿ€ÿÿÀÿÿàÿÿøÿÿüÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèìèèêîíôíìåÝÝ$¿»»~¡¦¥À‹ª¤ô~®§ÿ”±¬ÿ¬®§ÿ¬©ÿ¨§Ÿù¤¥¤Çº»¼…×ÙÙ-àâáåçêèèíçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèðììééè¾»¹ŽŒ¨£ð`±¥ÿKÏ»ÿCâÎÿ=èÒÿ•îßÿéäÆÿä×ÿÞÓ~ÿ˃ÿ±©‡ÿ¦£›ö±±´•ÝÞä(ííòçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóññíîÞÔÖK“¤¡äc¿±ÿ@ßÉÿ,çÏÿ$àÈÿÙÀÿ×¹ÿsÝÅÿÒÐ¥ÿØ¿UÿØÁQÿÞËYÿäÓfÿÞÎyÿÁ·ÿ¥£ìÉÊÔdìëííòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿç÷ôç÷ôçøõîø÷ÎÉÊg®¨÷HÖÂÿ+äÉÿÚ»ÿЭÿ É¢ÿ-É¢ÿJÏ«ÿ’ÜÄÿÕÓ³ÿÒºxÿǬ]ÿÄ©OÿË°OÿÕ¾SÿßÍbÿÕÇÿ¬§–ÿÆÆÉwð÷ôêöóêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿëóñëóññ÷ö×ÖÖez²©ÿ>ÜÄÿ Û¼ÿΩÿ˜ÿ!»ÿ.½ÿ6½ÿ8¿ÿoË¢ÿ¸¼‘ÿ¼aÿ¾œ_ÿ¾œ[ÿ¹™Kÿ¼EÿÉ®LÿÖÀUÿÜÈuÿ´¬–ÿÆÌÌ}ó÷óîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòííöñðçÝÝ5‰³«ò;Ù¾ÿÕ²ÿÆœÿºˆÿ´xÿ±zÿ<½“ÿnұɖâË¥ÆìàdÕÛÁWÝΰÊ·Žº¸œfó­ˆBÿ±ˆ=ÿ´@ÿÁ GÿζKÿÖÃpÿµ­üÜÜÜCóöððñìÿÿÿÿÿÿÿÿÿÿÿÿïìíóìíª¾¹ÂCÒ·ÿÒ­ÿÁ–ÿ¶ÿ¯sÿ"´ÿ}׺ÅÍøíUÞýøÛþöóúþâæÕöïáöõåôðá/Ï›«°ŽPÿ§0ÿ¯ˆ:ÿ»šCÿʱIÿ̼tÿº¹²×ìîëïòíÿÿÿÿÿÿÿÿÿÿÿÿêííØÖ×Udñÿ!ѬÿÀ“ÿ³ÿ­qÿ6¸ŒÿºëÝ‹ëÿÿÝÿöÔùñÒûðíøúàäÒóëÚòïÝ÷óâùõâèäÑW²–\ø¥|0ÿ«‡8ÿ»™Bÿ˯LÿÀ±‰ÿÑÏÔqïîïÿÿÿÿÿÿÿÿÿÿÿÿíèéªÅ¿Ç7Ì«ÿ–ÿµÿ®sÿ!³ÿ®æÕ÷ÿÿäÿûØýóÔùñÒûðíøúàäÒóëÚòïÝöñàôïÙþýôçàÎa®Pü¨{2ÿ­ˆ9ÿ¼š@ÿȱcÿþ­Øçæé ÿÿÿÿÿÿÿÿÿÿÿÿååå0tðÿÆšÿ¸„ÿ®vÿ¯rÿ†Ó»Éñûøëüùáýø×ýóÔùñÒûðíøúàäÒóëÚòïÜ÷òàõòáøõìûùõÖË©¦¦6ÿ¨~5ÿ±‹<ÿÁ DÿÀ¯ƒÿÚÜáRÿÿÿÿÿÿÿÿÿÿÿÿ×ÝÜfIƧÿ»‹ÿ²{ÿ¬qÿ3¸‰ÿØñîMòýýìüüìýýêÿýÖúóÑûðíøúàäÒóëÚóïÛöñæòðæòïçôòêëéâ0±˜aý¦|/ÿ«ƒ8ÿµ‘<ÿÁ¨gÿÒÒÐÿÿÿÿÿÿÿÿÿÿÿÿ¹ÒË¡(À–ÿµÿ¯uÿ «qÿhȧèðõóíöóìöóìöóïöóÛöîÒüòíøúàäÒôìÜïïâîïíîïëîïëîïëðòñŸ—Õ§|1ÿ«~5ÿ°‡6ÿ¸šJÿÍȹÁÿÿÿÿÿÿÿÿÿÿÿÿ¦ÎÂÈ ¼Œÿ³{ÿ°vÿ°yÿ—Ï¿­ïéëäææäææäææäææäææâðîëùùßåÒíëãêîïéíîéíîéíîéíîìñõÓÍ»ª…<ÿ¨5ÿ­…8ÿ´‘DÿǼ¦Ùÿÿÿÿÿÿÿÿÿÿÿÿ²ÍÃËdØÿa½ÿ]»Žÿ`À”ÿ·ÒÉ—ßÚÞÙÙÛÙÙÛÙÙÛÙÙÛÙØÛÙØÚåëìèìèèçèèççèèçèèçèèçèèçëëìÙÔʈ¶ždÿ´•Yÿ·˜\ÿ¹ bÿŽ¨çÿÿÿÿÿÿÿÿÿÿÿÿÜÊÁÈâ¬ÿá¦}ÿà¦|ÿ૆ÿ×Ì­åêëåèçåèçåèçåèçåèçâåäéëëîíìéæéìèëëçêëèêëèêëçêïëðÍÍÅ“Tÿ‰„FÿŠ†IÿŠŠKÿµº¡Ôÿÿÿÿÿÿÿÿÿÿÿÿæ϶ÿŽ[ÿÿˆTÿÿŠUÿÿ‘^ÿÛº©êçúúíúùìúøìúøíúùîúùäëëêììííìâãåéçëëéîëéíëéíëéíïíô´·¨Êfl$ÿ]_ÿ]_ÿ\dÿ¯¶»ÿÿÿÿÿÿÿÿÿÿÿÿëÞÖwú‘bÿý…Pÿý‰Tÿÿ’ZÿÛªÿÜæë7íñ÷êïôëïõèíñåéìâççêììííìàáãáááëìèìíëëìëíîìççê$š€ùfiÿ\_ÿ[]ÿ_dÿÁƲŒÿÿÿÿÿÿÿÿÿÿÿÿòëå5÷ yÿþ…MÿýŠTÿÿ“[ÿð§ÿÇÇÇ©ñøýñõúîòöæåéäæéâççêììííìáâäÞßßéîæíððìîòñôøÇÌÍ’‰Sÿijÿ^aÿZ\ÿmt8ÿÜÞÔ[ÿÿÿÿÿÿÿÿÿÿÿÿíòñÙý†Nÿþ‰Sÿý”Yÿÿ§uÿȬšÿØØÛIñïóæéêåäèäçêâççêììííìáâäÞßßêïæêëëññòâäç5Ÿ¦÷€…+ÿhjÿ^`ÿTXÿ‘™míðöëÿÿÿÿÿÿÿÿÿÿÿÿîõñîßÔqû’`ÿÿ†PÿþYÿü£gÿù¹ÿ¹«¦åÑÓ×8ëîïååèäçêâççêììííìáâäÞßßêïæððñàÞä+§© ß–Mÿz|ÿeiÿ]]ÿ\dÿÂɲƒïôîÿÿÿÿÿÿÿÿÿÿÿÿéÿÿíûû÷²“àþ…Oÿþ‹Vÿý™bÿÿ²{ÿﾟÿ­¤ŸóÃÈÊkæçë êíñäêêëííîîíãäæäååîóëÏÏÖ^¡£›ç ª^ÿŠ#ÿpsÿ`bÿXYÿŠ”dìäèâ!äçáÿÿÿÿÿÿÿÿÿÿÿÿòùóôúòôç×PùœoÿþˆQÿüŽZÿÿ¢hÿÿ½ƒÿöÉ¥ÿÀ¬ÿ¨¥¤Î»½¿Ð××Pâåå0æææ.Ö×Û@¼½Âx¤¦¨È ¢ÿ«¯Tÿ–š&ÿ|}ÿegÿZ\ÿfo.ÿØßËeøý÷ò÷ïÿÿÿÿÿÿÿÿÿÿÿÿû÷ëû÷ìüýñø׆ú•gÿý‘`ÿü”[ÿü¦nÿÿ¿„ÿÿÔ¡ÿèƪÿ¼§—ÿ²¨Ÿÿ¯¨§ÿ§§¢ÿŸ¤ÿ™Ÿuÿª¯aÿ±·=ÿ—œ ÿ}ÿjlÿfgÿ_g!ÿµ»ž«ûýóöøìõøëÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþùëÿûòøͼ•ùŸsÿù¢uÿüžoÿú¥mÿý·yÿÿÈŒÿÿןÿÿÙ«ÿúÞÐÿÞÙ§ÿºÀGÿ¯´/ÿ ¥ÿ‹ÿy}ÿwy,ÿ<ÿgo,ÿ­¸”³ûüô øüï÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþ÷íÿõòøÖ¿†ú®Œþû·“ÿüº•ÿûºÿûº‹ÿûÀ‰ÿüÆÿùÒºÿÒÊŽÿ¤¦1ÿ—š0ÿ•˜?ÿššXÿŸ¡kÿ–š`ÿ€ƒJÿµ½ž¡ðõè úÿðøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿóîÿùíûåÕGõèÛûǬÿüлÿúØÂÿúÙÂÿûÛÃÿùáÓÿãÜÄÿÉ̦ÿËɦÿËɨÿ¾¾œÿ£©|ÿ’špåÑØÀeò÷éíòãøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿôæÿôâúÞËcöѽ¿ùØÇóúÛÍÿøßÒÿøéÝÿèäÖÿÎÓ¾ÿÇʱÿ¼À¡û­¶“ÈÃ̱yãç×ðõäêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿñâÿõäþïßÿñßýìÛ$÷èÖj÷ÓÃ…ôÓÁ‘Ë̵ŸºÁ¦œÌÕ¼pÙãÏ.íõãêðáãæ×ëñÞêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿþü?øðàààøÀ?üÀ?þÀþÀþÀÿÿÀÿÿÀÿÿÀþÀþÀþÀ?üàøààðøüþ?ÿÿÿ€ÿÿðÿÿÿÿÿÿÿÿÿ(0 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèòñëééïðïïäãËÄÅ^¨º·«ˆ¹±Ô“ºµä¶·¬æ·´¢×¹¸²±ÄÅÈhÖØÚêëïçæêìñïêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèóòòííÖÒÒT“·±ÕUÀ±ÿ;ÛÆÿ%àÉÿiæÓÿßÙ§ÿßËdÿØÊsÿÁ·ÿ³¯ŸÝËÌÒaèèííòðêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿçöôèøöîõôÂÄÄ‚a¿³ÿ,ÞÄÿݽÿѬÿ(̧ÿlÖ¹ÿÍÈ™ÿÍ°ZÿͳPÿØÀUÿÝËfÿ¿µ†ÿ¿¾¿•ìóòë÷óêõòÿÿÿÿÿÿÿÿÿÿÿÿîòñôôôÉÍÌVǵÿ"Ú»ÿÉ ÿºŠÿ%¸…ÿ9À‘ÿqЬóÀ¿•í¿ždÿ·“Pÿ·”DÿÂ¥EÿÕ¾Vÿȹ}ÿÄÅÚñõòïòíÿÿÿÿÿÿÿÿÿÿÿÿöðñâÜÜ #if !defined(IDC_STATIC) #define IDC_STATIC (-1) #endif ///////////////////////////////////////////////////////////////////////////// #undef APSTUDIO_READONLY_SYMBOLS ///////////////////////////////////////////////////////////////////////////// // English (U.S.) resources #if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENU) #ifdef _WIN32 LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_US #pragma code_page(1252) #endif //_WIN32 #ifdef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // TEXTINCLUDE // 1 TEXTINCLUDE DISCARDABLE BEGIN "resource.h\0" END 2 TEXTINCLUDE DISCARDABLE BEGIN "#include \r\n" "\0" END 3 TEXTINCLUDE DISCARDABLE BEGIN "\r\n" "\0" END #endif // APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Icon // // Icon with lowest ID value placed first to ensure application icon // remains consistent on all systems. IDI_SYNERGY ICON DISCARDABLE "synergyc.ico" IDI_TASKBAR_NOT_RUNNING ICON DISCARDABLE "tb_idle.ico" IDI_TASKBAR_NOT_WORKING ICON DISCARDABLE "tb_error.ico" IDI_TASKBAR_NOT_CONNECTED ICON DISCARDABLE "tb_wait.ico" IDI_TASKBAR_CONNECTED ICON DISCARDABLE "tb_run.ico" ///////////////////////////////////////////////////////////////////////////// // // Dialog // IDD_TASKBAR_STATUS DIALOG DISCARDABLE 0, 0, 145, 18 STYLE DS_MODALFRAME | WS_POPUP FONT 8, "MS Sans Serif" BEGIN EDITTEXT IDC_TASKBAR_STATUS_STATUS,3,3,139,12,ES_AUTOHSCROLL | ES_READONLY | NOT WS_BORDER END ///////////////////////////////////////////////////////////////////////////// // // Menu // IDR_TASKBAR MENU DISCARDABLE BEGIN POPUP "Synergy" BEGIN MENUITEM "Show Status", IDC_TASKBAR_STATUS MENUITEM "Show Log", IDC_TASKBAR_SHOW_LOG MENUITEM "Copy Log To Clipboard", IDC_TASKBAR_LOG POPUP "Set Log Level" BEGIN MENUITEM "Error", IDC_TASKBAR_LOG_LEVEL_ERROR MENUITEM "Warning", IDC_TASKBAR_LOG_LEVEL_WARNING MENUITEM "Note", IDC_TASKBAR_LOG_LEVEL_NOTE MENUITEM "Info", IDC_TASKBAR_LOG_LEVEL_INFO MENUITEM "Debug", IDC_TASKBAR_LOG_LEVEL_DEBUG MENUITEM "Debug1", IDC_TASKBAR_LOG_LEVEL_DEBUG1 MENUITEM "Debug2", IDC_TASKBAR_LOG_LEVEL_DEBUG2 END MENUITEM SEPARATOR MENUITEM "Quit", IDC_TASKBAR_QUIT END END ///////////////////////////////////////////////////////////////////////////// // // String Table // STRINGTABLE DISCARDABLE BEGIN IDS_FAILED "Synergy is about to quit with errors or warnings. Please check the log then click OK." IDS_INIT_FAILED "Synergy failed to initialize: %{1}" IDS_UNCAUGHT_EXCEPTION "Uncaught exception: %{1}" END #endif // English (U.S.) resources ///////////////////////////////////////////////////////////////////////////// #ifndef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Generated from the TEXTINCLUDE 3 resource. // ///////////////////////////////////////////////////////////////////////////// #endif // not APSTUDIO_INVOKED synergy-1.4.12-Source/src/cmd/synergyc/tb_error.ico0000600000175000017500000000047611151752223022224 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€»»»»»»»»° »» »° »°€: »»»»°è¢ »° »Ž:0»° »è~~ ° °&&çç ° °ff~~p° &&çà»»f`~~ °&& çç °ff~p& çf`øÀ€€€€€Ààøsynergy-1.4.12-Source/src/cmd/synergyc/tb_idle.ico0000600000175000017500000000047611151752223022010 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ 9™™˜à¢™™™™Ž 9™:虘à™’™™€9™0 ™™˜©’™‰ž9š ™é˜yž™)–é— ™i–y™™™–™™i™`y™~&™– ç™™™™fy™™– çf`øàÀ€ƒÁ€0 pðàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/synergyc/tb_run.ico0000600000175000017500000000047611151752223021677 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0°è袢»°:»»°»°p»»»»»» » »»fpp »&&çç ff`~~&&& çççfff~~&& çf`øàÀ€ƒ 0€€Ààøsynergy-1.4.12-Source/src/cmd/synergyc/tb_wait.ico0000600000175000017500000000047611151752223022037 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0è袢ŽŽ::èè~~&&ççff~~p&&ççff`~~~&&& çççfff~~&& çf`øàÀ€ƒÁàððððàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/synergyd/0000700000175000017500000000000012140644175017707 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/synergyd/CMakeLists.txt0000600000175000017500000000245512127576354022467 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2012 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src synergyd.cpp ) set(inc ../../lib/arch ../../lib/base ../../lib/common ../../lib/io ../../lib/ipc ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) if (WIN32) add_executable(synergyd WIN32 ${src}) else() add_executable(synergyd ${src}) endif() if (VNC_SUPPORT) list(APPEND libs vnc_server vnc_client) endif() target_link_libraries(synergyd arch base common io ipc mt net platform synergy cryptopp ${libs}) if (CONF_CPACK) install(TARGETS synergyd COMPONENT core DESTINATION bin) endif() synergy-1.4.12-Source/src/cmd/synergyd/synergyd.cpp0000600000175000017500000000204712021261364022255 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CDaemonApp.h" #include #ifdef SYSAPI_UNIX int main(int argc, char** argv) { CDaemonApp app; return app.run(argc, argv); } #elif SYSAPI_WIN32 #define WIN32_LEAN_AND_MEAN #include int WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int) { CDaemonApp app; return app.run(__argc, __argv); } #endif synergy-1.4.12-Source/src/cmd/synergyp/0000700000175000017500000000000012140644175017723 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/synergyp/CMakeLists.txt0000600000175000017500000000316012127576354022475 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src synergyp.cpp ) if (WIN32) list(APPEND src CMSWindowsPortableTaskBarReceiver.cpp CMSWindowsPortableTaskBarReceiver.h resource.h synergyp.ico synergyp.rc tb_error.ico tb_idle.ico tb_run.ico tb_wait.ico ) elseif (APPLE) list(APPEND src COSXPortableTaskBarReceiver.cpp) elseif (UNIX) list(APPEND src CXWindowsPortableTaskBarReceiver.cpp) endif() set(inc ../../lib/arch ../../lib/base ../../lib/common ../../lib/io ../../lib/ipc ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ../../lib/server ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) if (WIN32) add_executable(synergyp WIN32 ${src}) else() add_executable(synergyp ${src}) endif() target_link_libraries(synergyp arch base client common io mt net ipc platform server synergy client cryptopp ${libs}) if (CONF_CPACK) install(TARGETS synergyp COMPONENT core DESTINATION bin) endif() synergy-1.4.12-Source/src/cmd/synergyp/CMSWindowsPortableTaskBarReceiver.cpp0000600000175000017500000002221512120644363027053 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsPortableTaskBarReceiver.h" #include "CMSWindowsClipboard.h" #include "IEventQueue.h" #include "LogOutputters.h" #include "BasicTypes.h" #include "CArch.h" #include "CArchTaskBarWindows.h" #include "resource.h" #include "CArchMiscWindows.h" #include "CMSWindowsScreen.h" // // CMSWindowsPortableTaskBarReceiver // const UINT CMSWindowsPortableTaskBarReceiver::s_stateToIconID[kMaxState] = { IDI_TASKBAR_NOT_RUNNING, IDI_TASKBAR_NOT_WORKING, IDI_TASKBAR_NOT_CONNECTED, IDI_TASKBAR_CONNECTED }; CMSWindowsPortableTaskBarReceiver::CMSWindowsPortableTaskBarReceiver( HINSTANCE appInstance, const CBufferedLogOutputter* logBuffer) : CPortableTaskBarReceiver(), m_appInstance(appInstance), m_window(NULL), m_logBuffer(logBuffer) { for (UInt32 i = 0; i < kMaxState; ++i) { m_icon[i] = loadIcon(s_stateToIconID[i]); } m_menu = LoadMenu(m_appInstance, MAKEINTRESOURCE(IDR_TASKBAR)); // don't create the window yet. we'll create it on demand. this // has the side benefit of being created in the thread used for // the task bar. that's good because it means the existence of // the window won't prevent changing the main thread's desktop. // add ourself to the task bar ARCH->addReceiver(this); } void CMSWindowsPortableTaskBarReceiver::cleanup() { ARCH->removeReceiver(this); for (UInt32 i = 0; i < kMaxState; ++i) { deleteIcon(m_icon[i]); } DestroyMenu(m_menu); destroyWindow(); } CMSWindowsPortableTaskBarReceiver::~CMSWindowsPortableTaskBarReceiver() { cleanup(); } void CMSWindowsPortableTaskBarReceiver::showStatus() { // create the window createWindow(); // lock self while getting status lock(); // get the current status std::string status = getToolTip(); // done getting status unlock(); // update dialog HWND child = GetDlgItem(m_window, IDC_TASKBAR_STATUS_STATUS); SendMessage(child, WM_SETTEXT, 0, (LPARAM)status.c_str()); child = GetDlgItem(m_window, IDC_TASKBAR_STATUS_CLIENTS); SendMessage(child, LB_RESETCONTENT, 0, 0); if (!IsWindowVisible(m_window)) { // position it by the mouse POINT cursorPos; GetCursorPos(&cursorPos); RECT windowRect; GetWindowRect(m_window, &windowRect); int x = cursorPos.x; int y = cursorPos.y; int fw = GetSystemMetrics(SM_CXDLGFRAME); int fh = GetSystemMetrics(SM_CYDLGFRAME); int ww = windowRect.right - windowRect.left; int wh = windowRect.bottom - windowRect.top; int sw = GetSystemMetrics(SM_CXFULLSCREEN); int sh = GetSystemMetrics(SM_CYFULLSCREEN); if (fw < 1) { fw = 1; } if (fh < 1) { fh = 1; } if (x + ww - fw > sw) { x -= ww - fw; } else { x -= fw; } if (x < 0) { x = 0; } if (y + wh - fh > sh) { y -= wh - fh; } else { y -= fh; } if (y < 0) { y = 0; } SetWindowPos(m_window, HWND_TOPMOST, x, y, ww, wh, SWP_SHOWWINDOW); } } void CMSWindowsPortableTaskBarReceiver::runMenu(int x, int y) { // do popup menu. we need a window to pass to TrackPopupMenu(). // the SetForegroundWindow() and SendMessage() calls around // TrackPopupMenu() are to get the menu to be dismissed when // another window gets activated and are just one of those // win32 weirdnesses. createWindow(); SetForegroundWindow(m_window); HMENU menu = GetSubMenu(m_menu, 0); SetMenuDefaultItem(menu, IDC_TASKBAR_STATUS, FALSE); HMENU logLevelMenu = GetSubMenu(menu, 3); CheckMenuRadioItem(logLevelMenu, 0, 6, CLOG->getFilter() - kERROR, MF_BYPOSITION); int n = TrackPopupMenu(menu, TPM_NONOTIFY | TPM_RETURNCMD | TPM_LEFTBUTTON | TPM_RIGHTBUTTON, x, y, 0, m_window, NULL); SendMessage(m_window, WM_NULL, 0, 0); // perform the requested operation switch (n) { case IDC_TASKBAR_STATUS: showStatus(); break; case IDC_TASKBAR_LOG: copyLog(); break; case IDC_TASKBAR_SHOW_LOG: ARCH->showConsole(true); break; case IDC_RELOAD_CONFIG: EVENTQUEUE->addEvent(CEvent(getReloadConfigEvent(), IEventQueue::getSystemTarget())); break; case IDC_FORCE_RECONNECT: EVENTQUEUE->addEvent(CEvent(getForceReconnectEvent(), IEventQueue::getSystemTarget())); break; case ID_SYNERGY_RESETSERVER: EVENTQUEUE->addEvent(CEvent(getResetServerEvent(), IEventQueue::getSystemTarget())); break; case IDC_TASKBAR_LOG_LEVEL_ERROR: CLOG->setFilter(kERROR); break; case IDC_TASKBAR_LOG_LEVEL_WARNING: CLOG->setFilter(kWARNING); break; case IDC_TASKBAR_LOG_LEVEL_NOTE: CLOG->setFilter(kNOTE); break; case IDC_TASKBAR_LOG_LEVEL_INFO: CLOG->setFilter(kINFO); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG: CLOG->setFilter(kDEBUG); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG1: CLOG->setFilter(kDEBUG1); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG2: CLOG->setFilter(kDEBUG2); break; case IDC_TASKBAR_QUIT: quit(); break; } } void CMSWindowsPortableTaskBarReceiver::primaryAction() { showStatus(); } const IArchTaskBarReceiver::Icon CMSWindowsPortableTaskBarReceiver::getIcon() const { return reinterpret_cast(m_icon[getStatus()]); } void CMSWindowsPortableTaskBarReceiver::copyLog() const { if (m_logBuffer != NULL) { // collect log buffer CString data; for (CBufferedLogOutputter::const_iterator index = m_logBuffer->begin(); index != m_logBuffer->end(); ++index) { data += *index; data += "\n"; } // copy log to clipboard if (!data.empty()) { CMSWindowsClipboard clipboard(m_window); clipboard.open(0); clipboard.emptyUnowned(); clipboard.add(IClipboard::kText, data); clipboard.close(); } } } void CMSWindowsPortableTaskBarReceiver::onStatusChanged() { if (IsWindowVisible(m_window)) { showStatus(); } } HICON CMSWindowsPortableTaskBarReceiver::loadIcon(UINT id) { HANDLE icon = LoadImage(m_appInstance, MAKEINTRESOURCE(id), IMAGE_ICON, 0, 0, LR_DEFAULTCOLOR); return reinterpret_cast(icon); } void CMSWindowsPortableTaskBarReceiver::deleteIcon(HICON icon) { if (icon != NULL) { DestroyIcon(icon); } } void CMSWindowsPortableTaskBarReceiver::createWindow() { // ignore if already created if (m_window != NULL) { return; } // get the status dialog m_window = CreateDialogParam(m_appInstance, MAKEINTRESOURCE(IDD_TASKBAR_STATUS), NULL, (DLGPROC)&CMSWindowsPortableTaskBarReceiver::staticDlgProc, reinterpret_cast( reinterpret_cast(this))); // window should appear on top of everything, including (especially) // the task bar. LONG_PTR style = GetWindowLongPtr(m_window, GWL_EXSTYLE); style |= WS_EX_TOOLWINDOW | WS_EX_TOPMOST; SetWindowLongPtr(m_window, GWL_EXSTYLE, style); // tell the task bar about this dialog CArchTaskBarWindows::addDialog(m_window); } void CMSWindowsPortableTaskBarReceiver::destroyWindow() { if (m_window != NULL) { CArchTaskBarWindows::removeDialog(m_window); DestroyWindow(m_window); m_window = NULL; } } BOOL CMSWindowsPortableTaskBarReceiver::dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM) { switch (msg) { case WM_INITDIALOG: // use default focus return TRUE; case WM_ACTIVATE: // hide when another window is activated if (LOWORD(wParam) == WA_INACTIVE) { ShowWindow(hwnd, SW_HIDE); } break; } return FALSE; } BOOL CALLBACK CMSWindowsPortableTaskBarReceiver::staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { // if msg is WM_INITDIALOG, extract the CMSWindowsPortableTaskBarReceiver* // and put it in the extra window data then forward the call. CMSWindowsPortableTaskBarReceiver* self = NULL; if (msg == WM_INITDIALOG) { self = reinterpret_cast( reinterpret_cast(lParam)); SetWindowLongPtr(hwnd, GWLP_USERDATA, lParam); } else { // get the extra window data and forward the call LONG data = (LONG)GetWindowLongPtr(hwnd, GWLP_USERDATA); if (data != 0) { self = reinterpret_cast( reinterpret_cast(data)); } } // forward the message if (self != NULL) { return self->dlgProc(hwnd, msg, wParam, lParam); } else { return (msg == WM_INITDIALOG) ? TRUE : FALSE; } } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { CArchMiscWindows::setIcons( (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 32, 32, LR_SHARED), (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 16, 16, LR_SHARED)); return new CMSWindowsPortableTaskBarReceiver( CMSWindowsScreen::getWindowInstance(), logBuffer); } synergy-1.4.12-Source/src/cmd/synergyp/CMSWindowsPortableTaskBarReceiver.h0000600000175000017500000000360712120644363026524 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #define WIN32_LEAN_AND_MEAN #include "CPortableTaskBarReceiver.h" #include class CBufferedLogOutputter; //! Implementation of CPortableTaskBarReceiver for Microsoft Windows class CMSWindowsPortableTaskBarReceiver : public CPortableTaskBarReceiver { public: CMSWindowsPortableTaskBarReceiver(HINSTANCE, const CBufferedLogOutputter*); virtual ~CMSWindowsPortableTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; void cleanup(); protected: void copyLog() const; // CPortableTaskBarReceiver overrides virtual void onStatusChanged(); private: HICON loadIcon(UINT); void deleteIcon(HICON); void createWindow(); void destroyWindow(); BOOL dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); static BOOL CALLBACK staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); private: HINSTANCE m_appInstance; HWND m_window; HMENU m_menu; HICON m_icon[kMaxState]; const CBufferedLogOutputter* m_logBuffer; static const UINT s_stateToIconID[]; }; synergy-1.4.12-Source/src/cmd/synergyp/COSXPortableTaskBarReceiver.cpp0000600000175000017500000000274312120644363025636 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXServerTaskBarReceiver.h" #include "CArch.h" // // COSXServerTaskBarReceiver // COSXServerTaskBarReceiver::COSXServerTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } COSXServerTaskBarReceiver::~COSXServerTaskBarReceiver() { ARCH->removeReceiver(this); } void COSXServerTaskBarReceiver::showStatus() { // do nothing } void COSXServerTaskBarReceiver::runMenu(int, int) { // do nothing } void COSXServerTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon COSXServerTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new COSXServerTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergyp/COSXPortableTaskBarReceiver.h0000600000175000017500000000230612121366474025303 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CPortableTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CPortableTaskBarReceiver for OS X class COSXServerTaskBarReceiver : public CPortableTaskBarReceiver { public: COSXServerTaskBarReceiver(const CBufferedLogOutputter*); virtual ~COSXServerTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; synergy-1.4.12-Source/src/cmd/synergyp/CXWindowsPortableTaskBarReceiver.cpp0000600000175000017500000000303212120644363026737 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsServerTaskBarReceiver.h" #include "CArch.h" // // CXWindowsServerTaskBarReceiver // CXWindowsServerTaskBarReceiver::CXWindowsServerTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } CXWindowsServerTaskBarReceiver::~CXWindowsServerTaskBarReceiver() { ARCH->removeReceiver(this); } void CXWindowsServerTaskBarReceiver::showStatus() { // do nothing } void CXWindowsServerTaskBarReceiver::runMenu(int, int) { // do nothing } void CXWindowsServerTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon CXWindowsServerTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new CXWindowsServerTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergyp/CXWindowsPortableTaskBarReceiver.h0000600000175000017500000000233212121366474026413 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CPortableTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CPortableTaskBarReceiver for X Windows class CXWindowsServerTaskBarReceiver : public CPortableTaskBarReceiver { public: CXWindowsServerTaskBarReceiver(const CBufferedLogOutputter*); virtual ~CXWindowsServerTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; synergy-1.4.12-Source/src/cmd/synergyp/resource.h0000600000175000017500000000310512120644363021721 0ustar synergysynergy//{{NO_DEPENDENCIES}} // Microsoft Visual C++ generated include file. // Used by synergys.rc // #define IDS_FAILED 1 #define IDS_INIT_FAILED 2 #define IDS_UNCAUGHT_EXCEPTION 3 #define IDI_SYNERGY 101 #define IDI_TASKBAR_NOT_RUNNING 102 #define IDI_TASKBAR_NOT_WORKING 103 #define IDI_TASKBAR_NOT_CONNECTED 104 #define IDI_TASKBAR_CONNECTED 105 #define IDR_TASKBAR 107 #define IDD_TASKBAR_STATUS 108 #define IDC_TASKBAR_STATUS_STATUS 1000 #define IDC_TASKBAR_STATUS_CLIENTS 1001 #define IDC_TASKBAR_QUIT 40003 #define IDC_TASKBAR_STATUS 40004 #define IDC_TASKBAR_LOG 40005 #define IDC_RELOAD_CONFIG 40006 #define IDC_FORCE_RECONNECT 40007 #define IDC_TASKBAR_SHOW_LOG 40008 #define IDC_TASKBAR_LOG_LEVEL_ERROR 40009 #define IDC_TASKBAR_LOG_LEVEL_WARNING 40010 #define IDC_TASKBAR_LOG_LEVEL_NOTE 40011 #define IDC_TASKBAR_LOG_LEVEL_INFO 40012 #define IDC_TASKBAR_LOG_LEVEL_DEBUG 40013 #define IDC_TASKBAR_LOG_LEVEL_DEBUG1 40014 #define IDC_TASKBAR_LOG_LEVEL_DEBUG2 40015 #define ID_SYNERGY_RELOADSYSTEM 40016 #define ID_SYNERGY_RESETSERVER 40017 // Next default values for new objects // #ifdef APSTUDIO_INVOKED #ifndef APSTUDIO_READONLY_SYMBOLS #define _APS_NEXT_RESOURCE_VALUE 109 #define _APS_NEXT_COMMAND_VALUE 40018 #define _APS_NEXT_CONTROL_VALUE 1003 #define _APS_NEXT_SYMED_VALUE 101 #endif #endif synergy-1.4.12-Source/src/cmd/synergyp/synergyp.cpp0000600000175000017500000000444612120644363022316 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define WIN32_LEAN_AND_MEAN #include "Windows.h" #include "CServerApp.h" #include "CClientApp.h" #include "CLog.h" #include "CArch.h" #include "CEventQueue.h" #if WINAPI_MSWINDOWS #include "CMSWindowsPortableTaskBarReceiver.h" #elif WINAPI_XWINDOWS #include "CXWindowsPortableTaskBarReceiver.h" #elif WINAPI_CARBON #include "COSXPortableTaskBarReceiver.h" #else #error Platform not supported. #endif INT WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR lpCmdLine, INT nCmdShow) { #if SYSAPI_WIN32 // record window instance for tray icon, etc CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; CEventQueue events; CLOG->insert(new CMesssageBoxLogOutputter()); int argc = __argc; char** argv = __argv; bool server = false, client = false; for (int i = 0; i < argc; i++) { if (std::string(argv[i]) == "--server") { server = true; } else if (std::string(argv[i]) == "--client") { client = true; } } if (!server && !client) { MessageBox(NULL, "Either the --server argument or the --client argument must be provided.", "Server or client?", MB_OK); return 1; } if (argc <= 2) { MessageBox(NULL, "No additional arguments were provided. Append the --help argument for help.\n\n" "Hint: Create a shortcut and append the \"Target\" field with the arguments.", "No additional arguments", MB_OK); return 1; } if (server) { CServerApp app(createTaskBarReceiver); return app.run(argc, argv); } else if (client) { CClientApp app(createTaskBarReceiver); return app.run(argc, argv); } return 0; } synergy-1.4.12-Source/src/cmd/synergyp/synergyp.ico0000600000175000017500000106227612120644363022314 0ustar synergysynergy ( V00 ¨%~   ¨&F ˆ ÎV hV`( ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ñïï çêî2ëîòìïóëîòíïðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííííííííééé(ãááOãááOãááOßÝÝcÚØØyÖÔÔ€ÖÔÔ€ÖÔÔÿÍÐÔÿÍÐÔÿÎÑÕÿÐÓ×ÿÒÔÕƒÒÔÕƒÕÕÕ€×××~ßßßYâââEäæç;æèé2äçë;æéí2êíòîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëæææ2àààOÔÖÖ€ÊÐÏÿÃÎÌÿ¿ÊÈÿµÂÀÿ²¿½ÿ­º¸ÿ«³²ÿ¦®­ÿ¦«ªÿ¥ª©ÿ¤©¨ÿ¤§ÿš¡¤ÿ›££ÿ£§¨ÿ¥ª¨ÿ©ª¨ÿ¬­©ÿ±²®ÿ³²®ÿ¹¸´ÿ¿À¼ÿÄÅÁÿÅÈÆÿÌÏÍÿÕ××ÿÜÞÞcàáßYæçå;îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ çéé2ÞààYÕ××€ÕÐщÊÅÆʾ¾¾ÿ···ÿ©««ÿœ¢¡ÿ’›ÿŽ™—ÿ‰–”ÿ‚ÿz‡…ÿz‚ÿz‚ÿ|€ÿz~ÿv{zÿsz}ÿry|ÿrzzÿw{|ÿx}{ÿ}~|ÿ‚~ÿ„…ÿ‰ˆ„ÿŒˆÿ‘’Žÿ–—“ÿ™œšÿ £¡ÿ©««ÿ°²²ÿÀÁ¿ÿÈÉÇÿÑÒЉÙÚØyÝÞÜcãäâEìíëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêììãååEÕÚÙ€ÊÏÎÿ¿ÅÄÿ´º¹ÿ¶®¯ÿ¨ ¡ÿ—••ÿŠŒŒÿw‚€ÿjxvÿ_tqÿXqmÿId`ÿJeaÿNgcÿUjgÿZmjÿ_mkÿ]kiÿ]hfÿgroÿmtqÿkrmÿgkfÿejaÿlmdÿlnbÿmk`ÿhgYÿgfXÿgeZÿki^ÿsqgÿ}{qÿ†…{ÿŒ‹ÿ‘’Žÿœ™ÿ¬­©ÿº»·ÿÂÿÿÊËÇÿØÙ×~åæä;éêè(îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÜÜÜcÏÑÑÂÄÄÿ¯´³ÿŸ¤£ÿŽ”“ÿ‡†ÿ{stÿumnÿljjÿgiiÿ]hfÿZhfÿWliÿTmiÿb}yÿoŠ†ÿš–ÿŽ£ ÿ“¦£ÿ—¥£ÿ—¥£ÿœ§¥ÿ¦±®ÿ¯¶³ÿ¬³®ÿ¥©¤ÿ¡¦ÿ¨© ÿ¦¨œÿ¤¢—ÿœ›ÿ‘‚ÿtÿushÿomcÿlj`ÿih^ÿgf\ÿfgcÿklhÿvwsÿ„…ÿ‘ÿ›œ˜ÿ«¬ªÿº»¹ÿÊËÉÿÔÕÓƒãäâEîïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëßßßYÖÖÖ~ÂÂÂܳ³³ÿž£¢ÿ’‘ÿ{€ÿoutÿckjÿYa`ÿFjdÿEvnÿUˆ€ÿ\˜Žÿ]¡–ÿ`¬ ÿe·ªÿcº¬ÿjŶÿtÏÀÿ‚ÚÌÿ‹àÒÿ‘áÔÿ•áÕÿšäØÿ¥çÜÿÛâÝÿáæÝÿÝåÚÿÚÞÓÿØÛÌÿÛÚÌÿÚÚÈÿÙÕÃÿÖѼÿÍȳÿÁ»¨ÿ·±žÿ°ª—ÿª¤‘ÿ¡Šÿœ—ˆÿ‚„~ÿqsmÿ`b\ÿ]_Yÿcd`ÿnokÿ|}yÿ‰Š†ÿžŸ›ÿ«¬¨ÿ¾¿½ÿÏÐÎÝÞÜcèéç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÞÜÜcÍËË¥¶¶¶ÿ¨¨¨ÿ———ÿ………ÿotsÿchgÿagfÿkqpÿu}|ÿy€ÿq•ÿz«£ÿ”Ç¿ÿžÚÐÿœàÕÿšæÚÿ™ëÞÿ“êÜÿëÜÿèÙÿŒäÖÿâÔÿ“ãÖÿšæÚÿ êÞÿªìáÿÞåàÿáæÝÿÝåÚÿÝáÖÿÚÝÎÿÙØÊÿÖÖÄÿÙÕÃÿÝØÃÿÜ×ÂÿÜÖÃÿàÚÇÿãÝÊÿâÜÉÿÛ×ÄÿÖÑÂÿÂľÿ§©£ÿŒŽˆÿ€‚|ÿ{|xÿstpÿjkgÿefbÿmnjÿz{wÿŽÿ¡¢ ÿ³´²ÿÅÆÄÊ×ØÖ~âãáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòæä;êáÞYÊÁ¾ÿ¿··ÿ¯«ªÿŽÿy|zÿdolÿWniÿ@ibÿ5jaÿCˆ}ÿf¸«ÿÜÍÿ~è×ÿoîÕÿmìÓÿlèÐÿjåÑÿ^åÏÿVäÑÿMäÐÿIäÏÿIäÏÿDäÎÿBæÍÿCçÎÿPéÐÿlçÓÿ‰éØÿ¨êÞÿÈë×ÿØçÒÿÚæÒÿãåÏÿèáÈÿëÛ·ÿçÕ¦ÿæÔ™ÿáÓ‹ÿàÓ‡ÿáÖ†ÿã؈ÿåÕÿçÔ—ÿëÒ ÿîÕ£ÿèà¥ÿìä©ÿêß­ÿçÙ¯ÿãÔ³ÿÑĪÿ§™‡ÿzndÿrhaÿngdÿokjÿxywÿ‰ŒŠÿ˜Ÿœÿª´®ÿ»Å¿ÿÓÓÓƒãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíçÛÙyÌÀ¾ÿÄ»¸ÿµ¬©ÿ–ŽŽÿrnmÿ][ZÿUXVÿ\gdÿxŠÿ¹²ÿ™ÎÅÿ‘ÖËÿ‹ÝÐÿ„áÒÿxâÑÿhçÎÿfåÌÿfâÊÿdßËÿZáËÿRàÍÿIàÌÿFáÌÿFáÌÿAáËÿ?ãÊÿAåÌÿMæÍÿiäÐÿ†æÕÿ¥çÛÿÆéÕÿ×æÑÿØäÐÿàâÌÿäÝÄÿåÕ±ÿáÏ ÿàΓÿÜΆÿÛ΂ÿÛЀÿÜÑÿÞΉÿÞËŽÿâÉ—ÿåÌšÿÔÌ‘ÿÝÕšÿåÚ¨ÿæØ®ÿãÔ³ÿÝжÿ×É·ÿÌÀ¶ÿ¿µ®ÿ§ ÿxtsÿUVTÿZ][ÿjqnÿ}‡ÿ“—ÿ³³³ÿÎÎÎÒÓщßàÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïôò îïíèààOÖÎηµ´ÿž¥¢ÿ~‰†ÿXojÿ8ZTÿFumÿcŸ•ÿbªžÿg»¯ÿrÓÅÿ|éÙÿuïÝÿdêÖÿRåÏÿMâÎÿBãÍÿ2çËÿ1æÊÿ4âÊÿ4âÊÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿçÛÿÅêÖÿÖéÐÿ×çÏÿßåÆÿãÞ·ÿãסÿáÒÿàÓ}ÿÝÔmÿÛÖcÿÚ×]ÿÚ×]ÿÜÕ`ÿÜÔcÿßÓgÿáÒnÿØÑtÿÙÏ{ÿÚÓ~ÿÞÕ…ÿàØ‹ÿäÙ•ÿêà¤ÿðè³ÿçÞ³ÿßÖ´ÿÄ» ÿ¬¥’ÿŸ—Šÿ{upÿc\Yÿjefÿÿ   ÿ¯®°ÿÌËÍ¥ÙÛÜyæèé2îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìõòãèæEÕÖÔÿû»ÿª¢¢ÿ‰‡†ÿszwÿZebÿczuÿc…ÿu¤œÿ—ÓÉÿ¢êÞÿ–êÞÿ„å×ÿrßÏÿaÛÉÿWÝÉÿNáËÿKàÌÿ@áËÿ0åÉÿ/äÈÿ3áÉÿ3áÉÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿœæÚÿÅêÖÿ×êÑÿØèÐÿàæÇÿâݶÿáÕŸÿàÑŒÿßÒ|ÿÜÓlÿÚÕbÿØÕ[ÿØÕ[ÿÚÓ^ÿÙÑ`ÿÛÏcÿÝÎjÿÚÓvÿÓÉuÿÍÆqÿÑÈxÿÓË~ÿÔÉ…ÿÓÉÿÒÊ•ÿÖÍ¢ÿßÖ´ÿåÜÁÿèáÎÿÜÔÇÿ«¥ ÿ‚{xÿxstÿlllÿdddÿ|{}ÿ›šœÿ¨ª«ÿÊÌÍÿÞàáYäæç;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßçæYÏ×Ö»ÃÂÿ¤¬«ÿŒ‘ÿtywÿKmgÿ?vmÿ=xpÿnº¯ÿŠéÛÿ€ðßÿjêÙÿTäÑÿGâÍÿ:âËÿ5âÌÿ/åÍÿ.æÎÿ)åÌÿ"ãÉÿ áÇÿ#åÎÿ"äÍÿ(ãÍÿ(ãÍÿ"ãÎÿ"ãÎÿ"ãÎÿ%âÍÿ*áÌÿ1àÌÿ0âËÿ9ãÍÿFäÌÿbâÏÿ|åÒÿ™äÖÿ»åÚÿÑáÚÿÒãÕÿÝáÈÿàÚµÿâÑžÿáψÿäÐyÿåÒkÿâÔ\ÿàÕUÿàÕUÿáÕWÿàÓYÿàÑ]ÿáÐaÿÚÍ_ÿÜÏaÿÝÐbÿÝÐbÿÜÑbÿÝÒcÿÚÒgÿÛÐnÿØÍqÿÚÏÿàÔŽÿã×ÿêܬÿòß¼ÿëÙºÿÛÆ°ÿš—‰ÿe`Wÿlj`ÿyupÿ‰‡†ÿ¥¢¤ÿ²´µÿÊÊÐ¥ÛÛánëëñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîììàââOÍÕÔš¶¾½ÿ•œÿx€ÿinlÿ]b`ÿnŠÿ’ÉÀÿšÕÍÿÜÑÿàÒÿnÞÍÿ_ßÎÿLÜÉÿAÜÇÿ7ßÈÿ4áËÿ,âÊÿ&ÞÆÿ!ÝÄÿßÅÿ áÇÿ"äÍÿ!ãÌÿ&áËÿ&áËÿ áÌÿ áÌÿàËÿ"ßÊÿ(ßÊÿ/ÞÊÿ-ßÈÿ6àÊÿCáÉÿ_ßÌÿyâÏÿ—âÔÿ¹ãØÿÎÞ×ÿÎßÑÿÚÞÅÿÞسÿáÐÿß͆ÿâÎwÿâÏhÿÞÐXÿÜÑQÿÝÒRÿÞÒTÿÞÑWÿÞÏ[ÿßÎ_ÿÙÌ^ÿÝÐbÿÞÑcÿÛÎ`ÿÚÏ`ÿÞÓdÿÜÔiÿÛÐnÿÜÑuÿÓÈxÿÔÈ‚ÿÑÅ‹ÿÐÂ’ÿÞ˨ÿæÔµÿÜDZÿÎ˽ÿþµÿ®¬¢ÿea\ÿZXWÿ|y{ÿÿ¨¨®ÿÂÂÈÿÙÙßyíîòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóèê(åÚÜnÒÇÉÿ¯­­ÿ€‹‰ÿVmiÿJnhÿh‘Šÿxµ«ÿrÔÆÿuè×ÿkâÓÿXÜËÿNáÍÿ>ÞÈÿ9åÍÿ0äËÿ(âÊÿ(âÊÿ'áÉÿ&àÈÿ)áÉÿ*âÊÿ+âÍÿ/âÍÿ-ßÈÿ0ÝÇÿ2ÛÈÿ2ÛÈÿ*ÛÇÿ*ÛÇÿ(ÚÃÿ'ÙÂÿ0ÜÄÿ2ÚÃÿ1ÝÁÿ6ÝÂÿ?ßÁÿWÞÄÿmâÉÿáÎÿ³âÒÿÆÜÐÿÈÜÉÿÓÛ½ÿÚÔ¯ÿÝÌ™ÿÜÆ„ÿâÅtÿáÅgÿÞÅ_ÿÜÄZÿÝÅ[ÿßÆ`ÿßÄbÿßÁhÿàÂiÿãÍdÿâÍ`ÿàË^ÿÞÊZÿÞÍXÿáÐ[ÿàÐXÿÞÎVÿÝÑ[ÿÚË]ÿÞÐfÿåÔsÿßÐtÿßÍzÿæÖƒÿîÚ“ÿãÙ©ÿáسÿáسÿļŸÿ¢œ…ÿ{vgÿge[ÿ}|ÿ›šœÿ¸¶¼ÿÑÑ׉ááçOðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéãäEØÍϚ·¹ÿŸ”–ÿywwÿfqoÿg~zÿy—ÿ›Ä½ÿ¤á×ÿ€âÔÿmàÏÿgÞÏÿYÝÌÿPãÏÿ:ÚÄÿ4àÈÿ)ÝÄÿ%ßÇÿ'áÉÿ(âÊÿ&àÈÿ'ßÇÿ'ßÇÿ&ÝÈÿ(ÛÆÿ*ÜÅÿ.ÛÅÿ0ÙÆÿ/ØÅÿ(ÙÅÿ'ØÄÿ&ØÁÿ$Ö¿ÿ+׿ÿ-Õ¾ÿ+×»ÿ1ؽÿ:Ú¼ÿRÙ¿ÿhÝÄÿŠÜÉÿ¯ÞÎÿÁ×ËÿÂÖÃÿÍÕ·ÿÔΩÿ×Æ“ÿÕ¿}ÿÚ½lÿÞÂdÿÚÁ[ÿØÀVÿÙÁWÿÛÂ\ÿÜÁ_ÿܾeÿܾeÿÜÆ]ÿÞÉ\ÿàË^ÿáÍ]ÿßÎYÿÝÌWÿÞÎVÿáÑYÿÛÏYÿßÐbÿÛÍcÿÙÈgÿÙÊnÿÙÇtÿ×ÇtÿÛÇ€ÿ×ÍÿÖͨÿØϪÿæÞÁÿÕϸÿ·²£ÿ‹ÿljiÿmlnÿ‹‘ÿ¬¬²ÿÅÅËÿàßáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììäää;ÍÍÍš§§§ÿ‰Žÿ_qpÿOplÿa—ÿvĹÿ}ßÑÿzç×ÿdçÓÿDáÌÿ<âËÿ7ßÈÿ3ßÇÿ,ßÆÿ)àÆÿ'àÆÿ&ßÅÿ'àÆÿ+ßÆÿ+ßÆÿ-ÝÅÿ,ÜÄÿ.ÚÂÿ-ÙÁÿ,ØÀÿ&Ú½ÿ%Ù¼ÿ&Ö¸ÿ&Ö¸ÿظÿ×·ÿÕµÿÒ³ÿ$Юÿ%ѯÿ%Ô¯ÿ&Õ°ÿ1ײÿDÙ·ÿTÞ¼ÿ|ÛÀÿ¦Ú¼ÿ»Ù¶ÿ¾Ù²ÿÈÖ¦ÿÎÏ—ÿÑŃÿÒ¾qÿÓ»cÿÓ¼YÿÓºTÿѸPÿѸPÿÓºTÿÔ¹WÿÖ·ZÿÕ¶YÿÔ¾UÿÖÀWÿÙÃZÿÛÅ\ÿÝÅ[ÿÞÆ\ÿÞÇZÿßÈ[ÿßË\ÿßË\ÿÞË\ÿßÌ]ÿÞÍ^ÿßÎ_ÿÝÏ_ÿÜÎ^ÿÙÈqÿ×Ç{ÿàÒ†ÿäÕ–ÿäÙ ÿíâ¶ÿØÏ­ÿ©¡Šÿ…€qÿtqiÿ€~}ÿ¢¢¨ÿ¼¿ÄÿÏÐÚäåï;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ ÖÖÖ~ÂÂÂÿ©©©ÿƒƒƒÿglmÿp‚ÿ‰ª¦ÿ—ÍÆÿÛÐÿzÜÎÿnÛËÿZÝÉÿAÞÉÿ9ßÈÿ6ÞÇÿ2ÞÆÿ,ßÆÿ)àÆÿ'àÆÿ'àÆÿ%ÞÄÿ)ÝÄÿ(ÜÃÿ+ÛÃÿ)ÙÁÿ+׿ÿ*Ö¾ÿ)Õ½ÿ!Õ¸ÿÓ¶ÿ"Ò´ÿ"Ò´ÿÔ´ÿÓ³ÿѱÿÍ®ÿ!Í«ÿ"άÿ Ϫÿ Ϫÿ)Ϫÿ;ЮÿKÕ³ÿsÒ·ÿ Ô¶ÿ´Ò¯ÿµÐ©ÿ¾ÌœÿÃÄŒÿȼzÿʶiÿÌ´\ÿ̵RÿεOÿÍ´LÿÍ´LÿεOÿÏ´RÿѲUÿÒ³VÿϹPÿкQÿÒ¼SÿÓ½TÿÖ¾TÿØÀVÿÛÄWÿÝÆYÿÜÈYÿÜÈYÿÜÉZÿÝÊ[ÿÜË\ÿÝÌ]ÿÛÍ]ÿÛÍ]ÿØÇpÿÓÃwÿØÊ~ÿØÉŠÿÖË’ÿáÖªÿãÚ¸ÿÔ̵ÿ¹´¥ÿŽ‹ƒÿomlÿuu{ÿ“–›ÿ¶·ÁÿÑÒ܉ßàêYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçè2ÛÕրĿÀÿ–––ÿhvuÿTwsÿV‘‰ÿe¹­ÿtßÏÿgìØÿVéÓÿ?ãÊÿ5ÞÄÿ-ÞÃÿ(âÅÿ'áÄÿ%áÄÿ$àÃÿ$àÃÿ$àÃÿ#àÁÿ'ßÁÿ%Û¼ÿ(Û¼ÿ'Ú¹ÿ&Ù¸ÿ%Ø·ÿ#ÖµÿÕ³ÿÔ²ÿÔ¬ÿѪÿЩÿϨÿЧÿÎ¥ÿË£ÿ!È¡ÿ)ÄŸÿ.Ä ÿ-ÆŸÿ2Æ ÿ9Ç¢ÿLʧÿ`άÿ}Í°ÿŸÎ´ÿ³É°ÿ²È«ÿ»Äœÿ¼¼ŒÿÀ´zÿ¾­jÿÁª_ÿ¼¦TÿÀ¨Nÿ¾¨Iÿ¾¨Iÿ¾¨HÿÄ«KÿÉ­Nÿ˯PÿÉ´KÿʵLÿ̶Mÿ͵QÿζRÿѸXÿÖº[ÿؼ]ÿÛ¿`ÿÜÀaÿÛÂ`ÿÜÅ_ÿÜÈ]ÿÝÉ^ÿÞÊ]ÿÞÊ]ÿàÌ_ÿÞÉ`ÿßÌeÿÞÌmÿÛÊsÿÜÌ€ÿãÕ“ÿêܧÿäÛ¯ÿÏÆ¥ÿ¢ž†ÿ{wlÿwtpÿ‘”ÿµ·¿ÿÏÑÙàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÓÔƒº´µÿŸš›ÿwwwÿftsÿwš–ÿ’ÍÅÿ‹ßÓÿwâÒÿVÛÇÿHÛÅÿ<àÇÿ6ßÅÿ.ßÄÿ(âÅÿ'áÄÿ$àÃÿ#ßÂÿ"ÞÁÿ!ÝÀÿܽÿ!Ù»ÿ!׸ÿ$׸ÿ#Öµÿ!Ô³ÿÒ±ÿЯÿÏ­ÿÍ«ÿΦÿÌ¥ÿÊ£ÿÈ¡ÿÈŸÿÇžÿÅÿÃœÿ&Áœÿ,žÿ.Ç ÿ7Ë¥ÿAϪÿVÔ±ÿkÙ·ÿˆØ»ÿ¨×½ÿ¾Ô»ÿ¾Ô·ÿÉÒªÿËË›ÿΈÿʹvÿË´iÿÁ«YÿÁ©Oÿ¼¦Gÿ¸¢Cÿ·¡Aÿ¼£CÿÁ¥Fÿ¦GÿîEÿįFÿDZHÿɱMÿ˳Oÿ̳SÿдUÿдUÿÔ¸YÿÖº[ÿÕ¼Zÿ×ÀZÿØÄYÿÙÅZÿÛÇZÿÛÇZÿÞÊ]ÿÝÈ_ÿÚÇ`ÿÚÈiÿÚÉrÿÒÂvÿÏÁÿÖÈ“ÿÕÌ ÿâÙ¸ÿÕѹÿ«§œÿ|xÿmlpÿ„†Žÿ­¯·ÿÉÉÉ°ãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêèè(ÐÎΰµ´ÿ…–“ÿ]xuÿXˆ‚ÿs¸®ÿvÕÇÿmãÑÿ\ëÕÿFäÌÿ.ÝÂÿ+ßÆÿ(áÇÿ$ßÅÿ$ßÅÿ+áÃÿ*àÂÿ&ÞÀÿ%Ý¿ÿ#ܼÿ!Úºÿ ×µÿ!Ô³ÿ"Ô¯ÿ$Ó®ÿ%Ò¬ÿ"Ï©ÿΦÿË£ÿÊŸÿÉžÿ Řÿ&×ÿ'–ÿ&Á•ÿ'–ÿ)Ęÿ1›ÿ=ÁœÿOÅ¢ÿWȦÿ]έÿfÓ³ÿpعÿ…ÜÀÿ›ßÆÿ±àÊÿÀàÕÿÏÞÖÿÓàÒÿÛÝÉÿÜؼÿÞÏ®ÿÙÇžÿÚÓÿι‚ÿ˳yÿÀ«mÿ½¥cÿ¼£]ÿ¼¡Wÿ¸Sÿ¹›Nÿ¼¢Hÿ¼¢Hÿ¾£IÿÀ¥KÿèNÿŪPÿÉ«RÿË­TÿË®SÿÍ°UÿδVÿжXÿÒ¹WÿÔ»YÿÖ¿[ÿ×À\ÿÛÈYÿÜÉZÿ×ÄUÿÙÅZÿßÍbÿÞÉfÿÙÇhÿÞÌyÿØÊ~ÿßБÿåÚ¦ÿâØ°ÿ¾¸›ÿ‹„sÿwteÿ‡…}ÿªªªÿÇÇǽáááOïïï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿååå;ÖÔÔ€°®®ÿ†‹Šÿgxuÿi„ÿˆ¸²ÿœá×ÿ„ãÕÿeÛÉÿOÞÈÿ?ÝÅÿ0ßÄÿ,àÇÿ'àÆÿ!ÜÂÿ!ÜÂÿ&ܾÿ%Û½ÿ"Ú¼ÿ غÿظÿÕµÿÓ±ÿЯÿϪÿͨÿË¥ÿÉ£ÿÇŸÿÅÿÅšÿÄ™ÿÁ”ÿ$Á•ÿ'–ÿ)Ęÿ-Èœÿ1Ì ÿ<ͦÿJΩÿ[Ñ®ÿbÓ±ÿgØ·ÿoܼÿxàÁÿŠáÅÿŸãÊÿ´ãÍÿÄäÙÿÒáÙÿÕâÔÿÝßËÿàÜÀÿåÖµÿäÒ©ÿçРÿßÊ“ÿÝÅ‹ÿÔ¿ÿÓ»yÿÒ¹sÿÏ´jÿŪ`ÿ¤Wÿ¼¢Hÿº Fÿ¸Cÿ·œBÿ¹žDÿ½¢HÿÃ¥LÿƨOÿŨMÿǪOÿɯQÿ˱SÿÍ´RÿзUÿÒ»WÿÔ½YÿÕÂSÿÛÈYÿÙÆWÿ×ÃXÿÚÈ]ÿÛÆcÿ×ÅfÿÚÈuÿÖÈ|ÿÓÄ…ÿÔÉ•ÿàÖ®ÿßÙ¼ÿü«ÿ–“„ÿwumÿ{{{ÿ   ÿËËËÿãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÎÎί±±ÿ‘““ÿa|xÿZ†ÿp¿´ÿyâÓÿhæÓÿNáËÿBàÈÿ5ÛÂÿ1ÙÂÿ/ÛÃÿ+ÛÃÿ*ÚÂÿ(ÛÂÿ%Ø¿ÿ*Öºÿ)Õ¹ÿ$Ô¶ÿ"Ò´ÿ!Ò±ÿЯÿΩÿ ̨ÿ É¢ÿ!Æ ÿ#Å›ÿ#Á˜ÿ%À”ÿ%À”ÿ%À“ÿ%À“ÿ4Á–ÿ:˜ÿ?Å›ÿBÈžÿEÍ£ÿIѧÿRÓ¬ÿ`Ô¯ÿpÓ³ÿrÕµÿu×¹ÿyÛ½ÿ€ÝÂÿÞÅÿ¤ßËÿµßÎÿÅâÒÿÒßÑÿÔßËÿÙÜÆÿÝÙ½ÿßÔ¶ÿàÏ®ÿàͨÿÙÆ ÿÚÄšÿ×Á—ÿÙÁ“ÿÙÀŽÿؼ†ÿÓ´}ÿЮsÿǧfÿÅ¢^ÿ¾œVÿ¹™Nÿ¹˜Iÿ»›Hÿ½ŸHÿ¿¢GÿÀ¤Fÿ§EÿƬHÿÈ®JÿÈ°LÿʲNÿ͵QÿиTÿ̼RÿÒÂXÿÔÅWÿ×ÃVÿÚÆWÿÙÅVÿ×ÃVÿÙÄ[ÿÖÃbÿÚÆqÿ×Æ}ÿÒŇÿÛОÿàÙ²ÿËÞÿž™„ÿuuuÿ€€€ÿ£££ÿÊÊÊ¥ÞÞÞYîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììÒÒÒƒ³³³ÿ‹ÿsuuÿn‰…ÿ¹ÿ‘àÕÿvßÐÿ\ÚÇÿHÛÅÿ=ÛÃÿ3ÙÀÿ5ÝÆÿ3ßÇÿ(ØÀÿ'׿ÿ'ÚÁÿ$×¾ÿ(Ô¸ÿ'Ó·ÿ!ѳÿϱÿέÿÌ«ÿÊ¥ÿȤÿÅžÿÂœÿÀ–ÿ½”ÿ"½‘ÿ"½‘ÿ#¾‘ÿ$¿’ÿ7Ä™ÿ=Å›ÿCÉŸÿFÌ¢ÿGÏ¥ÿJÒ¨ÿRÓ¬ÿ^Ò­ÿpÓ³ÿrÕµÿtÖ¸ÿwÙ»ÿÜÁÿÞÅÿ¥àÌÿ·áÐÿÅâÒÿÔáÓÿ×âÎÿÝàÊÿàÜÀÿàÕ·ÿßέÿÞ˦ÿ×ÄžÿÙÙÿ×Á—ÿØÀ’ÿØ¿ÿÙ½‡ÿع‚ÿض{ÿ×·vÿÔ±mÿË©cÿ¢Wÿ¾Nÿ»›Hÿ¹›Dÿ·š?ÿºž@ÿ½¢@ÿÀ¦Bÿ¨DÿªFÿëGÿÆ®JÿɱMÿɹOÿʺPÿ˼NÿÒ¾QÿØÄUÿÚÆWÿÚÆYÿÚÅ\ÿÓÀ_ÿÔÀkÿÔÃzÿÍÀ‚ÿËÀŽÿÕΧÿÞÖ±ÿÏʵÿžžžÿtttÿwwwÿ§§§ÿËËËÿàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîüú áîìOÑÖÕ‰¹®°ÿ–‹ÿJ}uÿIžÿr;ÿzêØÿ_åÑÿ>ÚÂÿ1ÚÀÿ*ÛÀÿ'ÜÀÿ'ÜÀÿ(Ü¿ÿ'Û¾ÿ'Ý»ÿ$Ú¸ÿ!ضÿÖ´ÿ$Õªÿ&Ò¨ÿ"Шÿ#Ì¥ÿ É¢ÿ ÅŸÿÚÿÀ˜ÿ!Á—ÿ!½”ÿ¼Žÿ ¹Œÿ$¼‹ÿ'¿Žÿ+Ä‘ÿ.Ç”ÿBŤÿKƦÿPÈ©ÿUÊ«ÿ[Ë©ÿZʨÿXÊ¥ÿSʤÿPÌ¢ÿOË¡ÿPÌ ÿVÏ£ÿaÑ¢ÿiУÿpÕ¨ÿƒ×­ÿœÖ³ÿ¯Ô´ÿ´Ó¬ÿÂÍ¥ÿÉÆ™ÿÒ»ÿÒ¶€ÿѳzÿϱvÿΰuÿÌ´xÿи|ÿηÿÏ·ƒÿѶƒÿβƒÿѱˆÿ̬ƒÿʬ{ÿŪqÿ½£aÿ¶ŸTÿ²Lÿ¯—Cÿ®˜@ÿ³˜Aÿ¶›Dÿ»Fÿ½ŸHÿÅ¢LÿɤOÿ˦QÿÅ®HÿȱKÿÌ´PÿÏ·SÿѹUÿÔ¼Xÿ×ÁXÿÚÄ[ÿÚÆ[ÿÚÆ[ÿØÇ`ÿÚÆgÿÚÆoÿàÉ{ÿìÕŠÿøÛ¢ÿÜÈ·ÿ±¨šÿŒ…tÿ||nÿŸ¨›ÿÈÓÉ°ÕâÚ€êõòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöô(ÞìêYÐÝÛÿ¶»ºÿœ‘“ÿ…z|ÿiœ”ÿsȺÿ‰äÕÿnÞÌÿNÔÀÿ@ÜÄÿ6ßÅÿ%Ö»ÿ%Ú¾ÿ%Ú¾ÿ$Ø»ÿ#׺ÿ!×µÿÕ³ÿѯÿÏ­ÿΣÿË¡ÿÉ¡ÿÅžÿÃœÿ¿™ÿ¾•ÿ»“ÿºÿ¸ÿºŒÿ!ºÿ'¿Žÿ+Ã’ÿ/È•ÿ2˘ÿAÄ£ÿG¢ÿHÀ¡ÿKÀ¡ÿQÁŸÿPÀžÿM¿šÿG¾˜ÿ@¼’ÿ=¹ÿ:¶Šÿ<µ‰ÿF¶‡ÿP·ŠÿY¾‘ÿn˜ÿ†Àÿ—¼œÿ›º“ÿ§²Šÿ«¨{ÿ²›mÿ±•_ÿ¯‘Xÿ°’Wÿ®Uÿ­•Yÿ²š^ÿ´eÿ½¥qÿǬyÿȬ}ÿƦ}ÿƦ}ÿʬ{ÿË°wÿƬjÿÀ©^ÿº¥Tÿ¶žJÿ®˜@ÿ²—@ÿ²—@ÿ¶˜Aÿ¸šCÿ¿œFÿÂHÿÄŸJÿÀ©CÿìFÿǯKÿʲNÿÌ´PÿÏ·SÿÒ¼SÿÔ¾UÿÕÁVÿÖÂWÿÔÃ\ÿÕÁbÿÔÀiÿØÁsÿßÈ}ÿèË’ÿáͼÿÓʼÿ±ª™ÿ……wÿ}†yÿ¨žÿÅÒÊÿÜçäcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëÛÖ×ÿ¼ÄÃÿ‚“ÿbyuÿl˜‘ÿq̽ÿoãÐÿoèÔÿQÚÄÿ;Ô»ÿ1Û¿ÿ*ÞÁÿ'Û¾ÿ$Ú»ÿ#Ùºÿ$׶ÿ%Ô³ÿ#Ò°ÿ Ï­ÿͨÿ˦ÿ!ÉžÿÆ›ÿÄ–ÿ”ÿÀ’ÿ¾ÿ¼ÿ»ŒÿºŠÿº‹ÿ$¼‹ÿ-½ÿ3¿ÿ<À’ÿ@“ÿAÔÿ9Åÿ4À‹ÿ/»†ÿ,¸ƒÿ*¸ƒÿ&¸‚ÿ·€ÿµ~ÿ´|ÿ´|ÿ´~ÿ·ÿ(¸„ÿ7ºˆÿ?¿ŽÿUÁ“ÿ~Ñÿ–¾Žÿ—»‡ÿž²}ÿ£§lÿ¦›_ÿ¨’PÿªHÿ¨‹@ÿ§‡<ÿ¨ˆ<ÿ­‰=ÿ­‰=ÿµBÿ¿’HÿÀ’Kÿ»™Sÿ¾œVÿÇ¥_ÿÍ«eÿ˨dÿɦbÿÉ£bÿÄž]ÿ¾˜Wÿ»•Tÿ¶’Lÿ´‘Gÿ´”Aÿ¶˜Aÿ¸œ>ÿºž@ÿ¾¡FÿÁ¤IÿŨMÿÈ«PÿÊ­Rÿ̯TÿÏ´RÿѸRÿÓ½TÿÔ¾UÿÓÀWÿÕÁ\ÿÓ¿`ÿÔ¿dÿÖÂjÿÛÃwÿÝÌ”ÿíݹÿÝѯÿ³«”ÿ„„tÿ€|ÿ®°°ÿÎÐÐéëë(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåàáOËÆÇÿ”œ›ÿevsÿsŠ†ÿ›ÇÀÿ„ßÐÿkßÌÿ]ÖÂÿLÕ¿ÿAÚÁÿ.ؼÿ!Õ¸ÿ'Û¾ÿ"عÿ Ö·ÿ Ó²ÿ!ЯÿάÿË©ÿÊ¥ÿÈ£ÿÅšÿØÿÁ“ÿ¾ÿ½ÿ¼Žÿ»Œÿº‹ÿ»‹ÿ ¼ÿ&¾ÿ.¾Žÿ1½Žÿ7»ÿ7¹Šÿ7¹Šÿ-¹„ÿ*¶ÿ&²}ÿ#¯zÿ ®yÿ°zÿ²{ÿ²{ÿµ}ÿ·ÿ»…ÿ#¿‰ÿ1ÁÿAÄ’ÿHÈ—ÿ]É›ÿ‡ÌšÿŸÇ—ÿ¡Å‘ÿ©½ˆÿ¯³xÿ²§kÿ³[ÿµ˜Sÿ­Eÿ­Bÿ­Aÿ°Œ@ÿ«‡;ÿ¬„9ÿ°ƒ9ÿ¬~7ÿ©‡Aÿ«‰Cÿ²Jÿ¸–Pÿº—Sÿ¿œXÿÆ _ÿÆ _ÿÅŸ^ÿÂœ[ÿ¼˜Rÿ¶“Iÿ²’?ÿ²”=ÿ´˜:ÿ·›=ÿºBÿ¼ŸDÿ¿¢GÿÂ¥JÿŨMÿÈ«PÿË°NÿÍ´NÿϹPÿÑ»RÿнTÿÓ¿ZÿÒ¾_ÿÓ¾cÿÓ¿gÿÕ½qÿÌ»ƒÿØȤÿßÓ±ÿÖηÿ©©™ÿ~}yÿ‰‹‹ÿ°²²ÿ×ÙÙ~èêê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÜnÏÇȽ«£¤ÿcxuÿYŒ„ÿxǹÿvâÏÿUãÌÿHâÉÿ8×½ÿ,Ó¸ÿ)ܽÿ&ܽÿÕµÿÓ³ÿÔ±ÿ Ò¯ÿ"Ï©ÿ#˦ÿ"É¢ÿÆŸÿÄ›ÿ™ÿÁ‘ÿ¿ÿ½Šÿ»ˆÿ»„ÿ¹ƒÿº‚ÿ¹‚ÿ ºƒÿ$º„ÿ(»‡ÿ*º†ÿ*·†ÿ,´„ÿ+±ƒÿ*°‚ÿ·yÿ·yÿ·zÿ¶zÿ´|ÿ"µÿ&º„ÿ,»Šÿ/¾ÿ7¼‘ÿ>¼’ÿJ»–ÿV¼™ÿgÀŸÿpƨÿ…ƬÿšË¯ÿ«É¬ÿ­Æªÿ±À¡ÿµ¶–ÿ´ªˆÿ³¢{ÿ´œrÿ­–fÿ¬‘^ÿ­’Zÿ®Uÿ®ŒPÿ°‹Oÿµ‰Lÿ±…Hÿ©…7ÿ§ƒ5ÿª†8ÿ­ˆ>ÿ°ˆ@ÿ¶ŒIÿÀ”TÿÖYÿÖYÿÄ—ZÿÀ—Xÿ¼•Qÿ´’Fÿ°?ÿ®’;ÿ°”=ÿ¶”@ÿ·”Dÿº—Gÿ½šJÿÀžKÿÄ¢OÿǧNÿɪMÿ̱OÿεOÿϹPÿÑ»RÿÓ¾UÿÕÀWÿÕÂ[ÿÕÀ]ÿÕÂgÿÖÁvÿÞÌÿåÔ©ÿÖÊ®ÿ¥š’ÿ‚zzÿ”ÿÀ¿»ÿÛÚÖ~ððêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñéê(ØÐщª¢£ÿyzÿp…‚ÿŒ¿·ÿ’áÓÿlØÅÿLÚÃÿBÜÃÿ9ؾÿ-Ô¹ÿ%عÿ"عÿÖ¶ÿÔ´ÿÒ¯ÿЭÿ̦ÿ È£ÿÅžÿ›ÿ¿–ÿ½”ÿ½ÿ»‹ÿº‡ÿ¸…ÿ¸ÿ·ÿ¸€ÿ·€ÿ¸ÿ"¸‚ÿ#¶‚ÿ$´€ÿ#°ÿ$¬|ÿ%«}ÿ%«}ÿ ¶xÿ¹{ÿ¼ÿ½ÿ$½…ÿ+¾Šÿ0ÄŽÿ8Ç–ÿ@ÏžÿLѦÿXÖ¬ÿhÙ´ÿvܹÿˆáÀÿåÇÿ¢ãÉÿ³äÈÿÅãÆÿÉâƽÐßÀì×ظÿÚЮÿÜˤÿßÇÿÕ¾ŽÿÏ´ÿÈ­uÿ¤iÿ½›_ÿ¼—[ÿ¿“Vÿ¹Pÿ²Ž@ÿ­‰;ÿ«‡9ÿ¨ƒ9ÿ¨€8ÿª€=ÿ°„Dÿ°ƒFÿµˆKÿºPÿ¼“Tÿ½–Rÿ·•Iÿ²‘Aÿ®’;ÿ­‘:ÿ²<ÿ³@ÿµ’Bÿ¹–Fÿ¼šGÿ¿Jÿ¢IÿÄ¥HÿÈ­KÿʱKÿ˵LÿÍ·NÿιPÿÒ½TÿÒ¿XÿÓ¾[ÿÒ¿dÿÓ¾sÿÖÄ…ÿÔØÿÝѵÿÌÁ¹ÿ˜ÿ„€ÿš™•ÿÀ¿»ÿããÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëêÐÑ϶·µÿ~Œˆÿfˆÿx½°ÿäÒÿcáËÿ?Ú¿ÿ/ÜÀÿ%׺ÿ"عÿ$Ú»ÿ×µÿÓ±ÿÔ®ÿ Õ¯ÿϧÿ!Ì¥ÿ#ÊŸÿ$Æœÿ"ÖÿÀ“ÿ½ÿ»ÿ»…ÿ¸ƒÿ·€ÿ¶ÿ·|ÿ!·|ÿ!·{ÿ!·{ÿ!·{ÿ µ}ÿ´|ÿ±|ÿ¯zÿ®}ÿ±€ÿ³†ÿ'·ÿ2¸”ÿ?½šÿQ¡ÿdƨÿuɱÿ†Î¸ÿ•Î¿ÿ§ØÊÿ·ÞÖÿÅèÞÿÕîêÿÞóñYéõõ(îöö íõõéöø(ê÷ùí÷÷ÿÿÿÿÿÿÿÿÿøïìøðé(ìæÛnàÛÌšÕѾÿÍÇ°ÿÀ»¢ÿº²•ÿ°¨‹ÿ¨}ÿ¶™rÿ²”eÿ«\ÿ¨ŠQÿ£„Eÿ¤ƒ=ÿ¤„8ÿ¤€4ÿ«‡;ÿ±‰>ÿ¶ŽCÿ¹Hÿ¹Kÿ¸JÿµŒGÿ´‹Fÿ²Œ>ÿ³?ÿ´Ž@ÿ·‘Cÿº•Eÿ½˜HÿÀ›IÿÁžHÿÄ¥JÿȪKÿÉ®Lÿ˲Lÿ˵KÿϹOÿÒ¾QÿÓ¿RÿÓ¾QÿØÂYÿÙÄiÿÖÂ{ÿÜÌ—ÿäÕ´ÿɼ¦ÿ”Šÿ‡zÿ£ œÿÈÇÃÜëéé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòðï âàßYÂÃÁÿˆ‰‡ÿv„€ÿ–¸±ÿ”ÙÌÿyÜÊÿ\ÚÄÿ>Ù¾ÿ-Ú¾ÿ$Ö¹ÿ!׸ÿ Ö·ÿÒ°ÿÒ°ÿÒ¬ÿÈ¢ÿÈ ÿÆŸÿÄ™ÿÁ—ÿÀ“ÿ½ÿºŒÿ¸Šÿ·ÿµ€ÿ´}ÿ³|ÿ´yÿµzÿµyÿ´xÿ°tÿ°xÿ°xÿ¯zÿ°{ÿµ„ÿ$¼‹ÿ)À“ÿ5Å›ÿ@Æ¢ÿQϬÿhÙ¸ÿ‚äÆÿšîÖÿ­õßÿ½öçÿÇøê½Ôûó€Ýÿöcæÿû2ëÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúõæ2öòßYöðÙyïêщéáÄÊÛÓ¶ÿÐÅ¥ÿαŠÿȪ{ÿ¾ oÿ¸šaÿ°‘Rÿ¯ŽHÿ¬Œ@ÿª†:ÿ©…9ÿ«ƒ8ÿ¬„9ÿ¯…>ÿ²‰DÿµŒGÿµŒGÿ´‹Fÿ¯‰;ÿ°Š<ÿ°Š<ÿ²Œ>ÿµ@ÿ¸“Cÿº•Cÿ»˜Bÿ¼Bÿ¤EÿŪHÿÆ­GÿDZGÿ˵KÿÏ»NÿмOÿÓ¾QÿÑ»RÿϺ_ÿÒ¾wÿË»†ÿÖǦÿßÒ¼ÿº±§ÿ†€yÿ‘ŽŠÿ«ª¦ÿÖÔÔ€ðñï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéäãEÍÈÇÿ—¢ŸÿZƒ{ÿb¨›ÿãÑÿcâÉÿIáÄÿ;Ù»ÿ.Ù¹ÿ#Ù·ÿ!×µÿÕ²ÿÓ°ÿÒ¬ÿϪÿ̤ÿÊžÿƘÿ ÖÿÁ‘ÿ½Žÿ»‰ÿ¹‡ÿ¸„ÿ·ƒÿ³{ÿ³{ÿµyÿ¶zÿ´xÿ±uÿ°tÿ°uÿ²wÿ¯yÿ#°}ÿ+²„ÿ1´‰ÿ9¶ÿCÀ™ÿVɨÿ“ƾÿ¬ÒÌÿ¼âÜÿÌêåÿÛðínëøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíøè(æíÞYÜÖÏÿ×ÉÃÿĺ¨ÿ´ªŒÿ¨Ÿsÿ¤—_ÿ¡“Qÿ£Gÿ¥ŽBÿ¤…:ÿ¤7ÿ¨7ÿ©8ÿ±?ÿ¹‡Eÿ»‰Gÿ²=ÿ±Œ<ÿ°‹;ÿ¯Š:ÿ²‹<ÿµŽ?ÿ¸‘Bÿº“Dÿ½™EÿÀœHÿ¡KÿŦKÿƪKÿÊ°LÿεOÿиNÿÒ¸LÿÕ»OÿÖÀWÿÒÀcÿÐÁkÿÐÄ~ÿØÍ™ÿÝÕ°ÿµ¯˜ÿ‰†~ÿ’Žÿ¸¸¸ÿÝßßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèé(ÕÐ϶±°ÿ|‡„ÿp™‘ÿ}öÿxÜÊÿ_ÞÅÿBÚ½ÿ9×¹ÿ(Ó³ÿ Ö´ÿÕ³ÿÒ¯ÿЭÿÏ©ÿ˦ÿÉ¡ÿÇ›ÿÕÿÀ“ÿ¾Žÿº‹ÿ¹‡ÿ·…ÿ¶‚ÿµÿ´|ÿ²zÿ²vÿ²vÿ±uÿ°tÿ±uÿ²wÿ°uÿ ´~ÿ,¹†ÿ6½ÿ?—ÿMÊ£ÿ]Ú³ÿqäÃÿ»îæÿÏõï×ý÷~áÿúOêÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõüíüöï üîè(îäÒƒá×¹ÿÒÉÿƹÿ´¦dÿ«˜Oÿ©’Fÿª‹@ÿ«ˆ>ÿ­†<ÿ©8ÿ­};ÿ³?ÿ´‚@ÿ®‰9ÿ®‰9ÿ®‰9ÿ®‰9ÿ°‰:ÿ²‹<ÿµŽ?ÿ¶@ÿ·“?ÿº–Bÿ»šDÿ¿ EÿÀ¤EÿéEÿȯIÿ˳IÿδHÿÑ·KÿÑ»RÿÍ»^ÿÊ»eÿɽwÿÎÃÿÓ˦ÿÑË´ÿ©¦žÿˆƒ„ÿÿÇÉɽàââOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÛÜn²·µÿ„•‘ÿ[ƒÿo³ÿläÌÿDÞÁÿ5âÂÿ)Ö¶ÿ+Ö¶ÿ'Ò²ÿ$Ô¯ÿ"Ò­ÿ Ï©ÿ"ͧÿ#Ê¡ÿ#Çžÿ!Ùÿ!Á“ÿ¿ÿ ½‹ÿº‡ÿ¸…ÿ·ÿµÿ´|ÿ²{ÿ²wÿ°uÿ¯uÿ°vÿ±wÿ°zÿ²|ÿ³‚ÿ%³†ÿ<¶ÿQ½™ÿhÂ¥ÿƒÌ²ÿ¥ÜÉÿ»ðÜÿÚøënÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó÷ëéíÚnÞÝÃÿÅ£ÿ´«…ÿ¬Ÿsÿ©•fÿ¨Zÿ©‰Nÿ¥‚Bÿ©9ÿª‚7ÿ§4ÿªƒ8ÿ«„9ÿ¬‡7ÿ­ˆ8ÿ­‡5ÿ®ˆ6ÿ°‰:ÿ²‹<ÿµŽ@ÿ·Bÿ¹”Dÿ¼—Gÿ½œFÿÁ¢GÿĨIÿÇ«LÿȯMÿʱOÿθOÿкQÿλTÿμ]ÿÑÃqÿÓƈÿÜÓ§ÿÍÆ­ÿ ÿ’Šÿ¨©¥ÿÌÍÉ°ìñè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêåæ;ÏÊË¥šŸÿx‰…ÿ€²¨ÿˆÛÌÿjâÊÿ>Ø»ÿ0ݽÿ%Ò²ÿ(Ó³ÿ'Ò²ÿ!ѬÿϪÿ̦ÿÉ£ÿÆÿÚÿ¿•ÿ½ÿ»‰ÿ¹‡ÿ·„ÿµ‚ÿ´~ÿ³}ÿ²zÿ°yÿ¯tÿ®sÿ°vÿ²xÿµ{ÿµÿ¹ƒÿ#»Šÿ2À“ÿMÇ¡ÿgÓ¯ÿƒÝÀÿ£ìÒÿÅüéÊÓÿôƒèÿù(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿíüûáOíêË¥âÙ³ÿÎÁ•ÿï€ÿ¸jÿ²’Wÿ®‹Kÿ²ŠBÿ¯‡<ÿ©6ÿ¨6ÿ©‚7ÿª…5ÿ¬‡7ÿ¬†4ÿ«…3ÿ¬…6ÿ¯ˆ9ÿ³Œ>ÿµŽ@ÿ¶‘Aÿ¹”Dÿº™Cÿ¾ŸDÿÁ¥FÿĨIÿŬJÿÇ®Lÿ˵LÿÍ·Nÿ˸QÿʸYÿÉ»iÿʽÿË–ÿÏȯÿ¿±ÿ–“ŽÿŽ‹ÿº»·ÿÙÞÕ€îóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ÔÙØ€¤±¯ÿr“Œÿg¥™ÿ{×ÄÿlæÎÿCÙ¼ÿ0Ö·ÿ%×´ÿ"Ô±ÿ Ò¯ÿ άÿ"Ï©ÿ#˦ÿ"É ÿ"Æÿ#Ùÿ#Á“ÿ½Žÿ »ˆÿ¹ƒÿ·ÿµ~ÿ³|ÿ³zÿ²yÿ°xÿ¯wÿ±uÿ±uÿ°yÿ°~ÿ%±‚ÿ4±‰ÿA·”ÿVºžÿpÆ®ÿ‘ÕÄÿ¶çÙÿÔóì€ëüøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÔ€×ʼÿÁ³œÿ´¡~ÿ¨”dÿ¨Tÿ£Hÿ£†Aÿ§}:ÿ§}:ÿ¨€8ÿ©‚7ÿ©„4ÿ¨ƒ3ÿ«„5ÿ®‡8ÿ¯‡<ÿ±‰>ÿ³ŒAÿµŽCÿ¶“Cÿ¹—Cÿ¼ŸDÿ¿¢GÿÀ¥Nÿ§PÿÇ®NÿαNÿϳNÿѵPÿѹYÿÏ»fÿÑÂ}ÿÕÉ“ÿØѪÿ¯«“ÿŽŽ~ÿ§¢ŸÿÎÉÊÿîéê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèææ2¾ÃÂÿˆ•“ÿs”ÿ‡Å¹ÿÛÈÿdÞÆÿ=Ó¶ÿ/Õ¶ÿÑ®ÿ%×´ÿ Ò¯ÿɧÿË¥ÿ È£ÿÅœÿ™ÿ¿•ÿ½ÿ¹Šÿ¸…ÿ¶€ÿµÿ³|ÿ²{ÿ²yÿ±xÿ°xÿ¯wÿ²vÿ²vÿ±zÿ°~ÿ&²ƒÿ;¸ÿPÆ£ÿjβÿæÎÿ°ôãÿÒÿõƒæÿþ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüïáOëÝƽ×Ä¡ÿ¿«{ÿ³›_ÿ¨”Mÿ§ŠEÿ«>ÿ§}:ÿ¦~6ÿ¨6ÿ¨ƒ3ÿ§‚2ÿªƒ4ÿ®‡8ÿ­…:ÿ®†;ÿ°‰>ÿ²‹@ÿ²?ÿ¶”@ÿ¸›@ÿºBÿ½¢Kÿ¾£LÿÄ«Kÿ̯LÿβMÿϳNÿζVÿË·bÿȹtÿÏÃÿÑÊ£ÿËǯÿ¢¢’ÿŽ‰†ÿ¸³´ÿáÜÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëéé(ÓÑщ¡ª§ÿu”ÿp°¤ÿ{ÙÈÿcÛÃÿF×»ÿ9Ó¶ÿ.Ѳÿ(Ï®ÿ&Ò°ÿͪÿʧÿÈžÿÅœÿ—ÿ¾”ÿ»ÿ¹Šÿ¶…ÿ¶€ÿµ~ÿ³|ÿ³zÿ±yÿ°xÿ°xÿ®wÿ®wÿ°wÿ³zÿ%µÿ:¶ŠÿQ»—ÿrƪÿ˜ØÅÿ»åÚÿÝøôcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòèÖ~ÙϱÿƸŽÿ°¥sÿ¥”[ÿ²ŠPÿ¯ƒFÿ©>ÿ©€;ÿ¨‚4ÿ§3ÿ©‚3ÿ¬…6ÿªƒ8ÿ¬…:ÿ®‡<ÿ°‰>ÿ°=ÿ³‘=ÿ´—<ÿ¶™>ÿ·Iÿ¹ŸKÿĤKÿ̪MÿÓ­MÿÔ®NÿÓ²QÿзUÿųZÿοvÿÏÇ‹ÿÙÓªÿ½¤ÿ–‰ÿ¤–¢ÿȾÊÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞÞY¾¼¼ÿ–“ÿž—ÿŠÊ¾ÿy×ÆÿcÛÃÿ?дÿ7Ñ´ÿ&ɪÿ)ЯÿʨÿÅ¢ÿ˨ÿÆœÿ™ÿ¿”ÿ»‘ÿ¸Œÿ·ˆÿ³‚ÿ³}ÿ³|ÿ²{ÿ²yÿ°xÿ°xÿ¯wÿ®wÿ®wÿ±xÿ¸ÿ0ÀŒÿKÇ›ÿfЬÿŒàÄÿ¶öãÿÜÿûcèÿÿ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï þôÖ~ìÞ´ÿÌÁÿ¸§nÿ½•[ÿ·‹Nÿ®„Cÿ«‚=ÿª„6ÿ§3ÿ§€1ÿªƒ4ÿ§€5ÿ©‚7ÿ¬…:ÿ®‡<ÿ­Š:ÿ¯9ÿ°“8ÿ²•:ÿ²˜Dÿ´šFÿ¿ŸFÿÇ¥HÿΨHÿЪJÿÏ®Mÿ˲PÿųZÿĵlÿûÿÈ™ÿÑ̳ÿ±¨¤ÿ”†’ÿ°¦²ÿÛÛÛnîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçèEÜÔÕ€¬¤¥ÿx™’ÿh·©ÿbêÐÿ9ܽÿ*Úµÿ%Õ°ÿ)Ϫÿ&̧ÿ%Ì¥ÿ#Ê£ÿ!Çžÿ!šÿ%Ãÿ#Á‹ÿÀŒÿ¼Œÿ·Šÿ´ˆÿ²ƒÿ±~ÿ ±xÿ µwÿ²tÿ°sÿ ¯vÿ­xÿ­wÿ°‚ÿ$¯‰ÿ>¶—ÿV¼ ÿ~űÿ±ÞÎÿäòì;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ØÖ~¸¹·ÿ©¤ƒÿž“_ÿŸŒOÿ¦ŠCÿª2ÿ¬~0ÿ³‚8ÿ®{5ÿ¥}5ÿ£€7ÿ¡ˆ2ÿ£Š4ÿ¦‹4ÿ¯Œ6ÿ¸Š<ÿ¹‹=ÿ»”?ÿ»˜Bÿ½›Gÿ½ Kÿ¿¤Mÿ©MÿÆ®JÿÍ°Mÿ̯LÿØ»XÿÕ»aÿÚÄ‚ÿØÆ—ÿÔƯÿ—†ÿ˜™ÿÈÊËÿæèé2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚßànÈÀÁÿ¥žÿ‡¨¡ÿvÅ·ÿ[ãÉÿ4׸ÿ'ײÿ#Ó®ÿ'ͨÿ$Ê¥ÿ#Ê£ÿ!È¡ÿÄ›ÿÀ˜ÿ#Á‹ÿ!¿‰ÿ½‰ÿºŠÿµˆÿ²†ÿ±‚ÿ°}ÿ ²yÿ µwÿ²tÿ°sÿ ¯vÿ ®yÿ°zÿ³…ÿ,·‘ÿJ£ÿkѵÿ™àÌÿÆóã½ìúôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíÜÝÛnÅÀŸÿ²§sÿ©–Yÿ¬Iÿ¯†7ÿ¯3ÿ²7ÿ®{5ÿ¥}5ÿ£€7ÿ ‡1ÿ¡ˆ2ÿ¥Š3ÿ®‹5ÿ·‰;ÿ¹‹=ÿ¹’=ÿ¹–@ÿº˜DÿºHÿ¼¡Jÿ¿¦JÿĬHÿË®KÿË®KÿÒµRÿδZÿÒ¼zÿÔ“ÿÒÄ­ÿ´ª£ÿž™šÿ¬®¯ÿÞàáYîíïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêïîÈÐÏ° ¨§ÿœšÿ…¿´ÿw×ÆÿJܾÿ.ѱÿ&Ò®ÿ"Ϊÿ$ˤÿ"É¢ÿ!ÈŸÿÅœÿ—ÿ½“ÿ¿ˆÿ¼†ÿ¹…ÿ´…ÿ²ƒÿ°ÿ¯}ÿ°yÿ¯tÿ°uÿ¯sÿ¯sÿ°yÿ¯}ÿ#±„ÿ;µÿ`½¢ÿ‰Ë¸ÿ§äÐÿÌ÷êÿéÿø(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäàÎʾ¢ÿµ¥{ÿ¯—cÿ«ŒGÿª„<ÿ«‚9ÿ§~5ÿ§~9ÿ¨:ÿ¤8ÿ¥‚9ÿ¨„8ÿ­†7ÿ´‰8ÿ¶‹:ÿ¶Ž;ÿµ‘=ÿµ•Bÿ¸˜Eÿ¸›Fÿ¼¡Gÿ¦GÿÅ©JÿÊ­KÿÊ­KÿÈ®TÿÍ´nÿп‡ÿÓßÿÔË°ÿ¤ž“ÿ‘‘‘ÿÌÌÌÿãááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàåäO²º¹ÿ‘™˜ÿ—¤¢ÿ‘ËÀÿzÚÉÿAÓµÿ,ϯÿ"Ϊÿ˧ÿ"É¢ÿ Ç ÿÅœÿ™ÿ¿”ÿºÿ½†ÿ¹ƒÿ¶‚ÿ±‚ÿ°ÿ®ÿ­{ÿ¯xÿ¯tÿ°uÿ¯sÿ°tÿ²{ÿ!´‚ÿ,ºÿGÁ›ÿsеÿŸáÎÿ¼ùåÿÙÿ÷yìÿûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýùç2ëßÃÜÔÄšÿëwÿ¶—Rÿ°ŠBÿ¯†=ÿ«‚9ÿ¨:ÿ§~9ÿ£€7ÿ¤8ÿ§ƒ7ÿ«„5ÿ°…4ÿ³ˆ7ÿ³‹8ÿ²Ž:ÿ±‘>ÿ³“@ÿ´—Bÿ¸Cÿ¿£Dÿ¦GÿÈ«IÿǪHÿƬRÿÆ­gÿÈ·ÿ̼˜ÿØÏ´ÿª¤™ÿÿ²²²ÿÙ××~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ×Öƒ˜©¦ÿƒŸ™ÿ€¾²ÿvÕÁÿXØ¿ÿ0Ï­ÿ,Эÿ#Ì¥ÿ!Ê£ÿ!ÇžÿÅœÿÄ™ÿÀ•ÿ¼ÿ·‹ÿºƒÿ·ÿ³~ÿ±|ÿ¯zÿ®yÿ¯wÿ®vÿ!¯tÿ"°uÿ°tÿ°yÿ´ƒÿ&¹ÿG¿œÿwȯÿ»ÙÌÿÝíæcîÿö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûòï çÞщ˿£ÿ³¡xÿ§“Zÿ§Gÿ©†Bÿ¦:ÿ§}8ÿ¨y;ÿª{=ÿ«~;ÿ«8ÿ«…3ÿ­‡5ÿ¯Š6ÿ±Œ8ÿ°=ÿ²?ÿ³“@ÿ·—Dÿ½DÿÁ¢EÿȨIÿȨIÿÈ«PÿêZÿÅ°lÿÌ»‚ÿ×É•ÿÄ»šÿ¤¤˜ÿš–ÿÎÍÉ°ìêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéçç2ÁÆÅ쎟œÿ‘­§ÿŒÊ¾ÿtÓ¿ÿMÍ´ÿ,Ë©ÿ*Ϋÿ É¢ÿÇ ÿÅœÿ™ÿÁ–ÿ¾“ÿ¹Œÿµ‰ÿ¸ÿµÿ²}ÿ°{ÿ¯zÿ®yÿ®vÿ­uÿ ®sÿ ®sÿ°tÿ²{ÿ!¹ˆÿ-À”ÿTÌ©ÿˆÙÀÿÏíàìüõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóæ2åÙ½ÿ˹ÿ¶¢iÿ­“Mÿ¬‰Eÿ§€;ÿ§}8ÿ§x:ÿª{=ÿ«~;ÿª~7ÿª„2ÿ­‡5ÿ­ˆ4ÿ®‰5ÿ®‹;ÿ°=ÿ°=ÿ´”AÿºšAÿ¾ŸBÿÅ¥FÿƦGÿÆ©Nÿ½¤Tÿ¿ªfÿƵ|ÿʼˆÿÔ˪ÿ¯¯£ÿŒˆÿ¼»·ÿÞÜÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞÜÜc«·±ÿ¤šÿ³ÿpѽÿRغÿ2άÿ$Ê¥ÿ%˦ÿ#Çžÿ!ÅœÿÄ—ÿÁ”ÿ¿ÿ¼ÿ¸ˆÿµ†ÿ³~ÿ²}ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ®rÿ­rÿ­vÿ¯yÿ%´‡ÿ=¼•ÿeêÿ’ÔÁÿÃæÜÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéë(ÕÑƽ¼²”ÿªškÿ©“Qÿ©Š?ÿ­‚9ÿ¯|6ÿ¯{9ÿ­{9ÿ¨{8ÿ¥€6ÿ©…7ÿª„2ÿ¬†4ÿ¬ˆ:ÿ®Š<ÿ°Œ>ÿ´Bÿº•Cÿ½šDÿÁžDÿàFÿŦKÿÀ¤Mÿ«[ÿÆ°hÿκsÿßÏ”ÿ½¹¡ÿ™Žÿ­¨ŸÿÍÊÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëÕÓÓƒ ¬¦ÿƒ¨žÿˆË¼ÿl͹ÿQ×¹ÿ2άÿ"È£ÿ!Ç¢ÿ"Æÿ Ä›ÿ•ÿ¿’ÿ½Žÿº‹ÿ·‡ÿ´…ÿ²}ÿ±|ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ­qÿ¯tÿ!°yÿ"´~ÿ-¼ÿIÈ¡ÿtÒ¹ÿ¥çÔÿÙüòyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðìáOÒȪÿ¸¨yÿµŸ]ÿ°‘Fÿ²‡>ÿ±~8ÿ¯{9ÿ¬z8ÿ¦y6ÿ£~4ÿ§ƒ5ÿ©ƒ1ÿ«…3ÿ«‡9ÿ­‰;ÿ¯‹=ÿ³Aÿ¸“Aÿ»˜Bÿ¾›AÿÀCÿÄ¥JÿÀ¤Mÿì\ÿ¾¨`ÿË·pÿÒ‡ÿÅÁ©ÿ³¯¤ÿ¢”ÿÀ½¸ÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååEº¼¼ÿ­¢ÿ…ƶÿu׿ÿRÖ¸ÿ/Ñ­ÿ$Ê¥ÿÇÿÈžÿ ÖÿÁ”ÿ¿ÿ½ÿ¼‰ÿ¸†ÿµÿ²ÿ °|ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ°qÿ®sÿ²wÿµƒÿ1¸ŒÿV½žÿ‡Ì·ÿ¸ÞÒÿâíêEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäßàYÈħÿµ§wÿ­œSÿ°Eÿ±‡:ÿ¬‚5ÿ©}6ÿª}:ÿ§€<ÿ¥~:ÿ¨2ÿ¨2ÿªƒ8ÿ­†;ÿ°‰>ÿ²‹@ÿ¶Aÿ¹“Aÿ¼˜@ÿ½™AÿÁŸEÿÁ¤IÿÁ¥NÿÁ§Sÿ̲^ÿÓ»oÿÍÂœÿÍÅ®ÿ—„ÿ³¯¤ÿÚÙÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÙÙ~©««ÿ‹« ÿ„ŵÿsÕ½ÿOÓµÿ+Í©ÿ!Ç¢ÿÆœÿÆœÿ•ÿÀ“ÿ¾Žÿ»‹ÿº‡ÿ¶„ÿ´€ÿ±~ÿ¯{ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ±rÿ°uÿ³xÿ#ºˆÿ9À”ÿ`Ǩÿ—ÜÇÿÊðä¥ïú÷ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÜ¿ÿÍ¿ÿ¸§^ÿ·—Lÿ´Š=ÿ¯…8ÿª~7ÿª}:ÿ¦;ÿ¥~:ÿ¨2ÿ¨2ÿ©‚7ÿ¬…:ÿ®‡<ÿ°‰>ÿ´?ÿ·‘?ÿ¹•=ÿ»—?ÿ¾œBÿ¾¡Fÿ¾¢Kÿ¾¤PÿÇ­YÿζjÿÆ»•ÿÈÀ©ÿ¥ŸŒÿ­©žÿÎÍÉ°ìíñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÈÎÍ°ž¤£ÿt² ÿlÌ´ÿ^غÿ9Ñ®ÿ!Ê£ÿÅžÿÚÿÄ—ÿÀ‘ÿ¿Œÿ¼ˆÿº†ÿ¸‚ÿ¶€ÿ³{ÿ±yÿ ­zÿ¬yÿ ±tÿ °sÿ±sÿ±sÿ²uÿ±yÿ²€ÿ4»“ÿ_Á£ÿŽÌ¼ÿÎãÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEØгÿ¿°‚ÿ³Ÿ^ÿªEÿª‡>ÿ¦7ÿ¥|3ÿ¦{8ÿ¦{8ÿ¨€5ÿ§4ÿ¨6ÿ«‚9ÿ­„;ÿ®…<ÿ±‰>ÿµŽ?ÿ·’@ÿ¸•?ÿ»›Bÿ¿ŸFÿ¾ GÿÁ£JÿÉ«RÿÒ³^ÿμ‡ÿΠÿ¾´–ÿ¬¦“ÿÀ½µÿàáåOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¾ÄÃÿ¢¨§ÿ|º¨ÿnζÿZÔ¶ÿ3˨ÿÆŸÿÄÿ™ÿÁ”ÿ¾ÿ½Šÿº†ÿ¸„ÿ¶€ÿ´~ÿ²zÿ°xÿ¬yÿ«xÿ °sÿ °sÿ °rÿ±sÿ²uÿ³{ÿ&¹‡ÿ<ÛÿkͯÿÛËÿÜñécÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøöìêâÅÊÓÄ–ÿÀ¬kÿ±–Lÿ¯ŒCÿ©„:ÿ¦}4ÿ¥z7ÿ§|9ÿ¨€5ÿ§4ÿ¨6ÿª8ÿ«‚9ÿ¬ƒ:ÿ¯‡<ÿ³Œ=ÿµ>ÿ·”>ÿ¹™@ÿ½Dÿ½ŸFÿ¿¡HÿŧNÿˬWÿǵ€ÿʾœÿÍÃ¥ÿª¤‘ÿ°­¥ÿÓÔ؃íðøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìôóÎÖÕ­¸¶ÿ¢°®ÿu˳ÿV׸ÿCÓ°ÿ*Ç¢ÿÄ›ÿÄ›ÿ!•ÿ¿ÿ¾‹ÿ¼‰ÿ¸‚ÿ¶€ÿ ´~ÿ²|ÿ³yÿ±wÿ¯yÿ¬wÿ®sÿ®sÿ­rÿ®sÿ²zÿ$´„ÿ>½–ÿhêÿšÑÂÿÐä߉ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ñìØпÿ³“ÿ¬škÿª‘Sÿ¨ŠCÿ¦7ÿ«~4ÿ­€6ÿ©€7ÿ¨6ÿª6ÿ«€7ÿ¬8ÿ­‚9ÿ®‡9ÿ±Š<ÿ°Ž;ÿ²=ÿ´•@ÿ·˜Cÿ¹›Dÿ¿œFÿÅ KÿÉ£QÿêjÿÈ·†ÿÔÈ ÿ¯¥ÿª¦›ÿÊÊÊÿéìñ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÃËÊÿ¡¬ªÿ¥³±ÿ|ÒºÿUÖ·ÿ=ͪÿ&ÞÿÚÿ™ÿ¿’ÿ½ÿ¼‰ÿº‡ÿ·ÿµÿ²|ÿ±{ÿ²xÿ°vÿ¯yÿ¬wÿ­rÿ®sÿ®sÿ¯tÿµ}ÿ*ºŠÿDÃœÿq̳ÿ§ÞÏÿÝñìcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèàÏÑ¢ÿ¸¦wÿ²™[ÿ«Fÿ§‚8ÿ«~4ÿ«~4ÿ¨6ÿ§~5ÿ©~5ÿ«€7ÿ¬8ÿ¬8ÿ¬…7ÿ¯ˆ:ÿ®Œ9ÿ±<ÿ²“>ÿµ–Aÿ¸šCÿ¾›EÿÂHÿÅŸMÿ¾¥eÿ±€ÿÒÆžÿ·­•ÿª¦›ÿÀÀÀÿàãèOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëE¹ÇÅÿ™§¥ÿ£¶³ÿfÔ¸ÿHÓ²ÿ,ɤÿ$Áœÿ"˜ÿ¿•ÿ»ÿ»ÿ»Šÿ¹„ÿ¶~ÿ³|ÿ ±zÿ°yÿ±uÿ ±tÿ °wÿ®uÿ#ªrÿ$«sÿ ­tÿ°vÿ'¸„ÿ1¿”ÿbèÿ”ÑÃÿÒã߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëØÉǽ¼¬•ÿ±›qÿ«Rÿ¨†:ÿ®‚/ÿ«,ÿ§}6ÿ¦|5ÿ©~5ÿ«€7ÿ«6ÿ«6ÿ«„6ÿ®‡9ÿ®‹;ÿ°=ÿ±‘>ÿ³“@ÿ¸–Cÿ¾˜FÿÛIÿÄœJÿÀ¤]ÿïvÿÑÁ“ÿ¸šÿ¯¬ÿ¸¸¸ÿÖÙÞ~íðõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêòñÜçåc¶ÄÂÿ—¥£ÿ¤·´ÿbдÿBͬÿ(Å ÿ"¿šÿ!Á—ÿ¼’ÿ¹‹ÿ»ÿº‰ÿ¸ƒÿµ}ÿ²{ÿ°yÿ¯xÿ±uÿ °sÿ °wÿ®uÿ#ªrÿ%¬tÿ!®uÿ!³yÿ+¼ˆÿ6Ä™ÿjË°ÿŸÜÎÿÝîêcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåÖԀɹ¢ÿº¤zÿ±•Xÿ­‹?ÿ±…2ÿ¬€-ÿ¦|5ÿ¥{4ÿ¨}4ÿª6ÿ«6ÿ«6ÿªƒ5ÿ­†8ÿ«ˆ8ÿ­Š:ÿ®Ž;ÿ°=ÿµ“@ÿ¼–DÿÀ˜FÿÁ™GÿºžWÿ»§nÿȸŠÿÅ»ÿ²¯ ÿ³³³ÿÐÓØÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÙØy©º¶ÿ…»®ÿlʲÿ@Ö²ÿ4ʦÿ*Ãœÿ&¿˜ÿ ¼“ÿ¼Žÿ¼Šÿ¸†ÿ¸„ÿ¶‚ÿµ}ÿ²{ÿ°yÿ¯xÿ®vÿ­uÿ®uÿ«rÿ®rÿ­qÿ)­xÿ/²€ÿ3·ŽÿEǦÿ´Ã»ÿÓßßÿéøú(ïþÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëáOÊǹÿ²©•ÿ¬œrÿ§ŒTÿ«ƒ1ÿª‚0ÿ¥€0ÿ¤}2ÿ¥}2ÿ§4ÿ©€7ÿ©€7ÿª8ÿ¬ƒ:ÿ®†;ÿ¯‡<ÿ±Œ<ÿ³Ž>ÿ´’>ÿ·•AÿºšAÿ¼œCÿÀMÿÌ¥aÿȲpÿÕÅ–ÿ½¸—ÿ©©›ÿËÍÕÿååñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíñÑÍÌš¢³¯ÿˆ¾±ÿrиÿ<Ò®ÿ1Ç£ÿ'À™ÿ$½–ÿº‘ÿ»ÿ»‰ÿ·…ÿ¶‚ÿµÿ´|ÿ±zÿ°yÿ¯xÿ®vÿ®vÿ°wÿ­tÿ°tÿ°tÿ-±|ÿ4·…ÿ:¾•ÿMÏ®ÿ¿ÎÆÿÛççníüþðÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôòè(×Ôƽ¾µ¡ÿµ¥{ÿ®“[ÿ°ˆ6ÿ¬„2ÿ¦1ÿ¥~3ÿ¦~3ÿ¨€5ÿ©€7ÿ¨6ÿ©€7ÿ«‚9ÿ¬„9ÿ®†;ÿ¯Š:ÿ²=ÿ²<ÿµ“?ÿ¸˜?ÿºšAÿ¼™IÿÈ¡]ÿ¬jÿÏ¿ÿ¼·–ÿ¦¦˜ÿÀÂÊÿÜÜècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõçë2¿ÂÀÿŽ°¥ÿ~ijÿlÕºÿ:Ψÿ/Ãÿ(½•ÿ%º’ÿ ¹Œÿ¸‹ÿ¹‡ÿµƒÿ´~ÿ²}ÿ²{ÿ¯yÿ¯wÿ­vÿ­vÿ­vÿ®vÿ«sÿ¯vÿ°wÿ*³ÿ=¹‹ÿK›ÿqеÿÐÛÓÿçïï2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäâØyÈIJÿ¹­‰ÿ°™gÿ¯Aÿ¬…:ÿ©6ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿ«8ÿ­‚9ÿ®ƒ:ÿ¯ˆ:ÿ±Š<ÿ²;ÿµ>ÿ¶”@ÿ¸–Bÿ»–DÿÆŸUÿÁ©aÿμ‡ÿû–ÿ«©—ÿ¹»»ÿØ×à~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòäè;¹¼ºÿ¯¤ÿ~ijÿgеÿ6ʤÿ,Àšÿ&»“ÿ$¹‘ÿ·Šÿ¶‰ÿ·…ÿ´‚ÿ³}ÿ±|ÿ±zÿ®xÿ®vÿ¬uÿ¬uÿ¬uÿ­uÿªrÿ¯vÿ²yÿ,µÿ@¼ŽÿPÇ ÿyؽÿÙäÜyìôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEÒμÿ¿³ÿ´kÿ´’Fÿ­†;ÿª‚7ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿª~7ÿ¬8ÿ­‚9ÿ­†8ÿ°‰;ÿ±Œ:ÿ³Ž<ÿ´’>ÿ¶”@ÿº•Cÿ›Qÿ¼¤\ÿȶÿƾ™ÿ±¯ÿ´¶¶ÿÕÔÝ€ïîø ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçáâO­¼¸ÿ‚µ§ÿnȱÿPÍ­ÿ,ËŸÿ#–ÿ½ÿ»ÿº‡ÿ¸…ÿ·ƒÿ´€ÿµ|ÿ³{ÿ²xÿ°wÿ®uÿ­uÿ¬tÿ¬tÿ®vÿ«sÿ¯wÿ³~ÿ,¹†ÿI¾—ÿsǪÿ¥ÙÈÿäêå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿññëÖÔÊ¥½¶›ÿ² wÿ«”Vÿ¬‡Cÿªƒ9ÿª6ÿ¨}4ÿ©~5ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ¬8ÿ­‚9ÿ¯…:ÿ±‡<ÿ±Š;ÿ³Œ=ÿ´=ÿ¶‘?ÿº”Bÿ¾˜Fÿº Tÿ¯rÿȽ‘ÿ¸³šÿ²³ªÿÓÏÔÿîëôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞØÙy¬»·ÿ…¸ªÿnȱÿLÉ©ÿ)Èœÿ!À”ÿ¼Žÿ»ÿ¹†ÿ·„ÿ¶‚ÿ³ÿ´{ÿ²zÿ²xÿ¯vÿ®uÿ¬tÿ¬tÿ¬tÿ­uÿ«sÿ°xÿµ€ÿ/¼‰ÿM›ÿwË®ÿ«ßÎÿìòíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞԀƿ¤ÿ¹§~ÿ²›]ÿ±ŒHÿ«„:ÿª6ÿ§|3ÿ¨}4ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ«€7ÿ­‚9ÿ®„9ÿ°†;ÿ°‰:ÿ²‹<ÿ³Ž<ÿµ>ÿº”Bÿº”Bÿ¹ŸSÿ»¨kÿøŒÿºµœÿ®¯¦ÿÌÈÍÿìéò(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïïï ÓÓÓƒ£¾µÿ|¾«ÿZ˯ÿ>Ê¥ÿ'Å—ÿ½ÿº‹ÿ¹Šÿ·ƒÿ¶‚ÿ¶~ÿ³{ÿ³yÿ²xÿ±uÿ°tÿ¯sÿ®sÿ®sÿ®sÿ­rÿ©sÿ°{ÿ!µ…ÿ5½“ÿUáÿ•É·ÿÎßÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ÍÉ·ÿº¯ÿ±nÿ¬Sÿ®‡<ÿ¬‚7ÿ§}2ÿ§}2ÿ©~5ÿ©~5ÿ«~5ÿ¬6ÿ­€6ÿ®7ÿ­ƒ6ÿ¯…8ÿ¯ˆ9ÿ°‰:ÿ³;ÿ´Ž<ÿº“>ÿ¹’=ÿ½ Oÿ¼¦dÿĶ‚ÿú™ÿ·¯¢ÿÊÆÅÿêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ÐÐÐÿ¥À·ÿ~À­ÿYÊ®ÿ<È£ÿ$”ÿ»ÿ¸‰ÿ·ˆÿ¶‚ÿµÿµ}ÿ³{ÿ²xÿ±wÿ±uÿ°tÿ¯sÿ®sÿ¯tÿ¯tÿ¯tÿ«uÿ²}ÿ%¹‰ÿ9Á—ÿZȦÿšÎ¼ÿÓäÛƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÕÑ¿ÿÀµ•ÿµ¡rÿ®’Uÿ°‰>ÿ­ƒ8ÿ¨~3ÿ§}2ÿ¨}4ÿ¨}4ÿ«~5ÿ«~5ÿ¬5ÿ­€6ÿ­ƒ6ÿ®„7ÿ®‡8ÿ¯ˆ9ÿ²Œ:ÿ³;ÿ¶:ÿ´8ÿ»žMÿ¸¢`ÿÁ³ÿÄ»šÿ¸°£ÿÇÃÂÿçæê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéîí(ÄÉÈÿš¼±ÿ€É³ÿJͬÿ:Ç ÿ'¾ÿ#º‰ÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ²~ÿ3»‘ÿBÀœÿfĬÿÀÑÈÿâéæEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïóÔÔÈÿ¾¶Ÿÿ¯¡}ÿ«’`ÿ²ŽBÿ©6ÿ¤|1ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿ«4ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¹‘?ÿ´•Fÿ³Uÿijzÿø’ÿ»±ŸÿÆ¿¼ÿàßãYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÃÈÇÿš¼±ÿÊ´ÿJͬÿ9ÆŸÿ&½Œÿ"¹ˆÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ ³ÿ4¼’ÿCÁÿhÆ®ÿÃÔËÿæíê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòö ÙÙ͚û¤ÿ³¥ÿ¯–dÿ´Dÿ«ƒ8ÿ¥}2ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿª€3ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¸>ÿ³”Eÿ²œTÿÁ°wÿÁ¶ÿº°žÿĽºÿÞÝácÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêé;ÁÇÂÿš¼±ÿÊ´ÿMͪÿ4Æœÿ!¾Œÿºˆÿ·„ÿ¶ƒÿ¶€ÿ´~ÿ²{ÿ²{ÿ±xÿ±xÿ°wÿ°wÿ¯vÿ¯vÿ¯vÿ®vÿ°xÿ ¯xÿ*´„ÿB¼–ÿTÀ£ÿ„´ÿÑÔÒ‰îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜÞØyÆ¿®ÿ³¨ÿ°›nÿµ•Jÿ¬‡=ÿ¥€6ÿ¦7ÿ¤5ÿ¤5ÿ§€6ÿ§€6ÿ§€5ÿ¨6ÿ©‚7ÿªƒ8ÿ©…7ÿ«‡9ÿ®Š<ÿ¯‹=ÿ²‹=ÿ¶Dÿ²’Gÿ´™VÿÁ®uÿųŽÿ»°šÿÄ»¸ÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçæE¾Ä¿ÿ™»°ÿÊ´ÿLÌ©ÿ2Äšÿ!¾Œÿ»‰ÿ¸…ÿ·„ÿ·ÿµÿ³|ÿ³|ÿ³zÿ²yÿ²yÿ±xÿ±xÿ±xÿ±xÿ°xÿ³{ÿ$³|ÿ.¸ˆÿFÀšÿWæÿ†Ä¶ÿÔ×Õ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâäÞYËijÿ¶«ÿµ sÿ¸˜Mÿ°‹Aÿ¨ƒ9ÿ¨ƒ9ÿ¦7ÿ¦7ÿ©‚8ÿ©‚8ÿ©‚7ÿªƒ8ÿ«„9ÿ¬…:ÿ«‡9ÿ­‰;ÿ¯‹=ÿ±?ÿ³Œ>ÿ¶Dÿ³“Hÿ´™Vÿ¾«rÿIJÿ¼±›ÿú·ÿÙÕÚ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿœº­ÿ„ʳÿP̨ÿ8˜ÿ+¾Œÿ'ºˆÿ$·…ÿ$·…ÿ#¶‚ÿ!´€ÿ ´~ÿ ´~ÿ³{ÿ³{ÿ³{ÿ²zÿ±{ÿ±{ÿ±{ÿ±{ÿ$³|ÿ-³~ÿ:¸ŽÿW¾Ÿÿt¿ªÿ˜Â»ÿÚ×Ù~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ËŸÿ´¬•ÿ·¥|ÿº™Tÿ®Hÿ¦…@ÿ¥„?ÿ¤=ÿ¥‚>ÿ©„@ÿ¨ƒ?ÿ§ƒ=ÿ¨„>ÿ©…?ÿª†@ÿ«‡Aÿ­‰Cÿ­‹Eÿ®ŒFÿ²‹Gÿ³ŒHÿ³’Mÿ³™Wÿ½ªqÿIJÿ½²œÿÁ¸µÿ×Ó؃ïðô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿ»®ÿ…Ë´ÿRΪÿ;Å›ÿ-ÀŽÿ*½‹ÿ'ºˆÿ&¹‡ÿ&¹…ÿ$·ƒÿ#·ÿ#·ÿ"·ÿ"·ÿ!¶~ÿ!¶~ÿ!µÿ!µÿ!µÿ!µÿ&µ~ÿ0¶ÿ>¼’ÿ[£ÿvÁ¬ÿ™Ã¼ÿÛØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéç2Ìƹÿ¶®—ÿ¾¬ƒÿ¿žYÿ³’Mÿ¬‹Fÿª‰Dÿ©†Bÿª‡Cÿ®‰Eÿ¬‡Cÿ¬ˆBÿ­‰Cÿ®ŠDÿ¯‹Eÿ¯‹Eÿ°ŒFÿ°ŽHÿ±Iÿ¶Kÿ¶Kÿ·–Qÿ¶œZÿ½ªqÿųŽÿ¾³ÿÀ·´ÿÕÑÖÿîïó ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Á¾ÿ¢¼¯ÿŒÍ·ÿVÒ®ÿKÈ ÿQÀ”ÿM¼ÿKºŽÿJ¹ÿJº‹ÿI¹ŠÿH¸ˆÿH¸ˆÿG·‡ÿF¶†ÿF¶†ÿF¶†ÿD·†ÿD·†ÿD¶‡ÿD¶‡ÿ9»†ÿ<¾‰ÿOšÿkǪÿ‹Â³ÿ¬ÂÀÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçéé2ÍǼÿ¹±šÿƳŽÿÁ¥eÿº™Zÿ³’Sÿ°Pÿ°Nÿ²Pÿ´Pÿ²ŽNÿ²ŽNÿ³Oÿ´Pÿ´Pÿµ‘Qÿµ‘Qÿµ’Rÿ¶“Sÿ¼–Vÿº”Tÿ»›Zÿº¡cÿÁ¬xÿȶ‘ÿÁ¶¢ÿÀ·³ÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Âÿÿ£½°ÿŽÏ¹ÿYÕ±ÿNË£ÿVÅ™ÿS–ÿP¿“ÿP¿“ÿPÀ‘ÿN¾ÿM½ÿN¾ŽÿM½ÿL¼ŒÿL¼ŒÿL¼ŒÿJ½ŒÿJ½ŒÿJ¼ÿJ¼ÿAÃŽÿDÆ‘ÿVÉ¡ÿqÍ°ÿÆ·ÿ®ÄÂÿÞÚßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèêê(ÎȽÿ»³œÿ̹”ÿÉ­mÿ¡bÿ»š[ÿ¸—Xÿ¸•Vÿ¹–Wÿ»—Wÿ¸”Tÿ¹•Uÿº–Vÿ»—Wÿ»—Wÿ»—Wÿ»—Wÿ»˜Xÿ¼™YÿÃ]ÿÁ›[ÿ¢aÿÀ§iÿį{ÿ˹”ÿĹ¥ÿ¹µÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞàèY¾ÀÈÿ©¼¹ÿ­Í¼ÿЪÿŒÈ ÿÚÿ{¿–ÿ|À—ÿ}Á˜ÿ{¿–ÿz¾•ÿz¾•ÿy½”ÿx¼“ÿx¼“ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿ€¼“ÿ‰½•ÿ•Ç¥ÿŸÆ­ÿ¬Ç·ÿµÅ¾ÿÖÞÝ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2ÆÁÂÿ±³ ÿº¼žÿ¼±ÿ²£rÿªœhÿ­šgÿ«™dÿ®˜dÿ±™cÿ°˜bÿ²šdÿ³›eÿ³›eÿ´œfÿ³iÿ³iÿ²iÿ²iÿµŸoÿµŸoÿ±¤pÿ±©tÿ·µ…ÿ¿½šÿº¹¤ÿ½ºµÿÖÓÕÿòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßáéY¿ÁÉÿ«¾»ÿ¯Ï¾ÿ Ó­ÿ̤ÿƒÇžÿÚÿÚÿÅœÿ~™ÿ~™ÿ~™ÿ}Á˜ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ†Â™ÿÛÿšÌªÿ¤Ë²ÿ®É¹ÿ´Ä½ÿÕÝÜ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÇÂÃÿ³µ¢ÿ¾À¢ÿÀµƒÿ¶§vÿ® lÿ°jÿ®œgÿ±›gÿµgÿ´œfÿ´œfÿ´œfÿµgÿ¶žhÿ´žjÿµŸkÿ´Ÿkÿ´Ÿkÿ·¡qÿ·¡qÿ³¦rÿ³«vÿ¹·‡ÿÁ¿œÿ¼»¦ÿ¿¼·ÿÖÓÕƒòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæâèEÆÂÈÿ½½·ÿÉͺÿÃѨÿºÈŸÿÅ¿šÿÀº•ÿÁ»–ÿ¼—ÿÀº•ÿ¿¹”ÿÀº•ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¿¹”ÿ¿¹”ÿÀº•ÿ´¿—ÿ¶Á™ÿÀË«ÿÂʳÿ¿Æ·ÿ¼ÀºÿØÛÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÅÀÁÿ²³£ÿ¼Ã¢ÿ¹µ€ÿ°¨sÿ¦¡jÿ¨žhÿ¦dÿ©œdÿªždÿ­œcÿ®dÿ®dÿ­Ÿeÿ­Ÿeÿ¬Ÿgÿ¬Ÿgÿ¬¡hÿ¬¡hÿ± mÿ°Ÿlÿ­¦mÿ­«qÿ³·ƒÿ»½™ÿ¸¼£ÿÀ¾¶ÿ×ÕÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçãéEÇÃÉÿ¼¼¶ÿÆÊ·ÿÀÎ¥ÿ¶Ä›ÿÁ»–ÿ½·’ÿ½·’ÿ¾¸“ÿ»µÿ»µÿ¼¶‘ÿ»µÿ»µÿ»µÿ»µÿ»µÿ»µÿ¼¶‘ÿ¼¶‘ÿ¼¶‘ÿ¯º’ÿ²½•ÿ¾É©ÿÁɲÿ½Äµÿ¸¼¶ÿÕØÖ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2½¾ÿ­®žÿ·¾ÿ²®yÿ¨ kÿ˜aÿŸ•_ÿ”[ÿ¡”\ÿ¡•[ÿ¤“Zÿ¥”[ÿ¥”[ÿ£•[ÿ¤–\ÿ¢•]ÿ£–^ÿ¢—^ÿ£˜_ÿ¨—dÿ§–cÿ¤dÿ¥£iÿª®zÿ³µ‘ÿ³·žÿ¾¼´ÿØÖÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçé2ÕÄÈÿÓ¹³ÿäïÿèÅšÿé¸ÿî°ˆÿꬄÿꬄÿë­…ÿ誂ÿ誂ÿ髃ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ髃ÿâ«„ÿÞ®Šÿç¾ÿáÁªÿÓ¿®ÿ¶°ÿ×ÔÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçäæ;½º¼ÿ¦ª—ÿ®¸”ÿ£¨kÿ™™]ÿSÿQÿ‹ŒNÿŒOÿ‘ŒMÿŠKÿŠKÿŠKÿŠKÿŠKÿŽ‹NÿŒOÿŒOÿŽPÿ™ŽTÿ˜Sÿ”“Vÿ–™[ÿ¦nÿ§¯‡ÿ­³šÿ¼½´ÿÙØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêìØÇËÿÔº´ÿã®ÿãÀ•ÿ㲊ÿ誂ÿã¥}ÿã¥}ÿä¦~ÿá£{ÿá£{ÿâ¤|ÿá£{ÿâ¤|ÿâ¤|ÿá£{ÿá£{ÿá£{ÿá£{ÿá£{ÿâ¤|ÿÜ¥~ÿקƒÿà·–ÿܼ¥ÿκ©ÿ¼°ªÿÑÎÉ°ðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäáãO»¸ºÿ¢¦“ÿ¦°ŒÿšŸbÿSÿ„„Hÿ‚‚Fÿ‚Dÿ„Dÿ†Bÿ„@ÿ…€Aÿ„@ÿ„@ÿ„@ÿƒ€Cÿ„Dÿƒ‚Eÿƒ‚EÿŒGÿ‹€Fÿˆ‡JÿŠOÿ’›cÿ ¨€ÿ«±˜ÿ¿À·ÿÜÛÝnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿííí×ÊÌÿܺ­ÿó½¤ÿÿ¶Šÿÿ©{ÿû¡rÿöœmÿõ›lÿöœmÿôškÿó™jÿ÷›lÿöškÿöškÿöškÿôškÿôškÿôškÿõ›lÿõ›lÿõ›lÿûœpÿûšvÿþ¬‰ÿòµ›ÿÞ´¡ÿ¿« ÿËÉÁÿêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÚÜn³´²ÿ™¢ˆÿž¨~ÿŽ•Rÿ†Cÿsz7ÿqx5ÿtv4ÿuw5ÿuw5ÿrt2ÿuv4ÿuv4ÿtu3ÿtu3ÿtv4ÿuw5ÿtx6ÿuy7ÿyw6ÿwu4ÿw|7ÿz„>ÿ…‘Wÿ—¡wÿ¦¯•ÿ¾Á¸ÿÜÞßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ×ÊÌÿÛ¹¬ÿÿû°„ÿ÷¡sÿôškÿï•fÿî”eÿï•fÿì’cÿì’cÿð”eÿï“dÿï“dÿï“dÿí“dÿí“dÿî”eÿï•fÿï•fÿð–gÿõ–jÿõ”pÿø¦ƒÿí°–ÿÚ°ÿ»§œÿÇŽÿæææ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíìðÔÓÕƒ­®¬ÿ“œ‚ÿ•Ÿuÿ„‹Hÿt{8ÿip-ÿgn+ÿjl*ÿjl*ÿjl*ÿhj(ÿij(ÿij(ÿij(ÿhi'ÿhj(ÿik)ÿhl*ÿim+ÿom,ÿmk*ÿns.ÿq{5ÿ}‰Oÿ‘›qÿ£¬’ÿ½À·ÿÞàáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÔÔÔÿؾ®ÿí¶›ÿÿ­ƒÿÿ›lÿÿ’^ÿÿ\ÿÿ[ÿÿ[ÿÿŽ[ÿÿZÿÿŒYÿÿŒYÿÿZÿÿZÿÿZÿÿZÿþŽZÿÿ[ÿÿ\ÿÿ\ÿÿ^ÿÿ–hÿÿŸxÿõªŠÿæ²›ÿ¾¤”ÿ¾½³ÿÞãáYíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëñÍÌÎÿª¬¦ÿ“ž~ÿ›kÿ‡@ÿqu.ÿjn'ÿei"ÿcg ÿfj#ÿde!ÿde!ÿcd ÿcd ÿcd ÿcd ÿcg ÿcg ÿdh!ÿdh!ÿdf ÿeg!ÿem&ÿht,ÿw†IÿŒ™mÿ¡¬’ÿÃÈ¿ÿæçë2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëóòÖÖÖÿÚÀ°ÿí¶›ÿþ¬‚ÿÿ›lÿÿ‘]ÿþŽZÿýYÿýYÿÿŒYÿþ‹XÿÿŠWÿÿ‹Xÿÿ‹Xÿÿ‹Xÿþ‹Xÿþ‹XÿýYÿþŽZÿþŽZÿÿ[ÿþ]ÿÿ“eÿÿœuÿò§‡ÿ屚ÿÀ¦–ÿ½¼²ÿÙÞÜÿíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåãéEÂÁÃÿ£¥ŸÿŽ™yÿ…‘aÿz‚;ÿmq*ÿfj#ÿaeÿ`dÿbfÿabÿabÿ`aÿ`aÿ`aÿ`aÿ_cÿ`dÿ`dÿ`dÿacÿceÿck$ÿgs+ÿw†Iÿšnÿ¤¯•ÿÆËÂÿèéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëöôÒÝÛÿ×ĵÿç¸ÿõ«‡ÿÿmÿÿZÿÿŒWÿþŠUÿÿ‹VÿÿŠVÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰UÿÿŠVÿÿ‹VÿÿŒWÿÿXÿÿXÿüWÿþ•\ÿÿšmÿü¤€ÿð°—ÿÏ©—ÿ¾¸«ÿÏÖÓÿæôó2ïýü ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÜàc¹·¶ÿ £”ÿšrÿ|ŽQÿ{4ÿjn#ÿdgÿ`cÿ^aÿ`cÿ^`ÿ^`ÿ__ÿ__ÿ__ÿ__ÿ]_ÿ]_ÿ^aÿ^aÿ]`ÿ^aÿ_hÿdo)ÿuƒIÿ™oÿ¦°™ÿÉÍÇÿêêðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîù÷ ×âà~Ûȹÿç¸ÿôª†ÿÿmÿÿZÿÿ‹VÿüˆSÿý‰Tÿÿ‰UÿþˆTÿÿˆTÿÿˆTÿÿˆTÿÿˆTÿÿ‰Uÿÿ‰Uÿÿ‹VÿÿŒWÿþŒWÿÿXÿüWÿü“Zÿý˜kÿû£ÿð°—ÿÓ­›ÿ¸²¥ÿÂÉÆÿßíìÿëùøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÕÙ€¯­¬ÿ ‘ÿ›sÿy‹Nÿx|1ÿhl!ÿcfÿ`cÿ^aÿ`cÿ]_ÿ]_ÿ^^ÿ^^ÿ^^ÿ^^ÿ\^ÿ]_ÿ]`ÿ]`ÿ\_ÿ]`ÿ^gÿdo)ÿv„Jÿœrÿª´ÿÎÒÌšîîô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝèæcÛÌÃÿâ·¢ÿíª‹ÿürÿû‘[ÿúWÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰Tÿù‰TÿúŠUÿùŒVÿúWÿúŽXÿúŽXÿõ“Sÿõ—Vÿýšfÿÿ¡~ÿÿ°•ÿä° ÿ¾«žÿ¹º¶ÿØçãÿèöõ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîëíÏÌΚ©¦¡ÿ›žˆÿ‘mÿyŒGÿxz.ÿikÿefÿbcÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ]`ÿ]`ÿ]`ÿ`aÿabÿ`h!ÿgq.ÿz‡Oÿ• xÿ°¹¤ÿÔØÓƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëEàÑÈÿ乤ÿî«Œÿÿ uÿý“]ÿûŽXÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰TÿúŠUÿû‹VÿúWÿûŽXÿúŽXÿúŽXÿö”Tÿö˜WÿýšfÿÿŸ|ÿÿ®“ÿç³£ÿ¸¥˜ÿ¯°¬ÿÏÞÚÿäòñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåâäEÄÁÃÿ¤¡œÿ™œ†ÿ™iÿv‰Dÿuw+ÿhjÿefÿcdÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ\_ÿ]`ÿ]`ÿ_`ÿabÿai"ÿis0ÿ}ŠRÿ™¤|ÿ´½¨ÿÙÝØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìðñæÕÌÿ滪ÿî«ÿý¡~ÿÿ”`ÿÿZÿûˆUÿý‡TÿþˆUÿÿ‡Uÿÿ†Tÿÿ†Tÿÿ…Sÿÿ†TÿÿˆVÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿô–Tÿö˜Vÿþ˜cÿÿxÿÿªÿñ³£ÿ¾ •ÿª©¥ÿÂÐÎÿÜêècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñíØÖÖ~¶´´ÿ ž–ÿ—›‚ÿˆ—]ÿv†?ÿrv*ÿeiÿcgÿaeÿ_cÿacÿ]aÿ]aÿ\`ÿ\`ÿ[_ÿ[_ÿ\_ÿ\_ÿ]aÿ]aÿ]^ÿ`_ÿci"ÿlu2ÿƒUÿ ¨ƒÿ¼Ã®ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïóô éØÏÿ转ÿ﬑ÿÿ£€ÿÿ•aÿÿŽ[ÿûˆUÿý‡TÿþˆUÿÿ†Tÿÿ†Tÿÿ…Sÿÿ…Sÿÿ†Tÿÿ‡Uÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿõ—Uÿö˜Vÿý—bÿÿšuÿÿ§Œÿò´¤ÿ¼ž“ÿ¨§£ÿ¶ÄÂÿÔâà€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéå;ÊÈÈÿ©§§ÿš˜ÿ”˜ÿƒ’Xÿr‚;ÿqu)ÿeiÿdhÿbfÿ`dÿacÿ]aÿ^bÿ]aÿ]aÿ\`ÿ\`ÿ]`ÿ]`ÿ]aÿ]aÿ^_ÿbaÿfl%ÿqz7ÿˆ”Zÿ¦®‰ÿÃʵÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï÷ö èãÚnàÅ·ÿá­ ÿí¦‹ÿ÷›fÿûŽ[ÿûˆVÿþ‡Vÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰Tÿÿ‹WÿÿŒXÿÿŒXÿÿXÿýZÿÿ”`ÿý”cÿü“`ÿÿ£sÿÿª|ÿð±‹ÿ㻞ÿ´¦ÿ²³©ÿÑÎÐïìõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÝÝnÀÃÁÿ˜–•ÿœŸ…ÿ›¡rÿƒAÿy0ÿsr"ÿnmÿffÿeeÿceÿbdÿ_cÿ_cÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿa_ÿa_ÿ]aÿ[dÿai-ÿpxIÿŠoÿ¬±œÿÑÕÉÿìíé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéàOèÍ¿ÿæ²¥ÿð©Žÿùhÿý]ÿü‰WÿÿˆWÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰TÿÿŠVÿÿŒXÿÿŒXÿÿXÿýZÿÿ’^ÿþ•dÿý”aÿÿŸoÿÿ¨zÿñ²Œÿå½ ÿµ§‘ÿš›‘ÿÅÂÄÿäáêOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéëë(ÌÎΚ®±¯ÿ™—–ÿ †ÿ™Ÿpÿ‹?ÿw}.ÿsr"ÿmlÿggÿffÿdfÿbdÿ_cÿ^bÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿ`^ÿa_ÿ[_ÿ\eÿem1ÿu}Nÿ‘–vÿµº¥ÿÙÝщñòî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôñé(í×Ëÿß¼®ÿí¬—ÿú¡nÿÿ’bÿü‹YÿÿˆWÿÿ†Sÿÿ†Sÿþ‰Rÿú‰Qÿø‰Qÿø‰QÿþˆTÿÿŠVÿÿŒXÿÿŒXÿþŽYÿüZÿú’]ÿÿ—bÿû•`ÿÿœkÿü¤uÿù²ŒÿﾞÿË«”ÿŸƒÿ¸´³ÿÓÖÛƒîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¸½¼ÿšŸ–ÿ› ‹ÿ¤yÿ•aÿ€Š7ÿtz(ÿpq!ÿklÿhhÿggÿdfÿbdÿ^bÿ^bÿ]`ÿ]`ÿ^aÿ]`ÿ^_ÿ^_ÿ^_ÿ^_ÿY`ÿ^i ÿjr6ÿ{‚Wÿ˜ ÿÁĵÿãæÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú÷ï õßÓƒæõÿð¯šÿþ¥rÿÿ•eÿýŒZÿÿ‰Xÿÿ†Sÿÿ†Sÿþ‰Rÿú‰QÿùŠRÿø‰QÿþˆTÿÿŠVÿÿ‹WÿÿŒXÿþŽYÿý‘[ÿû“^ÿþ–aÿü–aÿÿ›jÿú¢sÿõ®ˆÿî½ÿÖ¶Ÿÿ­‘ÿ¤ ŸÿÁÄÉÿæéî2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÔÙØ€ª¯®ÿ’‰ÿž£Žÿ™ uÿ‹“Wÿ{…2ÿqw%ÿop ÿklÿhhÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ^aÿ_`ÿ^_ÿ]^ÿ]^ÿ[bÿbm$ÿpx<ÿˆ]ÿ ¨‰ÿÌÏÀÿëîå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñåßYÛÈÀÿⱡÿù¨{ÿÿ–jÿù^ÿÿˆWÿÿ‡Qÿÿ‡Qÿÿ‰Qÿü‰PÿûŠRÿú‰Qÿý‡SÿÿŠVÿÿŒWÿÿŒWÿüYÿû‘[ÿü•^ÿý–_ÿü—`ÿÿiÿþ¢oÿø¨ÿþ·•ÿõ¿¦ÿÑ°¡ÿšŠ„ÿ¨­¬ÿÓÚ݃åîñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîñö Ýàåc½ÁÂÿ›¢›ÿŒ—}ÿ¤¬ƒÿ—¢dÿˆCÿy‚'ÿsxÿoqÿkkÿiiÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ]`ÿ\_ÿ\_ÿ\_ÿ\_ÿ[dÿdo)ÿr{Bÿ†Žeÿª±–ÿÖ×Íšòóï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ëå;ãÐÈÿè·§ÿþ­€ÿÿšnÿû`ÿÿ‰Xÿÿ‡Qÿÿ‡Qÿÿ‰QÿûˆOÿûŠRÿú‰Qÿý‡Sÿÿ‰UÿÿŒWÿÿŒWÿüYÿû‘[ÿý–_ÿü•^ÿý˜aÿÿžjÿþ¢oÿô¤{ÿù²ÿø©ÿÛº«ÿ˜ˆ‚ÿ•š™ÿ¼ÃÆÿØáäyïøû ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéî2ÏÒ×ÿ ¤¥ÿŽ•Žÿ‘œ‚ÿ¡©€ÿ’_ÿƒ‹>ÿu~#ÿqvÿoqÿllÿiiÿhhÿdfÿacÿ]aÿ]aÿ]`ÿ]`ÿ]`ÿ]`ÿ\_ÿ\_ÿ\_ÿ]`ÿ^gÿfq+ÿxHÿ‘™pÿ¸¿¤ÿâãÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôóï àÚÕ€Û¸ÿö²ÿþŸwÿõ’fÿýŠ]ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿþ•\ÿÿ–]ÿþ›aÿýgÿÿ¡lÿÿ£vÿÿ«†ÿÿ»Ÿÿñ¿©ÿ¾¡“ÿ”“‰ÿ¤©§ÿÇÒÐÿâëîEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕØà€¶¹ÁÿŽ”“ÿŒ”ƒÿŸ«ÿ¨jÿŒšHÿŠ0ÿx|ÿswÿoqÿllÿgjÿfiÿdfÿacÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ\^ÿZ^ÿ[_ÿ\`ÿ^bÿ_j$ÿgt6ÿˆUÿ §„ÿÇϸÿëíç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæàÛnâÉ¿ÿú¶‘ÿÿ¢zÿ÷”hÿþ‹^ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿý”[ÿÿ—^ÿÿœbÿüœfÿÿ¡lÿÿ¥xÿÿ¨ƒÿý³—ÿóÁ«ÿÙ¼®ÿ‘†ÿ”’ÿ·ÂÀÿÓÜ߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçìë2ÄÇÏÊž¡©ÿŒ’‘ÿ˜‡ÿ§³‰ÿ• bÿ„’@ÿ~‡-ÿw{ÿtxÿoqÿllÿhkÿfiÿceÿ`bÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ[]ÿZ^ÿ[_ÿ]aÿ_cÿcn(ÿly;ÿ‡]ÿ«²ÿÒÚÃÜòôî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÙÕÐÿ黣ÿ÷©…ÿî™sÿù‘fÿÿŠWÿÿˆQÿÿ‰Nÿÿ‰NÿýŠQÿüˆSÿý‡Tÿÿ‰VÿÿŒWÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿŸoÿÿ§zÿÿ®‰ÿÿ¿žÿù˳ÿ¹¦‘ÿ“‚ÿ¦© ÿÊÊÊ¥ìåê;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëðîÒ×Õƒ³¸·ÿ€…„ÿ’™Šÿ«±Žÿ£¬sÿŽ–Iÿ…Ž3ÿ~ƒ(ÿvwÿvwÿnr ÿknÿhkÿehÿcfÿbcÿ`aÿ__ÿ\^ÿ^`ÿ[_ÿ[_ÿ\_ÿZ]ÿZ_ÿaf!ÿ`l0ÿv‚RÿŒ—oÿ¶½¢ÿáèÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòð àÜ×~îÀ¨ÿû­‰ÿòwÿû“hÿÿŒYÿÿˆQÿÿ‰NÿÿˆMÿýŠQÿüˆSÿý‡Tÿÿ‰Vÿÿ‹VÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿžnÿÿ¦yÿÿ­ˆÿú·–ÿöÈ°ÿ×įÿœ–‹ÿŠ„ÿ­­­ÿÕÎÓöïô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñï Üáßc¼Á¿ÿ‘–•ÿ’‘ÿ›¢“ÿ¦¬‰ÿ™¢iÿˆCÿŠ/ÿ|&ÿvwÿuvÿnr ÿknÿgjÿdgÿcfÿabÿ`aÿ^^ÿ]_ÿ^`ÿ[_ÿZ^ÿ[^ÿZ]ÿZ_ÿch#ÿht8ÿ~ŠZÿš¥}ÿÇγÿìóä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãèçEåɸÿæµ›ÿ棄ÿî™qÿû_ÿü‹Sÿý‰NÿüˆMÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿŒUÿýSÿü’Uÿÿ“]ÿü•^ÿþ™bÿÿžfÿÿ hÿþ¡iÿÿ¦qÿÿ­ÿý±‡ÿÿžÿÿѲÿέ™ÿ›‹{ÿ‘ÿ¼±³ÿàÚÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàààOÊÏÍÿ™¡–ÿxpÿœ£ˆÿ®µŠÿ¦ªoÿ”™Nÿ†Œ5ÿ€†'ÿ}~ ÿwxÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ^^ÿ]_ÿ]_ÿZ]ÿZ]ÿY^ÿX]ÿ\dÿfn(ÿoyJÿ†Žoÿ©²—ÿ×ÝÊ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìñððÔÃÜﾤÿíª‹ÿòuÿý‘aÿýŒTÿÿ‹PÿþŠOÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿ‹TÿýSÿü’Uÿþ’\ÿü•^ÿþ™bÿÿžfÿÿŸgÿþ¡iÿÿ¥pÿÿª|ÿú®„ÿú¼˜ÿóŦÿçƲÿµ¥•ÿ}ÿ¤™›ÿ¼½ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáàäOÒÒÒƒ¬±¯ÿyvÿ†wÿ¦­’ÿ¯¶‹ÿ›Ÿdÿ‰ŽCÿ‚ˆ1ÿ}ƒ$ÿ{|ÿxyÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ__ÿ\^ÿ]_ÿZ]ÿ[^ÿZ_ÿZ_ÿ`h"ÿmu/ÿx‚Sÿ“›|ÿ»Ä©ÿåëØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæÝÔ€äƵÿã°–ÿè ~ÿò“gÿùWÿÿQÿþŒPÿþ‹RÿüˆSÿý†UÿÿˆWÿÿ‰Vÿÿ‹TÿÿQÿþ‘Sÿþ\ÿþ”_ÿÿ˜aÿÿœeÿûŸdÿú¢fÿù¨kÿû¬sÿÿ±|ÿÿ¹‹ÿÿ½—ÿÿαÿ廨ÿ§Šÿ“ˆ„ÿ¢žÿÇÇǽççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíØ×Ù~·¶¸ÿ‡‰ƒÿ|‚oÿ¢¬‚ÿ¶½„ÿ«µhÿ—DÿŠŽ.ÿˆ‰)ÿ€€"ÿ{{ÿvzÿrtÿlqÿjmÿfjÿdgÿcfÿbcÿ`aÿ__ÿ\^ÿ\^ÿZ]ÿ[^ÿY`ÿY`ÿaj'ÿpy6ÿ…fÿ¡§”ÿÍÕÄÊðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñèßYïÑÀì븞ÿ暈ÿö—kÿûYÿÿQÿý‹Oÿþ‹RÿüˆSÿý†Uÿþ‡Vÿÿ‰VÿÿŠSÿÿŽPÿþ‘Sÿþ\ÿý“^ÿþ—`ÿþšcÿúžcÿú¢fÿù¨kÿùªqÿÿ±|ÿý°‚ÿÿ¼–ÿÿŨÿôÊ·ÿα¨ÿ’‡ƒÿ‚~}ÿ¨¨¨ÿÎÎÎêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÔÓƒ¾½¿ÿŽÿuwqÿ£ÿ·Á—ÿ¬³zÿ›¥XÿŽ”;ÿ‡‹+ÿ‡ˆ(ÿ!ÿ{{ÿvzÿrtÿkpÿilÿeiÿcfÿbeÿabÿ`aÿ__ÿ]_ÿ\^ÿZ]ÿ\_ÿZaÿ[bÿen+ÿx>ÿŒ’sÿµ»¨ÿÞæÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìßщìıÿò²“ÿø¡uÿü”_ÿûUÿûŠQÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿþ˜cÿùbÿö£fÿôªjÿ÷­mÿÿ±vÿþ­zÿÿ¶Œÿÿº›ÿÿ˵ÿ÷ÐÂÿ±¨žÿ„}ÿŠŠŠÿ§§§ÿÌÌÌšâââEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÜÝÔ€´µ¬ÿ’’’ÿyyyÿ‰‚ÿ·½žÿ´À†ÿœ¨Vÿ’ 6ÿ”+ÿŠ‹#ÿ…†ÿ}~ÿ{{ÿvzÿqsÿjoÿgjÿdhÿbeÿadÿ`aÿ_`ÿ^^ÿ^_ÿ]^ÿ[^ÿ]`ÿ\c ÿah%ÿox5ÿ…ŽKÿ¡¥’ÿÌÒǽêòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöéÛnöλÿü¼ÿÿ¨|ÿÿ™dÿý‘Wÿü‹Rÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿý—bÿøœaÿö£fÿôªjÿ÷­mÿý¯tÿÿ²ÿÿ°†ÿÿ¶—ÿû¿©ÿöÏÁÿØÏÅÿ¥¢žÿtttÿ†††ÿ­­­ÿËËË¥ççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÙÙÙy¸¹°ÿž•ÿrrrÿÿ¦ªŸÿ°¶—ÿ£¯uÿ” NÿŠ˜.ÿ’)ÿ‰Š"ÿ‚ÿ{|ÿ{{ÿuyÿprÿinÿfiÿcgÿadÿ`cÿ_`ÿ^_ÿ]]ÿ^_ÿ]^ÿ[^ÿ^aÿ`g$ÿgn+ÿy‚?ÿ‘šWÿ¸¼©ÿàæÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìÿÿÞñöYíÙÔÿðijÿô®‘ÿú›sÿõ’`ÿûYÿû‹VÿÿˆTÿÿ‡Uÿÿ†Tÿÿ†RÿþˆTÿúUÿøSÿþ[ÿÿ]ÿÿ’_ÿþ•bÿüšdÿüŸhÿý¥iÿü©lÿÿ¯rÿý°wÿü´~ÿþ¸‰ÿÿ¿–ÿÿƤÿÿήÿÿлÿ©š‘ÿ‡zxÿ“‡…ÿ²ª«ÿÐÊË¥áÝâcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêæì2ÓÏÛ¿»Çÿ•”˜ÿtwnÿƒjÿ­´‡ÿ¿Ç†ÿ®¹cÿ¨Bÿ—8ÿŽ’+ÿˆŒ%ÿ‚„$ÿ€$ÿy{!ÿuv ÿorÿiqÿbnÿ`lÿ`fÿ``ÿ`] ÿc[ÿc]ÿc^ÿ\] ÿ`fÿYbÿVdÿ_m+ÿdr<ÿu…Uÿ˜¡†ÿÏÏÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëþÿåøý;ùåàOúνÿý·šÿÿ¥}ÿþ›iÿÿ‘]ÿüŒWÿÿˆTÿÿ‡Uÿÿ‡Uÿÿ‡Sÿÿ‰UÿúUÿøSÿýŒZÿÿŽ\ÿþ‘^ÿý”aÿû™cÿúfÿü¤hÿû¨kÿü¬oÿú­tÿù±{ÿûµ†ÿúº‘ÿÿÀžÿÿȨÿÿ˶ÿѹÿ¥˜–ÿymkÿ‰‚ÿ«¥¦ÿÏËÐ¥ÜÛßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêçé2ØÔÚ€µ±½ÿ•‘ÿlkoÿ‚yÿ¥©ÿ¹À“ÿ±¹xÿ «Uÿ—¢<ÿ’˜3ÿ‹(ÿ†Š#ÿ€‚"ÿ}~"ÿxz ÿtuÿnqÿhpÿbnÿ`lÿ_eÿ``ÿ`] ÿc[ÿc]ÿb]ÿ`aÿ_eÿYbÿZhÿes1ÿkyCÿƒ“cÿ¯¸ÿÞÞÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÜЉîÄ­ÿð°‘ÿïžxÿøeÿþŒ]ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿþŒWÿüŠUÿþ‹XÿÿZÿþ\ÿý“^ÿü–aÿüšdÿüŸgÿý¤kÿþªpÿþ­sÿþ°{ÿû´‚ÿú·Šÿú¾”ÿÿÆžÿÿɬÿý×ÅÿÛ¿´ÿ«†ÿƒpiÿ‚~ÿ¤ Ÿÿ»¿Àÿ×ÛÜ~ëðñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïíóáàâOÊËǽª­¤ÿ‡Žÿr{fÿ~‚eÿ¦ªÿ¿Ç’ÿ¸Â|ÿ£­Zÿ˜¤@ÿ’œ1ÿ‹‘&ÿ‰#ÿ„‡ ÿ~€ ÿ|{#ÿux"ÿqs!ÿkoÿimÿbjÿaiÿ_dÿ`^ÿa\ÿa\ÿ`]ÿ_]ÿ_bÿ]cÿXbÿal&ÿnyAÿx‚Wÿ™¤„ÿÌÒ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëßYýÓ¼ÿúº›ÿõ¤~ÿý•jÿÿŽ_ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿý‹VÿúˆSÿýŠWÿÿŒYÿý[ÿü’]ÿú”_ÿû™cÿûžfÿû¢iÿý©oÿþ­sÿþ°{ÿù²€ÿ÷´‡ÿöºÿþÁ™ÿüħÿò̺ÿìÐÅÿæËÁÿ®›”ÿ„yuÿwsrÿ•™šÿ®²³ÿÉÎÏ°Üáâcéîí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæãìEÕÓÙƒÁÀÂÿ¡¢žÿ‚yÿqxkÿw€kÿ°´—ÿ¼À—ÿµ½ˆÿ£­gÿ˜¢Oÿ‘9ÿ‹•*ÿˆŽ#ÿ‡‹!ÿƒ†ÿ}ÿ{z"ÿtw!ÿpr ÿimÿgkÿaiÿ`hÿ^cÿ`^ÿa\ÿ`[ÿ_\ÿ^\ÿ_bÿ^dÿ^hÿit.ÿz…MÿŒ–kÿ²½ÿãéÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéåÚnçɶÿè°—ÿô£‚ÿø’hÿú‹[ÿúˆSÿû‰TÿúˆSÿû‰TÿÿˆVÿÿ†Tÿÿ‹TÿÿŒUÿÿZÿþ‘[ÿý“^ÿü–aÿÿ›eÿþžhÿÿ¤lÿÿ©pÿÿ®uÿý¯zÿø²}ÿù¶…ÿû¾Œÿþ˜ÿûàÿÿϳÿÿÖ¾ÿðϼÿ®™Šÿƒxpÿxtoÿ‡Šˆÿ¤«¨ÿÁÆÇÿ×ÜÝ~ãåæEîðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñöíèìç2ÛÜànÏÐÔº¹½ÿ˜—›ÿvwmÿko\ÿ†Œuÿ¬´ŒÿÅ͆ÿ¿Èqÿ­¸\ÿŸ©Eÿ—¢4ÿ‘™'ÿ‹’ÿ‰ÿ‡Œÿ‚„ ÿ}~ ÿzy#ÿsv!ÿnoÿflÿdhÿaeÿ`cÿ`aÿ_^ÿ_]ÿ^\ÿ]^ÿ]^ÿ[_ÿ^gÿbl)ÿlw?ÿ„Ždÿ¢«‘ÿËÒÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöòç2õ×ÄÊô¼£ÿý¬‹ÿÿšpÿÿ`ÿý‹VÿüŠUÿû‰Tÿû‰TÿÿˆVÿÿ†TÿþŠSÿÿŒUÿÿŽYÿýZÿü’]ÿú”_ÿý™cÿüœfÿÿ£kÿÿ§nÿý¬sÿü®yÿø²}ÿøµ„ÿù¼Šÿú¾”ÿùÁžÿûÉ­ÿ÷˳ÿôÓÀÿäÏÀÿ´©¡ÿ~zuÿgjhÿx|ÿ•š›ÿ²·¸ÿÈÊËÿÖØÙ~éæè2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöúï ðôé(âçÞYÓ×Òÿ¹º¾ÿ¦§«ÿŠ‰ÿqptÿstjÿŒ}ÿ«±šÿÁÉ¡ÿ¶¾wÿ®·`ÿŸªNÿ•Ÿ;ÿš,ÿ—%ÿ‹’ÿ†ÿ…Šÿ€‚ÿ{|ÿxw!ÿqtÿmnÿdjÿbfÿ`dÿ_bÿ_`ÿ_^ÿ_]ÿ_]ÿ^_ÿ^_ÿ\`ÿaj!ÿhr/ÿu€Hÿ•Ÿuÿ¼Å«ÿáèÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéàOå̼ÿ趟ÿð¦‚ÿû˜lÿüZÿÿXÿÿŠSÿÿŠSÿÿ‰VÿþˆUÿþŠQÿÿŒSÿÿŒUÿþŽZÿýŽ\ÿü‘^ÿÿ•bÿÿ™eÿÿ iÿÿ¤lÿÿ©pÿÿ®tÿþ±xÿÿ¶|ÿþ¼ÿþ¾‡ÿÿÂÿÿÆšÿÿͤÿ÷ʨÿÿãÉÿîÓ¿ÿ®ÿ‘‚yÿsjaÿuojÿ‰…€ÿ¥£¢ÿº»¹ÿÍÌΚÞßãYëìðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîòíáçâOÔÚÕÿÀÄÅÿ«¯°ÿ•—˜ÿ{xzÿgd_ÿzxfÿ¨©‡ÿÉËÿÃÇ“ÿ³ºqÿ±»Qÿ§­@ÿ¤5ÿ•ž*ÿ—"ÿŽ–!ÿŽ“ ÿ„‡ÿ‚†ÿ}~ÿuwÿsr!ÿlpÿhkÿciÿaeÿbcÿ``ÿ__ÿ^^ÿ\_ÿ]`ÿ[bÿ[bÿ]eÿdm.ÿp{Cÿˆ‘iÿ¯¶›ÿÖÜщïòö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøßÏöÄ­ÿ÷­‰ÿÿqÿÿ”^ÿÿZÿÿŒUÿÿŠSÿÿŠWÿÿ‰Vÿý‰Pÿÿ‹Rÿÿ‹TÿýYÿü[ÿû]ÿþ“`ÿý—cÿÿfÿÿ hÿþ¥lÿþªpÿü¯vÿý´zÿú¸}ÿù¹‚ÿü½Šÿú½‘ÿýÇžÿýЮÿïÊ°ÿ÷ÜÈÿîÚÉÿÏÀ·ÿ§ž•ÿ|vqÿgc^ÿrpoÿ†‡…ÿ Ÿ¡ÿ¼½ÁÿÏÐÔãâæEêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíáåàOÓ×Òƒ¿ÅÀÿ«±¬ÿ“”ÿuyzÿdfgÿgdfÿ}zuÿ©§•ÿÇȦÿÆÈšÿ²¶‚ÿª±hÿ£­Cÿš 3ÿ˜Ÿ0ÿ— ,ÿ• ÿˆÿ‹ÿ†‰ÿ€„ÿ{|ÿrtÿpoÿjnÿfiÿagÿ`dÿabÿ``ÿ^^ÿ^^ÿ\_ÿ^aÿ[bÿ\cÿfn'ÿmv7ÿ~‰QÿŸ¨€ÿÊѶÿìòç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðïå;ðÚÈÿë¿¢ÿﮈÿõšmÿý]ÿÿYÿÿYÿýYÿüŒXÿü‰Pÿþ‹RÿüUÿýYÿûŒZÿü[ÿý]ÿÿ’_ÿÿ™cÿÿfÿÿ¢hÿÿ§lÿÿ¬oÿÿ°sÿÿ¶zÿÿº~ÿü½€ÿýÁ†ÿýÃÿþŘÿüÉ¡ÿÿϯÿÿؽÿÿÝÊÿùØÅÿÅ«›ÿˆyÿ…wkÿtkbÿvsnÿ‘‹ÿ¡¤¢ÿº¹½ÿÈÇ˽×ØÜ~âãçEæéí2ìïóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçæê2ÔÝЉÎ×Ê¥¿ÅÀÿ¤§«ÿ”•Ÿÿ‚~‰ÿfclÿnhmÿxvlÿ™˜~ÿ¿¿‘ÿÎÏ‘ÿÆÊxÿ¹¾[ÿ¯·Eÿ­±@ÿ ¥2ÿšŸ,ÿ”™&ÿ‘–#ÿ“"ÿ‹Ž!ÿ†‡ÿ„„ ÿ}}ÿzyÿrsÿnmÿhlÿgjÿciÿ_cÿcdÿ_`ÿ_cÿ^bÿ\cÿZaÿW`ÿak)ÿdo1ÿu€Nÿ‘šrÿ¿Ä©ÿåëÚnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø÷íÿëÙyüгÿú¹“ÿû sÿÿ–cÿÿ’^ÿÿŽZÿþŽZÿÿ\ÿÿŒSÿþ‹RÿùŠRÿù‰UÿùŠXÿü[ÿý]ÿÿ’_ÿÿ—aÿÿ›dÿÿ fÿÿ¥jÿþ«nÿÿ¯rÿþµyÿþ¸|ÿý¾ÿýÁ†ÿýÃÿüÖÿ÷Äœÿ÷Ʀÿù̱ÿ÷ϼÿûÚÇÿòØÈÿéÔÅÿÅ·«ÿŒƒzÿjgbÿlpjÿx{yÿŒÿ£¢¦ÿ¸¹½ÿÂÃÇÿÊÍÑÿÙÜàyâçèEãèéEêïðíòóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëêîæåé;ßÞâYÒÑÕ‰ÆÅÉÊÀɼÿ£¬Ÿÿ•›–ÿƒ†Šÿijtÿ_[fÿifoÿŒ†‹ÿ¾¼²ÿÅĪÿÉÉ›ÿÂÃ…ÿ¶ºhÿ¬±Nÿ£«9ÿŸ£2ÿ› -ÿ–›(ÿ‘–#ÿŽ“ ÿ‹ÿ†‰ÿ‚ƒÿ€€ÿxxÿutÿopÿnmÿimÿfiÿ`fÿ]aÿ^_ÿ^_ÿ_cÿ\`ÿ[bÿ^eÿ]fÿeo-ÿq|>ÿ‰”bÿ­¶ŽÿÚßÄÊõûêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïæÒƒìÈ°ÿæ«‹ÿòœxÿù•kÿø^ÿ÷Zÿÿ“_ÿÿ’\ÿûŽXÿö‰Uÿõ‡Wÿ÷‰Yÿû]ÿý]ÿþ‘^ÿÿ–]ÿÿ™`ÿÿbÿÿ¢fÿÿ¦kÿÿ«oÿÿ°vÿÿµzÿþ»~ÿþ¿‚ÿÿˆÿÿÄŽÿÿÓÿÿÆ™ÿÿÈ ÿÿ̧ÿÿÑ­ÿÿÕ´ÿÿÞÂÿýÞÅÿâʶÿ½­œÿŒ†sÿaXNÿe\Yÿypmÿ‰†ÿ¡š—ÿª¦¥ÿ´µ³ÿÁÄÂÿÊÍËÿÎÓÒÿÒ×ÖƒÙÞÝyÞãâYãçèEæêë2êîïìðñðïëðïëìíëëìêíííïïï éëì(ãåæEàâãOÚÜÝnÖÖÖ~ÐÐЉÊËÉÿ½¾¼ÿ®­©ÿ Ÿ›ÿ‹‹‘ÿssyÿdfgÿWUTÿa_Wÿ™™ÿÄÅžÿÇÊ“ÿÏÔ‰ÿÉÐuÿ¿Æ]ÿ´¼Gÿ¬³:ÿª®1ÿ¥¨*ÿ £%ÿ˜œ+ÿ”—*ÿ“&ÿŽ&ÿ†ˆ$ÿ‚"ÿ}|!ÿ|z"ÿvw!ÿpoÿikÿggÿdgÿbeÿ_dÿ`dÿ]^ÿ`aÿ`dÿX_ÿXaÿ[f ÿ_h)ÿgp=ÿz„Yÿ ¦‡ÿÉϸÿñòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøä;ÿÜÄÊù¾žÿþ¨„ÿÿ›qÿû’aÿù‘\ÿÿ”`ÿÿ—aÿÿ”^ÿûŽZÿøŠZÿøŠZÿúŒ\ÿü\ÿý]ÿÿ”[ÿÿ–]ÿÿš_ÿÿžbÿü¢gÿþ¨lÿÿ­sÿý±vÿú·zÿú»~ÿþ¾„ÿÿÁ‹ÿÿÁ‘ÿÿÄ—ÿÿÆžÿÿɤÿÿÕ±ÿþÑ°ÿøѵÿøÙÀÿùáÍÿîÞÍÿÇÁ®ÿž•‹ÿ›’ÿtkhÿWPMÿ_XUÿtpoÿ‚€ÿ“‘ÿ¡¤¢ÿ¦«ªÿ¬±°ÿµº¹ÿ¾ÃÂÿÅÉÊÿÉÍÎÿÍÑÒÿÏÓÔÿÔÓÏÿÕÔÐÿÓÔÒÿÒÓÑÿÓÓÓÿÓÓÓÿÉËÌÿÀÂÃÿ¾ÀÁÿ³µ¶ÿ©©©ÿ¢¢¢ÿ—˜–ÿ†‡…ÿvuqÿkjfÿTTZÿZZ`ÿwyzÿ“‘ÿ£¡™ÿÀÀ¨ÿÎϨÿÁÄÿ¶»pÿ³º_ÿ®µLÿ¨°;ÿ£ª1ÿ£§*ÿ¡¤&ÿž¡#ÿ”˜'ÿ‘”'ÿŽ‘$ÿ‹Œ$ÿ„†"ÿ~ÿzyÿzx ÿtuÿonÿhjÿggÿcfÿ_bÿ^cÿbfÿcdÿbcÿbfÿ[bÿ[dÿ_j$ÿir3ÿy‚Oÿ“rÿ½Ã¤ÿáçЉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõðç2ëÖǽ廤ÿ榇ÿî™qÿý“dÿû‘bÿÿ˜gÿÿ—fÿþ”eÿúaÿù]ÿ÷‹[ÿùŒXÿùŒXÿþ‘Yÿÿ’Zÿÿ—\ÿþš_ÿÿžfÿÿ¡lÿÿ¦sÿý©uÿÿ³zÿÿ¶|ÿÿºÿÿ½„ÿÿ¿ˆÿÿŠÿÿÆŽÿÿÈ”ÿüÆ‘ÿþË™ÿÿÑ¡ÿüЧÿùÓ°ÿÿÜÀÿÿæÎÿÿèÓÿåË»ÿ´œÿ’znÿ‹xkÿ‡wjÿsg]ÿj`Vÿnf_ÿrpfÿzvqÿ†ƒ~ÿ’Žÿš–•ÿžš™ÿ œ›ÿ¡œÿ¥£¢ÿ§¥¤ÿ¥¦¤ÿ¡¢ ÿžŸÿ›œšÿ“—’ÿŒ‹ÿƒ‡ÿ{vÿswkÿkq`ÿciVÿ`fSÿfnWÿsv`ÿzzhÿ‰wÿ®¯ÿÑÕ¡ÿØÞ—ÿÊÓxÿÁËaÿ¾ÉOÿ´Â>ÿ±¼8ÿ«³0ÿ¤¬)ÿŸ¥(ÿ› 'ÿ˜›'ÿ—™(ÿŽ”%ÿ‹%ÿˆ‹$ÿ…†$ÿ€"ÿyyÿtuÿsr!ÿkmÿjjÿgjÿghÿdfÿ`aÿ``ÿccÿgi#ÿacÿ`dÿ]eÿ_h%ÿdm5ÿu|Oÿ‘˜wÿ¸½¨ÿÞßÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÛnúйÿö¶—ÿø£{ÿÿ—hÿúaÿÿ–eÿÿ—fÿÿ—hÿÿ•fÿý‘aÿù]ÿùŒXÿø‹WÿýXÿþ‘Yÿü”Yÿû—\ÿü›cÿüžiÿû¢oÿù¥qÿü¯vÿü³yÿþ·~ÿýºÿþ½†ÿþÁ‰ÿÿÅÿÿÇ“ÿÿÉ”ÿþË™ÿýÏŸÿüЧÿöЭÿôϳÿôÒºÿõÖÁÿ÷ÝÍÿõÝÑÿöÞÒÿæÓÆÿ¿¯¢ÿŽ‚xÿpf\ÿf^Wÿig]ÿkgbÿmjeÿokjÿqmlÿuqpÿyutÿ|xwÿtrqÿusrÿstrÿrsqÿpqoÿpqoÿptoÿqupÿhlfÿek`ÿ`dXÿY_NÿZ`Mÿoubÿ–ž‡ÿº½§ÿÍÍ»ÿÓϽÿÄÅ¥ÿ¼ÀŒÿ¼Â{ÿ·Àeÿ°ºPÿ§²8ÿ¥³/ÿ¢­)ÿž¦#ÿœ¤!ÿ£&ÿ› 'ÿ—š&ÿ“•$ÿ‹‘"ÿˆŒ"ÿ„‡ ÿ‚ƒ!ÿ}~ ÿxxÿrsÿqpÿkmÿiiÿcfÿabÿacÿcdÿhh"ÿkk%ÿjl&ÿacÿaeÿai"ÿen+ÿmv>ÿ†`ÿ«²‘ÿØÝÈ°õöíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçÚnòζÿô³”ÿÿsÿÿ”jÿú“fÿü•hÿÿ˜kÿÿ™lÿÿ™iÿþ•bÿü’]ÿýXÿý‘Wÿý‘Wÿý’Xÿû”]ÿü˜bÿü›iÿûoÿú qÿþ¨rÿþ¬uÿþ±yÿÿ¶~ÿü½ÿýÁ…ÿúLjÿýÊ‹ÿüÌŒÿýÍÿüÌ’ÿÿÍ›ÿÿѦÿÿϬÿÿбÿÿÔ¸ÿùÓ»ÿüÙÅÿÿÞÇÿùÙÆÿîÓ¿ÿæͽÿß˺ÿØǺÿɹ¬ÿº®¤ÿ¥›‘ÿŽ‚|ÿxngÿk_]ÿeZVÿcWWÿ\ZZÿZXXÿWWWÿZZZÿ[\Xÿ\]Yÿ`d^ÿgmbÿ†wÿ‘š†ÿª³™ÿ·Á£ÿ¸Ã¢ÿ·ÄžÿºÈŸÿÃÍ¢ÿÃЀÿÈÔpÿ½Ëaÿ½ÊWÿ¸ÆHÿ­¹7ÿ­µ2ÿ«°-ÿ©«0ÿ¤¤.ÿ Ÿ/ÿ Ÿ/ÿœ¡.ÿ—œ)ÿŽ™ÿŠ•ÿˆÿ„‰ ÿ}„ÿ{€ÿy| ÿuwÿorÿnoÿilÿfhÿ`bÿ]^ÿcdÿnm)ÿsq0ÿsq0ÿfi$ÿadÿcg%ÿfn/ÿqy=ÿ‚Š[ÿ¤©‰ÿÍÒ½ÿìîè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþøëÿâÊ¥ÿ£ÿÿ¨~ÿÿžtÿú“fÿü•hÿÿ˜kÿÿœoÿÿŸoÿÿjÿÿ™dÿÿ”\ÿý‘WÿüVÿü‘Wÿú“\ÿú–`ÿú™gÿúœnÿøžoÿú¤nÿú¨qÿû®vÿý³{ÿùº~ÿù½ÿõƒÿöÄÿúÊŠÿýÍÿüÌ’ÿýʘÿþË ÿþÈ¥ÿýǨÿþÌ°ÿõÏ·ÿóмÿõÓ¼ÿóÓÀÿõÚÆÿùàÐÿ÷ãÒÿðßÒÿêÚÍÿáÕËÿÖÌÂÿË¿¹ÿÁ·°ÿ»¯­ÿº¯«ÿ»¯¯ÿ³±±ÿ­««ÿ¨¨¨ÿªªªÿ¨©¥ÿ¥¦¢ÿ¥©£ÿ¬²§ÿ°·¨ÿµ¾ªÿ¾Ç­ÿÁË­ÿÁÌ«ÿ¼É£ÿµÃšÿ²¼‘ÿ¶Ãsÿ¸Ä`ÿ¬ºPÿ¬¹Fÿ¦´6ÿ¥±/ÿ­µ2ÿ¤©&ÿ£¥*ÿ¡¡+ÿž-ÿœ›+ÿ”™&ÿ”!ÿ‹–ÿŒ—ÿ…ÿ„ÿxÿv{ÿuxÿrtÿloÿjkÿbeÿbdÿacÿdeÿop(ÿ{z6ÿyw6ÿpn-ÿ`cÿadÿhl*ÿnv7ÿ‰Mÿž¦wÿÆË«ÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôìöÞØyÚÀ¹ÿТšÿý¢kÿøfÿò™gÿ÷œoÿýyÿÿ›xÿÿ›yÿÿœzÿÿ—nÿþ•iÿó“^ÿïXÿó’Xÿû—]ÿÿ˜_ÿÿ˜_ÿÿžjÿÿ£nÿÿ¨qÿÿ¬uÿÿ°xÿÿ³{ÿÿ¸}ÿÿ»ÿÿÀ…ÿÿÇÿÿÈ‹ÿÿÊ‘ÿüÍ•ÿûЗÿúÒ˜ÿûÓ™ÿþÒÿÿÒ¢ÿÿÖ¥ÿÿתÿÿÙ­ÿÿÙ²ÿÿÚ³ÿÿÚ·ÿÿÞ»ÿÿß¾ÿÿàÂÿÿáÊÿþãÏÿýã×ÿûäÜÿøäßÿóäáÿñâßÿòæÚÿïèÏÿêäÁÿåã³ÿàâ§ÿÛÝ—ÿÕ؈ÿÓÕ|ÿÑÔqÿÐÒhÿÈÌ[ÿÆÈPÿÁÄFÿº½?ÿ»½Aÿ¶¸<ÿ°²6ÿ¬®2ÿ©«0ÿ§©.ÿ¤§,ÿ¢¤-ÿ¢¦/ÿž¡.ÿ—›*ÿ”—*ÿ’”*ÿ‘*ÿ‹Œ%ÿ‡†$ÿ}€*ÿwz$ÿqvÿpuÿltÿiqÿenÿekÿ`eÿeg%ÿkl.ÿst6ÿ{|<ÿ|}=ÿor-ÿ_cÿMeÿZr$ÿav8ÿw†Zÿš¤†ÿÀĸÿåèæ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõï ÷ÝÖ~ë½µÿÿ²{ÿÿ¦oÿô›iÿõšmÿýyÿÿž{ÿÿ{ÿÿ{ÿÿžuÿÿžrÿþžiÿ÷˜`ÿõ”Zÿø”Zÿÿ”[ÿÿ•\ÿþ›gÿüžiÿÿ¢kÿÿ¦oÿÿ«sÿÿ°xÿÿ·|ÿÿ»ÿÿ¾ƒÿÿÀ„ÿûćÿûÆÿ÷ÈÿöË’ÿöΔÿøЖÿúΙÿûÍÿùПÿûѤÿùÒ¦ÿûÒ«ÿúÓ¬ÿûÓ°ÿý×´ÿûØ·ÿûÙ»ÿúÚÃÿøÝÉÿøÞÒÿöß×ÿôàÛÿïàÝÿìÝÚÿëßÓÿåÞÅÿÝ×´ÿÖÔ¤ÿÎЕÿÈÊ„ÿÀÃsÿ¾Àgÿ½À]ÿ¼¾Tÿ·»Jÿ¸ºBÿ¶¹;ÿ±´6ÿ°²6ÿ¬®2ÿ¨ª.ÿ¥§+ÿ¤¦+ÿ£¥*ÿ £(ÿŸ¡*ÿ™&ÿ˜›(ÿ”˜'ÿ‘”'ÿŒŽ$ÿ†‡ ÿ‚ƒÿ€ÿwz$ÿvy#ÿtyÿqvÿjrÿfnÿdmÿgmÿlq&ÿqs1ÿ~Aÿ‰ŠLÿ…†Fÿtu5ÿeh#ÿ_cÿ[s%ÿkƒ5ÿwŒNÿ•¤xÿ¿É«ÿäèÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóìøØÓƒîèÿí°ÿè›zÿõ”rÿÿ™sÿÿ uÿÿ¤vÿý¥vÿó©yÿó©yÿó¦xÿñ sÿ÷™nÿþ”kÿÿ’gÿÿeÿõ–dÿø™gÿúžiÿþ¢mÿÿ§pÿÿ«sÿÿ¯uÿÿ±vÿÿ·|ÿÿº~ÿÿ½‚ÿÿÁ…ÿÿĉÿÿÈÿÿÌÿÿÎ’ÿÿÍ”ÿÿ͘ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿРÿýÒŸÿþÒ£ÿüÒ£ÿýÒ§ÿýÕ«ÿüÖ´ÿûÙ¼ÿûÚÆÿýÜÌÿøÞÐÿîáÓÿëÞÐÿéáÄÿåß²ÿÙÙ™ÿÔÕ…ÿÊÐqÿÄË\ÿºÃNÿ¶¾Aÿ²»<ÿ²¸5ÿ­´.ÿ­´.ÿ®³.ÿª¯*ÿ¨¬+ÿ¦ª)ÿ¤¨'ÿ£§&ÿ¡¥'ÿ £(ÿœ¡&ÿšž'ÿ•›&ÿ“—&ÿŽ“&ÿŠŽ%ÿ†Š#ÿƒ†#ÿ€ƒ ÿ~!ÿqw ÿos!ÿkoÿhkÿghÿjj$ÿqq+ÿxv5ÿ€>ÿƒ„BÿˆŒJÿ‡‹Iÿu|9ÿbi&ÿ[d!ÿbk(ÿdv;ÿ{ˆZÿ“ zÿ»ÄªÿåêÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìç2ÿÛÀìÿÅ¥ÿö©ˆÿú™wÿÿ—qÿÿrÿÿ¤vÿÿ¨yÿõ«{ÿôªzÿô§yÿø§zÿÿ¦{ÿÿ¤{ÿÿrÿÿ–kÿ÷˜fÿ÷˜fÿöšeÿøœgÿú iÿú¥mÿüªpÿû­rÿÿ³xÿþ¶zÿý¹~ÿý¾‚ÿýÁ†ÿýÅŠÿÿÉÿÿËÿÿË’ÿÿÌ—ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿÏŸÿüÑžÿýÑ¢ÿúСÿûÐ¥ÿúÒ¨ÿúÔ²ÿù׺ÿùØÄÿüÛËÿ÷ÝÏÿîáÓÿëÞÐÿéáÄÿäÞ±ÿÖÖ–ÿÏЀÿÄÊkÿ¼ÃTÿµ¾Iÿ±¹<ÿ¬µ6ÿ­³0ÿ©°*ÿª±+ÿ¬±,ÿ©®)ÿ§«*ÿ¦ª)ÿ¤¨'ÿ£§&ÿ ¤&ÿž¡&ÿ™ž#ÿ—›$ÿ‘—"ÿŒÿ…Šÿƒ‡ÿ‚†ÿ€ƒ ÿy|ÿtuÿkqÿjnÿhlÿjmÿqr(ÿ||6ÿ……?ÿŠˆGÿNÿ‘Oÿ‡‹Iÿvz8ÿcj'ÿ^e"ÿfo,ÿqz7ÿs…Jÿ‘žpÿ¶ÃÿàéÏøýî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúîî ïÚÜníÁ´ÿë«’ÿò wÿóŸoÿ÷¥nÿüªsÿõ®|ÿôª€ÿô¨„ÿõ¨ˆÿýª‹ÿÿ«ÿÿ¨†ÿý¤ÿû£tÿø qÿñœlÿî™iÿï›gÿóŸkÿø¦oÿüªsÿü­tÿþ¯vÿÿ³zÿÿ¶}ÿÿ»ÿÿ½ÿÿÀ„ÿÿÁ…ÿþÇŠÿýÊŒÿþÍÿÿÐ’ÿþÒ“ÿþÒ“ÿþÔ“ÿþÔ“ÿþÕ–ÿÿÕšÿýÖŸÿýקÿüÙ±ÿýÜ»ÿÿàÁÿÿßÌÿòßØÿîÛÔÿìÞÂÿçÛ«ÿØÔÿÎÍrÿÃÇVÿ»À?ÿ²º1ÿ¬´+ÿª±(ÿ¨¯&ÿ¦ª)ÿ¨ª.ÿ¨ª3ÿ¥§0ÿ£¨'ÿ¢§&ÿŸ§%ÿœ¢%ÿ˜ $ÿ”š#ÿ–#ÿ“$ÿˆŽ#ÿ…‰"ÿ€„$ÿ}€$ÿw|!ÿsv ÿkqÿgkÿhpÿot)ÿxy5ÿ~Bÿ‰‚Pÿ‘ŠXÿ”ŽYÿ”ŽYÿ—–ZÿŽŽNÿ|<ÿhr,ÿ^h&ÿ_l.ÿn}@ÿ}‡Xÿ—žƒÿ½À±ÿàäØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïñ ÿÜÏÿÄ«ÿÿ°‡ÿø¤tÿô¢kÿö¤mÿö¯}ÿù¯…ÿû¯‹ÿù¬Œÿýª‹ÿÿªŒÿÿ®Œÿÿ°‹ÿÿ°ÿÿ­~ÿÿªzÿû¦vÿù¥qÿö¢nÿô¢kÿò iÿô¥lÿö§nÿø«rÿû®uÿü´xÿÿ·{ÿÿ»ÿÿ½ÿøÁ„ÿøŇÿùÈŠÿüËÿúÎÿûÏÿúÐÿûÑÿüÓ”ÿüÒ—ÿúÓœÿùÓ£ÿùÖ®ÿúÙ¸ÿýÞ¿ÿýÝÊÿïÜÕÿìÙÒÿêÜÀÿåÙ©ÿ×ÓŒÿÍÌqÿÃÇVÿ»À?ÿ¯·.ÿ©±(ÿ§®%ÿ¦­$ÿ£§&ÿ£¥)ÿ¢¤-ÿŸ¡*ÿž£"ÿ¢!ÿš¢ ÿ— ÿ’šÿŽ”ÿŠ‘ÿˆŽÿ‡ÿ€„ÿ{ÿuxÿnsÿorÿu{$ÿ{-ÿ~†3ÿ‰ŽCÿ“”Pÿ•”Xÿ˜‘_ÿ›”bÿœ–aÿš”_ÿ”“Wÿ?ÿjo*ÿcm'ÿeo-ÿkx:ÿƒ’Uÿž¨yÿÅ̱ÿéìÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêâÕ€ãγÿ⸕ÿæ¨ÿôœwÿÿ¢ÿÿ©†ÿÿ­ÿÿ°ÿú°Žÿó±Žÿò´Žÿô¶ÿÿ¶ÿÿ·ÿÿ·ÿÿ·ÿÿ¶Šÿø¯ƒÿó¨zÿî£uÿñ¥tÿò¦uÿó¨tÿô©uÿø¬wÿû¯zÿÿ³~ÿÿµ€ÿú¹‚ÿü»„ÿþ¿…ÿÿÁ‡ÿþŇÿÿljÿÿˈÿÿ̉ÿÿ΋ÿÿÍŽÿÿÎ’ÿÿÏ›ÿÿÑ¥ÿÿÔ°ÿÿÙ·ÿÿÙÂÿîÙÑÿëÖÎÿéÙ¼ÿåצÿØЊÿÐËpÿÇÆXÿ¾½Cÿ²´2ÿ¬®,ÿ§¬)ÿ¤§)ÿŸ¡)ÿž-ÿ››/ÿ——+ÿ“š'ÿ’™&ÿ•$ÿŒ‘$ÿ‡Œ#ÿ„ˆ#ÿ…&ÿ€‚(ÿuz%ÿux(ÿtx,ÿtw/ÿvz3ÿ~€>ÿŠŒJÿ“”Vÿ”œ]ÿ˜žcÿ›Ÿdÿœšdÿ›™cÿ›eÿš˜^ÿ“‘WÿEÿlq4ÿ`f+ÿfo7ÿp{Iÿ‚Ždÿ¤µŠÿÈÔ¶ÿéêæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷êûæË¥øΫÿóµŒÿû£~ÿþšwÿÿ¢ÿÿªŒÿÿ³“ÿÿ¸–ÿû¹–ÿõ·‘ÿñ³ÿÿº“ÿÿº“ÿÿº“ÿÿ»”ÿÿ¾’ÿÿ¾’ÿÿ¼ŽÿÿºŒÿý±€ÿü°ÿù®zÿö«wÿõ©tÿöªuÿø¬wÿú®yÿöµ~ÿ÷¶ÿ÷¸~ÿùº€ÿ÷¾€ÿúÁƒÿûƃÿýÈ…ÿÿʇÿÿÊ‹ÿþÊŽÿýË—ÿÿ΢ÿÿÑ­ÿÿ×µÿÿ×ÀÿëÖÎÿçÒÊÿåÕ¸ÿßÑ ÿÑɃÿÈÃhÿ¾½Oÿ¶µ;ÿ¬®,ÿ¦¨&ÿ¡¦#ÿŸ¢$ÿ›%ÿ›š*ÿ™™-ÿ••)ÿŽ•"ÿ”!ÿŠÿ†‹ÿ†ÿ~‚ÿz~ÿz|"ÿ{€+ÿ~1ÿ…‰=ÿ‘”Lÿ¡Zÿ¤¦dÿ¤¦dÿ¢£eÿž¦gÿ£hÿ›Ÿdÿ›eÿ¢ jÿ£¡kÿ—•[ÿ…ƒIÿll0ÿhm0ÿkq6ÿvGÿ‡’`ÿ¥±‡ÿÌݲÿíùÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïëàOñÐÁÿï·¤ÿö£ÿõÿùŸ|ÿÿ¬‰ÿÿº“ÿÿ¼”ÿø¼’ÿø¼’ÿ÷ºšÿõ¸˜ÿö¹™ÿù¼œÿýÀžÿþÁŸÿÿžÿÿžÿÿÂœÿÿÀšÿÿ¾—ÿûº“ÿù·Žÿô²‰ÿñ°„ÿî­ÿú¬ÿú¬ÿ÷¯€ÿø°ÿù´‚ÿý¸†ÿÿ½†ÿÿ¿ˆÿÿ¿ˆÿÿÀ‰ÿÿÀÿÿÁ•ÿÿÄžÿÿȪÿÿʵÿÿйÿèØ»ÿåÕ¸ÿáÖªÿÚÏ–ÿÊÄ{ÿÁ¼gÿ¶´Pÿªª>ÿŸ¢/ÿš*ÿ•˜%ÿ“”&ÿ“$ÿŠŽ$ÿ‡ ÿ†‹"ÿ~‚)ÿ‚-ÿ€ƒ.ÿ€1ÿ5ÿ…†>ÿŒKÿ“’Uÿ˜—]ÿ¤¢lÿ«ªwÿª¨xÿ¦¦vÿ¨¨xÿ¥¨wÿ¡¢vÿ¡wÿž¢xÿ¤©uÿ£¨kÿ¡©cÿ™¡[ÿ~†@ÿjr,ÿci0ÿkn=ÿy|Uÿ’sÿ«±˜ÿÑÙÈ°ïùé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþúï ÿêÛnÿÚǽÿ»¥ÿÿ¬Žÿú }ÿÿ¥‚ÿÿ³Œÿÿ¼”ÿþ˜ÿÿÅ›ÿü¿ŸÿýÀ ÿýÀ ÿü¿Ÿÿü¿ÿÿ ÿÿÅ¡ÿÿÇ£ÿÿÇ¡ÿÿÇ¡ÿÿÈ¡ÿÿÈ¡ÿÿÉ ÿÿÇžÿÿÇ›ÿÿÆšÿÿ»ÿÿ¹Žÿÿ¸‰ÿýµ†ÿù´‚ÿø³ÿù¶ÿù¶ÿû¸ÿü¹‚ÿú¸…ÿú¹ÿû¼–ÿþÀ¢ÿÿ­ÿþȱÿßϲÿÜ̯ÿ×Ì ÿÑÆÿÁ»rÿ·²]ÿ­«Gÿ¢¢6ÿ™œ)ÿ•˜%ÿ’•"ÿ“”&ÿ–'ÿ”*ÿ‘—*ÿ’—.ÿ”;ÿ“–Aÿ™œGÿ ¡Qÿ¥§[ÿ¬­eÿ°±oÿ³²uÿ¸·}ÿ¸¶€ÿ´³€ÿ±¯ÿ­­}ÿ¬¬|ÿª­|ÿ©ª~ÿ¥©ÿ¤¨~ÿ¬±}ÿ¨­pÿ•Wÿ~†@ÿlt.ÿks-ÿsy@ÿƒ†Uÿ›žwÿ¸½žÿÜâÉ°õýìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòãÓƒìË·ÿã³—ÿ꧆ÿò¨„ÿù¯‹ÿÿ»•ÿÿÄžÿýŨÿüħÿø¤ÿõ¿¡ÿöÁ¦ÿûÆ«ÿýÈ­ÿûÆ«ÿüÊ®ÿý˯ÿÿͯÿÿϱÿÿвÿÿвÿÿѱÿÿаÿÿÑ°ÿÿЯÿÿÏ­ÿü̪ÿø˦ÿõÈ£ÿõÇžÿôÆÿñÚÿð™ÿíÀšÿêÀÿèÀ£ÿéĪÿìdzÿêɵÿßжÿÛ̲ÿ×ʪÿÎÄœÿÀ¹ˆÿµ±wÿ¬ªjÿ£¢^ÿ››Uÿ™™Sÿš›SÿžVÿ¡¢Xÿ¥¦\ÿª«aÿ®¯eÿ¶¶zÿ¸·ÿº»ƒÿ¾½ŠÿÂÁÿÃÀ“ÿÀ¿“ÿ¾¼”ÿ¶µÿ²±‹ÿ°¯‰ÿ±°Šÿ¯°‰ÿ¬­†ÿ«¬„ÿ­®†ÿ®±Šÿ¬¯ˆÿ¥«zÿŠ“Zÿq};ÿht2ÿhv6ÿs~Fÿ†dÿ¨­ŽÿÉιÿçèßYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûëÿêÖ~ÿÓ·ÿýº™ÿó©…ÿÿô­‡ÿÿ¹“ÿþÆ©ÿÿÊ­ÿÿÌ®ÿþȪÿúŪÿûÆ«ÿüǬÿúŪÿüÊ®ÿý˯ÿþÌ®ÿÿͯÿÿϱÿÿвÿÿѱÿÿÒ²ÿÿÕ´ÿÿ׶ÿÿÚ¸ÿÿÛ¹ÿÿÜ·ÿÿÚµÿÿÙ°ÿÿ×®ÿÿدÿÿ×®ÿÿÕ¯ÿþÔ±ÿüÔ·ÿûÖ¼ÿü×ÃÿúÙÅÿîßÅÿêÛÁÿèÛ»ÿâØ°ÿØÑ ÿÑÍ“ÿËɉÿÄÃÿÅÅÿÄÄ~ÿÅÆ~ÿÈÉÿÊËÿÌ̓ÿÐчÿÓÔŠÿÍÍ‘ÿÌË“ÿÈÉ‘ÿÆÅ’ÿÃÂÿÀ½ÿ»ºŽÿ¹·ÿº¹“ÿ·¶ÿ¶µÿ¶µÿµ¶ÿ´µŽÿ´µÿ·¸ÿ´·ÿ¡¤}ÿŠ_ÿmv=ÿam+ÿlx6ÿ}‹Kÿ‘œdÿ³¼‘ÿ×ܽÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðè(õÚÌšéÁ¯ÿä®—ÿ਋ÿå©Œÿõ·™ÿÿĦÿÿгÿÿÑ´ÿÿ̯ÿþȯÿüɯÿúɳÿ÷Ë´ÿ÷Ë´ÿõʵÿ÷Ì·ÿ÷θÿúÑ»ÿúÓ½ÿûÔ¾ÿñÔ¹ÿòÕºÿó׿ÿõÙÁÿôÚÂÿôÚÂÿõÚÀÿôÙ¿ÿøÝÂÿøÝÂÿ÷ßÃÿùßÇÿ÷ãÊÿõäÏÿõèÒÿöæÙÿúæáÿöâÝÿòå×ÿîâÐÿâÝÄÿÝÙ¼ÿÙضÿÔÓ±ÿË̪ÿÊË©ÿËʨÿÊɧÿÉƧÿÆäÿÈâÿÉÄ£ÿÅÄžÿÄÃÿÂÃœÿ¿¾œÿ½¼šÿ¼ºœÿ½»ÿ½»ÿ½»œÿ»¹šÿ·¸–ÿ¸»”ÿ½Á˜ÿÁÆ™ÿ¾Ä•ÿ¸¾ÿŸ§xÿ}…VÿhrCÿirGÿr|Qÿˆeÿ• €ÿ¶¾§ÿÞçÓƒñ÷ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöè(ÿåÓƒÿйÿô¼Ÿÿ믒ÿ樊ÿì®ÿôºÿÿǪÿÿÒµÿÿÕ¼ÿÿÕ»ÿÿÒ¼ÿüйÿüйÿúϺÿúϺÿúÑ»ÿûÒ¼ÿûÔ¾ÿüÕ¿ÿöÙ¾ÿöÙ¾ÿôØÀÿôØÀÿóÙÁÿõÛÃÿøÝÃÿùÞÄÿøÝÂÿùÞÃÿùáÅÿûáÉÿøäËÿöåÐÿôçÑÿõåØÿüèãÿ÷ãÞÿóæØÿðäÒÿäßÆÿßÛ¾ÿÛÚ¸ÿ×Ö´ÿÑÒ°ÿÏЮÿÐÏ­ÿÐÏ­ÿÏÌ­ÿËÈ©ÿËÆ¥ÿËÆ¥ÿÇÆ ÿÈÇ¡ÿÇÈ¡ÿÆÅ£ÿÄáÿÃÁ£ÿÃÁ£ÿĤÿÀ¾ŸÿÁ¿ ÿÂáÿÅÈ¡ÿÇË¢ÿ½Â•ÿ¦¬}ÿ‘—hÿv~Oÿgo@ÿhrCÿ{„Yÿ– uÿ³º—ÿËÖ¶ÿæî×~øÿíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñè(òàÏùкÿþ¹˜ÿô¯Žÿî«Šÿö¶˜ÿÿƨÿÿжÿÿÓºÿÿÔ¾ÿÿÖÀÿÿÖÃÿÿÔÃÿûÕÃÿøÔÂÿøÔÂÿöÕÂÿöÕÂÿÿ×Äÿÿ×ÄÿþÖÄÿÿÕÈÿþÖÊÿÿ×ËÿÿÙÌÿÿÚÍÿÿÚËÿÿÛÌÿÿÜÊÿÿÝËÿÿßÏÿÿßÒÿþáÒÿüâÖÿùæßÿñáÚÿîãÕÿéãÐÿßÞÂÿÖÛ»ÿÐÛµÿÍزÿÈÓ­ÿÅέÿÄÌ­ÿÉ̲ÿÉ̲ÿÌÉ´ÿÌƳÿÌƳÿÊË«ÿÊË«ÿÉÉ«ÿÈȪÿÇƪÿÆÅ©ÿÅĨÿæÿÏϱÿÍάÿÈˤÿÁÅ›ÿ±·†ÿš¢mÿ€‰QÿpyAÿp|@ÿ‹Oÿ–Ÿtÿ©®ÿÃƶÿãçâEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûêÿñÛnÿÛºÿÿ˪ÿýº™ÿò²”ÿì°’ÿí´šÿø©ÿÿÑ»ÿÿÚÄÿÿÚÇÿÿÚÉÿÿÜÊÿÿÜÊÿÿÜÊÿýÜÉÿüÛÈÿÿÚÇÿÿÛÈÿÿÜÊÿÿÛÎÿÿÛÏÿÿÛÏÿÿÚÍÿÿÙÌÿÿÛÌÿÿÛÌÿÿÝËÿÿÞÌÿÿàÐÿÿáÔÿÿäÕÿÿæÚÿùæßÿñáÚÿîãÕÿêäÑÿâáÅÿÙÞ¾ÿÔß¹ÿÑܶÿÐÛµÿÌÕ´ÿÊÒ³ÿÎÑ·ÿÏÒ¸ÿÑιÿÒ̹ÿÑ˸ÿÎϯÿÌÍ­ÿËË­ÿÎΰÿÒѵÿÕÔ¸ÿÕÔ¸ÿÔÓ·ÿÑѳÿÃÄ¢ÿ°³Œÿ™sÿ‡Vÿs{FÿxIÿ†Wÿ‘aÿ¨´xÿÊÓ¨ÿâçÈ°óöæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþûìùïÝcîÜËÿçɶÿâ¹£ÿâ®—ÿð­–ÿö³œÿÿìÿÿͶÿÿÚÄÿÿáÌÿÿäÑÿúãÓÿïâÒÿíàÐÿõàÊÿõàÊÿõàÊÿöáËÿúãÍÿûäÎÿúáÍÿøßËÿûáÐÿüâÑÿüâÒÿýãÓÿþäÔÿÿæÖÿÿèØÿÿèÝÿñèÞÿïæÜÿêä×ÿçáÔÿâßÐÿßÜÍÿÙÚÆÿ×ØÄÿÓÖ½ÿÒÕ¼ÿÑÔºÿÐÓ¹ÿÏÔµÿÏÔµÿÏÔµÿÐÕ¶ÿÙÒÁÿÖϾÿÚÖ¾ÿÛؼÿÙÛ·ÿàä»ÿ×à®ÿ¾Ç•ÿ¬¸„ÿ–¢nÿ}ŠVÿuQÿrSÿvYÿŠ˜oÿ§³ÿÌÌÌšÚÚÚnìììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþìÿøç2ÿîÛnÿàÊ¥ÿ̵ÿýº£ÿô±šÿñ®—ÿù¶Ÿÿû¬ÿùÌ·ÿ÷ÖÃÿößÏÿôç×ÿøëÛÿÿêÔÿþéÓÿýèÒÿûæÐÿüåÏÿüåÏÿþåÑÿÿæÒÿüâÑÿûáÐÿûáÑÿüâÒÿþäÔÿÿç×ÿÿéÙÿÿéÞÿõìâÿôëáÿðêÝÿíçÚÿçäÕÿäáÒÿÞßËÿÝÞÊÿÚÝÄÿØÛÂÿÖÙ¿ÿÖÙ¿ÿ×ܽÿÙÞ¿ÿÚßÀÿÚßÀÿèáÐÿçàÏÿëçÏÿãàÄÿÌΪÿ¾Â™ÿ­¶„ÿ— nÿ‚ŽZÿ{‡Sÿu‚Nÿ~ŠZÿ’Ÿsÿ«¶ŽÿÂЧÿØäÀìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûïå;ïßÏêÒÀÿÝ¿¬ÿἦÿḡÿ浟ÿí»¥ÿþDzÿÿÒ¾ÿÿÙÅÿÿàÜÿÿåáÿÿëçÿÿíéÿÿìçÿÿéäÿÿèäÿÿèäÿûçâÿ÷çáÿôåâÿòçãÿñèäÿïëæÿðíèÿðíèÿöêêÿöêêÿóééÿðææÿêãàÿæßÜÿáÝØÿàÜ×ÿáàÖÿßÞÔÿààÔÿãã×ÿèèÚÿêêÜÿéêÚÿæç×ÿÝãÀÿÒصÿÉЫÿ·¾™ÿ™¢zÿ‡hÿŠbÿy„\ÿz„`ÿ‹“tÿš£‰ÿ­´ŸÿÈÏÀìâèÝcðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüìÿõãEÿéÖ~ÿàÊ¥øϸÿð¿©ÿë¹£ÿ︣ÿõº¦ÿõº¦ÿëÆÂÿóÎÊÿüÙÕÿÿâÞÿÿçâÿÿèãÿÿêæÿÿëçÿÿîéÿÿðêÿþïìÿûðìÿùðìÿõñìÿõòíÿ÷ôïÿüððÿþòòÿýóóÿüòòÿøñîÿöïìÿòîéÿòîéÿðïåÿìëáÿççÛÿååÙÿááÓÿÚÚÌÿÏÐÀÿÇȸÿ°¶“ÿž¤ÿ–qÿ†hÿ|…]ÿ}†^ÿŠ•mÿ–¡yÿ®¸”ÿÉѲÿÝæÌšéðÛnóúëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóå;ûçÖ~÷ÛÊÿøÏÀÿí±ÿë¹¥ÿï¹¢ÿðº£ÿó½¦ÿø«ÿýɲÿÿѺÿÿØÁÿÿÞÆÿÿëÓÿÿïÖÿÿôÚÿÿöÜÿÿöÛÿÿ÷ÜÿÿúßÿÿýâÿýûÝÿþüÞÿüüÞÿúúÜÿõøØÿòõÕÿìóÐÿëòÏÿÞèÄÿÔÞºÿÆÑ«ÿ¸Ãÿ­¸ÿ¡¬„ÿ”ŸwÿŒ—oÿ…‘mÿ~‰iÿŒkÿ™{ÿš¦ˆÿ©´šÿ¾È±ÿÏØÄÊáèÙyðöëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíÿùè(ÿðáOÿäÓƒÿÛǽÿйÿÿʳÿ÷Áªÿò¼¥ÿﻤÿð¼¥ÿｦÿí¿§ÿé½¥ÿê©ÿíÈ®ÿëÊ°ÿêͲÿíеÿðÕºÿôÙ¾ÿæäÆÿãáÃÿÚÚ¼ÿÒÒ´ÿÆÉ©ÿ½À ÿ±¸•ÿ¬³ÿž¨„ÿ—¡}ÿ˜rÿ‡’lÿ‡’jÿŠ•mÿŽ™qÿ‘œtÿ›§ƒÿ¤¯ÿ´¿žÿÈÒ´ÿÕáÃÜàëщí÷àOùÿîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôùä;ñòÞYìë×ÿèâÏÿæÚÈÿáÑÀÿÞʹÿàôÿݼ¬ÿ们ÿ纬ÿ뺬ÿï»®ÿõ¾±ÿúÁ²ÿüôÿÔѼÿÏÌ·ÿÆîÿ½º¥ÿ°²œÿ¦¨’ÿ›Ÿ†ÿ”˜ÿ‘—~ÿ’˜ÿ”ƒÿ›¤Šÿ¦¯•ÿ´½£ÿÃ̲ÿÌÕ»ÿÓÚË¥ÞäÙyèïâEîóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð ÿÿíÿþëÿúè(ÿõä;ÿïÞYÿêÛnÿåÕ€ÿßЉÿØÊ¥ÿÔƽÿÓƽÿÔǽÿÕƽÿÔÅÊÞÛƽÚ×ÂÜÖÓ¾ÿÕÒ½ÿÑÓ½ÿÏÑ»ÿÉÍ´ÿÅÉ°ÿÈεÿÏÕ¼ÿÕÞÄÊÝæÌšãìÒƒéòØyðùßYõþä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîíåäêãââââåææíïï ÜÚÚ6ÔÏÐj½À¿¦¬±°¶¦¦¦Á £¤äž£¥à¦§¤Á±±¯µ¾Á®ÓÔÔràáÞ4ìíë îïíâãáÚÚÙÝßÞæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîîæåðèçãàá*ÆÄÄ}¢¢¢Ú…‰‰ÿw‹ˆÿg‘Šÿkž–ÿ€«¤ÿš®ªÿ¨«¤ÿ¦¦šÿš—ŠÿŒ‚ÿˆˆƒÿˆŠˆþ¢£¢ÔÈÊÈáâà'ßßÞÞàßæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççðõóìãâ1Á¸¶¬ŠŒ‹ôp‹†ÿj©Ÿÿfͼÿ`ßÊÿVçÓÿMêÔÿfíØÿ¿ðàÿééÓÿçÚ«ÿâÙŽÿäÖ•ÿÙΚÿÇ¿˜ÿª¡ÿ‹‡ƒÿŠŽó¶¸¸›Þàà,êìïééîééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëíêêîììÄÈÇš‹Žõi–ŽÿiǹÿYãÐÿAéÒÿ-çÎÿ(äÍÿ#âÍÿ(âÌÿMäÎÿ®æÙÿßáÈÿãшÿÞÓYÿÞÓYÿÞÐgÿÞÓoÿâØÿÝÓ›ÿöÿ”Ž‡ÿôÂÃÈ”ìíòëëñááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææñîïçâã6«£¥ÓsŒÿoĸÿYåÒÿ8åÍÿ%áÉÿ&ßÇÿ(ÝÆÿ)ÚÃÿ!ØÀÿ%Öºÿ=Ú¼ÿ˜ÜÈÿÎÔ³ÿØÂxÿÙÀTÿÚÀZÿÜÄ^ÿÞËYÿÞÍWÿÝÍ`ÿãÑtÿàÓ–ÿûšÿ‘Ž†ÿ¦¥«ÑÞßè:ååçíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòëêêÝ××V‘––ôl© ÿ\àÍÿ8åËÿ$áÄÿ"ÞÁÿ%Ú¼ÿ$Ö·ÿÑ­ÿÍ¥ÿÉ¢ÿ+Æ¢ÿEЬÿ—Õ»ÿÆͨÿÊ·sÿëPÿÁ§IÿÆ­IÿÌ´NÿÕºXÿÚÁ[ÿÛÇYÿÜÉ^ÿáÏxÿÝКÿ§¡Žÿ••šð×ØÚPòññìóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôèøõíù÷ÙÔÕ\†“‘ùn¿´ÿPåÏÿ*ßÅÿ$ÛÁÿ$عÿÒ°ÿ ʤÿÄ™ÿ"–ÿ6ÆœÿHͦÿiÓ³ÿ…ßÂÿ¿ãÔÿÞàÍÿâÑ«ÿÖÀŽÿеyÿƨ_ÿ¼žLÿ¾¡HÿÆ«KÿÍ´RÿÓÀTÿÙÅVÿÚÇeÿÞÐÿ¸±•ÿ”“’ùØØÙ[ï÷ôêõóêõóêõóêõóêõóÿÿÿÿÿÿÿÿÿÿÿÿêóòêóòêóòêóòî÷õÛàßu‹—–ùkƸÿDâÊÿ$Ú¾ÿ#عÿÑ­ÿÉ¡ÿÁ˜ÿ»ÿ)¾Žÿ:Ä—ÿF›ÿCÁ—ÿ9À‘ÿIÕÿ„Ë£ÿ³¿•ÿ¼£kÿº^ÿÃ¥iÿɧsÿƨiÿºŸQÿµ™Dÿ½DÿĪIÿ͵QÿÕ¿TÿÕÂ]ÿáÌ€ÿƸžÿ—š‘ú×àÞYñõòíòíîòíîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòïïòïïòïïôòñìáâ0—œ›÷kôÿDàÇÿ"عÿÔ²ÿ Ê¥ÿ˜ÿ¼Šÿ¹„ÿ ¹„ÿ*µ…ÿ ³ÿ´zÿ'·„ÿ9Á“ÿ^Ê¥ô•Ó³æ¹Ç¡àÀ­è·›aÿ°ŒMÿ«…>ÿ¯‰@ÿ»‘Pÿ½”Sÿ²’Aÿµ•?ÿ¿JÿÉ«MÿϹOÿÒ¾VÿÝÊ}ÿÁ¶ÿ¡Ÿ ìéèä2óóîððëððìððìÿÿÿÿÿÿÿÿÿÿÿÿñíìñíìòííõïï«®¬Ór¼®ÿBàÄÿÖ¶ÿѬÿÈÿ¿‘ÿ·…ÿ´{ÿ³vÿ°vÿ±ÿFßÿŠÚÅÞ«ëØ–Ëöëméúø&îøüÞæÓ îåÖòìÜFàÛÂ}ÑèɷŸoÿ£ˆ?ÿ©„8ÿ³†Bÿ²Š>ÿ³>ÿ»—DÿĦHÿ̵KÿÓ¼OÿØÇÿµ­˜ÿ±°°ÇðòððóîïòíïòíÿÿÿÿÿÿÿÿÿÿÿÿñííñííöñòËÇLJv¯¤ÿBàÂÿ"Ô²ÿΨÿ Äšÿ¼Šÿµ€ÿ±xÿ¯tÿ°{ÿF¿˜ÿ–áÈÏÎ÷íZêÿþÐúîÓþóíüûî÷üÜäÐìãÔøóãñðÙúøñòïßAÓΧ¸³›iÿ§=ÿ©5ÿ«…5ÿ°‰:ÿ¸‘CÿÀ¡FÿɯKÿ͹RÿÓƇÿª¦šÿËÍɉòöîîñêîñêÿÿÿÿÿÿÿÿÿÿÿÿééêëëìèãã,’¬§õ]Ô½ÿ(Ô³ÿ̧ÿÙÿ¹Šÿ´}ÿ±xÿ®uÿ#³€ÿvÏ´ðÈôìvâÿúßÿöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéù÷çñìÓîãÓRǹŠæ§…Fÿ§3ÿªƒ4ÿ­‡<ÿ³’=ÿ»ŸHÿͬKÿÏ·ZÿÉÀÿ¯§¨õéçê!ðïïîíîÿÿÿÿÿÿÿÿÿÿÿÿåëêéïïÆÂħp¿°ÿ+صÿ"ɤÿ–ÿ»ˆÿ±ƒÿ±vÿ®tÿ'²†ÿˆ×Àõäüõ2èÿÿÛþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËüöæõô玡˫‰Bÿª}2ÿ¢‚6ÿ¯‰7ÿ¸’?ÿ¼ŸGÿȬGÿÓ»jÿº¯žÿÇÇË–ðïðëêëÿÿÿÿÿÿÿÿÿÿÿÿêééåãã"›´¯õVзÿË¥ÿÙÿºŠÿ³~ÿ®xÿ­rÿ²~ÿ€Ò¹åçýö:ðÿþåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËùóâ÷÷ëûöì̼˜Ø¦…@ÿ¨z8ÿ«€6ÿ®Š6ÿ²‘?ÿÁ¡DÿƪRÿȺ‰ÿ²°©îäããçååÿÿÿÿÿÿÿÿÿÿÿÿíííÑÑÐvyÁ°ÿ.ЬÿÄ™ÿ½ÿ´‚ÿ°xÿ°qÿ¯wÿdȪùÛõíMíÿúìÿüåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåëæÊùóáõôçü÷íîéå/¼­{ô­‚6ÿ¨|7ÿ¨‚4ÿ¯‰=ÿº•@ÿÀ Eÿʳdÿº²˜ÿÒÒÑmíîñÿÿÿÿÿÿÿÿÿÿÿÿíññ´Â¿ÏUË®ÿÇžÿ¾Žÿ·‚ÿ±zÿ®tÿ¯qÿ8»‘ÿ¾äÙ‡òúøíùöëýùäýûÙþôÚýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéöôäòðØùõêöõêöôéøöïæàʆ±˜Uÿ¦}4ÿ¨~5ÿ«‚9ÿ²Œ=ÿ¹™@ÿÅ¥LÿÅ´†ÿÂÀ»Çîñùÿÿÿÿÿÿÿÿÿÿÿÿæëë2œ½¶ÿ:Ì©ÿ¾“ÿº‡ÿ³{ÿ°vÿ¬rÿ±yÿ}Ϲîéöôæ÷õå÷ôå÷ôæ÷öâýøÞýöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷ôäóòèñíëòîêòîêòïëóïî ĵ™à©„8ÿ¨}1ÿª6ÿ­‡9ÿ±‘>ÿ¾˜CÿŬnÿ¼¹«úäèï0ÿÿÿÿÿÿÿÿÿÿÿÿâÚÜ\vðÿ)Åÿ¹Œÿµÿ°yÿ­uÿ­sÿ5¹ŠÿÀâÛŸøÿÿñÿÿñÿÿñÿÿñÿÿñÿÿñÿÿëÿþÉ÷êÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÔ÷öëôñæòðæñïæñïæñïæñïåõóëÚ×Ê’®’Uÿ§~/ÿ¨6ÿ«8ÿ°‰;ÿ¶“=ÿãVÿ¼µ—ÿ×Ùã`ÿÿÿÿÿÿÿÿÿÿÿÿÏÒцZèÿÀ’ÿ·„ÿ³{ÿ¯uÿ¬sÿ®wÿZÅ þàíç<ï÷ôì÷ôì÷ôì÷ôì÷ôì÷ôí÷óìøõÇ÷éÏüñëûúí÷ûÜäÐìãÓ÷ñàîìÖîòéííèíîèîîèîîèîîèîîèïðêçèá@¸¥xÿ©€5ÿ©}4ÿ¬7ÿ®…9ÿ³Œ;ÿ»˜Fÿ»°…ÿÕÔØÿÿÿÿÿÿÿÿÿÿÿÿÂÒδHÄ¢ÿ¹‡ÿ³~ÿ°wÿ®sÿ­qÿ²}ÿͶæéìéâëæâëæâëæâëæâëæâëæâëæãëæÜîçØüôêüúí÷ûÜäÐìãÒöòçíððìïñìïñìïñìïñìïñìïñìïñíðòìðóÁ¶šîª„<ÿ¦|1ÿª4ÿ¬‚4ÿ¯‰7ÿµ<ÿ»ªvÿÐÍË¢ÿÿÿÿÿÿÿÿÿÿÿÿ¼ÎÇÁFÄŸÿ¹…ÿ´~ÿ²zÿ±xÿ¯vÿ-¶‡ÿ¡ÍûíçëææçææèææèææèææèææèææèææçèåçãëêêúùíøüÜäÐéãÔéëèçêêçêéçêéçêéçêéçêéçêéçêéçêééííɯ̮ŽJÿ¥€6ÿ¨‚8ÿª„:ÿ­‰=ÿ²Aÿº¤pÿÏÈŶÿÿÿÿÿÿÿÿÿÿÿÿ¾ÌÈÁaÉ¥ÿH¿‘ÿG¼ÿE»ŠÿCº‰ÿ@ºˆÿXšÿ¸ÍʵßÙÞÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÛÞàãéôõåìåççæçèèçèèçèèçèèçèèçèèçèèçèèçèèçèèêëìÎɼú gÿ±Rÿ³‘Sÿ¶“Tÿ·•Wÿº™Yÿ¾«{ÿÎÊÆÖÿÿÿÿÿÿÿÿÿÿÿÿÊÌÎîɦÿ¥¾—ÿ¥½—ÿ£»•ÿ£»•ÿ¢½•ÿ¬Æ¦ÿÆÏɶÚÝÝ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛÙÞÝëíìîîíìçéìæçëæçëæçëæçëæçëæçëæçëæçëæçëæçîèëÊÉÁIJ¬|ÿ©›eÿ®œdÿ°eÿ¯žiÿ°¡lÿ³²„ÿÌËŸÿÿÿÿÿÿÿÿÿÿÿÿßÎ˹éµÿë¥zÿè£zÿé£zÿè£zÿè£yÿã°‘ÿÐŽÊëíîëììëëìëëìëëìëëìëëìëëìëëìëììêëëæéêîïîîîìééêèåèéæééçééçééçééçééçééçééçééçéìéí½¿µË•\ÿ€Bÿ„Aÿ„€Aÿ„‚Dÿ‡ƒDÿ“›fÿÆÉÁªÿÿÿÿÿÿÿÿÿÿÿÿàÕιú£yÿýŽZÿü[ÿý[ÿüŽ[ÿþ[ÿûœvÿθ«óèõõ%ðûúïúùïúùïúùïúùïúùïúùîúùïûùæììâççîïîîîìèéêããæëéîèçìèçìèçìèçìèçìèçìèçìéèíéç﩯Ÿðt|8ÿbfÿcd ÿbcÿbeÿafÿy†MÿÌÐÊÿÿÿÿÿÿÿÿÿÿÿÿßßÙ‘ô£|ÿý‰RÿýˆSÿþˆSÿþŠVÿüTÿþ›iÿÕ¯ ÿÙééëûùéøöéøöéøöéøöéøöéø÷êøøêóóäééãçèîïîîîìèéêÝÞßäâæéçêëéêëéêëéêëéêëéêëéêíëìáÞãC™ …ÿmt(ÿ^`ÿ]_ÿ]^ÿ\^ÿ[_ÿ{‡PÿÔØÔtÿÿÿÿÿÿÿÿÿÿÿÿèçå^ñ©ŠÿýŠUÿý†Sÿü‡SÿþŠWÿüWÿÿšfÿݨ“ÿÅÏΧëðõçìðèìðèìðçìðèìñçìïâæéçêíäééãçèîïîîîìèéêÞßààßãäæãîðëìíêìíêìíêìíêìíêðòïÍÌΡ”mÿlq"ÿacÿ^aÿ\_ÿ]_ÿ]`ÿŠ“dÿßáÝPÿÿÿÿÿÿÿÿÿÿÿÿóóí#ì¹¢öþZÿþ†Rÿù‰RÿÿŠVÿýZÿÿ˜dÿÿº±«èêîöñõúðóùðóùðôùîðöéçìáâæçëîäééãçèîïîîîìèéêÞßààßãÝàÝíñêîñïìïóëîòëîòíðôéì类§í‰Rÿmnÿeeÿ^aÿ]`ÿ]^ÿ]dÿ ¦‰ñðòíÿÿÿÿÿÿÿÿÿÿÿÿöôðë;¾ü“fÿÿ†Oÿü‰PÿþŠVÿü‘Yÿý˜`ÿÿ­ƒÿħšÿÂÍЛñùüíô÷íô÷ìôöéìîåäèâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóêíñìêëñíðòíïññôöÈËÒ›”ž€ÿ‚‹6ÿlmÿdfÿ]aÿ]_ÿZ^ÿeo,ÿ¿Å®¼õöóÿÿÿÿÿÿÿÿÿÿÿÿïôôéâÜjó¡}ÿþˆQÿþˆPÿþŠVÿü‘Xÿþš`ÿÿ¤sÿÿ¨¥žöçâç2õïóðêïåèéçèêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëêîèèçìððîôóòãæå@¢Ÿö–Ÿfÿ{€!ÿmoÿceÿ^_ÿ[^ÿY]ÿxƒOÿÜâÑlñöìÿÿÿÿÿÿÿÿÿÿÿÿîîëííè긟îùWÿþˆPÿþˆVÿþUÿþ˜aÿü£hÿÿ¹ŠÿÓ®œÿ«¨©ÓèééàßââçèèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïéåãéëéëîì짩©Øœ¥{ÿ‘•<ÿy{ÿknÿbeÿ^_ÿZ\ÿ\cÿ ¨ˆîïõéíóæÿÿÿÿÿÿÿÿÿÿÿÿî÷óîøõïÙÍ­úšjÿüˆQÿþ‡TÿþTÿý“_ÿø£fÿý¯vÿÿäÿ´£›ÿ¬ª¬ÀââååêëèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïééçíëè«Ì—›„ÿ «Vÿ…ˆÿwxÿfmÿaaÿ_^ÿX^ÿnx;ÿÎÓÅ~îôïéðéÿÿÿÿÿÿÿÿÿÿÿÿëÿÿéÿÿññï1÷¶—ôüŠYÿþ‡RÿüŠUÿþ\ÿü›dÿý«pÿü¸‡ÿüÊ®ÿ²–ÿ Ÿ ×ÚááKîïðææêâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞñõíòõïÝÜãJž ŸØ•›€ÿª´fÿ•&ÿ ÿorÿahÿ`]ÿ^]ÿ[fÿ˜£~ðãæÝàãÚàãÙÿÿÿÿÿÿÿÿÿÿÿÿëýþêýþôöïðÝÏ÷žvÿþ‰RÿþˆSÿþŒVÿý“`ÿÿ¢kÿü°xÿþ¿Žÿüѱÿ´¦šÿŠŠˆÿº»¼¤ååé(çéíêîñåêêãçèîïîîîìèéêßàáãáæäçäéîç7¼¿À·Š‰‹ü¡ƒÿ²»eÿ•Ÿ,ÿ‡ÿyzÿhlÿ`aÿ^^ÿY^ÿuGÿÕÛÏxíñîèíèèíèÿÿÿÿÿÿÿÿÿÿÿÿôöíôöíõõëööí õʯÑû‘`ÿþVÿûŠTÿû[ÿÿ™bÿÿ©mÿþ¸{ÿþÄÿÿÒ³ÿÝÀ®ÿ›‘†ÿŒŒ‹ò´³·µÕÙÛmàåå9æëìòóòóóðììîÝÞà*ÔÓÖ_±´²±ˆŠùŠˆƒÿ²´€ÿ¸¼Wÿ›¡,ÿ‘!ÿ€ÿppÿbfÿ^aÿY`ÿ`j)ÿ·¾žÏøýó ôùñóøñóøñÿÿÿÿÿÿÿÿÿÿÿÿø÷íø÷íø÷íùùîûóâ-òµ—îý‘_ÿý’bÿúŒZÿý‘Wÿþœdÿü¬uÿþ»ÿÿÅÿÿÒ£ÿüÙºÿй«ÿ¢‘‰ÿ‰ƒ|ÿŒŒ‰ÿ—––ñ›š™î™ššî”–—ð‰Šù…zÿÿ¬¯ƒÿ¿Çfÿ®¶9ÿ¢#ÿ”"ÿ‚„"ÿtsÿefÿcdÿcdÿ[cÿ˜Ÿzñïñå0øüîõúêõúêõúêÿÿÿÿÿÿÿÿÿÿÿÿüøëüøëüøëýøëþúíûìÞOõªŠóû—fÿÿšoÿý”aÿø“[ÿü›gÿþ¬tÿü½€ÿýȉÿýÍšÿÿÖ®ÿÿÛ»ÿïÒ¸ÿÛŲÿð§ÿ¶«©ÿ­© ÿ§ªŒÿ³¸ƒÿºÂzÿ¾Æfÿ³»@ÿ¦«)ÿœž)ÿ‘”$ÿ€†ÿqvÿfjÿjl&ÿrr.ÿ\fÿˆ‘büãæÙVùùòõõíõõíõõíõõíÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿúòúæÝVô«‹öýœpÿ÷©zÿù uÿþ˜jÿøœgÿû§oÿþµzÿýÂ…ÿþËŽÿþИÿÿÔ ÿÿØ©ÿÿáÅÿüçÝÿìä½ÿÍÒoÿ¶¾=ÿ¯´,ÿ©¬&ÿ¢¥$ÿ˜$ÿ‰Ž!ÿ{~ÿnrÿpq'ÿ‚>ÿ‚…Cÿai%ÿ\þÞåÓgøüñöúí÷úî÷úî÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìÿóñúäÜNð´Œöú¢{ÿü±‘ÿú³ÿû°…ÿø¬|ÿ÷ªvÿù®wÿû¶}ÿûÀ„ÿýɇÿþÍŽÿÿÓ©ÿöÚÌÿàÕ¨ÿÀÀLÿ¥ª ÿ›$ÿ“—!ÿ‰ÿ€… ÿ}€,ÿ‚†<ÿ’Oÿžœeÿ‘ŽUÿfl.ÿšiúÜáÐ^ôùéúÿðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþ÷ðûîß?ø¼¤Õø«†ÿû¾˜ÿûäÿýĤÿþÅ¢ÿüÄžÿüÀ˜ÿü¾“ÿúÀŽÿúÀŽÿùÄ£ÿîйÿÓÊ™ÿ±¯Vÿž9ÿ›ž<ÿŸKÿ¡¢\ÿ¨¨oÿ­¬}ÿ°°„ÿ¬¯†ÿ•Vÿox7ÿ¢¦„áèñÝBëðâîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿùëþõåöмœñµ—ÿú¿ ÿýÍ´ÿüÑ»ÿüÒ¼ÿûÖ¾ÿùÙÁÿùÚÁÿúÚ¿ÿøÞÇÿöâÖÿèÞÈÿÑÒªÿÇÊ¡ÿÊÈ¢ÿËÉ¡ÿÇÆ¢ÿÆæÿÄâÿ³¶Šÿ‡\ÿ}†Yÿ¾È©«ðôåï÷äçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿôäÿòæýíÙKõεÃó¾¦ÿúÉ´ÿúÙÆÿùáÏÿüâÑÿýáÒÿýßÑÿþäÖÿúçàÿêä×ÿÙÝÅÿÒ×¾ÿÖ×ÀÿÚ×ÀÿÕÔ·ÿ½Â›ÿ˜ sÿŠ”eÿ®µ”±ßãÑHêòßïóäìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿúêÿ÷åûæÖ=õÔ¿—óË·æö̼ÿúÖÉÿüßÒÿùçÚÿöìßÿøñåÿóíâÿåäÕÿÕÙÄÿÆ˲ÿ´º›ÿ ¨„ÿž©…ê¼Å©ŸßçÔAßáÛèëÞäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿøçÿóàþòáÿñÞÿóäúáÍJõâΘñÖðòμÂøμÍíØÂÐÏÑ·Þ¸½¡ß­·˜Ö¸Ã£»Ã̵‹ÓÝÈQìôáîõåêòâÙÜÓæéÛäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿþÿÿøÿÿàÿÿÀÿÿ€ÿÿÿþü?øøðð?þðÿÿàÿÿ€àÿÿÀÀÿÿàÀÿÿàÀÿÿðÀÿÿðÀÿÿðÀÿÿðÀÿÿøÀÿÿøÀÿÿøÀÿÿðÀÿÿðÀÿÿðÀÿÿààÿÿààÿÿÀàÿÿ€ðÿÿðþøøøü?þÿÿÿ€ÿÿÀÿÿàÿÿøÿÿüÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèìèèêîíôíìåÝÝ$¿»»~¡¦¥À‹ª¤ô~®§ÿ”±¬ÿ¬®§ÿ¬©ÿ¨§Ÿù¤¥¤Çº»¼…×ÙÙ-àâáåçêèèíçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèðììééè¾»¹ŽŒ¨£ð`±¥ÿKÏ»ÿCâÎÿ=èÒÿ•îßÿéäÆÿä×ÿÞÓ~ÿ˃ÿ±©‡ÿ¦£›ö±±´•ÝÞä(ííòçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóññíîÞÔÖK“¤¡äc¿±ÿ@ßÉÿ,çÏÿ$àÈÿÙÀÿ×¹ÿsÝÅÿÒÐ¥ÿØ¿UÿØÁQÿÞËYÿäÓfÿÞÎyÿÁ·ÿ¥£ìÉÊÔdìëííòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿç÷ôç÷ôçøõîø÷ÎÉÊg®¨÷HÖÂÿ+äÉÿÚ»ÿЭÿ É¢ÿ-É¢ÿJÏ«ÿ’ÜÄÿÕÓ³ÿÒºxÿǬ]ÿÄ©OÿË°OÿÕ¾SÿßÍbÿÕÇÿ¬§–ÿÆÆÉwð÷ôêöóêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿëóñëóññ÷ö×ÖÖez²©ÿ>ÜÄÿ Û¼ÿΩÿ˜ÿ!»ÿ.½ÿ6½ÿ8¿ÿoË¢ÿ¸¼‘ÿ¼aÿ¾œ_ÿ¾œ[ÿ¹™Kÿ¼EÿÉ®LÿÖÀUÿÜÈuÿ´¬–ÿÆÌÌ}ó÷óîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòííöñðçÝÝ5‰³«ò;Ù¾ÿÕ²ÿÆœÿºˆÿ´xÿ±zÿ<½“ÿnұɖâË¥ÆìàdÕÛÁWÝΰÊ·Žº¸œfó­ˆBÿ±ˆ=ÿ´@ÿÁ GÿζKÿÖÃpÿµ­üÜÜÜCóöððñìÿÿÿÿÿÿÿÿÿÿÿÿïìíóìíª¾¹ÂCÒ·ÿÒ­ÿÁ–ÿ¶ÿ¯sÿ"´ÿ}׺ÅÍøíUÞýøÛþöóúþâæÕöïáöõåôðá/Ï›«°ŽPÿ§0ÿ¯ˆ:ÿ»šCÿʱIÿ̼tÿº¹²×ìîëïòíÿÿÿÿÿÿÿÿÿÿÿÿêííØÖ×Udñÿ!ѬÿÀ“ÿ³ÿ­qÿ6¸ŒÿºëÝ‹ëÿÿÝÿöÔùñÒûðíøúàäÒóëÚòïÝ÷óâùõâèäÑW²–\ø¥|0ÿ«‡8ÿ»™Bÿ˯LÿÀ±‰ÿÑÏÔqïîïÿÿÿÿÿÿÿÿÿÿÿÿíèéªÅ¿Ç7Ì«ÿ–ÿµÿ®sÿ!³ÿ®æÕ÷ÿÿäÿûØýóÔùñÒûðíøúàäÒóëÚòïÝöñàôïÙþýôçàÎa®Pü¨{2ÿ­ˆ9ÿ¼š@ÿȱcÿþ­Øçæé ÿÿÿÿÿÿÿÿÿÿÿÿååå0tðÿÆšÿ¸„ÿ®vÿ¯rÿ†Ó»Éñûøëüùáýø×ýóÔùñÒûðíøúàäÒóëÚòïÜ÷òàõòáøõìûùõÖË©¦¦6ÿ¨~5ÿ±‹<ÿÁ DÿÀ¯ƒÿÚÜáRÿÿÿÿÿÿÿÿÿÿÿÿ×ÝÜfIƧÿ»‹ÿ²{ÿ¬qÿ3¸‰ÿØñîMòýýìüüìýýêÿýÖúóÑûðíøúàäÒóëÚóïÛöñæòðæòïçôòêëéâ0±˜aý¦|/ÿ«ƒ8ÿµ‘<ÿÁ¨gÿÒÒÐÿÿÿÿÿÿÿÿÿÿÿÿ¹ÒË¡(À–ÿµÿ¯uÿ «qÿhȧèðõóíöóìöóìöóïöóÛöîÒüòíøúàäÒôìÜïïâîïíîïëîïëîïëðòñŸ—Õ§|1ÿ«~5ÿ°‡6ÿ¸šJÿÍȹÁÿÿÿÿÿÿÿÿÿÿÿÿ¦ÎÂÈ ¼Œÿ³{ÿ°vÿ°yÿ—Ï¿­ïéëäææäææäææäææäææâðîëùùßåÒíëãêîïéíîéíîéíîéíîìñõÓÍ»ª…<ÿ¨5ÿ­…8ÿ´‘DÿǼ¦Ùÿÿÿÿÿÿÿÿÿÿÿÿ²ÍÃËdØÿa½ÿ]»Žÿ`À”ÿ·ÒÉ—ßÚÞÙÙÛÙÙÛÙÙÛÙÙÛÙØÛÙØÚåëìèìèèçèèççèèçèèçèèçèèçëëìÙÔʈ¶ždÿ´•Yÿ·˜\ÿ¹ bÿŽ¨çÿÿÿÿÿÿÿÿÿÿÿÿÜÊÁÈâ¬ÿá¦}ÿà¦|ÿ૆ÿ×Ì­åêëåèçåèçåèçåèçåèçâåäéëëîíìéæéìèëëçêëèêëèêëçêïëðÍÍÅ“Tÿ‰„FÿŠ†IÿŠŠKÿµº¡Ôÿÿÿÿÿÿÿÿÿÿÿÿæ϶ÿŽ[ÿÿˆTÿÿŠUÿÿ‘^ÿÛº©êçúúíúùìúøìúøíúùîúùäëëêììííìâãåéçëëéîëéíëéíëéíïíô´·¨Êfl$ÿ]_ÿ]_ÿ\dÿ¯¶»ÿÿÿÿÿÿÿÿÿÿÿÿëÞÖwú‘bÿý…Pÿý‰Tÿÿ’ZÿÛªÿÜæë7íñ÷êïôëïõèíñåéìâççêììííìàáãáááëìèìíëëìëíîìççê$š€ùfiÿ\_ÿ[]ÿ_dÿÁƲŒÿÿÿÿÿÿÿÿÿÿÿÿòëå5÷ yÿþ…MÿýŠTÿÿ“[ÿð§ÿÇÇÇ©ñøýñõúîòöæåéäæéâççêììííìáâäÞßßéîæíððìîòñôøÇÌÍ’‰Sÿijÿ^aÿZ\ÿmt8ÿÜÞÔ[ÿÿÿÿÿÿÿÿÿÿÿÿíòñÙý†Nÿþ‰Sÿý”Yÿÿ§uÿȬšÿØØÛIñïóæéêåäèäçêâççêììííìáâäÞßßêïæêëëññòâäç5Ÿ¦÷€…+ÿhjÿ^`ÿTXÿ‘™míðöëÿÿÿÿÿÿÿÿÿÿÿÿîõñîßÔqû’`ÿÿ†PÿþYÿü£gÿù¹ÿ¹«¦åÑÓ×8ëîïååèäçêâççêììííìáâäÞßßêïæððñàÞä+§© ß–Mÿz|ÿeiÿ]]ÿ\dÿÂɲƒïôîÿÿÿÿÿÿÿÿÿÿÿÿéÿÿíûû÷²“àþ…Oÿþ‹Vÿý™bÿÿ²{ÿﾟÿ­¤ŸóÃÈÊkæçë êíñäêêëííîîíãäæäååîóëÏÏÖ^¡£›ç ª^ÿŠ#ÿpsÿ`bÿXYÿŠ”dìäèâ!äçáÿÿÿÿÿÿÿÿÿÿÿÿòùóôúòôç×PùœoÿþˆQÿüŽZÿÿ¢hÿÿ½ƒÿöÉ¥ÿÀ¬ÿ¨¥¤Î»½¿Ð××Pâåå0æææ.Ö×Û@¼½Âx¤¦¨È ¢ÿ«¯Tÿ–š&ÿ|}ÿegÿZ\ÿfo.ÿØßËeøý÷ò÷ïÿÿÿÿÿÿÿÿÿÿÿÿû÷ëû÷ìüýñø׆ú•gÿý‘`ÿü”[ÿü¦nÿÿ¿„ÿÿÔ¡ÿèƪÿ¼§—ÿ²¨Ÿÿ¯¨§ÿ§§¢ÿŸ¤ÿ™Ÿuÿª¯aÿ±·=ÿ—œ ÿ}ÿjlÿfgÿ_g!ÿµ»ž«ûýóöøìõøëÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþùëÿûòøͼ•ùŸsÿù¢uÿüžoÿú¥mÿý·yÿÿÈŒÿÿןÿÿÙ«ÿúÞÐÿÞÙ§ÿºÀGÿ¯´/ÿ ¥ÿ‹ÿy}ÿwy,ÿ<ÿgo,ÿ­¸”³ûüô øüï÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþ÷íÿõòøÖ¿†ú®Œþû·“ÿüº•ÿûºÿûº‹ÿûÀ‰ÿüÆÿùÒºÿÒÊŽÿ¤¦1ÿ—š0ÿ•˜?ÿššXÿŸ¡kÿ–š`ÿ€ƒJÿµ½ž¡ðõè úÿðøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿóîÿùíûåÕGõèÛûǬÿüлÿúØÂÿúÙÂÿûÛÃÿùáÓÿãÜÄÿÉ̦ÿËɦÿËɨÿ¾¾œÿ£©|ÿ’špåÑØÀeò÷éíòãøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿôæÿôâúÞËcöѽ¿ùØÇóúÛÍÿøßÒÿøéÝÿèäÖÿÎÓ¾ÿÇʱÿ¼À¡û­¶“ÈÃ̱yãç×ðõäêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿñâÿõäþïßÿñßýìÛ$÷èÖj÷ÓÃ…ôÓÁ‘Ë̵ŸºÁ¦œÌÕ¼pÙãÏ.íõãêðáãæ×ëñÞêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿþü?øðàààøÀ?üÀ?þÀþÀþÀÿÿÀÿÿÀÿÿÀþÀþÀþÀ?üàøààðøüþ?ÿÿÿ€ÿÿðÿÿÿÿÿÿÿÿÿ(0 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèòñëééïðïïäãËÄÅ^¨º·«ˆ¹±Ô“ºµä¶·¬æ·´¢×¹¸²±ÄÅÈhÖØÚêëïçæêìñïêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèóòòííÖÒÒT“·±ÕUÀ±ÿ;ÛÆÿ%àÉÿiæÓÿßÙ§ÿßËdÿØÊsÿÁ·ÿ³¯ŸÝËÌÒaèèííòðêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿçöôèøöîõôÂÄÄ‚a¿³ÿ,ÞÄÿݽÿѬÿ(̧ÿlÖ¹ÿÍÈ™ÿÍ°ZÿͳPÿØÀUÿÝËfÿ¿µ†ÿ¿¾¿•ìóòë÷óêõòÿÿÿÿÿÿÿÿÿÿÿÿîòñôôôÉÍÌVǵÿ"Ú»ÿÉ ÿºŠÿ%¸…ÿ9À‘ÿqЬóÀ¿•í¿ždÿ·“Pÿ·”DÿÂ¥EÿÕ¾Vÿȹ}ÿÄÅÚñõòïòíÿÿÿÿÿÿÿÿÿÿÿÿöðñâÜÜ ///////////////////////////////////////////////////////////////////////////// #undef APSTUDIO_READONLY_SYMBOLS ///////////////////////////////////////////////////////////////////////////// // English (U.S.) resources #if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENU) #ifdef _WIN32 LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_US #pragma code_page(1252) #endif //_WIN32 #ifdef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // TEXTINCLUDE // 1 TEXTINCLUDE BEGIN "resource.h\0" END 2 TEXTINCLUDE BEGIN "#include \r\n" "\0" END 3 TEXTINCLUDE BEGIN "\r\n" "\0" END #endif // APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Icon // // Icon with lowest ID value placed first to ensure application icon // remains consistent on all systems. IDI_SYNERGY ICON "synergyp.ico" IDI_TASKBAR_NOT_RUNNING ICON "tb_idle.ico" IDI_TASKBAR_NOT_WORKING ICON "tb_error.ico" IDI_TASKBAR_NOT_CONNECTED ICON "tb_wait.ico" IDI_TASKBAR_CONNECTED ICON "tb_run.ico" ///////////////////////////////////////////////////////////////////////////// // // Menu // IDR_TASKBAR MENU BEGIN POPUP "Synergy" BEGIN MENUITEM "Show Status", IDC_TASKBAR_STATUS MENUITEM "Show Log", IDC_TASKBAR_SHOW_LOG MENUITEM "Copy Log To Clipboard", IDC_TASKBAR_LOG POPUP "Set Log Level" BEGIN MENUITEM "Error", IDC_TASKBAR_LOG_LEVEL_ERROR MENUITEM "Warning", IDC_TASKBAR_LOG_LEVEL_WARNING MENUITEM "Note", IDC_TASKBAR_LOG_LEVEL_NOTE MENUITEM "Info", IDC_TASKBAR_LOG_LEVEL_INFO MENUITEM "Debug", IDC_TASKBAR_LOG_LEVEL_DEBUG MENUITEM "Debug1", IDC_TASKBAR_LOG_LEVEL_DEBUG1 MENUITEM "Debug2", IDC_TASKBAR_LOG_LEVEL_DEBUG2 END MENUITEM "Reload Configuration", IDC_RELOAD_CONFIG MENUITEM "Force Reconnect", IDC_FORCE_RECONNECT MENUITEM "Reset", ID_SYNERGY_RESETSERVER MENUITEM SEPARATOR MENUITEM "Quit", IDC_TASKBAR_QUIT END END ///////////////////////////////////////////////////////////////////////////// // // Dialog // IDD_TASKBAR_STATUS DIALOG 0, 0, 145, 60 STYLE DS_SETFONT | DS_MODALFRAME | WS_POPUP FONT 8, "MS Sans Serif" BEGIN EDITTEXT IDC_TASKBAR_STATUS_STATUS,3,3,139,12,ES_AUTOHSCROLL | ES_READONLY | NOT WS_BORDER LISTBOX IDC_TASKBAR_STATUS_CLIENTS,3,17,139,40,NOT LBS_NOTIFY | LBS_SORT | LBS_NOINTEGRALHEIGHT | LBS_NOSEL | WS_VSCROLL | WS_TABSTOP END ///////////////////////////////////////////////////////////////////////////// // // String Table // STRINGTABLE BEGIN IDS_FAILED "Synergy is about to quit with errors or warnings. Please check the log then click OK." IDS_INIT_FAILED "Synergy failed to initialize: %{1}" IDS_UNCAUGHT_EXCEPTION "Uncaught exception: %{1}" END #endif // English (U.S.) resources ///////////////////////////////////////////////////////////////////////////// #ifndef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Generated from the TEXTINCLUDE 3 resource. // ///////////////////////////////////////////////////////////////////////////// #endif // not APSTUDIO_INVOKED synergy-1.4.12-Source/src/cmd/synergyp/tb_error.ico0000600000175000017500000000047612120644363022243 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€»»»»»»»»° »» »° »°€: »»»»°è¢ »° »Ž:0»° »è~~ ° °&&çç ° °ff~~p° &&çà»»f`~~ °&& çç °ff~p& çf`øÀ€€€€€Ààøsynergy-1.4.12-Source/src/cmd/synergyp/tb_idle.ico0000600000175000017500000000047612120644363022027 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ 9™™˜à¢™™™™Ž 9™:虘à™’™™€9™0 ™™˜©’™‰ž9š ™é˜yž™)–é— ™i–y™™™–™™i™`y™~&™– ç™™™™fy™™– çf`øàÀ€ƒÁ€0 pðàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/synergyp/tb_run.ico0000600000175000017500000000047612120644363021716 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0°è袢»°:»»°»°p»»»»»» » »»fpp »&&çç ff`~~&&& çççfff~~&& çf`øàÀ€ƒ 0€€Ààøsynergy-1.4.12-Source/src/cmd/synergyp/tb_wait.ico0000600000175000017500000000047612120644363022056 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0è袢ŽŽ::èè~~&&ççff~~p&&ççff`~~~&&& çççfff~~&& çf`øàÀ€ƒÁàððððàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/synergys/0000700000175000017500000000000012140644175017726 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/synergys/.gitignore0000600000175000017500000000000711376315317021720 0ustar synergysynergy/*.aps synergy-1.4.12-Source/src/cmd/synergys/CMakeLists.txt0000600000175000017500000000313612127576354022503 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src synergys.cpp ) if (WIN32) list(APPEND src CMSWindowsServerTaskBarReceiver.cpp CMSWindowsServerTaskBarReceiver.h resource.h synergys.ico synergys.rc tb_error.ico tb_idle.ico tb_run.ico tb_wait.ico ) elseif (APPLE) list(APPEND src COSXServerTaskBarReceiver.cpp) elseif (UNIX) list(APPEND src CXWindowsServerTaskBarReceiver.cpp) endif() set(inc ../../lib/arch ../../lib/base ../../lib/common ../../lib/io ../../lib/ipc ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ../../lib/server ) if (UNIX) list(APPEND inc ../../.. ) endif() if (VNC_SUPPORT) list(APPEND libs vnc_server vnc_client) endif() include_directories(${inc}) add_executable(synergys ${src}) target_link_libraries(synergys arch base client common io mt net ipc platform server synergy cryptopp ${libs}) if (CONF_CPACK) install(TARGETS synergys COMPONENT core DESTINATION bin) endif() synergy-1.4.12-Source/src/cmd/synergys/CMSWindowsServerTaskBarReceiver.cpp0000600000175000017500000002275612021261364026562 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsServerTaskBarReceiver.h" #include "CServer.h" #include "CMSWindowsClipboard.h" #include "IEventQueue.h" #include "LogOutputters.h" #include "BasicTypes.h" #include "CArch.h" #include "CArchTaskBarWindows.h" #include "resource.h" #include "CArchMiscWindows.h" #include "CMSWindowsScreen.h" // // CMSWindowsServerTaskBarReceiver // const UINT CMSWindowsServerTaskBarReceiver::s_stateToIconID[kMaxState] = { IDI_TASKBAR_NOT_RUNNING, IDI_TASKBAR_NOT_WORKING, IDI_TASKBAR_NOT_CONNECTED, IDI_TASKBAR_CONNECTED }; CMSWindowsServerTaskBarReceiver::CMSWindowsServerTaskBarReceiver( HINSTANCE appInstance, const CBufferedLogOutputter* logBuffer) : CServerTaskBarReceiver(), m_appInstance(appInstance), m_window(NULL), m_logBuffer(logBuffer) { for (UInt32 i = 0; i < kMaxState; ++i) { m_icon[i] = loadIcon(s_stateToIconID[i]); } m_menu = LoadMenu(m_appInstance, MAKEINTRESOURCE(IDR_TASKBAR)); // don't create the window yet. we'll create it on demand. this // has the side benefit of being created in the thread used for // the task bar. that's good because it means the existence of // the window won't prevent changing the main thread's desktop. // add ourself to the task bar ARCH->addReceiver(this); } void CMSWindowsServerTaskBarReceiver::cleanup() { ARCH->removeReceiver(this); for (UInt32 i = 0; i < kMaxState; ++i) { deleteIcon(m_icon[i]); } DestroyMenu(m_menu); destroyWindow(); } CMSWindowsServerTaskBarReceiver::~CMSWindowsServerTaskBarReceiver() { cleanup(); } void CMSWindowsServerTaskBarReceiver::showStatus() { // create the window createWindow(); // lock self while getting status lock(); // get the current status std::string status = getToolTip(); // get the connect clients, if any const CClients& clients = getClients(); // done getting status unlock(); // update dialog HWND child = GetDlgItem(m_window, IDC_TASKBAR_STATUS_STATUS); SendMessage(child, WM_SETTEXT, 0, (LPARAM)status.c_str()); child = GetDlgItem(m_window, IDC_TASKBAR_STATUS_CLIENTS); SendMessage(child, LB_RESETCONTENT, 0, 0); for (CClients::const_iterator index = clients.begin(); index != clients.end(); ) { const char* client = index->c_str(); if (++index == clients.end()) { SendMessage(child, LB_ADDSTRING, 0, (LPARAM)client); } else { SendMessage(child, LB_INSERTSTRING, (WPARAM)-1, (LPARAM)client); } } if (!IsWindowVisible(m_window)) { // position it by the mouse POINT cursorPos; GetCursorPos(&cursorPos); RECT windowRect; GetWindowRect(m_window, &windowRect); int x = cursorPos.x; int y = cursorPos.y; int fw = GetSystemMetrics(SM_CXDLGFRAME); int fh = GetSystemMetrics(SM_CYDLGFRAME); int ww = windowRect.right - windowRect.left; int wh = windowRect.bottom - windowRect.top; int sw = GetSystemMetrics(SM_CXFULLSCREEN); int sh = GetSystemMetrics(SM_CYFULLSCREEN); if (fw < 1) { fw = 1; } if (fh < 1) { fh = 1; } if (x + ww - fw > sw) { x -= ww - fw; } else { x -= fw; } if (x < 0) { x = 0; } if (y + wh - fh > sh) { y -= wh - fh; } else { y -= fh; } if (y < 0) { y = 0; } SetWindowPos(m_window, HWND_TOPMOST, x, y, ww, wh, SWP_SHOWWINDOW); } } void CMSWindowsServerTaskBarReceiver::runMenu(int x, int y) { // do popup menu. we need a window to pass to TrackPopupMenu(). // the SetForegroundWindow() and SendMessage() calls around // TrackPopupMenu() are to get the menu to be dismissed when // another window gets activated and are just one of those // win32 weirdnesses. createWindow(); SetForegroundWindow(m_window); HMENU menu = GetSubMenu(m_menu, 0); SetMenuDefaultItem(menu, IDC_TASKBAR_STATUS, FALSE); HMENU logLevelMenu = GetSubMenu(menu, 3); CheckMenuRadioItem(logLevelMenu, 0, 6, CLOG->getFilter() - kERROR, MF_BYPOSITION); int n = TrackPopupMenu(menu, TPM_NONOTIFY | TPM_RETURNCMD | TPM_LEFTBUTTON | TPM_RIGHTBUTTON, x, y, 0, m_window, NULL); SendMessage(m_window, WM_NULL, 0, 0); // perform the requested operation switch (n) { case IDC_TASKBAR_STATUS: showStatus(); break; case IDC_TASKBAR_LOG: copyLog(); break; case IDC_TASKBAR_SHOW_LOG: ARCH->showConsole(true); break; case IDC_RELOAD_CONFIG: EVENTQUEUE->addEvent(CEvent(getReloadConfigEvent(), IEventQueue::getSystemTarget())); break; case IDC_FORCE_RECONNECT: EVENTQUEUE->addEvent(CEvent(getForceReconnectEvent(), IEventQueue::getSystemTarget())); break; case ID_SYNERGY_RESETSERVER: EVENTQUEUE->addEvent(CEvent(getResetServerEvent(), IEventQueue::getSystemTarget())); break; case IDC_TASKBAR_LOG_LEVEL_ERROR: CLOG->setFilter(kERROR); break; case IDC_TASKBAR_LOG_LEVEL_WARNING: CLOG->setFilter(kWARNING); break; case IDC_TASKBAR_LOG_LEVEL_NOTE: CLOG->setFilter(kNOTE); break; case IDC_TASKBAR_LOG_LEVEL_INFO: CLOG->setFilter(kINFO); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG: CLOG->setFilter(kDEBUG); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG1: CLOG->setFilter(kDEBUG1); break; case IDC_TASKBAR_LOG_LEVEL_DEBUG2: CLOG->setFilter(kDEBUG2); break; case IDC_TASKBAR_QUIT: quit(); break; } } void CMSWindowsServerTaskBarReceiver::primaryAction() { showStatus(); } const IArchTaskBarReceiver::Icon CMSWindowsServerTaskBarReceiver::getIcon() const { return reinterpret_cast(m_icon[getStatus()]); } void CMSWindowsServerTaskBarReceiver::copyLog() const { if (m_logBuffer != NULL) { // collect log buffer CString data; for (CBufferedLogOutputter::const_iterator index = m_logBuffer->begin(); index != m_logBuffer->end(); ++index) { data += *index; data += "\n"; } // copy log to clipboard if (!data.empty()) { CMSWindowsClipboard clipboard(m_window); clipboard.open(0); clipboard.emptyUnowned(); clipboard.add(IClipboard::kText, data); clipboard.close(); } } } void CMSWindowsServerTaskBarReceiver::onStatusChanged() { if (IsWindowVisible(m_window)) { showStatus(); } } HICON CMSWindowsServerTaskBarReceiver::loadIcon(UINT id) { HANDLE icon = LoadImage(m_appInstance, MAKEINTRESOURCE(id), IMAGE_ICON, 0, 0, LR_DEFAULTCOLOR); return reinterpret_cast(icon); } void CMSWindowsServerTaskBarReceiver::deleteIcon(HICON icon) { if (icon != NULL) { DestroyIcon(icon); } } void CMSWindowsServerTaskBarReceiver::createWindow() { // ignore if already created if (m_window != NULL) { return; } // get the status dialog m_window = CreateDialogParam(m_appInstance, MAKEINTRESOURCE(IDD_TASKBAR_STATUS), NULL, (DLGPROC)&CMSWindowsServerTaskBarReceiver::staticDlgProc, reinterpret_cast( reinterpret_cast(this))); // window should appear on top of everything, including (especially) // the task bar. LONG_PTR style = GetWindowLongPtr(m_window, GWL_EXSTYLE); style |= WS_EX_TOOLWINDOW | WS_EX_TOPMOST; SetWindowLongPtr(m_window, GWL_EXSTYLE, style); // tell the task bar about this dialog CArchTaskBarWindows::addDialog(m_window); } void CMSWindowsServerTaskBarReceiver::destroyWindow() { if (m_window != NULL) { CArchTaskBarWindows::removeDialog(m_window); DestroyWindow(m_window); m_window = NULL; } } BOOL CMSWindowsServerTaskBarReceiver::dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM) { switch (msg) { case WM_INITDIALOG: // use default focus return TRUE; case WM_ACTIVATE: // hide when another window is activated if (LOWORD(wParam) == WA_INACTIVE) { ShowWindow(hwnd, SW_HIDE); } break; } return FALSE; } BOOL CALLBACK CMSWindowsServerTaskBarReceiver::staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { // if msg is WM_INITDIALOG, extract the CMSWindowsServerTaskBarReceiver* // and put it in the extra window data then forward the call. CMSWindowsServerTaskBarReceiver* self = NULL; if (msg == WM_INITDIALOG) { self = reinterpret_cast( reinterpret_cast(lParam)); SetWindowLongPtr(hwnd, GWLP_USERDATA, lParam); } else { // get the extra window data and forward the call LONG data = (LONG)GetWindowLongPtr(hwnd, GWLP_USERDATA); if (data != 0) { self = reinterpret_cast( reinterpret_cast(data)); } } // forward the message if (self != NULL) { return self->dlgProc(hwnd, msg, wParam, lParam); } else { return (msg == WM_INITDIALOG) ? TRUE : FALSE; } } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { CArchMiscWindows::setIcons( (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 32, 32, LR_SHARED), (HICON)LoadImage(CArchMiscWindows::instanceWin32(), MAKEINTRESOURCE(IDI_SYNERGY), IMAGE_ICON, 16, 16, LR_SHARED)); return new CMSWindowsServerTaskBarReceiver( CMSWindowsScreen::getWindowInstance(), logBuffer); } synergy-1.4.12-Source/src/cmd/synergys/CMSWindowsServerTaskBarReceiver.h0000600000175000017500000000371012021261364026214 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSSERVERTASKBARRECEIVER_H #define CMSWINDOWSSERVERTASKBARRECEIVER_H #define WIN32_LEAN_AND_MEAN #include "CServerTaskBarReceiver.h" #include class CBufferedLogOutputter; //! Implementation of CServerTaskBarReceiver for Microsoft Windows class CMSWindowsServerTaskBarReceiver : public CServerTaskBarReceiver { public: CMSWindowsServerTaskBarReceiver(HINSTANCE, const CBufferedLogOutputter*); virtual ~CMSWindowsServerTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; void cleanup(); protected: void copyLog() const; // CServerTaskBarReceiver overrides virtual void onStatusChanged(); private: HICON loadIcon(UINT); void deleteIcon(HICON); void createWindow(); void destroyWindow(); BOOL dlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); static BOOL CALLBACK staticDlgProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam); private: HINSTANCE m_appInstance; HWND m_window; HMENU m_menu; HICON m_icon[kMaxState]; const CBufferedLogOutputter* m_logBuffer; static const UINT s_stateToIconID[]; }; #endif synergy-1.4.12-Source/src/cmd/synergys/COSXServerTaskBarReceiver.cpp0000600000175000017500000000274312021261364025333 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXServerTaskBarReceiver.h" #include "CArch.h" // // COSXServerTaskBarReceiver // COSXServerTaskBarReceiver::COSXServerTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } COSXServerTaskBarReceiver::~COSXServerTaskBarReceiver() { ARCH->removeReceiver(this); } void COSXServerTaskBarReceiver::showStatus() { // do nothing } void COSXServerTaskBarReceiver::runMenu(int, int) { // do nothing } void COSXServerTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon COSXServerTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new COSXServerTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergys/COSXServerTaskBarReceiver.h0000600000175000017500000000240312021261364024771 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXSERVERTASKBARRECEIVER_H #define COSXSERVERTASKBARRECEIVER_H #include "CServerTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CServerTaskBarReceiver for OS X class COSXServerTaskBarReceiver : public CServerTaskBarReceiver { public: COSXServerTaskBarReceiver(const CBufferedLogOutputter*); virtual ~COSXServerTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; #endif synergy-1.4.12-Source/src/cmd/synergys/CXWindowsServerTaskBarReceiver.cpp0000600000175000017500000000303212021261364026434 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsServerTaskBarReceiver.h" #include "CArch.h" // // CXWindowsServerTaskBarReceiver // CXWindowsServerTaskBarReceiver::CXWindowsServerTaskBarReceiver( const CBufferedLogOutputter*) { // add ourself to the task bar ARCH->addReceiver(this); } CXWindowsServerTaskBarReceiver::~CXWindowsServerTaskBarReceiver() { ARCH->removeReceiver(this); } void CXWindowsServerTaskBarReceiver::showStatus() { // do nothing } void CXWindowsServerTaskBarReceiver::runMenu(int, int) { // do nothing } void CXWindowsServerTaskBarReceiver::primaryAction() { // do nothing } const IArchTaskBarReceiver::Icon CXWindowsServerTaskBarReceiver::getIcon() const { return NULL; } IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer) { return new CXWindowsServerTaskBarReceiver(logBuffer); } synergy-1.4.12-Source/src/cmd/synergys/CXWindowsServerTaskBarReceiver.h0000600000175000017500000000244112021261364026104 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSSERVERTASKBARRECEIVER_H #define CXWINDOWSSERVERTASKBARRECEIVER_H #include "CServerTaskBarReceiver.h" class CBufferedLogOutputter; //! Implementation of CServerTaskBarReceiver for X Windows class CXWindowsServerTaskBarReceiver : public CServerTaskBarReceiver { public: CXWindowsServerTaskBarReceiver(const CBufferedLogOutputter*); virtual ~CXWindowsServerTaskBarReceiver(); // IArchTaskBarReceiver overrides virtual void showStatus(); virtual void runMenu(int x, int y); virtual void primaryAction(); virtual const Icon getIcon() const; }; #endif synergy-1.4.12-Source/src/cmd/synergys/resource.h0000600000175000017500000000310511514202136021716 0ustar synergysynergy//{{NO_DEPENDENCIES}} // Microsoft Visual C++ generated include file. // Used by synergys.rc // #define IDS_FAILED 1 #define IDS_INIT_FAILED 2 #define IDS_UNCAUGHT_EXCEPTION 3 #define IDI_SYNERGY 101 #define IDI_TASKBAR_NOT_RUNNING 102 #define IDI_TASKBAR_NOT_WORKING 103 #define IDI_TASKBAR_NOT_CONNECTED 104 #define IDI_TASKBAR_CONNECTED 105 #define IDR_TASKBAR 107 #define IDD_TASKBAR_STATUS 108 #define IDC_TASKBAR_STATUS_STATUS 1000 #define IDC_TASKBAR_STATUS_CLIENTS 1001 #define IDC_TASKBAR_QUIT 40003 #define IDC_TASKBAR_STATUS 40004 #define IDC_TASKBAR_LOG 40005 #define IDC_RELOAD_CONFIG 40006 #define IDC_FORCE_RECONNECT 40007 #define IDC_TASKBAR_SHOW_LOG 40008 #define IDC_TASKBAR_LOG_LEVEL_ERROR 40009 #define IDC_TASKBAR_LOG_LEVEL_WARNING 40010 #define IDC_TASKBAR_LOG_LEVEL_NOTE 40011 #define IDC_TASKBAR_LOG_LEVEL_INFO 40012 #define IDC_TASKBAR_LOG_LEVEL_DEBUG 40013 #define IDC_TASKBAR_LOG_LEVEL_DEBUG1 40014 #define IDC_TASKBAR_LOG_LEVEL_DEBUG2 40015 #define ID_SYNERGY_RELOADSYSTEM 40016 #define ID_SYNERGY_RESETSERVER 40017 // Next default values for new objects // #ifdef APSTUDIO_INVOKED #ifndef APSTUDIO_READONLY_SYMBOLS #define _APS_NEXT_RESOURCE_VALUE 109 #define _APS_NEXT_COMMAND_VALUE 40018 #define _APS_NEXT_CONTROL_VALUE 1003 #define _APS_NEXT_SYMED_VALUE 101 #endif #endif synergy-1.4.12-Source/src/cmd/synergys/synergys.cpp0000600000175000017500000000251512120644363022317 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CServerApp.h" #include "CLog.h" #include "CArch.h" #include "CEventQueue.h" #if WINAPI_MSWINDOWS #include "CMSWindowsServerTaskBarReceiver.h" #elif WINAPI_XWINDOWS #include "CXWindowsServerTaskBarReceiver.h" #elif WINAPI_CARBON #include "COSXServerTaskBarReceiver.h" #else #error Platform not supported. #endif int main(int argc, char** argv) { #if SYSAPI_WIN32 // record window instance for tray icon, etc CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; CEventQueue events; CServerApp app(createTaskBarReceiver); return app.run(argc, argv); } synergy-1.4.12-Source/src/cmd/synergys/synergys.ico0000600000175000017500000106227611267632744022335 0ustar synergysynergy ( V00 ¨%~   ¨&F ˆ ÎV hV`( ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ñïï çêî2ëîòìïóëîòíïðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííííííííééé(ãááOãááOãááOßÝÝcÚØØyÖÔÔ€ÖÔÔ€ÖÔÔÿÍÐÔÿÍÐÔÿÎÑÕÿÐÓ×ÿÒÔÕƒÒÔÕƒÕÕÕ€×××~ßßßYâââEäæç;æèé2äçë;æéí2êíòîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëæææ2àààOÔÖÖ€ÊÐÏÿÃÎÌÿ¿ÊÈÿµÂÀÿ²¿½ÿ­º¸ÿ«³²ÿ¦®­ÿ¦«ªÿ¥ª©ÿ¤©¨ÿ¤§ÿš¡¤ÿ›££ÿ£§¨ÿ¥ª¨ÿ©ª¨ÿ¬­©ÿ±²®ÿ³²®ÿ¹¸´ÿ¿À¼ÿÄÅÁÿÅÈÆÿÌÏÍÿÕ××ÿÜÞÞcàáßYæçå;îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ çéé2ÞààYÕ××€ÕÐщÊÅÆʾ¾¾ÿ···ÿ©««ÿœ¢¡ÿ’›ÿŽ™—ÿ‰–”ÿ‚ÿz‡…ÿz‚ÿz‚ÿ|€ÿz~ÿv{zÿsz}ÿry|ÿrzzÿw{|ÿx}{ÿ}~|ÿ‚~ÿ„…ÿ‰ˆ„ÿŒˆÿ‘’Žÿ–—“ÿ™œšÿ £¡ÿ©««ÿ°²²ÿÀÁ¿ÿÈÉÇÿÑÒЉÙÚØyÝÞÜcãäâEìíëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêììãååEÕÚÙ€ÊÏÎÿ¿ÅÄÿ´º¹ÿ¶®¯ÿ¨ ¡ÿ—••ÿŠŒŒÿw‚€ÿjxvÿ_tqÿXqmÿId`ÿJeaÿNgcÿUjgÿZmjÿ_mkÿ]kiÿ]hfÿgroÿmtqÿkrmÿgkfÿejaÿlmdÿlnbÿmk`ÿhgYÿgfXÿgeZÿki^ÿsqgÿ}{qÿ†…{ÿŒ‹ÿ‘’Žÿœ™ÿ¬­©ÿº»·ÿÂÿÿÊËÇÿØÙ×~åæä;éêè(îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÜÜÜcÏÑÑÂÄÄÿ¯´³ÿŸ¤£ÿŽ”“ÿ‡†ÿ{stÿumnÿljjÿgiiÿ]hfÿZhfÿWliÿTmiÿb}yÿoŠ†ÿš–ÿŽ£ ÿ“¦£ÿ—¥£ÿ—¥£ÿœ§¥ÿ¦±®ÿ¯¶³ÿ¬³®ÿ¥©¤ÿ¡¦ÿ¨© ÿ¦¨œÿ¤¢—ÿœ›ÿ‘‚ÿtÿushÿomcÿlj`ÿih^ÿgf\ÿfgcÿklhÿvwsÿ„…ÿ‘ÿ›œ˜ÿ«¬ªÿº»¹ÿÊËÉÿÔÕÓƒãäâEîïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëßßßYÖÖÖ~ÂÂÂܳ³³ÿž£¢ÿ’‘ÿ{€ÿoutÿckjÿYa`ÿFjdÿEvnÿUˆ€ÿ\˜Žÿ]¡–ÿ`¬ ÿe·ªÿcº¬ÿjŶÿtÏÀÿ‚ÚÌÿ‹àÒÿ‘áÔÿ•áÕÿšäØÿ¥çÜÿÛâÝÿáæÝÿÝåÚÿÚÞÓÿØÛÌÿÛÚÌÿÚÚÈÿÙÕÃÿÖѼÿÍȳÿÁ»¨ÿ·±žÿ°ª—ÿª¤‘ÿ¡Šÿœ—ˆÿ‚„~ÿqsmÿ`b\ÿ]_Yÿcd`ÿnokÿ|}yÿ‰Š†ÿžŸ›ÿ«¬¨ÿ¾¿½ÿÏÐÎÝÞÜcèéç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÞÜÜcÍËË¥¶¶¶ÿ¨¨¨ÿ———ÿ………ÿotsÿchgÿagfÿkqpÿu}|ÿy€ÿq•ÿz«£ÿ”Ç¿ÿžÚÐÿœàÕÿšæÚÿ™ëÞÿ“êÜÿëÜÿèÙÿŒäÖÿâÔÿ“ãÖÿšæÚÿ êÞÿªìáÿÞåàÿáæÝÿÝåÚÿÝáÖÿÚÝÎÿÙØÊÿÖÖÄÿÙÕÃÿÝØÃÿÜ×ÂÿÜÖÃÿàÚÇÿãÝÊÿâÜÉÿÛ×ÄÿÖÑÂÿÂľÿ§©£ÿŒŽˆÿ€‚|ÿ{|xÿstpÿjkgÿefbÿmnjÿz{wÿŽÿ¡¢ ÿ³´²ÿÅÆÄÊ×ØÖ~âãáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòæä;êáÞYÊÁ¾ÿ¿··ÿ¯«ªÿŽÿy|zÿdolÿWniÿ@ibÿ5jaÿCˆ}ÿf¸«ÿÜÍÿ~è×ÿoîÕÿmìÓÿlèÐÿjåÑÿ^åÏÿVäÑÿMäÐÿIäÏÿIäÏÿDäÎÿBæÍÿCçÎÿPéÐÿlçÓÿ‰éØÿ¨êÞÿÈë×ÿØçÒÿÚæÒÿãåÏÿèáÈÿëÛ·ÿçÕ¦ÿæÔ™ÿáÓ‹ÿàÓ‡ÿáÖ†ÿã؈ÿåÕÿçÔ—ÿëÒ ÿîÕ£ÿèà¥ÿìä©ÿêß­ÿçÙ¯ÿãÔ³ÿÑĪÿ§™‡ÿzndÿrhaÿngdÿokjÿxywÿ‰ŒŠÿ˜Ÿœÿª´®ÿ»Å¿ÿÓÓÓƒãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíçÛÙyÌÀ¾ÿÄ»¸ÿµ¬©ÿ–ŽŽÿrnmÿ][ZÿUXVÿ\gdÿxŠÿ¹²ÿ™ÎÅÿ‘ÖËÿ‹ÝÐÿ„áÒÿxâÑÿhçÎÿfåÌÿfâÊÿdßËÿZáËÿRàÍÿIàÌÿFáÌÿFáÌÿAáËÿ?ãÊÿAåÌÿMæÍÿiäÐÿ†æÕÿ¥çÛÿÆéÕÿ×æÑÿØäÐÿàâÌÿäÝÄÿåÕ±ÿáÏ ÿàΓÿÜΆÿÛ΂ÿÛЀÿÜÑÿÞΉÿÞËŽÿâÉ—ÿåÌšÿÔÌ‘ÿÝÕšÿåÚ¨ÿæØ®ÿãÔ³ÿÝжÿ×É·ÿÌÀ¶ÿ¿µ®ÿ§ ÿxtsÿUVTÿZ][ÿjqnÿ}‡ÿ“—ÿ³³³ÿÎÎÎÒÓщßàÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïôò îïíèààOÖÎηµ´ÿž¥¢ÿ~‰†ÿXojÿ8ZTÿFumÿcŸ•ÿbªžÿg»¯ÿrÓÅÿ|éÙÿuïÝÿdêÖÿRåÏÿMâÎÿBãÍÿ2çËÿ1æÊÿ4âÊÿ4âÊÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿçÛÿÅêÖÿÖéÐÿ×çÏÿßåÆÿãÞ·ÿãסÿáÒÿàÓ}ÿÝÔmÿÛÖcÿÚ×]ÿÚ×]ÿÜÕ`ÿÜÔcÿßÓgÿáÒnÿØÑtÿÙÏ{ÿÚÓ~ÿÞÕ…ÿàØ‹ÿäÙ•ÿêà¤ÿðè³ÿçÞ³ÿßÖ´ÿÄ» ÿ¬¥’ÿŸ—Šÿ{upÿc\Yÿjefÿÿ   ÿ¯®°ÿÌËÍ¥ÙÛÜyæèé2îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìõòãèæEÕÖÔÿû»ÿª¢¢ÿ‰‡†ÿszwÿZebÿczuÿc…ÿu¤œÿ—ÓÉÿ¢êÞÿ–êÞÿ„å×ÿrßÏÿaÛÉÿWÝÉÿNáËÿKàÌÿ@áËÿ0åÉÿ/äÈÿ3áÉÿ3áÉÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿœæÚÿÅêÖÿ×êÑÿØèÐÿàæÇÿâݶÿáÕŸÿàÑŒÿßÒ|ÿÜÓlÿÚÕbÿØÕ[ÿØÕ[ÿÚÓ^ÿÙÑ`ÿÛÏcÿÝÎjÿÚÓvÿÓÉuÿÍÆqÿÑÈxÿÓË~ÿÔÉ…ÿÓÉÿÒÊ•ÿÖÍ¢ÿßÖ´ÿåÜÁÿèáÎÿÜÔÇÿ«¥ ÿ‚{xÿxstÿlllÿdddÿ|{}ÿ›šœÿ¨ª«ÿÊÌÍÿÞàáYäæç;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßçæYÏ×Ö»ÃÂÿ¤¬«ÿŒ‘ÿtywÿKmgÿ?vmÿ=xpÿnº¯ÿŠéÛÿ€ðßÿjêÙÿTäÑÿGâÍÿ:âËÿ5âÌÿ/åÍÿ.æÎÿ)åÌÿ"ãÉÿ áÇÿ#åÎÿ"äÍÿ(ãÍÿ(ãÍÿ"ãÎÿ"ãÎÿ"ãÎÿ%âÍÿ*áÌÿ1àÌÿ0âËÿ9ãÍÿFäÌÿbâÏÿ|åÒÿ™äÖÿ»åÚÿÑáÚÿÒãÕÿÝáÈÿàÚµÿâÑžÿáψÿäÐyÿåÒkÿâÔ\ÿàÕUÿàÕUÿáÕWÿàÓYÿàÑ]ÿáÐaÿÚÍ_ÿÜÏaÿÝÐbÿÝÐbÿÜÑbÿÝÒcÿÚÒgÿÛÐnÿØÍqÿÚÏÿàÔŽÿã×ÿêܬÿòß¼ÿëÙºÿÛÆ°ÿš—‰ÿe`Wÿlj`ÿyupÿ‰‡†ÿ¥¢¤ÿ²´µÿÊÊÐ¥ÛÛánëëñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîììàââOÍÕÔš¶¾½ÿ•œÿx€ÿinlÿ]b`ÿnŠÿ’ÉÀÿšÕÍÿÜÑÿàÒÿnÞÍÿ_ßÎÿLÜÉÿAÜÇÿ7ßÈÿ4áËÿ,âÊÿ&ÞÆÿ!ÝÄÿßÅÿ áÇÿ"äÍÿ!ãÌÿ&áËÿ&áËÿ áÌÿ áÌÿàËÿ"ßÊÿ(ßÊÿ/ÞÊÿ-ßÈÿ6àÊÿCáÉÿ_ßÌÿyâÏÿ—âÔÿ¹ãØÿÎÞ×ÿÎßÑÿÚÞÅÿÞسÿáÐÿß͆ÿâÎwÿâÏhÿÞÐXÿÜÑQÿÝÒRÿÞÒTÿÞÑWÿÞÏ[ÿßÎ_ÿÙÌ^ÿÝÐbÿÞÑcÿÛÎ`ÿÚÏ`ÿÞÓdÿÜÔiÿÛÐnÿÜÑuÿÓÈxÿÔÈ‚ÿÑÅ‹ÿÐÂ’ÿÞ˨ÿæÔµÿÜDZÿÎ˽ÿþµÿ®¬¢ÿea\ÿZXWÿ|y{ÿÿ¨¨®ÿÂÂÈÿÙÙßyíîòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóèê(åÚÜnÒÇÉÿ¯­­ÿ€‹‰ÿVmiÿJnhÿh‘Šÿxµ«ÿrÔÆÿuè×ÿkâÓÿXÜËÿNáÍÿ>ÞÈÿ9åÍÿ0äËÿ(âÊÿ(âÊÿ'áÉÿ&àÈÿ)áÉÿ*âÊÿ+âÍÿ/âÍÿ-ßÈÿ0ÝÇÿ2ÛÈÿ2ÛÈÿ*ÛÇÿ*ÛÇÿ(ÚÃÿ'ÙÂÿ0ÜÄÿ2ÚÃÿ1ÝÁÿ6ÝÂÿ?ßÁÿWÞÄÿmâÉÿáÎÿ³âÒÿÆÜÐÿÈÜÉÿÓÛ½ÿÚÔ¯ÿÝÌ™ÿÜÆ„ÿâÅtÿáÅgÿÞÅ_ÿÜÄZÿÝÅ[ÿßÆ`ÿßÄbÿßÁhÿàÂiÿãÍdÿâÍ`ÿàË^ÿÞÊZÿÞÍXÿáÐ[ÿàÐXÿÞÎVÿÝÑ[ÿÚË]ÿÞÐfÿåÔsÿßÐtÿßÍzÿæÖƒÿîÚ“ÿãÙ©ÿáسÿáسÿļŸÿ¢œ…ÿ{vgÿge[ÿ}|ÿ›šœÿ¸¶¼ÿÑÑ׉ááçOðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéãäEØÍϚ·¹ÿŸ”–ÿywwÿfqoÿg~zÿy—ÿ›Ä½ÿ¤á×ÿ€âÔÿmàÏÿgÞÏÿYÝÌÿPãÏÿ:ÚÄÿ4àÈÿ)ÝÄÿ%ßÇÿ'áÉÿ(âÊÿ&àÈÿ'ßÇÿ'ßÇÿ&ÝÈÿ(ÛÆÿ*ÜÅÿ.ÛÅÿ0ÙÆÿ/ØÅÿ(ÙÅÿ'ØÄÿ&ØÁÿ$Ö¿ÿ+׿ÿ-Õ¾ÿ+×»ÿ1ؽÿ:Ú¼ÿRÙ¿ÿhÝÄÿŠÜÉÿ¯ÞÎÿÁ×ËÿÂÖÃÿÍÕ·ÿÔΩÿ×Æ“ÿÕ¿}ÿÚ½lÿÞÂdÿÚÁ[ÿØÀVÿÙÁWÿÛÂ\ÿÜÁ_ÿܾeÿܾeÿÜÆ]ÿÞÉ\ÿàË^ÿáÍ]ÿßÎYÿÝÌWÿÞÎVÿáÑYÿÛÏYÿßÐbÿÛÍcÿÙÈgÿÙÊnÿÙÇtÿ×ÇtÿÛÇ€ÿ×ÍÿÖͨÿØϪÿæÞÁÿÕϸÿ·²£ÿ‹ÿljiÿmlnÿ‹‘ÿ¬¬²ÿÅÅËÿàßáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììäää;ÍÍÍš§§§ÿ‰Žÿ_qpÿOplÿa—ÿvĹÿ}ßÑÿzç×ÿdçÓÿDáÌÿ<âËÿ7ßÈÿ3ßÇÿ,ßÆÿ)àÆÿ'àÆÿ&ßÅÿ'àÆÿ+ßÆÿ+ßÆÿ-ÝÅÿ,ÜÄÿ.ÚÂÿ-ÙÁÿ,ØÀÿ&Ú½ÿ%Ù¼ÿ&Ö¸ÿ&Ö¸ÿظÿ×·ÿÕµÿÒ³ÿ$Юÿ%ѯÿ%Ô¯ÿ&Õ°ÿ1ײÿDÙ·ÿTÞ¼ÿ|ÛÀÿ¦Ú¼ÿ»Ù¶ÿ¾Ù²ÿÈÖ¦ÿÎÏ—ÿÑŃÿÒ¾qÿÓ»cÿÓ¼YÿÓºTÿѸPÿѸPÿÓºTÿÔ¹WÿÖ·ZÿÕ¶YÿÔ¾UÿÖÀWÿÙÃZÿÛÅ\ÿÝÅ[ÿÞÆ\ÿÞÇZÿßÈ[ÿßË\ÿßË\ÿÞË\ÿßÌ]ÿÞÍ^ÿßÎ_ÿÝÏ_ÿÜÎ^ÿÙÈqÿ×Ç{ÿàÒ†ÿäÕ–ÿäÙ ÿíâ¶ÿØÏ­ÿ©¡Šÿ…€qÿtqiÿ€~}ÿ¢¢¨ÿ¼¿ÄÿÏÐÚäåï;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ ÖÖÖ~ÂÂÂÿ©©©ÿƒƒƒÿglmÿp‚ÿ‰ª¦ÿ—ÍÆÿÛÐÿzÜÎÿnÛËÿZÝÉÿAÞÉÿ9ßÈÿ6ÞÇÿ2ÞÆÿ,ßÆÿ)àÆÿ'àÆÿ'àÆÿ%ÞÄÿ)ÝÄÿ(ÜÃÿ+ÛÃÿ)ÙÁÿ+׿ÿ*Ö¾ÿ)Õ½ÿ!Õ¸ÿÓ¶ÿ"Ò´ÿ"Ò´ÿÔ´ÿÓ³ÿѱÿÍ®ÿ!Í«ÿ"άÿ Ϫÿ Ϫÿ)Ϫÿ;ЮÿKÕ³ÿsÒ·ÿ Ô¶ÿ´Ò¯ÿµÐ©ÿ¾ÌœÿÃÄŒÿȼzÿʶiÿÌ´\ÿ̵RÿεOÿÍ´LÿÍ´LÿεOÿÏ´RÿѲUÿÒ³VÿϹPÿкQÿÒ¼SÿÓ½TÿÖ¾TÿØÀVÿÛÄWÿÝÆYÿÜÈYÿÜÈYÿÜÉZÿÝÊ[ÿÜË\ÿÝÌ]ÿÛÍ]ÿÛÍ]ÿØÇpÿÓÃwÿØÊ~ÿØÉŠÿÖË’ÿáÖªÿãÚ¸ÿÔ̵ÿ¹´¥ÿŽ‹ƒÿomlÿuu{ÿ“–›ÿ¶·ÁÿÑÒ܉ßàêYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçè2ÛÕրĿÀÿ–––ÿhvuÿTwsÿV‘‰ÿe¹­ÿtßÏÿgìØÿVéÓÿ?ãÊÿ5ÞÄÿ-ÞÃÿ(âÅÿ'áÄÿ%áÄÿ$àÃÿ$àÃÿ$àÃÿ#àÁÿ'ßÁÿ%Û¼ÿ(Û¼ÿ'Ú¹ÿ&Ù¸ÿ%Ø·ÿ#ÖµÿÕ³ÿÔ²ÿÔ¬ÿѪÿЩÿϨÿЧÿÎ¥ÿË£ÿ!È¡ÿ)ÄŸÿ.Ä ÿ-ÆŸÿ2Æ ÿ9Ç¢ÿLʧÿ`άÿ}Í°ÿŸÎ´ÿ³É°ÿ²È«ÿ»Äœÿ¼¼ŒÿÀ´zÿ¾­jÿÁª_ÿ¼¦TÿÀ¨Nÿ¾¨Iÿ¾¨Iÿ¾¨HÿÄ«KÿÉ­Nÿ˯PÿÉ´KÿʵLÿ̶Mÿ͵QÿζRÿѸXÿÖº[ÿؼ]ÿÛ¿`ÿÜÀaÿÛÂ`ÿÜÅ_ÿÜÈ]ÿÝÉ^ÿÞÊ]ÿÞÊ]ÿàÌ_ÿÞÉ`ÿßÌeÿÞÌmÿÛÊsÿÜÌ€ÿãÕ“ÿêܧÿäÛ¯ÿÏÆ¥ÿ¢ž†ÿ{wlÿwtpÿ‘”ÿµ·¿ÿÏÑÙàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÓÔƒº´µÿŸš›ÿwwwÿftsÿwš–ÿ’ÍÅÿ‹ßÓÿwâÒÿVÛÇÿHÛÅÿ<àÇÿ6ßÅÿ.ßÄÿ(âÅÿ'áÄÿ$àÃÿ#ßÂÿ"ÞÁÿ!ÝÀÿܽÿ!Ù»ÿ!׸ÿ$׸ÿ#Öµÿ!Ô³ÿÒ±ÿЯÿÏ­ÿÍ«ÿΦÿÌ¥ÿÊ£ÿÈ¡ÿÈŸÿÇžÿÅÿÃœÿ&Áœÿ,žÿ.Ç ÿ7Ë¥ÿAϪÿVÔ±ÿkÙ·ÿˆØ»ÿ¨×½ÿ¾Ô»ÿ¾Ô·ÿÉÒªÿËË›ÿΈÿʹvÿË´iÿÁ«YÿÁ©Oÿ¼¦Gÿ¸¢Cÿ·¡Aÿ¼£CÿÁ¥Fÿ¦GÿîEÿįFÿDZHÿɱMÿ˳Oÿ̳SÿдUÿдUÿÔ¸YÿÖº[ÿÕ¼Zÿ×ÀZÿØÄYÿÙÅZÿÛÇZÿÛÇZÿÞÊ]ÿÝÈ_ÿÚÇ`ÿÚÈiÿÚÉrÿÒÂvÿÏÁÿÖÈ“ÿÕÌ ÿâÙ¸ÿÕѹÿ«§œÿ|xÿmlpÿ„†Žÿ­¯·ÿÉÉÉ°ãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêèè(ÐÎΰµ´ÿ…–“ÿ]xuÿXˆ‚ÿs¸®ÿvÕÇÿmãÑÿ\ëÕÿFäÌÿ.ÝÂÿ+ßÆÿ(áÇÿ$ßÅÿ$ßÅÿ+áÃÿ*àÂÿ&ÞÀÿ%Ý¿ÿ#ܼÿ!Úºÿ ×µÿ!Ô³ÿ"Ô¯ÿ$Ó®ÿ%Ò¬ÿ"Ï©ÿΦÿË£ÿÊŸÿÉžÿ Řÿ&×ÿ'–ÿ&Á•ÿ'–ÿ)Ęÿ1›ÿ=ÁœÿOÅ¢ÿWȦÿ]έÿfÓ³ÿpعÿ…ÜÀÿ›ßÆÿ±àÊÿÀàÕÿÏÞÖÿÓàÒÿÛÝÉÿÜؼÿÞÏ®ÿÙÇžÿÚÓÿι‚ÿ˳yÿÀ«mÿ½¥cÿ¼£]ÿ¼¡Wÿ¸Sÿ¹›Nÿ¼¢Hÿ¼¢Hÿ¾£IÿÀ¥KÿèNÿŪPÿÉ«RÿË­TÿË®SÿÍ°UÿδVÿжXÿÒ¹WÿÔ»YÿÖ¿[ÿ×À\ÿÛÈYÿÜÉZÿ×ÄUÿÙÅZÿßÍbÿÞÉfÿÙÇhÿÞÌyÿØÊ~ÿßБÿåÚ¦ÿâØ°ÿ¾¸›ÿ‹„sÿwteÿ‡…}ÿªªªÿÇÇǽáááOïïï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿååå;ÖÔÔ€°®®ÿ†‹Šÿgxuÿi„ÿˆ¸²ÿœá×ÿ„ãÕÿeÛÉÿOÞÈÿ?ÝÅÿ0ßÄÿ,àÇÿ'àÆÿ!ÜÂÿ!ÜÂÿ&ܾÿ%Û½ÿ"Ú¼ÿ غÿظÿÕµÿÓ±ÿЯÿϪÿͨÿË¥ÿÉ£ÿÇŸÿÅÿÅšÿÄ™ÿÁ”ÿ$Á•ÿ'–ÿ)Ęÿ-Èœÿ1Ì ÿ<ͦÿJΩÿ[Ñ®ÿbÓ±ÿgØ·ÿoܼÿxàÁÿŠáÅÿŸãÊÿ´ãÍÿÄäÙÿÒáÙÿÕâÔÿÝßËÿàÜÀÿåÖµÿäÒ©ÿçРÿßÊ“ÿÝÅ‹ÿÔ¿ÿÓ»yÿÒ¹sÿÏ´jÿŪ`ÿ¤Wÿ¼¢Hÿº Fÿ¸Cÿ·œBÿ¹žDÿ½¢HÿÃ¥LÿƨOÿŨMÿǪOÿɯQÿ˱SÿÍ´RÿзUÿÒ»WÿÔ½YÿÕÂSÿÛÈYÿÙÆWÿ×ÃXÿÚÈ]ÿÛÆcÿ×ÅfÿÚÈuÿÖÈ|ÿÓÄ…ÿÔÉ•ÿàÖ®ÿßÙ¼ÿü«ÿ–“„ÿwumÿ{{{ÿ   ÿËËËÿãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÎÎί±±ÿ‘““ÿa|xÿZ†ÿp¿´ÿyâÓÿhæÓÿNáËÿBàÈÿ5ÛÂÿ1ÙÂÿ/ÛÃÿ+ÛÃÿ*ÚÂÿ(ÛÂÿ%Ø¿ÿ*Öºÿ)Õ¹ÿ$Ô¶ÿ"Ò´ÿ!Ò±ÿЯÿΩÿ ̨ÿ É¢ÿ!Æ ÿ#Å›ÿ#Á˜ÿ%À”ÿ%À”ÿ%À“ÿ%À“ÿ4Á–ÿ:˜ÿ?Å›ÿBÈžÿEÍ£ÿIѧÿRÓ¬ÿ`Ô¯ÿpÓ³ÿrÕµÿu×¹ÿyÛ½ÿ€ÝÂÿÞÅÿ¤ßËÿµßÎÿÅâÒÿÒßÑÿÔßËÿÙÜÆÿÝÙ½ÿßÔ¶ÿàÏ®ÿàͨÿÙÆ ÿÚÄšÿ×Á—ÿÙÁ“ÿÙÀŽÿؼ†ÿÓ´}ÿЮsÿǧfÿÅ¢^ÿ¾œVÿ¹™Nÿ¹˜Iÿ»›Hÿ½ŸHÿ¿¢GÿÀ¤Fÿ§EÿƬHÿÈ®JÿÈ°LÿʲNÿ͵QÿиTÿ̼RÿÒÂXÿÔÅWÿ×ÃVÿÚÆWÿÙÅVÿ×ÃVÿÙÄ[ÿÖÃbÿÚÆqÿ×Æ}ÿÒŇÿÛОÿàÙ²ÿËÞÿž™„ÿuuuÿ€€€ÿ£££ÿÊÊÊ¥ÞÞÞYîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììÒÒÒƒ³³³ÿ‹ÿsuuÿn‰…ÿ¹ÿ‘àÕÿvßÐÿ\ÚÇÿHÛÅÿ=ÛÃÿ3ÙÀÿ5ÝÆÿ3ßÇÿ(ØÀÿ'׿ÿ'ÚÁÿ$×¾ÿ(Ô¸ÿ'Ó·ÿ!ѳÿϱÿέÿÌ«ÿÊ¥ÿȤÿÅžÿÂœÿÀ–ÿ½”ÿ"½‘ÿ"½‘ÿ#¾‘ÿ$¿’ÿ7Ä™ÿ=Å›ÿCÉŸÿFÌ¢ÿGÏ¥ÿJÒ¨ÿRÓ¬ÿ^Ò­ÿpÓ³ÿrÕµÿtÖ¸ÿwÙ»ÿÜÁÿÞÅÿ¥àÌÿ·áÐÿÅâÒÿÔáÓÿ×âÎÿÝàÊÿàÜÀÿàÕ·ÿßέÿÞ˦ÿ×ÄžÿÙÙÿ×Á—ÿØÀ’ÿØ¿ÿÙ½‡ÿع‚ÿض{ÿ×·vÿÔ±mÿË©cÿ¢Wÿ¾Nÿ»›Hÿ¹›Dÿ·š?ÿºž@ÿ½¢@ÿÀ¦Bÿ¨DÿªFÿëGÿÆ®JÿɱMÿɹOÿʺPÿ˼NÿÒ¾QÿØÄUÿÚÆWÿÚÆYÿÚÅ\ÿÓÀ_ÿÔÀkÿÔÃzÿÍÀ‚ÿËÀŽÿÕΧÿÞÖ±ÿÏʵÿžžžÿtttÿwwwÿ§§§ÿËËËÿàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîüú áîìOÑÖÕ‰¹®°ÿ–‹ÿJ}uÿIžÿr;ÿzêØÿ_åÑÿ>ÚÂÿ1ÚÀÿ*ÛÀÿ'ÜÀÿ'ÜÀÿ(Ü¿ÿ'Û¾ÿ'Ý»ÿ$Ú¸ÿ!ضÿÖ´ÿ$Õªÿ&Ò¨ÿ"Шÿ#Ì¥ÿ É¢ÿ ÅŸÿÚÿÀ˜ÿ!Á—ÿ!½”ÿ¼Žÿ ¹Œÿ$¼‹ÿ'¿Žÿ+Ä‘ÿ.Ç”ÿBŤÿKƦÿPÈ©ÿUÊ«ÿ[Ë©ÿZʨÿXÊ¥ÿSʤÿPÌ¢ÿOË¡ÿPÌ ÿVÏ£ÿaÑ¢ÿiУÿpÕ¨ÿƒ×­ÿœÖ³ÿ¯Ô´ÿ´Ó¬ÿÂÍ¥ÿÉÆ™ÿÒ»ÿÒ¶€ÿѳzÿϱvÿΰuÿÌ´xÿи|ÿηÿÏ·ƒÿѶƒÿβƒÿѱˆÿ̬ƒÿʬ{ÿŪqÿ½£aÿ¶ŸTÿ²Lÿ¯—Cÿ®˜@ÿ³˜Aÿ¶›Dÿ»Fÿ½ŸHÿÅ¢LÿɤOÿ˦QÿÅ®HÿȱKÿÌ´PÿÏ·SÿѹUÿÔ¼Xÿ×ÁXÿÚÄ[ÿÚÆ[ÿÚÆ[ÿØÇ`ÿÚÆgÿÚÆoÿàÉ{ÿìÕŠÿøÛ¢ÿÜÈ·ÿ±¨šÿŒ…tÿ||nÿŸ¨›ÿÈÓÉ°ÕâÚ€êõòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöô(ÞìêYÐÝÛÿ¶»ºÿœ‘“ÿ…z|ÿiœ”ÿsȺÿ‰äÕÿnÞÌÿNÔÀÿ@ÜÄÿ6ßÅÿ%Ö»ÿ%Ú¾ÿ%Ú¾ÿ$Ø»ÿ#׺ÿ!×µÿÕ³ÿѯÿÏ­ÿΣÿË¡ÿÉ¡ÿÅžÿÃœÿ¿™ÿ¾•ÿ»“ÿºÿ¸ÿºŒÿ!ºÿ'¿Žÿ+Ã’ÿ/È•ÿ2˘ÿAÄ£ÿG¢ÿHÀ¡ÿKÀ¡ÿQÁŸÿPÀžÿM¿šÿG¾˜ÿ@¼’ÿ=¹ÿ:¶Šÿ<µ‰ÿF¶‡ÿP·ŠÿY¾‘ÿn˜ÿ†Àÿ—¼œÿ›º“ÿ§²Šÿ«¨{ÿ²›mÿ±•_ÿ¯‘Xÿ°’Wÿ®Uÿ­•Yÿ²š^ÿ´eÿ½¥qÿǬyÿȬ}ÿƦ}ÿƦ}ÿʬ{ÿË°wÿƬjÿÀ©^ÿº¥Tÿ¶žJÿ®˜@ÿ²—@ÿ²—@ÿ¶˜Aÿ¸šCÿ¿œFÿÂHÿÄŸJÿÀ©CÿìFÿǯKÿʲNÿÌ´PÿÏ·SÿÒ¼SÿÔ¾UÿÕÁVÿÖÂWÿÔÃ\ÿÕÁbÿÔÀiÿØÁsÿßÈ}ÿèË’ÿáͼÿÓʼÿ±ª™ÿ……wÿ}†yÿ¨žÿÅÒÊÿÜçäcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëÛÖ×ÿ¼ÄÃÿ‚“ÿbyuÿl˜‘ÿq̽ÿoãÐÿoèÔÿQÚÄÿ;Ô»ÿ1Û¿ÿ*ÞÁÿ'Û¾ÿ$Ú»ÿ#Ùºÿ$׶ÿ%Ô³ÿ#Ò°ÿ Ï­ÿͨÿ˦ÿ!ÉžÿÆ›ÿÄ–ÿ”ÿÀ’ÿ¾ÿ¼ÿ»ŒÿºŠÿº‹ÿ$¼‹ÿ-½ÿ3¿ÿ<À’ÿ@“ÿAÔÿ9Åÿ4À‹ÿ/»†ÿ,¸ƒÿ*¸ƒÿ&¸‚ÿ·€ÿµ~ÿ´|ÿ´|ÿ´~ÿ·ÿ(¸„ÿ7ºˆÿ?¿ŽÿUÁ“ÿ~Ñÿ–¾Žÿ—»‡ÿž²}ÿ£§lÿ¦›_ÿ¨’PÿªHÿ¨‹@ÿ§‡<ÿ¨ˆ<ÿ­‰=ÿ­‰=ÿµBÿ¿’HÿÀ’Kÿ»™Sÿ¾œVÿÇ¥_ÿÍ«eÿ˨dÿɦbÿÉ£bÿÄž]ÿ¾˜Wÿ»•Tÿ¶’Lÿ´‘Gÿ´”Aÿ¶˜Aÿ¸œ>ÿºž@ÿ¾¡FÿÁ¤IÿŨMÿÈ«PÿÊ­Rÿ̯TÿÏ´RÿѸRÿÓ½TÿÔ¾UÿÓÀWÿÕÁ\ÿÓ¿`ÿÔ¿dÿÖÂjÿÛÃwÿÝÌ”ÿíݹÿÝѯÿ³«”ÿ„„tÿ€|ÿ®°°ÿÎÐÐéëë(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåàáOËÆÇÿ”œ›ÿevsÿsŠ†ÿ›ÇÀÿ„ßÐÿkßÌÿ]ÖÂÿLÕ¿ÿAÚÁÿ.ؼÿ!Õ¸ÿ'Û¾ÿ"عÿ Ö·ÿ Ó²ÿ!ЯÿάÿË©ÿÊ¥ÿÈ£ÿÅšÿØÿÁ“ÿ¾ÿ½ÿ¼Žÿ»Œÿº‹ÿ»‹ÿ ¼ÿ&¾ÿ.¾Žÿ1½Žÿ7»ÿ7¹Šÿ7¹Šÿ-¹„ÿ*¶ÿ&²}ÿ#¯zÿ ®yÿ°zÿ²{ÿ²{ÿµ}ÿ·ÿ»…ÿ#¿‰ÿ1ÁÿAÄ’ÿHÈ—ÿ]É›ÿ‡ÌšÿŸÇ—ÿ¡Å‘ÿ©½ˆÿ¯³xÿ²§kÿ³[ÿµ˜Sÿ­Eÿ­Bÿ­Aÿ°Œ@ÿ«‡;ÿ¬„9ÿ°ƒ9ÿ¬~7ÿ©‡Aÿ«‰Cÿ²Jÿ¸–Pÿº—Sÿ¿œXÿÆ _ÿÆ _ÿÅŸ^ÿÂœ[ÿ¼˜Rÿ¶“Iÿ²’?ÿ²”=ÿ´˜:ÿ·›=ÿºBÿ¼ŸDÿ¿¢GÿÂ¥JÿŨMÿÈ«PÿË°NÿÍ´NÿϹPÿÑ»RÿнTÿÓ¿ZÿÒ¾_ÿÓ¾cÿÓ¿gÿÕ½qÿÌ»ƒÿØȤÿßÓ±ÿÖηÿ©©™ÿ~}yÿ‰‹‹ÿ°²²ÿ×ÙÙ~èêê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÜnÏÇȽ«£¤ÿcxuÿYŒ„ÿxǹÿvâÏÿUãÌÿHâÉÿ8×½ÿ,Ó¸ÿ)ܽÿ&ܽÿÕµÿÓ³ÿÔ±ÿ Ò¯ÿ"Ï©ÿ#˦ÿ"É¢ÿÆŸÿÄ›ÿ™ÿÁ‘ÿ¿ÿ½Šÿ»ˆÿ»„ÿ¹ƒÿº‚ÿ¹‚ÿ ºƒÿ$º„ÿ(»‡ÿ*º†ÿ*·†ÿ,´„ÿ+±ƒÿ*°‚ÿ·yÿ·yÿ·zÿ¶zÿ´|ÿ"µÿ&º„ÿ,»Šÿ/¾ÿ7¼‘ÿ>¼’ÿJ»–ÿV¼™ÿgÀŸÿpƨÿ…ƬÿšË¯ÿ«É¬ÿ­Æªÿ±À¡ÿµ¶–ÿ´ªˆÿ³¢{ÿ´œrÿ­–fÿ¬‘^ÿ­’Zÿ®Uÿ®ŒPÿ°‹Oÿµ‰Lÿ±…Hÿ©…7ÿ§ƒ5ÿª†8ÿ­ˆ>ÿ°ˆ@ÿ¶ŒIÿÀ”TÿÖYÿÖYÿÄ—ZÿÀ—Xÿ¼•Qÿ´’Fÿ°?ÿ®’;ÿ°”=ÿ¶”@ÿ·”Dÿº—Gÿ½šJÿÀžKÿÄ¢OÿǧNÿɪMÿ̱OÿεOÿϹPÿÑ»RÿÓ¾UÿÕÀWÿÕÂ[ÿÕÀ]ÿÕÂgÿÖÁvÿÞÌÿåÔ©ÿÖÊ®ÿ¥š’ÿ‚zzÿ”ÿÀ¿»ÿÛÚÖ~ððêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñéê(ØÐщª¢£ÿyzÿp…‚ÿŒ¿·ÿ’áÓÿlØÅÿLÚÃÿBÜÃÿ9ؾÿ-Ô¹ÿ%عÿ"عÿÖ¶ÿÔ´ÿÒ¯ÿЭÿ̦ÿ È£ÿÅžÿ›ÿ¿–ÿ½”ÿ½ÿ»‹ÿº‡ÿ¸…ÿ¸ÿ·ÿ¸€ÿ·€ÿ¸ÿ"¸‚ÿ#¶‚ÿ$´€ÿ#°ÿ$¬|ÿ%«}ÿ%«}ÿ ¶xÿ¹{ÿ¼ÿ½ÿ$½…ÿ+¾Šÿ0ÄŽÿ8Ç–ÿ@ÏžÿLѦÿXÖ¬ÿhÙ´ÿvܹÿˆáÀÿåÇÿ¢ãÉÿ³äÈÿÅãÆÿÉâƽÐßÀì×ظÿÚЮÿÜˤÿßÇÿÕ¾ŽÿÏ´ÿÈ­uÿ¤iÿ½›_ÿ¼—[ÿ¿“Vÿ¹Pÿ²Ž@ÿ­‰;ÿ«‡9ÿ¨ƒ9ÿ¨€8ÿª€=ÿ°„Dÿ°ƒFÿµˆKÿºPÿ¼“Tÿ½–Rÿ·•Iÿ²‘Aÿ®’;ÿ­‘:ÿ²<ÿ³@ÿµ’Bÿ¹–Fÿ¼šGÿ¿Jÿ¢IÿÄ¥HÿÈ­KÿʱKÿ˵LÿÍ·NÿιPÿÒ½TÿÒ¿XÿÓ¾[ÿÒ¿dÿÓ¾sÿÖÄ…ÿÔØÿÝѵÿÌÁ¹ÿ˜ÿ„€ÿš™•ÿÀ¿»ÿããÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëêÐÑ϶·µÿ~Œˆÿfˆÿx½°ÿäÒÿcáËÿ?Ú¿ÿ/ÜÀÿ%׺ÿ"عÿ$Ú»ÿ×µÿÓ±ÿÔ®ÿ Õ¯ÿϧÿ!Ì¥ÿ#ÊŸÿ$Æœÿ"ÖÿÀ“ÿ½ÿ»ÿ»…ÿ¸ƒÿ·€ÿ¶ÿ·|ÿ!·|ÿ!·{ÿ!·{ÿ!·{ÿ µ}ÿ´|ÿ±|ÿ¯zÿ®}ÿ±€ÿ³†ÿ'·ÿ2¸”ÿ?½šÿQ¡ÿdƨÿuɱÿ†Î¸ÿ•Î¿ÿ§ØÊÿ·ÞÖÿÅèÞÿÕîêÿÞóñYéõõ(îöö íõõéöø(ê÷ùí÷÷ÿÿÿÿÿÿÿÿÿøïìøðé(ìæÛnàÛÌšÕѾÿÍÇ°ÿÀ»¢ÿº²•ÿ°¨‹ÿ¨}ÿ¶™rÿ²”eÿ«\ÿ¨ŠQÿ£„Eÿ¤ƒ=ÿ¤„8ÿ¤€4ÿ«‡;ÿ±‰>ÿ¶ŽCÿ¹Hÿ¹Kÿ¸JÿµŒGÿ´‹Fÿ²Œ>ÿ³?ÿ´Ž@ÿ·‘Cÿº•Eÿ½˜HÿÀ›IÿÁžHÿÄ¥JÿȪKÿÉ®Lÿ˲Lÿ˵KÿϹOÿÒ¾QÿÓ¿RÿÓ¾QÿØÂYÿÙÄiÿÖÂ{ÿÜÌ—ÿäÕ´ÿɼ¦ÿ”Šÿ‡zÿ£ œÿÈÇÃÜëéé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòðï âàßYÂÃÁÿˆ‰‡ÿv„€ÿ–¸±ÿ”ÙÌÿyÜÊÿ\ÚÄÿ>Ù¾ÿ-Ú¾ÿ$Ö¹ÿ!׸ÿ Ö·ÿÒ°ÿÒ°ÿÒ¬ÿÈ¢ÿÈ ÿÆŸÿÄ™ÿÁ—ÿÀ“ÿ½ÿºŒÿ¸Šÿ·ÿµ€ÿ´}ÿ³|ÿ´yÿµzÿµyÿ´xÿ°tÿ°xÿ°xÿ¯zÿ°{ÿµ„ÿ$¼‹ÿ)À“ÿ5Å›ÿ@Æ¢ÿQϬÿhÙ¸ÿ‚äÆÿšîÖÿ­õßÿ½öçÿÇøê½Ôûó€Ýÿöcæÿû2ëÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúõæ2öòßYöðÙyïêщéáÄÊÛÓ¶ÿÐÅ¥ÿαŠÿȪ{ÿ¾ oÿ¸šaÿ°‘Rÿ¯ŽHÿ¬Œ@ÿª†:ÿ©…9ÿ«ƒ8ÿ¬„9ÿ¯…>ÿ²‰DÿµŒGÿµŒGÿ´‹Fÿ¯‰;ÿ°Š<ÿ°Š<ÿ²Œ>ÿµ@ÿ¸“Cÿº•Cÿ»˜Bÿ¼Bÿ¤EÿŪHÿÆ­GÿDZGÿ˵KÿÏ»NÿмOÿÓ¾QÿÑ»RÿϺ_ÿÒ¾wÿË»†ÿÖǦÿßÒ¼ÿº±§ÿ†€yÿ‘ŽŠÿ«ª¦ÿÖÔÔ€ðñï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéäãEÍÈÇÿ—¢ŸÿZƒ{ÿb¨›ÿãÑÿcâÉÿIáÄÿ;Ù»ÿ.Ù¹ÿ#Ù·ÿ!×µÿÕ²ÿÓ°ÿÒ¬ÿϪÿ̤ÿÊžÿƘÿ ÖÿÁ‘ÿ½Žÿ»‰ÿ¹‡ÿ¸„ÿ·ƒÿ³{ÿ³{ÿµyÿ¶zÿ´xÿ±uÿ°tÿ°uÿ²wÿ¯yÿ#°}ÿ+²„ÿ1´‰ÿ9¶ÿCÀ™ÿVɨÿ“ƾÿ¬ÒÌÿ¼âÜÿÌêåÿÛðínëøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíøè(æíÞYÜÖÏÿ×ÉÃÿĺ¨ÿ´ªŒÿ¨Ÿsÿ¤—_ÿ¡“Qÿ£Gÿ¥ŽBÿ¤…:ÿ¤7ÿ¨7ÿ©8ÿ±?ÿ¹‡Eÿ»‰Gÿ²=ÿ±Œ<ÿ°‹;ÿ¯Š:ÿ²‹<ÿµŽ?ÿ¸‘Bÿº“Dÿ½™EÿÀœHÿ¡KÿŦKÿƪKÿÊ°LÿεOÿиNÿÒ¸LÿÕ»OÿÖÀWÿÒÀcÿÐÁkÿÐÄ~ÿØÍ™ÿÝÕ°ÿµ¯˜ÿ‰†~ÿ’Žÿ¸¸¸ÿÝßßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèé(ÕÐ϶±°ÿ|‡„ÿp™‘ÿ}öÿxÜÊÿ_ÞÅÿBÚ½ÿ9×¹ÿ(Ó³ÿ Ö´ÿÕ³ÿÒ¯ÿЭÿÏ©ÿ˦ÿÉ¡ÿÇ›ÿÕÿÀ“ÿ¾Žÿº‹ÿ¹‡ÿ·…ÿ¶‚ÿµÿ´|ÿ²zÿ²vÿ²vÿ±uÿ°tÿ±uÿ²wÿ°uÿ ´~ÿ,¹†ÿ6½ÿ?—ÿMÊ£ÿ]Ú³ÿqäÃÿ»îæÿÏõï×ý÷~áÿúOêÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõüíüöï üîè(îäÒƒá×¹ÿÒÉÿƹÿ´¦dÿ«˜Oÿ©’Fÿª‹@ÿ«ˆ>ÿ­†<ÿ©8ÿ­};ÿ³?ÿ´‚@ÿ®‰9ÿ®‰9ÿ®‰9ÿ®‰9ÿ°‰:ÿ²‹<ÿµŽ?ÿ¶@ÿ·“?ÿº–Bÿ»šDÿ¿ EÿÀ¤EÿéEÿȯIÿ˳IÿδHÿÑ·KÿÑ»RÿÍ»^ÿÊ»eÿɽwÿÎÃÿÓ˦ÿÑË´ÿ©¦žÿˆƒ„ÿÿÇÉɽàââOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÛÜn²·µÿ„•‘ÿ[ƒÿo³ÿläÌÿDÞÁÿ5âÂÿ)Ö¶ÿ+Ö¶ÿ'Ò²ÿ$Ô¯ÿ"Ò­ÿ Ï©ÿ"ͧÿ#Ê¡ÿ#Çžÿ!Ùÿ!Á“ÿ¿ÿ ½‹ÿº‡ÿ¸…ÿ·ÿµÿ´|ÿ²{ÿ²wÿ°uÿ¯uÿ°vÿ±wÿ°zÿ²|ÿ³‚ÿ%³†ÿ<¶ÿQ½™ÿhÂ¥ÿƒÌ²ÿ¥ÜÉÿ»ðÜÿÚøënÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó÷ëéíÚnÞÝÃÿÅ£ÿ´«…ÿ¬Ÿsÿ©•fÿ¨Zÿ©‰Nÿ¥‚Bÿ©9ÿª‚7ÿ§4ÿªƒ8ÿ«„9ÿ¬‡7ÿ­ˆ8ÿ­‡5ÿ®ˆ6ÿ°‰:ÿ²‹<ÿµŽ@ÿ·Bÿ¹”Dÿ¼—Gÿ½œFÿÁ¢GÿĨIÿÇ«LÿȯMÿʱOÿθOÿкQÿλTÿμ]ÿÑÃqÿÓƈÿÜÓ§ÿÍÆ­ÿ ÿ’Šÿ¨©¥ÿÌÍÉ°ìñè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêåæ;ÏÊË¥šŸÿx‰…ÿ€²¨ÿˆÛÌÿjâÊÿ>Ø»ÿ0ݽÿ%Ò²ÿ(Ó³ÿ'Ò²ÿ!ѬÿϪÿ̦ÿÉ£ÿÆÿÚÿ¿•ÿ½ÿ»‰ÿ¹‡ÿ·„ÿµ‚ÿ´~ÿ³}ÿ²zÿ°yÿ¯tÿ®sÿ°vÿ²xÿµ{ÿµÿ¹ƒÿ#»Šÿ2À“ÿMÇ¡ÿgÓ¯ÿƒÝÀÿ£ìÒÿÅüéÊÓÿôƒèÿù(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿíüûáOíêË¥âÙ³ÿÎÁ•ÿï€ÿ¸jÿ²’Wÿ®‹Kÿ²ŠBÿ¯‡<ÿ©6ÿ¨6ÿ©‚7ÿª…5ÿ¬‡7ÿ¬†4ÿ«…3ÿ¬…6ÿ¯ˆ9ÿ³Œ>ÿµŽ@ÿ¶‘Aÿ¹”Dÿº™Cÿ¾ŸDÿÁ¥FÿĨIÿŬJÿÇ®Lÿ˵LÿÍ·Nÿ˸QÿʸYÿÉ»iÿʽÿË–ÿÏȯÿ¿±ÿ–“ŽÿŽ‹ÿº»·ÿÙÞÕ€îóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ÔÙØ€¤±¯ÿr“Œÿg¥™ÿ{×ÄÿlæÎÿCÙ¼ÿ0Ö·ÿ%×´ÿ"Ô±ÿ Ò¯ÿ άÿ"Ï©ÿ#˦ÿ"É ÿ"Æÿ#Ùÿ#Á“ÿ½Žÿ »ˆÿ¹ƒÿ·ÿµ~ÿ³|ÿ³zÿ²yÿ°xÿ¯wÿ±uÿ±uÿ°yÿ°~ÿ%±‚ÿ4±‰ÿA·”ÿVºžÿpÆ®ÿ‘ÕÄÿ¶çÙÿÔóì€ëüøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÔ€×ʼÿÁ³œÿ´¡~ÿ¨”dÿ¨Tÿ£Hÿ£†Aÿ§}:ÿ§}:ÿ¨€8ÿ©‚7ÿ©„4ÿ¨ƒ3ÿ«„5ÿ®‡8ÿ¯‡<ÿ±‰>ÿ³ŒAÿµŽCÿ¶“Cÿ¹—Cÿ¼ŸDÿ¿¢GÿÀ¥Nÿ§PÿÇ®NÿαNÿϳNÿѵPÿѹYÿÏ»fÿÑÂ}ÿÕÉ“ÿØѪÿ¯«“ÿŽŽ~ÿ§¢ŸÿÎÉÊÿîéê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèææ2¾ÃÂÿˆ•“ÿs”ÿ‡Å¹ÿÛÈÿdÞÆÿ=Ó¶ÿ/Õ¶ÿÑ®ÿ%×´ÿ Ò¯ÿɧÿË¥ÿ È£ÿÅœÿ™ÿ¿•ÿ½ÿ¹Šÿ¸…ÿ¶€ÿµÿ³|ÿ²{ÿ²yÿ±xÿ°xÿ¯wÿ²vÿ²vÿ±zÿ°~ÿ&²ƒÿ;¸ÿPÆ£ÿjβÿæÎÿ°ôãÿÒÿõƒæÿþ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüïáOëÝƽ×Ä¡ÿ¿«{ÿ³›_ÿ¨”Mÿ§ŠEÿ«>ÿ§}:ÿ¦~6ÿ¨6ÿ¨ƒ3ÿ§‚2ÿªƒ4ÿ®‡8ÿ­…:ÿ®†;ÿ°‰>ÿ²‹@ÿ²?ÿ¶”@ÿ¸›@ÿºBÿ½¢Kÿ¾£LÿÄ«Kÿ̯LÿβMÿϳNÿζVÿË·bÿȹtÿÏÃÿÑÊ£ÿËǯÿ¢¢’ÿŽ‰†ÿ¸³´ÿáÜÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëéé(ÓÑщ¡ª§ÿu”ÿp°¤ÿ{ÙÈÿcÛÃÿF×»ÿ9Ó¶ÿ.Ѳÿ(Ï®ÿ&Ò°ÿͪÿʧÿÈžÿÅœÿ—ÿ¾”ÿ»ÿ¹Šÿ¶…ÿ¶€ÿµ~ÿ³|ÿ³zÿ±yÿ°xÿ°xÿ®wÿ®wÿ°wÿ³zÿ%µÿ:¶ŠÿQ»—ÿrƪÿ˜ØÅÿ»åÚÿÝøôcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòèÖ~ÙϱÿƸŽÿ°¥sÿ¥”[ÿ²ŠPÿ¯ƒFÿ©>ÿ©€;ÿ¨‚4ÿ§3ÿ©‚3ÿ¬…6ÿªƒ8ÿ¬…:ÿ®‡<ÿ°‰>ÿ°=ÿ³‘=ÿ´—<ÿ¶™>ÿ·Iÿ¹ŸKÿĤKÿ̪MÿÓ­MÿÔ®NÿÓ²QÿзUÿųZÿοvÿÏÇ‹ÿÙÓªÿ½¤ÿ–‰ÿ¤–¢ÿȾÊÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞÞY¾¼¼ÿ–“ÿž—ÿŠÊ¾ÿy×ÆÿcÛÃÿ?дÿ7Ñ´ÿ&ɪÿ)ЯÿʨÿÅ¢ÿ˨ÿÆœÿ™ÿ¿”ÿ»‘ÿ¸Œÿ·ˆÿ³‚ÿ³}ÿ³|ÿ²{ÿ²yÿ°xÿ°xÿ¯wÿ®wÿ®wÿ±xÿ¸ÿ0ÀŒÿKÇ›ÿfЬÿŒàÄÿ¶öãÿÜÿûcèÿÿ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï þôÖ~ìÞ´ÿÌÁÿ¸§nÿ½•[ÿ·‹Nÿ®„Cÿ«‚=ÿª„6ÿ§3ÿ§€1ÿªƒ4ÿ§€5ÿ©‚7ÿ¬…:ÿ®‡<ÿ­Š:ÿ¯9ÿ°“8ÿ²•:ÿ²˜Dÿ´šFÿ¿ŸFÿÇ¥HÿΨHÿЪJÿÏ®Mÿ˲PÿųZÿĵlÿûÿÈ™ÿÑ̳ÿ±¨¤ÿ”†’ÿ°¦²ÿÛÛÛnîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçèEÜÔÕ€¬¤¥ÿx™’ÿh·©ÿbêÐÿ9ܽÿ*Úµÿ%Õ°ÿ)Ϫÿ&̧ÿ%Ì¥ÿ#Ê£ÿ!Çžÿ!šÿ%Ãÿ#Á‹ÿÀŒÿ¼Œÿ·Šÿ´ˆÿ²ƒÿ±~ÿ ±xÿ µwÿ²tÿ°sÿ ¯vÿ­xÿ­wÿ°‚ÿ$¯‰ÿ>¶—ÿV¼ ÿ~űÿ±ÞÎÿäòì;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ØÖ~¸¹·ÿ©¤ƒÿž“_ÿŸŒOÿ¦ŠCÿª2ÿ¬~0ÿ³‚8ÿ®{5ÿ¥}5ÿ£€7ÿ¡ˆ2ÿ£Š4ÿ¦‹4ÿ¯Œ6ÿ¸Š<ÿ¹‹=ÿ»”?ÿ»˜Bÿ½›Gÿ½ Kÿ¿¤Mÿ©MÿÆ®JÿÍ°Mÿ̯LÿØ»XÿÕ»aÿÚÄ‚ÿØÆ—ÿÔƯÿ—†ÿ˜™ÿÈÊËÿæèé2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚßànÈÀÁÿ¥žÿ‡¨¡ÿvÅ·ÿ[ãÉÿ4׸ÿ'ײÿ#Ó®ÿ'ͨÿ$Ê¥ÿ#Ê£ÿ!È¡ÿÄ›ÿÀ˜ÿ#Á‹ÿ!¿‰ÿ½‰ÿºŠÿµˆÿ²†ÿ±‚ÿ°}ÿ ²yÿ µwÿ²tÿ°sÿ ¯vÿ ®yÿ°zÿ³…ÿ,·‘ÿJ£ÿkѵÿ™àÌÿÆóã½ìúôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíÜÝÛnÅÀŸÿ²§sÿ©–Yÿ¬Iÿ¯†7ÿ¯3ÿ²7ÿ®{5ÿ¥}5ÿ£€7ÿ ‡1ÿ¡ˆ2ÿ¥Š3ÿ®‹5ÿ·‰;ÿ¹‹=ÿ¹’=ÿ¹–@ÿº˜DÿºHÿ¼¡Jÿ¿¦JÿĬHÿË®KÿË®KÿÒµRÿδZÿÒ¼zÿÔ“ÿÒÄ­ÿ´ª£ÿž™šÿ¬®¯ÿÞàáYîíïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêïîÈÐÏ° ¨§ÿœšÿ…¿´ÿw×ÆÿJܾÿ.ѱÿ&Ò®ÿ"Ϊÿ$ˤÿ"É¢ÿ!ÈŸÿÅœÿ—ÿ½“ÿ¿ˆÿ¼†ÿ¹…ÿ´…ÿ²ƒÿ°ÿ¯}ÿ°yÿ¯tÿ°uÿ¯sÿ¯sÿ°yÿ¯}ÿ#±„ÿ;µÿ`½¢ÿ‰Ë¸ÿ§äÐÿÌ÷êÿéÿø(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäàÎʾ¢ÿµ¥{ÿ¯—cÿ«ŒGÿª„<ÿ«‚9ÿ§~5ÿ§~9ÿ¨:ÿ¤8ÿ¥‚9ÿ¨„8ÿ­†7ÿ´‰8ÿ¶‹:ÿ¶Ž;ÿµ‘=ÿµ•Bÿ¸˜Eÿ¸›Fÿ¼¡Gÿ¦GÿÅ©JÿÊ­KÿÊ­KÿÈ®TÿÍ´nÿп‡ÿÓßÿÔË°ÿ¤ž“ÿ‘‘‘ÿÌÌÌÿãááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàåäO²º¹ÿ‘™˜ÿ—¤¢ÿ‘ËÀÿzÚÉÿAÓµÿ,ϯÿ"Ϊÿ˧ÿ"É¢ÿ Ç ÿÅœÿ™ÿ¿”ÿºÿ½†ÿ¹ƒÿ¶‚ÿ±‚ÿ°ÿ®ÿ­{ÿ¯xÿ¯tÿ°uÿ¯sÿ°tÿ²{ÿ!´‚ÿ,ºÿGÁ›ÿsеÿŸáÎÿ¼ùåÿÙÿ÷yìÿûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýùç2ëßÃÜÔÄšÿëwÿ¶—Rÿ°ŠBÿ¯†=ÿ«‚9ÿ¨:ÿ§~9ÿ£€7ÿ¤8ÿ§ƒ7ÿ«„5ÿ°…4ÿ³ˆ7ÿ³‹8ÿ²Ž:ÿ±‘>ÿ³“@ÿ´—Bÿ¸Cÿ¿£Dÿ¦GÿÈ«IÿǪHÿƬRÿÆ­gÿÈ·ÿ̼˜ÿØÏ´ÿª¤™ÿÿ²²²ÿÙ××~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ×Öƒ˜©¦ÿƒŸ™ÿ€¾²ÿvÕÁÿXØ¿ÿ0Ï­ÿ,Эÿ#Ì¥ÿ!Ê£ÿ!ÇžÿÅœÿÄ™ÿÀ•ÿ¼ÿ·‹ÿºƒÿ·ÿ³~ÿ±|ÿ¯zÿ®yÿ¯wÿ®vÿ!¯tÿ"°uÿ°tÿ°yÿ´ƒÿ&¹ÿG¿œÿwȯÿ»ÙÌÿÝíæcîÿö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûòï çÞщ˿£ÿ³¡xÿ§“Zÿ§Gÿ©†Bÿ¦:ÿ§}8ÿ¨y;ÿª{=ÿ«~;ÿ«8ÿ«…3ÿ­‡5ÿ¯Š6ÿ±Œ8ÿ°=ÿ²?ÿ³“@ÿ·—Dÿ½DÿÁ¢EÿȨIÿȨIÿÈ«PÿêZÿÅ°lÿÌ»‚ÿ×É•ÿÄ»šÿ¤¤˜ÿš–ÿÎÍÉ°ìêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéçç2ÁÆÅ쎟œÿ‘­§ÿŒÊ¾ÿtÓ¿ÿMÍ´ÿ,Ë©ÿ*Ϋÿ É¢ÿÇ ÿÅœÿ™ÿÁ–ÿ¾“ÿ¹Œÿµ‰ÿ¸ÿµÿ²}ÿ°{ÿ¯zÿ®yÿ®vÿ­uÿ ®sÿ ®sÿ°tÿ²{ÿ!¹ˆÿ-À”ÿTÌ©ÿˆÙÀÿÏíàìüõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóæ2åÙ½ÿ˹ÿ¶¢iÿ­“Mÿ¬‰Eÿ§€;ÿ§}8ÿ§x:ÿª{=ÿ«~;ÿª~7ÿª„2ÿ­‡5ÿ­ˆ4ÿ®‰5ÿ®‹;ÿ°=ÿ°=ÿ´”AÿºšAÿ¾ŸBÿÅ¥FÿƦGÿÆ©Nÿ½¤Tÿ¿ªfÿƵ|ÿʼˆÿÔ˪ÿ¯¯£ÿŒˆÿ¼»·ÿÞÜÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞÜÜc«·±ÿ¤šÿ³ÿpѽÿRغÿ2άÿ$Ê¥ÿ%˦ÿ#Çžÿ!ÅœÿÄ—ÿÁ”ÿ¿ÿ¼ÿ¸ˆÿµ†ÿ³~ÿ²}ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ®rÿ­rÿ­vÿ¯yÿ%´‡ÿ=¼•ÿeêÿ’ÔÁÿÃæÜÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéë(ÕÑƽ¼²”ÿªškÿ©“Qÿ©Š?ÿ­‚9ÿ¯|6ÿ¯{9ÿ­{9ÿ¨{8ÿ¥€6ÿ©…7ÿª„2ÿ¬†4ÿ¬ˆ:ÿ®Š<ÿ°Œ>ÿ´Bÿº•Cÿ½šDÿÁžDÿàFÿŦKÿÀ¤Mÿ«[ÿÆ°hÿκsÿßÏ”ÿ½¹¡ÿ™Žÿ­¨ŸÿÍÊÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëÕÓÓƒ ¬¦ÿƒ¨žÿˆË¼ÿl͹ÿQ×¹ÿ2άÿ"È£ÿ!Ç¢ÿ"Æÿ Ä›ÿ•ÿ¿’ÿ½Žÿº‹ÿ·‡ÿ´…ÿ²}ÿ±|ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ­qÿ¯tÿ!°yÿ"´~ÿ-¼ÿIÈ¡ÿtÒ¹ÿ¥çÔÿÙüòyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðìáOÒȪÿ¸¨yÿµŸ]ÿ°‘Fÿ²‡>ÿ±~8ÿ¯{9ÿ¬z8ÿ¦y6ÿ£~4ÿ§ƒ5ÿ©ƒ1ÿ«…3ÿ«‡9ÿ­‰;ÿ¯‹=ÿ³Aÿ¸“Aÿ»˜Bÿ¾›AÿÀCÿÄ¥JÿÀ¤Mÿì\ÿ¾¨`ÿË·pÿÒ‡ÿÅÁ©ÿ³¯¤ÿ¢”ÿÀ½¸ÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååEº¼¼ÿ­¢ÿ…ƶÿu׿ÿRÖ¸ÿ/Ñ­ÿ$Ê¥ÿÇÿÈžÿ ÖÿÁ”ÿ¿ÿ½ÿ¼‰ÿ¸†ÿµÿ²ÿ °|ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ°qÿ®sÿ²wÿµƒÿ1¸ŒÿV½žÿ‡Ì·ÿ¸ÞÒÿâíêEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäßàYÈħÿµ§wÿ­œSÿ°Eÿ±‡:ÿ¬‚5ÿ©}6ÿª}:ÿ§€<ÿ¥~:ÿ¨2ÿ¨2ÿªƒ8ÿ­†;ÿ°‰>ÿ²‹@ÿ¶Aÿ¹“Aÿ¼˜@ÿ½™AÿÁŸEÿÁ¤IÿÁ¥NÿÁ§Sÿ̲^ÿÓ»oÿÍÂœÿÍÅ®ÿ—„ÿ³¯¤ÿÚÙÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÙÙ~©««ÿ‹« ÿ„ŵÿsÕ½ÿOÓµÿ+Í©ÿ!Ç¢ÿÆœÿÆœÿ•ÿÀ“ÿ¾Žÿ»‹ÿº‡ÿ¶„ÿ´€ÿ±~ÿ¯{ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ±rÿ°uÿ³xÿ#ºˆÿ9À”ÿ`Ǩÿ—ÜÇÿÊðä¥ïú÷ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÜ¿ÿÍ¿ÿ¸§^ÿ·—Lÿ´Š=ÿ¯…8ÿª~7ÿª}:ÿ¦;ÿ¥~:ÿ¨2ÿ¨2ÿ©‚7ÿ¬…:ÿ®‡<ÿ°‰>ÿ´?ÿ·‘?ÿ¹•=ÿ»—?ÿ¾œBÿ¾¡Fÿ¾¢Kÿ¾¤PÿÇ­YÿζjÿÆ»•ÿÈÀ©ÿ¥ŸŒÿ­©žÿÎÍÉ°ìíñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÈÎÍ°ž¤£ÿt² ÿlÌ´ÿ^غÿ9Ñ®ÿ!Ê£ÿÅžÿÚÿÄ—ÿÀ‘ÿ¿Œÿ¼ˆÿº†ÿ¸‚ÿ¶€ÿ³{ÿ±yÿ ­zÿ¬yÿ ±tÿ °sÿ±sÿ±sÿ²uÿ±yÿ²€ÿ4»“ÿ_Á£ÿŽÌ¼ÿÎãÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEØгÿ¿°‚ÿ³Ÿ^ÿªEÿª‡>ÿ¦7ÿ¥|3ÿ¦{8ÿ¦{8ÿ¨€5ÿ§4ÿ¨6ÿ«‚9ÿ­„;ÿ®…<ÿ±‰>ÿµŽ?ÿ·’@ÿ¸•?ÿ»›Bÿ¿ŸFÿ¾ GÿÁ£JÿÉ«RÿÒ³^ÿμ‡ÿΠÿ¾´–ÿ¬¦“ÿÀ½µÿàáåOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¾ÄÃÿ¢¨§ÿ|º¨ÿnζÿZÔ¶ÿ3˨ÿÆŸÿÄÿ™ÿÁ”ÿ¾ÿ½Šÿº†ÿ¸„ÿ¶€ÿ´~ÿ²zÿ°xÿ¬yÿ«xÿ °sÿ °sÿ °rÿ±sÿ²uÿ³{ÿ&¹‡ÿ<ÛÿkͯÿÛËÿÜñécÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøöìêâÅÊÓÄ–ÿÀ¬kÿ±–Lÿ¯ŒCÿ©„:ÿ¦}4ÿ¥z7ÿ§|9ÿ¨€5ÿ§4ÿ¨6ÿª8ÿ«‚9ÿ¬ƒ:ÿ¯‡<ÿ³Œ=ÿµ>ÿ·”>ÿ¹™@ÿ½Dÿ½ŸFÿ¿¡HÿŧNÿˬWÿǵ€ÿʾœÿÍÃ¥ÿª¤‘ÿ°­¥ÿÓÔ؃íðøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìôóÎÖÕ­¸¶ÿ¢°®ÿu˳ÿV׸ÿCÓ°ÿ*Ç¢ÿÄ›ÿÄ›ÿ!•ÿ¿ÿ¾‹ÿ¼‰ÿ¸‚ÿ¶€ÿ ´~ÿ²|ÿ³yÿ±wÿ¯yÿ¬wÿ®sÿ®sÿ­rÿ®sÿ²zÿ$´„ÿ>½–ÿhêÿšÑÂÿÐä߉ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ñìØпÿ³“ÿ¬škÿª‘Sÿ¨ŠCÿ¦7ÿ«~4ÿ­€6ÿ©€7ÿ¨6ÿª6ÿ«€7ÿ¬8ÿ­‚9ÿ®‡9ÿ±Š<ÿ°Ž;ÿ²=ÿ´•@ÿ·˜Cÿ¹›Dÿ¿œFÿÅ KÿÉ£QÿêjÿÈ·†ÿÔÈ ÿ¯¥ÿª¦›ÿÊÊÊÿéìñ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÃËÊÿ¡¬ªÿ¥³±ÿ|ÒºÿUÖ·ÿ=ͪÿ&ÞÿÚÿ™ÿ¿’ÿ½ÿ¼‰ÿº‡ÿ·ÿµÿ²|ÿ±{ÿ²xÿ°vÿ¯yÿ¬wÿ­rÿ®sÿ®sÿ¯tÿµ}ÿ*ºŠÿDÃœÿq̳ÿ§ÞÏÿÝñìcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèàÏÑ¢ÿ¸¦wÿ²™[ÿ«Fÿ§‚8ÿ«~4ÿ«~4ÿ¨6ÿ§~5ÿ©~5ÿ«€7ÿ¬8ÿ¬8ÿ¬…7ÿ¯ˆ:ÿ®Œ9ÿ±<ÿ²“>ÿµ–Aÿ¸šCÿ¾›EÿÂHÿÅŸMÿ¾¥eÿ±€ÿÒÆžÿ·­•ÿª¦›ÿÀÀÀÿàãèOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëE¹ÇÅÿ™§¥ÿ£¶³ÿfÔ¸ÿHÓ²ÿ,ɤÿ$Áœÿ"˜ÿ¿•ÿ»ÿ»ÿ»Šÿ¹„ÿ¶~ÿ³|ÿ ±zÿ°yÿ±uÿ ±tÿ °wÿ®uÿ#ªrÿ$«sÿ ­tÿ°vÿ'¸„ÿ1¿”ÿbèÿ”ÑÃÿÒã߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëØÉǽ¼¬•ÿ±›qÿ«Rÿ¨†:ÿ®‚/ÿ«,ÿ§}6ÿ¦|5ÿ©~5ÿ«€7ÿ«6ÿ«6ÿ«„6ÿ®‡9ÿ®‹;ÿ°=ÿ±‘>ÿ³“@ÿ¸–Cÿ¾˜FÿÛIÿÄœJÿÀ¤]ÿïvÿÑÁ“ÿ¸šÿ¯¬ÿ¸¸¸ÿÖÙÞ~íðõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêòñÜçåc¶ÄÂÿ—¥£ÿ¤·´ÿbдÿBͬÿ(Å ÿ"¿šÿ!Á—ÿ¼’ÿ¹‹ÿ»ÿº‰ÿ¸ƒÿµ}ÿ²{ÿ°yÿ¯xÿ±uÿ °sÿ °wÿ®uÿ#ªrÿ%¬tÿ!®uÿ!³yÿ+¼ˆÿ6Ä™ÿjË°ÿŸÜÎÿÝîêcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåÖԀɹ¢ÿº¤zÿ±•Xÿ­‹?ÿ±…2ÿ¬€-ÿ¦|5ÿ¥{4ÿ¨}4ÿª6ÿ«6ÿ«6ÿªƒ5ÿ­†8ÿ«ˆ8ÿ­Š:ÿ®Ž;ÿ°=ÿµ“@ÿ¼–DÿÀ˜FÿÁ™GÿºžWÿ»§nÿȸŠÿÅ»ÿ²¯ ÿ³³³ÿÐÓØÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÙØy©º¶ÿ…»®ÿlʲÿ@Ö²ÿ4ʦÿ*Ãœÿ&¿˜ÿ ¼“ÿ¼Žÿ¼Šÿ¸†ÿ¸„ÿ¶‚ÿµ}ÿ²{ÿ°yÿ¯xÿ®vÿ­uÿ®uÿ«rÿ®rÿ­qÿ)­xÿ/²€ÿ3·ŽÿEǦÿ´Ã»ÿÓßßÿéøú(ïþÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëáOÊǹÿ²©•ÿ¬œrÿ§ŒTÿ«ƒ1ÿª‚0ÿ¥€0ÿ¤}2ÿ¥}2ÿ§4ÿ©€7ÿ©€7ÿª8ÿ¬ƒ:ÿ®†;ÿ¯‡<ÿ±Œ<ÿ³Ž>ÿ´’>ÿ·•AÿºšAÿ¼œCÿÀMÿÌ¥aÿȲpÿÕÅ–ÿ½¸—ÿ©©›ÿËÍÕÿååñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíñÑÍÌš¢³¯ÿˆ¾±ÿrиÿ<Ò®ÿ1Ç£ÿ'À™ÿ$½–ÿº‘ÿ»ÿ»‰ÿ·…ÿ¶‚ÿµÿ´|ÿ±zÿ°yÿ¯xÿ®vÿ®vÿ°wÿ­tÿ°tÿ°tÿ-±|ÿ4·…ÿ:¾•ÿMÏ®ÿ¿ÎÆÿÛççníüþðÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôòè(×Ôƽ¾µ¡ÿµ¥{ÿ®“[ÿ°ˆ6ÿ¬„2ÿ¦1ÿ¥~3ÿ¦~3ÿ¨€5ÿ©€7ÿ¨6ÿ©€7ÿ«‚9ÿ¬„9ÿ®†;ÿ¯Š:ÿ²=ÿ²<ÿµ“?ÿ¸˜?ÿºšAÿ¼™IÿÈ¡]ÿ¬jÿÏ¿ÿ¼·–ÿ¦¦˜ÿÀÂÊÿÜÜècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõçë2¿ÂÀÿŽ°¥ÿ~ijÿlÕºÿ:Ψÿ/Ãÿ(½•ÿ%º’ÿ ¹Œÿ¸‹ÿ¹‡ÿµƒÿ´~ÿ²}ÿ²{ÿ¯yÿ¯wÿ­vÿ­vÿ­vÿ®vÿ«sÿ¯vÿ°wÿ*³ÿ=¹‹ÿK›ÿqеÿÐÛÓÿçïï2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäâØyÈIJÿ¹­‰ÿ°™gÿ¯Aÿ¬…:ÿ©6ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿ«8ÿ­‚9ÿ®ƒ:ÿ¯ˆ:ÿ±Š<ÿ²;ÿµ>ÿ¶”@ÿ¸–Bÿ»–DÿÆŸUÿÁ©aÿμ‡ÿû–ÿ«©—ÿ¹»»ÿØ×à~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòäè;¹¼ºÿ¯¤ÿ~ijÿgеÿ6ʤÿ,Àšÿ&»“ÿ$¹‘ÿ·Šÿ¶‰ÿ·…ÿ´‚ÿ³}ÿ±|ÿ±zÿ®xÿ®vÿ¬uÿ¬uÿ¬uÿ­uÿªrÿ¯vÿ²yÿ,µÿ@¼ŽÿPÇ ÿyؽÿÙäÜyìôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEÒμÿ¿³ÿ´kÿ´’Fÿ­†;ÿª‚7ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿª~7ÿ¬8ÿ­‚9ÿ­†8ÿ°‰;ÿ±Œ:ÿ³Ž<ÿ´’>ÿ¶”@ÿº•Cÿ›Qÿ¼¤\ÿȶÿƾ™ÿ±¯ÿ´¶¶ÿÕÔÝ€ïîø ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçáâO­¼¸ÿ‚µ§ÿnȱÿPÍ­ÿ,ËŸÿ#–ÿ½ÿ»ÿº‡ÿ¸…ÿ·ƒÿ´€ÿµ|ÿ³{ÿ²xÿ°wÿ®uÿ­uÿ¬tÿ¬tÿ®vÿ«sÿ¯wÿ³~ÿ,¹†ÿI¾—ÿsǪÿ¥ÙÈÿäêå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿññëÖÔÊ¥½¶›ÿ² wÿ«”Vÿ¬‡Cÿªƒ9ÿª6ÿ¨}4ÿ©~5ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ¬8ÿ­‚9ÿ¯…:ÿ±‡<ÿ±Š;ÿ³Œ=ÿ´=ÿ¶‘?ÿº”Bÿ¾˜Fÿº Tÿ¯rÿȽ‘ÿ¸³šÿ²³ªÿÓÏÔÿîëôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞØÙy¬»·ÿ…¸ªÿnȱÿLÉ©ÿ)Èœÿ!À”ÿ¼Žÿ»ÿ¹†ÿ·„ÿ¶‚ÿ³ÿ´{ÿ²zÿ²xÿ¯vÿ®uÿ¬tÿ¬tÿ¬tÿ­uÿ«sÿ°xÿµ€ÿ/¼‰ÿM›ÿwË®ÿ«ßÎÿìòíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞԀƿ¤ÿ¹§~ÿ²›]ÿ±ŒHÿ«„:ÿª6ÿ§|3ÿ¨}4ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ«€7ÿ­‚9ÿ®„9ÿ°†;ÿ°‰:ÿ²‹<ÿ³Ž<ÿµ>ÿº”Bÿº”Bÿ¹ŸSÿ»¨kÿøŒÿºµœÿ®¯¦ÿÌÈÍÿìéò(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïïï ÓÓÓƒ£¾µÿ|¾«ÿZ˯ÿ>Ê¥ÿ'Å—ÿ½ÿº‹ÿ¹Šÿ·ƒÿ¶‚ÿ¶~ÿ³{ÿ³yÿ²xÿ±uÿ°tÿ¯sÿ®sÿ®sÿ®sÿ­rÿ©sÿ°{ÿ!µ…ÿ5½“ÿUáÿ•É·ÿÎßÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ÍÉ·ÿº¯ÿ±nÿ¬Sÿ®‡<ÿ¬‚7ÿ§}2ÿ§}2ÿ©~5ÿ©~5ÿ«~5ÿ¬6ÿ­€6ÿ®7ÿ­ƒ6ÿ¯…8ÿ¯ˆ9ÿ°‰:ÿ³;ÿ´Ž<ÿº“>ÿ¹’=ÿ½ Oÿ¼¦dÿĶ‚ÿú™ÿ·¯¢ÿÊÆÅÿêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ÐÐÐÿ¥À·ÿ~À­ÿYÊ®ÿ<È£ÿ$”ÿ»ÿ¸‰ÿ·ˆÿ¶‚ÿµÿµ}ÿ³{ÿ²xÿ±wÿ±uÿ°tÿ¯sÿ®sÿ¯tÿ¯tÿ¯tÿ«uÿ²}ÿ%¹‰ÿ9Á—ÿZȦÿšÎ¼ÿÓäÛƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÕÑ¿ÿÀµ•ÿµ¡rÿ®’Uÿ°‰>ÿ­ƒ8ÿ¨~3ÿ§}2ÿ¨}4ÿ¨}4ÿ«~5ÿ«~5ÿ¬5ÿ­€6ÿ­ƒ6ÿ®„7ÿ®‡8ÿ¯ˆ9ÿ²Œ:ÿ³;ÿ¶:ÿ´8ÿ»žMÿ¸¢`ÿÁ³ÿÄ»šÿ¸°£ÿÇÃÂÿçæê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéîí(ÄÉÈÿš¼±ÿ€É³ÿJͬÿ:Ç ÿ'¾ÿ#º‰ÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ²~ÿ3»‘ÿBÀœÿfĬÿÀÑÈÿâéæEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïóÔÔÈÿ¾¶Ÿÿ¯¡}ÿ«’`ÿ²ŽBÿ©6ÿ¤|1ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿ«4ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¹‘?ÿ´•Fÿ³Uÿijzÿø’ÿ»±ŸÿÆ¿¼ÿàßãYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÃÈÇÿš¼±ÿÊ´ÿJͬÿ9ÆŸÿ&½Œÿ"¹ˆÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ ³ÿ4¼’ÿCÁÿhÆ®ÿÃÔËÿæíê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòö ÙÙ͚û¤ÿ³¥ÿ¯–dÿ´Dÿ«ƒ8ÿ¥}2ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿª€3ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¸>ÿ³”Eÿ²œTÿÁ°wÿÁ¶ÿº°žÿĽºÿÞÝácÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêé;ÁÇÂÿš¼±ÿÊ´ÿMͪÿ4Æœÿ!¾Œÿºˆÿ·„ÿ¶ƒÿ¶€ÿ´~ÿ²{ÿ²{ÿ±xÿ±xÿ°wÿ°wÿ¯vÿ¯vÿ¯vÿ®vÿ°xÿ ¯xÿ*´„ÿB¼–ÿTÀ£ÿ„´ÿÑÔÒ‰îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜÞØyÆ¿®ÿ³¨ÿ°›nÿµ•Jÿ¬‡=ÿ¥€6ÿ¦7ÿ¤5ÿ¤5ÿ§€6ÿ§€6ÿ§€5ÿ¨6ÿ©‚7ÿªƒ8ÿ©…7ÿ«‡9ÿ®Š<ÿ¯‹=ÿ²‹=ÿ¶Dÿ²’Gÿ´™VÿÁ®uÿųŽÿ»°šÿÄ»¸ÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçæE¾Ä¿ÿ™»°ÿÊ´ÿLÌ©ÿ2Äšÿ!¾Œÿ»‰ÿ¸…ÿ·„ÿ·ÿµÿ³|ÿ³|ÿ³zÿ²yÿ²yÿ±xÿ±xÿ±xÿ±xÿ°xÿ³{ÿ$³|ÿ.¸ˆÿFÀšÿWæÿ†Ä¶ÿÔ×Õ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâäÞYËijÿ¶«ÿµ sÿ¸˜Mÿ°‹Aÿ¨ƒ9ÿ¨ƒ9ÿ¦7ÿ¦7ÿ©‚8ÿ©‚8ÿ©‚7ÿªƒ8ÿ«„9ÿ¬…:ÿ«‡9ÿ­‰;ÿ¯‹=ÿ±?ÿ³Œ>ÿ¶Dÿ³“Hÿ´™Vÿ¾«rÿIJÿ¼±›ÿú·ÿÙÕÚ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿœº­ÿ„ʳÿP̨ÿ8˜ÿ+¾Œÿ'ºˆÿ$·…ÿ$·…ÿ#¶‚ÿ!´€ÿ ´~ÿ ´~ÿ³{ÿ³{ÿ³{ÿ²zÿ±{ÿ±{ÿ±{ÿ±{ÿ$³|ÿ-³~ÿ:¸ŽÿW¾Ÿÿt¿ªÿ˜Â»ÿÚ×Ù~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ËŸÿ´¬•ÿ·¥|ÿº™Tÿ®Hÿ¦…@ÿ¥„?ÿ¤=ÿ¥‚>ÿ©„@ÿ¨ƒ?ÿ§ƒ=ÿ¨„>ÿ©…?ÿª†@ÿ«‡Aÿ­‰Cÿ­‹Eÿ®ŒFÿ²‹Gÿ³ŒHÿ³’Mÿ³™Wÿ½ªqÿIJÿ½²œÿÁ¸µÿ×Ó؃ïðô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿ»®ÿ…Ë´ÿRΪÿ;Å›ÿ-ÀŽÿ*½‹ÿ'ºˆÿ&¹‡ÿ&¹…ÿ$·ƒÿ#·ÿ#·ÿ"·ÿ"·ÿ!¶~ÿ!¶~ÿ!µÿ!µÿ!µÿ!µÿ&µ~ÿ0¶ÿ>¼’ÿ[£ÿvÁ¬ÿ™Ã¼ÿÛØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéç2Ìƹÿ¶®—ÿ¾¬ƒÿ¿žYÿ³’Mÿ¬‹Fÿª‰Dÿ©†Bÿª‡Cÿ®‰Eÿ¬‡Cÿ¬ˆBÿ­‰Cÿ®ŠDÿ¯‹Eÿ¯‹Eÿ°ŒFÿ°ŽHÿ±Iÿ¶Kÿ¶Kÿ·–Qÿ¶œZÿ½ªqÿųŽÿ¾³ÿÀ·´ÿÕÑÖÿîïó ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Á¾ÿ¢¼¯ÿŒÍ·ÿVÒ®ÿKÈ ÿQÀ”ÿM¼ÿKºŽÿJ¹ÿJº‹ÿI¹ŠÿH¸ˆÿH¸ˆÿG·‡ÿF¶†ÿF¶†ÿF¶†ÿD·†ÿD·†ÿD¶‡ÿD¶‡ÿ9»†ÿ<¾‰ÿOšÿkǪÿ‹Â³ÿ¬ÂÀÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçéé2ÍǼÿ¹±šÿƳŽÿÁ¥eÿº™Zÿ³’Sÿ°Pÿ°Nÿ²Pÿ´Pÿ²ŽNÿ²ŽNÿ³Oÿ´Pÿ´Pÿµ‘Qÿµ‘Qÿµ’Rÿ¶“Sÿ¼–Vÿº”Tÿ»›Zÿº¡cÿÁ¬xÿȶ‘ÿÁ¶¢ÿÀ·³ÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Âÿÿ£½°ÿŽÏ¹ÿYÕ±ÿNË£ÿVÅ™ÿS–ÿP¿“ÿP¿“ÿPÀ‘ÿN¾ÿM½ÿN¾ŽÿM½ÿL¼ŒÿL¼ŒÿL¼ŒÿJ½ŒÿJ½ŒÿJ¼ÿJ¼ÿAÃŽÿDÆ‘ÿVÉ¡ÿqÍ°ÿÆ·ÿ®ÄÂÿÞÚßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèêê(ÎȽÿ»³œÿ̹”ÿÉ­mÿ¡bÿ»š[ÿ¸—Xÿ¸•Vÿ¹–Wÿ»—Wÿ¸”Tÿ¹•Uÿº–Vÿ»—Wÿ»—Wÿ»—Wÿ»—Wÿ»˜Xÿ¼™YÿÃ]ÿÁ›[ÿ¢aÿÀ§iÿį{ÿ˹”ÿĹ¥ÿ¹µÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞàèY¾ÀÈÿ©¼¹ÿ­Í¼ÿЪÿŒÈ ÿÚÿ{¿–ÿ|À—ÿ}Á˜ÿ{¿–ÿz¾•ÿz¾•ÿy½”ÿx¼“ÿx¼“ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿ€¼“ÿ‰½•ÿ•Ç¥ÿŸÆ­ÿ¬Ç·ÿµÅ¾ÿÖÞÝ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2ÆÁÂÿ±³ ÿº¼žÿ¼±ÿ²£rÿªœhÿ­šgÿ«™dÿ®˜dÿ±™cÿ°˜bÿ²šdÿ³›eÿ³›eÿ´œfÿ³iÿ³iÿ²iÿ²iÿµŸoÿµŸoÿ±¤pÿ±©tÿ·µ…ÿ¿½šÿº¹¤ÿ½ºµÿÖÓÕÿòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßáéY¿ÁÉÿ«¾»ÿ¯Ï¾ÿ Ó­ÿ̤ÿƒÇžÿÚÿÚÿÅœÿ~™ÿ~™ÿ~™ÿ}Á˜ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ†Â™ÿÛÿšÌªÿ¤Ë²ÿ®É¹ÿ´Ä½ÿÕÝÜ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÇÂÃÿ³µ¢ÿ¾À¢ÿÀµƒÿ¶§vÿ® lÿ°jÿ®œgÿ±›gÿµgÿ´œfÿ´œfÿ´œfÿµgÿ¶žhÿ´žjÿµŸkÿ´Ÿkÿ´Ÿkÿ·¡qÿ·¡qÿ³¦rÿ³«vÿ¹·‡ÿÁ¿œÿ¼»¦ÿ¿¼·ÿÖÓÕƒòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæâèEÆÂÈÿ½½·ÿÉͺÿÃѨÿºÈŸÿÅ¿šÿÀº•ÿÁ»–ÿ¼—ÿÀº•ÿ¿¹”ÿÀº•ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¿¹”ÿ¿¹”ÿÀº•ÿ´¿—ÿ¶Á™ÿÀË«ÿÂʳÿ¿Æ·ÿ¼ÀºÿØÛÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÅÀÁÿ²³£ÿ¼Ã¢ÿ¹µ€ÿ°¨sÿ¦¡jÿ¨žhÿ¦dÿ©œdÿªždÿ­œcÿ®dÿ®dÿ­Ÿeÿ­Ÿeÿ¬Ÿgÿ¬Ÿgÿ¬¡hÿ¬¡hÿ± mÿ°Ÿlÿ­¦mÿ­«qÿ³·ƒÿ»½™ÿ¸¼£ÿÀ¾¶ÿ×ÕÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçãéEÇÃÉÿ¼¼¶ÿÆÊ·ÿÀÎ¥ÿ¶Ä›ÿÁ»–ÿ½·’ÿ½·’ÿ¾¸“ÿ»µÿ»µÿ¼¶‘ÿ»µÿ»µÿ»µÿ»µÿ»µÿ»µÿ¼¶‘ÿ¼¶‘ÿ¼¶‘ÿ¯º’ÿ²½•ÿ¾É©ÿÁɲÿ½Äµÿ¸¼¶ÿÕØÖ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2½¾ÿ­®žÿ·¾ÿ²®yÿ¨ kÿ˜aÿŸ•_ÿ”[ÿ¡”\ÿ¡•[ÿ¤“Zÿ¥”[ÿ¥”[ÿ£•[ÿ¤–\ÿ¢•]ÿ£–^ÿ¢—^ÿ£˜_ÿ¨—dÿ§–cÿ¤dÿ¥£iÿª®zÿ³µ‘ÿ³·žÿ¾¼´ÿØÖÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçé2ÕÄÈÿÓ¹³ÿäïÿèÅšÿé¸ÿî°ˆÿꬄÿꬄÿë­…ÿ誂ÿ誂ÿ髃ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ髃ÿâ«„ÿÞ®Šÿç¾ÿáÁªÿÓ¿®ÿ¶°ÿ×ÔÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçäæ;½º¼ÿ¦ª—ÿ®¸”ÿ£¨kÿ™™]ÿSÿQÿ‹ŒNÿŒOÿ‘ŒMÿŠKÿŠKÿŠKÿŠKÿŠKÿŽ‹NÿŒOÿŒOÿŽPÿ™ŽTÿ˜Sÿ”“Vÿ–™[ÿ¦nÿ§¯‡ÿ­³šÿ¼½´ÿÙØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêìØÇËÿÔº´ÿã®ÿãÀ•ÿ㲊ÿ誂ÿã¥}ÿã¥}ÿä¦~ÿá£{ÿá£{ÿâ¤|ÿá£{ÿâ¤|ÿâ¤|ÿá£{ÿá£{ÿá£{ÿá£{ÿá£{ÿâ¤|ÿÜ¥~ÿקƒÿà·–ÿܼ¥ÿκ©ÿ¼°ªÿÑÎÉ°ðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäáãO»¸ºÿ¢¦“ÿ¦°ŒÿšŸbÿSÿ„„Hÿ‚‚Fÿ‚Dÿ„Dÿ†Bÿ„@ÿ…€Aÿ„@ÿ„@ÿ„@ÿƒ€Cÿ„Dÿƒ‚Eÿƒ‚EÿŒGÿ‹€Fÿˆ‡JÿŠOÿ’›cÿ ¨€ÿ«±˜ÿ¿À·ÿÜÛÝnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿííí×ÊÌÿܺ­ÿó½¤ÿÿ¶Šÿÿ©{ÿû¡rÿöœmÿõ›lÿöœmÿôškÿó™jÿ÷›lÿöškÿöškÿöškÿôškÿôškÿôškÿõ›lÿõ›lÿõ›lÿûœpÿûšvÿþ¬‰ÿòµ›ÿÞ´¡ÿ¿« ÿËÉÁÿêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÚÜn³´²ÿ™¢ˆÿž¨~ÿŽ•Rÿ†Cÿsz7ÿqx5ÿtv4ÿuw5ÿuw5ÿrt2ÿuv4ÿuv4ÿtu3ÿtu3ÿtv4ÿuw5ÿtx6ÿuy7ÿyw6ÿwu4ÿw|7ÿz„>ÿ…‘Wÿ—¡wÿ¦¯•ÿ¾Á¸ÿÜÞßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ×ÊÌÿÛ¹¬ÿÿû°„ÿ÷¡sÿôškÿï•fÿî”eÿï•fÿì’cÿì’cÿð”eÿï“dÿï“dÿï“dÿí“dÿí“dÿî”eÿï•fÿï•fÿð–gÿõ–jÿõ”pÿø¦ƒÿí°–ÿÚ°ÿ»§œÿÇŽÿæææ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíìðÔÓÕƒ­®¬ÿ“œ‚ÿ•Ÿuÿ„‹Hÿt{8ÿip-ÿgn+ÿjl*ÿjl*ÿjl*ÿhj(ÿij(ÿij(ÿij(ÿhi'ÿhj(ÿik)ÿhl*ÿim+ÿom,ÿmk*ÿns.ÿq{5ÿ}‰Oÿ‘›qÿ£¬’ÿ½À·ÿÞàáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÔÔÔÿؾ®ÿí¶›ÿÿ­ƒÿÿ›lÿÿ’^ÿÿ\ÿÿ[ÿÿ[ÿÿŽ[ÿÿZÿÿŒYÿÿŒYÿÿZÿÿZÿÿZÿÿZÿþŽZÿÿ[ÿÿ\ÿÿ\ÿÿ^ÿÿ–hÿÿŸxÿõªŠÿæ²›ÿ¾¤”ÿ¾½³ÿÞãáYíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëñÍÌÎÿª¬¦ÿ“ž~ÿ›kÿ‡@ÿqu.ÿjn'ÿei"ÿcg ÿfj#ÿde!ÿde!ÿcd ÿcd ÿcd ÿcd ÿcg ÿcg ÿdh!ÿdh!ÿdf ÿeg!ÿem&ÿht,ÿw†IÿŒ™mÿ¡¬’ÿÃÈ¿ÿæçë2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëóòÖÖÖÿÚÀ°ÿí¶›ÿþ¬‚ÿÿ›lÿÿ‘]ÿþŽZÿýYÿýYÿÿŒYÿþ‹XÿÿŠWÿÿ‹Xÿÿ‹Xÿÿ‹Xÿþ‹Xÿþ‹XÿýYÿþŽZÿþŽZÿÿ[ÿþ]ÿÿ“eÿÿœuÿò§‡ÿ屚ÿÀ¦–ÿ½¼²ÿÙÞÜÿíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåãéEÂÁÃÿ£¥ŸÿŽ™yÿ…‘aÿz‚;ÿmq*ÿfj#ÿaeÿ`dÿbfÿabÿabÿ`aÿ`aÿ`aÿ`aÿ_cÿ`dÿ`dÿ`dÿacÿceÿck$ÿgs+ÿw†Iÿšnÿ¤¯•ÿÆËÂÿèéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëöôÒÝÛÿ×ĵÿç¸ÿõ«‡ÿÿmÿÿZÿÿŒWÿþŠUÿÿ‹VÿÿŠVÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰UÿÿŠVÿÿ‹VÿÿŒWÿÿXÿÿXÿüWÿþ•\ÿÿšmÿü¤€ÿð°—ÿÏ©—ÿ¾¸«ÿÏÖÓÿæôó2ïýü ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÜàc¹·¶ÿ £”ÿšrÿ|ŽQÿ{4ÿjn#ÿdgÿ`cÿ^aÿ`cÿ^`ÿ^`ÿ__ÿ__ÿ__ÿ__ÿ]_ÿ]_ÿ^aÿ^aÿ]`ÿ^aÿ_hÿdo)ÿuƒIÿ™oÿ¦°™ÿÉÍÇÿêêðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîù÷ ×âà~Ûȹÿç¸ÿôª†ÿÿmÿÿZÿÿ‹VÿüˆSÿý‰Tÿÿ‰UÿþˆTÿÿˆTÿÿˆTÿÿˆTÿÿˆTÿÿ‰Uÿÿ‰Uÿÿ‹VÿÿŒWÿþŒWÿÿXÿüWÿü“Zÿý˜kÿû£ÿð°—ÿÓ­›ÿ¸²¥ÿÂÉÆÿßíìÿëùøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÕÙ€¯­¬ÿ ‘ÿ›sÿy‹Nÿx|1ÿhl!ÿcfÿ`cÿ^aÿ`cÿ]_ÿ]_ÿ^^ÿ^^ÿ^^ÿ^^ÿ\^ÿ]_ÿ]`ÿ]`ÿ\_ÿ]`ÿ^gÿdo)ÿv„Jÿœrÿª´ÿÎÒÌšîîô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝèæcÛÌÃÿâ·¢ÿíª‹ÿürÿû‘[ÿúWÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰Tÿù‰TÿúŠUÿùŒVÿúWÿúŽXÿúŽXÿõ“Sÿõ—Vÿýšfÿÿ¡~ÿÿ°•ÿä° ÿ¾«žÿ¹º¶ÿØçãÿèöõ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîëíÏÌΚ©¦¡ÿ›žˆÿ‘mÿyŒGÿxz.ÿikÿefÿbcÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ]`ÿ]`ÿ]`ÿ`aÿabÿ`h!ÿgq.ÿz‡Oÿ• xÿ°¹¤ÿÔØÓƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëEàÑÈÿ乤ÿî«Œÿÿ uÿý“]ÿûŽXÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰TÿúŠUÿû‹VÿúWÿûŽXÿúŽXÿúŽXÿö”Tÿö˜WÿýšfÿÿŸ|ÿÿ®“ÿç³£ÿ¸¥˜ÿ¯°¬ÿÏÞÚÿäòñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåâäEÄÁÃÿ¤¡œÿ™œ†ÿ™iÿv‰Dÿuw+ÿhjÿefÿcdÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ\_ÿ]`ÿ]`ÿ_`ÿabÿai"ÿis0ÿ}ŠRÿ™¤|ÿ´½¨ÿÙÝØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìðñæÕÌÿ滪ÿî«ÿý¡~ÿÿ”`ÿÿZÿûˆUÿý‡TÿþˆUÿÿ‡Uÿÿ†Tÿÿ†Tÿÿ…Sÿÿ†TÿÿˆVÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿô–Tÿö˜Vÿþ˜cÿÿxÿÿªÿñ³£ÿ¾ •ÿª©¥ÿÂÐÎÿÜêècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñíØÖÖ~¶´´ÿ ž–ÿ—›‚ÿˆ—]ÿv†?ÿrv*ÿeiÿcgÿaeÿ_cÿacÿ]aÿ]aÿ\`ÿ\`ÿ[_ÿ[_ÿ\_ÿ\_ÿ]aÿ]aÿ]^ÿ`_ÿci"ÿlu2ÿƒUÿ ¨ƒÿ¼Ã®ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïóô éØÏÿ转ÿ﬑ÿÿ£€ÿÿ•aÿÿŽ[ÿûˆUÿý‡TÿþˆUÿÿ†Tÿÿ†Tÿÿ…Sÿÿ…Sÿÿ†Tÿÿ‡Uÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿõ—Uÿö˜Vÿý—bÿÿšuÿÿ§Œÿò´¤ÿ¼ž“ÿ¨§£ÿ¶ÄÂÿÔâà€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéå;ÊÈÈÿ©§§ÿš˜ÿ”˜ÿƒ’Xÿr‚;ÿqu)ÿeiÿdhÿbfÿ`dÿacÿ]aÿ^bÿ]aÿ]aÿ\`ÿ\`ÿ]`ÿ]`ÿ]aÿ]aÿ^_ÿbaÿfl%ÿqz7ÿˆ”Zÿ¦®‰ÿÃʵÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï÷ö èãÚnàÅ·ÿá­ ÿí¦‹ÿ÷›fÿûŽ[ÿûˆVÿþ‡Vÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰Tÿÿ‹WÿÿŒXÿÿŒXÿÿXÿýZÿÿ”`ÿý”cÿü“`ÿÿ£sÿÿª|ÿð±‹ÿ㻞ÿ´¦ÿ²³©ÿÑÎÐïìõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÝÝnÀÃÁÿ˜–•ÿœŸ…ÿ›¡rÿƒAÿy0ÿsr"ÿnmÿffÿeeÿceÿbdÿ_cÿ_cÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿa_ÿa_ÿ]aÿ[dÿai-ÿpxIÿŠoÿ¬±œÿÑÕÉÿìíé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéàOèÍ¿ÿæ²¥ÿð©Žÿùhÿý]ÿü‰WÿÿˆWÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰TÿÿŠVÿÿŒXÿÿŒXÿÿXÿýZÿÿ’^ÿþ•dÿý”aÿÿŸoÿÿ¨zÿñ²Œÿå½ ÿµ§‘ÿš›‘ÿÅÂÄÿäáêOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéëë(ÌÎΚ®±¯ÿ™—–ÿ †ÿ™Ÿpÿ‹?ÿw}.ÿsr"ÿmlÿggÿffÿdfÿbdÿ_cÿ^bÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿ`^ÿa_ÿ[_ÿ\eÿem1ÿu}Nÿ‘–vÿµº¥ÿÙÝщñòî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôñé(í×Ëÿß¼®ÿí¬—ÿú¡nÿÿ’bÿü‹YÿÿˆWÿÿ†Sÿÿ†Sÿþ‰Rÿú‰Qÿø‰Qÿø‰QÿþˆTÿÿŠVÿÿŒXÿÿŒXÿþŽYÿüZÿú’]ÿÿ—bÿû•`ÿÿœkÿü¤uÿù²ŒÿﾞÿË«”ÿŸƒÿ¸´³ÿÓÖÛƒîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¸½¼ÿšŸ–ÿ› ‹ÿ¤yÿ•aÿ€Š7ÿtz(ÿpq!ÿklÿhhÿggÿdfÿbdÿ^bÿ^bÿ]`ÿ]`ÿ^aÿ]`ÿ^_ÿ^_ÿ^_ÿ^_ÿY`ÿ^i ÿjr6ÿ{‚Wÿ˜ ÿÁĵÿãæÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú÷ï õßÓƒæõÿð¯šÿþ¥rÿÿ•eÿýŒZÿÿ‰Xÿÿ†Sÿÿ†Sÿþ‰Rÿú‰QÿùŠRÿø‰QÿþˆTÿÿŠVÿÿ‹WÿÿŒXÿþŽYÿý‘[ÿû“^ÿþ–aÿü–aÿÿ›jÿú¢sÿõ®ˆÿî½ÿÖ¶Ÿÿ­‘ÿ¤ ŸÿÁÄÉÿæéî2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÔÙØ€ª¯®ÿ’‰ÿž£Žÿ™ uÿ‹“Wÿ{…2ÿqw%ÿop ÿklÿhhÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ^aÿ_`ÿ^_ÿ]^ÿ]^ÿ[bÿbm$ÿpx<ÿˆ]ÿ ¨‰ÿÌÏÀÿëîå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñåßYÛÈÀÿⱡÿù¨{ÿÿ–jÿù^ÿÿˆWÿÿ‡Qÿÿ‡Qÿÿ‰Qÿü‰PÿûŠRÿú‰Qÿý‡SÿÿŠVÿÿŒWÿÿŒWÿüYÿû‘[ÿü•^ÿý–_ÿü—`ÿÿiÿþ¢oÿø¨ÿþ·•ÿõ¿¦ÿÑ°¡ÿšŠ„ÿ¨­¬ÿÓÚ݃åîñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîñö Ýàåc½ÁÂÿ›¢›ÿŒ—}ÿ¤¬ƒÿ—¢dÿˆCÿy‚'ÿsxÿoqÿkkÿiiÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ]`ÿ\_ÿ\_ÿ\_ÿ\_ÿ[dÿdo)ÿr{Bÿ†Žeÿª±–ÿÖ×Íšòóï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ëå;ãÐÈÿè·§ÿþ­€ÿÿšnÿû`ÿÿ‰Xÿÿ‡Qÿÿ‡Qÿÿ‰QÿûˆOÿûŠRÿú‰Qÿý‡Sÿÿ‰UÿÿŒWÿÿŒWÿüYÿû‘[ÿý–_ÿü•^ÿý˜aÿÿžjÿþ¢oÿô¤{ÿù²ÿø©ÿÛº«ÿ˜ˆ‚ÿ•š™ÿ¼ÃÆÿØáäyïøû ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéî2ÏÒ×ÿ ¤¥ÿŽ•Žÿ‘œ‚ÿ¡©€ÿ’_ÿƒ‹>ÿu~#ÿqvÿoqÿllÿiiÿhhÿdfÿacÿ]aÿ]aÿ]`ÿ]`ÿ]`ÿ]`ÿ\_ÿ\_ÿ\_ÿ]`ÿ^gÿfq+ÿxHÿ‘™pÿ¸¿¤ÿâãÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôóï àÚÕ€Û¸ÿö²ÿþŸwÿõ’fÿýŠ]ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿþ•\ÿÿ–]ÿþ›aÿýgÿÿ¡lÿÿ£vÿÿ«†ÿÿ»Ÿÿñ¿©ÿ¾¡“ÿ”“‰ÿ¤©§ÿÇÒÐÿâëîEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕØà€¶¹ÁÿŽ”“ÿŒ”ƒÿŸ«ÿ¨jÿŒšHÿŠ0ÿx|ÿswÿoqÿllÿgjÿfiÿdfÿacÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ\^ÿZ^ÿ[_ÿ\`ÿ^bÿ_j$ÿgt6ÿˆUÿ §„ÿÇϸÿëíç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæàÛnâÉ¿ÿú¶‘ÿÿ¢zÿ÷”hÿþ‹^ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿý”[ÿÿ—^ÿÿœbÿüœfÿÿ¡lÿÿ¥xÿÿ¨ƒÿý³—ÿóÁ«ÿÙ¼®ÿ‘†ÿ”’ÿ·ÂÀÿÓÜ߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçìë2ÄÇÏÊž¡©ÿŒ’‘ÿ˜‡ÿ§³‰ÿ• bÿ„’@ÿ~‡-ÿw{ÿtxÿoqÿllÿhkÿfiÿceÿ`bÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ[]ÿZ^ÿ[_ÿ]aÿ_cÿcn(ÿly;ÿ‡]ÿ«²ÿÒÚÃÜòôî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÙÕÐÿ黣ÿ÷©…ÿî™sÿù‘fÿÿŠWÿÿˆQÿÿ‰Nÿÿ‰NÿýŠQÿüˆSÿý‡Tÿÿ‰VÿÿŒWÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿŸoÿÿ§zÿÿ®‰ÿÿ¿žÿù˳ÿ¹¦‘ÿ“‚ÿ¦© ÿÊÊÊ¥ìåê;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëðîÒ×Õƒ³¸·ÿ€…„ÿ’™Šÿ«±Žÿ£¬sÿŽ–Iÿ…Ž3ÿ~ƒ(ÿvwÿvwÿnr ÿknÿhkÿehÿcfÿbcÿ`aÿ__ÿ\^ÿ^`ÿ[_ÿ[_ÿ\_ÿZ]ÿZ_ÿaf!ÿ`l0ÿv‚RÿŒ—oÿ¶½¢ÿáèÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòð àÜ×~îÀ¨ÿû­‰ÿòwÿû“hÿÿŒYÿÿˆQÿÿ‰NÿÿˆMÿýŠQÿüˆSÿý‡Tÿÿ‰Vÿÿ‹VÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿžnÿÿ¦yÿÿ­ˆÿú·–ÿöÈ°ÿ×įÿœ–‹ÿŠ„ÿ­­­ÿÕÎÓöïô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñï Üáßc¼Á¿ÿ‘–•ÿ’‘ÿ›¢“ÿ¦¬‰ÿ™¢iÿˆCÿŠ/ÿ|&ÿvwÿuvÿnr ÿknÿgjÿdgÿcfÿabÿ`aÿ^^ÿ]_ÿ^`ÿ[_ÿZ^ÿ[^ÿZ]ÿZ_ÿch#ÿht8ÿ~ŠZÿš¥}ÿÇγÿìóä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãèçEåɸÿæµ›ÿ棄ÿî™qÿû_ÿü‹Sÿý‰NÿüˆMÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿŒUÿýSÿü’Uÿÿ“]ÿü•^ÿþ™bÿÿžfÿÿ hÿþ¡iÿÿ¦qÿÿ­ÿý±‡ÿÿžÿÿѲÿέ™ÿ›‹{ÿ‘ÿ¼±³ÿàÚÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàààOÊÏÍÿ™¡–ÿxpÿœ£ˆÿ®µŠÿ¦ªoÿ”™Nÿ†Œ5ÿ€†'ÿ}~ ÿwxÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ^^ÿ]_ÿ]_ÿZ]ÿZ]ÿY^ÿX]ÿ\dÿfn(ÿoyJÿ†Žoÿ©²—ÿ×ÝÊ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìñððÔÃÜﾤÿíª‹ÿòuÿý‘aÿýŒTÿÿ‹PÿþŠOÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿ‹TÿýSÿü’Uÿþ’\ÿü•^ÿþ™bÿÿžfÿÿŸgÿþ¡iÿÿ¥pÿÿª|ÿú®„ÿú¼˜ÿóŦÿçƲÿµ¥•ÿ}ÿ¤™›ÿ¼½ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáàäOÒÒÒƒ¬±¯ÿyvÿ†wÿ¦­’ÿ¯¶‹ÿ›Ÿdÿ‰ŽCÿ‚ˆ1ÿ}ƒ$ÿ{|ÿxyÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ__ÿ\^ÿ]_ÿZ]ÿ[^ÿZ_ÿZ_ÿ`h"ÿmu/ÿx‚Sÿ“›|ÿ»Ä©ÿåëØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæÝÔ€äƵÿã°–ÿè ~ÿò“gÿùWÿÿQÿþŒPÿþ‹RÿüˆSÿý†UÿÿˆWÿÿ‰Vÿÿ‹TÿÿQÿþ‘Sÿþ\ÿþ”_ÿÿ˜aÿÿœeÿûŸdÿú¢fÿù¨kÿû¬sÿÿ±|ÿÿ¹‹ÿÿ½—ÿÿαÿ廨ÿ§Šÿ“ˆ„ÿ¢žÿÇÇǽççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíØ×Ù~·¶¸ÿ‡‰ƒÿ|‚oÿ¢¬‚ÿ¶½„ÿ«µhÿ—DÿŠŽ.ÿˆ‰)ÿ€€"ÿ{{ÿvzÿrtÿlqÿjmÿfjÿdgÿcfÿbcÿ`aÿ__ÿ\^ÿ\^ÿZ]ÿ[^ÿY`ÿY`ÿaj'ÿpy6ÿ…fÿ¡§”ÿÍÕÄÊðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñèßYïÑÀì븞ÿ暈ÿö—kÿûYÿÿQÿý‹Oÿþ‹RÿüˆSÿý†Uÿþ‡Vÿÿ‰VÿÿŠSÿÿŽPÿþ‘Sÿþ\ÿý“^ÿþ—`ÿþšcÿúžcÿú¢fÿù¨kÿùªqÿÿ±|ÿý°‚ÿÿ¼–ÿÿŨÿôÊ·ÿα¨ÿ’‡ƒÿ‚~}ÿ¨¨¨ÿÎÎÎêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÔÓƒ¾½¿ÿŽÿuwqÿ£ÿ·Á—ÿ¬³zÿ›¥XÿŽ”;ÿ‡‹+ÿ‡ˆ(ÿ!ÿ{{ÿvzÿrtÿkpÿilÿeiÿcfÿbeÿabÿ`aÿ__ÿ]_ÿ\^ÿZ]ÿ\_ÿZaÿ[bÿen+ÿx>ÿŒ’sÿµ»¨ÿÞæÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìßщìıÿò²“ÿø¡uÿü”_ÿûUÿûŠQÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿþ˜cÿùbÿö£fÿôªjÿ÷­mÿÿ±vÿþ­zÿÿ¶Œÿÿº›ÿÿ˵ÿ÷ÐÂÿ±¨žÿ„}ÿŠŠŠÿ§§§ÿÌÌÌšâââEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÜÝÔ€´µ¬ÿ’’’ÿyyyÿ‰‚ÿ·½žÿ´À†ÿœ¨Vÿ’ 6ÿ”+ÿŠ‹#ÿ…†ÿ}~ÿ{{ÿvzÿqsÿjoÿgjÿdhÿbeÿadÿ`aÿ_`ÿ^^ÿ^_ÿ]^ÿ[^ÿ]`ÿ\c ÿah%ÿox5ÿ…ŽKÿ¡¥’ÿÌÒǽêòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöéÛnöλÿü¼ÿÿ¨|ÿÿ™dÿý‘Wÿü‹Rÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿý—bÿøœaÿö£fÿôªjÿ÷­mÿý¯tÿÿ²ÿÿ°†ÿÿ¶—ÿû¿©ÿöÏÁÿØÏÅÿ¥¢žÿtttÿ†††ÿ­­­ÿËËË¥ççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÙÙÙy¸¹°ÿž•ÿrrrÿÿ¦ªŸÿ°¶—ÿ£¯uÿ” NÿŠ˜.ÿ’)ÿ‰Š"ÿ‚ÿ{|ÿ{{ÿuyÿprÿinÿfiÿcgÿadÿ`cÿ_`ÿ^_ÿ]]ÿ^_ÿ]^ÿ[^ÿ^aÿ`g$ÿgn+ÿy‚?ÿ‘šWÿ¸¼©ÿàæÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìÿÿÞñöYíÙÔÿðijÿô®‘ÿú›sÿõ’`ÿûYÿû‹VÿÿˆTÿÿ‡Uÿÿ†Tÿÿ†RÿþˆTÿúUÿøSÿþ[ÿÿ]ÿÿ’_ÿþ•bÿüšdÿüŸhÿý¥iÿü©lÿÿ¯rÿý°wÿü´~ÿþ¸‰ÿÿ¿–ÿÿƤÿÿήÿÿлÿ©š‘ÿ‡zxÿ“‡…ÿ²ª«ÿÐÊË¥áÝâcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêæì2ÓÏÛ¿»Çÿ•”˜ÿtwnÿƒjÿ­´‡ÿ¿Ç†ÿ®¹cÿ¨Bÿ—8ÿŽ’+ÿˆŒ%ÿ‚„$ÿ€$ÿy{!ÿuv ÿorÿiqÿbnÿ`lÿ`fÿ``ÿ`] ÿc[ÿc]ÿc^ÿ\] ÿ`fÿYbÿVdÿ_m+ÿdr<ÿu…Uÿ˜¡†ÿÏÏÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëþÿåøý;ùåàOúνÿý·šÿÿ¥}ÿþ›iÿÿ‘]ÿüŒWÿÿˆTÿÿ‡Uÿÿ‡Uÿÿ‡Sÿÿ‰UÿúUÿøSÿýŒZÿÿŽ\ÿþ‘^ÿý”aÿû™cÿúfÿü¤hÿû¨kÿü¬oÿú­tÿù±{ÿûµ†ÿúº‘ÿÿÀžÿÿȨÿÿ˶ÿѹÿ¥˜–ÿymkÿ‰‚ÿ«¥¦ÿÏËÐ¥ÜÛßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêçé2ØÔÚ€µ±½ÿ•‘ÿlkoÿ‚yÿ¥©ÿ¹À“ÿ±¹xÿ «Uÿ—¢<ÿ’˜3ÿ‹(ÿ†Š#ÿ€‚"ÿ}~"ÿxz ÿtuÿnqÿhpÿbnÿ`lÿ_eÿ``ÿ`] ÿc[ÿc]ÿb]ÿ`aÿ_eÿYbÿZhÿes1ÿkyCÿƒ“cÿ¯¸ÿÞÞÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÜЉîÄ­ÿð°‘ÿïžxÿøeÿþŒ]ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿþŒWÿüŠUÿþ‹XÿÿZÿþ\ÿý“^ÿü–aÿüšdÿüŸgÿý¤kÿþªpÿþ­sÿþ°{ÿû´‚ÿú·Šÿú¾”ÿÿÆžÿÿɬÿý×ÅÿÛ¿´ÿ«†ÿƒpiÿ‚~ÿ¤ Ÿÿ»¿Àÿ×ÛÜ~ëðñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïíóáàâOÊËǽª­¤ÿ‡Žÿr{fÿ~‚eÿ¦ªÿ¿Ç’ÿ¸Â|ÿ£­Zÿ˜¤@ÿ’œ1ÿ‹‘&ÿ‰#ÿ„‡ ÿ~€ ÿ|{#ÿux"ÿqs!ÿkoÿimÿbjÿaiÿ_dÿ`^ÿa\ÿa\ÿ`]ÿ_]ÿ_bÿ]cÿXbÿal&ÿnyAÿx‚Wÿ™¤„ÿÌÒ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëßYýÓ¼ÿúº›ÿõ¤~ÿý•jÿÿŽ_ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿý‹VÿúˆSÿýŠWÿÿŒYÿý[ÿü’]ÿú”_ÿû™cÿûžfÿû¢iÿý©oÿþ­sÿþ°{ÿù²€ÿ÷´‡ÿöºÿþÁ™ÿüħÿò̺ÿìÐÅÿæËÁÿ®›”ÿ„yuÿwsrÿ•™šÿ®²³ÿÉÎÏ°Üáâcéîí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæãìEÕÓÙƒÁÀÂÿ¡¢žÿ‚yÿqxkÿw€kÿ°´—ÿ¼À—ÿµ½ˆÿ£­gÿ˜¢Oÿ‘9ÿ‹•*ÿˆŽ#ÿ‡‹!ÿƒ†ÿ}ÿ{z"ÿtw!ÿpr ÿimÿgkÿaiÿ`hÿ^cÿ`^ÿa\ÿ`[ÿ_\ÿ^\ÿ_bÿ^dÿ^hÿit.ÿz…MÿŒ–kÿ²½ÿãéÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéåÚnçɶÿè°—ÿô£‚ÿø’hÿú‹[ÿúˆSÿû‰TÿúˆSÿû‰TÿÿˆVÿÿ†Tÿÿ‹TÿÿŒUÿÿZÿþ‘[ÿý“^ÿü–aÿÿ›eÿþžhÿÿ¤lÿÿ©pÿÿ®uÿý¯zÿø²}ÿù¶…ÿû¾Œÿþ˜ÿûàÿÿϳÿÿÖ¾ÿðϼÿ®™Šÿƒxpÿxtoÿ‡Šˆÿ¤«¨ÿÁÆÇÿ×ÜÝ~ãåæEîðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñöíèìç2ÛÜànÏÐÔº¹½ÿ˜—›ÿvwmÿko\ÿ†Œuÿ¬´ŒÿÅ͆ÿ¿Èqÿ­¸\ÿŸ©Eÿ—¢4ÿ‘™'ÿ‹’ÿ‰ÿ‡Œÿ‚„ ÿ}~ ÿzy#ÿsv!ÿnoÿflÿdhÿaeÿ`cÿ`aÿ_^ÿ_]ÿ^\ÿ]^ÿ]^ÿ[_ÿ^gÿbl)ÿlw?ÿ„Ždÿ¢«‘ÿËÒÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöòç2õ×ÄÊô¼£ÿý¬‹ÿÿšpÿÿ`ÿý‹VÿüŠUÿû‰Tÿû‰TÿÿˆVÿÿ†TÿþŠSÿÿŒUÿÿŽYÿýZÿü’]ÿú”_ÿý™cÿüœfÿÿ£kÿÿ§nÿý¬sÿü®yÿø²}ÿøµ„ÿù¼Šÿú¾”ÿùÁžÿûÉ­ÿ÷˳ÿôÓÀÿäÏÀÿ´©¡ÿ~zuÿgjhÿx|ÿ•š›ÿ²·¸ÿÈÊËÿÖØÙ~éæè2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöúï ðôé(âçÞYÓ×Òÿ¹º¾ÿ¦§«ÿŠ‰ÿqptÿstjÿŒ}ÿ«±šÿÁÉ¡ÿ¶¾wÿ®·`ÿŸªNÿ•Ÿ;ÿš,ÿ—%ÿ‹’ÿ†ÿ…Šÿ€‚ÿ{|ÿxw!ÿqtÿmnÿdjÿbfÿ`dÿ_bÿ_`ÿ_^ÿ_]ÿ_]ÿ^_ÿ^_ÿ\`ÿaj!ÿhr/ÿu€Hÿ•Ÿuÿ¼Å«ÿáèÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéàOå̼ÿ趟ÿð¦‚ÿû˜lÿüZÿÿXÿÿŠSÿÿŠSÿÿ‰VÿþˆUÿþŠQÿÿŒSÿÿŒUÿþŽZÿýŽ\ÿü‘^ÿÿ•bÿÿ™eÿÿ iÿÿ¤lÿÿ©pÿÿ®tÿþ±xÿÿ¶|ÿþ¼ÿþ¾‡ÿÿÂÿÿÆšÿÿͤÿ÷ʨÿÿãÉÿîÓ¿ÿ®ÿ‘‚yÿsjaÿuojÿ‰…€ÿ¥£¢ÿº»¹ÿÍÌΚÞßãYëìðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîòíáçâOÔÚÕÿÀÄÅÿ«¯°ÿ•—˜ÿ{xzÿgd_ÿzxfÿ¨©‡ÿÉËÿÃÇ“ÿ³ºqÿ±»Qÿ§­@ÿ¤5ÿ•ž*ÿ—"ÿŽ–!ÿŽ“ ÿ„‡ÿ‚†ÿ}~ÿuwÿsr!ÿlpÿhkÿciÿaeÿbcÿ``ÿ__ÿ^^ÿ\_ÿ]`ÿ[bÿ[bÿ]eÿdm.ÿp{Cÿˆ‘iÿ¯¶›ÿÖÜщïòö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøßÏöÄ­ÿ÷­‰ÿÿqÿÿ”^ÿÿZÿÿŒUÿÿŠSÿÿŠWÿÿ‰Vÿý‰Pÿÿ‹Rÿÿ‹TÿýYÿü[ÿû]ÿþ“`ÿý—cÿÿfÿÿ hÿþ¥lÿþªpÿü¯vÿý´zÿú¸}ÿù¹‚ÿü½Šÿú½‘ÿýÇžÿýЮÿïÊ°ÿ÷ÜÈÿîÚÉÿÏÀ·ÿ§ž•ÿ|vqÿgc^ÿrpoÿ†‡…ÿ Ÿ¡ÿ¼½ÁÿÏÐÔãâæEêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíáåàOÓ×Òƒ¿ÅÀÿ«±¬ÿ“”ÿuyzÿdfgÿgdfÿ}zuÿ©§•ÿÇȦÿÆÈšÿ²¶‚ÿª±hÿ£­Cÿš 3ÿ˜Ÿ0ÿ— ,ÿ• ÿˆÿ‹ÿ†‰ÿ€„ÿ{|ÿrtÿpoÿjnÿfiÿagÿ`dÿabÿ``ÿ^^ÿ^^ÿ\_ÿ^aÿ[bÿ\cÿfn'ÿmv7ÿ~‰QÿŸ¨€ÿÊѶÿìòç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðïå;ðÚÈÿë¿¢ÿﮈÿõšmÿý]ÿÿYÿÿYÿýYÿüŒXÿü‰Pÿþ‹RÿüUÿýYÿûŒZÿü[ÿý]ÿÿ’_ÿÿ™cÿÿfÿÿ¢hÿÿ§lÿÿ¬oÿÿ°sÿÿ¶zÿÿº~ÿü½€ÿýÁ†ÿýÃÿþŘÿüÉ¡ÿÿϯÿÿؽÿÿÝÊÿùØÅÿÅ«›ÿˆyÿ…wkÿtkbÿvsnÿ‘‹ÿ¡¤¢ÿº¹½ÿÈÇ˽×ØÜ~âãçEæéí2ìïóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçæê2ÔÝЉÎ×Ê¥¿ÅÀÿ¤§«ÿ”•Ÿÿ‚~‰ÿfclÿnhmÿxvlÿ™˜~ÿ¿¿‘ÿÎÏ‘ÿÆÊxÿ¹¾[ÿ¯·Eÿ­±@ÿ ¥2ÿšŸ,ÿ”™&ÿ‘–#ÿ“"ÿ‹Ž!ÿ†‡ÿ„„ ÿ}}ÿzyÿrsÿnmÿhlÿgjÿciÿ_cÿcdÿ_`ÿ_cÿ^bÿ\cÿZaÿW`ÿak)ÿdo1ÿu€Nÿ‘šrÿ¿Ä©ÿåëÚnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø÷íÿëÙyüгÿú¹“ÿû sÿÿ–cÿÿ’^ÿÿŽZÿþŽZÿÿ\ÿÿŒSÿþ‹RÿùŠRÿù‰UÿùŠXÿü[ÿý]ÿÿ’_ÿÿ—aÿÿ›dÿÿ fÿÿ¥jÿþ«nÿÿ¯rÿþµyÿþ¸|ÿý¾ÿýÁ†ÿýÃÿüÖÿ÷Äœÿ÷Ʀÿù̱ÿ÷ϼÿûÚÇÿòØÈÿéÔÅÿÅ·«ÿŒƒzÿjgbÿlpjÿx{yÿŒÿ£¢¦ÿ¸¹½ÿÂÃÇÿÊÍÑÿÙÜàyâçèEãèéEêïðíòóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëêîæåé;ßÞâYÒÑÕ‰ÆÅÉÊÀɼÿ£¬Ÿÿ•›–ÿƒ†Šÿijtÿ_[fÿifoÿŒ†‹ÿ¾¼²ÿÅĪÿÉÉ›ÿÂÃ…ÿ¶ºhÿ¬±Nÿ£«9ÿŸ£2ÿ› -ÿ–›(ÿ‘–#ÿŽ“ ÿ‹ÿ†‰ÿ‚ƒÿ€€ÿxxÿutÿopÿnmÿimÿfiÿ`fÿ]aÿ^_ÿ^_ÿ_cÿ\`ÿ[bÿ^eÿ]fÿeo-ÿq|>ÿ‰”bÿ­¶ŽÿÚßÄÊõûêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïæÒƒìÈ°ÿæ«‹ÿòœxÿù•kÿø^ÿ÷Zÿÿ“_ÿÿ’\ÿûŽXÿö‰Uÿõ‡Wÿ÷‰Yÿû]ÿý]ÿþ‘^ÿÿ–]ÿÿ™`ÿÿbÿÿ¢fÿÿ¦kÿÿ«oÿÿ°vÿÿµzÿþ»~ÿþ¿‚ÿÿˆÿÿÄŽÿÿÓÿÿÆ™ÿÿÈ ÿÿ̧ÿÿÑ­ÿÿÕ´ÿÿÞÂÿýÞÅÿâʶÿ½­œÿŒ†sÿaXNÿe\Yÿypmÿ‰†ÿ¡š—ÿª¦¥ÿ´µ³ÿÁÄÂÿÊÍËÿÎÓÒÿÒ×ÖƒÙÞÝyÞãâYãçèEæêë2êîïìðñðïëðïëìíëëìêíííïïï éëì(ãåæEàâãOÚÜÝnÖÖÖ~ÐÐЉÊËÉÿ½¾¼ÿ®­©ÿ Ÿ›ÿ‹‹‘ÿssyÿdfgÿWUTÿa_Wÿ™™ÿÄÅžÿÇÊ“ÿÏÔ‰ÿÉÐuÿ¿Æ]ÿ´¼Gÿ¬³:ÿª®1ÿ¥¨*ÿ £%ÿ˜œ+ÿ”—*ÿ“&ÿŽ&ÿ†ˆ$ÿ‚"ÿ}|!ÿ|z"ÿvw!ÿpoÿikÿggÿdgÿbeÿ_dÿ`dÿ]^ÿ`aÿ`dÿX_ÿXaÿ[f ÿ_h)ÿgp=ÿz„Yÿ ¦‡ÿÉϸÿñòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøä;ÿÜÄÊù¾žÿþ¨„ÿÿ›qÿû’aÿù‘\ÿÿ”`ÿÿ—aÿÿ”^ÿûŽZÿøŠZÿøŠZÿúŒ\ÿü\ÿý]ÿÿ”[ÿÿ–]ÿÿš_ÿÿžbÿü¢gÿþ¨lÿÿ­sÿý±vÿú·zÿú»~ÿþ¾„ÿÿÁ‹ÿÿÁ‘ÿÿÄ—ÿÿÆžÿÿɤÿÿÕ±ÿþÑ°ÿøѵÿøÙÀÿùáÍÿîÞÍÿÇÁ®ÿž•‹ÿ›’ÿtkhÿWPMÿ_XUÿtpoÿ‚€ÿ“‘ÿ¡¤¢ÿ¦«ªÿ¬±°ÿµº¹ÿ¾ÃÂÿÅÉÊÿÉÍÎÿÍÑÒÿÏÓÔÿÔÓÏÿÕÔÐÿÓÔÒÿÒÓÑÿÓÓÓÿÓÓÓÿÉËÌÿÀÂÃÿ¾ÀÁÿ³µ¶ÿ©©©ÿ¢¢¢ÿ—˜–ÿ†‡…ÿvuqÿkjfÿTTZÿZZ`ÿwyzÿ“‘ÿ£¡™ÿÀÀ¨ÿÎϨÿÁÄÿ¶»pÿ³º_ÿ®µLÿ¨°;ÿ£ª1ÿ£§*ÿ¡¤&ÿž¡#ÿ”˜'ÿ‘”'ÿŽ‘$ÿ‹Œ$ÿ„†"ÿ~ÿzyÿzx ÿtuÿonÿhjÿggÿcfÿ_bÿ^cÿbfÿcdÿbcÿbfÿ[bÿ[dÿ_j$ÿir3ÿy‚Oÿ“rÿ½Ã¤ÿáçЉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõðç2ëÖǽ廤ÿ榇ÿî™qÿý“dÿû‘bÿÿ˜gÿÿ—fÿþ”eÿúaÿù]ÿ÷‹[ÿùŒXÿùŒXÿþ‘Yÿÿ’Zÿÿ—\ÿþš_ÿÿžfÿÿ¡lÿÿ¦sÿý©uÿÿ³zÿÿ¶|ÿÿºÿÿ½„ÿÿ¿ˆÿÿŠÿÿÆŽÿÿÈ”ÿüÆ‘ÿþË™ÿÿÑ¡ÿüЧÿùÓ°ÿÿÜÀÿÿæÎÿÿèÓÿåË»ÿ´œÿ’znÿ‹xkÿ‡wjÿsg]ÿj`Vÿnf_ÿrpfÿzvqÿ†ƒ~ÿ’Žÿš–•ÿžš™ÿ œ›ÿ¡œÿ¥£¢ÿ§¥¤ÿ¥¦¤ÿ¡¢ ÿžŸÿ›œšÿ“—’ÿŒ‹ÿƒ‡ÿ{vÿswkÿkq`ÿciVÿ`fSÿfnWÿsv`ÿzzhÿ‰wÿ®¯ÿÑÕ¡ÿØÞ—ÿÊÓxÿÁËaÿ¾ÉOÿ´Â>ÿ±¼8ÿ«³0ÿ¤¬)ÿŸ¥(ÿ› 'ÿ˜›'ÿ—™(ÿŽ”%ÿ‹%ÿˆ‹$ÿ…†$ÿ€"ÿyyÿtuÿsr!ÿkmÿjjÿgjÿghÿdfÿ`aÿ``ÿccÿgi#ÿacÿ`dÿ]eÿ_h%ÿdm5ÿu|Oÿ‘˜wÿ¸½¨ÿÞßÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÛnúйÿö¶—ÿø£{ÿÿ—hÿúaÿÿ–eÿÿ—fÿÿ—hÿÿ•fÿý‘aÿù]ÿùŒXÿø‹WÿýXÿþ‘Yÿü”Yÿû—\ÿü›cÿüžiÿû¢oÿù¥qÿü¯vÿü³yÿþ·~ÿýºÿþ½†ÿþÁ‰ÿÿÅÿÿÇ“ÿÿÉ”ÿþË™ÿýÏŸÿüЧÿöЭÿôϳÿôÒºÿõÖÁÿ÷ÝÍÿõÝÑÿöÞÒÿæÓÆÿ¿¯¢ÿŽ‚xÿpf\ÿf^Wÿig]ÿkgbÿmjeÿokjÿqmlÿuqpÿyutÿ|xwÿtrqÿusrÿstrÿrsqÿpqoÿpqoÿptoÿqupÿhlfÿek`ÿ`dXÿY_NÿZ`Mÿoubÿ–ž‡ÿº½§ÿÍÍ»ÿÓϽÿÄÅ¥ÿ¼ÀŒÿ¼Â{ÿ·Àeÿ°ºPÿ§²8ÿ¥³/ÿ¢­)ÿž¦#ÿœ¤!ÿ£&ÿ› 'ÿ—š&ÿ“•$ÿ‹‘"ÿˆŒ"ÿ„‡ ÿ‚ƒ!ÿ}~ ÿxxÿrsÿqpÿkmÿiiÿcfÿabÿacÿcdÿhh"ÿkk%ÿjl&ÿacÿaeÿai"ÿen+ÿmv>ÿ†`ÿ«²‘ÿØÝÈ°õöíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçÚnòζÿô³”ÿÿsÿÿ”jÿú“fÿü•hÿÿ˜kÿÿ™lÿÿ™iÿþ•bÿü’]ÿýXÿý‘Wÿý‘Wÿý’Xÿû”]ÿü˜bÿü›iÿûoÿú qÿþ¨rÿþ¬uÿþ±yÿÿ¶~ÿü½ÿýÁ…ÿúLjÿýÊ‹ÿüÌŒÿýÍÿüÌ’ÿÿÍ›ÿÿѦÿÿϬÿÿбÿÿÔ¸ÿùÓ»ÿüÙÅÿÿÞÇÿùÙÆÿîÓ¿ÿæͽÿß˺ÿØǺÿɹ¬ÿº®¤ÿ¥›‘ÿŽ‚|ÿxngÿk_]ÿeZVÿcWWÿ\ZZÿZXXÿWWWÿZZZÿ[\Xÿ\]Yÿ`d^ÿgmbÿ†wÿ‘š†ÿª³™ÿ·Á£ÿ¸Ã¢ÿ·ÄžÿºÈŸÿÃÍ¢ÿÃЀÿÈÔpÿ½Ëaÿ½ÊWÿ¸ÆHÿ­¹7ÿ­µ2ÿ«°-ÿ©«0ÿ¤¤.ÿ Ÿ/ÿ Ÿ/ÿœ¡.ÿ—œ)ÿŽ™ÿŠ•ÿˆÿ„‰ ÿ}„ÿ{€ÿy| ÿuwÿorÿnoÿilÿfhÿ`bÿ]^ÿcdÿnm)ÿsq0ÿsq0ÿfi$ÿadÿcg%ÿfn/ÿqy=ÿ‚Š[ÿ¤©‰ÿÍÒ½ÿìîè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþøëÿâÊ¥ÿ£ÿÿ¨~ÿÿžtÿú“fÿü•hÿÿ˜kÿÿœoÿÿŸoÿÿjÿÿ™dÿÿ”\ÿý‘WÿüVÿü‘Wÿú“\ÿú–`ÿú™gÿúœnÿøžoÿú¤nÿú¨qÿû®vÿý³{ÿùº~ÿù½ÿõƒÿöÄÿúÊŠÿýÍÿüÌ’ÿýʘÿþË ÿþÈ¥ÿýǨÿþÌ°ÿõÏ·ÿóмÿõÓ¼ÿóÓÀÿõÚÆÿùàÐÿ÷ãÒÿðßÒÿêÚÍÿáÕËÿÖÌÂÿË¿¹ÿÁ·°ÿ»¯­ÿº¯«ÿ»¯¯ÿ³±±ÿ­««ÿ¨¨¨ÿªªªÿ¨©¥ÿ¥¦¢ÿ¥©£ÿ¬²§ÿ°·¨ÿµ¾ªÿ¾Ç­ÿÁË­ÿÁÌ«ÿ¼É£ÿµÃšÿ²¼‘ÿ¶Ãsÿ¸Ä`ÿ¬ºPÿ¬¹Fÿ¦´6ÿ¥±/ÿ­µ2ÿ¤©&ÿ£¥*ÿ¡¡+ÿž-ÿœ›+ÿ”™&ÿ”!ÿ‹–ÿŒ—ÿ…ÿ„ÿxÿv{ÿuxÿrtÿloÿjkÿbeÿbdÿacÿdeÿop(ÿ{z6ÿyw6ÿpn-ÿ`cÿadÿhl*ÿnv7ÿ‰Mÿž¦wÿÆË«ÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôìöÞØyÚÀ¹ÿТšÿý¢kÿøfÿò™gÿ÷œoÿýyÿÿ›xÿÿ›yÿÿœzÿÿ—nÿþ•iÿó“^ÿïXÿó’Xÿû—]ÿÿ˜_ÿÿ˜_ÿÿžjÿÿ£nÿÿ¨qÿÿ¬uÿÿ°xÿÿ³{ÿÿ¸}ÿÿ»ÿÿÀ…ÿÿÇÿÿÈ‹ÿÿÊ‘ÿüÍ•ÿûЗÿúÒ˜ÿûÓ™ÿþÒÿÿÒ¢ÿÿÖ¥ÿÿתÿÿÙ­ÿÿÙ²ÿÿÚ³ÿÿÚ·ÿÿÞ»ÿÿß¾ÿÿàÂÿÿáÊÿþãÏÿýã×ÿûäÜÿøäßÿóäáÿñâßÿòæÚÿïèÏÿêäÁÿåã³ÿàâ§ÿÛÝ—ÿÕ؈ÿÓÕ|ÿÑÔqÿÐÒhÿÈÌ[ÿÆÈPÿÁÄFÿº½?ÿ»½Aÿ¶¸<ÿ°²6ÿ¬®2ÿ©«0ÿ§©.ÿ¤§,ÿ¢¤-ÿ¢¦/ÿž¡.ÿ—›*ÿ”—*ÿ’”*ÿ‘*ÿ‹Œ%ÿ‡†$ÿ}€*ÿwz$ÿqvÿpuÿltÿiqÿenÿekÿ`eÿeg%ÿkl.ÿst6ÿ{|<ÿ|}=ÿor-ÿ_cÿMeÿZr$ÿav8ÿw†Zÿš¤†ÿÀĸÿåèæ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõï ÷ÝÖ~ë½µÿÿ²{ÿÿ¦oÿô›iÿõšmÿýyÿÿž{ÿÿ{ÿÿ{ÿÿžuÿÿžrÿþžiÿ÷˜`ÿõ”Zÿø”Zÿÿ”[ÿÿ•\ÿþ›gÿüžiÿÿ¢kÿÿ¦oÿÿ«sÿÿ°xÿÿ·|ÿÿ»ÿÿ¾ƒÿÿÀ„ÿûćÿûÆÿ÷ÈÿöË’ÿöΔÿøЖÿúΙÿûÍÿùПÿûѤÿùÒ¦ÿûÒ«ÿúÓ¬ÿûÓ°ÿý×´ÿûØ·ÿûÙ»ÿúÚÃÿøÝÉÿøÞÒÿöß×ÿôàÛÿïàÝÿìÝÚÿëßÓÿåÞÅÿÝ×´ÿÖÔ¤ÿÎЕÿÈÊ„ÿÀÃsÿ¾Àgÿ½À]ÿ¼¾Tÿ·»Jÿ¸ºBÿ¶¹;ÿ±´6ÿ°²6ÿ¬®2ÿ¨ª.ÿ¥§+ÿ¤¦+ÿ£¥*ÿ £(ÿŸ¡*ÿ™&ÿ˜›(ÿ”˜'ÿ‘”'ÿŒŽ$ÿ†‡ ÿ‚ƒÿ€ÿwz$ÿvy#ÿtyÿqvÿjrÿfnÿdmÿgmÿlq&ÿqs1ÿ~Aÿ‰ŠLÿ…†Fÿtu5ÿeh#ÿ_cÿ[s%ÿkƒ5ÿwŒNÿ•¤xÿ¿É«ÿäèÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóìøØÓƒîèÿí°ÿè›zÿõ”rÿÿ™sÿÿ uÿÿ¤vÿý¥vÿó©yÿó©yÿó¦xÿñ sÿ÷™nÿþ”kÿÿ’gÿÿeÿõ–dÿø™gÿúžiÿþ¢mÿÿ§pÿÿ«sÿÿ¯uÿÿ±vÿÿ·|ÿÿº~ÿÿ½‚ÿÿÁ…ÿÿĉÿÿÈÿÿÌÿÿÎ’ÿÿÍ”ÿÿ͘ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿРÿýÒŸÿþÒ£ÿüÒ£ÿýÒ§ÿýÕ«ÿüÖ´ÿûÙ¼ÿûÚÆÿýÜÌÿøÞÐÿîáÓÿëÞÐÿéáÄÿåß²ÿÙÙ™ÿÔÕ…ÿÊÐqÿÄË\ÿºÃNÿ¶¾Aÿ²»<ÿ²¸5ÿ­´.ÿ­´.ÿ®³.ÿª¯*ÿ¨¬+ÿ¦ª)ÿ¤¨'ÿ£§&ÿ¡¥'ÿ £(ÿœ¡&ÿšž'ÿ•›&ÿ“—&ÿŽ“&ÿŠŽ%ÿ†Š#ÿƒ†#ÿ€ƒ ÿ~!ÿqw ÿos!ÿkoÿhkÿghÿjj$ÿqq+ÿxv5ÿ€>ÿƒ„BÿˆŒJÿ‡‹Iÿu|9ÿbi&ÿ[d!ÿbk(ÿdv;ÿ{ˆZÿ“ zÿ»ÄªÿåêÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìç2ÿÛÀìÿÅ¥ÿö©ˆÿú™wÿÿ—qÿÿrÿÿ¤vÿÿ¨yÿõ«{ÿôªzÿô§yÿø§zÿÿ¦{ÿÿ¤{ÿÿrÿÿ–kÿ÷˜fÿ÷˜fÿöšeÿøœgÿú iÿú¥mÿüªpÿû­rÿÿ³xÿþ¶zÿý¹~ÿý¾‚ÿýÁ†ÿýÅŠÿÿÉÿÿËÿÿË’ÿÿÌ—ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿÏŸÿüÑžÿýÑ¢ÿúСÿûÐ¥ÿúÒ¨ÿúÔ²ÿù׺ÿùØÄÿüÛËÿ÷ÝÏÿîáÓÿëÞÐÿéáÄÿäÞ±ÿÖÖ–ÿÏЀÿÄÊkÿ¼ÃTÿµ¾Iÿ±¹<ÿ¬µ6ÿ­³0ÿ©°*ÿª±+ÿ¬±,ÿ©®)ÿ§«*ÿ¦ª)ÿ¤¨'ÿ£§&ÿ ¤&ÿž¡&ÿ™ž#ÿ—›$ÿ‘—"ÿŒÿ…Šÿƒ‡ÿ‚†ÿ€ƒ ÿy|ÿtuÿkqÿjnÿhlÿjmÿqr(ÿ||6ÿ……?ÿŠˆGÿNÿ‘Oÿ‡‹Iÿvz8ÿcj'ÿ^e"ÿfo,ÿqz7ÿs…Jÿ‘žpÿ¶ÃÿàéÏøýî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúîî ïÚÜníÁ´ÿë«’ÿò wÿóŸoÿ÷¥nÿüªsÿõ®|ÿôª€ÿô¨„ÿõ¨ˆÿýª‹ÿÿ«ÿÿ¨†ÿý¤ÿû£tÿø qÿñœlÿî™iÿï›gÿóŸkÿø¦oÿüªsÿü­tÿþ¯vÿÿ³zÿÿ¶}ÿÿ»ÿÿ½ÿÿÀ„ÿÿÁ…ÿþÇŠÿýÊŒÿþÍÿÿÐ’ÿþÒ“ÿþÒ“ÿþÔ“ÿþÔ“ÿþÕ–ÿÿÕšÿýÖŸÿýקÿüÙ±ÿýÜ»ÿÿàÁÿÿßÌÿòßØÿîÛÔÿìÞÂÿçÛ«ÿØÔÿÎÍrÿÃÇVÿ»À?ÿ²º1ÿ¬´+ÿª±(ÿ¨¯&ÿ¦ª)ÿ¨ª.ÿ¨ª3ÿ¥§0ÿ£¨'ÿ¢§&ÿŸ§%ÿœ¢%ÿ˜ $ÿ”š#ÿ–#ÿ“$ÿˆŽ#ÿ…‰"ÿ€„$ÿ}€$ÿw|!ÿsv ÿkqÿgkÿhpÿot)ÿxy5ÿ~Bÿ‰‚Pÿ‘ŠXÿ”ŽYÿ”ŽYÿ—–ZÿŽŽNÿ|<ÿhr,ÿ^h&ÿ_l.ÿn}@ÿ}‡Xÿ—žƒÿ½À±ÿàäØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïñ ÿÜÏÿÄ«ÿÿ°‡ÿø¤tÿô¢kÿö¤mÿö¯}ÿù¯…ÿû¯‹ÿù¬Œÿýª‹ÿÿªŒÿÿ®Œÿÿ°‹ÿÿ°ÿÿ­~ÿÿªzÿû¦vÿù¥qÿö¢nÿô¢kÿò iÿô¥lÿö§nÿø«rÿû®uÿü´xÿÿ·{ÿÿ»ÿÿ½ÿøÁ„ÿøŇÿùÈŠÿüËÿúÎÿûÏÿúÐÿûÑÿüÓ”ÿüÒ—ÿúÓœÿùÓ£ÿùÖ®ÿúÙ¸ÿýÞ¿ÿýÝÊÿïÜÕÿìÙÒÿêÜÀÿåÙ©ÿ×ÓŒÿÍÌqÿÃÇVÿ»À?ÿ¯·.ÿ©±(ÿ§®%ÿ¦­$ÿ£§&ÿ£¥)ÿ¢¤-ÿŸ¡*ÿž£"ÿ¢!ÿš¢ ÿ— ÿ’šÿŽ”ÿŠ‘ÿˆŽÿ‡ÿ€„ÿ{ÿuxÿnsÿorÿu{$ÿ{-ÿ~†3ÿ‰ŽCÿ“”Pÿ•”Xÿ˜‘_ÿ›”bÿœ–aÿš”_ÿ”“Wÿ?ÿjo*ÿcm'ÿeo-ÿkx:ÿƒ’Uÿž¨yÿÅ̱ÿéìÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêâÕ€ãγÿ⸕ÿæ¨ÿôœwÿÿ¢ÿÿ©†ÿÿ­ÿÿ°ÿú°Žÿó±Žÿò´Žÿô¶ÿÿ¶ÿÿ·ÿÿ·ÿÿ·ÿÿ¶Šÿø¯ƒÿó¨zÿî£uÿñ¥tÿò¦uÿó¨tÿô©uÿø¬wÿû¯zÿÿ³~ÿÿµ€ÿú¹‚ÿü»„ÿþ¿…ÿÿÁ‡ÿþŇÿÿljÿÿˈÿÿ̉ÿÿ΋ÿÿÍŽÿÿÎ’ÿÿÏ›ÿÿÑ¥ÿÿÔ°ÿÿÙ·ÿÿÙÂÿîÙÑÿëÖÎÿéÙ¼ÿåצÿØЊÿÐËpÿÇÆXÿ¾½Cÿ²´2ÿ¬®,ÿ§¬)ÿ¤§)ÿŸ¡)ÿž-ÿ››/ÿ——+ÿ“š'ÿ’™&ÿ•$ÿŒ‘$ÿ‡Œ#ÿ„ˆ#ÿ…&ÿ€‚(ÿuz%ÿux(ÿtx,ÿtw/ÿvz3ÿ~€>ÿŠŒJÿ“”Vÿ”œ]ÿ˜žcÿ›Ÿdÿœšdÿ›™cÿ›eÿš˜^ÿ“‘WÿEÿlq4ÿ`f+ÿfo7ÿp{Iÿ‚Ždÿ¤µŠÿÈÔ¶ÿéêæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷êûæË¥øΫÿóµŒÿû£~ÿþšwÿÿ¢ÿÿªŒÿÿ³“ÿÿ¸–ÿû¹–ÿõ·‘ÿñ³ÿÿº“ÿÿº“ÿÿº“ÿÿ»”ÿÿ¾’ÿÿ¾’ÿÿ¼ŽÿÿºŒÿý±€ÿü°ÿù®zÿö«wÿõ©tÿöªuÿø¬wÿú®yÿöµ~ÿ÷¶ÿ÷¸~ÿùº€ÿ÷¾€ÿúÁƒÿûƃÿýÈ…ÿÿʇÿÿÊ‹ÿþÊŽÿýË—ÿÿ΢ÿÿÑ­ÿÿ×µÿÿ×ÀÿëÖÎÿçÒÊÿåÕ¸ÿßÑ ÿÑɃÿÈÃhÿ¾½Oÿ¶µ;ÿ¬®,ÿ¦¨&ÿ¡¦#ÿŸ¢$ÿ›%ÿ›š*ÿ™™-ÿ••)ÿŽ•"ÿ”!ÿŠÿ†‹ÿ†ÿ~‚ÿz~ÿz|"ÿ{€+ÿ~1ÿ…‰=ÿ‘”Lÿ¡Zÿ¤¦dÿ¤¦dÿ¢£eÿž¦gÿ£hÿ›Ÿdÿ›eÿ¢ jÿ£¡kÿ—•[ÿ…ƒIÿll0ÿhm0ÿkq6ÿvGÿ‡’`ÿ¥±‡ÿÌݲÿíùÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïëàOñÐÁÿï·¤ÿö£ÿõÿùŸ|ÿÿ¬‰ÿÿº“ÿÿ¼”ÿø¼’ÿø¼’ÿ÷ºšÿõ¸˜ÿö¹™ÿù¼œÿýÀžÿþÁŸÿÿžÿÿžÿÿÂœÿÿÀšÿÿ¾—ÿûº“ÿù·Žÿô²‰ÿñ°„ÿî­ÿú¬ÿú¬ÿ÷¯€ÿø°ÿù´‚ÿý¸†ÿÿ½†ÿÿ¿ˆÿÿ¿ˆÿÿÀ‰ÿÿÀÿÿÁ•ÿÿÄžÿÿȪÿÿʵÿÿйÿèØ»ÿåÕ¸ÿáÖªÿÚÏ–ÿÊÄ{ÿÁ¼gÿ¶´Pÿªª>ÿŸ¢/ÿš*ÿ•˜%ÿ“”&ÿ“$ÿŠŽ$ÿ‡ ÿ†‹"ÿ~‚)ÿ‚-ÿ€ƒ.ÿ€1ÿ5ÿ…†>ÿŒKÿ“’Uÿ˜—]ÿ¤¢lÿ«ªwÿª¨xÿ¦¦vÿ¨¨xÿ¥¨wÿ¡¢vÿ¡wÿž¢xÿ¤©uÿ£¨kÿ¡©cÿ™¡[ÿ~†@ÿjr,ÿci0ÿkn=ÿy|Uÿ’sÿ«±˜ÿÑÙÈ°ïùé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþúï ÿêÛnÿÚǽÿ»¥ÿÿ¬Žÿú }ÿÿ¥‚ÿÿ³Œÿÿ¼”ÿþ˜ÿÿÅ›ÿü¿ŸÿýÀ ÿýÀ ÿü¿Ÿÿü¿ÿÿ ÿÿÅ¡ÿÿÇ£ÿÿÇ¡ÿÿÇ¡ÿÿÈ¡ÿÿÈ¡ÿÿÉ ÿÿÇžÿÿÇ›ÿÿÆšÿÿ»ÿÿ¹Žÿÿ¸‰ÿýµ†ÿù´‚ÿø³ÿù¶ÿù¶ÿû¸ÿü¹‚ÿú¸…ÿú¹ÿû¼–ÿþÀ¢ÿÿ­ÿþȱÿßϲÿÜ̯ÿ×Ì ÿÑÆÿÁ»rÿ·²]ÿ­«Gÿ¢¢6ÿ™œ)ÿ•˜%ÿ’•"ÿ“”&ÿ–'ÿ”*ÿ‘—*ÿ’—.ÿ”;ÿ“–Aÿ™œGÿ ¡Qÿ¥§[ÿ¬­eÿ°±oÿ³²uÿ¸·}ÿ¸¶€ÿ´³€ÿ±¯ÿ­­}ÿ¬¬|ÿª­|ÿ©ª~ÿ¥©ÿ¤¨~ÿ¬±}ÿ¨­pÿ•Wÿ~†@ÿlt.ÿks-ÿsy@ÿƒ†Uÿ›žwÿ¸½žÿÜâÉ°õýìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòãÓƒìË·ÿã³—ÿ꧆ÿò¨„ÿù¯‹ÿÿ»•ÿÿÄžÿýŨÿüħÿø¤ÿõ¿¡ÿöÁ¦ÿûÆ«ÿýÈ­ÿûÆ«ÿüÊ®ÿý˯ÿÿͯÿÿϱÿÿвÿÿвÿÿѱÿÿаÿÿÑ°ÿÿЯÿÿÏ­ÿü̪ÿø˦ÿõÈ£ÿõÇžÿôÆÿñÚÿð™ÿíÀšÿêÀÿèÀ£ÿéĪÿìdzÿêɵÿßжÿÛ̲ÿ×ʪÿÎÄœÿÀ¹ˆÿµ±wÿ¬ªjÿ£¢^ÿ››Uÿ™™Sÿš›SÿžVÿ¡¢Xÿ¥¦\ÿª«aÿ®¯eÿ¶¶zÿ¸·ÿº»ƒÿ¾½ŠÿÂÁÿÃÀ“ÿÀ¿“ÿ¾¼”ÿ¶µÿ²±‹ÿ°¯‰ÿ±°Šÿ¯°‰ÿ¬­†ÿ«¬„ÿ­®†ÿ®±Šÿ¬¯ˆÿ¥«zÿŠ“Zÿq};ÿht2ÿhv6ÿs~Fÿ†dÿ¨­ŽÿÉιÿçèßYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûëÿêÖ~ÿÓ·ÿýº™ÿó©…ÿÿô­‡ÿÿ¹“ÿþÆ©ÿÿÊ­ÿÿÌ®ÿþȪÿúŪÿûÆ«ÿüǬÿúŪÿüÊ®ÿý˯ÿþÌ®ÿÿͯÿÿϱÿÿвÿÿѱÿÿÒ²ÿÿÕ´ÿÿ׶ÿÿÚ¸ÿÿÛ¹ÿÿÜ·ÿÿÚµÿÿÙ°ÿÿ×®ÿÿدÿÿ×®ÿÿÕ¯ÿþÔ±ÿüÔ·ÿûÖ¼ÿü×ÃÿúÙÅÿîßÅÿêÛÁÿèÛ»ÿâØ°ÿØÑ ÿÑÍ“ÿËɉÿÄÃÿÅÅÿÄÄ~ÿÅÆ~ÿÈÉÿÊËÿÌ̓ÿÐчÿÓÔŠÿÍÍ‘ÿÌË“ÿÈÉ‘ÿÆÅ’ÿÃÂÿÀ½ÿ»ºŽÿ¹·ÿº¹“ÿ·¶ÿ¶µÿ¶µÿµ¶ÿ´µŽÿ´µÿ·¸ÿ´·ÿ¡¤}ÿŠ_ÿmv=ÿam+ÿlx6ÿ}‹Kÿ‘œdÿ³¼‘ÿ×ܽÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðè(õÚÌšéÁ¯ÿä®—ÿ਋ÿå©Œÿõ·™ÿÿĦÿÿгÿÿÑ´ÿÿ̯ÿþȯÿüɯÿúɳÿ÷Ë´ÿ÷Ë´ÿõʵÿ÷Ì·ÿ÷θÿúÑ»ÿúÓ½ÿûÔ¾ÿñÔ¹ÿòÕºÿó׿ÿõÙÁÿôÚÂÿôÚÂÿõÚÀÿôÙ¿ÿøÝÂÿøÝÂÿ÷ßÃÿùßÇÿ÷ãÊÿõäÏÿõèÒÿöæÙÿúæáÿöâÝÿòå×ÿîâÐÿâÝÄÿÝÙ¼ÿÙضÿÔÓ±ÿË̪ÿÊË©ÿËʨÿÊɧÿÉƧÿÆäÿÈâÿÉÄ£ÿÅÄžÿÄÃÿÂÃœÿ¿¾œÿ½¼šÿ¼ºœÿ½»ÿ½»ÿ½»œÿ»¹šÿ·¸–ÿ¸»”ÿ½Á˜ÿÁÆ™ÿ¾Ä•ÿ¸¾ÿŸ§xÿ}…VÿhrCÿirGÿr|Qÿˆeÿ• €ÿ¶¾§ÿÞçÓƒñ÷ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöè(ÿåÓƒÿйÿô¼Ÿÿ믒ÿ樊ÿì®ÿôºÿÿǪÿÿÒµÿÿÕ¼ÿÿÕ»ÿÿÒ¼ÿüйÿüйÿúϺÿúϺÿúÑ»ÿûÒ¼ÿûÔ¾ÿüÕ¿ÿöÙ¾ÿöÙ¾ÿôØÀÿôØÀÿóÙÁÿõÛÃÿøÝÃÿùÞÄÿøÝÂÿùÞÃÿùáÅÿûáÉÿøäËÿöåÐÿôçÑÿõåØÿüèãÿ÷ãÞÿóæØÿðäÒÿäßÆÿßÛ¾ÿÛÚ¸ÿ×Ö´ÿÑÒ°ÿÏЮÿÐÏ­ÿÐÏ­ÿÏÌ­ÿËÈ©ÿËÆ¥ÿËÆ¥ÿÇÆ ÿÈÇ¡ÿÇÈ¡ÿÆÅ£ÿÄáÿÃÁ£ÿÃÁ£ÿĤÿÀ¾ŸÿÁ¿ ÿÂáÿÅÈ¡ÿÇË¢ÿ½Â•ÿ¦¬}ÿ‘—hÿv~Oÿgo@ÿhrCÿ{„Yÿ– uÿ³º—ÿËÖ¶ÿæî×~øÿíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñè(òàÏùкÿþ¹˜ÿô¯Žÿî«Šÿö¶˜ÿÿƨÿÿжÿÿÓºÿÿÔ¾ÿÿÖÀÿÿÖÃÿÿÔÃÿûÕÃÿøÔÂÿøÔÂÿöÕÂÿöÕÂÿÿ×Äÿÿ×ÄÿþÖÄÿÿÕÈÿþÖÊÿÿ×ËÿÿÙÌÿÿÚÍÿÿÚËÿÿÛÌÿÿÜÊÿÿÝËÿÿßÏÿÿßÒÿþáÒÿüâÖÿùæßÿñáÚÿîãÕÿéãÐÿßÞÂÿÖÛ»ÿÐÛµÿÍزÿÈÓ­ÿÅέÿÄÌ­ÿÉ̲ÿÉ̲ÿÌÉ´ÿÌƳÿÌƳÿÊË«ÿÊË«ÿÉÉ«ÿÈȪÿÇƪÿÆÅ©ÿÅĨÿæÿÏϱÿÍάÿÈˤÿÁÅ›ÿ±·†ÿš¢mÿ€‰QÿpyAÿp|@ÿ‹Oÿ–Ÿtÿ©®ÿÃƶÿãçâEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûêÿñÛnÿÛºÿÿ˪ÿýº™ÿò²”ÿì°’ÿí´šÿø©ÿÿÑ»ÿÿÚÄÿÿÚÇÿÿÚÉÿÿÜÊÿÿÜÊÿÿÜÊÿýÜÉÿüÛÈÿÿÚÇÿÿÛÈÿÿÜÊÿÿÛÎÿÿÛÏÿÿÛÏÿÿÚÍÿÿÙÌÿÿÛÌÿÿÛÌÿÿÝËÿÿÞÌÿÿàÐÿÿáÔÿÿäÕÿÿæÚÿùæßÿñáÚÿîãÕÿêäÑÿâáÅÿÙÞ¾ÿÔß¹ÿÑܶÿÐÛµÿÌÕ´ÿÊÒ³ÿÎÑ·ÿÏÒ¸ÿÑιÿÒ̹ÿÑ˸ÿÎϯÿÌÍ­ÿËË­ÿÎΰÿÒѵÿÕÔ¸ÿÕÔ¸ÿÔÓ·ÿÑѳÿÃÄ¢ÿ°³Œÿ™sÿ‡Vÿs{FÿxIÿ†Wÿ‘aÿ¨´xÿÊÓ¨ÿâçÈ°óöæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþûìùïÝcîÜËÿçɶÿâ¹£ÿâ®—ÿð­–ÿö³œÿÿìÿÿͶÿÿÚÄÿÿáÌÿÿäÑÿúãÓÿïâÒÿíàÐÿõàÊÿõàÊÿõàÊÿöáËÿúãÍÿûäÎÿúáÍÿøßËÿûáÐÿüâÑÿüâÒÿýãÓÿþäÔÿÿæÖÿÿèØÿÿèÝÿñèÞÿïæÜÿêä×ÿçáÔÿâßÐÿßÜÍÿÙÚÆÿ×ØÄÿÓÖ½ÿÒÕ¼ÿÑÔºÿÐÓ¹ÿÏÔµÿÏÔµÿÏÔµÿÐÕ¶ÿÙÒÁÿÖϾÿÚÖ¾ÿÛؼÿÙÛ·ÿàä»ÿ×à®ÿ¾Ç•ÿ¬¸„ÿ–¢nÿ}ŠVÿuQÿrSÿvYÿŠ˜oÿ§³ÿÌÌÌšÚÚÚnìììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþìÿøç2ÿîÛnÿàÊ¥ÿ̵ÿýº£ÿô±šÿñ®—ÿù¶Ÿÿû¬ÿùÌ·ÿ÷ÖÃÿößÏÿôç×ÿøëÛÿÿêÔÿþéÓÿýèÒÿûæÐÿüåÏÿüåÏÿþåÑÿÿæÒÿüâÑÿûáÐÿûáÑÿüâÒÿþäÔÿÿç×ÿÿéÙÿÿéÞÿõìâÿôëáÿðêÝÿíçÚÿçäÕÿäáÒÿÞßËÿÝÞÊÿÚÝÄÿØÛÂÿÖÙ¿ÿÖÙ¿ÿ×ܽÿÙÞ¿ÿÚßÀÿÚßÀÿèáÐÿçàÏÿëçÏÿãàÄÿÌΪÿ¾Â™ÿ­¶„ÿ— nÿ‚ŽZÿ{‡Sÿu‚Nÿ~ŠZÿ’Ÿsÿ«¶ŽÿÂЧÿØäÀìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûïå;ïßÏêÒÀÿÝ¿¬ÿἦÿḡÿ浟ÿí»¥ÿþDzÿÿÒ¾ÿÿÙÅÿÿàÜÿÿåáÿÿëçÿÿíéÿÿìçÿÿéäÿÿèäÿÿèäÿûçâÿ÷çáÿôåâÿòçãÿñèäÿïëæÿðíèÿðíèÿöêêÿöêêÿóééÿðææÿêãàÿæßÜÿáÝØÿàÜ×ÿáàÖÿßÞÔÿààÔÿãã×ÿèèÚÿêêÜÿéêÚÿæç×ÿÝãÀÿÒصÿÉЫÿ·¾™ÿ™¢zÿ‡hÿŠbÿy„\ÿz„`ÿ‹“tÿš£‰ÿ­´ŸÿÈÏÀìâèÝcðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüìÿõãEÿéÖ~ÿàÊ¥øϸÿð¿©ÿë¹£ÿ︣ÿõº¦ÿõº¦ÿëÆÂÿóÎÊÿüÙÕÿÿâÞÿÿçâÿÿèãÿÿêæÿÿëçÿÿîéÿÿðêÿþïìÿûðìÿùðìÿõñìÿõòíÿ÷ôïÿüððÿþòòÿýóóÿüòòÿøñîÿöïìÿòîéÿòîéÿðïåÿìëáÿççÛÿååÙÿááÓÿÚÚÌÿÏÐÀÿÇȸÿ°¶“ÿž¤ÿ–qÿ†hÿ|…]ÿ}†^ÿŠ•mÿ–¡yÿ®¸”ÿÉѲÿÝæÌšéðÛnóúëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóå;ûçÖ~÷ÛÊÿøÏÀÿí±ÿë¹¥ÿï¹¢ÿðº£ÿó½¦ÿø«ÿýɲÿÿѺÿÿØÁÿÿÞÆÿÿëÓÿÿïÖÿÿôÚÿÿöÜÿÿöÛÿÿ÷ÜÿÿúßÿÿýâÿýûÝÿþüÞÿüüÞÿúúÜÿõøØÿòõÕÿìóÐÿëòÏÿÞèÄÿÔÞºÿÆÑ«ÿ¸Ãÿ­¸ÿ¡¬„ÿ”ŸwÿŒ—oÿ…‘mÿ~‰iÿŒkÿ™{ÿš¦ˆÿ©´šÿ¾È±ÿÏØÄÊáèÙyðöëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíÿùè(ÿðáOÿäÓƒÿÛǽÿйÿÿʳÿ÷Áªÿò¼¥ÿﻤÿð¼¥ÿｦÿí¿§ÿé½¥ÿê©ÿíÈ®ÿëÊ°ÿêͲÿíеÿðÕºÿôÙ¾ÿæäÆÿãáÃÿÚÚ¼ÿÒÒ´ÿÆÉ©ÿ½À ÿ±¸•ÿ¬³ÿž¨„ÿ—¡}ÿ˜rÿ‡’lÿ‡’jÿŠ•mÿŽ™qÿ‘œtÿ›§ƒÿ¤¯ÿ´¿žÿÈÒ´ÿÕáÃÜàëщí÷àOùÿîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôùä;ñòÞYìë×ÿèâÏÿæÚÈÿáÑÀÿÞʹÿàôÿݼ¬ÿ们ÿ纬ÿ뺬ÿï»®ÿõ¾±ÿúÁ²ÿüôÿÔѼÿÏÌ·ÿÆîÿ½º¥ÿ°²œÿ¦¨’ÿ›Ÿ†ÿ”˜ÿ‘—~ÿ’˜ÿ”ƒÿ›¤Šÿ¦¯•ÿ´½£ÿÃ̲ÿÌÕ»ÿÓÚË¥ÞäÙyèïâEîóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð ÿÿíÿþëÿúè(ÿõä;ÿïÞYÿêÛnÿåÕ€ÿßЉÿØÊ¥ÿÔƽÿÓƽÿÔǽÿÕƽÿÔÅÊÞÛƽÚ×ÂÜÖÓ¾ÿÕÒ½ÿÑÓ½ÿÏÑ»ÿÉÍ´ÿÅÉ°ÿÈεÿÏÕ¼ÿÕÞÄÊÝæÌšãìÒƒéòØyðùßYõþä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîíåäêãââââåææíïï ÜÚÚ6ÔÏÐj½À¿¦¬±°¶¦¦¦Á £¤äž£¥à¦§¤Á±±¯µ¾Á®ÓÔÔràáÞ4ìíë îïíâãáÚÚÙÝßÞæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîîæåðèçãàá*ÆÄÄ}¢¢¢Ú…‰‰ÿw‹ˆÿg‘Šÿkž–ÿ€«¤ÿš®ªÿ¨«¤ÿ¦¦šÿš—ŠÿŒ‚ÿˆˆƒÿˆŠˆþ¢£¢ÔÈÊÈáâà'ßßÞÞàßæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççðõóìãâ1Á¸¶¬ŠŒ‹ôp‹†ÿj©Ÿÿfͼÿ`ßÊÿVçÓÿMêÔÿfíØÿ¿ðàÿééÓÿçÚ«ÿâÙŽÿäÖ•ÿÙΚÿÇ¿˜ÿª¡ÿ‹‡ƒÿŠŽó¶¸¸›Þàà,êìïééîééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëíêêîììÄÈÇš‹Žõi–ŽÿiǹÿYãÐÿAéÒÿ-çÎÿ(äÍÿ#âÍÿ(âÌÿMäÎÿ®æÙÿßáÈÿãшÿÞÓYÿÞÓYÿÞÐgÿÞÓoÿâØÿÝÓ›ÿöÿ”Ž‡ÿôÂÃÈ”ìíòëëñááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææñîïçâã6«£¥ÓsŒÿoĸÿYåÒÿ8åÍÿ%áÉÿ&ßÇÿ(ÝÆÿ)ÚÃÿ!ØÀÿ%Öºÿ=Ú¼ÿ˜ÜÈÿÎÔ³ÿØÂxÿÙÀTÿÚÀZÿÜÄ^ÿÞËYÿÞÍWÿÝÍ`ÿãÑtÿàÓ–ÿûšÿ‘Ž†ÿ¦¥«ÑÞßè:ååçíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòëêêÝ××V‘––ôl© ÿ\àÍÿ8åËÿ$áÄÿ"ÞÁÿ%Ú¼ÿ$Ö·ÿÑ­ÿÍ¥ÿÉ¢ÿ+Æ¢ÿEЬÿ—Õ»ÿÆͨÿÊ·sÿëPÿÁ§IÿÆ­IÿÌ´NÿÕºXÿÚÁ[ÿÛÇYÿÜÉ^ÿáÏxÿÝКÿ§¡Žÿ••šð×ØÚPòññìóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôèøõíù÷ÙÔÕ\†“‘ùn¿´ÿPåÏÿ*ßÅÿ$ÛÁÿ$عÿÒ°ÿ ʤÿÄ™ÿ"–ÿ6ÆœÿHͦÿiÓ³ÿ…ßÂÿ¿ãÔÿÞàÍÿâÑ«ÿÖÀŽÿеyÿƨ_ÿ¼žLÿ¾¡HÿÆ«KÿÍ´RÿÓÀTÿÙÅVÿÚÇeÿÞÐÿ¸±•ÿ”“’ùØØÙ[ï÷ôêõóêõóêõóêõóêõóÿÿÿÿÿÿÿÿÿÿÿÿêóòêóòêóòêóòî÷õÛàßu‹—–ùkƸÿDâÊÿ$Ú¾ÿ#عÿÑ­ÿÉ¡ÿÁ˜ÿ»ÿ)¾Žÿ:Ä—ÿF›ÿCÁ—ÿ9À‘ÿIÕÿ„Ë£ÿ³¿•ÿ¼£kÿº^ÿÃ¥iÿɧsÿƨiÿºŸQÿµ™Dÿ½DÿĪIÿ͵QÿÕ¿TÿÕÂ]ÿáÌ€ÿƸžÿ—š‘ú×àÞYñõòíòíîòíîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòïïòïïòïïôòñìáâ0—œ›÷kôÿDàÇÿ"عÿÔ²ÿ Ê¥ÿ˜ÿ¼Šÿ¹„ÿ ¹„ÿ*µ…ÿ ³ÿ´zÿ'·„ÿ9Á“ÿ^Ê¥ô•Ó³æ¹Ç¡àÀ­è·›aÿ°ŒMÿ«…>ÿ¯‰@ÿ»‘Pÿ½”Sÿ²’Aÿµ•?ÿ¿JÿÉ«MÿϹOÿÒ¾VÿÝÊ}ÿÁ¶ÿ¡Ÿ ìéèä2óóîððëððìððìÿÿÿÿÿÿÿÿÿÿÿÿñíìñíìòííõïï«®¬Ór¼®ÿBàÄÿÖ¶ÿѬÿÈÿ¿‘ÿ·…ÿ´{ÿ³vÿ°vÿ±ÿFßÿŠÚÅÞ«ëØ–Ëöëméúø&îøüÞæÓ îåÖòìÜFàÛÂ}ÑèɷŸoÿ£ˆ?ÿ©„8ÿ³†Bÿ²Š>ÿ³>ÿ»—DÿĦHÿ̵KÿÓ¼OÿØÇÿµ­˜ÿ±°°ÇðòððóîïòíïòíÿÿÿÿÿÿÿÿÿÿÿÿñííñííöñòËÇLJv¯¤ÿBàÂÿ"Ô²ÿΨÿ Äšÿ¼Šÿµ€ÿ±xÿ¯tÿ°{ÿF¿˜ÿ–áÈÏÎ÷íZêÿþÐúîÓþóíüûî÷üÜäÐìãÔøóãñðÙúøñòïßAÓΧ¸³›iÿ§=ÿ©5ÿ«…5ÿ°‰:ÿ¸‘CÿÀ¡FÿɯKÿ͹RÿÓƇÿª¦šÿËÍɉòöîîñêîñêÿÿÿÿÿÿÿÿÿÿÿÿééêëëìèãã,’¬§õ]Ô½ÿ(Ô³ÿ̧ÿÙÿ¹Šÿ´}ÿ±xÿ®uÿ#³€ÿvÏ´ðÈôìvâÿúßÿöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéù÷çñìÓîãÓRǹŠæ§…Fÿ§3ÿªƒ4ÿ­‡<ÿ³’=ÿ»ŸHÿͬKÿÏ·ZÿÉÀÿ¯§¨õéçê!ðïïîíîÿÿÿÿÿÿÿÿÿÿÿÿåëêéïïÆÂħp¿°ÿ+صÿ"ɤÿ–ÿ»ˆÿ±ƒÿ±vÿ®tÿ'²†ÿˆ×Àõäüõ2èÿÿÛþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËüöæõô玡˫‰Bÿª}2ÿ¢‚6ÿ¯‰7ÿ¸’?ÿ¼ŸGÿȬGÿÓ»jÿº¯žÿÇÇË–ðïðëêëÿÿÿÿÿÿÿÿÿÿÿÿêééåãã"›´¯õVзÿË¥ÿÙÿºŠÿ³~ÿ®xÿ­rÿ²~ÿ€Ò¹åçýö:ðÿþåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËùóâ÷÷ëûöì̼˜Ø¦…@ÿ¨z8ÿ«€6ÿ®Š6ÿ²‘?ÿÁ¡DÿƪRÿȺ‰ÿ²°©îäããçååÿÿÿÿÿÿÿÿÿÿÿÿíííÑÑÐvyÁ°ÿ.ЬÿÄ™ÿ½ÿ´‚ÿ°xÿ°qÿ¯wÿdȪùÛõíMíÿúìÿüåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåëæÊùóáõôçü÷íîéå/¼­{ô­‚6ÿ¨|7ÿ¨‚4ÿ¯‰=ÿº•@ÿÀ Eÿʳdÿº²˜ÿÒÒÑmíîñÿÿÿÿÿÿÿÿÿÿÿÿíññ´Â¿ÏUË®ÿÇžÿ¾Žÿ·‚ÿ±zÿ®tÿ¯qÿ8»‘ÿ¾äÙ‡òúøíùöëýùäýûÙþôÚýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéöôäòðØùõêöõêöôéøöïæàʆ±˜Uÿ¦}4ÿ¨~5ÿ«‚9ÿ²Œ=ÿ¹™@ÿÅ¥LÿÅ´†ÿÂÀ»Çîñùÿÿÿÿÿÿÿÿÿÿÿÿæëë2œ½¶ÿ:Ì©ÿ¾“ÿº‡ÿ³{ÿ°vÿ¬rÿ±yÿ}Ϲîéöôæ÷õå÷ôå÷ôæ÷öâýøÞýöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷ôäóòèñíëòîêòîêòïëóïî ĵ™à©„8ÿ¨}1ÿª6ÿ­‡9ÿ±‘>ÿ¾˜CÿŬnÿ¼¹«úäèï0ÿÿÿÿÿÿÿÿÿÿÿÿâÚÜ\vðÿ)Åÿ¹Œÿµÿ°yÿ­uÿ­sÿ5¹ŠÿÀâÛŸøÿÿñÿÿñÿÿñÿÿñÿÿñÿÿñÿÿëÿþÉ÷êÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÔ÷öëôñæòðæñïæñïæñïæñïåõóëÚ×Ê’®’Uÿ§~/ÿ¨6ÿ«8ÿ°‰;ÿ¶“=ÿãVÿ¼µ—ÿ×Ùã`ÿÿÿÿÿÿÿÿÿÿÿÿÏÒцZèÿÀ’ÿ·„ÿ³{ÿ¯uÿ¬sÿ®wÿZÅ þàíç<ï÷ôì÷ôì÷ôì÷ôì÷ôì÷ôí÷óìøõÇ÷éÏüñëûúí÷ûÜäÐìãÓ÷ñàîìÖîòéííèíîèîîèîîèîîèîîèïðêçèá@¸¥xÿ©€5ÿ©}4ÿ¬7ÿ®…9ÿ³Œ;ÿ»˜Fÿ»°…ÿÕÔØÿÿÿÿÿÿÿÿÿÿÿÿÂÒδHÄ¢ÿ¹‡ÿ³~ÿ°wÿ®sÿ­qÿ²}ÿͶæéìéâëæâëæâëæâëæâëæâëæâëæãëæÜîçØüôêüúí÷ûÜäÐìãÒöòçíððìïñìïñìïñìïñìïñìïñìïñíðòìðóÁ¶šîª„<ÿ¦|1ÿª4ÿ¬‚4ÿ¯‰7ÿµ<ÿ»ªvÿÐÍË¢ÿÿÿÿÿÿÿÿÿÿÿÿ¼ÎÇÁFÄŸÿ¹…ÿ´~ÿ²zÿ±xÿ¯vÿ-¶‡ÿ¡ÍûíçëææçææèææèææèææèææèææèææçèåçãëêêúùíøüÜäÐéãÔéëèçêêçêéçêéçêéçêéçêéçêéçêéçêééííɯ̮ŽJÿ¥€6ÿ¨‚8ÿª„:ÿ­‰=ÿ²Aÿº¤pÿÏÈŶÿÿÿÿÿÿÿÿÿÿÿÿ¾ÌÈÁaÉ¥ÿH¿‘ÿG¼ÿE»ŠÿCº‰ÿ@ºˆÿXšÿ¸ÍʵßÙÞÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÛÞàãéôõåìåççæçèèçèèçèèçèèçèèçèèçèèçèèçèèçèèêëìÎɼú gÿ±Rÿ³‘Sÿ¶“Tÿ·•Wÿº™Yÿ¾«{ÿÎÊÆÖÿÿÿÿÿÿÿÿÿÿÿÿÊÌÎîɦÿ¥¾—ÿ¥½—ÿ£»•ÿ£»•ÿ¢½•ÿ¬Æ¦ÿÆÏɶÚÝÝ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛÙÞÝëíìîîíìçéìæçëæçëæçëæçëæçëæçëæçëæçëæçëæçîèëÊÉÁIJ¬|ÿ©›eÿ®œdÿ°eÿ¯žiÿ°¡lÿ³²„ÿÌËŸÿÿÿÿÿÿÿÿÿÿÿÿßÎ˹éµÿë¥zÿè£zÿé£zÿè£zÿè£yÿã°‘ÿÐŽÊëíîëììëëìëëìëëìëëìëëìëëìëëìëììêëëæéêîïîîîìééêèåèéæééçééçééçééçééçééçééçééçéìéí½¿µË•\ÿ€Bÿ„Aÿ„€Aÿ„‚Dÿ‡ƒDÿ“›fÿÆÉÁªÿÿÿÿÿÿÿÿÿÿÿÿàÕιú£yÿýŽZÿü[ÿý[ÿüŽ[ÿþ[ÿûœvÿθ«óèõõ%ðûúïúùïúùïúùïúùïúùïúùîúùïûùæììâççîïîîîìèéêããæëéîèçìèçìèçìèçìèçìèçìèçìéèíéç﩯Ÿðt|8ÿbfÿcd ÿbcÿbeÿafÿy†MÿÌÐÊÿÿÿÿÿÿÿÿÿÿÿÿßßÙ‘ô£|ÿý‰RÿýˆSÿþˆSÿþŠVÿüTÿþ›iÿÕ¯ ÿÙééëûùéøöéøöéøöéøöéøöéø÷êøøêóóäééãçèîïîîîìèéêÝÞßäâæéçêëéêëéêëéêëéêëéêëéêíëìáÞãC™ …ÿmt(ÿ^`ÿ]_ÿ]^ÿ\^ÿ[_ÿ{‡PÿÔØÔtÿÿÿÿÿÿÿÿÿÿÿÿèçå^ñ©ŠÿýŠUÿý†Sÿü‡SÿþŠWÿüWÿÿšfÿݨ“ÿÅÏΧëðõçìðèìðèìðçìðèìñçìïâæéçêíäééãçèîïîîîìèéêÞßààßãäæãîðëìíêìíêìíêìíêìíêðòïÍÌΡ”mÿlq"ÿacÿ^aÿ\_ÿ]_ÿ]`ÿŠ“dÿßáÝPÿÿÿÿÿÿÿÿÿÿÿÿóóí#ì¹¢öþZÿþ†Rÿù‰RÿÿŠVÿýZÿÿ˜dÿÿº±«èêîöñõúðóùðóùðôùîðöéçìáâæçëîäééãçèîïîîîìèéêÞßààßãÝàÝíñêîñïìïóëîòëîòíðôéì类§í‰Rÿmnÿeeÿ^aÿ]`ÿ]^ÿ]dÿ ¦‰ñðòíÿÿÿÿÿÿÿÿÿÿÿÿöôðë;¾ü“fÿÿ†Oÿü‰PÿþŠVÿü‘Yÿý˜`ÿÿ­ƒÿħšÿÂÍЛñùüíô÷íô÷ìôöéìîåäèâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóêíñìêëñíðòíïññôöÈËÒ›”ž€ÿ‚‹6ÿlmÿdfÿ]aÿ]_ÿZ^ÿeo,ÿ¿Å®¼õöóÿÿÿÿÿÿÿÿÿÿÿÿïôôéâÜjó¡}ÿþˆQÿþˆPÿþŠVÿü‘Xÿþš`ÿÿ¤sÿÿ¨¥žöçâç2õïóðêïåèéçèêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëêîèèçìððîôóòãæå@¢Ÿö–Ÿfÿ{€!ÿmoÿceÿ^_ÿ[^ÿY]ÿxƒOÿÜâÑlñöìÿÿÿÿÿÿÿÿÿÿÿÿîîëííè긟îùWÿþˆPÿþˆVÿþUÿþ˜aÿü£hÿÿ¹ŠÿÓ®œÿ«¨©ÓèééàßââçèèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïéåãéëéëîì짩©Øœ¥{ÿ‘•<ÿy{ÿknÿbeÿ^_ÿZ\ÿ\cÿ ¨ˆîïõéíóæÿÿÿÿÿÿÿÿÿÿÿÿî÷óîøõïÙÍ­úšjÿüˆQÿþ‡TÿþTÿý“_ÿø£fÿý¯vÿÿäÿ´£›ÿ¬ª¬ÀââååêëèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïééçíëè«Ì—›„ÿ «Vÿ…ˆÿwxÿfmÿaaÿ_^ÿX^ÿnx;ÿÎÓÅ~îôïéðéÿÿÿÿÿÿÿÿÿÿÿÿëÿÿéÿÿññï1÷¶—ôüŠYÿþ‡RÿüŠUÿþ\ÿü›dÿý«pÿü¸‡ÿüÊ®ÿ²–ÿ Ÿ ×ÚááKîïðææêâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞñõíòõïÝÜãJž ŸØ•›€ÿª´fÿ•&ÿ ÿorÿahÿ`]ÿ^]ÿ[fÿ˜£~ðãæÝàãÚàãÙÿÿÿÿÿÿÿÿÿÿÿÿëýþêýþôöïðÝÏ÷žvÿþ‰RÿþˆSÿþŒVÿý“`ÿÿ¢kÿü°xÿþ¿Žÿüѱÿ´¦šÿŠŠˆÿº»¼¤ååé(çéíêîñåêêãçèîïîîîìèéêßàáãáæäçäéîç7¼¿À·Š‰‹ü¡ƒÿ²»eÿ•Ÿ,ÿ‡ÿyzÿhlÿ`aÿ^^ÿY^ÿuGÿÕÛÏxíñîèíèèíèÿÿÿÿÿÿÿÿÿÿÿÿôöíôöíõõëööí õʯÑû‘`ÿþVÿûŠTÿû[ÿÿ™bÿÿ©mÿþ¸{ÿþÄÿÿÒ³ÿÝÀ®ÿ›‘†ÿŒŒ‹ò´³·µÕÙÛmàåå9æëìòóòóóðììîÝÞà*ÔÓÖ_±´²±ˆŠùŠˆƒÿ²´€ÿ¸¼Wÿ›¡,ÿ‘!ÿ€ÿppÿbfÿ^aÿY`ÿ`j)ÿ·¾žÏøýó ôùñóøñóøñÿÿÿÿÿÿÿÿÿÿÿÿø÷íø÷íø÷íùùîûóâ-òµ—îý‘_ÿý’bÿúŒZÿý‘Wÿþœdÿü¬uÿþ»ÿÿÅÿÿÒ£ÿüÙºÿй«ÿ¢‘‰ÿ‰ƒ|ÿŒŒ‰ÿ—––ñ›š™î™ššî”–—ð‰Šù…zÿÿ¬¯ƒÿ¿Çfÿ®¶9ÿ¢#ÿ”"ÿ‚„"ÿtsÿefÿcdÿcdÿ[cÿ˜Ÿzñïñå0øüîõúêõúêõúêÿÿÿÿÿÿÿÿÿÿÿÿüøëüøëüøëýøëþúíûìÞOõªŠóû—fÿÿšoÿý”aÿø“[ÿü›gÿþ¬tÿü½€ÿýȉÿýÍšÿÿÖ®ÿÿÛ»ÿïÒ¸ÿÛŲÿð§ÿ¶«©ÿ­© ÿ§ªŒÿ³¸ƒÿºÂzÿ¾Æfÿ³»@ÿ¦«)ÿœž)ÿ‘”$ÿ€†ÿqvÿfjÿjl&ÿrr.ÿ\fÿˆ‘büãæÙVùùòõõíõõíõõíõõíÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿúòúæÝVô«‹öýœpÿ÷©zÿù uÿþ˜jÿøœgÿû§oÿþµzÿýÂ…ÿþËŽÿþИÿÿÔ ÿÿØ©ÿÿáÅÿüçÝÿìä½ÿÍÒoÿ¶¾=ÿ¯´,ÿ©¬&ÿ¢¥$ÿ˜$ÿ‰Ž!ÿ{~ÿnrÿpq'ÿ‚>ÿ‚…Cÿai%ÿ\þÞåÓgøüñöúí÷úî÷úî÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìÿóñúäÜNð´Œöú¢{ÿü±‘ÿú³ÿû°…ÿø¬|ÿ÷ªvÿù®wÿû¶}ÿûÀ„ÿýɇÿþÍŽÿÿÓ©ÿöÚÌÿàÕ¨ÿÀÀLÿ¥ª ÿ›$ÿ“—!ÿ‰ÿ€… ÿ}€,ÿ‚†<ÿ’Oÿžœeÿ‘ŽUÿfl.ÿšiúÜáÐ^ôùéúÿðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþ÷ðûîß?ø¼¤Õø«†ÿû¾˜ÿûäÿýĤÿþÅ¢ÿüÄžÿüÀ˜ÿü¾“ÿúÀŽÿúÀŽÿùÄ£ÿîйÿÓÊ™ÿ±¯Vÿž9ÿ›ž<ÿŸKÿ¡¢\ÿ¨¨oÿ­¬}ÿ°°„ÿ¬¯†ÿ•Vÿox7ÿ¢¦„áèñÝBëðâîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿùëþõåöмœñµ—ÿú¿ ÿýÍ´ÿüÑ»ÿüÒ¼ÿûÖ¾ÿùÙÁÿùÚÁÿúÚ¿ÿøÞÇÿöâÖÿèÞÈÿÑÒªÿÇÊ¡ÿÊÈ¢ÿËÉ¡ÿÇÆ¢ÿÆæÿÄâÿ³¶Šÿ‡\ÿ}†Yÿ¾È©«ðôåï÷äçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿôäÿòæýíÙKõεÃó¾¦ÿúÉ´ÿúÙÆÿùáÏÿüâÑÿýáÒÿýßÑÿþäÖÿúçàÿêä×ÿÙÝÅÿÒ×¾ÿÖ×ÀÿÚ×ÀÿÕÔ·ÿ½Â›ÿ˜ sÿŠ”eÿ®µ”±ßãÑHêòßïóäìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿúêÿ÷åûæÖ=õÔ¿—óË·æö̼ÿúÖÉÿüßÒÿùçÚÿöìßÿøñåÿóíâÿåäÕÿÕÙÄÿÆ˲ÿ´º›ÿ ¨„ÿž©…ê¼Å©ŸßçÔAßáÛèëÞäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿøçÿóàþòáÿñÞÿóäúáÍJõâΘñÖðòμÂøμÍíØÂÐÏÑ·Þ¸½¡ß­·˜Ö¸Ã£»Ã̵‹ÓÝÈQìôáîõåêòâÙÜÓæéÛäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿþÿÿøÿÿàÿÿÀÿÿ€ÿÿÿþü?øøðð?þðÿÿàÿÿ€àÿÿÀÀÿÿàÀÿÿàÀÿÿðÀÿÿðÀÿÿðÀÿÿðÀÿÿøÀÿÿøÀÿÿøÀÿÿðÀÿÿðÀÿÿðÀÿÿààÿÿààÿÿÀàÿÿ€ðÿÿðþøøøü?þÿÿÿ€ÿÿÀÿÿàÿÿøÿÿüÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèìèèêîíôíìåÝÝ$¿»»~¡¦¥À‹ª¤ô~®§ÿ”±¬ÿ¬®§ÿ¬©ÿ¨§Ÿù¤¥¤Çº»¼…×ÙÙ-àâáåçêèèíçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèðììééè¾»¹ŽŒ¨£ð`±¥ÿKÏ»ÿCâÎÿ=èÒÿ•îßÿéäÆÿä×ÿÞÓ~ÿ˃ÿ±©‡ÿ¦£›ö±±´•ÝÞä(ííòçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóññíîÞÔÖK“¤¡äc¿±ÿ@ßÉÿ,çÏÿ$àÈÿÙÀÿ×¹ÿsÝÅÿÒÐ¥ÿØ¿UÿØÁQÿÞËYÿäÓfÿÞÎyÿÁ·ÿ¥£ìÉÊÔdìëííòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿç÷ôç÷ôçøõîø÷ÎÉÊg®¨÷HÖÂÿ+äÉÿÚ»ÿЭÿ É¢ÿ-É¢ÿJÏ«ÿ’ÜÄÿÕÓ³ÿÒºxÿǬ]ÿÄ©OÿË°OÿÕ¾SÿßÍbÿÕÇÿ¬§–ÿÆÆÉwð÷ôêöóêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿëóñëóññ÷ö×ÖÖez²©ÿ>ÜÄÿ Û¼ÿΩÿ˜ÿ!»ÿ.½ÿ6½ÿ8¿ÿoË¢ÿ¸¼‘ÿ¼aÿ¾œ_ÿ¾œ[ÿ¹™Kÿ¼EÿÉ®LÿÖÀUÿÜÈuÿ´¬–ÿÆÌÌ}ó÷óîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòííöñðçÝÝ5‰³«ò;Ù¾ÿÕ²ÿÆœÿºˆÿ´xÿ±zÿ<½“ÿnұɖâË¥ÆìàdÕÛÁWÝΰÊ·Žº¸œfó­ˆBÿ±ˆ=ÿ´@ÿÁ GÿζKÿÖÃpÿµ­üÜÜÜCóöððñìÿÿÿÿÿÿÿÿÿÿÿÿïìíóìíª¾¹ÂCÒ·ÿÒ­ÿÁ–ÿ¶ÿ¯sÿ"´ÿ}׺ÅÍøíUÞýøÛþöóúþâæÕöïáöõåôðá/Ï›«°ŽPÿ§0ÿ¯ˆ:ÿ»šCÿʱIÿ̼tÿº¹²×ìîëïòíÿÿÿÿÿÿÿÿÿÿÿÿêííØÖ×Udñÿ!ѬÿÀ“ÿ³ÿ­qÿ6¸ŒÿºëÝ‹ëÿÿÝÿöÔùñÒûðíøúàäÒóëÚòïÝ÷óâùõâèäÑW²–\ø¥|0ÿ«‡8ÿ»™Bÿ˯LÿÀ±‰ÿÑÏÔqïîïÿÿÿÿÿÿÿÿÿÿÿÿíèéªÅ¿Ç7Ì«ÿ–ÿµÿ®sÿ!³ÿ®æÕ÷ÿÿäÿûØýóÔùñÒûðíøúàäÒóëÚòïÝöñàôïÙþýôçàÎa®Pü¨{2ÿ­ˆ9ÿ¼š@ÿȱcÿþ­Øçæé ÿÿÿÿÿÿÿÿÿÿÿÿååå0tðÿÆšÿ¸„ÿ®vÿ¯rÿ†Ó»Éñûøëüùáýø×ýóÔùñÒûðíøúàäÒóëÚòïÜ÷òàõòáøõìûùõÖË©¦¦6ÿ¨~5ÿ±‹<ÿÁ DÿÀ¯ƒÿÚÜáRÿÿÿÿÿÿÿÿÿÿÿÿ×ÝÜfIƧÿ»‹ÿ²{ÿ¬qÿ3¸‰ÿØñîMòýýìüüìýýêÿýÖúóÑûðíøúàäÒóëÚóïÛöñæòðæòïçôòêëéâ0±˜aý¦|/ÿ«ƒ8ÿµ‘<ÿÁ¨gÿÒÒÐÿÿÿÿÿÿÿÿÿÿÿÿ¹ÒË¡(À–ÿµÿ¯uÿ «qÿhȧèðõóíöóìöóìöóïöóÛöîÒüòíøúàäÒôìÜïïâîïíîïëîïëîïëðòñŸ—Õ§|1ÿ«~5ÿ°‡6ÿ¸šJÿÍȹÁÿÿÿÿÿÿÿÿÿÿÿÿ¦ÎÂÈ ¼Œÿ³{ÿ°vÿ°yÿ—Ï¿­ïéëäææäææäææäææäææâðîëùùßåÒíëãêîïéíîéíîéíîéíîìñõÓÍ»ª…<ÿ¨5ÿ­…8ÿ´‘DÿǼ¦Ùÿÿÿÿÿÿÿÿÿÿÿÿ²ÍÃËdØÿa½ÿ]»Žÿ`À”ÿ·ÒÉ—ßÚÞÙÙÛÙÙÛÙÙÛÙÙÛÙØÛÙØÚåëìèìèèçèèççèèçèèçèèçèèçëëìÙÔʈ¶ždÿ´•Yÿ·˜\ÿ¹ bÿŽ¨çÿÿÿÿÿÿÿÿÿÿÿÿÜÊÁÈâ¬ÿá¦}ÿà¦|ÿ૆ÿ×Ì­åêëåèçåèçåèçåèçåèçâåäéëëîíìéæéìèëëçêëèêëèêëçêïëðÍÍÅ“Tÿ‰„FÿŠ†IÿŠŠKÿµº¡Ôÿÿÿÿÿÿÿÿÿÿÿÿæ϶ÿŽ[ÿÿˆTÿÿŠUÿÿ‘^ÿÛº©êçúúíúùìúøìúøíúùîúùäëëêììííìâãåéçëëéîëéíëéíëéíïíô´·¨Êfl$ÿ]_ÿ]_ÿ\dÿ¯¶»ÿÿÿÿÿÿÿÿÿÿÿÿëÞÖwú‘bÿý…Pÿý‰Tÿÿ’ZÿÛªÿÜæë7íñ÷êïôëïõèíñåéìâççêììííìàáãáááëìèìíëëìëíîìççê$š€ùfiÿ\_ÿ[]ÿ_dÿÁƲŒÿÿÿÿÿÿÿÿÿÿÿÿòëå5÷ yÿþ…MÿýŠTÿÿ“[ÿð§ÿÇÇÇ©ñøýñõúîòöæåéäæéâççêììííìáâäÞßßéîæíððìîòñôøÇÌÍ’‰Sÿijÿ^aÿZ\ÿmt8ÿÜÞÔ[ÿÿÿÿÿÿÿÿÿÿÿÿíòñÙý†Nÿþ‰Sÿý”Yÿÿ§uÿȬšÿØØÛIñïóæéêåäèäçêâççêììííìáâäÞßßêïæêëëññòâäç5Ÿ¦÷€…+ÿhjÿ^`ÿTXÿ‘™míðöëÿÿÿÿÿÿÿÿÿÿÿÿîõñîßÔqû’`ÿÿ†PÿþYÿü£gÿù¹ÿ¹«¦åÑÓ×8ëîïååèäçêâççêììííìáâäÞßßêïæððñàÞä+§© ß–Mÿz|ÿeiÿ]]ÿ\dÿÂɲƒïôîÿÿÿÿÿÿÿÿÿÿÿÿéÿÿíûû÷²“àþ…Oÿþ‹Vÿý™bÿÿ²{ÿﾟÿ­¤ŸóÃÈÊkæçë êíñäêêëííîîíãäæäååîóëÏÏÖ^¡£›ç ª^ÿŠ#ÿpsÿ`bÿXYÿŠ”dìäèâ!äçáÿÿÿÿÿÿÿÿÿÿÿÿòùóôúòôç×PùœoÿþˆQÿüŽZÿÿ¢hÿÿ½ƒÿöÉ¥ÿÀ¬ÿ¨¥¤Î»½¿Ð××Pâåå0æææ.Ö×Û@¼½Âx¤¦¨È ¢ÿ«¯Tÿ–š&ÿ|}ÿegÿZ\ÿfo.ÿØßËeøý÷ò÷ïÿÿÿÿÿÿÿÿÿÿÿÿû÷ëû÷ìüýñø׆ú•gÿý‘`ÿü”[ÿü¦nÿÿ¿„ÿÿÔ¡ÿèƪÿ¼§—ÿ²¨Ÿÿ¯¨§ÿ§§¢ÿŸ¤ÿ™Ÿuÿª¯aÿ±·=ÿ—œ ÿ}ÿjlÿfgÿ_g!ÿµ»ž«ûýóöøìõøëÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþùëÿûòøͼ•ùŸsÿù¢uÿüžoÿú¥mÿý·yÿÿÈŒÿÿןÿÿÙ«ÿúÞÐÿÞÙ§ÿºÀGÿ¯´/ÿ ¥ÿ‹ÿy}ÿwy,ÿ<ÿgo,ÿ­¸”³ûüô øüï÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþ÷íÿõòøÖ¿†ú®Œþû·“ÿüº•ÿûºÿûº‹ÿûÀ‰ÿüÆÿùÒºÿÒÊŽÿ¤¦1ÿ—š0ÿ•˜?ÿššXÿŸ¡kÿ–š`ÿ€ƒJÿµ½ž¡ðõè úÿðøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿóîÿùíûåÕGõèÛûǬÿüлÿúØÂÿúÙÂÿûÛÃÿùáÓÿãÜÄÿÉ̦ÿËɦÿËɨÿ¾¾œÿ£©|ÿ’špåÑØÀeò÷éíòãøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿôæÿôâúÞËcöѽ¿ùØÇóúÛÍÿøßÒÿøéÝÿèäÖÿÎÓ¾ÿÇʱÿ¼À¡û­¶“ÈÃ̱yãç×ðõäêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿñâÿõäþïßÿñßýìÛ$÷èÖj÷ÓÃ…ôÓÁ‘Ë̵ŸºÁ¦œÌÕ¼pÙãÏ.íõãêðáãæ×ëñÞêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿþü?øðàààøÀ?üÀ?þÀþÀþÀÿÿÀÿÿÀÿÿÀþÀþÀþÀ?üàøààðøüþ?ÿÿÿ€ÿÿðÿÿÿÿÿÿÿÿÿ(0 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèòñëééïðïïäãËÄÅ^¨º·«ˆ¹±Ô“ºµä¶·¬æ·´¢×¹¸²±ÄÅÈhÖØÚêëïçæêìñïêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèóòòííÖÒÒT“·±ÕUÀ±ÿ;ÛÆÿ%àÉÿiæÓÿßÙ§ÿßËdÿØÊsÿÁ·ÿ³¯ŸÝËÌÒaèèííòðêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿçöôèøöîõôÂÄÄ‚a¿³ÿ,ÞÄÿݽÿѬÿ(̧ÿlÖ¹ÿÍÈ™ÿÍ°ZÿͳPÿØÀUÿÝËfÿ¿µ†ÿ¿¾¿•ìóòë÷óêõòÿÿÿÿÿÿÿÿÿÿÿÿîòñôôôÉÍÌVǵÿ"Ú»ÿÉ ÿºŠÿ%¸…ÿ9À‘ÿqЬóÀ¿•í¿ždÿ·“Pÿ·”DÿÂ¥EÿÕ¾Vÿȹ}ÿÄÅÚñõòïòíÿÿÿÿÿÿÿÿÿÿÿÿöðñâÜÜ ///////////////////////////////////////////////////////////////////////////// #undef APSTUDIO_READONLY_SYMBOLS ///////////////////////////////////////////////////////////////////////////// // English (U.S.) resources #if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENU) #ifdef _WIN32 LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_US #pragma code_page(1252) #endif //_WIN32 #ifdef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // TEXTINCLUDE // 1 TEXTINCLUDE BEGIN "resource.h\0" END 2 TEXTINCLUDE BEGIN "#include \r\n" "\0" END 3 TEXTINCLUDE BEGIN "\r\n" "\0" END #endif // APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Icon // // Icon with lowest ID value placed first to ensure application icon // remains consistent on all systems. IDI_SYNERGY ICON "synergys.ico" IDI_TASKBAR_NOT_RUNNING ICON "tb_idle.ico" IDI_TASKBAR_NOT_WORKING ICON "tb_error.ico" IDI_TASKBAR_NOT_CONNECTED ICON "tb_wait.ico" IDI_TASKBAR_CONNECTED ICON "tb_run.ico" ///////////////////////////////////////////////////////////////////////////// // // Menu // IDR_TASKBAR MENU BEGIN POPUP "Synergy" BEGIN MENUITEM "Show Status", IDC_TASKBAR_STATUS MENUITEM "Show Log", IDC_TASKBAR_SHOW_LOG MENUITEM "Copy Log To Clipboard", IDC_TASKBAR_LOG POPUP "Set Log Level" BEGIN MENUITEM "Error", IDC_TASKBAR_LOG_LEVEL_ERROR MENUITEM "Warning", IDC_TASKBAR_LOG_LEVEL_WARNING MENUITEM "Note", IDC_TASKBAR_LOG_LEVEL_NOTE MENUITEM "Info", IDC_TASKBAR_LOG_LEVEL_INFO MENUITEM "Debug", IDC_TASKBAR_LOG_LEVEL_DEBUG MENUITEM "Debug1", IDC_TASKBAR_LOG_LEVEL_DEBUG1 MENUITEM "Debug2", IDC_TASKBAR_LOG_LEVEL_DEBUG2 END MENUITEM "Reload Configuration", IDC_RELOAD_CONFIG MENUITEM "Force Reconnect", IDC_FORCE_RECONNECT MENUITEM "Reset Server", ID_SYNERGY_RESETSERVER MENUITEM SEPARATOR MENUITEM "Quit", IDC_TASKBAR_QUIT END END ///////////////////////////////////////////////////////////////////////////// // // Dialog // IDD_TASKBAR_STATUS DIALOG 0, 0, 145, 60 STYLE DS_SETFONT | DS_MODALFRAME | WS_POPUP FONT 8, "MS Sans Serif" BEGIN EDITTEXT IDC_TASKBAR_STATUS_STATUS,3,3,139,12,ES_AUTOHSCROLL | ES_READONLY | NOT WS_BORDER LISTBOX IDC_TASKBAR_STATUS_CLIENTS,3,17,139,40,NOT LBS_NOTIFY | LBS_SORT | LBS_NOINTEGRALHEIGHT | LBS_NOSEL | WS_VSCROLL | WS_TABSTOP END ///////////////////////////////////////////////////////////////////////////// // // String Table // STRINGTABLE BEGIN IDS_FAILED "Synergy is about to quit with errors or warnings. Please check the log then click OK." IDS_INIT_FAILED "Synergy failed to initialize: %{1}" IDS_UNCAUGHT_EXCEPTION "Uncaught exception: %{1}" END #endif // English (U.S.) resources ///////////////////////////////////////////////////////////////////////////// #ifndef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Generated from the TEXTINCLUDE 3 resource. // ///////////////////////////////////////////////////////////////////////////// #endif // not APSTUDIO_INVOKED synergy-1.4.12-Source/src/cmd/synergys/tb_error.ico0000600000175000017500000000047611151752223022244 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€»»»»»»»»° »» »° »°€: »»»»°è¢ »° »Ž:0»° »è~~ ° °&&çç ° °ff~~p° &&çà»»f`~~ °&& çç °ff~p& çf`øÀ€€€€€Ààøsynergy-1.4.12-Source/src/cmd/synergys/tb_idle.ico0000600000175000017500000000047611151752223022030 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ 9™™˜à¢™™™™Ž 9™:虘à™’™™€9™0 ™™˜©’™‰ž9š ™é˜yž™)–é— ™i–y™™™–™™i™`y™~&™– ç™™™™fy™™– çf`øàÀ€ƒÁ€0 pðàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/synergys/tb_run.ico0000600000175000017500000000047611151752223021717 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0°è袢»°:»»°»°p»»»»»» » »»fpp »&&çç ff`~~&&& çççfff~~&& çf`øàÀ€ƒ 0€€Ààøsynergy-1.4.12-Source/src/cmd/synergys/tb_wait.ico0000600000175000017500000000047611151752223022057 0ustar synergysynergy(( À€€€€€€€€€ÀÀÀ€€€ÿÿÿÿÿÿÿÿÿÿÿÿ¢Ž€ ::èèࢢ¢ŽŽŽ :::èèèࢢŽŽ€::0è袢ŽŽ::èè~~&&ççff~~p&&ççff`~~~&&& çççfff~~&& çf`øàÀ€ƒÁàððððàƒÁ€Ààøsynergy-1.4.12-Source/src/cmd/usynergy/0000700000175000017500000000000012140644175017730 5ustar synergysynergysynergy-1.4.12-Source/src/cmd/usynergy/CMakeLists.txt0000600000175000017500000000160012021261364022460 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2012 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . if (WIN32) set(src uSynergyWin32.c) elseif (UNIX) set(src uSynergyUnix.c) endif() include_directories(../../micro) add_executable(usynergy ${src}) target_link_libraries(usynergy micro) synergy-1.4.12-Source/src/cmd/usynergy/uSynergyUnix.c0000600000175000017500000000225712140222564022567 0ustar synergysynergy/* uSynergy client -- Implementation for the embedded Synergy client library version 1.0.0, July 7th, 2012 Copyright (c) 2012 Nick Bolton This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ #include "uSynergy.h" // TODO: implement callbacks. int main(int argc, char** argv) { uSynergyContext context; uSynergyInit(&context); for(;;) { uSynergyUpdate(&context); } } synergy-1.4.12-Source/src/cmd/usynergy/uSynergyWin32.c0000600000175000017500000001025112131276403022540 0ustar synergysynergy/* uSynergy client -- Implementation for the embedded Synergy client library version 1.0.0, July 7th, 2012 Copyright (c) 2012 Nick Bolton This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ #include "uSynergy.h" #include #include #define WIN32_LEAN_AND_MEAN #include uSynergyBool connect(uSynergyCookie cookie); uSynergyBool send(uSynergyCookie cookie, const uint8_t *buffer, int length); uSynergyBool receive(uSynergyCookie cookie, uint8_t *buffer, int maxLength, int* outLength); void sleep(uSynergyCookie cookie, int timeMs); uint32_t getTime(); void trace(uSynergyCookie cookie, const char *text); void screenActive(uSynergyCookie cookie, uSynergyBool active); void mouse(uSynergyCookie cookie, uint16_t x, uint16_t y, int16_t wheelX, int16_t wheelY, uSynergyBool buttonLeft, uSynergyBool buttonRight, uSynergyBool buttonMiddle); void keyboard(uSynergyCookie cookie, uint16_t key, uint16_t modifiers, uSynergyBool down, uSynergyBool repeat); void joystick(uSynergyCookie cookie, uint8_t joyNum, uint16_t buttons, int8_t leftStickX, int8_t leftStickY, int8_t rightStickX, int8_t rightStickY); void clipboard(uSynergyCookie cookie, enum uSynergyClipboardFormat format, const uint8_t *data, uint32_t size); // TODO: implement callbacks. int main(char* argv, int argc) { uSynergyContext context; uSynergyInit(&context); context.m_connectFunc = &connect; context.m_sendFunc = &send; context.m_receiveFunc = &receive; context.m_sleepFunc = &sleep; context.m_getTimeFunc = &getTime; context.m_traceFunc = &trace; context.m_screenActiveCallback = &screenActive; context.m_mouseCallback = &mouse; context.m_keyboardCallback = &keyboard; context.m_joystickCallback = &joystick; context.m_clipboardCallback = &clipboard; for(;;) { uSynergyUpdate(&context); } } uSynergyBool connect(uSynergyCookie cookie) { printf("connect\n"); return USYNERGY_TRUE; } uSynergyBool send(uSynergyCookie cookie, const uint8_t *buffer, int length) { printf("send\n"); return USYNERGY_TRUE; } uSynergyBool receive(uSynergyCookie cookie, uint8_t *buffer, int maxLength, int* outLength) { printf("receive\n"); return USYNERGY_TRUE; } void sleep(uSynergyCookie cookie, int timeMs) { printf("sleep, timeMs=%d\n", timeMs); Sleep(timeMs); } uint32_t getTime() { printf("getTime\n"); return 0; } void trace(uSynergyCookie cookie, const char *text) { printf("%s\n", text); } void screenActive(uSynergyCookie cookie, uSynergyBool active) { printf("screenActive, active=%d\n", active); } void mouse(uSynergyCookie cookie, uint16_t x, uint16_t y, int16_t wheelX, int16_t wheelY, uSynergyBool buttonLeft, uSynergyBool buttonRight, uSynergyBool buttonMiddle) { printf("mouse, pos=%d,%d\n", x, y); } void keyboard(uSynergyCookie cookie, uint16_t key, uint16_t modifiers, uSynergyBool down, uSynergyBool repeat) { printf("keyboard, key=%d down=%d repeat=%d\n", key, down, repeat); } void joystick(uSynergyCookie cookie, uint8_t joyNum, uint16_t buttons, int8_t leftStickX, int8_t leftStickY, int8_t rightStickX, int8_t rightStickY) { printf("joystick, left=%d,%d right=%d,%d\n", leftStickX, leftStickY, rightStickX, rightStickY); } void clipboard(uSynergyCookie cookie, enum uSynergyClipboardFormat format, const uint8_t *data, uint32_t size) { printf("clipboard, size=%d\n", size); } synergy-1.4.12-Source/src/gui/0000700000175000017500000000000012140644175016064 5ustar synergysynergysynergy-1.4.12-Source/src/gui/gui.pro0000600000175000017500000000467312131565005017400 0ustar synergysynergyQT += network TEMPLATE = app TARGET = synergy DEPENDPATH += . \ res INCLUDEPATH += . \ src FORMS += res/MainWindowBase.ui \ res/AboutDialogBase.ui \ res/ServerConfigDialogBase.ui \ res/ScreenSettingsDialogBase.ui \ res/ActionDialogBase.ui \ res/HotkeyDialogBase.ui \ res/SettingsDialogBase.ui \ res/SetupWizardBase.ui SOURCES += src/main.cpp \ src/MainWindow.cpp \ src/AboutDialog.cpp \ src/ServerConfig.cpp \ src/ServerConfigDialog.cpp \ src/ScreenSetupView.cpp \ src/Screen.cpp \ src/ScreenSetupModel.cpp \ src/NewScreenWidget.cpp \ src/TrashScreenWidget.cpp \ src/ScreenSettingsDialog.cpp \ src/BaseConfig.cpp \ src/HotkeyDialog.cpp \ src/ActionDialog.cpp \ src/Hotkey.cpp \ src/Action.cpp \ src/KeySequence.cpp \ src/KeySequenceWidget.cpp \ src/SettingsDialog.cpp \ src/AppConfig.cpp \ src/QSynergyApplication.cpp \ src/VersionChecker.cpp \ src/SetupWizard.cpp \ src/IpcClient.cpp \ src/IpcReader.cpp \ src/Ipc.cpp HEADERS += src/MainWindow.h \ src/AboutDialog.h \ src/ServerConfig.h \ src/ServerConfigDialog.h \ src/ScreenSetupView.h \ src/Screen.h \ src/ScreenSetupModel.h \ src/NewScreenWidget.h \ src/TrashScreenWidget.h \ src/ScreenSettingsDialog.h \ src/BaseConfig.h \ src/HotkeyDialog.h \ src/ActionDialog.h \ src/Hotkey.h \ src/Action.h \ src/KeySequence.h \ src/KeySequenceWidget.h \ src/SettingsDialog.h \ src/AppConfig.h \ src/QSynergyApplication.h \ src/VersionChecker.h \ src/SetupWizard.h \ src/IpcClient.h \ src/IpcReader.h \ src/Ipc.h \ src/CryptoMode.h RESOURCES += res/Synergy.qrc RC_FILE = res/win/Synergy.rc TRANSLATIONS = res/lang/nl_NL.ts macx { QMAKE_INFO_PLIST = res/mac/Synergy.plist QMAKE_MACOSX_DEPLOYMENT_TARGET = 10.4 TARGET = Synergy QSYNERGY_ICON.files = res/mac/Synergy.icns QSYNERGY_ICON.path = Contents/Resources QMAKE_BUNDLE_DATA += QSYNERGY_ICON LIBS += -framework \ ApplicationServices } debug { OBJECTS_DIR = tmp/debug MOC_DIR = tmp/debug RCC_DIR = tmp/debug } release { OBJECTS_DIR = tmp/release MOC_DIR = tmp/release RCC_DIR = tmp/release } win32 { Debug:DESTDIR = ../../bin/Debug Release:DESTDIR = ../../bin/Release } else:DESTDIR = ../../bin synergy-1.4.12-Source/src/gui/gui.ts0000600000175000017500000012475512021261364017231 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2012 Bolton Software Ltd.<br /> Copyright © 2002-2012 Chris Schoeneman, Nick Bolton, Volker Lanz.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2012 Bolton Software Ltd.<br /> Copyright © 2002-2012 Chris Schoeneman, Nick Bolton, Volker Lanz.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/lang.cmd0000600000175000017500000000003211744565627017504 0ustar synergysynergylupdate gui.pro -ts gui.tssynergy-1.4.12-Source/src/gui/langbuild.cmd0000600000175000017500000000003212006005302020467 0ustar synergysynergycd res/lang lrelease *.tssynergy-1.4.12-Source/src/gui/res/0000700000175000017500000000000012140644175016655 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/AboutDialogBase.ui0000600000175000017500000001235212021261364022177 0ustar synergysynergy AboutDialogBase Qt::ApplicationModal true 0 0 450 300 0 0 450 300 450 300 About Synergy true 0 0 <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2012 Bolton Software Ltd.<br /> Copyright © 2002-2012 Chris Schoeneman, Nick Bolton, Volker Lanz.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> 1 Qt::Vertical QSizePolicy::Preferred 20 100 :/res/image/about.png 0 Qt::Vertical QSizePolicy::Fixed 20 5 0 0 Version: 1 0 0 Unknown 1 Qt::Horizontal 40 20 &Ok buttonOk clicked() AboutDialogBase accept() 315 374 301 3 synergy-1.4.12-Source/src/gui/res/ActionDialogBase.ui0000600000175000017500000003521611737143716022363 0ustar synergysynergy ActionDialogBase 0 0 372 484 Configure Action Choose the action to perform Press a hotkey true Release a hotkey Press and release a hotkey 1 0 256 0 only on these screens true true Qt::Horizontal 40 20 128 64 QAbstractItemView::ExtendedSelection Qt::Horizontal Switch to screen Qt::Horizontal 40 20 false Switch in direction Qt::Horizontal 40 20 false left right up down Lock cursor to screen Qt::Horizontal 40 20 false toggle on off This action is performed when the hotkey is pressed true the hotkey is released Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok KeySequenceWidget QLineEdit
KeySequenceWidget.h
 buttonBox accepted() ActionDialogBase accept() 245 474 157 274 buttonBox rejected() ActionDialogBase reject() 313 474 286 274 m_pGroupType toggled(bool) m_pKeySequenceWidgetHotkey setDisabled(bool) 104 194 110 132 m_pRadioSwitchInDirection toggled(bool) m_pKeySequenceWidgetHotkey setDisabled(bool) 118 322 81 129 m_pRadioLockCursorToScreen toggled(bool) m_pKeySequenceWidgetHotkey setDisabled(bool) 101 353 68 126 m_pRadioPress toggled(bool) m_pKeySequenceWidgetHotkey setEnabled(bool) 48 48 45 129 m_pRadioRelease toggled(bool) m_pKeySequenceWidgetHotkey setEnabled(bool) 135 70 148 125 m_pRadioPressAndRelease toggled(bool) m_pKeySequenceWidgetHotkey setEnabled(bool) 194 100 201 125 m_pRadioSwitchToScreen toggled(bool) m_pComboSwitchToScreen setEnabled(bool) 148 291 350 290 m_pRadioSwitchInDirection toggled(bool) m_pComboSwitchInDirection setEnabled(bool) 158 322 350 321 m_pRadioLockCursorToScreen toggled(bool) m_pComboLockCursorToScreen setEnabled(bool) 180 353 350 352 m_pRadioPress toggled(bool) m_pGroupBoxScreens setEnabled(bool) 25 47 33 155 m_pRadioSwitchToScreen toggled(bool) m_pGroupBoxScreens setDisabled(bool) 48 278 98 153 m_pRadioRelease toggled(bool) m_pGroupBoxScreens setEnabled(bool) 264 67 241 158 m_pRadioPressAndRelease toggled(bool) m_pGroupBoxScreens setEnabled(bool) 286 98 290 156 m_pRadioSwitchInDirection toggled(bool) m_pGroupBoxScreens setDisabled(bool) 38 313 64 195 m_pRadioLockCursorToScreen toggled(bool) m_pGroupBoxScreens setDisabled(bool) 48 339 79 234 m_pRadioSwitchToScreen toggled(bool) m_pKeySequenceWidgetHotkey setDisabled(bool) 84 280 185 123 synergy-1.4.12-Source/src/gui/res/HotkeyDialogBase.ui0000600000175000017500000000364511401533311022370 0ustar synergysynergy HotkeyDialogBase 0 0 344 86 Hotkey Enter the specification for the hotkey: Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok KeySequenceWidget QLineEdit
KeySequenceWidget.h
 buttonBox accepted() HotkeyDialogBase accept() 248 254 157 274 buttonBox rejected() HotkeyDialogBase reject() 316 260 286 274 synergy-1.4.12-Source/src/gui/res/icons/0000700000175000017500000000000012140644175017770 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/icons/16x16/0000700000175000017500000000000012140644175020555 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/icons/16x16/synergy-connected.png0000600000175000017500000000121311727133505024722 0ustar synergysynergy‰PNG  IHDRóÿatEXtSoftwareAdobe ImageReadyqÉe<-IDATxÚbüÿÿ?2Ÿð_H%±+KÜýÖ ~Ä»xº§Èê‘ jŽRÓ€˜&5>qÐe(52Ù‹€8Š   â€ýe‚ TcÓŒDAõ00†õÿSÒ7€˜ IÁ ^Ä;¡.pâH v@Ró ˆ5X€DÍ%+ ÏB¸u b–I[ˆßƒdHO4´‘Ár„fú÷,ÔUÈÀd€4šàN<~G—“cÑÓ¢î= ïé×GòËîÎË”4Ûïýý'ƒÔ?{†ïotž½ÿù÷A&!©Ø,çù·'rjW>ûóØ\X”ƒá¯À}–¿ 3°=°{òÂ4ë#[w Ã8ónNÍyòû¹˜$Ã/ÆO 6bN Z… ?^a`ÜþŸ±e§€44y°Eã FÍêRJºOÿÞ`øþí7ÃB³Ý kίa(ÙŸË )(ò˜¥ÚíýS Ý@ÅH8À¢ëç^†‰†k?3|øùáç·¿ ó®Lgàgaøõý#,%¶ñblÁ.øÛ”¡`OƒCšbÃÊ«‹.¼¹ÈÀÈÈÊ`.n{%3]Ru Ü;î-fxÅ7‘•å;ƒ—¼ÃÔ~ |fd”z8Íy~8#zv"M@,´íì Î_¿ù73µ\âÿï¿Ì¶ Îsʦ˜I[0ŽöÌ‚ðÁIEND®B`‚synergy-1.4.12-Source/src/gui/res/icons/16x16/synergy-connected.psd0000600000175000017500000007205411727133505024737 0ustar synergysynergy8BPS_¬8BIM8BIM%èñ\ó/Á¡¢{g­ÅdÕº8BIM$Aè Adobe Photoshop CS4 Windows 2011-05-03T19:59:09+01:00 2012-03-11T14:29:41Z 2012-03-11T14:29:41Z application/vnd.adobe.photoshop 3 sRGB IEC61966-2.1 xmp.iid:9132E868866BE1118D1BB745DDA83F09 xmp.did:579ABF47846BE1118D1BB745DDA83F09 xmp.did:579ABF47846BE1118D1BB745DDA83F09 created xmp.iid:579ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:26:44Z Adobe Photoshop CS4 Windows converted from image/png to application/vnd.adobe.photoshop saved xmp.iid:589ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:26:44Z Adobe Photoshop CS4 Windows / saved xmp.iid:5A9ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:27:23Z Adobe Photoshop CS4 Windows / saved xmp.iid:9132E868866BE1118D1BB745DDA83F09 2012-03-11T14:29:41Z Adobe Photoshop CS4 Windows / 1 720000/10000 720000/10000 2 256,257,258,259,262,274,277,284,530,531,282,283,296,301,318,319,529,532,306,270,271,272,305,315,33432;25A20E76EFF43D7330A2499A28EB4938 16 16 1 36864,40960,40961,37121,37122,40962,40963,37510,40964,36867,36868,33434,33437,34850,34852,34855,34856,37377,37378,37379,37380,37381,37382,37383,37384,37385,37386,37396,41483,41484,41486,41487,41488,41492,41493,41495,41728,41729,41730,41985,41986,41987,41988,41989,41990,41991,41992,41993,41994,41995,41996,42016,0,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,22,23,24,25,26,27,28,30;26EC271C894309D0BBA2E3379EE65237 8BIMíHH8BIM&?€8BIMî Transparency8BIM Transparency8BIMïÿÿd8BIM5ÿÿd8BIM8BIM 8BIM8BIMó 8BIM' 8BIMõH/fflff/ff¡™š2Z5-8BIMøpÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿè8BIM8BIM8BIM08BIM-8BIM@@8BIM8BIMönullbaseNameTEXTUserboundsObjcRct1Top longLeftlongBtomlongRghtlongslicesVlLsObjcslicesliceIDlonggroupIDlongoriginenum ESliceOrigin autoGeneratedTypeenum ESliceTypeImg boundsObjcRct1Top longLeftlongBtomlongRghtlongurlTEXTnullTEXTMsgeTEXTaltTagTEXTcellTextIsHTMLboolcellTextTEXT horzAlignenumESliceHorzAligndefault vertAlignenumESliceVertAligndefault bgColorTypeenumESliceBGColorTypeNone topOutsetlong leftOutsetlong bottomOutsetlong rightOutsetlong8BIM( ?ð8BIM H HLinomntrRGB XYZ Î 1acspMSFTIEC sRGBöÖÓ-HP cprtP3desc„lwtptðbkptrXYZgXYZ,bXYZ@dmndTpdmddĈvuedL†viewÔ$lumiømeas $tech0 rTRC< gTRC< bTRC< textCopyright (c) 1998 Hewlett-Packard CompanydescsRGB IEC61966-2.1sRGB IEC61966-2.1XYZ óQÌXYZ XYZ o¢8õXYZ b™·…ÚXYZ $ „¶ÏdescIEC http://www.iec.chIEC http://www.iec.chdesc.IEC 61966-2.1 Default RGB colour space - sRGB.IEC 61966-2.1 Default RGB colour space - sRGBdesc,Reference Viewing Condition in IEC61966-2.1,Reference Viewing Condition in IEC61966-2.1view¤þ_.ÏíÌ \žXYZ L VPWçmeassig CRT curv #(-27;@EJOTY^chmrw|†‹•šŸ¤©®²·¼ÁÆËÐÕÛàåëðöû %+28>ELRY`gnu|ƒ‹’š¡©±¹ÁÉÑÙáéòú &/8AKT]gqz„Ž˜¢¬¶ÁËÕàëõ !-8COZfr~Š–¢®ºÇÓàìù -;HUcq~Œš¨¶ÄÓáðþ +:IXgw†–¦µÅÕåö'7HYj{Œ¯ÀÑãõ+=Oat†™¬¿Òåø 2FZn‚–ª¾Òçû  % : O d y ¤ º Ï å û  ' = T j ˜ ® Å Ü ó " 9 Q i € ˜ ° È á ù  * C \ u Ž § À Ù ó & @ Z t Ž © Ã Þ ø.Id›¶Òî %A^z–³Ïì &Ca~›¹×õ1OmŒªÉè&Ed„£Ãã#Ccƒ¤Åå'Ij‹­Îð4Vx›½à&Il²ÖúAe‰®Ò÷@eŠ¯Õú Ek‘·Ý*QwžÅì;cŠ²Ú*R{£ÌõGp™Ãì@j”¾é>i”¿ê  A l ˜ Ä ð!!H!u!¡!Î!û"'"U"‚"¯"Ý# #8#f#”#Â#ð$$M$|$«$Ú% %8%h%—%Ç%÷&'&W&‡&·&è''I'z'«'Ü( (?(q(¢(Ô))8)k))Ð**5*h*›*Ï++6+i++Ñ,,9,n,¢,×- -A-v-«-á..L.‚.·.î/$/Z/‘/Ç/þ050l0¤0Û11J1‚1º1ò2*2c2›2Ô3 3F33¸3ñ4+4e4ž4Ø55M5‡5Â5ý676r6®6é7$7`7œ7×88P8Œ8È99B99¼9ù:6:t:²:ï;-;k;ª;è<' >`> >à?!?a?¢?â@#@d@¦@çA)AjA¬AîB0BrBµB÷C:C}CÀDDGDŠDÎEEUEšEÞF"FgF«FðG5G{GÀHHKH‘H×IIcI©IðJ7J}JÄK KSKšKâL*LrLºMMJM“MÜN%NnN·OOIO“OÝP'PqP»QQPQ›QæR1R|RÇSS_SªSöTBTTÛU(UuUÂVV\V©V÷WDW’WàX/X}XËYYiY¸ZZVZ¦Zõ[E[•[å\5\†\Ö]']x]É^^l^½__a_³``W`ª`üaOa¢aõbIbœbðcCc—cëd@d”dée=e’eçf=f’fèg=g“géh?h–hìiCišiñjHjŸj÷kOk§kÿlWl¯mm`m¹nnknÄooxoÑp+p†pàq:q•qðrKr¦ss]s¸ttptÌu(u…uáv>v›vøwVw³xxnxÌy*y‰yçzFz¥{{c{Â|!||á}A}¡~~b~Â#„å€G€¨ kÍ‚0‚’‚ôƒWƒº„„€„ã…G…«††r†×‡;‡ŸˆˆiˆÎ‰3‰™‰þŠdŠÊ‹0‹–‹üŒcŒÊ1˜ÿŽfŽÎ6žnÖ‘?‘¨’’z’ã“M“¶” ”Š”ô•_•É–4–Ÿ— —u—à˜L˜¸™$™™üšhšÕ›B›¯œœ‰œ÷dÒž@ž®ŸŸ‹Ÿú i Ø¡G¡¶¢&¢–££v£æ¤V¤Ç¥8¥©¦¦‹¦ý§n§à¨R¨Ä©7©©ªª««u«é¬\¬Ð­D­¸®-®¡¯¯‹°°u°ê±`±Ö²K²Â³8³®´%´œµµŠ¶¶y¶ð·h·à¸Y¸Ñ¹J¹Âº;ºµ».»§¼!¼›½½¾ ¾„¾ÿ¿z¿õÀpÀìÁgÁãÂ_ÂÛÃXÃÔÄQÄÎÅKÅÈÆFÆÃÇAÇ¿È=ȼÉ:ɹÊ8Ê·Ë6˶Ì5̵Í5͵Î6ζÏ7ϸÐ9кÑ<ѾÒ?ÒÁÓDÓÆÔIÔËÕNÕÑÖUÖØ×\×àØdØèÙlÙñÚvÚûÛ€ÜÜŠÝÝ–ÞÞ¢ß)߯à6à½áDáÌâSâÛãcãëäsäüå„æ æ–çç©è2è¼éFéÐê[êåëpëûì†ííœî(î´ï@ïÌðXðåñrñÿòŒóó§ô4ôÂõPõÞömöû÷Šøø¨ù8ùÇúWúçûwüü˜ý)ýºþKþÜÿmÿÿ8BIM8BIM Æ0ªÿØÿàJFIFHHÿí Adobe_CMÿîAdobed€ÿÛ„            ÿÀ"ÿÝÿÄ?   3!1AQa"q2‘¡±B#$RÁb34r‚ÑC%’Sðáñcs5¢²ƒ&D“TdE£t6ÒUâeò³„ÃÓuãóF'”¤…´•ÄÔäô¥µÅÕåõVfv†–¦¶ÆÖæö7GWgw‡—§·Ç×ç÷5!1AQaq"2‘¡±B#ÁRÑð3$bár‚’CScs4ñ%¢²ƒ&5ÂÒD“T£dEU6teâò³„ÃÓuãóF”¤…´•ÄÔäô¥µÅÕåõVfv†–¦¶ÆÖæö'7GWgw‡—§·ÇÿÚ ?ê ³þ±g[Uwz8”± %£n÷¿j¦×õ?ªJŠn¼ä`äF±µîk]»Ó²½ßš´Ksºm¶WQ»ã¡Ö"e ¸NǶVfEÏÏØ+iÊê9hmok¢¦ºç»ó= Ê¿àÓ%ñ/v pœCà–/›ƒ‹ôýÎ{¾ïK à£då&ø¿îx_ÿÙ8BIM!UAdobe PhotoshopAdobe Photoshop CS48BIM".MM*bj(1r2Ž‡i¤Ð ü€' ü€'Adobe Photoshop CS4 Windows2012:03:11 14:29:41   &(.HH8BIM ¶moptÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ4TargetSettingsMttCObjc NativeQuadBl longÿGrn longÿRd longÿTrnsbool fileFormatenum FileFormatPNG24 interlacedbool noMatteColorbooltransparencyDitherAlgorithmenumDitherAlgorithmNonetransparencyDitherAmountlong8BIM¡-msetnullVersionlong8BIM¢ms4w8BIM£ maniIRFR8BIMAnDsànullAFStlongFrInVlLsObjcnullFrIDlongVnÉ¡FrGAdoub@>FStsVlLsObjcnullFsIDlongAFrmlongFsFrVlLslongVnÉ¡LCntlong8BIMRoll8BIM¤mfriX,ÿýÿÿ~Ⱥ8BIMnormÿ <(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿLayer 08BIMluniLayer 08BIMlnsrlayr8BIMlyid8BIMclbl8BIMinfx8BIMknko8BIMlspf8BIMlclr8BIMshmdH8BIMcust4metadata layerTimedoubAÓ×+É! K8BIMfxrpÿÿŽŽŽ8BIMnormÿ(L(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿLayer 28BIMlfx2lnullScl UntF#Prc@YmasterFXSwitchboolebblObjcebblenabboolhglMenumBlnMScrnhglCObjcRGBCRd doub@oàGrn doub@oàBl doub@oàhglOUntF#Prc@RÀsdwMenumBlnMMltpsdwCObjcRGBCRd doubGrn doubBl doubsdwOUntF#Prc@RÀbvlTenumbvlTSfBLbvlSenumBESlEmbsuglgboollaglUntF#Ang@^LaldUntF#Ang@>srgRUntF#Prc?ðblurUntF#Pxl?ðbvlDenumBESsIn TrnSObjcShpCNm TEXTLinearCrv VlLsObjcCrPtHrzndoubVrtcdoubObjcCrPtHrzndoub@oàVrtcdoub@oàantialiasGlossboolSftnUntF#Pxl@useShapebool useTexturebool8BIMlrFXŒ8BIMcmnS8BIMdsdw3x8BIMmul ¿8BIMisdw3x8BIMmul ¿8BIMoglw*ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMiglw+ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMbevlNx€8BIMscrn8BIMmul ÿÿÿÿÿÿ¿¿ÿÿÿÿÿÿ8BIMsofi"8BIMnormÿÿÿÿÿ8BIMluniLayer 28BIMlnsrlayr8BIMlyid8BIMclbl8BIMinfx8BIMknko8BIMlspf8BIMlclr8BIMshmdH8BIMcust4metadata layerTimedoubAÓ×-µ {8BIMfxrpÿÿBBBB8BIMnormÿ<(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿLayer 38BIMluniLayer 38BIMlnsrlayr8BIMlyid8BIMclbl8BIMinfx8BIMknko8BIMlspf8BIMlclr8BIMshmdH8BIMcust4metadata layerTimedoubAÓ×-†…(þ8BIMfxrp@êc¬­¦@êc¬­¦ üûÿüþ÷ÿþÿõÿÿóÿóÿüÿ÷ÿñÿñÿñÿ÷ÿÿýÿüÿýÿüÿüÿÿúÿóÿÿõÿÿþ÷ÿþüûÿü     üÀÀùýÀÀøþÀÀÀùÿÀÀöÀÀÀÿùÀþÀþÿûþÿþüÿýÀõÿÿ€þüÿþþÿûþÿú€€€þÿ€€€÷€€€ÿ €€€€€€ù€€€þý€€€€ýù€€üÀÿÀ€€€ÿÀÿÀÿ€€€€€ÿÀÿÀÿÀ€€€€€€ÿÀÿÀÿ€€€€€€€ÀÿÀÿÀÿ€€€€€ÀÀÿÿÿ€€€€ÿÿÿÿÿÿÿÿ€€Àÿÿÿÿÿÿÿÿÿÿÿÿ€€ÿÿÿÿÿÿÿÿÿÿ€ÿ€ÿÿÿÿ€ÿ€ÿ€ÿ€ÿ€ÿ€€ÿ€ÿ€€ÿ€ÿ€ÿ€ÿ€ÿ€ÿÿ€ÿ€ÿ€ÿÿ€ÿ€ÿ€€ÿ€ÿ€ÿÿ€ÿ€ÿÿ€ÿ€ÿ€ÿ€€ÿ€    üÀÿÀþ€üþÿÀÿÀÿ€€ýÿÿÀÿÀÿÀû€ÿÿÀÿÀÿþ€€€ÀÿÀÿÀýü€ÀþÀù€€óÿ€Àó€ñòÿö€ÿ€ÿ€÷€ÿ€ÿ€ùÿ€ÿ€ÿ€ÿù€ÿ€ÿ€ÿùÿ€ÿ€ÿþù€ÿ€ü~ÃÛÛÃ~ZðÿÿÿÿÿÿðZ¥ÿÿÿÿÿÿÿÿÿÿ¥~ÿÿÿÿÿÿÿÿÿÿÿÿ~!ùÿÿÿ¿ff¿ÿÿÿù!ÿÿÿ¿33¿ÿÿÿÆÿÿÿffÿÿÿÌáÿÿÿÿÿÿêáÿÿÿÿÿÿçÀÿÿÿffÿÿÿÃxÿÿÿ¿33¿ÿÿÿxóÿÿÿ¿ff¿ÿÿÿó~ÿÿÿÿÿÿÿÿÿÿÿÿ~¢ÿÿÿÿÿÿÿÿÿÿ¥róÿÿÿÿÿÿórrºÌ̺rýÿýVý3ýÿþÿüVü3þÿÿúVú3ÿÿúVú3ÿùVù3ûVýÿû3üVûÿü3üVûÿü3ü„ûÿü:ü„ûÿü:û„ýÿû:ù„ù:ÿú„ú:ÿÿú„ú:ÿþÿü„ü:þÿýÿý„ý:ýÿýÿýý…ýÿþÿüü…þÿÿúú…ÿÿúú…ÿùù…ûýÿû…üûÿü…üûÿü…ü¹ûÿü†ü¹ûÿü†û¹ýÿû†ù¹ù†ÿú¹ú†ÿÿú¹ú†ÿþÿü¹ü†þÿýÿý¹ý†ýÿýÿýþýýÿþÿüþüþÿÿúþúÿÿúþúÿùþùûþýÿûüþûÿüüþûÿüüûÿü¬üûÿü¬ûýÿû¬ùù¬ÿúú¬ÿÿúú¬ÿþÿüü¬þÿýÿýý¬ýÿˆÍÑ‘*ÈÿÿÿÿÔ+ŠÿÿÿÿÿÿŸÌÿÿÿÿÿÿßÑÿÿÿÿÿÿã“ÿÿÿÿÿÿ¨)Õÿÿÿÿà7,›Þã¤8ÿäŠMExÚÿælR_\ŒxÖ„PhY˜ôQeMsXOðœ)HÓ©™é:#kCçÿ’ ZÜ?C"4ÊÿÚb \ÉÿÿôѼ¶ÇïÿõÄÀÐËÏÆìοÙÑáù¬·»ÔÑÇýÌ‹œ·ìåÞ󠢙èñÿÈŒ£°ñ«©È ¡äÿ𸗒²äÿÿá;1iÕÿã^AFCƒkÑx>G8…ôJY9^61ì˜3Ò™‰é/ \:çÿŒNØ0;‰ &ÅÿÖU OÅÿ8BIMPatt8BIMFMsk ÿÿ2ÿÿÿÿí«~nPcšéÿÿÿÿÿÿÿÃ`VVV333?·ÿÿÿÿý’VVVVV33333{ýÿÿ«VVVVVV333333šÿéZVVV€»êæ­f3338åªVVV€ÝÿÿÿÿÖf333˜|VVV»ÿÿÿÿÿÿ­333\jVVVêÿÿÿÿÿÿæ333D’„„„ðÿÿÿÿüÁkC]TM¢„„„ÎÿÿÿüŒR_\ŒnzÅ„„„£æÿÿ¼PhY˜ôQ}òŠ„„„£ÎðlsXOðœAÿ„„„„„„EÓ©™é:;ÿþ±„„„„„VCçÿ’ ’ÿÿÿÈŠ„„„T>C"MôÿÿÿÿöÈ¥a‚};8–óÿÿÿÿÿóÈ©Ÿ–¢Ãòÿÿÿÿÿÿÿ×–………ŒÔÿÿÿÿþ·……………°þÿÿÈ………………Ãÿñ’«ÒñðΤ………ˆïÆ«éÿÿÿÿ礅……Á¨ÒÿÿÿÿÿÿÎ………œñÿÿÿÿÿÿð………Á¹¹¹öÿÿÿÿþæÇ­«—‘ʹ¹¹ãÿÿÿþÑÀÐËÏ»¯Þ¹¹¹Ëñÿÿä¿ÙÑáù¬½ø¼¹¹¹ËãöÆÔÑÇýÌ‹§ÿܹ¹¹¹¹¹®ìåÞ󠢤ÿþÓ¹¹¹¹¹©¨ñÿÈŒ£Ëÿÿÿ༹¹¹—¥©È ¬ùÿÿÿÿúàÌÇž´¿¤žÍùÿÿÿÿÿÿÿþþ“ŸÁòÿÿÿÿÿÿÿÿþþþþˆÓÿÿÿÿÿþþþþþþ­þÿÿÿþþþþþþÁÿÿþþþþþÿÿðÍ¡„ïþþþþþÿÿÿÿÿæ¡¿þþþþÿÿÿÿÿÿÿÍšþþþþÿÿÿÿÿÿÿð‹,âÿÿÿÿû»_G†³´KŸÿÿÿüAFCƒvÃLÏÿÿ¶>G8…ôJ‰æLŸâ^^61ì˜3ÿ‰IÒ™‰é/ +ÿüg~:çÿŒŠÿÿÿ”³D;‰ @òÿÿÿÿî”Q@½Æ‰,'Žòÿ~ÃÛÛÃ~ZðÿÿÿÿÿÿðZ¥ÿÿÿÿÿÿÿÿÿÿ¥~ÿÿÿÿÿÿÿÿÿÿÿÿ~!ùÿÿÿ¿ff¿ÿÿÿù!ÿÿÿ¿33¿ÿÿÿÆÿÿÿffÿÿÿÌáÿÿÿÿÿÿêáÿÿÿˆÓÿÿÿçÀÿÿÿfÈÿÿÿÿÿÍxÿÿÿ¿3ŠÿÿÿÿÿÿÌóÿÿÿ¿fÒÿÿÿÿÿÿâ~ÿÿÿÿÿÿÿÿÿÿÿÿÿã¢ÿÿÿÿÿÿÿÿÿÿÿÿ¨róÿÿÿÿÿÿÿÿÿà7rºÌÌÆÈàã¤8synergy-1.4.12-Source/src/gui/res/icons/16x16/synergy-disconnected.png0000600000175000017500000000067211727133505025432 0ustar synergysynergy‰PNG  IHDRóÿatEXtSoftwareAdobe ImageReadyqÉe<\IDATxÚbüÿÿ?2Ÿð_H%±+KÜýÖ ~Ä»xº§Èê‘ jŽRÓ€˜&5>qÐe(52Ù‹€8Š   â€ýe‚ TcÓŒDAõ00†õÿSÒ7€˜ IÁ ^Ä;¡.pâH v@Ró ˆ5X€DÍ%+ ÏB¸u b–I[ˆßƒdHO4´‘Ár„fú÷,ÔUÈÀd€4šàN<~G—“cÑÓ¢î=VÝìŒÚèBàX¸&èŽÇèrw@ì@ŒlÝ%hŒ®Óº}­14&ÁVÆ–ÒÐhäÁÛÎÎÁ_@ÑÈTíö”¶»ÑL)œ Ä x&šfè>Zü–[x1 )qTjfú½H5"{êdg×mîÚ¡†AS§ A x ì@ÍïÕtõukboj£IEND®B`‚synergy-1.4.12-Source/src/gui/res/icons/16x16/synergy-disconnected.psd0000600000175000017500000007777411727171755025466 0ustar synergysynergy8BPSi¼8BIM8BIM%èñ\ó/Á¡¢{g­ÅdÕº8BIM$Kê Adobe Photoshop CS4 Windows 2011-05-03T19:59:09+01:00 2012-03-11T18:29:41Z 2012-03-11T18:29:41Z application/vnd.adobe.photoshop 3 sRGB IEC61966-2.1 xmp.iid:9332E868866BE1118D1BB745DDA83F09 xmp.did:529ABF47846BE1118D1BB745DDA83F09 xmp.did:529ABF47846BE1118D1BB745DDA83F09 created xmp.iid:529ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:12:48Z Adobe Photoshop CS4 Windows converted from image/png to application/vnd.adobe.photoshop saved xmp.iid:539ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:12:48Z Adobe Photoshop CS4 Windows / saved xmp.iid:549ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:17:13Z Adobe Photoshop CS4 Windows / saved xmp.iid:559ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:19:22Z Adobe Photoshop CS4 Windows / saved xmp.iid:569ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:26:15Z Adobe Photoshop CS4 Windows / saved xmp.iid:599ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:26:53Z Adobe Photoshop CS4 Windows / saved xmp.iid:5B9ABF47846BE1118D1BB745DDA83F09 2012-03-11T14:27:23Z Adobe Photoshop CS4 Windows / saved xmp.iid:9032E868866BE1118D1BB745DDA83F09 2012-03-11T14:28:02Z Adobe Photoshop CS4 Windows / saved xmp.iid:9232E868866BE1118D1BB745DDA83F09 2012-03-11T14:29:44Z Adobe Photoshop CS4 Windows / saved xmp.iid:9332E868866BE1118D1BB745DDA83F09 2012-03-11T18:29:41Z Adobe Photoshop CS4 Windows / 1 720000/10000 720000/10000 2 256,257,258,259,262,274,277,284,530,531,282,283,296,301,318,319,529,532,306,270,271,272,305,315,33432;596FF2EDC96B7B91322ECF19E669E51F 16 16 1 36864,40960,40961,37121,37122,40962,40963,37510,40964,36867,36868,33434,33437,34850,34852,34855,34856,37377,37378,37379,37380,37381,37382,37383,37384,37385,37386,37396,41483,41484,41486,41487,41488,41492,41493,41495,41728,41729,41730,41985,41986,41987,41988,41989,41990,41991,41992,41993,41994,41995,41996,42016,0,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,22,23,24,25,26,27,28,30;26EC271C894309D0BBA2E3379EE65237 8BIMíHH8BIM&?€8BIMî Transparency8BIM Transparency8BIMïÿÿd8BIM5ÿÿd8BIM8BIM 8BIM28BIMó 8BIM' 8BIMõH/fflff/ff¡™š2Z5-8BIMøpÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿè8BIM8BIM8BIM08BIM-8BIM@@8BIM8BIMönullbaseNameTEXTUserboundsObjcRct1Top longLeftlongBtomlongRghtlongslicesVlLsObjcslicesliceIDlonggroupIDlongoriginenum ESliceOrigin autoGeneratedTypeenum ESliceTypeImg boundsObjcRct1Top longLeftlongBtomlongRghtlongurlTEXTnullTEXTMsgeTEXTaltTagTEXTcellTextIsHTMLboolcellTextTEXT horzAlignenumESliceHorzAligndefault vertAlignenumESliceVertAligndefault bgColorTypeenumESliceBGColorTypeNone topOutsetlong leftOutsetlong bottomOutsetlong rightOutsetlong8BIM( ?ð8BIM H HLinomntrRGB XYZ Î 1acspMSFTIEC sRGBöÖÓ-HP cprtP3desc„lwtptðbkptrXYZgXYZ,bXYZ@dmndTpdmddĈvuedL†viewÔ$lumiømeas $tech0 rTRC< gTRC< bTRC< textCopyright (c) 1998 Hewlett-Packard CompanydescsRGB IEC61966-2.1sRGB IEC61966-2.1XYZ óQÌXYZ XYZ o¢8õXYZ b™·…ÚXYZ $ „¶ÏdescIEC http://www.iec.chIEC http://www.iec.chdesc.IEC 61966-2.1 Default RGB colour space - sRGB.IEC 61966-2.1 Default RGB colour space - sRGBdesc,Reference Viewing Condition in IEC61966-2.1,Reference Viewing Condition in IEC61966-2.1view¤þ_.ÏíÌ \žXYZ L VPWçmeassig CRT curv #(-27;@EJOTY^chmrw|†‹•šŸ¤©®²·¼ÁÆËÐÕÛàåëðöû %+28>ELRY`gnu|ƒ‹’š¡©±¹ÁÉÑÙáéòú &/8AKT]gqz„Ž˜¢¬¶ÁËÕàëõ !-8COZfr~Š–¢®ºÇÓàìù -;HUcq~Œš¨¶ÄÓáðþ +:IXgw†–¦µÅÕåö'7HYj{Œ¯ÀÑãõ+=Oat†™¬¿Òåø 2FZn‚–ª¾Òçû  % : O d y ¤ º Ï å û  ' = T j ˜ ® Å Ü ó " 9 Q i € ˜ ° È á ù  * C \ u Ž § À Ù ó & @ Z t Ž © Ã Þ ø.Id›¶Òî %A^z–³Ïì &Ca~›¹×õ1OmŒªÉè&Ed„£Ãã#Ccƒ¤Åå'Ij‹­Îð4Vx›½à&Il²ÖúAe‰®Ò÷@eŠ¯Õú Ek‘·Ý*QwžÅì;cŠ²Ú*R{£ÌõGp™Ãì@j”¾é>i”¿ê  A l ˜ Ä ð!!H!u!¡!Î!û"'"U"‚"¯"Ý# #8#f#”#Â#ð$$M$|$«$Ú% %8%h%—%Ç%÷&'&W&‡&·&è''I'z'«'Ü( (?(q(¢(Ô))8)k))Ð**5*h*›*Ï++6+i++Ñ,,9,n,¢,×- -A-v-«-á..L.‚.·.î/$/Z/‘/Ç/þ050l0¤0Û11J1‚1º1ò2*2c2›2Ô3 3F33¸3ñ4+4e4ž4Ø55M5‡5Â5ý676r6®6é7$7`7œ7×88P8Œ8È99B99¼9ù:6:t:²:ï;-;k;ª;è<' >`> >à?!?a?¢?â@#@d@¦@çA)AjA¬AîB0BrBµB÷C:C}CÀDDGDŠDÎEEUEšEÞF"FgF«FðG5G{GÀHHKH‘H×IIcI©IðJ7J}JÄK KSKšKâL*LrLºMMJM“MÜN%NnN·OOIO“OÝP'PqP»QQPQ›QæR1R|RÇSS_SªSöTBTTÛU(UuUÂVV\V©V÷WDW’WàX/X}XËYYiY¸ZZVZ¦Zõ[E[•[å\5\†\Ö]']x]É^^l^½__a_³``W`ª`üaOa¢aõbIbœbðcCc—cëd@d”dée=e’eçf=f’fèg=g“géh?h–hìiCišiñjHjŸj÷kOk§kÿlWl¯mm`m¹nnknÄooxoÑp+p†pàq:q•qðrKr¦ss]s¸ttptÌu(u…uáv>v›vøwVw³xxnxÌy*y‰yçzFz¥{{c{Â|!||á}A}¡~~b~Â#„å€G€¨ kÍ‚0‚’‚ôƒWƒº„„€„ã…G…«††r†×‡;‡ŸˆˆiˆÎ‰3‰™‰þŠdŠÊ‹0‹–‹üŒcŒÊ1˜ÿŽfŽÎ6žnÖ‘?‘¨’’z’ã“M“¶” ”Š”ô•_•É–4–Ÿ— —u—à˜L˜¸™$™™üšhšÕ›B›¯œœ‰œ÷dÒž@ž®ŸŸ‹Ÿú i Ø¡G¡¶¢&¢–££v£æ¤V¤Ç¥8¥©¦¦‹¦ý§n§à¨R¨Ä©7©©ªª««u«é¬\¬Ð­D­¸®-®¡¯¯‹°°u°ê±`±Ö²K²Â³8³®´%´œµµŠ¶¶y¶ð·h·à¸Y¸Ñ¹J¹Âº;ºµ».»§¼!¼›½½¾ ¾„¾ÿ¿z¿õÀpÀìÁgÁãÂ_ÂÛÃXÃÔÄQÄÎÅKÅÈÆFÆÃÇAÇ¿È=ȼÉ:ɹÊ8Ê·Ë6˶Ì5̵Í5͵Î6ζÏ7ϸÐ9кÑ<ѾÒ?ÒÁÓDÓÆÔIÔËÕNÕÑÖUÖØ×\×àØdØèÙlÙñÚvÚûÛ€ÜÜŠÝÝ–ÞÞ¢ß)߯à6à½áDáÌâSâÛãcãëäsäüå„æ æ–çç©è2è¼éFéÐê[êåëpëûì†ííœî(î´ï@ïÌðXðåñrñÿòŒóó§ô4ôÂõPõÞömöû÷Šøø¨ù8ùÇúWúçûwüü˜ý)ýºþKþÜÿmÿÿ8BIM8BIM Ã0§ÿØÿàJFIFHHÿí Adobe_CMÿîAdobed€ÿÛ„            ÿÀ"ÿÝÿÄ?   3!1AQa"q2‘¡±B#$RÁb34r‚ÑC%’Sðáñcs5¢²ƒ&D“TdE£t6ÒUâeò³„ÃÓuãóF'”¤…´•ÄÔäô¥µÅÕåõVfv†–¦¶ÆÖæö7GWgw‡—§·Ç×ç÷5!1AQaq"2‘¡±B#ÁRÑð3$bár‚’CScs4ñ%¢²ƒ&5ÂÒD“T£dEU6teâò³„ÃÓuãóF”¤…´•ÄÔäô¥µÅÕåõVfv†–¦¶ÆÖæö'7GWgw‡—§·ÇÿÚ ?ê ³þ±g[Uwz8”± %£n÷¿j¦×õ?ªJŠn¼ä`äF±µîk]»Ó²½ßš´Ksºm¶WQ»ã¡Ö"e ¸NǶU Î¥õ£©QmÔ0¨:“1¹íkÜêXý©ø¹¿½q@ãû¼pzeŒú¸x¾YqðÃÜ÷8sQG1:åú/ÿÙ8BIM!UAdobe PhotoshopAdobe Photoshop CS48BIM".MM*bj(1r2Ž‡i¤Ð ü€' ü€'Adobe Photoshop CS4 Windows2012:03:11 18:29:41   &(.HH8BIM ¶moptÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ4TargetSettingsMttCObjc NativeQuadBl longÿGrn longÿRd longÿTrnsbool fileFormatenum FileFormatPNG24 interlacedbool noMatteColorbooltransparencyDitherAlgorithmenumDitherAlgorithmNonetransparencyDitherAmountlong8BIM¡-msetnullVersionlong8BIM¢ms4w8BIM£ maniIRFR8BIMAnDsônullAFStlongFrInVlLsObjcnullFrIDlongVs©FrGAdoub@>FrGLdoub@IFStsVlLsObjcnullFsIDlongAFrmlongFsFrVlLslongVs©LCntlong8BIMRoll8BIM¤mfriìÿþÿÿŽŽŽ8BIMnormÿ(L(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿLayer 48BIMlfx2lnullScl UntF#Prc@YmasterFXSwitchboolebblObjcebblenabboolhglMenumBlnMScrnhglCObjcRGBCRd doub@oàGrn doub@oàBl doub@oàhglOUntF#Prc@RÀsdwMenumBlnMMltpsdwCObjcRGBCRd doubGrn doubBl doubsdwOUntF#Prc@RÀbvlTenumbvlTSfBLbvlSenumBESlEmbsuglgboollaglUntF#Ang@^LaldUntF#Ang@>srgRUntF#Prc?ðblurUntF#Pxl?ðbvlDenumBESsIn TrnSObjcShpCNm TEXTLinearCrv VlLsObjcCrPtHrzndoubVrtcdoubObjcCrPtHrzndoub@oàVrtcdoub@oàantialiasGlossboolSftnUntF#Pxl@useShapebool useTexturebool8BIMlrFXŒ8BIMcmnS8BIMdsdw3x8BIMmul ¿8BIMisdw3x8BIMmul ¿8BIMoglw*ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMiglw+ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMbevlNx€8BIMscrn8BIMmul ÿÿÿÿÿÿ¿¿ÿÿÿÿÿÿ8BIMsofi"8BIMnormÿÿÿÿÿ8BIMluniLayer 48BIMlnsrlayr8BIMlyid8BIMclbl8BIMinfx8BIMknko8BIMlspf8BIMlclr8BIMshmdH8BIMcust4metadata layerTimedoubAÓ×-ÂO»X8BIMfxrpÿÿŒŠŠŠ8BIMnormÿ*T(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿLayer 08BIMlfx2tnullScl UntF#Prc@YmasterFXSwitchboolebblObjcebblenabboolhglMenumBlnM lighterColorhglCObjcRGBCRd doub@oàGrn doub@oàBl doub@oàhglOUntF#Prc@RÀsdwMenumBlnMMltpsdwCObjcRGBCRd doubGrn doubBl doubsdwOUntF#Prc@RÀbvlTenumbvlTSfBLbvlSenumBESlInrBuglgboollaglUntF#Ang@^LaldUntF#Ang@>srgRUntF#Prc?ðblurUntF#Pxl?ðbvlDenumBESsIn TrnSObjcShpCNm TEXTLinearCrv VlLsObjcCrPtHrzndoubVrtcdoubObjcCrPtHrzndoub@oàVrtcdoub@oàantialiasGlossboolSftnUntF#Pxl?ðuseShapebool useTexturebool8BIMlrFXŒ8BIMcmnS8BIMdsdw3x8BIMmul ¿8BIMisdw3x8BIMmul ¿8BIMoglw*ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMiglw+ÿÿÿÿ¾½8BIMscrn¿ÿÿÿÿ¾½8BIMbevlNx8BIMlgCl8BIMmul ÿÿÿÿÿÿ¿¿ÿÿÿÿÿÿ8BIMsofi"8BIMnormÿÿÿÿÿ8BIMluniLayer 08BIMlnsrlayr8BIMlyid8BIMclbl8BIMinfx8BIMknko8BIMlspf8BIMlclr8BIMshmdH8BIMcust4metadata layerTimedoubAÓ×,_o„ƒ8BIMfxrp~ÃÛÛÃ~ZðÿÿÿÿÿÿðZ¥ÿÿÿÿÿÿÿÿÿÿ¥~ÿÿÿÿÿÿÿÿÿÿÿÿ~!ùÿÿÿ¿ff¿ÿÿÿù!ÿÿÿ¿33¿ÿÿÿÆÿÿÿffÿÿÿÌáÿÿÿÿÿÿêáÿÿÿÿÿÿçÀÿÿÿffÿÿÿÃxÿÿÿ¿33¿ÿÿÿxóÿÿÿ¿ff¿ÿÿÿó~ÿÿÿÿÿÿÿÿÿÿÿÿ~¢ÿÿÿÿÿÿÿÿÿÿ¥róÿÿÿÿÿÿórrºÌ̺rýÿýVý3ýÿþÿüVü3þÿÿúVú3ÿÿúVú3ÿùVù3ûVýÿû3üVûÿü3üVûÿü3ü„ûÿü:ü„ûÿü:û„ýÿû:ù„ù:ÿú„ú:ÿÿú„ú:ÿþÿü„ü:þÿýÿý„ý:ýÿýÿýý…ýÿþÿüü…þÿÿúú…ÿÿúú…ÿùù…ûýÿû…üûÿü…üûÿü…ü¹ûÿü†ü¹ûÿü†û¹ýÿû†ù¹ù†ÿú¹ú†ÿÿú¹ú†ÿþÿü¹ü†þÿýÿý¹ý†ýÿýÿýþýýÿþÿüþüþÿÿúþúÿÿúþúÿùþùûþýÿûüþûÿüüþûÿüüûÿü¬üûÿü¬ûýÿû¬ùù¬ÿúú¬ÿÿúú¬ÿþÿüü¬þÿýÿýý¬ýÿ  üûÿüþ÷ÿþÿõÿÿóÿüÿýüÿüÿûüÿýÿùýÿýÿùýÿýÿùýÿýÿùýÿüÿûüÿüÿýüÿóÿÿõÿÿþ÷ÿþüûÿ™ý üþVý3ýþüVû3ÿÿûVú3úVù3úVù3ùVù3úVþû3ûVüü3ü„úý:ü„úý:û„üü:ú„þû:ù„ù:ú„ù:ú„ù:ÿû„þ:ÿþ: üþý…ýþüû…ÿÿûú…úù…úù…ùù…úþû…ûüü…ü¹úý†ü¹úý†û¹üü†ú¹þû†ù¹ù†ú¹ù†ú¹ù†ÿû¹þ†ÿþ† üþþýýþüþûÿÿûþúúþùúþùùþùúþþûûþüüüúý¬üúý¬ûüü¬úþû¬ùù¬úù¬úù¬ÿûþ¬ÿþ¬8BIMPatt8BIMFMsk ÿÿ2ÿÿÿÿí«~nPcšéÿÿÿÿÿÿÿÃ`VVV333?·ÿÿÿÿý’VVVVV33333{ýÿÿ«VVVVVV333333šÿéZVVV€»êæ­f3338åªVVV€ÝÿÿÿÿÖf333˜|VVV»ÿÿÿÿÿÿ­333\jVVVêÿÿÿÿÿÿæ333D’„„„ðÿÿÿÿÿÿç:::M¢„„„Îÿÿÿÿÿÿ°:::hÅ„„„£æÿÿÿÿØk:::¢òŠ„„„£Îðç°k:::Cêÿ„„„„„„::::::žÿÿþ±„„„„„:::::€ýÿÿÿÿÈŠ„„„:::C§ÿÿÿÿÿÿÿöÈ¥ao§ñÿÿÿÿÿÿÿÿóÈ©Ÿ–¢Ãòÿÿÿÿÿÿÿ×–………ŒÔÿÿÿÿþ·……………°þÿÿÈ………………Ãÿñ’«ÒñðΤ………ˆïÆ«éÿÿÿÿ礅……Á¨ÒÿÿÿÿÿÿÎ………œñÿÿÿÿÿÿð………Á¹¹¹öÿÿÿÿÿÿð†††‘ʹ¹¹ãÿÿÿÿÿÿφ††¢Þ¹¹¹Ëñÿÿÿÿ礆††Æø¼¹¹¹ËãöðϤ†††Œòÿܹ¹¹¹¹¹††††††ÃÿÿþÓ¹¹¹¹¹†††††±þÿÿÿÿ༹¹¹†††ŒÉÿÿÿÿÿÿÿúàÌÇž§Éöÿÿÿÿÿÿÿÿÿÿþþ“ŸÁòÿÿÿÿÿÿÿÿþþþþˆÓÿÿÿÿÿþþþþþþ­þÿÿÿþþþþþþÁÿÿþþþþþÿÿðÍ¡„ïþþþþþÿÿÿÿÿæ¡¿þþþþÿÿÿÿÿÿÿÍšþþþþÿÿÿÿÿÿÿð‹,âÿÿÿÿÿÿõ¬¬¬´KŸÿÿÿÿÿÿÞ¬¬¬ÀLÏÿÿÿÿîÁ¬¬¬ØæLŸâõÞÁ¬¬¬°öÿ‰¬¬¬¬¬¬Öÿÿüg¬¬¬¬¬Éþÿÿÿÿ”¬¬¬°Úÿÿÿÿÿÿÿî”Q@½ÂÚùÿÿÿÿ~ÃÛÛÃ~ZðÿÿÿÿÿÿðZ¥ÿÿÿÿÿÿÿÿÿÿ¥~ÿÿÿÿÿÿÿÿÿÿÿÿ~!ùÿÿÿ¿ff¿ÿÿÿù!ÿÿÿ¿33¿ÿÿÿÆÿÿÿffÿÿÿÌáÿÿÿÿÿÿêáÿÿÿÿÿÿçÀÿÿÿffÿÿÿÃxÿÿÿ¿33¿ÿÿÿxóÿÿÿ¿ff¿ÿÿÿó~ÿÿÿÿÿÿÿÿÿÿÿÿ~¢ÿÿÿÿÿÿÿÿÿÿ¥róÿÿÿÿÿÿórrºÌ̺rsynergy-1.4.12-Source/src/gui/res/icons/16x16/warning.png0000600000175000017500000000126511727133224022734 0ustar synergysynergy‰PNG  IHDRóÿatEXtSoftwareAdobe ImageReadyqÉe<WIDATxÚ¤SMOA~f)í²`[K[ mm”LÄpS€ÇõàÉ¿àÕ¢WΞ É".=ŠFILĈؤ߻;³3¾;KZ›NöÍ|¾Ï<ï³Ï0¥þ§Å.Nšµ Ì—J|ˆnç‡7TxAfù 3犰¬Ó”ôPJ¸ ¥¤\àhÿ¥2ç \_J¢]ßRív½îÜ÷ èLü2€"Ô@¼îðQ¥µ* +@œA¶vœÓ¯›ð @œn@.AÎ=¼cÏͧa¥¯!>“@¦¼oÔ´Ã3žKû³¸Pß{á¿…òÝêx}qµ&{áÐiÕwà{! ÿ*€ hCtíT>39éÙÍ(ÌEî°¡Y ú#Á)á/€ncË^ Å;Ë´9œhCÌ«Eª¯YtŽßRI‘c€€÷!ÜS;½˜Eb&®“&µqÄè÷eËy¸ƒÍb8r!¨Œ1À—݇Ž”oß dˆ’Æ 8ב¯ä`°‘fÑoìÁó‚ÈHÂûvv¶D„‹À'w’ž=-EÚ¸Q9cÈ•³øutb›³b!ÀB§í¿zà÷Ð^]/“ÚâÜe‘Å#’Æ9Qê¥b¨}úŽ¸us›VÅüáO}ûÂR jØ%aCu¥f¼w¤ózn‘écÆtŠ)ÿhئ•G¬öú±#ýoH&,HR¡xäñ‹oLzT77ÀŒ)=O&¦Ð`­û¼}_r§0ƒ>Ù8LÖÙtÓ¤±h΢qÈ¢§,´ÎrD,‘Æ›wµxÈ.ÖÖWðG€&TJzéÌy IEND®B`‚synergy-1.4.12-Source/src/gui/res/icons/256x256/0000700000175000017500000000000012140644175020731 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/icons/256x256/synergy.ico0000600000175000017500000106227611727171755023156 0ustar synergysynergy ( V00 ¨%~   ¨&F ˆ ÎV hV`( ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ñïï çêî2ëîòìïóëîòíïðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííííííííééé(ãááOãááOãááOßÝÝcÚØØyÖÔÔ€ÖÔÔ€ÖÔÔÿÍÐÔÿÍÐÔÿÎÑÕÿÐÓ×ÿÒÔÕƒÒÔÕƒÕÕÕ€×××~ßßßYâââEäæç;æèé2äçë;æéí2êíòîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëæææ2àààOÔÖÖ€ÊÐÏÿÃÎÌÿ¿ÊÈÿµÂÀÿ²¿½ÿ­º¸ÿ«³²ÿ¦®­ÿ¦«ªÿ¥ª©ÿ¤©¨ÿ¤§ÿš¡¤ÿ›££ÿ£§¨ÿ¥ª¨ÿ©ª¨ÿ¬­©ÿ±²®ÿ³²®ÿ¹¸´ÿ¿À¼ÿÄÅÁÿÅÈÆÿÌÏÍÿÕ××ÿÜÞÞcàáßYæçå;îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ çéé2ÞààYÕ××€ÕÐщÊÅÆʾ¾¾ÿ···ÿ©««ÿœ¢¡ÿ’›ÿŽ™—ÿ‰–”ÿ‚ÿz‡…ÿz‚ÿz‚ÿ|€ÿz~ÿv{zÿsz}ÿry|ÿrzzÿw{|ÿx}{ÿ}~|ÿ‚~ÿ„…ÿ‰ˆ„ÿŒˆÿ‘’Žÿ–—“ÿ™œšÿ £¡ÿ©««ÿ°²²ÿÀÁ¿ÿÈÉÇÿÑÒЉÙÚØyÝÞÜcãäâEìíëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêììãååEÕÚÙ€ÊÏÎÿ¿ÅÄÿ´º¹ÿ¶®¯ÿ¨ ¡ÿ—••ÿŠŒŒÿw‚€ÿjxvÿ_tqÿXqmÿId`ÿJeaÿNgcÿUjgÿZmjÿ_mkÿ]kiÿ]hfÿgroÿmtqÿkrmÿgkfÿejaÿlmdÿlnbÿmk`ÿhgYÿgfXÿgeZÿki^ÿsqgÿ}{qÿ†…{ÿŒ‹ÿ‘’Žÿœ™ÿ¬­©ÿº»·ÿÂÿÿÊËÇÿØÙ×~åæä;éêè(îïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÜÜÜcÏÑÑÂÄÄÿ¯´³ÿŸ¤£ÿŽ”“ÿ‡†ÿ{stÿumnÿljjÿgiiÿ]hfÿZhfÿWliÿTmiÿb}yÿoŠ†ÿš–ÿŽ£ ÿ“¦£ÿ—¥£ÿ—¥£ÿœ§¥ÿ¦±®ÿ¯¶³ÿ¬³®ÿ¥©¤ÿ¡¦ÿ¨© ÿ¦¨œÿ¤¢—ÿœ›ÿ‘‚ÿtÿushÿomcÿlj`ÿih^ÿgf\ÿfgcÿklhÿvwsÿ„…ÿ‘ÿ›œ˜ÿ«¬ªÿº»¹ÿÊËÉÿÔÕÓƒãäâEîïíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëßßßYÖÖÖ~ÂÂÂܳ³³ÿž£¢ÿ’‘ÿ{€ÿoutÿckjÿYa`ÿFjdÿEvnÿUˆ€ÿ\˜Žÿ]¡–ÿ`¬ ÿe·ªÿcº¬ÿjŶÿtÏÀÿ‚ÚÌÿ‹àÒÿ‘áÔÿ•áÕÿšäØÿ¥çÜÿÛâÝÿáæÝÿÝåÚÿÚÞÓÿØÛÌÿÛÚÌÿÚÚÈÿÙÕÃÿÖѼÿÍȳÿÁ»¨ÿ·±žÿ°ª—ÿª¤‘ÿ¡Šÿœ—ˆÿ‚„~ÿqsmÿ`b\ÿ]_Yÿcd`ÿnokÿ|}yÿ‰Š†ÿžŸ›ÿ«¬¨ÿ¾¿½ÿÏÐÎÝÞÜcèéç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÞÜÜcÍËË¥¶¶¶ÿ¨¨¨ÿ———ÿ………ÿotsÿchgÿagfÿkqpÿu}|ÿy€ÿq•ÿz«£ÿ”Ç¿ÿžÚÐÿœàÕÿšæÚÿ™ëÞÿ“êÜÿëÜÿèÙÿŒäÖÿâÔÿ“ãÖÿšæÚÿ êÞÿªìáÿÞåàÿáæÝÿÝåÚÿÝáÖÿÚÝÎÿÙØÊÿÖÖÄÿÙÕÃÿÝØÃÿÜ×ÂÿÜÖÃÿàÚÇÿãÝÊÿâÜÉÿÛ×ÄÿÖÑÂÿÂľÿ§©£ÿŒŽˆÿ€‚|ÿ{|xÿstpÿjkgÿefbÿmnjÿz{wÿŽÿ¡¢ ÿ³´²ÿÅÆÄÊ×ØÖ~âãáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòæä;êáÞYÊÁ¾ÿ¿··ÿ¯«ªÿŽÿy|zÿdolÿWniÿ@ibÿ5jaÿCˆ}ÿf¸«ÿÜÍÿ~è×ÿoîÕÿmìÓÿlèÐÿjåÑÿ^åÏÿVäÑÿMäÐÿIäÏÿIäÏÿDäÎÿBæÍÿCçÎÿPéÐÿlçÓÿ‰éØÿ¨êÞÿÈë×ÿØçÒÿÚæÒÿãåÏÿèáÈÿëÛ·ÿçÕ¦ÿæÔ™ÿáÓ‹ÿàÓ‡ÿáÖ†ÿã؈ÿåÕÿçÔ—ÿëÒ ÿîÕ£ÿèà¥ÿìä©ÿêß­ÿçÙ¯ÿãÔ³ÿÑĪÿ§™‡ÿzndÿrhaÿngdÿokjÿxywÿ‰ŒŠÿ˜Ÿœÿª´®ÿ»Å¿ÿÓÓÓƒãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíçÛÙyÌÀ¾ÿÄ»¸ÿµ¬©ÿ–ŽŽÿrnmÿ][ZÿUXVÿ\gdÿxŠÿ¹²ÿ™ÎÅÿ‘ÖËÿ‹ÝÐÿ„áÒÿxâÑÿhçÎÿfåÌÿfâÊÿdßËÿZáËÿRàÍÿIàÌÿFáÌÿFáÌÿAáËÿ?ãÊÿAåÌÿMæÍÿiäÐÿ†æÕÿ¥çÛÿÆéÕÿ×æÑÿØäÐÿàâÌÿäÝÄÿåÕ±ÿáÏ ÿàΓÿÜΆÿÛ΂ÿÛЀÿÜÑÿÞΉÿÞËŽÿâÉ—ÿåÌšÿÔÌ‘ÿÝÕšÿåÚ¨ÿæØ®ÿãÔ³ÿÝжÿ×É·ÿÌÀ¶ÿ¿µ®ÿ§ ÿxtsÿUVTÿZ][ÿjqnÿ}‡ÿ“—ÿ³³³ÿÎÎÎÒÓщßàÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïôò îïíèààOÖÎηµ´ÿž¥¢ÿ~‰†ÿXojÿ8ZTÿFumÿcŸ•ÿbªžÿg»¯ÿrÓÅÿ|éÙÿuïÝÿdêÖÿRåÏÿMâÎÿBãÍÿ2çËÿ1æÊÿ4âÊÿ4âÊÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿçÛÿÅêÖÿÖéÐÿ×çÏÿßåÆÿãÞ·ÿãסÿáÒÿàÓ}ÿÝÔmÿÛÖcÿÚ×]ÿÚ×]ÿÜÕ`ÿÜÔcÿßÓgÿáÒnÿØÑtÿÙÏ{ÿÚÓ~ÿÞÕ…ÿàØ‹ÿäÙ•ÿêà¤ÿðè³ÿçÞ³ÿßÖ´ÿÄ» ÿ¬¥’ÿŸ—Šÿ{upÿc\Yÿjefÿÿ   ÿ¯®°ÿÌËÍ¥ÙÛÜyæèé2îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìõòãèæEÕÖÔÿû»ÿª¢¢ÿ‰‡†ÿszwÿZebÿczuÿc…ÿu¤œÿ—ÓÉÿ¢êÞÿ–êÞÿ„å×ÿrßÏÿaÛÉÿWÝÉÿNáËÿKàÌÿ@áËÿ0åÉÿ/äÈÿ3áÉÿ3áÉÿ-ãËÿ)ãËÿ(ãÍÿ(ãÍÿ,ãÎÿ0ãÎÿ/æÌÿ4çÎÿEçÎÿ`åÑÿ{çÕÿœæÚÿÅêÖÿ×êÑÿØèÐÿàæÇÿâݶÿáÕŸÿàÑŒÿßÒ|ÿÜÓlÿÚÕbÿØÕ[ÿØÕ[ÿÚÓ^ÿÙÑ`ÿÛÏcÿÝÎjÿÚÓvÿÓÉuÿÍÆqÿÑÈxÿÓË~ÿÔÉ…ÿÓÉÿÒÊ•ÿÖÍ¢ÿßÖ´ÿåÜÁÿèáÎÿÜÔÇÿ«¥ ÿ‚{xÿxstÿlllÿdddÿ|{}ÿ›šœÿ¨ª«ÿÊÌÍÿÞàáYäæç;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßçæYÏ×Ö»ÃÂÿ¤¬«ÿŒ‘ÿtywÿKmgÿ?vmÿ=xpÿnº¯ÿŠéÛÿ€ðßÿjêÙÿTäÑÿGâÍÿ:âËÿ5âÌÿ/åÍÿ.æÎÿ)åÌÿ"ãÉÿ áÇÿ#åÎÿ"äÍÿ(ãÍÿ(ãÍÿ"ãÎÿ"ãÎÿ"ãÎÿ%âÍÿ*áÌÿ1àÌÿ0âËÿ9ãÍÿFäÌÿbâÏÿ|åÒÿ™äÖÿ»åÚÿÑáÚÿÒãÕÿÝáÈÿàÚµÿâÑžÿáψÿäÐyÿåÒkÿâÔ\ÿàÕUÿàÕUÿáÕWÿàÓYÿàÑ]ÿáÐaÿÚÍ_ÿÜÏaÿÝÐbÿÝÐbÿÜÑbÿÝÒcÿÚÒgÿÛÐnÿØÍqÿÚÏÿàÔŽÿã×ÿêܬÿòß¼ÿëÙºÿÛÆ°ÿš—‰ÿe`Wÿlj`ÿyupÿ‰‡†ÿ¥¢¤ÿ²´µÿÊÊÐ¥ÛÛánëëñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîììàââOÍÕÔš¶¾½ÿ•œÿx€ÿinlÿ]b`ÿnŠÿ’ÉÀÿšÕÍÿÜÑÿàÒÿnÞÍÿ_ßÎÿLÜÉÿAÜÇÿ7ßÈÿ4áËÿ,âÊÿ&ÞÆÿ!ÝÄÿßÅÿ áÇÿ"äÍÿ!ãÌÿ&áËÿ&áËÿ áÌÿ áÌÿàËÿ"ßÊÿ(ßÊÿ/ÞÊÿ-ßÈÿ6àÊÿCáÉÿ_ßÌÿyâÏÿ—âÔÿ¹ãØÿÎÞ×ÿÎßÑÿÚÞÅÿÞسÿáÐÿß͆ÿâÎwÿâÏhÿÞÐXÿÜÑQÿÝÒRÿÞÒTÿÞÑWÿÞÏ[ÿßÎ_ÿÙÌ^ÿÝÐbÿÞÑcÿÛÎ`ÿÚÏ`ÿÞÓdÿÜÔiÿÛÐnÿÜÑuÿÓÈxÿÔÈ‚ÿÑÅ‹ÿÐÂ’ÿÞ˨ÿæÔµÿÜDZÿÎ˽ÿþµÿ®¬¢ÿea\ÿZXWÿ|y{ÿÿ¨¨®ÿÂÂÈÿÙÙßyíîòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóèê(åÚÜnÒÇÉÿ¯­­ÿ€‹‰ÿVmiÿJnhÿh‘Šÿxµ«ÿrÔÆÿuè×ÿkâÓÿXÜËÿNáÍÿ>ÞÈÿ9åÍÿ0äËÿ(âÊÿ(âÊÿ'áÉÿ&àÈÿ)áÉÿ*âÊÿ+âÍÿ/âÍÿ-ßÈÿ0ÝÇÿ2ÛÈÿ2ÛÈÿ*ÛÇÿ*ÛÇÿ(ÚÃÿ'ÙÂÿ0ÜÄÿ2ÚÃÿ1ÝÁÿ6ÝÂÿ?ßÁÿWÞÄÿmâÉÿáÎÿ³âÒÿÆÜÐÿÈÜÉÿÓÛ½ÿÚÔ¯ÿÝÌ™ÿÜÆ„ÿâÅtÿáÅgÿÞÅ_ÿÜÄZÿÝÅ[ÿßÆ`ÿßÄbÿßÁhÿàÂiÿãÍdÿâÍ`ÿàË^ÿÞÊZÿÞÍXÿáÐ[ÿàÐXÿÞÎVÿÝÑ[ÿÚË]ÿÞÐfÿåÔsÿßÐtÿßÍzÿæÖƒÿîÚ“ÿãÙ©ÿáسÿáسÿļŸÿ¢œ…ÿ{vgÿge[ÿ}|ÿ›šœÿ¸¶¼ÿÑÑ׉ááçOðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéãäEØÍϚ·¹ÿŸ”–ÿywwÿfqoÿg~zÿy—ÿ›Ä½ÿ¤á×ÿ€âÔÿmàÏÿgÞÏÿYÝÌÿPãÏÿ:ÚÄÿ4àÈÿ)ÝÄÿ%ßÇÿ'áÉÿ(âÊÿ&àÈÿ'ßÇÿ'ßÇÿ&ÝÈÿ(ÛÆÿ*ÜÅÿ.ÛÅÿ0ÙÆÿ/ØÅÿ(ÙÅÿ'ØÄÿ&ØÁÿ$Ö¿ÿ+׿ÿ-Õ¾ÿ+×»ÿ1ؽÿ:Ú¼ÿRÙ¿ÿhÝÄÿŠÜÉÿ¯ÞÎÿÁ×ËÿÂÖÃÿÍÕ·ÿÔΩÿ×Æ“ÿÕ¿}ÿÚ½lÿÞÂdÿÚÁ[ÿØÀVÿÙÁWÿÛÂ\ÿÜÁ_ÿܾeÿܾeÿÜÆ]ÿÞÉ\ÿàË^ÿáÍ]ÿßÎYÿÝÌWÿÞÎVÿáÑYÿÛÏYÿßÐbÿÛÍcÿÙÈgÿÙÊnÿÙÇtÿ×ÇtÿÛÇ€ÿ×ÍÿÖͨÿØϪÿæÞÁÿÕϸÿ·²£ÿ‹ÿljiÿmlnÿ‹‘ÿ¬¬²ÿÅÅËÿàßáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììäää;ÍÍÍš§§§ÿ‰Žÿ_qpÿOplÿa—ÿvĹÿ}ßÑÿzç×ÿdçÓÿDáÌÿ<âËÿ7ßÈÿ3ßÇÿ,ßÆÿ)àÆÿ'àÆÿ&ßÅÿ'àÆÿ+ßÆÿ+ßÆÿ-ÝÅÿ,ÜÄÿ.ÚÂÿ-ÙÁÿ,ØÀÿ&Ú½ÿ%Ù¼ÿ&Ö¸ÿ&Ö¸ÿظÿ×·ÿÕµÿÒ³ÿ$Юÿ%ѯÿ%Ô¯ÿ&Õ°ÿ1ײÿDÙ·ÿTÞ¼ÿ|ÛÀÿ¦Ú¼ÿ»Ù¶ÿ¾Ù²ÿÈÖ¦ÿÎÏ—ÿÑŃÿÒ¾qÿÓ»cÿÓ¼YÿÓºTÿѸPÿѸPÿÓºTÿÔ¹WÿÖ·ZÿÕ¶YÿÔ¾UÿÖÀWÿÙÃZÿÛÅ\ÿÝÅ[ÿÞÆ\ÿÞÇZÿßÈ[ÿßË\ÿßË\ÿÞË\ÿßÌ]ÿÞÍ^ÿßÎ_ÿÝÏ_ÿÜÎ^ÿÙÈqÿ×Ç{ÿàÒ†ÿäÕ–ÿäÙ ÿíâ¶ÿØÏ­ÿ©¡Šÿ…€qÿtqiÿ€~}ÿ¢¢¨ÿ¼¿ÄÿÏÐÚäåï;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïññ ÖÖÖ~ÂÂÂÿ©©©ÿƒƒƒÿglmÿp‚ÿ‰ª¦ÿ—ÍÆÿÛÐÿzÜÎÿnÛËÿZÝÉÿAÞÉÿ9ßÈÿ6ÞÇÿ2ÞÆÿ,ßÆÿ)àÆÿ'àÆÿ'àÆÿ%ÞÄÿ)ÝÄÿ(ÜÃÿ+ÛÃÿ)ÙÁÿ+׿ÿ*Ö¾ÿ)Õ½ÿ!Õ¸ÿÓ¶ÿ"Ò´ÿ"Ò´ÿÔ´ÿÓ³ÿѱÿÍ®ÿ!Í«ÿ"άÿ Ϫÿ Ϫÿ)Ϫÿ;ЮÿKÕ³ÿsÒ·ÿ Ô¶ÿ´Ò¯ÿµÐ©ÿ¾ÌœÿÃÄŒÿȼzÿʶiÿÌ´\ÿ̵RÿεOÿÍ´LÿÍ´LÿεOÿÏ´RÿѲUÿÒ³VÿϹPÿкQÿÒ¼SÿÓ½TÿÖ¾TÿØÀVÿÛÄWÿÝÆYÿÜÈYÿÜÈYÿÜÉZÿÝÊ[ÿÜË\ÿÝÌ]ÿÛÍ]ÿÛÍ]ÿØÇpÿÓÃwÿØÊ~ÿØÉŠÿÖË’ÿáÖªÿãÚ¸ÿÔ̵ÿ¹´¥ÿŽ‹ƒÿomlÿuu{ÿ“–›ÿ¶·ÁÿÑÒ܉ßàêYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçè2ÛÕրĿÀÿ–––ÿhvuÿTwsÿV‘‰ÿe¹­ÿtßÏÿgìØÿVéÓÿ?ãÊÿ5ÞÄÿ-ÞÃÿ(âÅÿ'áÄÿ%áÄÿ$àÃÿ$àÃÿ$àÃÿ#àÁÿ'ßÁÿ%Û¼ÿ(Û¼ÿ'Ú¹ÿ&Ù¸ÿ%Ø·ÿ#ÖµÿÕ³ÿÔ²ÿÔ¬ÿѪÿЩÿϨÿЧÿÎ¥ÿË£ÿ!È¡ÿ)ÄŸÿ.Ä ÿ-ÆŸÿ2Æ ÿ9Ç¢ÿLʧÿ`άÿ}Í°ÿŸÎ´ÿ³É°ÿ²È«ÿ»Äœÿ¼¼ŒÿÀ´zÿ¾­jÿÁª_ÿ¼¦TÿÀ¨Nÿ¾¨Iÿ¾¨Iÿ¾¨HÿÄ«KÿÉ­Nÿ˯PÿÉ´KÿʵLÿ̶Mÿ͵QÿζRÿѸXÿÖº[ÿؼ]ÿÛ¿`ÿÜÀaÿÛÂ`ÿÜÅ_ÿÜÈ]ÿÝÉ^ÿÞÊ]ÿÞÊ]ÿàÌ_ÿÞÉ`ÿßÌeÿÞÌmÿÛÊsÿÜÌ€ÿãÕ“ÿêܧÿäÛ¯ÿÏÆ¥ÿ¢ž†ÿ{wlÿwtpÿ‘”ÿµ·¿ÿÏÑÙàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÓÔƒº´µÿŸš›ÿwwwÿftsÿwš–ÿ’ÍÅÿ‹ßÓÿwâÒÿVÛÇÿHÛÅÿ<àÇÿ6ßÅÿ.ßÄÿ(âÅÿ'áÄÿ$àÃÿ#ßÂÿ"ÞÁÿ!ÝÀÿܽÿ!Ù»ÿ!׸ÿ$׸ÿ#Öµÿ!Ô³ÿÒ±ÿЯÿÏ­ÿÍ«ÿΦÿÌ¥ÿÊ£ÿÈ¡ÿÈŸÿÇžÿÅÿÃœÿ&Áœÿ,žÿ.Ç ÿ7Ë¥ÿAϪÿVÔ±ÿkÙ·ÿˆØ»ÿ¨×½ÿ¾Ô»ÿ¾Ô·ÿÉÒªÿËË›ÿΈÿʹvÿË´iÿÁ«YÿÁ©Oÿ¼¦Gÿ¸¢Cÿ·¡Aÿ¼£CÿÁ¥Fÿ¦GÿîEÿįFÿDZHÿɱMÿ˳Oÿ̳SÿдUÿдUÿÔ¸YÿÖº[ÿÕ¼Zÿ×ÀZÿØÄYÿÙÅZÿÛÇZÿÛÇZÿÞÊ]ÿÝÈ_ÿÚÇ`ÿÚÈiÿÚÉrÿÒÂvÿÏÁÿÖÈ“ÿÕÌ ÿâÙ¸ÿÕѹÿ«§œÿ|xÿmlpÿ„†Žÿ­¯·ÿÉÉÉ°ãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêèè(ÐÎΰµ´ÿ…–“ÿ]xuÿXˆ‚ÿs¸®ÿvÕÇÿmãÑÿ\ëÕÿFäÌÿ.ÝÂÿ+ßÆÿ(áÇÿ$ßÅÿ$ßÅÿ+áÃÿ*àÂÿ&ÞÀÿ%Ý¿ÿ#ܼÿ!Úºÿ ×µÿ!Ô³ÿ"Ô¯ÿ$Ó®ÿ%Ò¬ÿ"Ï©ÿΦÿË£ÿÊŸÿÉžÿ Řÿ&×ÿ'–ÿ&Á•ÿ'–ÿ)Ęÿ1›ÿ=ÁœÿOÅ¢ÿWȦÿ]έÿfÓ³ÿpعÿ…ÜÀÿ›ßÆÿ±àÊÿÀàÕÿÏÞÖÿÓàÒÿÛÝÉÿÜؼÿÞÏ®ÿÙÇžÿÚÓÿι‚ÿ˳yÿÀ«mÿ½¥cÿ¼£]ÿ¼¡Wÿ¸Sÿ¹›Nÿ¼¢Hÿ¼¢Hÿ¾£IÿÀ¥KÿèNÿŪPÿÉ«RÿË­TÿË®SÿÍ°UÿδVÿжXÿÒ¹WÿÔ»YÿÖ¿[ÿ×À\ÿÛÈYÿÜÉZÿ×ÄUÿÙÅZÿßÍbÿÞÉfÿÙÇhÿÞÌyÿØÊ~ÿßБÿåÚ¦ÿâØ°ÿ¾¸›ÿ‹„sÿwteÿ‡…}ÿªªªÿÇÇǽáááOïïï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿååå;ÖÔÔ€°®®ÿ†‹Šÿgxuÿi„ÿˆ¸²ÿœá×ÿ„ãÕÿeÛÉÿOÞÈÿ?ÝÅÿ0ßÄÿ,àÇÿ'àÆÿ!ÜÂÿ!ÜÂÿ&ܾÿ%Û½ÿ"Ú¼ÿ غÿظÿÕµÿÓ±ÿЯÿϪÿͨÿË¥ÿÉ£ÿÇŸÿÅÿÅšÿÄ™ÿÁ”ÿ$Á•ÿ'–ÿ)Ęÿ-Èœÿ1Ì ÿ<ͦÿJΩÿ[Ñ®ÿbÓ±ÿgØ·ÿoܼÿxàÁÿŠáÅÿŸãÊÿ´ãÍÿÄäÙÿÒáÙÿÕâÔÿÝßËÿàÜÀÿåÖµÿäÒ©ÿçРÿßÊ“ÿÝÅ‹ÿÔ¿ÿÓ»yÿÒ¹sÿÏ´jÿŪ`ÿ¤Wÿ¼¢Hÿº Fÿ¸Cÿ·œBÿ¹žDÿ½¢HÿÃ¥LÿƨOÿŨMÿǪOÿɯQÿ˱SÿÍ´RÿзUÿÒ»WÿÔ½YÿÕÂSÿÛÈYÿÙÆWÿ×ÃXÿÚÈ]ÿÛÆcÿ×ÅfÿÚÈuÿÖÈ|ÿÓÄ…ÿÔÉ•ÿàÖ®ÿßÙ¼ÿü«ÿ–“„ÿwumÿ{{{ÿ   ÿËËËÿãããEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæææ2ÎÎί±±ÿ‘““ÿa|xÿZ†ÿp¿´ÿyâÓÿhæÓÿNáËÿBàÈÿ5ÛÂÿ1ÙÂÿ/ÛÃÿ+ÛÃÿ*ÚÂÿ(ÛÂÿ%Ø¿ÿ*Öºÿ)Õ¹ÿ$Ô¶ÿ"Ò´ÿ!Ò±ÿЯÿΩÿ ̨ÿ É¢ÿ!Æ ÿ#Å›ÿ#Á˜ÿ%À”ÿ%À”ÿ%À“ÿ%À“ÿ4Á–ÿ:˜ÿ?Å›ÿBÈžÿEÍ£ÿIѧÿRÓ¬ÿ`Ô¯ÿpÓ³ÿrÕµÿu×¹ÿyÛ½ÿ€ÝÂÿÞÅÿ¤ßËÿµßÎÿÅâÒÿÒßÑÿÔßËÿÙÜÆÿÝÙ½ÿßÔ¶ÿàÏ®ÿàͨÿÙÆ ÿÚÄšÿ×Á—ÿÙÁ“ÿÙÀŽÿؼ†ÿÓ´}ÿЮsÿǧfÿÅ¢^ÿ¾œVÿ¹™Nÿ¹˜Iÿ»›Hÿ½ŸHÿ¿¢GÿÀ¤Fÿ§EÿƬHÿÈ®JÿÈ°LÿʲNÿ͵QÿиTÿ̼RÿÒÂXÿÔÅWÿ×ÃVÿÚÆWÿÙÅVÿ×ÃVÿÙÄ[ÿÖÃbÿÚÆqÿ×Æ}ÿÒŇÿÛОÿàÙ²ÿËÞÿž™„ÿuuuÿ€€€ÿ£££ÿÊÊÊ¥ÞÞÞYîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìììÒÒÒƒ³³³ÿ‹ÿsuuÿn‰…ÿ¹ÿ‘àÕÿvßÐÿ\ÚÇÿHÛÅÿ=ÛÃÿ3ÙÀÿ5ÝÆÿ3ßÇÿ(ØÀÿ'׿ÿ'ÚÁÿ$×¾ÿ(Ô¸ÿ'Ó·ÿ!ѳÿϱÿέÿÌ«ÿÊ¥ÿȤÿÅžÿÂœÿÀ–ÿ½”ÿ"½‘ÿ"½‘ÿ#¾‘ÿ$¿’ÿ7Ä™ÿ=Å›ÿCÉŸÿFÌ¢ÿGÏ¥ÿJÒ¨ÿRÓ¬ÿ^Ò­ÿpÓ³ÿrÕµÿtÖ¸ÿwÙ»ÿÜÁÿÞÅÿ¥àÌÿ·áÐÿÅâÒÿÔáÓÿ×âÎÿÝàÊÿàÜÀÿàÕ·ÿßέÿÞ˦ÿ×ÄžÿÙÙÿ×Á—ÿØÀ’ÿØ¿ÿÙ½‡ÿع‚ÿض{ÿ×·vÿÔ±mÿË©cÿ¢Wÿ¾Nÿ»›Hÿ¹›Dÿ·š?ÿºž@ÿ½¢@ÿÀ¦Bÿ¨DÿªFÿëGÿÆ®JÿɱMÿɹOÿʺPÿ˼NÿÒ¾QÿØÄUÿÚÆWÿÚÆYÿÚÅ\ÿÓÀ_ÿÔÀkÿÔÃzÿÍÀ‚ÿËÀŽÿÕΧÿÞÖ±ÿÏʵÿžžžÿtttÿwwwÿ§§§ÿËËËÿàààOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîüú áîìOÑÖÕ‰¹®°ÿ–‹ÿJ}uÿIžÿr;ÿzêØÿ_åÑÿ>ÚÂÿ1ÚÀÿ*ÛÀÿ'ÜÀÿ'ÜÀÿ(Ü¿ÿ'Û¾ÿ'Ý»ÿ$Ú¸ÿ!ضÿÖ´ÿ$Õªÿ&Ò¨ÿ"Шÿ#Ì¥ÿ É¢ÿ ÅŸÿÚÿÀ˜ÿ!Á—ÿ!½”ÿ¼Žÿ ¹Œÿ$¼‹ÿ'¿Žÿ+Ä‘ÿ.Ç”ÿBŤÿKƦÿPÈ©ÿUÊ«ÿ[Ë©ÿZʨÿXÊ¥ÿSʤÿPÌ¢ÿOË¡ÿPÌ ÿVÏ£ÿaÑ¢ÿiУÿpÕ¨ÿƒ×­ÿœÖ³ÿ¯Ô´ÿ´Ó¬ÿÂÍ¥ÿÉÆ™ÿÒ»ÿÒ¶€ÿѳzÿϱvÿΰuÿÌ´xÿи|ÿηÿÏ·ƒÿѶƒÿβƒÿѱˆÿ̬ƒÿʬ{ÿŪqÿ½£aÿ¶ŸTÿ²Lÿ¯—Cÿ®˜@ÿ³˜Aÿ¶›Dÿ»Fÿ½ŸHÿÅ¢LÿɤOÿ˦QÿÅ®HÿȱKÿÌ´PÿÏ·SÿѹUÿÔ¼Xÿ×ÁXÿÚÄ[ÿÚÆ[ÿÚÆ[ÿØÇ`ÿÚÆgÿÚÆoÿàÉ{ÿìÕŠÿøÛ¢ÿÜÈ·ÿ±¨šÿŒ…tÿ||nÿŸ¨›ÿÈÓÉ°ÕâÚ€êõòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöô(ÞìêYÐÝÛÿ¶»ºÿœ‘“ÿ…z|ÿiœ”ÿsȺÿ‰äÕÿnÞÌÿNÔÀÿ@ÜÄÿ6ßÅÿ%Ö»ÿ%Ú¾ÿ%Ú¾ÿ$Ø»ÿ#׺ÿ!×µÿÕ³ÿѯÿÏ­ÿΣÿË¡ÿÉ¡ÿÅžÿÃœÿ¿™ÿ¾•ÿ»“ÿºÿ¸ÿºŒÿ!ºÿ'¿Žÿ+Ã’ÿ/È•ÿ2˘ÿAÄ£ÿG¢ÿHÀ¡ÿKÀ¡ÿQÁŸÿPÀžÿM¿šÿG¾˜ÿ@¼’ÿ=¹ÿ:¶Šÿ<µ‰ÿF¶‡ÿP·ŠÿY¾‘ÿn˜ÿ†Àÿ—¼œÿ›º“ÿ§²Šÿ«¨{ÿ²›mÿ±•_ÿ¯‘Xÿ°’Wÿ®Uÿ­•Yÿ²š^ÿ´eÿ½¥qÿǬyÿȬ}ÿƦ}ÿƦ}ÿʬ{ÿË°wÿƬjÿÀ©^ÿº¥Tÿ¶žJÿ®˜@ÿ²—@ÿ²—@ÿ¶˜Aÿ¸šCÿ¿œFÿÂHÿÄŸJÿÀ©CÿìFÿǯKÿʲNÿÌ´PÿÏ·SÿÒ¼SÿÔ¾UÿÕÁVÿÖÂWÿÔÃ\ÿÕÁbÿÔÀiÿØÁsÿßÈ}ÿèË’ÿáͼÿÓʼÿ±ª™ÿ……wÿ}†yÿ¨žÿÅÒÊÿÜçäcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëÛÖ×ÿ¼ÄÃÿ‚“ÿbyuÿl˜‘ÿq̽ÿoãÐÿoèÔÿQÚÄÿ;Ô»ÿ1Û¿ÿ*ÞÁÿ'Û¾ÿ$Ú»ÿ#Ùºÿ$׶ÿ%Ô³ÿ#Ò°ÿ Ï­ÿͨÿ˦ÿ!ÉžÿÆ›ÿÄ–ÿ”ÿÀ’ÿ¾ÿ¼ÿ»ŒÿºŠÿº‹ÿ$¼‹ÿ-½ÿ3¿ÿ<À’ÿ@“ÿAÔÿ9Åÿ4À‹ÿ/»†ÿ,¸ƒÿ*¸ƒÿ&¸‚ÿ·€ÿµ~ÿ´|ÿ´|ÿ´~ÿ·ÿ(¸„ÿ7ºˆÿ?¿ŽÿUÁ“ÿ~Ñÿ–¾Žÿ—»‡ÿž²}ÿ£§lÿ¦›_ÿ¨’PÿªHÿ¨‹@ÿ§‡<ÿ¨ˆ<ÿ­‰=ÿ­‰=ÿµBÿ¿’HÿÀ’Kÿ»™Sÿ¾œVÿÇ¥_ÿÍ«eÿ˨dÿɦbÿÉ£bÿÄž]ÿ¾˜Wÿ»•Tÿ¶’Lÿ´‘Gÿ´”Aÿ¶˜Aÿ¸œ>ÿºž@ÿ¾¡FÿÁ¤IÿŨMÿÈ«PÿÊ­Rÿ̯TÿÏ´RÿѸRÿÓ½TÿÔ¾UÿÓÀWÿÕÁ\ÿÓ¿`ÿÔ¿dÿÖÂjÿÛÃwÿÝÌ”ÿíݹÿÝѯÿ³«”ÿ„„tÿ€|ÿ®°°ÿÎÐÐéëë(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåàáOËÆÇÿ”œ›ÿevsÿsŠ†ÿ›ÇÀÿ„ßÐÿkßÌÿ]ÖÂÿLÕ¿ÿAÚÁÿ.ؼÿ!Õ¸ÿ'Û¾ÿ"عÿ Ö·ÿ Ó²ÿ!ЯÿάÿË©ÿÊ¥ÿÈ£ÿÅšÿØÿÁ“ÿ¾ÿ½ÿ¼Žÿ»Œÿº‹ÿ»‹ÿ ¼ÿ&¾ÿ.¾Žÿ1½Žÿ7»ÿ7¹Šÿ7¹Šÿ-¹„ÿ*¶ÿ&²}ÿ#¯zÿ ®yÿ°zÿ²{ÿ²{ÿµ}ÿ·ÿ»…ÿ#¿‰ÿ1ÁÿAÄ’ÿHÈ—ÿ]É›ÿ‡ÌšÿŸÇ—ÿ¡Å‘ÿ©½ˆÿ¯³xÿ²§kÿ³[ÿµ˜Sÿ­Eÿ­Bÿ­Aÿ°Œ@ÿ«‡;ÿ¬„9ÿ°ƒ9ÿ¬~7ÿ©‡Aÿ«‰Cÿ²Jÿ¸–Pÿº—Sÿ¿œXÿÆ _ÿÆ _ÿÅŸ^ÿÂœ[ÿ¼˜Rÿ¶“Iÿ²’?ÿ²”=ÿ´˜:ÿ·›=ÿºBÿ¼ŸDÿ¿¢GÿÂ¥JÿŨMÿÈ«PÿË°NÿÍ´NÿϹPÿÑ»RÿнTÿÓ¿ZÿÒ¾_ÿÓ¾cÿÓ¿gÿÕ½qÿÌ»ƒÿØȤÿßÓ±ÿÖηÿ©©™ÿ~}yÿ‰‹‹ÿ°²²ÿ×ÙÙ~èêê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÜnÏÇȽ«£¤ÿcxuÿYŒ„ÿxǹÿvâÏÿUãÌÿHâÉÿ8×½ÿ,Ó¸ÿ)ܽÿ&ܽÿÕµÿÓ³ÿÔ±ÿ Ò¯ÿ"Ï©ÿ#˦ÿ"É¢ÿÆŸÿÄ›ÿ™ÿÁ‘ÿ¿ÿ½Šÿ»ˆÿ»„ÿ¹ƒÿº‚ÿ¹‚ÿ ºƒÿ$º„ÿ(»‡ÿ*º†ÿ*·†ÿ,´„ÿ+±ƒÿ*°‚ÿ·yÿ·yÿ·zÿ¶zÿ´|ÿ"µÿ&º„ÿ,»Šÿ/¾ÿ7¼‘ÿ>¼’ÿJ»–ÿV¼™ÿgÀŸÿpƨÿ…ƬÿšË¯ÿ«É¬ÿ­Æªÿ±À¡ÿµ¶–ÿ´ªˆÿ³¢{ÿ´œrÿ­–fÿ¬‘^ÿ­’Zÿ®Uÿ®ŒPÿ°‹Oÿµ‰Lÿ±…Hÿ©…7ÿ§ƒ5ÿª†8ÿ­ˆ>ÿ°ˆ@ÿ¶ŒIÿÀ”TÿÖYÿÖYÿÄ—ZÿÀ—Xÿ¼•Qÿ´’Fÿ°?ÿ®’;ÿ°”=ÿ¶”@ÿ·”Dÿº—Gÿ½šJÿÀžKÿÄ¢OÿǧNÿɪMÿ̱OÿεOÿϹPÿÑ»RÿÓ¾UÿÕÀWÿÕÂ[ÿÕÀ]ÿÕÂgÿÖÁvÿÞÌÿåÔ©ÿÖÊ®ÿ¥š’ÿ‚zzÿ”ÿÀ¿»ÿÛÚÖ~ððêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñéê(ØÐщª¢£ÿyzÿp…‚ÿŒ¿·ÿ’áÓÿlØÅÿLÚÃÿBÜÃÿ9ؾÿ-Ô¹ÿ%عÿ"عÿÖ¶ÿÔ´ÿÒ¯ÿЭÿ̦ÿ È£ÿÅžÿ›ÿ¿–ÿ½”ÿ½ÿ»‹ÿº‡ÿ¸…ÿ¸ÿ·ÿ¸€ÿ·€ÿ¸ÿ"¸‚ÿ#¶‚ÿ$´€ÿ#°ÿ$¬|ÿ%«}ÿ%«}ÿ ¶xÿ¹{ÿ¼ÿ½ÿ$½…ÿ+¾Šÿ0ÄŽÿ8Ç–ÿ@ÏžÿLѦÿXÖ¬ÿhÙ´ÿvܹÿˆáÀÿåÇÿ¢ãÉÿ³äÈÿÅãÆÿÉâƽÐßÀì×ظÿÚЮÿÜˤÿßÇÿÕ¾ŽÿÏ´ÿÈ­uÿ¤iÿ½›_ÿ¼—[ÿ¿“Vÿ¹Pÿ²Ž@ÿ­‰;ÿ«‡9ÿ¨ƒ9ÿ¨€8ÿª€=ÿ°„Dÿ°ƒFÿµˆKÿºPÿ¼“Tÿ½–Rÿ·•Iÿ²‘Aÿ®’;ÿ­‘:ÿ²<ÿ³@ÿµ’Bÿ¹–Fÿ¼šGÿ¿Jÿ¢IÿÄ¥HÿÈ­KÿʱKÿ˵LÿÍ·NÿιPÿÒ½TÿÒ¿XÿÓ¾[ÿÒ¿dÿÓ¾sÿÖÄ…ÿÔØÿÝѵÿÌÁ¹ÿ˜ÿ„€ÿš™•ÿÀ¿»ÿããÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëêÐÑ϶·µÿ~Œˆÿfˆÿx½°ÿäÒÿcáËÿ?Ú¿ÿ/ÜÀÿ%׺ÿ"عÿ$Ú»ÿ×µÿÓ±ÿÔ®ÿ Õ¯ÿϧÿ!Ì¥ÿ#ÊŸÿ$Æœÿ"ÖÿÀ“ÿ½ÿ»ÿ»…ÿ¸ƒÿ·€ÿ¶ÿ·|ÿ!·|ÿ!·{ÿ!·{ÿ!·{ÿ µ}ÿ´|ÿ±|ÿ¯zÿ®}ÿ±€ÿ³†ÿ'·ÿ2¸”ÿ?½šÿQ¡ÿdƨÿuɱÿ†Î¸ÿ•Î¿ÿ§ØÊÿ·ÞÖÿÅèÞÿÕîêÿÞóñYéõõ(îöö íõõéöø(ê÷ùí÷÷ÿÿÿÿÿÿÿÿÿøïìøðé(ìæÛnàÛÌšÕѾÿÍÇ°ÿÀ»¢ÿº²•ÿ°¨‹ÿ¨}ÿ¶™rÿ²”eÿ«\ÿ¨ŠQÿ£„Eÿ¤ƒ=ÿ¤„8ÿ¤€4ÿ«‡;ÿ±‰>ÿ¶ŽCÿ¹Hÿ¹Kÿ¸JÿµŒGÿ´‹Fÿ²Œ>ÿ³?ÿ´Ž@ÿ·‘Cÿº•Eÿ½˜HÿÀ›IÿÁžHÿÄ¥JÿȪKÿÉ®Lÿ˲Lÿ˵KÿϹOÿÒ¾QÿÓ¿RÿÓ¾QÿØÂYÿÙÄiÿÖÂ{ÿÜÌ—ÿäÕ´ÿɼ¦ÿ”Šÿ‡zÿ£ œÿÈÇÃÜëéé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòðï âàßYÂÃÁÿˆ‰‡ÿv„€ÿ–¸±ÿ”ÙÌÿyÜÊÿ\ÚÄÿ>Ù¾ÿ-Ú¾ÿ$Ö¹ÿ!׸ÿ Ö·ÿÒ°ÿÒ°ÿÒ¬ÿÈ¢ÿÈ ÿÆŸÿÄ™ÿÁ—ÿÀ“ÿ½ÿºŒÿ¸Šÿ·ÿµ€ÿ´}ÿ³|ÿ´yÿµzÿµyÿ´xÿ°tÿ°xÿ°xÿ¯zÿ°{ÿµ„ÿ$¼‹ÿ)À“ÿ5Å›ÿ@Æ¢ÿQϬÿhÙ¸ÿ‚äÆÿšîÖÿ­õßÿ½öçÿÇøê½Ôûó€Ýÿöcæÿû2ëÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúõæ2öòßYöðÙyïêщéáÄÊÛÓ¶ÿÐÅ¥ÿαŠÿȪ{ÿ¾ oÿ¸šaÿ°‘Rÿ¯ŽHÿ¬Œ@ÿª†:ÿ©…9ÿ«ƒ8ÿ¬„9ÿ¯…>ÿ²‰DÿµŒGÿµŒGÿ´‹Fÿ¯‰;ÿ°Š<ÿ°Š<ÿ²Œ>ÿµ@ÿ¸“Cÿº•Cÿ»˜Bÿ¼Bÿ¤EÿŪHÿÆ­GÿDZGÿ˵KÿÏ»NÿмOÿÓ¾QÿÑ»RÿϺ_ÿÒ¾wÿË»†ÿÖǦÿßÒ¼ÿº±§ÿ†€yÿ‘ŽŠÿ«ª¦ÿÖÔÔ€ðñï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéäãEÍÈÇÿ—¢ŸÿZƒ{ÿb¨›ÿãÑÿcâÉÿIáÄÿ;Ù»ÿ.Ù¹ÿ#Ù·ÿ!×µÿÕ²ÿÓ°ÿÒ¬ÿϪÿ̤ÿÊžÿƘÿ ÖÿÁ‘ÿ½Žÿ»‰ÿ¹‡ÿ¸„ÿ·ƒÿ³{ÿ³{ÿµyÿ¶zÿ´xÿ±uÿ°tÿ°uÿ²wÿ¯yÿ#°}ÿ+²„ÿ1´‰ÿ9¶ÿCÀ™ÿVɨÿ“ƾÿ¬ÒÌÿ¼âÜÿÌêåÿÛðínëøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíøè(æíÞYÜÖÏÿ×ÉÃÿĺ¨ÿ´ªŒÿ¨Ÿsÿ¤—_ÿ¡“Qÿ£Gÿ¥ŽBÿ¤…:ÿ¤7ÿ¨7ÿ©8ÿ±?ÿ¹‡Eÿ»‰Gÿ²=ÿ±Œ<ÿ°‹;ÿ¯Š:ÿ²‹<ÿµŽ?ÿ¸‘Bÿº“Dÿ½™EÿÀœHÿ¡KÿŦKÿƪKÿÊ°LÿεOÿиNÿÒ¸LÿÕ»OÿÖÀWÿÒÀcÿÐÁkÿÐÄ~ÿØÍ™ÿÝÕ°ÿµ¯˜ÿ‰†~ÿ’Žÿ¸¸¸ÿÝßßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèé(ÕÐ϶±°ÿ|‡„ÿp™‘ÿ}öÿxÜÊÿ_ÞÅÿBÚ½ÿ9×¹ÿ(Ó³ÿ Ö´ÿÕ³ÿÒ¯ÿЭÿÏ©ÿ˦ÿÉ¡ÿÇ›ÿÕÿÀ“ÿ¾Žÿº‹ÿ¹‡ÿ·…ÿ¶‚ÿµÿ´|ÿ²zÿ²vÿ²vÿ±uÿ°tÿ±uÿ²wÿ°uÿ ´~ÿ,¹†ÿ6½ÿ?—ÿMÊ£ÿ]Ú³ÿqäÃÿ»îæÿÏõï×ý÷~áÿúOêÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõüíüöï üîè(îäÒƒá×¹ÿÒÉÿƹÿ´¦dÿ«˜Oÿ©’Fÿª‹@ÿ«ˆ>ÿ­†<ÿ©8ÿ­};ÿ³?ÿ´‚@ÿ®‰9ÿ®‰9ÿ®‰9ÿ®‰9ÿ°‰:ÿ²‹<ÿµŽ?ÿ¶@ÿ·“?ÿº–Bÿ»šDÿ¿ EÿÀ¤EÿéEÿȯIÿ˳IÿδHÿÑ·KÿÑ»RÿÍ»^ÿÊ»eÿɽwÿÎÃÿÓ˦ÿÑË´ÿ©¦žÿˆƒ„ÿÿÇÉɽàââOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÛÜn²·µÿ„•‘ÿ[ƒÿo³ÿläÌÿDÞÁÿ5âÂÿ)Ö¶ÿ+Ö¶ÿ'Ò²ÿ$Ô¯ÿ"Ò­ÿ Ï©ÿ"ͧÿ#Ê¡ÿ#Çžÿ!Ùÿ!Á“ÿ¿ÿ ½‹ÿº‡ÿ¸…ÿ·ÿµÿ´|ÿ²{ÿ²wÿ°uÿ¯uÿ°vÿ±wÿ°zÿ²|ÿ³‚ÿ%³†ÿ<¶ÿQ½™ÿhÂ¥ÿƒÌ²ÿ¥ÜÉÿ»ðÜÿÚøënÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó÷ëéíÚnÞÝÃÿÅ£ÿ´«…ÿ¬Ÿsÿ©•fÿ¨Zÿ©‰Nÿ¥‚Bÿ©9ÿª‚7ÿ§4ÿªƒ8ÿ«„9ÿ¬‡7ÿ­ˆ8ÿ­‡5ÿ®ˆ6ÿ°‰:ÿ²‹<ÿµŽ@ÿ·Bÿ¹”Dÿ¼—Gÿ½œFÿÁ¢GÿĨIÿÇ«LÿȯMÿʱOÿθOÿкQÿλTÿμ]ÿÑÃqÿÓƈÿÜÓ§ÿÍÆ­ÿ ÿ’Šÿ¨©¥ÿÌÍÉ°ìñè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêåæ;ÏÊË¥šŸÿx‰…ÿ€²¨ÿˆÛÌÿjâÊÿ>Ø»ÿ0ݽÿ%Ò²ÿ(Ó³ÿ'Ò²ÿ!ѬÿϪÿ̦ÿÉ£ÿÆÿÚÿ¿•ÿ½ÿ»‰ÿ¹‡ÿ·„ÿµ‚ÿ´~ÿ³}ÿ²zÿ°yÿ¯tÿ®sÿ°vÿ²xÿµ{ÿµÿ¹ƒÿ#»Šÿ2À“ÿMÇ¡ÿgÓ¯ÿƒÝÀÿ£ìÒÿÅüéÊÓÿôƒèÿù(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿíüûáOíêË¥âÙ³ÿÎÁ•ÿï€ÿ¸jÿ²’Wÿ®‹Kÿ²ŠBÿ¯‡<ÿ©6ÿ¨6ÿ©‚7ÿª…5ÿ¬‡7ÿ¬†4ÿ«…3ÿ¬…6ÿ¯ˆ9ÿ³Œ>ÿµŽ@ÿ¶‘Aÿ¹”Dÿº™Cÿ¾ŸDÿÁ¥FÿĨIÿŬJÿÇ®Lÿ˵LÿÍ·Nÿ˸QÿʸYÿÉ»iÿʽÿË–ÿÏȯÿ¿±ÿ–“ŽÿŽ‹ÿº»·ÿÙÞÕ€îóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñïï ÔÙØ€¤±¯ÿr“Œÿg¥™ÿ{×ÄÿlæÎÿCÙ¼ÿ0Ö·ÿ%×´ÿ"Ô±ÿ Ò¯ÿ άÿ"Ï©ÿ#˦ÿ"É ÿ"Æÿ#Ùÿ#Á“ÿ½Žÿ »ˆÿ¹ƒÿ·ÿµ~ÿ³|ÿ³zÿ²yÿ°xÿ¯wÿ±uÿ±uÿ°yÿ°~ÿ%±‚ÿ4±‰ÿA·”ÿVºžÿpÆ®ÿ‘ÕÄÿ¶çÙÿÔóì€ëüøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãÛÔ€×ʼÿÁ³œÿ´¡~ÿ¨”dÿ¨Tÿ£Hÿ£†Aÿ§}:ÿ§}:ÿ¨€8ÿ©‚7ÿ©„4ÿ¨ƒ3ÿ«„5ÿ®‡8ÿ¯‡<ÿ±‰>ÿ³ŒAÿµŽCÿ¶“Cÿ¹—Cÿ¼ŸDÿ¿¢GÿÀ¥Nÿ§PÿÇ®NÿαNÿϳNÿѵPÿѹYÿÏ»fÿÑÂ}ÿÕÉ“ÿØѪÿ¯«“ÿŽŽ~ÿ§¢ŸÿÎÉÊÿîéê(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèææ2¾ÃÂÿˆ•“ÿs”ÿ‡Å¹ÿÛÈÿdÞÆÿ=Ó¶ÿ/Õ¶ÿÑ®ÿ%×´ÿ Ò¯ÿɧÿË¥ÿ È£ÿÅœÿ™ÿ¿•ÿ½ÿ¹Šÿ¸…ÿ¶€ÿµÿ³|ÿ²{ÿ²yÿ±xÿ°xÿ¯wÿ²vÿ²vÿ±zÿ°~ÿ&²ƒÿ;¸ÿPÆ£ÿjβÿæÎÿ°ôãÿÒÿõƒæÿþ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüïáOëÝƽ×Ä¡ÿ¿«{ÿ³›_ÿ¨”Mÿ§ŠEÿ«>ÿ§}:ÿ¦~6ÿ¨6ÿ¨ƒ3ÿ§‚2ÿªƒ4ÿ®‡8ÿ­…:ÿ®†;ÿ°‰>ÿ²‹@ÿ²?ÿ¶”@ÿ¸›@ÿºBÿ½¢Kÿ¾£LÿÄ«Kÿ̯LÿβMÿϳNÿζVÿË·bÿȹtÿÏÃÿÑÊ£ÿËǯÿ¢¢’ÿŽ‰†ÿ¸³´ÿáÜÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëéé(ÓÑщ¡ª§ÿu”ÿp°¤ÿ{ÙÈÿcÛÃÿF×»ÿ9Ó¶ÿ.Ѳÿ(Ï®ÿ&Ò°ÿͪÿʧÿÈžÿÅœÿ—ÿ¾”ÿ»ÿ¹Šÿ¶…ÿ¶€ÿµ~ÿ³|ÿ³zÿ±yÿ°xÿ°xÿ®wÿ®wÿ°wÿ³zÿ%µÿ:¶ŠÿQ»—ÿrƪÿ˜ØÅÿ»åÚÿÝøôcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòèÖ~ÙϱÿƸŽÿ°¥sÿ¥”[ÿ²ŠPÿ¯ƒFÿ©>ÿ©€;ÿ¨‚4ÿ§3ÿ©‚3ÿ¬…6ÿªƒ8ÿ¬…:ÿ®‡<ÿ°‰>ÿ°=ÿ³‘=ÿ´—<ÿ¶™>ÿ·Iÿ¹ŸKÿĤKÿ̪MÿÓ­MÿÔ®NÿÓ²QÿзUÿųZÿοvÿÏÇ‹ÿÙÓªÿ½¤ÿ–‰ÿ¤–¢ÿȾÊÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞÞY¾¼¼ÿ–“ÿž—ÿŠÊ¾ÿy×ÆÿcÛÃÿ?дÿ7Ñ´ÿ&ɪÿ)ЯÿʨÿÅ¢ÿ˨ÿÆœÿ™ÿ¿”ÿ»‘ÿ¸Œÿ·ˆÿ³‚ÿ³}ÿ³|ÿ²{ÿ²yÿ°xÿ°xÿ¯wÿ®wÿ®wÿ±xÿ¸ÿ0ÀŒÿKÇ›ÿfЬÿŒàÄÿ¶öãÿÜÿûcèÿÿ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï þôÖ~ìÞ´ÿÌÁÿ¸§nÿ½•[ÿ·‹Nÿ®„Cÿ«‚=ÿª„6ÿ§3ÿ§€1ÿªƒ4ÿ§€5ÿ©‚7ÿ¬…:ÿ®‡<ÿ­Š:ÿ¯9ÿ°“8ÿ²•:ÿ²˜Dÿ´šFÿ¿ŸFÿÇ¥HÿΨHÿЪJÿÏ®Mÿ˲PÿųZÿĵlÿûÿÈ™ÿÑ̳ÿ±¨¤ÿ”†’ÿ°¦²ÿÛÛÛnîîî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçèEÜÔÕ€¬¤¥ÿx™’ÿh·©ÿbêÐÿ9ܽÿ*Úµÿ%Õ°ÿ)Ϫÿ&̧ÿ%Ì¥ÿ#Ê£ÿ!Çžÿ!šÿ%Ãÿ#Á‹ÿÀŒÿ¼Œÿ·Šÿ´ˆÿ²ƒÿ±~ÿ ±xÿ µwÿ²tÿ°sÿ ¯vÿ­xÿ­wÿ°‚ÿ$¯‰ÿ>¶—ÿV¼ ÿ~űÿ±ÞÎÿäòì;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ØÖ~¸¹·ÿ©¤ƒÿž“_ÿŸŒOÿ¦ŠCÿª2ÿ¬~0ÿ³‚8ÿ®{5ÿ¥}5ÿ£€7ÿ¡ˆ2ÿ£Š4ÿ¦‹4ÿ¯Œ6ÿ¸Š<ÿ¹‹=ÿ»”?ÿ»˜Bÿ½›Gÿ½ Kÿ¿¤Mÿ©MÿÆ®JÿÍ°Mÿ̯LÿØ»XÿÕ»aÿÚÄ‚ÿØÆ—ÿÔƯÿ—†ÿ˜™ÿÈÊËÿæèé2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚßànÈÀÁÿ¥žÿ‡¨¡ÿvÅ·ÿ[ãÉÿ4׸ÿ'ײÿ#Ó®ÿ'ͨÿ$Ê¥ÿ#Ê£ÿ!È¡ÿÄ›ÿÀ˜ÿ#Á‹ÿ!¿‰ÿ½‰ÿºŠÿµˆÿ²†ÿ±‚ÿ°}ÿ ²yÿ µwÿ²tÿ°sÿ ¯vÿ ®yÿ°zÿ³…ÿ,·‘ÿJ£ÿkѵÿ™àÌÿÆóã½ìúôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíÜÝÛnÅÀŸÿ²§sÿ©–Yÿ¬Iÿ¯†7ÿ¯3ÿ²7ÿ®{5ÿ¥}5ÿ£€7ÿ ‡1ÿ¡ˆ2ÿ¥Š3ÿ®‹5ÿ·‰;ÿ¹‹=ÿ¹’=ÿ¹–@ÿº˜DÿºHÿ¼¡Jÿ¿¦JÿĬHÿË®KÿË®KÿÒµRÿδZÿÒ¼zÿÔ“ÿÒÄ­ÿ´ª£ÿž™šÿ¬®¯ÿÞàáYîíïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêïîÈÐÏ° ¨§ÿœšÿ…¿´ÿw×ÆÿJܾÿ.ѱÿ&Ò®ÿ"Ϊÿ$ˤÿ"É¢ÿ!ÈŸÿÅœÿ—ÿ½“ÿ¿ˆÿ¼†ÿ¹…ÿ´…ÿ²ƒÿ°ÿ¯}ÿ°yÿ¯tÿ°uÿ¯sÿ¯sÿ°yÿ¯}ÿ#±„ÿ;µÿ`½¢ÿ‰Ë¸ÿ§äÐÿÌ÷êÿéÿø(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäàÎʾ¢ÿµ¥{ÿ¯—cÿ«ŒGÿª„<ÿ«‚9ÿ§~5ÿ§~9ÿ¨:ÿ¤8ÿ¥‚9ÿ¨„8ÿ­†7ÿ´‰8ÿ¶‹:ÿ¶Ž;ÿµ‘=ÿµ•Bÿ¸˜Eÿ¸›Fÿ¼¡Gÿ¦GÿÅ©JÿÊ­KÿÊ­KÿÈ®TÿÍ´nÿп‡ÿÓßÿÔË°ÿ¤ž“ÿ‘‘‘ÿÌÌÌÿãááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàåäO²º¹ÿ‘™˜ÿ—¤¢ÿ‘ËÀÿzÚÉÿAÓµÿ,ϯÿ"Ϊÿ˧ÿ"É¢ÿ Ç ÿÅœÿ™ÿ¿”ÿºÿ½†ÿ¹ƒÿ¶‚ÿ±‚ÿ°ÿ®ÿ­{ÿ¯xÿ¯tÿ°uÿ¯sÿ°tÿ²{ÿ!´‚ÿ,ºÿGÁ›ÿsеÿŸáÎÿ¼ùåÿÙÿ÷yìÿûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýùç2ëßÃÜÔÄšÿëwÿ¶—Rÿ°ŠBÿ¯†=ÿ«‚9ÿ¨:ÿ§~9ÿ£€7ÿ¤8ÿ§ƒ7ÿ«„5ÿ°…4ÿ³ˆ7ÿ³‹8ÿ²Ž:ÿ±‘>ÿ³“@ÿ´—Bÿ¸Cÿ¿£Dÿ¦GÿÈ«IÿǪHÿƬRÿÆ­gÿÈ·ÿ̼˜ÿØÏ´ÿª¤™ÿÿ²²²ÿÙ××~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ×Öƒ˜©¦ÿƒŸ™ÿ€¾²ÿvÕÁÿXØ¿ÿ0Ï­ÿ,Эÿ#Ì¥ÿ!Ê£ÿ!ÇžÿÅœÿÄ™ÿÀ•ÿ¼ÿ·‹ÿºƒÿ·ÿ³~ÿ±|ÿ¯zÿ®yÿ¯wÿ®vÿ!¯tÿ"°uÿ°tÿ°yÿ´ƒÿ&¹ÿG¿œÿwȯÿ»ÙÌÿÝíæcîÿö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûòï çÞщ˿£ÿ³¡xÿ§“Zÿ§Gÿ©†Bÿ¦:ÿ§}8ÿ¨y;ÿª{=ÿ«~;ÿ«8ÿ«…3ÿ­‡5ÿ¯Š6ÿ±Œ8ÿ°=ÿ²?ÿ³“@ÿ·—Dÿ½DÿÁ¢EÿȨIÿȨIÿÈ«PÿêZÿÅ°lÿÌ»‚ÿ×É•ÿÄ»šÿ¤¤˜ÿš–ÿÎÍÉ°ìêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéçç2ÁÆÅ쎟œÿ‘­§ÿŒÊ¾ÿtÓ¿ÿMÍ´ÿ,Ë©ÿ*Ϋÿ É¢ÿÇ ÿÅœÿ™ÿÁ–ÿ¾“ÿ¹Œÿµ‰ÿ¸ÿµÿ²}ÿ°{ÿ¯zÿ®yÿ®vÿ­uÿ ®sÿ ®sÿ°tÿ²{ÿ!¹ˆÿ-À”ÿTÌ©ÿˆÙÀÿÏíàìüõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóæ2åÙ½ÿ˹ÿ¶¢iÿ­“Mÿ¬‰Eÿ§€;ÿ§}8ÿ§x:ÿª{=ÿ«~;ÿª~7ÿª„2ÿ­‡5ÿ­ˆ4ÿ®‰5ÿ®‹;ÿ°=ÿ°=ÿ´”AÿºšAÿ¾ŸBÿÅ¥FÿƦGÿÆ©Nÿ½¤Tÿ¿ªfÿƵ|ÿʼˆÿÔ˪ÿ¯¯£ÿŒˆÿ¼»·ÿÞÜÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞÜÜc«·±ÿ¤šÿ³ÿpѽÿRغÿ2άÿ$Ê¥ÿ%˦ÿ#Çžÿ!ÅœÿÄ—ÿÁ”ÿ¿ÿ¼ÿ¸ˆÿµ†ÿ³~ÿ²}ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ®rÿ­rÿ­vÿ¯yÿ%´‡ÿ=¼•ÿeêÿ’ÔÁÿÃæÜÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéë(ÕÑƽ¼²”ÿªškÿ©“Qÿ©Š?ÿ­‚9ÿ¯|6ÿ¯{9ÿ­{9ÿ¨{8ÿ¥€6ÿ©…7ÿª„2ÿ¬†4ÿ¬ˆ:ÿ®Š<ÿ°Œ>ÿ´Bÿº•Cÿ½šDÿÁžDÿàFÿŦKÿÀ¤Mÿ«[ÿÆ°hÿκsÿßÏ”ÿ½¹¡ÿ™Žÿ­¨ŸÿÍÊÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëëÕÓÓƒ ¬¦ÿƒ¨žÿˆË¼ÿl͹ÿQ×¹ÿ2άÿ"È£ÿ!Ç¢ÿ"Æÿ Ä›ÿ•ÿ¿’ÿ½Žÿº‹ÿ·‡ÿ´…ÿ²}ÿ±|ÿ±zÿ°yÿ±uÿ°tÿ¯rÿ­qÿ¯tÿ!°yÿ"´~ÿ-¼ÿIÈ¡ÿtÒ¹ÿ¥çÔÿÙüòyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðìáOÒȪÿ¸¨yÿµŸ]ÿ°‘Fÿ²‡>ÿ±~8ÿ¯{9ÿ¬z8ÿ¦y6ÿ£~4ÿ§ƒ5ÿ©ƒ1ÿ«…3ÿ«‡9ÿ­‰;ÿ¯‹=ÿ³Aÿ¸“Aÿ»˜Bÿ¾›AÿÀCÿÄ¥JÿÀ¤Mÿì\ÿ¾¨`ÿË·pÿÒ‡ÿÅÁ©ÿ³¯¤ÿ¢”ÿÀ½¸ÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãååEº¼¼ÿ­¢ÿ…ƶÿu׿ÿRÖ¸ÿ/Ñ­ÿ$Ê¥ÿÇÿÈžÿ ÖÿÁ”ÿ¿ÿ½ÿ¼‰ÿ¸†ÿµÿ²ÿ °|ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ°qÿ®sÿ²wÿµƒÿ1¸ŒÿV½žÿ‡Ì·ÿ¸ÞÒÿâíêEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäßàYÈħÿµ§wÿ­œSÿ°Eÿ±‡:ÿ¬‚5ÿ©}6ÿª}:ÿ§€<ÿ¥~:ÿ¨2ÿ¨2ÿªƒ8ÿ­†;ÿ°‰>ÿ²‹@ÿ¶Aÿ¹“Aÿ¼˜@ÿ½™AÿÁŸEÿÁ¤IÿÁ¥NÿÁ§Sÿ̲^ÿÓ»oÿÍÂœÿÍÅ®ÿ—„ÿ³¯¤ÿÚÙÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×ÙÙ~©««ÿ‹« ÿ„ŵÿsÕ½ÿOÓµÿ+Í©ÿ!Ç¢ÿÆœÿÆœÿ•ÿÀ“ÿ¾Žÿ»‹ÿº‡ÿ¶„ÿ´€ÿ±~ÿ¯{ÿ®zÿ ¯wÿ °sÿ ±pÿ²qÿ±rÿ°uÿ³xÿ#ºˆÿ9À”ÿ`Ǩÿ—ÜÇÿÊðä¥ïú÷ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÜ¿ÿÍ¿ÿ¸§^ÿ·—Lÿ´Š=ÿ¯…8ÿª~7ÿª}:ÿ¦;ÿ¥~:ÿ¨2ÿ¨2ÿ©‚7ÿ¬…:ÿ®‡<ÿ°‰>ÿ´?ÿ·‘?ÿ¹•=ÿ»—?ÿ¾œBÿ¾¡Fÿ¾¢Kÿ¾¤PÿÇ­YÿζjÿÆ»•ÿÈÀ©ÿ¥ŸŒÿ­©žÿÎÍÉ°ìíñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÈÎÍ°ž¤£ÿt² ÿlÌ´ÿ^غÿ9Ñ®ÿ!Ê£ÿÅžÿÚÿÄ—ÿÀ‘ÿ¿Œÿ¼ˆÿº†ÿ¸‚ÿ¶€ÿ³{ÿ±yÿ ­zÿ¬yÿ ±tÿ °sÿ±sÿ±sÿ²uÿ±yÿ²€ÿ4»“ÿ_Á£ÿŽÌ¼ÿÎãÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEØгÿ¿°‚ÿ³Ÿ^ÿªEÿª‡>ÿ¦7ÿ¥|3ÿ¦{8ÿ¦{8ÿ¨€5ÿ§4ÿ¨6ÿ«‚9ÿ­„;ÿ®…<ÿ±‰>ÿµŽ?ÿ·’@ÿ¸•?ÿ»›Bÿ¿ŸFÿ¾ GÿÁ£JÿÉ«RÿÒ³^ÿμ‡ÿΠÿ¾´–ÿ¬¦“ÿÀ½µÿàáåOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¾ÄÃÿ¢¨§ÿ|º¨ÿnζÿZÔ¶ÿ3˨ÿÆŸÿÄÿ™ÿÁ”ÿ¾ÿ½Šÿº†ÿ¸„ÿ¶€ÿ´~ÿ²zÿ°xÿ¬yÿ«xÿ °sÿ °sÿ °rÿ±sÿ²uÿ³{ÿ&¹‡ÿ<ÛÿkͯÿÛËÿÜñécÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøöìêâÅÊÓÄ–ÿÀ¬kÿ±–Lÿ¯ŒCÿ©„:ÿ¦}4ÿ¥z7ÿ§|9ÿ¨€5ÿ§4ÿ¨6ÿª8ÿ«‚9ÿ¬ƒ:ÿ¯‡<ÿ³Œ=ÿµ>ÿ·”>ÿ¹™@ÿ½Dÿ½ŸFÿ¿¡HÿŧNÿˬWÿǵ€ÿʾœÿÍÃ¥ÿª¤‘ÿ°­¥ÿÓÔ؃íðøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìôóÎÖÕ­¸¶ÿ¢°®ÿu˳ÿV׸ÿCÓ°ÿ*Ç¢ÿÄ›ÿÄ›ÿ!•ÿ¿ÿ¾‹ÿ¼‰ÿ¸‚ÿ¶€ÿ ´~ÿ²|ÿ³yÿ±wÿ¯yÿ¬wÿ®sÿ®sÿ­rÿ®sÿ²zÿ$´„ÿ>½–ÿhêÿšÑÂÿÐä߉ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ñìØпÿ³“ÿ¬škÿª‘Sÿ¨ŠCÿ¦7ÿ«~4ÿ­€6ÿ©€7ÿ¨6ÿª6ÿ«€7ÿ¬8ÿ­‚9ÿ®‡9ÿ±Š<ÿ°Ž;ÿ²=ÿ´•@ÿ·˜Cÿ¹›Dÿ¿œFÿÅ KÿÉ£QÿêjÿÈ·†ÿÔÈ ÿ¯¥ÿª¦›ÿÊÊÊÿéìñ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÃËÊÿ¡¬ªÿ¥³±ÿ|ÒºÿUÖ·ÿ=ͪÿ&ÞÿÚÿ™ÿ¿’ÿ½ÿ¼‰ÿº‡ÿ·ÿµÿ²|ÿ±{ÿ²xÿ°vÿ¯yÿ¬wÿ­rÿ®sÿ®sÿ¯tÿµ}ÿ*ºŠÿDÃœÿq̳ÿ§ÞÏÿÝñìcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèàÏÑ¢ÿ¸¦wÿ²™[ÿ«Fÿ§‚8ÿ«~4ÿ«~4ÿ¨6ÿ§~5ÿ©~5ÿ«€7ÿ¬8ÿ¬8ÿ¬…7ÿ¯ˆ:ÿ®Œ9ÿ±<ÿ²“>ÿµ–Aÿ¸šCÿ¾›EÿÂHÿÅŸMÿ¾¥eÿ±€ÿÒÆžÿ·­•ÿª¦›ÿÀÀÀÿàãèOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëE¹ÇÅÿ™§¥ÿ£¶³ÿfÔ¸ÿHÓ²ÿ,ɤÿ$Áœÿ"˜ÿ¿•ÿ»ÿ»ÿ»Šÿ¹„ÿ¶~ÿ³|ÿ ±zÿ°yÿ±uÿ ±tÿ °wÿ®uÿ#ªrÿ$«sÿ ­tÿ°vÿ'¸„ÿ1¿”ÿbèÿ”ÑÃÿÒã߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêëØÉǽ¼¬•ÿ±›qÿ«Rÿ¨†:ÿ®‚/ÿ«,ÿ§}6ÿ¦|5ÿ©~5ÿ«€7ÿ«6ÿ«6ÿ«„6ÿ®‡9ÿ®‹;ÿ°=ÿ±‘>ÿ³“@ÿ¸–Cÿ¾˜FÿÛIÿÄœJÿÀ¤]ÿïvÿÑÁ“ÿ¸šÿ¯¬ÿ¸¸¸ÿÖÙÞ~íðõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêòñÜçåc¶ÄÂÿ—¥£ÿ¤·´ÿbдÿBͬÿ(Å ÿ"¿šÿ!Á—ÿ¼’ÿ¹‹ÿ»ÿº‰ÿ¸ƒÿµ}ÿ²{ÿ°yÿ¯xÿ±uÿ °sÿ °wÿ®uÿ#ªrÿ%¬tÿ!®uÿ!³yÿ+¼ˆÿ6Ä™ÿjË°ÿŸÜÎÿÝîêcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåÖԀɹ¢ÿº¤zÿ±•Xÿ­‹?ÿ±…2ÿ¬€-ÿ¦|5ÿ¥{4ÿ¨}4ÿª6ÿ«6ÿ«6ÿªƒ5ÿ­†8ÿ«ˆ8ÿ­Š:ÿ®Ž;ÿ°=ÿµ“@ÿ¼–DÿÀ˜FÿÁ™GÿºžWÿ»§nÿȸŠÿÅ»ÿ²¯ ÿ³³³ÿÐÓØÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÙØy©º¶ÿ…»®ÿlʲÿ@Ö²ÿ4ʦÿ*Ãœÿ&¿˜ÿ ¼“ÿ¼Žÿ¼Šÿ¸†ÿ¸„ÿ¶‚ÿµ}ÿ²{ÿ°yÿ¯xÿ®vÿ­uÿ®uÿ«rÿ®rÿ­qÿ)­xÿ/²€ÿ3·ŽÿEǦÿ´Ã»ÿÓßßÿéøú(ïþÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëáOÊǹÿ²©•ÿ¬œrÿ§ŒTÿ«ƒ1ÿª‚0ÿ¥€0ÿ¤}2ÿ¥}2ÿ§4ÿ©€7ÿ©€7ÿª8ÿ¬ƒ:ÿ®†;ÿ¯‡<ÿ±Œ<ÿ³Ž>ÿ´’>ÿ·•AÿºšAÿ¼œCÿÀMÿÌ¥aÿȲpÿÕÅ–ÿ½¸—ÿ©©›ÿËÍÕÿååñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíñÑÍÌš¢³¯ÿˆ¾±ÿrиÿ<Ò®ÿ1Ç£ÿ'À™ÿ$½–ÿº‘ÿ»ÿ»‰ÿ·…ÿ¶‚ÿµÿ´|ÿ±zÿ°yÿ¯xÿ®vÿ®vÿ°wÿ­tÿ°tÿ°tÿ-±|ÿ4·…ÿ:¾•ÿMÏ®ÿ¿ÎÆÿÛççníüþðÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôòè(×Ôƽ¾µ¡ÿµ¥{ÿ®“[ÿ°ˆ6ÿ¬„2ÿ¦1ÿ¥~3ÿ¦~3ÿ¨€5ÿ©€7ÿ¨6ÿ©€7ÿ«‚9ÿ¬„9ÿ®†;ÿ¯Š:ÿ²=ÿ²<ÿµ“?ÿ¸˜?ÿºšAÿ¼™IÿÈ¡]ÿ¬jÿÏ¿ÿ¼·–ÿ¦¦˜ÿÀÂÊÿÜÜècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõçë2¿ÂÀÿŽ°¥ÿ~ijÿlÕºÿ:Ψÿ/Ãÿ(½•ÿ%º’ÿ ¹Œÿ¸‹ÿ¹‡ÿµƒÿ´~ÿ²}ÿ²{ÿ¯yÿ¯wÿ­vÿ­vÿ­vÿ®vÿ«sÿ¯vÿ°wÿ*³ÿ=¹‹ÿK›ÿqеÿÐÛÓÿçïï2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäâØyÈIJÿ¹­‰ÿ°™gÿ¯Aÿ¬…:ÿ©6ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿ«8ÿ­‚9ÿ®ƒ:ÿ¯ˆ:ÿ±Š<ÿ²;ÿµ>ÿ¶”@ÿ¸–Bÿ»–DÿÆŸUÿÁ©aÿμ‡ÿû–ÿ«©—ÿ¹»»ÿØ×à~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòäè;¹¼ºÿ¯¤ÿ~ijÿgеÿ6ʤÿ,Àšÿ&»“ÿ$¹‘ÿ·Šÿ¶‰ÿ·…ÿ´‚ÿ³}ÿ±|ÿ±zÿ®xÿ®vÿ¬uÿ¬uÿ¬uÿ­uÿªrÿ¯vÿ²yÿ,µÿ@¼ŽÿPÇ ÿyؽÿÙäÜyìôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîìâEÒμÿ¿³ÿ´kÿ´’Fÿ­†;ÿª‚7ÿ§4ÿ¦}4ÿ¨6ÿ«€7ÿª6ÿª~7ÿª~7ÿ¬8ÿ­‚9ÿ­†8ÿ°‰;ÿ±Œ:ÿ³Ž<ÿ´’>ÿ¶”@ÿº•Cÿ›Qÿ¼¤\ÿȶÿƾ™ÿ±¯ÿ´¶¶ÿÕÔÝ€ïîø ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçáâO­¼¸ÿ‚µ§ÿnȱÿPÍ­ÿ,ËŸÿ#–ÿ½ÿ»ÿº‡ÿ¸…ÿ·ƒÿ´€ÿµ|ÿ³{ÿ²xÿ°wÿ®uÿ­uÿ¬tÿ¬tÿ®vÿ«sÿ¯wÿ³~ÿ,¹†ÿI¾—ÿsǪÿ¥ÙÈÿäêå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿññëÖÔÊ¥½¶›ÿ² wÿ«”Vÿ¬‡Cÿªƒ9ÿª6ÿ¨}4ÿ©~5ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ¬8ÿ­‚9ÿ¯…:ÿ±‡<ÿ±Š;ÿ³Œ=ÿ´=ÿ¶‘?ÿº”Bÿ¾˜Fÿº Tÿ¯rÿȽ‘ÿ¸³šÿ²³ªÿÓÏÔÿîëôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞØÙy¬»·ÿ…¸ªÿnȱÿLÉ©ÿ)Èœÿ!À”ÿ¼Žÿ»ÿ¹†ÿ·„ÿ¶‚ÿ³ÿ´{ÿ²zÿ²xÿ¯vÿ®uÿ¬tÿ¬tÿ¬tÿ­uÿ«sÿ°xÿµ€ÿ/¼‰ÿM›ÿwË®ÿ«ßÎÿìòíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÞԀƿ¤ÿ¹§~ÿ²›]ÿ±ŒHÿ«„:ÿª6ÿ§|3ÿ¨}4ÿª~7ÿª~7ÿ¬~7ÿ¬~7ÿ«€7ÿ­‚9ÿ®„9ÿ°†;ÿ°‰:ÿ²‹<ÿ³Ž<ÿµ>ÿº”Bÿº”Bÿ¹ŸSÿ»¨kÿøŒÿºµœÿ®¯¦ÿÌÈÍÿìéò(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïïï ÓÓÓƒ£¾µÿ|¾«ÿZ˯ÿ>Ê¥ÿ'Å—ÿ½ÿº‹ÿ¹Šÿ·ƒÿ¶‚ÿ¶~ÿ³{ÿ³yÿ²xÿ±uÿ°tÿ¯sÿ®sÿ®sÿ®sÿ­rÿ©sÿ°{ÿ!µ…ÿ5½“ÿUáÿ•É·ÿÎßÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ÍÉ·ÿº¯ÿ±nÿ¬Sÿ®‡<ÿ¬‚7ÿ§}2ÿ§}2ÿ©~5ÿ©~5ÿ«~5ÿ¬6ÿ­€6ÿ®7ÿ­ƒ6ÿ¯…8ÿ¯ˆ9ÿ°‰:ÿ³;ÿ´Ž<ÿº“>ÿ¹’=ÿ½ Oÿ¼¦dÿĶ‚ÿú™ÿ·¯¢ÿÊÆÅÿêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ÐÐÐÿ¥À·ÿ~À­ÿYÊ®ÿ<È£ÿ$”ÿ»ÿ¸‰ÿ·ˆÿ¶‚ÿµÿµ}ÿ³{ÿ²xÿ±wÿ±uÿ°tÿ¯sÿ®sÿ¯tÿ¯tÿ¯tÿ«uÿ²}ÿ%¹‰ÿ9Á—ÿZȦÿšÎ¼ÿÓäÛƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÕÑ¿ÿÀµ•ÿµ¡rÿ®’Uÿ°‰>ÿ­ƒ8ÿ¨~3ÿ§}2ÿ¨}4ÿ¨}4ÿ«~5ÿ«~5ÿ¬5ÿ­€6ÿ­ƒ6ÿ®„7ÿ®‡8ÿ¯ˆ9ÿ²Œ:ÿ³;ÿ¶:ÿ´8ÿ»žMÿ¸¢`ÿÁ³ÿÄ»šÿ¸°£ÿÇÃÂÿçæê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéîí(ÄÉÈÿš¼±ÿ€É³ÿJͬÿ:Ç ÿ'¾ÿ#º‰ÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ²~ÿ3»‘ÿBÀœÿfĬÿÀÑÈÿâéæEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìïóÔÔÈÿ¾¶Ÿÿ¯¡}ÿ«’`ÿ²ŽBÿ©6ÿ¤|1ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿ«4ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¹‘?ÿ´•Fÿ³Uÿijzÿø’ÿ»±ŸÿÆ¿¼ÿàßãYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèíì(ÃÈÇÿš¼±ÿÊ´ÿJͬÿ9ÆŸÿ&½Œÿ"¹ˆÿ¶„ÿµƒÿµ€ÿ²}ÿ°zÿ°zÿ¯wÿ¯wÿ®tÿ®tÿ­sÿ­sÿ¬sÿ¬sÿ¯tÿ¬vÿ ³ÿ4¼’ÿCÁÿhÆ®ÿÃÔËÿæíê2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòö ÙÙ͚û¤ÿ³¥ÿ¯–dÿ´Dÿ«ƒ8ÿ¥}2ÿ§4ÿ§4ÿ¦~3ÿ©4ÿ©4ÿª€3ÿ«4ÿ«‚3ÿ¬ƒ4ÿ«„5ÿ­†7ÿ¯Š8ÿ±Œ:ÿ³‹9ÿ¸>ÿ³”Eÿ²œTÿÁ°wÿÁ¶ÿº°žÿĽºÿÞÝácÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåêé;ÁÇÂÿš¼±ÿÊ´ÿMͪÿ4Æœÿ!¾Œÿºˆÿ·„ÿ¶ƒÿ¶€ÿ´~ÿ²{ÿ²{ÿ±xÿ±xÿ°wÿ°wÿ¯vÿ¯vÿ¯vÿ®vÿ°xÿ ¯xÿ*´„ÿB¼–ÿTÀ£ÿ„´ÿÑÔÒ‰îðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜÞØyÆ¿®ÿ³¨ÿ°›nÿµ•Jÿ¬‡=ÿ¥€6ÿ¦7ÿ¤5ÿ¤5ÿ§€6ÿ§€6ÿ§€5ÿ¨6ÿ©‚7ÿªƒ8ÿ©…7ÿ«‡9ÿ®Š<ÿ¯‹=ÿ²‹=ÿ¶Dÿ²’Gÿ´™VÿÁ®uÿųŽÿ»°šÿÄ»¸ÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâçæE¾Ä¿ÿ™»°ÿÊ´ÿLÌ©ÿ2Äšÿ!¾Œÿ»‰ÿ¸…ÿ·„ÿ·ÿµÿ³|ÿ³|ÿ³zÿ²yÿ²yÿ±xÿ±xÿ±xÿ±xÿ°xÿ³{ÿ$³|ÿ.¸ˆÿFÀšÿWæÿ†Ä¶ÿÔ×Õ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâäÞYËijÿ¶«ÿµ sÿ¸˜Mÿ°‹Aÿ¨ƒ9ÿ¨ƒ9ÿ¦7ÿ¦7ÿ©‚8ÿ©‚8ÿ©‚7ÿªƒ8ÿ«„9ÿ¬…:ÿ«‡9ÿ­‰;ÿ¯‹=ÿ±?ÿ³Œ>ÿ¶Dÿ³“Hÿ´™Vÿ¾«rÿIJÿ¼±›ÿú·ÿÙÕÚ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿœº­ÿ„ʳÿP̨ÿ8˜ÿ+¾Œÿ'ºˆÿ$·…ÿ$·…ÿ#¶‚ÿ!´€ÿ ´~ÿ ´~ÿ³{ÿ³{ÿ³{ÿ²zÿ±{ÿ±{ÿ±{ÿ±{ÿ$³|ÿ-³~ÿ:¸ŽÿW¾Ÿÿt¿ªÿ˜Â»ÿÚ×Ù~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäçå;ËŸÿ´¬•ÿ·¥|ÿº™Tÿ®Hÿ¦…@ÿ¥„?ÿ¤=ÿ¥‚>ÿ©„@ÿ¨ƒ?ÿ§ƒ=ÿ¨„>ÿ©…?ÿª†@ÿ«‡Aÿ­‰Cÿ­‹Eÿ®ŒFÿ²‹Gÿ³ŒHÿ³’Mÿ³™Wÿ½ªqÿIJÿ½²œÿÁ¸µÿ×Ó؃ïðô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâääE¾Â½ÿ»®ÿ…Ë´ÿRΪÿ;Å›ÿ-ÀŽÿ*½‹ÿ'ºˆÿ&¹‡ÿ&¹…ÿ$·ƒÿ#·ÿ#·ÿ"·ÿ"·ÿ!¶~ÿ!¶~ÿ!µÿ!µÿ!µÿ!µÿ&µ~ÿ0¶ÿ>¼’ÿ[£ÿvÁ¬ÿ™Ã¼ÿÛØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéç2Ìƹÿ¶®—ÿ¾¬ƒÿ¿žYÿ³’Mÿ¬‹Fÿª‰Dÿ©†Bÿª‡Cÿ®‰Eÿ¬‡Cÿ¬ˆBÿ­‰Cÿ®ŠDÿ¯‹Eÿ¯‹Eÿ°ŒFÿ°ŽHÿ±Iÿ¶Kÿ¶Kÿ·–Qÿ¶œZÿ½ªqÿųŽÿ¾³ÿÀ·´ÿÕÑÖÿîïó ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Á¾ÿ¢¼¯ÿŒÍ·ÿVÒ®ÿKÈ ÿQÀ”ÿM¼ÿKºŽÿJ¹ÿJº‹ÿI¹ŠÿH¸ˆÿH¸ˆÿG·‡ÿF¶†ÿF¶†ÿF¶†ÿD·†ÿD·†ÿD¶‡ÿD¶‡ÿ9»†ÿ<¾‰ÿOšÿkǪÿ‹Â³ÿ¬ÂÀÿÝÙÞyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçéé2ÍǼÿ¹±šÿƳŽÿÁ¥eÿº™Zÿ³’Sÿ°Pÿ°Nÿ²Pÿ´Pÿ²ŽNÿ²ŽNÿ³Oÿ´Pÿ´Pÿµ‘Qÿµ‘Qÿµ’Rÿ¶“Sÿ¼–Vÿº”Tÿ»›Zÿº¡cÿÁ¬xÿȶ‘ÿÁ¶¢ÿÀ·³ÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäää;Âÿÿ£½°ÿŽÏ¹ÿYÕ±ÿNË£ÿVÅ™ÿS–ÿP¿“ÿP¿“ÿPÀ‘ÿN¾ÿM½ÿN¾ŽÿM½ÿL¼ŒÿL¼ŒÿL¼ŒÿJ½ŒÿJ½ŒÿJ¼ÿJ¼ÿAÃŽÿDÆ‘ÿVÉ¡ÿqÍ°ÿÆ·ÿ®ÄÂÿÞÚßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèêê(ÎȽÿ»³œÿ̹”ÿÉ­mÿ¡bÿ»š[ÿ¸—Xÿ¸•Vÿ¹–Wÿ»—Wÿ¸”Tÿ¹•Uÿº–Vÿ»—Wÿ»—Wÿ»—Wÿ»—Wÿ»˜Xÿ¼™YÿÃ]ÿÁ›[ÿ¢aÿÀ§iÿį{ÿ˹”ÿĹ¥ÿ¹µÿÓÑ×ÿìïôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞàèY¾ÀÈÿ©¼¹ÿ­Í¼ÿЪÿŒÈ ÿÚÿ{¿–ÿ|À—ÿ}Á˜ÿ{¿–ÿz¾•ÿz¾•ÿy½”ÿx¼“ÿx¼“ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿw»’ÿ€¼“ÿ‰½•ÿ•Ç¥ÿŸÆ­ÿ¬Ç·ÿµÅ¾ÿÖÞÝ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2ÆÁÂÿ±³ ÿº¼žÿ¼±ÿ²£rÿªœhÿ­šgÿ«™dÿ®˜dÿ±™cÿ°˜bÿ²šdÿ³›eÿ³›eÿ´œfÿ³iÿ³iÿ²iÿ²iÿµŸoÿµŸoÿ±¤pÿ±©tÿ·µ…ÿ¿½šÿº¹¤ÿ½ºµÿÖÓÕÿòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßáéY¿ÁÉÿ«¾»ÿ¯Ï¾ÿ Ó­ÿ̤ÿƒÇžÿÚÿÚÿÅœÿ~™ÿ~™ÿ~™ÿ}Á˜ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ|À—ÿ†Â™ÿÛÿšÌªÿ¤Ë²ÿ®É¹ÿ´Ä½ÿÕÝÜ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÇÂÃÿ³µ¢ÿ¾À¢ÿÀµƒÿ¶§vÿ® lÿ°jÿ®œgÿ±›gÿµgÿ´œfÿ´œfÿ´œfÿµgÿ¶žhÿ´žjÿµŸkÿ´Ÿkÿ´Ÿkÿ·¡qÿ·¡qÿ³¦rÿ³«vÿ¹·‡ÿÁ¿œÿ¼»¦ÿ¿¼·ÿÖÓÕƒòïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæâèEÆÂÈÿ½½·ÿÉͺÿÃѨÿºÈŸÿÅ¿šÿÀº•ÿÁ»–ÿ¼—ÿÀº•ÿ¿¹”ÿÀº•ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¾¸“ÿ¿¹”ÿ¿¹”ÿÀº•ÿ´¿—ÿ¶Á™ÿÀË«ÿÂʳÿ¿Æ·ÿ¼ÀºÿØÛÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçè2ÅÀÁÿ²³£ÿ¼Ã¢ÿ¹µ€ÿ°¨sÿ¦¡jÿ¨žhÿ¦dÿ©œdÿªždÿ­œcÿ®dÿ®dÿ­Ÿeÿ­Ÿeÿ¬Ÿgÿ¬Ÿgÿ¬¡hÿ¬¡hÿ± mÿ°Ÿlÿ­¦mÿ­«qÿ³·ƒÿ»½™ÿ¸¼£ÿÀ¾¶ÿ×ÕÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçãéEÇÃÉÿ¼¼¶ÿÆÊ·ÿÀÎ¥ÿ¶Ä›ÿÁ»–ÿ½·’ÿ½·’ÿ¾¸“ÿ»µÿ»µÿ¼¶‘ÿ»µÿ»µÿ»µÿ»µÿ»µÿ»µÿ¼¶‘ÿ¼¶‘ÿ¼¶‘ÿ¯º’ÿ²½•ÿ¾É©ÿÁɲÿ½Äµÿ¸¼¶ÿÕØÖ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëæç2½¾ÿ­®žÿ·¾ÿ²®yÿ¨ kÿ˜aÿŸ•_ÿ”[ÿ¡”\ÿ¡•[ÿ¤“Zÿ¥”[ÿ¥”[ÿ£•[ÿ¤–\ÿ¢•]ÿ£–^ÿ¢—^ÿ£˜_ÿ¨—dÿ§–cÿ¤dÿ¥£iÿª®zÿ³µ‘ÿ³·žÿ¾¼´ÿØÖÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìçé2ÕÄÈÿÓ¹³ÿäïÿèÅšÿé¸ÿî°ˆÿꬄÿꬄÿë­…ÿ誂ÿ誂ÿ髃ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ誂ÿ髃ÿâ«„ÿÞ®Šÿç¾ÿáÁªÿÓ¿®ÿ¶°ÿ×ÔÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçäæ;½º¼ÿ¦ª—ÿ®¸”ÿ£¨kÿ™™]ÿSÿQÿ‹ŒNÿŒOÿ‘ŒMÿŠKÿŠKÿŠKÿŠKÿŠKÿŽ‹NÿŒOÿŒOÿŽPÿ™ŽTÿ˜Sÿ”“Vÿ–™[ÿ¦nÿ§¯‡ÿ­³šÿ¼½´ÿÙØÚyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïêìØÇËÿÔº´ÿã®ÿãÀ•ÿ㲊ÿ誂ÿã¥}ÿã¥}ÿä¦~ÿá£{ÿá£{ÿâ¤|ÿá£{ÿâ¤|ÿâ¤|ÿá£{ÿá£{ÿá£{ÿá£{ÿá£{ÿâ¤|ÿÜ¥~ÿקƒÿà·–ÿܼ¥ÿκ©ÿ¼°ªÿÑÎÉ°ðïñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäáãO»¸ºÿ¢¦“ÿ¦°ŒÿšŸbÿSÿ„„Hÿ‚‚Fÿ‚Dÿ„Dÿ†Bÿ„@ÿ…€Aÿ„@ÿ„@ÿ„@ÿƒ€Cÿ„Dÿƒ‚Eÿƒ‚EÿŒGÿ‹€Fÿˆ‡JÿŠOÿ’›cÿ ¨€ÿ«±˜ÿ¿À·ÿÜÛÝnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿííí×ÊÌÿܺ­ÿó½¤ÿÿ¶Šÿÿ©{ÿû¡rÿöœmÿõ›lÿöœmÿôškÿó™jÿ÷›lÿöškÿöškÿöškÿôškÿôškÿôškÿõ›lÿõ›lÿõ›lÿûœpÿûšvÿþ¬‰ÿòµ›ÿÞ´¡ÿ¿« ÿËÉÁÿêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÚÜn³´²ÿ™¢ˆÿž¨~ÿŽ•Rÿ†Cÿsz7ÿqx5ÿtv4ÿuw5ÿuw5ÿrt2ÿuv4ÿuv4ÿtu3ÿtu3ÿtv4ÿuw5ÿtx6ÿuy7ÿyw6ÿwu4ÿw|7ÿz„>ÿ…‘Wÿ—¡wÿ¦¯•ÿ¾Á¸ÿÜÞßcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîîî ×ÊÌÿÛ¹¬ÿÿû°„ÿ÷¡sÿôškÿï•fÿî”eÿï•fÿì’cÿì’cÿð”eÿï“dÿï“dÿï“dÿí“dÿí“dÿî”eÿï•fÿï•fÿð–gÿõ–jÿõ”pÿø¦ƒÿí°–ÿÚ°ÿ»§œÿÇŽÿæææ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíìðÔÓÕƒ­®¬ÿ“œ‚ÿ•Ÿuÿ„‹Hÿt{8ÿip-ÿgn+ÿjl*ÿjl*ÿjl*ÿhj(ÿij(ÿij(ÿij(ÿhi'ÿhj(ÿik)ÿhl*ÿim+ÿom,ÿmk*ÿns.ÿq{5ÿ}‰Oÿ‘›qÿ£¬’ÿ½À·ÿÞàáYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéñð(ÔÔÔÿؾ®ÿí¶›ÿÿ­ƒÿÿ›lÿÿ’^ÿÿ\ÿÿ[ÿÿ[ÿÿŽ[ÿÿZÿÿŒYÿÿŒYÿÿZÿÿZÿÿZÿÿZÿþŽZÿÿ[ÿÿ\ÿÿ\ÿÿ^ÿÿ–hÿÿŸxÿõªŠÿæ²›ÿ¾¤”ÿ¾½³ÿÞãáYíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíëñÍÌÎÿª¬¦ÿ“ž~ÿ›kÿ‡@ÿqu.ÿjn'ÿei"ÿcg ÿfj#ÿde!ÿde!ÿcd ÿcd ÿcd ÿcd ÿcg ÿcg ÿdh!ÿdh!ÿdf ÿeg!ÿem&ÿht,ÿw†IÿŒ™mÿ¡¬’ÿÃÈ¿ÿæçë2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëóòÖÖÖÿÚÀ°ÿí¶›ÿþ¬‚ÿÿ›lÿÿ‘]ÿþŽZÿýYÿýYÿÿŒYÿþ‹XÿÿŠWÿÿ‹Xÿÿ‹Xÿÿ‹Xÿþ‹Xÿþ‹XÿýYÿþŽZÿþŽZÿÿ[ÿþ]ÿÿ“eÿÿœuÿò§‡ÿ屚ÿÀ¦–ÿ½¼²ÿÙÞÜÿíøöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåãéEÂÁÃÿ£¥ŸÿŽ™yÿ…‘aÿz‚;ÿmq*ÿfj#ÿaeÿ`dÿbfÿabÿabÿ`aÿ`aÿ`aÿ`aÿ_cÿ`dÿ`dÿ`dÿacÿceÿck$ÿgs+ÿw†Iÿšnÿ¤¯•ÿÆËÂÿèéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëöôÒÝÛÿ×ĵÿç¸ÿõ«‡ÿÿmÿÿZÿÿŒWÿþŠUÿÿ‹VÿÿŠVÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰Uÿÿ‰UÿÿŠVÿÿ‹VÿÿŒWÿÿXÿÿXÿüWÿþ•\ÿÿšmÿü¤€ÿð°—ÿÏ©—ÿ¾¸«ÿÏÖÓÿæôó2ïýü ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝÜàc¹·¶ÿ £”ÿšrÿ|ŽQÿ{4ÿjn#ÿdgÿ`cÿ^aÿ`cÿ^`ÿ^`ÿ__ÿ__ÿ__ÿ__ÿ]_ÿ]_ÿ^aÿ^aÿ]`ÿ^aÿ_hÿdo)ÿuƒIÿ™oÿ¦°™ÿÉÍÇÿêêðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîù÷ ×âà~Ûȹÿç¸ÿôª†ÿÿmÿÿZÿÿ‹VÿüˆSÿý‰Tÿÿ‰UÿþˆTÿÿˆTÿÿˆTÿÿˆTÿÿˆTÿÿ‰Uÿÿ‰Uÿÿ‹VÿÿŒWÿþŒWÿÿXÿüWÿü“Zÿý˜kÿû£ÿð°—ÿÓ­›ÿ¸²¥ÿÂÉÆÿßíìÿëùøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÕÙ€¯­¬ÿ ‘ÿ›sÿy‹Nÿx|1ÿhl!ÿcfÿ`cÿ^aÿ`cÿ]_ÿ]_ÿ^^ÿ^^ÿ^^ÿ^^ÿ\^ÿ]_ÿ]`ÿ]`ÿ\_ÿ]`ÿ^gÿdo)ÿv„Jÿœrÿª´ÿÎÒÌšîîô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝèæcÛÌÃÿâ·¢ÿíª‹ÿürÿû‘[ÿúWÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰Tÿù‰TÿúŠUÿùŒVÿúWÿúŽXÿúŽXÿõ“Sÿõ—Vÿýšfÿÿ¡~ÿÿ°•ÿä° ÿ¾«žÿ¹º¶ÿØçãÿèöõ(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîëíÏÌΚ©¦¡ÿ›žˆÿ‘mÿyŒGÿxz.ÿikÿefÿbcÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ]`ÿ]`ÿ]`ÿ`aÿabÿ`h!ÿgq.ÿz‡Oÿ• xÿ°¹¤ÿÔØÓƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâíëEàÑÈÿ乤ÿî«Œÿÿ uÿý“]ÿûŽXÿö‰Sÿö‰Sÿù‰Tÿù‰TÿúˆSÿúˆSÿúˆSÿû‰TÿúŠUÿû‹VÿúWÿûŽXÿúŽXÿúŽXÿö”Tÿö˜WÿýšfÿÿŸ|ÿÿ®“ÿç³£ÿ¸¥˜ÿ¯°¬ÿÏÞÚÿäòñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåâäEÄÁÃÿ¤¡œÿ™œ†ÿ™iÿv‰Dÿuw+ÿhjÿefÿcdÿ_bÿ`cÿ]_ÿ^`ÿ]_ÿ]_ÿ\^ÿ\^ÿ\_ÿ\_ÿ]`ÿ]`ÿ_`ÿabÿai"ÿis0ÿ}ŠRÿ™¤|ÿ´½¨ÿÙÝØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìðñæÕÌÿ滪ÿî«ÿý¡~ÿÿ”`ÿÿZÿûˆUÿý‡TÿþˆUÿÿ‡Uÿÿ†Tÿÿ†Tÿÿ…Sÿÿ†TÿÿˆVÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿô–Tÿö˜Vÿþ˜cÿÿxÿÿªÿñ³£ÿ¾ •ÿª©¥ÿÂÐÎÿÜêècÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñíØÖÖ~¶´´ÿ ž–ÿ—›‚ÿˆ—]ÿv†?ÿrv*ÿeiÿcgÿaeÿ_cÿacÿ]aÿ]aÿ\`ÿ\`ÿ[_ÿ[_ÿ\_ÿ\_ÿ]aÿ]aÿ]^ÿ`_ÿci"ÿlu2ÿƒUÿ ¨ƒÿ¼Ã®ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïóô éØÏÿ转ÿ﬑ÿÿ£€ÿÿ•aÿÿŽ[ÿûˆUÿý‡TÿþˆUÿÿ†Tÿÿ†Tÿÿ…Sÿÿ…Sÿÿ†Tÿÿ‡Uÿÿ‰Wÿÿ‹XÿÿŒYÿÿŒYÿÿŒYÿõ—Uÿö˜Vÿý—bÿÿšuÿÿ§Œÿò´¤ÿ¼ž“ÿ¨§£ÿ¶ÄÂÿÔâà€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéå;ÊÈÈÿ©§§ÿš˜ÿ”˜ÿƒ’Xÿr‚;ÿqu)ÿeiÿdhÿbfÿ`dÿacÿ]aÿ^bÿ]aÿ]aÿ\`ÿ\`ÿ]`ÿ]`ÿ]aÿ]aÿ^_ÿbaÿfl%ÿqz7ÿˆ”Zÿ¦®‰ÿÃʵÿèèè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï÷ö èãÚnàÅ·ÿá­ ÿí¦‹ÿ÷›fÿûŽ[ÿûˆVÿþ‡Vÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰Tÿÿ‹WÿÿŒXÿÿŒXÿÿXÿýZÿÿ”`ÿý”cÿü“`ÿÿ£sÿÿª|ÿð±‹ÿ㻞ÿ´¦ÿ²³©ÿÑÎÐïìõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÝÝnÀÃÁÿ˜–•ÿœŸ…ÿ›¡rÿƒAÿy0ÿsr"ÿnmÿffÿeeÿceÿbdÿ_cÿ_cÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿa_ÿa_ÿ]aÿ[dÿai-ÿpxIÿŠoÿ¬±œÿÑÕÉÿìíé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîéàOèÍ¿ÿæ²¥ÿð©Žÿùhÿý]ÿü‰WÿÿˆWÿÿ†Tÿÿ†Tÿù‰TÿøˆSÿö‰Sÿö‰Sÿý‰TÿÿŠVÿÿŒXÿÿŒXÿÿXÿýZÿÿ’^ÿþ•dÿý”aÿÿŸoÿÿ¨zÿñ²Œÿå½ ÿµ§‘ÿš›‘ÿÅÂÄÿäáêOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéëë(ÌÎΚ®±¯ÿ™—–ÿ †ÿ™Ÿpÿ‹?ÿw}.ÿsr"ÿmlÿggÿffÿdfÿbdÿ_cÿ^bÿ]`ÿ]`ÿ]`ÿ]`ÿ^_ÿ^_ÿ`^ÿa_ÿ[_ÿ\eÿem1ÿu}Nÿ‘–vÿµº¥ÿÙÝщñòî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôñé(í×Ëÿß¼®ÿí¬—ÿú¡nÿÿ’bÿü‹YÿÿˆWÿÿ†Sÿÿ†Sÿþ‰Rÿú‰Qÿø‰Qÿø‰QÿþˆTÿÿŠVÿÿŒXÿÿŒXÿþŽYÿüZÿú’]ÿÿ—bÿû•`ÿÿœkÿü¤uÿù²ŒÿﾞÿË«”ÿŸƒÿ¸´³ÿÓÖÛƒîñö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßäãY¸½¼ÿšŸ–ÿ› ‹ÿ¤yÿ•aÿ€Š7ÿtz(ÿpq!ÿklÿhhÿggÿdfÿbdÿ^bÿ^bÿ]`ÿ]`ÿ^aÿ]`ÿ^_ÿ^_ÿ^_ÿ^_ÿY`ÿ^i ÿjr6ÿ{‚Wÿ˜ ÿÁĵÿãæÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú÷ï õßÓƒæõÿð¯šÿþ¥rÿÿ•eÿýŒZÿÿ‰Xÿÿ†Sÿÿ†Sÿþ‰Rÿú‰QÿùŠRÿø‰QÿþˆTÿÿŠVÿÿ‹WÿÿŒXÿþŽYÿý‘[ÿû“^ÿþ–aÿü–aÿÿ›jÿú¢sÿõ®ˆÿî½ÿÖ¶Ÿÿ­‘ÿ¤ ŸÿÁÄÉÿæéî2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÔÙØ€ª¯®ÿ’‰ÿž£Žÿ™ uÿ‹“Wÿ{…2ÿqw%ÿop ÿklÿhhÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ^aÿ_`ÿ^_ÿ]^ÿ]^ÿ[bÿbm$ÿpx<ÿˆ]ÿ ¨‰ÿÌÏÀÿëîå;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñåßYÛÈÀÿⱡÿù¨{ÿÿ–jÿù^ÿÿˆWÿÿ‡Qÿÿ‡Qÿÿ‰Qÿü‰PÿûŠRÿú‰Qÿý‡SÿÿŠVÿÿŒWÿÿŒWÿüYÿû‘[ÿü•^ÿý–_ÿü—`ÿÿiÿþ¢oÿø¨ÿþ·•ÿõ¿¦ÿÑ°¡ÿšŠ„ÿ¨­¬ÿÓÚ݃åîñ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîñö Ýàåc½ÁÂÿ›¢›ÿŒ—}ÿ¤¬ƒÿ—¢dÿˆCÿy‚'ÿsxÿoqÿkkÿiiÿhhÿegÿbdÿ^bÿ]aÿ]`ÿ]`ÿ^aÿ]`ÿ\_ÿ\_ÿ\_ÿ\_ÿ[dÿdo)ÿr{Bÿ†Žeÿª±–ÿÖ×Íšòóï ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ëå;ãÐÈÿè·§ÿþ­€ÿÿšnÿû`ÿÿ‰Xÿÿ‡Qÿÿ‡Qÿÿ‰QÿûˆOÿûŠRÿú‰Qÿý‡Sÿÿ‰UÿÿŒWÿÿŒWÿüYÿû‘[ÿý–_ÿü•^ÿý˜aÿÿžjÿþ¢oÿô¤{ÿù²ÿø©ÿÛº«ÿ˜ˆ‚ÿ•š™ÿ¼ÃÆÿØáäyïøû ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæéî2ÏÒ×ÿ ¤¥ÿŽ•Žÿ‘œ‚ÿ¡©€ÿ’_ÿƒ‹>ÿu~#ÿqvÿoqÿllÿiiÿhhÿdfÿacÿ]aÿ]aÿ]`ÿ]`ÿ]`ÿ]`ÿ\_ÿ\_ÿ\_ÿ]`ÿ^gÿfq+ÿxHÿ‘™pÿ¸¿¤ÿâãÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôóï àÚÕ€Û¸ÿö²ÿþŸwÿõ’fÿýŠ]ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿþ•\ÿÿ–]ÿþ›aÿýgÿÿ¡lÿÿ£vÿÿ«†ÿÿ»Ÿÿñ¿©ÿ¾¡“ÿ”“‰ÿ¤©§ÿÇÒÐÿâëîEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕØà€¶¹ÁÿŽ”“ÿŒ”ƒÿŸ«ÿ¨jÿŒšHÿŠ0ÿx|ÿswÿoqÿllÿgjÿfiÿdfÿacÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ\^ÿZ^ÿ[_ÿ\`ÿ^bÿ_j$ÿgt6ÿˆUÿ §„ÿÇϸÿëíç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæàÛnâÉ¿ÿú¶‘ÿÿ¢zÿ÷”hÿþ‹^ÿÿ‡TÿÿˆPÿÿŠOÿÿˆMÿýŠQÿüˆSÿý‡Sÿÿ‰UÿÿŒWÿüŒWÿùWÿû’Yÿý”[ÿÿ—^ÿÿœbÿüœfÿÿ¡lÿÿ¥xÿÿ¨ƒÿý³—ÿóÁ«ÿÙ¼®ÿ‘†ÿ”’ÿ·ÂÀÿÓÜ߃ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçìë2ÄÇÏÊž¡©ÿŒ’‘ÿ˜‡ÿ§³‰ÿ• bÿ„’@ÿ~‡-ÿw{ÿtxÿoqÿllÿhkÿfiÿceÿ`bÿ]aÿ^bÿ]`ÿ]`ÿ\^ÿ[]ÿZ^ÿ[_ÿ]aÿ_cÿcn(ÿly;ÿ‡]ÿ«²ÿÒÚÃÜòôî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëîìÙÕÐÿ黣ÿ÷©…ÿî™sÿù‘fÿÿŠWÿÿˆQÿÿ‰Nÿÿ‰NÿýŠQÿüˆSÿý‡Tÿÿ‰VÿÿŒWÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿŸoÿÿ§zÿÿ®‰ÿÿ¿žÿù˳ÿ¹¦‘ÿ“‚ÿ¦© ÿÊÊÊ¥ìåê;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëðîÒ×Õƒ³¸·ÿ€…„ÿ’™Šÿ«±Žÿ£¬sÿŽ–Iÿ…Ž3ÿ~ƒ(ÿvwÿvwÿnr ÿknÿhkÿehÿcfÿbcÿ`aÿ__ÿ\^ÿ^`ÿ[_ÿ[_ÿ\_ÿZ]ÿZ_ÿaf!ÿ`l0ÿv‚RÿŒ—oÿ¶½¢ÿáèÙyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïòð àÜ×~îÀ¨ÿû­‰ÿòwÿû“hÿÿŒYÿÿˆQÿÿ‰NÿÿˆMÿýŠQÿüˆSÿý‡Tÿÿ‰Vÿÿ‹VÿüŒWÿûVÿý’Xÿþ•\ÿþ•\ÿûš`ÿÿŸeÿÿ hÿÿžnÿÿ¦yÿÿ­ˆÿú·–ÿöÈ°ÿ×įÿœ–‹ÿŠ„ÿ­­­ÿÕÎÓöïô ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðñï Üáßc¼Á¿ÿ‘–•ÿ’‘ÿ›¢“ÿ¦¬‰ÿ™¢iÿˆCÿŠ/ÿ|&ÿvwÿuvÿnr ÿknÿgjÿdgÿcfÿabÿ`aÿ^^ÿ]_ÿ^`ÿ[_ÿZ^ÿ[^ÿZ]ÿZ_ÿch#ÿht8ÿ~ŠZÿš¥}ÿÇγÿìóä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãèçEåɸÿæµ›ÿ棄ÿî™qÿû_ÿü‹Sÿý‰NÿüˆMÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿŒUÿýSÿü’Uÿÿ“]ÿü•^ÿþ™bÿÿžfÿÿ hÿþ¡iÿÿ¦qÿÿ­ÿý±‡ÿÿžÿÿѲÿέ™ÿ›‹{ÿ‘ÿ¼±³ÿàÚÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàààOÊÏÍÿ™¡–ÿxpÿœ£ˆÿ®µŠÿ¦ªoÿ”™Nÿ†Œ5ÿ€†'ÿ}~ ÿwxÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ^^ÿ]_ÿ]_ÿZ]ÿZ]ÿY^ÿX]ÿ\dÿfn(ÿoyJÿ†Žoÿ©²—ÿ×ÝÊ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìñððÔÃÜﾤÿíª‹ÿòuÿý‘aÿýŒTÿÿ‹PÿþŠOÿþ‹RÿüˆSÿý†UÿÿˆWÿÿŠWÿÿ‹TÿýSÿü’Uÿþ’\ÿü•^ÿþ™bÿÿžfÿÿŸgÿþ¡iÿÿ¥pÿÿª|ÿú®„ÿú¼˜ÿóŦÿçƲÿµ¥•ÿ}ÿ¤™›ÿ¼½ÿáááOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáàäOÒÒÒƒ¬±¯ÿyvÿ†wÿ¦­’ÿ¯¶‹ÿ›Ÿdÿ‰ŽCÿ‚ˆ1ÿ}ƒ$ÿ{|ÿxyÿtsÿmp ÿjmÿfiÿdgÿbeÿabÿ`aÿ__ÿ\^ÿ]_ÿZ]ÿ[^ÿZ_ÿZ_ÿ`h"ÿmu/ÿx‚Sÿ“›|ÿ»Ä©ÿåëØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæÝÔ€äƵÿã°–ÿè ~ÿò“gÿùWÿÿQÿþŒPÿþ‹RÿüˆSÿý†UÿÿˆWÿÿ‰Vÿÿ‹TÿÿQÿþ‘Sÿþ\ÿþ”_ÿÿ˜aÿÿœeÿûŸdÿú¢fÿù¨kÿû¬sÿÿ±|ÿÿ¹‹ÿÿ½—ÿÿαÿ廨ÿ§Šÿ“ˆ„ÿ¢žÿÇÇǽççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðîíØ×Ù~·¶¸ÿ‡‰ƒÿ|‚oÿ¢¬‚ÿ¶½„ÿ«µhÿ—DÿŠŽ.ÿˆ‰)ÿ€€"ÿ{{ÿvzÿrtÿlqÿjmÿfjÿdgÿcfÿbcÿ`aÿ__ÿ\^ÿ\^ÿZ]ÿ[^ÿY`ÿY`ÿaj'ÿpy6ÿ…fÿ¡§”ÿÍÕÄÊðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñèßYïÑÀì븞ÿ暈ÿö—kÿûYÿÿQÿý‹Oÿþ‹RÿüˆSÿý†Uÿþ‡Vÿÿ‰VÿÿŠSÿÿŽPÿþ‘Sÿþ\ÿý“^ÿþ—`ÿþšcÿúžcÿú¢fÿù¨kÿùªqÿÿ±|ÿý°‚ÿÿ¼–ÿÿŨÿôÊ·ÿα¨ÿ’‡ƒÿ‚~}ÿ¨¨¨ÿÎÎÎêêêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÔÓƒ¾½¿ÿŽÿuwqÿ£ÿ·Á—ÿ¬³zÿ›¥XÿŽ”;ÿ‡‹+ÿ‡ˆ(ÿ!ÿ{{ÿvzÿrtÿkpÿilÿeiÿcfÿbeÿabÿ`aÿ__ÿ]_ÿ\^ÿZ]ÿ\_ÿZaÿ[bÿen+ÿx>ÿŒ’sÿµ»¨ÿÞæÕ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìßщìıÿò²“ÿø¡uÿü”_ÿûUÿûŠQÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿþ˜cÿùbÿö£fÿôªjÿ÷­mÿÿ±vÿþ­zÿÿ¶Œÿÿº›ÿÿ˵ÿ÷ÐÂÿ±¨žÿ„}ÿŠŠŠÿ§§§ÿÌÌÌšâââEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíííÜÝÔ€´µ¬ÿ’’’ÿyyyÿ‰‚ÿ·½žÿ´À†ÿœ¨Vÿ’ 6ÿ”+ÿŠ‹#ÿ…†ÿ}~ÿ{{ÿvzÿqsÿjoÿgjÿdhÿbeÿadÿ`aÿ_`ÿ^^ÿ^_ÿ]^ÿ[^ÿ]`ÿ\c ÿah%ÿox5ÿ…ŽKÿ¡¥’ÿÌÒǽêòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöéÛnöλÿü¼ÿÿ¨|ÿÿ™dÿý‘Wÿü‹Rÿú‹Sÿü‡Tÿü†Uÿÿ‡VÿÿˆVÿÿŠSÿÿPÿÿRÿýŽ\ÿü‘^ÿÿ•`ÿý—bÿøœaÿö£fÿôªjÿ÷­mÿý¯tÿÿ²ÿÿ°†ÿÿ¶—ÿû¿©ÿöÏÁÿØÏÅÿ¥¢žÿtttÿ†††ÿ­­­ÿËËË¥ççç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿééé(ÙÙÙy¸¹°ÿž•ÿrrrÿÿ¦ªŸÿ°¶—ÿ£¯uÿ” NÿŠ˜.ÿ’)ÿ‰Š"ÿ‚ÿ{|ÿ{{ÿuyÿprÿinÿfiÿcgÿadÿ`cÿ_`ÿ^_ÿ]]ÿ^_ÿ]^ÿ[^ÿ^aÿ`g$ÿgn+ÿy‚?ÿ‘šWÿ¸¼©ÿàæÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìÿÿÞñöYíÙÔÿðijÿô®‘ÿú›sÿõ’`ÿûYÿû‹VÿÿˆTÿÿ‡Uÿÿ†Tÿÿ†RÿþˆTÿúUÿøSÿþ[ÿÿ]ÿÿ’_ÿþ•bÿüšdÿüŸhÿý¥iÿü©lÿÿ¯rÿý°wÿü´~ÿþ¸‰ÿÿ¿–ÿÿƤÿÿήÿÿлÿ©š‘ÿ‡zxÿ“‡…ÿ²ª«ÿÐÊË¥áÝâcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêæì2ÓÏÛ¿»Çÿ•”˜ÿtwnÿƒjÿ­´‡ÿ¿Ç†ÿ®¹cÿ¨Bÿ—8ÿŽ’+ÿˆŒ%ÿ‚„$ÿ€$ÿy{!ÿuv ÿorÿiqÿbnÿ`lÿ`fÿ``ÿ`] ÿc[ÿc]ÿc^ÿ\] ÿ`fÿYbÿVdÿ_m+ÿdr<ÿu…Uÿ˜¡†ÿÏÏÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëþÿåøý;ùåàOúνÿý·šÿÿ¥}ÿþ›iÿÿ‘]ÿüŒWÿÿˆTÿÿ‡Uÿÿ‡Uÿÿ‡Sÿÿ‰UÿúUÿøSÿýŒZÿÿŽ\ÿþ‘^ÿý”aÿû™cÿúfÿü¤hÿû¨kÿü¬oÿú­tÿù±{ÿûµ†ÿúº‘ÿÿÀžÿÿȨÿÿ˶ÿѹÿ¥˜–ÿymkÿ‰‚ÿ«¥¦ÿÏËÐ¥ÜÛßnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêçé2ØÔÚ€µ±½ÿ•‘ÿlkoÿ‚yÿ¥©ÿ¹À“ÿ±¹xÿ «Uÿ—¢<ÿ’˜3ÿ‹(ÿ†Š#ÿ€‚"ÿ}~"ÿxz ÿtuÿnqÿhpÿbnÿ`lÿ_eÿ``ÿ`] ÿc[ÿc]ÿb]ÿ`aÿ_eÿYbÿZhÿes1ÿkyCÿƒ“cÿ¯¸ÿÞÞÞYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÜЉîÄ­ÿð°‘ÿïžxÿøeÿþŒ]ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿþŒWÿüŠUÿþ‹XÿÿZÿþ\ÿý“^ÿü–aÿüšdÿüŸgÿý¤kÿþªpÿþ­sÿþ°{ÿû´‚ÿú·Šÿú¾”ÿÿÆžÿÿɬÿý×ÅÿÛ¿´ÿ«†ÿƒpiÿ‚~ÿ¤ Ÿÿ»¿Àÿ×ÛÜ~ëðñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïíóáàâOÊËǽª­¤ÿ‡Žÿr{fÿ~‚eÿ¦ªÿ¿Ç’ÿ¸Â|ÿ£­Zÿ˜¤@ÿ’œ1ÿ‹‘&ÿ‰#ÿ„‡ ÿ~€ ÿ|{#ÿux"ÿqs!ÿkoÿimÿbjÿaiÿ_dÿ`^ÿa\ÿa\ÿ`]ÿ_]ÿ_bÿ]cÿXbÿal&ÿnyAÿx‚Wÿ™¤„ÿÌÒ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëßYýÓ¼ÿúº›ÿõ¤~ÿý•jÿÿŽ_ÿþ‰VÿþˆTÿÿ‰Uÿý‰TÿþŠUÿý‹VÿúˆSÿýŠWÿÿŒYÿý[ÿü’]ÿú”_ÿû™cÿûžfÿû¢iÿý©oÿþ­sÿþ°{ÿù²€ÿ÷´‡ÿöºÿþÁ™ÿüħÿò̺ÿìÐÅÿæËÁÿ®›”ÿ„yuÿwsrÿ•™šÿ®²³ÿÉÎÏ°Üáâcéîí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæãìEÕÓÙƒÁÀÂÿ¡¢žÿ‚yÿqxkÿw€kÿ°´—ÿ¼À—ÿµ½ˆÿ£­gÿ˜¢Oÿ‘9ÿ‹•*ÿˆŽ#ÿ‡‹!ÿƒ†ÿ}ÿ{z"ÿtw!ÿpr ÿimÿgkÿaiÿ`hÿ^cÿ`^ÿa\ÿ`[ÿ_\ÿ^\ÿ_bÿ^dÿ^hÿit.ÿz…MÿŒ–kÿ²½ÿãéÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéåÚnçɶÿè°—ÿô£‚ÿø’hÿú‹[ÿúˆSÿû‰TÿúˆSÿû‰TÿÿˆVÿÿ†Tÿÿ‹TÿÿŒUÿÿZÿþ‘[ÿý“^ÿü–aÿÿ›eÿþžhÿÿ¤lÿÿ©pÿÿ®uÿý¯zÿø²}ÿù¶…ÿû¾Œÿþ˜ÿûàÿÿϳÿÿÖ¾ÿðϼÿ®™Šÿƒxpÿxtoÿ‡Šˆÿ¤«¨ÿÁÆÇÿ×ÜÝ~ãåæEîðñ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñöíèìç2ÛÜànÏÐÔº¹½ÿ˜—›ÿvwmÿko\ÿ†Œuÿ¬´ŒÿÅ͆ÿ¿Èqÿ­¸\ÿŸ©Eÿ—¢4ÿ‘™'ÿ‹’ÿ‰ÿ‡Œÿ‚„ ÿ}~ ÿzy#ÿsv!ÿnoÿflÿdhÿaeÿ`cÿ`aÿ_^ÿ_]ÿ^\ÿ]^ÿ]^ÿ[_ÿ^gÿbl)ÿlw?ÿ„Ždÿ¢«‘ÿËÒÅÊÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöòç2õ×ÄÊô¼£ÿý¬‹ÿÿšpÿÿ`ÿý‹VÿüŠUÿû‰Tÿû‰TÿÿˆVÿÿ†TÿþŠSÿÿŒUÿÿŽYÿýZÿü’]ÿú”_ÿý™cÿüœfÿÿ£kÿÿ§nÿý¬sÿü®yÿø²}ÿøµ„ÿù¼Šÿú¾”ÿùÁžÿûÉ­ÿ÷˳ÿôÓÀÿäÏÀÿ´©¡ÿ~zuÿgjhÿx|ÿ•š›ÿ²·¸ÿÈÊËÿÖØÙ~éæè2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöúï ðôé(âçÞYÓ×Òÿ¹º¾ÿ¦§«ÿŠ‰ÿqptÿstjÿŒ}ÿ«±šÿÁÉ¡ÿ¶¾wÿ®·`ÿŸªNÿ•Ÿ;ÿš,ÿ—%ÿ‹’ÿ†ÿ…Šÿ€‚ÿ{|ÿxw!ÿqtÿmnÿdjÿbfÿ`dÿ_bÿ_`ÿ_^ÿ_]ÿ_]ÿ^_ÿ^_ÿ\`ÿaj!ÿhr/ÿu€Hÿ•Ÿuÿ¼Å«ÿáèÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèéàOå̼ÿ趟ÿð¦‚ÿû˜lÿüZÿÿXÿÿŠSÿÿŠSÿÿ‰VÿþˆUÿþŠQÿÿŒSÿÿŒUÿþŽZÿýŽ\ÿü‘^ÿÿ•bÿÿ™eÿÿ iÿÿ¤lÿÿ©pÿÿ®tÿþ±xÿÿ¶|ÿþ¼ÿþ¾‡ÿÿÂÿÿÆšÿÿͤÿ÷ʨÿÿãÉÿîÓ¿ÿ®ÿ‘‚yÿsjaÿuojÿ‰…€ÿ¥£¢ÿº»¹ÿÍÌΚÞßãYëìðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîòíáçâOÔÚÕÿÀÄÅÿ«¯°ÿ•—˜ÿ{xzÿgd_ÿzxfÿ¨©‡ÿÉËÿÃÇ“ÿ³ºqÿ±»Qÿ§­@ÿ¤5ÿ•ž*ÿ—"ÿŽ–!ÿŽ“ ÿ„‡ÿ‚†ÿ}~ÿuwÿsr!ÿlpÿhkÿciÿaeÿbcÿ``ÿ__ÿ^^ÿ\_ÿ]`ÿ[bÿ[bÿ]eÿdm.ÿp{Cÿˆ‘iÿ¯¶›ÿÖÜщïòö ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøßÏöÄ­ÿ÷­‰ÿÿqÿÿ”^ÿÿZÿÿŒUÿÿŠSÿÿŠWÿÿ‰Vÿý‰Pÿÿ‹Rÿÿ‹TÿýYÿü[ÿû]ÿþ“`ÿý—cÿÿfÿÿ hÿþ¥lÿþªpÿü¯vÿý´zÿú¸}ÿù¹‚ÿü½Šÿú½‘ÿýÇžÿýЮÿïÊ°ÿ÷ÜÈÿîÚÉÿÏÀ·ÿ§ž•ÿ|vqÿgc^ÿrpoÿ†‡…ÿ Ÿ¡ÿ¼½ÁÿÏÐÔãâæEêéí(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîïíáåàOÓ×Òƒ¿ÅÀÿ«±¬ÿ“”ÿuyzÿdfgÿgdfÿ}zuÿ©§•ÿÇȦÿÆÈšÿ²¶‚ÿª±hÿ£­Cÿš 3ÿ˜Ÿ0ÿ— ,ÿ• ÿˆÿ‹ÿ†‰ÿ€„ÿ{|ÿrtÿpoÿjnÿfiÿagÿ`dÿabÿ``ÿ^^ÿ^^ÿ\_ÿ^aÿ[bÿ\cÿfn'ÿmv7ÿ~‰QÿŸ¨€ÿÊѶÿìòç2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðïå;ðÚÈÿë¿¢ÿﮈÿõšmÿý]ÿÿYÿÿYÿýYÿüŒXÿü‰Pÿþ‹RÿüUÿýYÿûŒZÿü[ÿý]ÿÿ’_ÿÿ™cÿÿfÿÿ¢hÿÿ§lÿÿ¬oÿÿ°sÿÿ¶zÿÿº~ÿü½€ÿýÁ†ÿýÃÿþŘÿüÉ¡ÿÿϯÿÿؽÿÿÝÊÿùØÅÿÅ«›ÿˆyÿ…wkÿtkbÿvsnÿ‘‹ÿ¡¤¢ÿº¹½ÿÈÇ˽×ØÜ~âãçEæéí2ìïóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçæê2ÔÝЉÎ×Ê¥¿ÅÀÿ¤§«ÿ”•Ÿÿ‚~‰ÿfclÿnhmÿxvlÿ™˜~ÿ¿¿‘ÿÎÏ‘ÿÆÊxÿ¹¾[ÿ¯·Eÿ­±@ÿ ¥2ÿšŸ,ÿ”™&ÿ‘–#ÿ“"ÿ‹Ž!ÿ†‡ÿ„„ ÿ}}ÿzyÿrsÿnmÿhlÿgjÿciÿ_cÿcdÿ_`ÿ_cÿ^bÿ\cÿZaÿW`ÿak)ÿdo1ÿu€Nÿ‘šrÿ¿Ä©ÿåëÚnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø÷íÿëÙyüгÿú¹“ÿû sÿÿ–cÿÿ’^ÿÿŽZÿþŽZÿÿ\ÿÿŒSÿþ‹RÿùŠRÿù‰UÿùŠXÿü[ÿý]ÿÿ’_ÿÿ—aÿÿ›dÿÿ fÿÿ¥jÿþ«nÿÿ¯rÿþµyÿþ¸|ÿý¾ÿýÁ†ÿýÃÿüÖÿ÷Äœÿ÷Ʀÿù̱ÿ÷ϼÿûÚÇÿòØÈÿéÔÅÿÅ·«ÿŒƒzÿjgbÿlpjÿx{yÿŒÿ£¢¦ÿ¸¹½ÿÂÃÇÿÊÍÑÿÙÜàyâçèEãèéEêïðíòóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëêîæåé;ßÞâYÒÑÕ‰ÆÅÉÊÀɼÿ£¬Ÿÿ•›–ÿƒ†Šÿijtÿ_[fÿifoÿŒ†‹ÿ¾¼²ÿÅĪÿÉÉ›ÿÂÃ…ÿ¶ºhÿ¬±Nÿ£«9ÿŸ£2ÿ› -ÿ–›(ÿ‘–#ÿŽ“ ÿ‹ÿ†‰ÿ‚ƒÿ€€ÿxxÿutÿopÿnmÿimÿfiÿ`fÿ]aÿ^_ÿ^_ÿ_cÿ\`ÿ[bÿ^eÿ]fÿeo-ÿq|>ÿ‰”bÿ­¶ŽÿÚßÄÊõûêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïæÒƒìÈ°ÿæ«‹ÿòœxÿù•kÿø^ÿ÷Zÿÿ“_ÿÿ’\ÿûŽXÿö‰Uÿõ‡Wÿ÷‰Yÿû]ÿý]ÿþ‘^ÿÿ–]ÿÿ™`ÿÿbÿÿ¢fÿÿ¦kÿÿ«oÿÿ°vÿÿµzÿþ»~ÿþ¿‚ÿÿˆÿÿÄŽÿÿÓÿÿÆ™ÿÿÈ ÿÿ̧ÿÿÑ­ÿÿÕ´ÿÿÞÂÿýÞÅÿâʶÿ½­œÿŒ†sÿaXNÿe\Yÿypmÿ‰†ÿ¡š—ÿª¦¥ÿ´µ³ÿÁÄÂÿÊÍËÿÎÓÒÿÒ×ÖƒÙÞÝyÞãâYãçèEæêë2êîïìðñðïëðïëìíëëìêíííïïï éëì(ãåæEàâãOÚÜÝnÖÖÖ~ÐÐЉÊËÉÿ½¾¼ÿ®­©ÿ Ÿ›ÿ‹‹‘ÿssyÿdfgÿWUTÿa_Wÿ™™ÿÄÅžÿÇÊ“ÿÏÔ‰ÿÉÐuÿ¿Æ]ÿ´¼Gÿ¬³:ÿª®1ÿ¥¨*ÿ £%ÿ˜œ+ÿ”—*ÿ“&ÿŽ&ÿ†ˆ$ÿ‚"ÿ}|!ÿ|z"ÿvw!ÿpoÿikÿggÿdgÿbeÿ_dÿ`dÿ]^ÿ`aÿ`dÿX_ÿXaÿ[f ÿ_h)ÿgp=ÿz„Yÿ ¦‡ÿÉϸÿñòè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøä;ÿÜÄÊù¾žÿþ¨„ÿÿ›qÿû’aÿù‘\ÿÿ”`ÿÿ—aÿÿ”^ÿûŽZÿøŠZÿøŠZÿúŒ\ÿü\ÿý]ÿÿ”[ÿÿ–]ÿÿš_ÿÿžbÿü¢gÿþ¨lÿÿ­sÿý±vÿú·zÿú»~ÿþ¾„ÿÿÁ‹ÿÿÁ‘ÿÿÄ—ÿÿÆžÿÿɤÿÿÕ±ÿþÑ°ÿøѵÿøÙÀÿùáÍÿîÞÍÿÇÁ®ÿž•‹ÿ›’ÿtkhÿWPMÿ_XUÿtpoÿ‚€ÿ“‘ÿ¡¤¢ÿ¦«ªÿ¬±°ÿµº¹ÿ¾ÃÂÿÅÉÊÿÉÍÎÿÍÑÒÿÏÓÔÿÔÓÏÿÕÔÐÿÓÔÒÿÒÓÑÿÓÓÓÿÓÓÓÿÉËÌÿÀÂÃÿ¾ÀÁÿ³µ¶ÿ©©©ÿ¢¢¢ÿ—˜–ÿ†‡…ÿvuqÿkjfÿTTZÿZZ`ÿwyzÿ“‘ÿ£¡™ÿÀÀ¨ÿÎϨÿÁÄÿ¶»pÿ³º_ÿ®µLÿ¨°;ÿ£ª1ÿ£§*ÿ¡¤&ÿž¡#ÿ”˜'ÿ‘”'ÿŽ‘$ÿ‹Œ$ÿ„†"ÿ~ÿzyÿzx ÿtuÿonÿhjÿggÿcfÿ_bÿ^cÿbfÿcdÿbcÿbfÿ[bÿ[dÿ_j$ÿir3ÿy‚Oÿ“rÿ½Ã¤ÿáçЉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõðç2ëÖǽ廤ÿ榇ÿî™qÿý“dÿû‘bÿÿ˜gÿÿ—fÿþ”eÿúaÿù]ÿ÷‹[ÿùŒXÿùŒXÿþ‘Yÿÿ’Zÿÿ—\ÿþš_ÿÿžfÿÿ¡lÿÿ¦sÿý©uÿÿ³zÿÿ¶|ÿÿºÿÿ½„ÿÿ¿ˆÿÿŠÿÿÆŽÿÿÈ”ÿüÆ‘ÿþË™ÿÿÑ¡ÿüЧÿùÓ°ÿÿÜÀÿÿæÎÿÿèÓÿåË»ÿ´œÿ’znÿ‹xkÿ‡wjÿsg]ÿj`Vÿnf_ÿrpfÿzvqÿ†ƒ~ÿ’Žÿš–•ÿžš™ÿ œ›ÿ¡œÿ¥£¢ÿ§¥¤ÿ¥¦¤ÿ¡¢ ÿžŸÿ›œšÿ“—’ÿŒ‹ÿƒ‡ÿ{vÿswkÿkq`ÿciVÿ`fSÿfnWÿsv`ÿzzhÿ‰wÿ®¯ÿÑÕ¡ÿØÞ—ÿÊÓxÿÁËaÿ¾ÉOÿ´Â>ÿ±¼8ÿ«³0ÿ¤¬)ÿŸ¥(ÿ› 'ÿ˜›'ÿ—™(ÿŽ”%ÿ‹%ÿˆ‹$ÿ…†$ÿ€"ÿyyÿtuÿsr!ÿkmÿjjÿgjÿghÿdfÿ`aÿ``ÿccÿgi#ÿacÿ`dÿ]eÿ_h%ÿdm5ÿu|Oÿ‘˜wÿ¸½¨ÿÞßÖ~ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÛnúйÿö¶—ÿø£{ÿÿ—hÿúaÿÿ–eÿÿ—fÿÿ—hÿÿ•fÿý‘aÿù]ÿùŒXÿø‹WÿýXÿþ‘Yÿü”Yÿû—\ÿü›cÿüžiÿû¢oÿù¥qÿü¯vÿü³yÿþ·~ÿýºÿþ½†ÿþÁ‰ÿÿÅÿÿÇ“ÿÿÉ”ÿþË™ÿýÏŸÿüЧÿöЭÿôϳÿôÒºÿõÖÁÿ÷ÝÍÿõÝÑÿöÞÒÿæÓÆÿ¿¯¢ÿŽ‚xÿpf\ÿf^Wÿig]ÿkgbÿmjeÿokjÿqmlÿuqpÿyutÿ|xwÿtrqÿusrÿstrÿrsqÿpqoÿpqoÿptoÿqupÿhlfÿek`ÿ`dXÿY_NÿZ`Mÿoubÿ–ž‡ÿº½§ÿÍÍ»ÿÓϽÿÄÅ¥ÿ¼ÀŒÿ¼Â{ÿ·Àeÿ°ºPÿ§²8ÿ¥³/ÿ¢­)ÿž¦#ÿœ¤!ÿ£&ÿ› 'ÿ—š&ÿ“•$ÿ‹‘"ÿˆŒ"ÿ„‡ ÿ‚ƒ!ÿ}~ ÿxxÿrsÿqpÿkmÿiiÿcfÿabÿacÿcdÿhh"ÿkk%ÿjl&ÿacÿaeÿai"ÿen+ÿmv>ÿ†`ÿ«²‘ÿØÝÈ°õöíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíçÚnòζÿô³”ÿÿsÿÿ”jÿú“fÿü•hÿÿ˜kÿÿ™lÿÿ™iÿþ•bÿü’]ÿýXÿý‘Wÿý‘Wÿý’Xÿû”]ÿü˜bÿü›iÿûoÿú qÿþ¨rÿþ¬uÿþ±yÿÿ¶~ÿü½ÿýÁ…ÿúLjÿýÊ‹ÿüÌŒÿýÍÿüÌ’ÿÿÍ›ÿÿѦÿÿϬÿÿбÿÿÔ¸ÿùÓ»ÿüÙÅÿÿÞÇÿùÙÆÿîÓ¿ÿæͽÿß˺ÿØǺÿɹ¬ÿº®¤ÿ¥›‘ÿŽ‚|ÿxngÿk_]ÿeZVÿcWWÿ\ZZÿZXXÿWWWÿZZZÿ[\Xÿ\]Yÿ`d^ÿgmbÿ†wÿ‘š†ÿª³™ÿ·Á£ÿ¸Ã¢ÿ·ÄžÿºÈŸÿÃÍ¢ÿÃЀÿÈÔpÿ½Ëaÿ½ÊWÿ¸ÆHÿ­¹7ÿ­µ2ÿ«°-ÿ©«0ÿ¤¤.ÿ Ÿ/ÿ Ÿ/ÿœ¡.ÿ—œ)ÿŽ™ÿŠ•ÿˆÿ„‰ ÿ}„ÿ{€ÿy| ÿuwÿorÿnoÿilÿfhÿ`bÿ]^ÿcdÿnm)ÿsq0ÿsq0ÿfi$ÿadÿcg%ÿfn/ÿqy=ÿ‚Š[ÿ¤©‰ÿÍÒ½ÿìîè(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþøëÿâÊ¥ÿ£ÿÿ¨~ÿÿžtÿú“fÿü•hÿÿ˜kÿÿœoÿÿŸoÿÿjÿÿ™dÿÿ”\ÿý‘WÿüVÿü‘Wÿú“\ÿú–`ÿú™gÿúœnÿøžoÿú¤nÿú¨qÿû®vÿý³{ÿùº~ÿù½ÿõƒÿöÄÿúÊŠÿýÍÿüÌ’ÿýʘÿþË ÿþÈ¥ÿýǨÿþÌ°ÿõÏ·ÿóмÿõÓ¼ÿóÓÀÿõÚÆÿùàÐÿ÷ãÒÿðßÒÿêÚÍÿáÕËÿÖÌÂÿË¿¹ÿÁ·°ÿ»¯­ÿº¯«ÿ»¯¯ÿ³±±ÿ­««ÿ¨¨¨ÿªªªÿ¨©¥ÿ¥¦¢ÿ¥©£ÿ¬²§ÿ°·¨ÿµ¾ªÿ¾Ç­ÿÁË­ÿÁÌ«ÿ¼É£ÿµÃšÿ²¼‘ÿ¶Ãsÿ¸Ä`ÿ¬ºPÿ¬¹Fÿ¦´6ÿ¥±/ÿ­µ2ÿ¤©&ÿ£¥*ÿ¡¡+ÿž-ÿœ›+ÿ”™&ÿ”!ÿ‹–ÿŒ—ÿ…ÿ„ÿxÿv{ÿuxÿrtÿloÿjkÿbeÿbdÿacÿdeÿop(ÿ{z6ÿyw6ÿpn-ÿ`cÿadÿhl*ÿnv7ÿ‰Mÿž¦wÿÆË«ÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôìöÞØyÚÀ¹ÿТšÿý¢kÿøfÿò™gÿ÷œoÿýyÿÿ›xÿÿ›yÿÿœzÿÿ—nÿþ•iÿó“^ÿïXÿó’Xÿû—]ÿÿ˜_ÿÿ˜_ÿÿžjÿÿ£nÿÿ¨qÿÿ¬uÿÿ°xÿÿ³{ÿÿ¸}ÿÿ»ÿÿÀ…ÿÿÇÿÿÈ‹ÿÿÊ‘ÿüÍ•ÿûЗÿúÒ˜ÿûÓ™ÿþÒÿÿÒ¢ÿÿÖ¥ÿÿתÿÿÙ­ÿÿÙ²ÿÿÚ³ÿÿÚ·ÿÿÞ»ÿÿß¾ÿÿàÂÿÿáÊÿþãÏÿýã×ÿûäÜÿøäßÿóäáÿñâßÿòæÚÿïèÏÿêäÁÿåã³ÿàâ§ÿÛÝ—ÿÕ؈ÿÓÕ|ÿÑÔqÿÐÒhÿÈÌ[ÿÆÈPÿÁÄFÿº½?ÿ»½Aÿ¶¸<ÿ°²6ÿ¬®2ÿ©«0ÿ§©.ÿ¤§,ÿ¢¤-ÿ¢¦/ÿž¡.ÿ—›*ÿ”—*ÿ’”*ÿ‘*ÿ‹Œ%ÿ‡†$ÿ}€*ÿwz$ÿqvÿpuÿltÿiqÿenÿekÿ`eÿeg%ÿkl.ÿst6ÿ{|<ÿ|}=ÿor-ÿ_cÿMeÿZr$ÿav8ÿw†Zÿš¤†ÿÀĸÿåèæ;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõï ÷ÝÖ~ë½µÿÿ²{ÿÿ¦oÿô›iÿõšmÿýyÿÿž{ÿÿ{ÿÿ{ÿÿžuÿÿžrÿþžiÿ÷˜`ÿõ”Zÿø”Zÿÿ”[ÿÿ•\ÿþ›gÿüžiÿÿ¢kÿÿ¦oÿÿ«sÿÿ°xÿÿ·|ÿÿ»ÿÿ¾ƒÿÿÀ„ÿûćÿûÆÿ÷ÈÿöË’ÿöΔÿøЖÿúΙÿûÍÿùПÿûѤÿùÒ¦ÿûÒ«ÿúÓ¬ÿûÓ°ÿý×´ÿûØ·ÿûÙ»ÿúÚÃÿøÝÉÿøÞÒÿöß×ÿôàÛÿïàÝÿìÝÚÿëßÓÿåÞÅÿÝ×´ÿÖÔ¤ÿÎЕÿÈÊ„ÿÀÃsÿ¾Àgÿ½À]ÿ¼¾Tÿ·»Jÿ¸ºBÿ¶¹;ÿ±´6ÿ°²6ÿ¬®2ÿ¨ª.ÿ¥§+ÿ¤¦+ÿ£¥*ÿ £(ÿŸ¡*ÿ™&ÿ˜›(ÿ”˜'ÿ‘”'ÿŒŽ$ÿ†‡ ÿ‚ƒÿ€ÿwz$ÿvy#ÿtyÿqvÿjrÿfnÿdmÿgmÿlq&ÿqs1ÿ~Aÿ‰ŠLÿ…†Fÿtu5ÿeh#ÿ_cÿ[s%ÿkƒ5ÿwŒNÿ•¤xÿ¿É«ÿäèÜcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóìøØÓƒîèÿí°ÿè›zÿõ”rÿÿ™sÿÿ uÿÿ¤vÿý¥vÿó©yÿó©yÿó¦xÿñ sÿ÷™nÿþ”kÿÿ’gÿÿeÿõ–dÿø™gÿúžiÿþ¢mÿÿ§pÿÿ«sÿÿ¯uÿÿ±vÿÿ·|ÿÿº~ÿÿ½‚ÿÿÁ…ÿÿĉÿÿÈÿÿÌÿÿÎ’ÿÿÍ”ÿÿ͘ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿРÿýÒŸÿþÒ£ÿüÒ£ÿýÒ§ÿýÕ«ÿüÖ´ÿûÙ¼ÿûÚÆÿýÜÌÿøÞÐÿîáÓÿëÞÐÿéáÄÿåß²ÿÙÙ™ÿÔÕ…ÿÊÐqÿÄË\ÿºÃNÿ¶¾Aÿ²»<ÿ²¸5ÿ­´.ÿ­´.ÿ®³.ÿª¯*ÿ¨¬+ÿ¦ª)ÿ¤¨'ÿ£§&ÿ¡¥'ÿ £(ÿœ¡&ÿšž'ÿ•›&ÿ“—&ÿŽ“&ÿŠŽ%ÿ†Š#ÿƒ†#ÿ€ƒ ÿ~!ÿqw ÿos!ÿkoÿhkÿghÿjj$ÿqq+ÿxv5ÿ€>ÿƒ„BÿˆŒJÿ‡‹Iÿu|9ÿbi&ÿ[d!ÿbk(ÿdv;ÿ{ˆZÿ“ zÿ»ÄªÿåêÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìç2ÿÛÀìÿÅ¥ÿö©ˆÿú™wÿÿ—qÿÿrÿÿ¤vÿÿ¨yÿõ«{ÿôªzÿô§yÿø§zÿÿ¦{ÿÿ¤{ÿÿrÿÿ–kÿ÷˜fÿ÷˜fÿöšeÿøœgÿú iÿú¥mÿüªpÿû­rÿÿ³xÿþ¶zÿý¹~ÿý¾‚ÿýÁ†ÿýÅŠÿÿÉÿÿËÿÿË’ÿÿÌ—ÿÿÏ—ÿÿÏ›ÿÿÐœÿÿÏŸÿüÑžÿýÑ¢ÿúСÿûÐ¥ÿúÒ¨ÿúÔ²ÿù׺ÿùØÄÿüÛËÿ÷ÝÏÿîáÓÿëÞÐÿéáÄÿäÞ±ÿÖÖ–ÿÏЀÿÄÊkÿ¼ÃTÿµ¾Iÿ±¹<ÿ¬µ6ÿ­³0ÿ©°*ÿª±+ÿ¬±,ÿ©®)ÿ§«*ÿ¦ª)ÿ¤¨'ÿ£§&ÿ ¤&ÿž¡&ÿ™ž#ÿ—›$ÿ‘—"ÿŒÿ…Šÿƒ‡ÿ‚†ÿ€ƒ ÿy|ÿtuÿkqÿjnÿhlÿjmÿqr(ÿ||6ÿ……?ÿŠˆGÿNÿ‘Oÿ‡‹Iÿvz8ÿcj'ÿ^e"ÿfo,ÿqz7ÿs…Jÿ‘žpÿ¶ÃÿàéÏøýî ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúîî ïÚÜníÁ´ÿë«’ÿò wÿóŸoÿ÷¥nÿüªsÿõ®|ÿôª€ÿô¨„ÿõ¨ˆÿýª‹ÿÿ«ÿÿ¨†ÿý¤ÿû£tÿø qÿñœlÿî™iÿï›gÿóŸkÿø¦oÿüªsÿü­tÿþ¯vÿÿ³zÿÿ¶}ÿÿ»ÿÿ½ÿÿÀ„ÿÿÁ…ÿþÇŠÿýÊŒÿþÍÿÿÐ’ÿþÒ“ÿþÒ“ÿþÔ“ÿþÔ“ÿþÕ–ÿÿÕšÿýÖŸÿýקÿüÙ±ÿýÜ»ÿÿàÁÿÿßÌÿòßØÿîÛÔÿìÞÂÿçÛ«ÿØÔÿÎÍrÿÃÇVÿ»À?ÿ²º1ÿ¬´+ÿª±(ÿ¨¯&ÿ¦ª)ÿ¨ª.ÿ¨ª3ÿ¥§0ÿ£¨'ÿ¢§&ÿŸ§%ÿœ¢%ÿ˜ $ÿ”š#ÿ–#ÿ“$ÿˆŽ#ÿ…‰"ÿ€„$ÿ}€$ÿw|!ÿsv ÿkqÿgkÿhpÿot)ÿxy5ÿ~Bÿ‰‚Pÿ‘ŠXÿ”ŽYÿ”ŽYÿ—–ZÿŽŽNÿ|<ÿhr,ÿ^h&ÿ_l.ÿn}@ÿ}‡Xÿ—žƒÿ½À±ÿàäØyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïñ ÿÜÏÿÄ«ÿÿ°‡ÿø¤tÿô¢kÿö¤mÿö¯}ÿù¯…ÿû¯‹ÿù¬Œÿýª‹ÿÿªŒÿÿ®Œÿÿ°‹ÿÿ°ÿÿ­~ÿÿªzÿû¦vÿù¥qÿö¢nÿô¢kÿò iÿô¥lÿö§nÿø«rÿû®uÿü´xÿÿ·{ÿÿ»ÿÿ½ÿøÁ„ÿøŇÿùÈŠÿüËÿúÎÿûÏÿúÐÿûÑÿüÓ”ÿüÒ—ÿúÓœÿùÓ£ÿùÖ®ÿúÙ¸ÿýÞ¿ÿýÝÊÿïÜÕÿìÙÒÿêÜÀÿåÙ©ÿ×ÓŒÿÍÌqÿÃÇVÿ»À?ÿ¯·.ÿ©±(ÿ§®%ÿ¦­$ÿ£§&ÿ£¥)ÿ¢¤-ÿŸ¡*ÿž£"ÿ¢!ÿš¢ ÿ— ÿ’šÿŽ”ÿŠ‘ÿˆŽÿ‡ÿ€„ÿ{ÿuxÿnsÿorÿu{$ÿ{-ÿ~†3ÿ‰ŽCÿ“”Pÿ•”Xÿ˜‘_ÿ›”bÿœ–aÿš”_ÿ”“Wÿ?ÿjo*ÿcm'ÿeo-ÿkx:ÿƒ’Uÿž¨yÿÅ̱ÿéìÝcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêâÕ€ãγÿ⸕ÿæ¨ÿôœwÿÿ¢ÿÿ©†ÿÿ­ÿÿ°ÿú°Žÿó±Žÿò´Žÿô¶ÿÿ¶ÿÿ·ÿÿ·ÿÿ·ÿÿ¶Šÿø¯ƒÿó¨zÿî£uÿñ¥tÿò¦uÿó¨tÿô©uÿø¬wÿû¯zÿÿ³~ÿÿµ€ÿú¹‚ÿü»„ÿþ¿…ÿÿÁ‡ÿþŇÿÿljÿÿˈÿÿ̉ÿÿ΋ÿÿÍŽÿÿÎ’ÿÿÏ›ÿÿÑ¥ÿÿÔ°ÿÿÙ·ÿÿÙÂÿîÙÑÿëÖÎÿéÙ¼ÿåצÿØЊÿÐËpÿÇÆXÿ¾½Cÿ²´2ÿ¬®,ÿ§¬)ÿ¤§)ÿŸ¡)ÿž-ÿ››/ÿ——+ÿ“š'ÿ’™&ÿ•$ÿŒ‘$ÿ‡Œ#ÿ„ˆ#ÿ…&ÿ€‚(ÿuz%ÿux(ÿtx,ÿtw/ÿvz3ÿ~€>ÿŠŒJÿ“”Vÿ”œ]ÿ˜žcÿ›Ÿdÿœšdÿ›™cÿ›eÿš˜^ÿ“‘WÿEÿlq4ÿ`f+ÿfo7ÿp{Iÿ‚Ždÿ¤µŠÿÈÔ¶ÿéêæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷êûæË¥øΫÿóµŒÿû£~ÿþšwÿÿ¢ÿÿªŒÿÿ³“ÿÿ¸–ÿû¹–ÿõ·‘ÿñ³ÿÿº“ÿÿº“ÿÿº“ÿÿ»”ÿÿ¾’ÿÿ¾’ÿÿ¼ŽÿÿºŒÿý±€ÿü°ÿù®zÿö«wÿõ©tÿöªuÿø¬wÿú®yÿöµ~ÿ÷¶ÿ÷¸~ÿùº€ÿ÷¾€ÿúÁƒÿûƃÿýÈ…ÿÿʇÿÿÊ‹ÿþÊŽÿýË—ÿÿ΢ÿÿÑ­ÿÿ×µÿÿ×ÀÿëÖÎÿçÒÊÿåÕ¸ÿßÑ ÿÑɃÿÈÃhÿ¾½Oÿ¶µ;ÿ¬®,ÿ¦¨&ÿ¡¦#ÿŸ¢$ÿ›%ÿ›š*ÿ™™-ÿ••)ÿŽ•"ÿ”!ÿŠÿ†‹ÿ†ÿ~‚ÿz~ÿz|"ÿ{€+ÿ~1ÿ…‰=ÿ‘”Lÿ¡Zÿ¤¦dÿ¤¦dÿ¢£eÿž¦gÿ£hÿ›Ÿdÿ›eÿ¢ jÿ£¡kÿ—•[ÿ…ƒIÿll0ÿhm0ÿkq6ÿvGÿ‡’`ÿ¥±‡ÿÌݲÿíùÛnÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïëàOñÐÁÿï·¤ÿö£ÿõÿùŸ|ÿÿ¬‰ÿÿº“ÿÿ¼”ÿø¼’ÿø¼’ÿ÷ºšÿõ¸˜ÿö¹™ÿù¼œÿýÀžÿþÁŸÿÿžÿÿžÿÿÂœÿÿÀšÿÿ¾—ÿûº“ÿù·Žÿô²‰ÿñ°„ÿî­ÿú¬ÿú¬ÿ÷¯€ÿø°ÿù´‚ÿý¸†ÿÿ½†ÿÿ¿ˆÿÿ¿ˆÿÿÀ‰ÿÿÀÿÿÁ•ÿÿÄžÿÿȪÿÿʵÿÿйÿèØ»ÿåÕ¸ÿáÖªÿÚÏ–ÿÊÄ{ÿÁ¼gÿ¶´Pÿªª>ÿŸ¢/ÿš*ÿ•˜%ÿ“”&ÿ“$ÿŠŽ$ÿ‡ ÿ†‹"ÿ~‚)ÿ‚-ÿ€ƒ.ÿ€1ÿ5ÿ…†>ÿŒKÿ“’Uÿ˜—]ÿ¤¢lÿ«ªwÿª¨xÿ¦¦vÿ¨¨xÿ¥¨wÿ¡¢vÿ¡wÿž¢xÿ¤©uÿ£¨kÿ¡©cÿ™¡[ÿ~†@ÿjr,ÿci0ÿkn=ÿy|Uÿ’sÿ«±˜ÿÑÙÈ°ïùé(ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþúï ÿêÛnÿÚǽÿ»¥ÿÿ¬Žÿú }ÿÿ¥‚ÿÿ³Œÿÿ¼”ÿþ˜ÿÿÅ›ÿü¿ŸÿýÀ ÿýÀ ÿü¿Ÿÿü¿ÿÿ ÿÿÅ¡ÿÿÇ£ÿÿÇ¡ÿÿÇ¡ÿÿÈ¡ÿÿÈ¡ÿÿÉ ÿÿÇžÿÿÇ›ÿÿÆšÿÿ»ÿÿ¹Žÿÿ¸‰ÿýµ†ÿù´‚ÿø³ÿù¶ÿù¶ÿû¸ÿü¹‚ÿú¸…ÿú¹ÿû¼–ÿþÀ¢ÿÿ­ÿþȱÿßϲÿÜ̯ÿ×Ì ÿÑÆÿÁ»rÿ·²]ÿ­«Gÿ¢¢6ÿ™œ)ÿ•˜%ÿ’•"ÿ“”&ÿ–'ÿ”*ÿ‘—*ÿ’—.ÿ”;ÿ“–Aÿ™œGÿ ¡Qÿ¥§[ÿ¬­eÿ°±oÿ³²uÿ¸·}ÿ¸¶€ÿ´³€ÿ±¯ÿ­­}ÿ¬¬|ÿª­|ÿ©ª~ÿ¥©ÿ¤¨~ÿ¬±}ÿ¨­pÿ•Wÿ~†@ÿlt.ÿks-ÿsy@ÿƒ†Uÿ›žwÿ¸½žÿÜâÉ°õýìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòãÓƒìË·ÿã³—ÿ꧆ÿò¨„ÿù¯‹ÿÿ»•ÿÿÄžÿýŨÿüħÿø¤ÿõ¿¡ÿöÁ¦ÿûÆ«ÿýÈ­ÿûÆ«ÿüÊ®ÿý˯ÿÿͯÿÿϱÿÿвÿÿвÿÿѱÿÿаÿÿÑ°ÿÿЯÿÿÏ­ÿü̪ÿø˦ÿõÈ£ÿõÇžÿôÆÿñÚÿð™ÿíÀšÿêÀÿèÀ£ÿéĪÿìdzÿêɵÿßжÿÛ̲ÿ×ʪÿÎÄœÿÀ¹ˆÿµ±wÿ¬ªjÿ£¢^ÿ››Uÿ™™Sÿš›SÿžVÿ¡¢Xÿ¥¦\ÿª«aÿ®¯eÿ¶¶zÿ¸·ÿº»ƒÿ¾½ŠÿÂÁÿÃÀ“ÿÀ¿“ÿ¾¼”ÿ¶µÿ²±‹ÿ°¯‰ÿ±°Šÿ¯°‰ÿ¬­†ÿ«¬„ÿ­®†ÿ®±Šÿ¬¯ˆÿ¥«zÿŠ“Zÿq};ÿht2ÿhv6ÿs~Fÿ†dÿ¨­ŽÿÉιÿçèßYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûëÿêÖ~ÿÓ·ÿýº™ÿó©…ÿÿô­‡ÿÿ¹“ÿþÆ©ÿÿÊ­ÿÿÌ®ÿþȪÿúŪÿûÆ«ÿüǬÿúŪÿüÊ®ÿý˯ÿþÌ®ÿÿͯÿÿϱÿÿвÿÿѱÿÿÒ²ÿÿÕ´ÿÿ׶ÿÿÚ¸ÿÿÛ¹ÿÿÜ·ÿÿÚµÿÿÙ°ÿÿ×®ÿÿدÿÿ×®ÿÿÕ¯ÿþÔ±ÿüÔ·ÿûÖ¼ÿü×ÃÿúÙÅÿîßÅÿêÛÁÿèÛ»ÿâØ°ÿØÑ ÿÑÍ“ÿËɉÿÄÃÿÅÅÿÄÄ~ÿÅÆ~ÿÈÉÿÊËÿÌ̓ÿÐчÿÓÔŠÿÍÍ‘ÿÌË“ÿÈÉ‘ÿÆÅ’ÿÃÂÿÀ½ÿ»ºŽÿ¹·ÿº¹“ÿ·¶ÿ¶µÿ¶µÿµ¶ÿ´µŽÿ´µÿ·¸ÿ´·ÿ¡¤}ÿŠ_ÿmv=ÿam+ÿlx6ÿ}‹Kÿ‘œdÿ³¼‘ÿ×ܽÿñöáOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðè(õÚÌšéÁ¯ÿä®—ÿ਋ÿå©Œÿõ·™ÿÿĦÿÿгÿÿÑ´ÿÿ̯ÿþȯÿüɯÿúɳÿ÷Ë´ÿ÷Ë´ÿõʵÿ÷Ì·ÿ÷θÿúÑ»ÿúÓ½ÿûÔ¾ÿñÔ¹ÿòÕºÿó׿ÿõÙÁÿôÚÂÿôÚÂÿõÚÀÿôÙ¿ÿøÝÂÿøÝÂÿ÷ßÃÿùßÇÿ÷ãÊÿõäÏÿõèÒÿöæÙÿúæáÿöâÝÿòå×ÿîâÐÿâÝÄÿÝÙ¼ÿÙضÿÔÓ±ÿË̪ÿÊË©ÿËʨÿÊɧÿÉƧÿÆäÿÈâÿÉÄ£ÿÅÄžÿÄÃÿÂÃœÿ¿¾œÿ½¼šÿ¼ºœÿ½»ÿ½»ÿ½»œÿ»¹šÿ·¸–ÿ¸»”ÿ½Á˜ÿÁÆ™ÿ¾Ä•ÿ¸¾ÿŸ§xÿ}…VÿhrCÿirGÿr|Qÿˆeÿ• €ÿ¶¾§ÿÞçÓƒñ÷ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöè(ÿåÓƒÿйÿô¼Ÿÿ믒ÿ樊ÿì®ÿôºÿÿǪÿÿÒµÿÿÕ¼ÿÿÕ»ÿÿÒ¼ÿüйÿüйÿúϺÿúϺÿúÑ»ÿûÒ¼ÿûÔ¾ÿüÕ¿ÿöÙ¾ÿöÙ¾ÿôØÀÿôØÀÿóÙÁÿõÛÃÿøÝÃÿùÞÄÿøÝÂÿùÞÃÿùáÅÿûáÉÿøäËÿöåÐÿôçÑÿõåØÿüèãÿ÷ãÞÿóæØÿðäÒÿäßÆÿßÛ¾ÿÛÚ¸ÿ×Ö´ÿÑÒ°ÿÏЮÿÐÏ­ÿÐÏ­ÿÏÌ­ÿËÈ©ÿËÆ¥ÿËÆ¥ÿÇÆ ÿÈÇ¡ÿÇÈ¡ÿÆÅ£ÿÄáÿÃÁ£ÿÃÁ£ÿĤÿÀ¾ŸÿÁ¿ ÿÂáÿÅÈ¡ÿÇË¢ÿ½Â•ÿ¦¬}ÿ‘—hÿv~Oÿgo@ÿhrCÿ{„Yÿ– uÿ³º—ÿËÖ¶ÿæî×~øÿíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñè(òàÏùкÿþ¹˜ÿô¯Žÿî«Šÿö¶˜ÿÿƨÿÿжÿÿÓºÿÿÔ¾ÿÿÖÀÿÿÖÃÿÿÔÃÿûÕÃÿøÔÂÿøÔÂÿöÕÂÿöÕÂÿÿ×Äÿÿ×ÄÿþÖÄÿÿÕÈÿþÖÊÿÿ×ËÿÿÙÌÿÿÚÍÿÿÚËÿÿÛÌÿÿÜÊÿÿÝËÿÿßÏÿÿßÒÿþáÒÿüâÖÿùæßÿñáÚÿîãÕÿéãÐÿßÞÂÿÖÛ»ÿÐÛµÿÍزÿÈÓ­ÿÅέÿÄÌ­ÿÉ̲ÿÉ̲ÿÌÉ´ÿÌƳÿÌƳÿÊË«ÿÊË«ÿÉÉ«ÿÈȪÿÇƪÿÆÅ©ÿÅĨÿæÿÏϱÿÍάÿÈˤÿÁÅ›ÿ±·†ÿš¢mÿ€‰QÿpyAÿp|@ÿ‹Oÿ–Ÿtÿ©®ÿÃƶÿãçâEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûêÿñÛnÿÛºÿÿ˪ÿýº™ÿò²”ÿì°’ÿí´šÿø©ÿÿÑ»ÿÿÚÄÿÿÚÇÿÿÚÉÿÿÜÊÿÿÜÊÿÿÜÊÿýÜÉÿüÛÈÿÿÚÇÿÿÛÈÿÿÜÊÿÿÛÎÿÿÛÏÿÿÛÏÿÿÚÍÿÿÙÌÿÿÛÌÿÿÛÌÿÿÝËÿÿÞÌÿÿàÐÿÿáÔÿÿäÕÿÿæÚÿùæßÿñáÚÿîãÕÿêäÑÿâáÅÿÙÞ¾ÿÔß¹ÿÑܶÿÐÛµÿÌÕ´ÿÊÒ³ÿÎÑ·ÿÏÒ¸ÿÑιÿÒ̹ÿÑ˸ÿÎϯÿÌÍ­ÿËË­ÿÎΰÿÒѵÿÕÔ¸ÿÕÔ¸ÿÔÓ·ÿÑѳÿÃÄ¢ÿ°³Œÿ™sÿ‡Vÿs{FÿxIÿ†Wÿ‘aÿ¨´xÿÊÓ¨ÿâçÈ°óöæ2ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþûìùïÝcîÜËÿçɶÿâ¹£ÿâ®—ÿð­–ÿö³œÿÿìÿÿͶÿÿÚÄÿÿáÌÿÿäÑÿúãÓÿïâÒÿíàÐÿõàÊÿõàÊÿõàÊÿöáËÿúãÍÿûäÎÿúáÍÿøßËÿûáÐÿüâÑÿüâÒÿýãÓÿþäÔÿÿæÖÿÿèØÿÿèÝÿñèÞÿïæÜÿêä×ÿçáÔÿâßÐÿßÜÍÿÙÚÆÿ×ØÄÿÓÖ½ÿÒÕ¼ÿÑÔºÿÐÓ¹ÿÏÔµÿÏÔµÿÏÔµÿÐÕ¶ÿÙÒÁÿÖϾÿÚÖ¾ÿÛؼÿÙÛ·ÿàä»ÿ×à®ÿ¾Ç•ÿ¬¸„ÿ–¢nÿ}ŠVÿuQÿrSÿvYÿŠ˜oÿ§³ÿÌÌÌšÚÚÚnìììÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþìÿøç2ÿîÛnÿàÊ¥ÿ̵ÿýº£ÿô±šÿñ®—ÿù¶Ÿÿû¬ÿùÌ·ÿ÷ÖÃÿößÏÿôç×ÿøëÛÿÿêÔÿþéÓÿýèÒÿûæÐÿüåÏÿüåÏÿþåÑÿÿæÒÿüâÑÿûáÐÿûáÑÿüâÒÿþäÔÿÿç×ÿÿéÙÿÿéÞÿõìâÿôëáÿðêÝÿíçÚÿçäÕÿäáÒÿÞßËÿÝÞÊÿÚÝÄÿØÛÂÿÖÙ¿ÿÖÙ¿ÿ×ܽÿÙÞ¿ÿÚßÀÿÚßÀÿèáÐÿçàÏÿëçÏÿãàÄÿÌΪÿ¾Â™ÿ­¶„ÿ— nÿ‚ŽZÿ{‡Sÿu‚Nÿ~ŠZÿ’Ÿsÿ«¶ŽÿÂЧÿØäÀìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûïå;ïßÏêÒÀÿÝ¿¬ÿἦÿḡÿ浟ÿí»¥ÿþDzÿÿÒ¾ÿÿÙÅÿÿàÜÿÿåáÿÿëçÿÿíéÿÿìçÿÿéäÿÿèäÿÿèäÿûçâÿ÷çáÿôåâÿòçãÿñèäÿïëæÿðíèÿðíèÿöêêÿöêêÿóééÿðææÿêãàÿæßÜÿáÝØÿàÜ×ÿáàÖÿßÞÔÿààÔÿãã×ÿèèÚÿêêÜÿéêÚÿæç×ÿÝãÀÿÒصÿÉЫÿ·¾™ÿ™¢zÿ‡hÿŠbÿy„\ÿz„`ÿ‹“tÿš£‰ÿ­´ŸÿÈÏÀìâèÝcðõìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüìÿõãEÿéÖ~ÿàÊ¥øϸÿð¿©ÿë¹£ÿ︣ÿõº¦ÿõº¦ÿëÆÂÿóÎÊÿüÙÕÿÿâÞÿÿçâÿÿèãÿÿêæÿÿëçÿÿîéÿÿðêÿþïìÿûðìÿùðìÿõñìÿõòíÿ÷ôïÿüððÿþòòÿýóóÿüòòÿøñîÿöïìÿòîéÿòîéÿðïåÿìëáÿççÛÿååÙÿááÓÿÚÚÌÿÏÐÀÿÇȸÿ°¶“ÿž¤ÿ–qÿ†hÿ|…]ÿ}†^ÿŠ•mÿ–¡yÿ®¸”ÿÉѲÿÝæÌšéðÛnóúëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüóå;ûçÖ~÷ÛÊÿøÏÀÿí±ÿë¹¥ÿï¹¢ÿðº£ÿó½¦ÿø«ÿýɲÿÿѺÿÿØÁÿÿÞÆÿÿëÓÿÿïÖÿÿôÚÿÿöÜÿÿöÛÿÿ÷ÜÿÿúßÿÿýâÿýûÝÿþüÞÿüüÞÿúúÜÿõøØÿòõÕÿìóÐÿëòÏÿÞèÄÿÔÞºÿÆÑ«ÿ¸Ãÿ­¸ÿ¡¬„ÿ”ŸwÿŒ—oÿ…‘mÿ~‰iÿŒkÿ™{ÿš¦ˆÿ©´šÿ¾È±ÿÏØÄÊáèÙyðöëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþíÿùè(ÿðáOÿäÓƒÿÛǽÿйÿÿʳÿ÷Áªÿò¼¥ÿﻤÿð¼¥ÿｦÿí¿§ÿé½¥ÿê©ÿíÈ®ÿëÊ°ÿêͲÿíеÿðÕºÿôÙ¾ÿæäÆÿãáÃÿÚÚ¼ÿÒÒ´ÿÆÉ©ÿ½À ÿ±¸•ÿ¬³ÿž¨„ÿ—¡}ÿ˜rÿ‡’lÿ‡’jÿŠ•mÿŽ™qÿ‘œtÿ›§ƒÿ¤¯ÿ´¿žÿÈÒ´ÿÕáÃÜàëщí÷àOùÿîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôùä;ñòÞYìë×ÿèâÏÿæÚÈÿáÑÀÿÞʹÿàôÿݼ¬ÿ们ÿ纬ÿ뺬ÿï»®ÿõ¾±ÿúÁ²ÿüôÿÔѼÿÏÌ·ÿÆîÿ½º¥ÿ°²œÿ¦¨’ÿ›Ÿ†ÿ”˜ÿ‘—~ÿ’˜ÿ”ƒÿ›¤Šÿ¦¯•ÿ´½£ÿÃ̲ÿÌÕ»ÿÓÚË¥ÞäÙyèïâEîóêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð ÿÿíÿþëÿúè(ÿõä;ÿïÞYÿêÛnÿåÕ€ÿßЉÿØÊ¥ÿÔƽÿÓƽÿÔǽÿÕƽÿÔÅÊÞÛƽÚ×ÂÜÖÓ¾ÿÕÒ½ÿÑÓ½ÿÏÑ»ÿÉÍ´ÿÅÉ°ÿÈεÿÏÕ¼ÿÕÞÄÊÝæÌšãìÒƒéòØyðùßYõþä;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü?ÿÿÿü?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀ?ÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€?ÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿð?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ?ÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîíåäêãââââåææíïï ÜÚÚ6ÔÏÐj½À¿¦¬±°¶¦¦¦Á £¤äž£¥à¦§¤Á±±¯µ¾Á®ÓÔÔràáÞ4ìíë îïíâãáÚÚÙÝßÞæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççêðîîæåðèçãàá*ÆÄÄ}¢¢¢Ú…‰‰ÿw‹ˆÿg‘Šÿkž–ÿ€«¤ÿš®ªÿ¨«¤ÿ¦¦šÿš—ŠÿŒ‚ÿˆˆƒÿˆŠˆþ¢£¢ÔÈÊÈáâà'ßßÞÞàßæçêèèíééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëëèèèççðõóìãâ1Á¸¶¬ŠŒ‹ôp‹†ÿj©Ÿÿfͼÿ`ßÊÿVçÓÿMêÔÿfíØÿ¿ðàÿééÓÿçÚ«ÿâÙŽÿäÖ•ÿÙΚÿÇ¿˜ÿª¡ÿ‹‡ƒÿŠŽó¶¸¸›Þàà,êìïééîééïááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææíêëíêêîììÄÈÇš‹Žõi–ŽÿiǹÿYãÐÿAéÒÿ-çÎÿ(äÍÿ#âÍÿ(âÌÿMäÎÿ®æÙÿßáÈÿãшÿÞÓYÿÞÓYÿÞÐgÿÞÓoÿâØÿÝÓ›ÿöÿ”Ž‡ÿôÂÃÈ”ìíòëëñááãíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòçææñîïçâã6«£¥ÓsŒÿoĸÿYåÒÿ8åÍÿ%áÉÿ&ßÇÿ(ÝÆÿ)ÚÃÿ!ØÀÿ%Öºÿ=Ú¼ÿ˜ÜÈÿÎÔ³ÿØÂxÿÙÀTÿÚÀZÿÜÄ^ÿÞËYÿÞÍWÿÝÍ`ÿãÑtÿàÓ–ÿûšÿ‘Ž†ÿ¦¥«ÑÞßè:ååçíìììóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôè÷õèóòëêêÝ××V‘––ôl© ÿ\àÍÿ8åËÿ$áÄÿ"ÞÁÿ%Ú¼ÿ$Ö·ÿÑ­ÿÍ¥ÿÉ¢ÿ+Æ¢ÿEЬÿ—Õ»ÿÆͨÿÊ·sÿëPÿÁ§IÿÆ­IÿÌ´NÿÕºXÿÚÁ[ÿÛÇYÿÜÉ^ÿáÏxÿÝКÿ§¡Žÿ••šð×ØÚPòññìóñêõòêõòêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôèöôèöôèøõíù÷ÙÔÕ\†“‘ùn¿´ÿPåÏÿ*ßÅÿ$ÛÁÿ$عÿÒ°ÿ ʤÿÄ™ÿ"–ÿ6ÆœÿHͦÿiÓ³ÿ…ßÂÿ¿ãÔÿÞàÍÿâÑ«ÿÖÀŽÿеyÿƨ_ÿ¼žLÿ¾¡HÿÆ«KÿÍ´RÿÓÀTÿÙÅVÿÚÇeÿÞÐÿ¸±•ÿ”“’ùØØÙ[ï÷ôêõóêõóêõóêõóêõóÿÿÿÿÿÿÿÿÿÿÿÿêóòêóòêóòêóòî÷õÛàßu‹—–ùkƸÿDâÊÿ$Ú¾ÿ#عÿÑ­ÿÉ¡ÿÁ˜ÿ»ÿ)¾Žÿ:Ä—ÿF›ÿCÁ—ÿ9À‘ÿIÕÿ„Ë£ÿ³¿•ÿ¼£kÿº^ÿÃ¥iÿɧsÿƨiÿºŸQÿµ™Dÿ½DÿĪIÿ͵QÿÕ¿TÿÕÂ]ÿáÌ€ÿƸžÿ—š‘ú×àÞYñõòíòíîòíîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòïïòïïòïïôòñìáâ0—œ›÷kôÿDàÇÿ"عÿÔ²ÿ Ê¥ÿ˜ÿ¼Šÿ¹„ÿ ¹„ÿ*µ…ÿ ³ÿ´zÿ'·„ÿ9Á“ÿ^Ê¥ô•Ó³æ¹Ç¡àÀ­è·›aÿ°ŒMÿ«…>ÿ¯‰@ÿ»‘Pÿ½”Sÿ²’Aÿµ•?ÿ¿JÿÉ«MÿϹOÿÒ¾VÿÝÊ}ÿÁ¶ÿ¡Ÿ ìéèä2óóîððëððìððìÿÿÿÿÿÿÿÿÿÿÿÿñíìñíìòííõïï«®¬Ór¼®ÿBàÄÿÖ¶ÿѬÿÈÿ¿‘ÿ·…ÿ´{ÿ³vÿ°vÿ±ÿFßÿŠÚÅÞ«ëØ–Ëöëméúø&îøüÞæÓ îåÖòìÜFàÛÂ}ÑèɷŸoÿ£ˆ?ÿ©„8ÿ³†Bÿ²Š>ÿ³>ÿ»—DÿĦHÿ̵KÿÓ¼OÿØÇÿµ­˜ÿ±°°ÇðòððóîïòíïòíÿÿÿÿÿÿÿÿÿÿÿÿñííñííöñòËÇLJv¯¤ÿBàÂÿ"Ô²ÿΨÿ Äšÿ¼Šÿµ€ÿ±xÿ¯tÿ°{ÿF¿˜ÿ–áÈÏÎ÷íZêÿþÐúîÓþóíüûî÷üÜäÐìãÔøóãñðÙúøñòïßAÓΧ¸³›iÿ§=ÿ©5ÿ«…5ÿ°‰:ÿ¸‘CÿÀ¡FÿɯKÿ͹RÿÓƇÿª¦šÿËÍɉòöîîñêîñêÿÿÿÿÿÿÿÿÿÿÿÿééêëëìèãã,’¬§õ]Ô½ÿ(Ô³ÿ̧ÿÙÿ¹Šÿ´}ÿ±xÿ®uÿ#³€ÿvÏ´ðÈôìvâÿúßÿöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéù÷çñìÓîãÓRǹŠæ§…Fÿ§3ÿªƒ4ÿ­‡<ÿ³’=ÿ»ŸHÿͬKÿÏ·ZÿÉÀÿ¯§¨õéçê!ðïïîíîÿÿÿÿÿÿÿÿÿÿÿÿåëêéïïÆÂħp¿°ÿ+صÿ"ɤÿ–ÿ»ˆÿ±ƒÿ±vÿ®tÿ'²†ÿˆ×Àõäüõ2èÿÿÛþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËüöæõô玡˫‰Bÿª}2ÿ¢‚6ÿ¯‰7ÿ¸’?ÿ¼ŸGÿȬGÿÓ»jÿº¯žÿÇÇË–ðïðëêëÿÿÿÿÿÿÿÿÿÿÿÿêééåãã"›´¯õVзÿË¥ÿÙÿºŠÿ³~ÿ®xÿ­rÿ²~ÿ€Ò¹åçýö:ðÿþåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåìçËùóâ÷÷ëûöì̼˜Ø¦…@ÿ¨z8ÿ«€6ÿ®Š6ÿ²‘?ÿÁ¡DÿƪRÿȺ‰ÿ²°©îäããçååÿÿÿÿÿÿÿÿÿÿÿÿíííÑÑÐvyÁ°ÿ.ЬÿÄ™ÿ½ÿ´‚ÿ°xÿ°qÿ¯wÿdȪùÛõíMíÿúìÿüåÿýÚþõÛýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷õåëæÊùóáõôçü÷íîéå/¼­{ô­‚6ÿ¨|7ÿ¨‚4ÿ¯‰=ÿº•@ÿÀ Eÿʳdÿº²˜ÿÒÒÑmíîñÿÿÿÿÿÿÿÿÿÿÿÿíññ´Â¿ÏUË®ÿÇžÿ¾Žÿ·‚ÿ±zÿ®tÿ¯qÿ8»‘ÿ¾äÙ‡òúøíùöëýùäýûÙþôÚýôáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóéöôäòðØùõêöõêöôéøöïæàʆ±˜Uÿ¦}4ÿ¨~5ÿ«‚9ÿ²Œ=ÿ¹™@ÿÅ¥LÿÅ´†ÿÂÀ»Çîñùÿÿÿÿÿÿÿÿÿÿÿÿæëë2œ½¶ÿ:Ì©ÿ¾“ÿº‡ÿ³{ÿ°vÿ¬rÿ±yÿ}Ϲîéöôæ÷õå÷ôå÷ôæ÷öâýøÞýöáýùÊ÷ëÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÕöóé÷ôäóòèñíëòîêòîêòïëóïî ĵ™à©„8ÿ¨}1ÿª6ÿ­‡9ÿ±‘>ÿ¾˜CÿŬnÿ¼¹«úäèï0ÿÿÿÿÿÿÿÿÿÿÿÿâÚÜ\vðÿ)Åÿ¹Œÿµÿ°yÿ­uÿ­sÿ5¹ŠÿÀâÛŸøÿÿñÿÿñÿÿñÿÿñÿÿñÿÿñÿÿëÿþÉ÷êÐüñëûúí÷ûÜäÐìãÓ÷ñáîíÔ÷öëôñæòðæñïæñïæñïæñïåõóëÚ×Ê’®’Uÿ§~/ÿ¨6ÿ«8ÿ°‰;ÿ¶“=ÿãVÿ¼µ—ÿ×Ùã`ÿÿÿÿÿÿÿÿÿÿÿÿÏÒцZèÿÀ’ÿ·„ÿ³{ÿ¯uÿ¬sÿ®wÿZÅ þàíç<ï÷ôì÷ôì÷ôì÷ôì÷ôì÷ôí÷óìøõÇ÷éÏüñëûúí÷ûÜäÐìãÓ÷ñàîìÖîòéííèíîèîîèîîèîîèîîèïðêçèá@¸¥xÿ©€5ÿ©}4ÿ¬7ÿ®…9ÿ³Œ;ÿ»˜Fÿ»°…ÿÕÔØÿÿÿÿÿÿÿÿÿÿÿÿÂÒδHÄ¢ÿ¹‡ÿ³~ÿ°wÿ®sÿ­qÿ²}ÿͶæéìéâëæâëæâëæâëæâëæâëæâëæãëæÜîçØüôêüúí÷ûÜäÐìãÒöòçíððìïñìïñìïñìïñìïñìïñìïñíðòìðóÁ¶šîª„<ÿ¦|1ÿª4ÿ¬‚4ÿ¯‰7ÿµ<ÿ»ªvÿÐÍË¢ÿÿÿÿÿÿÿÿÿÿÿÿ¼ÎÇÁFÄŸÿ¹…ÿ´~ÿ²zÿ±xÿ¯vÿ-¶‡ÿ¡ÍûíçëææçææèææèææèææèææèææèææçèåçãëêêúùíøüÜäÐéãÔéëèçêêçêéçêéçêéçêéçêéçêéçêéçêééííɯ̮ŽJÿ¥€6ÿ¨‚8ÿª„:ÿ­‰=ÿ²Aÿº¤pÿÏÈŶÿÿÿÿÿÿÿÿÿÿÿÿ¾ÌÈÁaÉ¥ÿH¿‘ÿG¼ÿE»ŠÿCº‰ÿ@ºˆÿXšÿ¸ÍʵßÙÞÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÜÚØÛÞàãéôõåìåççæçèèçèèçèèçèèçèèçèèçèèçèèçèèçèèêëìÎɼú gÿ±Rÿ³‘Sÿ¶“Tÿ·•Wÿº™Yÿ¾«{ÿÎÊÆÖÿÿÿÿÿÿÿÿÿÿÿÿÊÌÎîɦÿ¥¾—ÿ¥½—ÿ£»•ÿ£»•ÿ¢½•ÿ¬Æ¦ÿÆÏɶÚÝÝ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛ×ÜÛÙÞÝëíìîîíìçéìæçëæçëæçëæçëæçëæçëæçëæçëæçëæçîèëÊÉÁIJ¬|ÿ©›eÿ®œdÿ°eÿ¯žiÿ°¡lÿ³²„ÿÌËŸÿÿÿÿÿÿÿÿÿÿÿÿßÎ˹éµÿë¥zÿè£zÿé£zÿè£zÿè£yÿã°‘ÿÐŽÊëíîëììëëìëëìëëìëëìëëìëëìëëìëììêëëæéêîïîîîìééêèåèéæééçééçééçééçééçééçééçééçéìéí½¿µË•\ÿ€Bÿ„Aÿ„€Aÿ„‚Dÿ‡ƒDÿ“›fÿÆÉÁªÿÿÿÿÿÿÿÿÿÿÿÿàÕιú£yÿýŽZÿü[ÿý[ÿüŽ[ÿþ[ÿûœvÿθ«óèõõ%ðûúïúùïúùïúùïúùïúùïúùîúùïûùæììâççîïîîîìèéêããæëéîèçìèçìèçìèçìèçìèçìèçìéèíéç﩯Ÿðt|8ÿbfÿcd ÿbcÿbeÿafÿy†MÿÌÐÊÿÿÿÿÿÿÿÿÿÿÿÿßßÙ‘ô£|ÿý‰RÿýˆSÿþˆSÿþŠVÿüTÿþ›iÿÕ¯ ÿÙééëûùéøöéøöéøöéøöéøöéø÷êøøêóóäééãçèîïîîîìèéêÝÞßäâæéçêëéêëéêëéêëéêëéêëéêíëìáÞãC™ …ÿmt(ÿ^`ÿ]_ÿ]^ÿ\^ÿ[_ÿ{‡PÿÔØÔtÿÿÿÿÿÿÿÿÿÿÿÿèçå^ñ©ŠÿýŠUÿý†Sÿü‡SÿþŠWÿüWÿÿšfÿݨ“ÿÅÏΧëðõçìðèìðèìðçìðèìñçìïâæéçêíäééãçèîïîîîìèéêÞßààßãäæãîðëìíêìíêìíêìíêìíêðòïÍÌΡ”mÿlq"ÿacÿ^aÿ\_ÿ]_ÿ]`ÿŠ“dÿßáÝPÿÿÿÿÿÿÿÿÿÿÿÿóóí#ì¹¢öþZÿþ†Rÿù‰RÿÿŠVÿýZÿÿ˜dÿÿº±«èêîöñõúðóùðóùðôùîðöéçìáâæçëîäééãçèîïîîîìèéêÞßààßãÝàÝíñêîñïìïóëîòëîòíðôéì类§í‰Rÿmnÿeeÿ^aÿ]`ÿ]^ÿ]dÿ ¦‰ñðòíÿÿÿÿÿÿÿÿÿÿÿÿöôðë;¾ü“fÿÿ†Oÿü‰PÿþŠVÿü‘Yÿý˜`ÿÿ­ƒÿħšÿÂÍЛñùüíô÷íô÷ìôöéìîåäèâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóêíñìêëñíðòíïññôöÈËÒ›”ž€ÿ‚‹6ÿlmÿdfÿ]aÿ]_ÿZ^ÿeo,ÿ¿Å®¼õöóÿÿÿÿÿÿÿÿÿÿÿÿïôôéâÜjó¡}ÿþˆQÿþˆPÿþŠVÿü‘Xÿþš`ÿÿ¤sÿÿ¨¥žöçâç2õïóðêïåèéçèêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëêîèèçìððîôóòãæå@¢Ÿö–Ÿfÿ{€!ÿmoÿceÿ^_ÿ[^ÿY]ÿxƒOÿÜâÑlñöìÿÿÿÿÿÿÿÿÿÿÿÿîîëííè긟îùWÿþˆPÿþˆVÿþUÿþ˜aÿü£hÿÿ¹ŠÿÓ®œÿ«¨©ÓèééàßââçèèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïéåãéëéëîì짩©Øœ¥{ÿ‘•<ÿy{ÿknÿbeÿ^_ÿZ\ÿ\cÿ ¨ˆîïõéíóæÿÿÿÿÿÿÿÿÿÿÿÿî÷óîøõïÙÍ­úšjÿüˆQÿþ‡TÿþTÿý“_ÿø£fÿý¯vÿÿäÿ´£›ÿ¬ª¬ÀââååêëèéêååéâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞïóëëïééçíëè«Ì—›„ÿ «Vÿ…ˆÿwxÿfmÿaaÿ_^ÿX^ÿnx;ÿÎÓÅ~îôïéðéÿÿÿÿÿÿÿÿÿÿÿÿëÿÿéÿÿññï1÷¶—ôüŠYÿþ‡RÿüŠUÿþ\ÿü›dÿý«pÿü¸‡ÿüÊ®ÿ²–ÿ Ÿ ×ÚááKîïðææêâãççëîäééãçèîïîîîìèéêÞßààßãÞáÞñõíòõïÝÜãJž ŸØ•›€ÿª´fÿ•&ÿ ÿorÿahÿ`]ÿ^]ÿ[fÿ˜£~ðãæÝàãÚàãÙÿÿÿÿÿÿÿÿÿÿÿÿëýþêýþôöïðÝÏ÷žvÿþ‰RÿþˆSÿþŒVÿý“`ÿÿ¢kÿü°xÿþ¿Žÿüѱÿ´¦šÿŠŠˆÿº»¼¤ååé(çéíêîñåêêãçèîïîîîìèéêßàáãáæäçäéîç7¼¿À·Š‰‹ü¡ƒÿ²»eÿ•Ÿ,ÿ‡ÿyzÿhlÿ`aÿ^^ÿY^ÿuGÿÕÛÏxíñîèíèèíèÿÿÿÿÿÿÿÿÿÿÿÿôöíôöíõõëööí õʯÑû‘`ÿþVÿûŠTÿû[ÿÿ™bÿÿ©mÿþ¸{ÿþÄÿÿÒ³ÿÝÀ®ÿ›‘†ÿŒŒ‹ò´³·µÕÙÛmàåå9æëìòóòóóðììîÝÞà*ÔÓÖ_±´²±ˆŠùŠˆƒÿ²´€ÿ¸¼Wÿ›¡,ÿ‘!ÿ€ÿppÿbfÿ^aÿY`ÿ`j)ÿ·¾žÏøýó ôùñóøñóøñÿÿÿÿÿÿÿÿÿÿÿÿø÷íø÷íø÷íùùîûóâ-òµ—îý‘_ÿý’bÿúŒZÿý‘Wÿþœdÿü¬uÿþ»ÿÿÅÿÿÒ£ÿüÙºÿй«ÿ¢‘‰ÿ‰ƒ|ÿŒŒ‰ÿ—––ñ›š™î™ššî”–—ð‰Šù…zÿÿ¬¯ƒÿ¿Çfÿ®¶9ÿ¢#ÿ”"ÿ‚„"ÿtsÿefÿcdÿcdÿ[cÿ˜Ÿzñïñå0øüîõúêõúêõúêÿÿÿÿÿÿÿÿÿÿÿÿüøëüøëüøëýøëþúíûìÞOõªŠóû—fÿÿšoÿý”aÿø“[ÿü›gÿþ¬tÿü½€ÿýȉÿýÍšÿÿÖ®ÿÿÛ»ÿïÒ¸ÿÛŲÿð§ÿ¶«©ÿ­© ÿ§ªŒÿ³¸ƒÿºÂzÿ¾Æfÿ³»@ÿ¦«)ÿœž)ÿ‘”$ÿ€†ÿqvÿfjÿjl&ÿrr.ÿ\fÿˆ‘büãæÙVùùòõõíõõíõõíõõíÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿúòúæÝVô«‹öýœpÿ÷©zÿù uÿþ˜jÿøœgÿû§oÿþµzÿýÂ…ÿþËŽÿþИÿÿÔ ÿÿØ©ÿÿáÅÿüçÝÿìä½ÿÍÒoÿ¶¾=ÿ¯´,ÿ©¬&ÿ¢¥$ÿ˜$ÿ‰Ž!ÿ{~ÿnrÿpq'ÿ‚>ÿ‚…Cÿai%ÿ\þÞåÓgøüñöúí÷úî÷úî÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìÿóñúäÜNð´Œöú¢{ÿü±‘ÿú³ÿû°…ÿø¬|ÿ÷ªvÿù®wÿû¶}ÿûÀ„ÿýɇÿþÍŽÿÿÓ©ÿöÚÌÿàÕ¨ÿÀÀLÿ¥ª ÿ›$ÿ“—!ÿ‰ÿ€… ÿ}€,ÿ‚†<ÿ’Oÿžœeÿ‘ŽUÿfl.ÿšiúÜáÐ^ôùéúÿðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþ÷ðûîß?ø¼¤Õø«†ÿû¾˜ÿûäÿýĤÿþÅ¢ÿüÄžÿüÀ˜ÿü¾“ÿúÀŽÿúÀŽÿùÄ£ÿîйÿÓÊ™ÿ±¯Vÿž9ÿ›ž<ÿŸKÿ¡¢\ÿ¨¨oÿ­¬}ÿ°°„ÿ¬¯†ÿ•Vÿox7ÿ¢¦„áèñÝBëðâîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿùëþõåöмœñµ—ÿú¿ ÿýÍ´ÿüÑ»ÿüÒ¼ÿûÖ¾ÿùÙÁÿùÚÁÿúÚ¿ÿøÞÇÿöâÖÿèÞÈÿÑÒªÿÇÊ¡ÿÊÈ¢ÿËÉ¡ÿÇÆ¢ÿÆæÿÄâÿ³¶Šÿ‡\ÿ}†Yÿ¾È©«ðôåï÷äçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿôäÿòæýíÙKõεÃó¾¦ÿúÉ´ÿúÙÆÿùáÏÿüâÑÿýáÒÿýßÑÿþäÖÿúçàÿêä×ÿÙÝÅÿÒ×¾ÿÖ×ÀÿÚ×ÀÿÕÔ·ÿ½Â›ÿ˜ sÿŠ”eÿ®µ”±ßãÑHêòßïóäìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿúêÿ÷åûæÖ=õÔ¿—óË·æö̼ÿúÖÉÿüßÒÿùçÚÿöìßÿøñåÿóíâÿåäÕÿÕÙÄÿÆ˲ÿ´º›ÿ ¨„ÿž©…ê¼Å©ŸßçÔAßáÛèëÞäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþøëþøëÿ÷ìþïìþôíÿ÷éÿóãÿîáÿøçÿóàþòáÿñÞÿóäúáÍJõâΘñÖðòμÂøμÍíØÂÐÏÑ·Þ¸½¡ß­·˜Ö¸Ã£»Ã̵‹ÓÝÈQìôáîõåêòâÙÜÓæéÛäì×îòãìôàçìÝîóâùþðøýîøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€ÿÿÿþÿÿøÿÿàÿÿÀÿÿ€ÿÿÿþü?øøðð?þðÿÿàÿÿ€àÿÿÀÀÿÿàÀÿÿàÀÿÿðÀÿÿðÀÿÿðÀÿÿðÀÿÿøÀÿÿøÀÿÿøÀÿÿðÀÿÿðÀÿÿðÀÿÿààÿÿààÿÿÀàÿÿ€ðÿÿðþøøøü?þÿÿÿ€ÿÿÀÿÿàÿÿøÿÿüÿÿÿ€ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèìèèêîíôíìåÝÝ$¿»»~¡¦¥À‹ª¤ô~®§ÿ”±¬ÿ¬®§ÿ¬©ÿ¨§Ÿù¤¥¤Çº»¼…×ÙÙ-àâáåçêèèíçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóñëèèðììééè¾»¹ŽŒ¨£ð`±¥ÿKÏ»ÿCâÎÿ=èÒÿ•îßÿéäÆÿä×ÿÞÓ~ÿ˃ÿ±©‡ÿ¦£›ö±±´•ÝÞä(ííòçæçíòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôèöôè÷õèóññíîÞÔÖK“¤¡äc¿±ÿ@ßÉÿ,çÏÿ$àÈÿÙÀÿ×¹ÿsÝÅÿÒÐ¥ÿØ¿UÿØÁQÿÞËYÿäÓfÿÞÎyÿÁ·ÿ¥£ìÉÊÔdìëííòñêõòêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿç÷ôç÷ôçøõîø÷ÎÉÊg®¨÷HÖÂÿ+äÉÿÚ»ÿЭÿ É¢ÿ-É¢ÿJÏ«ÿ’ÜÄÿÕÓ³ÿÒºxÿǬ]ÿÄ©OÿË°OÿÕ¾SÿßÍbÿÕÇÿ¬§–ÿÆÆÉwð÷ôêöóêõòêõòÿÿÿÿÿÿÿÿÿÿÿÿëóñëóññ÷ö×ÖÖez²©ÿ>ÜÄÿ Û¼ÿΩÿ˜ÿ!»ÿ.½ÿ6½ÿ8¿ÿoË¢ÿ¸¼‘ÿ¼aÿ¾œ_ÿ¾œ[ÿ¹™Kÿ¼EÿÉ®LÿÖÀUÿÜÈuÿ´¬–ÿÆÌÌ}ó÷óîòíîòíÿÿÿÿÿÿÿÿÿÿÿÿòííöñðçÝÝ5‰³«ò;Ù¾ÿÕ²ÿÆœÿºˆÿ´xÿ±zÿ<½“ÿnұɖâË¥ÆìàdÕÛÁWÝΰÊ·Žº¸œfó­ˆBÿ±ˆ=ÿ´@ÿÁ GÿζKÿÖÃpÿµ­üÜÜÜCóöððñìÿÿÿÿÿÿÿÿÿÿÿÿïìíóìíª¾¹ÂCÒ·ÿÒ­ÿÁ–ÿ¶ÿ¯sÿ"´ÿ}׺ÅÍøíUÞýøÛþöóúþâæÕöïáöõåôðá/Ï›«°ŽPÿ§0ÿ¯ˆ:ÿ»šCÿʱIÿ̼tÿº¹²×ìîëïòíÿÿÿÿÿÿÿÿÿÿÿÿêííØÖ×Udñÿ!ѬÿÀ“ÿ³ÿ­qÿ6¸ŒÿºëÝ‹ëÿÿÝÿöÔùñÒûðíøúàäÒóëÚòïÝ÷óâùõâèäÑW²–\ø¥|0ÿ«‡8ÿ»™Bÿ˯LÿÀ±‰ÿÑÏÔqïîïÿÿÿÿÿÿÿÿÿÿÿÿíèéªÅ¿Ç7Ì«ÿ–ÿµÿ®sÿ!³ÿ®æÕ÷ÿÿäÿûØýóÔùñÒûðíøúàäÒóëÚòïÝöñàôïÙþýôçàÎa®Pü¨{2ÿ­ˆ9ÿ¼š@ÿȱcÿþ­Øçæé ÿÿÿÿÿÿÿÿÿÿÿÿååå0tðÿÆšÿ¸„ÿ®vÿ¯rÿ†Ó»Éñûøëüùáýø×ýóÔùñÒûðíøúàäÒóëÚòïÜ÷òàõòáøõìûùõÖË©¦¦6ÿ¨~5ÿ±‹<ÿÁ DÿÀ¯ƒÿÚÜáRÿÿÿÿÿÿÿÿÿÿÿÿ×ÝÜfIƧÿ»‹ÿ²{ÿ¬qÿ3¸‰ÿØñîMòýýìüüìýýêÿýÖúóÑûðíøúàäÒóëÚóïÛöñæòðæòïçôòêëéâ0±˜aý¦|/ÿ«ƒ8ÿµ‘<ÿÁ¨gÿÒÒÐÿÿÿÿÿÿÿÿÿÿÿÿ¹ÒË¡(À–ÿµÿ¯uÿ «qÿhȧèðõóíöóìöóìöóïöóÛöîÒüòíøúàäÒôìÜïïâîïíîïëîïëîïëðòñŸ—Õ§|1ÿ«~5ÿ°‡6ÿ¸šJÿÍȹÁÿÿÿÿÿÿÿÿÿÿÿÿ¦ÎÂÈ ¼Œÿ³{ÿ°vÿ°yÿ—Ï¿­ïéëäææäææäææäææäææâðîëùùßåÒíëãêîïéíîéíîéíîéíîìñõÓÍ»ª…<ÿ¨5ÿ­…8ÿ´‘DÿǼ¦Ùÿÿÿÿÿÿÿÿÿÿÿÿ²ÍÃËdØÿa½ÿ]»Žÿ`À”ÿ·ÒÉ—ßÚÞÙÙÛÙÙÛÙÙÛÙÙÛÙØÛÙØÚåëìèìèèçèèççèèçèèçèèçèèçëëìÙÔʈ¶ždÿ´•Yÿ·˜\ÿ¹ bÿŽ¨çÿÿÿÿÿÿÿÿÿÿÿÿÜÊÁÈâ¬ÿá¦}ÿà¦|ÿ૆ÿ×Ì­åêëåèçåèçåèçåèçåèçâåäéëëîíìéæéìèëëçêëèêëèêëçêïëðÍÍÅ“Tÿ‰„FÿŠ†IÿŠŠKÿµº¡Ôÿÿÿÿÿÿÿÿÿÿÿÿæ϶ÿŽ[ÿÿˆTÿÿŠUÿÿ‘^ÿÛº©êçúúíúùìúøìúøíúùîúùäëëêììííìâãåéçëëéîëéíëéíëéíïíô´·¨Êfl$ÿ]_ÿ]_ÿ\dÿ¯¶»ÿÿÿÿÿÿÿÿÿÿÿÿëÞÖwú‘bÿý…Pÿý‰Tÿÿ’ZÿÛªÿÜæë7íñ÷êïôëïõèíñåéìâççêììííìàáãáááëìèìíëëìëíîìççê$š€ùfiÿ\_ÿ[]ÿ_dÿÁƲŒÿÿÿÿÿÿÿÿÿÿÿÿòëå5÷ yÿþ…MÿýŠTÿÿ“[ÿð§ÿÇÇÇ©ñøýñõúîòöæåéäæéâççêììííìáâäÞßßéîæíððìîòñôøÇÌÍ’‰Sÿijÿ^aÿZ\ÿmt8ÿÜÞÔ[ÿÿÿÿÿÿÿÿÿÿÿÿíòñÙý†Nÿþ‰Sÿý”Yÿÿ§uÿȬšÿØØÛIñïóæéêåäèäçêâççêììííìáâäÞßßêïæêëëññòâäç5Ÿ¦÷€…+ÿhjÿ^`ÿTXÿ‘™míðöëÿÿÿÿÿÿÿÿÿÿÿÿîõñîßÔqû’`ÿÿ†PÿþYÿü£gÿù¹ÿ¹«¦åÑÓ×8ëîïååèäçêâççêììííìáâäÞßßêïæððñàÞä+§© ß–Mÿz|ÿeiÿ]]ÿ\dÿÂɲƒïôîÿÿÿÿÿÿÿÿÿÿÿÿéÿÿíûû÷²“àþ…Oÿþ‹Vÿý™bÿÿ²{ÿﾟÿ­¤ŸóÃÈÊkæçë êíñäêêëííîîíãäæäååîóëÏÏÖ^¡£›ç ª^ÿŠ#ÿpsÿ`bÿXYÿŠ”dìäèâ!äçáÿÿÿÿÿÿÿÿÿÿÿÿòùóôúòôç×PùœoÿþˆQÿüŽZÿÿ¢hÿÿ½ƒÿöÉ¥ÿÀ¬ÿ¨¥¤Î»½¿Ð××Pâåå0æææ.Ö×Û@¼½Âx¤¦¨È ¢ÿ«¯Tÿ–š&ÿ|}ÿegÿZ\ÿfo.ÿØßËeøý÷ò÷ïÿÿÿÿÿÿÿÿÿÿÿÿû÷ëû÷ìüýñø׆ú•gÿý‘`ÿü”[ÿü¦nÿÿ¿„ÿÿÔ¡ÿèƪÿ¼§—ÿ²¨Ÿÿ¯¨§ÿ§§¢ÿŸ¤ÿ™Ÿuÿª¯aÿ±·=ÿ—œ ÿ}ÿjlÿfgÿ_g!ÿµ»ž«ûýóöøìõøëÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþùëÿûòøͼ•ùŸsÿù¢uÿüžoÿú¥mÿý·yÿÿÈŒÿÿןÿÿÙ«ÿúÞÐÿÞÙ§ÿºÀGÿ¯´/ÿ ¥ÿ‹ÿy}ÿwy,ÿ<ÿgo,ÿ­¸”³ûüô øüï÷úî÷úîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþ÷íÿõòøÖ¿†ú®Œþû·“ÿüº•ÿûºÿûº‹ÿûÀ‰ÿüÆÿùÒºÿÒÊŽÿ¤¦1ÿ—š0ÿ•˜?ÿššXÿŸ¡kÿ–š`ÿ€ƒJÿµ½ž¡ðõè úÿðøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿóîÿùíûåÕGõèÛûǬÿüлÿúØÂÿúÙÂÿûÛÃÿùáÓÿãÜÄÿÉ̦ÿËɦÿËɨÿ¾¾œÿ£©|ÿ’špåÑØÀeò÷éíòãøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿôæÿôâúÞËcöѽ¿ùØÇóúÛÍÿøßÒÿøéÝÿèäÖÿÎÓ¾ÿÇʱÿ¼À¡û­¶“ÈÃ̱yãç×ðõäêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿþøëþøëþøëþöìÿòíÿõèÿñâÿõäþïßÿñßýìÛ$÷èÖj÷ÓÃ…ôÓÁ‘Ë̵ŸºÁ¦œÌÕ¼pÙãÏ.íõãêðáãæ×ëñÞêðßìñâøýîøýîøýîøýîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀÿÿÿþü?øðàààøÀ?üÀ?þÀþÀþÀÿÿÀÿÿÀÿÿÀþÀþÀþÀ?üàøààðøüþ?ÿÿÿ€ÿÿðÿÿÿÿÿÿÿÿÿ(0 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèòñëééïðïïäãËÄÅ^¨º·«ˆ¹±Ô“ºµä¶·¬æ·´¢×¹¸²±ÄÅÈhÖØÚêëïçæêìñïêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿèöôè÷õèóòòííÖÒÒT“·±ÕUÀ±ÿ;ÛÆÿ%àÉÿiæÓÿßÙ§ÿßËdÿØÊsÿÁ·ÿ³¯ŸÝËÌÒaèèííòðêöòêõòÿÿÿÿÿÿÿÿÿÿÿÿçöôèøöîõôÂÄÄ‚a¿³ÿ,ÞÄÿݽÿѬÿ(̧ÿlÖ¹ÿÍÈ™ÿÍ°ZÿͳPÿØÀUÿÝËfÿ¿µ†ÿ¿¾¿•ìóòë÷óêõòÿÿÿÿÿÿÿÿÿÿÿÿîòñôôôÉÍÌVǵÿ"Ú»ÿÉ ÿºŠÿ%¸…ÿ9À‘ÿqЬóÀ¿•í¿ždÿ·“Pÿ·”DÿÂ¥EÿÕ¾Vÿȹ}ÿÄÅÚñõòïòíÿÿÿÿÿÿÿÿÿÿÿÿöðñâÜÜ‹F}kkk$  Á¶*—}qiiéÑÅÅEBaõFõYl…„((íjii¹nnùY&_xã[OÝ^þúλ.—ÝöââÂÂOìT¹€ŒzÁج,étZ|«§·÷M»ÃùÃçŽ7NwPì´Åòþ‡§=¹tú­«cc?››³Ã6«\3¡Ö}UÎÕ~7Èb¤FGŸŽF–οþû?tn ‰µ_ýûÚø7عᣠ¥R©ZckTëœå:¾à»RKÔ1´dìÊ•{ççÿxæü%{] ¸pù£¹ÙÙAåðQ Ý+!FÔÎL„EP@ú…ªßƹ«WÇÍf3Çh‹ÅI[(.§ó±h4jçÀ¾ @C¥4œç‚q½*ÐXylx>Àè5¤ð¨Í K&“”H$†‰èdÝঅ|~;¤² P*`º§ºMKrƒàfÌÚÇÏ;¨»»'TW X_[¥ýCèÃSïW¸Ú±\£–}ãë(`%¡ª>rø°xc] (𻻺hÿþ!»R›«IT¶{-¼E¤c«f}Ñàà:öÔS´¾‘ º€’fõÿÒ_¦¦p˜Îž9Ö&Àz½ZÏãج¶RïWt„‡}•zä0ù¼¾º p0z{zèøsߣ3##455YMpT霆îy³ (Á4Õ‰hoo§'Ž<ÉQ†²|Ëí"”z lº³³ƒ"‘=öøcüá'èò?.cèAcRX39æáÎ,|% ,‘ þ ~ED‚‘XŒúv‘ý6ÉÛC€.ápX4ÐçóÑC}Ž9B‘h„®ÓÄÄ­¬¬ÜžÁ€pW«ër* AQƒ(Ë(àÙþþÚ=¸›Zš[èæÌ ÍÞš£¾¾~¶ýVA‘ Õ¶ zrß¾}BØO?ý”J,ÌÁƒéñáaò¸=´¼¼L ‹ ´Âu<'9= ¨!pûo¯×K@€üŒP0HMMMÔÚÖFM¡m&S_]e2ò”f-ص{T^iŽ±måm'ÀàÅÑP½!0-ætíÝ»—v±ªzø\…òùüäpòd§PäçdÍ=ŽT?_ÈS&aa7YÕ…ÊS,¶ÂÚµL{¸çwîÜ©¾½YÛ¥;§a ¨hqoƒAq=ÏjYŠPž{-šŠ±Ê ‡ãRï)¢ÄÈ÷áº?$Ÿ?(Εeã½ÂjígøÀ¥í%@ ]-’ÓÇ6›êi‡Ýkü\Y¨¹ ÷)ç'aYÿ笽+kyÂ@ÿø©k€õØ0 «OŠjy¿|‡îb£XŸi0J¬Sc‰^–.ÝJ3ÊšDSFÇ&Q¢†VÏkõ PciÇ ü Ðp{–'Í‚HB÷²p¢ð¥`@^kø( `ÅìŽî9‚ãøNHÖ(‹îÕ òãÈfxîn9A‹ hû•(Ý‘ ¨Þ—š`_øT¾¸ {o‹háAžþ ÖIPƒ°ü]ý<}l¶ö ’rÐá®v‚ZôµÆkju¬®™ ›»‰Òúú:Š™zsQ@„À!<­“ ²VÂÿëQ5ØL>À ´H4J´_…@ÖöQGÇš]X²G”¡åÕ8O„ÑÊH2´àZ~xÿ{.`¯“XIçd”ÇuœŸ_Z¢|±L©\®|2N‰íÙÕ¯²ó¤ˆ—»(Àa/¯= DæyE\.ÈàðSÁ€º¶hU-³cB‰rÙÅ×Öy‚ä%„È^ŸÕ?A¼‚Ìh²<ǼÑäÔü~L••)’úo0\n¤TEIÖ‘XË^*¨×§ 81Ð×+ê’.Ź­½]hEQ;AEŽ*¤Ú96Š€ «ñ8&Bj ÁaVó–æ0¡ йc‡&MÖÈ ’ÜÜÔÚ¥HÐ& Ý 9!r÷5êßÅÙd¯×G²(è½®K0à7KÁ`€cžæççDÒ%NU3&ô.òcæaã·šÌ`¥yDdˆVãk¢ñm­-"{+Fù<çöØ!¨ ®={Ž\l:—›"Ñ(õôôj´ÔÃnC2BšŠÚ¤·xù\¤Â–¹÷BÁ¯ã7óyýÖŠ•À 9…îêìTù¨ýøø5¶§ ˆJÂL°¡³«Ë†@¨a>À¼ jÐdp:Y(8¿÷þôôMâQ´wÏ ›€ú¬Å‰Aº[œìtº=r-ªŒ Lk¿á£€Exy¹<$AUŠ  4 QßúÚZÍ…H¤¼ñz^ y)F5·éœ@C5#‚«¨HŠ†BM†yÃ鵨HÛÙÓ-‡¿" ˆ@A*ÞP¬Ô°QTÒìÛ1¦.ÊXOÀÒ5m¥ »ÜÞÖª´ïonnÖÎ×äuB¤Óa©æQN+9JPµ²çÇd§ Ôœ¢à½~&ap÷.>. “Œw"õ.¿or‚¿£€Áª$E”x=CÈ÷«¼AµÂ;Ï„óDÁŠ÷ ç—JSwO ÂPô\@O—©±&`6ÄîÐ%h¨)„!9‚°ÊNrƒÉ”úžÁ:äìì,Ï%ÖXø6³£S£jtF¨šÈ­.âÕb‘d3‘Ðé—P „Èåæì-Êå týúuZYcö(Æ—Çûgaí’dª´0Òð„zZÀÅáJ‘eÒi&ªHÑXëzâúèè(ZŽóxá2 FïCH¨<„Fà$ŽmÅ2&Nšh£„¦É˜~7&–àØœRö SH²*A*x‹T`ÞÑÙ%Ëñó Sã¹ùE—øzYkæ  *û¶Î¹Ö‘ ÞQwP¶„¼V°ÄÐ\‡ðº”Ñ`¨06,Tܱ ïóy½È €e:Z~o«§ Øy8òøý~ÃGä&¦Š hu.É]ý<´¥}——!Ü79YøîŽJp½gp€Êüì¹sç8¸sÀ|@¥¼­«Ãš¼/•N»¤l…zà‰ÅbaŒ¿&oÀZ ìÞºdVRYaLwSéL”P²¾ «›g‰é™Œ˜,%³i‡¦×IAëüÀ½ù\ÉWØœ‘ø¼&€W‡x—è³ð²W fP A%9Pƒ4i–¿Ãa‡)FŠ·I’UPä¾"˜ T¬òÕ…€VE€UðaCP¤{Vg…$ ŸUü>¯rvZ’ L ?ÓlP…á¹l¾š·B€s 8ÙJ•Ò_Ò†ÐXöˆLdj|í‚»4™åê& ¿•ÚXÀûá7Ð^7®~^ À§r§NšâžF Ì&`èy¾0 m ÀV‹T96šj}_UŽ gÏœ¹ND4·lpzëÚÛo¿}Åà´ ˜·¶|ƒ\5Q»X}€x´H~O|_iØÇÿsúÌé‘ËD´ŠWÔƒ€MƵ—_~ùÍ‘‘‘iSBÄøà7ÂnÚŸ£T_¨¥ØË'·Á1±Ù·ìÄDIúÌà±ãLìÍf„ÍK(¿uòä^øå[ÅBáM2Òõ „ Ñcm:qâÄ:çì?óÌ3óf'H0HJu¸1hœi1ÓÓ!²ßôO[¬Š*UïÛYèäf’ ÍR¸çâ…‹±W^91:zùò"ÐÎ8šSÏÉPQ¾tdÌÌÌ̽ôÒK×î¹çžƒÃÃÃî»ï¾nlšQ Žô^ Sú>•Ê2úÜ“–÷=³H&7 —.]ZúóŸÞàݹŸ\%"m»)U?¿³Á¢|y–±Â˜¾qãÆ8c/‡Éƒ‡º÷À}CCCígù/“óJÚVG{;IEND®B`‚synergy-1.4.12-Source/src/gui/res/icons/64x64/video-display.png0000600000175000017500000000502311271253201024032 0ustar synergysynergy‰PNG  IHDR@@ªiqÞsBIT|dˆ pHYsììu85tEXtSoftwarewww.inkscape.org›î< IDATxÚí[ÍkÙÝ£‘4Ò|ÉÎŽVÒFbå8N Ä8 >ådð!¹„œ øä¿"ÙÓb샯9|Èe¾™ø’b0–×X³‰4ߟÝ][õüF?ºFÓ’<­…Èzvé½~SýôêW¿ªz-µ<"2ïsóYÎ8à=n3zâÁƒtåÊS«ÕÌ«W¯ŒçyÆ÷ýE> 75NøLÍ¥Ù¢(“¥¥%³¸¸hž?nnÞ¼é%pîÜ9sùòeS­VÍp84™LFŒ•>6>5¯€˜ ‡5":ôó0 Åhé÷eeeÅ”J%Ón·g@¿ß7ÙlÖ,j FƒD¤7•`H‚ñ)2A¯ãö/6‰=‡ç€ÓW“m›9Lé“?ÿͬn}ßÁË"ôxn4¶< wkLé$ µ_Í—_üÛüá·¿Šå‡cPÞøžÙøÉMglrãˆ(ÛalÞõƒ0HlGáigHÓ0QBÅ\Hò•n’ì<˜!žc¹9¹@Dmà»áùÞôÈö­ýäl´–óXŒ$Íg³G𰌕. —¢,ªXq (IÏO@D`©ó®A`³£} ì$¼m+ŒH±Â#ž]`“Ð%¶ßK€0BÈF#Ùb[oÞ6Ћ¼¼ V WÌɽXw¼IGÞ†'-Í èŒP UÌð¶½zH(Fnp´„འºTúŽâXÇ6t°á}J“® î^¥gœÑÛêÂè½D.`Íä2xX# ŒoÔöˆmÉá5îaŒq9èUJi9=°z&¾ŸN È€¾ ¾b„ŒJŠ%Mky˜s9ß ¬€“Y8D—d·Çés@äs—Á€x8FyÆ(oC9EU w˜ú«õcëª/€òÔw›ÐFCFÃHèiFÚH0‹p €V¼iÀ95ßlBÜcÐ!1‡‰$ cDzÚû(½%¬7Z+D$È Д†÷µ1ãqì rÆ`=£J"ÁûcÆ£ÄòW”Üé€s@ª¦Ž±„˜tת¾S̳¨ïdç ‡|‚Ò©×#ž@ùØù!ˆF'5í1xÈʳ0’Ee|xIrl=€Zk‰v !`Èå€ý¬«s6©Ø6±j¡O‡Lëq§’¤ºëáxŽõl”'áöФ”Bw¡b=b9€áüp¸žÎ4¦gŽJºC"+Aô6„䧛ÉNŸ °yåEu6pzˆQéÇõTˆW”a÷Y²áÉz*'¤Á{ dyxÇiPB=vz:b멧AU]ô"pÞCWt9L+Phô³¼¨=«ÉÒMÈîF×wR±­r€\†"ôÖÛ¬c©'UîÒ*ƒöðÐ;áÅ6¥ôGÀ$Pè¹D‡Sh ž¦xˆà(úá ¹ƒÒ(ƒõ/؉L6ÃÊÏŠÍÃÌÁÛ(±2ÈP"8%]#Ë©0ÂÃ’§N¤ú@äL§ ôdú0Æd<Ã7üßx>ÙÞŽ=ßøЋ?šîrÿl•Õ)öhš[p`t\o´¥t¦HPGÉ ¸£HǬVQ\ƸÏèd¥˜¢ âQÌhÄ7ôÆÀÁ#µ0*‡!_åO㔌'!l›ÐÃñYy{Âz(±j`ñŸF’껢䑼(cè™8}鸬À}j½sê=‘•D/‚1²B±éˆ¬Ðë)(VÈ øÉ¿ƒ;+ ŠkoO\ÏÚ¤×Ã3‰bE*瀄ÓT2+°aíÅiX¡ GŽ™À ?å@{WV$–0€£ R¬P€a Ntr!0+P:ÇK%lô)€iV¤—e¥©XáŒ92+`P+T!Ǥô4(§»tBC³B—0ÍŠñã®~Ða”þ9@·a…I>õiV¨£ÆÒztÌ°ñÆœ|S/\àøŒy°B×£ •cÂ^›/ ÇàáÇû¯Â}z£Ïã@®µŒ¿&™4b¯ÉmooÛïyþüyY˽"·dß {ñâ…¼#8€SО={fèv»¦\.›k×®%hŸBêõºÙÚÚ2NG^îœîUÙ^¯gvwwc×o‰:yWªkÚO›››æñãÇvOW¯^µo¹º7Fm¸±H·oôïîß¿ÿ#"z277gäý]Ù }…µÕjYi6›Çº}ûöï̉¶o>$>7+•Š5¼P(ˆÈ«¹öÅì½½=˼3??¿*ú§ ñì†$©b±8ñ¾Ä­õþ¨år¹•Óø÷’/–Xu$Žóù|öÿž÷îÝ˲g‹,NpE‰€åååŸ ígggBho_k___7¯_¿¾x÷îÝŸÏÌ̼â{¬Ûà×¼sçN×LצK‚=*³‡ÖyS뼩oÑ:O‹HÌ–XŠN b“A“-1n wños$ÄÁ``CÁ%A ùÌþ¡ƒjKƒˆZÒó>êÜ¿aÙfyÉ×Û,/9¯¼¼~ýúÏÑÔð‚þ­[·~úñÖÖ_¶>¾XZ][5ËœÈÊKe3Ï›×mÏM–N‡ã;8Ó‡,Ï7ÍÓ§O {ÖdXlÏ€rj0à>0.\0kkk¬“É0c²oAË30&ª1ˆCó¿Ý=+»{5>4wû½Þóë_þ¿T¢h208+¡á$#ýÆÆFžOW?¸xñÒÏëƒ–Ê¥ï ¥ ÅbP,;ùüb& ƒYß3³3?ÃfJç¸Ôå@õ)ßóg¯Z`¦i´;Ãf£ÕoµÛ=®ía§ÝËõƒ<ÛWe ¿hw;ÿhìÕ>ÿ×??úÙg­:Á‰¥ 7IÂ,a‚pŸ»qã›—.}÷£W×V2o™½X †ƒJÐÿ°ÛiŸ«Õö²³³sÄ@Q‘…“›·˜/x ´àq¶7ó¹yñº0GŒ”p ^¯Kì=î{:_ûlhÔj6kÝÞ øÙÿFÁ°‡Už{óÕNõÍ“'ÿÏÎΗ-14Aú,{D&1`æ-`€bÆ“z'|Ø™ãX^(—rÅr!Ç XáR8W*-ÍW*”—+Ë•F£QçúÿU£^ð¸Wo5úÍZ³ÇG\–ÝŽô,]çI-ÁÄ^×C–K‡FŸýå(ËgœpÀ{Û¾@Î<ÐÎî›IEND®B`‚synergy-1.4.12-Source/src/gui/res/image/0000700000175000017500000000000012140644175017737 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/image/about.png0000600000175000017500000001151512005052225021551 0ustar synergysynergy‰PNG  IHDRŽ$_z€tEXtSoftwareAdobe ImageReadyqÉe<ïIDATxÚì\ypUzÿúœéž«g4‡$K3’,K²,[2ȇ°±ÇÇ‚ Ë,0Ø„T’­­¬È?IU¶ ‘ªd«’lð.Ôf³Ô.b—l6YX¦ÀòYƒÁ26>$[’%[Ö5šûìžî¼–zP{vf4’­ =ÕW3ÓÇë7ïýÞ÷ý~ï}#Ì`0Bz‰„°ãñ¿ƒÕîƒàXœ;ó)”U/£ƒ“Ç߃Îj¬®q½ÅÌÙ,Ã]EkV,6qF‘½tõ|¨ããÃ>R¯¿šdtÄ+¢ú’‚Ë@tdŠÊÊáÀû¡ûx'Ðè˜$I­ô÷ôÃ|ùj2Ÿ‹0 O@,¶•U-_YZZ²©ÈfXm·UW¬²’¸1ÁÖ«W­—|¡ÀÐèøè>?–àcˆ¾àq´¡ùîþI!ð°…ÎêG­Vî‘ÚšªÛL: 5èN„ÀqšÄÇXÐR…`åãXÌ’, 9ÊŠ†TºûGŸºÜ×ýŽ‹¿–áÙÍwû78¢˜Þ¼zóΖg**k7[Œ€KhØýtd`!3PPº×À‚¡IOR %4à´–0Záîs—6‘¥°“¤ ðt¤ùÎÿ†Q’yIp‚xL_±æGœQgMðWF…$€¸ º›BV΢Špbè*Ðñ8°¨ªÇAÓ`×2`çìÚ¾$öí>!XÏh4¢ß’(Êqp~¾ŽÀåÁ› LEA«¡Ál]ð=}Iã?Çâ38FÀPXÒ °zäetÈЫ^PLã@&(! ¡ ) ÁH0ƒHçF½@Çâ`'I°"ù£R¥sëÿ¥eØ¿üä݃¯:NRäüH|Í æ(,V‘`Lf+4®k޳槟ñIðÒ$XÌf“  Ð‚@ƒEdd©®¡DÔïIˆ _ÒQ|ÌÀ2q‹™ ê ÐŒÀøè(ˆããó€…0>™„:§mtìС]ýzÞõ{'xzé¹Ð3?B_Uc±:&} -÷¶?¹náí{þõÒ °ÈQNN‚ÅŒÀbCVŠÔûøÅ3üÁcôøG¯|Á0dÃhÇ’H ò«%ÃAGœçr¶‚%M·¸œ%ø9’˜ïñÀˆß/Àñî+6÷æ?GÞ펓Ç>½@Äüh|­BU2ù¥z¢(Æ\²tÛ¿ôŽi-(ÚÂ…&=ò6…ÈÛX‘ä>ö?¿»è¹zþÀòåKß¿¥y×›Í6βúA’¢ d8Ö ZOžø¤öó7ß¹£¸Òµ© qEé'èà!ˆGãp¢oØYãtþP:üñN Çg¬¶Ün·úc²ÝÊk™êx²díÈ|óC~“€£7™'q"†-;ÿæ¯ÂtéJŸ†Äu!àØ‘§Ñù¯ˆ÷ÿò=g±å×»Zþúx©Ó9Œî‹Â¤Àú’(éõzÜQè]ÚPßÛ{©çä[í¯ýaàÝwŸX¹víÊc‚(\ñHIFÇàpÞ]·¦ñ;gŸ|YÃ22‚gú8d{‘=žåüzå\ @óåf'‚ä³LMœ¥Ä^ý­?ï—Èœ(Àˆ¼.<&§íÍ5«ê~²íÞŸ#À5.fRñÈ8Ž Uö~·å)ï«¿ýïá‡>Uß´rÝG Ép094 Iè÷éÅeåO2_¼žˆ'˜¼043ÐÈ`¨W>ûÏÒ§|n2ÓüPßdàôtŸAJ*»¾û;#¸Å)G<®²™©$\8úú±Æ†Êç¶Ý{ßgèž2^YÂɹ „,NQ”÷G>ƿ؆}~ö ®ÜU±ìœ×;‚À  CÌU´²¨²üŽÏ~ø:ÅhÁðçÛþÝ*м¤|ÎvÝ|˜º‰/-«§³\[Tµö®@É*IYZA¦Ó¢)ÜûÙ ü yšS hy€F]dï¼ÿ;}d°_½~"N¢üùq‚#‘8£+)Þâª.'-] /ÿê?',š£ò4»s\׆¬s~¸o¢ÇyüáfèôU[XÏ—ëq22t˜ÃÝGÞzø¾M‡iZUÂÓlJœaÙ ûö ^~ïÍöâ’{üè 8L>ÏŠ‚™a›V5Ù­fëàö{¶ç[oƒŠÿ_5ï›A[8Uû}³6§<·3GßpÊûΛíqq-%AQiu­@Øy~ÂÑL¬Ë<'<Öã71Â[Kê–yO#Îò92ùÅ‹k8œ~[ ²ü–ez),^Ã,dtzWac&õ¦©>MI嚤ØÞi®íT®ëKû²µ*uÉüªÙAÅz•cÜ4m¯ñªî;© lKŽþK=·Lñ ^å¾Ö´k[•ºNªê÷*÷pªºÜª0ž:¶;þ–¯kǯ^„$ΖK˜Nƒù„¨‘º¼˜ëîî*YPx …y—áF6'å‡%)¶Ù?•¼ãý4r7Rrò29çqÂJÄK|ð¡™ÔÛžö¾!0\VÞ7OãERÜioŽÁ_¯„ÉSi*®cЬW…ØÔ½26@·åPò¹§UbಪþÇÓúKÝoþ<úD>çJ݃ßîÞ„•ÙQ`¢Áj‰P ÁnzúºŒãˆñ½›DÑ´¤gØ>*í/·Ú Èl’‚(±XÀn¶W`)Ž„éëóÙÄÚ«ê˜zÕ ä¦¹”NhÈA¦Õƒ‘^R±t‡*䔧µ¥9‹4)µ!˽ßWyƒLíZ¯b‡b)¶¨uJ©³LUÿ>`ÕŧÔöž»Yö6|Ù²[(3j¨vvBó8T—~UÎÑë9ˆÏc!Ϊ²ü¼uà@¸Ð讨l€•Ë ½®®j€åu ×š¸¤$ÊKÈ3Ñän¥SRåiÅ¥fzÖµLœ—rpƒæ´ºúÒÀâÎX“ê\GÚ½nÕÌÏ2d°?£ n»bª•ò2î´›jÛ©i&S6¯Ã©ŽOL$\H…“—p ÿDê' σ@ Wâ9 Ø.âÍ÷~ƒƒAÈfñD’R’brb*W „Cpæ|4-8ˆ$MAïyÉ©ÁRÞ䀙l™û”/µG†L €:3 `Ÿ hÍY€èÊámR3º# ¸œFÜÓä¥,„V=ó³yNikU­9ÀÞš#„ŸÊÚfUý #išÁD! Å>ƒ@ÂqDeHA8ʬ%ÿôý׈žE¼n“yÐm¿ÿ·{aÇC›€ÔAÏ5T8Š ˜¥ ä÷^聯ù‡½ÏAÅâZ笖®!?QÄ¥À´"à„ q<¢cXb–|ªM±ÝJ¹;¨€ª-íÚíJg¤{ŽÝª™Û‘·ÊWncRñ§ÖÜ 2ܯà\ËÓµ­sšþ{V%4ú2ôÉ¡Ôq’Õ²ÀPV/ž¤% —°„4Ée‘ Øœ…K Æ'ÆÕÀ‰„`41°l¥ì àya"wX‹õÇ—‡àÈk¿ý/ýŠ–sz¦$bßåÕ5E ·í©¾ì‰"U%BÃ&) %^äô¬ñ MÐiS:¯Uá ry®ßrhW€áÊœæi¼Íl —Fž×ϲžŽ<=ðt*4p@5ùR`^ŸÞ'¤Ñdµ„½_¸ËŽë(v‰r²V”G!_Ùä®h:óéàïq|jÇ”›mIIÛN4)7íΠ@šÓf–i€“澊«Ø>%Œ>žœëHñ—N€ÕQ`6:{¤h‡Aƒ¦!1 Ñ@˃ˆã¿]º' G–  vYT/³ÃØpøD2c_ù’º °D‚ˆ"n ú¢)}õº;½6—§!€ÔÐ`di`ãÁ+E6û’¢D¸yyÉmªØÝá\ŠíNë¤}s¸¨¸Wðt6ÅG¥+ΖL‰”ùŠÃ^2pµËqžsš Íâ/8"¼$‘4.ª ßõПÝÚÜ{Ñ×D i’ˆÅ˜cöDCa°•”ÂÚ»î…ÁÞn1p.¹eWÄPº&8€¼…'- " ºxè´£¨hX‘ýs‘‘lÊà¶)n¸Y ÛçÈÛt¤ ^Ûx‹lj/‡ÊÕÎTß­´Ó•i=K–½É…•®q1Rr †ñŸ6ÞØUæÖ­ìMf]•¼@¨7i2fëýñª8)‡!£œ%Å•·¹6ÞßÚ3ä’’= …T›LFC#>›Ž>jw8ü3ô6-yÌ°z±Ë6ö§‘âö9 Q©-˓͘-9êmÍÓ#¦ÚÙ’NŠÕÀŒ&]ÌY\wôZ·í\Þ #PØ"!‹Aê­ÙôPÁ/ z¦"™Y‰…‚PXêZ±øÞ'^¨ xLí]½³ÏjQMuâšl½Ê3œG=êu.S:)VG. äuü+7¾}âCK.«‘†K©$Ç ’e Þ¼täWË܆ßJIi#¢ÐZdÊßäN÷D“$£ÎdÚ~ç÷~ðfÔµâß/$§ì¹XX­YœÅ !sŸý~ÍÚµG5­œ²1ÓÝ÷gT n™Š|î)Ƚy§Ô\’â”j{F5Àõiò<Õ^˜¥×qÃõ{_©ºýÊs[ó¬«mº‰”ú]Š<ËcMM—º».þòÃý‡›+ÄE  h…“(1¤ Â„Ç@ê‚ê«Œ÷0„©+§?¥ðH¯(ñ‰pBÔB±êÂU[n IôÂq£ù?ñkO†c€AD˜22ˆ'` ‡£û÷ÔPSõòâ%Kaæy>)÷ß S© eªY“oªBÙ ¼M>kLî<Û솩ԇN¥Í7ðÜxT– Q©´Š|Õ—ebýpä"ºï¾m¾ðÂðO¼ýÅßnض¨DCöæQÈ"~ÿþª:~Ëmˆfë($Åqd1’<ˆrÒ¾ñá'àXƒS¼rvMÀ"³£Š´ƒÒå#ï÷/¿½yÓæWîغõsŠ¢B0õ àOœ½J¹Uòô)˜>ê«^:T$ûLe"6Àõ{c™’ú;`*µ#Õ';r…n,Ç?6¤=w®«xß¾·š.œÙâZ+kÈÅ¥ šÕE€¦`èÛ€Ï#:¸áLÄ ú!q­?:xúd¿ÿÊÀѺ%KlÝv÷‰²²ryu8•QxCái–ÀéHëÈç±øu(­ªµ¨LůLŽLÊ*}öLºs'UÅØS§‹9¶¸§§k¹ˆùkYc²ÄdÂ8ƒÁ¡ÅñR<ÃE¯ÏI„žx(د¥©³555ëÖ»ÏV.Z4*+7Èþ{¬?pv«\p;|³~ýÀeY™N­哧ӖÐÈ8êð%{!zlÔ£ëíí/¸zõZg|œ ½z1™ hŠ z}Ðf³yK]ecN§Óg⸰–ö0óå«SþW€–dÁHâµ÷IEND®B`‚synergy-1.4.12-Source/src/gui/res/lang/0000700000175000017500000000000012140644175017576 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/lang/gui_ar.qm0000600000175000017500000000016012006005561021371 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBÏi9E9DHE'*InfoSettingsDialogBaseˆÿÿÿ$ ÿ,synergy-1.4.12-Source/src/gui/res/lang/gui_ar.ts0000600000175000017500000012357012006005561021415 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info معلومات Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_az.qm0000600000175000017500000000002712006005561021403 0ustar synergysynergy<¸dÊÍ!¿`¡½Ýˆsynergy-1.4.12-Source/src/gui/res/lang/gui_az.ts0000600000175000017500000012353312006005561021424 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_ca-AD.qm0000600000175000017500000000002012006005561021627 0ustar synergysynergy<¸dÊÍ!¿`¡½Ýsynergy-1.4.12-Source/src/gui/res/lang/gui_ca-AD.ts0000600000175000017500000012353612006005561021662 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_cs-CZ.qm0000600000175000017500000002444412006005561021721 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB`^bÀj+[SWfY¾uÆ4§¤C´ÇbÏ"VERV¥"«`!¶ÞÐ+Ô*»*»&*Ð%Í*ì0ý+Œ+«`bJ¹·!4L™b!âX·¹ÇxýôùÁx.äÆó;N pu>B(Z ;= î ònbjÈ°¯4 ·º¾þ^ÒÉ Ev.¨w9`­ÃÒº¨”-º¨”Ę …H¦”ŠO é$ O é%]à"¬ÂVE¨¸ÓåYu:"Ul_”*}× ƒ«›¡!l«›¢!§Ä:Ó‚Ä:ÓØäöž³ç¹ÔMñ$Z Ë@d[攄/(ÿ$Â( n.4.d?{㛀¡ªØžŽÄ SÎzýéJž òëêž—=ñT ›‚ï|µÞ%//lY$[€Ânß»ó&÷¸‰1 dö¹Ü Ö„~î ȹX aº®Ÿ |ßÚ‘ ŒFå ŒFåà ÈcÄ àKG˜ RVŽn RVŽä RVŽ RVŽ%r R÷® Tƒä> šÚ§ §|*Ü »sä »s#) ÞF¤© ^® i!Î › rù+ zkÙš ‰P#j è]^ & ^#¨=‰¢ ’r}/åŽ9Ó> ^ò¬Šúi%ªOk&OkAboutDialogBaseO Synergy About SynergyAboutDialogBaseNeznámáUnknownAboutDialogBase Verze:Version:AboutDialogBaseNastavit akciConfigure ActionActionDialogBase:Uzamknout kurzor na obrazovkuLock cursor to screenActionDialogBase8Stisknete klávesovou zkratkuPress a hotkeyActionDialogBaseNStisknte a uvolnte klávesovou zkratkuPress and release a hotkeyActionDialogBase6Uvolnte klávesovou zkratkuRelease a hotkeyActionDialogBase$PYepnout na plochuSwitch to screenActionDialogBase0Tato akce se spustí kdy~This action is performed whenActionDialogBasedolodownActionDialogBase vlevoleftActionDialogBasevypoffActionDialogBasezaponActionDialogBase0jenom na tchto plocháchonly on these screensActionDialogBase vpravorightActionDialogBasepYepnouttoggleActionDialogBase nahoruupActionDialogBase Zmnit&Edit MainWindow Soubor&File MainWindow &Pomoc&Help MainWindow&Spustit&Start MainWindow&Zastavit&Stop MainWindowOkno&Window MainWindow€<p>Je dostupná verze %1, <a href="%2">navatívit stránku</a>.</p>C

Version %1 is now available, visit website.

 MainWindowDNemohu ulo~it soubor s konfiguracíCannot write configuration file MainWindowLNeplatný název konfigura ního souboru.Configuration filename invalid MainWindowDNelze ulo~it nastavení do souboru.%Could not save configuration to file. MainWindow0Nevyplnn cílový po íta Hostname is empty MainWindowŒProsím vyplHte adresu cílového po íta e ke kterému se chcete pYipojit.?Please fill in a hostname for the synergy client to connect to. MainWindow4Program nemo~e být spuatnProgram can not be started MainWindow*Ulo~it nastavení jakoSave configuration as... MainWindowUlo~ení selhalo Save failed MainWindow8Synergy klient nebyl nalezenSynergy client not found MainWindowSynergy neb~í.Synergy is not running. MainWindow&Synergy se spouatí.Synergy is starting. MainWindow8Synergy server nebyl nalezenSynergy server not found MainWindowÒNeo ekávané ukon ení Synergy. návratový kód %1. <br><br>Prosím zkontrolujte soubor s výpisem pro detaily.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow2Synergy ukon eno s chybou Synergy terminated with an error MainWindowNProgram pro synergy klienta neexistuje.5The executable for the synergy client does not exist. MainWindow^Spouatcí soubor pro synergy server neexistuje.5The executable for the synergy server does not exist. MainWindowäProgram <br><br>%1<br><br> nelze úspan spustit. Prosím zkontrolujte máte-li potYebná práva ke spuatní programu.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowNeznámáUnknown MainWindow&O Synergy&About Synergy...MainWindowBase&Pou~ít&ApplyMainWindowBase&Procházet &Browse...MainWindowBase*&Soubor s nastavením:&Configuration file:MainWindowBase &Nastavit Server&Configure Server...MainWindowBase &Konec&QuitMainWindowBase&Spustit&StartMainWindowBase.Interaktivní nastavení:Configure interactively:MainWindowBase VýpisLogMainWindowBase KonecQuitMainWindowBasePYipravenReadyMainWindowBaseB~íRunMainWindowBase Spustit provodce Run WizardMainWindowBase,Ulo~it nastavení &jakoSave configuration &as...MainWindowBaseNastaveníSettingsMainWindowBaseZastavitStopMainWindowBaseSynergySynergyMainWindowBaseNeznámáUnknownMainWindowBase8Pou~ít existující nastavení:Use existing configuration:MainWindowBaseNepojmenovánoUnnamedNewScreenWidgetbSynergy nastavení (*.conf);;Vaechny soubory (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject`Synergy nastavení (*.sgc);;Vaechny soubory (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject*Nezvolen název plochyScreen name is emptyScreenSettingsDialog&PYidat&AddScreenSettingsDialogBase&Mrtvé rohy &Dead cornersScreenSettingsDialogBase&Opravy&FixesScreenSettingsDialogBase&Odstranit&RemoveScreenSettingsDialogBaseDolní-vlevo Bottom-leftScreenSettingsDialogBaseDolní-vpravo Bottom-rightScreenSettingsDialogBaseVelikost ro&hu: Corner Si&ze:ScreenSettingsDialogBasePrázdnýNoneScreenSettingsDialogBaseNázev &plochy Screen &name:ScreenSettingsDialogBaseNatavení plochyScreen SettingsScreenSettingsDialogBaseHorní-vlevoTop-leftScreenSettingsDialogBaseHorní-vpravo Top-rightScreenSettingsDialogBase&Mrtvé rohy &Dead cornersServerConfigDialogBase Zmnit&EditServerConfigDialogBase &Nový&NewServerConfigDialogBase&Mo~nosti&OptionsServerConfigDialogBase&Odstranit&RemoveServerConfigDialogBase6Pokro ilé nastavení serveruAdvanced server settingsServerConfigDialogBase4Ulo~it soubor s výpisem doSave log file to...SettingsDialog&Pokro ilé &AdvancedSettingsDialogBaseF&Automaticky spustit server/klienta"&Automatically start server/clientSettingsDialogBase&Vzhled: &Interface:SettingsDialogBaseÚroveH výpisu:&Logging level:SettingsDialogBase<&Spustit Synergy po pYihláaení&Start Synergy after logging inSettingsDialogBaseProcházet Browse...SettingsDialogBase LadníDebugSettingsDialogBaseLadní1Debug1SettingsDialogBaseLadní2Debug2SettingsDialogBase ChybaErrorSettingsDialogBaseInformaceInfoSettingsDialogBase$Ulo~it do souboru: Log to file:SettingsDialogBaseVypisováníLoggingSettingsDialogBasePoznámkaNoteSettingsDialogBaseNastaveníSettingsSettingsDialogBaseVarováníWarningSettingsDialogBase*Prosím vyberte volbu.Please select an option. SetupWizard$Instalovat Synergy Setup Synergy SetupWizard0&Server (nové nastavení)&Server (new setup)SetupWizardBase&Server nebo klient?Server or Client?SetupWizardBase$Instalovat Synergy Setup SynergySetupWizardBaseNeznámáUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_cs-CZ.ts0000600000175000017500000012753612006005561021740 0ustar synergysynergy AboutDialogBase About Synergy O Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Neznámá Version: Verze: &Ok Ok ActionDialogBase Configure Action Nastavit akci Choose the action to perform Press a hotkey Stisknete klávesovou zkratku Release a hotkey UvolnÄ›te klávesovou zkratku Press and release a hotkey StisknÄ›te a uvolnÄ›te klávesovou zkratku only on these screens jenom na tÄ›chto plochách Switch to screen PÅ™epnout na plochu Switch in direction left vlevo right vpravo up nahoru down dolů Lock cursor to screen Uzamknout kurzor na obrazovku toggle pÅ™epnout on zap off vyp This action is performed when Tato akce se spustí když the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &Spustit &File Soubor &Edit ZmÄ›nit &Window Okno &Help &Pomoc <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Je dostupná verze %1, <a href="%2">navÅ¡tívit stránku</a>.</p> Program can not be started Program nemůže být spuÅ¡tÄ›n The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Program <br><br>%1<br><br> nelze úspěšnÄ› spustit. Prosím zkontrolujte máte-li potÅ™ebná práva ke spuÅ¡tÄ›ní programu. Synergy client not found Synergy klient nebyl nalezen The executable for the synergy client does not exist. Program pro synergy klienta neexistuje. Hostname is empty NevyplnÄ›n cílový poÄítaÄ Please fill in a hostname for the synergy client to connect to. Prosím vyplňte adresu cílového poÄítaÄe ke kterému se chcete pÅ™ipojit. Cannot write configuration file Nemohu uložit soubor s konfigurací The temporary configuration file required to start synergy can not be written. Configuration filename invalid Neplatný název konfiguraÄního souboru. You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found Synergy server nebyl nalezen The executable for the synergy server does not exist. SpouÅ¡tÄ›cí soubor pro synergy server neexistuje. Synergy terminated with an error Synergy ukonÄeno s chybou Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. NeoÄekávané ukonÄení Synergy. návratový kód %1. <br><br>Prosím zkontrolujte soubor s výpisem pro detaily. &Stop &Zastavit service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy se spouÅ¡tí. Synergy is not running. Synergy neběží. Unknown Neznámá Browse for a synergys config file Save configuration as... Uložit nastavení jako Save failed Uložení selhalo Could not save configuration to file. Nelze uložit nastavení do souboru. MainWindowBase Synergy Synergy Screen name: Unknown Neznámá &Server IP: &Start &Spustit &Server (share this computer's mouse and keyboard): Use existing configuration: Použít existující nastavení: &Configuration file: &Soubor s nastavením: &Browse... &Procházet Configure interactively: Interaktivní nastavení: &Configure Server... &Nastavit Server &Client (use another computer's keyboard and mouse): Ready PÅ™ipraven Log Výpis &Apply &Použít &Elevate IP addresses: &About Synergy... &O Synergy &Quit &Konec Quit Konec Ctrl+Q Run Běží Ctrl+S S&top Stop Zastavit Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Uložit nastavení &jako Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Nastavení Edit settings Run Wizard Spustit průvodce NewScreenWidget Unnamed Nepojmenováno QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy nastavení (*.sgc);;VÅ¡echny soubory (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy nastavení (*.conf);;VÅ¡echny soubory (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty Nezvolen název plochy The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Natavení plochy Screen &name: Název &plochy A&liases &Add &PÅ™idat &Remove &Odstranit &Modifier keys &Shift: Shift Ctrl Alt Meta Super None Prázdný &Ctrl: Al&t: M&eta: S&uper: &Dead corners &Mrtvé rohy Top-left Horní-vlevo Top-right Horní-vpravo Bottom-left Dolní-vlevo Bottom-right Dolní-vpravo Corner Si&ze: Velikost ro&hu: &Fixes &Opravy Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Nový &Edit ZmÄ›nit &Remove &Odstranit A&ctions Ne&w E&dit Re&move Advanced server settings PokroÄilé nastavení serveru &Switch Switch &after waiting ms Switch on double &tap within &Options &Možnosti &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners &Mrtvé rohy To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... Uložit soubor s výpisem do SettingsDialogBase Settings Nastavení &Advanced &PokroÄilé Sc&reen name: P&ort: &Interface: &Vzhled: &Start Synergy after logging in &Spustit Synergy po pÅ™ihlášení &Automatically start server/client &Automaticky spustit server/klienta &Hide when server/client starts Logging Vypisování &Process mode: Service Desktop (legacy) &Logging level: Úroveň výpisu: Log to file: Uložit do souboru: Browse... Procházet Error Chyba Warning Varování Note Poznámka Info Informace Debug LadÄ›ní Debug1 LadÄ›ní1 Debug2 LadÄ›ní2 &Startup SetupWizard Setup Synergy Instalovat Synergy Please select an option. Prosím vyberte volbu. SetupWizardBase Setup Synergy Instalovat Synergy Server or Client? Server nebo klient? &Server (new setup) &Server (nové nastavení) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown Neznámá synergy-1.4.12-Source/src/gui/res/lang/gui_cy.qm0000600000175000017500000003705612006005561021420 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB^Àå+[SWUY¾ìuÆЧ¤#»´Ç(1Ï1éG×.ÖVE%ÑV¥2(Œ«`L¶Þj+Ô›*»ù*»'¨*Ð%)*ì0W+Œ_+«`¼GË.NL™b1³UÛ`¬X·¹´xýô§Áx.Iä ëØ>*¸ó;ö}Scu>®(Z = î Ânbj·°¯4¯º¾þÚÒÉOEv.Ö_þ!¿º¨”‰º¨”_˜ W;H}¼H¦”&ùO é3&O é4»ÂVE ”¸Ó&Tl_” }× všl®5¨öé'=° Î+Šäöž ö±É¸"QJË@d$Ú攄(ÿ4\( nŒ4.d&°{ã(l€¡ª©œ6>JžŽÄ'Îz–Îç>ªéJž1uëêž £3=ñTi‚ïàŠÁ„AµÞ%°ãC#þ/lY3ñ}F•/€Ân3ŸC0ã»ó)x÷¸‰! ÖjØ IÞ_½ v®~-Œ ”0 -5  OøŽ"¿ P¢n/­ dö¹"V ~5Ó/M ¤hÞ7ý ±¥z“ Ö„~ ȹ >î5 |ßÚ& ŒFå$U ŒFå(³ ® ¸(ï àKGì R÷®æ Tƒä 5 V½4× šÚ€ «c)+ »s »s2] Äcþ0p ÞF¤%. ^®‹ /ó$“ i!Î ‡ rù/ zkÙÒ ‰P2  è]^, ^2Ü=‰ô ’rw/åŽkC.Šk£'ä®ú.)ïÓ>Nò¬Š%}ýù3wi:Iawn&OkAboutDialogBase Ynghylch Synergy About SynergyAboutDialogBaseFersiwn:Version:AboutDialogBase6Dewiswch y weithred i wneudChoose the action to performActionDialogBase$Cyflunio GweithredConfigure ActionActionDialogBase.Cloi cyrchydd i'r sgrînLock cursor to screenActionDialogBase(Gwasgwch fysell brysPress a hotkeyActionDialogBaseDGwasgwch a ryddhewch y bysell frysPress and release a hotkeyActionDialogBase.Ryddhewch y bysell frysRelease a hotkeyActionDialogBaseNewid cyfeiriadSwitch in directionActionDialogBaseNewid i sgrînSwitch to screenActionDialogBaseNMae'r weithred hwn yn cael ei wneud ganThis action is performed whenActionDialogBaselawrdownActionDialogBase chwithleftActionDialogBasei ffwrddoffActionDialogBase ymlaenonActionDialogBase2ar y sgriniau yma yn unigonly on these screensActionDialogBasedderightActionDialogBase0pan wasgir y bysell frysthe hotkey is pressedActionDialogBase4pan ryddheir y bysell frysthe hotkey is releasedActionDialogBase toglotoggleActionDialogBasefynyupActionDialogBaseXRhowch y manyleb ar gyfer y bysell frws hwn:'Enter the specification for the hotkey:HotkeyDialogBaseBysell frysHotkeyHotkeyDialogBase Golygu&Edit MainWindow Ffeil&File MainWindowCymorth&Help MainWindowDechrau&Start MainWindow Stopio&Stop MainWindowFfenest&Window MainWindow<p>Mae fersiwn %1 ar gael nawr, <a href="%2">ymwelwch a'r wefan</a>.</p>C

Version %1 is now available, visit website.

 MainWindowBProfi am ffeil gyfluniad synergys!Browse for a synergys config file MainWindowFMethu sgrifennu i'r ffeil gyfluniadCannot write configuration file MainWindowHMae enw'r ffeil gyfluniad yn annilysConfiguration filename invalid MainWindow<Methwyd cadw'r ffeil gyfluniad%Could not save configuration to file. MainWindow:Mae'r enw gwesteiwr yn bodoliHostname is empty MainWindowrRhowch enw gwesteiwr i'r cleient synergy i gysylltu iddo.?Please fill in a hostname for the synergy client to connect to. MainWindow2Methwyd cychwyn y rhaglenProgram can not be started MainWindow.Cadw'r cyfluniad fel...Save configuration as... MainWindowMethwyd cadw Save failed MainWindowFMethwyd dod o hyd i gleient SynergySynergy client not found MainWindow2Nid yw Synergy yn rhedeg.Synergy is not running. MainWindow.Mae Synergy yn dechrau.Synergy is starting. MainWindowFMethwyd dod o hyd i weinydd SynergySynergy server not found MainWindowÆFe wnaeth Synergy derfynnu yn annisgwyl gyda cod gorffen %1.<br><br>Gwelwch allbwn log am fanylion.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowJFe wnaeth Synergy derfynnu gyda gwall Synergy terminated with an error MainWindow‚Nid yw'r ffeil weithredadwy ar gyfer y cleient synergy yn bodoli.5The executable for the synergy client does not exist. MainWindow„Nid yw'r ffeil weithredadwy ar gyfer y gweinydd synergy yn bodoli.5The executable for the synergy server does not exist. MainWindow>Nid oedd yn bosib cychwyn y rhaglen <br><br>%1<br><br>yn llwyddiannus er ei fod yn bodoli. Gwnewch yn siwr fod ganddoch yr hawliau cywir i redeg y rhaglen yma.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¦Nid yw'n bosib sgrifennu i'r ffeil gyfluniad dros dro sydd angen i ddechrau synergyNThe temporary configuration file required to start synergy can not be written. MainWindowîNid ydych wedi llenwi mewn ffeil gyfluniad dilys ar gyfer y gweinydd synergy. Hoffech chi bori am ffeil gyfluniad nawr?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow Ynghylch Synergy&About Synergy...MainWindowBasePori... &Browse...MainWindowBasezCleient (defnyddio bysellfwrdd a llygoden cyfrifiadur arall):4&Client (use another computer's keyboard and mouse):MainWindowBase Ffeil Cyfluniad:&Configuration file:MainWindowBase(Cyflunio Gweinydd...&Configure Server...MainWindowBase Gadael&QuitMainWindowBasevGweinydd (rhannu bysellfwrdd a llygoden y cyfrifiadur hwn).3&Server (share this computer's mouse and keyboard):MainWindowBaseDechrau&StartMainWindowBase2Cyflunio'n rhyngweithiol:Configure interactively:MainWindowBase"Golygu gosodiadau Edit settingsMainWindowBaseLogLogMainWindowBase GadaelQuitMainWindowBaseYn barodReadyMainWindowBase RhedegRunMainWindowBaseRhedeg Dewin Run WizardMainWindowBaseDangos Statws S&how StatusMainWindowBase StopioS&topMainWindowBase.Cadw'r cyfluniad fel...Save configuration &as...MainWindowBase`Cadw'r cyfluniad gweinydd a gynhyrchwyd i ffeil:@Save the interactively generated server configuration to a file.MainWindowBaseGosodiadauSettingsMainWindowBase StopopStopMainWindowBaseSynergySynergyMainWindowBase@Defnyddio'r cyfluniad presennol:Use existing configuration:MainWindowBaseHeb ei enwiUnnamedNewScreenWidgetZCyfluniadau Synergy (*.conf);;Pob ffeil (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectXCyfluniadau Synergy (*.sgc);;Pob ffeil (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectVNid yw'r gilfach system ar gael, yn gadael.%System tray is unavailable, quitting.QObject,Mae enw'r sgrîn yn wagScreen name is emptyScreenSettingsDialog€Ni all enw'r sgrîn fod yn wag. Rhowch enw neu ganslo'r ddeialog.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogYchwanegu&AddScreenSettingsDialogBaseBysellau newid&Modifier keysScreenSettingsDialogBase Dileu&RemoveScreenSettingsDialogBaseFfugenwauA&liasesScreenSettingsDialogBaseGwaelod-chwith Bottom-leftScreenSettingsDialogBaseGwaelod-dde Bottom-rightScreenSettingsDialogBaseMaint Cornel: Corner Si&ze:ScreenSettingsDialogBaseDimNoneScreenSettingsDialogBaseEnw sgrîn Screen &name:ScreenSettingsDialogBase Gosodiadau SgrînScreen SettingsScreenSettingsDialogBaseTop-chwithTop-leftScreenSettingsDialogBaseTop-dde Top-rightScreenSettingsDialogBase,Gwirio cleientiaid bob&Check clients everyServerConfigDialogBase Golygu&EditServerConfigDialogBaseBysellau brys&HotkeysServerConfigDialogBase Newydd&NewServerConfigDialogBaseDewisiadau&OptionsServerConfigDialogBase Dileu&RemoveServerConfigDialogBase Newid&SwitchServerConfigDialogBaseGweithredoeddA&ctionsServerConfigDialogBase4Gosodiadau uwch y gweinyddAdvanced server settingsServerConfigDialogBasedCyfluniwch gynllun eich cyfluniad gweinydd synergy:Configure the layout of your synergy server configuration.ServerConfigDialogBasenLlusgwch sgrîn o'r grid neu i'r bin sbwriel i'w ddileu.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseBLlusgwch sgrîn newydd i'r grid neu symudwch y rhai presennol o gwmpas. Llusgwch sgrîn i'r bin sbwriel i'w ddileu. Rhowch glic dwbl ar sgrîn i newid ei osodiadau.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasefLlusgwch y botwm i'r grid i ychwanegu sgrîn newydd.1Drag this button to the grid to add a new screen.ServerConfigDialogBase GolyguE&ditServerConfigDialogBaseBysellau brysHotkeysServerConfigDialogBase NewyddNe&wServerConfigDialogBase DileuRe&moveServerConfigDialogBase$Sgriniau a dolenniScreens and linksServerConfigDialogBase$Cyfluniad GweinyddServer ConfigurationServerConfigDialogBase Newid ar ôl arosSwitch &after waitingServerConfigDialogBase,Newid ar ôl tap dwl ynSwitch on double &tap withinServerConfigDialogBaseNDefnyddio symudiadau llygoden perthynolUse &relative mouse movesServerConfigDialogBasePori... Browse...SettingsDialogBase GwallErrorSettingsDialogBaseGwybodaethInfoSettingsDialogBase NodynNoteSettingsDialogBaseGosodiadauSettingsSettingsDialogBaseRhybuddWarningSettingsDialogBaseDewiswch.Please select an option. SetupWizard$Gosod fyny Synergy Setup Synergy SetupWizard@Cleient (ychwanegu i'r gosodiad)&Client (add to setup)SetupWizardBase4Gweinydd (gosodiad newydd)&Server (new setup)SetupWizardBase*Gweinydd neu Gleient?Server or Client?SetupWizardBase$Gosod fyny Synergy Setup SynergySetupWizardBaseìDyma'r cyfrifiadur cynta rydych yn gyflunio. Mae eich bysellfwrdd a llygoden wedi ei gysylltu i'r cyfrifiadur yma. Fe fydd hyn yn eich caniatáu i symud eich llygoden drosodd i sgrîn cyfrifiadur arall. Dim ond un gweinydd all fod yn eich gosodiad.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseJRydych wedi gosod gweinydd fyny yn barod. Dyma'r cyfrifiadur rydych am reoli gyda bysellfwrdd a llygoden y gweinydd. Fe all fod amryw o gleientiaid yn eich gosodiad.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseˆ ÿÿÿsynergy-1.4.12-Source/src/gui/res/lang/gui_cy.ts0000600000175000017500000013205212006005561021421 0ustar synergysynergy AboutDialogBase About Synergy Ynghylch Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: Fersiwn: &Ok Iawn ActionDialogBase Configure Action Cyflunio Gweithred Choose the action to perform Dewiswch y weithred i wneud Press a hotkey Gwasgwch fysell brys Release a hotkey Ryddhewch y bysell frys Press and release a hotkey Gwasgwch a ryddhewch y bysell frys only on these screens ar y sgriniau yma yn unig Switch to screen Newid i sgrîn Switch in direction Newid cyfeiriad left chwith right dde up fyny down lawr Lock cursor to screen Cloi cyrchydd i'r sgrîn toggle toglo on ymlaen off i ffwrdd This action is performed when Mae'r weithred hwn yn cael ei wneud gan the hotkey is pressed pan wasgir y bysell frys the hotkey is released pan ryddheir y bysell frys HotkeyDialogBase Hotkey Bysell frys Enter the specification for the hotkey: Rhowch y manyleb ar gyfer y bysell frws hwn: MainWindow &Start Dechrau &File Ffeil &Edit Golygu &Window Ffenest &Help Cymorth <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Mae fersiwn %1 ar gael nawr, <a href="%2">ymwelwch a'r wefan</a>.</p> Program can not be started Methwyd cychwyn y rhaglen The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Nid oedd yn bosib cychwyn y rhaglen <br><br>%1<br><br>yn llwyddiannus er ei fod yn bodoli. Gwnewch yn siwr fod ganddoch yr hawliau cywir i redeg y rhaglen yma. Synergy client not found Methwyd dod o hyd i gleient Synergy The executable for the synergy client does not exist. Nid yw'r ffeil weithredadwy ar gyfer y cleient synergy yn bodoli. Hostname is empty Mae'r enw gwesteiwr yn bodoli Please fill in a hostname for the synergy client to connect to. Rhowch enw gwesteiwr i'r cleient synergy i gysylltu iddo. Cannot write configuration file Methu sgrifennu i'r ffeil gyfluniad The temporary configuration file required to start synergy can not be written. Nid yw'n bosib sgrifennu i'r ffeil gyfluniad dros dro sydd angen i ddechrau synergy Configuration filename invalid Mae enw'r ffeil gyfluniad yn annilys You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Nid ydych wedi llenwi mewn ffeil gyfluniad dilys ar gyfer y gweinydd synergy. Hoffech chi bori am ffeil gyfluniad nawr? Synergy server not found Methwyd dod o hyd i weinydd Synergy The executable for the synergy server does not exist. Nid yw'r ffeil weithredadwy ar gyfer y gweinydd synergy yn bodoli. Synergy terminated with an error Fe wnaeth Synergy derfynnu gyda gwall Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Fe wnaeth Synergy derfynnu yn annisgwyl gyda cod gorffen %1.<br><br>Gwelwch allbwn log am fanylion. &Stop Stopio service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Mae Synergy yn dechrau. Synergy is not running. Nid yw Synergy yn rhedeg. Unknown Browse for a synergys config file Profi am ffeil gyfluniad synergys Save configuration as... Cadw'r cyfluniad fel... Save failed Methwyd cadw Could not save configuration to file. Methwyd cadw'r ffeil gyfluniad MainWindowBase Synergy Synergy Screen name: Unknown &Server IP: &Start Dechrau &Server (share this computer's mouse and keyboard): Gweinydd (rhannu bysellfwrdd a llygoden y cyfrifiadur hwn). Use existing configuration: Defnyddio'r cyfluniad presennol: &Configuration file: Ffeil Cyfluniad: &Browse... Pori... Configure interactively: Cyflunio'n rhyngweithiol: &Configure Server... Cyflunio Gweinydd... &Client (use another computer's keyboard and mouse): Cleient (defnyddio bysellfwrdd a llygoden cyfrifiadur arall): Ready Yn barod Log Log &Apply &Elevate IP addresses: &About Synergy... Ynghylch Synergy &Quit Gadael Quit Gadael Ctrl+Q Run Rhedeg Ctrl+S S&top Stopio Stop Stopop Ctrl+T S&how Status Dangos Statws Ctrl+H &Hide Hide &Show Show Save configuration &as... Cadw'r cyfluniad fel... Save the interactively generated server configuration to a file. Cadw'r cyfluniad gweinydd a gynhyrchwyd i ffeil: Ctrl+Alt+S Settings Gosodiadau Edit settings Golygu gosodiadau Run Wizard Rhedeg Dewin NewScreenWidget Unnamed Heb ei enwi QObject Synergy Configurations (*.sgc);;All files (*.*) Cyfluniadau Synergy (*.sgc);;Pob ffeil (*.*) Synergy Configurations (*.conf);;All files (*.*) Cyfluniadau Synergy (*.conf);;Pob ffeil (*.*) System tray is unavailable, quitting. Nid yw'r gilfach system ar gael, yn gadael. ScreenSettingsDialog Screen name is empty Mae enw'r sgrîn yn wag The name for a screen can not be empty. Please fill in a name or cancel the dialog. Ni all enw'r sgrîn fod yn wag. Rhowch enw neu ganslo'r ddeialog. ScreenSettingsDialogBase Screen Settings Gosodiadau Sgrîn Screen &name: Enw sgrîn A&liases Ffugenwau &Add Ychwanegu &Remove Dileu &Modifier keys Bysellau newid &Shift: Shift Ctrl Alt Meta Super None Dim &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-chwith Top-right Top-dde Bottom-left Gwaelod-chwith Bottom-right Gwaelod-dde Corner Si&ze: Maint Cornel: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Cyfluniad Gweinydd Screens and links Sgriniau a dolenni Drag a screen from the grid to the trashcan to remove it. Llusgwch sgrîn o'r grid neu i'r bin sbwriel i'w ddileu. Configure the layout of your synergy server configuration. Cyfluniwch gynllun eich cyfluniad gweinydd synergy Drag this button to the grid to add a new screen. Llusgwch y botwm i'r grid i ychwanegu sgrîn newydd. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Llusgwch sgrîn newydd i'r grid neu symudwch y rhai presennol o gwmpas. Llusgwch sgrîn i'r bin sbwriel i'w ddileu. Rhowch glic dwbl ar sgrîn i newid ei osodiadau. Hotkeys Bysellau brys &Hotkeys Bysellau brys &New Newydd &Edit Golygu &Remove Dileu A&ctions Gweithredoedd Ne&w Newydd E&dit Golygu Re&move Dileu Advanced server settings Gosodiadau uwch y gweinydd &Switch Newid Switch &after waiting Newid ar ôl aros ms Switch on double &tap within Newid ar ôl tap dwl yn &Options Dewisiadau &Check clients every Gwirio cleientiaid bob Use &relative mouse moves Defnyddio symudiadau llygoden perthynol S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings Gosodiadau &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Pori... Error Gwall Warning Rhybudd Note Nodyn Info Gwybodaeth Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Gosod fyny Synergy Please select an option. Dewiswch. SetupWizardBase Setup Synergy Gosod fyny Synergy Server or Client? Gweinydd neu Gleient? &Server (new setup) Gweinydd (gosodiad newydd) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Dyma'r cyfrifiadur cynta rydych yn gyflunio. Mae eich bysellfwrdd a llygoden wedi ei gysylltu i'r cyfrifiadur yma. Fe fydd hyn yn eich caniatáu i symud eich llygoden drosodd i sgrîn cyfrifiadur arall. Dim ond un gweinydd all fod yn eich gosodiad. &Client (add to setup) Cleient (ychwanegu i'r gosodiad) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Rydych wedi gosod gweinydd fyny yn barod. Dyma'r cyfrifiadur rydych am reoli gyda bysellfwrdd a llygoden y gweinydd. Fe all fod amryw o gleientiaid yn eich gosodiad. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_da.qm0000600000175000017500000001130612006005561021357 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB^?À +[H4 SW=Y¾ÌuƧ¤ J«Œ AÏŒi«` /¶Þ«+ÔÚ*»Ë*» ¶*ì0ÿ+Œx+«``L™b ÒX·¹œYïÔ zxýôlÁx.ìö}S 7= î\nbj ̨w9<º¨”/º¨”®O é€O é$]à„Yu:9šl®äöžÂñ$Z 4-izÀ攄ø(ÿÇ( n €¡ª¸žŽÄÃéJž Œëêžs £3ã‚ï | ȹ ^ ŒFå ‰ ŒFå ö žýZ É àKGŽ RVŽ- RVŽº RVŽ – RVŽo R÷® šÚd »s ê »sù ^®X ‰PB/åŽÓ>gi¥&Ok&OkAboutDialogBase UkendtUnknownAboutDialogBaseVersion:Version:AboutDialogBase(Lås markør til skærmLock cursor to screenActionDialogBaseSkift i retningSwitch in directionActionDialogBaseSkift til skærmSwitch to screenActionDialogBaseneddownActionDialogBasevenstreleftActionDialogBasefraoffActionDialogBasetilonActionDialogBase højrerightActionDialogBaseopupActionDialogBase&Rediger&Edit MainWindow &Hjælp&Help MainWindow &Start&Start MainWindow &Stop&Stop MainWindow&Vindue&Window MainWindowVKunne ikke gemme konfigurationen til filen.%Could not save configuration to file. MainWindow0Gem konfiguration som...Save configuration as... MainWindowGem fejlede Save failed MainWindow.Synergy er ikke startetSynergy is not running. MainWindow Synergy starter.Synergy is starting. MainWindow UkendtUnknown MainWindow&Om Synergy...&About Synergy...MainWindowBase&Anvend&ApplyMainWindowBase&Gennemse... &Browse...MainWindowBase(&Konfigurations fil:&Configuration file:MainWindowBase*&Konfigurer Server...&Configure Server...MainWindowBase&Afslut&QuitMainWindowBase &Start&StartMainWindowBase*Rediger indstillinger Edit settingsMainWindowBaseLogLogMainWindowBase AfslutQuitMainWindowBaseKlarReadyMainWindowBaseKørRunMainWindowBaseKør guide Run WizardMainWindowBaseV&is Status S&how StatusMainWindowBase2Gem konfiguration &som...Save configuration &as...MainWindowBaseIndstillingerSettingsMainWindowBaseStopStopMainWindowBaseSynergySynergyMainWindowBase UkendtUnknownMainWindowBase@Brug eksisterende konfiguration:Use existing configuration:MainWindowBase&Tilføj&AddScreenSettingsDialogBase &Fjern&RemoveScreenSettingsDialogBase&Skift:&Shift:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase SkiftShiftScreenSettingsDialogBase&Rediger&EditServerConfigDialogBase &Fjern&RemoveServerConfigDialogBase"&Lognings niveau:&Logging level:SettingsDialogBaseGennemse... Browse...SettingsDialogBaseFejlErrorSettingsDialogBaseInfoInfoSettingsDialogBaseLog til fil: Log to file:SettingsDialogBaseLogningLoggingSettingsDialogBase P&ort:P&ort:SettingsDialogBaseIndstillingerSettingsSettingsDialogBaseAdvarselWarningSettingsDialogBaseOpsæt Synergy Setup Synergy SetupWizard(Server eller Klient?Server or Client?SetupWizardBaseOpsæt Synergy Setup SynergySetupWizardBase UkendtUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_da.ts0000600000175000017500000012471612006005561021402 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Ukendt Version: Version: &Ok &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Skift til skærm Switch in direction Skift i retning left venstre right højre up op down ned Lock cursor to screen LÃ¥s markør til skærm toggle on til off fra This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &Start &File &Edit &Rediger &Window &Vindue &Help &Hjælp <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy starter. Synergy is not running. Synergy er ikke startet Unknown Ukendt Browse for a synergys config file Save configuration as... Gem konfiguration som... Save failed Gem fejlede Could not save configuration to file. Kunne ikke gemme konfigurationen til filen. MainWindowBase Synergy Synergy Screen name: Unknown Ukendt &Server IP: &Start &Start &Server (share this computer's mouse and keyboard): Use existing configuration: Brug eksisterende konfiguration: &Configuration file: &Konfigurations fil: &Browse... &Gennemse... Configure interactively: &Configure Server... &Konfigurer Server... &Client (use another computer's keyboard and mouse): Ready Klar Log Log &Apply &Anvend &Elevate IP addresses: &About Synergy... &Om Synergy... &Quit &Afslut Quit Afslut Ctrl+Q Run Kør Ctrl+S S&top Stop Stop Ctrl+T S&how Status V&is Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Gem konfiguration &som... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Indstillinger Edit settings Rediger indstillinger Run Wizard Kør guide NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Tilføj &Remove &Fjern &Modifier keys &Shift: &Skift: Shift Skift Ctrl Ctrl Alt Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Rediger &Remove &Fjern A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings Indstillinger &Advanced Sc&reen name: P&ort: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging Logning &Process mode: Service Desktop (legacy) &Logging level: &Lognings niveau: Log to file: Log til fil: Browse... Gennemse... Error Fejl Warning Advarsel Note Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Opsæt Synergy Please select an option. SetupWizardBase Setup Synergy Opsæt Synergy Server or Client? Server eller Klient? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown Ukendt synergy-1.4.12-Source/src/gui/res/lang/gui_de.qm0000600000175000017500000005232612006005561021372 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBCA'^OÀL+[H4*ÕSWâY¾ wuÆ!§¤(L´Ç4<«Œ+òÏE±<¡.>G×=VE.wV¥FuŒ «`##¶Þ¹+Ôî*»J*»3³*Ð%„*ì0´+ŒÛ+«` GË<–Gíz*™J¹·DÑL™bEyUÛ`!IX·¹ CYïÔ/¬ZÆÂ/îxýôìÁx.fä {ëØ>8Vó|ö}S ú;NCãu>A(Z "= î nbj#Æ°¯4$º¾þ3Òɬþ0ÃEv.s_þ%êeë=‘¨w9ºª¸ú(“­Ã)&º¨”亨”˘€;H}ïH¦”0wO éH0O éI³]àF)ÂVE +¸Ó/HiCBUN™,+Yu:Eäl_” Ï}× $…Š*Ä@Tšl®x¨öé2Ø«Žø®«ã««M«›¡E«›¢E@° Î9LÄ:Ó(ÒÄ:Ó3aäöž rç¹ÔBñ$ZCö±ÉüÊJ-ÿ"QJ{-izFªË@d+ Ül .²攄 §(ÿIX( nç4.d0.@Ty,¡{ã4s€¡ªœ6>!ýžŽÄ†ÎzÎç>uéJžD…ëêžõ £3‚=ñTàk@d2‰‚ï!}ŠÁ„”µÞ% ãC)q/lYH÷}F•=K€ÂnŠŸC@¡»ó5ƒ÷¸‰%9 Öj@ IÞ_ JzFã kö#7ƒ v®~;° ”>ï -5 ‡ OøŽ&ú P¢n>ˆ dö¹& ~5Ó> ¤hÞLÅ ±¥z Ö„~¥ ȹ#R >îJ aº®AX |ßÚ.ô ŒFå)Æ ŒFå4¸ žýZ* ® ¸4þ ÈcÄA¾ àKG E RVŽv RVŽÎ RVŽ#Š RVŽNé R÷®e Tƒä$H V½4" šÚ³ §|*CO «c5@ »s"Þ »sG1 Äcþ?] ÞF¤+Y ^®Ø /ó*V 4pÄ@ dÙ-| i!Î z rù- zkÙ# ‰PGz àx46 è]^« ^G¶=‰]>ä 7=ôžƒm ’r/åŽt7å- kC<Ôk£3ù®ú.6RÓ>Ãò¬Š+ªýùHiO%&Ok&OkAboutDialogBaseÜber Synergy About SynergyAboutDialogBaseUnbekanntUnknownAboutDialogBaseVersion:Version:AboutDialogBaseZWähle eine Aktion, die ausgeführt werden sollChoose the action to performActionDialogBase(Aktion konfigurierenConfigure ActionActionDialogBase<Cursor auf Anzeige beschränkenLock cursor to screenActionDialogBaseHotkey drückenPress a hotkeyActionDialogBase8Hotkey drücken und loslassenPress and release a hotkeyActionDialogBase Hotkey loslassenRelease a hotkeyActionDialogBase(In Richtung wechselnSwitch in directionActionDialogBase&Zu Anzeige WechselnSwitch to screenActionDialogBaseDDiese Aktion wird ausgeführt, wennThis action is performed whenActionDialogBase runterdownActionDialogBase linksleftActionDialogBaseausoffActionDialogBaseeinonActionDialogBase6Nur auf diesen Bildschirmenonly on these screensActionDialogBase rechtsrightActionDialogBase8wen der Hotkey gedrückt wirdthe hotkey is pressedActionDialogBase>wenn der Hotke losgelassen wirdthe hotkey is releasedActionDialogBaseumschaltentoggleActionDialogBaseraufupActionDialogBaseLGib die Definition für den Hotkey ein:'Enter the specification for the hotkey:HotkeyDialogBase HotkeyHotkeyHotkeyDialogBase&Bearbeiten&Edit MainWindow &Datei&File MainWindow &Hilfe&Help MainWindow &Start&Start MainWindow &Stopp&Stop MainWindow&Fenster&Window MainWindowª&undefinedp>Version %1 ist verf&uuml;gbar, <a href="%2">besuche die Webseite</a>.</p>C

Version %1 is now available, visit website.

 MainWindowdNach einer Konfigurationsdatei für Synergy suchen.!Browse for a synergys config file MainWindowfConfigurationsdatei konnte nicht geschrieben werdenCannot write configuration file MainWindowfDer Dateiname der Konfigurationsdatei ist ungültig.Configuration filename invalid MainWindowlKonfiguration konnte nicht in Datei gespeichert werden%Could not save configuration to file. MainWindow(Der Hostname is leerHostname is empty MainWindow¨Bitte tragen Sie einen Hostnamen ein, zu dem sich der Synergy-Client verbinden soll.?Please fill in a hostname for the synergy client to connect to. MainWindowTDas Programm konnte nicht gestartet werdenProgram can not be started MainWindowBKonfiguration speichern unter ...Save configuration as... MainWindow0Speichern fehlgeschlagen Save failed MainWindowNDer Synergy Client wurde nicht gefundenSynergy client not found MainWindow(Synergy läuft nicht.Synergy is not running. MainWindow.Synergy wird gestartet.Synergy is starting. MainWindowPDer Synergy Server wurde nicht gefunden.Synergy server not found MainWindowèSynergy wurde unerwartet mit Abbruchcode %1 beendet. <br><br> Weitere Informationen können dem Log entnommen werden.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowNSynergy wurde mit einem Fehler beendet. Synergy terminated with an error MainWindowzDie ausführbare Datei für den Synergy Client existiert nicht.5The executable for the synergy client does not exist. MainWindowzDie ausführbare Datei für den Synergy Server existiert nicht.5The executable for the synergy server does not exist. MainWindowvDie Anwendung <br><br>%1<br><br> konnte nicht erfolgreich gestartet werden, obwohl sie vorhanden ist. Bitte überprüfen Sie, ob Sie die Berechtigungen zum Ausführen dieser Anwendung haben.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowìDie temporäre Konfigurationsdatei konnte nicht geschrieben werden. Sie wird jedoch für den Start von Synergy benötigt.NThe temporary configuration file required to start synergy can not be written. MainWindowUnbekanntUnknown MainWindowÂSie haben keine gültige Konfigurationsdatei angegeben. Wollen sie jetzt nach dieser Datei suchen?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow &Über Synergy...&About Synergy...MainWindowBase&Anwenden&ApplyMainWindowBase&Durchsuchen... &Browse...MainWindowBase|&Client (Tastatur und Maus eines anderen Computers verwenden):4&Client (use another computer's keyboard and mouse):MainWindowBase*&Konfigurationsdatei:&Configuration file:MainWindowBase0Server &konfigurieren...&Configure Server...MainWindowBase&Beenden&QuitMainWindowBaseb&Server (teile Tastatur und Maus dieses Rechners)3&Server (share this computer's mouse and keyboard):MainWindowBase &Start&StartMainWindowBase2Interaktiv konfigurieren:Configure interactively:MainWindowBaseStrg+Alt+S Ctrl+Alt+SMainWindowBase Strg+HCtrl+HMainWindowBase Strg+QCtrl+QMainWindowBase Strg+SCtrl+SMainWindowBase Strg+TCtrl+TMainWindowBase0Einstellungen bearbeiten Edit settingsMainWindowBaseLogLogMainWindowBaseBeendenQuitMainWindowBase FertigReadyMainWindowBase StartRunMainWindowBase&Assistent ausführen Run WizardMainWindowBase S&tatus anzeigen S&how StatusMainWindowBase S&toppS&topMainWindowBaseDConfiguration speichern &unter ...Save configuration &as...MainWindowBase~Speichere die interaktiv erstellte Konfiguration in eine Datei.@Save the interactively generated server configuration to a file.MainWindowBaseEinstellungenSettingsMainWindowBaseStopStopMainWindowBaseSynergySynergyMainWindowBaseUnbekanntUnknownMainWindowBaseDVerwende bestehende Konfiguration:Use existing configuration:MainWindowBaseUnbenanntUnnamedNewScreenWidgethSynergy Konfigurationen (*.conf);;Alle Dateien (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectfSynergy Konfigurationen (*.sgc);;Alle Dateien (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectbInfobereich ist nicht verfügbar. Beende Programm.%System tray is unavailable, quitting.QObject0Der Anzeigename ist leerScreen name is emptyScreenSettingsDialogÖDer Anzeigename darf nicht leer sein. Bitte geben Sie einen Anzeigenamen an oder brechen Sie den Dialog ab.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog&Hinzufügen&AddScreenSettingsDialogBase &Strg:&Ctrl:ScreenSettingsDialogBase"&Tote" Ecken &Dead cornersScreenSettingsDialogBase&Korrekturen&FixesScreenSettingsDialogBase&Zusatztasten&Modifier keysScreenSettingsDialogBase&Entfernen&RemoveScreenSettingsDialogBaseUm&schalt:&Shift:ScreenSettingsDialogBaseA&liaseA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseUnten-links Bottom-leftScreenSettingsDialogBaseUnten-rechts Bottom-rightScreenSettingsDialogBase&Größe: Corner Si&ze:ScreenSettingsDialogBaseStrgCtrlScreenSettingsDialogBase8Korrektur für FeststelltasteFix CAPS LOCK keyScreenSettingsDialogBase,Korrektur für Num LockFix NUM LOCK keyScreenSettingsDialogBase2Korrektur für Scroll LockFix SCROLL LOCK keyScreenSettingsDialogBase@Korrektur für XTest mit XineramaFix XTest for XineramaScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBase KeineNoneScreenSettingsDialogBaseS&uper:S&uper:ScreenSettingsDialogBaseAnzeige&name: Screen &name:ScreenSettingsDialogBase(AnzeigeeinstellungenScreen SettingsScreenSettingsDialogBaseUmschaltShiftScreenSettingsDialogBaseWindowsSuperScreenSettingsDialogBaseOben-linksTop-leftScreenSettingsDialogBaseOben-rechts Top-rightScreenSettingsDialogBase2<center>Anzeige: <b>%1</b></center><br>Klicken Sie doppelt um die Einstellungen zu ändern<br>Ziehen Sie die Anzeige in den Papierkorb um sie zu entferneno
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&Unten-links &Bottom-leftServerConfigDialogBaseJPrüfe auf Meldungen vom &Client aller&Check clients everyServerConfigDialogBase"&Tote" Ecken &Dead cornersServerConfigDialogBase&Bearbeiten&EditServerConfigDialogBase&Hotkeys&HotkeysServerConfigDialogBase&Neu&NewServerConfigDialogBase&Optionen&OptionsServerConfigDialogBase&Entfernen&RemoveServerConfigDialogBaseWech&sel&SwitchServerConfigDialogBase&BefehleA&ctionsServerConfigDialogBase:Erwiterte ServereinstellungenAdvanced server settingsServerConfigDialogBaseUnten-rec&hts Bottom-ri&ghtServerConfigDialogBase†Konfigurieren Sie die Anordnung Ihrer Synergy Server Konfiguration.:Configure the layout of your synergy server configuration.ServerConfigDialogBase&Größe: Cor&ner Size:ServerConfigDialogBasexAuf Windows Servern &Fenster im Vordergrund nicht aktivieren0Don't take &foreground window on Windows serversServerConfigDialogBase’Ziehen Sie eine Anzeige vom Raster in den Papierkorb um sie zu entfernen.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase¤Ziehen Sie neue Anzeigen auf das Raster oder verschieben sie existierende. Ziehen Sie eine Anzeige in den Papierkorb um sie zu entfernen. Klicken sie doppelt auf eine Anzeige um die Einstellungen zu bearbeiten.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBaseŠZiehen diese Symbol auf das Raster um eine neue Anzeige hinzuzufügen.1Drag this button to the grid to add a new screen.ServerConfigDialogBaseÄn&dernE&ditServerConfigDialogBaseHotkeysHotkeysServerConfigDialogBaseNe&uNe&wServerConfigDialogBase&EntfernenRe&moveServerConfigDialogBaseDBildschirmschoner s&ynchronisierenS&ynchronize screen saversServerConfigDialogBase2Anzeigen und VerbindungenScreens and linksServerConfigDialogBase(Server KonfigurationServer ConfigurationServerConfigDialogBase.Wechsel n&ach WartezeitSwitch &after waitingServerConfigDialogBasefWechsel nach doppel&ter Randberührung innerhalb vonSwitch on double &tap withinServerConfigDialogBaseO&ben-links To&p-leftServerConfigDialogBaseOben-rec&hts Top-rig&htServerConfigDialogBaseBVe&rwende relative MausbewegungenUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase0Speicherort des LogfilesSave log file to...SettingsDialog&Erweitert &AdvancedSettingsDialogBaseDServer/Client &automatisch starten"&Automatically start server/clientSettingsDialogBasez&Verstecke das Fenster, wenn der Server/Client gestartet wird&Hide when server/client startsSettingsDialogBaseSchn&ittstelle &Interface:SettingsDialogBase&Umfang:&Logging level:SettingsDialogBase\Synergy nach dem Anmelden automatisch &starten&Start Synergy after logging inSettingsDialogBaseDurchsuchen... Browse...SettingsDialogBase DebugDebugSettingsDialogBase Debug1Debug1SettingsDialogBase Debug2Debug2SettingsDialogBase FehlerErrorSettingsDialogBaseInfoInfoSettingsDialogBaseIn Datei: Log to file:SettingsDialogBaseProtokollierungLoggingSettingsDialogBase NotizNoteSettingsDialogBase P&ort:P&ort:SettingsDialogBase&Anzeigename: Sc&reen name:SettingsDialogBaseEinstellungenSettingsSettingsDialogBaseWarnungWarningSettingsDialogBaseBBitte wählen Sie eine option aus.Please select an option. SetupWizard$Synergy einrichten Setup Synergy SetupWizard<&Client (dem Setup hinzufügen)&Client (add to setup)SetupWizardBase*&Server (neues Setup)&Server (new setup)SetupWizardBase&Server oder Client?Server or Client?SetupWizardBase$Synergy einrichten Setup SynergySetupWizardBase¼Das ist der erste Computer, den Sie einrichten. Ihre Tastatur und Ihre Maus sind an diesem Computer angeschlossen. Sie werden Ihre Maus auf einem anderen Bildschirm verwenden können. Es ist nur ein einziger Server möglich.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBasehSie haben bereits einen Server konfiguriert. Dies ist ein Computer, den Sie mittels Tastatur und Maus des Servers kontrollieren wollen. In Ihrem Setup sind mehrere Clients möglich.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseUnbekanntUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_de.ts0000600000175000017500000013515112006005561021401 0ustar synergysynergy AboutDialogBase About Synergy Ãœber Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Unbekannt Version: Version: &Ok &Ok ActionDialogBase Configure Action Aktion konfigurieren Choose the action to perform Wähle eine Aktion, die ausgeführt werden soll Press a hotkey Hotkey drücken Release a hotkey Hotkey loslassen Press and release a hotkey Hotkey drücken und loslassen only on these screens Nur auf diesen Bildschirmen Switch to screen Zu Anzeige Wechseln Switch in direction In Richtung wechseln left links right rechts up rauf down runter Lock cursor to screen Cursor auf Anzeige beschränken toggle umschalten on ein off aus This action is performed when Diese Aktion wird ausgeführt, wenn the hotkey is pressed wen der Hotkey gedrückt wird the hotkey is released wenn der Hotke losgelassen wird HotkeyDialogBase Hotkey Hotkey Enter the specification for the hotkey: Gib die Definition für den Hotkey ein: MainWindow &Start &Start &File &Datei &Edit &Bearbeiten &Window &Fenster &Help &Hilfe <p>Version %1 is now available, <a href="%2">visit website</a>.</p> &undefinedp>Version %1 ist verf&uuml;gbar, <a href="%2">besuche die Webseite</a>.</p> Program can not be started Das Programm konnte nicht gestartet werden The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Die Anwendung <br><br>%1<br><br> konnte nicht erfolgreich gestartet werden, obwohl sie vorhanden ist. Bitte überprüfen Sie, ob Sie die Berechtigungen zum Ausführen dieser Anwendung haben. Synergy client not found Der Synergy Client wurde nicht gefunden The executable for the synergy client does not exist. Die ausführbare Datei für den Synergy Client existiert nicht. Hostname is empty Der Hostname is leer Please fill in a hostname for the synergy client to connect to. Bitte tragen Sie einen Hostnamen ein, zu dem sich der Synergy-Client verbinden soll. Cannot write configuration file Configurationsdatei konnte nicht geschrieben werden The temporary configuration file required to start synergy can not be written. Die temporäre Konfigurationsdatei konnte nicht geschrieben werden. Sie wird jedoch für den Start von Synergy benötigt. Configuration filename invalid Der Dateiname der Konfigurationsdatei ist ungültig. You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Sie haben keine gültige Konfigurationsdatei angegeben. Wollen sie jetzt nach dieser Datei suchen? Synergy server not found Der Synergy Server wurde nicht gefunden. The executable for the synergy server does not exist. Die ausführbare Datei für den Synergy Server existiert nicht. Synergy terminated with an error Synergy wurde mit einem Fehler beendet. Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy wurde unerwartet mit Abbruchcode %1 beendet. <br><br> Weitere Informationen können dem Log entnommen werden. &Stop &Stopp service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy wird gestartet. Synergy is not running. Synergy läuft nicht. Unknown Unbekannt Browse for a synergys config file Nach einer Konfigurationsdatei für Synergy suchen. Save configuration as... Konfiguration speichern unter ... Save failed Speichern fehlgeschlagen Could not save configuration to file. Konfiguration konnte nicht in Datei gespeichert werden MainWindowBase Synergy Synergy Screen name: Unknown Unbekannt &Server IP: &Start &Start &Server (share this computer's mouse and keyboard): &Server (teile Tastatur und Maus dieses Rechners) Use existing configuration: Verwende bestehende Konfiguration: &Configuration file: &Konfigurationsdatei: &Browse... &Durchsuchen... Configure interactively: Interaktiv konfigurieren: &Configure Server... Server &konfigurieren... &Client (use another computer's keyboard and mouse): &Client (Tastatur und Maus eines anderen Computers verwenden): Ready Fertig Log Log &Apply &Anwenden &Elevate IP addresses: &About Synergy... &Ãœber Synergy... &Quit &Beenden Quit Beenden Ctrl+Q Strg+Q Run Start Ctrl+S Strg+S S&top S&topp Stop Stop Ctrl+T Strg+T S&how Status S&tatus anzeigen Ctrl+H Strg+H &Hide Hide &Show Show Save configuration &as... Configuration speichern &unter ... Save the interactively generated server configuration to a file. Speichere die interaktiv erstellte Konfiguration in eine Datei. Ctrl+Alt+S Strg+Alt+S Settings Einstellungen Edit settings Einstellungen bearbeiten Run Wizard Assistent ausführen NewScreenWidget Unnamed Unbenannt QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Konfigurationen (*.sgc);;Alle Dateien (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy Konfigurationen (*.conf);;Alle Dateien (*.*) System tray is unavailable, quitting. Infobereich ist nicht verfügbar. Beende Programm. ScreenSettingsDialog Screen name is empty Der Anzeigename ist leer The name for a screen can not be empty. Please fill in a name or cancel the dialog. Der Anzeigename darf nicht leer sein. Bitte geben Sie einen Anzeigenamen an oder brechen Sie den Dialog ab. ScreenSettingsDialogBase Screen Settings Anzeigeeinstellungen Screen &name: Anzeige&name: A&liases A&liase &Add &Hinzufügen &Remove &Entfernen &Modifier keys &Zusatztasten &Shift: Um&schalt: Shift Umschalt Ctrl Strg Alt Alt Meta Meta Super Windows None Keine &Ctrl: &Strg: Al&t: Al&t: M&eta: M&eta: S&uper: S&uper: &Dead corners "&Tote" Ecken Top-left Oben-links Top-right Oben-rechts Bottom-left Unten-links Bottom-right Unten-rechts Corner Si&ze: &Größe: &Fixes &Korrekturen Fix CAPS LOCK key Korrektur für Feststelltaste Fix NUM LOCK key Korrektur für Num Lock Fix SCROLL LOCK key Korrektur für Scroll Lock Fix XTest for Xinerama Korrektur für XTest mit Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Anzeige: <b>%1</b></center><br>Klicken Sie doppelt um die Einstellungen zu ändern<br>Ziehen Sie die Anzeige in den Papierkorb um sie zu entfernen ServerConfigDialogBase Server Configuration Server Konfiguration Screens and links Anzeigen und Verbindungen Drag a screen from the grid to the trashcan to remove it. Ziehen Sie eine Anzeige vom Raster in den Papierkorb um sie zu entfernen. Configure the layout of your synergy server configuration. Konfigurieren Sie die Anordnung Ihrer Synergy Server Konfiguration. Drag this button to the grid to add a new screen. Ziehen diese Symbol auf das Raster um eine neue Anzeige hinzuzufügen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Ziehen Sie neue Anzeigen auf das Raster oder verschieben sie existierende. Ziehen Sie eine Anzeige in den Papierkorb um sie zu entfernen. Klicken sie doppelt auf eine Anzeige um die Einstellungen zu bearbeiten. Hotkeys Hotkeys &Hotkeys &Hotkeys &New &Neu &Edit &Bearbeiten &Remove &Entfernen A&ctions &Befehle Ne&w Ne&u E&dit Än&dern Re&move &Entfernen Advanced server settings Erwiterte Servereinstellungen &Switch Wech&sel Switch &after waiting Wechsel n&ach Wartezeit ms ms Switch on double &tap within Wechsel nach doppel&ter Randberührung innerhalb von &Options &Optionen &Check clients every Prüfe auf Meldungen vom &Client aller Use &relative mouse moves Ve&rwende relative Mausbewegungen S&ynchronize screen savers Bildschirmschoner s&ynchronisieren Don't take &foreground window on Windows servers Auf Windows Servern &Fenster im Vordergrund nicht aktivieren &Dead corners "&Tote" Ecken To&p-left O&ben-links Top-rig&ht Oben-rec&hts &Bottom-left &Unten-links Bottom-ri&ght Unten-rec&hts Cor&ner Size: &Größe: SettingsDialog Save log file to... Speicherort des Logfiles SettingsDialogBase Settings Einstellungen &Advanced &Erweitert Sc&reen name: &Anzeigename: P&ort: P&ort: &Interface: Schn&ittstelle &Start Synergy after logging in Synergy nach dem Anmelden automatisch &starten &Automatically start server/client Server/Client &automatisch starten &Hide when server/client starts &Verstecke das Fenster, wenn der Server/Client gestartet wird Logging Protokollierung &Process mode: Service Desktop (legacy) &Logging level: &Umfang: Log to file: In Datei: Browse... Durchsuchen... Error Fehler Warning Warnung Note Notiz Info Info Debug Debug Debug1 Debug1 Debug2 Debug2 &Startup SetupWizard Setup Synergy Synergy einrichten Please select an option. Bitte wählen Sie eine option aus. SetupWizardBase Setup Synergy Synergy einrichten Server or Client? Server oder Client? &Server (new setup) &Server (neues Setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Das ist der erste Computer, den Sie einrichten. Ihre Tastatur und Ihre Maus sind an diesem Computer angeschlossen. Sie werden Ihre Maus auf einem anderen Bildschirm verwenden können. Es ist nur ein einziger Server möglich. &Client (add to setup) &Client (dem Setup hinzufügen) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Sie haben bereits einen Server konfiguriert. Dies ist ein Computer, den Sie mittels Tastatur und Maus des Servers kontrollieren wollen. In Ihrem Setup sind mehrere Clients möglich. VersionChecker Unknown Unbekannt synergy-1.4.12-Source/src/gui/res/lang/gui_en-US.qm0000600000175000017500000000002012006005561021711 0ustar synergysynergy<¸dÊÍ!¿`¡½Ýsynergy-1.4.12-Source/src/gui/res/lang/gui_en-US.ts0000600000175000017500000012353612006005561021744 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_es.qm0000600000175000017500000005324012006005561021405 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB€CDã^³ÀÖ+[H4,ÇSW ØY¾!quÆ}§¤)‚´Ç7<«Œ. ÏIÙ<¡0´G×@ZVE0íV¥JµŒ!«`$U¶Þ+ÔB*» *»6m*Ð% V*ì0 ¤+Œ+«` =GË?¨Gíz,yJ¹·HÝL™bI£UÛ`"aX·¹!?YïÔ2VZÆÂ2œxýôTÁx.Ää ÛëØ>;Ôóìö}S!ú;NGûu>Ù(Z @= î nbj%°¯4 º¾þ‘ÒÉÆþ3Ev.#_þ'6eëA ¨w94ª¸ú)Õ­Ã*žº¨” ”¯˜š;H} H¦”3-O éL˜O éM¯]àJwÂVE g¸Ó1òiCFUN™.YYu:J l_” }× %¹Š*ÄCÞšl®Þ¨öé5z«Žø¶«ë« « U«›¡I«›¢I`° Î<¶Ä:Ó*&Ä:Ó5÷äöž ˜ç¹ÔEàñ$ZGö±É¹üÊJ0c"QJ -izJèË@d,ýÜl 1,攄!§(ÿMR( nÛ4.d2Ø@Ty.ß{ã7‰€¡ªœ6>#5žŽÄ|ÎzÎç>ÏéJžH—ëêžk £3 Š=ñT¾k@d5‚ï"«ŠÁ„µÞ%ãC+/lYLé}F•@¯€Ân„ŸCDC»ó8Ñ÷¸‰&y Öj¾ IÞ_* JzK7 kö#; v®~>Ì ”Bƒ -5 Ó OøŽ(D P¢nB dö¹'Í ~5ÓA° ±¥zÏ Ö„~o ȹ$Š >îN aº®E |ßÚ1€ ŒFå+t ŒFå7Ì žýZ+È ® ¸8 ÈcÄEŒ àKG ‹ RVŽ’ RVŽî RVŽ$ RVŽP¿ R÷®7 Tƒä%z V½4Œ šÚÓ §|*G5 «c8z »s$ »sK¥ ÄcþBû ÞF¤-S ^®8 /ó,& 4pÄCn dÙ/ê i!΢ rù? zkÙc ‰PKä àx49P è]^… ^L(=‰K>ä :—ôžƒu ’rø/åŽ 7å/^kC?øk£6½®ú.9¾Ó>©ò¬Š-¦iPÿ&undefinedOk&OkAboutDialogBase"Acerca de Synergy About SynergyAboutDialogBaseDesconocidoUnknownAboutDialogBaseVersiónVersion:AboutDialogBase6Elige la acción a presentarChoose the action to performActionDialogBase"Configurar AcciónConfigure ActionActionDialogBase6Bloquear cursor en pantallaLock cursor to screenActionDialogBaseHPresiona una tecla de acceso directoPress a hotkeyActionDialogBase^Presionar y liberar una tecla de acceso directoPress and release a hotkeyActionDialogBaseFLiberar una tecla de acceso directoRelease a hotkeyActionDialogBase"Cambiar direcciónSwitch in directionActionDialogBase$Cambiar a pantallaSwitch to screenActionDialogBase<Esta acción se presenta cuandoThis action is performed whenActionDialogBase abajodownActionDialogBaseizquierdaleftActionDialogBaseapagadooffActionDialogBaseencendidoonActionDialogBase.sólo en estas pantallasonly on these screensActionDialogBasederecharightActionDialogBasePla tecla de acceso directo es presionadathe hotkey is pressedActionDialogBaseLla tecla de acceso directo es liberadathe hotkey is releasedActionDialogBasecambiartoggleActionDialogBase arribaupActionDialogBasedIngresa la especificación para la tecla de acceso:'Enter the specification for the hotkey:HotkeyDialogBase.Tecla de Acceso DirectoHotkeyHotkeyDialogBase &undefinedEditar&Edit MainWindow*&undefined&F) Archivo&File MainWindow&&undefined&H) Ayuda&Help MainWindow*&undefined&S) Iniciar&Start MainWindow*&undefined&S) Detener&Stop MainWindow*&undefined&W) Ventana&Window MainWindow–<p>La versión %1 está disponible, <a href="%2">visita el sitio web</a>.</p>C

Version %1 is now available, visit website.

 MainWindowTBuscar un archivo de configuración Synergy!Browse for a synergys config file MainWindow`No se puede escribir el archivo de configuraciónCannot write configuration file MainWindowVNombre de archivo de configuración inválidoConfiguration filename invalid MainWindowdNo se pudo guardar la configuración en el archivo.%Could not save configuration to file. MainWindow2Nombre de Host está vacíoHostname is empty MainWindowšPor favor, ingresa un nombre del host al que se conectará el cliente Synergy.?Please fill in a hostname for the synergy client to connect to. MainWindow8El programa no puede iniciarProgram can not be started MainWindow:Guardar configuración como...Save configuration as... MainWindowNo se guardó Save failed MainWindowBNo se encontró el cliente SynergySynergy client not found MainWindow<Synergy no se está ejecutando.Synergy is not running. MainWindow.Synergy está iniciando.Synergy is starting. MainWindowDNo se encontró el servidor SynergySynergy server not found MainWindowîSynergu terminó inesperadamente con el código de salida %1.<br><br>Por favor, vea el registro de eventos para detalles.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow8Synergy terminó con un error Synergy terminated with an error MainWindow`El ejecutable para el cliente Synergy no existe.5The executable for the synergy client does not exist. MainWindowbEl ejecutable para el servidor Synergy no existe.5The executable for the synergy server does not exist. MainWindow8El ejecutable<br><br>%1<br><br>no pudo iniciar exitosamente, aunque sí existe. Por favor, revisa si tienes permisos suficientes para ejecutar este programa.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow²El archivo de configuración temporal necesario para iniciar Synergy no puede ser escrito.NThe temporary configuration file required to start synergy can not be written. MainWindowDesconocidoUnknown MainWindowüNo has ingresado un archivo de configuración válido para el servidor Synergy. Queres buscar el archivo de configuración ahora?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow<&undefinedAcerca de Synergy...&About Synergy...MainWindowBaseAplicar&ApplyMainWindowBase&&undefinedBuscar... &Browse...MainWindowBasex&undefinedCliente (usar mouse y teclado de otro computador):4&Client (use another computer's keyboard and mouse):MainWindowBaseF&undefinedrchivo de &Configuración:&Configuration file:MainWindowBase@&undefinedConfigurar Servidor...&Configure Server...MainWindowBase&&undefined&Q) Salir&QuitMainWindowBaseŠ&undefinedServidor (compartir el mouse y teclado de este computador):3&Server (share this computer's mouse and keyboard):MainWindowBase*&undefined&S) Iniciar&StartMainWindowBase8Configurar interactivamente:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBaseEditar Opciones Edit settingsMainWindowBaseRegistroLogMainWindowBase SalirQuitMainWindowBase ListoReadyMainWindowBaseEjecutarRunMainWindowBase&Iniciar instalación Run WizardMainWindowBase8&undefined&H) Mostrar Estado S&how StatusMainWindowBase"&undefinede&tenerS&topMainWindowBaseN&undefinedu&ardar configuración como...Save configuration &as...MainWindowBase‚Guardar la configuración generada interactivamente en un archivo.@Save the interactively generated server configuration to a file.MainWindowBaseOpcionesSettingsMainWindowBaseDetenerStopMainWindowBaseSynergySynergyMainWindowBaseDesconocidoUnknownMainWindowBase:Usar configuración existente:Use existing configuration:MainWindowBaseSin nombreUnnamedNewScreenWidgettConfiguraciones Synergy (*.conf);;Todos los archivos (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectrConfiguraciones Synergy (*.sgc);;Todos los archivos (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectVBandeja de sistema no disponible, saliendo.%System tray is unavailable, quitting.QObject:Nombre de pantalla está vacíoScreen name is emptyScreenSettingsDialogÂEl nombre de una pantalla no puede estar vacío. Por favor, ingresa un nombre o cierre la ventana.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog"&undefinedAgregar&AddScreenSettingsDialogBase&undefinedCtrl:&Ctrl:ScreenSettingsDialogBase>&undefinedsquinas &Desactivadas &Dead cornersScreenSettingsDialogBase4&undefined&F) Reparaciones&FixesScreenSettingsDialogBase4&undefinedModificar teclas&Modifier keysScreenSettingsDialogBase &undefinedo&rrar&RemoveScreenSettingsDialogBase*&undefinedayú&sculas:&Shift:ScreenSettingsDialogBase&undefined&liasA&liasesScreenSettingsDialogBase&undefinedl&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseAbajo-Izquierda Bottom-leftScreenSettingsDialogBaseAbajo-Derecha Bottom-rightScreenSettingsDialogBase@&undefined&Z) Tamaño de Esquina: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBaseHReparar tecla CAPS LOCK (BLOQ MAYÚS)Fix CAPS LOCK keyScreenSettingsDialogBaseBReparar tecla NUM LOCK (BLOQ NUM)Fix NUM LOCK keyScreenSettingsDialogBaseLReparar tecla SCROLL LOCK (BLOQ DESPL)Fix SCROLL LOCK keyScreenSettingsDialogBase6Reparar XTest para XineramaFix XTest for XineramaScreenSettingsDialogBase&undefined&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNingunoNoneScreenSettingsDialogBase &undefined&uper:S&uper:ScreenSettingsDialogBase8&undefinedNombre de Pantalla Screen &name:ScreenSettingsDialogBase(Opciones de PantallaScreen SettingsScreenSettingsDialogBaseMayúsculasShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase Arriba-IzquierdaTop-leftScreenSettingsDialogBaseArriba-Derecha Top-rightScreenSettingsDialogBaseþ<center>Pantalla: <b>%1</b></center><br>Haz doble clic para editar opciones<br>Arrastra la pantalla a la papelera para borrarlao
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel2&undefined&bajo-Izquierda &Bottom-leftServerConfigDialogBase>&undefinedevisar &clientes cada&Check clients everyServerConfigDialogBase>&undefinedsquinas &Desactivadas &Dead cornersServerConfigDialogBase &undefinedEditar&EditServerConfigDialogBaseL&undefined&H) Teclas de acceso directo&HotkeysServerConfigDialogBase&undefinedNueva&NewServerConfigDialogBaseOpciones&OptionsServerConfigDialogBase &undefinedo&rrar&RemoveServerConfigDialogBase*&undefined&S) Cambiar&SwitchServerConfigDialogBase$&undefined&ccionesA&ctionsServerConfigDialogBase<Opciones Avanzadas de ServidorAdvanced server settingsServerConfigDialogBase6&undefined&G) Abajo-Derecha Bottom-ri&ghtServerConfigDialogBasetConfigurar el diseño tu configuración de servidor Synergy.:Configure the layout of your synergy server configuration.ServerConfigDialogBase8&undefinedamaño de Esqui&na: Cor&ner Size:ServerConfigDialogBaserNo tomar la ventana de primer plano en servidores Windows0Don't take &foreground window on Windows serversServerConfigDialogBase~Arrastra una pantalla de la matriz a la papelera para borrarla.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseVArrastra nuevas pantallas a la matriz o mueve las existentes. Arrastra una pantalla a la papelera para eliminarla. Haz doble clic en una pantalla para editar sus opciones.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBase€Arrastra este botón a la matriz para agregar una nueva pantalla.1Drag this button to the grid to add a new screen.ServerConfigDialogBase &undefined&ditarE&ditServerConfigDialogBase0Teclas de acceso directoHotkeysServerConfigDialogBase&&undefined&W) NuevaNe&wServerConfigDialogBase(&undefined&M) BorrarRe&moveServerConfigDialogBaseb&undefined&Y) Sincronizar protectores de pantallaS&ynchronize screen saversServerConfigDialogBase&Pantallas y enlacesScreens and linksServerConfigDialogBase2Configuración de ServidorServer ConfigurationServerConfigDialogBase8&undefinedambiar &al esperarSwitch &after waitingServerConfigDialogBase,Cambiar doble toque enSwitch on double &tap withinServerConfigDialogBase<&undefined&P) Arriba-Izquierda To&p-leftServerConfigDialogBase0&undefinedrriba-Derec&ha Top-rig&htServerConfigDialogBase\&undefinedsar movimientos &relativos del mouseUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBaseBGuardar archivo de registro en...Save log file to...SettingsDialog$&undefinedAvanzado &AdvancedSettingsDialogBased&undefinedniciar &automáticamente servidor/cliente"&Automatically start server/clientSettingsDialogBaseb&undefined&H) Ocultar al iniciar servidor/cliente&Hide when server/client startsSettingsDialogBase&&undefinedInterfaz: &Interface:SettingsDialogBase8&undefinedive&l de Registro:&Logging level:SettingsDialogBaseV&undefinedniciar &Synergy al iniciar sesión&Start Synergy after logging inSettingsDialogBaseExaminar... Browse...SettingsDialogBaseDepuraciónDebugSettingsDialogBaseDepuración1Debug1SettingsDialogBaseDepuración2Debug2SettingsDialogBase ErrorErrorSettingsDialogBaseInfoInfoSettingsDialogBase8Guardar registro en archivo: Log to file:SettingsDialogBaseRegistroLoggingSettingsDialogBaseNotaNoteSettingsDialogBase"&undefineduert&o:P&ort:SettingsDialogBase:&undefinedomb&re de Pantalla: Sc&reen name:SettingsDialogBaseOpcionesSettingsSettingsDialogBaseAdvertenciaWarningSettingsDialogBase8Elige una opción, por favor.Please select an option. SetupWizard$Configurar Synergy Setup Synergy SetupWizard2Servidor (nuevos ajustes)&Server (new setup)SetupWizardBase(¿Servidor o Cliente?Server or Client?SetupWizardBase$Configurar Synergy Setup SynergySetupWizardBaseºEste es el primer ordenador que configuras. Tu teclado y ratón están conectados a este ordenador. Esto te permitirá mover tu ratón de la pantalla de un ordenador a la del otro. Solo puede haber un servidor en tus ajustes.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseDesconocidoUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_es.ts0000600000175000017500000013613512006005561021423 0ustar synergysynergy AboutDialogBase About Synergy Acerca de Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Desconocido Version: Versión &Ok &undefinedOk ActionDialogBase Configure Action Configurar Acción Choose the action to perform Elige la acción a presentar Press a hotkey Presiona una tecla de acceso directo Release a hotkey Liberar una tecla de acceso directo Press and release a hotkey Presionar y liberar una tecla de acceso directo only on these screens sólo en estas pantallas Switch to screen Cambiar a pantalla Switch in direction Cambiar dirección left izquierda right derecha up arriba down abajo Lock cursor to screen Bloquear cursor en pantalla toggle cambiar on encendido off apagado This action is performed when Esta acción se presenta cuando the hotkey is pressed la tecla de acceso directo es presionada the hotkey is released la tecla de acceso directo es liberada HotkeyDialogBase Hotkey Tecla de Acceso Directo Enter the specification for the hotkey: Ingresa la especificación para la tecla de acceso: MainWindow &Start &undefined&S) Iniciar &File &undefined&F) Archivo &Edit &undefinedEditar &Window &undefined&W) Ventana &Help &undefined&H) Ayuda <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>La versión %1 está disponible, <a href="%2">visita el sitio web</a>.</p> Program can not be started El programa no puede iniciar The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. El ejecutable<br><br>%1<br><br>no pudo iniciar exitosamente, aunque sí existe. Por favor, revisa si tienes permisos suficientes para ejecutar este programa. Synergy client not found No se encontró el cliente Synergy The executable for the synergy client does not exist. El ejecutable para el cliente Synergy no existe. Hostname is empty Nombre de Host está vacío Please fill in a hostname for the synergy client to connect to. Por favor, ingresa un nombre del host al que se conectará el cliente Synergy. Cannot write configuration file No se puede escribir el archivo de configuración The temporary configuration file required to start synergy can not be written. El archivo de configuración temporal necesario para iniciar Synergy no puede ser escrito. Configuration filename invalid Nombre de archivo de configuración inválido You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? No has ingresado un archivo de configuración válido para el servidor Synergy. Queres buscar el archivo de configuración ahora? Synergy server not found No se encontró el servidor Synergy The executable for the synergy server does not exist. El ejecutable para el servidor Synergy no existe. Synergy terminated with an error Synergy terminó con un error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergu terminó inesperadamente con el código de salida %1.<br><br>Por favor, vea el registro de eventos para detalles. &Stop &undefined&S) Detener service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy está iniciando. Synergy is not running. Synergy no se está ejecutando. Unknown Desconocido Browse for a synergys config file Buscar un archivo de configuración Synergy Save configuration as... Guardar configuración como... Save failed No se guardó Could not save configuration to file. No se pudo guardar la configuración en el archivo. MainWindowBase Synergy Synergy Screen name: Unknown Desconocido &Server IP: &Start &undefined&S) Iniciar &Server (share this computer's mouse and keyboard): &undefinedServidor (compartir el mouse y teclado de este computador): Use existing configuration: Usar configuración existente: &Configuration file: &undefinedrchivo de &Configuración: &Browse... &undefinedBuscar... Configure interactively: Configurar interactivamente: &Configure Server... &undefinedConfigurar Servidor... &Client (use another computer's keyboard and mouse): &undefinedCliente (usar mouse y teclado de otro computador): Ready Listo Log Registro &Apply Aplicar &Elevate IP addresses: &About Synergy... &undefinedAcerca de Synergy... &Quit &undefined&Q) Salir Quit Salir Ctrl+Q Ctrl+Q Run Ejecutar Ctrl+S Ctrl+S S&top &undefinede&tener Stop Detener Ctrl+T Ctrl+T S&how Status &undefined&H) Mostrar Estado Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... &undefinedu&ardar configuración como... Save the interactively generated server configuration to a file. Guardar la configuración generada interactivamente en un archivo. Ctrl+Alt+S Ctrl+Alt+S Settings Opciones Edit settings Editar Opciones Run Wizard Iniciar instalación NewScreenWidget Unnamed Sin nombre QObject Synergy Configurations (*.sgc);;All files (*.*) Configuraciones Synergy (*.sgc);;Todos los archivos (*.*) Synergy Configurations (*.conf);;All files (*.*) Configuraciones Synergy (*.conf);;Todos los archivos (*.*) System tray is unavailable, quitting. Bandeja de sistema no disponible, saliendo. ScreenSettingsDialog Screen name is empty Nombre de pantalla está vacío The name for a screen can not be empty. Please fill in a name or cancel the dialog. El nombre de una pantalla no puede estar vacío. Por favor, ingresa un nombre o cierre la ventana. ScreenSettingsDialogBase Screen Settings Opciones de Pantalla Screen &name: &undefinedNombre de Pantalla A&liases &undefined&lias &Add &undefinedAgregar &Remove &undefinedo&rrar &Modifier keys &undefinedModificar teclas &Shift: &undefinedayú&sculas: Shift Mayúsculas Ctrl Ctrl Alt Alt Meta Meta Super Super None Ninguno &Ctrl: &undefinedCtrl: Al&t: &undefinedl&t: M&eta: &undefined&eta: S&uper: &undefined&uper: &Dead corners &undefinedsquinas &Desactivadas Top-left Arriba-Izquierda Top-right Arriba-Derecha Bottom-left Abajo-Izquierda Bottom-right Abajo-Derecha Corner Si&ze: &undefined&Z) Tamaño de Esquina: &Fixes &undefined&F) Reparaciones Fix CAPS LOCK key Reparar tecla CAPS LOCK (BLOQ MAYÚS) Fix NUM LOCK key Reparar tecla NUM LOCK (BLOQ NUM) Fix SCROLL LOCK key Reparar tecla SCROLL LOCK (BLOQ DESPL) Fix XTest for Xinerama Reparar XTest para Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Pantalla: <b>%1</b></center><br>Haz doble clic para editar opciones<br>Arrastra la pantalla a la papelera para borrarla ServerConfigDialogBase Server Configuration Configuración de Servidor Screens and links Pantallas y enlaces Drag a screen from the grid to the trashcan to remove it. Arrastra una pantalla de la matriz a la papelera para borrarla. Configure the layout of your synergy server configuration. Configurar el diseño tu configuración de servidor Synergy. Drag this button to the grid to add a new screen. Arrastra este botón a la matriz para agregar una nueva pantalla. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Arrastra nuevas pantallas a la matriz o mueve las existentes. Arrastra una pantalla a la papelera para eliminarla. Haz doble clic en una pantalla para editar sus opciones. Hotkeys Teclas de acceso directo &Hotkeys &undefined&H) Teclas de acceso directo &New &undefinedNueva &Edit &undefinedEditar &Remove &undefinedo&rrar A&ctions &undefined&cciones Ne&w &undefined&W) Nueva E&dit &undefined&ditar Re&move &undefined&M) Borrar Advanced server settings Opciones Avanzadas de Servidor &Switch &undefined&S) Cambiar Switch &after waiting &undefinedambiar &al esperar ms ms Switch on double &tap within Cambiar doble toque en &Options Opciones &Check clients every &undefinedevisar &clientes cada Use &relative mouse moves &undefinedsar movimientos &relativos del mouse S&ynchronize screen savers &undefined&Y) Sincronizar protectores de pantalla Don't take &foreground window on Windows servers No tomar la ventana de primer plano en servidores Windows &Dead corners &undefinedsquinas &Desactivadas To&p-left &undefined&P) Arriba-Izquierda Top-rig&ht &undefinedrriba-Derec&ha &Bottom-left &undefined&bajo-Izquierda Bottom-ri&ght &undefined&G) Abajo-Derecha Cor&ner Size: &undefinedamaño de Esqui&na: SettingsDialog Save log file to... Guardar archivo de registro en... SettingsDialogBase Settings Opciones &Advanced &undefinedAvanzado Sc&reen name: &undefinedomb&re de Pantalla: P&ort: &undefineduert&o: &Interface: &undefinedInterfaz: &Start Synergy after logging in &undefinedniciar &Synergy al iniciar sesión &Automatically start server/client &undefinedniciar &automáticamente servidor/cliente &Hide when server/client starts &undefined&H) Ocultar al iniciar servidor/cliente Logging Registro &Process mode: Service Desktop (legacy) &Logging level: &undefinedive&l de Registro: Log to file: Guardar registro en archivo: Browse... Examinar... Error Error Warning Advertencia Note Nota Info Info Debug Depuración Debug1 Depuración1 Debug2 Depuración2 &Startup SetupWizard Setup Synergy Configurar Synergy Please select an option. Elige una opción, por favor. SetupWizardBase Setup Synergy Configurar Synergy Server or Client? ¿Servidor o Cliente? &Server (new setup) Servidor (nuevos ajustes) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Este es el primer ordenador que configuras. Tu teclado y ratón están conectados a este ordenador. Esto te permitirá mover tu ratón de la pantalla de un ordenador a la del otro. Solo puede haber un servidor en tus ajustes. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown Desconocido synergy-1.4.12-Source/src/gui/res/lang/gui_fi.qm0000600000175000017500000000257112006005561021375 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB@Ïáu>(Z S˜e=ñTÖ Ö„~O i!Ω rùi"Tietoa Synergystä About SynergyAboutDialogBase&Isäntänimi on tyhjäHostname is empty MainWindow^Täytä isäntänimellä johon Synergy voi yhdistää.?Please fill in a hostname for the synergy client to connect to. MainWindow8Ohjelmaa ei voida käynnistääProgram can not be started MainWindowBSynergyn asiakasohjelmaa ei löydySynergy client not found MainWindow^Ajotiedosto Synergyn asiakasohjelmalle puuttuu.5The executable for the synergy client does not exist. MainWindow"Ajotiedoston<br><br>%1<br><br>käynnistys ei onnistunut, vaikka se on olemassa. Tarkista onko sinulla riittävät käyttöoikeudet ohjelman ajamiseen.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow TiedotInfoSettingsDialogBaseˆsynergy-1.4.12-Source/src/gui/res/lang/gui_fi.ts0000600000175000017500000012431512006005561021407 0ustar synergysynergy AboutDialogBase About Synergy Tietoa Synergystä <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started Ohjelmaa ei voida käynnistää The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Ajotiedoston<br><br>%1<br><br>käynnistys ei onnistunut, vaikka se on olemassa. Tarkista onko sinulla riittävät käyttöoikeudet ohjelman ajamiseen. Synergy client not found Synergyn asiakasohjelmaa ei löydy The executable for the synergy client does not exist. Ajotiedosto Synergyn asiakasohjelmalle puuttuu. Hostname is empty Isäntänimi on tyhjä Please fill in a hostname for the synergy client to connect to. Täytä isäntänimellä johon Synergy voi yhdistää. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Tiedot Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_fr.qm0000600000175000017500000005252612006005561021413 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC@Ç^_ÀZ+[H4*mSW’Y¾ +uÆ)§¤'î´Ç3ø«Œ+šÏEk<¡.6G×<ÄVE.oV¥FiŒÆ«`"ѶÞÅ+Ôô*»j*»3c*Ð%œ*ì0Ð+Œm+«` 5GË<0Gíz*1J¹·D‹L™bE3UÛ` ÷X·¹ûYïÔ/¨ZÆÂ/àxýôþÁx.ìä ™ëØ>8 ó’ö}S ²;NC§u>+(Z = îånbj#v°¯4Bº¾þEÒɤþ0±Ev._þ% eë=I¨w9Hª¸ú(/­Ã(¾º¨”þº¨”s˜j;H}ùH¦”0gO éH@O éIá]àF-ÂVE C¸Ó/@iCBGUN™+ÓYu:E l_” á}× $;Š*Ä?èšl®z¨öé2˜«Žød«™«Î««›¡DÁ«›¢Dú° Î9Ä:Ó(nÄ:Ó3äöž €ç¹ÔA¨ñ$ZC3ö±ÉüÊJ-ù"QJ‰-izF¤Ë@d*£Ül .ª攄 a(ÿI†( nÓ4.d0@Ty,a{ã47€¡ª—œ6>!¯žŽÄdÎz®Îç>#éJžDIëꞃ £38=ñTÌk@d2K‚ï!)ŠÁ„žµÞ%!ãC)/lYI}F•=€ÂnxŸC@3»ó5E÷¸‰$ç Öj IÞ_‚ JzFß kö#7? v®~;P ”>• -5 ‡ OøŽ&º P¢n>, dö¹&I ~5Ó=Ò ¤hÞM% ±¥z£ Ö„~Ó ȹ# >îJ4 aº®@ø |ßÚ.ê ŒFå)l ŒFå4z žýZ)´ ® ¸4À ÈcÄAj àKG c RVŽ„ RVŽN RVŽ#> RVŽOm R÷®I Tƒä$ V½44 šÚ½ §|*Bá «c5 »s"’ »sG1 Äcþ>ÿ ÞF¤*ï ^®æ /ó)ð 4pÄ?œ dÙ-€ i!Î t rù- zkÙ ‰PGt àx45À è]^Å ^G¼=‰E>ä 6áôžƒ# ’rF/åŽ7å,îkCÏò¬Š+:ýùHiO¥&Ok&OkAboutDialogBase&À propos de Synergy About SynergyAboutDialogBaseInconnuUnknownAboutDialogBaseVersion:Version:AboutDialogBase>Choisissez l'action à effectuerChoose the action to performActionDialogBase&Configurer l'actionConfigure ActionActionDialogBase8Limiter le curseur à l'écranLock cursor to screenActionDialogBase,Appuyez sur une touchePress a hotkeyActionDialogBase<Pressez et relâchez une touchePress and release a hotkeyActionDialogBase&Relâchez une toucheRelease a hotkeyActionDialogBase4Basculer dans la directionSwitch in directionActionDialogBase*Basculer vers l'écranSwitch to screenActionDialogBase>Cette action est exécutée quandThis action is performed whenActionDialogBasebasdownActionDialogBase gaucheleftActionDialogBaseinactifoffActionDialogBase activéonActionDialogBase2uniquement sur ces écransonly on these screensActionDialogBase droiterightActionDialogBase0Le raccourci est utiliséthe hotkey is pressedActionDialogBaseHLa touche de raccourci est relachée.the hotkey is releasedActionDialogBaseactivertoggleActionDialogBasehautupActionDialogBaseHSaisir la touche de raccourci&nbsp;:'Enter the specification for the hotkey:HotkeyDialogBase"Raccourci clavierHotkeyHotkeyDialogBase&Editer&Edit MainWindow&Fichier&File MainWindow &Aide&Help MainWindow&Démarrer&Start MainWindow &Stop&Stop MainWindow&Fenêtre&Window MainWindowŒ<p>La version %1 est disponible, <a href="%2">visitez le site</a>.</p>C

Version %1 is now available, visit website.

 MainWindow|Parcourir pour rechercher un fichier de configuration synergys!Browse for a synergys config file MainWindow`Impossible d'écrire le fichier de configuration.Cannot write configuration file MainWindowbLe nom du fichier de configuration est incorrect.Configuration filename invalid MainWindowTImpossible de sauvegarder la configuration%Could not save configuration to file. MainWindow,Le nom d'hôte est videHostname is empty MainWindow˜Veuillez renseigner un nom d'hôte auquel le client Synergy doit se connecter?Please fill in a hostname for the synergy client to connect to. MainWindowBLe programme ne peut pas démarrerProgram can not be started MainWindowHSauvegarder la configuration sous...Save configuration as... MainWindow>Erreur lors de l'enregistrement Save failed MainWindowFLe client Synergy n'est pas détectéSynergy client not found MainWindowPSynergy n'est pas en train de s'exécuterSynergy is not running. MainWindow@Synergy est en train de démarrerSynergy is starting. MainWindowLLe serveur Synergy n'a pas été détectéSynergy server not found MainWindowüSynergy s'est terminé de façon inattendue avec le code d'erreur %1.<br><br> Vous trouverez plus de détails dans le fichier logfSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowNSynergy s'est arrêté suite à une erreur Synergy terminated with an error MainWindowXL'excécutable du client Synergy n'existe pas5The executable for the synergy client does not exist. MainWindowXL'exécutable du serveur Synergy n'existe pas5The executable for the synergy server does not exist. MainWindow:L'exécutable<br><br>%1<br><br>n'a pas pu être correctement lancé, alors qu'il existe bien. Vérifiez vos permissions pour lancer ce programme s'il vous plait.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¾Impossible d'écrire le fichier temporaire de configuration, nécessaire au lancement de synergy.NThe temporary configuration file required to start synergy can not be written. MainWindowInconnuUnknown MainWindowÌLe fichier de configuration du serveur synergy n'est pas correct. Voulez vous visualiser ce fichier ? You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow(À &propos de Synergy&About Synergy...MainWindowBaseAppliquer&ApplyMainWindowBaseParcourir &Browse...MainWindowBase~Client (utilise le clavier et la souris d'un autre ordinateur):4&Client (use another computer's keyboard and mouse):MainWindowBase8Le fichier de &configuration&Configuration file:MainWindowBase0Configurer le serveur...&Configure Server...MainWindowBaseQuitter&QuitMainWindowBasezServeur (partager la souris et le clavier de cet ordinateur):3&Server (share this computer's mouse and keyboard):MainWindowBase&Démarrer&StartMainWindowBase:Configurer interactivement : Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase*Éditer les paramètres Edit settingsMainWindowBaseJournalLogMainWindowBaseQuitterQuitMainWindowBasePrêtReadyMainWindowBaseExécuterRunMainWindowBase$Lancer l'Assistant Run WizardMainWindowBaseVoir l'état S&how StatusMainWindowBase ArrêtS&topMainWindowBaseJSauvegarder la configuration &sous...Save configuration &as...MainWindowBase€Sauvegarder la configuration générée du serveur dans un fichier.@Save the interactively generated server configuration to a file.MainWindowBaseParamètresSettingsMainWindowBaseArrêterStopMainWindowBaseSynergySynergyMainWindowBaseInconnuUnknownMainWindowBaseLUtiliser la configuration existante : Use existing configuration:MainWindowBaseSans nomUnnamedNewScreenWidget`Synergy Configurations (*.conf);;All files (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectnConfiguration Synergy (*.sgc);; Tous les fichiers (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjecthLa barre des tâches n'est pas disponible, fermeture.%System tray is unavailable, quitting.QObject4Le nom de l'écran est videScreen name is emptyScreenSettingsDialog¸Le nom de l'écran ne peut pas être vide. Merci de saisir un nom, ou de fermer cette fenêtre.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog&Ajouter&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBaseCoins morts &Dead cornersScreenSettingsDialogBaseCorrectifs&FixesScreenSettingsDialogBase,Touches de combinaison&Modifier keysScreenSettingsDialogBase&Supprimer&RemoveScreenSettingsDialogBaseMaj:&Shift:ScreenSettingsDialogBase A&liasA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseBas-gauche Bottom-leftScreenSettingsDialogBaseBas-droit Bottom-rightScreenSettingsDialogBase&Taille des &coins : Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBasePCorrige la touche Verrouillage majusculeFix CAPS LOCK keyScreenSettingsDialogBasePCorrige la touche Verrouillage numériqueFix NUM LOCK keyScreenSettingsDialogBaseRCorrige la touche Verrouillage défilementFix SCROLL LOCK keyScreenSettingsDialogBase6Corrige XTest pour XineramaFix XTest for XineramaScreenSettingsDialogBase &eta:M&eta:ScreenSettingsDialogBaseMétaMetaScreenSettingsDialogBase AucunNoneScreenSettingsDialogBase Super:S&uper:ScreenSettingsDialogBaseNom de l'écran Screen &name:ScreenSettingsDialogBase,Paramètres d'affichageScreen SettingsScreenSettingsDialogBaseMajShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBaseHaut-gaucheTop-leftScreenSettingsDialogBaseHaut-droit Top-rightScreenSettingsDialogBase<center>Écran: <b>%1</b></center><br>Double cliquer pour modifier les réglages<br>Faire glisser vers la corbeille pour le supprimero
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&Bas-gauche &Bottom-leftServerConfigDialogBase>Vérifier les clients toutes les&Check clients everyServerConfigDialogBaseCoins morts &Dead cornersServerConfigDialogBase&Editer&EditServerConfigDialogBase$Raccourcis clavier&HotkeysServerConfigDialogBase&Nouveau&NewServerConfigDialogBase&Options&OptionsServerConfigDialogBase&Supprimer&RemoveServerConfigDialogBaseBasculer&SwitchServerConfigDialogBaseA&ctionsA&ctionsServerConfigDialogBase8Configuration serveur avancéAdvanced server settingsServerConfigDialogBaseBas-d&roit Bottom-ri&ghtServerConfigDialogBasepConfigurer l'organisation de votre configuration serveur:Configure the layout of your synergy server configuration.ServerConfigDialogBase&Taille des coi&ns : Cor&ner Size:ServerConfigDialogBase†Ne pas prendre la fenêtre au premier plan sur les serveurs Windows.0Don't take &foreground window on Windows serversServerConfigDialogBaseFaire glisser un écran de la grille vers la corbeille pour le supprimer.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase|Faire glisser de nouveaux écrans vers la grille ou déplacer ceux existant. Faire glisser un écran dans la corbeille pour le supprimer. Double cliquer sur un écran pour modifier ses réglages.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBase„Faire glisser ce bouton sur la grille pour ajouter un nouvel écran1Drag this button to the grid to add a new screen.ServerConfigDialogBaseE&diterE&ditServerConfigDialogBase$Raccourcis clavierHotkeysServerConfigDialogBaseNou&veauNe&wServerConfigDialogBaseSuppri&merRe&moveServerConfigDialogBaseDS&ynchroniser les écrans de veilleS&ynchronize screen saversServerConfigDialogBaseÉcrans et liensScreens and linksServerConfigDialogBase*Configuration ServeurServer ConfigurationServerConfigDialogBase*Changer d'écran aprèsSwitch &after waitingServerConfigDialogBaseVChanger d'écran en double-cliquant dans lesSwitch on double &tap withinServerConfigDialogBaseHa&ut-gauche To&p-leftServerConfigDialogBaseHaut-&droit Top-rig&htServerConfigDialogBasePUtiliser des mouvements souris &relatifsUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase<Sauvegarder le journal sous...Save log file to...SettingsDialog&Avancé &AdvancedSettingsDialogBaseVDémarrer &automatiquement le serveur/client"&Automatically start server/clientSettingsDialogBaseT&Masquer lorsque le serveur/client démarre&Hide when server/client startsSettingsDialogBase Interface&nbsp;: &Interface:SettingsDialogBase>Niveau de journalisation&nbsp;:&Logging level:SettingsDialogBase\Démarrer Synergy après l'ouverture de &session&Start Synergy after logging inSettingsDialogBaseParcourir Browse...SettingsDialogBase DebugDebugSettingsDialogBase Debug1Debug1SettingsDialogBase Debug2Debug2SettingsDialogBase ErreurErrorSettingsDialogBase InfosInfoSettingsDialogBaseZEnregistrer le journal dans le fichier&nbsp;: Log to file:SettingsDialogBaseJournalLoggingSettingsDialogBaseRemarqueNoteSettingsDialogBase&Port :P&ort:SettingsDialogBaseNom de l'éc&ran Sc&reen name:SettingsDialogBaseParamètresSettingsSettingsDialogBaseAvertissementWarningSettingsDialogBaseLChoisissez une option s'il vous plait.Please select an option. SetupWizard"Installer Synergy Setup Synergy SetupWizardFClient (ajouter à la configuration)&Client (add to setup)SetupWizardBase@&Serveur (nouvelle installation)&Server (new setup)SetupWizardBase&Serveur ou client ?Server or Client?SetupWizardBase"Installer Synergy Setup SynergySetupWizardBaseðCeci est le premier ordinateur que vous configurez. Votre clavier et votre souris sont connectés à cet ordinateur. Ceci va autoriser à bouger votre souris sur l'écran d'un autre ordinateur. Il ne peut y avoir qu'un serveur dans votre configuration.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseŒVous avez déjà configuré un serveur. Ceci est un ordinateur que vous souhaitez contrôler à partir du clavier et de la souris du serveur. Il peut y avoir beaucoup de clients dans votre configuration.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseInconnuUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_fr.ts0000600000175000017500000013516512006005561021425 0ustar synergysynergy AboutDialogBase About Synergy À propos de Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Inconnu Version: Version: &Ok &Ok ActionDialogBase Configure Action Configurer l'action Choose the action to perform Choisissez l'action à effectuer Press a hotkey Appuyez sur une touche Release a hotkey Relâchez une touche Press and release a hotkey Pressez et relâchez une touche only on these screens uniquement sur ces écrans Switch to screen Basculer vers l'écran Switch in direction Basculer dans la direction left gauche right droite up haut down bas Lock cursor to screen Limiter le curseur à l'écran toggle activer on activé off inactif This action is performed when Cette action est exécutée quand the hotkey is pressed Le raccourci est utilisé the hotkey is released La touche de raccourci est relachée. HotkeyDialogBase Hotkey Raccourci clavier Enter the specification for the hotkey: Saisir la touche de raccourci&nbsp;: MainWindow &Start &Démarrer &File &Fichier &Edit &Editer &Window &Fenêtre &Help &Aide <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>La version %1 est disponible, <a href="%2">visitez le site</a>.</p> Program can not be started Le programme ne peut pas démarrer The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. L'exécutable<br><br>%1<br><br>n'a pas pu être correctement lancé, alors qu'il existe bien. Vérifiez vos permissions pour lancer ce programme s'il vous plait. Synergy client not found Le client Synergy n'est pas détecté The executable for the synergy client does not exist. L'excécutable du client Synergy n'existe pas Hostname is empty Le nom d'hôte est vide Please fill in a hostname for the synergy client to connect to. Veuillez renseigner un nom d'hôte auquel le client Synergy doit se connecter Cannot write configuration file Impossible d'écrire le fichier de configuration. The temporary configuration file required to start synergy can not be written. Impossible d'écrire le fichier temporaire de configuration, nécessaire au lancement de synergy. Configuration filename invalid Le nom du fichier de configuration est incorrect. You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Le fichier de configuration du serveur synergy n'est pas correct. Voulez vous visualiser ce fichier ? Synergy server not found Le serveur Synergy n'a pas été détecté The executable for the synergy server does not exist. L'exécutable du serveur Synergy n'existe pas Synergy terminated with an error Synergy s'est arrêté suite à une erreur Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy s'est terminé de façon inattendue avec le code d'erreur %1.<br><br> Vous trouverez plus de détails dans le fichier log &Stop &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy est en train de démarrer Synergy is not running. Synergy n'est pas en train de s'exécuter Unknown Inconnu Browse for a synergys config file Parcourir pour rechercher un fichier de configuration synergys Save configuration as... Sauvegarder la configuration sous... Save failed Erreur lors de l'enregistrement Could not save configuration to file. Impossible de sauvegarder la configuration MainWindowBase Synergy Synergy Screen name: Unknown Inconnu &Server IP: &Start &Démarrer &Server (share this computer's mouse and keyboard): Serveur (partager la souris et le clavier de cet ordinateur): Use existing configuration: Utiliser la configuration existante : &Configuration file: Le fichier de &configuration &Browse... Parcourir Configure interactively: Configurer interactivement : &Configure Server... Configurer le serveur... &Client (use another computer's keyboard and mouse): Client (utilise le clavier et la souris d'un autre ordinateur): Ready Prêt Log Journal &Apply Appliquer &Elevate IP addresses: &About Synergy... À &propos de Synergy &Quit Quitter Quit Quitter Ctrl+Q Ctrl+Q Run Exécuter Ctrl+S Ctrl+S S&top Arrêt Stop Arrêter Ctrl+T Ctrl+T S&how Status Voir l'état Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Sauvegarder la configuration &sous... Save the interactively generated server configuration to a file. Sauvegarder la configuration générée du serveur dans un fichier. Ctrl+Alt+S Ctrl+Alt+S Settings Paramètres Edit settings Éditer les paramètres Run Wizard Lancer l'Assistant NewScreenWidget Unnamed Sans nom QObject Synergy Configurations (*.sgc);;All files (*.*) Configuration Synergy (*.sgc);; Tous les fichiers (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. La barre des tâches n'est pas disponible, fermeture. ScreenSettingsDialog Screen name is empty Le nom de l'écran est vide The name for a screen can not be empty. Please fill in a name or cancel the dialog. Le nom de l'écran ne peut pas être vide. Merci de saisir un nom, ou de fermer cette fenêtre. ScreenSettingsDialogBase Screen Settings Paramètres d'affichage Screen &name: Nom de l'écran A&liases A&lias &Add &Ajouter &Remove &Supprimer &Modifier keys Touches de combinaison &Shift: Maj: Shift Maj Ctrl Ctrl Alt Alt Meta Méta Super Super None Aucun &Ctrl: &Ctrl: Al&t: Al&t: M&eta: &eta: S&uper: Super: &Dead corners Coins morts Top-left Haut-gauche Top-right Haut-droit Bottom-left Bas-gauche Bottom-right Bas-droit Corner Si&ze: Taille des &coins : &Fixes Correctifs Fix CAPS LOCK key Corrige la touche Verrouillage majuscule Fix NUM LOCK key Corrige la touche Verrouillage numérique Fix SCROLL LOCK key Corrige la touche Verrouillage défilement Fix XTest for Xinerama Corrige XTest pour Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Écran: <b>%1</b></center><br>Double cliquer pour modifier les réglages<br>Faire glisser vers la corbeille pour le supprimer ServerConfigDialogBase Server Configuration Configuration Serveur Screens and links Écrans et liens Drag a screen from the grid to the trashcan to remove it. Faire glisser un écran de la grille vers la corbeille pour le supprimer. Configure the layout of your synergy server configuration. Configurer l'organisation de votre configuration serveur Drag this button to the grid to add a new screen. Faire glisser ce bouton sur la grille pour ajouter un nouvel écran Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Faire glisser de nouveaux écrans vers la grille ou déplacer ceux existant. Faire glisser un écran dans la corbeille pour le supprimer. Double cliquer sur un écran pour modifier ses réglages. Hotkeys Raccourcis clavier &Hotkeys Raccourcis clavier &New &Nouveau &Edit &Editer &Remove &Supprimer A&ctions A&ctions Ne&w Nou&veau E&dit E&diter Re&move Suppri&mer Advanced server settings Configuration serveur avancé &Switch Basculer Switch &after waiting Changer d'écran après ms ms Switch on double &tap within Changer d'écran en double-cliquant dans les &Options &Options &Check clients every Vérifier les clients toutes les Use &relative mouse moves Utiliser des mouvements souris &relatifs S&ynchronize screen savers S&ynchroniser les écrans de veille Don't take &foreground window on Windows servers Ne pas prendre la fenêtre au premier plan sur les serveurs Windows. &Dead corners Coins morts To&p-left Ha&ut-gauche Top-rig&ht Haut-&droit &Bottom-left &Bas-gauche Bottom-ri&ght Bas-d&roit Cor&ner Size: Taille des coi&ns : SettingsDialog Save log file to... Sauvegarder le journal sous... SettingsDialogBase Settings Paramètres &Advanced &Avancé Sc&reen name: Nom de l'éc&ran P&ort: &Port : &Interface: Interface&nbsp;: &Start Synergy after logging in Démarrer Synergy après l'ouverture de &session &Automatically start server/client Démarrer &automatiquement le serveur/client &Hide when server/client starts &Masquer lorsque le serveur/client démarre Logging Journal &Process mode: Service Desktop (legacy) &Logging level: Niveau de journalisation&nbsp;: Log to file: Enregistrer le journal dans le fichier&nbsp;: Browse... Parcourir Error Erreur Warning Avertissement Note Remarque Info Infos Debug Debug Debug1 Debug1 Debug2 Debug2 &Startup SetupWizard Setup Synergy Installer Synergy Please select an option. Choisissez une option s'il vous plait. SetupWizardBase Setup Synergy Installer Synergy Server or Client? Serveur ou client ? &Server (new setup) &Serveur (nouvelle installation) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Ceci est le premier ordinateur que vous configurez. Votre clavier et votre souris sont connectés à cet ordinateur. Ceci va autoriser à bouger votre souris sur l'écran d'un autre ordinateur. Il ne peut y avoir qu'un serveur dans votre configuration. &Client (add to setup) Client (ajouter à la configuration) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Vous avez déjà configuré un serveur. Ceci est un ordinateur que vous souhaitez contrôler à partir du clavier et de la souris du serveur. Il peut y avoir beaucoup de clients dans votre configuration. VersionChecker Unknown Inconnu synergy-1.4.12-Source/src/gui/res/lang/gui_he.qm0000600000175000017500000003540012006005561021370 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBÐC*å^¡À<+[H4ªSWçY¾buÆo§¤×´Ç$b«Œ ÕÏ.c<¡!MG×'xVE!†V¥/3Œ1«`Š¶Þ +Ô>*»,*»$&*Ð%\*ì0Š+Œ…+«`åGË'>GíznJ¹·-…L™b.-UÛ` YïÔ"Uxýô&äAóÐö}SË;N,Çu>³(Z n= î ×nbj)°¯4 ‚º¾þ§ÒÉTEv.!_þeë'ç¨w9dª¸úº¨”¸º¨”]˜ n;H}ïH¦”"ÚO é0®O é1ù]à.ãÂVE ‡¸Ó"iC+íYu:.–l_” ÿ}× ÈŠ*Ä*"šl®¨öé#u«ŽøÏ««9«n«›¡-»«›¢-ôÄ:ÓOÄ:Ó#Øç¹Ô+dñ$Z,eö±ÉïüÊJ!"QJm-iz/fË@dà攄(ÿ1¬( n™4.d"‘{ã$™œ6>°žŽÄ FÎç>5éJž-Gëꞧ £3£=ñT †k@d#$‚ï<ŠÁ„¤µÞ%û/lY1S}F•'­€ÂnPŸC*o»ó%—÷¸‰t Öjà Jz/Ÿ v®~&  ”(÷ -5  OøŽë P¢n(¤ dö¹ ~5Ó(L ¤hÞ4i ±¥z¹ Ö„~ ȹ¹ >î2D |ßÚ!½ ŒFåŸ ŒFå$Þ žýZÛ ® ¸% ÈcÄ+( àKG RVŽ~ RVŽ0 RVŽñ RVŽ5× R÷® å Tƒä‘ V½4X šÚ· «c%V »sS »s/ã Äcþ)_ ÞF¤ 2 ^®` /ó 4pÄ)Ô i!Î ¼ rù3 zkÙ¿ ‰P0 àx4& è]^ å ^0X=‰ý>ä &PôžƒŽ ’r Ó> 5ò¬Š ƒýù0õi6 &ÐÙéÕè&OkAboutDialogBaseÐÕÓÕê Synergy About SynergyAboutDialogBaseÜÐ ÙÓÕâUnknownAboutDialogBase ÒÙèáÐ:Version:AboutDialogBase Ñ×è äâÕÜÔ ÜÑÙæÕâChoose the action to performActionDialogBaseÔÒÓè äâÕÜÔConfigure ActionActionDialogBase*àâÜ Ðê áÞß ÔâÛÑè ÑÞáÚLock cursor to screenActionDialogBase$Ü×ÙæÔ âÜ Þçé ÛÜéÔÕPress a hotkeyActionDialogBase,Ü×ÙæÔ Õé×èÕè Þçé ÛÜéÔÕPress and release a hotkeyActionDialogBaseé×èÕè Þçé ÛÜéÔÕRelease a hotkeyActionDialogBaseÔ×Üã ÑÛÙÕÕßSwitch in directionActionDialogBaseâÑÕè ÜÞáÚSwitch to screenActionDialogBase$ÔäâÕÜÔ ÞÑÕæâê ÛÐéèThis action is performed whenActionDialogBaseÜÞØÔdownActionDialogBaseéÞÐÜleftActionDialogBase ÛÙÑÕÙoffActionDialogBaseÓÜÕçonActionDialogBaseèç ÑÞáÛÙÝ ÔÐÜÕonly on these screensActionDialogBaseÙÞÙßrightActionDialogBaseÔÞçé Ü×Õåthe hotkey is pressedActionDialogBaseÔÞçé ÐÙàÕ Ü×Õåthe hotkey is releasedActionDialogBaseÔÓÜçÔ\ÛÙÑÕÙtoggleActionDialogBase ÜÞâÜÔupActionDialogBase6ÔÛàá äÙèÕØ âÑÕè Þçé ÔçÙæÕè:'Enter the specification for the hotkey:HotkeyDialogBaseÞçé çÙæÕèHotkeyHotkeyDialogBase &âèÙÛÔ&Edit MainWindow &çÕÑå&File MainWindow â&ÖèÔ&Help MainWindowÔê×Ü&Start MainWindowâæÕè&Stop MainWindow &×ÜÕß&Window MainWindowl<p>ÒÙèáÐ %1 ÖÞÙàÔ Ûâê, <a href="%2">âÑÕè ÜÐêè</a>.</p>C

Version %1 is now available, visit website.

 MainWindow8ÞæÙÐê çÕÑå ÔÒÓèÕê éÜ Synergy!Browse for a synergys config file MainWindow:ÜÐ àÙêß ÜÛêÕÑ Ðê çÕÑå ÔÔÒÓèÕêCannot write configuration file MainWindow2éÝ çÕÑå ÔÔÒÓèÕê ÐÙàÕ ×ÕçÙConfiguration filename invalid MainWindowÜÐ æÕÙß éÝ Þ×éÑHostname is empty MainWindowTÐàÐ æÙÙß éÝ Þ×éÑ éÜçÕ× Synergy Ùê×Ñè ÐÜÙÕ.?Please fill in a hostname for the synergy client to connect to. MainWindow0ÜÐ àÙêß ÜÔäâÙÜ Ðê ÔêÕÛàÔProgram can not be started MainWindow8éÞÕè ÔÒÓèÕê çÕàäÙÒÕèæÙÔ Û...Save configuration as... MainWindowéÞÙèÔ àÛéÜÔ Save failed MainWindow(ÜçÕ× Synergy ÜÐ àÞæÐSynergy client not found MainWindowSynergy ÜÐ èåSynergy is not running. MainWindowSynergy ÞÐê×ÜSynergy is starting. MainWindow,éèê Ô-Synergy ÜÐ àÞæÐ.Synergy server not found MainWindow¶Synergy àáÒèÔ ÑÐÕäß ÜÐ æäÕÙ âÝ éÒÙÐÔ Þáäè %1.<br><br>ÜäèØÙÝ àÕáäÙÝ, äàÕ ÜçÕÑå ÔêÙâÕÓ (ÜÕÒ).fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow.Synergy àáÒèÔ âÝ éÒÙÐÔ. Synergy terminated with an error MainWindow@êÕÛàê ÔÜçÕ× éÜ Synergy ÜÐ çÙÙÞê.5The executable for the synergy client does not exist. MainWindow>êÕÛàê Ôéèê éÜ Synergy ÜÐ àÞæÐÔ.5The executable for the synergy server does not exist. MainWindowÄÔÙÙéÕÝ:<br><br>%1<br><br>çÙÙÝ, ÐÚ ÜÐ àÙêß ÜÔäâÙÜÕ. ÑÓÕç ÐÝ ÞÕÒÓèÕê âÑÕèÚ ÔÔèÐéÕê ÔÞêÐÙÞÕê ÜÔäâÜêÕ.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowŽÜÐ àÙêß ÜÛêÕÑ ÜçÕÑå ÔÔÒÓèÕê ÔÖÞàÙ. ÔÓÑè ÔÛè×Ù âÜ Þàê ÜÔäâÙÜ Ðê Synergy.NThe temporary configuration file required to start synergy can not be written. MainWindowÜÐ ÙÓÕâUnknown MainWindow&éÞÕè éÙàÕÙÙÝ&ApplyMainWindowBase ×äé... &Browse...MainWindowBaseN&ÜçÕ× (ÔéêÞé ÑÞçÜÓê ÕâÛÑè éÜ Þ×éÑ Ð×è):4&Client (use another computer's keyboard and mouse):MainWindowBase &ÙæÙÐÔ&QuitMainWindowBaseN&éèê (éêã Ðê ÔÞçÜÓê ÕÔâÛÑè éÜ Þ×éÑ ÖÔ):3&Server (share this computer's mouse and keyboard):MainWindowBaseÔê×Ü&StartMainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBaseéàÔ ÔÒÓèÕê Edit settingsMainWindowBase$êÙâÕÓ äâÙÜÕê (Log)LogMainWindowBase ÙæÙÐÔQuitMainWindowBaseÔäâÜRunMainWindowBaseÔèå Ðéã Run WizardMainWindowBaseÔæÒ &ÞæÑ S&how StatusMainWindowBase â&æÕèS&topMainWindowBase8éÞÕè ÔÒÓèÕê çÕàäÙÒÕèæÙÔ Û...Save configuration &as...MainWindowBase@éÞÕè ÔÒÓèÕê Ôéèê ÔàÕÛ×ÙÕê ÜçÕÑå.@Save the interactively generated server configuration to a file.MainWindowBase ÔÒÓèÕêSettingsMainWindowBaseâæÕèStopMainWindowBaseSynergySynergyMainWindowBaseÜÐ ÙÓÕâUnknownMainWindowBase*ÔéêÞé ÑÔÒÓèÕê ÔçÙÙÞÕêUse existing configuration:MainWindowBase ÜÜÐ éÝUnnamedNewScreenWidget`çÑæÙ ÔÒÓèÕê éÜ Synergy (*.conf);;All Files (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject^çÑæÙ ÔÒÓèÕê éÜ Synergy (*.sgc);;All Files (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject2ÞÒé ÔÞâèÛê ÜÐ ÖÞÙß, ÙÕæÐ.%System tray is unavailable, quitting.QObjectÜÐ ÔÕçÜÓ éÝ ÞáÚScreen name is emptyScreenSettingsDialogp×ÕÑÔ ÜÞÜÐ éÝ ÞáÚ. ÐàÐ ÔçÜÙÓÕ éÝ ÜÞáÚ ÐÕ áÒèÕ Ðê ×ÜÕß ÖÔ.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog &ÔÕáã&AddScreenSettingsDialogBase &Ctrl&Ctrl:ScreenSettingsDialogBase&äÙàÕê ÞêÕê &Dead cornersScreenSettingsDialogBaseÔ&áè&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBaseéÞÕê &àÕáäÙÝ: A&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseéÞÐÜÙê-ê×êÕàÔ Bottom-leftScreenSettingsDialogBaseÙÞàÙê-ê×êÕàÔ Bottom-rightScreenSettingsDialogBase&ÒÕÓÜ ÔäÙàÔ: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseÜÜÐNoneScreenSettingsDialogBaseéÝ ÞáÚ: Screen &name:ScreenSettingsDialogBaseÔÒÓèÕê ÞáÚScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBaseâÜÙÕß-éÞÐÜTop-leftScreenSettingsDialogBaseâÜÙÕß-ÙÞÙß Top-rightScreenSettingsDialogBaseéÞÐÜÙê-ê×êÕàÔ &Bottom-leftServerConfigDialogBase$ÑÓÕç Ðê ÔÜçÕ× &ÑÛÜ&Check clients everyServerConfigDialogBase&äÙàÕê ÞêÕê &Dead cornersServerConfigDialogBase &âèÙÛÔ&EditServerConfigDialogBase&×Óé&NewServerConfigDialogBaseÐ&äéèÕÙÕê&OptionsServerConfigDialogBaseÔ&áè&RemoveServerConfigDialogBase Ô&×ÜäÔ&SwitchServerConfigDialogBaseä&âÕÜÕêA&ctionsServerConfigDialogBase&ÔÒÓèÕê éèê &ÞêçÓÞÕêAdvanced server settingsServerConfigDialogBaseÙÞàÙê-ê×êÕàÔ Bottom-ri&ghtServerConfigDialogBase&ÒÕÓÜ ÔäÙàÔ: Cor&ner Size:ServerConfigDialogBaseBÒèÕè Ðê ÛäêÕè ÖÔ Üèéê ÜÔÕáäê ÞáÚ.1Drag this button to the grid to add a new screen.ServerConfigDialogBase ÛèÙÛÔE&ditServerConfigDialogBase×ÓéNe&wServerConfigDialogBaseÔáèÔRe&moveServerConfigDialogBase áàÛèß &éÕÞèÙ ÞáÚS&ynchronize screen saversServerConfigDialogBaseÞáÛÙÝ Õ×ÙÑÕèÙÝScreens and linksServerConfigDialogBaseÔÒÓèÕê éèêServer ConfigurationServerConfigDialogBase(Ô×Üã ÜÐ×è Ô&ÞêàÔ éÜ Switch &after waitingServerConfigDialogBase.Ô×Üã ÑÜ×ÙæÔ &ÛäÕÜÔ ÑêÕÚSwitch on double &tap withinServerConfigDialogBaseéÞÐÜÙê-âÜÙÕàÔ To&p-leftServerConfigDialogBaseÙÞàÙê-âÜÙÕàÔ Top-rig&htServerConfigDialogBase2ÔéêÞé ÑÔÖÖÕê âÛÑè &Ù×áÙÕêUse &relative mouse movesServerConfigDialogBaseÐÜäÙÕê éàÙÔmsServerConfigDialogBase Þê&çÓÝ &AdvancedSettingsDialogBase@ÔäâÜ Ðê Ôéèê\ÜçÕ× ÑÐÕäß &ÐÕØÕÞØÙ"&Automatically start server/clientSettingsDialogBase2&Ôáêè âÝ ÔäâÜê Ôéèê\ÔÜçÕ×&Hide when server/client startsSettingsDialogBase,&èÞê êÙâÕÓ äâÕÜÔ (Log)&Logging level:SettingsDialogBase:ÔäâÜ Ðê Synergy ÜÐ×è ÔÔê×ÑèÕê&Start Synergy after logging inSettingsDialogBaseâÙÕß... Browse...SettingsDialogBase DebugDebugSettingsDialogBase Debug1Debug1SettingsDialogBase Debug2Debug2SettingsDialogBase éÒÙÐÔErrorSettingsDialogBaseÞÙÓâInfoSettingsDialogBaseêÙâÕÓ ÜçÕÑå:  Log to file:SettingsDialogBase"êÙâÕÓ äâÕÜÔ (Log)LoggingSettingsDialogBaseÔâèÔNoteSettingsDialogBase &äÕèØ:P&ort:SettingsDialogBase&éÝ ÞáÚ: Sc&reen name:SettingsDialogBase ÔÒÓèÕêSettingsSettingsDialogBase éÙÝ ÜÑWarningSettingsDialogBaseÐàÐ Ñ×è ÐÕäæÙÔ.Please select an option. SetupWizardÔÒÓèê Synergy Setup Synergy SetupWizard$ÜçÕ× (ÔÕáã ÜÔêçàÔ)&Client (add to setup)SetupWizardBase"&éèê (ÔêçàÔ ×ÓéÔ)&Server (new setup)SetupWizardBaseéèê ÐÕ ÜçÕ×?Server or Client?SetupWizardBaseÔÒÓèê Synergy Setup SynergySetupWizardBase$ÖÔÕ ÔÞ×éÑ ÔèÐéÕß éÐêÝ ÞÒÓÙèÙÝ. ÔÞçÜÓê ÕÔâÛÑè Þ×ÕÑèÙÝ ÜÞ×éÑ ÖÔ. ÔÒÓèÔ ÖÕ êÐäéè ÜÛÝ ÜÔÖÙÖ Ðê ÔâÛÑè ÐÜ ÔÞáÚ éÜ Þ×éÑ Ð×è. ÜÛß, Ðäéè ÜÔÒÓÙè èç éèê Ð×Ó.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase²ÛÑè ÔÒÓèê éèê. Ñ×èê ÜéÜÕØ ÑÞ×éÑ ÖÔ ÑÐÞæâÕê ÔÞçÜÓê ÕÔâÛÑè éÜ Ôéèê. àÙêß ÜÔÒÓÙè ÛÞÔ ÜçÕ×Õê.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseÜÐ ÙÓÕâUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_he.ts0000600000175000017500000013363112006005561021406 0ustar synergysynergy AboutDialogBase About Synergy ×ודות Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown ×œ× ×™×“×•×¢ Version: גירס×: &Ok &×ישור ActionDialogBase Configure Action הגדר פעולה Choose the action to perform בחר פעולה לביצוע Press a hotkey לחיצה על מקש כלשהו Release a hotkey שחרור מקש כלשהו Press and release a hotkey לחיצה ושחרור מקש כלשהו only on these screens רק ×‘×ž×¡×›×™× ×”×לו Switch to screen עבור למסך Switch in direction החלף בכיוון left שמ×ל right ימין up למעלה down למטה Lock cursor to screen נעל ×ת סמן העכבר במסך toggle הדלקה\כיבוי on דלוק off כיבוי This action is performed when הפעולה מבוצעת ×›×שר the hotkey is pressed המקש לחוץ the hotkey is released המקש ×ינו לחוץ HotkeyDialogBase Hotkey מקש קיצור Enter the specification for the hotkey: הכנס פירוט עבור מקש הקיצור: MainWindow &Start התחל &File &קובץ &Edit &עריכה &Window &חלון &Help ×¢&זרה <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>×’×™×¨×¡× %1 זמינה כעת, <a href="%2">עבור ל×תר</a>.</p> Program can not be started ×œ× × ×™×ª×Ÿ להפעיל ×ת התוכנה The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. היישו×:<br><br>%1<br><br>קיי×, ×ך ×œ× × ×™×ª×Ÿ להפעילו. בדוק ×× ×ž×•×’×“×¨×•×ª עבורך ההר×שות המת×ימות להפעלתו. Synergy client not found לקוח Synergy ×œ× × ×ž×¦× The executable for the synergy client does not exist. תוכנת הלקוח של Synergy ×œ× ×§×™×™×ž×ª. Hostname is empty ×œ× ×¦×•×™×Ÿ ×©× ×ž×—×©×‘ Please fill in a hostname for the synergy client to connect to. ×× × ×¦×™×™×Ÿ ×©× ×ž×—×©×‘ שלקוח Synergy יתחבר ×ליו. Cannot write configuration file ×œ× × ×™×ª×Ÿ לכתוב ×ת קובץ ההגדרות The temporary configuration file required to start synergy can not be written. ×œ× × ×™×ª×Ÿ לכתוב לקובץ ההגדרות הזמני. הדבר הכרחי על מנת להפעיל ×ת Synergy. Configuration filename invalid ×©× ×§×•×‘×¥ ההגדרות ×ינו חוקי You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found שרת ×”-Synergy ×œ× × ×ž×¦×. The executable for the synergy server does not exist. תוכנת השרת של Synergy ×œ× × ×ž×¦××”. Synergy terminated with an error Synergy נסגרה ×¢× ×©×’×™××”. Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy נסגרה ב×ופן ×œ× ×¦×¤×•×™ ×¢× ×©×’×™××” מספר %1.<br><br>×œ×¤×¨×˜×™× × ×•×¡×¤×™×, פנו לקובץ התיעוד (לוג). &Stop עצור service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy מ×תחל Synergy is not running. Synergy ×œ× ×¨×¥ Unknown ×œ× ×™×“×•×¢ Browse for a synergys config file מצי×ת קובץ הגדרות של Synergy Save configuration as... שמור הגדרות קונפיגורציה ×›... Save failed שמירה נכשלה Could not save configuration to file. MainWindowBase Synergy Synergy Screen name: Unknown ×œ× ×™×“×•×¢ &Server IP: &Start התחל &Server (share this computer's mouse and keyboard): &שרת (שתף ×ת המקלדת והעכבר של מחשב ×–×”): Use existing configuration: השתמש בהגדרות הקיימות &Configuration file: &Browse... חפש... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): &לקוח (השתמש במקלדת ועכבר של מחשב ×חר): Ready Log תיעוד פעילות (Log) &Apply &שמור ×©×™× ×•×™×™× &Elevate IP addresses: &About Synergy... &Quit &יצי××” Quit יצי××” Ctrl+Q Ctrl+Q Run הפעל Ctrl+S Ctrl+S S&top ×¢&צור Stop עצור Ctrl+T Ctrl+T S&how Status הצג &מצב Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... שמור הגדרות קונפיגורציה ×›... Save the interactively generated server configuration to a file. שמור הגדרות השרת הנוכחיות לקובץ. Ctrl+Alt+S Ctrl+Alt+S Settings הגדרות Edit settings שנה הגדרות Run Wizard הרץ ×שף NewScreenWidget Unnamed ×œ×œ× ×©× QObject Synergy Configurations (*.sgc);;All files (*.*) קבצי הגדרות של Synergy (*.sgc);;All Files (*.*) Synergy Configurations (*.conf);;All files (*.*) קבצי הגדרות של Synergy (*.conf);;All Files (*.*) System tray is unavailable, quitting. מגש המערכת ×œ× ×–×ž×™×Ÿ, יוצ×. ScreenSettingsDialog Screen name is empty ×œ× ×”×•×§×œ×“ ×©× ×ž×¡×š The name for a screen can not be empty. Please fill in a name or cancel the dialog. חובה ×œ×ž×œ× ×©× ×ž×¡×š. ×× × ×”×§×œ×™×“×• ×©× ×œ×ž×¡×š ×ו סגרו ×ת חלון ×–×”. ScreenSettingsDialogBase Screen Settings הגדרות מסך Screen &name: ×©× ×ž×¡×š: A&liases שמות &נוספי×: &Add &הוסף &Remove ×”&סר &Modifier keys &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super None ×œ×œ× &Ctrl: &Ctrl Al&t: Al&t: M&eta: M&eta: S&uper: &Dead corners &פינות מתות Top-left עליון-שמ×ל Top-right עליון-ימין Bottom-left שמ×לית-תחתונה Bottom-right ימנית-תחתונה Corner Si&ze: &גודל הפינה: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration הגדרות שרת Screens and links ×ž×¡×›×™× ×•×—×™×‘×•×¨×™× Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. גרור ×ת כפתור ×–×” לרשת להוספת מסך. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &חדש &Edit &עריכה &Remove ×”&סר A&ctions פ&עולות Ne&w חדש E&dit כריכה Re&move הסרה Advanced server settings הגדרות שרת &מתקדמות &Switch ×”&חלפה Switch &after waiting החלף ל×חר ×”&מתנה של ms ×לפיות שניה Switch on double &tap within החלף בלחיצה &כפולה בתוך &Options ×&פשרויות &Check clients every בדוק ×ת הלקוח &בכל Use &relative mouse moves השתמש בהזזות עכבר &יחסיות S&ynchronize screen savers סנכרן &שומרי מסך Don't take &foreground window on Windows servers &Dead corners &פינות מתות To&p-left שמ×לית-עליונה Top-rig&ht ימנית-עליונה &Bottom-left שמ×לית-תחתונה Bottom-ri&ght ימנית-תחתונה Cor&ner Size: &גודל הפינה: SettingsDialog Save log file to... SettingsDialogBase Settings הגדרות &Advanced מת&×§×“× Sc&reen name: &×©× ×ž×¡×š: P&ort: &פורט: &Interface: &Start Synergy after logging in הפעל ×ת Synergy ל×חר ההתחברות &Automatically start server/client הפעל ×ת השרת\לקוח ב×ופן &×וטומטי &Hide when server/client starts &הסתר ×¢× ×”×¤×¢×œ×ª השרת\הלקוח Logging תיעוד פעולה (Log) &Process mode: Service Desktop (legacy) &Logging level: &רמת תיעוד פעולה (Log) Log to file: תיעוד לקובץ: Browse... עיון... Error שגי××” Warning ×©×™× ×œ×‘ Note הערה Info מידע Debug Debug Debug1 Debug1 Debug2 Debug2 &Startup SetupWizard Setup Synergy הגדרת Synergy Please select an option. ×× × ×‘×—×¨ ×ופציה. SetupWizardBase Setup Synergy הגדרת Synergy Server or Client? שרת ×ו לקוח? &Server (new setup) &שרת (התקנה חדשה) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. זהו המחשב הר×שון ש××ª× ×ž×’×“×™×¨×™×. המקלדת והעכבר ×ž×—×•×‘×¨×™× ×œ×ž×—×©×‘ ×–×”. הגדרה זו ת×פשר ×œ×›× ×œ×”×–×™×– ×ת העכבר ×ל המסך של מחשב ×חר. לכן, ×פשר להגדיר רק שרת ×חד. &Client (add to setup) לקוח (הוסף להתקנה) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. כבר הגדרת שרת. בחרת לשלוט במחשב ×–×” ב×מצעות המקלדת והעכבר של השרת. ניתן להגדיר כמה לקוחות. VersionChecker Unknown ×œ× ×™×“×•×¢ synergy-1.4.12-Source/src/gui/res/lang/gui_hr-HR.qm0000600000175000017500000005041312006005561021715 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC=O^MÀL+[H4(5SWØY¾suƧ¤%´Ç1f«Œ)bÏAý<¡+–G×9VE+ÏV¥BÓŒ«`!¶Þ©+ÔÜ*»8*»0Û*Ð%h*ì0ž+ŒÛ+«` GË9Gíz'ùJ¹·@ÏL™bAÅUÛ`AX·¹=YïÔ-ZÆÂ-@xýôìÁx.‚ä mëØ>5\ó†ö}Sô;N@ u>í(Z Ž= î5nbj!°°¯4º¾þ5Òɘþ.Ev.7_þ#¬eë: ¨w9Òª¸ú%ÿ­Ã&’º¨”ꨔט Â;H}óH¦”-ÇO éDˆO éF%]àB‰ÂVE õ¸Ó,¨iC>ÅUN™)›Yu:B0l_” }× "cŠ*Ä<‚šl®†¨öé0«Žø¸«í«"«W«›¡A«›¢Ar° Î6*Ä:Ó&>Ä:Ó0‰äöž üç¹Ô>.ñ$Z?¥ö±ÉóüÊJ+W"QJ{-izCË@d(kÜl ,攄§(ÿEÀ( nÁ4.d-|@Ty*{ã1Ÿ€¡ªœ6>㞎ĘÎzÎç>ÃéJž@‹ëêž £3Œ=ñTèk@d/É‚ï{ŠÁ„µÞ%ãC&Õ/lYEK}F•9É€ÂnnŸC<Í»ó2«÷¸‰# ÖjV IÞ_ JzCG kö#4‰ v®~8D ”;G -5 o OøŽ$° P¢n:Þ dö¹$A ~5Ó:| ¤hÞI ±¥z Ö„~‰ ȹ!< >îFv aº®=€ |ßÚ,P ŒFå'0 ŒFå1è žýZ'r ® ¸2( ÈcÄ=ì àKG 9 RVŽz RVŽÖ RVŽ!t RVŽK% R÷®Y Tƒä"$ V½4 šÚ· §|*?a «c2j »s Ê »sC™ Äcþ;³ ÞF¤(» ^®Þ /ó'´ 4pÄ<6 dÙ*â i!Î î rù5 zkÙ! ‰PCØ àx43* è]^ ^D=‰5>ä 43ôžƒw ’rü/åŽt7å*pkC9Dk£1®ú.3zÓ>»ò¬Š) ýùDÕiKa&U redu&OkAboutDialogBaseO Synergyu About SynergyAboutDialogBaseNepoznatoUnknownAboutDialogBaseIna ica:Version:AboutDialogBase:Odaberite radnju za izvoenjeChoose the action to performActionDialogBasePodesite radnjeConfigure ActionActionDialogBase:Zaklju aj pokaziva na zaslonLock cursor to screenActionDialogBase0Pritisnite tipku pre acaPress a hotkeyActionDialogBaseJPritisnite i oslobodite tipku pre acaPress and release a hotkeyActionDialogBase0Oslobodite tipku pre acaRelease a hotkeyActionDialogBase Prebaci u smjeruSwitch in directionActionDialogBase"Prebaci na zaslonSwitch to screenActionDialogBase2Ova radnja se izvodi kadaThis action is performed whenActionDialogBase doljedownActionDialogBase lijevoleftActionDialogBaseIsklju enooffActionDialogBaseUklju enoonActionDialogBase,samo na ovim zaslonimaonly on these screensActionDialogBase desnorightActionDialogBase6je tipka pre aca pritisnutathe hotkey is pressedActionDialogBase6je tipka pre aca osloboenathe hotkey is releasedActionDialogBase uklju i/isklju itoggleActionDialogBasegoreupActionDialogBase,Odredite tipku pre aca'Enter the specification for the hotkey:HotkeyDialogBaseTipka pre acaHotkeyHotkeyDialogBase &Uredi&Edit MainWindow&Datoteka&File MainWindow &Pomo&Help MainWindow&Pokreni&Start MainWindow&Zaustavi&Stop MainWindow&Prozor&Window MainWindow <p>Ina ica %1 trenutno je dostupna, <a href="%2">posjetite web stranicu</a>.</p>C

Version %1 is now available, visit website.

 MainWindowFOdaberite synergy datoteku postavki!Browse for a synergys config file MainWindowLNemogue ispisivanje datoteke postavkiCannot write configuration file MainWindow@Pogreaan naziv datoteke postavkiConfiguration filename invalid MainWindowNNemogue spremanje postavki u datoteku.%Could not save configuration to file. MainWindow0Naziv ra unala nedostajeHostname is empty MainWindowvUpiaite naziv ra unala synergy klijenta na koji se spajate.?Please fill in a hostname for the synergy client to connect to. MainWindow:Program ne mo~e biti pokrenutProgram can not be started MainWindow,Spremi postavke kao...Save configuration as... MainWindow&Neuspjelo spremanje Save failed MainWindow:Synergy klijent nije pronaenSynergy client not found MainWindow,Synergy nije pokrenut.Synergy is not running. MainWindow&Synergy se pokree.Synergy is starting. MainWindowBSynergy poslu~itelj nije pronaenSynergy server not found MainWindowêSynergy je neo ekivano prestao sa radom, s izlaznim kodom of %1.<br><br>Pogledajte izlazni zapis za viae pojedinosti.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowNSynergy je prestao sa radom zbog greake Synergy terminated with an error MainWindowZIzvrana datoteka synergy klijenta ne postoji.5The executable for the synergy client does not exist. MainWindowbIzvrana datoteka synergy poslu~itelja ne postoji.5The executable for the synergy server does not exist. MainWindowIzvrana datoteka<br><br>%1<br><br>ne mo~e se pokrenuti, kao da ne postoji. Provjerite imate li potrebne dozvole za pokretanje ovog programa.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¦Privremena datoteka postavki potrebna za pokretanje synergya ne mo~e biti zapisana.NThe temporary configuration file required to start synergy can not be written. MainWindowNepoznatoUnknown MainWindowÖNiste odabrali valjanu datoteku postavki za synergy poslu~itelj. }elite li sada odabrati datoteku postavki?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow&O Synergyu...&About Synergy...MainWindowBase&Primijeni&ApplyMainWindowBase&Pregledaj... &Browse...MainWindowBasel&Klijent (koristite mia i tipkovnicu drugog ra unala):4&Client (use another computer's keyboard and mouse):MainWindowBase$Datoteka postavki:&Configuration file:MainWindowBase0&Podesite poslu~itelj...&Configure Server...MainWindowBase&Zatvori&QuitMainWindowBasen&Poslu~itelj (dijelite mia i tipkovnicu ovog ra unala):3&Server (share this computer's mouse and keyboard):MainWindowBase&Pokreni&StartMainWindowBase,Podesite interaktivno:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBaseUredi postavke Edit settingsMainWindowBase ZapisLogMainWindowBaseZatvoriQuitMainWindowBaseSpremanReadyMainWindowBasePokreniRunMainWindowBase Pokeni arobnjak Run WizardMainWindowBaseP&rika~i status S&how StatusMainWindowBaseZ&austaviS&topMainWindowBase,Spremi postavke kao...Save configuration &as...MainWindowBase„Spremi interaktivno generirane postavke poslu~itelja u datoteku...@Save the interactively generated server configuration to a file.MainWindowBasePostavkeSettingsMainWindowBaseZaustaviStopMainWindowBaseSynergySynergyMainWindowBaseNepoznatoUnknownMainWindowBase6Koristi postojee postavke:Use existing configuration:MainWindowBaseNeimenovanUnnamedNewScreenWidgetZSynergy postavke (*.conf);;Sve datoteke (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectXSynergy postavke (*.sgc);;Sve datoteke (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectTObavijesna ikona je nedostupna, otkazujem.%System tray is unavailable, quitting.QObject2Naziv zaslona nije upisanScreen name is emptyScreenSettingsDialog–Naziv zaslona ne mo~e biti prazan. Upiate naziv ili zatvorite ovaj dijalog.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog &Dodaj&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBase&Mrtvi kutovi &Dead cornersScreenSettingsDialogBase&Popraci&FixesScreenSettingsDialogBase &Promijeni tipke&Modifier keysScreenSettingsDialogBase&Ukloni&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBaseN&adimciA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseDolje-lijevo Bottom-leftScreenSettingsDialogBaseDolje-desno Bottom-rightScreenSettingsDialogBaseVeli ina ku&ta: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase.Popravi CAPS LOCK tipkuFix CAPS LOCK keyScreenSettingsDialogBase,Popravi NUM LOCK tipkuFix NUM LOCK keyScreenSettingsDialogBase2Popravi SCROLL LOCK tipkuFix SCROLL LOCK keyScreenSettingsDialogBase2Popravi XTest za XineramaFix XTest for XineramaScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNijedanNoneScreenSettingsDialogBaseS&uper:S&uper:ScreenSettingsDialogBaseNaziv &zaslona: Screen &name:ScreenSettingsDialogBase Postavke zaslonaScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBaseGore-lijevoTop-leftScreenSettingsDialogBaseGore-desno Top-rightScreenSettingsDialogBase$<center>Zaslon: <b>%1</b></center><br>Dvostruko kliknite za ureivanje postavki<br>Za uklanjanje zaslona dovucite ga do ikone smea i ispustite gao
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&Dolje-lijevo &Bottom-leftServerConfigDialogBase0&Provjeri klijent svakih&Check clients everyServerConfigDialogBase&Mrtvi kutovi &Dead cornersServerConfigDialogBase &Uredi&EditServerConfigDialogBase&Tipke pre aca&HotkeysServerConfigDialogBase &Nova&NewServerConfigDialogBase&Mogunosti&OptionsServerConfigDialogBase&Ukloni&RemoveServerConfigDialogBase&Uklju i&SwitchServerConfigDialogBaseR&adnjeA&ctionsServerConfigDialogBase<Napredne postavke poslu~iteljaAdvanced server settingsServerConfigDialogBaseDolje-de&sno Bottom-ri&ghtServerConfigDialogBaseTPodesite izlaz vaaeg synergy poslu~itelja.:Configure the layout of your synergy server configuration.ServerConfigDialogBaseVel&i ina kuta: Cor&ner Size:ServerConfigDialogBasexNe uzimaj &prozor u prednjem planu na Windows poslu~iteljima0Don't take &foreground window on Windows serversServerConfigDialogBasejZa uklanjanje odvucite zaslon iz polja u ikonu smea.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseZDovucite novi zaslon u odabrano polje ili premjestite iz trenutnog polja. Za brisanje zaslona odvucite ga u ikonu smea. Za ureivanje postavki dvostruko kliknite na zaslon.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasehPovucite ovu ikonu zaslona do odabranog polja ispod.1Drag this button to the grid to add a new screen.ServerConfigDialogBase U&rediE&ditServerConfigDialogBaseTipke pre acaHotkeysServerConfigDialogBase No&vaNe&wServerConfigDialogBaseUk&loniRe&moveServerConfigDialogBase.U&skladi  uvare zaslonaS&ynchronize screen saversServerConfigDialogBase&Zasloni i povezniceScreens and linksServerConfigDialogBase*Postavke poslu~iteljaServer ConfigurationServerConfigDialogBase,Uklju i &nakon  ekanjaSwitch &after waitingServerConfigDialogBase<Uklju i dvostrukim &dodirom zaSwitch on double &tap withinServerConfigDialogBaseGo&re-lijevo To&p-leftServerConfigDialogBaseGore-des&no Top-rig&htServerConfigDialogBase>Koristi &relativne pokrete miaaUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase6Spremi datoteku zapisa u...Save log file to...SettingsDialog&Napredno &AdvancedSettingsDialogBaseN&Automatski pokreni poslu~itelj/klijent"&Automatically start server/clientSettingsDialogBaseV&Sakrij kada se poslu~itelj/klijent pokrene&Hide when server/client startsSettingsDialogBase&Su elje: &Interface:SettingsDialogBase.&Razina prijavljivanja:&Logging level:SettingsDialogBase<&Pokreni Synergy nakon prijave&Start Synergy after logging inSettingsDialogBaseOdaberi... Browse...SettingsDialogBase$Otklanjanje greakeDebugSettingsDialogBase&Otklanjanje greake1Debug1SettingsDialogBase&Otklanjanje greake2Debug2SettingsDialogBase GreakaErrorSettingsDialogBaseInfoInfoSettingsDialogBase&Prijava u datoteku: Log to file:SettingsDialogBasePrijavljivanjeLoggingSettingsDialogBaseNapomenaNoteSettingsDialogBase U&laz:P&ort:SettingsDialogBaseNa&ziv zaslona: Sc&reen name:SettingsDialogBasePostavkeSettingsSettingsDialogBaseUpozorenjeWarningSettingsDialogBase6Molim, odaberite mogunost.Please select an option. SetupWizard Podesite Synergy Setup Synergy SetupWizard<&Klijent (dodaj u podeaavanje)&Client (add to setup)SetupWizardBase>&Poslu~itelj (novo podeaavanje)&Server (new setup)SetupWizardBase0Poslu~itelj ili klijent?Server or Client?SetupWizardBase Podesite Synergy Setup SynergySetupWizardBase¤Ovo je prvo ra unalo koje podeaavate. Vaaa tipkovnica i mia su spojeni na ovo ra unalo. Ovo e vam omoguiti da premjestite vaa mia na zaslon drugog ra unala. Mo~e bit samo jedan poslu~itelj u vaaim postavkama.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseNVe ste podesili poslu~itelj. Ovo je ra unalo koje ~elite kontrolirati koristei poslu~iteljevu tipkovnicu i mia. Mo~e postojati mnogo klijenata u vaaim podeaavanjima.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseNepoznatoUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_hr-HR.ts0000600000175000017500000013424712006005561021736 0ustar synergysynergy AboutDialogBase About Synergy O Synergyu <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Nepoznato Version: InaÄica: &Ok &U redu ActionDialogBase Configure Action Podesite radnje Choose the action to perform Odaberite radnju za izvoÄ‘enje Press a hotkey Pritisnite tipku preÄaca Release a hotkey Oslobodite tipku preÄaca Press and release a hotkey Pritisnite i oslobodite tipku preÄaca only on these screens samo na ovim zaslonima Switch to screen Prebaci na zaslon Switch in direction Prebaci u smjeru left lijevo right desno up gore down dolje Lock cursor to screen ZakljuÄaj pokazivaÄ na zaslon toggle ukljuÄi/iskljuÄi on UkljuÄeno off IskljuÄeno This action is performed when Ova radnja se izvodi kada the hotkey is pressed je tipka preÄaca pritisnuta the hotkey is released je tipka preÄaca osloboÄ‘ena HotkeyDialogBase Hotkey Tipka preÄaca Enter the specification for the hotkey: Odredite tipku preÄaca MainWindow &Start &Pokreni &File &Datoteka &Edit &Uredi &Window &Prozor &Help &Pomoć <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>InaÄica %1 trenutno je dostupna, <a href="%2">posjetite web stranicu</a>.</p> Program can not be started Program ne može biti pokrenut The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. IzvrÅ¡na datoteka<br><br>%1<br><br>ne može se pokrenuti, kao da ne postoji. Provjerite imate li potrebne dozvole za pokretanje ovog programa. Synergy client not found Synergy klijent nije pronaÄ‘en The executable for the synergy client does not exist. IzvrÅ¡na datoteka synergy klijenta ne postoji. Hostname is empty Naziv raÄunala nedostaje Please fill in a hostname for the synergy client to connect to. UpiÅ¡ite naziv raÄunala synergy klijenta na koji se spajate. Cannot write configuration file Nemoguće ispisivanje datoteke postavki The temporary configuration file required to start synergy can not be written. Privremena datoteka postavki potrebna za pokretanje synergya ne može biti zapisana. Configuration filename invalid PogreÅ¡an naziv datoteke postavki You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Niste odabrali valjanu datoteku postavki za synergy poslužitelj. Želite li sada odabrati datoteku postavki? Synergy server not found Synergy poslužitelj nije pronaÄ‘en The executable for the synergy server does not exist. IzvrÅ¡na datoteka synergy poslužitelja ne postoji. Synergy terminated with an error Synergy je prestao sa radom zbog greÅ¡ke Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy je neoÄekivano prestao sa radom, s izlaznim kodom of %1.<br><br>Pogledajte izlazni zapis za viÅ¡e pojedinosti. &Stop &Zaustavi service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy se pokreće. Synergy is not running. Synergy nije pokrenut. Unknown Nepoznato Browse for a synergys config file Odaberite synergy datoteku postavki Save configuration as... Spremi postavke kao... Save failed Neuspjelo spremanje Could not save configuration to file. Nemoguće spremanje postavki u datoteku. MainWindowBase Synergy Synergy Screen name: Unknown Nepoznato &Server IP: &Start &Pokreni &Server (share this computer's mouse and keyboard): &Poslužitelj (dijelite miÅ¡ i tipkovnicu ovog raÄunala): Use existing configuration: Koristi postojeće postavke: &Configuration file: Datoteka postavki: &Browse... &Pregledaj... Configure interactively: Podesite interaktivno: &Configure Server... &Podesite poslužitelj... &Client (use another computer's keyboard and mouse): &Klijent (koristite miÅ¡ i tipkovnicu drugog raÄunala): Ready Spreman Log Zapis &Apply &Primijeni &Elevate IP addresses: &About Synergy... &O Synergyu... &Quit &Zatvori Quit Zatvori Ctrl+Q Ctrl+Q Run Pokreni Ctrl+S Ctrl+S S&top Z&austavi Stop Zaustavi Ctrl+T Ctrl+T S&how Status P&rikaži status Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Spremi postavke kao... Save the interactively generated server configuration to a file. Spremi interaktivno generirane postavke poslužitelja u datoteku... Ctrl+Alt+S Ctrl+Alt+S Settings Postavke Edit settings Uredi postavke Run Wizard Pokeni ćarobnjak NewScreenWidget Unnamed Neimenovan QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy postavke (*.sgc);;Sve datoteke (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy postavke (*.conf);;Sve datoteke (*.*) System tray is unavailable, quitting. Obavijesna ikona je nedostupna, otkazujem. ScreenSettingsDialog Screen name is empty Naziv zaslona nije upisan The name for a screen can not be empty. Please fill in a name or cancel the dialog. Naziv zaslona ne može biti prazan. UpiÅ¡te naziv ili zatvorite ovaj dijalog. ScreenSettingsDialogBase Screen Settings Postavke zaslona Screen &name: Naziv &zaslona: A&liases N&adimci &Add &Dodaj &Remove &Ukloni &Modifier keys &Promijeni tipke &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Nijedan &Ctrl: &Ctrl: Al&t: Al&t: M&eta: M&eta: S&uper: S&uper: &Dead corners &Mrtvi kutovi Top-left Gore-lijevo Top-right Gore-desno Bottom-left Dolje-lijevo Bottom-right Dolje-desno Corner Si&ze: VeliÄina ku&ta: &Fixes &Popraci Fix CAPS LOCK key Popravi CAPS LOCK tipku Fix NUM LOCK key Popravi NUM LOCK tipku Fix SCROLL LOCK key Popravi SCROLL LOCK tipku Fix XTest for Xinerama Popravi XTest za Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Zaslon: <b>%1</b></center><br>Dvostruko kliknite za ureÄ‘ivanje postavki<br>Za uklanjanje zaslona dovucite ga do ikone smeća i ispustite ga ServerConfigDialogBase Server Configuration Postavke poslužitelja Screens and links Zasloni i poveznice Drag a screen from the grid to the trashcan to remove it. Za uklanjanje odvucite zaslon iz polja u ikonu smeća. Configure the layout of your synergy server configuration. Podesite izlaz vaÅ¡eg synergy poslužitelja. Drag this button to the grid to add a new screen. Povucite ovu ikonu zaslona do odabranog polja ispod. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Dovucite novi zaslon u odabrano polje ili premjestite iz trenutnog polja. Za brisanje zaslona odvucite ga u ikonu smeća. Za ureÄ‘ivanje postavki dvostruko kliknite na zaslon. Hotkeys Tipke preÄaca &Hotkeys &Tipke preÄaca &New &Nova &Edit &Uredi &Remove &Ukloni A&ctions R&adnje Ne&w No&va E&dit U&redi Re&move Uk&loni Advanced server settings Napredne postavke poslužitelja &Switch &UkljuÄi Switch &after waiting UkljuÄi &nakon Äekanja ms ms Switch on double &tap within UkljuÄi dvostrukim &dodirom za &Options &Mogućnosti &Check clients every &Provjeri klijent svakih Use &relative mouse moves Koristi &relativne pokrete miÅ¡a S&ynchronize screen savers U&skladi Äuvare zaslona Don't take &foreground window on Windows servers Ne uzimaj &prozor u prednjem planu na Windows poslužiteljima &Dead corners &Mrtvi kutovi To&p-left Go&re-lijevo Top-rig&ht Gore-des&no &Bottom-left &Dolje-lijevo Bottom-ri&ght Dolje-de&sno Cor&ner Size: Vel&iÄina kuta: SettingsDialog Save log file to... Spremi datoteku zapisa u... SettingsDialogBase Settings Postavke &Advanced &Napredno Sc&reen name: Na&ziv zaslona: P&ort: U&laz: &Interface: &SuÄelje: &Start Synergy after logging in &Pokreni Synergy nakon prijave &Automatically start server/client &Automatski pokreni poslužitelj/klijent &Hide when server/client starts &Sakrij kada se poslužitelj/klijent pokrene Logging Prijavljivanje &Process mode: Service Desktop (legacy) &Logging level: &Razina prijavljivanja: Log to file: Prijava u datoteku: Browse... Odaberi... Error GreÅ¡ka Warning Upozorenje Note Napomena Info Info Debug Otklanjanje greÅ¡ke Debug1 Otklanjanje greÅ¡ke1 Debug2 Otklanjanje greÅ¡ke2 &Startup SetupWizard Setup Synergy Podesite Synergy Please select an option. Molim, odaberite mogućnost. SetupWizardBase Setup Synergy Podesite Synergy Server or Client? Poslužitelj ili klijent? &Server (new setup) &Poslužitelj (novo podeÅ¡avanje) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Ovo je prvo raÄunalo koje podeÅ¡avate. VaÅ¡a tipkovnica i miÅ¡ su spojeni na ovo raÄunalo. Ovo će vam omogućiti da premjestite vaÅ¡ miÅ¡ na zaslon drugog raÄunala. Može bit samo jedan poslužitelj u vaÅ¡im postavkama. &Client (add to setup) &Klijent (dodaj u podeÅ¡avanje) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Već ste podesili poslužitelj. Ovo je raÄunalo koje želite kontrolirati koristeći poslužiteljevu tipkovnicu i miÅ¡. Može postojati mnogo klijenata u vaÅ¡im podeÅ¡avanjima. VersionChecker Unknown Nepoznato synergy-1.4.12-Source/src/gui/res/lang/gui_hu-HU.qm0000600000175000017500000004761312006005561021733 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC<_^3Àú+[H4'ñSW”Y¾)uƧ¤%x´Ç0Š«Œ) Ï@§<¡+2G×8šVE+kV¥AeŒÄ«` ³¶Þ«+ÔØ*»ò*»/ÿ*Ð%(*ì0T+Œ+«`±GË8Gíz'µJ¹·?ËL™b@sUÛ`õX·¹ùYïÔ,œZÆÂ,ØxýôÊÁx. ä ëØ>4ró^ö}S®;N>ïu>U(Z 6= î Çnbj!X°¯4¨º¾þ1ÒÉŠþ-¥Ev.—_þ#heë9¨w9dª¸ú%·­Ã&Jº¨”€º¨”ƒ˜ X;H}õH¦”-[O éC"O éD{]àA'ÂVE ¥¸Ó,8iC=¿UN™)CYu:@Úl_” #}× "Š*Ä;–šl®’¨öé/F«Žød«™«Î««›¡@«›¢@:° Î5LÄ:Ó%öÄ:Ó/­äöž ¢ç¹Ô=,ñ$Z>™ö±ÉµüÊJ*ó"QJ'-izAžË@d('Ül +¤攄](ÿD( n«4.d-@Ty)­{ã0½€¡ª½œ6>žŽÄ@Îz¸Îç>3éJž?…ëêž £38=ñTŒk@d.ÿ‚ï'ŠÁ„^µÞ%ÅãC&‰/lYCÏ}F•8Ñ€ÂndŸC;ß»ó1Í÷¸‰"¿ Öjà IÞ_Š JzA× kö#3· v®~7J ”:c -5  OøŽ$R P¢n9ü dö¹#ó ~5Ó9 ¤hÞG ±¥zµ Ö„~Û ȹ â >îDÎ aº®< |ßÚ+æ ŒFå&ê ŒFå1 žýZ'0 ® ¸1J ÈcÄ<ð àKGÝ RVŽ| RVŽP RVŽ! RVŽI£ R÷®û Tƒä!Ø V½4ü šÚ» §|*>Q «c1Š »s r »sB' Äcþ:Ñ ÞF¤(o ^®à /ó'r 4pÄ;P dÙ*„ i!Î ‚ rù- zkÙ# ‰PBl àx42F è]^ ^B¶=‰>ä 3iôžƒ# ’rR/åŽ7å*kC8Rk£0A®ú.2Ó>Uò¬Š(ºýùCqiIá&Ok&OkAboutDialogBaseSynergy névjegy About SynergyAboutDialogBaseIsmeretlenUnknownAboutDialogBaseVerzió:Version:AboutDialogBase.Válasszon egy mqveletetChoose the action to performActionDialogBaseBeállításConfigure ActionActionDialogBase6Kurzor zárolása a képernyQnLock cursor to screenActionDialogBase<Nyomjon le egy gyorsbillentyqtPress a hotkeyActionDialogBaseZNyomja le, majd engedje fel a gyorsbillentyqtPress and release a hotkeyActionDialogBase:Engedje fel a gyorsbillentyqtRelease a hotkeyActionDialogBaseIrányváltásSwitch in directionActionDialogBaseKépernyQváltásSwitch to screenActionDialogBase8Ez a mqvelet történik amikorThis action is performed whenActionDialogBaseledownActionDialogBaseballeftActionDialogBaseKIoffActionDialogBaseBEonActionDialogBase2csak ezeken a képernyQkönonly on these screensActionDialogBasejobbrightActionDialogBase(a gyorsgomb lenyomvathe hotkey is pressedActionDialogBase,a gyorsgomb felengedvethe hotkey is releasedActionDialogBase váltótoggleActionDialogBasefelupActionDialogBaseBAdjon meg leírást a gyorsgombhoz:'Enter the specification for the hotkey:HotkeyDialogBaseGyorsgombHotkeyHotkeyDialogBaseSzerkeszt&Edit MainWindowFájl&File MainWindowSúgó&Help MainWindow &Start&Start MainWindowStop&Stop MainWindow Ablak&Window MainWindow¨<p>A(z) %1 verzió elérhetQvé vált, <a href="%2">látogassa meg weboldalunkat</a>.</p>C

Version %1 is now available, visit website.

 MainWindowNA Synergy konfigurációs fájl kijelölése!Browse for a synergys config file MainWindow@A konfigurációs fájl nem írható.Cannot write configuration file MainWindowBKonfigurációs fájlnév érvénytelenConfiguration filename invalid MainWindowPA konfigurációs fájlt nem lehet menteni.%Could not save configuration to file. MainWindowA gépnév üres.Hostname is empty MainWindowxKérjük adja meg a Synergy kliens gép nevét a csatlakozáshoz.?Please fill in a hostname for the synergy client to connect to. MainWindow6A program nem tud elindulniProgram can not be started MainWindowBMentse másként a konfigurációt...Save configuration as... MainWindow"Mentés sikertelen Save failed MainWindow8Synergy kliens nem találhatóSynergy client not found MainWindow$A Synergy nem fut.Synergy is not running. MainWindow A Synergy indul.Synergy is starting. MainWindow8Synergy szerver nem elérhetQSynergy server not found MainWindow¶A Synergy a következQ hibakóddal lépet ki: %1.<br><br>A részletekért tekintse meg a naplót.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowJA Synergy hibát jelzett, ezért leállt Synergy terminated with an error MainWindowhA Synergy kliens futtatható állománya nem található.5The executable for the synergy client does not exist. MainWindowjA Synergy szerver futtatható állománya nem található.5The executable for the synergy server does not exist. MainWindow A végrehajtandó<br><br>%1<br><br>nem indul, esetleg nem létezik. Kérjük ellenQrizze, hogy rendelkezik-e a szükséges engedélyekkel a futtatáshoz.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow°Az ideiglenes konfigurációs fájl, amely szükséges a Synergy indításához, nem jött létre.NThe temporary configuration file required to start synergy can not be written. MainWindowIsmeretlenUnknown MainWindowäNem adott meg érvényes konfigurációs fájlnevet a synergy szerveren. Meg akarja keresni a konfigurációs fájlt most?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow$Synergy névjegy...&About Synergy...MainWindowBaseAlkalmaz&ApplyMainWindowBaseTallózás... &Browse...MainWindowBase†Kliens (az szerverhez kapcsolt egeret és billentyqzetet használja):4&Client (use another computer's keyboard and mouse):MainWindowBase&Konfigurációs fájl:&Configuration file:MainWindowBase.Szerver konfiguráció...&Configure Server...MainWindowBaseKilépés&QuitMainWindowBasexSzerver (megosztja az ide kapcsolt egeret és billentyqzetet)3&Server (share this computer's mouse and keyboard):MainWindowBase &Start&StartMainWindowBase0Interaktív konfiguráció:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase,Beállítások módosítása Edit settingsMainWindowBase NaplóLogMainWindowBaseKilépésQuitMainWindowBaseKészReadyMainWindowBaseFut :-)RunMainWindowBase$Varázsló futtatása Run WizardMainWindowBaseS&how Status S&how StatusMainWindowBase S&topS&topMainWindowBase,Konfig mentése mint...Save configuration &as...MainWindowBase€Mentse az interaktívan létrehozott szerver konfigurációt fájlba.@Save the interactively generated server configuration to a file.MainWindowBaseBeállításokSettingsMainWindowBaseStopStopMainWindowBaseSynergySynergyMainWindowBaseIsmeretlenUnknownMainWindowBaseBA létezQ konfiguráció használata:Use existing configuration:MainWindowBaseNévtelenUnnamedNewScreenWidget`Synergy konfiguráció (*.conf);;Minden fájl (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject^Synergy konfiguráció (*.sgc);;Minden fájl (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectJRendszer tálca nem elérhetQ, kilépés.%System tray is unavailable, quitting.QObject"KépernyQnév üres.Screen name is emptyScreenSettingsDialogªA képernyQ neve nem lehet üres. Kérem töltse ki a nevet vagy válasza a mégsem gombot.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogHozzáad&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBase&Dead corners &Dead cornersScreenSettingsDialogBase Rögzít&FixesScreenSettingsDialogBase&Módosító billentyqk&Modifier keysScreenSettingsDialogBaseEltávolít&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBaseÁlnevekA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseBal-alsó Bottom-leftScreenSettingsDialogBaseJobb-alsó Bottom-rightScreenSettingsDialogBaseSarokméret: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase,Rögzíti a CAPS LOCK-otFix CAPS LOCK keyScreenSettingsDialogBase*Rögzíti a NUM LOCK-otFix NUM LOCK keyScreenSettingsDialogBase0Rögzíti a SCROLL LOCK-otFix SCROLL LOCK keyScreenSettingsDialogBase,Fix XTest for XineramaFix XTest for XineramaScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNoneNoneScreenSettingsDialogBaseS&uper:S&uper:ScreenSettingsDialogBaseKépernyQnév: Screen &name:ScreenSettingsDialogBase(KépernyQ beállításokScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBaseBal-felsQTop-leftScreenSettingsDialogBaseJobb-felsQ Top-rightScreenSettingsDialogBaseÆ<center>KépernyQ: <b>%1</b></center><br>Dupla klikk a módosításhoz<br>Húzd a szemetesre a törléshezo
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModelBal-alsó &Bottom-leftServerConfigDialogBase(Kliensek ellenQrzése&Check clients everyServerConfigDialogBase&Dead corners &Dead cornersServerConfigDialogBaseSzerkeszt&EditServerConfigDialogBaseGyorsgombok&HotkeysServerConfigDialogBaseÚj&NewServerConfigDialogBaseBeállítások&OptionsServerConfigDialogBaseEltávolít&RemoveServerConfigDialogBase&Switch&SwitchServerConfigDialogBaseA&ctionsA&ctionsServerConfigDialogBase6További szerver beállításokAdvanced server settingsServerConfigDialogBaseJobb-alsó Bottom-ri&ghtServerConfigDialogBasetConfigure the layout of your synergy server configuration.:Configure the layout of your synergy server configuration.ServerConfigDialogBaseSarok méret Cor&ner Size:ServerConfigDialogBase`Don't take &foreground window on Windows servers0Don't take &foreground window on Windows serversServerConfigDialogBasevHúzd a képernyQt a listából a szemetesre, hogy eltávolítsd.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase>Húzza az új képernyQket a listába vagy mozgassa a meglévQket. Húzza a képernyQt a szemetesre, hogy törlQdjön. Dupla kattintással szerkesztheti a beállításokat.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBaserHúzd ezt a gombot a listába, hogy új képernyQt adj hozzá.1Drag this button to the grid to add a new screen.ServerConfigDialogBase E&ditE&ditServerConfigDialogBaseGyorsgombokHotkeysServerConfigDialogBaseNe&wNe&wServerConfigDialogBaseRe&moveRe&moveServerConfigDialogBase:KépernyQvédQk szinkronizálásaS&ynchronize screen saversServerConfigDialogBase0KépernyQk és kapcsolatokScreens and linksServerConfigDialogBase(Szerver konfigurációServer ConfigurationServerConfigDialogBase.Váltás a várakozás utánSwitch &after waitingServerConfigDialogBase8Switch on double &tap withinSwitch on double &tap withinServerConfigDialogBaseBal-felsQ To&p-leftServerConfigDialogBaseJobb-felsQ Top-rig&htServerConfigDialogBase<Relatív egér mozgás használataUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase*Napló mentése mint...Save log file to...SettingsDialog Haladó &AdvancedSettingsDialogBaseJAutomatikus indítás (szerver/kliens) "&Automatically start server/clientSettingsDialogBaseLRejtse el mikor a szerver/kliens indul&Hide when server/client startsSettingsDialogBase&Interface: &Interface:SettingsDialogBase Naplózási szint:&Logging level:SettingsDialogBasePIndítsa a Synergy-t a bejelentkezés után&Start Synergy after logging inSettingsDialogBaseTallózás... Browse...SettingsDialogBase DebugDebugSettingsDialogBase Debug1Debug1SettingsDialogBase Debug2Debug2SettingsDialogBaseHibaErrorSettingsDialogBaseInfóInfoSettingsDialogBaseNapló fájlba: Log to file:SettingsDialogBaseNaplózásLoggingSettingsDialogBaseJegyzetNoteSettingsDialogBase P&ort:P&ort:SettingsDialogBaseKépernyQ neve: Sc&reen name:SettingsDialogBaseBeállításokSettingsSettingsDialogBaseFigyelmeztetésWarningSettingsDialogBase4Kérem válaszon egy opciót.Please select an option. SetupWizard"Synergy beállítás Setup Synergy SetupWizard$Kliens (hozzáadás)&Client (add to setup)SetupWizardBaseSzerver (új)&Server (new setup)SetupWizardBase(Szerver vagy kliens?Server or Client?SetupWizardBase"Synergy beállítás Setup SynergySetupWizardBaseÀEz az elsQ számítógép amit konfigurál. Az Ön billentyqzete és eger ehhez a számítógéphez van csatlakoztatva. LehetQsége lesz átmozgatni az egérkurzort egy másik számítógép képernyQjére. Azonban csak egy szervert állíthat be.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseXMár beállított egy szervert. Ez a számítógép lehet amelyet vezérelhet a szerverre kapcsolt billentyqzet és egér segítségével. Számos kliens gépet felvehet a beállításokban.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseIsmeretlenUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_hu-HU.ts0000600000175000017500000013412012006005561021732 0ustar synergysynergy AboutDialogBase About Synergy Synergy névjegy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Ismeretlen Version: Verzió: &Ok &Ok ActionDialogBase Configure Action Beállítás Choose the action to perform Válasszon egy műveletet Press a hotkey Nyomjon le egy gyorsbillentyűt Release a hotkey Engedje fel a gyorsbillentyűt Press and release a hotkey Nyomja le, majd engedje fel a gyorsbillentyűt only on these screens csak ezeken a képernyÅ‘kön Switch to screen KépernyÅ‘váltás Switch in direction Irányváltás left bal right jobb up fel down le Lock cursor to screen Kurzor zárolása a képernyÅ‘n toggle váltó on BE off KI This action is performed when Ez a művelet történik amikor the hotkey is pressed a gyorsgomb lenyomva the hotkey is released a gyorsgomb felengedve HotkeyDialogBase Hotkey Gyorsgomb Enter the specification for the hotkey: Adjon meg leírást a gyorsgombhoz: MainWindow &Start &Start &File Fájl &Edit Szerkeszt &Window Ablak &Help Súgó <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>A(z) %1 verzió elérhetÅ‘vé vált, <a href="%2">látogassa meg weboldalunkat</a>.</p> Program can not be started A program nem tud elindulni The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. A végrehajtandó<br><br>%1<br><br>nem indul, esetleg nem létezik. Kérjük ellenÅ‘rizze, hogy rendelkezik-e a szükséges engedélyekkel a futtatáshoz. Synergy client not found Synergy kliens nem található The executable for the synergy client does not exist. A Synergy kliens futtatható állománya nem található. Hostname is empty A gépnév üres. Please fill in a hostname for the synergy client to connect to. Kérjük adja meg a Synergy kliens gép nevét a csatlakozáshoz. Cannot write configuration file A konfigurációs fájl nem írható. The temporary configuration file required to start synergy can not be written. Az ideiglenes konfigurációs fájl, amely szükséges a Synergy indításához, nem jött létre. Configuration filename invalid Konfigurációs fájlnév érvénytelen You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Nem adott meg érvényes konfigurációs fájlnevet a synergy szerveren. Meg akarja keresni a konfigurációs fájlt most? Synergy server not found Synergy szerver nem elérhetÅ‘ The executable for the synergy server does not exist. A Synergy szerver futtatható állománya nem található. Synergy terminated with an error A Synergy hibát jelzett, ezért leállt Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. A Synergy a következÅ‘ hibakóddal lépet ki: %1.<br><br>A részletekért tekintse meg a naplót. &Stop Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. A Synergy indul. Synergy is not running. A Synergy nem fut. Unknown Ismeretlen Browse for a synergys config file A Synergy konfigurációs fájl kijelölése Save configuration as... Mentse másként a konfigurációt... Save failed Mentés sikertelen Could not save configuration to file. A konfigurációs fájlt nem lehet menteni. MainWindowBase Synergy Synergy Screen name: Unknown Ismeretlen &Server IP: &Start &Start &Server (share this computer's mouse and keyboard): Szerver (megosztja az ide kapcsolt egeret és billentyűzetet) Use existing configuration: A létezÅ‘ konfiguráció használata: &Configuration file: Konfigurációs fájl: &Browse... Tallózás... Configure interactively: Interaktív konfiguráció: &Configure Server... Szerver konfiguráció... &Client (use another computer's keyboard and mouse): Kliens (az szerverhez kapcsolt egeret és billentyűzetet használja): Ready Kész Log Napló &Apply Alkalmaz &Elevate IP addresses: &About Synergy... Synergy névjegy... &Quit Kilépés Quit Kilépés Ctrl+Q Ctrl+Q Run Fut :-) Ctrl+S Ctrl+S S&top S&top Stop Stop Ctrl+T Ctrl+T S&how Status S&how Status Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Konfig mentése mint... Save the interactively generated server configuration to a file. Mentse az interaktívan létrehozott szerver konfigurációt fájlba. Ctrl+Alt+S Ctrl+Alt+S Settings Beállítások Edit settings Beállítások módosítása Run Wizard Varázsló futtatása NewScreenWidget Unnamed Névtelen QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy konfiguráció (*.sgc);;Minden fájl (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy konfiguráció (*.conf);;Minden fájl (*.*) System tray is unavailable, quitting. Rendszer tálca nem elérhetÅ‘, kilépés. ScreenSettingsDialog Screen name is empty KépernyÅ‘név üres. The name for a screen can not be empty. Please fill in a name or cancel the dialog. A képernyÅ‘ neve nem lehet üres. Kérem töltse ki a nevet vagy válasza a mégsem gombot. ScreenSettingsDialogBase Screen Settings KépernyÅ‘ beállítások Screen &name: KépernyÅ‘név: A&liases Ãlnevek &Add Hozzáad &Remove Eltávolít &Modifier keys Módosító billentyűk &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None None &Ctrl: &Ctrl: Al&t: Al&t: M&eta: M&eta: S&uper: S&uper: &Dead corners &Dead corners Top-left Bal-felsÅ‘ Top-right Jobb-felsÅ‘ Bottom-left Bal-alsó Bottom-right Jobb-alsó Corner Si&ze: Sarokméret: &Fixes Rögzít Fix CAPS LOCK key Rögzíti a CAPS LOCK-ot Fix NUM LOCK key Rögzíti a NUM LOCK-ot Fix SCROLL LOCK key Rögzíti a SCROLL LOCK-ot Fix XTest for Xinerama Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>KépernyÅ‘: <b>%1</b></center><br>Dupla klikk a módosításhoz<br>Húzd a szemetesre a törléshez ServerConfigDialogBase Server Configuration Szerver konfiguráció Screens and links KépernyÅ‘k és kapcsolatok Drag a screen from the grid to the trashcan to remove it. Húzd a képernyÅ‘t a listából a szemetesre, hogy eltávolítsd. Configure the layout of your synergy server configuration. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Húzd ezt a gombot a listába, hogy új képernyÅ‘t adj hozzá. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Húzza az új képernyÅ‘ket a listába vagy mozgassa a meglévÅ‘ket. Húzza a képernyÅ‘t a szemetesre, hogy törlÅ‘djön. Dupla kattintással szerkesztheti a beállításokat. Hotkeys Gyorsgombok &Hotkeys Gyorsgombok &New Új &Edit Szerkeszt &Remove Eltávolít A&ctions A&ctions Ne&w Ne&w E&dit E&dit Re&move Re&move Advanced server settings További szerver beállítások &Switch &Switch Switch &after waiting Váltás a várakozás után ms ms Switch on double &tap within Switch on double &tap within &Options Beállítások &Check clients every Kliensek ellenÅ‘rzése Use &relative mouse moves Relatív egér mozgás használata S&ynchronize screen savers KépernyÅ‘védÅ‘k szinkronizálása Don't take &foreground window on Windows servers Don't take &foreground window on Windows servers &Dead corners &Dead corners To&p-left Bal-felsÅ‘ Top-rig&ht Jobb-felsÅ‘ &Bottom-left Bal-alsó Bottom-ri&ght Jobb-alsó Cor&ner Size: Sarok méret SettingsDialog Save log file to... Napló mentése mint... SettingsDialogBase Settings Beállítások &Advanced Haladó Sc&reen name: KépernyÅ‘ neve: P&ort: P&ort: &Interface: &Interface: &Start Synergy after logging in Indítsa a Synergy-t a bejelentkezés után &Automatically start server/client Automatikus indítás (szerver/kliens) &Hide when server/client starts Rejtse el mikor a szerver/kliens indul Logging Naplózás &Process mode: Service Desktop (legacy) &Logging level: Naplózási szint: Log to file: Napló fájlba: Browse... Tallózás... Error Hiba Warning Figyelmeztetés Note Jegyzet Info Infó Debug Debug Debug1 Debug1 Debug2 Debug2 &Startup SetupWizard Setup Synergy Synergy beállítás Please select an option. Kérem válaszon egy opciót. SetupWizardBase Setup Synergy Synergy beállítás Server or Client? Szerver vagy kliens? &Server (new setup) Szerver (új) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Ez az elsÅ‘ számítógép amit konfigurál. Az Ön billentyűzete és eger ehhez a számítógéphez van csatlakoztatva. LehetÅ‘sége lesz átmozgatni az egérkurzort egy másik számítógép képernyÅ‘jére. Azonban csak egy szervert állíthat be. &Client (add to setup) Kliens (hozzáadás) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Már beállított egy szervert. Ez a számítógép lehet amelyet vezérelhet a szerverre kapcsolt billentyűzet és egér segítségével. Számos kliens gépet felvehet a beállításokban. VersionChecker Unknown Ismeretlen synergy-1.4.12-Source/src/gui/res/lang/gui_it.qm0000600000175000017500000005265612006005561021424 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBCAg^IÀ(+[H4+SW xY¾!uƧ¤) ´Ç4ü«Œ,ÖÏF<¡/G×=dVE/MV¥GŒ ª«`#Ÿ¶Þ¥+ÔÖ*»*»4{*Ð%N*ì0z+Œc+«`×GË<äGíz+GJ¹·E=L™bEåUÛ`!ßX·¹ ÝYïÔ0œZÆÂ0ØxýôâÁx.âä ;ëØ>9ó|ö}S!;NDeu>C(Z ö= îénbj$H°¯40º¾þÒÉ–þ1ÃEv.“_þ&‚eë=ݨw9@ª¸ú)M­Ã)ܺ¨”¨º¨”e˜h;H}ÿH¦”1mO éHÖO éJo]àFÏÂVE ¸Ó0,iCBûUN™-Yu:F`l_” «}× %Š*Ä@€šl®f¨öé3¼«ŽøJ««´«é«›¡Es«›¢E¬° Î9âÄ:Ó)ŠÄ:Ó4+äöž @ç¹ÔBPñ$ZCñö±ÉãüÊJ.×"QJS-izGNË@d+·Ül /Œ攄!C(ÿJ( nË4.d1@Ty-{ã55€¡ª›œ6>"…žŽÄnÎz˜Îç>méJžDùëêžw £3 =ñT¾k@d3_‚ï"ŠÁ„€µÞ%ïãC*%/lYI©}F•=€ÂnvŸC@Õ»ó6=÷¸‰%Ë Öj¸ IÞ_Ì JzG‡ kö#85 v®~;ú ”?5 -5 9 OøŽ'º P¢n>Ä dö¹'C ~5Ó>\ ¤hÞM¡ ±¥z— Ö„~Ý ȹ#Ð >îJ aº®A¬ |ßÚ/Ì ŒFå*| ŒFå5v žýZ*¾ ® ¸5¶ ÈcÄB àKG  RVŽ€ RVŽ RVŽ$ RVŽO½ R÷®c Tƒä$Ò V½4 šÚÁ §|*C§ «c5ö »s#\ »sGá Äcþ?± ÞF¤, ^® /ó*þ 4pÄ@( dÙ.b i!Î V rù+ zkÙ ‰PH( àx46Ä è]^Í ^Hb=‰C>ä 7Ïôžƒ  ’r\/åŽ7å-ìkC=$k£4»®ú.7Ó>Íò¬Š,pýùI%iOýOk&OkAboutDialogBase$Riguardo a Synergy About SynergyAboutDialogBaseSconosciutoUnknownAboutDialogBaseVersione:Version:AboutDialogBase6Scegli l'azione da compiereChoose the action to performActionDialogBase Configura azioneConfigure ActionActionDialogBase>Blocca il cursore sullo schermoLock cursor to screenActionDialogBase Premi una hotkeyPress a hotkeyActionDialogBase6Premi e rilascia una hotkeyPress and release a hotkeyActionDialogBase&Rilascia una hotkeyRelease a hotkeyActionDialogBase$Passa in direzioneSwitch in directionActionDialogBasePassa a schermoSwitch to screenActionDialogBaseNQuesta operazione viene eseguita quandoThis action is performed whenActionDialogBasegiu'downActionDialogBasesinistraleftActionDialogBasedisattivaoffActionDialogBase attivaonActionDialogBase,solo su questi schermionly on these screensActionDialogBase destrarightActionDialogBase.la hotkey viene premutathe hotkey is pressedActionDialogBase4la hotkey viene rilasciatathe hotkey is releasedActionDialogBasescambiatoggleActionDialogBasesuupActionDialogBaseDSpecifica la hotkey da utilizzare:'Enter the specification for the hotkey:HotkeyDialogBase HotkeyHotkeyHotkeyDialogBaseModifica&Edit MainWindowFile&File MainWindow Aiuto&Help MainWindow Avvia&Start MainWindow Ferma&Stop MainWindowFinestra&Window MainWindowœ<p>La versione %1 e' ora disponibile, <a href="%2">visita il sito web</a>.</p>C

Version %1 is now available, visit website.

 MainWindowœSfoglia il contenuto del tuo computer per un file di configurazione di Synergy!Browse for a synergys config file MainWindowXNon posso scrivere il file di configurazioneCannot write configuration file MainWindowXIl nome file di configurazione non è valido.Configuration filename invalid MainWindowrImpossibile salvare la configurazione attuale in un file.%Could not save configuration to file. MainWindow0Il nome macchina è vuotoHostname is empty MainWindow´Si prega di completare il nome macchina per permettere al client Synergy di connettercisi.?Please fill in a hostname for the synergy client to connect to. MainWindowHIl programma non puo' essere avviatoProgram can not be started MainWindowNSalva la configurazione attuale come...Save configuration as... MainWindow&Salvataggio fallito Save failed MainWindownLa componente client di Synergy non è stata individuataSynergy client not found MainWindow4Synergy non è in funzione.Synergy is not running. MainWindow0Synergy si sta avviando.Synergy is starting. MainWindowfLa componente server di Synergy non è stata trovataSynergy server not found MainWindow Synergy si è chiuso inaspettatamente con un codice di uscita di %1.<br><br> Sei pregato di visualizzare il log per maggiori dettagli.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowBSynergy si è chiuso con un errore Synergy terminated with an error MainWindowbL'eseguibile per il client di Synergy non esiste.5The executable for the synergy client does not exist. MainWindow\L'eseguibile per il server Synergy non esiste.5The executable for the synergy server does not exist. MainWindowlL'eseguibile <br><br>%1<br><br>non puo' essere correttamente avviato, anche se esiste. Controlla di avere i permessi necessari ad eseguire il programma (Super User o Administrator?).ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¶Il file temporaneo di configurazione necessario ad avviare Synergy non puo' essere scritto.NThe temporary configuration file required to start synergy can not be written. MainWindowSconosciutoUnknown MainWindowxNon hai specificato un nome di file di configurazione valido per la componente server di Synergy. Vuoi sfogliare il contenuto del tuo computer per il trovare il file di configurazione ora?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow*Riguardo a Synergy...&About Synergy...MainWindowBaseApplica&ApplyMainWindowBaseSfoglia... &Browse...MainWindowBaseŒClient (computer su cui utilizzare il mouse e la tastiera del Server):4&Client (use another computer's keyboard and mouse):MainWindowBase.File di configurazione:&Configuration file:MainWindowBase,Configura il Server...&Configure Server...MainWindowBase Chiudi&QuitMainWindowBasexServer (Condividi il mouse e la tastiera da questo computer)3&Server (share this computer's mouse and keyboard):MainWindowBase Avvia&StartMainWindowBase6Configurazione interattiva:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase*Modifica impostazioni Edit settingsMainWindowBase EventiLogMainWindowBase ChiudiQuitMainWindowBase ProntoReadyMainWindowBase EseguiRunMainWindowBase Esegui il Wizard Run WizardMainWindowBase Visualizza stato S&how StatusMainWindowBase FermaS&topMainWindowBase8Salva configurazione come...Save configuration &as...MainWindowBasetSalva la configurazione interattiva del server in un file.@Save the interactively generated server configuration to a file.MainWindowBaseImpostazioniSettingsMainWindowBase FermaStopMainWindowBaseSynergySynergyMainWindowBaseSconosciutoUnknownMainWindowBaseLUtilizza una configurazione esistente:Use existing configuration:MainWindowBaseSenza nomeUnnamedNewScreenWidgetnConfigurazioni di Synergy (*.conf);;Tutti i files (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectlConfigurazioni di Synergy (*.sgc);;Tutti i files (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject€L'icona nella barra di sistema non è disponibile, sto chiudendo.%System tray is unavailable, quitting.QObject:Il nome dello schermo è vuotoScreen name is emptyScreenSettingsDialogÖIl nome per uno schermo non puo' essere vuoto. Sei pregato di specificare un nome o annullare la richiesta.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogAggiungi&AddScreenSettingsDialogBase Ctrl:&Ctrl:ScreenSettingsDialogBaseAngoli morti &Dead cornersScreenSettingsDialogBasePunti fissi&FixesScreenSettingsDialogBaseTasti speciali&Modifier keysScreenSettingsDialogBaseRimuovi&RemoveScreenSettingsDialogBase Shift:&Shift:ScreenSettingsDialogBaseSoprannomiA&liasesScreenSettingsDialogBaseAlt:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase&In basso a sinistra Bottom-leftScreenSettingsDialogBase"In basso a destra Bottom-rightScreenSettingsDialogBase,Dimensione dell'angolo Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase2Blocca il tasto CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase0Blocca il tasto NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase6Blocca il tasto SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBase2Blocca XTest per XineramaFix XTest for XineramaScreenSettingsDialogBase Meta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNessunoNoneScreenSettingsDialogBase Super:S&uper:ScreenSettingsDialogBase&Nome dello schermo: Screen &name:ScreenSettingsDialogBase4Impostazioni dello schermoScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase$In alto a sinistraTop-leftScreenSettingsDialogBase In alto a destra Top-rightScreenSettingsDialogBase<center>Schermo: <b>%1</b></center><br>Doppio click per modificare le impostazioni<br>Trascina lo schermo nel cestino per rimuoverloo
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&In basso a sinistra &Bottom-leftServerConfigDialogBase0Controlla il client ogni&Check clients everyServerConfigDialogBaseAngoli morti &Dead cornersServerConfigDialogBaseModifica&EditServerConfigDialogBaseHotkeys&HotkeysServerConfigDialogBase Nuovo&NewServerConfigDialogBaseOpzioni&OptionsServerConfigDialogBaseRimuovi&RemoveServerConfigDialogBaseScambia&SwitchServerConfigDialogBaseOperazioniA&ctionsServerConfigDialogBaseDConfigurazioni avanzate del serverAdvanced server settingsServerConfigDialogBase"In basso a destra Bottom-ri&ghtServerConfigDialogBaseLConfigura il layout del server Synergy:Configure the layout of your synergy server configuration.ServerConfigDialogBase.Dimensione dell'angolo: Cor&ner Size:ServerConfigDialogBasevNon prendere la finestra in primo piano sui servers Windows0Don't take &foreground window on Windows serversServerConfigDialogBasexTrascina uno schermo dalla griglia al cestino per rimuoverlo9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseXTrascina nuovi schermi sulla griglia o muovi quelli esistenti. Trascina uno schermo sul cestino per rimuoverlo. Doppio click su uno schermo per modificarne le impostazioni.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBaseŽTrascina questo pulsante sulla griglia per aggiungere un nuovo schermo.1Drag this button to the grid to add a new screen.ServerConfigDialogBaseModificaE&ditServerConfigDialogBaseHotkeysHotkeysServerConfigDialogBase NuovoNe&wServerConfigDialogBaseRimuoviRe&moveServerConfigDialogBase:Sincronizza gli screen saversS&ynchronize screen saversServerConfigDialogBase,Schermi e collegamentiScreens and linksServerConfigDialogBase2Configurazione del ServerServer ConfigurationServerConfigDialogBase<Scambia al termine dell'attesaSwitch &after waitingServerConfigDialogBase0Scambia con doppio toccoSwitch on double &tap withinServerConfigDialogBase$In alto a sinistra To&p-leftServerConfigDialogBase In alto a destra Top-rig&htServerConfigDialogBaseNUtilizza i movimenti del mouse relativiUse &relative mouse movesServerConfigDialogBasemillisecondimsServerConfigDialogBase.Salva il file di log...Save log file to...SettingsDialogAvanzate &AdvancedSettingsDialogBasebAvvia automaticamente la componente server/client"&Automatically start server/clientSettingsDialogBasefNascondi quando partono le componenti server/client&Hide when server/client startsSettingsDialogBaseInterfaccia: &Interface:SettingsDialogBase>Livello di registrazione eventi&Logging level:SettingsDialogBaseNAvvia Synergy dopo l'accesso al sistema&Start Synergy after logging inSettingsDialogBaseSfoglia... Browse...SettingsDialogBase DebugDebugSettingsDialogBase Debug1Debug1SettingsDialogBase Debug2Debug2SettingsDialogBase ErroreErrorSettingsDialogBaseInformazioniInfoSettingsDialogBase<Registra gli eventi in un file Log to file:SettingsDialogBaseRegistro EventiLoggingSettingsDialogBaseNotaNoteSettingsDialogBase Porta:P&ort:SettingsDialogBase&Nome dello schermo: Sc&reen name:SettingsDialogBaseImpostazioniSettingsSettingsDialogBase AvvisoWarningSettingsDialogBase<Pregasi selezionare un'opzionePlease select an option. SetupWizard"Configura Synergy Setup Synergy SetupWizardJClient (aggiungi alla configurazione)&Client (add to setup)SetupWizardBase:Server (nuova configurazione)&Server (new setup)SetupWizardBase Server o Client?Server or Client?SetupWizardBase"Configura Synergy Setup SynergySetupWizardBaseÞQuesto è il primo computer che stai configurando. La tua tastiera e mouse sono connessi a questo computer. Questo ti permette di muovere il tuo mouse sollo schermo di un altro computer. Puo' esserci solo un server nella tua configurazione.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase`Hai già configurato un server. Questo è un computer che vuoi controllare utilizzando la tastiera ed il mouse del server. Possono esserci molti clients nella tua configurazione.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseSconosciutoUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_it.ts0000600000175000017500000013463212006005561021430 0ustar synergysynergy AboutDialogBase About Synergy Riguardo a Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Sconosciuto Version: Versione: &Ok Ok ActionDialogBase Configure Action Configura azione Choose the action to perform Scegli l'azione da compiere Press a hotkey Premi una hotkey Release a hotkey Rilascia una hotkey Press and release a hotkey Premi e rilascia una hotkey only on these screens solo su questi schermi Switch to screen Passa a schermo Switch in direction Passa in direzione left sinistra right destra up su down giu' Lock cursor to screen Blocca il cursore sullo schermo toggle scambia on attiva off disattiva This action is performed when Questa operazione viene eseguita quando the hotkey is pressed la hotkey viene premuta the hotkey is released la hotkey viene rilasciata HotkeyDialogBase Hotkey Hotkey Enter the specification for the hotkey: Specifica la hotkey da utilizzare: MainWindow &Start Avvia &File File &Edit Modifica &Window Finestra &Help Aiuto <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>La versione %1 e' ora disponibile, <a href="%2">visita il sito web</a>.</p> Program can not be started Il programma non puo' essere avviato The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. L'eseguibile <br><br>%1<br><br>non puo' essere correttamente avviato, anche se esiste. Controlla di avere i permessi necessari ad eseguire il programma (Super User o Administrator?). Synergy client not found La componente client di Synergy non è stata individuata The executable for the synergy client does not exist. L'eseguibile per il client di Synergy non esiste. Hostname is empty Il nome macchina è vuoto Please fill in a hostname for the synergy client to connect to. Si prega di completare il nome macchina per permettere al client Synergy di connettercisi. Cannot write configuration file Non posso scrivere il file di configurazione The temporary configuration file required to start synergy can not be written. Il file temporaneo di configurazione necessario ad avviare Synergy non puo' essere scritto. Configuration filename invalid Il nome file di configurazione non è valido. You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Non hai specificato un nome di file di configurazione valido per la componente server di Synergy. Vuoi sfogliare il contenuto del tuo computer per il trovare il file di configurazione ora? Synergy server not found La componente server di Synergy non è stata trovata The executable for the synergy server does not exist. L'eseguibile per il server Synergy non esiste. Synergy terminated with an error Synergy si è chiuso con un errore Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy si è chiuso inaspettatamente con un codice di uscita di %1.<br><br> Sei pregato di visualizzare il log per maggiori dettagli. &Stop Ferma service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy si sta avviando. Synergy is not running. Synergy non è in funzione. Unknown Sconosciuto Browse for a synergys config file Sfoglia il contenuto del tuo computer per un file di configurazione di Synergy Save configuration as... Salva la configurazione attuale come... Save failed Salvataggio fallito Could not save configuration to file. Impossibile salvare la configurazione attuale in un file. MainWindowBase Synergy Synergy Screen name: Unknown Sconosciuto &Server IP: &Start Avvia &Server (share this computer's mouse and keyboard): Server (Condividi il mouse e la tastiera da questo computer) Use existing configuration: Utilizza una configurazione esistente: &Configuration file: File di configurazione: &Browse... Sfoglia... Configure interactively: Configurazione interattiva: &Configure Server... Configura il Server... &Client (use another computer's keyboard and mouse): Client (computer su cui utilizzare il mouse e la tastiera del Server): Ready Pronto Log Eventi &Apply Applica &Elevate IP addresses: &About Synergy... Riguardo a Synergy... &Quit Chiudi Quit Chiudi Ctrl+Q Ctrl+Q Run Esegui Ctrl+S Ctrl+S S&top Ferma Stop Ferma Ctrl+T Ctrl+T S&how Status Visualizza stato Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Salva configurazione come... Save the interactively generated server configuration to a file. Salva la configurazione interattiva del server in un file. Ctrl+Alt+S Ctrl+Alt+S Settings Impostazioni Edit settings Modifica impostazioni Run Wizard Esegui il Wizard NewScreenWidget Unnamed Senza nome QObject Synergy Configurations (*.sgc);;All files (*.*) Configurazioni di Synergy (*.sgc);;Tutti i files (*.*) Synergy Configurations (*.conf);;All files (*.*) Configurazioni di Synergy (*.conf);;Tutti i files (*.*) System tray is unavailable, quitting. L'icona nella barra di sistema non è disponibile, sto chiudendo. ScreenSettingsDialog Screen name is empty Il nome dello schermo è vuoto The name for a screen can not be empty. Please fill in a name or cancel the dialog. Il nome per uno schermo non puo' essere vuoto. Sei pregato di specificare un nome o annullare la richiesta. ScreenSettingsDialogBase Screen Settings Impostazioni dello schermo Screen &name: Nome dello schermo: A&liases Soprannomi &Add Aggiungi &Remove Rimuovi &Modifier keys Tasti speciali &Shift: Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Nessuno &Ctrl: Ctrl: Al&t: Alt: M&eta: Meta: S&uper: Super: &Dead corners Angoli morti Top-left In alto a sinistra Top-right In alto a destra Bottom-left In basso a sinistra Bottom-right In basso a destra Corner Si&ze: Dimensione dell'angolo &Fixes Punti fissi Fix CAPS LOCK key Blocca il tasto CAPS LOCK Fix NUM LOCK key Blocca il tasto NUM LOCK Fix SCROLL LOCK key Blocca il tasto SCROLL LOCK Fix XTest for Xinerama Blocca XTest per Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Schermo: <b>%1</b></center><br>Doppio click per modificare le impostazioni<br>Trascina lo schermo nel cestino per rimuoverlo ServerConfigDialogBase Server Configuration Configurazione del Server Screens and links Schermi e collegamenti Drag a screen from the grid to the trashcan to remove it. Trascina uno schermo dalla griglia al cestino per rimuoverlo Configure the layout of your synergy server configuration. Configura il layout del server Synergy Drag this button to the grid to add a new screen. Trascina questo pulsante sulla griglia per aggiungere un nuovo schermo. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Trascina nuovi schermi sulla griglia o muovi quelli esistenti. Trascina uno schermo sul cestino per rimuoverlo. Doppio click su uno schermo per modificarne le impostazioni. Hotkeys Hotkeys &Hotkeys Hotkeys &New Nuovo &Edit Modifica &Remove Rimuovi A&ctions Operazioni Ne&w Nuovo E&dit Modifica Re&move Rimuovi Advanced server settings Configurazioni avanzate del server &Switch Scambia Switch &after waiting Scambia al termine dell'attesa ms millisecondi Switch on double &tap within Scambia con doppio tocco &Options Opzioni &Check clients every Controlla il client ogni Use &relative mouse moves Utilizza i movimenti del mouse relativi S&ynchronize screen savers Sincronizza gli screen savers Don't take &foreground window on Windows servers Non prendere la finestra in primo piano sui servers Windows &Dead corners Angoli morti To&p-left In alto a sinistra Top-rig&ht In alto a destra &Bottom-left In basso a sinistra Bottom-ri&ght In basso a destra Cor&ner Size: Dimensione dell'angolo: SettingsDialog Save log file to... Salva il file di log... SettingsDialogBase Settings Impostazioni &Advanced Avanzate Sc&reen name: Nome dello schermo: P&ort: Porta: &Interface: Interfaccia: &Start Synergy after logging in Avvia Synergy dopo l'accesso al sistema &Automatically start server/client Avvia automaticamente la componente server/client &Hide when server/client starts Nascondi quando partono le componenti server/client Logging Registro Eventi &Process mode: Service Desktop (legacy) &Logging level: Livello di registrazione eventi Log to file: Registra gli eventi in un file Browse... Sfoglia... Error Errore Warning Avviso Note Nota Info Informazioni Debug Debug Debug1 Debug1 Debug2 Debug2 &Startup SetupWizard Setup Synergy Configura Synergy Please select an option. Pregasi selezionare un'opzione SetupWizardBase Setup Synergy Configura Synergy Server or Client? Server o Client? &Server (new setup) Server (nuova configurazione) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Questo è il primo computer che stai configurando. La tua tastiera e mouse sono connessi a questo computer. Questo ti permette di muovere il tuo mouse sollo schermo di un altro computer. Puo' esserci solo un server nella tua configurazione. &Client (add to setup) Client (aggiungi alla configurazione) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Hai già configurato un server. Questo è un computer che vuoi controllare utilizzando la tastiera ed il mouse del server. Possono esserci molti clients nella tua configurazione. VersionChecker Unknown Sconosciuto synergy-1.4.12-Source/src/gui/res/lang/gui_ja-JP.qm0000600000175000017500000003756512006005561021713 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC/‡^ûÀp+[H4SW Y¾%uÆϧ¤À´Ç&˜«Œ Ï3<¡"G×, VE"9V¥3­ŒÊ«`¶Þy+Ô¤*»B*»&'*Ð%j*ì0–+Œ+«`éGË,0GízËJ¹·2%L™b2ÓUÛ`ÉX·¹õYïÔ#LZÆÂ#„xýôpÁx.LäAëØ>)˜ó&ö}S;N1‡u>(Z Ž= î ¿nbj¤°¯4 Xº¾þÒÉüþ$1Ev.•_þ>eë- ¨w9œª¸úõ­ÃŒº¨”Àº¨”Û˜ l;H}ÙH¦”#÷O é5O é6G]à3{ÂVEm¸Ó#iC0§UN™ IYu:34l_”Ç}× %Š*Ä.ðšl®–¨öé%«Žø’«Ç«ü«1«›¡2]«›¢2˜° Î*8Ä:ÓFÄ:Ó%ãäöž &ç¹Ô08ñ$Z1Eö±É üÊJ!³"QJ™-iz3ÜË@dOÜl "n攄O(ÿ5ø( nk4.d#¾@Ty Ÿ{ã&Ë€¡ªœ6>GžŽÄ ÎzÎç>uéJž1ëëêžÉ £3f=ñT Pk@d%U‚ïõŠÁ„ìµÞ%=ãCÝ/lY5­}F•,Ó€Ân,ŸC/)»ó'µ÷¸‰³ Öjú IÞ_N Jz4 kö#) v®~+œ ”-û -5 OøŽú P¢n-® dö¹© ~5Ó-f ¤hÞ89 ±¥zK Ö„~ ȹ> >î6” aº®/º |ßÚ" ŒFå ŒFå' žýZX ® ¸'> ÈcÄ0 àKG RVŽr RVŽ$ RVŽv RVŽ9 R÷® ± Tƒäò V½4œ šÚ¡ §|*1 «c'x »sä »s4S Äcþ.O ÞF¤‹ ^®Ü /ó’ 4pÄ.¸ dÙ!N i!Î Î rù+ zkÙQ ‰P4† àx4( è]^ µ ^4¸=‰¹>ä (ÇôžƒQ ’r ¦/åŽÔ7å òkC,dk£&[®ú.(HÓ> ò¬ŠÈýù5Wi9ËOK&OkAboutDialogBaseSynergy0k0d0D0f About SynergyAboutDialogBaseN fUnknownAboutDialogBase 0Ð0ü0¸0ç0ó:Version:AboutDialogBase[ŸˆL0Y0‹RÕO\0’xbžChoose the action to performActionDialogBase RÕO\0’iËbConfigure ActionActionDialogBase0«0ü0½0ë0’u;—b0k–P[šLock cursor to screenActionDialogBase0Û0Ã0È0­0ü0’b¼0YPress a hotkeyActionDialogBase0Û0Ã0È0­0ü0’b¼0W0f–â0YPress and release a hotkeyActionDialogBase0Û0Ã0È0­0ü0’–â0YRelease a hotkeyActionDialogBaseR0Šfÿ0H0‹e¹TSwitch in directionActionDialogBaseu;—b0kR0Šfÿ0HSwitch to screenActionDialogBase0S0nRÕO\0’[ŸˆL0Y0‹fB: This action is performed whenActionDialogBaseN downActionDialogBase]æleftActionDialogBase0ª0ÕoffActionDialogBase0ª0óonActionDialogBase0S0Œ0‰0nu;—b0`0Qonly on these screensActionDialogBaseSórightActionDialogBase0Û0Ã0È0­0ü0’b¼0W0_0h0Mthe hotkey is pressedActionDialogBase0Û0Ã0È0­0ü0’–â0W0_0h0Mthe hotkey is releasedActionDialogBaseR0Šfÿ0HtoggleActionDialogBaseN upActionDialogBase(0Û0Ã0È0­0ü0nc[še¹lÕ0’QeR›0W0f0O0`0U0D:'Enter the specification for the hotkey:HotkeyDialogBase 0Û0Ã0È0­0üHotkeyHotkeyDialogBase}è–Æ&Edit MainWindow0Õ0¡0¤0ë&File MainWindow0Ø0ë0×&Help MainWindow•‹YË&Start MainWindowP\kb&Stop MainWindow 0¦0£0ó0É0¦&Window MainWindowf<p>0Ð0ü0¸0ç0ó%10LR)u(Sï€ý0g0Y0<a href="%2">Web0µ0¤0È0k0¢0¯0»0¹</a>0</p>C

Version %1 is now available, visit website.

 MainWindow$Synergys0niËb0Õ0¡0¤0ë0’•²‰§!Browse for a synergys config file MainWindowiËb0Õ0¡0¤0ë0kfø0M¼00~0[0“Cannot write configuration file MainWindow"iËb0Õ0¡0¤0ëT 0Lkc0W0O0B0Š0~0[0“0Configuration filename invalid MainWindow$iËb0Õ0¡0¤0ë0’OÝ[X0g0M0~0[0“0g0W0_0%Could not save configuration to file. MainWindow0Û0¹0ÈT 0Lzz0g0YHostname is empty MainWindow@Synergy0¯0é0¤0¢0ó0È0gc¥}š0Y0‹0Û0¹0ÈT 0’QeR›0W0f0O0`0U0D0?Please fill in a hostname for the synergy client to connect to. MainWindow0×0í0°0é0à0’•‹YË0g0M0~0[0“Program can not be started MainWindowiËb0kT RM0’0d0Q0fOÝ[X...Save configuration as... MainWindowOÝ[X0g0M0~0[0“0g0W0_ Save failed MainWindow*Synergy0¯0é0¤0¢0ó0È0L‰‹0d0K0Š0~0[0“Synergy client not found MainWindow"Synergy0oRÕO\0W0f0D0~0[0“0Synergy is not running. MainWindowSynergy0’•‹YËN-0g0Y0Synergy is starting. MainWindow&Synergy0µ0ü0Ð0ü0L‰‹0d0K0Š0~0[0“Synergy server not found MainWindowlSynergy0oNˆg0W0j0D}BN†0³0ü0É%10g}BN†0W0~0W0_0<br><br>Šs}00o0í0°0nQúR›0’SÂqg0W0f0O0`0U0D0fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow$Synergy0o0¨0é0ü0g}BN†0W0~0W0_ Synergy terminated with an error MainWindow8Synergy0¯0é0¤0¢0ó0È0n[ŸˆL0Õ0¡0¤0ë0L[XW(0W0~0[0“05The executable for the synergy client does not exist. MainWindow4Synergy0µ0ü0Ð0ü0n[ŸˆL0Õ0¡0¤0ë0L[XW(0W0~0[0“05The executable for the synergy server does not exist. MainWindowš[ŸˆL0Õ0¡0¤0ë<br><br>%1<br><br>0o[XW(0W0~0Y0L0•‹YË0g0M0~0[0“0g0W0_00S0n0×0í0°0é0à0’RÕO\0U0[0‹SAR0jj)–P0L0B0‹0K0i0F0KxºŠ0W0f0O0`0U0D0ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowBSynergy0n•‹YË0k_ʼn0jNfBv„0jiËb0Õ0¡0¤0ë0’fø0M¼00~0[0“0NThe temporary configuration file required to start synergy can not be written. MainWindowN fUnknown MainWindow`Synergy0µ0ü0Ð0ü0nkc0W0DiËb0Õ0¡0¤0ë0’fø0M¼0“0g0D0~0[0“0NÊ0iËb0Õ0¡0¤0ë0’•²‰§0W0~0Y0K?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindowSynergy0k0d0D0f...&About Synergy...MainWindowBaseiu(&ApplyMainWindowBase•²‰§ &Browse...MainWindowBase>0¯0é0¤0¢0ó0È(NÖ0n0³0ó0Ô0å0ü0¿0ü0n0­0ü0Ü0ü0É0h0Þ0¦0¹0’Ou():4&Client (use another computer's keyboard and mouse):MainWindowBaseiËb0Õ0¡0¤0ë:&Configuration file:MainWindowBase0µ0ü0Ð0ü0’iËb...&Configure Server...MainWindowBase}BN†&QuitMainWindowBase:0µ0ü0Ð0ü(0S0n0³0ó0Ô0å0ü0¿0ü0n0Þ0¦0¹0h0­0ü0Ü0ü0É0’Qqg ):3&Server (share this computer's mouse and keyboard):MainWindowBase•‹YË&StartMainWindowBase[þŠqv„0kiËb:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase Š-[š0’}è–Æ Edit settingsMainWindowBase0í0°LogMainWindowBase}BN†QuitMainWindowBasen–P™[ŒN†ReadyMainWindowBase[ŸˆLRunMainWindowBase0¦0£0¶0ü0É0’[ŸˆL0Y0‹ Run WizardMainWindowBase r¶aK0’ˆhy: S&how StatusMainWindowBaseP\kbS&topMainWindowBaseŠ-[š0kT RM0’0d0Q0fOÝ[XSave configuration &as...MainWindowBase:0¤0ó0¿0é0¯0Æ0£0Ö0â0ü0É0gub0W0_0µ0ü0Њ-[š0’0Õ0¡0¤0ë0kOÝ[X@Save the interactively generated server configuration to a file.MainWindowBaseŠ-[šSettingsMainWindowBaseP\kbStopMainWindowBaseSynergySynergyMainWindowBaseN fUnknownMainWindowBaseeâ[X0niËb0’Ou(Use existing configuration:MainWindowBaseT RM0j0WUnnamedNewScreenWidgetBSynergy0niËb(*.conf);;0Y0y0f0n0Õ0¡0¤0ë(*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject@Synergy0niËb(*.sgc);;0Y0y0f0n0Õ0¡0¤0ë(*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject*0¿0¹0¯0È0ì0¤0’R)u(0g0M0~0[0“0}BN†0W0~0Y0%System tray is unavailable, quitting.QObjectu;—b0nT RM0Lzz0g0Y0Screen name is emptyScreenSettingsDialogJu;—b0k0oT RM0L_ʼn0g0Y0T RM0’QeR›0Y0‹0K00À0¤0¢0í0°0’SÖ0Šmˆ0W0f0O0`0U0D0SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogýR &AddScreenSettingsDialogBase&undefinedCtrl:&Ctrl:ScreenSettingsDialogBase q!R¹0h0Y0‹‰Ò &Dead cornersScreenSettingsDialogBase&undefined[š(&F)&FixesScreenSettingsDialogBaseOî˜þ0­0ü&Modifier keysScreenSettingsDialogBaseRJ–d&RemoveScreenSettingsDialogBase0·0Õ0È&Shift:ScreenSettingsDialogBaseR%T A&liasesScreenSettingsDialogBase&undefinedl&t:Al&t:ScreenSettingsDialogBase0ª0ë0ÈAltScreenSettingsDialogBase]æN  Bottom-leftScreenSettingsDialogBaseSóN  Bottom-rightScreenSettingsDialogBase ‰Ò0nY'0M0U Corner Si&ze:ScreenSettingsDialogBase 0³0ó0È0í0ü0ëCtrlScreenSettingsDialogBaseCAPS0í0Ã0¯0­0ü0’Vú[šFix CAPS LOCK keyScreenSettingsDialogBaseNUM0í0Ã0¯0­0ü0’Vú[šFix NUM LOCK keyScreenSettingsDialogBaseSCROLL0í0Ã0¯0­0ü0’Vú[šFix SCROLL LOCK keyScreenSettingsDialogBase"XTest0’Xinerama0kvô0YFix XTest for XineramaScreenSettingsDialogBase&undefined&eta:M&eta:ScreenSettingsDialogBase0á0¿MetaScreenSettingsDialogBase0j0WNoneScreenSettingsDialogBase &undefined&uper:S&uper:ScreenSettingsDialogBase u;—b0nT RM Screen &name:ScreenSettingsDialogBase u;—b0nŠ-[šScreen SettingsScreenSettingsDialogBase0·0Õ0ÈShiftScreenSettingsDialogBase0¹0ü0Ñ0üSuperScreenSettingsDialogBase]æN Top-leftScreenSettingsDialogBaseSóN  Top-rightScreenSettingsDialogBase<center>u;—b: <b>%1</b></center><br>0À0Ö0ë0¯0ê0Ã0¯0gŠ-[š0’}è–Æ<br>RJ–d0Y0‹0h0M0ou;—b0’0´0ß{±0k0É0é0Ã0°0W0~0Yo
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel]æN  &Bottom-leftServerConfigDialogBase0¯0é0¤0¢0ó0ÈxºŠ˜;^¦&Check clients everyServerConfigDialogBase q!R¹0h0Y0‹‰Ò &Dead cornersServerConfigDialogBase}è–Æ&EditServerConfigDialogBase 0Û0Ã0È0­0ü&HotkeysServerConfigDialogBasee°‰&NewServerConfigDialogBase 0ª0×0·0ç0ó&OptionsServerConfigDialogBaseRJ–d&RemoveServerConfigDialogBaseR0Šfÿ0H&SwitchServerConfigDialogBase 0¢0¯0·0ç0óA&ctionsServerConfigDialogBase0µ0ü0Ð0ü0nŠs}00jŠ-[šAdvanced server settingsServerConfigDialogBaseSóN  Bottom-ri&ghtServerConfigDialogBase0µ0ü0ÐiËb0n‘Mn0’Š-[š0Y0‹:Configure the layout of your synergy server configuration.ServerConfigDialogBase –…0nY'0M0U: Cor&ner Size:ServerConfigDialogBase2Windows0µ0ü0Ð0g0¦0£0ó0É0¦0’RM—b0kˆhy:0W0j0D0Don't take &foreground window on Windows serversServerConfigDialogBase AboutDialogBase About Synergy Synergyã«ã¤ã„㦠<p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown ä¸æ˜Ž Version: ãƒãƒ¼ã‚¸ãƒ§ãƒ³: &Ok OK ActionDialogBase Configure Action å‹•ä½œã‚’æ§‹æˆ Choose the action to perform 実行ã™ã‚‹å‹•ä½œã‚’é¸æŠž Press a hotkey ホットキーを押㙠Release a hotkey ホットキーを離㙠Press and release a hotkey ホットキーを押ã—ã¦é›¢ã™ only on these screens ã“れらã®ç”»é¢ã ã‘ Switch to screen ç”»é¢ã«åˆ‡ã‚Šæ›¿ãˆ Switch in direction 切り替ãˆã‚‹æ–¹å‘ left å·¦ right å³ up 上 down 下 Lock cursor to screen カーソルを画é¢ã«é™å®š toggle 切り替㈠on オン off オフ This action is performed when ã“ã®å‹•ä½œã‚’実行ã™ã‚‹æ™‚: the hotkey is pressed ホットキーを押ã—ãŸã¨ã the hotkey is released ホットキーを離ã—ãŸã¨ã HotkeyDialogBase Hotkey ホットキー Enter the specification for the hotkey: ホットキーã®æŒ‡å®šæ–¹æ³•ã‚’入力ã—ã¦ãã ã•ã„: MainWindow &Start 開始 &File ファイル &Edit 編集 &Window ウィンドウ &Help ヘルプ <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>ãƒãƒ¼ã‚¸ãƒ§ãƒ³%1ãŒåˆ©ç”¨å¯èƒ½ã§ã™ã€‚<a href="%2">Webサイトã«ã‚¢ã‚¯ã‚»ã‚¹</a>。</p> Program can not be started プログラムを開始ã§ãã¾ã›ã‚“ The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. 実行ファイル<br><br>%1<br><br>ã¯å­˜åœ¨ã—ã¾ã™ãŒã€é–‹å§‹ã§ãã¾ã›ã‚“ã§ã—ãŸã€‚ã“ã®ãƒ—ログラムを動作ã•ã›ã‚‹å分ãªæ¨©é™ãŒã‚ã‚‹ã‹ã©ã†ã‹ç¢ºèªã—ã¦ãã ã•ã„。 Synergy client not found SynergyクライアントãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ The executable for the synergy client does not exist. Synergyクライアントã®å®Ÿè¡Œãƒ•ã‚¡ã‚¤ãƒ«ãŒå­˜åœ¨ã—ã¾ã›ã‚“。 Hostname is empty ホストåãŒç©ºã§ã™ Please fill in a hostname for the synergy client to connect to. Synergyクライアントã§æŽ¥ç¶šã™ã‚‹ãƒ›ã‚¹ãƒˆåを入力ã—ã¦ãã ã•ã„。 Cannot write configuration file 構æˆãƒ•ã‚¡ã‚¤ãƒ«ã«æ›¸ãè¾¼ã‚ã¾ã›ã‚“ The temporary configuration file required to start synergy can not be written. Synergyã®é–‹å§‹ã«å¿…è¦ãªä¸€æ™‚çš„ãªæ§‹æˆãƒ•ã‚¡ã‚¤ãƒ«ã‚’書ãè¾¼ã‚ã¾ã›ã‚“。 Configuration filename invalid 構æˆãƒ•ã‚¡ã‚¤ãƒ«åãŒæ­£ã—ãã‚ã‚Šã¾ã›ã‚“。 You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergyサーãƒãƒ¼ã®æ­£ã—ã„構æˆãƒ•ã‚¡ã‚¤ãƒ«ã‚’書ã込んã§ã„ã¾ã›ã‚“。今ã€æ§‹æˆãƒ•ã‚¡ã‚¤ãƒ«ã‚’閲覧ã—ã¾ã™ã‹? Synergy server not found Synergyサーãƒãƒ¼ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ The executable for the synergy server does not exist. Synergyサーãƒãƒ¼ã®å®Ÿè¡Œãƒ•ã‚¡ã‚¤ãƒ«ãŒå­˜åœ¨ã—ã¾ã›ã‚“。 Synergy terminated with an error Synergyã¯ã‚¨ãƒ©ãƒ¼ã§çµ‚了ã—ã¾ã—㟠Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergyã¯äºˆæœŸã—ãªã„終了コード%1ã§çµ‚了ã—ã¾ã—ãŸã€‚<br><br>詳細ã¯ãƒ­ã‚°ã®å‡ºåŠ›ã‚’å‚ç…§ã—ã¦ãã ã•ã„。 &Stop åœæ­¢ service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergyを開始中ã§ã™ã€‚ Synergy is not running. Synergyã¯å‹•ä½œã—ã¦ã„ã¾ã›ã‚“。 Unknown ä¸æ˜Ž Browse for a synergys config file Synergysã®æ§‹æˆãƒ•ã‚¡ã‚¤ãƒ«ã‚’閲覧 Save configuration as... 構æˆã«åå‰ã‚’ã¤ã‘ã¦ä¿å­˜... Save failed ä¿å­˜ã§ãã¾ã›ã‚“ã§ã—㟠Could not save configuration to file. 構æˆãƒ•ã‚¡ã‚¤ãƒ«ã‚’ä¿å­˜ã§ãã¾ã›ã‚“ã§ã—ãŸã€‚ MainWindowBase Synergy Synergy Screen name: Unknown ä¸æ˜Ž &Server IP: &Start 開始 &Server (share this computer's mouse and keyboard): サーãƒãƒ¼(ã“ã®ã‚³ãƒ³ãƒ”ューターã®ãƒžã‚¦ã‚¹ã¨ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚’共有): Use existing configuration: 既存ã®æ§‹æˆã‚’使用 &Configuration file: 構æˆãƒ•ã‚¡ã‚¤ãƒ«: &Browse... 閲覧 Configure interactively: 対話的ã«æ§‹æˆ: &Configure Server... サーãƒãƒ¼ã‚’構æˆ... &Client (use another computer's keyboard and mouse): クライアント(ä»–ã®ã‚³ãƒ³ãƒ”ューターã®ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã¨ãƒžã‚¦ã‚¹ã‚’使用): Ready 準備完了 Log ログ &Apply é©ç”¨ &Elevate IP addresses: &About Synergy... Synergyã«ã¤ã„ã¦... &Quit 終了 Quit 終了 Ctrl+Q Ctrl+Q Run 実行 Ctrl+S Ctrl+S S&top åœæ­¢ Stop åœæ­¢ Ctrl+T Ctrl+T S&how Status 状態を表示 Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... 設定ã«åå‰ã‚’ã¤ã‘ã¦ä¿å­˜ Save the interactively generated server configuration to a file. インタラクティブモードã§ç”Ÿæˆã—ãŸã‚µãƒ¼ãƒè¨­å®šã‚’ファイルã«ä¿å­˜ Ctrl+Alt+S Ctrl+Alt+S Settings 設定 Edit settings 設定を編集 Run Wizard ウィザードを実行ã™ã‚‹ NewScreenWidget Unnamed åå‰ãªã— QObject Synergy Configurations (*.sgc);;All files (*.*) Synergyã®æ§‹æˆ(*.sgc);;ã™ã¹ã¦ã®ãƒ•ã‚¡ã‚¤ãƒ«(*.*) Synergy Configurations (*.conf);;All files (*.*) Synergyã®æ§‹æˆ(*.conf);;ã™ã¹ã¦ã®ãƒ•ã‚¡ã‚¤ãƒ«(*.*) System tray is unavailable, quitting. タスクトレイを利用ã§ãã¾ã›ã‚“。終了ã—ã¾ã™ã€‚ ScreenSettingsDialog Screen name is empty ç”»é¢ã®åå‰ãŒç©ºã§ã™ã€‚ The name for a screen can not be empty. Please fill in a name or cancel the dialog. ç”»é¢ã«ã¯åå‰ãŒå¿…è¦ã§ã™ã€‚åå‰ã‚’入力ã™ã‚‹ã‹ã€ãƒ€ã‚¤ã‚¢ãƒ­ã‚°ã‚’å–り消ã—ã¦ãã ã•ã„。 ScreenSettingsDialogBase Screen Settings ç”»é¢ã®è¨­å®š Screen &name: ç”»é¢ã®åå‰ A&liases 別å &Add 追加 &Remove 削除 &Modifier keys 修飾キー &Shift: シフト Shift シフト Ctrl コントロール Alt オルト Meta メタ Super スーパー None ãªã— &Ctrl: &undefinedCtrl: Al&t: &undefinedl&t: M&eta: &undefined&eta: S&uper: &undefined&uper: &Dead corners 無効ã¨ã™ã‚‹è§’ Top-left 左上 Top-right å³ä¸Š Bottom-left 左下 Bottom-right å³ä¸‹ Corner Si&ze: 角ã®å¤§ãã• &Fixes &undefined定(&F) Fix CAPS LOCK key CAPSロックキーを固定 Fix NUM LOCK key NUMロックキーを固定 Fix SCROLL LOCK key SCROLLロックキーを固定 Fix XTest for Xinerama XTestã‚’Xineramaã«ç›´ã™ ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>ç”»é¢: <b>%1</b></center><br>ダブルクリックã§è¨­å®šã‚’編集<br>削除ã™ã‚‹ã¨ãã¯ç”»é¢ã‚’ゴミ箱ã«ãƒ‰ãƒ©ãƒƒã‚°ã—ã¾ã™ ServerConfigDialogBase Server Configuration サーãƒãƒ¼ã®æ§‹æˆ Screens and links ç”»é¢ã¨ãƒªãƒ³ã‚¯ Drag a screen from the grid to the trashcan to remove it. 削除ã™ã‚‹æ™‚ã¯ã‚°ãƒªãƒƒãƒ‰å†…ã®ç”»é¢ã‚’ゴミ箱ã«ãƒ‰ãƒ©ãƒƒã‚°ã—ã¦ãã ã•ã„。 Configure the layout of your synergy server configuration. サーãƒæ§‹æˆã®é…置を設定ã™ã‚‹ Drag this button to the grid to add a new screen. æ–°è¦ç”»é¢ã®è¿½åŠ ã¯ã“ã®ãƒœã‚¿ãƒ³ã‚’グリッド内ã«ãƒ‰ãƒ©ãƒƒã‚°ã—ã¾ã™ã€‚ Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. æ–°è¦ç”»é¢ã‚’グリッド内ã«ãƒ‰ãƒ©ãƒƒã‚°ã™ã‚‹ã‹æ—¢å­˜ç”»é¢ã‚’移動ã—ã¦ãã ã•ã„。 ç”»é¢ã‚’ゴミ箱ã«ãƒ‰ãƒ©ãƒƒã‚°ã™ã‚‹ã¨å‰Šé™¤ã—ã¾ã™ã€‚ 設定を編集ã™ã‚‹å ´åˆã¯ç”»é¢ä¸Šã§ãƒ€ãƒ–ルクリックã—ã¦ãã ã•ã„。 Hotkeys ホットキー &Hotkeys ホットキー &New æ–°è¦ &Edit 編集 &Remove 削除 A&ctions アクション Ne&w æ–°è¦ E&dit 編集 Re&move 削除 Advanced server settings サーãƒãƒ¼ã®è©³ç´°ãªè¨­å®š &Switch 切り替㈠Switch &after waiting 次ã®æ™‚é–“ã®å¾Œåˆ‡ã‚Šæ›¿ãˆ ms ミリ秒 Switch on double &tap within 次ã®æ™‚間内ã®ãƒ€ãƒ–ルタップã§åˆ‡ã‚Šæ›¿ãˆ &Options オプション &Check clients every クライアント確èªé »åº¦ Use &relative mouse moves マウスã®ç›¸å¯¾çš„ãªå‹•ãを使用 S&ynchronize screen savers スクリーンセーãƒãƒ¼ã®åŒæœŸ Don't take &foreground window on Windows servers Windowsサーãƒã§ã‚¦ã‚£ãƒ³ãƒ‰ã‚¦ã‚’å‰é¢ã«è¡¨ç¤ºã—ãªã„ &Dead corners 無効ã¨ã™ã‚‹è§’ To&p-left 左上 Top-rig&ht å³ä¸Š &Bottom-left 左下 Bottom-ri&ght å³ä¸‹ Cor&ner Size: éš…ã®å¤§ãã•: SettingsDialog Save log file to... ログファイルã®ä¿å­˜å…ˆ SettingsDialogBase Settings 設定 &Advanced 上級 Sc&reen name: スクリーンå: P&ort: ãƒãƒ¼ãƒˆ: &Interface: インターフェース: &Start Synergy after logging in ログイン後Synergyを開始 &Automatically start server/client 自動的ã«ã‚µãƒ¼ãƒ/クライアントを開始ã™ã‚‹ &Hide when server/client starts 開始時ã«ãƒˆãƒ¬ã‚¤ã«éš ã™ Logging ログ &Process mode: Service Desktop (legacy) &Logging level: ログレベル: Log to file: ログ記録先ファイル: Browse... å‚ç…§... Error エラー Warning 警告 Note 通知 Info 情報 Debug デãƒãƒƒã‚°æƒ…å ± Debug1 デãƒãƒƒã‚°æƒ…å ±1 Debug2 デãƒãƒƒã‚°æƒ…å ±2 &Startup SetupWizard Setup Synergy Synergyã®ã‚»ãƒƒãƒˆã‚¢ãƒƒãƒ— Please select an option. オプションをé¸æŠžã—ã¦ãã ã•ã„。 SetupWizardBase Setup Synergy Synergyã®ã‚»ãƒƒãƒˆã‚¢ãƒƒãƒ— Server or Client? サーãƒãƒ¼ã¾ãŸã¯ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆ &Server (new setup) サーãƒãƒ¼(æ–°è¦æ§‹æˆ) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. 最åˆã«è¨­å®šã™ã‚‹ã‚³ãƒ³ãƒ”ューターã§ã™ã€‚ã“ã®ã‚³ãƒ³ãƒ”ューターã«ã¤ãªãŒã‚ŒãŸã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã¨ãƒžã‚¦ã‚¹ã§ä»–ã®ã‚³ãƒ³ãƒ”ューターã®ç”»é¢ã‚’æ“作ã—ã¾ã™ã€‚ã²ã¨ã¤ã®æ§‹æˆã®ä¸­ã§ã‚µãƒ¼ãƒãƒ¼ã¯ä¸€å°ã®ã¿ã§ã™ã€‚ &Client (add to setup) クライアント(構æˆã¸ã®è¿½åŠ ) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. サーãƒãƒ¼ãŒã™ã§ã«è¨­å®šã•ã‚Œã¦ã„ã¾ã™ã€‚ã“ã®ã‚³ãƒ³ãƒ”ューターã¯ã‚µãƒ¼ãƒãƒ¼ã«æŽ¥ç¶šã•ã‚ŒãŸã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã¨ãƒžã‚¦ã‚¹ã§æ“作ã•ã‚Œã¾ã™ã€‚ã²ã¨ã¤ã®æ§‹æˆã«ã¯è¤‡æ•°ã®ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆã‚’設定ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ VersionChecker Unknown ä¸æ˜Ž synergy-1.4.12-Source/src/gui/res/lang/gui_ko.qm0000600000175000017500000004135312006005561021411 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC2Q^#À˜+[H4 iSWÂY¾CuÆ÷§¤ ´Ç(D«Œ!tÏ5ÿ<¡#lG×/(VE#¡V¥6§Œì«`I¶Þ+ÔÊ*»`*»'Ç*Ð%*ì0À+Œ/+«`#GË.´Gíz -J¹·53L™b5ÏUÛ`çX·¹YïÔ$¬ZÆÂ$èxýô–Áx..äƒëØ>,óNö}S¦;N4ƒu>«(Z Ô= î nbjÞ°¯4 ¼º¾þAÒÉþ%ŸEv._þ€eë/¡¨w9ˆª¸úI­Ãຨ”òº¨”ó˜ ¬;H}áH¦”%]O é8 O é9U]à6oÂVE¥¸Ó$fiC3UN™!­Yu:6.l_” }× cŠ*Ä1 šl®°¨öé' «Žø´«é««S«›¡5e«›¢5š° Î,¨Ä:ÓˆÄ:Ó'qäöž dç¹Ô3ñ$Z49ö±É/üÊJ#+"QJÁ-iz6ÖË@d ŸÜl #Ö攄m(ÿ9( n{4.d%@Ty"{ã(€¡ª›œ6>žŽÄ ^Îz(Îç>éJž4õëêž½ £3ˆ=ñT œk@d&Á‚ïŠÁ„µÞ%iãC/lY8µ}F•/c€Ân<ŸC1é»ó)y÷¸‰ó Öj IÞ_ Jz7 kö#*û v®~. ”0“ -5C OøŽH P¢n0J dö¹ñ ~5Ó0 ¤hÞ;“ ±¥zc Ö„~ ȹt >î9’ aº®2‚ |ßÚ$ ŒFåj ŒFå(¾ žýZª ® ¸(ü ÈcÄ2Ò àKGS RVŽ| RVŽà RVŽ¬ RVŽ= R÷®  Tƒä0 V½4Æ šÚ¯ §|*3ó «c): »s »s7Y Äcþ0é ÞF¤ á ^®ú /óì 4pÄ1Z dÙ"¾ i!Î  rù3 zkÙi ‰P7Œ àx4)Æ è]^  ^7¾=‰Ë>ä *­ôžƒs ’r /åŽæ7å"^kC.ðk£(®ú.*Ó> eò¬Š!&ýù8Ci=A ÖUÇx(&O)&OkAboutDialogBaseSynergyÅÐ ³ÕXÅì About SynergyAboutDialogBaseÅLÂÅÆÇLUnknownAboutDialogBase¼„È:Version:AboutDialogBaseÂÕ‰Õ` ³ÙÇ‘ÇD Á ÐÝÕXÁ8Æ”Choose the action to performActionDialogBase ³ÙÇ‘ Á$ÈConfigure ActionActionDialogBaseÎäÁ¹| ÖTºtÅHÅÐ ¬àÈLock cursor to screenActionDialogBase²è͕Ф¹| ²¹tÁ8Æ”Press a hotkeyActionDialogBase²è͕Ф¹| ² ¸²ä ±“Ç<Á8Æ”Press and release a hotkeyActionDialogBase²è͕Ф¹| ±“Ç<Á8Æ”Release a hotkeyActionDialogBaseÇt ¼)Õ¥Ç<¸\ ÈÖXSwitch in directionActionDialogBaseÇt ÖTºtÇ<¸\ ÈÖXSwitch to screenActionDialogBaseÇt ³ÙÇ‘Çt ÂÕ‰ ´ µL:This action is performed whenActionDialogBaseÅD·˜downActionDialogBaseÆ|ʽleftActionDialogBase®¼ÉÐoffActionDialogBaseÏÉÐonActionDialogBaseÇt ÖTºtÅÐÁ¹Ìonly on these screensActionDialogBaseÆ$¹xʽrightActionDialogBase²è͕Ф¬ ² ¸8µ²È²ä.the hotkey is pressedActionDialogBase²è͕Ф¬ ±“ÅDÈLµ²È²ä.the hotkey is releasedActionDialogBaseÑ ®toggleActionDialogBaseÇupActionDialogBase"²è͕Ф¸\ Á$ÈÕ` Ф¹| ²¹tÁ8Æ”:'Enter the specification for the hotkey:HotkeyDialogBase²è͕ФHotkeyHotkeyDialogBase Ó¸ÉÑ(&E)&Edit MainWindow Ó Ç|(&F)&File MainWindow³ÄÆÀ¹Ð(&H)&Help MainWindow ÂÜÇ‘(&S)&Start MainWindow ÉÉÀ(&S)&Stop MainWindow Ì=(&W)&Window MainWindow^<p>%1¼„ÈÇt À¬Æ© ¬²¥Õi²È²ä.<a href="%2">ÖHÓ˜ÇtÉÀ ¬®0</a>.</p>C

Version %1 is now available, visit website.

 MainWindow"synergys Á$È Ó Ç| ÐÐÀÉ!Browse for a synergys config file MainWindowÁ$ÈÓ Ç|ÇD Äø  ÅƵ²È²ä.Cannot write configuration file MainWindow&Á$È Ó Ç| Çt¹„Çt Æ,¼¹tÉÀ ÅJµ²È²äConfiguration filename invalid MainWindow,Á$È À¬ÕmÇD Ó Ç|ÅÐ ÈÇ¥Õ`  ÅƵ²È²ä.%Could not save configuration to file. MainWindowÖ8¤Ҹº…Çt ¾DŴLjµ²È²ä.Hostname is empty MainWindow0Ðt·|ÇtŸҸ¬ ÈÁÕ` Ö8¤Ҹº…ÇD Ç…¸%ÕtÈüÁ8Æ”.?Please fill in a hostname for the synergy client to connect to. MainWindow Õ¸\­ø·¨ÇD ÂÜÇ‘Õ`  ÅƵ²È²äProgram can not be started MainWindow"Á$ÈÇD ²ä¹x Çt¹„Ç<¸\ ÈÇ¥...Save configuration as... MainWindowÈÇ¥ÅÐ ÂäÓ(Ոµ²È²ä Save failed MainWindow2Synergy Ðt·|ÇtŸҸ¹| Ì>ÇD  ÅƵ²È²ä.Synergy client not found MainWindow*Synergy¬ ÂäÕ‰ ÉÇtÉÀ ÅJµ²È²ä.Synergy is not running. MainWindow$Synergy¬ ÂäÕ‰ É Ç…²È²ä.Synergy is starting. MainWindow*Synergy Á¼„¹| Ì>ÇD  ÅƵ²È²äSynergy server not found MainWindow~Synergy¬ %1ÇX ÏT´Ü¸\ ¾D ÈÀÁÈÇ<¸\ È…¸Ì´Åȵ²È²ä.<br><br>ÇÁ8Õ\ À¬ÕmÇ@ ¸\­ø Íœ¸%¬°¬ü¹| ÖUÇxÕXÁ8Æ”fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow.Synergy¬ Æ$¹X¸\ ÇxÕt È…¸Ì´Åȵ²È²ä Synergy terminated with an error MainWindow>Synergy Ðt·|ÇtŸҸ ÂäÕ‰ Ó Ç|Çt ÈtǬÕXÉÀ ÅJµ²È²ä.5The executable for the synergy client does not exist. MainWindow8Synergy Á¼„ ÂäÕ‰ Ó Ç|Çt ÈtǬÕXÉÀ ÅJµ²È²ä.5The executable for the synergy server does not exist. MainWindow¶ÂäÕ‰Ó Ç|<br><br>%1<br><br>Çt(¬) ÈtǬÕXÉÀ¹Ì Á1¬õÈÇ<¸\ ÂäÕ‰´ÉÀ º»ÕˆÂµ²È²ä. Çt Õ¸\­ø·¨ÇD ÂäÕ‰ÂÜФ®0 ÇÕ\ Í©½„Õ\ ­ŒÕ\ÇD ¬ÉÀ¬à Lj²”ÉÀ ÖUÇxÕtÈüÁ8Æ”.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowTSynergy¹| ­l³ÙÕX®0 ÇÕt ÕDÆ”Õ\ Ç„ÂÜ Á$È Ó Ç|ÇD Ç‘Á1Õ`  ÅƵ²È²ä.NThe temporary configuration file required to start synergy can not be written. MainWindowÅLÂÅÆÇLUnknown MainWindow‚Synergy Á¼„¹| ÂäÕ‰ÕX®0 ÇÕ\ Á$È Ó Ç|Çt ȳ¸\ Ç‘Á1´Å´ LjÉÀ ÅJµ²È²ä. ÉÀ® Á$È Ó Ç|ÇD Ì>ÅD ¼ôÂܬ Âµ²È®L?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow&SynergyÅÐ ­ÕXÅì(&A)...&About Synergy...MainWindowBase ÈÆ©(&A)&ApplyMainWindowBaseÌ>ÅD ¼ô®0(&B)... &Browse...MainWindowBaseBÐt·|ÇtŸҸ(&C) (²ä¹x ÎôÔèÑ0ÇX Ф¼ô´ÜÆ@ ¹Èư¤¹| À¬Æ©):4&Client (use another computer's keyboard and mouse):MainWindowBaseÁ$È Ó Ç|(&C):&Configuration file:MainWindowBaseÁ¼„ Á$È(&C)&Configure Server...MainWindowBase È…¸Ì(&Q)&QuitMainWindowBase:Á¼„(&S) (Çt ÎôÔèÑ0ÇX ¹Èư¤Æ@ Ф¼ô´Ü¹| ¬õÇ ):3&Server (share this computer's mouse and keyboard):MainWindowBase ÂÜÇ‘(&S)&StartMainWindowBaseÀÁÖ8Ç‘Æ© Á$È:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase Á$È Ó¸ÉÑ Edit settingsMainWindowBase¸\­øLogMainWindowBaseÈ…¸ÌQuitMainWindowBaseɾDReadyMainWindowBaseÂäÕ‰RunMainWindowBase ¹È¼•À¬ ÂäÕ‰ Run WizardMainWindowBaseÀÁÐÜ ¼ô®0(&H) S&how StatusMainWindowBase ÉÉÀ(&T)S&topMainWindowBase*Á$ÈÇD ²ä¹x Çt¹„Ç<¸\ ÈÇ¥(&A)...Save configuration &as...MainWindowBase6ÀÁÖ8Ç‘Æ©Ç<¸\ ÀÝÁ1´ Á¼„ Á$ÈÇD Ó Ç|¸\ ÈÇ¥ÕX®0.@Save the interactively generated server configuration to a file.MainWindowBaseÁ$ÈSettingsMainWindowBaseÉÉÀStopMainWindowBaseSynergySynergyMainWindowBaseÅLÂÅÆÇLUnknownMainWindowBase®0Èt Á$ÈÇD À¬Æ©:Use existing configuration:MainWindowBaseÇt¹„ÅÆÇLUnnamedNewScreenWidgetDSynergy Á$ÈÓ Ç| (*.conf);;º¨´à Ó Ç| (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectBSynergy Á$ÈÓ Ç| (*.sgc);;º¨´à Ó Ç| (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject0ÂܤÑ\ Ò¸¸Çt¹| À¬Æ©Õ`  ÅÆÅ´ È…¸ÌÕi²È²ä.%System tray is unavailable, quitting.QObject¤Ðl¹° Çt¹„Çt ¾DÅȵ²È²äScreen name is emptyScreenSettingsDialogH¤Ðl¹° Çt¹„Çt ¾DÅȵ²È²ä. Çt¹„ÇD Ç…¸%ÕX¬p°˜ Ç…¸%Ì=ÇD ÍèÁŒÕXÁ8Æ”.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog Í”¬(&A)&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBaseÀ¬Æ©ÕXÉÀ ÅJ²” º¨Á¹¬(&D) &Dead cornersScreenSettingsDialogBase ¬àÈ(&F)&FixesScreenSettingsDialogBase¼ôÈp Ф(&M)&Modifier keysScreenSettingsDialogBase À­È(&R)&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBase ¼ÄÎm(&L)A&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase ÕX²è Æ|ʽ Bottom-leftScreenSettingsDialogBase ÕX²è Æ$¹xʽ Bottom-rightScreenSettingsDialogBaseº¨Á¹¬ Ðl®0(&Z) Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBaseCAPS LOCK Ф ¬àÈFix CAPS LOCK keyScreenSettingsDialogBaseNUM LOCK Ф ¬àÈFix NUM LOCK keyScreenSettingsDialogBase SCROLL LOCK Ф ¬àÈFix SCROLL LOCK keyScreenSettingsDialogBase*Xinerama¹| ÇÕ\ XTest ¬àÈFix XTest for XineramaScreenSettingsDialogBaseºTÐÀ(&M):M&eta:ScreenSettingsDialogBaseºTÐÀMetaScreenSettingsDialogBaseÅÆÇLNoneScreenSettingsDialogBaseˆÓ|(&U):S&uper:ScreenSettingsDialogBaseÖTºt Çt¹„(&N): Screen &name:ScreenSettingsDialogBase ÖTºt Á$ÈScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBaseˆÓ|SuperScreenSettingsDialogBase ÀÁ²è Æ|ʽTop-leftScreenSettingsDialogBase ÀÁ²è Æ$¹xʽ Top-rightScreenSettingsDialogBaseŽ<center>ÖTºt: <b>%1</b></center><br>Á$ÈÇD Ó¸ÉÑÕX¸$ºt ³T¾Ðt¹­<br>À­ÈÕX¸$ºt ×4ÉÀѵÇ<¸\ ´Ü·˜­ø ÕXÁ8Æ”o
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModelÕX²è Æ|ʽ(&B) &Bottom-leftServerConfigDialogBase(ÉÀÈ Âܬ¹È²ä Ðt·|ÇtŸҸ ÖUÇx(&C)&Check clients everyServerConfigDialogBaseÀ¬Æ©ÕXÉÀ ÅJ²” º¨Á¹¬(&D) &Dead cornersServerConfigDialogBase Ó¸ÉÑ(&E)&EditServerConfigDialogBase²è͕Ф(&H)&HotkeysServerConfigDialogBase ÀÝÁ1(&N)&NewServerConfigDialogBase Æ5ÁX(&O)&OptionsServerConfigDialogBase À­È(&R)&RemoveServerConfigDialogBase ÈÖX(&S)&SwitchServerConfigDialogBase Õ‰³Ù(&C)A&ctionsServerConfigDialogBase ¬à® Á$ÈAdvanced server settingsServerConfigDialogBaseÕX²è Æ$¹xʽ(&G) Bottom-ri&ghtServerConfigDialogBase6Synergy Á¼„ ­lÁ1¬ü ¸ÇtÅDÆÃÇD Á$ÈÕXÁ8Æ”.:Configure the layout of your synergy server configuration.ServerConfigDialogBaseº¨Á¹¬ Ðl®0(&N): Cor&ner Size:ServerConfigDialogBase¾Ðt·|ÇtŸҸ¸\ ÈÖXÂÜÕt³Ä Á¼„ÇX ÓìÎä¤ ¼)ÉÀ (ÈÌ´ÖTºt Ç‘ÅÅÉ Ðt·|ÇtŸҸ¸\ ÈÖXÕt³Ä ÈÌ´ÖTºtÇt Ç ÉÀ´ºp, Á¼„ÅÐÁ ÈÌ´ÖTºt É Í\ÁŒÖT ÖÄ Ðt·|ÇtŸҸ ÈÖXÂÜ ÈÌ´ÖTºtÇD ¼)ÉÀ)0Don't take &foreground window on Windows serversServerConfigDialogBase0À­ÈÕX¸$ºt ÖTºtÇD ×4ÉÀѵÇ<¸\ ´Ü·˜­ø ÕXÁ8Æ”.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseªÀȸ\Æ´ ÖTºtÇD Í”¬ÕX¸$ºt ÀÁ²èÇX ÖTºtÇD ¬©Ç ÅHÇ<¸\ ´Ü·˜­ø ÕXÁ8Æ”. ÖTºtÇD À­ÈÕX¸$ºt ×4ÉÀѵÇ<¸\ ´Ü·˜­ø ÕXÁ8Æ”. ÖTºt Á$ÈÇD Ó¸ÉÑÕX¸$ºt ³T¾Ðt¹­ ÕXÁ8Æ”.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBaseFÀȸ\Æ´ ÖTºtÇD Í”¬ÕX¸$ºt Çt ¼„Ò¼ÇD ¬©Ç ÅHÇ<¸\ ´Ü·˜­ø ÕXÁ8Æ”.1Drag this button to the grid to add a new screen.ServerConfigDialogBase Ó¸ÉÑ(&D)E&ditServerConfigDialogBase²è͕ФHotkeysServerConfigDialogBase ÀÝÁ1(&W)Ne&wServerConfigDialogBase À­È(&M)Re&moveServerConfigDialogBase¤Ðl¹°Á8Çt¼„ ³Ù®0ÖT(&Y)S&ynchronize screen saversServerConfigDialogBase ÖTºt¬ü ¹ÁÐlScreens and linksServerConfigDialogBase Á¼„ Á$ÈServer ConfigurationServerConfigDialogBase³®0 ÖÄ ÈÖX(&A)Switch &after waitingServerConfigDialogBase*ÉÀÈÂܬ ÅHÅÐ ³T¾ ÐíÇ<¸\ ÈÖX(&T)Switch on double &tap withinServerConfigDialogBaseÀÁ²è Æ|ʽ(&P) To&p-leftServerConfigDialogBaseÀÁ²è Æ$¹xʽ(&H) Top-rig&htServerConfigDialogBase$ÀÁ³ÈÇx ¹Èư¤ Çt³Ù À¬Æ©(&R)Use &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase¸\­ø Ó Ç| ÈÇ¥ÕX®0...Save log file to...SettingsDialog ¬à® (&A) &AdvancedSettingsDialogBase*Á¼„/Ðt·|ÇtŸҸ¹| dzÙÇ<¸\ ÂÜÇ‘(&A)"&Automatically start server/clientSettingsDialogBase,Á¼„/Ðt·|ÇtŸҸ¬ ÂÜÇ‘´ºt Â(®0®0(&H)&Hide when server/client startsSettingsDialogBaseÇxÑ0Ó˜Çt¤(&I): &Interface:SettingsDialogBase®0¸] ÂÉ(&L):&Logging level:SettingsDialogBase,dzÄÆ° ÂÜÇ‘ÂÜ Synergy ÂÜÇ‘(&S)&Start Synergy after logging inSettingsDialogBaseÌ>ÅD¼ô®0... Browse...SettingsDialogBaseµ¼„­øDebugSettingsDialogBaseµ¼„­ø1Debug1SettingsDialogBaseµ¼„­ø2Debug2SettingsDialogBaseÆ$¹XErrorSettingsDialogBaseȼôInfoSettingsDialogBaseÓ Ç|¸\ ÈÇ¥: Log to file:SettingsDialogBase ¸\­ø ®0¸]LoggingSettingsDialogBaseÅL¹¼NoteSettingsDialogBaseÓìÒ¸(&O):P&ort:SettingsDialogBaseÖTºt Çt¹„(&R): Sc&reen name:SettingsDialogBaseÁ$ÈSettingsSettingsDialogBase¬½¬àWarningSettingsDialogBaseÆ5ÁXÇD Á ÐÝÕXÁ8Æ”.Please select an option. SetupWizard ÂܱÉÀ Á$È Setup Synergy SetupWizard8Ðt·|ÇtŸҸ(&C) (®0Èt SynergyÖX¬½ÅÐ Í”¬)&Client (add to setup)SetupWizardBaseÁ¼„(&S) (Âà­Ü Á$È)&Server (new setup)SetupWizardBaseÁ¼„ ¶²” Ðt·|ÇtŸҸ?Server or Client?SetupWizardBase ÂܱÉÀ Á$È Setup SynergySetupWizardBaseÅì·ì½„Çt Á$ÈÕX²” Ì« ÎôÔèÑ0Ç…²È²ä. Åì·ì½„ÇX Ф¼ô´ÜÆ@ ¹Èư¤²” Çt ÎôÔèÑ0ÅÐ Å𬰴Å´ LjÇ<ºp, Åì®0ÅÐ Å𬰴 ¹Èư¤¹| ²ä¹x ÎôÔèÑ0ÇX ÖTºtÇ<¸\ Æ.¬¨²ä²Ð  Lj¬Œ ´)²È²ä. Synergy ÖX¬½ÇD ­lÁ1Õ` µL Á¼„²” ÕX°˜¹Ì ÈtǬÕtÅ| Õi²È²ä.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBaseÀÇt»ø Á¼„ ÕX°˜¹| Á$ÈÕt ´PÅȵ²È²ä. Çt ÎôÔèÑ0²” Á¼„ÇX Ф¼ô´ÜÆ@ ¹Èư¤¹| À¬Æ©ÕtÁ ÈpÇ‘Õ`  Lj¬Œ ´)²È²ä. Synergy ÖX¬½ÅÐ Åì·ì¬ÇX Ðt·|ÇtŸҸ¹| Í”¬Õ`  Ljµ²È²ä.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseÅLÂÅÆÇLUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_ko.ts0000600000175000017500000013622612006005561021426 0ustar synergysynergy AboutDialogBase About Synergy Synergyì— ëŒ€í•˜ì—¬ <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown ì•Œìˆ˜ì—†ìŒ Version: 버전: &Ok 확ì¸(&O) ActionDialogBase Configure Action ë™ìž‘ 설정 Choose the action to perform 수행할 ë™ìž‘ì„ ì„ íƒí•˜ì„¸ìš” Press a hotkey 단축키를 누르세요 Release a hotkey 단축키를 놓으세요 Press and release a hotkey 단축키를 눌렀다 놓으세요 only on these screens ì´ í™”ë©´ì—서만 Switch to screen ì´ í™”ë©´ìœ¼ë¡œ 전환 Switch in direction ì´ ë°©í–¥ìœ¼ë¡œ 전환 left 왼쪽 right 오른쪽 up 위 down 아래 Lock cursor to screen 커서를 í™”ë©´ì•ˆì— ê³ ì • toggle 토글 on ì¼œì§ off êº¼ì§ This action is performed when ì´ ë™ìž‘ì´ ìˆ˜í–‰ ë  ë•Œ: the hotkey is pressed 단축키가 눌렸습니다. the hotkey is released 단축키가 놓아졌습니다. HotkeyDialogBase Hotkey 단축키 Enter the specification for the hotkey: 단축키로 설정할 키를 누르세요: MainWindow &Start 시작(&S) &File 파ì¼(&F) &Edit 편집(&E) &Window ì°½(&W) &Help ë„움ë§(&H) <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>%1ë²„ì „ì´ ì‚¬ìš© 가능합니다.<a href="%2">홈페ì´ì§€ 가기</a>.</p> Program can not be started í”„ë¡œê·¸ëž¨ì„ ì‹œìž‘í•  수 없습니다 The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. 실행파ì¼<br><br>%1<br><br>ì´(ê°€) 존재하지만 성공ì ìœ¼ë¡œ 실행ë˜ì§€ 못했습니다. ì´ í”„ë¡œê·¸ëž¨ì„ ì‹¤í–‰ì‹œí‚¤ê¸° 위한 충분한 ê¶Œí•œì„ ê°€ì§€ê³  있는지 확ì¸í•´ì£¼ì„¸ìš”. Synergy client not found Synergy í´ë¼ì´ì–¸íŠ¸ë¥¼ ì°¾ì„ ìˆ˜ 없습니다. The executable for the synergy client does not exist. Synergy í´ë¼ì´ì–¸íŠ¸ 실행 파ì¼ì´ 존재하지 않습니다. Hostname is empty í˜¸ìŠ¤íŠ¸ëª…ì´ ë¹„ì–´ìžˆìŠµë‹ˆë‹¤. Please fill in a hostname for the synergy client to connect to. í´ë¼ì´ì–¸íŠ¸ê°€ ì ‘ì†í•  í˜¸ìŠ¤íŠ¸ëª…ì„ ìž…ë ¥í•´ì£¼ì„¸ìš”. Cannot write configuration file 설정파ì¼ì„ 쓸 수 없습니다. The temporary configuration file required to start synergy can not be written. Synergy를 구ë™í•˜ê¸° 위해 필요한 ìž„ì‹œ 설정 파ì¼ì„ 작성할 수 없습니다. Configuration filename invalid 설정 íŒŒì¼ ì´ë¦„ì´ ì˜¬ë°”ë¥´ì§€ 않습니다 You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy 서버를 실행하기 위한 설정 파ì¼ì´ 제대로 작성ë˜ì–´ 있지 않습니다. 지금 설정 파ì¼ì„ 찾아 보시겠습니까? Synergy server not found Synergy 서버를 ì°¾ì„ ìˆ˜ 없습니다 The executable for the synergy server does not exist. Synergy 서버 실행 파ì¼ì´ 존재하지 않습니다. Synergy terminated with an error Synergyê°€ 오류로 ì¸í•´ 종료ë˜ì—ˆìŠµë‹ˆë‹¤ Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergyê°€ %1ì˜ ì½”ë“œë¡œ 비 ì •ìƒì ìœ¼ë¡œ 종료ë˜ì—ˆìŠµë‹ˆë‹¤.<br><br>ìžì„¸í•œ ì‚¬í•­ì€ ë¡œê·¸ 출력결과를 확ì¸í•˜ì„¸ìš” &Stop 중지(&S) service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergyê°€ 실행 중 입니다. Synergy is not running. Synergyê°€ 실행 중ì´ì§€ 않습니다. Unknown ì•Œìˆ˜ì—†ìŒ Browse for a synergys config file synergys 설정 íŒŒì¼ íƒìƒ‰ Save configuration as... ì„¤ì •ì„ ë‹¤ë¥¸ ì´ë¦„으로 저장... Save failed ì €ìž¥ì— ì‹¤íŒ¨í–ˆìŠµë‹ˆë‹¤ Could not save configuration to file. 설정 ì‚¬í•­ì„ íŒŒì¼ì— 저장할 수 없습니다. MainWindowBase Synergy Synergy Screen name: Unknown ì•Œìˆ˜ì—†ìŒ &Server IP: &Start 시작(&S) &Server (share this computer's mouse and keyboard): 서버(&S) (ì´ ì»´í“¨í„°ì˜ ë§ˆìš°ìŠ¤ì™€ 키보드를 공유): Use existing configuration: 기존 ì„¤ì •ì„ ì‚¬ìš©: &Configuration file: 설정 파ì¼(&C): &Browse... 찾아 보기(&B)... Configure interactively: ìƒí˜¸ìž‘ìš© 설정: &Configure Server... 서버 설정(&C) &Client (use another computer's keyboard and mouse): í´ë¼ì´ì–¸íŠ¸(&C) (다른 ì»´í“¨í„°ì˜ í‚¤ë³´ë“œì™€ 마우스를 사용): Ready 준비 Log 로그 &Apply ì ìš©(&A) &Elevate IP addresses: &About Synergy... Synergyì— ê´€í•˜ì—¬(&A)... &Quit 종료(&Q) Quit 종료 Ctrl+Q Ctrl+Q Run 실행 Ctrl+S Ctrl+S S&top 중지(&T) Stop 중지 Ctrl+T Ctrl+T S&how Status ìƒíƒœ 보기(&H) Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... ì„¤ì •ì„ ë‹¤ë¥¸ ì´ë¦„으로 저장(&A)... Save the interactively generated server configuration to a file. ìƒí˜¸ìž‘용으로 ìƒì„±ëœ 서버 ì„¤ì •ì„ íŒŒì¼ë¡œ 저장하기. Ctrl+Alt+S Ctrl+Alt+S Settings 설정 Edit settings 설정 편집 Run Wizard 마법사 실행 NewScreenWidget Unnamed ì´ë¦„ì—†ìŒ QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy ì„¤ì •íŒŒì¼ (*.sgc);;모든 íŒŒì¼ (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy ì„¤ì •íŒŒì¼ (*.conf);;모든 íŒŒì¼ (*.*) System tray is unavailable, quitting. 시스템 트레ì´ë¥¼ 사용할 수 없어 종료합니다. ScreenSettingsDialog Screen name is empty 스í¬ë¦° ì´ë¦„ì´ ë¹„ì—ˆìŠµë‹ˆë‹¤ The name for a screen can not be empty. Please fill in a name or cancel the dialog. 스í¬ë¦° ì´ë¦„ì´ ë¹„ì—ˆìŠµë‹ˆë‹¤. ì´ë¦„ì„ ìž…ë ¥í•˜ê±°ë‚˜ ìž…ë ¥ì°½ì„ ì·¨ì†Œí•˜ì„¸ìš”. ScreenSettingsDialogBase Screen Settings 화면 설정 Screen &name: 화면 ì´ë¦„(&N): A&liases 별칭(&L) &Add 추가(&A) &Remove ì‚­ì œ(&R) &Modifier keys ë³´ì¡° 키(&M) &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta 메타 Super ìŠˆí¼ None ì—†ìŒ &Ctrl: &Ctrl: Al&t: Al&t: M&eta: 메타(&M): S&uper: 슈í¼(&U): &Dead corners 사용하지 않는 모서리(&D) Top-left ìƒë‹¨ 왼쪽 Top-right ìƒë‹¨ 오른쪽 Bottom-left 하단 왼쪽 Bottom-right 하단 오른쪽 Corner Si&ze: 모서리 í¬ê¸°(&Z) &Fixes ê³ ì •(&F) Fix CAPS LOCK key CAPS LOCK 키 ê³ ì • Fix NUM LOCK key NUM LOCK 키 ê³ ì • Fix SCROLL LOCK key SCROLL LOCK 키 ê³ ì • Fix XTest for Xinerama Xinerama를 위한 XTest ê³ ì • ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>화면: <b>%1</b></center><br>ì„¤ì •ì„ íŽ¸ì§‘í•˜ë ¤ë©´ ë”블í´ë¦­<br>삭제하려면 휴지통으로 드래그 하세요 ServerConfigDialogBase Server Configuration 서버 설정 Screens and links 화면과 ë§í¬ Drag a screen from the grid to the trashcan to remove it. 삭제하려면 í™”ë©´ì„ íœ´ì§€í†µìœ¼ë¡œ 드래그 하세요. Configure the layout of your synergy server configuration. Synergy 서버 구성과 ë ˆì´ì•„ì›ƒì„ ì„¤ì •í•˜ì„¸ìš”. Drag this button to the grid to add a new screen. 새로운 í™”ë©´ì„ ì¶”ê°€í•˜ë ¤ë©´ ì´ ë²„íŠ¼ì„ ê²©ìž ì•ˆìœ¼ë¡œ 드래그 하세요. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. 새로운 í™”ë©´ì„ ì¶”ê°€í•˜ë ¤ë©´ ìƒë‹¨ì˜ í™”ë©´ì„ ê²©ìž ì•ˆìœ¼ë¡œ 드래그 하세요. í™”ë©´ì„ ì‚­ì œí•˜ë ¤ë©´ 휴지통으로 드래그 하세요. 화면 ì„¤ì •ì„ íŽ¸ì§‘í•˜ë ¤ë©´ ë”블í´ë¦­ 하세요. Hotkeys 단축키 &Hotkeys 단축키(&H) &New ìƒì„±(&N) &Edit 편집(&E) &Remove ì‚­ì œ(&R) A&ctions í–‰ë™(&C) Ne&w ìƒì„±(&W) E&dit 편집(&D) Re&move ì‚­ì œ(&M) Advanced server settings 고급 설정 &Switch 전환(&S) Switch &after waiting 대기 후 전환(&A) ms ms Switch on double &tap within 지정시간 ì•ˆì— ë”블 탭으로 전환(&T) &Options 옵션(&O) &Check clients every 지정 시간마다 í´ë¼ì´ì–¸íŠ¸ 확ì¸(&C) Use &relative mouse moves ìƒëŒ€ì ì¸ 마우스 ì´ë™ 사용(&R) S&ynchronize screen savers 스í¬ë¦°ì„¸ì´ë²„ ë™ê¸°í™”(&Y) Don't take &foreground window on Windows servers í´ë¼ì´ì–¸íŠ¸ë¡œ ì „í™˜ì‹œí•´ë„ ì„œë²„ì˜ í¬ì»¤ìŠ¤ 방지 (전체화면 작업중 í´ë¼ì´ì–¸íŠ¸ë¡œ ì „í™˜í•´ë„ ì „ì²´í™”ë©´ì´ ìœ ì§€ë˜ë©°, 서버ì—ì„œ 전체화면 중 최소화 후 í´ë¼ì´ì–¸íŠ¸ 전환시 ì „ì²´í™”ë©´ì„ ë°©ì§€) &Dead corners 사용하지 않는 모서리(&D) To&p-left ìƒë‹¨ 왼쪽(&P) Top-rig&ht ìƒë‹¨ 오른쪽(&H) &Bottom-left 하단 왼쪽(&B) Bottom-ri&ght 하단 오른쪽(&G) Cor&ner Size: 모서리 í¬ê¸°(&N): SettingsDialog Save log file to... 로그 íŒŒì¼ ì €ìž¥í•˜ê¸°... SettingsDialogBase Settings 설정 &Advanced 고급(&A) Sc&reen name: 화면 ì´ë¦„(&R): P&ort: í¬íŠ¸(&O): &Interface: ì¸í„°íŽ˜ì´ìŠ¤(&I): &Start Synergy after logging in 윈ë„ìš° 시작시 Synergy 시작(&S) &Automatically start server/client 서버/í´ë¼ì´ì–¸íŠ¸ë¥¼ ìžë™ìœ¼ë¡œ 시작(&A) &Hide when server/client starts 서버/í´ë¼ì´ì–¸íŠ¸ê°€ 시작ë˜ë©´ 숨기기(&H) Logging 로그 ê¸°ë¡ &Process mode: Service Desktop (legacy) &Logging level: ê¸°ë¡ ìˆ˜ì¤€(&L): Log to file: 파ì¼ë¡œ 저장: Browse... 찾아보기... Error 오류 Warning 경고 Note 알림 Info ì •ë³´ Debug 디버그 Debug1 디버그1 Debug2 디버그2 &Startup SetupWizard Setup Synergy 시너지 설정 Please select an option. ì˜µì…˜ì„ ì„ íƒí•˜ì„¸ìš”. SetupWizardBase Setup Synergy 시너지 설정 Server or Client? 서버 ë˜ëŠ” í´ë¼ì´ì–¸íŠ¸? &Server (new setup) 서버(&S) (ì‹ ê·œ 설정) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. ì—¬ëŸ¬ë¶„ì´ ì„¤ì •í•˜ëŠ” 첫 컴퓨터입니다. ì—¬ëŸ¬ë¶„ì˜ í‚¤ë³´ë“œì™€ 마우스는 ì´ ì»´í“¨í„°ì— ì—°ê²°ë˜ì–´ 있으며, ì—¬ê¸°ì— ì—°ê²°ëœ ë§ˆìš°ìŠ¤ë¥¼ 다른 ì»´í“¨í„°ì˜ í™”ë©´ìœ¼ë¡œ ì˜®ê²¨ë‹¤ë‹ ìˆ˜ 있게 ë©ë‹ˆë‹¤. Synergy í™˜ê²½ì„ êµ¬ì„±í•  ë•Œ 서버는 하나만 존재해야 합니다. &Client (add to setup) í´ë¼ì´ì–¸íŠ¸(&C) (기존 Synergyí™˜ê²½ì— ì¶”ê°€) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. ì´ë¯¸ 서버 하나를 설정해 ë‘었습니다. ì´ ì»´í“¨í„°ëŠ” ì„œë²„ì˜ í‚¤ë³´ë“œì™€ 마우스를 사용해서 ì¡°ìž‘í•  수 있게 ë©ë‹ˆë‹¤. Synergy í™˜ê²½ì— ì—¬ëŸ¬ê°œì˜ í´ë¼ì´ì–¸íŠ¸ë¥¼ 추가할 수 있습니다. VersionChecker Unknown ì•Œìˆ˜ì—†ìŒ synergy-1.4.12-Source/src/gui/res/lang/gui_nl-NL.qm0000600000175000017500000004657212006005561021730 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB8C;€^EÀ"+[H4(SWVY¾åuƧ¤&´Ç1y«Œ)­Ï>Â<¡+ÅG×8šVE+þV¥?JŒ‚«`!(¶Þ¯+Ôä*»2*»0ì*Ð%h*ì0œ+ŒK+«`ûGË8Gíz(TL™b>ŽUÛ`\X·¹³YïÔ-/ZÆÂ-kxýôÚÁx.àä _ëØ>4órö}S;N=Æu> (Z Œ= îInbj!É°¯4@º¾þ3ÒÉ‚þ.<Ev.U_þ#áeë9¨w94ª¸ú&X­Ã&麨”ʺ¨”Q˜ Æ;H}ëH¦”-ðO éAO éBrÂVE ϸÓ,ÍiC<êUN™)æYu:>õl_” W}× "€Š*Ä:­šl®d¨öé0-«Žø,«a«–«Ë° Î4òÄ:Ó&—Ä:Ó0œäöž òç¹Ô žŽÄ´Îz†Îç>éJž>Fëêžq £3=ñTk@d/â‚Á„|µÞ%ëãC'(/lYA¬}F•8Õ€ÂnbŸC:ø»ó2€÷¸‰#2 Öj® IÞ_h Jz?À v®~7. -5 G OøŽ$ñ P¢n: dö¹$ ~5Ó9¢ ¤hÞEÒ ±¥zƒ Ö„~ ȹ!W >îBË aº®;± |ßÚ,y ŒFå' ŒFå1õ žýZ'Ë ÈcÄ< àKG ) RVŽv RVŽ2 RVŽ! RVŽGî R÷®} Tƒä"E V½4 šÚ± §|*=~ «c2? »s å »s@ ÞF¤) ^®Þ /ó( 4pÄ:e dÙ+ i!Î Ü rù- zkÙ ‰P@S àx43 è]^µ ^@™=‰%ôžƒë ’r/åŽè7å*«kC8Rk£1.®ú.3QÓ>áò¬Š)aýùAfiH(&Ok&OkAboutDialogBaseOver Synergy About SynergyAboutDialogBaseOnbekendUnknownAboutDialogBaseVersie:Version:AboutDialogBase6Kies de uit te voeren actieChoose the action to performActionDialogBase"Configureer ActieConfigure ActionActionDialogBase2Vergrendel muis op schermLock cursor to screenActionDialogBase*Druk op een sneltoetsPress a hotkeyActionDialogBaseBDruk op een sneltoets en laat losPress and release a hotkeyActionDialogBase,Laat een sneltoets losRelease a hotkeyActionDialogBaseBVerander in een bepaalde richtingSwitch in directionActionDialogBase Naar scherm gaanSwitch to screenActionDialogBase:Deze wordt uitgevoerd wanneerThis action is performed whenActionDialogBase omlaagdownActionDialogBase linksleftActionDialogBaseuitoffActionDialogBaseaanonActionDialogBase.Alleen op deze schermenonly on these screensActionDialogBase rechtsrightActionDialogBase2de sneltoets is ingedruktthe hotkey is pressedActionDialogBase4de sneltoets is losgelatenthe hotkey is releasedActionDialogBase wisseltoggleActionDialogBase omhoogupActionDialogBaseTVoer de specificatie voor de sneltoest in:'Enter the specification for the hotkey:HotkeyDialogBaseSneltoetsHotkeyHotkeyDialogBase&Bewerken&Edit MainWindow&Bestand&File MainWindow &Help&Help MainWindow &Start&Start MainWindow &Stop&Stop MainWindow&Venster&Window MainWindow†<p>Versie %1 is nu beschikbaar, <a href="%2">ga na website</a>.</p>C

Version %1 is now available, visit website.

 MainWindowHOpen een Synergy configuratiebestand!Browse for a synergys config file MainWindowJKan configuratiebestand niet aanmakenCannot write configuration file MainWindow^De bestandsnaam van de configuratie is ongeldigConfiguration filename invalid MainWindowVKon configuratie niet opslaan naar bestand.%Could not save configuration to file. MainWindow Hostnaam is leegHostname is empty MainWindowŒVul a.u.b. een hostnaam in voor de Synergy client om mee te verbinden.?Please fill in a hostname for the synergy client to connect to. MainWindowJHet programma kan niet worden gestartProgram can not be started MainWindow4Sla configuratie op als...Save configuration as... MainWindow$Opslaan is mislukt Save failed MainWindowDDe Synergy client is niet gevondenSynergy client not found MainWindow.Synergy is niet actief.Synergy is not running. MainWindow,Synergy wordt gestart.Synergy is starting. MainWindow>Synergy server is niet gevondenSynergy server not found MainWindowØSynergy werd onverwacht afgesloten met volgende exit code: %1.<br><br>. Raadpleeg de log v oor meer details.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowLSynergy werd afgesloten door een error Synergy terminated with an error MainWindowdDe executable voor de Synergy client bestaat niet.5The executable for the synergy client does not exist. MainWindowdDe executable voor de Synergy client bestaat niet.5The executable for the synergy server does not exist. MainWindowRDe uitvoering van <br><br>%1<br><br>kon niet succesvol worden uitgevoerd, hoewel het bestaat. Verifieer eerst of u de nodige rechten hebt om het programma uit te voeren.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¨Het tijdelijke configuratiebestand om Synergy te starten kan niet geschreven worden.NThe temporary configuration file required to start synergy can not be written. MainWindowOnbekendUnknown MainWindowÚU hebt een ongeldig configuratiebestand ingegeven voor de Synergy server. Wilt u de configuratie nu inkijken?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow &Over Synergy...&About Synergy...MainWindowBaseToep&assen&ApplyMainWindowBase&Open... &Browse...MainWindowBase‚&Client (Gebruik de muis en toetsenbord van een andere computer):4&Client (use another computer's keyboard and mouse):MainWindowBase*&Configuratiebestand:&Configuration file:MainWindowBase,&Configureer Server...&Configure Server...MainWindowBase&Sluiten&QuitMainWindowBasex&Server (deel de muis en het toetsenbord van deze computer):3&Server (share this computer's mouse and keyboard):MainWindowBase &Start&StartMainWindowBase*Configureer grafisch:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+OCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase&Wijzig instellingen Edit settingsMainWindowBaseLogLogMainWindowBase SluitQuitMainWindowBase KlaarReadyMainWindowBase StartRunMainWindowBaseT&oon Status S&how StatusMainWindowBase S&topS&topMainWindowBase8Configuratie opslaan &als...Save configuration &as...MainWindowBase€Sla de grafisch gemaakte serverconfiguratie naar een bestand op.@Save the interactively generated server configuration to a file.MainWindowBaseInstellingenSettingsMainWindowBaseStopStopMainWindowBaseSynergySynergyMainWindowBaseOnbekendUnknownMainWindowBase>Gebruik bestaande configuratie:Use existing configuration:MainWindowBaseNaamloosUnnamedNewScreenWidgetfSynergy configuratie (*.conf);;Alle bestanden (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectdSynergy Configuratie (*.sgc);;Alle bestanden (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectnTaakbalk is niet beschikbaar, Synergy wordt afgesloten.%System tray is unavailable, quitting.QObject$Schermnaam is leegScreen name is emptyScreenSettingsDialog®De schermnaam mag niet leeg zijn. Gelieve een naam in te vullen of verlaat het venster.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog &Nieuw&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBase&Dode hoeken &Dead cornersScreenSettingsDialogBase &Fixes&FixesScreenSettingsDialogBase&Prefixtoetsen&Modifier keysScreenSettingsDialogBase&Verwijderen&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBaseA&liassenA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseLinksonder Bottom-leftScreenSettingsDialogBaseRechtsonder Bottom-rightScreenSettingsDialogBase&Grootte: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase&Fix CAPS LOCK toetsFix CAPS LOCK keyScreenSettingsDialogBase$Fix NUM LOCK toetsFix NUM LOCK keyScreenSettingsDialogBase*Fix SCROLL LOCK toetsFix SCROLL LOCK keyScreenSettingsDialogBase.Fix XTest voor XineramaFix XTest for XineramaScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseGeenNoneScreenSettingsDialogBaseS&uper:S&uper:ScreenSettingsDialogBaseScherm &naam: Screen &name:ScreenSettingsDialogBase&Scherm InstellingenScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBaseLinksbovenTop-leftScreenSettingsDialogBaseRechtsboven Top-rightScreenSettingsDialogBase<center>Scherm: <b>%1</b></center><br>Dubbelklik om instellingen te wijzigen<br>Sleep een scherm naar de prullenbak om het te verwijdereno
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModelLinksonder &Bottom-leftServerConfigDialogBase0&Controleer clients elke&Check clients everyServerConfigDialogBase&Dode hoeken &Dead cornersServerConfigDialogBase&Bewerken&EditServerConfigDialogBase&Sneltoetsen&HotkeysServerConfigDialogBase &Nieuw&NewServerConfigDialogBase&Opties&OptionsServerConfigDialogBase&Verwijderen&RemoveServerConfigDialogBaseA&ctiesA&ctionsServerConfigDialogBase@Geavanceerde server instellingenAdvanced server settingsServerConfigDialogBaseRechtsonder Bottom-ri&ghtServerConfigDialogBasedConfigureer de layout voor de server configuratie.:Configure the layout of your synergy server configuration.ServerConfigDialogBasetSleep een scherm naar de prullenbak om het te verwijderen.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase|Sleep nieuwe schermen naar het raster of verplaats bestaande schermen. Sleep een scherm naar de prullenbak om het te verwijderen. Dubbelklik op een scherm om zijn instellingen aan te passen.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBase„Sleep dit icoon naar het raster om een nieuw scherm toe te voegen.1Drag this button to the grid to add a new screen.ServerConfigDialogBaseAanpa&ssenE&ditServerConfigDialogBaseSneltoetsenHotkeysServerConfigDialogBase Nieu&wNe&wServerConfigDialogBaseVerwijderenRe&moveServerConfigDialogBase@S&ynchronizeer schermbeveiligingS&ynchronize screen saversServerConfigDialogBase"Schermen en linksScreens and linksServerConfigDialogBase&Server configuratieServer ConfigurationServerConfigDialogBaseLinksboven To&p-leftServerConfigDialogBaseRechtsboven Top-rig&htServerConfigDialogBaseDGebruik &relatieve muis bewegingenUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBase4Schrijf logbestand naar...Save log file to...SettingsDialogGe&avanceerd &AdvancedSettingsDialogBase>Start server/client automatisch"&Automatically start server/clientSettingsDialogBaseN&Verberg wanneer de server/client start&Hide when server/client startsSettingsDialogBase&Interface: &Interface:SettingsDialogBase:Start Synergy na het inloggen&Start Synergy after logging inSettingsDialogBase&Bladeren... Browse...SettingsDialogBaseFoutErrorSettingsDialogBaseInfoInfoSettingsDialogBase"Log naar bestand: Log to file:SettingsDialogBaseOpmerkingNoteSettingsDialogBase Poort:P&ort:SettingsDialogBaseScherm naam: Sc&reen name:SettingsDialogBaseInstellingenSettingsSettingsDialogBaseWaarschuwingWarningSettingsDialogBase@Selecteer een optie alstublieft.Please select an option. SetupWizard(Synergy configureren Setup Synergy SetupWizard Client&Client (add to setup)SetupWizardBase8Server (nieuwe configuratie)&Server (new setup)SetupWizardBase"Server of Client?Server or Client?SetupWizardBase(Synergy configureren Setup SynergySetupWizardBaseDit is de eerste computer die wordt geconfigureerd. Het toetsenbord en de muis zijn verbonden met deze computer. Dit maakt het mogelijk de muis aanwijzer naar het scherm van een andere computer te bewegen. Er kan maar een computer ingesteld worden als server.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase`Je hebt al een server ingesteld. Je wilt deze computer gaan gebruiken met het toetsenbord en de muis van de Server. Er kunnen meerdere clients toegevoegd worden aan een server.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseOnbekendUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_nl-NL.ts0000600000175000017500000013365612006005561021741 0ustar synergysynergy AboutDialogBase About Synergy Over Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Onbekend Version: Versie: &Ok &Ok ActionDialogBase Configure Action Configureer Actie Choose the action to perform Kies de uit te voeren actie Press a hotkey Druk op een sneltoets Release a hotkey Laat een sneltoets los Press and release a hotkey Druk op een sneltoets en laat los only on these screens Alleen op deze schermen Switch to screen Naar scherm gaan Switch in direction Verander in een bepaalde richting left links right rechts up omhoog down omlaag Lock cursor to screen Vergrendel muis op scherm toggle wissel on aan off uit This action is performed when Deze wordt uitgevoerd wanneer the hotkey is pressed de sneltoets is ingedrukt the hotkey is released de sneltoets is losgelaten HotkeyDialogBase Hotkey Sneltoets Enter the specification for the hotkey: Voer de specificatie voor de sneltoest in: MainWindow &Start &Start &File &Bestand &Edit &Bewerken &Window &Venster &Help &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Versie %1 is nu beschikbaar, <a href="%2">ga na website</a>.</p> Program can not be started Het programma kan niet worden gestart The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. De uitvoering van <br><br>%1<br><br>kon niet succesvol worden uitgevoerd, hoewel het bestaat. Verifieer eerst of u de nodige rechten hebt om het programma uit te voeren. Synergy client not found De Synergy client is niet gevonden The executable for the synergy client does not exist. De executable voor de Synergy client bestaat niet. Hostname is empty Hostnaam is leeg Please fill in a hostname for the synergy client to connect to. Vul a.u.b. een hostnaam in voor de Synergy client om mee te verbinden. Cannot write configuration file Kan configuratiebestand niet aanmaken The temporary configuration file required to start synergy can not be written. Het tijdelijke configuratiebestand om Synergy te starten kan niet geschreven worden. Configuration filename invalid De bestandsnaam van de configuratie is ongeldig You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? U hebt een ongeldig configuratiebestand ingegeven voor de Synergy server. Wilt u de configuratie nu inkijken? Synergy server not found Synergy server is niet gevonden The executable for the synergy server does not exist. De executable voor de Synergy client bestaat niet. Synergy terminated with an error Synergy werd afgesloten door een error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy werd onverwacht afgesloten met volgende exit code: %1.<br><br>. Raadpleeg de log v oor meer details. &Stop &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy wordt gestart. Synergy is not running. Synergy is niet actief. Unknown Onbekend Browse for a synergys config file Open een Synergy configuratiebestand Save configuration as... Sla configuratie op als... Save failed Opslaan is mislukt Could not save configuration to file. Kon configuratie niet opslaan naar bestand. MainWindowBase Synergy Synergy Screen name: Unknown Onbekend &Server IP: &Start &Start &Server (share this computer's mouse and keyboard): &Server (deel de muis en het toetsenbord van deze computer): Use existing configuration: Gebruik bestaande configuratie: &Configuration file: &Configuratiebestand: &Browse... &Open... Configure interactively: Configureer grafisch: &Configure Server... &Configureer Server... &Client (use another computer's keyboard and mouse): &Client (Gebruik de muis en toetsenbord van een andere computer): Ready Klaar Log Log &Apply Toep&assen &Elevate IP addresses: &About Synergy... &Over Synergy... &Quit &Sluiten Quit Sluit Ctrl+Q Ctrl+Q Run Start Ctrl+S Ctrl+S S&top S&top Stop Stop Ctrl+T Ctrl+T S&how Status T&oon Status Ctrl+H Ctrl+O &Hide Hide &Show Show Save configuration &as... Configuratie opslaan &als... Save the interactively generated server configuration to a file. Sla de grafisch gemaakte serverconfiguratie naar een bestand op. Ctrl+Alt+S Ctrl+Alt+S Settings Instellingen Edit settings Wijzig instellingen Run Wizard NewScreenWidget Unnamed Naamloos QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configuratie (*.sgc);;Alle bestanden (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy configuratie (*.conf);;Alle bestanden (*.*) System tray is unavailable, quitting. Taakbalk is niet beschikbaar, Synergy wordt afgesloten. ScreenSettingsDialog Screen name is empty Schermnaam is leeg The name for a screen can not be empty. Please fill in a name or cancel the dialog. De schermnaam mag niet leeg zijn. Gelieve een naam in te vullen of verlaat het venster. ScreenSettingsDialogBase Screen Settings Scherm Instellingen Screen &name: Scherm &naam: A&liases A&liassen &Add &Nieuw &Remove &Verwijderen &Modifier keys &Prefixtoetsen &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Geen &Ctrl: &Ctrl: Al&t: Al&t: M&eta: M&eta: S&uper: S&uper: &Dead corners &Dode hoeken Top-left Linksboven Top-right Rechtsboven Bottom-left Linksonder Bottom-right Rechtsonder Corner Si&ze: &Grootte: &Fixes &Fixes Fix CAPS LOCK key Fix CAPS LOCK toets Fix NUM LOCK key Fix NUM LOCK toets Fix SCROLL LOCK key Fix SCROLL LOCK toets Fix XTest for Xinerama Fix XTest voor Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Scherm: <b>%1</b></center><br>Dubbelklik om instellingen te wijzigen<br>Sleep een scherm naar de prullenbak om het te verwijderen ServerConfigDialogBase Server Configuration Server configuratie Screens and links Schermen en links Drag a screen from the grid to the trashcan to remove it. Sleep een scherm naar de prullenbak om het te verwijderen. Configure the layout of your synergy server configuration. Configureer de layout voor de server configuratie. Drag this button to the grid to add a new screen. Sleep dit icoon naar het raster om een nieuw scherm toe te voegen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Sleep nieuwe schermen naar het raster of verplaats bestaande schermen. Sleep een scherm naar de prullenbak om het te verwijderen. Dubbelklik op een scherm om zijn instellingen aan te passen. Hotkeys Sneltoetsen &Hotkeys &Sneltoetsen &New &Nieuw &Edit &Bewerken &Remove &Verwijderen A&ctions A&cties Ne&w Nieu&w E&dit Aanpa&ssen Re&move Verwijderen Advanced server settings Geavanceerde server instellingen &Switch Switch &after waiting ms ms Switch on double &tap within &Options &Opties &Check clients every &Controleer clients elke Use &relative mouse moves Gebruik &relatieve muis bewegingen S&ynchronize screen savers S&ynchronizeer schermbeveiliging Don't take &foreground window on Windows servers &Dead corners &Dode hoeken To&p-left Linksboven Top-rig&ht Rechtsboven &Bottom-left Linksonder Bottom-ri&ght Rechtsonder Cor&ner Size: SettingsDialog Save log file to... Schrijf logbestand naar... SettingsDialogBase Settings Instellingen &Advanced Ge&avanceerd Sc&reen name: Scherm naam: P&ort: Poort: &Interface: &Interface: &Start Synergy after logging in Start Synergy na het inloggen &Automatically start server/client Start server/client automatisch &Hide when server/client starts &Verberg wanneer de server/client start Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Log naar bestand: Browse... &Bladeren... Error Fout Warning Waarschuwing Note Opmerking Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Synergy configureren Please select an option. Selecteer een optie alstublieft. SetupWizardBase Setup Synergy Synergy configureren Server or Client? Server of Client? &Server (new setup) Server (nieuwe configuratie) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Dit is de eerste computer die wordt geconfigureerd. Het toetsenbord en de muis zijn verbonden met deze computer. Dit maakt het mogelijk de muis aanwijzer naar het scherm van een andere computer te bewegen. Er kan maar een computer ingesteld worden als server. &Client (add to setup) Client You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Je hebt al een server ingesteld. Je wilt deze computer gaan gebruiken met het toetsenbord en de muis van de Server. Er kunnen meerdere clients toegevoegd worden aan een server. VersionChecker Unknown Onbekend synergy-1.4.12-Source/src/gui/res/lang/gui_no.qm0000600000175000017500000003767612006005561021431 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBˆC6J^ÀÚ+[H4&ASWwY¾ uÆ秤#дÇ.«Œ'ŠÏ6í<¡)²G×5VE)댥«`?¶Þ+Ô°*»Ö*».#*Ð%*ì0Z+Œv+«`ßGË4ŽGíz&L™b6¹UÛ`}X·¹ÚYïÔ+ZÆÂ+Xxýô¦Áx.Šä eëØ>0Öó>ö}S8u>ï(Z P= î ×nbjÞ°¯4žº¾þÿÒÉ~þ,CEv.?_þ!ʪ¸ú$­Ã$¦º¨”œº¨”`˜ j;H}÷H¦”+íO é7§O é8¢ÂVE Ù¸Ó*ºUN™'Ãl_” [}× šl®P«ŽøM«‚«·«ì° Î1®Ä:Ó$RÄ:Ó-Ñäöž Îö±É—üÊJ)s"QJË@d&wÜl *&(ÿ8K( nÃ4.d+”@Ty(+€¡ªÈœ6>žŽÄ<Îz§Îç>ÛéJž6{ëêžÔ £3!=ñT†‚ﱊÁ„@µÞ%£ãC$ç/lY7î}F•5I€Ând»ó/~÷¸‰!- Öj IÞ_. v®~3¾ -5 W OøŽ"Ð P¢n5ã dö¹"k ~5Ó5‡ ¤hÞ8í ±¥z® Ö„~ ȹp |ßÚ*h ŒFå%> ŒFå.÷ žýZ%~ àKG ! RVŽ„ RVŽü RVŽ¨ RVŽ:ß R÷®ñ Tƒä P V½4Ú šÚ» «c/5 »sú »s7 ÞF¤&Õ ^®¬ /ó%À dÙ(þ i!Î ¢ rù? zkÙõ ‰P7i è]^ =‰%ôžƒ  ’r/åŽ7å(kC4Êk£.u®ú./ýÓ>Mò¬Š'0i;&undefinedOk&OkAboutDialogBaseOm Synergy About SynergyAboutDialogBase UkjentUnknownAboutDialogBaseVersjon:Version:AboutDialogBase,Velg handling å utføreChoose the action to performActionDialogBase*Konfigurer handlingenConfigure ActionActionDialogBase(Lås peker til skjermLock cursor to screenActionDialogBase&Trykk en hurtigtastPress a hotkeyActionDialogBase8Trykk og slipp en hurtigtastPress and release a hotkeyActionDialogBase&Slipp en hurtigtastRelease a hotkeyActionDialogBase$Endring i rettningSwitch in directionActionDialogBaseBytt til skjermSwitch to screenActionDialogBase@Denne handlingen blir utført nårThis action is performed whenActionDialogBaseneddownActionDialogBasevenstreleftActionDialogBaseavoffActionDialogBasepåonActionDialogBase.Bare på disse skjermeneonly on these screensActionDialogBase høyrerightActionDialogBase,husrtigtasten er tryktthe hotkey is pressedActionDialogBase(hurtigtasten slippesthe hotkey is releasedActionDialogBase veksletoggleActionDialogBaseoppupActionDialogBaseDAngi spesifikasjon for hurtigtast:'Enter the specification for the hotkey:HotkeyDialogBaseHurtigtastHotkeyHotkeyDialogBase"&undefinedRediger&Edit MainWindow&undefinedFil&File MainWindow&undefinedHjelp&Help MainWindow&undefinedStart&Start MainWindow&undefinedStopp&Stop MainWindow&undefinedVindu&Window MainWindow<p>Versjon %1 er nå tilgjengelig, <a href="%2">besøk hjemmeside</a>.</p>C

Version %1 is now available, visit website.

 MainWindowBVelg en oppsettsfil for synergys.!Browse for a synergys config file MainWindowDKan ikke skrive konfigurasjons filCannot write configuration file MainWindow6Konfigurerings filnavn feilConfiguration filename invalid MainWindow>Kunne ikke lagre oppsettsfilen.%Could not save configuration to file. MainWindow"Host navn er tomtHostname is empty MainWindowjVennligst fyll inn et host navn for synergi klienten.?Please fill in a hostname for the synergy client to connect to. MainWindow4Programmet kan ikke starteProgram can not be started MainWindow.Lagre oppsettet som ...Save configuration as... MainWindow Kunne ikke lagre Save failed MainWindow4Finner ikke Synergy klientSynergy client not found MainWindow&Synergy kjører ikkeSynergy is not running. MainWindowSynergy starterSynergy is starting. MainWindow4Finner ikke Synergy serverSynergy server not found MainWindowŠSynergy stoppet uventet med kode %1.<br><br>Se i loggen for detaljer.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow6Synergy stoppet med en feil Synergy terminated with an error MainWindow^Program filen for Synergy klienten finnes ikke5The executable for the synergy client does not exist. MainWindow\Programfilen for synergy-tjeneren finnes ikke.5The executable for the synergy server does not exist. MainWindow.Programfilen <br><br>%1<br><br> kunne ikke startes riktig, selv om den finnes. Sjekk at du har tilstrekkelige rettigheter til å kjøre dette programmet.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow´Den midlertidige oppsettsfilen, som er nødvendig for å starte synergy, kan ikke opprettes.NThe temporary configuration file required to start synergy can not be written. MainWindow UkjentUnknown MainWindow¾Du har ikke lagt inn en gyldig oppsettsfil for synergy-tjeneren. Vil du velge oppsettsfilen nå?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow&Om Synergy&About Synergy...MainWindowBase&Velg... &Browse...MainWindowBase`&Klient (bruk en annen maskins mus og tastatur):4&Client (use another computer's keyboard and mouse):MainWindowBase&Oppsettsfil:&Configuration file:MainWindowBase&&Sett opp tjener...&Configure Server...MainWindowBase&Avslutt&QuitMainWindowBase\&Tjener (del denne maskinens mus og tastatur).3&Server (share this computer's mouse and keyboard):MainWindowBase&undefinedStart&StartMainWindowBase*Sett opp interaktivt:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase&Endre innstillinger Edit settingsMainWindowBaseLoggLogMainWindowBaseAvsluttQuitMainWindowBaseKlarReadyMainWindowBaseKjørRunMainWindowBase&Vis Status S&how StatusMainWindowBase S&toppS&topMainWindowBase0L&agre oppsettet som ...Save configuration &as...MainWindowBasezLagre det interaktivt opprettede tjener-oppsettet til en fil.@Save the interactively generated server configuration to a file.MainWindowBaseInnstillingerSettingsMainWindowBase StoppStopMainWindowBaseSynergySynergyMainWindowBase UkjentUnknownMainWindowBase4Bruk eksisterende oppsett:Use existing configuration:MainWindowBaseUten navnUnnamedNewScreenWidgetTSynergy-oppsett (*.conf);;Alle filer (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectRSynergy-oppsett (*.sgc);;Alle filer (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject`Systemstatusfeltet er utilgjengelig - avslutter.%System tray is unavailable, quitting.QObject(Skjermnavnet er tomtScreen name is emptyScreenSettingsDialog„Skjermnavnet kan ikke være tomt. Oppgi navn eller avbryt dialogen.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog&Legg til&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBase&Døde hjørner &Dead cornersScreenSettingsDialogBase&Fikser&FixesScreenSettingsDialogBase&Spesialtaster&Modifier keysScreenSettingsDialogBase &Fjern&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBaseA&liaserA&liasesScreenSettingsDialogBase Al&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase&Nederst til venstre Bottom-leftScreenSettingsDialogBase"Nederst til høyre Bottom-rightScreenSettingsDialogBase Hj&ørnestørrelse Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase*Fiksér CAPS LOCK tastFix CAPS LOCK keyScreenSettingsDialogBase(Fiksér NUM LOCK tastFix NUM LOCK keyScreenSettingsDialogBase.Fiksér SCROLL LOCK tastFix SCROLL LOCK keyScreenSettingsDialogBase2Fiksér XTest for XineramaFix XTest for XineramaScreenSettingsDialogBase M&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBase IngenNoneScreenSettingsDialogBaseS&uper:S&uper:ScreenSettingsDialogBaseSkjerm&navn: Screen &name:ScreenSettingsDialogBase&SkjerminnstillingerScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase$Øverst til venstreTop-leftScreenSettingsDialogBase Øverst til høyre Top-rightScreenSettingsDialogBaseú<center>Skjerm: <b>%1</b></center><br>Dobbeltklikk for å endre innstillinger<br>Dra skjermen til søppelbøtta for å fjerne deno
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&Døde hjørner &Dead cornersServerConfigDialogBase"&undefinedRediger&EditServerConfigDialogBase&Hurtigtaster&HotkeysServerConfigDialogBase&Ny&NewServerConfigDialogBase &Fjern&RemoveServerConfigDialogBase&HandlingerA&ctionsServerConfigDialogBase<Avanserte tjener-innstillingerAdvanced server settingsServerConfigDialogBasetConfigure the layout of your synergy server configuration.:Configure the layout of your synergy server configuration.ServerConfigDialogBasetDra en skjerm fra nettet til søppelbøtta for å fjerne den.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBasePDra nye skjermer til nettet eller flytt rundt på de eksisterende. Dra en skjerm til søppelbøtta for å fjerne den. Dobbeltklikk en skjerm for å endre dens innstillinger.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasetDra denne knappen til nettet for å legge til en ny skjerm.1Drag this button to the grid to add a new screen.ServerConfigDialogBase En&dreE&ditServerConfigDialogBaseHurtigtasterHotkeysServerConfigDialogBaseN&yNe&wServerConfigDialogBase &FjernRe&moveServerConfigDialogBase Skjerm og lenkerScreens and linksServerConfigDialogBase(Server ConfigurationServer ConfigurationServerConfigDialogBasemsmsServerConfigDialogBaseVelg... Browse...SettingsDialogBaseFeilErrorSettingsDialogBaseInfoInfoSettingsDialogBaseInnstillingerSettingsSettingsDialogBaseAdvarselWarningSettingsDialogBaseSetup Synergy Setup Synergy SetupWizard&&Server (new setup)&Server (new setup)SetupWizardBase"Server or Client?Server or Client?SetupWizardBaseSetup Synergy Setup SynergySetupWizardBase6Du har allerede satt opp en tjener. Dette er en datamaskin som du ønsker å styre med tjenerens tastatur og mus. Det kan være mange klienter i ditt oppsett.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBase UkjentUnknownVersionCheckerˆsynergy-1.4.12-Source/src/gui/res/lang/gui_no.ts0000600000175000017500000013205712006005561021427 0ustar synergysynergy AboutDialogBase About Synergy Om Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Ukjent Version: Versjon: &Ok &undefinedOk ActionDialogBase Configure Action Konfigurer handlingen Choose the action to perform Velg handling Ã¥ utføre Press a hotkey Trykk en hurtigtast Release a hotkey Slipp en hurtigtast Press and release a hotkey Trykk og slipp en hurtigtast only on these screens Bare pÃ¥ disse skjermene Switch to screen Bytt til skjerm Switch in direction Endring i rettning left venstre right høyre up opp down ned Lock cursor to screen LÃ¥s peker til skjerm toggle veksle on pÃ¥ off av This action is performed when Denne handlingen blir utført nÃ¥r the hotkey is pressed husrtigtasten er trykt the hotkey is released hurtigtasten slippes HotkeyDialogBase Hotkey Hurtigtast Enter the specification for the hotkey: Angi spesifikasjon for hurtigtast: MainWindow &Start &undefinedStart &File &undefinedFil &Edit &undefinedRediger &Window &undefinedVindu &Help &undefinedHjelp <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Versjon %1 er nÃ¥ tilgjengelig, <a href="%2">besøk hjemmeside</a>.</p> Program can not be started Programmet kan ikke starte The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Programfilen <br><br>%1<br><br> kunne ikke startes riktig, selv om den finnes. Sjekk at du har tilstrekkelige rettigheter til Ã¥ kjøre dette programmet. Synergy client not found Finner ikke Synergy klient The executable for the synergy client does not exist. Program filen for Synergy klienten finnes ikke Hostname is empty Host navn er tomt Please fill in a hostname for the synergy client to connect to. Vennligst fyll inn et host navn for synergi klienten. Cannot write configuration file Kan ikke skrive konfigurasjons fil The temporary configuration file required to start synergy can not be written. Den midlertidige oppsettsfilen, som er nødvendig for Ã¥ starte synergy, kan ikke opprettes. Configuration filename invalid Konfigurerings filnavn feil You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Du har ikke lagt inn en gyldig oppsettsfil for synergy-tjeneren. Vil du velge oppsettsfilen nÃ¥? Synergy server not found Finner ikke Synergy server The executable for the synergy server does not exist. Programfilen for synergy-tjeneren finnes ikke. Synergy terminated with an error Synergy stoppet med en feil Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy stoppet uventet med kode %1.<br><br>Se i loggen for detaljer. &Stop &undefinedStopp service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy starter Synergy is not running. Synergy kjører ikke Unknown Ukjent Browse for a synergys config file Velg en oppsettsfil for synergys. Save configuration as... Lagre oppsettet som ... Save failed Kunne ikke lagre Could not save configuration to file. Kunne ikke lagre oppsettsfilen. MainWindowBase Synergy Synergy Screen name: Unknown Ukjent &Server IP: &Start &undefinedStart &Server (share this computer's mouse and keyboard): &Tjener (del denne maskinens mus og tastatur). Use existing configuration: Bruk eksisterende oppsett: &Configuration file: &Oppsettsfil: &Browse... &Velg... Configure interactively: Sett opp interaktivt: &Configure Server... &Sett opp tjener... &Client (use another computer's keyboard and mouse): &Klient (bruk en annen maskins mus og tastatur): Ready Klar Log Logg &Apply &Elevate IP addresses: &About Synergy... &Om Synergy &Quit &Avslutt Quit Avslutt Ctrl+Q Ctrl+Q Run Kjør Ctrl+S Ctrl+S S&top S&topp Stop Stopp Ctrl+T Ctrl+T S&how Status &Vis Status Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... L&agre oppsettet som ... Save the interactively generated server configuration to a file. Lagre det interaktivt opprettede tjener-oppsettet til en fil. Ctrl+Alt+S Ctrl+Alt+S Settings Innstillinger Edit settings Endre innstillinger Run Wizard NewScreenWidget Unnamed Uten navn QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy-oppsett (*.sgc);;Alle filer (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy-oppsett (*.conf);;Alle filer (*.*) System tray is unavailable, quitting. Systemstatusfeltet er utilgjengelig - avslutter. ScreenSettingsDialog Screen name is empty Skjermnavnet er tomt The name for a screen can not be empty. Please fill in a name or cancel the dialog. Skjermnavnet kan ikke være tomt. Oppgi navn eller avbryt dialogen. ScreenSettingsDialogBase Screen Settings Skjerminnstillinger Screen &name: Skjerm&navn: A&liases A&liaser &Add &Legg til &Remove &Fjern &Modifier keys &Spesialtaster &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Ingen &Ctrl: &Ctrl: Al&t: Al&t: M&eta: M&eta: S&uper: S&uper: &Dead corners &Døde hjørner Top-left Øverst til venstre Top-right Øverst til høyre Bottom-left Nederst til venstre Bottom-right Nederst til høyre Corner Si&ze: Hj&ørnestørrelse &Fixes &Fikser Fix CAPS LOCK key Fiksér CAPS LOCK tast Fix NUM LOCK key Fiksér NUM LOCK tast Fix SCROLL LOCK key Fiksér SCROLL LOCK tast Fix XTest for Xinerama Fiksér XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Skjerm: <b>%1</b></center><br>Dobbeltklikk for Ã¥ endre innstillinger<br>Dra skjermen til søppelbøtta for Ã¥ fjerne den ServerConfigDialogBase Server Configuration Server Configuration Screens and links Skjerm og lenker Drag a screen from the grid to the trashcan to remove it. Dra en skjerm fra nettet til søppelbøtta for Ã¥ fjerne den. Configure the layout of your synergy server configuration. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Dra denne knappen til nettet for Ã¥ legge til en ny skjerm. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Dra nye skjermer til nettet eller flytt rundt pÃ¥ de eksisterende. Dra en skjerm til søppelbøtta for Ã¥ fjerne den. Dobbeltklikk en skjerm for Ã¥ endre dens innstillinger. Hotkeys Hurtigtaster &Hotkeys &Hurtigtaster &New &Ny &Edit &undefinedRediger &Remove &Fjern A&ctions &Handlinger Ne&w N&y E&dit En&dre Re&move &Fjern Advanced server settings Avanserte tjener-innstillinger &Switch Switch &after waiting ms ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners &Døde hjørner To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings Innstillinger &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Velg... Error Feil Warning Advarsel Note Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Setup Synergy Please select an option. SetupWizardBase Setup Synergy Setup Synergy Server or Client? Server or Client? &Server (new setup) &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Du har allerede satt opp en tjener. Dette er en datamaskin som du ønsker Ã¥ styre med tjenerens tastatur og mus. Det kan være mange klienter i ditt oppsett. VersionChecker Unknown Ukjent synergy-1.4.12-Source/src/gui/res/lang/gui_pl-PL.qm0000600000175000017500000002432512006005561021724 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBˆ^îÀá+[H4%SWRY¾çuƺ§¤/«Œ[Ï"gV¥#9Œ~«`š¶ÞR+Ô…*»[*»µ*Ð%‹*ì0·+Œ+«`L™b"3UÛ`¯X·¹³YïÔ™xýô…Áx.Äóö}Sh(Z ¡= î Xnbj °¯4Qº¾þØÒÉ_Ev.÷º¨”纨”K˜ ç;H}¼H¦”]à"ùÂVEò¸Ó;iC ÅUN™”Yu:"šl_” €Š*ÄÚšl®#«Žø,«a«–«Ëäöž ñ$Z!‘ö±É-iz#n攄(ÿ$Ú( n†4.dÕ@Ty€¡ªSžŽÄ ÅÎz~Îç>¥éJž!éëêž £3=ñT k@dj‚ïéŠÁ„1µÞ%¦€Ân1 Jz#¥ -5p P¢n+ dö¹Ä Ö„~I ȹÓ aº® % |ßÚç ŒFåj ŒFåñ žýZ¦ ÈcÄ } àKGB R÷® † Tƒä… V½4½ šÚ‚ §|*!K »s[ »s#ó ^® /óä 4pÄ’ i!Î rù? zkÙÐ ‰P$6 àx4+ ^$z=‰>ä yôžƒë ’rÄ/厶7åqkC×Ó> ìi%3&undefinedOk&OkAboutDialogBaseO Synergy About SynergyAboutDialogBaseWersja:Version:AboutDialogBase4Wybierz akcj do wykonaniaChoose the action to performActionDialogBase Konfiguruj akcjeConfigure ActionActionDialogBaseNZablokuj kursor myszki do danego ekranuLock cursor to screenActionDialogBaseWci[nij klawiszPress a hotkeyActionDialogBase2Wci[nij i zwolnij klawiszPress and release a hotkeyActionDialogBaseZwolnij klawiszRelease a hotkeyActionDialogBase&PrzeBcz w kierunkuSwitch in directionActionDialogBase"Przejdz do ekranuSwitch to screenActionDialogBase8Ta akcja jest wykonywana gdyThis action is performed whenActionDialogBase w dóBdownActionDialogBase w lewoleftActionDialogBase WyBczoffActionDialogBase WBczonActionDialogBase,tylko na tych ekranachonly on these screensActionDialogBasew praworightActionDialogBase:klawisz skrótu jest wci[nitythe hotkey is pressedActionDialogBase:klawisz skrótu jest zwolnionythe hotkey is releasedActionDialogBaseprzeBcztoggleActionDialogBase w górupActionDialogBaseKlawisz skrótuHotkeyHotkeyDialogBase Edytuj&Edit MainWindowPlik&File MainWindow &Pomoc&Help MainWindow Start&Start MainWindowStop&Stop MainWindowOkno&Window MainWindowBWska| plik konfiguracyjny synergy!Browse for a synergys config file MainWindowPNie mo|na zapisa pliku konfiguracyjnegoCannot write configuration file MainWindowPNiewBa[ciwa nazwa pliku konfiguracyjnegoConfiguration filename invalid MainWindowPNie mo|na zapisa konfiguracji do pliku.%Could not save configuration to file. MainWindow:Pole "Nazwa hosta" jest pusteHostname is empty MainWindow~WypeBnij nazw hosta do której ma si podBczy klient synergy.?Please fill in a hostname for the synergy client to connect to. MainWindow8Nie mo|na uruchomi programuProgram can not be started MainWindow6Zapisz konfiguracj jako...Save configuration as... MainWindowBBd zapisu Save failed MainWindowJKlient Synergy nie zostaB odnalezionySynergy client not found MainWindow0Synergy nie uruchomione.Synergy is not running. MainWindow2Synergy jest uruchamiane.Synergy is starting. MainWindow<Nie znaleziono serwera SynergySynergy server not found MainWindowFSynergy zostaBo zatrzymane z bBdem Synergy terminated with an error MainWindowZPlik wykonywalny klienta synergy nie istnieje5The executable for the synergy client does not exist. MainWindowZPlik wykonywalny serwera synergy nie istnieje5The executable for the synergy server does not exist. MainWindow²Nie mo|na zapisa tymczasowego pliku konfiguracyjnego wymaganego do uruchomienia synergy.NThe temporary configuration file required to start synergy can not be written. MainWindowO Synergy...&About Synergy...MainWindowBaseWyszukaj... &Browse...MainWindowBase,Plik konfiguracyjny...&Configuration file:MainWindowBase(Konfiguruj Serwer...&Configure Server...MainWindowBaseZakoDcz&QuitMainWindowBase Start&StartMainWindowBase2Konfiguruj interaktywnie:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase CTRL+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase CTRL+TCtrl+TMainWindowBase"Edytuj ustawienia Edit settingsMainWindowBaseLogLogMainWindowBaseZakoDczQuitMainWindowBase GotoweReadyMainWindowBaseUruchomRunMainWindowBase Uruchom Kreatora Run WizardMainWindowBasePoka| status S&how StatusMainWindowBaseZatrzymajS&topMainWindowBase6Zapisz konfiguracj jako...Save configuration &as...MainWindowBaseUstawieniaSettingsMainWindowBaseZatrzymajStopMainWindowBaseSynergySynergyMainWindowBase<U|yj istniejcej konfiguracji:Use existing configuration:MainWindowBaseNienazwanyUnnamedNewScreenWidget.Nazwa ekranu jest pustaScreen name is emptyScreenSettingsDialog Dodaj&AddScreenSettingsDialogBaseUsuD&RemoveScreenSettingsDialogBase Shift&Shift:ScreenSettingsDialogBase AliasyA&liasesScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase2Napraw przycisk CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase0Napraw przycisk NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase6Napraw przycisk SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBaseNazwa ekranu: Screen &name:ScreenSettingsDialogBase"Ustawienia obrazuScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBaseLewy-górnyTop-leftScreenSettingsDialogBasePrawy-górny Top-rightScreenSettingsDialogBaseDolny-lewy &Bottom-leftServerConfigDialogBase Edytuj&EditServerConfigDialogBaseUsuD&RemoveServerConfigDialogBaseDolny-prawy Bottom-ri&ghtServerConfigDialogBase&Wielko[ naro|nika: Cor&ner Size:ServerConfigDialogBase"Skróty klawiszoweHotkeysServerConfigDialogBase(Konfiguracja serweraServer ConfigurationServerConfigDialogBaseGórny-lewy To&p-leftServerConfigDialogBaseGórny-prawy Top-rig&htServerConfigDialogBase"Zapisz logi do...Save log file to...SettingsDialogZaawansowane &AdvancedSettingsDialogBase@Ukryj gdy serwer/klient startuje&Hide when server/client startsSettingsDialogBaseInterfejs: &Interface:SettingsDialogBase"Poziom logowania:&Logging level:SettingsDialogBasePrzegldaj... Browse...SettingsDialogBaseBBdErrorSettingsDialogBaseInfoInfoSettingsDialogBase,Zapisuj logi do pliku: Log to file:SettingsDialogBaseLogowanieLoggingSettingsDialogBase UwagaNoteSettingsDialogBase Port:P&ort:SettingsDialogBaseNazwa ekranu: Sc&reen name:SettingsDialogBaseUstawieniaSettingsSettingsDialogBaseOstrze|enieWarningSettingsDialogBase(Prosz wybra opcj,Please select an option. SetupWizard$Klient czy Serwer?Server or Client?SetupWizardBasesynergy-1.4.12-Source/src/gui/res/lang/gui_pl-PL.ts0000600000175000017500000012702012006005561021731 0ustar synergysynergy AboutDialogBase About Synergy O Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: Wersja: &Ok &undefinedOk ActionDialogBase Configure Action Konfiguruj akcje Choose the action to perform Wybierz akcjÄ™ do wykonania Press a hotkey WciÅ›nij klawisz Release a hotkey Zwolnij klawisz Press and release a hotkey WciÅ›nij i zwolnij klawisz only on these screens tylko na tych ekranach Switch to screen Przejdź do ekranu Switch in direction PrzeÅ‚Ä…cz w kierunku left w lewo right w prawo up w górÄ™ down w dół Lock cursor to screen Zablokuj kursor myszki do danego ekranu toggle przeÅ‚Ä…cz on WÅ‚Ä…cz off WyÅ‚Ä…cz This action is performed when Ta akcja jest wykonywana gdy the hotkey is pressed klawisz skrótu jest wciÅ›niÄ™ty the hotkey is released klawisz skrótu jest zwolniony HotkeyDialogBase Hotkey Klawisz skrótu Enter the specification for the hotkey: MainWindow &Start Start &File Plik &Edit Edytuj &Window Okno &Help &Pomoc <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started Nie można uruchomić programu The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found Klient Synergy nie zostaÅ‚ odnaleziony The executable for the synergy client does not exist. Plik wykonywalny klienta synergy nie istnieje Hostname is empty Pole "Nazwa hosta" jest puste Please fill in a hostname for the synergy client to connect to. WypeÅ‚nij nazwÄ™ hosta do której ma siÄ™ podÅ‚Ä…czyć klient synergy. Cannot write configuration file Nie można zapisać pliku konfiguracyjnego The temporary configuration file required to start synergy can not be written. Nie można zapisać tymczasowego pliku konfiguracyjnego wymaganego do uruchomienia synergy. Configuration filename invalid NiewÅ‚aÅ›ciwa nazwa pliku konfiguracyjnego You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found Nie znaleziono serwera Synergy The executable for the synergy server does not exist. Plik wykonywalny serwera synergy nie istnieje Synergy terminated with an error Synergy zostaÅ‚o zatrzymane z bÅ‚Ä™dem Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy jest uruchamiane. Synergy is not running. Synergy nie uruchomione. Unknown Browse for a synergys config file Wskaż plik konfiguracyjny synergy Save configuration as... Zapisz konfiguracjÄ™ jako... Save failed BÅ‚Ä…d zapisu Could not save configuration to file. Nie można zapisać konfiguracji do pliku. MainWindowBase Synergy Synergy Screen name: Unknown &Server IP: &Start Start &Server (share this computer's mouse and keyboard): Use existing configuration: Użyj istniejÄ…cej konfiguracji: &Configuration file: Plik konfiguracyjny... &Browse... Wyszukaj... Configure interactively: Konfiguruj interaktywnie: &Configure Server... Konfiguruj Serwer... &Client (use another computer's keyboard and mouse): Ready Gotowe Log Log &Apply &Elevate IP addresses: &About Synergy... O Synergy... &Quit ZakoÅ„cz Quit ZakoÅ„cz Ctrl+Q Ctrl+Q Run Uruchom Ctrl+S Ctrl+S S&top Zatrzymaj Stop Zatrzymaj Ctrl+T CTRL+T S&how Status Pokaż status Ctrl+H CTRL+H &Hide Hide &Show Show Save configuration &as... Zapisz konfiguracjÄ™ jako... Save the interactively generated server configuration to a file. Ctrl+Alt+S Ctrl+Alt+S Settings Ustawienia Edit settings Edytuj ustawienia Run Wizard Uruchom Kreatora NewScreenWidget Unnamed Nienazwany QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty Nazwa ekranu jest pusta The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Ustawienia obrazu Screen &name: Nazwa ekranu: A&liases Aliasy &Add Dodaj &Remove UsuÅ„ &Modifier keys &Shift: Shift Shift Shift Ctrl Ctrl Alt Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Lewy-górny Top-right Prawy-górny Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Napraw przycisk CAPS LOCK Fix NUM LOCK key Napraw przycisk NUM LOCK Fix SCROLL LOCK key Napraw przycisk SCROLL LOCK Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Konfiguracja serwera Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys Skróty klawiszowe &Hotkeys &New &Edit Edytuj &Remove UsuÅ„ A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Górny-lewy Top-rig&ht Górny-prawy &Bottom-left Dolny-lewy Bottom-ri&ght Dolny-prawy Cor&ner Size: Wielkość narożnika: SettingsDialog Save log file to... Zapisz logi do... SettingsDialogBase Settings Ustawienia &Advanced Zaawansowane Sc&reen name: Nazwa ekranu: P&ort: Port: &Interface: Interfejs: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Ukryj gdy serwer/klient startuje Logging Logowanie &Process mode: Service Desktop (legacy) &Logging level: Poziom logowania: Log to file: Zapisuj logi do pliku: Browse... PrzeglÄ…daj... Error BÅ‚Ä…d Warning Ostrzeżenie Note Uwaga Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. ProszÄ™ wybrać opcjÄ™, SetupWizardBase Setup Synergy Server or Client? Klient czy Serwer? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_pt-BR.qm0000600000175000017500000002766412006005561021735 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB°^CÀ.+[H4 SWõY¾ŽuÆ §¤•´Ç$Ê«Œ!_Ï)ŒG×'†V¥)¿Œ+«`€¶Þ+ÔÒ*»F*»$;*Ð%v*ì0¨+Œ²+«` GË&øL™b)XUÛ` X·¹ZxýôÖÁx.–ä gótö}S¾u>Ó(Z j= î %nbj+°¯4 º¾þ#ÒÉ”Ev.º¨”Öº¨”☠°;H}÷H¦”#O é+O é+SÂVE Q¸Ó"XUN™!˜l_” ÝŠ*Ä(Sšl®|¨öé#Ä«ŽøÉ«þ«3«hö±Éý"QJ_-iz)òË@d P( nÇ4.d"¾{ã%€¡ªîžŽÄ –ÎzÎç>¹ £3=ñT Þk@d#kŠÁ„†µÞ%ó}F•'½€Ânt»ó%½ IÞ_ Jz*+ OøŽ dö¹ Ö„~a ȹ± aº®(¨ |ßÚ" ŒFåØ ŒFå%@ ÈcÄ) àKG 5 RVŽz RVŽâ RVŽé RVŽ+¨ R÷®[ TƒäÍ V½4 šÚ½ «c%€ »s; »s* ÞF¤ ª ^®Ò 4pÄ'ý i!Î ¼ rù+ zkÙ ‰P*Ê àx4&F è]^£=‰+>ä &žôžƒˆ ’rê/åŽUkC'4k£$wÓ>Ãò¬Š!i+êOk&OkAboutDialogBaseSobre o Synergy About SynergyAboutDialogBaseDesconhecidoUnknownAboutDialogBaseVersão:Version:AboutDialogBase<Escolha a ação a ser executadaChoose the action to performActionDialogBaseConfigurar AçãoConfigure ActionActionDialogBase*Travar cursor na telaLock cursor to screenActionDialogBase6Pressione a tecla de atalhoPress a hotkeyActionDialogBaseFPressione e solte a tecla de atalhoPress and release a hotkeyActionDialogBase.Solte a tecla de atalhoRelease a hotkeyActionDialogBaseMude de direçãoSwitch in directionActionDialogBaseMude para telaSwitch to screenActionDialogBase8Essa ação é executada quandoThis action is performed whenActionDialogBase abaixodownActionDialogBaseesquerdaleftActionDialogBasedesligaroffActionDialogBase ligaronActionDialogBase(somente nessas telasonly on these screensActionDialogBasedireitarightActionDialogBase>a tecla de atalho é pressionadathe hotkey is pressedActionDialogBase2a tecla de atalho é soltathe hotkey is releasedActionDialogBasealternartoggleActionDialogBase acimaupActionDialogBaseREntre com a descrição da tecla de atalho:'Enter the specification for the hotkey:HotkeyDialogBaseTecla de atalhoHotkeyHotkeyDialogBase Editar&Edit MainWindowArquivo&File MainWindow Ajuda&Help MainWindow Início&Start MainWindow Parar&Stop MainWindow Janela&Window MainWindowˆ<p>Versão %1 está disponível, <a href="%2">visite o website</a>.</p>C

Version %1 is now available, visit website.

 MainWindowNNão foi possível gravar as configuraçãoCannot write configuration file MainWindowPNome do arquivo de configuração inválidoConfiguration filename invalid MainWindow"Nome do servidor:Hostname is empty MainWindow–Por favor, preencha um nome do servidor para o cliente Synergy se conectar.?Please fill in a hostname for the synergy client to connect to. MainWindow<Programa não pode ser iniciadoProgram can not be started MainWindow:Gravar a configuração como...Save configuration as... MainWindowGravação falhou Save failed MainWindowFCliente Synergy não foi encontrado.Synergy client not found MainWindow2Synergy não esta rodando.Synergy is not running. MainWindow*Synergy foi iniciado.Synergy is starting. MainWindowLServidor do Synergy não foi encontradoSynergy server not found MainWindowÂSynergy fechou inesperadamente retornando o código %1.<br><br>Por favor veja o log para detalhes.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow8Synergy terminou com um erro Synergy terminated with an error MainWindowdO executável para o cliente do synergy não existe.5The executable for the synergy client does not exist. MainWindowfO executável para o servidor do synergy não existe.5The executable for the synergy server does not exist. MainWindow(O executável <br><br>%1<br><br>não pôde ser iniciado com êxito. Por favor, verifique se você tem permissões suficientes para executar este programa.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¼O arquivo temporário de configuração, necessário para iniciar o Synergy, não pode ser gravado.NThe temporary configuration file required to start synergy can not be written. MainWindowDesconhecidoUnknown MainWindowØVocê não preencheu um arquivo de configuração válido para o servidor do Synergy. Você quer procurá-lo agora?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow$Sobre o Synergy...&About Synergy...MainWindowBase0Arquivo de configuração:&Configuration file:MainWindowBase&Configurar servidor&Configure Server...MainWindowBaseSair&QuitMainWindowBase Início&StartMainWindowBase6Configurar interativamente:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase(Editar configurações Edit settingsMainWindowBaseRegistroLogMainWindowBaseSairQuitMainWindowBase ProntoReadyMainWindowBase RodarRunMainWindowBaseMostrar Status S&how StatusMainWindowBase PararS&topMainWindowBaseConfiguraçõesSettingsMainWindowBase PararStopMainWindowBaseSynergySynergyMainWindowBaseDesconhecidoUnknownMainWindowBasedUsar a configuração existente:Use a configuração eUse existing configuration:MainWindowBaseSem nomeUnnamedNewScreenWidget<O nome de exibição está vazio.Screen name is emptyScreenSettingsDialog˜O nome de exibição não pode ser vazio. Por favor preencha o nome ou cancele.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogAdicionar&AddScreenSettingsDialogBaseRemover&RemoveScreenSettingsDialogBaseAltAltScreenSettingsDialogBase"Inferior-esquerdo Bottom-leftScreenSettingsDialogBase Inferior-direito Bottom-rightScreenSettingsDialogBase"Tamanho do Canto: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase.Trava a tecla CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBaseNome da tela: Screen &name:ScreenSettingsDialogBase*Configurações da telaScreen SettingsScreenSettingsDialogBase"Superior-esquerdoTop-leftScreenSettingsDialogBase Superior-direito Top-rightScreenSettingsDialogBase"Inferior-esquerdo &Bottom-leftServerConfigDialogBase8Verificar os clientes a cada&Check clients everyServerConfigDialogBase Editar&EditServerConfigDialogBase Teclas de Atalho&HotkeysServerConfigDialogBaseNovo&NewServerConfigDialogBase Opções&OptionsServerConfigDialogBaseRemover&RemoveServerConfigDialogBase AçõesA&ctionsServerConfigDialogBaseFConfigurações avançadas de servidorAdvanced server settingsServerConfigDialogBase Inferior-direito Bottom-ri&ghtServerConfigDialogBase"Tamanho do Canto: Cor&ner Size:ServerConfigDialogBase EditarE&ditServerConfigDialogBase Teclas de AtalhoHotkeysServerConfigDialogBaseNovoNe&wServerConfigDialogBaseRemoverRe&moveServerConfigDialogBase"Superior-esquerdo To&p-leftServerConfigDialogBase Superior-direito Top-rig&htServerConfigDialogBase:Salvar o arquivo de log em...Save log file to...SettingsDialogAvançado &AdvancedSettingsDialogBaseErroErrorSettingsDialogBaseInfoInfoSettingsDialogBaseNotaNoteSettingsDialogBase Porta:P&ort:SettingsDialogBase"Nome de Exibição: Sc&reen name:SettingsDialogBaseConfiguraçõesSettingsSettingsDialogBase AvisoWarningSettingsDialogBase$Configurar Synergy Setup Synergy SetupWizard$Configurar Synergy Setup SynergySetupWizardBaseDesconhecidoUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_pt-BR.ts0000600000175000017500000013015412006005561021733 0ustar synergysynergy AboutDialogBase About Synergy Sobre o Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Desconhecido Version: Versão: &Ok Ok ActionDialogBase Configure Action Configurar Ação Choose the action to perform Escolha a ação a ser executada Press a hotkey Pressione a tecla de atalho Release a hotkey Solte a tecla de atalho Press and release a hotkey Pressione e solte a tecla de atalho only on these screens somente nessas telas Switch to screen Mude para tela Switch in direction Mude de direção left esquerda right direita up acima down abaixo Lock cursor to screen Travar cursor na tela toggle alternar on ligar off desligar This action is performed when Essa ação é executada quando the hotkey is pressed a tecla de atalho é pressionada the hotkey is released a tecla de atalho é solta HotkeyDialogBase Hotkey Tecla de atalho Enter the specification for the hotkey: Entre com a descrição da tecla de atalho: MainWindow &Start Início &File Arquivo &Edit Editar &Window Janela &Help Ajuda <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Versão %1 está disponível, <a href="%2">visite o website</a>.</p> Program can not be started Programa não pode ser iniciado The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. O executável <br><br>%1<br><br>não pôde ser iniciado com êxito. Por favor, verifique se você tem permissões suficientes para executar este programa. Synergy client not found Cliente Synergy não foi encontrado. The executable for the synergy client does not exist. O executável para o cliente do synergy não existe. Hostname is empty Nome do servidor: Please fill in a hostname for the synergy client to connect to. Por favor, preencha um nome do servidor para o cliente Synergy se conectar. Cannot write configuration file Não foi possível gravar as configuração The temporary configuration file required to start synergy can not be written. O arquivo temporário de configuração, necessário para iniciar o Synergy, não pode ser gravado. Configuration filename invalid Nome do arquivo de configuração inválido You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Você não preencheu um arquivo de configuração válido para o servidor do Synergy. Você quer procurá-lo agora? Synergy server not found Servidor do Synergy não foi encontrado The executable for the synergy server does not exist. O executável para o servidor do synergy não existe. Synergy terminated with an error Synergy terminou com um erro Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy fechou inesperadamente retornando o código %1.<br><br>Por favor veja o log para detalhes. &Stop Parar service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy foi iniciado. Synergy is not running. Synergy não esta rodando. Unknown Desconhecido Browse for a synergys config file Save configuration as... Gravar a configuração como... Save failed Gravação falhou Could not save configuration to file. MainWindowBase Synergy Synergy Screen name: Unknown Desconhecido &Server IP: &Start Início &Server (share this computer's mouse and keyboard): Use existing configuration: Usar a configuração existente:Use a configuração e &Configuration file: Arquivo de configuração: &Browse... Configure interactively: Configurar interativamente: &Configure Server... Configurar servidor &Client (use another computer's keyboard and mouse): Ready Pronto Log Registro &Apply &Elevate IP addresses: &About Synergy... Sobre o Synergy... &Quit Sair Quit Sair Ctrl+Q Ctrl+Q Run Rodar Ctrl+S Ctrl+S S&top Parar Stop Parar Ctrl+T Ctrl+T S&how Status Mostrar Status Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Ctrl+Alt+S Settings Configurações Edit settings Editar configurações Run Wizard NewScreenWidget Unnamed Sem nome QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty O nome de exibição está vazio. The name for a screen can not be empty. Please fill in a name or cancel the dialog. O nome de exibição não pode ser vazio. Por favor preencha o nome ou cancele. ScreenSettingsDialogBase Screen Settings Configurações da tela Screen &name: Nome da tela: A&liases &Add Adicionar &Remove Remover &Modifier keys &Shift: Shift Ctrl Ctrl Alt Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Superior-esquerdo Top-right Superior-direito Bottom-left Inferior-esquerdo Bottom-right Inferior-direito Corner Si&ze: Tamanho do Canto: &Fixes Fix CAPS LOCK key Trava a tecla CAPS LOCK Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys Teclas de Atalho &Hotkeys Teclas de Atalho &New Novo &Edit Editar &Remove Remover A&ctions Ações Ne&w Novo E&dit Editar Re&move Remover Advanced server settings Configurações avançadas de servidor &Switch Switch &after waiting ms Switch on double &tap within &Options Opções &Check clients every Verificar os clientes a cada Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Superior-esquerdo Top-rig&ht Superior-direito &Bottom-left Inferior-esquerdo Bottom-ri&ght Inferior-direito Cor&ner Size: Tamanho do Canto: SettingsDialog Save log file to... Salvar o arquivo de log em... SettingsDialogBase Settings Configurações &Advanced Avançado Sc&reen name: Nome de Exibição: P&ort: Porta: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Erro Warning Aviso Note Nota Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Configurar Synergy Please select an option. SetupWizardBase Setup Synergy Configurar Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown Desconhecido synergy-1.4.12-Source/src/gui/res/lang/gui_pt-PT.qm0000600000175000017500000005132212006005561021741 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBX^eÀT+[H4*SW8Y¾åuÆ+§¤'ª´Ç2Ö«Œ+|ÏC†G×;JVE-‰V¥DrŒ‚«`"ƒ¶Þ¿+Ôò*»l*»2C*Ð%ž*ì0Ô+Œ3+«` 9GË:¸J¹·B’L™bCRUÛ` ³X·¹±YïÔ.‚xýôøÁx.Æä ›ëØ>7 ó˜ö}S f;NA¾u>Ã(Z = îýnbj#.°¯4º¾þEÒÉžþ/ƒEv._þ%beë;Ũw9$ª¸ú'ï­Ã(º¨” º¨”+˜†;H}ûH¦”/!O éF-O éGÈ]àD ÂVE 3¸Ó.iC@ÒUN™+µYu:CÅl_” Û}× #åŠ*Ä>lšl®”¨öé1p«Žø«E«z«¯«›¡BЫ›¢C° Î7ÚÄ:Ó(.Ä:Ó1ãäöž Zç¹Ô@3ñ$ZAfö±É#"QJƒ-izD³Ë@d*Q攄 (ÿGk( nÇ4.d.¾@Ty,'{ã3€¡ªcœ6>!ažŽÄpÎzdÎç>•éJžBLëêž] £3ä=ñTºk@d1 ‚ï çŠÁ„¨µÞ%ãC(Ù/lYFþ}F•;ƒ€ÂnvŸC>Ï»ó4÷¸‰$¥ Öj¢ IÞ_& JzDî kö#6= v®~9à ”= -5 OøŽ&˜ P¢n<¦ dö¹& ~5ÓîH aº®?_ |ßÚ-Æ ŒFå): ŒFå3P žýZ)~ ® ¸3’ ÈcÄ?ñ àKG i RVŽ€ RVŽè RVŽ"ì RVŽM R÷®9 Tƒä#ª V½40 šÚà «c3Ö »s"D »sE< Äcþ=ƒ ÞF¤*· ^®î /ó)À 4pÄ> dÙ- i!Î Ž rù- zkÙ+ ‰PE àx44˜ è]^ ^E·=‰/>ä 5ßôžƒÏ ’rò/åŽÎ7å,–kC:øk£2®ú.4þÓ>§ò¬Š+ýùF~iM`&Ok&OkAboutDialogBase"Acerca de Synergy About SynergyAboutDialogBaseDesconhecidoUnknownAboutDialogBase VersãoVersion:AboutDialogBase:Seleccionar a ação a executarChoose the action to performActionDialogBaseDefinir a açãoConfigure ActionActionDialogBase.Manter o cursor no ecrãLock cursor to screenActionDialogBase<Pressionar uma tecla de atalhoPress a hotkeyActionDialogBaseNPressionar e largar uma tecla de atalhoPress and release a hotkeyActionDialogBase4Largar uma tecla de atalhoRelease a hotkeyActionDialogBase"Mudar na direcçãoSwitch in directionActionDialogBase"Mudar para o ecrãSwitch to screenActionDialogBase8Esta ação é executada quandoThis action is performed whenActionDialogBase baixodownActionDialogBaseesquerdaleftActionDialogBasedesligadooffActionDialogBase ligadoonActionDialogBase&apenas nestes ecrãsonly on these screensActionDialogBasedireitarightActionDialogBase>a tecla de atalho é pressionadathe hotkey is pressedActionDialogBase6a tecla de atalho é largadathe hotkey is releasedActionDialogBasealternartoggleActionDialogBasecimaupActionDialogBaseTColoque a descrição para a tecla de atalho'Enter the specification for the hotkey:HotkeyDialogBaseTecla de atalhoHotkeyHotkeyDialogBase&Editar&Edit MainWindow&Ficheiro&File MainWindow &Ajuda&Help MainWindow&Iniciar&Start MainWindow &Parar&Stop MainWindow Janela&Window MainWindow’<p>A versão %1 já está disponivel, <a href="%2">visite a website</a>.</p>C

Version %1 is now available, visit website.

 MainWindowdSeleccionar um ficheiro de configuração de synergy!Browse for a synergys config file MainWindowjNão foi possivel escrever no ficheiro de configuraçãoCannot write configuration file MainWindowBFicheiro de configuração inválidoConfiguration filename invalid MainWindowpNão foi possível guardar a configuração para o ficheiro.%Could not save configuration to file. MainWindowPO nome de computador não está preenchidoHostname is empty MainWindowšPor favor coloque o nome de computador ao qual o cliente Synergy vai ligar-se?Please fill in a hostname for the synergy client to connect to. MainWindow>O programa não consegue iniciarProgram can not be started MainWindow<Guardar a configuração como...Save configuration as... MainWindow Falhou o registo Save failed MainWindowHO cliente Synergy não foi encontradoSynergy client not found MainWindow8Synergy não está em execuçãoSynergy is not running. MainWindow,Synergy está a iniciarSynergy is starting. MainWindowPO servidor de synergy não foi encontradoSynergy server not found MainWindowàSynergy terminou inesperadamente com o erro %1.<br><br>Por favor, verifique o registo de log para mais detalhes.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow2Synergy terminou com erro Synergy terminated with an error MainWindowZO executável de cliente de Synergy não existe5The executable for the synergy client does not exist. MainWindow^O executável de servidor de synergy não existe.5The executable for the synergy server does not exist. MainWindowO programa<br><br>%1<br><br>, embora exista, não teve êxito a iniciar. Por favor, verifique se tem permissões suficientes para o executar.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindowæNão foi possível escrever no ficheiro temporário de configuração de synergy, o qual é indispensável para o iniciar.NThe temporary configuration file required to start synergy can not be written. MainWindowDesconhecidoUnknown MainWindowNão colocaste um ficheiro de configuração válido para o servidor de synergy. Queres seleccionar o ficheiro de configuração agora?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow*&Acerca de Synergy...&About Synergy...MainWindowBase&Aplicar&ApplyMainWindowBase&Explorar... &Browse...MainWindowBasej&Cliente (usar o teclado e rato de outro computador):4&Client (use another computer's keyboard and mouse):MainWindowBase4Ficheiro de &configuração:&Configuration file:MainWindowBase.&Configurar Servidor...&Configure Server...MainWindowBase &Sair&QuitMainWindowBasep&Servidor (partilhar o rato e teclado deste computador):3&Server (share this computer's mouse and keyboard):MainWindowBase&Iniciar&StartMainWindowBase0Configuração interativa:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase$Alterar definições Edit settingsMainWindowBase$Registo de eventosLogMainWindowBaseSairQuitMainWindowBase ProntoReadyMainWindowBaseExecutarRunMainWindowBaseUsar assistente Run WizardMainWindowBaseM&ostrar Estado S&how StatusMainWindowBase &PararS&topMainWindowBase>Guardar a configuração &como...Save configuration &as...MainWindowBase€Guardar a configuração gerada interactivamente para um ficheiro.@Save the interactively generated server configuration to a file.MainWindowBaseDefiniçõesSettingsMainWindowBase PararStopMainWindowBaseSynergySynergyMainWindowBaseDesconhecidoUnknownMainWindowBase>Usar uma configuração guardada:Use existing configuration:MainWindowBaseSem nomeUnnamedNewScreenWidgettConfiguração de synergy (*.conf);;Todos os ficheiros (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectrConfiguração de synergy (*.sgc);;Todos os ficheiros (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectzA área de notificação não está disponivel disponivel, saindo.%System tray is unavailable, quitting.QObject>O nome do ecrã não foi definidoScreen name is emptyScreenSettingsDialog–O nome de ecrã não pode ficar vazio. Por favor, coloque um nome ou cancele.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog&Adicionar&AddScreenSettingsDialogBase &Ctrl:&Ctrl:ScreenSettingsDialogBase(&Cantos inacessíveis &Dead cornersScreenSettingsDialogBaseCo&rrecções&FixesScreenSettingsDialogBase&Teclas de modulação&Modifier keysScreenSettingsDialogBase&Remover&RemoveScreenSettingsDialogBase&Shift:&Shift:ScreenSettingsDialogBase&Nomes al&ternativosA&liasesScreenSettingsDialogBaseAltAltScreenSettingsDialogBase.Canto inferior esquerdo Bottom-leftScreenSettingsDialogBase,Canto inferior direito Bottom-rightScreenSettingsDialogBase&Di&mensão do canto: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase4Corrigir a tecla CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase2Corrigir a tecla NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase8Corrigir a tecla SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBase8Corrigir XTest para XineramaFix XTest for XineramaScreenSettingsDialogBase NenhumNoneScreenSettingsDialogBase&Nome do ecrã: Screen &name:ScreenSettingsDialogBase*Configurações de ecrãScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase.Canto superior esquerdoTop-leftScreenSettingsDialogBase,Canto superior direito Top-rightScreenSettingsDialogBaseò<center>Ecrã: <b>%1</b></center><br>duplo clique para alterar as definições<br>Arrastar o ecrã para o lixo para o removero
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel0Canto &inferior esquerdo &Bottom-leftServerConfigDialogBase4&Verificar clientes a cada&Check clients everyServerConfigDialogBase(&Cantos inacessíveis &Dead cornersServerConfigDialogBase&Editar&EditServerConfigDialogBase"&Teclas de atalho&HotkeysServerConfigDialogBase &Novo&NewServerConfigDialogBase&Opções&OptionsServerConfigDialogBase&Remover&RemoveServerConfigDialogBase&Alternar&SwitchServerConfigDialogBase &AçõesA&ctionsServerConfigDialogBase@Definições avançadas do servidorAdvanced server settingsServerConfigDialogBase.Canto inferior direit&o Bottom-ri&ghtServerConfigDialogBase|Configurar a disposição na configuração do servidor de synergy:Configure the layout of your synergy server configuration.ServerConfigDialogBase&Dimensão do Ca&nto: Cor&ner Size:ServerConfigDialogBaserNão tirar o &foco da janela activa nos servidores Windows0Don't take &foreground window on Windows serversServerConfigDialogBaselArrastar um ecrã da grelha para o lixo para o remover.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaseFArrastar novos ecrãs para a grelha ou mover os existentes. Arrastar um ecrã para o lixo para o remover. Faça duplo clique num ecrã para alterar as suas definições.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBase|Arrastar este botão para a grelha para adicionar um novo ecrã.1Drag this button to the grid to add a new screen.ServerConfigDialogBase&AlterarE&ditServerConfigDialogBase Teclas de atalhoHotkeysServerConfigDialogBase No&voNe&wServerConfigDialogBaseRe&moverRe&moveServerConfigDialogBase@S&incronizar protectores de ecrãS&ynchronize screen saversServerConfigDialogBase Ecrãs e ligaçõesScreens and linksServerConfigDialogBase0Configuração do servidorServer ConfigurationServerConfigDialogBase.Alternar &após aguardarSwitch &after waitingServerConfigDialogBase>Alternar ao tocar duas vezes emSwitch on double &tap withinServerConfigDialogBase0Canto su&perior esquerdo To&p-leftServerConfigDialogBase.Canto superior &direito Top-rig&htServerConfigDialogBaseLUtilizar movimentos &relativos do ratoUse &relative mouse movesServerConfigDialogBase\Guardar ficheiro de registo de eventos para...Save log file to...SettingsDialog&Avançado &AdvancedSettingsDialogBaseVIniciar &automaticamente o servidor/cliente"&Automatically start server/clientSettingsDialogBaseNNão mostrar servidor/cliente ao iniciar&Hide when server/client startsSettingsDialogBase"&Nivel de registo&Logging level:SettingsDialogBaseH&Iniciar Synergy após iniciar sessão&Start Synergy after logging inSettingsDialogBaseExplorar... Browse...SettingsDialogBaseDepuraçãoDebugSettingsDialogBaseDepuração1Debug1SettingsDialogBaseDepuração2Debug2SettingsDialogBaseErroErrorSettingsDialogBaseInformaçãoInfoSettingsDialogBase(Ficheiro de registo: Log to file:SettingsDialogBase$Registo de eventosLoggingSettingsDialogBaseNotificaçãoNoteSettingsDialogBaseP&orto:P&ort:SettingsDialogBaseNome do ecrã: Sc&reen name:SettingsDialogBaseDefiniçõesSettingsSettingsDialogBase AvisoWarningSettingsDialogBase>Por favor selecciona uma opção.Please select an option. SetupWizard$Configurar Synergy Setup Synergy SetupWizardF&Cliente (adicionar à configuração)&Client (add to setup)SetupWizardBase6&Servidor (nova instalação)&Server (new setup)SetupWizardBase(Servidor ou Cliente?Server or Client?SetupWizardBase$Configurar Synergy Setup SynergySetupWizardBaseÜEste é o primeiro computador que configuras. O teclado e rato que serão partilhados estão ligados neste computador. Isto vai permitir que movas o rato para o ecrã de outro computador. Só pode estar um computador configurado como servidor.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBasehJá configuraste um servidor. Este computador vai ser controlado pelo rato e teclado do computador configurado como servidor. Podem ser colocados vários clientes nesta configuração.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseDesconhecidoUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_pt-PT.ts0000600000175000017500000013520212006005561021752 0ustar synergysynergy AboutDialogBase About Synergy Acerca de Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Desconhecido Version: Versão &Ok &Ok ActionDialogBase Configure Action Definir a ação Choose the action to perform Seleccionar a ação a executar Press a hotkey Pressionar uma tecla de atalho Release a hotkey Largar uma tecla de atalho Press and release a hotkey Pressionar e largar uma tecla de atalho only on these screens apenas nestes ecrãs Switch to screen Mudar para o ecrã Switch in direction Mudar na direcção left esquerda right direita up cima down baixo Lock cursor to screen Manter o cursor no ecrã toggle alternar on ligado off desligado This action is performed when Esta ação é executada quando the hotkey is pressed a tecla de atalho é pressionada the hotkey is released a tecla de atalho é largada HotkeyDialogBase Hotkey Tecla de atalho Enter the specification for the hotkey: Coloque a descrição para a tecla de atalho MainWindow &Start &Iniciar &File &Ficheiro &Edit &Editar &Window Janela &Help &Ajuda <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>A versão %1 já está disponivel, <a href="%2">visite a website</a>.</p> Program can not be started O programa não consegue iniciar The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. O programa<br><br>%1<br><br>, embora exista, não teve êxito a iniciar. Por favor, verifique se tem permissões suficientes para o executar. Synergy client not found O cliente Synergy não foi encontrado The executable for the synergy client does not exist. O executável de cliente de Synergy não existe Hostname is empty O nome de computador não está preenchido Please fill in a hostname for the synergy client to connect to. Por favor coloque o nome de computador ao qual o cliente Synergy vai ligar-se Cannot write configuration file Não foi possivel escrever no ficheiro de configuração The temporary configuration file required to start synergy can not be written. Não foi possível escrever no ficheiro temporário de configuração de synergy, o qual é indispensável para o iniciar. Configuration filename invalid Ficheiro de configuração inválido You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Não colocaste um ficheiro de configuração válido para o servidor de synergy. Queres seleccionar o ficheiro de configuração agora? Synergy server not found O servidor de synergy não foi encontrado The executable for the synergy server does not exist. O executável de servidor de synergy não existe. Synergy terminated with an error Synergy terminou com erro Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy terminou inesperadamente com o erro %1.<br><br>Por favor, verifique o registo de log para mais detalhes. &Stop &Parar service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy está a iniciar Synergy is not running. Synergy não está em execução Unknown Desconhecido Browse for a synergys config file Seleccionar um ficheiro de configuração de synergy Save configuration as... Guardar a configuração como... Save failed Falhou o registo Could not save configuration to file. Não foi possível guardar a configuração para o ficheiro. MainWindowBase Synergy Synergy Screen name: Unknown Desconhecido &Server IP: &Start &Iniciar &Server (share this computer's mouse and keyboard): &Servidor (partilhar o rato e teclado deste computador): Use existing configuration: Usar uma configuração guardada: &Configuration file: Ficheiro de &configuração: &Browse... &Explorar... Configure interactively: Configuração interativa: &Configure Server... &Configurar Servidor... &Client (use another computer's keyboard and mouse): &Cliente (usar o teclado e rato de outro computador): Ready Pronto Log Registo de eventos &Apply &Aplicar &Elevate IP addresses: &About Synergy... &Acerca de Synergy... &Quit &Sair Quit Sair Ctrl+Q Ctrl+Q Run Executar Ctrl+S Ctrl+S S&top &Parar Stop Parar Ctrl+T Ctrl+T S&how Status M&ostrar Estado Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Guardar a configuração &como... Save the interactively generated server configuration to a file. Guardar a configuração gerada interactivamente para um ficheiro. Ctrl+Alt+S Ctrl+Alt+S Settings Definições Edit settings Alterar definições Run Wizard Usar assistente NewScreenWidget Unnamed Sem nome QObject Synergy Configurations (*.sgc);;All files (*.*) Configuração de synergy (*.sgc);;Todos os ficheiros (*.*) Synergy Configurations (*.conf);;All files (*.*) Configuração de synergy (*.conf);;Todos os ficheiros (*.*) System tray is unavailable, quitting. A área de notificação não está disponivel disponivel, saindo. ScreenSettingsDialog Screen name is empty O nome do ecrã não foi definido The name for a screen can not be empty. Please fill in a name or cancel the dialog. O nome de ecrã não pode ficar vazio. Por favor, coloque um nome ou cancele. ScreenSettingsDialogBase Screen Settings Configurações de ecrã Screen &name: &Nome do ecrã: A&liases Nomes al&ternativos &Add &Adicionar &Remove &Remover &Modifier keys Teclas de modulação &Shift: &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Super None Nenhum &Ctrl: &Ctrl: Al&t: M&eta: S&uper: &Dead corners &Cantos inacessíveis Top-left Canto superior esquerdo Top-right Canto superior direito Bottom-left Canto inferior esquerdo Bottom-right Canto inferior direito Corner Si&ze: Di&mensão do canto: &Fixes Co&rrecções Fix CAPS LOCK key Corrigir a tecla CAPS LOCK Fix NUM LOCK key Corrigir a tecla NUM LOCK Fix SCROLL LOCK key Corrigir a tecla SCROLL LOCK Fix XTest for Xinerama Corrigir XTest para Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Ecrã: <b>%1</b></center><br>duplo clique para alterar as definições<br>Arrastar o ecrã para o lixo para o remover ServerConfigDialogBase Server Configuration Configuração do servidor Screens and links Ecrãs e ligações Drag a screen from the grid to the trashcan to remove it. Arrastar um ecrã da grelha para o lixo para o remover. Configure the layout of your synergy server configuration. Configurar a disposição na configuração do servidor de synergy Drag this button to the grid to add a new screen. Arrastar este botão para a grelha para adicionar um novo ecrã. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Arrastar novos ecrãs para a grelha ou mover os existentes. Arrastar um ecrã para o lixo para o remover. Faça duplo clique num ecrã para alterar as suas definições. Hotkeys Teclas de atalho &Hotkeys &Teclas de atalho &New &Novo &Edit &Editar &Remove &Remover A&ctions &Ações Ne&w No&vo E&dit &Alterar Re&move Re&mover Advanced server settings Definições avançadas do servidor &Switch &Alternar Switch &after waiting Alternar &após aguardar ms Switch on double &tap within Alternar ao tocar duas vezes em &Options &Opções &Check clients every &Verificar clientes a cada Use &relative mouse moves Utilizar movimentos &relativos do rato S&ynchronize screen savers S&incronizar protectores de ecrã Don't take &foreground window on Windows servers Não tirar o &foco da janela activa nos servidores Windows &Dead corners &Cantos inacessíveis To&p-left Canto su&perior esquerdo Top-rig&ht Canto superior &direito &Bottom-left Canto &inferior esquerdo Bottom-ri&ght Canto inferior direit&o Cor&ner Size: Dimensão do Ca&nto: SettingsDialog Save log file to... Guardar ficheiro de registo de eventos para... SettingsDialogBase Settings Definições &Advanced &Avançado Sc&reen name: Nome do ecrã: P&ort: P&orto: &Interface: &Start Synergy after logging in &Iniciar Synergy após iniciar sessão &Automatically start server/client Iniciar &automaticamente o servidor/cliente &Hide when server/client starts Não mostrar servidor/cliente ao iniciar Logging Registo de eventos &Process mode: Service Desktop (legacy) &Logging level: &Nivel de registo Log to file: Ficheiro de registo: Browse... Explorar... Error Erro Warning Aviso Note Notificação Info Informação Debug Depuração Debug1 Depuração1 Debug2 Depuração2 &Startup SetupWizard Setup Synergy Configurar Synergy Please select an option. Por favor selecciona uma opção. SetupWizardBase Setup Synergy Configurar Synergy Server or Client? Servidor ou Cliente? &Server (new setup) &Servidor (nova instalação) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Este é o primeiro computador que configuras. O teclado e rato que serão partilhados estão ligados neste computador. Isto vai permitir que movas o rato para o ecrã de outro computador. Só pode estar um computador configurado como servidor. &Client (add to setup) &Cliente (adicionar à configuração) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Já configuraste um servidor. Este computador vai ser controlado pelo rato e teclado do computador configurado como servidor. Podem ser colocados vários clientes nesta configuração. VersionChecker Unknown Desconhecido synergy-1.4.12-Source/src/gui/res/lang/gui_ro.qm0000600000175000017500000005144312006005561021421 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC?u^]ÀH+[H4)ÿSWY¾£uÆ#§¤'8´Ç3\«Œ+0ÏC¹<¡-ˆG×;|VE-ÁV¥DŒ@«`"9¶Þ¿+Ôî*»X*»2©*Ð% *ì0ä+Œã+«` kGË:òGíz)±J¹·BÇL™bCUÛ` sX·¹sYïÔ.ôZÆÂ/0xýôôÁx.|ä ÷ëØ>78óö}S (;NBu>£(Z @= înbj"Þ°¯4ôº¾þ7ÒÉœþ0Ev.ñ_þ$úeë;ñ¨w9Òª¸ú'‰­Ã(0º¨” (º¨”û˜¤;H}÷H¦”/µO éF$O éG·]àDEÂVE ›¸Ó.šiC@áUN™+iYu:Cøl_” +}× #•Š*Ä>”šl®ˆ¨öé1æ«Žøî«#«X««›¡C«›¢CB° Î8$Ä:Ó'ÚÄ:Ó2Uäöž ªç¹Ô@\ñ$ZA³ö±ÉüÊJ-K"QJu-izD´Ë@d*5Ül .攄Ù(ÿG^( nÑ4.d/l@Ty+Ý{ã3‘€¡ªœ6>!žŽÄ‚ÎzBÎç>‹éJžBëêž £3Â=ñTÈk@d1›‚ï £ŠÁ„œµÞ%ãC(s/lYFõ}F•;±€ÂnzŸC>ß»ó4¥÷¸‰$I ÖjN IÞ_Ô JzDë kö#6y v®~:" ”=C -5 ÷ OøŽ& P¢n<Ô dö¹%— ~5ÓîH aº®?¦ |ßÚ.D ŒFå(Ö ŒFå3Ò žýZ), ® ¸4& ÈcÄ@ àKG « RVŽz RVŽš RVŽ"  RVŽM- R÷®C Tƒä#^ V½4, šÚ¹ §|*Am «c4d »s" »sE5 Äcþ=· ÞF¤* ^®ä /ó)l 4pÄ>L dÙ,È i!Î š rù+ zkÙ! ‰PEp àx45 è]^o ^E´=‰A>ä 6%ôžƒ­ ’rÈ/厀7å,NkC;2k£2ý®ú.5bÓ>Ÿò¬Š*ÐýùFwiMkOk&OkAboutDialogBaseSobre o Synergy About SynergyAboutDialogBaseNecunoscutUnknownAboutDialogBaseVersiune:Version:AboutDialogBaseBAlege aciunea pentru a o efectuaChoose the action to performActionDialogBase"Confirm AciuneaConfigure ActionActionDialogBase6Blocheaz cursorul la ecranLock cursor to screenActionDialogBase(Apas o tast rapidPress a hotkeyActionDialogBaseFApsaci _i eliberaci o tast rapidPress and release a hotkeyActionDialogBase2Elibereaz o tast rapidRelease a hotkeyActionDialogBase$Comut în direciaSwitch in directionActionDialogBaseComut la ecranSwitch to screenActionDialogBaseFAceast aciune este executat cândThis action is performed whenActionDialogBasejosdownActionDialogBase stângaleftActionDialogBaseDesligadooffActionDialogBase LigadoonActionDialogBase*doar pe aceste ecraneonly on these screensActionDialogBasedreaptarightActionDialogBase6o tast rapid este apsatthe hotkey is pressedActionDialogBase:o tast rapid este eliberatthe hotkey is releasedActionDialogBase comuttoggleActionDialogBasesusupActionDialogBaseRIntrodu specificaie pentru tasta rapid:'Enter the specification for the hotkey:HotkeyDialogBase Tast rapidHotkeyHotkeyDialogBase$&undefinedEditeaz&Edit MainWindow &undefinedFiier&File MainWindow &undefinedAjutor&Help MainWindow&undefinedStart&Start MainWindow&undefinedStop&Stop MainWindow&&undefinedFereastr&Window MainWindowž<p>Versionea %1 este disponibil acuma, <a href="%2">viziteaz website</a>.</p>C

Version %1 is now available, visit website.

 MainWindowdRsfoici pentru un fi_ierul de configurare synergy!Browse for a synergys config file MainWindowRFiierul de configurare nu poate fi scrisCannot write configuration file MainWindowBArquivo de configuração inválido.Configuration filename invalid MainWindowRNu sa putut salva configuraia în fiier.%Could not save configuration to file. MainWindow*Numele gazd este golHostname is empty MainWindow¬Te rog s complectezi numele de gazda pentru clientul synergy la care s te conectezi.?Please fill in a hostname for the synergy client to connect to. MainWindow8Programul nu poate fi pornitProgram can not be started MainWindow6Salveaz configuraia ca...Save configuration as... MainWindowSalvare euat Save failed MainWindowDClientul Synergy nu poate fi gsitSynergy client not found MainWindow&Synergy nu ruleaz.Synergy is not running. MainWindow"Synergy pornete.Synergy is starting. MainWindowDClientul Synergy nu poate fi gsitSynergy server not found MainWindowÔSynergy a terminat în mod nea_teptat cu un cod %1.<br><br>V rugm s consultaci jurnalul pentru detalii.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow8Synergy terminou com um erro Synergy terminated with an error MainWindow^Executabilul pentru clientul synergy nu exist.5The executable for the synergy client does not exist. MainWindow^Executabilul pentru clientul synergy nu exist.5The executable for the synergy server does not exist. MainWindow*Executabilul<br><br>%1<br><br>nu a putut fi pornit cu succes, dei exist. Te rog verific dac ai suficiente permisiuni pentru a rula acest program.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¢Fiierul de configurare temporar necesar pentru a porni Synergy nu poate fi scrisNThe temporary configuration file required to start synergy can not be written. MainWindowNecunoscutUnknown MainWindow Nu ati completat un fi_ier de configurare valabil pentru serverul synergy. Dorici s rsfoici pentru un fi_ierul de configurare acum?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow"Despre Synergy...&About Synergy...MainWindowBase Aplic&ApplyMainWindowBaseRsfoiete... &Browse...MainWindowBasexClient (folosete mouse-ul i tastatura a altui calculator):4&Client (use another computer's keyboard and mouse):MainWindowBase,Fiier de configurare:&Configuration file:MainWindowBase,Configureaz Server...&Configure Server...MainWindowBase &undefinedIeire&QuitMainWindowBasezServer (partajeaz mouse-ul i tastatura acestui calculator):3&Server (share this computer's mouse and keyboard):MainWindowBase&undefinedStart&StartMainWindowBase0Configurare interactiv:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase"Editeaz setrile Edit settingsMainWindowBaseLogLogMainWindowBase IeireQuitMainWindowBaseGataReadyMainWindowBasePorneteRunMainWindowBase"Pornete Expertul Run WizardMainWindowBaseArat Statutul S&how StatusMainWindowBaseStopS&topMainWindowBase6Salveaz configuraia ca...Save configuration &as...MainWindowBaseŠSalvaci configuracia generat interactiv a serverului într-un fi_ier.@Save the interactively generated server configuration to a file.MainWindowBase SetriSettingsMainWindowBaseStopStopMainWindowBaseSynergySynergyMainWindowBaseNecunoscutUnknownMainWindowBaseBFolosete configuraie existent:Use existing configuration:MainWindowBase AnonimUnnamedNewScreenWidgethConfiguraii Synergy (*.conf);;Toate Fiierele (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectfConfiguraii Synergy (*.sgc);;Toate Fiierele (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject\Bara de sistem nu este disponibil, renunai.%System tray is unavailable, quitting.QObject2Numele de ecran este gol.Screen name is emptyScreenSettingsDialog¶Numele pentru ecran nu poate fii gol. V rugm introducei un nume sau închidei fereastra.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog &undefinedAdaug&AddScreenSettingsDialogBase&undefinedCtrl:&Ctrl:ScreenSettingsDialogBaseColuri moarte &Dead cornersScreenSettingsDialogBaseCorecii&FixesScreenSettingsDialogBase(Modificator de taste&Modifier keysScreenSettingsDialogBase"&undefinedElimin&RemoveScreenSettingsDialogBase Shift:&Shift:ScreenSettingsDialogBaseAliasuriA&liasesScreenSettingsDialogBase&undefinedl&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseStânga-jos Bottom-leftScreenSettingsDialogBaseDreapta-jos Bottom-rightScreenSettingsDialogBase&Mrimea colurilor: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase6Corectreaz tasta CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase4Corectreaz tasta NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase:Corectreaz tasta SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBase@Corecteaz XTest pentru XineramaFix XTest for XineramaScreenSettingsDialogBase Meta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNici unulNoneScreenSettingsDialogBase Super:S&uper:ScreenSettingsDialogBaseNume de ecran. Screen &name:ScreenSettingsDialogBaseSetri de ecranScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBaseStânga-susTop-leftScreenSettingsDialogBaseDreapta-sus Top-rightScreenSettingsDialogBase<center>Ecran: <b>%1</b></center><br>Dublu click pentru editare de setri<br>Glisai ecranul ctre coul de gunoi pentru al eliminao
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModelStânga-jos &Bottom-leftServerConfigDialogBase0Verific clieni fiecare&Check clients everyServerConfigDialogBaseColuri moarte &Dead cornersServerConfigDialogBase$&undefinedEditeaz&EditServerConfigDialogBase,&undefinedTaste rapide&HotkeysServerConfigDialogBaseNou&NewServerConfigDialogBaseOpiuni&OptionsServerConfigDialogBase"&undefinedElimin&RemoveServerConfigDialogBase Comut&SwitchServerConfigDialogBaseAciuniA&ctionsServerConfigDialogBase,Setari avansate serverAdvanced server settingsServerConfigDialogBaseDreapta-jos Bottom-ri&ghtServerConfigDialogBase^Configurai aspectul serverului vostru synergy.:Configure the layout of your synergy server configuration.ServerConfigDialogBaseMrime coluri Cor&ner Size:ServerConfigDialogBasedNu luaci fereastre de prim-plan pe servere Windows0Don't take &foreground window on Windows serversServerConfigDialogBaseˆGlisai un ecran de pe gril ctre coul de gunoi pentru al elimina.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase>Glisai ecrane noi pe gril sau mut cele existente. Glisai un ecran ctre coul de gunoi pentru al elimina. Click dublu pe un ecran pentru ai edita setrile.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasetGlisai acest buton pe gril pentru a aduga un nou ecran.1Drag this button to the grid to add a new screen.ServerConfigDialogBaseEditeazE&ditServerConfigDialogBaseTaste rapideHotkeysServerConfigDialogBaseNouNe&wServerConfigDialogBaseEliminRe&moveServerConfigDialogBase>Sincronizare protector de ecranS&ynchronize screen saversServerConfigDialogBase$Ecrane i legturiScreens and linksServerConfigDialogBase0Configurrile ServeruluiServer ConfigurationServerConfigDialogBase4Comut dup o ateptare deSwitch &after waitingServerConfigDialogBaseNSchimb la atingere dubla în interiorulSwitch on double &tap withinServerConfigDialogBaseStânga-sus To&p-leftServerConfigDialogBaseDreapta-sus Top-rig&htServerConfigDialogBaseRFolosete micri relative ale mouse-uluiUse &relative mouse movesServerConfigDialogBasemsmsServerConfigDialogBaseBSalveaz fiier jurnal pentru ...Save log file to...SettingsDialogAvansat &AdvancedSettingsDialogBase<Pornete automat server/client"&Automatically start server/clientSettingsDialogBaseFAscunde când server/client pornete&Hide when server/client startsSettingsDialogBaseInterfa: &Interface:SettingsDialogBaseNivel logging&Logging level:SettingsDialogBase8Pornete Synergy dup logare&Start Synergy after logging inSettingsDialogBaseRsfoiete: Browse...SettingsDialogBaseDepanareDebugSettingsDialogBaseDepanare1Debug1SettingsDialogBaseDepanare2Debug2SettingsDialogBase EroareErrorSettingsDialogBaseInformaciiInfoSettingsDialogBaseLog în fiier Log to file:SettingsDialogBaseLoggingLoggingSettingsDialogBaseNotNoteSettingsDialogBase Port:P&ort:SettingsDialogBaseNume ecran: Sc&reen name:SettingsDialogBase SetriSettingsSettingsDialogBaseAvertismentWarningSettingsDialogBase8Te rog selecteaz o opiune.Please select an option. SetupWizard&Configurare Synergy Setup Synergy SetupWizardDClient (adaug pentru a configura)&Client (add to setup)SetupWizardBase2Server (configurare nou)&Server (new setup)SetupWizardBase$Server sau Client?Server or Client?SetupWizardBase&Configurare Synergy Setup SynergySetupWizardBaseôAcesta este primul computer pe care îl configurai. Tastatura _i mouse-ul sunt conectate la acest computer. Acest lucru va permite s v mutaci mouse-ul pe la un alt ecran a altui calculator. Nu poate fi decât un server în configuracia dumneavoastr.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBasenAci stabilit deja un server. Acesta este un calculator pe care dorici s controlaci folosind tastatura _i mouse-ul serverului. Pot fii mai muli clienti in configurarea dumneavoastr.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseNecunoscutUnknownVersionCheckerˆ ÿþ$synergy-1.4.12-Source/src/gui/res/lang/gui_ro.ts0000600000175000017500000013453612006005561021437 0ustar synergysynergy AboutDialogBase About Synergy Sobre o Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Necunoscut Version: Versiune: &Ok Ok ActionDialogBase Configure Action Confirmă AcÈ›iunea Choose the action to perform Alege acÈ›iunea pentru a o efectua Press a hotkey Apasă o tastă rapidă Release a hotkey Eliberează o tastă rapidă Press and release a hotkey ApăsaÅ£i ÅŸi eliberaÅ£i o tastă rapidă only on these screens doar pe aceste ecrane Switch to screen Comută la ecran Switch in direction Comută în direcÈ›ia left stânga right dreapta up sus down jos Lock cursor to screen Blochează cursorul la ecran toggle comută on Ligado off Desligado This action is performed when Această acÈ›iune este executată când the hotkey is pressed o tastă rapidă este apăsată the hotkey is released o tastă rapidă este eliberată HotkeyDialogBase Hotkey Tastă rapidă Enter the specification for the hotkey: Introdu specificaÈ›ie pentru tasta rapidă: MainWindow &Start &undefinedStart &File &undefinedFiÈ™ier &Edit &undefinedEditează &Window &undefinedFereastră &Help &undefinedAjutor <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Versionea %1 este disponibilă acuma, <a href="%2">vizitează website</a>.</p> Program can not be started Programul nu poate fi pornit The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Executabilul<br><br>%1<br><br>nu a putut fi pornit cu succes, deÈ™i există. Te rog verifică dacă ai suficiente permisiuni pentru a rula acest program. Synergy client not found Clientul Synergy nu poate fi găsit The executable for the synergy client does not exist. Executabilul pentru clientul synergy nu există. Hostname is empty Numele gazdă este gol Please fill in a hostname for the synergy client to connect to. Te rog să complectezi numele de gazda pentru clientul synergy la care să te conectezi. Cannot write configuration file FiÈ™ierul de configurare nu poate fi scris The temporary configuration file required to start synergy can not be written. FiÈ™ierul de configurare temporar necesar pentru a porni Synergy nu poate fi scris Configuration filename invalid Arquivo de configuração inválido. You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Nu ati completat un fiÅŸier de configurare valabil pentru serverul synergy. DoriÅ£i să răsfoiÅ£i pentru un fiÅŸierul de configurare acum? Synergy server not found Clientul Synergy nu poate fi găsit The executable for the synergy server does not exist. Executabilul pentru clientul synergy nu există. Synergy terminated with an error Synergy terminou com um erro Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy a terminat în mod neaÅŸteptat cu un cod %1.<br><br>Vă rugăm să consultaÅ£i jurnalul pentru detalii. &Stop &undefinedStop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy porneÈ™te. Synergy is not running. Synergy nu rulează. Unknown Necunoscut Browse for a synergys config file RăsfoiÅ£i pentru un fiÅŸierul de configurare synergy Save configuration as... Salvează configuraÈ›ia ca... Save failed Salvare eÈ™uată Could not save configuration to file. Nu sa putut salva configuraÈ›ia în fiÈ™ier. MainWindowBase Synergy Synergy Screen name: Unknown Necunoscut &Server IP: &Start &undefinedStart &Server (share this computer's mouse and keyboard): Server (partajează mouse-ul È™i tastatura acestui calculator): Use existing configuration: FoloseÈ™te configuraÈ›ie existentă: &Configuration file: FiÈ™ier de configurare: &Browse... RăsfoieÈ™te... Configure interactively: Configurare interactivă: &Configure Server... Configurează Server... &Client (use another computer's keyboard and mouse): Client (foloseÈ™te mouse-ul È™i tastatura a altui calculator): Ready Gata Log Log &Apply Aplică &Elevate IP addresses: &About Synergy... Despre Synergy... &Quit &undefinedIeÈ™ire Quit IeÈ™ire Ctrl+Q Ctrl+Q Run PorneÈ™te Ctrl+S Ctrl+S S&top Stop Stop Stop Ctrl+T Ctrl+T S&how Status Arată Statutul Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Salvează configuraÈ›ia ca... Save the interactively generated server configuration to a file. SalvaÅ£i configuraÅ£ia generată interactiv a serverului într-un fiÅŸier. Ctrl+Alt+S Ctrl+Alt+S Settings Setări Edit settings Editează setările Run Wizard PorneÈ™te Expertul NewScreenWidget Unnamed Anonim QObject Synergy Configurations (*.sgc);;All files (*.*) ConfiguraÈ›ii Synergy (*.sgc);;Toate FiÈ™ierele (*.*) Synergy Configurations (*.conf);;All files (*.*) ConfiguraÈ›ii Synergy (*.conf);;Toate FiÈ™ierele (*.*) System tray is unavailable, quitting. Bara de sistem nu este disponibilă, renunÈ›aÈ›i. ScreenSettingsDialog Screen name is empty Numele de ecran este gol. The name for a screen can not be empty. Please fill in a name or cancel the dialog. Numele pentru ecran nu poate fii gol. Vă rugăm introduceÈ›i un nume sau închideÈ›i fereastra. ScreenSettingsDialogBase Screen Settings Setări de ecran Screen &name: Nume de ecran. A&liases Aliasuri &Add &undefinedAdaugă &Remove &undefinedElimină &Modifier keys Modificator de taste &Shift: Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Nici unul &Ctrl: &undefinedCtrl: Al&t: &undefinedl&t: M&eta: Meta: S&uper: Super: &Dead corners ColÈ›uri moarte Top-left Stânga-sus Top-right Dreapta-sus Bottom-left Stânga-jos Bottom-right Dreapta-jos Corner Si&ze: Mărimea colÈ›urilor: &Fixes CorecÈ›ii Fix CAPS LOCK key Corectrează tasta CAPS LOCK Fix NUM LOCK key Corectrează tasta NUM LOCK Fix SCROLL LOCK key Corectrează tasta SCROLL LOCK Fix XTest for Xinerama Corectează XTest pentru Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Ecran: <b>%1</b></center><br>Dublu click pentru editare de setări<br>GlisaÈ›i ecranul către coÈ™ul de gunoi pentru al elimina ServerConfigDialogBase Server Configuration Configurările Serverului Screens and links Ecrane È™i legături Drag a screen from the grid to the trashcan to remove it. GlisaÈ›i un ecran de pe grilă către coÈ™ul de gunoi pentru al elimina. Configure the layout of your synergy server configuration. ConfiguraÈ›i aspectul serverului vostru synergy. Drag this button to the grid to add a new screen. GlisaÈ›i acest buton pe grilă pentru a adăuga un nou ecran. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. GlisaÈ›i ecrane noi pe grilă sau mută cele existente. GlisaÈ›i un ecran către coÈ™ul de gunoi pentru al elimina. Click dublu pe un ecran pentru ai edita setările. Hotkeys Taste rapide &Hotkeys &undefinedTaste rapide &New Nou &Edit &undefinedEditează &Remove &undefinedElimină A&ctions AcÈ›iuni Ne&w Nou E&dit Editează Re&move Elimină Advanced server settings Setari avansate server &Switch Comută Switch &after waiting Comută după o aÈ™teptare de ms ms Switch on double &tap within Schimbă la atingere dubla în interiorul &Options OpÈ›iuni &Check clients every Verifică clienÈ›i fiecare Use &relative mouse moves FoloseÈ™te miÈ™cări relative ale mouse-ului S&ynchronize screen savers Sincronizare protector de ecran Don't take &foreground window on Windows servers Nu luaÅ£i fereastre de prim-plan pe servere Windows &Dead corners ColÈ›uri moarte To&p-left Stânga-sus Top-rig&ht Dreapta-sus &Bottom-left Stânga-jos Bottom-ri&ght Dreapta-jos Cor&ner Size: Mărime colÈ›uri SettingsDialog Save log file to... Salvează fiÈ™ier jurnal pentru ... SettingsDialogBase Settings Setări &Advanced Avansat Sc&reen name: Nume ecran: P&ort: Port: &Interface: Interfață: &Start Synergy after logging in PorneÈ™te Synergy după logare &Automatically start server/client PorneÈ™te automat server/client &Hide when server/client starts Ascunde când server/client porneÈ™te Logging Logging &Process mode: Service Desktop (legacy) &Logging level: Nivel logging Log to file: Log în fiÈ™ier Browse... RăsfoieÈ™te: Error Eroare Warning Avertisment Note Notă Info InformaÅ£ii Debug Depanare Debug1 Depanare1 Debug2 Depanare2 &Startup SetupWizard Setup Synergy Configurare Synergy Please select an option. Te rog selectează o opÈ›iune. SetupWizardBase Setup Synergy Configurare Synergy Server or Client? Server sau Client? &Server (new setup) Server (configurare nouă) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Acesta este primul computer pe care îl configuraÈ›i. Tastatura ÅŸi mouse-ul sunt conectate la acest computer. Acest lucru va permite să vă mutaÅ£i mouse-ul pe la un alt ecran a altui calculator. Nu poate fi decât un server în configuraÅ£ia dumneavoastră. &Client (add to setup) Client (adaugă pentru a configura) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. AÅ£i stabilit deja un server. Acesta este un calculator pe care doriÅ£i să controlaÅ£i folosind tastatura ÅŸi mouse-ul serverului. Pot fii mai mulÈ›i clienti in configurarea dumneavoastră. VersionChecker Unknown Necunoscut synergy-1.4.12-Source/src/gui/res/lang/gui_ru.qm0000600000175000017500000005025112006005561021423 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC=E^kÀN+[H4'ýSWZY¾ñuÆ1§¤%z´Ç1«Œ)(ÏAÍ<¡+XG×9LVE+‘V¥B«ŒŒ«` ‰¶ÞÏ+Ô*»T*»0q*Ð%”*ì0Â+ŒK+«` #GË8°Gíz'ÃJ¹·@áL™bA•UÛ`ÃX·¹½YïÔ,´ZÆÂ,ðxýôÁx.ä ëØ>5ó¢ö}Sv;N@ u>­(Z ’= î7nbj!:°¯4º¾þQÒÉ–þ-ÍEv.û_þ#Veë9ɨw9Nª¸ú%»­Ã&Jº¨”ôº¨”K˜ ¾;H}çH¦”-{O éD^O éEã]àBqÂVE ë¸Ó,XiC>ÁUN™)aYu:B l_” {}× " Š*Ä,ñ$Z?£ö±É üÊJ+"QJ-izBäË@d(3Ül +È攄)(ÿEŠ( nÇ4.d-,@Ty)É{ã1K€¡ª“œ6>sžŽÄ¨Îz~Îç>céJž@¡ëêž‹ £3=ñTük@d/]‚ïÿŠÁ„¢µÞ% ãC&•/lYE#}F•9‡€ÂnhŸC<µ»ó2Y÷¸‰"± ÖjÈ IÞ_¼ JzC kö#4] v®~7Ü ”; -5 i OøŽ$X P¢n:š dö¹#ù ~5Ó:B ¤hÞHß ±¥z Ö„~K ȹ Ä >îF6 aº®=z |ßÚ, ŒFå&ø ŒFå1Š žýZ': ® ¸1Ê ÈcÄ=Þ àKG O RVŽn RVŽ‚ RVŽ ü RVŽJ¯ R÷®c Tƒä!Æ V½4< šÚ­ §|*?[ «c2 »s L »sCi Äcþ;w ÞF¤(ƒ ^®ð /ó'z 4pÄ< dÙ*œ i!Î à rù+ zkÙ ‰PCª àx42Ü è]^ƒ ^Cô=‰5>ä 4 ôžƒñ ’rÒ/åŽî7å*.kC8ük£0½®ú.30Ó>Áò¬Š(ÖýùD­iJí:&OkAboutDialogBase Synergy About SynergyAboutDialogBase58725AB=>UnknownAboutDialogBase5@A8O:Version:AboutDialogBase@K15@8B5 459AB285 4;O 2K?>;=5=8OChoose the action to performActionDialogBase*>=D83C@0F8O 459AB28OConfigure ActionActionDialogBase4@8:@5?8B5 :C@A>@ : M:@0=CLock cursor to screenActionDialogBase.06<8B5 3>@OGCN :;028HCPress a hotkeyActionDialogBaseF06<8B5 8 >B?CAB8B5 3>@OGCN :;028HCPress and release a hotkeyActionDialogBase2B?CAB8B5 3>@OGCN :;028HCRelease a hotkeyActionDialogBase65@5:;NG8BLAO 2 =0?@02;5=88Switch in directionActionDialogBase,5@5:;NG8BLAO =0 M:@0=Switch to screenActionDialogBase<-B> 459AB285 2K?>;=O5BAO :>340This action is performed whenActionDialogBase=87downActionDialogBase52>leftActionDialogBaseK:;NG8BLoffActionDialogBase:;NG8BLonActionDialogBase,">;L:> =0 MB8E M:@0=0Eonly on these screensActionDialogBase @02>rightActionDialogBase,060B0 3>@OG0O :;028H0the hotkey is pressedActionDialogBase0B?CI5=0 3>@OG0O :;028H0the hotkey is releasedActionDialogBase5@5:;NG8BLtoggleActionDialogBase 25@EupActionDialogBase@2548B5 >?8A0=85 3>@OG59 :;028H8'Enter the specification for the hotkey:HotkeyDialogBase>@OG0O :;028H0HotkeyHotkeyDialogBase& 540:B8@>20BL&Edit MainWindow &$09;&File MainWindow&><>IL&Help MainWindow !B0@B&Start MainWindow!B>?&Stop MainWindow &:=>&Window MainWindowˆ<p>KH;0 25@A8O %1 <a href="%2">?>A5B8B5 251-A09B ?@>3@0<<K</a>.</p>C

Version %1 is now available, visit website.

 MainWindowB#:070BL D09; :>=D83C@0F88 Synergy!Browse for a synergys config file MainWindowR52>7<>6=> 87<5=8BL :>=D83C@0F8>==K9 D09;Cannot write configuration file MainWindowF<O D09;0 :>=D83C@0F88 =5?@028;L=>5Configuration filename invalid MainWindowP5 2>7<>6=> A>E@0=8BL D09; :>=D83C@0F88.%Could not save configuration to file. MainWindow<O E>AB0 ?CAB>Hostname is empty MainWindow€>60;C9AB0 70?>;=8B5 8<O E>AB0 2 :;85=B5 Synergy 4;O A>548=5=8O.?Please fill in a hostname for the synergy client to connect to. MainWindow@@>3@0<<0 =5 <>65B 1KBL 70?CI5=0Program can not be started MainWindow:!>E@0=8BL :>=D83C@0F8N :0:...Save configuration as... MainWindow*!>E@0=5=85 =52>7<>6=> Save failed MainWindow0;85=B Synergy =5 =0945=Synergy client not found MainWindow(Synergy >AB0=>2;5=0.Synergy is not running. MainWindow(Synergy 70?CA:05BAO.Synergy is starting. MainWindow0!5@25@ Synergy =5 =0945=Synergy server not found MainWindowÊSynergy 7025@H8;0AL =5>6840==> A :>4>< 2KE>40 %1.<br><br>>60;C9AB0 ?@>A<>B@8B5 log-D09; 4;O 45B0;59.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow:Synergy 7025@H8;0AL A >H81:>9 Synergy terminated with an error MainWindow\A?>;=O5<K9 D09; 4;O :;85=B0 Synergy =5 =0945=5The executable for the synergy client does not exist. MainWindow^5 =0945= 2K?>;=O5<K9 D09; 4;O A5@25@0 Synergy.5The executable for the synergy server does not exist. MainWindowø@>3@0<<0/D09; <br><br>%1<br><br> 5 <>65B 1KBL 70?CI5=0, => >=0 8A?@02=0. @>25@LB5 - 4>AB0B>G=> ;8 C 20A ?@02 4;O 70?CA:0.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow²@5<5==K9 D09; :>=D83C@0F88, 8A?>;L7CNI89AO 4;O 70?CA:0 Synergy, 701;>:8@>20= 4;O 70?8A8.NThe temporary configuration file required to start synergy can not be written. MainWindow58725AB=>Unknown MainWindow®K =5 C:070;8 ?@028;L=K9 D09; :>=D83C@0F88 A5@25@0 Synergy. 5;05B5 C:070BL 53> A59G0A?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow Synergy&About Synergy...MainWindowBase@8<5=8B&L&ApplyMainWindowBase17>@... &Browse...MainWindowBaset;85=B (8A?>;L7C5B :;0280BC@C 8 <KH:C 4@C3>3> :><?LNB5@0):4&Client (use another computer's keyboard and mouse):MainWindowBase$$09; :>=D83C@0F88:&Configuration file:MainWindowBase&0AB@>8BL A5@25@...&Configure Server...MainWindowBase &KE>4&QuitMainWindowBasev!5@25@ (A?>;L7>20=85 <KH:8 8 :;0280BC@K MB>3> :><?LNB5@0):3&Server (share this computer's mouse and keyboard):MainWindowBase !B0@B&StartMainWindowBase82B><0B8G5A:0O :>=D83C@0F8O:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase$7<5=8BL =0AB@>9:8 Edit settingsMainWindowBase C@=0;LogMainWindowBase KE>4QuitMainWindowBase >B>2>ReadyMainWindowBase0?CAB8BLRunMainWindowBase 0?CAB8BL 0AB5@ Run WizardMainWindowBase>:070BL AB0BCA S&how StatusMainWindowBaseAB0=>28BLS&topMainWindowBase8!>E@0=8BL :>=D83C@0F8N :0:..Save configuration &as...MainWindowBasev!>E@0=8BL 02B><0B8G5A:8 35=5@8@>20==CN :>=D83C@0F8N 2 D09;.@Save the interactively generated server configuration to a file.MainWindowBase0AB@>9:8SettingsMainWindowBaseAB0=>28BLStopMainWindowBaseSynergySynergyMainWindowBase58725AB=>UnknownMainWindowBaseNA?>;L7>20BL ACI5AB2CNICN :>=D83C@0F8N:Use existing configuration:MainWindowBase57 =0720=8OUnnamedNewScreenWidget\>=D83C@0F8O Synergy (*.conf);;A5 D09;K (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectZ>=D83C@0F8O Synergy (*.sgc);;A5 D09;K (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectb!8AB5<=K9 B@M9 =5 4>ABC?5=, 7025@H5=85 ?@>3@0<<K.%System tray is unavailable, quitting.QObject"<O M:@0=0 ?CAB>5Screen name is emptyScreenSettingsDialog¦<O M:@0=0 =5 <>65B 1KBL ?CABK<. >60;C9AB0 70?>;=8B5 8<O 8;8 >B<5=8B5 MB>B 480;>3.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog>1028BL&AddScreenSettingsDialogBase Ctrl:&Ctrl:ScreenSettingsDialogBase5@B2K5 C3;K &Dead cornersScreenSettingsDialogBase$8:A8@>20=85&FixesScreenSettingsDialogBase(;028H8-<>48D8:0B>@K&Modifier keysScreenSettingsDialogBase#40;8BL&RemoveScreenSettingsDialogBase Shift:&Shift:ScreenSettingsDialogBaseA524>=8<KA&liasesScreenSettingsDialogBaseAlt:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase86=89 ;52K9 Bottom-leftScreenSettingsDialogBase86=89 ?@0289 Bottom-rightScreenSettingsDialogBase 07<5@ C3;0: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase*$8:A8@>20BL CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase($8:A8@>20BL NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase.$8:A8@>20BL SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBase<$8:A8@>20BL XTest 4;O XineramaFix XTest for XineramaScreenSettingsDialogBase Meta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBase5BNoneScreenSettingsDialogBase Super:S&uper:ScreenSettingsDialogBase<O M:@0=0: Screen &name:ScreenSettingsDialogBase 0AB@>9:8 M:@0=0Screen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase5@E=89 ;52K9Top-leftScreenSettingsDialogBase5@E=89 ?@02K9 Top-rightScreenSettingsDialogBaseü<center>-:@0=: <b>%1</b></center><br>2>9=>9 I5;G>: 4;O @540:B8@>20=8O :>=D83C@0F88<br>5@5BO=8B5 M:@0= 2 :>@78=C 4;O C40;5=8Oo
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel&86=89 ;52K9 &Bottom-leftServerConfigDialogBase4@>25@OBL :;85=B>2 :0&64K5&Check clients everyServerConfigDialogBase5@B2K5 C3;K &Dead cornersServerConfigDialogBase& 540:B8@>20BL&EditServerConfigDialogBase &>@OG85 :;028H8&HotkeysServerConfigDialogBase &>2K9&NewServerConfigDialogBase &?F88&OptionsServerConfigDialogBase#40;8BL&RemoveServerConfigDialogBase5@5:;NG8BAO&SwitchServerConfigDialogBase5&9AB28OA&ctionsServerConfigDialogBase@>?>;=8B5;L=K5 =0AB@>9:8 A5@25@0Advanced server settingsServerConfigDialogBase86=89 ?@02K&9 Bottom-ri&ghtServerConfigDialogBasev0AB@>8BL @0A?>;>65=85 :>=D83C@0F88 0H53> A5@25@0 Synergy.:Configure the layout of your synergy server configuration.ServerConfigDialogBase 07&<5@ C3;0: Cor&ner Size:ServerConfigDialogBaseb5 45@60BL >:=> A5@25@0 ?>25@E 2A5E (4;O Windows)0Don't take &foreground window on Windows serversServerConfigDialogBasej5@5BO=8B5 M:@0= A A5B:8 2 :>@78=C GB>1K C40;8BL 53>.9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase45@5BO=8B5 =>2K9 M:@0= =0 A5B:C 8;8 ?5@5428=LB5 ACI5AB2CNI85. 5@5BO=8B5 M:@0= 2 :>@78=C GB>1K C40;8BL 53>. 2>9=>9 I5;G>: =0 M:@0=5 4;O 53> :>=D83C@0F88.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasex5@5BO=8B5 MBC :=>?:C =0 A5B:C 4;O 4>102;5=8O =>2>3> M:@0=0.1Drag this button to the grid to add a new screen.ServerConfigDialogBase 5&40:B8@>20BLE&ditServerConfigDialogBase>@OG85 :;028H8HotkeysServerConfigDialogBase >&2K9Ne&wServerConfigDialogBase#40&;8BLRe&moveServerConfigDialogBase4!&8=E@>=878@>20BL 70AB02:8S&ynchronize screen saversServerConfigDialogBase-:@0=K 8 A2O78Screens and linksServerConfigDialogBase(>=D83C@0F8O A5@25@0Server ConfigurationServerConfigDialogBase65@5:;NG8BAO ?>A;5 >6840=8OSwitch &after waitingServerConfigDialogBaseT5@5:;NG8BAO ?> 42>9=><C =060B8N 2 B5G5=88Switch on double &tap withinServerConfigDialogBase5@E=89 &;52K9 To&p-leftServerConfigDialogBase5@E=89 &?@02K9 Top-rig&htServerConfigDialogBaseLA?>;L7>20BL &@>4=K5 =0AB@>9:8 :C@A>@0Use &relative mouse movesServerConfigDialogBase<A5:msServerConfigDialogBase.!>E@0=8BL log-D09; 2...Save log file to...SettingsDialog&>?>;L=8B5;L=> &AdvancedSettingsDialogBaseL&2B><0B8G5A:8 70?CA:0BL A5@25@/:;85=B"&Automatically start server/clientSettingsDialogBaseT5 ?>:0&7K20BL :>340 A5@25@/:;85=B 70?CI5=&Hide when server/client startsSettingsDialogBase=B5@&D59A: &Interface:SettingsDialogBase2#@>25=L 70?8A8 2 6C@=0?;:&Logging level:SettingsDialogBaseP0?CA:0BL Synergy ?>A;5 2E>40 2 &A8AB5<C&Start Synergy after logging inSettingsDialogBase17>@... Browse...SettingsDialogBaseB;04:0DebugSettingsDialogBaseB;04:01Debug1SettingsDialogBaseB;04:02Debug2SettingsDialogBase H81:0ErrorSettingsDialogBase8=D>@<0F8OInfoSettingsDialogBase20?8AK20BL 6C@=0; 2 D09;: Log to file:SettingsDialogBase C@=0;LoggingSettingsDialogBase0<5B:0NoteSettingsDialogBase &>@B:P&ort:SettingsDialogBase<O M:&@0=0: Sc&reen name:SettingsDialogBase0AB@>9:8SettingsSettingsDialogBase@54C?@5645=85WarningSettingsDialogBase2>60;C9AB0 2K15@8B5 >?F8NPlease select an option. SetupWizard"0AB@>9:0 Synergy Setup Synergy SetupWizard<&;85=B (4>1028BL 2 =0AB@>9:C)&Client (add to setup)SetupWizardBase0!5@25@ (=>20O =0AB@>9:0)&Server (new setup)SetupWizardBase$!5@25@ 8;8 ;85=B?Server or Client?SetupWizardBase"0AB@>9:0 Synergy Setup SynergySetupWizardBase¨-B> ?5@2K9 :><?LNB5@ :>B>@K9 =0AB@08205BAO. 0H0 :;0280BC@0 8 <KHL ?>4:;NG5=K : MB><C :><?LNB5@C. -B> ?>72>;8B ?5@542830BL :C@A>@ =0 M:@0=K 4@C38E :><?LNB5@>2.  =0AB@>9:5 <>65B ?@8ACBAB2>20BL B>;L:> >48= A5@25@.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase# 0A C65 5ABL =0AB@>5==K9 A5@25@. -B>B :><?LNB5@ <>65B 8A?>;L7>20BL :;0280BC@C 8 <KHL A5@25@0.  =0AB@>9:5 <>65B 1KBL =5A:>;L:> A5@25@>2.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBase58725AB=>UnknownVersionCheckerˆ ý) ÿý, synergy-1.4.12-Source/src/gui/res/lang/gui_ru.ts0000600000175000017500000014225312006005561021440 0ustar synergysynergy AboutDialogBase About Synergy О Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown ÐеизвеÑтно Version: ВерÑиÑ: &Ok Ок ActionDialogBase Configure Action ÐšÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ñ Ð´ÐµÐ¹ÑÑ‚Ð²Ð¸Ñ Choose the action to perform Выберите дейÑтвие Ð´Ð»Ñ Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Press a hotkey Ðажмите горÑчую клавишу Release a hotkey ОтпуÑтите горÑчую клавишу Press and release a hotkey Ðажмите и отпуÑтите горÑчую клавишу only on these screens Только на Ñтих Ñкранах Switch to screen ПереключитьÑÑ Ð½Ð° Ñкран Switch in direction ПереключитьÑÑ Ð² направлении left Лево right Право up Вверх down Вниз Lock cursor to screen Прикрепите курÑор к Ñкрану toggle Переключить on Включить off Выключить This action is performed when Это дейÑтвие выполнÑетÑÑ ÐºÐ¾Ð³Ð´Ð° the hotkey is pressed Ðажата горÑÑ‡Ð°Ñ ÐºÐ»Ð°Ð²Ð¸ÑˆÐ° the hotkey is released Отпущена горÑÑ‡Ð°Ñ ÐºÐ»Ð°Ð²Ð¸ÑˆÐ° HotkeyDialogBase Hotkey ГорÑÑ‡Ð°Ñ ÐºÐ»Ð°Ð²Ð¸ÑˆÐ° Enter the specification for the hotkey: Введите опиÑание горÑчей клавиши MainWindow &Start Старт &File &Файл &Edit &Редактировать &Window &Окно &Help &Помощь <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Вышла верÑÐ¸Ñ %1 <a href="%2">поÑетите веб-Ñайт программы</a>.</p> Program can not be started Программа не может быть запущена The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Программа/файл <br><br>%1<br><br> Ðе может быть запущена, но она иÑправна. Проверьте - доÑтаточно ли у Ð²Ð°Ñ Ð¿Ñ€Ð°Ð² Ð´Ð»Ñ Ð·Ð°Ð¿ÑƒÑка. Synergy client not found Клиент Synergy не найден The executable for the synergy client does not exist. ИÑполнÑемый файл Ð´Ð»Ñ ÐºÐ»Ð¸ÐµÐ½Ñ‚Ð° Synergy не найден Hostname is empty Ð˜Ð¼Ñ Ñ…Ð¾Ñта пуÑто Please fill in a hostname for the synergy client to connect to. ПожалуйÑта заполните Ð¸Ð¼Ñ Ñ…Ð¾Ñта в клиенте Synergy Ð´Ð»Ñ ÑоединениÑ. Cannot write configuration file Ðевозможно изменить конфигурационный файл The temporary configuration file required to start synergy can not be written. Временный файл конфигурации, иÑпользующийÑÑ Ð´Ð»Ñ Ð·Ð°Ð¿ÑƒÑка Synergy, заблокирован Ð´Ð»Ñ Ð·Ð°Ð¿Ð¸Ñи. Configuration filename invalid Ð˜Ð¼Ñ Ñ„Ð°Ð¹Ð»Ð° конфигурации неправильное You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Ð’Ñ‹ не указали правильный файл конфигурации Ñервера Synergy. Желаете указать его ÑейчаÑ? Synergy server not found Сервер Synergy не найден The executable for the synergy server does not exist. Ðе найден выполнÑемый файл Ð´Ð»Ñ Ñервера Synergy. Synergy terminated with an error Synergy завершилаÑÑŒ Ñ Ð¾ÑˆÐ¸Ð±ÐºÐ¾Ð¹ Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy завершилаÑÑŒ неожиданно Ñ ÐºÐ¾Ð´Ð¾Ð¼ выхода %1.<br><br>ПожалуйÑта проÑмотрите log-файл Ð´Ð»Ñ Ð´ÐµÑ‚Ð°Ð»ÐµÐ¹. &Stop Стоп service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy запуÑкаетÑÑ. Synergy is not running. Synergy оÑтановлена. Unknown ÐеизвеÑтно Browse for a synergys config file Указать файл конфигурации Synergy Save configuration as... Сохранить конфигурацию как... Save failed Сохранение невозможно Could not save configuration to file. Ðе возможно Ñохранить файл конфигурации. MainWindowBase Synergy Synergy Screen name: Unknown ÐеизвеÑтно &Server IP: &Start Старт &Server (share this computer's mouse and keyboard): Сервер (ИÑпользование мышки и клавиатуры Ñтого компьютера): Use existing configuration: ИÑпользовать ÑущеÑтвующую конфигурацию: &Configuration file: Файл конфигурации: &Browse... Обзор... Configure interactively: ÐвтоматичеÑÐºÐ°Ñ ÐºÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ñ: &Configure Server... ÐаÑтроить Ñервер... &Client (use another computer's keyboard and mouse): Клиент (иÑпользует клавиатуру и мышку другого компьютера): Ready Готово Log Журнал &Apply Применит&ÑŒ &Elevate IP addresses: &About Synergy... О Synergy &Quit &Выход Quit Выход Ctrl+Q Ctrl+Q Run ЗапуÑтить Ctrl+S Ctrl+S S&top ОÑтановить Stop ОÑтановить Ctrl+T Ctrl+T S&how Status Показать ÑÑ‚Ð°Ñ‚ÑƒÑ Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Сохранить конфигурацию как.. Save the interactively generated server configuration to a file. Сохранить автоматичеÑки генерированную конфигурацию в файл. Ctrl+Alt+S Ctrl+Alt+S Settings ÐаÑтройки Edit settings Изменить наÑтройки Run Wizard ЗапуÑтить МаÑтер NewScreenWidget Unnamed Без Ð½Ð°Ð·Ð²Ð°Ð½Ð¸Ñ QObject Synergy Configurations (*.sgc);;All files (*.*) ÐšÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ñ Synergy (*.sgc);;Ð’Ñе файлы (*.*) Synergy Configurations (*.conf);;All files (*.*) ÐšÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ñ Synergy (*.conf);;Ð’Ñе файлы (*.*) System tray is unavailable, quitting. СиÑтемный Ñ‚Ñ€Ñй не доÑтупен, завершение программы. ScreenSettingsDialog Screen name is empty Ð˜Ð¼Ñ Ñкрана пуÑтое The name for a screen can not be empty. Please fill in a name or cancel the dialog. Ð˜Ð¼Ñ Ñкрана не может быть пуÑтым. ПожалуйÑта заполните Ð¸Ð¼Ñ Ð¸Ð»Ð¸ отмените Ñтот диалог. ScreenSettingsDialogBase Screen Settings ÐаÑтройки Ñкрана Screen &name: Ð˜Ð¼Ñ Ñкрана: A&liases ПÑевдонимы &Add Добавить &Remove Удалить &Modifier keys Клавиши-модификаторы &Shift: Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Ðет &Ctrl: Ctrl: Al&t: Alt: M&eta: Meta: S&uper: Super: &Dead corners Мертвые углы Top-left Верхний левый Top-right Верхний правый Bottom-left Ðижний левый Bottom-right Ðижний правий Corner Si&ze: Размер угла: &Fixes ФикÑирование Fix CAPS LOCK key ФикÑировать CAPS LOCK Fix NUM LOCK key ФикÑировать NUM LOCK Fix SCROLL LOCK key ФикÑировать SCROLL LOCK Fix XTest for Xinerama ФикÑировать XTest Ð´Ð»Ñ Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Экран: <b>%1</b></center><br>Двойной щелчок Ð´Ð»Ñ Ñ€ÐµÐ´Ð°ÐºÑ‚Ð¸Ñ€Ð¾Ð²Ð°Ð½Ð¸Ñ ÐºÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ð¸<br>ПеретÑните Ñкран в корзину Ð´Ð»Ñ ÑƒÐ´Ð°Ð»ÐµÐ½Ð¸Ñ ServerConfigDialogBase Server Configuration ÐšÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ñ Ñервера Screens and links Экраны и ÑвÑзи Drag a screen from the grid to the trashcan to remove it. ПеретÑните Ñкран Ñ Ñетки в корзину чтобы удалить его. Configure the layout of your synergy server configuration. ÐаÑтроить раÑположение конфигурации Вашего Ñервера Synergy. Drag this button to the grid to add a new screen. ПеретÑните Ñту кнопку на Ñетку Ð´Ð»Ñ Ð´Ð¾Ð±Ð°Ð²Ð»ÐµÐ½Ð¸Ñ Ð½Ð¾Ð²Ð¾Ð³Ð¾ Ñкрана. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. ПеретÑните новый Ñкран на Ñетку или передвиньте ÑущеÑтвующие. ПеретÑните Ñкран в корзину чтобы удалить его. Двойной щелчок на Ñкране Ð´Ð»Ñ ÐµÐ³Ð¾ конфигурации. Hotkeys ГорÑчие клавиши &Hotkeys &ГорÑчие клавиши &New &Ðовый &Edit &Редактировать &Remove Удалить A&ctions Де&йÑÑ‚Ð²Ð¸Ñ Ne&w Ðо&вый E&dit Ре&дактировать Re&move Уда&лить Advanced server settings Дополнительные наÑтройки Ñервера &Switch ПереключитÑÑ Switch &after waiting ПереключитÑÑ Ð¿Ð¾Ñле Ð¾Ð¶Ð¸Ð´Ð°Ð½Ð¸Ñ ms мÑек Switch on double &tap within ПереключитÑÑ Ð¿Ð¾ двойному нажатию в течении &Options &Опции &Check clients every ПроверÑÑ‚ÑŒ клиентов ка&ждые Use &relative mouse moves ИÑпользовать &родные наÑтройки курÑора S&ynchronize screen savers С&инхронизировать заÑтавки Don't take &foreground window on Windows servers Ðе держать окно Ñервера поверх вÑех (Ð´Ð»Ñ Windows) &Dead corners Мертвые углы To&p-left Верхний &левый Top-rig&ht Верхний &правый &Bottom-left &Ðижний левый Bottom-ri&ght Ðижний правы&й Cor&ner Size: Раз&мер угла: SettingsDialog Save log file to... Сохранить log-файл в... SettingsDialogBase Settings ÐаÑтройки &Advanced &Допольнительно Sc&reen name: Ð˜Ð¼Ñ Ñк&рана: P&ort: П&орт: &Interface: Интер&фейÑ: &Start Synergy after logging in ЗапуÑкать Synergy поÑле входа в &ÑиÑтему &Automatically start server/client &ÐвтоматичеÑки запуÑкать Ñервер/клиент &Hide when server/client starts Ðе пока&зывать когда Ñервер/клиент запущен Logging Журнал &Process mode: Service Desktop (legacy) &Logging level: Уровень запиÑи в журна?л: Log to file: ЗапиÑывать журнал в файл: Browse... Обзор... Error Ошибка Warning Предупреждение Note Заметка Info Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Debug Отладка Debug1 Отладка1 Debug2 Отладка2 &Startup SetupWizard Setup Synergy ÐаÑтройка Synergy Please select an option. ПожалуйÑта выберите опцию SetupWizardBase Setup Synergy ÐаÑтройка Synergy Server or Client? Сервер или Клиент? &Server (new setup) Сервер (Ð½Ð¾Ð²Ð°Ñ Ð½Ð°Ñтройка) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Это первый компьютер который наÑтраиваетÑÑ. Ваша клавиатура и мышь подключены к Ñтому компьютеру. Это позволит передвигать курÑор на Ñкраны других компьютеров. Ð’ наÑтройке может приÑутÑтвовать только один Ñервер. &Client (add to setup) &Клиент (добавить в наÑтройку) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. У Ð’Ð°Ñ ÑƒÐ¶Ðµ еÑÑ‚ÑŒ наÑтроенный Ñервер. Этот компьютер может иÑпользовать клавиатуру и мышь Ñервера. Ð’ наÑтройке может быть неÑколько Ñерверов. VersionChecker Unknown ÐеизвеÑтно synergy-1.4.12-Source/src/gui/res/lang/gui_sl-SI.qm0000600000175000017500000000014312006005561021717 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBÏiAInformacijeInfoSettingsDialogBasesynergy-1.4.12-Source/src/gui/res/lang/gui_sl-SI.ts0000600000175000017500000012354712006005561021746 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Informacije Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_sv.qm0000600000175000017500000001440412006005561021425 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB^ÐÀ›+[H4ÏY¾ºuƤ«ŒÏl<¡>VEwŒ…«`_¶Þ>+Ôm*»…*»**Ð%»*ì0ë+Œ+«`LUÛ`+YïÔ²ZÆÂîxýôcÁx.¹ä²óûö}Sæu>‚(Z ð¯4 Qº¾þÚÒÉIª¸úº¨”º¨”;˜ ;H}®ÂVE ªl_” ,šl®-«Žø±«æ««Pö±ÉB"QJÈ( nxžŽÄ xÎç>–=ñT àŠÁ„µÞ%f€Ân- Ö„~ ¼ àKG| V½4— šÚr ^®… i!Î + rù- zkÙÎ ‰PŸ=‰äôžƒpiÛ&Ok&OkAboutDialogBaseOm Synergy About SynergyAboutDialogBaseVersion:Version:AboutDialogBase>Välj funktion som skall utförasChoose the action to performActionDialogBaseKonfigureraConfigure ActionActionDialogBase2Lås muspekaren till skärmLock cursor to screenActionDialogBase2Tryck ned en snabbtangentPress a hotkeyActionDialogBaseFTryck ned och släpp en snabbtangentPress and release a hotkeyActionDialogBase*Släpp en snabbtangentRelease a hotkeyActionDialogBase Växla i riktningSwitch in directionActionDialogBase Växla till skärmSwitch to screenActionDialogBase"Detta utförs när This action is performed whenActionDialogBasenerdownActionDialogBasevänsterleftActionDialogBaseAvoffActionDialogBasepåonActionDialogBase.endast på dessa skärmaronly on these screensActionDialogBase högerrightActionDialogBase0snabbtangenten trycks inthe hotkey is pressedActionDialogBase*snabbtangenten släppsthe hotkey is releasedActionDialogBase mudartoggleActionDialogBaseuppupActionDialogBase.Beskriv snabbtangenten:'Enter the specification for the hotkey:HotkeyDialogBaseSnabbtangentHotkeyHotkeyDialogBase&Redigera&Edit MainWindow &Arkiv&File MainWindow &Hjälp&Help MainWindow &Start&Start MainWindow &Stopp&Stop MainWindow&Fönster&Window MainWindow–<p>Version %1 finns nu tillgänglig, <a href="%2">besök webbplatsen</a>.</p>C

Version %1 is now available, visit website.

 MainWindowDKan inte spara konfigurationsfilenCannot write configuration file MainWindowZNamnet på konfigurationsfilen är inte giltigtConfiguration filename invalid MainWindow8Värddatornamnet är inte sattHostname is empty MainWindow€Fyll i det värddatornamn som Synergyklienten skall ansluta till.?Please fill in a hostname for the synergy client to connect to. MainWindow6Programmet kan inte startasProgram can not be started MainWindow>Erreur lors de l'enregistrement Save failed MainWindow:Synergyklienten hittades inteSynergy client not found MainWindow4Serveur Synergy non trouvéSynergy server not found MainWindowrDen exekverbara filen för Synergyklienten existerar inte.5The executable for the synergy client does not exist. MainWindowVProgrammet<br><br>%1<br><br>kunde inte startas, men det finns där det skall. Var vänlig och kontrollera att du har tillräckligt med rättigheter för att köra detta program.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow¶Den tillfälliga konfigurationsfilen som krävs för att kunna starta Synergy kan inte skapas.NThe temporary configuration file required to start synergy can not be written. MainWindow&Om Synergy&About Synergy...MainWindowBase&Avsluta&QuitMainWindowBase &Start&StartMainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBaseAvslutaQuitMainWindowBaseKörRunMainWindowBaseVisa Status S&how StatusMainWindowBase S&toppS&topMainWindowBase StoppStopMainWindowBase &Ctrl:&Ctrl:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBase IngenNoneScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase&Redigera&EditServerConfigDialogBaseInfoInfoSettingsDialogBaseVarningWarningSettingsDialogBaseˆsynergy-1.4.12-Source/src/gui/res/lang/gui_sv.ts0000600000175000017500000012604712006005561021445 0ustar synergysynergy AboutDialogBase About Synergy Om Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: Version: &Ok &Ok ActionDialogBase Configure Action Konfigurera Choose the action to perform Välj funktion som skall utföras Press a hotkey Tryck ned en snabbtangent Release a hotkey Släpp en snabbtangent Press and release a hotkey Tryck ned och släpp en snabbtangent only on these screens endast pÃ¥ dessa skärmar Switch to screen Växla till skärm Switch in direction Växla i riktning left vänster right höger up upp down ner Lock cursor to screen LÃ¥s muspekaren till skärm toggle mudar on pÃ¥ off Av This action is performed when Detta utförs när the hotkey is pressed snabbtangenten trycks in the hotkey is released snabbtangenten släpps HotkeyDialogBase Hotkey Snabbtangent Enter the specification for the hotkey: Beskriv snabbtangenten: MainWindow &Start &Start &File &Arkiv &Edit &Redigera &Window &Fönster &Help &Hjälp <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Version %1 finns nu tillgänglig, <a href="%2">besök webbplatsen</a>.</p> Program can not be started Programmet kan inte startas The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Programmet<br><br>%1<br><br>kunde inte startas, men det finns där det skall. Var vänlig och kontrollera att du har tillräckligt med rättigheter för att köra detta program. Synergy client not found Synergyklienten hittades inte The executable for the synergy client does not exist. Den exekverbara filen för Synergyklienten existerar inte. Hostname is empty Värddatornamnet är inte satt Please fill in a hostname for the synergy client to connect to. Fyll i det värddatornamn som Synergyklienten skall ansluta till. Cannot write configuration file Kan inte spara konfigurationsfilen The temporary configuration file required to start synergy can not be written. Den tillfälliga konfigurationsfilen som krävs för att kunna starta Synergy kan inte skapas. Configuration filename invalid Namnet pÃ¥ konfigurationsfilen är inte giltigt You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found Serveur Synergy non trouvé The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop &Stopp service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Erreur lors de l'enregistrement Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Om Synergy &Quit &Avsluta Quit Avsluta Ctrl+Q Ctrl+Q Run Kör Ctrl+S Ctrl+S S&top S&topp Stop Stopp Ctrl+T Ctrl+T S&how Status Visa Status Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Ingen &Ctrl: &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Redigera &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Varning Note Info Info Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_th-TH.qm0000600000175000017500000000013112006005561021711 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBÏi7 I-!9%InfoSettingsDialogBasesynergy-1.4.12-Source/src/gui/res/lang/gui_th-TH.ts0000600000175000017500000012355612006005561021743 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info ข้อมูล Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_tr-TR.qm0000600000175000017500000000533712006005561021752 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝB0^RÀ±+[SWÏY¾puÆÏ `Œ «`W¶Þ¼+Ôï*»*» *Ð%Q*ì0+«`æX·¹>xýôÁx.®ö}S¦(Z H= îýnbj¼º¨”³º¨”˜˜šö±É䀡ªEžŽÄRëêž=ñTš‚ïï ȹ„ àKG R÷® šÚ„ rù3Ó>[i • &Tamam&OkAboutDialogBase Synergy hakk1nda About SynergyAboutDialogBase Sürüm:Version:AboutDialogBase a_a1downActionDialogBasesolleftActionDialogBase kapal1offActionDialogBaseaç1konActionDialogBasesarightActionDialogBase yukar1upActionDialogBaseK1sayolHotkeyHotkeyDialogBase&Düzenle&Edit MainWindow &Dosya&File MainWindow&Yard1m&Help MainWindow&Ba_lat&Start MainWindow&Dur&Stop MainWindow&Pencere&Window MainWindow"Anabilgisayar bo_Hostname is empty MainWindow*Program ba_lat1lamad1Program can not be started MainWindowAyarlar1 kaydetSave configuration as... MainWindowKaydetme hatas1 Save failed MainWindow0Synergy al1c1y1 bulamad1Synergy client not found MainWindow$Synergy çal1_m1yorSynergy is not running. MainWindow Synergy ba_l1yorSynergy is starting. MainWindow Synergy hakk1nda&About Synergy...MainWindowBase&Ara_t1r... &Browse...MainWindowBase&Ayar dosyas1:&Configuration file:MainWindowBase&Ba_lat&StartMainWindowBaseKay1t kütüüLogMainWindowBase Ç1k1_QuitMainWindowBase Haz1rReadyMainWindowBaseÇal1_t1rRunMainWindowBaseDurumu Göster S&how StatusMainWindowBase,Ayarlar1 farkl1 kaydetSave configuration &as...MainWindowBaseDurStopMainWindowBaseSynergySynergyMainWindowBase&Kullan1lan ayarlar:Use existing configuration:MainWindowBase&Düzenle&EditServerConfigDialogBase BilgiInfoSettingsDialogBasesynergy-1.4.12-Source/src/gui/res/lang/gui_tr-TR.ts0000600000175000017500000012436412006005561021765 0ustar synergysynergy AboutDialogBase About Synergy Synergy hakkında <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: Sürüm: &Ok &Tamam ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left sol right saÄŸ up yukarı down aÅŸağı Lock cursor to screen toggle on açık off kapalı This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Kısayol Enter the specification for the hotkey: MainWindow &Start &BaÅŸlat &File &Dosya &Edit &Düzenle &Window &Pencere &Help &Yardım <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started Program baÅŸlatılamadı The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found Synergy alıcıyı bulamadı The executable for the synergy client does not exist. Hostname is empty Anabilgisayar boÅŸ Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop &Dur service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy baÅŸlıyor Synergy is not running. Synergy çalışmıyor Unknown Browse for a synergys config file Save configuration as... Ayarları kaydet Save failed Kaydetme hatası Could not save configuration to file. MainWindowBase Synergy Synergy Screen name: Unknown &Server IP: &Start &BaÅŸlat &Server (share this computer's mouse and keyboard): Use existing configuration: Kullanılan ayarlar: &Configuration file: &Ayar dosyası: &Browse... &AraÅŸtır... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Hazır Log Kayıt kütüğü &Apply &Elevate IP addresses: &About Synergy... Synergy hakkında &Quit Quit Çıkış Ctrl+Q Run Çalıştır Ctrl+S S&top Stop Dur Ctrl+T S&how Status Durumu Göster Ctrl+H &Hide Hide &Show Show Save configuration &as... Ayarları farklı kaydet Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Düzenle &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Bilgi Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_uk.qm0000600000175000017500000005015712006005561021421 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC=#^1À+[H4(QSWÈY¾]uÆÿ§¤%Ú´Ç1H«Œ)|ÏA<¡+œG×9,VE+ÕV¥BiŒô«`!¶Þ›+ÔÌ*»"*»0³*Ð%\*ì0ˆ+Œ«+«`ëGË8šGíz(J¹·@‘L™bAcUÛ`5X·¹)YïÔ-ZÆÂ-@xýôÈÁx.Nä GëØ>5 ódö}Sè;N?·u>Å(Z t= î5nbj!ª°¯4º¾þ+ÒɈþ.Ev. _þ#´eë9§¨w9˜ª¸ú&­Ã&¤º¨”¼º¨”µ˜ À;H}çH¦”-ËO éD O éE­]àB1ÂVE ˸Ó,¢iC>‹UN™)µYu:AÜl_” c}× "gŠ*Ä<:šl®z¨öé/ô«Žø–«Ë««5«›¡@Õ«›¢A° Î5ÒÄ:Ó&TÄ:Ó0eäöž æç¹Ô=üñ$Z?eö±ÉÛüÊJ+_"QJE-izB¤Ë@d(‡Ül ,攄•(ÿEV( nµ4.d-|@Ty*{ã1€¡ªïœ6>ßžŽÄ¢ÎzèÎç>¡éJž@Këêž× £3j=ñTðk@d/¥‚ïmŠÁ„hµÞ%ÓãC&ç/lYDë}F•9e€Ân`ŸC<‹»ó2y÷¸‰# Öj IÞ_ø JzBÛ kö#4m v®~7Ð ”:Ý -5 I OøŽ$¶ P¢n:v dö¹$S ~5Ó: ¤hÞH‘ ±¥zá Ö„~U ȹ!8 >îF aº®=X |ßÚ,P ŒFå'J ŒFå1¾ žýZ'Ž ® ¸2 ÈcÄ=º àKG  RVŽr RVŽ RVŽ!p RVŽJy R÷®m Tƒä"* V½4þ šÚ­ §|*? «c2@ »s ¾ »sC' Äcþ;M ÞF¤(× ^®Ö /ó'Î 4pÄ;ì dÙ*ä i!Î Î rù+ zkÙ ‰PCn àx42ø è]^ ^C´=‰%>ä 4ôžƒU ’rÜ/åŽJ7å*zkC8Þk£0ù®ú.3JÓ>Åò¬Š)*ýùDuiJ³OK&OkAboutDialogBase@> Synergy About SynergyAboutDialogBase52V4><>UnknownAboutDialogBase5@AVO:Version:AboutDialogBase8815@VBL 4VN, I> 28:>=CTBLAOChoose the action to performActionDialogBase 0;0HBC20==O 4V9Configure ActionActionDialogBase60:@V?8B8 :C@A>@ 70 5:@0=><Lock cursor to screenActionDialogBase00B8A=VBL 30@OGC :;02VHCPress a hotkeyActionDialogBaseL0B8A=VBL B0 2V4?CABVBL 30@OGC :;02VHCPress and release a hotkeyActionDialogBase2V4?CABVBL 30@OGC :;02VHCRelease a hotkeyActionDialogBase$5@5EV4 2 =0?@O<:CSwitch in directionActionDialogBase 5@5EV4 =0 5:@0=Switch to screenActionDialogBase.&O 4VO 28:>=CTBLAO :>;8This action is performed whenActionDialogBase2=87downActionDialogBase 2;V2>leftActionDialogBase 28<:.offActionDialogBase 22V<:.onActionDialogBase*BV;L:8 =0 F8E 5:@0=0Eonly on these screensActionDialogBase 2?@02>rightActionDialogBase030@OG0 :;02VH0 =0B8A=CB0the hotkey is pressedActionDialogBase030@OG0 :;02VH0 2V4?CI5=0the hotkey is releasedActionDialogBase?5@5:;NG8B8toggleActionDialogBase 225@EupActionDialogBaseJ:06VBL A?5F8DV:0FVN 30@OG>W :;02VHV:'Enter the specification for the hotkey:HotkeyDialogBase0@OG0 :;02VH0HotkeyHotkeyDialogBase 5403C20==O&Edit MainWindow$09;&File MainWindow>?><>30&Help MainWindow !B0@B&Start MainWindow!B>?&Stop MainWindow V:=>&Window MainWindow <p>"5?5@ 4>ABC?=0 25@AVO %1, <a href="%2">2V42V409B5 A09B</a> 4;O >=>2;5==O.</p>C

Version %1 is now available, visit website.

 MainWindowB:06VBL D09; :>=DV3C@0FVW Synergy!Browse for a synergys config file MainWindowZ5<>6;82> 74V9A=8B8 70?8A C D09; :>=DV3C@0FVWCannot write configuration file MainWindowF5?@028;L=5 V<'O D09;C :>=DV3C@0FVWConfiguration filename invalid MainWindowJ5<>6;82> 715@53B8 D09; :>=DV3C@0FVW.%Could not save configuration to file. MainWindow*<'O E>ABC =5 2:070=5Hostname is empty MainWindow”C4L ;0A:0 2:06VBL V<'O E>ABC 4> O:>3> ?>28=5= ?@8T4=0B8AO :;VT=B Synergy.?Please fill in a hostname for the synergy client to connect to. MainWindow<@>3@0<0 =5 <>65 1CB8 70?CI5=0Program can not be started MainWindow615@53B8 :>=DV3C@0FVN O:...Save configuration as... MainWindow$>A8;:0 715@565==O Save failed MainWindowF5 7=0945=> 6>4=>3> :;VT=B0 SynergySynergy client not found MainWindow"Synergy 7C?8=5=>.Synergy is not running. MainWindow"Synergy 70?CI5=>.Synergy is starting. MainWindow>5<>6;82> 7=09B8 A5@25@ SynergySynergy server not found MainWindowÈSynergy 7025@H8;0AL =5>GV:C20=> 7 :>4>< of %1.<br><br>C4L ;0A:0 ?5@53;O=LB5 log-70?8A8 4;O 45B0;59.fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow:Synergy 7025@H5=0 7 ?><8;:0<8 Synergy terminated with an error MainWindowd8:>=C20=>W ?@>3@0<8 4;O :;VT=B0 Synergy =5 VA=CT.5The executable for the synergy client does not exist. MainWindowd8:>=C20=>W ?@>3@0<8 4;O A5@25@C Synergy =5 VA=CT.5The executable for the synergy server does not exist. MainWindow8:>=C20=89 D0; <br><br>%1<br><br>=5 <>65 70?CAB8B8AL, E>G0 2V= VA=CT. C4L ;0A:0, ?5@52V@B5 G8 C 0A 4>AB0B=L> ?@02 4;O 70?CA:C FVTW ?@>3@0<8.ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow´"8<G0A>289 D09; :>=DV3C@0FVW, O:89 =5>1EV4=89 4;O 70?CA:C Synergy 701;>:>20=89 4;O 70?8AC.NThe temporary configuration file required to start synergy can not be written. MainWindow52V4><>Unknown MainWindow¸8 =5 70?>2=8;8 ?@028;L=89 D09; :>=DV3C@0FVW 4;O A5@25@0 Synergy . 060TB5 7@>18B8 F5 70@07?You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow@> Synergy&About Synergy...MainWindowBase0AB>AC20B8&ApplyMainWindowBase5@53;O4... &Browse...MainWindowBase~;VT=B (8:>@8AB>2C20B8 :;02V0BC@C B0 <8H:C V=H>3> :><?'NB5@0):4&Client (use another computer's keyboard and mouse):MainWindowBase$$09; :>=DV3C@0FVW:&Configuration file:MainWindowBase*0;0HBC20B8 A5@25@...&Configure Server...MainWindowBase0:@8B8&QuitMainWindowBase~!5@25@ (28:>@8AB>2CNBLAO :;02V0BC@0 B0 <8H:0 FL>3> :><?'NB5@0):3&Server (share this computer's mouse and keyboard):MainWindowBase !B0@B&StartMainWindowBase20;0HBC20B8 V=B5@0:B82=>:Configure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase. 5403C20B8 =0;0HBC20==O Edit settingsMainWindowBase>3LogMainWindowBase0:@8B8QuitMainWindowBase >B>2>ReadyMainWindowBase0?CAB8B8RunMainWindowBase&0?CAB8B8 ><VG=8:0 Run WizardMainWindowBase>:070B8 AB0BCA S&how StatusMainWindowBaseC?8=8B8S&topMainWindowBase615@53B8 :>=DV3C@0FVN O:...Save configuration &as...MainWindowBase|15@53B8 V=B5@0:B82=> 735=5@>20=C :>=DV3C@0FVN A5@25@0 C D09;.@Save the interactively generated server configuration to a file.MainWindowBase0;0HBC20==OSettingsMainWindowBaseC?8=8B8StopMainWindowBaseSynergySynergyMainWindowBase52V4><>UnknownMainWindowBaseB8:>@8AB0B8 VA=CNGC :>=DV3C@0FVN:Use existing configuration:MainWindowBase57 =0728UnnamedNewScreenWidget\>=DV3C@0FVO Synergy (*.conf);;AV D09;8 (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObjectZ>=DV3C@0FVO Synergy (*.sgc);;AV D09;8 (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject^!8AB5<=89 B@59 =54>ABC?=89, 74V9A=NTBLAO 28EV4.%System tray is unavailable, quitting.QObject&<'O 5:@0=C ?>@>6=TScreen name is emptyScreenSettingsDialog¨<O 4;O 5:@0=C =5 <>65 1CB8 ?>@>6=V<. C4L ;0A:0 2:06VBL V<'O 01> 2V4<V=VBL 4V0;>3.SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialog >40B8&AddScreenSettingsDialogBase Ctrl:&Ctrl:ScreenSettingsDialogBase5@B2V :CB8 &Dead cornersScreenSettingsDialogBase$V:A0FVO&FixesScreenSettingsDialogBase(;02VHV-<>48DV:0B>@8&Modifier keysScreenSettingsDialogBase840;8B8&RemoveScreenSettingsDialogBase Shift:&Shift:ScreenSettingsDialogBaseA524>=V<8A&liasesScreenSettingsDialogBaseAlt:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase86=V9 ;V289 Bottom-leftScreenSettingsDialogBase86=V9 ?@0289 Bottom-rightScreenSettingsDialogBase >7<V@ :CB0: Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBase&$V:AC20B8 CAPS LOCKFix CAPS LOCK keyScreenSettingsDialogBase$$V:AC20B8 NUM LOCKFix NUM LOCK keyScreenSettingsDialogBase*$V:AC20B8 SCROLL LOCKFix SCROLL LOCK keyScreenSettingsDialogBase8$V:AC20B8 XTest 4;O XineramaFix XTest for XineramaScreenSettingsDialogBase Meta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBase >4=0NoneScreenSettingsDialogBase Super:S&uper:ScreenSettingsDialogBase<'O 5:@0=C: Screen &name:ScreenSettingsDialogBase&0;0HBC20==O 5:@0=CScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase5@E=V9 ;V289Top-leftScreenSettingsDialogBase5@E=V9 ?@0289 Top-rightScreenSettingsDialogBaseô<center>:@0=: <b>%1</b></center><br>>42V9=89 :;V: 4;O @5403C20==O =0;0HBC20=L<br>5@5BO3=VBL 5:@0= C :>H8: 4;O 2840;5==Oo
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel86=V9 ;V289 &Bottom-leftServerConfigDialogBase25@52V@OB8 :;VT=BV2 :>6=V&Check clients everyServerConfigDialogBase5@B2V :CB8 &Dead cornersServerConfigDialogBase 5403C20==O&EditServerConfigDialogBase0@OGV :;02VHV&HotkeysServerConfigDialogBase >289&NewServerConfigDialogBase ?FVW&OptionsServerConfigDialogBase840;8B8&RemoveServerConfigDialogBase5@5EV4&SwitchServerConfigDialogBaseVWA&ctionsServerConfigDialogBase<>40B:>2V =0;0HBC20==O A5@25@0Advanced server settingsServerConfigDialogBase86=V9 ?@0289 Bottom-ri&ghtServerConfigDialogBasen0;0HBC20B8 @>7B0HC20==O :>=DV3C@0FVW A5@25@0 Synergy .:Configure the layout of your synergy server configuration.ServerConfigDialogBase >7<V@ :CB0: Cor&ner Size:ServerConfigDialogBaseX5 70;8H0B8 2V:=> A5@25@0 725@EC (C Windows)0Don't take &foreground window on Windows serversServerConfigDialogBaseN5@5BO3=VBL 5:@0= C :>H8: 4;O 2840;5==O9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBase>5@5BO3C9B5 =>2V 5:@0=8 =0 AVB:C 01> ?5@5AC209B5 VA=CNGV <VAFO<8. 5@5BO3=VBL 5:@0= 2 :>H8:, I>1 2840;8B8 9>3>. >42V9=89 :;V: =0 5:@0=V 4;O 9>3> =0;0HBC20==O.•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasen5@5BO3=VBL FN :=>?:C =0 AVB:C, I>1 4>40B8 =>289 5:@0=.1Drag this button to the grid to add a new screen.ServerConfigDialogBase 5403C20B8E&ditServerConfigDialogBase0@OGV :;02VHVHotkeysServerConfigDialogBase >289Ne&wServerConfigDialogBase840;8B8Re&moveServerConfigDialogBase.!8=E@>=V7C20B8 70AB02:8S&ynchronize screen saversServerConfigDialogBase :@0=8 V 72'O7:8Screens and linksServerConfigDialogBase(>=DV3C@0FVO A5@25@0Server ConfigurationServerConfigDialogBase05@5EV4 ?VA;O >GV:C20==OSwitch &after waitingServerConfigDialogBaseX5@5EV4 ?VA;O ?>42V9=>3> =0B8A:0==O ?@>BO3><Switch on double &tap withinServerConfigDialogBase5@E=V9 ;V289 To&p-leftServerConfigDialogBase5@E=V9 ?@0289 Top-rig&htServerConfigDialogBaseT8:>@8AB>2C20B8 @V4=V =0;0HBC20==O :C@A>@CUse &relative mouse movesServerConfigDialogBase<A5:msServerConfigDialogBase,15@53B8 log-D09; 2...Save log file to...SettingsDialog>40B:>2> &AdvancedSettingsDialogBaseF2B><0B8G=> 70?CA:0B8 A5@25@/:;VT=B"&Automatically start server/clientSettingsDialogBaseN@8E>2C20B8 :>;8 A5@25@/:;VT=B 70?CI5=>&Hide when server/client startsSettingsDialogBase=B5@D59A: &Interface:SettingsDialogBase V25=L 70?8AC:&Logging level:SettingsDialogBaseN0?CA:0B8 Synergy ?VA;O 2E>4C 2 A8AB5<C&Start Synergy after logging inSettingsDialogBase5@53;O4... Browse...SettingsDialogBase0;03>465==ODebugSettingsDialogBase0;03>465==O1Debug1SettingsDialogBase0;03>465==O2Debug2SettingsDialogBase><8;:0ErrorSettingsDialogBase=D>@<0FVOInfoSettingsDialogBase"0?8AC20B8 C D0;: Log to file:SettingsDialogBase 0?8ALoggingSettingsDialogBase@8<VB:0NoteSettingsDialogBase >@B:P&ort:SettingsDialogBase<'O 5:@0=C: Sc&reen name:SettingsDialogBase0;0HBC20==OSettingsSettingsDialogBase>?5@5465==OWarningSettingsDialogBase4C4L ;0A:0, >15@VBL >?FVN.Please select an option. SetupWizard(AB0=>2;5==O Synergy Setup Synergy SetupWizard<;VT=B (4>40B8 2 =0;0HBC20==O)&Client (add to setup)SetupWizardBase4!5@25@ (=>25 =0;0HBC20==O)&Server (new setup)SetupWizardBase"!5@25@ G8 :;VT=B?Server or Client?SetupWizardBase(AB0=>2;5==O Synergy Setup SynergySetupWizardBaseŠ&5 ?5@H89 :><?'NB5@, O:89 8 =0;0HB>2CTB5. 0H0 :;02V0BC@0 ?@8T4=0=V 4> FL>3> :><?'NB5@0. &5 4>72>;8BL ?5@5<VI0B8 :C@A>@ 7 FL>3> 5:@0=C =0 V=HV. # 20H><C =0;0HBC20==V ?>28=5= 1CB8 ;8H5 >48= A5@25@.ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase,8 265 =0;0HBC20;8 A5@25@. &59 :><?NB5@ 1C45 28:>@8AB>2C20B8 :;02V0BC@C B0 <8H:C A5@25@0. # 20H><C =0;0HBC20==V <>6=0 28:>@8AB>2C20B8 1030B> :;VT=BV2.˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBase52V4><>UnknownVersionCheckerˆ ý) ÿý, synergy-1.4.12-Source/src/gui/res/lang/gui_uk.ts0000600000175000017500000014177012006005561021434 0ustar synergysynergy AboutDialogBase About Synergy Про Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Ðевідомо Version: ВерÑÑ–Ñ: &Ok OK ActionDialogBase Configure Action ÐÐ°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ Ð´Ñ–Ð¹ Choose the action to perform Виберіть дію, що виконуєтьÑÑ Press a hotkey ÐатиÑніть гарÑчу клавішу Release a hotkey ВідпуÑÑ‚Ñ–Ñ‚ÑŒ гарÑчу клавішу Press and release a hotkey ÐатиÑніть та відпуÑÑ‚Ñ–Ñ‚ÑŒ гарÑчу клавішу only on these screens тільки на цих екранах Switch to screen Перехід на екран Switch in direction Перехід в напрÑмку left вліво right вправо up вверх down вниз Lock cursor to screen Закріпити курÑор за екраном toggle переключити on ввімк. off вимк. This action is performed when Ð¦Ñ Ð´Ñ–Ñ Ð²Ð¸ÐºÐ¾Ð½ÑƒÑ”Ñ‚ÑŒÑÑ ÐºÐ¾Ð»Ð¸ the hotkey is pressed гарÑча клавіша натиÑнута the hotkey is released гарÑча клавіша відпущена HotkeyDialogBase Hotkey ГарÑча клавіша Enter the specification for the hotkey: Вкажіть Ñпецифікацію гарÑчої клавіші: MainWindow &Start Старт &File Файл &Edit Ð ÐµÐ´Ð°Ð³ÑƒÐ²Ð°Ð½Ð½Ñ &Window Вікно &Help Допомога <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>Тепер доÑтупна верÑÑ–Ñ %1, <a href="%2">відвідайте Ñайт</a> Ð´Ð»Ñ Ð¾Ð½Ð¾Ð²Ð»ÐµÐ½Ð½Ñ.</p> Program can not be started Програма не може бути запущена The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Виконуваний фал <br><br>%1<br><br>не може запуÑтитиÑÑŒ, хоча він Ñ–Ñнує. Будь лаÑка, перевірте чи у Ð’Ð°Ñ Ð´Ð¾Ñтатньо прав Ð´Ð»Ñ Ð·Ð°Ð¿ÑƒÑку цієї програми. Synergy client not found Ðе знайдено жодного клієнта Synergy The executable for the synergy client does not exist. Виконуваної програми Ð´Ð»Ñ ÐºÐ»Ñ–Ñ”Ð½Ñ‚Ð° Synergy не Ñ–Ñнує. Hostname is empty Ім'Ñ Ñ…Ð¾Ñту не вказане Please fill in a hostname for the synergy client to connect to. Будь лаÑка вкажіть ім'Ñ Ñ…Ð¾Ñту до Ñкого повинен приєднатиÑÑ ÐºÐ»Ñ–Ñ”Ð½Ñ‚ Synergy. Cannot write configuration file Ðеможливо здійÑнити Ð·Ð°Ð¿Ð¸Ñ Ñƒ файл конфігурації The temporary configuration file required to start synergy can not be written. ТимчаÑовий файл конфігурації, Ñкий необхідний Ð´Ð»Ñ Ð·Ð°Ð¿ÑƒÑку Synergy заблокований Ð´Ð»Ñ Ð·Ð°Ð¿Ð¸Ñу. Configuration filename invalid Ðеправильне ім'Ñ Ñ„Ð°Ð¹Ð»Ñƒ конфігурації You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Ви не заповнили правильний файл конфігурації Ð´Ð»Ñ Ñервера Synergy . Бажаєте зробити це зараз? Synergy server not found Ðеможливо знайти Ñервер Synergy The executable for the synergy server does not exist. Виконуваної програми Ð´Ð»Ñ Ñерверу Synergy не Ñ–Ñнує. Synergy terminated with an error Synergy завершена з помилками Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergy завершилаÑÑŒ неочікувано з кодом of %1.<br><br>Будь лаÑка переглÑньте log-запиÑи Ð´Ð»Ñ Ð´ÐµÑ‚Ð°Ð»ÐµÐ¹. &Stop Стоп service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy запущено. Synergy is not running. Synergy зупинено. Unknown Ðевідомо Browse for a synergys config file Вкажіть файл конфігурації Synergy Save configuration as... Зберегти конфігурацію Ñк... Save failed ПоÑилка Ð·Ð±ÐµÑ€ÐµÐ¶ÐµÐ½Ð½Ñ Could not save configuration to file. Ðеможливо зберегти файл конфігурації. MainWindowBase Synergy Synergy Screen name: Unknown Ðевідомо &Server IP: &Start Старт &Server (share this computer's mouse and keyboard): Сервер (викориÑтовуютьÑÑ ÐºÐ»Ð°Ð²Ñ–Ð°Ñ‚ÑƒÑ€Ð° та мишка цього комп'ютера): Use existing configuration: ВикориÑтати Ñ–Ñнуючу конфігурацію: &Configuration file: Файл конфігурації: &Browse... ПереглÑд... Configure interactively: Ðалаштувати інтерактивно: &Configure Server... Ðалаштувати Ñервер... &Client (use another computer's keyboard and mouse): Клієнт (ВикориÑтовувати клавіатуру та мишку іншого комп'ютера): Ready Готово Log Лог &Apply ЗаÑтоÑувати &Elevate IP addresses: &About Synergy... Про Synergy &Quit Закрити Quit Закрити Ctrl+Q Ctrl+Q Run ЗапуÑтити Ctrl+S Ctrl+S S&top Зупинити Stop Зупинити Ctrl+T Ctrl+T S&how Status Показати ÑÑ‚Ð°Ñ‚ÑƒÑ Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... Зберегти конфігурацію Ñк... Save the interactively generated server configuration to a file. Зберегти інтерактивно згенеровану конфігурацію Ñервера у файл. Ctrl+Alt+S Ctrl+Alt+S Settings ÐÐ°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ Edit settings Редагувати Ð½Ð°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ Run Wizard ЗапуÑтити Помічника NewScreenWidget Unnamed Без назви QObject Synergy Configurations (*.sgc);;All files (*.*) ÐšÐ¾Ð½Ñ„Ñ–Ð³ÑƒÑ€Ð°Ñ†Ñ–Ñ Synergy (*.sgc);;Ð’ÑÑ– файли (*.*) Synergy Configurations (*.conf);;All files (*.*) ÐšÐ¾Ð½Ñ„Ñ–Ð³ÑƒÑ€Ð°Ñ†Ñ–Ñ Synergy (*.conf);;Ð’ÑÑ– файли (*.*) System tray is unavailable, quitting. СиÑтемний трей недоÑтупний, здійÑнюєтьÑÑ Ð²Ð¸Ñ…Ñ–Ð´. ScreenSettingsDialog Screen name is empty Ім'Ñ ÐµÐºÑ€Ð°Ð½Ñƒ порожнє The name for a screen can not be empty. Please fill in a name or cancel the dialog. Ð†Ð¼Ñ Ð´Ð»Ñ ÐµÐºÑ€Ð°Ð½Ñƒ не може бути порожнім. Будь лаÑка вкажіть ім'Ñ Ð°Ð±Ð¾ відмініть діалог. ScreenSettingsDialogBase Screen Settings ÐÐ°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ ÐµÐºÑ€Ð°Ð½Ñƒ Screen &name: Ім'Ñ ÐµÐºÑ€Ð°Ð½Ñƒ: A&liases ПÑевдоніми &Add Додати &Remove Видалити &Modifier keys Клавіші-модифікатори &Shift: Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None Жодна &Ctrl: Ctrl: Al&t: Alt: M&eta: Meta: S&uper: Super: &Dead corners Мертві кути Top-left Верхній лівий Top-right Верхній правий Bottom-left Ðижній лівий Bottom-right Ðижній правий Corner Si&ze: Розмір кута: &Fixes ФікÑÐ°Ñ†Ñ–Ñ Fix CAPS LOCK key ФікÑувати CAPS LOCK Fix NUM LOCK key ФікÑувати NUM LOCK Fix SCROLL LOCK key ФікÑувати SCROLL LOCK Fix XTest for Xinerama ФікÑувати XTest Ð´Ð»Ñ Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>Екран: <b>%1</b></center><br>Подвійний клік Ð´Ð»Ñ Ñ€ÐµÐ´Ð°Ð³ÑƒÐ²Ð°Ð½Ð½Ñ Ð½Ð°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½ÑŒ<br>ПеретÑгніть екран у кошик Ð´Ð»Ñ Ð²Ð¸Ð´Ð°Ð»ÐµÐ½Ð½Ñ ServerConfigDialogBase Server Configuration ÐšÐ¾Ð½Ñ„Ñ–Ð³ÑƒÑ€Ð°Ñ†Ñ–Ñ Ñервера Screens and links Екрани Ñ– зв'Ñзки Drag a screen from the grid to the trashcan to remove it. ПеретÑгніть екран у кошик Ð´Ð»Ñ Ð²Ð¸Ð´Ð°Ð»ÐµÐ½Ð½Ñ Configure the layout of your synergy server configuration. Ðалаштувати Ñ€Ð¾Ð·Ñ‚Ð°ÑˆÑƒÐ²Ð°Ð½Ð½Ñ ÐºÐ¾Ð½Ñ„Ñ–Ð³ÑƒÑ€Ð°Ñ†Ñ–Ñ— Ñервера Synergy . Drag this button to the grid to add a new screen. ПеретÑгніть цю кнопку на Ñітку, щоб додати новий екран. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. ПеретÑгуйте нові екрани на Ñітку або переÑувайте Ñ–Ñнуючі міÑцÑми. ПеретÑгніть екран в кошик, щоб видалити його. Подвійний клік на екрані Ð´Ð»Ñ Ð¹Ð¾Ð³Ð¾ налаштуваннÑ. Hotkeys ГарÑчі клавіші &Hotkeys ГарÑчі клавіші &New Ðовий &Edit Ð ÐµÐ´Ð°Ð³ÑƒÐ²Ð°Ð½Ð½Ñ &Remove Видалити A&ctions Дії Ne&w Ðовий E&dit Редагувати Re&move Видалити Advanced server settings Додаткові Ð½Ð°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ Ñервера &Switch Перехід Switch &after waiting Перехід піÑÐ»Ñ Ð¾Ñ‡Ñ–ÐºÑƒÐ²Ð°Ð½Ð½Ñ ms мÑек Switch on double &tap within Перехід піÑÐ»Ñ Ð¿Ð¾Ð´Ð²Ñ–Ð¹Ð½Ð¾Ð³Ð¾ натиÑÐºÐ°Ð½Ð½Ñ Ð¿Ñ€Ð¾Ñ‚Ñгом &Options Опції &Check clients every ПеревірÑти клієнтів кожні Use &relative mouse moves ВикориÑтовувати рідні Ð½Ð°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ ÐºÑƒÑ€Ñору S&ynchronize screen savers Синхронізувати заÑтавки Don't take &foreground window on Windows servers Ðе залишати вікно Ñервера зверху (у Windows) &Dead corners Мертві кути To&p-left Верхній лівий Top-rig&ht Верхній правий &Bottom-left Ðижній лівий Bottom-ri&ght Ðижній правий Cor&ner Size: Розмір кута: SettingsDialog Save log file to... Зберегти log-файл в... SettingsDialogBase Settings ÐÐ°Ð»Ð°ÑˆÑ‚ÑƒÐ²Ð°Ð½Ð½Ñ &Advanced Додатково Sc&reen name: Ім'Ñ ÐµÐºÑ€Ð°Ð½Ñƒ: P&ort: Порт: &Interface: ІнтерфейÑ: &Start Synergy after logging in ЗапуÑкати Synergy піÑÐ»Ñ Ð²Ñ…Ð¾Ð´Ñƒ в ÑиÑтему &Automatically start server/client Ðвтоматично запуÑкати Ñервер/клієнт &Hide when server/client starts Приховувати коли Ñервер/клієнт запущено Logging Ð—Ð°Ð¿Ð¸Ñ &Process mode: Service Desktop (legacy) &Logging level: Рівень запиÑу: Log to file: ЗапиÑувати у фал: Browse... ПереглÑд... Error Помилка Warning ÐŸÐ¾Ð¿ÐµÑ€ÐµÐ´Ð¶ÐµÐ½Ð½Ñ Note Примітка Info Ð†Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ñ–Ñ Debug ÐÐ°Ð»Ð°Ð³Ð¾Ð´Ð¶ÐµÐ½Ð½Ñ Debug1 ÐалагодженнÑ1 Debug2 ÐалагодженнÑ2 &Startup SetupWizard Setup Synergy Ð’ÑÑ‚Ð°Ð½Ð¾Ð²Ð»ÐµÐ½Ð½Ñ Synergy Please select an option. Будь лаÑка, оберіть опцію. SetupWizardBase Setup Synergy Ð’ÑÑ‚Ð°Ð½Ð¾Ð²Ð»ÐµÐ½Ð½Ñ Synergy Server or Client? Сервер чи клієнт? &Server (new setup) Сервер (нове налаштуваннÑ) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. Це перший комп'ютер, Ñкий Ви налаштовуєте. Ваша клавіатура приєднані до цього комп'ютера. Це дозволить переміщати курÑор з цього екрану на інші. У вашому налаштуванні повинен бути лише один Ñервер. &Client (add to setup) Клієнт (додати в налаштуваннÑ) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. Ви вже налаштували Ñервер. Цей компютер буде викориÑтовувати клавіатуру та мишку Ñервера. У вашому налаштуванні можна викориÑтовувати багато клієнтів. VersionChecker Unknown Ðевідомо synergy-1.4.12-Source/src/gui/res/lang/gui_vi.qm0000600000175000017500000000013712006005561021411 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBÏi=Thông tinInfoSettingsDialogBasesynergy-1.4.12-Source/src/gui/res/lang/gui_vi.ts0000600000175000017500000012354312006005561021431 0ustar synergysynergy AboutDialogBase About Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown Version: &Ok ActionDialogBase Configure Action Choose the action to perform Press a hotkey Release a hotkey Press and release a hotkey only on these screens Switch to screen Switch in direction left right up down Lock cursor to screen toggle on off This action is performed when the hotkey is pressed the hotkey is released HotkeyDialogBase Hotkey Enter the specification for the hotkey: MainWindow &Start &File &Edit &Window &Help <p>Version %1 is now available, <a href="%2">visit website</a>.</p> Program can not be started The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. Synergy client not found The executable for the synergy client does not exist. Hostname is empty Please fill in a hostname for the synergy client to connect to. Cannot write configuration file The temporary configuration file required to start synergy can not be written. Configuration filename invalid You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? Synergy server not found The executable for the synergy server does not exist. Synergy terminated with an error Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. &Stop service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy is not running. Unknown Browse for a synergys config file Save configuration as... Save failed Could not save configuration to file. MainWindowBase Synergy Screen name: Unknown &Server IP: &Start &Server (share this computer's mouse and keyboard): Use existing configuration: &Configuration file: &Browse... Configure interactively: &Configure Server... &Client (use another computer's keyboard and mouse): Ready Log &Apply &Elevate IP addresses: &About Synergy... &Quit Quit Ctrl+Q Run Ctrl+S S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard NewScreenWidget Unnamed QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy Configurations (*.conf);;All files (*.*) System tray is unavailable, quitting. ScreenSettingsDialog Screen name is empty The name for a screen can not be empty. Please fill in a name or cancel the dialog. ScreenSettingsDialogBase Screen Settings Screen &name: A&liases &Add &Remove &Modifier keys &Shift: Shift Ctrl Alt Meta Super None &Ctrl: Al&t: M&eta: S&uper: &Dead corners Top-left Top-right Bottom-left Bottom-right Corner Si&ze: &Fixes Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it ServerConfigDialogBase Server Configuration Screens and links Drag a screen from the grid to the trashcan to remove it. Configure the layout of your synergy server configuration. Drag this button to the grid to add a new screen. Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Hotkeys &Hotkeys &New &Edit &Remove A&ctions Ne&w E&dit Re&move Advanced server settings &Switch Switch &after waiting ms Switch on double &tap within &Options &Check clients every Use &relative mouse moves S&ynchronize screen savers Don't take &foreground window on Windows servers &Dead corners To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Cor&ner Size: SettingsDialog Save log file to... SettingsDialogBase Settings &Advanced Sc&reen name: P&ort: &Interface: &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts Logging &Process mode: Service Desktop (legacy) &Logging level: Log to file: Browse... Error Warning Note Info Thông tin Debug Debug1 Debug2 &Startup SetupWizard Setup Synergy Please select an option. SetupWizardBase Setup Synergy Server or Client? &Server (new setup) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. &Client (add to setup) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. VersionChecker Unknown synergy-1.4.12-Source/src/gui/res/lang/gui_zh-CN.qm0000600000175000017500000003523212006005561021716 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBˆ^ÇÀ"+[H4YSW”Y¾uÆ›§¤D´Ç#€«ŒNÏ.Æ<¡,G×)VEeV¥/hŒ¾«`׶ÞC+Ôp*»Ø*»#*Ð%*ì0(+Œ++«`yGË(šGízJ¹·.L™b.–UÛ`¯X·¹éYïÔ ^ZÆ šxýô<Áx.€äËëØ>&lóòö}Sx;N-du> §(Z Ä= î Ñnbjh°¯4 .º¾þïÒÉâþ!GEv. -_þøeë)m¨w9Ȫ¸úy­Ãôº¨”Pº¨”Õ˜ Œ;H}ÏH¦”! O é0±O é1â]à/2ÂVEÕ¸Ó iC,ŽUN™‡Yu:.õl_”#}× çŠ*Ä+&šl®p¨öé"Œ«Žøˆ«½«ò«'«›¡.0«›¢.c° Î&òÄ:Ó¶Ä:Ó"Ùäöžnç¹Ô,/ñ$Z-&ö±É©üÊJï"QJM-iz/—Ë@dÜl ˜攄C(ÿ1‹( n]4.d Ð@TyÝ{ã#³€¡ª§œ6>#žŽÄ ÎzÎç>ÓéJž-Êëêžõ £3\=ñT Hk@d"O‚ïÛŠÁ„®µÞ%óãC+/lY1D}F•)7€Ân ŸC+a»ó$÷¸‰q Öj( IÞ_– Jz/Ê kö#%é v®~( ”*M -5{ OøŽš P¢n* dö¹S ~5Ó)¾ ¤hÞ3² ±¥zW Ö„~ ± ȹ >î2% aº®+· |ßÚØ ŒFån ŒFå#ê žýZ¦ ® ¸$ ÈcÄ+û àKG¡ RVŽn RVŽl RVŽ: RVŽ4Ê R÷® ™ Tƒä¶ V½4j šÚ §|*,ð «c$V »s¨ »s0 Äcþ*— ÞF¤Í ^®° /óæ 4pÄ*ì dÙŒ i!Îþ rù+ zkÙ3 ‰P09 àx4$Þ è]^  ^0k=‰¥>ä %©ôžƒG ’r X/åŽè7å0kC(Îk£#I®ú.%Ó> åò¬Š ýù0ði4øxn[š&OkAboutDialogBaseQsNŽSynergy About SynergyAboutDialogBaseg*wåUnknownAboutDialogBaserHg,ÿVersion:AboutDialogBase bé‰bgˆLv„ˆLN:Choose the action to performActionDialogBaseˆLN:‘MnConfigure ActionActionDialogBase•[šc”ˆNŽ\O^ULock cursor to screenActionDialogBase c N NN*•.Press a hotkeyActionDialogBasec N NN*•.q6Tg~_Press and release a hotkeyActionDialogBaseg~_c •.Release a hotkeyActionDialogBasee¹TRcbSwitch in directionActionDialogBase RcbR0\O^USwitch to screenActionDialogBase_S & &eöT/u(kdˆLN:This action is performed whenActionDialogBaseN e¹downActionDialogBase]æleftActionDialogBaseyu(offActionDialogBaseT/u(onActionDialogBaseNÅNÅW(ÙN›\O^UN only on these screensActionDialogBaseSóO§rightActionDialogBase pí•.ˆ«c N the hotkey is pressedActionDialogBase pí•.ˆ«g~_the hotkey is releasedActionDialogBaseRcbtoggleActionDialogBaseN e¹upActionDialogBase“Qepí•.v„‹ôfÿ'Enter the specification for the hotkey:HotkeyDialogBasepí•.HotkeyHotkeyDialogBase‘&Edit MainWindowe‡Nö&File MainWindow^.R©&Help MainWindow_YË&Start MainWindowP\kb&Stop MainWindowz—Sã&Window MainWindowN<p>rHg, %1 Sïu(, <a href="%2">‹¿•îQzÙ</a>.</p>C

Version %1 is now available, visit website.

 MainWindowmO‰ÈSynergy‘Mne‡Nö!Browse for a synergys config file MainWindowN €ýQ™Qe‘Mne‡NöCannot write configuration file MainWindow‘Mne‡NöT —^lÕConfiguration filename invalid MainWindowN €ýOÝ[X‘MnR0e‡Nö%Could not save configuration to file. MainWindow N;g:T N:zzHostname is empty MainWindow0‹÷N:Synergy[¢b7znNN*u(NŽÞc¥v„N;g:T ?Please fill in a hostname for the synergy client to connect to. MainWindow z ^eàlÕT/R¨Program can not be started MainWindowOÝ[X‘MnR0e‡NöSave configuration as... MainWindowOÝ[XY1% Save failed MainWindowg*b~R0Synergy[¢b7zïSynergy client not found MainWindowSynergyl¡g ЈLSynergy is not running. MainWindowSynergykcW(T/R¨Synergy is starting. MainWindowg*b~R0Synergyg R¡zïSynergy server not found MainWindowTSynergyaY~ÈkbЈLÿ QúNãx %10<br><br>‹÷gåw “Qúeå_×N†‰ã‹æ`Å0fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindowSynergyVà•~ÈkbЈL Synergy terminated with an error MainWindow(Synergy[¢b7zïv„SïbgˆLz ^N [XW(05The executable for the synergy client does not exist. MainWindow&Synergyg R¡zïSïbgˆLz ^N [XW(05The executable for the synergy server does not exist. MainWindownSïbgˆLz ^<br><br>%1<br><br>l¡g bRŸÐˆLÿ †}q6z ^g,Ž«[XW(0‹÷hÀgåO`f/T&g ЈLkdz ^v„gC–P0ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow,T/R¨Synergyb@—v„N4eö‘Mne‡NöN SïQ™0NThe temporary configuration file required to start synergy can not be written. MainWindowg*wåUnknown MainWindowLO`l¡g N:Synergyg R¡znNN*Sïu(v„‘Mne‡Nö0—‰s°W(mO‰È‘Mne‡NöTÿYou have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindowQsNŽSynergy &&About Synergy...MainWindowBase^”u(&ApplyMainWindowBasemO‰È & &Browse...MainWindowBase([¢b7zïÿOu(SæNSð‹¡{—g:v„•.vØTŒŸ hÿ ÿ4&Client (use another computer's keyboard and mouse):MainWindowBase ‘Mne‡Nöÿ&Configuration file:MainWindowBase ‹¾ng R¡zï &&Configure Server...MainWindowBaseQú&QuitMainWindowBase(g R¡zïÿQqN«ÙSð‹¡{—g:N v„Ÿ hTŒ•.vØÿ ÿ3&Server (share this computer's mouse and keyboard):MainWindowBase_YË&StartMainWindowBase N¤N’‘MnÿConfigure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase‘‹¾n Edit settingsMainWindowBaseeå_×LogMainWindowBaseQúQuitMainWindowBaseQÆY[ŒkÕReadyMainWindowBaseЈLRunMainWindowBaseЈLT[ü Run WizardMainWindowBasef>y:r¶` S&how StatusMainWindowBaseP\kbS&topMainWindowBase OÝ[X‘MnR0 &Save configuration &as...MainWindowBase"OÝ[XÇN¤N’‘Mnubv„‘MnR0e‡Nö0@Save the interactively generated server configuration to a file.MainWindowBase‹¾nSettingsMainWindowBaseP\kbStopMainWindowBaseSynergySynergyMainWindowBaseg*wåUnknownMainWindowBaseOu(]òg v„‘MnÿUse existing configuration:MainWindowBaseg*T}T UnnamedNewScreenWidget>Synergy‘Mne‡Nö(*.conf);;b@g e‡Nö (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject<Synergy‘Mne‡Nö(*.sgc);;b@g e‡Nö (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObject|û~ßbXvØN Sïu(ÿ z ^Qú0%System tray is unavailable, quitting.QObject \O^UT N:zzScreen name is emptyScreenSettingsDialog.\O^UT N €ýN:zz0‹÷XkQeNN*T [Wb€Qs•í[ù‹ÝhF0SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogmûR &AddScreenSettingsDialogBase Ctrlÿ&Ctrl:ScreenSettingsDialogBasek{‰Ò &Dead cornersScreenSettingsDialogBaseOîe9&FixesScreenSettingsDialogBaseOîe9c •.&Modifier keysScreenSettingsDialogBaseR –d&RemoveScreenSettingsDialogBase Shift:&Shift:ScreenSettingsDialogBaseR+T A&liasesScreenSettingsDialogBaseAltÿAl&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase]æN ‰Ò Bottom-leftScreenSettingsDialogBaseSóN ‰Ò Bottom-rightScreenSettingsDialogBasek{‰ÒY'\ Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBaseOîY caps lock•.Fix CAPS LOCK keyScreenSettingsDialogBaseOîY num lock•.Fix NUM LOCK keyScreenSettingsDialogBaseOîY scroll lock•.Fix SCROLL LOCK keyScreenSettingsDialogBase OîY Xineramav„XTestFix XTest for XineramaScreenSettingsDialogBase MetaÿM&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseeàNoneScreenSettingsDialogBase SuperÿS&uper:ScreenSettingsDialogBase\O^UT ÿ Screen &name:ScreenSettingsDialogBase\O^U‹¾nScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase…~§SuperScreenSettingsDialogBase]æN ‰ÒTop-leftScreenSettingsDialogBaseSóN ‰Ò Top-rightScreenSettingsDialogBaset<center>\O^U‹¾n: <b>%1</b></center><br>SÌQûNåOîe9‹¾n<br>\\O^UbÖR0^Ÿ~¸{Ógeyû–do
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel]æN ‰Ò &Bottom-leftServerConfigDialogBase[¢b7zïhÀgåThg&Check clients everyServerConfigDialogBasek{‰Ò &Dead cornersServerConfigDialogBase‘&EditServerConfigDialogBasepí•.&HotkeysServerConfigDialogBasee°^ú&NewServerConfigDialogBase ˜y&OptionsServerConfigDialogBaseR –d&RemoveServerConfigDialogBaseRcb&SwitchServerConfigDialogBaseˆLN:A&ctionsServerConfigDialogBaseg R¡zïšØ~§‹¾nAdvanced server settingsServerConfigDialogBaseSóN ‰Ò Bottom-ri&ghtServerConfigDialogBase(‹¾nSynergyg R¡zï‘Mnv„\O^U^\@0:Configure the layout of your synergy server configuration.ServerConfigDialogBasek{‰ÒY'\ Cor&ner Size:ServerConfigDialogBase(N ‰yûR¨RMSðz—SãW(Windowsg R¡VhN 0Don't take &foreground window on Windows serversServerConfigDialogBase"NÎh<[PN-bÖR¨\O^UR0WƒW>hvÛˆLR –d09Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBaselbÖR¨\O^UÿVþhÿ R0QhhvÛˆLR –d0 SÌQû\O^U‘Qv‹¾n0•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBase bÖR¨kdc ”®R0h<[PN-ÛˆLmûR \O^U01Drag this button to the grid to add a new screen.ServerConfigDialogBase‘E&ditServerConfigDialogBasepí•.HotkeysServerConfigDialogBasee°XžNe&wServerConfigDialogBaseR –dRe&moveServerConfigDialogBase T ke\O^UOÝb¤S&ynchronize screen saversServerConfigDialogBase \O^UTŒ€Tc¥Screens and linksServerConfigDialogBase g R¡zï‘MnServer ConfigurationServerConfigDialogBase {I_…TRcbSwitch &after waitingServerConfigDialogBaseSÌQûtapRcbSwitch on double &tap withinServerConfigDialogBase]æN ‰Ò To&p-leftServerConfigDialogBaseSóN ‰Ò Top-rig&htServerConfigDialogBaseOu(vøQsv„Ÿ hR¨O\Use &relative mouse movesServerConfigDialogBaseOÝ[Xeå_×e‡Nö &Save log file to...SettingsDialogšØ~§ &AdvancedSettingsDialogBaseêR¨T/R¨g R¡zï/[¢b7zï"&Automatically start server/clientSettingsDialogBaseT/R¨g R¡zï/[¢b7zïTêR¨–…Ï&Hide when server/client startsSettingsDialogBaseuL—b &Interface:SettingsDialogBaseeå_×{I~§&Logging level:SettingsDialogBase v{_U|û~ßTêR¨T/R¨Synergy&Start Synergy after logging inSettingsDialogBasemO‰È & Browse...SettingsDialogBaseŒ‹ÕDebugSettingsDialogBaseŒ‹Õ1Debug1SettingsDialogBaseŒ‹Õ2Debug2SettingsDialogBase•‹ïErrorSettingsDialogBaseOá`oInfoSettingsDialogBase ‹°_UR0e‡Nö Log to file:SettingsDialogBaseeå_׋°_ULoggingSettingsDialogBaselèaNoteSettingsDialogBasezïSãÿP&ort:SettingsDialogBase\O^UT ÿ Sc&reen name:SettingsDialogBase‹¾nSettingsSettingsDialogBase‹fTJWarningSettingsDialogBase‹÷ béNN* ˜yPlease select an option. SetupWizard‹¾nSynergy Setup Synergy SetupWizard[¢b7zïÿR Qe•.Ÿ QqN«‹¾nÿ &Client (add to setup)SetupWizardBaseg R¡zïÿe°‹¾nÿ &Server (new setup)SetupWizardBase"ÿkd‹¡{—g:O\N:ÿ g R¡zïØf/[¢b7zïÿServer or Client?SetupWizardBase‹¾nSynergy Setup SynergySetupWizardBaseŒÙf/O`‘Mnv„{,NSð‹¡{—g:0O`v„•.vØTŒŸ hÞc¥W(kd‹¡{—g:N 0kddÍO\\QA‹¸O`\Ÿ hÿc”ˆÿ NÎNN*\O^UyûR0SæNN*‹¡{—g:v„\O^U0Sê€ý‹¾nNN*g R¡zï0ÝThis is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup.SetupWizardBase\O`]ò~Ï‹¾n[ŒN†g R¡zï0ÙNSðf/O``óÇg R¡zïv„•.vØTŒŸ hgec§R6v„‹¡{—g:0SïNå‘MnYN*[¢b7zï0˜You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup.SetupWizardBaseg*wåUnknownVersionCheckersynergy-1.4.12-Source/src/gui/res/lang/gui_zh-CN.ts0000600000175000017500000013220312006005561021723 0ustar synergysynergy AboutDialogBase About Synergy 关于Synergy <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown 未知 Version: 版本： &Ok 确定 ActionDialogBase Configure Action 行为é…ç½® Choose the action to perform 选择è¦æ‰§è¡Œçš„行为 Press a hotkey 按下一个键 Release a hotkey æ¾å¼€æŒ‰é”® Press and release a hotkey 按下一个键然åŽæ¾å¼€ only on these screens 仅仅在这些å±å¹•ä¸Š Switch to screen 切æ¢åˆ°å±å¹• Switch in direction æ–¹å‘åˆ‡æ¢ left å·¦ right å³ä¾§ up 上方 down 下方 Lock cursor to screen é”定指针于å±å¹• toggle åˆ‡æ¢ on å¯ç”¨ off ç¦ç”¨ This action is performed when 当……时å¯ç”¨æ­¤è¡Œä¸º the hotkey is pressed 热键被按下 the hotkey is released 热键被æ¾å¼€ HotkeyDialogBase Hotkey 热键 Enter the specification for the hotkey: 输入热键的说明： MainWindow &Start 开始 &File 文件 &Edit 编辑 &Window çª—å£ &Help 帮助 <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>版本 %1 å¯ç”¨, <a href="%2">访问网站</a>.</p> Program can not be started 程åºæ— æ³•å¯åŠ¨ The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. å¯æ‰§è¡Œç¨‹åº<br><br>%1<br><br>没有æˆåŠŸè¿è¡Œï¼Œè™½ç„¶ç¨‹åºæœ¬èº«å­˜åœ¨ã€‚请检查你是å¦æœ‰è¿è¡Œæ­¤ç¨‹åºçš„æƒé™ã€‚ Synergy client not found 未找到Synergy客户端 The executable for the synergy client does not exist. Synergy客户端的å¯æ‰§è¡Œç¨‹åºä¸å­˜åœ¨ã€‚ Hostname is empty 主机å为空 Please fill in a hostname for the synergy client to connect to. 请为Synergy客户端设置一个用于连接的主机å Cannot write configuration file ä¸èƒ½å†™å…¥é…置文件 The temporary configuration file required to start synergy can not be written. å¯åŠ¨Synergy所需的临时é…置文件ä¸å¯å†™ã€‚ Configuration filename invalid é…置文件åéžæ³• You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? 你没有为SynergyæœåŠ¡ç«¯è®¾ç½®ä¸€ä¸ªå¯ç”¨çš„é…置文件。需è¦çŽ°åœ¨æµè§ˆé…置文件å—？ Synergy server not found 未找到SynergyæœåŠ¡ç«¯ The executable for the synergy server does not exist. SynergyæœåŠ¡ç«¯å¯æ‰§è¡Œç¨‹åºä¸å­˜åœ¨ã€‚ Synergy terminated with an error Synergy因错终止è¿è¡Œ Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergyæ„外终止è¿è¡Œï¼Œé€€å‡ºä»£ç  %1。<br><br>请查看输出日志了解详情。 &Stop åœæ­¢ service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy正在å¯åŠ¨ Synergy is not running. Synergy没有è¿è¡Œ Unknown 未知 Browse for a synergys config file æµè§ˆSynergyé…置文件 Save configuration as... ä¿å­˜é…置到文件 Save failed ä¿å­˜å¤±è´¥ Could not save configuration to file. ä¸èƒ½ä¿å­˜é…置到文件 MainWindowBase Synergy Synergy Screen name: Unknown 未知 &Server IP: &Start 开始 &Server (share this computer's mouse and keyboard): æœåŠ¡ç«¯ï¼ˆå…±äº«è¿™å°è®¡ç®—机上的鼠标和键盘）： Use existing configuration: 使用已有的é…置： &Configuration file: é…置文件： &Browse... æµè§ˆâ€¦ Configure interactively: 交互é…置： &Configure Server... 设置æœåŠ¡ç«¯â€¦ &Client (use another computer's keyboard and mouse): 客户端（使用å¦ä¸€å°è®¡ç®—机的键盘和鼠标）： Ready 准备完毕 Log 日志 &Apply 应用 &Elevate IP addresses: &About Synergy... 关于Synergy… &Quit 退出 Quit 退出 Ctrl+Q Ctrl+Q Run è¿è¡Œ Ctrl+S Ctrl+S S&top åœæ­¢ Stop åœæ­¢ Ctrl+T Ctrl+T S&how Status æ˜¾ç¤ºçŠ¶æ€ Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... ä¿å­˜é…置到… Save the interactively generated server configuration to a file. ä¿å­˜é€šè¿‡äº¤äº’é…置生æˆçš„é…置到文件。 Ctrl+Alt+S Ctrl+Alt+S Settings 设置 Edit settings 编辑设置 Run Wizard è¿è¡Œå‘导 NewScreenWidget Unnamed 未命å QObject Synergy Configurations (*.sgc);;All files (*.*) Synergyé…置文件(*.sgc);;所有文件 (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergyé…置文件(*.conf);;所有文件 (*.*) System tray is unavailable, quitting. 系统托盘ä¸å¯ç”¨ï¼Œç¨‹åºé€€å‡ºã€‚ ScreenSettingsDialog Screen name is empty å±å¹•å为空 The name for a screen can not be empty. Please fill in a name or cancel the dialog. å±å¹•åä¸èƒ½ä¸ºç©ºã€‚请填入一个å字或者关闭对è¯æ¡†ã€‚ ScreenSettingsDialogBase Screen Settings å±å¹•è®¾ç½® Screen &name: å±å¹•å： A&liases 别å &Add 添加 &Remove 删除 &Modifier keys 修改按键 &Shift: Shift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super 超级 None æ—  &Ctrl: Ctrl： Al&t: Alt： M&eta: Meta： S&uper: Super： &Dead corners 死角 Top-left 左上角 Top-right å³ä¸Šè§’ Bottom-left 左下角 Bottom-right å³ä¸‹è§’ Corner Si&ze: æ­»è§’å¤§å° &Fixes 修改 Fix CAPS LOCK key ä¿®å¤caps locké”® Fix NUM LOCK key ä¿®å¤num locké”® Fix SCROLL LOCK key ä¿®å¤scroll locké”® Fix XTest for Xinerama ä¿®å¤Xineramaçš„XTest ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>å±å¹•è®¾ç½®: <b>%1</b></center><br>åŒå‡»ä»¥ä¿®æ”¹è®¾ç½®<br>å°†å±å¹•æ‹–到废纸篓æ¥ç§»é™¤ ServerConfigDialogBase Server Configuration æœåŠ¡ç«¯é…ç½® Screens and links å±å¹•å’Œè”接 Drag a screen from the grid to the trashcan to remove it. 从格å­ä¸­æ‹–动å±å¹•åˆ°åžƒåœ¾æ¡¶è¿›è¡Œåˆ é™¤ã€‚ Configure the layout of your synergy server configuration. 设置SynergyæœåŠ¡ç«¯é…置的å±å¹•å¸ƒå±€ã€‚ Drag this button to the grid to add a new screen. 拖动此按钮到格å­ä¸­è¿›è¡Œæ·»åŠ å±å¹•ã€‚ Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. 拖动å±å¹•ï¼ˆå›¾æ ‡ï¼‰åˆ°ç½‘格中或者移动已ç»åœ¨ç½‘格中的å±å¹•çš„ä½ç½®ã€‚ 拖动å±å¹•åˆ°åžƒåœ¾æ¡¶è¿›è¡Œåˆ é™¤ã€‚ åŒå‡»å±å¹•ç¼–辑其设置。 Hotkeys 热键 &Hotkeys 热键 &New 新建 &Edit 编辑 &Remove 删除 A&ctions 行为 Ne&w 新增 E&dit 编辑 Re&move 删除 Advanced server settings æœåŠ¡ç«¯é«˜çº§è®¾ç½® &Switch åˆ‡æ¢ Switch &after waiting 等待åŽåˆ‡æ¢ ms Switch on double &tap within åŒå‡»tapåˆ‡æ¢ &Options 选项 &Check clients every 客户端检查周期 Use &relative mouse moves 使用相关的鼠标动作 S&ynchronize screen savers åŒæ­¥å±å¹•ä¿æŠ¤ Don't take &foreground window on Windows servers ä¸è¦ç§»åŠ¨å‰å°çª—å£åœ¨WindowsæœåŠ¡å™¨ä¸Š &Dead corners 死角 To&p-left 左上角 Top-rig&ht å³ä¸Šè§’ &Bottom-left 左下角 Bottom-ri&ght å³ä¸‹è§’ Cor&ner Size: æ­»è§’å¤§å° SettingsDialog Save log file to... ä¿å­˜æ—¥å¿—文件… SettingsDialogBase Settings 设置 &Advanced 高级 Sc&reen name: å±å¹•å： P&ort: 端å£ï¼š &Interface: ç•Œé¢ &Start Synergy after logging in 登录系统åŽè‡ªåŠ¨å¯åŠ¨Synergy &Automatically start server/client 自动å¯åŠ¨æœåŠ¡ç«¯/客户端 &Hide when server/client starts å¯åŠ¨æœåŠ¡ç«¯/客户端åŽè‡ªåŠ¨éšè— Logging 日志记录 &Process mode: Service Desktop (legacy) &Logging level: 日志等级 Log to file: 记录到文件 Browse... æµè§ˆâ€¦ Error 错误 Warning 警告 Note æ³¨æ„ Info ä¿¡æ¯ Debug 调试 Debug1 调试1 Debug2 调试2 &Startup SetupWizard Setup Synergy 设置Synergy Please select an option. 请选择一个选项 SetupWizardBase Setup Synergy 设置Synergy Server or Client? （此计算机作为）æœåŠ¡ç«¯è¿˜æ˜¯å®¢æˆ·ç«¯ï¼Ÿ &Server (new setup) æœåŠ¡ç«¯ï¼ˆæ–°è®¾ç½®ï¼‰ This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. 这是你é…置的第一å°è®¡ç®—机。你的键盘和鼠标连接在此计算机上。此æ“作将å…许你将鼠标（指针）从一个å±å¹•ç§»åˆ°å¦ä¸€ä¸ªè®¡ç®—机的å±å¹•ã€‚åªèƒ½è®¾ç½®ä¸€ä¸ªæœåŠ¡ç«¯ã€‚ &Client (add to setup) 客户端（加入键鼠共享设置） You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. ä½ å·²ç»è®¾ç½®å®Œäº†æœåŠ¡ç«¯ã€‚这一å°æ˜¯ä½ æƒ³é€šè¿‡æœåŠ¡ç«¯çš„键盘和鼠标æ¥æŽ§åˆ¶çš„计算机。å¯ä»¥é…置多个客户端。 VersionChecker Unknown 未知 synergy-1.4.12-Source/src/gui/res/lang/gui_zh-TW.qm0000600000175000017500000003540512006005561021752 0ustar synergysynergy<¸dÊÍ!¿`¡½ÝBC,^»À+[H4}SWzY¾ûuƧ¤.´Ç#Ü«ŒpÏ/W<¡bG×)JVE›V¥/ûŒ¤«`¹¶Þ9+Ôd*»Î*»#o*Ð%ö*ì0+Œ+«`oGË(ÞGíz/J¹·.‘L™b/'UÛ`•X·¹ÏYïÔ °ZÆ ìxýô0Áx.fäÁëØ>&Âóæö}S^;N-ùu> ¥(Z ¸= î ÇnbjJ°¯4 .º¾þéÒÉàþ!›Ev. /_þÞeë)³¨w9²ª¸úc­Ãòº¨”Fº¨”½˜ ‚;H}ÕH¦”!aO é1DO é2a]à/ÅÂVEÅ¸Ó liC-UN™©Yu:/†l_”}× ÉŠ*Ä+~šl®n¨öé"Ü«Žør«§«Ü««›¡.Á«›¢.ô° Î'DÄ:Ó´Ä:Ó#3äöž`ç¹Ô,Àñ$Z-¹ö±ÉüÊJ"QJA-iz0*Ë@d³Ül Ô攄%(ÿ2( nc4.d!(@Tyÿ{ã$€¡ª“œ6> žŽÄ ÎzêÎç>ÃéJž.Wëêžß £3F=ñT @k@d"Ÿ‚ïÁŠÁ„¢µÞ%éãC)/lY1Ñ}F•)}€Ân&ŸC+¹»ó$é÷¸‰U Öj IÞ_„ Jz0[ kö#&? v®~(f ”*— -5u OøŽŠ P¢n*N dö¹= ~5Ó* ¤hÞ4 ±¥zE Ö„~ ¹ ȹä >î2¤ aº®,B |ßÚ ( ŒFåj ŒFå$F žýZ¢ ® ¸$| ÈcÄ,Œ àKG— RVŽt RVŽZ RVŽ RVŽ5- R÷® ‘ Tƒä˜ V½4\ šÚ£ §|*-} «c$² »sŠ »s0™ Äcþ*á ÞF¤ï ^®® /óö 4pÄ+D dÙ® i!Îø rù+ zkÙ/ ‰P0Ì àx4%: è]^  ^0þ=‰£>ä %ýôžƒ1 ’r Z/åŽÒ7åRkC)k£#£®ú.%xÓ> áò¬Š,ýù1ƒi5[xº[š&OkAboutDialogBase•Üe¼Synergy... About SynergyAboutDialogBaseg*wåUnknownAboutDialogBaserHg,ÿVersion:AboutDialogBasexdljW÷ˆLv„RÕO\Choose the action to performActionDialogBaseŠ-[šRÕO\Configure ActionActionDialogBase“–[šóLock cursor to screenActionDialogBase c N _ëcw“uPress a hotkeyActionDialogBasec N _Œe>•‹_ëcw“uPress and release a hotkeyActionDialogBase e>•‹_ëcw“uRelease a hotkeyActionDialogBaseRcÛe¹TSwitch in directionActionDialogBaseRcÛóSwitch to screenActionDialogBaseW÷ˆLkdRÕO\ÿ uvThis action is performed whenActionDialogBaseN downActionDialogBase]æleftActionDialogBase•Ü•‰offActionDialogBase•‹U_onActionDialogBaseSêW(N R‡¢^U˜oy:only on these screensActionDialogBaseSórightActionDialogBase ]òc N _ëcw“uthe hotkey is pressedActionDialogBase ]òe>•‹_ëcw“uthe hotkey is releasedActionDialogBaseIcÛtoggleActionDialogBaseN upActionDialogBase8Qe_ëcw“uŠ-[šÿ'Enter the specification for the hotkey:HotkeyDialogBase_ëcw“uHotkeyHotkeyDialogBase}è/&Edit MainWindowj”hH&File MainWindow^kR©&Help MainWindowU_RÕ&Start MainWindowP\kb&Stop MainWindow‰–z—&Window MainWindowR<p>rHg, %1 ]òSïO›N ÿ <a href="%2">Š*UO}²zÙ</a>0</p>C

Version %1 is now available, visit website.

 MainWindowp‰½NåxdÇŠ-[šj”!Browse for a synergys config file MainWindowq!lÕ[ëQeŠ-[šj”Cannot write configuration file MainWindowŠ-[šj”j”hHT z1q!eHConfiguration filename invalid MainWindowq!lÕQ2[XŠ-[šój”hH0%Could not save configuration to file. MainWindow–ûfT z1N €ýzzv}Hostname is empty MainWindow,ŠË8Qesynergy[¢b6zï‰#c¥v„–ûfT z10?Please fill in a hostname for the synergy client to connect to. MainWindow g*€ýU_RÕz ^Program can not be started MainWindowQ2[XŠ-[šó...Save configuration as... MainWindowQ2[XY1eW Save failed MainWindowb~N R0Synergy[¢b6zïSynergy client not found MainWindowSynergyN W(KO\N-0Synergy is not running. MainWindowSynergykcW(U_RÕN-0Synergy is starting. MainWindowb~N R0SynergyO:g VhSynergy server not found MainWindowVSynergyGR0“/Š¤ÿ P\kbKO\ÿ “/Š¤x¼ %1<br><br>Šs}0`ÅlÁSïSÀŠ“e劌0fSynergy terminated unexpectedly with an exit code of %1.

Please see the log output for details. MainWindow SynergyGR0“/Š¤ÿ P\kbKO\ Synergy terminated with an error MainWindow"Synergy[¢b6zïW÷ˆLj”N [XW(05The executable for the synergy client does not exist. MainWindow"SynergyO:g VhW÷ˆLj”N [XW(05The executable for the synergy server does not exist. MainWindow`g*€ýbRŸU_RÕW÷ˆLj”<br><br>%1<br><br>ÿ Q{¡Šrj”hH[XW(ÿ ŠËj¢gåW÷ˆLz ^k –PŠ-[š0ŸThe executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. MainWindow*q!lÕ[ëQeu(NåU_RÕsynergyv„f«[XŠ-[šj”NThe temporary configuration file required to start synergy can not be written. MainWindowg*wåUnknown MainWindowDO`l’g 8Qeg eHv„synergyO:g VhŠ-[šj”ÿ O`—‰sþW(p‰½Š-[šj”UÎÿYou have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? MainWindow•Üe¼Synergy...&About Synergy...MainWindowBaseaÉu(&ApplyMainWindowBase p‰½... &Browse...MainWindowBase&[¢b6zïÿOu(SæNSð–ûfv„nÑŸ TŒ“uväÿ ÿ4&Client (use another computer's keyboard and mouse):MainWindowBaseŠ-[šj”ÿ&Configuration file:MainWindowBaseŠ-[šO:g Vh...&Configure Server...MainWindowBase–â•‹&QuitMainWindowBase"O:g VhÿRN«Sð–ûfv„nÑŸ TŒ“uväÿ 3&Server (share this computer's mouse and keyboard):MainWindowBaseU_RÕ&StartMainWindowBase N’RÕW0Š-[šÿConfigure interactively:MainWindowBaseCtrl+Alt+S Ctrl+Alt+SMainWindowBase Ctrl+HCtrl+HMainWindowBase Ctrl+QCtrl+QMainWindowBase Ctrl+SCtrl+SMainWindowBase Ctrl+TCtrl+TMainWindowBase}è/ Edit settingsMainWindowBaseŠ“LogMainWindowBase–â•‹QuitMainWindowBasen–P™ReadyMainWindowBaseW÷ˆLRunMainWindowBase W÷ˆLŠ-[š|¾—H Run WizardMainWindowBase˜oy:rÀaK S&how StatusMainWindowBaseP\kbS&topMainWindowBaseQ2[XŠ-[šó...Save configuration &as...MainWindowBaseQ2[XRÕaKubv„Š-[šój”hH0@Save the interactively generated server configuration to a file.MainWindowBaseŠ-[šSettingsMainWindowBaseP\kbStopMainWindowBaseSynergySynergyMainWindowBaseg*wåUnknownMainWindowBaseOu(‚ g Š-[šj”ÿUse existing configuration:MainWindowBaseg*T}T UnnamedNewScreenWidget@Synergy Š-[šj” (*.conf);;b@g j”hH (*.*)0Synergy Configurations (*.conf);;All files (*.*)QObject>Synergy Š-[šj” (*.sgc);;b@g j”hH (*.*)/Synergy Configurations (*.sgc);;All files (*.*)QObjectg*€ýSÖ_—|û}q]åQwkÿ kcW(–â•‹0%System tray is unavailable, quitting.QObject˜oy:T z1N €ýzzv}Screen name is emptyScreenSettingsDialog(˜oy:T z1N €ýzzv}ÿ ŠË8QeT z1bSÖmˆŠ-[š0SThe name for a screen can not be empty. Please fill in a name or cancel the dialog.ScreenSettingsDialogmûR &AddScreenSettingsDialogBase&undefinedCtrl:&Ctrl:ScreenSettingsDialogBasek{‰Ò &Dead cornersScreenSettingsDialogBaseOîkc&FixesScreenSettingsDialogBaseRŸ€ý“u&Modifier keysScreenSettingsDialogBaseyû–d&RemoveScreenSettingsDialogBase &undefinedShift:&Shift:ScreenSettingsDialogBaseR%T A&liasesScreenSettingsDialogBase&undefinedl&t:Al&t:ScreenSettingsDialogBaseAltAltScreenSettingsDialogBase]æN  Bottom-leftScreenSettingsDialogBaseSóN  Bottom-rightScreenSettingsDialogBase ‰Ò„=Y'\ÿ Corner Si&ze:ScreenSettingsDialogBaseCtrlCtrlScreenSettingsDialogBaseOîkcCAPS LOCK“uFix CAPS LOCK keyScreenSettingsDialogBaseOîkcNUM LOCK“uFix NUM LOCK keyScreenSettingsDialogBaseOîkcSCROLL LOCK“uFix SCROLL LOCK keyScreenSettingsDialogBase OîkcXineramav„XTestFix XTest for XineramaScreenSettingsDialogBase&undefined&eta:M&eta:ScreenSettingsDialogBaseMetaMetaScreenSettingsDialogBaseNoneNoneScreenSettingsDialogBase &undefined&uper:S&uper:ScreenSettingsDialogBase ˜oy:T z1ÿ Screen &name:ScreenSettingsDialogBase˜oy:Š-[šScreen SettingsScreenSettingsDialogBase ShiftShiftScreenSettingsDialogBase SuperSuperScreenSettingsDialogBase]æN Top-leftScreenSettingsDialogBaseSóN  Top-rightScreenSettingsDialogBasep<center>‡¢^U: <b>%1</b></center><br>–ÙdÊNå}è/Š-[š<br>bÖRÕ‡¢^UóWƒW>{RNåyû–do
Screen: %1

Double click to edit settings
Drag screen to the trashcan to remove itScreenSetupModel]æN e¹ &Bottom-leftServerConfigDialogBasekÏ–”Y\fB•“j¢gåT[¢b6zï&Check clients everyServerConfigDialogBasek{‰Ò &Dead cornersServerConfigDialogBase}è/&EditServerConfigDialogBase_ëcw“u&HotkeysServerConfigDialogBasee°^ú&NewServerConfigDialogBasex˜&OptionsServerConfigDialogBaseyû–d&RemoveServerConfigDialogBaseRcÛ&SwitchServerConfigDialogBaseRÕO\A&ctionsServerConfigDialogBaseO:g Vh2–ŽŠ-[šAdvanced server settingsServerConfigDialogBaseSóN e¹ Bottom-ri&ghtServerConfigDialogBase Š-[šsynergyO:g VhŠ-[šOH\@:Configure the layout of your synergy server configuration.ServerConfigDialogBase ‰Ò„=Y'\ÿ Cor&ner Size:ServerConfigDialogBase(W(WindowsO:g VhN N-N srSÖRMfo‰–z—0Don't take &foreground window on Windows serversServerConfigDialogBase_ž}²h{RNåyû–d9Drag a screen from the grid to the trashcan to remove it.ServerConfigDialogBasebbÖRÕe°‡¢^Uó}²h{RNåyû–d0 –Ùdʇ¢^UNå}è/Š-[š0•Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings.ServerConfigDialogBasebÖRÕkdc ’ó}²h AboutDialogBase About Synergy 關於Synergy... <p> Keyboard and mouse sharing application. Cross platform and open source.<br /><br /> Copyright © 2001-2012 Chris Schoeneman, Nick Bolton, Volker Lanz, Sorin Sbarnea.<br /><br /> Synergy is released under the GNU General Public License (GPLv2).<br /><br /> Synergy is based on CosmoSynergy by Richard Lee and Adam Feder.<br /> The Synergy GUI is based on QSynergy by Volker Lanz.<br /><br /> Visit our website for help and info (synergy-foss.org). </p> Unknown 未知 Version: 版本： &Ok 確定 ActionDialogBase Configure Action 設定動作 Choose the action to perform é¸æ“‡è¦åŸ·è¡Œçš„動作 Press a hotkey 按下快æ·éµ Release a hotkey 放開快æ·éµ Press and release a hotkey 按下後放開快æ·éµ only on these screens åªåœ¨ä¸‹åˆ—螢幕顯示 Switch to screen 切æ›è‡³ Switch in direction 切æ›æ–¹å‘ left å·¦ right å³ up 上 down 下 Lock cursor to screen 鎖定至 toggle è½‰æ› on é–‹å•Ÿ off 關閉 This action is performed when 執行此動作，當 the hotkey is pressed 已按下快æ·éµ the hotkey is released 已放開快æ·éµ HotkeyDialogBase Hotkey å¿«æ·éµ Enter the specification for the hotkey: 輸入快æ·éµè¨­å®šï¼š MainWindow &Start å•Ÿå‹• &File 檔案 &Edit 編輯 &Window 視窗 &Help 幫助 <p>Version %1 is now available, <a href="%2">visit website</a>.</p> <p>版本 %1 å·²å¯ä¾›ä¸‹è¼‰ï¼Œ<a href="%2">訪å•ç¶²ç«™</a>。</p> Program can not be started æœªèƒ½å•Ÿå‹•ç¨‹åº The executable<br><br>%1<br><br>could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program. 未能æˆåŠŸå•Ÿå‹•åŸ·è¡Œæª”<br><br>%1<br><br>，儘管該檔案存在，請檢查執行程åºæ¬Šé™è¨­å®šã€‚ Synergy client not found 找ä¸åˆ°Synergy客戶端 The executable for the synergy client does not exist. Synergy客戶端執行檔ä¸å­˜åœ¨ã€‚ Hostname is empty 電腦å稱ä¸èƒ½ç©ºç™½ Please fill in a hostname for the synergy client to connect to. 請輸入synergy客戶端è¦é€£æŽ¥çš„電腦å稱。 Cannot write configuration file 無法寫入設定檔 The temporary configuration file required to start synergy can not be written. 無法寫入用以啟動synergy的暫存設定檔 Configuration filename invalid 設定檔檔案å稱無效 You have not filled in a valid configuration file for the synergy server. Do you want to browse for the configuration file now? 你沒有輸入有效的synergy伺æœå™¨è¨­å®šæª”，你需è¦ç¾åœ¨ç€è¦½è¨­å®šæª”嗎？ Synergy server not found 找ä¸åˆ°Synergy伺æœå™¨ The executable for the synergy server does not exist. Synergy伺æœå™¨åŸ·è¡Œæª”ä¸å­˜åœ¨ã€‚ Synergy terminated with an error Synergyé‡åˆ°éŒ¯èª¤ï¼Œåœæ­¢é‹ä½œ Synergy terminated unexpectedly with an exit code of %1.<br><br>Please see the log output for details. Synergyé‡åˆ°éŒ¯èª¤ï¼Œåœæ­¢é‹ä½œï¼ŒéŒ¯èª¤ç¢¼ %1<br><br>詳細情æ³å¯åƒè€ƒè¨˜éŒ„日誌。 &Stop åœæ­¢ service mode desktop mode Synergy is running (%1). Elevate Synergy Are you sure you want to elevate Synergy? This allows Synergy to interact with elevated processes and the UAC dialog, but can cause problems with non-elevated processes. Elevate Synergy only if you really need to. Synergy is starting. Synergy正在啟動中。 Synergy is not running. Synergyä¸åœ¨é‹ä½œä¸­ã€‚ Unknown 未知 Browse for a synergys config file ç€è¦½ä»¥é¸æ“‡è¨­å®šæª” Save configuration as... 儲存設定至... Save failed 儲存失敗 Could not save configuration to file. 無法儲存設定至檔案。 MainWindowBase Synergy Synergy Screen name: Unknown 未知 &Server IP: &Start å•Ÿå‹• &Server (share this computer's mouse and keyboard): 伺æœå™¨ï¼ˆåˆ†äº«é€™å°é›»è…¦çš„滑鼠和éµç›¤ï¼‰ Use existing configuration: 使用舊有設定檔： &Configuration file: 設定檔： &Browse... ç€è¦½... Configure interactively: 互動地設定： &Configure Server... 設定伺æœå™¨... &Client (use another computer's keyboard and mouse): 客戶端（使用å¦ä¸€å°é›»è…¦çš„滑鼠和éµç›¤ï¼‰ï¼š Ready 準備 Log 記錄 &Apply 應用 &Elevate IP addresses: &About Synergy... 關於Synergy... &Quit 離開 Quit 離開 Ctrl+Q Ctrl+Q Run 執行 Ctrl+S Ctrl+S S&top åœæ­¢ Stop åœæ­¢ Ctrl+T Ctrl+T S&how Status 顯示狀態 Ctrl+H Ctrl+H &Hide Hide &Show Show Save configuration &as... 儲存設定至... Save the interactively generated server configuration to a file. 儲存動態生æˆçš„設定至檔案。 Ctrl+Alt+S Ctrl+Alt+S Settings 設定 Edit settings 編輯 Run Wizard åŸ·è¡Œè¨­å®šç²¾éˆ NewScreenWidget Unnamed 未命å QObject Synergy Configurations (*.sgc);;All files (*.*) Synergy 設定檔 (*.sgc);;所有檔案 (*.*) Synergy Configurations (*.conf);;All files (*.*) Synergy 設定檔 (*.conf);;所有檔案 (*.*) System tray is unavailable, quitting. 未能å–得系統工具欄，正在離開。 ScreenSettingsDialog Screen name is empty 顯示å稱ä¸èƒ½ç©ºç™½ The name for a screen can not be empty. Please fill in a name or cancel the dialog. 顯示å稱ä¸èƒ½ç©ºç™½ï¼Œè«‹è¼¸å…¥å稱或å–消設定。 ScreenSettingsDialogBase Screen Settings 顯示設定 Screen &name: 顯示å稱： A&liases 別å &Add 添加 &Remove 移除 &Modifier keys åŠŸèƒ½éµ &Shift: &undefinedShift: Shift Shift Ctrl Ctrl Alt Alt Meta Meta Super Super None None &Ctrl: &undefinedCtrl: Al&t: &undefinedl&t: M&eta: &undefined&eta: S&uper: &undefined&uper: &Dead corners 死角 Top-left 左上 Top-right å³ä¸Š Bottom-left 左下 Bottom-right å³ä¸‹ Corner Si&ze: 角è½å¤§å°ï¼š &Fixes 修正 Fix CAPS LOCK key 修正CAPS LOCKéµ Fix NUM LOCK key 修正NUM LOCKéµ Fix SCROLL LOCK key 修正SCROLL LOCKéµ Fix XTest for Xinerama 修正Xineramaçš„XTest ScreenSetupModel <center>Screen: <b>%1</b></center><br>Double click to edit settings<br>Drag screen to the trashcan to remove it <center>螢幕: <b>%1</b></center><br>雙擊以編輯設定<br>拖動螢幕至垃圾筒以移除 ServerConfigDialogBase Server Configuration 伺æœå™¨è¨­å®š Screens and links èž¢å¹•å’Œé€£çµ Drag a screen from the grid to the trashcan to remove it. 從網格上拖動螢幕至垃圾筒以移除 Configure the layout of your synergy server configuration. 設定synergy伺æœå™¨è¨­å®šä½ˆå±€ Drag this button to the grid to add a new screen. 拖動此按鈕至網格以添加新螢幕 Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. 拖動新螢幕至網格或在網格上拖動螢幕以改變佈局ä½ç½®ã€‚ 拖動螢幕至垃圾筒以移除。 雙擊螢幕以編輯設定。 Hotkeys å¿«æ·éµ &Hotkeys å¿«æ·éµ &New 新建 &Edit 編輯 &Remove 移除 A&ctions 動作 Ne&w 新建 E&dit 編輯 Re&move 移除 Advanced server settings 伺æœå™¨é€²éšŽè¨­å®š &Switch åˆ‡æ› Switch &after waiting 切æ›å‰ç¨å¾Œ ms 微秒 Switch on double &tap within æ–¼å¤šå°‘æ™‚é–“å…§é›™æ“Šæ»‘é¼ é€²è¡Œåˆ‡æ› &Options é¸é … &Check clients every æ¯éš”多少時間檢查å„客戶端 Use &relative mouse moves 使用滑鼠相å°ç§»å‹•æ–¹å¼ S&ynchronize screen savers åŒæ­¥èž¢å¹•ä¿è­·ç¨‹å¼ Don't take &foreground window on Windows servers 在Windows伺æœå™¨ä¸Šä¸­ä¸ç²å–å‰æ™¯è¦–窗 &Dead corners 死角 To&p-left 左上方 Top-rig&ht å³ä¸Šæ–¹ &Bottom-left 左下方 Bottom-ri&ght å³ä¸‹æ–¹ Cor&ner Size: 角è½å¤§å°ï¼š SettingsDialog Save log file to... 儲存記錄至檔案... SettingsDialogBase Settings 設定 &Advanced 進階 Sc&reen name: 顯示å稱： P&ort: ç«¯å£ &Interface: 網絡界é¢ï¼š &Start Synergy after logging in 登入後啟動Synergy &Automatically start server/client 自動啟動伺æœå™¨/客戶端 &Hide when server/client starts 伺æœå™¨/å®¢æˆ¶ç«¯å•Ÿå‹•æ™‚éš±è— Logging 記錄日誌 &Process mode: Service Desktop (legacy) &Logging level: 記錄等級： Log to file: 記錄至檔案： Browse... ç€è¦½... Error 錯誤 Warning 警告 Note 通知 Info è¨Šæ¯ Debug åµéŒ¯ Debug1 åµéŒ¯1 Debug2 åµéŒ¯2 &Startup SetupWizard Setup Synergy 設定Synergy Please select an option. 請挑é¸ä¸€é¸é …。 SetupWizardBase Setup Synergy 設定Synergy Server or Client? 伺æœå™¨ç«¯æˆ–客戶端？ &Server (new setup) 伺æœå™¨ç«¯(新設定) This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. 這是你所設定的第一å°é›»è…¦ï¼Œä½ å°‡ä½¿ç”¨æ­¤å°é›»è…¦çš„éµç›¤èˆ‡æ»‘鼠來控制其他客戶端電腦。設定中åªå®¹è¨±æœ‰ä¸€å°ä¼ºæœå™¨ç«¯é›»è…¦ã€‚ &Client (add to setup) 客戶端(添加新設定) You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. You have already set up a server. This a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. 你已設定伺æœå™¨ç«¯ã€‚你將使用伺æœå™¨ç«¯é›»è…¦çš„éµç›¤èˆ‡æ»‘鼠來控制其他客戶端。你å¯è¨­å®šå¤šå°é›»è…¦ä½œç‚ºå®¢æˆ¶ç«¯ã€‚ VersionChecker Unknown 未知 synergy-1.4.12-Source/src/gui/res/mac/0000700000175000017500000000000012140644175017415 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/mac/QSynergy.icns0000600000175000017500000036321611271253201022057 0ustar synergysynergyicnsæŽics#HÀð?ü?üþ|>øøøø|>þ?ü?üðÀÀð?ü?üþ|>øøøø|>þ?ü?üðÀics8ÿÿÿÿÿÿþýþþÿÿÿÿÿÿÿÿÿÿ¬£xx¥¥üþÿÿÿÿÿÿÿ¤xxxx¥¥¥¥¬ÿÿÿÿÿ¤xxxxx¥¥¥¥¥¬ÿÿÿ¬xxxx¤¬ý¬¥¥¥¥þÿÿ£xxx«ÿÿÿÿý¥¥¥üÿþxxx¤ÿÿÿÿÿÿ¬¥¥¥þýxxx¬ÿÿÿÿÿÿþ¥¥¥þýRRR­ÿÿÿÿÿÿÐÐþRRR‚ÿÿÿÿÿÿ¥þÿ|RRR­ÿÿÿÿФÿÿ­RRRR‚­Ð¥Ðÿÿÿ‚RRRRR¥ÿÿÿÿÿ‚RRRR¥ÿÿÿÿÿÿÿ­|RR¤Ðÿÿÿÿÿÿÿÿÿÿþ­Ðþÿÿÿÿÿÿis32qƒga70‡ffec8231ƒ ffgihb725423 fjfgkd843352€fgfgeda4134331figef€353`dfidƒ 15327jkjlhƒ04€3”–•—–ƒ04€3—™›Ÿ™ƒ 15327™žš™™€353˜šš›™™’7134331€ ˜ŸššŸ’=43352 ™˜šž›<25423ƒ˜˜š‘<131‡—;0ƒƒ—”jg‡€˜–keffƒ ™˜šž›•jfigff ˜ŸššŸ—ligfjf€˜šš›™˜–heegfgf™žš™™ fegif——šž–ƒ eife`žž ƒ hljkjÇÉÈÊǃ –—•–”ÇÌÎÔ̓ ™Ÿ›™—ËÓÍËÌ™™šž™ÍÎÍÏËÍÊ™™›šš˜€ ÌÔÍÍÔËŸššŸ˜ ÌÌÎÓÏÉ™žš˜™ƒÍËÌÊž€˜‡ÎÇ—ƒƒÿòr`‡€ÿôtdffƒ‚ÿóseigff‚ÿöuhgfjf€ƒÿ ôoeegfgf‚ÿfegif‚ÿƒ ehfd`îïîññƒ lpoonDEEF>ƒ ÇÆÄÅÃ00131ƒÍÔÏÍÇ35€3ÌËÍÓË133431;ÃÍËÏÍÎÍ€25€3AÂÕÍÍÔÌ 32451@ÀÐÓÎÌ̃131@ÁÍË͇0?¿Îƒs8mk%<<%C³óÿÿñ³CÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿCÿÿÿø•II”øÿÿÿC³ÿÿø__øÿÿ³%óÿÿ•”ÿÿñ%<ÿÿÿIIÿÿÿ<<ÿÿÿIIÿÿÿ<%ñÿÿ””ÿÿñ%³ÿÿø__øÿÿ³Cÿÿÿø”II”øÿÿÿCÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿC³ñÿÿñ³C%<<%ICN#à?üÿÿÿÿÀÿÿÀÿÿàÿÿøÿÿø?ÿÿü?ü?üðþàþÀþÿÀÿÿ€ÿÿ€ÿÿ€ÿÿ€ÿÿÀÿÀþàþðþ?ü?ü?ÿÿüÿÿøÿÿøÿÿàÿÿÀÿÿÀÿÿ?üàà?üÿÿÿÿÀÿÿÀÿÿàÿÿøÿÿø?ÿÿü?ü?üðþàþÀþÿÀÿÿ€ÿÿ€ÿÿ€ÿÿ€ÿÿÀÿÀþàþðþ?ü?ü?ÿÿüÿÿøÿÿøÿÿàÿÿÀÿÿÀÿÿ?üàicl8ÿÿÿÿÿÿÿÿÿÿÿÿÿôôôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý«yy¥¥¥ýþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«¤xxxxx¥¥¥¥¥¬ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬£xxxxxxx¥¥¥¥¥¥¥üþÿÿÿÿÿÿÿÿÿÿÿÿÿ¤xxxxxxxxx¥¥¥¥¥¥¥¥¥¬ÿÿÿÿÿÿÿÿÿÿÿ¤xxxxxxxxxx¥¥¥¥¥¥¥¥¥¥¬ÿÿÿÿÿÿÿÿÿ¤xxxxxxxxxxx¥¥¥¥¥¥¥¥¥¥¥¬ÿÿÿÿÿÿÿ¬xxxxxxxxxxxx¥¥¥¥¥¥¥¥¥¥¥¥þÿÿÿÿÿÿ£xxxxxxxxy«ýþýü¥¥¥¥¥¥¥¥¥üÿÿÿÿÿ«xxxxxxxx£þÿÿÿÿÿÿêü¥¥¥¥¥¥¥¥ýÿÿÿÿ¤xxxxxxx£þÿÿÿÿÿÿÿÿêü¥¥¥¥¥¥¥¬ÿÿÿýxxxxxxx£þÿÿÿÿÿÿÿÿÿÿêü¥¥¥¥¥¥¥þÿÿ«xxxxxxyþÿÿÿÿÿÿÿÿÿÿÿÿꥥ¥¥¥¥¥ýÿôxxxxxxÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¥¥¥¥¥¥¥¥ÿôxxxxxx«ÿÿÿÿÿÿÿÿÿÿÿÿÿÿý¥¥¥¥¥¥¥ÿôyxxxxxxýÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ¥¥¥¥¥¥¥ÿÿ|RRRRRRýÿÿÿÿÿÿÿÿÿÿÿÿÿÿФÿÿXRRRRRR­ÿÿÿÿÿÿÿÿÿÿÿÿÿÿОÿÿ|RRRRRR|ÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤¤ÿÿ§RRRRRRXþÿÿÿÿÿÿÿÿÿÿÿÿþžÏÿÿ­RRRRRRR|êÿÿÿÿÿÿÿÿÿÿô¤Ðÿÿÿ|RRRRRRR|êÿÿÿÿÿÿÿÿô¤¤ÿÿÿÿ­RRRRRRRR|þÿÿÿÿÿÿþ¤Ðÿÿÿÿÿ|RRRRRRRRX|­­ÐФž¤ÿÿÿÿÿÿ­RRRRRRRRRRRRÐÿÿÿÿÿÿÿ‚RRRRRRRRRRR¥ÿÿÿÿÿÿÿÿÿ‚RRRRRRRRRR¥ÿÿÿÿÿÿÿÿÿÿÿ‚RRRRRRRRR¥ÿÿÿÿÿÿÿÿÿÿÿÿÿ­|RRRRRRR¤Ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ­|RRRRR¤Ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ­§XX|ž¤žÏÐÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿil32Š€f€3” mdfefa82332Hf ghic93433213‹feffj€fga82€352343‰eghgfga82‚3431ˆeggƒfga82†3…fegg„fga82…3433ƒeggƒfhhga8244„344‚ffhƒf gfed_73224ƒ3433ffg‚fifbf3135‚3421€_fj‚fifh….35‚352de‚fgfh‡.34ƒ32fgfhfk‰124ƒ3fehfhff‰3243433fegefd‹ƒ3433fkmƒk‹ƒ3433™“—‚”“‹ƒ3433™™‚š™‹ƒ3433™˜œ™œ™™‰3243433™š™œ˜“‰124ƒ3š˜‚™›™–‡.34ƒ32˜Ÿ‚™ž™–….35‚352€˜˜š‚™ž™œ™3135‚3421™—œƒ™ ›˜™™;3224ƒ3433‚™ššƒ™œœ›=244„344ƒ™™›š„™š=2…3433…™ššƒ™š=2†3ˆ™›œš™š=2‚3431‰ ™™˜™žš™™š=2€352343‹™€˜ šœ’>3433213 ‘š™™š=2332H”€™€3ŠŠ€™€f” ‘š™™˜“keefdm™€˜šœ—mghgf‹ ™™˜™žš™™š”ke€fjffef‰™›œš™š”kefghgeˆ™ššƒ™š”keƒfgge…™™›š„™š”ke„fggefƒ™ššƒ™œœ›”kehhƒfgge‚™—œƒ™ ›˜™—“kfefgƒfhff˜˜š‚™ž™œ™fbfi‚fgff€˜Ÿ‚™ž™–…hfi‚fjf_š˜‚™›™–‡hfg‚fed™š™œ˜“‰kfhfgf™˜œ™œ™™‰ffhfhef™—›˜™—‹ffegff™¡‚žŸ‹ƒkmkfÌÇË€ÇÈÇÇ‹“‚”—“™ÌÍÑ‚ÍÌ‹™‚š™™ÌËÐÌÐÌ̉™™œ™œ˜™ÌÎÍ€ÌÏÌ͉“˜œ™š™ÌËÍÌÏÌŇ–™›‚™˜š¿ËÔ‚ÌÒÌÅ…–™ž‚™Ÿ˜€ÊË΂ÌÒÌÍÌ™œ™ž‚™š˜˜ÌÊЃÌÏ€ÌÇŸ™™˜›ƒ™œ—™‚ÎÎ̓ÌÏÐÎÇž™œœƒ™šš™ƒÌÍÎÍ„ÌÎÈž˜„™š›™™…ËÎ΃ÌÍÇž˜ƒ™šš™ˆÍÎÐÎÌÍÇž˜™šœ›™‰ÌÎËÌÓÍÌÌÍÇž˜™™šž™˜™™‹ ÌÍËËÎÐÑË¡›œš€˜™ÚÌÇž˜™™š‘”€Ì€™ŠŠÿÿå€f”þÿðtcefdm„ÿõwfhgf‹€ÿþ‚ÿðud€fjffef‰†ÿðudfghgeˆ‡ÿðudƒfgge…‰ÿñud„fggefƒ‰ÿðudhhƒfgge‚Šÿïsfefgƒfhff‰ÿfbfi‚fgff€ˆÿ…hfi‚fjf_‡ÿ‡hfg‚fed†ÿ‰kfhfgf‡ÿ‰ffhfhef†ÿ‹f‚egefåëðìëë‹o‚profLFH‚FG‹ÃÂÀÂÆÂÌ311010‹ÌÎ΀ÍÑÍÌ3343423‰ÌÌÐÌÐË̃3421‰ÍÌÏ€ÌÍÎÌ2ƒ343.‡ÅÌÏÌÍËÌ25‚353.…ÅÌÒ‚ÌÔË¿€124‚35313ÌÍÌÒ‚ÌÎËÊ334ƒ3 4223C»ÏÌÌσÌÐÊÌ‚44„3441B½ÏÐσÌÍÎ΃334…31B¾Ï„ÌÍÎÍÌ…†31B½ÎƒÌÎÎˈ134‚31B½ÎÌÎÐÎ͉34325€3 1B½ÎÌÌÍÓÌËÎÌ‹3123342CÁÒÐÎËËÍÌH2331B¾Í€ÌÚ”33L²ÌÌŠl8mk =iÕÖÔÔÕÕi=M±þÿÿÿÿÿÿÿÿþ±MI¸öÿÿÿÿÿÿÿÿÿÿÿÿö¸I…ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ……ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ……ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ…IÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿI¹ÿÿÿÿÿÿÿÿÞÉV@@UÉÞÿÿÿÿÿÿÿÿ¹M÷ÿÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿÿ÷M±ÿÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿÿ±=þÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿþ=iÿÿÿÿÿÿÞÞÿÿÿÿÿÿi ÕÿÿÿÿÿÿÉÉÿÿÿÿÿÿÕ ÖÿÿÿÿÿÿVUÿÿÿÿÿÿÔ Ôÿÿÿÿÿÿ@@ÿÿÿÿÿÿÔ Ôÿÿÿÿÿÿ@@ÿÿÿÿÿÿÔ ÔÿÿÿÿÿÿUUÿÿÿÿÿÿÔ ÕÿÿÿÿÿÿÉÉÿÿÿÿÿÿÕ iÿÿÿÿÿÿÞÞÿÿÿÿÿÿi=þÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿþ=±ÿÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿÿ±M÷ÿÿÿÿÿÿÿ¹¹ÿÿÿÿÿÿÿ÷M¹ÿÿÿÿÿÿÿÿÞÉU@@UÉÞÿÿÿÿÿÿÿÿ¹IÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿI…ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ……ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ……ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ…I¸öÿÿÿÿÿÿÿÿÿÿÿÿö¸IM±þÿÿÿÿÿÿÿÿþ±M=iÕÕÔÔÕÕi= it32!mÿÿ«ccb‡dZ<‡211*àŠfZ>‡3233Ùÿ‚fqdeg‡f[>Š38?‚3Òbde‚feeg‡f[>‹3‚121Ðfg„feˆf[>ˆ32†3Ìjjfjgdfh‚gŠf[>3228535?Æmd‚fef[>322€345$Åbfefee’f[>—3'À__bfdeefg”f[>•32202113»`ffe€fe•f[>•32€3233+¶Ummdfešf[>š323/*$$*²de€fefešf[>š3234€34-±gg€fee›f[>Ÿ3233®Ucidf€gf[>¡3248¬Yfe¢f[>¤3&«dfe¢f[>¡3223.¨gcefe¢f[>¢32313/¦Ugg¥f[>¤3242*£UZffg¤f[>¦32<*¢gdffe¥f[>¥32345/¡cefe¦f[>¦3232/žUfdefg§f[>¨321.3œc¬f[>ª343*›i€e©f[>ª323+˜ÿdgd¬f[>ª3€23-–Ue®f[>®34*•mffh¬f[>­323$•mffg¬f[>¯3$•gfg¬f[>¯3*“_ddee¥fe„fZ>­322/6‘bffe§fddfdX>232¨32334‘ffeeŸf„efg?‡U?32¨321‘fe fe„fed‹5…32 321‘d fgffgfc`_‹413032¡32_be fegc›¢320'?Œjdfežf€efa›-€32ž3432*‹_€feœfgffhUUœ8.22ž32345‹j£fmŸ$3432Ÿ35‹nfeœfeefgf 3312Ÿ37‹gfe›feffd¥. 38ˆ_ fgfa¥05422›3233/†ffefešfgfedaU¦061¡3…fefhšfefgc« 313…€fg˜fgegfhf«332313…€fg˜fgeehmU¬H.313…€fg™fgfU¯3322™313…gfg–feffciU°-œ32?„Uffg–fefgµ0›38‚cfge˜feffµž3*cf€e—fefcµ131dfgg˜fefcµ1œ322d›fefcµ132d›fefcµ132d™fefeeiµ432dšfgcd_µ5312™32dšfd?¹?2š32dšfd¹2š32dšfdU¹U2š32dšfdU¹U2š32dšfdU¹U2š32dšfdU¹U2š32sr—qrpqU¹U2š32‘Œ˜ŽŒª¹U2š32›˜—™š˜šª¹U2š32›˜—™š˜šª¹U2š32›˜—™š˜šª¹U2š32›˜—™š˜šª¹U2š32›˜—™š˜šÿ¹2š32›˜—™š˜š¹?2š32›˜—™š˜››šŸµ5312™32›˜˜™˜š™™žµ432›˜›™˜›µ132›˜›™˜›µ132›˜šš™™˜›µ1œ322•˜™™˜˜™˜›µ131™š™™š—™˜ µž3*‚™˜š—™˜žµ0›38„š˜š—™˜™›–U°-œ32?…™˜˜š—™˜˜™˜¯3322™313…™˜˜š˜™š™™–‘U¬H.313…™˜˜š˜™š™™˜™™«332313…™–˜›šœ™—« 313…€™€˜˜™š›™™šª¦061¡3…ÿ—™™˜›™˜€™‘¥05422›3233/‡ÿ ™™š›™˜™š¥. 38Š›˜™šš™š˜™›—™ÿ 3312Ÿ37‹Ÿ™™›œ™˜š˜™‘Ÿ$3432Ÿ35‹”˜˜™˜œ™›™˜–ªœ8.22ž32345‹”ššž™š€™š–›-€32ž3432*‹ÿœ™˜š ™—›¢320'?–™š™šš˜™ž ›žŸ‹413032¡32‘˜˜šŸ™—„˜™š‹5…32 321‘˜˜¨™˜—ÿ‚ª‚U?32¨321‘–šš™˜¦™˜šœšH232¨32334‘Ÿšš™™š¤™…˜‚I­322/6“›™š¥™„šƒJ¯3*•‘š™š¬™‚J¯3$•‘™˜›¬™‚J­323$•ª™š­™‚J®34*•š—š˜˜š©™‚Jª3€23-™•˜«™‚Jª323+››€™—¨™‚Jª343*›ª™š™™›§™‚J¨321.3Ÿ—˜™™˜¥™‚J¦3232/¡—š˜™˜š¤™‚J¥32345/¡ª–˜™›¤™‚J¦32<*¤—™™—£™‚J¤3242*¥——€™š¡™‚J¢32313/©š˜™˜¡™‚J¡3223.«Œ™™˜¡™‚J¤3&«ª›žš™›€šœ™‚J¡3248¯—š˜€™˜›™‚JŸ3233±š™™š˜™˜˜š™‚Jš3234€34-±ª‘‘š˜™€š—™‚Jš323/*$$*·•š˜˜—˜™˜•™‚J•32€3233+»™˜˜š™™˜€š’™‚J•32202113Àœ˜‚™˜™‚J—3'Ŷš˜™˜™˜˜š™‚J322€345$Åÿª”™” —˜›ƒš‰™‚J3228535?Ë™™ƒ˜Š™‚Jˆ32†3Ñœš™˜™™˜š‡™‚J‹3‚121Ñÿ‚™—™š‡™‚JŠ38?‚3Ù™šˆ˜‚J‡3233á››˜‡›‚K‡211*ÿÿ«ÿÿ«››˜‡›Œs‡dbccà™šˆ˜ŒrŠfØÿ‚™—™š‡™Žq‡fgedq‚fÿÑœš™˜™™˜š‡™Žq‡fgee‚fedbЙ™ƒ˜Š™Žqˆfe„fgfÊÿª”™” —˜›ƒš‰™ŽqŠf‚ghfdgjfjjƶš˜™˜™˜˜š™Žqfe‚fdmÅœ˜‚™˜™Žq’feefefbÀ™˜˜š™™˜€š’™Žq”fgfeedfb__»•š˜˜—˜™˜•™Žq•fe€feff`¶ª‘‘š˜™€š—™ŽqšfefdmmU±š™™š˜™˜˜š™Žqšfefe€fed±—š˜€™˜›™Žq›fee€fgg®ª›žš™›€šœ™Žqf€gfdicU«Œ™™˜¡™Žq¢fefY«š˜™˜¡™Žq¢fefd¨——€™š¡™Žq¢fefecg¥—™™—£™Žq¥fggU£ª–˜™›¤™Žq¤fgffZU¡—š˜™˜š¤™Žq¥feffdg¡—˜™™˜¥™Žq¦fefecžª™š™™›§™Žq§fgfedfU››€™—¨™Žq¬fc›•˜«™Žq©f€ei˜ÿš—š˜˜š©™Žq¬fdgdÿ•ª™š­™Žq®feU•‘™˜›¬™Žq¬fhffm•‘š™š¬™Žq¬fgffm•›™š¥™„šr¬fgfg“Ÿšš™™š¤™…˜Œr„fe¥feedd_‘–šš™˜¦™˜šœšqdfdd§feffb‘˜˜¨™˜—ÿªƒU?gf„eŸfeeff‘˜˜šŸ™—„˜™š‹de„fe fef‘–™š™šš˜™ž ›žŸ‹_`cfgffg fdŽÿœ™˜š ™—›cge feb_Œ”ššž™š€™š–›af€ežfefdj‹”˜˜™˜œ™›™˜–ª›UUhffgœfe€f_‹Ÿ™™›œ™˜š˜™‘Ÿm£fj‹›˜™šš™š˜™›—™ÿŸfgfeeœfefn‰ÿ ™™š›™˜™š¥dffe›fefgˆÿ—™™˜›™˜€™‘¥afg f_†€™€˜˜™š›™™šª¥Uadefgšfefeff…™–˜›šœ™—«cgfešfhfef…™˜˜š˜™š™™˜™™«fhfgeg˜fg€f…™˜˜š˜™š™™–‘U«Umheeg˜fg€f…™˜˜š—™˜˜™˜¯Ufg™fg€f…š˜š—™˜™›–U¯Uicffe–fgfg„™˜š—™˜žµgfe–fgffU‚™š™™š—™˜ µffe˜fegfc•˜™™˜˜™˜›µcfe—f€efc›˜šš™™˜›µcfe˜fggfd›˜›™˜›µcfe›fd›˜›™˜›µcfe›fd›˜˜™˜š™™žµieefe™fd›˜—™š˜››šŸµ_dcgšfd›˜—™š˜š¹?dšfd›˜—™š˜šÿ¹dšfd›˜—™š˜šª¹Udšfd›˜—™š˜šª¹Udšfd›˜—™š˜šª¹Udšfd›˜—™š˜šª¹Udšfd¥˜¤¥¤£ª¹Uqpr—qrsØÁÂÀÀª¹ªŒ˜ŽŒ‘ÍË—ÌÍË̪¹ªš˜š—™˜›ÍË—ÌÍË̪¹ªš˜š—™˜›ÍË—ÌÍË̪¹ªš˜š—™˜›ÍË—ÌÍË̪¹ªš˜š—™˜›ÍË—ÌÍËÌÿ¹ÿš˜š—™˜›ÍË—ÌÍËÌ¿¹š˜š—™˜›ÍË—ÌÍÌÍËÉßµŸš››˜š—™˜›͢ÌËÍËËʵž™™š˜˜™˜›ÍË™ÌÍËË͵›˜›™˜›ÍË™ÌÍËË͵›˜›™˜›ÍÊÎÍ—ÌÍËË͵›˜™™šš˜›ÍËËÌË–ÌÍËË͵›˜˜™˜™™˜•ÆÌÎÍÌÍ•ÌÍËËÓµ ˜—™š™™š™ÿÿÆÌÌÍ•ÌÍËËεž˜—™š˜™„¿ÏÌÍ—ÌËÌËʪ¯U–›™˜—™š˜š…ÌÍÌÍ—ÌËÌËËƯ˜™˜˜—™š˜˜™…ÌÍÌ͘ÌÎÌËÅÚª«U‘–™™š˜™š˜˜™…ÌÍÌ͘ÌÍ‚Ìÿª™™˜™™š˜™š˜˜™…ÌÍËÎÍ™ÌËÌÌË«—œ™š›˜–™…ÌÌËÌË™ÌÍÎÌÊÐÎÿ¥ªš™™›š˜™€˜€™…ÿÇÌÎËÌÍ™ÌË€ÌÂ¥‘€™˜›™˜™™—ÿ†ÿÏÌÌÍšÌËËÌÈÿ£š™˜›™š™™ ÿ‰ÒËÌÍšÌÍËÌÏËÌÿŸÿ™—›™˜šš™š™˜›‹ÔÌÌÎœÌËÍÊÌÚŸ‘™˜š˜œ™›™™Ÿ‹ÉÊËÌËœÌÎÌÌÅƪ›ª–˜™›œ™˜™˜˜”‹ÔÌËÌÊœÌÍËÊ›–š€™šž™šš”‹ÿ¿ÄÊËÍœÌËÌÌËË›— ™š˜™œÿŽÌÊÍÌÍÎËÌÎÓÍÊß‹Ÿž› ž™˜šš™š™–‘ÍÉΟ̆ËÉ‹š™„˜—Ÿ™š˜˜‘Íˢ̃ËÌË¿ÿ‡ªÿ—˜¨™˜˜‘Ê˟̃ÍÌËÌÏÌÀ£šœš˜¦™˜™šš–‘¿ÑÉÌËͤÌË̃ËÀ¤…˜¤™š™™ššŸ“ÔÍÌͥ̄ÍÂ¥„š¥™š™›•ÚÍÌͬÌÁ¤¬™š™š‘•ÚÎËÎÍ«ÌÁ¤¬™›˜™‘•ÔÊ®ÌÁ¤­™š™ª•ÿÑË€ÌÍ©ÌÁ¤©™š˜˜š—š˜ÓËÌË˨ÌÁ¤«™˜•›ÆÌËÌʨÌÁ¤¨™—€™››ªÌÈÍÌÎͦÌÁ¤§™›™™š™ªžËÊÌËË¥ÌÁ¤¥™˜™™˜—¡ÏÌͤÌÁ¤¤™š˜™˜š—¡ÿÔÒÊÌΤÌÁ¤¤™›™˜–ª£ªÉÌÌÊË¢ÌÁ¤£™—™™—¥ÿÏËÍÊËÍ¡ÌÁ¤¡™š€™——¨ÈËÌÌË ÌÁ¤¡™˜™˜š«‚ÌÍŸÌÁ¤¡™˜™™Œ«ÿÔÊÌÌ΀͜ÌÁ¤œ™€š›™šž›ª®ËÌËÌÌËË›ÌÁ¤›™˜€™˜š—±ÑÊÌÍËÌÌËšÌÁ¤š™˜˜™˜š™™š± ÔÚÚÔÉËÌÎÍÍ—ÌÁ¤—™€š™˜š‘‘ª¶ÊËÌËÊÌÊË•ÌÁ¤•™˜™˜—˜˜š•»¿ÅÍÍÌÊÌÌ΀͑ÌÁ¤’™€š˜™™š˜˜™ÀÄË–ÌÁ¤™˜‚™˜œÅÚÌÊÌËÌÌËÍÌÁ¤™š˜˜™˜™˜š¶ÅÿÔÉÌÉÏÌÌ΃͉ÌÁ¤‰™ƒš›˜— ”™”ªÿÊÌË˃ÌˈÌÁ¤Š™ƒ˜™™ÏÿÍÉÊ€ÍÊÌÍË͇ÌÁ¤‡™š˜™™˜™šœÑÿ‚Ì¿ÆËÌ·ÌÁ¤‡™š™—‚™ÿØÌÌʇËÀ¤ˆ˜š™àÔ‰ÍÃ¥‡›˜››ÿÿ«ÿÿª‹ÿᇇdbccà‹ÿ܉ŠfØ’ÿ݈‡fgedq‚fÿЇÿþˆÿ݈‡fgee‚fedbГÿ݈ˆfe„fgfʃÿþ‘ÿ݈Šf‚ghfdgjfjjÆþ—ÿ݈fe‚fdmŘÿ݈’feefefbÀÿþÿÿþ•ÿ݈”fgfeedfb__»ÿÿþÿÿþ—ÿ݈•fe€feff`¶ÿÿþþžÿ݈šfefdmmU±þÿþþ›ÿ݈šfefe€fed±ÿþþÿÿþœÿ݈›fee€fgg®€ÿþ¡ÿ݈f€gfdicU«¥ÿ݈¢fefY«ÿ€þ¡ÿ݈¢fefd¨¨ÿ݈¢fefecg¥ÿþ¦ÿ݈¥fggU£ªÿ݈¤fgffZU¡ÿþÿÿþ¥ÿ݈¥feffdg¡€ÿþ¦ÿ݈¦fefecž­ÿ݈§fgfedfU›ÿÿþªÿ݈¬fc›ÿÿþªÿ݈©f€ei˜ÿþÿþÿþªÿ݈¬fdgdÿ•ÿÿþ­ÿ݈®feU•þÿþ­ÿ݈¬fhffm•þ¯ÿ݈¬fgffm•°ÿÞ‰¬fgfg“ÿþÿþþ­ÿ܈„fe¥feedd_‘²ÿ܇dfdd§feffb‘ÿþ¨ÿþ„ÿª‚U?gf„eŸfeeff‘¬ÿ‹de„fe fef‘þ«ÿ‹_`cfgffg fdŽÿþ¢ÿ›cge feb_Œ§ÿ›af€ežfefdj‹ÿÿþþ£ÿ›UUhffgœfe€f_‹¤ÿþŸm£fj‹¥ÿŸfgfeeœfefn‰¤ÿÿ£dffe›fefgˆ¥ÿ¥afg f_†¥ÿ¥Uadefgšfefeff…¢ÿ«cgfešfhfef…£ÿªfhfgeg˜fg€f… ÿþÿ«Umheeg˜fg€f… ÿ¯Ufg™fg€f… ÿ¯Uicffe–fgfg„žÿµgfe–fgffU‚Ÿÿµffe˜fegfc€ÿþ›ÿµcfe—f€efcŸÿµcfe˜fggfdŸÿµcfe›fdŸÿµcfe›fdŸÿµieefe™fd›ÿþ€ÿµ_dcgšfdÿ¹?dšfdÿ¹dšfdÿ¹Udšfdÿ¹Udšfdÿ¹Udšfdÿ¹UdšfdטÒÓÑÒÿ¹U}|~—}|}_š`aU¹ª¶´¶—µ´¹2š32U¹ªÌËÍ—ÌËÍ2š32U¹ªÌËÍ—ÌËÍ2š32U¹ªÌËÍ—ÌËÍ2š32U¹ªÌËÍ—ÌËÍ2š32¹ÿÌËÍ—ÌËÍ2š32?¹¿ÌËÍ—ÌËÍ2™32135µßÉËÍÌÍ—ÌËÍ234µÊËË͢ÌËÍ231µÍËËÍ™ÌËÍ231µÍËËÍ™ÌËÍ22œ31µÍËËÍ—ÌÍÎÊÍ131µÍËËÍ–ÌËÌËËÍ*ž3µÓËËÍ•ÌÍÌÍÎÌÆ‚8›30µÎËËÍ•ÌÍÌÌÆÿÿƒ?2œ3-°ªÊËÌË—ÌÍÌÏ¿…31™32233¯ÆËËÌË—ÌÍÌÍÌ…313.H¬ªÚÅËÌΘÌÍÌÍÌ…313233ªÿ‚Ì͘ÌÍÌÍÌ…31 3«ËÌÌË™ÌÍÎËÍÌ…¡3160¦ÿÎÐÊÌÎÍ™ÌËÌËÌ̆/332›322450¥Â€ÌË™ÌÍÌËÎÌÇÿ‡8 3.£ÿÈÌËËšÌÍÌÌÏÿ‰7Ÿ32133 ÿÌËÏÌËÍšÌÍÌËÒ‹5Ÿ32343$ŸÚÌÊÍËœÌÎÌÌÔ‹5432ž322.8œªÆÅÌÌÎœÌËÌËÊÉ‹*234ž32€3-›ÊËÍœÌÊÌËÌÔŒ?'02¢3›ËËÌÌËœÌÍËÊÄ¿ÿŽ2¡3230314‹ßÊÍÓÎÌËÎÍÌÍÊÌ‘12 32…35‹É†ËŸÌÎÉÍ‘12¨323?‚U‚ªÿ¿Ë̃ˢÌËÍ‘4332¨3232UªÌÏÌË̃͟ÌËÊ‘6/22­3UªƒËÌˤÌÍËÌÉÑ¿“*¯3U«„Í¥ÌÍÌÍÔ•$¯3Uª¬ÌÍÌÍÚ•$32­3Uª«ÌÍÎËÎÚ•*4®3Uª®ÌÊÔ–-3€2ª3Uª©ÌÍ€ÌËÑÿ˜+32ª3Uª¨ÌËËÌËÓ›*34ª3Uª¨ÌÊÌËÌÆœ3.12¨3Uª¦ÌÍÎÌÍÈ̪ž/232¦3Uª¥ÌËËÌÊË¡/5432¥3Uª¤ÌÍÌÏ¢*<2¦3Uª¤ÌÎÌÊÒÔÿ£*242¤3Uª¢ÌËÊÌÌɪ¦/3132¢3Uª¡ÌÍËÊÍËÏÿ¨.322¡3Uª ÌËÌÌËÈ«&¤3UªŸÌ̬͂842¡3UªœÌ€ÍÎÌÌÊÔÿ®332Ÿ3Uª›ÌËËÌÌËÌ˱-4€3432š3UªšÌËÌÌËÍÌÊѲ*$$*/32š3Uª—Ì ÍÍÎÌËÉÔÚÚÔ¶+332€32•3Uª•ÌËÊÌÊËÌËÊ»3112022•3Uª‘Ì€ÍÎÌÌÊÌÍÍÅ¿À'—3Uª–ÌËÄÅ$54€3223UªÌÍËÌÌËÌÊÌÚÆ?5358223Uª‰ÌƒÍÎÌÌÏÉÌÉÔÿˆ32ˆ3UªˆÌ˃ÌËËÌÐ12‚1‹3Uª‡ÌÍËÍÌÊ€ÍÊÉÍÿÑ‚3?8Š3Uª‡ÌÎÌËÆ¿‚ÌÿÙ332‡3U©‡ËÊÌÌà*11‡2Uª‰ÍÔÿÿ«t8mk@.433333333333333333333334.F±ÉÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇɱF ^äÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿä^ Vbaaaad™îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿî™daaaabVKËêèèèèèðýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðèèèèèêËK eãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãe L“›š›»óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ󻛚›“L |ìúøøúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúøøúì| (998DœöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöœD899(‹ÊÎÍÏæýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýæÏÍÎÊ‹+±ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý±+Xihh~ÏþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÏ~hhiX@ÅíëëîùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùîëëíÅ@[ÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ[iž»ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð»ži!¤öüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüö¤!;X¾ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý¾X;[ÃØðþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþðØÃ[uðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðu¯öÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿö¯u[;ÄðöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöðÄ;!XØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿØX!i¤¾ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð¾¤iŸöýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýöŸ@[»üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü»[@XÅÜðþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþðÜÅXiíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíihëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëhgëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëg+~îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøãÛÛÛÛÛÛÛÛÛÛÛÛÛÛãøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿî~+'‹±ÐùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ|QPQQQQQQQQQQPQ|Üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùб‹'9ÊýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýýýýýýÊ@@ÊýýýýýýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýÊ99Îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòdz³³³³³++³³³³³³ÇòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÎ98ÍÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙ_%#$$$$$$$$#%_ÙÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÍ8 DÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøóÆ@@ÆóøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÏD  L|œæÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø¼…h""h…¼øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæœ|L “íöýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñ  ñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýöí“›ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòÜÉddÉÜòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿù›šøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÄaE##EaÄþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøš›øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþùª!!ªùþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø› Kd»úÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòĪssªÄòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú»dK UËãóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜb!!bÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóãËUbêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøñÈEEÈñøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêbaèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø¼d##d¼øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèaaèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó……óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèaaèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòÙÆh hÆÙòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèa`èÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÇ_@""@_Çýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿè` dèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³%%³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèd F^™ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³##³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð™^F.±äîýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýîä±.3Éÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÉ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÜËËÜøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿã{@++@{ãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQQÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿã{@++@{ãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÜËËÜøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ33Éÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÉ3.±äîýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³$$³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýîä±.F^™ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³##³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð™^F dèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý³%%³ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèd `èÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÇ_@""@_Çýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿè`aèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòÙÆh hÆÙòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèaaèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿó……óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèaaèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø¼d##d¼øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèabêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøñÈEEÈñøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêbUËãóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜb!!bÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóãËU Kd»úÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòĪssªÄòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú»dK ›øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþùª!!ªùþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø›šøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÄaE##EaÄþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøš›ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòÜÉddÉÜòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿù›“íöýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñ  ñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýöí“ L|œæÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø¼…h""h…¼øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæœ|L  DÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøóÆ@@ÆóøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÏD 8ÍÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙ_%#$$$$$$$$#%_ÙÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÍ89Îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòdz³³³³³++³³³³³³ÇòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÎ99ÊýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýýýýýýÊ@@ÊýýýýýýýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýýÊ9'‹±ÐùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ|QPQQQQQQQQQQPQ|Üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùб‹'+~îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøãÛÛÛÛÛÛÛÛÛÛÛÛÛÛãøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿî~+gëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëghëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëhiíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíiXÅÜðþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþðÜÅX@[»üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü»[@ŸöýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýöŸi¤¾ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð¾¤i!XØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿØX!;ÄðöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöðÄ;¯öÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿö¯u[uðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðu[ÃØðþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþðØÃ[;X¾ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý¾X;!¤öüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüö¤!iž»ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿð»ži[ÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ[@ÅíëëîùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùîëëíÅ@Xihh~ÏþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÏ~hhiX+±ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý±+‹ÊÎÍÏæýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýæÏÍÎÊ‹(998DœöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöœD899( |ìúøøúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúøøúì| L“›š›»óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ󻛚›“L eãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãe KËêèèèèèðýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýðèèèèèêËKVbaaaad™îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿî™daaaabV ^äÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿä^ F±ÉÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇÇɱF.433333333333333333333334.ic08{‘ jP ‡ ftypjp2 jp2 Ojp2hihdrcolr"cdefjp2cÿOÿQ2ÿR ÿ\ PXX`XX`XX`XX`XX`ÿdKakadu-3.2ÿ z§ÿ“Ͻ€[•¹&¥ß´ºJZ ?#¡‰…E áÎ)ê¥ûT³1ÐMËŒÔ:þÖÀI·²!îrwª¸¢˜ÝÄ]@;ÐR ÅßϼøÀ‚|xÁX K* ™qBJ |•˜#U˜`!´tÛj©´xŸhê&²\ó½zåäYþ@² Ç8;¯IÇØrR½¢Z¯È¢1‡ä@ëæ¹ÄÃ}ž`é€Ù¨¦}ìJ³em:Ý’-<áç€ÅÁȨ Ç]$¥êc3Ͻ0ýÏ uãÖLu8F r}'*AjyîE§\ü E4þ ôTc‡ È(Òº“RÍk ÖÑí@ ›®«Ð@4I…” š]ÏÞA¯É˜´hÇÞwyä>ô `£þ uúÅ·g TŒ¬ÕÍ0¸½Ë£=Ù$O‰ë¯8ë\åÑ©@vÌ¥ýÕlMµ—•Ùý¹~?8¡iîïH­?ðG:Ù´­ÂBf  û8jRL”Wë÷óŸ*Ì´’¶lð  tlÙRø`Š¬½_wyäŸÂˆÒ™€2Ýä,nŽ„4fg,y³ ²ö¬@¬L<š J£……÷µ1õÛÃñƒœ½.èQwõ|í ÂVrÓGr#^¿÷Ãì3¼Þ¥Xé©nŸiO=hg_#?ba!&p´ýú‚ú¨+nOŠÎlMéYˆ jŸë/à'%6¼©ŒŸH|tµ€Âð¬±9RÀÚgº%C7äÙ7]5i*—k,ÙÌ Š(ï_žsµPŠôÇúÅ°½t1 ®!5ïÍy¶îÞij*9W^áÞ¢’´'â´/Åͧ}ÈÜÛγÃì2‡ØgØnaUNŒúA¸7gpÝOÜ½Ú Ç­—™ Ó'°_w3»ªY§³tž`hV]”\þÔ\,§1rMd|k mS*žëµø~BŸöK;Þ·c\ôä,Ær®þ9]óé@²FÕEâžSƒ¶oHÙ- ãšë'Ih ja©X~LÛ›¸@ê`þ»ªìË ¤‹¯« ÜÝnØhÓçba1ÏÉ~H‘ù 7s¡„PN®>†‹ñy=§êﵚA}[´pºhØs¯#.°¤€äp Œë8«-.°_äññÑ\LvÝÁ,xºcðÏ£týÂH­?çúò_ƒÈšÑ°”ba¥}ÅjŽm’DHƒZÕ#A~šäŠæhã¨4Ñ$Fñ²éƒ©¹:iP‡üÿYg´\.Õá-ÕúqQ›ÉçJæ¨ùä=?ÁC£,™“LÜ€Ó}Qf®Jȳ¾ V'³õEÏŸµ–QÀ€E%"–¢†Šÿjö‹ìÇßWÇßVÃï©€œŽïî½i6ü“ùçW‰Úœ¶uWH]™M[ _MÁdÕø¾d÷ £éž[>P±R¦Ïê×뙢ãx+•‘àêuÆ•é<ó×ßÔŽœS½Äú>.Ž" ü$ð˜Y×ub'É[%K!vq&Ñ ½±Žóuo¤‘ƒ“戴ÑVÛ´XûlÎÀ-i¯îYÍCe¼Ÿ³ž¡@ õµçJ5ñç‹™ô^ÖskŸ ®'\¿^äf*¢éõ1þß~üŸô½cÚ8•5ýàñg[S‰õŽþYÆœb8hõ*ÁïH‡·}dâw÷k›¾wÖ|؜߉|°Q{ðŒ^’Y@üð€Ýo•BÜ…âÑI ‰®®ü@„ïhhî­û'·TkÞ˜3 ú‚õÁˆMp.‚C¡I \ܸʢ³OÛPê‚'æšjǂΆDôÕÆzÐSöø±NX^90™Ê ºµ{¢›*Ÿr¼ü ÛwæM–‚X%¡©^Büu*3(¹†¢wØ}S–yA ÏÉXÿ`™^“-ôh»”lo$¶5$g=M\º%¡†ñm8Ë‘du.$Q÷©æ(¹>v´)VdÍ0ð›:ဵ|ÈLsÎY‰]ídÅM¸äBî×.ÁÍât‹ÝÀ,¯yÃr —b“wÍ‚ÚoïD"«óŒ%ÿtÙ7ƒ\éƒq͉[‚ÒÅ4\¯Œx÷&²ÚŠ ß“²wVsÙÆ)㥉#-Çq¹^ ž”ëŸó|gPä*¹h|´u¢;<#4e§£ú%b_€ÚÚ,Õdz2.Sg‡þ!%Qꑉùûq€æÔ9Í&ÿdÎ{,,ç ?@÷QŽ¦ää1TÔ+ÞËä,½ÕÛT”ø`èÒÖ00#hú¬“ßf~ÙruuÞߊ,'÷Ý°i/Y@UÃJhCKšÚð¥d›)©¦Ä"É~¤¡»B´¼Š‰º–K¸%<}ˆ¿ì²>£”BJx ‡×á0G³ÊÔ«>"†ñÅF´Êú©nç©oñ›!f+¨ªÅ¼ƒG‹WËô&å?¯²Rð‹Ÿõ&á)š&ÿz nj»b¸±æ æ m}® ª’ž¡Œ¡Ú’s½ |Œû‘¡Ž|ÙK»®£¢Érc‰7šõ×]ŒšŠOÁ`9¢­¯0)§ÆSÚ§ýѵêX3ñ1A§‹¹‡ôzeëÁ}ñiU Ö4è=‡xÚrg³Ïü‘)RÃ[¶Sp㉭‹P÷+­¾šQ•/Åb! ô¬œoozc–3ªJæòæC­¾¯GÆîÌCÈ Œ‹ Úñõ øI%é_Ì„ÃÕ ²g‹³õ}ê¬b•hfš4«¼@ /@À(œ±ÇˆÍ ¾›Æc÷òÂ~â"Q7Ö Œ®È¥wÈJ¸°­-)IéîáÆ’@ŽShòrE"ÒS Õ1¡^Â7þyÅlè2ýýßK3nŒRžM›´£zcŸb©Þ€E9DI#åj Ë‘¥Þ+Ž"" À)†?ë^ó&GۺꟘÀ°;-wF©,š æ{6DLªÊþ4T*wwÁOÃO==^BŒˆÂÙ™Ú}÷²–;oÐAJø<¾¶LìòƨUäö.ó?ŽÐ£CµžX||Ý·;®¹èEÙEsåjá+BâK–Ÿš%ôàåpý1Ç!u·Ó.øl"7°órÉ椪zҢŲ_êÐd³½ex»l~Ïbm~|IéN*ÖVu×è=OyÅvƒMQ@óüSdRÄ„ì¾  `Ixõ ’¡Û˸’r¥í¤Ó¨–Íàl†¸x…T ×–þ«£Uù+~ñžä:õ`¾ý¿1QuU##‘±è)eå¡õÇ°`ˆy_GŸjÐrL#ÇÙ¨Qöj,> Ãt½dH3Üï¶r¤b¨ÔC»f‹ƒ)‚—À“p Ur”°ß‘|~¡ß$¡º-o€idv.w®?NÇkÈ@Ûùp|ÐõØ æ`Ô÷8™R0>|Ýc3ØÞþ¡ÞÄ^RÔÞ··P¡`^wؽŸ•3EñßÇ'6#6Í픧 êßÛž}VT°ïk“ÿg¦ýS~~êý¶œsýg!‚g½…¾<ˆ›[X¸[ <ì²±èÁð=–¬‰ë™BâFÿEîÍ»°vÜØ«ògÇQeô¤¬³@„nkˆ ch+c)ƒê|9ié´‹£ uïö®1;¸=¾0_„Kæԯ湼#ÿ¶Æ-ßÍKþP C–*$pÀ$Û˜a\³Lú}ïý‚3EƒEƒòqR*•.¢½ƒ™‡Üœ´®RÌGm9èÖåæb&Ñ+ÊðÜnO– Ÿ€ÛŸ˜k‘áCퟺ;v´‡gÐÏ®Ÿk«˳n$\hP¿t‘N£—ä³:±7^èº$¸‡ŠSG¿R2Cï'ý9#B£tœ~:@e/©ô‡7HJã…¥û¶ï|Q²“õíò$ˆºp˜Ø5ÓO-CBIÁ1n¸c2= ©;®û¢± 7tÖð~à€Ax„!`2¦‡;qèDë/'¿=[ËÐÀïÞŒÈf0û—m ¬Qªw.{ã=xUBSn²œõ´¸õ›$ÖÛ6X@]Ø@é¾"ºÝ±Ú¬¾{"'³˜£ÝY–À ¦à“ô’§>;ï8ý°æþÌt2Ø< «IßÛ¿g‘oîź¯e™>PÙt|g5p|P‚¬‘È —X›»RÇÕ¸õmü>Ž·€òP¢äâfTÒªGq!Âñ •¦š‡º÷þÛ9B§!§€¬&Ê{ìí켌QXC[Â˪„¨«ÇrqÙ;în×IïF¸[(’´àšÊЯ`G!Wa¿g³P¨c´³$#Ÿ.Í…‘gÐ*I;ƒ#§Ô3n"*†6D]µÔ\ðµÃ)ByH?À¢Ó”î–*MGU¦9„ò´cêÎÈ¡,vh) WO†e‡óÍc²m{´ÍªÁþÈÛÙö¾ï (£Ô ”hyÍá:{ÓH¼íX®ÒÛN@»µ"Ðÿ³ktÒhê’jBJ}=M½“Ë3yƳ0Þ äLÛ×sø¯AÍNÊÁ¦Ù§6¡Ì4—ÃHKFóëstÇÝ»ØE2¢Í2Ïóîà$5¶aýò¼ÚÍo;lLíKñÇ fe´½´“á#gp®C\öÚyU°ýÁ®ÍÜ{­ÕügÊ0Žg®à4Û ßߨÛÅÿqÔÊ@å~hvN$x :¿é…cßßV.óCÊçµ²lÊ#8!væg G¾f™¥V÷v–Ôf–ªÆ63èé;¾EÜj±Ø«ˆð4Xøn:¦Û†ôƒ7¨=ŽW¾QÖgµ§Vk¶d›1ä\#[÷¼DõÌ‚åú¼5'3«*«»+aA"÷UÃr»©,ª°¯‚W€ÛL× ýðý›qÞÏ?4¹ãㆠ¸ó}!SÍ–|™ÒÛ ¥ÞT:rÍœÖÞ4Lcø…iÙL<¬ˆ.í"¢;Ç_,æרÆ}·ZCžøbÛD¿V«êX7Þv/X€e¦× úº±)Up)bÕ(RF'‡¥xÑð=GD³¤„Ïm“ çê°ºÜð ¿)“Ï-[)lBû±KÅÝ¹í¶´Uþ>足G›4ôR,³!ç3Ûb•†9$.¼µ„¼ì{N‹ þ}N!&/&ñü§âÌ™«7¶÷OXçˆ6ƒÔA ¹Qßiª¿ÏauÑÂDeg‹ ëÞп0€‘IÅ t ,ÞÍZ\€»øl¤æåU)%ïö³G@vÊò¹»®ì“RnNÛ Þëðö›§´þ;×!à°8f—¥gQ­Wã5aøxØY¸d¡Ñ÷š´U° Gàö+ë­º`B¢ú¤Ç_Cä¬j‚'³Þ•‡ßðr†&‚CNl{þiý]g§û•“Á„ø]ÕXÒš)”e– ŸÖn]\¹o/cÒS)på9XÙQK²’uÖZ’òû&4¦&~±ûæúºŽ´¨,iXæ›-€©d3¡È@ë 2w!ht±Yæt"8G=¾‡u¿DíÁÔl׫é‘Þ =¯X½=&Œ_¶EéíÛ"M°‡ñ}ì©Fôj¼í[iWÿ^™¹î™þ×ƽ“¬v× a.©bsSŠ cu Wôs]ÈÇŧ£äÖñðÛ€éÊ!b»ì[¸6%­0Ô•sy¿JCšF1+\üRé ý Ą̀n ß\ÿK@g)¯E3"†%¢{†x?Œv‡©ù%h"U}«x—œÿrò(࿇/ŒÂ×Pá¦rz¥hC“bEÐ릗”bWæ×Üî³ÿs4œw^¡Ýœ°ö$‰Šï£Û/œ³ÐC7™ßÉ[E§l€óuéBÍ"Ï#gLµˆ'«R'î¢íÈS¡I— ÜYw{Ïw=“Ž¶õ£TT–‘ ú2è±ýs¹eÈ÷ñJ»Ï d -!;] ¡ºÑmv'ÄþÚ†âäìöÎü±ÞmĦÐ>”pFŪs}„‚µ:èLŠÑÔ“ú ••^÷ì9ሒ/»>¦z¡â¬€Jé÷ëdžD°åοUÇÙK×…V_¸ñP„¬™]ýΊdMÿTºt5¥Ãf¡¾åhmcü¶$ ¬Éý{ “9=ëjŠ÷P±ÿWýò{¦Ç€•æI\’ƒZäTö¡¨Èà 4Çɱãåè>¤éËʨÉ)Óž¥+úZS0Íý4hïwð’²…õÒZÔ…­ƒqŠ†§•ª„f)D|­Œ›dn]€óiñèx¡‰¾òm0ò¢˜âsóK¤:–+³Ò0¶(e0‚a´h.Ùl&™EE£i‡F_„¥.3_Ù_Ô7=¡ê€«þ¯É}Î;1eªè÷Î…åÀDl‘[Ы¶x'=‘I÷•ÃЄÌJãfÀª´VYiêËî'þ™­Nt~Ù+ö»†$Ó9ä€äˆ®Êí(3tÖ–;§ÎÀæHzr˜¤/óÂv‚’¡Î§AŒ\ÈY•ÆÅê…?&``ˆóÔ®ˆôÙwCk•ß‹ÜT·g/Òî,¶cA5Vß»} \$ÐäC*²x†…™à2:ÂË7õÓž„"ðö˜õ/ØT _,\­ó}¡KÕö‡î’ññ!±ÛwŒw Má‰;Y/›€Û—¡:°(þTW@œ*œÒè‘rÆø¯6LJ‘ü0$ü6àw1Ãdh‚‚é_ÛÏÉß ¿Ë»~ qåh1EÕ_%™hšOQhˆQ+Ö/ £{HÁGÛ¡ÎÕÖ &£/Óï!Jª– ºfíCR‘!<ÁlÆMOúny˜ð‡ÉG Bc®®×vB¦þL'ÍüR^ƒ7õöÁ1w{ûzYä S¢161Ãçì>~ÁÀw¡@…_k*3‚‹—¿|Õ1±=³âõ|yÞÅ6y²x¿tmî· 7.yxÅZ7=ˆ/H‰quÍ¡ù†ùO”~—iyxmîü¡KLÓ"&Ã`nuRC½'­þ< ¢³7øíï%j> Ókûý½œa¬w&¬¥[½ø„b¿d˜®÷f ­æ½:>ÏÜa4NÝöC®0Òáâõ®RÑ—{»»ý]êÕtÜ)iÒ¹"²H#¡ùºÿ÷XX |S•D1äftYæ@®ög(a(~ªäºÝåb¹ºf Æ¥…ÃícQjÿ²Òïj¬û¼dO?Â7h.ù¾à<ô^ùáÛN¦æÀ[<ª‹roã™̧2ø¶†Æïv¥úÎå@ßÁx}±»š)ÍÍI{4¢Y%ÿ_ýÝuwëåØÆyÃI  ½Dšfû­üoà·…¥”™š6¹®ÙCÅuÉ=N” Uú¨9WÉ æûôù†m.ÚUÃIo}ô˜êFMe/\Õê‰ã"œê @ŸRÕ^Á‘%qgLYºç-+M‘#®䀶v˜â«ÑÐg*=‰üã ;`³îù|Ø0åÓæÐ8Œ\€¾d1Ájà[©­sxÒ»•§0|>¯^‡ØC&ºj„عܣ‰ÛK›þÙÔ½1H”¿üz&Ôú‚ïÕhk|’¼7‰!ƒY¦8ñ@k6 þî+Pjè4W!´™ 0þ/cL7WDª”‚~$Š[ y„%¨H:ç…t4z/\‘6Ü}ú±ô-Oi`¾ŒwæœÝH¢¢¥ñ<•¨‰€{’Ö$˜¹$ÿ ›Í4ž­²N¬’ÕIÀ ¾6AÆŒ+ïÒpÒl¨²~ׇ›‘ݾ,\Âíû¯‰ßÏ Ç:bŒQeAcúø‡t—»ŸÂH›{gc‰”*Í¥H¬åD‚GɳzŸk€ÄÖ&2s{¹Y?žf“ÂyØŸÎw‡3-Bÿ?ïãñÚ/‡X½©ß¿Çl¾jøv àÚ°öŸÂú߆ó3¾rˆZyÂÂbEÎàe¦¸îNb‡ªÇ]• ;«\…ÉN9»^AáÕ—òÄ1Âœ[iøàu£ ùñåÛ¯ærq„sMî-ºÅN<Ûàh‹¿QÇâgl ‰¼Ô^Œ|µVeÑxãCïAq룗 3=›ye }ÃûDh–ü‹ªwe\³'[Ö².¸é9Í@wç%í>7à®ÿgs>?Ü5’Ñ` ÖÚr·G¦l¬~^<ÿSÜr§¥í ‚©sµØUÔÎo¾mºÎ[ö[i÷·zWÃØf2¦R¦ÔCÙU3'Y«Ë¦›´ËçºÓš5&â¾³Ô3B!̹›€¬ø"ÃtN_µ~Áç}pOí")ø†qŠPPƒ¦k†ŸeS§Ör;åeA K?/ñÒ¢9„ûRºt3+È Z³ëòœZ÷› ZßáÀn@ëõ”@‡IÉݧõ¦3zÝ ÏåF^9Ëëh`ghÊ¥[è³+w›ì¼{À7^á}v…¤7í Óêwm{Pµ±q—Ñ°B*+LìD¢s]æk$ÿª¨€4]I/#FŒú™ Ãtqñû1úãÛ§@¾´·§èšçtã ä`TÅÓ%¢’æúÍN8J«›]5ŸÀ%϶p#hâBäÛ—…ni…ÇÁbÜÉ>ŒïÜaò¼Ý؆ ]É9±ïí5w Øäö¢¶éЮ M8^µS÷4ó>J•FE3˳¸0õÅÏŽýGƺ·†˜€þ(QÄÍbȪsÄÊT¨ÛGU³4gBìMö$šQœý}OËÎüUKÑocѨà½a!/Ù:‰(rî‰Ã澈vùè°HÓž¾x̾_xñ¥C¬&CO('#–OhÔÿ RÃsØvÁqCEÕ´}j¦@ñáãOwühϺ }ÃåÑÖà~èwÚÖK)gxÝX wë&L;ðh¸j¦è¡8éœÙ$Vß[½œ0‹”8AYcé¤/TýT*‡¼÷äØ' bÉËm1܈ÅOÉ¥"JSaœÁ2¼ZäÒn|½ÝJ]ä7ÝÙ{;¼>wu° ’ïHïDÜE»ê’rܽ&&²’Œñ–ж֗Ѿæ¶~ìÏl€PßãÄ<¹Éǃ<0àø%<*9TÝè0PðP0¾¡Òwgžöú%ÞF{M‡ûÛ±5å(‚ÔTꨎÈõR®í kâ]8çãStë©_«¬*ߨÿRõMýïzªçQ‰ÜÌz€vù¸%òĆ*†… Ž¦Þ[Ì<ö¨…§œÛÂï@(wk/vÜ UÀƒNÄþ•»DÙ]Ï{A^÷hÌáÇœ’dÅn ŠA_$eSâQÎwkæ…šÐp±ß—Œ\(Y^ÁÂÝ=·Ë|Œ:AQ– Rs­ôì6 É8ß&‡çg^ƒ â¢ç®O8dyàº#g‰ Ÿ›ÅDãÁ4žæˆ÷Ò&ô‹®|ŽB¤oÁ#Þ•zOüÌŸo*½nâ7êÙ9•âÕÕ’7Ãç1áÁäÔóáô¢äÛ@ðm1VsF­‡ ÿtšÇ4‚ĺ*‚bágãj‹bpå%¨§ë® a–’ü —“Ÿö"ÚŽ®JȘ•ö‚øKå÷X ”zá/@‰gc¦{ eñ}õÛÍ_)ÉsmŠgø½8k±mv5+Hr«IàüWïÅ¡?€üZâ½þ+ïâЋAÖw”ÝXÞK´s _þMJÉ?ØËÎa/çÔ©+çì> ï’U³¶¼WN5­[X*K#›‰Ö°NñKIPˆkþoꇧ` ¿°¯èÖ² ¯QË å#ý‚øR©ÄÞ‡•…>^Ý÷)qû=ê¼5-ù'ÐK*›-a½¼6 /mø£P<²]Y#ÔcÊñö}¬„zõ¸.^Ž¹ýá½PúÅ“¤à3é¨Ú* 8þj¢ž³î–ò¶Ì`¥k:pf[ŽÜòïcͯâ?´)°ƒ°;;1Êíá™À4'æ…^‚ ô ×ÖÜðÀ¸1H)Ää<éôtÒ¯T™º†ò Îß4»èÑ9±Æ~s Ò%Ð ñœD¡û^Û/€X¶Éúåìö°EËÍü€".oPdsû> PÐ&-y¨ÏàïfB° Øzã–\ÝÕœýÔ}õ2ŸÓ N\k¼¶ˆ`™rÙ$`jE‚ï%S¹$…T†Þð¯†àNW\V«%,Á,€‡0Èhahqmœý¥•@ùþ¢‘$ðQÊßnÿ±î^X@ÑømZMÔ¥&Û¼¾-£ùjØ,à J@.ü'H#jnÉ „NÏCkìK3a®'A„‡üÃMâsŠ]7D’rµûn//‰F‚¯xYHO¤T<¦L#ŠËšA§5ÇHÞ}KYÁU÷¿›*~š®¸Ÿ•é©á¹Åÿw$WÈçU«]%"¤þÐÖ‡§ƒ ›î¿÷OU•Ê·ïŇdaö1¿ú#_DæÞA¼nÄoŸUmš8ù7å€%ri¹§)ˆX»Æ ¾ÛQì =’Hõ% YjÐÞSjZ!»½~Hڇ߸¹/hL4ÌÙ¿@˜Ä tŠçžO®d¨ÛÖ}&§O¬—éþ~1Ž§¶ÛLm…PçU5úXãZì(;áIÊçç:4—ZYeAèó[o÷®û®Ùn ÷˜eÌ¿^SõÁk‹g&¶y¹ïÛD+ïÑÞ• ă˜[­çÞµ+4*kò>Š. ïÛÖ€'í†àý ¤QŘ¾Žf®;yò•¶á->ž*ºF§]` Àð#ù,7œ£œÅ$x•?£;¤¹Ü:wÖ'õ¦ÒŠqšŒúÀ–]· Üå:@E-&jghöê¡ICüÑXÐs&cÌ"u‚óUˆ·tô#ÝhãCeQt-ltó’dOÚ®¿Œðt|¹0~6ónB=ÖÓ–â@ÈË:6 ÓUÌõ ùÐ-®Þòß üü Æóùª„Á—s­öÁ‡ŽLtuöÚ3wDÛD(râ;KõÛÉÜ'kªÌ,ù÷éÔ¢ …™qd^ðG0½ÚÃÛk³Ë–€€€€€œH¼9‚Љ¶ÄöÖ€€€ñž[éðdgÖ¥qWt³ë—cÔ„&¡L‰ðR‚Öá04 ²V7´Ä¬”© °œc¿éïA°L’T3ëqYÓ£ÆNd8qI#…ùÃ…‹Ø­ª-u:WЄÎòƒ”h¡@¥¡=ö”ü ûwÚNs£|-»=’¼m÷7èh²{iéºÊ<{|}»Y²™#íËýâ‚wMÛž˜¬uéÒSI£Ť-¿á6é7…´–N ¨¤=ÎG}Ü>dŸ ZN%¯^ÃøÖYÚ_uÑ„ÑYB²ÚáóZ¾³†\¦ÊFÈ%GæStð² ¸5“x<-¯½0ŸÕÏ8t‘q©{äµÍQ6áBÐd¢¢“ÎZM4úŽÙ£Ÿ—Â8Lc&„Ø.a¸å§´©ôÏÒ™úŸÖa9¶Cýk;ß`éÉ4d¥î·>ú83—-–åÝ-å0úÊ/þP»ÂY©­} O¼ÈÝ,´>|Ek6Ùq_>›ut'Æ=N*l5)Ë–@a ‘þµÚ,Ç`òi´p(·‹˜tF{À‚Úßó\N;¨*ËHY4þZbwûªõ®ô5§»2l×ZBøu¬RP@hVyÀÂÐjÂS÷êe´ç™×,€ÞÃ8ÚjH¤3Rùb„Sh ´ðpEqfQ¹ÉmÆÚ%•v0”UatVËå´ñ;öŒBq Çû¸V͸¯ pWô t˜{#÷#nÇ,+h”¦êÒdÌÃônå‹H*]þ mH瘝ŒApÀù…òÈc³_ÄEàPlƒ^÷›H‘šnÑ0¿…«À&JŸ½Qdz–•C´ÈIØzää‘z¾Bðõì‹Üò‡Ê7T@L2 KMòIÐFÀèŒÄ"@q9á zMeŽ¡"ËõpPÊ’a4!XfÍë2sƒ'’/¦â‰§.g“þÃücª<Îkãx½‘H¾­«d®¦aÇLšØ€À¿Çs_#e+T¿Î‰—>ƒ²HˆJpö—ä;ôF||ŽNÊr¸.œ¥¾Š„ÒìšsŠPHÂØû1Ù®·ø©¸‹ýë{Ãø ñµ‡QK)·Wæù¤Júfm @ô«)WN¥ÈÍi7[¬ÊÎÛfF—]>TÆË  Ê™s¨¤ŸžûJý¤ø¤Tsúî/èŽm¦.¤n­…Žîé~ò¼›FRq,P¤Œ7ÔŽÞç9ªM²o««K±†r&qmM(Ê–ñ-ß~ÿ}I&ðpU³ˆï¾9÷±t™@Uãr;d³4¿¢b(cË º¿î'SiùfR¿íý\Ú*s;èóœ¼)BµNÜ7y›Ö/ÁÚÁ+g‡ÀjêO„ÚÛ™÷ †9¨Ý,9Ÿ-âyŒL*_=r|ËÑ\؆L3$± kôb±hKJ½rÜ9’R¯Cy馉%"y~ ´†X:avµ¿VÊé°òRâC›”Ü]¾„­é°s3ßà‡ð³ Œ¶£J¤ì¸1qF$éÛ{BùzÕ*Dþ@ LÆù…X—¿5ý]}SÊ{m©õ£úÏÔåšhÖÝ{•g¦+Ì¢Ôh +:’ÅËкM‘¤!mt‚?ÚqvG D WBî™ùV´ÆiÁ̈VƈgË`fv/à"”>|›d—æξlŽ¥ÞÓ†Ÿ÷€6@nL—Œs÷Õ>ÇüqM §ñ?ål×wD&öb¡s‘xŒD«yôƒ¤½úÓ.f/6… 5˜¶$»”Zz†j|$w쪋åü`6‰úr¡qÑ–"s¢E{¿gú,cÕôïú£dz—$û>3 Ó€¡_Ø`’ (tØÌøm±)¥‚®ñDÆVŠïyN ÃkØÞVòl1tþ¦ÛeÖïw[¯åEPÁŠcÕ˃|U§·¡ð%†À¹ï¬B5-ÆåËý¨œ˜Ù «š„ðm»êo*ãÛv÷ïM¤†v°dÝò›ÌÛÌEÂõË•Î]”‰ç8¢½Úhš›óÏ!R îM¹ñ¥;N.®—6øpp¤ˆbÛ l/æß-®BϲFiJA ‘['p)˜@’á•äEÓÍŸ$ªþ ?@•ƽ½ž@5šÐý.טG.‘ «¼¼ìn,Ó§³ }`do"•ÀâÛ¢R-ú·‡Â Úäw¬“›§·E Κ0cD7ÇjFYÝkF†ªW¡øe©¡â˜¯„f?{5ÌbÚ¡ÜøÜBN]J×øa‰œ qí)çò¤ëéš°YãÍ#‘·I™4%5ùoŸÃÉ`dÆ……ÔÂ*‡¥èhmt¢L–\Nñé±ñ›þS°Æî¡iÇÄëùbö©ã7*à_«)í‹èzòœQ.ÕzÚYmÉ`æŒòþCÒØe¶l÷ þý‹‚Oëò% º}&~Û×üÔPØ-ÒØ!G|C9ûÿ ì’'îÜcæË&HžJÂöGP÷N“Œ;)…â¢Zäøl9¼ÐÀÖ7¢9ðázTÎõ¨‚¢tFôd8¿?¬u–Ìkïuq1‰Ó£‘§‹¾Ô T a^t#m€˜š³sð÷òí†h¥B¦ÿ>Up´Š¾žNfoØHÚ/^>A1ÒXÔÈXÆy©TÕì®uóôË3 c6Yg‰¢‹”ø¦6¾Âð_Ûn<°RËW… ÝóIKR¬«Àž¿0¤‘ï‘Åu„˜.ôÏDí½öµ5 âÇ ºæx÷Aæ*üø†J†0ûYµßrV“I1Âæ&$I”ÀÆ£Ú•µø—2li½PVOß& @Eþ1èbT´ÊÍjžÞ%sœ±Æ—³ºîúç@=êP¼Réû2@…¼óÊv¾½ru½¡ŸÇÂz6ö0½ýòé™'-g‚4òZ~’†û»&cþ¹ Ã ÐË ©FŒ& *æ±ø±.¸¤ôa‚ÿr®éä³MQ@Öà!ÝËkÑ-‘½„e©Y{¹Eì-!èzëO‡Š]ÞjÐ|Ë8&“ç…ÄSåm÷%óª?m*DÏ‹ü 46À¢©†(. ßVœCn ê>—?PÚyüñxø°<„}àH›½.(s•]®](H4ÛWÙ’£¶ø¡JûV§8@èfZÛäOai_•[î’¹’QV£ó͈¸#&õM}µŒzÛ·“ÒäÝæÞqÎÀÔ7t‰tðqêyüp%˜ã]œyzŽî“_Œ†_.Úe~gêêµSø.> 4þp“Lˆ á±ê7É~팤H®í»©q¯ MË,pé¾ÔVQò«©¾4â®TäùwJ¹YÚÎl; à”¦éÐ÷¬Õwx,%2¯ÿÖSæó£)îÝ7‰J(Kåi¦ouzßÝ7,go2>£šMŠ“•=üψٗ²×§[¹N¯"Ó‡‰œÙõW& ûÏ,5I€ áèâ Ý¥‚Tœr`áL2P áþHáÕk‚¬„°qMbõ ÁW`„9¶‡YœÃË“ú Z!Ù¬]æ6ÞEsrܹù£u»rväí"´’ÿžç¹8$”ľÔ{~ìoâî¨HÓò„)H_Ɖõ %·`ÉGeéíÄk Z€ Êóþa‡z!$‚RñÁÒO ÂÀDâDEx©ÒO3ä>]KÆØȾdÝ¥ÇðC©\†eœü&ù¾¡|¨tjÌýß1eîÿVdÇgÿEWïñ be%^bk[}!e{r‹Ý(äôúœJVpé„„“¦?‡Úêñ«Å[B±½¤ã#Ó9ö,P´’¶] d×Ròk_´úYéâ$8ÄOªÈlSöAt×U]³·ú/8Öÿ€czÖ`Æùêá "Žê_yÍ2~äî7óÉó{ïï‚RL^P#["Þ~rßa ú@†ŸQŒ7 /Eãí¿äæ/ÔõÇô“ ”`éFS†Éor¤'Wr…ÃKs>(Œ^JàqŽ¢ºm!—a–W$Á©ÁzA’¿ØóuY=ÿ7p”Θêμwû/;uβ˜·å„j„:˜fG3«]á²éûrE€l÷Jöðk³^ |_Q§ðö·/µ^Q=fç*ÅÜâ¹ñ=ÎQDÇqRÔ žDbÁy?%¾2ïÖnÁ:ÜRmö Â{JYO–µ8Ç‹9;]â] ß~p Ã}‚Û„öÔ õ‰sl›‚6[ëYk£Ç`mÎÔq/m×ÞÃô·äÖ ç¾<(Z:Y-×?nôð…»(\d Xktôü! b›c||@ƺœ£{é4•×6 Ÿ!<ëÓxûW†µ«Ù9s/ÆàÚ—_oùµÕæ BÃsÒC)Ï,»t‡ üUî—7ª-Ýó7âÈwÊjCk»E²’¾"©3ål%Ö±z³¥*íñY²Z‘ð:w…ióÒSˆh'ÃõCü8˜¨( Æ“af•7£É"7”%ì€xÐí~Gj—9ð¸­nž G<š@Y«\Y¡¬ÂdWú£âYƒ‡A]'Ú_@6¤²úòPá°øÆ]OK‹ò{ˆ%.X÷â~dLÂ̼`¿¦¬Šìט1‹2ŠmI¢®ÖÏ®¨[`‘á ÉžöM™’¶‡pùZ]‘| BeãÙÐFWÊ·>wˆTŸä « Ø%*¶Ï9÷«û6ËñE›ž4"½³À{nI¦}½%é4Ûͤ0eñ’¡E>}Bz%¬!8^1#Mç{-,Ÿ†k²Ýé›h©Åÿ-Ë—#ºSù¦ßgTSÄ€0¡ CLì.êԬ̄f¨8Ôå‚€!êˆàJäàðšêP¼Ü\dÅ,„ûyHb.|Ï5f:ŽP¼`jd”ggYúëÌá:c²väCX°™‘Rጧ à˜€@üü þròئ Ø?ZÃÔþ·epÁ×Ũ–vI®˜¼ôâï–MÜ C:ª‰R¦™åÇ6cðaž]’K>ozÙÈë1зK@FUR2 ¾xãÎk3¹Gh[J飚9òk*…û¬i!m¬Z!ÁƼVn“Bø¬”¹ªÙÂè¡Œ^2{`$xàÇBjù…åïN>³U?Ïe˜^ƒ–˜zñpý4bf\±›šòÖœÊîó¸n X›‹Ú7$‚Œ¸‹Ùú x=’Q†Ã+j¾{7ð§p¶nð²ÀU=€)¸eFPäÀã°ÃØC“± TŽƒçgŠ¢Mì3ãpyvxjÑŸ8Nø'ÖåçÐFRÉXTŸPªlpZ€÷Ž\\ÚÝ!€ŸÇÓš_®¯X-ôQ™cpòðæ5 d¸wõ©?ø7nµƒºw9´¢›«H|6í"æšO2_fT²"µ1Ó/ãâTýnº§h)æ]¡¨H>3zÚÖ°w6Ú@þŒx(#Ïâ†~~ÓsØêÚ¶W ˆ3sŽñ]Ì>´²mú¯þ‰[¾hçd';­ËàÚÊ!a‹ˆ,YÒæ‰tªÖËît^ÌÊ_®æ1âè¼Ûg¥§¿/¦J(£¤3=ÑVö±\ü¸Df+£/ÇsÜ··ù°çdá•FÔG(é ¯C4k!ý¥ÞjÑ‘¸—YrÈXúœ×š€6|†N«y9å·ƒÜ4Á¥HÉ5œWÜ­pœ½íbZ×Õdœ5GËÐÑ×ÜÚðDw”ÍàÂÙ¨È&>±‹ãLž €ÅšMúè-«"¦Â ¿$Š œ»¶×\WéÙ ª[Û³mÈ‹¬Í«Ÿ‰.>>ùKJ5,§\!µ©q¢Y®þñz rÁš3†± ?y9¸¬U¥c|±ïÖ³üßÎp\eåE;d˜¿˜Ÿ ñh®%a”|úâÈM A›Òó-BÓ ;r´…UÈPôSü@#ßáN¾kV ÝnÐÜ»h²ºEÄ4Ôë¼@ñÀ´'¬²@úVøqU®õ…Aøêºm+vŠù%ìˆv ÄÄŒ; ð~'î©ö"È8 ª‚PÊ?'¶ò#Á¡lØðLÚ:Ê´ž5ó”?ü:oÉ-ñ„¢TJ,NI HâkÀÙøñ¨ˆ #u¡›[í÷˜zK'üK§415eeúî¬Ãƒó6i_Öêìð"‘Ž„Vnl€´µ©ÂÝšþ`6’ýÞ³3\ˆhŸ²›AÄùo2M2åȹ˘E¢â Ýd~KźÑMAäÛœ6¯{¹Þ¿I‡HKKÈN(f ͸dð×tüÇ° ¨ ú†vEyInl˜&ΔYá´*~–X?CתQEŸöÓ¶Ë#’o9’cûᱩãÔ’ûˆz¤9ƒ©g •qN]æ$©"!+‡Çø‘HkK¶Uz\iDå"6ï#á¶^ø¯D7Kæê\á£=A<§Žý«;ÊÓz¤øbäŠV¿Ø}©»ôZŽ*‹¼ÙäÓJ=B“$[áô½Òñ !=(&Tw–ÆIK«gŒìyÛã/kÛDÙJ¹q*Û ku·).ܦòMÆíoÛ»29¯œAÂéß_*“g€NW=Ÿ_kÏÇm0úÔšƒg«"ü(cÆmK.“ïõÕ}&a‘ óµå’¢úÿqô é)ê Ò•ÁS8ÌœWùÁ?_3m”Ä` íÝp‹x7`rƺ ½°‘:UÌÂùIõÐTì‘X]ÆgùFý Äßš®vÚŒï¾h "ž‚J%t8S r¹x«ØÊuÖínM3 {qú_O>¼6*OGÔ‘~¥‰bÿ}OwÛ7èa1üôÒ{+Rõ‰ûï†4^RÚˆáç £ÄµÚÝïäÍpc•0Ö‹¿”:¸ÝÀ–VpÆbwœ¬ìþÚqňÄo¼è× ¯õ}àìr¡qý'ÿTZm ‚E@u¡‡¶`ÓÉÏ)Th>æV7¡Ãï?œNÞ¥á'Á0¹T&€…>Gváõ –ù_c&¸‰ fý¤NŠX¥Ó»õÚÈl5î$?%¹Y„Æaš–Àe•Ÿ¡@xÓ(Ãbñ¾Ý)¬kóùý…]EçZÙ®Óq/)ä[`!ç^{ÔKHÎSáÙz„SI"eÔ dÃt²º¹í`ö“‚úâE¤zRK¼ÍÙs½J+[GÑ5£ñlÞ* ¶NèÕ™Š|Kp;¡œ=ÿRoÑŽÂégÂî¼& ›ˆmE¥5²ê”N®ÌB”ªMê¦õÅ…ŸcŸaILžSô1¶a§’ÆV˜*µ"È<[“ã(Ã!°Û8¶¡â¬.ÆäÏÚŸ=ÁxN³ª4 \ ™|Tfe/“Mv˜;“žŒE¼é[Pý¨ýŽWï¢8|Û¶”y‚ìzM”BУ¬ô&Z6qAéõü ýSóOÀÙð0ü ?›üaêOŽüzуÖMæäÜ<žw_. ~LJ=ëXðƒ}å[jŽ.dY¡“11b2‡M=Ⳉ*{ ï!ôv~øqÒäÔj|¦ŽM‰_œùœÑAâ[Ò]\ð4lF‹5ež¬á\Aðè~LÞá•Ýu¦V7³ÄèÆÛdÌ œ”=_±*P®ç_:¨&*;u”¿Vý¾Xsïl{ÁÖö|¥:ø#q¢ÐH! ?ÈÓ¼«ŸFKIÝ$Þ–/}ZÌCV–r¢/Ý¿kÎå?0λõf£¿—7s`´¼wÉyùb›xqéþŸ î×Å ‡²ä¿<஑;¹TÀ2°Åùuåäó÷ñ•¦o÷E?‚ŽÌ·†ÿÞ¤wœ}^QÅ_åL§Ž8Å=v±oÅó¢ø»··é­^…;~Àc$L‚œ3Û›•hÛ„òg]œ8ƒo¦[1í6$Æ­ïמ2l°T2ð1³Å¢S J S8ŒZ©¸Å¸ÉVÎs Θ¢ùxÙÖ:%÷¤GŽ¹PÒP‹´G.|Íz:U‰;wkšñVèƒ8à€¤ wþxҸ:[Y*š’%4OyÈÉØlŠE{3µ®/Tr7à ”{b„AZ šˆ +VLŠ@XvÜ›öå-ÃŒq²]ÀѲņv!ä:w¸»­ˆ³Û‹»t{ ¨”2QŠ”|éꈂ«’uHÓœ§-ü @ä¶ë‚—M˜+ûªõ¤W%ºÓÃ5–ö€MÁ£™þÀd}{©ó0fZ2<¢®_H×—.i@e]º˜Š†ÞÊø¬…méªd¥ÀùÇ@o¤m/â——É“ù!òŸòLA û1@ô8YÞ>*‡1ÂEò®Ý;&p° —ÌÓ’t»Úü© fž›|~‚h«óòhŽ"x«ˆ“ÜÆ "êý~^Ü\ŸkóӯåµPÓôò²º­1âd½Û˜Ôkh¸McŠÚ éøé’+yí+[£s_™·›ÕhÖ[2è°*Êîìr4J›‹bd y¥ß¾hT˜„k$q¹ÄìYÒ—ÀRwxG%ŸEýáØÝöÖÖHwnœØÖ”¶¨ôœa 5á]ݩȵÀƳ†¤3Ý0Óì¡Ô—ŒY΂õQR íAì 䱃ËØß©HúvqþWyÔÂ9›ŠxO»D"žAŸ!ö¯ ¶×§Ø$ »zxB(ņõº‡â¤aÜèm|@`íÕ¢)705—ÿuó«,’ØHù‰tªú³uhÓΨ*‘÷B¥—ýL«3üÇ ‹|ü#tzjáG¦ŒºO®a_=‘Y–ô~¿IŸ …6œlõª".M&¶E,䘭üþ×íM Œx¤ mÝϽ6: ŠI;~!ØT2åÃå½Ò8¡Ô>бv‘øn Bµ Œ4ëÙ.&ã–)P'OÁ!Æ¥ÁÃ8 º… Ô6pkm¦oönW?¿ ÜԜޟŠ6áÍVžè‰õÛÕxÇGZEØeßøiî0MŒNüí°Õºc õŸÝb ä‰9f@à -,©ßŠÐ/+&_W(ÏW`k'õy¸‹p¢»µðÑȽœl`žqÁ‹xÃ4?*> a.ÙÀ‚ÀTÆYF{ü…_Øk‡×Égq XIœ- ¿µeÿmA #‰™Žì>ÅÌÚ`rS«žñ\ÚEßäaÔòüj°š*–7fYÀöö‘:–b½8ü«]%:’Û„‚šFoéAÆr?ψɲR®³Ò‘ÓÊžÌ‘ß ,QÙZh÷ÄÁ¦·ˆ²ò‘ÿx€Z æ¾Ox”®†œ‹¼Kê⮩ ò­=)8E(Ö\4]Wàû`çÿsà›¯8VŽ¼QÇS`šÅÔkåÃýO–[Dï›ø&ø/˜-A@ÒÐYÓø›U$+i“ØišUQß{_®¸%28õ þò’üKt~µn#-Nd|ŠhGaÃ0³ìö¯Ý®IZN0«XlÎØe¹ 2ÀJ`äy ¥ó~ÓáT¯å½9Êü…Ź—ôßüUo6ø+`7èÉ =@ûMaÃ9TKT¼Š»Àô]·%Ž Ú²m[Bì­ñÿƒi%åÀo6u±–ðú‘YñÍšÃÃVf­}1s1аVÀ ŽäýjåTc=†+>Îêl¡‹JÒWõf-l—…9 &;gåœò&:-/Œi”„¹J:¢¶¨|ZŸý¤Êa¼”ÿ_ÓÂÌ)r`èT¹¤º5¾Ú0¬‘¬¦³þðk¼Âa;†*•¸ó8[œÁºn´¢Ì¤‘v~Œ…¦¨YéIrƒüy¸Æ`Žî~pJÀ#1ºò 3ª$ÐÇ¥¾ž™Ç{˜*#F¾MôÄ@7|;Ä‹(Öä±ßf%%qý7ó¼×_/ef1‘ª—+ûu&QÃöÖzn ]ù»1êgwZ pð¯ŠüÇ—ëûáE“eÏùaŸüp'þŽûŽ"GD8íAÅŸ¥·jb»(äžQB̲圖œfò¡™Iŵ ƒü°.<6*h‡(:e’0+¡Ö)·ø7mE¾q0 k3 ªÑÝŽDG9Ï[(ÑÄÌ8£Ù\K ZJNwÁ` ÿ•v™Vøg–Øîç˜5Ò÷´¹*—îHΊ¹fU¡H…D¯bëvBÍâÄ Æ6:k+_†X†Ê`£Ôø¤¯ïÝÔ÷¡DNÖOv™˜‹fÃÓþþ6õéqRU¾š <]8Á€¼ú‘?E¤œ>X§QѶ{Ie"¢Ÿµ0H‘ñðuôQ{ŸêiÛrïRYÇôÊr~x, Q)߆w3E®•–X·´kÈÖlµ»rŇÐ\lÿoæ°¥G¦D>:·zKæÎ=óh"´ÜÙ¨ZgEáÿa§@ÿ 5šÁ>e‚õ:iBÀjR¾ÙÈ\a¤èhmHå X8°òªÏ€BßËÔyÇ4ä’Nl@ÈÈ…¸Oâ\ÛîèÊß_}¾À3çžo¡öX¢`´Åà·óÏ;k¥‘à[Ÿþü®q9©ºz×D¼Ö”æ]þJÜë{ÐÊjX£ÛD´ ù¶v ã¯KuukÄ^ïˆgʬvl$z⪅àÂt#&¾0œDîó@Áã¾,4ÕÈ¢þ’Hßéóm#‰ ÇX|‚FÙÜÜàtë…Ðê÷©‘²Á‚¾ÈôÒß^¹ð¼o}ÄPÌÕLå6ìó¶ä4ñÒúþˆƒû)ZAã6z-¥kqJÐ)‰gkuÐ=ÁyÆùña yÁ.=ÎÕÈ–Êg*‹È˜h ÆD5LèoHì.žÖ#PË-"÷KɵŒ«/†¼ §Bè¼(/&Ç}J†õçïÞKïÝë‚Ä´‹µ„…ÆL³|B÷´j©åýˆ\B!ô\ÛEYüI9«­ö12»J¶qÍ`n ?¬l„"èÐRM=eÖyÚò]°{Ô³ÊlRv­N›6ø¼ü±‘k8üY õxpõ\ú0³:q¬Ùv-Ý9©†Bÿt©™–ž¥Â)‹ u*2ùo£J‡ÌÞZßÏÑG™ž_¶FÅ'ôuö'þ•AÓwdÖÇuGÕi™‚†›™z‘/‰éKá»÷R››jV¹e…L”­ïâL}^Xª,Œio/ž9ð­ÄÌ*c;û•çîu9W£ý)¹îR( ¹k¤/Õ.ÒTÒÅDÈ°Æ8˜OÙ–‰WT¶q\ÕqãqQÉ/NþA‹sú¯­u3ò¯ô©ôŽ42ã2ÓžDë>àöîqjPFé³{ü›­A…mݤ)#cM7QÀ«Ñ<] ÞYðnɯAÅô1>ãAs1CQ¶¥É!¾ 3ûáíÍ—)U´ûN5ôÏ2ÃÒ–´cµ¬-(læ3\ãNØeü#qj×$=sEazÚÄ~[&±LB¨>:$¿ÛYïþJ0 –¹½ŒiéYq(»À_CÛçk”°$å»khDˆ¬%8ÀÀÀÀÁÁÁÁÀÀÀ@@ÀÀ@À@t¼M|­h¾ˆ>gÏ#EÄ1* ÜNå 6ÔLD¢X6 …W6¯§7izE§°ŒÎI¬d@tÀ Àùð¿¾Zž=äà5X¦ºIep|íD:BøôÊ6Ôja¹[mn¨AÂeCwo³xÑ“DX>Ábå=§—8G¬âÛ‰ <ûq.˜í‡Pòg£žp‘UìØUê½,Åó‹¥0Eøë&Ôø.>0«€yÅ`îüÉŠ8œ²Ç¨åÓß¼t4O+]3(èS.×б`º®{µ‡ã¶Ö5ÐÐ6ž»Ž7[ÂG6D÷ <%‹k¥˜]…Üp­ó0ô –®"\à<›’ñm¼­›ã¦ßv2àñQse'› ¸Óüç,‘&Rk2æ•üN¢®¬2Œ–*MCš$’Ã|ÅË5Â7( ä;ûXEŸHÐ #õÛep9ø”©ÏNsŒ÷fÅF9f{T0hJÜ“ßÀ×ÆÔˆµQlX]`QocÆR Róº^ÿK8DÙà”¿ ·YXÒŒEjô%ÓMÁ_ûŨ(è>ï¹²mÉÌêT· ÙUá†- #Ðü‚âÓÀð…ÆŸÚuz 4ýOÀ~¢~ˆúQƒþQm jvf‡xÛ6]D„põo[ÒSÔîÇ!툰•®kóÏíE…Q.ÀÜy|•zNO²+ÓOI¨Àù…lf¹ãVz%ÐÞÊ«%lË¢œË®P-êù·”Ú'eþ¿˜â7…=X±º•?ÿ?y }Ìї­Ö——dHZžZzM£Fîðì†èŸ£æÌÑÙ@‘ÿJf`*ÀÇqiúÿ.±aP’ÿUnÈðéÕZ:«J%N¶u€ ýÕ¡P'ÍÇ•ÎÔ|1N éé00ǦtY”æ–ÏÎ)9u…ÐͶª¯;s9_ÚŸ€Å ¡Ùº[D•åÛÃÅ(Ná^j ïkÞßÖùzÞHÖ"©M1¯ô¯y9掉‚L£ÿRJøJ1ï×Púÿ}@kc\Š¤Ñ±M£zÇ”@Úo­Ž¬™êQ@Ø„­ÏÞÁéè·i•Þ1ˆX k.ô[Q9ök6!^ˆµä›ø!Mߦ*£#Íd˜1¬Eg2IG$)-þJ‡ÜJ!©bæta' £&›õmÕ_Ä€ ^» 'ÎüYþ“^mvM4ô†B¢}¯+íáNͱAt2J ¢Haˤ…°4RÞâi‡ÉqP;üûä­Ïå‡èÒ=ÂXãøjŠ¨>×ä¹Ã8°vI™C6Ùñ̇‡œõgoî ¦€æ1¢~aM•€5 ÓèÀY¡>Í ¡þ¸%‘¬4霖T§Ï–Åí,ÂvË7'¯ É%q,þMï]ÐÐ1DK óÌ•¿¹ñÁžv%\`Ï"ßôóúnÀ¢ë`€%b¤€ñéÂöBÁ¸ÿwk‡¸½I`^‚§°_§N…ho;&øÉçG­ÚNdÓº]ÅU÷Ök«n‹JX²äÐÒQd#­»ïl`Žjf!˜ šPS&Vð/¡›VKÁÚ5ɘ™ªŽ1¸[ƒkª>Ü|n{!/eUG½,pÊctNT†%É-8]é°vžˆ~¹Ü y1@G9*3ˆqŽ2Ø#½Êð=ÐB®gé6Fjå"‰¤[íWïQ*<(ŽéI¤ Æ8K]žë;þVÁÈSŠ_œýG›ªy*ÖÍ ‘¶´pÀój:aÆÆ Ý)ä| Y£uŸ › ½åöºF¹§1"<3 ©‘?"¸rüªüþ‡‹Ùb»o3ñØøÀ)Ú(äX¿Zîý‰ç€B.ܵOåq’WŽÆ{Ì3Æw$¬Ò麯ƣä¾?æ°ë_Ìh\wÁBÇi Ý"»ü™«JN°bŸ—DÖDïâ7¬É.’ô]{™:"‹RØžk\†© ˜"¿þãÙ¿Ú鮡–buÚº§ßªm.ÊXx§+ú¶r¾¾îÎj¤ÔîˆÅÒ—ô:¦D -¢"|æˆ*×+燪•†!>ý1f†Äüe!äõ‡¯½ »Ku¯´i.Ñ"§ä_|ŒŸ‘ž¾Fß TôöÂyŠS›•ýL ™(-ŽÚ;@¹¡½jó^·ð!#Mÿ¨û_àË4ò§/žŽ}° âb 8[,’ÜŠó¤GåópÄ“èÀ¸ »¿óH¤¬¤Á9Œc‡ MsPç´®Ûzò$Ü’¥ß$K„8p8«ÕcÐÆ0†lª.âÆáx^¤â?ÿ.9+ù0¯óŽ¶¶XÓšµ‡ïnª ð0éâ’Ê,~I ùðý‘ôX¡ à‡‡æU†'¦q4â*/rŠÁmoÀíé”4fÕࡾÏ?Ã;3±ùÛÛµ»ž-Öè_âEþUñvÃ2¡õ‚çˆ-KvÀ8 ü”¾pvJO4òoôY ÞÌ´`öž³"Pe]Ä_‹úˆ"WYSxP(ùéZÒºF}ŠÖC ƒÕsZÚB@ª”zíHØaÎ6D^åºsœÄu&/«…|½æ%~=à`Åûá6|è,ê´§°Š‹P+EFrOIžÐi¤0zgPÚî¦tµ!9óÛÌžÚã­%o~B–½~Ñy}C‚&Z)¶¦ £+z sù?¡ 7kß?Þ5 ×|šm·$X-.4ãéÖ2ª‰m§™/øMÆ/N2'0öõ+ûÉÍ ):R%–EïÙuU ꈭôþ~˜ö©ûeb½Ž ùô ¯õ›ÄQXí09¯+‹÷ —„¸[°§g–i»3®mï„hÄ%§ãÃd;ÚÇ9 ÆHžuô[t$„¿¶@Ôd΋´ùw¬ö¿÷öÛWx–)à-0»ŠÚL†Üj®¤CM_Ï(>âíåUZ¥L1ˆø‰7²/YꇛÜQ£-ü7[lšŸ¯ÌxQ%¾> šB·iZØÈØûyXéT3c™ÿ7ͼ}XÔ(M¼?•cð9âF³Z²Š”ŒVI¬0¸á‡)kž‰/„n‚s$ºÜ¢Ó»ZXð]z.°I‡j]…ª‰Ïü€0UΓ}ƒŒ/µ3¹xEÝÄgMŠ3¿V^è¾NìrZ(i-wÁÃ¥dWo ° ›N˜»KÿcS}< Ž™Í‹žÑûp•´-4ÍÞ˜bY^F@NFwH¬8ÕXÓu.Ù¥2ºŸ0H°9ßÔ=Œ%ŠÔ` IáÃ]DŽ*úáŒ:{Çt¢ÙÒö ~1åM´“‰cÊUBß#Td;>áy×Ã?lr±ø]~ä»É¶²×ý\-K¹´ h[fþPCðrZ¹S8G‹/–còû#ÊIch3j†T½Ïšeþ]ˆ ž‚Ò] €=±ÝçìÑg)hÒ®_W¼ávÎi6Rͼk’z#éô¿©mÝ8¾[kÖ“XÞƒÝ(0ÞC‘“ѼßȃiñyÐ{]jEƒöÃHOÿ ŒÛ,Ÿm²H|ý÷0u…OÕ‚-¤îú*—ôî•n)5>”}2ôÕÆíë¡'¡¬'­»e9­Ó è˜V’©7(+z ¬PHI]”˜˜¾—*‹Ÿ&•¥0ÆãŠBüKr$05Mu+€CQÇdŽ5B`¾¯Ò¥©kkÉ&ÒŠ%  ÿ>û]XVÁ kif Kï±–4>ù2mÙnx 1û%¬’ N_Ï;ŠõJ« rš6.ÍÔì—3-ë$Ziò"䶧jÕŸCÿUt8ã« ›¦¡T»]æ÷¨F³ðoD`xê¿ó4#BDîeƒVÞ]P½'@¤Ö¸qÊK,º+³¨¬MgkHwœ“¤hºsùÞnô½Ž9.ŒF¸Ð`©?gè2­%¡a 34óóªêŠ]¾qõC’n;ëC½OÐxm*À߈üSÚâ×Ö1H×ÇiJêX;ñ»‘‡«{”ìJÞoþxgöFFš2ù”|e6ÅûQT³eJ.Oêï,yaÑh‡ÃCÒõ=·ƒºÁ²X ·%SU£QÍ»Þ[¬_Mõôh~RG #âXfòà ,ˬŸÑnKÍQÔê]À¸•œ»^ÆÓDUJ{@1Ð æF˜ãâÉò SÒÞ0¶ÔqH.ŸnÙYܨ&<'9× °ÓdNg9(ýF§RkÍ7¹È]ËSò˺÷•µ±²W”v?LV/R' 0Ô² Ζ¯P¯Î×êŠÅÏ,Ÿ-À]»>Øõ‘ÃD‹üüô³ä+óÔ¿šüÔ¶!žžüÔç즑õ }•+지íà2¯'­#]*&©­¾£O‡g|›\ =Á2q<_ÝI›¨àÁÅû]¾_1‚ä8sK§Fˆ"k ¢o{÷ŒVÇåI*gq'áO©ÐZhO–?‘Ž= ’dÕ>mͨ§¬ÝßëSõo¥ŸZd6ÇnðÀïóæË‚æ¸é×dvæÃÆKº+Äâ*ô’‹$_d×cƒFïQgŽ|`'û^ «òÕÜUŒ3Ò£µ%¬‘ÝN÷»Ð^³…_iûÑì&ýVQ1ª$¨g†CåsML,|D6Çzµ5A] ‡M¹úÆ(ˆÓ`Oä4u4¨³½.?ã‹m4•“¼ëÆÈÀ÷y=¦ ›áÃݬüý·cÞ4`ýVCe¿wÀKbˆ`»G$7x1RÏõÆgo6í\g¯Á«–ŸN[’g7~£ö¨^™Áía[AP]ºçï9ÀrÕóÙû£ìï« ¶3êpê]—ñ1`+¡ùrò¨uci^U£ü¸«xWUšƒ(Ú…’Ýnê¦YGò£(ýîR(@åH‚ QŒÑ'Â3÷˜ªKÆo{p°|¨gBÃuв †M.èqÃyqÎã»3+K^íuœců-°ÁÀ®狼Ãf›s´sâ`•âÿ'êR*øTfÿù=×Ç`*vK¾Í/ŒÒBÎù‹ÞR6aÆPc)‹­L”'I«ï¸s»„a§·ˆ–„kùŸ?—ñ[J).-ø,õéPÄÎI›9àJ °¦“gÚÅZÉ'sÖ‰~1O*¯Ó6Øqÿ8ºWÓí‡ÉN‚èiͬ¾Ó|©Àþ^±Þ¯.i€hÉbö^ÿmö¢º8¶t空®àL Ì2¢…LøÙÀâ„Ðýzx ë D/ ú˜ï`Î!-,F Ž!¹ŠTN¼¦,n™óóL)­ìŠ³4¦ÇnüÈ´ð¾Ï îsu>} šZ#Ý‚æKâЕÖݬùýÆKÙeÅ>œøR÷;é&ªÆ~ ˆ™4ö™›0a³qYLJÚ~í˹»N¹Ü)ý^^­ƒ…©|ZÇ¢wÙÆe7æ4t?€m{úEÓÕ¹ô»kPÄGàèÒYrøüJàÿ>†åuõ“?‚…*ÂõÀž#Ì%›%˜ ¬ã™•ÊÚr2/³ :®Ùoe%—nÒ;ÕŸhÜiS^Á±Ù[ÉÂNd(\«°ß‚ž¼Ë9ïR½—”5@0.Ð%BófŠ;{[æD¸Åð%KŸ×¨¾Aw¼óÞ  r+Ö7•õ^Rg@ãhÑÈ@f¿áù€žP´¯ðyœ'±y ä(ºTÃö}hòª–%1g ä×¥çY켆 ´÷j){äR+^”W…•nŠ ©•¢ÏH¼êŠÓ”V)ËÁÏ=¤rs«ÎʺÄËÜ\ã~¹ËÏ-5lcN¨_»aÚ`(°[Ö_=^éÑäxßPeŠgzK\nbâP¼\4\t^I¡-æœkÏÿI¹[Õ 7¥ä ¿ܼkŠxÅyjùµt÷,:€àâYªŽ”BóPã=!ÆKdwL%•΃š25”È”‘TN“&ðø`ø¿Q@¢6¥¼_èl- ×3´‚áN¡ý<¥d N¦VR-d,¬eæ¾¢ ¬Ivê Ÿ;ŒPeU4yXAÞCة׵ŠÑ&¥ìÀöørßf80Q—rv¤ê±ô zMé[}ã³EíY(ou€Ädz²¥ÊÿE¼Оpr¼ìÌx+n@X¯{‰}„*éŸ=¾äqxÑ¡1À-ön È-•oÒ` ä8’ÍŠJêQ¿ºÄàÍG‹pb`™¶«ý.WW_› ÛëÖ„QnÙ,Þ«¨Ž{F}´„>ó8‚eÍÅÈÑãs¹ “gלvã#%.ŒÌ&œ-n‡)‡£Ëƒþsî²0©¦(èò(QIn(ÿO<:õ5(Ÿì Ω©…PbÀ€ÔðÕ[|ü2C)”軄#9~n"–7&’ß)¥·ØO<[õY¯­ë¤É…PZ·#6’"ÆðP‹ØCµ]‘ÜJ¡um¹9:ö‡Þ´÷/Õëƨ˜q­ì×ë•­r *Ä8Ï\é)o\A5`‹®ÊIxU4šx½óÕ`Þšã¥çRáÞûô&¼ ¼;JâC÷°ùxÕâCcÎ(ëŸñ|&À´¼x@èDZ­>PbÎ÷aÁsr)!ˆ§Ôé›è5&@¥wÚz€ñ’‘2Ò~âzëßÌöbuOH»ã‰,«ƒÜìžR5¶¹Ö­†È}ªQ  H70ÉËoñØÀE w‰P— jQúò˜‹;£â7!|ób¸!íô݉‡0ZDR·!3°Þ/v:òœY{qß7ì<‚mÙl4 ŸQ^ ÒBâ$å¼NF¢½…lwÀ2Ùʨ&–+’Â7O€ Լܗ^bÍÅÉðAU-µ¡“™ ³¡¶G —„×F¸½)Öç7ÖÒ¶¸œxžÁåý²Þ¹ÎÇù£ò*›¹î- @‡j:à¾>Y:ëslœ6Àô H`&|„§€°¦ )LÝ“ØR¿ö#Iðì IBp­E-ͼlsÏÛ•pÎ(žm-¨pùu#ÿhmEÇû oë%UYÿnÇš%æÿ!)ª½žfn’ßvp–ûd¤¤7—ÀcÉP«jŠý¢g:ûü½; ýß×’ü íߥ¾ K€uú6˜ÂX¼¡)1È­ù£ Íàü>‰0†5z<ÇcÆTœ±Là/QŽŸC*"Ά¤oiT¯UäÅž2l¥“ô—=Wý ܯ‰ù8èó†É7‹¯C~ñ ø‡ˆ_æ¢nP†"Þáø̳{43Na&ÚRüPϦ… “Í ÏB &p;±é)|­é…Zeɟ݆‹¯¼'ô¹1So<”ç3 Ýÿdjl« s}bG¬o×'òc;ê롉Œ]ÓˆŸsΦµŠËÍÈèb\7=ï¦ð’ÌO¬Q’É–¸ˆ>b?ú\æÑKîlݼv(Í+Áh{‰®(ØETøDË'‹\!ËliDŽeÛþ/[¤õìnE9ÏeÆ2@ˆ ›3ŸÓÙ÷xEI‘7hlg›\ÔƒµNApõ8åp¹;ˆ0tä'K¯sítÍ{ñ;àψ†~knr¹æ©O ÐuQѦòûF4^ ñbv¹Íö¡ø÷aM#}•rÅP¤Xb£Ø‚ÔCœÆÝö Óº$Îÿ&ÕºžÀy„7Nx±i–ûÐÕ;ÃX­Ñ9au¥'ûa3n;ßC4E‘ )¤ÿ.ó}c¾‘]8”EZ“]ñ„È¥½ …Ϊ壓þÅ­ÙþíO\à®zVùãk'€¦f¶å klœÃ¿7XP]à”8‰ÃQË$¯¢ëM ãm÷ámÁÑÎ¥q¤W,ï%ܬúŸúä^^ rîLÞÔÚz‘ÿcLP@£ûÿIäƒt–„LÛ®pìZÌ£¹8áè;ëÒߟ‰ &s½íÎ¥Z/¼‚¥‹hÍI¤í¬××êçŸîîJBÏ‘Û¦ÁèL% ’«^ZEHPîŸÒ™µÄ8$ 9=ðnbèlDm«ii(jqÿ#ú.'ó6J^O?ï9BžèÎÿ8KέUôÚ%*`V%6M¢ž®ÿjûº»êÛôfåT!¦go9ðÌÄ~+Ïryû`Û'…øl°'O‡NîGÕ¬¼3#æ‰rOp·'„±aiküöio¡¶}ܧjª–±—ñ²(¶Ò¸+€Þf nˆ~6_Þ–î¶Z õú ü…Ðd!Úÿ=¥ÆIñÔ—«ËKL‚‰ÓųÐÜQnˆ«S œŠÈž– hcô ®£fçRÙy¼DZ“¾ZTBÙÓq¾ ®2<þ/ÅÍ‘ûš,FN#bDŸÓë+·S(ÄŸ}Bý%­z©Ñ=Œ ú¦·ê÷.LÉH¬Ût¨†7ð e˜{|L^ÒØÙ;¿>Ž´NÏ •¾-’DÿH˜×öUëÈ<ÌKnMfÆ®"ìgyÏ‚Éi8óR-8¡æ½Ÿ£ÖëùÚÊ ½¤õC1}qk¯µ‹«âÂð‡ò^“¯<KêÙñnc¦«>T±Vü¹f+…µ\ïqÊ€2gÅÔª‹È®…"ßyUM(3Ç>[ˆšº;O'×O»áXJ3äy’‹l–JüÇnÌ;A¤>¤´—Àþo:q0;Å.1`0‘l×j€òºÓ[óפ÷—¡o' wÞ¦•b60)0Ž©½H|iþ Q9ï¿Ž¦|³5ñà$³KnLÃ?®%·$Þ—­I4W„X}XÖŽËkäµqÚ†Ù{;1)îáø°³ºÐðd›GÖx»²f§C½NÍVpžœ1>!\MÐ@#pPWI¥ˆÇB–žêG[úb;L³ÙŸw·ÁYHc£†e:Á´U5ˆú gµ–¹Ì·)1lt'-uŠVè¶Õ8õŽŠ;Ô.s­~8òö:å ÕFìXªU„³òðØ*V”ÁÛ ÇE;Ór…æœÍ)«us:ŒÍjÔ´?, z(݇7Ó¬ !è¾lHb@2ô^èe²wÀ0÷Ü êŠq×ø¢ß—H¦–è,2HˆË¤}' ÇÙ\€˜>wd†nEv@.®3é<»ýô¸|êTxy.?ê=½œÇ଒âÖÏêÌX)N¬9Dì0ÑÑGh:•rEy“oun&yòzPüT˜£ ÖÔUG$„XaNl¬¸ïhxæ;ÓÈüètä°T¯d%ûJ¦'žÙ;±ÖwÃD±\þqmœ`ªy*¨Ñ-B ¹Ëø•¨æŒÔ bÈÓÌ‹Â×shïĤÎoÿ4õÊP¢ŸvY%ý¢ÍÞnHϾÿNg¹r£ýfl!úl´ô>ÿ€¾~ ;¦[¦ƒ¼ /ën×á\4‘N—ïƒqúÊ6 oäjkãÛÚ…# ¸&ê´Ò8Ò)Âl÷M·Pj"€ý=³÷ÓƒÚ÷÷*þ&Í ÑßB.±XE­/FRVÉ$ê¦mF:¢ñ:A¾Ÿ&ðõeWž›Ò!le?>ìäÊ%ÇïƒÌP*Çj(('¤8ÔD Ughü´ÿ-Ár%6Q¼öð¹bºeÄ>ÍjñlϾ/w†ó”Õç ´Ð#(y ö±™Že‚﹨VZÌvAI¸¶ÙÔsF®cT4„±îYêf^îaŸ‘Ô LÆ‘LÔ`ÇßZGßWÃï©€œŽïî¼sÈtçÑþ§`³:œƒXÀ´j˜…ø6]©h²CÂMÙå„øºµ’èø˜¦b)zrC3P`ÑÝÒò[¡FÄY, ¶¡e^º¦ÊÀòHùÛÂ{•±Åd® “éWó¡Ðv±p7ÝáÝ/n±P•~X9z1Ko•‹’æ‹3Åb¡ü.Seú|×ÿ|q\´V~s5´Ú•t7 {`ÃÃ-w¸tD èÂuW¶·%¬±å#¢éõ1þß~üÁTOÀƒ~zä1íu ôq Øf¸Ï~ÊòY2E™Ë¶‰*^u¹ãâ:1q`lÍ÷ì…û—‚5÷ò³Ã» s°¹ÄÎá.X^A7Å^*HÞSÀKgÒ®ü4†rlß\î‹g°§Ÿ%},¹÷=Öãn7}Í_b|Ü)«­FíØŒÆö²sEd7ŽÝmú–>uÊà؇ÑÈ¡³2J|’.åÞC»ùü¸ZFw¿!0$² ò¶Le£7Æ1OkÉñáÕÚÿTcŒm¦<ýÂÏ=ÁöªÉØ=”Bißßç.i„Ñ]Òo":DÜšÃ.'?V®ð5ò´ÜßûØv(eòÉcºƒpÊ8-ÝÇT¥ºŽRÿo{Ú"ÆSÉe ˜üjå Ÿ¾(ØÈjÙ¦‚^vJìWVažü—¬“yϨôÜ}jcXŒÃì¢#ï£aö5f¹«Õ~™ç™·œâ»ûÝ Ž@—,rˆªÍὋžô[X§XâI"Ï5n§qÁ‰çuËä´Áoáü‰#Z:-jAÇwS*ŠgÝ‹p†“+u‹^ÿ0Õú%é›}pINÊ`PÄìÞ—[zÖRÓÌ…?ÆIQ|ÕáÛéò—탬a;^­{äå£I+¤ûÑHÌôI¸Æï“ Ã/xû‰Ý=·óù~yîìWš9ÂK„Yë¸ñU6«À Û?.Dl¢²º@~ÖÖ Sð ¼n¨ÈÇSâ·6^ÅO>ñ÷l³KÆéN¸´x<Žÿ„s·¤}$ý- ÄdÚHÇý`¿BÑie¢1EÊ€PññÍ’#ù6c^7 øÅAëÒ\Y´¸ï:"{ëIiBòdärµ¬±"Z€ KX<–q©W¨gÙïÓJÒêð±º@dj å¡B–:Hâ‡*Y殥^Ïש<ÜÍæ"‰ÇTG»®EÎáÆòX‘Ùj%Ãì¤!öQ°}”@œàÊÕ^ ÛÁ/~:=íýŒn?Ò2/¨O¹˜ÂÝÞÇ`Ö¨ p‡§>\²¤[T€»ƒî¾ÿ2&~N§àN"éd¶VS°ÈÓ7¥S45¸ßšs¶7@ÏmsîRR]ðWŒeh û~û’û°Y±°I#*&^èúÛë4„I) ÷á· Ïü?ÍK8 fé# jòùu'h|iZBÕƒ@Š—w'6|ËA,·.3lÈP±Å¨ !„f?eÚIÛú=-‰ÉœVxÇór'­Àç w k7ê_Shéòâ 7*¿L#þ½—í¯†Q,¸tZRþÔ곑^  =&Ð%uOT{뜽$hú>R}³y’-UEäÕ³Wäiææx»ßÍn?nÏÊËŸ••¾É‹±ž,é1!4`Îmé×ïþÉÌü`e$ ‰Z\-åPÈÈÛZ¦å¨³²KꬽryL–“¬¬@B£‘t^†úG}PØ­î úÞv#ÆÏ`Ô¢79•î³F±‡†³>€±ÌÙ»´\¤¥ùK`*§FµOß½7ä×Î.åçÛ*Bw!3¯Ë³Ú%¾˜RÏka•/¶ÛÒÓ ˆ*“Ú€Šñ%]u!<%'5éȨDFn£Ô@ˆK¯óŠ€FB.×ï×$ƒµ™‰_ƒ„”£ú#è \Ü×%£}¤CgºCóϯ§F àÚ¹P°ÊvÈGEÁ+Ǥ —À¹9Þºc­øl Ü4 õyÿ3Om!¸I Iñr'?^¼6øcíAÿ}‰ÂËt†±û”î*GÒÅ•\Ó‚ý]©eú`*ƒòŒ€êRG ¥"CýP„:ÞJç¤Ì‘r<ÐÃ\æU¹aÊ||È!KzJ”¤ÐŸZ$¶¿ôÕ"Wå± ¾}!Û¼?h¢1å¹a딟(j[Àp‡ rµÙË]~³NÜôñ¯oB¢3pñš8pGñʨ{L·ÅQŒ*2ËW05—£É§€^‚2ènŸ·wz<ªás“‰“Õí›î—'úM7À° aº§b…ßÐsÐ.åº;ˆ†Ÿ…¬À¤`¿?¨µHY®^NݪU9óßS4k?¡¢f‡Í·º“ QÑóÑ¥9Hœý¨>å:PF(U¿Ï!$¿Ã.©NguEÚFû_Xîtwu`ÊÇ)Nc-©ùY 8+<¹õcœ†u°ƒ…ª‰6„¼fu§‹Ü%Û§õ ‹Z¹¿þÎ ÇC·Î 3˜˜ƒ}ûd«ã½a_h}£ *S'¥ ÊÓºÃó^˜Ìflë4:ãêb¬ÃZRf› Šâ¢õú%Tò;ÒÈHíáÝðî:¸ÒÔ Þðv˜Ò¾)ÛÂöyŠ”$RFÈäkŠÎKÎ:j'Ñ™è7V†TàÁP­ê1ÃéÝðúwt6¨ÚšIŽO,‘6.÷¯a^*Y=EØIw%§´U˿ǯW߈)Ȉ €šµ®);úF}ªïÙ¼ˆ{ÿžÙ›‚=Z9y‹xªÎÆ¡so É¥Z½?È•ó÷#+\þ¹½ÞPv‘x|Ä K«ÿ|Ø0¼iáYmm*¡ç"Г¢ŽÎBá~Ô†õ= #2â-’ÓüP¨(¥Qs-?{(g·Yå~7gÑàœ<ò l‡8ÛŸB›vI|"Nûr·’ÍÚábÏáÕSÏȪ–a¨"œ ¡7ÿ÷kì©4L)*lVæ=™ß‚(ÍŸQ o–ÚïW8”¿d²QŠ& U|AjVjà*÷iXûÊŠD%M”ç’¤XÂ÷µ×-Rí¿M•æÍ~šTæ+EvÇ©T!讥㿈õ YU'àšl %%…€UhÝÈkyáÇ,º‹NÛ†5ÿe ²YÛ÷"y=Ô9V¢pu´Ê~t*6­ë]Ô§¦D¢Ü[¡tŽÝ…Ôƒ iÑÀÆåÜø„LìÕ$é°ÁëûX¨Î¸ù0Þþ ÎG<¨°=á¦ÉÓøÃp›ž¬ßrU*D¢”?æ_X±¨KÅïÌ afŸ]±k ƒ‹¾ØÁ{Ø3n!“ùÇðÛAÅréçÄ}ÒOù’Y\ì Çg…}wÀ®lÞæ~źOH{®?Ò¢A¤òձЧ±õ´.ák ’³¤uÚ b–e†SœjAÑ8à'[餿I'™êÍr»ûÏ-œï{2%LpN+dŽnªž?>3×ãQU¤ñ#cß•þUŒç£]¶Ÿ`â!³œ…Å$®?COÆEGtôxêÔ–÷”[ÃDj¯ò'ÃìÓ¨};Ö›V€ÒÀLì ²‚úäëœ%Ô¡Ö*Ý Ÿ[ú[jQ|rZC‘‚ÙD! <[~2'”Ûš®ÕåùÂâ” ²B1 ­šðSt<Ù|êàMäʦN‡>D§Æ%8 “8ìxéX@ñÍV$6Ú`´úÈ°~~ðóZ~#LVe4ì䀯N˦ÃpØ ,3?`s¡©’ùÅq+ï¡i”N fc´Poÿ6Î~Æ/1t=I¢žÜÜ…“BeýŠ ˜z+ù@´žúNšýÀ:äv|+<ó¾ßU¯R5BF•C‹ë˜ëH%Iõ©ïÀ7êäç䢿¤õi4,nØ,3°NípV†ÕP× X´‡ÜuQø?;Ž¤ ß|úzãü«Ú±3N–Æ9¨NãÆàcëUΕ úwcFºQŒÙÎ’k΃K‚úZX7ÂðÔUËrIJ%F<ÑzºÜÒ08ᶞ° ÞJ_/õþ›J9r=úyùÄÒnµ¹³i\’ŠZf7+T4ÂÚ ØÂ¥zñ æw¤W~Ù”µÏÍÌo~ðuJdS©Š÷/íçû›¥S°nŠ¦¯*ÒMܵ¢_o3)ZX{RˆN‰È^Óˆê¦YÏ\oY/rFé´þ¹Ëð̨š»å2üɸ;!µ}Ñ…ó‰ÂQUÿ9­P°ÅËF_ËéaS_!ܤ³œÍ.Ê8+úx¬r/–¯Îû¢Ë|¹ù5fqæQ£˜¤Ž³+c¿4¯oíÜðpXÒÍù¦3(°^sï[Xé~b)©LøìÀx7Êo'# ù1Ùs ö¯˜Í2•d«ËÃæóÊm3=Ð ~A>i‚}°!øx4 y‘óPCŽÙ^¢0›£(UF@Ë)(Û&Ö5CÞ¹ä¤ii Óª-úr(bÙ$zj9˜eQtp¢g‘êÉ5#Aq¡A[V(žsËpÇ ¼ ±\™,gXÎnjÜäá^²,xË‘Lì^Ãô¬BÕsTƒ²#N&ôâmÅ“9.úrV;¾¡ëü‚iæ±­ß( µLérÊQæ£Õï½ÊµÈ9ìkèì¯Óÿ]ÁFMÞn~v¤L}µ¿eVÍÊÜŠNÐ1ãV˜>R(õ³ì TÔ¸¯g­ä»ò5Wµîïn*ì|qê…¹ªÿb%[l„{ütl% æ·|@'M·Ü2Ú>?ñÕ<ìÞ0­Ü6ú¾¥%{°´ðæíDaÁM!wc‡hM&¬2Ç,ÿÍ×…§hi¹4b °¥Ä@:¿ä~…†cPTÎRÊ…AÉdR} ŒqÈÍἸûßÊ[ò`¡SÈ}’3×k˲Šø&_×&ÙKŒèuðL“ôöArÂ`E`b¼Ç—·uå[?lÞTÉfÖÆv4«ORÿk ª'\è±ìù ?o(bA¹³¨b< ¢Èr ScJ¨|ù(ò­OÿvyÖG#œü|ŠG˜Pš#T2;,”çø‰¤‡Ž’=ª&ò ê§6¿Äôåè e)tqÝÕ;‹Õ®Ž)ß0¸mÚ)%áË­àCƒãVUY˜ì!µí(¡6”“¥›Aß»÷2l•e}’8Å?›ˆ­LÇNqØë‹N™Û·Òˆ'±Á«n4¼1Ìç¸35rWVÉGÛ5¥ èn©MLÃAŽ[ë¬*KKøJëE‘å7ÿ›•ìR/…ç7¡ô¼Â²{? Y6ƒG®1xW±ÿXk?_#äÁ—¯G”@ô‘_K:T3_1ÑÈùµêê‹-ÅP í%ß XEŒOG–r"«PÕ•$ 7ISedÈ5/á›váñî}›—ã´ôÉg¢ÏîƒÚî1ÞìAÎ:)B<‘á>‚Ðw;ÙÛ›9Bø„7“ÝjfIé™(¢+%=·åMS”÷ÿJ‚çÎâÐcÀ°.€©{w—6&´Y”zÄÌî²ÃœIsTjë7Fs4Á(eð(îF²n•r®»ŠK 2Nø›}D(öÊ®ûG¢1üª7ö èM½×Å6f+ìLÇßÕÌ}ýaÁõnòQø³Îóu5ùç?¸n^G9ÉKm¡½éïΓîU^…O4]s4T!Op´J*yÉõ×?¢fQò9Ä؉²BcÉ5y´˜Á§Û¹ý”â´e÷7o {A ÀŸ8 êXj`Ïø4òt…>,lŒešZ™%Ï’]'Ÿ¦‘¤•ŽtWÁÆuû·kœ5Œ߸‘,Ž“MÃÜý[ò¾ÉQ ^K¼v›ùï%å¦DÚ-MwЧ- öjêwob$&)bqWs|±yJP*$VžÈHÚD? }ò‰)~A)…ý`é—œKw ’®"pM¯\—½@™‡LÄÖîh B®øÔøm§‰ÿ Ö¸ûðºŒk1#—o)¯D”œÌ(ãèfÇJ°¼fÃ=…(åST€©µÌlÖI! d}4¢§Á ¥:ñE¥DœÀÖ£]F¸ÛìMe`Y Yð%‹—üuû;BƒÔÇ^BŸå¶Œ‚Õøò)ÖŒd_´n ‹çË•ÎWQïÙK‡h’$Õ*5C¦Ë‘–tã$éd·FÏ2I~LLº·~|É‚Í>’¬7ge'KjÈyBJ·»W@1‰DÆ?¿O[*4bh¤ ~ïÕÙ£ûuWøâ¿[ÚþܽîÇ´*3A§yšµ±Cql©ÕNÖ‰åY”áØ2ª ØÏ 1‹;3Š3dàÿ}íêîGþ{Ü}OÀúDAåguÐÐç"oU@rWG~÷ñÞÞÐÇøæžéݘ«$…‘Ë!hëPÂ*èwª¾c°Y²Sç¬ùÃÌÙìøñ,ÿuýÞ‹êâYÖ ~ën? µ>¼_“8ð\Â1²%+!W.zô³¯†Ñ¯ýäM“–rÅ<Îçiäý“r°q+S¢ë”*”…ÄßîyN¾&pãmy¡»Bü CþgÛÌÁ=F ¥TÛÜÝZ-ñ­JÑ ”Ë,å—­–cÚP¯OÁs6 ž$|äb¶„uny¶‘êÇV*[Ö“[*ͪ¿FìDÖrr*½lb}ÜkC%tgnE÷k–êXZåQAÊQ¥çs+S;¶è¯ù×xlÛ”aÏ­Ñ÷ú2Mb\l‚¬VGõÄCbuæÿdU°º¬$SÕ 8Ï!òøÓ}þƒD¬Lèšå¸ÿ Q€F—L0#dgùï»aFx7w”¢KïÙ`VE˜óoÎa0ó.°ë‰lˆÙ=ÝBüšT¦4^!Àkü·‰»YšVñ¡Ô¡·âÀlYcçyïAqÚ’<ÇTÒÀÚì¹›•MýžkLä§ÿ&c®#: !³ êm/sk|M´£ºVëÓE0e¦üw¾²¿r‘ˆlB€¯MæË…Ìk@˜|0ÕY@,U!ÜŸ½-¦_¢D —Ii™VÑÜö—¯sLlŒku­1Ä!$pÐ:›»sJ™É@ëàÎÉpÄÂg¼½:PŸ#yDÄ—´<‹„1€2Œÿ€M;8íçÏÄ{¢ çÃOðŒ„½Ò€Tj¯z(w@Û„¹¸Gòqj&Ú ONðä yÒy¤Flÿ €¥ÇtBCΨŽ=gk¹Ûm¼Té˜í¨LŠ*—ûF»Þ"x@5’p¿ñîÀàÿ„8¬ñ¥åJS€Á'§G«…ëo ÌyÞ ÞV¹?ÍuËÊÛÞÈ›!Dª£]¶hc°æÇCë5CÚÝŸÁ¯R›Ú6”Öw,BËvZmH¡|äžBáŠnvæˆhÓ<”qxËï4øC#´UÅ{³v†¤ÁZõ<ªÉ%ýŽ·¸©Æ7&ètNó´³ð(¸ríóÃM¢`z¹'ÒUû: ŠrÅÁ/@ë`Òmº—ê×£©.SÚ³þ82|ðø‡ÇÑÒèú:U“O€óÒ T þ%Ò ïÓ#€ÿ>ŽëQ–°Û;)ù“B×ÇEÆÖŽÚïVV!Ã.‹µ»ø³kÎC÷kÈÞ8–ßsŽƒ]‚yþSûr‡^É ¦þI]* PE¼;ÿ@ ùÊ„ÉHd,óѸKrD"Kƒ¸wČɌ³{<êI<^˜bAõ øÚFÖV› =4ÊÊžB_ãl‹4ê½k¥× Ùˆ'MÕŒfv†Î}ÃøåWˆQ®v ;è©Ïòp×[Ô=eËÞ*ŸËS}0÷&Â(CÊTöár¡Êk“Yž¨ønDÏG­`¤|NµM‰ª%@íø¢ã’²—,0<Å<‘^-Iƒ´Îz%Çg`ÀʯÎGE%„˜Lì Þ˜R5QŸliI~ö{‹Cª¾0î­ò\£W©¾4¬FWÿ! FÿZ j{¢ÑÝp :Òß\ðËÛ—§]Úè NÍ |—,ºÆìØ- ÏÕo̪œ2eˆråJ™4¾"•¢µG$(Ô·Rãàå:–J…:œ>´:½öÕ üä”3ŽÐNj™ã™ðÁQÉ!Þ¦0ím€9¶cœr°·³äMLª?GdCÅt˜öý쀾ÇzÇñ Åì{œD" fL»Rx¡±ºº“}>½€Sl$™½8”K:0êÄ 9#ÊZYܧîë*KbÍ ÀD-$§DÌî± Oð#ˆÔºNê}=äLî?ì®°¤àÆA_`hÒVd?؆ü[×øõ`}µ†nÊØP¨›D'(”QÒX­®•ƒ{Ž¶à·ÞÚñLU:‰aý­Í'¢HpÿYš@óÖ÷BOËö ›Ñ„žíyá‰æÒ 0ȳEr*>qZe[º´hÇ©œêç˜í{¯ƒÝ0H§àí>&Óm5¿NÚ ÀMÁé±é ™¿t£¸AÔzÍöHߎrÍùkìTòV–ÄîÉÞ)¥cw;á‡`ÝÁIkTuw„IÄÂrõÞô:FaaŒ}/óçlÃXà2¹ÞeÊp›l<ô÷T)ó©ÐdÏ^ªI l ç:Ì¢í4<mrìö• ¾$b’9 –0Î@zb»Hz@*UÓ‰²–ÞöõHíç{,Ý·a¹µµŸ\Dz¬mk¡ÃzsúYýÓ7×ò¿§Å“®ž/Ú@Ž¡kw¨hOAÞµqÚ«¥²}âý‹Ãá·'×~mBÃ8B à:fa—ðßáûCî0RÅâ@ϯë´%Ä}o ÐÙ~DÅQÔ4$CÇ$Ú £rá˜Ôñz>é|nP÷v”þ¸t/´zµÓQ82gøÕÞž)†Í]€aÔ&]‹L ®g‰Û6dRáÎʉHÿYú0Uˆµb¾ÄOKòèó%Î4ó~dï ™›¯( ¼Vrå[ @›E #Aoœ­*hlœ½È·cð9&.ºúÜ.ÖVÑûÅ«ž±%æÑ^×´”VN¾?-a³üc'bûzï¸9a}‡1ïJ_„¡*ïgøÔG– Ú`øÒ“iôÝ’ê¾Ñn²¢æk¿Û±ú_“ò+nð1š^ÄÙŒØTi]öÐÇ@óñg•e 5Š8Š7û š‹þÏ• s·!ñ%ü·øCé“tµ:HÛîÊ\Í0$]èÍÞ}QR¥GÌße‰rÌÃ|Ú¹° ´vðB¯Þó9‡ßE®¸i’ÿ_ þ‚êÒ…¬ÆÝЮµOÀ~¤&ãB_+ç :.ñ´í48_ª/²ƒ40ûkŽðÓ!Çž?C—'Þ "”Ÿõn°_ðŠÛÂò¯¼2šWã&²Têm¬¹_5õ_Czsÿ-°Ó,ÛÚ½)/‘¨n§¯3J#· ¸a~r^:¬y]˜·Æ[ów<4 ÛÌŸ‰¡-ƒÆž‘O+U4ˆPã!µP‚  ‹þEfg•o¶œ£ÞX)ÐÎ5|83´š§z³屫\“`ÞDþß‚糡h ÀæIØÔ°3¹ ^.«À¿«>Ä^ÍT‰„©acÙø¿P@"¸^àòLhkh/Ë®¼™2 Äç a§§}=KKKÜ2ͱvÎèzbìo¤Á±| ]¡¥Œ¤:Ö \EÚš¦g䣄ÿ#YÒ¦%%ÝÉF¹‘pü©“0&Ò‚Çíq±Y¬ä /‘]u°¦ÛûôÒþ“;)%•$€¶óÖ.{sšÆȾ5AÆ+¨¤y Ãéô?§ÐÔÁè8…_k*3‚‹ykU6—¨× ½):° v¦Á)„^’|€B†›äWdì6 6`óÉ÷I.É“"`èçG{ßf«sd÷Õ©)Õ]ß7›à¢Íâ_Ì$sb‹ÒJä8Ä㜼âÙ ,›|¸™¾Êrû†%ãÚ øÞÑ‚€Ê`Ìg¿|‡B³«mía¿°þŸ S©ÔŽs¿4Së‚»AÂþ!¾îŒ]p£»´àbó8´¤0éL>®œ”€@ðó}‚Õ‚¯GbMYòѹe¾äT÷‚—Yô°ÿ#t·ˆŽüÖpZɲt„Õ¯€v®Û0Ų?dt;àW”oos6Oå’ ºo»<+Š½@8êíNOñ "ÙÕsÚ™=¥·Zuv¢AC– À†/êòCû¯×÷sðhG5lE"ä¶-»"–2d[=™ü$zlUÒ{ù‰˜säQö*p﹋¸ys â„¤RÓ]¸0ønßœB7óoœ-¶ü«æW!8N4ÈtÍh·JbÙ.~ã6lþÕB¸€å#ùQÉ[Â%nJ"Iæ6;”ÔÌ?gÁ&t Š)® Ö¢×lÊÄcFî0Lɤ :… ½¶9XnŒ£Q¾3lÓ[„Lùfcõv”»Ë™šÈŠêC‰¶ÐðÎŽ]iV´~Üø?;ø‹ƒÖÝžH¹â'ûMäX›|Š¹ÉÕq)Ý6íÔVlŠ "Ùù‘iŽ–íß’o+€uûƒ§–†sisÈîÜýŸl IT i®Ý¥lNâ>/V(4"DUÙ$ ”Ÿy2ÇÍòf`T·)¹ =:ló[Ñ_AF&¨t´µãÅ O˜þñ©.ÿ@ss‰ëþ]€éÊ6™·:òP[ˆlÝÝÓÏŒ§Ÿ/SgÔÚµeØ}9 ˆøZ%[yÞó<¿€pGñÊ#s}üÍŠ’îºÎÈÀ{ßxjÿYÑ.?F0YÌÛ%!Ž8Ú-›З(TþJKgû{¢<ø½çŸ'Ëé9OðS[ÃÎîüý^®§[#€ªÈsŸâugôàŽspÏ<Æàcµ`ãƒ_åÀ2&ró™óÚ»ûƒB¦ÍðBPñÈ4Ý—Ææu’¢¢75Q-á…:%8(ÄÍÈyªÔÄ“•'RiþtÅRõXI¦O‰Šþ¨0ÈÞßA©¤VXñŧÿ ˜ƒ? }êqÚµ«JÓ¬¢AâŸK„Ÿp|Ó |ܘ¦,—󸑶Âðf%…L6Öü©¢9ØiY@åmÇÉ{Á}d­VX)WÓè#säSCß"r’÷pˆE¦š9>‹ûÖÜ+BïndÆZ‡lGî„ÖlUßÖF õ/^‘ã˨†5cx”«ž€ÆÄ»09[˜6cr^ìñg ™cj­6töÔ›óÐâþ0ÛûŽ–ÍÞ¨¿ÜäÖè­@4$Ú‘n ¯q—i0vÚ8ñ1blõQY[¸ÿ^ˆ $e¦Å'|t~’ÑèGè¯^ÓñWâ6HÄw” ª€ô øžoëÍË¢™ùKÝ!Ssñõ™køâSp{½þO¨ŸM͵¶³]p4ßãf6<º/Pû?¬G*s)-ÿDß äÑ_?paö 8ow©–~ìµ;uñþ@Ôt”Â0&"Û¯^SáœjE®ÉK6¤/ø匇œ¬k„"‰Ít³«,†Ç`éÙ)ÞÌpcÊï¶îΆ6m£3ÄÅ˲×BJ ÌÚ©ÞåÂ/Ã’Y=E™IΤ *ÿ8ö‘G(]ƒ„ùqžzYÕº“÷8?ã ¨ó;Ä}®ºÚå7à”qRöçæFQ4.È{C½ëa%¿³E“mo¼Nü ÈýM®„Ã’$C:?FªÔ.,ð«ƒÑ<ƒÔvsó¹?â{ëýRœÚþ1`ªåDYÛÒ#×2;´-I³ˆ5¢Ý£R\¡*)& –Ö²ô4ÃpŒ¤ b¤Í]ÁxEXλŠÃœLè⺽6„š«ñ«F˜.;-"6NÁ ALÑMDñÇäTå;¶Á^¹™%Iz±¯»sü°‹çÇ -ÏI‚H“®‡ Ä»ø”;7bOÖhùô¡[œ*¼ «« úÅš½!Iòòã§Q¶Á"¤¿à›ë7ÅYÒ57“Êã½í~¢†Ä«©Ž,<<˜ htu5v(InŠôæxôpv‘}©qÊ£¼è™ýxî Ø’P[h4?lñ¡Á%`C—09:Ù`›íÒW™ K<—z«o°õ¢UJŸÎÂcž‘,Ì9‰‰ØbmÈj%õ³Ê·_¼á8-ív¥o„ÕG , ¹soE7“mj;wŠîJ¾2ÃRXƒó”ø=˜j (Œ¾)shy yvÏy °n¼nKÕ.õÕòÒ©ÍḔ7>ªÏD"£vM|"ÏQc“y2Ô«MËçDÜâñÀçÎýòô0ì¢bìëhWóQuõ¶ Õæ˜~gŸªçªÇšUâ)Å=—y2Å!9ÌkÉEóÔ"úJái¸âiúµ<ƒN (4b2Vtʇ"hø!ÓQ‰]Ø’©Üá*c4«¡61ì…T6B;z’¦+,¸ô\uÎrMõETÔh¡ÐK]±&é}[X?Å<NzHwÏ™öÏj´@¤iJ#m8BÜ/« nŽ‚Þ3³“í‚Û,¹_º,Eýþ<Á¯P–rúøÓBþ KìûèÀ9ýÓ¥Œë7Á±ˆa!ùå¨FM/Io«ÀƒÝZÜÎkyÒž¡Ò5ªàcÄÑ „*zÜàçî¿Ø_àÒ-ƒ}í ÂÇbÛ-Z½ßd²øñî»JÔ£†.áµ£q²¶±þ;÷b©Jæ®cW¨µ¦k1Q •Ú½±N¢Y HWlêXO¼'AÓ¦ ÁÕ txG}ˆÎ®M&skÒà:f,E/]Ѫ \°§«Ô†Ý«}IJÉ5¢â}2*~ˆàÉü–)5¸å¥LP¦ûöT7ÝÊNÅSŽ(@yŒ7ÆèsŠâö…Gã¼N阽 ?þwFö ÖMZE5&ðQ±úê!@ÀócοN5.µaNˆ!e(c¾ ˜=}?qTí{¬±ïU6¤ïI©Ÿg¨Eä¹ØbSÊ nTžÓÆzáñZB#›+’Õ¨ƒ„ÀÂ5“ªZÒÊM`1Y¦Î—¯=Xxe§Á Þu Æêü€˜éÜ‘@›§ ÚñÇìîÓÆ\àÛMT<ÒŸN >XÊ ÿ%rÚCry¶Ö-Ö;øeUË|/·SÄr>“vçb÷Ýçµä0,ÉRSÔ+‡‰‹g . OHŒÛ©}³ Ç:‘kµ(ŽÝÕõK§-ªhïöè3]€#lˆ÷N”x<™i]E8HwºI@G¿î؈ïײþÓ˜vf aY›ºíËÑ6Ƭ5%ëðæx.‚g’ú€ïÿSèÒ좪/VèÅF¬Š[Æ—pýØá\µ‚ÒHÖw¢…v(†5êM,ÙmG¥+›@‡ƒŽ®˜?)ËÈ\Ü:ÒâNn`#øoDæpÀA™U¯Öì÷=æBÜÉbm{½Ï"ëÓ?”Ú7ÍÉ¿¡&Blcö?îcåU?kKœ¯†.y>˜M¬†jnå7gýDâèkÓ¸*¿k‰xWH|óká)¸[.5AdÔáüBŽ.Wöji÷ ¢Ï¬ ÔËJÎúû÷‰Ùk¯°ûÍk88xxƒW,nÀ¡ÂBâ+ÜDn=(ΩÄþôò—¼Ó•#3t†ýü-ˆP÷åÉË[°pyømë(÷¥sãòÞçµyÝ#óiL~];¡Oj¿—CáønîÑ]¢ü žÛlžÍb¼Â”ëÙP\Û·@³äLÈz Ù Þìå@î8©Xî­ÝèD «¦(î óùÕµdq['c[wxÚpÈ âñë—ÎOô_&ï*EªË¸ZÓvfž¶-Eº®e`EÉE ¯†¾/%X¨GèøC$îQ{\#5.?Ÿý^Ä,sÈŒI£Mz¤ªž’¼fAUˆ'®èç/VBm¼ƒßV¡ïꞪ©¥”·å¾¢B2ä®×h,Sì"â½I¸¯••Ç¯ÈKteY¼Ä…‹f%ªY$2ì$ÌÞ¾äÅØÖkk(Ž`áz¨0½-Iƒ:Þ¸ò2LV]YK±áè_!ül/åHéTB–8è!pƒl»|Ã!‹Ðn8åJŠý†Êciç>¬ÄÆÒEÔè5ºSj'çÐÕÉå¹U3¢ª<:ø˜Æ8GFa4ÉDË´‹ '¿3ÉJ¡ÙLPݼմ Œ*¾ŸŒâö LPÁŽ FºG­Zk×7̺ᬠ< žâaçV‹hÝÒè~ ɲïhµw¿Žz¹àòäHs]§Ö½¤e¦Ú«žÌŸ%Ù”½Špä-¬B2Óƒ‹vµ—‚¬ ‡UA+¯Õ5"‚h"Íxkw˜B‹(ÕÇjÌ%?lAãf\£†Mà•zñ^ò÷[²mWȈÂÿ'tP1Í»¿óØq +™X°«½r£”M3æJ¾ÙÌrí½]õ†´‰©‰S‘rôr<¸5Ëìn1ß¼sÈLAy.âãPÁi¶’xAºt´Åõœ^©°!a·+¡ ›Sn§ñwâ4y•½@ ÞbŸ¾Ò˜i ^l|ªáZä x±n~`42Šg<¥¿\yë9†ßßâ³Áb «JgB°ûÀ £ëwÅHÓµ-cë•ÿ.E°q‘úCîN§!€Ù•ãÇ Áð.¤žKJ¸uçìÚÊÄF€oàÆ·Jò(9vÊMdÙZ„¢HîRI“f Ì‘gsÄT™uk|‡Ìcê$—5{îZsg*ÞD¥‡Ÿˆ˜Ÿž9i7Z _ÁìM’ ‘£zveì÷8ó‹a³Ÿž¶ÈÙîá µž}ïßõÞ¡áG²Ÿ†ÂX¥òž>µã£º-hÉø~ü•­¿!&âW]Ašä‹P–¼qBQ¨ò Çqg¹­÷ZÍ6ë)BB ¾~o ´ÂÜøê&ûxdV4¾œ6vÝ‚õ(ê0É¡¬ŒÉó!Q}Äþô§K›don6 ¡å’G€ß÷ÉwÏe\i»(ÉÁgáDZ£vßúÚYµs¡zCŸõ–IªF[P—åìZ稫ÐÅ E©t(u ôRzy*àüšWñéÇ¥ÿM`üzGòêßǤÿL€ÕFX ¥}¥rD ˤ{‰˜ ÌQé›°˜‘K™šÄ^ɽŸÌ¶âµ–O†pŽM{Õ£cƒË*Ñ\ß^ò`½ü4wè”Z ÚàšsPì1{Þ-ÓAüTJØÀ“Úî€)×bg¶šj«ÛÈÁ¾(^d=m¶VŒqJ#ËÌ<{‚í<Ãl ÿ5VýCAN¥äÔê’êÁã¹Rå¶y)PíP©ÔÕ#K3€À0Ø31@L~GO7Jª F;lAu3ÿLŒƒ+pÑ[Ga7òþÍ°AÖ]æ3vä“¡òërêÉ8×ÉÙªaysôæGÊFëìU•ª¡ü•«9yõØyëÄÛuæ µ;<¦3JI ÇŸÿcGD,‰({H¨SëÒtE;,Ó×½÷wÁýôQ$ÊÑÓq8Iïx˜CHZcc­ÔËuuÙ7)‚Ñ4…¿LtVJú>ÁœK ”Zldàî+´Š£ìRÓ5¼Ò)mŽ”[¸öÒRC1؉^xhи°®G¾›‘.6@"ó?ó³}¸Ÿ‰‰Tz2÷)_ѽ€=ãâÓ ­ýÈÁóèιMw59‚“ƽ•x‘RnuZ‰j‹l_xó=àýà]'Ýæ‹ö 'ZÈ(=5·løÓŒ„`:+…˜|?'¥þ³Ë#9žÛwËøV*¼.p”Û‚‡p7ߨÿU1´kHŠ ª˜ü§pçdHqÅ‹¸(Xp  “¹o½¹äÂ'8?ýwki,*­B†oÓ"Á4œÔcN­òîÕ³Ú“Ì´©ƒ‹] DŽ‘1eLêM“nßà¿Áز†ß24I ß›9{«„ÎM{¥ž"qr5}/+ò(\j¤QËþ?…S UöØÞýsô¥”AYÈÐíÁâ8d°,$„¹ü—3]fø¯¿å…ó—÷Û\Xay!CSf'xêèŠÏ›”c`qR¾8ú¨”^fÊO}³Ô´üɈ‘i±çKiÅ–íáÒºR«‘H³)&ŽÑ~p…HïÃáÃO†L‚Új°ÅyDÃó:Z_RF•3€î¼àâÇ»G^ä›±ÕAS¢¢þV-Çþ«7ÃbÛýcºº%ɤ_:—Ä‹ñowÜhâù<£ú¡.©©ÏN éÎ&IvᲫ%ÇñüÔ ä?ž¡íåCzÚ>¥¿?‰¾üO¿_Ä×ð%ø~'Ü5ñΩÚ;È^¢ö›þ2wÄß~ Æfø›þ"߉âqÂÔddÏú-QúoÄú=/à*«ó àê0GGiиsü³ÚlB)W4ÔCµnú•ð-¢<ëÜ©‚¢y(õ­é¦±Š~ŽZÂÓãƒóùSÙ˜‘"u—"¼.ë“ëÍî ¶Ú Oy°S¶u#Ñ7ÍÃÁ̺\ÞEö‚¦CNÄrçÔm-È£²=¤6møm4ˆŠ®MUx¹|5+©U¼¯`èL;Œ ÍL•z°Pª2CZ€5‘1ÂSúcaÿc¨¢Ÿ¼Å9Ú$„o$þ¾s¦$D~þ‚YùŠžöW´×+O0AWuí|ÖA‰3N? \/«ØGËÇÛì%¹ý+… [®ÊoãU™7° ò­ «^;…kM³·™0U ¶¦´ðþvÄ—Yƒô!t„M³›šŽd™A”eZÀ<è¤v}H'Ybà#Òå‹öڤ앥¼ ç>…~Að1© 0?îïqúªû{1,‰^¨a–}q®ÞPýÖù‹nípÑïèëƒùx§‰p!“–²\˜ÄTXPböv4\ ¦†úÑ(‰e©ê€¾k4àÎrøÆŒ7g(‡ÌCâf\±"ææb ¹­n=l:ÚÜõ\Õók*ˆìbûÍìÚ_†úóý~tRÎ"Ÿ9þ›‰›iOŠf¹}% 8Ú§Êç…ôÂa2oGó¢Èìp[=È{ðØŠõ›ú/ÅÍÿÓ„ÍSÛ²­J-BhW”¥›ê@²i*³EÌsy¤üÔ8‚?¼.ý?‰ä£ˆK']ßòQvejZ»¶ Òa¸6/^昃 h#.WïOn¡ ê—AÚWQ¬‰Ï­“—nìËÞïYÝÛ-, ÏPz çÙQ‡¤iîçÐtö•ïüK…üã2)œ¼@Ò ßþ2ëž |ÇqâBcÏü7’ÞXUãÖ¾/Ô}%(<Öafðð"ã£JœÕ÷áè4IRÙ¦V·E9–ZƒÝ)ô$*kÛUÐg¸6—a^Q•¸jŸ3 úD|—s…¼æ .Ì=¬Ã6l…¿­ôL£ p¶5uû{Jºç8Šƒ|Dí„€C–Sþ«Fkÿj6|6©7Ø<ò8“n ™¢ØµMZäzKí¯æ‰Cð!©âŒã²ÜŸ¸–®Ü~ã'¨0Þz™n©v’ó/Y.U´õ¶ ßÞ]èÇÁ-oÛCþ̘ÌZ+Å Ö`Yûªd6€ â #!X1ã$æ|ñ¯‰Ò Žß×øJª¤f\o2(½Ï[&C0¥øjhFÄ,ªâ1 ®é®ŽÁñýý]'íOúÍù’}7«9î,}È-hK™XrG#¨±¸*T¥©Y½ÙtYÓ›jÌ Ã‚Ê…0)O^ÿ!()>ÁÄãnõ„i6”'´!-­xøy¹ÀÆËMìÖ1ÓaèÏl’M›õžÿ#Œk¦hª²œÐœ”´{8ãŸ8Nv1P;Óö⊋ô•D»ô%©&Y;#²‰ü Y¦z/04ZÒ€_f]`ÚÄV,Èct2}<Êùå?Jf‹DCEÊèï?Eþdœ ÑÆð¹Ðr„á™8Â{Ê ôÃ_•gðGt^o8íô1`‚…œiíþ»ußñ £Åp?yuáÓÓÿ|õåÙaøpX ½ë™˜Â|ò[d”ñp0Éâ/Q~§ë¯h=?Eê#ñ^Ò¼­êÀèF›MFGQˆÈºE†&{<âó =á¶!á.]EgIrK“èÐßnýõÆtåITpž‘®p¾û±J‡¡p«AÛÓúÞy¨Ÿ±`ÑVM ÓG¡ÒåæÕöu•‡sY$ªõé5y>¤G<`œ©'}¢ÒNË’LI=@üQ«ÃUÿð õžËöTmQß=åÀàIsâ!07…’nëZñZÓsì ý.,_ßò˜`÷€ÛzÔ‰º›Ú„ÉÕ7DkfÍtç Ó´²÷CSsU 9˜Ä©ÊI|ºuÈ+œñü_€éøŽ|Úz¶zÛü4×Z? ¿†¯à£üg¬¾;ð¾OðÕ~“©Ýgð×hr2ç¦í{r'P%¸ú•i7[]£ƒf‰D–¤³\j»Tãaĵ\PÝ!8í…³q§èI?;•Ó¢`Ÿ±ÒÄ"¿) W@aÂjrÉ÷¸åf…¼-—÷ç u¥Js𔀹ÿ!=|ñ»²™ñ‹úpV¸#"Ìé:'ÌÕ‘ìÔNƒZr(ò}äŽÆ²}ÿX¾ÞÏÿ9&ãJ;«`ß0›zS…Cô¤ARÀCDä=Ä_ؾøƒçïÕÐÄ_ÑmûÁo[É?c!ø­êÎbæö»j%„ׇG.LP Ùÿ!„¶3#˜¤«az¾ƒ:»;Ÿ1ú›u,ê5öylMˆÖÃâ'“VfA=è±nú¤Ÿ™ïL ¦5}èè2eBLØ›.¬”f{âYBA™®ß¨ –‘ráÔŸ"\¾Ê­èf^ŵkçΟՌýƒQÃ!Šç®ÈiRñFýšRí¥R¾ö–ÒOÉ oHŸj3l[y×ò ¥ýbÑÄ9#7>$g\Z%ùðúÙà”WÎLòGöËžžu²¡˜,¢¿4Æ=e˜8§<›éÁÈÎP‘žà1õ•&ætFÍöX™SÃCúÖ³ Ë›õëè`·h²ëÎÂŒ22~mRö»9Šñ§ªk èë„KBý9Zþ`ÃáëàñMË̱%¤.òŠ@(]vt¶nPSÿ.²-“7 Žs»Æ÷ª#¤f|Î[Ѽ0™ÐgSdð%‹ò9ÿ —ã®þ;/ã»~;·ã­ŽÃøíãºþJ¯ä³þ7ã¯p%ƒñÖÇYüuïÆãñÛ¿¯ñ¸ï‚·ñÝ¿Çrül?kñÖSñ×@ðd§Wj–„8ŸSÐKļº–ºM–™}gsX7c^toT'<÷YçÙƒK#MœGr¼OÛx$ÖtcáÅŸ YuÅ“7¶°ßëäÔ¿Á¯pC8fã€K-”$'Ö‘IÊ~¹ßeí–flˆ¦Û¸ÔÃQðÇ16nå4™ysqùm6“àÀ!½Ç3Â;àÖZ™'<;ð84Žá«÷¤èª³Ñ0•³Qg¯Ñý#ßÂ3ì\ [=øW?ûàÃ^)h¨m—iGóÚ…ðŸÕ<‘Jf/°Å‰âäl)ÃPÒÛ¸¦ÎËßv²éià†W/é²µOiجæž*Ø0ÉAðEÓ1Û1ë¾ÑE)“éÕÓ' ›óù ‡òŽ 5¾¶=€~sæxbtá…°”Ý×5ÒÏ•Ì<;Ð`lEë +H´¥€ 3•°}’R JåJ`…l áA¬†,‘×»HÕ.m*U"û€ɾPè‰èH™ÞÖZïÿ*ïd·d¬Yq½Ôí¢þ¥<ãÕËß °)5Žro2‚ðe ÕqƒTì#][Ë–vS²‡ÐòÝ@£±:Ñx¨^SË?âÍžÛ³X eØ#°·L —øâ—A¢»–w¯ìÎÇhJû“Æ+`~‰¤m»a®¥L™5<çËùŠÍõ_Ô÷ä°pÈïjc*³è¤íI…Û·V¹Ñqëµ¾Æwû6ÁQ—ɶðšŒõkì`üÅ@¶üøŒáÔŸh›²áð Љé‘Ùd±L}‚¼6‹)£ç EL+’AŽ‡³´yÏׇûŠ·yóÕ¨[ÏB%Ö.k¯`SÓ° æ°ª;!^nëð<ˆè¶_¨§ü|“‰ zÌò$ZÒ4¥n¤–W³A«*c I‡Ä9,ì(þ°Óc]0µòû2ˆüQ*‘H«ñ&Ç{Ë![–„0$èRl1ýEžg,\µ·yµ’ØäÆpµdP…Ä·%àÝçCØB¦úH3”ˆŽ›5Ôs¹òvs»È¨r!CeN1€„¨UjŸ«ænËü³b£H&¨ƒrÞ)’ý8bëÏe=¹øSbO\Œò @ªãóxéö¥³L%gh—Ù€¼© ~RQpA® ,¥ôZTGñ%hnÒ¤*ÑŸ ³_Œj ´4—}¯•Š=«¡Ò·Ÿ9yp.ÊÓƒža=o•_ò™­„œ€‰4u9`Ú-Úˆ™‰5­qÿv¾¢îœæ?ÒÓ-ƒî‡áÎÚÔ_‰ê¦” è`¦®¢šâj››cC€Qa/—Õ“@û:‚·¦ufJT¾d¼ }5ï\/À\–×8ƇÉQ'ž'‚?_º¤ôL±©Í¡lûë®2„×&G-½Êèí»îÈŠ[¼ñ±´avíqP®SÕžhØ?ž“äìøíÂì©!æ·Yñl^ôMáB/Ägãi_cr3çÌK'<\§š•weµHi)J‰ðKdB«æì`P"Ïþ7;»äV½ô¾ð¨,]îŠåôñðÖ÷Lµý¶>´íŠÅµŠM`ñ‡ÀãWéi£ÿ F ©Ý&œÒÚïÐͱHïƒÅ=nǦˆ:wWÈ~s虯Úv¼ãPäûô†³ÏóììÉ’ÙÁœ/Ôö*7™ú‹”Et”'Ìѱ3)$"{½WÄ×à¶^÷v4¸Ø$Ê ÕúÜ N—ó1–ÍãÊT¶ùhqŽŠˆTKW®¡—¨ƒÂbn ªîж~k×uL5TÄS뜜`t‰]zÖÚŒ·ƒöŸÂx€0¨«tÓ¸Á`êçíòNoBÆ8rè´5{À“൲Éx}ö@»‚Ø Ò ±K:—}˜IÒº¢U°©Ö ïË@¾’hµÈ’Иu[r]]¬Õc-AΓO¨8¤Ž§?kߢä„^ȺÈ/À0Ô\JF¢ÃqÐôAeH2¬©3*. NóUŒ£F‡a™¾iX½LÛUQjqp¥vüÚÛ-ƒ®µäœÂž™[ËÕm5Òæ½…8ªœIi„ìk@O0²MFf\E)Æ{›×ê:­!oTqGƒQòÄÒÁsMFdãÔ«ÄA¨E&ð4“\@‚·ê¨Ó›†n©ôy«FŽg•7uÂ)™ a€¯€Æ𳸮ƒ¨_§!!%Þ\d¯Ÿp»¶#EøéM±îGªë@íÐbM &$»Û‡«M|plÅ…Z°ó:¹ÅUb ¶®Çðð7àHð•5†ãoÀEX [0&îò,B2µŽ9‰o²6à€€.æ[6òSŸ C@ú" ªWboëºõéøàᵋ—Yù«4ŸÔ :ÉXÓºêaZ œÒm€ˆ3 eª:÷ûà—$H³ˆŽš8+[fâ‚Ô3Wà)-QJ÷²®G« ãû±g’ÑdR¡gX3ùW6 tm'ØOŠ,ùÿ8ö{SêWà€I¸ì ´Ájn>ͯO®×ë>c¬A¸;ÛÏâýº'fMÂ1U‹óÒI!\œ_þìØÄI4Ç•¨Š«™–o‰S’½ü¥n;&ïí㥴Mܨø˜€ÐÏ>¿÷RÎ ;"zôï¹f0ØYÖ¿!´’Q†>Çèt;§k´Œ+žŽã$¥”@4ÅçK±$äËg¬/àÓ7ùk ä8ø¡ ã713xÊÄ\k˜´ª\wÚ7ýÊ:i÷iž ³–×»:‹¾MiŽºkãø ¿e3°æt“AxVCjì0þà ÑàO¦·-3eW˜3QVçÖ#Øs e*ø9nŸ*ƒ0 ”3à´‘éMßL¹1Ô ™=¼PµÉ¿S2ѯ_}l»÷ î‘Dæ¥ ´!ÙZæçÕ˜‡T»ñÈØ{£0m"?´(ç‘ÿBÌŒþqyê¿Éýto:Gz¤ã¶¡êœ²¾=€€€€€œ®ž5«6ô´‚?qéQj£=%¯!‹€€`õz6ñ×ñPÜ­DÛK4­»97ìïzXkùêº ¦Ø‹AÓ‘C3ST½+j +Í 3Ø'=±tîiGûfH¿C©Ç$IóSçäá¿Ë8xRö'Þ烬0ùáõ™¢w<¶ó:~ªÁü;4€dI:v (˜žôC~(©¸§åJ:¢*“bgë…Rt,AEHæ¾Õ³uüýQRÆÖ7^’íOÁõ'à Ê‰ì}C‡!\lã4½UǸ1tp‘Š}9 ¿Ž&VU=ÐÖ½O ¾!%ƒg¡…¬¯çH¾À `õû@¡þâùÍú’ÒÎÍ;yn,ã$ &’Sè:­zD Ë3³=,5o5.bžq,˜CòŒ,’º×JF Ÿ€÷¤ÜɦYæDý”…Ô½x@é]ï¦Ð²¡[D3„5æ¸X%FL„b™8ž½$Ä,«9tçå—³A™Qt‚¡?Dqõe†è@oî’!בœ~Œß;/Û›×ï´Óážuäѯö¹®@JKõ4¶†`5“pÈ=ê=‰ ÜÄ<á.À+[€3 å¶À–ón9×­ˆyÊ5{8¬¸E]1 ðß‹¨=ïE=A71(Žvž\Ãûæíì!V”ý€€›§`?/"4§nRȉˬš –ÏÃ,ÍàÔ~ì*Åm!èçXÛyË'MrÿYàj÷7˜Óð5ÿ?÷ ¡€BÄ!{ƒJ”ÿNíVè•ÕK™ÍÏÂÖÃÒ L…Œ ×Ò[äßÃ¥Nî3ärPKÖùÝÒÎO´Ü÷¿N3Ñ·«±F` ^‡ê¿hÍ*æâª?peœ/}t–rë…k0Ʀ(¸%¥“šb6_iDÿwçuþ¥©o°^dèùq,d2ísS›—%‘Ä4¿©…Ѻ1pˆ!hä›PÆ¥gþê—ÃÙkïë(y³ºéšhüa®Jå—Uý(6>ÓŽ˜àçUÄò…㾦sy] Èè|-Zœ ô–l›°S=D’x*”[Ná%ý|Sñ“n·ˆfRJT÷¶%ánÙ}¨p[;)¶sž¼ÓZc*E‡X K#H-›y:ž¯k¦>ëL}¦èO05 m=O­þ•øJ‹!?ò Õ$fhÁ’ Âú7E/'Šªg-Å@!‹õ’zâ—÷¨ŸK=üWÃæZ/“—Êd Ô³ ‹ž¸ÖôÙÄK jî|µY# Ãúó¹-„Ýö>ø‡ÒÞ—¬@·î¯|‡Ü”}/Q å4&÷¾Ët}xä€l¡ñFêW0Ђ!¢Ö6ol¯ëa’~yàÑSg‘…0¥ 4çC¶?ôÌ5a6Qb¢mËp»õ EäÿçÊÕ‹ÙÉs²!«Ø±8!g”Õéô\,’+EÖÑéà§Öy•égà‘Æaz*=Z¢$IÄøñ5į @Á/m +ÖIh–"oH¡šÜo ÜœXT{Ä©ª7Hí¤ÿ. K®Y×µt×4‘5¯>M§fŽdcXÙMÓÕá&5ÈlêLÅÒmþ6Ï¥L<òÂ2ë …íŸí_G·µ‡ùœõy¸ƒ#8Œø¥X䌡Z.cÛÚü»» ½‚ãìÇ=OMéßå'iÉ(ƒ¶«€#YVyÙ=ÑK‡W¼ìxv“À*A×".Æ! Ìs*€nTÝ96"Ú°.¾)VŽ.`Ñ»ç%»ÞºE(cœQJÒÙÏŽ|è•aV‰Ð´Û©•þÈdiè‰##ÞÂR¤~CLÑVÃ>BC‘t×òõ¯õkB£Vèà&ƒXPv*nÎèˆüòvÑl$žpÛ6fs€^}¦ô«>šˆãylÂdßmþ3$Ó=þì;åR¯]yÙ±€#cO«)÷!æe ³/ß'Ç#U^î*ݱe5M¸âp#C™¸kŸÈp=B¯?³¹³³~¾!ÑÒ† -Rø$/g78œ‘ãùçà¦~ ϖíðT|ã>Ðz}ÓÐJZ%8]q›NËëØö?‡ª³sã76¡ —Ø/²ÇI‘˜}îÃc¢SO¢ “šŽ›AÚ #ú;é%ìIõ÷Ø €¦¾ŽÑ2¡˜%2À+ùR.¯Ý’ÑŸŒé–Jç.Ù»‰šš²Ö¿ÙÆêöU—Ú°cŠÛ|Uf»Y0ê@h/ô°†—Ž!újRÁY¢EÊ[ÙNK×gñ5©'YÆ#‡<<ÿ=ôÑs€N Õ§¼GÍx¦DäêôœÿKªŽÑ°ˆJ>ÅKãå®9ð„t³ªùñÿŒ*¤ ú@‡¦R/Ì …ÕRwv5i\e6ïkøGã3ðÊmæwG쯥Gé>òiÖÞ8Ûpç@úÏ2PºÅ Ñ|›îl|¬8Jßq= ð$E¬"ËÈ+Ov‘¨–*þûÂ¥iêiØ—®–“òÉæß7`ºÚN^Ù-o7nÆ Êd"Säjã+r†œ7 ÇD%v”eZ7J!å ;DP<6¶(¿—†ÝÍWv™%Â3zª›˜L¤{ÎùaÆAxB±Žo¾v—@'¾—pÒ8wÏÄë´ÂÒ–Ä“D®ŽD1ud‚³t” -ïtVbC#ÇBãþ»|ˆóìØ콕¶ù?Uk?hÑä\5³,ŠêMŠV©:е$3W?LŸÆ„„jHàtÇ©õsM@Kþ㎠û=m¤ßÎÄ|kƒ‡Á†htb·Äxe?Þ&(+笭‡býñ~Ë´¥!ž‚¼Ï(Cøiùö=´t:·r#‡›sÒUÆ“£~ÁÛ9 ‹ç¢0r;¤¼^¦Ô«Bð-ƒ_ñVóªO-èH‘ÑB=Ž»4ΉvÒÏD‚Õ`!÷vxtÍ:}€³ó¡J/G“ð9#Ô öž­˜Æü‚î/Qç¡#Q’ÁŒÊ™¡Vâ•ŸšE{¾žÝ¦9XUG3ñ6Ýr¬Æ<ïêå¢G†§C:Á@™©F†Û3æ¶H|±Ð!²dþâðÃßi$®2QííèG â”ök!bh-›P“FŒî0l±,›…-€@ÜB 4t d‰$½_]òÛn€˜½EHò¼`ê)FføšeÁ@µO±ô Ym¶2þ1¸oÄ œ}{ÌçEU#Sz"¹dGâZAÛÜ5†¸]†»¹Þݘüd[¦^Ÿ@Ýqbˆ*¿·šªXòžEó¤ˆÝ—i˜„£‰0Úwò;Ü«gø¤±âIý®‡ûŠxÖˆså6b,ÀªÊÈ“yýG^eC¢×ÝYùA#2ô?¶’Œ#i˜¬1Œ¯×¹IVg †ì·ô =ÄS'*+¹Æ°ýâ§ÿãß<ìR|‰Ë=$üªl»]¬ÅB)+å&ßnÍ9'Â…ûÔfæ‚0[‘JÌs†™êXBZ  qn" v{:®UÄŠ”×Äþ ƒ_•ï£Q)ø–ù©j¼*l5©3Ò(\ܾ«oÇ=\£C¿Ò|’¦ìô·¨Ç/…_»6¨s`Þ›Ô<¡uX$(?Û¸›âÐårreLvffN×ñ=K­À¬wuð¤[%:›Ö‡ú{ÈÁ}‚`AQ>Ëõ†é·¨semÔWC S@ ²B›mÔž®½eѼRÊu,v:¿W‡ßM÷ë’¢ÅFR•YI·Õä,g$˜ÈƒÐúÓ-ÅûøY[uí×ÚS)Uf ëëFž¶1ë(F…´ìì0™À·‰\àü î\d¿\p¾­q$¶œ¦ºðq·¢“Š´¿,šíÕ5@káYmð™Ó}šh€Š§ZkË 2±F=• ´Hù&QÝZC€ï-Þf;·§4iŸ7x\")†:½ññ\ùL@D·úè`×i í»’è|®ŠÖÓFì-” ôÇ=xR“%¡‚Lÿ ¨AÓñL+fÁ¥å|cÌ Öyõ­Fúxd@žº² gNsa N¸°ë£2Ý/Ýìé…›»Ç2]<«[¾¦zæw¤ö¢]Aîóº$¸þE¡gkº¢!ím?s9©„mÈÄ}Îß3îüÒ¾¸„î¦Hh–Êãø3Ö W¥ˆO›±°üJ×fëÉü‘>X£¸P„ö~´|ÄÀS'Úm(ÆÊaGû˜~lµi+§i> =­õи‘·šÚe…Y®º(â|“ ›Wíl håZÓ÷sUy‚3†ñƒmFsõlÏñ²ŠŒ%˜DŘªÞr¢Ä—Àó{ï>xbŠäym™öÉ3O§·r Bä ½ÉA0e@ØVµb$ÕtÔbžï_»Õù‹èsÞ=á–Œ¼”¿Zì˜_ù"h»ÖX“LåIR¿í»ò¹)ÕRÉÿGÕÀVíW·ÐF\€iSMë–Fž›6.ù ×7¹—ÒŠIA š Q|ÍJ8 ÂöÓß+ò—äß*ôïª}¡qÎ9Õà/£>X¢AU^±Dkl ùŸÜ×`ùæ"ÓädEñ´¡yoÆðÙÿeô0¡Þnd^ÚÈ•…w˜õ”Z¶ê¡_¨¸^È'Ó&+öLc l4f³áì¿ÛöñÇŽŠèRÛ~€)¹KºÄºõ-#«]z¢Ê“žA§µñ…~r^ÌD—¤Å^nÍ‚ôž›4´d›ýŽšØôNý–:_—’ ±ÒƒJën\ÓñICFö*ëðäP¤Öu¸:ÙLÓLÛ'öj…¼ÕŒznÒò¨¥Çz…¤ÃòûðJ/#¼¾ã!d4v`hí–`ÀRʆ™˜WLX W;C¸]¨®+€€w‹Ù»Nª% ÷úÒè`[ŸiœÀ“YCªôḔÓè(6‰ýIˆ¡¿«X¢B—æÖf;éਠ=’q¶™xÛÝ0^»"V}óŸa|]ƒh4ŽAõ4ÛåâhO¸@|p/¼„²OÈRšØÆ>ÏÊ»­»÷Ù-QºŸbõ·šÕƒ…j’üMY¤Àf‚y!Bµ2$üi{e’àê¢æ=x8î=I¾~ÜÂ(\ÑXz¯­ovaÆpiÛ_Ĩàê@Î{ËÁ®EWëÁ¨]|Ž•²*åy”Ô!`²xŸŒ+‰Ì)1©õÆþåI)æT±Ä?¸°§MÕ¬û¡°„¼ÐÃO™”±åÏâf¨DùzÚ°7æMgÓ5PÍõoÿ fK ‘`ÊHz('DƒQ÷1[4þÙžúç6ÁÀ“ñwQŸØÅb¾½7âRMcþauKƒ)FìHŽÐˆ‘´¤1Ub¤Ô´fJ]pyÓ7h#½8³£!ÌÊlH¯S}÷9~]¹ ©Ù¢~@< µUðQ­KÅH˜“é!. ˼?M–ITѺm{ìÌÛuLúšò!1ªŒPñ¹ñxPOü”vÍÛ¤§Ó &ö5ŸY^ß²e‹æJÜøgO0oéÏÿ3ã'ìu \CËñ ÓÕçRTÀZ­ØP ‹hhÎáÇm‘ú¤ø*‚¥Ï¾ ›´/ÁOqæø.ø/½¦óôÓt(#$áÓà*«Š<Ðß;¢ú¼ÚSGQ4 5bèè”GXRO‰ïÓu3vá?¦œ%÷=mO|þÕ°þ©»XÛ™–œ¿º õvKFS;LZÄ`¬ÙçÔ‹nP—/¥g†J,®kgF„9n¥‹Í˜žœc:3½<«I½µáý8žúÉåÕ ÓÕíÎ0Ÿ9f¼ðD#B¾JÔÏj·{A8¼VäQ=Æ›=×½Ò9 ¢b’îºÞÙYr†ÆrWÑÈt„ ôj SE%}ý6AÔÇ¥àž8´‡ƒ²ÉãtW¡Ìzn…@ƒ'¹aL•ãìÎûþ™ëe$ÊCÒÖ ©ÊÛ^:|ãÃ/$òXÐ%¿ØËË›è¬(0)~trƒ§ÑÄCÂõËÆo~‹9Î\JÜŸð·ŸÓSnšAŽiAtˆq3ê(Ù¨…5ñaðû’÷æÅ$êbÊÏ ZÂ) =¦Ýa Â'S³:n0sà'é9\} æ½Ü’ Öƒ¯Ày1ügí P/ | =(l.ßÔ 4hÞBÕû³É Û÷r3ŽWuz,&º? ‹¶¹2”±%¾«é˜JU³LÊÏš²$'ŽìžoƒwÉî"‚ʘ,®÷ R?u„b(Þ¾SBØK¦³½rèü’—py9š²h~õm[-´ößjðø”Ö9®Ìhþ.š·Ð Í¢LsSÍ)TÃ~ÕA™>ïIPØê°Ô,Ÿþ5Å_Ž·¨”r LSKMG\úóì³ò]ð#§/iiŸ· m*œß?1…1œÚFS¡‡ÌpÀ–VÄâüä£ùEƒYüÇýIuîäKÎ.Íš…2<ëfŠ8»¾xJzp‹³ Ûmí)ÿxïŠ:ÞKÅ°‰yDwµÎV$’Kж>Ë-tüÍ +4òH”&°ÞNj0@P… g¦5ã:òµÑÌ£@êwð„ý<ø4픓¡sX#ªe?i¢>Ǹ×:&½ßh *µõ»¾Ì„k×¼$älŒg‰Þˆyû¦O#5|³A”pÈmßM̬i+ò’ìhšHå¿ÿ^5[Ã…|9U]µü¶9ùASàžoc7YUÆN;',­ÿWJŠŒ¦¨Xze+rRr€XêþýCñüX  ¾Ž’Åyyr g8k_=²D¦ÃÆz¬˜J'‹\ïAöWpRÔ €å•ãО ,ÄÓWäL§¤¾±1$æ’>Ô„WºÆÈ}¥—ò¯º”96w%û Ï2ì_M5o ZC„Wá’´ ­ñq:ãÔœ4_C~r§žøôF8§löK¦ýC*§ŽB‡Zíôª>÷¨7,q(ÓÙoJ5*‡.Ê”Q |Ñ…U*=EÝ’O—:‘±0˜fÖ–v‚pùÉBÆE8 éóm#‰£uV•Ê|a4d¶qè ÀJ+Ž$p0ue›qûûõ·1¨´Ë²/ {Ä®Ìà×ÕÂA,¼ §aðFï­ìUN›—3€ƒCù°(:;ø¦Ô Ͼv"A ü¼tm$³!¶¡à9+^qöAý¢2ZCªß÷¥©ò¯† ¿®öýbµ l‡!‰¶¼£OªjëuN¹½Äên_,;žxQ[mPØ™2 =Îï“Œý÷ÆÔq±øPJSTêó‡iû­ôÛÁKI&7½åS&žÆŸ5Ï{YSÄþ&ºïUêúo)Ò<¡UÖzŒüT|¤ê]ð˜tÎœê?ˆ÷Kªò6_SÇåÎ3ÆN3–fgŹZZâœXÿ?ŽÚ™˜–¾ Myîpœ×­)¢SªzÍ›6Üääš/ЂÙÚ¯–­¯¢faïÈŽÒX¼íMñ`c f³ƒ–d½­l´¬2þ‡@Ž×™cÌ8_NiED×…ž£™Ì6¢6=ĦÕ®ã]ŵFwsÕ3Íq·×UÆÐinš¡ö,UÖ†î¡-ý®xhÌœ5ª ±3·<Ð^I@´Ôu×DË,›Í”¸M”¦òY£ÊO‚Úlž šI‹Ï0U¥ørfÊMŽ=ÎØ'í,öÅ|ö¼åŘ"BxcÉ.¦ÎË 4BýÞ&œo—Ç$àe™Fž¬L«\Òk?zÈ@?Ø‘å(ÁïN—ä¬Å£Œ¾É(jIžW€ŽïÏ…|9b„E  ?§‚Ò”£ò˜¦R5ã$gÓ4#±wGäñKÑ{Ç‹Ö3ÇzÖ‰z©)”MÜıܮŸN>SZå¢Ê¯Uª—¹o³]Ý¡[ðúsf\6fH@ÆéTí&’C±°:ÄHÏÞŽ7b[>„iünœz Ò2B cdKZãùx[A†'{ã2®§ï±5qN~QųCÄÚh´6@X…ÛÙOç¯|‰ó˜“ÁæôÆ©k7cÔ‘ùoþ«Ç!Co|““wõð¦jx|°ë·7¼:Q!Ý(x… #Ãbn(õ 'Ødì‹· ‡âØÉu&²Ìþ0›b.äOï/ $IÜùy´;Yºê 6r Î7®*I'Žœ{ÉK1bÏ÷a&D j†zòÎE>}ÅKªQŒ6¡<¯ÃM%6^Õ³Ø-£Ä KÌUÈ•SìÛq¶ËÙ|Ï®ÅG@½[ÄÏág{™Åï“í ÅuQ„{t•· ±ËmeÙ{— Š_ÁBÕdÈ1„ºýâÇä»íõݖ⊟J¼Ï4œ¦¦ä$.ï:Œ·_Óåpn ÿ2³Ÿç{gÇ’”ˆ\µ./V9L (œ7ÎlÂWu~àV<]”£«GÀHã1îÞ‹|W70•Š—7¤7¾NtP`uvÖÞªcþÔ&¤ï×2C ÜsÍÈ÷9ëgÛêŸíK¥„m:Ÿ]§‡j«•ÀÅÒEW1j)Ìuc¥t—ˆ“ùåíÂuFk²D}Aï` üFÕ®‚ç‘«?WÇÞ}Ué(”W‹ÐU¾IÎSXBx…ÜÆ_À úD|—*S­ÓãM³Cã`ncî‡Ö?M#Kž4Ž7 »X ×MOmy¹€‰OLµ©&ã5Ï×,·¶*Ê^2tÊÏ \á~÷¶0‰ñ×ä²ÔŽðè4ú4ŒÑµ#Ž¿Q·˜«`çuÀ²wTñL÷07a.èúE¦Fš%øö»H†íBMÆ͉1\w¢Šý¼±`­ö*`ôßê~iq½Qíaí4ǵþ«‹PéÞ®ö¿ÈóKíGªùGÚÙ‘ö‹ 4ï+pÎÊå½+Ò}Xy:ìÍš¡Dª o•§0ãÏaPÏóŠ<ø[]ï'·þ:¦š¹&÷‡VŸÝû<ò>ŽÕ³Ü"€BÃÜwÔã Bw6G9îü¸~}‘½Ä|§$f#è†dtb»àE¨g Áëc¨ ‘©KŸŸ²bƒ6÷ Œï«ÈPNá KT ú> Ädÿu¶±à¶¼©™Û]OrUj¼Ã×µª¼óFÈQ˜åéä44'Àܦkqü; ìĽWß­ ]›Ïn1:sìôíi¯Íãɵ-œ=ɼAæðƒƒøb›ë9š¸)*?·*iN÷ro*¸n¬Ý¯Ât.&/ÏÊà…Žé ÏNA(f+Áú2NêO÷µA/G;ö—±#võç)/ëù0«°[ŽÆ‰ÓNˆˆ€¨´‡»`_·GÑÅ\¼2¤}•8ùSÜÆ¥ªbXEÉØí`<Þ.k§G³¦m‘[h×ó:‰U>´¤{€ä§ò^ã­Hgã¤âœ‡­8èfï¡r""å»çÃZ¬É†hðL]/HnÒóKRÈôìò.h âöäРÍ4Úïk:6ø$fÆ8þs»Ë·C& :…ìuç»Óô7B£: ‹hP¸!a/N<ð« ¬ª`å:ÕP!¡èöפ1‚N¬ûk‰åœÄ¢˜Aí9Ùtà8>ë? ïÁ ©8•,ôkì#vGHBø{ÏJ§s€Æ“!ß=Ö^y&4Q½Ù]Šïð?M ´÷lô~$5]†ÉÍ{­F‹ñ<&V^JA'¢—sU ^E‘w=Ìûlß`s‰~2l ÑãJ@^ù_.IZL9ΕiëZÖ¬vUµñQ·J ú=KóI…Š[Àá8}æ‡Ójh“ç¨jC£t©vªžŸ’*•mž[PÅOVjH›ÃLƒàóÈÆé°ª¼_(KÁÌ{!Õsv˜ãOxõ¹À„êع݀²í^³ÎöHñ!D”÷yYª&÷±Çqé\]éî˜í}r[d”ñp0É&«9Ÿxíªçåêmc•ySÊŽXr·”|ªå+3Ú£–º¯*5_*yUʾ[å+9gŠò¿•¼«ÊŽQqîUr¶0QöŽV:d0]™µ©âZ1ÎUHÔÍšE-Ôÿ{=Š¾#ºð„¸øm]éêY!ÏŽ3ÐE­-–Á´ý™«vqø{{9u­Ó¹fy(mË)ëËÉk ½zQÒJÙø•ÈØH÷ìGS”onˆ&_AK_->.’Ç9ÄS––ßBa‘NŽk…ö±1YŠ+4”ôó0I!ÀKokfk©0‰Ô©Î²zÂŒó“‘DPù²”;$…0ýr6…K±Cz4ÃUÖ5lÿuûõŒÄ–«nÝÓ»+Ì!UÆ%©MJ¢ Hg8.žV¤…]‰*šô&FÅ%Ϫ9¤kmVSý߆y—Ï(þ}ç"(¥Œ5H(=o3ivŽFA EQäO`ñ¿cQ†'\œÛsÎÃn#&‡Òä$@µ©­ä/‹˜·—j@¿U q\ÒÎUü!NRÕ1“Tæ™)'®(/§U\(Bº¾¶–*€€€€€€€€€œ`(¦Šãfí¹ã š-Îbêw.†Qj}Ð1g˜•z«§×Þ™ãì¦ßz¯Ä®ø€€€òŽåäèa±ùÚ ™=vQÍ—kº»éM8†¢ù(Œm3+dç@¯ä³Κ]ién‰‡à±Ê¹s:d€ÖE*@Æ J·?„.}ÃçÖËcâMQ©«†®Œz—œm¼°·6 ÄÚ¼>Ú wfP£hQS$¯fíÀòÃ|vÍוðã-’Ô,VšÊ¾°†´ÖA8RgÒ"Ä𼨒gpºc òåxCÙ±˜ò6ÛsñåÔǶÕöR½þZËÎîÿ"Œ0æŽzýÝ=öȉŒKé{*Ä_Ër9…hbÇ=P´p;e¯”öÖ怃Dæòð5ô '^ÈŽ¥Î*pÒ0ØšI^¼˜ùöïa½¦CÇèÛÐ0´ sìë˜ãã²²÷T²îhÐ[Ó­êªr‡Ö¬ÿ8!ïpRºo8’±ÍrÁçQÞ$Ù,«:ÑŠNJý{„¿¸pV>&á–‚1Ûë¢%z}KÈž<šõ-„ú‡·‹–ã®tÀ»Ó‘¹eM†&ÖÛIqÀ3ôÜ—ÁBÑôð6 ¥Â˜w—ó24Tk”¦A °–c¡c9d ©!òƒ+”«! s&ô¥ê‡à @_£y±à‚>Ï"kè@å¦Ê:l!~:uèñ™ið÷µ&®Øl„v© 2ák¯OFra5spƒ,¤ú¿(çî!wz1‡$T¾Jzì óÇÿKÅfl€~£®o5qj“És¨¸Õ1<öCÃËàXú±àÁSÞšcön&]â½¢Xšã°uk8½Õy‡è(z{½©!…E¯…êâ7æyFØr<$Öà´=044I/ˆ„¸X}OEóNV Ùß £Yx2ê¥ÖQFBUœáô›þÄÜë.Í“XÒa$é8 ûÃäµ\}c¶{zÊ‘>Äã—D\Ç!»–;_–óÜÓ¢fvåÔ …+öØÙz 7cÌx@ïøöºÑw£Hί¨%:R•?`>™ZàL¸&KÜ©…’*ŽdE`Í:IýñðÁe.HD/½Ô&fñEðwº <%,H¢ÏѶÞ)§÷àµ}†}¹m¿ð»Sad …óçú¯*Àä¦çH©Þa½š`¸TzX½”‹‚y›Äú¼V‚âí—%¢,©£.£õCæZÛúh™œ›Ý;uß9hƒXÇÌr’¶CÑÂiÝšGΰºY|ú¡qUìGKvsÄÁÇ;ª·wŽ¬‹ýþQ®ŠÀj®ZØš¥X~l·.¬ªèiZ)N‹$Ã^iæ¬1pBñÒ)š{‡s0€—(³ÃŠ¨å²ˆÿN1ƒMéñÚÔ 9-ŧ…vt®Dð\Q&¿™œ8€ÊíŒÚ·ãŸ§»Ú¾Ü³K£¾8®ïêL’NÓ»énÙDzÆ aõ>PŽ˜å…sy£©T©\˜W¦£ÞaÈCúm9ý°¥Ëo€’s3‘Õ׿ˑhm“X?3 M¿‡«{*(eŸÀ ñ¤" ˆêçX:½Êè?÷íŠ\]º”Ç_c‰ ´±>6? ás"µÛû€üˆwÄÁ̳ÚÉ®}2àÞ!úSnÛðbB9 Ä+¤åïPN¨¶13ùÕ}ùð*’kvêóöð²<ˆÞ±WÈ&ùE}~iºi ZÈýH¶}0¥æ™×ÙIncãÞ7¸—b_Q„£ÊÃèCè©°—ö— ºñôFÃvÞÿ^ݼ, ×ß>Œz¤v´í«(cÐwTÈïζã"‹?N¨$á©.ß^;i±µæq“4²û¿îñF˜Ö&ï÷òÕ¯‹Öëù¨Àzþ´{ÔÛÉ qríûNÚÜš»¹øõi IIP»ÁÌê×(ç[;.õA¬w—öʈø? "í;YÙgá Dma×7 ©®R³¢–èGš+eyò¢Íû[àšÊœ¬Wa¦áÒö¢÷íÊ WRrà8x14õ±Íxj1 ~ âT˹“É|¨ß¡܉¿êÔ”¡òEÆÒšYýjã¾%¬Õû‘¥+ÅõTÎRËìl’nº–%ÜzVÅ°kOŠ"O£}ê𴛨&fù—OÏr‰ý/J >8%ï·ô"¹eé_ùy‹õÃà+੾ «}pó×’¡/•¾ ${WPS‹Q‘‡¡m†Š§û´ˆá2FpÖ–Ø—bÏ#¶t’gfSRôÎÈ]Ú…/Ìf¥ÛÚR~ó1©æK^sù_‘aB۟Þ_})&J÷Tðý}×îˆ .aEÊNa(Ù¢“<4´§¹…µÊ ”~·¿pq_\§²¬::ÍM!uÓýlŒ/yÉLø´ìñNÚ l›Ã%rÓb÷O<—K¹ëfëM5'ûbª[ÃrPº!ígßÈ…MOg£¶G‰ɵ?9|Ųzý’²ÁH L¶ó¶Y{8dµ‹€à㹿MÀˆ6ÁÈâ%Uá‚7´×*œ3gæõØ:ŠÅÀdæÇ• Ð~¯Y©æMÏZæºxC-ÐsÏq5@óÜ aÍk z>ƒ‰‰K”L(ßcy_cxÁ©§,"ÇU8¾RíªÃÛ îSÑÆhBÀ÷Á¸¤þÃyl¡ZqÒò•nœÔ_%OD†7+ƒÊJ~Rpíƒ ßž?[×L±’|ÀðâôV‘"x9^ïsquÐP¼J,Isò*KÊ6¢¶¥QöòSá¢ÎTíšf"“¶Ó>3MŽñ’\†ô‰Qnø®}žü £¼˜ÛO¬ª³¥öh=€Ñ‚i½±+|=›ÿ|×=æVôy=Û¾à,1 ¨Ô µ=V€íEÂky7œk0§ˆíCý(—£4ì yAj”;—ŽØ?{@_Ægà@$ÚJ8Ç¡L`õè!qî &ƒt‘ãø y’ÂÉSåà³›K@ÿ7pÆO×Ñ|'3H¨Á ®¦ÞdMaÀ µÀÅ_Œ©{æ"«¡UµnÞänà½ÃüÁóø­t"s U$j A'€Ã„'Ê^[~Dí›ñâ­XôG‘%Ó“¾ <ÖFÐYâŽZT‰,æˆÇsˆ‚mñÄId"º‚TaÅ6z¬¡S¶}èÜöÖØ ×A1$ÊUtKì¨KÁ1ß±ŠÊBÌ ^ùÛ+J°®þWÒ\—ãEˆiB)ÌÔKÑIP@ kTM‰WGf{á¾Pu§µÐR+ »É.8¥A¾W×óÛT‡) Áÿ<14&U…W ÎaKTã„ŒÑðsÌ÷ AnøE Ñ뤑—A éÞ¨LEˆÅY®ÓB”8ìåíH|Qu+¶rG™™n{8YþîöÅüÝ#bCd4¦—鹈J­ 0Ë(xYݪ?›ˆ‰RVêùn1ïPÑ+Oè‘raÿ n+ÌÇáÑ˵rá˜8Ó>hpáågΚ ¯ò)}~q}¯á_ëáÅ’]¨à¼'rË,znRäò©ðÕ¿‹ð1½[|ÿ`­> ï©^ªz¡ê­¯ß£'v÷‘MçhGþ_{^drr\&ha0¿³äIfï'b€¡â>¬Þ®Ž„ÑX¨ÙбD)uz£íÕCmàÀ7ÏÚt¨ÈÖ‚ç˜ö »iUñßYã¥ù?ò°G,_ðãÓå÷P¢<ÓìÙ¡ó'¬Õõ ÔêÊÙþ|6ÑŤg†²)åñò z ï‘Ø ;“<%pæ~WûÀ%´4)z¿ç(Þ¢`ÈtMîTTu ²±‰“Ü×sµúnŠ³ÖÅ‘§©ïö÷·rúr¾g•Mt鹸ꢕIJEÛ^Êr’ºƒ4WÖƒ ãÁõTèeK–~€IYíÞ…«Ÿ àöfˆQ¯èÕ,ÞÎrÞ1*îêÿ ™õý!•·hsªÆ~·{‰8b›£!’ôuùD¡€Ø\|}k‘è¸åæDžX¥•ëQ#Aów¨‡4P§›žOMït\“¨fò4QÀOm‡•ø!œ—~>8˜ÏÏ]’=³‰u~{Ði~Γê…1Wëŵi·m–Ǽý¸Ä ru(SQì÷1c9©°û ¢V²Ð{m\„¡º³)šÈ–3&kØðÖ‚5žÖð?¯¨`¹Ïiôƒ·õL¼î“;[OÉ™e› gO’Iô\gF)|/_¡Ä6Ü$Ÿ‘áÁ¬Üªƒqí?‡*’«§Î´wå\Ÿ–È´Ýá^ktÞEZxCÚè”ìƒGsµr 9Ü °ƒ$žÑšŒRÚº|O@ÞªFp¥°¶Q¿ÃýbÈxÎ3xV-ß¹ÅlDóÏph/WýbaÞcÈÙö^i ]£[ 5I[d ÚnØSZ°‡þÈ D ÷¡G[‰É¾  D'ÃIB—PãjAÜOöûßø|ù•J¨ÒØDŠÇ\à…!“ìqTÔ}!¯†è\,ÀÆïs*tn¨´úúÐxc/ÛÅžÍp–—Øê"Ìš4Ö©_-ªÛnŸ ¹oð{ijkÒ7*?nMX¦äËv„æn$<­³ #Ȭ6ï’IJv/J/ƒg†ŠýkÚÊO»†èQ^TÍ!PCVdË(ò®n }§ÓËˤÀ¨xŽ{Cáú³*Œ]«ÑC›[ãO¯²~æ4 Ö<«ÈàkÒöí ˜–XfGÉäád¹9 ® ú8I—ð‡Xýr>Ô¤}=iÓÓ¯•(ì"Ì•eúœ4©dÙÙNGØ’G!°Àƒn®fe†_G¤‡Ž åƒ&£‘tÓctÿ9ƒ 7€¯‰“ïAè‰ÀôĆŠî S ì~dzƒ~ŠŸ‹úè„b<ƒê¹‡ÎèùC±Ž“¼á£‹Ç©z+n3]>?¿í] ÏY7ôÕÅ ~)Ñ~ùÍeÝÕøϳ¸ãxt~x·®™œ?•fþ®÷·-¹‚ï1â¹ ê_ÞÔ!¢ ˆî§Ì>¼FŸGõ‹¬ç­NÚ¬Õh¬ž9ç¦EúŠLÒaûûÙF™VÆÁÛrºÀAd‘yI7pÈÁ ®%Î-V„]”êí(¨(Y¬Fè?Õ$Éè¢^¤rs¡±f ð³±²i7z$µ[ÖÝ`7eî´%ÊW xY½3Âvö˜ßµØÐ 0Š-m6€N‡}Œ} ‚§À4RË9é–yIvÍÃt-$ý] ÃåAè¸Õ?I¢–\YØ‚¦_CŠrªÞÙè ey’_ž³»DÒ©¦5ï¯Ï§ÿ…€y©…5‰* €u»5Õú2M!’_ 4Ž50ã>³H®t·Jщõ.,˜û_)ƶwíi¥1ÓdÇõQš‘ô >(¢e:¹™5U@ŸD%ö¤Š b¼©Ò ¸†/hš”’2Žë7)\Ì xøƒên%ÀØç6ŸÙÍÿn=Sáâ¥NžÀŸ þ\ã—Uq¶Ry§pÃôƒh=âoùmTÎÉMCØqj€ æ†sÞ–%ô펓„' ª _ç’éZŒÁ(þÄá"Íf§!Ð3wµI‰ºÖ,A±î,±éé™RÙ¥ù€îeV+±OÅD7ª/ÄFÄJ/æä†Û̦ýÓ䊾y뚌_6Òl?$iüMf3Fã±É$ 'Ðå,ºí8çYìsƒZH~î‘ûÅ:ÔrHૉì ö7Åæ­½r±Dæx$c¦O €7°;åÁý$ Zy’vÙ èÇèzÖ¬×í´3e})äë¤B âyIÚ›$Xtäðw®†'9¹Óí†÷NìÏ@=ö ê¹)äX,0K’Cˆ(ººƒ£Û³{ç2@‡&Ø#Ü—@ŽW¶©ˆca1 Î{®}:ÜŸÎ<ùåÑ#™ár9F4è"#f©{Âïg JmY³žK€eüh_¡$nêØ[ê5ÎÈÖ  æ1äµÍNÀnÑσŸÀi e¿}rÕCiÎI;NYR7ÐU±|ì%¶õÔÛŸü’pÒJ*¾ØR鶌¹aE”½Ôïß–©:?ø ÷Ä1.xÃp&‡1ó*?ÿ.îG©:Oã‰?м1À·;w)Ù¥OÒCÌ{=î<þ“\€ œ”|ìÁ•ì쾎@Ú°oâ¹'Û\¬Šµð¿íùdo†T”Ÿ:yZñ½Åзr5O„k?–OiVHXcÖî´5¦†f¢ô~‚ñ·HZ©'ÜóN.ṉ̃eÂÇ2Çï²=ØýlLµ ­A>ôriÎ\œ#îàáþÅÒ\ßY¡„sæF£: ­6Ûí Ê g¢M:^†íì¿„ó nT¬Œ§¨ü ³;KÖ?à[ðÔ>?¯—i2~ ß>¦øù‡Šþ&ßOP=¢ù¯ç[üvßWü?/ªür§Õoø)®Tð¿øOð¯€o€ï˜„UnnzIN¸·cZO–Ò뎑ÅÝ ä,^¹^Ø1ül“ÚÊßÿ#ÛÔNÅáÁ³ä½ÔÿýíÀÕ]z—!ñŠæVƒŽ7ÿm šKïÅŠÇÿM ¶‡‰Ýx¢§àkº1-:ã;f|·Å®Ôgp ‘ò6MYo·Ü XÀMOów»Òù¼óûI;šFÛ§µ9@ŒÖëâŸUé-CísØëÁ$yÈFvÇ©ßp({„ˆä^÷l1e'H8Áìò–¢]¡¢ ÿeø"K£˜¯I¥¯ÛVã›´=da.[â"LçÐZÑ_JO¦#gy¹<"½–Â^$× `e²8`Ã[[;Êx_*éÌiðî,Ò›rqÿ=9`eŸ¾/,E9D‰~rõmÝäÝJÿs-\&áGÔ*–Í9 ÀÝÌnžnÞìkªà–CÂðÄ3êÀ‰Â Jûè¾ê;uQ±2êèfÚ¦IgœËЈ:%bˆº5?¼Œ‰Ü:š•3ub;V•,AÒáÁè»Ë¾SV;©¸@3öØ`¦`à°‚MEªøÖçñ ³å½¢UgkÃs>„¥ÌŒØΡª}E÷‰~k"U™¿2Üb©î°–æè(kHʉ$ôA®µ,QY#I…™ðÏÌ8;ì *éÑ[wòrÛyá.C¶“Vâúeu†Pl…⺠ˆ-_V;lÅ ƒ(X`RŽîV —aàÃ.µênÝË*}º!Õ56YK6¿ÆÐœaK—Uxðÿg¥Ï,˜°N7¦Ø¿4ç óÇ$ÅEØŸyß´ƒ% ?=Oüé"†Ÿz½Á@-`?ü¸qkùÖ¡çüÍ/€ÿGt‚3ÊŸGäæ5B ”„Säfµ:NlíU·W9ÓÑôb=²oô!œVN¶Mµ˜ZS®y2§7Z zðÅõ¼©=KO}cJîÖ‡ëœá⧠Gq”pÀôj`8Uú% æ;ÿZÉãízÁ^½gúGh-Ò2/ã/ÑFª2|Âl+; Ø{¾&Ë&äáóvÇm™kKóVÓJߦxÝqä”bWŠ]Êfa÷9@ ‰å \J¼@÷*˜RìŸ/p-¬& \ouO)zº²ù?U…–ÄÊ|Y"`:ÍÕ/ôMÀÎÜrê1¤õ-³@±+—­‹Áèæí¬y_$½ áð/T0óQçÚe&(—WЃªÁž'¢¾@ý ‡Œ*Æ01¡DG¢kšØzg$Pî[&…»zZ3q¾›èrCÔeZ1ùcõ˜¥xb,uIéwE³sþ (Y¶#Ô~A¿?'ÁfÇŒ\ÃÇ¿øÈ|9<üZ)™ô*™ÔpP$­%=:eýËPûX<]8«Ý)c’ôéŸð¼LÀÝóÿ›ÿkPÌ¥ñUÿ,È¿ûŽ4ÿ ˦ÙCRy¾béòSfƒNâN €‚4{RŸw™§øÓƒ‰ßç[ëO¿·¨qš ¹öí)gy×–C §¾)/IæWgá›"Щ3 ýv°°/ôeˆVT<9¦B}ãS¢à ÏF--¯nøÉÑáÇψJÄVò‡`#_°\¶P“#¬‘µË%øo³ˆv£ÆÉÝÉŒª†ÓNÁ«9± ¬¾í¨rY*-Yàq ?ÿa]uâLkÕŽ¨ÔayÛˆ`ò¥û>—3¼¹dœrR´¢7É_0d¤x™W½¾:ý$Ûm¶Ûm¶Ûm¶Ûm¶Ûm¶ÛmÁü£ø[a§˜ ãÎ3Ùâú•¥‹:È`v3÷U†ÁýJb#a}…gÒ>4 ­T¦ň´:Ø O9×gŵþßk³ 3Í-³P’'„ImBå%Žæ$‚Zíý¹žùž;Þ‚ß}`Ê;2êŒâ®-z?ú[Ò¯CSص•©Ç¿¤6…ɇË# ‡š½ŒcÎvxCæ%š=Â"¾²:ÏÂ~,X®­&PŽ¯Š|û…D1iu>¤ÝÔ¦³sîè}a&?uÜ‚´¶V‰Rød»tfv%Os%^ׇzE:¶yÁß´b4ÏHÑÿ=­NÜøƒ`ÈIxhIQãÒHbÉÑÖOvÑ €P¾é8ï ñjGåÒ,IƒX‹á7ú?(ŸæÄƯ=a©×ÙXƒ×ië¡©±¼üô»êØ7Åó÷4×æíBûnÆ•bØe¡Ýb$ú³IM=!^úÈÔä_ÔŒøÿùÆ–ÒH¨?‚rßELù@‚?C4< WqRsБrðŽª[åKXt®HE»û;èlåG>ð~ (\´½d÷— ó.ìp%ò@Ýлþ™aBÙbêY.´||¼0øv³ñ6ö·QøŸÛ¤Q—ð—ñ7ø]ðßÍ| þ_^L>‘ødôîPS€z`‡`û"=£š>ÜÐ…ƒÕ†‚Ì—+¡5é»?2oîîÇ9Þ#cº 쵈¼8ó½w½ÿ~õÒ²….$Ârãü´¯ ½ ‰× ©“‡pP‡5ã^*"¶„rn‚$aDŸs[èFs<ÐU3Ù97 x^Z²¸õäÉ7Í‘ñ®¬ˆ{šjoEÖb5Òƒ#îubBàJ˜K)ÅQ6´ ñ1¬Ã{÷• ¶›$I›¢F*IG°–/ÂÊs¬ (=e>¨`}ž§ÅØ%rHÂä‚™¡ãRêœu 9,eF:‹Ö&„§¸ó;ä&Ó•) 6³@,m*ƒ©ÎþdmŒúÏv?IóŠ‘ùKØSà>Sò8éoÝ£_)ö·í–七wé*Ä¿ê“âm?*‚Ÿ1p6¢Mê¾,ÿn²E°ÿyk¾zcK[æ0.‰ ˜sWñ]Z ;%SJÄß²ïƦQäjmð³¡Á:¨m'MÀaÆη{àÙ%HÄ|!0v@¨ÌŠê9/xqñûØ—¡¤†ni€ÿz(Ó+}½MžK­ MÀjC¢Ç/?ØÌ©p%"­]ƒ…¡Ô† Ð,cÁîQy¦?‡Éš;×dXÒ™8v2æѧsU˜›~7Õýãl6ÆÊ°K½nVÃ9ø•¢‡R£jX=‡ó©}¦i(]_èš²^íðÇz›wÿQ w[Õ3ôè nÏÃÆàs1nî›Æè­§†í0Ò˜Îö=Õä°uæ–Az-Ñdb âºϬEOñ8w±PùÞ#™„F5dšyÁ†`h®ÿ4“I­WiagæSñ¯ÎÞ&ÐÁ&LönÞ›oÿ-[Ðñ¹ZéàeùeyG[n僶Nº¸öÖš¹•Pj7çðNwŽÐgÉ_³éMõñ–Ùs+ú®laºmÊ' ‚ í¸þ"OÛ>µÐ›«öŠTp‚Ç F[ׄc]À¾¤à­ê˜|A2&¢þ;cA>ÀÍílÖù–»Y9t¿Ü ¹Û1 ÎtRÊkõolgÊáÁØÔðKÀqi¹¾ÝáRN±1øƒjáƒÛõ拼傪Aõ‡ÃCÕ5eðP| |&~kê¯QùŸ™ñçÀïà¡ø uwÂÿp¯ðy/ÃSð¼ø xÍñŸ…ßðü.Ù›ðø_óžð½f|x°Eí…i½Ì–'YåÁÅü›ˆR—›CœˆÓŠÌ»+EQ%¸a}’Ícþæµ××J¤pìµ,W¡*c˜¼ì_ݯá"íQѺ&p·P{»†4¨aƒ0…@ƒ)-[m2®=7­[Øô’°(ЈÅløD+¼Nr•M-HEÆBšBXLâk`›¨# Á÷˜}%(XÃÃŽaÀMúç«ýªÞH=ÜÛùïʑß*‰qÇ¡ðŽ%7¤÷æ–Óì‰eD”»$7Ã+.˜ØÌ,ªQåò¾!éb5¥‰é´MHs¯)ùx+‰ëÿ-°žåç%3÷xï½F Dñ@Ôü|@Ÿ5qG¾¬~J·Ùí|,8V¼A“÷qY˜ Þݥ£{¢ó£-éÍõÎÌèŒè‡w Ø‘Æ ÐXõžè.£x¯Pàҕ̨{Ä‘r“ U×==Ù¢u Œb Ç…÷Á«5×9ë.÷÷Úë×ê½J ·ô¸¢eTÀ;rfðú“WÕbÝòÃåVk‰ž²'Q4*}8’ÔP¼3*OlbWæ“fÁ¨^o–¥~•÷5Ö[e„Ë›ëV‚*é"5~)çw€xr\ÐÚ>¯ž×ãÇëøÍL&BD׺‰1ðj®I.S±ˆ>Ù‡Ëâ¸çHßš¸³äE¦²‘Ê=\î°[{ A~÷- þXt«¥ Öñ9XÓ'Ð+ˆ1—íe!SJó‹ëù5)É39~rféNÇ–&l%Þª›Û|ÎQ}kçG’'½K^Ï““z-[÷ÿ/LŒ7ûvfN ýjª8‰QtMFªø±¢lì3mÉ+;˜ÿE¤0øw)fUÇe$šNÊÇØhj‹ÎO U¾!ç<"8Ñï¥PB`”¬À¹Fš÷÷Bt êÈŸì*3—“%Šº•9è p²»PÊ•@ü¸Òò+C~/–#¿ŽÒÀÛÁ¸ï¯˜™ÄLØ]s!~oì,‰øÐ=´9žÚíµ´Íx¨Õ¶F~óPVµ°<·æhzwæ5ZC\@¯œÔFÐä^øa»À匉ؚÊvà&·*‡)‘†¶9u;h e¬ÛÈ82Ëzê+k •:(K:±úo¼4n_@^LéYØþý?GY¦O¹!x¼ ÅÿCŽ.óAÉæSâ·ú×jŠBÅ.J¦ï P5Ôª´¦´îÃ`8ÈRØA¬·˜œ@/6çN‘å }*Q[”°ÃÒÿ þ`=£ÂTÂÒå寅Á½· CÚm_M!@P)çm4:¶ãAbAÕŸŸAO=@†ÚßÓ`hCOj³–ˆ!µîž²îÊǨË­seYÎy0UÄjÅ¡5km`Êt¶þbæâáÃJÙ׉ qààÀw°õÍß¿ÖÈøt8놀SvòHåüSÖÍüÈ)‹V"BVlÁ´ÈØÜoà¯f¶…˜­eŒ¦÷­pÞ+¾¡ÃÀÉŸM¬Lx–¤ÍI *j5Îð¬|<‘(Í·Òé„Rn6ÍNÒtÇ*³I€•¢Å’é ¡`#ÃÝV{ Ú^uñH'ÎÄ÷jÄŸ®ÑÇÍá3k­æ [µÅÝ_§êa ‡z.f-ìGó5šßÚ øzl(ëV|S¢(x`œn¡Ioè¥D«š—sï§_’ƒAÔ¬Dx}t­¯‹…[^çhùzêbp>Šý¬¶jã HñDp‡‰p?©áBxÜPH£F çÎ=æ.nPFóZ,ª©CC“iÿâýžíšÖCÆ@øƒO‡"Ž¶¸“W3Äš´›Æ§ª8ü+‡oBÀÕ×@Ç;#Zf» *%Í ¬H*²=ÃÿT}= úƒb-uö @½º.©G†–ÿ(ȾçØNÑTÝ°3†OšQÒáÙwâp0W3!4½÷(ôü{À†^b4ßo~-a„ŸÍ‰L˜ÀôšÂQ€Ô›ã3PCÏC-󂌙ØQ³Ûq”a¦ú Ø ÌCcŒkÙ<;ÎÅ‹õºo-U¡¾¥u™ì!¯—PðXÈsÞN˜ñt*‘S õçOèÎd{ãÂ.ùT˜PY\QÉS*ùQHŽÐ‡°ñçQõ/(½FåK¨½=ê)½Kë^<êNhú}Æ}Ç\eÇ9@ãî;Ç8çŽxßñg*ø¿€?‡wü:7ø,ÏøtÁ°þ —ð[ÿA[øw¯ðmß‚¿ðj‚ËðXþ Xcªþ#ÈUae¥0õMs~óVr÷ü—lº ›¯àd0ŸëŸ¹º,óc0×Þ¶Šù3ô*úÔ’¹Íì/yxn~z<'¤™ ݈ðºmCcT€AJ"x}Ž~¾ Å=À³S‰ Ntº©”·f´Žúùų½_P¢ªþÔ½"tùš%cØm»Ž,Åì0Ð2Za¢Ö\ œÕ®Aµl”®>+¤ Ýœ--gqÁrìÂç1R2Ùg+b±FH….“ƒôРϺ„‰®£i~CsáÒÉkº¦c=NƒÑ›Ôõíe¥ÇÔ‘s–¶2oêÙ;Øfl­å¢#¦*UÏ8ÄiÉÄ&Î6uËAæ)$’F÷wLýØlºoê4kþi:‚L¯gl4Ĩ:Â) m¹Û)= ø­ô‰ç ¾æíŸZÉ;ÄúÛ’HêÑ)¿jŽùž¶])$°Ãàÿÿ•(ÓºïSŒ´½o;¢âŒØ`6ìé~“vHªtp;‹Ý¯¨9¦Hd…îýíÒ¦1é<½ûKg·#%ò {”r—¿YŸIíøT)7Ò9.&Ž¥w½ã{õw£pÐ6ºz<0æ%ú8ÃZÝ}Ë°ý8ÞXþÃ_A‹¾ ॔?‘hå«_;û v¢©¶< øÒø–cÃ8­ï(«ꓽyYWÏ?³k’øS*L îº= L…&_Ül¾û[¼™Õ .qœ¤ÍƒØ÷C;ò%ö˜×2b_OX&?2·xþÝ"vFªè .ïª+v‰NÍéBÄÀ€Pí-#”—£ö%õǦôáÓ_\º_\zËò5~1ß#cã_€Q>7ò;…û×p®Ï [ §Õ=Ïf·~LvØ·ø¼d°‡s9þéèÏOÂ-¢š'Tè½i„jdš6˜yzá¾h³¬˜ÊÖš. m¬PìçZ7ø¸RëÏ\×þ‹¢ë&ÙBûàƒÇ½½ 1«Ö *·JNðš3åCîa8ô GïZ­J¸ló5tÖªuv92jºŠõ‰pHøžÙAîCcÖq˜ SQ&ŽDÅðª=uàÉÄ€²_ï%Ú²üžp‰óÕ¡ÛÍìlþ+M¬òl€Ž¹zֵΈ‘ Þ¤•¨v… 2%ý6´y¯§*‰V«JG,“i7ŸbÊEÑ*Ðh/Œû^ëऒ»ÕOÉ«“¦oï6qlŽ'”‚·k°aCh` ã÷T¿_ ó§ùýNó™êûÁ͹0ù*cÑoÞG:8·a¦ã`C¾ ×àÌ®oƒGiýoÈGõR¯?D ¤=\ÁZM8¡i6ÛVúØ?p«"ðÀbi#ø*¬I:4«&Èš|­ªÜÍ$Êž–|+ÔßizHhªÒïéE¬¸+](ÏçQçèÁ@PóƒÇ©¸yÀÿe¿ÇH,óGqF!¥ið—%kæ†ð½)Þ}Ëö±üò‡‚•!Ê…Yby,3¼¦~Qݲí½Ô¨‘“€ê™Dà }0w“@ýl³Éà0A`ƒ`ºä©`#÷–o·oê_ÈÓt»ˆÓ„8úî2Ò ²^kÌíÆotÄ® Þà!’ïBíw®×Ýòv©ME­sWðP/b°O&+g‡‹¼±€Qw8þîP’Æt¸úÏfüV ‘ iÃ4HÙãPèZ5ëò£w¸°Oò6®Í4<Ò®cX^ÚyD¨,×lTxÈÐþˆL å L’Ë6†eál5C+Ë.y»ÖÚ) wuÜ|£!EåG(õ=L. Î8®õµ/»gIR%ð¤É}oÅLÕi o`&iü‹gTUö¼®Š¤½_Côz $èCäÁY%/a{P`.¯iž‡ˆ6ž¾tÀ\ì IPkìèY¬3øXovv¡ÌJsҵſ¯xF@KÈ RFڼκQÞê©DÜc’ÜÎÈ×*ÿÔJ€Æ¸¹†Îi¨Bêƒ,ÔN%ÒãTÍTàz°÷£æŠÎ†-QŸÙA›]Ðúˆ­ÜXƒnr¨z¹¶-‘5Y5 Ð8‡iΟczÝ¿pˆå-*Å棥ÏC{üÔq™e ¥v˨͖yu´×Ff¬5ðkaPD‰ZŒHå%ˆ³à&Ћ¥ñî¦Dñ[ØSTÆÁÿ\Ckô'A/”êÉî'¶Ç:–M‘®àÎÌõúîÚ" V˜Îoß$õßÿe#½q®»Ý•±ßh¨j$¸}ÑØPœ&ú'Ø›¾r?CHÛ 2.ÜÓC æÑ@£ä½öE\q.QнçÐi»Fôì€Á¡Phá©þgá¨~¨¤5J—Ãu’h¶ÑíÜß&‘Z†¥¯y­vòë&FNI‰Çé 4}z€}Îqt&«¬»j¸JHƒGÂòX– %r³3ˆDÅ‘«Ñ¬noAm`NÁ6TóçzKcqVÌ‚òˆî‹¤O1± Ì%z½«Ì™nÿ%Þ=­S†à î¨ülc•¹Ð4•Ž †ê(B¡á'×ɢ瘀X¿8VƒŒýçý™îNp%_…ÆbÕú1†ïʇÜÎsèÀùáLJŸ8^Mêºs˦à¤I«iU_ÊÏ?¡ˆ’?e˜Å·¹²Pux¯/>WXÍOÖoÉ,¦&ðkf4Ï‘òÁ‚wÍ¡æÙttåy¯õ)î.ùcâ¹ìW¸¦^å‚äÀÓnq?‘‘J ›T nh§¥…/(k×¥¥…ÌÅu7WjÅ\ â+jg%f.ŸÙ^r{«ÞÜñ4òÁߟËIøáÂɵMœ<÷ˆ~…á»XWªh \Lß^z}«Š‚Þžm’Éš&(SãÆ=øž'…ü¸Cqy~ts…»ïiÉÊå˲0„ìW4]š¸ôi ï¿e†»Ù”% rþ¤/Û“xýolÁ³A´4V·‚{±$úZüþàEæ@å³ÌRêø›· 锣Ü}[ìË'D‚rCì½'˜™;‘Ðõ(çRLµÕ3J‹ä»ª¢¦y½q²TIÞwhãÉàó­©ÿ-›Ä…%˜œÁ`|€QÛ¯yõs}Æ©½8™+³Cz=Q5¬¼MÕÒ˜¨- XÝÃ}ª•ðŠ› lsºè³©êó*ôŽçÌ}ï.V¾ˆv;{wÂŽÀLΟ…öÉ[3•qü—¾>†¹G^yßyY˾€ß‘ÒIm°r4B}«(g¢Ûj±íÞ kŽØ¬:8•qÈXí…M<¬–“Áv\‡xö€(RPæ2‡Àe†!pc¤!;;ÌàöW? ì×íya  ÷Ù.V§7ë‰SÙbc¼ Ÿ)‚j“†´š;¿ï&ö@ªÁïà¹ÍøkyuCˆÉ!ï˜&Õ ÛÖt -­ºµž½{à¦Å®ðÂ9 ¡ævãHt@ÓäÿQç–·ÛÔ~šI´Žr…Jý‰¸ð!aö^9ßÊ(ЕõNJÿ èFÊIÕ–•¯ÓÛ^950tyÚê?nkwa@ËP¢Vš4pú‘òŠ¿+ˆ X8‰EkMþ‹FÃZx–ã‹ŠÿCŒ¦IvdÖô³ëõòï>\¥köÇ9÷4Ø:Çš37Mf¨H^Ó¬—­³·fN¼ÕŠf”tZøŽÜìXe2÷5«V …n#-­³›~Ç›–¦Îò§XÞÿ_ ¦Δ[§!KrÄ—z–½®}Ä)zÚNêV)93QD-²g¢„ÑêÚ;½é0GõjÂ9‰œ`\©Nzô÷þq~ƒ¼EG)v¹~Çê,ŸA›˜7\pJS뱑{@3ª„U¡êÁÃùœÛƒ{9Ÿp2Z™¢°ƒì³#ÌjpyS¶‡ÜcÅŸ‹° Y“’µ¢7çà;‚%˜j-“q ‚ÙÎÝp#"k¢Ã×ö.–?Ý9‡8"PXùÕÞîL%¢×c©žs4¶Aˆú³éVìCFnÈX´·.!ò,bEÙ4k¸ä”íª ,xùhÂgÿVòM”÷'’|'ÌÆÎ ® ªö–=Ù£qJ¤ý–Þc‰k¯8ï-nQžpb‡ò½– $fŽïܼÎ:|72Òà‚›ÚP.ÀZh–N~Ë4˜oå.$>.Ÿl¬¨ò0.z0Š#ŠÁ‘Þ,yŸ––fØn!s¡ ;A¡8¨2b‡ÚòT»Î»P÷t5«ß¤âl) i Vé‡XS¸4¸½ºRí&Æ}ý €Ý™SÒËêÅÐ\¹p>¡Ÿû°”fbRpêàW† a¢À†·~ý}Ñ{>ÇÃ̬€šŠyI>»ÑXù`ŒµsVª¶I´½i JèaZzSäŽÉ«Hél¥£8àXO ŠúµÈ#*û`®tm‡e–Æ›¦Ò:Ñiê2C7~:ŠüSæaáGàZwI‰™“:WšÕ`D£EVu\6á³ÿÿC?ÒC3 ÄÊ×°gghE+¯ú êáôXŠ¡XeKC ›’êMl:—y¦ÈNêʼšþd,aÏ1%ïˆ~Ý„æe/Û?>ë\nßNeÃuâí4[ô¸ÜpC¼¹µ$ðϱƒ.[™l¼nT»›„ÇÄåW(sr…ðí#Š¶M§à8„…ÓÃ÷?…éΕ†ˆ 4¨½~\xÊ’pgdfá:«½Q•³5`b/a±Ê»*ïÓÅû˜zåÙž V+ÙÖãY«4x䵤–ô¾–ªš;VñZ+&ŠU͸±¢ü‘è¤Cñ-ãÞÑ®5–!çÜð†È$yƧƽ¶ûÿ2PÀq;’†s6?A8™^SK&ÿ^xåù‹å¤¹cúø™q«± ÕØa±U” «½âµ è(wèØ1ÀÁpº^•Ó)m¤P ›ÃÛ+ãTc®½øO‚vS‘c3f"?JOñ‘F ;•—iu ™;ýG{ðÎè8Bi–¾K5¡CÎ QáÓÀS…²‹[Ú÷oOgŠgš´èajÿÿí½«òw„s*ba%ùo!ò¹ìúÌ~OèÌ\·[„p¡¾P ÷ª7Ó‰X”Q {U\A{‰;ëfílü[{ý'ש?¨¦cÙ½ñöVÞyp-ÂmAðé!Zd! “v“ïˆF _eâfë(|ã½V}¹È™|·‚–/Ø`D¦ªåsÄ?"M…½c}bÀØêßEÓ@|„þ +ÌÑ`éÜlKd†yíÕÓ2lwÝ…èƒíuŒÃÒѺ'ˆ þñmÓ¢ƒK£)ÿBkÌäþ‹f}uŸÇný9Çù@®‹˜’ÚRbq‚y‘+.±œð3ï+Yä üÁj´-|6«XÆ¡ âѤ}F}Öêý:ÝÇØud«âô쩤ò—*Æ ÞS\gÑ¿ø—bFìëI¤S!!7°hLJ;¨&ÓýŸÏ­åîÅôp ¾0œ œ[¸Þ¼%’è2í}'èœKínDFûV ÄŸ|»s¢kÇkåg6SåùÙT‰9«Bóx!§Ã »ÃÒø«"©ŠóÇ·ªË]\à—y‹©¢x»W¢ýi*ZóPb{»¶=ÂDgÔ@¹aÕ”…É&Ëú X|ô ÷Iú­0”üúžfá©\Ïqç%7’Qx¼Ž¤;V.§˜éÖ£æÿÓšGõgæØÎHÍ](Nóž{ë9pF1œjÈ:75á]\]K±UØ<‚LôºãÐ\ ’¸>-'ãX¥ÿ5^¿fŠX" eq|>5°¹÷ %ÕƒhÌ0ÉÅ 2~\ìgc’ãˆÀ“>À·…%'õÍï9@-;­1âù‚ùc–r9—¯¡mH]ï…–ÑtÑXrµ'&Åm¢ ⦹Q…òYJÅúW¶¡E²¨ý»ÚèÆ܆ÊíÅÙÒÖ‰Ÿ#hkV,+®ƒ¯ØÏ» í°wºe¬·¹«}†’/\§©…ë¿•kÆÞÐëËsƒyºRjÏúì ÐcÏJwŽu¯>zá)?'XØÂ-¨Îô²«P<Å%^UŠǹK š´9>'èL¢O43h>{"hfµ!jÒáÞ©N@H® Xz3Úúd‹Àòñ]r;êõÓOû!TN¯\*ÿ®ÔèHäƒ9áuVàÅA»é†]bwç0QAJBÝj*UCf]>7ZÑö°»kßÎdˆ ¤Á*iØQ™7ˆÈŽ’ļQe•ñƒÑ |[?Ú”µ»| *­°eI×ûv•9q¶N¡¥¬ÛKD ØTÛÜÊÈQ¿‡ÿDœÅµÂn·’QI´oý@²M¦ ‘6æ;¨·v,5ºÍ~ß$ öWGtÑ£KDRôáÖ´îúGK(vxWÍPsJððƒáÑ×@(ÁSýêV3­¹%œüßPCÎÈoy˜Üú»mr…'sšKŠ7 Yõc\¹]ÛfyH6ƒ^J“ì¸E³²dçá% ´õFØí»à>FŠêvYêž5P2¾­?®ÇÉ™òc÷˜M\#}ëXFXÜÃïR›’‚fÄì.'+²欂A¡w³Î s?‰úɼ´UQúpËè&°ÿ¶½Ãõ“3€½¥úÔm0Ô£r=LžÉj˜4èO¯6Ï-„¼÷Skp¢¦.WªZÉÙ."wô=ÑofÂM1-KMjXÑ;ZyOãÆI¯=IÍWN@#¥Ñ¶ìÀ»ÙÍNN¨šÎzÌóÐèA3èe(WÖÄdæ­T2ä¨Ú|šïEtynÑ]£%+ž«€Òà;Ž*±¼+”{§µˆ±¥LWÈNÍÄIÎÜxOËuý¥ÖĪ@"¯q=X;™ê÷fܦ û/Gߟ°31e'fZäËý­hæŒî /|×þØ&2”`*`œ¡ëKaíÌÎrCLÃêK4óÊ$-_NüMŸé}¿ðwÌ\˜+Ê ¿TnÈÀÒM+’"›Ðl­/J,£RƒeòrÈ沫Ft#OÒ–Û5ƒÖ?R«6(„ 6ðï"UÔûÚy¨³Ê–±?b£ÍL¦ë¯J£][æÙXW¦ÄøÓqV¡4‰×ÒÝó´›,P¡Ýz§+|¶‰“ÞÙqÜ,w[ý¶×íÑqã3¹f³3&UëO[Ë2Фi•%|\©Ã¹5]ò~ ǘÁ ÿ5£=çªLX¿S!SñßÓšæN<ÜYó¦ð±mXÝ«œÚDI6Ó˜9 {yRB…2ùR)fúÐ¥ºt5£Q/LMTþI4âž–j"»œÈœÔk¨µ'¶Žâ±ÅU¥éäåΡÐk™æUåö|ûÚba³ˆÜÌÁdÚá=/ÍSøŸwŒá_Yœš§* 2õ‘/fàl©P/š¹kœÎÞe¶>}`†ñ¥¾ÚÉ›hòén–ö‰nÚnašXüÔx­ ¥ÛkË1{'ø•¶Á0îVJ›Ï1 Pe]W`§€A¬VCUžsËä–òù¬ˆ p[òïÆð¢$[bE*·u0¦ÏµrÙ3SÌÃ4u°9.‹UP!¦]W‰Ò‡Y¶¥ï^_”&r&qyÐûF[£QÝ·>0rùŽ‡˜ª&}2n²8ôŒû)^Ç´ðé.qlaHí…Ù—–Vüô×Ç¡ücã½|º÷òü‚~MòXÿaóhŸ’£ø¨ŠíóU¿=IñÞ¿8çÂÍò±¾a_Œøìß•mò蟒®ù4OÍ¢>ZŸ?U[úš°¾ß©¿õYgäö=}VÞý¶gínûíß±ïöµ~ÛQ‘ˆ@a„X%990ÂXœX¸j Ë!î(ô;añº Y”jP6¾®ýD¤ lÌ¿§ï{Ç4â©+:ªÊÈ=iu[æ[5Dꄨ¹}è^áwù˜ìo'ÝK–ÉÚ}3äÌ#.ö6B\šŸ@|FigòÂÒT^Ðbî ˜i šÃâmz¿c”oWÍ,µ®¥Î¯šV%:…Â÷SÍØÄçÁ—DgümÙ"ÛN8„åKò eoyzKdÝ™. eàÇEþÖ!eÚ—@¸º®ƒ«ÅL\ú-ßû3žPf| Ž¬]²…Ñ_/Seît-¬Ür#I^Sú?i“ðôU™Gf 8¡˜·Î÷¶ 8°¦åGÐ%“ý¸l›nËuqB#“ba§ÎeM# ).£'ìà–¼sE«AýÁmŽÎwa­›~ˆ|)££sWôÉA0âIKX¹V&VåœA!B×Eò%¬,qî|½PöAMÌnV²6Îœi@,“(§:ÈĦ¬>¾ÊøìóJÖV¼&´`i%` IìG£Çß ëYO XJŸc­R„&Þ{¸´ª9ËÙXÚTLW'h 4òü ü÷*È‘©õCLŽV7ZÑk‡%Ê4ŸÃÕ/cß°À¦%,D|OÏ -¼ê/Åtç)Yu7+#‚Ì  6DßÇ)Ö=?+¹¿Ï™'”È¿ŒèZ ÿ}o¡‘ò[Vˆ¶é¹£÷ÖÆñgX tU’ä·lð«×ýNU9q_Ze$StùÀoN)ÊdÙa‹éR0“×n”µnvÇȸŒGøŒ/²nVÂ¥PeâÍmWø•¤Ú£èu9PÅÆä«V½¡@òÂá @¡óŽ£t‘‘.´šáš‹Ð®ãq&‹j‡¦•w“†Èðb91¬¼jb;üöìÓno4û§œOáÃßJ‚£L±ã´4ØUéÅv;Šà_®hÕ wºq¡/²ÐÐHrHÆï(otÛ«-ÙL°6Û;%ãÞnzYÿmîË-piDt°j¿€ŠÓ¯•¤µˆEóîNÉôxþ£ã\¯ªX ö¡–çlA&BViLÙ'8ÿ¡¿Êç4ïÂó™¯&uˆ%îSš¹ ½:Ä<QffÏÎdï4×øìv¼‚¹¡(áVl!Ãä'êKÍhPû+/]#w%ÏŠ´ñ½²ãƒ‘™Œ‚G ¯Ãï‹W/ÐQ.c-îãÿ_Ñ¥ÌÔ4Öµ”œl’òó§¤éa§ŠçÈižÏ*´LSL6ù%*àcub‡r­¦[AxÔJBꨰ)½?VÕ§b–Eöвøße”¸Ö·˜T€Â˜Jƒ&'{Šý™ÅíYØXNFwb8À–×øÚ$s®í†‰ÃJL1¦m7µ$[þçõ /»Hþ±#þ RÙ Ò‚Gìê胉AÚ³OffÞv¡eÞž“Ox-ûs—ðèp } KgQ#p6glZuf¤ãfQ 2_¹u] R®>×Ø+´ÈÿUÌ¿Ær¾OVÔL¾k7kgå"‡”gv¢xj\h¢¸öé/L¦tw(*÷ÏÂ)×É)jRº| £ £<½G®(9žÛ"‰þ¸„pÁØðË3¹;UÎG`—_®>%«UJ»,Vm߸#‡Y¿“”J:×KçåžAÕÍ“ÅMzRš†f.8¾c§oò¼pÏïäGg£hküI®CöÙ§Jà^_¸ùíáy÷,ˆø3ë°D{û¯ÐQõCÀ¿ýO\Ó†¼Ú8kM=VÛ=Öžòe^w”†ÜY3pʹ.ìOŸäÒÿD+ž+%ìßÚÑ×Þ Yùwû¶.•1°½…ø_…ø_…ø_c°®ÇNM5†ïÆÁ>m¨·JŸ"9 À÷6ˆ]ÒýìGIn)×¢ÿèzKl^‰åŽ¾èT“3Z>±Ð£Aÿ5q4å{Šµ”¨¸ A»‚ëA|yÈÕ hOúõ§)ö€Hãs”Ö‹$@×Rô=BÑÎÛ0«%,À½…ø_…ø_…+‘± á®–¢†´j±Ïua‚AK/yðH~¢<®ýºCË›_{lZ,D€-<ç+›'eKèÆÌ¡-¦(†ÂÛðX’ŽÚa“DqèÂéœ×â òñ* Ï>ªÛúDæ9|oŽ)[”ç¼Í’ÀƒÎ:ãh.Ìsa侌\öäÍêØF*„!mTBpb9k–!^¡Ñg’øq’2_©®ú f†hËdç°t¨ ¤±ÈXKŒw¿›·Ž2z—ú—ò¤&œÌM "EÏÐä°_?6b©Áfx3Y¡Dxÿ(-5Ï°S²’Ú—ÚŠ C™ôGï“ïóaÊZi½£Áíë#*„.Ù\¤Þ5vÀ-xîó $—Øs-ATsÁrÁ¨è –FÖc®Dæ[½ÍdN•ê]Úƒ,b›M›bÔFäx”¨`'w…º“↟ *w™bÔ¨ÚœÊà‚¨â\ð0â7ð÷:o¹ÅÀ¬ì­ªVEQôØ–ö)_Ç%€¤ÄÄw6IPðÃPÙÿyaC™”ûÿ€9 öCLÏP .}“ê2ŽV„ñ›­}Å{¨s•b ÀRþ¬ Y+Æ–€µº¦&CLjè›wxP³ó’˜LÔý-Œª »ÎŽr9?Û|nWö:ÝîfubTòœé,­ÎLu)r49£Ú¨ñ×ÅtˆäKCú'Ç=Z÷àøÚá­íM¿“Iß®AQØJz€‹xÎä‰qÕ7Gn)¯œIy¤¬sÃãì6a¤Z¬ ¹$’I$’I$’I$’I$’I-¸IÕ‘RŽ¹YÄU±—÷ø6áXPÒP"h:Íîæ²P8}frC„n§ÓOÿŸõ§!þšýuÃëU»ÉÌ-T5¯­Jt{ñYWr‚ý ô:Î-éq~Çn÷±üÁl,]=_(Ãq4ˆ¯pŠ IÝ¡…x¾|"ª a£Aî ÛëSÃ~ /ºPßhÊ)î?|lÆi2æG–üˆG¬^¹ÜkÑ#QcJS8MV¥—ÓV1œèÖèMäéÖ<ÌØJ8e붂MC¡£ã¶fº£ñ†˜•;Æþ¢sXlS&X.ÊÕGªÿeóýFŠçD"'\a«·ƒòº|uGG@…È6"÷;G[J”¥)JR”¥)JR”²ˆF¸ÚH:ÝY‰ŸúcVúS6‰tJO„…9ß½ž!p? B‘\„ñq3e‘x·$’I$’I$’I$’I$’I$†‹ÉÊÕ¦ó˜ÁO.m°–7ºm+ûÝPôÔ[²v?€–ÄÔLsܲ4ØÙsLÅ;” ~ý q¿Ùw8 WJçëRp¼CÇ®ç´Ñ¢ù¬›°“Ux$Ž>âŒÈ“MźPÏ÷¾1wt <è6ofê!XÄñÙqw¬ð¦Ù÷¬©Ê’~¥ Of ÿ¯¹2O*ŠÛýã†Bzi ìî³½¥ü‚Æ’…Q:—•ïãYÎ0Pîš´l rS=»GºâXÊ<÷áÚ ß£Á?‹šjY®¨†Ø=œX fTUàù«ÌG7aÜ|[xÄXh7ªÐtˆPìE63ÕðC.Ž%7eº¶ªÊI\·ïÀ±þ®WiÆ2ëÛ¹ºÞué¦@±õ  m`9loÀ3“¿%(8O ÔzYε 1}/üí’•ˆQñæÍè”za¡à:Mlܲ·×€q[°oé€LšÄuRüÈ~QC WÞŒñáSGøžý÷$Òq±¹Íð‹^šÚf['‚;Y_àâ¯^H·‘˜C8m `º¿´M^É0'¹dEäq{DM_äèêu9÷á%+~Õ¸VQ?O7h?ÿÿú¿8a]êkDueœ4³r+¦ØX¿ÏË^wWœ¥ÒYí8æÉ-›$’I$’I$’I$’I$’I$’I<Úwé³H-",@¿eÑô«CËÓX~ÕŽÿF)äí8tVB<“~C*ñ˜Ž:ÄW.pÃ%0ÔQø [ººQòçú£|TtÒ±Æ܆2‹;×[6Ãáã¼-ÚäóÎäù¾æų{Ã*Zw…llÉÅæ{“áh»sûψþ^©GYsB\¯IYî]‰\#m‡Y-2\6Á[¤wKäì2ædŒ—ZàÒ´n”“` fU3”³û¨Ô½ºE¬ãÚ,mMOAT  ë5…àÝñž¤Í²Å­&2©‡ìØ#ꆕÂÍ#ôrì³6H½ÙM x/°À4ÂÓ¦!ÀæJsEè$ºæÒ!–KíÍ¿‰à¨i Dõé‡\ï®™¬«+·„ *ÊN5ÉD!4¬«7 =3H.r}- ^rjßcO¬¶Îj˜©ëG,î,ºh–„ýÃàkÉà¡¢ ù,I{–È"$:”*ê]ù£VÍU„BÛÒr¾6£‡&WJ—í&µeË+'»·>ž: ˆ{Y}}_Y(Ÿ§üñaQ íæûôùÔD”.Êë=¹/m½x‚GÓpJ®uÜÓG‰0|D `ÕÞÂS§ýÒK©­ä¹SÎ ÄB/Âǯg¨§1É6]i˜±Ñð S¶XÜ÷£2#ÀGâšüFŸ1u¥c"½eéaþ‘š bqâtÐ(ÛTàÏ£1Û]Ì3")r¡ÜökîQbqfWñkº soÎ\é;x¦« z˜ë«Rd)3}RH\_â–¤£w{©«£z@’OƒµhPÊÜq“¢ϸÆŠèªa‰¹bOç¨l2îâÿUÄóqWÿ<«€J9ØÁjgCÞÌv-†Cº¢þà| ‡† îb iL)±qRm?vÚ8Hâ==ÒÁ’$ÂAMñší ‰Ô¥®Ûé7ß,NËÕÇÖü#þS¯–0ö¿ƒžºsö£ ðµéG(BBíô¸ÔòªdO!Y–'Þ¶Õ$‡÷„íÏŒ­_ôª€òh Ê;hÛYHMȱ¾*s´°ßøfeê‹m4fLã˜Öí‚)Ð\*2úkžÉ¥«ÙYŠ€æ²-pI€ùQ´ê“üÊOx´sàŠ“ÛõtÎÐØI[Ç’BÎ?2¹v`ž}8Ã]TÕ­žÀPxp‡&³#B¤rl7ýzzø ^&""Ò â¯Ðgò¶Äx[CKŠJ®©:gœì/ü9¥ÉÁÆ2•A\}L@^¿í›•~“}Ê6Œrš?9}\Ò®­’Æ]‚1%¦ÇR¯ ° úÕúTþˆßÙè‚F‰¦kfäÉYë°‚Ž™ËìN e(L¸»K ÈÆ7÷WU Û‹Žk×JàÎbÂ[í¢(ãȇ½B¨"ß,Ù¡~;y2Òg%1ðmþ|]8w5HÑ‚»}í =Ì_®èR»C¬¬IGú¸‚Šq¢Ž xæ bZËGñMÆ ýÄä‚‹|€ Y3Ï~oÓZ˧‘‘μڬ61z t83&Ø¿9‰ âuÿ_„úõ‚©Â²ÖPàè‚4“з_ ×~ŒØ(˜z¢¸‡PK>íÓ0¨>m ¢¼Gø–ËAU[=Éœl™ø•¾-JÞy„8p%ü[‚îÄÁN›­V1”ËÍ5Å’Á’†…‡HØKj›+"03âùT)N÷`wL5b¡€$Ù#èðËÃçAº Èe:чíªlTq «‡e~n͆6‰²gº^Ý°–§QcY­Q òG;c¥‹–êgÚ¨Ž®¤°q‹š§3AÖŽöÞ=ïkÕéÄçDz#ÖŽyí•'I¬VÌj®Ó¯: ôY:ÀÀ˜ƒ±r£.ÛÐ"i„QåÊÕ}¸“J¥Zªu“L¤ë]Ñð%DÓ‰’|‘ðšQƒÛC7s OapìQ‡Òw¡¿úDðë !Ãã)†•éºÙ¹Ÿ©+ߢh>¢„B‰)œDš#á[A)òCesê†Ò{l©ÏÑ‚Ö˜ ¢i8RÞ†w¤L¥ònC1UÂx¹ˆ>=gˆè)ÿº= !¤e |ѶÿY°Z$b,¯ãQ†&‰Rë7±=|ø„lˆ+ÞIËŽô¾ ßc[Ž |z‡Q키<Õ2ns(>°M1 ñ÷pû ÏPrÅlæìÄ.¸ÿ!§Ä~Ö¸T¡×5Í“KLš/×¼¥›.`ÔèÏó$˜S)£¯ƒwÖFùhò꼿GQ!ÍÓÀ†n(©¡ÖL; ßû˜e³@\wÉtìK­ŽÂ¦ª=D©p¦ ®k÷²ÞéÒá^ŒvŠÇW1]8/£«Ùs톾©¯õ•C®,ù9‚@NncŽýù¥´lW¸µœE'$ãçöýXCõ—Ø'ÎS7[,1œÂwüGÐøèà+»±€üAáŽ|:S<‹ØY{¥+ ™æ»Ÿºç錕Y&€Á¤wKÁ\v`¤’ÈuÄ6ƒ±AXûpëc*áH ‰¢hhZQ¼JÿKò2,Ÿ¶`13ŒÝ:ä‹Q¬Ð¤ÖûÔ½cnã¹ð/ÔòYÕí¶ó÷LI³ä9à>»q´]sÖ«Aåر©ˆ ‹=3w¼¯þ2ŠøQêÄB¤}Ɇ©zèi°?ÉeyùË X–ñ¸å§àÔÞù4¦çËÌÂ%=I±n÷ÚìêÈÛxê3À™…Ô‡¤b,á"õjçzZFAã(í&½êüUUœ®Tvïñy´îwN¥Â2ÓáùPÃùq½T–/èÁ§œÑ“¿ãÇ6ŠèzÒÔRù_¿°ŒÊVãUŠ¬­‚ƒ†üÜÁ^Ý“ŒÒiæó œÂüFﳉ†ÇmÊqÕñˆ¢Û*æ¸ëåtìë­*¿‹†§å©wfÚk5.Üæ& Q®û+ÔŠÕ]ŒM}þetg äp÷±Óò&ö»íHï ãdPº•@RÖÛotË";4BžvžJcq#gï‘KÆdô£†ÕߧKµ27nCÛðþVÎ¥&D½ßI;£ü–Þ d§áa­'㛼,ÕþÝ2FÞjöé†ÖÔi‹áìvD«MaYÝôBJÊI®*3wa9ªŸÆm}ãÍüòF”XÒv.)ظÀLòÏ-ö;ÿ€ýü¬Á>;âîƒ Ý`•ß–Egg0¨b⌇}à[nmjZ6¼/@ÆHæÛÓk£H§2ªûZçÂC©|Xòò*Ç¿æ òÂåÁŠAŒT¾J ³qL¤3T,ÍTŽŸýÁUÉ2ƒÈuòj ²Þ5À³dÖÅ kafŸ· yF“ Ì{2mÊäNð{p*5l2ìÆüTGÁ^øª?áÐ Mðè߆ÇðíÿI|4ÇÁµü7O‚ÉðïŸ ðèÿC¡>ŸÃ~øv߆®ø4—Áaøk?1ðê?‡wøß á·ü:7ç®~{¯ÑgùµwÏyùí_›a}¿šÁók›T|÷›OýšÁóë[qè'p°tcb9ì¬3s·êº•˜Aœz˜Ø-TlÒlä…ƒ+.Vñ†‚^gÚS”§ÁuÌi#ÐÐÑ’Ïœqív“¤ˆ`ÊàB2ÏÖËq‚gbJçv°{ñöˆ”ܹIRÑ<±nÅs.óqÕø„çÆRîozÃ}?qì³ØÑu9MÕöÕ2žx»“¸ ÖJ&¼fÆ»ýœ»zÛl¡šq­JsMC8t¤Õ <²t|›¢ÐÎ?f¤{­Ã4e8MôiÞÏ–Q4ï Ê¶›h£Î¿ª’Ô³ ¤/›²8lgßEÍ?'̵æôg:¼-7ºë]‹VC“…p¾º—\EÚ+%‡Râ\G«.…›#YÀ‹ÿi†;™æW#¢~S ó ‘OÆ Är‰4Ïþé·[.|„T”x°M ³žîƒC](<6\£r¢¿º€ð… 7Ù3¦>éËõA7ã&õäÚ "åë^$j㕳ϱƛjë=xœœÈ„#òåBê.§Cië×┽ªbÙH­{XÖŠ¿öTÖ¶™rQ4¥68hÙæNëѱڎ­^×î…ÿd$Y.Œ ÷XRTä%+&Ø|Ť÷ð·i|2×ãcKœ˜ïž;uƒQPyˈÎ5$i ¢ÏBr„õWó!6Á]ˆAogÚ ûDo÷$QÆÀ?¢ÂáÐtW¨'ߣ·`XbË/Y¶VßOÛštÖò{ÕˆL]Ãb=…O¶Aüê“>ÜÙnÇIOÙpqó9$n|Í}›ÝZ,Þ¾-m€È̱<ê¼ ¡#O "ìà]ŠË¶eh´3+^ix§or·mWmŸõÃTØÈù0Û›ï,z³?gFœ`ö¶~è¤ÿ'µ@~Ýe“Í‚O,ŽO—ÏQa¨e }tß4ö±‹Ÿ¹<çñïvªérc„šÓº¢‹vIC:ÚrJ³[²Á³ǘp<º SÐŒVâ¹›íw ’ÃËz^v>DcfÕ‰ÓlpªHøÆ¢EÕŪ#ânƒ¡0œ©6ø]|)†ZC­ËU&§ˆPi¡qÁ3 ¨b‰ÄsèdÙÒ«½èØSꘗ‚%+Í~7v€´…17§çjO^cQæ5­qY‚I¯àl@'–‚y‹ÞÂ*Aä_ZÄÚ¦;‡Ûøže–ÂA1’ð__yâò4 E$ û«bþ_4úõ_“x †Õë˜x(·ŸúÔ{^týúÛŒäó_³M³Ú¶Ê–}n SH9¥£½>¼yøð-{÷¸Y¤:=ú…$æ`¡WµöÌ#§$´|‹¢oñOS)0ï @n‚a1¢Ò î(Géàªyš&”W9×"Ún\XŸà”áב<¾i)c$Pð¡*Ã{eÌ“"f™“—‡zþÒ Úù‘¢£”ó)þ†183˜€ ¨\\þA›ÒveÌvðG¶½4ûelÚ&­ä*qÂZÓMlçIÛ\Õ>a m¹ ¶açŽsƒ£ª²b—8õ®üxïñb†%g‡ºg{ÊÂ3Z„5Íò½=ö‘dPË%b™%\锵߂0*¤lHpùb‚¡/’¬Ëˆ‹™ÃMQ91ä:½Ì‹$„‹KŽK˜gàšÏDÆX€pÏX³‚J^qJ”¾±uÛ†E¿³Ú¶:¹åJ0pÁíC]j’Þd¸×°YÒH¶ÈNúi#™>ak™Ôð¹ÀkÐ*lçk1Ã1M’&©›v>®Gþ$fËæ—8ñÄJû¬0™(÷ž+³”Ût ÕúžŠ|}ñ˜Qãü[¡6(o÷Ð]ØæÁ%5’4—ÎÅ«ƒR¹•[Éë¿ÂÛú¨¡Úc-~rÝå‰Íˆ¢·ï—E2•Æˆ›»ðd!Üg—%¥ß4¦mpßGFôkW·6L‘1 á&Û`ØXλîEqZ—X9òâP Ïjd¼˜Š$4ê…iþ¦± ÆÅîoè¶ ,!MÕcáó×b”-†"_¶p" ‘膊$CÉíó—× ùih ]CcXÕcôHÛÃðß]Ì›üÇoƒÕŽ§éa]»ŠØGY(Ð#ØZgçÅ`%Ì>ø‡])ò0Ú?Û&°(óÔÙqÿÿ|úV==•ß7J¬ÅTH<Cn±+Àû. f ™:Ø>ßâÀ3±ý»Û„wÍ•iUF‘—lš „ÑkÈ ÙG¬>u˜´î)d–(àWpØ>£|;…aÇ"Ⱥ¯Nm¯…\Õx|lUˆUͯµEwE«J÷‘ŠÃ°<"¶†Wè yZc!'þËÆA €ý,8µVg8[(xP…³5ä,TñëÁo‡ý¯U¢ÊnWSº,Û  P© Àc‡“VˤQyèüh‡•Ù‚÷š$ÝZ°…2ßmt†Ðš»àžGXð<Ôêu`ø  O˜ù"â  ìŒ@AÂî½ÃÜRSb¸ÍYuÜ7éüÏkí (lÏþ±‘e5ž¥Ë^úVß&KâÚ;^œ\¯w^Pø“'ø?ÿöŽ š«¦Äü ±èÄPM{Ës 6¢2.Ž1ÞâèØoeð?‡Ú؉Í>4æü,Ëd#÷—Èé ¬î¼¤(8Õ½ Ãm–ÿ‘6¶mTÁƒzã+Ù áø0XŒ›„'fÍÛnîæT׳FŒù“¾õõ¡äfW!=Á6L&(2‹_Ü^Ž'’Uƒ@>Ó…¦.-ÞH£íð+«?h§ dŠu%÷ð„®ŒŸÓ¨ƒÍ9(ôBÇz®ABosä¹>¤±MNìЃ‰¼t&ÿ†© SûêLOÆÖ‘CúÄáoö ·]ˆ&R‘@K¤}»oÂ4K¾£ëøçÞ¥æ. ¤>±ªç¶6:[}Å ª±€ºDýô.A´åÿ/d?!Èí\»u V±Žµt ŸR0*¤WníÛùO®âO#?2FPi¿ûìÙ(æ)ËÊHí¹œBsJ^H(ßœ*­èGƒòYl½3B¨è+¯R©Cr–AT1Ã…s ,àu¡+~Ã$U½Š·èKˆ?*ÒÆšá˜æá( )LšŠEħµç> ˆ6Õþ¨Ul©8I(>¨yèBë¡×ö|ªà,;z7g/-‚ðtd«`c”§´d#ðÍ]û‚¶"#R<¾È?Üle!£¶¾'®,‡_™Ú7õÖì­`Ÿ¦EiïÑ»†‡Ù†ñ€©¨èhRÐòBÉä”$ I»Êo¯P5hD}9îœî†Ý6ÙðVâ=9­Ãï>ñ"¸ Þ"ã-K¾Ç–jòùÚÈÌOÊ\v]“ˆx¦ü ~EŠ3Ýnd(Ö”L¡ïdô…Ç)7cÄ ª§[Y?ìšê»=83¬[Fgbü(”ÿ3yYAoüº—˜ vo>üOØÁe2‰íðDn.¶”_¦ýÌf¶ôy5Èß®ûñøÇÔ¬™!_?Ä6èƒ pîl€¾]y¯Ù^ETvK¤—|¹(h”yÅÉä Ž 0ý È!_ìú1ç™›J Íb˜Œè¦Ûh£Œ{¾,S8 ;žð0BZpLK ±ì|Ÿê6!CïDE~,¼þ ¯g悽iSºiÆ.Q1 ø à>þìv® € Ø4fž q›Ò»i¡e F‘P“»T®ò~ËßS_ìãؽH­håÖ¼Å2äc2CO#Yˆ¶zD [¶&Bäçk8^F©0ÐÁŒ¤Û À;`@KhëòãŶl»ÅµèåZ–P,¾˜|ÂK¬¬^Š¦ôÏ%÷‡ƒ'º¯ÿ–7_ˆ–I®ŒóÈÍüœÚÍ ð~|„|'”d-ý„‘ÑûÊý"ªE˜pmóÉcÏðö¬—Ìnûõtâ/Ñis&槇áÐtPë× ç.ÞÚv†¹‘ÙDÝØ]û²ª,vÊÇ8Þúèþ‚b6y^˜êé”$gº`w͇PSdnÃäØÆ–YŽß¢ºµk|ÀË=Xbuâe²›Þaax÷š/W‹Èö'ðùè[pßaú›±§ˆ$Z) ŽÞV3 }¯ü³ã–H+$+àOGÞ!Cjº@±6ˆ•6èm¨Ô$'͘†’“Å ,QÕkœâBî‹<@ñ5|DÄ "q#7ÀY½¼ öŠQ£>Ljc°‚yÅsNR±ðÜCÕ@Y1)åÃ|ŸJx:çiö øXèÆ©öcèd\Ü:w$ÉpY`¿Çä°<Ú¤wËÖäm¹L˜‹ÿdˆWß¼$ä®ËVås‰…:̧¤ÛÚGh¬0£¬n¨‚,Ë’½DJ¹ÖN9]ð›õáË(¥PÕ•«Gq6h¹…bâ¬v‹_©dÌyÖH#î˜sÑ"2¤¸öv¬ÂZh…Í· ˜¾-c£·áÓLnÛ#4襹‘îôN)þ^)Lƒ¨^ À…ˆVdˆáÚSñ° WÞÙz}©öÆV6˜K7ƒfé%nt{O7ZdŒ°ª $:£eÄÑJË"¦Oú˜Ö±"¸®þd›®G/þnÝq;é^b=˜•8ÙrWjNÄ=#ÀGî L&‡\ÜèÂâOŽUâPÕÓrµƒ dÞoÆèt®x$¥|ýÅèó '…M@Z,¸æçڳ갧ɇæÁ‘®@¨XÃæ!»‚˜ËÙäŸ)®¯|nÛ†w5è‚“©é¶ƒ…š0›^Ké¬|\ýíe©âǦóv¡çëȳà¤N·ã†a4×Fp+‚)äý“Ø«Ž•˜~H¾• væž·ê߶C¡†hõˆæ*Å¡Ÿ@fY€ˆ¬Æü«ò˜¥%”,ih´ÏD¢Ϋ>ä¾â«.¦)öà®ËDêˆËÖ;KÝ¥îhòÃÞÐ¢ä’ Ù´­•v$Þ­þ—ÔZÂF&ﶎfÆÙÓ5¤ 2Æe™õØàà}‹íNÒ3ELÎ#kæá95yªGÞÔϬY‚kYÅÂï l ÛÉÞ!m¼ÑþÄ5Ã]\Šó}ÔÇEÓ§f¨7õ‹fÚ”Q¤ÉYœwÝCd…š¼K*m¦O™é“_Þq µ¨S %^ÏÚÚe6ø&ˆÖ;ÒøùŸ'œ)·çë_¿•-@ô2ôA«Hg`BLÕëÒó¢Wi`< 3äÌ1¿ÇŒ€ºÚog–1é|ýÝìx«ëÌ2ý{«.) tÉÙßVÌ„‚{ím4 ê#vx‹\û˜ÈíÓ—Ôð„Œ¤ì|Ê@  õGRSÛ•šX죷F:.#Ù¸‡À¸Ÿ”Ø°7.¾ð•imJ|Vÿ[šü"8_.wC¾bž­}Í ¾™}ôŒÒ‹OŠàGP*Qɬ³[Éìçáý®Z`‹y¦ëœ_E†eç¾îYO¢Ϛ3ØÔ¦· *r_h41Ù7¼pr¥5(¾¶;¸ÃaŒ¥Z w:7†33`•©ºuM`jƒ,¼Û½™Þ•&8°'Êø0ÍÖÐŽ²Â¼%~åx?éJôë¤Õ9Šî/ñyµêOèÝO©yý€7”¦³ò¸`zÔ°:y:CëLš|½S^š¼K:/î¸ÒkßHÜóô1cÝÌ%AãªuÅò& íþ’ŽP>"› ˜wÿAÖö×ä.Òæ7ûÜYUCˆ‡[¯8FÛP= ÎجûÚ€LÂëFð­ÝkìÚUJ¶w 0Ë ¢R}Ôòõ…puníÉqÄiù‹Ðr›|œÄ7N^Š ãI¿Ug}$éÄ ü´I·Ø8:»bKõsÀ ŽôVÖÐYksˆ=ùÌ ÉÑÅ} ¶ƒ®-;¢ò!rÄŒ4£f!œð¯U¡Óq£ÊálêP¢ÞÃÍu|èWÔǼMt‡_ËN!ĠʈLÚâ­Hñ:-–†áÝD¬5 ,"ÜKýÑ!0ÒDpåÉL}ÀÈÛFfD(³U“æÕæ2,œÄg—"Mq} lQ³]û‡!!ŽÉÍ*²ât-&pɹ ˜ì 6Ž¶å¬$›Ñ‘ˆØ8p¦¯”—™Å9êËòöSw6Ïg;)ßר3œ{’¤^ð8?ÞÇð­©^ðù.ó.P\÷oäèE2IW•Ê-°BÐÑ᯲ms…¼ÿÙsynergy-1.4.12-Source/src/gui/res/mac/Synergy.icns0000600000175000017500000114556311651662725021763 0ustar synergysynergyicnsËsTOC hics#Hics8is32Gs8mkICN#icl8il32Zl8mkit32Y.t8mk@ic08 ¶ic09ics#Hðø?üþ|>xxxx|>?þ?üøððø?üþ|>xxxx|>?þ?üøðics8¬úøVúüêþ€NN*OszýþxNNUVzžŸ¥ý¤xTV¬þþýz¥¥þþxxUþ¥¥¬«xxûý¥¥¥UUýžú‚RRý€yzüRv¦ýzyúþQS|ýþ¥žy¬û.RX‚ýþ¬€yyzô.RRQøyyszýûQ.'OsOúþþüúûýis32G’½ÌÖÊ°•ª„ ´œ¤²Å§wxgx‚ ă}¡ª’aH6C}€ÿŠn…¥ ™¸ª‰N%Gпtm™¯ ÿ…7.pœmw©ƒ ÌN!Xÿ©‰Ž¼ƒ ÿpKrÿ°Š½ƒ ÿmR€ÿ´™¡ƒ £SP·«Œˆ¼ådIp¨€ °µŽŠ£²’dMd“ÿ€ ª±¿¦¨—i[q’´‚ Ÿª¸ÃÍ«z‡™³…—£­¨›£ÿ‘’ÉØáÚÇ´¿„ ô¾Òà×»«˜¡‚ ס¹Â¼´¨¢z¢¤‘«· Žœ«škyÐÈ‘’¯ž ?¦}i—¯Œ—´ƒ Äa…½­¬Âƒ ™†š™ÈŻσ ™™©fÅǹŃ ĉ“°·ÈÁ»Ù唋®¸€ ½ÙýÉѹ¦•²µ¿€ ½ÝÓÍÏÀ¦ªÁ¹®‚ ²ÌßçÚË¿³ž…ªµ³«ž’’öùùÜÁ«ª„ ðøûÿÿÝ·§˜‚ ÿøÿÿêÒµ¡›}s™õÿÿÒ£„œ§“gqÐã÷ÿߌ  xdŽîÿÿ΃ Ä{]|ÑÕÍ̓ ™šfy17Žƒ f´¸½f‰0]ƒ Ê­º¿ÌS0ˆ岲ƾ€ ƒ>1Yu±º´µÌ¾Ÿ€ ÿ{B!.Z½ÆÈÖç‚ ÿ‡]@Y×Üʹž…³ˆ‡°­š’s8mk>‘¶¾¥\ ¡ýÿÿÿÿÿÎ9 ºÿÿÿìæüÿÿë7ŠÿÿÕV9®ÿÿÎ ïÿܤÿÿ[]ÿÿn#ñÿ¨€ÿù.ÉÿÉ~ÿù+ËÿÊYÿÿs'óÿ¨êÿç6 ±ÿÿS|ÿÿë}2!VÄÿÿà «ÿÿÿûóÿÿÿÝ)ˆðÿÿÿÿý³%%pœ¢ƒ=ICN#àüÿÿÿÀÿÿàÿÿðÿÿðþ?øðøàü?Àü?Àþ?€þ?€þ?€þ?€þ?€þ?€þ?Àþ?ÀüàüøøÿÿøÿÿðÿÿàÿÿÀÿÿ€ÿü€àüÿÿÿÀÿÿàÿÿðÿÿðþ?øðøàü?Àü?Àþ?€þ?€þ?€þ?€þ?€þ?€þ?Àþ?ÀüàüøøÿÿøÿÿðÿÿàÿÿÀÿÿ€ÿü€icl8ôþþýU÷÷+øVúüþ¬z***õõõö++OzûþN**NNN*+OtOOøz{¬þ€TTTTNNN**sžžžžzz{üþ€TxxxNNN*++Ostžž¥¥¥Ÿü€xxxxNNOVúúVtzž¥¥¥¬üTxxxNNVûýþ¬úVzž¥¥¥úþþyxxxTNùýüVz¥¥¥¥üüxxxxNVþüVž¥¥¥úþ€xxxxU¬z¥¥¥¥üþUxxxTúýù¥¥¥¥üTxxxTû¥¥¥¥úþûTxxxUýüz¥¥¥zþû÷øøPøþ¬øzzzøýûQRRRWþüyzzyUýüQS}}Rýûy¤žyVþ¬QRw}Rüúž¤žyVþþQRR}vWýz¤žyúúRRR}R‚úz¤žyOü¬-RRvwRüûz¤žysVþú-RRvvR‚þþzžžysOûýQ.RRRwRW‚¬þþ¬ûzyžyysOùþû-.RRRRRRRWùzyyyyyysOVýôû-..RRRRQ-+OyyyyssOV¬ûW-(..RR-÷sysssOOV¬¬ùQ-((('+OssOOVýþüúW--,+OOøV¬ô¬üúüýil32Z«Ÿœ¥¿• ¹»ÄÊÏͳ¤—°¶°»ÐØÛáâÍź~}ÁŒÿ¦¡³µ²¯¬½¹‚xƒ‘wf™ÿ‰Ú›“’Š†Š‘˜»¶T883-bÑáààÝϬ°ð¥‰zpd‡ÍÐƵ£˜¢ª ÿ¹Ÿ”——› ²˜ÿ¬l8mk ,y½ÔÝäçÕ¨e<°ôÿÿÿÿÿÿÿÿÿ熂öÿÿÿÿÿÿÿÿÿÿÿÿÿãU«ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüx ¯ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿw—ÿÿÿÿÿÿÿõή©°ÔÿÿÿÿÿÿÿûQRþÿÿÿÿÿôŒ, H¿ÿÿÿÿÿÿßØÿÿÿÿÿÏ8gôÿÿÿÿÿ[ÿÿÿÿÿ×[úÿÿÿÿæ±ÿÿÿÿüLšÿÿÿÿÿcíÿÿÿÿ³#íÿÿÿÿ­Lÿÿÿÿÿq§ÿÿÿÿØ kÿÿÿÿô+jÿÿÿÿísÿÿÿÿàOÿÿÿÿõ'tÿÿÿÿßQÿÿÿÿù.fÿÿÿÿô%rÿÿÿÿî?þÿÿÿÿh±ÿÿÿÿÛ ëÿÿÿÿÊ*ñÿÿÿÿ«¨ÿÿÿÿþp­ÿÿÿÿÿUMÿÿÿÿÿõ^„ÿÿÿÿÿÛÀÿÿÿÿÿö}œþÿÿÿÿÿq<öÿÿÿÿÿÿÖv7 8…åÿÿÿÿÿÿÇ|ÿÿÿÿÿÿÿÿþÜÍÛýÿÿÿÿÿÿÿí2 ŽÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïOûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäGRÖÿÿÿÿÿÿÿÿÿÿÿÿü°'oÊþÿÿÿÿÿÿÿò®E >uŸ±Â¨šd(it32Y.ÿÿÿÿÿÿ§¿åÜÕÔÐÊËËÈÈÿÁÁ»¾ÄÐÝßçÚãþÛÙÐÉÿ»ºº»¾¿Àº¶°¨ž¡£©´ÁÇ×éÿÜ$çÛÕÉ¿½À»¸µ²±´µ¸½ÁÆÁ¶©‘ˆ{|ƒ‘™¤´ÅÐäÿÕ*ÿÏÔËǽ°°²±·¾ÅËÓ×ÚÚÝàßßÝ×ÑÍŸ©›Ž‚zwy‡¢´ÂÎîÿÐÿàÏÁ¸®¬±´ÃÒÛâãæçè€êìíïðïëçäâÝÙÖÐÇ·™ˆxjlw‹¤¹ÉìÌ2¿ÝÙÅ»°©©®·ÆÐÙÞßßÝÞÞÛÛÜßâäçæãÝ×ÓÐÍÌÎÐÑÎÉ°‘{jbjz“§¸ÆÉç×ʺª¥£­»ÇÐÕÖÒÐÏЀÑ"ÓÓÔ×ÙÞàÝØÓÍÈÿ½»º»¿ÇƸ¯•}fW]q“«ÏÊÿÄÿÝŲ§¢ ª»ÅÊÍÎÍÌÊËÍÐÑ€Ð"ÏÑÔ×ÛßÚÔÊÁ¼¸··¸ºº¸³²´¸¹µ®šeSWf}¤ÂàÁ*ÿÔȺ§š˜¥¶¾ÁÃÄÄÃÄÄÆÆÇÊÌÍÍËÌÎÒÔÙàÛÕȾ¸³±±³³²¯«ªª­ª£•{^NQn¬¿Ú½?ÿÛ휕ž¬µ¹º»º»¼¾ÀÂÀÀÃÄÆÅÅÆÈËÐÓÚâÞÖÊÀ¹³¯¯­«¨¦££¢¡¢£¡Ÿž¡›ŠsTIZxš¹Õ¼5é˳‘ °´²±±²µµ¶¸º»º¼¿¿½¹¸¹¹¼ÁÈÍÎÉÀ°¢˜‘‘’•˜›šš™˜˜™–”€• ‘{[BC\¬Çé¸EÿÖƱ›’œ§­ª¨¬¯¯±²³´´²±°®ª¦¢ žŸ£ª´¹¹³¥{j_[\_bfo|ˆŽ‘“‘ŽŒŠ‰Œ‹zV>=O{¤Àà·Õ¦‘ˆ’›ž¡££¤¥§©§§¥¢žš–“€ŽŽ‘™¤±·¸°œ‚iTC=; ?FKS\hrz‚ƒ€€ oX@8Hiµ×´0ßDz¢Œˆš˜šŸŸž›–’Ž‰‡†ˆ‰‰Š‘“–Ÿª·ÀǾ©‹oXH@<;::9€78=DLYdmsstuqolZB9D_„­Êß±5¿Êµ™‚„—˜—–—˜—–‘Šƒ€€€„‡ŠŽ‘’“—š£¯¹ÅÒɲ”v^LD@?@A=:864€36<:97431/**/7CPW[[N;07LtŸ½Ò«RçÉ®“~|€‚„ƒ}wrrsvz~…‰Ž’–™œŸ¡¤¦§©«°¸ÃÌÒÔν¢‰r`TNHEECB@??><:8653/.,*+2=FOQK8-3FoÅþ©Tÿβ‹{yƒ„}unlmoux|„ˆŒ“˜š £¦ª­¯³·¼ÅÍÖÛÜ×ʶ¢Ž{mcZRMIHDAA@?>=;84121-)&'.8EPH5)2Hp¢Éÿ§VÏÊ´˜vsy€€xqjhlptz}…ˆ‹”šŸ¢¤¨­°µ¼ÀÂÅÇËÏÕØÙÖÎÁ³¨š†}rh`XPJEDCB@><9562,*'%')2?=865210.,*&$'/30*-7O…²Ü¢[ÿÝÁ¤„rpsrokhgijlqx~†‹“˜Ÿ¦®¸Æ̃{i[bn}Œ–›ž ¢ š’‡yj\Xdtƒ” ”{dTKC?==:8641..*))&&)-)),;\’¼Ý¡\Þ¢ˆtlonjhijlkmptz€„‰•œ¢©²·Áɽ”ƒk\n‡œ®­µÀÇÌÎÍÎÎÍËý´¨Ÿ–mdp‚£–zfTHB>=;97200-)'%#%''%%.?d–ÁâŸ^âÉ®Œxnikgddhkmnpsw}ƒˆ”›¡ªµ¾ÆÁ¡gk‡¢µºÉÑÔØâëëâÜççïÝèäÛÔÎƵ¨˜~kh‚“žw`OC@>97410-*('%##%$#'1Gs¥Ì¿)ÿÔ»›zljhgbdfhkmpsv{…‰—¡«ºÈä‰moŠ¥»ÌÖàôðÿ‹ëãÙͽ°¡‰rt‰–™ƒdQH?:7521.-+)'$%%€$(7Q„µÞ&ßé„phefebdgjlorvz„ˆŽ•¢®½Ç·’nm„¢¼ÎÙñÿÿ‘ÐÚÑÄ·¢€lo†œ“y\F@<5410-,*'%&%€$%,=^™Áÿ›#ÿɱ“xifdedcehknqvz~ƒˆŽ–¡¬ºÅ¥{m¤¸ÎÝÿ—ÿÝ×Ì·¡}kš”tXJ?8610..,(&%&%'0Fv©Òÿš!Û¼ ƒoeddeddhjlosw}‚†Œ• ¯½¼zv™·ËÔä›"âàÕÆ°”qs’u]H=62310.*'&&%'&##)6TŒ½ð™àǪ‹vi€dfdfiknquy†Š“ž­¾À›w„£ÀØïÿ"ÿéæÕ½˜rqˆ‘|^I;54110,(&%&'&"!%,ClœÈÿ–!ÿÿ϶š{mgdedfehjmorv{€ˆ›§¼¼’xŒ±ËÝÿ¢ïØÁ}o…“yXD95220-*'%&'($""$5Q€µá• ÿöçÉ©†rideddeejloqtw{€‰–£²¹›z·Öâ¦á͵v‰nOB8430-)&#%(*'"! )?a™Ï–óØ¿—xiede€dekmoqux~… ´»œ€–¸Ôî¨çÕ³‰tŒ‹iM<72/-*'%$%'%##"'5Ly·æ•ðƬˆoecdefebelnpquy€‰˜¯Á¦…“·ÕÿªæȪŠ˜Œ]A81/.+)'%€# %&$(-:_¢Ðÿ“ÿÕ¶›|icbcefebelnqqu{„£¶©†‘·×ÿ¬ÐDzˆƒ”xT>61.,*)&%%$%$#&)1Kˆ¹Ù“ßÇ­ufbbcegecflorrv~‰˜¬­Š’°Ïÿ®ðϧ~€ŠlI;2.,+*'&%$%$#%'-@q¦Éÿ’Ö¼¢†qe`acegedglortxƒ¤¯•Š«Éå¯ÿáÊ¢x„]B4/-,*'%%$%$#$$)7]‘¼ß‘ÿÕ¯“}mb_acdffehknrv|‰™°¤ˆžÃä±ÿؾ–ŽtM:1,-+(&%$$%$#$%/Lx©Ï‘ îΫˆvib`acd€f hkmrw€Ž¤®–½á³âÔµ’„[@3,.,)&%$$%$$%$+?d—Çÿàßpfb`accfgfhknsz…˜¬¡Ž´×ÿ´ òͪŽˆnJ6,,+)'%$##%(4Q‡»Úÿѹ“ylebaaccfggimnu{‰¢ª¤ÈⶠÜ—†zY;-,+('%‚$##%/Fw¬ÕäË´ˆticbabbcfghkmou}¦¤’µßé¶ èÒ­ŠƒgB/,*((&€$%$€#*>e›ÊÿŽÛé‚ohdccbbdfhhjnou—¢—ªÉñÿ· á¿œŠtP5-*((&€$ %%$#"'9Z“ÂçÿÒ¼ž{lgdccbbdghhinow„š›“·Ü¹ ÿÌ«’~[;/*''&€$%€$#$3Sˆ¸Ùé̵—vifed€c dghhjopzˆšš Äì¹ ÿؾ †c?1+&'&%ƒ$%$/Ky¯ÑÿŒÕÆ©Žshdedccdeghiihl}“ž·Ôÿº èɬoI4*'&'&%%‚$%,?g¥ÄÿŒÖ£‰qhdeedcdfghigel€š ¢Æá» ÌÑ·™xR7*'&'&%€$ #$#$)8\–¼ðŒܾŸ„mf‚c ddfggfdmƒœ¡ªÑé¼ áž~Y9+'&&%%€$ #$$%)6X¹æ‹ÿÕ¸›€ke„d efggeo…œ¡¸ßó¼ ÿÊ¥…^=,'%&†$(3Sˆ´Ô‹éÔµ™~kfef‚efg€hs‡™¢Äãî½ Ô¯‹cA.(%&&% $%%$'1P€²Ð‹æд–}mihigghhgghijmy›£Éᾠݽ“mI3,)*)‚(€),4Q|±Ñ‹ã̲—pmllƒk lmmr“©Åÿ¾ ÞÅšvQ91//.‚-€.08S|¬ÎÿŠÌȳœ†zutssuttss€uzˆœ¡²Çÿ¾ëÈ €]E;9:978778:;::B[ªÌÿŠ ÚǸ¥‘‡‚‚€€€„‘¤«³Ì¿ÿͨlUKIHGFGFFHJ€KRh‰¬ËåŠ àƺ«š’ŽŽŒ‹Œ‹‚ŒŽœ¬´¹Ô¿ ÿή˜zd[XXW€U VXYZ]]cv¬ÇéŠ ÝƼ²¢›˜˜—•–•––—˜¥³º¿ÙÀβ ‡sjgffeffghhjmmr„š®ÅéŠ áÇ¿µ¦Ÿ›œ›ššƒ˜™›¥³¼ÃÙÀѵ£ŒyqnmnmnnopqquvzŒ ±Äአßƾµ¥˜™™—–„•–¡¯»ÅÞÀд ‰vol€k lmnooptuy‹ ±ÊÛŠ Õ¾·´¦š•“’ŽŽŽŽš¬»ÆæÀαš|jc`a`_`aabbdfhpƒœ±ÍÞŠ Õ¼µ±¢“ŽŒ‹‰‡†…††…‘¤¶ÄÝÀË®’p]WUVVUUWWXYZ[^h~˜®ËÝŠ ؼ³®ž‰‡…ƒƒ~‰°ÁÙ¿ÿÈ«‹fSMKLMLLMNOPSTW`z•­ÊÚŠ ؾµ¯žŽ‰†„€~}{{€z{}…˜¬¾Ó¿ÿȨƒ_MHFFGFFHHJLNOS^z”­ÉìŠܶ¯ ˆ…‚}{zxxwwxy€’¦»Óÿ¾åÆ¢|YHDDCDCCEFFIKLQ]|•®ËçŠ áÅ·°¢ˆ…‚|zyvuv}ŽŸ½ÒÔ¾ÙÁ™rSDACBC DFGIJP]™±ÍÿŠÒɸ®¤“‹‡„~{yvuu€v|Š›¶Ìä¾Öº‘jPEABBCCEDEGHJIQd„´ÎÿŠ âʳ­¨™‹†ƒ|zw‚uy…”¬Äؾ Ô°‡cMEABCD€E GHJLLTj‰Ÿ·Ñ‹ªÎ±­«ž“Ž‰…‚|zxw€vx€£ÀÕ½ÿÉ xYIDBD€E FHIJKMOXp ¿ØŒ Ò³¬°¢–‹‡„}{y€wvv}‡š·Òâ¼Ý¿–kQGDCDDEEGGJKMOS]x—¥ÁÞŒ Ôµ¬¶¨š“Ž‹†‚}z€xvvz‚“¯Îâ¼×·ŽaJDCCEDEGGHJKNPVeƒ™©ÆçŒÕ½°µ®Ÿ—’Ž‰„‚~|zxxwvwŒ¦Äàëÿ¹ÿʨ€XDABBDDEGIIKMOQ[m‹™­ÑéŒåȳ°±¤›•‹ˆƒ|zxwwttz…š»Ùðÿ¹溚nO€ABDEFHIJMOQTaw”¼ÚÿŒÿÓµ®µªž˜“ŽŒ†€}zxvxuuw‘­ÊãºÒ«ƒ\F@BCDEEFHJKNRUXj‡œ¤ÁÝÿÒ¸®¸²£š—Œˆ‚}yxzvuuzˆŸ¾Öò¸Ö¼–nRDACCDFFGHJMPSV\r“›¦ÁæŽÛÁ³²µ©š”ŽŠ…|zzwutx“±Éâÿ¶ÿÇ­]MDDEDDFGHJKOQTXa{›™¥ÉÿŽðÌ°¨µ°¢˜’Œ‡„}{{wutv{†œºÑë¶Û¸ŒaOGCEDCEGHKMNQTV[iŽ£›©ÏÿŽÿÓ¯¥¶¶¨ ›–Œ‰…€}|yustw~¦ÂÞԵġpUIEEFCCFIKMOORVY`sšžš¸ÝÜ»ª¶»¯£žš”Œˆ„€}zvssty…•µÏàÿ³Õ¯„[MFEHFBBGJMOOPTX^f|¤œ›ÆÿéÉ©«º¶ª¢Ÿš•ˆ„}zvusv|‡ºÓê²츎fPIFEDDBDIKNQQSX]gsŽ¦ªÍ’Ó²¤¶»®§£™”‘‹‡~|ywutw~£ÁÓî°Ó¿špUIFGGDDCEILOQSVZ`pžœ¼Ü’çÀ «½·¬§¡š–Šƒ€~|zxvvx‚¨ÃÛå®ÿÈ¥vWMGGHHDDEGKMPRVX]f|’£™¥Îÿ’ÿ̪Ÿ¹Â±«¦¡žš”Ž†ƒ‚€~zwvv|…”®Éáõÿ«åä|ZMHGFGFDFGJNPSUXY`s§œ¹Ú”ݼ¥¬Áº¯ª¥¡˜’‰†‡…‚}xvux~†—²Õãèªÿɦ‚_KFDFEFEFIKMRTVX[\e~›­š§Ðð”éÓ°ž´Äµ¯¨¥¡–ŒŠ‹Š†€{xuwz}‰š¯ÉÛ©ÿÕ¬}_MCEDCBBDHLNQUYZZ\al‰¦¢¡»âÿ” ÿß½Ÿ¢Ã¿´­©§¡Ÿ•’Œ‡}{yxyz‡•­ÁÚóÿ¤ÿÔ¹¡…bRIBCDDEGGHKPTWY\]`k}š«˜§Íå–!ÐΪ–±Å»´¯®©¦ž™”‰ƒ€~{zzyy{„§ÊÚìëÿ¡ ÿйžw^SKFBBEFI€KMTWZ]^afw’«œ½Ü˜!àÀ›¾Å¸²°¯¨¤Ÿ™”Žˆƒ€~|zzyx|‹ŸµÐáñÌŸ äÌ®‹kXNIEDACGHKNNOQX[\^`gsŠ¥¤Ž¨Îÿ˜$ÿÓ°‘¦ÉÁ·³°­©¤Ÿš”ˆ„~|{xvz~ƒŒ—¬ÄÐÙèöÿ™"åÕÀ³ „gWMGFEDCDHLNPRSW[]^_coƒ«—¿Ûš#òÇŸŽ²Ç¿¸³±­©¥Ÿ›”ŽŠ†ƒ€}zwwy|€†Žœ¯ÃÙåó˜ æÒ¿¢Šr`RJED€FDGJNPSTVZ\^_bj|˜­ ‘«Ìá›Ù»˜‘¸Æ¿¸³²¯¬§¢›•‘Œˆ…‚{x z}†‘³ÁÙêïôÌ&ÿäÜκ¢ŠiZRNIHKIHHGILNPRUVY\\_flz”­¦¡Ææœ,þд‰œÈƽ¸·³°¬¨¡›—’‰‡‚~|{ywwx|‚ˆ‘¢ºÆ×ÝÜéðîÿÔÿ†ÔïßÖÍż¦s^QLGFHMRO€JMPQTXYZ]__bmyª¦Š•¹Ýž/ÝÊ£‰©ÉǾ»¸·±®©£ š–‘Žˆƒ€~}|zz{|~„‹”Ÿ«·ÄÐØßçï÷ªÿÿ€+ÿîÖÊ¿³§–„tcUMGGIMRTSNKLORSTWZZ[`bbgwŽ¬±ŒŠ¬Ðÿž]ÿØÁ–„­Ëÿ¼¹¶´²­¨¢˜“Š†ƒ€€‚~€‚†Œ‘™¡«¹ÆÈÄÄÊÍȺ°ª¥—Š~sgZSNIKLPVZXRNMNPSVXY[\^`dgkxŠ¥´•‡¢Äî [ÿع‚°ËÉÀ¹»¸³±®¨£Ÿ›•Œˆ……„…‡‡†ƒ‚}{|}‚‡Œ‘•›¦±·º²ª¥—‰zlc\XVNEFJNX`bc`UMJMQTW[\]_`bfilu†¡°š„ ÂÖ¢ZßÕ»ŠƒµÌÈ¿½»»¹µ°¬¨¥ž™”Ž‹ŒŽŽŒ‰ƒ|}~€„ˆŽ”š›˜n`UNMKIJKPV]agigcYPMLPUX\__`cdimqwŠ©³™½Ýÿ£XßÖºˆµÏȽÀ¾»º·²¯«¤ž›˜•’Ž“–˜•‘Œˆ…„…‡”—“‰yh[TQSW^fkosuoibZWSQRRTW\_bcdfhmry†§¹œ}¼Úÿ£XÿìäÑ©‰ŠµÐÉ¿¾¾½¹µ³¬¦¥£Ÿš–”ŽŽ‘• ¥§§¥¢Ÿœ™™šž¦­ª¡”†ytsv{‚‡‰Š„zk_TNORUX\ZY^begijms{ˆž·¡{†±Óã¦Vÿàŧ‡…²ÏÊÄÁÀÃÀ½½¸´°­ª¥¡˜“‘’™Ÿ¢¥¨«­±³¸¼ÂÉÌÌƽ±§Ÿš—”‹…sg\VPPRUWY]_`aehikp{„”¨¯Ÿ|ˆµÐäÿ¨8Ûǧˆƒ­ÏÏÇÂÁÂÁÀ¼¹¶´±¬¨£Ÿ›—–”•˜› ¥«¯´¸¾ÃÉÏÔÓÌù°§ž—’Šsg_YV€WX[]_cdghhjkpy‡—­­z’³ÓåªQÿâŧˆ€¬ÌÍËÄÃÅÂÀ¾½»¸³°¬©¦¢ž›—––˜œ¡¥«²¹ÀÆÍ××Ðô¦˜‹vof]VUUX\__`cdgihihlqu€Šœ±¬‡tŒµÑå­ßÇ«~™ÁÑËÄÅÄÃÂÀÀ¾º·´²¯¬ª¦¢ œ. ¤ª²ºÀÆż¬™‡wjaZXYXWY\_bdfhhikklmmtz‘£³¦‚w”¸Ñë¯ ÛË´ŽxŒ³ÏÐÉÃ>ÂÁÀ¿»º¸·´±­ª©¨¥£¡  ¡¦¬²µ±¦”€pc\WVY]^\^achjmnmmnnprv~ˆš­°™z{¢Å×ÿ° ÿáϹ—{¥ÅÏÌÉÆÅ ÄÂÂÁÀ¾¼¸µ³³²°¬€ª)¬²··°¦•‚qf`^^bedbdghijkklmnnuˆ”§·«t‚¨Éãì³HåÙ½£€u‘³ÌÓÌÉÈÆÅÄÅÇÅÿ¾½½¼º·µ´µ·½ÃÄ¿µ¥Ž{ohdfjmljlmlkkmopsvx…–¢±²ž{r³ÉãÿµEÿÙʳuw¾ÏÑÌÉÇÈÇÈÆÆÈÉÆÅÆÅÅÁÀÀ¿¿ÀÄËÐͲ›…wnjlpstqomllknry…£´´¥‡ny›ºÑ߸ÿäÖ¤ƒp{©ÁÍÑÎÉÇÇÈÆÅÆÉ+ÊÈÇÇÆÇÇÌÒ×Õʸ Š{mhiknqpropsv{Œ–©´´­“gp‹¬ÇØÿ»@îÝÇ·›zou¥ÅÑÕÐÌÉÊÈÇÉÊÊËËÌËËÊËÌÐÖÙ×λ¡~qjkmotuuvx|‚‹›­¸¶©hlƒ¥¸Ìáß½=ÿäÕÁ§“wkt¡¾ÈÑÓÎÌËÉÇÇÉÊËËÌËÌÍÒØÕÑ̼£~snnqt{‚‚‡š¨±¸µ¬‡jq—³ÆÛòÁÿéͺ«’wmn‚ªÄÊÎÐÏÌÉÉË#ÉËÍÒØÕÑÎƒ€ƒˆ“” ¨®²´®™sjp}—´ÄÖñÿÄÔÖ̼­’|€o†®ÅÉËÎÐÑÒÐÏÍÍÐÖÜØÔÒÌ»«Ÿ™šŸ¦¬¯€® ­™wmmr†š±Â×ÜÔÈ2ÿÜн¯Œumsx•°¿ÆÍÎÑÓÔ×ÛààÞÚÒÌÇÄ¿¼»¹´°Ÿ‚tqmkw¡³ÃÔÝÿÌ-ÿÞÕź­ž‰xmmtz†Œœ¬·»¼¿ÅÇ¿¶¶±©œŒ€ytplhmz‹¡°½ÊÜñÒ(ëáÓɾ°¡“Šsmjjqw|{yƒ{uutmgddks|Š—§´½ÇÒßßÖ#¿ÙÚÑÊ¿¸­¥¤”Œ‡…ƒ~~}|€ƒ†Œ”œ¦®²½ÅÏÖÝçÜÿÿàØÒÎÌÆÁ¼·²±µ»¹»±®²³¸¿ÆÍÕØÚÖ¿ÿâ€ÿæççâÙÔ×ÙÖÚ×ÖÒÜäóòæÿÿðÿÿÿÿÿÿÿ­ÿÿÿÿÿÿ§ÿÿçÞâÜÓÏÏÖÚÕÓÙÖÒÖÙçø÷ÿþãþñëáÙÑÊÆÄÃÅÆÉÒÍÉĽ¶µ¸»ÁÌÙßãðÿÜ$çéáÙÑÏÒÍÈÅÃÂÅÇËÏÕßÙÎø¯§ œ¤¯°µÀÑàëÿÿÕ*ÿïäÜÕʾ¿ÁÀÅÍÕÝæëîïòö÷÷ôðìêã×ɼ°¤œ—˜¦¬»ÌÚãÿÿÐ-ªæÜÓÊÀ¼¿ÁÉÔÞåçèêííîïñòïððîìêëèåãÞÖ̺©›Ž‘š¬¿Í×õÌ2ÿèìÔʾ¹»¿ÇÕßäèêéçæåããäçêëëêçäàÝÞÝÞáåæåáÜδ£”‹œ±ÅÛêÉÿçÚ˺¶²½ËØàãäããââãá€à áäçèéçäáÞÛÙ×ÖÖ××ØÖÚÛÚØÄ­•…‡˜»ÄÒÛÿÄ9ÿìÛͽ·´¼ËÖØÛÜÛÚÙÚÛÚÛÚÚÛÝÞàâåäáãàÝÝÚÕÑÑÏÌÌÎÍÏÒÕÒͽ¨‚ˆ–¯ËÛçÁ ÿåÔ̼±¯¼ÌÒÓÔ€Ò/ÓÔÖ×ÖÕ×ÙÚÛÝÞàâãäâäßÛÛÖÐÎÍÊÆÇÊÊÈÆÄÄÉÊǽª€…—®ÁÜðÿ¾ åÏ¿±«´ÃÌÎÎÌÎÑÓÕ××ÙÚÛÛÝßáäæçåãäßÛØÑÎÍËÇ€ÅÆ¿½¾½¼ÀÆŶžs‚¹Ðê¼ ôßȳ§«¹ÅËÉ€Å5ÉÊËÎÐÑÓÖØÚÙ××ØÖÖ×ÚÜÞÜÛÔÏÉÅÄÅÇÉÌÍÊÇÃÀ¼¹¸¶¶¹»»·¢‡tw¨Ìáÿ¸EÿêÔò§¬ºÂÿÂÅÆÈÊÌÎÎÏÍÌËÉÇÅÃÂÀÀÂÆÉÐÎȽ´¬£ ¡¥¨®²µ¸¼¾½¼·³±°¯¯°¯§Ž{xƒ¢¾Ôô·ßÏ´¥ ­¹¿¾€¼:¿ÂÄÄÃÂÁ¿½·³³²³¶·¹¹º¾ÂÈÑÐË¿´ª š•”“”’”—£¨­°¯¬¬ª§§®©—~sxŽ­Ëâ´ïß˶œ¦´¹·/»½¾¼·´°­««­¯²¶ºÀÃÄÄÅÉÎÓÖÔÒÈ¿¶¬¤Ÿ›–“ŒŠ†„…†‹“œ£§¦€¤ ££“ykr‡¥Íëÿ±LÿÚ͸ ¥¬¯±³´µ´µ²¬§¥¦§©¬°µ¹¾ÁÄÉÌÌÍÎÑÖØ×Ö×ÏÉÁ·¯«¥Ÿœ™›—‘‹†‚}{~ƒ‹”œ žšœ™Œymr„­ÍÞÿ¯1ªÔÁ¯¢¡©«ª¨¨¬¬«¦£¡  £§¬²·º¾ÄÈÌÎÐÑÑÒÓ×ÛÜÛÚÛÔÌÅ»³¯«¦¥€£ ž™“‡ƒ|vu{‚‹€‘ •”Œwopƒ¤ÀÙß­ÛÕ¾©š¥ª¨€¥D œ›˜˜œ¢¨­±¶¼¿ÃÆÊÍÐÐÒÒÓÔÕØÜÞßÞÞÖÎƾ·³¯®­«ª©¥¡œ˜’‹…{tqsvzƒ‹“‰wjp™¸×ð«çÔŪ“•£§§¢˜’‘•™£©®´¸½ÂÇËËÌÎÎÏ€Ð/ÒÕ×ÙÜààßÙÓÌĽ¹µ³³¯¬ª¨¥¢Ÿš”ŽŠ†xrnlpy€ˆŒ…sho}š½Ùþ©TÿѼ¯•™›œ™““˜ž¤©±·»¿ÃÇËÏÎÍÐÑÑÒÓÖØÚÝßááàáÛ×ÒÊþ»¹´°¬¨§¥¢ž›–‰ƒ}ywsnnpu~ˆ‚ofr…ž¿Û¿§%ïÔ¾§œ—˜š˜—“Ž’•˜Ÿ¥¬±¶¼ÁÅÈËÍÏÐÐÔÖÚÛÛÞÝ€Û-ÜÛÙÜÙ×ÖÒÐÑÎÉý¼µ°­«§¥ š–‘†~ywtokgks}yjgr}¼Öÿ¥WÿâÆ©•“—˜•ŒŽ‘–™Ÿ¥¬´¼ÁÅÊËÊÌÉÌÐÓÖ×ÚÛÕ˼§—ŽŽŠŠ‹‹’ ²ÅÌËÇÆÊÆÁºµ¯¨¢ž™˜“ˆ}xrmhdcnvqgfnŸÄà¤YÿáÌ´˜‘““‹ŠŒ•™¤­³¸¾ÄÈÉÌÍÏÏÔØÛÛȧˆ†~qifgeefegms}†ˆ’®ÇÑÌÇļ´°¨¤£Ÿ™”†{uqmfadjmleiq§Éç¢[ÿèÏ·ž“‘‰‡ˆŒŽ”˜ž£«³¸»¿ÃÆÈÍÐÔÛÞϦ‹„qbhtŽ—œŸ¡£¢Ÿœ–‹ukhw…Ž¨ÉÒÌž¶®§¡œ—‘‹…}wrnkheadidfho†®Îè¡QîÖ¹ ’‘Œ‡†‰Œ“™ž¥«²¹½ÀÂÄÉÐÒØÜ΢‡m_q‰Ÿ°¯·ÁÇËÎÏÐÏÍËýµ©¢š„o_p‡¢ÇÌÄ¿·®©¤–‘‹‚{xsmifbdcitŽ´ÖÿŸ-ðÜŧ”Œ‹Š‡„‡Š‘—£ª°·¾ÀÁÃÇÍÔÚÒ®‹pm†£µ¼ÉÓÔØâäáâ€ç-ïÝáßÛÔÎƵªšjj¬ÈÌø¯¨¡›•ˆ}vokjfc`abafjxšÁáÿ)ÿäж™Š‰ˆ†‡‡ˆŠ“š §­´¹¾ÁÃÈÑØб”ttŽ¢·ÉÐÙôðÿ‹'ëÚÕÑÌ·žgm±Çƺ±§Ÿ™•ˆ‚{tomjebabbcep‚¨Îë&éÒ¾ ‘Š‡†……‡ˆ‰‘—£ª°¶º½ÅÌÓ×Ášsq†¡»ÉÕäÿÿ‘%çáן¡~mušÂȸ°¥Ÿœ“ˆxqnjfc`_`abiuŒ¸Öâ›#ÿÖÁ©•‹‡…„ƒ†ˆ‰‹”œ¢©®´º½ÃÉÒÖ°r„¦¹ÉÙÿ—$ÿèÝθ {q•»Â½²¦˜”Š…|upkgc`^^`ack{œÀáÿš!ä̳œ‹…„„ƒ‚†‰Œ“˜Ÿ¦¬®³»¿ÇÐ˦~z›¶ÉÔä›"ÿæÛÄ«w„­ÅÁ°¢›”‰€zunieb_^]__fpƒ¬Íð™!êÖ¾¢†ƒ„……ƒ†‰–œ£ª­°·¿ÄÍË£{…¤ÁØçÿ"ÿéßѹ›~„«Ä»ªŸ–Š‚{wplifa][]_djz”¶Øÿ–!¿ÿÙȲ—Š…ƒ„…‡†‡‹“™ ¦«¯´»ÄÍÆ™{Œ°ÉÝÿ¢ïÔÂ¥ˆ‚¤Á¹¨’‹„}xrolib]\]_cdq€¢Ëá• ÿíçÑ»¡’‰„‚‚ƒ€‰Œ–œ¤©­±·ÀÉÅŸzµÒâ¦éÈ«‡}¤¿¶¦™Ž†ztqolc^\]^dcju±Ó–ÿßÌ®—Œ‡„‚ƒ‰Š‹Ž’˜¡§¬¯±ºÈË£–·ÔݨßË°§º®ž”‹‚|xtpke`^^]aaen€ Åæ•ðÒ¿¤’Š†ƒ‚„ˆ‹‹”›¤ª­®³Àˬ†“·ØÿªæΰŠƒ«»§›†~|vpkgea_€^agw•µØÿ“ÿÞÆ°™Œ‰‡„ƒ…‰Œ‘—œ¢¨®°½Æ±Š‘·×ÿ¬çÉ°‰’º´¡ˆ€|wqmifc`_^]_bm‚¡Èè“ßÓ¾¦’‰ˆ‡„ƒ…ŠŽ’˜œ¡§®·Ä½“°Ïÿ®âͨ‰¸­”‰|wrnigda_^]_`hxºÙÿ’Öɵž‡„…„„†ŠŽ“™œ ¦®ÀÄ£ŽªÉå¯ÿÛÊ©†¨°š‹„|uqmifc`^_]^^dr„¬Ñï‘ÿØÀ«–Š„ƒ„„‚…‡‹Ž”š›ž¨³Æµ’¢Áä±ÿÜÁ›™«¦“ˆ}wrnigc`__^^]_j{œÄå‘îÓ¾¡‘‡ƒ€„‚…ˆ‹‘•šœŸ©»Àœž¿Ü³âÖ³“ ­œxtnkgca_^_ft´ÜÿàÊ·›‹ƒƒ€„‚…ˆ‹Ž‘–šž¢®½¬”·Õÿ´òǤ•§¦”ƒzsmkgbaa`^]__dp„«ÑÚÿÕ®–ˆƒƒ„……ƒ…ˆŠŽ‘”™ž¥·¸–¦Èâ¶Ù½›¨›†ysmjgca``_al|žÅæäÏ¿¥‘†‚‚„……ƒ†‡ŠŽ‘“™ ª»°–´Üé¶èÏ®›¦ŸŠ|sljheb``a`__`hw´ÔÿŽà̶ …‚„†…„…‡‰’—¡²·¢ªÅñÿ·áÀ£  ~rliheb``a``^^es†­ÐÿÙÆ­œŒ„„……„†‡‰Œ‘—¤¶±ž·Ñ¹ÿ̯Ÿ¢—slhgeba`a`_^_bm~¤ÆßéÕ½§˜‰ƒ‚„„…„†‡‰Œ›§µ°ªÃÙ¹ ÿØÀ£Ÿ™„tlggeca€`€_ahx–ÀØÿŒÕ϶¢”ˆ‚‚‚€‚ƒ…‡‡‹“’˜§¬¨¼Ùÿº èÊ­›˜ˆvkgecbaaƒ`gw“¿ÒÔŒßË´ ‘‡‚ƒ‚€ƒ…ˆˆŠ“•™©©§Éä» ÿÑ·¡šxjgdca``€_``^et¶ËðŒâȱžˆ€…ƒƒ„†‡‰Š‹‘–œ¬¬±Öí¼áÀ¤’{kecb``_^^__``fq‹¯ÇÞ‹ ÿÛÄ°†„…„€ƒ ……ˆ‰ŠŽ“ž¬­¾áó¼ ÿÆ©Ÿ“~lebb`_€^ __``eo‡©ÃÔ‹éØÄ°žŒ†……‚„ …‡ˆ‰“ ¬¯Êãî½ Î²¡’€nfbb`‚_`a`eo„¢ÀÓ‹æÓ®œ‰‰ˆ‚† ‡‰Š‹Œ•£¬¯Îá¾ Ú¼¤–…qiefc€a bdeedir‡ ÁÔ‹ÚÌ¿°Ÿ‘ŽŒ‹ŠŠ‹‹ŒŽŽ˜©¬´Ìÿ¾ ×Ĩœ‹wnkkig ijjilvˆ »ÐÿŠ Ìƾµ§›–••”•” ••–•Ÿ°¯»Ìÿ¾ëƪ¢”€vtsr qrturu£ºÏߊÚÅÀ¾²¦¡¡ €Ÿ Ÿ ¡¬¸·ºÏ¿ÿÈ°« Œ‚€€~~€‚‹šª»ÎåŠ ÚÂÀƽ±¬­«ª€« ªª««¬®¹ÂÀ¾Ù¿ ÿɳ³«˜Œ‹ ŒŽŽ‘š§±»ÊéŠØÂÄÍɽ¸¹¸ƒ·¸¸¹½ÅÊÆÄÙÀÉ·º´¢š˜€— ˜™š™››š¦²¹½ÈéŠ ØÁÆÑÎÅÁÂÁÀÀ‚¾¿¿ÂÉÌÊÈÙÀ Ì»½·§ŸœœžžŸ€ £«·¾¾Èአ×ÀÅÑÍÇÃÄÃÁÁÀÀ‚¿ÁÆÊËÊÞÀλº³£œ™››œ€Ÿ¢©¶¼¼ÉÛŠÕÁÆÓÏÆÂÀÀ¿¾¾½½¾¾½¾ÄÈÌÊÉàÀѽ¶­ž–€”“”€• –˜š¤°¸»ÉÙŠ ÕÁÅÑÌÿ¼¼»ººƒ¹¼ÁÆÇÇ×À Ó¼°¤•Ž‹ŒŒ‹€Ž ‘’•ž«µ¸È׊ØÁÄÎÉÁ½ºº€¸·¸¶€µ·ºÀÅÆÓ¿ÿл©œ†ƒƒ„„…†‡‰‹Œ™©²·ÇÑŠ ØÄÄÎÉÁ½º¹·¶¶µµ³¶¸ÀÈÈÓ¿ÿÓº¤˜‰‚€€ ƒ„ˆŠŒŒ˜ª±¶ÆÚŠ âÆÅÎËÁ¼¹¹¶´´³²±²´¾ÅÉÖÿ¾ÿжŸ“„~€ ‚…‰‹Œ™­²·ÉçŠ áÆÆÎËÀ»¸¸µ€² ±±°¯¯°³½ÃÐÙÿ¾âͲ™Ž}~}~‚„‰‹Œ’›°µ¹ÌߊÒËÅÉËý¹¸·µ´³³²±€°²»ÄÏ×ä¾ÜË°–Š|}|}~‚ƒ†ŠŒ” ²¶»ÎÿŠâÌÀÆÍÇ¿¼º¹¸¶µ´²€±®°¸ÁÌÕà¾ÜÄ«”‡€|€} ~€‚…‡‹˜¥µ¶¼Ï‹ªÎ»ÂÍË¿¼º¸·¶´±°¯°¯°·¿ÈÖß½ÿÔ¹¢ƒ}{€} ~€ƒ†Š“š¨·³ÁÓŒϹ¾Ï;»º¹·µ´±°¯°¯°µ»ÄÓââ¼åγšŠ‚~|~}}~„ˆŒŽ‘•®º´ÁÖŒк¼ÑÏþ»ºº·µ´²±°°¯°³·ÁÑÚâ¼ãÇ°•ˆ€~}~}‚†ŠŽ’”—¢µ¹´ÂØŒν»ÎÔÈÁ¾¾¼¹¸¶³²±²´»ËÒà몹ÿÔ»£Ž„€}~~„‰–™›§º¶µÉߌåɺÂÓÌÃÀ¿½¼º·´²²±°¯¯±·ÃÏÞéÿ¹æȱ˜ˆ~|}€„‡Œ“˜›Ÿ¬½µ¿ÑߌÿÕ¸²ÐÑÆÃÀ¾¾»¸´²³³±®®±·ÁÍØçº饑†€{{~€€ƒ‡‹‘•˜›£´º²¾ØÿÔº²ÑÖÊÅÄÀ¿½¹¶³´³±¯°°´¼ÆÔâÿ¸äͳ›‹€~}|~€„‰Ž‘–™œŸ¨¼¶°ÀߎÛ¶É×ÏÇÇÄÁ¿»¸¶¶³±°±°³·¿ÎÙæÿ¶ÿÙŧ’‡~}~†‹”™œŸ¤®À±®ÉÿŽðγºÓÕËÇÅÃÀ¾»¸¶²¯±²²´µºÄÓàë¶éÔ¹œ‹‚{z~~‚ˆŽ’˜ž ¦®¹¿¯±ÏÿŽÿÓ°´ÏØÐÉÈÆÂÀ½º·³°±²´µ³µ¾È×ëÔµÛƧ’†~{|~ƒ†‹•› ¢ª´¾µª¾ÖܼµÊØÔÍÊÈÄ¿½¸´±±²´´±´¹¿Ñßéÿ³ÛȲ™Š|}~€ƒ†Š”˜ž£¥®ºÂ®¦ÊÔé̯¹Ð×ÑËÊÇÅÁ¾º·´³²³²°±³¹ÅÕæö²ì˱œzx{€‚„‡ŠŽ“™œ¢¦ª³Â¼§±Í’Ó·®Ç×ÑÎÌÉÇÃÀ¼¸·´²³²±°°´»ÇÚãÿ°íÓ·žŽ„{yz}ƒ…‡ŠŒ—¡¦¦®¹É¬¤ÀÜ’çÃ¥¶ÒÕÑÏÌÉÆľº»·³²±²·¿ËÙåÿ®ÿÚÁ£‘…}yz}€…ˆŠ•œ£§©©²ÀÀ£¨Îÿ’ÿά£ÆÚÕÑÏËÉÆÁ½½¹´²€± ²²´¸¾ÍÝöÿÿ«òÙħ‘‡}}~ƒ†ŠŽ”›¢¨ª«¯¹Ç¬ ºà”ݼ¦µÖÛÕÒÎËÉÅÁÁ½¸µ€²³€²µ¼Îíô÷ªÿÚÁª”‡}}€‚„†‰Ž’–š¡§«®¯·Àá§Ðá”éѯ¤ÆãÛØÑÎÌÉÄÃÁ¾¸´³´·´²°²µ½ÍÞêªм¨“‰z}„‰ŠŠ‰—› §­®´¸ÀŬ¡ºâÿ” ÿß»¢°ÚÝ×ÒÏÏÊÉÆÿ¹·µµ¶´²±±²·ÀÏÜðÿÿ¤ÿðÚ½¦‡„€~~ƒˆ‹•š ¥©¯±µ½ÆÁ˜¢Íå–!ÐάžÁÝÙÕÒÓÏÍÊÆÀ½º¸·¶µ²²±²¶»¾Êãéõÿÿ¡ÿåÔŨ„€ƒ‚…‡Œ’˜œŸ¦«­²µ¹ÆÌ©•²Ü˜!ࡦÓáÙÖ×ÕÎÍÉÅ¿¼¹·¶µ³²³µ³²¶ÃÑçòû™Ÿ ÛÚÆ°‘„}}‚‚…„‡‹–¡¥¬°³¶¹ÁË»—§Éÿ˜$ÿг™µßßÛÙÕÓÑÎÊÇÿ½º¸¶µ³²³²³µ¹¾ÍÞæïûÿÿ™"ÿíß̺¥”‰€~„ƒƒ†‰Œ•£§¬²´¶º¾ÇÆžžÁÛš#åÇ¢–ÃâáÜ×ÖÕÒÎËÇÃÀ¾»¹·¶³²²´µ·¹¼ÅÑÞíõÿ˜#ÿèØò†ƒ€‚†‡††ŠŽ‘•œ£©®²¸º»ÀÇȬ•¯Ðð›&Ù¼œœËáßÚ×ØÖÓÑÌÉÆ¿¼¹¸·µ´µ³³´´¹¾Å×ãêð÷ù™‘%äÜÛÓȺ “‹‡€~€„ˆ‰ˆ‰’—£ª°³·¼¼¾Æ͵£Çæœþж©ÞãÝÛÛÙ×ÔÑÎÉÆ¿½»¸¶··¶€³ ²´·½ËÒÕåëðƒÿ†)ÿÿôñáÖɹ¯¡–Š„€‚‡Š‹ŠŠ”š ¦¬³¸¹»¾¿Äμ“•¹Ýžè̦ŽµÜáÝÜÙÚ×ÕÒÎËÈÅÁ¾¼º‚¸µ´³²¶¼ÀÅÏØàæèéðô÷?UÿÔ€+ÔîâÜÕ˳§œ“Šˆ„……ˆŠŒ‹Š‹ŒŽ“–š¢ª¯³º½¾¾¿ÂÌ“Ž¯ÐÿžÿÝ—‰¹àÞÝÜÚÚÙØÕÑÍÈÄÁ¿¾»‚º)¹¶²¯°¶»¿ÂÄÊÐÙäââãææáÝØÍÊÆ¿»±¥›“Š„‚‚‡Œ’“€Ž•™ž£¬±µ¹½¿¿ÁÄËÇœ‹¦Éî 8ÿÕ·ˆ¾àäÞ×ÝÛØ×ÔÐÌÉÆÄ¿¾½¼¼½½¼¸µ±·ºº¸¹¾ÁÃÄÅÍÕØÙÐÈƹ¯¥š–Œˆ€…†‡’“••’“”“—› ¥«²·»¾€ÀÃÎË¢ƒ¢Åà¢ZßÒº‰ÁáàÚÛÛÜÜÙÕÒÏÍÊÇÄÂÀ¾½¾¿ÀÀ¾¼¾»¶³´¶·¸»¿ÁÆÉÊÆ¿±¢˜‹‹‰†„„‹‘˜šžžœ™“‘”™œŸ¢¦ª¯µº½¿¾¿¿ÁÎЯ†™¾Ýÿ£Xß×¼‰‘ÅäàÙàÞÜÜÚØÔÑÏÌÉÆÃÀ¾¼½¿ÂÆÉÈÿ½½¼º¹·¸º¾Ã¾µ¨™‹•›Ÿ¦«©¦Ÿ˜•“•šœ¡§«¯±¶¼¿ÁÁ¿ÂÆÌѱ‹—¾Úÿ£ ÿþêÒ¦ˆ–ÆåâßÝ€ÞIÝÛØÖÓÐÌÈÄÂÀ¾½ÀÆËÉÇÈÉÉÈÉÈÇÈÉÌÑÏÌÇ»®§¤¤©­°²°¬«¬¦¢œ˜™š ¡¨¯²¶º¾ÂÄÅÄÃÊÓÊ­‰’»Úã¦VªàŨ‰Œ¿áàÞßÝàÞÛÜÙÖÔÑÏÍÊÆÃÀÀÁÂÆÈÌÐÓÕÔÕ×ÛÝßááàÞØÐÉÃÀ¿¿½¸µ²©¢œ›šž¢¥¨ª­´º»¿ÃÅÄÁÃÂÆÓΦ‹¸Õñÿ¨âǧŠŠ¹àçáÞÞàÞÞÛÙØÖÕÓÐÌÊÆÄ6ÅÈÍÒÕÖÖÚÞàââãáßÛÕÐËÅÁÀ¼³«¥žššž¢¤©­°³·¼ÂÅÄÆÄÅÄÅÉÓÊ¡|’³ÓتQÿâŨŠ…¶ÜâåââãàáàßÝÜØÕÔÒÏÍËÊÇÅÅÇÊËÌÐÖÛàãäãáàÛÓÌŽµ°­¤¡¡ Ÿ£¦©«®²µ¹½ÂÈÆÇÉÇÊÉÎ×Å–~ŽµÑå­NßǬŽ‚¢ÐæäàãâãäâáàÞÛÙØÖÔÑÐÎÌÊÉÉÇÅÆËÑÖÜÝÚØ×Ðż³¬¦¢¡¡¤ª¬­¯°±µ·»¿ÂÅÈÉÇÉÈÅÊÑÕ»y”¸Ñë¯LÛÉ´Ž{”ÀâéåàãääãââáÞÝÛÚØ×ÖÔÒÒÑÎÉÇÉÊÍÑÓÐÌÉÀ¶®ª©©¨ª¬°´¶µ·¹¼¿ÁÃÇÉÊËÉËÊÊÑ×Ï®ƒ{›½Ôÿ° ÿáϹ—{„®Óáã€â=áâããáàßÜÛÙÙØÖ××ÔÑÐÒÓÓ××ÖÓÐǽ¶µµ´µµ³µ»½¾¿ÃÆÈÈÊÌÍÎËÆÌÎÖÙÁœy¤ÀÚì³ åÙ½¡€y™¿ÜæäâáããâàßÝÞÝ€Ú-Ù×ÖØÚÛÞßÝÙ×ÐŽ¾½¼½½¹»ÃÆÊÉÊÍÎÍÌÌËËÊËÒÙѳ†wŒ¯ÅÖâµÿÙÇ°‘x¦ÌãåááãääåããäãâàÝÜÝÝßßáâàÛÚÓÉÃÄÄÃÅÄÀÄ€ÌÏ€ÐÎÏÍÌÑÔÖÒ¼–vz—µÍ߸ÿäÔÂ¥…tµÎÞæåâáäåãâäæå€ã*ââááããäåãßÞØÏÍÎÏÐÑÐÍÍÎÐÏÑÔÒÐËËÉÐÔÊ» nrŒ¨ÂÔÿ»îÝɸœ}w~°Õäêèåãååäæçå€æåäæç æåäÜÒÐÒÔÖÖÔÑÏ€ÎÏÏÎÎÓÚÚ͸šnp„¤·ÉÝß½ÿä×Á§•zp|­ÍØäèçæåèçä‚æ$èêééêëêçßÕÒÓÖ×ÖÔÑÑÏÌÏÒÓØØÔɸ‹ip–±ÆÛòÁÿéͽ­•yrtŠµÒÝãçëêå€ä%ååçééèéêçäßÕÐÑÑÓÓÐÎÏÒØÙ×ÒË¿£{ot™´ÄÖñÿÄ6ÔÖϽ­’}rtx‘¼ÖàåæèèééèèéêêëêçåàÙÔÓÔ×ØÕÓÖÚÕÍÄ©€qosˆ·Æ×çÔÈ2ÿÖн¯Œwouzˆ¡½ÍÖÞáäåæèëîçèäßÛØ×ÕÐÏÍǽ¨Šzvsp{“£¶ÆÔÝÿÌ-ÿÞÕź®ŸŠyopzˆ—¨¸ÂÄÅÇÊÎÇÁÁ¾·«™†zplq~Ž¤³¿ÌÜñÒ(ëÛÓÉ¿± ‘Šupnov|~}{„†|~ysmnt{ƒŽš«¸ÀÉÒßßÖ#¿ÙÚÑÊ¿¸®§¦Ÿ—‰‡„}|}…ˆ‹‘™ ©°´ÀÈÑØÝçÜÿÿàØÒÎÏǾ¸³±µ¹·º±±µ·»ÃÇÎÕØßà¿ÿâ€ÿæççÜÙÔÕÕÔÔÓÒÒÜäóòæåñÿÿÿÿÿÿÿÿ­ÿÿÿÿÿÿ§†ÿ úßÙÖÖÒÌÏÒÞêïóÚãìéëêèæèìîóöûùÚÐËú±®±²·ÃÐÓÛéåÜ$ÿ÷ûüúùöôñîëëííðõöäÚÏÁ´¨–’™£¤ª´ÄÒÝíÿÕ€ÿöõóíó÷öù‚üûúùõïéãÚ;±¦™‘Œš ¯ÀÏÞÿÿÐ UòïíïîïøøôöýÿýûùõóõûûùõñíìèäâÞÕȳ¡’„†Ž ·ÄÐìÌ€ÿüùíëîïòùúþÿþýýÿþùø÷ öôïéãßÞÜÜÞ€â áÛË®š‰„‘§ºÌàÉÿ÷ðìé÷÷ûýýüöñöø÷ù‚ûý€ÿóïêåÞÚÖÓÒ€ÑÕÝÞÝ×ѹ¡ˆxzŒ«»ÒÓÿÄÿúþüøóíóüÿþþýû÷ûýýþÿþþÿþ€ÿþõîêâ×ÒÏËÊÎÏÐÏÎÌÏÓÔÐ˹¢‰x}Š¢ÁÖçÁ ÿÿüòóõñùýþþýýû€øûûúúû€ý üýüûúøñíâ×ÒÍÈÉ€ÌËÉÈÈÆÅÅÊÈø¡…ux§¼Ðé¾ôððìêòùþþýûùø÷øúúõóõö÷÷ù÷ôõúöðåÝØÐÌÍÌÉÉÈÆÅ€¿ ¾½½Á¾®–uhw“®Æß¼ÿúúñìïøýþüúûùùúûüýýúúûú(ûúúø÷÷ðìåÚÑÊÄÂÄÆÇËÌÉÆÃÀ¾»¹¶µ¶·¸³œ~ij€œÄÛÿ¸ÿÿôïóôøþþüùöøüûüýþþÿ.þú÷öõôòïíðîàÛÓÄ·«¡ž¢¥ª¯³¶»¾¾¼·³±¯­­®«Ÿƒmiwš¸Îê· òöùúúýþüúùùúüþ5ýüúøûüûùøúúûúúûýúãÝÕÅ·©œ”‘ŒŒ‹•š¡¨­±°«ª¨£¢¨¡ŽtirŠ¦ÄÝ´ÿôòøùúýþûõöùúüýþþýüøõóóõ÷ö÷ùü€þ*ýþþüêåÞϵ¨ š–’Š…„‚€„ˆ‘š ¤£Ÿœž  ufm€œ¿Ýÿ±ÿìêîñüþþüöòøþÿþüöòóóôöúýøù€û/üýþýýþþüîéå×ËÀ³ª¥ š•‘Š„€}wvy‡‘–—šœž›Žvehw¿Õÿ¯Uöøùòóöøøúüüýýûøõóòôöùûþþúøú/ûüûúúüüðëçÙËÀ³©¦£¢¡žœ™•‹‡€}xqquzƒ”—š˜Œscdt–¹Ôß­öúóõöøûöóôúþþû÷óñó÷úüüýýþþ‚ý1üûüûûúüûðìçØË¿´­©§¦¨¥£¡ž™”Š…€{vnjlrz†Ž‘’…o_ct°Ìá«ÿöõóõ€þ õóó÷üþúö÷úûüýþýƒþü€û.úùú÷îêåÙÎù³¯¬ª«¨¦¤¢Ÿœ˜“‡„€|skhhnx€‡ˆ€k_dk‹±Ðþ©ÿììúóóüþþûûöôøþüúü‚þýûùøøúûúü.úú÷ñíéàÖÌþ»¸µ´¯¬§¤£ ™•‹…ztqkffjq{…~j_]mŒ´Ó¿§ÿùåçúö÷ü€þûôóøýýü€ýüü€ýû€ú€û5ýýûú÷õòðîèäãÞØÒÎËËȽ·¶¯ª¦¥¢ ›–‘ˆ‚zsokfcbhq{xgU\l‘·Òÿ¥ ¿òøþüùýþþýýüûú€ù øúûüú÷÷úûý€þ9ø÷øõóðçÙDz¢š˜‘‹ŠŠ‰š©ºÀ½¹¹¼¶±ª©¨¤ ˜‹‡ywtnicaalwsd`gu—¾Ú¤ ÿûôøüûüþþüùùúü€ûùùûüýüûýýüüùøùùø÷ß¹ž”„ypnnhf€e(hnv~€‰¤ÀÌŽ¸°ª¦¡œ˜‘‹…€}yrohc_aimhaafu Ãâ¢ÿùïîïùûþýúø÷øûþüüýüüýýþAüýûøúöç½ ”|kmvƒ™Ÿ¢¤¤¡žš’ˆ|qebpƒ¨ÄËÁ¹¯ª¤Ÿš˜‘Š‡‚{vqjgea_bfa^^e}§Êè¡ öõòøùøýþû÷÷ùü€þýýþûùý‚þAüúõÝ«“yhx‹­«²¾ÄÈËÏÐÎÍÉÁ¼³© ˜„p`p‰£Åȼµ­¥¢Ÿ˜‡{xrjfb^_aa]Z^jƒ¬Ñ⟠ðøòóøûùþýøõøûý€þýþýýüýü€ûýùê¿’rqŒ¦·¹ÆÎÏÑÝäáâ€ç-ïÝáßÛÔÎÆ·¨–{ik¬Æǽ±©¢›”‹„|uniea^]^\Y[_mºÛ¿ñóöøþþýüüûúúûý€þýþý€üûùûüïÈ£}uŠ¢¸ÇÎÖêáÿ‹'ëÚÕÍ°š€kr’±ÆÁ³¨¡˜’ŽŠ…€ztnhd__^]\[[dvžÈäéð÷÷ü€þüüþüûûýþþýüüúúûüù÷òÔ¨}vˆ¢ºÉÕäÿÿ‘%çÚѳž|lx›Àò¦œ—’‹‰„~uoic``_]\[Z_j‚¯Ðâ›#ÿèëóúüþýþýýþüûûýþþýüûúüüûøï‹v…¦¸ÉÙÿ—$ÿÝÔɳž}s•¸»²¨›’Ž‹„yslea`_]\]\\ao’¸Ùÿšéëóùûúúùý€þýûûüýþýù÷ùúûûê·…w•°ÈÔä›âàÕë‘v€¦¼¶¤–‹†ƒ~yrib`€^]]\]dx¡Æð™!ÿ÷òóúûúûûüûýýûúûûüýûø÷üùô뻆†Ÿ»ÑçÿÿéæÓºšz|¢¼°ž“‹‡…~{tlea_^_^€]_m‰­Óÿ–!¿¿øõ÷ôûýüýüûúýýüúúûüûúùùþúá°Œ”®Å×ÿ¢ïÔ¢‚|ž¸­›‘Š†€|unhb__``__\Zdt–Âá•ÿÛàõ€úûý€þùøýýüûúûûùúûýÿé­ˆ˜ºÔâ¦éÊ®Š{Ÿ¶ª™‘‰}xrjb€_ ab`^Y[e}§Ó–çíöùúøùûýþýûûüýüùøøü€ýú굈œ¼×î¨ßϱŽ¡²¢”‹†zunea€` _^]ZZas—Àæ•ðîõùüûùúüþûýü÷óõüýþþñ´‡“·ÕÿªæΰŠ‚¥®˜Ž‹ƒ}xqjeb`_]]\[]_nŒ°Õÿ“ ÿíéìòúüûûüýþþü ø÷÷üýÿùÑ““·×ÿ¬ç̲‰¯©–Š…~xskgca`_]\[[ZbxšÃá“ßèæèñùýüûüþþýüüýþûùúüüú㩳Ïÿ®âͧ„”®£Ž…~ytlhdba_]\ZZY^oˆ±Ñÿ’Ýèìë÷€üûüþþüûüüþþýþûüí¹›´Îå¯ÿÛÇ¢€Ÿ©•„}zumhdb`_\\ZZY\iz£Ëï’Þéòðûýýüûûþýûûüûý€þûöÌ™¥Èä±ÿØ»•’£‰yunieb`_\][ZYZbo‘»Ü‘îÝïõôýþþüûûþüúûüüý€þü榜¼á³âѯ™£‘‚zuoifc`_]]€[Z_g‚«Ñÿàßùúø€þ üûûþüùúýþü€þóÆ“®Ìÿ´æ Žœ™…{upjfc`]€\[Z\^cx¢ÈÚÿáãøûúþþýûúûþýúúüüýüùü䨡ÀÕ¶ Òº•“œ|sojgd`‚\[\]_p•¼âñâê÷üüþþýúùûþþüúüûýúø÷Ò¡¯ÒÔ¶ÝÌ©‘œ”€sojhea]\\]€\[]k†­ÔÿŽïèíùýýþþûøøüþþý€ûýùôá·¯Âäÿ·Û»ž™—…uoigea]\\]]^\[\h}¦Íóêæê÷üýþþúööüþþýûüüýûòÒª»Ñ¹ÿƪœ›xqjgda]\\]\€]ZcuÃß éãåëöúüþýøõôû€þ ýýûþûìÇ«Æâ¹ ÿؽ£›{sleca^]€\ ]__\^n¼ÖÿŒ Üåéôüüúýþüûûý€þ ü÷ùþýà·´Íÿº èʯšŽzpgca_]‚\€]am‰¸ÍÔŒããëùþüùû…ýûóøþüÙ±½Ò» ÿѹ¢|qea__€\[[€\]ajƒ¬ÄâŒÜÞèøüøô÷€øù ø÷ôøþûÔ·ÉÛ¼ áç•€thc`^]„\__e}£ÀÞ‹ÌÕÝëùýúøú€ûüûúøúüñÍ¿Õâ¼ ÿÊ«˜‚vha^^…\]^cyœºÔ‹ÔÓÞîûþýý†þýüýúèÆÆÙî½ѳšƒxha^^]]^^]\]]\]bv•¹Ð‹ ÞÔáóþþýýþþ€ÿýþýþõßÁËÙ¾Ú¼ˆ|lc`_`_`aew“¹Ñ‹ ÚÔâõüúøø÷÷€ø€÷øùúûóÚÃÈñ¾ ×Ä¢‚pfdfe€d cddeggjz’´ÎÿŠÌÖåöû÷ñ€ðòññððññò÷øðÖÇÎÿ¾ ëȦ˜‹xmnponpoptsvƒ™´Ìߊ ã×àéìíèéèçèçè‚çãåãÑÄÒ¿ ÿË®¢˜‰~€ƒ€‡…†¡·ÍåŠ æÒÕÝÜàÞÞÝÜ݃ÜÛÓ×ÙÍÅÙ¿ÿ䫦˜Ž‘€’‘’™——Ÿª¸ÊéŠÝÆÅƽ€ÁÀ¿¿¾¿¿¼´»ÂÁÀÓÀ Ôºµµ¨  £¤§§¦€¥¦ª¨§®µ»ËéŠ ÝÁ¹µ¦š›š˜™ƒ—˜œ¦°¸¾ÓÀÔ½¹¼±««­°± °°±´²°·½¾ÉÒŠ ×½®¡Š{vwvuussrs}Šš­¼ÙÀ Ó½¸½´­­¯²²³€´ ³³¶µ³¹¾¿ÌÛŠÕ¾¤yXZWUU€S QQPOOMHUr™¹æÀ ×ÄÃŽµ´µ·µ·¸º¾½½ÂÆÃÍÙŠ Ú¼ pIC@=<;:9€87764Aa‹±âÀÖþÀµ®­®°¯°±±²²´€¸¿ÃÂÍ׊ ؼœl@.(&&$""!!€ !)7U}§Þ¿ÿÓÀ·¹®¦¥¦€© ª«¬­¯²³³¼ÁÀÌÚŠ Ø»™i;'" €".GiÞ¿ÿÓÀ´µ­¦¥¤§§¨©ª«­¯²³³½ÁÁÍÚŠ ܽši<' ƒ%+$""€€2I’Îÿ¾Ùϼ®°¨¥¦¥¨©ªª««®°´µ²¿¿ÁÑߊÝÅžjB*! *B€»ä¾Üμ®®©¦§¦©ª««¬­¯²´¶·À¿ÁÐÿŠâÈœoH,!€$;q­Ð¾Øɹ®¬ª¦§¨ª«¬¬®¯±´·¹»Á½ÁÑ‹ ÿРzU0# € 5`˜À½ ÿ×Á´®«¨§¨©€« ­¯°²´¹¹»Á¶ÂØŒ Õ¦b7($€ 1R€ºÿ¼åн±¬©§§©©ªª¬­°±³µ»¼ÁõÁ֌ۯ‰pA/*%"/Cg·ç¼ã˽±­¨¦¦€© «¬®°²´¶½ÁÇÀ´ÀØŒ 㺕sD1)$!„ -9O¬Ý몹ÿÖÁ³­¬¦¤¦€¨ «¬¯±²¶¸ÀÅʼµÈߌòßQ6*%!(/=’Äâÿ¹îϽ¬ª«¥£¦¨©©«­¯±µº¼¿Æ˹¾ÐߌðÉ«l?*&"!!&#&2dŸ×ºáʺ€¬¦¥¨€ª ¬­®±¹¿À¼Åŵ¾Õÿ˱ yL2$"!!*M†¸ò¸ñØñ©©«¨¦©««¬®¯°´ºÀÿÊÁ´ÀߎÓº¨{W:%"#!€#;n¤Îÿ¶ÿãѹ«§§ª¨§©«¬®°±³·»ÂÆÃͺ²ÉîŽðȪ}hH' !!'F‚¶ÿ¶éÜɳ¬§¤¥§¦¨ª¬°³¶¸¼½ÃËÉÉ·´ÏÿŽÿЪ†uX1#"" "3`—ÅÔµßй°«§¦¤¦§©¬®²¶¸¼¾¾ÅÍ˽¯ÁÖ㸗‚f<("$"!%B{°Ïÿ³áÍ¿°±­©¨¥¦¨ª®°µ¹»€¿ÆÎÌ´ªÍÿéÌŸ†wS3'&%!#+H|¬Õ²ìÓ¾°®°®ª¥¤¨ª«­²¸»¿ÁÀÀÈÑÁ«µÑ’ ׫Šf?+)%$   .SŠ²î°öÛð©©«¬«§¨ª«¬®³¹¿ÂþÂËÔ¯§ÃÜ’纓‰zT2+%$!" -X›Ðå®ÿåе©¨¦¦¨ª©«­®¯°´»ÂÆÅÀÅÎǤ«Ðÿ’ÿÉ¢‹m=+&'%!$;nž¼Óÿ« ÿäÒ½®«©§¥¥¨¬¯€± ³·¾ÄÇÅÅÊÓ² ¼à”ع ŒuG.(('$!! (Ev§ÂÒªÿÝ˼¯«¬¨¦¤£§¯´µ´µ·»ÂÇÉÉÌÐΧ§Ðð”éÕ¸ŒpQ0)+)'%%'!&@iÄÿ©Í¿°¥©­°¬£¡ ¦±¸¹¹ºº¿ÅÊÐÒÔÕ·¦¸âÿ” ÿä•woT<3,(!"$'Co‘­Óð¤ÿúçÅ·¬¦¨¨«ª¥¦¨ª°´µ¸¿ÅÉÊÉÊÌÒˤ¨Ëå–ÐѦ€|tQ<0+!!! € '@e–µÌÄÿ¡ÿòÞÒµ¯±ª¨¦§ª©¬¯¯±³µ¹ÅÎÒÐÈÇÌϯ¡½Ü˜à¼w~hA.('"%%$$" € %7Rs—·ÚÿŸ íæ×±¥§¨¦§¦¨¬¬®±²¶¹»¾ÇÍÏÎÊÍÒ½š®Òÿ˜ ÿЩ|wzT5+)('€%$"  %1DdŒ£°ÇÓÿ™ÿóå×Ê»­ª¦¥§¨©¨ª­°²µ·»¿ÀÄÊÍ€ÌÑÌŸžÃÛš#òËšuviA1.,(%%&%#!!!1No“´Èܘ#òæÛÉ¿²­©«ª§©ª«¬­°´¶¹¼ÀÄÆÉÍÍËÌÑϯ—­Îá›&ݾ’mtfI8-(%##""!"!/?Qjz§Î×äÿ‘ äãæÛÏ©¨«°®€­¯²µ·¹½¿ÄÉÌÏÏËÊÐÕº•¤ÆÞœ,þصvnbH5*&$##"!##! '.8Iz˜­·±¸ÈÍáÔÿ†€ÿñäÝØɽ¯§€¥§ª±·³€¯³¶¹¼ÀÃÅÊÎÑÒÑÎÐÙ×™¹Øž+èÌ£~„ƒd@/('"! !#%%" ""  %1@Vp‰ ²ÀÐÜðÿ€+ÔîäßÙÑÇÁĺ°©¨¦¨¬°´µ´±°±´¸º¼ÀÅÆÈÍÐÒÓÒÒÚÍ›’°Ðÿž]ÿØÄ–u~€[@6/(%$$%&%" !"## !"!.;IVew‹”¡»ÄÊÕÙÝÙÒÌŽ·±°ª¦¥¨ª°·º¸³°°²´¹¼ÀÂÇÉËÍÐÑÒÕÕÛÓ¥ªÉî [ÿßÀfzvXF60)#$&'&# !#(+,-,"&-3>McuŠ§±´ÂÄĽ¶²±±µ¯¨©«¯¸¾ÀÀ½µ°®²µ¸½ÀÅÇËÍÏÑÓÓÒÕÞجŠ¤Çà¢ZÿÚ»}l…wcP>.+)(('# !! %.5:;2+'#!'8F]ˆŸ¤ª®¯¬©«¬¬²¯­³»½ÃÆþ¸²±´¸¼¿ÃÆÊÍÏÐÑÑÒÔÓÝÚ³‡—½Ýÿ£JßÓ±uqyeF90+**)&""# #)18;>><;:4+&&,:G]‚—¤©ªª¨©­´ÀÁ¿ÅËÇþ·µ³´¸¼½ÀÅÈÊÎÑÓ ÖÝàÞ¸Š’¹×ÿ£ ÿÚÚ˲‰ZoyZ@2€-I,)%%(&%#!!""#(,0>KPVYVPLKP\g{—¨³½ÄÄÂÁÁÃÆËÌËÉƾ¶±®²¶ºÁÆÅÄÉÌÐÔ××ÖÖ×àìßµŒŒ¯ÌÚ¦ªàɧ{kdK>671.,+-(&#"€#$'()6CIMPWcmot“ªÀÎÕÛÝÜØ‚Ö ÔÒÊÁ»·µ·»¿ÀÃÇÈÉÌÒ×ØØÕÕÐÑÜØ«€Œ¶ÐÖÿ¨ÛÇ©~cujP?82/,-.)'%#%:&%$-7<@DPbpty…›´ÈÔÙÞááÝÚ××ÖÐÊľ¸¹¼¿ÀÃÆÈÊÎÎÑÔ×Ø××ÕÕÔÛϤ}‘³ÓåªQÿâǦ{e|„mT=1.*,-+)'%%&'%!!)+-1;L]dn}—±ÅÒÙßáàÚÓÊÈÆ¿¼º¹º½ÂÇÇÉËÎÑÓÕÙ×ÙÛØÙ×ÚàËœŽµÑå­NßǪ†jq€x[D:4//,*)'((*(%""#! %062.*)+,/,**-4582..2/,,.47>Rs—ÁÓÚ€àáÞÜÝÜÜÝØ××ØØÖ×ÜãæÜÈ£qr†¥¶ÉÝß½=ÿÛ×Ê­’nWTt„€|q`RJ:68500156;QršÇ×ÝâàßÜÙØÙÙÛÜÖÓÖÙÜààÜÑÀ’qr—±ÃØåÁ:ÿôÔï’oaZd}ˆ€wn^XWRIB@@=AVyŸÇ×ÝãäàÝÚÚÜÝáßÙáåãßÖȪpq}–´ÄÖñÿÄ6ÿè×È´–|i[NXtwtwqg^YVRTf„¦ÌÚßåæâàßàãåèçàÝØÏ´Šztt…–­À×ÜÔÈ2ÿâÓ¿¯œˆofkmej€‡†…‚ƒ†Œ“›¬ÚâßÝÛÛÝÚÖÕÓÌÀ¦ˆyvroz’£´ÄÔÝÿÌ-ÿÞÕŹªš…sd]`^\\_mŽ”˜¢¿ÇÁ½¿¾º®Šƒ{ojp|Ž£±¾ÊÜñÒ(ëÛÐú«¥š{i^WW_ioqrzzw|~ztoou|ƒ™ª·¾ÇÒßßÖ ÿÙ×ÏΟ¬ š‘‡€€~xutw}ƒ‡Œ‘˜ž¦®²ÀÆÏÖÝçÜÿÿêØÒÊŽ¸´²¯®²´±µ®¯³·»ÂÆÊÓØÚà¿ÿâ€ÿæïïâÙÔ×ÓÐÒÓÒÒÜäçææåñÿÿÿÿÿÿÿÿ­t8mk@ $,56688DLKKKKJ7& :€Š”§µ¾ÍÛÜÜààõÿÿÿÿÿýßĹ©@# $Dn¬ÕÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÞDz„M0vÏçõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüê¿v/*u£ÕøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùÜ¡h7s¼ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷²‚2 A¯Ù÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ²Q6£çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúíÔƒ!g¿þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü³X#2¢øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ°1qÏùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÑr ~ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôP½óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿù­-aÐÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûÂ\bèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèO_áÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâetØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêu wûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿït_ÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèdaÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿãQjçÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâSN×ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÄ,-µÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúš©ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõäÜÕÏËÍÍÍÊÊÓÙáåöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷’ wðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙ´®wI6'"0@Nƒ¹ÑóÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíVaëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüÕ¦‰K 7€¿íÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÃ'°ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöÄs> #Zœñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú‰ rõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ}6sÓùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÔD:Óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿç±T *ˆÁâÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¯¢ûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÃp  )uÙÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿí]Kæÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüï- H©ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÊL¹þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÈl#‚îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëF’ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÀT çÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùš¦ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý¾Otëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿê]Uâÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ¹: séÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ·"’üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛQ‚êÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿí_&Óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòx +¤ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¨Vîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷•IÑÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿà;®þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ´3 _ãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿû|2Õÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚œûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÃoïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÔ>Qñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿå>¨ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜh ›ûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòk2Èÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüœ+¼ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ´nþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿåI „õÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÑ0 Œÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿû§<Ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðj%Õÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõl°ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ8ôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðVZêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¢Yõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿë:#½þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¸tøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿè-z÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÄ*Àþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚_óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñSÝÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿé=EñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿeÙÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ–'ÌÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿsÖÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ} Œÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡ÙÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêUvÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ *ÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÔ6dþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ— 5áÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÌ/_þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿš <äÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÌ/_þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿž@åÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÌ/^þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚ$1àÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÇ*Zþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï/1àÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÊ-^þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿï-5áÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÌ/cþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¼5áÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÌ/vÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ™,ÞÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÞL ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ” #ÜÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿˆÂÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡Õÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¦,ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿs ‘ûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÃ!BîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿenøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøIsöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿdUõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþs ±ýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿáFHñÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿË,@ãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¹!%»ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõk  ~ôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬™ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÊ$»ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ“†ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿá@DÚÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïcmþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿø˜¡ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿË):Ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ×?Rôÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþ­—úÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýž $Êÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿî\RãÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜ]‚øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÃ&%ÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛ;+Ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿû‚ sòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÎ=©ûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïCAåÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ’‘ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ»ªþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëm vÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìidõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæ³MˆâÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÅ*.ÅÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÂ"Zêÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷“ êÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøzWÔÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÍ,1¶ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖ@6‹Ûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷† jéÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÑQ <ÅÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚ,´ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿë·M}ÕÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûsS×ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÆuE +Z°üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿØ9‹üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿæŒgÈúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿët=ÃÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðÃ~a0%^½ëÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿô”ròÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøóµY:3&N–æòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÀ.’øÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüüîÀ£v$ Xœ±ÑøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿäM.¥ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõ´œ¥‘‚’– ºÚÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü”PÅþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿý²2hýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿú³<9ÑÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿâML¨ìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿבðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýîn$ŽîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖd$†ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÝv |ïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÍ_ îÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÀZ vÔøÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ»T >®ùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿü£8 6—óþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿΆ kÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøÆH S«üÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙ‰=z¯äÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿùΨHfÙúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÆžR8uÚðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûî°M,c´ÞüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóÒ™TC»ðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøºu3 +iªñøúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýø÷Ë€a(MpƒµÞèÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéã£vd< .Pš±¼ÆÆÎÖØüÿÿÿãØØÏý¼½¦O8!!,6h‘ndStCœ¶kWºÍZê6·!H›¦m\šÆ$í~°Ù‹o:Åwñ>ù Ùƒo{’ Æaø¬ˆ"Lö"³ž›4M'S¹÷»ßùî9'çä^ ùqZÓ/USOÅÂüÄäßò^C+ühM‹†J&G@Ó²yï³óÆltîoß«þcÕš• ð ¾”5Ä"áY i\ÔtàÖ‰ï15ÂÍLsX§ g8ocáŒ#–f45@š ÂÅB:K¸@8˜iàó ØÎä'&©’.‹<«ER/ådE² öðsƒò_°¨”é›­çmšNÑ|ŠÞ9}pŒæÕÁ?_½A¸pX6ã£5~BÍ$®&½çîti˜íeš—Y)%$¼bT®3liæ ‰šæÓíôP’°Ÿ4¿43YóãíP•ë1ÅõöKFôº½×Û‘“ã5>§)Ö@þ½÷õrŠåy’ðë´Õô[’:VÛÛäͦ#ÃÄwQ?HB‚Žd(à‘B ašcĪøL"J¤ÒitTy²8Ö;(“–íGxÉ_¸^õ[²¸öàûžÝ%׎¼…Å·£ØQíµéº²šua¥£ná7¹å›m« QþŠå±H^eÊO‚Q×u6æS—üu Ï2”î%vX º¬ð^ø*l O…—¿ÔÈÎÞ­Ë€q,>«žSÍÆì%ÒLÒëd¸¿ŠõBÆù1CZ¾$MœŠ9òÚP 'w‚ëæâ\/מ»Ì]áú¹­.r#ŽÂõE|!ð¾3¾>_·oˆa§Û¾Ódë£1Zë»Ó‘º¢±z”Û'ö=Žª²±¾±~V+´¢cjJ³tO%mN—ó“ï„ |ˆ®-‰«bWO+ o™ ^— I¯HÙ.°;í¶SÖ]æi_s9ó*péýÃë.7U^ÀÑs. 3uä °|^,ëÛ<ž·€‘;Ûc­=maº‹>V«Ût.[»«ÕŸÏªÕÝçä x£ü©# Ö¡_2 IDATxì½Ù³-×yØ×{ž÷>Ó0$H Y²DØ’UåÙV`W9‰_R~Må)¯$þ¿¸’7ÅU¥R•XÊeÙFI¤ÄI I ¸¸ó™öÜ{Îï÷õÞ÷^p)/€ÓçôîîÕ«W¯^ë›×·¾•$'ÛI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀI œ´ÀG©r¥Ê~ëºZ­¢þ¯$ÉŸz!É}éKÑ ¦å.^L •JRèVùt˜+Œ I¾0Hrù|’+rÞ;N Åâ*ŸŸä~¤Ÿ'ä©U“dXycUœNóËE±P,Ì £9O»•§qHâ0‰Ãd2M*I9»]I’%•+vÊÓJ¡>ËÍ&óÒ©ÝE´%µNs1Nf‹vrzñfòÂìÙܳó¬À“ß;©~0î¤ÊÔ%I^^­Ê`N©•$ÅþÕ¤²SJJÅzR\Í“Ú|’4ç¹d;?Oš³eÒXÌ’úl‘Tæ °t‘4—‹e{¾È·“岸\ÒšjG³Òñå\~VX”®¦«Õ¤¾X,·Aݽe.©‚Ùä]@b–ÉŠÃb¹Hf¼p9ŸuÉòI¹XJŠÅbZ*åß.–Š—òÅâJ©Ø+Ki)Wœæ Åc²H‚Ž+¥Âų¹Öµ“þ¼óZà„Üy}5zgõN­œl·»é¢QHg.¹GgÓUeµJ Ë [.*«y®ºL–­å2_[ÎóÕÅÝJòy¤J]Î’H¿˜/áãÓdòÏ—2ñU”S*P$ƒ¢®åò«ƒB¡pT,”F€i¹Rž—ŠÅA©\äóÅA.·úAq1­–¯ *Ú ]¯ ŠâhkµŸæóLîÐ.øDTë„ü̺y•™Ý¢^€ç~‰ó×__å÷«¹üvmr_~6y^ß^%‹ß\.—ÿý|¾*̦‹d>K’¬~>3ƒ¬ ðr1Ë%óÅ*Yƒ£E~ñÙW룈_ÈÁo{.—ç0OJÍwÉ“&s}:CÔŸÎ(ß#û,Mû'³iÜ“( ¬ r yªÎ^Dß@H*è#Õj5öZ½žT+UÒÊI)É¿Z-æ¿[.”.Ê¥‹¥|î$Žk³ùòÆl»|}9ÚŸ§ÇËÓ½ÓËóçŸZ>÷\añ 'ÛÝ'àƒnáŸPþ‹«U©}°ªÝÍ•GiÒ“=Dø3é497'÷ΖËOƒðÁˆ‹«ÕüÔj5»¤I‹ÜÑô@Õ– ƒÀÙÑtôò¤€ˆ®! _Ó³!ú‹¬‘žôBÑ#¡¸LŠµ¦Qî<}q™A@~‰ÀTðý3¨÷¬Ç‚÷yÎõñHè(ì%Tw® ùü RÈ£”ÓJ¹:†(ŒëÍú´V« kµòÕr¥úFµV>_ËWÞEx¹Ôª¬®ü‹ä_ŒžÏ=¯âr²}€-pB>ÀÆýqEÿîjUxòq{6ÙÉ'ÕÓ‹dúÐj’;=ŸvÓùììl±:~Ý7[åïÉåË»óÙ Ž §êæ »ÌQSHí1Ég×9ôö¼ç€B@A€&@™µD€{†8òl¡¬ž•%¢ÄŒ}>ã8—ëOã|º˜Äõâ2#m’Ž¸—Šñ$ ‚1çzAX@ ¨";?ÔÓ˲ÒA©˜”¨TH µZÒi6“J¹ìŽ­ ø&yÞ`·\(¾•+­Þ(æòWêÕÎ~{Z<¾ë®»0cæ”mN¶÷¹NÀûÜ ?®8¸tî+ ûêüQÒ.åg ÒÕ§P­n:]<7ŸæÎNÒU2Oó“É,žmAeY9ˆëŸÈ‰¸E88Æ78-ˆ\‰Evöj5—”0Ò«æKÈGëäX‚„`³(OÂç.çîˆö!Q€¼ ôýeìI2_Éå¹G®92Á¾¯dÀ>“q:NÒt’¤H ¡2L<"5p ¶@}]…B”Bê ATPªÕʲV©,µÚ¢Ól/Ú~­V}«^¯}§V®zùõZµ}é_þóÞÿÊW¾bø†õÀvx?6{þdûZD*¼r=©mµ’m8úÎxšœ_š ø=Ótñ4:÷éét~Œ{4Yj0\Äj/Ä|Ìþ…eRADχH]é1ÿ—3ä/é!k$Wµ' ùøqÛÇÒ@Âzç\ཌä@rÕ%Éò˼Ex¹9v¾8‡·G1ª3ô’9­M@" Ê 0AzPe˜j7@”†ˆA‰qÜ÷ÙìTÊ„ý \JZ&vƒÊ)á¸Z¯^oÖWëµæ%«ÛÍæëHÝZ®v­½›¿ôݾ;|öÙ“¡Åÿ¿ K¯Ÿlïg Èí)¯òÍ ×·ê«ÆôíGç«äþtº¼+ýîd–{ ,~„/¦©ˆ$ב1•ÉÝÕÓEàfy‘´*ó¤ b”Ÿ³# êdY2Dçeâ®Ïƒôqn’@UV€ä3ì'?-0†ŒA>c¢m ™ŽŸIà–· «Æ@G 2"‘Ù ´ ÄŽ}@ š°@b8“ƒq?bèGÉb0ÁØ!ðܲܪ•RÂBR-W’V«•l±ŸÚÙS…ø~»^ûn¥PºVXåÞ,V¯Š•óÅÚö§_MŸMžÅ*T.Ê9ùùé[@Ð9ÙÞǸtéR}Qm?4­>;IçO¦Ëߧ³³ÃaZbH®0_äÊà|m¹ÈçØAhfˆÃå:"1"üZœo–VI3Ä{ˆœ^q?Ó÷©l†§¡_oªnG‚¸9.ÀwŽ ’÷U*Dò >áÉ/KŠ ˆô ž;(’s¾\ŸÇ{-Hº¡˜ ±àQ ŠDiEŽîŸåÄÎó}úŒ,¤¨"½êÁÕ¡?$G‡Ép0äÞd­rdR‡ÆÄ*"ÍV£•ÔªÕI£V7ëy»Þnw:×[Íú¿ÛÞêüôå‡ÏårO36r²ýE[`ÓóÑç>ñùñÿø“ò™Ï&eFК4dgÔKZ“Yr×lºü†»‡^ÌfOÎWËú™G‚Ûr¦^.‚»£s܈ñ¹«yÂpY ½ŒZqÞÎåÄ»›{†¼Y7:<§È.ÿY•6Ÿ1Éåpô ÷ ä5ÿM®/PÿWÐÚ¯:°æÒQ:u±h¥ ±\¥‰\Œ.pä<êI±V ˆòØæ˜SžeÓ4Œ†É>`0$£Ñ(I%èK)÷T)|I"PÁ°¡tP¯6’V½¾ñG•jå¥J½ör¾\ºÀhB—!ǃj{õÂ/v>wàkO¶Ÿ®„“í/ØŠùW¯&õyiµ=\ÍÏÁýîeþÓ£ñâñ(ÿèh˜{&ä*Ã>Ö{D`‡ÌD¬Ý y1©ÖDü@½‚ó£/pîu _cžF²%*ÁbYÌDxž Ä‘D<77Åw÷ØDÒÈ{óv ¨š¡¸ÀTЂ@Z\yP;Æd–[‹Ðû9Šø!,3i€4‘Úß¹yx ³dµñw%‘áU…u5°õã^XçÃh¡˜bÙ¡šÃ jRA?$}ˆA¿Ï>è£ ±' ‰`-]!Í”‹åc!# \¤¶’N»lïtT¦õZí|~¾øg§ÆÅoúÚW_}uñÜsÏø¬ûà'NÀOj™?'ý­·Þª–vvîOò_fÿ þƒƒÑ¼6-ê“I®‘¦¹­Å¢œ_Ìq¡…ÃÈU•ÓçC̯Ö0òøЂ0ÚÙóŒrår3g¢ˆ’E´v@\‘x–‰×1;°‚HO†<òxüÝÞ«œçåÎ`d¶K`ØyLwÁ$7âq%84o\¡×¯@üøã(âÍ9Šôæ‘8ÌâÜšñ'!;ƒuöœ‚£Ùxoy_•!äðÅá¨Èû(g‚AqIšÏQz£AÒí‡T0ä\õ`Ї !P6ÊC:R*é“ÎV;ÙÙÚBUhÜUmÿË»ªÛß­7kX_¹0x7÷ô‰jýð~n•Ÿå$ùwwUø…ç’ÒìJÒ榧GiþÓþƒèŸ/¦ó¿¿Zvz}†ÃÆXÅSFöqÌÏå*8Á ÛÃõ«U¹>ãà =¾1 v½ÌbÃu¢¬l]ôa(@® ¦ê±ßì N÷åæ+v‘šAØ 9ã roóŒ4ƒË,ÝìÞóšs^€dœ Y…s¸¿H/9òK$Ô‹{þ$¼’ü¾Å#;„Àã-›BÜâ=xƒå!ÅX9غH D~f,á˜\àëçpý4aп@ƒaäïöºHýdÊ==uXRÑɨѪ'Û­¤ÝhMN7;ßmךïVµùRéÕr³v¾Um]«’kÕbóð±Ó§G¼W’y²­[`+' òç´À•+«F/—ž)æ«ŸëM’_ë¦Ë2N“íÑÀYx«Òt6Ï/LÅgù º{/·¤YƒûU·ÙÉNœ¬qøæ›Cw—‹ÊUáÑ+0Ä}ú ‘´t»ÝäÕàxЋу9ÃŽ*>º —ªåy£ÑXnuÚË»wO/Oµ;‡{­­—åÒØ)µ¾ZšLΟ;wnÈ‹N¶u 8j|²ý9-pãƪÕîŸÏ–_èŽsu8-|ñh?=›æŠéx†Á*Ó» t¥‚ŽÏ0]…=sÔ÷•þÀZ^ì»i_0% iY2¿"¬ø!7Ï8¹ŒÖÍGEXñ'ð,RÉœýÇÑLf')6ŸÙÁ~N³ûÎð9Þ3¾móÉäoýRW F”°æ9@ù~ÈLí¢ÆÇ }·}:ˆŠCV‡o“Àq\’/Kå†Ù­ »õer2ö‰¢#|8£%z â8Tð>l†­`€„ ¤âw0fùÐE‡uJÊ#…¥½~©W=úùN©º}\*}~·Óù?ßùÓ­­ûoûèOô©}r²ÝÖaî•WÐRÏ$`© “OÏW£Ç§«ù3ˆþ¿<™–¸q„÷üG-Õ¸žyõj9©5àúU|õCϦumàhd¸±¸êr 5ÀŽÞ¿4A¤ˆL­K<„X¬Kßf#x”•÷E7þ¢ÐìnǶ!Šä!9ßQK‹÷ȵ¹W À*ĺ‡@†urp‚áÍ}¾T0ǘIz¨k+~˜õ%ü‡¥ó?Kqßo\WhSÓÂï´Þ‘&XŸS†ç"2x­?€jÅ0Š’©"¼Û‘‚žˆ=$.C‡µ8ràh…ŽSºo×1Ö›1Œx×önÒ®VûíVó_Têõ¯.ÊÉ…Jý8ת ŸèÜ×ç nÔŒóOÔf—œl·µ@X¾|”œN“Ï Ç«/vû«¿;J—÷uû£Ú4ק³U)eFžÐ¬*×WܯÖ*5îa¤Ú ¥¹€àl€xay}ýΛp'’ÞÜ=!‡ãù±I6ç¾™„) ¢7‰Dë{bšé™±È®/€iY¹EØl‰çš@ì…s ÿ8tº@߆ÌÖvP0Òp8/Ô15jc%©€œÝ<‘½#òûõA|ÖY•̤Úä´ÈP¼Ç&aËäŽuùR1©GS|­„`À(ÁѱöF°tûÝdŒ±P7å":^…ØÚÉ.FÂN§³äx€z0ÞÚj¶ê­ßßn¶þ`Y™uÙ<ž{|Å|r¶඾^¾¶¬œ??>3έžŒ–¿0L—u8În2Ï7G#8>\_w]uÖãÓéÕ0î9–_Bìqn¼Ï:úçðdœÇ÷8ƒQë>mij9w>)ÚIbm¥Ñsn¸[6u–€fefÄ(#!¶G¼0Ú̯õMwâDî>d´ ×Ñ!ÝõˆÁ„o‘V!M•` €t’fkzvï̵3;{‡[­ö;Vý_ânü͇ë;ïÄ·}~>ÑÀ É …ÁÏÝ·\Ôžfìþ7úÃä—ÓYå>¦ê2Ì”ƒ{qe®âKŠ8ôKR ¬Fá†åØºÞ äê«üz)æN¤¢x.ðò£ `ó ÌžD<ÃÝH—I›_.Ütw#&È^Ĺê:Gí J!º©¢H•÷FÜ¿rJÝUmÔÿ!èüÿkᘓr>±ôÜó˜qcë/¡R"ºß#eY#=å%È #ÞcZCR¢’䈔€dõ¢¶ñ<h»¥ã˜¼ßÎs­”¡4ró]YkXH|c"®Â÷!Ú2ŸÔÊŒ4yƆ¥©m´"¨É$Y`pHRr2Š‘ÎfeB–ÝËä£{©Ï#¸m®†³Â;ïì/Ò{vö!œªUþ8oŸHðeØÙj¯Ô ÕÂÓÃÑøoö‹¿yÜŸUGŠ®³ä¡UBä'¶]RÆ™‡S[àƒ3). ·˜\L: À‹1[.&’g ŒnqÉ ±oÝÉÎÀsñ86‘{³)’û.¹Y†¾Wt½¹¿y€s±DäÏ‹åþ #¬¿¤Z²‡O Ñ~b/~pE‚ËËý‡ ¯ ¹7D—N!¤ôèùнYÉ&ªÆ÷©—„$ŽQ¶ªRæÜ£ZRç¼æ°^ )íC^g=ôƒqü0MgˆŒÌ‚$"7c"•Ìf²iˆ[ÈÏîemè³Ñ©´E™Ù„mÊÍA´ç$æ±ô10À‰Ó•—|ßœ¡Â9¡˜ŒƒQrfk§z÷éSÿ$i¶ÎÖÚ„K½ÒýÚ—¿üåwŸþùhÞM|ÜŽ@ç'g[­¾œÿÎ…ÿ©Ý®n=ÒK“»G£ÅÃÞòKãñò±ádq´È '6ÈïTÁ‰:Šúø0íÃU|ÍÀ?, D„c ô»Ï¸¢)B¨7ÜåêÙÑÃÍtNe¨ªÍYY#À½' ‹t/¼@v3¯Ÿ±8/onÔG.«è/•ç3`Àä£0©Q6œ²UvRõe¯ÏPÛ_ýÃnî€1Ä@$šqÈ•Z‹ë" ïˆÑ >$#Aò •¬Ø."¼mCÛ–â4BP7AR(¢KÉ´%žª-!;ùáJX|‹ßn#Å9_º‘ <òØzßäá1¾s qîã+p" ?Úd–N©t¨ðÀ] 3à!QÑÀF– 2¬L#K¼.q(@0¨Y½¨·ï;c³ pÑ”ŸsÔ$îsž‡ìP^#a“÷¬ ry;³À(Ò€£:JÈ?y‡H£ñ$9½»}×éÅô.¤”‡¨ï}•Rõøüµó¯¿¼zùè±ä±ml«l¶O pr—nܸhú+Ýaúßa>wt””ú½"A9ánÄÞÃæžY™×¾úºïf€§àbµZâ7<¤äÓ:-  ˜A#Dªl‹ãúáW›ûœ¼XÃñvn„:O×0p‹Â)ßwDˆ0© {ÿúE›û\Š>~£g¡û# ‡‚ΉT‡Õð™‡fe£+˜ãpOº”Ù§|_˜Ww[¼â9#æÖaÉwã! Þû±|õŽ‰ER‡àÜä#݃9tnjzSÔÏ&.QGÊ)I ªü”"°(i5·Bõ¹ˆÆ´Ýè E~7Õ!Õ'0Åôg®í‹bþ‚o!¸*íƒm€aB§_K€¨ó úÉÌy¨K ½3§ks\ !Lð+˜ ÇŽ··*Üu¶8,ÖÿÍÎxëu¼Êë¡Â5é/ ä/'§¿ýÎü‘Á¤ùóéhñWFƒÅ½é¸Xëâ>b9)Ð-šiÕW'5(‡ÈÈî@’óNÀ7ál>#:ù%€ipC9.Yã¾?â³=MI¼Î€CkÞq<ò|˜'@N€Ø Ÿñ^ãà¾Ú ÃbvÙV”-ž‰c›ÔK«1ŸüN½[ø_~÷•ƒÇˆÓN_ñæö& |l·ç’r¯Î>ósi/ùÒ`ºú•á Ç´Ý\’ŽÐc'e†ðäøèš`°Q$–B´]9áEVÐ9'ã°ˆõ(ÙÞ³‰´‡¾DN¡'fÅ èÇàxàºÿÂ5×áµH9,'ܪ\c‘Ä:8 {Jr t?Q¨þb’Ö‹“åßÓÛ»oò-yÉG~˜ðcI¾üåUþÿ³dû[?HšL»Ï§‹/öFósLÙÏuÃØ‡î  ­@ìÁ7•èå"ðç9ù–‘4Ì{d6ÙÝM®G2‹_ÃÀ››Êƒ¾ˆì©>Cf €º½ïŠQÎw¸ƒ½%{Îivža;"Ï™‡Ê™Íó¢éëóŸ¹xÏ/‘HÄGsq29§1¼Ž#÷óèÔ9Ö%—{6fÌ' IDAT¾Çgýó-q­’ä·Ú†Ü÷“Eþ̈N‰Þ_iTå{‘¹ÙiDÚ,tx”g—pf †gR®µ%ð&ÓŠô‰ ÂÌ«2ÖZ%„"õ*­ÚT#‚HBä£ ¾:϶ÉòTJ•dI$bÞ„@_žD|Ä€LR“`@g¬ƒZ(”ïn+ÏäfË·¯_ÿÑ¥^ïÍ»Z­Cúr Tì#¶}ì@“ÿ½—’*óõŸ¤_«7hþ­ãaîžý>±o/•D¬«`TPì¯ÒÙê±…:£à¥>º8""9”Å–À ÞZ„ à4;"n.È'ëóÎ}ÝÁÌ®ô‡p¼¢¢–àÖ%žr¸Vƒa‡r‘‹¤g“žh}*†TênXéœãÜm SÞ=3½˜o5èHJ}FÌDI‚>ÄX|ÏΩ§¥x´P.ÿo“qÿß¾ôÚkÈÃZn~$et¶xé¥ó­'ê[Ÿ»vœÿµÁ4ÿ,ÝS£´˜g8O6,ÒÂÜV¤Á€S¿Çf˜ÑèâÏ#ù¹V"µÚO`äp<`dV|J!3Yâ¡LOÆ ¨ô ÇvçüÈÞ †`@ 4=;ZD¨^»[MŸ“°‡*`Ŭ7c3Ëõ;€ÇŒÃs$‹Œ;ˆÏºŒŒ«gi=D]_ÂåDm³:¯_¯#CÔ%$\_ÿür"·FAT¢Vˆ|`0DÃä|æ‰%XÑfÑ"?w•< ¨9®¸oÛºY®õŒ°é¸/k3Ðv cÏl5‰û¶Õ` ¨ œWÔý±B²b1BC`ÖÈQ unó:«šh¯-»ÎQôkŒ @¬†C¥ Ú‘‘¢2ë3–&óÖr0ýõYoÜÞÞÙ®¼½¿ÿâýIr9*úûùXCv=ôPR—»gñãùôõYá—úéâW™ÎË8ÿ"éŽuûdüWŽ&(>ê ¢˜(7 DP×ÒgÀ  ‘1 ‡3¨ÇŒ|a%–Õ7ScÃ[M€ÛµERu_­érv1P _u† µƒs‡¦E¸ ðÜ͹™J°¾oÞ Ȳd¿ëÖE£,Ë Q3ž¯W`ŽqNÝý¶x”“ ͳDË €“(‡û6Ä'ø<ñHµHÉDŸ‹‹Ðz‘Éï“ )°½×ˆÎ£AA#÷ƒÔ(YPžˆÒ j@¼\fJÙ”¸æj)O;Ý|ÉnÔ —-WɃ 30˜µ•’)Ü_¿ ™U¹ »Ñ äD¢øN¿ƒþÒ1É{%3'§.¾ Õ_±çÓ,¿¢_Žô%_!D¬÷°ØÉÕ‹ gþéÕ7¿‘ß=þøã ˆòÑØ>à‰'öëåæÞƒÓq矎&Ë¿M|ˆíþ`ÖìÏñþ*‹1Ïø÷ŠÁö¼@*ŒÙ߀BåàLé@Œ‡Ïpfxùe:8æHæˆæÈp´%˜,ðŠLrEiŠÀSW®¾ã:3òöêÇ`”†¥€oò“-¸jŸµ,~»Èãµù­-u\£W\‹`k¢NٹȗUCñ„å¡2{ˆý +nNT‘zÈyAÕƒvˆÎÍU‰XÄ üªäŸSÆ îÜ™6™‘ =¦¢ (=q¤]ÈÄ487¥Ù–Ž fÏ‘Çw*1Øƶm§M%œ÷-1¸Æˆå9¢àµêµø.n†ºý#!籪WQëVªŒ"Ä D!r€)~¯—´ ãúز¼økƒÃá?ô&-r½UÎþ¦ˆˆøŽ%` ¼2z€¾¦cW žÃäÉpŠøÄÀŸ156ÜbÉ-Ès…@¶@LCd¹Ef‘Ýswò…xØÉ>ç.‚{JyᤲΗM$ä¾ÈV”yƒ°ø2pˆ£’ñí Ò}¿ï¡2‚¼iŠ¨A8@æä´Ù‹¢œx%íb>-âJ’Úx9Ä/ÀqêS m‹ìeÚK“g™”E"ÔÀ"ŽÝœgÁ}q T+\{I‘0'› ±& ¦õ ‹-m6 ÕzJ°Ú¶’í“‘>Dâ¥R¢yÍ%ï³?3Žïƒö Ë® ‘¸)‰L}?D# ¨.<¢À0亇šÀ„$²¢ UR' ùŽÒERH“ ’@¦ƒ*äv¦Ÿ­.“»Y©èÒ¬6;~ùå—ß`dQôÎÜ>RàÕ;µ×ºé¹ñqõ—»£úÃÊ/÷Šg™×Ÿ@•G3‘Ÿž„2[·ƒ` ÔOÁŒdÀg09WLÔ&B°l™.×ÕEVš[¥ÓjÁ½="þe„@‚ð‚I„ÃãüÙ,4™¼<¸05µòp!E1?Z .®ØË}_-‡æãû”a`0^Q~Nädnê÷+ƒ¤B¢ÞpÎ=0#§œbÄ{¢•¨+ÖìŒÃ‘‡IŠ ÆpÜ]ëý‚ú„÷«qM»Úì ¾K~®$`Tá©;HE xž:Pß1û„|ܘ Ï ‘%¿\UÊã;âÛ°!PGu´Àov“ ñDRd•(øõ¢ñÑ#/õ W˜R ¬;9|´ãˆ´<¯÷¡,·òG]hß+Ñbùf®N;Æ’ì‰D¡V©è䓨‘6£œ;B¶!’³‡ÄSΓ|ót.÷ßôË…Óçî=û¯ŽV«×·s¹ãø˜;ìGøûhlȈË7¶æ“égç³ÂßLg¹§úãÒ§÷%Ö‘ƒ:Cc';À$ÿ‹±^Yý0Ùåøç7M@ ‘ÿyÁp­ß!â´E°Î] â(e*ò “êùü5"åby…WÅY‚©äç9Þ)Ü»ëGök'g xIÂã{A¤°Ågp—ü¢šcú¿äÍ"´«ûÀ¡æLƒ]ÒÓ© dàÕF˜ìX’›é®¬T\Øoö]  ßI:"¡8ÚrË@Þg{‚aŒ+ên‹~\ÀXbÈL.Y¬3ÍÖ±uP|uX‘^@2È8’ôh³.2¢]qÉ€@¨ƒ*µDÉ(ëõ-Ð#ÖL'yäŸ6ˆ~¡N¢¯x3íW•!ó#ˆjCȃ8_eò•Ôüäk©›ÄìÜËævpAGf„AÄ&/yÂÃ÷+ê*¹Ð½x…w¡@d“HhT3 -Bô$T¤Çy~„0ðPµÑzº0íµÝ‹£w–HöØcw^< °ã^Ÿ,ï'6ÿ/ö‡ã_NÇù³Ã%­0±‡±i€þÛåæ­à:t¬œÒtó›¾Æ/³l^ûï»iä”+s®h¸!€Íø}W.Ÿ‹É+!ðYÅðpTBüv^¼ê†kaý†«» ‰«æÊÕE7ú¯‹ðF¼™ÍÆ,¦I"úG]<Ù\Z‹ /¼˜:ç=$€d-Àí"¬¡‘,¾Ud£²†Ð(mP‚+T³ATÝZ“ Ü¬Ë×ÜÚN*,Ò)1°qäÊTõw#(JmÆóËC¯ÏÁeó”“!uÉ«[cQSG·½ ad¥ 1—Mû@Èà”i˜62Ü¡A@;0Ô ê.ªšÕ2x:¾¬Œ2 0¨´°T”C“ÐòÈ 0hwн8"I Vi´‹#Eá8fÙ.‘râQDFö-Øì þ, ›0×,)óM—!¹½SwoWkÿcR™¤÷œÛ¾þÊ+¯\£2w”:ð‘ _mÙ~íRòÐpÜþR¼üµÁ`¹7JCÌ+À¢˜â¤`gïÃEÄ67úZj/…^H>9šgлOŒ ̤k㘉—Ë(}Ÿí^( @Œ‰gÜ?Cî(µ¤F9´Àêî«LWÉ£Gtœ¬cš| <‰êÄìDÊc‰÷…ºÁÑ F“á­ûÇIŸ3]B;Ö%ħÞÕ}ýõŽÓ—}Ê º këMáþÅÔxå÷k£—(¹yªƒý´ŠœKÛHQ9{hGhMH‰†Ã¤xŒ‡Ë$Éýƒ‚Q¤„Âà© "ïÖ›­¤A¸­#-u¤¹£Sm‡<†hA.lR+â¾ fÐ1Ä”o~Y}?–u…¨-ÊuÈ@t ö´È/‚ËëýCÌòyúÜQ€ ˆ•‰‘gßÍs‚ÏxÛá`r9ÚŽ¯QòZ/¿Õù 1dìµmH›ç`DÜ ¯ÆhóJívswº¨¡Ò­^(5€£Ð;ÉQèŽ'cþ{—&gçËâ¯'ù¿?ž–~±Û›òy…èÏ@©‹®"l@R϶ß7[ô5©˜'ç‹ùçÜ §C3@ò¸y‚#$6FÚùI¸—ŽI$\K;‚ë«ï <LÅãŽÌ@^JøÁÝC­(ùqž)RIE}óÂècˆ0óàã9†¬äNÚ)&ˆõ"ÿW’+W.%×.¿›²4Ö$…[¬ë:U6•3p†j%Šé³Â°å·I½Ø$¶E†k„ã:Ú‡c†€¨—›m8…òº‚¯D×ÅR\HTýÙìe¿Ùn'§ÏœNöØ‹»¹¤ÝÌá$ø;eÌh—Þ,Ÿ n†rMê7€ ƒb LƒoQ®‰:ø^¡ß8Òâ›»DI œ§•–ÂO€çƒpØ78ø„Á;V -„%hñ1QeDÇ‘D¾lffösE¬› ß»ï.xߺ¤Pèè.0FD‘µýE‚¡*UD]ºïô™/´Ífˆ‹Oþµ'™•’ôØïˆíŽ&öõÕÁ`o1?2žä¿0„óÅgè”Þ±Ñ\à*ó:€"Ý•+еìvÞ€#’®@ª.`Ç]2±ùë3!êû<0"ÇcÝnDŽ{Šø yécŽ¼Ùsww- ÏN£.ÔAQÞM¢6ëš$ÎY]\Ô轩Á,Yöêú•ËÉÑáaÒ=>B@Ïd×;m8@`wñ )ž«"K-«¢ï;€W yYµÕÝ£ÞÖ ŽïµîìY#Py¥9»NŒæ<Æ÷¥ô¹ŸÂé&ˆëFv€”sm/FV2°}GÄæ¿ríJr„”réÝ«ÔeÒÑŸ«ѪHµÝvRÙÙJ¶ZdŠý €Ý‚˜\ñØM9yÞib‡Ü$8ºä.°ol&^Ýáìi6Û“ ¡|@€„9à€&·ýÝœÁ†EÚË?S…‹ø|ÚAÿâÌD:íýF;ã€(E¿KH†xDÊB²ò•:´5Í(ߥÍH=ÝÃrÒ-•ï#ðJáÜÞÞëËnÍ,ßb¿#¶;–¼Æ2]ßÛí,º•§Óä—ÃùcÝA²Ó@@þ1ã°úø«× ¨£_èG;UίþSs#Ï­ö„·×Ù£ó¹Ž!ÖÄ€kÙùFßÏ$óð¾HçœbB—'¯øíµGþ#» ,qðu>b=ÈÁ7¸fízœPðÕÇ:¾Z¸ðe .Œà°pûããäâÛ’ë×®±¢Í>à…ŠÂûî²a0Õ¤Ò®ã–Êx5]J€°Éý ˆÑs˜äRAÕ€—9“\LÄç;æ8Ðì4àÆ•ÖëP)DHdŸIP1&ìé„tÕ Ò& pD &í>%šIòÀ=æîדÖv'ÙžœJ: v•¤È|þ&õ1Xç›Üz@Y„òÇXˆZçžaO©TžÍ¨a1êI[€Òpxú#Ô÷DnÏÈH›q 8(O'!·È¥X¡dö† ‘ã1ËØÀV¼…ÜÞVbãsâ6[òh3æŠGÒEˆ@¥WJêõz º‹0å¿Ö¬ÍGß¹òƸ˜O/<~æq ùg»Ý± p.·•L*÷Óüs£i噃nþÁþ Xô , ‡d8fâ˜l ?Ü5¬¿·_K¿â~tغ_Å€s02†Ø 0ˆ¤À…\=ò±êù &sSÑß<¤1žs­h(b9ÔYéüç9Z”Ä LBµ"@ñˆƒpbC©žhˆQ":]芶Y¸° çÄ$®À¬–+W¾Dã·›ËÆVn±õ¿Sƒ°ÿL7aöŽÜ¦io‹pÍŸŠŸ w±N_q<.ƒø ÏŒAJ½Ø±ÃVåú|>Û!šIa_Ñ™þ@ßì3 ÈæÉúSB tpÉõ=^À"ò„ÿþÍg$&KÁ8¢–Ã87ðœ*Ź€[1?‘I' Ǹ‡Aï0¹vãÝäêå‹ÉÕw.ÂêôWI³ÙHÚ[®}WMXÜ wÎcoDz…XyÃ@§?…_ÙÇŒy¡Têy^,ǸO¨Ôýy‚' LU·ä±ÀÍJÒžnpd\–„?XÍùä*õm¢ß7𫯒^¬Õk ¼àê“é¼Âuµê<úЦ3`èÑü®Ç7fTbìòÝìª.Új\Í·‡(·¢¡‹L¼Ù¹ç®dï6/‚RÆd&*Œ®¿%òçQ7=PH0Ááh­ñ1,},öE—úÚþJ ¶œÎU38)/VåX!1#\ÙÂO¶qEg*!åŽryž÷!'·ðâ¹D#BŽñ Ò(]eÉ4xV)£ 0ך…j¾ø©V­¶¬gßX]¹ònrö,ÑօПÍvG:+áÂ…ò¬ò@ ú,Ìå‹ÃÑüþñ$×`Í>"²°lb¿ãµºpÒ¶ënãÈ9}ÈO§D篛6kâu§–f .œŽ©ÂÝ`T&³fs1COȇV;kùiÆÿÖ~tt4c¥ÝéOß ЦQe ƒ2íŽRÁΰ¢*œ›‡¨@(íÄ@Vj0QˆŽÝ 1=%Ñ í…š°æKýÈ`>;šÆª¼ÍF½)MRˆ?‰ç|¯w²‹Ñ¤?\îì´–{çö–¯^Ÿ®ÑWO=õ”ÍeÓ¸yAvöÞßÍ}ƒ—.\·ÛíkŒlaÜ®$Ýn·pîܹÜááañ¿ƒ±Û©µ¾=/Ï÷åÊö¤Ù:Ç0佬Âóˆú–3ƒ­dÈÂ÷¤^ɨÇBž:gìû5Ï_H¼Îî©äÌý÷&S;ø(þƒø¹rŒt¡¨]:³ãÍDѾND iŽÔ+1CWeC?r}M¿,Qdÿük3T"Xir0ûС^ÍyÚA }áuÓ5èç0šrô/3*®U¨€7òk·àžoOÍÏç #gyÔOJÝÃd8V,Wÿ^wE+•òÿËß¹|ùÒóD¨oó8WwØêäë¹aþÞÑ(ý ¢2==™ä›S¼¬Ò)ÆÄ? Á!úÓ/™´Hl7ÐÔƒ¬;ý»ØŒx%àh®ÚÌÈ&ÒK|Ès‰{–¶&‘ι÷¢‘]`áÒÝG8Q’–ëë2:¬úU€I±_?„û ûGèÇÇÉ w„•ÿFrkùhØqäjƒ6mtáúq³ÖXÁõoTkÕ£z³vˆaï.?„L™Âú§µZåOÊõÊeôþ©ð¸¬´ú fŠ`ñÄåƒiîÙgi±÷e³ñhÙ¿½öÚkSÓâ²OýjåZ»žKÓ­ÒjufQ*}f\X<Žȩ̈(€O©í`Û8—6É°ÚüútD IDAT? ‚ú1²Œ7*ÂHÊ®7 ½ZÇVG(´ZxÖÇÖ]òkN{*êÌ C®ë*<§}ÃÝ;@„ÛÛ÷4JôY† ”ªba§eïÈEÄûPÞ¿¶x+zÕƒw‚&„”ª¤y• ht7ï›Ï3“TA3WfÈËQ’<ö€¾Çå°QÌo7Zp|¼])|foVPôúd3÷bfw±üL:™ÿÆrQ<3ÀŠìÂføÙÑs©1ÆÅÿhoZ-ëFO ðo;ÀNŠŽãh×G×H56‘}³™ôcwŸÚÜÛ”ÁuÀS¼5nge› 4dµ^|¬ñA¸2€©§žúï |W¯\L®qX}fŒŽ=ª-¸ýön'Ùê4—­Fs ˜·ë­a¹Vy¹Z)¿Ž¡ï5BY¿‰Tp'œC”½Êbq¼û¿þö ÷üó?97ßùAyäÃc»ÝþžÕË/—/¶Û÷ugß›Í&5ÍíÙ$ý̤ŸVFåj¹%kÕ@®‹Màðàb?MŽ1xáàTØ¿†p*iŸ=“4÷vƒ¸P\38Î0£Œ Ì=ÓÖ4v g¨ô“„7 ‚a+|90/›ªBHˆÆ}0ø€$,Ù·ö:}†D|>†H…©(Ä<ÂdF2â€aê³ \'™é’<À€YegÆÜ^{»SÍç?6ëÏäÊÅ+Àÿu˜ üánwŒÀǯ^¾8»<š}¾Û]”{#mÀÕ·?,A]+YŒn°{‚Ó‹ì™.f­;-Úó*m‡fžu\<ÆãM_‹øÁíIyò¤gF@òE^Ž!þ«÷eê„Ž6E:ÔŠ\K~•5°s ã•G; mà‚zí!ö ë_ÅqçCz]¤]QU :í*ÈßHv°‚Ÿ>µ§A¯[­Ö¿Z+—_C>Ïœ†+ ûåÉbqél¥2Â’>;ÄòóŸÿ< á+_Y%Ï?ÿáBÍOù¶¯<öØü¸xñRi–;ž.J/–«óvqQ¿¯Ò,¼P)–覆šŸÂ5ù7ZXwë yV;µ¤×Å Š-bÁLFdôàà(I··“»Î& Auh¿‚!ðÐe"ADÒoG¨Z˜Š`ÁBFt1AmpŽ‚$bˆ³ÀÈHR&õÃÚ!Î5ºµÚ¬-÷ß::Ú†/ó,5ûð¶;‚ðáå×.^ú4‹|N7Ýrp~îÁQ* õU#?þúX÷Ljö‡×Æ;¸ŽŽ{…q}™cÎCw•ä­í­¤Y¯:ÆõN³5@x«^kÿ—j½òƒN³y~2°°uO=úhó•ãó°Ìçµ1d»^¾ðÊ…ÓvëRµ29‡[ó[ãtT@Êy¢Þªß]gH°yxœwuuî£8¡ —á.v‚Ø'"¶iÿ*áož›¶‘ažcæˆ=Á˜ó†AÎ>wŽåá0D˜65$Fq”r³ià -Ü[¦\8Ú µÄE¸D²í6ð p#•Üñk†9*Mƒ¥ÓˆSp»ˆã–ó;Žø¦f¹Rt¶îŒŽêöô7q¿­TKùà¶;‚¼ráÂvõ/ÎÓé—ÆãÙ3 ~nŒÅ1-Ñ€„©”¢‹øJÑ1Y'Ø,ÈD/Û=¸¹7<÷à1γNô|só=ÈOzLºè€b ˆ|ß<~ºO>£þ8ƒL/¹Z½œÔËX~™|stpˆCzoáÉw#é㵧¨_cðŸ’Áñw··V[ÛízñE–¥þCâËýbðÁ6Þ¨Ìç×OÝ}÷ÑW¾ò•ÜórùÇ6{౜sýõo¼~¾¸ÝøA»Y ÿ ‚üÃf­žÛjwò»ƒÝBI {ÜOàþGœ÷û( öÔ)øAÒ9s*)c/©2,j¯ 8U€aŽˆmæ˜×¯‚12€°Ûi´¤ˆŸÃÄ?üDÀ­:`ø³È aöd&‘WÈZ÷ˆ„ABqû„ÃË%cÔªäkWWF¸å{ÊÉ1öÔ¿¼³ýÐpP{Íö­_|qøôÓOhRÀÏ”|lþg½Þöqoù¹þ(ÿë£éâ¡aZÈèá1z¿»Üßù׌ZG£‡eö–ÔEK©íû*Ëî êœDG˜€Pfœàf.ŒJÑ餋øøÉD9šŠ´;Ìg#q+ŽZøåà^Rá­ÿ%ôÏ’S =Æ u|ãjrýªcúoC®á·0aÝùœ¾‰ŽßNvww’­­-œwóJ­òõr¹úR­Vþ&±ì_'èÆå]àcOšø *q‡Šø4Å_h[Ϭ˜3ü\ósË"®qtÁ¿buÕXîŠåÏךÍ/5-Œ Ýð{hâ÷p„Dâ5;ƒÃØCx’Ö'ÌsŸÍwƘ¿CzU‰üöS45kGŠ´?²™¶Ißœ®ä`yô5,?wâÝGGÆcëç‘76}w3=ÜgyXýž¹Üâá…!š¢®,’kW®%W.Oñ蛦ýèÁmŒW[Û­dãÕ©Ý=yn´[­ Õ£X¨¼5žNÿ´?ï³~ï÷~/ýälr96ÙtïRriT¾Råëù.„àÛø>ÔªÖïNÇãF½ùÌöhü¤.ÏW@þ«Ç8 ‰uÀìHœ‚™nÌ!Rì0Ñ(_uLƒ¾aÍç,²Ä›Ð±ü.æ…ZòEÒ˜ürB#·$ïyÓ\’~]¿É J8- àLv¿ÞDv/•46©QWŽoÀ%Ø…í{€Óª0#YV¶+Õ§ý6à?>ÿ!I}?3ðæ᪃ÄüÐáhôדÅ3Ãɼ6œäòl=,åN?®Þ«þoƒÒlþJmÚìg'"x‘{Lã\©Pî¯ÐwèÓï°žN=ñÁ\ý‰’K õNCcaìgæ^?é"ê\{7éaðKqøpf_«ÑIvvÚI«Unïì\i6ê7µÆÐõ¿^*ÔÞ,Õj¯\ÙÇ1g,2XãOÚ¶þn¿}úÚòµ^þ8?&‡åiùÝb³|—™‡é%„£2ó¾–æJņ¾õ‡ˆÎcT+]ŒíGcùµswkP G,‚rb u1˜)ª™_U@^w½{Y7 – +îVF†\\ØàÄ=æ˜ îInCþxš‡o‚gô¨ ¾ËQ,NƒÄ3…ù$ªê}@â)·Z{ç¥üçÿìÒ…_|óðÍWÞyXƒàºýÌ@i–œBºf8-ÿ­éªøÙ>Ñjz#Ý}/%:ÄTîO+kÉ Ü¦².²ƒìA®6=r˜\›N¦wµÚÛäÑ•äÉpKýŸt…`d"?÷h8¡¹¤Éãȹâ½ñ÷»…`Äã¬(\Æ5µÈ0ß wÖÈéí7±ö_M&8ù”éåmtÓÓ§wV;ÛÛ)Á1ÞÞÞÞúfµZý³Z­ù= ó-††¯1öŽŒG ýL¶Gò7ý ü+—^¼t¾±]&´^yP©¯0£±Z¬V$ ÉŠÅ£Þq~ˆ/EÿÆ>„`˜4lîšÔèè*¢˜K|»Ì·‹Ž†HŸé÷b²È 5°b8pŒC5‚û“Ð ¼7‹'”—­"EIALÏšP€J^'®<“d$¤`ˆ:p@Â(tFýRµöE\Ý„Èöñ%ãiÒH‡£{Rby4öMôGW¢ŸXþù òð_Û‚ˆøvVÖgñˆé›=XyI§Ÿ³<ž’éYR<´Ð& ÏÌöƒDŽ˜ÙÇ°$×Å0uùòåpðÙ¿~ )a ·o%;ÛMD~¦½n7¦\ÿ>cûÄ|ý?.jóùÑÑ+ÓÉSOõï¨ÐP›Ï¿“Žw=uWúýïÿ{ÍBáò´Pø’ÔÛ,¹ö41 ¡P)ª‰Ÿô5 ®]Â¥¸Ú^|÷RÒdœ½sj7©2wÂðemT4݉ml˜*ƒÌ®{ˆÀ`Ù0„ü™?!Á$Žê&X”iñþ¿ž¦•Â€Éh™·^[ôžSJè‹fe¿Ù4…”9ú€602,M›-y­®—õ‘y$ÚÑ1Zþ%A´°ÇÜí(œrÈÏP€´?‰`$ªÿ Xy¼ýÒÉ%t~fï–ëøú;õED·9½×^îînÝ}æÌ·­ú›ÕZåûtò¿½÷ÞG®}HU?Ömç´dÃhõ¦—.Vš•w·«­ {Ïìæ+ÏíýÕaîâàÝdrH”$­ítgç‘Ƴ µT`.èî:)Š‹™ŽL%Âb>p.××Y)p#æ8$$nÂZ”å¹ð³†Wnf3¯¯”ž¨¾* n=%ÈJY·v-•”sˆíèz÷Õ…HNÛ{Ÿ[Õjo2Jò ŠøÀü>$@ÃÔ¦ùù2_›LŠ›Ö|b:c9Q[§ˆCŒ`ÈÁc*†ý0ʼn×Ñ|³ÍƼ}£+2äÞ$®=K\_ˆÜAÖDÃ^p'NÙ¹ŽÎ¼…¸¯½@Ÿ'òxTjÐd‰r¶}?9¼~ɨŸ‰ —‹js2í/Êéªx£¿ºÌ•öF |Šr6áëõ™† ¬mêO떺բќ^fwôÿÕ¿ñ«/¾õÖ[W|ðA}¡ß÷íC!¹ÜãS\÷÷îýÜCƒñ¢ÙcUÉÁ¤ÈaáþC<ý ò «d¬)gÕµ•øæ«h@ÿÖÈn縇Ï6Ùcþ>ÏÄ4ÌóUÈOÿ…7  Ip/B}ñlDÆå(pœùBÊaAñéèÖüv}s˜Ðƒ¡ïÚ¥·“ý+çÉ•Íà;wv›¹ú­ë{»í¯œã÷·¶ê_?<\]xꩇ>=ï;Dþ”žý“?9xýÉ'ÓB©0®o7»óráb3™üÖ²V¾KŽý 3.YÁPã ,Î-ˆ€nØMúº(wƒQœ#Ãq‚æÞí¡ò¡&¨û»¢ÔMiQPÜÀ!0Y@ŠD1Ÿ Äk?‘}Ãt(˜sÀ¸eÇÂd‚ró“‚ö.g3:ÖL LMV2Á­¼xf>yK`µ“ëÜXÇÿ‘’>ƒà‡BìÓ§Ÿzzþ½wʳE¡1™Ì ³èì–t~Ý}m8™¶ŽNñ¹Ÿ~£…c º+µ¸m'Mia³KU¢Sè,>Ç»Cì·ÏÙcè r‰©¦ ,ÌýþõäÀÀ݃0ØÔ‰ÎÓé´LÞ¹Àl¾— Óõ-8ÑË„áz穧îÓØ·®HTêäç}nÜÚ“¥¸ßÇ9ÂoY°äªý PòÐ  @Ÿ.X!%‰‹yT 0Ò`ò¼'éc€+Šp:vÃ8Àç >ì|C?¬hÂ[ÒPBä' hÉîmÒ¹Rz.Ï­@ô3súÇv;DðœÄÐ#’Œ˜>½_mŸeÀ¦>-w–ÓY“•¡‹ÄA "rj§ƒ[AU®‚dÄSÀ± ˜ãÓzL°ù@"v ¨&’ *ðÉ %KP• (¸…ô'¤ ›¸ÞM¿m¾-[˜_`4›Q—#ˆê„Pq­N.ߎÆO‚ß­ìÕ/½þúëçÉfÜ…÷mûPÀ¥K½mÂúý?€…ÿA ~Ì_‘bܺ­ÔvÝpYÓÙ°bì훨ûSnA¡7pÛs)!ë?ïÛˆüA ã ׭ˈ{n$Ý£ˆ3Í0 Õëå±ñŽÙ_…ûŒ/s~é¾ûî;AþŸ²[ÞïløÍ/Ùõõ9pÎE)i3ñ®Î|ÅÎöî} ¹Ž‡|tn…½ Whâ1˜b¡×ø\®gÎÄÿ¬enqû÷~•TÓ=rÙÚëÝÃí[\Û9dðf炲)Ëç0!\üÈð´N÷¾û¡#»œeó\ÆÑnÞ¿½¬â¹L6Ã!Àu\uÉ—° ¢ ´ê÷ŒÆ£ÇXùùÌK—_Ú§œ÷-~ „îÝ XÅtQ9;×!]ÔÎg¬æ;­ û—Ñý™X»¨ÀýËAª¢ø/ms_7ê«\´ûÍ.ñÇ/Š~QÌÊè±Yöáúì~0Ùj*r]¤Ñ© C~èƒL)Fäéãš¼Oh*fõ'1Œ´Ç´ÓíÎö€…^¾†ÅÿE"ä^ÄCí}ɬëÉö—oÕf³yÌë+µJåû­fë?ìlm½yö4sp·[bH¯$9¤ó8v€mˆ;úvÂ"s ИM%Ö¼£Í`M$wW…„0ÜV=ñ}³¾{íÉù77=úàís¹wÑFÂMXÆ8&lü€aç>ö€^:9Õ§Ÿ!\ú/uªw?HÑ?TŠ…ÿ嶔€ü¹‹_iÏÒå=øÏ|n>Ïï:æ?Åà73¸'H讧p†Æ|_§QôǵßûDå@ô ¼5õ7ë~£©è´è8;ÏsþðöÓ@¡ºb–àúUŒ~¥‚á¼z¬½w#é1æ¿\²¼Á6qû˜“~Ðél½Üªµ¾F@W÷öözwÒJ¯?®}>iiª¸\³Ðê21_élw¾†wæ»g.ÚA÷7–ã{À’¨MEÜp€HÐÀG î BŒA†vØ`dž¬!À~ª À¼6Øx î~ºVÆcÔ‹£#Åì†cJ<’Àˆ%׆,7šN™)›že™–'æéìž›/ÿé^óçæú@ oÎ׋ͳÅÂì¾Ù,=͔ͺëÓÏ1,BÜr„g·=µŒ:[*°ÝÀ?±ö´úFÒÚäQsû±bnæõ9;–]q?&þÐùvB´ÅÑ¥·Yƒ!?Âxal7¿Õ¿Ùjýá©ÓÛÿãë÷ÜsÏ•Í{OŽwV «w®];Ÿ›Nÿ„õγ®Bo×x §Nv½ —½µÎ¡°‹³º²ýoœAÇä]òÍaöóÿk@ù£í LC1Øß{ÏôÍ.ëW^â' ^¸@Ê,F\zÉB«áhXHgÓ3ýÉhë+ÉW~¨´÷–ý¹â ?˜ƒû_,æçø–sé¬TbÊ?ºM•5ýÞˆ¥f¡  €d…Dàì?h/ÚTëö÷ü‡2D´,-Z„†Îˆ³rçñ{óí—“†Ù‡å?Bx3RPŤZ$vûªcÆdԿª=ûx2³¬]IÚ­ÊQ§Ýø.gȔމÓé8¿CP'ÛÚϲ&B¾Õê2ªôk$~•ŠÿјzgÁÙ&4[v›#èhž™h¯Å0a‹pî €¢¢Æz2 ¾ÉN¼€›d’‰·¶€Á[—ï=[—³~ü¶{‘×ò>WµÒ¨0f®À]5 ŸŽ«£ÉøÑtš~ö¿=øŸïúwË×*·ò—>Ý`Ú_º€?çÁ<~ÍuÚ§˜Ðƒõ¿˜Ï°º²œ÷t^Ž}¶d–¾Ðêÿü ì] U¡D«ó†õ­äåQªâ?]#Ù0)£´ˆ‡#¯7A~,ðžLìψ@EÑÀjÓÙ1óù <9¸„_“2JóÕV»2ÝÞj¼½·ÕùÏÕJñ«ßøÆ7¾OÐÆ“}Y“ÞÑ¿¿ýÛ¿=ý³?[¼Õ¬¿Ù,ÿß{í §¶¶'§;[I dËc`Y´¤ŠÑÍŠ[8~ÕÙ+p~gnŒÂ~dÆP&ò)e†¤¹9®[!KÿÉMÂS7Ÿ»—€Š¡h„Ä/ ¥N,( ‹{ðpš–'óù§&³ùã¹Õá§ëñ}Ø>0pá… .X·³Xγ˜_|i¹˜ÿÀe£_w7ΗJÏZâÏ·6¿'å=?Žú¾'ÃO¸ˆ¦æ'krŽœàJÊž­ÝæDŒC‚NNPSʬOÇÒ¬ÓÙþÎVgëˆÜûÍfµye­óoHÓOxÓIòÐÚž{î±ñ.råïTêµÍš…/>uj©x$‡åì£P`³ËEù IDAT%åXb`dÀK®1ŠÀHž}Í-æz baóÑ B™0Æqù6÷×éÞËb dy³Û’FÈ°d«.t&e!™q cÎÒñ+0~zÒŸ4n+î/}ú€Å½ÕvyUfæ_ñ>bèv¦‹Jn†Ç†@Äcýat쓆TMÚl›¦Ø7é?ùxÛÛLvÚúÏ$Ë‚p‡Î/Ußì%¦—‰ðÃŒqt¯>Ã}Éxpˆ¤@´¼v¶š‹N«v…0Sotjµï·O·O¼ü6mü9‚dŒè–zËJáf£òb£VýÿØ{ó_I®ëÎ32cÍÌ—o©…Udq)’"%qÓBI¶¼´(·ív{ÑÀX ƒx~ðOô–þ€ùÕÀ`~`0?4‰Áô@€==m¨n[^ZÔJR×bk¯·å[fÌç{nD¾÷ªŠK-¤¸ä}/2"nܸqî9çžsî¹ç>ßï®\î&¼“W¤  «³%úwqôê2&$R3E ‰®ƒk¯kUåèÙ¤sÚ}*´àr*¦%ž¥¢:7c D‘£L±—M´á‡ÂÚk¨Ïå1<‚{ÿÓ4XNÖ|ë2ÿ™á?‰ÿ ÊØ"ÿÀ¤û( ÌT\¾~•Õl{¹¯ˆ‘h3®*Ö]ehù'19úÐá[`…÷ŠNZŠÇ°:>ºàÍØ3É”õù`kÝy%ÚN:­³§·/¼qìØ1­á¶L1ÈIëá{¾tüèÆ ½n÷g¬ÁðÚ‘µõÑ‘ÕuÂrÑã¢Ìˆè¬ `Rú~;DQ88‡Ft'š* θè²ãÜtQÃ!.¿FóÂA׫iFáÖš¡âÜ×àªÍ<´ÛÕeI–€á@A« !ü `Œ.=Ô¼†²¼›@²¿šMò;ª§>»Åô¾0€ï~÷»˜ÔX«!/»4Úg4íÑ ²x)‡úå¸&5y;É/û†¸àö×­:T¯18ù_¶æEôI·@'þþ¸ùVqžf—sO>ùÉŠØ+X}œ‘vg¬P~ÆÿrÒ‰^è÷z»«D R/Ü”õ]x*ü`ÉB¶ü –„ߨ Ñ„‹î¨±ÕSãu©«Þ|ମæãcÒ{a Ô{iä,cØÔ^–—Lzh?÷{à ÛTrƒ'·< Wú¾П•Ñ]Ìs~(Ï+^ØÅúCÚâƒÜx§œŒP¯za÷5ÎÀwÕ¥ëœÖÐm G‰æ~W¹còÙ¶`inÕû‡, Aàh–b™êÝ+ A†/@Èx1ñäâdˆÅÿÕ ŠAibµ»*–¿MÈ 5À»Ó,+ö³ÞêÊ.C»fëÑä ÅÍ®jAt1CÂÌ)°=‹¡;‰rñÙû­Æaáqa”Ú;ZÜrõESÕ›kª‹c×9ò«÷A4v^³DÆE˜µb°YA–f«ð„{fãâ8·Ü ßvWà/Ù ©÷lþJ^”ÿ*+B†/b†5ûÑûÅæxâI„šÉòɘ ¯'¹< é@É ¢\‹ºj¹Íò¬€Ý£Å6 õm±Ü¨¦…"§5´vŸ¯µÙðø óBœ{¤ÿ·ˆïWf[¬[‘h² ubü# äZ·ûB¯ÓýL`úáKçO]5O^î?ºè¾óÊl4úÉÊJµ+°¿yÅ+GÆ@­àÌ’æ¨ ó¯€1¤l ö*g3¬V·j\5(:ýNÒî'+Nòу/¼p^qÁXM7ösKÜãzJð¥A|Y‡p7 CT€ª] ^™˜eÄ/fËU‘'ø\“—k.]/ã`QU¨œºr= )°[fÜ‘u}‹Ä¿æ‘0)DKO' !¨ãäŸâ.[ÜúEt·žzê©¥»ïõÿÑÌS Ú·Â8þñ ÿqµ¿V¬ôV˜†?¨ÄR6‹…#PpÇnHÐ,ú˜¿øv!›þ÷m‹ËWÔÅ 'u|UöÚf4RKK¡IBŒNÑû3+5cq¡b}šeDßP'~š®ªømNo;˜L¶8Ö!FúzšÕ¤UQgÌÒ:é6ÑB3@–”ÒõÞ\æý]“Ȫæ5—,ƒ*Þ÷ÝÚT×¥ËIÜc„‡$¦”1äÇê2 Oˆ}Lðaåžþ6+÷|ñû ½þàƒ‘,ɺc™>ú¸ë®»ÒS§N]¬’ÖßÄqømb9\êõz*£?|Ÿ;‰þÌ'° ° °ÅE¼Ñj>ÃQ°·á¯Ú™]»Nþþ,ŧðïÔèHô”¦iÚ.²ìŽ1Oonö¡¥›6ÞVàé§ÿÄßɇ½¸Z;†È¿‘2äWâñWVXÿñøÓB.Ü·ÞWbÇî‘—NàW;ÙQ@@[0´êû\|µÊÀMuTé+®Ö}Íó÷YØC+VgùÃ~èüÞ¡Õлãá½zñ4 âûQòãÑ(<³±qײ÷¬?>©bî´ÊýW4Ø¿²º²Aîß]I:ð ,p èm° ¾öÑ)3:œMQªÕq‰( ÷ÀK“n6†£†ÇNéU’Œ›¤C·¹°cr‘/ä!HgÅÚ‰Q³ŸLY!ñÈáþ>½{ZS¡ojˆú¶2€?ùÕÿ9zaßAgÿ%ÞÿSî Ï;E_•Èo›}£óák>öúû=`Ôä~ýb‹\Hc ÒËö¸ ýê,ÚÖ-ý5g%Ù"Ÿ° Ùe zÿNEœùóN÷Ç'y£ÛݸÈ|ÿå4ß|?žkFŒÊ••à­ H~GѓݘeÆQ5'C ÃBÂ3bèÌL°Û÷ã¦õaîGÙ/½;Ð a¯sõˆ¹XÜAªÄ^Ujª0£¨¬iZõXZkÝ™–­SÔpS ඪgÛkL¨jÝͪ9ÿœ×L³šfTÜ«DÇVLvƒ‘>LlÔNÞFûâÁBZ8§tÀ2ÕÂô‚.X9~Ìš«9€úd˜ÀÌq‘áG©×ïÍÑûÄ8ñwð;ó“ŸüdÔÓ óñüÁ›iÃÑ Iâ‹ÄÆI\¢òUŠø¤!8ŸÕ0¶7ˆ õ‘ÿ…À¹€Œ!ªù:ÉTkó…›Í_sU*j³9IC6*77@^´3Ô æ0”ÐçL®#ıw¬œæ7í|;%€VéOVyÇ;Ò¢i飒ðFEÉ&)Ç988®Ö|òU{qWMði`)uÀÒ;ñ©†hÈãåm½6»Ouž£nQIK¸VSSBƒŒå»c¯‹Å/ ã+Q¿õÀj8>ò•¯Ü´eÕ½üùÐC g­Öƒ`÷G²:¼’ôˆ¿×î™I]™20J‘¢E(ÆÀ1§ŽÖä[ãꢯÙ÷Õ¢}ã ûòthS“×àº].Ë~ ºu³¤f ¡Cøê°´Á侌(Çq”eéI+\¡NB ÞøªSïDYÍ+¾§=/Ðf9æ>cm}­õWâ h+üBÇHUö1’”0î“õÙÚ ]Ô#ëãfoÌAùW%‰û–\ ¼«Ün¯9ªœ9Ä Œ¡ â)þÑêu'AšÄñißOu½ðìE¬ƒµ¨xÕÖ§'\¾|‡:Óó¸¿Ôë­¼@¼‡Ic`€`8¤U¡¤Í A {qÝàk!‡ÍÙ»ï›ò{{££¤gzO1‚ÜŒÌÄ)ˆ—ï—åìѼLï"`hW4øîÏ9Xâ†o8x»;û‹¿ø‹6+˜ÄA6[¥Ë?4§Û—eݼÿxq[R‰¯ dèÐÞþj•àzu^/Ï@Ãö×KFã\tMÁ`rú‘ï¿ÝDcêšBÀY%n­1׿Û랺ÿHHïŠÿô‹/¾¸ìý¯àYÞ£zQœ/²èðYVºÀ*ι&)~ ×À9íHö‡üëÍåK­l° ¤'p›Õà~tÿÛc쾂! ½w é·XeìJDéJ9 -"Dá¿¢`!¹‹)ÏQcR%!ÀŠÑ#¡ŠgÜé ðùy`¯ÿcñâÎ\ª€Ç˜–³¸ò µøÎhH)d¡ÂwغÀ@7»NÿD¶ |MpRï§WA¹Q•p£Â…Ík@4æTA{c:«½¯ªéOo xðÁÃÕÕäÈ|^ô´B+6÷±<Ûùü 4ûÿÄèšÍáGã\\µÙàp„îqç°fåg´ëÔ£sÊØÔÌ}×ôU¥$ú7›_(& Íꯟ«©ÁZ.ŠáAÄ,R°\+,Ó'ã7ßL±ÿl2GäÅ(Ow‚ƒ0þ/@Ù‰Xnñ¿1 „]õ&ôÕ¦sÛ»]Cغr Õeä5'û®©vw*¬R㻂ôª€:²8£ ›)ˆq`=MgwŒÇcÄæK·…ðÈNø÷@ÔÌRrÆ?­Á®×ÖʧæhŸ!¢…“!žk«jQÝ#R1ŠÑlZ)EÊ»BïiW•­ðä³c+·/_×ØLÚØÄsÕFFøÚkÃØ’ZÀ½¨z `Ì—±¶8e-€K++ám‹·~cÍ°,ýË„€|`–w;Í4à‹ÄÌXÿZy€ß\ÆdE2c f ÕZ ò„w¢X6á}}È°qâ\yÍÖ\rÔ¾¸Ñž"V·S±±:WI×bö‡‚ঢ7¸†ùïHžä¿PD;a5Ï™›6ìÓpT‡¶  ûß ÀBZ_…À†Áv¿ì FR±W×&f@ü€ ˜Q{¤›n,Ý  åÛñ´,7pVèhèO1 ,Þ9Üq¡ˆn®§½#Íwß u}V/÷Ñ—[žã®ûê¢\KAFŽÜB…p+)!%`´©0ÞHüX†±bþÇÌ`y¦\³´·ÌºËô „À“O>‰ÐÊHß~“‰a/AçÃÑœÀA4\\ê@èLª0ÏPŒTçò¶iÁÞ¶„«kÿec5ר ßTžsµ*€WkT•³d·Üýà%¢ÿøE{Þ-§3€¶’dáeh9ÿÚ:[ʆóÖsV}†÷*„+Ûà´Œ´*ö\û7 ß•«‡U†û´iÈPõZ]¬0Ô¶aCê%ßÌØZ âñ§ÓTtÿâgT ƒ€»'â0•.œMµ¿•–Çh8ðþ“'w‘d·’ ½K$¨ó™:Æÿ0¼O€KÍGî½€à#¾¹Ð³¯ùrõôÍ-×ÛïU 9©·šï»*.íþx=Oe04ý ¶q Ž0ô0 dšåùÿÝnùß&~üîp¸”öò“wȘ« MÃ(Ø!>@Îi±Ö†>`=ÿ~\mð× %¤$ÕøÛs™7öÛ€Cô}÷ê0&Z¦Ù“@+ø<8|øWï¾Ûy2í»åoXd¸º2"8ã]Ðýoœ®B9N(B×gì%;žâ:ãíº½?åjØ핾ÎÅš÷ªÞËÔ5mâж™¨&í¸EÃIÕ¨1aãXšKõïç÷^{íüî[o½µT®öORBFáí ŒòªB%ðÚ,g'µ…BÐ Æ@ðK8¬?Ù¤ö'—ëræ{Ⱥ¿ˆ«cRíJæqèåj£J:Lϱd¸' —µ©Ã üð’A¾Úéntï» ±˜¹îï1Ý2ÐsðNÄ#ÑgÂ’7`ËoŽ(®e7Íû"×ȃJn¸â Qʨ"à6LÃĤ"‹p¼8庤٫ ê ¼ƒ ¬Ç  "æ3{ºÂÈ* µß¸{àG>Âh>O_ýêWå -Ó'­$IÑ7$ápŒ Kô8çN+Ä F€n©¡ÁìLz¦ð˜UH†‡œ"Iä' 'ß6QOsÏ2ºœÖ51c:ü½è„|ÑÌ.`T2BkA0p*€­ ˜ú%I0¢}[„¬ÏЇ³É„jÇüê”?‰Pͤ ç£kîCuÝ•swÙ±îk®7{«vß=Í3T¿mNÐãå¤ÍZ 0i¨P†A&R¼E|€ÿ¦t…%Ì`Ò˜ —€Ô':­b,À µ1سä€ç:F ¹œŸ€hC” ¼¶c© û6I£Woš¤¦²¶oŽuÎÆ3Lݨ„$‘h¯y$<«C5;P»ªBXÀ 1€[’ä|áÂBìàC#O|I5¨ ·y]Nðè|÷ºY;æGÅ8÷hnqù{g{G°Õǯ˜„nÖíb ÊVÆ{€Òlä7Õ‹¡åü§í8øßñ_¾tâÄ «eïË£O*Þ¸r%]ã+ ˜Á|Ñ”Q9o´Ž@ßr;’Ï<I¼‘ ã7¤ú©—&¿“E×/J5 ½ ª`¼ßÈGý:.bs`x-„fs¡z¿¦6ž(U `^•Ð>‹+ˆÁ ¤*|z«ôx:È.zƒYÙ®fšPl¸DrN<>ëî…¡˜ú ›© %ò¹NôwLÒÝÀ53°ÔÐÒО€`ö gSÎZüSÓ8µ¬wŒÅ?ôsÄ“ N^àÏw€›gËáû}v4>¿sï½É°~À5^f|‚ @ŒÀY9Mpþûù¸XgŒé+àT¬¥ä!Èm.^àŒžºÂ'[¶Äÿʉš@ Ï„P†ßŽfBQ4 Ü5üux ÊE pôa‘¬ÜÂŵbãYΘΨï@àÝ cvàN1Z¥Ö öög·ÄD„OWOÏG_B`u_\üŒš`4æn pÐÛšÎ"N©OÕŸq0ŠrIU ÛK5(3ÝÍó›’<™?ž‰8°.0~ãc¥ÔT!¦$£Ž«cS+è‘&ôˆïÆŽ˜µ&uhùry°¶qfkÃÄdV£oE›­Vó¼ÅÜ%i³’µß=Ý¡a5Üõ¦ÄQrï.#… $¼ž›p¸1‹%4&‘FÁ¹ÈÔ}¸1 ^š^¥Rù«“csÅö'=Õt31z`dzšEu•?‚¸&¢”éV,Gè/ÿµÛ_éòøð“V5|íµ×FˆÿSäÿJF Ã6{±i†  wÓa‰—êk>+­X€ˆW8«¡gS j\ut¿6k‚·{ÄøÓ¿ü[ÄPÔA¶±h£gÓ‘b‡PŒBm0Iû£9@zšNûÞÓ-1=&ÅÞÛ*™ ȇBƃêr³À‡-- ß«“Ï¿\î‰7nTD €àä(²F]ØÀ>¸Qô@Rýbzúz-&+†c‡¸%ñí9kÁóŽÀ‘µÚoµZþ[ptúôé}/t ÊåÉ'Ï<óÌÏÀ!þ!ÜÄ« Œ|z]l ÝmB/<—gPíqê¼_ÁP‰$á¢cê™)gį<•Q ý¸R*ªËvG}l—åäP'Ë+ðl¤W$Z”ä¿âbc7ÜH§€ó.7DÓ7TX¯~uêgY”ñ`uÚ-¸Ïd›V;CïFߦv²Ð¿%œÔ@~Ë6!Lx}qH}¤K"b¾…óæz}a_™&gÿ^÷ zLôÑ£‰b18¥†l`Jtøz«–TSô§_ ,œÞÞÞž<õÔSK°”Ëc€0>!C¤ØÝÐçlš/‚ÚÈìQè2ŽèñéçZ¨»mp[8- &׈V]WÁYx ÃPS×4¯a Æ‚¯5-Ô{å)µ*"R¿:¾¶–°ƒ–XІ¯cæ¯Dر´–…TúYêaC$ê¢é*lovð‡ù ª3 p±8íkù é(Ál’M¬%ÆU‡}0ï¼pRÞ0ˆ|ÖÛŸÕ÷ ð∾âÿó`MøCÀ@åÔ sšF¥nùQ°û¥'>·œüóöPýD_iå­)=1Ûº«ˆßáA„1#s‚…4ý–s×%ÏTW‡ƒÒüu}¯s»œ"v1ˆlLö®‚©í–B‘J )¡ÀdÚ¨ R- šx›‹Wञ­Þ4Â1ï†hú† ë÷'D¥Ö×¾ö»¸N—XçÕ¥ï †Ë؆¸"ŠÊD~}–wSÀ²$¢å@*€þêLÄ;­.xp§êUK}kº/¶Â9ÒQ)@`­2$PPMÚ-L7þl̪/˹ÿ¡¸<ÛÒG„¥gCœ¥q˄ɳh(´†.‰xIÇ¢NL„®M¤zQð[yW÷úz„ðÞý¨t#í6y:é‹8ƒx ñ_*€übžËQK²o©2fʉ @–¶÷žn‰ *yϜ鴪IGÑÊL×~fÕ†¼p$yW0i·c㚎Kê•j2—e€{·OØĦlËÏ:0¡$"Ú–xòi¶‰âÚÁŒ—U òeZBàZ|ó›ßôþüÏÿ]¹yéréC}™ „ìá-†8;Ø*6u*Âc\`ÀYöµà€ê…0é˜Å šäŒóp˃Øáv¨"u1Õ‰üjÌÅÔaSèXaIÔfã=`!=©b8R±YuÛÇôQŠ²¯>Ý^T¼Qãñ$Nfó¨Å¡0¯R˜<ûX·G$çæú~»À1yd½k2½¿.eÏ7dÈÏ AÞE¿öLå‹/·f¬ý"~¹LK¼#ÜX»yô wÈ©‡ã¤°!aV¦IàPä  áE+ßð´ÆmCHa7—­„h¢¾F-u>4¤Ù³ü‘ÃsA“Š0¬I½Õp`~‡A3’øcw€”½¬>Úc  Q܇,Ô„wù”«€§ˆ?ó·á>F&QÌzw6ÆÄ“ÛKH†Ë´„À;CÀ:.pR=­ü[À`s–=\“ª‚oêI4áOˆ\k€ œZçÔׇÚöc¸Izž%3)bË’r¡çc`Ç.a,î£÷b~ ½°|½ˆÐfku¤ßúÖ·öWY×upwkDð"‡t à>@PüPV†sˆž`¡çcΰöõ6ÇE×6˯ɫ®Úåšò×ìSžÃý,ú©8iŠ :GÍŸñl ÿ´…ÞK¶qQ9_Ë´„À»AŠ6QŸÑ*çÊNË£UÎ?ÚÔ¡IŠUGÆ^ç¶q.IÖŒÜ\Víàì IDAT …ëPIä-aŒÄÐSu©œÛ‹yèÏÎEK¶Õ¹”quº|z»’÷WqMxÿ––ìï%ÝšÀ &ü¢°?ðšöá¿Œ!=>ÑËyÉäq@(É—§„kØ B}f}¯.òOæâ×9טPN?ŒhIrEK±E­Å•ù\éV(U ëäË´„Àu!PU“º “q¯¦KôyVã¥Ó»ã9ýŸè_ø©؆ÜB[áœH›|×ëççzÒ–Çuí›<ííV²°>ZÏ!’s}/eõ,·ñ^Ü쌲´’8Œžà¹÷O&©ÿÁ0€gž©Š/yÁ''ìnÎÛçfõ‡ðÛ—ÐSN(,¥Á¹ÿŠøçÔ‡Ùë£tÝNÙs.˜èGÇ ·`ËtùÜ¡–Œ‘4ÇÌÒ"ºRšô¤×ßd¸5ž¿Ž®²Áþ0º\_‘Ël¹@ ·åî  žêâÅ‹®#ù<À \†Îæ+,ÐÙ¶E92\ƒµX'±y­c…Ù×äkT-äUžÄwGè8ë-Ž>‘3ŠÛm:äÀWh;öb &µ²ÇÈÈ×Xp·ƒ:+ÇCæµ}ÙŠZp&æ ´ïY_ø†6*À¡\ó@—qKÀ3Ôñ$®|Œ* xMÈý5ü§aö1¤*q_!ŒÐÉ{5¾b ÜS¶>Ôþô‘õ˺s2®Nµ8¯ìý *h0zù‚çÊB*?À9K”©ñˆ¦Æpd¦qÝèpÉÕ¯°<ÿøBâiýÙŸýY›–.‹žHsXdaÏqÊY.,ÇHÛŒåÃäí·ˆ…BŠÌEÍÂo×9Œ^ؽ~†2¸{¡ ³©C4࣓.¨p7kùp»(\â¨G° ½ÇtK àà3Ü«¸qºÏ `4b?ž‚0ÞÏqCI}Pýª¦ßP¡òšä˜Bs¶¯g¹´ÿKYH™ 4ÓF÷Ÿ¡”Xk¥°dÀ3»¶Û9k©!&,Óo_u8”qI¥…â ý1Ý}VÐﳕZ¨“å…¥ò:½_t ƒ”FÈü:ß÷»V_iëÊ5×ÙëfÝW3G0rµJà¯ZýD/¢'ºÓš 8ºö¹GzöYîx÷tKD G óçÏÞ BZ"w{1 ¾)ãŸ^o¦h¼adÔ˺?1 ußξ)fÀËŠ)اŠ£is¥ÏØ;ÒmûÏtÕ%h£¡šð_s/CßäVÙf@Ë<Îñ°"ž*LAÒÀ2-!ðÎPÏ.â–KØ{$ÖèÃ…,ÈaêXèÔL ¬ëÁÅd_g¯ÏÑ4{]ås©JîÍî¢ë’„\YÄzI¢ÙsîŽ ž£ÈÀÖ—Ú ºÆÆð7¢ø<Šgþò/¯O$zƾtK @õÀ™_cÎþö²âLFø"~ÞÐza«)/Gž®³yóŠFòÚ“åÈß½·ŽeJÜŸt¦åÂõ£ ò¡Rc(𧘎6_›:À­!|$S©ë¸~MËÜO2¾ ŸÏX“ . #Z}³%÷ÕT½`žÍÛà ¥ˆùŠ«‰⊄@`T‚9ÒÁÜïà2“‚–*Àð-OB€åãV‚ÈïWSE—ŸÀ/…¼/éÕ·¨'Ö¦u/¥vj§ŽÎ°“ë ´^ ±íŠpX½»;Ó œº;4ÐØ TVA¢Í!‚ánmêÐ3]”$@p•2ï%Íæ¥<ô맺[Þî÷–%žB84d%ŒÎöè^Ö=†€åÈQ:·ÈRÌ@y:w‚]Ó²]:v›–òâºm\‡y8ëºÊíß”'v¡2pWÛdt”Ý©í!ñ&”ÈÊôÕYéæÐîkNhj×À¢TɲH0{Ô*.ekÀ OWæíòWð~% ’Ãü ¹É ~Â÷¹i?ôÐC1=Ûa xGJÌí=}>áÿƒ$€4ž’EOî¶Fw8.lmðÕáºÈÔÐ^8¾€/yœ¸"~±•ãW—T¹ûšg pOÑ*[òwiñ>¿ÊªWp÷ 11Û“ôÒuMNp©Å½¯*-žÖÎoÏ#ß®–æD!`šú@ùc½i•ùt%vn Þî…–ù<ðÀíõ0L°Ô—þ2“ÝBsø‘¸o{è¬Vc%â›4jÔúöŸ(|4â~û"os¥¾‹ Ìo îê™ìÔ«•‹ ‘ x‹VÁ™Þsº%ä×PCYÆpœvæ8Q›~½B… î–ûÆ<ÁS|ÄEå‘[£ì®§Ór¦10 5ŸßyAp,¦¶Øĵ鞽Me¬¾Z<¢€1"Ç~¤¯ÉS‹{ç¸ kZr9ÁÍÇ+Ekv<ËðZ¦%j|quµMï£ïk‡á:ØÙ.èeíwÖ0K’jM|¨o<Àz@GîN0Êõªóv÷X/Âæ¯9¾jou“§$&CAÅú²Y¬ZtG´äßqØ.úâNð¢ÓÞ§ÔkO³ Þåç–€&¬¯¯Šb>ðý¨ ÷|ÛšclÍñÂCÿ–ˆba!VE v PÐ…]cX®Í !ÄÚ^zl-Ž±-ò…ð6E–¯¿÷l¯c ø!¦€íC[#ƒè󜔀KN);uÍŽÛcÎ.¡ì*Êé§&UA8³eZBÀAà|¯G`9/AÜoe÷Á%1€ÌÎQe5 ˆï°E˜b†©º3ÇÁ›®OžJíßj²·{ÄoÔKN/nëUHZñ“ÏcÁ]\Ù™¨¥Êc¬|ZžL®íZàVa å¬=£p¼UûR¸¢ç¾÷tK @Q`PßO.œðoŠyqJÁNôVO¯Oæµô¢ühŽ‚òêo¶½®ks°âH_'„êØËj.-ö"óÅŸˆÞÄ3BB3"`Nµ3…Ë•3Æ<`iðNžãÚµLKÔ@Üé4V%úËß_²þ›{»<ðø¾™À=¦4О6[}(¢þ7Äï ¸‹ ün®6em¯ŸÈCØ®,ÂÇZ4T®m©ü9¼W]HêM½çD¼Œn Ýä/ËÙ.dþC&Lœ—µ_â¿öm Åí¢—hÅñ.Û6s‹4èès¹s:‚Nù‹d=½QzÝ b®QÔ0nÆ Óh ×<²˜$T4ãàÊ|><^z“dQßòà´•véêÓAÄò÷Ïa¹Œ€ˆýà çê`È • ÞÃW—_ÿÖˆëJ¹¼æX´`·ë§>Vg©À5Ú£€8Ö¦ÎÔžk/¡µ8ÄdìZÙ“ëá ¤[fßøÆ7fA°š†‹™Ò1ªvŒï¡¹f]T€>ºO—CçR6}€6Þ™—'ŸП¬šLÞ5;y¢·;[³tšÕ–d×)/m§Ù,d’`àC¥9õ$™_¿úK½Ü¿âÍ£íKÿÒï{þðîçŸ7;€î\¦O8Òqp¨hENÊÙú0˽I>÷&h™)ZÆ”‘AÙÆîÙ ÷,ΤáoCü{{ãê•ÀÅÆVå¤Êïµ-èXÀoò9â\ׄëЖد5ø4Í]³]Ûsy´F3nß»!ùŸ§Ý2Ð+Çq+‹üà2TÇZ{©:eIÒÿ%º˜(ç"Ëz}ÝÔ$}ä¾MÙûÏ\aÕhç:­ ß]©›¢‰G¼ˆý±—ÆI(p3Ç@ÖÝ|ßGG£Cç×Ô³<ùÄA€zí³gÏvQa–Evªa'…dŒ÷K (¬¥>Ê™ÇÄÌåÀ5ýÛö6Pƒ¤íÏ]v…-G·ÚÖ\w{I½ªP¸.  é mq„J p¢®ljŠÇ6€ j)ÌÅ,裵•GQë2ìPãFœ"PY1¼PzŒEVÕÇ(êlŽùP}¬}´î·¤zÄŸt¾¯‹®ìµ{]ÛKŽ H-p›˜€fo)6ÄÏ1£mÿÈlž¢Ìma†{O_}” ðt˜N·†ßßèÿÇÁŽæúk²›äTH›\&ܶˆ]ƒŠïô±*£Ô”=°wkôwe\i;Ö2àÎبU¶Xï ¨À r*6mœ€ þüd·{C6€[vÒ»Æq·¬ŠpÈÐzÖRô‘_–}D¤6Öú K{¶Í9â»l"h£ @¤’xäŒ)Û›!B‰÷@Z‘HŠ&l^»bÀºß ;±Æ°"\@V³ºœ$š6w`$ùQ”J ædðª¡*ÆC)®Ý×mU÷ž>ý³K¼ÃFtC¬Ÿ¼Ü}Ä!p‹ãþ¡ù8ûL6›ÿZQµ8ÑŸÕd±þOÁÃü*ešX/äÓVw`Be]SÎâ:' Ê×1xL9ëð„ÃBoÝgyì¨-µ¢§‹×š€!û$`$€Þ?éÛÌw x­RT•ÅX„û{Å,;÷ÂwÜSÛma}\¥†Þõ:qÎ2JÌBâµÅÙ´ñjQôöZéDºËLBÚôÁp/›ž¯O?4ÌAä®;•Ä)uâÎù­KI»~Íuên…G¯Ù÷ UÐrÌì2Ë­œ”ˆb¨|°Xá×0f‡V׿Û;Ô9¹¦ÞeÆÇiš†E`íHšÁJ¡¾ 2‰üÂ7‘‡î t½ÿ{‰ðW誽~ô+ܯótàÎÙ/Œ\ù•ïô~I0­Œ1І$5b o½ôü™2¯îœdU8È*oˆê:DZ£÷§ *0|n‹ÒÍAo/bW-`X6–O6ÑZa$šÁuÕ3º ·a+%M·ÛüzUUhJ¶V|âfÍë.° äÞ®7e%áhž´»Uÿ‰y«Ó Ú«§µ éGúY¦'¦ÉÆZž¥_ŸúÕWv½ÙƒùÜß…¸†àД!ô¸ у0ÍZÒ†W†a©«“n_1³QÝ^Òqà ´w}¤»nŒÀ]vóý59ŽÐû” ¹&»ÚiUŽm„-‡IY+iŸ‹ZÁÖ‰'nÊå¶2€<Çȯ.…Aø}zÿ"‰ãOÛ$ôsM¨PPÍ Os‰k¥9™~å€)‰@D¯ù ‚“éC2š“åOÊ™Á¤°Ê™â¤jíâ€ï K6ù’4dS°UUx'M. âæ æ¨Y{êe½¤U¯‚¢ßÜ»Üü PýEÕþûí׃¿ƒõÿSÓiêOÿ¹à Å–0ýÑ}¿Åæ“À°Sy5N‚‡{Ix§Kn/5×2ÈS¾õðv­ÆOåñçTfÔp[œV¯G@ôw–UY"´ £ˆ:ã˜N+ ŠØÏWa6Þ{þéõn[ÚÞÞΙ´ÙMºÏ…QøZ”hª=¾KxP”XUçXUQ]œ àƒôù|»õè6"{›´jw´]†•šÚKbÆPšÏRc5[Ãx†rœO€t<Ÿõ ³räMsüòA’–ƒÒÙàÞ­­×Ö4ÂQ×¾Ü} £ŸÂÁÿøßîÜKÿÄ$/Ïçs¦þfLýuÎ?ZX3ÿ½vÒ¨1L<]ô2!bˆè®-ˆ¤nô{Ñ‚³¸½ä1Ǹª²2öÕ“~"lfÇR´ØŽsÿµÎ‘·¨ ÿ]¨üö¦ïoh)î›J·¹~øáü§?ýéV½s*ž&—5î>£gcf/G!C‚=Fô9æJ0Ç1GfU©Âð,՚ǂ¨†ðä5Ø‹9H,s´®a˜‹1+¡ÇðŸîÂ8ÊÏÔêãÀþ?¸O3«ÝÈ‚G¸°6sÔÒªÌê*…óöïWÕ‘VæÞ}ð GÿŽJ:|™>x„ NœØÈŠâßäqüGçGirqZxÑø6qZ›0°eÀ tÑñѨnµ+'}Úhu> ¦ºNÌЬA5NÌ¾× îÊàG}"h3 ²—1&@ÄJ‹\c—Ù=«Qå­†-¬g¼„ô~M¢`ú)®¾‡qð?µ³ÉNŠOûÍ6MÓUÞìýWßWå¸RÅA|Þõ*½÷«0¦)²ž:PåDÂ|,“„°rÊÙÁ…ÈB¾ý Â7l¸£’o,«&!®v³×‰€ÝÔĹD~ãzª.[Kh/U€?^k½Éê›—S$üòi½°—¦ùEZÞ¥̯ËôqÀÆövwmÖÆÙgúèt:þÌ`< †“)½?sÿ-~*à«‹úCGc=¾0Ó»ó« a¸¶?ës÷ o…ß®·_8ýÈè% @*¯rêíéõ µ/ñžÞŸ‘hDŽHꉞE¡×I’y„o&¾ÿú…ÝlpòäÉvj¾@s[ËÁü‹)x- ã º¡`èRà@Æ:zaÌló‘&Q©eˆŽEô6\¢1R™€›Ê5€c/¦”;r§Fë³:ííX Á%½“&x0÷› &€ƒE^¤ÞuJîÁy>]¤»÷m厾Q½‘|Õ°Lqä»ÙÆ´¨>;I§'ó¬\O¦íÉtŠ”š™Š£`špÁK{¤Ù]Õü.ÓáÅš2®³’úJŽðÔðX8/RÛ—§|»fÅT<ç>¶æŠHà\‰i–r7FAŒÝ$™Fax>évχC&1jRÌÍ¥ÛÎxr<_ÄÐwp:Â4ÀòïÝ)Ö è»†ØÍV­Âú8:$Lv “­E"¾×Ä}3†çŒ"-[„ÔÂ…!ë;‡"7­X£¶ð%cT¼-C£xæ,5BªxZáU1 }þ |$ýquÞÌÞô&Õ™†Õ«ìGãÿÑnþÞsÏ=×QÔ˜›óò® 6«éç6gÓÿi7/9?žx—óÂÛÅ0)ð»+"ˆŸm®%æépÀ©À:+ðý´e«ßHz”eIä(âu„ ò9‚®‰¸Kº Í°m†k÷•ç”]Õàð]97jqÈaߊ÷µ…Zu8%Œýx`áÀˆp±Ûí>‡SÍó“¢x멧žºiâçEx»ÛÃK{ IDATœH…-¼Ú Ãè[šDxâÜ’k.CÚr&„¸ü4\(q>SÔ ,˜Í9ˆW”ㄹàˆ|_k&®«Œ6UÀ¿¥k:m5 ñKœrÁBjF`Æ@ù ð È7 —¥Ãpúí|šÿÆÑ»ûÇÿôOÿ4®k^î>b ½Ûg_:{¤œ–ŸM¦ŸM³ÕíáÈ“ñoŠzª¹ÿHþôütì%!ºÞ_xűýhpk:v]·Ý—2¢látà þE75ª€s€£n³Y‡GÙHUHçŸkÞ €9µýmT€Wü°uö¡Á`GôÆÓn:ÝV#àþ·ètÖÓéôõN§3lñm ,N  Å[]-GFúu€®ÞYÄ olD/*5:¶sÝáª(§6q ƒpn÷è ®ú]Vpü2c‘Y}[8)^ „¦ãjâw¢ü¡ö<ýBÜ)?ÓéN3éܭݽüù !Lƒêså8ýÔ`<žïìNüÑ`aiÒFj¢ÃËFeÃà‚:ተÕþÙÙé·^Y—cTSP†=먄“lR]ÉàrÃ$8D¨³È&Ÿ{:Oá¾4Lî3ËOC*£w’Z":aBÐ Ž‚·ZLj=ñÄMëþÍg¼o ›Îv»½ï£´jÍ;_ÌÆ3_\v#@"°¬b©} ŽA°b~¾Ä¤J£À]¢‰qE^÷(¦—t2b‚§<a $€¨éÂêÕ5"»¡Ù露ÍnæŠ×rd@Ô“_@Žº0÷ñ²jhŒ H,!H½ Ï[etèÑ–·ýçUxè;aÕú/oTßýñý­¯ßôÐ /µL . ‡Çž?õÖgÏÇÿÝåaúë—ÿÊ„¥b!ŸiJÛƒr€Ä´â¥¬\®¨C’ê¨7%ܲ‘¬gñsn,„ÕÐ4çêÉEìBLYõ¡l;W9‹Š-õ¼ö%êKÏç9R :Pc_™¶.ªi€]J=»D‡‘³~§#ãày¤åçü™Bñßzz߯–âË|±ß?ôc,ëG òÖuÂ,yÞÊ Ó™ÆØò»¨2ŠÐ« S`¯a…8¯úf9 *6à76,­G’OMÈbb²2Üè;¶*°!ÛvùÖïë6J¹$f {†I6£/+8ñUmó sê·gÇ’²ó/2¿Ò Ó~|âEî_2€ŒÒ=Œ¾ÅêÏáÖ•ûÓ¬ø•Ñ¯¿¢ºgs˜zÄþ ºÁ& #€ "Ü’È©ÎLÑгðL{›³/™Ÿ,#fë¹)OqKÚ³‰ö­W‚¸Mê5ýFÁŸD~‹’…ýI<ÃbþÀðóøK8ÐDŸªŠ©—Ž†tD3â†U' ó8ðÏŽ×^:~òøÈžy‹?z‡÷%3<§Ã/'ÃßýÝmz}‹aµ\[Z^¡D¶3|ÐWñc¶)ëÕ÷ðÊz|W@˜iº¡ù³ãæœ{]Q§ê:[Wƒ¯Â?1‰ý²…AøLú‰ééÕ—¡B{ƒÝ]ÃÏ(NŠ0ŽÎoãÔÖdKR2Ë­§÷MH|[U¼úê›—×¼€wàdšÆa^$~>F—aPžNmz[Y@}-à©ï!j¯VÑÛ+°lfç࢖J¶"ì ± »‡½Ž>LÉT¤9Ø8·¨1Kœ]‡ªEåõcÌ^lœžß‚n@l€ÉÐ8<¿bf U€èç,1þìJr÷ïž½üÓÝy8y£Õzˆ Z¦^¾reõ‡¯8­¼o\W_ŽòO]˜ä]‰þƒ«?â~F?c2­ÍBaý3"6Šu8b a O\o®:f/âV¤Ý#‘U]ª ˆ²8®4óuŸ‘Û¤*€ˆýCPIBg“ß{EÀ¹ñ?ƒ Hôïwq­ £&qòê£>*Ýÿ¶àÜûÆxA¥Š©5—ƒ‘¶“t¯„~ye²R V—|yÕÅHD˶pt`0®R¼Ý€Kó#€•¯M–@ÓžT™FèÔ£òšc nªX„ÒãÌ :HúÅš`y:Ç¡]¯+š·2ˆ V„3• lÅ4Û}½øî?ÈæEðÆ%o{zå…mn¿-ÜØ^dùsËwÚ§/¦GÆíò D|þÓé¬}è2©›ÓÒÛ‚êbü1¯‰³…e"t›ˆf¨ö@èô%\/86”1|Ô17’"ºÎD÷¨¬6cÔgL€ g³*Ø‹_àèñ·ûñï'£ öÅx Ê9­â5ÀZ³•n²ÛKº?d1ÞSÜvÛ’^ó}KpÉùÎÎÎE¼™~Öét¿ã·üÄ/†^& ¹!‚‰äÚ8â„©Â\CÐ7 Kßj¶fQq]S”®™µUjÄ>õÀ «H\s ¢½A}ßW.²tIÏÓSÕ¸œ+¹(°²¼jà +Ño±ñpÌ>Ý&¿=_ãÕǼ»½w×ò÷ÿþë¿GÓá§qðybwg+ÚÙÞB…ÛñFc<=Á=Íñ7¿z1øºcPÓ‹øõ»? ìÏ.¹cÃ7pÎIÚ;¢vÃtàR“6©‡ûma©­Ø·dã’D k¿ù¨£úš €š 5´¼ ´!ñ_®ô ù1ñ':ÅØÿŹî't¨çy'õc·%½ß€÷ØcåÏ?ÿü%5x!‰:ñŠ— q½T8B¢¡ ¸a„!p6"’óˆÏ£/T'n3ýàÌü›ñÄDqk` ±LÑ…]aåI*àœ|ÈŸsÉîO…$ (-ÀÇA qËÉz"åAÕ«õd¯h>ÈFªlb“wè…òì±y{ø¥ Û™özíÇß*ž}ýhpô5âµ\|Ùí>é=IxôÅSì™ËŸ÷´[ë¥+WV;í{ÓÙô±³ÃÑoŽÒé“—ÓË¿·=)½aJ”ßé Qóü5æ/#°’Z™ÜYo®ÄmꚎB˜Õ0ëÉ­cWÇD=tLê”dõW§e—ºyu³î1‹cúÔ4_‰þzëãþ‹ËŸ—cø+FŒFa—è¯ôÄ.Æaò zÁiÃm±þóF–Þw §:th:ïžI’Þ@,»¯œ2Qh;ðz=Œñ±Ìçë!î$j§óC¤Š2â´64 «\ñÖ±`-B—È^™‡¤kTqV;c$Šé¦û[‘Ù·I’G4ôcQx¦Y(pÃÔKP´‘0@Œ¬Zw>Ç?Gytë§ø?ÿŸÜû½ûZ÷áþŒ[aSMÍËýû ç¼ç‚cÑCÇÇQö;UÖþïwÒâÞ­QÖ¿4*üË,ñ³Í8ÿO¿BAaiGs÷EÂ1[S8, F; SDø¢lm «§¬mºäðÒ±]Q#|Ä}c2ë‹ XÜÇÞu.ÆjÌÁG«útñöé¸}Š¬‹þÑýÓt0ñ·í­>ä­$ñV‡oåypù±Çî¿­£OØ wS?˜ŸÁ)èE¬ÿcȸßûH¢ušâîÈrf¬Ñ¼˜ì‰¤Pº §ÆR—Í%ãØ.F€ÚÌÈܶék­(—4«^Ýô8ÍéD|ðåìœ†à’ ô{u²†BÔ0ƒÜ…™+Ë‘ÉlV9‚IÍWpSXñCâvBÿÓí8ÿo 9Ÿû›¯zÞ‘›žŸ}õ»,Ïß{‡ýáhúØpwô…ÝÉôÞ­ÝQk8õãÌk4¦3%]Ã}òôÓtpÙ‡œ¡d 9ìp¢3ëQ@ÙDü¶à xhD-œqkÓ5ˆÙœÀ=ëýµ·MLÀƒðîc“ Û`ùâ…0H‚oŠD â‡Ø;|ø°ÝlãQ{®Ó!‚ÎmN<õýO³‹³,jõ.ô:½Wºl½îjᬠ YJø%¦c*¤¹f F„?¶Y‚Hã¥"fm¢ì€Üèìnoe x§›9N­FãcÖHûïW=|¶šÝ8>ª‚Iìâ$† ’6´Á€`B–O‘ŒÉBi1ò&é¶7š\ö#¬€»C`5ËGŸŸfÃÇ[E~ßO.ü¿Ëyï?ZÑ>Uë駟ö/^¼¸²õBy÷æpð¥ÉðÑË;;«[»»þÖ`€Þ>ÂÀY曈մ¥cоëØYG`mOûÓ³W¨’(Adžø …W«³¹c‹wI¥Ù|NÿÅ„sà°1KÃ}6ä'zo3ãO³þäò;«C‘Wp)&ûhHpJà7ã¸óz¶Ïa#õÿ¶¦D€Æºüê«Ó×geëµõà×ü°3|§#X2¡e)í²ÎY,Æà³j€“؈»J^Çjkú}Ýo[˜Î&xÐp\ÂZ£6hD™GÆä(Tу«˜¬ô%#ØoâÊÁHÒ‚p@æ^-h"/Bx°Ý#Á.Ëñ€žŸñ£rÌÃ6ᶼùø(Hµí¥Én«×9öÏ{ó#å±äŽÿå/þõ¿>O¬Dù–-Óûgžy¦ýøãw'ƒÁcíöìW.^Ùþã+ãü¡sƒa{g”y#¤Ë±‰þt4£‘ÍOT-)Ra¾´^E¥áôº˜‡p…ºK \Ê+ô•†”­Û¨óÉ·Ô›SÄ«¼ýèÓÄö¶¶•Š‰(¾¿Iôô1Cà1uÄàyÂ59þ¤;[^9Üñ"zÿÕ5/I¢7»ÝäíõºßG"xãå—_¾íÀÂêöŸáã¼ÄWºIû{“Qú¨ïGgÒ§Ç)j@êu6! ªámf@‡èX¦ ÓF:UC)_\xºë4‘ãÖôèä« µ¡È]ú|}íí*Q»¹.h,_•+éNW7‚GÎÍX¤6ueŠi@¨†Š$³Ý2MÚó²÷@UvŸèã»GjÁ%(ߧôÈ#0ÍÔûÒ…+—~g”翱;ÌîÙžfÑîpâ‘,SÆûKfö•¿6It"~u*N=Üÿb5X³óSïÁ(‡S5n¿„Zì Çì܈_¸Èm\¤SÈ#©¼$…ƒÔœ­ø+^aõÁ†8ý”“±Åÿ[[[õº½ÎGºWp«?ǶûÔ-ÎüÛÿµÍñÉ€M2¢ânÏÿÛp—`ÆQððt‚e fŒV2ÚLöýC¨pgÚD¢ÍçtÎ:ΰ§žÀ!ž[»T[€Ùmµ 2©Dý½H¸þ·†#Ã1ej£"ýÙ±ýòpc5nïˆéýÌqþ“±)¢  ŒÑݺ­8Z_C”¹¿ŒçŸ™W›Å…êoÞò¯$“#£…wr“Wû6qÜ¿¥'/ÓM@@"¿"ú$—¼˜aýxg|êž ÿænšÿöh<ýò.Öþ:“É_cý ‰Fs±_í©vH£vm’kw»fX LwÀ#‘¯ðOªnj™N¯|]‡àMEµ|'î«Ð\Œü“ø/¹SDnz?§×îÏžó6’È ½‚õ_Î q7ª¢(Îz½þϸÂ3>øàûÒ™|` €!ºòüìk¯½V æ¯ÄÝp¸NL€iÖG§f6þväð†ˆˆï¯Ô1œzॳM¨zŠD…—:¸‚ŒâMÃb,“`ò%ÆšªžYÑ[5T(oÀ9ŠœÍý§ ¬Td=:24úÄ"*H0†cÍ­rbRƒî$QÖ–eØ0GlÌ &šµ3/aزð§48áÇÒ×oÜ·Ò:ôï¼ð0«Ž½Ü9Òù÷Ó#³_´½Ë±÷ßž÷¼oÑÊËtÀvŸ¡¿èy'ódökY1ú­]/z|s4ØØž¶&mo ƒìhcíGç—;7¢4³|-¬fÇŸÂÀ"À HŽñƒ9à8Ĺ!”ÄKá ”[Tí-‚7â·^[ǨŠtá•Æ±9ž3µ½Ñ÷Õ ‹,â5£ Še‘0¬×á=4é§nöaX‡f;»^¶µíµ1Vv \ÃW.j‡ÿ©ÓëþÇÑht[ÀMEüÕ×½[úÀ€^N–={vs8LÏÅqðZQÄ/EQçžbÖíÉç~Äg è¯õѧпiŸi¹r V¿[1kPÁO¤wtùÑêÇVfÂq¥6ˆð[ <×Ù$þ«¨µ+$(_M^WaƒI ”uLÀU ¾Cåd?°_éæ)H)Ù'ÔÛ Ç1bÀJNÁgºQOŽCÅ< \þ!j­ÿC±².µ`ɦï>[ùØÊ‹ß`žÆ¦Å¯NÊòÎDæ+øõîbíŸLAÊÚt~=¿_€ì;´™6ÚN­¨£E*ÚÍzr®¨¿wº>¥¬Ç‚€8¢f6uæêÉMßg$ øÚ‚¨“NjQQ(™ïj>lÆÅztX*Ó*?épàMvðÜïô¼Õ•>êrôÓNÜùád4Ùþüç?Û ü?P ‡9¸ì÷ûçf³øG½açá½ÿÌñˆ¥ÐêVV;ŽpiN*ô8yåit@¬[룫5qB‹_¨ç—%·­ñ˜j<­R®!­î¢F6£Ÿ‘_¶C¿JB%g°Ãƒ?”j¢¡šœ!B¹/W0*VCñæ9ï›Åø90†‹&³Þ‹¯ŒZkkàbËËÏ<ÿüÓ;>ztî=s¹òXÈA’ÑÁÊ—gû!P) Ó7¿ÙúÙÏN÷ÛåúW“ÉìŽÆ¿we0N¶Fo{¼ëí²3ÖŸg,G—ÃÕ'.Gü®6kb;¬ BµvzÐÞÚ$Î[®öÑCðb fOâ\†g°£Æ;m®Í ý‰Cˆ¸gj/œmñ.b/Zá'ŽØ£ÿw¬üàmŠÞ?`Ì?Úñz+½juuUq5ßäNb/eÿ¾áÈΰܖ¬`rÉ÷W~&³•þêÆoi©°ÝÁ–—áª9@ÜZ]e!XgHüEJðæ³-ké඘ˆ` +&²  󌟪äL<›ñ«AÕ¢g Èj&©‰d’Óž ‹Æ„  ÈÉ®èéu Jb’&ÄWÜRQRÍ%`2SÉb£ÞŒû¼Úd»ØšÎÎ3bå³ãjí`á‘?^ÿTïõ‘×ÿ‡ùŸ~£ðÎœ®ª\jµ¾ô¾qx{éèÏË/Ïãóǽ®œ=6H¢'·~mk<þôöp˜lÓÖ.³£œ8ŽxøØâGäÇÑÇhО4·%k+µgjGû‚ÐiKµ®hÞås¬<•çG8¦nß®ÕC{ éAøî: Úe]¶õä×âÆ’¤ÖÆTºB=+ÔÙ'?BçŸ3+q´½é¥“¡ub½uÖÒ\‰_LVzÏñçÇØ•  ù ÷1·ù÷gZFŒmtùòås»»óŸ§Ýñ³";‘„+kÓ¼hMGe ¥p•dH0äu‡{älG¼Ø5¢1k×HP¹®Xè05¤ýuzû†Œââ¿ Œ³Z2йCñz!‰ÄF5¦ ­šŒäÝÍ«„®¹VáX¢@…AP.Å™iòÌ òFÔgψtG‡ñüpÂ|‡, ·'Õä ûþ†3Ô®ÂÆøÕGį&¡Eé(ÌÒÁ©ÕÉðƒ3íÕÆ …wCäÚ³¹ëà„¸„¯!>›’Î5Mc×õ¦ƒ±á?Ýa½êÐnÃá‡c õu9ïh¨û*!(ÃL?zþÓ“eL’À[Yï{q¿sª³ÞÿÎt:{óá‡?õ¾þ°ààgÍÃ92E8½ÚëþUQŒç‡~¿¤Á8Ýõ6¯`ób¯»¦(‚ý<2¼ˆVC9š\aÑZ¬µºUAº»ÚÅ–#kGèSç øßàÄ¡ƒ âêCý¨”“°®ªñdHT+k§[ìTYJûOÄ,TY“8Vä†Ð"¢ÐŒéÍó|Ç+0Rvç¸u]+ºÑ"ö{QoêmU;_ûšœ àË´€@ZÅ_¢‹üýÝÝéŸìŒÇ‡w†Ãps”»þ`J¯/ÓH âÒDðËCŒd=¼PG¯,kwáA¬œû]žM0£ñ¥ÃÒHz¬ ßüúëk¦û«ˆE"¾˜„º굪9×^R€ê üˆM¡¾›äáDF<­MÄ::ºÕuïÐÆ!/‰£œ„^;vìäâMúKc@l6 Ækk½—¢¸Çêêì®i6½?Ë‹Ãcô"ª‡Åd½µ/`ÒD€'žœy¤ÃcÔl®Râ¹Mej‹ü+JV†¨Ô„d{'¡ j&À–sùN z8úéËôX÷ÿ‹{DìTTõSz¡»Æ§¤Œ•tä±]Q ðÀæW̶ ‚²‰ïÀ&kÎ]iO[Wºa–<‡½$ˆ’_Mº??ûÖôïÎõåBÇÏV­µ7w½p÷DëæÖ{ã…>IÃz§¼S(z'×g£üÈd:¾o÷§é}/†§“ü¡<-ïä<ØæÞzÆËvÃ.s:æ_0Ô§1~¹ø²Õ„kmhH ‰HI®µ¤ìÕºÎÖˆó&±“W÷ú"~|t-¬—õúÔ%â—— !œ1ê'Oª©ðJ¯ ElÐS¢—¼>Ï锫ÜÖ‘-‹`33ù#øtbý^‡(Y´T?óãàyBÏ°öýO¿4Àiÿ*{íÅ·Þê&­½y|7c¹½,«c'dX°ô¶̃ˆÍ] E•bLŒ¼ßKM*«­ŒvêŒ%î‹ûJ“ùÅ_n¸ÀŒ3®ÑX‚1ù:—: ;€T³ÛÆ?Lï7g"Ê™:aõêyNÜÄâHãëáÌáf?Ç2,Ûo‰Ñ²`ñÑ´ìxy • Ú%äø&Ã=ë'ºóC'úÁ^P„ÛÄ#<5«ü—‹yù£ÐÏž]õâ7xÔû6üCÝ¿Ô$âg‹¦­Þ!—®Êù#L„ùbžå_$þç†YîïâÆ;ĺ?d\D 1ž})ó÷szúR’mª(>²ÿÌQDÐÖú2¯Ú[{ðAô)ÜP²eM¤Gœw=ºrÕs³ßœW{11zpc\«t“`Y.sÿ¿P¥´:5 irÊÂ>xøaí§¾ûðd…>ÆŠ2³RÇ xÒM¢²·ÒÙòÿoÙ^H6ZéôÐôãÍ€‘€=ǽñt“g»Ýy°ß[yBztšîàŵé?ÏHo—éötß=ú YTñšæ¼ÈZ3@³·h@¥˜ç¬uiméAùX«MåV ’(Hc )ÀÊÉøÇ)åd<Ò-Xü lis¬[ÄBT‡[# ’t–SuRG4ì(ã Lþ’4™HçxÿØV±òP‰ª’gx‚ ï‘¢ô¢Y?í´^éõïMâî]×Ý|üŽ=ïÛÇ4ëœÞm#PÜã;“?˜fåomíìôwèÒóG½MâÁ£oJ¯?e®H+|·tý\mdäF»ƒ;-%b4œáÛ¿Û ˆ¦h/B§œ שW§}´‰ð•gz?{cjóºç×<~g PºG•HÐ3ܽÂ=Z±þ´¤wH=˜Õ|Àa¢J1Z1ñ›—˜ï?1Ï@,þ^w¥wší'a+ü~·_€ø/?D¤©¢ái@ýq¶†À«¯ž'l˜÷‹n¯÷|1Ëïè¯91–á.¹sE±±í‡ Ûš$2_|tëÀ×½>=EE•ÅÔ.tò¶‡‘Ê@#“þ݈Xe¥V@érvŽiNGü» ƒåXmV±é”âN—K1•Ó^?º"s•*Ø— Dɳ ˜\ŽãP^2Q…à®i¼äó+A¬õü2ú,Á"~— P'.ì|ï%¼'ÏDIgÜ #M—3?aÜóºtg²ýè½ü_½òJô/zhöŒ÷Lõëç~=”ÑzæÇþþõÉ#Å<(›å'³böåb6ÿÔåÁÔÛÜ2¬§šˆ)¢Ïó¡ÝèäÙk.?Ç4µà¬dDIÙí§¶WrDY«ÅÉÁJJƒ)G†ÊŠÐ€¹&ÊÕ¹¤%SHÄK³<B®™‚Ê»¢÷˜öÖCS|{\X¡œŽ#˜T9a"ÙI¶vÀ%“nóµþêöj¯÷3¢ýüSØéüüá{?uwß2|ZsðËÜ÷zÇÇizþ¥•• äü¨SdÁ°T{8R0ÎMMÖ´ÉÄëo0Žº² €„§Ql)'s¹WDaŠÂ„ myoAl3zaõÖÐ? g£ŒSòZ ¡|m*ÇÕ™˜ˆ2èÒe$T¾îQ3p¥Ôë«÷’© œÚØ=B J¨‡Âc±Ä>PÒ¶!ÓsÔ‚ÜÛÆq)Ä.xãy×T]Œ@Éá^´òGíèÓX¶ŽìÒÏýõ¼˜ÅË`Ò gga!gÞìšäe%Ç¢múÁs^pü¡c+Ïýâ­¼_÷¦A¸QÕÃU1ÿJ^Ìþ`ZΞØ"ÒÒö$õ‡8‚mÂð“QŸpØË×F´$UÑ6Ä'Ø{E×ñYÖ;g5ª¥f¯µ£kxéò•WDo—\On=»¾#xn¨Ï‚h¬ßBƒiXÉz~î‡ÀÉv¾ý`‚$ÆÜé°áʆî_y •¬– IDATk”IXg‚'½ñÖeb`\ñrtÿõõUF‡ºã£‡6~±²²ò\7 žãÏð-¨Ú÷¡`Ç{)ÅÙ(èþ<éÎî^Ÿ­ÿ‹®—ãÉâ´7ßf‘Ž^âuú+^×IÓ²@?|‰ðj˜QÌHYb7kÚÈ qܘø`H@»Zß®^CyÖ]S„?wHívõèºmöXOÚ¹ñzë9Á›Ä LåÉ°˜÷ê=Ä€øSï¡6€kImiÓs 5OD[a(6µËi( ZGÔf&ºsÙtz7mlb>Ä*bw½=×9GŽç9ýy€¨]m©­%v<_­¯ÞT"?cü‰qéáñ?`÷ÁÕwóòe–øš0²yëëø»¬ qŠû'üü{‚üþôÁ/~ ÄÏ+8$¸ž(gp†TUŸÏËêçEÑùôÆÆá#à úrïTqC.½ y3ÞxÃZ8Äzs8†| ¤6ˆIˆØmN9yFÜív¬—Ñó9’½@¢+9Ʀ@s]2C£XŸ4š¾ç,T™—½aëe/Ìæ‡w¼¸èyqÊØ@Ø¿#‰úÿ†!IJÓîN©?·P.‹¾÷2 J¿’æé+aPnÕ›ãÖôÔªw÷€ÈéÐ;Å̪۳ ÉÊÉ1½xyÿ‹;âhåȼ]­§³¼“•Å€ûáI>{0/Š£ÃQŠAoOˆ9a‚Nª^^AVÑã§e€ÎQ¾†ôJöZ¢m†è/xÚf ÈZHÑ_½qœƒÆp°WËK4âç+•ÔblÎyG¯s.©Øæ4¨Mˆ\ŸlAŽAð“¬"w_]j*¤.ÄÜÓ¡H—‘ˆ>ÃCëŠóOh»á‚ƼyÚÛÚ¼ŒzÇ Õ¾·¶ºVvVú»ººþÿ0oá?3IIíòKI*ðÐCå—.]Ú$*ê‹Ìƒ>NOxòè‘cŸÁ'`ukûœ·½5 ×ıƽþ:Üv…‰,6Z¡ Ìå#@«Š(Õaðo?ê%Ôà’lˆÄR("« HÐ7D 1‹)€lºfRØ×R¯²A•ìá<Rv½‰ á ™m°ˆjÖN0ˆMa)âcêw¢!îNBä?§\0eSF.¹+j¥û!KáÑ$jφÌxüq;HþËz…/¿|eëìÿqxÒÿ#¯õä“^°{æLgmµª6Ëlvø0½óÅÕÆE¤^Ø‹pÜŠ ä¼>žçw7‡÷ÖíþɬœúÿÛ;³^ɮ뾟šçª;öÌ$ˆRHJr Q†ä– ÎC€ösŒø3ä!/"ò9l‚Øü  ¶Ç”c[%¢¤)6Çžoßy¨[sU~¿µë6[1lSCv“uî=u¦}öÙgŸý_Ó^{m¬ó•ÁxXÄ£…è¾Ê¤ªKL½^éâ´Óe\Ä1ƒtïI#õTüÙïO€Ÿª8fg¢^ìÑK–w¹¼ßIî-øÙçû¸ÆG¥ í9YÒi®Q±Ïö$‰@pr/ÌÅw2ÊrÄåîO{Hv¯»’ÏU"ðÛ)ësÚoí¿‘¬O™2Ú[ÎîH¾&k˜9?N>»pþc,É@ªU|ýÍa§ÓÙ&ÐçKFí%Æì^¹råC±øSÄ¿³yK‹:㾉)œµW@QlÁE ¨3œm˜Á‡Æ¡‹(.Œ0 a‘;Ûjê³WÄ”H A{žº¾€¶~Áª žŽxÆBïPƒæjœøüÛçÇØ (¶ 6ÜhœìK& &R…ŽàЮ 2ógäy6,1¦ §-à I'¬Z@ÛDÔç<+ ÎY–Šô&”s® 2`(¤¤8b¿ç´ù/Pžs…A…éÚJ£|µD“ìÒÑ€S &/Ráûpm2Eôh•NϦ…F}¾(PozÌIJs8Χ“r8¨†ã2ãí™Ãb\Å¢§#ñ0äÁøààDR˜TØ–0rb­à…]Ãcü$žÑ%+ðyëÓ?}Y(Íêïܸ‰hu€ˆ¾Kü€µl]> p §´‰Ðw óÓù!ùŽ±ˆå‰]qÁu9×+×æ–øð&Ä«ÿs¿zº"§Õ@÷±¯i@ÃzØ ¸Ëg{Ñ?ïÖã‘û<Ã&jÃSŵÃgÀ ƒ(Î>Ø&Ö•ÎûL w›}Ð#·J&H 64¸2m›Iå§Ú¥óŒNDg=¦²¢2!…33Œµ€ AxΦLH9ÎÅà9cPfn@\ƒ!cëQáé!á‚+!°o^Š;uÉ‹Y²¨W¨c¢ƒÔ¥åâ‚V|äVêœ!šêÐë£?ÇÌ…}£Û0j’§‹é%ª¾¿vN¿A„ôN—ï§ õ@u!ꘚ6oA„úg_C`êΣ¬:¿"¾×Ü·wËsƒøŨv®=÷|8›ñý”LŠtõUíî#ÑOÏ£ÃýlçîF¶è¯ôÙf„ßÊòòtume©µòDÆþ?ÓYùætô¡wù=Pe÷wZ` ÿð/ï÷Þý>xÝ®ã+½2î´˜%ùBotp—ÊìÆ›ò}…ÇuŠ`(·h0û4üÞÜ0f=ãˆáÝ­™•¦À‡ |@ÅHAG» ú±9•Màî6jA¦$aÃKφ@ˆrvA˵ù_ žÖÂeÖôçž ÊÍrqcR©hr^ªN.îš1)lc¸ºÇI’qËuž¥uÿÒŽÑmmÃ4W²J’† ðýTòä‘WðŒ‰#÷UœŒi˜Þ—ç^ÀœÓ§0BÍèóœ\ÑÝ·eŠ>Â@9ø‚mÊÌI2/ `gß©¬¢.)¨ï#QsâÍT²D}†C …0Úxw†hï×P¿ç¸¬Ç§õcÍó&ò¦v‘‚FXQAB ðý-|Ž{‚Û“]vA`¼~cêGÝ“VbÀCç€Ä€kvï™·Ük7±Eкã×â³ççÊ<¿Jy:¨^-¬Eªª˜Äò;ܽ›íoÞÊövî=tYŸ>½šµµãôóB­ZþË|5µyéÌÆß@KÉò#_jðì³9bdwÞ}÷Ý>sñU²Îì7JèlÇý³4´qv|·‡«0‰ÐÞ­F–uÖé{m×ùè8Ìž É@{ê˜ew¨QGã’#D=²¢¤í‰„\M|ô½z*-ÀîêõıÓ9o$IR ÌÃŒ$ ‘>5åè½6,™ÆšU?¦K W]44 Þäù¦¾ë¡ò·³pÌy£%I"Ìyä ÿ‡:)&*†$‘“—!Ö^mü¥†Ù”1jp{R`3b â<ýù§tÕa½GôwÕ3oȳT„œÝw ;‡Çó¬ŸT~$dD€$EŒ-Öw̉x ˆÍ2RP!EÁf­Iô|@²Ù$}ßÑŸJ¾­@N˜GóàYÑë3ßn:ê=z|Äxœ öñû]üQ\ÊK© _” GùÕ¬«2ÛWÚe|Úöê;#¾ý€ {èüzú1Øg©}ª£Å¿¹Ûj5^l7I\ÿ·'“Û+²·Eÿ{—‡šœ”šÔ/•ª7ht]&J¤¡žå’ýÉGˆZ[ô±naèfgøL§ Ê¶Ý|•²p„³ ö©àêìV ]3šYÞ†ÇG´±‰*ÎÙ4†!P¨)¢c ´1ØБ át›t&a[OÒéÉGŠ)c?©=“ÖÆ+§‰³Ûh9 ÂdôÆ#íË°›’F?_c¾QÁ’0Ã3ŠÈqžscê;ÐæÉ’|˜#!¹Á¶¾)çf¨ 3Ô„ÉÕI@dæ!ªD`ÄR@Ÿ.¼!çõÅ‘gš,Å÷¤æO™}ßJªa2IøЗ1ÔY9 !pB $¹=ÇRT÷”—üÃA "ã 9€5§\?8¿$Cﳿ^Àëè N?çú”'twË‚t‘.à«sRQ÷–Á æKí…àëûÄŸI‚X!@¸ê38zÌé7Äà·À˜•ÍlãÎݘ×Ou`uu-[]YÙ^YYÿv£Ñø‹J¥þ=×ÿàOþ„è±ÏòH>bΈÀÕZá{£ñh¥Ónüæ,;‹ÁU(UwÒƒ{4ð‚c(ÆX ‰%Ь’ÃÎ;êÈ‚(Œ8!bŒ„¬ŠasôûËX¢MÒ(ý%Áhwêúœ&!‰!5Á®ÛqQqWÑW’•ÒÃ<®ÛŒ"»hXÑ])rM!˜uIdµaŸˆ¬yÞ!]›¤¢ü‘3[©TrBŠ'ñÞOà£âØ«¡JÃN”#=‚|è‚ÃÜÍj}ýÕŒ^‹  ç׿AŽ‹µPKTðLT‚0#å0˜£u!±´>#âXJA/+×5H p|bß;uÒ¶–¬cûÏóXöO€K"Ïì˜<éît_°¡Õü}×4q‹Ï$·ø‡# äP¡¨[‰¦ ­Ù|%(ÖØû¼B%ÁrÎÛb˜oÊ6•<Èõ!S´!VV e‰ýU¾YÍ©» NrÈd;wo2få6˜£¬VǨÕÉN]Ñß¿ßlVß-æKoãÓrë‹_übŸ|‡gy$À¹sÓ;7pU9|‘îf‚W.'ͳ«+g ÃãJ=7=,ZIËk†ó ðéC(à9XB%˜:£Ï¼ñÈÙ‘aƒƒÙ†h÷ay¿½^0{,¤ Þv‹¢+Ü õ9€ó €$r@£'O¿º¶)ΠOò„©-† nJã."ª—X¡\såY‘pòØgx§å( m14V ò>l Va~€;€=Å|›žƒj\—”"˜³r}JZ@š—“£BÉß‹¼<ý„äæɈ`HUrÚ$IiÌ«PÿaÑ®Éó½ õÁ%ˆïi qHI¸ìï!‘HƆ÷x«^¼Ï·áQ?ÐɾD'ä'òå1RZtøð p¯I ¬»Ør¬ÈÒ_…srüyæ"sQL ´à DJ<£ø+HMŒÌÒt ø‚sOÿ˜€¤÷ÐûýØÅÌBFu²¼Ö6:õi½UÛnÔ+7!Š÷.^üŒÃ»ºå‘ üÇ3xúé§oçó½]ø SŠTÆÌ›x¹ÓÉ_9îæ~+_(¯á•Æ(²›Yoã OºÉâ橬ÙÁº\ÅYfTÇ›ŽÎ(l68ácˆ¦ À/CSH µ°Hi¨Áe¡a ãZ –<•SJbŸ48˜5¼Õ!íNä©R¹>ÀÕ*.w…ñ͉™Ðèèu%[tpWT›¥ë„FpâGð“ é°×4oIƒ`C¢P¯–Ð-˜©ÿs,8 yº‘ ÌÍŸb8e4¢nÈ#$‚‘ÁKpG¶'`€«®Sj~Kñ_#¤ â"†(¼ñCz¡ÌªI\¦¼JÞƒz’ŽI”¬;4ƒãSY1îilä>v %‚=é H(ȼ³*L"U¥HV\³ ¨yjv~Ó©“åß{ÐÓ½$„X…g¦à·À±Xv¹?+÷Fç(ÇÄrÛ}t¡–iCF,`åßÞÙÈînlàã@½L²Ó§V³õµå³§Ï\£«ï.¸~ ±ý!NÏø¬?œË#A~÷wXÉìf¸ _uðÜxR)®T&Ÿnµü¯¬ŒÛ³ýÕÜvï"ž á2x¢½Ð"Ìx9|ígp¾Co'SvÒõeôÅq“ƒëˆ·à4º‡!‰R-ˆm~Îü}ý. AíŒ!sR×°—0ƒBñØûh‹6tŸa’«†¸MÃt^B9ºO3ÄÔLnjùàº18ɲHXhº¬rG<ÿæçÓöD¶7€1°ÓƒÐ^Wy“6ôHg¡Ï„ô@ôª[ÈmClú y¡¤ÿSTEæ™,”Ç‚Åó$ž³L ¹®ddz‹á È»ÆÀÔ²~œÓŸBÿ ÒAƒP%uˆ74}B¨7| õâ³9æ\1œz,œ´LÑåʽ(ó8)któYTˆ’d—¯‰¨O-Rü"%™v¢âÖ‹,‰TSÃÐ\£ÝйO,¿lóîl‡þþ³ùèúÛ\ZÍΟ>‡Ÿscyiùo™Îû*Á@Þgï~úÓO>”#6}ýG‚XP>¨8;šÍ¾q­wãß3cÊìÕUÕâlT,MNèêl\Éíí0Ó 1äzáÌÑ OŸ­eK+7hð¨ÃÜÿlÖ èÈPR·”Od€oBÌÿðL³­Ñx$BMG¡|Ê â 6vŠ8Á`PäºÄBNîV0DZÎû÷÷ãqq^ÔÐö‚¸L"Œ:£j 5_áÜœ–Òôa lEûÜ]ÏÈèûü—|: E— þj…\±®/÷'}»@g¡ ¨/ƒRÀSÓz€bŸ?vA¤'‹pjÝw)oÔï9ߧá½}ž/ê­€Då I‚<ÜdÂââ3ÍC¨=ÅîL ÊzÂñ9œÚÁJ~aâ£È¥úA‚ðA#âݽiƒÏýîB+œK<ÂòåyAä‘{K‚¥7IɦǬP"83‡m/;¶«ïÎÍlóÖ­ìðk‹X]=7={æÌôìÚé gŸ›•¬ò<žÓÏÿ—K°ñLö E‰§ù؇ny¤ÀIí9¿ÞlöLÿöíÛ[Ýn÷Gøœ`U·Ô_-Ëçutéö·ø@ÛÙ͸YîÕ¤[†‰a0œz§'—{âå«b­Ý[2y™[6i±Ý±ž4,v…XœTÔ…¡Ï85ÀQdIÁ)Hã}›;2"‰@¬Ü+¹9Yâq‘^)Ä+œ ½@€âœ n×âîvŸà°eiktymþ×ÉÖ§†š!õòÁ‰‡â}øÿKHèË—€0ƒ畨xÞ¬A€Í›û#S€FúIû@w|— p<89ÒY@l¦”!X"ˆ™DÓ— µ+2÷Çò²åZ2›ïÂ)gðÕ¹GÎ^«0É bÿq—ÞXúïÞÎŽP3GH—MüN–‰a³¾¶öîÊÊÊ[µjííj©ú×µ|í‡â&’Nõ'.q6!Ù²¯Z¢<œÝyùtV§×sÁC1Àá¾ÚaøkŒw1ß÷ °rŽ]/‰öèšÔÉ`GZÓÏï9Ñõ=Ð+ñØËT‰ (SR!Üçíx×Pë8´vÈ6òDÎ9Gÿ‹&ýüÌñ†æ‡´ÂTöû»;ÙöÛÙñÖ&³ÃwØC(oÀ 5£ûÞYZZú.ƒ{^€Ø¼öêÏ^½óüóÏkêxè—G–X³|tÐlã­·Þš2M˜­çî¿Èþ œ¡5Ä}í »•m3UlÿˆÆÈ°ÔlÜF%h2:KÀtÐmÿ!b¨1®±¸¾Ðx¸Fc{*˜†ñŠ†m•z²–‚&¦£]Ù¶Lí¹pbáàs'q Åm>8©"±¶‡:¤ \Ôœ'(]¦Xš'Éá´#‘ÓI\i–¤e À •;på%ÔX{F†C^ßzEGÃÌ°˜ æd9ª¨a÷à΢€°à,rBUž1÷j¼tŠv­wQn~A°Ðã Èé!Ça¸£ÌÁéy‰1uv$`øØwØï5z(xf>+vë³Å}H*.ô| /Ä{›&\{ýˆh +€ü~°)…•ß÷6ÿ dA ì!-PÆ<ï_&½-FU­Dý—øðhâÜÓÂ×D¿]}ÇÛ{ÙþÝ[Ù6Öþ½Í{8ý0Pé@ðŸ>}:»pá‚SÔ½ ÐÑç‡çÏŸßûÔ§>5ýíßþmr~ø—GšX½" ï1®úµz½ÚEoŽ'bMŸ*g—Ë۹쨻ƒw”mÜÝ¢1ðÜrÖh¡÷5t£Õ)ÅÃÑÿÆŽ4D È6Ã}´;~b‘'ÓrbIÌ/-!øFã@° šKú'7½?Î^„= Up(¾‡4`†‚Ï#7¦·\‚—†oIŸà3I-7 &Š °äŠáEúµä†Ñï.«¢r IDAT³«,@OŽQ»¾2ŸT@7äAƒsØý7Ô”ÉÁ@=DbA>b@#¯E n—°EàÓ9Ç÷˜NÊC9¬BËŸÀ ÐS¶0ÔòðÐäM<i­¯»òà ö0âIØçb€È;„“uÅ—’ˆP)ûõÕ/R ɺâT|7‰A•µáœ}Žó§Œ=¢÷ÓÇïÆ­l‡ ÇXú­Ÿ¡¼V˜¼vmue®ƒI<^…ü/ÊwíîÝ»žòè,<°ªüq=€îܼyÆ4ÃÙ«`0Öi©œ_‹b隆;8mìd Κ/M²¥ÕR¶„ժޢ߻„û0]H6­pc‚‚xÚ¸lxvñ Cÿ<¶¿Ø4»ˆïÜÚÔ#CÒæ9Ä5[µ©#ä8‰´'¨sª£½Æ3â dfƒO-‰3PÒqo”|LïL8b- ÚiÔ 8>ÜT‡ž©â61Jt±Ù“à9‚fJ˜º´+LÙϸ.4’5^—`¸ýÜØÜ=Äù!e6¨G—À$aÑ—À%ÕïP%˜×@S°±ÚfpS*-êÍÚðúî¬rËúµ†<äÒ¾»‡Ö}JÃi¬÷Øz™t±/Šã^ÒzÝ{ãfê„=Úu’oôž8ǛӫŠô”ž[¦®äê5 ŸE q ùïÞ±QÅÜ}¶‹%†ô®,u&§O­÷ˆé÷ñü^@ìÿ6âUìPLä©þøH-ÖÇÇfûÅW^y¥Un~ôßîlmý«n¯»¶…ø¶»·‰×àÝEã¬ÃèÁSçÙ…‹Fla;¯Ñ%HñlF½EÃeÄê¼Þ…ÑU¨–«èéèBãÏ;w¤þËy¸$g¦)ÑnªD!œ‰FçµÄ¡¸Šh‰? Yù4OËÛÅxtš¿)ø|J €:ºé °Ï_{€\U®§ÓÏ}çâ& iž [Áº½¡r<@`$êðDvâ:÷ßcØ÷1H‚A0Š€÷q 7]Á‰N@GàîNir Mº#8·`§t)ÛKž£Ü ¼ìS–àܤGàá49‰fAR„Ù¥}®zÀ=<×]Vë)ˆ"ê÷ñxlÎÄcW_;A:*C0Ûú äQ€Xöö äAðÎ{·n òof]Ìê¨tïeçÏg€O{£½¼r•H¾ßÁÅ÷û”áElOÄ°` ¥2ߣµ|,$€“*çH]»?úÑÛWkåÁ)üƒšÍüB!W¾D3ÈÁ¬².v©óöá€"e_î– sh˜JÈ:m‡Ã Y8ù‰=Øz40Ž\l.öÃËŒKž¶i뵜Pq€3AHœÆ¶K¸×®Dà†W•»Ð<ž]Ÿa"qÏãæ¸_µqÁ¼mø1ÏüT”0jMòª6Ô²·j± Ò  FQá*¬c· ÛKóƒ|wÈà+súiúr},øB;`õ]x6Âuppº,ØÀœ-YBH HmÒÅÙRÞëÙJ÷´Ç}¡ãshþ!*×g?ô~¶Üwò¬‰F@2y¯5ªðQàØÕsŽßw²Î&ÀàeìÊB¸þÑ!|pìÙ½s'; ð̈q$Mf¦:µº"ç¯./½Ûl·_­5?*•ËßÃø|õâÅ‹Û"ð­=—H¯”~×ÖV·ƒã—±öÏ*•âq­^9…~_OŽóãÉFªýlk“Q\£&jÄW`ØÈÖOã/'¨Ôê&)‰†3,Ú,°.Öô‚Ëŵt.µÂyZZ?—RCM¬,!ܤ‚G€° YŒð§Zîæ:{Ñå@"=[§#óž´*]@¨pœq°P {üçfèe§1P û†óÌjÚƒôb8½ Œ‰˜™ˆ¿yõAöÉ@11b>u±R§7è‡yÆŸ€H.Á¿yuù䦛$)Ó,t&ùŽÊÉ>ÀÕí6î‰{=ÇuÇ»D…‘±|Ïv‰nY¶Q©1õÅ‹<Ázp{É8d8Æ(ÔÐñ|c%gé•ë±õé1Úºs3Ûüº”çèj ¬¯.ggÏœš®-/tV:֛߯/Á%~V«Õ~réÒ¥;QˆGøçcKvvZûYvýu|à7+åÂv®PA¾Êl—ˆÉ–í2/ûîþfv´}HÀr08Ä]øL§!܇‰¥—+õàdƒ:£+qF`Y® ¾™¸Õ‘tÈÑàh\áÈVá=µM")là\ P»OB’.ÙlÝ<%[›jÜpÕÉ­çiÉ+^$7)„»ä¥±ð´†6î’›†„ìP ($=;ü÷Qt§ZR~i?A ¤Ab]Ålƒ““«dãd”ñQ8‰ÎãqŒHTmž5Cöâœö ¹¹]‚àú$IÉÜIÏLçƨ bÇe¢'Ãñ·òt5ÚCâ´p’èI©ÎßbŒBPåQ—M™¬cÔ=` ÿ½÷·6ÍÇì=~›á¼+ü.œ9›1œ÷ÕN»ý#8þOZò“Þtú àÿÈ"ùÆ @?[ðÔSøùfL¾CÆüãY#_jÀŧg<¢Ívr¹2C³ í½\]ñíÞÙn´ˆ‚Ã~=kf¬Ñ¢qb.5'Wžà—ÓW† H“o3çq°É$ƒþÜ硽E#¬Ðh,´n#EchørvÒˆ5s72µ$DFé$™ÅyR™VèŸ5¡$•ô( “@0Èh¾H,Ê]]Û¹3l ÀÀ»:4(º!!š&Ôå(¹œ5õXxã}¾ŽQ1!‹åç\ØL¨%x®wÙüÇqô<à®ÁùÙµì¼AlݤwI÷¹o’”&R…˜owž½%Ö}fL/áŽ=U%¹>ã÷¦ëF°s>¸õ˜±Ç{:D›^[Sì_.uZ;ÌYùJ§Ùþ^¹R}»\«½yå±ÇyÎoÕ¹|l @z=Ú†™ëׯß!¤õŸÓmsµ×ë}–.Ã_GÄür©TøÕ*‘\÷ö0îãåu¼™mî̘‘¶™­# œÆHØYF¥%¾À ®?Ƶx [£œ–%ñä‰?¿Ð.Š´ é üÁmEºE¶ÑµGÚ”øÒhקî6ÓÆB~! °+ø¥9áM-Wº×‡Îo1*+v¤‚l™º<Ïj€¾ ¡ ¢‘Ãö™ä^¶pb,[á%i Ok$ÙjH݆é–Îw¤Ô‰@P,—„I»ž¸”Ë4\Ÿ‹ù^ ‚øîïŽÿ¬nÓBF,Ñ @¦¾V¸8©±Ï¤ÖZê-âo¨®’ê\ ”i×"VŸa¼[÷6ÃÊ¿ƒw_Ø}S › Œ}kKìÌ:aæN¯eõZmo¹Þú6y|uàÇ•JåÕÎ… å¨>«âŸ²|ì €•òØcÁØû›tþúþ 5Lèý\eÆÿ¬Y_¦û·‰-`î”Ý»Õûhˆ!(—-¯×éû­Ô±‘ÕkY©|LcÓHxŒÃÜfj¸1œqœÎLo¼ñ„ý6FX¦AIËSµ46T~ç`ĉ»ƒ.™iœ($ÒC1š6 9 2âý äM>ÉvÀ"SUå€ù·KH8îÏ HßÆC ˆÿ¿ªÁÌqÿ üq*õ¢s‚`÷`" ›´Â¡Êá­dœ8¸OÑñ'¯õ‘û||€?~9z¸Àt™bŒžÆàîé~ ¯a’X}ïôºäemÙÑ)‡Jrõ¢·¥I¼UºéuU¥»ôˆ⽤Œˆ¸HéØCp|xûøƒhåg’ŽÍÛ·ù¾;LÉÖÃí›À_Eä_‡ó/1QB£Vÿëj½ú× ‹þ߬7&…ÂnçâÅÊæ l–O࣠-}wîÜ! kë*š ]?M¸#¶ËÍÇf“ s:4³½ÃMÂ;ØïÁÃ}¦r>È!Â)‡Ìç¶R%Ú#î´¢£ÿ™Ö«O= 8iXÓNà,7ÚòÑ)1?Ò=EÑrOš¾}à§=:¹+™Ðå¦q×|y+àâÕÒGpÖpkF,H6ž4äæè2lGâìŠ4@pP b8qõ|Ám8rdòS^·iÐ#Q>¯MÈÇüí»[‡â¿¨ME#/ïøàÁJa"†ƒˆ~Ú¬·w«T-Ý [ç7˜°á_¯-å6wšÙæö §Ø/‡Mw*,‡AWRêøõªi•&‚Û†h Èô>€“KÌ]ñÞøúÊ3°x^8Â#„óçc"iJø@"bÕG@¤Úá}š£¿Âûn)2/;^‡OújÁÍÉàD’.¡ŽÈtßöaï€i”xt‹öõˆ¼¸ÃÙŸ•"ÒSki‡pè¶[ Ž!Æj¦*ïXÇo£Êµy˜ç„~ÿm|÷åôvëmjág;ÀðרVqçEÏ_îd§×Ö ñÕt–; ø_#¢Ñ <¿ËDŠ×¾ùÍo~¬8>Ÿàç–O˜KÇ€†`£Ý~n¸{T(ºe‚ÖåKãÓùâê©ReúX½†?>îf}z 6n€tw˜u6 Ùú9†€žªg«kx*‚F€WB½á[0ËÓsÀØúª@Þ°c¨ ™ž…ª J!ŒØè…CÒãÕ¥#Ž€ð¾-Dý·^y?~{eÙéõSÆéËš­Z¶Ü^š®t–&Ë++3†ü¾RoµþŒZ}¯¾ë—ž|²«ÁUëÎÇuùÄ?¨ÒÀsÏ=×-—ot:Ž|½F(~"æó~>O¿ïãz#&!q"’º‰8m"VvûÙÍÛˆÁ´“ÕõVvñò),Ç '$_D^8–Saåu²ë8Š/9­ÚUp=öš`è®Ià ùÎa´½à¤ì7€aã´m& › ¼ÿb‡kJ ±DVÊr®1àJâæ>‡$¬Ê1‰ªð3=ªD*Gºnâ.²ð½CBY©$>Üës"Àɸ׋fy/¥$"N…"ï{'‚ êcõXÕ»ôñuéÅzzôÊTý„åà-ç¼µqãÞ õFÜ?U}`tßÚ©u,üxô­­aÐmóêY³V{£Õj¿Ýnµî òÿ-Q^œV«·/_¾|L½G©-ùÇ}ùD?î׿þuÙ©k÷Þ½7¯˜B —ŸÜ£uî”JåýT£Ñf2×=¢ ïc,eǃìh©€qâc|Žè1pD¡nÆKÌYX©"’21g„Àf2Žfl I …F2€§«†ÂÄñõÖSóEŠÀ` 4 ГˆM[ nlNjéLÌ€¬8Í]&È‚pÂ?9¡Øs9¤ JJ{"{Ε„úcç8å¢>¼¥âø-Â_*·y+«Oˆ|<–ÂTqŽ«þs*òf›L‘l)«ÝŸÚ$jêö8ï(î× HeV—8ÀƒQ{ƒã^ôáolÜÈîÞººv—oÀx~Æì;€§ÕlÄ*¨Õªû•réF«Ù|™ó¯Ö*µkô ½ÞZ]½ùòË/]¹rôÉYüF‹e^¨…o¿X©êÜ8wg™/2 î?Ž‡ÓOoÝ#¸Ž#{ŒÛ٣︀að0ÛÇÜi:j¿ÉèÂÕµFvêÌrvæÜ2EˆÚʬôŒ&]VuQ¶Ì\dÏAF×aÕ ‡³QˆÏˆÊSŒY3áÓ°OK½‹iòÜ#t}ïº'ÿMÄBñ_d…=‘?3\Ø”@Ù^\+\^§àä¦n™D|þ¶Çt‰«xÀ,@]0ÛCdïñˆ>€7j¼Î;‘*²gQUHÅ‚sÇã‘8ʨÇOñ'6Þ¿wI„tÐq¤žâ}C‚V{}÷5:ê¯_üM‚qÆÔ[ŽØSAšÑoH®{wng·oÞÊÄ”™mkHwS“kÔ£;¯“­!ö7qì‘ëŸ;{ÏÊwëÊFv¸“+Uo3 çU Ãýì™gf¹¹¾éÿùùÄKÖ\ û¨ÌÆLQ>È—JÇpœÿ„ßØz ÖÑUÏTËÅKÕzåóÃa·xx´è«Lžq@dØÃlg÷(+lM ÍdN{‰k¦ Z‰Kç½]•BŸ\¤ ­ü¿]Â(Ëà¬ðX¾‘xôV” ”Óô ìÒ£K€Ãñ·¿®»[›aGq ­^ÎÚk«Y°· ø€¿~À¯WkÕíjµ¼[.•oUª•bÝý~µÚÞÇ‹³ ø?Q"|¦~àÊp—Foób8Àó ·ïé͵µ kÌJø©~¿û飣ú¯”ë•Uö×`D´èr¶·_Á“ ÈàD*¼3ºþ̪YøգϘ‰»½TE­á]HxiŒ‡„3$:à8 ‡àQ<†KÀY S–èþâÁ{ÀÏ_ŠJ®¤3i¨žg•˜Äµùq<$%´AÒÃNr c$åèŠóa§\©4ó2º/у´ÚLƒ|Pk|²lDo@—ûÇLÀÜ`?¾¡MéwA¿WÌç)ÂìcDý#úìí·?dhî€ÙwÇLqD°Ž.Ý´}úòñèDåb‚XÆx™gÄdœÇuâõ£o›~ýµ7ª•â»ùRõ5†Š6âæÎW¾òÄ€o(®eÿ„. ð÷|ø¯}ík“gžyfÊ:i _Þ®T†¯FõkëkÍý£îáoµZë_^^>ð™ `—)Êv™ªì€I"¶îô²»×‰Ñ‡®_ÂzÕh”³S§«ÌSÉΞ3T9³ÊÖDQBzŠÉ&vzhýpMºÃ& E€Eú Ð àd§öè¢r÷\BP#WšPWwÐPÁÑDXø…Ù ×߃€œÀsšýBÌ swô6Ô‡_&­ aqÌqD+‚+ž{—s ©ÊÛ ‚”¤v¦n:Àù @̱‚G!a¸Ð•œZËI6’Š@ ¸CÞöäísdì˜íÉ)ÝàüFâQÔ߀Ûooo0Š“!$"ZÎNŸï â£ã·pß^&*o£us©Ý~b2,àõYmT¯Ê¥˜ÝøgÃÞA+ÿð[ßúÖä«_ýê'ü|:ÚÅbyß5€[|óÍ7WÆãÖãûG¿Æpã¯Ð½U ‡—ýÞº¤p5ÝÛÛƉHƒ¡Ê®@ËìDV%µÚp9&ä©b,¬·rp.N,WQºóDðÉèR46aÄÑ£©­˜P è± ä‚ &è‚ ô¼‰ðWÇ–ÈvýÀ9 €¹©@˜0%¿ wf[À8w 飅B¼Ý:<„xhèÒ=$<±̉R8xžTô¡Ë# Øo¯±N0-B±qè›_FõþÑÕg”¥y;öÉ阞–.v9û˜c£ñ‘ªŽ÷bÚí^ŸÙŒŽjÌ #è›-maÕ—ó×*õq«Ñy£Yk¿ÌhÏÝ! Ì{vŽŽ®3%×½÷ý¡?A À/ð±ièöÜûÆ7¾±õû¿ÿÞéõº/ “öÖÖæ¿ìæ²Ke"’â@”_Znç‘ »{­üÑÑ~Öëa­0ì˜á§÷6v³Ûw˜;/ЗWëÙé3ìüÅuº«:€µC8Æ(¾$A–{Ù$GñÄ?+s¯Ð0'þ4F§Sƒ'X¿ !8C/Aý¨»«ê1RAnØž¹ RÁÈ $¬¹ƒã¬¸ÇhµÚl.!$é@PĨ¨T]&ÊE Aw]¬‚á–\fø+AOX™¹Ì€Ý \›ªÛÏÁì°Z° YÐñH¡à=ÀÕl€X²Þƒ±©Èï¼€F6æÿpÀ„±4à GO[DÀÉV†Ìª3dÎܽ–|­ˆ,Eú÷鞣ì¬öLé>_åö:òÔ˜ØÕNpùàoÑÿZ¨îV •wð1¸N9ÞüÌg>3øÎw¾3ûÚåË)ÓÈyñó~j`!¼ŸZúÒú£ kØ 4Î6S—ÕþE@ò$¡£Ãpay0>NÚK‡ƒ.+}Ý…>úpB ½Àé§ï#„œÞA{'b¿Æ0ÏCl`ør~æ²C•@'œSð”J9¿]‹@^É@°ëk ] ŒA0_dðiŒt$€‡8ìÛ?ÆûkÄãžàêH^jÊøó2C¸$`Þ1ôû úû Bá1 =¶Kcr.$Ë:ÃJ¿£3ñÜcîÂb±KX¯ï“î&ÑxnãÄóý®ï檹Ýz¡~Húîêêê!u=~µH5°>à†0oŒ8g®›f¿µµuðëY8ÿùɤ¡ßöQ•âq¯…-¡ßèÛí…¥ÛÁ,½.!ª™ÍȘûÚ Æ: ¨§# ûÃ.©£ D Z1êŽFXÊéa°—AIáAú)‘xQrè¾ê=ñH ÁÝy^"™dNœ¢¦/1°'"`–@ÑûAÌ|ºëçGŒÆìÚ"ûØåØqÆç nO×DŠ>úûÜ^îOÿüŒé¶àôˆ÷Õ!zþ É`£T.>‘ø)St_v‡· ¨{_zòKÖíbùj`!|•øeñGôG…§Ÿ~º„H[„4iÃgòùÊyXã¥þðè2zÂ@ÇëIDAT3ì|pý¦bµ"5[ºÜz³¹s‘Rî® cZø´ïôapW €S†«:¨Ã‡=qÁ4Î €:¿n<‚qy^i B˜,ãè'àƒÃÃåcztÒJ”ÿc&#ntrOŸ`×HÀâ3G%1T¦éØ ¥fÞe=ü°oÀÁ ³…Ѿ §7Dqâ<„s@ßýŸKå—Èëfz;BÄ'zSþ6êž|ÕC‚¹Œ˜|$bÑbù@j`A>j|ÿ™šüööv‹wµÇã£3ýáäópÏ/cXkŽ0ö‡ãÆdÁY O·u×™L- Œp^¤– BMÀˆH˜ý±ÜëÌœZ ÐØ£QP±?úøéFä¼yh0à‡ê\^â¢>ça´ŽpKÜ œ«ÞûÞ» úðåG¡Û ð36_@CØØ"P…AO³ b“ß-•*oa§–+¥bÈüîý|¡´W.åÿ†Q~Wk­ÖuŒ¦}À? ¯!pêµ·Ðïß«úloA>°ªüÅ3’`¼*ã¾p΂¡Süô`0:ÍL»D§ž6ƒñè×WFãþEˆD5"G×c~8±²ÆÌͧn:7z· ¦ßÖ b¹œ;•í½!ÃD|ˆ@šPbA:[C CÎàÜ=&çäZêEP}üºôB@¾{ÜO„Ý"€È?C"ÐU7E‡G2(1wgñ5€ÿmÎï犹#&JùÒ.$d—§ß¥w`ë³ÿõ³;¹gC¯€Üüâõ»¸ã¯øÇëèÿk œŠò¿ó;¿V ¸\¢€] +u Ãa¥Œ}ëÝqk Z† 1 ñDœœ¡ÿÿiúÂ?§ î­åÝIL&låîO´È3›GLòIN‡˜/Ú¿÷ÑðXóvbÈC’3ÇŽuÁ•ë;ÂPQ_=ö~èús) à™œÔ7ÿ5b›¹ 'Øö9y‹¿ÙÇýz³>ìÆÄÙ¢ ó¿ô¥/éß¼X>„X€¡’™G`@lNê•Ê¤‚XÜFX…ߟŸŽOcQÿÂd6¿S"lMŠpü ãt‡w΂ekŠËýÄ93œO=¾9¢÷*£ó–&ú!pÁ{äúrvÅ~z¶˜ hÏá=Ê\Žø9pï8_,Nàþ³"3’Bp˜åƒ(KS xÌÖ»[©ÿÛh–cªÒâq•ÛCýÙÿÜç>gÔ¹lòËÔÐâÞ_¦à—©½á^€é7:ùN¹7n”:œ/ÁA™ÇË1ù ºvk8œÁºwê|ˆøv6‰LÔ¢· 91CŠhÀ×ñÍÿµ !´$Šû®^”pæÏé | x÷Fp/ú#q$&´:Ü^Û#|Œ 0$¤ØÂÁ4#†è0ºŸ8öTóƒæ6åí}½&ûÚ×éc%ÛÅò×ÀIÃúˆ‹±xüû­ Ÿþ韖™”ò>€Ú…µµ>ØlÓM®`r†d¹ãã ñNs88,ÓËcA‚í I[>ž/0;®ª…QFð×FŽùÕá:{·©× ÇÃáãytÙ8ìøv‹1‡hõisÒœv‹ÝB“âß?תÕÑwÞygü5FV.ÿ~¿ð‡›nA>ÜúþÈŸ&¹víZù7ÞÈ°®Ï®¬œÅb?âDçNÀ×`Z!ðÆø`6 ªËéï›üø@k`A>Ðê|42“h‘ndStCœ¶kWºÍZê6·!H›¦m\šÆ$í~°Ù‹o:Åwñ>ù Ùƒo{’ Æaø¬ˆ"Lö"³ž›4M'S¹÷»ßùî9'çä^ ùqZÓ/USOÅÂüÄäßò^C+ühM‹†J&G@Ó²yï³óÆltîoß«þcÕš• ð ¾”5Ä"áY i\ÔtàÖ‰ï15ÂÍLsX§ g8ocáŒ#–f45@š ÂÅB:K¸@8˜iàó ØÎä'&©’.‹<«ER/ådE² öðsƒò_°¨”é›­çmšNÑ|ŠÞ9}pŒæÕÁ?_½A¸pX6ã£5~BÍ$®&½çîti˜íeš—Y)%$¼bT®3liæ ‰šæÓíôP’°Ÿ4¿43YóãíP•ë1ÅõöKFôº½×Û‘“ã5>§)Ö@þ½÷õrŠåy’ðë´Õô[’:VÛÛäͦ#ÃÄwQ?HB‚Žd(à‘B ašcĪøL"J¤ÒitTy²8Ö;(“–íGxÉ_¸^õ[²¸öàûžÝ%׎¼…Å·£ØQíµéº²šua¥£ná7¹å›m« QþŠå±H^eÊO‚Q×u6æS—üu Ï2”î%vX º¬ð^ø*l O…—¿ÔÈÎÞ­Ë€q,>«žSÍÆì%ÒLÒëd¸¿ŠõBÆù1CZ¾$MœŠ9òÚP 'w‚ëæâ\/מ»Ì]áú¹­.r#ŽÂõE|!ð¾3¾>_·oˆa§Û¾Ódë£1Zë»Ó‘º¢±z”Û'ö=Žª²±¾±~V+´¢cjJ³tO%mN—ó“ï„ |ˆ®-‰«bWO+ o™ ^— I¯HÙ.°;í¶SÖ]æi_s9ó*péýÃë.7U^ÀÑs. 3uä °|^,ëÛ<ž·€‘;Ûc­=maº‹>V«Ût.[»«ÕŸÏªÕÝçä x£ü©# Ö¡_2 IDATxì½Y³%Éq˜™ËYïV{U/h ±’DK¤lÀ1‰3 |3ÉL¦'àE†üúóB¼Ì˜õH6”†4‚‹ €†hbÐ@ ôV]˽÷ì™ó}çžjTƒè& ^qoflžyÜ=Ö¬ªÁ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ 80p`àÀÀ.ê.ie>^èûþ½~OïN/ñú[4ñ´ª">Ëþ_Ϫjþ£ºÀU/fV¼Hà?ü‡ªyî¹”0¥²9ûïõÞyø; ìÆ­ªçí7ê·ºÞ”QÓÔîß:Gm[{™þŽ·÷t¹Á÷7ãFÎ…˜Ñ ¿»«Þ|³z“¤Ï-—Ýúîݾúÿ£ZýÁôÕ+¯àóŸùLÿ“ý§úùÏ<t>ª¿Ø™ñ¸ªú¯Déu]ïRt¸8ðËp ~à¿ à3p`àÀ“P᫪Z¸ÊûáIVâÇon+TjU·ñ¯U觪&ÞlWý„H½mªQ¿­¦;|ó6çÕlLùÕ®j…[7ý¨Þ…ZkÖÄGäuøýºšw]ßP}»Ûõ“¾«Û'){zŒ²uÝAC¿Ex´ì¶õƒ]3^t¸¦ëû£¸@Üîúí´©ª)š6dá*´®¨›m® «:9dn›uÕe ðN‘¦i`€pÅ›4p ÄëÑ´}¤cvM;~([ `‡ù±iÆkÚÜ÷ªÚ®m«®´vZ]öÕ¸kÇßV£Y·ÝUÝn…9óÅú‹kp„A·Þ“ü¾7p`àÀáÀ¡Ãþºé­ºV»ÕstÛM|´qsVÖ«~|„6šÞC ]“¾ÞT£I[mUèu5YtÕð“n]µãIuÜw(ÿ6 ƒq»­§è24c=ª»¾Ý¢ðQÎ#”þuú¼mWõcüã>ù¡Q£/¬ÊV†êÆ¿r˜¨Þ¦ž "¥y‡âÝ»Ã,5Ýî:ÇÀLšº=îûî¬î{áÐÂ}Fâè V²uÆÂ2ýY¨aãZ8˜ ‹X[ŸcļÞà× 6NÝÿ”Æ/)¹ÁZÖÛÝ¢oÂæÙÕ˜JMß`i4ï4m·Ýn»õ|Ò<Úmjl¥z½{tãñ7nWZ'ÃHLÜÀ¿ñSüû€†ü®8€2,=îö[(oFTîíÅ☮|»!ÜoÆ};«î¦Ûª¥#ߢh7›úÄ0šqºëº3}àšÝ¶>EÏŽ¸ÚnWÙ³Ÿ¢„›mOç¿ ßrw»ÍªGöݤëTÔ=]j„Â5d­%rõ§N;ë-zz†¾®ûv±ëÛk}òÚíf{‹º'\ÐÝA ´iÜ 5:UÛ³7M|ÉWÍoº-QÌÒ)‹AôpÓ6F3Éf[šÄôçXC¯<Ó¦^mÛf@½lšvaÐ  À®ÕjÛ5èîCÖëcÕ·Ý£ª­WT¶ê»¿}ô`}ѽõ ªnß¾C½þëþÎKw"üÕê«Aµùºa´ ña¸ÿfr`øÍ|îC«? TþoUoÑ1¯/ëÑè™ËÍlW·£YÝLPGŸ^÷ýœ~ê¨ß ·¶›X_lTþmÓu»fK ßõsô#£âõx½éOÈ£GQ´õz%_7ݦšì¶ ïÓQ¦ÇÛ¢òW…Žú®×Ph¡…ÞúhFÜ™iUVø€jm¥évâÑxÀMÀèšÖQ0`PzJêˆü1†I ½¡§]!DàJ†€ƒ*yúöa¨þ1¶¤›ƒò Õ¡ÌCá‹Ì‹µ¤m j~FRǵ…Ü(ö#²¶Œ¬0VèFM»µÉÞŒ'-T½ã`(4çT°aöÙuËõ¨]=?s¼n¶Ív3mýeÿ•Û_YÝzx‹‘ƒ¾{{÷v÷ý[ßßÜîow뚧ŸlÎàüÆq K‹ß¸v 8ð¾9ð'(ÿüÖ[G'mûÙ®iɯ'Ëj{ 7éwÝ­í¦ûw }>æÒQOtˆCn»§3\«Õ4ëåÆÞ¼Ê-FÚ1tþ™Ñ® “U÷X;TŠ•“ßxêlÊá1€³sÞч×W¡^ùÆÚˆ[Æ’ô’ŒÅ˜¤@ñ1è¿èÛÙÛ »TÖ»]¬€ëÞ4»Ý£ƒùÝ–Ëž}š×ßl—YùïªÍEOãTú«Í2æý£LY@zL€Ó–=A»m¡Ò6‘˜KÀ0ÐâpB5ºÑh‘M?an„0É-¦PÛÍÃ2iÉk€ÓÇå¼ÿëu9µAxÐ2b0iGo1_ò WËf׬/ê‹7Ûm˸LµbìáÑ—¾ô¥$ nàÀo†€ß¸G>4øƒràk|ûV]_è¾8xAhpÝþXZ¼ú±vaûùAVjÇ Ë„ñ@¬ÃE…J0 "ût\ìoèGpâ’ÑLž¶ßöݺ©°XÚÑj‚±1<³ak0¡°bºæ 1[†ÛÀß4$‰ð›Ö꡽¿±°ÓùíoWaøÎfU}vV¡ X‡~YÏ«‰jryÉ þ³jÄ›¡•ˆwG鄲ÎõoéÇ?Ši·íª-JPåD/½Ú9T®Da1RŠU%¯A ¯Û±¢>ô™e²òMY*?ˆ ¨¤¸U†ºÔë`4‚™OðBÑÚ—ÞÛÀT"O ?B/Nß _óaÍ =*ï J? ûN¥Më¯7L¹ã;* ÒO£}µd@Öe ácGA”K 3ÁVGc%ŒK¥Jž¹§ F#f8 ŸÑVHr±:Òõ³éœ6i°}bLZýr\7ßÍc&X?0~ÌÄË#nÁukà µ§¿a™Å; ›0P/ëf÷€ýì?캣[óGs–^Ž˜i39Óž¬ŽŽ»éjµ~xçáæQý¨{\=îÿ°þò "µc¸ø˜r É„)ñÙÞ/P8íËo÷Ç쳫Wè˜;£jÊ»Ñv]±Ò¬ºÙ¯ª lÊjýkÛ¾ºŽ2o6ÝmfŠ¯£Îæèò“M×ÿ6:n†Vk¶¬O×G•él>‡êcG`Å°¾ RÅžj(ºLlæ üÐoI &ÈÆ‚8ta„.˜ÿP”ù—kùâTŠFMSq g×x™–â(ZaX®8š°æÎe‹¡´wÜ¥GÚQÚÑÓ§g1 ’ƒ…ðr³šúgá ÆJžX§)ÛVü-F‚—i^ #ë“G.Ä·^É7¬RO ñ|‚Ôâ¶a4ñðƒf·BnWÕMGÍC+)l#läoæge:™¬Úñx3jk¶Ž»ããÙ†ü¾.ç³Ù}ŒŠ%Y¶“É÷ÛQ{ÎîŒÅ¤¿1÷±:Ö“éä­nº}ÐV³õê_ªî^@G,©ƒ8ðqåÀ0ðq}rÝï›({ÿÍì.«÷è8Ñ£gCùœõñd^è ÞD•OÑCs:Ï·˜7¾‹B™²÷ì¹mÝÝEw£NX÷eÆôgA§yþ¤Ä7›Qô’C±9DθJ/(õžB*¯âžÐ#®®ÏY¨Ç¬ÌŠ/ò £¡B•gTp°Á?Êb®„/ Wâ[ŠF+ÈÃ( «ÜŒQ®¬Ê—2çÞ‹’Öè@‹¦8»ìY 5ÌbO"é*ïD㮃™´á —}Œz×A'˜Â PɨÐ) ‹˜Z |Œ$/-å‚ÜèíG{lv áÑ>[”ÒHoŽfÓŽxˆÂˆ6±n€¶bHw('m¢ð™悬%¤¾Íú%T]ŽI„Î è<Æx9šÔ­Õz»YµÓé媺ìæÕY{hxp>¶ €í£ÿe9€Rk_~¹ý×ÿZ5·o÷ãú¸>ÞÑã_5ý¬Ymo°”|Æp?Cþõ]ôÜ6CM\gЛ€j²Ý¿íæ(,Æ©'ôìU?ÑK·“Ž EùT•€âQ[$§²¢¤·ìœ«‡_«‘u%Í —½w¯3ïí@ñgÂ?Eöh‰Æ\z”ÉŠÞ°´p¥‘ ÂZB SŸ%¥›”w,Èí¿eœ`Ñb ‘h(Ä*3ŒaQzýöêcĬ(Hw<Ãa `P”ò¶ËòÆfШ"eÁ¸w¥m¶Ù2áôä?w\=N}d—Ú¬!ÃI‡;kF]µ\1õ¯É“!¬!d)"×n»;i›;#–ØÍn>”x?@±4?8?¿Ý.û››¾™³nühµk?‡Ž2|ÿìn½ý}VØ?‹‚¨× ÿ»½žh‹°­×ë؆·á@žÝ¦Ÿ¢ºÔ,líc»au•ÊQ¿¸òƒ*ŠGÅ¥ÂRg™¦¯Oé„Õå^ `2!Ö‚^®Ælî3ÃxIqõVdÑkOÊÏúƒáRý2œ~\*ó^¥m;«Zíšììá{éTähéPÒ*Û-{÷JŠ˜]Ÿ†ù¥$)ÁògÍÀεâàZoÖøÀ£°—«uø «ÕŠµi¤a‹¿Ík¶ ®IH# ¬;XS¼a4®O•\ÐkX§Ö<Æø`GWZ[p4g€&pu“ÉhKžÛ»ùtú…ÏÁf77G³Ù ˜Íh<~}2¿EøKáññüø¿×mëèÁƒÓ®ùAµ®L§ÓÝýû÷¾ôÒKöÂô†ûÇ€ÃÀÇà! $þƒ8Pw+¶ìFóv½;¦¿|ÂÊñ[¨ æêûgQŸÇÿtR Žt÷õ¶ë8„®«7œÀ£Á ¨7;—á£lЬl‘wߺåŸ})d³¾£ËYé¦!w£K³“?àC 9„¯2Ί^_Eͨu¤‡@xÌ’DáÂppÀ2xa4äp¬ó#M—U_„-ÀzúÞp‰áæGù«ÔuR˜ É åŸ €Ð©Y±š¾í!ŽxQÂáSr‡a ®ˆGeàn½³Àc‚³°žì"IVä3L¯ïÈ£înƒq°Î Ö(¸Ö ¦U€õÀm©¶®0PôÉK† à G4¾˜>yŽ©"Û-5ÌÃãölàa7=ï@‡}…AÐñp`S}ÁtÆCéWì#h–“æglR¼|Œ•2™¸†tp>> €Ï³(Í@è+Å«o¡Ë¾Êõ ׋UUýÙÛýä’ýP?æZ¼V5þÝj<¿9¾·Ý­ŸA^³oýdÛÕ÷æS4ÈmôÊ5¤ö©EôMÖ*"ç‰:V¡<+5¼úGõ7}/«{ßꕽq´Jîq&Àq6Tìð¯¯{Ò`õ;J?tù  \zè«pû4q’Y\Y`\¸Ñç*Ӷ˸óáw0tGjº…b/PQ&¥p¨,IaÌ¢Ä+)IÿwfƒÕx„“rg&Â;NLrË¢½{GL²Ø>HØ­†ÖðÉÿ5_Ø4y‹!JÝý1Å Ì Ã¸ +7]o`=ò"MGØ>‰‘ÎÔ–õŠCy6 õc<бGÝÃhü‰ˆ…–7M{;`¹î8œh7æðdô~}óÐÞn—Í£¦kÙORoFœHüW?}yùg·ÁÖ\žvר|v~¾yñÅÝ9 ZqS2bp:òOâC§c `àÀ/Åäióê«Õ%X¯ªÉ¸«Nw-ºûhÃ0WO£Ñ{d+^ÅB½z²Yn?K/þSˆ_ÏÍŸlV»»~_ÎÔï_ÔWGÄ6<½bÚle1›Érν:}2qÞ=¹JCÎ¥¢gÛÆUúÑÛ$]?eÔ±Ñ'Ý2 úüI~¤]®_#!á>S†eb"€Ný⥻‚‘æRVß± ÿÕˆ¡*³fTá…‹<ËË ÀPÂ?”& Û?ÒCÙêçôŠ„(K2#ž!zùý§sä/ÓÎû㫤ch_¾£À…¹šÀJ³ŒÏúWK¦ €·œ» ô½ÎW‹4š€‘°‰2iJ"v4o>{û…e=éæ\|N®`å?Û 9»e<žœ3„tÉj5ù«££ã×X$¹7#Ž2ž¾9MÎáçòÚ|ö=F4ÎYW±šÔ£åd<»ìÖëïê;Gw¯?˜3Ž±aÁ¿ÿ£ùÇülj¹‰KÃ}àÀ‡Â ƒ8ð±àÜ÷µýo?®N]»FGòäÆQu×­yäLÎ/«Ï£oŽõ3V–Ÿ²Ðï:þl¹Ü}i»é?‹R?vˆ±X§ócøqÎÞ·K fø· ¤¾EQ˜e¾=ç ÷l¶a¸ßôc]2TîË'9æùÇsýê/Ý^Ͻ^Ò‹ŸaáBa›WP=oV°‡O2®t,É\IÇhdÔÆp4;¼Ž XÚöžƒ¹VX¡`n6ŒñÏÄI*“ ëPÔÜ54¼Tž‘å oímÛA³’¶Â-Ê~¿;Àoý‘y.âKk"i”þ›ªµS¬X± c¹LÛת]®Øe€qaØ:ÅïÂC}[-[l»Ï•9ÿŠíƒaÐqA?M?9šÿß÷Çms1i'8—àÖ,yo^ÙV›Ÿ´Íø‚ëÏÝ»Ç÷£†Qùà>\ S.ÿ‡Ú  ¬C.Zûµ×&G×fŒ·¶³q{t9nýšgã&ÛÝêZèˆsãfè€St#°¬Üw” ÷üüž³öQ5 Kðè£XHSß…îÏô¨ í†b0 Š4”»½ÄåÞ½=ÉXœOA{õL(þÏh—aqB{øŸ¨?Ê™—ù:ýÐÍÙšC{š›@(P•o0X¬Ã6N—AÂ2)ùªLŠØ¹éŽ”§xtÉÞHáÃ;¸£çMZ©Òê Ǻ‰ŒÀ¶ÄEº[ =PEígUþ¡´ñwŒÄf†žyG°1è©s`" yŽìJå’ÂÇ“‰{|rzæê} ˆWBjÂ.p».¯ `„qÔ¶í}°Ø~ÛÝ,ʸvÀ‘ G oYOpÆ{EуŽX4|²¸mØUÒ_s(Ñj}ÙŒgÓåßüÍßœç;ßÙ` ô_ùÊW´Ú‚ƒð¨p’¤Á øõsÀßáà|d9€0®ß~»?½è'ýv=åÓuóåºÿ,½HVå×·×›î·Q/·Qâíbµ½‰Àç yœô‡âgÝÞ ‘:bµ?sý½_êe«7CÍ«ÔsµÑIÉGˆçòU৽äî'WoªÌCYãó¥œêŒÍ€Ž„ÒG)¤aWí§ÅdQMPÛ—}HØ»¢‹÷ 9GïõCש(4ZÂGoØkµÿœâÌ©ç:þ L´“y®Ý¸ñçÓq{9ªÇ—÷×?{›ê.×»uÿ/üÁ ø÷2£‚®á6pàWÉaàWÉÍׯœß@þþS”³ënowÍqÝ5gˆê—ÏGõçøbÞï3´ÿœÞåå‚=ú»Úçp8«·b«ž£äã-Cý*Aº|än(ú¦ÏJŸ£gËv1ê¹ O…ª ¢Åˆ^>Å@ä•ýä¹ß=àä‚ð\:uÙE­^Ô¦&ð¨µPôÆð{ €‰Þ} @£˜ó†¢.Òâ` (Ù˜h1”\œ»Ÿj. :ì#£$ Nµ“Û÷‚>âæ…@˜þ5é@¨”à@!™•Ãe‘^HpRл°#%Â÷X”—b”v‹Ãz8“Yß?YöÏaünÎnhR™;ô/m®(Û]pxÒwdÀm‡œü—¶¿¸X`P¸VÁ¸!uÎ_|tà2~Öx1¿ˆÏónŒç³ù§ÙRÀœÛÏX2Îø AÛ15p^Ïë öð½‚úuè¹äìèËæò³ííº~ÜÝÚÝê¾U}+m£à5Íl¼¿V À¯•½ò§q¡\ä|õo줫Ï}-‚ói½¾þÉêúômFaÿ¬-îµgý¨¹É÷êXÁß_Û,ë»h„£í¶¾Ë0ÿ=dõ=…>ºŸ+}$&„6ij2ž;²= œ=³èå±ÿ;zvöÜÑ (tJC©¾+ÙUèè{æý…OyœD›zÝNxþÃ0N¿Tªn)éi•¨aI/ñP°#¥°Qˆ—t|áJŽd» @K•)7ŠîRQIÇ7IÅê]¾ W.ôéÌ@8þ=ó?Ò¤ƒFZ:œ´¹X1ýƒ/ˆN¤ Ú œïG™0Ô æ›fã°íxa@D4Ú맬Ô1iîÛTY;,ïó4Ï6HïÆ i†ë_y&èŒ%àÛ„–ÅqiÎSÊùßrйG°©axšøæ®øs” ÑìˆÐ®ŸŽÇG›Én…!wÙð‘"F$îÀ >}Ä6ÄúíwV,Cy8½Üýä^ûÍÍ_íÆoÎvÞi×ÿzøJaðy¸ýú80¿>Þ˜ŸÂ„ïþc£“¿É™%EKŸ4·“Š­dø¥L9…Ts ¯í"FºCã#pErЦîJG%¤AÓ~ƒ*iQîó¢21'wè«òŒ[$”¼ahJÛîL//Áè(·´è®ÄJ-<á=%<í ‡U‚©Lª-aF×G šrÅRþy¨¯'+v Ÿ_¬ `ëßv’ ;gA§£>ŽÄG›xÂP`:£ìVØìX À(BŒ\X_PQ³õab¹h±Å˜h1@Åç.ó¨×Šðõe>ÉtÑ|Õíž'rÆÍ5N&äоaÀW¡vÌ&Ôt¹Ym_çóÓ¯}}X,˜úpÿµp`ÿÛÿµ`8äÊÿ›èÐ_©N.è!䧧ϰ‚ÇïNÙžýYäöœéÛ£Õfw“#xï Gg—Õ—XÔýYÎ1k«šÅeçq¼tö:dmÙÏß³ªŸ^Â[y¬³¦ V9Žé"z‰«UìöþRxÊÙ-†Õ/†íínéY2’a{Š¡óÍ@î8 74‹¿+Ô§ LIÉOÄš"Óü  ' KB‘ç<{Ö1 Pàß$ÃI’.°¸á ¡C sqTn½æJt‹§Tc/Úþn({BÊ‹|.kn'MX ÚcÒ°Å95ॠüô¨. TóW°™a°1‹ •žq”v.ÜtP~ì5‚§)/êOà¢é]óÑ"i\ó¢=Z\†¯Ò_ðHwÄ …(ó%/†kœ.pÇm¿Xœ'ƒÁvîG¬6’ï¤_1ôÝ9žÍz¦ú1/Ûw'g'œ(ØvìÙÍŽ¶S|>H´;=>½p éŸðÌþ/Þòÿãïý£s1nàÀ¯ƒÃÀ¯ƒ«Χr@aÌÇxê‹»éú££ªY^°†ŠõTìDóË+Çt´Nåµ[ßÀ¿…L£îrÝ£w¬ðW7ªHÕ\ôÞTüÛƒ G¼sñÕ8àÕ" eÃ^áë«à?Ò£{Ì£wçEQÒHÂ!âãVtLñ­EšŠ3øDü ¯À€ÅUD’ñâÁSø07A™¢Z-9œP|Hñ’ Â]EcÃ4¸{ÍDp¥NýŸ¿RÜ’Á6 IDAT ý䜗Ôv:(Áûž¢ÒSÜÉ(Hˆ“)ëC#ÁEá|‹Y¢Lt<»@œ[vЖRÆçÀ¦=Ú“žµ¤øN„ó¡2²ÓñòðÁGŽù“ »ÓàQù³/4 i´=¬N#Ö’þ Aa{ù{ÈEIoŒ"Æ#‡BÔ_ÈñLS°Šµë15“1âkd‚ã÷1¸™È’¼îÚ¼õ'1¸¿> À¯·æÌ„óío›ò¼Üæ_Z=¹ÁŠ¼ÑârÇwêO¯¶Ýuzô¶‡ Iíþ[½¯o·ÝMDèdµ¬9¿õ0OèÛò^NëMJE-‹UŽŽ³G°*€=|gDÏ_;Á÷XÝPîˆTÓSØa¼pIÉ+˜Å•z¿ZHc{¹ªJ2<2 C”'`6Å…RIqÉÚgE’XqÙ3˜HW3ž)iÞŠìÓRÀv[¦@ÿI°¬{È€ ¾0`r½¥~ÛæÇŸÛæ/B‘?r^ gXñL.iܲIáRbJ=%Oÿªâ%®òÏÏUÅ­+­ËÑH+7ŸñD¤²Ôc¡8ï éR‘XÄh>ÆŒŸnùìc çù“’Ö[ ȵCù´ôÐcJ Ž-Ê‘Œ…–cŠÓȇñY ËKŸmÐx°­.H\‘æ™[N7qü£g LVl[„j} Lô?ßeäSÇ1Ó¦ëï´oö_üË¿üËGdmŽ©z×Çãí«¯¾úèôôt÷øñãþ«_ý*#e²‰J7pà}p`0Þ³ÐÆ—û~|öâ‹Ón…¤ÛŽN)þºßÍéY}f»îÿ½ÏÐyjÎë#FT9Ÿ½o ¯×ë«f½®XŸE8 ÷®s¶J›K}®ÉlŒ@6œzù±X¹ïj~øï €r@O1ôu ›ªâÛ…ú^z©«yàpv2RÖÓïI pŠí)CY€_ÜêÕЊzà-Ω{³º  KvøA+é‰æyP&“.š÷R*)gßUÌáðUÁ*í´EÏòQô:ÜÕI€Àe%gž‹‹r|©ü*€ ÿn?p§:Ä%‡Ã81î) Ý箓§‰gi^ÔÌ%å Ö`žÎ:rçƒJ Çìhé¶aÍ é¥pqy^-˜*p$@e?›c(îî‚Åb¾ñóGÃH(;#Ìz˜6X/¤Õ©¤ºBqdzõ°¡£Gg‰Ï”U}y~1g» ë]ÛÛ'íôÍÎþÇ%_¢ô‚ÿœé°TçwîÜùÞ|>_Ìf~´’Uˆi ɪ7pà}q`0Þ»à÷Ë„©‡÷Эߚ®Ïn4ÑÛßdÿ¨ÞÔÏÓz yû[*H‡ô=­ ‹°e›ÖÕN¤E\=D Œ_[{ñ.îBM"TcO¾‹½ö*t¦_éõ+tÈ@žß§“eq„17}Š04„Ê't7*•sRú@Ñ[,½ÒTòiwURF¬ò¼ªä àP˜Q ·ÐÒø”³~U³ôg,O”KkHð%þ HêÝ.Ò¢m„ð­/ÐÙZ•~V ±!@äƒp‰OË#â>íñå8é1@Û¤‹6§àAXl¹ú¨ƒx†Ï Oõ® FxTî²Ñ§UèO#p*33¸–™ªòg &³ KÑ÷Áw‘á&v%¤³bÑðãlX ?3Àkêæ¥åû± A­ÜFç•Ûuuk¾€hõc^ÌuèkˆLÛq»ŽæHæN5­¾¯Tðoã?àºç;´ùŒ*l1˜Rû¶æ«UnàÀûæÀ`¼o– Þ‹(»èºú•WªÑò¤ÿõ+83çƵËQ{Šœ_>Ú2ˆ~‡£T9­¯;ã ŽuC‚¡HØçÏeÏ[#Aì0¿r“ü×!ÀUøQE(ú¤ð5Ò>ñi?Š|ÂcÉpàä?”…¾N…“@½S·]Ѐ#q¡RÞ»º§f<áT2ñs; G¥Ôp¹Ä/ D}a‘)«$Gô‰äœ/¼®ø*D›¢èOã©}±×ž´¤ªRZÂb˜ÂÁxƒ„LrƒEúâR1¦PdDZ©ð rÞ“’šðFÌ´Ü€}nøSò¤GãjO—m$ÿéʼn¢¾DNDm‰UüúäÆTC@‘ »IXqÅY ”u`ž¡ 7iˆ-‚¼k›F)ÅvL q$0¤ðº À 5ýÃ0‰)ˆ=裴o¤Ÿ÷Ý] ñõCÊc7ÔÍzòöjqÌq£ []ü@ÆÊ”Q„vSo?Ź‡—õör5¾víñŸþÝß­(ÛžŸ_ží0Lúï}ï{»¯ýëƒaðîwiˆ?Á§üªžÈ"~)üÉŸôí?ûß+öè³Î‰ï¨°UúŠøYÖN?¼èþNï{ Yw Y8ZmêcŽGm‘{óíņ•þõÜ^¦·ØkRAèÇÜ*µÛyöEU¡ÚëŸLXí t 'ª…¯˜Î’q`Ø2º7=®b¦ä¼ò¦dÎιÙìÜ#¹èh Pâ2O_Wü£MNY‡÷}"…ãïsz‘EéX%<•,xJÞœÃÊá,|²©û²DÔƽòˆ7aæ[8ÛV_EÕÑõAV™»£À¨R½¯Ò¦óî)_å}_òr™ÌÏ4o*—žS+™© ÄDh“Èh¸‘Òv(&;xSòlE*‚—f9‚‘c‘áLCªÀÖÛ`”ø‰G=úÎh=@ÁØÑiôdÁýñÁ¤íØh–Cü|˜Hß©‚ÇçùÔOÚ>¸f×€ß"pTbÁ‚–…; ÄÏVqB!SW±NÓ"F­ø°Åñ±S;8]NÇ“ ÂÝôh¶™Îæ|–˜íh{÷úÍGì0Ø15ðàÚìè‡G³ùÞüs “ÿ‘Ã÷MÀyø;gÏ;ZàcÜÀ§r`x*[†Ä÷˯}­ªþ¿×«1ýy¶èUs^¬S:-·ûmÏwÔ›‘c¿ƒ`½Á4qͼ?àQ€öÍj;@¥÷¿FÅâ>e0ãADê£*—í]%ÅåOX(­!=3*ÕW¾ë²—”a‰˜šÁ€õ&?Ý•¸¾‚uæh¼½žÉ¤å"Ž EŽ"P‘³ÈZ宆‚ç4I×À0KGräGDùd,‰*ƒ¡^{`OÞH˸ÓUP~d'ú‚¥XöŸ@Sò(hp÷øòë MfÂa>x÷¨I—ü'ò3‚= ñ +Ã…¥·(¹ÅaG¹Ì{zŒ[ Ú÷ë3^•yâg F°$ù<¤6Ösðœƒpq„Â+ø "ðêÛn©Xò¹ó¨¸"'ŠyÛgG@»‚!?— ŒKxÀ9q‘™Ĉ”o˜ðAW!ÑwZ|7§³x_Mh=í/È?/h¬‡–]/Õn¬çÕåîš¿@8š<Ž÷Þµçl1ì]ÀïÁ­†þ>¢Úxy˨c5]aô.ø ð›`bËË]¬˜]Ngϳ{€ï(qÊàɵ/ÎÆcÖ6o`"\gàáþ´«žt'Õñ‹Ç—´d0|´ƒÛs`0ö¬ïÅ„¢/é †ü›çÿeßþäGu}ÎôdwY"—X½49Y­6×=cEÿ_é;ᓽGH£èù«#Xø‚Ôaª×¡ «Í—Cÿ*ý¸HÓÐ×-W$„ ŽPèû –”©JŸM%=ãJ¥5÷ÔOEh¾ô¸â?¸$>Ñ`ÛR`²/èw‡¥Ã`”ÐrVð ð.¥Ü!ž÷(ŸžÑUæU¨ ¹"çÝUî“¡«ò„ÂrÈ)¼¤%/½›)aƒ^4#â¾Ï¢M ‘†i<²8iRü þøÎP`k˜¨§>öü3MÀ”Ž~Q2`¬#¶1RFáetµ“^~ÞØ0YPOùœ!摈™ Ø7KàZ06qºÜíζËeO½g/,þãþb1_/»çûÛl¨`ÍB/%£ÀJ56Â7<¸ß  ÀoÆsþÀ­DNÔ¯½VÍ‘A3F"ÇŸù­j¶þiý©ÛÈ4¶3ß~¼¬¾ŒÌºÍÑü“åªù,ðæ×úº;|L…3ú›Š…ÒÕÒÝRöú¡$‰>ÙÛWð ÂÐúSò‰9O„ç˜óãs¼„@Ê…a Iò.‚‡ \!XWôî„¢Ò+ÑFdŸA3p%„h£À¾ÌAFÐÓ©"~·Û#ŽQêR^ƒF‚¾Ú!"xŪUÀ¤ ëIÜ2=Æ„À‘Cq]Ï£‹¢äž=+ˆ›–h+`ás‹£jñ­«s›[üÁ"áó.khúl#„Òb¹f®Ì² åyŠ‹{ã±%Oz¾ pÔdíÙÅ`]áÍ.ñaÏH=È.`l©ƒÂ=>%¼I(Å$gŽìp%=üÉ£÷ÿWžx²#rýÆÉ’XªŽhL9¤XE¯Â÷$AyxL×w”ež§ ˜`̆o?éñ³Ï/ à?¦œþsºÕb~¾S|£šŽ8U°©¦“ñï¼µ<®]~8šŽÎÇëf±lξöwÿ/[—˜ ÿÛ|ö“õÉî1ãTÕ¯ø–&•&þ'˜ƒð ~¸¿¢¦ÕìNš^vÕ)²kŽº†‚ÿ]då#ù/ tÿñ˜Çä$¿Æ½ý,|îVBO¶Î`±Ò „™‚ÑOí"Äpö˜ÆœÅsù´)“ýé#>(ü|xÊSzRÉÒ;Š‡°¡Ì­ø†"œAJ$:7%#ûâV/é‡+>‘P„û¸±âBU)ÈJ:>†A‹ÜÁc ÇÙÐÉ‹Pß™€BG”åVj0]“‹ïÆáwh"Â÷dD•%EšÕ©ŠÜÏëeçió©l2DœÖG_ÏSÍ[¸B€äÂK-}P >RIÒ7'Ù <èPæ>pÓ-S)5ä¼ P丮0 "À¦Àó«÷ŸYŸEMŸUuèE ÐÃÐ÷Ry„|AªÚ™Q Åª~âûUý¤+KUm: I7ü½äÍAuƒùÜökÃ`̲¼ŠþÝ.È¡^ý” ’ÀÏá}¡ "àb¤¡tïK>84R¢%-ûQ¿·@A}¹¬>߆tÕ ½éä8ù6-©ØäGSIy·ËÐâ&SlWΰ8u–ÌáÒ†’Tü  >ÂÞRAÄQ@e‘È-+xa:&xœ«µ:£O–ä§ÞJkíS l½u$.$¬¥žRSò¹‡1‚/€åañ!Ÿ܉JáÀ¯„2}ØéR¤ÿå” ¼D¥|ŒpñrD-háQÏÙWXKâÛxL%¸w]ËBÁ Óôüu±`Œ€JƒÇ2Žªø¿¸-ïÙ Î ¾r¸Áàžô“†Eˆ'ëÍödÄW-5.48Øf»p¾ÛìîQ šíeßV—í£ Hxþ¨_°ŸÀ+ä——ƒŠ÷‰åÀ`|bío‚Eù2zíµ×ÆÓÑîè„|º[Ë®;ÝmÆ7ÛþÊɆ#}—뼺_Ãy½*}OõK>Ò*ä$Ê^í¨’çr딽_¿+›õ O#I&„ 8¤†€T… QzSÜ—JiÞ”û¢Wɲž+÷Dä*9W·O°ž¨‹”Ã"Î4¶19#9xHl•²÷‰=UîÄI‰)¥#!!7í‰â¹Î=Æ(ùòE§¥M‘zu3yåäT²ÐqKмDi ¥¾ùLÁaòA8ðéT^Ñÿ')Á¯Cà6/å§ö¤)ˆ W#@Æ4æW4Ì°ÀVˆ°z—ðö©A§±ŽaÄ%=þdúý îÓ ðhøûžÃƒXÃØLfM{gµÍ‰ØNÚÉ)ßÛÂzÞÝÔÿù¨½ ÕËŸ¶?]ýóþùÆ”æ0a~R80Œ|Ržä¯°|`¤~öÙ/ñiôõxÝ·†çHðSzè§tÄYåß]Ç08qèÑ!I–ÌÞˆñpôvTOª™¤dT¬ä‹!„Ròæw¸_0„ía'M©£¼Vüÿi¢H+˜²5ÔCABڕˈö ƳËÁðDòdrR %Q@a<¾íÍÅöÅ šâ[î0lü).p&Ì€+…RŽŒH©1J¹{(A3ؾX©£ )0Å7¿”)°¿„o¯ò¨ Š’þn‘.í>Èôbfv÷”ˆú:µ=—z è{úñâ\å–h9⼺Î{¬aHÑdL.¬+0úWìÓ *1Û§1‘ñùÒçwƒùöÈó·Ê§>yâ3?U&ã[? ĵ¥¬»œè5ÈÖrXD °óÂ@ÇÀ&NCX]À(ËkÅ(›çh0…à+Êb€ÝYìBhš‡¤]ÃX;ÓPèfÍèÁjÍò›MÃÈ€ãAK=Ü>‘ €Oäcýå…Щ¿K‡ïìÖÇœ:öðGœÕ?®Æ»U5ÿÙjs¯Û4Ïó‰×#d»uõ)zטW¼¶X±éá³a‘_íó>Ê=Ôœˆ™ÔëÉö ÀØ­„pB ©üÑÚ¡,S1z@Ð[®Lº†„C¿áð_9§øI»- 4áì ¥ÜÔ¾ÊÙ‹åè-9U[ ,e¼¹>!ã2ÑpÐYÒðÓÉmóö— æ…ÃËò¼D÷x} Ì{YÐÕï3Ó¸†sÊãUëË|‰<„¼¾wÆaÂ×’jéå3¼ç³º'Á©†¢d¨#šÃ·½ÑK'àŸŠÑ©‡­…±—jšþRC/ÇÙzé–Ù2O¥sÙ8ü'Âg«uB$?("?Q¦—r2yE_/mY*H;ƒ|nú´?ù/ø0F8)fëÖLùç»bÝ<óðP ™°œÝA°<æH‚úâð½*Í!yï"¨2j£²N¤PÆu2bºS%>K{ñ®ò÷w4ãÛÝŒO »K`‹zÎ߈Ñ>º¡/¾Xnââ™ñ‘ֲ怳Š«žC…8~ˆU~|3cÉÉ]àï¶3¾ p冾“éô÷™œ{8·ëõÙ?8?ÿÉ<ضËçž{nÉïë Uûæ 1àcüðþ¡¤÷»ÕøìSÕÉnUO>àÓͪßEnGõÍÕ²ý->àó{»];¿\Ô'‹ËþØ©E¾Ò7¾XveŽ#ëødoR4M;Eh'å¯Â¹~âS†ù'lëK[ùXùCÕ!{µáT0!@C¢"ØÔîÙ…ÈáC¼´$º¾™.J–ˆ~)$DFkÒ>+’¸ #ÁìÀˆ WÀ-{Ž` ÿ–ÄTa®6€À6E›ñ÷Šƒ@ ðUk€ÝÎôå¸Õè¬) ù§òR¨òÐÉX0±Ô;ÒíM6,:‹^%8‚cŽ Ë/æÅÁ>Ä· åoyÖþy¾ý‚íia Ö0Í2* ˇq. ]Rq¹N¼y+ì ßÖ8H,l¶9Y§‘ÂÑ®Á·W_3Õ& añgCÉ­¨EÉFå2WÒŠyfQþ‰Óø¡Ñe}fÉÔv¢;ÐQÆTœ†T±ôˆn9Ê_g-™Š™ ^iŸ°#c4ÇoÌ‘ ·Æ‘Â(G4ÖüxÖy}IÏß'ÚWö·ˆ²×’çrŠê‚g9wQ!¿IŠK*pD ]¿èûß=Z¬Vämo_»ù¿’¶A)¼=´q¹zô§ëq{>½1ÿÉËý˯Cz÷IâÀ`|’žæûlËäËlöz“3ÄÇÕô¼c•[=é!7QÔw‘÷|½¯þ}ÄÑlGWÂÏ–2çϤ‹8¼Äž Z¯øj-O)ãb¹¡/{’Q@¬Dfàj¨˜€TÅ©¬ y©ü4l; S§èŽó†ÃEj”1jYSbž˜@ÊÕÏpeR½WéØ'©>q”‚g)V’èÀIç¾Ïñµâòõ×G³ê™y·ZÓ-9YõÝuDÏuäÉ{ú1F„c¨ÃòòY¡\@x+„• ç|ÙQŽlÒ.áT!<•‚¦)¹ð“53þIÀ«¸‚ ÄSq!JNñ¯ ~5¡¨ƒ[©K½YêÚóÂÌÄŠÈT`'%a9û‰Ù‘n“E¦gX_E¥òÕWø¤Ç0I kHNt‡.†êI£Dû|qYÜÄ&?Ç#ĦP‚H°¦‚íS ð`K¥ŒïNúmÑbùÀÊ•ý¾[öè[Fø2p<—–¡þxÑÈK¤‚ÔFcˆ° .Ïp€»v6œA°ñe'ž7 ÉN„¶nGÇ‹Åò6£G#¼½¼øÙý¿þéO›Ëͦûƒ^p:`O:E÷1åÀ`|Lܯ‚ìÝúìÚº~ð{ˆ˜çv»æìáƒÍ¿F¾ßeZÿørÙ0Ôo‡CIZzý;">øÙwÌù+¨HBRÔxÆJÿÜöúÔnq¦H(#¤^Q‚Î{†#-¶½…D´§£¸KyêR/–D‰žf±Vu(XiÈ´ˆç2x.°ìãAOŽ\ûÌ÷i¤…lQY³–pÛŽè?G8)Å„ƒ„mü‘,MWSOʶ ÌlÉøK­ôò3¬u{lðŒˆ£Ü¶Óôt:À°íuª œ wÌ©vú4ÌÞ½9*6{¶¨•ˆÇ7îÎw¨_˜ó »ðþ_¡Dô-³ìüƃÓiE»§Þ.³ë ¬Ã?š(€‰âtùœKÜpn¹éLó]gŠ·ŽêÛº£è5Gÿ~ŸØˆ%ÂÅÊyBé½M¾•)$—»ú†chÇ°QyøeÛÊñÖI^€p+uE·hwà ]›R, h¦4-µ˜0y†ÇœPzðÓibËõªªÙ]£/MõEÓÉãéñ,¤¨çP!× ÄÂ[Þƒ-ÙÖ  Z_.ª>[«-GvÎÙŠèÇ…Næóº>=ý<ÀÅl4ùO'³“??™ÍÞàðóW^y…¥CÕ’kps ÀÇüþƒÈß­Æ ž"Žo²Hëã2ã.ŠxΊâv³Þú9sz #z ž^–T2»Sµ ªÔˆ(¤W:ÆWÁ¦+‘e³ò,9-|=T¨¯D´šði6Eöå-¹%h5‚¥JRÀÔ<§y:øè'Œ·¬/a”­ä9ÿ`Ég=ùÄ0Ç GÓñø:Ïý«áÃïû ¹ÂuãîU îÁÁøD<ÆŸo‚Wyî徟¬ß¬Ç–†·ëúg«©z»Û\Þ;ﺻ(…»èöõ7Ç ûs–=Ù"DˆÓ³ —K/[Á—öb'á¬8tîPáXzýÅ7Mi‰ÜŠK"Šl ¹—…Ÿ@v õ“’´ þ‡¼¼¡¿r‹k÷hëJ†­û0nšîÝéïÆ@‰„frR8ßñ&ú-A^.«°Ï£1i®Þöð/Ãß^èæφKS±¥ß×uØ`p&^DÆ›e ž)®}v‰>ð£\ö:0X5Sg¢Ê»´«Ü4)°‰¡âÑ»'3(whô2¾Žüd(h0ÄÙü¦å!èb…ÒL”&Be©Ç-‘\iïIï“ôóGœ¥l †p¬sÈ>‡Þ’—`4 T åÇ1ÍCrö¸*‰:¨¶ 7P“O£3“£:Û Ïu¦”ËxI¢V¬KÅð¤÷¢ô#-žwz;X¢Øö_¸Œ/ñÃ1 ÖÙx¾ÆˆvW-Ÿ ¦'¯áDZ H§úJ¯¢ œÔ±FÉ'¾y ±püƹ]22‡.±ñw²ZM+–ÂH웬G¸·a„€Ù¦ÚÜûÓ¿ûë‹nÜlî­f—_üâÝ\ ÷,0>¸>à£ÿŒ>…ßøÆ7šÏ}îsÍã[·Ú;“{w'ýœÏôÖ³KVû×ÓݳüÞÇ—ãgW›îŸÐ90>å,ÿV{s(YÍ°?«½—ô½ŸñU‹ ¬± 9½´ ŒRoÍ8—²'ò8-p(>éÄ-°¾¹J"\º_ ¯Ûápô!ð¶?r50 pF¶>œt—°ÐáÃô\ý¾H¡#ü~%R ó‚W9n’°q°÷I^$G1hÉÅ%RíüD2‡ý“œ5×}ø„CýSÌ‘F( Âq–?•˜,°Ó²¤ªþg‡aòí=K‹´îÀë8…5ù;•¹ÛÓðÚpNg2˜4 â Ó¸"_­`º¸¶\ñò+€Š¬,;k5Žg§2oă®ô·Þ¡\Ko|:=b½-'¢Ô×0{½ó° ÂL ¬BT,$?Œ`Vìܱ ©nÝ°¦¢mùÐøqLøA¡S;\lÛM'Ó-—À4ù½?¸~ãú1†Ç%üzëQ»ø>'†¾Eý >&æct €ÑÃúeIå‡Xs˜Rb|ýòîúèy>IöyvoÝ@:Ÿ",™÷¯æœîwsqÙ~n½éoÚ}xÑòÕÒ¦N½æŠ ­Ž¨ÌB¡Áü¾Ê^9ä<–G„“¤R¸„‚ ©‡@‚)|’¤¶Ä»LùH‘dé4Âᙤ ’‰ØŠ_gžÍrÚÞ<Þ|9C˜ù¨8%1ø‘ €èC»_Ñ‹é+ Ãrâuí„È|ûËSqúáÀl¶ Ïîph?Œ_œwÛ›BÜS²Y H^ÕÈ‘wøÈ¡@àÖß"SAí™Í!Óµ~)Ð|ˆ«Z¢°ûz’gÏxÇáò=‘‘^Zô;åè €SCÈ‘)Û&ÎK®•ññÙéñNúí‹ÓñhÍdžrØ3õ¨g7áöåm39Ø÷|¡{W†gÉkOêªaCè#ËÁøÈ>šagg| Œõ_ì Ó³c¥uÖÕ;>äSŸ!Oø ÷GüT9Í¿k¦õ÷|D…æ"¿8ò!çêã? Ír1„—áC!¶§š‚EÎÅÀ ‘œPÒ÷°ï(€ÔQ‚ï=L? \NГ̟ËWšFGqÊbþSåÉWx—ƒ [D_<Äh.lØ WqÞx.Z²žî¤âIåx1Wï3¯ÆQ.¶÷ñ—Œâg¸½gz¹ 8}•DÊS±eUMšÉ¦KTDLˆvh€D[‹ONŠ°©½IýXöI¾„áb¢ *ä5ë0ÐQ¦¨0ê5CuŒ¡bqGË¡9l œ[ =÷€¿Æ&ÞoÒðå¯Î­w†<°ªwª€ô¤Ž5®œi¤+…-+™áò.ñhÅÁËUÒ øÓüÄ‚™Ð•RÅO¥ÊïÒGïI›š+¶_£gDÜÑ×æÄZ…!¾,uºFxZ×mc̵kFZ4ø4ñ¸ÛîÆØ cÚN_{Æo`Ì×ÎøHÑÉåju¼f È«¯¾º|á…´$r0žö`?biƒð{ ¿ r¾ýíjtýùÓkݪ¿MàøbyÉ>£ßgóÔ->Ñ;;¿èŸEY7ëfvq^O·Îõó“e±p†íµ™«lt­ò0†øÙy„@!^¤`&ÚÅ_IZ“ @ò"sËfe¸"drtï…0+@YØZ(õž˜’E®ï­(£…ÞÈ CÀ”pö|Q6#(øã$ Uw$&¥«ÈR©íN€”g\ª¯†Ti0¶ ÒÜQA Ú€¾ÃõýÇâ:{´íÇ(FJ<궎uää»Eô"?Š…hheñø'VߟÂS·äùÎʳKü6 2¹0ZØ+°¼ B0à°Ä¿WðÄ¢½*õå¸ %Ÿòìå§,ϱH#ÒoO8Ö 9¾Œ øÒ³?>Êh,h(ìy‰‹öKo´™„èy§Ñ´È·Âp¥!©MñûÉIy4úI0cŒŠ8%g%VáÎŒÄ÷qq´Æû Õc­é.æ4¾ñSÃò‹:6üØÃh‚&\lS!1mÀH‚|è)·]­8ÌkÔ°ÐrÆøÃgØ)°vrvtüp:Ý}zÚÔ—Íø¯þû›?zt2iVíE»¤Ž|Ï-JMî- ÀGëyüJ¨¹õ¦I_mΚQÿ,£Íg»åîwÖÿ ¿ã»ß[_\ì¦,ì«×›ºY.F£ c¹ÊÞ~&ŠQB# džâP¶ öé‡ÇЮˆ,š3ôU*ÎÜdç/Žm’‡ XžJFe/(SÑŒòPþÝ?—NR”Α§ÁHâpÁW ù1œ¤¨R<-Â3')°¨BB.ÓC$CS“Ó"*Z|ï'ê¢U©iÙ°p”‚yãŠp*÷`CN2©Š’kgX_˜bKˆR]Ä6ñÀ0¤7¹È0NÕ‹¹oy‘øâÝ…‚p$ø1¢½5/½>Êp Š' yGžLu* 4‰‡º_ßç«1uj ‚5=Þ1^6Xâ+Yáä6Ž2a<˜I9a#9ß#L˜øÎÙwkNÉËp’”¸šÞ¯0¼¢,q §||Û%,{¬ Á“ò"NzÊC\|±2. –árýHw !”/iV¡%Þ#+…F+ô÷ oÃý ˜m;ÍËiµ¼1 ¬Ð€!…²i@Ǩ“¾ÑÓç)»˜Qô¾gérQ/#|(õ ëIã€8E‘ á š½ê£@´½&Üñ©a ¤f2áS^mó<Ó=;æǓɲŸO_`¤ááª_¿q}væ.Í‹£kG6Äù%ýÁ}D90ÑóË’…ÀH²‘ð­WªÉ)Ú{ûoÍ& õw7»msó|nrfÿ-æ¢olºô œçg: ü-ãxŠ÷ç+?ýŪÌ"^jlte¥y•Ú-?õ¸íõ%É-jÅÅ"0Á¹ÄSüØe`P_½œøDõP‚ à@ù xn‘–óá0_Ïac}oØÀ!JÍSÁå?{ ¥¼€‡U_¥›#¦r)´ ë¢Ù7œ1D¼ÕÉãð“÷D$Jp‹"9¿„‹ω< €Àu€/ÒLç µ‡N2m‡ÊO’¥µlz<]Ï^®oI,˜£Æñ`´¡:P"ÂgƒÑ²àÒ`|( àvÂỀ.F¤SVÙÕ'- ÕFŠÊÑ ¸… J3RÉT‘ ”J.‰'Ñ*\(ÿT$Êe¥2X:’èè Óe,¶KÛåF„݆W¦º‰ÆïN¬_ñ7_Jƒy˜êŠJ¤=èL´¹W!Ú!Œy (…lƒ)ò3r S.óÎÄï$JšuõÖÅóg<ü4JåI‡ãëö[N«ñ[ÿ¢ >hó‰li§gDø7bÁšgز»`Éwš#œèé“åL™õÒæSŽ¾Íð?à լٌn]<^lV#Ž _tÝ÷n>Z~‡Ï ¿ä#÷›ÅƒûÈq`0>rä—'Hå_>æã6¿ëÕòöfUO»y{òpS}òYæøNëþ ×F P/Qünís.›íþlV\! ”Ž8@ëjDâ1ŸªpŒü,܈G/'Š§²À[L)®(ÈKž`ŠŠD¨¤lr(!“‹lƒ9!äwÉÌ0O§Ean ©ˆS B¦ñ—>À’ò5Bˆfßú-¦HŒES!‰â”;5î9’Â*0]Öf lºÊU*ôöÚ“½ä=|)—A x“KV¤½ÇM¹¿‡GÑnÂÏWà'‚¤)žP¥ÌRÓ NØŸÞ {ÿ*%aÊ_²,(,Bùƒw®F‰¨èäAØ«*Nß5Omï9+qÇ¢ƒ6€<OB†o-)ÏÕˆùv[õÅ'/å/½s)+Þm@ Øì©~-*º0 ð¬wŸ€{âMßÆÈp0X~פCh+ë©V8â,„‹ßÍ“|/D»¢(Óð ZðIó íN´häN ì"Iƒ”´xOÅãUà³ï+çïÖ?§0ü.‡Õ÷C@it0záW°,U"-ªyÛ²¡]ŽÞø‡[c*gÄœœ>H¯¿}¼¸<áQï˜"Aÿ7Ÿ½ØtךfüÆ?½¶˜7MÿÖæåE}þ',üú`”Çø‘ñà#ó(Þ?!/¿Ì(Ü3õßþœnºõµ¾­ÿsšw6›öÖùªþìåjô[l9›0ät¹ØÍc??Æúò1ýq„½=Þçú'™YñÐdê*G9ã£=øÊŽö'¬ +CÍJ{Ê!YC\bRzŒVµîOžîÈ‹Dar@_ÁMEPŠ¶dT’O‘è(…N¯ÀQ-‹–ìi‘F8@r@!–zô@¼™DÜß]9:Ä;·ôó°ê˜Ê”F®žžP™ÚL½­(BØvˆ[%°—àa5Q[ä‘ëÀ±> h$‡â$j‹bŸÏ_:ôÂÏC@¾ÒžÞaòZϤðù¼h©Á+$<-³Òø žãû¼¦y Àž¸ wÌý³jß•õa@XÞ¹úÀ(÷·TCª/=¼–nŸÁw­ƒIñÂIohÞX ]¬M€«cø¤áÓ°dŸ[Ý"è{ýk†ÿÝ žm-8ö ¤çNS–(~é_ÐyŸnWÈ€–“?ßç—îZétrúh»úÒüñ¤FÝ3ã{_™² `¼½³›Nÿr¾ÿØðˆÏŒ}ïËo¼ñ2(Ý(2¸à#ô0Þ7)_@˜¼Ét,ûxÆÍd¼n1ºþ¿âÛˆŽ;üüï"(Æqž?Ê•]}!›7Ìj8Ÿ2·(^Ly•„NAçe¼ø†#?¤@ú¤%i„_„§I„CàšŒ€ …(°ðºâ§XܳŒMa}‚i$Ɖ ÷°>õŽWôÙ'[ã%h\F<ú¶+Êe£­ 5÷B¬> F—QÃ0+ò@fZ0K˜ÈÃ×xühóAüÝùÿE·RV´„÷×aܺ3m‚—‹ /OêÅVÁd |ßò?T[>Kq$?G,ž€Š_‰ 0ahhFÄhÝl·CÊ˲-2^4 §¼£{g}¢È ¡¸£<Ê2&PŒ¹[a]ñ<-ÃKá{¡ ~›õ`‹4%FR2?¿HGÝúÀUÀ4(ÉÄ‹@Ž–å /ÂNŸÄ(u¦áuy~Õ–¨ïà&~ÂÑýM2 1ƒ.}€ƒDü(ëii±¢Æ˜‘´¾'ø<ØLï‰{_Ú\þv9„?H\1Œ¨а̀æ#v9âN¤Nl!Z{‹ÐB†AŸÑ¤½¥­bp! ÀGèa¼_RîÿÝýéÍ“ê&ÃûüÐF×k¾æWU÷èé_g=Ô±ë{|Îñ»¦':8ü€™–C¾ùƒUøã+\ùq‡Í~H¥qECˆ‡¸)OS DÂ< î$֕鄈ÄSŽüœ3Q™›3 † .<ÈÅax?‡OBêÝ›žÚi9gR@‹rH¥sf@Ñ´P´=UZæPm´iû]” À‚OÜr‘ødGF2 ®˜ÏmQ(Fï8²^ÿã"/¢x’i ݾŽüÌ-ÙáŠT<åŽÄˆîa¢\†3»¸ ƒˆ¾ï‚ô›/§m¯¸Ì3Ý)!épXY¾$%ìèŠÂ?v' 8ÈŽ¹f¥9Úç8P:½7ÀÙf•E%).šüܬׅ£‚¶‰h¤é¿Û%茖)ž@ëˆE©2!$]:5„K½Å±H~ÏO¦Ë,ßA߯Hã9¸Çú–œŠ•ºà’ž„8bÞQGv|ÕOZ³Þh«à¬G`ÂY×þ7—’öQ*ÑãïZ,AMù!“*Û×gOÞºGŒLÐsßÓºë×BÝéwæ(Lž.„8 5ÓÝ"¸ã!۞ŒÓHc«`µX\òÌàì¾"vóq;þ,ÆÇCžüOÇïT¯½þúëýÝ»w%rø˜Pz€ú}0>ôGðÁ 8›tÇ‹M÷~›Ï®W›ëUÿ™Ó{vÛ5G‹E?¿X`¼ó^.êÊ…¿.þë¸8⟪‰1ÂÀ-N Ù1†|è#d£¶1Ô_„RdC(S~äÊ”ÔýÀ²ˆnr@•ÃŹLCD\¿È•|q{!K“•û$*€Ö"Ã7œ>õ*4í£'’BÆlŸ~„¨ } HCñ©~¸D‚Ä“A‘2‡Qq˜^²Ðèa—w1¦<µ{ú-uåöÆD™%’ƒúÄ<}àJyæÇeK´¤3ͶÊtéí0´C©êoÊSGo9~Xðšø„)1«5Ý%óúÂҵ|ïøÓpÚ ­MiWï‰áäàÍ8ø‘:“Oès„ Óé,~ÿþö5Ð6ô äýriÛÜ ’ü[9¬©ç“Ï[¿5@a·FºÄßÇvÉ{Àosɉ„Nw̦ãj6›žogë/Öëݦ%3ᱸ¾Oƒûˆsà›ßìGÏ?ß·÷ïWÓÙuN󫫉!~r¾Ø¾À0ÿ?Gù¿€‚lß>ßÝÙlû ¿öƒK¾¢ò´/÷ý€-¡üƬÖWÔpÎgciηˆ KîK#û” OqyÈ2rÊ,£è‚¹`(‚±È]ý¨!÷<,ï$ƒW”1dï$«ò g¼ 1ÛãQ˜[­Òh„¬è¥Ìáˆ–Ñ ‡5C!—RÉeõüøâħSœ5î©Ž07Š—¼6öJšá?â6Jo:EDÌKéFíUWÒƒvëOˆ:”G¢ˆHŽ3¸á‹±LáV¤çIº`AЩ¾òÌ|˲”òÌM;Kº½Àà)™kê`ë7Ï€ [æ–Wðõ[ÂÞÙ-0*9QŽë1B^ßQ¡Ç|ˆfŸÛ +tép²p(ƒ Ê­tÓ±8%ž·ÏüÖN+Og”÷5 …nü§·7½ŽfE–EdÒ>f¨äà[G¾b¨Ü¨ùQ>"idÌ—³Ðí‚x:ˆ(ùsà —Äá(╶3æòàq¡YZ°1?ž+=mùïûæ·Ê{ç|¼ï©¿½xf~s@w x0‘£®¿`ÁoÀÙÜØOx)¹ŽhˆÛ—<~à Q0yzöé·ãs‰)h|üørb#l«ÍŠ‚ñy`àãýµ2pøNîOB„öCÿŽ`Œ8uêæÍ|ž˜ýŒjœÍªëG'¬}hv×ç'oÜ<9{‹Ï ?âcB?½}vãÿ<šÎ°VéþÉI÷·Ÿ¾þéû’<¸ÿùFþçóü}×xzZÕo½Å/úŒù˜þCOO™¤ kkSíze†Ý Û”©œ-y×6F,NÁÃP»¥"ôå_D ¡È&O ÚÇe­´ˆLswüxM³¥Úp»=! '&w¸i`}ZW”,A4dýŠƒ„'N=$-ɸÑÐ(wÍ—¿êZ:V|èš⋶¿ímàâ£"ÿ#Žƒ„UR³HeI£t][FT„6¢7›å&mhÙÀ4ØŽ>«1ÊnõMDöm&iK–aåÚþPÚ16àŒô Êš‰¡ÐB(*÷ˇÔB¸Ç´#u¾í2Ê‚E€' HZßôÀ jŠíŸY:éógѤR–ú„1ýbÄFÁ\¾„`†ÖfRw¸apÅþ€lo¶ãâ!)®Ò›¥Ü)«v3éoºÍ.Å^O¿¸(3 x‡,VAò³Áî+ê×›çäŸü®ËQJà–ܘò°)Е­§"üNÂ1‰°9ipÄ3g»ño_'·(ß?=mÏ'ç/ï¦ãÅ·ßzëÿ%oWä‡îÍ?D Ü+ÿµü Ó  ¿ýíoË §fGãágà_œl·¯ÌWÛÏÍowÿ¬Î×Ül'K¯öeô1Ÿ3ííÆ8YD6ÈÙ·eMsQhÊ$Âö¹;ÆÆ؉‹5ø[nmwÇ,`³å…ò0ƒjÚ^¦®PS„ᕸó'óäÙxÅhs—-=!M>Ék² ›$¦W|ÍpX^úoü˜Ðx:ùîñl*ÉÏ‹'ÓÙæïþ—7ßôB÷ ÀS/êïÏs¯üýÕí'¦üP»ó¾ùÍïŒÿñ?þüÑãÕæ”ãÍnú`½Ü=ÚîÆàtÊ#„;›ýèL¡zDNÞá:£BÖÇ^µ7¸á#öó<†ëÖt»|w¿¢÷G˜ðŠMRÁ ,?¦«Û<˜ýÂ"„Ï5“Wáx‚,ü¡1Ü Á:Ì~0ØâŒïp&àtÒà;LðlF•ƒa›SK÷³þç…ö“Lh¤0wP‡téiƺ;…gáÃO·Syñ€aÚº[|êà ?LÚÆå¹Cé¨Í.uãG¿(AÚo'.@ 6&Á ì·âö¿J(#± ¦ʈ¤"|OQ„»}䡧¢àˆVÒƒ÷áQ’ȨxÁ†¶oàU¦Â!O¶e¬Y`Ѫýœo-?à—Œh˜nK˜`k§~I3ʹ¥@ »ÿ>õ†ââìš³(¦µ}ˆa¾B,I¨ÉCª¨&¨Â­?¨Uí C¤e£iÀñÑËc}÷̪ˆ#ŠBƒß} æ×k‡%áÆ•³ÐsƒûŽ‡æm³=[í6lD|ö`²Û]½{ýÝï~wø½/|oýo†ÿÆâÝ›¿Ç¸Wþ+÷“VøÿÎï ±Œ6½Ù|ùâñfý¥åx÷å›f¯¯oÖ»WéWg«ÅöÁåõ‚¯q1åÏfä+/ùÁ–m—S:aº0Œæ®C‡Aî™$Ý9G}èÐvÚ0°b5mösŸí®†76’Ž.³pÊì‚ëÌ ûˆöBÜ µ‚ìŠüÙÅeBr"Ç@e<¢hh`d iRjR<6nøG1'ÃãÁŠ»hÕÒ@ƒƒR#ƒÀ†)U! wÑÿÀ„ò ¿O_ò-NÛ)Wmƒ‚_Éïiê5¹Ä·8}ú5ÝÞ—»JÝÂ{,ùoAÌ»0eiL×¢ç*_l±&ÞGš=w„G0Þð+OÀìóÀ;aÜߌ7ØI(£[…J«Cg\ö-:Ò“®yWN[{³­™.v¸¶tHÈ"p«>á1Üú9)&v<ùNSKÚ’&6O ®ÔqfÐ;Í…hB+Î_Óéá8ø·‡` 3ÜOáƒk™“QßYIßqjß/Ebf>t°¬ø„ë†@iÄT¾“Ië(õ¤E­ôÊ0² dûßPe[ÚCFÊÁÍnèšj%­ VôSâa;òÏ7°Î ¾àg˜‚ÖÓ|ž™¶ÃˆÜ }%ÀmäY|¨ yÙo@yª„ÕÚœå›2à,âv#_©úpŠȇ¶"1Ü{”¼c/ñÛNVÌvÈ ¸?ïF9ç{GÔû§\䉘qxx3^ýÖÉòêWèkO.Î..Ïǯ¼óÁÑîñÙw?óÃ÷×ÿî¯gïÌÖo½õÖöþ¨`^Ù§þs¯|êUú³|ã÷è‡?< ?žlë×vÛñWèƒÿrô|¹Ú]Ì7ÛóÍj8áË›ã'sfà®Í-œöÇVð¯éð2šðdù |',Í>Šiì !Q®0Ög¼l¨ù[8VŠiÔ4±˜ÅŒåq!Áý?|Q^ë,█ƭRá/#Ý–Ù+kÕéËžIZ‡Oct~ºíZ«€üg4×¼al‡œ¤Žð‡ Œo9,uÔÜâÄÝ“" û“TK£¬Ô\Hè-ŸE2áÿ›ÊÐ'ƒÍ¦Î=‚YéÆz+ àqY“¢~ÅnY"ôqç†6„a6»– §Y·¡oä~†•õçÀ·Ô¨/ÿ «7SiŽUŒSH76ÁFm¼Jìêï%Ÿ6ŒÀ-uè›vÊ_eEFŒ-ÜTU²lkº•ƒ­iÆÝ2'T½g\šV›Áó%Ea1‚ºLÖ è.<ÙÀ2Õ*[¦S¦ÞèÆI9ÒVX2ÆOCZ*´ÚŽÂk'?‘úÝ7Æ_hOgÆ #=ß9&»ï©›Ø1¹ºqÉæ[Ú$¶äŠáR˜Î÷’{@L¶gßO–ô mÞÁñ‚'i˜ªEô‘°û&Ü’éRžÇÑÛW£Ù1ð[­Æk{âeɱcm«a3år éP¿›Åš#¡ Ž7|¯üáprt|ŽVðœX³´ñäüÁƒw·ãѨMf³ÿ0]¼}»¼°JÒ¦d6ïͧX÷ À§X™? ):yúöè/Ë:ðév=¼€¼ÌE>¿Jÿ:§¯†ÐŽ<Ïïg|ë~?ðƒ›G³Í(£Üòh]åKôÞÿlXÅ~´wõÞfï&4ü]– £»˜BøC6‰g¶j,s€˜~ˆÛss˜Ìù, ¤g:N½ ©L„| ï°Eƒx»љGXѵ[`lƒÂ"Ø[2†û–×ôÔ™½¿bë·Ç¥ud²²gŒÑý1ê°¦ ïiº{=L!½ê‘”‹4«œ/€dùÂ:€2É&Z¡õÛ@ô˜®^í¬E‡Z÷KÓpýI(î ü¦é @:wÒ•#i›GZŒÀšØþTÀN¯’Q["wwv»ãcqCÛË_Ü–H:ø4¿‰ÿ„%oâñ(ü1¤b ×£ß8=üø/mUϬM‰6ìhœÆ)T±C¼ù÷{œñ­î°3ºgØ­Êå>,ð ·>ýw„¾eL6J8{ß@XPòÕÊKª(Àî,Cöý˜$ùÊ„ëVJÖô0—:¤çm‚Ìõ£ø£˜¤aªÄ€„¹á¸àÔOD³³‘˃Χ,ŒÙÉRÁ«k×GÐüàeOO_?~ð_Lw£?Üýþïÿþæßø†•qo>ŸW>ÅÊü¤¤è@Ão}k0öœÿÙÙp6šÎé]ëÛ>à^ñŽñ¹ÉyÄÿpôçŽÿhãÞ¾åÔ›_ùóƒ)òŠôj{bz.^û²ý­?85‚¼Q5*ÓND:uÀ`s'‰+u¨&a‚Jé(šÎJÈÌb5’Rf¡ë­<5;"ÁàÇ@Ò¹ã¦3¯¼KƒB’£AÚz›­ÇžÚyˆ "Sª2>èú¹TMdBô2ž!S„ÀÔte1Ÿd‰FÁÅ­Jn§Ã;?ÍÆ«nR”@Çi釮á˜ð8ãy2ø’6Fçó‚Z îúÑñ LÆN42•Fe@±Ò‹ë,p0ü”±³Ý–aâÌ¢OÁ#n*ðÎ&è§Óyö/ÓÍ~´&ùÁæÏ/ÆeÉ€°)£K…RÒK{U@¡¸òÒÒ&WSÝ–€[®’gqòŽ÷ì¾g¸rÙ&ÍÒÈÒN\¯ÓÛ °ŸX0ëO€öB»2"«Á“—A"­SŒ6²MËe>l3¤'m§È݈!iÝÉc"«¿éwbŸé3 mi¦úiÓ×ýKyÄ—?[NΔ‹_f γS°¶êqû¢ïŒÇ›úÁ÷>µ¿qÐô¹>ÒB>ïÙâ+Àyú§ÓûXà½xîßüÈCüàüæšlÖÚŸýòJÍ:#|?2dš;Žçny&ÐÛ°OérÈòùYÁÔœ%¸>š79á3Bÿ|~|³ayàýSî<}ðÂÉ„K?œ=:ûÎ+¯ Þ$‹WÉèýϧV÷ À§V•ŸœÐÅ·™{ƒ›üo£å„Ñþb{Â”Ü ½è„Î6ã\<3èåôª¬ÅÁÜ4•K ƒKòËsÇøé{öϘ煅kÆò ÊA˜zÿÈÓâi¶L[Xžð¸N¯…%3ºŸkÈU8Vå® ˜•ùàêÍ­Ð/ ìî(¤ú%, -.–8 l =®Ù‡èº@÷i= ó,Ü-æóZØÉ—™éy{ÊîðÍ–§÷VñÜ:úié?'¾Òã7ÿú Ñ”Ú›'¡SkÓÍoò¥ÿÜÑI̽ Ä@KðjU.´ ŸŒBì ü‡¶Ñ-ͧèuÏÓèNyß¡Œ¿µ¹¶ü¥Œ– vS$Ä‹Ê#Xø1i_vª¶—K ´õ»žÈnK˜ø!>a—@¨fa$S#ó 2Š·Žkä_i’+ß8BÕ»C!¾{šÂ…·iýE²¹ÔfAœ’9ýïL€›3;!8£˜•Óÿ¬ ™S”ŠS?üGSÃ9§qƒÈá†Él4{d• b„+cÖTþ¥zXË×cõ nÝ[“æ“ÿ=1C³œÑ“,¢„N‚ óxnK°^ˆ¹i8¦ïf2‚éØO$^||{óëÌJ¼?@u~ æ^ø*ñ“øýßßÞ|s7ýÛ¿¼zûâl4úMQ_ãªÌG×·ëÿšNô÷ùŸ]­Æ¬¦l²æ*Í%ÌØi§»…Ý;3óÞÍ9u}ÏþJ†ÒaÃÄðo¿¿3ŠLYw¨ÏЀӡ³Á¿»€½sÀ™#7^ì! ûéX|j'T ˆpG &Å Ì$S fXœv‘Í (:ƒ©8/X£á)®ø6L›§‘ÂÓ`{œ¹•™IƒÇ¥‚n\“Ôd3!Œ¯Ÿlªñ 0&¢!R—OFº†aú=âÊùŠé Œi8w5u—žø¡ñò‡á]`÷4-§ÆpÎNÇ6h £ÝÃèÇ“pÒ¾£a=8âk6ùLº¾×ȨÖRª$ÕÜí?çQ¸p<Œ…=—Såxy¿âƒE¥45šì`NºÂ-wHg{Ò”ßTBßY,Üü¸9Pw¦š¡»!ŸßPåXù¸pœ’®%c2d&"Í”üf³~Ó3P\}Ù¬ *¨–£âctº7€gCðâ¥" Lf*KT³gmëïïÛ‘u–7#|$c;.ChÅ¡¹k˜®Ó³—¿È‘^å_h‡žNÓ"?Ø!ÍhÚ øCÒ8³®­ZVerÓmØiþ š¶¯ÛsöAýS–vÿÓïå@#”Ž(¤ÄÍX07ܸ>K¹¥?¹\HŠ¹•4ý‰†Ã1æ,)DÉÝ1åáÏ2Å|3˜­&¹:xÂg¸(ˆƒ³“åöâK|©ðn¼&ìˆãÁpöÎâjóäW¾úÕÿ ò·<÷æç¬{àç¬ÀOŠþõ¯ø‡Ã‘ÿØørÌÄÿËôÎ×Ñ«m¶Ë_Û¬vŸY²î¿¦óÍ92³¦³óMŸÜÎñ ôgúµ,…?›™àÇNœ§ûÃô`ݦ* ;«¦Û‚ʨeغå—ù˜;¾þ(£Ý.èäfÏËôշЋÉ߈éJJÙ•÷Æx)ÅÙ—¯ÅÇßGýÀ(ä Ó$î7Ìzjþ=ŒyIýQ†ÄQPao°•Ô4NËjx¼AûœÄ·0"RLÁ WÌ «9tÍ~GOê2ß=üÁ{Îh.tK™ªÒ°*…Ó›R/ o8NåöÌtÅÀtêMB©Ói Å´Ù@ǃ˜²ÂúÙá:LâÈG§k\áV}Ùîüs¶ÀÙiáL³+úÿÒ$w”7vA&Ü!Ü ¦qÄX ,¸uUF›„ö~ÝÝÕë<Ç©p{°!jì8§ýË)Jb0*Ó'å1¬p+.»õ;i‚º1—þŤÜÇ_õ_Óÿ2 IDAT/ŒZ€x…vvÀRÞÀêÖG­ƒjûÚqsŸvþÔ­Ân»»©;3n¾ñø;ꇞ#>öÛ£Œ*Ù”Œâæ@ÅCú—ù©T©î+`Ï€KG.kzå+’×|}P…ns´œ¬_äË’/îÖ»Û-7’ô÷Ý#©Éƒé“­ Ý›Ÿ¹î€Ÿ¹ê>>"Å~“ç[ßúÞôáÃ/œ¯V×ãÑzø`½Y>B>âîþëÕzÂúþpÙY7ÙÐØéh`ÒQº;ܤ —b· Óßáݺ û1pL»ø…ÝV7¶ù pþÈ8šÏ€²~Ê/h1 éÐêhøËsH£…I~Ûâ;ª^Ýyø Ý“¸À=„ñÓâzxà¥eT¢@ŒÂÒh“ØÀU`ÂüQL:\³ƒ£»;Â÷ø=ÛzÞÃ*K¼‰˜   ýyŒóImˆTµr—º"[hè„Q>AÛ'#O@ óäyñȆPa9 mXp}…31‘TzãéÊ€i–H©v–;úÁI#éØàj÷RØH~Íc›%H„³(f[ÍixÓà$…&,ÍYð)S­$q\å®ÖŒ«‡ÝÕ_ÂD-»ãæ¥gmŸ–<ˆ!n),å&ÿyÐMÐQS£#Þ²qïAuhÃ*¤…Ò§Q“|·°âXuN?¯e?„;y€!AÓü˜Nå'.É’Dµ9ãïžä!Ð`OÓQqñ‘vÒÈÙg•\LâÃfÌ*ñÇì¼0/o=ZŸ®«ÛÑ”ÍÉjvòçþç+¾²ûò—¿Ì^ÇdÌ"Ý›OX÷ À'¬°ŸüM6ô Þñý«ÙËo|æáÑâòŸr¤ÿôæúú W7Wÿ-šòùOž$ß{éââíóãów...®ÿôOÿômòrÝ2to}Âèoò¢ÝƒÜ “ ¿ÿýÁè1¡ÉÕõt´šÃ_Úm7çëíúUv½¾Æ´×g2ò_¯¦(~D+lUf)oPø—€G†§ukzn"û< ¢'?eÙÁ55¼ñ„’ï^†­Û¯€…ÅƘ0~05êRk'N†b%ðš³…Ý»î)ׄ½yJ¾ºÄìq"·¸NçÇÙwÔŸã‚xèK®Ó{ÆËüÄ&®&mZ>U YdåÂß;ßmi¤(¦!LÇS8.Ü>®ãˆQøöú©LW¸¿\¯®»´zŒ0M IKwŠã`ÔjUÎDµ"‡ñ7œ µ Æ„ä˜6LÜ©{”ç±ýs¤Ÿ´2ZF  yTûEø+Ѐq¬ÖMñm±¥B;ÞöæœSð‘…8T€ÍlVËHŒY6w·Kż‰žE3ˆ÷?á*äkJݼ”?Dp £e%G;€~ê%?@$ÂÈrF ¬˜Ç”KA|¢@“G §`׶\y‚'¾õU´“ ÑAôëÖt;žÊÎVŽÄËÒóÈü×~N,“Š’Â_flVæ?'ú’Pú- 3wT%”;é‘ å28Óþ-Þ„Jy¡`$h¶ó$•ÊäÆæÌtàgDÏ‹ÂOØ%`Éç„9J9ZOW×›Õƒˆ¤îö’söî\3ÚœžžÞé¶&vo>Q Ü+Ÿ¨º>>0 Ê7ü¶}28Ÿ¬ËÑÙév·zi¸¼JüÅz7{i¾Zæ¦??賤áûßWúº£o1D;tzmïÌø kOã {°Æ¯À!H°ÐlŒþ[i F¸Ó‚2y™Ý¶&ŠLùÅ¢ö9h­2•LÄô#`µl@òÂÄn˜¶? Áø[XÜ„)DtøZƒ/B…㨷Ãèí×£>bWv#0’'àcLÎ8ÌR„\yã—Ž&#s<ݯíS8B”¿¾Õ¸»ufy_e ãwø¼…ž7•”Z„ùnÒ4ê-QÎb²„òn}{æ G§[ì]?oØ8¥•t VC²³›Š³ 1”vb b™Ù!¿àh{Ñ2sÄæ²ÂwJß¼»QP„|¼*å¨<Ò¬³d m°õ¢mnrûœíwö´r·?-@˜y+jÐhø¡[$n %Ãt0;d¬<¾cºmtÀDgd^¢KhÛÖ!V¬<š |XIêánŸ€te– !JV”ÐÀRó\™Æ*¸$,mþ[Jɵ(ª*#&KùÓΟæ7?=OîÆO‡1äÝ&ß¼uú©ýX—VJ‰ÇOìÿˆAþØÓ„[µË÷ rS UlœL4Â÷î{Ù®oh•/+2 þœO7ì|ž‘¹ùf3™¯Yål!'.¸yà³ëÕbBÒ'ƒã‡þõnç6©Ý˜"_©)R¸7£î€QIŸ„k+Gßc6ë!Ÿ½ø,{¦Þ~ýf½ø5&lÑd/^_Ž¿B‡>_,N]-†k¾ À5ÍØ©Ê{–™N“Øžé {iNçcE!at›×êÖt(³”ØêËåæ7BÂÞhÇk]Ä°š^-øÞsÄ­;zó€‘ÛÑCZ¡ƒÓ–ªÉk6¤Ó²RËêé…Ö– ðƒ\iëU‚úïÈ #(Ü WžJ§Ó Ï”4ñý¶²àó#“Ò˜Ç ÃÆoV4f;I¶ºóYå¾Ê$\61šW‚)N{ 'ÍœhHÙDŽ;q≌1ÿû29ÅÓPö@U¼˜ØÁâm”dLJ; „³G¼_?Ì3—¯1ÿ;g%ÜQTé%äñczÞ*}G|rãünÚòÝKìî>€m‰Ú¦¹ |°˜¦w6 h¯© ú«„¬gc¬'O+ÌÇoc¨ê'œ:Wø[§NŠr-¬tŒ[Qûò·¥…ÿ-5¨’â]=¾%Ë£ÂPe›‹ŒIûçÝh §bg~ëǶPopC»ðìz7ÙDÙà[h×Ë«†ÝúÒ[ÍD‘iøÖåÁ»´Ï™v*MÿÁ'C¹`¨É2g3¶98@¸•eÛ,$_Bó“œÝ º¶ÁgzU+R7,¹5QЭ­2ÉK|„“æA‘5yÚ mNÁŸH+´ Ný³;%{"À¥ðQÔ¬i¹†¬ÓwÄ7èë= Æ >?æ¶r\£|ÛiJcù½™’Äõ»W f"ø <ôúÈk†_ÇCpCÄZ]QFálQ¶Yi+”ЀS©wÖNòæ.xü;¾²Wiëá_"Øšf•§÷Q}¾V0~=ÏÊ’ –yÒVH»zaLß †Hwçïü¢“ïÈ÷º'Pµäz~Õ–í·MeLFõÌŒ˜XK©jA,K¥ÒT9>é÷<´Œ¹Ó߯F᧎Ãg°ýÒß`æXß|‘¾å',3?Üüg»‰òQ/ n“R‰ i`W(|!´á¾˜w3¦-sî €&g~ÖnÈÛ1çgG¯œ=xøßo†|$}<ø³åfsÍ2Îl»^ݾzvöY75 ~o>F Ü+£’>)È·è›_„Ò~§°þ#“SÚï­ò‚qAŸ=¡Ë6^çÛ42rv(ÅóÞà¿ëûÐ8;|Ð_xѵw}lÓc~º¡Ï•ÑŽÇÈ(#ïÁ-Ôº‡ÀõŒ ° »ìèî9´€p²Ð?â–ì³8!øôO1´‘Š`~^¸ Á>\7žîïv/¯ö³¦Ç.»ë8±CÛúÔ´wœbnGó~zï‚Û©Ã7QÕ²M“uÓ~~Á]Ò~]0Š,£VÉI³(·|(â4*vžÐ—.9‰¢!¬4¦‰) 0¤åÈPSY.\ýu§CÁçt‚>õ¦Â“W•Œ,¥ÂÑ?ÿäÅâ`­2#¯$š¼[%®L¿ÿ)¸Ì›¹±If ¿é˜ó>"V¸xî<嵜8-etw¾Æ‡ßY“ª)<š*òGÝÒĵäÅ(ózHÇXS7¬ÂáN¿ÛÄÇ”ìv8(SúN lnËÖkЄD1ð0ÂØž™„? ò/Š“3Ö«IË'Ü;aI[óeéî ñ’…¬V¦Û çéì(øiÚyQrP^œ]цåžXÑÖÝð9å«A´÷3•_ 0ÈZ=dì1y2ÛÎØpÍJZ©h´žRÊqÿóѸW>Z'?wÈ×.ž,^dûólf½XÌwÿ9Í÷7˜J|™ë¯OøþÅÔ)ö#ÿ—`¬²Ød½×_ÛÎp(Œl†hÞ2át,û ƒD:E êÈÒªÑC†¶añ™d yŽô´ìÆ{ÓÆ<ûx`e‚©PuØ0Ÿ†—éuܒωqePà„ãÔ6L2á:‘œpÂlÝ_AÆ<ÏD !į̈&4xiØ]ð‡6e0*ëÑ%£L‘Y3ã4¯#ói*Ä£Zƒ4„¹¹ÑÛrÄ)õƒŸïž/ÏÆ@˜Ó4îž–—)˜#œa ûùí5ïÖcS«Áüz[ÿ-稓i¹4°ñö(he:ýÿ›«šÕa¬>)ÓU˜Ó*xÌOñQáR@¢!ªå趭jŒ±\‡ð¥ÔTïÔ»Þ¹à%a(³£#Þ'#G¦‰§§G±ÅsLmƒYèJ€3Y’0[˜ŒÎµy\ö1Ø}~ŽØ<^í­ÖÁ1r'zÊFÑÁ®_­ëw\,€áêÍÄeÊB:˜L}ó’KaÀo'ÅاLK;¦YºÍEöªèNÃðÓfÈCîÎ'\•ÆßØàêJÕc[ø*‰eŒQ¸Á>ή‰Pü畆¾8õ^ ¡òF(õH Ò³ bç'€ºeªÌ¤ÜÙˆLFìÆkfª|_;O€åÒŸ&Ëaqjåßt|×Ló·djfÀ$A›sºziãؼ½éÏžF¸ßfÌš 7(¼žœ f(—, ¼t<žü3ÿyÿb2{{¸~2ýþÑÑ5KsÞc¯ª‰–­{뙸Wž©OÃ{ýÎ;“£ñðÁn;þ}ìáf»FؽÁg{_\sõÙŠ#^é»Z2e¹b Œí¶ö7ø|uÜÕ¥~znijÚW»-–kû>áûŽœ>·gÚ €ão;Ý¡IL~dfEßDÒ±›_þÛÓÇ ‘¥8ãaa6Àq&. éð°—Øs ¿«ñÒ*¸ d\ñ›qð`dNÝTH÷=mG¡ Hú]±þð‘T•+ÅFF§1¾¦÷+?Î_ZN+=Âӵꆺ¬~Ì…*’ñçCKyÛdmFæ»aš½ŸêwÄ¿A9pD.“¼ººÄÍzér5¸½¼Š­à¿¼½„+æÀ­—(Ä›¦‚=³ ­Ô+ç]Áø‡ ú’iÁ¤hÉw2‰«ê¿ÊlsÈ`ºù4ŒѠ2"Åíq¯ë·¾ûãÓ“ÁÑñ ñ~—žã^'y¿*'Ãs”òÜ Ri+yŸz*÷(#’â*š4xyù²¶ºï, X)ÑÆWéò广¤/dvx*§$ë ¯ Y”eâí[æÁwêt^Ößç'^4ˆò«è×$¿-¯Ò‚Ùƒ€Ë÷â-€ª/=Ôä•ïF­Aë&Ü?Ͷ- ˜ZgÒNTÖ¶– /)Y0B‡¤7 â5œ°¢ŠÓ† °`Ù3 ƒÇz+¬e¤²}ß[®y˦eIù‘¯Þ %‰‹w%9 ¤+*¶MüvÏÿG!†Óÿƒ¥õž{;ü~Á¡¯ò|yù`:Ø¿°9=ûgëÉ’»F?àÓèߟÜòa¡§Ìôœ§g¾ŠpÿûT Ü+OUÇÏçùãÝnzLߘ\^ß¾;¿€¾¸ÞŒÂ2¥ånÿ³5\Ưæ9Å¥|S¢‰Ú¯Â€ZsÝ÷9;‹¦Ûå»û=hÞök½yìË>-^§îx[˜AÏ£kRø:Zºò¥}pÄ}`Kê)S*.Ö¢:kÀ _HTão/a-­<¦ÑÂBˆP™…±ù#²+ß•Â/ÈâO‘ …‚1Æ]Üxô^7ÊEe7¡•¶a0¨®xtá'âŽ!i1XñâQ±Šn—sj§Ü›¬góv|áj€4GH\ cQ2\.‹"ʳԥÌoopÎ1©›ùmìÌÜÜ[K/Raú) xÆëŽÁ­)@% ü¦ÕAÈî Ï~Šö¤à7Þ»éuΞº£B2ÚÏú~«ºˆ>àH¤ÊLù<ŠÓ÷.XÈ ['**­nÖ”Ë/kž.™0/šdÂ÷E€0ú­4­‚ˆ»;c‹¸ -%‘ ÐHdC>$"N£ØðµbÀ+7¿i1'÷›ìê èØØÔx.dfA|á›]¾ø–½žÙ@3§Å;°mùþs X¡Sèæ#ƒð„I?Ù2µ˜nWuC+ñÒ¤­³áн *½kܾ—y–ÎlpÄNCÞœcú“³ㇷÛÝîX/?^þÉŸüÉ%m*I¿žTKùÞ²î€O©ükOÞ<ÚðMËõböh3¾¶^ï^GË°Zï.2êG(8ÝÏL@ÖýU¸ýN¶üX^+ãyº•V‡±ÃîÅš ÈŽ¼fç1Î&Ÿ v.Mº½öIéôWCk¿…äoC¯ð–^ |~z¸ž§Ü`;J2LÞƒ‡€Úíßšñý‘ÆSDÐB2e ‘5Ä<6JÁì]>£ŠÄE'P…'+äC¬2•4Bo7&ø&ÛCváv”bþ‹ùÛäŠJæ#f¼›Úüµá³¨[Šw]~~s¦¹%~™‘½‚Ÿ| äÓh^‚ã¾ü+Êþ0EðNõ£_¡L8ݯßÆPy0oÄLãNTD‚ÙÜa'íŸ&<³Õ˾m¤r«²©¬QéñÚ9…AÂþEPXñÌL`›ÏÑ¢ÂÇÉ7xtD–¢McúZ„«¨eé6٠׫x±AlÂ&4—Ž,ï1ÂëÉS+ –¶lž.'ƒ[úÕd)šÏxúÒr°úÌv¼|ˆVpôÅ/>þö·¿=|ë­·¬L§ãîÍ35p¯H¹·»Ñ¤£*åWóB{Œ Ž@%L`þ‡iÉV‚ÃSýº¸ÖÁ|p°5 %,oµsw>#™›ëÇLÛ?ábv6Ï烷ð7m„¿\2¿tóž(Sö-$nÙLTò-‰Ðï¢<—Ø ƒmR½nh`tmÝV^ͳP2QPQøEI©zß5%±¢èo£-jOÆxl”ùL¥w7i$à6ÌDXnh»÷ØÆ‘mSôNxmaŠ ¿9fùàè˜}”gÆ~‚—_} 7kÀGǃñƒG±'ÔýgÙO R@ ³k=e„Ò ýîF¥ú~ÇâJåŠT” `µ­uº%Šá´o\ª ÏbrŽ>ê6o̧Tõ{ÒB›g£¦•ª) <5Qz‚uDÁ# ­4ì[iÓvâøg*\ .hµ¶šZ›¯`~«w'®€‡)àïéçE<ÅD¤ŸÌ`KXLÓ1¼L)UÂCÝ¥’* h I9¨£-'•òžù™r|Ù>,; e, •œýƒüÖÆ?J)ˆ ¬€è/8õâ®à·­ª(/Ü8…‚çÔ¿§ÕÕÊqoÝÏ|jm`ümw58¥U_°öÿ€îøˆ®ñωìbCKuÚßÿùÓÐmðX駽¿ö.˜>áOëÏËh‡ÕöÙ ù MM³Ê–QØðe®{8GÌóÒìaØ:EMP~Þ¡ y xÜ?ˆëáE´àsH«‘y&¨hQ¸gáõ[–žŒî^¶;¸Ôƒu!ñæ×þ%¸ed &é' ýÐhJƒèÞjÊ…¸9¢Ä(±‰Œì–)|ì-‹Á5 €¶L{Ý)¹žîSõlúþ™Ÿ&Àñèï×ÿêëu)ÌÝCY`˜*0Á¾/Ä$ù¡ÑÄn´±š±2x0ÕŽJ,%¼Š‰ïî§Uº)ՈϨFÃ¥/)(²†«°®škÛvWt .d ­dÖ‰6Ó BÑ>ÄÐwæ•Äv&×´½iÏ/ÛMZÙ3;£à$%×Ú½‰Ð‘¾Wß.yx3ä£ò©m? .¶ù·(÷4Õ|·%´z™R1–YdŒiižµSU¿ÐŽÁÚ+]= bøÝ·8ÜbløñºãÅéqÚfô§Ñé8ÝÇvÐÚPétqWãH¨›UÇw’™L×÷÷nŠ-T\º¶ ³¤ÿà Àª ”–ØšâßFE:'!ïrŠìôšËƒvGG£‡t†¯Cç»7OÕ€ã²{ó3ÖÀüÁŒï÷~oöÎ;ïŒß¾÷à–/X†“—ëÝ œã?]-·Ì6²Ù&çe?ÈLÿGP6о·´íûQË‹<¢?Ïfð˜Ø jßÑ(&›Ž¹'jϪ;L¨ûž©ð»Ó“GPCÎŽŸtš¿ä ¬Æ ¾É™Œ?û§&â ø®ƒôcMŠgÙA»òTÝÝ’iÀÀTz¾²¡¯Ð3Á #ÙtÆb?Sa×$-¦£ûu¦ãL„¯˜’w„æô?W—Fà;å}ÍèÿæÆ‘¾BŸY¾ç÷=Ïïúeùµ¾Z~²îž™Çhµ‰ÊŒšWG@Ö§û¼­ßáÆ»Ô?™"7Ó„8ÊÌHSdüùÃYL¶ò.b» ‚±"µZû2,nü6àf*¶<âl˜±Q/îævÆAe¸¾¦gý)JúÞ í¤!ó¦Órêv™C3ää ßÐ@9â|8t•³#>/KYçGsêÆdmy ßö`8ï}‡rLÀUAP°[¡îpºêØ 1—j\ªÓ¯bÀtµ$@&Oþ¨^ß]s?rc¾¨ŽóÄÎ{¦Î²ìF¤ÏRA4Üæfÿ‰ît°`±Âc7wkgUÿíeHÃÙŒå ’´|G „b “вÛûK·?V$)Š¿ï¨›®p˜’ ½ÃêOê!¡WôJY -ÊÛsi;Ü&Ÿ´1x mµG6ìP5‰Àž¡ßºr€ž3I6*¦‹¸ß†:Ÿ£tÛW¼pèjæÉ”ÁåñÙ¯­çëÍd2~åôøh~:\mvÈÞ.þÃñwÞõƒA*÷æ îg*ã“:ŽÞ¯6Ç'|ßêüx6>r»äÖ»—i¬X¿:eäÏ=j¬%øá'Œ*8²¡ß4[;‘‰ç»õ¢bÞ˜·¦-S c€€t(ÃâoÒÓ©ÝIlº-|O8î;GÓ.¸ÕóhxÜ‚àNÊ‚T$@ó'ìÀÝü‡ ‡°=ŒŸhª[™YiŠ¯Ù'«£e0´ùÑVX8 àˆpŠðEž&\…E–eË©d˜æáÔýå“ËÁõõU<3A¬ó³Ù/LUæ¯ø0!l¬¬¹Ó¬‡;Âqä/¬vXròBT8²ï€ŒytΧ ý£©çèÉŸÂ !§ kþ @ó]ÊŒ¥6ÎòÅ+ž„Orc÷;³ €† 7’¼’ßÞÎz›³l¹xH›®ÂŽ?ë§ß+0y¾^h™ô´}`ÆtüH›?Õ :«Ž\*º©÷ÔY¢¾Ò–ÉóðÓ «ø­Þ¦, t`†20›±G€º9C19ñ}R ŽÌPW™ñÁöTCfæä#åDà6j‚_¥Ä–«QÕ}ûÕàÓzÕîî–ã{ßíît&=½SUÿiXÕ‹!¥&Mº‹Ù»òlijéãOP‡ë¶TÑìC¿íÙ¸FxHt»‡w|lxae¿Á¾ÁéÇ9€ÕX&ñ; 7?•˜Í-^av «—˜cÖ2YêØÑΊiœ¥›D+ìåjžøŽð×ìÈw?#¿H€Â7?Â-í …yµ LØè  w›Ö „Gæ˜).‚ÑjF¡‘7ˆÛxE­£Rëâ-·a¦ÚÚúýÅÍzM˜ùn&Â-nàiÙCuh‚DÚãÄS†!}O¦©¢×ßKà |4¢tødÞ(Ëã—6ĘnWòw¾õ¼°»Øã©#bwç]®’µ5¶«;¸Ô5aÖ«¥U ³5¼37 Z÷xúìÑíf}|½Z>dÖh8šLï^ø“¾;¼^Ï7ÿÛÿø?_ãßÈ«­ô~y{ÿòÖÀ'(9Ìhô§?œ<œ ~•¥ûéõõú×n£ÿ Íõ×X÷?yï½å?¥ >@AÝÜf··Ã#6X oÜKÎäÓÆÑ#íf®`#׶-×k¹§Sèõ‰d¦©ª§ÝÛd†ö"qJ{·8†ç§X„¾0Ì0ŽJ'aþ&Óã8Œ2žèf‹ª£“·;úõÃ_÷ñS–xÒvÊ‘G˜ ŸCí4„ÑÍßÄåüÕÚ6ÎëЖŽ~žÔ vü- ½ ` J'\ˆŸ ½ñ ä>Ö8qäûÈÜØÖ™ß2å»ëøv~Ãs‰œ`ÊÿÉ“Áí£|åñ¶\²ã‹»amçݽ[a÷þûï£ 0=LœSë së÷„›ï¸Ç¼:þécQ2 €Ÿ¶p÷©»Ú©PÝÞœæ8ÚEm<„&8GíƼ,p™Ž¶‚‘ P‚+Ž#a…ƒá=U3å¯Ê¡´¾0kCÛ!ÿšeåŽ7܈é£TÝ>ÚűÑQ\„¸œ:¥˜0Û;6ñžz°ý«D-½°;ø9) qàº< -GyK–Ntç%×iFœ3(Ð&nÍ=|!ÖlQ|Þ)œÌ<¸œœŸQ×u’àÁ£—ò{¿I0f9E[2~pž¥*Œ{øY–cÉ€V“¯ÒyK _êtyàC”YB‰»êIJk¬'ë+@´;¿Q- ¸ÔafLD< ζšQ4p.+9kÚØN'•þ»ê3„¤MúÉ 4}OÎhÄ ¾&ôè'ÂéÞ§adkéÏ´;gXªAõžlB ÚÆíH>6!EK b‰] gox'™ƒ)ÓŸlßÜ0xÈ­€ÚSÞ÷g^z!3bÇÓÙúÁùùÕ+^xžÛÓ““ÿóу‡ÿþèäèGÔñ{GÓ³ÿý·^{í Ò¿ôæ~à“5á©Ÿ¿:žŒ6;ŽÒ>˨àWâGÜëÿ&qÆ¥ÜWÍkD ý3»X3 3 sÂ2Ihd^tƒ¸«¹WxBzp‹EX:¡qvÀ0ØáíQéDEK¼ŒœlÃ7¼£Ö1$‘Ç@e„ÆH:ymÎÁ™vŒ”dá4ÙÒñÊnà{ú0Ý¢Ÿ$ʹOV2‡¤~œ{¡[4ªZ«dŽ ÕiK_Á_6˜³ËŨˆKeÊœdäs¦ó¯#ˆn®?\}ø$ €•5t~{ŽÀ™ß^ Ø2ß%Wô*¬x+îà0® ¬¾M9`\./(äY«äˆB [ÿ7æí2|ršmøK¨»é*­¦Àúm @AFÁú,‚45ÁÃ-NÉyoºœ26_5uLŒÈÍT«°þª£¤¦R…Ûwð¬8—] 5ˆðè3¶Sh¹,°P¸R×åæ„DTuõ1ý‘ ^í™ÿ„[3U[ªu#¤]"&’[ý‘Ì.ƒaàÀ3©‘‘*ú$m „;a\ 4™Â»­K낳(ÞtèqÚ(¸—*lƒÁvÌŒxL¢–ÅÒødG¿ IßM{ÎæDÑ¢þ'Ì2¨øLÙ,˜òe&‰üMÉtü®3ëV4?îv·Ž6(PÚª«¶Td ˆü§.íûx ê‚ÍÊ«;þÍ¥°ÚøiUî±iO¦°7‰+!iX°ãïî]/1Nz’¶í!( yŠ§Í@t:ÙyÓ8èuKúÈøÚÈ;emwSœGÄ!‡h¾üÜ<âk˜;6×s’ºaéítH!l¿äüŽ/en_£¯ ¿à¶¬%£ûþ›ÁéI]…¬BàµU̦ø¥|ü9:HeX<ß©·+.XŽ»¡ãÚÜ›0B9ÓöÂ-ÊÛ%l Bbp„G©JùÉ2 ï YqÂUÆtå\*dÿór!ûèfLñçî‡àúZýPÀQ« Aª0JãÍDvaû—òX™V/Ûvß`Õ},^#Peº\Õgåö_¾«>ô|Ò `üÍg>{€æ•²tÓr^4 Ý2-^¿°ÊIrAû€UodKW˜æ©ÒiyéyI=JÜ­K¦L¸Ÿ ¦0¶_Ógu{&ß–¸a¦çŠÍ²(Žc–&_;aÙ¾ý ©>¾ôÙÏ~vóÆo¬¸)3Z¿¼§îÞþÇ5lþqYÉ1ösìL}ˆÐÿÕÕr÷Y®ù}Í;þç‹ÍxÉ¡÷V/œSfJÔ‘¿Çþ¶0„š (Í&—†Ÿ†Ý:@kïéGùË%Çûž¼?øàñð¯¼û. Àq#28hž‘œùn©Óv=ÿœ[é\wvJÿÁ’µJÊ=uÒ]çÀøœœÔf=ïÆw€¶õ0õx_ê !?G§üÆãpð·ÜÌöï™ùy‚ßcÅ~4œ&£'( |\`· gÜ}Îa0Öž˜8s°áÞÄù|¸^îóíøäd3䨂ŸJS{8œMAP§ÌüÑ0«A†Ë®üZWÌRðA¶åt&NÜ(à-u0æ›×/b£/Ñ}f'´ís_«üSöU¨h(Q§œŽyI7x ÿ#NÙ©C0‹æYÃ×go¾L ¯6Vø{‰’ëÚ*7×lÂTÀã¾m2¡1XœžFð½zÒÂû wÿÀ‚2©ˆwsS{lˆÜK–ü¼‡ Ø1{Ž°¹Ñk0t€JïÌ÷£ægÛ?Ge[aÖÛ~¼FAñÉI„PⱟrêA¡íÚ¿òΩöt_4®,³gÑg£L£WxóX%éÛÂÉu{!DÞáj#óXR—ü2à°ÁkoÎx‚l8D¨î¬HO˜¤çLކϻ!Ê°Dc$ÿxaÇN˜œ–Žøê-¢¨è¤ Í–|q)S0¥t”’RsV­xIÌzT™c¯ŽéP÷hŒÌ¶ØWøj }Ïc±â§Ì@ñ¥@o³ÿæõÅ|õ*ªô%õrº_ÛíNÙ2rã-ô¥{ ½„{«×¾5å„Œß|“QÍw‡ÇpÜØÖ)¡çÀœ°ö;CÈÕä᧓ÓËã·ñû»ù{±<0âìMww{ñó9z!»Ý©ÉJbˆè|¤e4¨ç¤À5øð"ãû³G¾£'¼ýzO_ØÓQƒŸ 3Ÿ=LÔî~Ú.†b˜/ÂA«Õ¨@p×~îéwäÏNñ»ú=ÊçFµ(™âwT †á8Éx 2E?¬ÀwJÙÿáà4Gü>Î̦ÕsT˨„­ÉÃ]ÎöOØ*'N)—b!]ã'xNŠOï_2%ýœ ëÕ Ü-Âh1#¥”Š{X&W(Èõѹ¿ä\–Û'|Ghµ8ÎÛÙd{4šnÞÝnÆÝêv9¾ø•ó)å†òŠÊpPΙ£eƒ|m–B¶gggãó£#ŽÏoÐw&~Øo…äôêèvµšb+ìM23GúLP¸WfãlKÜ™±…5“ylЇ—l´»äe1Ààyâa0 Í~.dÆ@‹cýSx:cJÞͺÛÔ3šwk½GQ@P»6áG„TH3Â0lÂò~jv=÷(!ÂÝ㜼{¼_îôd¼Þ£óÊIwoÕïhÔûó3-MÿÇåõÄ MÛLÚ²8’ÄQÝØ ìS`†uö£¶ïN£R¡[Ûz]S.ïlP1tT{Tž8“²Ý¸/kE§:AY8½]¯ÏY,ÚClµkñùaèJöYûUlB5cg?P² yÖÜõºîÒîB[zyL¦»ÐÂÙH¯qµ=¼ý§ÁËŒBϤ[ØÎ0Œäe‘-™\¶"]M¡§¿àB&Œw!iÉ£8ñ[¿›ídÞºÕ Ž>¸–#$èôs>›«À˜³iÏQ¿¶›ø>xÿí(~yo¹ºE!ðFÑÍàˆ4ÆçÇÔ=£u»õ3bGÀœŸ±»[àÁË6àôÿ 6ë¹ ’@¾œ’gfrür8GÀ/Æ£Ù£x>à ʃuFHºÝ’)\…?WÒï¾ÏôþŽUÿ[¢øØ6R‘ÁÛqÌ°ž)~¶£¯7ËóéÙf>¿ÝMÖ>"ÈÁ(3ßN_/ŽÖ"[·»ùûïo^yå•Ý|0B“]ºþ¬Qà=c>|è¨Çi‡àÃhwOžïv||ƒ&0`ó­K Ûíñj9}A›·;^>8ÑÍlÃvx{}à ŒWK–\¨» 6ìéརЗYmÛÍ‚Skîup“âòýów~„Ò†Bç,— ùžY*¸xåEö °±Ì’smûöŠ‚çHØÿËÔ —¹òA«›³â2'×¥ŒàØp?slÍG­Q€1j°ÿÚÒ³–ý™Áa,u°Ã8:¼“(é1Ð ¨u¸hš•¢[œð; †×Ì0™êo"¥?µ>o¼ýªR ïÁÛJ¡w9Ñ“’i% ,赚ÝL”˜xy«)hAæW~‚‘CØ“õ®°×h·ÏgÏÞ¦S–”• —Áˆ#¹“Å SJô½ú!ï”>I7¿x||ö¯W›ÅctÓ¿_ðÇoÇË»!›»kú§¯ó—ÆÜ+ÏyÕ_§mýßÿ¾ŒèˆáÔl´]}ŽI¥_§ÃpÉÏ賋õðŸ0-Ïu¿ƒñíjx²¢Å!? ž%ÍGï‡~–ìBN? £•mg(͵’µ!hÃø ñ'Á0p`TPù¯cãIÔÞ™CP·uv»»pñî|%,CŠ® àÚ§õæýáå5'gLB_Ÿ³ì½Ø½ýöÛƒßýÝßÝ|ï{ß|þó_ÚýÅ_üm±8ÿ—¿ô%[’Í*楗^Šûõ×_×?Ä_ó·ã7ð=Ýo}ë[›‹‹‹á[o½5äŠìyI±ÞøGÿhð‡ø‡Ã_ù•_pYÒÐÙq_|ñÅÁ_ýÕ_^xá/U²¿½Èggû£“éÉ÷ùàÏÿMØd3Ûœ£Í8ë6cD~t³Z}Ž—ɧ`··ëåçè‹éÓùpuŽ `¦a3œÝ°ÓŸ½™åQ ³êV 8™Õ× »½ºNœsùÁ"m‹÷=熹[8WGN/Þ­›(á±í’¨…|»B½à³9#3×”Öå•5íɳë.ȼÔ&•vœ?mk³Ù­û§c0]Ä$Ò@kw`ñ“c°íHš€Ò Ú›qZ=j~6+$ i±ƒ2š @‘ЖêD Ôs4B›…¿â?1ÚÛøjm¤0ö/dÝ(>Oþf³½~‡¢6o¾ù¾K[î•éIíóù‹ê¸Wžóf¿NØ™ZdAu²X³š9^ w›—鯠'¾ _åCSìü·©õ#ô3í‡Ð7ÌÇiõÚ5M)í½ÙqÍØÞWÍùήFß[alâø(,1ûÎ!ˆv‘iüóLÍO¸u <è¯EÐðç=‡„îKø¦îk¶d” MKPÝ0óæ#r¾lücGçÂÎ#”™:u«À·ò·[!œDÀ/Úˆß#|·¬ß²Ã_`Á•¾®5Ë={\ûÊfK:³ ®õ»sáÀo̘yælèx¼;™Í¶\7ë&;ð'[N0CQaØêæ?ûœ™ƒ9·ü.ƒßǼ«+¾t÷w äLrïŒà¯Ø®~y{;zò` ›Œ–ëÈ{ÄÇb±ùW¿ý¯.¡kÃùÿ›Qãú™ ŒwŒâ€\¥îÇ£ãÅz»¾AcOÞÑùt7:Ƹã“ÑÈå„ÙxÂ2Ç‚Ùß5úßv:ºAì°ýaÃ6I”€“'hÑÔ ä5`ÈÝŽú¢wÚß‘$@¦ýÝgàxÁn§fjÏM™Þ0È›gO€kÎ4î!H?æ=8) Â ¬ôKu®ÙI¥âö%±Cû#\׿§C/M.³Ævm¿õK“‘¹¸cã×Ôosí=- °³¼`¸Zˆ„4¨~ÝE°â#ßÄ©?ênv&ÄppZ¹X• IDATŹLeîå/UÆعK¾h Öè¿&aåÜÿJ>¦9ÌÛΚ9Èfô üÚ$ß”+œÌDx9Ð’>mÝxAÐ…€~ÆÖØÍŒû^FM¤£ߣiœ'³ãŽ¦üàx4úŸBé.¹žì/ªÝyÎ/jù~Ör oŽØ6Êhc´/«Øfò‚ÿÕÝz÷Su¬a:¥§ ‡y¤ÒH£õb®Vzhôöç0üЭàÊ¿¨ ~o&Ý£õývGM…—ÀÔs’øçþt íþ<0`ü¤ObËOºI\÷h78ÿ¢(ä«•GøcM¢*^¦êì€>GÞ™)ÀG0\¿ôÑô³3:Àuä‘‹dXÏ÷¬¼¡/ý8›ÎT°GúŒgPv‘{|Hå@ùºĽ"×)y…¹#y/߉ÐçŽù6‰éfd¿!nÎÀ‚›8j7É(}ÃÜ6kãã%JA&6}8´ŒÿøG4w¨ŽKøÑ5£ô'(0ÞSî+!?H¡ñíííλe6/M×——Û‹³3=…ûvІñŸ¾õÍo~sðÕ¯~• Fn³Ù†¤¶ûâÙóèX-Ž:žb³[ÏedònǾ/^Âv{É&à»3Xü8|UmÂ^÷JØøÅÚ/ŒŸ ì?r6ÀÙ%Nh0  " àyo´ïV{¢šíßï(Œi>>|yÅô2›$™ÙÙ1K„í ¹r©¯³|1:„|ÂÑÿÈ¥AÚ%-ÂÐÿ÷å³ ¿½¥úKÏCílú^Ú9ùÐ'0Øš,”“èi¾–§DwÁ* Ã{œÎ$Nó4úåëžgla{’ÍîFõ$¤!|žéÉÝÅUHàRꆄ$Aקö\ ÐïŒï–pëßwæRžÊGu}îYÑ@«å b?íðl9=®Æ9 »üâÑÑ»_þæ7?š» ý¹î€ç¼RhÇŽŽÎ'«Õk´˜—ëÕ¿`Õï2hø †ñâfsªð_2õ?Ÿ3Õï@üš£ü̾ú¡Ûmm|~»:ì ™2³1§a‹W™³3î±q8ƨ€Œz"`»” Úã9%¼ ²c¦sØÆ&\†gx³+MÔÂ-îÀ–5/‘‡Æ‚–ô0îÀDõC f˜Mrø¼-Ð³× GùÇl1T7 ͱÅòò‚£øË'Yß7ÿ n§ûÝðçHÿæú1ïÆ›êØñÏÚÒ›R.¯ÖuWþ)9½à\>‰ž²ìŽþ¬å#Ž^8{˜)}øÍôèø¯‘AOPXÌ ¼¼Sõ7(ï1åøïÎÍös^"¼8¿3_ð·ëÛåŠùÆåKgGº«ß fÊ|þóoìþìÏþl÷å/¹>÷¹}Bsïn(ÿÉ[ÿößþ[öÑí>ìáxÖèÁƒèNÃÁÞ}—Óz³!ç¶Y†Ÿ?ÇÂåÕÕðèääbtqá:Æ‚þt²]|÷CæI¸øïâ˜)“3:ӌ͎_\Ï—ŸÇ}â'—¯ÙÑý…ùùƒ vVÐf¸ë%–Y8]À=(ˆNÙ_±gà†Q¿ýˆÐ.#}˜åñx''?´Ç,½úr–Ð óÑ!/lòE±Í! í%· .iÒÍÌ'†´5èd¾ßl -ÝÚ‘È*ìp¯þD8éöâGVTMíÓ|‚Fq·¿Œ…€½`§ní/Î3tóPúùO°:JœÚ*J2‡ŠSQïPIC-] ¬p#yÜ´—¼mX©éï‡MzñðŒNöæÉgÄìî ¶!ÓÒ9h–™bÓckF'Mxµó´×ç¤sd“îýÁðÖÆï@z'1D7OŠÍñÓ:Æ4úóS)X0±š»B>ú{-Ãd”/>LaÛFýúÃ+¢dv ñ _Aê]æ#wã—Ïœµ@¯öÕíMq^à“õà6JÁJ“UŸ¢fáæ//Ÿq=Ÿ~ýNó:#€Pv¸…É/™ ð,þüh2y2™N¯¿&_¼­Ð§sŽ™ÍÁYóå@ôÅ“ÙññšéýÕ[|pû•¯|%çê?Z+¿\!ÔÛ!ã=t?·"Ø÷°ººº:¦^—L•ÌgÛÍc„þóû|›™wßS»¶B€Iž–̤}ñÊy¯ì×ÇáeDÌÂ뢩øiìë95bn"¸âPYÔ:f9ÀÄÀ nù–qi–4,g‘\¦RHe™Ë0ð=§ßmÓô”HñxKS l—>üúƒ¡g@8üA·}>q::Lïü=X›(•*mM*Ï/‰v§'Tw?kK¬Ã뾃µ/—dAóÔÅ"ÜÇ7•ª¿õ¤*:)µÅ0÷ñ8«†W«P1‹ƒÄWI~ËÉ-â™ â}q\upJ7ãs†ŸÿòÇÏÌ/ä½ðœ—ø„Æ;•ÇÃéËœNzÈu“gÎ 9’w´ïù~wìê^³Ñ/›ii~¼d­RàC£·!¦’F·“³ÝÚOÒ~…ÇŸƒÀòü„tØ鞆Ú÷ÇFqÛQbyðô0펗èæ/7П§:vüdÌønº[[fXÌJYn…·ù´…qm_f†L :uj^¾â €#~/ñÑŸ´íØŽúíÌ<|?k ®ØèwuÉ®n®ò]Ü0ÀKtšp·a¨À áH=#7E ˜‡S.’ñXŸ#ý3n…s‡?Š³¼GWGlÄcJzͨAÁrÅ?ÓüÃ'à}Ÿç nwìfà†>wéÀvô÷¹ªÕNˆ#øUÜ‘ÏÙÿ%#’ÍêövóÛ¿ýÛò¨{ó3ÔËðö-Ú¶K¬Øǵý„ícŽ>sI"×ú Îh)G¥@Žo:ã2XŸØUɾ /*zÁe•ƒ%íÉ/ÍMØ#àùö|ƒé@WÂoÿŒúŒ›ê6lõ_Þ°¡våM‚óê!O LÜ'²& ´[/‡´Qçl$4H9'XèaÖ EµÀ—¤#}&9úÂ@C ¡…d?žoh%Ü6ì`[Í–ùl´ð¥£æzcÃ,DS.j¿’ÿÒX°M˧›¤‹‡ÞÚ"À D·;ämF:§èu;1-ò9nó¿g&¸‹CtÀ"œ2’×ÚµR5¥ä%”‘W”ï1ع,÷±c" $¸›á–Ê33'·Ë“Ï]2Óò⧫ً³÷ß\þà?¸yï½÷V¿õ[¿•™¹žê/¢}¯<ï­ÎOØÚsü2mè7¸¼çáüføòœ[þì~Ôçú¡o[7¡ÖV»_r:Û¨º£É+¥0ÕŸéiÔÆÖ´9^:žÝ¿™ô€î‘Î]oʦ r«GõN*V¦ÐŠ#×Íïàèz wt¢ÓìWz¬ëî{8˜˜äŒL·?nÂK^?úcºÁo0ÂYBÝ>ÓV6ºò·oê;¡Çm-ÐA¹Ü=ÊßõÃEˆjÅ&*X £|§ð9‡WÃÿ€)ÿ¥atð'r“ß{ïÁЙòw³ŸÆ@Ó¼³Í;M{qÍøäætpryB»ò²¡º ÙM…îÊ[Ù8š»˜mØñ0—üèÐ  :{ô(ŠÁ‰m‰“´”‰Ñà‚ vn\#©üz„SñW´jZ=¡¤¡N^’›•é²™á²–h« *ý@Ûü,wPÁâ=7±ÑÛ± n…þ M® aó“>GŸTGHGQzbâ7¾™=¿„ÚQË‹³I¿B¸6VŸ·„Ý'À'¾ÊÈíÀ˜~ÓM)ýßËQØóùuÒïȨ[yyðt‚çü½ýwäæN"æø¹ÀbðîÿÇÞ›5K’\z™‘û]jí ‚…f7†DCC¤‘YóaLó ¾Ì#ßô'Ðø52#L#C?HFi$ Í!²Ñè­ªk¿kî‘ú¾ãáyóÞºU] ôr«:ýÞHß="<ü,~üøñƒ}v”nç½Òéwÿ[uÄÞ'Ó^ãÿÛôÊýfs¯uéÒ}úØ>yðÕƒCE=—’+i’ñ^:µTê$°³ ][ô:—dhÝn¶`Laùˆ³ 0CÀ˜êBˆ‚Öº @Ùµ¹§¬ñ xöE$ŸnqóB•[¤/J„ƒ€YïeÌœ¨À M­àVfÀô¼; ±ß–Nܯ Jûœ„ˆ×¾ ÖAM÷µ@*PHñ:%òùÉíX4'X'§âgò"Ñ4 å*–fâTEyÉzd§±€aŠ¾!]£@È„À'lÉ”qÛçâª8Û•.ïaÈmÁ6R+/†Îò öîô‹ö ñÞÅÔ³w¤…çËm€ú{4Íßüæ7,ÍöZ÷Fó>œúŒ°ÍÀ6„µ"w–9à"Ffº Ѐ—£kÝåôõ´?$¼>mûi]@OºÜ„Èá<' ¯®õ¦OˆÀÀzf G’å¢ É3ÖÁÀ3Ñn]-§‡.É÷L]–^NdꚨyŠçsKÄ—ŠòIp÷®?¦´ë¯õ>/gn–±bÒØWóš0 €fz•|@Ø€Oœ­z¥ëôZæSu|Å’]Ë™þ}˜–=¤{<Î!R‰Î˜¥„Ð 7®Ï°7ÿÆÕ«Uã­·ê·Üx_U¼Å7øë¿þë%öØ59a™w‰Õîù³ÍŠÃ:rÌÝ¡ÅÖ]¨KŸ04¼Øå™CA`>sçGK¹K̉ÎþÓLV‚q§òC11üø2”±ûDbƒ0ƒà„Î È‘³Ƭ „cYeÂzð{%;ÄØŒ¬L™i‡éü9VUŠÇÈ:  ºÈ `Ö?£œ—nBÑ)o˜œe#m…̳å\Æ»ârÔ°n=žª¬n• äßõ‚ëiÑjNøÜ}áÛwóéS¸ŽÓ§‰Ë0¨ð‰&@à—|”òÄl­zã£ÉÓ^QÔ] ]ìS'ñM¾Ø‡ÿÜ{ãéÜ0u?Iü‹Þwç‹­Fçø¥ÑÁøà8ßÇØÙÂú»’ú3ÖûÃÊýÄITÌüµûÏšc0ÒÀ¾T# B.ðóœ!ÀX?ú˜Ìa·£U  äAP?_æ¬ ‘˜ QF¿ÎÅ“ñ7—¢}ã^516#ˆ¯qÎ\¢ŽQà Dý-G%ÖIõ잶ò}Ý»Ç9Ú¥ž†uŒ:£wÍ]_W‰$™òïôÑ!ž· ¾[zf¬ÍŠT÷Üx!þ¬¿>¸s;|ùá>¶ûÉw}/ÎgöOõ†wÃíARèc†võJÒâ—€H#À;Œ‡ÝÞÏ‘ì±ì-á{ƒAï³U¾ÞÇØýǬ%aÞwÔßÞþ&cÖÝÞ®îýâ‹6>ûÉ—ýhÚüÉOÄÎ÷öÀOøì ˜¾úê«sz‡ÀE¹ep¿5ë,Ú¿Æ0,{ ;W‹Nó ­W(—v†Ãÿ }ÑžŠ¢c¬ ª,z<"ÌåÅ ¬‘=<Äv¾ÊÇc–ð›,!v~ˆ ìB4v®]i Ç—â¼ãýË»t·‘ÂŒ¢€ŽQt‡®Ê‚Þ4ÍöÓ±»}Œï¤µ~Â1ÛWCÄùí²sŸòàˆâ6†}>b–¯rßÇÌoºÝc$ÆXºïcånþæ›o.ÿÓ;ÿ€o‡ðŽâoG\ÇìÍo‘¿‡È;t÷,Êýj¿šOæ‚ ùVw€‘âå>Dãö>üÖL°…ó=©­$ɈÄT&S;n4}‚(kË 7ˆÄÆ3 QvÉ$Áõu÷üw‘PµYnp,J‹±[ŒKÀ€Ô!ÒcÜ3™pÍÚ5íX³ˆ…³G‚AHÏlHðh-µ#ìØ\Ý¬Þ À"Âðöž«! ¤e¿.— $˜º/µktˆ[Õ{šœlƒø—çòÍ|ï­T&õ±6ÒÓË(1aã{Ñý0t|;¾Ÿ;”Ò¨ïá7e‚‚ jkº¨.!Ä ël0ìM‹Nc[T¢$@øþò^íKºÓךà£6Ùo\:KxȤŬ{‰!tdpÙ/¢ÿç‘7:*îÄZ„_E@gÿ!0ñ¡‚n<vV°EÜr¿·³²c¯öºGþ¼Æ©HÃ<ë××jçüÚü³e­f=]ø"À:ñ“vζˆ—Pc¹(›ÒÍs†e"ÝöŒ `u™œ.@Ó‰jY/0ä£F¿F}´Ý"€ :žÞ§‚ßà£=-ï¹…OÄ­M~OÝôl{ ù¨ìÇ…‚_9Ög™›üåýfÉ:«µ"×ôÅîð(ÒrnüaÌÂN_¾qcöío[¢²q´@ÖBIvù[5úÓŸ.oܸ1†qlõûƒrÑš<,˜^£ÈÿöMˆ?›LÑê`9’´f{ÁɆøÕ! 6ŒBb á]fúR¶ „þˆÜl žŒ['Žä1Ãœ&Ø‚ÅA TiÀ?}Àã\½àˆÁ7ž4x² F¢æÎnÅk91¿i©~¾§÷Ó­ÇsX?*­ûuB´‘²˜a¨aëè"žð^J° ný.k ¥Ìú7ž€p]'WÍÅs<³Öz¸neÅ÷äxí'¦(µ.î‹œ¤%Ñ?Ì7QjBú)¢V=-¦¿5_rÂ+XvÍ\íÝNcg«µÃÙŸÛÛì:ïiÎ<ųýZ3ï¼Óh¿ôúëÛóIÑaËÏç|õ›ØÖw}6]¼8‚ÅwÍ‚vÿ4DýÚøçâx_u€ÜWê€'˜DŸ1¢ï8pfgsd2¹Xnª‹­ã/0`£ ëi¹ [Áš¤cÁ˜j§ðª¾é¹qÂ9(å–[vöEr1žMÐg˜|ŒÝ†OÖIy•q˜ÛD}QaßÔô¶mG˜-}úô“í–§J;!rt•Ã•äêÇGûeÁH ³¨ Úüû÷nñ Ü0–ûƒðE¦ön8™wÆ϶½0Þ£vÿG¼ök? ÿ%í‘Sî"ÿ[Ò8¤yÄþþÿJøLÇ!,ÿmí&/7bin´X#˜»utlãžÁX"µ©8—`¢a!˜€æK7^úd6™ísXÌ>"áÿÃ~®4sÎð8c$‚‚x­ìvo@D2ž’g”ÓV+V:àÁXÎ*eFÅ¡\¦Ä€C‰ŽIc?†‚8b˜°ÇF{ P#Búži±Í˜ÄAì(÷ží€ µ9ï^`¡.8GC?î8röí½D† &Ÿ„ô¹'ŸKà6‰õêÀJ˜,L&mòÉ3›aë8`ʼ”"9•‰"žÚ"èíN†¸7?©gPÉ)HvL/Rzdæ åu…œ„oJLºð}=ZR’â“ÎìK:IvÌ78æ{q Uèb =ð‹òà‰ÎÁhüm&z/ y|¡‹U©í­Ý½nûƒ­>b‰øªºð\¹¯5põF{v{yë®ÃãÖU€í_W‹ö+Àöe$„/¦K–ç8‚?QÛ€ÓÒŸç¬R®ŸKËøŽo5ƒ•$'ð¬Ôõp.ÂÈsÔ ¹º²tD¯˜«Z$ÒLO×:€E­h 'i´ˆh k¥•W§EüX§¦üN”7­&Ä&­3>„ÈðmÖ&¢I¾ïK[TMª0”b}.™ƒä#ÑN „Åš \«â^B2[“mv¶ñÜm¡Õ/ñcÐçþí`ÈgËŸ'ûéKô·8±OÂŽØÑ>[¯CfùEc‹Ã\††EÀämaý-D¯æ>‡ƒükþïÓ#Œõü=µq8ÄLð}ğܽwoñŸß}·ªEÊdûܧPU¤m~žàÛ©˜Ï:žþ⿳ TÌóö•­+û¬³w ÷ýÅåîVÿTb‹eÅÆœ! ¸XI Ò&ÃJ—ôeÔgqIÀe¨ññ¸qt|ÄÄ€)&N «(è6Á€®ww“%AÆm›CÙîªÑ»&y(D‹Sî€_j@Ô<ÒÏÜGIdh¸ˆ‡H2Yô!¼R=ÐJ’…™P㢜¡!eÃYaVüc+×CÛg g¹€Vï@ÄTÂjyÅèIqïóH3Õ¢]ÛÁYÔxvÑ~ŠœüºHγ|çzçøZ_Õñ˜Ñ'|ç_¥ß }`ÿƒpdúœ8£¯1ðÕ=šNÿÚ¿KΤ¾¢ÓâjÙ؃@î-›Øæ^,Ðô†ˆ~N~bbt§¿]±wdÆáØìŠ|Æ7V!M"|•ûº€—:½†ƒ”öôKë¶uË7}RZÎÓçÊÑ\U?ÒÖ3r8û¹LöM¯¯š¿Xµ›³Z!Á2JÒÌD V΀@´*Y9ûÇœNˆSݪ¥`Ù!Y`–¨+ö—ȳ†ÏÖ+~ĵú‚ÖF \€Yðœz@q€ö€z{2LõŽ±9ë± ûøÇ/¾øâôÛßþ¶˜o㞣È ß¹âHd 5-‡ Îzqy¸àœXƆš*„J0ò›-ÇÈÁbYu›áÇr î8òHcƒdÃÀeÈñ!Ê¥Ò—?s9c`L;îd$D2­.oa š1\UðHÀCÀ‚ Äx±£œRŽ_nÇ-M7èEñh›¤"»ÂI&ž¸(“£ëe,ÆM$n€ðªÀ*ä3Ejn6*¤ºÑìI•|—óýõzÖÉí­ŸãÙqäðy-ƒ ”¦Š«m“a¾A\Ä!øÊTÖ$sì @¢‚.‡ѵ͈`‹!4ö¹‰ßù9t_k @óÞ´;ÞÞ»†1 Nøk]™MZ/°/2«ßb‚éÞtrا‹Ô¯RÓ –FáðÌˇáŸ»ä;ÈÒ(гsðyéRòI^.ó¨O™U±U Š;²^»ÎG‰Tâ~üøë Ë—wb–¯RßGöns„+HMðî‡Ì¶ØÇ_ŽDîä{ ˜LÀ'Ìþ†ÿå-ä<–“Éñ)y®ûå—&¸qÏaø}@KÈýËý½£ý£bVÌÚˇØnš/YïibU°õ0gÝ sàœ Õíö®1N‹y1Å0dÙeY€ÉÂ;­×à&Œ¥B…ÔÛU <‚q=v̱Y48—B@é’ÎèpŽ3!Ò¸Ž?B^ŒÄñÃÀ•Ìƒö ˜Ý’°3V€ á)Ú@Z€?ƒYVËŸçêáKüdOHZ9Ø3ÌfAŠ0tß’æ'\‚ñÎÐ\gÕH"—æ£yc…?¸¹« «gX{–ÜÊ“}ß"9ý>¿Nʵâ%¢ö•ãøôSl(­týß­ÃÁ~ѧ!±abÑFLø6>ì~gÆ® 0ÙïæK>Îsè¾Ö @¯×n&£'zgp IDAT+£QÔ½º˜µ¯ÏÐüçÐ0 D éƒD´Šù%ú·º, áWâ$JôÜü¯¹hC¤EÎÚðÉಖtnð1åLΗõêb™øçîÜ?ä ÇQ,Uóyê&,[×_+p’%œó\j'½¹w´­Ú‡ØÛ¶3{— ‚èóãÌÇ°Ê€˜l ?:N(¥#õ"ê¿sb?á–{Äaõ˽«´C¤Ùâh^Œ÷¨ðÝÝe«ªÝÁÀìP°E¿}kÐï½ÃÔíwç˜÷Á{<ØÍßÇÓé» ó(‚.X>F<Ç ¨‡ñ,04“_ð¼—ߤ=ã=ÀXåÓ»q,¹·ß~{ó×DúSµŽ&çc¤Œ®Æ¨SöþeÖš &ƒÎ¥K7¨×EÉÿÉ.Ò*˜€ùÇ¿ÌlÒpá8t+­[‡èq›ŠµBçž2$Is© ‰8~ sàöÀ–‹e—´vc‰Yj¦Ò‚†)bGAà"`£»`Ä£˜Íuˆ68 ¸ ¨½aáƒgL ™_°âðøo†y Pra5z-ˆšÉÊÞz#ÑBÔ h¯ë§ÊXÛ¦xJæ—ȪˆÍDõø©ÃuÛ>ï9ÎÔœ•Â産¹ºÅhaUGÁ‹¾¬~…ž…f\™ñ{L³K‰Úûõ¨hÏ q[e·ì”ý²¸<™-n”Tµš—Ñox.iåsùR1óP4æ5n|ëaÖ|›uŸK(ªí2}:Ø„‚ªKàåI\BBôa€-xÓÌ6;ƾ*·6ú#èONÃ_¥ù|9ý Ïj‘õk9UGð—94ˆ?•Ä)ÖÍ.Ú©Ó ;c2D²r ýè¬,Éz+ڹ̎Ƭù+˜°¿D   3ac¬§z8OhöÃÑô;èkwÊ%{øµÞW•í“)éévö:ý»Eƒ>Íâ9_p¢¶?Gó?g|­€Lü·>nìÂÖ·FÇkÌö± Þx(Þ†#‡{_¶ævÐeéÏyÐOÌú•0 òS*%ÐrÜ [C)–c}×¥"ƒô\ ŸgY¹DVSöZ‘U¾wMék•r®«JëùÞ¯Ž{ÃéSùµz9(2Èá$ (!]$•DøI°˜d vg$©IµûK8nñLw’ö1|aúZÎ{ʶ>y¨ÇôÎØÞ륤ÅDÍY?õ5Õ+Þv¦ažð!ôžÌwHÞ±,ëýŸ,Zˆü9©?‡·<yrŽë…ì[úš¶gƒ¸gØä¯^á¸Ý·Þz‹Ú¸M4–W§W«j·Z”­r9ÞO9R¨…‘ªE§¥AÐâÞIB5Dߤŵâ ÓýÅv«¡Ç˜…íö¬½ƒh¿ÙŸvcfû¬-ÄvÁcJl ‰”€ßÆœsœ‰"³Bz€T‹%gùŠù…e–Q@n’‰BÉ_‰}¬eàƒ¶Ö0ùÀL€¹é5‚Éä8Ã5YOçÄAÝ)Ïe\@ÖŽ+"'Á(w&ͨլ’«›vž3?—±üÏã¿xúä‰@Ðry/&äúHö“Äßホø –§?[Í âàÑbÚÇÀ3«‹Ëe«ýÂô&ZÊÓ!Çz,ïÀ´Yý™w_+€¯U¼ôQcgR6¾Ï0éÕ:štþ=v£ÿ”«µ?élÍg¬íUÇãŠCä‘PÁc½ŸÁo¾ƒ+®Ú  #¤•KÄ;VÁ;‡ÉÉAkDDðÕ1¦êFߣ²©ÎʹwOéuýÜÂÂHO?”Ž)1)­M¥fXð¬K¦^ŸyŠämËbZÕ^ ;)N—q·ë™èìQŠmX¤6Ô²9·þµ-C¸‹³3!Oß3ÞcÍÒvâs[õ+Dýwoþ®1qo?Zº‡û{{wa” |»@Lm•®¡9­Ö&bÖm4§õQŒšî^Úý5bSŒø”\í›,|£Æ>ÿöûì ø˜•½£ãcl}n]ýˆÃcf7þäO*ì}/²†?äÖ?!o´q_ÇP*€Sã;Nƒ{ûïß>¸~ý:£‹Pwî´ÿ³¹ÝÞ¹tÜØâp #"}âd ŒÉÌçWzÝîw·¶wþæ ÓÇÚäöÑ!8i ­,mIôY˜!Ýò¬ aœ£¢Èظ{åjc8{Ê`‹mŠ@}‚ü’/ ù\Ä}ñU6„¡p«2Ï(cçrƒsÊGÍD3\='.Š1>Â7”8ü ¤±”&ÄR´ŽDb<àZQ&G ¤ôTÁ*Þ˜³qÙ…ÀMtF~“íÔ+ç­½pq°÷×E²ˆ·vbpf‹ p¶ïå$ø<&i¢A/+P.KÁl±Þ¯†E%,m¾§u¢›Á,¢Õ¸Ül—;0x£Áöú­²ƒNÁ­ªlÞùÇ»wÿWšD‘ãÙw_+Ñó’¿AüsC¬¿o!ºÌиã¨^?ó ‰PðcÀ$‘?F^ì M@tØ¥+†÷>Úix?æVg2ƒ“ö©õÖ›;¯°m¬µEüÁ ®ÎÄ.ËDÜ4óøÉ „’ýõ²¼h,zÄà©ÏÚþBïšÿŒ×õ=åOëjjû+д]ï£ UÕtÒ…YÏ´PÓiOÐë!ægf_ ¹]Þ€ùŠû(qï¨ÓÙÿîw¿ÿð‡?ì7nÓç÷€L9^ºÄq§ðê—qTn5‡GœëÉ ´8ð¸ù›Pfíö˜‘ËJ"Œ0 j—³lÎ?—TRsFï5îx ¢(%â¤Ké¨æ¯‘%GÜ¢å–;güBGYÅIØXàrrìnä‡>‹”v|‡pgý”š~£ðzaÒ¢G|6£ú<´ÝLD·¢w¶» ×÷2xž[+r:û¼ŒóÒN×J/IZ}¿üŠ<`ô¯OÓ >¡üA^ð[¸#Àc¹e–l˜³¸HPij›IÙ1Ä㸃Aé3w~f£_+ ÷N£9Ýâû¶8ù©ÙØBk¿YÏ"öÔBéùö¬3CjiO¿Àé Ág°Ÿ\þtýa_ž‘ƒµ±DÞI¶jû$;•_ ¿G므nU9µ%Àlâ‰,üOkéi.`q‹<ÎåêQ†Æ’OlÛLòs<¥ù¨t8×4)ȬÇÖèUú›“úÜc\ø­ÿØ Iü5¸¢øÓúí’ýÒåt'Žù úƒ þìë#òÈR€'ðsŸHRî ,›·¸ÝMö»­ ã>‹£f³?¸§?øÁ„ÿÛôÀÔØŠ˜_ën¨•¥Çtÿò&³úÀqÌ‚ÁÌç½–:'Û0àÉàL‡ à9‹ *z@Pø<‰P!–äLÆÀÃÁaØ (0]]`3À©‹Œ‚;·èhÝRÃZ±< \Œ [À›³\À‘ÄŽ{ÉH$éµ°(aÂDfOr¶™ÝzY“­ZgÛT¦ù>èI«¹~ömŒpæ(¯Û9©d!œåR¨Ž5AV*e=R%¯3‚éá¹Ý­iMwky¸Rl5é«h©Þ…&žƒÑëhXOUÁ’ð|~i1}s‚:‘w<ªæÏ Ý|n^$ó'ùβyPA3æËë|ÈÝédye:[t‚ð+2àHæÒÅ QlL”RZwPÉ!è;òRö§ÿJ|Ó`Ne… äLÍpgxå¸ç ^j ¦BŠßuQÏ`]1Óë®5f’q‘Še#Nðg!Û®ËÅr£"¢Ì„v¿ˆ‰ -›9ã7ϽøÖ ¬'ð{ºæ?BäyÿÞýðÕð¿óÉ'Û‹™T:½`i"Lù‚à}­ú¹·_S¾eãêõ˱1ˆ˜ÿïQò“Ø•eïï`ð=A¾ªª¼‡?çšîï¿;»|y»øx/Öð‘7Ý$lzà©{àÖ­[£kß»öñìø¸¼Ò¡øøÞ{÷JÌTë÷·Þ[T³t×¢õ×8fôÙ¦·Í2@‚sƒIEg‚¢ky ‘1Žª§ û¢Á É×þÁ^cAr{à`g§ÑcG‹V]è²ì%QHP6€  Žõ8×E6aÌ„¦³3ܲ­&Ý Þm&hº¸™; dêÃY ®:ºJ7N²~,YÁYµFTÐZ²M¨óÌ7œ£" Ã9ùù'—³>.ÚÍ]¥G ý{Pßß \¼ iʬT#á/—eÄç*ZºïëÏy{ʲ%;Œèë6ÖV§{ãx|x­ªfZþC9+zk·z¦ƒ_+€Ó@›í)æ}›z î¼Ïl´˜KìƒÐ+æOô]e7…¦Hj)kE®,ö àù}‡@$}Æyâ Ï…‚“¿oJÄxú1€{´¾ÍÇ­¢xª“Óƒh‚šÙfÖ~LÏ—É1ÛÇyèr[ÆsØ Y* B“[¢”8Äée®ës©éÏZ<ú†²Ÿþ”½þ¾C_9*†|4å«¢'s`Þ71Zù“9@Åz¼=Þl ß㾇EÑþ–îóGÃaqpùò«û<ãO½ùÙôÀÖù—é’{¬3Ël½0ÎŽ'x€¢‡¢édQöF2J‡“$‡(´V–—G³I–…‹ ã]嬆.YÀ Ðœ¹-Г‹¤“2×ìM Ñ?aup<œ¬ÉŒßƒ+Õ½‰5]°M”³Ûtñ´â™ÕT]©&eº<$ &K·Žð,®Ó¯«&h#B ˆþ úra+Ô÷ŠÂ©¬©¹¯~Ì_E"0VjxÕüé")Vg&|íÓpñîN0”|¨p)ã¥Mzô3\PHýk#€÷UÉóÅ.!MÜ&á>ëÏ Ý|n^Ä/ÖêmÆ~†mŒ Qýæ{ïÝhÁ0WEk°˜U; „Dÿ˜ÿªÂÞ¿p µ?x´îÏ@wü¤Ë]ì1|c(1(œõ@ó® €°a žfÀÛ<ârbÎ\ÜŠöDÎÏ åøY?ç?Æ"osÔ³ê# q;óÍ„“Ѩô¤–ÿŒƒ}’)UÍù¦C~dìa·2É8¸­¯d_©é ‚6.|»‡`$•BZh»O«{Ü€«yLµ íÅÕâî]NuB»cã6=ð¥ôÀ[o5îþÇÿ¸ì99Å•b4Re$— ^:`¼>tÀâÏÓÄ}f› ó¢Ï¹LB.6É…é6&HS€·Ìѵ,0K i],¡1âiDþVÆ:$m4€ÔŒ‚bnZƒ¡PùV1w€I²v9¸î‹Ïr<—;å?1“’>˜lg8eÄÎ~].<ž”äÓw±œïpKÂ’¾‘=–ÛÈ>I§\<@”Š> ¦s\vxÉ„íâ¦úÁ¹T©$ɯ–æhx8sĵšãÎàç?ÿù% êYß:üÜ0ó7S4ö>Ø=ÏÚ[Ûe±w¸ÃQÏ­>ÒzpÈ).ÍûíùQ±½\t¿5šÿ#@y}2-º£QwwÊùOÎüG#?6K„'ï>gp‡–ßxª×êÒó¤Àìjú¢iÌÕYFbðÔÀP‡„hÈ$SBÎ=Šéq¿í†Ó 7ÏpnÊƃã‰ò7ÀEUA%Àź`‡F}ò3› וm,@‚¸Ž²ñjQ'‰õE2VqÿA¬Û Åg¦·ñ•ˆwÚ4g`ËÉ>3ûÈ2³Dün~küåûàö'q¤¯õ5¹ÒçøvDöØëÇOÚÓšoo ?ØÝÙþ˜=ÿ®ó·¶{ƒDÝ õR¿C)ðÖé[[ÅÞµk½Ùr9×¾Ž4¾H¼ÎægÓ_d4ò“ê§o¾y¬!¡ãÁÕ«lÿŸ|ŒM‹v)§Iþªêv·Ü[Þkvþœ±ÛŸŒF/]n÷ÿ‚´—¿ûE?Ö§ûÎØÇb ÐèLuÊÙKJf " (À P†¯‚rEÞœÉéÂÕžJÔþCÔÆ+ÆL^ ¬vN”r¢òNKd1ÖÅkq¼„5Iô)©q«2¼£Mˆ°pàú¸E ³µÃ?Y¾uÁŽ.vwòx¶DäÕöA Kž3Â"£ø˜Ýì,.w¾µsõûû’ɇï½÷Þ¿Ð.Û‹ŸM÷Ü0låj~ò.V«ÎÞÁ¸] [ì6[ øpvl÷ŽÊ^«ÙÞFøv…Ï|1÷³z”<[˜ñLëûîÿw«Ÿ @h‡2 “ 1Ȉ00M Nœò1PõuŽëìÖÂ5)Žœ(YOE-X_õ tô†È®.w¶Î©êù~úf<î:U.=\bø5°ù^m»Î À¢-a˲Nú#l<_dæ2Šý ØÜCU& ¹ãùO'i¯¿ûý¼n‰IT|µü]ëÇꪒ€e¯×ûƒ=âÚd?îuÊ›À¢ §Sð&¸ó–ìƵk¯«Ùïò%]x ƒ¼q›øb{àÍ7ß„²¬œcq¬T"Ñ+ƒåb2Ùò–íºþ»c›]ŽB å5fü»Í5ó Ôr"nà€¡ª¥Ô ñ4yKÄÓ5á¯@á àAßf¯DOB[²ÕV˜2[s“,B r ÇX;á%o'N`¡ÛÃì Ö{øœ]::Õ¥²¨vøÀ;­y ã? ûibñOó”-W>ôGЙäã Pqqýpgý:ùËô2¼f_‚»‚Œ³’óNààT‰SÉDŒKÌõ#/~R•Œ<~¼¯‹(oØbñƒO‡)Þ¯PòÓ’Ÿëþq°³üÈö[ÔwЪ_Úß_²¥¯œÁÌÔÚ‡;€õ>„@eªuˆöÿm¤§@dë~1}û{ß{îNé² 7îÙê3L§‚yºæ,xÂ$–+Œúp^&©$³;`‡„ö¡>¦jbv¸Ç&»c8âѧ%‰ÿ\Û3ØÓðP,Ú$-†ìИ0$ÊÇÖ@‰ñµKoJèd¬ƒÁŸ%Ù GYëÅOüL¡sž~¤ÕHÏruЬGV ç\¸ùÊåÖÚ\Ï‹ú$äbȉÙ_Uˆ@ÆÑFÎ/‘ÊÛ':=ñ’€§•V„ùeûILÛ‡Y¶ÔH"Nn¢ïèm‘w¨ÙçÔê³ùû\1 NÓ” !Bkq~w»šq|glõk|g6¿Æ ¾ÄW¾¼˜—=A&fû°úJ…¼’2 >kBµ‘·Øhÿ? 0G$—#Ì äd¯ÝjÜ_›}Â['.¾®rÚ[Á†s<üI·§5¢¦¤©oz$ ŽÞŒ3WpI‘lEg ˆ:‚ÝÎåmDq’S¡Ï׎~/â2qQÌ8zJ!î ³¾(ø͘ùÏX88<¢o=Bu‡÷ 0® ¡Ç–ÿvìé1ÎûÃþŽð½+¡GÔöAÙé|̬3×÷øLÿ=ñÀ!åçÚø›¸€=°dYàX‚Í®L]Vãv»õ!xªÇi•UoÚyqÑ.óªK¹?A)yÈÙìaÊìT"4Å7ìn¤%&JØè¶Ú²ß‹%B¶0äî œÓR,ׄ" bþiÎÐ%yELcÀ1Ó]d D)$žÓîms€¯3kÝ%lQ§ˆVÁ¦BÔIM=Áy¹tò÷äj§³ž*–«Æ3úìá¼›9 O²Ê9>š…ý÷ÅvoòìÏ\H} -PW‰^¤œŠš#Ì’WíE=6—+ó¶6hmFWã=›îùcø]’§Ë. œ[îù¼ú׌ôÿŽ½à×$QÌD{®Ý«.&'Ññ?²ÿ kZž+v4 ÷Ô¦³¦“x->5é§ü:zÊËeÖM“¥×)3˜Gq$žüää4”OÒOW¨ÛZÏ&€å¨¦òiF€ò¹aòþ ì‹Ì æ”qÎ |+X6¬¦¯hÑt |¾Œ‹WV €m“&ÚCôîí±·&»èûû0X¤2VúBË¿Òß%´öÜçîÆŒCyîî^ÚÖâÚ¨×é½Ï6À[²ÃÙÜËûÝy÷û‹ýCfIKöô«‰½q›¸=lAo–GXœ}÷»ß-Êáð hÎ\NfSòò¸]^အÅmàa ׋LFiÜ¥$ f¯Ú `yK@%? :À‡,¢ J°õC2@[ÎìcîJšp~Êå¸~d¦>]8ãý\e=”Š¥çðYNòréõ´ºÑS^Ÿ‹G§ œ¡ŽÕ²³«|]¢÷)ìoÝnOñY¢ª4Á,q~¢$â0$ÄÔKhZbûJUŸ9‡Qàˆ ¢û«å¯‚ x£ñ|W|ë“{]ðÐsüÕxkùVãFÜ£5»8Wקõ±·ÑŸÌŠö°SÙo†¸‡û ¡CxÂŒ¢m˜ë ù*ª9‹*9~šñ£#ƒ" P„êOëèZQ)9Äd5„­Æ±YDBTŸŠ1ð’8.¢ XËƵ~ ï·vÏØ!`…Uá:ìH¯Ë‰ VÜ:X¡”Ç3E5}ŸÏ){íB$H86Úá'£ô(Í:Pl¼.÷±’{ôK öK¢ƒlÜ[‹ ÒÎÑè‚?mÜû°qðãÔÙç,áÇ#Ú̈(9ñl{§ßqͶ¶ú°V*ÜãÐõ_ÃüŠýÎÇ<ûÇ‹yëv›°g´ß+ï©`µq›xÖz`ÉQÓ³?¾zõîh2)N¨ÚÀém&'[E·³Ó\.®”­åN9ë}£·Üù£6çÍñ71„G ³$ppŒ8Úi+ð»¸÷°1;b·!;X×®8JŠ¯~€&ƒÅah °ÜGo9ÇÝë8ûÁP,h%³ZûMvRs r„±{ÔÐ|ÿxÞÚÕî¿Â1Ü/Ô¢aði̬¹¥Å:‰ÌÚöª¡”7§¼ u–h¬Fe¼- Þ#BuÃ))Ò=”,¢d‡ô’g°n”‰µMŸ$¤Œxß>â¶$¹ÙõÿØ-hrAïÁ@c“õÿ­ªØz8½Á² L\k{«»õIûÃövsÞœþãÖ?þóß,ÿæø¯šåŸ ÷Ü0?iþ¤‚pM¦q{ú°¹œÂ¨Í—*öF‹VÉÙ>0l(tHôãT.DÙ†c¹òn[¥Sà¨Õ.÷Šy‰]섽,:ó.R| $¦±,q“kÕ. Ûö"© ÍJÝ»N~R¨-ˆþ¬>p'°§jWDª¤Ie ‚) œ°ØÏ°î¯÷'L’3êÈ2#ˆ¾ÓjÙ”_áëù‰©°7l"~|€¸åMÓQÀW ¦!ºÎ"Q(ÊFwÖQŸ:WËER#g~ã½RšU£:?>q®/“ÛÁ¹çŒ>Ÿr©"m(°°¥”€-„;<èeì·\Áº`Ùï´:íb^Îi9é[§]ÐßçFpª¯'‡pk¨ÒÀÁµá¢YƒÛ bpÀ ¿Hb03Úd-yD˜° ŸjýâDòhÕwPGÜ<ûOÿ¸ù•­‘› ߦ¸„Û¸Ht©q•G¶ëhû%ÄÊi~jþOˆ»öoHŽµ~·ù±¿Ó¾Æ!ð³Dô‹)þÄ^ÛýæS<Àç¿%–U'c$~_jã6=ðÜôÊe-ìÒ,šŒs&þs­Z:ÖYù*î°ÝõV«*ûírº3Eܬ†_ü°]0f¨kð%N›¹Éó„OfïÂh„aßã\˜Âº0 @Ç81·¥&Þ#îOÀ¿€+Që:ëSðLnë3@n®â 2 ÝÏéëMå´³~ýpŸîÑXà<ú%nt‡ŽlPø”9± ¨2¸§–²Ä×,ÁoÃñ|º«ìá`9L‹Ãþ‡|ØèÜî¸Úrá',Ï%pt€žúbÒÃâÕ.’›]ìhô¦Ó%l6ë`|–É„-5 üé¬×LÍ?4;`¸cP¨üÁx ÿ‘–IP wŸ>À¾à>ž.ùü @K‚Ó”š# žó£Mñ|ˆP샥ŒŒ¼?±Ípûšà«´×íŠPœI¸žï¶eÖéÀûwïAø±çÏZÿÁþýÆÞý{0]ZÙZ6ØÒíAä—Ñö—€x¸»»ûË­­­ÛÜñdøŸMƒ@͹ñ!ç¼G¹Ùk¯½† 'O)ÈÙ¸M<=ðúë¯Oß~ûí{ZD«¼.˜¬´{Î.ªý·Ë­OÐGÚfÎ÷±ð]„Y&õ2Ö. hMS.œí? ]€²Ûiô/]j ·/KÌþ+´ØK¦ým×èPÞ5m¬ ÇY±ÅYâ!ô QiK¢›ÆIÄ~±n|Ä—Ù­ãE³m"S ¦ˆEQém¦è§ê¬$ÜÃê{DMjŽ ·Ikm|'äó9 ǼÏwk²_2^¢!AWਤ+äL|’îÁKû ì’s@Yoë¨ß}½}ܹâî¤a{ø«KÃo–ƒ²<˜½6ÛÿñòÇ{.MÇÍ.èÏsÉûÍy¯ Ýi–0Æ|3æ­ˆVb}€c ”Q˃‹Tþ” <.@D†¨ð} ÿ>Û›Diû…×·†ÕEZÇÌ"f&¦¾²Ž<ÆwÆZ¿ Kîó÷à6ýÝJaK& /ñCô!ðGH!ø†=Íoôá‡NêWÒM6¿›xŽz€q.Ø8SÞ–‹wß}÷I€8¹èuúûpÌ#vªµÇÀ‹e¡Ûž” 1@U¤ “hµPÁ'7)ã¬5€¸³ŒzAðá™&1%] A´ÍÄ-¢¹õ³ê»Dòù¥Ök¬…såõJ¦­Ç׊§àyH‹îªëæ"Ù¤§HÈÏPûâ<_T*¿$¸]2Idz’ô8N‡¥7ù(rjPŽŸÍqƒ-‚ÕbÜžu»åèhT¼µûVã'ü]d÷Ü0P‹5µ]NÛ*Ç“åÕù¤x‘ï÷p°Ãät ûEHÈàX]0 ¼¬|`)füÎúÁ,8V.EÒ¯£î|'ÙM.ûÄ ®EëOöÖËg rÓ¹x9©q̧3xžv[üÓÓæ[QDœ ~ˆYøuØõBgýqO û %ÉÀÐ/ÖÉÆHV¸Ø3«øØ…ŽŽ×fö‚Ô¢Oe>þ:÷Abÿ@>p}Ä­Õ¸Cº³ ÎÙ8ß¹sçÔ ÌÆmzàyí%†‚*ÄŽšÍ1çÍÞ§ýÚaÍÿå¢l_Z/c¨¾C™ëˆü•XC" ÂX+í̱› sÁsòšÌò—ì"ˆÓ™Õb…å@¶Æ"‚¢lHÀ•gr¼•öšDÐ:%xþå+X9 ¸ö¶â ý§v”JV<Ä3ë‡Ó?i,¥æ¼“õÝW5RÎãm1Zå'ZË·‰÷"¾„ž‚H†ãÝe¦ fé³£,ŽXv§€g5¨>+§óé–KÌpªNU^GKpºœrÄü,–8>øb»ç†ÀÞvgѺü*Û6Ш­^XÎç ú>ÿ!Z5×8ܧ㑛34ÿ'”¡ÈÚ]s ÍYPÛsž·„øÑY.PO@¦"S0P&¬1ªêtË9XN°‘:3øZËÎä܆š.9mÕ…l8¨³q ¨Rד¡þ Žçt ¨ûª‹'atëG 0g¯ ê¤[=ßB MŸ ‡Wbh•Ë¶^a{<~þ ;ÿû¨ø§ ¶ÿ}nâšÿÖp€È¿=gf¿‡Øÿ¿@ü9½¯ùâÿÿ†à#¤3ò>¸råŠJó½½½É_ýÕ_ñ¢·éç¿€…åOúÓq½0í~ó›céær<ô{½I·ÝÆd0˜M&WºÍÖOxK–ˆ8O‹ÛQ¶u) @òV¼XT™°Ñô¬–vÁ,v·d8dŒ}σŸ@‡1€ƒïš;õŸø#MbLùØÔR¢¹Ž¨N¾ïR£þr[rvnÑÓy‡„bS\”0Qº§LI ‘Zc‚”’Ê¥ò¹xš¿s•Bš+ˆíê°¾“G‹‚à{&.ž5Æ’€;0Š)ï/R„fŒÄì—Ç}>_.{ã£o@<áñJ»[þY§Y^ÂàùöVìö¸Éó€m/®{n€½^=4ËK0`—99ʃ~^dÿefû¬üõÐè,<é/fý~XÆŠL€º†Ç1û¯ÃŽQ~rDV¡J«XI'ù TréÚ·™ÜÔ™¬'FWuV'_eÊpĪœ÷&uŽežÏ›|ÂYóW>á<û×OÇ4À‹¾RH@<Ú÷Ÿ°ö?Ád¦Æ~*®èPâÈÓ``”LYë¿Ñ?I¸ïÿ¬þÅi~4zG¥(‘!áÛôÀתÖ–»TsKó}˜‚Þ¥K×^nv–WŒ9` ‚ö$â+s­Ÿ5ª‘ jIéÖÙ¿R€8/7þ¸µm‰>@ 6íáÆ&@17s¡°õ‘O,·ŽéDâIluÂÖ¹M®DÒ§;²‚ à¢L¿'¥u9o†;I[§šû]µH êûcbø&¦‰§!Ì3U ;—Xt2WJWÀ qJ¬}Œ-ðYÉQÁ[2]”繆^<ÜUµÞÞ±«.´{n€éæC÷Ì.0ØÈi˜0qneoÁñ\ÿ`¯Ã‘@Eӹ¯?—Ñ•;5`HÍñU/0ོN¼ˆG?Ù?] bŸùG·=ý|ÏhÄô|Ñ1±¾H‡…F,³PBÂÚ_2/šÊ*r¥„"a«……?6ÑÅ(±áQwÊìëšó€¸ÝægÓ›H=ðÊ+¯`Ùt2ÌÔá° ¢ÏRÙC[ðÖe¦º\éØÄìÕ96ð©Í4ë¥aÚåO;à™Ùmìp–K²G†ƒ0%eä ¿‰¦'±ÞèÄ9éÑNû_à-Ÿºip]ŠìCð}T—Òr2ýD§A{º ±>ߢתŠöwzßÿ’þ@€.è¤æ¹Á¸mö’qÔoó…ÉbùâtÖ¼:4YÿoÆ™dá@C@3¦üÎüçËz¸¾ù¿àÐpD&·šfÈ~.pŽÏˆê6ðNUÉMãG‘?§+š›Š"<£Œs¤›W×èó÷~ê®u)gñŒI* üÙôÞ˜ý“í#3®©qi³k*õ¹Î¯?>:@óÿvøù )>,Ð8î03AF`qùÒÎÝÝ{pÌûý›Ìøÿ/ˆýCúç\öû<ƒÛþjE_T@Éý´ñ7=ðeö01ûå/ßýte‚öÚêzÑBÖÙ¨v8”ë%ˆÎ÷wç»/¹.­õR­ñÁ)ÛF÷ïcó‹S‡°ZÓ^[(ß Ôm …xý6B…&¼‡Ÿƒ ›Ø¾oâ»0gæëÄI;ÉBOÒéYáµèˆóqÌ©>‡œª³†wVØ+7Sû!¨ËÅòÁz\öÔMˆ<.ýL¹àHû¥åˆTÑw ǽ–Ð ¼R̹}Â’€¶’ÅÒ‰KâÑ#9£ :EçÒdëO8yñ¦2СÆÝY¹xgü`|ÔÚkMh{rqÛsÃì{¨cvÚ¬9º14»d× Æ%•yñ5ü¶1û‡ð»†åº¾Ã9lHüÍçëç+„ú×Ág†#fÝ?UèKŠø ùò–pÄ ëÌÓe?Åžê××ÌשúÜC;"æùþa‹äÀ¼-Ó8ì'–ºì` ìl¢ˆLæ¡=EÔÔívšˆý˜€”ÛGŠ0zõÕWÃ0ÊE§ê¸M¡M|q=À²ÙôZԜ͎9I#?íâ“f³½—tBr¬';é§ç¬+Ï˹æ‚´TC— ½ì0áï/ÙÀ1Â͸3nÝhÜÈo–op!|ÉÇ3íøH!fLº¬ÇðæÍmf÷œØìi~†l¶µºSÝÁÌ”çƒ P2¾qòb”çñ Ÿ/¡@·ž—R¾ø_‡WíEŸ:iå§OþµNÔã=”jÄ•ÓÈîÅ +µòò(ÑÿM´…Õž/X_œ£èÇåzZóG1²(ðM‰YȨÁ0Ç ·G¤í¨ÔŠ}Øëõ°øW²~9:88˜Kø7ÄÿÉßn“ûõì‰õƒæÃáp|ýúõc`Æ-²JÒö!èûÚ#¾×.‘®µcg 3|o&9®]C¤d*HK—;À„ÌlÕ €¯ƒ‚<,ˆu„ÕÌygçOþ b—õëÉ¥Íýl¥?½½ÏRÂIŸ.&„³/¢WJqÂ2±DEþN=/&/ª0]²ð¿¬ºìŒê«w4h9Øi–ƒíμÓÅÞÃ…¤µÏ´@â¯ö?®Uu›ÃÙQï›|—?FéïV±®`痢õ¿™Ê~jü£üÇþ¢áŸÌÿb ƒm0KÀp(†ø_Ÿ‚¶NÜzø$õ©CrÑ结†OC.¿ž¸ ×u¢L.(0å„yxÙ]Ú4àž_ÒåîI³¤â/×ü`‘"ÍÁ¿M¥67˜mðÈÙª#ÌÿéÍ÷ûOà€s z¸†´CŽêrc{kSЬ˜ùßm·»ÿÌwÒàÏ]®Û §fÿS— O·éMœß˜ËîÌoÞ¼gfô±—g½|»£F=´¦ÐÝ­áŸöºí­éœã„9AcÊn‰ÕrŒ]Zí ‚Gn÷bæ/ðš “uÇ4‚| Ù)&O gÀ!°åøéTBq‹„“‡v’LR}‘á:%nµkªÎŠÄü“ËçxöIçVÉE™õ‚k7ÍåÏúg‹ä¶ÖËå2Ù¯ó2æŒ*üÈ h:^†IÂ?qÛ$}V°ì9¢–‰±™ª5šÌ.-[Å°]VK²?Ú)Š×QÜo5û¿»ñæ uŸÂæÃú#|Õágš óZœ®ÕEœ\M.oÏšíoó^‡3»<_»Hg ×öefèX,ë°ö’÷ÀVœž¥sü:àu1øRðd FúÌ€©“?³—tn¼ŒírÕÞ €½'™_‹û0V‡žoegä:k¸÷??/©~žYjô;ˆõÜmÀ¼0ʺ žÉv Ñpº•Gû²Ýo4º³þÉâ?;@(pÄšþå–âÉ0Uº5ÀlÓvs–ºÅ æƒÞÇþ‡ì]¾ùË_þòØgc«_eã6=°éÇõÀøC–÷—s¶•-ZûÜEÔ|ÌZàªv€©Éôø(ÓöØ—Nâ¢qx¸ìl%„iתts ¶ä.„´Ž ¾” 6žƒ‚Þ~qk Ìø#aF5D7s‘ÒY±ŠD¨Å2s%¼³BLàž`"ù›e´¥oVö Fü¤äª%³>W§Tø¬Ko’ß+3¼«“%ž ÛÍÐõ„;ÑbfReŸµ‹Ñb~®‹-U›Ó_muË±Gîhvoêäg|ö^_uü™f~ö³Ÿ5'³í•Sš‹6@Âڳ˧J:|\§ƒË+ ãÔåÆu¦åüHxÌO.ÿ˜ìg*Ù!ö’9XO” F!àCÑ—¦Cø¬%V¬ý/ôMEÈMp¹Æ¨ø¢ïá>s/Ž"KOô;QóÆìýŸo¿¾q›xºp‰ W}ðÁ‹éñ±Ê²Ðï–µ§!-gÕ­Àè:´Ä^X "Ä:ÍåÕyRi-I;Èûv· ÆE$vÔÄ="ùæk+j/®ûf?3¸rýá}ðìxÑ u>ýÎKÑo02É* L8‘‹tðÙ±ÜÂAA.—6K²Û]ÎqôFè[%§ÙMÎ=Ó €"°«W¯î²•lXŒÊkwg—!þ»Ìô·¡QÝùtÙŒSÿ˜ÀºçŸÉ. ζ>2>œß–¯å7·òM“=ÐY(…b¸)Ÿ°*W÷Z=@~óý\>û¹”q/gÿø« Ì¡¤ÀxÚ$WóŸõ@fó²H 4‹ãD?Öü§ìù×þ¸Gû.9óWã_kƒ>Æ~TR*Ë1iõûÝ÷Њ==ý¼(ÚÿD?ßc s|ûöí ' ËÝ´ñ7=p{ vÆ×wv~îj²—`@ÍQ§×›†ƒgÙ™uôtŽ°ËÁä¨1fVêå¶]Dw,Û)ܧ¶€ëƒÎЙѲtç Ÿ¨M5°iÛh/8S"gi $ˆ×Ìx1ˆ T ie ¥Q¾ ÷Ùî¥ë*ñÔâ¾ú1ƒÐöèi…yÑÌ2BÌú›Ðñ™Öa2‡U@u'l’ÝšüBgíØ™qÅ#éH`0æX¸Pî™f¾õ­íroo¼‹™ìÝj¾¼ºDìòÅ;5¶÷lûco&3ÄþŒ}™_R”Ûþ¤±F†ï eÀ~FãõH©½øry´üŸ1àÅú´µÞô£Mæ›=¹T®gé\#§…ObÀ*~žéÇ3𓘌”¡(Ëí¿^-ö¶ÛÜ—Ns …“Ë0,2 @ d*:ì»D«¢ßèöz¬/vÐhM±^öáöÖÎÿ‹bÒ÷ø‡œývkkgÏÐ~ðƒl€ShÙôÀ§÷pºZŽÑ{úˆ~s6²ö<¤æ‚­{­! €˜­œ¶#Öÿ·FÇ,}Bøc§NÌZÝú BTÇI\‘t…ÀCÄÕÝ‘ð‰X;Å¢ Sý  êàÑéèJÞôÆJlh…yŒX0ûæ}q.P´·ÓÅs¤à“sžô$£¡ôæ™õƒ“Þ<XO£@}4ÇÌÔ”°´b¢éežæ¬öfÕ|×gÂD@otÇÙÔ…sÏ4pxˆry±ƒ¸Ñ/ʘ˂-E0‰e Kø½‚qÅ—Ã[]ù“¬¾|PÇsòúØ2m=ž›ø\ý|ƒìÓøú³ägÈþ“îmë—0ž/3´ú¦)¨JyJ`Œ–cÍ߃~¼ò2@l‚i(¹Bù+e ‘e?(ÙƒøßfÉrö0WGßúÖ·T„Ù¸Mlzà÷왪ÆZ2gŸsbæ1H°Çl~€âÙ1SšcΧoi!ˆ(÷+ÑÓ‡zO®xà+„Œ›²ôÊb¤vÉú§È€ú qª9aÈnõl_Jʤg¸ösÑ/Û÷9âÖn|^ÚZöI+RXbOã-±’Ćr"ž–`?°ðI§ØŸst£BBSäah N”U(C}Ž¡gæ麾3èö IHp|›¹î™dèȘÈÞºu«dY"êTUW‹˜°Ééx_à€{ÀÇtÌï)x f|_›‰u¿WúæJt~îóÝÙœ'ÄO å¤©hž:úNø);OOpò ÙÉ]NB©²ñ\ãôml^·!·â'|ÓÉpDªè>­ÀŠ uû¸îÏV}öqc1AüÇÔ§“ÃAôDbžÔz – ‚x8)³u„ÁÕ¼‡E±}ˆ&~/Ì ·O6nÓÏz°ô©uM•iÕ∀ÖÇà3À²ØáçÌ÷e`°…©À‡¤1£_Ĺ³‰MÑž¨‘ €³¦ÀA ‚Ýhž¾ø!0 yŠïœ$@W¾}Y£ƒár\|“Ýz8Ú##—Ëe>oÿì=ÏoßRù‰]HO&mHBâ‘d ¶’¦”DÃIS%"‹¢…‰à>zR—¨¡Üf·ÕlýæÞ½ãc¾m¨·ñE¿öù¯y&õ™c~üãÇÖ?¶Å4¯_ÿæÎxÖø£²j¾2­Z—'‹vKˆþ[ˆÀJ,[aƒï1f;ÀQÌ€‡üÌæm¯Ìú”Á÷#Çw•KÈn}ää4ÉJ7€:ëEjÞ!•\Ï0¼ŠË5s??iÞI^](< ¤‡1e“ÔÙF&ÄÖÕLÒõ@5ÿÍxò¾aìÅR€ ~‡­~ž4ªæÿãɆ¡åÜ‚?9¢fÉÑGÑÁíÐPñe}Ä¢ÑâØåa£3ŒÑÕKÃÿ§×ëßG7C%­Ÿ1ÚÿÏVëÈSþŽ_{íµ §K7lܦžÙ@p„©àß² DÿfkÖ³P]E"÷âÎpë‡í¢ü·Àk¯Ûäìz.¬nrX‚4™˜†yO™dÿÀt³1À~€KZd…¡ÁB63\ª€+—àT- RúÆ]ÚŽ‰cÄQC $ÿ‰3ˆÔGD®.AÊ ßpíd0²#'£M'>ºõƒ„Vž ëæ–ÅËÑò*áä> æÆÖð-/=þÒ2b´GßÐ cv.4 )AOƒ•Ü>¹lôѹè0iêV Ì3õ¾y8½ƒvˆ^Ô‡»ÃÖÍvQmï´Ëãwïü––ÃøY¾óWåó Ï–{ë­·öÆ6 ŒÌHϺŒNûs[;†—ÛýÜçïjµƒXBïŒ8i12òxÈþÙ%yžñÏDb›QgúxùÏúç=r®ºî[n=.ü­®ÔS®rô2 ‰ e?|”Y“蟰y21ÎÜ) Â  LjÕø?@‰Å¿åábq¤æÿÒ{~äóu“¶éM|ÆxóÍ7«>úhŠ^͘Ó3Gívë!³þ{­vëA»,ŽaXŽS?GÛ,Õ §51Vôßrv1N†˜@ôœ h $-* „ôŽÐÏ—8#¥§L*‰T.Š;ïYÎK{äy-Ä%Ç€ŸñmøüÈ(I–Á } |´”•Fº/v0¯[v(;¤ÜpIKw¶˜t—‹Q§ó›ÎS=Í#÷$É DÒßä“õ¤ìr¡~ ä»V×âß+>ž±îL?jU§œöb(¤ñ°äæë~ÔÇÇÖŸ=L ·î¥µ|2¤ÓpºÌ ¦hµz¥Ã~èvæ+N÷+9 þK;þ·ñ?á»Ü)›åÖ²uåWû™³DSq!{æz-Þuó³é‹ÚN†°(|UåÕÚ3?`½úa³ZÜÇ8Ð-ˆþïØ ø>ð)c°PIW+J0ÝàvÁ•OXøNƒè³†¦a€ëšPIØ2î—XJA2NÉUƒº ï.û¹Œ~NÓÏ×*3×+üáá|›Ôz¼ÁÚÍOQ_\t“kÿqÑšE7¬@\±Eå@|M13ùaÓD]Zì MÝL[è^ºûL-@ЛÃ(nܸÑgËEq4ž¿qú!£çûì` kv©Z´Ê…‡Yp˜iÌ^ùpñÁ\ÓN‘/•¨>Ò€ã}œ ’ÇÏjh0m\Å3éë€PÓÑ3%>ßhM®üú\yŠ‹<]àFGŸ5@gó*· õ?™Ž‡G{0ÓÆH­¶`b1l…ˆ°Û鲧ÿÝ­ÁP»þlû{§ì¶îvÊöêUÜê6»c4þ•7Úe^·éM|N=ð“Ÿü¤‚ ˆ5ì hÝâCšîÏ‹jÏݸlGo‹jk8˜þ3ÿ×8©n8žŒÃ_ IDAT{±;3©IÔ¯=°ÕUô׸Â2غoab@‰Ÿ¸«…ìÛÉU(ŠKq§€ÛH”MX2~Oˆ*Q)HðzžÈ w2E«Ë®hdÖ‰â·t|¦OsQ¢®cÍt¥zNÏw¦K3’TÀƒ“ì) À@iųp¤Kô`c2³tŠîú»ðß`ùÙµ»Gý£ Cw/̃œßñ¦*úßßßg«9êæËj‹Oó2ßóFZO0Sßošüµ0ÍÖŸ4nj¥´³wŒá?'9g¢'5äŸs a˜ñ« Éº¾ƒÀç Ÿ`BTÀ“ÅÜ:‰Ä@ €"EÖ¶fp³¸nË~gØÂtö‘̾òÚ+Úù{uQ;ló\›x6z Ã8npXuªé¢h.Ë~óV{Þý§îL&ío,«Þ\B3Wˆ•3ÿJ˜¯:1A’*þחЋ\.P®•!t ¹Ä Q(ÐI¹"‘ƒŒú8ñËÊå¼Uœ¿î‡ø=ʘ9Çÿp?ß*µ$ûá=ÖS½gÐJ¡h¬ŽòÎ1ûW “ädJ› ¾ólîVKq&¼“Võ0ОØÁ*» ÆGûÇ&À³Æ@ü‡Åî2%'ÿ5ºœÁà¶TDþií_Í×÷ÕHšœŽI?súÔáóc†Á“~óp8;DÖãOªÿyæyÏ Tg}ïùë> –{lzäÓ#µÏˆ¦6ô:´ÿñ§Ë•.Ï °'cv†‚Ðde=˜¦#ÖYÖf& l`Ìû·KÛôÀ¦¾Œ˜±ÊŒõ¹„HcõSÖˆIùæ˜]:¤¢Si>rö½€4ëþA†Îô…ÿБ!„ŽÌñ ¸7?ð…y\Z¿d2šñåg}_qÔz9~ÒŽ¹¹usq¹Pö} ìrÑÿ,~Ý|ª’î+_´#MK…\]}±ÓŒ¾ ßî$LÒiÍÎ’ƒêè_ôšýÎÕŽËÔÑ ×ò¤Ÿå­Î-ûL1?ûY£¸t©µµlÍßhrèÂbÔz}4]nIÌgˆaŽ§g(±ÕŒ.lê.>Ä µÖ)6h Ð~×r°¾Úÿj¹Zæ¬sûÓgæã¯}¦œv¶ÎÙx®òäòë7?Áõøˆ&åÊcíÍXÉ-wÆÐäY™• °>»6qôˆò¨ÃR^äéwóKÈ=ð§Ç¬¿ q׺×bŠíp6ùÌgÇéá'éÞMVK8Ft9kt¡ñ"€‡-_ÞÕ⟶ÄËÙΰ|8è•w¸ÝÃÅrúÛV¹{«˜£I1™nÌýÒ+·é/¡À‹_-µ×YvšÃ‡ÃÃî±ôg†©úÅöb<ÝŠ·8¶öÜ@ïú¥«/cÏ£ÍúÆ ŸÆlD ÎpÚ¼)ߠט1›õˆa˜ƒ)Ô^ÉàŒ:ê‰;ÝÙk„Õ'²q¥zΘÅM¡Åïr«QÝz¸NŒ,ë¦6°,˜h.ç¥rc0:Ï)«XµeÈHNÈ> >Ê*œÈ Ä¿esËâbgý:_i&Kå}¡Ýgp ¢¢Ñž÷òœÞcÇÅ!†°Zöç³?>šL{`ú{HdÞíO¦ÿÛÛÿöHý vµÍ]ÊI­ù¿ñÊ_þm¿;özïp&ö”µþÖ6Ÿ+KÍ!Ä»Œí|¬KžFdöW»$öùrïáÕ Ìƒq5(Îy6óòuNözR.ö¤æÖË?mØÁ˜/,]¹vº«àsR¦.RõCç+iúWëWg†/Ùò—.5þ=ê—}ÿþ£=Å2 Ú è2Ø;Ì :( pøŠ€Å„%™IÑo7†Ÿ]ûÓkǯ¿þú…Øæ’{hãozàyï7oÌ^o¾>ýö¥o—Ë‚Êýv3Žá>l—£²hÚEgÜ-Ëe×£º5Ä_÷$Aàâòøï8"x/¹:൮Kñ€¸C|r çØÁág\hrv9-ãÇì[MwÖO©èïÉC­ß?…«†“’ùixúRø$ÛU&É”¸@3É^N0="8Ž Æ—Yb©k´ÕVã2þVRvFG£r{{»uçΖŠœ_¥ó>N‘ 'ÊqÈ']-lµ¬z(«u`sÕeèóQ¸âãÎoe@‚ïUNËEr.óÿ¼r¦}•îäMÿQ†ŸÌ+¬&ƒ‰Bºr €{þ]ó_„µ?8[¨’¸ˆK{áš ÖçÂØrsÂuÌš!ûýÓƒƒëþ¦ÕÝ”_mãozàkÑÂ\ºþKuéÒö´Ó)—Eë˜Ùé!°É®œÖ!šý#àvÙfVï¬U¦>ñ¤ü«°Wš½'RG›à X.— ’¾itk ±M4dBÝ×Ù¯£_”çmêÛŸºEN?•ø"¹~öWCL™é}¡½ ˆP q Ñ?xÓ]0œGSa¨©ÑŸr8вWÍæÈQË‚Zïð•¹gb €ÁØâä¿e3&š[%.ØHé¾ÿ9æ¡6ˆ§dìx?FXú‹c<¥'/º¯¬¿ŸúÆA¸-Íð0,Ó?§1">ñ¦¹%…Õ˜ùS>Ní#A@VŒtÔT¥¿˜ùY6IbA1„‡õ:ˆ¸ ú½®ç‰wQ ã!3ößo·ZŸÀ_6'ãÙÈ°ÛôÀ¦¾²øÛ¿}·úË¿ŽØ}v¼Áúõ Æé>iΫEyyÐï¿žÔr`£œëÌü¾P¡Ç/¨àæA* ×Å»ü鉡¦…Qh£y.ŠFB2Fªù~ ã:Îz šâfqçGûj…É·òz«†­ö¹¥p[ŸLç­WOiÀw‹g’Ø»ÔA’äÌ „‚%Û¨H¥ŒÕ¢‹R”ýhwîîlíì\î^þæ7'¿ùÍoÜ%U/0ú’Ý3ÁHüµv…–y{2A0nÅÉÖôZ›ƒBàÀŽGÄŸ>†Å0/têcHÿKîðÏçvé©3L†5ŒäîræÝž‚èÃpäWÒ  |ÍTˆüF#NãÀMÿΰTj±ž¥Ö¯Ë¾"ˆ~«=œA?!ïî ×ÿˆG£NsòÆÝ…lܦ6=ðõ€º7¬-½ñÆÇßÙÝíõ_¾üÑpлŽˆzѳEÒ`Dð§¨Çbó¦,¨ @V ”bIì8Ññ¿ a¥<èV)a'^'Ú–r\TpG]ÆQ¹Hö-ù¹¥¦ôqÒãúgÝé”´´ïb†ËÈâM/wSPÙxý)ú«D¯J¦Jû)(X6ç3$ÖsögÀ4a1u·Ýî\îôû£ålv4xýõCZôÁ¯Ä= 3ÿ&W¡L‹½å%Š=eŸã ­ÿIìSÿù}âñ㸌°i9nÂgpõX95DrÚghæ++ê³Æóæ~LüñCJÀ˦Ýç¯ÒŸ¾âÆ7e,#€èOÛÿˆíi¸VÄh“9n–Ř6'Û£aõöÛênܦ6=ðUö@V,ûõ¯=/f£IÕ¬ÆL‡Tè™ËÀ.ú?ÌäC¼߸œÈ’.ü *±ÔV€$‰ÖÊêX"¹D0™ú‡¹“6OÚù=ZÎÍœ4’Bç=àãÒê62àoÑt) ‰b"¸T|ê´~Š/Py4p¥zÛ4]lLûwïÂM|uîÂ3?þ1Û{ò¬¶çóåöáhò­ÉtòC†ßU¬KœÍ¼ƒg4kãQµ‘sÁ' àƒ°mqí—”ƒMΨË~Š­gsr.~Lú~ñ7‹åFÎúd|ó('ÐùýÀd€³ŠM"¡KˆtjÄ}èT%ò§b ,ëºr›–؇ȟ)¿³~˜w.€ŸpíþÖ’Ã} ú Ž÷Œö±üwDqÔokÌš¿å°Ž6ðΠO¼œ3ó?dŸÿ;¬‚Pš¿a`ÿv:žÜÄþøl~oúæ›oænåA7nÓ›ø*{›)è Ëêýy«±~ºìáðqÎæû½>¸’™=8fÎÂs‰–ì; =߀Ó=E"±åO|Ð1Ù€ÆÃf䫉ñÛˆ;q°­XˆÉ…¸ d÷X¼(¦«].“ýÇWÊ5žÐîI‘'‡ÖîOÁŸ®²zò ÇûQÂaß ÔÌmÔì@SWbê*ô'ʘ1FÕFÓ‚ ¶²7›/^9=¹öά(îÒÔÁé~y± ϼñãçn»_'—§hQ"Ö…ã–¿Gç½ÄžÔb>oõÃðÌÕÛÿ3j0 bw†û[Ø4çîÇ–´ÛoënÈ u~ äÓt-Ëͮ鞘OsT N;7š4éÆééRfç"ÿ“8¡µçL\x*»¾'{Óbëž €=Š8ôǽ¼Äy}}÷û7(ëCð—œò7càdŒDÊm튵~™D-˜í÷{lýëhØê ×ëüR c ¾Ï÷xÿÞÁô4«÷¦¯l”ÿ>mlò7=ð¥õ–8«wß}wŸU¿›ÍÅlÚl7•œ Ýz—ôf¬UË`B<ÃÚµXÿ_BÀTò+8jÅ¥ÀŠ°3ýþ¼"¾AHy§Tüe$~¹š¿BVf®á-2’3m•nÙ­sÂcü§-w^u_ÂôõûÖÑ3ÍÆŒ4i†K̾Žµ<‰×Oa–ÄÇökþc¶zrà˜í€X®uÁšã]–^¬f36V4—,»ªø•¹ ÏüºæÝ)GY-[ÝÅ¢@ô?îCwù»A!æ±æqá&‘÷’è󱼂£åÃä:ó±?¥ësiëf—Órü3ù¹!ü€‰Ú·Ok7WU$gØòÙ·þ£Ž\ qÕ¾€)¸Z“Ë ®õ… V@Kð}äö5‚·`?ëÛþc®#¬X<`Vðƒ?ŽGÇÓi5á\òe=û·áÛôÀ¦.F,aÎ'Õx|`J|ŽZUq ^d×6þŠB«ªØùòxoÈ;È?@»@à ÒÄb \, ^Ü“ çT2_,O½@d?ÚÉ?©Õ„,`üÜ‚¹Âg÷ó-¬¹6þ¸[®?Âz8×Ïõê&ŒíáÒÒÅÿ2X½,sµÇº=FªÅ–ÁX—½ÖU¿`g›òU¹¯ôæOóÒo¿ýv³˜M`-ÚE ëËgùÆzJêhìê¢ós˜¯K0.ïãGŠUÌÓe?Åóë‡Ï×cŠ|1Éù©óÍ]¤åË›>î(š–jnµXÓ¢Z]5 úvPº“J‚nûÃØë… ·Ý)ÊÖ-®;0û4Ãi³Ñ`Пyɵk×´Kmo~6=°é‹Ó‹‡±ÜTÍ&Æ8à#v½ŒÒ*Ê Ji(õvæÓa?<ÀsÑXA¼Q_Nžø8Æòô—.û)öÄߨn¯lJJõÚxâ >cfÆÂúâHY›Ä(­ù°‘®O§ÅRˆx5_¨]²ÐTiõv¯Uê”Vé(¯eÀ¯„_x Àöö›|öƒ>Cñ|Öe.tæ¬>Áais™íáËe±nb,VUsô-œÜ2âc_+ùæ&’æ¶1–ü ÆâÃâ?É9àOÜSÔ xȧªž4ò©¡LÛs;ëO°>ïiâÄ.Öíˆ8—:”Ä^±?=ÈÚ¿ÚþK¶þÍWɽº5¨Pó­ÿáP ©½ÿ†ÿ€öÿ}ÚÙì¶ßá(†cxþ‡íö`ïÆ7C‹Å£óåSßsS`Ó›øbzZ¡xpÿæÍ)p|€ÖþñÖ ÷¿€[¶'‹ö«¤ùwƒÁàUíÖOXd»kÙp£4ÜòBe¨f˜⎀ë«Ì[3¥N³Ôr‰E5*UºðCú!R§§bœ¬SéÞÏ2ºÇù)÷bÿúìOóüyÌêçpf #žrÒoÖ}¹êHj 0ÈñÑn¡ðWÌöHcÑA|X²ЙÎç“0úCùüh»7O·é¯Y¨ˆ›ëSèÍÞ,ß÷€ò}”yg0óõ$!Mœ$›…dïÄ™—¯@0ÑäÄð)¿J?©û4!«ërs9‰_öOû†°”tiÍ)ĈD&›f*ˆKüê”Â(6™½rݲÄÒb1böÊVêæÍ›7›_…õÂJè >œpUÌ«ëx§>*m}„(=vSµ‰}þÌ敞Чtò}:ÜNOß)ªà ó{9Èùä=K-§;D‹´›x*€ëÜ&R©tÓZ|.›s©š›Î­ä"9þ?ÖਜM÷ËrÖôâò}K©ÜãÚ{þ1õ&áö‘ö£è—¯Íöü»ÿ1aÅúÿ1ØÞíf—‘\íÑoc˜€£Éä@¡ÛôÀ¦.h°D·|å•WªÛ·o/z½ ¦½#,‘†ÞFØ÷!;‘z, #l]‡1 t…4@é)ïÄÌ«Á±Â’Ô€oÞR]\^b^çîq!IÄÏ(ë,*;馜sÖ?)ñE†Äýºð}„3œŸ* ås¾´Ã+ˆ¥ý´ã$Ô¾Š­€ø*b°NÚßaçÀ Ä·‘œì·{ån9¸´…»ÂÞ ê¾/q2uQ€&kÿêWb3ù[Ýîîh•kh¡^ŸÍ›—¦féè`¶"ªâÒ‡ à´úð|ÿMŇà˦Óý@|?W8>XþîuJíQ žÔª^¸®íºœ±ºFÒ:¯|Š ¨ï^zjÉ%Z»Î<õ uZ}³óÚ²t<înUŸ3‘ŒRÍw´ØÒŒ€Ê(Õ!}ƒï¡?£á;rûždô£lÑØfÛßÎp‹:Únß-›å?£-ôѲê ú_¼C‹bëÁ⥗þ|\?âÆÛôÀ¦.`¼ùæ›2éçs,nݺUÁü3ú=eÑ[õ›ýmhΓIk +ŸÿµŸ+“Ù¢3Cœ]VŠô%þ\¬aË 8£…‚1ݲE¶‚óÏj‡s@BŠÄõ’^m'¢jYáÜž[‰ ¥˜³oã_œ‹I Í{k±'~8ŸuÌ¡:aÍË9ú*L&_Zã;×´‚G¨SfÊ.‹°«±Åöl9ÿoZ§¨¶šQ-±s¥»?¯ÊÙö¿Úõ¸`¿U¾Á/Ö]HÀA7ähhM{£¢»äüÄ¢‰ö ¶”•ÐEé°í*0óW @š‚/I!ã³þ86•ÜÿÏÞ».Iv\‡zU»nÝs8/‘3t‰x ãDý3ôËOýÖ辌ÿð—Ÿ@ŒpØŠ8A…íDÙA") sé™îºúûÖÊܵ«ºz®=ì!°³{ï¼­\™¹vÖZ+ï6NÛ›!‡ÿ¥ÉmÂÀÔÚ¯6eŒB‹¶ÛjVäŸ4Ž‡¸ý/~èœ þ: ÀDs{Èl쥧þqé#3~Õ÷éM3¶þñ¨Ž'ÓÇGÓã/Žg×ï.æó'_|ñäþ÷¾÷½þ²ŸC¡ë)ð†Q ô(a«›Í'Ÿ|âZ€{L 4ÜSÃ.ÀéÀºÍA_gβҽ¢—ÏZ ¨ã™Žxܪ,ˆ±ë¸iÔ‰W{Ð*z!.FzüUþSè`ºÃ¦ÆìÛ‡¡/=Ô2šµÅ®r!*šA‡³,ÅU~Dºbg¯Ÿ qñÄmw@fä‡ ßTÕþSÖeÝFvÝàtų‡w'£oßiÉv8ïKõû¾‘æÖ­[ ‹ýÆÇ\¤°Þ\£-zà-¾Öuœ„´‡˜Qö|o p+ýCS­€Ë«MóµßOYý#ª?„}ûâÛÓÔt5´úwl<~LÃ"\ ´lµœŽi&2‡©œðܱà×ïCüØÌù7_²2øälu¶fIÇaɣϮt'¿ÞÙS §ÀÕSÀž¯ÓžÙo]³8¹‡-˜*\:ÚÇïŸ!hó ð@{ôÓ5Ý¿8·¬#ý¸Jíê®Xöý»üX¶na—Ì «¯.Ç®éÚÕýÜ9˜ÀƒUËìh@] o Ap=@™põ?Û¬Ö“Ñp5>=lÜõöÜY_à9àðÿ÷¿ÿýãßû½ÿtëÑ£Õ­{Oæßg…ÿÿLÏþ;Po:_/®AC°È¡OX ‚¨êN§âäÅòyâÃt&•ý(ÕîD=Ãéƒ 5eµ/NùÖÍÏTû&ñf¨M†”4qoù9¯”ÓîjœîÓ¯·sŽ˜“=úþÇÖ‡rd¤9·šÃ)žœ2 pÆ©ß¹qžÿH÷ã£ÙÑ¿Òëÿ¶sIøð¸ üg÷NNîÎf3éçý÷?^ïï)ðæSÀ³:VŒ®žXÔ[·&_2ˆÏÙÝÞ¨º^0À"A¸&|uÁœÿ™9¬í!@ExÙevW‘üËë‚9.^‚'½I”?9Û…™:ãã‘WE",âÝ}?n‡/(ȪðÝn*ÜFT#às˜ÚqlAEÑ-_ä×Á[ Pù/{ñN?S;ä?#! ¬‘2xµÒš©i/Tr$Ú;jä¹RmAë ·Aáš®'Çw7ßAû:ž®>fWÆŒk.ß~#éà“O°Úÿátî@ëÁm„Ð;ô[´6š`¬¢ÌáG÷ã…å'ñoßXh¨é  çl3„bfPÂô?ÝÔ/ºoNUñUû0”¡ûøª¿–ÏaºÝ0QáÐHCY‚VùI•(qÕ§w„Ó3िG\þóz,ø}ùèôô ‡ý8|¨ðvá,`oz ôx£(@ùçI_ƒÁÏ~öÏœU3fE°«‚›9»èì#òùu{å7gT¶Y~ñþìíá'‡‰Þ>£ò˜èxÄœ#€ «ö³ÙEbÞÉ&x•åÔ¼8ŸÎt¯òÞòÎ-–nMt‡XÁA­³Œ^*µSê…AÕ­?¦P \ÀÎt1D¦÷ßl¸™q³`GF3æÞ›mn¯ßõ¦N ‹8¢b|R:ƒ¢¿˜©)öíÃò2ÐùCÚMy¨…DXfÞ?–·<ÎÓá¦9B ´tGþ|üñDsD»ç6+OýDQåþ€gýäÎÑÑ÷’©·ýí¨÷õè)ð;C•îVsíÞ^ûÄi¬³zD8‡~ N8>|>Æ1†(ªâ_X ì%¦]è´¡G{T°Â¤>¦¨ª•5%çÈ·è4aóªö60\¯ïµS€R¶“k)½C­>šW·P;ªP‡ü«‹Cp:ÀxúNv¼èѪpïBã-ËÅúh5_Í%@ÚMÕÐJ&™Õë|¿‘#Ü‘ÜpD"‹ý6·¹?áö‚#€¹ˆ[ÿfAfyðÏŠ—W 1­þw; [C)P!P9H%@¢ã÷cuŸç¡(B1–ØX½6ä@ž(±5îeô©î·Þât1¡1ùðŠJ˜0¥}x§@wªß!…sÚ üÚY‡h¡ôãÇfp‡C*¸t4"ŽBƯ˜L<ï`´{qH3þbÒŒîS†“Çh¨4Î%‹ˆ,䶠©7=z üÎQ`>Ÿ-Ùé{Ö2œL–ëÉxö1§­¢ønMÇ‹ß›M¦ßDqƒÚŒ&#Í¡ÿØL`sQËZC!€ ©À³P Œ,YG.ÏNÞ惼­2”`mx¢Q÷(Ûí´lqfß«~!àQòHyoÈçR)K.j;V1 MGkE½íõ+äU}RØ»+ aj…k‚yäÓ¬µfsÅâúz³¸%§†œ´˜0EƒèãÄ›:oûB1à7R`˜¹9ÙlŽÙŸúÖz5¼Í-KÇ ¤¼óI¶ÃÕ\áŸÏ’¡”zù‡Blå‹üèñÝ‹îlx’©~Þjï’ÎO«Ř°m™”pû&5…‚ü0æ$E˜GX¤­i°Û8[c´È’´Â ÉÆ™ wø:ÀE@9åÐK>|ú„ÿæ Ô;ÀÏB Ãàç’¶Ñ*ÑüWÓÑô„ç3bîCˇoŸ>8}÷¿ü® ìMOž_  ÐÏYxŸ9}:Ÿ+¦÷®ý¿ô^ïqà³ùr}}¹þ=€ ;…X5‚ÚÇ’—¬IA8“ÿDg%W y.€q+`âäQØ–'÷ù—ŒHÜ9¬î°q:\^€°:Ͻ2}? î\ÂØ–ó|¢R~*ªŒ±Ó)ÿukuðcŠ´ôr:{ü˜%#® N\u½–£*gÐÒR“Œû—8Ùv±zá߬«£Çœ²6àc ˜ô)‚ÆèW7o¤ðÆ¡o¢>¹hžF†b¹Pø»µ4‡þm4P0tË ¾¿ÁÝçÕIuöÛ`·®º¯vöÐÇ0a˜(ý,DÁ¦®æ0æ힣áÔ?C™š30–«[ì\éMOž_ °8mƒðgýYÃi€ãùœ{½`§‰ß?¾ÂöCø1’~ÆnÍk¤ó« &mü°ÎáØ–=ôêØç 85v5I‡¤N ÓöŸÉÑ?pÏügÐdò¯Íxú˜þo8ô§¬ðýÙpôhxÖ<üÍ“©Îvôîž=~g)ÀÉ€Ëï~÷»¸’–i—ËÉdreY¿ΧOfLp«<9eÕ:ü$9È.I~#ÿé>ýÛyí0¡pG—-`%š#Á©+cÞ²¶ i7—BðyY#ó«yR‡;BÚð†Vú‡üÁ½¡ÔÂvGÀŠóXÜàý5ŒÕ2â1ºÉ%wºZÍ¿CêϦ£ñÿ>½yóÉ7è5Üظ¡CV‡”_¨˜Ï ü&)CŽ«}þùçÍb1› 'ë P®AlÎXNNa« Í Š¶WýVÁ6„w„Àøxv€.Ej{Ë°ú1»¯îî6“l"/†³¦¯¥‹2W¨lw6®òÇßx4ãö £2P‰Ä¢ŸÁl<ãä¿ ÃS£9«þ6=bÞ8âˆÐñ¿ÍͧÃõÙ“³ñèäÏÿ¯Ÿô 4íMO¯ Þÿý%[®Oìtq!Ðf6;þ?iÆë£élqÊà6ò‰†ÓÈQ _)ü'n$L ˜P±C!èdIŹlð(yV –7UȈIÏ.îaß+!mÒˆ—ñ »ˆÅ»Å­¦-Jk'T¥ ­Ylüæ`æÿ=••M’q+ ~ð¯6ãë( ße€óý¿äΕ;Óñø.¸Ù¡}Æd÷€SW·©y^¦ýÆ( &ãÐÆxÊ‚ÔÉrz4o|ººú?.™r~_% (áÑ‹¡q…æ…€ Šiw?Ó%lûýw‘]r6¼ƒ³ÍöPØnI¢Æ‚í>`ˆ†©Fî° óTEOuXÏßö„î5Ïc®ªxȸàCšçÉl¼z2ä¸Àë''ËÁ‡¶EÙ˶÷öè)ð;H„Ž¿iÍà_þå_<ÙóŒ¡çSxñéYsºXxm 3ƒÎ]»ÚßÞoå-2Zed9žpñæ*À:Ý ³k*GÙ·[˜Ñ\®ÃÊhª¾½÷2´òšP;¹ª®Âi‹,ª~W”•áå‚A¼jV×ÍÅë»Þ8AÓ˜0AEã^§yc€n%W–ãÉë7Qš¾Ã0ÑmÈs“ᎨHa¼‚~Ò0žèC3À#ýê{ýÕ6Ìxý]8Ã1àËáœâƒ*ŸßM-‘7Ñnqtak²H{Á«[Ý¥8,½añ žÀQ#ı-W`DãÆ2XcKç‡õ“#ÄÁËá?rpãb¨ç, mÀùߤG˜4«q3äŒjÖù šÕl:]1AµºÏÉa ±½é)ÐSà+H×0pÊ‚=:CÏçt@¹ <á ¡Þ)¢ 7Tù¥-G¾(Ïñ±ûåq@ŠD}êùà#]n““lã‹QÍä¯DÐ1­Ì®~¥N *Qµ¥<Õ“­Y2 ÁOäç›ì>,%˜; \(è"Aëq? Ø€Y™ßJÕü^oœÎÆ×O—ëÿbþC*·9´òˆ«”g\[çk/ýÁ½só â‡âî ZJ}>H=ÛfQ%Æ[ò*œ· ¶F‚miH»MÞ‚„£fçÜ°QͨcšT"õî«äï°Ñ’{¶7#Ý“6’›ƒ)õ54𨿓nÏðVo4ö;”àžêÓG,,½‡ð?åw½Ì&þ¾Wœý?Ü> f\`oàÚÑúŒÛ›Ícn_|ôG÷¾ÿûmºý î–¹÷õè)ð;OŽæÜ?Ϧo1úÌ9vã/Ç ¯üì9tpýÚj0]Ìáµ.„“;²˜Å¦¿•Ý°afWv#š3É4üQWz»î—ç<{º ‡ÛQ,V¾šÌµ»ë-÷×'Y=w@£²¡3ï%¨Á3~ë } IÖça²µý8ð$<qf`:`a´æÅ ±Pœæ(LN¸‚s~9d >LE–('¨s³¥3vmîÍ¬Ô ?ÇÑy Ž‹Rù·˜Õyú_Ò,èŠrÑÔføvŽH-zú6 ¿s,u±…º”M1d-`ñ1÷¹(ƒ $¥ì#4Ø°ý"h¶â«vExmì»ú¬­Zf›¥Vo[VeqÀ;‡î?¾MüцŒðãô¶À<Àƒñʔ˚ŧ\ºØpÀå`ýpþ%ùzÓS §ÀW™lS‹ôEÙ0\p#ˆu¶óÜùOŠK­b‘¥ï¤”W«•¯m\…ñ9Râ‹ ªSÙaµÓêƒvŽ„x«bõÙ&%g׎8Ÿ£pŽN~øÃF¶¹_¾ëQ>úè£áßüÍßpüïxôë/ÎF§§kFz²¯„â‹T­J?ÿAÀ­®q¶÷ •¯$Lu?él¯ÕŠŠ§>Ãî¦ï zFªÃÑQôòB|¯R-{î˜P`)v ÏùÒ¬“HÑÈ ð@ŽøQ6š?äɘÓÿ¸ö—ôü ÊQ  GŽFgOþ;ªzÓS §ÀWÜð¹úÿ>ýôK.]{ c]__ÿÓr>¿ÉÀ­Édügãñôá.76LN&gq&€ )®¸M;☠á;ò˜H( ég 1Ø™¯®©L0EqxM£© Å›{ïL®K8l ¢Š¯¥W%à€9Xà‚¯&N"‹êl¬#"*Gã½m€Vÿ³‘ÅlT´­˜æ]2ñ²`Vn¼Z,ß:9¹ÿ{§F,x_Ÿ¾óÎ;Ÿ(Ù¥½I Ààã?nØþ0B±EY…¦)Am~ÜúÄ÷6ª„‡ÿRÉ“È¢-”ñºò8Xì¨1åGcê臨O~g凵ÅPËv$JÒUˆÐÒAäÔ'Fñ0ñlzJ(GrµÕ?»0¸7=z | (°>~|Æþ3‡þ9tð9‹Áh½ÿÑïÓ/‹ÝvÂòŽc~ìÎÃcâA¨9$Þø€ÀÎNâ€{VFö2ikšÀÁËìá³T/: Ú²)ðŠB? •N+šUÞŽ8@zÒéïÚ¤ƒ¬ÃJÔ1²#xñø{ßû^â{ïÒ‡|9<'j‡;G‹ÉàÚ`:>¹–Ä©ìÖHôú´]‡‘£ìŒ‡°P ÚÔKµ;‰žåôcûhöí =øŽ¢ŠÛLt_øˆ¥â?ˆñ@ ð&‰¢uµå•:ÛÈÍ5휫Îù:ÌþPùAK&¥n–4Ìåæl³¦WE?[ÔS §ÀWˆŒÀº }ÃbÀ5‚çjÉs/àt@–Cs§xt’iŸñ¥QŒîüɈñÿÜS¢´‚-²#²¾’m¹™éðÕ€.X×ý´ø ÷²v­—´Ð@‡Ö®î iË)su Ûé,;þ"¤ÂFp+ë˜ì'žÉÄ3â8à‚¸"»|ûøþ÷¿?¾Ù ¿µ˜ ¯Ï«w¹ªþ6þp0«ý½ôMÓ•þ±ª:(D]2±`弄‹í†U‹*šÄfØ*†_‚ò´dU$f&”ð½E6¢C¦îø{1k×˵mA¡Z=èš~욯êqk,íž µ‘p‹cÀ=Y§CübpŸYØY£“Z·°>QîGq§3?ä·HxOó,¤YÆÜ2=ž ¦×Ä»šÍîÎÆÓOù¡ß^? ~Ô­)¸zÓS §ÀW‘?øÁÖ|ðÁcÏa¡~ë·ÞzëW¦cn©»Í®¡?cM'Â-¹‡…k£óbOß;GdWò£‰| >§Z°€)Š‰Ç£„ “Êq£o'ã2¡L]¸`¦ÇÍË]Á3#…ü¬Dë&æê³ [‰_ ,Aáíºk|7y Ó>K˜àŽ~T,Þz„£Ê¥³XB™¥4ZqëªW®sÐ Û¹ ˆíØÒiÁRëåj;Ûè„qÛà¨O9¸Y¬Ÿ³à¢ÒÕì_Ù~c´Îáz4œ›#ÚÄ{Õ' ŽþS@‡æ„­¨¬Oý>úuW¿Iwê\éƒiÊM7e†<-¸Qéëgê®­a™Ûi„37‡Ä¶¹n]-nã#ý’6ºë¢}p„ð§æQ©•‹uü¡¹ú?Gìõǃ6á>_PÄ5$g5Ðf<üøtuûö ×ͽw÷è)ðU¡ @H0zžÞüé@—Í’ Avö± ®5Bø߀a(C°'W Aï®,/ŽùQeN„ø/m9KÞ­müa–s8Tøç1‘ñ€O‹;œäESØ÷³Zaã¬ÃÿöüsÁ #Ruõ÷ëõ ±ÇþË5³±³ÍêpŸºUežôÛˆ~åî³Éb¾˜1=…41 Ñ5I –’”ÖP¬l2Â%TíxJºË²ü,õ¹,œ]<µbÏ ëÆŸsKòPVˆ.ÌÉùí|Öó }4^6ÓÉ‚Ëa“ªÎžÃÜôè)ðÕ£#–ìÊnîܹC‡•}ÃÁ)Cѧع”ÅÁ§ÕyBpð™àÖ„ÐN’®-“Lþ’¡UäÔ´ÕÞâÙuuy딯¨}Ûà WãjXIrÐÚ/†þ§…E¯Ð‚°£Ãe cY€ì¸7B,¾~¾BQ¼*ldÀcÍ怱9>¦ü[0oÌÀhô‡t@O¸™fxmy¶¹¶^7Sˆ£@ìLHõ»ª5ùàeŸ:J$4­q’8?D¦û-Ðr7‹(/L´•NlŒÿ~\ L¥š-*à á®›&SÝ’DDíÑ°s…®ÂÞ­îýçä.VŸŽéýsö¤tc`3ŸNg§L-œM&ë%ë2Ú¬zGOž_ œœœ¬oܸÁvàæáh4ƒ{Œ~9¯ÿ•Qí„3Zýß3•8uÅ{õ >7 ÅÀøL<ÌiGPeæÁ³*oîrçÊƯ„ʲʮ©~+¶oZÅÇÈó€™ÄúúÂ+8²»”SDÄšÁðGÿŸ©‚Õˆ€1ûÆбq‡Öë6oŒpo|¯¹=_£a°ï´áP©5Ã!m›bH·JÌ–*@CÜF!:ÜÚ•è:4ÕNßk{“MÍÉ^Û‰aÝv”s[¥݈½‚U\Oi~ÍKØTF-Z&¤kPñÔCnøäÈß<üg<s p>h¡jõóõ|y¶OøñO—öçÿï}‘ÞÛSà«OÏ>ûlÍZ{ÿ÷×\ 0™Œ~Á õÛ)þù|¹ü‡Üý'î ™z9KŒjËá‚  áïTALƒc;%éܹÊ@( „ɯukkäXéÆoÜú•ò´ÝrÓ9ÝPW«fv†ýúÖ[»<Âõ€Ð#F`šO~ýÉ+çyÈ÷[fxž‚¼@èŒë†a&œ8—Wµ ¢ƒÄ¦±}’àAôÌï´s¿2ú•åûáV2oEàʫ¤M¯•f¨àg¤:Nx©NL(ØÊa¦é„9,ÞyÚô‘VÒø í £ð']_×ÝÅå6˜úd9ƒO\Y/ô2Êå‰üñ”:ˆOøãjÞaÚ”¨Cý©œ« {ÙÆY>NíBi+üÑ&ü2'3.âæ  §{¢ ŒQXÝËÑߤã9áYo>úT½é)ÐSàkE·¾÷Þ{s€GŸ~úé#ú'ÜSBgá1kˆÎ88l“k‡à°]¹Ý.!c‹ OáßÈ£àÛvR²£¿’EóÒV¨‡m,:R/JeðÈýœO÷OLñovú:vÛ·Mæ³o ªýàñN”‚œ<†‡€¯6ÐvË\YI/?.EÒVpË ‹§PeÆð?ûÿ†Ó{÷îM”ßýîw–èÒˆ¯Ì  >ÿüóæÚµkÍ|>q?Ú[ ®qÍ5h5åÙN—w>R6—l6¾~ØjïøÖ!†Ë¨å@p‡©õ)výº[»¶À´ií_-˜? MÚjÊ k fdsËQÆ©#yù—{0ÎÄ:ËõZð#ÜX€ºàä…Q>ª¥$qoz ôøºPíE`+xórÈæuf¦¹‹µY²<݇CàGôGü!Ì%LeYA¤Ê¥;á••ø°`ò»vñFx+a]üº5ÕNßË¿÷²:”ýaä&¬Ïyˆˆ©/„½+ÜUiˆAÞPHçÐvè7=v\Ì`Û^0R6z€ð¯ÃÐÕ¼R3¼uëlt|Ì ·Ò.6“;\[÷-ÄÓ;¨7¨r+楬­ ~ùjo!ö]6ЋÍ^Üž÷ât¯cV~ÖšeµÏcÞÆT×¾½Ÿ&šKm3Ôß¹.ØÉÇÞ>¸vš‘Vš ÙÞ³ù Š§PÏΖëÉr4ºWU•}Ô½¿§@O¯àž8_7KÎhö8\ÐtU~TÉ’aÀE\eDÆVHl;$úµ‹3lÁÞPSK_‹·ï¯áÚVµ>¹“-”‡7ÃÛŽðƸöõÍætrsÉÉ8÷î½–áËx¥ ÀOúÓñ;p(g u|“!‘¿¤1ü)ú·>š2Ñ4ñÚD‰Ô5Ês ÿ4¹0|nkº¨ÉëÒL)cà» ‘5e±w.ˆþC †ùXº(¡‹4Œ­åêZiÑM‰viÃr%?®èíÓí×3Ð2;:bî_…søoëõêA£ÿGÒŸ2òÿ<|¸<¹ÿ.W‚Žï¼¿ÐÌ«÷è)ðµ£|ys4=¡7ð`2hfÍ¢¹9ãŒú^À[–ûãòaH¿©ÃáÑá€çÄÁcD:UÛŸ±e¿Á­ìëŠáIÒ?«—[x5ª‡ Ï™Àeh ?}0€ oùiW4º‰ G[¸:Å.…ˆ`ó(R?éã?~NDöqï*ØÍðˆ×ï{SŸ°î7×®ÿ7nÅm˜‹±ŒÎí^º"p¥ ÀýÑ`ðóŸšÙÌc¦GcNÿ³×%àVi¨W‡>.úPRæwÕØ8J;Š*è¿ÐdK*.¬g´s1çJ‚M52p$ †ÿñçËÕú.ë|57‹Ï?|Æ”Œ—¬9 ÌĽé)ÐSàkN†g½šu¹àÜ_vp¯bO~bG¤2&‰”î`3ÕW¢k˜PɈ †›1RnSma™.’®[Øš¾º¥Õ°šg7¯vnA}ºfןðbͱº!,äTÜæ±Èé,1\ÛÅpyî+Uö«Á¦€œaÁ^N—0ÏÏb÷ý_Ý.Ϋa[,†Ø¦ì »°2^Æë® f7¼ûuv?Ì.Þ­ïb×EéMQó¬åèú÷1F=Lu,5yŽ#ÜÚ¬úÏQ+\‰Ç¤CØ>©ÓÀBø» y&ƒ½!x±Z-ÎælðÍŽ–Ì7­nݺµþä“OžVpö¦§@O¯:þüôtóñ˜;j<#„ÕŬ˜#’‚•ÆxPôî!„³ŠuÁ_.sVApYsò¨˜uFîãqt×;I¼ïEŽæª®œHŽeh`ùO\)ñ–´j¼¾®{輧ËäÚ< ؾ¿MåMŸ¸iõ©åÏß‘ÚµsH4+l›TFËWqÄ£ÿÀ_ ¬LËT…/oÃE€¯†WƾÚÄ{îàœ#û8 ðD:´‡¦‹ë\2ÊЉ×Écݺ¦wƒ^ÌmÏ·qxr²‡ýÅP= úJ†6†×®Ýä„ÁøäätÌ\tT”ö†ätC!|“º°VÄ¡•8t'Ô¾šM ¥_$uEâ ¬Ÿv ]\v˜5Â8Ê ÅÝI´Å[ÂÛüÅ8vÐÐÀºêîPÿ4…1<þó„†]Üî¿“Å•14 x Q»×JXâhRs–ï~Ê“ÿ+sL÷ þ„ðËŠ–Ü{«§@Ož|ðÁú—¿üå#z£Ÿ?™Ï׋¦¹Ãa”?s¨ØdÂöLÀ¯=PÌá|v &ŒàÎe\2­'2¶è¡7›‘ÓsW°+y¦¼ÍJ³„ üÊ‹ŽÂã /ÌC̨ˆo_¤}1O –M0Ö)¼£ ÅŸ¡ù6< œþ.ˆ¸|Û¾ÀYñfŠ@-ë ?Ž“=  |S5$WÅo6SŸ!—1x@I~©VTÿR1¾ ²³³9‡-Øå—E’=‹lÛïÔ>%iÞ©V ܳ۴]<Ž“¾zL¯ÙÃsοi"]A l7£h`¼Êo(Q2ºDÐ)ßPÑŸcÿzx4ñºÏÞôè)ÐSà<¬my÷.cÑ‹9wÓqMÝ‚ŽSžÛæS‰Ñ }á'³Ù=w$y“aÑ©n˲ ß" ù'vž•a‘6€ ¸„§”#F(:e"Ô¸mñÚ2·y[NͶ2z:‘û&EjÆ©´Ô0ýÕ½Ž‡Óëשvd`䥛+°6³ÙÙ?X± ÝùçX ­èùë/q‡i²Uá%Ê›vh¿k â÷Ú¢ÈØîwûÈ1î IDATÍÝw‰ß <¦Æ;¡Ó€BÖÅ‚‘µ ­vl¡4Ö‰ßWùq`ã¶ÝÅCãI;ßäJH+•c.È1ïúÃW(û!÷'ǃ‡ï-Yù¿Dù¼¾~ÿýÏ,h§½³§@O¯3P6üñzÈÅ@îQ§WÎa@CGo@ÖýmŽá.€säŸ#¯áç•ã°( ŸÜ%çÍ]·œK”–óhkp'¤©4£¡0±Xëd¸€%±ÞÈ%ÏxE™t²`?ªŽ3:U5H†ŒÑ+/Ö!¿µÄ±wŽøFD¨ÔÀ) NërQ2 0zøäÉt¹XLÙ‚9úó?ÿs/Ý\©ðàÁ÷œsí$ò~Þ<æê)•€ÍÊ€+Æ®%tÜ«,Qyrh¥õ0ÜD ŠRH:œ"=cø»Ó¥Ôó¿Q5¦mML˜. Ü6i›lëèàÚæ7îh ùs(Ÿvh#Ù€28K`s‰&zGûÇjÞŒ½Ú—ÕµcnáhÜ «q]‘Ë^C.b8 ’ÅœþLÍ}Ù &ëÑýÕ|ôp:={<2 ð̸-ð‚Jt+Ô»{ ôøºPàÆ«këõâÓ»wOòÿr¹^ÿ låsê›ç=Ým§8=û_6'¿–_±z-x¯S±ðX^‹ªÀ(CÝ<®u3Að`_2Ÿâ%\,˜`†ñ ¯‹+“Êi‚Wê‚—0‚W[÷u$ o Û‹Jà(W–Õø@…Cž,¿U¹ˆÑ…’±‰>æñÈ$Ÿ Ky–™‹…˸,h¥r)dz›(†·6ãXïg?ûY!FñÒ^Wªüä'?YýÅ_üÅãG°}}²A€ŒLC\w„/•ÄU>Æþ“¢:÷Í™5Úù""“Mž€'UÖî%¤ù©¶— ˆGý ›h7Fƒë4F\̬Ó2 «sRÐ=gUL:Á¢ÑX”â®ùgD}SÏÎ"•ÿ4^®áïDøÁ&¿Åù¸Ù‰;â°(7T.€E)Ÿ?L/ïàý©á0æ>wÞc'ÀÃǧ«“?üÃ÷Ÿ˜u$—Þôè)ÐS`Kÿ÷_3½Dø?Y-—_ÀKþOx!ÇÖnþ–ô ým{²/ù•^A/su'@}üN8u¼Ð¸ÂÍN§‘÷*‚gPû»6NŽX MÕqP¸À‹­iÁ)[ˤ‰³¬ú¦ºµM0`c‡tÕÃ&¸qK£1Ô^S…½;®¶D:"OáíB'¾,„òÊm“±YÖ\ˆ·x‹Î1‘«ß_ÿê)~øáæïÿþï\x@{J1§U wgFáù¥Ò¶Í„K»<Ò½ë–Z~gá¤i·-Õv‘f@¦ o!w²LâiÓù|mþ{Ⱥøͪ›¢9ÂxÕzJ^ÕŸJ€T¸6^Ó§“pˆNôr$€4S/ó~ËôéMOž‡)ðÍo~sóå—_n=zÄ>­áš›]74ÅͶÀØ6ü%!ò(þo±-PÆ#Ó‹ ^„gáGmÚm÷î%dg÷í3<,pa:Lö‚4‰X¤f€Uœ‚og[z" ^ÁÚaüHГ9;ZòÙä±zõ|×Þš†;Š$ÃÓEŽùG7–dš<€KÚ†Ÿ}ö™Å¸ts¥#ÔfÈô«J]×>–DÛêôQ[´/Œ kÃôÀÐ0-Äó¨fI¥7C3†Ñ&HÃP8‹ Äá7–´šÄê›0`7\ƒ«þxû²‘æé… ˜Lׂí8Äas×$¾tón“Ù°ª¿ lÁ¢”h:ÖZãÂP'Ù¢ ሹ3~Eõ6.WÞŠ™é¡-p÷tÁo§>µnâGêç °,g‹Åâ”6?==UêMOž=ÎQ±áNú%JÀ©<ðääÄÑÂSvjMa8ž ȹmò]GbetŒR~)³’GÁ ÇËÉ€ÛŽYÞåbvÚ~l,úi½µ±#+†Úõ%ïK×ö-—e¾¸å¶”uù4W—=—$Zm‡wÕÖ ”@^ËœYéAˆít´UŠª;ü/]ðH—ñ$ÏMp4ÖÝN‰°Î?â•o©`È¿¡Y\y¯([Ž!3£æ[ß⎼×`®\¸yó¦WŽÏÎÖn´Å´Ê—ԿеÃçŠ GÂÒÆiÚÊç'SÙHzL@®ò¥µüPìh>L$ÅØ8ó£`ø6®€œ³¶Mq7*ÚH'È:=ÍDCVÁ±5a¬<¸£‘. b8Éa'=”ÏU2âq©aædƒÌAƒ_ W zþ ÿå;wzjõ¦§@OÃxÿý÷ã V¦X´=;µóÏ™ÂK88î €Û:- ÷±ãç‘G{ʪüxÌ©£ã5ç–ÊÏyÆlT°ck°äsòí蟔2ÀÿÁ#K>¶_:¹¼ µ5t˜Bfç­›ºÃË“1fúnNÑ©*p2P¿°¤ÀI|©´à&NެرŽNÄ%lÐd¡¯R€°âÔÕàÙ ‚¾* * fãcf‚ÀÏ°¹{÷nÄ{™æJO7z››ŽhPÔ—å ž$öjh˜=`%•¢.zµÚú‹ðWv+µùv4¬ö…o‹¸ÈÕø†LŸÇ·Õ 'v-C~ Ò}èm´¢÷`Ù†(¸eš‰[´¢f}qIÔ0[b<ý/Êj…ÃH!üÆœiüµ1-7ôП%£.«Ìéá^Aûšooz ôè)°K™3!›ú§Z9mèÉ€ðêg‰°ž(¤|(;"p™àÑœfËá Án‡%;-Áš‚i9Bév°*™,O0$ ….&€C X$ˆ<äs‘³¸÷L(âNd +Iš,mC LĺcX‹ëú+m“†\±:¸­¯ë*]âDDF }ã9ðF»¸Câl¹t5üë1Wª ï£þ‚¡ŽkÐkŽíè @‚úDÖ  ãá/c3ÆáH Gá‡à6 Q,‡n…á¹ß!² ‚«"¯Hë""F¨&Û" 0} s¼(.–ßý Ù¦¥¦xVó[çªðDÃa¢¤þ˜¬cj]‡ ñ–‚°#À5Àa3Å:ãqÈÿxÏýó¬îÝ»—•:X¢>°§@Ož[ 0°fðó€š9}¶%6g× zaØ `[ŒC¬rnžp†î)èO‡ó¬¾-ÆQ™QËee‚a´•]¿¨] §§m\ìk¡‹ïPBŒW¨ì›ÂŒw@ ™º”$˜q¸³ü¬Ño±xo ⡚ɫñÇÎ{üÔÁÑœ¶M;M"A)q§vYÍ!£#ŒŠoÐ#†ÃwÞi³¼TǶ&—ŠöùݺõÓf¹¼Åb’Õl¸œÏUÈ­ª2ŒT>„sL…»M šM‚|«þd¥mÂԱgB qÒ-SšîgoU–ÊC8¡$dy$¶ü™¾”*ÜæÒFÖtdÒ6°n†5^»‹°º;ñª{ilÐ* "²1¦‰¡Ù17sóc?AÕ¸õ 6u¶ÞÑÙW!X¯h‡¿œŒ&Ÿpåï]ÐýìôáÃ/8yé·þ­Ü‰‘yöïž=z \L¦ 7oß^,ÇË{œüÇmcƒãád‘søÍ`Ú0´+²ó´†OMÇ^궜rwГåÎÿ¯ííOàn®ØÁÄn¤°ÍÕéû`ò²à€áÖ_M匰ivÄÀ?µ ŠÀ€¼2MaËxÂ/lqWv܆bdІ#‘”æP3Ã;¢ž‘V¹Ž]„Ï&ãÁÑ„iñ„!k:^ðìÜ™åÔ‰rKµÉuv×8 ŸTCæÿ›ÙjÓÌÈhüÅb¾|s¥ À`ðG4ŠŸ£ Íør¶ dQ4èHÓÃLóG ³žvj\48¾|Dß„Ù'OØpÏV´›öü6À„ª’ܵ,¤&{ÈPˆ(ñÑm’‹âÉ0£þ–Ý7ÊOŒ€ ècXM¸x(—‹#‘0æΣvä/Q7ÿ3”°9ì é˜Ã­\üÇÊÒ;1ìMOž=žJÖl¼&¼y Óä°x‰#ð1oœKžäŒÆÑ9v¸v!é-;go˜;I‚1­ˆsô@&¤â ñOð3C@·¸õ‡%‚!Üä{¤àŒ å àKàÃï.+·¬Õèîx38(oôú3¶v-C(Bð^i Lj§¬Ô“´Dø§ßô'/?—›xÂÔ?‘¶¹©uíåÐf&4V7>‚2<"÷^m›Ý >/Ô”;s±aåÃÆâÐR4"lë™ ÈòÛìø‹ )mÙ”ŸÿØûÍΈ;dÎ*ÔƒëwÞygíQŸ½é)ÐS §À3)ð#úïpJËŒáEa2Kä9§üÁ¨f²žXð§pƒÇ&ßb4À…\„Ä8¶Æ9ôjê¡lÉ}Ë¡µdä ßµƒo\ù·ìºB¥`â‹°Ý4º+‚ÀÃ+l‚“Ê ¹Âžþˆ!0N%,‘¹6 ~M"ià(­ôð BZïä×®¼ŠüÛŒ¥VhÖKfWÆ< 0jP‹’—ô¾Rà‹/&ÍÛoÏ–Ëõ148Z¬A2CH‚'ù©·UOJéÀiÂÀ¨^koóˆ™n5Lšclä!‰ÞnY ´5HíC”)kò¶1Õ¯³¼õìaÙF<‹ ­GdÜinR"ñ¨®$9&ÂÔ Mèv“0áåÓrŒã!*=:4“^܃Ñðôì¿þ׸‘c0øÞ÷¾·ýfêþÝS §@OsøÑàGƒ÷®¿'¿ˆÅZLyž2zíÜl˜àE¥×5dø¿aØ[žæÈøDžÄHæŠgI@l …@% ôý]P˜¨«b“dplþ‚;ª„;kP¾$Š°—ñô”WòÎ `>iR¼Uk9†ÃI¸Œ•õ†MÂáØÑX|¸“OË›©;»Ü™~µè3žNbtÀ…1j`¦<FÀSÖD-BYO6«³Žm¿s¥ Àw¾Ó =š« QIš ›û×+»óÔ7¾¬¤Ýš ¯N"Øž¿Ûë ÂuÀ›_Dµ„#=kD>ÑiÞfcêò!ÍŸ0…  ƒ¯„>õäY“hR&ÉiØ’Ú¤õJ ZíÒÆCOQ4Ël °cDDgú¡Ãýñ <§Ôa~ú8nóê¿$îMOžÏE>ø`s÷§w×'ÍÉŽ¸`•š‹à6!ƒÿ‚íØÓõîxdçðQåYíœyŠk5U°"Ï­ýáÄ..ù™\QClÈEÅGD=ç+¸£<´À[Ö<8ñïÔrÄ#U\É2*ˆtvHe¹ÈõàÓu €S*± ø8˜”‡›Pw¥‡Ua$„FÃ=Ï…€\”Ç!L_º¹Rà‹/šáÍ›q^Ê#ËCBÊJt?±Oý°ÎóH]V¬€,yÓmÛ°çÐU™¤ Å€±„sm#ˆ ¼ÆÈH[óÉàxG>é7öµP¿“]›g8ÌÑß–Sm¸­7ÊA4P}¢ñæÜhžžŸã'ÐNe" ÄF6-t¬ÍU·ŽÌúWOž=ž‹_ ¾Ì3ä¿·NŽÊ·Oå•Ä¾©ÏQ[Wÿ;R`DT&?ƒ /®#˜ò:øW0ïŠÅô©¸dN©q¤ æ—!ÏÿŽb‡¶¦ a2΀ú¶¸–'J`M&ªåÀ-UFQR‚rt–(ê‡Ú“|Û^?‘9ŠÝ±_Í0±WÅ©Ry{y®+UŽŽ&‹É1k÷o¬ÖókÍð”¡X X·Ö¸mçxÊ3q2;>Ĕգ¡"p ”B’QÚŠ À퉀|‹¥eÀ.¹À˜7ßβöyc^šÑ‡`ΧzfˆmåB C£´î±’?‡ù-µ‚Ì39šÅ’ Œõ¨ùƒ¢Í š¹2+ t²n(Ü è÷d<ž<æw{ºš¬ð…¥ê#z ôè)ðÃÿù?¿½iF«Kùȧ³r+G['x#—\ËÖÝ°Ú]>}´ ð¥áÑaN˜5¼ûl2§Óæ¤/|8¦p¿¤SkÜ0½…1›— <ìŒ9ü&¯ÊY ¤7Ì…â5.€Ö³Åj¹ç[Q®ØÔOI¬(Lmj¢Ôi|ôϘ ™¹òÞí(€nmÕw¨N„R¤ìâQ9`â¶Y¬VÜn3€À¦ÊßêòÍ•*ÍC͵\hG%i=ÞþãG—ª1º5æèz„ŸB‘a%zü®Üâ;Z9•MÎdš)D¬<Û™ÍbX~@Ú.I»0‘e¼J;)yþ*.s¬Ÿ†Ä«ðç¼MjÌ(8H­ÐmÚâŠû¸¢%*ü³ÌÔ:9ç&  TaÅ.Ëoóçf¢Þôè)ÐSày)ðÃÁ7¾ñ?±Ãú:SøK©O„%Çf+˜QÛ³•Ÿ‘=jù"œG>+âø@Âè´Áӣ׬$I,,ÌQX3×€·™°¬Øû¯WSvúÚwòû Ô…£<‘GÁgù¶©J^Pe†Š@£.p¡¬è& êë¨+î\¬m˜nOüKÞí΀8[>‡LŒò‚PÓ®í:øŠaWªÄe’‹ Ô@F5òC9Tä£I[}©|D4Ç×V1Î=”^‰k‹Œ]Žrû1jšH‘7…j‚Ú3,a—è„·ÄAû¶~±*â^øž(V¢>Üê®ðöÁXŽÈßòÄïÀÂIa&ÐF)^:-|ÿhÐL_!õ©&¿ZÕ„ ÛÿèMOž=^œ‹EöÚWܵ"ïñ/º#ò'-€PŒÍàd|02… g»8Rë!%Úòb±hkB°†'±›ÏÖ’»›‹ æ¼ÙU,L…‘êÎL+¿Ïø(P$(倵…'S>Ù±vD‡‚“õDªüÄ‘í¡©¹“KY%H=Zå‚0ÿDNús¨DÝmA.Ùqµ À^e$d<†û1Ë9")©àŽæÚZP7ˆ(Ñü€¡9AWå~Ü’IÁ¥Ï¶W ;YS¸<qU“¹‚ð5óÑÄÁº”2Øhl0z«­[èúdB}fÓ,ɩ׈£+FŒºØóЬïÅ:í_=z ôx) xõLFþd¯&“¸)õàÅ2Z¸|Û+€£ƒB'eÄÖ-ú$¤s8ÝQËä[ŽØU–&§e ¸@^x|)æ–±Å:‚³F׸V+ Ïìž ‹w/­åÛ"©et›µ÷X/M+”GshSG¬¬#(.IŠaÒÇôHðqÒ;I¢:ኖÇQ•˜ÍÕÝfbŽ—k®\ÈYþ\ºV«& 4ÕÖ-Á\‰ÄòËH5)çü ØÈìþÁxÙ„ <Ñ2]ý˜®ùu‘…ÊG5‘*úø¨D]†&ÊXËP3êØm¹(y,ñE¶4ü鎤›' D ¶x6†*aL£ŠÉ6\ìCkëÁ½N¦½³§@Ož/K‹ÒòhŸ`FÑãMñâp¿{ä«kFl££ëî”%çÆп¬7ù-l\îÝòcøXåu–³íÁ!b4¸_òÄCõ0:øÿ~d)ÓVŒ'€U¨¢ QGx†É{• ZÁ¬3k#¢îêC>^$ŸŽ-€È&G><ÙµA+òMá_lómMŸ9¼Þ÷•+¥Iºne%m!¯óÙR\Û° Ãà…/霈Á×0-îhYÆuŒ#L} Ð]Là«ž.L {{wO ÖÕ©‹ámœu±ŽÚݧ[öŽ»¢¯U®þÞî)ÐS §À«P€Ù }¯ˆvNìŒèWáP†—°ÊÆ2F8D üNNÖéÖaQ¾êÓÖ<ËN¨í[~XÓìºQFÈÊA·©ŒH_°ÒmEL‚!Â=ëI}Ú„:¬}La™‹îšN}]BdÐàÁƒ-Æt)Ö•* 4›'g.i?F•;â¡©8'PßÌ!š‹àÔŽÔ˜¸"zLÐÐíl4(CÊå8@º§TÁзWß8PMQ‚ô䢱gŸà®ÚÆòÁ´4ÀÅ(@ú^ù½mû¨JŽQHâBéÑC£ ¥7Úçz052O¥ÊŸ!nC)áAŸROÚèåvJ/–hšë¯gA)y÷¦§@O¯b¤2Ë›`•°ªè¬CÙ—F¥À €œ„é’Ÿfœ8y™l6 pˆJ¾Ÿ“²»H”Ï¥)YàKõ%¾ v Èc °rPR×GhÅÑIPYþLE-È,ov>-‡©•-âu½Ö?éJ1ø¡]Žˆ¦æ‰ òmÒ±Nq8Z­6“ÿøÇ“‡nþò/ÿÒýÞ—b®Ths¨ôŒK6l,mÖÓá`ÌVŸ´QpËÝ¡Ï_ÞŠ—#ÏÄŒ°ƒp±;`ñ6¨Íø Âåm”1 pžN£‡±ú}kc O…ß~ jƒ\åBûeŒXÇÄUG³QàÇ­S¦`ÈÉa'á›!º’Êaœ6 Ϊ,Ù4LÿGìØqêɽ6½é)ÐS §À%P ÅX¾ƒɇdY¾dåšÐÒÑ° …-ÿ®0>Yð–5%¿-1ÒWpÀñ«{‡_Ä”ÍÇŒÃT[OMv…bo¤«/„vt´Š¿ÈŽôeJß>µ” E¿1¹V;æ/ F9kÍ¢ÀÌp«Íz1šN§#FÆï¾û®ÎááZxœ/o®T@{¤¿DÛEµûQë¬Y·ž†ÔǺ»r ÆŸá&,¦ N¡:n *­c K'? FJû‰´E~#.0|ä’2lGõ_â©ÁÏN+ŸÆƒ¶¢œºýT6+æȈ6»8  ®uÈQ‚¢G£„ôbSçqë`þ°ú!)Ó›ž=^‘2—úTT]–[¢eß‚)/åH!7Cðëæ1mzûÆ”ÕÔÌÕ6¾ Wá…'\MYSÉQGÆ2áwDô@+zj¢âH\Ék –’¨ú„¨OF%´²$‘mm89]6„?7gÓÑt|zvÚ  ¹ŒÉ]…¦“ÍK8¯Tè–WQ§©ô®v†vÞFt"•s6¦ªqú ÌE$Ó!r‹1Óñ™u<Å$Ú„©ÂÿpŠÃ¡OA}0ʆe*ø°<8Ã&Í’òÆŸåVy©å/à‘ö=z ôxÿTù—ÞÚ“MU¾ñ…mu ·Ï—SHl‡ßÅ°}ɳBt±„;xd ªíð™p?UAVÁŸÓ®©*FínXáØ;Ø Óh[Šð§2ä°È ‚¾É3[ V7ØrÉîÁTQ»4óÆ(Ño…Ûo•<‰ä)žŠ¥ÒZ;€Û\Ò—JEÆwÞDFü6ñ…€¹x³bëàxa'c–¿œ¸Š/ë“? ‡ôqEÙ2¦›·°™9?vMÆ¢ˆË(à רOÐS §À׌…Ól9W᥅ Í«È¿PSHÈ‚,*3¬ò½j PãøÜ«‹é\$«q]Ø;5¾! YÖzè>_‚š@{뮾¨ÿG9Â}TxþÑðˆ<VK3Wª¬¹x5Î!ì)BûL¥Ðåe ›¡€Ó‡KŠ¢ùmX8Þçq7‹!‡ÌûkÃ¥w¼«Pcl4&Éë[4uÝi ݵhSd‚oL˜Ø:PÜžŽ³D+Zñ‡‚ùÖ1¤Ë÷OÇÂzðÎã7×P¤“ŸÏî@-‹ýIëxŠt+¡34K(Ïp5õ”/Ó[=z ¼>ûì³Átú :ç+Êå­ò6yRüyföúcÍ‹’eož;ºàá Áèõ;F —vÀŽŸ¶&FÂ…ØäÛd#šÈ±c¹XÂá²J×7kkÖuQ_†”·á$Q9’Z’쀥àŽ ¸È@›¦úxc`@ü>V©à^süš—Ô¹ú?ä› ·ÁàȉxR≯-d¨uÓ¨¬–«Ñéééè&·ç]¦¹R`>›-›Õê1´z°^5ÇóñÀ¾/ËÜ\8D¤Ðg ×I@(/Èájûñ„Û¸†»¼TB2†Ü˶„,‰fD˜ÄnMqF AšÛ!§JúDcºÚ°tWT¦r7B¦æ@énל÷3×6½K„xÙ#‚COÝ0âNmËá?¼FÜ”¦ƒÐ_¼ƒlšº IDATM›“„Ë“6(±`PÅ`µd#åÛ)O)â|¹ºu¾0;è==z ôØ¥À‡~¸ùå/¹žLÆ‹år989¥çµÛlùQb› ³­§ösѳ›Ã„0NLhsÔ-]6Ï“A«ð*œI·Þ0òC¥&f0E=à(ÓÁ%…(ÆDé ¯T6À°â4¶€èÜ5ˆäý ®ÕÚÝViò"ÜÄuÀ:ÁïUíÍ2y?ÍÐ:Ç°-éGòmÿ­cí¼âOv?g¶eÿk6G·nÞ{ｑt|ô‘Ù[‹W6Wª, âq7Ýæ”®é™%s×xS¨¦ž¨¾¸€ ¬ö³Üø%÷œ)ƸˆvS³ÌsÇ7Ü(ðµ­)ƒ|W ¦ê@Dn]À”/Vq×t"pÞ¦E´E½uEÍ¿¤o# "ì|ÑÐ ÕhíšáŒ‘!lzûœ}`Ocï?Fõ¸ý”lŒë­"ùRfÜ6›óOjJ¬'éé)ÐSà)ð«_ýjðÎ;ï »¹ˆ}löhaLÁÃäQ1Iþ"ü'AüܧŽ¸‡K‹ˆ !„(L0…><Ëø`]áă­<‚²§,O¯Ì5¤õoåÒ­]‹Qó¬ö¶°¯Åu¥ óÿAU[‘bÄç,Ÿ´|)!Ñ°}‚tù8{¼<~,O ˆ9©ŧ28|^‚p$Œ¹dp”ÂèIü4‡ŒeÉp-“†ë¤-åî„„Ó´äx®ù™sôä£^b«üx«1ÚЃRÖÖ½·ÄF%Ü!!¬1²`ŸÊ¥Yúô¦§@Ož/EÖnÅ]õôØwy‰|.žD+“o‡2@”lËÕG”`‰~Go+oѦJ¾¬v%ã’ßÕ…€.°Ó,Ó'LG?)‡ü‰á_1Ÿ‚>ã·o¸‰Z Œ9ÐE4¯ð€E…’ÁKp^I•'J7+XºœM¥%1˜_-QÔVTñ¿oØù‰P—xîÝ»7¸Ìs\¯Tð†£·ÞzË•c>êˆúA•Ç¡JÍ `&‘Ü„)ã œp³Ž•”ÑîØ à‰yà!Õù??b|êÀ›d6‡j¢Q`J¿·ö!SÕŠŒÛÂl]çSå´Æùð‹B¬cbíÏŸ®z98 ¿¿Œ ‹!3\ºp/B©ûškàܸƒGå éyQž}xOž=ž—ÁMà71ÝŠ0×/oŒ):&¥k2X"¤õ0 ¼{),<[žÅ%ɬU/éT̽a?=DSƒt¬`å\’sHyiÐzsJ¬0[²ê¶i&©ÁIŽ_¨þÌ+„nv‹¡SŠÖÙâjCJú=×kEŸßЈB¹6• CÒ0ÏsI¬{…’h•m×H4ƒ'À+èYb{ J€ À ip‰-çù+ÓCöè)ð¥€r1¹­¶œ1¹£½ý%ÂÒÿ %ü,æ x4<]Åa<<˜.<Ààõð3lP¥A’;—<4¤ºëŸˆ7™9ÁñþtÔ4éЀìc&î@¢S>Ûf`‘Æ<"6m3k\ƒè·©£,nùCvgý|ì÷#¥ øñ›EL!“ã´* L ^3Hõj9jãåãÙ¬²è•ì+U,¹ÃI畬éÅO§ž…^¶áýK/m|ª?õ%^¬0Aõ¶aR¿ÆiW÷ ¡çà ©ß®[Ã,Auïb;ïóÃgs/ÃF4r›RLcÐ*½ö8FHøTÛz›¯eËü««[šóyõ!=z ôx L&lïCXŸ;›>P°Mys A<‹€à×aëæG$ÑMº£¤òË­IQ(L˜@„«Ú…ãuÓ¤P­  6qdXö^D(¹[ üÚxLîÊJw‹¯Å‰2¥#<ÕîdªŒ¶îÕ•¥NZmXß¾AÕž¿<;Ãc±Á%¼¯\xZ$„T¬IQM}ˆQ8€ÇGÛN“ЭV¸ôÒ˜øÚšl‚á ¸t%\…Ù†é2Ý~LB´ PÒ"^UaMÈg¿]Ùo¢hf6.,Žøg}@uWPsRÖ'ãk.T½aîˆ9–ѦÙ4o_ê,RÍ¥·{ ôøJSàÃÁà‹Ï¿=>¯Gk$YŽèÅ#·á7<1c²×ïyÿœêVÜ3àM„Šƒ<*¦råel¼™ô,)”© ƒÇ9Œ€‰)€ä„úðG¨¯àyáÐáé뀘B$Á3Ã)Ú cNFLépá­QvI5ÕŸ>ëjH>Ýó ,spbqø°*{ÚôÖO}g&xM³ñTÜͧ ûzâÝýázøÉxÉ ùØÑÝË5o°PITìê¥þ1ÿD¤)Eã‹&•‚8ÛP‚ûN¿_&}¥!JwuK?_› ¼"Î_·´Ónô®»im Ï„ßMMã)½Ëaçeûˆ15ã9(¦Br‹@)±°Öĺ˜ 7ûf˜Za crK†.s‰åéMOž_y |8øpðÓ{?®f«Ân ?a‘Ò0ùL09¼Váu:3fpåÁvdäg>* ÍèÀ§jièTp †ç$¥>Ãìqø¡f‹I|c "¿“&Ü/qD‘…¬iBðnÓˆÅG HÕ.Q˜˜iêʼðYCó‰Cÿ€M“Ø0;^=L†—MM:ùT¿@F÷ÖT\aáIgf‚›·öŽ©èH…©‰ôDUá.°Cƒm `}Ì3›ú’þ̼ɕþ”ÅC€‹¥'q@Pº™ AMÝÛ=z ôxq üèG?¾÷Þ{ÃÑj4!õ”½IøN«âý£Ê‚#PŽœÜ6Þ%¬ÌÐ&ü^q”×Ù­I[¹ŸI«[—þ ³„З⾕Tê 5½v—³&.˜š¦M Lä„¢¡]s5©°OÃ%̳JéXÀBùõÝ»w×Ãœ£ÏÆð<W®°ž$Ì240¿!ÆÕ”9Ôâ– ácÏV¿&EgæÇc¼÷ÔÞ/-(çg€´‰Æ0y~–T³A¶ŸŠ¨Ú8Êì.øŒÝ”»Â½m&©Õfv`ÿž m6qä^W a3‘n×4^‰Ä[÷z0a‡€7#º÷_ôfÍ™¸Y°ÃJÜ% „ ‚›ÝØ›ž=z —pÿ)Xðêpo#cAØ‚¢äÎHoÖB” '*ã!XFT-n¼ã·9ü{þÁ°å+LKŠçeí+W|Fbضֺ^ôéæÔ¶ -ÖšA‘è¡4Å6Ïnúá]ˆt?/\MY ¡ß2Ö&Y [{[á²>*9:àÆG Ünƒz{ ·uöüsèMOž=^„Ícº&GÃóöô4<»e;°Gî—Ð÷–·U.V9Ò!.¹M»µë¯l,í.;J5Ö®bͽkw1r'¾Š¥ ± Ûºj]·v7Å«º½À %¢[ÅWEé¯T 1´Ál7ÒjìÑwÑ–$i~0];5îR»¸'—,ݨ—¢LÍhßÞCfôvÎJwài¥Øì&:èè‚ÜLÈü¥ Ä×G$±+€†o\øË ?Sen¥äÜnN²˜Mf-Úªþ#Mÿê)ÐS §À!  OG§Íxà•tÜ7Î#Ëø<ž,<'øUÚ•/´.½|ÝülÏ€’[eŸ'+ ja"^¸ÎR5¸ÚâNcO[¶Všî("¾€5Hv8q'Ÿ­à°:j »‰*,6ƘúD€¯èù[&åš8ëSËØÕŽþ?‹+BØܾukþz®p¯]̶¬¿M‡ ÀÙz´Zlšår3^!Ì7ÍY¥Pg,$ONÒ.¥*” 2òA$(›âvì[»[zhGËl´ŒXª½óW>˜¨ìAÓp´Õ*j#Ý·h¿rÇI*þÈÓ'ò¢µEZ~1ôÚ§ÚÀçVÒ‘fû€“„ñÎm>õªMŽÆí‘|2ÊAY TÓ¬G“fÕL˜ ˜‚gÂ|ÞôŸÿùŸÇû·{¥m ûÅzwOžo.~1W‹éxðxs‹3×Þb¥þ ØÒ8y‡ú0æH7Ž»bˆßÅ~qQ›þ<Š­ò± kÚäQpL>-3>˜ÙaZ(6=]h“ƒ¦<òß-í¦ŽrXžœ¤ßòýfeLô8 çïÊ2Ã~ŠÝIEãÑ.Õ ÿ´‰ñð:-¢áˆí[cpŸFŒL^Üs¥Ìÿöí¨Ûº­WH¨•ZOwEÖ¡ºX#°Ã©² »ú¥{ž0¿§fßÎÐí›k㪣x2]hÁmª.R݇+œø}Ìk7¿P €ÛÆ·i«Ò`±‰#°&YIÓ¸Š÷ÁâÁˆù¼æ³Ï>k>úè# zÓS §@O§Sàˆ殦šqäú}‹)L‡€äA-ÓA”FÇ«ò£/?ª«þå_ÑQ1‘LJ£ÝqŸãqà )ipƒÛµ#Mä/.‘ùhª½—¬ÄhÅv$ŠWfÓå¹µi·hÖ°òD€² áTeT8bjWé%dµ«Pdß]Û c Q±ÆÞKt—ü¾Rà‹/¸BqÂ0­…]ê¶"Õ;öS+,ñ4Õ¶:º«ß8M »Ø ,ã½û;-î}\~Î@ªi«Ýà©Ÿ¹µ‘Í/e#K»¶¿š¾DfkãW·mbBlõÖœÿçÇçÀùoAg¤¹9ñ 77®7×ùá²:°Ü`‰Ý›ž=z \Hxô‡£9gÒn64³Áél¯²Y;øl)Ü•‰uìŽs›Ÿ]Sºa­{Ÿ÷îû«X«á&Ô}±©ÙwíÝ"T\»x`Ý"ŸŠ½â¨~maZ1Ô‰8lG²òbâ¿YÑi[¯n½ž)€+]póæc$Ô·F‹á“ùâ&«J1BÄåªÑvœ®5­kNÙŠ‚ÛyÈî´v<ºý*ÚD‡ÐTPcØžqèFAð+Óîƒh÷’—d–ÂOzÞ¤vs>|·afZótçƒZ´Jw­¥çk«%òG™Wœùo|ì@͹%pÈŠæQF,Ñl¦“ÍèΟ¬Fóß_4OîSúo¼}ë¿¿uôÑwÿÃ/ÿás2y|¨d}XOž=þîïþnüÓŸþtôë_ÿúøú·Þ¾ÆpùÔÛ ý¿Åi‡þ— ¡Ïa\ñÀ¶æ𦘠lAü‚CmÝÀˆ9P>JW…Ãí°Â0ä /«FW‰À’ïV³…©!Úð^§m †<û¤Æ‡t¨ž¦¤j󯄗 B`wJ³²,– yý>—±™&všÁ§S$á€Ñûw£¶ü›ÊÈhwŒöË¿:øÚbŒd8XfIEÖsüH÷ˆíóÕ¸R ÀK4Wª¬×ï ä<‘J«fçC‰øðìzæ‡HÒ ]ý6Ý/j:iªqEf/Îϸm¦ÛÈ »(ÝáðÝt±fïÞú¹Ò5{ý6aøu‰®ÑæiØ"I“£!^G`áÎzÚ4Ã{ÌÝ]ƳÕbµ|÷÷ß=\€mñ{WOž_c ¸ýïóÏ?o¦wî4g§Ëñ”¡×o3±ÎüÿÛÌå‡Ì‚ÃÀ†U1ÿ®O {ÃÏ=Еà02¢êÞ†è24ÙTŠJÃγ-ùᮩi¶¡;©*Ú’iXì Þòr‡ï‘¶Àn1Ï^Tõæü¿`{Èj:"XµÅš8zÆãÑ‚;V«³G{ÀÛ«Ùû{5l/œúW4ˆYLÛ0¦DŸöyÏ#Bp×®î]è-e·_g7l›s¦”Ú¯…âÝ‚Õ jfÕ¦º«Ý 0¬5@í·üAÊP \ÈØ@ l˜ØÄÊÝ£I3¯Wë kôåç_^qh+Ò;z ôxC)ÀA4ÃÉéi3Ç„ôM˜Ê-zn×aLÀƒxìšÔ?âð§œ}ËÒ:l¶¬ìpüÓB÷eïOKó\q‡•ÌŠ²@/6«¤¦P¢ZÔ%y±2ZŽ+h-VÄU7’-§ÇƒÀ-ÆKu\é@·&q͵¶Qí.Àw¶#‰/ÙÒ®nGZctÇÛ†ÿŽ:jUÂöUâÇG³I›àBG§ÔÒ/`²k5Ì—GëÑòlz2í€ßÑvл§Àoƒ·nÝ’G0½™Þ?;»¹išïâÿ6,÷ûÓ¯y×½S–uµ}, ¤ûŸ³˜$oµÂäQõQåg¯TTx*Ryÿk35“b‡²ûn†(Ëä"@hƈ,aòáªL憰\v åøc–…‡k`ïܹS3»ÔÚ¼1 @-HÎ%YjMC* fG° P)Κ®by-4«Åº:Z„‘&å/\[]ºª¸[nøcdÉM–Ž XÅ;~2ß×ß›ž=z œ£¼wøïÿþïÍæË/GOÖkŽÿÜZŽF ?ù8‹³îãPœ`®Ÿ©”XŽüÆ­u^Öí+) /—'…éð³])~®8ÏH¾ÿ  KŒ®rFÛZ¦"©¾èþcÇ“:@Êú:¯`RMÑéêÿñx¸œLš%Ö¬¿0øÒM•»—Žøy®VßD1zLõ›õb±`$%Ïe”PI¡ "¨$oi8…ЪYþéJ£$“–¥YTŒ¡>›Ìa_q>=Õþ¥\5“jw‘Ô°N¶N©¡Ù»mëgŒTHÛé€PÅ=*/‡l¾h6v ÐÆâf`{ÓS §@Oóýæ7Ç g3–þ¯‡‹Õj žºVÍ^må8‡l¹Pòcc5•w¥ïµ¼kV]ä†UžÚ ¿Ð-p}:€´âìÚ¦ªù”äZʦ.6¼»†ÈÏ’vNP½XnÉ•Š«Å`à °‹âe|Wªp$íê­·ÞzÌíRËáðøQÓ°VTIŒ^9ZOX¾ÆÊjgG‡ ƒDq@;ØâG hs`£ ?dr–ƒ@Bw Õ€eßjÐ'Þ&ÅgStÞ*} Tÿ¨Úhà$™N0 ¶ªšæ¼H ¨ik¢ŽÝ„h›H—çm‡Ý<`ÃÆîVÿ»ÞÔÕÿ+îHX5ÜAWÃǃÅðÔXrÎR3¬®{9ÜLšá¨y´>ýEͱ·{ ôè)°Oñü ××ã“'O&ËÓÅ8Ø5|ØUý+zøîJâ¶qø‹7onYÁœÖ…mÓ÷€+‡DÓ-K*]5y¹'…_þ—“Éav9b×'ŒþnX$Ù ÚÆïdÒµ1ðø(K‘ Ññ4^ŠXÓ¥m ÿ5‚ÇU•MFpax/Ö`ÌJÿ xGDøÄÂ?*gÍír±4;mÒ³€VÂØÀ<íà ½ã/‡£ñý +åçó9]¾¹Rà'?ùÉêOþäON1®td8z„àWpË1¢l,yi49kmCêŽÜú&˜Û)R•4ÞíVâ GÅaÀ™.¿iÄÇK[áo3M%€€€ÔNxáL¢ÑE }ù²E#Î4–ã–Äj¶‘5$í.ÌnL다 Ü;²TüyM´×rG3âò€×ÞÈ€5?.€åà!ô”¼“Ér´ú½Qã ÞÕÙlrT®cj³ë=z ôh)ðèÑ£BŸíÄ£‰gĹ&ð#Xlx…¼Ï2¸)[þàFUøG¼S9;P’g˽à¼qŠkòИêmsíj¶ìW0ómH›¤B  ¸Óu¦0<‰ªDvÂg›F^=ðö¢°“]L¹/0HpzX!‡F ÒK9Fºx¨kÒ°ö:…½i ‚OÄk>ÈBÎXŸm6ËÐñJÆÙ¿÷Ç[A…»œWGB]ÂÁòá‡nîÝ»Ç8ôxI¥h¨ô >4™$ºßÒŽy}B‚+8Cx SŸ­KmÊoæîT%º6Hòác–€',<ÚÆ‹'T‘„­i.´ë·*¸wàÄ–8uµEü:þˆÌW…Þ– …¿xT^ÊO)€uG8åÎ}±ÂøçÏrÎA ËËJ˜ÿß0],ânïNn½³§@OžIN eÝP3¼~ýz3›Íœšn—æ”ø ¬&çóµëWEàçSã+«TÝ÷×ðW´E[ŸD%ûÕlm…sþmCf˳k=2Sõ‚8£ ¯ò§¤j­–ÕK4M±S.E€ Áêøøx~ãÆ9;0VÛ —ýºR [ÖØ=ý‚ç×<Ÿ¡/>ò€ÀúE“Äé«é$°¦:YáõKÀ&‚}U¸t¶ßTðˆl튨ÚñÛ}ů‹,÷mÈt!<¢ZX㯀ÛG7‰FÖí;žOÑ›ž=z ¤€G…?™<¬N&'ggöû³lHV”ü¥ò•ä-²–äÔv;ôEˆ°º|é GxÒoðŽ©¼V{ÿ0ãAíÂï MO]¤çµo`žKR¢ªjý~ÒÇ~±Ã/^^>)—ŠB(ãÝ¥@v?k¢™^>y²™Ÿœ@ê¤\'é¥9¯t  [ nšz ±þ´Í[.ϾÉðôŸ!¶¾OÓ™VÁe£²'.QyAhþ ¢ßÊ'†–ÊðLWý&‡XœYÐ8’Ï)Ëé&È9«h†T˜ˆÝ}u?AäßFou¨®møó9ò‡r¶ÍÏbó[Ê¢QVþ]<õaÊc´„JÕœ9ÿ€‰ êPÕiŠÒŒ+tE2⼪õjÊ€NN6 ¾œÏ½é)ÐS §@P`xc}ãèt}z{4X¾󹹘¯œl债å`ÉÍ?KÆ÷óÔ?¦;P€“…ÉçÒÆ#ÜÚxÎË7"äcµÿj¸¶`JbZGÄ´áæ™–øNŠà§ÆlÉg Îäó@G$¯øgžß€dè>F¡±M'ÍKìR5#Â@àPŸpGÒæn]-rÊé†X€hÎÁ;Ó9¾{zÕ°*—rW³ IDATiÞæÏ~RUFÕôN"L­ñ¶Ò[W§þñeðo?R4ˆú}R˜_“ÖtÕ¿kgl¦3m¤ßù-ûjå÷m ´ýÛ 8Aã—–?8µ~œ16Gúƒ-—C,çÑ’·I{WOž=:8kÎa\ÙfïŸI{V¦Ã>à+1))<Œròʪ*ž¶^ãwìÊŸwypòbküN¢­çPô°6¯j¢¹Åºu…7Ÿ`ý!I;‰*LG~èË–F•&vL£sŠÍ5 IX¨{ýz…覾÷•*/±½aýðáÃ5ó´/®¬§}±À‡J3Bí(uï7 ×<› Ïòb—‚¾ýóÛÔ¿-­êGÐÖ„ø«ú;ñšn˜˹¿I.Þ0¾R·&á¶i3Ô7é"©öEO«‰º å·£U#àÛ?ôm~‰ŽH¸Ðùÿõp>Xæl>Ý4'ß^7ß]5¿¹nN®ýøÇ?žøÐÔjñkνÝS §À×›ÃÅYs|vºz‹{ÛßFøß\²*{Am÷ Üí¾¹+`Á»à’9þÈ$l%”…ày8Òè®O Òê²½Cî ÓI‚³"ÒNÓM»Ã§‰0®}…§$"0ÿ*@ÅrA¹Úì¶ùG ^¡`»ͧjI±Ù"H) :’£ Q ×gsÛk4W:ðƒü`à‚ÑÁ?þã/æ£Ñ#ö­5ì#±ÆŒh{‚ÇÝ^@å€=Û7× ¢#$ ­l¼øƶ´äªJ>oÑ¢L§ Qe¬ ëÖÐnÔqs¿CåÕÔ÷ú¾Ê˜„sø½ 0²5¡LT_mèøÅ_óH_U*ðyÛY¥jÌ¢Šæ*ú+ü¸(-àÍ•þ¼¦b kqIì.€9ÛGƒ³ñpp|›–ÿq98ãúåf´Œþ··ß~÷çŒÀ˜Í {ÓS §@O‹ÏN£y›{Äÿ€EZßD øÎÙbÅã`pÊðÿS>+˜ê&´€'-ˆS9ð ym ?ŒÑýü{„ÆÚêÂê¸iöíÜZ5ž¹V5`ytx}Å“‘òè˜&-i"ôÿgïÍš$;®½ˆ¸±ffm(TV ên’ó !m†4¤3½©wý‘!ÿNóUcÖ“ÌÚ$#fÔÙìitƒ`ƒjÉÊ%Ö{CßwÜ=âf¢ ±1«žy÷ãË=×ýœãÇ7ó "Æœ ,˜v¡¹A¿ 8~6n“E`(ª ¿éŠU·ù¥Õÿú×p­uØŒëáKn’dðÈÍHݵ÷µ$¿{¹dÈ昳˜ÔŒ“õüè+Èú³e íw›Åb…=à‰[&i_¢Ê5jYÀ¼6 PãéÄèé›]— ,=2Â"·µíüå6*ßoðs€þ·ÎŽ^˜¹vB^jhƶ^ì’Æ,t“„ÇŸlG/ÀÞÞÄä¶R9Ã"œ±É# *v/Ï°“¥™7…£uw* J Àò9ä¬ëõâVÕo&,À°Ï´ÿæ›oreiö¹ìµÃÀ²øðÃ9R¥7œ\a$q•™ÚK«¦©Ô8ú-ÔºŒücô ñl€ÍØV’d.`":Ó¨*ÓEü†eShç§Ù>Ù)ÿ3ašboès ØØ:ÊóqWâ)‘ÕjMÑ…7ÀÕý˜2êÞp‚áÅCÚ`AB>OF.æºtcûS¬H¨L¿—/×ëå’C꺜ìC{ÈÉhË#Ã;{CT NÔù8` SߤÏaúÏäo8Ï#² ´e>W¢œ¾¤µRX±S„ÁmðØ)ùeBåÏ 'Á ¥KïSÞ*ÛYvÚx¸W3`¦#ÿRÃ3Åì<; ì0ð§…Á'ÿöý÷«ÞÃÓ> ïkcî•9ZPáà"M1Jgü3, :"R"YòIfã(çìBzÎÛçÀç-ÉJüy„·ÛîOHôI`ÆùZرö¼«f ©ò lEDQ&â ¦XlüiGºž“Ûk¶Ç7^¼8f×öw¿ûÝOC`äü‡þüQ§Ú•===­'ƒkw|šEgÊBýõ1X¡­òþÑš´KJ%%â3ö«´q°DQÉRyU=gaJWedCòMv4y%·0Ø.>_ü¤¨p8Çý”£±ã-á©3L±íô¥Œ’N[0BÑ1(*·á×A¼RK’|h–ÒûR@œØ BÂ]3uâÄ€sNº8Ê“xg^zÃ1—|öÏó‹Î¥ÎéÏ~ö3Ý4€HÝ™þ1ðWõWœþ{gÂ@û£^o2].n®êÕsìÿ¿¹Z®žYÌ,l:N·\,yÒÀj mAçït@Í wLÄ™ÿ°LÿÚ( :Y$ŒA€u,1Ÿn.Í,fCÇ#(2.Q™,›€ sŒjפ`‰1GV&ÊU3…ü'8ÁÁ®‚*㆑U"¾=è§Ù‚ÕiP—È£¬£éÙ˜§·öLoÕj“gUqàBoÅ} «ëÍyã¿lêÿe:|ý aV«ëA¿^€·Y¿WÏ©GÖ§o¤|)”,E¾øפ’ì€- ´Ë‡-a‘âìQšóv Ýæ[üaG##EilÅ>ôÅ<íú´ÝÌUdˆ“Œ”ì¥ã!&äÇÕººC2ǤwmÛZwÀ„ÓˆS†ÃÃaÙYÌ.p‡þ40 8 ªf4B$FŒ«†M¯7dÈ0„¹»î€Ž¨Æ.v¸ÏИ;ßí6 ÛÄM:þv`ø ¸Í²<Ÿ’MTØÏDÖf…€ #Áaz‚7O¬W# „ q‚ A@Û‡ŸÍÔ ¿nFæ¹ì K_‘¹0€›ìüoæ=¶•6,2õ¾6µÇVß¼psmF¿1§„ÛE€.—`„ë‚¿¢ pÁéã6G átúñ·‰¶¸5Mñ§Ð—ÒY¢[v+.çOE´Ø©ìmŒ-uÉ€g,Kõ ¬e1w•w £mÞO(;"…á_ZtÃ:ÖÄzNº2—y'DÌÝͪÊNoïæ^ŸE?!Ùn‹-ÙÙ; ì0ðTcà ÈÏkÿ ðèß!yë䀨I Ýp@Á¡@¥Q¾*à P?$~ñdrµ}BZ©[SŠB?õ·dS[þåL\DËm7å™°•HgyŒ*™è>&¥†s´ÂŒß®æOñÁØÏ&MÙaR0)É>ÁWs—Ë!øÍŽ ΃†ÕñëÛ·o·k`-¾saW¡×݃E5êÌÖ‹ùœýjfŸT³ ÀǦ%ß_x\A âº,’‰nuãx{éaà†-ïñÑh¤Âš“,Õ@o Û•—ú5ªµ T5RxÊ(©Ýuor ô Ý–˜`SI¥¥U~ÜS`-üÔ¶Òji·M—#R7óW@C…ð1©aÖÍúŠS¾í»¨ú¶îLq‹*»ÎÂU5‡ÝΕkôæ[¼÷éòdùîä…IÍõŸ T€Î”e¨‘ÿîg‡ž~ Ü`åsóæ¨Z÷/ gÓKMgöÜj]¿“¿ E™°À¯ïb¿tÌ5ìi»Ä¢Ê‹Y(ý.ê¤íS~·v¢]…ž±‰ Д62 Ä¶/…•˜¶¯¸…’KJMû7p)G;?%(àñ8Ë|&ŒyD:èêI¤êþb÷Qe8üÇ\æ|F^#§ê5îÎÂ&»úÆw»s–½ý#ª•c*û{ÒüóÞšópV«éx_:ü¸—¶ŠŸÛ\`¹üæz\=˜×+n©[÷fë¦âˆº!üÕùj€a4§´õ柎Ãã#0xåÖÀØ€âîàcn—ÌÙÁlbëyZÛÀhsâ“"à Üʦý¤†¦¿òÁÍáÌççã…Ÿ,†7ŸÆT%M‚›]˜'„„¥?Îk%S¹8©óÆmÜFÐ駷³ÜP·á°Ö¼3r‘nÅ6ÀÂëýˆœÓa÷g¾©³$õ³äý"Çëzv¹ÿpȽÌ'½›7oÎÀ‹2wZ€Ç}§]øO#âÜÿz0fZð “ÓW 0/An_gÄ‹…ÿÝåš}Ú@(:sHá’¤0°dÀæu®H»$]Pé—dË„%ú¦«¸“+it —‘j'zœFzÂdcF4ê{&¶]’´1h° íǹ¸?“C†5¬U„”<î¦#SëËM«¼6ùôùTIÀ"Îø”Þi¤8Ò# ̹@ðï>îŒéÓÙÉb4šõïß_½ð {ikõ¹MyåÏÁ——ðYL²è°% ¡ö FÓâ ‘ÛÂz˜0™FâÑ\â»xpJó¨×*yøÙ¶iÒW7ä|ý> GË•Ü%Lûs™m•¶™Ÿû„ŒK‹Ð.੤;›Âƒ‹ÓÚ>§Ô (X­ioq)ЂÕ^SGËãþtº¨îÝ»w!f½3; ì0ð”c ªªî²·¨ ÇCd\1Ú@E†PO¦áp–2¸’Ö³yíy,~’ð–ɾ¬ç<û)$Úב›”¿ôz)a„å´xS“íÍ1nî¶gý|l¹šLna\s[®Äü+1Fðú믯óÖݺϳySs&rÓcõ‰x ƞѼe½àÌ&© ÆÏHÜs™]Q©–€»”™AÀôH¦6RM¨‚ò Öu¦qqX/¹ÈÅS fg>F˜]ÛΰŸf™ÄJ„ýXà³;u´éÚÉÊ{‰($v+Höâ1³òöÛo7ßûÞ÷Dæ—n.Œàm‡·öÖuØ_ͽÕñ”CTçƒû@ãQpþ‚…²PµpJÍŒË`ô±à/kÀkjŸ$Ø6 ÂJËÀ–é—LC5hÎ ×5~)Liàá.mÅä{¶Œ·{ ÈÎ2"}Î:'=k•rMà¦ÚmÊJ™˜_dŠ— iý‹>I½}UÝEJ·ã®ÙØ8uÑëԫΟ7¬½'ïÇÝgG½æAUÍë™·\ù ùþ4ŠÚýì0°ÃÀŸ8š½ª{ˆÍ5Þ˜)€fR7Kÿað íyùÀÐbpá`ƒÇ…Å…Ö¨ö/k«‚nò¶ôê+2…¬šYJ’ö™·\éi<ÒJáö§xSXaþ‘'ÌÃ3"A€G‚‡ör$Uá€42vÝj^ÅU0#ñ"’xØH\²½0( ½^3Úß_}ûÛß^q@.ðË·¨ÂE1¿ì öê~«¦ê«™^³jCìÅ` g­.îxü~ ?ÿúmßéF¸ˆ5üŒ1Ã6pgA xÙÂeøóé>¦°–Çô8ª•ýsS@ óÍR‚Í{äô­\7ÎÔѳßêˆÎ§Ê?= vÃ9ˆ™ ìÊÞÎU„+ÔnBfëoxéÒáð8¸O(õLI;Ï; <¡ ŸÛß{£Ñˆ#—#öýï3�`3ÚšeW0|0’”dó®ø‚­{JzŒüš e*O.²«vp"ù[zš™ C—D9GåÙÎoFà†VãVQ|IÍuh X„ø(ˆŸ4,@0~´ÞøQ\wv4N‡ã§”÷eÛF0›}{=½ÿ> L GçœÐ;ªzý»4>ίííƒLV®Åiÿ O!@|ªÚ\†7>ÁÚñ¡¿°Ñ„>£i…¥$FÛ`[–¶ÆÊl̶ÌÚŽk»7 Î9 ch)ÚÅ‹*'´Ã´Ê·“ªd6ÖãÂÓ„ŽÀn€”rÁ‚„X€¥YLV«j¿®W³££õøw¿ †Ã7»ŒÈN6iqïìvxò1@ÿî¾óÎ;ÜÉ6ìžv&ËAÍ"ôîjÿ6h W+Î¥A`›vg…‡ý„í¢?HPÖl'?Ña 2…ÊÙ÷(¬ã ©MpiÃZ¤?Óÿ Ñm ivöŸ-#‡ç¸m: 0AÊ.£7$ ¸õ–íVn¡½Ž×ö56LË…±@AÁQÖ A`Á!@K´Ú‚¿rsa€·ßþY3þÖ÷›æôT†=¬ú¿tûÿÇj½¼<ëÿ|Õ=xuÝ]î³µ³^q³ÇÈy{+·þùW£RIê“Š/ãš¯× YÉ´ŒÒ+©Øö¶¿1_®M¸+55ÉÎôCpV8\›Ñ{A‘Æ”.Øšbf“ÑÚÌ™åžÅ5Yñ;²Êù©ÙO5˱֓¸Vš<~ÞÙ÷V]%ó_¡-¿¡F«í€–ã±ZÆÜÚO+*2ÃO56ù e•ZÛtÅ}Þnåù8g)«ßFìXÛ¿v·¡ vÇXùÏ&@ÏJ`§nžpAO4HÅŠÁºn˜Ð.›Á¥KsÑ“ÞÃÊfÚ·¹vÝßQ£ò­Jíœ; ì0ðÄb€‹Àxr;h½d÷Zo€ºÃÇÇ,HãLº&O@Gô‰Á ¤g vd×ánÛºƒ^H3ʃó2¦Óœ· Êô±Mç… R¬CShh±SèÇK¼\±¸‹Ã}<ÁDR<¼?L){’‚7Y¤jSw‘£GÕîÇ‘¥‚D¤…P³à¼F[#=FúÉ™Iօш™étYO&{ùœkz§sδ¿î‘ÆVÜ\K›'~ƒ@cšCqqW |%;þdÎb”ÊT‡ñœ1†ç¸ô¥ÎÄž÷œ‡ÖY–,JÀyÀóóGý©G²©/ñ‘ej+¥””Êsy—@ÝÉϯ8‰‡úÑÒè¾qæAbœË3¹‚j='аէó"š¨!S¬8‚¼3ð<ÊÞt}÷ÎýúÚÍK¥°\æÎÚa`‡§\ƒ¯Fì7ófméA½\¹6èæ?Fõß õ?£Yé‡SÒÞX€ ©É4LwAŠŽÇ@#K€THw&fF?ÒäøBÐ…?¤7r-0Å.ùéç k–³)ymzLæàƒ·DºÄ_t~“2•ÿ8ç?‚ál·¤'wÏ»È"~øQZ(ÈY@ëÙgàf §›²ÿoùUnÿ³@Í…@æú¯ÿú¯g—.]â…Þ°ì1úà±ÓÝi5«V(ä{ MÈF08íèuZ½>± 6>¼Ä‹“͹͢|LÓwRÑ”›ØbBLúÌ©¡&•Qr§Øø`ÉéèYcÕ²]üaçŸvêvxq[^Ê#Õ-ªh"ž4z§Þz4íÌ6îïÛšƒê°œ“ìÎÊ%I¨Î¸Ó›)¦Qœಠ%[O»ÍÜm+"þu]Õs üžé´0×ÿ~èéŠwO×·ƒåâ]2>â¹Í³3; ì0ðÔ`ÀÃNª“« ¸.Í;§·õâ¥Åjùg0ú}²ªeûKÔý±`¹ €3:Äñ@W C’Bæ ƒ<•HBP¡]…X%Z·E^ wOüÆ$╽yp9¥¤¦ØÉÛN¶¥ù›\s¡Rºœ[È£F‰¯Â@€MJ~‚ˆKÛÒq«…kC/Ó.¸©a®TsgZØÖ¹Ük‹Ó:9ò—O™W.ÕGõ?¹¯w¿é÷O>ø@ȯÔ\À·üáèñ³Ÿÿüç€Ô]Ј洉9û*Y!ÚœßVõ¿mP6´$ržÕ˜ß1>µ¶ž–ѧÀPìmÔ§ãülN9eÊ(h6ž¶çS²õ¬ö£L¼g‰È8›F1AQÇôÄ`™Æ*¸í$ äOUz·ržåÝèG‚GzíÓ"_´u"Ù9ÖòÙªYŒzýŬw©êÝ»ßÝ¿P­¥ cgï0°ÃÀÅ@U½qxoT×Ý w±Ä@Áž}GùÜJk‰b:»h ‡†¤•ÿ$M€4¬eÎx —0•ø6Ñ,a²3Á+4<3ÿå'Ç&_`6Ùd2টÃ#ªÀ`ÃÒ7 ‚w@Ê4˜¸±Á`ˆÀNN™z wtï€ ÜñÊ9¢PXHƒÛØùïõ8 w5­ƒé`±XÞ¾}{ƒ©Tò—ÿ›eœ/?ãÏ“# K=uãÆ (dѪWw+æDÒ¶ˆuH_¢´†ÍÅGª9œªæ>´uÜVå‘À Óá |„ø@å#Y3ñÊ¢N?šÁþ”´u”"’b!2ìÂáËw*¶™µMÉXtëN¶9hJ*Ù´¾Ô\’Ü2hââ„ô>žbdºeý€Èô³wÜŸþ%Þº¦ü&:.óÿ,lºÓô â’O„,·.8Çb‰Ðísýçµ×^c?Æb½|ñE*–êM†;³ÃÀOªê=6]C@×ÍQ>·þ5}úucdÙ`{Ìž=lÚM§´@'¤‚éIôLÚÕ Z$=JÏgCQJ{†¾ä ÉÜÆd·ÔLSlµìÊ>™ÄfšY œŸ--,!É6aypš,’–°Â ¶PÛ·çbvÀÊã´´gûù¨²V»áâs×/*¸ú?iäKá–¿­zƒÁ²©*.Ä#ÑÏ~–ªõþ^˜1wPs Íö>²²¿_U§œGUpæ4W$÷ëzäZTP½Îñé>ÒèªS±‹½·z¦Ós7;«Û»=ýÊiŠëT3Ç Þ)> ß K”]jü¬ž¨í‡ 6u¿[úø郱:V(‚!{4iù¨ §?ÉPÃP·­1×â׎RrtrËÜ×½%1æjù.γ;%6L_¾;¢eWtÆ1…+à䆘m‹K ýwwB~·«LÑG…ªÊµ‹5wxhR÷n§ßÿGì:uoØ™®_B;0!YŸU€{ׇ[¯-êÑáºßýÇ^óÁƒ—ð¯i¶~ù…sEwÖ; <Ñ899ᶽ›Ð”\?÷Ü|Ú½|4[súߺs8ïuŽ¸ŒmŽ*{ à•?·ˆ2}Øíœ@ ¤`A.cÐT+ÓDC¡Áü2Õ>Q;#Œs®Ò4>’• ‡¦wãÆF ³ÂÕ¦†;Åyd¸2Õ#îBŠ…Èñ%ÃŽzð“Ôüiìï *6æ­ ¿”«ú+.ž#¸O±+-_æÓ9€†È°¢cn\­˜*‰ÜrÆæ5¦Z]ùÏ;N†^ÄÖéìa³Æ þ•CÖªïvÖóz³Þ}èõqçG?J´_‘¹0€wPðÁÛVŸ3”?ôÇcQ³ì®šØÙ«Ñp`²Í &H#tÕÔˆ`hfŒ‹ ÓŒféö ¼Ñ˜tðȬ‹q6šlZNCó7>¾c’¤«º"Ï1ìsY5hÙ8³qqžñÉNyGý"´”ÿñi¶@$$‹/%ÇVí"çÁ‡²ÊbÀ8•ŠGúu÷8€Ð˜‚u—\4à ÷èKÔTýææ5úÒÃÎì0°ÃÀS‡‡«îdÂÕ¿ #€.‹þšÎ€‡ÁF¾è†ÈÕÀqÉáñÀ9«5´’U·!o™«MÚå‘–ðˆNT6AJÍ ÕÍi?Á :lv…;›qÐþfðyÓ.Ú²ô§2–¢›!¿XEˆ|vJ1¦JÐÅv¬å–@O÷stï¹´Ä!$˜¾Jp›º%©0™C¶%«³æœ´à0¼_½±Æ° ö§é#x6LMsuº‘œ°ûFzýºèÆ&+¾KÄ ¿X,Ë”)µ!meDÀ&÷s%íy»Kq·›©a¶Hz +žxòQçe)Ñë´¨)ô”?Å”âÖVhñݼ4<4#h4PùÓ‘}ØØ,º \ú±FíÒa^°é÷îܵ°Ùa`‡§ôñ˜vÝÛõ™vž YÝcÁߪÀA½jØŽ¥ð‰…ÆúQ¦Òü?”Fî¥@œ&œáÚþ<*,hW€Ò’íâ5Nwy6û·Ö&º ÖÎ"’ ÷Ñà˜b¤ÛÀ õÙƒGxF†‹h<òŠö³Ué3d"^¸XÔèz«:¡€ï¯qá © { c{@¢‡D-¸öžO€~…ãðøªÍ…Ñð¢L},¦ãñd±\ö˜÷_ÁwŽ¹{Ü"9Å £‹ïÑþ- …ªG_¦\¤Tm­N¼ IDAT™iôëØXµƒ©¦Lül~–Àœ‹Š¥wYƒßáöе‚è$JXçœw˜Bƒ BI±ƒžnºÇ˜’<ÑÛ4$P¨mÞæ— ÐJ®”aqG¸ %àP¢ç)mNžã…£~€Å™ÿ¸åáê{ý§Å|}¦Yõ ãû@‡o¥w²RÞÝc¼¿F x@è‡ð©cÎÁ»_Ÿ¹0 ÏÄ}˜wïÞYTÁ1lÊ!ÿ‚ïÄôµ’—Ÿ(ýÙF@ m%³Úü!¼ P Š¡ªYšsü²ø"3[1¶ŒÞÜ|0ÂFÃLÞ3¿$@ý°?9l?²nèO%• äÜo¤ä'§zØ™TíœRî)Ä PKé=´äMæJõªÍÔè×2ÿX/àv¦OØNÀV3Z êKüIG F¾ÄÎì0°ÃÀS‚_|±:>^ïsfÝèøøødâDçyFüÏ0 ½Ìz,Ö0L….¬8}Õsdø‰ž$ ¸¥À"•Î‚ D†SÒÁBÓ"ni¨¦ØŸÄ¤ÜLE:ÿMÎã(\[´7"R| N¿ŽÜM$ +ï2€¹¥0à-·pg å°ž*­@í‹éÃÐÓÓg Å9  ¾â ·Ë”ºÆ4@¯÷|ÿŽïÿ ÷{Èé·aþìµôÀ¯Ç\À×9Ñl~ýë_s*à›j™¤f™£y¡ñÕ„:÷˜²˜m\|Ì€UåOÃñ‘V+Â[-´<»ýPeÈ $$˜ÆšZVdÛò—¦\@‹Ýy„s[ÿ³…îûšrŽ¥`í3=¯]â¶öÑ,K±i:Àßxâ Fîï3E0AÀy”õ¨âd°_üâC§àjʯ¯…>K» vøâàðŸÞÇôíj=¾2÷ßõô¿LhȸÆÃèCýIã‰ÌJ?2SkS™-£“Ânc ‰úâ5þ¬9´J”îgï&n™ñ'f)Ô&U‚,AÙ>!¯ÈËP(Ä«ƒì4ètÚ*ˆ´¦#QMø 'ÞV§ófVWknÁeÄUß¼ÙNÑJüå:/”P^í•WNšßþv¸àFä“å‚U~î¢êöáE*§YÑftEÁ€}«´N>*«ãcÛaì¨`üÏÁJ`¹bK tÁCakÊE'ëÚlÖIµ“¿ ù†!œ~Ðm˜qy!b4ö$rlâ#iþ†Ô™;ž"'BÍéõ'†lJÐ%iØ‘*ÁD¼ w(,€ñô™ñÕåÞÍɇ«f[k.J[ßølL,ßv›„Û€íÒ,Öý°Em.ÂÛ_¢´ß3a6²îÌz³x‘RYÏ’o͹Éx (yX©œy¤ÙD´Ë·’ÖY›Çž¦­AÐØB–A\àBBHÆÁ?Ö”«¸Èõ €#l¶µ¸Qe=ºÕ¬¯r#BÆ_?dŠ€»Á×®}ûÚïÈm'€„ÙaàIÅÀºÚߣîß„…½Â`—gëõË n²çz<_7Õ”Q‚À,öUA›\š¦úOr|_zëÃÚ§ELònÐ’ÈS¦Q À§š6üã€] H~¶¹fÞP’ AwÚSZ©z_X½i*4ÆLmNu6&’a+78¿ï*ÿ˜Ð U‘p€SÕnè^±òߧB@<„y†W. 0ãßë­Ø™uDÂûžÖÕà´^.§¯¼òÊòå—_Þ¾yUF>wáÌw;ßu@SOëU=ŸÉí– =è Yi‡~8G‡üRL%léñKûZ< î2ÀPÒ„Ò@Ÿ1úËc„É‹„áú[Ž4µ`·¶ÞØÖ0ºùI"ƒbÊæ ".åI.ñ‚úø£ðPÓžÎæ«*©úd±Cl”¿¤Ü·»¦GU?j>äàß]¨¤–@æ»@1š’1°W˜¸Šˆ…=¶—cyš½þû–º3; ì0ðb€¾ï‚+–Õ¨ú×WY |:ð,ljÙ¬'0ùۯ؊E(#‡Øþ—)E¢'…šHi¶OÛ$‰¸ ƒ_)ŽJ ÚÅ´ÝÛ°iHHô¼PÀÏÛ%1v¦ÆÉÖ_žM6ÒVh,Œ?€LoK:³Î—Ò,6¾T âË-ƒ}„Ih 3ÃmC?ž0•™Â­•åŸ1ç¼g¢Ûq)ñ™¤ŸÛSò ›†™z ’V¬¡ âª^ÿ\(èª_¥^Ö¥ö—KÔ+õjÌ"Ìá8N^úܵÙ%Üa`‡?düÜütypk\u—× ”7še½³÷Àn ã’ñ >ðœ!­ø!™Î>îEÚ”Ðñ‚ÃL(¡+D g6mòWÂ’}6¦ø Ç· xL*ãË#È~ãÈ ñ§ÿlŸÞÃd‡pñ0 Äü"‡E¼LzîMZrt`zPÉ6¬ºî®æàeQï×¼ïë4R¸}ûvóË_þr1¯Nz½ºá‚„¿[¯c6HÞâ¥gFÃÑ¿¥Q°Tž„ÒŠë‘nWa×nÕü¨»=¥&Ç‘Â e „àÎbÅGƒ³©ŽQ0Á¬od¿q±¾§ÛåJsõC¦ù|Ù$* ÔîÑ9ŽŸHú”S›Ø•`ȆuH¦ÝbÈ×´í–Rò*à%UjyçBɾóú¹2×hE´-š;?aútJñ®Êú„%Î_¦¾¨¨Ö\´ž!ô{ãþä`¸^?Ë…Œ®^לĴ3; ì0ð„a`Ý…¿T¯¼r}ÿä¤êͧ/-êõ÷¡ ßg…w>›±{UÍ™¿žNgé|'þÍ™øw:›1A^KD ‰Iar…¶°Q˜c *ÏD)i"t…Ø;A?ê·Ðæ ŽJ4XmR¨¦7ÑOrÑ!sNL:'‚ª•èpdÂkÐñª_idNϤ3yHï$qS¯S=Wÿs’wÕNžÀ›ZÜ(¶ã?C²6øw‚ø)Jóä(žÎØ%Ìðxlòã KÖ¸ ¨<âS|ñJírØa`‡¯vÿK—ÞìÊüû\cWõ¸ë»ÓìCϸç{}@§öP Ð –‘ë–žIœƒ!M¢[û“ߣ‹óö'§zTìÙä@1:  -5"3 D‹ðÑÐÂMy$/°JóM"ãCšLY•¿aÑ¢Q”òÌß™÷m9Q|”+$ê™ëEo~%$Àb“‡b¬¥³ý¾½AŠa eyµò Ù Ù5ž;*VËÀ"@î\™­ï¿0\ÏcUå³×o<÷Áñ¯G£ýjñÛ_><Þíe;³ÃÀÅL¦‡Ú¿ú›¿ù›þð™oîÏGã×¹ök]­z¬k¬‹ëÍO~òÒ|}æB | 5—-_}õÕš‹V“Iÿ. +ßî/Ù”6».…%‹Î|ÆÂ5['þfÆ—B;Í1ö&³Ò7v*VU\tÅÅ lk§-pÞP0X¼~Ü€“$_²³aøA5~FÃÚl7ÚèÂh<ÿÙpâC(«'“¼^ZÿäÈ 7ÚdO2Œ#Ž‰,a)DT–}—bl±ù œ± ëï{ÕMº¢¡è†I.êp S<Ü®h—G:âÆê~·Z}£Zs8H=:î·³éÞ[“Au÷xÞ¹÷ÒKÿð=žÙa`‡ ˆ·˜?½üÊ+#NøÛ;žÕ/2íüèþϬºÕs‡ÍúÖ’ƒý—pú»‹¦3Ç=_6£GœõïN(‚™^uÊ’]%:hG,·r? „%ÃI ™ûïôª&˜&©OqŠ…÷ìº7ãS>±R?§”Ä™KJç¯e$ŸV@mðI FZwä³ ·ÃBM$3¹þrµ¯¶ ÏÆŒ+=÷ˆêg¨€€ŸýUe3uÇÿ`ƒ0v0‘J™þ³bªàSÿwÕï³÷¿ûö¸Z¿?YŸœNºÃúÞÉL`ýÓŸþ4êñuü\HÀÿñCÑŸÿüçÉ䀭¨ë#N£‹8ÖÃúœ4}(¶­ò!ø¸9(Ìž¦_OzÙd¸ðewô¡SÚæX´`.VýÛ`•ñ™ù#–uø9 € ~H›>¸Ì=—ÁîÔ ¦Ÿ£w *ÒÏûû\Þ´3; ì0p1Ýì¾ùÞ{ ¨úó~Ôï .sÛÇ_@gn1±w æ¾?…N*L tôïv¿9{¯aúnýsÐ $ž³Yàiî‚rá÷ í0؉îIפA!í+/†%íK¤Ze>…v%H L1)ç/ [ÇÆy3£ˆã‘þS˜|JVÒ¦lJœà*âD €Ða ž¨À¬ÝéØ΃“â<ÞNê«pàÜ?0¬îïÌÈêwœ½|vÞrÎÊrÖ[ÎŽg‡¬•z}]¶üàÂÔ$Ì“t¹˜½ç\`m«Ñ^i}y:€ÆD 4Í_m_K•’YØËÑ ãÑįAºSPŒèø‰¸[‚–ó2urnà Ø;ÒrÞn•¸…Q"ÏÛmàOs§†)ê4Ñ J«}Ûs€î0.îhjÚùzÀÂn!êϦ¶çÙa`‡‹Š}®ú› ‡ƒj:Õ«åˆÉæ!}Ù›ÿú¸YfíªöqwH=•>li„ -q©ô«ÿ«0…ÒûLéò”ˆBÛþóa%®Ø%Þì “Ž›/¾íÊþ¼#Ç·Ý‘$°—à;AC3þR1¦O«þ9ˆµk=–´õáaÝù¨×›‘ÀËêýýæ»GGJ )Ù×ô{a5åýß~ûíæÆ}ˆõ;„N¥kýÁè¿Ò*ŸY.WÀß7x®(m®ÙàIv^nSyCH y*@ Lqn€Û`»Ïµá>ê`„¶cõöê¹0J²E%%swMßÎP$R9ŸJ†òÉlJ´üÄnƒÂÕWŒ§Bi"¿Oe†Î)"L)|y"×MA‘$gg}Š±¡%SÒ•˜b'àÄ÷-]½ˆxBª'éÊU«ØŠ©ÝŠ#jv0…Ò«§ìT™"õ6|†õh6¬Ÿ[/—й˜ÍQìÌ; \T ôn\ausØ__ÖËoNOç¯Ò÷oÎæÕéÉÉètΉ 0-F 1 6`1çnèAÿ+miMòëN~©H!AÁ4[X&ŒÜñ³˜LØ’%ÍL‰p…æ2|„•Ü´c1x è /tSÚš º£yéšùÙ@ù½À°äÉ*É€ïsrŸêÿ!Cü‡¤«ð<ÿ~mL‹%GÕ¨¾{‚/À†*Vý:“c}¶Œ1òŸÕoGýþGýn÷Îl>¿wg¹<ùWnßF‡½Ag©âWj_xàG?úÑú÷¿‹ÑÅAU'ìF[Nùùð\¢g]´3¾£’kpÞ3Xþ¨| ?H™"°±Ø°ÓÕα¶í¶ØáLŒ=¥¦•›v€&òÛzp%(Ó%ÕX±.a°K'É!m«@•²J’(ÔÈsõÜÄ·39綸R¤kh¯TŽ'¼am¥Ó¾­[+½(È£“#¤ÇõÝU¯^r_8‚ÒÃaۛΕµóî0°ÃÀì+ïþÙ_üŠߎG£îøäx±ÁÜc㧶”Ñgå-  DãìÖ£3¢ÏKx‚ÙK"‚v¢ßí¼ý%¼²ä­ÐÓD.5 2nþá•žo<%ЀdR’âÛØ Ž,K|A¾$9DXÄæ–òr 0)?ðŒÆ#ÎJ^ªÿ=þ7­à~¥n—‘UoÊB¶ùþþþ‚Ã\”EV…KèûzÌ…:Ÿtööþ·Õéé`>ô§‹Åá´ê¯N¸†|Š=°ìÉIñ±X¢A#å•l2óÍÇ(Ÿ¯“? Þ‚¥îÂŽ˜ÇÊI6hO_5yu›çÆ6O£l€9B;VþJcDpá„KjkŠé#$eìHÜ´6ª Pd@›Ÿ¤MHÛ¼Œnû‘0çPdv¡·]ÕŸ]>3~R#f<„d5]¶N/¯Pd‘öÚxØ»þ»‡??¬›Eóð·—¿ýío›ˆ6þõ7æüz;k‡2.ݾÝýöƒKûíb¿Ë^÷:{1êl¿#Vhe›yÁÇɤ“KF%§I0ã}’€d#ÅiSˆ:(ì†hìøOþš³MVPÎPAû *ñÆ”-Ö ÈpÉ›CµÎ$7­)ƒGය’³r–€áj„)az<8 }~hD^©ù­p¯XyÊ u:¨',¸f3foúp:•µ°H¦_£y€õÉÉ›óºÍùY“B¹É±âdº>(À´ü ÚhQ ƒ§5óx@*ln& ÂÀ˜ˆ°@&^róæÜw£5¸ Ãa{dÇïF‹E?z|~"ÙË£{áTGhü5¥¹i”Ss‰,#ÖpdEâ´…S’L¶q©‡+~¬Ž&š n_@ó“£°ýËÀ”_3…u¥þ93Ë“9J?\ ]. ò„k&LX4@IÀA]Ö`vFû³Î‡¯¯šÃ;+ ,{§U}ùe>Æéþ“ÿÊv£‡$dçÐ:Ž´ÌµÙY; ì0ðGÀÀ{o¾9xöêõ×Øõÿ?2òþ´^=s²ð–ÏNç5õ1êþ㵺 ÐÕþ=–£, ü’`e!>©õMhT«¯ßz7”(¢ ýKžœKz¶D….±Ä¹u''¥¬ ?Æ—‡ºepƒ¸Ë¹#6GæQ|ù pas@Y¨?’GËhŸõ~PD/Zñè†æS¨é\CÑ,ghQØ¡>¥±32 ªþƒá`x8¨ªCBÞEwý~‡)€n¿̉KÔ;U|‡ m”Ž0.OŸÁ\f—.1£2~HØ’5˜{hÁô@߶‰;¡ð9œcGÇWq`õ 7,ñ9œïf.§3Γ˜øVÜ‚Çdw°@° 0ŒêîM‹²‘lt+ !®„×ö±áht›KìB‚†œâl\Â8Þ! çîÞMaÝiûùœM”š†TZ1º-Xßò.4:ÜÉšâ¬/y¸CD¤sÜ€‹ÀæÍ(S-™ïBèî,šûßö|«awòü¨OHÿ>¸º·Z7¿Û{®³|ðÏõšoe™¹ðµÃÀ_+&×® ¸Võ/¹×÷ߣòÿ†W¬/Wc÷ýŸ,–nøbËŸ£VöþsŽŠg©¸®ÉU ßJ“-QÐÄ!Þ#(–d Á `C["2ÉUvž{÷Ÿ)VbðI›}6î UQô܈üPqœ`Pín3p”UÂ#Çmm"*ÂÌÚ˜AÕo¦Kœëwž_¿ÛÿØÖÇè^AÀ5Ìšæ5좚#,P‚Ÿ¡*ÿ¾½Û°Kàþh4x—mï2àúçù|ýÞhÔ|txx¸Dcêôf.¼ f°ÖÿðÿPs@ÐÊÅg4Â98f¤ÙcÍ«,EµB¦Í“þ¶¬ÖÏë“~ ·(l?~JÜðGš”CŠ’™êצÓø“MqnšÚÆQ ’]à´Ûܲ„o’•€³É[¾ d+þOJ(c×$;þpçÅY: Ù9Aü]®°f±*.FÌ´>à ¨cwQ5j–\h}­éß©î´_'JÙýì0°ÃÀ׃ÎQ©8G¥ÇJ¾Áqw0æÞæü;û1ïOßæèßé»nÊmkÑŸ“nª)U“>±©ù6pôX‡ä§ b·%ÅŸhÚÀœV¸²7<9,Õy Ÿètö _ÒT¢":{·)4ø„Æ;â' Uý‹@WSˇT¨þg ˆtÛbÑ].çóîŠE—سUmÕçëp>@AÌ_d-ƒÑ'hÐ JZÞd·\)©"ĵ¸ _†_‡nü|”˜÷ÇöËl܆ç‘u|K¿¡i³)ÎÈ.{ÌÛƒ2¢ à¸1/:’IM@7ΜĨ­‡¶¡š-†øZ2 èTWŠdŸ÷ÇöX*f=Â_2Ë/)·¶ñ:sâÞ¯O u\ùç‚@ÃÐ,tkpÜT½½YµøFg5½Žv§êì½|0×—ö®VãWð8áJ½àÎì0°ÃÀ×…ÎN\½úⵦ™?;뮯¬¦³ë N›u/ÿlÁˆÿäZɾFþK´®X·ß«8U ;làí»¸-=AH>á5ÎP9à„ÿdShã6erz-5:K‰/‚Æ"=ËÀ£0Q2Ô_àÌ#õM¢r ¢“¥3L$5,_Mo<ø=ë?˜>aüÆéÞä.¥ñüT:\uw€w(qÚ«†wûÕàCü÷ÝæôÊ•+ÓÉ$fbþ¨ôñ‰P—4¿úÕ¯d*÷øHÜ¿Å„€;Bmsý2dÿüª¹½†ŸÏ³¦Àìg÷cËpbÃp£Ñk meÓ˜R.)¼ý›@-4™Ä´…Né£>%²€‘( 6åqÛ²K’/fS@y2j i+åÞH!‚_S ¾[)iÍM€Çéï¸^,—¡þZW«IÝož_®WÞ-´ßéŒ_à ¦YÕô=&;—;¾X½w©wØaàÅÀÍ›7û0¢k¬Ü}¥·ª¯ –¾Æ‰ê}çö§¨ü§§3þ©;sÖ’ÓTe\ìÓ¨þ@­_"A ”sA¬‹a[Þ^ˆ䡯€ù¬µ6}Ê#Òo²+”6eJà *s“ý99Ù@ÀK%¨âÇòmÃãŽ\Š-t0fW/BˆƒDýòÃ*4Çe]@„›Sì N1+ @àìMÑV†½ûDVk§/¼ðÂŒTæ÷GÊ+[— o¼*©ÉãAhuŠ z† Ðc: 7çÐ+ðë+© H¸4dPMø¶QéÎ?™`0B×D#Š/BiRêd§³¿)¿°¹†¨;ÚkÉHâ~œ½ÉÚVì£)îâ7¬îò”¸¯ÿQ¦Ä§tjDl>¥ã»(¤‰€[ƒÐÔõkŽÙ[­“z½Ü_ÕËKÐxe8X]í fWº£‡—îÜùå¤iþa´^ÿõ%h> S»°.:è³^æÓg5:WË×—8Íï:wÍ^g{ß>3§ÕæϵިþäÝú³Š}ý1àqïZžèÿþl<¸E~þDÓ&GŸx.ò,YJ‘Ñ H|Þ0©ÞYÛx™µ#óMš\— Å‘"rF§ôÚºÒ#ýFÅ° ¾ã!3÷ûf¡æ)†d2ž ŽÿÈ[Ø«îÐrQ ª“«ÿ Mg³e,þc3^ 2j?æöíÛë·ÞzËÓh\9éê@þfÿ>ªòÖ D/·v9°Ž±°êó99¸6Zvüp˜s|lVÍG3 IDATϺg:!Ìùo§±ý¬ï &ùüÕÄg÷ãB&¯­‰6‘œ)²¸Øä‹#´þÄÉdÐ*&Ahxäœ#iPÉDsÇiÚ™¨³­I 2L+ým¯‚R* æOW„2™Ë"]  Hà3Ãjç%A0ÿX»jŽ9tÉ\;}n }ñ”8n¸\¡U£ÙýÙzÞ|ã!ïzLƒ—¤ìÌ; |É õÞ¾ÿ`À&õÃn÷ʲ×Ü\-VßXÔÍåZ€תºÕo†êß³ü髱NÚµÒŽú‘ïUú%©Û˜x$XÅ@\1E›¨íÜwY”\Â\IŸíâ%2´¶€þ”§¤H“ymJa)ÂÈsOÊ)µâtjÂ.ýÑã­}x¤¬ .ú³lmþ‰Ã¨•ÇÈmô}ù»®‚-ä“vu)x¸ç?b5!y0gZCëCvSÏöÅîÅ0OÔÈÌ‹þÝ¿ûwËçŸþ#æ­ú—.]â`¥þ¦ýã|1½tx<ùŸn0Á5\®N;3T]ÎË_ª|0NbÈè=º^Éæß›w¸“ïͪÂáò!]ìÖEå Ћ‘Yçöƒƒò‘J&ÖÛu´4÷# sFÙ›MoÆ´ŽÄVSc3PÈ´XG `}Š*é³ g£Õ6ÚFYÀ>{dò%&‚<AƒljëLÂD:¼h-jÔýË ¯Pw`ô”[±%°Ó9¡\66ûÕü~g´Únp¥7zþ]qFPÕÞ­þv¼ÿÂÿ…ì!+‘þö£Îßÿ= xvf‡¾d ¼óNg¸Íþ{úó%÷Ïß;žýÛÓÅâß³Èoÿîñbrx:‡Ê!àÿ°¢èL笤Fõ/í[!ã‡=1ÓçE«è4"„©Of_Òie¡-ÒÔ V’8«‹³å®1ƈ÷53‡gzòðDîš¼)iñJØ6nÓà Z¥-ÝÒK¤×ŽrÌ8`›Ã"“NõKEÉÀ5=€Q;ªWx‘~KkÍ‚Qdg™UØãê™Éîi' ˆÜ àɳõ|žÖP020ó#ѧÿŒÇæUýߢ©þ.O&¿eáßôª*Ô bž8@ À’3*™à4Zî§ö`p‡Kn„Íz–-ŸOìq¿4Z€ØÎâu±LŸÏ퀶ãt)„Û]áNp4,Y ¾mûÓYÚb|¶ÜÆñ i5“Ù:A¦O?¥ažõ—hS¬aÎúJè¶6¼ß¦vvÃvK»ÍEWJ“ëM’HÅOCƒ“!<Ä¥Kl M‰ÂI 8÷bn{ÜЩŸ êÐÔÜ Ô\§S]á#ð¿WÇS€vf‡¾ T¯Ðùß«Fè–'p¡=ºäeÛu‚}Y´Ûþ–HŽþõ+8àoô] H¶}_É¡ö#MJ $(Š?‡1áÁN¤ ø6¶Žâüœ)Q‰ùI6V"ŠýˆtÒì Ý./f˜9.„€”-¼@.’jª\¡° mX‚ã½A^Ü›S)jwš Tÿ1eÀúÆ„ë%ÃL§¬O/_¾<ûýïÿXl’Å×jž(@̸à™gž™cªÖ³ºføÎâVne#é1pæF>Œ«XCÅÎÇv;n twÖ•ZC’$mÛ'"SHn1~pnq "·lm[ 0ì-ç¸4r.,aÄž¦„eo±¬‚i±•B£EtÎuŽ¬sþ%ÙjÛàSæ)¥¾Í{ew)Çw‹É™8Ì?: !5sˆÆy­°ºökÅâ@[BîB®æ‹Å-nG ‹ìw?; ì0ð¥`@µÿo¼3äl”Þ»ûOû{ý[ îHY=‡úÿòrî˜=óþùËãñÞøÑû‡À•¿¡ÙD8°?‡0™ •v ÉÛÒˆ-ýHzE©BPŒ ÉÅëm¸ª¯J H.}Éàw (v‰ÎñgƒÃNù (]N&h[¡ÙQÃMl;m_hûJ¹Ò±ðXô½W³ ÛccO?q¼G,öËÌ_šWóÄû ÏèŸ|8'µ»pªšç!Ú‡cZNG£‘k×ßýîw 3ÈuúãYO”À¡½®—hcq*`}®uK‚VqÛÈQ© ]µŽ«_uóg4Ûg2'.¢]xñM l›ækö­†š‚¬ÛÚ0`S›6,§ŒÆ’RÚHÌ.r6Ha)A0x™ü&]‘.ÛZá6&ZõI¡Ÿë—ZÇûšØ#AÐŽ¢Â²•¹¾°ÿ¼ ªðŽìc¥c  IÔloÅöp®é€ÕňÊýç¬ÏV3Ð[’ê¿õz«ÝµÁŸë‹íí0ðh @ù——¹è§Ý;®¯Í–ËAÿ~Ž-~Ï.æ§/O§}÷øŸrÑÌ”jæ.üÿ@Õ¯ I\ð£-Yp7çw&º„Æ´çéô"F(©Ní)D´€ X’ê“«-û :kÿ)Í6~3à‰øœŠ ÒÔea¦5.Åg(gZ2@‰—¾pܳ¨O©w¦§Q^\YÇ”0çXTKBÀ€õcl7ï ê1]©ç ~ØA1;=atNþ\ Ô¢\xЪ? FÃ{Œ„8ý¯óþÝyÿý÷ï5·nÝãÂÚþõ+ÃËäƒáû£:3°#Œ £î6%ÌqaI  mµÖ`Bšå£)vòmýçÃK|ÛnçS a:Ÿ¾Àž7]Ns>* S•Œìã´0ÓÃÍ< HUz*‰Cx@`» ¢]‰â19“ߢºúââ™'ZØßïÌ`´€Ö™Ú˜ƒ½½{HgWX"ج³Ñ¬žŒ‚qÍ2 EÃÕYùC%5˜eì&D3íywq,&LlÍ"·•—á8êþ” 6è:‹M¥CØþeô!?³_» 6¬¤ROý)Z‚°„—>‡3Òf‡QÅnÞÛ\L;I¦È—›29˜7õ=¢8)êDæ–œò5,ò6`ã0_a\yË(†Ú0¾T]qGdÿqº5kœ/sG@Ó= »çî€[¹©êNX˜qõ`Ñ}ÀeMƒKÃêòÆ/÷ëjùÁprïµ»£¿¹ß{ûx¹œ"+¬§H`;³ÃÀŸ„úJïÝw;£Á³‡Ï÷¹mz<ýË;Óõ`}Ñ_.ë¦ÿáñê¹År5Z°CêhºNYs?ž7†G+Ôûjf,Ç ÞOÜ ¾$ :¤fOZ pÀ”ÈB:ž<Äg‹–b" Cä -8]>ﺘ⊵êù $u‰@ýráȶaú —˜æ87[7·Ýþ°ý±*©î‚YAi«/,óëCK=×_Ú¶O¾NeÆ~WýC–Ü!€ú²s>úÐÚfÅ(Kx„ë ˜VáLßÎb6gô?èì_ggÔhìÀl<½³7Üûwe"³½Ó4£8øÇú\$óD ,lXUÉõÔÃ`J^»È9UÃiMpfY2Ë0C;x¢©Â ƒ—9±ü.·rõzhÍ5è+tÊ¿€Øt¹eȾÿ€ÎœmP3nž_ÁÝáÿôCæï?éRÚxâ1 Œ[g¸ Ln,ÌÛé¿D´·Lßd%©ñ Šßä)ÞV@m„+°8Ïæµ ˜Û¶±°xΗàÉQ&•6™BY¢¬aÿÌCÓª‘úÛvEÓØÑÅt€_ŸV¡Êº4ài *{b¥€­Of3±IÚä“Ñö«j§˜^î€H•†ÕN´IÒ?êW𜜲RR™²èÏnJÛâíÀ%´¹¦Çf¿ñÉo þàæH\Ʋ8faRwª{ËnÝ,Upš@sÀ¢ÈëÌMJFÐX®/qv½¿?œ¿óÎ;œàè 9´W°3; ì0 ØI{³w šq}Ÿç„ÍæÒrQ_¦÷]Š•ýpø˜e$ïe?iÎßy˜ýÖ¿…†M¯‹~íFYLP„LÚîÿH;Ã?’œ´ šÀsáíDrëóFN¬iG…›à#OHÏ™¤-XoÀ'Xá# ¶*|Gü>°ÐÄz±ƒý«%ø™æ <Éý@ à9O­{ÊVÀc4ƒþCxÓÌÅVÿ¢™'Z`ÔÏ‘ÖõCÔþ3x×+÷ÿ‰o³ä,ÌgP½ÄBŒÜž›G`ºˆÍÏÈ]˜Ñ!\ÄÆ‘Íñáý„ÓûWÆSH`=§ FAä‡Óv¨Ðˆ4æQhjéÛHÂoÓ ½™À¤Ióóöi]±ï–¨¢rK9(À”žid$Ý8J· ²€â;cGÙ„DºM^úI±¦ø7Hâ`ZSðÝlÍlºäh#HÉŒ? ‹7rWG£Ÿ*É›³fÑYö¦7¼:éïÿíjÐ¹× †§«;«7;wC _48å¥7¥ï; üIc€~ÑãzíªóüóƒjQï3Íö2ÄiŸÐóóÙ|ì¶g÷øŸN§9WpÌY˜6C5=_rÎ?}u+ ¤~Ȥ3ÇØîk³oÛÿµÓ¾ð‘Ý|‚ù¤h™d&3glidÐV# B<0ÞÈ_˜ÈËtẜ–äGWü—ªFpÄûB ï‚UýAϵãaøGœnFð¬ê÷Ìs¿Þƒ­_qyóÍN¸ÚiôÿÀVÕ`ðA8œ úýXÍá?Ý÷Èîh¹lŽ¹ü'hœ¹]$óD ßùÎw\{μúêåÞäê¯ø®‡,ö» 3×¼ÄüX?VjòÑ\o¦$ÌÌA_ˉÊ„Ñ øàDoˆëo™ZÉÌ¢ä^ht”,ć”#f“Ûc4¾`ò”¥‰3J/Ã_àJ£6E”P(!]‰Ð.‘ÆÝfúqJW¤mdÿÆ*ùY‘WÊRÄt  ÔËØfâ@aEí~¨À"%‰aõ!X©%k' Ô¾ôØ؃é#MWÌ¥=ÇJäMwd\]gæMÎÅþˆL?ïžvØ$à Ï$µ“lÞ÷Îì0ð'™?ÓýÎýûãîzpyܼÊ4Û•zQ¿t:=Ù“Á/¦Üò7ãv?Ý3„qÎá ¯"Ð)ÝÈ?½‹¾½Œþœ¢_‹äÒçƒH#Yü·Ý –„DÇ5M<ÛÄ…aùðSb·ùÊÐs .ÁŸ¶l;鈑ygF¯ß¸€!ÖrR}Rè0ÇOŠ‡ñƒÿT÷{B ´6„ݨñ½Ä§ªØâ¿mÊóúχ™:D“ânBÔ ÄuÂà©F°òñâ º1uÅuÍô±Šó˜šI—C‚Ø!°@”˜¯õ•g;'‹Q§_ßé¼Á©É¿æì’%û7^÷»Æ·µd¾Å£*dÔÎì0ðÔaà?þÇuïÛßîtoÜètg³ÆÍÞýq5ïïuFëK«^³c?X¬› gœT,„É3JEÃé™'.üÓL7щîån­GöðÇ"²í⸸‹½É  XÜÈdw Š¼¤föõ°’ã`‘Ôp‹I“'ëã!ÐÙ\¶ôÝUó¦¿dY¦LtÏyc5ü,¿gAûµû Q]S ûÓÉh! ÆD'@ C'àãÁv–',ˆQs3F#0D Àj{¢óh rÃÝ +l.”y‘Žï £‹0 %1]›†*pÛ`ú¶n,_9S@ØN‘,•8€x2A''7°^Æ#€¬.¢Eh´-c:¦ÏÃmiŽÌÃ&DV«„§$N†êˆì' ¦-؈1Þ÷N帛2å,$ïLx”ª¤Âº Uú{ƒ)ÉK‚ÈSÁ‹½GÜ À"ê¬ß zUum°|øozuÅÂÍê„Ó±¾Ï±'”5tþ¿ãþƒ#vœô:¿¸{ÜéßYtN꼦`7=¿ÙÎzÚ1ðWµ®þÅ?Ú7“ýÓz1:š5>_¼ c¿:«WçOÿ%}no6_^~0[]Š#~áò‡ð³€ -W½Î”>Ç"@„p…z3O°,~ $…ǧ½‚ÅX*\Ð"z=$BštE[ÆåÒC˜°šÌRÕü9¯ðH-„I?ÅNë±r¸Ù–¬!áÐì=ÿ?  —1h.Š>2Ãn›ÏåóÒ2wÁXEÉÿØdbØ„0³6|Lš½(Ç#”—åtŽ&€w==e @õ¿31tÁfº¹†¸C³Ù½ÛïöïÇãCTÿÓÃÃù÷Ø´«tQÜOpùòŸÕ§§v¹|yÑ›Ž«þp:&`>g$ÊJu?š x9e…=˜:'ewûô ˜Œp^¶ÓïÎ`^ldûšÎåhV㤀l±0]W†–/›¶ÔXê]4$ Ç‘'îˆÃ(½ô³-sœ' v&SclÀ…“*ÖâGÚµ;èr¾Ù2EÔOÛ0“§5DÉ¿L[÷MÆ‚gc*ÃSŽå×÷öýƒï[Q ›'#Ëp € W$ry€»)*¦RPÈÐÑ<­yÈ6ÍÞ÷ªÞ éVH_ `xjpw𥦮î0­v1ì×ugx¼êì-Þ#/w~bñ©*¼3; <¥xõGÞÕãñd¾nžé/zÈÔÿãËïÓ³nvVÕäxqú2jÿ!'ÿUGóf<÷Š_:Gt;ÎþásZ'BÀbå]ôWé}Q†~èYt¤ó½i30±tÞ´Z$Ë0“ J‰3±Ò#§ÖhW¢_ÂTì¶3 S¤¥)MªPrv³ÓÀˆC°€ÈXàú‘_Û Þx°‚*“]Êy+¦˜Ì³ú¥Wq¹sýC< #âdˆÒô a{±¯›-”œâÃÉŠ ™Ra* fÛŸš€þ¨ÃžÌ}¶þ<öÖ ŠÐRÚ×<5‹× ž[/ë)msêîæqäú,,CûìéÌ6F¦5ÆPóåÝ‹ñ¢í¥9™¾ªë$ÅÊò¢Ùå/•wji©y¥f¶i{щ,MEYö—š±-P ‚ʧÔ”²#ð%Ìô‘i“2+Á%,"#c MíŸþdRLñµíM­À‡•íâ–˜(LÄš mvp VÄ{«"3‘@qxæ)µÍsYÂÔ5§ pCç'äõSžÙaàéÆÀå·Þê­žyqX¯—ûëÕú Y­ŸeÁÙ‹t·›h†0ÿ«0ü¾êþ%ŒhÁÀÆu¡þÏSHÔhæ tVÏð°¯FÇÔÊNý[ ÑÂ)DÅ“ôCžŽZŠ b¦ç|NúS˜¿¦(›i]Œ's8™~6-g¢—rlešF[oü¦à'hÜ&>»ÍÛ¬L®ŒQ²v* ©þÙºD¸ÀÔà°\ÔìÀ嚧J¨{«E5ª¦YuÊâŒ#æ²Ê¿F³*“Ki’ƈNÄ©:Ìí2v>OÄE‹˜&6´gJv¦A¹‚_p™­ÐI ™o.gÛ2ò×ýhS¢‹Ûò¶• ¢@bÐAîJ˜b§ KáÉŸ_$y>Ão^¢RüØáN~§[bQ"£0r‡¬@9½BˆÂÕ‰:v> ¦äZç¨}µê6×Á 5é¿?à¤!ŽdB\õ~ÖùYû>Cw ; <™øh<î]iN&lì¿Æî¥Ë,b>˜¯š#ù üúó…[lYøÇŠ<é‘ŽIÏìoôIGýe¿ýµtÓpCIR•j}#Ô# #ˆŸ G‰þ˜["OúsA¤UÙäД£žM€€Ù¯3§'§MžÆGxM=S6‘F+ Iï—²)4 â’5.ü3Ρ!áÉvø$Â\ÓÓ;᱕üAgÜ@böçØSrâ€:V †>!¿ôµžà•W^Y½õÛ·> <à”¿ùþdï§2=_×ËK¬Äø¦4eÜÐAKæpøÀ=Ö̘X³€³ƒ:Ü%„èøÓSøºæs‚-–ŒjQ§Ù‰l}uÛv"I[æ€6MÀ6„ämsIóe¹Ó‘†$aˆf=lÒV€X¦ãÏcw“Iƒ Ô¸(¡È”J¦~AmÓo’®•Z Éå›e$¨\³ ™Ï#íTnŠ²(%h9JtÔdè[¡«¬»„ÔÅ H^l«WŒþk1WLpO;˜8=°7 ãpL©‡C¦ºý½Þdÿ6G8 À¬ÞC`ã®î+¿R¹†ù£ÎèX;³ÃÀÓ —û,Oç/C?þ4ëÊñÑÑ_œLç/²Øï «û»=8ªbÑ£Ò£¹çѧÌlm£ƒÊüW¬¿ñ‰>/¡ÁQh‹‚»qhñ2J à o0ÃÜÑ ×Æ›…«K¿„Q}§+üjYœ`Ѐ°VÂAKZq®ÀOæ–Óà(+ý#yz æï°+•cù†¥8õè•^Å /èÕñöcå¿6G¿qÃÏÛ‘¬5~äBÄÚŒkâ@p'í—ùïs-óü–¶šL&w i¿£àÐ:>|øQ¦ôF_LóÔ w=X VÍÐ}yƒE·¿žUõŠó|QÈô˜g†3FC,Œ1$;;‚’]’îø•U&cãáQA¯dØ6úr>ÛàR`ŽÝBµÓF‹4 D›·éô·ŒÁQ¬#úÈw“9P·ý&,aÚšb'ß—÷[Ê•¸ØÁÖ,M}Œ°<ùÇÎ5,¸]sz:R‹jSçÒæàF»ÝAHîŽG NØÈÔç@Nvjö»ovÞüª^èËCÍ.§¾ LOX}´G”î³o!{Œ 0Äf¼˜QhÕ`ü±>ÉþE¿‹ÏÁœr%JWÅ«³<2ÿxW×Gõ´G…µÒ')Í40ÙÉÝú¸[˜œdc”„؈Í# ù¦\™½‘d œ½°"ý&³Îù›«ñ‘ÆX K÷Ö pqIg€QÂËš¥SÏ}¾×þžM´M~a\Oð³Ÿý¬óýïÑÌšõåÉèôÁÑü‰ôP®Ôï9›y ²œ+[¡:S9 bÎÚ;²Wž À‚·z†f€ë‚½Kˆmkt˜š':·íÛndc cœîôKh4Dƒ¢!ëˆ>ÃÁÐ*Œväœ×Óg Æ xŒæK2¤xcýsTm=#Kr©E¯ÆŒ5º‰JÉ)?‡ë/`)/ëf‰$åÇ×Ô¹¹’UD¤ÂŒÉ9h[£mOÝä„–…¾@™,–‰Eܬ\ ¡õI IDATæÝ œ °höÈ9v™Ã‚l©ítç,tfƒ=à\xÙëszÀuºÕkëõü{ªËÇ«ÅÏþó'j­øæ™$Ý™žT Ї»o¼ñFuéÒ¥.íºzùå—/s³\ÿ¤³¼~|¼|‘{>^dåÿå“ùüòÉb£þ þXèsþnûãè_Ö@Gè¬ÎùK¢ŠiiK2öÓäWúI„Uzºqƒ$áÄK‡Êª „t¢˜ z6a:ML4G¥àH üDÚ®' Èq™´¤‘=`¤qQ~‹‘z$ÜV §Ì¢ élw?yÄÞ X‘ÔËÑ¿Eõ±!ýÐ&ÞWA+,x#w^9€±Ø>‹þ8¢8å~HÇ°ðoý!Zƒý~}4ç¤s¾-QÛ<5€çübý‹ãázØ]Ð_Oæû¿çÀßÔ½úÊbrå…n‡ó2`þKr˜ÏÜ7ëê~ÜSÃØÀjЊkú( 9eu÷:9%FÆz>¸g=§.<ËïJ±ñD²ï°\­0ZǺS—À£Ÿ†§ X»j8“»&.X©íû«!6’Ø-ÔÝ ØAðʵ‹"w?; <‰èݸqcŒê¸b˘»Ð¾S9¨æó['Óé¿:Y,À¥½{§óƒ‡Óù(˜=–Ã+Ñáô+hÇ”­Ú2þ´ËÅҕ؉›§ Sÿ¤.­ šaÿw`ÊÑÀä :¦Eã*•Dªr7Í& ÁÒŸ¥>e—²Š£ˆÏPÄûðÓƒ€,A¡¡Õ6ÖOx´Ãü±6ËzD*#Òäºi9`S›¨ÛíÑnÃvà•¦v™»'Â]C4{`\®Ì#U™ ÷”Ìfn÷ƒv±í¯‹Ð5wl÷ëLöC˜Ž†Ž‡ƒÿ<™Œ~CªcÔÿ¿àû݇§¬m:BH‘È‹jž@§û†˜Î¯>üÕt4ì7ÍàAƒ=è7ÓzX5Jtp_BŒ2q£X®n\=븒Naûtþ¾Š“m_¤¡Á¤Ñ®ìÔž’¿mæC645ÛXv¡h¼Áàñ´ ‰Ádf*¬¹&;¥³3˜³ö¦³EŽæªñ¢•FaÁÍ ðt]2ðT†Qš žÜ2ÿx°| #I?8H;êì›fw)E*N8dæ’œº€'4ѽEpœ€lfsÅÅAg0s³Ö d83Ãóèp>BCoèegׇƒú5ðþíÖõd|:ã$”=éä¦Ý;³ÃÀ‰Nøë±E¬bÔïÅ>#Ôú7±¯qNÇ-Ü/±ÍïEÈÒ»sÊ(ÔÑ¿£~5±x™nµ`Ô [ZÃ)[!Øý%Dcµ &>\@Ý>Ÿ†ÂÚ[#2zXiKbA\À%ÀH „ÑNF—O(e¤¥Dcëô'jž-LÀÂð7ôÈ… &0kŸH«ÛRrx“1’ÐÈCPX?dü(HχŠ#l)š#ÿ(fÀ¾ì5ø³W"ІCÒÅÀSúÍh4ü‚Áüxrrrij˜Íf±÷Ÿí¥RÒ~ª€ †?¢aaáÝ®§þ3`_Oe$òtÜ(û×ûÄÙJhØJÄ4|$Q}ÄhÜ03 mó"A„»€h²))ÎÙz5ç‚·Àj^~¬œu³—;%Š_Áä\XËûè"Û_ŠÛZ$x¯t"ql ]Œs˜"TlNϸK€-4] ³hk$µ†KOºC¤õ‡9 NOçÿôŸv; ^wö“‹ëׯWÓétf2æa¥ÿê*ÓŒ×fËú Ó•¬DIÁæa°âÈÔ‡>dJwˆ¤ ¼Ô£2.¶Ýn‹œG…mcϺ¤)…ÞèÔDXr~áßMžäÔª—E”çceDùœ‹iûÛyVòJ;“RºMÇdz (òÏîP AÀ a¦ñ)óþldå¿7Ðv‘á8{™%Ýhr⛇º&à\e/ž÷©X™‰ºÿôIú}ä´CNd?yóþ²Z^E#ð ‹4þ çÀ9³9w:×ëS¦˜Ó9=í°¹–*î=ÔÑL 8úÇ[BA¤˜¯Ç|¶.»_iÄJœ!I óN): L Y5— ¹!DíˆNmœf¥ÄjJuÅMÊ‘¦ì•h­W@0ÂNQ¸Ô†ì6I¼Ò¦v)i$ù¬?¢d°qûg6Ö¹aÚ$U ¦n˜‹•´¸¦„÷c“¡HÍ‹ í§ÿ±Sà!kÎ4Àd°7®n4«½Ë¼Õ1Wjþj2Üÿ‡Ñ•½î|µž~ë[ß:"»ŒÅTúîw‡' wïÞ½¶··÷/aÏó\¹ÿàþÿã¹9oÖûGóÅåÃùjàü¾*ÿ£§Ñ…Ðá’+’#Äe4šÚ>5«þˆ.‰?õD0LÄý!Ì(÷é¬Ü b¤!òÀµÉ+ÆÖäŸÿ÷/±ÕB㌭v9ª@„Í0Üì ]+EXß` ¤ay"÷2…jÕú©Lé]*S …;ª¾ÓŠÌëCœpÄï)}ÎøWËëý±‘½$ÕµUR,WˆÍg³Îá–1(éC³„ór ï¸Ìªöû«=X £{äò>LŸ»™æ˜Î9á»Ö?øÁ¤O[$่æ©ê—9 ûÝjÅ<þL­~=X? EŒQ—Ïç¨õ™òJÚè(Ó!Y«WÂæêÀþür¡B¢ñÙˆ¢ÙmnZø[ÚlxzxŒ±šòýKÍ¡¹¡ê;³ Ï0ž !Ë3i"ý”Ò"M+ÜN¢@rª Ø‚û¢N™ÉÜu›b²`Ä%‰_ÅÊôØ2ˆÀµÖwn³ásüýÞª_£Ã©û|”ë ãu³íU¤rûÆÎì0ð„c€Ñâ†úò,Ï4cÏCƒn±0yR/ë>ƒJv*3ep‹• éT2y´wЫQK¶þLÓ6ïs"¨ô.í¶»åœ‰Û&„ý´²Ïä—h©ôÌàò˜Uø¤§<‘$G¦Åˆ’`Î¥²Jº"D˜C D¸.Àp™zä³’}‡Ú–X®Àá²L("@²à} 7£Ñ`Á¼ÿ Mç1ÕK®7_ݾ}þ˜‰4ùç©–oqtxMx㉌Ð×±2=΢¡xô­¬ŽÜè|,! Û&#z ²¤~`‹Ë.¬äŠ6·ñ´Ø¤m17ÄÈ÷6­ JúŠVE)AHÍ8{·Á©,[ø&ƒHœŒ0½ÅÆ‚Œq)÷’4…Ÿ±Å]즯„¸À{z0È %ÝâÝû3°é.fš¤ß€~oÑœ"”³  âøàN÷Öºw‚g5­nÍ–ïþï(Ö«—÷^âÛ(þtî#ŽÝ€à@Ó=æ-GlLâZ_Z5}Ä£}áý2úNB ïÿŸ½7ëµ-»îûv¿÷iî9u«e‘IQ-‰’2C6D#H‚ä!y¢^‚¿ˆø5ò,ÉSà# ƒ‘Ù–e“X2I‘ª†u붧ÛýÎï÷kî³o±JÕ¬ª3ÏY{vc6k®9š9f·‹6R¼-j!¦•¹u‘â n5k¶ âîÈkÏ¿€—f`ÓÁˆŸ•¤ÙñÞ¦±¼À@‘Éšéà>]Áw©¬ÊÏSŸÀÖAÜ]~ JŒ/WTÐ…È´khrÍí× ®!½¬úïŠpÏ›ÿw‹¥‹«3ïÏÀ$‹ºhð¬@}7°e㤭¾“t¦¨ÔŒ°1»&Ð_bQû— ßC€˜€º0¢× W“ƦqÙFqÅ ºÍ´ðŽ]«O½ ÿ¸¼l39ïøÇùKéßAx›é›§Ü¼ZêSŸê:5ÿ™ÿùX îž² ã‚‹Æ,¶9žÍFÇ«Õn0™ŒÎŽ§áÌ}TÏWWlõsK LjyC×âÈZGÿˆë½ÅÌ[žøÌÜÂ9yÓ#pÌ]†Ïø°0µÝæÿ¡aNw¢†¹ºí2Òßèh>{‡þ"  Ò5ì¬t9ìÊžä—é!q§Â`º¶²hå!“-t0GñL“Ü-O‡~†Ø!å%ƒ09™W™,†lnìn‰·n¬¯†ðäÕ nX^õÝ &¼ˆšk*ÁÚè'[ÿ¶}¶b+8Rð„@ý›íEoµä~ n :êŸ}ùh{ïKãÁ{pÙßé©Nì“~´üçˆgo€æË›ÞöÏY£{Ã*ƒù´7{HÙŸû¾ª[í;s׋-®qpUXÞ˜Å*Óñzý9PüWÁ´WèЯÿ?Ñ‘_Xƒ<,Ϲýš‘ÿÑ¢?F|pØ“Qïf>q\‚Hë)tÒ §'aæN•\þ_.^–€ O‡õëm9<†þ6`N Ï MžDÓó¤¦9so ΄¦ë°ë?÷KÒuqódQ 딀y!À®âÆ‹íüÍ®æc7k(N!ýOÇ-¯þ½9p§¿¤úQ…gAÍ}LKÒJ2/á”v[kv ߇ ©i9—¯ý¶|õߦo±fäan·ùYÃJá'Q9W€‚L¹ ¹sã¢Ô‚ºn¼Lˆ‚¼ø&„yÎxäk)ÈHÐ\`É<‡ôÎ8ßáÑb±[Íf»á°NOÃã»û>ìÞ…ÿ-¶À×èÀÿüçu¶™_]õ¦ÜÖw:ØlYк;£Ó_7/Ð}ÏéÓaäj s´/.ús2KÕöôƒ2jm¤swøeÀûÍ¡z˜dxH—DɆ¶…†ïÏí/öï ™´2̯=:z>¨ò4Иԧ³›;4µhAßþª=ôíõí“ v„ŒÎo˜tG[hçûö‹þp;õ¨¶^-jßoåZ ¾ƒ®¦¤Q¹=a~Á¸£¿ö‡N\0÷u}} Õ™9-°ûêW¿úƒÂ†ÍÇVhmîÉq''/]Fë‡HÏwn°ˆã?0wóÂj=:›MÇŸï÷ggŽÂç›K:d$í9Ð]^Áâi¡c:É)2 =´r×ïÁu85 )#yâ gu®*¬Èؤo,P{Õ,*6™™]ÔK—m]ˆ¸*Š.Hg (qÆKš!krì{»Og7Hî"˜×TdB;¸–¸‹©\«Ì}Ðûˆ”Ю¸÷A´\ʶœÈ©ßÅK¬mÎ(FyÍ‚TãE@»ò±xwîØ¢qFÀ M̤wwNõ¾¿™~cÔ_þ<»5.Ž‡KÖvÌÎã'ËEÿº7ýêó¯úc5» ¸k¿ùøï÷&GO_¿î>‡*òäòbñ˜_þ»¨ð_Zn·§O®çSqxÎýòÏb»Íïz~ƒzŸ]H ÕrÈeÐ?gýŸQ?@¡Q”ñþ­–ïyL,$h¿ÒÝjt–þ˜FÝ0ÚÍd-yÂÍJ`-ia—u—F¯sèR8ÁŒ÷2'¬Ê•“7‘0Qd^U& üïÊHBiVç7MM¹ûÎÊÌ“Ã4¦¤(sóä¤?ÊãðŠ¥<ÚÑvÏAeìõ‡›÷ÖŒüwœ·à¶dï*±îGœ=rr|âÂ?Ž/ésŒÜöMÚú]FýÙÅqÉ]3+ÿ±jÏ7|Uögú÷c/|…EßýîwoÖëíøÉš)?Ò·ø€÷6››OsˆÃKt 3Gœó+ЊI¸5Àr±ë]_Ëøé<ÓQov„à¹NXRuVŽ &ŒÁ‚nˆMG³£Q ³kè¶ãz…ÆEp;@;±ãŒ| ƒÀ‚Ñbý‰9! ¨NW‚5®p'áÄf¹JB•dÕjà1ÓÅ~ŒÒ„aÚ1Íî¼V!cµ‡?øIΖ5E;W˜÷qŽCb–)Ö]¸ P€ڗ:ŽFÏ1Á»õí8¨BÑë{¸Eâéù`6û5Äï5ïøh0üçw  Þé#°1pwÀOú,wñó-ð£ÕÃÉÙÑøU¦¡e¸ÛžmÖË¿{3_üW0n›áÅÅ çú3QÅ©¤—Ì;kˈæ7ó0{û­Wl=^ÓïÁ›ÚÞ'ªÛWSu ¯A'_ƒŸ†fŠ¢¤)\ïõ€ƒýˆ6“ èBÃyéPÑ¢.‰\5ÿÒ/]¢.\nÏÝxIoŒôÇ©ÔÊ€®ì0zH/ɉ'º'Œá±’.evþÚÙŒt y¬jFÁ€ºòô–7Ãá@^ø3a¿îûüYæ oÍz£˜ÿŠo€„µÿÌí‚ ÖfýËq®P°œŒ&ïÀðßfëß%‡þÜpæ?"›õkC®V‹Ÿ}ûc/ø ØŸ¹vŸ&*·!ê¯ ~„{9Oè(k÷…úÑÓùì]`wpçˆ`i˵µ¥‚3Êž'Õ`þŽæígê€Å;DæQh$–ˆºÆÄØ¡q„Á‘†e£{„ç§r*xyL[?9$C‘‡í–†8Klµ œ”LOB³Ë¨BÛ÷ ¾a›•Ïß–iÄI1F†_ÓÔ©ÛÚY¶ë-üËî4«LX#FDŒœ¶,ÎäxàW £þgöÆžöçÌ«^2vâÐ´í ˆp/<Úý‹å[Ì~¹÷…õ÷Yýv |£÷ûÛ¯ô¾œW¼Û)`›Þ™¿J 0ˆ‘D3íþ¿}ë-舗»Óåvý#‰W`Úç¬ði…Úàœë|aø«œå¿`›ÙŠ+}¹î7ÌÃK"¸ÖQ~ø#ŽŠ>%|0‚k¨FºõÓêYÃC[¯&t¡‹Ö›À[;®¦Á>Tô§²jåJgç ¹4ãø;üî"£ hÀ Ýênô,™WpœØ>ÿÛ¨TÍðZé¯P›Ÿ¬öÇÎz,„m‡j+hNûAxpm…OßW{ Rƒ­Çl”O\C;¯á7<÷»ðÌ™"ã·5Ÿ`ǨúƃX8ánŶ _Æ+5ý„¾Çܾgÿ7„c¨ce·nØhgb8š^íÁ4Åáj:Ö<5. ‹œ)¨Âý­² ²¥-¿öd„¡j‹>cI©¶¦1öòù[u ¼ :s+§¶\ºÈX•¦Kš©F—6¯wWI.-ç³I4Ô»‰BÖCfÓ`l9ˆ†âý8ºCí@ Ɇí\ƒNQÙO€ÊŽë„éºè X©ëA(¬p·îxù78¸æƒÔÖã›y–Ãå ãg½Éà ˜?¬6¯÷¿]öXpÝë½Êzß[Þ öÝîÂB ¿û¸w2¥32c8ì]L^¼ém&Hç×Ó> ÿØצñz¹<],–¬)cPpÃþ>|„˜¾güg…)ÄÀ ON.GTýG 2â‹4IW‡©v À‡üˆˆAÆäµ=9R©+.t© þwY·”-ó=ÍiXó~;õ0ÝûŸ–ù‡Ø-kmu¬¡‰ØŽö¥‡*Xu34Û?2ºæ§)“TbŽþ7jp» P ®R³ëÀ)^n6<åÈß'Øœ'Ó›Økæýç $—œøWŸãCêú³ü±”Î0œ»}ݽùx4š±›Œ#7˳³ûÿPäZ±õãâò #ƤL¬n™p€ï‰RCn šL‘(Y p|Úæ8Ñnè‚@F¤èû)è†þ1@´coÈŸ™=è+t¼º¨‚n7Ì7.c]Ñ#à.uX‰ÀJª®”5¯Ä“MòµŒÎÄO¿Ž¦‚0mf ÍاRÄ)rïC`´I ÄaO±|‚ã·I )³+Øz»Ö²Ë !8 1Õq’VmGÂØ;$³U|Óù—6²(к¶ºigÀÚŒ#Tw\„ð¥êÝûQÚp4@57b=6 sNÏú/ÿãÑ„¥É9>Y Ï–,àáNáÁ=Ù®þd2=d¬uI«þÇK®õÞ¹zÒûÒ»TÌs"îÌ] üT-ðƒ§,F™_ÿâr8¸¿YnO·“Þ?¢£¿¸èoÏ/ž->{=_~Å}ã'W×Ó«ÅÍD†¿†Ù?¾FL€Ã¯}Þ þ×X·B8˜NªÜ²%@Ô-Mñ¯­©H.‰ÐÇÀ–@ˆj<¦Õ€îx+0Œ=¸˜3/€À”1•¢ËÈôY1—`£ÊHËä´Uu¡2ü'—ZaWQÂ18,±åÈ!¶è;häF„ÖtÔ(~#“8yxs«>i'¼ÆVSÈyÊ¡›ÎõϨ×ù[½#ò÷É@Ò Ü^Lú —üÜ·–Âä'GGÿ~zzò‡Lp²lï÷ÎÿgVþ?s}ÙW¾ò¨îG×|ì? ÞÞ´ý½ßû½íoýÖo© PÃYÜEÃÞNG›[•)ÄûÔÖ<R‰wh<(ˆ%„à· ÏfqºŒR]IZ½¨ºX:º×ÙÄÜp€Ðc·,së*üèÐ!éâÀlÅåCD7µy{`ˆUl¦àZ®Fè>°ñïº`iÊaú–Ï_Í63Íûl*ž*v/À¹>L#t¦ í½ð„/#é³Í½LÈïÄ[¢ÂS€f`8†ä¬ÎÕÌ8%`Qy;îÆqû?Bºß Xøšˆr[&®—Ÿê½Þ*E~wæ®þò-ý@ÅÌÓ Ä #'H¦/õ7»Wè`ç åK¬%Rí?j£}¦¢àŽ²Â^îã¶Q@[~¬»Fý®ÛÀÿTÏÝ01±Á‹çüùúÛñÍ©!@³<@ c÷¸5·~]¡]xë_ Âüñ5ðC[wóúàÇ÷J?ûw4¾{ì–\['Ãþ)!@ꑇv̪ÿ42¢k¾j  ¶YJy"O‘Y7°Œ׃éèñp:bêx÷”ÙãÅoüÆoÜ.8°JQó‰Ú·q›š€-WprB Ëʆçô¬·Pƒ½Œ$‹V`üÊx<™àæ!TCHá"GÔr1Tº €Þ|Ha×Þ©†@¦£û¹•«ÀµîTh¤}ÛÍ$Æ,†h­¤~²ƒÛÞYPz0IØ9ÝûH¡ªÐtî`je¡MWŸ"0•Iª»¯(©;˜ƒ"ÚÀ£¿ªÐŠi¾Ø]ÒƒÜn£[œ!º+ÿ µ>ºb;J"ÖǹÒaF.ŠŒ’h…¸Åœ{!Æ^÷„`ÐçæA# ¸ã…Þvò™Á`sŒ†ä1s|?äöÁK¥¾ËãÐß 2÷û¿Ät@£4ÖèÎܵÀm üîïþîà+_ùÉ‹Ÿ½ Ó=xnÃ_añ«ðöãËõâ5F’/p|ïÉÕÍjv3_õeþs´‹KÖ­¨þw»Ÿ·’:ª7N•sæöéèn=K‡]ßâéÊ~Ì4llvØ°J¤ëý òÐÍ1@:tH±K|¥j‹ôŠV9ʯ´IÔò»ÍS@‹a o¼/:Z‘ä¿~*I¢ÔŽj’ŒWŒ ð¼7ãQ×óX'ÝÔ?ï]PcŸ?ÆeÉwaê%/ƒÉÌE‚®ê‡8-øN—ÜöwA^Wóù} êÇÂ|¢¾˜±BuÃ4ÊäñðûÇG“ÃWï8=9=þGãÙèÅõj9¹âÕú2H9g:`׿¡C0tT5t¡v(:7BÅVÇ´ IDATJ1OùkJɨ”°(ѳê_IÁîi_ÃùO|׳±ì´"¾¦Tþv~“6ú0 ¿L$ÓGÕ≠"i ³4™e•jýnû²û]“̤ù«¸B~c*oSíM—g‹Û‡8„¶©[>¹uq·ñåªriA*ŸQsËâÀS%Æ©ÒÛ¬8[ÕË„\›vĔ̈“gÓuoɆþn8šM¶Ÿçbˆ™®¹Âÿ`6œ>aÐSr~põx|sÍm¬Üé½ùÁ¾ù”oâšzÙƒw¸sÞµÀ—¿úUŽë½ÀJâÿ†Ö8]^¯?{½šÿ&}û³¬â>¾º|‘m|TúÃËùšÅFKNßq‘Ï]ÓŠ2úò@ ³ùu*(‚€$°[\ý à é>t"41.;¡ù ¾Éc€“Ÿ}XC^ ªðp`³˜P =]˜!I`"i[ÜÅh#-©´¸¡•©/¦lú$è¨#nM+3nß³…ﳞX ¬mîت ~Üi} nÆyŽ¹io„°«KdF K¶]²Š?¶´ïÞº=Ÿ@èOOO{§Ç§¦ÛŽÇ£§œ'÷æééàÏ]ü÷Ë¿üiU• ó‰$ì˜ÍüÁÜ áÙ£žœ½‰¿ÜœX(HX¦«îÁB cž™æGE$eš3iwº?'ÉÜ’¦‡ùW „-‚'ÿº1ÁØ° Ú# p]:] H’5Û[ Íͬìø-ËC"Qa)8’C[hG’B@Dj‰ŒÈF.Ž¤ÍLþ§p’Bˆ©0¬.HhM—Eì}@Ïÿ§ivùê÷0,ù%¸BS‡¤S5šŠ¦-²R—ºZ߀m¾„u°è­Ù*8jÓ4ÜáÀºñsñ9Áþ´c1Áöe¦y¼ƒ•?ý“ñx÷l¹¼Üüê¯Þ]2tømîÜÏ·À+N“Oõfl½ý,™Ã|6Ÿç†Ë_ÉÞ¹}×ð,™·WÍ¿X¸­ŒuA0}·ù.Œ$«l2¡gó'¾)˜S^gßOÿ/TâƒLáí-¢6¡[\…5œm?f‡ˆû¼Ž[NhEË$qÀý˜ »Ƥ‰.G¹+ÌÜ‹Î÷OK,à©¢ŠÑ+ðTŒøÁ}éž~é¡«þK}À¯Û°>§Y–.þó›ð½üfÑÀø‡G#´‡.c½gL¦Þøçá?ƒëŠ.Öëá'ÊÎÑ"ðç8¨ïGÅù‰ü(_ûÚ×z¿ó;¿³cGï•WÎÖ77º9ÜÀM¦hòï.YAή2&•9ú!#q>7‡ÏÂ\0¹@hK‚èYŒ¬‡Fö".«ßí¨ïY¶ œx§Ãå61ìÂʸՙ[ïj¶y±t¼ÏP‹[sè!±^ŸTïê@h°L%µ:$_Ъ‹{¾üÖøÐ]yÖo•ÕʬÚUÙ¶T3’ÅBzÚŽ9~ÛÆ6ª‹==P¸ZÏ«š“—×¢öØÃË70Ï5S¦\¯±Ú0M‹f€u½h †ÃùêéY4Ђíx÷©9 Ë Ö«§ÇãÕäÿ^~ïòë›—Nî­ïõ^BÒ—dÏVÿ|÷6¯ö_eÿÁÅîŸôÿÉÇfÐÚû“jÃd[§ë¿Á!\ê¬^ÿêánôx~Áý=Üü±bÉæéøº·›íVóW¦›Ý}ºâ[MOìë/¦îíqLB'´kŽßù}>ÓV ¡‚»+Æ\Ô[8©@`¿v* 0Âï †RþÑB³;¨=lK³OâÊ‚°ò™MçҶͼÒgïïÜrWV{: WÑ·¼áÑ]Ú.]K£mÉÛ ÊèÚ·AH½w+ªÔýR³g¸ÆÃh·~[UŠàak^Ú&ó÷p÷ÿ; $æ`§ªÐ4~})œûŽ{ ª¦Úÿ†“~·ÇǹCfǾÿƒ†ê#ln[ý#ü?mÕÒ¿ñÆ/1¯óKt¬—æóùÙÅÕ“ÿŽ~óòbqsþð黟~úôÑç)Ž–KÎ¥_q¬< ЦôÚg=š3¥¸væ~Ù <Â{t9Wò3ßçYö›§¸éhŒL{Ý7µ«e­úM½»/%UÀ£“8T€#‰ ‰Ó‚AçVÅØVþÛ§5Æ™2i°3׈gï7Ÿ./ ”åaíÕ8‰—(ª»‹//°ŽYÊt ñøn-¼Ô'“ºÓâš]"†Bˆ!  Ò¼Ä@vÂeþŠFq3„™§ô_k°LÇuMÞÙÀ‚ÌZš OØ! 69E­w ç3r©Ãl|ïe3M“Ññwz/Ьî¿ògä7 G×Ìü=<O]<È8nøÃAïä-r½FàXžö^{ò»ÖNuï~>‚-@¿~³÷.G¼Œ9Å~4_M?Ãú’#pþ„½úŸZoWŸEmĶ½ŸCmÿúzµ=aï÷äââúeTþ#žé|±ºÏà`ªjÿé…'ù!|ÂX樚oØã/N,a: ÁU5„köx1­ù‘TO odÊ֬ºƒü¸ÂlÈÄ•‚Rƒ`L3)_Ä‹Wªí1µÓH<*œ‹&³œà ÂZL<âXæB( —s¶a7NnY54ðœök(.²‘É \:Z›U¹Í£L PÂÔiÃÍgÒ姺ÿˆªd#î{8˜Ìôì ÀcWi’F¦?€Ëø—öóàÍ7‘öëªßuwå¯×û~æµOõØ2GGGzþ ߢn þÕÉìäÆãÙãù|¹|çï¾ë}3]%?ÒÖ'Nà×¢†³þûÿ½Õ ǽkpv2ㄹ›Ñ ×;ÂXñ?êÏ^é40tÕÎvêá’›¹hBþsš”ûÓ‘.Õ«sÆ ¦Œw°»Á#¿"ÝX¯ÈÓx‡ñš‚„6t†Îò’U!4IöQ7 v•_øi1v~±¾°ÑºójníÀà(… 5da@ ‰JìÄäUá™ W(kš‚­_=‡äSåXñ¼Òy¨†É1Ù¾ÆóÛ@eO,ñ€xÛ M€g¤ù ¬Ìfípý1·;£³ _É÷`BoÔ‡v#"!,x_vínXspIÙ§U‘þ £‹ zÇÏk«/÷š/pg>ú-П÷.a‡SXÇt<Ü"1û'lFQr|¾ô9zÛÉn»þ%úÿçé~'ÞBžý1Ì¿°Ð¿^nÆ ØîÝ¿¡wÈУöG  &@}E?\3EÞN÷æ°*Z®„wq£ Ø Á³àØŽ[HÔu»=M6fU»9“o𨋻‰+püˆb-»"]Ï¥m”D`’›@'0žxZLÝ .žLMÞòÕ®mÀM\‡×)¼2Jªü€Ø(€òÄ%IÑüDæ \Šª,#så˜?/î¾ ÚÓUê[„÷ù;òg:WZž…Ð:¾BÐE€Ùû?mÐÿ^2Èûu½`±øÅàÞp5™ò¡yÞ!ÁÇÄ|"€öí8Ëa3¿|3Ørî&,Ÿ™€K4‚³-÷Ò¢2^2’´Ò9ìN ,ˆì |ÅeÝ;úShØ3êÜ5’5½Ýn—'X 2”_$–•¥Çu|/ÈChŒ¾3·]žó£;°š·/ÀDui˜^Ý-7Ývò&!Š[›ˆ*¶+£Ë‹˜ü™Kcå)ž™ éS€“õ•›Î_íCs뻯|õ×ÛªWù„¸tíQE)pëªï Ó5žÚåÛÛãœU²ª¡`ú¢€”ŸªáUÄÜ6ØçôÀ©û†%!ŒãHaèôhõ”)†)ï6ñ3¯×¨ƒkv <`5Á 7 ªÉí}³÷MßúÎ|D[&iü-“³«Á˼§Œz›é«èéï­W«sv½¶\¯_¡_qÑëýÕb}IñÈQ:Z€Œò³ª_¦O˜Ì;¶:‰;Uœ¡çÿýŒ°Â»·¸Taþj°rÚÉíòšÆ4 *¬¹µMÞlcu˜æMÖû| "Wlœ¤Ù‰t"¦e¤'îÊCj!GnÙ‰Àm"ÌAAÉÐÔŠÔŸìO¢²uËìµ-!«ü±…7ܘ¶Íå…aÒ$Õýž©í~±¥ßÕÞ.˜EÝÈ(}h>C„~Ÿ«Ä{ûÇ,|†@wµº¹‚l 6ì"Þ|å+_i‹’?Úæ-xÈÃp»æ>ß-'AÌY8}Õ7Bûvw4|z}4Û±dž‚ôؽé]²Š”¡¤£7=ažYÿt ã±3ó§zÚ‚—0çÄÄRG°Ϲ§ƒÚi%ÚÒáöÌØ0;·é%"ªr1_†ñbìðÑCG4F!Á5I궀0U!<9ª³0â¼õ0 "O|õ>•‰`Œ»;ä1ï4‰L¦ÎÊY[S0á):$bŸÞ|,ßËÖI¨À¸ê¿Ìã%”ø¼/k°}ó²­£/àÑÁ¼z¯€×4ëg÷?Ú=Z‰å,áÁ+.Ä%CÀ4{aÔ_q<ôpÅvГõdú"ÂS¿›%§0¸{H»<;;:{3Õ¹ûù¨µ@ÿë_ÿúðáîáñÅÓ‹Áj2:ÝL_ßú§ô±Ó‹ë'¿I‡~‰­zžÜw~³X½Ä4Üøz¾º³ä º˜êýg¨úå«î_0§­ê~1/A@fŸØög´yD{ûšs-pÆ4üß(ƒ]î.ëv4m¿ÇtI#ÓVª”Sƒ‹È` "Kˆ?&É’‰ P94'¶ù„F4À}áÝÅøÌ?YDç6ªÂLXeÓÒ[¦¸]/<ŠôÖCúeÖB{èO4ØÞÙ˜¬ç w0@Dl41nü¾â;±øÝêñœ^õ~®öÍú/Ð}ú#ð~Ž&àŠ}{¾‡úÿ¢7¼³9^>ewÀÍÍêF™­}¶ªöGø÷-pw3û;½4¦×ûÁ~p¹¹‰r‡€¬œN®ÖÛ#Ä$|æÿ—K½stèþ/.ØFâ=v¬;>ÁpmÒëƧ.QK/…é!Ô@ƒž ÂÃl䊲o:U]ˆC¹…XÕƒT6ÆF§6D¢QX®_Ä°ËwÈ!L—,Š ˜ á•^õ#éðØs³H^ ÂœwkÄ…XJ2*=<™Ì ./Þ Qm¹mlq·bÌ©ê]ˆÛU«ƒ(J!½#vãK°‡ÜKé¨õOÖD7·¨_'­­n½`ähj\XîG»-“C„¸Ip…Mßjçâeü N_ —|6­§÷GCý\þ4;z=Y²:1ßögפ8&ì½£÷®>Ñxã÷ý(ûù»7†]ßc«è°wµ{‰^òó»eï¥Õzw»Úü·àɧ9»ÿøúæfpqyÉŽ¿-ö¬×7«¡'ö­‘®æh–ÈKµ¿Ú@m¼Üê‡Û~Êãu¾jÄ£ áìH{:7îqCô‰I˜áéåÑçÁm¬¸uÆh7¶…Å&\|59Áâì|ù%A¿Ê(cò–y‡ð--áF…ï¥q3Iâðhød¡mý»üºø¤á§ÈGMH~„Y1é&¿üU~òÂa´”ûâÎí~„Å&2ó÷ÄÉüû¨øw[j,ôî]_¸ŽËAßÐÚhpY+4›ÕŠèàzz<{óxzô aàë‘þ’ý+ïX@øà‹¯~ù1Ewç…4hí>ÚæOÈè¸r£Þ·¿ýí5ž"Žôný`$èJPð3¡0̃`Ž‘ƒª`û·‰y;O lœf_Ý‹n+K*Fט_‡FÇt˜‹[–X(ÚEa ½ë#˜byú‰løÀ.Œ˜çÒ¶¤†köÈOD·QÁPþͧj_ps$Âä‰ã}?B õ7eZÉæwëníT¶óyMˆp×ÅÀðÖOì¢ÔÈãV™*ðeݺ õ k8Ê^ÏïΪ¾7äÆ‹ƒãÁà ñnź€í¢¼=ôè_p›èj·Xp ·¿l6¯ï¾ð…ïCX>“êq¨_¦UõÐm›·p_çÎü5Z¦¾ïf‡íÚ…'Žm[ó¿ÿ÷\Ö3œœ¼:]]<>M8Ev{Æâ°sŠ?cÄžUýŒäOaÐ3}{Tí¯`¥ê—¹×ˆ¿ôK½OŸ¡*Òµuw­ßmŸÌ迺#ÝP#‚F`öþ ZCüX@‹ø)móù ¼í!® ³=è•úN¡-›¾Ò dýþ²akÞo²Ö F·Z5·É›Û8Ã" `K¿”bWC"lb¾‡¢‘é£áQ¨¯’üP(¢òç!ÈûŠ[Dn\®¡ûWìö¼ÿÎÈš;Û>~xû‰ø°1Þêty¹ùߘ›ž†7³ÉÑ=¨ù‹9TþüSœ,÷êf²â<ï›Þœ+<Ñ ÷6ó~ïêcNäÂÑTöŽÒ!YQêÙœ+@¥Óí¸ci”e¨0œ5óÐ2É‚½Ô_ÑÀ‘=0ºí؆vý-–Ÿ‘z@#³$•° ÂVõ¥[o+Þò–ø˜¯~å˜ÖŽácÅ‘$ÍoyÉÂtéyâ9ä© ;öN-# õ°)sU²éýócÜÙ¥ÇßB2´ý6Ö ~ºªÞv¬tÝèž|½>˜–fÄÅßSÄÐÊ ¤­)ÐËÕ߃)µ*ƒ§®è ¹`hÊq×½iX2|©Î^Ïõfôs¿2êM½áìbr¶ù! Y(ôdûÞüþzæZB Žÿ„Ń3îìl®W½£ºÊ [‘wWGbÒ¾Ï)›v|ãûߟÜãðÎ%ÃðÿôŸþÓ†Ý<»³³³Á»ïöÆ«Õ³);zF³Oé¥ÅÛ—ì×99^NæNè¾æ—¿üåíŸþ雨ü£Þ›ôw£gãaï²$ìtà ‚t˜ Ò倣fÕeïÿÊÑ€Átd{¢p¥L»«R-<££÷ú‹ie­¦³L¡ü+˜ß O¡zÆ‘®Xu‘±‹ßƒš»à0Ú#PÒv€‡iö0Ä5ão{{WÔ¶¼U XSý¶ð–~Ø @Æ/ V ÖUîÃ_Áª5JÜ×ç°LSYOíªCW§”ÃwDÛb êܪé¨_¢Ï(Ì]PY¾'áTÞµ„¡ß„EŸìù$ŽqUv9?òæ1¶|GèRsÁ—àÜá-— 1„¤Çq׬±¸%Ý‚ Ð."ñm}‡ã%¤=ƒµý·4§Ò õøª}¯¿MãÈßü¿ÿýï®^}uÄBŽÉàµ×zˇgŸ>>î½ót9œlú'œîˆ:;…³šø*SA/¢qÎæ³$G»‡NFõ>Ì}»_ß‘þœÕâ >b¶ôá_ éŠzŸ¯Æ”~1yl?¢ _ÓV÷Çíw6œÇÞ¬°Ÿ¿FÒAìöM]þi‚óq@-èk{|JìáOWàaý×àÊ »Ê(ÜfÖâáÒ’-J€Hø0x‚bãoÑ]šÈË[ømj_œ7Â@m•¿ýÆö'[IüÔ›K°~™ºÅX m™V W £lh„5±ŠsÜ Úˆß,þËu¿¸sÆß‘#¿ræ¿G# lÆ£Ñõd4v«ß3²}JU]ùÿt8<½üÕ_ýïqTö±5wÀí§ÝÝ»7bçϺw}=ºaJèŠ9;…Ï,FìöµGŽ=ºW4 Ž†€G¡ç¸%pÀгúÝ2XŒÒMÇwn Þîës`O3Ez‡l E$:ÌíÂ#8šh\Ü´‚`ZnGaÀ]8“YÔ8‰XJ©¨_씘.Ïuh7ø„QH—¼©„Ï'¢A“ ¢¥Ö¶ìv|qÜÀýX}È&l´e‡ÝœÖ¹fOqÌœ¿ð¾/ =ïÕgè.`Æâºs%HkÊ‹P@<3„Czp{zð‚î@ 3kóüÅlHœî˜Ú¼êO™Z@]Ð[z6ÁÁ€›$Ç×ÛÅüúÞɳ—vo@\–|Ú»»ûÓOrÓ^ƒþð‡S6ËtÓ#4t0š)„ž<£WÁÖÉr¾³8t6º8ækNæ»Þç@Ç×áñg«ÝúÅ›×zÒ@v=+ÄÝÖG €ûö9ÕOaFâè]AÁÅ¿ zp±–TŸ7ÓÏèûÊtÇ[Äo‡Ó]°íÝì£õðkÿ¯QÃ~Ää}>È|Hð!hò7oLý¾?Ö¢©³ÅwpÒ­Âìû%4ˆ™QÙx—¾ âKsûú¤*bfÂÊ×ß8Í'¹ÆoP=Ï¿XW2±â/¾$£$‚îN!(À»Ýoá> l¿]Ž_ÆÏ·u€f]ÝÑr±,—4-ÛþÕr9ž¯—ªöŒð‡Oç7Çâ‚'ô]ºE ÛÑý•[úè8ð{Â8ÓSU?:â7Ì4örqÄ.hs°v¢«kÚOíyT7¦+c¨k€´Ý앳µEX%ŒL™D$uµ~K¾: 8ÀŸ=.®“#Ì„¾IO&ÿ2U—doÉä<#AªÃÝ…ÆYýä‡Û)€œqbffÒ=Á¥Ìû[Yß‹¼¬›ñ–­;,ÞDó'-ì¢Ü¶§kÿH¯ÜÅCnÄ1J¼Rg3gßõÌÕs„'~`Ëè/®Qósmëj1gÂíIïâñCÖj1= ¬—üø¸SàüüœÓþ(Qÿ½{Çß:??ýS@8fô‡i·Å¾ðwÔqkÿq5wÀÁ—mÇ;~ï{ß®VýÅÑÑñ5óþã›ùÍ ¦½c­{ø™‚Âp|<BGú ´¾J˜˜!‡ƒñ8ƒUè:¹–m%cѬC‡êý‰íP„øะI#!Ú2‘>Tf¶q&eVÁo„ä$NŠ»5@ïóБ¸8~ßGÕìÛ*Ýfø\]vU°R˜Š¨³èÃn0U¥T… ÷gU©*eæ›@^ŽÌ;_A(§!ܪ•ö ýŽ.&”mFå#¬¯È| IDAT‹ÁU0Èç$Èáh»=v¾¶;Ë«2‹Ð:ý‹ÿ¸AŽhˆ“ÇÐHW‰0ïÀ†Ã›þð±.Þ¾Õë/j·Þzk0:aÓöj=†áŒ«õÌñˆÏ{BË¿ÎGú9lÏ„Nî: ™Â¤ úüö9ÈÛ•ýéc3ðG¨G€Ëó½€Ãæ±çí~p@{tÐóêcïà •¹T?Æ]•pLu4¬ê‰Õ¡ ]GsM`ëÙ•W—ëÐ_¡dÚ9šÝÓ¢;;ÚH`#›¸ÔÓ¤†Ù~qk—`°ÏfcˆuNJœ&ôÉ~nkÙ%²󶘆ïzôï)c<]&ïsëµ<…Ëkå;ûæ¢?j~c§Ü 0r¦pc„…µØéƒ9Úåöx&×Üxók¿ök®ÓùD˜;à>óÕÕ¶ggç»C|Hª­?ç´¹ï0’{‚ô>›NfŸ¦Sq3ĉô¯Ó¾¬^ÐÝÑ5*».®&½ÅµçÐI‡\ xÏRí°7ع~€ñóvœ+œi¦ˆˆ99òyˆ>E*LL)–[6¿f›PlÀ‹)´-’4‰#<é)«²îPÎp«.bÑs>Q%6þi¼’x—<¯ÕÜ!ŒV&iH×eRØ…Wlýä[·ª–‡ÓQßF#aЩ/ïKÆá'ªÆ®­k¥);Baã8©7iñM%pýØúý·õpå@¦‘ï*#€°xí0â+øÞ%œ…D¬M†ÿÇÎ.‡nèü¹/"ë• èï^$üóvF–WëþœAKÞ?ê/¿wÕ»üîõÿÁúÍ)iœ^b‡!+™áæcfF³Å‹÷Nè]ã-ûIv“«Óìnw {Ü{yy›¼yûï1}Ù&å~égró{¿·þãÜ›A‡ûÃWvƒ÷Þ¾œŒÎd ½þåbSgø5‡7õû`MŸÛÚW›Í´¿NþõÛïvóõÑæòæ3ÀÙøG«Áî%¶ó! Î77ëcÎðbÜìtœÀÔÈþÆźøÝÖçQ½× ž#zè3W°BHP°bšGÆoO‰`hV›¦€ ›lõÿ¶â¿Fç¶zºP~Ó·è%ö©ô­ ;ŒKqÆôÐ9‚kü*Pî ´ÜjkW•£ÓRRX¹;ž2¯,ºx[£¦Á–ÆA¿Õ5Hûœ[÷84×è\|{w•Yñ‚àSë[¿¿ùõ_ÿõgŒì™NZÍFÓñ¿L&a/3ìÿÔ½óÿó|8žö.½ÄC‚èŒóghrVžHÅZÕ)ÂS³Ó£Þìf±³˜Y`ú,ÇARm¤Wb  #pùˆ(öõb{ …;q'œxCœ`P28SÅ$àñ@Ã$¸#Ý–^udÒ’‰Óá•âHn¹™lî;ÐÍ“mLº­ïÛÔ“\ƒÞ•ML¬ñ˜ì‘4Ž¤Më»ùÎfÆÓl½z¬’F¢dâöGØÎC\ ‚™['C(.ï-°­ÞRËØýBåý(Ç8Ësi“# »Á úŠ:nï‚}3ú‡µCx¸6oæCÎ…àü0B!MšY ‡â»­E£¨gä4€þŒq¸½ ÌŠøõl|ä‘Ó( aãcÖ ¸y‰òycߚϻ@ßôˆEê¦ÓþrÒ=˜/û`S ø&Sr%_ë²Ç®ƒÞƒ‡Ïz#Ž:™#|öšSK¶³Þ„ͪ߼¡/üLm7¤>RÜɳ§O_ãð–QïÉ`:¾×;GŽžnú›át{Œ{3>A àô¶1—2ŒÁ³‰cûêv°»¿™/ŽÉ‚íz»/@ò'œÀ7d?qå>Ÿ~ÌõÞÁæN Ÿþµ€8Ïï\¾ûó¹Ý/Lœ;?Yè碿bs¸¼¦·—äÀÜjÈ?qüøŸŸôûBCÂLc—ÏÞR.úVæÇùºþ‹sŸé]a†Õ;œŸÔ¢›Zèâ2€05H(û®hTÉðšòJù©uùC?*¼Å ã¹þñ›L<Ð÷T¤ÄÂhZ£ðaÆüMúJS•Nß3)ÒnN=jL6 ÍcãW½¦Oô˜ßÊ,OÀ©#êãjNçëóH·LßÈôWØ^ëûìGïrèÏ ß a¯”ƒ€;:š2-{äçùOŸœÿKN}w6ý[’þë¼Ö?úÑ›WÿìŸý³; _çüóÕ¯~uËá! Í¡lÙ⌀öG½f[×fµ8šB´1Ž0Ô EbH8ýÄð†±¼G°a‰*— ÷¼™–z?àåR,êdµæœ;äP•3PbMcb¢ŽÐ:yÌY¿£˜rauxˆ+È6G´ŒØ²å”†™$6p"¢Æ\ -¿ØË£_øП€P/¦;$B†gK`ƒNŒÙ轄» 3á ¤AÈØ×ÆvªP­†Æ6pª@ìÑð By7~w|OG{k¾“Dv‹  ´í€m€^gÚ`=I³!X'´)·Ç/NÇ/ºûƒõ´Ÿ»H,Ôo\ß¡ÊêÚ|»cÝÚîmˆßiWFþ»7Qe¾Ã•7”ÄâÁ!§’EmtÉ æLJ ¸ûðŒ3'zsŽ%Z®Æý£Ÿ95æïÿ~¯ÿ[¿EÇ>o×ýÉf´=/±Þãy€ÁÝæe„ Ó,ê͘öíOé{`Pÿç‘Š°ú8ó÷»/Òz¿iÖ§ï\²­oFï™ÃG%ì™ï.æseÔú4è 0vÓ,i=mû/í—pÝâRv÷ç"RÓÚñM'Žjû£>LÛÏéGÓžÓ˜¾¼¸˜ ±„w Ô$e’[ê`f•{W©–¹ýo ¾P„2ËA¿@ÙV&J@áÂpÓë—ènaG˜F{’æ}þ΋“"„oï”™ú.d\Q–G‹F˜gfÀQ!ÏïT 0É¥k²í#ù¹â_a`Áv?¿ù„ƒG ļ°M {þºÝq°Ïb<ýùÑlÆb¿þ–ËåxÞåÙ}å+_Y2 Lm>9æNðßZ„úÃ?üCü’{BPèY?Ôï«à÷ÀˆúäbJßG«4d;阡óÿ>j»M¢¥á¬'`NÊ®{¡·gŒ2$¥v;@\ àÿ/4Eb:æ ¤øgš&1 Ÿ¿1ùU ¡8¢pMA¤ a1W#ºÓì’·Á Ò>ºÀ®˜f5BT~ˆKÊØÇâ ý!?2Ì›h͆DÖrS°À]šÃ¤-¦ |Þ ô­à)0­´—.ž«TË)é­MþMŠj¥¹®:6ß©+'÷$?ßAA2‰s¾‘-Ômn·e?70kø5ûBTׄÆ"ØnC´ÎôÎ+P U†É;€™à õþuÎ NYɼâ['}Æ­Ã'2_qüéj1X½;dÚ`³ÃµÞ,ßxû ýxû]ö1+Ô¦¢õã›húßøÆ7ú.|ÕÓÝsÞ¨ÙFY£C¿a?fá·@ò´|—lÕ;›N‡'“'#.V?bÍ=kÂëž"´½HšSÚx´Úôï#h9øãÞÕ„ùú -8¦YÍߟоcNác«Ç,POw[¹Ý+s¿úóÙÀ=Gì>|C2Óvô/SÏ<~'2p˜þ6×o§ó%}Âü;¿°‰Ã²¡Œo¶Œ¨ù ¦c¿ài†å „? c>šf–R1‰µœ.û‚ž0¿„š¸÷yšÖ—".ù|P^-}g›ßsé÷É»ð†Ûúš*?¿éJå—¶UÓ}SØV(»˜¾xâ·aUuh¬8–ù~…=¾WûÑN˜Þg8ØÖ3Z!”!o=‡ƒ]^ë9[|׋ųÝ믿¾ûÚ×¾fáŸ(S_áõʹ—¥3µ~9`¿ñË÷IyïfyóÚz¹þŸ7»Í ×Wׯ<~òôW™&xeÅ”ïý‰ÔYZæöGü Åk_|uÒ{áEn“g2kŒ&à’çºzŒ3/b›f¹~þ«ÐÀô€ý4':rQ})£‘@‰°!_à U¤šÚ†¯+Â%(!>ˆŠyl‘×#‹5åÀ”´ÍÖѯ¨§7âL«;» pW\—7žüi¦˜¡ˆ¨? „këUqG4I¸¥ëçO"ÍŸ¦fS•Î¯[A}}WmÌ!'ë’V¢NF£¦Äˆ–{€ð¨)ñ·¢@˜³Û„,#%ñSS-°YÊv4'±Wõ?r@PþPþ3¢ó&~<¬K†úh†C9JÜhàiƒŒaœ6àQkTùqŒÀ`Š»òpÚ¨Ž8ñF²1s•îª@y4œ.&£ · C»Ñøh¥í"&Æ6KT›h¶wOþO¦Þæ^K¦¯v\m=z¿\£½¦Ü|ç;ßÙþÂ/üǤ¿;¹ÿ>õ[Œ–ËWØR·ÝpòÝù9{_¯b϶Ϟ=ÝOÑ‚owOŸº*ú žˆÖ®šïàW|ùæ7ßå`µñ[2™1reîr #çô¤Þ«ìÈx™• ÇÛÍæˆÅ5Ÿ¡ OX}ÿÊjuókôçArYmÆ0c@xc#sk&4¶3;îlÞM(ƒ8Ôþ ÎSâC9ªwŸ¶š›%g4 ƒøMW0yNùËד†ïn7Sš:º÷ÅJx¯®dOnw^¨þ·Ó #®õ9 ¤ë%h‹ªÏØ?GYhV=HP`I“~ƒÝLõ6ò3Cê[§þÔزÁûÎMÖ˜üèH¾±­…‚¹qYNàô.÷4D·}»‹6áÚLQZOãØXae+N{ÿjŸtF®!ÓÚþ±)6ùèlA èkÅ’áË”-Ò‘>jœØfy ¶£Òmy‚ LÜcÍ'J#ñÏæbª”‹}<âw}ñè½Ø.þ{úøqÖø¾'ÇG½ÓS4r àÎÏî]ž^'“gàøŸ½pÿü?=:âзÞSŽûýÁç>÷¹§¸©þ 3¶õù€ 3=÷w·÷Oÿé?] :bGÀò=<^×!²+ûÏ&ÓU¶˜0Êgq {Èí¤H¦KNÿ§(tQ ñ…pÐ9e""]:ÌL¤ùúÐÛEœýS•¹ —Œ_EÀ.;ȇ7ùt”¥‹. Ót*Hß¿O#f7ØÔIlÞ‘kšÃzKn]L¾¥Ò>x±ãoƒHÀ-ˆCË}ÐÏmLË¡BnÃ2N mX™«¦mpyOË9(÷¶¼Û@U‡{¼£CMì eBó²>ÀzÌÜul³wR'Mñî  ˆ!®WC˜s @³ãŠ‰|}5d’ÝÀyV!½ˆ_6Žv(-=\­Rã¨w\I’¹OÆø07ø?ÜŒ˜D¥^êJß#ô>ÒÖ%yÆZºåb6d [žVÍ—0ý>'^²Íu6¼¾^ lÇ/¼p5eõ;Ý{·»¸Ø ¦SV¤,/·ãñvÍ‚hÝpÞÉœZ~ÁæeÓ³z[毰ËÉIê±â3F…?`>ß7†q£æ_.î™ü覧 viá sÔoú\âƒ_Á åÐ<¾ˆy•fÀ^ÍË)ðZ†q¼­Æ4†kÄY¿»Q~sñM¼ÍŸÖ&L8ÝcÍ@ÿ¡}›¯Pï7ɪ ü wå^å%ï®l+˜:Éœ1åîêð.¥´È?Óù/‡myÐ¥Z¸‘þíMs&ÝAš=@9X×tûXÛŸ´cêâihi‘UP°àa·•º°ÐÕty` tÜ£èã–j¿µùF¤S ƒ6ïX°Í?ã+ÿ=¡sÎú†§À>A¹züøñòóŸÿü'Žñ·q'´–øµÐî7Þ`úÍq㠸ƽ+ºå#: GÃÉè G¹œÒñØ.;:†ÈÓw!:è77Pw™ÊjÉD.·H_ Tëµw@<0N‚ð».ÊEq¢G7&âY¿ø[qV˜„Á.ÑFŸ]¿úò!L†¨-¼Ì‹*Æâ`0qÝ©Âf¥†­Lò/ÉÜr­GTà]´ùh|7–àN³jÙUèío½Wù? [®·é>Üe{|TRm€ï˜ ÊÑ;ŠþôA1­.&æ´¦ƒÏòm=Èp2s±¬…üqdãw„e;¯ivŽ¼ªò7N €LÎð¬ àž‘ÔÐÓßÂ6`ô£Í¹‹ëÉMßgd«xàÖS G}VeÁåÉs›÷YnûÜ_¿µ·m –\Л^ ×ëùÍõÕúxq=¬¶Ó{ƒþÃí}¸35™¯žršê”Cg™DnÖO9µš3v6« —¬7s˜äv9ï­¾ÿ­·þÞø×¼çc —4  Y sã`¼×û¿þãw82ùèx$Ì‘×[nÛA%ÂÕ‹Œç?Íì×hrVé÷¦‹åö%;;Œ™ãµwà[)‰œ3ψÜ+vP‚?žÂçñ»aÄ| ßPxUý ¦Öܲ©°Ä•>õq»ŸZ€À‘Ðí}º òíü® °5úóÝðÛ§5‡}Ô ûLýåká.Vï·5‘8åúׄ&–£¶eÜÚv›½_dª¬®ð¤8t[Dùc“Aù±­¨QxKpëµ°|býQ“®üÖ?F[g{ ì܇ V¾í·­í7)j/$ŠÜ„홶[Ö Œ(LMAè"ßn§–“Ñ”ûþ×Øküñš_·cÛÀÂø¹‡…~¢9sc4|ŠT*Ó2.9çŲs$ßR[Võ>q¿wÀOøät’ªÓ…ûFé-ƒ7üˆDºŽ}H`ø˜å­Wü9ÊgÑßÍ“G0~FÿL·®˜X»o¸‰ËEyQýÏz÷N™Rcþ2›¾;™ÎÞ€Ù¿G.o],—À‰§øWh${ŸXs'ü%>ý—¾ô%æbáÎôÓwß}wþàÁÓ?a_éx;ž¼78OùÖâææÞ“ÙÅëh^g ÃwÁ1&ƒ¸°ñ{Ç&-nƒ¦saРwÍeMTN ¼wŸéñ[˜þÀ¬çR@$)P+·÷1R”HÁŸáæÏùCÔÌÚb\4bq®–á˺rª4Æ›O!è»ÇíRŸ „*µìÜm>TOE–˜Ín¶²Sf²%EJ¢\mª‘§ÊÇ™…r·0æUpfÔi yªüÔ”Í'ép”›_ùMW‚ªô2 a\3•B_²¶©vîb ¬J*˜V‡„ ³ÏÂúÁ¤ðUGô@þŠði+˜án!LÝ ñ;^qî°ÎÞÀID‰±v ò# ß?órå@„ÓKà˜T×ö{—0@~;vJ Çÿ5ùÐtä¦:zU'=¼íTÞÄ’8§^”<ÖÜ| ‰¥Q˜À¸]Å~´3ν7NøŒ}.Bê½@‹wvít-§ªÓm[˜òŒX¦«HK7QÂ(} MÅ`ÆdÌ”8ÃLÀ,èË•7jE–u™¹î¬î÷”=óâ¨^Œ ›]„S˜ýn®í7ºFn¡7ÖBƒÚ·üUw¯ ƒÈÓðÒI[_ _%q Wù6ñ‘”VF´ð+ÅGû¹n$£hÂKL”Ñ|8(Áé!ß%ï#Þn¿¿|ŸÔ(…¥O™I”œÚOÇÉc²Rþ;š/gì ïnÑd_/ëç>©gˣˀ׺…#ÎïKNÉ×op~RdWD—…PÞÇ®Q@ü†3˜a:•!1Òg•ÿõÇY`íÈqÃE?îùW”=cGVöü{§÷Ž{÷Îï9h[3ÏÿæéÙé˜Îfï0{C(~ôÅ/~‘ã~©ß'pÞß÷næNh-ñl: ø k^,˜0zzÔ-“ë ú\÷7XM àK¶vs”øŽþÈJ(ÏÖ”°ª)ûFQcapÎèœ!&D=¨âà ¦Œ"N"“p+ æÂÐPLû/6a˜tUÛìÌVúÑli´—2²ÿù€ .ÃF0dü»qi ›o=•ªCeB"šÿ®…h·ú¶°÷û 7eW›v`ߦ¸uDÇiÍÌ¥ê J~j/Ú7R{ L•Sn»¦H]ÅÎ&\ˆ¹ÌÆñk{â R%Nö¡gÚŒ6éSº¬GÙÿf%@nárµæ€òD`·€Ê8©wé`Jæ¥må7ŽÏJ€ç ž±Rš€ÑçôC¶è!l6§|õ=0fGàÕ" šŽªÍÇQ·‹êpÖšÞÓѹŒ\õ¾Â¡~}ÚUçŸò±“i’i"LvU·Lëë{E¸¥L߀¤±S/üyWíüù‚¤áñÛjkš­;ß¡û T:A}ÅZ`G¨ W\$Îï$Óm ˜¨2Ø{¹´ :,¨Õ'¶Â¯’(FŒùðNZ!œÕ•n«ØÅ?g%!9h ˜™nƒö>;FVx@;x£4éŸØ©á¾œDÝþ´:X^­+.´O¿ ?öŸjÛ4q6‰kz–O.ûÑf@}ã*¶Ôÿ®Ãyxªªþš57Ø×^Ñe¯¸ªýæxÌUŸpÆ_-¦0{g~šØ¡X¿úê«OPš2À<«[·½{³Ù¨rïø7Rp Ù1È|.Ïc«ÁÍò=N"»‚ 2ô`1؃÷Ö9 èø”‘×øˆpU½Œ™Ðp ¸/¡Fpdƨ6#d È‚'aíÈEÙ21L‚$š‰5š²sĶü-Îx`ƒÜùI˯O&Ͳ3"å'+’F˜‰@b ÒyêZyf$F}"¸°ºë©¼L%/J¹9ëk¹1Ø&Äø^•Z•é`l‹"†ïТ’à &Y !ù¨|eŠeð&e@K×Ùµ…¯ «¹ˆ¨,h2ò‡èßmóIŒ{׈¯ÌTU©ä-_õ)-‹ÙQGÚ7ìÛ?_'‚õ5¯Mw2“ÓC,q(G¦hƒ*…êS®6æ79©¹×MzîÉ¢IÂíQ¨©’V! Î­P€P•­&[áŸýÞÍÌHÿ fÌ=ÛktÄ‘,G´¼Û]ËEôƯŸ«p›&à`•3¨E¹ý”ô kxçöeè%˜JF@;âÖ«& óö6•ý¥Ë˼K…^íÚ˜€_` ®($?>`¦ËL`üœ¹@Æ0ÊÉVO‹Ç°f¶°iEUÓ.Úå/íN|ÚÜoä°W«“y·dKœ5ò¿ïÊûX¯}˜á•jÿ[»NôRA RÊ̯¡‰z¾|êÒÊo»VLãªi"â€î½'õÞ«ð[ø¾ Ó%'»q¦à"ðQ²Ëô•yÝfße±/.ïpŸtÉž~ ½s dSlµ¢´km˜|‚6²Ðó†Ã~./²×ß“þ8®7sÿع·c„à Í*Sg£Ñâèøè)ûýÑ\f³oN†Ãï±:õ!‚úåŸÌí©wƸ~Š~€Ë»5‡E}ÄAŒ„Xg5Ü]KøÎÏÎÞeÔÂŽÁÅiáþ=·§l?c±Ju=ÔõÑ“+:=„q5íÒYäÅ"©Þ GŸ„è@H<Ï¥k’ Õ©b!IÃ<¹˜@ª("BiTAtOZ*ÞÑãžø˜Tàf“¸ DbËéx*-_Ï +£l¦aw­€™ Á±3®«bÀ$Úñ›‘pqš‡oèhÎ\ÕF ,nIŸÄ¼Œ°>þ_Î ×LÔžV„/È IDATõ>¿–ZÈìÇ×Ѳ׎¨.ó]2M×Î!Þä•éß9q·Ù8’mUkqÚÖÄö×Î[5!&ÄŽ:bK\M’Oûpèa2zÓ«tVoØ„W®0)„ÊŽdÒ®º…QH`UÊ€µøÃÌœ^H;tÓ ~Qv'8«­U¯I¿ÛÊè{ÌÓsÆ>9l6‹!÷\8çO—Ðo9´•v’ñ»»EÛ¾É }l6Ã|ÌsE]W£uÃë«Ò};aÀû(¤5w³}g¿3iÌC¡ÆOÙ‡ô™©áÛ–]þÐüú,Ã_þh€í¤Ðäc:^ò®Œù¦öŽM¹aúí{T½„ÈTuiõ1ìƒL¾]ò²F~ÇúÞ­Þ¦±ÒŽ„áëÄ6Y4…:„1Ž'• ]h¸PñI@;$4e.^›VZN‡à>ÁùŠ‹`Q¡•·0In‚ÎÐEdòðGƒ0—kó†I§¾.ÚóÒ)ÂZ™séÏÝÇzqÑ[y[£þàWíŸýŽ9r[`2îÝ»wÚCÍÏÅ]ÃåtrôöÉѽ?†ž^ ‹}ƒ¶øóÍ|þŒøù½‡ívw†¸~ÊnŠ9 ðÛßþö’ýΨJ·×4%û³GÜ+mïvëÔä|2a†‹ùú!s5@—dK;©@õ´ªÅ|Í-Ì“¤ŒÄ  !¡I:„„¼§;´“è‰z2ÿ$<š“¢1Ö"Vôš-_íCcŠFtKÜ¡“e°Óø´™B]i Hw=þŸ§È™þìBÐa^‘j T€éÒá®”uæÇZÄ¡ýÁ@©•„-mÄ/”* \›§ÍÙ'ÇF½ôè¬ßåljrà»· XÜþ¶@³±2¼s}GG9]­´3‚­FÓÔØ$¡å²|3ÔÇ@§vàR7?gL:böyXˆO—²ïç¶Eú£iH¼!.šû‹*™& éIœÄš9Ww®ÀV©£êþ,Î#,˜°Œ·NhïY_`vN{9š‡5[~o.°A¿¶VI‚u+P›O åúöûxý–²Àmâ1ÈCþL›SU;4;‚Pu æùuØzôy:`,í˜+gaLúýa¦fõ>c|3©[ó¼ÏNuÞVÞ–¾ÙÖ“|+ÌßKÕÊ×â#Áup„U0~í1uT˜yÛw4ÏçMÇï ,¸S ©„1IÔ’kº¬°úz¦²÷š·nñ]A%[þ°]ŽP=™H¿)ƒ'Uÿ^íë‰Þò·qý4ÛþÈæð¶Ã^±6k‹àvÃÙlϸÞ÷=¥xƢ姛íèšM/7HOK¼²»ÜZàNøktƒ~ÿŒcجñŒ»í1÷qÝëz1ÚeÏéýét¼“xryª)…‰ŠBÅô`úuoÎz2ª"ÅzÇ,”Mº Å{ê=2Ø)ÃBþ!ârGƒ;7‚Ù“µ¥ŠU¤F8Èp½]GäôˆÈ5j ‚š‚ä5op cTõD‰¬c‘9Ñ8´%xFBpY@!æ¦áÑøÚV!iñÚ©Z ÚÏm¬å~iwë;$HÖI¶Ñ`ã ³º1e“ù(»¥>ü䆿˜‡•77 #3mÍžÇÄm®íE+M`ö?ò§2½û¡(p'Èun=ªjÖÜonkTþî(ÐÈÄÍ(6ÀÂèÖå † .ºíC¢ºnµ ¶‡MZ²c¡ qæí~á|OŸÛ´t[¶“åF€Ã¹wÛA©ØoîcNkÛŒpu çn‰z},`}§2¦¬*hžocý@P €î´„÷±ñº¬#L™?Âe8ÆUŸ°MøÃïH4°p;ÓÑþx¿1ÈÂö¶uˆ¶³N<©Kîë¯i|Úg5Ù¾ #0í…pZMŽÔß:æ¿QüìÁ ÓÃûĤ  ÎO~mM«KçoÕÑÛå´ÓQ=Åšå¥+û@tEbZ”›Y´Â¢gÔÍüX´ŸÞçD”ánÞ-ÛÍ2gý{©Ïš}¨œÀÎSÌ?SHchæˆÁŒžÔhÃö¿GhA—rOÔßã;pËæ’,W““þ|°X,9ijõûœI}gªî€¿FOøã?þôãßüÍ·þͳg“ájó옽¥ï1Š;gÀëôÏ[Q~ I·Ì†½ùâ•éœ5oF…µžrƒà„O¹ô…C¹î÷ŽN&9-p2»aËà9˜')å|kî ë3'æŠ(7s‰$5ªcã¶äb?är¡"½ª[=QÐQÑÛÁ$“Ž~T»‰š¥’¶(m®ºN~¨³(: º}ÜÚ¨ ‘#$¿£¿2†áç1d€CÆ¡ºU³‡Èùè=¡tØ(œ¿¼OŒ–”(# ^#£’øhÇt–äÇ1¬,5îD&£ø½•1&®Q=ò‹j¹2±-ºb 6¿”E}O·TãmÓØüdÎYؼS5SÂÛ;›{¶! e-¨{×"¤„ dvœ¾OçÊhUiüzñ $©¶6 »\Tb0Ùj˜9n× °<%=‚x Ýúk/ê±@I0ߟ´VsMØxɳâè‚îæ·u‘ß‚oªÃ.ä½Ç¾NâÈ@Í`ˆE¦!N?V9ðè÷'6‹û:/°·&ИξÓ=¥iÓ,¬6óu]A.'ÌzÚ…–A n£{™&¿¤oÛÖ&$¼Pòµ5NsêÄöÎÞT6!Ý7¦„[y¿==úê§GÓfõXW×,VõÜl5ÖO&]ÁKÙ]±·.¾pèá‡ÚÅX“»›.ZŽ½@[¥››éz›]Â(C£ÀÓLŠ‹·‹*Þ²ã]›Ù¿ Ys—¤õ€ðþœã“Ñ}.Qs®ßýúNY.pãì~B eŽèúòIïê)'û!<{ø^ïòñ“„+¤M9QÕ®GG³Þ‹/ÝÃæ”ÍÁàúìôôÿeÅÿ¶÷=bÀ>?¿÷mª5ç»< ÿÜ¿(ìqò½ñÎØwÀ_£üöogh…ú¿×ûÁ~°¾¾^] ºw®ôÚ¨}žÁ>R*Û}ÝjžU¬ÞQîN,¼LÐ÷¥˜Ž`ñ7£KwH³‡ÜE€vï‰s˜F” wdw}Âb&Æt†Š²Ád“Ç„p‘“d]84 ¥¶&£ö¸ºŸƒ,$-iAlÜ:i0Ÿ,& `g›Oøœ6éCÿÍ€@Ë7·Ê¯”`êW»JÑ.#Ãh0¾ÕÞ[KÅ»ðÄ Ñ=悉Mv:ÿ1›2D]mÞ1§¤ïbÕº„8g´\QêÛàiõÕö©8YGÚ˜hŒ:¨|JRÏcm]¿ GÆÊ8*\aÀ<\Ãg«TÐUúÙ·šÇàÂÙ§ìK³UдvØ¡ªŽâ» ©q›c­¾'œDvåÚäá«Všò”f!8¦Ùzön¦íÐ"Õ”Õì3q‘y„AÛ xG™Úšô­´Y1°ÆDíûåö;ò—ïY¶LÓNl«5m€PÉ/¿å³ž†ÚelîtKܾ«qÚXGš„ë0¡…jš»ó*00…§ÂP­DI×9 ®%Ûç-26¸½Û0žF&È"nášiîfžvzή·¤“Só‚£iáQxâW Ð @ šß¿‚š~µM ‘E&|ù LýgÔïêi§\òIµ.t S|/N¯^Îf“§¸Ùã?d»ÿRÚ¼@(X¾ýöÛë;ÆOk¼ÏÜ ïk¿ª×SXA}CǤ_o8eÊ{§!ÁtÔétÊþ¥Tÿ ¿jHý2=á¢ØÞõ5ý•ðÄ‹ƒØ-0³ªÛ]×™c P$C˜@KºH¢VµwÄ&EÈEvÿdô,ÞæÕŠX£%.ÇK¨ “5Lâë)EÆȘ$”¸%IEñ[„A¯D´KBšVb ¢ˆ["l…’†úVu´qñ/½*Sqº £hƒ“4þèël§mö!‰±|á’»[=_Œ,ÆÅV#Ÿ:>–üË‹¹Ëz1ŒmŽ© –n a‘tÿ6.U9KûwYx¨TÒ’WÄ·0}B2]”~øŒî«å«øAóvœ~ïbØs1 éF±2íŒìùvNW9š¯5ø¡ÃºÝÚºA·¯m·³Zfçùú£0œ|­sÚ¿Å`¥¢‡M“VkýO;à«ø.ø»¸nl™L<‡ÂÌÔø8&öùŽ EùžäQ+úËŸð,î«Æl-o*ŠE6ÙVÓ¤/úÝòï7O~Ûß@¿;V÷ŽÆ–V«àü­Ò’Äa94q­.”gùþió;~ã:?máŸFA%f×%Nt„“GšÖPüÕFg_Ï.÷À'(mÛŸj Ã÷ÆH ŒùúøÆO¬L? ž½ÿNLßX1ÏïÁfžî7¿¾aáô5n¦4¾« þù»XšuV¬Á?…rdfï)ÍÏìöúé?!ü¸%‚ÕݼšðÇ~î€k’¿ZÀCV–¾üò˼µÓ±˜uÊÜÓ:°ëíÎ8Èûæ½›ùuïòê îE:öbq…Š”NÎ×{Q—qœúô¨ß»‘å,˜,œÌ¸9EÂdgîK±d•ðÎ]¥%!¾’I„>ô¢Ð±ÔŒ¢¡P·–N„VxF“F“ì/EÀ0«.¹’z¡„/Ä›8(„Zr^9»Õ*[K8õ–RØ6Ñ8›X£:×r0†œh篅~Nb[#€ûÀr„èµT2€ü+×ÔÔ¾â ÑK]°Ã‹|7Êh«Ðu6][â3 Æø^Í­Ý£Ö&8„•´–¥6A]„–ëtšawn5VÀ,FEšÌûë'© ¨ÚœùG‹)f´È6ª6‡LµÙû-ýÐz¨n÷›kûx ¯}LƮڹÊVÁô¿§«7`É ÁvAÛ=°æ§:\ BåMü¾]Lmµ­³ú„úFþÖ—àí|GÞ#qÚèú\iŠL‹¾Ì5±ñ$qcäªö³¢?ùÈèÑ‚X@kÜΦ†ûêDhµÏÇ“:çèWöSÿ ç;å½ðg¡#ï,ôM«I},°Ü¼B«)N'Šmaãç=}W½üTŸµð“Æ÷O¸nýó_€²Œ×O5,°•ƒ¿èˆvÁD¸²FÂt&åøÂ'Çsë¯ì»Xá:تÃÿj”?e0¤úêZ'Töc†ýâÈÖCÍ°½;åò‚C}`þžðwñìqïÙãGÙóÏ¥À0 E}ó?ç65î·à?=99ûÖññ±*þgØ4›½Gøƒª÷P½Ë–A©w'Ü~¾ç\wÀsÍñW÷(arkà7˜²àš¾ºd6@ À®ï‰ÎŒq â{\i—҈VjVk/â†æ¹8B€ ‘ÂávˆéÚHÅÅ]îƒ$ U†L¾ªÜ,C"J$aì(R\R- 0Íd5ø¡¿‹È[„št[ÐŽ—ù[–æ,HÞxÚ~æ.õ3|®øxöÄæ z:áC{£³‹Þ‡5Çax’$€Ÿ½‡=x‡D‘Aê@BˆoD·ÁZªmëM™u¦nÌÎ67K~"tà¦õZÛüŒ6*w{Á¦Õ6__’3Kõ’Ouyé6Ф|/4Yž Tá€~æw¯á°™ç)Kz(ŒL A1B†µ&Dî†V}*<Œ¢¶6ž»_§ðÉÜeˆ€ ³·J#ST€Àß é—ø}Sáôã´Hlë†Íu·f{C…ó'“s~;~Fûu•ªKC`$µü¼?`î'Ìü~ÒÓ.ŽBÓ&ÔêÔõÎ׫â«IâÎÚŽr4 ÓòçyþùBYp½-¼^¯½nW¹f«8l+Ž_Ãeóú€âäÇw¶ïjúŽiÛNþ ßYM0é÷‹"Ô4ð®ö]œïSše•[]˜p£>ÀŽŒ«î¦®ºx#ªóüžíoÛ»hÏÕûªôeìŠLjL̬\'Å^ÿ9´ð-€kAFôËL#tégh¸ƒ]Mè’›+Àøߤì TýïR­‡ À.Qÿ?ýå_þeÏû?ø¨PéOxÐð7Ô¾Á½ê¯½öóýg±‰û¬âç*µÝ#PoE_ç•ÁŒŽÉ-oc%WèCŒÑˆË\ "â1§!ñAUëµd‰µç¤L‡Ž Aöû[oF9ÿ-»µdô·£|ÉJ{ møŒo¸ð!lž¦ÑŠÐh’üÿì½K—¬Éuž—Uy­Û¹t7@ %€`Šà2áyÙÒÀ«5ñ?&šé—4Œ&ÒÈ3Ï„‘Ä!S¦Is èÆésú\ëš•™U~žwGdf4 œÆEÝÍŒª/#bÇŽ·ïÛ{Ç>%“Å/‹#;ü6³v4ÜŽ,jIW¼ƒ¸ô©Ž0:íµÙv \g¨¹ oy2¸{u¬ q±xdöd,ÌÝ ÆÖëØ\ÝM³$Ð]¬`Ìk±þº×¯;‘ËV@Çeo±>¡îî\|qx—1+vRàÊoØkVô[ Û_%Óþ¬›NxõË Ï÷"thC+% 8¢“vÑä—¤º`ò «é Õ‰?ÔðÇO§§«ÞH!Ö­>Ú>[l ÖEbö_l^: B%[aÒÿ¤7ô*¶SÞû‚.ø®yÛÞoj>õ^“/ ›°Ù„i*ï¾ý¯pY‡ïÒ62Zþ6o´×fS¬ª@ómNÊnõºŽDX'ã®-žÀmÛ ¿¬;¿ #<(–¬ãvØkä@i!c:ÀêÒmø‡ü¤€úŽÕVo¤+O|ähMüàÀvÁ_æ÷éùsÛü¼D­n÷ó­ò{ò½Pgƒ2-Êh£¹)=×4.W´æÞôkÞÅÉɉ ýâZ½÷Þ{X;ó÷ÕÀvÿ}x»°ŸSôÓ_b¨”ëU/î1ìý{‹åòŸÂÈO×—ÿ ~›aÄûìD<úéãÌû_r?À³g„­ rè‹sÚyÉWƒ£ûWƒ“·¸Náïáþàø¾š³/>'^Ý?ŒpêÙùâÚóM™Ó֖ϱka×Þá߶dˆZ­_†WIÏ0{Û­S~h/NSrSWLÈMˆ1Ü óÃF ½§qÙš^ñÌ„e¨»î#DA7¿Æ)rÐé„Õ+,jâ'ežø*¥dH-lÖyR °ô¹lü^¶ƒÅ##ƒ…¹:)^lëÉ?æ9¸Úa‰t˜Ë/èÎù» <Ê—i…x«³V®ÚÆr‰Å“þòWm•áeC@°ÈeJq,wDNi“ìn0?ä]Å åò Ë)Ü=Ó'ÄÀÏÑþû{¸sÄ?¬vuBÚ('YWâн엶cÈÉ|TæöéÕ_ÎYdØF®¯¨¢,¶s˜wKVV\} À*áÈ!«CŽZÏ<õ °©&mŸwcFC¦¯R— ý% 5‰ 5 ÚUHœ¼ú1¾ŸÛk›GÎðÆ®÷Ö¨k†«¾3Í’S>|×i“±Þ›±ºijH¼•×ÊOJ•ô›ß÷(ù¤[üÍ?³C„Õ4á–™'õ$eÜI]¸þ(PEN¡)n|¾Çqƒ'¬o‰4zia½d*é î~êE¸n…=—SÇ6„³í£²ÅõUƒ)ïÁ}¦¦¸‡ À¸L°®É7wΔèË—/c{ÉÚÓR<`[-çi¶“£ÃÁ1ü8rp€ý;_ùrܼÓ?8œMÿσéáÈÒK¾ËÐÿÓËËË9ë–ÿìŸý³Z<`Ùvæck`7ð±ÕòÉ€óùKŽšæöwnËaëÔ«Étðcø'ªíÿ>Œ~"#¿0O…ã©Nö+Füs‡s}ùù¸®¹‚Ý5ÜÁ6˜q5–G®®Ás˜01^íã–ñÈ.Õ±KR”-£“­¿m|üÉð³ªÓÏ–WŠÆ‹i-£ @:"ôaðx×*®SâLz̧£ë̤XÔt½ch/Š ^M ¶ñ%©K»È—» þ6ÓâÅS‰ã³~ª4 ÆÉ\²Í§'Ìü*<ÁÅ5 Õ;&í¦LXº+-?á´bcˆ[µVÞÔNËáƒö@P+üñ 49äcm“w+@ãø»5ªÙ Ü5Re£|.®à}¨ˆØɧ9ôq½Þ—!¨”¥þæT:Æ£ 2yJ/Ó7$åS¡§ê3 Í’"yôÃmcpè×p¿P¡Z C F—®={ð¢ÌŠÜÂv¾Ø-ciÚbÄÖ±C£U®*ÓŒžõ¥±6“~#nï=y1m¿ƒzQßÉ7“)|[öîÅ´ÇßT–¢èwt†x®Û&ÖÕNX$ÝÛr2¹×ÙË7ªyÂöŠ¥-*Ý+I¬ê"À來ՓÒñ6ŽÐ“~Ý·VÓaÝ­¿?¾¾'QL(Œë |ÃF¸Ç<†O(·Håmô½ØsxÓºvo?JÀ’aG<èçšÓþÖpB—ÿxÊ~¦NÇ3FP98͇÷íf4Íym\ÞŸí_qMÅÕ·¿ýmGzuáÜ™¿«v ÀßU3o ÿ.sý__±u¹Þ̇‹‹³åÍò/¼+TŸÀÎ>´OÁB‡„;ÒáF£Ñ “ã{a‡KæÃö9’Ù&ä´À‚á0{ìó9‹ç6½3x§'«ù úëלóáùÈö¢t檖íg,SQV†#îþùêÑ H?מ”dè²~Ù„¾bL€)Û¹‘r˜‰˜uúF²Àü‹¬ $HáSâ=zÝ}Öc‰¶\tÌc+zèê5zHc· ‰?ç)j¸Žšà&yðÙN™ µõg"ÅCqaˆ0é5ÁÓ܆'©”´#*©UO„¬%ßz4ýª@¦ ¬ñÊ[%gZÆ„ÍF¢?~B2è· xšJ 0QÞYvÊÂú“šÒ ¾=HBT0êR"FdðHÔ•Nâ¢?ßß¼i¦þäù•‡ÝdÚuçØÚç| %°Þˆ6z!kúfå}-Þê®OðýñŒÛ÷rÂ0¿S |è±%¥¦öY§Â!A(d¶Ë¾®m Ì‚ÉãÎ?OÙÙ€J¶¶õÞ·ZoÖ\F°3œ©ÐøS™I;I£ÑߊԮdIÃÌ`l²(— #o‘ëØd%=¶u¼™ æñû ™Oo%ô{T9Ø6zûëÛ÷€´ÌƒB°º8ä:¯H ºÌóήñTlÌ£ùu”¤½ç*= <Ó°üâ艿Ջ  çj˜"hû1ûä_XÑŠ?DŒàrð«’_­œ¸*íS<ß q|‹|¯*­‘Gš“OÊb‰#œÐî¾#›¼ ¹!>wqδ%#ž—W—ƒSÎø×vŠeáŽ&”³:ÏrÎ?ôn8ãÿÅÉñÉËéŒnÐhŒ"0bëßA¿ÿ7û“ýáø)™…}¯¿ûÝÓ»´.ÑÎñq5°S>®V>Œ þp{úða"ïýøÇÿùåÙÙ|âÝãÁt5œü„žû=ÄõáÍÑþ×èáÓ]»üÊ|¾÷ÖdŠ€V|Á¾W{g >†+¦.®ÎøøЈù ®aZ“©{`§\zQæÃTƳs.}Æî¾tך+Š#·¡Ì(~|a~Þ•Ó¿û{ ÿ) -–,p|ªz´0\òY½*`pG¤˜ŠÃÞ(H†jXá†Qá0oF!aRZînXºÆÇÄÈ‚´ “Ɇ5áéë *†vjºô—©Þ(´dkãÐM ‹ð„ð e½vÇÇ#ã³T$WzCÇG©3ìnLæ©x”´Ë‰]B^,ÛÇ_M¶MF»Á_ÿë0ÓË´3·má=âWŠUôø3 @ýóNU¯ß¼rpÊ€K,±ÑE‰Ïi€ØÆÛ[é®™Zë/3µ*7(L¥’éû3Ûã IDATŪiÛ ß‚õÚ Ç9*îZÀŸ)¯*e¨6¶0M.[€(±ÚV-+dqtAc=Ud‚±t¥ p¬¦ÑLÎÐ ÜÞz_ ' þ*,‚ˆsünéËVNýô>U¾M6JxÜä—×Íd¢˜ ´[¾Ì³ÆÞ°ÀþgÛn™,D+[½3bÑ~yg|7 ¶ít ,ýF3ñnËø~Žµ6…ø¡k›JÛaeë÷;/€q7ñj V¾Y½Û&Â_Zùš"üíT‘¨–*6‰¹¦¤XÒAa*SeÍŘSF3xrÐ<Ì:däÒ^þÙKnö£®™«¼xñ2¶ßÞ‚õQ®{áèT˜ædpïäÄÅ~7÷îÝþÖÃû?>˜MÏx—/gï³£€aþÛG“ý騦G«åh9þtþî»ßݼÛeÚ¹?¶v ÀÇVË'ªá·÷øñDñ»wïÞ½ÛããÁùþþŠ½©ö‰n0áW(¶Sìôz.Pæ>ÛߟðÂC„O>ÇÒÚ³âQ{æ¦5×›-yÛ¯¯M,>pé0å|Юr¨U»Ô¿Íø²s?]ÜX 1Ç_?öâ tþ×Fhxî¶v¬qtt£[ŒT¶ñ‹2ÝÛž¡éˆÊ@ø!„­ØNQvXþbxêF2‹ ’i™à7"ð§ððíL容?†t kJAÝýR/÷Ö!ÆÃXŸ­BŬº.꛲èo-’ ¿÷Z%ߧ $W£7…³VDbÈ5•––PÀ«ÎQ¸£ph¶¯A;5à;®ûã3À;' ¾yâ]ÌèŽï"p]Ï;§ÀºÍ´6Uå9¢dGRÞÙK½JIƒ[³VÀ•`HCÙ{´½ªª¨ Wœª™YX£çK²öãl&ïL SpÛJý¥¨òUÖž5–JJ)3o;Ì´MÝßИ÷¿e1BY¬ vóÐNͯÕqtÚ\á낽ƒòÝlGíL‡¦!PþT*°wÓ kczÔm4Ý–Ë7ASî )H‡Y,u‹<à×ÛB<„ºûý™ðÏ ‡û—Ëë<7t|¼ôÇ—D~¦r§Âê´O.ùq³ ·ûÇÓ NS….©¦—Ô §N _qŽÅœU”k.û{‡&~ÿ8yÝýüüØ)?¿ŽÞƒ—óößÿûó{¿÷{Y’yyõôøx6çŸ) rº\¾BØGQ¾}<›M™ÞZý”^ÔôÞõÁï/ãcÜÃÑ…gùÓ#qe8k.ÑœY|=˜3 s´z?<¢—FoìðÈßÌÀ¨é*Ó/#®§ òºdÉUÿ<¸dg¬*ˆ-´?]ìïFîMhx .å®_ì¬ôða*Á'Ó)œô¤¾"Ù‹©žŸ,…øZàÚ£ìq„A.±t»àJ)dÜx<öÆ´EN/ÝHñnòbI ZL^&UþMÏ>éQáf'’ª³A”® Ìô¨ˆ*'irZcR†±9̾§Mø>Â3 ûÙyaª–ÏǺñ:$¡­—hˆñµ}„§GA H¼ÐÒCVo®zʇ°µí@ í+X=:•‡7Cøpï(8,¯c”™aÿ¾xðöxM„}SAÖÍ »V™_· à| ëÂ}þ+V~÷ýþWÖuÕ®ÂU>§Ñ¤¥¹£Ð•Î\­ŽÊSqƒßâÄ-XBÚTU½‡† ÈS KÞ‡œ ÷ýsÈÙÖÒ?ç=×6ªÄ?~Hn O)ŽÍTž}«²%³‘„3¡^×iLêýŽ`·½[m_…–¿µ2¸ŽrVs˜KòîrÎ)oèë4¬Ñ‰ÛW¦w;TV ô©ø±Z^¤Ñ£RhÞíªPa”YUˆséspk¿Ü†yH¹ø®Ë˜¡¥ÕMN8%P%3oÙj>Ói±‡²<}1X0ì¿r¾ÿúrðì w¡ÀÏÜM±døM Ó?ŽŽ"ø',ø»ÿÞàáƒ*…+Nþ{2N~0Ú=…ožQÏÿ-2ç¦Õ³ÁèäPœ¼}ó×ýg«o~ó›älg~ÑØ)¿hM½!Þ¿úWÿʯÙGól0øÑËG^¹ bÄ\ÕsFØÑ7zqïx|#zÆÐØÉõòøwØÎw°X0ÉŠYroª{d¯X{ÅjY8÷1œ³`Žðø¡ Ì•ñõŽF3[ aì ãpÄ¿\Ä8\ü{‘mÖœãTk„°£j~ÚÒðcîÌ‚˜LPfèG ïW*àèƧ3={oåK…þ§è1½Rd#a®@ mm² »Çw>t£ /²üÛGF®C˼¤(¸¨Û$¯Ù솒Tþ-„ʈX±ôV„"ñƒ`_r’^„l L|ìDɼ¥Eàè=¸ áö̈(c!$•§Ÿ†âKxC·¶C¸¾Êž¿Ã©{Ø(ÛþÌ‹ôT ‰OÞ˜8Bì#èíéÛû›&Üõ²èÜa+ÌS”È7;\êöòñÌ`üVuº`E~ê–êšåÊà‚+D»¢á Ú&íD|«:'ÄÇ®êÆÓä’(y 7izË`7µ ²|Ž8Ÿ…wíA.%;y†xïõ/ÖÓ¾?–¯h¥|ë7E`K˵AK»”ò•X[mìÖf=j·©J u’:C/Ž¯Sâññ¨LÐ\´Iûíùµ4Ó ¬p÷rÐX{ô·ðŽfìDí ’’²R…·· oEä55MZˆJñ0Ýõfe|ˆ7lpÄ §c媘þÙ)ðÊ!=}o>½<:¸âbŸÂÞk}_}ô8Sy¨Hé2‘9¸|”CÒ<:]àÁ½û–á†ÒóÙxö7\èôà% þþŸùíür|2]² pñÕo|U&6ø—ÿò_ÊÈvæ jÀ6ß™_C ðâ6VâŽ,èuø ò“?Ûç Ff/†“áÓáÍÍ v¹œL†L ®ŒÊ^çáxtȺž+eùHdZ(2®«Kv 0À–CVÐr|0¡‚ÿÆË„üÚIÆ=àû{3>-pyJœÊ¸y97Cv}ÞfQW‰¢®q2V?òÏNSJ¡bvýÊ ºß|UHOsÛø‘¿ ¨?4{´W+å8ôl"¨‰*² bT‰ñh9m<,Z'Qš€Ÿ1`ÄžuXui$׶.¨÷> Õ¢i-j`˜¶‹ñZ¯7aQĶ-‚À¯ñT™Øâ×#¥¸Ó¾EËù×Ð4S…o|W÷³&@€wÁ§F\¶å¦¬ÂÉYaýø•8„Êöm½õ°~ÚÒµê|;Ìqo/íÔ9@¨ÎQ ¯©K%\¡Ñw‘HÉÅ„½ÞÓ—>‘¬VkY·JGQ7šeÅIšæÃ4µó[~»>¶µQzýØöúý+%`;~3+=ijH¾Õ1­úN½›Qaš¸µ»?@üØ Å´ æC™h©^¶qðí†kðÛ³î&ßx<â‰ÃTíþ°GûX»J\ÊEÞêÅX¦fÖt÷ýû¶ºÏ¸)#žHîhçž7¼¬WÑr®§`›ŸCüËÅ%óûœrJ'ƳN<öÜË™õ))߀c‚GËÌŒ“RoYOp;æ@ÂÏé(½bWÁ žç,ì|u¼üâþÑ0t°3¿l ì€_¶ß >/<<èö–#+}±oèõÏ3¤µ·÷Ò‡ë„Ä¿¹9â´À#³`:`µ—í1, —/MVÆb>2‡Ðæì¡^r\&=±ÃùTQ“ÑìÈ\Ÿµ›ù¼e¨|´2PSé%ÅDó%S&Ù’ sm¢ÏÀ6µå ƒå[h‚_7¢›^lÜ›(P “ëĺ]‘;¦´»›¬'ï± -e'¦#â'†Œ¬ÝÌØßa69G_á\²]óBí*µ"º(¥Âª›ÔŸõo ”-ªÅp;Ú›Ø=çÚýy“øÛó¬])èªÒÆQUÑ#wôîo¶uÜë9ïð¼!YtS:C£;ZØz=/Øù§’ˉîU9þ*®›©EˆØôrk:€qÂm§ü… jC£µd¾–uVZÞz|ƒ–/³†°”yÛßê/zøEN¼æŠ¥â|·:ŠN? ‘ÎwªÛðþʶŠ\ÿK솢qWýZC­ªÁ×øëÛWøÉHQK*U‰š²á´-åCS[¾¥- Ï2É»O/Æóûoèñ«\]2‚ɧìóžtZ\OE•BžÛüƧàƒ›}Cyãö9íõ·óþgØÐÊWFb;óKÖÀNø%+ðM£ó3â{f<®Þgõÿ_à|Ÿa¯c¦„½Å9Öoñ1|c:›} `rÀV™‹‹s†ÍX8³º¼¼xsó´¬Kü/Ø€&ÎvÀ'¹M8\ˆÝ‡G ÏÝóã´÷Àí[#Ú\W°€†ì ,!ÌPC¥öþäŠöòù”Õä5pŠºš¶Åz] 輦ÛF‘G†ÁBNn‘ž6$Âð´3âÜ£­ñƒVBÒáÍN»4dܬ¤ˆmXr[h%ˆqÇë‰ô0‘1Òžƒ‚÷߆޼ ‡²GÎ@,L…L¶Ù9dÊá\ú0;ó&…Pp£VuÑRȪmBògâw3аˆK"¦£]-5a;úF: ¶ˆÁî¿øŒ&Z¿¾¸ñh»%PÉ“Ý”K›Ä:Ç'ù ]ÚE›w¯ð>6\$ó™äÍ붩65ýn:†õ‘¼ÄV˜#` å뙕üØæzN¯Òy}G©Ùö, ñ–¬ÑXoãÓOï4ù"!ˆdG·ãÞÍ仡ÝH2¸¶¶ÿššë×À(Ø©ú­-y™2~3­i áÛbeTœZëQH.Ö$ ÿ*ú©(ðÚáÄIz>Õ|Ç°ý[/!Šõ‘Œë¦Ì¥5TºŒçT:z¶€†ñ-sVôÑœ˜O‹¬^¢?e:`’xÐD¯=¶JÖùÅã˜L‘!ä/_½\<šm}W/žæ/áYL øŽ(ð}è1Ô?6‚}þÅ/~ñÏq•ïø”çgüÿü øÐ_âÿk”Nû›¯þÝ¿ûwŽ¨î̯ 6o诀؎Ä/V¼ÔL±îÝð²û"³Šuxá‹î‹›—xÆn€k4a†ùÙQËž/êN¾mWöÎ.àƒ»f¡ [ÿj…-SpG?Þ<[L„- Œô#4 ¬×ø)†L£=2Œ¸ i]FÖ]ÚÂÍøúOÃÁ"I˜Lì(aE±¿ŠÉU¨u ‰Qd‚*Ðê4b/Jì-|ËØaBwýâ¶Ìµÿ­óH½Ä4[¦»ù[‹«cH™n—ïõ<4¤_±ešýY“ÞÎîÞôk<‹°ötÇëöšÚkË¥yÝ.hýn…Ù¸ëÒM:™žy£þpÞ±ä*®(QxÿëFÆ»¶ßEÅ ˆB©åÿ™Ÿ|+¤Û!÷ž=1·òpÇÓnÁ¯GQ1J<´d£¯é#þNVúaþÜÉÇÚßÃ}ÇM³þñÎO/妤’ÕtÛøF…lÿ&£ÉCWHT^²±ñõJ•s4·5Ë“êá’Ÿð&Î\`t@#òA¨ç¡äÀ¶|C}Æ/x¼Ùï#øÞ+Ž ¾|òäÉüý÷ß¿æŒÿM!¶³¸s¿q ìFÞ¸Ê~uÔfaH™ËâƒajoÏU®tböV,xyÀÇñfÆGp-0'2Ügeíxè?×ÚÂìØZSçéstð)½.Z²¢À¡:Ïæv•øÐÂÐÚ{æ„æöœFðDÏ4¿‚a2[ G­¹éšåµ?»ÖÃ|ù²Ó¥¬ï®3Œb›ú ¾éKÉT€±æ «/Qu·ÆƒfP: ¤ôvÏU™“p£õòi$)RFÀQ½% Ϩâ÷§ÓªätˆsLj¦àI£Úö‘ÌeRÅíJ™œvØzg–2'b»"ý+HyØ'ñiK£ÚÔ~4%”ŒId˨©þ™.ãˆN‚Œ«–új5¨;~q7F’FSÅa0Ϧ>pë'Pác€•éQ#L¼Í“E„ à[·¢qx£‚]3Å)%á5Ò`Bµˆ¯ ÷ -‡ï=üRµÉö¾¦·©·é—mÓ™‡~R1-ÿ„øW>ý}æÛ´ë1Ï>|¸`Äôæ _ø‚'©í̯ v À¯ ?)‰?ù“?¹f·ÀG?"èPîó+ðyÉ_^¯Ÿ;d>ó8íàøšÿ—´tO-Ï|~[Mü1Lp4Z ¦œóruäFØ-À(Â1Û¿hmÿˆUà|² —²g%bm Ì5£a2Kñ¸X0œ„!Ó I–ÀcJ¡å2Ó`9+[í Î…ü\e*±s”h<ÁP8ÙßDÅÕÅ©L_&o`>~êõÇ…fFÔïвÌHþÆ \¸ÇÉ«›ƒÛh˜cwqÑñä9­ôéáAôbw•eÊÒ]Ð&TFçyó‰FŸ0 ®6÷ϸËã:ýÔPÆÆ­)àLÛ쳤0 ·¥H08fÈ'{ÿË]ù3Œ´óXP(@×¥즥M)(v¶xjé’.B[!n}x’£åÉZüœÁ–æm¥T <¡@EÇ&¾B¾=o(YaOz î¶tÍQ gcyOr‘0Ã3œ/têÏp=ù¯ËxéàGÀ¶„óÞûÇ]ï DL§•ÙTÌa¿¿Éê¦mÙŒš¼c”«ÞDCÚ:}_Á6a¨ç¡¸„!’$ ,ÁK§ mðئÍÈ‘ÔÝá ¯B6NhÖÓ7J GPƒ#ž)¯éRþj¡e0iå‘|Nü«d”)³i}x¤ý‹>˜19eRáo©(áÞÜ·¼`n_›þ«ÇÒãw®Ÿ)€³ÓÁ9Óî`‘3tY‚Êh¦=~‡ýÝdˆðöÛoÇ&9®ö=üÊÁß"øí½O§èoPà\2=pŶj_Mj·œ»ß_¦v À/S{¿dÜý¯ÿµ‘Œ|ÿûß_ð©74×/MüÞõ€`¿áY °66wâç8ÿ½'äP ·ùà8>xð?Ãxçì­}y:bসâbgm8Îu—L¼ÈöÀ³«ãÁƒ‹ÃÜ%ÀÉšƒÃûô"I%±ŠÞÄr"݈ýáŽ2¤'ÅW)£…ÁÖG-Ëô{”Côï{‹Ñx HgOÛUáe8ön»q_qQÀ—ÇÇàˆ»ÄEa9Jàˆ®þ~†ÛaêF,»ÙMCáão†¬u‰× )÷žªY÷ pçé˯å/ 8„Cg‰ReLÇÔ•^Hð#%žÔ]¼pe¤zÍ.½Vmû󞧞>t"LbWÊŽ|Ë[".ADYÒxÂk¿¶xCJ:¨.ÐÊÁ@öâhoÞÛÁþ·=·^R/9ªœ#ÏÉ¿ëž4Y7†eæ)a^ïÇjÉô@†ÞÃe®7B2N^ä>âÏ9öÕaû,ÒÃœ Žò¤·àÎ÷¼gÀûܾÍÁ?i•m›K×Æ7_Þ†Y RÏ'xÖkk?’®zðÝhFzš*k+%á/qlƒÂÞë;q(»Ò*¬J'nã“~ÇÑ]Ä€ôW?4ÀN{aãÇÙð´ZâØUµ“‚›Ý©·8´…tKjŸé>G Dc¯QîÏ0†ï²»xT8è¹ÁîWIB¾‡úë¯^>«ûÜSxƒpoŠ°çï»êPÿÙ w!-æ?<ü8¶–1ä¿"܆ób"N9MZî îz´ï áÉþ°íì<¡×ÿ—L p[êÀ-~‚ÜwÚ~wÕO+³;ókªðkªØ7%ËÇOË‚—Á~ô#W™1=}ôÜêz8œµÑ\ùÊ‹¹Û¸ãºVùè¿ÌM¬„¥^€Yn~ÐÒüt lòj8ï㊧ppWÁïôU)ÂI1²M:Mè“ ´{:æIe×øšµbg±Sö€ïüP3øëW§BM’-v‡c—_œˆW@Zœ1V0C*‘‚Ó½¦/ÂÈp¡Ýµ¥»¦]¸ñ›f”“êmMµŒù´)*¿¢©$(#­’¢< ÔfpWŒœ|UÖWññJoÝ¡{"D}OÀH›]#äÝÒç©~—ÜîgÄk˯hCT?Ò`å24Ø~ Ú´á~ÏöGè;Ôï*nö=çù ÀÔ¯ÿ«ýÏž?~ýêÕ«ÅþáVq-òÎüZj`§üZªõ“å#ˆúÿñ?î}ýë_¿fåë9ÖòéÓ§Ï9¥ÍÇÞòñ<‡ ÞŒ™àg à`r{àÙ|lœüõF-¾Pöã²xÿüò-ÞGµz^ÀtÆp-Ÿû¶ ã@xpë›J…#€±477ÁÁŽydˆ2Ü24ÝÝŽ»˜Oà„®íÆxÖ †¦U ¬ì>° LêAá?ÍYL®NFCht$"dݶQä£ <1YÆÆháY>G4â™î&2Ý25T,~Äè*†u&-…8öš7˜¸!ˆr…mxhO¡¨˜wtøôÆTbÌ“Á Ѻ¶¯éÈš÷h›´“>óÌð6äÀqzŠŸú¤pãÙ–™yO¾¹a;™I8ˆÔt‚¥òñèÝxýdÓõÌ“só ´)mý‚÷"Ãõ°÷ÏIÖàÕªý릡Ž# •„‡ôŒo8äÊ cÚ zqâO¾À)olÝÖiÊ»@©D¼˜Èuaþ[OŽÀâ_L¡$|;zÂV-°A…¤SI×è T ó{ÓˆD;÷äÖ3,DDܘ€}S‰òN°QlI8ÞÂç?å¿iðû~Úºæ$øü8~Øöø]`«ÂMï"‚Ý}îñwnßžþÂÅÈ })§‘!0Dq IDAT5@ðOYð×€%ÓûG‡Ë¯NÇ‹ûjÞ¬Ãi‡!ü—½¹`Bÿô…÷¶3Àðÿd 3gYö9 "po5-‚ž ¯ A Øc0bÏõ‰›}¯õ.™¿%,FâpB¹ÉSscE•_<ÜÅ—„6¦]LhCG¶ñÉTDküŸZB(°Ðƒ¡%x•`lƒäƒòÙðCÂÌ•&pÇŸci…û/‹Ns†‘RæäGD±c+ÐL8‰S h¢ÝqŽ\:Ú‰—º,¶|ë½¹¦WqîÑ- {Ü0g…‰øöÖX;ìܦ ÷.ˆÛ}§WQöö9-Ò¶õBŸœØnªŽýpÍ/ÂW›bšF!Û·ü¦æ’5&K·+âöõ˜³,% åå¦×”[ÿwV«Ø{çµ[+s·ˆ9=  '%…¾užE€Ty0€³²#HÄQ¨?ƒÈ yÑŠIùu•b¢áÏÅ(#~LÅÓgi[?d^ðzG )Lë(™@ý×HYЪåÖyól8NG(dcº»y“ZsGÒI€ñ±ýç…]Ç'¤£§åâioím80w´¨æY¹^#J”7‚ÙÖãm ,AÁ·/w’o§ïŽ)®×T¨”ÚÚ#’¸ ü%‹û²Ð^ÿé“s”ïÜÓýNöÇ–ö!õ¿ïnzúLJu/'ž¿8:<ô€Ÿ †ù_pþÉÿ‹}àwÁßÁÿèK†ýÏYíM‡çFlg~Í5°S~ÍüIÈóáÃo/¿üå/ËÁßûÞ÷ž1o6<===˜N÷¾Ä÷õÃtÎÏÏ—™º·PPXµœfŽÎ…9§g¯WÏ3\:¿D`?¥×‡TNG|¼Œð¥0$·\ž°1ÃÉ9›A´·?GhzÓ\*t{Îã jÎ/“-™Œ£(Õ´QÄc¶–Ü‹×zúäÝ@#ÜK;¦ÛÅðÒ»ï¸-^0¶hH]l…E€Ð&f1zÌ:n圀À`3›</Œ¾rÁÔ(NÑ ½–„ A'î¥)¡i#$HˆÌ·„Â:ùVi{ƒëYü ²×uÄמ[Kð⺠Æ}b+,†Œàˆã™þûŒ-s^Êöþþ,pG <Væ,óÄÚ™2Y©ÔÉï®Ü7kÖïá¿Ì…@ÕÒÞH>—L…Ìy´)z)¨$8j€>ø5ÓS“z£*bô«NJ5P|ßšìÕ”²[Ïä…B¨Ò$¾eµþË&ÈCé›lµðýµ Öa ø6H›^H6ºà¹†b×ì[’XO@ÉtbòŽ$Ÿ€¶…~î‰'·FJœµ W l{®Šî³®‡*ªé[£M֙Ţâ"üŽ'žú² µx#¦gÐp®ß¸SÜÚ ,î!ÀÇæÛ´à'ô yâ 1„üüå+Îñg?Çû>ÿ nóã,sü ÿc#Ì'Ócø Ü‚}þ÷î¾õ÷Ž{ÏŸýx4™¸¿ÿéÉÉÉaÀCÏžÁ»~ðµ¯}ËÒb\ Ø Ú ;ë×Z;à×Z½ŸœxûúÇ W\°UðöôtÁIYÎÇæý ‡]òÍÌe8,æ›p´g:z\&_rqÌ™éølzKnÖ[Î! `9wb…ÀNÑ$kHÉî²€ [……LWA–7ød+fÓ§»‹‰[¼ïŦ1þÏaa¦Øò΢vþØSQ@¬{öâ¾N¾E¿çH”NR[x÷wGJ%%À4M§†ãKÀçœvâ¿ĶÊbtãèAÂtÇàØL!t`·;VÄ@uå®è•ÛLuÚ^ÌTÉ ³ ³nðS øœ2@9³\Ž"(B 8³óÀªvÄ%uâ,€\noÝõ#>·ÄwHÞgÅ”CpÁW€÷5*N¨ì”—NÕŸÊÿüªE¥U™…k´»»ÊdŽU‚0›Ü­Ò…Ù`±q“þÆ€£”‹ñ Ö4›8=¤Qß +<×&ÈЋMÜ$_¢ ö<¡QÖjÙ ^'üº$Aý1ŽuÑÑôw#Ùm<áwñÈ#{ûÁÅmo?B_xüÂxShŸ,ÄvNÿᯰBÀ»µÏ³ü—Ø7L ä€4=隀çp‰yzÿìR‚q°ÏpÈfÃö%½|{ÿöúÏáIîjòŒ§®ñwÎÓ‹µ³C5°S~Cý«H†…17<¸œÏoÿ†çˆ+/˜8»-Ê¢À)ì?åÃ=fÍoÆËÇKï늯æôÞeâhö§§¯²ÖoÎAA·{çƒWœà‰ÞáXzQ®˜pšà”G:Îã Ý!€;‡‘+˜dÛ%tdá1€á1ZM\†ôµ_˜ÿkŽ•¨-~0å\aÍ©ÃjÓÖ¹ÕÎì)_˜°q.Ë3O…ÝIGÐ çqÎ3ppî؉W8Æ_—‹dk UXSzúZ ¢&IC1ÿ²Ió›`®Mèæ˜kp€Ñ“¶²j#q²]MnÜf6dR.ëÞÚ‹§û×G öiç!í¯ÿ–{#nÜEV¢ã7Q•yo”•=O•„šÂSáo«šïaģڀŰ¿ytˆŸ€¥a*îp®˜7·ŠBÍÛC‘¼d„*ù„hUÔH$ÿ¶BDÛ²¤JÖîôÆé‘‹l]¨ò¬ëÄTõ:¸õƒdHpu&=ÈK!!Vh…WŒbKÛ4¡MyŠùä{ètSC  Q2L@‚ÍÖ)™„ËàMž¥Ÿ$+hý›òU‚À ÅrÕ¶Ëä­G[£ð.‡É1‚Aš¦”=ý8ú ÿƒ‘‡LÕ×Ó)=üó«áÙdvsû!ûþïÁ€~!?cÿÿpsŸ_sYC¯^´`7§ §7vvÆ‚[ºËWs{pÙ1ôÇÝž· O¸HȇÁ<>f˜ÁLÖÛãWp˜ÈÜ´Š€L‰Êp7x2ïbà2¢×Ÿ/·ô»©Å|åÛ†›‰ÆÚh/¶0eÊÉ(A¸ÉÚB‚,ëóÁ c\ÓÃ]ì;AÂÑ—^´2õ “†NÅ»[*öRÔÒìÂœø 0c˜¼.Óƒº.%)k‚åá¢mÎ,›Â&å’µM ù§éôu»?¾ŒâÚ§0oíTåQp%´‚>Ñí±+Êý£-#ÖÁrè;8[ýšk©/nƶWqQ¸óJµ¶g˜¡_ ‹ý cv|2 @vŒ_ë¨VIƒ¼$ëdJœª¼—±J*Tg•Ðk‹{XÙ¾ÏÎ`hWA¥ZT,·ñš/uÛéGÐJ£Ö,¼`àGPk×#Žn•åN»¿cE¼¥Ip¶­v¡ß_±$j>â\áÅu÷§%]uc³¶6IÔLATÒcoôP¹(›=}ëŒA\faB÷<ûðÍ;Oö«ÕýNäŒGšŸÑ@ø¹ÐOû’N—øØû?}þlp΀kl´[_ÒaN?GùºâŸãK¾=˜M'tF×l|rtÿä/QV.8¹ä'“ñô§|k§|c/P ~‚BxñÕ¯~õæ½÷ÞÛõþï6ýoÔ·S~£ÕýK'ÆaA¿·œÏŸž³Mç-zrppôx¹¼^Vëë…ß+xЬ‡Ì³Ñyßg{Δ‡<0ÈÞ"½Á0f¦øŽ¯®ìÁÔÙ0¿TÕ³˜Ò³ãÓLg!?rµ¹‡ÁTn8Mо…¬Ûù‡º#ôDáqr.vwë7°3èÍ0·!o6bÐðõžúJ$Q¤Vì»(¸õ£ÐI–`‚E <™% ±ò rÄ@üRÕ©&”4¹—'Û¯î¼$p’Jâoâ&-凶ùè¶aÈ×d²'o`£lq„Ô:Àz­ˆæÌzöWaàŸ®j|ÖÒºÀ\+&”·òòºmQ ÉKãzë¢ yíþC2¡©¿=¦\ô´umLÏ¿Â)ªÈº,kÇÙüƒ˜Åz)B͈±"îbS¯N€¬ÔºÔÜüIvÛ]~C¬ÈÆ›w!RØ Ó"Ððü莧ù+ U»1ëð}ƒöq®NÙ°îÞ¶Õs4&§[Ûðž¼n{çŽn™o†ã·öø³&„rÕcYT–5f+ìo<̇Uý×,ì»r•?0ÝN¦1Mézôñ„«H§}·øM§ãk: ·ÃñøEàì€ }èñŸï&Ï–{ÃçäëŒx¯ˆ~ùµ¯}m×ó·2ÿ;›ðß¹Þ4ùÅâÇœ¼9¹b _ãþéjyÍÇäo9Akï‘ÂÓù1 —qÐâ^Ûwò¿a!ßœÕY^䇿ª½Z0rÏ @¸c¯Xtæé]S´z—™D)àÌz¹C@¶ËD2JÎ,VSœ]Äd¿öÅË€"6Y%=ãÕ0¥8mÙUùÛC íðmœMû1w}¸ŒQÔÍ/¬*%4"Ì·r pÑ(ÓÍYÉö¸ ‹ÌºR¾é `BÅÞJ#N§›8­D¢ZÚÀëÊårGàFÐIÍ|ø4zrí˜êRÌ_”rN;¹GÀ8æ·×l›‘ ýø†½]+!Ñ~ŠÞ&=Ón0“neŒÝ„q FÐcš2²ãÙN*ñ “j/K¼w~ œ­CŒáúüV fvGl£áiUœD%¹ (˜¬`+?Ñù)b"' µ©x•jz÷î–ÖáqwÏkeì`£ÞÉï†VÌ!M üGrÔ‰çìò}»ß!.¾YwÕŽCÿ z† yT ãັj˜Å |ÁA.óáòž>ß?goÿ5«ÿ3×àW‰´­T¾f98Œ½þló³Ç?óræüéé¿ðS:§¤û‚)ÊsFÎÙîyFï_ÁO:cµÿöÛ°)ôÎõ¯ð¯òOž Ú3£¨·WþçþszèË1σ"£qã{GGœù3øâj5ùÂx´÷­ãã£ÿ‰!·éÙÙìp[ ×_ž|ô8SŒ ._œáFpÖìÛe*€ÁƒÁÉýÙàâ­Cüu™Ð1— ÜæÃ0ûè€0.f‡é \ÀpJгAO1óÊÎ'£ä+tV^wàSéVÝEnæ¯KŒ‚JXÁ#1º²a¸œmÖq:¼lG2Ö!0½D€Ûµ=Ì)„¸ùé2¬ÈmMð{ñÔ¶_킺¢¼ä°Ò??Ƀ´ð¥l…X=pò Q¸ulÜ.ÖŒÑÀîSw¡QùNÚøI¢¨ú[»죹NBf¯ˆôÄÇý¡£6ŽÖLÙÞu .•EŽ45„.AŒe©§Ü)„ÓF“&ážp莃Ø=#‰O^°Zæ¬Ãò8Õ4~úÈ !¯™r)›iå¯PöQR5¬×nÓËdH]¸ïRb–h­þ?„­ÐËÜzÓþ9e2^ Ï|g¤f¿;°mhþc¶œÂ¶²³Á±’¯ÔF‹XÁnÁó:HÎÓ× ô(ûu#é6¡ùÌ™eV±Ñ‘×8û!x*^þE°|oôæµÒŸsƒŸ¶=ý§~Úzû×îsÆe>¯‚Çg?pƒ…ÓcFßzëyðŽ‘ƒÁÛÆfÛâŃã“?a‹ßGäMAÿx<=¢3rÉâäï¿Z.ÄÐÿ¹Âÿßø†ûˆwæSP;àSÐo’>.¹E> Éò»ßýîŠm5,¶åH®Ñ$l²·Ü›Ž–#7çòß Ð§ôê08™òpR=WÂÊE\ž cY\#\ˆe!CúŽ,¸4hY; €\8Š‚›"¤eA0ÝH2ám2=N“Ýþª……ß8…«Ýá8×Fö§1ìç›;Lv+ŠÎ0~t3%¥ÂÊ–yj Öq Ùu]ˆKò0a:ů!%¤Â{9Š~8/nÞL#{h&=ˆ¯…¦¨¬yTõ¼6pKź·-üþ­GHU¯_ÁNÚŲòˆÞ͆X‡ü¬-~2c&’3#°%O‹·å·|æœ|€QõZõÛ"Ä ^Ã×­°KÕKÛd[¢¸V`ù42 ¯ð¥Ñã¬ÌEð·ìŠZ‘2‚a4Ò¨D±­7ae5_¶ër §0ßä·¨VMU’é§ì.Ú3¡ZË¢+Cò±ùƱ}oüÚ"ôÉ·¶B<±È¿0yj¤ 3tß J@Vúgµ?gû»àOE÷ÓiD #>‹¡ãè ‹þ&<ýk[ùtBÎñ»½ïVsÁµ%s˜ KCóûWóËßþýß·°3Ÿ¢è\ùS”¥]V~Ñxï½÷\'|óäÉoÔZðAD\v[Ý^; Às€{†}Èë‚/8;{Á´€Ûz¸ÌãœU¿Þ)€TÜçÆá˜ÜåþCö˜²;ÀéïüÖ,ŠÁˆ½ÉSÛioÂ7®dpTÀé€=Od½ÁŠíD$”u„sš8ØxaJ2º²uu!ó3L¿nibŽmY jàë·‡Ñ*Ww¢,Ë,ñ+M½·m_ñÛptsæ—ü³lRìMxsºJ~Åä»±>Ö½n¢µ<—­ ­Xè^1 `…ÒDXZÆõA­Ð0ú\ÛæÏÉûð£àØGÛsÞ¶M o›x, ‘™wbÛŸ\ÝœàV‰³æÁ"ºŸÄ$S”Ïí}WÜ,©¢à@—˲¦¾d$É"ˆãqÁ/Qñ-ýŽ…§µx+`þP†¨&)Z‰>_«)ðyôÛ&–:mx5˜¯¡j2qDñQù =É7qfÑ~'¨y„›ný#u[fkûgO›­Ó!Ÿ½¢GSÑ~à-^³T—ÇTè$ûìMNEÓ²R<´—‰»sò ÿih†®N»WÏŠ¦®Ð¶vn\ÝÏ“y~ø={ô(sýžäwþò9‡ùp”/ Á…§ú9ßOkIÓª¦÷àøxpr|”3ýǤýÖ[÷3@âÉÑôà/fãéðÎþ3ŠÀsž²ù1ÊÁO9:x¹wrrñ¥/}‰óJòXðù”Ô€_ûÎ|†k T‘ÅøCÏÔæûÛŸ0÷Š.¾þBß|ã«·À_2Z€“}¼ô 9‚;9wqz 7­ykg0$xs9£ÙzÄ,«}YD8ãdⓇ°¨ÖƒTH…¡Áxdò6™‘,¶ÅøΠ“Ê¥åvÒQdCÓáå{ÓßbƒÆ’^§‰½å44z‡°dv¼ÁkTÂŒ#ZŒBÎd¥Â;ÓŽ"Rc xÝD°ü,\°K "' nÏÔ^·iØãÞ¸;*žøåÅ–û§©oêؾ¹ ’vÑN)€B»ßbhÛT»P>¥×où3†%ÛÆ "pÚ€ù¢x‹bêШåà±gîÚM²…mý)ëcë&xA§ý3X jÒëenù2Šy´…bÈÈ’0n בi2‘?íŽUöœäQ"ŽÅoF:?׈ÒÑbobI»‚ü-ßÖ]Ý®”̳-emOãe_¿­Ì")°µçÛfžtT¸UºX¹’Ñ=nñcÀ­~žêwzzÛ5‹¦˜ÓYsÈ”›È³-xìÀ#Ž0ìï_Ï&OX ø>žs„þ¦^°-ð…åÉ[ÿø?&ßM­­rì~?]5°S>]íñ‰sãtÀ¿ù7ÿæ–8˜Ò㺕›œö™3†ô>( NðŒNeAl›b‘.ûxèþy¼ìxä‘°0 zžkŸ >ÈÑ þ%=½!w:y¹\Èõj /þ,!ÆJcû 2!9~—,˜sw€ Ý Pì¨3>™·˜2;ŸÎ+dYâø|-µ‹«yÝ.hýö°N¥hU¬nmAaò8ìO‰Æ×ýÛÊ@!wæ.»ý8cÛéN W·íµ0¹wLÙ¦³6„Å×AÍSʈÃ-@ÙºË_¶B¼êZ¿nqu›çŠ/Dw÷+™u& ¯Xº¥bLÃ5E¥ì¢,¤Â·…|A ~äCAŠšpâXÞVºÉHè'lí jýH"Âßx‚5Ý ÿÀ„cÖžm ð„–½ÝÂ{œ¸7=J‹Y¯Ãk¤zXÇ]¿¾ëBU÷=3k£1Žó÷ÀŽ_ú„˼ú† òHÃÏÏY¡ïw£`_Î9„ËÁ}ý9Çï*{ÿŽÂ¹xÐÆT¹p_¿·ø)èµõ3À:£}8Cüê{ûŒºyF’ì!œg³K˜[ŽVƒÿðÈÈÎ|škÀWeg>'5À-‚#î!ô÷îÝ»7¤çï.ž½¯qLçïà~ÀN€g/ÏþWæøŽ׋·9,è›,|Ûƒ?yœS¾ ®ù¼:œ_² Æ°·¿€)0ßï¸Í;< Å{ŽÎb;?øöÛ÷Y'Ó`,’, X$L\WÍ¿ä9…­¡@ÁFÜ >hÛÄ–sÞä6d•¢éñˆ¿¼ñÎøÚa HÚg ‚04d^‰oZÄim™aßø€ؘ6–©™F~[/µ68k& #­^k§L|8]`‰Ra9¹¯‘è…`Šæ³Å.WÏyùœØD7J 0´Ù‰O#âÒËâã\Œ •¢™)€[ÏÿǽÏ]{ÀfÀà tJ@øÛ±3Zs}LZÆgdˆßÖÄ¥AÄòØ_‡ú¯Vž÷à{ïÐ~ε€ý{XÐÂE¥Ž.­‚Å:3ÇÖAöPX¯¤á¼´vŒEÀ(kAP‰ˆ»ÃDÞgÔ¡¡&ÜÓ¹iSº•‚}Kf” coaÆÑÔ»Pn}Öµ&£! ¿Bø¥vÀ3 ÍžHN¿YkÙˆ¥%¥…‰Û×·¼üV‚ú=¸G£`? }‘æB¼½ÏVQÙS)r_¿Â»ƒzäÚ~§¹•ÏïÇc{ü+j:ùbpÁÝ .òó¿ggí½~OýÓf_.ïÉâ>>'ŒfØ_àøädpttÈ7?œÓxttxüp8õí‡ìúS~'B-O§ÜKz<›­¸îïú›ßüæœlï̧¸v#ŸâÆyÓ¬½ûî»r näá×ôúG?úѧÑú2Œ –rr´÷¡u=bLŸãâ-àâ˜%C|G0^…s¾0ðÒ»o9¡ W[f¡‘ÂÀ‘°.ô.ž7g0*ã°fÀŽBíC—Õ:÷OÜ0F…u[F¨P(˜ûØ—pÜŽd$€ßbš²Lñ*e6Lõ. ˜üT ˜0zœ†‰õ$v‹N Öº›Ž,º žË}—š0C Úih;Q²Æ%ÍŽšJ=Ë8UV¤#LËYƒúEˆÂß^ií¹p/ ÿlÛ´ì>PâUŸÌ8Þ8X©›–+ÇÍXÏQŸš0]™FµR©¶ ¦¥Œ‹µäÃ?…q-E -æ´OèãV˜‘`y»(%G€ï(Jt~RL3¶m€Ûs ½#ô³_?NâIx÷ÙJ=oéîþfvý¶"mAéÂãÐíûc%é$®MrØöî;N·UxFÆiöä ~‹¢;jÒÁïÆUS{ë*;Ä[(Ðý–QöÜàçµ½.ú;ãd¿ÓRîú¿tëŸ#sÒ·^­Vô3màŠ~{üœä—SþTp³pXÅãfo8ºB9x4~ººY<žîýäÑËGû·û–[üVÿ÷¿R¿S¯Hò¹ûùôÖÀNøô¶ÍçŒÞAq†Š· Ì`—¬Ö>W+W—û˧lè¹Þ܌ƣÉSŽ†uUÑþt2;F$0Ê7âV`zœàâ@FQîíÁê¡wÍABµžæs‹•F,¼º¢7÷…¡<À Ø5à¹ábpô[97¦ÖÈÊx`\eË7dwÍ„w¿¶´d’á¨za_!“ÿöˆ IDAT‡ð°3©U5HÙ8útT»qfƒ×’¡p‰œšl7Y)Ê®N<ÓUè$}#v‘U´*º¿>R¹k„P«ë¼õÒ ÙÆÖ_XEÉýýÒ+d£ŠÍc^“šæ<¿uí¸ëTš’ ínƒÄ'‹ jë°Ò*•sé€'.G¾@CLü¤x„UD~ò`V*_e'¾ÙÛ2=Ý5^¯€àH !“ ‹Ø½Úݽ&'Àø"bWþ ÖýcÆí¦;»-¼»·›³Ã Þr«n¥9€W¶J˜§é?LSh×ÑëÔ¯„Ñö|CÆUø˨ût0#h×ð=o4ß+ ‰ð¿¾¸b?'ù¹ºûêòœQ”Fúnù–ýH}Gƒf§|íM²üÞ{ïÝþÛûoOG#Wxg S¾XŒFܺǩAƒÇ3· ~¡Âƒ÷ïÿôî±`4»à.VüsÇÀàòê%÷°Â›…‚*9Œ gd€©¾›[}™Èœ!§…L8lÊAB—Ç®ƒeF6ž^ò\eè^ÅaHxnij«Æ±ÂYPh¡ÜTߌ<6âN‡B§|°GyŸBÁŽGw ,ᬘðg˜[ÑGž;v0ß$Ao>ã ÿ¬ ÂL¤„öŸ–£„nO¤ìîS5õóÛJ!…€áö‹H|–Ÿ§²³_gZá.5#Þñ¥áo=)¼Á³K­›¿!]q…®>+À?sâvA•*Wø'Ív˜i×i2cÛ­~n;YáŒMŒWöÏ<Û'jzˆG>Çë]õº5]ÐmÞ ‡ß†¤¿ÔH±4Á0B#’d@V§½&@pÏ£±SuqÍ?Ì:¹Š½¦£Â[š¶ Ĭ/,oÕ$d)s‘­ùvW«ô§)LÆ6pDM›Ç7¥àœþ„é¬ Ê­ñ˜pɨA¥ZøfÓ´¯XÐweèõŸ1ÔŸ“üP.èñŸs ÀÅÙ)JÀ8N]@Ë]ŒôÙæwpà‚óûœåÿàAv0œ=;<øððøØ |œôwÊ4ûú¹ÁžAž°¼]¾b›ßÙ‹/vÃü6ÆgÔì€ÏhÃý¢Ùþã?þcYòËwß}÷ô _øÂ>Ûqf·8J˜#½àoÜ<‡u¾µ\®N&ÿèfuËåèüâpptÂòô^¼²E›ßØB´@øŸ]²€øàú†uØuˆCôœŽÀN+€%Ûáf‡'Kf›™EfìÓ›Çp@å[˜§½IX„¸9…A•@ŒG@˜ª 2âR¡£ÀÉ8¾‚–$&´.ÆÁÿšR°ÆhtÞl}2b’lÆ<*Y°¢It‘mžº1OF¨Hë¨ÆɈƒ vUy/!©¤,‚¦‡9ºRéFÇ9k±+}âFØVÂßýúQ(G®Š 6a‰]ñ w|]å¡çÈ:÷ÊáÂÉ¡~q®™Ðï##ÓŽB@ñ†­BŠŠ3KlKæÈd}ÉgÕDJÝ^›OnL»ê?¥r)`HB=¯UGôi,Þ-È%Ð7Ê´ ¨ ‘NFp ’FÚSi¦Îp·3µ¾tnR®Šb¹*ý·M‚d„‹œSÆœšg}Ùú„ž£g&Ù•2‡Ýµ}¿تi¬‘)ë ø‚L Å‚XË2KŽØ¹àø^¯èu¨ÿåÓ²ºßm½g\Þsú… Ýì·äb0 Eýáñ=FX§Ãa÷îÇv Ï;\æãð¿ûú™øàèÞÉÿMÞ.€}ˆðßøåxõìüüûäãtõî»ïîzÿ½A>ƒöNø 6Ú›fY%À¦¶ÿãÿx1O®èµÃ?F{Ã%7tác|~8sYÇ ›YÎæD€ãƒzì orÙÏ&;bq_#,Mêío.8ZÀÌàe\@4d®E ÌÑ”^?ÓâÙš!@²@+‚ˆØs®º8«ëp!9»bÄì«ž~p…ÊO—xÐ[sˬ›ëMŒœ»›N[XK.…S«1ždÇý±Àƒ%eqã0û¤¡ÈÒX= q4Akž40½5ç­ ±O$…žîÄ´QRÕ>fè Åtº¦¥›á—:ê9iB%@“<‹RžÊxùø­²4D¬-€ü™òm»{x³S¬æN±t¿†ßáS€¼>¢‘¬jÉ:uÚ“)|ia|•7ˆkìÀzÝÞ_QãX/ ÷ÑíSe•F)®ÈÐø¶dË™ÒÐ`ÆÀ~ű-kíŒiZû´Bß»×,øSлŸßã¾—õc«¤»Ý×u)pKÇ…} |æÿø“ ûó‰ßò‘/øîoøî/±=ÇŸ‘ÃÑ9sÿ/Q^’ð9ŠÊ‹ŒIê Í?¯Á¦r’«ÝÏg©v Àg©µ~ù¼Þ>~üxùÅ/þ“íÉõËùŠÝ\tÇ:†½Ã0ðÛôBŽV³1× OºL`°ÿà‹³ƒñÛ0™‰½ {+Ž ,94hîö"lØü‚ãƒÙ t '=u=xö‘§ î î?€ø}qÍðt†úÒ=‘Döf‰Š±åéÅN°¼qó„çNõBTˆVœiˆÛ=9Ñ–YÞzÿ€üÈøØÒÁ(ÚŽ[ááq5áZpïØÙ‰€» v³cŒtè% ö7·åL–%æŠ.léx¼jè%°Ðå¼ ªó+#OhL¡“\hçk4rDvÃÓoÚ×ߌ(.,{ùe²r=¸öÐy⶿Z ;cçüwlÁ¢xÇþ~ÖŒBß+êºÝ Ò'DaoÕ2ûç@”ó¸à†¶Œ™{[¢çS}¡ÊQð*Y+DC¿ÆˆB›x¾" Ýü•¡Vlï5±Ê—a¶«;X:ž—át_.•Êoå;w]˜°ˆýOgš dß=w²kËx byGl–ë‚~Ÿ÷¢zÿ¾S(ÀÔ³õcù&Ôc)k”—oÊ÷Á4&¼×“|ây·ünÍó :BqÆ0ÿã>ˆí‡ý È"hŒÁ™ÐVûGìöàP¨ÜÞÇçü6Cý*Þâ÷àä~lÚm~txðçÿ3ÎùF>ÿòv±øSvu\ò??8>~ÁÙדét~uvæM~~œ[5ƒog>s5ÐßåÏ\Æw~óà#‡oÜ.¿÷½ïqLj4ºœL°Sàf¼ÿÁñÉxK;¹Y OÆÓ›/-–·¿Ë°ú‹ùö¯ç÷V7(ô.àAÙG¬2púŠÕÅ!qÞ¼J¦èœ$½:\ñ6Cg¬,>`˜ópÝL°À9Ò1#™+…—ì{Ð@„6Þc Ø… ˆØw{àžSöCaò7Ž:*"`v+y‘»äE¾ÎŽàv” #ºÁpG¿¶†¼öÞ‘¾ð S¬‚.cÀÑ™£u±5ðØá.r¬^wÁ6¿Ž{˜¯»&qÉ—ÝE¶1‰Qù Xa•˜  r$ƽw¤¬ðîJ€}Ër+Ðìü–È2nú¤Ä‰–ÚV´e8ùpFZú¥ ÐI®9³ ±ÍTöÜ™Š8úN׶h¾KÚ k6A…§c˜‚Q`Ü6ss;œ/¬Lo{ñªì&ÜihÜFÚÝ Nü¶½J€&¯ïµ$|²C"nÂy×ã×x1Oj°Â}ÅÀ¼3Q“0{ül«cºÌºA7Nm_$Ïä·B¤7fëídßwž‰5Vì{k§Û íÑ»ªß;gÏŸžüíß ^`ûÍõƒ|üž8•­{ÇLE¨tÓËgZŽï=g÷¿sŸË|¢LlÎ r~}t|ô}>f=ðG,Aøþhoôg·ÃÕÕ}þêêê‚­Å+®ò»ùÎw¾Ó…¿íüZMZ;óY©ðYi©_Q>Ûë Ó¸½E¸àd@ÎôÞ[ '·øç{ÃÕÙÄ €ñì†sMÿœïüj¹â*0LÆK`f×S!Þ¤szD¬#`(ïµ=žÛÁìMôþݪ¤¿¼GÁ¿[©À~`‚#¶)È„3­¬ —†!ÂMµ &Ÿ«…íUË9ÝU®ñ¼.dÉGÃ5%|ü­Ñû_%„Â{ )tŠVçiÒ1]ã +zº;å ¬Àù˜€(-‰¿F,‡$•S-Ú&…-¼žA1Á¶ÛQº]˜UÚÊå­G@¼Zb¬…¦îV¥³ØH¬ C+¹¤ ˜N~r4žÑbZp„{‡­í¤U>ïe°,¯—«Ê' 8š‰¼5XÖ]`_m"®Äˆ;ø1šoI‡WDÂxW…×ãÈMý{fºa;T¯C¿5«à[¡Ï£› 2Q`¤ç¿)š’£h®Åðüî¼ÛñbI.qìñó^3 ‚á>yEø;Ô¿ðÚ^p¯ÏÏ™fãÁoy«'Ÿ49Âõ ý)g¸6§)·œì·Œb0™ÜNÇ㎠¦°ûçèùÏXýÿåà£å„­ÂœêÇñÏsïïýÎýÑuXyÞ™ÏG ì€ÏG;~ÒRÜ2Ÿ·r/‚Ù;f=À¥ýfÿÖµg* , cÊ`ÈÖÁÁ\µóL"¼Ï“e®Þ6ˆ¦¢ŸHOEa’ÞLU¦Ä è ¦W~Ê5£W\3ìôÀ°ÙŽœÜ£·ê¶$†kQ5€¥Ÿžª'ÆÉjc²pL¡Ãt¨!%Ûô¯X.\V!#÷Åèܘ€|OŤ ú((ˆ#¬h0!5›bůýóL£t­›]ë"}ë4Jè ·Þ³?Û?ë¼lQ…›Û"ïoá•KßæÁ¹6&eüž¤T{ÙümâmÓнm¶Ã„w¿ÂÔÚµ­T7Ó à4"Í*rd¤û»]?ï·—àõXÛþŽ³N*宩™‚‘ÅÀ6±*Žþ(rÝïwE!½~" Ï{ŽKA¡¿Ïô—ã0ÙE…,1¾íŽD¹ãæzuAOÅ þ«\Óëð¾»pÇygˆ>BÞ˜.ì# ‚Þï’Õû¤]Cý÷~ËÉŸKæÿ_’Vþ0QÁàß6î½Ü>ÂÏðÿÞ ¦/ð/‰¿òtÑ$`wæsU;àsÕœoV>z·^´X{\(ôjÆQG‡‡ãçŒ0¾~{0¹>Ÿ/þBþdµ¼~‹Óþþ7æ"™Dhßc À¡ÿ›ÁѳœàÂ$öä\¡|Co}¹|Å0åLŽ9N„û“§B¯’ÙÛûÑžÎƃ¯ãËœ3>ËÖ¤“ƒÃãCð;0Iç§Þw`EOϹWÖ.ä|sd€éAE´€M™©¿%¸ú而ºq[{¬¢˜gàaöþTZ¡¬·KyñåÖ±uáhä¶wˆÕM‰ã¡›Ý¢Æ¡“¼5Á¾ÆËa Î ½ÇCÏ2D\£È$®~•#„’aµº¿ãU˜qƯ¡‘z”°~…Us:Îhæ:@¼ ú“(e§J ;¿[hfqˆ2'ÜÞò’…“ÚÛÑËÝÒÂS‹ 7õ×›ÏT«´•Ï*¿¤°eˆZïBÁx› Í–þÆÏH½BŠàæPñlï.íbÓ˜§™«øI<ûêñÛÛ·SÊ8v¿ ÀÁp<‰ìµ­yªAyCyLï+.éyù⃬êÿèÃ'ƒOŸ³ý–]$¤’lzü‡ÞñI õÌÈ £ ŒÎprß½ã“õÀ…cÅÜÿ«·î=ø/,ò»dDàìp6{Ä gÐ:ç ÿ‹s^L\8™¼øÒ׿ΡÒÕà”xg>o5°S>o-ú†åáÃî\ΘáA?ýéŸî/Ó+´ÿ9‚‘þáÅtopº„!.æ73öäL9„£EedK& Ý_¬¸>\ÂðXiì¹°.\ò</Úç’7&Y¢ØØËÕ„)ƒkÎ €Y²5P¯!ëž’L9ÿ}Xš0Ã}:n±Åò(îRó”9;­ „&y]w÷Â]8lñ¾NL[p·ãh´ï¸{Ü5bGú9¶øÛÏ]èÇ™”ãï‰Ó©mǽK=6–5£lµH¿…®Ý•Ç`«!ÓÚ¨BÀj27a¡bˆ±{ý”¿~+mH¥Óp+[€pøöjÓv±÷ÝØë¶Ü㿆²í5¥ž3íMÞ‘ªRO6õ¢¿=”Wa5 Áé2…F¢ôø~‘ywÄX 5£²é\ÿb¾ˆr}ÅÙýç ÷{”¯Ê°óù¦ãB¾!‡÷ØËw$Ë-|Â<“ƒ¾ `Ç~¯ûàPqn¹ hÅÞ%xç(®òÁ¼ÿ+/ö¦ÓW³ÛÛS]MYHv˜Ø þÞ.ŸG{§|[õ—,73p ƒw ¸ˆOºé×yýuÿ5Cýè³ä¼‹³çòƒÐ§×ïâ@w’dË 4'(ÖN7 ¸‡Ó«íÂTzóø*Œ¤e M›ƒg|³/úŒ¼ŽG?ÆætнWÔÅûTÈ+†çS®ñ}yssu||<ÿàÙ³ÕC«bg>×5°S>×ÍûÉ ÷Õ¯~õúÑ£GÒ`ÀÍpovx¼Z^­{3Ž:>9:ú[äŒ{ß¿~ptó¿Ã>¿®0ߣ—Ò¦.éµrH =ÿ‹‹“Á ±Ó S×v{øn¼æ€’l)äR™ßgëÒ„›çG(4[°kà2 Àw ÌfôjØ90žŒï|ñmp\à3äÒ¡qÆZËvZþ O-d®——“ݲ«@E@ÿ*»0dF.´#&Xyά¡"Ó^ñ¶®8Þi ´DXaÈèooj˜ç“ó—ûŽ„„H§„š®':*…@pWv—ø@DÎQÀ‰Dlƒùó78Ô¤]BL4Iu[AÕÿ2d¾7fJÁ¥hˆâL³¨¸U>”«RvŽ>y0&C••0ÄÎJ£O^PHAU«è- y £µ¥ÌÛë&ô{¹ô> i6ᦑòèk Íä SØŽæßwö¬|ŽèÇMÅDȧ®ÔNu€o:ÂÜqóc ÝÚ wÝћwFÁ?`6.ï$å÷À+Ë~˺˜[ß}…; ú^<ö2žš&{É þÌå;J†àwÎßûÜÛ?Ÿ3…†qyEÞP¤™>ó¿‡Ð÷`'çõOŽkŸ#G‡5Àà'Ví«ì°·ÿ/5øS²ü %âj4yŸƒ}®É3÷ƒ ~Œõòv2Y}åœãŽ–·gg·¿ý­o¹. 7h;óy¬ðylÕ_²L|ørK–3/È*³ï}ð½W,)š1¯<>¹wÿ`¸¸e{ð-gpøÈb)^Ö,9.¸F`V0YoÇsÕr¶×Á\³’A¼Z*Z¨ôn–ˆW„ÿ-Û\XáÏ#(K†29s€^ÕÉ [šŽa°ÌC¸•ðþ=F˜np.×€š7ËÀiî­ ãßÃ?Šl‰@Þè)0)ÐŽ"Ï}žþbJp²ÕPARJD([¡qî]#-s—4¤ÒQ>ÉÇsÙÓA©™ÈDý<‰hàÔÞQq~âQ×´1áäÁ¡¨‹ÖDQ\$¿#â[Mâjo=bï  ²Œ¸É_Õ±ðJm;L¨„+å¢'$JN#![Û756nÖÖ­Óß6v$§ŽÑød0‚ݼê¦Ì­”lÕ·hôZ±<®…¨"-"1<žtT›fôÒâÝäQñÉáø5žpÍ}ùn8IóúŒµ2Lw]pFÿË'Ob›Ï‡ú8]¦ëZ.ÛIþ=ðÇü˜¨£ ŽÓth† wÀ‹{T.ôÓ³0ä‰vˆ# €î^Š[H==¬cYCºÅ-X¹âm?`¤Â6q;îÝúo4;ZO^Û÷&oLý¹"¸2®òFX›;£ºp³½zy ÐM¯à×íÈ‚n(Ћ>ÀfsAªê¤gøöY‡.ês/¿öüŠ“ûxUê½v‘lM=9ýÕ•ßW…|Òqß¿BÞ9~·õÆ<ÿ ;e¼°‡“;Éù·< íñ¸N”£ˆnéÅ3·¿7xèeü’°[¯ Çë'OX¤³3ÿ`k`§üƒmú_°àp‘~ûÏ眰dkÑÕöÌ/¯¯ä‘èA}~wçœÌf¿3ÎØ x€yëþý{_€)ÎÎÏO¿qyuõU˜Ûá’íM——'mÖ °¨éÕ«±꼸z^£N ,/Yõ|³ Ž^q5é¡— ±§™ËK«ó,tò^ÏІ7Ò*ÛmWã\Läâ(z†àL¼…uŽ_s "Y¯žÖ’ö¸d¼Q2JO„á6^C]¥B‰}£KzY-Àôeq~7µ ÂÅü4…K‰¹.ž+WQ¾îä´rlÞ3€C b7 HO±Rô^{{™ "tã2¬›j‰î+;Ø"5D«ºÍ”€n[¼:S¯êV+L|Ïâßg©FX U÷À§ Ð÷ý¨úà]b{©ùÑŸ9|Þ#µÙQ†ùqK‰÷dAoEd ‚·ÂÿâÌ w§Ï»½`?[ú¸NÓc²3çìéOši/•·Äj[ÔÜ‘a¾É”»bfYÕOOß-}<(ÑüLJÇÁAy~y|tøCž}99œ>!¿×Yá¿?z:™M¡X_-—·{y¹|ºÐX½ýöÞ‹{YZp¶úýßÿ#OÒÚ™ 5°Sþ6ü›†è=°ÕÁà»ßýî J€[ˆö˜c¼¦÷Âi‚x×þôøøà Ær„°8\.¯.™Û'ÖÍ!Kü¾LO‹ †59øç–#{Ud®ÿ{gÒlÉQåù;oÈ— B2 !º°2£Œ6£¨X/Ħ7½†5ß}a|‚^°À ³¶fQU]‚¢(4)¥rz/ßtß"nÿ~Ç#n¾–™T Iy"3®{xø'âùÿœãÇ/Øü¼wqŒ"d„`Ž”ùRùOçÑqK6³Ù h¾ÞåÊeQ?RÈk®¸uÄ:fiðMø/ŠéÛrI¡jqš¢z6¹áÑ"ŠÌpÁE½!Â7y{À3Ÿ ·ÝäÆûA¡mÆÇ"UñØÏàE¼jz\^yé`›v©»í3ý¹0îAôB- _"’7·Òû¥ŠÍ÷.¥µx«y!‚µ‡·‚‰«¦0ïWÈöð·¡àŽ‡»íµ`ë}ûÌw”ï]S¯´-¯Á|9jwõN+ ½KÝóˆûçá—ö,5`¿Är…Œ’{lÓ«7?î…êŸtãzÕ\°ŠF€ýêÁຉsСbÁ¯¤/øã¬+´eXñà «Ú×f°žîîžN'Ó#ʯv&£;øÕÐÏùöoóß"|îÑ¿åýû÷ý×Í/‚{ÎGåñ‚R €ôÅ?íc3PÄ€ñÓŸþ´þÉO~²º}ûv—K?.êá,dĸö`¾ôw»]l Ñþ3î z£{5ÿ°^bÕÀVÑ¡‡ŸNvQ¯ö}²Ãt{n%r·6U ×_¶ˆ¨P»‹s u^†€×–PI®^+!1€b èTƒ¶×–Qêë“æÀ‰x×0žÓÌaBÊjÖpͱÑÇÖ?¾jZ9ÓÚ8ÑÇŽ€ˆ&%ÈÕÄm§gMoÚº-s9oS$zo>ó´'yío[VôÚÞkâ”4TÖh?&/¥·GÛ`K½í]Ë>Þ’×öÐ;!S‚Åkê<í§i%^2ÃÏEïÉé†=›ôèu· -¶múym…1hÞ;ùÚÁï0Ĩ‡¼:qÓ)é•×£&´Nßø€oÐtÝøàsåwÙEe/à³fžO†oA‰Ÿs1›ö… XÀhí¯` ø׸òÕ¸Ïi€Uµ(Z ûh`û†S¬FÍŸºd`°—žHü˜lð×0ªæg `x†>q²*Àû÷ûCTþ.ëø÷{üÝ‘oÉy†Fn~tt´~å•Wœ&h?l,÷”Ý IDAT™íßÈ‹Lƒ|ö§ Ào¼¡ûàŠI ¤{rr‚ƳrÂ5^½ W+¶Ö‡Œ}÷9§äÅ& 7gð¼ÆôÀëë¿Íˆ:cñ?î„Ô$0ïÆÊçF/<Ï° ¬C=€ÿŒÜeÐÖpO”À`ÐP B&?éî[_‘ÐÃà°³·Ç¾ç¤Ë4Œ¦å.K ½êt¹áñûù‰»Ù‘†€…Øthˆ¸zݽúO€;q¢VÃOŒ·]™A¥­× —Çâ(¹ÊðÓTSâ>*B±ŸE^üx“èÒ„0™ÿ¼26øÚ^C%âž¡´Á‡ñæÚ®„Š¤¤X£+É•…]RP›—tŸèÑ: j&Ÿy­FóéãIIÐ@ßt›2Í0ˆÃßÒVæ¨+HV®}ª¸O¨™I[ ¹›¿‡ÒÇ0ð3.óÇ‹Ä8ØFyÞ~ZGŸÕгG'¥OYž ß5š«ºÙûBð_#ÁG°?¼ûaHõåû=Ǹï4™8Xj2”i(.{u“ÑßÓ”ƒVˆ´»3Ìì²>›oU?ËTþïr}MÄB?¸ò…•¥ìppˆ+ßwãÁ!ô˜c…ø¶3xï¬æØžb<û¿M Võ¬ðû_½ÿ>Kmòæñ‚S €üxÚÇGzp ã`ps,j½ êQP)zqñé€ÁäêÕ—f,xÀú%æýÿ¦?8þoŒ‰Á}oWA Š ûWf!I)19xžž„Ô)ŒÀ¹k¢8+| ß×à *§ž @'Sm=¡á3àà î\½FП_tW'0,ÙB#°»Ï€Kˆ7T®õJºðýñ@ÑåÚÂœÛB˜mú˜í8Ú†UcÐ/÷6±Ô°}¬ú„‡þC K?ŒyXÚÃû%OSŸuGzu{„L붂¡Õ( @ašæzË(´å¢²ÂÒ(é€ûj€©Ùf-Ò¥Ä Y ÊEaiÆqE‹dK^q[&iM}á\£2ò¡¢²à1¬ÔK9…æp­½gû:JÈÓQÎöÍÉ·¸=­®°h…(óö@>yTß{­&È#$zBçð{tÀйK ýr…v!]ÀÚÝô]—òñ àk–®J^?ü†žnÝbÚŠ-ya Îf'ÓÓc²ñMB_x>¿Ï],ô•äqÈÓﱊ…Pàß¿²ÊÄŸÉ^gozÅ|S2Ýöï0ܧôM-@üýñG†#Ÿî‡Ãñä”vΙÚø—+ׯ¡î_ɘ¿õÖ[’¼C¸q;pãy$.S €ËÔÈøSS aÚr!Ð1FÕh ú \½jÌÎì#>îON˜¡œßéõøÀ)™ë‚pYK55«0éëU\ !Q ‡8@ÁÉË}×QÓL€2vß9n;﯄å5JBÁ™ˆ–KÁšÅ†8(Zà\È{Ì„V@@ÇBÕ[‚ ¤±Ï>1`#ëŠ<°ëÍâ ó³^+:Àz/%V~ËU7‡qsfÀ`¨ÛßËù·‰D x]Ny”æ½Çë›m.ó|ÜùxzUÊøëW ”» ¡y=½¯NÅéÔÒʧôT~¿üÄ¥×–}Ôÿ¶.k3Öú—îÛ†u([Êÿ¬L¡ €Ào;Öéáo{6¯; YÓe(QEõ>ßV ¸×0¥a,  Ôï7·&}IÜPÀÍxœïFUµ¿SÔeŸù a4èUŠþɬⴇ52…q…PúÇiÌ(¾4ý ÍÅà—ãÄš¿{NY,þõxE•\÷†Ã3 œtõ.°Ÿ™ß¼ysñ½ï}oË “/¤À'R €O$MÞø (°qËÐØ«õÿêè¨~wµªÏØYl è:›hcÇT@=èÕÇz€ÿŒñþ)ë ÖCÕ·CvB}‰Û ³m©VKƒã“]Ò`õC ÷´F½ÞxøSÔ ë”ýÑôÅâ¸sxp(õ3÷Ôö¶Ó©’X‘̮ޘÒ_ ‹»Õñ©‘ŽfAf€Šù¿á¾‡ ÈÆì78UC¼…9 &ÂD†>=™¨Š#R"Ö¦ÄÅc?paŠJËo5í5ðX€ÔvýÏÐâ!23êPÒÖ/ÊG~[áô•–½â(}²ŸZé+å«Ò_`Ð2?+©Ú(wÝs)_~·Èà«å»sÎßÐït>ø,ÒÀ)²ýÞAwÀ‡Ñªš$ü]üôë¹Ï%°Ó= ZÕHõðßï~ò@ßÅx4ùpg¼{ š\` ð{ê{‡Óm¼ÞÞ!\ÑærÔ¹æ Ûï®.Î.füݵ_¡—GRàÏR €?Kž¼ù,`@fœÜ¬_~ùåŒÎÎÞ}ÿðpuo0¨ÑÆŽ÷®Ÿ3FNëzͪ¾[—ËÕuÖAÿ-LÓÆK×;#i;¨L—8Iq½´Ò•~Íõ0(C0›ãmÐÛÔÉPÎ*ÒÖgJ€åé©Š“ a´ üN ì_q¯t§`ݹÎ4×´»»‹ÕQÙ鬀3`'‡!X B ¡0¢ªÛˆñkE1®ɽ\rÇâ†%W£¶TI·†G‡9·)6-°GÜh‹“à¿ÜŸ ñŸÑÒ¦Ù•„-­L‰ m!pÔgà^AØ N„kâ¬:C?¬žP ÙT/ÑW_ºD½A%Û.‡IؤL€<‹a€xÓt1 Dj/ À–ñ×ö -Óž>7{ìØ +Ã6€“Ê£ õnCãÁ˜•¾˜îaWo û´ÔgéjçäáqívÎŒ;wÏw¦ˆ÷­ÚÉŽs„ŠªÐQPŸLbž``Gõ îHõÌícÅß2|Û-°Ëò¾†XŽ†£§£½CpNÚM´ÒÂáYo¿÷ïG§G‹éî´~pûA­<ËZ¦;·ì‘?OJdž”R™ï©( @fdÄ%nùöþïÿ€ú·n±¾[Ž‘î® o£Xa½ïþãû2(‡…¦gD™5páš•,lžNJ\«•&\†.ås-¿{¦Û(Rœÿ,Ë€½Öû`­ÚVMwCƒÚ¹ªÀ°¼.†ç2Jô´C€62q«aâ9l§A Э€•ü Œ8‡iæƒi°½ i—A®0 ª€é3zÈ/µ$‹„¸Ö O.÷JÝÖÿøaMþ9›×¥wHêö©\{Oðä×ånE'!\›^Âè<9/ÖËY{iÍjZæ_4¤ðœþò¼ªäM±Uö)Û®{â‘ÇûÌmÞðÜ4o´Á#NˆÒ âþ‹&´>™ûæ2=/ÕÄhcRºG«¨÷£QÒ\vê7"°;w/಼%îwõůÕþá €q¿G}ó[4)ÍÒ_ÈÌŒ@ cYŒû0Ú f €‰Þ½·µæ¯Ç£ñWÇÈxVjQ`4OG½›ô ï‘~Žä“ðƹf[ÍÎÿÿÎßû7•GRà/¢€#CIO‹›ÙlUl.XÖÇ^ãS¦PO7¨kYßäÚýì£ìêeÆä¼­fçÔ…I _ 7?’ôzéâ/š ÜŒMQk|¬ÕðÊ+h ÂôYI #`OÔK÷è‰ 6܆‚—þÙ£.®ç#=&,Õ ê¨P ‰¡Î/à®÷ÂrhË>J[MŽh—Fq‹\ÔþºÇÁÐ —Âo¯Ë3F쟧y9 ƒš ÷0ˆ¡G¹çýG/¼m…f:Q˜è=ú%iXÌi¥R3îú²iºXh.ýG–KZÔËF"‘õ<0ø»Ûf”ó°·$téËÃð عT¥¿aJÔÿM£Ê €oè÷³bŸóöÎéÏØ}oŽv©xð“1PËT¤ý²ÇMùÎi¾e\°È¸Óî[¡ËïCM€KúŒ3Ï š1ñôþþªßéSgؼ¹Þ`î}Ôþ'07éùm¾UœöT2'<KlùšÍ¶¤,„ÈߤÀ³Q ùKz¶ÂY*)ð´`s•€ÊZUŸÝFø,ÁŠi¶ï]; ÷;ýþfguÑùûK ŽW«ÅWq„WÁzc«ƒÓÓó`¼œ:%°ÀêÚÐÁ~†¤¦f@û¥8¬èap¾Ð« ó³Å(ËØð„y UﻟºƒtÀõÁX`ôœÇô<É#˜y%útÁU»a–¸ Fj<)¤ »îÇ@%ô[ 2NƒB~—‰Æë}€ñ¥ÍWÌÕ¸ÅaJñÆÐÊDw¢\¯RnyBú&nÿÕºX¦ôI¦Â«B„&^j45Ž-€óbÚÂwaŸ!J±[(õÛO«wš§í@Àn: ¶rpn,5Ejw Ý2‡`âdJç;å;ÑeÌõó@ÛP€½- #©Vƒ¾ÆØoE}N9ùüÜf×oÆ÷ŒëeF÷ö±â'-Ò|ø @a”ô/Xî÷@¿"ïSOï¢ 8âápÑ;þ ;èëLëlо3î÷O]Kú^± €Ï·Ú¼úê«®ã/*ˆBÂüM <3Rð̤˂ÏB/Gruð¿þõ¯—7®|õ.^ÙS¥;3²÷û;,Í®'Œ;«Õf‡•" €…ž c0àdw$«`;ø₼à `3ˆoÔá«h$UÆ|€£€©;[E]Æ«À‡ÓSêˆÖµsŸÓ\nè||]ц·˜’`2:‘ªÉ¸©]–g^¥~åhâ2Y0\?ZY¯b0hFÉDß=Úµ› À4wBnrÃZ=6ã7˜%ý†(×­t/ Í[Ž°' tKª-Ûn{´ínïú,v—“'m{±ýælKµ.N“-ׄ\E®Ê’\êy”®=.ç÷½Ëh@øÕK …1(ÌAÏ9z¼vw=@¿šÏðʧ­%ùN–ÁJCçóKh½ŽÊHÊÄ„ŸßŒq¾±Â„Ùy{Éwÿø‘öã ÆQ#?¬ú9Qß7ý0 h`vý¶XúÒ¯Q寈/1†OF£€ÿ!¹ìF8ïé]tǽ3>³ßøÆ7ôð§.*¤Às¡@2Ï…¬YéÓR¦úÎ; ÃÍŒ•GHu=_6_´z8mö¯2À^c Ö« †º!F Bo°ÙÀh€@æ AOO„0̯2§¯f@7Ã}\;ø8¸àþ@)â– j0ädJ,e< Æ]ZÄkL¨¡×xŒ ÁÜAŸNêÊX&€ê}ð!âå÷IgHt¬7b^3—2‘™Tš_éÁ2m& Ô!Hq¢YÐÙ¢uÉFŠZ%u–ÝñJ£¡‚f)õ›ýOò˜MØÿ6ÁiÝm)ˆh‹”2ÍRjD£ä÷YóhA5BûÖÜßVh„4K—vù¥.>#•w´á}*Å{Vsï¨p êGw¹½¸@ €w½\ÀhÅûN4ÏųPW\К̓%½fÝHtNÐç›’å=:ϯ—>ÖñǻǠ44Ú^tu”u>Ï  ö ±o¢îï¯)?ãÃ|µ×CÅC*|—^°F¥³Æàå[ô-I§·œ ÐtIçHdž#q³ê§¢@ýÛßþöoe=–ïõ^{íµ ädüÄlpð*ªè)ƒòî©yŒÉƒag ¨àxèâÛ„û€÷„)€]î±Ôi‹SLÀ¦-Îõ Hx ÔÁ†Kˆ6‚Ô÷­$c ¨_¸Ã1[gˆD)Àª ±E±¡RàÉ©Ž\T —9`ö`p/vÏÔıÀ:ÏÁxŠÒ†@È©F!–±µ²’gÑP`!Èp’ƽ 9»/à4Ư[Ðz8•®ú>ò n‘N[0? f€\dn¢qµý‘"P"ÀÝ,Æ ãîÅbü£.™ifJ mZ“&=‹1Í“nÜ0Òh™iŸmhkØ{8—ò”iòÅ5ï)Bžeyvsõ2zsÔ÷ò)ñ³uE™à•îã}Soôè9´‘1ƒa“®¼— 9À.Í´1‘P³dúÞÞ.qÓ5e“žx?0¤{Ÿò vê»…tÿ{ÞÓ¢7ìôGýSî1'Õ¹˜ &ïÒç%ßÊ1Ïò>yŽ¹Æ¦?ßÅˇj~üüèòH <7 $ðÜH›? ð„?±lf\ì¾ýöÛ.RMÊ´hße‚J‘€ƒ¥„õ ®§>>ú_c@X†klb3" õ:ŒÈ”)ëµò|$i·³ÖÉ ³ HÐQÒ0VŽÌà„~¹³¨f”«ìÝšX­€ÀÎ7`£ô¿eXY >†!i¶%0f§Bã2ý„);÷£7ï¡×Àž À$TÉ‚ c;VRæȉ’¶ÅlHHwãF*á=x"Ú€íZ žÏë0,4­-ù·µEÙHŠjJ]^K†æŠ²%›¿öû£‡·í‹R~€;q¤ÜHˆk/ ôgsßCä¬Ý0ʲjmTÃs+w)h©³Hþeàô!€ïJbÉÏtR”‹ w¬Ûv©¢j@ÆKW†ñn|YÒŠtUoè²Ðˆó¢eðvqÑëœhð=`h¾bP4Ãáèdg2ù€ô ý܇xhæàbÜ¿G{Kúyƾ^zé%-ûóH |êHàS'y6ø´` ÄëZ—¨8Z[.z­¨]JU!õ³skxRîæ'nP´Ë½q<ã"ÔcgtwŸµ..ÔGSàˆ±X0DjAEŠ4’ M—aX‘×Õd,PAk¼œäQNÇ;5ÓÊá¶UäÇ,yƒ§àEÄ®CCªê 7Û·"þÛbH Zg·:Žòl|´fIŽÂ$Ðœé íC)×M4j2×´#RËcÙgçíãÏÖg¥Dgãv´Ü©¯ÈQîË8Ä£ Æœ¤†&am¼­"fîíµŒT%ô‡G Àç‚W÷ƒñÒyüä]fü}ѦL—õØ^adÎÖZäs#Î`̈CàÐ ò2‚=‰Á È"ñس8`¹¢Ÿ¾¶ÂLÉt¹n_&«ÌÛU?®„QùóÍIŸü2î-à·Fùøù˜˜Aé®8•äO »ßb€>užÐ…3óâÊz1Ü.x&þÜT+HÖö-äÀ§Id>Mjg[OMTŽsVè]¤:] ßGsÞm·µ˜°iÊÿc`Õ±ƒÝ«„_>†„˜P¯õ/0%~ øGðƒ-‹W¡GB€Åù¹Û·Q2-«° ŸZ€roÃúðFbš@vbÓ™-ËZð¦Üâ@@j$ñôÉã}¥C‚’æ¡(iŽ]GH FÌBcpXTÐV+È4þ4Ô׋a4Ø„ÖË?¡¾Ä"à'Äg’(ë=þ÷º§€׸6¶Ó¬±$÷ÝVRÖxNÐ ¦&5þsJÂršÎcÄChù ÌðRÇœJíÖ«A^çqO·ºÎÛ/ÊðSc„²¥^¯Édc´)ÐÇ $÷Ɔ¢¹g`ÿösû ᜷çû€ö¨ðµÙ Œt\D*Ù˘?,÷ÉÇ\>Þ#uä£A)žü¦L¨‰étîóþ uÝáT¥ï•ÄÏ9?$ï-æÿ—«åêüúÞõs4Rv°f jqÀf_ùÊWª_þò—î`”GRà¯Bdþ*dÏFŸ† ¦Jõ"˜G—}¶ƒ&Ë£b$f uz‡BnEÜ2Ø^'>ãáÁx…QU…]@ è/i×kÒ†‚›R+ Bœ‚€7M-Š™&”j¬Æ+¤?1ˆ«Šv-€‰5ÐÈ®¶gƒOÑuhDÀç[r7 òŠ’1àê ÍÝ¥ªe´0}´®‹W ŸºÈ `dyë¢ÎýÈoiÏ6„뢽¶ûØ3°}|Oψbc[`Ã^ ç¹èbA \» °<‡ÐsÑ^(Ø)k³° „dÁ~‚gÁŽ"ꄾ‹9@O%Õô†JöK–t–÷Ðj ¸S õP¡õZ¿/ÊNrZ®Äaˆ ¹Ï§@Îô0Þ€¼ßñ æÆ cP4mz³tFÌ$Ýš·0Óf¹(M-qKqH;B×Åp2|&àœm-ôÛÿ ¿‹ÂJã¿Ù­[·æ.åãy7o¿ý¶ŒãÇ?þq|‹íu†IO“É|šÔζž™ ¨Žô†Û4RøaaýÊ+¯œ"µ¯„窃a óEÙ€n°\öÙ7¸$¾HÍ81Æf¢žáŸxw4Zï(.=,’ (k\L ‚pÙX½’a üÈ0 zªôPtP•4»KÕÁ\´Ýü"ÝGr}óh­#ÁX1àc’Ïe‚Ú.¸r ÏÊW!`Ñà¦F€•‡Äåð<ù¡- 6q@C Ê‰ Ã!Ëæ¢åÙ| :ÓrynÁÕCÊ8ùŒÊááP)ª“ã<éQää9ã%™OzXž„–©’NždÆ}h·„’Q¹Ñ@žý2è7ÇÛ§wñ8þÄô =ðÑÜ?BÆ(˜â®Êðy†€|ì¸Çs*¹O'Ó|w¢e1¼Ì@-÷—”[Pß˧U=¼ôõ݉O†A#=ÊtoSß]¾·{Ðf_þhlf0r:÷9FÂ?sꊼóŸÿüç‹Ü‘Ï7–Çg‰þ¹ä‘øÜSàÍ7ßìÿà?¸ŠäPÆ«ÅbÊ`½à Ä®³Š€Õ×›ýù¼úï@ÌÉt\­æ† ÎdY­ÿŽ| s ô „ 7üà ˆ`S5`N  €+7&ÚÎU;eP ×À†÷¿~€M_òæ§~† líB Á˜6¥WA^RÝߪ°Ý­Ð “ ="O”e<9¨²´g\&4ÁЭg -ÑÕ @•ˆÙ¼ €³ë Ï]ë)+"ÌUµm§…eAßúåsŒjôçY@]†@ºPDtëç¢â‡ h ¢Ÿ`ã p$V0HN%ñr¯<¥‰¦ øȯ³žb±/Í”ò‹_‘à'6ã!£ôr£C­ÿeL°±ì¿=ìnAmNŽûý¡†z2—Ú¢,Éãœÿ!žÿ ý)µšŽ¦`/0'Ng7oÞœ±ªE²¬X溶Lô;’Ÿ ðç’GRà‹A™€öI~ô£uÙ½·»»ÛC¼‚±à>0Û ÷&ÓéôoxfÕ«ýùòìk”Ùgîù)÷!u¾6]ž¶Üîþ†W¸XA haù?DʵKÍŠU;VìËâyNÉÕe<½^ÝHF† $`| €XƒIå9FxÎl =Œ+Ú[Â(ØPÁ‚~þÁÆô„€RnG.Q;‡ßæ‰à «t¸ü‡aá‡Òl=òÒ:Á/ò‰ZðÔÎËké3ó?l ([¦ñòWŠ6í ô–¹ý(]ê¤xä+~ ° ÖöC0+{®íûÞè(rí=ðLG'Ÿé…ë‘‘tŸ+–îç;ᆷUõË<Œ· €–üeu…õ©1². ýx8èÿ+íü_zéf<·°ñ¸#rÁ¶»eÎx.I´€I<ãûZPVo}ÇwïÞ]³ŒusïÞ½ ß yâ ~I–GRà3EXþ<’_ |Ü|*u÷í·ß^ ™ ´ ]=p >D;˶ƒc6 ªt</qÜÒWK€ÑŸ%ö ûæ”`o ±ë7îéæ¨è®‡Ì©¹ÖÈ€Z‚8 NðÌO£îdzQÜߠίgŠ†KÒeñ5Ч]ë@=T˃Ž%Þ¤QfA 8¼ðkÒ=õFÎ6?9Š`È*tE­´«¦C‹vAŸ¸í’ÙüJü2%Q–ŸÂ?Șp3Š”°ô1ª²¶&?Ñà$¶XXž±ÉVÚŒjâym?´1¥s!H+ÑÀåy€¾ù~4 r=r­>ýQ£+] )Ým@hë„'´Ìûðné¼åxöm——Çâ_¯{ÞôΘ:E«pÆ5¾ù»ÇÔ{3°®æÕLÀ'Žmè:|ùÖ_ûÚ×Vœªüƒ¼-%2L |V) ÀgõÍd¿þK( ¼óÎ;‹7nlÎÏÏñ¾:è#¡-ôc6ÓÕÐmZ­ë]Ô¼`Ûæ*˜ÀÎ-]=²\°+úÔü8Úèm°;?ô²Ç:õ ›é•çúal“zœ#ý3êGÀ­ŒYïjð²ôMÆ 0ešA´Ô¢½¤WãÚ5q€vdŒ‚à|#é Ä2%& ?ªÍ¹ö°èMÜ%y¼(ÐéþhiPr±™OͲ9.Êu +ùÛ` ‰Ú¾Á£ {IDATÛ#…™0åQi¢öÍ€²¶¡g,­kÒu„†{\˸K¯LpîŒ]­@èÔ@_ 1EÀ½I#ñË8ð¢£ÅêÞ0w@}t7ÝËï(ï|>öœ}Ýò Ú¼è>üæïëÁï=ø¿ÿDpÛpÞ"ý³ˆ¯ªQë/ çí’ËP×­Ÿ~ÚÒ6 %—y$>Ûˆ?×Ïv³wI¿ŒŒÕ~熬 è}÷»ßí½÷Þ{]– ~÷»ßM ™ÀX°û*`àzl«WíZ”Õž@ÃxÜàs€í{êÞ¸[¯«ƒåºz…9ìòWËùב•)ž°÷¤<ŒÀeÀ©Œƒpn\&¡zÌÐ ø0 ðH/@î²DY¦@í¡‡^¨§¹6oÜ€™ ^Ôñæ—(År¾¹]Šó«mâ#$° 3a††¯¹SdB%ï¨Õtÿ™qÊ7 ×.}´F² Þ†¦ ô¥÷Èn…s%çéÉh~—HÊ0„ßj¸ÇÜi% Žäš%ýúWl%~ÇÍž]&gÄapïèSDQÿð¶ß›9 ÂíÝ%¿ëõž¢=‚ðÎÉÉIP\Uÿ믿.™‚TÖíý<’Ÿ ¤àóò¦²ŸÏLf袹~ νßüæ7®ÍvOŒ€ËǤc+Pï3EpNÜEòÁk7°tÑš»›aÓpÌñWNPŒrÁ X ˜ 9Ø3\!Ó8R=QËÌþ¼`†L€‚†BHkeH ÉŸ¡ Ð/Ôð.,SVí|~4A+Öak¡Ž¾Ç¸7l¯Ü©Yþg\ù\o€†ÞŠùø(KöK €~ñƒDoêÌØÈ ¸DL À‡‘lyE}ó8¿e‚NÜâFw¥œ9[€ô†–Ü+Z‚XÆGœÿHÜJðìE=0º´ÅÖû¬dž)ÿ!+9Ühç˜:*˜“;>ø }®Ù_9·O1\2U£—¾Sæ÷O)ƒ‰G5ûö·¿íúþö¢Ú<’Ÿ $ðù‡ùÏH7Þx££¡[–V‡‡‡Ú $³Å ŒÇ}T÷+Vl˜?î̘=àï1¯®F zF¨À@æ`°¤èT°@€…@]À}—"Ê€õˆ"_¦Ëý°ŠÇ{ ¡¬ëÛj°/fÂòžÍ;d¢L‚Åb©]#wãÐÐB€/Š«ö¢Ü0O´×0´ÓÞlûaθ-f ÕJïœÆýÿ(4݉;®#›ÒºË7g”W=ÿˆPR><’—œ‘z’î•Sæ)’½ý7žeM]‚ÇÜ<£A}r[úij ÖçÓ?¢ÊÿeÇ)ÚŒ:3åÉf ØÏëžÖ™¨þ{ýc¦aÖ¨ùáíúMýîz«Ÿýìg>aI/âïö õDù0I§ ƒüöo€éK¼ð0êÞ¿¿‡F wttÔez ÷å/¹‹ê7òž!žrà„pº··ÀÉPß= ÀŒÞðG w¡KuJ4À€ý ª«´Ån†/ÃBüOŠ_ƒ@¡b (â–ÕÀ5 ­Ôï–´ÆC@ÿl½òqÃÿ,),Æyö§r0Ýú´½óðÚz"ÑxIN3D]Ö¶¶Âápìž0Mz‰˜±šîrÄ{.uè`Ëy@ªš'îýpÅKhµÆ[fÁ’* ¼ lddŠ¦€Ž¿ÍýÿmHv¸™ÑôçQ7¸6œñÖTsoy~~Hšþ!*-÷5åÝv¾óïT2€žßüæ7!aµùú׿¾A3´Aêo%~—ü5l-å‘ø‚P 5_™ñl``/xXŠÇï“ÖôÿQc þ¬ÊV+ìκçã1¾cˆÝÀ`ƒšíØí‡l8$B0EÈÔ„ÈBìT«¬(~õ×±é•Î‡PÎ ØüÈ,DÈ5Ö†‘_Æû¼-ƒP·0— ïÒ›§Œ ê³ ê¤Ò>õ¸Õq0 ܳü÷§Hß½iíé•“Eš7g´ßÜWúW‚ü–k´ZòC’Ë}çý‹¤zÍ€ùãe¤€’†Q àï=]ûò_õÿ Œ×©TuF ²Ÿüu}Žeß)s;Hô‹£þtz̽%|ë×^{í”ò è$›ɼØï?Ÿþ/ Àrù›Ídr…ùâEçÚµÝîÇÙ«“òªr @Ç/zÄ­'ÝŠÅÿÕ Fl³õ¦û€Î=àV¸òø‚aGXð׊² ‘˜4®u§ „òGHvö Ì%àÓX6ÃSеúˆGTªN©Š^-âºÓ  F½‰ÖO“òEd P¿ãò×¹j\RJµ; °—Ðì8ÿÝ'.ƒ9°"ýËõ΢ÝW]6ª!œ!F7ÅñÀrê0O³U"Ó'vº¦KšNü‘½Þ£Ow}R4(K%{˜16éÌñätA#kì;f0dKŒùÖXíîÉóH ¼àð/8¤@Rà( ¸¾õ–¾t6Ý!ë^}µÓà ‚p¯‹Õ8¸Ï¬2'Ö⬠¨wÙƒBÄÔª¾Á”ua¾ÃùÜEXíOÁÇ>‹ØÀ¨» #¡ó¢wÊSTì2¯Ò¸« ØÞçFÜr d„îÍ­íA—}gd¢l⇼Ø.ô®†£ÿA|/$ÿÚÁŠ„` ±€ßö  ¸.BæMçp±©þ ?ÿç‘­ðÖá„ ‚@ÞÛÐ ¶[ŒæMSâ>çdŠôàA]¨=0ÎSëâÖŒTÓ„Ù-ãƒÁÒ…FÐpÍ ¿ü‡Ëì*¸ج+3«S¦lnj¬§í ïºüš´z9™TÌÏ`»‰‹Ç7V'o½~øµÜÿá ˆ}Í#)ð"S 5/òÛÏgÿ‹( nÛ‰>®2™l f€Òd0˜"îô;ØæìFëï︓!ZñÁp6[]¯ÑÆc ¾-G„ºqnÔô uð_íSÞí‘õqÀdxU4M!@ßÜØƺ÷¡»b: ÀŸ¢0ÿâ—@m>XZÃeÌåߧ=UêôEë„`d<l$ð#@üÀíre0žÔ·¾Æ–= ,‹õ#éì¨7­qzX ªzãS¿7rNß“íÕb½>×»ì¬Ö÷îɬ˜Ïß|ÿûßwÇÈy˜èJþ$’¡@2!H^&þ+) u~õ«_mpDTãˆè«F‚ÕˆOÓŠÝ5ñs.ÙÁ°±?¦$>€ª`¬ Aœ² < ÚqZé¿lr$£%pjmAwÄ´ûMdõcç ˜>@™.ÒÃËl°‰Gз)À¿ ¹‰éýîÆ÷©ú˜ 'ä'†ŠlÄÝÔ£!µ¨0|@?£Ž²ÜŽkÒ´°èY1rÙ$´²r·<À=‡ÝiHêõ¢®@vÌ%àìGGî°S¯ÏðÂ{åÊfyÿþæ«_ýêÆUy$’ONYü<’IçHÀ®‡@½ý'(\eЇèþ]ŒÕØÀnêüO*Ć3=òaw0wÅB‡é¥ÿ.ªðø»¦N¸K¾€¬q¢õ»Y6±Lq‚!ÀâTð5NP­—­—™[Xo˜K·m:Ò_ã@—ºX‚°^ £¸Ša…s„êËåf8˜oîmlÐhDš¸ÞòÂG>ýÜ°KÞúøø¸CÚæðð›ƒDpܸñ·5Ï`”~ÚŨM«"¯GÊÖwßÅYójÓ].7b©÷(ÒP/’OFÔ<2WRà™) 0Á)ùÏ×rynZð üsEÜðÈûj0r‹ü,iëâ×`óþûïw¿üòËÚ ®]»Ì@~GÆßÇÓîtpƒEuú.¨wjá|1¿ž`F0Ø-žïXv8œã?OïGl…·ÆÀáœ}nkõ`ÿüÞÇ—û­O… @}°o>»*zã¿øÅ/:ßúÖ·"þ:^ôþùŸO»¯¿þq}y­=þ̾=>rO;8 í“Ðu[OF’IGHà-2–xnxB z.`è^}õÕÁíÛ·7‘Îã9÷®\Y°Œ®u§ì°S÷ŽgH÷Õèì¢^ ±×Ýa,‹\mVÃÑéÉ@õÞöªéµkËÅÇúÂ_ÃdÌÓ¨î¹}6YqRà¹R e¤Ÿk#YyR )ð×£ø'MA ™;ßaÙÜé‚š¹ôÕþî.¦~õæËå>˜ÏC¥þòdÒ;šNc ÓûÍ»''!ñcQ_#ÅcT˜ª÷¿ÞÛÍ–“ÏNdžvY2)ð¹§À›o¾¹µM¸¼ý“>Øj6ž´ºÌ—H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R )H $’I¤@R ) ü5ÜÕVõ¬®pIEND®B`‚synergy-1.4.12-Source/src/gui/res/mac/Synergy.plist0000600000175000017500000000070011651662725022140 0ustar synergysynergy CFBundleIconFile Synergy.icns CFBundlePackageType APPL CFBundleGetInfoString 0.9.0 CFBundleSignature ???? CFBundleExecutable Synergy synergy-1.4.12-Source/src/gui/res/MainWindowBase.ui0000600000175000017500000003110112005072540022050 0ustar synergysynergy MainWindowBase 0 0 600 500 0 0 500 400 Synergy 0 0 &Client (use another computer's keyboard and mouse): true true QFormLayout::AllNonFixedFieldsGrow Screen name: Unknown &Server IP: m_pLineEditHostname Ready Log 0 0 Courier false false QTextEdit::NoWrap true Qt::Horizontal 40 20 :/res/icons/16x16/warning.png true &Start &Apply &Elevate 0 0 &Server (share this computer's mouse and keyboard): true true QFormLayout::AllNonFixedFieldsGrow IP addresses: Unknown Configure interactively: true &Configure Server... Qt::Horizontal 40 20 Use existing configuration: &Configuration file: m_pLineEditConfigFile false false &Browse... &About Synergy... &Quit Quit Ctrl+Q &Start Run Ctrl+S false S&top Stop Ctrl+T S&how Status Ctrl+H &Hide Hide &Show Show Save configuration &as... Save the interactively generated server configuration to a file. Ctrl+Alt+S Settings Edit settings Run Wizard m_pButtonToggleStart clicked() m_pActionStartSynergy trigger() 361 404 -1 -1 m_pRadioExternalConfig toggled(bool) m_pLineEditConfigFile setEnabled(bool) 156 179 169 209 m_pRadioExternalConfig toggled(bool) m_pButtonBrowseConfigFile setEnabled(bool) 353 182 356 211 m_pRadioInternalConfig toggled(bool) m_pButtonConfigureServer setEnabled(bool) 204 244 212 274 synergy-1.4.12-Source/src/gui/res/ScreenSettingsDialogBase.ui0000600000175000017500000003623411401533311024065 0ustar synergysynergy ScreenSettingsDialogBase 0 0 434 437 Screen Settings Screen &name: m_pLineEditName true A&liases false false &Add QAbstractItemView::ExtendedSelection false &Remove Qt::Vertical 20 126 &Modifier keys false &Shift: m_pComboBoxShift Shift Ctrl Alt Meta Super None &Ctrl: m_pComboBoxCtrl 1 Shift Ctrl Alt Meta Super None Al&t: m_pComboBoxAlt 2 Shift Ctrl Alt Meta Super None M&eta: m_pComboBoxMeta 3 Shift Ctrl Alt Meta Super None S&uper: m_pComboBoxSuper 4 Shift Ctrl Alt Meta Super None Qt::Vertical 20 40 &Dead corners false Top-left Top-right Bottom-left Bottom-right Corner Si&ze: m_pSpinBoxSwitchCornerSize Qt::Horizontal 40 20 &Fixes false Fix CAPS LOCK key Fix NUM LOCK key Fix SCROLL LOCK key Fix XTest for Xinerama false Qt::Vertical 20 40 Qt::Vertical 20 40 Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok m_pButtonBox accepted() ScreenSettingsDialogBase accept() 222 502 157 274 m_pButtonBox rejected() ScreenSettingsDialogBase reject() 290 508 286 274 synergy-1.4.12-Source/src/gui/res/ServerConfigDialogBase.ui0000600000175000017500000005473011271253201023524 0ustar synergysynergy ServerConfigDialogBase 0 0 740 514 Server Configuration 0 Screens and links true Drag a screen from the grid to the trashcan to remove it. QFrame::StyledPanel QFrame::Raised :/res/icons/64x64/user-trash.png 1 0 Configure the layout of your synergy server configuration. Qt::AlignCenter true Drag this button to the grid to add a new screen. QFrame::StyledPanel QFrame::Raised :/res/icons/64x64/video-display.png 0 273 16777215 273 true false QFrame::StyledPanel QFrame::Sunken 1 0 Drag new screens to the grid or move existing ones around. Drag a screen to the trashcan to delete it. Double click on a screen to edit its settings. Qt::AlignCenter true Qt::Vertical 20 40 Hotkeys &Hotkeys true &New false &Edit false &Remove Qt::Vertical 75 161 A&ctions false Ne&w false E&dit false Re&move Qt::Vertical 20 40 Advanced server settings &Switch true Switch &after waiting Qt::Horizontal 40 20 false 10 10000 10 250 ms true Switch on double &tap within Qt::Horizontal 40 20 false 10 10000 10 250 ms Qt::Vertical 20 40 &Options true &Check clients every Qt::Horizontal 40 20 false 1000 30000 1000 5000 ms true Use &relative mouse moves true S&ynchronize screen savers true Don't take &foreground window on Windows servers Qt::Vertical 20 16 &Dead corners false To&p-left Top-rig&ht &Bottom-left Bottom-ri&ght Qt::Horizontal 40 20 Cor&ner Size: m_pSpinBoxSwitchCornerSize Qt::Horizontal 40 20 Qt::Vertical 20 40 Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::NoButton|QDialogButtonBox::Ok ScreenSetupView QTableView
ScreenSetupView.h
1 NewScreenWidget QLabel
NewScreenWidget.h
 TrashScreenWidget QLabel
TrashScreenWidget.h
 m_pButtonBox accepted() ServerConfigDialogBase accept() 572 424 377 -8 m_pButtonBox rejected() ServerConfigDialogBase reject() 641 424 595 1 m_pCheckBoxSwitchDelay toggled(bool) m_pSpinBoxSwitchDelay setEnabled(bool) 110 63 110 63 m_pCheckBoxSwitchDoubleTap toggled(bool) m_pSpinBoxSwitchDoubleTap setEnabled(bool) 110 63 110 63 m_pCheckBoxHeartbeat toggled(bool) m_pSpinBoxHeartbeat setEnabled(bool) 110 63 110 63 m_pListHotkeys itemDoubleClicked(QListWidgetItem*) m_pButtonEditHotkey click() 197 115 304 115 m_pListActions itemDoubleClicked(QListWidgetItem*) m_pButtonEditAction click() 505 120 677 118 synergy-1.4.12-Source/src/gui/res/SettingsDialogBase.ui0000600000175000017500000002706512131605620022733 0ustar synergysynergy SettingsDialogBase 0 0 369 459 Settings &Startup &Start Synergy after logging in &Automatically start server/client &Hide when server/client starts true 0 0 &Encryption QFormLayout::AllNonFixedFieldsGrow 75 0 &Mode: m_pComboCryptoMode OFB (Output Feedback) CFB (Cipher Feedback) CTR (Counter) GCM (Galois/Counter) Disable encryption 75 0 Pass&word: m_pLineEditCryptoPass true QLineEdit::Password &Advanced 75 0 Sc&reen name: m_pLineEditScreenName true P&ort: m_pSpinBoxPort true 0 0 65535 24800 &Interface: m_pLineEditInterface true &Process mode: m_pComboProcessMode Service Desktop (legacy) 0 0 Logging Qt::AlignLeading|Qt::AlignLeft|Qt::AlignVCenter false 75 0 &Logging level: m_pComboLogLevel Error Warning Note Info Debug Debug1 Debug2 Log to file: false false Browse... Qt::Vertical 20 40 Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok m_pLineEditScreenName m_pLineEditInterface m_pCheckBoxAutoConnect m_pComboLogLevel m_pCheckBoxLogToFile m_pLineEditLogFilename buttonBox buttonBox accepted() SettingsDialogBase accept() 266 340 157 274 buttonBox rejected() SettingsDialogBase reject() 334 340 286 274 synergy-1.4.12-Source/src/gui/res/SetupWizardBase.ui0000600000175000017500000003025412131605620022266 0ustar synergysynergy SetupWizardBase 0 0 500 390 500 390 Setup Synergy 0 0 Server or Client? 75 true &Server (new setup) 0 0 This is the first computer you are configuring. Your keyboard and mouse are connected to this computer. This will allow you to move your mouse over to another computer's screen. There can only be one server in your setup. true Qt::Vertical QSizePolicy::Fixed 20 20 75 true &Client (add to setup) 0 0 You have already set up a server. This is a computer you wish to control using the server's keyboard and mouse. There can be many clients in your setup. true Qt::Vertical QSizePolicy::MinimumExpanding 0 0 0 0 Encryption Network traffic can be easily monitored. Using encryption can reduce the risk that sensitive information will be revealed to others (for example, passwords). true Qt::Vertical QSizePolicy::Fixed 20 20 Choose a random encryption mode. The mode must be the same on both the client and server. true QFormLayout::ExpandingFieldsGrow 0 0 100 0 0 0 0 0 75 true &Mode: 10 m_pComboCryptoMode 0 0 200 0 OFB (Output Feedback) CFB (Cipher Feedback) CTR (Counter) GCM (Galois/Counter) Disable encryption Qt::Vertical QSizePolicy::Fixed 20 10 0 0 A longer password will provide stronger encryption. It is a good idea to use 20 characters or more. true 100 0 75 true &Password: 10 m_pLineEditCryptoPass true 0 0 200 0 0 0 0 0 QLineEdit::Password 100 0 75 true &Confirm: 10 m_pLineEditCryptoPassConfirm true 0 0 200 0 QLineEdit::Password Qt::Vertical 20 100 synergy-1.4.12-Source/src/gui/res/Synergy.qrc0000600000175000017500000000062112005052225021012 0ustar synergysynergy icons/16x16/synergy-connected.png icons/16x16/synergy-disconnected.png icons/64x64/video-display.png icons/64x64/user-trash.png icons/16x16/warning.png icons/256x256/synergy.ico image/about.png synergy-1.4.12-Source/src/gui/res/win/0000700000175000017500000000000012140644175017452 5ustar synergysynergysynergy-1.4.12-Source/src/gui/res/win/Synergy.rc0000600000175000017500000000007311727171755021453 0ustar synergysynergyIDI_ICON1 ICON DISCARDABLE "../icons/256x256/synergy.ico" synergy-1.4.12-Source/src/gui/src/0000700000175000017500000000000012140644175016653 5ustar synergysynergysynergy-1.4.12-Source/src/gui/src/AboutDialog.cpp0000600000175000017500000000253612021261364021552 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "AboutDialog.h" #include #include #include AboutDialog::AboutDialog(QWidget* parent, const QString& synergyApp) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::AboutDialogBase() { setupUi(this); m_versionChecker.setApp(synergyApp); m_pLabelSynergyVersion->setText(m_versionChecker.getVersion()); // change default size based on os #if defined(Q_OS_MAC) QSize size(600, 380); setMaximumSize(size); setMinimumSize(size); resize(size); #elif defined(Q_OS_LINUX) QSize size(600, 330); setMaximumSize(size); setMinimumSize(size); resize(size); #endif } synergy-1.4.12-Source/src/gui/src/AboutDialog.h0000600000175000017500000000214412021261364021212 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(ABOUTDIALOG__H) #define ABOUTDIALOG__H #include #include "VersionChecker.h" #include "ui_AboutDialogBase.h" class QWidget; class QString; class AboutDialog : public QDialog, public Ui::AboutDialogBase { Q_OBJECT public: AboutDialog(QWidget* parent, const QString& synergyApp = QString()); private: VersionChecker m_versionChecker; }; #endif synergy-1.4.12-Source/src/gui/src/Action.cpp0000600000175000017500000000750512021261364020576 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "Action.h" #include #include const char* Action::m_ActionTypeNames[] = { "keyDown", "keyUp", "keystroke", "switchToScreen", "switchInDirection", "lockCursorToScreen", "mouseDown", "mouseUp", "mousebutton" }; const char* Action::m_SwitchDirectionNames[] = { "left", "right", "up", "down" }; const char* Action::m_LockCursorModeNames[] = { "toggle", "on", "off" }; Action::Action() : m_KeySequence(), m_Type(keystroke), m_TypeScreenNames(), m_SwitchScreenName(), m_SwitchDirection(switchLeft), m_LockCursorMode(lockCursorToggle), m_ActiveOnRelease(false), m_HasScreens(false) { } QString Action::text() const { QString text = QString(m_ActionTypeNames[keySequence().isMouseButton() ? type() + 6 : type() ]) + "("; switch (type()) { case keyDown: case keyUp: case keystroke: { text += keySequence().toString(); if (!keySequence().isMouseButton()) { const QStringList& screens = typeScreenNames(); if (haveScreens() && !screens.isEmpty()) { text += ","; for (int i = 0; i < screens.size(); i++) { text += screens[i]; if (i != screens.size() - 1) text += ":"; } } else text += ",*"; } } break; case switchToScreen: text += switchScreenName(); break; case switchInDirection: text += m_SwitchDirectionNames[m_SwitchDirection]; break; case lockCursorToScreen: text += m_LockCursorModeNames[m_LockCursorMode]; break; default: Q_ASSERT(0); break; } text += ")"; return text; } void Action::loadSettings(QSettings& settings) { keySequence().loadSettings(settings); setType(settings.value("type", keyDown).toInt()); typeScreenNames().clear(); int numTypeScreens = settings.beginReadArray("typeScreenNames"); for (int i = 0; i < numTypeScreens; i++) { settings.setArrayIndex(i); typeScreenNames().append(settings.value("typeScreenName").toString()); } settings.endArray(); setSwitchScreenName(settings.value("switchScreenName").toString()); setSwitchDirection(settings.value("switchInDirection", switchLeft).toInt()); setLockCursorMode(settings.value("lockCursorToScreen", lockCursorToggle).toInt()); setActiveOnRelease(settings.value("activeOnRelease", false).toBool()); setHaveScreens(settings.value("hasScreens", false).toBool()); } void Action::saveSettings(QSettings& settings) const { keySequence().saveSettings(settings); settings.setValue("type", type()); settings.beginWriteArray("typeScreenNames"); for (int i = 0; i < typeScreenNames().size(); i++) { settings.setArrayIndex(i); settings.setValue("typeScreenName", typeScreenNames()[i]); } settings.endArray(); settings.setValue("switchScreenName", switchScreenName()); settings.setValue("switchInDirection", switchDirection()); settings.setValue("lockCursorToScreen", lockCursorMode()); settings.setValue("activeOnRelease", activeOnRelease()); settings.setValue("hasScreens", haveScreens()); } QTextStream& operator<<(QTextStream& outStream, const Action& action) { if (action.activeOnRelease()) outStream << ";"; outStream << action.text(); return outStream; } synergy-1.4.12-Source/src/gui/src/Action.h0000600000175000017500000000565312021261364020245 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(ACTION_H) #define ACTION_H #include "KeySequence.h" #include #include #include class ActionDialog; class QSettings; class QTextStream; class Action { friend class ActionDialog; friend QTextStream& operator<<(QTextStream& outStream, const Action& action); public: enum ActionType { keyDown, keyUp, keystroke, switchToScreen, switchInDirection, lockCursorToScreen, mouseDown, mouseUp, mousebutton }; enum SwitchDirection { switchLeft, switchRight, switchUp, switchDown }; enum LockCursorMode { lockCursorToggle, lockCursonOn, lockCursorOff }; public: Action(); public: QString text() const; const KeySequence& keySequence() const { return m_KeySequence; } void loadSettings(QSettings& settings); void saveSettings(QSettings& settings) const; int type() const { return m_Type; } const QStringList& typeScreenNames() const { return m_TypeScreenNames; } const QString& switchScreenName() const { return m_SwitchScreenName; } int switchDirection() const { return m_SwitchDirection; } int lockCursorMode() const { return m_LockCursorMode; } bool activeOnRelease() const { return m_ActiveOnRelease; } bool haveScreens() const { return m_HasScreens; } protected: KeySequence& keySequence() { return m_KeySequence; } void setKeySequence(const KeySequence& seq) { m_KeySequence = seq; } void setType(int t) { m_Type = t; } QStringList& typeScreenNames() { return m_TypeScreenNames; } void setSwitchScreenName(const QString& n) { m_SwitchScreenName = n; } void setSwitchDirection(int d) { m_SwitchDirection = d; } void setLockCursorMode(int m) { m_LockCursorMode = m; } void setActiveOnRelease(bool b) { m_ActiveOnRelease = b; } void setHaveScreens(bool b) { m_HasScreens = b; } private: KeySequence m_KeySequence; int m_Type; QStringList m_TypeScreenNames; QString m_SwitchScreenName; int m_SwitchDirection; int m_LockCursorMode; bool m_ActiveOnRelease; bool m_HasScreens; static const char* m_ActionTypeNames[]; static const char* m_SwitchDirectionNames[]; static const char* m_LockCursorModeNames[]; }; typedef QList ActionList; QTextStream& operator<<(QTextStream& outStream, const Action& action); #endif synergy-1.4.12-Source/src/gui/src/ActionDialog.cpp0000600000175000017500000000727212021261364021717 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ActionDialog.h" #include "Hotkey.h" #include "Action.h" #include "ServerConfig.h" #include "KeySequence.h" #include #include ActionDialog::ActionDialog(QWidget* parent, ServerConfig& config, Hotkey& hotkey, Action& action) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::ActionDialogBase(), m_ServerConfig(config), m_Hotkey(hotkey), m_Action(action), m_pButtonGroupType(new QButtonGroup(this)) { setupUi(this); // work around Qt Designer's lack of a QButtonGroup; we need it to get // at the button id of the checked radio button QRadioButton* const typeButtons[] = { m_pRadioPress, m_pRadioRelease, m_pRadioPressAndRelease, m_pRadioSwitchToScreen, m_pRadioSwitchInDirection, m_pRadioLockCursorToScreen }; for (unsigned int i = 0; i < sizeof(typeButtons) / sizeof(typeButtons[0]); i++) m_pButtonGroupType->addButton(typeButtons[i], i); m_pKeySequenceWidgetHotkey->setText(m_Action.keySequence().toString()); m_pKeySequenceWidgetHotkey->setKeySequence(m_Action.keySequence()); m_pButtonGroupType->button(m_Action.type())->setChecked(true); m_pComboSwitchInDirection->setCurrentIndex(m_Action.switchDirection()); m_pComboLockCursorToScreen->setCurrentIndex(m_Action.lockCursorMode()); if (m_Action.activeOnRelease()) m_pRadioHotkeyReleased->setChecked(true); else m_pRadioHotkeyPressed->setChecked(true); m_pGroupBoxScreens->setChecked(m_Action.haveScreens()); int idx = 0; foreach(const Screen& screen, serverConfig().screens()) if (!screen.isNull()) { QListWidgetItem *pListItem = new QListWidgetItem(screen.name()); m_pListScreens->addItem(pListItem); if (m_Action.typeScreenNames().indexOf(screen.name()) != -1) m_pListScreens->setCurrentItem(pListItem); m_pComboSwitchToScreen->addItem(screen.name()); if (screen.name() == m_Action.switchScreenName()) m_pComboSwitchToScreen->setCurrentIndex(idx); idx++; } } void ActionDialog::accept() { if (!sequenceWidget()->valid() && m_pButtonGroupType->checkedId() >= 0 && m_pButtonGroupType->checkedId() < 3) return; m_Action.setKeySequence(sequenceWidget()->keySequence()); m_Action.setType(m_pButtonGroupType->checkedId()); m_Action.setHaveScreens(m_pGroupBoxScreens->isChecked()); m_Action.typeScreenNames().clear(); foreach(const QListWidgetItem* pItem, m_pListScreens->selectedItems()) m_Action.typeScreenNames().append(pItem->text()); m_Action.setSwitchScreenName(m_pComboSwitchToScreen->currentText()); m_Action.setSwitchDirection(m_pComboSwitchInDirection->currentIndex()); m_Action.setLockCursorMode(m_pComboLockCursorToScreen->currentIndex()); m_Action.setActiveOnRelease(m_pRadioHotkeyReleased->isChecked()); QDialog::accept(); } void ActionDialog::on_m_pKeySequenceWidgetHotkey_keySequenceChanged() { if (sequenceWidget()->keySequence().isMouseButton()) { m_pGroupBoxScreens->setEnabled(false); m_pListScreens->setEnabled(false); } else { m_pGroupBoxScreens->setEnabled(true); m_pListScreens->setEnabled(true); } } synergy-1.4.12-Source/src/gui/src/ActionDialog.h0000600000175000017500000000275712021261364021367 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(ACTIONDIALOG_H) #define ACTIONDIALOG_H #include #include "ui_ActionDialogBase.h" class Hotkey; class Action; class QRadioButton; class QButtonGroup; class ServerConfig; class ActionDialog : public QDialog, public Ui::ActionDialogBase { Q_OBJECT public: ActionDialog(QWidget* parent, ServerConfig& config, Hotkey& hotkey, Action& action); protected slots: void accept(); void on_m_pKeySequenceWidgetHotkey_keySequenceChanged(); protected: const KeySequenceWidget* sequenceWidget() const { return m_pKeySequenceWidgetHotkey; } const ServerConfig& serverConfig() const { return m_ServerConfig; } private: const ServerConfig& m_ServerConfig; Hotkey& m_Hotkey; Action& m_Action; QButtonGroup* m_pButtonGroupType; }; #endif synergy-1.4.12-Source/src/gui/src/AppConfig.cpp0000600000175000017500000001305612131565005021226 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "AppConfig.h" #include #include #if defined(Q_OS_WIN) const char AppConfig::m_SynergysName[] = "synergys.exe"; const char AppConfig::m_SynergycName[] = "synergyc.exe"; const char AppConfig::m_SynergyLogDir[] = "log/"; #define DEFAULT_PROCESS_MODE Service #else const char AppConfig::m_SynergysName[] = "synergys"; const char AppConfig::m_SynergycName[] = "synergyc"; const char AppConfig::m_SynergyLogDir[] = "/var/log/"; #define DEFAULT_PROCESS_MODE Desktop #endif static const char* logLevelNames[] = { "ERROR", "WARNING", "NOTE", "INFO", "DEBUG", "DEBUG1", "DEBUG2" }; AppConfig::AppConfig(QSettings* settings) : m_pSettings(settings), m_AutoConnect(false), m_ScreenName(), m_Port(24800), m_Interface(), m_LogLevel(0), m_AutoStart(false), m_AutoHide(false), m_AutoStartPrompt(false), m_WizardLastRun(0), m_CryptoPass(), m_CryptoMode(), m_ProcessMode(DEFAULT_PROCESS_MODE) { Q_ASSERT(m_pSettings); loadSettings(); } AppConfig::~AppConfig() { saveSettings(); } QString AppConfig::synergyLogDir() const { #if defined(Q_OS_WIN) // on windows, we want to log to program files return synergyProgramDir() + "log/"; #else // on unix, we'll log to the standard log dir return "/var/log/"; #endif } QString AppConfig::synergyProgramDir() const { // synergy binaries should be in the same dir. return QCoreApplication::applicationDirPath() + "/"; } void AppConfig::persistLogDir() { QDir dir = synergyLogDir(); // persist the log directory if (!dir.exists()) { dir.mkpath(dir.path()); } } QString AppConfig::logLevelText() const { return logLevelNames[logLevel()]; } void AppConfig::setAutoStart(bool b) { m_AutoStart = b; // always create or delete the links/files/entries even if they exist already, // in case it was broken. #if defined(Q_OS_LINUX) QString desktopFileName("synergy.desktop"); QString desktopFilePath("/usr/share/applications/" + desktopFileName); QString autoStartPath(QDir::homePath() + "/.config/autostart/" + desktopFileName); if (b) { QFile::link(desktopFilePath, autoStartPath); } else { QFile::remove(autoStartPath); } #elif defined(Q_OS_WIN) QSettings settings("HKEY_LOCAL_MACHINE\\SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Run", QSettings::NativeFormat); QString path("Synergy"); if (b) { settings.setValue(path, QCoreApplication::applicationFilePath()); } else { settings.remove(path); } settings.sync(); #endif // TODO: mac os x auto start } void AppConfig::loadSettings() { m_AutoConnect = settings().value("autoConnect", false).toBool(); m_ScreenName = settings().value("screenName", QHostInfo::localHostName()).toString(); m_Port = settings().value("port", 24800).toInt(); m_Interface = settings().value("interface").toString(); m_LogLevel = settings().value("logLevel", 2).toInt(); m_LogToFile = settings().value("logToFile", false).toBool(); m_LogFilename = settings().value("logFilename", synergyLogDir() + "synergy.log").toString(); m_AutoStart = settings().value("autoStart", false).toBool(); m_AutoHide = settings().value("autoHide", true).toBool(); m_AutoStartPrompt = settings().value("autoStartPrompt", true).toBool(); m_WizardLastRun = settings().value("wizardLastRun", 0).toInt(); m_ProcessMode = (ProcessMode)settings().value("processMode2", DEFAULT_PROCESS_MODE).toInt(); m_CryptoPass = settings().value("cryptoPass", "").toString(); m_CryptoMode = (CryptoMode)settings().value("cryptoMode", Disabled).toInt(); } void AppConfig::saveSettings() { settings().setValue("autoConnect", m_AutoConnect); settings().setValue("screenName", m_ScreenName); settings().setValue("port", m_Port); settings().setValue("interface", m_Interface); settings().setValue("logLevel", m_LogLevel); settings().setValue("logToFile", m_LogToFile); settings().setValue("logFilename", m_LogFilename); settings().setValue("autoStart", m_AutoStart); settings().setValue("autoHide", m_AutoHide); settings().setValue("autoStartPrompt", m_AutoStartPrompt); settings().setValue("wizardLastRun", kWizardVersion); settings().setValue("processMode2", m_ProcessMode); settings().setValue("cryptoPass", m_CryptoPass); settings().setValue("cryptoMode", m_CryptoMode); } QString AppConfig::hash(const QString& string) { QByteArray data = string.toUtf8(); QByteArray hash = QCryptographicHash::hash(data, QCryptographicHash::Md5); return hash.toHex(); } void AppConfig::setCryptoPass(const QString &s) { // clear field to user doesn't get confused. if (s.isEmpty()) { m_CryptoPass.clear(); return; } // only hash if password changes -- don't re-hash the hash. if (m_CryptoPass != s) { m_CryptoPass = hash(s); } } QString AppConfig::cryptoModeString() const { switch (cryptoMode()) { case OFB: return "ofb"; case CFB: return "cfb"; case CTR: return "ctr"; case GCM: return "gcm"; default: qCritical() << "invalid crypto mode"; return ""; } } synergy-1.4.12-Source/src/gui/src/AppConfig.h0000600000175000017500000000735312131565005020676 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(APPCONFIG_H) #define APPCONFIG_H #include #include "CryptoMode.h" // this should be incremented each time a new page is added. this is // saved to settings when the user finishes running the wizard. if // the saved wizard version is lower than this number, the wizard // will be displayed. const int kWizardVersion = 1; class QSettings; class SettingsDialog; enum ProcessMode { Service, Desktop }; class AppConfig { friend class SettingsDialog; friend class MainWindow; friend class SetupWizard; public: AppConfig(QSettings* settings); ~AppConfig(); public: bool autoConnect() const { return m_AutoConnect; } const QString& screenName() const { return m_ScreenName; } int port() const { return m_Port; } const QString& interface() const { return m_Interface; } int logLevel() const { return m_LogLevel; } bool logToFile() const { return m_LogToFile; } const QString& logFilename() const { return m_LogFilename; } QString logLevelText() const; bool autoStart() const { return m_AutoStart; } bool autoHide() const { return m_AutoHide; } bool autoStartPrompt() const { return m_AutoStartPrompt; } const QString& cryptoPass() const { return m_CryptoPass; } CryptoMode cryptoMode() const { return m_CryptoMode; } QString cryptoModeString() const; ProcessMode processMode() const { return m_ProcessMode; } bool wizardShouldRun() const { return m_WizardLastRun < kWizardVersion; } QString synergysName() const { return m_SynergysName; } QString synergycName() const { return m_SynergycName; } QString synergyProgramDir() const; QString synergyLogDir() const; bool detectPath(const QString& name, QString& path); void persistLogDir(); protected: QSettings& settings() { return *m_pSettings; } void setAutoConnect(bool b) { m_AutoConnect = b; } void setScreenName(const QString& s) { m_ScreenName = s; } void setPort(int i) { m_Port = i; } void setInterface(const QString& s) { m_Interface = s; } void setLogLevel(int i) { m_LogLevel = i; } void setLogToFile(bool b) { m_LogToFile = b; } void setLogFilename(const QString& s) { m_LogFilename = s; } void setAutoStart(bool b); void setAutoHide(bool b) { m_AutoHide = b; } void setAutoStartPrompt(bool b) { m_AutoStartPrompt = b; } void setCryptoMode(CryptoMode c) { m_CryptoMode = c; } void setProcessMode(ProcessMode p) { m_ProcessMode = p; } void setWizardHasRun() { m_WizardLastRun = kWizardVersion; } void loadSettings(); void saveSettings(); void setCryptoPass(const QString& s); static QString hash(const QString& string); private: QSettings* m_pSettings; bool m_AutoConnect; QString m_ScreenName; int m_Port; QString m_Interface; int m_LogLevel; bool m_LogToFile; QString m_LogFilename; bool m_AutoStart; bool m_AutoHide; bool m_AutoStartPrompt; int m_WizardLastRun; QString m_CryptoPass; CryptoMode m_CryptoMode; ProcessMode m_ProcessMode; static const char m_SynergysName[]; static const char m_SynergycName[]; static const char m_SynergyLogDir[]; }; #endif synergy-1.4.12-Source/src/gui/src/BaseConfig.cpp0000600000175000017500000000214712021261364021356 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "BaseConfig.h" const char* BaseConfig::m_ModifierNames[] = { "shift", "ctrl", "alt", "meta", "super", "none" }; const char* BaseConfig::m_FixNames[] = { "halfDuplexCapsLock", "halfDuplexNumLock", "halfDuplexScrollLock", "xtestIsXineramaUnaware" }; const char* BaseConfig::m_SwitchCornerNames[] = { "top-left", "top-right", "bottom-left", "bottom-right" }; synergy-1.4.12-Source/src/gui/src/BaseConfig.h0000600000175000017500000000524312021261364021023 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(BASECONFIG_H) #define BASECONFIG_H #include #include #include class BaseConfig { public: enum Modifier { DefaultMod = -1, Shift, Ctrl, Alt, Meta, Super, None, NumModifiers }; enum SwitchCorner { TopLeft, TopRight, BottomLeft, BottomRight, NumSwitchCorners }; enum Fix { CapsLock, NumLock, ScrollLock, XTest, NumFixes }; protected: BaseConfig() {} virtual ~BaseConfig() {} protected: template void readSettings(QSettings& settings, T1& array, const QString& arrayName, const T2& deflt) { int entries = settings.beginReadArray(arrayName + "Array"); array.clear(); for (int i = 0; i < entries; i++) { settings.setArrayIndex(i); QVariant v = settings.value(arrayName, deflt); array.append(v.value()); } settings.endArray(); } template void readSettings(QSettings& settings, T1& array, const QString& arrayName, const T2& deflt, int entries) { Q_ASSERT(array.size() >= entries); settings.beginReadArray(arrayName + "Array"); for (int i = 0; i < entries; i++) { settings.setArrayIndex(i); QVariant v = settings.value(arrayName, deflt); array[i] = v.value(); } settings.endArray(); } template void writeSettings(QSettings& settings, const T& array, const QString& arrayName) const { settings.beginWriteArray(arrayName + "Array"); for (int i = 0; i < array.size(); i++) { settings.setArrayIndex(i); settings.setValue(arrayName, array[i]); } settings.endArray(); } public: static const char* modifierName(int idx) { return m_ModifierNames[idx]; } static const char* fixName(int idx) { return m_FixNames[idx]; } static const char* switchCornerName(int idx) { return m_SwitchCornerNames[idx]; } private: static const char* m_ModifierNames[]; static const char* m_FixNames[]; static const char* m_SwitchCornerNames[]; }; #endif synergy-1.4.12-Source/src/gui/src/CryptoMode.h0000600000175000017500000000142512131565005021107 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once enum CryptoMode { Disabled, OFB, CFB, CTR, GCM }; synergy-1.4.12-Source/src/gui/src/Hotkey.cpp0000600000175000017500000000345712021261364020626 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "Hotkey.h" #include Hotkey::Hotkey() : m_KeySequence(), m_Actions() { } QString Hotkey::text() const { QString text = keySequence().toString(); if (keySequence().isMouseButton()) return "mousebutton(" + text + ")"; return "keystroke(" + text + ")"; } void Hotkey::loadSettings(QSettings& settings) { keySequence().loadSettings(settings); actions().clear(); int num = settings.beginReadArray("actions"); for (int i = 0; i < num; i++) { settings.setArrayIndex(i); Action a; a.loadSettings(settings); actions().append(a); } settings.endArray(); } void Hotkey::saveSettings(QSettings& settings) const { keySequence().saveSettings(settings); settings.beginWriteArray("actions"); for (int i = 0; i < actions().size(); i++) { settings.setArrayIndex(i); actions()[i].saveSettings(settings); } settings.endArray(); } QTextStream& operator<<(QTextStream& outStream, const Hotkey& hotkey) { for (int i = 0; i < hotkey.actions().size(); i++) outStream << "\t" << hotkey.text() << " = " << hotkey.actions()[i] << endl; return outStream; } synergy-1.4.12-Source/src/gui/src/Hotkey.h0000600000175000017500000000333012021261364020261 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(HOTKEY_H) #define HOTKEY_H #include #include #include #include "Action.h" #include "KeySequence.h" class HotkeyDialog; class ServerConfigDialog; class QSettings; class Hotkey { friend class HotkeyDialog; friend class ServerConfigDialog; friend QTextStream& operator<<(QTextStream& outStream, const Hotkey& hotkey); public: Hotkey(); public: QString text() const; const KeySequence& keySequence() const { return m_KeySequence; } const ActionList& actions() const { return m_Actions; } void loadSettings(QSettings& settings); void saveSettings(QSettings& settings) const; protected: KeySequence& keySequence() { return m_KeySequence; } void setKeySequence(const KeySequence& seq) { m_KeySequence = seq; } ActionList& actions() { return m_Actions; } private: KeySequence m_KeySequence; ActionList m_Actions; }; typedef QList HotkeyList; QTextStream& operator<<(QTextStream& outStream, const Hotkey& hotkey); #endif synergy-1.4.12-Source/src/gui/src/HotkeyDialog.cpp0000600000175000017500000000227312021261364021741 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "HotkeyDialog.h" #include #include HotkeyDialog::HotkeyDialog (QWidget* parent, Hotkey& hotkey) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::HotkeyDialogBase(), m_Hotkey(hotkey) { setupUi(this); m_pKeySequenceWidgetHotkey->setText(m_Hotkey.text()); } void HotkeyDialog::accept() { if (!sequenceWidget()->valid()) return; hotkey().setKeySequence(sequenceWidget()->keySequence()); QDialog::accept(); } synergy-1.4.12-Source/src/gui/src/HotkeyDialog.h0000600000175000017500000000241212021261364021401 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(HOTKEYDIALOG_H) #define HOTKEYDIALOG_H #include "ui_HotkeyDialogBase.h" #include "Hotkey.h" #include class HotkeyDialog : public QDialog, public Ui::HotkeyDialogBase { Q_OBJECT public: HotkeyDialog(QWidget* parent, Hotkey& hotkey); public: const Hotkey& hotkey() const { return m_Hotkey; } protected slots: void accept(); protected: const KeySequenceWidget* sequenceWidget() const { return m_pKeySequenceWidgetHotkey; } Hotkey& hotkey() { return m_Hotkey; } private: Hotkey& m_Hotkey; }; #endif synergy-1.4.12-Source/src/gui/src/Ipc.cpp0000600000175000017500000000174612021261364020075 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // this class is a duplicate of /src/lib/ipc/Ipc.cpp #include "Ipc.h" const char* kIpcMsgHello = "IHEL%1i"; const char* kIpcMsgLogLine = "ILOG%s"; const char* kIpcMsgCommand = "ICMD%s%1i"; const char* kIpcMsgShutdown = "ISDN"; synergy-1.4.12-Source/src/gui/src/Ipc.h0000600000175000017500000000225012021261364017531 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // this class is a duplicate of /src/lib/ipc/Ipc.h #pragma once #define IPC_HOST "127.0.0.1" #define IPC_PORT 24801 enum qIpcMessageType { kIpcHello, kIpcLogLine, kIpcCommand, kIpcShutdown, }; enum qIpcClientType { kIpcClientUnknown, kIpcClientGui, kIpcClientNode, }; extern const char* kIpcMsgHello; extern const char* kIpcMsgLogLine; extern const char* kIpcMsgCommand; extern const char* kIpcMsgShutdown; synergy-1.4.12-Source/src/gui/src/IpcClient.cpp0000600000175000017500000000712612021261364021232 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IpcClient.h" #include #include #include #include #include "IpcReader.h" #include "Ipc.h" IpcClient::IpcClient() : m_ReaderStarted(false), m_Enabled(false) { m_Socket = new QTcpSocket(this); connect(m_Socket, SIGNAL(connected()), this, SLOT(connected())); connect(m_Socket, SIGNAL(error(QAbstractSocket::SocketError)), this, SLOT(error(QAbstractSocket::SocketError))); m_Reader = new IpcReader(m_Socket); connect(m_Reader, SIGNAL(readLogLine(const QString&)), this, SLOT(handleReadLogLine(const QString&))); } IpcClient::~IpcClient() { } void IpcClient::connected() { char typeBuf[1]; typeBuf[0] = kIpcClientGui; sendHello(); infoMessage("connection established"); } void IpcClient::connectToHost() { m_Enabled = true; infoMessage("connecting to service..."); m_Socket->connectToHost(QHostAddress(QHostAddress::LocalHost), IPC_PORT); if (!m_ReaderStarted) { m_Reader->start(); m_ReaderStarted = true; } } void IpcClient::disconnectFromHost() { infoMessage("service disconnect"); m_Reader->stop(); m_Socket->close(); } void IpcClient::error(QAbstractSocket::SocketError error) { QString text; switch (error) { case 0: text = "connection refused"; break; case 1: text = "remote host closed"; break; default: text = QString("code=%1").arg(error); break; } errorMessage(QString("ipc connection error, %1").arg(text)); QTimer::singleShot(1000, this, SLOT(retryConnect())); } void IpcClient::retryConnect() { if (m_Enabled) { connectToHost(); } } void IpcClient::sendHello() { QDataStream stream(m_Socket); stream.writeRawData(kIpcMsgHello, 4); char typeBuf[1]; typeBuf[0] = kIpcClientGui; stream.writeRawData(typeBuf, 1); } void IpcClient::sendCommand(const QString& command, bool elevate) { QDataStream stream(m_Socket); stream.writeRawData(kIpcMsgCommand, 4); std::string stdStringCommand = command.toStdString(); const char* charCommand = stdStringCommand.c_str(); int length = strlen(charCommand); char lenBuf[4]; intToBytes(length, lenBuf, 4); stream.writeRawData(lenBuf, 4); stream.writeRawData(charCommand, length); char elevateBuf[1]; elevateBuf[0] = elevate ? 1 : 0; stream.writeRawData(elevateBuf, 1); } void IpcClient::handleReadLogLine(const QString& text) { readLogLine(text); } // TODO: qt must have a built in way of converting int to bytes. void IpcClient::intToBytes(int value, char *buffer, int size) { if (size == 1) { buffer[0] = value & 0xff; } else if (size == 2) { buffer[0] = (value >> 8) & 0xff; buffer[1] = value & 0xff; } else if (size == 4) { buffer[0] = (value >> 24) & 0xff; buffer[1] = (value >> 16) & 0xff; buffer[2] = (value >> 8) & 0xff; buffer[3] = value & 0xff; } else { // TODO: other sizes, if needed. } } synergy-1.4.12-Source/src/gui/src/IpcClient.h0000600000175000017500000000303712021261364020674 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include class QTcpSocket; class IpcReader; class IpcClient : public QObject { Q_OBJECT public: IpcClient(); virtual ~IpcClient(); void sendHello(); void sendCommand(const QString& command, bool elevate); void connectToHost(); void disconnectFromHost(); public slots: void retryConnect(); private: void intToBytes(int value, char* buffer, int size); private slots: void connected(); void error(QAbstractSocket::SocketError error); void handleReadLogLine(const QString& text); signals: void readLogLine(const QString& text); void infoMessage(const QString& text); void errorMessage(const QString& text); private: QTcpSocket* m_Socket; IpcReader* m_Reader; bool m_ReaderStarted; bool m_Enabled; }; synergy-1.4.12-Source/src/gui/src/IpcReader.cpp0000600000175000017500000000607112021261364021214 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IpcReader.h" #include #include "Ipc.h" #include #include #include IpcReader::IpcReader(QTcpSocket* socket) : m_Socket(socket) { } IpcReader::~IpcReader() { } void IpcReader::start() { connect(m_Socket, SIGNAL(readyRead()), this, SLOT(read())); } void IpcReader::stop() { disconnect(m_Socket, SIGNAL(readyRead()), this, SLOT(read())); } void IpcReader::read() { QMutexLocker locker(&m_Mutex); std::cout << "ready read" << std::endl; while (m_Socket->bytesAvailable()) { std::cout << "bytes available" << std::endl; char codeBuf[5]; readStream(codeBuf, 4); codeBuf[4] = 0; std::cout << "ipc read: " << codeBuf << std::endl; if (memcmp(codeBuf, kIpcMsgLogLine, 4) == 0) { std::cout << "reading log line" << std::endl; char lenBuf[4]; readStream(lenBuf, 4); int len = bytesToInt(lenBuf, 4); char* data = new char[len]; readStream(data, len); QString line = QString::fromUtf8(data, len); delete data; readLogLine(line); } else { std::cerr << "aborting, message invalid" << std::endl; return; } } std::cout << "read done" << std::endl; } bool IpcReader::readStream(char* buffer, int length) { std::cout << "reading stream" << std::endl; int read = 0; while (read < length) { int ask = length - read; if (m_Socket->bytesAvailable() < ask) { std::cout << "buffer too short, waiting" << std::endl; m_Socket->waitForReadyRead(-1); } int got = m_Socket->read(buffer, ask); read += got; std::cout << "> ask=" << ask << " got=" << got << " read=" << read << std::endl; if (got == -1) { std::cout << "socket ended, aborting" << std::endl; return false; } else if (length - read > 0) { std::cout << "more remains, seek to " << got << std::endl; buffer += got; } } return true; } int IpcReader::bytesToInt(const char *buffer, int size) { if (size == 1) { return (unsigned char)buffer[0]; } else if (size == 2) { return (((unsigned char)buffer[0]) << 8) + (unsigned char)buffer[1]; } else if (size == 4) { return (((unsigned char)buffer[0]) << 24) + (((unsigned char)buffer[1]) << 16) + (((unsigned char)buffer[2]) << 8) + (unsigned char)buffer[3]; } else { return 0; } } synergy-1.4.12-Source/src/gui/src/IpcReader.h0000600000175000017500000000230412021261364020654 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include class QTcpSocket; class IpcReader : public QObject { Q_OBJECT; public: IpcReader(QTcpSocket* socket); virtual ~IpcReader(); void start(); void stop(); signals: void readLogLine(const QString& text); private: bool readStream(char* buffer, int length); int bytesToInt(const char* buffer, int size); private slots: void read(); private: QTcpSocket* m_Socket; QMutex m_Mutex; }; synergy-1.4.12-Source/src/gui/src/KeySequence.cpp0000600000175000017500000001311412021261364021573 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "KeySequence.h" #include #include // this table originally comes from Qt sources (gui/kernel/qkeysequence.cpp) // and is heavily modified for QSynergy static const struct { int key; const char* name; } keyname[] = { { Qt::Key_Space, "Space" }, { Qt::Key_Escape, "Escape" }, { Qt::Key_Tab, "Tab" }, { Qt::Key_Backtab, "LeftTab" }, { Qt::Key_Backspace, "BackSpace" }, { Qt::Key_Return, "Return" }, { Qt::Key_Insert, "Insert" }, { Qt::Key_Delete, "Delete" }, { Qt::Key_Pause, "Pause" }, { Qt::Key_Print, "Print" }, { Qt::Key_SysReq, "SysReq" }, { Qt::Key_Home, "Home" }, { Qt::Key_End, "End" }, { Qt::Key_Left, "Left" }, { Qt::Key_Up, "Up" }, { Qt::Key_Right, "Right" }, { Qt::Key_Down, "Down" }, { Qt::Key_PageUp, "PageUp" }, { Qt::Key_PageDown, "PageDown" }, { Qt::Key_CapsLock, "CapsLock" }, { Qt::Key_NumLock, "NumLock" }, { Qt::Key_ScrollLock, "ScrollLock" }, { Qt::Key_Menu, "Menu" }, { Qt::Key_Help, "Help" }, { Qt::Key_Enter, "KP_Enter" }, { Qt::Key_Clear, "Clear" }, { Qt::Key_Back, "WWWBack" }, { Qt::Key_Forward, "WWWForward" }, { Qt::Key_Stop, "WWWStop" }, { Qt::Key_Refresh, "WWWRefresh" }, { Qt::Key_VolumeDown, "AudioDown" }, { Qt::Key_VolumeMute, "AudioMute" }, { Qt::Key_VolumeUp, "AudioUp" }, { Qt::Key_MediaPlay, "AudioPlay" }, { Qt::Key_MediaStop, "AudioStop" }, { Qt::Key_MediaPrevious,"AudioPrev" }, { Qt::Key_MediaNext, "AudioNext" }, { Qt::Key_HomePage, "WWWHome" }, { Qt::Key_Favorites, "WWWFavorites" }, { Qt::Key_Search, "WWWSearch" }, { Qt::Key_Standby, "Sleep" }, { Qt::Key_LaunchMail, "AppMail" }, { Qt::Key_LaunchMedia, "AppMedia" }, { Qt::Key_Launch0, "AppUser1" }, { Qt::Key_Launch1, "AppUser2" }, { Qt::Key_Select, "Select" }, { 0, 0 } }; KeySequence::KeySequence() : m_Sequence(), m_Modifiers(0), m_IsValid(false) { } bool KeySequence::isMouseButton() const { return !m_Sequence.isEmpty() && m_Sequence.last() < Qt::Key_Space; } QString KeySequence::toString() const { QString result; for (int i = 0; i < m_Sequence.size(); i++) { result += keyToString(m_Sequence[i]); if (i != m_Sequence.size() - 1) result += "+"; } return result; } bool KeySequence::appendMouseButton(int button) { return appendKey(button, 0); } bool KeySequence::appendKey(int key, int modifiers) { if (m_Sequence.size() == 4) return true; switch(key) { case Qt::Key_AltGr: return false; case Qt::Key_Control: case Qt::Key_Alt: case Qt::Key_Shift: case Qt::Key_Meta: case Qt::Key_Menu: { int mod = modifiers & (~m_Modifiers); if (mod) { m_Sequence.append(mod); m_Modifiers |= mod; } } break; default: // see if we can handle this key, if not, don't accept it if (keyToString(key).isEmpty()) break; m_Sequence.append(key); setValid(true); return true; } return false; } void KeySequence::loadSettings(QSettings& settings) { sequence().clear(); int num = settings.beginReadArray("keys"); for (int i = 0; i < num; i++) { settings.setArrayIndex(i); sequence().append(settings.value("key", 0).toInt()); } settings.endArray(); setModifiers(0); setValid(true); } void KeySequence::saveSettings(QSettings& settings) const { settings.beginWriteArray("keys"); for (int i = 0; i < sequence().size(); i++) { settings.setArrayIndex(i); settings.setValue("key", sequence()[i]); } settings.endArray(); } QString KeySequence::keyToString(int key) { // nothing there? if (key == 0) return ""; // a hack to handle mouse buttons as if they were keys if (key < Qt::Key_Space) { switch(key) { case Qt::LeftButton: return "1"; case Qt::RightButton: return "2"; case Qt::MidButton: return "3"; } return "4"; // qt only knows three mouse buttons, so assume it's an unknown fourth one } // modifiers? if (key & Qt::ShiftModifier) return "Shift"; if (key & Qt::ControlModifier) return "Control"; if (key & Qt::AltModifier) return "Alt"; if (key & Qt::MetaModifier) return "Meta"; // treat key pad like normal keys (FIXME: we should have another lookup table for keypad keys instead) key &= ~Qt::KeypadModifier; // a printable 7 bit character? if (key < 0x80 && key != Qt::Key_Space) return QChar(key & 0x7f).toLower(); // a function key? if (key >= Qt::Key_F1 && key <= Qt::Key_F35) return QString::fromUtf8("F%1").arg(key - Qt::Key_F1 + 1); // a special key? int i=0; while (keyname[i].name) { if (key == keyname[i].key) return QString::fromUtf8(keyname[i].name); i++; } // representable in ucs2? if (key < 0x10000) return QString("\\u%1").arg(QChar(key).toLower().unicode(), 4, 16, QChar('0')); // give up, synergy probably won't handle this return ""; } synergy-1.4.12-Source/src/gui/src/KeySequence.h0000600000175000017500000000303112021261364021235 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(KEYSEQUENCE_H) #define KEYSEQUENCE_H #include #include class QSettings; class KeySequence { public: KeySequence(); public: QString toString() const; bool appendKey(int modifiers, int key); bool appendMouseButton(int button); bool isMouseButton() const; bool valid() const { return m_IsValid; } int modifiers() const { return m_Modifiers; } void saveSettings(QSettings& settings) const; void loadSettings(QSettings& settings); const QList& sequence() const { return m_Sequence; } private: void setValid(bool b) { m_IsValid = b; } void setModifiers(int i) { m_Modifiers = i; } QList& sequence() { return m_Sequence; } private: QList m_Sequence; int m_Modifiers; bool m_IsValid; static QString keyToString(int key); }; #endif synergy-1.4.12-Source/src/gui/src/KeySequenceWidget.cpp0000600000175000017500000000555012021261364022744 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "KeySequenceWidget.h" #include KeySequenceWidget::KeySequenceWidget(QWidget* parent, const KeySequence& seq) : QPushButton(parent), m_KeySequence(seq), m_BackupSequence(seq), m_Status(Stopped), m_MousePrefix("mousebutton("), m_MousePostfix(")"), m_KeyPrefix("keystroke("), m_KeyPostfix(")") { setFocusPolicy(Qt::NoFocus); updateOutput(); } void KeySequenceWidget::setKeySequence(const KeySequence& seq) { keySequence() = seq; backupSequence() = seq; setStatus(Stopped); updateOutput(); } void KeySequenceWidget::mousePressEvent(QMouseEvent* event) { event->accept(); if (status() == Stopped) { startRecording(); return; } if (m_KeySequence.appendMouseButton(event->button())) stopRecording(); updateOutput(); } void KeySequenceWidget::startRecording() { keySequence() = KeySequence(); setDown(true); setFocus(); grabKeyboard(); setStatus(Recording); } void KeySequenceWidget::stopRecording() { if (!keySequence().valid()) { keySequence() = backupSequence(); updateOutput(); } setDown(false); focusNextChild(); releaseKeyboard(); setStatus(Stopped); emit keySequenceChanged(); } bool KeySequenceWidget::event(QEvent* event) { if (status() == Recording) { switch(event->type()) { case QEvent::KeyPress: keyPressEvent(static_cast(event)); return true; case QEvent::MouseButtonRelease: event->accept(); return true; case QEvent::ShortcutOverride: event->accept(); return true; case QEvent::FocusOut: stopRecording(); if (!valid()) { keySequence() = backupSequence(); updateOutput(); } break; default: break; } } return QPushButton::event(event); } void KeySequenceWidget::keyPressEvent(QKeyEvent* event) { event->accept(); if (status() == Stopped) return; if (m_KeySequence.appendKey(event->key(), event->modifiers())) stopRecording(); updateOutput(); } void KeySequenceWidget::updateOutput() { QString s; if (m_KeySequence.isMouseButton()) s = mousePrefix() + m_KeySequence.toString() + mousePostfix(); else s = keyPrefix() + m_KeySequence.toString() + keyPostfix(); setText(s); } synergy-1.4.12-Source/src/gui/src/KeySequenceWidget.h0000600000175000017500000000464212021261364022412 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(KEYSEQUENCEWIDGET__H) #define KEYSEQUENCEWIDGET__H #include #include "KeySequence.h" class KeySequenceWidget : public QPushButton { Q_OBJECT public: KeySequenceWidget(QWidget* parent, const KeySequence& seq = KeySequence()); signals: void keySequenceChanged(); public: const QString& mousePrefix() const { return m_MousePrefix; } const QString& mousePostfix() const { return m_MousePostfix; } const QString& keyPrefix() const { return m_KeyPrefix; } const QString& keyPostfix() const { return m_KeyPostfix; } void setMousePrefix(const QString& s) { m_MousePrefix = s; } void setMousePostfix(const QString& s) { m_MousePostfix = s; } void setKeyPrefix(const QString& s) { m_KeyPrefix = s; } void setKeyPostfix(const QString& s) { m_KeyPostfix = s; } const KeySequence& keySequence() const { return m_KeySequence; } const KeySequence& backupSequence() const { return m_BackupSequence; } void setKeySequence(const KeySequence& seq); bool valid() const { return keySequence().valid(); } protected: void mousePressEvent(QMouseEvent*); void keyPressEvent(QKeyEvent*); bool event(QEvent* event); void appendToSequence(int key); void updateOutput(); void startRecording(); void stopRecording(); KeySequence& keySequence() { return m_KeySequence; } KeySequence& backupSequence() { return m_BackupSequence; } private: enum Status { Stopped, Recording }; void setStatus(Status s) { m_Status = s; } Status status() const { return m_Status; } private: KeySequence m_KeySequence; KeySequence m_BackupSequence; Status m_Status; QString m_MousePrefix; QString m_MousePostfix; QString m_KeyPrefix; QString m_KeyPostfix; }; #endif synergy-1.4.12-Source/src/gui/src/main.cpp0000600000175000017500000000472512131565005020307 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define TRAY_RETRY_COUNT 10 #define TRAY_RETRY_WAIT 2000 #include "QSynergyApplication.h" #include "MainWindow.h" #include "AppConfig.h" #include "SetupWizard.h" #include #include #include class QThreadImpl : public QThread { public: static void msleep(unsigned long msecs) { QThread::msleep(msecs); } }; int waitForTray(); int main(int argc, char* argv[]) { QCoreApplication::setOrganizationName("Synergy"); QCoreApplication::setOrganizationDomain("http://synergy-foss.org/"); QCoreApplication::setApplicationName("Synergy"); QSynergyApplication app(argc, argv); if (!waitForTray()) return -1; QApplication::setQuitOnLastWindowClosed(false); QTranslator qtTranslator; qtTranslator.load("qt_" + QLocale::system().name(), QLibraryInfo::location(QLibraryInfo::TranslationsPath)); app.installTranslator(&qtTranslator); QTranslator synergyTranslator; synergyTranslator.load("res/lang/" + QLocale::system().name()); app.installTranslator(&synergyTranslator); QSettings settings; AppConfig appConfig(&settings); MainWindow mainWindow(settings, appConfig); SetupWizard setupWizard(mainWindow, true); if (appConfig.wizardShouldRun()) { setupWizard.show(); } else { mainWindow.start(false); } return app.exec(); } int waitForTray() { // on linux, the system tray may not be available immediately after logging in, // so keep retrying but give up after a short time. int trayAttempts = 0; while (true) { if (QSystemTrayIcon::isSystemTrayAvailable()) { break; } if (++trayAttempts > TRAY_RETRY_COUNT) { QMessageBox::critical(NULL, "Synergy", QObject::tr("System tray is unavailable, quitting.")); return false; } QThreadImpl::msleep(TRAY_RETRY_WAIT); } return true; } synergy-1.4.12-Source/src/gui/src/MainWindow.cpp0000600000175000017500000005176212131565005021442 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define WEBSITE_ADDRESS "synergy-foss.org" #include #include "MainWindow.h" #include "AboutDialog.h" #include "ServerConfigDialog.h" #include "SettingsDialog.h" #include "SetupWizard.h" #include #include #include #include #if defined(Q_OS_MAC) #include #endif #if defined(Q_OS_WIN) #define WIN32_LEAN_AND_MEAN #include #endif #if defined(Q_OS_WIN) static const char synergyConfigName[] = "synergy.sgc"; static const QString synergyConfigFilter(QObject::tr("Synergy Configurations (*.sgc);;All files (*.*)")); #else static const char synergyConfigName[] = "synergy.conf"; static const QString synergyConfigFilter(QObject::tr("Synergy Configurations (*.conf);;All files (*.*)")); #endif static const char* synergyIconFiles[] = { ":/res/icons/16x16/synergy-disconnected.png", ":/res/icons/16x16/synergy-disconnected.png", ":/res/icons/16x16/synergy-connected.png" }; MainWindow::MainWindow(QSettings& settings, AppConfig& appConfig) : m_Settings(settings), m_AppConfig(appConfig), m_pSynergy(NULL), m_SynergyState(synergyDisconnected), m_ServerConfig(&m_Settings, 5, 3), m_pTempConfigFile(NULL), m_pTrayIcon(NULL), m_pTrayIconMenu(NULL), m_alreadyHidden(false), m_SetupWizard(NULL), m_ElevateProcess(false), m_SuppressElevateWarning(false) { setupUi(this); createMenuBar(); loadSettings(); initConnections(); m_pUpdateIcon->hide(); m_pUpdateLabel->hide(); m_versionChecker.setApp(appPath(appConfig.synergycName())); m_pLabelScreenName->setText(getScreenName()); m_pLabelIpAddresses->setText(getIPAddresses()); m_SetupWizard = new SetupWizard(*this, false); #if defined(Q_OS_WIN) // ipc must always be enabled, so that we can disable command when switching to desktop mode. connect(&m_IpcClient, SIGNAL(readLogLine(const QString&)), this, SLOT(appendLogRaw(const QString&))); connect(&m_IpcClient, SIGNAL(errorMessage(const QString&)), this, SLOT(appendLogError(const QString&))); connect(&m_IpcClient, SIGNAL(infoMessage(const QString&)), this, SLOT(appendLogNote(const QString&))); m_IpcClient.connectToHost(); #else // elevate checkbox is only useful on ms windows. m_pElevateCheckBox->hide(); #endif // change default size based on os #if defined(Q_OS_MAC) resize(720, 550); setMinimumSize(size()); #elif defined(Q_OS_LINUX) resize(700, 530); setMinimumSize(size()); #endif } MainWindow::~MainWindow() { if (appConfig().processMode() == Desktop) { stopDesktop(); } saveSettings(); delete m_SetupWizard; } void MainWindow::start(bool firstRun) { onModeChanged(!firstRun && appConfig().autoConnect(), false); createTrayIcon(); // always show. auto-hide only happens when we have a connection. showNormal(); m_versionChecker.checkLatest(); } void MainWindow::onModeChanged(bool startDesktop, bool applyService) { refreshApplyButton(); if (appConfig().processMode() == Service) { // form is always enabled in service mode. setFormEnabled(true); // ensure that the apply button actually does something, since desktop // mode screws around with connecting/disconnecting the action. disconnect(m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStartSynergy, SLOT(trigger())); connect(m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStartSynergy, SLOT(trigger())); if (applyService) { stopDesktop(); startSynergy(); } } else if ((appConfig().processMode() == Desktop) && startDesktop) { stopService(); startSynergy(); } m_pElevateCheckBox->setEnabled(appConfig().processMode() == Service); } void MainWindow::refreshApplyButton() { m_pButtonApply->setEnabled(appConfig().processMode() == Service); } void MainWindow::setStatus(const QString &status) { m_pStatusLabel->setText(status); } void MainWindow::createTrayIcon() { m_pTrayIconMenu = new QMenu(this); m_pTrayIconMenu->addAction(m_pActionStartSynergy); m_pTrayIconMenu->addAction(m_pActionStopSynergy); m_pTrayIconMenu->addSeparator(); m_pTrayIconMenu->addAction(m_pActionMinimize); m_pTrayIconMenu->addAction(m_pActionRestore); m_pTrayIconMenu->addSeparator(); m_pTrayIconMenu->addAction(m_pActionQuit); m_pTrayIcon = new QSystemTrayIcon(this); m_pTrayIcon->setContextMenu(m_pTrayIconMenu); connect(m_pTrayIcon, SIGNAL(activated(QSystemTrayIcon::ActivationReason)), this, SLOT(trayActivated(QSystemTrayIcon::ActivationReason))); setIcon(synergyDisconnected); m_pTrayIcon->show(); } void MainWindow::createMenuBar() { QMenuBar* menubar = new QMenuBar(this); QMenu* pMenuFile = new QMenu(tr("&File"), menubar); QMenu* pMenuEdit = new QMenu(tr("&Edit"), menubar); QMenu* pMenuWindow = new QMenu(tr("&Window"), menubar); QMenu* pMenuHelp = new QMenu(tr("&Help"), menubar); menubar->addAction(pMenuFile->menuAction()); menubar->addAction(pMenuEdit->menuAction()); #if !defined(Q_OS_MAC) menubar->addAction(pMenuWindow->menuAction()); #endif menubar->addAction(pMenuHelp->menuAction()); pMenuFile->addAction(m_pActionStartSynergy); pMenuFile->addAction(m_pActionStopSynergy); pMenuFile->addSeparator(); pMenuFile->addAction(m_pActionWizard); pMenuFile->addAction(m_pActionSave); pMenuFile->addSeparator(); pMenuFile->addAction(m_pActionQuit); pMenuEdit->addAction(m_pActionSettings); pMenuWindow->addAction(m_pActionMinimize); pMenuWindow->addAction(m_pActionRestore); pMenuHelp->addAction(m_pActionAbout); setMenuBar(menubar); } void MainWindow::loadSettings() { // the next two must come BEFORE loading groupServerChecked and groupClientChecked or // disabling and/or enabling the right widgets won't automatically work m_pRadioExternalConfig->setChecked(settings().value("useExternalConfig", false).toBool()); m_pRadioInternalConfig->setChecked(settings().value("useInternalConfig", true).toBool()); m_pGroupServer->setChecked(settings().value("groupServerChecked", false).toBool()); m_pLineEditConfigFile->setText(settings().value("configFile", QDir::homePath() + "/" + synergyConfigName).toString()); m_pGroupClient->setChecked(settings().value("groupClientChecked", true).toBool()); m_pLineEditHostname->setText(settings().value("serverHostname").toString()); m_SuppressElevateWarning = true; m_pElevateCheckBox->setChecked(settings().value("elevateChecked", false).toBool()); m_SuppressElevateWarning = false; } void MainWindow::initConnections() { connect(m_pActionMinimize, SIGNAL(triggered()), this, SLOT(hide())); connect(m_pActionRestore, SIGNAL(triggered()), this, SLOT(showNormal())); connect(m_pActionStartSynergy, SIGNAL(triggered()), this, SLOT(startSynergy())); connect(m_pActionStopSynergy, SIGNAL(triggered()), this, SLOT(stopSynergy())); connect(m_pActionQuit, SIGNAL(triggered()), qApp, SLOT(quit())); connect(&m_versionChecker, SIGNAL(updateFound(const QString&)), this, SLOT(updateFound(const QString&))); } void MainWindow::saveSettings() { // program settings settings().setValue("groupServerChecked", m_pGroupServer->isChecked()); settings().setValue("useExternalConfig", m_pRadioExternalConfig->isChecked()); settings().setValue("configFile", m_pLineEditConfigFile->text()); settings().setValue("useInternalConfig", m_pRadioInternalConfig->isChecked()); settings().setValue("groupClientChecked", m_pGroupClient->isChecked()); settings().setValue("serverHostname", m_pLineEditHostname->text()); settings().sync(); } void MainWindow::setIcon(qSynergyState state) { QIcon icon; icon.addFile(synergyIconFiles[state]); if (m_pTrayIcon) m_pTrayIcon->setIcon(icon); } void MainWindow::trayActivated(QSystemTrayIcon::ActivationReason reason) { if (reason == QSystemTrayIcon::DoubleClick) { if (isVisible()) { hide(); } else { showNormal(); activateWindow(); } } } void MainWindow::logOutput() { if (m_pSynergy) { QString text(m_pSynergy->readAllStandardOutput()); foreach(QString line, text.split(QRegExp("\r|\n|\r\n"))) { if (!line.isEmpty()) { appendLogRaw(line); } } } } void MainWindow::logError() { if (m_pSynergy) { appendLogRaw(m_pSynergy->readAllStandardError()); } } void MainWindow::updateFound(const QString &version) { m_pUpdateIcon->show(); m_pUpdateLabel->show(); m_pUpdateLabel->setText( tr("

Version %1 is now available, visit website.

") .arg(version).arg("http://synergy-foss.org")); } void MainWindow::appendLogNote(const QString& text) { appendLogRaw("NOTE: " + text); } void MainWindow::appendLogError(const QString& text) { appendLogRaw("ERROR: " + text); } void MainWindow::appendLogRaw(const QString& text) { foreach(QString line, text.split(QRegExp("\r|\n|\r\n"))) { if (!line.isEmpty()) { m_pLogOutput->append(line); updateStateFromLogLine(line); } } } void MainWindow::updateStateFromLogLine(const QString &line) { // TODO: implement ipc connection state messages to replace this hack. if (line.contains("started server") || line.contains("connected to server")) { setSynergyState(synergyConnected); // only hide once after each new connection. if (!m_alreadyHidden && appConfig().autoHide()) { hide(); m_alreadyHidden = true; } } } void MainWindow::clearLog() { m_pLogOutput->clear(); } void MainWindow::startSynergy() { // TODO: refactor this out into 2 methods. bool desktopMode = appConfig().processMode() == Desktop; bool serviceMode = appConfig().processMode() == Service; if (desktopMode) { stopSynergy(); } setSynergyState(synergyConnecting); QString app; QStringList args; args << "-f" << "--no-tray" << "--debug" << appConfig().logLevelText(); if (!appConfig().screenName().isEmpty()) args << "--name" << appConfig().screenName(); if (appConfig().cryptoMode() != Disabled) { args << "--crypto-mode" << appConfig().cryptoModeString(); args << "--crypto-pass" << appConfig().cryptoPass(); } if (desktopMode) { setSynergyProcess(new QProcess(this)); } else { // tell client/server to talk to daemon through ipc. args << "--ipc"; #if defined(Q_OS_WIN) // tell the client/server to shut down when a ms windows desk // is switched; this is because we may need to elevate or not // based on which desk the user is in (login always needs // elevation, where as default desk does not). args << "--stop-on-desk-switch"; #endif } if ((synergyType() == synergyClient && !clientArgs(args, app)) || (synergyType() == synergyServer && !serverArgs(args, app))) { if (desktopMode) { stopSynergy(); return; } } if (desktopMode) { connect(synergyProcess(), SIGNAL(finished(int, QProcess::ExitStatus)), this, SLOT(synergyFinished(int, QProcess::ExitStatus))); connect(synergyProcess(), SIGNAL(readyReadStandardOutput()), this, SLOT(logOutput())); connect(synergyProcess(), SIGNAL(readyReadStandardError()), this, SLOT(logError())); } // put a space between last log output and new instance. if (!m_pLogOutput->toPlainText().isEmpty()) appendLogRaw(""); appendLogNote("starting " + QString(synergyType() == synergyServer ? "server" : "client")); // show command if debug log level... if (appConfig().logLevel() >= 4) { appendLogNote(QString("command: %1 %2").arg(app, args.join(" "))); } appendLogNote("config file: " + configFilename()); appendLogNote("log level: " + appConfig().logLevelText()); if (appConfig().logToFile()) appendLogNote("log file: " + appConfig().logFilename()); if (desktopMode) { synergyProcess()->start(app, args); if (!synergyProcess()->waitForStarted()) { stopSynergy(); show(); QMessageBox::warning(this, tr("Program can not be started"), QString(tr("The executable

%1

could not be successfully started, although it does exist. Please check if you have sufficient permissions to run this program.").arg(app))); return; } } if (serviceMode) { QString command(app + " " + args.join(" ")); m_IpcClient.sendCommand(command, m_ElevateProcess); } } bool MainWindow::clientArgs(QStringList& args, QString& app) { app = appPath(appConfig().synergycName()); if (!QFile::exists(app)) { show(); QMessageBox::warning(this, tr("Synergy client not found"), tr("The executable for the synergy client does not exist.")); return false; } if (m_pLineEditHostname->text().isEmpty()) { show(); QMessageBox::warning(this, tr("Hostname is empty"), tr("Please fill in a hostname for the synergy client to connect to.")); return false; } if (appConfig().logToFile()) { appConfig().persistLogDir(); args << "--log" << appConfig().logFilename(); } args << m_pLineEditHostname->text() + ":" + QString::number(appConfig().port()); return true; } QString MainWindow::configFilename() { QString filename; if (m_pRadioInternalConfig->isChecked()) { // TODO: no need to use a temporary file, since we need it to // be permenant (since it'll be used for Windows services, etc). m_pTempConfigFile = new QTemporaryFile(); if (!m_pTempConfigFile->open()) { QMessageBox::critical(this, tr("Cannot write configuration file"), tr("The temporary configuration file required to start synergy can not be written.")); return false; } serverConfig().save(*m_pTempConfigFile); filename = m_pTempConfigFile->fileName(); m_pTempConfigFile->close(); } else { if (!QFile::exists(m_pLineEditConfigFile->text())) { if (QMessageBox::warning(this, tr("Configuration filename invalid"), tr("You have not filled in a valid configuration file for the synergy server. " "Do you want to browse for the configuration file now?"), QMessageBox::Yes | QMessageBox::No) != QMessageBox::Yes || !on_m_pButtonBrowseConfigFile_clicked()) return false; } filename = m_pLineEditConfigFile->text(); } return filename; } QString MainWindow::address() { return (!appConfig().interface().isEmpty() ? appConfig().interface() : "") + ":" + QString::number(appConfig().port()); } QString MainWindow::appPath(const QString& name) { return appConfig().synergyProgramDir() + name; } bool MainWindow::serverArgs(QStringList& args, QString& app) { app = appPath(appConfig().synergysName()); if (!QFile::exists(app)) { QMessageBox::warning(this, tr("Synergy server not found"), tr("The executable for the synergy server does not exist.")); return false; } if (appConfig().logToFile()) { appConfig().persistLogDir(); args << "--log" << appConfig().logFilename(); } args << "-c" << configFilename() << "--address" << address(); return true; } void MainWindow::stopSynergy() { if (appConfig().processMode() == Service) { stopService(); } else if (appConfig().processMode() == Desktop) { stopDesktop(); } setSynergyState(synergyDisconnected); // HACK: deleting the object deletes the physical file, which is // bad, since it could be in use by the Windows service! //delete m_pTempConfigFile; m_pTempConfigFile = NULL; // reset so that new connects cause auto-hide. m_alreadyHidden = false; } void MainWindow::stopService() { // send empty command to stop service from laucning anything. m_IpcClient.sendCommand("", m_ElevateProcess); } void MainWindow::stopDesktop() { if (!synergyProcess()) { return; } appendLogNote("stopping synergy desktop process"); if (synergyProcess()->isOpen()) synergyProcess()->close(); delete synergyProcess(); setSynergyProcess(NULL); } void MainWindow::synergyFinished(int exitCode, QProcess::ExitStatus) { // on Windows, we always seem to have an exit code != 0. #if !defined(Q_OS_WIN) if (exitCode != 0) { QMessageBox::critical(this, tr("Synergy terminated with an error"), QString(tr("Synergy terminated unexpectedly with an exit code of %1.

Please see the log output for details.")).arg(exitCode)); stopSynergy(); } #else Q_UNUSED(exitCode); #endif setSynergyState(synergyDisconnected); } void MainWindow::setSynergyState(qSynergyState state) { if (synergyState() == state) return; if (state == synergyConnected || state == synergyConnecting) { disconnect (m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStartSynergy, SLOT(trigger())); connect (m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStopSynergy, SLOT(trigger())); m_pButtonToggleStart->setText(tr("&Stop")); } else { disconnect (m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStopSynergy, SLOT(trigger())); connect (m_pButtonToggleStart, SIGNAL(clicked()), m_pActionStartSynergy, SLOT(trigger())); m_pButtonToggleStart->setText(tr("&Start")); } bool connected = state == synergyConnected; // only disable controls in desktop mode. in service mode, we can use the apply button. if (appConfig().processMode() == Desktop) { setFormEnabled(!connected); } m_pActionStartSynergy->setEnabled(!connected); m_pActionStopSynergy->setEnabled(connected); switch (state) { case synergyConnected: { QString mode(appConfig().processMode() == Service ? tr("service mode") : tr("desktop mode")); setStatus(tr("Synergy is running (%1).").arg(mode)); break; } case synergyConnecting: setStatus(tr("Synergy is starting.")); break; case synergyDisconnected: setStatus(tr("Synergy is not running.")); break; } setIcon(state); m_SynergyState = state; } void MainWindow::setFormEnabled(bool enabled) { m_pGroupClient->setEnabled(enabled); m_pGroupServer->setEnabled(enabled); } void MainWindow::setVisible(bool visible) { m_pActionMinimize->setEnabled(visible); m_pActionRestore->setEnabled(!visible); QMainWindow::setVisible(visible); #if MAC_OS_X_VERSION_10_7 // dock hide only supported on lion :( ProcessSerialNumber psn = { 0, kCurrentProcess }; GetCurrentProcess(&psn); if (visible) TransformProcessType(&psn, kProcessTransformToForegroundApplication); else TransformProcessType(&psn, kProcessTransformToBackgroundApplication); #endif } QString MainWindow::getIPAddresses() { QList addresses = QNetworkInterface::allAddresses(); bool hinted = false; QString result; for (int i = 0; i < addresses.size(); i++) { if (addresses[i].protocol() == QAbstractSocket::IPv4Protocol && addresses[i] != QHostAddress(QHostAddress::LocalHost)) { QString address = addresses[i].toString(); QString format = "%1, "; // usually 192.168.x.x is a useful ip for the user, so indicate // this by making it bold. if (!hinted && address.startsWith("192.168")) { hinted = true; format = "%1, "; } result += format.arg(address); } } if (result == "") { return tr("Unknown"); } // remove trailing comma. result.chop(2); return result; } QString MainWindow::getScreenName() { if (appConfig().screenName() == "") { return QHostInfo::localHostName(); } else { return appConfig().screenName(); } } bool MainWindow::on_m_pButtonBrowseConfigFile_clicked() { QString fileName = QFileDialog::getOpenFileName(this, tr("Browse for a synergys config file"), QString(), synergyConfigFilter); if (!fileName.isEmpty()) { m_pLineEditConfigFile->setText(fileName); return true; } return false; } bool MainWindow::on_m_pActionSave_triggered() { QString fileName = QFileDialog::getSaveFileName(this, tr("Save configuration as...")); if (!fileName.isEmpty() && !serverConfig().save(fileName)) { QMessageBox::warning(this, tr("Save failed"), tr("Could not save configuration to file.")); return true; } return false; } void MainWindow::on_m_pActionAbout_triggered() { AboutDialog dlg(this, appPath(appConfig().synergycName())); dlg.exec(); } void MainWindow::on_m_pActionSettings_triggered() { ProcessMode lastProcessMode = appConfig().processMode(); SettingsDialog dlg(this, appConfig()); dlg.exec(); if (lastProcessMode != appConfig().processMode()) { onModeChanged(true, true); } } void MainWindow::on_m_pButtonConfigureServer_clicked() { ServerConfigDialog dlg(this, serverConfig(), appConfig().screenName()); dlg.exec(); } void MainWindow::on_m_pActionWizard_triggered() { m_SetupWizard->show(); } void MainWindow::on_m_pElevateCheckBox_toggled(bool checked) { if (checked && !m_SuppressElevateWarning) { int r = QMessageBox::warning( this, tr("Elevate Synergy"), tr("Are you sure you want to elevate Synergy?\n\n" "This allows Synergy to interact with elevated processes " "and the UAC dialog, but can cause problems with non-elevated " "processes. Elevate Synergy only if you really need to."), QMessageBox::Yes | QMessageBox::No); if (r != QMessageBox::Yes) { m_pElevateCheckBox->setChecked(false); return; } } m_ElevateProcess = checked; settings().setValue("elevateChecked", checked); settings().sync(); } void MainWindow::on_m_pButtonApply_clicked() { startSynergy(); } synergy-1.4.12-Source/src/gui/src/MainWindow.h0000600000175000017500000001070312021261364021074 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(MAINWINDOW__H) #define MAINWINDOW__H #include #include #include #include #include #include "ui_MainWindowBase.h" #include "ServerConfig.h" #include "AppConfig.h" #include "VersionChecker.h" #include "IpcClient.h" #include "Ipc.h" class QAction; class QMenu; class QLineEdit; class QGroupBox; class QPushButton; class QTextEdit; class QComboBox; class QTabWidget; class QCheckBox; class QRadioButton; class QTemporaryFile; class LogDialog; class QSynergyApplication; class SetupWizard; class MainWindow : public QMainWindow, public Ui::MainWindowBase { Q_OBJECT friend class QSynergyApplication; friend class SetupWizard; public: enum qSynergyState { synergyDisconnected, synergyConnecting, synergyConnected }; enum qSynergyType { synergyClient, synergyServer }; enum qLevel { Error, Info }; public: MainWindow(QSettings& settings, AppConfig& appConfig); ~MainWindow(); public: void setVisible(bool visible); int synergyType() const { return m_pGroupClient->isChecked() ? synergyClient : synergyServer; } int synergyState() const { return m_SynergyState; } QString hostname() const { return m_pLineEditHostname->text(); } QString configFilename(); QString address(); QString appPath(const QString& name); void start(bool firstRun); void clearLog(); public slots: void appendLogRaw(const QString& text); void appendLogNote(const QString& text); void appendLogError(const QString& text); protected slots: void on_m_pGroupClient_toggled(bool on) { m_pGroupServer->setChecked(!on); } void on_m_pGroupServer_toggled(bool on) { m_pGroupClient->setChecked(!on); } bool on_m_pButtonBrowseConfigFile_clicked(); void on_m_pButtonConfigureServer_clicked(); bool on_m_pActionSave_triggered(); void on_m_pActionAbout_triggered(); void on_m_pActionSettings_triggered(); void on_m_pActionWizard_triggered(); void on_m_pElevateCheckBox_toggled(bool checked); void synergyFinished(int exitCode, QProcess::ExitStatus); void trayActivated(QSystemTrayIcon::ActivationReason reason); void startSynergy(); void stopSynergy(); void logOutput(); void logError(); void updateFound(const QString& version); void refreshApplyButton(); protected: QSettings& settings() { return m_Settings; } AppConfig& appConfig() { return m_AppConfig; } QProcess*& synergyProcess() { return m_pSynergy; } void setSynergyProcess(QProcess* p) { m_pSynergy = p; } ServerConfig& serverConfig() { return m_ServerConfig; } void initConnections(); void createMenuBar(); void createStatusBar(); void createTrayIcon(); void loadSettings(); void saveSettings(); void setIcon(qSynergyState state); void setSynergyState(qSynergyState state); bool checkForApp(int which, QString& app); bool clientArgs(QStringList& args, QString& app); bool serverArgs(QStringList& args, QString& app); void setStatus(const QString& status); void sendIpcMessage(qIpcMessageType type, const char* buffer, bool showErrors); void onModeChanged(bool startDesktop, bool applyService); void updateStateFromLogLine(const QString& line); QString getIPAddresses(); QString getScreenName(); void stopService(); void stopDesktop(); void setFormEnabled(bool enabled); private: QSettings& m_Settings; AppConfig& m_AppConfig; QProcess* m_pSynergy; int m_SynergyState; ServerConfig m_ServerConfig; QTemporaryFile* m_pTempConfigFile; QSystemTrayIcon* m_pTrayIcon; QMenu* m_pTrayIconMenu; bool m_alreadyHidden; VersionChecker m_versionChecker; SetupWizard* m_SetupWizard; IpcClient m_IpcClient; bool m_ElevateProcess; bool m_SuppressElevateWarning; private slots: void on_m_pButtonApply_clicked(); }; #endif synergy-1.4.12-Source/src/gui/src/NewScreenWidget.cpp0000600000175000017500000000257712021261364022422 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "NewScreenWidget.h" #include "ScreenSetupModel.h" #include #include NewScreenWidget::NewScreenWidget(QWidget* parent) : QLabel(parent) { } void NewScreenWidget::mousePressEvent(QMouseEvent* event) { Screen newScreen(tr("Unnamed")); QByteArray itemData; QDataStream dataStream(&itemData, QIODevice::WriteOnly); dataStream << -1 << -1 << newScreen; QMimeData* pMimeData = new QMimeData; pMimeData->setData(ScreenSetupModel::mimeType(), itemData); QDrag* pDrag = new QDrag(this); pDrag->setMimeData(pMimeData); pDrag->setPixmap(*pixmap()); pDrag->setHotSpot(event->pos()); pDrag->exec(Qt::CopyAction, Qt::CopyAction); } synergy-1.4.12-Source/src/gui/src/NewScreenWidget.h0000600000175000017500000000200112021261364022045 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(NEWSCREENWIDGET__H) #define NEWSCREENWIDGET__H #include class QMouseEvent; class QWidget; class NewScreenWidget : public QLabel { Q_OBJECT public: NewScreenWidget(QWidget* parent); protected: void mousePressEvent(QMouseEvent* event); }; #endif synergy-1.4.12-Source/src/gui/src/QSynergyApplication.cpp0000600000175000017500000000220612021261364023317 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "QSynergyApplication.h" #include "MainWindow.h" #include #include QSynergyApplication::QSynergyApplication(int& argc, char** argv) : QApplication(argc, argv) { } void QSynergyApplication::commitData(QSessionManager&) { foreach(QWidget* widget, topLevelWidgets()) { MainWindow* mainWindow = qobject_cast(widget); if (mainWindow) mainWindow->saveSettings(); } } synergy-1.4.12-Source/src/gui/src/QSynergyApplication.h0000600000175000017500000000201412021261364022761 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(QSYNERGYAPPLICATION__H) #define QSYNERGYAPPLICATION__H #include class QSessionManager; class QSynergyApplication : public QApplication { public: QSynergyApplication(int& argc, char** argv); public: void commitData(QSessionManager& manager); }; #endif synergy-1.4.12-Source/src/gui/src/Screen.cpp0000600000175000017500000000746012021261364020600 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "Screen.h" #include #include Screen::Screen() : m_Pixmap(QPixmap(":res/icons/64x64/video-display.png")), m_Swapped(false) { init(); } Screen::Screen(const QString& name) : m_Pixmap(QPixmap(":res/icons/64x64/video-display.png")), m_Swapped(false) { init(); setName(name); } void Screen::init() { name().clear(); aliases().clear(); modifiers().clear(); switchCorners().clear(); fixes().clear(); setSwitchCornerSize(0); // m_Modifiers, m_SwitchCorners and m_Fixes are QLists we use like fixed-size arrays, // thus we need to make sure to fill them with the required number of elements. for (int i = 0; i < NumModifiers; i++) modifiers() << i; for (int i = 0; i < NumSwitchCorners; i++) switchCorners() << false; for (int i = 0; i < NumFixes; i++) fixes() << false; } void Screen::loadSettings(QSettings& settings) { setName(settings.value("name").toString()); if (name().isEmpty()) return; setSwitchCornerSize(settings.value("switchCornerSize").toInt()); readSettings(settings, aliases(), "alias", QString("")); readSettings(settings, modifiers(), "modifier", static_cast(DefaultMod), NumModifiers); readSettings(settings, switchCorners(), "switchCorner", false, NumSwitchCorners); readSettings(settings, fixes(), "fix", false, NumFixes); } void Screen::saveSettings(QSettings& settings) const { settings.setValue("name", name()); if (name().isEmpty()) return; settings.setValue("switchCornerSize", switchCornerSize()); writeSettings(settings, aliases(), "alias"); writeSettings(settings, modifiers(), "modifier"); writeSettings(settings, switchCorners(), "switchCorner"); writeSettings(settings, fixes(), "fix"); } QTextStream& Screen::writeScreensSection(QTextStream& outStream) const { outStream << "\t" << name() << ":" << endl; for (int i = 0; i < modifiers().size(); i++) if (modifier(i) != i) outStream << "\t\t" << modifierName(i) << " = " << modifierName(modifier(i)) << endl; for (int i = 0; i < fixes().size(); i++) outStream << "\t\t" << fixName(i) << " = " << (fixes()[i] ? "true" : "false") << endl; outStream << "\t\t" << "switchCorners = none "; for (int i = 0; i < switchCorners().size(); i++) if (switchCorners()[i]) outStream << "+" << switchCornerName(i) << " "; outStream << endl; outStream << "\t\t" << "switchCornerSize = " << switchCornerSize() << endl; return outStream; } QTextStream& Screen::writeAliasesSection(QTextStream& outStream) const { if (!aliases().isEmpty()) { outStream << "\t" << name() << ":" << endl; foreach (const QString& alias, aliases()) outStream << "\t\t" << alias << endl; } return outStream; } QDataStream& operator<<(QDataStream& outStream, const Screen& screen) { return outStream << screen.name() << screen.switchCornerSize() << screen.aliases() << screen.modifiers() << screen.switchCorners() << screen.fixes() ; } QDataStream& operator>>(QDataStream& inStream, Screen& screen) { return inStream >> screen.m_Name >> screen.m_SwitchCornerSize >> screen.m_Aliases >> screen.m_Modifiers >> screen.m_SwitchCorners >> screen.m_Fixes ; } synergy-1.4.12-Source/src/gui/src/Screen.h0000600000175000017500000000651412021261364020244 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SCREEN__H) #define SCREEN__H #include #include #include #include #include "BaseConfig.h" class QSettings; class QTextStream; class ScreenSettingsDialog; class Screen : public BaseConfig { friend QDataStream& operator<<(QDataStream& outStream, const Screen& screen); friend QDataStream& operator>>(QDataStream& inStream, Screen& screen); friend class ScreenSettingsDialog; friend class ScreenSetupModel; friend class ScreenSetupView; public: Screen(); Screen(const QString& name); public: const QPixmap* pixmap() const { return &m_Pixmap; } const QString& name() const { return m_Name; } const QStringList& aliases() const { return m_Aliases; } bool isNull() const { return m_Name.isEmpty(); } int modifier(int m) const { return m_Modifiers[m] == DefaultMod ? m : m_Modifiers[m]; } const QList& modifiers() const { return m_Modifiers; } bool switchCorner(int c) const { return m_SwitchCorners[c]; } const QList& switchCorners() const { return m_SwitchCorners; } int switchCornerSize() const { return m_SwitchCornerSize; } bool fix(Fix f) const { return m_Fixes[f]; } const QList& fixes() const { return m_Fixes; } void loadSettings(QSettings& settings); void saveSettings(QSettings& settings) const; QTextStream& writeScreensSection(QTextStream& outStream) const; QTextStream& writeAliasesSection(QTextStream& outStream) const; bool swapped() const { return m_Swapped; } protected: void init(); void setName(const QString& name) { m_Name = name; } QPixmap* pixmap() { return &m_Pixmap; } QString& name() { return m_Name; } void setPixmap(const QPixmap& pixmap) { m_Pixmap = pixmap; } QStringList& aliases() { return m_Aliases; } void setModifier(int m, int n) { m_Modifiers[m] = n; } QList& modifiers() { return m_Modifiers; } void addAlias(const QString& alias) { m_Aliases.append(alias); } void setSwitchCorner(int c, bool on) { m_SwitchCorners[c] = on; } QList& switchCorners() { return m_SwitchCorners; } void setSwitchCornerSize(int val) { m_SwitchCornerSize = val; } void setFix(int f, bool on) { m_Fixes[f] = on; } QList& fixes() { return m_Fixes; } void setSwapped(bool on) { m_Swapped = on; } private: QPixmap m_Pixmap; QString m_Name; QStringList m_Aliases; QList m_Modifiers; QList m_SwitchCorners; int m_SwitchCornerSize; QList m_Fixes; bool m_Swapped; }; typedef QList ScreenList; QDataStream& operator<<(QDataStream& outStream, const Screen& screen); QDataStream& operator>>(QDataStream& inStream, Screen& screen); #endif synergy-1.4.12-Source/src/gui/src/ScreenSettingsDialog.cpp0000600000175000017500000001133512021261364023435 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ScreenSettingsDialog.h" #include "Screen.h" #include #include ScreenSettingsDialog::ScreenSettingsDialog(QWidget* parent, Screen* pScreen) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::ScreenSettingsDialogBase(), m_pScreen(pScreen) { setupUi(this); QRegExp validScreenName("[a-z_][a-z0-9\\._-]{,31}", Qt::CaseInsensitive); m_pLineEditName->setText(m_pScreen->name()); m_pLineEditName->setValidator(new QRegExpValidator(validScreenName, m_pLineEditName)); m_pLineEditName->selectAll(); m_pLineEditAlias->setValidator(new QRegExpValidator(validScreenName, m_pLineEditName)); for (int i = 0; i < m_pScreen->aliases().count(); i++) new QListWidgetItem(m_pScreen->aliases()[i], m_pListAliases); m_pComboBoxShift->setCurrentIndex(m_pScreen->modifier(Screen::Shift)); m_pComboBoxCtrl->setCurrentIndex(m_pScreen->modifier(Screen::Ctrl)); m_pComboBoxAlt->setCurrentIndex(m_pScreen->modifier(Screen::Alt)); m_pComboBoxMeta->setCurrentIndex(m_pScreen->modifier(Screen::Meta)); m_pComboBoxSuper->setCurrentIndex(m_pScreen->modifier(Screen::Super)); m_pCheckBoxCornerTopLeft->setChecked(m_pScreen->switchCorner(Screen::TopLeft)); m_pCheckBoxCornerTopRight->setChecked(m_pScreen->switchCorner(Screen::TopRight)); m_pCheckBoxCornerBottomLeft->setChecked(m_pScreen->switchCorner(Screen::BottomLeft)); m_pCheckBoxCornerBottomRight->setChecked(m_pScreen->switchCorner(Screen::BottomRight)); m_pSpinBoxSwitchCornerSize->setValue(m_pScreen->switchCornerSize()); m_pCheckBoxCapsLock->setChecked(m_pScreen->fix(Screen::CapsLock)); m_pCheckBoxNumLock->setChecked(m_pScreen->fix(Screen::NumLock)); m_pCheckBoxScrollLock->setChecked(m_pScreen->fix(Screen::ScrollLock)); m_pCheckBoxXTest->setChecked(m_pScreen->fix(Screen::XTest)); } void ScreenSettingsDialog::accept() { if (m_pLineEditName->text().isEmpty()) { QMessageBox::warning(this, tr("Screen name is empty"), tr("The name for a screen can not be empty. Please fill in a name or cancel the dialog.")); return; } m_pScreen->init(); m_pScreen->setName(m_pLineEditName->text()); for (int i = 0; i < m_pListAliases->count(); i++) m_pScreen->addAlias(m_pListAliases->item(i)->text()); m_pScreen->setModifier(Screen::Shift, m_pComboBoxShift->currentIndex()); m_pScreen->setModifier(Screen::Ctrl, m_pComboBoxCtrl->currentIndex()); m_pScreen->setModifier(Screen::Alt, m_pComboBoxAlt->currentIndex()); m_pScreen->setModifier(Screen::Meta, m_pComboBoxMeta->currentIndex()); m_pScreen->setModifier(Screen::Super, m_pComboBoxSuper->currentIndex()); m_pScreen->setSwitchCorner(Screen::TopLeft, m_pCheckBoxCornerTopLeft->isChecked()); m_pScreen->setSwitchCorner(Screen::TopRight, m_pCheckBoxCornerTopRight->isChecked()); m_pScreen->setSwitchCorner(Screen::BottomLeft, m_pCheckBoxCornerBottomLeft->isChecked()); m_pScreen->setSwitchCorner(Screen::BottomRight, m_pCheckBoxCornerBottomRight->isChecked()); m_pScreen->setSwitchCornerSize(m_pSpinBoxSwitchCornerSize->value()); m_pScreen->setFix(Screen::CapsLock, m_pCheckBoxCapsLock->isChecked()); m_pScreen->setFix(Screen::NumLock, m_pCheckBoxNumLock->isChecked()); m_pScreen->setFix(Screen::ScrollLock, m_pCheckBoxScrollLock->isChecked()); m_pScreen->setFix(Screen::XTest, m_pCheckBoxXTest->isChecked()); QDialog::accept(); } void ScreenSettingsDialog::on_m_pButtonAddAlias_clicked() { if (!m_pLineEditAlias->text().isEmpty() && m_pListAliases->findItems(m_pLineEditAlias->text(), Qt::MatchFixedString).isEmpty()) { new QListWidgetItem(m_pLineEditAlias->text(), m_pListAliases); m_pLineEditAlias->clear(); } } void ScreenSettingsDialog::on_m_pLineEditAlias_textChanged(const QString& text) { m_pButtonAddAlias->setEnabled(!text.isEmpty()); } void ScreenSettingsDialog::on_m_pButtonRemoveAlias_clicked() { QList items = m_pListAliases->selectedItems(); for (int i = 0; i < items.count(); i++) delete items[i]; } void ScreenSettingsDialog::on_m_pListAliases_itemSelectionChanged() { m_pButtonRemoveAlias->setEnabled(!m_pListAliases->selectedItems().isEmpty()); } synergy-1.4.12-Source/src/gui/src/ScreenSettingsDialog.h0000600000175000017500000000254112021261364023101 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SCREENSETTINGSDIALOG__H) #define SCREENSETTINGSDIALOG__H #include #include "ui_ScreenSettingsDialogBase.h" class QWidget; class QString; class Screen; class ScreenSettingsDialog : public QDialog, public Ui::ScreenSettingsDialogBase { Q_OBJECT public: ScreenSettingsDialog(QWidget* parent, Screen* pScreen = NULL); public slots: void accept(); private slots: void on_m_pButtonAddAlias_clicked(); void on_m_pButtonRemoveAlias_clicked(); void on_m_pLineEditAlias_textChanged(const QString& text); void on_m_pListAliases_itemSelectionChanged(); private: Screen* m_pScreen; }; #endif synergy-1.4.12-Source/src/gui/src/ScreenSetupModel.cpp0000600000175000017500000000757312021261364022607 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ScreenSetupModel.h" #include "Screen.h" #include #include const QString ScreenSetupModel::m_MimeType = "application/x-qsynergy-screen"; ScreenSetupModel::ScreenSetupModel(ScreenList& screens, int numColumns, int numRows) : QAbstractTableModel(NULL), m_Screens(screens), m_NumColumns(numColumns), m_NumRows(numRows) { if (m_NumColumns * m_NumRows > screens.size()) qFatal("Not enough elements (%u) in screens QList for %d columns and %d rows", screens.size(), m_NumColumns, m_NumRows); } QVariant ScreenSetupModel::data(const QModelIndex& index, int role) const { if (index.isValid() && index.row() < m_NumRows && index.column() < m_NumColumns) { switch(role) { case Qt::DecorationRole: if (screen(index).isNull()) break; return QIcon(*screen(index).pixmap()); case Qt::ToolTipRole: if (screen(index).isNull()) break; return QString(tr( "
Screen: %1
" "
Double click to edit settings" "
Drag screen to the trashcan to remove it")).arg(screen(index).name()); case Qt::DisplayRole: if (screen(index).isNull()) break; return screen(index).name(); } } return QVariant(); } Qt::ItemFlags ScreenSetupModel::flags(const QModelIndex& index) const { if (!index.isValid() || index.row() >= m_NumRows || index.column() >= m_NumColumns) return 0; if (!screen(index).isNull()) return Qt::ItemIsEnabled | Qt::ItemIsDragEnabled | Qt::ItemIsSelectable | Qt::ItemIsDropEnabled; return Qt::ItemIsDropEnabled; } Qt::DropActions ScreenSetupModel::supportedDropActions() const { return Qt::MoveAction | Qt::CopyAction; } QStringList ScreenSetupModel::mimeTypes() const { return QStringList() << m_MimeType; } QMimeData* ScreenSetupModel::mimeData(const QModelIndexList& indexes) const { QMimeData* pMimeData = new QMimeData(); QByteArray encodedData; QDataStream stream(&encodedData, QIODevice::WriteOnly); foreach (const QModelIndex& index, indexes) if (index.isValid()) stream << index.column() << index.row() << screen(index); pMimeData->setData(m_MimeType, encodedData); return pMimeData; } bool ScreenSetupModel::dropMimeData(const QMimeData* data, Qt::DropAction action, int row, int column, const QModelIndex& parent) { if (action == Qt::IgnoreAction) return true; if (!data->hasFormat(m_MimeType)) return false; if (!parent.isValid() || row != -1 || column != -1) return false; QByteArray encodedData = data->data(m_MimeType); QDataStream stream(&encodedData, QIODevice::ReadOnly); int sourceColumn = -1; int sourceRow = -1; stream >> sourceColumn; stream >> sourceRow; // don't drop screen onto itself if (sourceColumn == parent.column() && sourceRow == parent.row()) return false; Screen droppedScreen; stream >> droppedScreen; Screen oldScreen = screen(parent.column(), parent.row()); if (!oldScreen.isNull() && sourceColumn != -1 && sourceRow != -1) { // mark the screen so it isn't deleted after the dragndrop succeeded // see ScreenSetupView::startDrag() oldScreen.setSwapped(true); screen(sourceColumn, sourceRow) = oldScreen; } screen(parent.column(), parent.row()) = droppedScreen; return true; } synergy-1.4.12-Source/src/gui/src/ScreenSetupModel.h0000600000175000017500000000453512021261364022247 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SCREENSETUPMODEL__H) #define SCREENSETUPMODEL__H #include #include #include #include #include "Screen.h" class ScreenSetupView; class ServerConfigDialog; class ScreenSetupModel : public QAbstractTableModel { Q_OBJECT friend class ScreenSetupView; friend class ServerConfigDialog; public: ScreenSetupModel(ScreenList& screens, int numColumns, int numRows); public: static const QString& mimeType() { return m_MimeType; } QVariant data(const QModelIndex& index, int role = Qt::DisplayRole) const; int rowCount() const { return m_NumRows; } int columnCount() const { return m_NumColumns; } int rowCount(const QModelIndex&) const { return rowCount(); } int columnCount(const QModelIndex&) const { return columnCount(); } Qt::DropActions supportedDropActions() const; Qt::ItemFlags flags(const QModelIndex& index) const; QStringList mimeTypes() const; QMimeData* mimeData(const QModelIndexList& indexes) const; protected: bool dropMimeData(const QMimeData* data, Qt::DropAction action, int row, int column, const QModelIndex& parent); const Screen& screen(const QModelIndex& index) const { return screen(index.column(), index.row()); } Screen& screen(const QModelIndex& index) { return screen(index.column(), index.row()); } const Screen& screen(int column, int row) const { return m_Screens[row * m_NumColumns + column]; } Screen& screen(int column, int row) { return m_Screens[row * m_NumColumns + column]; } private: ScreenList& m_Screens; const int m_NumColumns; const int m_NumRows; static const QString m_MimeType; }; #endif synergy-1.4.12-Source/src/gui/src/ScreenSetupView.cpp0000600000175000017500000001031612021261364022446 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ScreenSetupView.h" #include "ScreenSetupModel.h" #include "ScreenSettingsDialog.h" #include #include ScreenSetupView::ScreenSetupView(QWidget* parent) : QTableView(parent) { setDropIndicatorShown(true); setDragDropMode(DragDrop); setSelectionMode(SingleSelection); setHorizontalScrollBarPolicy(Qt::ScrollBarAlwaysOff); setVerticalScrollBarPolicy(Qt::ScrollBarAlwaysOff); setIconSize(QSize(64, 64)); horizontalHeader()->hide(); verticalHeader()->hide(); } void ScreenSetupView::setModel(ScreenSetupModel* model) { QTableView::setModel(model); setTableSize(); } ScreenSetupModel* ScreenSetupView::model() const { return qobject_cast(QTableView::model()); } void ScreenSetupView::setTableSize() { for (int i = 0; i < model()->columnCount(); i++) setColumnWidth(i, width() / model()->columnCount()); for (int i = 0; i < model()->rowCount(); i++) setRowHeight(i, height() / model()->rowCount()); } void ScreenSetupView::resizeEvent(QResizeEvent* event) { setTableSize(); event->ignore(); } void ScreenSetupView::mouseDoubleClickEvent(QMouseEvent* event) { if (event->buttons() & Qt::LeftButton) { int col = columnAt(event->pos().x()); int row = rowAt(event->pos().y()); if (!model()->screen(col, row).isNull()) { ScreenSettingsDialog dlg(this, &model()->screen(col, row)); dlg.exec(); } } else event->ignore(); } void ScreenSetupView::dragEnterEvent(QDragEnterEvent* event) { // we accept anything that enters us by a drag as long as the // mime type is okay. anything else is dealt with in dragMoveEvent() if (event->mimeData()->hasFormat(ScreenSetupModel::mimeType())) event->accept(); else event->ignore(); } void ScreenSetupView::dragMoveEvent(QDragMoveEvent* event) { if (event->mimeData()->hasFormat(ScreenSetupModel::mimeType())) { // where does the event come from? myself or someone else? if (event->source() == this) { // myself is ok, but then it must be a move action, never a copy event->setDropAction(Qt::MoveAction); event->accept(); } else { int col = columnAt(event->pos().x()); int row = rowAt(event->pos().y()); // a drop from outside is not allowed if there's a screen already there. if (!model()->screen(col, row).isNull()) event->ignore(); else event->acceptProposedAction(); } } else event->ignore(); } // this is reimplemented from QAbstractItemView::startDrag() void ScreenSetupView::startDrag(Qt::DropActions) { QModelIndexList indexes = selectedIndexes(); if (indexes.count() != 1) return; QMimeData* pData = model()->mimeData(indexes); if (pData == NULL) return; QPixmap pixmap = *model()->screen(indexes[0]).pixmap(); QDrag* pDrag = new QDrag(this); pDrag->setPixmap(pixmap); pDrag->setMimeData(pData); pDrag->setHotSpot(QPoint(pixmap.width() / 2, pixmap.height() / 2)); if (pDrag->exec(Qt::MoveAction, Qt::MoveAction) == Qt::MoveAction) { selectionModel()->clear(); // make sure to only delete the drag source if screens weren't swapped // see ScreenSetupModel::dropMimeData if (!model()->screen(indexes[0]).swapped()) model()->screen(indexes[0]) = Screen(); else model()->screen(indexes[0]).setSwapped(false); } } QStyleOptionViewItem ScreenSetupView::viewOptions() const { QStyleOptionViewItem option = QTableView::viewOptions(); option.showDecorationSelected = true; option.decorationPosition = QStyleOptionViewItem::Top; option.displayAlignment = Qt::AlignCenter; option.textElideMode = Qt::ElideMiddle; return option; } synergy-1.4.12-Source/src/gui/src/ScreenSetupView.h0000600000175000017500000000276312021261364022122 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SCREENSETUPVIEW__H) #define SCREENSETUPVIEW__H #include #include #include "Screen.h" class QWidget; class QMouseEvent; class QResizeEvent; class QDragEnterEvent; class ScreenSetupModel; class ScreenSetupView : public QTableView { Q_OBJECT public: ScreenSetupView(QWidget* parent); public: void setModel(ScreenSetupModel* model); ScreenSetupModel* model() const; protected: void mouseDoubleClickEvent(QMouseEvent*); void setTableSize(); void resizeEvent(QResizeEvent*); void dragEnterEvent(QDragEnterEvent* event); void dragMoveEvent(QDragMoveEvent* event); void startDrag(Qt::DropActions supportedActions); QStyleOptionViewItem viewOptions() const; void scrollTo(const QModelIndex&, ScrollHint) {} }; #endif synergy-1.4.12-Source/src/gui/src/ServerConfig.cpp0000600000175000017500000001662612021261364021761 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ServerConfig.h" #include "Hotkey.h" #include static const struct { int x; int y; const char* name; } neighbourDirs[] = { { 0, -1, "up" }, { 1, 0, "right" }, { 0, 1, "down" }, { -1, 0, "left" }, }; ServerConfig::ServerConfig(QSettings* settings, int numColumns, int numRows) : m_pSettings(settings), m_Screens(), m_NumColumns(numColumns), m_NumRows(numRows) { Q_ASSERT(m_pSettings); loadSettings(); } ServerConfig::~ServerConfig() { saveSettings(); } bool ServerConfig::save(const QString& fileName) const { QFile file(fileName); if (!file.open(QIODevice::WriteOnly | QIODevice::Text)) return false; save(file); file.close(); return true; } void ServerConfig::save(QFile& file) const { QTextStream outStream(&file); outStream << *this; } void ServerConfig::init() { switchCorners().clear(); screens().clear(); // m_NumSwitchCorners is used as a fixed size array. See Screen::init() for (int i = 0; i < NumSwitchCorners; i++) switchCorners() << false; // There must always be screen objects for each cell in the screens QList. Unused screens // are identified by having an empty name. for (int i = 0; i < numColumns() * numRows(); i++) addScreen(Screen()); } void ServerConfig::saveSettings() { settings().beginGroup("internalConfig"); settings().remove(""); settings().setValue("numColumns", numColumns()); settings().setValue("numRows", numRows()); settings().setValue("hasHeartbeat", hasHeartbeat()); settings().setValue("heartbeat", heartbeat()); settings().setValue("relativeMouseMoves", relativeMouseMoves()); settings().setValue("screenSaverSync", screenSaverSync()); settings().setValue("win32KeepForeground", win32KeepForeground()); settings().setValue("hasSwitchDelay", hasSwitchDelay()); settings().setValue("switchDelay", switchDelay()); settings().setValue("hasSwitchDoubleTap", hasSwitchDoubleTap()); settings().setValue("switchDoubleTap", switchDoubleTap()); settings().setValue("switchCornerSize", switchCornerSize()); writeSettings(settings(), switchCorners(), "switchCorner"); settings().beginWriteArray("screens"); for (int i = 0; i < screens().size(); i++) { settings().setArrayIndex(i); screens()[i].saveSettings(settings()); } settings().endArray(); settings().beginWriteArray("hotkeys"); for (int i = 0; i < hotkeys().size(); i++) { settings().setArrayIndex(i); hotkeys()[i].saveSettings(settings()); } settings().endArray(); settings().endGroup(); } void ServerConfig::loadSettings() { settings().beginGroup("internalConfig"); setNumColumns(settings().value("numColumns", 5).toInt()); setNumRows(settings().value("numRows", 3).toInt()); // we need to know the number of columns and rows before we can set up ourselves init(); haveHeartbeat(settings().value("hasHeartbeat", false).toBool()); setHeartbeat(settings().value("heartbeat", 5000).toInt()); setRelativeMouseMoves(settings().value("relativeMouseMoves", false).toBool()); setScreenSaverSync(settings().value("screenSaverSync", true).toBool()); setWin32KeepForeground(settings().value("win32KeepForeground", false).toBool()); haveSwitchDelay(settings().value("hasSwitchDelay", false).toBool()); setSwitchDelay(settings().value("switchDelay", 250).toInt()); haveSwitchDoubleTap(settings().value("hasSwitchDoubleTap", false).toBool()); setSwitchDoubleTap(settings().value("switchDoubleTap", 250).toInt()); setSwitchCornerSize(settings().value("switchCornerSize").toInt()); readSettings(settings(), switchCorners(), "switchCorner", false, NumSwitchCorners); int numScreens = settings().beginReadArray("screens"); Q_ASSERT(numScreens <= screens().size()); for (int i = 0; i < numScreens; i++) { settings().setArrayIndex(i); screens()[i].loadSettings(settings()); } settings().endArray(); int numHotkeys = settings().beginReadArray("hotkeys"); for (int i = 0; i < numHotkeys; i++) { settings().setArrayIndex(i); Hotkey h; h.loadSettings(settings()); hotkeys().append(h); } settings().endArray(); settings().endGroup(); } int ServerConfig::adjacentScreenIndex(int idx, int deltaColumn, int deltaRow) const { if (screens()[idx].isNull()) return -1; // if we're at the left or right end of the table, don't find results going further left or right if ((deltaColumn > 0 && (idx+1) % numColumns() == 0) || (deltaColumn < 0 && idx % numColumns() == 0)) return -1; int arrayPos = idx + deltaColumn + deltaRow * numColumns(); if (arrayPos >= screens().size() || arrayPos < 0) return -1; return arrayPos; } QTextStream& operator<<(QTextStream& outStream, const ServerConfig& config) { outStream << "section: screens" << endl; foreach (const Screen& s, config.screens()) if (!s.isNull()) s.writeScreensSection(outStream); outStream << "end" << endl << endl; outStream << "section: aliases" << endl; foreach (const Screen& s, config.screens()) if (!s.isNull()) s.writeAliasesSection(outStream); outStream << "end" << endl << endl; outStream << "section: links" << endl; for (int i = 0; i < config.screens().size(); i++) if (!config.screens()[i].isNull()) { outStream << "\t" << config.screens()[i].name() << ":" << endl; for (unsigned int j = 0; j < sizeof(neighbourDirs) / sizeof(neighbourDirs[0]); j++) { int idx = config.adjacentScreenIndex(i, neighbourDirs[j].x, neighbourDirs[j].y); if (idx != -1 && !config.screens()[idx].isNull()) outStream << "\t\t" << neighbourDirs[j].name << " = " << config.screens()[idx].name() << endl; } } outStream << "end" << endl << endl; outStream << "section: options" << endl; if (config.hasHeartbeat()) outStream << "\t" << "heartbeat = " << config.heartbeat() << endl; outStream << "\t" << "relativeMouseMoves = " << (config.relativeMouseMoves() ? "true" : "false") << endl; outStream << "\t" << "screenSaverSync = " << (config.screenSaverSync() ? "true" : "false") << endl; outStream << "\t" << "win32KeepForeground = " << (config.win32KeepForeground() ? "true" : "false") << endl; if (config.hasSwitchDelay()) outStream << "\t" << "switchDelay = " << config.switchDelay() << endl; if (config.hasSwitchDoubleTap()) outStream << "\t" << "switchDoubleTap = " << config.switchDoubleTap() << endl; outStream << "\t" << "switchCorners = none "; for (int i = 0; i < config.switchCorners().size(); i++) if (config.switchCorners()[i]) outStream << "+" << config.switchCornerName(i) << " "; outStream << endl; outStream << "\t" << "switchCornerSize = " << config.switchCornerSize() << endl; foreach(const Hotkey& hotkey, config.hotkeys()) outStream << hotkey; outStream << "end" << endl << endl; return outStream; } int ServerConfig::numScreens() const { int rval = 0; foreach(const Screen& s, screens()) if (!s.isNull()) rval++; return rval; } synergy-1.4.12-Source/src/gui/src/ServerConfig.h0000600000175000017500000000772612021261364021427 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SERVERCONFIG__H) #define SERVERCONFIG__H #include #include "Screen.h" #include "BaseConfig.h" #include "Hotkey.h" class QTextStream; class QSettings; class QString; class QFile; class ServerConfigDialog; class ServerConfig : public BaseConfig { friend class ServerConfigDialog; friend QTextStream& operator<<(QTextStream& outStream, const ServerConfig& config); public: ServerConfig(QSettings* settings, int numColumns, int numRows); ~ServerConfig(); public: const ScreenList& screens() const { return m_Screens; } int numColumns() const { return m_NumColumns; } int numRows() const { return m_NumRows; } bool hasHeartbeat() const { return m_HasHeartbeat; } int heartbeat() const { return m_Heartbeat; } bool relativeMouseMoves() const { return m_RelativeMouseMoves; } bool screenSaverSync() const { return m_ScreenSaverSync; } bool win32KeepForeground() const { return m_Win32KeepForeground; } bool hasSwitchDelay() const { return m_HasSwitchDelay; } int switchDelay() const { return m_SwitchDelay; } bool hasSwitchDoubleTap() const { return m_HasSwitchDoubleTap; } int switchDoubleTap() const { return m_SwitchDoubleTap; } bool switchCorner(int c) const { return m_SwitchCorners[c]; } int switchCornerSize() const { return m_SwitchCornerSize; } const QList& switchCorners() const { return m_SwitchCorners; } const HotkeyList& hotkeys() const { return m_Hotkeys; } void saveSettings(); void loadSettings(); bool save(const QString& fileName) const; void save(QFile& file) const; int numScreens() const; protected: QSettings& settings() { return *m_pSettings; } ScreenList& screens() { return m_Screens; } void setScreens(const ScreenList& screens) { m_Screens = screens; } void addScreen(const Screen& screen) { m_Screens.append(screen); } void setNumColumns(int n) { m_NumColumns = n; } void setNumRows(int n) { m_NumRows = n; } void haveHeartbeat(bool on) { m_HasHeartbeat = on; } void setHeartbeat(int val) { m_Heartbeat = val; } void setRelativeMouseMoves(bool on) { m_RelativeMouseMoves = on; } void setScreenSaverSync(bool on) { m_ScreenSaverSync = on; } void setWin32KeepForeground(bool on) { m_Win32KeepForeground = on; } void haveSwitchDelay(bool on) { m_HasSwitchDelay = on; } void setSwitchDelay(int val) { m_SwitchDelay = val; } void haveSwitchDoubleTap(bool on) { m_HasSwitchDoubleTap = on; } void setSwitchDoubleTap(int val) { m_SwitchDoubleTap = val; } void setSwitchCorner(int c, bool on) { m_SwitchCorners[c] = on; } void setSwitchCornerSize(int val) { m_SwitchCornerSize = val; } QList& switchCorners() { return m_SwitchCorners; } HotkeyList& hotkeys() { return m_Hotkeys; } void init(); int adjacentScreenIndex(int idx, int deltaColumn, int deltaRow) const; private: QSettings* m_pSettings; ScreenList m_Screens; int m_NumColumns; int m_NumRows; bool m_HasHeartbeat; int m_Heartbeat; bool m_RelativeMouseMoves; bool m_ScreenSaverSync; bool m_Win32KeepForeground; bool m_HasSwitchDelay; int m_SwitchDelay; bool m_HasSwitchDoubleTap; int m_SwitchDoubleTap; int m_SwitchCornerSize; QList m_SwitchCorners; HotkeyList m_Hotkeys; }; QTextStream& operator<<(QTextStream& outStream, const ServerConfig& config); #endif synergy-1.4.12-Source/src/gui/src/ServerConfigDialog.cpp0000600000175000017500000001673112021261364023076 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ServerConfigDialog.h" #include "ServerConfig.h" #include "HotkeyDialog.h" #include "ActionDialog.h" #include #include ServerConfigDialog::ServerConfigDialog(QWidget* parent, ServerConfig& config, const QString& defaultScreenName) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::ServerConfigDialogBase(), m_OrigServerConfig(config), m_ServerConfig(config), m_ScreenSetupModel(serverConfig().screens(), serverConfig().numColumns(), serverConfig().numRows()) { setupUi(this); m_pCheckBoxHeartbeat->setChecked(serverConfig().hasHeartbeat()); m_pSpinBoxHeartbeat->setValue(serverConfig().heartbeat()); m_pCheckBoxRelativeMouseMoves->setChecked(serverConfig().relativeMouseMoves()); m_pCheckBoxScreenSaverSync->setChecked(serverConfig().screenSaverSync()); m_pCheckBoxWin32KeepForeground->setChecked(serverConfig().win32KeepForeground()); m_pCheckBoxSwitchDelay->setChecked(serverConfig().hasSwitchDelay()); m_pSpinBoxSwitchDelay->setValue(serverConfig().switchDelay()); m_pCheckBoxSwitchDoubleTap->setChecked(serverConfig().hasSwitchDoubleTap()); m_pSpinBoxSwitchDoubleTap->setValue(serverConfig().switchDoubleTap()); m_pCheckBoxCornerTopLeft->setChecked(serverConfig().switchCorner(BaseConfig::TopLeft)); m_pCheckBoxCornerTopRight->setChecked(serverConfig().switchCorner(BaseConfig::TopRight)); m_pCheckBoxCornerBottomLeft->setChecked(serverConfig().switchCorner(BaseConfig::BottomLeft)); m_pCheckBoxCornerBottomRight->setChecked(serverConfig().switchCorner(BaseConfig::BottomRight)); m_pSpinBoxSwitchCornerSize->setValue(serverConfig().switchCornerSize()); foreach(const Hotkey& hotkey, serverConfig().hotkeys()) m_pListHotkeys->addItem(hotkey.text()); m_pScreenSetupView->setModel(&m_ScreenSetupModel); if (serverConfig().numScreens() == 0) model().screen(serverConfig().numColumns() / 2, serverConfig().numRows() / 2) = Screen(defaultScreenName); } void ServerConfigDialog::accept() { serverConfig().haveHeartbeat(m_pCheckBoxHeartbeat->isChecked()); serverConfig().setHeartbeat(m_pSpinBoxHeartbeat->value()); serverConfig().setRelativeMouseMoves(m_pCheckBoxRelativeMouseMoves->isChecked()); serverConfig().setScreenSaverSync(m_pCheckBoxScreenSaverSync->isChecked()); serverConfig().setWin32KeepForeground(m_pCheckBoxWin32KeepForeground->isChecked()); serverConfig().haveSwitchDelay(m_pCheckBoxSwitchDelay->isChecked()); serverConfig().setSwitchDelay(m_pSpinBoxSwitchDelay->value()); serverConfig().haveSwitchDoubleTap(m_pCheckBoxSwitchDoubleTap->isChecked()); serverConfig().setSwitchDoubleTap(m_pSpinBoxSwitchDoubleTap->value()); serverConfig().setSwitchCorner(BaseConfig::TopLeft, m_pCheckBoxCornerTopLeft->isChecked()); serverConfig().setSwitchCorner(BaseConfig::TopRight, m_pCheckBoxCornerTopRight->isChecked()); serverConfig().setSwitchCorner(BaseConfig::BottomLeft, m_pCheckBoxCornerBottomLeft->isChecked()); serverConfig().setSwitchCorner(BaseConfig::BottomRight, m_pCheckBoxCornerBottomRight->isChecked()); serverConfig().setSwitchCornerSize(m_pSpinBoxSwitchCornerSize->value()); // now that the dialog has been accepted, copy the new server config to the original one, // which is a reference to the one in MainWindow. setOrigServerConfig(serverConfig()); QDialog::accept(); } void ServerConfigDialog::on_m_pButtonNewHotkey_clicked() { Hotkey hotkey; HotkeyDialog dlg(this, hotkey); if (dlg.exec() == QDialog::Accepted) { serverConfig().hotkeys().append(hotkey); m_pListHotkeys->addItem(hotkey.text()); } } void ServerConfigDialog::on_m_pButtonEditHotkey_clicked() { int idx = m_pListHotkeys->currentRow(); Q_ASSERT(idx >= 0 && idx < serverConfig().hotkeys().size()); Hotkey& hotkey = serverConfig().hotkeys()[idx]; HotkeyDialog dlg(this, hotkey); if (dlg.exec() == QDialog::Accepted) m_pListHotkeys->currentItem()->setText(hotkey.text()); } void ServerConfigDialog::on_m_pButtonRemoveHotkey_clicked() { int idx = m_pListHotkeys->currentRow(); Q_ASSERT(idx >= 0 && idx < serverConfig().hotkeys().size()); serverConfig().hotkeys().removeAt(idx); m_pListActions->clear(); delete m_pListHotkeys->item(idx); } void ServerConfigDialog::on_m_pListHotkeys_itemSelectionChanged() { bool itemsSelected = !m_pListHotkeys->selectedItems().isEmpty(); m_pButtonEditHotkey->setEnabled(itemsSelected); m_pButtonRemoveHotkey->setEnabled(itemsSelected); m_pButtonNewAction->setEnabled(itemsSelected); if (itemsSelected && serverConfig().hotkeys().size() > 0) { m_pListActions->clear(); int idx = m_pListHotkeys->row(m_pListHotkeys->selectedItems()[0]); // There's a bug somewhere around here: We get idx == 1 right after we deleted the next to last item, so idx can // only possibly be 0. GDB shows we got called indirectly from the delete line in // on_m_pButtonRemoveHotkey_clicked() above, but the delete is of course necessary and seems correct. // The while() is a generalized workaround for all that and shouldn't be required. while (idx >= 0 && idx >= serverConfig().hotkeys().size()) idx--; Q_ASSERT(idx >= 0 && idx < serverConfig().hotkeys().size()); const Hotkey& hotkey = serverConfig().hotkeys()[idx]; foreach(const Action& action, hotkey.actions()) m_pListActions->addItem(action.text()); } } void ServerConfigDialog::on_m_pButtonNewAction_clicked() { int idx = m_pListHotkeys->currentRow(); Q_ASSERT(idx >= 0 && idx < serverConfig().hotkeys().size()); Hotkey& hotkey = serverConfig().hotkeys()[idx]; Action action; ActionDialog dlg(this, serverConfig(), hotkey, action); if (dlg.exec() == QDialog::Accepted) { hotkey.actions().append(action); m_pListActions->addItem(action.text()); } } void ServerConfigDialog::on_m_pButtonEditAction_clicked() { int idxHotkey = m_pListHotkeys->currentRow(); Q_ASSERT(idxHotkey >= 0 && idxHotkey < serverConfig().hotkeys().size()); Hotkey& hotkey = serverConfig().hotkeys()[idxHotkey]; int idxAction = m_pListActions->currentRow(); Q_ASSERT(idxAction >= 0 && idxAction < hotkey.actions().size()); Action& action = hotkey.actions()[idxAction]; ActionDialog dlg(this, serverConfig(), hotkey, action); if (dlg.exec() == QDialog::Accepted) m_pListActions->currentItem()->setText(action.text()); } void ServerConfigDialog::on_m_pButtonRemoveAction_clicked() { int idxHotkey = m_pListHotkeys->currentRow(); Q_ASSERT(idxHotkey >= 0 && idxHotkey < serverConfig().hotkeys().size()); Hotkey& hotkey = serverConfig().hotkeys()[idxHotkey]; int idxAction = m_pListActions->currentRow(); Q_ASSERT(idxAction >= 0 && idxAction < hotkey.actions().size()); hotkey.actions().removeAt(idxAction); delete m_pListActions->currentItem(); } void ServerConfigDialog::on_m_pListActions_itemSelectionChanged() { m_pButtonEditAction->setEnabled(!m_pListActions->selectedItems().isEmpty()); m_pButtonRemoveAction->setEnabled(!m_pListActions->selectedItems().isEmpty()); } synergy-1.4.12-Source/src/gui/src/ServerConfigDialog.h0000600000175000017500000000350312021261364022534 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SERVERCONFIGDIALOG__H) #define SERVERCONFIGDIALOG__H #include "ScreenSetupModel.h" #include "ServerConfig.h" #include "ui_ServerConfigDialogBase.h" #include class ServerConfigDialog : public QDialog, public Ui::ServerConfigDialogBase { Q_OBJECT public: ServerConfigDialog(QWidget* parent, ServerConfig& config, const QString& defaultScreenName); public slots: void accept(); protected slots: void on_m_pButtonNewHotkey_clicked(); void on_m_pListHotkeys_itemSelectionChanged(); void on_m_pButtonEditHotkey_clicked(); void on_m_pButtonRemoveHotkey_clicked(); void on_m_pButtonNewAction_clicked(); void on_m_pListActions_itemSelectionChanged(); void on_m_pButtonEditAction_clicked(); void on_m_pButtonRemoveAction_clicked(); protected: ServerConfig& serverConfig() { return m_ServerConfig; } void setOrigServerConfig(const ServerConfig& s) { m_OrigServerConfig = s; } ScreenSetupModel& model() { return m_ScreenSetupModel; } private: ServerConfig& m_OrigServerConfig; ServerConfig m_ServerConfig; ScreenSetupModel m_ScreenSetupModel; }; #endif synergy-1.4.12-Source/src/gui/src/SettingsDialog.cpp0000600000175000017500000001057312131565005022301 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "SettingsDialog.h" #include #include #include #include "AppConfig.h" SettingsDialog::SettingsDialog(QWidget* parent, AppConfig& config) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint), Ui::SettingsDialogBase(), m_AppConfig(config) { setupUi(this); m_pCheckBoxAutoConnect->setChecked(appConfig().autoConnect()); m_pLineEditScreenName->setText(appConfig().screenName()); m_pSpinBoxPort->setValue(appConfig().port()); m_pLineEditInterface->setText(appConfig().interface()); m_pComboProcessMode->setCurrentIndex(appConfig().processMode()); m_pComboLogLevel->setCurrentIndex(appConfig().logLevel()); m_pCheckBoxLogToFile->setChecked(appConfig().logToFile()); m_pLineEditLogFilename->setText(appConfig().logFilename()); m_pCheckBoxAutoStart->setChecked(appConfig().autoStart()); m_pCheckBoxAutoHide->setChecked(appConfig().autoHide()); m_pComboCryptoMode->setCurrentIndex(getCryptoModeIndex(appConfig().cryptoMode())); m_pLineEditCryptoPass->setText(appConfig().cryptoPass()); } void SettingsDialog::accept() { const QString& cryptoPass = m_pLineEditCryptoPass->text(); CryptoMode cryptoMode = parseCryptoMode(m_pComboCryptoMode->currentText()); if ((cryptoMode != Disabled) && cryptoPass.isEmpty()) { QMessageBox message; message.setWindowTitle("Settings"); message.setIcon(QMessageBox::Information); message.setText(tr("Encryption password must not be empty.")); message.exec(); return; } appConfig().setAutoConnect(m_pCheckBoxAutoConnect->isChecked()); appConfig().setScreenName(m_pLineEditScreenName->text()); appConfig().setPort(m_pSpinBoxPort->value()); appConfig().setInterface(m_pLineEditInterface->text()); appConfig().setProcessMode((ProcessMode)m_pComboProcessMode->currentIndex()); appConfig().setLogLevel(m_pComboLogLevel->currentIndex()); appConfig().setLogToFile(m_pCheckBoxLogToFile->isChecked()); appConfig().setLogFilename(m_pLineEditLogFilename->text()); appConfig().setAutoStart(m_pCheckBoxAutoStart->isChecked()); appConfig().setAutoHide(m_pCheckBoxAutoHide->isChecked()); appConfig().setCryptoMode(cryptoMode); appConfig().setCryptoPass(cryptoPass); appConfig().saveSettings(); QDialog::accept(); } void SettingsDialog::on_m_pCheckBoxLogToFile_stateChanged(int i) { bool checked = i == 2; m_pLineEditLogFilename->setEnabled(checked); m_pButtonBrowseLog->setEnabled(checked); } void SettingsDialog::on_m_pButtonBrowseLog_clicked() { QString fileName = QFileDialog::getSaveFileName( this, tr("Save log file to..."), m_pLineEditLogFilename->text(), "Logs (*.log *.txt)"); if (!fileName.isEmpty()) { m_pLineEditLogFilename->setText(fileName); } } void SettingsDialog::on_m_pComboCryptoMode_currentIndexChanged(int index) { bool enabled = parseCryptoMode(m_pComboCryptoMode->currentText()) != Disabled; m_pLineEditCryptoPass->setEnabled(enabled); if (!enabled) { m_pLineEditCryptoPass->clear(); } } int SettingsDialog::getCryptoModeIndex(const CryptoMode& mode) const { switch (mode) { case OFB: return m_pComboCryptoMode->findText("OFB", Qt::MatchStartsWith); case CFB: return m_pComboCryptoMode->findText("CFB", Qt::MatchStartsWith); case CTR: return m_pComboCryptoMode->findText("CTR", Qt::MatchStartsWith); case GCM: return m_pComboCryptoMode->findText("GCM", Qt::MatchStartsWith); default: return m_pComboCryptoMode->findText("Disable", Qt::MatchStartsWith); } } CryptoMode SettingsDialog::parseCryptoMode(const QString& s) { if (s.startsWith("OFB")) { return OFB; } else if (s.startsWith("CFB")) { return CFB; } else if (s.startsWith("CTR")) { return CTR; } else if (s.startsWith("GCM")) { return GCM; } return Disabled; } synergy-1.4.12-Source/src/gui/src/SettingsDialog.h0000600000175000017500000000317612131565005021747 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(SETTINGSDIALOG_H) #define SETTINGSDIALOG_H #include #include "ui_SettingsDialogBase.h" #include "CryptoMode.h" class AppConfig; class SettingsDialog : public QDialog, public Ui::SettingsDialogBase { Q_OBJECT public: SettingsDialog(QWidget* parent, AppConfig& config); static QString browseForSynergyc(QWidget* parent, const QString& programDir, const QString& synergycName); static QString browseForSynergys(QWidget* parent, const QString& programDir, const QString& synergysName); protected: void accept(); AppConfig& appConfig() { return m_AppConfig; } private: int getCryptoModeIndex(const CryptoMode& mode) const; CryptoMode parseCryptoMode(const QString& s); AppConfig& m_AppConfig; private slots: void on_m_pComboCryptoMode_currentIndexChanged(int index); void on_m_pCheckBoxLogToFile_stateChanged(int ); void on_m_pButtonBrowseLog_clicked(); }; #endif synergy-1.4.12-Source/src/gui/src/SetupWizard.cpp0000600000175000017500000001015112131565005021632 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "SetupWizard.h" #include "MainWindow.h" #include #include SetupWizard::SetupWizard(MainWindow& mainWindow, bool startMain) : m_MainWindow(mainWindow), m_StartMain(startMain) { setupUi(this); #if defined(Q_OS_MAC) // the mac style needs a little more room because of the // graphic on the left. resize(600, 500); setMinimumSize(size()); #elif defined(Q_OS_WIN) // when areo is disabled on windows, the next/back buttons // are hidden (must be a qt bug) -- resizing the window // to +1 of the original height seems to fix this. // NOTE: calling setMinimumSize after this will break // it again, so don't do that. resize(size().width(), size().height() + 1); #endif connect(this, SIGNAL(finished(int)), this, SLOT(handleFinished())); connect(m_pServerRadioButton, SIGNAL(toggled(bool)), m_MainWindow.m_pGroupServer, SLOT(setChecked(bool))); connect(m_pClientRadioButton, SIGNAL(toggled(bool)), m_MainWindow.m_pGroupClient, SLOT(setChecked(bool))); } SetupWizard::~SetupWizard() { } bool SetupWizard::validateCurrentPage() { QMessageBox message; message.setWindowTitle(tr("Setup Synergy")); message.setIcon(QMessageBox::Information); if (currentPage() == m_pNodePage) { bool result = m_pClientRadioButton->isChecked() || m_pServerRadioButton->isChecked(); if (!result) { message.setText(tr("Please select an option.")); message.exec(); return false; } } else if (currentPage() == m_pCryptoPage) { QString modeText = m_pComboCryptoMode->currentText(); if (modeText.isEmpty()) { message.setText(tr("Encryption mode required.")); message.exec(); return false; } if (parseCryptoMode(modeText) != Disabled) { if (m_pLineEditCryptoPass->text().isEmpty()) { message.setText(tr("Encryption password required.")); message.exec(); return false; } if (m_pLineEditCryptoPass->text() != m_pLineEditCryptoPassConfirm->text()) { message.setText(tr("Encryption password and confirmation do not match.")); message.exec(); return false; } } } return true; } void SetupWizard::handleFinished() { close(); AppConfig& appConfig = m_MainWindow.appConfig(); appConfig.setCryptoMode(parseCryptoMode(m_pComboCryptoMode->currentText())); appConfig.setCryptoPass(m_pLineEditCryptoPass->text()); appConfig.setWizardHasRun(); appConfig.saveSettings(); QSettings& settings = m_MainWindow.settings(); if (m_pServerRadioButton->isChecked()) { settings.setValue("groupServerChecked", true); settings.setValue("groupClientChecked", false); } if (m_pClientRadioButton->isChecked()) { settings.setValue("groupClientChecked", true); settings.setValue("groupServerChecked", false); } settings.sync(); if (m_StartMain) { m_MainWindow.start(true); } } void SetupWizard::on_m_pComboCryptoMode_currentIndexChanged(int index) { bool enabled = parseCryptoMode(m_pComboCryptoMode->currentText()) != Disabled; m_pLineEditCryptoPass->setEnabled(enabled); m_pLineEditCryptoPassConfirm->setEnabled(enabled); } CryptoMode SetupWizard::parseCryptoMode(const QString& s) { if (s.startsWith("OFB")) { return OFB; } else if (s.startsWith("CFB")) { return CFB; } else if (s.startsWith("CTR")) { return CTR; } else if (s.startsWith("GCM")) { return GCM; } return Disabled; } synergy-1.4.12-Source/src/gui/src/SetupWizard.h0000600000175000017500000000235512131565005021306 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include "ui_SetupWizardBase.h" #include "CryptoMode.h" class MainWindow; class SetupWizard : public QWizard, public Ui::SetupWizardBase { Q_OBJECT public: SetupWizard(MainWindow& mainWindow, bool startMain); virtual ~SetupWizard(); bool validateCurrentPage(); protected slots: void handleFinished(); private: MainWindow& m_MainWindow; bool m_StartMain; CryptoMode parseCryptoMode(const QString& s); private slots: void on_m_pComboCryptoMode_currentIndexChanged(int index); }; synergy-1.4.12-Source/src/gui/src/TcpSocketReader.cpp0000600000175000017500000000170312021261364022375 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "TcpSocketReader.h" #include IpcReader::IpcReader(QTcpSocket& socket) : m_Socket(socket) { connect(m_Socket, SIGNAL(readyRead()), this, SLOT(read())); } IpcReader::~IpcReader() { } synergy-1.4.12-Source/src/gui/src/TrashScreenWidget.cpp0000600000175000017500000000233612021261364022743 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "TrashScreenWidget.h" #include "ScreenSetupModel.h" #include #include void TrashScreenWidget::dragEnterEvent(QDragEnterEvent* event) { if (event->mimeData()->hasFormat(ScreenSetupModel::mimeType())) { event->setDropAction(Qt::MoveAction); event->accept(); } else event->ignore(); } void TrashScreenWidget::dropEvent(QDropEvent* event) { if (event->mimeData()->hasFormat(ScreenSetupModel::mimeType())) event->acceptProposedAction(); else event->ignore(); } synergy-1.4.12-Source/src/gui/src/TrashScreenWidget.h0000600000175000017500000000212712021261364022406 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2008 Volker Lanz (vl@fidra.de) * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if !defined(TRASHSCREENWIDGET__H) #define TRASHSCREENWIDGET__H #include class QWidget; class QDragEnterEvent; class QDropEvent; class TrashScreenWidget : public QLabel { Q_OBJECT public: TrashScreenWidget(QWidget* parent) : QLabel(parent) {} public: void dragEnterEvent(QDragEnterEvent* event); void dropEvent(QDropEvent* event); }; #endif synergy-1.4.12-Source/src/gui/src/VersionChecker.cpp0000600000175000017500000000562512021261364022274 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "VersionChecker.h" #include #include #include #include #include #define VERSION_REGEX "(\\d+\\.\\d+\\.\\d+)" #define VERSION_URL "http://synergy-plus.googlecode.com/svn/web/version.txt" VersionChecker::VersionChecker() { m_manager = new QNetworkAccessManager(this); connect(m_manager, SIGNAL(finished(QNetworkReply*)), this, SLOT(replyFinished(QNetworkReply*))); } VersionChecker::~VersionChecker() { delete m_manager; } void VersionChecker::checkLatest() { m_manager->get(QNetworkRequest(QUrl(VERSION_URL))); } void VersionChecker::replyFinished(QNetworkReply* reply) { QString newestVersion = QString(reply->readAll()); if (!newestVersion.isEmpty()) { QString currentVersion = getVersion(); if (compareVersions(currentVersion, newestVersion) > 0) emit updateFound(newestVersion); } } int VersionChecker::compareVersions(const QString& left, const QString& right) { if (left.compare(right) == 0) return 0; // versions are same. QStringList leftSplit = left.split(QRegExp("\\.")); if (leftSplit.size() != 3) return 1; // assume right wins. QStringList rightSplit = right.split(QRegExp("\\.")); if (rightSplit.size() != 3) return -1; // assume left wins. int leftMajor = leftSplit.at(0).toInt(); int leftMinor = leftSplit.at(1).toInt(); int leftRev = leftSplit.at(2).toInt(); int rightMajor = rightSplit.at(0).toInt(); int rightMinor = rightSplit.at(1).toInt(); int rightRev = rightSplit.at(2).toInt(); bool rightWins = (rightMajor > leftMajor) || ((rightMajor >= leftMajor) && (rightMinor > leftMinor)) || ((rightMajor >= leftMajor) && (rightMinor >= leftMinor) && (rightRev > leftRev)); return rightWins ? 1 : -1; } QString VersionChecker::getVersion() { QProcess process; process.start(m_app, QStringList() << "--version"); process.setReadChannel(QProcess::StandardOutput); if (process.waitForStarted() && process.waitForFinished()) { QRegExp rx(VERSION_REGEX); QString text = process.readLine(); if (rx.indexIn(text) != -1) return rx.cap(1); } return tr("Unknown"); } synergy-1.4.12-Source/src/gui/src/VersionChecker.h0000600000175000017500000000243712021261364021737 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include class QNetworkAccessManager; class QNetworkReply; class VersionChecker : public QObject { Q_OBJECT public: VersionChecker(); virtual ~VersionChecker(); void checkLatest(); QString getVersion(); void setApp(const QString& app) { m_app = app; } int compareVersions(const QString& left, const QString& right); public slots: void replyFinished(QNetworkReply* reply); signals: void updateFound(const QString& version); private: QNetworkAccessManager* m_manager; QString m_app; }; synergy-1.4.12-Source/src/lib/0000700000175000017500000000000012140644175016046 5ustar synergysynergysynergy-1.4.12-Source/src/lib/arch/0000700000175000017500000000000012140644175016763 5ustar synergysynergysynergy-1.4.12-Source/src/lib/arch/CArch.cpp0000600000175000017500000000220312021261364020437 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArch.h" // // CArch // CArch* CArch::s_instance = NULL; CArch::CArch() { assert(s_instance == NULL); s_instance = this; } CArch::~CArch() { #if SYSAPI_WIN32 CArchMiscWindows::cleanup(); #endif } void CArch::init() { ARCH_NETWORK::init(); #if SYSAPI_WIN32 ARCH_TASKBAR::init(); CArchMiscWindows::init(); #endif } CArch* CArch::getInstance() { assert(s_instance != NULL); return s_instance; } synergy-1.4.12-Source/src/lib/arch/CArch.h0000600000175000017500000000766512021261364020125 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // TODO: consider whether or not to use either encapsulation (as below) // or inheritance (as it is now) for the ARCH stuff. // // case for encapsulation: // pros: // - compiler errors for missing pv implementations are not absolutely bonkers. // - function names don't have to be so verbose. // - easier to understand and debug. // - ctors in IArch implementations can call other implementations. // cons: // - slightly more code for calls to ARCH. // - you'll have to modify each ARCH call. // // also, we may want to consider making each encapsulated // class lazy-loaded so that apps like the daemon don't load // stuff when they don't need it. #ifndef CARCH_H #define CARCH_H #include "common.h" #if SYSAPI_WIN32 # include "CArchConsoleWindows.h" # include "CArchDaemonWindows.h" # include "CArchFileWindows.h" # include "CArchLogWindows.h" # include "CArchMiscWindows.h" # include "CArchMultithreadWindows.h" # include "CArchNetworkWinsock.h" # include "CArchSleepWindows.h" # include "CArchStringWindows.h" # include "CArchSystemWindows.h" # include "CArchTaskBarWindows.h" # include "CArchTimeWindows.h" # include "CArchPluginWindows.h" #elif SYSAPI_UNIX # include "CArchConsoleUnix.h" # include "CArchDaemonUnix.h" # include "CArchFileUnix.h" # include "CArchLogUnix.h" # if HAVE_PTHREAD # include "CArchMultithreadPosix.h" # endif # include "CArchNetworkBSD.h" # include "CArchSleepUnix.h" # include "CArchStringUnix.h" # include "CArchSystemUnix.h" # include "CArchTaskBarXWindows.h" # include "CArchTimeUnix.h" # include "CArchPluginUnix.h" #endif /*! \def ARCH This macro evaluates to the singleton CArch object. */ #define ARCH (CArch::getInstance()) //! Delegating implementation of architecture dependent interfaces /*! This class is a centralized interface to all architecture dependent interface implementations (except miscellaneous functions). It instantiates an implementation of each interface and delegates calls to each method to those implementations. Clients should use the \c ARCH macro to access this object. Clients must also instantiate exactly one of these objects before attempting to call any method, typically at the beginning of \c main(). */ class CArch : public ARCH_CONSOLE, public ARCH_DAEMON, public ARCH_FILE, public ARCH_LOG, public ARCH_MULTITHREAD, public ARCH_NETWORK, public ARCH_SLEEP, public ARCH_STRING, public ARCH_SYSTEM, public ARCH_TASKBAR, public ARCH_TIME { public: CArch(); virtual ~CArch(); //! Call init on other arch classes. /*! Some arch classes depend on others to exist first. When init is called these clases will have ARCH available for use. */ virtual void init(); // // accessors // //! Return the singleton instance /*! The client must have instantiated exactly once CArch object before calling this function. */ static CArch* getInstance(); ARCH_PLUGIN& plugin() const { return (ARCH_PLUGIN&)m_plugin; } private: static CArch* s_instance; ARCH_PLUGIN m_plugin; }; //! Convenience object to lock/unlock an arch mutex class CArchMutexLock { public: CArchMutexLock(CArchMutex mutex) : m_mutex(mutex) { ARCH->lockMutex(m_mutex); } ~CArchMutexLock() { ARCH->unlockMutex(m_mutex); } private: CArchMutex m_mutex; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchConsoleStd.cpp0000600000175000017500000000176412021261364022450 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchConsoleStd.h" #include "CLog.h" #include void CArchConsoleStd::writeConsole(ELevel level, const char* str) { if ((level >= kFATAL) && (level <= kWARNING)) std::cerr << str << std::endl; else std::cout << str << std::endl; std::cout.flush(); }synergy-1.4.12-Source/src/lib/arch/CArchConsoleStd.h0000600000175000017500000000216712021261364022113 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IArchConsole.h" //! Cross platform implementation of IArchConsole class CArchConsoleStd : public IArchConsole { public: CArchConsoleStd() { } virtual ~CArchConsoleStd() { } // IArchConsole overrides virtual void openConsole(const char* title) { } virtual void closeConsole() { } virtual void showConsole(bool) { } virtual void writeConsole(ELevel level, const char*); }; synergy-1.4.12-Source/src/lib/arch/CArchConsoleUnix.cpp0000600000175000017500000000152212021261364022631 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchConsoleUnix.h" CArchConsoleUnix::CArchConsoleUnix() { } CArchConsoleUnix::~CArchConsoleUnix() { } synergy-1.4.12-Source/src/lib/arch/CArchConsoleUnix.h0000600000175000017500000000164212021261364022301 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CArchConsoleStd.h" #define ARCH_CONSOLE CArchConsoleUnix class CArchConsoleUnix : public CArchConsoleStd { public: CArchConsoleUnix(); virtual ~CArchConsoleUnix(); }; synergy-1.4.12-Source/src/lib/arch/CArchConsoleWindows.cpp0000600000175000017500000000154112021261364023341 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchConsoleWindows.h" CArchConsoleWindows::CArchConsoleWindows() { } CArchConsoleWindows::~CArchConsoleWindows() { } synergy-1.4.12-Source/src/lib/arch/CArchConsoleWindows.h0000600000175000017500000000165612021261364023015 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CArchConsoleStd.h" #define ARCH_CONSOLE CArchConsoleWindows class CArchConsoleWindows : public CArchConsoleStd { public: CArchConsoleWindows(); virtual ~CArchConsoleWindows(); }; synergy-1.4.12-Source/src/lib/arch/CArchDaemonNone.cpp0000600000175000017500000000312112021261364022403 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchDaemonNone.h" // // CArchDaemonNone // CArchDaemonNone::CArchDaemonNone() { // do nothing } CArchDaemonNone::~CArchDaemonNone() { // do nothing } void CArchDaemonNone::installDaemon(const char*, const char*, const char*, const char*, const char*, bool) { // do nothing } void CArchDaemonNone::uninstallDaemon(const char*, bool) { // do nothing } int CArchDaemonNone::daemonize(const char* name, DaemonFunc func) { // simply forward the call to func. obviously, this doesn't // do any daemonizing. return func(1, &name); } bool CArchDaemonNone::canInstallDaemon(const char*, bool) { return false; } bool CArchDaemonNone::isDaemonInstalled(const char*, bool) { return false; } void CArchDaemonNone::installDaemon() { } void CArchDaemonNone::uninstallDaemon() { } std::string CArchDaemonNone::commandLine() const { return ""; } synergy-1.4.12-Source/src/lib/arch/CArchDaemonNone.h0000600000175000017500000000345512021261364022062 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHDAEMONNONE_H #define CARCHDAEMONNONE_H #include "IArchDaemon.h" #define ARCH_DAEMON CArchDaemonNone //! Dummy implementation of IArchDaemon /*! This class implements IArchDaemon for a platform that does not have daemons. The install and uninstall functions do nothing, the query functions return false, and \c daemonize() simply calls the passed function and returns its result. */ class CArchDaemonNone : public IArchDaemon { public: CArchDaemonNone(); virtual ~CArchDaemonNone(); // IArchDaemon overrides virtual void installDaemon(const char* name, const char* description, const char* pathname, const char* commandLine, const char* dependencies, bool allUsers); virtual void uninstallDaemon(const char* name, bool allUsers); virtual int daemonize(const char* name, DaemonFunc func); virtual bool canInstallDaemon(const char* name, bool allUsers); virtual bool isDaemonInstalled(const char* name, bool allUsers); virtual void installDaemon(); virtual void uninstallDaemon(); virtual std::string commandLine() const; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchDaemonUnix.cpp0000600000175000017500000000563112021261364022437 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchDaemonUnix.h" #include "XArchUnix.h" #include #include #include #include #include #include #include "CLog.h" // // CArchDaemonUnix // CArchDaemonUnix::CArchDaemonUnix() { // do nothing } CArchDaemonUnix::~CArchDaemonUnix() { // do nothing } #ifdef __APPLE__ // In Mac OS X, fork()'d child processes can't use most APIs (the frameworks // that Synergy uses in fact prevent it and make the process just up and die), // so need to exec a copy of the program that doesn't fork so isn't limited. int execSelfNonDaemonized() { extern char** NXArgv; char** selfArgv = NXArgv; setenv("_SYNERGY_DAEMONIZED", "", 1); execvp(selfArgv[0], selfArgv); return 0; } bool alreadyDaemonized() { return getenv("_SYNERGY_DAEMONIZED") != NULL; } #endif int CArchDaemonUnix::daemonize(const char* name, DaemonFunc func) { #ifdef __APPLE__ if (alreadyDaemonized()) return func(1, &name); #endif // fork so shell thinks we're done and so we're not a process // group leader switch (fork()) { case -1: // failed throw XArchDaemonFailed(new XArchEvalUnix(errno)); case 0: // child break; default: // parent exits exit(0); } // become leader of a new session setsid(); #ifndef __APPLE__ // NB: don't run chdir on apple; causes strange behaviour. // chdir to root so we don't keep mounted filesystems points busy // TODO: this is a bit of a hack - can we find a better solution? int chdirErr = chdir("/"); if (chdirErr) // NB: file logging actually isn't working at this point! LOG((CLOG_ERR "chdir error: %i", chdirErr)); #endif // mask off permissions for any but owner umask(077); // close open files. we only expect stdin, stdout, stderr to be open. close(0); close(1); close(2); // attach file descriptors 0, 1, 2 to /dev/null so inadvertent use // of standard I/O safely goes in the bit bucket. open("/dev/null", O_RDONLY); open("/dev/null", O_RDWR); int dupErr = dup(1); if (dupErr) // NB: file logging actually isn't working at this point! LOG((CLOG_ERR "dup error: %i", dupErr)); #ifdef __APPLE__ return execSelfNonDaemonized(); #endif // invoke function return func(1, &name); } synergy-1.4.12-Source/src/lib/arch/CArchDaemonUnix.h0000600000175000017500000000222012021261364022073 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHDAEMONUNIX_H #define CARCHDAEMONUNIX_H #include "CArchDaemonNone.h" #undef ARCH_DAEMON #define ARCH_DAEMON CArchDaemonUnix //! Unix implementation of IArchDaemon class CArchDaemonUnix : public CArchDaemonNone { public: CArchDaemonUnix(); virtual ~CArchDaemonUnix(); // IArchDaemon overrides virtual int daemonize(const char* name, DaemonFunc func); }; #define CONFIG_FILE "/etc/synergy/synergyd.conf" #endif synergy-1.4.12-Source/src/lib/arch/CArchDaemonWindows.cpp0000600000175000017500000005200212021261364023140 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchDaemonWindows.h" #include "CArch.h" #include "CArchMiscWindows.h" #include "XArchWindows.h" #include "stdvector.h" // // CArchDaemonWindows // CArchDaemonWindows* CArchDaemonWindows::s_daemon = NULL; CArchDaemonWindows::CArchDaemonWindows() : m_daemonThreadID(0) { m_quitMessage = RegisterWindowMessage("SynergyDaemonExit"); } CArchDaemonWindows::~CArchDaemonWindows() { // do nothing } int CArchDaemonWindows::runDaemon(RunFunc runFunc) { assert(s_daemon != NULL); return s_daemon->doRunDaemon(runFunc); } void CArchDaemonWindows::daemonRunning(bool running) { // if s_daemon is NULL we assume we're running on the windows // 95 family and we just ignore this call so the caller doesn't // have to go through the trouble of not calling it on the // windows 95 family. if (s_daemon != NULL) { s_daemon->doDaemonRunning(running); } } UINT CArchDaemonWindows::getDaemonQuitMessage() { if (s_daemon != NULL) { return s_daemon->doGetDaemonQuitMessage(); } else { return 0; } } void CArchDaemonWindows::daemonFailed(int result) { // if s_daemon is NULL we assume we're running on the windows // 95 family and we just ignore this call so the caller doesn't // have to go through the trouble of not calling it on the // windows 95 family. if (s_daemon != NULL) { throw XArchDaemonRunFailed(result); } } void CArchDaemonWindows::installDaemon(const char* name, const char* description, const char* pathname, const char* commandLine, const char* dependencies, bool allUsers) { // if not for all users then use the user's autostart registry. // key. if windows 95 family then use windows 95 services key. if (!allUsers || CArchMiscWindows::isWindows95Family()) { // open registry HKEY key = (allUsers && CArchMiscWindows::isWindows95Family()) ? open95ServicesKey() : openUserStartupKey(); if (key == NULL) { // can't open key throw XArchDaemonInstallFailed(new XArchEvalWindows); } // construct entry std::string value; value += "\""; value += pathname; value += "\" "; value += commandLine; // install entry CArchMiscWindows::setValue(key, name, value); // clean up CArchMiscWindows::closeKey(key); } // windows NT family services else { // open service manager SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_WRITE); if (mgr == NULL) { // can't open service manager throw XArchDaemonInstallFailed(new XArchEvalWindows); } // create the service SC_HANDLE service = CreateService(mgr, name, name, 0, SERVICE_WIN32_OWN_PROCESS | SERVICE_INTERACTIVE_PROCESS, SERVICE_AUTO_START, SERVICE_ERROR_NORMAL, pathname, NULL, NULL, dependencies, NULL, NULL); if (service == NULL) { // can't create service DWORD err = GetLastError(); if (err != ERROR_SERVICE_EXISTS) { CloseServiceHandle(mgr); throw XArchDaemonInstallFailed(new XArchEvalWindows(err)); } } else { // done with service (but only try to close if not null) CloseServiceHandle(service); } // done with manager CloseServiceHandle(mgr); // open the registry key for this service HKEY key = openNTServicesKey(); key = CArchMiscWindows::addKey(key, name); if (key == NULL) { // can't open key DWORD err = GetLastError(); try { uninstallDaemon(name, allUsers); } catch (...) { // ignore } throw XArchDaemonInstallFailed(new XArchEvalWindows(err)); } // set the description CArchMiscWindows::setValue(key, _T("Description"), description); // set command line key = CArchMiscWindows::addKey(key, _T("Parameters")); if (key == NULL) { // can't open key DWORD err = GetLastError(); CArchMiscWindows::closeKey(key); try { uninstallDaemon(name, allUsers); } catch (...) { // ignore } throw XArchDaemonInstallFailed(new XArchEvalWindows(err)); } CArchMiscWindows::setValue(key, _T("CommandLine"), commandLine); // done with registry CArchMiscWindows::closeKey(key); } } void CArchDaemonWindows::uninstallDaemon(const char* name, bool allUsers) { // if not for all users then use the user's autostart registry. // key. if windows 95 family then use windows 95 services key. if (!allUsers || CArchMiscWindows::isWindows95Family()) { // open registry HKEY key = (allUsers && CArchMiscWindows::isWindows95Family()) ? open95ServicesKey() : openUserStartupKey(); if (key == NULL) { // can't open key. daemon is probably not installed. throw XArchDaemonUninstallNotInstalled(new XArchEvalWindows); } // remove entry CArchMiscWindows::deleteValue(key, name); // clean up CArchMiscWindows::closeKey(key); } // windows NT family services else { // remove parameters for this service. ignore failures. HKEY key = openNTServicesKey(); key = CArchMiscWindows::openKey(key, name); if (key != NULL) { CArchMiscWindows::deleteKey(key, _T("Parameters")); CArchMiscWindows::closeKey(key); } // open service manager SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_WRITE); if (mgr == NULL) { // can't open service manager throw XArchDaemonUninstallFailed(new XArchEvalWindows); } // open the service. oddly, you must open a service to delete it. SC_HANDLE service = OpenService(mgr, name, DELETE | SERVICE_STOP); if (service == NULL) { DWORD err = GetLastError(); CloseServiceHandle(mgr); if (err != ERROR_SERVICE_DOES_NOT_EXIST) { throw XArchDaemonUninstallFailed(new XArchEvalWindows(err)); } throw XArchDaemonUninstallNotInstalled(new XArchEvalWindows(err)); } // stop the service. we don't care if we fail. SERVICE_STATUS status; ControlService(service, SERVICE_CONTROL_STOP, &status); // delete the service const bool okay = (DeleteService(service) == 0); const DWORD err = GetLastError(); // clean up CloseServiceHandle(service); CloseServiceHandle(mgr); // give windows a chance to remove the service before // we check if it still exists. ARCH->sleep(1); // handle failure. ignore error if service isn't installed anymore. if (!okay && isDaemonInstalled(name, allUsers)) { if (err == ERROR_SUCCESS) { // this seems to occur even though the uninstall was successful. // it could be a timing issue, i.e., isDaemonInstalled is // called too soon. i've added a sleep to try and stop this. return; } if (err == ERROR_IO_PENDING) { // this seems to be a spurious error return; } if (err != ERROR_SERVICE_MARKED_FOR_DELETE) { throw XArchDaemonUninstallFailed(new XArchEvalWindows(err)); } throw XArchDaemonUninstallNotInstalled(new XArchEvalWindows(err)); } } } int CArchDaemonWindows::daemonize(const char* name, DaemonFunc func) { assert(name != NULL); assert(func != NULL); // windows 95 family services if (CArchMiscWindows::isWindows95Family()) { typedef DWORD (WINAPI *RegisterServiceProcessT)(DWORD, DWORD); // mark this process as a service so it's not killed when the // user logs off. HINSTANCE kernel = LoadLibrary("kernel32.dll"); if (kernel == NULL) { throw XArchDaemonFailed(new XArchEvalWindows); } RegisterServiceProcessT RegisterServiceProcess = reinterpret_cast( GetProcAddress(kernel, "RegisterServiceProcess")); if (RegisterServiceProcess == NULL) { // missing RegisterServiceProcess function DWORD err = GetLastError(); FreeLibrary(kernel); throw XArchDaemonFailed(new XArchEvalWindows(err)); } if (RegisterServiceProcess(0, 1) == 0) { // RegisterServiceProcess failed DWORD err = GetLastError(); FreeLibrary(kernel); throw XArchDaemonFailed(new XArchEvalWindows(err)); } FreeLibrary(kernel); // now simply call the daemon function return func(1, &name); } // windows NT family services else { // save daemon function m_daemonFunc = func; // construct the service entry SERVICE_TABLE_ENTRY entry[2]; entry[0].lpServiceName = const_cast(name); entry[0].lpServiceProc = &CArchDaemonWindows::serviceMainEntry; entry[1].lpServiceName = NULL; entry[1].lpServiceProc = NULL; // hook us up to the service control manager. this won't return // (if successful) until the processes have terminated. s_daemon = this; if (StartServiceCtrlDispatcher(entry) == 0) { // StartServiceCtrlDispatcher failed s_daemon = NULL; throw XArchDaemonFailed(new XArchEvalWindows); } s_daemon = NULL; return m_daemonResult; } } bool CArchDaemonWindows::canInstallDaemon(const char* /*name*/, bool allUsers) { // if not for all users then use the user's autostart registry. // key. if windows 95 family then use windows 95 services key. if (!allUsers || CArchMiscWindows::isWindows95Family()) { // check if we can open the registry key HKEY key = (allUsers && CArchMiscWindows::isWindows95Family()) ? open95ServicesKey() : openUserStartupKey(); CArchMiscWindows::closeKey(key); return (key != NULL); } // windows NT family services else { // check if we can open service manager for write SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_WRITE); if (mgr == NULL) { return false; } CloseServiceHandle(mgr); // check if we can open the registry key HKEY key = openNTServicesKey(); // key = CArchMiscWindows::addKey(key, name); // key = CArchMiscWindows::addKey(key, _T("Parameters")); CArchMiscWindows::closeKey(key); return (key != NULL); } } bool CArchDaemonWindows::isDaemonInstalled(const char* name, bool allUsers) { // open service manager SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_READ); if (mgr == NULL) { return false; } // open the service SC_HANDLE service = OpenService(mgr, name, GENERIC_READ); // clean up if (service != NULL) { CloseServiceHandle(service); } CloseServiceHandle(mgr); return (service != NULL); } HKEY CArchDaemonWindows::openNTServicesKey() { static const char* s_keyNames[] = { _T("SYSTEM"), _T("CurrentControlSet"), _T("Services"), NULL }; return CArchMiscWindows::addKey(HKEY_LOCAL_MACHINE, s_keyNames); } HKEY CArchDaemonWindows::open95ServicesKey() { static const char* s_keyNames[] = { _T("Software"), _T("Microsoft"), _T("Windows"), _T("CurrentVersion"), _T("RunServices"), NULL }; return CArchMiscWindows::addKey(HKEY_LOCAL_MACHINE, s_keyNames); } HKEY CArchDaemonWindows::openUserStartupKey() { static const char* s_keyNames[] = { _T("Software"), _T("Microsoft"), _T("Windows"), _T("CurrentVersion"), _T("Run"), NULL }; return CArchMiscWindows::addKey(HKEY_CURRENT_USER, s_keyNames); } bool CArchDaemonWindows::isRunState(DWORD state) { switch (state) { case SERVICE_START_PENDING: case SERVICE_CONTINUE_PENDING: case SERVICE_RUNNING: return true; default: return false; } } int CArchDaemonWindows::doRunDaemon(RunFunc run) { // should only be called from DaemonFunc assert(m_serviceMutex != NULL); assert(run != NULL); // create message queue for this thread MSG dummy; PeekMessage(&dummy, NULL, 0, 0, PM_NOREMOVE); int result = 0; ARCH->lockMutex(m_serviceMutex); m_daemonThreadID = GetCurrentThreadId(); while (m_serviceState != SERVICE_STOPPED) { // wait until we're told to start while (!isRunState(m_serviceState) && m_serviceState != SERVICE_STOP_PENDING) { ARCH->waitCondVar(m_serviceCondVar, m_serviceMutex, -1.0); } // run unless told to stop if (m_serviceState != SERVICE_STOP_PENDING) { ARCH->unlockMutex(m_serviceMutex); try { result = run(); } catch (...) { ARCH->lockMutex(m_serviceMutex); setStatusError(0); m_serviceState = SERVICE_STOPPED; setStatus(m_serviceState); ARCH->broadcastCondVar(m_serviceCondVar); ARCH->unlockMutex(m_serviceMutex); throw; } ARCH->lockMutex(m_serviceMutex); } // notify of new state if (m_serviceState == SERVICE_PAUSE_PENDING) { m_serviceState = SERVICE_PAUSED; } else { m_serviceState = SERVICE_STOPPED; } setStatus(m_serviceState); ARCH->broadcastCondVar(m_serviceCondVar); } ARCH->unlockMutex(m_serviceMutex); return result; } void CArchDaemonWindows::doDaemonRunning(bool running) { ARCH->lockMutex(m_serviceMutex); if (running) { m_serviceState = SERVICE_RUNNING; setStatus(m_serviceState); ARCH->broadcastCondVar(m_serviceCondVar); } ARCH->unlockMutex(m_serviceMutex); } UINT CArchDaemonWindows::doGetDaemonQuitMessage() { return m_quitMessage; } void CArchDaemonWindows::setStatus(DWORD state) { setStatus(state, 0, 0); } void CArchDaemonWindows::setStatus(DWORD state, DWORD step, DWORD waitHint) { assert(s_daemon != NULL); SERVICE_STATUS status; status.dwServiceType = SERVICE_WIN32_OWN_PROCESS | SERVICE_INTERACTIVE_PROCESS; status.dwCurrentState = state; status.dwControlsAccepted = SERVICE_ACCEPT_STOP | SERVICE_ACCEPT_PAUSE_CONTINUE | SERVICE_ACCEPT_SHUTDOWN; status.dwWin32ExitCode = NO_ERROR; status.dwServiceSpecificExitCode = 0; status.dwCheckPoint = step; status.dwWaitHint = waitHint; SetServiceStatus(s_daemon->m_statusHandle, &status); } void CArchDaemonWindows::setStatusError(DWORD error) { assert(s_daemon != NULL); SERVICE_STATUS status; status.dwServiceType = SERVICE_WIN32_OWN_PROCESS | SERVICE_INTERACTIVE_PROCESS; status.dwCurrentState = SERVICE_STOPPED; status.dwControlsAccepted = SERVICE_ACCEPT_STOP | SERVICE_ACCEPT_PAUSE_CONTINUE | SERVICE_ACCEPT_SHUTDOWN; status.dwWin32ExitCode = ERROR_SERVICE_SPECIFIC_ERROR; status.dwServiceSpecificExitCode = error; status.dwCheckPoint = 0; status.dwWaitHint = 0; SetServiceStatus(s_daemon->m_statusHandle, &status); } void CArchDaemonWindows::serviceMain(DWORD argc, LPTSTR* argvIn) { typedef std::vector ArgList; typedef std::vector Arguments; const char** argv = const_cast(argvIn); // create synchronization objects m_serviceMutex = ARCH->newMutex(); m_serviceCondVar = ARCH->newCondVar(); // register our service handler function m_statusHandle = RegisterServiceCtrlHandler(argv[0], &CArchDaemonWindows::serviceHandlerEntry); if (m_statusHandle == 0) { // cannot start as service m_daemonResult = -1; ARCH->closeCondVar(m_serviceCondVar); ARCH->closeMutex(m_serviceMutex); return; } // tell service control manager that we're starting m_serviceState = SERVICE_START_PENDING; setStatus(m_serviceState, 0, 10000); std::string commandLine; // if no arguments supplied then try getting them from the registry. // the first argument doesn't count because it's the service name. Arguments args; ArgList myArgv; if (argc <= 1) { // read command line HKEY key = openNTServicesKey(); key = CArchMiscWindows::openKey(key, argvIn[0]); key = CArchMiscWindows::openKey(key, _T("Parameters")); if (key != NULL) { commandLine = CArchMiscWindows::readValueString(key, _T("CommandLine")); } // if the command line isn't empty then parse and use it if (!commandLine.empty()) { // parse, honoring double quoted substrings std::string::size_type i = commandLine.find_first_not_of(" \t"); while (i != std::string::npos && i != commandLine.size()) { // find end of string std::string::size_type e; if (commandLine[i] == '\"') { // quoted. find closing quote. ++i; e = commandLine.find("\"", i); // whitespace must follow closing quote if (e == std::string::npos || (e + 1 != commandLine.size() && commandLine[e + 1] != ' ' && commandLine[e + 1] != '\t')) { args.clear(); break; } // extract args.push_back(commandLine.substr(i, e - i)); i = e + 1; } else { // unquoted. find next whitespace. e = commandLine.find_first_of(" \t", i); if (e == std::string::npos) { e = commandLine.size(); } // extract args.push_back(commandLine.substr(i, e - i)); i = e + 1; } // next argument i = commandLine.find_first_not_of(" \t", i); } // service name goes first myArgv.push_back(argv[0]); // get pointers for (size_t j = 0; j < args.size(); ++j) { myArgv.push_back(args[j].c_str()); } // adjust argc/argv argc = (DWORD)myArgv.size(); argv = &myArgv[0]; } } m_commandLine = commandLine; try { // invoke daemon function m_daemonResult = m_daemonFunc(static_cast(argc), argv); } catch (XArchDaemonRunFailed& e) { setStatusError(e.m_result); m_daemonResult = -1; } catch (...) { setStatusError(1); m_daemonResult = -1; } // clean up ARCH->closeCondVar(m_serviceCondVar); ARCH->closeMutex(m_serviceMutex); // we're going to exit now, so set status to stopped m_serviceState = SERVICE_STOPPED; setStatus(m_serviceState, 0, 10000); } void WINAPI CArchDaemonWindows::serviceMainEntry(DWORD argc, LPTSTR* argv) { s_daemon->serviceMain(argc, argv); } void CArchDaemonWindows::serviceHandler(DWORD ctrl) { assert(m_serviceMutex != NULL); assert(m_serviceCondVar != NULL); ARCH->lockMutex(m_serviceMutex); // ignore request if service is already stopped if (s_daemon == NULL || m_serviceState == SERVICE_STOPPED) { if (s_daemon != NULL) { setStatus(m_serviceState); } ARCH->unlockMutex(m_serviceMutex); return; } switch (ctrl) { case SERVICE_CONTROL_PAUSE: m_serviceState = SERVICE_PAUSE_PENDING; setStatus(m_serviceState, 0, 5000); PostThreadMessage(m_daemonThreadID, m_quitMessage, 0, 0); while (isRunState(m_serviceState)) { ARCH->waitCondVar(m_serviceCondVar, m_serviceMutex, -1.0); } break; case SERVICE_CONTROL_CONTINUE: // FIXME -- maybe should flush quit messages from queue m_serviceState = SERVICE_CONTINUE_PENDING; setStatus(m_serviceState, 0, 5000); ARCH->broadcastCondVar(m_serviceCondVar); break; case SERVICE_CONTROL_STOP: case SERVICE_CONTROL_SHUTDOWN: m_serviceState = SERVICE_STOP_PENDING; setStatus(m_serviceState, 0, 5000); PostThreadMessage(m_daemonThreadID, m_quitMessage, 0, 0); ARCH->broadcastCondVar(m_serviceCondVar); while (isRunState(m_serviceState)) { ARCH->waitCondVar(m_serviceCondVar, m_serviceMutex, -1.0); } break; default: // unknown service command // fall through case SERVICE_CONTROL_INTERROGATE: setStatus(m_serviceState); break; } ARCH->unlockMutex(m_serviceMutex); } void WINAPI CArchDaemonWindows::serviceHandlerEntry(DWORD ctrl) { s_daemon->serviceHandler(ctrl); } void CArchDaemonWindows::start(const char* name) { // open service manager SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_READ); if (mgr == NULL) { throw XArchDaemonFailed(new XArchEvalWindows()); } // open the service SC_HANDLE service = OpenService( mgr, name, SERVICE_START); if (service == NULL) { CloseServiceHandle(mgr); throw XArchDaemonFailed(new XArchEvalWindows()); } // start the service if (!StartService(service, 0, NULL)) { throw XArchDaemonFailed(new XArchEvalWindows()); } } void CArchDaemonWindows::stop(const char* name) { // open service manager SC_HANDLE mgr = OpenSCManager(NULL, NULL, GENERIC_READ); if (mgr == NULL) { throw XArchDaemonFailed(new XArchEvalWindows()); } // open the service SC_HANDLE service = OpenService( mgr, name, SERVICE_STOP | SERVICE_QUERY_STATUS); if (service == NULL) { CloseServiceHandle(mgr); throw XArchDaemonFailed(new XArchEvalWindows()); } // ask the service to stop, asynchronously SERVICE_STATUS ss; if (!ControlService(service, SERVICE_CONTROL_STOP, &ss)) { DWORD dwErrCode = GetLastError(); if (dwErrCode != ERROR_SERVICE_NOT_ACTIVE) { throw XArchDaemonFailed(new XArchEvalWindows()); } } } void CArchDaemonWindows::installDaemon() { // install default daemon if not already installed. if (!isDaemonInstalled(DEFAULT_DAEMON_NAME, true)) { char path[MAX_PATH]; GetModuleFileName(CArchMiscWindows::instanceWin32(), path, MAX_PATH); installDaemon(DEFAULT_DAEMON_NAME, DEFAULT_DAEMON_INFO, path, "", "", true); } start(DEFAULT_DAEMON_NAME); } void CArchDaemonWindows::uninstallDaemon() { // remove legacy services if installed. if (isDaemonInstalled(LEGACY_SERVER_DAEMON_NAME, true)) { uninstallDaemon(LEGACY_SERVER_DAEMON_NAME, true); } if (isDaemonInstalled(LEGACY_CLIENT_DAEMON_NAME, true)) { uninstallDaemon(LEGACY_CLIENT_DAEMON_NAME, true); } // remove new service if installed. if (isDaemonInstalled(DEFAULT_DAEMON_NAME, true)) { uninstallDaemon(DEFAULT_DAEMON_NAME, true); } } synergy-1.4.12-Source/src/lib/arch/CArchDaemonWindows.h0000600000175000017500000001125612021261364022613 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHDAEMONWINDOWS_H #define CARCHDAEMONWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "IArchDaemon.h" #include "IArchMultithread.h" #include "stdstring.h" #include #include #define ARCH_DAEMON CArchDaemonWindows //! Win32 implementation of IArchDaemon class CArchDaemonWindows : public IArchDaemon { public: typedef int (*RunFunc)(void); CArchDaemonWindows(); virtual ~CArchDaemonWindows(); //! Run the daemon /*! When the client calls \c daemonize(), the \c DaemonFunc should call this function after initialization and argument parsing to perform the daemon processing. The \c runFunc should perform the daemon's main loop, calling \c daemonRunning(true) when it enters the main loop (i.e. after initialization) and \c daemonRunning(false) when it leaves the main loop. The \c runFunc is called in a new thread and when the daemon must exit the main loop due to some external control the getDaemonQuitMessage() is posted to the thread. This function returns what \c runFunc returns. \c runFunc should call \c daemonFailed() if the daemon fails. */ static int runDaemon(RunFunc runFunc); //! Indicate daemon is in main loop /*! The \c runFunc passed to \c runDaemon() should call this function to indicate when it has entered (\c running is \c true) or exited (\c running is \c false) the main loop. */ static void daemonRunning(bool running); //! Indicate failure of running daemon /*! The \c runFunc passed to \c runDaemon() should call this function to indicate failure. \c result is returned by \c daemonize(). */ static void daemonFailed(int result); //! Get daemon quit message /*! The windows NT daemon tells daemon thread to exit by posting this message to it. The thread must, of course, have a message queue for this to work. */ static UINT getDaemonQuitMessage(); // IArchDaemon overrides virtual void installDaemon(const char* name, const char* description, const char* pathname, const char* commandLine, const char* dependencies, bool allUsers); virtual void uninstallDaemon(const char* name, bool allUsers); virtual void installDaemon(); virtual void uninstallDaemon(); virtual int daemonize(const char* name, DaemonFunc func); virtual bool canInstallDaemon(const char* name, bool allUsers); virtual bool isDaemonInstalled(const char* name, bool allUsers); std::string commandLine() const { return m_commandLine; } private: static HKEY openNTServicesKey(); static HKEY open95ServicesKey(); static HKEY openUserStartupKey(); int doRunDaemon(RunFunc runFunc); void doDaemonRunning(bool running); UINT doGetDaemonQuitMessage(); static void setStatus(DWORD state); static void setStatus(DWORD state, DWORD step, DWORD waitHint); static void setStatusError(DWORD error); static bool isRunState(DWORD state); void serviceMain(DWORD, LPTSTR*); static void WINAPI serviceMainEntry(DWORD, LPTSTR*); void serviceHandler(DWORD ctrl); static void WINAPI serviceHandlerEntry(DWORD ctrl); void start(const char* name); void stop(const char* name); private: class XArchDaemonRunFailed { public: XArchDaemonRunFailed(int result) : m_result(result) { } public: int m_result; }; private: static CArchDaemonWindows* s_daemon; CArchMutex m_serviceMutex; CArchCond m_serviceCondVar; DWORD m_serviceState; bool m_serviceHandlerWaiting; bool m_serviceRunning; DWORD m_daemonThreadID; DaemonFunc m_daemonFunc; int m_daemonResult; SERVICE_STATUS_HANDLE m_statusHandle; UINT m_quitMessage; std::string m_commandLine; }; #define DEFAULT_DAEMON_NAME _T("Synergy") #define DEFAULT_DAEMON_INFO _T("Manages the Synergy foreground processes.") #define LEGACY_SERVER_DAEMON_NAME _T("Synergy Server") #define LEGACY_CLIENT_DAEMON_NAME _T("Synergy Client") static const TCHAR* const g_daemonKeyPath[] = { _T("SOFTWARE"), _T("The Synergy Project"), _T("Synergy"), _T("Service"), NULL }; #endif synergy-1.4.12-Source/src/lib/arch/CArchFileUnix.cpp0000600000175000017500000000413512021261364022111 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchFileUnix.h" #include #include #include #include #include // // CArchFileUnix // CArchFileUnix::CArchFileUnix() { // do nothing } CArchFileUnix::~CArchFileUnix() { // do nothing } const char* CArchFileUnix::getBasename(const char* pathname) { if (pathname == NULL) { return NULL; } const char* basename = strrchr(pathname, '/'); if (basename != NULL) { return basename + 1; } else { return pathname; } } std::string CArchFileUnix::getUserDirectory() { char* buffer = NULL; std::string dir; #if HAVE_GETPWUID_R struct passwd pwent; struct passwd* pwentp; #if defined(_SC_GETPW_R_SIZE_MAX) long size = sysconf(_SC_GETPW_R_SIZE_MAX); if (size == -1) { size = BUFSIZ; } #else long size = BUFSIZ; #endif buffer = new char[size]; getpwuid_r(getuid(), &pwent, buffer, size, &pwentp); #else struct passwd* pwentp = getpwuid(getuid()); #endif if (pwentp != NULL && pwentp->pw_dir != NULL) { dir = pwentp->pw_dir; } delete[] buffer; return dir; } std::string CArchFileUnix::getSystemDirectory() { return "/etc"; } std::string CArchFileUnix::concatPath(const std::string& prefix, const std::string& suffix) { std::string path; path.reserve(prefix.size() + 1 + suffix.size()); path += prefix; if (path.size() == 0 || path[path.size() - 1] != '/') { path += '/'; } path += suffix; return path; } synergy-1.4.12-Source/src/lib/arch/CArchFileUnix.h0000600000175000017500000000233212021261364021553 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHFILEUNIX_H #define CARCHFILEUNIX_H #include "IArchFile.h" #define ARCH_FILE CArchFileUnix //! Unix implementation of IArchFile class CArchFileUnix : public IArchFile { public: CArchFileUnix(); virtual ~CArchFileUnix(); // IArchFile overrides virtual const char* getBasename(const char* pathname); virtual std::string getUserDirectory(); virtual std::string getSystemDirectory(); virtual std::string concatPath(const std::string& prefix, const std::string& suffix); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchFileWindows.cpp0000600000175000017500000000611212021261364022615 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchFileWindows.h" #include #include #include #include // // CArchFileWindows // CArchFileWindows::CArchFileWindows() { // do nothing } CArchFileWindows::~CArchFileWindows() { // do nothing } const char* CArchFileWindows::getBasename(const char* pathname) { if (pathname == NULL) { return NULL; } // check for last slash const char* basename = strrchr(pathname, '/'); if (basename != NULL) { ++basename; } else { basename = pathname; } // check for last backslash const char* basename2 = strrchr(pathname, '\\'); if (basename2 != NULL && basename2 > basename) { basename = basename2 + 1; } return basename; } std::string CArchFileWindows::getUserDirectory() { // try %HOMEPATH% TCHAR dir[MAX_PATH]; DWORD size = sizeof(dir) / sizeof(TCHAR); DWORD result = GetEnvironmentVariable(_T("HOMEPATH"), dir, size); if (result != 0 && result <= size) { // sanity check -- if dir doesn't appear to start with a // drive letter and isn't a UNC name then don't use it // FIXME -- allow UNC names if (dir[0] != '\0' && (dir[1] == ':' || ((dir[0] == '\\' || dir[0] == '/') && (dir[1] == '\\' || dir[1] == '/')))) { return dir; } } // get the location of the personal files. that's as close to // a home directory as we're likely to find. ITEMIDLIST* idl; if (SUCCEEDED(SHGetSpecialFolderLocation(NULL, CSIDL_PERSONAL, &idl))) { TCHAR* path = NULL; if (SHGetPathFromIDList(idl, dir)) { DWORD attr = GetFileAttributes(dir); if (attr != 0xffffffff && (attr & FILE_ATTRIBUTE_DIRECTORY) != 0) path = dir; } IMalloc* shalloc; if (SUCCEEDED(SHGetMalloc(&shalloc))) { shalloc->Free(idl); shalloc->Release(); } if (path != NULL) { return path; } } // use root of C drive as a default return "C:"; } std::string CArchFileWindows::getSystemDirectory() { // get windows directory char dir[MAX_PATH]; if (GetWindowsDirectory(dir, sizeof(dir)) != 0) { return dir; } else { // can't get it. use C:\ as a default. return "C:"; } } std::string CArchFileWindows::concatPath(const std::string& prefix, const std::string& suffix) { std::string path; path.reserve(prefix.size() + 1 + suffix.size()); path += prefix; if (path.size() == 0 || (path[path.size() - 1] != '\\' && path[path.size() - 1] != '/')) { path += '\\'; } path += suffix; return path; } synergy-1.4.12-Source/src/lib/arch/CArchFileWindows.h0000600000175000017500000000235512021261364022267 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHFILEWINDOWS_H #define CARCHFILEWINDOWS_H #include "IArchFile.h" #define ARCH_FILE CArchFileWindows //! Win32 implementation of IArchFile class CArchFileWindows : public IArchFile { public: CArchFileWindows(); virtual ~CArchFileWindows(); // IArchFile overrides virtual const char* getBasename(const char* pathname); virtual std::string getUserDirectory(); virtual std::string getSystemDirectory(); virtual std::string concatPath(const std::string& prefix, const std::string& suffix); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchLogUnix.cpp0000600000175000017500000000271012021261364021750 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchLogUnix.h" #include // // CArchLogUnix // CArchLogUnix::CArchLogUnix() { // do nothing } CArchLogUnix::~CArchLogUnix() { // do nothing } void CArchLogUnix::openLog(const char* name) { openlog(name, 0, LOG_DAEMON); } void CArchLogUnix::closeLog() { closelog(); } void CArchLogUnix::showLog(bool) { // do nothing } void CArchLogUnix::writeLog(ELevel level, const char* msg) { // convert level int priority; switch (level) { case kERROR: priority = LOG_ERR; break; case kWARNING: priority = LOG_WARNING; break; case kNOTE: priority = LOG_NOTICE; break; case kINFO: priority = LOG_INFO; break; default: priority = LOG_DEBUG; break; } // log it syslog(priority, "%s", msg); } synergy-1.4.12-Source/src/lib/arch/CArchLogUnix.h0000600000175000017500000000216612021261364021422 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHLOGUNIX_H #define CARCHLOGUNIX_H #include "IArchLog.h" #define ARCH_LOG CArchLogUnix //! Unix implementation of IArchLog class CArchLogUnix : public IArchLog { public: CArchLogUnix(); virtual ~CArchLogUnix(); // IArchLog overrides virtual void openLog(const char* name); virtual void closeLog(); virtual void showLog(bool); virtual void writeLog(ELevel, const char*); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchLogWindows.cpp0000600000175000017500000000420412021261364022457 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchLogWindows.h" #include "CArchMiscWindows.h" #include // // CArchLogWindows // CArchLogWindows::CArchLogWindows() : m_eventLog(NULL) { // do nothing } CArchLogWindows::~CArchLogWindows() { // do nothing } void CArchLogWindows::openLog(const char* name) { if (m_eventLog == NULL && !CArchMiscWindows::isWindows95Family()) { m_eventLog = RegisterEventSource(NULL, name); } } void CArchLogWindows::closeLog() { if (m_eventLog != NULL) { DeregisterEventSource(m_eventLog); m_eventLog = NULL; } } void CArchLogWindows::showLog(bool) { // do nothing } void CArchLogWindows::writeLog(ELevel level, const char* msg) { if (m_eventLog != NULL) { // convert priority WORD type; switch (level) { case kERROR: type = EVENTLOG_ERROR_TYPE; break; case kWARNING: type = EVENTLOG_WARNING_TYPE; break; default: type = EVENTLOG_INFORMATION_TYPE; break; } // log it // FIXME -- win32 wants to use a message table to look up event // strings. log messages aren't organized that way so we'll // just dump our string into the raw data section of the event // so users can at least see the message. note that we use our // level as the event category. ReportEvent(m_eventLog, type, static_cast(level), 0, // event ID NULL, 0, (DWORD)strlen(msg) + 1, // raw data size NULL, const_cast(msg));// raw data } } synergy-1.4.12-Source/src/lib/arch/CArchLogWindows.h0000600000175000017500000000235012021261364022124 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHLOGWINDOWS_H #define CARCHLOGWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "IArchLog.h" #include #define ARCH_LOG CArchLogWindows //! Win32 implementation of IArchLog class CArchLogWindows : public IArchLog { public: CArchLogWindows(); virtual ~CArchLogWindows(); // IArchLog overrides virtual void openLog(const char* name); virtual void closeLog(); virtual void showLog(bool showIfEmpty); virtual void writeLog(ELevel, const char*); private: HANDLE m_eventLog; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchMiscWindows.cpp0000600000175000017500000003001412021261364022627 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchMiscWindows.h" #include "CArchDaemonWindows.h" #include "CLog.h" #include #pragma warning(disable: 4099) #include #pragma warning(default: 4099) #include "Version.h" // parent process name for services in Vista #define SERVICE_LAUNCHER "services.exe" #ifndef ES_SYSTEM_REQUIRED #define ES_SYSTEM_REQUIRED ((DWORD)0x00000001) #endif #ifndef ES_DISPLAY_REQUIRED #define ES_DISPLAY_REQUIRED ((DWORD)0x00000002) #endif #ifndef ES_CONTINUOUS #define ES_CONTINUOUS ((DWORD)0x80000000) #endif typedef DWORD EXECUTION_STATE; // // CArchMiscWindows // CArchMiscWindows::CDialogs* CArchMiscWindows::s_dialogs = NULL; DWORD CArchMiscWindows::s_busyState = 0; CArchMiscWindows::STES_t CArchMiscWindows::s_stes = NULL; HICON CArchMiscWindows::s_largeIcon = NULL; HICON CArchMiscWindows::s_smallIcon = NULL; HINSTANCE CArchMiscWindows::s_instanceWin32 = NULL; void CArchMiscWindows::cleanup() { delete s_dialogs; } void CArchMiscWindows::init() { s_dialogs = new CDialogs; isWindows95Family(); } bool CArchMiscWindows::isWindows95Family() { static bool init = false; static bool result = false; if (!init) { OSVERSIONINFO version; version.dwOSVersionInfoSize = sizeof(version); if (GetVersionEx(&version) == 0) { // cannot determine OS; assume windows 95 family result = true; } else { result = (version.dwPlatformId == VER_PLATFORM_WIN32_WINDOWS); } init = true; } return result; } bool CArchMiscWindows::isWindowsModern() { static bool init = false; static bool result = false; if (!init) { OSVERSIONINFO version; version.dwOSVersionInfoSize = sizeof(version); if (GetVersionEx(&version) == 0) { // cannot determine OS; assume not modern result = false; } else { result = ((version.dwPlatformId == VER_PLATFORM_WIN32_WINDOWS && version.dwMajorVersion == 4 && version.dwMinorVersion > 0) || (version.dwPlatformId == VER_PLATFORM_WIN32_NT && version.dwMajorVersion > 4)); } init = true; } return result; } void CArchMiscWindows::setIcons(HICON largeIcon, HICON smallIcon) { s_largeIcon = largeIcon; s_smallIcon = smallIcon; } void CArchMiscWindows::getIcons(HICON& largeIcon, HICON& smallIcon) { largeIcon = s_largeIcon; smallIcon = s_smallIcon; } int CArchMiscWindows::runDaemon(RunFunc runFunc) { return CArchDaemonWindows::runDaemon(runFunc); } void CArchMiscWindows::daemonRunning(bool running) { CArchDaemonWindows::daemonRunning(running); } void CArchMiscWindows::daemonFailed(int result) { CArchDaemonWindows::daemonFailed(result); } UINT CArchMiscWindows::getDaemonQuitMessage() { return CArchDaemonWindows::getDaemonQuitMessage(); } HKEY CArchMiscWindows::openKey(HKEY key, const TCHAR* keyName) { return openKey(key, keyName, false); } HKEY CArchMiscWindows::openKey(HKEY key, const TCHAR* const* keyNames) { return openKey(key, keyNames, false); } HKEY CArchMiscWindows::addKey(HKEY key, const TCHAR* keyName) { return openKey(key, keyName, true); } HKEY CArchMiscWindows::addKey(HKEY key, const TCHAR* const* keyNames) { return openKey(key, keyNames, true); } HKEY CArchMiscWindows::openKey(HKEY key, const TCHAR* keyName, bool create) { // ignore if parent is NULL if (key == NULL) { return NULL; } // open next key HKEY newKey; LONG result = RegOpenKeyEx(key, keyName, 0, KEY_WRITE | KEY_QUERY_VALUE, &newKey); if (result != ERROR_SUCCESS && create) { DWORD disp; result = RegCreateKeyEx(key, keyName, 0, TEXT(""), 0, KEY_WRITE | KEY_QUERY_VALUE, NULL, &newKey, &disp); } if (result != ERROR_SUCCESS) { RegCloseKey(key); return NULL; } // switch to new key RegCloseKey(key); return newKey; } HKEY CArchMiscWindows::openKey(HKEY key, const TCHAR* const* keyNames, bool create) { for (size_t i = 0; key != NULL && keyNames[i] != NULL; ++i) { // open next key key = openKey(key, keyNames[i], create); } return key; } void CArchMiscWindows::closeKey(HKEY key) { assert(key != NULL); if (key==NULL) return; RegCloseKey(key); } void CArchMiscWindows::deleteKey(HKEY key, const TCHAR* name) { assert(key != NULL); assert(name != NULL); if (key==NULL || name==NULL) return; RegDeleteKey(key, name); } void CArchMiscWindows::deleteValue(HKEY key, const TCHAR* name) { assert(key != NULL); assert(name != NULL); if (key==NULL || name==NULL) return; RegDeleteValue(key, name); } bool CArchMiscWindows::hasValue(HKEY key, const TCHAR* name) { DWORD type; LONG result = RegQueryValueEx(key, name, 0, &type, NULL, NULL); return (result == ERROR_SUCCESS && (type == REG_DWORD || type == REG_SZ)); } CArchMiscWindows::EValueType CArchMiscWindows::typeOfValue(HKEY key, const TCHAR* name) { DWORD type; LONG result = RegQueryValueEx(key, name, 0, &type, NULL, NULL); if (result != ERROR_SUCCESS) { return kNO_VALUE; } switch (type) { case REG_DWORD: return kUINT; case REG_SZ: return kSTRING; case REG_BINARY: return kBINARY; default: return kUNKNOWN; } } void CArchMiscWindows::setValue(HKEY key, const TCHAR* name, const std::string& value) { assert(key != NULL); assert(name != NULL); if(key ==NULL || name==NULL) return; // TODO: throw exception RegSetValueEx(key, name, 0, REG_SZ, reinterpret_cast(value.c_str()), (DWORD)value.size() + 1); } void CArchMiscWindows::setValue(HKEY key, const TCHAR* name, DWORD value) { assert(key != NULL); assert(name != NULL); if(key ==NULL || name==NULL) return; // TODO: throw exception RegSetValueEx(key, name, 0, REG_DWORD, reinterpret_cast(&value), sizeof(DWORD)); } void CArchMiscWindows::setValueBinary(HKEY key, const TCHAR* name, const std::string& value) { assert(key != NULL); assert(name != NULL); if(key ==NULL || name==NULL) return; // TODO: throw exception RegSetValueEx(key, name, 0, REG_BINARY, reinterpret_cast(value.data()), (DWORD)value.size()); } std::string CArchMiscWindows::readBinaryOrString(HKEY key, const TCHAR* name, DWORD type) { // get the size of the string DWORD actualType; DWORD size = 0; LONG result = RegQueryValueEx(key, name, 0, &actualType, NULL, &size); if (result != ERROR_SUCCESS || actualType != type) { return std::string(); } // if zero size then return empty string if (size == 0) { return std::string(); } // allocate space char* buffer = new char[size]; // read it result = RegQueryValueEx(key, name, 0, &actualType, reinterpret_cast(buffer), &size); if (result != ERROR_SUCCESS || actualType != type) { delete[] buffer; return std::string(); } // clean up and return value if (type == REG_SZ && buffer[size - 1] == '\0') { // don't include terminating nul; std::string will add one. --size; } std::string value(buffer, size); delete[] buffer; return value; } std::string CArchMiscWindows::readValueString(HKEY key, const TCHAR* name) { return readBinaryOrString(key, name, REG_SZ); } std::string CArchMiscWindows::readValueBinary(HKEY key, const TCHAR* name) { return readBinaryOrString(key, name, REG_BINARY); } DWORD CArchMiscWindows::readValueInt(HKEY key, const TCHAR* name) { DWORD type; DWORD value; DWORD size = sizeof(value); LONG result = RegQueryValueEx(key, name, 0, &type, reinterpret_cast(&value), &size); if (result != ERROR_SUCCESS || type != REG_DWORD) { return 0; } return value; } void CArchMiscWindows::addDialog(HWND hwnd) { s_dialogs->insert(hwnd); } void CArchMiscWindows::removeDialog(HWND hwnd) { s_dialogs->erase(hwnd); } bool CArchMiscWindows::processDialog(MSG* msg) { for (CDialogs::const_iterator index = s_dialogs->begin(); index != s_dialogs->end(); ++index) { if (IsDialogMessage(*index, msg)) { return true; } } return false; } void CArchMiscWindows::addBusyState(DWORD busyModes) { s_busyState |= busyModes; setThreadExecutionState(s_busyState); } void CArchMiscWindows::removeBusyState(DWORD busyModes) { s_busyState &= ~busyModes; setThreadExecutionState(s_busyState); } void CArchMiscWindows::setThreadExecutionState(DWORD busyModes) { // look up function dynamically so we work on older systems if (s_stes == NULL) { HINSTANCE kernel = LoadLibrary("kernel32.dll"); if (kernel != NULL) { s_stes = reinterpret_cast(GetProcAddress(kernel, "SetThreadExecutionState")); } if (s_stes == NULL) { s_stes = &CArchMiscWindows::dummySetThreadExecutionState; } } // convert to STES form EXECUTION_STATE state = 0; if ((busyModes & kSYSTEM) != 0) { state |= ES_SYSTEM_REQUIRED; } if ((busyModes & kDISPLAY) != 0) { state |= ES_DISPLAY_REQUIRED; } if (state != 0) { state |= ES_CONTINUOUS; } // do it s_stes(state); } DWORD CArchMiscWindows::dummySetThreadExecutionState(DWORD) { // do nothing return 0; } void CArchMiscWindows::wakeupDisplay() { // We can't use ::setThreadExecutionState here because it sets // ES_CONTINUOUS, which we don't want. if (s_stes == NULL) { HINSTANCE kernel = LoadLibrary("kernel32.dll"); if (kernel != NULL) { s_stes = reinterpret_cast(GetProcAddress(kernel, "SetThreadExecutionState")); } if (s_stes == NULL) { s_stes = &CArchMiscWindows::dummySetThreadExecutionState; } } s_stes(ES_DISPLAY_REQUIRED); // restore the original execution states setThreadExecutionState(s_busyState); } bool CArchMiscWindows::wasLaunchedAsService() { CString name; if (!getParentProcessName(name)) { LOG((CLOG_ERR "cannot determine if process was launched as service")); return false; } return (name == SERVICE_LAUNCHER); } bool CArchMiscWindows::getParentProcessName(CString &name) { PROCESSENTRY32 parentEntry; if (!getParentProcessEntry(parentEntry)){ LOG((CLOG_ERR "could not get entry for parent process")); return false; } name = parentEntry.szExeFile; return true; } BOOL WINAPI CArchMiscWindows::getSelfProcessEntry(PROCESSENTRY32& entry) { // get entry from current PID return getProcessEntry(entry, GetCurrentProcessId()); } BOOL WINAPI CArchMiscWindows::getParentProcessEntry(PROCESSENTRY32& entry) { // get the current process, so we can get parent PID PROCESSENTRY32 selfEntry; if (!getSelfProcessEntry(selfEntry)) { return FALSE; } // get entry from parent PID return getProcessEntry(entry, selfEntry.th32ParentProcessID); } BOOL WINAPI CArchMiscWindows::getProcessEntry(PROCESSENTRY32& entry, DWORD processID) { // first we need to take a snapshot of the running processes HANDLE snapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0); if (snapshot == INVALID_HANDLE_VALUE) { LOG((CLOG_ERR "could not get process snapshot (error: %i)", GetLastError())); return FALSE; } entry.dwSize = sizeof(PROCESSENTRY32); // get the first process, and if we can't do that then it's // unlikely we can go any further BOOL gotEntry = Process32First(snapshot, &entry); if (!gotEntry) { LOG((CLOG_ERR "could not get first process entry (error: %i)", GetLastError())); return FALSE; } while(gotEntry) { if (entry.th32ProcessID == processID) { // found current process return TRUE; } // now move on to the next entry (when we reach end, loop will stop) gotEntry = Process32Next(snapshot, &entry); } return FALSE; } HINSTANCE CArchMiscWindows::instanceWin32() { assert(s_instanceWin32 != NULL); return s_instanceWin32; } void CArchMiscWindows::setInstanceWin32(HINSTANCE instance) { assert(instance != NULL); s_instanceWin32 = instance; }synergy-1.4.12-Source/src/lib/arch/CArchMiscWindows.h0000600000175000017500000001327612021261364022307 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHMISCWINDOWS_H #define CARCHMISCWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "common.h" #include "stdstring.h" #include "stdset.h" #include #include #include "CString.h" //! Miscellaneous win32 functions. class CArchMiscWindows { public: enum EValueType { kUNKNOWN, kNO_VALUE, kUINT, kSTRING, kBINARY }; enum EBusyModes { kIDLE = 0x0000, kSYSTEM = 0x0001, kDISPLAY = 0x0002 }; typedef int (*RunFunc)(void); //! Initialize static void init(); //! Delete memory static void cleanup(); //! Test if windows 95, et al. /*! Returns true iff the platform is win95/98/me. */ static bool isWindows95Family(); //! Test if windows 95, et al. /*! Returns true iff the platform is win98 or win2k or higher (i.e. not windows 95 or windows NT). */ static bool isWindowsModern(); //! Set the application icons /*! Set the application icons. */ static void setIcons(HICON largeIcon, HICON smallIcon); //! Get the application icons /*! Get the application icons. */ static void getIcons(HICON& largeIcon, HICON& smallIcon); //! Run the daemon /*! Delegates to CArchDaemonWindows. */ static int runDaemon(RunFunc runFunc); //! Indicate daemon is in main loop /*! Delegates to CArchDaemonWindows. */ static void daemonRunning(bool running); //! Indicate failure of running daemon /*! Delegates to CArchDaemonWindows. */ static void daemonFailed(int result); //! Get daemon quit message /*! Delegates to CArchDaemonWindows. */ static UINT getDaemonQuitMessage(); //! Open and return a registry key, closing the parent key static HKEY openKey(HKEY parent, const TCHAR* child); //! Open and return a registry key, closing the parent key static HKEY openKey(HKEY parent, const TCHAR* const* keyPath); //! Open/create and return a registry key, closing the parent key static HKEY addKey(HKEY parent, const TCHAR* child); //! Open/create and return a registry key, closing the parent key static HKEY addKey(HKEY parent, const TCHAR* const* keyPath); //! Close a key static void closeKey(HKEY); //! Delete a key (which should have no subkeys) static void deleteKey(HKEY parent, const TCHAR* name); //! Delete a value static void deleteValue(HKEY parent, const TCHAR* name); //! Test if a value exists static bool hasValue(HKEY key, const TCHAR* name); //! Get type of value static EValueType typeOfValue(HKEY key, const TCHAR* name); //! Set a string value in the registry static void setValue(HKEY key, const TCHAR* name, const std::string& value); //! Set a DWORD value in the registry static void setValue(HKEY key, const TCHAR* name, DWORD value); //! Set a BINARY value in the registry /*! Sets the \p name value of \p key to \p value.data(). */ static void setValueBinary(HKEY key, const TCHAR* name, const std::string& value); //! Read a string value from the registry static std::string readValueString(HKEY, const TCHAR* name); //! Read a DWORD value from the registry static DWORD readValueInt(HKEY, const TCHAR* name); //! Read a BINARY value from the registry static std::string readValueBinary(HKEY, const TCHAR* name); //! Add a dialog static void addDialog(HWND); //! Remove a dialog static void removeDialog(HWND); //! Process dialog message /*! Checks if the message is destined for a dialog. If so the message is passed to the dialog and returns true, otherwise returns false. */ static bool processDialog(MSG*); //! Disable power saving static void addBusyState(DWORD busyModes); //! Enable power saving static void removeBusyState(DWORD busyModes); //! Briefly interrupt power saving static void wakeupDisplay(); //! Returns true if this process was launched via NT service host. static bool wasLaunchedAsService(); //! Returns true if we got the parent process name. static bool getParentProcessName(CString &name); static HINSTANCE instanceWin32(); static void setInstanceWin32(HINSTANCE instance); static BOOL WINAPI getProcessEntry(PROCESSENTRY32& entry, DWORD processID); static BOOL WINAPI getSelfProcessEntry(PROCESSENTRY32& entry); static BOOL WINAPI getParentProcessEntry(PROCESSENTRY32& entry); private: //! Open and return a registry key, closing the parent key static HKEY openKey(HKEY parent, const TCHAR* child, bool create); //! Open and return a registry key, closing the parent key static HKEY openKey(HKEY parent, const TCHAR* const* keyPath, bool create); //! Read a string value from the registry static std::string readBinaryOrString(HKEY, const TCHAR* name, DWORD type); //! Set thread busy state static void setThreadExecutionState(DWORD); static DWORD WINAPI dummySetThreadExecutionState(DWORD); private: typedef std::set CDialogs; typedef DWORD (WINAPI *STES_t)(DWORD); static CDialogs* s_dialogs; static DWORD s_busyState; static STES_t s_stes; static HICON s_largeIcon; static HICON s_smallIcon; static HINSTANCE s_instanceWin32; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchMultithreadPosix.cpp0000600000175000017500000004327412021261364023702 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchMultithreadPosix.h" #include "CArch.h" #include "XArch.h" #include #if TIME_WITH_SYS_TIME # include # include #else # if HAVE_SYS_TIME_H # include # else # include # endif #endif #include #define SIGWAKEUP SIGUSR1 #if !HAVE_PTHREAD_SIGNAL // boy, is this platform broken. forget about pthread signal // handling and let signals through to every process. synergy // will not terminate cleanly when it gets SIGTERM or SIGINT. # define pthread_sigmask sigprocmask # define pthread_kill(tid_, sig_) kill(0, (sig_)) # define sigwait(set_, sig_) # undef HAVE_POSIX_SIGWAIT # define HAVE_POSIX_SIGWAIT 1 #endif static void setSignalSet(sigset_t* sigset) { sigemptyset(sigset); sigaddset(sigset, SIGHUP); sigaddset(sigset, SIGINT); sigaddset(sigset, SIGTERM); sigaddset(sigset, SIGUSR2); } // // CArchThreadImpl // class CArchThreadImpl { public: CArchThreadImpl(); public: int m_refCount; IArchMultithread::ThreadID m_id; pthread_t m_thread; IArchMultithread::ThreadFunc m_func; void* m_userData; bool m_cancel; bool m_cancelling; bool m_exited; void* m_result; void* m_networkData; }; CArchThreadImpl::CArchThreadImpl() : m_refCount(1), m_id(0), m_func(NULL), m_userData(NULL), m_cancel(false), m_cancelling(false), m_exited(false), m_result(NULL), m_networkData(NULL) { // do nothing } // // CArchMultithreadPosix // CArchMultithreadPosix* CArchMultithreadPosix::s_instance = NULL; CArchMultithreadPosix::CArchMultithreadPosix() : m_newThreadCalled(false), m_nextID(0) { assert(s_instance == NULL); s_instance = this; // no signal handlers for (size_t i = 0; i < kNUM_SIGNALS; ++i) { m_signalFunc[i] = NULL; m_signalUserData[i] = NULL; } // create mutex for thread list m_threadMutex = newMutex(); // create thread for calling (main) thread and add it to our // list. no need to lock the mutex since we're the only thread. m_mainThread = new CArchThreadImpl; m_mainThread->m_thread = pthread_self(); insert(m_mainThread); // install SIGWAKEUP handler. this causes SIGWAKEUP to interrupt // system calls. we use that when cancelling a thread to force it // to wake up immediately if it's blocked in a system call. we // won't need this until another thread is created but it's fine // to install it now. struct sigaction act; sigemptyset(&act.sa_mask); # if defined(SA_INTERRUPT) act.sa_flags = SA_INTERRUPT; # else act.sa_flags = 0; # endif act.sa_handler = &threadCancel; sigaction(SIGWAKEUP, &act, NULL); // set desired signal dispositions. let SIGWAKEUP through but // ignore SIGPIPE (we'll handle EPIPE). sigset_t sigset; sigemptyset(&sigset); sigaddset(&sigset, SIGWAKEUP); pthread_sigmask(SIG_UNBLOCK, &sigset, NULL); sigemptyset(&sigset); sigaddset(&sigset, SIGPIPE); pthread_sigmask(SIG_BLOCK, &sigset, NULL); } CArchMultithreadPosix::~CArchMultithreadPosix() { assert(s_instance != NULL); closeMutex(m_threadMutex); s_instance = NULL; } void CArchMultithreadPosix::setNetworkDataForCurrentThread(void* data) { lockMutex(m_threadMutex); CArchThreadImpl* thread = find(pthread_self()); thread->m_networkData = data; unlockMutex(m_threadMutex); } void* CArchMultithreadPosix::getNetworkDataForThread(CArchThread thread) { lockMutex(m_threadMutex); void* data = thread->m_networkData; unlockMutex(m_threadMutex); return data; } CArchMultithreadPosix* CArchMultithreadPosix::getInstance() { return s_instance; } CArchCond CArchMultithreadPosix::newCondVar() { CArchCondImpl* cond = new CArchCondImpl; int status = pthread_cond_init(&cond->m_cond, NULL); (void)status; assert(status == 0); return cond; } void CArchMultithreadPosix::closeCondVar(CArchCond cond) { int status = pthread_cond_destroy(&cond->m_cond); (void)status; assert(status == 0); delete cond; } void CArchMultithreadPosix::signalCondVar(CArchCond cond) { int status = pthread_cond_signal(&cond->m_cond); (void)status; assert(status == 0); } void CArchMultithreadPosix::broadcastCondVar(CArchCond cond) { int status = pthread_cond_broadcast(&cond->m_cond); (void)status; assert(status == 0); } bool CArchMultithreadPosix::waitCondVar(CArchCond cond, CArchMutex mutex, double timeout) { // we can't wait on a condition variable and also wake it up for // cancellation since we don't use posix cancellation. so we // must wake up periodically to check for cancellation. we // can't simply go back to waiting after the check since the // condition may have changed and we'll have lost the signal. // so we have to return to the caller. since the caller will // always check for spurious wakeups the only drawback here is // performance: we're waking up a lot more than desired. static const double maxCancellationLatency = 0.1; if (timeout < 0.0 || timeout > maxCancellationLatency) { timeout = maxCancellationLatency; } // see if we should cancel this thread testCancelThread(); // get final time struct timeval now; gettimeofday(&now, NULL); struct timespec finalTime; finalTime.tv_sec = now.tv_sec; finalTime.tv_nsec = now.tv_usec * 1000; long timeout_sec = (long)timeout; long timeout_nsec = (long)(1.0e+9 * (timeout - timeout_sec)); finalTime.tv_sec += timeout_sec; finalTime.tv_nsec += timeout_nsec; if (finalTime.tv_nsec >= 1000000000) { finalTime.tv_nsec -= 1000000000; finalTime.tv_sec += 1; } // wait int status = pthread_cond_timedwait(&cond->m_cond, &mutex->m_mutex, &finalTime); // check for cancel again testCancelThread(); switch (status) { case 0: // success return true; case ETIMEDOUT: return false; default: assert(0 && "condition variable wait error"); return false; } } CArchMutex CArchMultithreadPosix::newMutex() { pthread_mutexattr_t attr; int status = pthread_mutexattr_init(&attr); assert(status == 0); CArchMutexImpl* mutex = new CArchMutexImpl; status = pthread_mutex_init(&mutex->m_mutex, &attr); assert(status == 0); return mutex; } void CArchMultithreadPosix::closeMutex(CArchMutex mutex) { int status = pthread_mutex_destroy(&mutex->m_mutex); (void)status; assert(status == 0); delete mutex; } void CArchMultithreadPosix::lockMutex(CArchMutex mutex) { int status = pthread_mutex_lock(&mutex->m_mutex); switch (status) { case 0: // success return; case EDEADLK: assert(0 && "lock already owned"); break; case EAGAIN: assert(0 && "too many recursive locks"); break; default: assert(0 && "unexpected error"); break; } } void CArchMultithreadPosix::unlockMutex(CArchMutex mutex) { int status = pthread_mutex_unlock(&mutex->m_mutex); switch (status) { case 0: // success return; case EPERM: assert(0 && "thread doesn't own a lock"); break; default: assert(0 && "unexpected error"); break; } } CArchThread CArchMultithreadPosix::newThread(ThreadFunc func, void* data) { assert(func != NULL); // initialize signal handler. we do this here instead of the // constructor so we can avoid daemonizing (using fork()) // when there are multiple threads. clients can safely // use condition variables and mutexes before creating a // new thread and they can safely use the only thread // they have access to, the main thread, so they really // can't tell the difference. if (!m_newThreadCalled) { m_newThreadCalled = true; #if HAVE_PTHREAD_SIGNAL startSignalHandler(); #endif } lockMutex(m_threadMutex); // create thread impl for new thread CArchThreadImpl* thread = new CArchThreadImpl; thread->m_func = func; thread->m_userData = data; // create the thread. pthread_create() on RedHat 7.2 smp fails // if passed a NULL attr so use a default attr. pthread_attr_t attr; int status = pthread_attr_init(&attr); if (status == 0) { status = pthread_create(&thread->m_thread, &attr, &CArchMultithreadPosix::threadFunc, thread); pthread_attr_destroy(&attr); } // check if thread was started if (status != 0) { // failed to start thread so clean up delete thread; thread = NULL; } else { // add thread to list insert(thread); // increment ref count to account for the thread itself refThread(thread); } // note that the child thread will wait until we release this mutex unlockMutex(m_threadMutex); return thread; } CArchThread CArchMultithreadPosix::newCurrentThread() { lockMutex(m_threadMutex); CArchThreadImpl* thread = find(pthread_self()); unlockMutex(m_threadMutex); assert(thread != NULL); return thread; } void CArchMultithreadPosix::closeThread(CArchThread thread) { assert(thread != NULL); // decrement ref count and clean up thread if no more references if (--thread->m_refCount == 0) { // detach from thread (unless it's the main thread) if (thread->m_func != NULL) { pthread_detach(thread->m_thread); } // remove thread from list lockMutex(m_threadMutex); assert(findNoRef(thread->m_thread) == thread); erase(thread); unlockMutex(m_threadMutex); // done with thread delete thread; } } CArchThread CArchMultithreadPosix::copyThread(CArchThread thread) { refThread(thread); return thread; } void CArchMultithreadPosix::cancelThread(CArchThread thread) { assert(thread != NULL); // set cancel and wakeup flags if thread can be cancelled bool wakeup = false; lockMutex(m_threadMutex); if (!thread->m_exited && !thread->m_cancelling) { thread->m_cancel = true; wakeup = true; } unlockMutex(m_threadMutex); // force thread to exit system calls if wakeup is true if (wakeup) { pthread_kill(thread->m_thread, SIGWAKEUP); } } void CArchMultithreadPosix::setPriorityOfThread(CArchThread thread, int /*n*/) { assert(thread != NULL); // FIXME } void CArchMultithreadPosix::testCancelThread() { // find current thread lockMutex(m_threadMutex); CArchThreadImpl* thread = findNoRef(pthread_self()); unlockMutex(m_threadMutex); // test cancel on thread testCancelThreadImpl(thread); } bool CArchMultithreadPosix::wait(CArchThread target, double timeout) { assert(target != NULL); lockMutex(m_threadMutex); // find current thread CArchThreadImpl* self = findNoRef(pthread_self()); // ignore wait if trying to wait on ourself if (target == self) { unlockMutex(m_threadMutex); return false; } // ref the target so it can't go away while we're watching it refThread(target); unlockMutex(m_threadMutex); try { // do first test regardless of timeout testCancelThreadImpl(self); if (isExitedThread(target)) { closeThread(target); return true; } // wait and repeat test if there's a timeout if (timeout != 0.0) { const double start = ARCH->time(); do { // wait a little ARCH->sleep(0.05); // repeat test testCancelThreadImpl(self); if (isExitedThread(target)) { closeThread(target); return true; } // repeat wait and test until timed out } while (timeout < 0.0 || (ARCH->time() - start) <= timeout); } closeThread(target); return false; } catch (...) { closeThread(target); throw; } } bool CArchMultithreadPosix::isSameThread(CArchThread thread1, CArchThread thread2) { return (thread1 == thread2); } bool CArchMultithreadPosix::isExitedThread(CArchThread thread) { lockMutex(m_threadMutex); bool exited = thread->m_exited; unlockMutex(m_threadMutex); return exited; } void* CArchMultithreadPosix::getResultOfThread(CArchThread thread) { lockMutex(m_threadMutex); void* result = thread->m_result; unlockMutex(m_threadMutex); return result; } IArchMultithread::ThreadID CArchMultithreadPosix::getIDOfThread(CArchThread thread) { return thread->m_id; } void CArchMultithreadPosix::setSignalHandler( ESignal signal, SignalFunc func, void* userData) { lockMutex(m_threadMutex); m_signalFunc[signal] = func; m_signalUserData[signal] = userData; unlockMutex(m_threadMutex); } void CArchMultithreadPosix::raiseSignal(ESignal signal) { lockMutex(m_threadMutex); if (m_signalFunc[signal] != NULL) { m_signalFunc[signal](signal, m_signalUserData[signal]); pthread_kill(m_mainThread->m_thread, SIGWAKEUP); } else if (signal == kINTERRUPT || signal == kTERMINATE) { ARCH->cancelThread(m_mainThread); } unlockMutex(m_threadMutex); } void CArchMultithreadPosix::startSignalHandler() { // set signal mask. the main thread blocks these signals and // the signal handler thread will listen for them. sigset_t sigset, oldsigset; setSignalSet(&sigset); pthread_sigmask(SIG_BLOCK, &sigset, &oldsigset); // fire up the INT and TERM signal handler thread. we could // instead arrange to catch and handle these signals but // we'd be unable to cancel the main thread since no pthread // calls are allowed in a signal handler. pthread_attr_t attr; int status = pthread_attr_init(&attr); if (status == 0) { status = pthread_create(&m_signalThread, &attr, &CArchMultithreadPosix::threadSignalHandler, NULL); pthread_attr_destroy(&attr); } if (status != 0) { // can't create thread to wait for signal so don't block // the signals. pthread_sigmask(SIG_UNBLOCK, &oldsigset, NULL); } } CArchThreadImpl* CArchMultithreadPosix::find(pthread_t thread) { CArchThreadImpl* impl = findNoRef(thread); if (impl != NULL) { refThread(impl); } return impl; } CArchThreadImpl* CArchMultithreadPosix::findNoRef(pthread_t thread) { // linear search for (CThreadList::const_iterator index = m_threadList.begin(); index != m_threadList.end(); ++index) { if ((*index)->m_thread == thread) { return *index; } } return NULL; } void CArchMultithreadPosix::insert(CArchThreadImpl* thread) { assert(thread != NULL); // thread shouldn't already be on the list assert(findNoRef(thread->m_thread) == NULL); // set thread id. note that we don't worry about m_nextID // wrapping back to 0 and duplicating thread ID's since the // likelihood of synergy running that long is vanishingly // small. thread->m_id = ++m_nextID; // append to list m_threadList.push_back(thread); } void CArchMultithreadPosix::erase(CArchThreadImpl* thread) { for (CThreadList::iterator index = m_threadList.begin(); index != m_threadList.end(); ++index) { if (*index == thread) { m_threadList.erase(index); break; } } } void CArchMultithreadPosix::refThread(CArchThreadImpl* thread) { assert(thread != NULL); assert(findNoRef(thread->m_thread) != NULL); ++thread->m_refCount; } void CArchMultithreadPosix::testCancelThreadImpl(CArchThreadImpl* thread) { assert(thread != NULL); // update cancel state lockMutex(m_threadMutex); bool cancel = false; if (thread->m_cancel && !thread->m_cancelling) { thread->m_cancelling = true; thread->m_cancel = false; cancel = true; } unlockMutex(m_threadMutex); // unwind thread's stack if cancelling if (cancel) { throw XThreadCancel(); } } void* CArchMultithreadPosix::threadFunc(void* vrep) { // get the thread CArchThreadImpl* thread = reinterpret_cast(vrep); // setup pthreads pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, NULL); pthread_setcanceltype(PTHREAD_CANCEL_DEFERRED, NULL); // run thread s_instance->doThreadFunc(thread); // terminate the thread return NULL; } void CArchMultithreadPosix::doThreadFunc(CArchThread thread) { // default priority is slightly below normal setPriorityOfThread(thread, 1); // wait for parent to initialize this object lockMutex(m_threadMutex); unlockMutex(m_threadMutex); void* result = NULL; try { // go result = (*thread->m_func)(thread->m_userData); } catch (XThreadCancel&) { // client called cancel() } catch (...) { // note -- don't catch (...) to avoid masking bugs lockMutex(m_threadMutex); thread->m_exited = true; unlockMutex(m_threadMutex); closeThread(thread); throw; } // thread has exited lockMutex(m_threadMutex); thread->m_result = result; thread->m_exited = true; unlockMutex(m_threadMutex); // done with thread closeThread(thread); } void CArchMultithreadPosix::threadCancel(int) { // do nothing } void* CArchMultithreadPosix::threadSignalHandler(void*) { // detach pthread_detach(pthread_self()); // add signal to mask sigset_t sigset; setSignalSet(&sigset); // also wait on SIGABRT. on linux (others?) this thread (process) // will persist after all the other threads evaporate due to an // assert unless we wait on SIGABRT. that means our resources (like // the socket we're listening on) are not released and never will be // until the lingering thread is killed. i don't know why sigwait() // should protect the thread from being killed. note that sigwait() // doesn't actually return if we receive SIGABRT and, for some // reason, we don't have to block SIGABRT. sigaddset(&sigset, SIGABRT); // we exit the loop via thread cancellation in sigwait() for (;;) { // wait #if HAVE_POSIX_SIGWAIT int signal = 0; sigwait(&sigset, &signal); #else sigwait(&sigset); #endif // if we get here then the signal was raised switch (signal) { case SIGINT: ARCH->raiseSignal(kINTERRUPT); break; case SIGTERM: ARCH->raiseSignal(kTERMINATE); break; case SIGHUP: ARCH->raiseSignal(kHANGUP); break; case SIGUSR2: ARCH->raiseSignal(kUSER); break; default: // ignore break; } } return NULL; } synergy-1.4.12-Source/src/lib/arch/CArchMultithreadPosix.h0000600000175000017500000000637612021261364023351 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHMULTITHREADPOSIX_H #define CARCHMULTITHREADPOSIX_H #include "IArchMultithread.h" #include "stdlist.h" #include #define ARCH_MULTITHREAD CArchMultithreadPosix class CArchCondImpl { public: pthread_cond_t m_cond; }; class CArchMutexImpl { public: pthread_mutex_t m_mutex; }; //! Posix implementation of IArchMultithread class CArchMultithreadPosix : public IArchMultithread { public: CArchMultithreadPosix(); virtual ~CArchMultithreadPosix(); //! @name manipulators //@{ void setNetworkDataForCurrentThread(void*); //@} //! @name accessors //@{ void* getNetworkDataForThread(CArchThread); static CArchMultithreadPosix* getInstance(); //@} // IArchMultithread overrides virtual CArchCond newCondVar(); virtual void closeCondVar(CArchCond); virtual void signalCondVar(CArchCond); virtual void broadcastCondVar(CArchCond); virtual bool waitCondVar(CArchCond, CArchMutex, double timeout); virtual CArchMutex newMutex(); virtual void closeMutex(CArchMutex); virtual void lockMutex(CArchMutex); virtual void unlockMutex(CArchMutex); virtual CArchThread newThread(ThreadFunc, void*); virtual CArchThread newCurrentThread(); virtual CArchThread copyThread(CArchThread); virtual void closeThread(CArchThread); virtual void cancelThread(CArchThread); virtual void setPriorityOfThread(CArchThread, int n); virtual void testCancelThread(); virtual bool wait(CArchThread, double timeout); virtual bool isSameThread(CArchThread, CArchThread); virtual bool isExitedThread(CArchThread); virtual void* getResultOfThread(CArchThread); virtual ThreadID getIDOfThread(CArchThread); virtual void setSignalHandler(ESignal, SignalFunc, void*); virtual void raiseSignal(ESignal); private: void startSignalHandler(); CArchThreadImpl* find(pthread_t thread); CArchThreadImpl* findNoRef(pthread_t thread); void insert(CArchThreadImpl* thread); void erase(CArchThreadImpl* thread); void refThread(CArchThreadImpl* rep); void testCancelThreadImpl(CArchThreadImpl* rep); void doThreadFunc(CArchThread thread); static void* threadFunc(void* vrep); static void threadCancel(int); static void* threadSignalHandler(void* vrep); private: typedef std::list CThreadList; static CArchMultithreadPosix* s_instance; bool m_newThreadCalled; CArchMutex m_threadMutex; CArchThread m_mainThread; CThreadList m_threadList; ThreadID m_nextID; pthread_t m_signalThread; SignalFunc m_signalFunc[kNUM_SIGNALS]; void* m_signalUserData[kNUM_SIGNALS]; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchMultithreadWindows.cpp0000600000175000017500000004132312021261364024223 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if defined(_MSC_VER) && !defined(_MT) # error multithreading compile option is required #endif #include "CArchMultithreadWindows.h" #include "CArch.h" #include "XArch.h" #include // // note -- implementation of condition variable taken from: // http://www.cs.wustl.edu/~schmidt/win32-cv-1.html // titled "Strategies for Implementing POSIX Condition Variables // on Win32." it also provides an implementation that doesn't // suffer from the incorrectness problem described in our // corresponding header but it is slower, still unfair, and // can cause busy waiting. // // // CArchThreadImpl // class CArchThreadImpl { public: CArchThreadImpl(); ~CArchThreadImpl(); public: int m_refCount; HANDLE m_thread; DWORD m_id; IArchMultithread::ThreadFunc m_func; void* m_userData; HANDLE m_cancel; bool m_cancelling; HANDLE m_exit; void* m_result; void* m_networkData; }; CArchThreadImpl::CArchThreadImpl() : m_refCount(1), m_thread(NULL), m_id(0), m_func(NULL), m_userData(NULL), m_cancelling(false), m_result(NULL), m_networkData(NULL) { m_exit = CreateEvent(NULL, TRUE, FALSE, NULL); m_cancel = CreateEvent(NULL, TRUE, FALSE, NULL); } CArchThreadImpl::~CArchThreadImpl() { CloseHandle(m_exit); CloseHandle(m_cancel); } // // CArchMultithreadWindows // CArchMultithreadWindows* CArchMultithreadWindows::s_instance = NULL; CArchMultithreadWindows::CArchMultithreadWindows() { assert(s_instance == NULL); s_instance = this; // no signal handlers for (size_t i = 0; i < kNUM_SIGNALS; ++i) { m_signalFunc[i] = NULL; m_signalUserData[i] = NULL; } // create mutex for thread list m_threadMutex = newMutex(); // create thread for calling (main) thread and add it to our // list. no need to lock the mutex since we're the only thread. m_mainThread = new CArchThreadImpl; m_mainThread->m_thread = NULL; m_mainThread->m_id = GetCurrentThreadId(); insert(m_mainThread); } CArchMultithreadWindows::~CArchMultithreadWindows() { s_instance = NULL; // clean up thread list for (CThreadList::iterator index = m_threadList.begin(); index != m_threadList.end(); ++index) { delete *index; } // done with mutex delete m_threadMutex; } void CArchMultithreadWindows::setNetworkDataForCurrentThread(void* data) { lockMutex(m_threadMutex); CArchThreadImpl* thread = findNoRef(GetCurrentThreadId()); thread->m_networkData = data; unlockMutex(m_threadMutex); } void* CArchMultithreadWindows::getNetworkDataForThread(CArchThread thread) { lockMutex(m_threadMutex); void* data = thread->m_networkData; unlockMutex(m_threadMutex); return data; } HANDLE CArchMultithreadWindows::getCancelEventForCurrentThread() { lockMutex(m_threadMutex); CArchThreadImpl* thread = findNoRef(GetCurrentThreadId()); unlockMutex(m_threadMutex); return thread->m_cancel; } CArchMultithreadWindows* CArchMultithreadWindows::getInstance() { return s_instance; } CArchCond CArchMultithreadWindows::newCondVar() { CArchCondImpl* cond = new CArchCondImpl; cond->m_events[CArchCondImpl::kSignal] = CreateEvent(NULL, FALSE, FALSE, NULL); cond->m_events[CArchCondImpl::kBroadcast] = CreateEvent(NULL, TRUE, FALSE, NULL); cond->m_waitCountMutex = newMutex(); cond->m_waitCount = 0; return cond; } void CArchMultithreadWindows::closeCondVar(CArchCond cond) { CloseHandle(cond->m_events[CArchCondImpl::kSignal]); CloseHandle(cond->m_events[CArchCondImpl::kBroadcast]); closeMutex(cond->m_waitCountMutex); delete cond; } void CArchMultithreadWindows::signalCondVar(CArchCond cond) { // is anybody waiting? lockMutex(cond->m_waitCountMutex); const bool hasWaiter = (cond->m_waitCount > 0); unlockMutex(cond->m_waitCountMutex); // wake one thread if anybody is waiting if (hasWaiter) { SetEvent(cond->m_events[CArchCondImpl::kSignal]); } } void CArchMultithreadWindows::broadcastCondVar(CArchCond cond) { // is anybody waiting? lockMutex(cond->m_waitCountMutex); const bool hasWaiter = (cond->m_waitCount > 0); unlockMutex(cond->m_waitCountMutex); // wake all threads if anybody is waiting if (hasWaiter) { SetEvent(cond->m_events[CArchCondImpl::kBroadcast]); } } bool CArchMultithreadWindows::waitCondVar(CArchCond cond, CArchMutex mutex, double timeout) { // prepare to wait const DWORD winTimeout = (timeout < 0.0) ? INFINITE : static_cast(1000.0 * timeout); // make a list of the condition variable events and the cancel event // for the current thread. HANDLE handles[4]; handles[0] = cond->m_events[CArchCondImpl::kSignal]; handles[1] = cond->m_events[CArchCondImpl::kBroadcast]; handles[2] = getCancelEventForCurrentThread(); // update waiter count lockMutex(cond->m_waitCountMutex); ++cond->m_waitCount; unlockMutex(cond->m_waitCountMutex); // release mutex. this should be atomic with the wait so that it's // impossible for another thread to signal us between the unlock and // the wait, which would lead to a lost signal on broadcasts. // however, we're using a manual reset event for broadcasts which // stays set until we reset it, so we don't lose the broadcast. unlockMutex(mutex); // wait for a signal or broadcast DWORD result = WaitForMultipleObjects(3, handles, FALSE, winTimeout); // cancel takes priority if (result != WAIT_OBJECT_0 + 2 && WaitForSingleObject(handles[2], 0) == WAIT_OBJECT_0) { result = WAIT_OBJECT_0 + 2; } // update the waiter count and check if we're the last waiter lockMutex(cond->m_waitCountMutex); --cond->m_waitCount; const bool last = (result == WAIT_OBJECT_0 + 1 && cond->m_waitCount == 0); unlockMutex(cond->m_waitCountMutex); // reset the broadcast event if we're the last waiter if (last) { ResetEvent(cond->m_events[CArchCondImpl::kBroadcast]); } // reacquire the mutex lockMutex(mutex); // cancel thread if necessary if (result == WAIT_OBJECT_0 + 2) { ARCH->testCancelThread(); } // return success or failure return (result == WAIT_OBJECT_0 + 0 || result == WAIT_OBJECT_0 + 1); } CArchMutex CArchMultithreadWindows::newMutex() { CArchMutexImpl* mutex = new CArchMutexImpl; InitializeCriticalSection(&mutex->m_mutex); return mutex; } void CArchMultithreadWindows::closeMutex(CArchMutex mutex) { DeleteCriticalSection(&mutex->m_mutex); delete mutex; } void CArchMultithreadWindows::lockMutex(CArchMutex mutex) { EnterCriticalSection(&mutex->m_mutex); } void CArchMultithreadWindows::unlockMutex(CArchMutex mutex) { LeaveCriticalSection(&mutex->m_mutex); } CArchThread CArchMultithreadWindows::newThread(ThreadFunc func, void* data) { lockMutex(m_threadMutex); // create thread impl for new thread CArchThreadImpl* thread = new CArchThreadImpl; thread->m_func = func; thread->m_userData = data; // create thread unsigned int id = 0; thread->m_thread = reinterpret_cast(_beginthreadex(NULL, 0, threadFunc, (void*)thread, 0, &id)); thread->m_id = static_cast(id); // check if thread was started if (thread->m_thread == 0) { // failed to start thread so clean up delete thread; thread = NULL; } else { // add thread to list insert(thread); // increment ref count to account for the thread itself refThread(thread); } // note that the child thread will wait until we release this mutex unlockMutex(m_threadMutex); return thread; } CArchThread CArchMultithreadWindows::newCurrentThread() { lockMutex(m_threadMutex); CArchThreadImpl* thread = find(GetCurrentThreadId()); unlockMutex(m_threadMutex); assert(thread != NULL); return thread; } void CArchMultithreadWindows::closeThread(CArchThread thread) { assert(thread != NULL); // decrement ref count and clean up thread if no more references if (--thread->m_refCount == 0) { // close the handle (main thread has a NULL handle) if (thread->m_thread != NULL) { CloseHandle(thread->m_thread); } // remove thread from list lockMutex(m_threadMutex); assert(findNoRefOrCreate(thread->m_id) == thread); erase(thread); unlockMutex(m_threadMutex); // done with thread delete thread; } } CArchThread CArchMultithreadWindows::copyThread(CArchThread thread) { refThread(thread); return thread; } void CArchMultithreadWindows::cancelThread(CArchThread thread) { assert(thread != NULL); // set cancel flag SetEvent(thread->m_cancel); } void CArchMultithreadWindows::setPriorityOfThread(CArchThread thread, int n) { struct CPriorityInfo { public: DWORD m_class; int m_level; }; static const CPriorityInfo s_pClass[] = { { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_IDLE }, { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_LOWEST }, { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_BELOW_NORMAL }, { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_NORMAL }, { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_ABOVE_NORMAL }, { IDLE_PRIORITY_CLASS, THREAD_PRIORITY_HIGHEST }, { NORMAL_PRIORITY_CLASS, THREAD_PRIORITY_LOWEST }, { NORMAL_PRIORITY_CLASS, THREAD_PRIORITY_BELOW_NORMAL }, { NORMAL_PRIORITY_CLASS, THREAD_PRIORITY_NORMAL }, { NORMAL_PRIORITY_CLASS, THREAD_PRIORITY_ABOVE_NORMAL }, { NORMAL_PRIORITY_CLASS, THREAD_PRIORITY_HIGHEST }, { HIGH_PRIORITY_CLASS, THREAD_PRIORITY_LOWEST }, { HIGH_PRIORITY_CLASS, THREAD_PRIORITY_BELOW_NORMAL }, { HIGH_PRIORITY_CLASS, THREAD_PRIORITY_NORMAL }, { HIGH_PRIORITY_CLASS, THREAD_PRIORITY_ABOVE_NORMAL }, { HIGH_PRIORITY_CLASS, THREAD_PRIORITY_HIGHEST }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_IDLE }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_LOWEST }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_BELOW_NORMAL }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_NORMAL }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_ABOVE_NORMAL }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_HIGHEST }, { REALTIME_PRIORITY_CLASS, THREAD_PRIORITY_TIME_CRITICAL} }; #if defined(_DEBUG) // don't use really high priorities when debugging static const size_t s_pMax = 13; #else static const size_t s_pMax = sizeof(s_pClass) / sizeof(s_pClass[0]) - 1; #endif static const size_t s_pBase = 8; // index of normal priority assert(thread != NULL); size_t index; if (n > 0 && s_pBase < (size_t)n) { // lowest priority index = 0; } else { index = (size_t)((int)s_pBase - n); if (index > s_pMax) { // highest priority index = s_pMax; } } SetPriorityClass(GetCurrentProcess(), s_pClass[index].m_class); SetThreadPriority(thread->m_thread, s_pClass[index].m_level); } void CArchMultithreadWindows::testCancelThread() { // find current thread lockMutex(m_threadMutex); CArchThreadImpl* thread = findNoRef(GetCurrentThreadId()); unlockMutex(m_threadMutex); // test cancel on thread testCancelThreadImpl(thread); } bool CArchMultithreadWindows::wait(CArchThread target, double timeout) { assert(target != NULL); lockMutex(m_threadMutex); // find current thread CArchThreadImpl* self = findNoRef(GetCurrentThreadId()); // ignore wait if trying to wait on ourself if (target == self) { unlockMutex(m_threadMutex); return false; } // ref the target so it can't go away while we're watching it refThread(target); unlockMutex(m_threadMutex); // convert timeout DWORD t; if (timeout < 0.0) { t = INFINITE; } else { t = (DWORD)(1000.0 * timeout); } // wait for this thread to be cancelled or woken up or for the // target thread to terminate. HANDLE handles[2]; handles[0] = target->m_exit; handles[1] = self->m_cancel; DWORD result = WaitForMultipleObjects(2, handles, FALSE, t); // cancel takes priority if (result != WAIT_OBJECT_0 + 1 && WaitForSingleObject(handles[1], 0) == WAIT_OBJECT_0) { result = WAIT_OBJECT_0 + 1; } // release target closeThread(target); // handle result switch (result) { case WAIT_OBJECT_0 + 0: // target thread terminated return true; case WAIT_OBJECT_0 + 1: // this thread was cancelled. does not return. testCancelThreadImpl(self); default: // timeout or error return false; } } bool CArchMultithreadWindows::isSameThread(CArchThread thread1, CArchThread thread2) { return (thread1 == thread2); } bool CArchMultithreadWindows::isExitedThread(CArchThread thread) { // poll exit event return (WaitForSingleObject(thread->m_exit, 0) == WAIT_OBJECT_0); } void* CArchMultithreadWindows::getResultOfThread(CArchThread thread) { lockMutex(m_threadMutex); void* result = thread->m_result; unlockMutex(m_threadMutex); return result; } IArchMultithread::ThreadID CArchMultithreadWindows::getIDOfThread(CArchThread thread) { return static_cast(thread->m_id); } void CArchMultithreadWindows::setSignalHandler( ESignal signal, SignalFunc func, void* userData) { lockMutex(m_threadMutex); m_signalFunc[signal] = func; m_signalUserData[signal] = userData; unlockMutex(m_threadMutex); } void CArchMultithreadWindows::raiseSignal(ESignal signal) { lockMutex(m_threadMutex); if (m_signalFunc[signal] != NULL) { m_signalFunc[signal](signal, m_signalUserData[signal]); ARCH->unblockPollSocket(m_mainThread); } else if (signal == kINTERRUPT || signal == kTERMINATE) { ARCH->cancelThread(m_mainThread); } unlockMutex(m_threadMutex); } CArchThreadImpl* CArchMultithreadWindows::find(DWORD id) { CArchThreadImpl* impl = findNoRef(id); if (impl != NULL) { refThread(impl); } return impl; } CArchThreadImpl* CArchMultithreadWindows::findNoRef(DWORD id) { CArchThreadImpl* impl = findNoRefOrCreate(id); if (impl == NULL) { // create thread for calling thread which isn't in our list and // add it to the list. this won't normally happen but it can if // the system calls us under a new thread, like it does when we // run as a service. impl = new CArchThreadImpl; impl->m_thread = NULL; impl->m_id = GetCurrentThreadId(); insert(impl); } return impl; } CArchThreadImpl* CArchMultithreadWindows::findNoRefOrCreate(DWORD id) { // linear search for (CThreadList::const_iterator index = m_threadList.begin(); index != m_threadList.end(); ++index) { if ((*index)->m_id == id) { return *index; } } return NULL; } void CArchMultithreadWindows::insert(CArchThreadImpl* thread) { assert(thread != NULL); // thread shouldn't already be on the list assert(findNoRefOrCreate(thread->m_id) == NULL); // append to list m_threadList.push_back(thread); } void CArchMultithreadWindows::erase(CArchThreadImpl* thread) { for (CThreadList::iterator index = m_threadList.begin(); index != m_threadList.end(); ++index) { if (*index == thread) { m_threadList.erase(index); break; } } } void CArchMultithreadWindows::refThread(CArchThreadImpl* thread) { assert(thread != NULL); assert(findNoRefOrCreate(thread->m_id) != NULL); ++thread->m_refCount; } void CArchMultithreadWindows::testCancelThreadImpl(CArchThreadImpl* thread) { assert(thread != NULL); // poll cancel event. return if not set. const DWORD result = WaitForSingleObject(thread->m_cancel, 0); if (result != WAIT_OBJECT_0) { return; } // update cancel state lockMutex(m_threadMutex); bool cancel = !thread->m_cancelling; thread->m_cancelling = true; ResetEvent(thread->m_cancel); unlockMutex(m_threadMutex); // unwind thread's stack if cancelling if (cancel) { throw XThreadCancel(); } } unsigned int __stdcall CArchMultithreadWindows::threadFunc(void* vrep) { // get the thread CArchThreadImpl* thread = reinterpret_cast(vrep); // run thread s_instance->doThreadFunc(thread); // terminate the thread return 0; } void CArchMultithreadWindows::doThreadFunc(CArchThread thread) { // wait for parent to initialize this object lockMutex(m_threadMutex); unlockMutex(m_threadMutex); void* result = NULL; try { // go result = (*thread->m_func)(thread->m_userData); } catch (XThreadCancel&) { // client called cancel() } catch (...) { // note -- don't catch (...) to avoid masking bugs SetEvent(thread->m_exit); closeThread(thread); throw; } // thread has exited lockMutex(m_threadMutex); thread->m_result = result; unlockMutex(m_threadMutex); SetEvent(thread->m_exit); // done with thread closeThread(thread); } synergy-1.4.12-Source/src/lib/arch/CArchMultithreadWindows.h0000600000175000017500000000644612021261364023677 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHMULTITHREADWINDOWS_H #define CARCHMULTITHREADWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "IArchMultithread.h" #include "stdlist.h" #include #define ARCH_MULTITHREAD CArchMultithreadWindows class CArchCondImpl { public: enum { kSignal = 0, kBroadcast }; HANDLE m_events[2]; mutable int m_waitCount; CArchMutex m_waitCountMutex; }; class CArchMutexImpl { public: CRITICAL_SECTION m_mutex; }; //! Win32 implementation of IArchMultithread class CArchMultithreadWindows : public IArchMultithread { public: CArchMultithreadWindows(); virtual ~CArchMultithreadWindows(); //! @name manipulators //@{ void setNetworkDataForCurrentThread(void*); //@} //! @name accessors //@{ HANDLE getCancelEventForCurrentThread(); void* getNetworkDataForThread(CArchThread); static CArchMultithreadWindows* getInstance(); //@} // IArchMultithread overrides virtual CArchCond newCondVar(); virtual void closeCondVar(CArchCond); virtual void signalCondVar(CArchCond); virtual void broadcastCondVar(CArchCond); virtual bool waitCondVar(CArchCond, CArchMutex, double timeout); virtual CArchMutex newMutex(); virtual void closeMutex(CArchMutex); virtual void lockMutex(CArchMutex); virtual void unlockMutex(CArchMutex); virtual CArchThread newThread(ThreadFunc, void*); virtual CArchThread newCurrentThread(); virtual CArchThread copyThread(CArchThread); virtual void closeThread(CArchThread); virtual void cancelThread(CArchThread); virtual void setPriorityOfThread(CArchThread, int n); virtual void testCancelThread(); virtual bool wait(CArchThread, double timeout); virtual bool isSameThread(CArchThread, CArchThread); virtual bool isExitedThread(CArchThread); virtual void* getResultOfThread(CArchThread); virtual ThreadID getIDOfThread(CArchThread); virtual void setSignalHandler(ESignal, SignalFunc, void*); virtual void raiseSignal(ESignal); private: CArchThreadImpl* find(DWORD id); CArchThreadImpl* findNoRef(DWORD id); CArchThreadImpl* findNoRefOrCreate(DWORD id); void insert(CArchThreadImpl* thread); void erase(CArchThreadImpl* thread); void refThread(CArchThreadImpl* rep); void testCancelThreadImpl(CArchThreadImpl* rep); void doThreadFunc(CArchThread thread); static unsigned int __stdcall threadFunc(void* vrep); private: typedef std::list CThreadList; static CArchMultithreadWindows* s_instance; CArchMutex m_threadMutex; CThreadList m_threadList; CArchThread m_mainThread; SignalFunc m_signalFunc[kNUM_SIGNALS]; void* m_signalUserData[kNUM_SIGNALS]; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchNetworkBSD.cpp0000600000175000017500000004713612021261364022360 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchNetworkBSD.h" #include "CArch.h" #include "CArchMultithreadPosix.h" #include "XArchUnix.h" #if HAVE_UNISTD_H # include #endif #include #include #if !defined(TCP_NODELAY) # include #endif #include #include #include #include #if HAVE_POLL # include #else # if HAVE_SYS_SELECT_H # include # endif # if HAVE_SYS_TIME_H # include # endif #endif #if !HAVE_INET_ATON # include #endif static const int s_family[] = { PF_UNSPEC, PF_INET }; static const int s_type[] = { SOCK_DGRAM, SOCK_STREAM }; #if !HAVE_INET_ATON // parse dotted quad addresses. we don't bother with the weird BSD'ism // of handling octal and hex and partial forms. static in_addr_t inet_aton(const char* cp, struct in_addr* inp) { unsigned int a, b, c, d; if (sscanf(cp, "%u.%u.%u.%u", &a, &b, &c, &d) != 4) { return 0; } if (a >= 256 || b >= 256 || c >= 256 || d >= 256) { return 0; } unsigned char* incp = (unsigned char*)inp; incp[0] = (unsigned char)(a & 0xffu); incp[1] = (unsigned char)(b & 0xffu); incp[2] = (unsigned char)(c & 0xffu); incp[3] = (unsigned char)(d & 0xffu); return inp->s_addr; } #endif // // CArchNetworkBSD // CArchNetworkBSD::CArchNetworkBSD() { } CArchNetworkBSD::~CArchNetworkBSD() { ARCH->closeMutex(m_mutex); } void CArchNetworkBSD::init() { // create mutex to make some calls thread safe m_mutex = ARCH->newMutex(); } CArchSocket CArchNetworkBSD::newSocket(EAddressFamily family, ESocketType type) { // create socket int fd = socket(s_family[family], s_type[type], 0); if (fd == -1) { throwError(errno); } try { setBlockingOnSocket(fd, false); } catch (...) { close(fd); throw; } // allocate socket object CArchSocketImpl* newSocket = new CArchSocketImpl; newSocket->m_fd = fd; newSocket->m_refCount = 1; return newSocket; } CArchSocket CArchNetworkBSD::copySocket(CArchSocket s) { assert(s != NULL); // ref the socket and return it ARCH->lockMutex(m_mutex); ++s->m_refCount; ARCH->unlockMutex(m_mutex); return s; } void CArchNetworkBSD::closeSocket(CArchSocket s) { assert(s != NULL); // unref the socket and note if it should be released ARCH->lockMutex(m_mutex); const bool doClose = (--s->m_refCount == 0); ARCH->unlockMutex(m_mutex); // close the socket if necessary if (doClose) { if (close(s->m_fd) == -1) { // close failed. restore the last ref and throw. int err = errno; ARCH->lockMutex(m_mutex); ++s->m_refCount; ARCH->unlockMutex(m_mutex); throwError(err); } delete s; } } void CArchNetworkBSD::closeSocketForRead(CArchSocket s) { assert(s != NULL); if (shutdown(s->m_fd, 0) == -1) { if (errno != ENOTCONN) { throwError(errno); } } } void CArchNetworkBSD::closeSocketForWrite(CArchSocket s) { assert(s != NULL); if (shutdown(s->m_fd, 1) == -1) { if (errno != ENOTCONN) { throwError(errno); } } } void CArchNetworkBSD::bindSocket(CArchSocket s, CArchNetAddress addr) { assert(s != NULL); assert(addr != NULL); if (bind(s->m_fd, &addr->m_addr, addr->m_len) == -1) { throwError(errno); } } void CArchNetworkBSD::listenOnSocket(CArchSocket s) { assert(s != NULL); // hardcoding backlog if (listen(s->m_fd, 3) == -1) { throwError(errno); } } CArchSocket CArchNetworkBSD::acceptSocket(CArchSocket s, CArchNetAddress* addr) { assert(s != NULL); // if user passed NULL in addr then use scratch space CArchNetAddress dummy; if (addr == NULL) { addr = &dummy; } // create new socket and address CArchSocketImpl* newSocket = new CArchSocketImpl; *addr = new CArchNetAddressImpl; // accept on socket ACCEPT_TYPE_ARG3 len = (ACCEPT_TYPE_ARG3)((*addr)->m_len); int fd = accept(s->m_fd, &(*addr)->m_addr, &len); (*addr)->m_len = (socklen_t)len; if (fd == -1) { int err = errno; delete newSocket; delete *addr; *addr = NULL; if (err == EAGAIN) { return NULL; } throwError(err); } try { setBlockingOnSocket(fd, false); } catch (...) { close(fd); delete newSocket; delete *addr; *addr = NULL; throw; } // initialize socket newSocket->m_fd = fd; newSocket->m_refCount = 1; // discard address if not requested if (addr == &dummy) { ARCH->closeAddr(dummy); } return newSocket; } bool CArchNetworkBSD::connectSocket(CArchSocket s, CArchNetAddress addr) { assert(s != NULL); assert(addr != NULL); if (connect(s->m_fd, &addr->m_addr, addr->m_len) == -1) { if (errno == EISCONN) { return true; } if (errno == EINPROGRESS) { return false; } throwError(errno); } return true; } #if HAVE_POLL int CArchNetworkBSD::pollSocket(CPollEntry pe[], int num, double timeout) { assert(pe != NULL || num == 0); // return if nothing to do if (num == 0) { if (timeout > 0.0) { ARCH->sleep(timeout); } return 0; } // allocate space for translated query struct pollfd* pfd = new struct pollfd[1 + num]; // translate query for (int i = 0; i < num; ++i) { pfd[i].fd = (pe[i].m_socket == NULL) ? -1 : pe[i].m_socket->m_fd; pfd[i].events = 0; if ((pe[i].m_events & kPOLLIN) != 0) { pfd[i].events |= POLLIN; } if ((pe[i].m_events & kPOLLOUT) != 0) { pfd[i].events |= POLLOUT; } } int n = num; // add the unblock pipe const int* unblockPipe = getUnblockPipe(); if (unblockPipe != NULL) { pfd[n].fd = unblockPipe[0]; pfd[n].events = POLLIN; ++n; } // prepare timeout int t = (timeout < 0.0) ? -1 : static_cast(1000.0 * timeout); // do the poll n = poll(pfd, n, t); // reset the unblock pipe if (n > 0 && unblockPipe != NULL && (pfd[num].revents & POLLIN) != 0) { // the unblock event was signalled. flush the pipe. char dummy[100]; int ignore; do { ignore = read(unblockPipe[0], dummy, sizeof(dummy)); } while (errno != EAGAIN); // don't count this unblock pipe in return value --n; } // handle results if (n == -1) { if (errno == EINTR) { // interrupted system call ARCH->testCancelThread(); delete[] pfd; return 0; } delete[] pfd; throwError(errno); } // translate back for (int i = 0; i < num; ++i) { pe[i].m_revents = 0; if ((pfd[i].revents & POLLIN) != 0) { pe[i].m_revents |= kPOLLIN; } if ((pfd[i].revents & POLLOUT) != 0) { pe[i].m_revents |= kPOLLOUT; } if ((pfd[i].revents & POLLERR) != 0) { pe[i].m_revents |= kPOLLERR; } if ((pfd[i].revents & POLLNVAL) != 0) { pe[i].m_revents |= kPOLLNVAL; } } delete[] pfd; return n; } #else int CArchNetworkBSD::pollSocket(CPollEntry pe[], int num, double timeout) { int i, n; // prepare sets for select n = 0; fd_set readSet, writeSet, errSet; fd_set* readSetP = NULL; fd_set* writeSetP = NULL; fd_set* errSetP = NULL; FD_ZERO(&readSet); FD_ZERO(&writeSet); FD_ZERO(&errSet); for (i = 0; i < num; ++i) { // reset return flags pe[i].m_revents = 0; // set invalid flag if socket is bogus then go to next socket if (pe[i].m_socket == NULL) { pe[i].m_revents |= kPOLLNVAL; continue; } int fdi = pe[i].m_socket->m_fd; if (pe[i].m_events & kPOLLIN) { FD_SET(pe[i].m_socket->m_fd, &readSet); readSetP = &readSet; if (fdi > n) { n = fdi; } } if (pe[i].m_events & kPOLLOUT) { FD_SET(pe[i].m_socket->m_fd, &writeSet); writeSetP = &writeSet; if (fdi > n) { n = fdi; } } if (true) { FD_SET(pe[i].m_socket->m_fd, &errSet); errSetP = &errSet; if (fdi > n) { n = fdi; } } } // add the unblock pipe const int* unblockPipe = getUnblockPipe(); if (unblockPipe != NULL) { FD_SET(unblockPipe[0], &readSet); readSetP = &readSet; if (unblockPipe[0] > n) { n = unblockPipe[0]; } } // if there are no sockets then don't block forever if (n == 0 && timeout < 0.0) { timeout = 0.0; } // prepare timeout for select struct timeval timeout2; struct timeval* timeout2P; if (timeout < 0.0) { timeout2P = NULL; } else { timeout2P = &timeout2; timeout2.tv_sec = static_cast(timeout); timeout2.tv_usec = static_cast(1.0e+6 * (timeout - timeout2.tv_sec)); } // do the select n = select((SELECT_TYPE_ARG1) n + 1, SELECT_TYPE_ARG234 readSetP, SELECT_TYPE_ARG234 writeSetP, SELECT_TYPE_ARG234 errSetP, SELECT_TYPE_ARG5 timeout2P); // reset the unblock pipe if (n > 0 && unblockPipe != NULL && FD_ISSET(unblockPipe[0], &readSet)) { // the unblock event was signalled. flush the pipe. char dummy[100]; do { read(unblockPipe[0], dummy, sizeof(dummy)); } while (errno != EAGAIN); } // handle results if (n == -1) { if (errno == EINTR) { // interrupted system call ARCH->testCancelThread(); return 0; } throwError(errno); } n = 0; for (i = 0; i < num; ++i) { if (pe[i].m_socket != NULL) { if (FD_ISSET(pe[i].m_socket->m_fd, &readSet)) { pe[i].m_revents |= kPOLLIN; } if (FD_ISSET(pe[i].m_socket->m_fd, &writeSet)) { pe[i].m_revents |= kPOLLOUT; } if (FD_ISSET(pe[i].m_socket->m_fd, &errSet)) { pe[i].m_revents |= kPOLLERR; } } if (pe[i].m_revents != 0) { ++n; } } return n; } #endif void CArchNetworkBSD::unblockPollSocket(CArchThread thread) { const int* unblockPipe = getUnblockPipeForThread(thread); if (unblockPipe != NULL) { char dummy = 0; int ignore; ignore = write(unblockPipe[1], &dummy, 1); } } size_t CArchNetworkBSD::readSocket(CArchSocket s, void* buf, size_t len) { assert(s != NULL); ssize_t n = read(s->m_fd, buf, len); if (n == -1) { if (errno == EINTR || errno == EAGAIN) { return 0; } throwError(errno); } return n; } size_t CArchNetworkBSD::writeSocket(CArchSocket s, const void* buf, size_t len) { assert(s != NULL); ssize_t n = write(s->m_fd, buf, len); if (n == -1) { if (errno == EINTR || errno == EAGAIN) { return 0; } throwError(errno); } return n; } void CArchNetworkBSD::throwErrorOnSocket(CArchSocket s) { assert(s != NULL); // get the error from the socket layer int err = 0; socklen_t size = (socklen_t)sizeof(err); if (getsockopt(s->m_fd, SOL_SOCKET, SO_ERROR, (optval_t*)&err, &size) == -1) { err = errno; } // throw if there's an error if (err != 0) { throwError(err); } } void CArchNetworkBSD::setBlockingOnSocket(int fd, bool blocking) { assert(fd != -1); int mode = fcntl(fd, F_GETFL, 0); if (mode == -1) { throwError(errno); } if (blocking) { mode &= ~O_NONBLOCK; } else { mode |= O_NONBLOCK; } if (fcntl(fd, F_SETFL, mode) == -1) { throwError(errno); } } bool CArchNetworkBSD::setNoDelayOnSocket(CArchSocket s, bool noDelay) { assert(s != NULL); // get old state int oflag; socklen_t size = (socklen_t)sizeof(oflag); if (getsockopt(s->m_fd, IPPROTO_TCP, TCP_NODELAY, (optval_t*)&oflag, &size) == -1) { throwError(errno); } int flag = noDelay ? 1 : 0; size = (socklen_t)sizeof(flag); if (setsockopt(s->m_fd, IPPROTO_TCP, TCP_NODELAY, (optval_t*)&flag, size) == -1) { throwError(errno); } return (oflag != 0); } bool CArchNetworkBSD::setReuseAddrOnSocket(CArchSocket s, bool reuse) { assert(s != NULL); // get old state int oflag; socklen_t size = (socklen_t)sizeof(oflag); if (getsockopt(s->m_fd, SOL_SOCKET, SO_REUSEADDR, (optval_t*)&oflag, &size) == -1) { throwError(errno); } int flag = reuse ? 1 : 0; size = (socklen_t)sizeof(flag); if (setsockopt(s->m_fd, SOL_SOCKET, SO_REUSEADDR, (optval_t*)&flag, size) == -1) { throwError(errno); } return (oflag != 0); } std::string CArchNetworkBSD::getHostName() { char name[256]; if (gethostname(name, sizeof(name)) == -1) { name[0] = '\0'; } else { name[sizeof(name) - 1] = '\0'; } return name; } CArchNetAddress CArchNetworkBSD::newAnyAddr(EAddressFamily family) { // allocate address CArchNetAddressImpl* addr = new CArchNetAddressImpl; // fill it in switch (family) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); ipAddr->sin_family = AF_INET; ipAddr->sin_port = 0; ipAddr->sin_addr.s_addr = INADDR_ANY; addr->m_len = (socklen_t)sizeof(struct sockaddr_in); break; } default: delete addr; assert(0 && "invalid family"); } return addr; } CArchNetAddress CArchNetworkBSD::copyAddr(CArchNetAddress addr) { assert(addr != NULL); // allocate and copy address return new CArchNetAddressImpl(*addr); } CArchNetAddress CArchNetworkBSD::nameToAddr(const std::string& name) { // allocate address CArchNetAddressImpl* addr = new CArchNetAddressImpl; // try to convert assuming an IPv4 dot notation address struct sockaddr_in inaddr; memset(&inaddr, 0, sizeof(inaddr)); if (inet_aton(name.c_str(), &inaddr.sin_addr) != 0) { // it's a dot notation address addr->m_len = (socklen_t)sizeof(struct sockaddr_in); inaddr.sin_family = AF_INET; inaddr.sin_port = 0; memcpy(&addr->m_addr, &inaddr, addr->m_len); } else { // mutexed address lookup (ugh) ARCH->lockMutex(m_mutex); struct hostent* info = gethostbyname(name.c_str()); if (info == NULL) { ARCH->unlockMutex(m_mutex); delete addr; throwNameError(h_errno); } // copy over address (only IPv4 currently supported) if (info->h_addrtype == AF_INET) { addr->m_len = (socklen_t)sizeof(struct sockaddr_in); inaddr.sin_family = info->h_addrtype; inaddr.sin_port = 0; memcpy(&inaddr.sin_addr, info->h_addr_list[0], sizeof(inaddr.sin_addr)); memcpy(&addr->m_addr, &inaddr, addr->m_len); } else { ARCH->unlockMutex(m_mutex); delete addr; throw XArchNetworkNameUnsupported( "The requested name is valid but " "does not have a supported address family"); } // done with static buffer ARCH->unlockMutex(m_mutex); } return addr; } void CArchNetworkBSD::closeAddr(CArchNetAddress addr) { assert(addr != NULL); delete addr; } std::string CArchNetworkBSD::addrToName(CArchNetAddress addr) { assert(addr != NULL); // mutexed name lookup (ugh) ARCH->lockMutex(m_mutex); struct hostent* info = gethostbyaddr( reinterpret_cast(&addr->m_addr), addr->m_len, addr->m_addr.sa_family); if (info == NULL) { ARCH->unlockMutex(m_mutex); throwNameError(h_errno); } // save (primary) name std::string name = info->h_name; // done with static buffer ARCH->unlockMutex(m_mutex); return name; } std::string CArchNetworkBSD::addrToString(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); ARCH->lockMutex(m_mutex); std::string s = inet_ntoa(ipAddr->sin_addr); ARCH->unlockMutex(m_mutex); return s; } default: assert(0 && "unknown address family"); return ""; } } IArchNetwork::EAddressFamily CArchNetworkBSD::getAddrFamily(CArchNetAddress addr) { assert(addr != NULL); switch (addr->m_addr.sa_family) { case AF_INET: return kINET; default: return kUNKNOWN; } } void CArchNetworkBSD::setAddrPort(CArchNetAddress addr, int port) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); ipAddr->sin_port = htons(port); break; } default: assert(0 && "unknown address family"); break; } } int CArchNetworkBSD::getAddrPort(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); return ntohs(ipAddr->sin_port); } default: assert(0 && "unknown address family"); return 0; } } bool CArchNetworkBSD::isAnyAddr(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); return (ipAddr->sin_addr.s_addr == INADDR_ANY && addr->m_len == (socklen_t)sizeof(struct sockaddr_in)); } default: assert(0 && "unknown address family"); return true; } } bool CArchNetworkBSD::isEqualAddr(CArchNetAddress a, CArchNetAddress b) { return (a->m_len == b->m_len && memcmp(&a->m_addr, &b->m_addr, a->m_len) == 0); } const int* CArchNetworkBSD::getUnblockPipe() { CArchMultithreadPosix* mt = CArchMultithreadPosix::getInstance(); CArchThread thread = mt->newCurrentThread(); const int* p = getUnblockPipeForThread(thread); ARCH->closeThread(thread); return p; } const int* CArchNetworkBSD::getUnblockPipeForThread(CArchThread thread) { CArchMultithreadPosix* mt = CArchMultithreadPosix::getInstance(); int* unblockPipe = (int*)mt->getNetworkDataForThread(thread); if (unblockPipe == NULL) { unblockPipe = new int[2]; if (pipe(unblockPipe) != -1) { try { setBlockingOnSocket(unblockPipe[0], false); mt->setNetworkDataForCurrentThread(unblockPipe); } catch (...) { delete[] unblockPipe; unblockPipe = NULL; } } else { delete[] unblockPipe; unblockPipe = NULL; } } return unblockPipe; } void CArchNetworkBSD::throwError(int err) { switch (err) { case EINTR: ARCH->testCancelThread(); throw XArchNetworkInterrupted(new XArchEvalUnix(err)); case EACCES: case EPERM: throw XArchNetworkAccess(new XArchEvalUnix(err)); case ENFILE: case EMFILE: case ENODEV: case ENOBUFS: case ENOMEM: case ENETDOWN: #if defined(ENOSR) case ENOSR: #endif throw XArchNetworkResource(new XArchEvalUnix(err)); case EPROTOTYPE: case EPROTONOSUPPORT: case EAFNOSUPPORT: case EPFNOSUPPORT: case ESOCKTNOSUPPORT: case EINVAL: case ENOPROTOOPT: case EOPNOTSUPP: case ESHUTDOWN: #if defined(ENOPKG) case ENOPKG: #endif throw XArchNetworkSupport(new XArchEvalUnix(err)); case EIO: throw XArchNetworkIO(new XArchEvalUnix(err)); case EADDRNOTAVAIL: throw XArchNetworkNoAddress(new XArchEvalUnix(err)); case EADDRINUSE: throw XArchNetworkAddressInUse(new XArchEvalUnix(err)); case EHOSTUNREACH: case ENETUNREACH: throw XArchNetworkNoRoute(new XArchEvalUnix(err)); case ENOTCONN: throw XArchNetworkNotConnected(new XArchEvalUnix(err)); case EPIPE: throw XArchNetworkShutdown(new XArchEvalUnix(err)); case ECONNABORTED: case ECONNRESET: throw XArchNetworkDisconnected(new XArchEvalUnix(err)); case ECONNREFUSED: throw XArchNetworkConnectionRefused(new XArchEvalUnix(err)); case EHOSTDOWN: case ETIMEDOUT: throw XArchNetworkTimedOut(new XArchEvalUnix(err)); default: throw XArchNetwork(new XArchEvalUnix(err)); } } void CArchNetworkBSD::throwNameError(int err) { static const char* s_msg[] = { "The specified host is unknown", "The requested name is valid but does not have an IP address", "A non-recoverable name server error occurred", "A temporary error occurred on an authoritative name server", "An unknown name server error occurred" }; switch (err) { case HOST_NOT_FOUND: throw XArchNetworkNameUnknown(s_msg[0]); case NO_DATA: throw XArchNetworkNameNoAddress(s_msg[1]); case NO_RECOVERY: throw XArchNetworkNameFailure(s_msg[2]); case TRY_AGAIN: throw XArchNetworkNameUnavailable(s_msg[3]); default: throw XArchNetworkName(s_msg[4]); } } synergy-1.4.12-Source/src/lib/arch/CArchNetworkBSD.h0000600000175000017500000000662312021261364022021 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHNETWORKBSD_H #define CARCHNETWORKBSD_H #include "IArchNetwork.h" #include "IArchMultithread.h" #if HAVE_SYS_TYPES_H # include #endif #if HAVE_SYS_SOCKET_H # include #endif #if !HAVE_SOCKLEN_T typedef int socklen_t; #endif // old systems may use char* for [gs]etsockopt()'s optval argument. // this should be void on modern systems but char is forwards // compatible so we always use it. typedef char optval_t; #define ARCH_NETWORK CArchNetworkBSD class CArchSocketImpl { public: int m_fd; int m_refCount; }; class CArchNetAddressImpl { public: CArchNetAddressImpl() : m_len(sizeof(m_addr)) { } public: struct sockaddr m_addr; socklen_t m_len; }; //! Berkeley (BSD) sockets implementation of IArchNetwork class CArchNetworkBSD : public IArchNetwork { public: CArchNetworkBSD(); virtual ~CArchNetworkBSD(); virtual void init(); // IArchNetwork overrides virtual CArchSocket newSocket(EAddressFamily, ESocketType); virtual CArchSocket copySocket(CArchSocket s); virtual void closeSocket(CArchSocket s); virtual void closeSocketForRead(CArchSocket s); virtual void closeSocketForWrite(CArchSocket s); virtual void bindSocket(CArchSocket s, CArchNetAddress addr); virtual void listenOnSocket(CArchSocket s); virtual CArchSocket acceptSocket(CArchSocket s, CArchNetAddress* addr); virtual bool connectSocket(CArchSocket s, CArchNetAddress name); virtual int pollSocket(CPollEntry[], int num, double timeout); virtual void unblockPollSocket(CArchThread thread); virtual size_t readSocket(CArchSocket s, void* buf, size_t len); virtual size_t writeSocket(CArchSocket s, const void* buf, size_t len); virtual void throwErrorOnSocket(CArchSocket); virtual bool setNoDelayOnSocket(CArchSocket, bool noDelay); virtual bool setReuseAddrOnSocket(CArchSocket, bool reuse); virtual std::string getHostName(); virtual CArchNetAddress newAnyAddr(EAddressFamily); virtual CArchNetAddress copyAddr(CArchNetAddress); virtual CArchNetAddress nameToAddr(const std::string&); virtual void closeAddr(CArchNetAddress); virtual std::string addrToName(CArchNetAddress); virtual std::string addrToString(CArchNetAddress); virtual EAddressFamily getAddrFamily(CArchNetAddress); virtual void setAddrPort(CArchNetAddress, int port); virtual int getAddrPort(CArchNetAddress); virtual bool isAnyAddr(CArchNetAddress); virtual bool isEqualAddr(CArchNetAddress, CArchNetAddress); private: const int* getUnblockPipe(); const int* getUnblockPipeForThread(CArchThread); void setBlockingOnSocket(int fd, bool blocking); void throwError(int); void throwNameError(int); private: CArchMutex m_mutex; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchNetworkWinsock.cpp0000600000175000017500000006143112021261364023357 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchNetworkWinsock.h" #include "CArch.h" #include "CArchMultithreadWindows.h" #include "IArchMultithread.h" #include "XArchWindows.h" #include static const int s_family[] = { PF_UNSPEC, PF_INET }; static const int s_type[] = { SOCK_DGRAM, SOCK_STREAM }; static SOCKET (PASCAL FAR *accept_winsock)(SOCKET s, struct sockaddr FAR *addr, int FAR *addrlen); static int (PASCAL FAR *bind_winsock)(SOCKET s, const struct sockaddr FAR *addr, int namelen); static int (PASCAL FAR *close_winsock)(SOCKET s); static int (PASCAL FAR *connect_winsock)(SOCKET s, const struct sockaddr FAR *name, int namelen); static int (PASCAL FAR *gethostname_winsock)(char FAR * name, int namelen); static int (PASCAL FAR *getsockerror_winsock)(void); static int (PASCAL FAR *getsockopt_winsock)(SOCKET s, int level, int optname, void FAR * optval, int FAR *optlen); static u_short (PASCAL FAR *htons_winsock)(u_short v); static char FAR * (PASCAL FAR *inet_ntoa_winsock)(struct in_addr in); static unsigned long (PASCAL FAR *inet_addr_winsock)(const char FAR * cp); static int (PASCAL FAR *ioctl_winsock)(SOCKET s, int cmd, void FAR * data); static int (PASCAL FAR *listen_winsock)(SOCKET s, int backlog); static u_short (PASCAL FAR *ntohs_winsock)(u_short v); static int (PASCAL FAR *recv_winsock)(SOCKET s, void FAR * buf, int len, int flags); static int (PASCAL FAR *select_winsock)(int nfds, fd_set FAR *readfds, fd_set FAR *writefds, fd_set FAR *exceptfds, const struct timeval FAR *timeout); static int (PASCAL FAR *send_winsock)(SOCKET s, const void FAR * buf, int len, int flags); static int (PASCAL FAR *setsockopt_winsock)(SOCKET s, int level, int optname, const void FAR * optval, int optlen); static int (PASCAL FAR *shutdown_winsock)(SOCKET s, int how); static SOCKET (PASCAL FAR *socket_winsock)(int af, int type, int protocol); static struct hostent FAR * (PASCAL FAR *gethostbyaddr_winsock)(const char FAR * addr, int len, int type); static struct hostent FAR * (PASCAL FAR *gethostbyname_winsock)(const char FAR * name); static int (PASCAL FAR *WSACleanup_winsock)(void); static int (PASCAL FAR *WSAFDIsSet_winsock)(SOCKET, fd_set FAR * fdset); static WSAEVENT (PASCAL FAR *WSACreateEvent_winsock)(void); static BOOL (PASCAL FAR *WSACloseEvent_winsock)(WSAEVENT); static BOOL (PASCAL FAR *WSASetEvent_winsock)(WSAEVENT); static BOOL (PASCAL FAR *WSAResetEvent_winsock)(WSAEVENT); static int (PASCAL FAR *WSAEventSelect_winsock)(SOCKET, WSAEVENT, long); static DWORD (PASCAL FAR *WSAWaitForMultipleEvents_winsock)(DWORD, const WSAEVENT FAR*, BOOL, DWORD, BOOL); static int (PASCAL FAR *WSAEnumNetworkEvents_winsock)(SOCKET, WSAEVENT, LPWSANETWORKEVENTS); #undef FD_ISSET #define FD_ISSET(fd, set) WSAFDIsSet_winsock((SOCKET)(fd), (fd_set FAR *)(set)) #define setfunc(var, name, type) var = (type)netGetProcAddress(module, #name) static HMODULE s_networkModule = NULL; static FARPROC netGetProcAddress(HMODULE module, LPCSTR name) { FARPROC func = ::GetProcAddress(module, name); if (!func) { throw XArchNetworkSupport(""); } return func; } CArchNetAddressImpl* CArchNetAddressImpl::alloc(size_t size) { size_t totalSize = size + ADDR_HDR_SIZE; CArchNetAddressImpl* addr = (CArchNetAddressImpl*)malloc(totalSize); addr->m_len = (int)size; return addr; } // // CArchNetworkWinsock // CArchNetworkWinsock::CArchNetworkWinsock() { } CArchNetworkWinsock::~CArchNetworkWinsock() { if (s_networkModule != NULL) { WSACleanup_winsock(); ::FreeLibrary(s_networkModule); WSACleanup_winsock = NULL; s_networkModule = NULL; } ARCH->closeMutex(m_mutex); CEventList::iterator it; for (it = m_unblockEvents.begin(); it != m_unblockEvents.end(); it++) { delete *it; } } void CArchNetworkWinsock::init() { static const char* s_library[] = { "ws2_32.dll" }; assert(WSACleanup_winsock == NULL); assert(s_networkModule == NULL); // try each winsock library for (size_t i = 0; i < sizeof(s_library) / sizeof(s_library[0]); ++i) { try { initModule((HMODULE)::LoadLibrary(s_library[i])); m_mutex = ARCH->newMutex(); return; } catch (XArchNetwork&) { // ignore } } // can't initialize any library throw XArchNetworkSupport("Cannot load winsock library"); } void CArchNetworkWinsock::initModule(HMODULE module) { if (module == NULL) { throw XArchNetworkSupport(""); } // get startup function address int (PASCAL FAR *startup)(WORD, LPWSADATA); setfunc(startup, WSAStartup, int(PASCAL FAR*)(WORD, LPWSADATA)); // startup network library WORD version = MAKEWORD(2 /*major*/, 0 /*minor*/); WSADATA data; int err = startup(version, &data); if (data.wVersion != version) { throw XArchNetworkSupport(new XArchEvalWinsock(err)); } if (err != 0) { // some other initialization error throwError(err); } // get function addresses setfunc(accept_winsock, accept, SOCKET (PASCAL FAR *)(SOCKET s, struct sockaddr FAR *addr, int FAR *addrlen)); setfunc(bind_winsock, bind, int (PASCAL FAR *)(SOCKET s, const struct sockaddr FAR *addr, int namelen)); setfunc(close_winsock, closesocket, int (PASCAL FAR *)(SOCKET s)); setfunc(connect_winsock, connect, int (PASCAL FAR *)(SOCKET s, const struct sockaddr FAR *name, int namelen)); setfunc(gethostname_winsock, gethostname, int (PASCAL FAR *)(char FAR * name, int namelen)); setfunc(getsockerror_winsock, WSAGetLastError, int (PASCAL FAR *)(void)); setfunc(getsockopt_winsock, getsockopt, int (PASCAL FAR *)(SOCKET s, int level, int optname, void FAR * optval, int FAR *optlen)); setfunc(htons_winsock, htons, u_short (PASCAL FAR *)(u_short v)); setfunc(inet_ntoa_winsock, inet_ntoa, char FAR * (PASCAL FAR *)(struct in_addr in)); setfunc(inet_addr_winsock, inet_addr, unsigned long (PASCAL FAR *)(const char FAR * cp)); setfunc(ioctl_winsock, ioctlsocket, int (PASCAL FAR *)(SOCKET s, int cmd, void FAR *)); setfunc(listen_winsock, listen, int (PASCAL FAR *)(SOCKET s, int backlog)); setfunc(ntohs_winsock, ntohs, u_short (PASCAL FAR *)(u_short v)); setfunc(recv_winsock, recv, int (PASCAL FAR *)(SOCKET s, void FAR * buf, int len, int flags)); setfunc(select_winsock, select, int (PASCAL FAR *)(int nfds, fd_set FAR *readfds, fd_set FAR *writefds, fd_set FAR *exceptfds, const struct timeval FAR *timeout)); setfunc(send_winsock, send, int (PASCAL FAR *)(SOCKET s, const void FAR * buf, int len, int flags)); setfunc(setsockopt_winsock, setsockopt, int (PASCAL FAR *)(SOCKET s, int level, int optname, const void FAR * optval, int optlen)); setfunc(shutdown_winsock, shutdown, int (PASCAL FAR *)(SOCKET s, int how)); setfunc(socket_winsock, socket, SOCKET (PASCAL FAR *)(int af, int type, int protocol)); setfunc(gethostbyaddr_winsock, gethostbyaddr, struct hostent FAR * (PASCAL FAR *)(const char FAR * addr, int len, int type)); setfunc(gethostbyname_winsock, gethostbyname, struct hostent FAR * (PASCAL FAR *)(const char FAR * name)); setfunc(WSACleanup_winsock, WSACleanup, int (PASCAL FAR *)(void)); setfunc(WSAFDIsSet_winsock, __WSAFDIsSet, int (PASCAL FAR *)(SOCKET, fd_set FAR *)); setfunc(WSACreateEvent_winsock, WSACreateEvent, WSAEVENT (PASCAL FAR *)(void)); setfunc(WSACloseEvent_winsock, WSACloseEvent, BOOL (PASCAL FAR *)(WSAEVENT)); setfunc(WSASetEvent_winsock, WSASetEvent, BOOL (PASCAL FAR *)(WSAEVENT)); setfunc(WSAResetEvent_winsock, WSAResetEvent, BOOL (PASCAL FAR *)(WSAEVENT)); setfunc(WSAEventSelect_winsock, WSAEventSelect, int (PASCAL FAR *)(SOCKET, WSAEVENT, long)); setfunc(WSAWaitForMultipleEvents_winsock, WSAWaitForMultipleEvents, DWORD (PASCAL FAR *)(DWORD, const WSAEVENT FAR*, BOOL, DWORD, BOOL)); setfunc(WSAEnumNetworkEvents_winsock, WSAEnumNetworkEvents, int (PASCAL FAR *)(SOCKET, WSAEVENT, LPWSANETWORKEVENTS)); s_networkModule = module; } CArchSocket CArchNetworkWinsock::newSocket(EAddressFamily family, ESocketType type) { // create socket SOCKET fd = socket_winsock(s_family[family], s_type[type], 0); if (fd == INVALID_SOCKET) { throwError(getsockerror_winsock()); } try { setBlockingOnSocket(fd, false); } catch (...) { close_winsock(fd); throw; } // allocate socket object CArchSocketImpl* socket = new CArchSocketImpl; socket->m_socket = fd; socket->m_refCount = 1; socket->m_event = WSACreateEvent_winsock(); socket->m_pollWrite = true; return socket; } CArchSocket CArchNetworkWinsock::copySocket(CArchSocket s) { assert(s != NULL); // ref the socket and return it ARCH->lockMutex(m_mutex); ++s->m_refCount; ARCH->unlockMutex(m_mutex); return s; } void CArchNetworkWinsock::closeSocket(CArchSocket s) { assert(s != NULL); // unref the socket and note if it should be released ARCH->lockMutex(m_mutex); const bool doClose = (--s->m_refCount == 0); ARCH->unlockMutex(m_mutex); // close the socket if necessary if (doClose) { if (close_winsock(s->m_socket) == SOCKET_ERROR) { // close failed. restore the last ref and throw. int err = getsockerror_winsock(); ARCH->lockMutex(m_mutex); ++s->m_refCount; ARCH->unlockMutex(m_mutex); throwError(err); } WSACloseEvent_winsock(s->m_event); delete s; } } void CArchNetworkWinsock::closeSocketForRead(CArchSocket s) { assert(s != NULL); if (shutdown_winsock(s->m_socket, SD_RECEIVE) == SOCKET_ERROR) { if (getsockerror_winsock() != WSAENOTCONN) { throwError(getsockerror_winsock()); } } } void CArchNetworkWinsock::closeSocketForWrite(CArchSocket s) { assert(s != NULL); if (shutdown_winsock(s->m_socket, SD_SEND) == SOCKET_ERROR) { if (getsockerror_winsock() != WSAENOTCONN) { throwError(getsockerror_winsock()); } } } void CArchNetworkWinsock::bindSocket(CArchSocket s, CArchNetAddress addr) { assert(s != NULL); assert(addr != NULL); if (bind_winsock(s->m_socket, &addr->m_addr, addr->m_len) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } } void CArchNetworkWinsock::listenOnSocket(CArchSocket s) { assert(s != NULL); // hardcoding backlog if (listen_winsock(s->m_socket, 3) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } } CArchSocket CArchNetworkWinsock::acceptSocket(CArchSocket s, CArchNetAddress* addr) { assert(s != NULL); // create new socket and temporary address CArchSocketImpl* socket = new CArchSocketImpl; CArchNetAddress tmp = CArchNetAddressImpl::alloc(sizeof(struct sockaddr)); // accept on socket SOCKET fd = accept_winsock(s->m_socket, &tmp->m_addr, &tmp->m_len); if (fd == INVALID_SOCKET) { int err = getsockerror_winsock(); delete socket; free(tmp); *addr = NULL; if (err == WSAEWOULDBLOCK) { return NULL; } throwError(err); } try { setBlockingOnSocket(fd, false); } catch (...) { close_winsock(fd); delete socket; free(tmp); *addr = NULL; throw; } // initialize socket socket->m_socket = fd; socket->m_refCount = 1; socket->m_event = WSACreateEvent_winsock(); socket->m_pollWrite = true; // copy address if requested if (addr != NULL) { *addr = ARCH->copyAddr(tmp); } free(tmp); return socket; } bool CArchNetworkWinsock::connectSocket(CArchSocket s, CArchNetAddress addr) { assert(s != NULL); assert(addr != NULL); if (connect_winsock(s->m_socket, &addr->m_addr, addr->m_len) == SOCKET_ERROR) { if (getsockerror_winsock() == WSAEISCONN) { return true; } if (getsockerror_winsock() == WSAEWOULDBLOCK) { return false; } throwError(getsockerror_winsock()); } return true; } int CArchNetworkWinsock::pollSocket(CPollEntry pe[], int num, double timeout) { int i; DWORD n; // prepare sockets and wait list bool canWrite = false; WSAEVENT* events = (WSAEVENT*)alloca((num + 1) * sizeof(WSAEVENT)); for (i = 0, n = 0; i < num; ++i) { // reset return flags pe[i].m_revents = 0; // set invalid flag if socket is bogus then go to next socket if (pe[i].m_socket == NULL) { pe[i].m_revents |= kPOLLNVAL; continue; } // select desired events long socketEvents = 0; if ((pe[i].m_events & kPOLLIN) != 0) { socketEvents |= FD_READ | FD_ACCEPT | FD_CLOSE; } if ((pe[i].m_events & kPOLLOUT) != 0) { socketEvents |= FD_WRITE | FD_CONNECT | FD_CLOSE; // if m_pollWrite is false then we assume the socket is // writable. winsock doesn't signal writability except // when the state changes from unwritable. if (!pe[i].m_socket->m_pollWrite) { canWrite = true; pe[i].m_revents |= kPOLLOUT; } } // if no events then ignore socket if (socketEvents == 0) { continue; } // select socket for desired events WSAEventSelect_winsock(pe[i].m_socket->m_socket, pe[i].m_socket->m_event, socketEvents); // add socket event to wait list events[n++] = pe[i].m_socket->m_event; } // if no sockets then return immediately if (n == 0) { return 0; } // add the unblock event CArchMultithreadWindows* mt = CArchMultithreadWindows::getInstance(); CArchThread thread = mt->newCurrentThread(); WSAEVENT* unblockEvent = (WSAEVENT*)mt->getNetworkDataForThread(thread); ARCH->closeThread(thread); if (unblockEvent == NULL) { unblockEvent = new WSAEVENT; m_unblockEvents.push_back(unblockEvent); *unblockEvent = WSACreateEvent_winsock(); mt->setNetworkDataForCurrentThread(unblockEvent); } events[n++] = *unblockEvent; // prepare timeout DWORD t = (timeout < 0.0) ? INFINITE : (DWORD)(1000.0 * timeout); if (canWrite) { // if we know we can write then don't block t = 0; } // wait DWORD result = WSAWaitForMultipleEvents_winsock(n, events, FALSE, t, FALSE); // reset the unblock event WSAResetEvent_winsock(*unblockEvent); // handle results if (result == WSA_WAIT_FAILED) { if (getsockerror_winsock() == WSAEINTR) { // interrupted system call ARCH->testCancelThread(); return 0; } throwError(getsockerror_winsock()); } if (result == WSA_WAIT_TIMEOUT && !canWrite) { return 0; } if (result == WSA_WAIT_EVENT_0 + n - 1) { // the unblock event was signalled return 0; } for (i = 0, n = 0; i < num; ++i) { // skip events we didn't check if (pe[i].m_socket == NULL || (pe[i].m_events & (kPOLLIN | kPOLLOUT)) == 0) { continue; } // get events WSANETWORKEVENTS info; if (WSAEnumNetworkEvents_winsock(pe[i].m_socket->m_socket, pe[i].m_socket->m_event, &info) == SOCKET_ERROR) { continue; } if ((info.lNetworkEvents & FD_READ) != 0) { pe[i].m_revents |= kPOLLIN; } if ((info.lNetworkEvents & FD_ACCEPT) != 0) { pe[i].m_revents |= kPOLLIN; } if ((info.lNetworkEvents & FD_WRITE) != 0) { pe[i].m_revents |= kPOLLOUT; // socket is now writable so don't bothing polling for // writable until it becomes unwritable. pe[i].m_socket->m_pollWrite = false; } if ((info.lNetworkEvents & FD_CONNECT) != 0) { if (info.iErrorCode[FD_CONNECT_BIT] != 0) { pe[i].m_revents |= kPOLLERR; } else { pe[i].m_revents |= kPOLLOUT; pe[i].m_socket->m_pollWrite = false; } } if ((info.lNetworkEvents & FD_CLOSE) != 0) { if (info.iErrorCode[FD_CLOSE_BIT] != 0) { pe[i].m_revents |= kPOLLERR; } else { if ((pe[i].m_events & kPOLLIN) != 0) { pe[i].m_revents |= kPOLLIN; } if ((pe[i].m_events & kPOLLOUT) != 0) { pe[i].m_revents |= kPOLLOUT; } } } if (pe[i].m_revents != 0) { ++n; } } return (int)n; } void CArchNetworkWinsock::unblockPollSocket(CArchThread thread) { // set the unblock event CArchMultithreadWindows* mt = CArchMultithreadWindows::getInstance(); WSAEVENT* unblockEvent = (WSAEVENT*)mt->getNetworkDataForThread(thread); if (unblockEvent != NULL) { WSASetEvent_winsock(*unblockEvent); } } size_t CArchNetworkWinsock::readSocket(CArchSocket s, void* buf, size_t len) { assert(s != NULL); int n = recv_winsock(s->m_socket, buf, (int)len, 0); if (n == SOCKET_ERROR) { int err = getsockerror_winsock(); if (err == WSAEINTR || err == WSAEWOULDBLOCK) { return 0; } throwError(err); } return static_cast(n); } size_t CArchNetworkWinsock::writeSocket(CArchSocket s, const void* buf, size_t len) { assert(s != NULL); int n = send_winsock(s->m_socket, buf, (int)len, 0); if (n == SOCKET_ERROR) { int err = getsockerror_winsock(); if (err == WSAEINTR) { return 0; } if (err == WSAEWOULDBLOCK) { s->m_pollWrite = true; return 0; } throwError(err); } return static_cast(n); } void CArchNetworkWinsock::throwErrorOnSocket(CArchSocket s) { assert(s != NULL); // get the error from the socket layer int err = 0; int size = sizeof(err); if (getsockopt_winsock(s->m_socket, SOL_SOCKET, SO_ERROR, &err, &size) == SOCKET_ERROR) { err = getsockerror_winsock(); } // throw if there's an error if (err != 0) { throwError(err); } } void CArchNetworkWinsock::setBlockingOnSocket(SOCKET s, bool blocking) { assert(s != 0); int flag = blocking ? 0 : 1; if (ioctl_winsock(s, FIONBIO, &flag) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } } bool CArchNetworkWinsock::setNoDelayOnSocket(CArchSocket s, bool noDelay) { assert(s != NULL); // get old state BOOL oflag; int size = sizeof(oflag); if (getsockopt_winsock(s->m_socket, IPPROTO_TCP, TCP_NODELAY, &oflag, &size) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } // set new state BOOL flag = noDelay ? 1 : 0; size = sizeof(flag); if (setsockopt_winsock(s->m_socket, IPPROTO_TCP, TCP_NODELAY, &flag, size) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } return (oflag != 0); } bool CArchNetworkWinsock::setReuseAddrOnSocket(CArchSocket s, bool reuse) { assert(s != NULL); // get old state BOOL oflag; int size = sizeof(oflag); if (getsockopt_winsock(s->m_socket, SOL_SOCKET, SO_REUSEADDR, &oflag, &size) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } // set new state BOOL flag = reuse ? 1 : 0; size = sizeof(flag); if (setsockopt_winsock(s->m_socket, SOL_SOCKET, SO_REUSEADDR, &flag, size) == SOCKET_ERROR) { throwError(getsockerror_winsock()); } return (oflag != 0); } std::string CArchNetworkWinsock::getHostName() { char name[256]; if (gethostname_winsock(name, sizeof(name)) == -1) { name[0] = '\0'; } else { name[sizeof(name) - 1] = '\0'; } return name; } CArchNetAddress CArchNetworkWinsock::newAnyAddr(EAddressFamily family) { CArchNetAddressImpl* addr = NULL; switch (family) { case kINET: { addr = CArchNetAddressImpl::alloc(sizeof(struct sockaddr_in)); struct sockaddr_in* ipAddr = TYPED_ADDR(struct sockaddr_in, addr); ipAddr->sin_family = AF_INET; ipAddr->sin_port = 0; ipAddr->sin_addr.s_addr = INADDR_ANY; break; } default: assert(0 && "invalid family"); } return addr; } CArchNetAddress CArchNetworkWinsock::copyAddr(CArchNetAddress addr) { assert(addr != NULL); CArchNetAddressImpl* copy = CArchNetAddressImpl::alloc(addr->m_len); memcpy(TYPED_ADDR(void, copy), TYPED_ADDR(void, addr), addr->m_len); return copy; } CArchNetAddress CArchNetworkWinsock::nameToAddr(const std::string& name) { // allocate address CArchNetAddressImpl* addr = NULL; // try to convert assuming an IPv4 dot notation address struct sockaddr_in inaddr; memset(&inaddr, 0, sizeof(inaddr)); inaddr.sin_family = AF_INET; inaddr.sin_port = 0; inaddr.sin_addr.s_addr = inet_addr_winsock(name.c_str()); if (inaddr.sin_addr.s_addr != INADDR_NONE) { // it's a dot notation address addr = CArchNetAddressImpl::alloc(sizeof(struct sockaddr_in)); memcpy(TYPED_ADDR(void, addr), &inaddr, addr->m_len); } else { // address lookup struct hostent* info = gethostbyname_winsock(name.c_str()); if (info == NULL) { throwNameError(getsockerror_winsock()); } // copy over address (only IPv4 currently supported) if (info->h_addrtype == AF_INET) { addr = CArchNetAddressImpl::alloc(sizeof(struct sockaddr_in)); memcpy(&inaddr.sin_addr, info->h_addr_list[0], sizeof(inaddr.sin_addr)); memcpy(TYPED_ADDR(void, addr), &inaddr, addr->m_len); } else { throw XArchNetworkNameUnsupported( "The requested name is valid but " "does not have a supported address family"); } } return addr; } void CArchNetworkWinsock::closeAddr(CArchNetAddress addr) { assert(addr != NULL); free(addr); } std::string CArchNetworkWinsock::addrToName(CArchNetAddress addr) { assert(addr != NULL); // name lookup struct hostent* info = gethostbyaddr_winsock( reinterpret_cast(&addr->m_addr), addr->m_len, addr->m_addr.sa_family); if (info == NULL) { throwNameError(getsockerror_winsock()); } // return (primary) name return info->h_name; } std::string CArchNetworkWinsock::addrToString(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); return inet_ntoa_winsock(ipAddr->sin_addr); } default: assert(0 && "unknown address family"); return ""; } } IArchNetwork::EAddressFamily CArchNetworkWinsock::getAddrFamily(CArchNetAddress addr) { assert(addr != NULL); switch (addr->m_addr.sa_family) { case AF_INET: return kINET; default: return kUNKNOWN; } } void CArchNetworkWinsock::setAddrPort(CArchNetAddress addr, int port) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); ipAddr->sin_port = htons_winsock(static_cast(port)); break; } default: assert(0 && "unknown address family"); break; } } int CArchNetworkWinsock::getAddrPort(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); return ntohs_winsock(ipAddr->sin_port); } default: assert(0 && "unknown address family"); return 0; } } bool CArchNetworkWinsock::isAnyAddr(CArchNetAddress addr) { assert(addr != NULL); switch (getAddrFamily(addr)) { case kINET: { struct sockaddr_in* ipAddr = reinterpret_cast(&addr->m_addr); return (addr->m_len == sizeof(struct sockaddr_in) && ipAddr->sin_addr.s_addr == INADDR_ANY); } default: assert(0 && "unknown address family"); return true; } } bool CArchNetworkWinsock::isEqualAddr(CArchNetAddress a, CArchNetAddress b) { return (a == b || (a->m_len == b->m_len && memcmp(&a->m_addr, &b->m_addr, a->m_len) == 0)); } void CArchNetworkWinsock::throwError(int err) { switch (err) { case WSAEACCES: throw XArchNetworkAccess(new XArchEvalWinsock(err)); case WSAEMFILE: case WSAENOBUFS: case WSAENETDOWN: throw XArchNetworkResource(new XArchEvalWinsock(err)); case WSAEPROTOTYPE: case WSAEPROTONOSUPPORT: case WSAEAFNOSUPPORT: case WSAEPFNOSUPPORT: case WSAESOCKTNOSUPPORT: case WSAEINVAL: case WSAENOPROTOOPT: case WSAEOPNOTSUPP: case WSAESHUTDOWN: case WSANOTINITIALISED: case WSAVERNOTSUPPORTED: case WSASYSNOTREADY: throw XArchNetworkSupport(new XArchEvalWinsock(err)); case WSAEADDRNOTAVAIL: throw XArchNetworkNoAddress(new XArchEvalWinsock(err)); case WSAEADDRINUSE: throw XArchNetworkAddressInUse(new XArchEvalWinsock(err)); case WSAEHOSTUNREACH: case WSAENETUNREACH: throw XArchNetworkNoRoute(new XArchEvalWinsock(err)); case WSAENOTCONN: throw XArchNetworkNotConnected(new XArchEvalWinsock(err)); case WSAEDISCON: throw XArchNetworkShutdown(new XArchEvalWinsock(err)); case WSAENETRESET: case WSAECONNABORTED: case WSAECONNRESET: throw XArchNetworkDisconnected(new XArchEvalWinsock(err)); case WSAECONNREFUSED: throw XArchNetworkConnectionRefused(new XArchEvalWinsock(err)); case WSAEHOSTDOWN: case WSAETIMEDOUT: throw XArchNetworkTimedOut(new XArchEvalWinsock(err)); case WSAHOST_NOT_FOUND: throw XArchNetworkNameUnknown(new XArchEvalWinsock(err)); case WSANO_DATA: throw XArchNetworkNameNoAddress(new XArchEvalWinsock(err)); case WSANO_RECOVERY: throw XArchNetworkNameFailure(new XArchEvalWinsock(err)); case WSATRY_AGAIN: throw XArchNetworkNameUnavailable(new XArchEvalWinsock(err)); default: throw XArchNetwork(new XArchEvalWinsock(err)); } } void CArchNetworkWinsock::throwNameError(int err) { switch (err) { case WSAHOST_NOT_FOUND: throw XArchNetworkNameUnknown(new XArchEvalWinsock(err)); case WSANO_DATA: throw XArchNetworkNameNoAddress(new XArchEvalWinsock(err)); case WSANO_RECOVERY: throw XArchNetworkNameFailure(new XArchEvalWinsock(err)); case WSATRY_AGAIN: throw XArchNetworkNameUnavailable(new XArchEvalWinsock(err)); default: throw XArchNetworkName(new XArchEvalWinsock(err)); } } synergy-1.4.12-Source/src/lib/arch/CArchNetworkWinsock.h0000600000175000017500000000667412021261364023034 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHNETWORKWINSOCK_H #define CARCHNETWORKWINSOCK_H #define WIN32_LEAN_AND_MEAN // declare no functions in winsock2 #define INCL_WINSOCK_API_PROTOTYPES 0 #define INCL_WINSOCK_API_TYPEDEFS 0 #include "IArchNetwork.h" #include "IArchMultithread.h" #include #include #include #define ARCH_NETWORK CArchNetworkWinsock class CArchSocketImpl { public: SOCKET m_socket; int m_refCount; WSAEVENT m_event; bool m_pollWrite; }; class CArchNetAddressImpl { public: static CArchNetAddressImpl* alloc(size_t); public: int m_len; struct sockaddr m_addr; }; #define ADDR_HDR_SIZE offsetof(CArchNetAddressImpl, m_addr) #define TYPED_ADDR(type_, addr_) (reinterpret_cast(&addr_->m_addr)) //! Win32 implementation of IArchNetwork class CArchNetworkWinsock : public IArchNetwork { public: CArchNetworkWinsock(); virtual ~CArchNetworkWinsock(); virtual void init(); // IArchNetwork overrides virtual CArchSocket newSocket(EAddressFamily, ESocketType); virtual CArchSocket copySocket(CArchSocket s); virtual void closeSocket(CArchSocket s); virtual void closeSocketForRead(CArchSocket s); virtual void closeSocketForWrite(CArchSocket s); virtual void bindSocket(CArchSocket s, CArchNetAddress addr); virtual void listenOnSocket(CArchSocket s); virtual CArchSocket acceptSocket(CArchSocket s, CArchNetAddress* addr); virtual bool connectSocket(CArchSocket s, CArchNetAddress name); virtual int pollSocket(CPollEntry[], int num, double timeout); virtual void unblockPollSocket(CArchThread thread); virtual size_t readSocket(CArchSocket s, void* buf, size_t len); virtual size_t writeSocket(CArchSocket s, const void* buf, size_t len); virtual void throwErrorOnSocket(CArchSocket); virtual bool setNoDelayOnSocket(CArchSocket, bool noDelay); virtual bool setReuseAddrOnSocket(CArchSocket, bool reuse); virtual std::string getHostName(); virtual CArchNetAddress newAnyAddr(EAddressFamily); virtual CArchNetAddress copyAddr(CArchNetAddress); virtual CArchNetAddress nameToAddr(const std::string&); virtual void closeAddr(CArchNetAddress); virtual std::string addrToName(CArchNetAddress); virtual std::string addrToString(CArchNetAddress); virtual EAddressFamily getAddrFamily(CArchNetAddress); virtual void setAddrPort(CArchNetAddress, int port); virtual int getAddrPort(CArchNetAddress); virtual bool isAnyAddr(CArchNetAddress); virtual bool isEqualAddr(CArchNetAddress, CArchNetAddress); private: void initModule(HMODULE); void setBlockingOnSocket(SOCKET, bool blocking); void throwError(int); void throwNameError(int); private: typedef std::list CEventList; CArchMutex m_mutex; CEventList m_unblockEvents; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchPluginUnix.cpp0000600000175000017500000000157312021261364022473 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchPluginUnix.h" CArchPluginUnix::CArchPluginUnix() { } CArchPluginUnix::~CArchPluginUnix() { } void CArchPluginUnix::init(void* eventTarget) { } synergy-1.4.12-Source/src/lib/arch/CArchPluginUnix.h0000600000175000017500000000176412021261364022142 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IArchPlugin.h" #define ARCH_PLUGIN CArchPluginUnix //! Unix implementation of IArchPlugin class CArchPluginUnix : public IArchPlugin { public: CArchPluginUnix(); virtual ~CArchPluginUnix(); // IArchPlugin overrides void init(void* eventTarget); }; synergy-1.4.12-Source/src/lib/arch/CArchPluginWindows.cpp0000600000175000017500000000624012021261364023176 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchPluginWindows.h" #include "XArchWindows.h" #include "CLog.h" #include "IEventQueue.h" #include "CEvent.h" #include "CScreen.h" #include "IPlatformScreen.h" // temp #define WIN32_LEAN_AND_MEAN #include #include typedef int (*initFunc)(void (*sendEvent)(const char*, void*), void (*log)(const char*)); void* CArchPluginWindows::m_eventTarget = NULL; CArchPluginWindows::CArchPluginWindows() { } CArchPluginWindows::~CArchPluginWindows() { } void CArchPluginWindows::init(void* eventTarget) { m_eventTarget = eventTarget; CString dir = getPluginsDir(); LOG((CLOG_DEBUG "plugins dir: %s", dir.c_str())); CString pattern = CString(dir).append("\\*.dll"); std::vector plugins; getFilenames(pattern, plugins); std::vector::iterator it; for (it = plugins.begin(); it != plugins.end(); ++it) load(*it); } void CArchPluginWindows::load(const CString& dllFilename) { LOG((CLOG_DEBUG "loading plugin: %s", dllFilename.c_str())); CString path = CString(getPluginsDir()).append("\\").append(dllFilename); HINSTANCE library = LoadLibrary(path.c_str()); if (library == NULL) throw XArch(new XArchEvalWindows); initFunc initPlugin = (initFunc)GetProcAddress(library, "init"); initPlugin(&sendEvent, &log); } CString CArchPluginWindows::getModuleDir() { TCHAR c_modulePath[MAX_PATH]; if (GetModuleFileName(NULL, c_modulePath, MAX_PATH) == 0) { throw XArch(new XArchEvalWindows); } CString modulePath(c_modulePath); size_t lastSlash = modulePath.find_last_of("\\"); if (lastSlash != CString::npos) { return modulePath.substr(0, lastSlash); } throw XArch("could not get module path."); } void CArchPluginWindows::getFilenames(const CString& pattern, std::vector& filenames) { WIN32_FIND_DATA data; HANDLE find = FindFirstFile(pattern.c_str(), &data); if (find == INVALID_HANDLE_VALUE) { FindClose(find); LOG((CLOG_DEBUG "plugins dir is empty: %s", pattern.c_str())); return; } do { filenames.push_back(data.cFileName); } while (FindNextFile(find, &data)); FindClose(find); } CString CArchPluginWindows::getPluginsDir() { return getModuleDir().append("\\").append(PLUGINS_DIR); } void sendEvent(const char* eventName, void* data) { LOG((CLOG_DEBUG5 "plugin sending event")); CEvent::Type type = EVENTQUEUE->getRegisteredType(eventName); EVENTQUEUE->addEvent(CEvent(type, CArchPluginWindows::m_eventTarget, data)); } void log(const char* text) { LOG((CLOG_DEBUG "plugin: %s", text)); } synergy-1.4.12-Source/src/lib/arch/CArchPluginWindows.h0000600000175000017500000000254712021261364022651 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IArchPlugin.h" #include "CString.h" #include #define ARCH_PLUGIN CArchPluginWindows class CScreen; //! Windows implementation of IArchPlugin class CArchPluginWindows : public IArchPlugin { public: CArchPluginWindows(); virtual ~CArchPluginWindows(); // IArchPlugin overrides void init(void* eventTarget); static void* m_eventTarget; private: CString getModuleDir(); void getFilenames(const CString& pattern, std::vector& filenames); void load(const CString& dllPath); CString getPluginsDir(); }; void sendEvent(const char* text, void* data); void log(const char* text); synergy-1.4.12-Source/src/lib/arch/CArchSleepUnix.cpp0000600000175000017500000000412312021261364022277 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchSleepUnix.h" #include "CArch.h" #if TIME_WITH_SYS_TIME # include # include #else # if HAVE_SYS_TIME_H # include # else # include # endif #endif #if !HAVE_NANOSLEEP # if HAVE_SYS_SELECT_H # include # endif # if HAVE_SYS_TYPES_H # include # endif # if HAVE_UNISTD_H # include # endif #endif // // CArchSleepUnix // CArchSleepUnix::CArchSleepUnix() { // do nothing } CArchSleepUnix::~CArchSleepUnix() { // do nothing } void CArchSleepUnix::sleep(double timeout) { ARCH->testCancelThread(); if (timeout < 0.0) { return; } #if HAVE_NANOSLEEP // prep timeout struct timespec t; t.tv_sec = (long)timeout; t.tv_nsec = (long)(1.0e+9 * (timeout - (double)t.tv_sec)); // wait while (nanosleep(&t, &t) < 0) ARCH->testCancelThread(); #else /* emulate nanosleep() with select() */ double startTime = ARCH->time(); double timeLeft = timeout; while (timeLeft > 0.0) { struct timeval timeout2; timeout2.tv_sec = static_cast(timeLeft); timeout2.tv_usec = static_cast(1.0e+6 * (timeLeft - timeout2.tv_sec)); select((SELECT_TYPE_ARG1) 0, SELECT_TYPE_ARG234 NULL, SELECT_TYPE_ARG234 NULL, SELECT_TYPE_ARG234 NULL, SELECT_TYPE_ARG5 &timeout2); ARCH->testCancelThread(); timeLeft = timeout - (ARCH->time() - startTime); } #endif } synergy-1.4.12-Source/src/lib/arch/CArchSleepUnix.h0000600000175000017500000000204112021261364021741 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSLEEPUNIX_H #define CARCHSLEEPUNIX_H #include "IArchSleep.h" #define ARCH_SLEEP CArchSleepUnix //! Unix implementation of IArchSleep class CArchSleepUnix : public IArchSleep { public: CArchSleepUnix(); virtual ~CArchSleepUnix(); // IArchSleep overrides virtual void sleep(double timeout); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchSleepWindows.cpp0000600000175000017500000000314112021261364023005 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchSleepWindows.h" #include "CArch.h" #include "CArchMultithreadWindows.h" // // CArchSleepWindows // CArchSleepWindows::CArchSleepWindows() { // do nothing } CArchSleepWindows::~CArchSleepWindows() { // do nothing } void CArchSleepWindows::sleep(double timeout) { ARCH->testCancelThread(); if (timeout < 0.0) { return; } // get the cancel event from the current thread. this only // works if we're using the windows multithread object but // this is windows so that's pretty certain; we'll get a // link error if we're not, though. CArchMultithreadWindows* mt = CArchMultithreadWindows::getInstance(); if (mt != NULL) { HANDLE cancelEvent = mt->getCancelEventForCurrentThread(); WaitForSingleObject(cancelEvent, (DWORD)(1000.0 * timeout)); if (timeout == 0.0) { Sleep(0); } } else { Sleep((DWORD)(1000.0 * timeout)); } ARCH->testCancelThread(); } synergy-1.4.12-Source/src/lib/arch/CArchSleepWindows.h0000600000175000017500000000206412021261364022455 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSLEEPWINDOWS_H #define CARCHSLEEPWINDOWS_H #include "IArchSleep.h" #define ARCH_SLEEP CArchSleepWindows //! Win32 implementation of IArchSleep class CArchSleepWindows : public IArchSleep { public: CArchSleepWindows(); virtual ~CArchSleepWindows(); // IArchSleep overrides virtual void sleep(double timeout); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchStringUnix.cpp0000600000175000017500000000200412021261364022471 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchStringUnix.h" #include // // CArchStringUnix // #include "CMultibyte.h" #include "vsnprintf.h" CArchStringUnix::CArchStringUnix() { } CArchStringUnix::~CArchStringUnix() { } IArchString::EWideCharEncoding CArchStringUnix::getWideCharEncoding() { return kUCS4; } synergy-1.4.12-Source/src/lib/arch/CArchStringUnix.h0000600000175000017500000000207612021261364022147 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSTRINGUNIX_H #define CARCHSTRINGUNIX_H #include "IArchString.h" #define ARCH_STRING CArchStringUnix //! Unix implementation of IArchString class CArchStringUnix : public IArchString { public: CArchStringUnix(); virtual ~CArchStringUnix(); // IArchString overrides virtual EWideCharEncoding getWideCharEncoding(); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchStringWindows.cpp0000600000175000017500000000220712021261364023205 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define WIN32_LEAN_AND_MEAN #include "CArchStringWindows.h" #include #include // // CArchStringWindows // #include "CMultibyte.h" #define HAVE_VSNPRINTF 1 #define ARCH_VSNPRINTF _vsnprintf #include "vsnprintf.h" CArchStringWindows::CArchStringWindows() { } CArchStringWindows::~CArchStringWindows() { } IArchString::EWideCharEncoding CArchStringWindows::getWideCharEncoding() { return kUTF16; } synergy-1.4.12-Source/src/lib/arch/CArchStringWindows.h0000600000175000017500000000212112021261364022645 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSTRINGWINDOWS_H #define CARCHSTRINGWINDOWS_H #include "IArchString.h" #define ARCH_STRING CArchStringWindows //! Win32 implementation of IArchString class CArchStringWindows : public IArchString { public: CArchStringWindows(); virtual ~CArchStringWindows(); // IArchString overrides virtual EWideCharEncoding getWideCharEncoding(); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchSystemUnix.cpp0000600000175000017500000000305212021261364022513 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchSystemUnix.h" #include // // CArchSystemUnix // CArchSystemUnix::CArchSystemUnix() { // do nothing } CArchSystemUnix::~CArchSystemUnix() { // do nothing } std::string CArchSystemUnix::getOSName() const { #if defined(HAVE_SYS_UTSNAME_H) struct utsname info; if (uname(&info) == 0) { std::string msg; msg += info.sysname; msg += " "; msg += info.release; msg += " "; msg += info.version; return msg; } #endif return "Unix"; } std::string CArchSystemUnix::getPlatformName() const { #if defined(HAVE_SYS_UTSNAME_H) struct utsname info; if (uname(&info) == 0) { return std::string(info.machine); } #endif return "unknown"; } std::string CArchSystemUnix::setting(const std::string&) const { return ""; } void CArchSystemUnix::setting(const std::string&, const std::string&) const { } synergy-1.4.12-Source/src/lib/arch/CArchSystemUnix.h0000600000175000017500000000233112021261364022157 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSYSTEMUNIX_H #define CARCHSYSTEMUNIX_H #include "IArchSystem.h" #define ARCH_SYSTEM CArchSystemUnix //! Unix implementation of IArchString class CArchSystemUnix : public IArchSystem { public: CArchSystemUnix(); virtual ~CArchSystemUnix(); // IArchSystem overrides virtual std::string getOSName() const; virtual std::string getPlatformName() const; virtual std::string setting(const std::string&) const; virtual void setting(const std::string&, const std::string&) const; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchSystemWindows.cpp0000600000175000017500000001055012021261364023223 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchSystemWindows.h" #include "CArchMiscWindows.h" #include "XArchWindows.h" #include "tchar.h" #include static const char* s_settingsKeyNames[] = { _T("SOFTWARE"), _T("Synergy"), NULL }; // // CArchSystemWindows // CArchSystemWindows::CArchSystemWindows() { // do nothing } CArchSystemWindows::~CArchSystemWindows() { // do nothing } std::string CArchSystemWindows::getOSName() const { #if WINVER >= _WIN32_WINNT_WIN2K OSVERSIONINFOEX info; #else OSVERSIONINFO info; #endif info.dwOSVersionInfoSize = sizeof(info); if (GetVersionEx((OSVERSIONINFO*) &info)) { switch (info.dwPlatformId) { case VER_PLATFORM_WIN32_NT: #if WINVER >= _WIN32_WINNT_WIN2K if (info.dwMajorVersion == 6) { if(info.dwMinorVersion == 0) { if (info.wProductType == VER_NT_WORKSTATION) { return "Microsoft Windows Vista"; } else { return "Microsoft Windows Server 2008"; } } else if(info.dwMinorVersion == 1) { if (info.wProductType == VER_NT_WORKSTATION) { return "Microsoft Windows 7"; } else { return "Microsoft Windows Server 2008 R2"; } } } #endif if (info.dwMajorVersion == 5 && info.dwMinorVersion == 2) { return "Microsoft Windows Server 2003"; } if (info.dwMajorVersion == 5 && info.dwMinorVersion == 1) { return "Microsoft Windows XP"; } if (info.dwMajorVersion == 5 && info.dwMinorVersion == 0) { return "Microsoft Windows Server 2000"; } if (info.dwMajorVersion <= 4) { return "Microsoft Windows NT"; } char buffer[100]; sprintf(buffer, "Microsoft Windows %d.%d", info.dwMajorVersion, info.dwMinorVersion); return buffer; case VER_PLATFORM_WIN32_WINDOWS: if (info.dwMajorVersion == 4 && info.dwMinorVersion == 0) { if (info.szCSDVersion[1] == 'C' || info.szCSDVersion[1] == 'B') { return "Microsoft Windows 95 OSR2"; } return "Microsoft Windows 95"; } if (info.dwMajorVersion == 4 && info.dwMinorVersion == 10) { if (info.szCSDVersion[1] == 'A') { return "Microsoft Windows 98 SE"; } return "Microsoft Windows 98"; } if (info.dwMajorVersion == 4 && info.dwMinorVersion == 90) { return "Microsoft Windows ME"; } if (info.dwMajorVersion == 4) { return "Microsoft Windows unknown 95 family"; } break; default: break; } } return "Microsoft Windows "; } std::string CArchSystemWindows::getPlatformName() const { #ifdef _X86_ if(isWOW64()) return "x86 (WOW64)"; else return "x86"; #else #ifdef _AMD64_ return "x64"; #else return "Unknown"; #endif #endif } std::string CArchSystemWindows::setting(const std::string& valueName) const { HKEY key = CArchMiscWindows::openKey(HKEY_LOCAL_MACHINE, s_settingsKeyNames); if (key == NULL) return ""; return CArchMiscWindows::readValueString(key, valueName.c_str()); } void CArchSystemWindows::setting(const std::string& valueName, const std::string& valueString) const { HKEY key = CArchMiscWindows::addKey(HKEY_LOCAL_MACHINE, s_settingsKeyNames); if (key == NULL) throw XArch(std::string("could not access registry key: ") + valueName); CArchMiscWindows::setValue(key, valueName.c_str(), valueString.c_str()); } bool CArchSystemWindows::isWOW64() const { #if WINVER >= _WIN32_WINNT_WINXP typedef BOOL (WINAPI *LPFN_ISWOW64PROCESS) (HANDLE, PBOOL); HMODULE hModule = GetModuleHandle(TEXT("kernel32")); if (!hModule) return FALSE; LPFN_ISWOW64PROCESS fnIsWow64Process = (LPFN_ISWOW64PROCESS) GetProcAddress(hModule, "IsWow64Process"); BOOL bIsWow64 = FALSE; if(NULL != fnIsWow64Process && fnIsWow64Process(GetCurrentProcess(), &bIsWow64) && bIsWow64) { return true; } #endif return false; } synergy-1.4.12-Source/src/lib/arch/CArchSystemWindows.h0000600000175000017500000000244412021261364022673 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHSYSTEMWINDOWS_H #define CARCHSYSTEMWINDOWS_H #include "IArchSystem.h" #define ARCH_SYSTEM CArchSystemWindows //! Win32 implementation of IArchString class CArchSystemWindows : public IArchSystem { public: CArchSystemWindows(); virtual ~CArchSystemWindows(); // IArchSystem overrides virtual std::string getOSName() const; virtual std::string getPlatformName() const; virtual std::string setting(const std::string& valueName) const; virtual void setting(const std::string& valueName, const std::string& valueString) const; bool isWOW64() const; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchTaskBarWindows.cpp0000600000175000017500000002744012021261364023274 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchTaskBarWindows.h" #include "CArchMiscWindows.h" #include "IArchTaskBarReceiver.h" #include "CArch.h" #include "XArch.h" #include #include #include "CAppUtilWindows.h" static const UINT kAddReceiver = WM_USER + 10; static const UINT kRemoveReceiver = WM_USER + 11; static const UINT kUpdateReceiver = WM_USER + 12; static const UINT kNotifyReceiver = WM_USER + 13; static const UINT kFirstReceiverID = WM_USER + 14; // // CArchTaskBarWindows // CArchTaskBarWindows* CArchTaskBarWindows::s_instance = NULL; CArchTaskBarWindows::CArchTaskBarWindows() : m_nextID(kFirstReceiverID) { // save the singleton instance s_instance = this; } CArchTaskBarWindows::~CArchTaskBarWindows() { if (m_thread != NULL) { PostMessage(m_hwnd, WM_QUIT, 0, 0); ARCH->wait(m_thread, -1.0); ARCH->closeThread(m_thread); } ARCH->closeCondVar(m_condVar); ARCH->closeMutex(m_mutex); s_instance = NULL; } void CArchTaskBarWindows::init() { // we need a mutex m_mutex = ARCH->newMutex(); // and a condition variable which uses the above mutex m_ready = false; m_condVar = ARCH->newCondVar(); // we're going to want to get a result from the thread we're // about to create to know if it initialized successfully. // so we lock the condition variable. ARCH->lockMutex(m_mutex); // open a window and run an event loop in a separate thread. // this has to happen in a separate thread because if we // create a window on the current desktop with the current // thread then the current thread won't be able to switch // desktops if it needs to. m_thread = ARCH->newThread(&CArchTaskBarWindows::threadEntry, this); // wait for child thread while (!m_ready) { ARCH->waitCondVar(m_condVar, m_mutex, -1.0); } // ready ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::addDialog(HWND hwnd) { CArchMiscWindows::addDialog(hwnd); } void CArchTaskBarWindows::removeDialog(HWND hwnd) { CArchMiscWindows::removeDialog(hwnd); } void CArchTaskBarWindows::addReceiver(IArchTaskBarReceiver* receiver) { // ignore bogus receiver if (receiver == NULL) { return; } // add receiver if necessary CReceiverToInfoMap::iterator index = m_receivers.find(receiver); if (index == m_receivers.end()) { // add it, creating a new message ID for it CReceiverInfo info; info.m_id = getNextID(); index = m_receivers.insert(std::make_pair(receiver, info)).first; // add ID to receiver mapping m_idTable.insert(std::make_pair(info.m_id, index)); } // add receiver PostMessage(m_hwnd, kAddReceiver, index->second.m_id, 0); } void CArchTaskBarWindows::removeReceiver(IArchTaskBarReceiver* receiver) { // find receiver CReceiverToInfoMap::iterator index = m_receivers.find(receiver); if (index == m_receivers.end()) { return; } // remove icon. wait for this to finish before returning. SendMessage(m_hwnd, kRemoveReceiver, index->second.m_id, 0); // recycle the ID recycleID(index->second.m_id); // discard m_idTable.erase(index->second.m_id); m_receivers.erase(index); } void CArchTaskBarWindows::updateReceiver(IArchTaskBarReceiver* receiver) { // find receiver CReceiverToInfoMap::const_iterator index = m_receivers.find(receiver); if (index == m_receivers.end()) { return; } // update icon and tool tip PostMessage(m_hwnd, kUpdateReceiver, index->second.m_id, 0); } UINT CArchTaskBarWindows::getNextID() { if (m_oldIDs.empty()) { return m_nextID++; } UINT id = m_oldIDs.back(); m_oldIDs.pop_back(); return id; } void CArchTaskBarWindows::recycleID(UINT id) { m_oldIDs.push_back(id); } void CArchTaskBarWindows::addIcon(UINT id) { ARCH->lockMutex(m_mutex); CIDToReceiverMap::const_iterator index = m_idTable.find(id); if (index != m_idTable.end()) { modifyIconNoLock(index->second, NIM_ADD); } ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::removeIcon(UINT id) { ARCH->lockMutex(m_mutex); removeIconNoLock(id); ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::updateIcon(UINT id) { ARCH->lockMutex(m_mutex); CIDToReceiverMap::const_iterator index = m_idTable.find(id); if (index != m_idTable.end()) { modifyIconNoLock(index->second, NIM_MODIFY); } ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::addAllIcons() { ARCH->lockMutex(m_mutex); for (CReceiverToInfoMap::const_iterator index = m_receivers.begin(); index != m_receivers.end(); ++index) { modifyIconNoLock(index, NIM_ADD); } ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::removeAllIcons() { ARCH->lockMutex(m_mutex); for (CReceiverToInfoMap::const_iterator index = m_receivers.begin(); index != m_receivers.end(); ++index) { removeIconNoLock(index->second.m_id); } ARCH->unlockMutex(m_mutex); } void CArchTaskBarWindows::modifyIconNoLock( CReceiverToInfoMap::const_iterator index, DWORD taskBarMessage) { // get receiver UINT id = index->second.m_id; IArchTaskBarReceiver* receiver = index->first; // lock receiver so icon and tool tip are guaranteed to be consistent receiver->lock(); // get icon data HICON icon = reinterpret_cast( const_cast(receiver->getIcon())); // get tool tip std::string toolTip = receiver->getToolTip(); // done querying receiver->unlock(); // prepare to add icon NOTIFYICONDATA data; data.cbSize = sizeof(NOTIFYICONDATA); data.hWnd = m_hwnd; data.uID = id; data.uFlags = NIF_MESSAGE; data.uCallbackMessage = kNotifyReceiver; data.hIcon = icon; if (icon != NULL) { data.uFlags |= NIF_ICON; } if (!toolTip.empty()) { strncpy(data.szTip, toolTip.c_str(), sizeof(data.szTip)); data.szTip[sizeof(data.szTip) - 1] = '\0'; data.uFlags |= NIF_TIP; } else { data.szTip[0] = '\0'; } // add icon if (Shell_NotifyIcon(taskBarMessage, &data) == 0) { // failed } } void CArchTaskBarWindows::removeIconNoLock(UINT id) { NOTIFYICONDATA data; data.cbSize = sizeof(NOTIFYICONDATA); data.hWnd = m_hwnd; data.uID = id; if (Shell_NotifyIcon(NIM_DELETE, &data) == 0) { // failed } } void CArchTaskBarWindows::handleIconMessage( IArchTaskBarReceiver* receiver, LPARAM lParam) { // process message switch (lParam) { case WM_LBUTTONDOWN: receiver->showStatus(); break; case WM_LBUTTONDBLCLK: receiver->primaryAction(); break; case WM_RBUTTONUP: { POINT p; GetCursorPos(&p); receiver->runMenu(p.x, p.y); break; } case WM_MOUSEMOVE: // currently unused break; default: // unused break; } } bool CArchTaskBarWindows::processDialogs(MSG* msg) { // only one thread can be in this method on any particular object // at any given time. that's not a problem since only our event // loop calls this method and there's just one of those. ARCH->lockMutex(m_mutex); // remove removed dialogs m_dialogs.erase(false); // merge added dialogs into the dialog list for (CDialogs::const_iterator index = m_addedDialogs.begin(); index != m_addedDialogs.end(); ++index) { m_dialogs.insert(std::make_pair(index->first, index->second)); } m_addedDialogs.clear(); ARCH->unlockMutex(m_mutex); // check message against all dialogs until one handles it. // note that we don't hold a lock while checking because // the message is processed and may make calls to this // object. that's okay because addDialog() and // removeDialog() don't change the map itself (just the // values of some elements). ARCH->lockMutex(m_mutex); for (CDialogs::const_iterator index = m_dialogs.begin(); index != m_dialogs.end(); ++index) { if (index->second) { ARCH->unlockMutex(m_mutex); if (IsDialogMessage(index->first, msg)) { return true; } ARCH->lockMutex(m_mutex); } } ARCH->unlockMutex(m_mutex); return false; } LRESULT CArchTaskBarWindows::wndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { switch (msg) { case kNotifyReceiver: { // lookup receiver CIDToReceiverMap::const_iterator index = m_idTable.find((UINT)wParam); if (index != m_idTable.end()) { IArchTaskBarReceiver* receiver = index->second->first; handleIconMessage(receiver, lParam); return 0; } break; } case kAddReceiver: addIcon((UINT)wParam); break; case kRemoveReceiver: removeIcon((UINT)wParam); break; case kUpdateReceiver: updateIcon((UINT)wParam); break; default: if (msg == m_taskBarRestart) { // task bar was recreated so re-add our icons addAllIcons(); } break; } return DefWindowProc(hwnd, msg, wParam, lParam); } LRESULT CALLBACK CArchTaskBarWindows::staticWndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { // if msg is WM_NCCREATE, extract the CArchTaskBarWindows* and put // it in the extra window data then forward the call. CArchTaskBarWindows* self = NULL; if (msg == WM_NCCREATE) { CREATESTRUCT* createInfo; createInfo = reinterpret_cast(lParam); self = reinterpret_cast( createInfo->lpCreateParams); SetWindowLong(hwnd, 0, reinterpret_cast(self)); } else { // get the extra window data and forward the call LONG data = GetWindowLong(hwnd, 0); if (data != 0) { self = reinterpret_cast( reinterpret_cast(data)); } } // forward the message if (self != NULL) { return self->wndProc(hwnd, msg, wParam, lParam); } else { return DefWindowProc(hwnd, msg, wParam, lParam); } } void CArchTaskBarWindows::threadMainLoop() { // register the task bar restart message m_taskBarRestart = RegisterWindowMessage(TEXT("TaskbarCreated")); // register a window class WNDCLASSEX classInfo; classInfo.cbSize = sizeof(classInfo); classInfo.style = CS_NOCLOSE; classInfo.lpfnWndProc = &CArchTaskBarWindows::staticWndProc; classInfo.cbClsExtra = 0; classInfo.cbWndExtra = sizeof(CArchTaskBarWindows*); classInfo.hInstance = instanceWin32(); classInfo.hIcon = NULL; classInfo.hCursor = NULL; classInfo.hbrBackground = NULL; classInfo.lpszMenuName = NULL; classInfo.lpszClassName = TEXT("SynergyTaskBar"); classInfo.hIconSm = NULL; ATOM windowClass = RegisterClassEx(&classInfo); // create window m_hwnd = CreateWindowEx(WS_EX_TOOLWINDOW, reinterpret_cast(windowClass), TEXT("Synergy Task Bar"), WS_POPUP, 0, 0, 1, 1, NULL, NULL, instanceWin32(), reinterpret_cast(this)); // signal ready ARCH->lockMutex(m_mutex); m_ready = true; ARCH->broadcastCondVar(m_condVar); ARCH->unlockMutex(m_mutex); // handle failure if (m_hwnd == NULL) { UnregisterClass(reinterpret_cast(windowClass), instanceWin32()); return; } // main loop MSG msg; while (GetMessage(&msg, NULL, 0, 0)) { if (!processDialogs(&msg)) { TranslateMessage(&msg); DispatchMessage(&msg); } } // clean up removeAllIcons(); DestroyWindow(m_hwnd); UnregisterClass(reinterpret_cast(windowClass), instanceWin32()); } void* CArchTaskBarWindows::threadEntry(void* self) { reinterpret_cast(self)->threadMainLoop(); return NULL; } HINSTANCE CArchTaskBarWindows::instanceWin32() { return CArchMiscWindows::instanceWin32(); }synergy-1.4.12-Source/src/lib/arch/CArchTaskBarWindows.h0000600000175000017500000000576312021261364022745 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHTASKBARWINDOWS_H #define CARCHTASKBARWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "IArchTaskBar.h" #include "IArchMultithread.h" #include "stdmap.h" #include "stdvector.h" #include #define ARCH_TASKBAR CArchTaskBarWindows //! Win32 implementation of IArchTaskBar class CArchTaskBarWindows : public IArchTaskBar { public: CArchTaskBarWindows(); virtual ~CArchTaskBarWindows(); virtual void init(); //! Add a dialog window /*! Tell the task bar event loop about a dialog. Win32 annoyingly requires messages destined for modeless dialog boxes to be dispatched differently than other messages. */ static void addDialog(HWND); //! Remove a dialog window /*! Remove a dialog window added via \c addDialog(). */ static void removeDialog(HWND); // IArchTaskBar overrides virtual void addReceiver(IArchTaskBarReceiver*); virtual void removeReceiver(IArchTaskBarReceiver*); virtual void updateReceiver(IArchTaskBarReceiver*); private: class CReceiverInfo { public: UINT m_id; }; typedef std::map CReceiverToInfoMap; typedef std::map CIDToReceiverMap; typedef std::vector CIDStack; typedef std::map CDialogs; UINT getNextID(); void recycleID(UINT); void addIcon(UINT); void removeIcon(UINT); void updateIcon(UINT); void addAllIcons(); void removeAllIcons(); void modifyIconNoLock(CReceiverToInfoMap::const_iterator, DWORD taskBarMessage); void removeIconNoLock(UINT id); void handleIconMessage(IArchTaskBarReceiver*, LPARAM); bool processDialogs(MSG*); LRESULT wndProc(HWND, UINT, WPARAM, LPARAM); static LRESULT CALLBACK staticWndProc(HWND, UINT, WPARAM, LPARAM); void threadMainLoop(); static void* threadEntry(void*); HINSTANCE instanceWin32(); private: static CArchTaskBarWindows* s_instance; // multithread data CArchMutex m_mutex; CArchCond m_condVar; bool m_ready; int m_result; CArchThread m_thread; // child thread data HWND m_hwnd; UINT m_taskBarRestart; // shared data CReceiverToInfoMap m_receivers; CIDToReceiverMap m_idTable; CIDStack m_oldIDs; UINT m_nextID; // dialogs CDialogs m_dialogs; CDialogs m_addedDialogs; }; #endif synergy-1.4.12-Source/src/lib/arch/CArchTaskBarXWindows.cpp0000600000175000017500000000230612021261364023416 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchTaskBarXWindows.h" // // CArchTaskBarXWindows // CArchTaskBarXWindows::CArchTaskBarXWindows() { // do nothing } CArchTaskBarXWindows::~CArchTaskBarXWindows() { // do nothing } void CArchTaskBarXWindows::addReceiver(IArchTaskBarReceiver* /*receiver*/) { // do nothing } void CArchTaskBarXWindows::removeReceiver(IArchTaskBarReceiver* /*receiver*/) { // do nothing } void CArchTaskBarXWindows::updateReceiver(IArchTaskBarReceiver* /*receiver*/) { // do nothing } synergy-1.4.12-Source/src/lib/arch/CArchTaskBarXWindows.h0000600000175000017500000000230712021261364023064 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHTASKBARXWINDOWS_H #define CARCHTASKBARXWINDOWS_H #include "IArchTaskBar.h" #define ARCH_TASKBAR CArchTaskBarXWindows //! X11 implementation of IArchTaskBar class CArchTaskBarXWindows : public IArchTaskBar { public: CArchTaskBarXWindows(); virtual ~CArchTaskBarXWindows(); // IArchTaskBar overrides virtual void addReceiver(IArchTaskBarReceiver*); virtual void removeReceiver(IArchTaskBarReceiver*); virtual void updateReceiver(IArchTaskBarReceiver*); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchTimeUnix.cpp0000600000175000017500000000223412021261364022126 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArchTimeUnix.h" #if TIME_WITH_SYS_TIME # include # include #else # if HAVE_SYS_TIME_H # include # else # include # endif #endif // // CArchTimeUnix // CArchTimeUnix::CArchTimeUnix() { // do nothing } CArchTimeUnix::~CArchTimeUnix() { // do nothing } double CArchTimeUnix::time() { struct timeval t; gettimeofday(&t, NULL); return (double)t.tv_sec + 1.0e-6 * (double)t.tv_usec; } synergy-1.4.12-Source/src/lib/arch/CArchTimeUnix.h0000600000175000017500000000202112021261364021565 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHTIMEUNIX_H #define CARCHTIMEUNIX_H #include "IArchTime.h" #define ARCH_TIME CArchTimeUnix //! Generic Unix implementation of IArchTime class CArchTimeUnix : public IArchTime { public: CArchTimeUnix(); virtual ~CArchTimeUnix(); // IArchTime overrides virtual double time(); }; #endif synergy-1.4.12-Source/src/lib/arch/CArchTimeWindows.cpp0000600000175000017500000000477312021261364022647 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // avoid getting a lot a crap from mmsystem.h that we don't need #define MMNODRV // Installable driver support #define MMNOSOUND // Sound support #define MMNOWAVE // Waveform support #define MMNOMIDI // MIDI support #define MMNOAUX // Auxiliary audio support #define MMNOMIXER // Mixer support #define MMNOJOY // Joystick support #define MMNOMCI // MCI support #define MMNOMMIO // Multimedia file I/O support #define MMNOMMSYSTEM // General MMSYSTEM functions #define WIN32_LEAN_AND_MEAN #include "CArchTimeWindows.h" #include #include typedef WINMMAPI DWORD (WINAPI *PTimeGetTime)(void); static double s_freq = 0.0; static HINSTANCE s_mmInstance = NULL; static PTimeGetTime s_tgt = NULL; // // CArchTimeWindows // CArchTimeWindows::CArchTimeWindows() { assert(s_freq == 0.0 || s_mmInstance == NULL); LARGE_INTEGER freq; if (QueryPerformanceFrequency(&freq) && freq.QuadPart != 0) { s_freq = 1.0 / static_cast(freq.QuadPart); } else { // load winmm.dll and get timeGetTime s_mmInstance = LoadLibrary("winmm"); if (s_mmInstance != NULL) { s_tgt = (PTimeGetTime)GetProcAddress(s_mmInstance, "timeGetTime"); } } } CArchTimeWindows::~CArchTimeWindows() { s_freq = 0.0; if (s_mmInstance == NULL) { FreeLibrary(reinterpret_cast(s_mmInstance)); s_tgt = NULL; s_mmInstance = NULL; } } double CArchTimeWindows::time() { // get time. we try three ways, in order of descending precision if (s_freq != 0.0) { LARGE_INTEGER c; QueryPerformanceCounter(&c); return s_freq * static_cast(c.QuadPart); } else if (s_tgt != NULL) { return 0.001 * static_cast(s_tgt()); } else { return 0.001 * static_cast(GetTickCount()); } } synergy-1.4.12-Source/src/lib/arch/CArchTimeWindows.h0000600000175000017500000000203412021261364022300 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CARCHTIMEWINDOWS_H #define CARCHTIMEWINDOWS_H #include "IArchTime.h" #define ARCH_TIME CArchTimeWindows //! Win32 implementation of IArchTime class CArchTimeWindows : public IArchTime { public: CArchTimeWindows(); virtual ~CArchTimeWindows(); // IArchTime overrides virtual double time(); }; #endif synergy-1.4.12-Source/src/lib/arch/CMakeLists.txt0000600000175000017500000000422312021261364021517 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src CArch.cpp IArchString.cpp XArch.cpp CArchConsoleStd.cpp ) if (WIN32) set(inc CArchConsoleWindows.h CArchDaemonWindows.h CArchFileWindows.h CArchLogWindows.h CArchMiscWindows.h CArchMultithreadWindows.h CArchNetworkWinsock.h CArchSleepWindows.h CArchStringWindows.h CArchSystemWindows.h CArchTaskBarWindows.h CArchTimeWindows.h CArchConsoleStd.h XArchWindows.h CMultibyte.h vsnprintf.h XArch.h IArchPlugin.h CArchPluginWindows.h ) list(APPEND src ${inc} CArchConsoleWindows.cpp CArchDaemonWindows.cpp CArchFileWindows.cpp CArchLogWindows.cpp CArchMiscWindows.cpp CArchMultithreadWindows.cpp CArchNetworkWinsock.cpp CArchSleepWindows.cpp CArchStringWindows.cpp CArchSystemWindows.cpp CArchTaskBarWindows.cpp CArchTimeWindows.cpp XArchWindows.cpp CArchPluginWindows.cpp ) elseif (UNIX) list(APPEND src CArchConsoleUnix.cpp CArchDaemonUnix.cpp CArchFileUnix.cpp CArchLogUnix.cpp CArchMultithreadPosix.cpp CArchNetworkBSD.cpp CArchSleepUnix.cpp CArchStringUnix.cpp CArchSystemUnix.cpp CArchTaskBarXWindows.cpp CArchTimeUnix.cpp XArchUnix.cpp CArchDaemonNone.cpp CArchPluginUnix.cpp ) endif() set(inc ../base ../common ../mt ../platform ../synergy ) if (UNIX) list(APPEND inc ../../.. ../arch ) endif() include_directories(${inc}) add_library(arch STATIC ${src}) if (WIN32) if (GAME_DEVICE_SUPPORT) target_link_libraries(arch synxinhk) endif() endif() synergy-1.4.12-Source/src/lib/arch/CMultibyte.h0000600000175000017500000000265212021261364021215 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMULTIBYTE_H #define CMULTIBYTE_H #include "common.h" #include "CArch.h" #include #include #include #if HAVE_LOCALE_H # include #endif #if HAVE_WCHAR_H || defined(_MSC_VER) # include #elif __APPLE__ // wtf? Darwin puts mbtowc() et al. in stdlib # include #else // platform apparently has no wchar_t support. provide dummy // implementations. hopefully at least the C++ compiler has // a built-in wchar_t type. static inline int mbtowc(wchar_t* dst, const char* src, int n) { *dst = static_cast(*src); return 1; } static inline int wctomb(char* dst, wchar_t src) { *dst = static_cast(src); return 1; } #endif #endif synergy-1.4.12-Source/src/lib/arch/IArchConsole.h0000600000175000017500000000412112021261364021436 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHCONSOLE_H #define IARCHCONSOLE_H #include "IInterface.h" #include "ELevel.h" //! Interface for architecture dependent console output /*! This interface defines the console operations required by synergy. Each architecture must implement this interface. */ class IArchConsole : public IInterface { public: //! @name manipulators //@{ //! Open the console /*! Opens the console for writing. The console is opened automatically on the first write so calling this method is optional. Uses \c title for the console's title if appropriate for the architecture. Calling this method on an already open console must have no effect. */ virtual void openConsole(const char* title) = 0; //! Close the console /*! Close the console. Calling this method on an already closed console must have no effect. */ virtual void closeConsole() = 0; //! Show the console /*! Causes the console to become visible. This generally only makes sense for a console in a graphical user interface. Other implementations will do nothing. Iff \p showIfEmpty is \c false then the implementation may optionally only show the console if it's not empty. */ virtual void showConsole(bool showIfEmpty) = 0; //! Write to the console /*! Writes the given string to the console, opening it if necessary. */ virtual void writeConsole(ELevel, const char*) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchDaemon.h0000600000175000017500000001060012021261364021236 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHDAEMON_H #define IARCHDAEMON_H #include "IInterface.h" #include "CString.h" //! Interface for architecture dependent daemonizing /*! This interface defines the operations required by synergy for installing uninstalling daeamons and daemonizing a process. Each architecture must implement this interface. */ class IArchDaemon : public IInterface { public: typedef int (*DaemonFunc)(int argc, const char** argv); //! @name manipulators //@{ //! Install daemon /*! Install a daemon. \c name is the name of the daemon passed to the system and \c description is a short human readable description of the daemon. \c pathname is the path to the daemon executable. \c commandLine should \b not include the name of program as the first argument. If \c allUsers is true then the daemon will be installed to start at boot time, otherwise it will be installed to start when the current user logs in. If \p dependencies is not NULL then it's a concatenation of NUL terminated other daemon names followed by a NUL; the daemon will be configured to startup after the listed daemons. Throws an \c XArchDaemon exception on failure. */ virtual void installDaemon(const char* name, const char* description, const char* pathname, const char* commandLine, const char* dependencies, bool allUsers) = 0; //! Uninstall daemon /*! Uninstall a daemon. Throws an \c XArchDaemon on failure. */ virtual void uninstallDaemon(const char* name, bool allUsers) = 0; //! Install daemon /*! Installs the default daemon. */ virtual void installDaemon() = 0; //! Uninstall daemon /*! Uninstalls the default daemon. */ virtual void uninstallDaemon() = 0; //! Daemonize the process /*! Daemonize. Throw XArchDaemonFailed on error. \c name is the name of the daemon. Once daemonized, \c func is invoked and daemonize returns when and what it does. Exactly what happens when daemonizing depends on the platform.
  • unix: Detaches from terminal. \c func gets passed one argument, the name passed to daemonize().
  • win32: Becomes a service. Argument 0 is the name of the service and the rest are the arguments passed to StartService(). \c func is only called when the service is actually started. \c func must call \c CArchMiscWindows::runDaemon() to finally becoming a service. The \c runFunc function passed to \c runDaemon() must call \c CArchMiscWindows::daemonRunning(true) when it enters the main loop (i.e. after initialization) and \c CArchMiscWindows::daemonRunning(false) when it leaves the main loop. The \c stopFunc function passed to \c runDaemon() is called when the daemon must exit the main loop and it must cause \c runFunc to return. \c func should return what \c runDaemon() returns. \c func or \c runFunc can call \c CArchMiscWindows::daemonFailed() to indicate startup failure.
*/ virtual int daemonize(const char* name, DaemonFunc func) = 0; //! Check if user has permission to install the daemon /*! Returns true iff the caller has permission to install or uninstall the daemon. Note that even if this method returns true it's possible that installing/uninstalling the service may still fail. This method ignores whether or not the service is already installed. */ virtual bool canInstallDaemon(const char* name, bool allUsers) = 0; //! Check if the daemon is installed /*! Returns true iff the daemon is installed. */ virtual bool isDaemonInstalled(const char* name, bool allUsers) = 0; //@} //! Get the command line /*! Gets the command line with which the application was started. */ virtual std::string commandLine() const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchFile.h0000600000175000017500000000360112021261364020715 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHFILE_H #define IARCHFILE_H #include "IInterface.h" #include "stdstring.h" //! Interface for architecture dependent file system operations /*! This interface defines the file system operations required by synergy. Each architecture must implement this interface. */ class IArchFile : public IInterface { public: //! @name manipulators //@{ //! Extract base name /*! Find the base name in the given \c pathname. */ virtual const char* getBasename(const char* pathname) = 0; //! Get user's home directory /*! Returns the user's home directory. Returns the empty string if this cannot be determined. */ virtual std::string getUserDirectory() = 0; //! Get system directory /*! Returns the ussystem configuration file directory. */ virtual std::string getSystemDirectory() = 0; //! Concatenate path components /*! Concatenate pathname components with a directory separator between them. This should not check if the resulting path is longer than allowed by the system; we'll rely on the system calls to tell us that. */ virtual std::string concatPath( const std::string& prefix, const std::string& suffix) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchLog.h0000600000175000017500000000337312021261364020565 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHLOG_H #define IARCHLOG_H #include "IInterface.h" #include "ELevel.h" //! Interface for architecture dependent logging /*! This interface defines the logging operations required by synergy. Each architecture must implement this interface. */ class IArchLog : public IInterface { public: //! @name manipulators //@{ //! Open the log /*! Opens the log for writing. The log must be opened before being written to. */ virtual void openLog(const char* name) = 0; //! Close the log /*! Close the log. */ virtual void closeLog() = 0; //! Show the log /*! Causes the log to become visible. This generally only makes sense for a log in a graphical user interface. Other implementations will do nothing. Iff \p showIfEmpty is \c false then the implementation may optionally only show the log if it's not empty. */ virtual void showLog(bool showIfEmpty) = 0; //! Write to the log /*! Writes the given string to the log with the given level. */ virtual void writeLog(ELevel, const char*) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchMultithread.h0000600000175000017500000001664212021261364022331 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHMULTITHREAD_H #define IARCHMULTITHREAD_H #include "IInterface.h" /*! \class CArchCondImpl \brief Internal condition variable data. An architecture dependent type holding the necessary data for a condition variable. */ class CArchCondImpl; /*! \var CArchCond \brief Opaque condition variable type. An opaque type representing a condition variable. */ typedef CArchCondImpl* CArchCond; /*! \class CArchMutexImpl \brief Internal mutex data. An architecture dependent type holding the necessary data for a mutex. */ class CArchMutexImpl; /*! \var CArchMutex \brief Opaque mutex type. An opaque type representing a mutex. */ typedef CArchMutexImpl* CArchMutex; /*! \class CArchThreadImpl \brief Internal thread data. An architecture dependent type holding the necessary data for a thread. */ class CArchThreadImpl; /*! \var CArchThread \brief Opaque thread type. An opaque type representing a thread. */ typedef CArchThreadImpl* CArchThread; //! Interface for architecture dependent multithreading /*! This interface defines the multithreading operations required by synergy. Each architecture must implement this interface. */ class IArchMultithread : public IInterface { public: //! Type of thread entry point typedef void* (*ThreadFunc)(void*); //! Type of thread identifier typedef unsigned int ThreadID; //! Types of signals /*! Not all platforms support all signals. Unsupported signals are ignored. */ enum ESignal { kINTERRUPT, //!< Interrupt (e.g. Ctrl+C) kTERMINATE, //!< Terminate (e.g. Ctrl+Break) kHANGUP, //!< Hangup (SIGHUP) kUSER, //!< User (SIGUSR2) kNUM_SIGNALS }; //! Type of signal handler function typedef void (*SignalFunc)(ESignal, void* userData); //! @name manipulators //@{ // // condition variable methods // //! Create a condition variable /*! The condition variable is an opaque data type. */ virtual CArchCond newCondVar() = 0; //! Destroy a condition variable virtual void closeCondVar(CArchCond) = 0; //! Signal a condition variable /*! Signalling a condition variable releases one waiting thread. */ virtual void signalCondVar(CArchCond) = 0; //! Broadcast a condition variable /*! Broadcasting a condition variable releases all waiting threads. */ virtual void broadcastCondVar(CArchCond) = 0; //! Wait on a condition variable /*! Wait on a conditation variable for up to \c timeout seconds. If \c timeout is < 0 then there is no timeout. The mutex must be locked when this method is called. The mutex is unlocked during the wait and locked again before returning. Returns true if the condition variable was signalled and false on timeout. (Cancellation point) */ virtual bool waitCondVar(CArchCond, CArchMutex, double timeout) = 0; // // mutex methods // //! Create a recursive mutex /*! Creates a recursive mutex. A thread may lock a recursive mutex when it already holds a lock on that mutex. The mutex is an opaque data type. */ virtual CArchMutex newMutex() = 0; //! Destroy a mutex virtual void closeMutex(CArchMutex) = 0; //! Lock a mutex virtual void lockMutex(CArchMutex) = 0; //! Unlock a mutex virtual void unlockMutex(CArchMutex) = 0; // // thread methods // //! Start a new thread /*! Creates and starts a new thread, using \c func as the entry point and passing it \c userData. The thread is an opaque data type. */ virtual CArchThread newThread(ThreadFunc func, void* userData) = 0; //! Get a reference to the calling thread /*! Returns a thread representing the current (i.e. calling) thread. */ virtual CArchThread newCurrentThread() = 0; //! Copy a thread object /*! Returns a reference to to thread referred to by \c thread. */ virtual CArchThread copyThread(CArchThread thread) = 0; //! Release a thread reference /*! Deletes the given thread object. This does not destroy the thread the object referred to, even if there are no remaining references. Use cancelThread() and waitThread() to stop a thread and wait for it to exit. */ virtual void closeThread(CArchThread) = 0; //! Force a thread to exit /*! Causes \c thread to exit when it next calls a cancellation point. A thread avoids cancellation as long as it nevers calls a cancellation point. Once it begins the cancellation process it must always let cancellation go to completion but may take as long as necessary to clean up. */ virtual void cancelThread(CArchThread thread) = 0; //! Change thread priority /*! Changes the priority of \c thread by \c n. If \c n is positive the thread has a lower priority and if negative a higher priority. Some architectures may not support either or both directions. */ virtual void setPriorityOfThread(CArchThread, int n) = 0; //! Cancellation point /*! This method does nothing but is a cancellation point. Clients can make their own functions cancellation points by calling this method at appropriate times. (Cancellation point) */ virtual void testCancelThread() = 0; //! Wait for a thread to exit /*! Waits for up to \c timeout seconds for \c thread to exit (normally or by cancellation). Waits forever if \c timeout < 0. Returns true if the thread exited, false otherwise. Waiting on the current thread returns immediately with false. (Cancellation point) */ virtual bool wait(CArchThread thread, double timeout) = 0; //! Compare threads /*! Returns true iff two thread objects refer to the same thread. Note that comparing thread objects directly is meaningless. */ virtual bool isSameThread(CArchThread, CArchThread) = 0; //! Test if thread exited /*! Returns true iff \c thread has exited. */ virtual bool isExitedThread(CArchThread thread) = 0; //! Returns the exit code of a thread /*! Waits indefinitely for \c thread to exit (if it hasn't yet) then returns the thread's exit code. (Cancellation point) */ virtual void* getResultOfThread(CArchThread thread) = 0; //! Returns an ID for a thread /*! Returns some ID number for \c thread. This is for logging purposes. All thread objects referring to the same thread return the same ID. However, clients should us isSameThread() to compare thread objects instead of comparing IDs. */ virtual ThreadID getIDOfThread(CArchThread thread) = 0; //! Set the interrupt handler /*! Sets the function to call on receipt of an external interrupt. By default and when \p func is NULL, the main thread is cancelled. */ virtual void setSignalHandler(ESignal, SignalFunc func, void* userData) = 0; //! Invoke the signal handler /*! Invokes the signal handler for \p signal, if any. If no handler cancels the main thread for \c kINTERRUPT and \c kTERMINATE and ignores the call otherwise. */ virtual void raiseSignal(ESignal signal) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchNetwork.h0000600000175000017500000002033012021261364021465 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHNETWORK_H #define IARCHNETWORK_H #include "IInterface.h" #include "stdstring.h" class CArchThreadImpl; typedef CArchThreadImpl* CArchThread; /*! \class CArchSocketImpl \brief Internal socket data. An architecture dependent type holding the necessary data for a socket. */ class CArchSocketImpl; /*! \var CArchSocket \brief Opaque socket type. An opaque type representing a socket. */ typedef CArchSocketImpl* CArchSocket; /*! \class CArchNetAddressImpl \brief Internal network address data. An architecture dependent type holding the necessary data for a network address. */ class CArchNetAddressImpl; /*! \var CArchNetAddress \brief Opaque network address type. An opaque type representing a network address. */ typedef CArchNetAddressImpl* CArchNetAddress; //! Interface for architecture dependent networking /*! This interface defines the networking operations required by synergy. Each architecture must implement this interface. */ class IArchNetwork : public IInterface { public: //! Supported address families enum EAddressFamily { kUNKNOWN, kINET, }; //! Supported socket types enum ESocketType { kDGRAM, kSTREAM }; //! Events for \c poll() /*! Events for \c poll() are bitmasks and can be combined using the bitwise operators. */ enum { kPOLLIN = 1, //!< Socket is readable kPOLLOUT = 2, //!< Socket is writable kPOLLERR = 4, //!< The socket is in an error state kPOLLNVAL = 8 //!< The socket is invalid }; //! A socket query for \c poll() class CPollEntry { public: //! The socket to query CArchSocket m_socket; //! The events to query for /*! The events to query for can be any combination of kPOLLIN and kPOLLOUT. */ unsigned short m_events; //! The result events unsigned short m_revents; }; //! @name manipulators //@{ //! Create a new socket /*! The socket is an opaque data type. */ virtual CArchSocket newSocket(EAddressFamily, ESocketType) = 0; //! Copy a socket object /*! Returns a reference to to socket referred to by \c s. */ virtual CArchSocket copySocket(CArchSocket s) = 0; //! Release a socket reference /*! Deletes the given socket object. This does not destroy the socket the object referred to until there are no remaining references for the socket. */ virtual void closeSocket(CArchSocket s) = 0; //! Close socket for further reads /*! Calling this disallows future reads on socket \c s. */ virtual void closeSocketForRead(CArchSocket s) = 0; //! Close socket for further writes /*! Calling this disallows future writes on socket \c s. */ virtual void closeSocketForWrite(CArchSocket s) = 0; //! Bind socket to address /*! Binds socket \c s to the address \c addr. */ virtual void bindSocket(CArchSocket s, CArchNetAddress addr) = 0; //! Listen for connections on socket /*! Causes the socket \c s to begin listening for incoming connections. */ virtual void listenOnSocket(CArchSocket s) = 0; //! Accept connection on socket /*! Accepts a connection on socket \c s, returning a new socket for the connection and filling in \c addr with the address of the remote end. \c addr may be NULL if the remote address isn't required. The original socket \c s is unaffected and remains in the listening state. The new socket shares most of the properties of \c s except it's not in the listening state and it's connected. Returns NULL if there are no pending connection requests. */ virtual CArchSocket acceptSocket(CArchSocket s, CArchNetAddress* addr) = 0; //! Connect socket /*! Connects the socket \c s to the remote address \c addr. Returns true if the connection succeed immediately, false if the connection is in progress, and throws if the connection failed immediately. If it returns false, \c pollSocket() can be used to wait on the socket for writing to detect when the connection finally succeeds or fails. */ virtual bool connectSocket(CArchSocket s, CArchNetAddress addr) = 0; //! Check socket state /*! Tests the state of \c num sockets for readability and/or writability. Waits up to \c timeout seconds for some socket to become readable and/or writable (or indefinitely if \c timeout < 0). Returns the number of sockets that were readable (if readability was being queried) or writable (if writablility was being queried) and sets the \c m_revents members of the entries. \c kPOLLERR and \c kPOLLNVAL are set in \c m_revents as appropriate. If a socket indicates \c kPOLLERR then \c throwErrorOnSocket() can be used to determine the type of error. Returns 0 immediately regardless of the \c timeout if no valid sockets are selected for testing. (Cancellation point) */ virtual int pollSocket(CPollEntry[], int num, double timeout) = 0; //! Unblock thread in pollSocket() /*! Cause a thread that's in a pollSocket() call to return. This call may return before the thread is unblocked. If the thread is not in a pollSocket() call this call has no effect. */ virtual void unblockPollSocket(CArchThread thread) = 0; //! Read data from socket /*! Read up to \c len bytes from socket \c s in \c buf and return the number of bytes read. The number of bytes can be less than \c len if not enough data is available. Returns 0 if the remote end has disconnected and/or there is no more queued received data. */ virtual size_t readSocket(CArchSocket s, void* buf, size_t len) = 0; //! Write data from socket /*! Write up to \c len bytes to socket \c s from \c buf and return the number of bytes written. The number of bytes can be less than \c len if the remote end disconnected or the internal buffers fill up. */ virtual size_t writeSocket(CArchSocket s, const void* buf, size_t len) = 0; //! Check error on socket /*! If the socket \c s is in an error state then throws an appropriate XArchNetwork exception. */ virtual void throwErrorOnSocket(CArchSocket s) = 0; //! Turn Nagle algorithm on or off on socket /*! Set socket to send messages immediately (true) or to collect small messages into one packet (false). Returns the previous state. */ virtual bool setNoDelayOnSocket(CArchSocket, bool noDelay) = 0; //! Turn address reuse on or off on socket /*! Allows the address this socket is bound to to be reused while in the TIME_WAIT state. Returns the previous state. */ virtual bool setReuseAddrOnSocket(CArchSocket, bool reuse) = 0; //! Return local host's name virtual std::string getHostName() = 0; //! Create an "any" network address virtual CArchNetAddress newAnyAddr(EAddressFamily) = 0; //! Copy a network address virtual CArchNetAddress copyAddr(CArchNetAddress) = 0; //! Convert a name to a network address virtual CArchNetAddress nameToAddr(const std::string&) = 0; //! Destroy a network address virtual void closeAddr(CArchNetAddress) = 0; //! Convert an address to a host name virtual std::string addrToName(CArchNetAddress) = 0; //! Convert an address to a string virtual std::string addrToString(CArchNetAddress) = 0; //! Get an address's family virtual EAddressFamily getAddrFamily(CArchNetAddress) = 0; //! Set the port of an address virtual void setAddrPort(CArchNetAddress, int port) = 0; //! Get the port of an address virtual int getAddrPort(CArchNetAddress) = 0; //! Test addresses for equality virtual bool isEqualAddr(CArchNetAddress, CArchNetAddress) = 0; //! Test for the "any" address /*! Returns true if \c addr is the "any" address. \c newAnyAddr() returns an "any" address. */ virtual bool isAnyAddr(CArchNetAddress addr) = 0; //@} virtual void init() = 0; }; #endif synergy-1.4.12-Source/src/lib/arch/IArchPlugin.h0000600000175000017500000000222312021261364021273 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #define PLUGINS_DIR "plugins" #include "IInterface.h" //! Interface for plugin manager. /*! A plugin manager should load all 3rd party plugins from the plugins dir, and then look for common function names in the plugins. */ class IArchPlugin : public IInterface { public: //! @name manipulators //@{ //! Load plugins /*! Scan the plugins dir and load plugins. */ virtual void init(void* eventTarget) = 0; //@} }; synergy-1.4.12-Source/src/lib/arch/IArchSleep.h0000600000175000017500000000245712021261364021116 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHSLEEP_H #define IARCHSLEEP_H #include "IInterface.h" //! Interface for architecture dependent sleeping /*! This interface defines the sleep operations required by synergy. Each architecture must implement this interface. */ class IArchSleep : public IInterface { public: //! @name manipulators //@{ //! Sleep /*! Blocks the calling thread for \c timeout seconds. If \c timeout < 0.0 then the call returns immediately. If \c timeout == 0.0 then the calling thread yields the CPU. (cancellation point) */ virtual void sleep(double timeout) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchString.cpp0000600000175000017500000000724212021261364021644 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IArchString.h" #include "common.h" #include "CArch.h" #include #include #include static CArchMutex s_mutex = NULL; // // use C library non-reentrant multibyte conversion with mutex // IArchString::~IArchString() { if (s_mutex != NULL) { ARCH->closeMutex(s_mutex); s_mutex = NULL; } } int IArchString::convStringWCToMB(char* dst, const wchar_t* src, UInt32 n, bool* errors) { int len = 0; bool dummyErrors; if (errors == NULL) { errors = &dummyErrors; } if (s_mutex == NULL) { s_mutex = ARCH->newMutex(); } ARCH->lockMutex(s_mutex); if (dst == NULL) { char dummy[MB_LEN_MAX]; for (const wchar_t* scan = src; n > 0; ++scan, --n) { int mblen = wctomb(dummy, *scan); if (mblen == -1) { *errors = true; mblen = 1; } len += mblen; } int mblen = wctomb(dummy, L'\0'); if (mblen != -1) { len += mblen - 1; } } else { char* dst0 = dst; for (const wchar_t* scan = src; n > 0; ++scan, --n) { int mblen = wctomb(dst, *scan); if (mblen == -1) { *errors = true; *dst++ = '?'; } else { dst += mblen; } } int mblen = wctomb(dst, L'\0'); if (mblen != -1) { // don't include nul terminator dst += mblen - 1; } len = (int)(dst - dst0); } ARCH->unlockMutex(s_mutex); return len; } int IArchString::convStringMBToWC(wchar_t* dst, const char* src, UInt32 n, bool* errors) { int len = 0; wchar_t dummy; bool dummyErrors; if (errors == NULL) { errors = &dummyErrors; } if (s_mutex == NULL) { s_mutex = ARCH->newMutex(); } ARCH->lockMutex(s_mutex); if (dst == NULL) { for (const char* scan = src; n > 0; ) { int mblen = mbtowc(&dummy, scan, n); switch (mblen) { case -2: // incomplete last character. convert to unknown character. *errors = true; len += 1; n = 0; break; case -1: // invalid character. count one unknown character and // start at the next byte. *errors = true; len += 1; scan += 1; n -= 1; break; case 0: len += 1; scan += 1; n -= 1; break; default: // normal character len += 1; scan += mblen; n -= mblen; break; } } } else { wchar_t* dst0 = dst; for (const char* scan = src; n > 0; ++dst) { int mblen = mbtowc(dst, scan, n); switch (mblen) { case -2: // incomplete character. convert to unknown character. *errors = true; *dst = (wchar_t)0xfffd; n = 0; break; case -1: // invalid character. count one unknown character and // start at the next byte. *errors = true; *dst = (wchar_t)0xfffd; scan += 1; n -= 1; break; case 0: *dst = (wchar_t)0x0000; scan += 1; n -= 1; break; default: // normal character scan += mblen; n -= mblen; break; } } len = (int)(dst - dst0); } ARCH->unlockMutex(s_mutex); return len; } synergy-1.4.12-Source/src/lib/arch/IArchString.h0000600000175000017500000000420012021261364021300 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHSTRING_H #define IARCHSTRING_H #include "IInterface.h" #include "BasicTypes.h" #include //! Interface for architecture dependent string operations /*! This interface defines the string operations required by synergy. Each architecture must implement this interface. */ class IArchString : public IInterface { public: virtual ~IArchString(); //! Wide character encodings /*! The known wide character encodings */ enum EWideCharEncoding { kUCS2, //!< The UCS-2 encoding kUCS4, //!< The UCS-4 encoding kUTF16, //!< The UTF-16 encoding kUTF32 //!< The UTF-32 encoding }; //! @name manipulators //@{ //! printf() to limited size buffer with va_list /*! This method is equivalent to vsprintf() except it will not write more than \c n bytes to the buffer, returning -1 if the output was truncated and the number of bytes written not including the trailing NUL otherwise. */ virtual int vsnprintf(char* str, int size, const char* fmt, va_list ap); //! Convert multibyte string to wide character string virtual int convStringMBToWC(wchar_t*, const char*, UInt32 n, bool* errors); //! Convert wide character string to multibyte string virtual int convStringWCToMB(char*, const wchar_t*, UInt32 n, bool* errors); //! Return the architecture's native wide character encoding virtual EWideCharEncoding getWideCharEncoding() = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchSystem.h0000600000175000017500000000317312021261364021326 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHSYSTEM_H #define IARCHSYSTEM_H #include "IInterface.h" #include "stdstring.h" //! Interface for architecture dependent system queries /*! This interface defines operations for querying system info. */ class IArchSystem : public IInterface { public: //! @name accessors //@{ //! Identify the OS /*! Returns a string identifying the operating system. */ virtual std::string getOSName() const = 0; //! Identify the platform /*! Returns a string identifying the platform this OS is running on. */ virtual std::string getPlatformName() const = 0; //@} //! Get a Synergy setting /*! Reads a Synergy setting from the system. */ virtual std::string setting(const std::string& valueName) const = 0; //@} //! Set a Synergy setting /*! Writes a Synergy setting from the system. */ virtual void setting(const std::string& valueName, const std::string& valueString) const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchTaskBar.h0000600000175000017500000000356012021261364021371 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHTASKBAR_H #define IARCHTASKBAR_H #include "IInterface.h" class IArchTaskBarReceiver; //! Interface for architecture dependent task bar control /*! This interface defines the task bar icon operations required by synergy. Each architecture must implement this interface though each operation can be a no-op. */ class IArchTaskBar : public IInterface { public: //! @name manipulators //@{ //! Add a receiver /*! Add a receiver object to be notified of user and application events. This should be called before other methods. When the receiver is added to the task bar, its icon appears on the task bar. */ virtual void addReceiver(IArchTaskBarReceiver*) = 0; //! Remove a receiver /*! Remove a receiver object from the task bar. This removes the icon from the task bar. */ virtual void removeReceiver(IArchTaskBarReceiver*) = 0; //! Update a receiver /*! Updates the display of the receiver on the task bar. This should be called when the receiver appearance may have changed (e.g. it's icon or tool tip has changed). */ virtual void updateReceiver(IArchTaskBarReceiver*) = 0; //@} virtual void init() = 0; }; #endif synergy-1.4.12-Source/src/lib/arch/IArchTaskBarReceiver.h0000600000175000017500000000512112021261364023051 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHTASKBARRECEIVER_H #define IARCHTASKBARRECEIVER_H #include "IInterface.h" #include "stdstring.h" class IScreen; class INode; //! Interface for architecture dependent task bar event handling /*! This interface defines the task bar icon event handlers required by synergy. Each architecture must implement this interface though each operation can be a no-op. */ class IArchTaskBarReceiver : public IInterface { public: // Icon data is architecture dependent typedef void* Icon; //! @name manipulators //@{ //! Show status window /*! Open a window displaying current status. This should return immediately without waiting for the window to be closed. */ virtual void showStatus() = 0; //! Popup menu /*! Popup a menu of operations at or around \c x,y and perform the chosen operation. */ virtual void runMenu(int x, int y) = 0; //! Perform primary action /*! Perform the primary (default) action. */ virtual void primaryAction() = 0; //@} //! @name accessors //@{ //! Lock receiver /*! Locks the receiver from changing state. The receiver should be locked when querying it's state to ensure consistent results. Each call to \c lock() must have a matching \c unlock() and locks cannot be nested. */ virtual void lock() const = 0; //! Unlock receiver virtual void unlock() const = 0; //! Get icon /*! Returns the icon to display in the task bar. The interface to set the icon is left to subclasses. Getting and setting the icon must be thread safe. */ virtual const Icon getIcon() const = 0; //! Get tooltip /*! Returns the tool tip to display in the task bar. The interface to set the tooltip is left to sublclasses. Getting and setting the icon must be thread safe. */ virtual std::string getToolTip() const = 0; virtual void updateStatus(INode*, const CString& errorMsg) = 0; virtual void cleanup() {} //@} }; #endif synergy-1.4.12-Source/src/lib/arch/IArchTime.h0000600000175000017500000000235412021261364020740 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IARCHTIME_H #define IARCHTIME_H #include "IInterface.h" //! Interface for architecture dependent time operations /*! This interface defines the time operations required by synergy. Each architecture must implement this interface. */ class IArchTime : public IInterface { public: //! @name manipulators //@{ //! Get the current time /*! Returns the number of seconds since some arbitrary starting time. This should return as high a precision as reasonable. */ virtual double time() = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/arch/vsnprintf.h0000600000175000017500000000310712021261364021161 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IArchString.h" #if HAVE_VSNPRINTF #if !defined(ARCH_VSNPRINTF) # define ARCH_VSNPRINTF vsnprintf #endif int IArchString::vsnprintf(char* str, int size, const char* fmt, va_list ap) { int n = ::ARCH_VSNPRINTF(str, size, fmt, ap); if (n > size) { n = -1; } return n; } #elif SYSAPI_UNIX // !HAVE_VSNPRINTF #include int IArchString::vsnprintf(char* str, int size, const char* fmt, va_list ap) { static FILE* bitbucket = fopen("/dev/null", "w"); if (bitbucket == NULL) { // uh oh if (size > 0) { str[0] = '\0'; } return 0; } else { // count the characters using the bitbucket int n = vfprintf(bitbucket, fmt, ap); if (n + 1 <= size) { // it'll fit so print it into str vsprintf(str, fmt, ap); } return n; } } #else // !HAVE_VSNPRINTF && !SYSAPI_UNIX #error vsnprintf not implemented #endif // !HAVE_VSNPRINTF synergy-1.4.12-Source/src/lib/arch/XArch.cpp0000600000175000017500000000166112021261364020473 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XArch.h" // // XArch // std::string XArch::what() const throw() { try { if (m_what.empty() && m_eval != NULL) { m_what = m_eval->eval(); } } catch (...) { // ignore } return m_what; } synergy-1.4.12-Source/src/lib/arch/XArch.h0000600000175000017500000001217112021261364020136 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XARCH_H #define XARCH_H #include "common.h" #include "stdstring.h" //! Generic thread exception /*! Exceptions derived from this class are used by the multithreading library to perform stack unwinding when a thread terminates. These exceptions must always be rethrown by clients when caught. */ class XThread { }; //! Thread exception to cancel /*! Thrown to cancel a thread. Clients must not throw this type, but must rethrow it if caught (by XThreadCancel, XThread, or ...). */ class XThreadCancel : public XThread { }; /*! \def RETHROW_XTHREAD Convenience macro to rethrow an XThread exception but ignore other exceptions. Put this in your catch (...) handler after necessary cleanup but before leaving or returning from the handler. */ #define RETHROW_XTHREAD \ try { throw; } catch (XThread&) { throw; } catch (...) { } //! Lazy error message string evaluation /*! This class encapsulates platform dependent error string lookup. Platforms subclass this type, taking an appropriate error code type in the c'tor and overriding eval() to return the error string for that error code. */ class XArchEval { public: XArchEval() { } virtual ~XArchEval() { } virtual XArchEval* clone() const throw() = 0; virtual std::string eval() const throw() = 0; }; //! Generic exception architecture dependent library class XArch { public: XArch(XArchEval* adoptedEvaluator) : m_eval(adoptedEvaluator) { } XArch(const std::string& msg) : m_eval(NULL), m_what(msg) { } XArch(const XArch& e) : m_eval(e.m_eval != NULL ? e.m_eval->clone() : NULL), m_what(e.m_what) { } ~XArch() { delete m_eval; } std::string what() const throw(); private: XArchEval* m_eval; mutable std::string m_what; }; // Macro to declare XArch derived types #define XARCH_SUBCLASS(name_, super_) \ class name_ : public super_ { \ public: \ name_(XArchEval* adoptedEvaluator) : super_(adoptedEvaluator) { } \ name_(const std::string& msg) : super_(msg) { } \ } //! Generic network exception /*! Exceptions derived from this class are used by the networking library to indicate various errors. */ XARCH_SUBCLASS(XArchNetwork, XArch); //! Operation was interrupted XARCH_SUBCLASS(XArchNetworkInterrupted, XArchNetwork); //! Network insufficient permission XARCH_SUBCLASS(XArchNetworkAccess, XArchNetwork); //! Network insufficient resources XARCH_SUBCLASS(XArchNetworkResource, XArchNetwork); //! No support for requested network resource/service XARCH_SUBCLASS(XArchNetworkSupport, XArchNetwork); //! Network I/O error XARCH_SUBCLASS(XArchNetworkIO, XArchNetwork); //! Network address is unavailable or not local XARCH_SUBCLASS(XArchNetworkNoAddress, XArchNetwork); //! Network address in use XARCH_SUBCLASS(XArchNetworkAddressInUse, XArchNetwork); //! No route to address XARCH_SUBCLASS(XArchNetworkNoRoute, XArchNetwork); //! Socket not connected XARCH_SUBCLASS(XArchNetworkNotConnected, XArchNetwork); //! Remote read end of socket has closed XARCH_SUBCLASS(XArchNetworkShutdown, XArchNetwork); //! Remote end of socket has disconnected XARCH_SUBCLASS(XArchNetworkDisconnected, XArchNetwork); //! Remote end of socket refused connection XARCH_SUBCLASS(XArchNetworkConnectionRefused, XArchNetwork); //! Remote end of socket is not responding XARCH_SUBCLASS(XArchNetworkTimedOut, XArchNetwork); //! Generic network name lookup erros XARCH_SUBCLASS(XArchNetworkName, XArchNetwork); //! The named host is unknown XARCH_SUBCLASS(XArchNetworkNameUnknown, XArchNetworkName); //! The named host is known but has no address XARCH_SUBCLASS(XArchNetworkNameNoAddress, XArchNetworkName); //! Non-recoverable name server error XARCH_SUBCLASS(XArchNetworkNameFailure, XArchNetworkName); //! Temporary name server error XARCH_SUBCLASS(XArchNetworkNameUnavailable, XArchNetworkName); //! The named host is known but no supported address XARCH_SUBCLASS(XArchNetworkNameUnsupported, XArchNetworkName); //! Generic daemon exception /*! Exceptions derived from this class are used by the daemon library to indicate various errors. */ XARCH_SUBCLASS(XArchDaemon, XArch); //! Could not daemonize XARCH_SUBCLASS(XArchDaemonFailed, XArchDaemon); //! Could not install daemon XARCH_SUBCLASS(XArchDaemonInstallFailed, XArchDaemon); //! Could not uninstall daemon XARCH_SUBCLASS(XArchDaemonUninstallFailed, XArchDaemon); //! Attempted to uninstall a daemon that was not installed XARCH_SUBCLASS(XArchDaemonUninstallNotInstalled, XArchDaemonUninstallFailed); #endif synergy-1.4.12-Source/src/lib/arch/XArchUnix.cpp0000600000175000017500000000174712021261364021344 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XArchUnix.h" #include // // XArchEvalUnix // XArchEval* XArchEvalUnix::clone() const throw() { return new XArchEvalUnix(m_errno); } std::string XArchEvalUnix::eval() const throw() { // FIXME -- not thread safe return strerror(m_errno); } synergy-1.4.12-Source/src/lib/arch/XArchUnix.h0000600000175000017500000000213612021261364021002 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XARCHUNIX_H #define XARCHUNIX_H #include "XArch.h" //! Lazy error message string evaluation for unix class XArchEvalUnix : public XArchEval { public: XArchEvalUnix(int err) : m_errno(err) { } virtual ~XArchEvalUnix() { } // XArchEval overrides virtual XArchEval* clone() const throw(); virtual std::string eval() const throw(); private: int m_errno; }; #endif synergy-1.4.12-Source/src/lib/arch/XArchWindows.cpp0000600000175000017500000001373512021261364022053 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XArchWindows.h" #include "CArchNetworkWinsock.h" // // XArchEvalWindows // XArchEval* XArchEvalWindows::clone() const throw() { return new XArchEvalWindows(m_errno); } std::string XArchEvalWindows::eval() const throw() { char* cmsg; if (FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, 0, m_errno, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPTSTR)&cmsg, 0, NULL) == 0) { cmsg = NULL; return "Unknown error"; } std::string smsg(cmsg); LocalFree(cmsg); return smsg; } // // XArchEvalWinsock // XArchEval* XArchEvalWinsock::clone() const throw() { return new XArchEvalWinsock(m_errno); } std::string XArchEvalWinsock::eval() const throw() { // built-in windows function for looking up error message strings // may not look up network error messages correctly. we'll have // to do it ourself. static const struct { int m_code; const char* m_msg; } s_netErrorCodes[] = { /* 10004 */{WSAEINTR, "The (blocking) call was canceled via WSACancelBlockingCall"}, /* 10009 */{WSAEBADF, "Bad file handle"}, /* 10013 */{WSAEACCES, "The requested address is a broadcast address, but the appropriate flag was not set"}, /* 10014 */{WSAEFAULT, "WSAEFAULT"}, /* 10022 */{WSAEINVAL, "WSAEINVAL"}, /* 10024 */{WSAEMFILE, "No more file descriptors available"}, /* 10035 */{WSAEWOULDBLOCK, "Socket is marked as non-blocking and no connections are present or the receive operation would block"}, /* 10036 */{WSAEINPROGRESS, "A blocking Windows Sockets operation is in progress"}, /* 10037 */{WSAEALREADY, "The asynchronous routine being canceled has already completed"}, /* 10038 */{WSAENOTSOCK, "At least on descriptor is not a socket"}, /* 10039 */{WSAEDESTADDRREQ, "A destination address is required"}, /* 10040 */{WSAEMSGSIZE, "The datagram was too large to fit into the specified buffer and was truncated"}, /* 10041 */{WSAEPROTOTYPE, "The specified protocol is the wrong type for this socket"}, /* 10042 */{WSAENOPROTOOPT, "The option is unknown or unsupported"}, /* 10043 */{WSAEPROTONOSUPPORT,"The specified protocol is not supported"}, /* 10044 */{WSAESOCKTNOSUPPORT,"The specified socket type is not supported by this address family"}, /* 10045 */{WSAEOPNOTSUPP, "The referenced socket is not a type that supports that operation"}, /* 10046 */{WSAEPFNOSUPPORT, "BSD: Protocol family not supported"}, /* 10047 */{WSAEAFNOSUPPORT, "The specified address family is not supported"}, /* 10048 */{WSAEADDRINUSE, "The specified address is already in use"}, /* 10049 */{WSAEADDRNOTAVAIL, "The specified address is not available from the local machine"}, /* 10050 */{WSAENETDOWN, "The Windows Sockets implementation has detected that the network subsystem has failed"}, /* 10051 */{WSAENETUNREACH, "The network can't be reached from this host at this time"}, /* 10052 */{WSAENETRESET, "The connection must be reset because the Windows Sockets implementation dropped it"}, /* 10053 */{WSAECONNABORTED, "The virtual circuit was aborted due to timeout or other failure"}, /* 10054 */{WSAECONNRESET, "The virtual circuit was reset by the remote side"}, /* 10055 */{WSAENOBUFS, "No buffer space is available or a buffer deadlock has occured. The socket cannot be created"}, /* 10056 */{WSAEISCONN, "The socket is already connected"}, /* 10057 */{WSAENOTCONN, "The socket is not connected"}, /* 10058 */{WSAESHUTDOWN, "The socket has been shutdown"}, /* 10059 */{WSAETOOMANYREFS, "BSD: Too many references"}, /* 10060 */{WSAETIMEDOUT, "Attempt to connect timed out without establishing a connection"}, /* 10061 */{WSAECONNREFUSED, "Connection was refused"}, /* 10062 */{WSAELOOP, "Undocumented WinSock error code used in BSD"}, /* 10063 */{WSAENAMETOOLONG, "Undocumented WinSock error code used in BSD"}, /* 10064 */{WSAEHOSTDOWN, "Undocumented WinSock error code used in BSD"}, /* 10065 */{WSAEHOSTUNREACH, "No route to host"}, /* 10066 */{WSAENOTEMPTY, "Undocumented WinSock error code"}, /* 10067 */{WSAEPROCLIM, "Undocumented WinSock error code"}, /* 10068 */{WSAEUSERS, "Undocumented WinSock error code"}, /* 10069 */{WSAEDQUOT, "Undocumented WinSock error code"}, /* 10070 */{WSAESTALE, "Undocumented WinSock error code"}, /* 10071 */{WSAEREMOTE, "Undocumented WinSock error code"}, /* 10091 */{WSASYSNOTREADY, "Underlying network subsytem is not ready for network communication"}, /* 10092 */{WSAVERNOTSUPPORTED, "The version of WinSock API support requested is not provided in this implementation"}, /* 10093 */{WSANOTINITIALISED, "WinSock subsystem not properly initialized"}, /* 10101 */{WSAEDISCON, "Virtual circuit has gracefully terminated connection"}, /* 11001 */{WSAHOST_NOT_FOUND, "The specified host is unknown"}, /* 11002 */{WSATRY_AGAIN, "A temporary error occurred on an authoritative name server"}, /* 11003 */{WSANO_RECOVERY, "A non-recoverable name server error occurred"}, /* 11004 */{WSANO_DATA, "The requested name is valid but does not have an IP address"}, /* end */{0, NULL} }; for (unsigned int i = 0; s_netErrorCodes[i].m_code != 0; ++i) { if (s_netErrorCodes[i].m_code == m_errno) { return s_netErrorCodes[i].m_msg; } } return "Unknown error"; } synergy-1.4.12-Source/src/lib/arch/XArchWindows.h0000600000175000017500000000303612021261364021511 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XARCHWINDOWS_H #define XARCHWINDOWS_H #define WIN32_LEAN_AND_MEAN #include "XArch.h" #include //! Lazy error message string evaluation for windows class XArchEvalWindows : public XArchEval { public: XArchEvalWindows() : m_errno(GetLastError()) { } XArchEvalWindows(DWORD err) : m_errno(err) { } virtual ~XArchEvalWindows() { } // XArchEval overrides virtual XArchEval* clone() const throw(); virtual std::string eval() const throw(); private: DWORD m_errno; }; //! Lazy error message string evaluation for winsock class XArchEvalWinsock : public XArchEval { public: XArchEvalWinsock(int err) : m_errno(err) { } virtual ~XArchEvalWinsock() { } // XArchEval overrides virtual XArchEval* clone() const throw(); virtual std::string eval() const throw(); private: int m_errno; }; #endif synergy-1.4.12-Source/src/lib/base/0000700000175000017500000000000012140644175016760 5ustar synergysynergysynergy-1.4.12-Source/src/lib/base/CEvent.cpp0000600000175000017500000000337712021261364020655 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CEvent.h" #include "CEventQueue.h" // // CEvent // CEvent::CEvent() : m_type(kUnknown), m_target(NULL), m_data(NULL), m_flags(0), m_dataObject(nullptr) { // do nothing } CEvent::CEvent(Type type, void* target, void* data, Flags flags) : m_type(type), m_target(target), m_data(data), m_flags(flags), m_dataObject(nullptr) { // do nothing } CEvent::Type CEvent::getType() const { return m_type; } void* CEvent::getTarget() const { return m_target; } void* CEvent::getData() const { return m_data; } CEventData* CEvent::getDataObject() const { return m_dataObject; } CEvent::Flags CEvent::getFlags() const { return m_flags; } void CEvent::deleteData(const CEvent& event) { switch (event.getType()) { case kUnknown: case kQuit: case kSystem: case kTimer: break; default: if ((event.getFlags() & kDontFreeData) == 0) { free(event.getData()); delete event.getDataObject(); } break; } } void CEvent::setDataObject(CEventData* dataObject) { assert(m_dataObject == nullptr); m_dataObject = dataObject; } synergy-1.4.12-Source/src/lib/base/CEvent.h0000600000175000017500000000601712021261364020314 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CEVENT_H #define CEVENT_H #include "BasicTypes.h" #include "stdmap.h" class CEventData { public: CEventData() { } virtual ~CEventData() { } }; //! Event /*! A \c CEvent holds an event type and a pointer to event data. */ class CEvent { public: typedef UInt32 Type; enum { kUnknown, //!< The event type is unknown kQuit, //!< The quit event kSystem, //!< The data points to a system event type kTimer, //!< The data points to timer info kLast //!< Must be last }; typedef UInt32 Flags; enum { kNone = 0x00, //!< No flags kDeliverImmediately = 0x01, //!< Dispatch and free event immediately kDontFreeData = 0x02 //!< Don't free data in deleteData }; CEvent(); //! Create \c CEvent with data (POD) /*! The \p type must have been registered using \c registerType(). The \p data must be POD (plain old data) allocated by malloc(), which means it cannot have a constructor, destructor or be composed of any types that do. For non-POD (normal C++ objects use \c setDataObject(). \p target is the intended recipient of the event. \p flags is any combination of \c Flags. */ CEvent(Type type, void* target = NULL, void* data = NULL, Flags flags = kNone); //! @name manipulators //@{ //! Release event data /*! Deletes event data for the given event (using free()). */ static void deleteData(const CEvent&); //! Set data (non-POD) /*! Set non-POD (non plain old data), where delete is called when the event is deleted, and the destructor is called. */ void setDataObject(CEventData* dataObject); //@} //! @name accessors //@{ //! Get event type /*! Returns the event type. */ Type getType() const; //! Get the event target /*! Returns the event target. */ void* getTarget() const; //! Get the event data (POD). /*! Returns the event data (POD). */ void* getData() const; //! Get the event data (non-POD) /*! Returns the event data (non-POD). The difference between this and \c getData() is that when delete is called on this data, so non-POD (non plain old data) dtor is called. */ CEventData* getDataObject() const; //! Get event flags /*! Returns the event flags. */ Flags getFlags() const; //@} private: Type m_type; void* m_target; void* m_data; Flags m_flags; CEventData* m_dataObject; }; #endif synergy-1.4.12-Source/src/lib/base/CEventQueue.cpp0000600000175000017500000003014512021261364021653 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CEventQueue.h" #include "CLog.h" #include "CSimpleEventQueueBuffer.h" #include "CStopwatch.h" #include "IEventJob.h" #include "CArch.h" // interrupt handler. this just adds a quit event to the queue. static void interrupt(CArch::ESignal, void*) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } // // CEventQueue // CEventQueue::CEventQueue() : m_nextType(CEvent::kLast) { setInstance(this); m_mutex = ARCH->newMutex(); ARCH->setSignalHandler(CArch::kINTERRUPT, &interrupt, NULL); ARCH->setSignalHandler(CArch::kTERMINATE, &interrupt, NULL); m_buffer = new CSimpleEventQueueBuffer; } CEventQueue::~CEventQueue() { delete m_buffer; ARCH->setSignalHandler(CArch::kINTERRUPT, NULL, NULL); ARCH->setSignalHandler(CArch::kTERMINATE, NULL, NULL); ARCH->closeMutex(m_mutex); setInstance(NULL); } void CEventQueue::loop() { CEvent event; getEvent(event); while (event.getType() != CEvent::kQuit) { dispatchEvent(event); CEvent::deleteData(event); getEvent(event); } } CEvent::Type CEventQueue::registerType(const char* name) { CArchMutexLock lock(m_mutex); m_typeMap.insert(std::make_pair(m_nextType, name)); m_nameMap.insert(std::make_pair(name, m_nextType)); LOG((CLOG_DEBUG1 "registered event type %s as %d", name, m_nextType)); return m_nextType++; } CEvent::Type CEventQueue::registerTypeOnce(CEvent::Type& type, const char* name) { CArchMutexLock lock(m_mutex); if (type == CEvent::kUnknown) { m_typeMap.insert(std::make_pair(m_nextType, name)); m_nameMap.insert(std::make_pair(name, m_nextType)); LOG((CLOG_DEBUG1 "registered event type %s as %d", name, m_nextType)); type = m_nextType++; } return type; } const char* CEventQueue::getTypeName(CEvent::Type type) { switch (type) { case CEvent::kUnknown: return "nil"; case CEvent::kQuit: return "quit"; case CEvent::kSystem: return "system"; case CEvent::kTimer: return "timer"; default: CTypeMap::const_iterator i = m_typeMap.find(type); if (i == m_typeMap.end()) { return ""; } else { return i->second; } } } void CEventQueue::adoptBuffer(IEventQueueBuffer* buffer) { CArchMutexLock lock(m_mutex); LOG((CLOG_DEBUG "adopting new buffer")); if (m_events.size() != 0) { // this can come as a nasty surprise to programmers expecting // their events to be raised, only to have them deleted. LOG((CLOG_DEBUG "discarding %d event(s)", m_events.size())); } // discard old buffer and old events delete m_buffer; for (CEventTable::iterator i = m_events.begin(); i != m_events.end(); ++i) { CEvent::deleteData(i->second); } m_events.clear(); m_oldEventIDs.clear(); // use new buffer m_buffer = buffer; if (m_buffer == NULL) { m_buffer = new CSimpleEventQueueBuffer; } } bool CEventQueue::getEvent(CEvent& event, double timeout) { CStopwatch timer(true); retry: // if no events are waiting then handle timers and then wait while (m_buffer->isEmpty()) { // handle timers first if (hasTimerExpired(event)) { return true; } // get time remaining in timeout double timeLeft = timeout - timer.getTime(); if (timeout >= 0.0 && timeLeft <= 0.0) { return false; } // get time until next timer expires. if there is a timer // and it'll expire before the client's timeout then use // that duration for our timeout instead. double timerTimeout = getNextTimerTimeout(); if (timeout < 0.0 || (timerTimeout >= 0.0 && timerTimeout < timeLeft)) { timeLeft = timerTimeout; } // wait for an event m_buffer->waitForEvent(timeLeft); } // get the event UInt32 dataID; IEventQueueBuffer::Type type = m_buffer->getEvent(event, dataID); switch (type) { case IEventQueueBuffer::kNone: if (timeout < 0.0 || timeout <= timer.getTime()) { // don't want to fail if client isn't expecting that // so if getEvent() fails with an infinite timeout // then just try getting another event. goto retry; } return false; case IEventQueueBuffer::kSystem: return true; case IEventQueueBuffer::kUser: { CArchMutexLock lock(m_mutex); event = removeEvent(dataID); return true; } default: assert(0 && "invalid event type"); return false; } } bool CEventQueue::dispatchEvent(const CEvent& event) { void* target = event.getTarget(); IEventJob* job = getHandler(event.getType(), target); if (job == NULL) { job = getHandler(CEvent::kUnknown, target); } if (job != NULL) { job->run(event); return true; } return false; } void CEventQueue::addEvent(const CEvent& event) { // discard bogus event types switch (event.getType()) { case CEvent::kUnknown: case CEvent::kSystem: case CEvent::kTimer: return; default: break; } if ((event.getFlags() & CEvent::kDeliverImmediately) != 0) { dispatchEvent(event); CEvent::deleteData(event); } else { CArchMutexLock lock(m_mutex); // store the event's data locally UInt32 eventID = saveEvent(event); // add it if (!m_buffer->addEvent(eventID)) { // failed to send event removeEvent(eventID); CEvent::deleteData(event); } } } CEventQueueTimer* CEventQueue::newTimer(double duration, void* target) { assert(duration > 0.0); CEventQueueTimer* timer = m_buffer->newTimer(duration, false); if (target == NULL) { target = timer; } CArchMutexLock lock(m_mutex); m_timers.insert(timer); // initial duration is requested duration plus whatever's on // the clock currently because the latter will be subtracted // the next time we check for timers. m_timerQueue.push(CTimer(timer, duration, duration + m_time.getTime(), target, false)); return timer; } CEventQueueTimer* CEventQueue::newOneShotTimer(double duration, void* target) { assert(duration > 0.0); CEventQueueTimer* timer = m_buffer->newTimer(duration, true); if (target == NULL) { target = timer; } CArchMutexLock lock(m_mutex); m_timers.insert(timer); // initial duration is requested duration plus whatever's on // the clock currently because the latter will be subtracted // the next time we check for timers. m_timerQueue.push(CTimer(timer, duration, duration + m_time.getTime(), target, true)); return timer; } void CEventQueue::deleteTimer(CEventQueueTimer* timer) { CArchMutexLock lock(m_mutex); for (CTimerQueue::iterator index = m_timerQueue.begin(); index != m_timerQueue.end(); ++index) { if (index->getTimer() == timer) { m_timerQueue.erase(index); break; } } CTimers::iterator index = m_timers.find(timer); if (index != m_timers.end()) { m_timers.erase(index); } m_buffer->deleteTimer(timer); } void CEventQueue::adoptHandler(CEvent::Type type, void* target, IEventJob* handler) { CArchMutexLock lock(m_mutex); IEventJob*& job = m_handlers[target][type]; delete job; job = handler; } void CEventQueue::removeHandler(CEvent::Type type, void* target) { IEventJob* handler = NULL; { CArchMutexLock lock(m_mutex); CHandlerTable::iterator index = m_handlers.find(target); if (index != m_handlers.end()) { CTypeHandlerTable& typeHandlers = index->second; CTypeHandlerTable::iterator index2 = typeHandlers.find(type); if (index2 != typeHandlers.end()) { handler = index2->second; typeHandlers.erase(index2); } } } delete handler; } void CEventQueue::removeHandlers(void* target) { std::vector handlers; { CArchMutexLock lock(m_mutex); CHandlerTable::iterator index = m_handlers.find(target); if (index != m_handlers.end()) { // copy to handlers array and clear table for target CTypeHandlerTable& typeHandlers = index->second; for (CTypeHandlerTable::iterator index2 = typeHandlers.begin(); index2 != typeHandlers.end(); ++index2) { handlers.push_back(index2->second); } typeHandlers.clear(); } } // delete handlers for (std::vector::iterator index = handlers.begin(); index != handlers.end(); ++index) { delete *index; } } bool CEventQueue::isEmpty() const { return (m_buffer->isEmpty() && getNextTimerTimeout() != 0.0); } IEventJob* CEventQueue::getHandler(CEvent::Type type, void* target) const { CArchMutexLock lock(m_mutex); CHandlerTable::const_iterator index = m_handlers.find(target); if (index != m_handlers.end()) { const CTypeHandlerTable& typeHandlers = index->second; CTypeHandlerTable::const_iterator index2 = typeHandlers.find(type); if (index2 != typeHandlers.end()) { return index2->second; } } return NULL; } UInt32 CEventQueue::saveEvent(const CEvent& event) { // choose id UInt32 id; if (!m_oldEventIDs.empty()) { // reuse an id id = m_oldEventIDs.back(); m_oldEventIDs.pop_back(); } else { // make a new id id = static_cast(m_events.size()); } // save data m_events[id] = event; return id; } CEvent CEventQueue::removeEvent(UInt32 eventID) { // look up id CEventTable::iterator index = m_events.find(eventID); if (index == m_events.end()) { return CEvent(); } // get data CEvent event = index->second; m_events.erase(index); // save old id for reuse m_oldEventIDs.push_back(eventID); return event; } bool CEventQueue::hasTimerExpired(CEvent& event) { // return true if there's a timer in the timer priority queue that // has expired. if returning true then fill in event appropriately // and reset and reinsert the timer. if (m_timerQueue.empty()) { return false; } // get time elapsed since last check const double time = m_time.getTime(); m_time.reset(); // countdown elapsed time for (CTimerQueue::iterator index = m_timerQueue.begin(); index != m_timerQueue.end(); ++index) { (*index) -= time; } // done if no timers are expired if (m_timerQueue.top() > 0.0) { return false; } // remove timer from queue CTimer timer = m_timerQueue.top(); m_timerQueue.pop(); // prepare event and reset the timer's clock timer.fillEvent(m_timerEvent); event = CEvent(CEvent::kTimer, timer.getTarget(), &m_timerEvent); timer.reset(); // reinsert timer into queue if it's not a one-shot if (!timer.isOneShot()) { m_timerQueue.push(timer); } return true; } double CEventQueue::getNextTimerTimeout() const { // return -1 if no timers, 0 if the top timer has expired, otherwise // the time until the top timer in the timer priority queue will // expire. if (m_timerQueue.empty()) { return -1.0; } if (m_timerQueue.top() <= 0.0) { return 0.0; } return m_timerQueue.top(); } CEvent::Type CEventQueue::getRegisteredType(const CString& name) const { CNameMap::const_iterator found = m_nameMap.find(name); if (found != m_nameMap.end()) return found->second; return CEvent::kUnknown; } // // CEventQueue::CTimer // CEventQueue::CTimer::CTimer(CEventQueueTimer* timer, double timeout, double initialTime, void* target, bool oneShot) : m_timer(timer), m_timeout(timeout), m_target(target), m_oneShot(oneShot), m_time(initialTime) { assert(m_timeout > 0.0); } CEventQueue::CTimer::~CTimer() { // do nothing } void CEventQueue::CTimer::reset() { m_time = m_timeout; } CEventQueue::CTimer& CEventQueue::CTimer::operator-=(double dt) { m_time -= dt; return *this; } CEventQueue::CTimer::operator double() const { return m_time; } bool CEventQueue::CTimer::isOneShot() const { return m_oneShot; } CEventQueueTimer* CEventQueue::CTimer::getTimer() const { return m_timer; } void* CEventQueue::CTimer::getTarget() const { return m_target; } void CEventQueue::CTimer::fillEvent(CTimerEvent& event) const { event.m_timer = m_timer; event.m_count = 0; if (m_time <= 0.0) { event.m_count = static_cast((m_timeout - m_time) / m_timeout); } } bool CEventQueue::CTimer::operator<(const CTimer& t) const { return m_time < t.m_time; } synergy-1.4.12-Source/src/lib/base/CEventQueue.h0000600000175000017500000000725612021261364021327 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CEVENTQUEUE_H #define CEVENTQUEUE_H #include "IEventQueue.h" #include "CEvent.h" #include "CPriorityQueue.h" #include "CStopwatch.h" #include "IArchMultithread.h" #include "stdmap.h" #include "stdset.h" //! Event queue /*! An event queue that implements the platform independent parts and delegates the platform dependent parts to a subclass. */ class CEventQueue : public IEventQueue { public: CEventQueue(); virtual ~CEventQueue(); // IEventQueue overrides virtual void loop(); virtual void adoptBuffer(IEventQueueBuffer*); virtual bool getEvent(CEvent& event, double timeout = -1.0); virtual bool dispatchEvent(const CEvent& event); virtual void addEvent(const CEvent& event); virtual CEventQueueTimer* newTimer(double duration, void* target); virtual CEventQueueTimer* newOneShotTimer(double duration, void* target); virtual void deleteTimer(CEventQueueTimer*); virtual void adoptHandler(CEvent::Type type, void* target, IEventJob* handler); virtual void removeHandler(CEvent::Type type, void* target); virtual void removeHandlers(void* target); virtual CEvent::Type registerType(const char* name); virtual CEvent::Type registerTypeOnce(CEvent::Type& type, const char* name); virtual bool isEmpty() const; virtual IEventJob* getHandler(CEvent::Type type, void* target) const; virtual const char* getTypeName(CEvent::Type type); virtual CEvent::Type getRegisteredType(const CString& name) const; private: UInt32 saveEvent(const CEvent& event); CEvent removeEvent(UInt32 eventID); bool hasTimerExpired(CEvent& event); double getNextTimerTimeout() const; private: class CTimer { public: CTimer(CEventQueueTimer*, double timeout, double initialTime, void* target, bool oneShot); ~CTimer(); void reset(); CTimer& operator-=(double); operator double() const; bool isOneShot() const; CEventQueueTimer* getTimer() const; void* getTarget() const; void fillEvent(CTimerEvent&) const; bool operator<(const CTimer&) const; private: CEventQueueTimer* m_timer; double m_timeout; void* m_target; bool m_oneShot; double m_time; }; typedef std::set CTimers; typedef CPriorityQueue CTimerQueue; typedef std::map CEventTable; typedef std::vector CEventIDList; typedef std::map CTypeMap; typedef std::map CNameMap; typedef std::map CTypeHandlerTable; typedef std::map CHandlerTable; CArchMutex m_mutex; // registered events CEvent::Type m_nextType; CTypeMap m_typeMap; CNameMap m_nameMap; // buffer of events IEventQueueBuffer* m_buffer; // saved events CEventTable m_events; CEventIDList m_oldEventIDs; // timers CStopwatch m_time; CTimers m_timers; CTimerQueue m_timerQueue; CTimerEvent m_timerEvent; // event handlers CHandlerTable m_handlers; }; #endif synergy-1.4.12-Source/src/lib/base/CFunctionEventJob.cpp0000600000175000017500000000211012021261364022776 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CFunctionEventJob.h" // // CFunctionEventJob // CFunctionEventJob::CFunctionEventJob( void (*func)(const CEvent&, void*), void* arg) : m_func(func), m_arg(arg) { // do nothing } CFunctionEventJob::~CFunctionEventJob() { // do nothing } void CFunctionEventJob::run(const CEvent& event) { if (m_func != NULL) { m_func(event, m_arg); } } synergy-1.4.12-Source/src/lib/base/CFunctionEventJob.h0000600000175000017500000000232012021261364022446 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CFUNCTIONEVENTJOB_H #define CFUNCTIONEVENTJOB_H #include "IEventJob.h" //! Use a function as an event job /*! An event job class that invokes a function. */ class CFunctionEventJob : public IEventJob { public: //! run() invokes \c func(arg) CFunctionEventJob(void (*func)(const CEvent&, void*), void* arg = NULL); virtual ~CFunctionEventJob(); // IEventJob overrides virtual void run(const CEvent&); private: void (*m_func)(const CEvent&, void*); void* m_arg; }; #endif synergy-1.4.12-Source/src/lib/base/CFunctionJob.cpp0000600000175000017500000000176712021261364022015 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CFunctionJob.h" // // CFunctionJob // CFunctionJob::CFunctionJob(void (*func)(void*), void* arg) : m_func(func), m_arg(arg) { // do nothing } CFunctionJob::~CFunctionJob() { // do nothing } void CFunctionJob::run() { if (m_func != NULL) { m_func(m_arg); } } synergy-1.4.12-Source/src/lib/base/CFunctionJob.h0000600000175000017500000000215712021261364021454 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CFUNCTIONJOB_H #define CFUNCTIONJOB_H #include "IJob.h" //! Use a function as a job /*! A job class that invokes a function. */ class CFunctionJob : public IJob { public: //! run() invokes \c func(arg) CFunctionJob(void (*func)(void*), void* arg = NULL); virtual ~CFunctionJob(); // IJob overrides virtual void run(); private: void (*m_func)(void*); void* m_arg; }; #endif synergy-1.4.12-Source/src/lib/base/CLog.cpp0000600000175000017500000001506712120644363020320 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CLog.h" #include "CString.h" #include "CStringUtil.h" #include "LogOutputters.h" #include "CArch.h" #include "Version.h" #include "XArch.h" #include #include #include #include // names of priorities static const char* g_priority[] = { "FATAL", "ERROR", "WARNING", "NOTE", "INFO", "DEBUG", "DEBUG1", "DEBUG2", "DEBUG3", "DEBUG4", "DEBUG5" }; // number of priorities static const int g_numPriority = (int)(sizeof(g_priority) / sizeof(g_priority[0])); // the default priority #ifndef NDEBUG static const int g_defaultMaxPriority = kDEBUG; #else static const int g_defaultMaxPriority = kINFO; #endif // length of longest string in g_priority static const int g_maxPriorityLength = 7; // length of suffix string (": ") static const int g_prioritySuffixLength = 2; // amount of padded required to fill in the priority prefix static const int g_priorityPad = g_maxPriorityLength + g_prioritySuffixLength; // // CLog // CLog* CLog::s_log = NULL; CLog::CLog() { assert(s_log == NULL); // create mutex for multithread safe operation m_mutex = ARCH->newMutex(); // other initalization m_maxPriority = g_defaultMaxPriority; m_maxNewlineLength = 0; insert(new CConsoleLogOutputter); s_log = this; } CLog::~CLog() { // clean up for (COutputterList::iterator index = m_outputters.begin(); index != m_outputters.end(); ++index) { delete *index; } for (COutputterList::iterator index = m_alwaysOutputters.begin(); index != m_alwaysOutputters.end(); ++index) { delete *index; } ARCH->closeMutex(m_mutex); } CLog* CLog::getInstance() { assert(s_log != NULL); return s_log; } const char* CLog::getFilterName() const { return getFilterName(getFilter()); } const char* CLog::getFilterName(int level) const { if (level < 0) { return "Message"; } return g_priority[level]; } void CLog::print(const char* file, int line, const char* fmt, ...) { // check if fmt begins with a priority argument ELevel priority = kINFO; if ((strlen(fmt) > 2) && (fmt[0] == '%' && fmt[1] == 'z')) { // 060 in octal is 0 (48 in decimal), so subtracting this converts ascii // number it a true number. we could use atoi instead, but this is how // it was done originally. priority = (ELevel)(fmt[2] - '\060'); // move the pointer on past the debug priority char fmt += 3; } // done if below priority threshold if (priority > getFilter()) { return; } // compute prefix padding length char stack[1024]; // compute suffix padding length int sPad = m_maxNewlineLength; // print to buffer, leaving space for a newline at the end and prefix // at the beginning. char* buffer = stack; int len = (int)(sizeof(stack) / sizeof(stack[0])); while (true) { // try printing into the buffer va_list args; va_start(args, fmt); int n = ARCH->vsnprintf(buffer, len - sPad, fmt, args); va_end(args); // if the buffer wasn't big enough then make it bigger and try again if (n < 0 || n > (int)len) { if (buffer != stack) { delete[] buffer; } len *= 2; buffer = new char[len]; } // if the buffer was big enough then continue else { break; } } // print the prefix to the buffer. leave space for priority label. // do not prefix time and file for kPRINT (CLOG_PRINT) if (priority != kPRINT) { char message[2048]; #ifndef NDEBUG struct tm *tm; char tmp[220]; time_t t; time(&t); tm = localtime(&t); sprintf(tmp, "%04i-%02i-%02iT%02i:%02i:%02i", tm->tm_year + 1900, tm->tm_mon+1, tm->tm_mday, tm->tm_hour, tm->tm_min, tm->tm_sec); sprintf(message, "%s %s: %s\n\t%s,%d", tmp, g_priority[priority], buffer, file, line); #else sprintf(message, "%s: %s", g_priority[priority], buffer); #endif output(priority, message); } else { output(priority, buffer); } // clean up if (buffer != stack) { delete[] buffer; } } void CLog::insert(ILogOutputter* outputter, bool alwaysAtHead) { assert(outputter != NULL); CArchMutexLock lock(m_mutex); if (alwaysAtHead) { m_alwaysOutputters.push_front(outputter); } else { m_outputters.push_front(outputter); } outputter->open(kAppVersion); // Issue 41 // don't show log unless user requests it, as some users find this // feature irritating (i.e. when they lose network connectivity). // in windows the log window can be displayed by selecting "show log" // from the synergy system tray icon. // if this causes problems for other architectures, then a different // work around should be attempted. //outputter->show(false); } void CLog::remove(ILogOutputter* outputter) { CArchMutexLock lock(m_mutex); m_outputters.remove(outputter); m_alwaysOutputters.remove(outputter); } void CLog::pop_front(bool alwaysAtHead) { CArchMutexLock lock(m_mutex); COutputterList* list = alwaysAtHead ? &m_alwaysOutputters : &m_outputters; if (!list->empty()) { delete list->front(); list->pop_front(); } } bool CLog::setFilter(const char* maxPriority) { if (maxPriority != NULL) { for (int i = 0; i < g_numPriority; ++i) { if (strcmp(maxPriority, g_priority[i]) == 0) { setFilter(i); return true; } } return false; } return true; } void CLog::setFilter(int maxPriority) { CArchMutexLock lock(m_mutex); m_maxPriority = maxPriority; } int CLog::getFilter() const { CArchMutexLock lock(m_mutex); return m_maxPriority; } void CLog::output(ELevel priority, char* msg) { assert(priority >= -1 && priority < g_numPriority); assert(msg != NULL); if (!msg) return; CArchMutexLock lock(m_mutex); COutputterList::const_iterator i; for (i = m_alwaysOutputters.begin(); i != m_alwaysOutputters.end(); ++i) { // write to outputter (*i)->write(priority, msg); } for (i = m_outputters.begin(); i != m_outputters.end(); ++i) { // write to outputter and break out of loop if it returns false if (!(*i)->write(priority, msg)) { break; } } } synergy-1.4.12-Source/src/lib/base/CLog.h0000600000175000017500000001565012021261364017757 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CLOG_H #define CLOG_H #include "common.h" #include "IArchMultithread.h" #include "stdlist.h" #include #include "CArch.h" #define CLOG (CLog::getInstance()) class ILogOutputter; class CThread; //! Logging facility /*! The logging class; all console output should go through this class. It supports multithread safe operation, several message priority levels, filtering by priority, and output redirection. The macros LOG() and LOGC() provide convenient access. */ class CLog { public: CLog(); ~CLog(); //! @name manipulators //@{ //! Add an outputter to the head of the list /*! Inserts an outputter to the head of the outputter list. When the logger writes a message, it goes to the outputter at the head of the outputter list. If that outputter's \c write() method returns true then it also goes to the next outputter, as so on until an outputter returns false or there are no more outputters. Outputters still in the outputter list when the log is destroyed will be deleted. If \c alwaysAtHead is true then the outputter is always called before all outputters with \c alwaysAtHead false and the return value of the outputter is ignored. By default, the logger has one outputter installed which writes to the console. */ void insert(ILogOutputter* adopted, bool alwaysAtHead = false); //! Remove an outputter from the list /*! Removes the first occurrence of the given outputter from the outputter list. It does nothing if the outputter is not in the list. The outputter is not deleted. */ void remove(ILogOutputter* orphaned); //! Remove the outputter from the head of the list /*! Removes and deletes the outputter at the head of the outputter list. This does nothing if the outputter list is empty. Only removes outputters that were inserted with the matching \c alwaysAtHead. */ void pop_front(bool alwaysAtHead = false); //! Set the minimum priority filter. /*! Set the filter. Messages below this priority are discarded. The default priority is 4 (INFO) (unless built without NDEBUG in which case it's 5 (DEBUG)). setFilter(const char*) returns true if the priority \c name was recognized; if \c name is NULL then it simply returns true. */ bool setFilter(const char* name); //! Set the minimum priority filter (by ordinal). void setFilter(int); //@} //! @name accessors //@{ //! Print a log message /*! Print a log message using the printf-like \c format and arguments preceded by the filename and line number. If \c file is NULL then neither the file nor the line are printed. */ void print(const char* file, int line, const char* format, ...); //! Get the minimum priority level. int getFilter() const; //! Get the filter name of the current filter level. const char* getFilterName() const; //! Get the filter name of a specified filter level. const char* getFilterName(int level) const; //! Get the singleton instance of the log static CLog* getInstance(); //! Get the console filter level (messages above this are not sent to console). int getConsoleMaxLevel() const { return kDEBUG2; } //@} private: void output(ELevel priority, char* msg); private: typedef std::list COutputterList; static CLog* s_log; CArchMutex m_mutex; COutputterList m_outputters; COutputterList m_alwaysOutputters; int m_maxNewlineLength; int m_maxPriority; }; /*! \def LOG(arg) Write to the log. Because macros cannot accept variable arguments, this should be invoked like so: \code LOG((CLOG_XXX "%d and %d are %s", x, y, x == y ? "equal" : "not equal")); \endcode In particular, notice the double open and close parentheses. Also note that there is no comma after the \c CLOG_XXX. The \c XXX should be replaced by one of enumerants in \c CLog::ELevel without the leading \c k. For example, \c CLOG_INFO. The special \c CLOG_PRINT level will not be filtered and is never prefixed by the filename and line number. If \c NOLOGGING is defined during the build then this macro expands to nothing. If \c NDEBUG is defined during the build then it expands to a call to CLog::print. Otherwise it expands to a call to CLog::printt, which includes the filename and line number. */ /*! \def LOGC(expr, arg) Write to the log if and only if expr is true. Because macros cannot accept variable arguments, this should be invoked like so: \code LOGC(x == y, (CLOG_XXX "%d and %d are equal", x, y)); \endcode In particular, notice the parentheses around everything after the boolean expression. Also note that there is no comma after the \c CLOG_XXX. The \c XXX should be replaced by one of enumerants in \c CLog::ELevel without the leading \c k. For example, \c CLOG_INFO. The special \c CLOG_PRINT level will not be filtered and is never prefixed by the filename and line number. If \c NOLOGGING is defined during the build then this macro expands to nothing. If \c NDEBUG is not defined during the build then it expands to a call to CLog::print that prints the filename and line number, otherwise it expands to a call that doesn't. */ #if defined(NOLOGGING) #define LOG(_a1) #define LOGC(_a1, _a2) #define CLOG_TRACE #elif defined(NDEBUG) #define LOG(_a1) CLOG->print _a1 #define LOGC(_a1, _a2) if (_a1) CLOG->print _a2 #define CLOG_TRACE NULL, 0, #else #define LOG(_a1) CLOG->print _a1 #define LOGC(_a1, _a2) if (_a1) CLOG->print _a2 #define CLOG_TRACE __FILE__, __LINE__, #endif // the CLOG_* defines are line and file plus %z and an octal number (060=0, // 071=9), but the limitation is that once we run out of numbers at either // end, then we resort to using non-numerical chars. this still works (since // to deduce the number we subtract octal \060, so '/' is -1, and ':' is 10 #define CLOG_PRINT CLOG_TRACE "%z\057" // char is '/' #define CLOG_CRIT CLOG_TRACE "%z\060" // char is '0' #define CLOG_ERR CLOG_TRACE "%z\061" #define CLOG_WARN CLOG_TRACE "%z\062" #define CLOG_NOTE CLOG_TRACE "%z\063" #define CLOG_INFO CLOG_TRACE "%z\064" #define CLOG_DEBUG CLOG_TRACE "%z\065" #define CLOG_DEBUG1 CLOG_TRACE "%z\066" #define CLOG_DEBUG2 CLOG_TRACE "%z\067" #define CLOG_DEBUG3 CLOG_TRACE "%z\070" #define CLOG_DEBUG4 CLOG_TRACE "%z\071" // char is '9' #define CLOG_DEBUG5 CLOG_TRACE "%z\072" // char is ':' #endif synergy-1.4.12-Source/src/lib/base/CMakeLists.txt0000600000175000017500000000275112021261364021520 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CEvent.h CEventQueue.h CFunctionEventJob.h CFunctionJob.h CLog.h CPriorityQueue.h CSimpleEventQueueBuffer.h CStopwatch.h CString.h CStringUtil.h CUnicode.h IEventJob.h IEventQueue.h IEventQueueBuffer.h IJob.h ILogOutputter.h LogOutputters.h TMethodEventJob.h TMethodJob.h XBase.h ELevel.h ) set(src CEvent.cpp CEventQueue.cpp CFunctionEventJob.cpp CFunctionJob.cpp CLog.cpp CSimpleEventQueueBuffer.cpp CStopwatch.cpp CStringUtil.cpp CUnicode.cpp IEventQueue.cpp LogOutputters.cpp XBase.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../common ../mt ../synergy ) if (UNIX) list(APPEND inc ../../.. ../base ) endif() include_directories(${inc}) add_library(base STATIC ${src}) if (UNIX) target_link_libraries(base common) endif() synergy-1.4.12-Source/src/lib/base/CPriorityQueue.h0000600000175000017500000000565312021261364022066 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CPRIORITYQUEUE_H #define CPRIORITYQUEUE_H #include "stdvector.h" #include #include //! A priority queue with an iterator /*! This priority queue is the same as a standard priority queue except: it sorts by std::greater, it has a forward iterator through the elements (which can appear in any order), and its contents can be swapped. */ template , #if defined(_MSC_VER) class Compare = std::greater > #else class Compare = std::greater > #endif class CPriorityQueue { public: typedef typename Container::value_type value_type; typedef typename Container::size_type size_type; typedef typename Container::iterator iterator; typedef typename Container::const_iterator const_iterator; typedef Container container_type; CPriorityQueue() { } CPriorityQueue(Container& swappedIn) { swap(swappedIn); } ~CPriorityQueue() { } //! @name manipulators //@{ //! Add element void push(const value_type& v) { c.push_back(v); std::push_heap(c.begin(), c.end(), comp); } //! Remove head element void pop() { std::pop_heap(c.begin(), c.end(), comp); c.pop_back(); } //! Erase element void erase(iterator i) { c.erase(i); std::make_heap(c.begin(), c.end(), comp); } //! Get start iterator iterator begin() { return c.begin(); } //! Get end iterator iterator end() { return c.end(); } //! Swap contents with another priority queue void swap(CPriorityQueue& q) { c.swap(q.c); } //! Swap contents with another container void swap(Container& c2) { c.swap(c2); std::make_heap(c.begin(), c.end(), comp); } //@} //! @name accessors //@{ //! Returns true if there are no elements bool empty() const { return c.empty(); } //! Returns the number of elements size_type size() const { return c.size(); } //! Returns the head element const value_type& top() const { return c.front(); } //! Get start iterator const_iterator begin() const { return c.begin(); } //! Get end iterator const_iterator end() const { return c.end(); } //@} private: Container c; Compare comp; }; #endif synergy-1.4.12-Source/src/lib/base/CSimpleEventQueueBuffer.cpp0000600000175000017500000000436012021261364024157 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CSimpleEventQueueBuffer.h" #include "CStopwatch.h" #include "CArch.h" // // CSimpleEventQueueBuffer // CSimpleEventQueueBuffer::CSimpleEventQueueBuffer() { m_queueMutex = ARCH->newMutex(); m_queueReadyCond = ARCH->newCondVar(); m_queueReady = false; } CSimpleEventQueueBuffer::~CSimpleEventQueueBuffer() { ARCH->closeCondVar(m_queueReadyCond); ARCH->closeMutex(m_queueMutex); } void CSimpleEventQueueBuffer::waitForEvent(double timeout) { CArchMutexLock lock(m_queueMutex); CStopwatch timer(true); while (!m_queueReady) { double timeLeft = timeout; if (timeLeft >= 0.0) { timeLeft -= timer.getTime(); if (timeLeft < 0.0) { return; } } ARCH->waitCondVar(m_queueReadyCond, m_queueMutex, timeLeft); } } IEventQueueBuffer::Type CSimpleEventQueueBuffer::getEvent(CEvent&, UInt32& dataID) { CArchMutexLock lock(m_queueMutex); if (!m_queueReady) { return kNone; } dataID = m_queue.back(); m_queue.pop_back(); m_queueReady = !m_queue.empty(); return kUser; } bool CSimpleEventQueueBuffer::addEvent(UInt32 dataID) { CArchMutexLock lock(m_queueMutex); m_queue.push_front(dataID); if (!m_queueReady) { m_queueReady = true; ARCH->broadcastCondVar(m_queueReadyCond); } return true; } bool CSimpleEventQueueBuffer::isEmpty() const { CArchMutexLock lock(m_queueMutex); return !m_queueReady; } CEventQueueTimer* CSimpleEventQueueBuffer::newTimer(double, bool) const { return new CEventQueueTimer; } void CSimpleEventQueueBuffer::deleteTimer(CEventQueueTimer* timer) const { delete timer; } synergy-1.4.12-Source/src/lib/base/CSimpleEventQueueBuffer.h0000600000175000017500000000327412021261364023627 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSIMPLEEVENTQUEUEBUFFER_H #define CSIMPLEEVENTQUEUEBUFFER_H #include "IEventQueueBuffer.h" #include "IArchMultithread.h" #include "stddeque.h" //! In-memory event queue buffer /*! An event queue buffer provides a queue of events for an IEventQueue. */ class CSimpleEventQueueBuffer : public IEventQueueBuffer { public: CSimpleEventQueueBuffer(); ~CSimpleEventQueueBuffer(); // IEventQueueBuffer overrides virtual void waitForEvent(double timeout); virtual Type getEvent(CEvent& event, UInt32& dataID); virtual bool addEvent(UInt32 dataID); virtual bool isEmpty() const; virtual CEventQueueTimer* newTimer(double duration, bool oneShot) const; virtual void deleteTimer(CEventQueueTimer*) const; private: typedef std::deque CEventDeque; CArchMutex m_queueMutex; CArchCond m_queueReadyCond; bool m_queueReady; CEventDeque m_queue; }; class CEventQueueTimer { public: CEventQueueTimer() { } virtual ~CEventQueueTimer() { } }; #endif synergy-1.4.12-Source/src/lib/base/CStopwatch.cpp0000600000175000017500000000410012021261364021531 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CStopwatch.h" #include "CArch.h" // // CStopwatch // CStopwatch::CStopwatch(bool triggered) : m_mark(0.0), m_triggered(triggered), m_stopped(triggered) { if (!triggered) { m_mark = ARCH->time(); } } CStopwatch::~CStopwatch() { // do nothing } double CStopwatch::reset() { if (m_stopped) { const double dt = m_mark; m_mark = 0.0; return dt; } else { const double t = ARCH->time(); const double dt = t - m_mark; m_mark = t; return dt; } } void CStopwatch::stop() { if (m_stopped) { return; } // save the elapsed time m_mark = ARCH->time() - m_mark; m_stopped = true; } void CStopwatch::start() { m_triggered = false; if (!m_stopped) { return; } // set the mark such that it reports the time elapsed at stop() m_mark = ARCH->time() - m_mark; m_stopped = false; } void CStopwatch::setTrigger() { stop(); m_triggered = true; } double CStopwatch::getTime() { if (m_triggered) { const double dt = m_mark; start(); return dt; } else if (m_stopped) { return m_mark; } else { return ARCH->time() - m_mark; } } CStopwatch::operator double() { return getTime(); } bool CStopwatch::isStopped() const { return m_stopped; } double CStopwatch::getTime() const { if (m_stopped) { return m_mark; } else { return ARCH->time() - m_mark; } } CStopwatch::operator double() const { return getTime(); } synergy-1.4.12-Source/src/lib/base/CStopwatch.h0000600000175000017500000000542312021261364021207 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSTOPWATCH_H #define CSTOPWATCH_H #include "common.h" //! A timer class /*! This class measures time intervals. All time interval measurement should use this class. */ class CStopwatch { public: /*! The default constructor does an implicit reset() or setTrigger(). If triggered == false then the clock starts ticking. */ CStopwatch(bool triggered = false); ~CStopwatch(); //! @name manipulators //@{ //! Reset the timer to zero /*! Set the start time to the current time, returning the time since the last reset. This does not remove the trigger if it's set nor does it start a stopped clock. If the clock is stopped then subsequent reset()'s will return 0. */ double reset(); //! Stop the timer /*! Stop the stopwatch. The time interval while stopped is not counted by the stopwatch. stop() does not remove the trigger. Has no effect if already stopped. */ void stop(); //! Start the timer /*! Start the stopwatch. start() removes the trigger, even if the stopwatch was already started. */ void start(); //! Stop the timer and set the trigger /*! setTrigger() stops the clock like stop() except there's an implicit start() the next time (non-const) getTime() is called. This is useful when you want the clock to start the first time you check it. */ void setTrigger(); //! Get elapsed time /*! Returns the time since the last reset() (or calls reset() and returns zero if the trigger is set). */ double getTime(); //! Same as getTime() operator double(); //@} //! @name accessors //@{ //! Check if timer is stopped /*! Returns true if the stopwatch is stopped. */ bool isStopped() const; // return the time since the last reset(). //! Get elapsed time /*! Returns the time since the last reset(). This cannot trigger the stopwatch to start and will not clear the trigger. */ double getTime() const; //! Same as getTime() const operator double() const; //@} private: double getClock() const; private: double m_mark; bool m_triggered; bool m_stopped; }; #endif synergy-1.4.12-Source/src/lib/base/CString.h0000600000175000017500000000161412021261364020477 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSTRING_H #define CSTRING_H #include "common.h" #include "stdstring.h" // use standard C++ string class for our string class typedef std::string CString; #endif synergy-1.4.12-Source/src/lib/base/CStringUtil.cpp0000600000175000017500000001060312021261364021666 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CStringUtil.h" #include "CArch.h" #include "common.h" #include "stdvector.h" #include #include #include #include #include // // CStringUtil // CString CStringUtil::format(const char* fmt, ...) { va_list args; va_start(args, fmt); CString result = vformat(fmt, args); va_end(args); return result; } CString CStringUtil::vformat(const char* fmt, va_list args) { // find highest indexed substitution and the locations of substitutions std::vector pos; std::vector width; std::vector index; int maxIndex = 0; for (const char* scan = fmt; *scan != '\0'; ++scan) { if (*scan == '%') { ++scan; if (*scan == '\0') { break; } else if (*scan == '%') { // literal index.push_back(0); pos.push_back(static_cast(scan - 1 - fmt)); width.push_back(2); } else if (*scan == '{') { // get argument index char* end; int i = static_cast(strtol(scan + 1, &end, 10)); if (*end != '}') { // invalid index -- ignore scan = end - 1; } else { index.push_back(i); pos.push_back(static_cast(scan - 1 - fmt)); width.push_back(static_cast(end - scan + 2)); if (i > maxIndex) { maxIndex = i; } scan = end; } } else { // improper escape -- ignore } } } // get args std::vector value; std::vector length; value.push_back("%"); length.push_back(1); for (int i = 0; i < maxIndex; ++i) { const char* arg = va_arg(args, const char*); size_t len = strlen(arg); value.push_back(arg); length.push_back(len); } // compute final length size_t resultLength = strlen(fmt); const int n = static_cast(pos.size()); for (int i = 0; i < n; ++i) { resultLength -= width[i]; resultLength += length[index[i]]; } // substitute CString result; result.reserve(resultLength); size_t src = 0; for (int i = 0; i < n; ++i) { result.append(fmt + src, pos[i] - src); result.append(value[index[i]]); src = pos[i] + width[i]; } result.append(fmt + src); return result; } CString CStringUtil::print(const char* fmt, ...) { char tmp[1024]; char* buffer = tmp; int len = (int)(sizeof(tmp) / sizeof(tmp[0])); CString result; while (buffer != NULL) { // try printing into the buffer va_list args; va_start(args, fmt); int n = ARCH->vsnprintf(buffer, len, fmt, args); va_end(args); // if the buffer wasn't big enough then make it bigger and try again if (n < 0 || n > len) { if (buffer != tmp) { delete[] buffer; } len *= 2; buffer = new char[len]; } // if it was big enough then save the string and don't try again else { result = buffer; if (buffer != tmp) { delete[] buffer; } buffer = NULL; } } return result; } // // CStringUtil::CaselessCmp // bool CStringUtil::CaselessCmp::cmpEqual( const CString::value_type& a, const CString::value_type& b) { // should use std::tolower but not in all versions of libstdc++ have it return tolower(a) == tolower(b); } bool CStringUtil::CaselessCmp::cmpLess( const CString::value_type& a, const CString::value_type& b) { // should use std::tolower but not in all versions of libstdc++ have it return tolower(a) < tolower(b); } bool CStringUtil::CaselessCmp::less(const CString& a, const CString& b) { return std::lexicographical_compare( a.begin(), a.end(), b.begin(), b.end(), &CStringUtil::CaselessCmp::cmpLess); } bool CStringUtil::CaselessCmp::equal(const CString& a, const CString& b) { return !(less(a, b) || less(b, a)); } bool CStringUtil::CaselessCmp::operator()(const CString& a, const CString& b) const { return less(a, b); } synergy-1.4.12-Source/src/lib/base/CStringUtil.h0000600000175000017500000000461612021261364021342 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSTRINGUTIL_H #define CSTRINGUTIL_H #include "CString.h" #include //! String utilities /*! This class provides various functions for string manipulation. */ class CStringUtil { public: //! Format positional arguments /*! Format a string using positional arguments. fmt has literal characters and conversion specifications introduced by `\%': - \%\% -- literal `\%' - \%{n} -- positional element n, n a positive integer, {} are literal All arguments in the variable list are const char*. Positional elements are indexed from 1. */ static CString format(const char* fmt, ...); //! Format positional arguments /*! Same as format() except takes va_list. */ static CString vformat(const char* fmt, va_list); //! Print a string using printf-style formatting /*! Equivalent to printf() except the result is returned as a CString. */ static CString print(const char* fmt, ...); //! Case-insensitive comparisons /*! This class provides case-insensitve comparison functions. */ class CaselessCmp { public: //! Same as less() bool operator()(const CString& a, const CString& b) const; //! Returns true iff \c a is lexicographically less than \c b static bool less(const CString& a, const CString& b); //! Returns true iff \c a is lexicographically equal to \c b static bool equal(const CString& a, const CString& b); //! Returns true iff \c a is lexicographically less than \c b static bool cmpLess(const CString::value_type& a, const CString::value_type& b); //! Returns true iff \c a is lexicographically equal to \c b static bool cmpEqual(const CString::value_type& a, const CString::value_type& b); }; }; #endif synergy-1.4.12-Source/src/lib/base/CUnicode.cpp0000600000175000017500000004042712021261364021157 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CUnicode.h" #include "CArch.h" #include // // local utility functions // inline static UInt16 decode16(const UInt8* n, bool byteSwapped) { union x16 { UInt8 n8[2]; UInt16 n16; } c; if (byteSwapped) { c.n8[0] = n[1]; c.n8[1] = n[0]; } else { c.n8[0] = n[0]; c.n8[1] = n[1]; } return c.n16; } inline static UInt32 decode32(const UInt8* n, bool byteSwapped) { union x32 { UInt8 n8[4]; UInt32 n32; } c; if (byteSwapped) { c.n8[0] = n[3]; c.n8[1] = n[2]; c.n8[2] = n[1]; c.n8[3] = n[0]; } else { c.n8[0] = n[0]; c.n8[1] = n[1]; c.n8[2] = n[2]; c.n8[3] = n[3]; } return c.n32; } inline static void resetError(bool* errors) { if (errors != NULL) { *errors = false; } } inline static void setError(bool* errors) { if (errors != NULL) { *errors = true; } } // // CUnicode // UInt32 CUnicode::s_invalid = 0x0000ffff; UInt32 CUnicode::s_replacement = 0x0000fffd; bool CUnicode::isUTF8(const CString& src) { // convert and test each character const UInt8* data = reinterpret_cast(src.c_str()); for (UInt32 n = (UInt32)src.size(); n > 0; ) { if (fromUTF8(data, n) == s_invalid) { return false; } } return true; } CString CUnicode::UTF8ToUCS2(const CString& src, bool* errors) { // default to success resetError(errors); // get size of input string and reserve some space in output UInt32 n = (UInt32)src.size(); CString dst; dst.reserve(2 * n); // convert each character const UInt8* data = reinterpret_cast(src.c_str()); while (n > 0) { UInt32 c = fromUTF8(data, n); if (c == s_invalid) { c = s_replacement; } else if (c >= 0x00010000) { setError(errors); c = s_replacement; } UInt16 ucs2 = static_cast(c); dst.append(reinterpret_cast(&ucs2), 2); } return dst; } CString CUnicode::UTF8ToUCS4(const CString& src, bool* errors) { // default to success resetError(errors); // get size of input string and reserve some space in output UInt32 n = (UInt32)src.size(); CString dst; dst.reserve(4 * n); // convert each character const UInt8* data = reinterpret_cast(src.c_str()); while (n > 0) { UInt32 c = fromUTF8(data, n); if (c == s_invalid) { c = s_replacement; } dst.append(reinterpret_cast(&c), 4); } return dst; } CString CUnicode::UTF8ToUTF16(const CString& src, bool* errors) { // default to success resetError(errors); // get size of input string and reserve some space in output UInt32 n = (UInt32)src.size(); CString dst; dst.reserve(2 * n); // convert each character const UInt8* data = reinterpret_cast(src.c_str()); while (n > 0) { UInt32 c = fromUTF8(data, n); if (c == s_invalid) { c = s_replacement; } else if (c >= 0x00110000) { setError(errors); c = s_replacement; } if (c < 0x00010000) { UInt16 ucs2 = static_cast(c); dst.append(reinterpret_cast(&ucs2), 2); } else { c -= 0x00010000; UInt16 utf16h = static_cast((c >> 10) + 0xd800); UInt16 utf16l = static_cast((c & 0x03ff) + 0xdc00); dst.append(reinterpret_cast(&utf16h), 2); dst.append(reinterpret_cast(&utf16l), 2); } } return dst; } CString CUnicode::UTF8ToUTF32(const CString& src, bool* errors) { // default to success resetError(errors); // get size of input string and reserve some space in output UInt32 n = (UInt32)src.size(); CString dst; dst.reserve(4 * n); // convert each character const UInt8* data = reinterpret_cast(src.c_str()); while (n > 0) { UInt32 c = fromUTF8(data, n); if (c == s_invalid) { c = s_replacement; } else if (c >= 0x00110000) { setError(errors); c = s_replacement; } dst.append(reinterpret_cast(&c), 4); } return dst; } CString CUnicode::UTF8ToText(const CString& src, bool* errors) { // default to success resetError(errors); // convert to wide char UInt32 size; wchar_t* tmp = UTF8ToWideChar(src, size, errors); // convert string to multibyte int len = ARCH->convStringWCToMB(NULL, tmp, size, errors); char* mbs = new char[len + 1]; ARCH->convStringWCToMB(mbs, tmp, size, errors); CString text(mbs, len); // clean up delete[] mbs; delete[] tmp; return text; } CString CUnicode::UCS2ToUTF8(const CString& src, bool* errors) { // default to success resetError(errors); // convert UInt32 n = (UInt32)src.size() >> 1; return doUCS2ToUTF8(reinterpret_cast(src.data()), n, errors); } CString CUnicode::UCS4ToUTF8(const CString& src, bool* errors) { // default to success resetError(errors); // convert UInt32 n = (UInt32)src.size() >> 2; return doUCS4ToUTF8(reinterpret_cast(src.data()), n, errors); } CString CUnicode::UTF16ToUTF8(const CString& src, bool* errors) { // default to success resetError(errors); // convert UInt32 n = (UInt32)src.size() >> 1; return doUTF16ToUTF8(reinterpret_cast(src.data()), n, errors); } CString CUnicode::UTF32ToUTF8(const CString& src, bool* errors) { // default to success resetError(errors); // convert UInt32 n = (UInt32)src.size() >> 2; return doUTF32ToUTF8(reinterpret_cast(src.data()), n, errors); } CString CUnicode::textToUTF8(const CString& src, bool* errors) { // default to success resetError(errors); // convert string to wide characters UInt32 n = (UInt32)src.size(); int len = ARCH->convStringMBToWC(NULL, src.c_str(), n, errors); wchar_t* wcs = new wchar_t[len + 1]; ARCH->convStringMBToWC(wcs, src.c_str(), n, errors); // convert to UTF8 CString utf8 = wideCharToUTF8(wcs, len, errors); // clean up delete[] wcs; return utf8; } wchar_t* CUnicode::UTF8ToWideChar(const CString& src, UInt32& size, bool* errors) { // convert to platform's wide character encoding CString tmp; switch (ARCH->getWideCharEncoding()) { case IArchString::kUCS2: tmp = UTF8ToUCS2(src, errors); size = (UInt32)tmp.size() >> 1; break; case IArchString::kUCS4: tmp = UTF8ToUCS4(src, errors); size = (UInt32)tmp.size() >> 2; break; case IArchString::kUTF16: tmp = UTF8ToUTF16(src, errors); size = (UInt32)tmp.size() >> 1; break; case IArchString::kUTF32: tmp = UTF8ToUTF32(src, errors); size = (UInt32)tmp.size() >> 2; break; default: assert(0 && "unknown wide character encoding"); } // copy to a wchar_t array wchar_t* dst = new wchar_t[size]; ::memcpy(dst, tmp.data(), sizeof(wchar_t) * size); return dst; } CString CUnicode::wideCharToUTF8(const wchar_t* src, UInt32 size, bool* errors) { // convert from platform's wide character encoding. // note -- this must include a wide nul character (independent of // the CString's nul character). switch (ARCH->getWideCharEncoding()) { case IArchString::kUCS2: return doUCS2ToUTF8(reinterpret_cast(src), size, errors); case IArchString::kUCS4: return doUCS4ToUTF8(reinterpret_cast(src), size, errors); case IArchString::kUTF16: return doUTF16ToUTF8(reinterpret_cast(src), size, errors); case IArchString::kUTF32: return doUTF32ToUTF8(reinterpret_cast(src), size, errors); default: assert(0 && "unknown wide character encoding"); return CString(); } } CString CUnicode::doUCS2ToUTF8(const UInt8* data, UInt32 n, bool* errors) { // make some space CString dst; dst.reserve(n); // check if first character is 0xfffe or 0xfeff bool byteSwapped = false; if (n >= 1) { switch (decode16(data, false)) { case 0x0000feff: data += 2; --n; break; case 0x0000fffe: byteSwapped = true; data += 2; --n; break; default: break; } } // convert each character for (; n > 0; data += 2, --n) { UInt32 c = decode16(data, byteSwapped); toUTF8(dst, c, errors); } return dst; } CString CUnicode::doUCS4ToUTF8(const UInt8* data, UInt32 n, bool* errors) { // make some space CString dst; dst.reserve(n); // check if first character is 0xfffe or 0xfeff bool byteSwapped = false; if (n >= 1) { switch (decode32(data, false)) { case 0x0000feff: data += 4; --n; break; case 0x0000fffe: byteSwapped = true; data += 4; --n; break; default: break; } } // convert each character for (; n > 0; data += 4, --n) { UInt32 c = decode32(data, byteSwapped); toUTF8(dst, c, errors); } return dst; } CString CUnicode::doUTF16ToUTF8(const UInt8* data, UInt32 n, bool* errors) { // make some space CString dst; dst.reserve(n); // check if first character is 0xfffe or 0xfeff bool byteSwapped = false; if (n >= 1) { switch (decode16(data, false)) { case 0x0000feff: data += 2; --n; break; case 0x0000fffe: byteSwapped = true; data += 2; --n; break; default: break; } } // convert each character for (; n > 0; data += 2, --n) { UInt32 c = decode16(data, byteSwapped); if (c < 0x0000d800 || c > 0x0000dfff) { toUTF8(dst, c, errors); } else if (n == 1) { // error -- missing second word setError(errors); toUTF8(dst, s_replacement, NULL); } else if (c >= 0x0000d800 && c <= 0x0000dbff) { UInt32 c2 = decode16(data, byteSwapped); data += 2; --n; if (c2 < 0x0000dc00 || c2 > 0x0000dfff) { // error -- [d800,dbff] not followed by [dc00,dfff] setError(errors); toUTF8(dst, s_replacement, NULL); } else { c = (((c - 0x0000d800) << 10) | (c2 - 0x0000dc00)) + 0x00010000; toUTF8(dst, c, errors); } } else { // error -- [dc00,dfff] without leading [d800,dbff] setError(errors); toUTF8(dst, s_replacement, NULL); } } return dst; } CString CUnicode::doUTF32ToUTF8(const UInt8* data, UInt32 n, bool* errors) { // make some space CString dst; dst.reserve(n); // check if first character is 0xfffe or 0xfeff bool byteSwapped = false; if (n >= 1) { switch (decode32(data, false)) { case 0x0000feff: data += 4; --n; break; case 0x0000fffe: byteSwapped = true; data += 4; --n; break; default: break; } } // convert each character for (; n > 0; data += 4, --n) { UInt32 c = decode32(data, byteSwapped); if (c >= 0x00110000) { setError(errors); c = s_replacement; } toUTF8(dst, c, errors); } return dst; } UInt32 CUnicode::fromUTF8(const UInt8*& data, UInt32& n) { assert(data != NULL); assert(n != 0); // compute character encoding length, checking for overlong // sequences (i.e. characters that don't use the shortest // possible encoding). UInt32 size; if (data[0] < 0x80) { // 0xxxxxxx size = 1; } else if (data[0] < 0xc0) { // 10xxxxxx -- in the middle of a multibyte character. counts // as one invalid character. --n; ++data; return s_invalid; } else if (data[0] < 0xe0) { // 110xxxxx size = 2; } else if (data[0] < 0xf0) { // 1110xxxx size = 3; } else if (data[0] < 0xf8) { // 11110xxx size = 4; } else if (data[0] < 0xfc) { // 111110xx size = 5; } else if (data[0] < 0xfe) { // 1111110x size = 6; } else { // invalid sequence. dunno how many bytes to skip so skip one. --n; ++data; return s_invalid; } // make sure we have enough data if (size > n) { data += n; n = 0; return s_invalid; } // extract character UInt32 c; switch (size) { case 1: c = static_cast(data[0]); break; case 2: c = ((static_cast(data[0]) & 0x1f) << 6) | ((static_cast(data[1]) & 0x3f) ); break; case 3: c = ((static_cast(data[0]) & 0x0f) << 12) | ((static_cast(data[1]) & 0x3f) << 6) | ((static_cast(data[2]) & 0x3f) ); break; case 4: c = ((static_cast(data[0]) & 0x07) << 18) | ((static_cast(data[1]) & 0x3f) << 12) | ((static_cast(data[1]) & 0x3f) << 6) | ((static_cast(data[1]) & 0x3f) ); break; case 5: c = ((static_cast(data[0]) & 0x03) << 24) | ((static_cast(data[1]) & 0x3f) << 18) | ((static_cast(data[1]) & 0x3f) << 12) | ((static_cast(data[1]) & 0x3f) << 6) | ((static_cast(data[1]) & 0x3f) ); break; case 6: c = ((static_cast(data[0]) & 0x01) << 30) | ((static_cast(data[1]) & 0x3f) << 24) | ((static_cast(data[1]) & 0x3f) << 18) | ((static_cast(data[1]) & 0x3f) << 12) | ((static_cast(data[1]) & 0x3f) << 6) | ((static_cast(data[1]) & 0x3f) ); break; default: assert(0 && "invalid size"); return s_invalid; } // check that all bytes after the first have the pattern 10xxxxxx. // truncated sequences are treated as a single malformed character. bool truncated = false; switch (size) { case 6: if ((data[5] & 0xc0) != 0x80) { truncated = true; size = 5; } // fall through case 5: if ((data[4] & 0xc0) != 0x80) { truncated = true; size = 4; } // fall through case 4: if ((data[3] & 0xc0) != 0x80) { truncated = true; size = 3; } // fall through case 3: if ((data[2] & 0xc0) != 0x80) { truncated = true; size = 2; } // fall through case 2: if ((data[1] & 0xc0) != 0x80) { truncated = true; size = 1; } } // update parameters data += size; n -= size; // invalid if sequence was truncated if (truncated) { return s_invalid; } // check for characters that didn't use the smallest possible encoding static UInt32 s_minChar[] = { 0, 0x00000000, 0x00000080, 0x00000800, 0x00010000, 0x00200000, 0x04000000 }; if (c < s_minChar[size]) { return s_invalid; } // check for characters not in ISO-10646 if (c >= 0x0000d800 && c <= 0x0000dfff) { return s_invalid; } if (c >= 0x0000fffe && c <= 0x0000ffff) { return s_invalid; } return c; } void CUnicode::toUTF8(CString& dst, UInt32 c, bool* errors) { UInt8 data[6]; // handle characters outside the valid range if ((c >= 0x0000d800 && c <= 0x0000dfff) || c >= 0x80000000) { setError(errors); c = s_replacement; } // convert to UTF-8 if (c < 0x00000080) { data[0] = static_cast(c); dst.append(reinterpret_cast(data), 1); } else if (c < 0x00000800) { data[0] = static_cast(((c >> 6) & 0x0000001f) + 0xc0); data[1] = static_cast((c & 0x0000003f) + 0x80); dst.append(reinterpret_cast(data), 2); } else if (c < 0x00010000) { data[0] = static_cast(((c >> 12) & 0x0000000f) + 0xe0); data[1] = static_cast(((c >> 6) & 0x0000003f) + 0x80); data[2] = static_cast((c & 0x0000003f) + 0x80); dst.append(reinterpret_cast(data), 3); } else if (c < 0x00200000) { data[0] = static_cast(((c >> 18) & 0x00000007) + 0xf0); data[1] = static_cast(((c >> 12) & 0x0000003f) + 0x80); data[2] = static_cast(((c >> 6) & 0x0000003f) + 0x80); data[3] = static_cast((c & 0x0000003f) + 0x80); dst.append(reinterpret_cast(data), 4); } else if (c < 0x04000000) { data[0] = static_cast(((c >> 24) & 0x00000003) + 0xf8); data[1] = static_cast(((c >> 18) & 0x0000003f) + 0x80); data[2] = static_cast(((c >> 12) & 0x0000003f) + 0x80); data[3] = static_cast(((c >> 6) & 0x0000003f) + 0x80); data[4] = static_cast((c & 0x0000003f) + 0x80); dst.append(reinterpret_cast(data), 5); } else if (c < 0x80000000) { data[0] = static_cast(((c >> 30) & 0x00000001) + 0xfc); data[1] = static_cast(((c >> 24) & 0x0000003f) + 0x80); data[2] = static_cast(((c >> 18) & 0x0000003f) + 0x80); data[3] = static_cast(((c >> 12) & 0x0000003f) + 0x80); data[4] = static_cast(((c >> 6) & 0x0000003f) + 0x80); data[5] = static_cast((c & 0x0000003f) + 0x80); dst.append(reinterpret_cast(data), 6); } else { assert(0 && "character out of range"); } } synergy-1.4.12-Source/src/lib/base/CUnicode.h0000600000175000017500000001147512021261364020625 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CUNICODE_H #define CUNICODE_H #include "CString.h" #include "BasicTypes.h" //! Unicode utility functions /*! This class provides functions for converting between various Unicode encodings and the current locale encoding. */ class CUnicode { public: //! @name accessors //@{ //! Test UTF-8 string for validity /*! Returns true iff the string contains a valid sequence of UTF-8 encoded characters. */ static bool isUTF8(const CString&); //! Convert from UTF-8 to UCS-2 encoding /*! Convert from UTF-8 to UCS-2. If errors is not NULL then *errors is set to true iff any character could not be encoded in UCS-2. Decoding errors do not set *errors. */ static CString UTF8ToUCS2(const CString&, bool* errors = NULL); //! Convert from UTF-8 to UCS-4 encoding /*! Convert from UTF-8 to UCS-4. If errors is not NULL then *errors is set to true iff any character could not be encoded in UCS-4. Decoding errors do not set *errors. */ static CString UTF8ToUCS4(const CString&, bool* errors = NULL); //! Convert from UTF-8 to UTF-16 encoding /*! Convert from UTF-8 to UTF-16. If errors is not NULL then *errors is set to true iff any character could not be encoded in UTF-16. Decoding errors do not set *errors. */ static CString UTF8ToUTF16(const CString&, bool* errors = NULL); //! Convert from UTF-8 to UTF-32 encoding /*! Convert from UTF-8 to UTF-32. If errors is not NULL then *errors is set to true iff any character could not be encoded in UTF-32. Decoding errors do not set *errors. */ static CString UTF8ToUTF32(const CString&, bool* errors = NULL); //! Convert from UTF-8 to the current locale encoding /*! Convert from UTF-8 to the current locale encoding. If errors is not NULL then *errors is set to true iff any character could not be encoded. Decoding errors do not set *errors. */ static CString UTF8ToText(const CString&, bool* errors = NULL); //! Convert from UCS-2 to UTF-8 /*! Convert from UCS-2 to UTF-8. If errors is not NULL then *errors is set to true iff any character could not be decoded. */ static CString UCS2ToUTF8(const CString&, bool* errors = NULL); //! Convert from UCS-4 to UTF-8 /*! Convert from UCS-4 to UTF-8. If errors is not NULL then *errors is set to true iff any character could not be decoded. */ static CString UCS4ToUTF8(const CString&, bool* errors = NULL); //! Convert from UTF-16 to UTF-8 /*! Convert from UTF-16 to UTF-8. If errors is not NULL then *errors is set to true iff any character could not be decoded. */ static CString UTF16ToUTF8(const CString&, bool* errors = NULL); //! Convert from UTF-32 to UTF-8 /*! Convert from UTF-32 to UTF-8. If errors is not NULL then *errors is set to true iff any character could not be decoded. */ static CString UTF32ToUTF8(const CString&, bool* errors = NULL); //! Convert from the current locale encoding to UTF-8 /*! Convert from the current locale encoding to UTF-8. If errors is not NULL then *errors is set to true iff any character could not be decoded. */ static CString textToUTF8(const CString&, bool* errors = NULL); //@} private: // convert UTF8 to wchar_t string (using whatever encoding is native // to the platform). caller must delete[] the returned string. the // string is *not* nul terminated; the length (in characters) is // returned in size. static wchar_t* UTF8ToWideChar(const CString&, UInt32& size, bool* errors); // convert nul terminated wchar_t string (in platform's native // encoding) to UTF8. static CString wideCharToUTF8(const wchar_t*, UInt32 size, bool* errors); // internal conversion to UTF8 static CString doUCS2ToUTF8(const UInt8* src, UInt32 n, bool* errors); static CString doUCS4ToUTF8(const UInt8* src, UInt32 n, bool* errors); static CString doUTF16ToUTF8(const UInt8* src, UInt32 n, bool* errors); static CString doUTF32ToUTF8(const UInt8* src, UInt32 n, bool* errors); // convert characters to/from UTF8 static UInt32 fromUTF8(const UInt8*& src, UInt32& size); static void toUTF8(CString& dst, UInt32 c, bool* errors); private: static UInt32 s_invalid; static UInt32 s_replacement; }; #endif synergy-1.4.12-Source/src/lib/base/ELevel.h0000600000175000017500000000265412021261364020307 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ELEVEL_H #define ELEVEL_H //! Log levels /*! The logging priority levels in order of highest to lowest priority. */ enum ELevel { kPRINT = -1, //!< For print only (no file or time) kFATAL, //!< For fatal errors kERROR, //!< For serious errors kWARNING, //!< For minor errors and warnings kNOTE, //!< For messages about notable events kINFO, //!< For informational messages kDEBUG, //!< For important debugging messages kDEBUG1, //!< For verbosity +1 debugging messages kDEBUG2, //!< For verbosity +2 debugging messages kDEBUG3, //!< For verbosity +3 debugging messages kDEBUG4, //!< For verbosity +4 debugging messages kDEBUG5 //!< For verbosity +5 debugging messages }; #endif synergy-1.4.12-Source/src/lib/base/IEventJob.h0000600000175000017500000000200012021261364020741 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IEVENTJOB_H #define IEVENTJOB_H #include "IInterface.h" class CEvent; //! Event handler interface /*! An event job is an interface for executing a event handler. */ class IEventJob : public IInterface { public: //! Run the job virtual void run(const CEvent&) = 0; }; #endif synergy-1.4.12-Source/src/lib/base/IEventQueue.cpp0000600000175000017500000000305212131447503021661 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IEventQueue.h" #include "CLog.h" #if WINAPI_CARBON #include #include #endif // // IEventQueue // static int g_systemTarget = 0; IEventQueue* IEventQueue::s_instance = NULL; void* IEventQueue::getSystemTarget() { // any unique arbitrary pointer will do return &g_systemTarget; } IEventQueue* IEventQueue::getInstance() { if (s_instance == NULL) { LOG((CLOG_ERR "null event queue")); #if WINAPI_CARBON void* callstack[128]; int i, frames = backtrace(callstack, 128); char** strs = backtrace_symbols(callstack, frames); for (i = 0; i < frames; ++i) { printf("%s\n", strs[i]); } free(strs); #endif } assert(s_instance != NULL); return s_instance; } void IEventQueue::setInstance(IEventQueue* instance) { assert(s_instance == NULL || instance == NULL); s_instance = instance; } synergy-1.4.12-Source/src/lib/base/IEventQueue.h0000600000175000017500000001520412021261364021325 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IEVENTQUEUE_H #define IEVENTQUEUE_H #include "IInterface.h" #include "CEvent.h" #include "CString.h" #define EVENTQUEUE IEventQueue::getInstance() class IEventJob; class IEventQueueBuffer; // Opaque type for timer info. This is defined by subclasses of // IEventQueueBuffer. class CEventQueueTimer; //! Event queue interface /*! An event queue provides a queue of CEvents. Clients can block waiting on any event becoming available at the head of the queue and can place new events at the end of the queue. Clients can also add and remove timers which generate events periodically. */ class IEventQueue : public IInterface { public: class CTimerEvent { public: CEventQueueTimer* m_timer; //!< The timer UInt32 m_count; //!< Number of repeats }; //! @name manipulators //@{ //! Loop the event queue until quit /*! Dequeues and dispatches events until the kQuit event is found. */ virtual void loop() = 0; //! Set the buffer /*! Replace the current event queue buffer. Any queued events are discarded. The queue takes ownership of the buffer. */ virtual void adoptBuffer(IEventQueueBuffer*) = 0; //! Remove event from queue /*! Returns the next event on the queue into \p event. If no event is available then blocks for up to \p timeout seconds, or forever if \p timeout is negative. Returns true iff an event was available. */ virtual bool getEvent(CEvent& event, double timeout = -1.0) = 0; //! Dispatch an event /*! Looks up the dispatcher for the event's target and invokes it. Returns true iff a dispatcher exists for the target. */ virtual bool dispatchEvent(const CEvent& event) = 0; //! Add event to queue /*! Adds \p event to the end of the queue. */ virtual void addEvent(const CEvent& event) = 0; //! Create a recurring timer /*! Creates and returns a timer. An event is returned after \p duration seconds and the timer is reset to countdown again. When a timer event is returned the data points to a \c CTimerEvent. The client must pass the returned timer to \c deleteTimer() (whether or not the timer has expired) to release the timer. The returned timer event uses the given \p target. If \p target is NULL it uses the returned timer as the target. Events for a single timer don't accumulate in the queue, even if the client reading events can't keep up. Instead, the \c m_count member of the \c CTimerEvent indicates how many events for the timer would have been put on the queue since the last event for the timer was removed (or since the timer was added). */ virtual CEventQueueTimer* newTimer(double duration, void* target) = 0; //! Create a one-shot timer /*! Creates and returns a one-shot timer. An event is returned when the timer expires and the timer is removed from further handling. When a timer event is returned the data points to a \c CTimerEvent. The c_count member of the \c CTimerEvent is always 1. The client must pass the returned timer to \c deleteTimer() (whether or not the timer has expired) to release the timer. The returned timer event uses the given \p target. If \p target is NULL it uses the returned timer as the target. */ virtual CEventQueueTimer* newOneShotTimer(double duration, void* target) = 0; //! Destroy a timer /*! Destroys a previously created timer. The timer is removed from the queue and will not generate event, even if the timer has expired. */ virtual void deleteTimer(CEventQueueTimer*) = 0; //! Register an event handler for an event type /*! Registers an event handler for \p type and \p target. The \p handler is adopted. Any existing handler for the type,target pair is deleted. \c dispatchEvent() will invoke \p handler for any event for \p target of type \p type. If no such handler exists it will use the handler for \p target and type \p kUnknown if it exists. */ virtual void adoptHandler(CEvent::Type type, void* target, IEventJob* handler) = 0; //! Unregister an event handler for an event type /*! Unregisters an event handler for the \p type, \p target pair and deletes it. */ virtual void removeHandler(CEvent::Type type, void* target) = 0; //! Unregister all event handlers for an event target /*! Unregisters all event handlers for the \p target and deletes them. */ virtual void removeHandlers(void* target) = 0; //! Creates a new event type /*! Returns a unique event type id. */ virtual CEvent::Type registerType(const char* name) = 0; //! Creates a new event type /*! If \p type contains \c kUnknown then it is set to a unique event type id otherwise it is left alone. The final value of \p type is returned. */ virtual CEvent::Type registerTypeOnce(CEvent::Type& type, const char* name) = 0; //@} //! @name accessors //@{ //! Test if queue is empty /*! Returns true iff the queue has no events in it, including timer events. */ virtual bool isEmpty() const = 0; //! Get an event handler /*! Finds and returns the event handler for the \p type, \p target pair if it exists, otherwise it returns NULL. */ virtual IEventJob* getHandler(CEvent::Type type, void* target) const = 0; //! Get name for event /*! Returns the name for the event \p type. This is primarily for debugging. */ virtual const char* getTypeName(CEvent::Type type) = 0; //! Get an event type by name /*! Returns the registered type for an event for a given name. */ virtual CEvent::Type getRegisteredType(const CString& name) const = 0; //! Get the system event type target /*! Returns the target to use for dispatching \c CEvent::kSystem events. */ static void* getSystemTarget(); //! Get the singleton instance /*! Returns the singleton instance of the event queue */ static IEventQueue* getInstance(); //@} protected: //! @name manipulators //@{ //! Set the singleton instance /*! Sets the singleton instance of the event queue */ static void setInstance(IEventQueue*); //@} private: static IEventQueue* s_instance; }; #endif synergy-1.4.12-Source/src/lib/base/IEventQueueBuffer.h0000600000175000017500000000534012021261364022457 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IEVENTQUEUEBUFFER_H #define IEVENTQUEUEBUFFER_H #include "IInterface.h" #include "BasicTypes.h" class CEvent; class CEventQueueTimer; //! Event queue buffer interface /*! An event queue buffer provides a queue of events for an IEventQueue. */ class IEventQueueBuffer : public IInterface { public: enum Type { kNone, //!< No event is available kSystem, //!< Event is a system event kUser //!< Event is a user event }; //! @name manipulators //@{ //! Block waiting for an event /*! Wait for an event in the event queue buffer for up to \p timeout seconds. */ virtual void waitForEvent(double timeout) = 0; //! Get the next event /*! Get the next event from the buffer. Return kNone if no event is available. If a system event is next, return kSystem and fill in event. The event data in a system event can point to a static buffer (because CEvent::deleteData() will not attempt to delete data in a kSystem event). Otherwise, return kUser and fill in \p dataID with the value passed to \c addEvent(). */ virtual Type getEvent(CEvent& event, UInt32& dataID) = 0; //! Post an event /*! Add the given event to the end of the queue buffer. This is a user event and \c getEvent() must be able to identify it as such and return \p dataID. This method must cause \c waitForEvent() to return at some future time if it's blocked waiting on an event. */ virtual bool addEvent(UInt32 dataID) = 0; //@} //! @name accessors //@{ //! Check if event queue buffer is empty /*! Return true iff the event queue buffer is empty. */ virtual bool isEmpty() const = 0; //! Create a timer object /*! Create and return a timer object. The object is opaque and is used only by the buffer but it must be a valid object (i.e. not NULL). */ virtual CEventQueueTimer* newTimer(double duration, bool oneShot) const = 0; //! Destroy a timer object /*! Destroy a timer object previously returned by \c newTimer(). */ virtual void deleteTimer(CEventQueueTimer*) const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/base/IJob.h0000600000175000017500000000170212021261364017747 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IJOB_H #define IJOB_H #include "IInterface.h" //! Job interface /*! A job is an interface for executing some function. */ class IJob : public IInterface { public: //! Run the job virtual void run() = 0; }; #endif synergy-1.4.12-Source/src/lib/base/ILogOutputter.h0000600000175000017500000000416612021261364021721 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ILOGOUTPUTTER_H #define ILOGOUTPUTTER_H #include "IInterface.h" #include "CLog.h" #include "ELevel.h" //! Outputter interface /*! Type of outputter interface. The logger performs all output through outputters. ILogOutputter overrides must not call any log functions directly or indirectly. */ class ILogOutputter : public IInterface { public: //! @name manipulators //@{ //! Open the outputter /*! Opens the outputter for writing. Calling this method on an already open outputter must have no effect. */ virtual void open(const char* title) = 0; //! Close the outputter /*! Close the outputter. Calling this method on an already closed outputter must have no effect. */ virtual void close() = 0; //! Show the outputter /*! Causes the output to become visible. This generally only makes sense for a logger in a graphical user interface. Other implementations will do nothing. Iff \p showIfEmpty is \c false then the implementation may optionally only show the log if it's not empty. */ virtual void show(bool showIfEmpty) = 0; //! Write a message with level /*! Writes \c message, which has the given \c level, to a log. If this method returns true then CLog will stop passing the message to all outputters in the outputter chain, otherwise it continues. Most implementations should return true. */ virtual bool write(ELevel level, const char* message) = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/base/LogOutputters.cpp0000600000175000017500000001123612127373537022337 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "LogOutputters.h" #include "CArch.h" #include "TMethodJob.h" #include // // CStopLogOutputter // CStopLogOutputter::CStopLogOutputter() { // do nothing } CStopLogOutputter::~CStopLogOutputter() { // do nothing } void CStopLogOutputter::open(const char*) { // do nothing } void CStopLogOutputter::close() { // do nothing } void CStopLogOutputter::show(bool) { // do nothing } bool CStopLogOutputter::write(ELevel, const char*) { return false; } // // CConsoleLogOutputter // CConsoleLogOutputter::CConsoleLogOutputter() { } CConsoleLogOutputter::~CConsoleLogOutputter() { } void CConsoleLogOutputter::open(const char* title) { ARCH->openConsole(title); } void CConsoleLogOutputter::close() { ARCH->closeConsole(); } void CConsoleLogOutputter::show(bool showIfEmpty) { ARCH->showConsole(showIfEmpty); } bool CConsoleLogOutputter::write(ELevel level, const char* msg) { ARCH->writeConsole(level, msg); return true; } void CConsoleLogOutputter::flush() { } // // CSystemLogOutputter // CSystemLogOutputter::CSystemLogOutputter() { // do nothing } CSystemLogOutputter::~CSystemLogOutputter() { // do nothing } void CSystemLogOutputter::open(const char* title) { ARCH->openLog(title); } void CSystemLogOutputter::close() { ARCH->closeLog(); } void CSystemLogOutputter::show(bool showIfEmpty) { ARCH->showLog(showIfEmpty); } bool CSystemLogOutputter::write(ELevel level, const char* msg) { ARCH->writeLog(level, msg); return true; } // // CSystemLogger // CSystemLogger::CSystemLogger(const char* title, bool blockConsole) : m_stop(NULL) { // redirect log messages if (blockConsole) { m_stop = new CStopLogOutputter; CLOG->insert(m_stop); } m_syslog = new CSystemLogOutputter; m_syslog->open(title); CLOG->insert(m_syslog); } CSystemLogger::~CSystemLogger() { CLOG->remove(m_syslog); delete m_syslog; if (m_stop != NULL) { CLOG->remove(m_stop); delete m_stop; } } // // CBufferedLogOutputter // CBufferedLogOutputter::CBufferedLogOutputter(UInt32 maxBufferSize) : m_maxBufferSize(maxBufferSize) { // do nothing } CBufferedLogOutputter::~CBufferedLogOutputter() { // do nothing } CBufferedLogOutputter::const_iterator CBufferedLogOutputter::begin() const { return m_buffer.begin(); } CBufferedLogOutputter::const_iterator CBufferedLogOutputter::end() const { return m_buffer.end(); } void CBufferedLogOutputter::open(const char*) { // do nothing } void CBufferedLogOutputter::close() { // remove all elements from the buffer m_buffer.clear(); } void CBufferedLogOutputter::show(bool) { // do nothing } bool CBufferedLogOutputter::write(ELevel, const char* message) { while (m_buffer.size() >= m_maxBufferSize) { m_buffer.pop_front(); } m_buffer.push_back(CString(message)); return true; } // // CFileLogOutputter // CFileLogOutputter::CFileLogOutputter(const char* logFile) { assert(logFile != NULL); m_fileName = logFile; } CFileLogOutputter::~CFileLogOutputter() { } bool CFileLogOutputter::write(ELevel level, const char *message) { std::ofstream m_handle; m_handle.open(m_fileName.c_str(), std::fstream::app); if (m_handle.is_open() && m_handle.fail() != true) { m_handle << message << std::endl; } m_handle.close(); return true; } void CFileLogOutputter::open(const char *title) {} void CFileLogOutputter::close() {} void CFileLogOutputter::show(bool showIfEmpty) {} // // CMesssageBoxLogOutputter // CMesssageBoxLogOutputter::CMesssageBoxLogOutputter() { // do nothing } CMesssageBoxLogOutputter::~CMesssageBoxLogOutputter() { // do nothing } void CMesssageBoxLogOutputter::open(const char* title) { // do nothing } void CMesssageBoxLogOutputter::close() { // do nothing } void CMesssageBoxLogOutputter::show(bool showIfEmpty) { // do nothing } bool CMesssageBoxLogOutputter::write(ELevel level, const char* msg) { // don't spam user with messages. if (level > kERROR) { return true; } #if SYSAPI_WIN32 MessageBox(NULL, msg, CLOG->getFilterName(level), MB_OK); #endif return true; } synergy-1.4.12-Source/src/lib/base/LogOutputters.h0000600000175000017500000001046112120644363021772 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 LOGOUTPUTTERS_H #define LOGOUTPUTTERS_H #include "BasicTypes.h" #include "ILogOutputter.h" #include "CString.h" #include "stddeque.h" #include "CThread.h" #include #include //! Stop traversing log chain outputter /*! This outputter performs no output and returns false from \c write(), causing the logger to stop traversing the outputter chain. Insert this to prevent already inserted outputters from writing. */ class CStopLogOutputter : public ILogOutputter { public: CStopLogOutputter(); virtual ~CStopLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); }; //! Write log to console /*! This outputter writes output to the console. The level for each message is ignored. */ class CConsoleLogOutputter : public ILogOutputter { public: CConsoleLogOutputter(); virtual ~CConsoleLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); virtual void flush(); }; //! Write log to file /*! This outputter writes output to the file. The level for each message is ignored. */ class CFileLogOutputter : public ILogOutputter { public: CFileLogOutputter(const char* logFile); virtual ~CFileLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); private: std::string m_fileName; }; //! Write log to system log /*! This outputter writes output to the system log. */ class CSystemLogOutputter : public ILogOutputter { public: CSystemLogOutputter(); virtual ~CSystemLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); }; //! Write log to system log only /*! Creating an object of this type inserts a CStopLogOutputter followed by a CSystemLogOutputter into CLog. The destructor removes those outputters. Add one of these to any scope that needs to write to the system log (only) and restore the old outputters when exiting the scope. */ class CSystemLogger { public: CSystemLogger(const char* title, bool blockConsole); ~CSystemLogger(); private: ILogOutputter* m_syslog; ILogOutputter* m_stop; }; //! Save log history /*! This outputter records the last N log messages. */ class CBufferedLogOutputter : public ILogOutputter { private: typedef std::deque CBuffer; public: typedef CBuffer::const_iterator const_iterator; CBufferedLogOutputter(UInt32 maxBufferSize); virtual ~CBufferedLogOutputter(); //! @name accessors //@{ //! Get start of buffer const_iterator begin() const; //! Get end of buffer const_iterator end() const; //@} // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); private: UInt32 m_maxBufferSize; CBuffer m_buffer; }; //! Write log to message box /*! The level for each message is ignored. */ class CMesssageBoxLogOutputter : public ILogOutputter { public: CMesssageBoxLogOutputter(); virtual ~CMesssageBoxLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); }; #endif synergy-1.4.12-Source/src/lib/base/TMethodEventJob.h0000600000175000017500000000333712021261364022133 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMETHODEVENTJOB_H #define CMETHODEVENTJOB_H #include "IEventJob.h" //! Use a member function as an event job /*! An event job class that invokes a member function. */ template class TMethodEventJob : public IEventJob { public: //! run(event) invokes \c object->method(event, arg) TMethodEventJob(T* object, void (T::*method)(const CEvent&, void*), void* arg = NULL); virtual ~TMethodEventJob(); // IJob overrides virtual void run(const CEvent&); private: T* m_object; void (T::*m_method)(const CEvent&, void*); void* m_arg; }; template inline TMethodEventJob::TMethodEventJob(T* object, void (T::*method)(const CEvent&, void*), void* arg) : m_object(object), m_method(method), m_arg(arg) { // do nothing } template inline TMethodEventJob::~TMethodEventJob() { // do nothing } template inline void TMethodEventJob::run(const CEvent& event) { if (m_object != NULL) { (m_object->*m_method)(event, m_arg); } } #endif synergy-1.4.12-Source/src/lib/base/TMethodJob.h0000600000175000017500000000303412021261364021123 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMETHODJOB_H #define CMETHODJOB_H #include "IJob.h" //! Use a function as a job /*! A job class that invokes a member function. */ template class TMethodJob : public IJob { public: //! run() invokes \c object->method(arg) TMethodJob(T* object, void (T::*method)(void*), void* arg = NULL); virtual ~TMethodJob(); // IJob overrides virtual void run(); private: T* m_object; void (T::*m_method)(void*); void* m_arg; }; template inline TMethodJob::TMethodJob(T* object, void (T::*method)(void*), void* arg) : m_object(object), m_method(method), m_arg(arg) { // do nothing } template inline TMethodJob::~TMethodJob() { // do nothing } template inline void TMethodJob::run() { if (m_object != NULL) { (m_object->*m_method)(m_arg); } } #endif synergy-1.4.12-Source/src/lib/base/XBase.cpp0000600000175000017500000000266012021261364020465 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XBase.h" #include "CStringUtil.h" #include #include // // XBase // XBase::XBase() : m_what() { // do nothing } XBase::XBase(const CString& msg) : m_what(msg) { // do nothing } XBase::~XBase() { // do nothing } const char* XBase::what() const { if (m_what.empty()) { m_what = getWhat(); } return m_what.c_str(); } CString XBase::format(const char* /*id*/, const char* fmt, ...) const throw() { // FIXME -- lookup message string using id as an index. set // fmt to that string if it exists. // format CString result; va_list args; va_start(args, fmt); try { result = CStringUtil::vformat(fmt, args); } catch (...) { // ignore } va_end(args); return result; } synergy-1.4.12-Source/src/lib/base/XBase.h0000600000175000017500000000721212021261364020130 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XBASE_H #define XBASE_H #include "CString.h" //! Exception base class /*! This is the base class of most exception types. */ class XBase { public: //! Use getWhat() as the result of what() XBase(); //! Use \c msg as the result of what() XBase(const CString& msg); virtual ~XBase(); //! Reason for exception virtual const char* what() const; protected: //! Get a human readable string describing the exception virtual CString getWhat() const throw() = 0; //! Format a string /*! Looks up a message format using \c id, using \c defaultFormat if no format can be found, then replaces positional parameters in the format string and returns the result. */ virtual CString format(const char* id, const char* defaultFormat, ...) const throw(); private: mutable CString m_what; }; /*! \def XBASE_SUBCLASS Convenience macro to subclass from XBase (or a subclass of it), providing the c'tor taking a const CString&. getWhat() is not declared. */ #define XBASE_SUBCLASS(name_, super_) \ class name_ : public super_ { \ public: \ name_() : super_() { } \ name_(const CString& msg) : super_(msg) { } \ } /*! \def XBASE_SUBCLASS Convenience macro to subclass from XBase (or a subclass of it), providing the c'tor taking a const CString&. getWhat() must be implemented. */ #define XBASE_SUBCLASS_WHAT(name_, super_) \ class name_ : public super_ { \ public: \ name_() : super_() { } \ name_(const CString& msg) : super_(msg) { } \ \ protected: \ virtual CString getWhat() const throw(); \ } /*! \def XBASE_SUBCLASS_FORMAT Convenience macro to subclass from XBase (or a subclass of it), providing the c'tor taking a const CString&. what() is overridden to call getWhat() when first called; getWhat() can format the error message and can call what() to get the message passed to the c'tor. */ #define XBASE_SUBCLASS_FORMAT(name_, super_) \ class name_ : public super_ { \ private: \ enum EState { kFirst, kFormat, kDone }; \ \ public: \ name_() : super_(), m_state(kDone) { } \ name_(const CString& msg) : super_(msg), m_state(kFirst) { } \ \ virtual const char* what() const \ { \ if (m_state == kFirst) { \ m_state = kFormat; \ m_formatted = getWhat(); \ m_state = kDone; \ } \ if (m_state == kDone) { \ return m_formatted.c_str(); \ } \ else { \ return super_::what(); \ } \ } \ \ protected: \ virtual CString getWhat() const throw(); \ \ private: \ mutable EState m_state; \ mutable std::string m_formatted; \ } #endif synergy-1.4.12-Source/src/lib/client/0000700000175000017500000000000012140644175017324 5ustar synergysynergysynergy-1.4.12-Source/src/lib/client/CClient.cpp0000600000175000017500000004233012140235162021345 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClient.h" #include "CServerProxy.h" #include "CScreen.h" #include "CClipboard.h" #include "CPacketStreamFilter.h" #include "CProtocolUtil.h" #include "ProtocolTypes.h" #include "XSynergy.h" #include "IDataSocket.h" #include "ISocketFactory.h" #include "IStreamFilterFactory.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include #include #include "CArch.h" #include "IPlatformScreen.h" #include "CCryptoStream.h" // // CClient // CEvent::Type CClient::s_connectedEvent = CEvent::kUnknown; CEvent::Type CClient::s_connectionFailedEvent = CEvent::kUnknown; CEvent::Type CClient::s_disconnectedEvent = CEvent::kUnknown; CClient::CClient(IEventQueue* eventQueue, const CString& name, const CNetworkAddress& address, ISocketFactory* socketFactory, IStreamFilterFactory* streamFilterFactory, CScreen* screen, const CCryptoOptions& crypto) : m_mock(false), m_name(name), m_serverAddress(address), m_socketFactory(socketFactory), m_streamFilterFactory(streamFilterFactory), m_screen(screen), m_stream(NULL), m_timer(NULL), m_server(NULL), m_ready(false), m_active(false), m_suspended(false), m_connectOnResume(false), m_eventQueue(eventQueue), m_cryptoStream(NULL), m_crypto(crypto) { assert(m_socketFactory != NULL); assert(m_screen != NULL); // register suspend/resume event handlers m_eventQueue->adoptHandler(IScreen::getSuspendEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleSuspend)); m_eventQueue->adoptHandler(IScreen::getResumeEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleResume)); m_eventQueue->adoptHandler(IPlatformScreen::getGameDeviceTimingRespEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleGameDeviceTimingResp)); m_eventQueue->adoptHandler(IPlatformScreen::getGameDeviceFeedbackEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleGameDeviceFeedback)); } CClient::~CClient() { if (m_mock) { return; } m_eventQueue->removeHandler(IScreen::getSuspendEvent(), getEventTarget()); m_eventQueue->removeHandler(IScreen::getResumeEvent(), getEventTarget()); cleanupTimer(); cleanupScreen(); cleanupConnecting(); cleanupConnection(); delete m_socketFactory; delete m_streamFilterFactory; } void CClient::connect() { if (m_stream != NULL) { return; } if (m_suspended) { m_connectOnResume = true; return; } try { // resolve the server hostname. do this every time we connect // in case we couldn't resolve the address earlier or the address // has changed (which can happen frequently if this is a laptop // being shuttled between various networks). patch by Brent // Priddy. m_serverAddress.resolve(); // m_serverAddress will be null if the hostname address is not reolved if (m_serverAddress.getAddress() != NULL) { // to help users troubleshoot, show server host name (issue: 60) LOG((CLOG_NOTE "connecting to '%s': %s:%i", m_serverAddress.getHostname().c_str(), ARCH->addrToString(m_serverAddress.getAddress()).c_str(), m_serverAddress.getPort())); } // create the socket IDataSocket* socket = m_socketFactory->create(); // filter socket messages, including a packetizing filter m_stream = socket; if (m_streamFilterFactory != NULL) { m_stream = m_streamFilterFactory->create(m_stream, true); } m_stream = new CPacketStreamFilter(m_stream, true); if (m_crypto.m_mode != kDisabled) { m_cryptoStream = new CCryptoStream( EVENTQUEUE, m_stream, m_crypto, true); m_stream = m_cryptoStream; } // connect LOG((CLOG_DEBUG1 "connecting to server")); setupConnecting(); setupTimer(); socket->connect(m_serverAddress); } catch (XBase& e) { cleanupTimer(); cleanupConnecting(); delete m_stream; m_stream = NULL; LOG((CLOG_DEBUG1 "connection failed")); sendConnectionFailedEvent(e.what()); return; } } void CClient::disconnect(const char* msg) { m_connectOnResume = false; cleanupTimer(); cleanupScreen(); cleanupConnecting(); cleanupConnection(); if (msg != NULL) { sendConnectionFailedEvent(msg); } else { sendEvent(getDisconnectedEvent(), NULL); } } void CClient::handshakeComplete() { m_ready = true; m_screen->enable(); sendEvent(getConnectedEvent(), NULL); } void CClient::setDecryptIv(const UInt8* iv) { if (m_cryptoStream != NULL) { m_cryptoStream->setDecryptIv(iv); } } bool CClient::isConnected() const { return (m_server != NULL); } bool CClient::isConnecting() const { return (m_timer != NULL); } CNetworkAddress CClient::getServerAddress() const { return m_serverAddress; } CEvent::Type CClient::getConnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_connectedEvent, "CClient::connected"); } CEvent::Type CClient::getConnectionFailedEvent() { return EVENTQUEUE->registerTypeOnce(s_connectionFailedEvent, "CClient::failed"); } CEvent::Type CClient::getDisconnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_disconnectedEvent, "CClient::disconnected"); } void* CClient::getEventTarget() const { return m_screen->getEventTarget(); } bool CClient::getClipboard(ClipboardID id, IClipboard* clipboard) const { return m_screen->getClipboard(id, clipboard); } void CClient::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { m_screen->getShape(x, y, w, h); } void CClient::getCursorPos(SInt32& x, SInt32& y) const { m_screen->getCursorPos(x, y); } void CClient::enter(SInt32 xAbs, SInt32 yAbs, UInt32, KeyModifierMask mask, bool) { m_active = true; m_screen->mouseMove(xAbs, yAbs); m_screen->enter(mask); } bool CClient::leave() { m_screen->leave(); m_active = false; // send clipboards that we own and that have changed for (ClipboardID id = 0; id < kClipboardEnd; ++id) { if (m_ownClipboard[id]) { sendClipboard(id); } } return true; } void CClient::setClipboard(ClipboardID id, const IClipboard* clipboard) { m_screen->setClipboard(id, clipboard); m_ownClipboard[id] = false; m_sentClipboard[id] = false; } void CClient::grabClipboard(ClipboardID id) { m_screen->grabClipboard(id); m_ownClipboard[id] = false; m_sentClipboard[id] = false; } void CClient::setClipboardDirty(ClipboardID, bool) { assert(0 && "shouldn't be called"); } void CClient::keyDown(KeyID id, KeyModifierMask mask, KeyButton button) { m_screen->keyDown(id, mask, button); } void CClient::keyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { m_screen->keyRepeat(id, mask, count, button); } void CClient::keyUp(KeyID id, KeyModifierMask mask, KeyButton button) { m_screen->keyUp(id, mask, button); } void CClient::mouseDown(ButtonID id) { m_screen->mouseDown(id); } void CClient::mouseUp(ButtonID id) { m_screen->mouseUp(id); } void CClient::mouseMove(SInt32 x, SInt32 y) { m_screen->mouseMove(x, y); } void CClient::mouseRelativeMove(SInt32 dx, SInt32 dy) { m_screen->mouseRelativeMove(dx, dy); } void CClient::mouseWheel(SInt32 xDelta, SInt32 yDelta) { m_screen->mouseWheel(xDelta, yDelta); } void CClient::screensaver(bool activate) { m_screen->screensaver(activate); } void CClient::resetOptions() { m_screen->resetOptions(); } void CClient::setOptions(const COptionsList& options) { m_screen->setOptions(options); } void CClient::gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) { m_screen->gameDeviceButtons(id, buttons); } void CClient::gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) { m_screen->gameDeviceSticks(id, x1, y1, x2, y2); } void CClient::gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) { m_screen->gameDeviceTriggers(id, t1, t2); } void CClient::gameDeviceTimingReq() { m_screen->gameDeviceTimingReq(); } CString CClient::getName() const { return m_name; } void CClient::sendClipboard(ClipboardID id) { // note -- m_mutex must be locked on entry assert(m_screen != NULL); assert(m_server != NULL); // get clipboard data. set the clipboard time to the last // clipboard time before getting the data from the screen // as the screen may detect an unchanged clipboard and // avoid copying the data. CClipboard clipboard; if (clipboard.open(m_timeClipboard[id])) { clipboard.close(); } m_screen->getClipboard(id, &clipboard); // check time if (m_timeClipboard[id] == 0 || clipboard.getTime() != m_timeClipboard[id]) { // save new time m_timeClipboard[id] = clipboard.getTime(); // marshall the data CString data = clipboard.marshall(); // save and send data if different or not yet sent if (!m_sentClipboard[id] || data != m_dataClipboard[id]) { m_sentClipboard[id] = true; m_dataClipboard[id] = data; m_server->onClipboardChanged(id, &clipboard); } } } void CClient::sendEvent(CEvent::Type type, void* data) { m_eventQueue->addEvent(CEvent(type, getEventTarget(), data)); } void CClient::sendConnectionFailedEvent(const char* msg) { CFailInfo* info = new CFailInfo(msg); info->m_retry = true; CEvent event(getConnectionFailedEvent(), getEventTarget(), info, CEvent::kDontFreeData); m_eventQueue->addEvent(event); } void CClient::setupConnecting() { assert(m_stream != NULL); m_eventQueue->adoptHandler(IDataSocket::getConnectedEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleConnected)); m_eventQueue->adoptHandler(IDataSocket::getConnectionFailedEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleConnectionFailed)); } void CClient::setupConnection() { assert(m_stream != NULL); m_eventQueue->adoptHandler(ISocket::getDisconnectedEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleDisconnected)); m_eventQueue->adoptHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleHello)); m_eventQueue->adoptHandler(m_stream->getOutputErrorEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleOutputError)); m_eventQueue->adoptHandler(m_stream->getInputShutdownEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleDisconnected)); m_eventQueue->adoptHandler(m_stream->getOutputShutdownEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClient::handleDisconnected)); } void CClient::setupScreen() { assert(m_server == NULL); m_ready = false; m_server = new CServerProxy(this, m_stream, m_eventQueue); m_eventQueue->adoptHandler(IScreen::getShapeChangedEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleShapeChanged)); m_eventQueue->adoptHandler(IScreen::getClipboardGrabbedEvent(), getEventTarget(), new TMethodEventJob(this, &CClient::handleClipboardGrabbed)); } void CClient::setupTimer() { assert(m_timer == NULL); m_timer = m_eventQueue->newOneShotTimer(15.0, NULL); m_eventQueue->adoptHandler(CEvent::kTimer, m_timer, new TMethodEventJob(this, &CClient::handleConnectTimeout)); } void CClient::cleanupConnecting() { if (m_stream != NULL) { m_eventQueue->removeHandler(IDataSocket::getConnectedEvent(), m_stream->getEventTarget()); m_eventQueue->removeHandler(IDataSocket::getConnectionFailedEvent(), m_stream->getEventTarget()); } } void CClient::cleanupConnection() { if (m_stream != NULL) { m_eventQueue->removeHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget()); m_eventQueue->removeHandler(m_stream->getOutputErrorEvent(), m_stream->getEventTarget()); m_eventQueue->removeHandler(m_stream->getInputShutdownEvent(), m_stream->getEventTarget()); m_eventQueue->removeHandler(m_stream->getOutputShutdownEvent(), m_stream->getEventTarget()); m_eventQueue->removeHandler(ISocket::getDisconnectedEvent(), m_stream->getEventTarget()); delete m_stream; m_stream = NULL; } } void CClient::cleanupScreen() { if (m_server != NULL) { if (m_ready) { m_screen->disable(); m_ready = false; } m_eventQueue->removeHandler(IScreen::getShapeChangedEvent(), getEventTarget()); m_eventQueue->removeHandler(IScreen::getClipboardGrabbedEvent(), getEventTarget()); delete m_server; m_server = NULL; } } void CClient::cleanupTimer() { if (m_timer != NULL) { m_eventQueue->removeHandler(CEvent::kTimer, m_timer); m_eventQueue->deleteTimer(m_timer); m_timer = NULL; } } void CClient::handleConnected(const CEvent&, void*) { LOG((CLOG_DEBUG1 "connected; wait for hello")); cleanupConnecting(); setupConnection(); // reset clipboard state for (ClipboardID id = 0; id < kClipboardEnd; ++id) { m_ownClipboard[id] = false; m_sentClipboard[id] = false; m_timeClipboard[id] = 0; } } void CClient::handleConnectionFailed(const CEvent& event, void*) { IDataSocket::CConnectionFailedInfo* info = reinterpret_cast(event.getData()); cleanupTimer(); cleanupConnecting(); delete m_stream; m_stream = NULL; LOG((CLOG_DEBUG1 "connection failed")); sendConnectionFailedEvent(info->m_what.c_str()); delete info; } void CClient::handleConnectTimeout(const CEvent&, void*) { cleanupTimer(); cleanupConnecting(); cleanupConnection(); delete m_stream; m_stream = NULL; LOG((CLOG_DEBUG1 "connection timed out")); sendConnectionFailedEvent("Timed out"); } void CClient::handleOutputError(const CEvent&, void*) { cleanupTimer(); cleanupScreen(); cleanupConnection(); LOG((CLOG_WARN "error sending to server")); sendEvent(getDisconnectedEvent(), NULL); } void CClient::handleDisconnected(const CEvent&, void*) { cleanupTimer(); cleanupScreen(); cleanupConnection(); LOG((CLOG_DEBUG1 "disconnected")); sendEvent(getDisconnectedEvent(), NULL); } void CClient::handleShapeChanged(const CEvent&, void*) { LOG((CLOG_DEBUG "resolution changed")); m_server->onInfoChanged(); } void CClient::handleClipboardGrabbed(const CEvent& event, void*) { const IScreen::CClipboardInfo* info = reinterpret_cast(event.getData()); // grab ownership m_server->onGrabClipboard(info->m_id); // we now own the clipboard and it has not been sent to the server m_ownClipboard[info->m_id] = true; m_sentClipboard[info->m_id] = false; m_timeClipboard[info->m_id] = 0; // if we're not the active screen then send the clipboard now, // otherwise we'll wait until we leave. if (!m_active) { sendClipboard(info->m_id); } } void CClient::handleHello(const CEvent&, void*) { SInt16 major, minor; if (!CProtocolUtil::readf(m_stream, kMsgHello, &major, &minor)) { sendConnectionFailedEvent("Protocol error from server"); cleanupTimer(); cleanupConnection(); return; } // check versions LOG((CLOG_DEBUG1 "got hello version %d.%d", major, minor)); if (major < kProtocolMajorVersion || (major == kProtocolMajorVersion && minor < kProtocolMinorVersion)) { sendConnectionFailedEvent(XIncompatibleClient(major, minor).what()); cleanupTimer(); cleanupConnection(); return; } // say hello back LOG((CLOG_DEBUG1 "say hello version %d.%d", kProtocolMajorVersion, kProtocolMinorVersion)); CProtocolUtil::writef(m_stream, kMsgHelloBack, kProtocolMajorVersion, kProtocolMinorVersion, &m_name); // now connected but waiting to complete handshake setupScreen(); cleanupTimer(); // make sure we process any remaining messages later. we won't // receive another event for already pending messages so we fake // one. if (m_stream->isReady()) { m_eventQueue->addEvent(CEvent(m_stream->getInputReadyEvent(), m_stream->getEventTarget())); } } void CClient::handleSuspend(const CEvent&, void*) { LOG((CLOG_INFO "suspend")); m_suspended = true; bool wasConnected = isConnected(); disconnect(NULL); m_connectOnResume = wasConnected; } void CClient::handleResume(const CEvent&, void*) { LOG((CLOG_INFO "resume")); m_suspended = false; if (m_connectOnResume) { m_connectOnResume = false; connect(); } } void CClient::handleGameDeviceTimingResp(const CEvent& event, void*) { IPlatformScreen::CGameDeviceTimingRespInfo* info = reinterpret_cast(event.getData()); m_server->onGameDeviceTimingResp(info->m_freq); } void CClient::handleGameDeviceFeedback(const CEvent& event, void*) { IPlatformScreen::CGameDeviceFeedbackInfo* info = reinterpret_cast(event.getData()); m_server->onGameDeviceFeedback(info->m_id, info->m_m1, info->m_m2); } synergy-1.4.12-Source/src/lib/client/CClient.h0000600000175000017500000001530312140235162021012 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENT_H #define CCLIENT_H #include "IClient.h" #include "IClipboard.h" #include "CNetworkAddress.h" #include "INode.h" #include "CCryptoOptions.h" class CEventQueueTimer; class CScreen; class CServerProxy; class IDataSocket; class ISocketFactory; namespace synergy { class IStream; } class IStreamFilterFactory; class IEventQueue; class CCryptoStream; //! Synergy client /*! This class implements the top-level client algorithms for synergy. */ class CClient : public IClient, public INode { public: class CFailInfo { public: CFailInfo(const char* what) : m_retry(false), m_what(what) { } bool m_retry; CString m_what; }; public: /*! This client will attempt to connect to the server using \p name as its name and \p address as the server's address and \p factory to create the socket. \p screen is the local screen. */ CClient(IEventQueue* eventQueue, const CString& name, const CNetworkAddress& address, ISocketFactory* socketFactory, IStreamFilterFactory* streamFilterFactory, CScreen* screen, const CCryptoOptions& crypto); ~CClient(); #ifdef TEST_ENV CClient() { } #endif //! @name manipulators //@{ //! Connect to server /*! Starts an attempt to connect to the server. This is ignored if the client is trying to connect or is already connected. */ void connect(); //! Disconnect /*! Disconnects from the server with an optional error message. */ void disconnect(const char* msg); //! Notify of handshake complete /*! Notifies the client that the connection handshake has completed. */ virtual void handshakeComplete(); //! Set crypto IV for decryption virtual void setDecryptIv(const UInt8* iv); //@} //! @name accessors //@{ //! Test if connected /*! Returns true iff the client is successfully connected to the server. */ bool isConnected() const; //! Test if connecting /*! Returns true iff the client is currently attempting to connect to the server. */ bool isConnecting() const; //! Get address of server /*! Returns the address of the server the client is connected (or wants to connect) to. */ CNetworkAddress getServerAddress() const; //! Get connected event type /*! Returns the connected event type. This is sent when the client has successfully connected to the server. */ static CEvent::Type getConnectedEvent(); //! Get connection failed event type /*! Returns the connection failed event type. This is sent when the server fails for some reason. The event data is a CFailInfo*. */ static CEvent::Type getConnectionFailedEvent(); //! Get disconnected event type /*! Returns the disconnected event type. This is sent when the client has disconnected from the server (and only after having successfully connected). */ static CEvent::Type getDisconnectedEvent(); //@} // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IClient overrides virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver); virtual bool leave(); virtual void setClipboard(ClipboardID, const IClipboard*); virtual void grabClipboard(ClipboardID); virtual void setClipboardDirty(ClipboardID, bool); virtual void keyDown(KeyID, KeyModifierMask, KeyButton); virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton); virtual void keyUp(KeyID, KeyModifierMask, KeyButton); virtual void mouseDown(ButtonID); virtual void mouseUp(ButtonID); virtual void mouseMove(SInt32 xAbs, SInt32 yAbs); virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel); virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); virtual void gameDeviceTimingReq(); virtual CString getName() const; private: void sendClipboard(ClipboardID); void sendEvent(CEvent::Type, void*); void sendConnectionFailedEvent(const char* msg); void setupConnecting(); void setupConnection(); void setupScreen(); void setupTimer(); void cleanupConnecting(); void cleanupConnection(); void cleanupScreen(); void cleanupTimer(); void handleConnected(const CEvent&, void*); void handleConnectionFailed(const CEvent&, void*); void handleConnectTimeout(const CEvent&, void*); void handleOutputError(const CEvent&, void*); void handleDisconnected(const CEvent&, void*); void handleShapeChanged(const CEvent&, void*); void handleClipboardGrabbed(const CEvent&, void*); void handleHello(const CEvent&, void*); void handleSuspend(const CEvent& event, void*); void handleResume(const CEvent& event, void*); void handleGameDeviceTimingResp(const CEvent& event, void*); void handleGameDeviceFeedback(const CEvent& event, void*); public: bool m_mock; private: CString m_name; CNetworkAddress m_serverAddress; ISocketFactory* m_socketFactory; IStreamFilterFactory* m_streamFilterFactory; CScreen* m_screen; synergy::IStream* m_stream; CEventQueueTimer* m_timer; CServerProxy* m_server; bool m_ready; bool m_active; bool m_suspended; bool m_connectOnResume; bool m_ownClipboard[kClipboardEnd]; bool m_sentClipboard[kClipboardEnd]; IClipboard::Time m_timeClipboard[kClipboardEnd]; CString m_dataClipboard[kClipboardEnd]; IEventQueue* m_eventQueue; CCryptoStream* m_cryptoStream; CCryptoOptions m_crypto; static CEvent::Type s_connectedEvent; static CEvent::Type s_connectionFailedEvent; static CEvent::Type s_disconnectedEvent; }; #endif synergy-1.4.12-Source/src/lib/client/CMakeLists.txt0000600000175000017500000000211112127576354022071 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CClient.h CServerProxy.h ) set(src CClient.cpp CServerProxy.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ../io ../mt ../net ../synergy ../../../tools ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(client STATIC ${src}) if (UNIX) target_link_libraries(client synergy io) endif() synergy-1.4.12-Source/src/lib/client/CServerProxy.cpp0000600000175000017500000005235412140235162022446 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CServerProxy.h" #include "CClient.h" #include "CClipboard.h" #include "CProtocolUtil.h" #include "OptionTypes.h" #include "ProtocolTypes.h" #include "IStream.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "XBase.h" #include #include #include "CCryptoStream.h" // // CServerProxy // CServerProxy::CServerProxy(CClient* client, synergy::IStream* stream, IEventQueue* eventQueue) : m_client(client), m_stream(stream), m_seqNum(0), m_compressMouse(false), m_compressMouseRelative(false), m_xMouse(0), m_yMouse(0), m_dxMouse(0), m_dyMouse(0), m_ignoreMouse(false), m_keepAliveAlarm(0.0), m_keepAliveAlarmTimer(NULL), m_parser(&CServerProxy::parseHandshakeMessage), m_eventQueue(eventQueue) { assert(m_client != NULL); assert(m_stream != NULL); // initialize modifier translation table for (KeyModifierID id = 0; id < kKeyModifierIDLast; ++id) m_modifierTranslationTable[id] = id; // handle data on stream m_eventQueue->adoptHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CServerProxy::handleData)); // send heartbeat setKeepAliveRate(kKeepAliveRate); } CServerProxy::~CServerProxy() { setKeepAliveRate(-1.0); m_eventQueue->removeHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget()); } void CServerProxy::resetKeepAliveAlarm() { if (m_keepAliveAlarmTimer != NULL) { m_eventQueue->removeHandler(CEvent::kTimer, m_keepAliveAlarmTimer); m_eventQueue->deleteTimer(m_keepAliveAlarmTimer); m_keepAliveAlarmTimer = NULL; } if (m_keepAliveAlarm > 0.0) { m_keepAliveAlarmTimer = m_eventQueue->newOneShotTimer(m_keepAliveAlarm, NULL); m_eventQueue->adoptHandler(CEvent::kTimer, m_keepAliveAlarmTimer, new TMethodEventJob(this, &CServerProxy::handleKeepAliveAlarm)); } } void CServerProxy::setKeepAliveRate(double rate) { m_keepAliveAlarm = rate * kKeepAlivesUntilDeath; resetKeepAliveAlarm(); } void CServerProxy::handleData(const CEvent&, void*) { // handle messages until there are no more. first read message code. UInt8 code[4]; UInt32 n = m_stream->read(code, 4); while (n != 0) { // verify we got an entire code if (n != 4) { LOG((CLOG_ERR "incomplete message from server: %d bytes", n)); m_client->disconnect("incomplete message from server"); return; } // parse message LOG((CLOG_DEBUG2 "msg from server: %c%c%c%c", code[0], code[1], code[2], code[3])); switch ((this->*m_parser)(code)) { case kOkay: break; case kUnknown: LOG((CLOG_ERR "invalid message from server: %c%c%c%c", code[0], code[1], code[2], code[3])); m_client->disconnect("invalid message from server"); return; case kDisconnect: return; } // next message n = m_stream->read(code, 4); } flushCompressedMouse(); } CServerProxy::EResult CServerProxy::parseHandshakeMessage(const UInt8* code) { if (memcmp(code, kMsgQInfo, 4) == 0) { queryInfo(); } else if (memcmp(code, kMsgCInfoAck, 4) == 0) { infoAcknowledgment(); } else if (memcmp(code, kMsgDSetOptions, 4) == 0) { setOptions(); // handshake is complete m_parser = &CServerProxy::parseMessage; m_client->handshakeComplete(); } else if (memcmp(code, kMsgCResetOptions, 4) == 0) { resetOptions(); } else if (memcmp(code, kMsgCKeepAlive, 4) == 0) { // echo keep alives and reset alarm CProtocolUtil::writef(m_stream, kMsgCKeepAlive); resetKeepAliveAlarm(); } else if (memcmp(code, kMsgCNoop, 4) == 0) { // accept and discard no-op } else if (memcmp(code, kMsgCClose, 4) == 0) { // server wants us to hangup LOG((CLOG_DEBUG1 "recv close")); m_client->disconnect(NULL); return kDisconnect; } else if (memcmp(code, kMsgEIncompatible, 4) == 0) { SInt32 major, minor; CProtocolUtil::readf(m_stream, kMsgEIncompatible + 4, &major, &minor); LOG((CLOG_ERR "server has incompatible version %d.%d", major, minor)); m_client->disconnect("server has incompatible version"); return kDisconnect; } else if (memcmp(code, kMsgEBusy, 4) == 0) { LOG((CLOG_ERR "server already has a connected client with name \"%s\"", m_client->getName().c_str())); m_client->disconnect("server already has a connected client with our name"); return kDisconnect; } else if (memcmp(code, kMsgEUnknown, 4) == 0) { LOG((CLOG_ERR "server refused client with name \"%s\"", m_client->getName().c_str())); m_client->disconnect("server refused client with our name"); return kDisconnect; } else if (memcmp(code, kMsgEBad, 4) == 0) { LOG((CLOG_ERR "server disconnected due to a protocol error")); m_client->disconnect("server reported a protocol error"); return kDisconnect; } else { return kUnknown; } return kOkay; } CServerProxy::EResult CServerProxy::parseMessage(const UInt8* code) { if (memcmp(code, kMsgDMouseMove, 4) == 0) { mouseMove(); } else if (memcmp(code, kMsgDMouseRelMove, 4) == 0) { mouseRelativeMove(); } else if (memcmp(code, kMsgDMouseWheel, 4) == 0) { mouseWheel(); } else if (memcmp(code, kMsgDKeyDown, 4) == 0) { keyDown(); } else if (memcmp(code, kMsgDKeyUp, 4) == 0) { keyUp(); } else if (memcmp(code, kMsgDMouseDown, 4) == 0) { mouseDown(); } else if (memcmp(code, kMsgDMouseUp, 4) == 0) { mouseUp(); } else if (memcmp(code, kMsgDKeyRepeat, 4) == 0) { keyRepeat(); } else if (memcmp(code, kMsgCKeepAlive, 4) == 0) { // echo keep alives and reset alarm CProtocolUtil::writef(m_stream, kMsgCKeepAlive); resetKeepAliveAlarm(); } else if (memcmp(code, kMsgCNoop, 4) == 0) { // accept and discard no-op } else if (memcmp(code, kMsgCEnter, 4) == 0) { enter(); } else if (memcmp(code, kMsgCLeave, 4) == 0) { leave(); } else if (memcmp(code, kMsgCClipboard, 4) == 0) { grabClipboard(); } else if (memcmp(code, kMsgCScreenSaver, 4) == 0) { screensaver(); } else if (memcmp(code, kMsgQInfo, 4) == 0) { queryInfo(); } else if (memcmp(code, kMsgCInfoAck, 4) == 0) { infoAcknowledgment(); } else if (memcmp(code, kMsgDClipboard, 4) == 0) { setClipboard(); } else if (memcmp(code, kMsgCResetOptions, 4) == 0) { resetOptions(); } else if (memcmp(code, kMsgDSetOptions, 4) == 0) { setOptions(); } else if (memcmp(code, kMsgDGameButtons, 4) == 0) { gameDeviceButtons(); } else if (memcmp(code, kMsgDGameSticks, 4) == 0) { gameDeviceSticks(); } else if (memcmp(code, kMsgDGameTriggers, 4) == 0) { gameDeviceTriggers(); } else if (memcmp(code, kMsgCGameTimingReq, 4) == 0) { gameDeviceTimingReq(); } else if (memcmp(code, kMsgDCryptoIv, 4) == 0) { cryptoIv(); } else if (memcmp(code, kMsgCClose, 4) == 0) { // server wants us to hangup LOG((CLOG_DEBUG1 "recv close")); m_client->disconnect(NULL); return kDisconnect; } else if (memcmp(code, kMsgEBad, 4) == 0) { LOG((CLOG_ERR "server disconnected due to a protocol error")); m_client->disconnect("server reported a protocol error"); return kDisconnect; } else { return kUnknown; } // send a reply. this is intended to work around a delay when // running a linux server and an OS X (any BSD?) client. the // client waits to send an ACK (if the system control flag // net.inet.tcp.delayed_ack is 1) in hopes of piggybacking it // on a data packet. we provide that packet here. i don't // know why a delayed ACK should cause the server to wait since // TCP_NODELAY is enabled. CProtocolUtil::writef(m_stream, kMsgCNoop); return kOkay; } void CServerProxy::handleKeepAliveAlarm(const CEvent&, void*) { LOG((CLOG_NOTE "server is dead")); m_client->disconnect("server is not responding"); } void CServerProxy::onInfoChanged() { // ignore mouse motion until we receive acknowledgment of our info // change message. m_ignoreMouse = true; // send info update queryInfo(); } bool CServerProxy::onGrabClipboard(ClipboardID id) { LOG((CLOG_DEBUG1 "sending clipboard %d changed", id)); CProtocolUtil::writef(m_stream, kMsgCClipboard, id, m_seqNum); return true; } void CServerProxy::onClipboardChanged(ClipboardID id, const IClipboard* clipboard) { CString data = IClipboard::marshall(clipboard); LOG((CLOG_DEBUG1 "sending clipboard %d seqnum=%d, size=%d", id, m_seqNum, data.size())); CProtocolUtil::writef(m_stream, kMsgDClipboard, id, m_seqNum, &data); } void CServerProxy::onGameDeviceTimingResp(UInt16 freq) { LOG((CLOG_DEBUG1 "sending game device timing response freq=%d", freq)); CProtocolUtil::writef(m_stream, kMsgCGameTimingResp, freq); } void CServerProxy::onGameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { LOG((CLOG_DEBUG1 "sending game device feedback id=%d, m1=%d, m2=%d", id, m1, m2)); CProtocolUtil::writef(m_stream, kMsgDGameFeedback, id, m1, m2); } void CServerProxy::flushCompressedMouse() { if (m_compressMouse) { m_compressMouse = false; m_client->mouseMove(m_xMouse, m_yMouse); } if (m_compressMouseRelative) { m_compressMouseRelative = false; m_client->mouseRelativeMove(m_dxMouse, m_dyMouse); m_dxMouse = 0; m_dyMouse = 0; } } void CServerProxy::sendInfo(const CClientInfo& info) { LOG((CLOG_DEBUG1 "sending info shape=%d,%d %dx%d", info.m_x, info.m_y, info.m_w, info.m_h)); CProtocolUtil::writef(m_stream, kMsgDInfo, info.m_x, info.m_y, info.m_w, info.m_h, 0, info.m_mx, info.m_my); } KeyID CServerProxy::translateKey(KeyID id) const { static const KeyID s_translationTable[kKeyModifierIDLast][2] = { { kKeyNone, kKeyNone }, { kKeyShift_L, kKeyShift_R }, { kKeyControl_L, kKeyControl_R }, { kKeyAlt_L, kKeyAlt_R }, { kKeyMeta_L, kKeyMeta_R }, { kKeySuper_L, kKeySuper_R }, { kKeyAltGr, kKeyAltGr} }; KeyModifierID id2 = kKeyModifierIDNull; UInt32 side = 0; switch (id) { case kKeyShift_L: id2 = kKeyModifierIDShift; side = 0; break; case kKeyShift_R: id2 = kKeyModifierIDShift; side = 1; break; case kKeyControl_L: id2 = kKeyModifierIDControl; side = 0; break; case kKeyControl_R: id2 = kKeyModifierIDControl; side = 1; break; case kKeyAlt_L: id2 = kKeyModifierIDAlt; side = 0; break; case kKeyAlt_R: id2 = kKeyModifierIDAlt; side = 1; break; case kKeyAltGr: id2 = kKeyModifierIDAltGr; side = 1; // there is only one alt gr key on the right side break; case kKeyMeta_L: id2 = kKeyModifierIDMeta; side = 0; break; case kKeyMeta_R: id2 = kKeyModifierIDMeta; side = 1; break; case kKeySuper_L: id2 = kKeyModifierIDSuper; side = 0; break; case kKeySuper_R: id2 = kKeyModifierIDSuper; side = 1; break; } if (id2 != kKeyModifierIDNull) { return s_translationTable[m_modifierTranslationTable[id2]][side]; } else { return id; } } KeyModifierMask CServerProxy::translateModifierMask(KeyModifierMask mask) const { static const KeyModifierMask s_masks[kKeyModifierIDLast] = { 0x0000, KeyModifierShift, KeyModifierControl, KeyModifierAlt, KeyModifierMeta, KeyModifierSuper, KeyModifierAltGr }; KeyModifierMask newMask = mask & ~(KeyModifierShift | KeyModifierControl | KeyModifierAlt | KeyModifierMeta | KeyModifierSuper | KeyModifierAltGr ); if ((mask & KeyModifierShift) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDShift]]; } if ((mask & KeyModifierControl) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDControl]]; } if ((mask & KeyModifierAlt) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDAlt]]; } if ((mask & KeyModifierAltGr) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDAltGr]]; } if ((mask & KeyModifierMeta) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDMeta]]; } if ((mask & KeyModifierSuper) != 0) { newMask |= s_masks[m_modifierTranslationTable[kKeyModifierIDSuper]]; } return newMask; } void CServerProxy::enter() { // parse SInt16 x, y; UInt16 mask; UInt32 seqNum; CProtocolUtil::readf(m_stream, kMsgCEnter + 4, &x, &y, &seqNum, &mask); LOG((CLOG_DEBUG1 "recv enter, %d,%d %d %04x", x, y, seqNum, mask)); // discard old compressed mouse motion, if any m_compressMouse = false; m_compressMouseRelative = false; m_dxMouse = 0; m_dyMouse = 0; m_seqNum = seqNum; // forward m_client->enter(x, y, seqNum, static_cast(mask), false); } void CServerProxy::leave() { // parse LOG((CLOG_DEBUG1 "recv leave")); // send last mouse motion flushCompressedMouse(); // forward m_client->leave(); } void CServerProxy::setClipboard() { // parse ClipboardID id; UInt32 seqNum; CString data; CProtocolUtil::readf(m_stream, kMsgDClipboard + 4, &id, &seqNum, &data); LOG((CLOG_DEBUG "recv clipboard %d size=%d", id, data.size())); // validate if (id >= kClipboardEnd) { return; } // forward CClipboard clipboard; clipboard.unmarshall(data, 0); m_client->setClipboard(id, &clipboard); } void CServerProxy::grabClipboard() { // parse ClipboardID id; UInt32 seqNum; CProtocolUtil::readf(m_stream, kMsgCClipboard + 4, &id, &seqNum); LOG((CLOG_DEBUG "recv grab clipboard %d", id)); // validate if (id >= kClipboardEnd) { return; } // forward m_client->grabClipboard(id); } void CServerProxy::keyDown() { // get mouse up to date flushCompressedMouse(); // parse UInt16 id, mask, button; CProtocolUtil::readf(m_stream, kMsgDKeyDown + 4, &id, &mask, &button); LOG((CLOG_DEBUG1 "recv key down id=0x%08x, mask=0x%04x, button=0x%04x", id, mask, button)); // translate KeyID id2 = translateKey(static_cast(id)); KeyModifierMask mask2 = translateModifierMask( static_cast(mask)); if (id2 != static_cast(id) || mask2 != static_cast(mask)) LOG((CLOG_DEBUG1 "key down translated to id=0x%08x, mask=0x%04x", id2, mask2)); // forward m_client->keyDown(id2, mask2, button); } void CServerProxy::keyRepeat() { // get mouse up to date flushCompressedMouse(); // parse UInt16 id, mask, count, button; CProtocolUtil::readf(m_stream, kMsgDKeyRepeat + 4, &id, &mask, &count, &button); LOG((CLOG_DEBUG1 "recv key repeat id=0x%08x, mask=0x%04x, count=%d, button=0x%04x", id, mask, count, button)); // translate KeyID id2 = translateKey(static_cast(id)); KeyModifierMask mask2 = translateModifierMask( static_cast(mask)); if (id2 != static_cast(id) || mask2 != static_cast(mask)) LOG((CLOG_DEBUG1 "key repeat translated to id=0x%08x, mask=0x%04x", id2, mask2)); // forward m_client->keyRepeat(id2, mask2, count, button); } void CServerProxy::keyUp() { // get mouse up to date flushCompressedMouse(); // parse UInt16 id, mask, button; CProtocolUtil::readf(m_stream, kMsgDKeyUp + 4, &id, &mask, &button); LOG((CLOG_DEBUG1 "recv key up id=0x%08x, mask=0x%04x, button=0x%04x", id, mask, button)); // translate KeyID id2 = translateKey(static_cast(id)); KeyModifierMask mask2 = translateModifierMask( static_cast(mask)); if (id2 != static_cast(id) || mask2 != static_cast(mask)) LOG((CLOG_DEBUG1 "key up translated to id=0x%08x, mask=0x%04x", id2, mask2)); // forward m_client->keyUp(id2, mask2, button); } void CServerProxy::mouseDown() { // get mouse up to date flushCompressedMouse(); // parse SInt8 id; CProtocolUtil::readf(m_stream, kMsgDMouseDown + 4, &id); LOG((CLOG_DEBUG1 "recv mouse down id=%d", id)); // forward m_client->mouseDown(static_cast(id)); } void CServerProxy::mouseUp() { // get mouse up to date flushCompressedMouse(); // parse SInt8 id; CProtocolUtil::readf(m_stream, kMsgDMouseUp + 4, &id); LOG((CLOG_DEBUG1 "recv mouse up id=%d", id)); // forward m_client->mouseUp(static_cast(id)); } void CServerProxy::mouseMove() { // parse bool ignore; SInt16 x, y; CProtocolUtil::readf(m_stream, kMsgDMouseMove + 4, &x, &y); // note if we should ignore the move ignore = m_ignoreMouse; // compress mouse motion events if more input follows if (!ignore && !m_compressMouse && m_stream->isReady()) { m_compressMouse = true; } // if compressing then ignore the motion but record it if (m_compressMouse) { m_compressMouseRelative = false; ignore = true; m_xMouse = x; m_yMouse = y; m_dxMouse = 0; m_dyMouse = 0; } LOG((CLOG_DEBUG2 "recv mouse move %d,%d", x, y)); // forward if (!ignore) { m_client->mouseMove(x, y); } } void CServerProxy::mouseRelativeMove() { // parse bool ignore; SInt16 dx, dy; CProtocolUtil::readf(m_stream, kMsgDMouseRelMove + 4, &dx, &dy); // note if we should ignore the move ignore = m_ignoreMouse; // compress mouse motion events if more input follows if (!ignore && !m_compressMouseRelative && m_stream->isReady()) { m_compressMouseRelative = true; } // if compressing then ignore the motion but record it if (m_compressMouseRelative) { ignore = true; m_dxMouse += dx; m_dyMouse += dy; } LOG((CLOG_DEBUG2 "recv mouse relative move %d,%d", dx, dy)); // forward if (!ignore) { m_client->mouseRelativeMove(dx, dy); } } void CServerProxy::mouseWheel() { // get mouse up to date flushCompressedMouse(); // parse SInt16 xDelta, yDelta; CProtocolUtil::readf(m_stream, kMsgDMouseWheel + 4, &xDelta, &yDelta); LOG((CLOG_DEBUG2 "recv mouse wheel %+d,%+d", xDelta, yDelta)); // forward m_client->mouseWheel(xDelta, yDelta); } void CServerProxy::gameDeviceButtons() { // parse GameDeviceID id; GameDeviceButton buttons; CProtocolUtil::readf(m_stream, kMsgDGameButtons + 4, &id, &buttons); LOG((CLOG_DEBUG2 "recv game device id=%d buttons=%d", id, buttons)); // forward m_client->gameDeviceButtons(id, buttons); } void CServerProxy::gameDeviceSticks() { // parse GameDeviceID id; SInt16 x1, y1, x2, y2; CProtocolUtil::readf(m_stream, kMsgDGameSticks + 4, &id, &x1, &y1, &x2, &y2); LOG((CLOG_DEBUG2 "recv game device sticks id=%d s1=%+d,%+d s2=%+d,%+d", id, x1, y1, x2, y2)); // forward m_client->gameDeviceSticks(id, x1, y1, x2, y2); } void CServerProxy::gameDeviceTriggers() { // parse GameDeviceID id; UInt8 t1, t2; CProtocolUtil::readf(m_stream, kMsgDGameTriggers + 4, &id, &t1, &t2); LOG((CLOG_DEBUG2 "recv game device triggers id=%d t1=%d t2=%d", id, t1, t2)); // forward m_client->gameDeviceTriggers(id, t1, t2); } void CServerProxy::gameDeviceTimingReq() { // parse LOG((CLOG_DEBUG2 "recv game device timing request")); // forward m_client->gameDeviceTimingReq(); } void CServerProxy::cryptoIv() { // parse CString s; CProtocolUtil::readf(m_stream, kMsgDCryptoIv + 4, &s); LOG((CLOG_DEBUG2 "recv crypto iv size=%i", s.size())); // forward m_client->setDecryptIv(reinterpret_cast(s.c_str())); } void CServerProxy::screensaver() { // parse SInt8 on; CProtocolUtil::readf(m_stream, kMsgCScreenSaver + 4, &on); LOG((CLOG_DEBUG1 "recv screen saver on=%d", on)); // forward m_client->screensaver(on != 0); } void CServerProxy::resetOptions() { // parse LOG((CLOG_DEBUG1 "recv reset options")); // forward m_client->resetOptions(); // reset keep alive setKeepAliveRate(kKeepAliveRate); // reset modifier translation table for (KeyModifierID id = 0; id < kKeyModifierIDLast; ++id) { m_modifierTranslationTable[id] = id; } } void CServerProxy::setOptions() { // parse COptionsList options; CProtocolUtil::readf(m_stream, kMsgDSetOptions + 4, &options); LOG((CLOG_DEBUG1 "recv set options size=%d", options.size())); // forward m_client->setOptions(options); // update modifier table for (UInt32 i = 0, n = (UInt32)options.size(); i < n; i += 2) { KeyModifierID id = kKeyModifierIDNull; if (options[i] == kOptionModifierMapForShift) { id = kKeyModifierIDShift; } else if (options[i] == kOptionModifierMapForControl) { id = kKeyModifierIDControl; } else if (options[i] == kOptionModifierMapForAlt) { id = kKeyModifierIDAlt; } else if (options[i] == kOptionModifierMapForAltGr) { id = kKeyModifierIDAltGr; } else if (options[i] == kOptionModifierMapForMeta) { id = kKeyModifierIDMeta; } else if (options[i] == kOptionModifierMapForSuper) { id = kKeyModifierIDSuper; } else if (options[i] == kOptionHeartbeat) { // update keep alive setKeepAliveRate(1.0e-3 * static_cast(options[i + 1])); } if (id != kKeyModifierIDNull) { m_modifierTranslationTable[id] = static_cast(options[i + 1]); LOG((CLOG_DEBUG1 "modifier %d mapped to %d", id, m_modifierTranslationTable[id])); } } } void CServerProxy::queryInfo() { CClientInfo info; m_client->getShape(info.m_x, info.m_y, info.m_w, info.m_h); m_client->getCursorPos(info.m_mx, info.m_my); sendInfo(info); } void CServerProxy::infoAcknowledgment() { LOG((CLOG_DEBUG1 "recv info acknowledgment")); m_ignoreMouse = false; } synergy-1.4.12-Source/src/lib/client/CServerProxy.h0000600000175000017500000000656012131402061022103 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSERVERPROXY_H #define CSERVERPROXY_H #include "ClipboardTypes.h" #include "KeyTypes.h" #include "CEvent.h" #include "GameDeviceTypes.h" class CClient; class CClientInfo; class CEventQueueTimer; class IClipboard; namespace synergy { class IStream; } class IEventQueue; //! Proxy for server /*! This class acts a proxy for the server, converting calls into messages to the server and messages from the server to calls on the client. */ class CServerProxy { public: /*! Process messages from the server on \p stream and forward to \p client. */ CServerProxy(CClient* client, synergy::IStream* stream, IEventQueue* eventQueue); ~CServerProxy(); //! @name manipulators //@{ void onInfoChanged(); bool onGrabClipboard(ClipboardID); void onClipboardChanged(ClipboardID, const IClipboard*); void onGameDeviceTimingResp(UInt16 freq); void onGameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); //@} #ifdef TEST_ENV void handleDataForTest() { handleData(CEvent(), NULL); } #endif protected: enum EResult { kOkay, kUnknown, kDisconnect }; EResult parseHandshakeMessage(const UInt8* code); EResult parseMessage(const UInt8* code); private: // if compressing mouse motion then send the last motion now void flushCompressedMouse(); void sendInfo(const CClientInfo&); void resetKeepAliveAlarm(); void setKeepAliveRate(double); // modifier key translation KeyID translateKey(KeyID) const; KeyModifierMask translateModifierMask(KeyModifierMask) const; // event handlers void handleData(const CEvent&, void*); void handleKeepAliveAlarm(const CEvent&, void*); // message handlers void enter(); void leave(); void setClipboard(); void grabClipboard(); void keyDown(); void keyRepeat(); void keyUp(); void mouseDown(); void mouseUp(); void mouseMove(); void mouseRelativeMove(); void mouseWheel(); void gameDeviceButtons(); void gameDeviceSticks(); void gameDeviceTriggers(); void gameDeviceTimingReq(); void cryptoIv(); void screensaver(); void resetOptions(); void setOptions(); void queryInfo(); void infoAcknowledgment(); private: typedef EResult (CServerProxy::*MessageParser)(const UInt8*); CClient* m_client; synergy::IStream* m_stream; UInt32 m_seqNum; bool m_compressMouse; bool m_compressMouseRelative; SInt32 m_xMouse, m_yMouse; SInt32 m_dxMouse, m_dyMouse; bool m_ignoreMouse; KeyModifierID m_modifierTranslationTable[kKeyModifierIDLast]; double m_keepAliveAlarm; CEventQueueTimer* m_keepAliveAlarmTimer; MessageParser m_parser; IEventQueue* m_eventQueue; }; #endif synergy-1.4.12-Source/src/lib/CMakeLists.txt0000600000175000017500000000171012021261364020600 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . add_subdirectory(arch) add_subdirectory(base) add_subdirectory(client) add_subdirectory(common) add_subdirectory(io) add_subdirectory(ipc) add_subdirectory(mt) add_subdirectory(net) add_subdirectory(platform) add_subdirectory(server) add_subdirectory(synergy) synergy-1.4.12-Source/src/lib/common/0000700000175000017500000000000012140644175017336 5ustar synergysynergysynergy-1.4.12-Source/src/lib/common/BasicTypes.h0000600000175000017500000000417212021261364021554 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 BASICTYPES_H #define BASICTYPES_H #include "common.h" // // pick types of particular sizes // #if !defined(TYPE_OF_SIZE_1) # if SIZEOF_CHAR == 1 # define TYPE_OF_SIZE_1 char # endif #endif #if !defined(TYPE_OF_SIZE_2) # if SIZEOF_INT == 2 # define TYPE_OF_SIZE_2 int # else # define TYPE_OF_SIZE_2 short # endif #endif #if !defined(TYPE_OF_SIZE_4) // Carbon defines SInt32 and UInt32 in terms of long # if SIZEOF_INT == 4 && !defined(__APPLE__) # define TYPE_OF_SIZE_4 int # else # define TYPE_OF_SIZE_4 long # endif #endif // // verify existence of required types // #if !defined(TYPE_OF_SIZE_1) # error No 1 byte integer type #endif #if !defined(TYPE_OF_SIZE_2) # error No 2 byte integer type #endif #if !defined(TYPE_OF_SIZE_4) # error No 4 byte integer type #endif // // make typedefs // // except for SInt8 and UInt8 these types are only guaranteed to be // at least as big as indicated (in bits). that is, they may be // larger than indicated. // // Added this because it doesn't compile on OS X 10.6 because they are already defined in Carbon #if !defined(__MACTYPES__) typedef signed TYPE_OF_SIZE_1 SInt8; typedef signed TYPE_OF_SIZE_2 SInt16; typedef signed TYPE_OF_SIZE_4 SInt32; typedef unsigned TYPE_OF_SIZE_1 UInt8; typedef unsigned TYPE_OF_SIZE_2 UInt16; typedef unsigned TYPE_OF_SIZE_4 UInt32; #endif // // clean up // #undef TYPE_OF_SIZE_1 #undef TYPE_OF_SIZE_2 #undef TYPE_OF_SIZE_4 #endif synergy-1.4.12-Source/src/lib/common/CMakeLists.txt0000600000175000017500000000157012021261364022074 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc Version.h ) set(src Version.cpp ) if (WIN32) list(APPEND src ${inc}) endif() if (UNIX) include_directories( ../../.. ) endif() add_library(common STATIC ${src}) synergy-1.4.12-Source/src/lib/common/common.h0000600000175000017500000001056612021261364021002 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COMMON_H #define COMMON_H // this file should be included, directly or indirectly by every other. #if HAVE_CONFIG_H # include "config.h" // don't use poll() on mac # if defined(__APPLE__) # undef HAVE_POLL # endif #else // we may not have run configure on win32 # if defined(_WIN32) # define SYSAPI_WIN32 1 # define WINAPI_MSWINDOWS 1 # endif // we may not have run configure on OS X # if defined(__APPLE__) # define SYSAPI_UNIX 1 # define WINAPI_CARBON 1 # define HAVE_CXX_BOOL 1 # define HAVE_CXX_CASTS 1 # define HAVE_CXX_EXCEPTIONS 1 # define HAVE_CXX_MUTABLE 1 # define HAVE_CXX_STDLIB 1 # define HAVE_GETPWUID_R 1 # define HAVE_GMTIME_R 1 # define HAVE_INET_ATON 1 # define HAVE_INTTYPES_H 1 # define HAVE_ISTREAM 1 # define HAVE_MEMORY_H 1 # define HAVE_NANOSLEEP 1 # define HAVE_OSTREAM 1 # define HAVE_POSIX_SIGWAIT 1 # define HAVE_PTHREAD 1 # define HAVE_PTHREAD_SIGNAL 1 # include # include # if defined(_SOCKLEN_T) # define HAVE_SOCKLEN_T 1 # endif # define HAVE_SSTREAM 1 # define HAVE_STDINT_H 1 # define HAVE_STDLIB_H 1 # define HAVE_STRINGS_H 1 # define HAVE_STRING_H 1 # define HAVE_SYS_SELECT_H 1 # define HAVE_SYS_SOCKET_H 1 # define HAVE_SYS_STAT_H 1 # define HAVE_SYS_TIME_H 1 # define HAVE_SYS_TYPES_H 1 # define HAVE_SYS_UTSNAME_H 1 # define HAVE_UNISTD_H 1 # define HAVE_VSNPRINTF 1 /* disable this so we can build with the 10.2.8 SDK */ /*# define HAVE_WCHAR_H 1*/ # define SELECT_TYPE_ARG1 int # define SELECT_TYPE_ARG234 (fd_set *) # define SELECT_TYPE_ARG5 (struct timeval *) # define SIZEOF_CHAR 1 # define SIZEOF_INT 4 # define SIZEOF_LONG 4 # define SIZEOF_SHORT 2 # define STDC_HEADERS 1 # define TIME_WITH_SYS_TIME 1 # define X_DISPLAY_MISSING 1 # endif #endif // VC++ specific #if (_MSC_VER >= 1200) // work around for statement scoping bug # define for if (false) { } else for // turn off bonehead warnings # pragma warning(disable: 4786) // identifier truncated in debug info # pragma warning(disable: 4514) // unreferenced inline function removed // this one's a little too aggressive # pragma warning(disable: 4127) // conditional expression is constant // Code Analysis # pragma warning(disable: 6011) // emitted incorrectly under release build in some circumstances # if defined(NDEBUG) # pragma warning(disable: 4702) // unreachable code # pragma warning(disable: 4701) // variable maybe used uninitialized # endif #endif // (_MSC_VER >= 1200) // VC++ has built-in sized types #if defined(_MSC_VER) # include # define TYPE_OF_SIZE_1 __int8 # define TYPE_OF_SIZE_2 __int16 # define TYPE_OF_SIZE_4 __int32 #else # define SIZE_OF_CHAR 1 # define SIZE_OF_SHORT 2 # define SIZE_OF_INT 4 # define SIZE_OF_LONG 4 #endif // FIXME -- including fp.h from Carbon.h causes a undefined symbol error // on my build system. the symbol is scalb. since we don't need any // math functions we define __FP__, the include guard macro for fp.h, to // prevent fp.h from being included. #if defined(__APPLE__) #define __FP__ #endif // define NULL #include // we don't want to use NULL since it's old and nasty, so replace any // usages with nullptr (warning: this could break many things). // if not c++0x yet, future proof code by allowing use of nullptr #ifdef nullptr #define NULL nullptr #else #define nullptr NULL #endif // make assert available since we use it a lot #include #include #include enum { kExitSuccess = 0, // successful completion kExitFailed = 1, // general failure kExitTerminated = 2, // killed by signal kExitArgs = 3, // bad arguments kExitConfig = 4 // cannot read configuration }; #endif synergy-1.4.12-Source/src/lib/common/IInterface.h0000600000175000017500000000201712021261364021513 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IINTERFACE_H #define IINTERFACE_H #include "common.h" //! Base class of interfaces /*! This is the base class of all interface classes. An interface class has only pure virtual methods. */ class IInterface { public: //! Interface destructor does nothing virtual ~IInterface() { } }; #endif synergy-1.4.12-Source/src/lib/common/MacOSXPrecomp.h0000600000175000017500000000163212021261364022124 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // // Prefix header for all source files of the 'deleteme' target in the 'deleteme' project. // #define MAC_OS_X_VERSION_MAX_ALLOWED MAC_OS_X_VERSION_10_2 #include synergy-1.4.12-Source/src/lib/common/stdbitset.h0000600000175000017500000000143212021261364021507 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stddeque.h0000600000175000017500000000143112021261364021317 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdfstream.h0000600000175000017500000000146312021261364021662 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" #include "stdistream.h" synergy-1.4.12-Source/src/lib/common/stdistream.h0000600000175000017500000000274112021261364021665 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #if HAVE_ISTREAM #include #else #include #endif #include "stdpost.h" #if defined(_MSC_VER) && _MSC_VER <= 1200 // VC++6 istream has no overloads for __int* types, .NET does inline std::istream& operator>>(std::istream& s, SInt8& i) { return s >> (signed char&)i; } inline std::istream& operator>>(std::istream& s, SInt16& i) { return s >> (short&)i; } inline std::istream& operator>>(std::istream& s, SInt32& i) { return s >> (int&)i; } inline std::istream& operator>>(std::istream& s, UInt8& i) { return s >> (unsigned char&)i; } inline std::istream& operator>>(std::istream& s, UInt16& i) { return s >> (unsigned short&)i; } inline std::istream& operator>>(std::istream& s, UInt32& i) { return s >> (unsigned int&)i; } #endif synergy-1.4.12-Source/src/lib/common/stdlist.h0000600000175000017500000000143012021261364021166 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdmap.h0000600000175000017500000000142712021261364020776 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdostream.h0000600000175000017500000000151512021261364021671 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #if HAVE_OSTREAM #include #else #include #endif #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdpost.h0000600000175000017500000000142112021261364021200 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if defined(_MSC_VER) #pragma warning(pop) #endif synergy-1.4.12-Source/src/lib/common/stdpre.h0000600000175000017500000000254612021261364021012 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #if defined(_MSC_VER) #pragma warning(disable: 4786) // identifier truncated #pragma warning(disable: 4514) // unreferenced inline #pragma warning(disable: 4710) // not inlined #pragma warning(disable: 4663) // C++ change, template specialization #pragma warning(disable: 4503) // decorated name length too long #pragma warning(push, 3) #pragma warning(disable: 4018) // signed/unsigned mismatch #pragma warning(disable: 4284) #pragma warning(disable: 4146) // unary minus on unsigned value #pragma warning(disable: 4127) // conditional expression is constant #pragma warning(disable: 4701) // variable possibly used uninitialized #endif synergy-1.4.12-Source/src/lib/common/stdset.h0000600000175000017500000000142712021261364021014 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdsstream.h0000600000175000017500000002062312021261364021676 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #if HAVE_SSTREAM || !defined(__GNUC__) || (__GNUC__ >= 3) #include #elif defined(__GNUC_MINOR__) && (__GNUC_MINOR__ >= 95) // g++ 2.95 didn't ship with sstream. the following is a backport // by Magnus Fromreide of the sstream in g++ 3.0. /* This is part of libio/iostream, providing -*- C++ -*- input/output. Copyright (C) 2012 Bolton Software Ltd. Copyright (C) 2000 Free Software Foundation This file is part of the GNU IO Library. This library 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, or (at your option) any later version. This library 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 library; see the file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. As a special exception, if you link this library with files compiled with a GNU compiler to produce an executable, this does not cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU General Public License. */ /* Written by Magnus Fromreide (magfr@lysator.liu.se). */ /* seekoff and ideas for overflow is largely borrowed from libstdc++-v3 */ #include #include #include namespace std { class stringbuf : public streambuf { public: typedef char char_type; typedef int int_type; typedef streampos pos_type; typedef streamoff off_type; explicit stringbuf(int which=ios::in|ios::out) : streambuf(), mode(static_cast(which)), stream(NULL), stream_len(0) { stringbuf_init(); } explicit stringbuf(const string &str, int which=ios::in|ios::out) : streambuf(), mode(static_cast(which)), stream(NULL), stream_len(0) { if (mode & (ios::in|ios::out)) { stream_len = str.size(); stream = new char_type[stream_len]; str.copy(stream, stream_len); } stringbuf_init(); } virtual ~stringbuf() { delete[] stream; } string str() const { if (pbase() != 0) return string(stream, pptr()-pbase()); else return string(); } void str(const string& str) { delete[] stream; stream_len = str.size(); stream = new char_type[stream_len]; str.copy(stream, stream_len); stringbuf_init(); } protected: // The buffer is already in gptr, so if it ends then it is out of data. virtual int underflow() { return EOF; } virtual int overflow(int c = EOF) { int res; if (mode & ios::out) { if (c != EOF) { streamsize old_stream_len = stream_len; stream_len += 1; char_type* new_stream = new char_type[stream_len]; memcpy(new_stream, stream, old_stream_len); delete[] stream; stream = new_stream; stringbuf_sync(gptr()-eback(), pptr()-pbase()); sputc(c); res = c; } else res = EOF; } else res = 0; return res; } virtual streambuf* setbuf(char_type* s, streamsize n) { if (n != 0) { delete[] stream; stream = new char_type[n]; memcpy(stream, s, n); stream_len = n; stringbuf_sync(0, 0); } return this; } virtual pos_type seekoff(off_type off, ios::seek_dir way, int which = ios::in | ios::out) { pos_type ret = pos_type(off_type(-1)); bool testin = which & ios::in && mode & ios::in; bool testout = which & ios::out && mode & ios::out; bool testboth = testin && testout && way != ios::cur; if (stream_len && ((testin != testout) || testboth)) { char_type* beg = stream; char_type* curi = NULL; char_type* curo = NULL; char_type* endi = NULL; char_type* endo = NULL; if (testin) { curi = gptr(); endi = egptr(); } if (testout) { curo = pptr(); endo = epptr(); } off_type newoffi = 0; off_type newoffo = 0; if (way == ios::beg) { newoffi = beg - curi; newoffo = beg - curo; } else if (way == ios::end) { newoffi = endi - curi; newoffo = endo - curo; } if (testin && newoffi + off + curi - beg >= 0 && endi - beg >= newoffi + off + curi - beg) { gbump(newoffi + off); ret = pos_type(newoffi + off + curi); } if (testout && newoffo + off + curo - beg >= 0 && endo - beg >= newoffo + off + curo - beg) { pbump(newoffo + off); ret = pos_type(newoffo + off + curo); } } return ret; } virtual pos_type seekpos(pos_type sp, int which = ios::in | ios::out) { pos_type ret = seekoff(sp, ios::beg, which); return ret; } private: void stringbuf_sync(streamsize i, streamsize o) { if (mode & ios::in) setg(stream, stream + i, stream + stream_len); if (mode & ios::out) { setp(stream, stream + stream_len); pbump(o); } } void stringbuf_init() { if (mode & ios::ate) stringbuf_sync(0, stream_len); else stringbuf_sync(0, 0); } private: ios::open_mode mode; char_type* stream; streamsize stream_len; }; class istringstream : public istream { public: typedef char char_type; typedef int int_type; typedef streampos pos_type; typedef streamoff off_type; explicit istringstream(int which=ios::in) : istream(&sb), sb(which | ios::in) { } explicit istringstream(const string& str, int which=ios::in) : istream(&sb), sb(str, which | ios::in) { } stringbuf* rdbuf() const { return const_cast(&sb); } string str() const { return rdbuf()->str(); } void str(const string& s) { rdbuf()->str(s); } private: stringbuf sb; }; class ostringstream : public ostream { public: typedef char char_type; typedef int int_type; typedef streampos pos_type; typedef streamoff off_type; explicit ostringstream(int which=ios::out) : ostream(&sb), sb(which | ios::out) { } explicit ostringstream(const string& str, int which=ios::out) : ostream(&sb), sb(str, which | ios::out) { } stringbuf* rdbuf() const { return const_cast(&sb); } string str() const { return rdbuf()->str(); } void str(const string& s) { rdbuf()->str(s); } private: stringbuf sb; }; class stringstream : public iostream { public: typedef char char_type; typedef int int_type; typedef streampos pos_type; typedef streamoff off_type; explicit stringstream(int which=ios::out|ios::in) : iostream(&sb), sb(which) { } explicit stringstream(const string& str, int which=ios::out|ios::in) : iostream(&sb), sb(str, which) { } stringbuf* rdbuf() const { return const_cast(&sb); } string str() const { return rdbuf()->str(); } void str(const string& s) { rdbuf()->str(s); } private: stringbuf sb; }; }; #else /* not g++ 2.95 and no */ #error "Standard C++ library is missing required sstream header." #endif /* not g++ 2.95 and no */ #include "stdpost.h" #include "stdistream.h" synergy-1.4.12-Source/src/lib/common/stdstring.h0000600000175000017500000000143212021261364021523 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/stdvector.h0000600000175000017500000000143212021261364021517 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "stdpre.h" #include #include "stdpost.h" synergy-1.4.12-Source/src/lib/common/Version.cpp0000600000175000017500000000231012021261364021456 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "Version.h" const char* kApplication = "Synergy"; const char* kCopyright = "Copyright (C) 2012 Bolton Software Ltd.\n" "Copyright (C) 2008-2012 Nick Bolton\n" "Copyright (C) 2002-2012 Chris Schoeneman"; const char* kContact = "Synergy Mailing List, synergy-plus@googlegroups.com"; const char* kWebsite = "http://synergy-foss.org/"; const char* kVersion = VERSION; const char* kAppVersion = "Synergy " VERSION; synergy-1.4.12-Source/src/lib/common/Version.h0000600000175000017500000000240712021261364021132 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 VERSION_H #define VERSION_H #include "common.h" // set version macro if not set yet #if !defined(VERSION) #error Version was not set (should be passed to compiler). #endif // important strings extern const char* kApplication; extern const char* kCopyright; extern const char* kContact; extern const char* kWebsite; // build version. follows linux kernel style: an even minor number implies // a release version, odd implies development version. extern const char* kVersion; // application version extern const char* kAppVersion; #endif synergy-1.4.12-Source/src/lib/io/0000700000175000017500000000000012140644175016455 5ustar synergysynergysynergy-1.4.12-Source/src/lib/io/CMakeLists.txt0000600000175000017500000000204312021261364021207 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CStreamBuffer.h CStreamFilter.h IStream.h IStreamFilterFactory.h XIO.h ) set(src CStreamBuffer.cpp CStreamFilter.cpp IStream.cpp XIO.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(io STATIC ${src}) synergy-1.4.12-Source/src/lib/io/CStreamBuffer.cpp0000600000175000017500000000633312021261364021651 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CStreamBuffer.h" // // CStreamBuffer // const UInt32 CStreamBuffer::kChunkSize = 4096; CStreamBuffer::CStreamBuffer() : m_size(0), m_headUsed(0) { // do nothing } CStreamBuffer::~CStreamBuffer() { // do nothing } const void* CStreamBuffer::peek(UInt32 n) { assert(n <= m_size); // if requesting no data then return NULL so we don't try to access // an empty list. if (n == 0) { return NULL; } // reserve space in first chunk ChunkList::iterator head = m_chunks.begin(); head->reserve(n + m_headUsed); // consolidate chunks into the first chunk until it has n bytes ChunkList::iterator scan = head; ++scan; while (head->size() - m_headUsed < n && scan != m_chunks.end()) { head->insert(head->end(), scan->begin(), scan->end()); scan = m_chunks.erase(scan); } return reinterpret_cast(&(head->begin()[m_headUsed])); } void CStreamBuffer::pop(UInt32 n) { // discard all chunks if n is greater than or equal to m_size if (n >= m_size) { m_size = 0; m_headUsed = 0; m_chunks.clear(); return; } // update size m_size -= n; // discard chunks until more than n bytes would've been discarded ChunkList::iterator scan = m_chunks.begin(); assert(scan != m_chunks.end()); while (scan->size() - m_headUsed <= n) { n -= (UInt32)scan->size() - m_headUsed; m_headUsed = 0; scan = m_chunks.erase(scan); assert(scan != m_chunks.end()); } // remove left over bytes from the head chunk if (n > 0) { m_headUsed += n; } } void CStreamBuffer::write(const void* vdata, UInt32 n) { assert(vdata != NULL); // ignore if no data, otherwise update size if (n == 0) { return; } m_size += n; // cast data to bytes const UInt8* data = reinterpret_cast(vdata); // point to last chunk if it has space, otherwise append an empty chunk ChunkList::iterator scan = m_chunks.end(); if (scan != m_chunks.begin()) { --scan; if (scan->size() >= kChunkSize) { ++scan; } } if (scan == m_chunks.end()) { scan = m_chunks.insert(scan, Chunk()); } // append data in chunks while (n > 0) { // choose number of bytes for next chunk assert(scan->size() <= kChunkSize); UInt32 count = kChunkSize - (UInt32)scan->size(); if (count > n) count = n; // transfer data scan->insert(scan->end(), data, data + count); n -= count; data += count; // append another empty chunk if we're not done yet if (n > 0) { ++scan; scan = m_chunks.insert(scan, Chunk()); } } } UInt32 CStreamBuffer::getSize() const { return m_size; } synergy-1.4.12-Source/src/lib/io/CStreamBuffer.h0000600000175000017500000000354312021261364021316 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSTREAMBUFFER_H #define CSTREAMBUFFER_H #include "BasicTypes.h" #include "stdlist.h" #include "stdvector.h" //! FIFO of bytes /*! This class maintains a FIFO (first-in, last-out) buffer of bytes. */ class CStreamBuffer { public: CStreamBuffer(); ~CStreamBuffer(); //! @name manipulators //@{ //! Read data without removing from buffer /*! Return a pointer to memory with the next \c n bytes in the buffer (which must be <= getSize()). The caller must not modify the returned memory nor delete it. */ const void* peek(UInt32 n); //! Discard data /*! Discards the next \c n bytes. If \c n >= getSize() then the buffer is cleared. */ void pop(UInt32 n); //! Write data to buffer /*! Appends \c n bytes from \c data to the buffer. */ void write(const void* data, UInt32 n); //@} //! @name accessors //@{ //! Get size of buffer /*! Returns the number of bytes in the buffer. */ UInt32 getSize() const; //@} private: static const UInt32 kChunkSize; typedef std::vector Chunk; typedef std::list ChunkList; ChunkList m_chunks; UInt32 m_size; UInt32 m_headUsed; }; #endif synergy-1.4.12-Source/src/lib/io/CStreamFilter.cpp0000600000175000017500000000463512131062123021662 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CStreamFilter.h" #include "IEventQueue.h" #include "TMethodEventJob.h" // // CStreamFilter // CStreamFilter::CStreamFilter(IEventQueue* eventQueue, synergy::IStream* stream, bool adoptStream) : IStream(eventQueue), m_stream(stream), m_adopted(adoptStream) { // replace handlers for m_stream getEventQueue().removeHandlers(m_stream->getEventTarget()); getEventQueue().adoptHandler(CEvent::kUnknown, m_stream->getEventTarget(), new TMethodEventJob(this, &CStreamFilter::handleUpstreamEvent)); } CStreamFilter::~CStreamFilter() { getEventQueue().removeHandler(CEvent::kUnknown, m_stream->getEventTarget()); if (m_adopted) { delete m_stream; } } void CStreamFilter::close() { getStream()->close(); } UInt32 CStreamFilter::read(void* buffer, UInt32 n) { return getStream()->read(buffer, n); } void CStreamFilter::write(const void* buffer, UInt32 n) { getStream()->write(buffer, n); } void CStreamFilter::flush() { getStream()->flush(); } void CStreamFilter::shutdownInput() { getStream()->shutdownInput(); } void CStreamFilter::shutdownOutput() { getStream()->shutdownOutput(); } void* CStreamFilter::getEventTarget() const { return const_cast(reinterpret_cast(this)); } bool CStreamFilter::isReady() const { return getStream()->isReady(); } UInt32 CStreamFilter::getSize() const { return getStream()->getSize(); } synergy::IStream* CStreamFilter::getStream() const { return m_stream; } void CStreamFilter::filterEvent(const CEvent& event) { getEventQueue().dispatchEvent(CEvent(event.getType(), getEventTarget(), event.getData())); } void CStreamFilter::handleUpstreamEvent(const CEvent& event, void*) { filterEvent(event); } synergy-1.4.12-Source/src/lib/io/CStreamFilter.h0000600000175000017500000000433012131062123021317 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSTREAMFILTER_H #define CSTREAMFILTER_H #include "IStream.h" #include "IEventQueue.h" //! A stream filter /*! This class wraps a stream. Subclasses provide indirect access to the wrapped stream, typically performing some filtering. */ class CStreamFilter : public synergy::IStream { public: /*! Create a wrapper around \c stream. Iff \c adoptStream is true then this object takes ownership of the stream and will delete it in the d'tor. */ CStreamFilter(IEventQueue* eventQueue, synergy::IStream* stream, bool adoptStream = true); virtual ~CStreamFilter(); // IStream overrides // These all just forward to the underlying stream except getEventTarget. // Override as necessary. getEventTarget returns a pointer to this. virtual void close(); virtual UInt32 read(void* buffer, UInt32 n); virtual void write(const void* buffer, UInt32 n); virtual void flush(); virtual void shutdownInput(); virtual void shutdownOutput(); virtual void* getEventTarget() const; virtual bool isReady() const; virtual UInt32 getSize() const; protected: //! Get the stream /*! Returns the stream passed to the c'tor. */ synergy::IStream* getStream() const; //! Handle events from source stream /*! Does the event filtering. The default simply dispatches an event identical except using this object as the event target. */ virtual void filterEvent(const CEvent&); private: void handleUpstreamEvent(const CEvent&, void*); private: synergy::IStream* m_stream; bool m_adopted; }; #endif synergy-1.4.12-Source/src/lib/io/IStream.cpp0000600000175000017500000000367112131062123020521 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IStream.h" #include "CEventQueue.h" using namespace synergy; // // IStream // CEvent::Type IStream::s_inputReadyEvent = CEvent::kUnknown; CEvent::Type IStream::s_outputFlushedEvent = CEvent::kUnknown; CEvent::Type IStream::s_outputErrorEvent = CEvent::kUnknown; CEvent::Type IStream::s_inputShutdownEvent = CEvent::kUnknown; CEvent::Type IStream::s_outputShutdownEvent = CEvent::kUnknown; CEvent::Type IStream::getInputReadyEvent() { return m_eventQueue->registerTypeOnce(s_inputReadyEvent, "IStream::inputReady"); } CEvent::Type IStream::getOutputFlushedEvent() { return m_eventQueue->registerTypeOnce(s_outputFlushedEvent, "IStream::outputFlushed"); } CEvent::Type IStream::getOutputErrorEvent() { return m_eventQueue->registerTypeOnce(s_outputErrorEvent, "IStream::outputError"); } CEvent::Type IStream::getInputShutdownEvent() { return m_eventQueue->registerTypeOnce(s_inputShutdownEvent, "IStream::inputShutdown"); } CEvent::Type IStream::getOutputShutdownEvent() { return m_eventQueue->registerTypeOnce(s_outputShutdownEvent, "IStream::outputShutdown"); } IEventQueue& IStream::getEventQueue() const { assert(m_eventQueue != NULL); return *m_eventQueue; } synergy-1.4.12-Source/src/lib/io/IStream.h0000600000175000017500000001172312131062123020163 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISTREAM_H #define ISTREAM_H #include "IInterface.h" #include "CEvent.h" #include "IEventQueue.h" class IEventQueue; namespace synergy { //! Bidirectional stream interface /*! Defines the interface for all streams. */ class IStream : public IInterface { public: IStream() : m_eventQueue(EVENTQUEUE) { } IStream(IEventQueue* eventQueue) : m_eventQueue(eventQueue) { } //! @name manipulators //@{ //! Close the stream /*! Closes the stream. Pending input data and buffered output data are discarded. Use \c flush() before \c close() to send buffered output data. Attempts to \c read() after a close return 0, attempts to \c write() generate output error events, and attempts to \c flush() return immediately. */ virtual void close() = 0; //! Read from stream /*! Read up to \p n bytes into \p buffer, returning the number read (zero if no data is available or input is shutdown). \p buffer may be NULL in which case the data is discarded. */ virtual UInt32 read(void* buffer, UInt32 n) = 0; //! Write to stream /*! Write \c n bytes from \c buffer to the stream. If this can't complete immediately it will block. Data may be buffered in order to return more quickly. A output error event is generated when writing fails. */ virtual void write(const void* buffer, UInt32 n) = 0; //! Flush the stream /*! Waits until all buffered data has been written to the stream. */ virtual void flush() = 0; //! Shutdown input /*! Shutdown the input side of the stream. Any pending input data is discarded and further reads immediately return 0. */ virtual void shutdownInput() = 0; //! Shutdown output /*! Shutdown the output side of the stream. Any buffered output data is discarded and further writes generate output error events. Use \c flush() before \c shutdownOutput() to send buffered output data. */ virtual void shutdownOutput() = 0; //@} //! @name accessors //@{ //! Get event target /*! Returns the event target for events generated by this stream. It should be the source stream in a chain of stream filters. */ virtual void* getEventTarget() const = 0; //! Test if \c read() will succeed /*! Returns true iff an immediate \c read() will return data. This may or may not be the same as \c getSize() > 0, depending on the stream type. */ virtual bool isReady() const = 0; //! Get bytes available to read /*! Returns a conservative estimate of the available bytes to read (i.e. a number not greater than the actual number of bytes). Some streams may not be able to determine this and will always return zero. */ virtual UInt32 getSize() const = 0; //! Get input ready event type /*! Returns the input ready event type. A stream sends this event when \c read() will return with data. */ virtual CEvent::Type getInputReadyEvent(); //! Get output flushed event type /*! Returns the output flushed event type. A stream sends this event when the output buffer has been flushed. If there have been no writes since the event was posted, calling \c shutdownOutput() or \c close() will not discard any data and \c flush() will return immediately. */ virtual CEvent::Type getOutputFlushedEvent(); //! Get output error event type /*! Returns the output error event type. A stream sends this event when a write has failed. */ virtual CEvent::Type getOutputErrorEvent(); //! Get input shutdown event type /*! Returns the input shutdown event type. This is sent when the input side of the stream has shutdown. When the input has shutdown, no more data will ever be available to read. */ virtual CEvent::Type getInputShutdownEvent(); //! Get output shutdown event type /*! Returns the output shutdown event type. This is sent when the output side of the stream has shutdown. When the output has shutdown, no more data can ever be written to the stream. Any attempt to do so will generate a output error event. */ virtual CEvent::Type getOutputShutdownEvent(); //! Get the event queue IEventQueue& getEventQueue() const; //@} private: static CEvent::Type s_inputReadyEvent; static CEvent::Type s_outputFlushedEvent; static CEvent::Type s_outputErrorEvent; static CEvent::Type s_inputShutdownEvent; static CEvent::Type s_outputShutdownEvent; IEventQueue* m_eventQueue; }; } #endif synergy-1.4.12-Source/src/lib/io/IStreamFilterFactory.h0000600000175000017500000000235412021261364022667 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISTREAMFILTERFACTORY_H #define ISTREAMFILTERFACTORY_H #include "IInterface.h" using namespace synergy; namespace synergy { class IStream; } //! Stream filter factory interface /*! This interface provides factory methods to create stream filters. */ class IStreamFilterFactory : public IInterface { public: //! Create filter /*! Create and return a stream filter on \p stream. The caller must delete the returned object. */ virtual synergy::IStream* create(IStream* stream, bool adoptStream) = 0; }; #endif synergy-1.4.12-Source/src/lib/io/XIO.cpp0000600000175000017500000000217312021261364017616 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XIO.h" // // XIOClosed // CString XIOClosed::getWhat() const throw() { return format("XIOClosed", "already closed"); } // // XIOEndOfStream // CString XIOEndOfStream::getWhat() const throw() { return format("XIOEndOfStream", "reached end of stream"); } // // XIOWouldBlock // CString XIOWouldBlock::getWhat() const throw() { return format("XIOWouldBlock", "stream operation would block"); } synergy-1.4.12-Source/src/lib/io/XIO.h0000600000175000017500000000253312021261364017263 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XIO_H #define XIO_H #include "XBase.h" //! Generic I/O exception XBASE_SUBCLASS(XIO, XBase); //! I/O closing exception /*! Thrown if a stream cannot be closed. */ XBASE_SUBCLASS(XIOClose, XIO); //! I/O already closed exception /*! Thrown when attempting to close or perform I/O on an already closed. stream. */ XBASE_SUBCLASS_WHAT(XIOClosed, XIO); //! I/O end of stream exception /*! Thrown when attempting to read beyond the end of a stream. */ XBASE_SUBCLASS_WHAT(XIOEndOfStream, XIO); //! I/O would block exception /*! Thrown if an operation on a stream would block. */ XBASE_SUBCLASS_WHAT(XIOWouldBlock, XIO); #endif synergy-1.4.12-Source/src/lib/ipc/0000700000175000017500000000000012140644175016621 5ustar synergysynergysynergy-1.4.12-Source/src/lib/ipc/CIpcClient.cpp0000600000175000017500000000540212021261364021276 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcClient.h" #include "Ipc.h" #include "CIpcServerProxy.h" #include "TMethodEventJob.h" #include "CIpcMessage.h" CEvent::Type CIpcClient::s_connectedEvent = CEvent::kUnknown; CEvent::Type CIpcClient::s_messageReceivedEvent = CEvent::kUnknown; CIpcClient::CIpcClient() : m_serverAddress(CNetworkAddress(IPC_HOST, IPC_PORT)), m_server(nullptr) { init(); } CIpcClient::CIpcClient(int port) : m_serverAddress(CNetworkAddress(IPC_HOST, port)), m_server(nullptr) { init(); } void CIpcClient::init() { m_serverAddress.resolve(); } CIpcClient::~CIpcClient() { } void CIpcClient::connect() { EVENTQUEUE->adoptHandler( IDataSocket::getConnectedEvent(), m_socket.getEventTarget(), new TMethodEventJob( this, &CIpcClient::handleConnected)); m_socket.connect(m_serverAddress); m_server = new CIpcServerProxy(m_socket); EVENTQUEUE->adoptHandler( CIpcServerProxy::getMessageReceivedEvent(), m_server, new TMethodEventJob( this, &CIpcClient::handleMessageReceived)); } void CIpcClient::disconnect() { EVENTQUEUE->removeHandler(IDataSocket::getConnectedEvent(), m_socket.getEventTarget()); EVENTQUEUE->removeHandler(CIpcServerProxy::getMessageReceivedEvent(), m_server); m_server->disconnect(); delete m_server; m_server = nullptr; } void CIpcClient::send(const CIpcMessage& message) { assert(m_server != nullptr); m_server->send(message); } CEvent::Type CIpcClient::getConnectedEvent() { return EVENTQUEUE->registerTypeOnce( s_connectedEvent, "CIpcClient::connected"); } CEvent::Type CIpcClient::getMessageReceivedEvent() { return EVENTQUEUE->registerTypeOnce( s_messageReceivedEvent, "CIpcClient::messageReceived"); } void CIpcClient::handleConnected(const CEvent&, void*) { EVENTQUEUE->addEvent(CEvent( getConnectedEvent(), this, m_server, CEvent::kDontFreeData)); CIpcHelloMessage message(kIpcClientNode); send(message); } void CIpcClient::handleMessageReceived(const CEvent& e, void*) { CEvent event(getMessageReceivedEvent(), this); event.setDataObject(e.getDataObject()); EVENTQUEUE->addEvent(event); } synergy-1.4.12-Source/src/lib/ipc/CIpcClient.h0000600000175000017500000000334112021261364020743 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CNetworkAddress.h" #include "CTCPSocket.h" class CIpcServerProxy; class CIpcMessage; //! IPC client for communication between daemon and GUI. /*! * See \ref CIpcServer description. */ class CIpcClient { public: CIpcClient(); CIpcClient(int port); virtual ~CIpcClient(); //! @name manipulators //@{ //! Connects to the IPC server at localhost. void connect(); //! Disconnects from the IPC server. void disconnect(); //! Sends a message to the server. void send(const CIpcMessage& message); //@} //! @name accessors //@{ //! Raised when the socket is connected. static CEvent::Type getConnectedEvent(); static CEvent::Type getMessageReceivedEvent(); //@} private: void init(); void handleConnected(const CEvent&, void*); void handleMessageReceived(const CEvent&, void*); private: CNetworkAddress m_serverAddress; CTCPSocket m_socket; CIpcServerProxy* m_server; static CEvent::Type s_connectedEvent; static CEvent::Type s_messageReceivedEvent; }; synergy-1.4.12-Source/src/lib/ipc/CIpcClientProxy.cpp0000600000175000017500000001271412021261364022344 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcClientProxy.h" #include "IStream.h" #include "TMethodEventJob.h" #include "Ipc.h" #include "CLog.h" #include "CIpcMessage.h" #include "CProtocolUtil.h" #include "CArch.h" CEvent::Type CIpcClientProxy::s_messageReceivedEvent = CEvent::kUnknown; CEvent::Type CIpcClientProxy::s_disconnectedEvent = CEvent::kUnknown; CIpcClientProxy::CIpcClientProxy(synergy::IStream& stream) : m_stream(stream), m_clientType(kIpcClientUnknown), m_disconnecting(false), m_readMutex(ARCH->newMutex()), m_writeMutex(ARCH->newMutex()) { EVENTQUEUE->adoptHandler( m_stream.getInputReadyEvent(), stream.getEventTarget(), new TMethodEventJob( this, &CIpcClientProxy::handleData)); EVENTQUEUE->adoptHandler( m_stream.getOutputErrorEvent(), stream.getEventTarget(), new TMethodEventJob( this, &CIpcClientProxy::handleWriteError)); EVENTQUEUE->adoptHandler( m_stream.getInputShutdownEvent(), stream.getEventTarget(), new TMethodEventJob( this, &CIpcClientProxy::handleDisconnect)); EVENTQUEUE->adoptHandler( m_stream.getOutputShutdownEvent(), stream.getEventTarget(), new TMethodEventJob( this, &CIpcClientProxy::handleWriteError)); } CIpcClientProxy::~CIpcClientProxy() { EVENTQUEUE->removeHandler( m_stream.getInputReadyEvent(), m_stream.getEventTarget()); EVENTQUEUE->removeHandler( m_stream.getOutputErrorEvent(), m_stream.getEventTarget()); EVENTQUEUE->removeHandler( m_stream.getInputShutdownEvent(), m_stream.getEventTarget()); EVENTQUEUE->removeHandler( m_stream.getOutputShutdownEvent(), m_stream.getEventTarget()); // don't delete the stream while it's being used. ARCH->lockMutex(m_readMutex); ARCH->lockMutex(m_writeMutex); delete &m_stream; ARCH->unlockMutex(m_readMutex); ARCH->unlockMutex(m_writeMutex); ARCH->closeMutex(m_readMutex); ARCH->closeMutex(m_writeMutex); } void CIpcClientProxy::handleDisconnect(const CEvent&, void*) { disconnect(); LOG((CLOG_DEBUG "ipc client disconnected")); } void CIpcClientProxy::handleWriteError(const CEvent&, void*) { disconnect(); LOG((CLOG_DEBUG "ipc client write error")); } void CIpcClientProxy::handleData(const CEvent&, void*) { // don't allow the dtor to destroy the stream while we're using it. CArchMutexLock lock(m_readMutex); LOG((CLOG_DEBUG "start ipc handle data")); UInt8 code[4]; UInt32 n = m_stream.read(code, 4); while (n != 0) { LOG((CLOG_DEBUG "ipc read: %c%c%c%c", code[0], code[1], code[2], code[3])); CIpcMessage* m = nullptr; if (memcmp(code, kIpcMsgHello, 4) == 0) { m = parseHello(); } else if (memcmp(code, kIpcMsgCommand, 4) == 0) { m = parseCommand(); } else { LOG((CLOG_ERR "invalid ipc message")); disconnect(); } // don't delete with this event; the data is passed to a new event. CEvent e(getMessageReceivedEvent(), this, NULL, CEvent::kDontFreeData); e.setDataObject(m); EVENTQUEUE->addEvent(e); n = m_stream.read(code, 4); } LOG((CLOG_DEBUG "finished ipc handle data")); } void CIpcClientProxy::send(const CIpcMessage& message) { // don't allow other threads to write until we've finished the entire // message. stream write is locked, but only for that single write. // also, don't allow the dtor to destroy the stream while we're using it. CArchMutexLock lock(m_writeMutex); LOG((CLOG_DEBUG "ipc write: %d", message.type())); switch (message.type()) { case kIpcLogLine: { const CIpcLogLineMessage& llm = static_cast(message); CString logLine = llm.logLine(); CProtocolUtil::writef(&m_stream, kIpcMsgLogLine, &logLine); break; } case kIpcShutdown: CProtocolUtil::writef(&m_stream, kIpcMsgShutdown); break; default: LOG((CLOG_ERR "ipc message not supported: %d", message.type())); break; } } CIpcHelloMessage* CIpcClientProxy::parseHello() { UInt8 type; CProtocolUtil::readf(&m_stream, kIpcMsgHello + 4, &type); m_clientType = static_cast(type); // must be deleted by event handler. return new CIpcHelloMessage(m_clientType); } CIpcCommandMessage* CIpcClientProxy::parseCommand() { CString command; UInt8 elevate; CProtocolUtil::readf(&m_stream, kIpcMsgCommand + 4, &command, &elevate); // must be deleted by event handler. return new CIpcCommandMessage(command, elevate != 0); } void CIpcClientProxy::disconnect() { LOG((CLOG_DEBUG "ipc disconnect, closing stream")); m_disconnecting = true; m_stream.close(); EVENTQUEUE->addEvent(CEvent(getDisconnectedEvent(), this)); } CEvent::Type CIpcClientProxy::getMessageReceivedEvent() { return EVENTQUEUE->registerTypeOnce( s_messageReceivedEvent, "CIpcClientProxy::messageReceived"); } CEvent::Type CIpcClientProxy::getDisconnectedEvent() { return EVENTQUEUE->registerTypeOnce( s_disconnectedEvent, "CIpcClientProxy::disconnected"); } synergy-1.4.12-Source/src/lib/ipc/CIpcClientProxy.h0000600000175000017500000000344712021261364022014 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CEvent.h" #include "Ipc.h" #include "IArchMultithread.h" namespace synergy { class IStream; } class CIpcMessage; class CIpcCommandMessage; class CIpcHelloMessage; class CIpcClientProxy { friend class CIpcServer; public: CIpcClientProxy(synergy::IStream& stream); virtual ~CIpcClientProxy(); private: //! Send a message to the client. void send(const CIpcMessage& message); //! Raised when the server receives a message from a client. static CEvent::Type getMessageReceivedEvent(); //! Raised when the client disconnects from the server. static CEvent::Type getDisconnectedEvent(); void handleData(const CEvent&, void*); void handleDisconnect(const CEvent&, void*); void handleWriteError(const CEvent&, void*); CIpcHelloMessage* parseHello(); CIpcCommandMessage* parseCommand(); void disconnect(); private: synergy::IStream& m_stream; EIpcClientType m_clientType; bool m_disconnecting; CArchMutex m_readMutex; CArchMutex m_writeMutex; static CEvent::Type s_messageReceivedEvent; static CEvent::Type s_disconnectedEvent; }; synergy-1.4.12-Source/src/lib/ipc/CIpcLogOutputter.cpp0000600000175000017500000001016212021261364022534 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcLogOutputter.h" #include "CIpcServer.h" #include "CIpcMessage.h" #include "Ipc.h" #include "CEvent.h" #include "CEventQueue.h" #include "TMethodEventJob.h" #include "CIpcClientProxy.h" #include "CArch.h" #include "CThread.h" #include "TMethodJob.h" #include "XArch.h" // limit number of log lines sent in one message. #define MAX_SEND 100 CIpcLogOutputter::CIpcLogOutputter(CIpcServer& ipcServer) : m_ipcServer(ipcServer), m_bufferMutex(ARCH->newMutex()), m_sending(false), m_running(true), m_notifyCond(ARCH->newCondVar()), m_notifyMutex(ARCH->newMutex()), m_bufferWaiting(false) { m_bufferThread = new CThread(new TMethodJob( this, &CIpcLogOutputter::bufferThread)); } CIpcLogOutputter::~CIpcLogOutputter() { m_running = false; notifyBuffer(); m_bufferThread->wait(5); ARCH->closeMutex(m_bufferMutex); delete m_bufferThread; ARCH->closeCondVar(m_notifyCond); ARCH->closeMutex(m_notifyMutex); } void CIpcLogOutputter::open(const char* title) { } void CIpcLogOutputter::close() { } void CIpcLogOutputter::show(bool showIfEmpty) { } bool CIpcLogOutputter::write(ELevel level, const char* text) { return write(level, text, false); } bool CIpcLogOutputter::write(ELevel, const char* text, bool force) { // TODO: discard based on thread id? hmm... // sending the buffer generates log messages, which we must throw // away (otherwise this would cause recursion). this is just a drawback // of logging this way. there is also the risk that this could throw // away log messages not generated by the ipc, but it seems like it // would be difficult to distinguish (other than looking at the stack // trace somehow). perhaps a file stream might be a better option :-/ if (m_sending && !force) { // ignore events from the buffer thread (would cause recursion). if (CThread::getCurrentThread().getID() == m_bufferThreadId) { return true; } } appendBuffer(text); notifyBuffer(); return true; } void CIpcLogOutputter::appendBuffer(const CString& text) { CArchMutexLock lock(m_bufferMutex); m_buffer.push(text); } void CIpcLogOutputter::bufferThread(void*) { CArchMutexLock lock(m_notifyMutex); m_bufferThreadId = m_bufferThread->getID(); try { while (m_running) { if (m_ipcServer.hasClients(kIpcClientGui)) { // buffer is sent in chunks, so keep sending until it's // empty (or the program has stopped in the meantime). while (m_running && !m_buffer.empty()) { sendBuffer(); } } // program may be stopping while we were in the send loop. if (!m_running) { break; } m_bufferWaiting = true; ARCH->waitCondVar(m_notifyCond, m_notifyMutex, -1); m_bufferWaiting = false; } } catch (XArch& e) { LOG((CLOG_ERR "ipc log buffer thread error, %s", e.what().c_str())); } LOG((CLOG_DEBUG "ipc log buffer thread finished")); } void CIpcLogOutputter::notifyBuffer() { if (!m_bufferWaiting) { return; } CArchMutexLock lock(m_notifyMutex); ARCH->broadcastCondVar(m_notifyCond); } CString CIpcLogOutputter::getChunk(size_t count) { CArchMutexLock lock(m_bufferMutex); if (m_buffer.size() < count) { count = m_buffer.size(); } CString chunk; for (size_t i = 0; i < count; i++) { chunk.append(m_buffer.front()); chunk.append("\n"); m_buffer.pop(); } return chunk; } void CIpcLogOutputter::sendBuffer() { CIpcLogLineMessage message(getChunk(MAX_SEND)); m_sending = true; m_ipcServer.send(message, kIpcClientGui); m_sending = false; } synergy-1.4.12-Source/src/lib/ipc/CIpcLogOutputter.h0000600000175000017500000000367512021261364022214 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "ILogOutputter.h" #include "CArch.h" #include #include "IArchMultithread.h" class CIpcServer; class CEvent; class CIpcClientProxy; //! Write log to GUI over IPC /*! This outputter writes output to the GUI via IPC. */ class CIpcLogOutputter : public ILogOutputter { public: CIpcLogOutputter(CIpcServer& ipcServer); virtual ~CIpcLogOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); //! Same as write, but allows message to sidestep anti-recursion mechanism. bool write(ELevel level, const char* text, bool force); //! Notify that the buffer should be sent. void notifyBuffer(); private: void bufferThread(void*); CString getChunk(size_t count); void sendBuffer(); void appendBuffer(const CString& text); private: typedef std::queue CBuffer; CIpcServer& m_ipcServer; CBuffer m_buffer; CArchMutex m_bufferMutex; bool m_sending; CThread* m_bufferThread; bool m_running; CArchCond m_notifyCond; CArchMutex m_notifyMutex; bool m_bufferWaiting; IArchMultithread::ThreadID m_bufferThreadId; }; synergy-1.4.12-Source/src/lib/ipc/CIpcMessage.cpp0000600000175000017500000000274212021261364021450 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcMessage.h" #include "Ipc.h" CIpcMessage::CIpcMessage(UInt8 type) : m_type(type) { } CIpcMessage::~CIpcMessage() { } CIpcHelloMessage::CIpcHelloMessage(EIpcClientType clientType) : CIpcMessage(kIpcHello), m_clientType(clientType) { } CIpcHelloMessage::~CIpcHelloMessage() { } CIpcShutdownMessage::CIpcShutdownMessage() : CIpcMessage(kIpcShutdown) { } CIpcShutdownMessage::~CIpcShutdownMessage() { } CIpcLogLineMessage::CIpcLogLineMessage(const CString& logLine) : CIpcMessage(kIpcLogLine), m_logLine(logLine) { } CIpcLogLineMessage::~CIpcLogLineMessage() { } CIpcCommandMessage::CIpcCommandMessage(const CString& command, bool elevate) : CIpcMessage(kIpcCommand), m_command(command), m_elevate(elevate) { } CIpcCommandMessage::~CIpcCommandMessage() { } synergy-1.4.12-Source/src/lib/ipc/CIpcMessage.h0000600000175000017500000000403212021261364021107 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "BasicTypes.h" #include "CString.h" #include "Ipc.h" #include "CEvent.h" class CIpcMessage : public CEventData { public: virtual ~CIpcMessage(); //! Gets the message type ID. UInt8 type() const { return m_type; } protected: CIpcMessage(UInt8 type); private: UInt8 m_type; }; class CIpcHelloMessage : public CIpcMessage { public: CIpcHelloMessage(EIpcClientType clientType); virtual ~CIpcHelloMessage(); //! Gets the message type ID. EIpcClientType clientType() const { return m_clientType; } private: EIpcClientType m_clientType; }; class CIpcShutdownMessage : public CIpcMessage { public: CIpcShutdownMessage(); virtual ~CIpcShutdownMessage(); }; class CIpcLogLineMessage : public CIpcMessage { public: CIpcLogLineMessage(const CString& logLine); virtual ~CIpcLogLineMessage(); //! Gets the log line. CString logLine() const { return m_logLine; } private: CString m_logLine; }; class CIpcCommandMessage : public CIpcMessage { public: CIpcCommandMessage(const CString& command, bool elevate); virtual ~CIpcCommandMessage(); //! Gets the command. CString command() const { return m_command; } //! Gets whether or not the process should be elevated on MS Windows. bool elevate() const { return m_elevate; } private: CString m_command; bool m_elevate; }; synergy-1.4.12-Source/src/lib/ipc/CIpcServer.cpp0000600000175000017500000001072012021261364021325 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcServer.h" #include "Ipc.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "CEvent.h" #include "CLog.h" #include "CIpcClientProxy.h" #include "IStream.h" #include "IDataSocket.h" #include "CIpcMessage.h" CEvent::Type CIpcServer::s_clientConnectedEvent = CEvent::kUnknown; CEvent::Type CIpcServer::s_messageReceivedEvent = CEvent::kUnknown; CIpcServer::CIpcServer() : m_address(CNetworkAddress(IPC_HOST, IPC_PORT)) { init(); } CIpcServer::CIpcServer(int port) : m_address(CNetworkAddress(IPC_HOST, port)) { init(); } void CIpcServer::init() { m_clientsMutex = ARCH->newMutex(); m_address.resolve(); EVENTQUEUE->adoptHandler( IListenSocket::getConnectingEvent(), &m_socket, new TMethodEventJob( this, &CIpcServer::handleClientConnecting)); } CIpcServer::~CIpcServer() { ARCH->lockMutex(m_clientsMutex); CClientList::iterator it; for (it = m_clients.begin(); it != m_clients.end(); it++) { deleteClient(*it); } m_clients.empty(); ARCH->unlockMutex(m_clientsMutex); ARCH->closeMutex(m_clientsMutex); EVENTQUEUE->removeHandler(m_socket.getConnectingEvent(), &m_socket); } void CIpcServer::listen() { m_socket.bind(m_address); } void CIpcServer::handleClientConnecting(const CEvent&, void*) { synergy::IStream* stream = m_socket.accept(); if (stream == NULL) { return; } LOG((CLOG_DEBUG "accepted ipc client connection")); ARCH->lockMutex(m_clientsMutex); CIpcClientProxy* proxy = new CIpcClientProxy(*stream); m_clients.push_back(proxy); ARCH->unlockMutex(m_clientsMutex); EVENTQUEUE->adoptHandler( CIpcClientProxy::getDisconnectedEvent(), proxy, new TMethodEventJob( this, &CIpcServer::handleClientDisconnected)); EVENTQUEUE->adoptHandler( CIpcClientProxy::getMessageReceivedEvent(), proxy, new TMethodEventJob( this, &CIpcServer::handleMessageReceived)); EVENTQUEUE->addEvent(CEvent( getClientConnectedEvent(), this, proxy, CEvent::kDontFreeData)); } void CIpcServer::handleClientDisconnected(const CEvent& e, void*) { CIpcClientProxy* proxy = static_cast(e.getTarget()); CArchMutexLock lock(m_clientsMutex); m_clients.remove(proxy); deleteClient(proxy); LOG((CLOG_DEBUG "ipc client proxy removed, connected=%d", m_clients.size())); } void CIpcServer::handleMessageReceived(const CEvent& e, void*) { CEvent event(getMessageReceivedEvent(), this); event.setDataObject(e.getDataObject()); EVENTQUEUE->addEvent(event); } void CIpcServer::deleteClient(CIpcClientProxy* proxy) { EVENTQUEUE->removeHandler(CIpcClientProxy::getMessageReceivedEvent(), proxy); EVENTQUEUE->removeHandler(CIpcClientProxy::getDisconnectedEvent(), proxy); delete proxy; } bool CIpcServer::hasClients(EIpcClientType clientType) const { CArchMutexLock lock(m_clientsMutex); if (m_clients.empty()) { return false; } CClientList::const_iterator it; for (it = m_clients.begin(); it != m_clients.end(); it++) { // at least one client is alive and type matches, there are clients. CIpcClientProxy* p = *it; if (!p->m_disconnecting && p->m_clientType == clientType) { return true; } } // all clients must be disconnecting, no active clients. return false; } CEvent::Type CIpcServer::getClientConnectedEvent() { return EVENTQUEUE->registerTypeOnce( s_clientConnectedEvent, "CIpcServer::clientConnected"); } CEvent::Type CIpcServer::getMessageReceivedEvent() { return EVENTQUEUE->registerTypeOnce( s_messageReceivedEvent, "CIpcServer::messageReceived"); } void CIpcServer::send(const CIpcMessage& message, EIpcClientType filterType) { CArchMutexLock lock(m_clientsMutex); CClientList::iterator it; for (it = m_clients.begin(); it != m_clients.end(); it++) { CIpcClientProxy* proxy = *it; if (proxy->m_clientType == filterType) { proxy->send(message); } } } synergy-1.4.12-Source/src/lib/ipc/CIpcServer.h0000600000175000017500000000467112021261364021002 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CTCPListenSocket.h" #include "CNetworkAddress.h" #include "Ipc.h" #include #include "CArch.h" class CEvent; class CIpcClientProxy; class CIpcMessage; //! IPC server for communication between daemon and GUI. /*! The IPC server listens on localhost. The IPC client runs on both the client/server process or the GUI. The IPC server runs on the daemon process. This allows the GUI to send config changes to the daemon and client/server, and allows the daemon and client/server to send log data to the GUI. */ class CIpcServer { public: CIpcServer(); CIpcServer(int port); virtual ~CIpcServer(); //! @name manipulators //@{ //! Opens a TCP socket only allowing local connections. void listen(); //! Send a message to all clients matching the filter type. void send(const CIpcMessage& message, EIpcClientType filterType); //@} //! @name accessors //@{ //! Returns true when there are clients of the specified type connected. bool hasClients(EIpcClientType clientType) const; //! Raised when we have created the client proxy. static CEvent::Type getClientConnectedEvent(); //! Raised when a message is received through a client proxy. static CEvent::Type getMessageReceivedEvent(); //@} private: void init(); void handleClientConnecting(const CEvent&, void*); void handleClientDisconnected(const CEvent&, void*); void handleMessageReceived(const CEvent&, void*); void deleteClient(CIpcClientProxy* proxy); private: typedef std::list CClientList; CTCPListenSocket m_socket; CNetworkAddress m_address; CClientList m_clients; CArchMutex m_clientsMutex; static CEvent::Type s_clientConnectedEvent; static CEvent::Type s_messageReceivedEvent; }; synergy-1.4.12-Source/src/lib/ipc/CIpcServerProxy.cpp0000600000175000017500000000627612021261364022402 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CIpcServerProxy.h" #include "IStream.h" #include "TMethodEventJob.h" #include "CLog.h" #include "CIpcMessage.h" #include "Ipc.h" #include "CProtocolUtil.h" CEvent::Type CIpcServerProxy::s_messageReceivedEvent = CEvent::kUnknown; CIpcServerProxy::CIpcServerProxy(synergy::IStream& stream) : m_stream(stream) { EVENTQUEUE->adoptHandler(m_stream.getInputReadyEvent(), stream.getEventTarget(), new TMethodEventJob( this, &CIpcServerProxy::handleData)); } CIpcServerProxy::~CIpcServerProxy() { EVENTQUEUE->removeHandler(m_stream.getInputReadyEvent(), m_stream.getEventTarget()); } void CIpcServerProxy::handleData(const CEvent&, void*) { LOG((CLOG_DEBUG "start ipc handle data")); UInt8 code[4]; UInt32 n = m_stream.read(code, 4); while (n != 0) { LOG((CLOG_DEBUG "ipc read: %c%c%c%c", code[0], code[1], code[2], code[3])); CIpcMessage* m = nullptr; if (memcmp(code, kIpcMsgLogLine, 4) == 0) { m = parseLogLine(); } else if (memcmp(code, kIpcMsgShutdown, 4) == 0) { m = new CIpcShutdownMessage(); } else { LOG((CLOG_ERR "invalid ipc message")); disconnect(); } // don't delete with this event; the data is passed to a new event. CEvent e(getMessageReceivedEvent(), this, NULL, CEvent::kDontFreeData); e.setDataObject(m); EVENTQUEUE->addEvent(e); n = m_stream.read(code, 4); } LOG((CLOG_DEBUG "finished ipc handle data")); } void CIpcServerProxy::send(const CIpcMessage& message) { LOG((CLOG_DEBUG "ipc write: %d", message.type())); switch (message.type()) { case kIpcHello: { const CIpcHelloMessage& hm = static_cast(message); CProtocolUtil::writef(&m_stream, kIpcMsgHello, hm.clientType()); break; } case kIpcCommand: { const CIpcCommandMessage& cm = static_cast(message); CString command = cm.command(); CProtocolUtil::writef(&m_stream, kIpcMsgCommand, &command); break; } default: LOG((CLOG_ERR "ipc message not supported: %d", message.type())); break; } } CIpcLogLineMessage* CIpcServerProxy::parseLogLine() { CString logLine; CProtocolUtil::readf(&m_stream, kIpcMsgLogLine + 4, &logLine); // must be deleted by event handler. return new CIpcLogLineMessage(logLine); } void CIpcServerProxy::disconnect() { LOG((CLOG_DEBUG "ipc disconnect, closing stream")); m_stream.close(); } CEvent::Type CIpcServerProxy::getMessageReceivedEvent() { return EVENTQUEUE->registerTypeOnce( s_messageReceivedEvent, "CIpcServerProxy::messageReceived"); } synergy-1.4.12-Source/src/lib/ipc/CIpcServerProxy.h0000600000175000017500000000247212021261364022041 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CEvent.h" namespace synergy { class IStream; } class CIpcMessage; class CIpcLogLineMessage; class CIpcServerProxy { friend class CIpcClient; public: CIpcServerProxy(synergy::IStream& stream); virtual ~CIpcServerProxy(); private: void send(const CIpcMessage& message); void handleData(const CEvent&, void*); CIpcLogLineMessage* parseLogLine(); void disconnect(); //! Raised when the client receives a message from the server. static CEvent::Type getMessageReceivedEvent(); private: synergy::IStream& m_stream; static CEvent::Type s_messageReceivedEvent; }; synergy-1.4.12-Source/src/lib/ipc/CMakeLists.txt0000600000175000017500000000236612021261364021363 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc Ipc.h CIpcServer.h CIpcClient.h CIpcServerProxy.h CIpcClientProxy.h CIpcMessage.h CIpcLogOutputter.h ) set(src Ipc.cpp CIpcServer.cpp CIpcClient.cpp CIpcServerProxy.cpp CIpcClientProxy.cpp CIpcMessage.cpp CIpcLogOutputter.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ../io ../mt ../net ../synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(ipc STATIC ${src}) if (UNIX) target_link_libraries(ipc arch base common mt io net synergy) endif() synergy-1.4.12-Source/src/lib/ipc/Ipc.cpp0000600000175000017500000000162712021261364020041 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "Ipc.h" const char* kIpcMsgHello = "IHEL%1i"; const char* kIpcMsgLogLine = "ILOG%s"; const char* kIpcMsgCommand = "ICMD%s%1i"; const char* kIpcMsgShutdown = "ISDN"; synergy-1.4.12-Source/src/lib/ipc/Ipc.h0000600000175000017500000000304512021261364017502 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #define IPC_HOST "127.0.0.1" #define IPC_PORT 24801 enum EIpcMessage { kIpcHello, kIpcLogLine, kIpcCommand, kIpcShutdown, }; enum EIpcClientType { kIpcClientUnknown, kIpcClientGui, kIpcClientNode, }; // handshake: node/gui -> daemon // $1 = type, the client identifies it's self as gui or node (synergyc/s). extern const char* kIpcMsgHello; // log line: daemon -> gui // $1 = aggregate log lines collected from synergys/c or the daemon itself. extern const char* kIpcMsgLogLine; // command: gui -> daemon // $1 = command; the command for the daemon to launch, typically the full // path to synergys/c. $2 = true when process must be elevated on ms windows. extern const char* kIpcMsgCommand; // shutdown: daemon -> node // the daemon tells synergys/c to shut down gracefully. extern const char* kIpcMsgShutdown; synergy-1.4.12-Source/src/lib/mt/0000700000175000017500000000000012140644175016466 5ustar synergysynergysynergy-1.4.12-Source/src/lib/mt/CCondVar.cpp0000600000175000017500000000316012021261364020624 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CCondVar.h" #include "CStopwatch.h" #include "CArch.h" // // CCondVarBase // CCondVarBase::CCondVarBase(CMutex* mutex) : m_mutex(mutex) { assert(m_mutex != NULL); m_cond = ARCH->newCondVar(); } CCondVarBase::~CCondVarBase() { ARCH->closeCondVar(m_cond); } void CCondVarBase::lock() const { m_mutex->lock(); } void CCondVarBase::unlock() const { m_mutex->unlock(); } void CCondVarBase::signal() { ARCH->signalCondVar(m_cond); } void CCondVarBase::broadcast() { ARCH->broadcastCondVar(m_cond); } bool CCondVarBase::wait(CStopwatch& timer, double timeout) const { // check timeout against timer if (timeout >= 0.0) { timeout -= timer.getTime(); if (timeout < 0.0) return false; } return wait(timeout); } bool CCondVarBase::wait(double timeout) const { return ARCH->waitCondVar(m_cond, m_mutex->m_mutex, timeout); } CMutex* CCondVarBase::getMutex() const { return m_mutex; } synergy-1.4.12-Source/src/lib/mt/CCondVar.h0000600000175000017500000001155612021261364020301 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCONDVAR_H #define CCONDVAR_H #include "CMutex.h" #include "BasicTypes.h" class CStopwatch; //! Generic condition variable /*! This class provides functionality common to all condition variables but doesn't provide the actual variable storage. A condition variable is a multiprocessing primitive that can be waited on. Every condition variable has an associated mutex. */ class CCondVarBase { public: /*! \c mutex must not be NULL. All condition variables have an associated mutex. The mutex needn't be unique to one condition variable. */ CCondVarBase(CMutex* mutex); ~CCondVarBase(); //! @name manipulators //@{ //! Lock the condition variable's mutex /*! Lock the condition variable's mutex. The condition variable should be locked before reading or writing it. It must be locked for a call to wait(). Locks are not recursive; locking a locked mutex will deadlock the thread. */ void lock() const; //! Unlock the condition variable's mutex void unlock() const; //! Signal the condition variable /*! Wake up one waiting thread, if there are any. Which thread gets woken is undefined. */ void signal(); //! Signal the condition variable /*! Wake up all waiting threads, if any. */ void broadcast(); //@} //! @name accessors //@{ //! Wait on the condition variable /*! Wait on the condition variable. If \c timeout < 0 then wait until signalled, otherwise up to \c timeout seconds or until signalled, whichever comes first. Returns true if the object was signalled during the wait, false otherwise. The proper way to wait for a condition is: \code cv.lock(); while (cv-expr) { cv.wait(); } cv.unlock(); \endcode where \c cv-expr involves the value of \c cv and is false when the condition is satisfied. (cancellation point) */ bool wait(double timeout = -1.0) const; //! Wait on the condition variable /*! Same as \c wait(double) but use \c timer to compare against \c timeout. Since clients normally wait on condition variables in a loop, clients can use this to avoid recalculating \c timeout on each iteration. Passing a stopwatch with a negative \c timeout is pointless (it will never time out) but permitted. (cancellation point) */ bool wait(CStopwatch& timer, double timeout) const; //! Get the mutex /*! Get the mutex passed to the c'tor. */ CMutex* getMutex() const; //@} private: // not implemented CCondVarBase(const CCondVarBase&); CCondVarBase& operator=(const CCondVarBase&); private: CMutex* m_mutex; CArchCond m_cond; }; //! Condition variable /*! A condition variable with storage for type \c T. */ template class CCondVar : public CCondVarBase { public: //! Initialize using \c value CCondVar(CMutex* mutex, const T& value); //! Initialize using another condition variable's value CCondVar(const CCondVar&); ~CCondVar(); //! @name manipulators //@{ //! Assigns the value of \c cv to this /*! Set the variable's value. The condition variable should be locked before calling this method. */ CCondVar& operator=(const CCondVar& cv); //! Assigns \c value to this /*! Set the variable's value. The condition variable should be locked before calling this method. */ CCondVar& operator=(const T& v); //@} //! @name accessors //@{ //! Get the variable's value /*! Get the variable's value. The condition variable should be locked before calling this method. */ operator const volatile T&() const; //@} private: volatile T m_data; }; template inline CCondVar::CCondVar( CMutex* mutex, const T& data) : CCondVarBase(mutex), m_data(data) { // do nothing } template inline CCondVar::CCondVar( const CCondVar& cv) : CCondVarBase(cv.getMutex()), m_data(cv.m_data) { // do nothing } template inline CCondVar::~CCondVar() { // do nothing } template inline CCondVar& CCondVar::operator=(const CCondVar& cv) { m_data = cv.m_data; return *this; } template inline CCondVar& CCondVar::operator=(const T& data) { m_data = data; return *this; } template inline CCondVar::operator const volatile T&() const { return m_data; } #endif synergy-1.4.12-Source/src/lib/mt/CLock.cpp0000600000175000017500000000176712021261364020173 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CLock.h" #include "CCondVar.h" #include "CMutex.h" // // CLock // CLock::CLock(const CMutex* mutex) : m_mutex(mutex) { m_mutex->lock(); } CLock::CLock(const CCondVarBase* cv) : m_mutex(cv->getMutex()) { m_mutex->lock(); } CLock::~CLock() { m_mutex->unlock(); } synergy-1.4.12-Source/src/lib/mt/CLock.h0000600000175000017500000000267012021261364017632 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CLOCK_H #define CLOCK_H #include "common.h" class CMutex; class CCondVarBase; //! Mutual exclusion lock utility /*! This class locks a mutex or condition variable in the c'tor and unlocks it in the d'tor. It's easier and safer than manually locking and unlocking since unlocking must usually be done no matter how a function exits (including by unwinding due to an exception). */ class CLock { public: //! Lock the mutex \c mutex CLock(const CMutex* mutex); //! Lock the condition variable \c cv CLock(const CCondVarBase* cv); //! Unlock the mutex or condition variable ~CLock(); private: // not implemented CLock(const CLock&); CLock& operator=(const CLock&); private: const CMutex* m_mutex; }; #endif synergy-1.4.12-Source/src/lib/mt/CMakeLists.txt0000600000175000017500000000203612021261364021222 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CCondVar.h CLock.h CMutex.h CThread.h XMT.h XThread.h ) set(src CCondVar.cpp CLock.cpp CMutex.cpp CThread.cpp XMT.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ../synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(mt STATIC ${src}) synergy-1.4.12-Source/src/lib/mt/CMutex.cpp0000600000175000017500000000216212021261364020373 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMutex.h" #include "CArch.h" // // CMutex // CMutex::CMutex() { m_mutex = ARCH->newMutex(); } CMutex::CMutex(const CMutex&) { m_mutex = ARCH->newMutex(); } CMutex::~CMutex() { ARCH->closeMutex(m_mutex); } CMutex& CMutex::operator=(const CMutex&) { return *this; } void CMutex::lock() const { ARCH->lockMutex(m_mutex); } void CMutex::unlock() const { ARCH->unlockMutex(m_mutex); } synergy-1.4.12-Source/src/lib/mt/CMutex.h0000600000175000017500000000406612021261364020045 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMUTEX_H #define CMUTEX_H #include "IArchMultithread.h" //! Mutual exclusion /*! A non-recursive mutual exclusion object. Only one thread at a time can hold a lock on a mutex. Any thread that attempts to lock a locked mutex will block until the mutex is unlocked. At that time, if any threads are blocked, exactly one waiting thread will acquire the lock and continue running. A thread may not lock a mutex it already owns the lock on; if it tries it will deadlock itself. */ class CMutex { public: CMutex(); //! Equivalent to default c'tor /*! Copy c'tor doesn't copy anything. It just makes it possible to copy objects that contain a mutex. */ CMutex(const CMutex&); ~CMutex(); //! @name manipulators //@{ //! Does nothing /*! This does nothing. It just makes it possible to assign objects that contain a mutex. */ CMutex& operator=(const CMutex&); //@} //! @name accessors //@{ //! Lock the mutex /*! Locks the mutex, which must not have been previously locked by the calling thread. This blocks if the mutex is already locked by another thread. (cancellation point) */ void lock() const; //! Unlock the mutex /*! Unlocks the mutex, which must have been previously locked by the calling thread. */ void unlock() const; //@} private: friend class CCondVarBase; CArchMutex m_mutex; }; #endif synergy-1.4.12-Source/src/lib/mt/CThread.cpp0000600000175000017500000000664012021261364020505 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CThread.h" #include "XMT.h" #include "XThread.h" #include "CLog.h" #include "IJob.h" #include "CArch.h" // // CThread // CThread::CThread(IJob* job) { m_thread = ARCH->newThread(&CThread::threadFunc, job); if (m_thread == NULL) { // couldn't create thread delete job; throw XMTThreadUnavailable(); } } CThread::CThread(const CThread& thread) { m_thread = ARCH->copyThread(thread.m_thread); } CThread::CThread(CArchThread adoptedThread) { m_thread = adoptedThread; } CThread::~CThread() { ARCH->closeThread(m_thread); } CThread& CThread::operator=(const CThread& thread) { // copy given thread and release ours CArchThread copy = ARCH->copyThread(thread.m_thread); ARCH->closeThread(m_thread); // cut over m_thread = copy; return *this; } void CThread::exit(void* result) { throw XThreadExit(result); } void CThread::cancel() { ARCH->cancelThread(m_thread); } void CThread::setPriority(int n) { ARCH->setPriorityOfThread(m_thread, n); } void CThread::unblockPollSocket() { ARCH->unblockPollSocket(m_thread); } CThread CThread::getCurrentThread() { return CThread(ARCH->newCurrentThread()); } void CThread::testCancel() { ARCH->testCancelThread(); } bool CThread::wait(double timeout) const { return ARCH->wait(m_thread, timeout); } void* CThread::getResult() const { if (wait()) return ARCH->getResultOfThread(m_thread); else return NULL; } IArchMultithread::ThreadID CThread::getID() const { return ARCH->getIDOfThread(m_thread); } bool CThread::operator==(const CThread& thread) const { return ARCH->isSameThread(m_thread, thread.m_thread); } bool CThread::operator!=(const CThread& thread) const { return !ARCH->isSameThread(m_thread, thread.m_thread); } void* CThread::threadFunc(void* vjob) { // get this thread's id for logging IArchMultithread::ThreadID id; { CArchThread thread = ARCH->newCurrentThread(); id = ARCH->getIDOfThread(thread); ARCH->closeThread(thread); } // get job IJob* job = reinterpret_cast(vjob); // run job void* result = NULL; try { // go LOG((CLOG_DEBUG1 "thread 0x%08x entry", id)); job->run(); LOG((CLOG_DEBUG1 "thread 0x%08x exit", id)); } catch (XThreadCancel&) { // client called cancel() LOG((CLOG_DEBUG1 "caught cancel on thread 0x%08x", id)); delete job; throw; } catch (XThreadExit& e) { // client called exit() result = e.m_result; LOG((CLOG_DEBUG1 "caught exit on thread 0x%08x, result %p", id, result)); } catch (XBase& e) { LOG((CLOG_ERR "exception on thread 0x%08x: %s", id, e.what())); delete job; throw; } catch (...) { LOG((CLOG_ERR "exception on thread 0x%08x: ", id)); delete job; throw; } // done with job delete job; // return exit result return result; } synergy-1.4.12-Source/src/lib/mt/CThread.h0000600000175000017500000001510712021261364020150 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CTHREAD_H #define CTHREAD_H #include "IArchMultithread.h" class IJob; //! Thread handle /*! Creating a CThread creates a new context of execution (i.e. thread) that runs simulatenously with the calling thread. A CThread is only a handle to a thread; deleting a CThread does not cancel or destroy the thread it refers to and multiple CThread objects can refer to the same thread. Threads can terminate themselves but cannot be forced to terminate by other threads. However, other threads can signal a thread to terminate itself by cancelling it. And a thread can wait (block) on another thread to terminate. Most functions that can block for an arbitrary time are cancellation points. A cancellation point is a function that can be interrupted by a request to cancel the thread. Cancellation points are noted in the documentation. */ // note -- do not derive from this class class CThread { public: //! Run \c adoptedJob in a new thread /*! Create and start a new thread executing the \c adoptedJob. The new thread takes ownership of \c adoptedJob and will delete it. */ CThread(IJob* adoptedJob); //! Duplicate a thread handle /*! Make a new thread object that refers to an existing thread. This does \b not start a new thread. */ CThread(const CThread&); //! Release a thread handle /*! Release a thread handle. This does not terminate the thread. A thread will keep running until the job completes or calls exit() or allows itself to be cancelled. */ ~CThread(); //! @name manipulators //@{ //! Assign thread handle /*! Assign a thread handle. This has no effect on the threads, it simply makes this thread object refer to another thread. It does \b not start a new thread. */ CThread& operator=(const CThread&); //! Terminate the calling thread /*! Terminate the calling thread. This function does not return but the stack is unwound and automatic objects are destroyed, as if exit() threw an exception (which is, in fact, what it does). The argument is saved as the result returned by getResult(). If you have \c catch(...) blocks then you should add the following before each to avoid catching the exit: \code catch(CThreadExit&) { throw; } \endcode or add the \c RETHROW_XTHREAD macro to the \c catch(...) block. */ static void exit(void*); //! Cancel thread /*! Cancel the thread. cancel() never waits for the thread to terminate; it just posts the cancel and returns. A thread will terminate when it enters a cancellation point with cancellation enabled. If cancellation is disabled then the cancel is remembered but not acted on until the first call to a cancellation point after cancellation is enabled. A cancellation point is a function that can act on cancellation. A cancellation point does not return if there's a cancel pending. Instead, it unwinds the stack and destroys automatic objects, as if cancel() threw an exception (which is, in fact, what it does). Threads must take care to unlock and clean up any resources they may have, especially mutexes. They can \c catch(XThreadCancel) to do that then rethrow the exception or they can let it happen automatically by doing clean up in the d'tors of automatic objects (like CLock). Clients are strongly encouraged to do the latter. During cancellation, further cancel() calls are ignored (i.e. a thread cannot be interrupted by a cancel during cancellation). Clients that \c catch(XThreadCancel) must always rethrow the exception. Clients that \c catch(...) must either rethrow the exception or include a \c catch(XThreadCancel) handler that rethrows. The \c RETHROW_XTHREAD macro may be useful for that. */ void cancel(); //! Change thread priority /*! Change the priority of the thread. Normal priority is 0, 1 is the next lower, etc. -1 is the next higher, etc. but boosting the priority may not be permitted and will be silenty ignored. */ void setPriority(int n); //! Force pollSocket() to return /*! Forces a currently blocked pollSocket() in the thread to return immediately. */ void unblockPollSocket(); //@} //! @name accessors //@{ //! Get current thread's handle /*! Return a CThread object representing the calling thread. */ static CThread getCurrentThread(); //! Test for cancellation /*! testCancel() does nothing but is a cancellation point. Call this to make a function itself a cancellation point. If the thread was cancelled and cancellation is enabled this will cause the thread to unwind the stack and terminate. (cancellation point) */ static void testCancel(); //! Wait for thread to terminate /*! Waits for the thread to terminate (by exit() or cancel() or by returning from the thread job) for up to \c timeout seconds, returning true if the thread terminated and false otherwise. This returns immediately with false if called by a thread on itself and immediately with true if the thread has already terminated. This will wait forever if \c timeout < 0.0. (cancellation point) */ bool wait(double timeout = -1.0) const; //! Get the exit result /*! Returns the exit result. This does an implicit wait(). It returns NULL immediately if called by a thread on itself or on a thread that was cancelled. (cancellation point) */ void* getResult() const; //! Get the thread id /*! Returns an integer id for this thread. This id must not be used to check if two CThread objects refer to the same thread. Use operator==() for that. */ IArchMultithread::ThreadID getID() const; //! Compare thread handles /*! Returns true if two CThread objects refer to the same thread. */ bool operator==(const CThread&) const; //! Compare thread handles /*! Returns true if two CThread objects do not refer to the same thread. */ bool operator!=(const CThread&) const; //@} private: CThread(CArchThread); static void* threadFunc(void*); private: CArchThread m_thread; }; #endif synergy-1.4.12-Source/src/lib/mt/XMT.cpp0000600000175000017500000000161212021261364017635 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XMT.h" // // XMTThreadUnavailable // CString XMTThreadUnavailable::getWhat() const throw() { return format("XMTThreadUnavailable", "cannot create thread"); } synergy-1.4.12-Source/src/lib/mt/XMT.h0000600000175000017500000000172712021261364017311 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XMT_H #define XMT_H #include "XBase.h" //! Generic multithreading exception XBASE_SUBCLASS(XMT, XBase); //! Thread creation exception /*! Thrown when a thread cannot be created. */ XBASE_SUBCLASS_WHAT(XMTThreadUnavailable, XMT); #endif synergy-1.4.12-Source/src/lib/mt/XThread.h0000600000175000017500000000223412021261364020172 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XTHREAD_H #define XTHREAD_H #include "XArch.h" //! Thread exception to exit /*! Thrown by CThread::exit() to exit a thread. Clients of CThread must not throw this type but must rethrow it if caught (by XThreadExit, XThread, or ...). */ class XThreadExit : public XThread { public: //! \c result is the result of the thread XThreadExit(void* result) : m_result(result) { } ~XThreadExit() { } public: void* m_result; }; #endif synergy-1.4.12-Source/src/lib/net/0000700000175000017500000000000012140644175016634 5ustar synergysynergysynergy-1.4.12-Source/src/lib/net/CMakeLists.txt0000600000175000017500000000256312021261364021375 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CNetworkAddress.h CSocketMultiplexer.h CTCPListenSocket.h CTCPSocket.h CTCPSocketFactory.h IDataSocket.h IListenSocket.h ISocket.h ISocketFactory.h ISocketMultiplexerJob.h TSocketMultiplexerMethodJob.h XSocket.h ) set(src CNetworkAddress.cpp CSocketMultiplexer.cpp CTCPListenSocket.cpp CTCPSocket.cpp CTCPSocketFactory.cpp IDataSocket.cpp IListenSocket.cpp ISocket.cpp XSocket.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ../io ../mt ../synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(net STATIC ${src}) if (UNIX) target_link_libraries(net mt io) endif() synergy-1.4.12-Source/src/lib/net/CNetworkAddress.cpp0000600000175000017500000001163212021261364022400 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CNetworkAddress.h" #include "XSocket.h" #include "CArch.h" #include "XArch.h" #include // // CNetworkAddress // // name re-resolution adapted from a patch by Brent Priddy. CNetworkAddress::CNetworkAddress() : m_address(NULL), m_hostname(), m_port(0) { // note -- make no calls to CNetwork socket interface here; // we're often called prior to CNetwork::init(). } CNetworkAddress::CNetworkAddress(int port) : m_address(NULL), m_hostname(), m_port(port) { checkPort(); m_address = ARCH->newAnyAddr(IArchNetwork::kINET); ARCH->setAddrPort(m_address, m_port); } CNetworkAddress::CNetworkAddress(const CNetworkAddress& addr) : m_address(addr.m_address != NULL ? ARCH->copyAddr(addr.m_address) : NULL), m_hostname(addr.m_hostname), m_port(addr.m_port) { // do nothing } CNetworkAddress::CNetworkAddress(const CString& hostname, int port) : m_address(NULL), m_hostname(hostname), m_port(port) { // check for port suffix CString::size_type i = m_hostname.rfind(':'); if (i != CString::npos && i + 1 < m_hostname.size()) { // found a colon. see if it looks like an IPv6 address. bool colonNotation = false; bool dotNotation = false; bool doubleColon = false; for (CString::size_type j = 0; j < i; ++j) { if (m_hostname[j] == ':') { colonNotation = true; dotNotation = false; if (m_hostname[j + 1] == ':') { doubleColon = true; } } else if (m_hostname[j] == '.' && colonNotation) { dotNotation = true; } } // port suffix is ambiguous with IPv6 notation if there's // a double colon and the end of the address is not in dot // notation. in that case we assume it's not a port suffix. // the user can replace the double colon with zeros to // disambiguate. if ((!doubleColon || dotNotation) || !colonNotation) { // parse port from hostname char* end; const char* chostname = m_hostname.c_str(); long suffixPort = strtol(chostname + i + 1, &end, 10); if (end == chostname + i + 1 || *end != '\0') { throw XSocketAddress(XSocketAddress::kBadPort, m_hostname, m_port); } // trim port from hostname m_hostname.erase(i); // save port m_port = static_cast(suffixPort); } } // check port number checkPort(); } CNetworkAddress::~CNetworkAddress() { if (m_address != NULL) { ARCH->closeAddr(m_address); } } CNetworkAddress& CNetworkAddress::operator=(const CNetworkAddress& addr) { CArchNetAddress newAddr = NULL; if (addr.m_address != NULL) { newAddr = ARCH->copyAddr(addr.m_address); } if (m_address != NULL) { ARCH->closeAddr(m_address); } m_address = newAddr; m_hostname = addr.m_hostname; m_port = addr.m_port; return *this; } void CNetworkAddress::resolve() { // discard previous address if (m_address != NULL) { ARCH->closeAddr(m_address); m_address = NULL; } try { // if hostname is empty then use wildcard address otherwise look // up the name. if (m_hostname.empty()) { m_address = ARCH->newAnyAddr(IArchNetwork::kINET); } else { m_address = ARCH->nameToAddr(m_hostname); } } catch (XArchNetworkNameUnknown&) { throw XSocketAddress(XSocketAddress::kNotFound, m_hostname, m_port); } catch (XArchNetworkNameNoAddress&) { throw XSocketAddress(XSocketAddress::kNoAddress, m_hostname, m_port); } catch (XArchNetworkNameUnsupported&) { throw XSocketAddress(XSocketAddress::kUnsupported, m_hostname, m_port); } catch (XArchNetworkName&) { throw XSocketAddress(XSocketAddress::kUnknown, m_hostname, m_port); } // set port in address ARCH->setAddrPort(m_address, m_port); } bool CNetworkAddress::operator==(const CNetworkAddress& addr) const { return ARCH->isEqualAddr(m_address, addr.m_address); } bool CNetworkAddress::operator!=(const CNetworkAddress& addr) const { return !operator==(addr); } bool CNetworkAddress::isValid() const { return (m_address != NULL); } const CArchNetAddress& CNetworkAddress::getAddress() const { return m_address; } int CNetworkAddress::getPort() const { return m_port; } CString CNetworkAddress::getHostname() const { return m_hostname; } void CNetworkAddress::checkPort() { // check port number if (m_port <= 0 || m_port > 65535) { throw XSocketAddress(XSocketAddress::kBadPort, m_hostname, m_port); } } synergy-1.4.12-Source/src/lib/net/CNetworkAddress.h0000600000175000017500000000626612021261364022054 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CNETWORKADDRESS_H #define CNETWORKADDRESS_H #include "CString.h" #include "BasicTypes.h" #include "IArchNetwork.h" //! Network address type /*! This class represents a network address. */ class CNetworkAddress { public: /*! Constructs the invalid address */ CNetworkAddress(); /*! Construct the wildcard address with the given port. \c port must not be zero. */ CNetworkAddress(int port); /*! Construct the network address for the given \c hostname and \c port. If \c hostname can be parsed as a numerical address then that's how it's used, otherwise it's used as a host name. If \c hostname ends in ":[0-9]+" then that suffix is extracted and used as the port, overridding the port parameter. The resulting port must be a valid port number (zero is not a valid port number) otherwise \c XSocketAddress is thrown with an error of \c XSocketAddress::kBadPort. The hostname is not resolved by the c'tor; use \c resolve to do that. */ CNetworkAddress(const CString& hostname, int port); CNetworkAddress(const CNetworkAddress&); ~CNetworkAddress(); CNetworkAddress& operator=(const CNetworkAddress&); //! @name manipulators //@{ //! Resolve address /*! Resolves the hostname to an address. This can be done any number of times and is done automatically by the c'tor taking a hostname. Throws XSocketAddress if resolution is unsuccessful, after which \c isValid returns false until the next call to this method. */ void resolve(); //@} //! @name accessors //@{ //! Check address equality /*! Returns true if this address is equal to \p address. */ bool operator==(const CNetworkAddress& address) const; //! Check address inequality /*! Returns true if this address is not equal to \p address. */ bool operator!=(const CNetworkAddress& address) const; //! Check address validity /*! Returns true if this is not the invalid address. */ bool isValid() const; //! Get address /*! Returns the address in the platform's native network address structure. */ const CArchNetAddress& getAddress() const; //! Get port /*! Returns the port passed to the c'tor as a suffix to the hostname, if that existed, otherwise as passed directly to the c'tor. */ int getPort() const; //! Get hostname /*! Returns the hostname passed to the c'tor sans any port suffix. */ CString getHostname() const; //@} private: void checkPort(); private: CArchNetAddress m_address; CString m_hostname; int m_port; }; #endif synergy-1.4.12-Source/src/lib/net/CSocketMultiplexer.cpp0000600000175000017500000002045212021261364023124 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CSocketMultiplexer.h" #include "ISocketMultiplexerJob.h" #include "CCondVar.h" #include "CLock.h" #include "CMutex.h" #include "CThread.h" #include "CLog.h" #include "TMethodJob.h" #include "CArch.h" #include "XArch.h" #include "stdvector.h" // // CSocketMultiplexer // CSocketMultiplexer* CSocketMultiplexer::s_instance = NULL; CSocketMultiplexer::CSocketMultiplexer() : m_mutex(new CMutex), m_thread(NULL), m_update(false), m_jobsReady(new CCondVar(m_mutex, false)), m_jobListLock(new CCondVar(m_mutex, false)), m_jobListLockLocked(new CCondVar(m_mutex, false)), m_jobListLocker(NULL), m_jobListLockLocker(NULL) { assert(s_instance == NULL); // this pointer just has to be unique and not NULL. it will // never be dereferenced. it's used to identify cursor nodes // in the jobs list. m_cursorMark = reinterpret_cast(this); // start thread m_thread = new CThread(new TMethodJob( this, &CSocketMultiplexer::serviceThread)); s_instance = this; } CSocketMultiplexer::~CSocketMultiplexer() { m_thread->cancel(); m_thread->unblockPollSocket(); m_thread->wait(); delete m_thread; delete m_jobsReady; delete m_jobListLock; delete m_jobListLockLocked; delete m_jobListLocker; delete m_jobListLockLocker; delete m_mutex; // clean up jobs for (CSocketJobMap::iterator i = m_socketJobMap.begin(); i != m_socketJobMap.end(); ++i) { delete *(i->second); } s_instance = NULL; } CSocketMultiplexer* CSocketMultiplexer::getInstance() { assert(s_instance != NULL); return s_instance; } void CSocketMultiplexer::addSocket(ISocket* socket, ISocketMultiplexerJob* job) { assert(socket != NULL); assert(job != NULL); // prevent other threads from locking the job list lockJobListLock(); // break thread out of poll m_thread->unblockPollSocket(); // lock the job list lockJobList(); // insert/replace job CSocketJobMap::iterator i = m_socketJobMap.find(socket); if (i == m_socketJobMap.end()) { // we *must* put the job at the end so the order of jobs in // the list continue to match the order of jobs in pfds in // serviceThread(). CJobCursor j = m_socketJobs.insert(m_socketJobs.end(), job); m_update = true; m_socketJobMap.insert(std::make_pair(socket, j)); } else { CJobCursor j = i->second; if (*j != job) { delete *j; *j = job; } m_update = true; } // unlock the job list unlockJobList(); } void CSocketMultiplexer::removeSocket(ISocket* socket) { assert(socket != NULL); // prevent other threads from locking the job list lockJobListLock(); // break thread out of poll m_thread->unblockPollSocket(); // lock the job list lockJobList(); // remove job. rather than removing it from the map we put NULL // in the list instead so the order of jobs in the list continues // to match the order of jobs in pfds in serviceThread(). CSocketJobMap::iterator i = m_socketJobMap.find(socket); if (i != m_socketJobMap.end()) { if (*(i->second) != NULL) { delete *(i->second); *(i->second) = NULL; m_update = true; } } // unlock the job list unlockJobList(); } void CSocketMultiplexer::serviceThread(void*) { std::vector pfds; IArchNetwork::CPollEntry pfd; // service the connections for (;;) { CThread::testCancel(); // wait until there are jobs to handle { CLock lock(m_mutex); while (!(bool)*m_jobsReady) { m_jobsReady->wait(); } } // lock the job list lockJobListLock(); lockJobList(); // collect poll entries if (m_update) { m_update = false; pfds.clear(); pfds.reserve(m_socketJobMap.size()); CJobCursor cursor = newCursor(); CJobCursor jobCursor = nextCursor(cursor); while (jobCursor != m_socketJobs.end()) { ISocketMultiplexerJob* job = *jobCursor; if (job != NULL) { pfd.m_socket = job->getSocket(); pfd.m_events = 0; if (job->isReadable()) { pfd.m_events |= IArchNetwork::kPOLLIN; } if (job->isWritable()) { pfd.m_events |= IArchNetwork::kPOLLOUT; } pfds.push_back(pfd); } jobCursor = nextCursor(cursor); } deleteCursor(cursor); } int status; try { // check for status if (!pfds.empty()) { status = ARCH->pollSocket(&pfds[0], (int)pfds.size(), -1); } else { status = 0; } } catch (XArchNetwork& e) { LOG((CLOG_WARN "error in socket multiplexer: %s", e.what().c_str())); status = 0; } if (status != 0) { // iterate over socket jobs, invoking each and saving the // new job. UInt32 i = 0; CJobCursor cursor = newCursor(); CJobCursor jobCursor = nextCursor(cursor); while (i < pfds.size() && jobCursor != m_socketJobs.end()) { if (*jobCursor != NULL) { // get poll state unsigned short revents = pfds[i].m_revents; bool read = ((revents & IArchNetwork::kPOLLIN) != 0); bool write = ((revents & IArchNetwork::kPOLLOUT) != 0); bool error = ((revents & (IArchNetwork::kPOLLERR | IArchNetwork::kPOLLNVAL)) != 0); // run job ISocketMultiplexerJob* job = *jobCursor; ISocketMultiplexerJob* newJob = job->run(read, write, error); // save job, if different if (newJob != job) { CLock lock(m_mutex); delete job; *jobCursor = newJob; m_update = true; } ++i; } // next job jobCursor = nextCursor(cursor); } deleteCursor(cursor); } // delete any removed socket jobs for (CSocketJobMap::iterator i = m_socketJobMap.begin(); i != m_socketJobMap.end();) { if (*(i->second) == NULL) { m_socketJobMap.erase(i++); m_update = true; } else { ++i; } } // unlock the job list unlockJobList(); } } CSocketMultiplexer::CJobCursor CSocketMultiplexer::newCursor() { CLock lock(m_mutex); return m_socketJobs.insert(m_socketJobs.begin(), m_cursorMark); } CSocketMultiplexer::CJobCursor CSocketMultiplexer::nextCursor(CJobCursor cursor) { CLock lock(m_mutex); CJobCursor j = m_socketJobs.end(); CJobCursor i = cursor; while (++i != m_socketJobs.end()) { if (*i != m_cursorMark) { // found a real job (as opposed to a cursor) j = i; // move our cursor just past the job m_socketJobs.splice(++i, m_socketJobs, cursor); break; } } return j; } void CSocketMultiplexer::deleteCursor(CJobCursor cursor) { CLock lock(m_mutex); m_socketJobs.erase(cursor); } void CSocketMultiplexer::lockJobListLock() { CLock lock(m_mutex); // wait for the lock on the lock while (*m_jobListLockLocked) { m_jobListLockLocked->wait(); } // take ownership of the lock on the lock *m_jobListLockLocked = true; m_jobListLockLocker = new CThread(CThread::getCurrentThread()); } void CSocketMultiplexer::lockJobList() { CLock lock(m_mutex); // make sure we're the one that called lockJobListLock() assert(*m_jobListLockLocker == CThread::getCurrentThread()); // wait for the job list lock while (*m_jobListLock) { m_jobListLock->wait(); } // take ownership of the lock *m_jobListLock = true; m_jobListLocker = m_jobListLockLocker; m_jobListLockLocker = NULL; // release the lock on the lock *m_jobListLockLocked = false; m_jobListLockLocked->broadcast(); } void CSocketMultiplexer::unlockJobList() { CLock lock(m_mutex); // make sure we're the one that called lockJobList() assert(*m_jobListLocker == CThread::getCurrentThread()); // release the lock delete m_jobListLocker; m_jobListLocker = NULL; *m_jobListLock = false; m_jobListLock->signal(); // set new jobs ready state bool isReady = !m_socketJobMap.empty(); if (*m_jobsReady != isReady) { *m_jobsReady = isReady; m_jobsReady->signal(); } } synergy-1.4.12-Source/src/lib/net/CSocketMultiplexer.h0000600000175000017500000000667312021261364022602 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSOCKETMULTIPLEXER_H #define CSOCKETMULTIPLEXER_H #include "IArchNetwork.h" #include "stdlist.h" #include "stdmap.h" template class CCondVar; class CMutex; class CThread; class ISocket; class ISocketMultiplexerJob; //! Socket multiplexer /*! A socket multiplexer services multiple sockets simultaneously. */ class CSocketMultiplexer { public: CSocketMultiplexer(); ~CSocketMultiplexer(); //! @name manipulators //@{ void addSocket(ISocket*, ISocketMultiplexerJob*); void removeSocket(ISocket*); //@} //! @name accessors //@{ // maybe belongs on ISocketMultiplexer static CSocketMultiplexer* getInstance(); //@} private: // list of jobs. we use a list so we can safely iterate over it // while other threads modify it. typedef std::list CSocketJobs; typedef CSocketJobs::iterator CJobCursor; typedef std::map CSocketJobMap; // service sockets. the service thread will only access m_sockets // and m_update while m_pollable and m_polling are true. all other // threads must only modify these when m_pollable and m_polling are // false. only the service thread sets m_polling. void serviceThread(void*); // create, iterate, and destroy a cursor. a cursor is used to // safely iterate through the job list while other threads modify // the list. it works by inserting a dummy item in the list and // moving that item through the list. the dummy item will never // be removed by other edits so an iterator pointing at the item // remains valid until we remove the dummy item in deleteCursor(). // nextCursor() finds the next non-dummy item, moves our dummy // item just past it, and returns an iterator for the non-dummy // item. all cursor calls lock the mutex for their duration. CJobCursor newCursor(); CJobCursor nextCursor(CJobCursor); void deleteCursor(CJobCursor); // lock out locking the job list. this blocks if another thread // has already locked out locking. once it returns, only the // calling thread will be able to lock the job list after any // current lock is released. void lockJobListLock(); // lock the job list. this blocks if the job list is already // locked. the calling thread must have called requestJobLock. void lockJobList(); // unlock the job list and the lock out on locking. void unlockJobList(); private: CMutex* m_mutex; CThread* m_thread; bool m_update; CCondVar* m_jobsReady; CCondVar* m_jobListLock; CCondVar* m_jobListLockLocked; CThread* m_jobListLocker; CThread* m_jobListLockLocker; CSocketJobs m_socketJobs; CSocketJobMap m_socketJobMap; ISocketMultiplexerJob* m_cursorMark; static CSocketMultiplexer* s_instance; }; #endif synergy-1.4.12-Source/src/lib/net/CTCPListenSocket.cpp0000600000175000017500000000644112021261364022421 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CTCPListenSocket.h" #include "CNetworkAddress.h" #include "CSocketMultiplexer.h" #include "CTCPSocket.h" #include "TSocketMultiplexerMethodJob.h" #include "XSocket.h" #include "XIO.h" #include "CLock.h" #include "CMutex.h" #include "IEventQueue.h" #include "CArch.h" #include "XArch.h" // // CTCPListenSocket // CTCPListenSocket::CTCPListenSocket() { m_mutex = new CMutex; try { m_socket = ARCH->newSocket(IArchNetwork::kINET, IArchNetwork::kSTREAM); } catch (XArchNetwork& e) { throw XSocketCreate(e.what()); } } CTCPListenSocket::~CTCPListenSocket() { try { if (m_socket != NULL) { CSocketMultiplexer::getInstance()->removeSocket(this); ARCH->closeSocket(m_socket); } } catch (...) { // ignore } delete m_mutex; } void CTCPListenSocket::bind(const CNetworkAddress& addr) { try { CLock lock(m_mutex); ARCH->setReuseAddrOnSocket(m_socket, true); ARCH->bindSocket(m_socket, addr.getAddress()); ARCH->listenOnSocket(m_socket); CSocketMultiplexer::getInstance()->addSocket(this, new TSocketMultiplexerMethodJob( this, &CTCPListenSocket::serviceListening, m_socket, true, false)); } catch (XArchNetworkAddressInUse& e) { throw XSocketAddressInUse(e.what()); } catch (XArchNetwork& e) { throw XSocketBind(e.what()); } } void CTCPListenSocket::close() { CLock lock(m_mutex); if (m_socket == NULL) { throw XIOClosed(); } try { CSocketMultiplexer::getInstance()->removeSocket(this); ARCH->closeSocket(m_socket); m_socket = NULL; } catch (XArchNetwork& e) { throw XSocketIOClose(e.what()); } } void* CTCPListenSocket::getEventTarget() const { return const_cast(reinterpret_cast(this)); } IDataSocket* CTCPListenSocket::accept() { IDataSocket* socket = NULL; try { socket = new CTCPSocket(ARCH->acceptSocket(m_socket, NULL)); if (socket != NULL) { CSocketMultiplexer::getInstance()->addSocket(this, new TSocketMultiplexerMethodJob( this, &CTCPListenSocket::serviceListening, m_socket, true, false)); } return socket; } catch (XArchNetwork&) { if (socket != NULL) { delete socket; } return NULL; } catch (std::exception &ex) { if (socket != NULL) { delete socket; } throw ex; } } ISocketMultiplexerJob* CTCPListenSocket::serviceListening(ISocketMultiplexerJob* job, bool read, bool, bool error) { if (error) { close(); return NULL; } if (read) { EVENTQUEUE->addEvent(CEvent(getConnectingEvent(), this, NULL)); // stop polling on this socket until the client accepts return NULL; } return job; } synergy-1.4.12-Source/src/lib/net/CTCPListenSocket.h0000600000175000017500000000260212021261364022061 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CTCPLISTENSOCKET_H #define CTCPLISTENSOCKET_H #include "IListenSocket.h" #include "IArchNetwork.h" class CMutex; class ISocketMultiplexerJob; //! TCP listen socket /*! A listen socket using TCP. */ class CTCPListenSocket : public IListenSocket { public: CTCPListenSocket(); ~CTCPListenSocket(); // ISocket overrides virtual void bind(const CNetworkAddress&); virtual void close(); virtual void* getEventTarget() const; // IListenSocket overrides virtual IDataSocket* accept(); private: ISocketMultiplexerJob* serviceListening(ISocketMultiplexerJob*, bool, bool, bool); private: CArchSocket m_socket; CMutex* m_mutex; }; #endif synergy-1.4.12-Source/src/lib/net/CTCPSocket.cpp0000600000175000017500000002655312021261364021250 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CTCPSocket.h" #include "CNetworkAddress.h" #include "CSocketMultiplexer.h" #include "TSocketMultiplexerMethodJob.h" #include "XSocket.h" #include "CLock.h" #include "CLog.h" #include "IEventQueue.h" #include "IEventJob.h" #include "CArch.h" #include "XArch.h" #include #include #include // // CTCPSocket // CTCPSocket::CTCPSocket() : m_mutex(), m_flushed(&m_mutex, true) { try { m_socket = ARCH->newSocket(IArchNetwork::kINET, IArchNetwork::kSTREAM); } catch (XArchNetwork& e) { throw XSocketCreate(e.what()); } init(); } CTCPSocket::CTCPSocket(CArchSocket socket) : m_mutex(), m_socket(socket), m_flushed(&m_mutex, true) { assert(m_socket != NULL); // socket starts in connected state init(); onConnected(); setJob(newJob()); } CTCPSocket::~CTCPSocket() { try { close(); } catch (...) { // ignore } } void CTCPSocket::bind(const CNetworkAddress& addr) { try { ARCH->bindSocket(m_socket, addr.getAddress()); } catch (XArchNetworkAddressInUse& e) { throw XSocketAddressInUse(e.what()); } catch (XArchNetwork& e) { throw XSocketBind(e.what()); } } void CTCPSocket::close() { // remove ourself from the multiplexer setJob(NULL); CLock lock(&m_mutex); // clear buffers and enter disconnected state if (m_connected) { sendEvent(getDisconnectedEvent()); } onDisconnected(); // close the socket if (m_socket != NULL) { CArchSocket socket = m_socket; m_socket = NULL; try { ARCH->closeSocket(socket); } catch (XArchNetwork& e) { // ignore, there's not much we can do LOG((CLOG_WARN "error closing socket: %s", e.what().c_str())); } } } void* CTCPSocket::getEventTarget() const { return const_cast(reinterpret_cast(this)); } UInt32 CTCPSocket::read(void* buffer, UInt32 n) { // copy data directly from our input buffer CLock lock(&m_mutex); UInt32 size = m_inputBuffer.getSize(); if (n > size) { n = size; } if (buffer != NULL && n != 0) { memcpy(buffer, m_inputBuffer.peek(n), n); } m_inputBuffer.pop(n); // if no more data and we cannot read or write then send disconnected if (n > 0 && m_inputBuffer.getSize() == 0 && !m_readable && !m_writable) { sendEvent(getDisconnectedEvent()); m_connected = false; } return n; } void CTCPSocket::write(const void* buffer, UInt32 n) { bool wasEmpty; { CLock lock(&m_mutex); // must not have shutdown output if (!m_writable) { sendEvent(getOutputErrorEvent()); return; } // ignore empty writes if (n == 0) { return; } // copy data to the output buffer wasEmpty = (m_outputBuffer.getSize() == 0); m_outputBuffer.write(buffer, n); // there's data to write m_flushed = false; } // make sure we're waiting to write if (wasEmpty) { setJob(newJob()); } } void CTCPSocket::flush() { CLock lock(&m_mutex); while (m_flushed == false) { m_flushed.wait(); } } void CTCPSocket::shutdownInput() { bool useNewJob = false; { CLock lock(&m_mutex); // shutdown socket for reading try { ARCH->closeSocketForRead(m_socket); } catch (XArchNetwork&) { // ignore } // shutdown buffer for reading if (m_readable) { sendEvent(getInputShutdownEvent()); onInputShutdown(); useNewJob = true; } } if (useNewJob) { setJob(newJob()); } } void CTCPSocket::shutdownOutput() { bool useNewJob = false; { CLock lock(&m_mutex); // shutdown socket for writing try { ARCH->closeSocketForWrite(m_socket); } catch (XArchNetwork&) { // ignore } // shutdown buffer for writing if (m_writable) { sendEvent(getOutputShutdownEvent()); onOutputShutdown(); useNewJob = true; } } if (useNewJob) { setJob(newJob()); } } bool CTCPSocket::isReady() const { CLock lock(&m_mutex); return (m_inputBuffer.getSize() > 0); } UInt32 CTCPSocket::getSize() const { CLock lock(&m_mutex); return m_inputBuffer.getSize(); } void CTCPSocket::connect(const CNetworkAddress& addr) { { CLock lock(&m_mutex); // fail on attempts to reconnect if (m_socket == NULL || m_connected) { sendConnectionFailedEvent("busy"); return; } try { if (ARCH->connectSocket(m_socket, addr.getAddress())) { sendEvent(getConnectedEvent()); onConnected(); } else { // connection is in progress m_writable = true; } } catch (XArchNetwork& e) { throw XSocketConnect(e.what()); } } setJob(newJob()); } void CTCPSocket::init() { // default state m_connected = false; m_readable = false; m_writable = false; try { // turn off Nagle algorithm. we send lots of very short messages // that should be sent without (much) delay. for example, the // mouse motion messages are much less useful if they're delayed. ARCH->setNoDelayOnSocket(m_socket, true); } catch (XArchNetwork& e) { try { ARCH->closeSocket(m_socket); m_socket = NULL; } catch (XArchNetwork&) { // ignore } throw XSocketCreate(e.what()); } } void CTCPSocket::setJob(ISocketMultiplexerJob* job) { // multiplexer will delete the old job if (job == NULL) { CSocketMultiplexer::getInstance()->removeSocket(this); } else { CSocketMultiplexer::getInstance()->addSocket(this, job); } } ISocketMultiplexerJob* CTCPSocket::newJob() { // note -- must have m_mutex locked on entry if (m_socket == NULL) { return NULL; } else if (!m_connected) { assert(!m_readable); if (!(m_readable || m_writable)) { return NULL; } return new TSocketMultiplexerMethodJob( this, &CTCPSocket::serviceConnecting, m_socket, m_readable, m_writable); } else { if (!(m_readable || (m_writable && (m_outputBuffer.getSize() > 0)))) { return NULL; } return new TSocketMultiplexerMethodJob( this, &CTCPSocket::serviceConnected, m_socket, m_readable, m_writable && (m_outputBuffer.getSize() > 0)); } } void CTCPSocket::sendConnectionFailedEvent(const char* msg) { CConnectionFailedInfo* info = new CConnectionFailedInfo(msg); EVENTQUEUE->addEvent(CEvent(getConnectionFailedEvent(), getEventTarget(), info, CEvent::kDontFreeData)); } void CTCPSocket::sendEvent(CEvent::Type type) { EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), NULL)); } void CTCPSocket::onConnected() { m_connected = true; m_readable = true; m_writable = true; } void CTCPSocket::onInputShutdown() { m_inputBuffer.pop(m_inputBuffer.getSize()); m_readable = false; } void CTCPSocket::onOutputShutdown() { m_outputBuffer.pop(m_outputBuffer.getSize()); m_writable = false; // we're now flushed m_flushed = true; m_flushed.broadcast(); } void CTCPSocket::onDisconnected() { // disconnected onInputShutdown(); onOutputShutdown(); m_connected = false; } ISocketMultiplexerJob* CTCPSocket::serviceConnecting(ISocketMultiplexerJob* job, bool, bool write, bool error) { CLock lock(&m_mutex); // should only check for errors if error is true but checking a new // socket (and a socket that's connecting should be new) for errors // should be safe and Mac OS X appears to have a bug where a // non-blocking stream socket that fails to connect immediately is // reported by select as being writable (i.e. connected) even when // the connection has failed. this is easily demonstrated on OS X // 10.3.4 by starting a synergy client and telling to connect to // another system that's not running a synergy server. it will // claim to have connected then quickly disconnect (i guess because // read returns 0 bytes). unfortunately, synergy attempts to // reconnect immediately, the process repeats and we end up // spinning the CPU. luckily, OS X does set SO_ERROR on the // socket correctly when the connection has failed so checking for // errors works. (curiously, sometimes OS X doesn't report // connection refused. when that happens it at least doesn't // report the socket as being writable so synergy is able to time // out the attempt.) if (error || true) { try { // connection may have failed or succeeded ARCH->throwErrorOnSocket(m_socket); } catch (XArchNetwork& e) { sendConnectionFailedEvent(e.what().c_str()); onDisconnected(); return newJob(); } } if (write) { sendEvent(getConnectedEvent()); onConnected(); return newJob(); } return job; } ISocketMultiplexerJob* CTCPSocket::serviceConnected(ISocketMultiplexerJob* job, bool read, bool write, bool error) { CLock lock(&m_mutex); if (error) { sendEvent(getDisconnectedEvent()); onDisconnected(); return newJob(); } bool needNewJob = false; if (write) { try { // write data UInt32 n = m_outputBuffer.getSize(); const void* buffer = m_outputBuffer.peek(n); n = (UInt32)ARCH->writeSocket(m_socket, buffer, n); // discard written data if (n > 0) { m_outputBuffer.pop(n); if (m_outputBuffer.getSize() == 0) { sendEvent(getOutputFlushedEvent()); m_flushed = true; m_flushed.broadcast(); needNewJob = true; } } } catch (XArchNetworkShutdown&) { // remote read end of stream hungup. our output side // has therefore shutdown. onOutputShutdown(); sendEvent(getOutputShutdownEvent()); if (!m_readable && m_inputBuffer.getSize() == 0) { sendEvent(getDisconnectedEvent()); m_connected = false; } needNewJob = true; } catch (XArchNetworkDisconnected&) { // stream hungup onDisconnected(); sendEvent(getDisconnectedEvent()); needNewJob = true; } catch (XArchNetwork& e) { // other write error LOG((CLOG_WARN "error writing socket: %s", e.what().c_str())); onDisconnected(); sendEvent(getOutputErrorEvent()); sendEvent(getDisconnectedEvent()); needNewJob = true; } } if (read && m_readable) { try { UInt8 buffer[4096]; size_t n = ARCH->readSocket(m_socket, buffer, sizeof(buffer)); if (n > 0) { bool wasEmpty = (m_inputBuffer.getSize() == 0); // slurp up as much as possible do { m_inputBuffer.write(buffer, (UInt32)n); n = ARCH->readSocket(m_socket, buffer, sizeof(buffer)); } while (n > 0); // send input ready if input buffer was empty if (wasEmpty) { sendEvent(getInputReadyEvent()); } } else { // remote write end of stream hungup. our input side // has therefore shutdown but don't flush our buffer // since there's still data to be read. sendEvent(getInputShutdownEvent()); if (!m_writable && m_inputBuffer.getSize() == 0) { sendEvent(getDisconnectedEvent()); m_connected = false; } m_readable = false; needNewJob = true; } } catch (XArchNetworkDisconnected&) { // stream hungup sendEvent(getDisconnectedEvent()); onDisconnected(); needNewJob = true; } catch (XArchNetwork& e) { // ignore other read error LOG((CLOG_WARN "error reading socket: %s", e.what().c_str())); } } return needNewJob ? newJob() : job; } synergy-1.4.12-Source/src/lib/net/CTCPSocket.h0000600000175000017500000000440712021261364020707 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CTCPSOCKET_H #define CTCPSOCKET_H #include "IDataSocket.h" #include "CStreamBuffer.h" #include "CCondVar.h" #include "CMutex.h" #include "IArchNetwork.h" class CMutex; class CThread; class ISocketMultiplexerJob; //! TCP data socket /*! A data socket using TCP. */ class CTCPSocket : public IDataSocket { public: CTCPSocket(); CTCPSocket(CArchSocket); ~CTCPSocket(); // ISocket overrides virtual void bind(const CNetworkAddress&); virtual void close(); virtual void* getEventTarget() const; // IStream overrides virtual UInt32 read(void* buffer, UInt32 n); virtual void write(const void* buffer, UInt32 n); virtual void flush(); virtual void shutdownInput(); virtual void shutdownOutput(); virtual bool isReady() const; virtual UInt32 getSize() const; // IDataSocket overrides virtual void connect(const CNetworkAddress&); private: void init(); void setJob(ISocketMultiplexerJob*); ISocketMultiplexerJob* newJob(); void sendConnectionFailedEvent(const char*); void sendEvent(CEvent::Type); void onConnected(); void onInputShutdown(); void onOutputShutdown(); void onDisconnected(); ISocketMultiplexerJob* serviceConnecting(ISocketMultiplexerJob*, bool, bool, bool); ISocketMultiplexerJob* serviceConnected(ISocketMultiplexerJob*, bool, bool, bool); private: CMutex m_mutex; CArchSocket m_socket; CStreamBuffer m_inputBuffer; CStreamBuffer m_outputBuffer; CCondVar m_flushed; bool m_connected; bool m_readable; bool m_writable; }; #endif synergy-1.4.12-Source/src/lib/net/CTCPSocketFactory.cpp0000600000175000017500000000215512021261364022570 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CTCPSocketFactory.h" #include "CTCPSocket.h" #include "CTCPListenSocket.h" // // CTCPSocketFactory // CTCPSocketFactory::CTCPSocketFactory() { // do nothing } CTCPSocketFactory::~CTCPSocketFactory() { // do nothing } IDataSocket* CTCPSocketFactory::create() const { return new CTCPSocket; } IListenSocket* CTCPSocketFactory::createListen() const { return new CTCPListenSocket; } synergy-1.4.12-Source/src/lib/net/CTCPSocketFactory.h0000600000175000017500000000210412021261364022227 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CTCPSOCKETFACTORY_H #define CTCPSOCKETFACTORY_H #include "ISocketFactory.h" //! Socket factory for TCP sockets class CTCPSocketFactory : public ISocketFactory { public: CTCPSocketFactory(); virtual ~CTCPSocketFactory(); // ISocketFactory overrides virtual IDataSocket* create() const; virtual IListenSocket* createListen() const; }; #endif synergy-1.4.12-Source/src/lib/net/IDataSocket.cpp0000600000175000017500000000273112021261364021471 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IDataSocket.h" #include "CEventQueue.h" // // IDataSocket // CEvent::Type IDataSocket::s_connectedEvent = CEvent::kUnknown; CEvent::Type IDataSocket::s_failedEvent = CEvent::kUnknown; CEvent::Type IDataSocket::getConnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_connectedEvent, "IDataSocket::connected"); } CEvent::Type IDataSocket::getConnectionFailedEvent() { return EVENTQUEUE->registerTypeOnce(s_failedEvent, "IDataSocket::failed"); } void IDataSocket::close() { // this is here to work around a VC++6 bug. see the header file. assert(0 && "bad call"); } void* IDataSocket::getEventTarget() const { // this is here to work around a VC++6 bug. see the header file. assert(0 && "bad call"); return NULL; } synergy-1.4.12-Source/src/lib/net/IDataSocket.h0000600000175000017500000000545212021261364021141 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IDATASOCKET_H #define IDATASOCKET_H #include "ISocket.h" #include "IStream.h" #include "CString.h" //! Data stream socket interface /*! This interface defines the methods common to all network sockets that represent a full-duplex data stream. */ class IDataSocket : public ISocket, public synergy::IStream { public: class CConnectionFailedInfo { public: CConnectionFailedInfo(const char* what) : m_what(what) { } CString m_what; }; //! @name manipulators //@{ //! Connect socket /*! Attempt to connect to a remote endpoint. This returns immediately and sends a connected event when successful or a connection failed event when it fails. The stream acts as if shutdown for input and output until the stream connects. */ virtual void connect(const CNetworkAddress&) = 0; //@} //! @name accessors //@{ //! Get connected event type /*! Returns the socket connected event type. A socket sends this event when a remote connection has been established. */ static CEvent::Type getConnectedEvent(); //! Get connection failed event type /*! Returns the socket connection failed event type. A socket sends this event when an attempt to connect to a remote port has failed. The data is a pointer to a CConnectionFailedInfo. */ static CEvent::Type getConnectionFailedEvent(); //@} // ISocket overrides // close() and getEventTarget() aren't pure to work around a bug // in VC++6. it claims the methods are unused locals and warns // that it's removing them. it's presumably tickled by inheriting // methods with identical signatures from both superclasses. virtual void bind(const CNetworkAddress&) = 0; virtual void close(); virtual void* getEventTarget() const; // IStream overrides virtual UInt32 read(void* buffer, UInt32 n) = 0; virtual void write(const void* buffer, UInt32 n) = 0; virtual void flush() = 0; virtual void shutdownInput() = 0; virtual void shutdownOutput() = 0; virtual bool isReady() const = 0; virtual UInt32 getSize() const = 0; private: static CEvent::Type s_connectedEvent; static CEvent::Type s_failedEvent; }; #endif synergy-1.4.12-Source/src/lib/net/IListenSocket.cpp0000600000175000017500000000200312021261364022046 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IListenSocket.h" #include "CEventQueue.h" // // IListenSocket // CEvent::Type IListenSocket::s_connectingEvent = CEvent::kUnknown; CEvent::Type IListenSocket::getConnectingEvent() { return EVENTQUEUE->registerTypeOnce(s_connectingEvent, "IListenSocket::connecting"); } synergy-1.4.12-Source/src/lib/net/IListenSocket.h0000600000175000017500000000332412021261364021522 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ILISTENSOCKET_H #define ILISTENSOCKET_H #include "ISocket.h" class IDataSocket; //! Listen socket interface /*! This interface defines the methods common to all network sockets that listen for incoming connections. */ class IListenSocket : public ISocket { public: //! @name manipulators //@{ //! Accept connection /*! Accept a connection, returning a socket representing the full-duplex data stream. Returns NULL if no socket is waiting to be accepted. This is only valid after a call to \c bind(). */ virtual IDataSocket* accept() = 0; //@} //! @name accessors //@{ //! Get connecting event type /*! Returns the socket connecting event type. A socket sends this event when a remote connection is waiting to be accepted. */ static CEvent::Type getConnectingEvent(); //@} // ISocket overrides virtual void bind(const CNetworkAddress&) = 0; virtual void close() = 0; virtual void* getEventTarget() const = 0; private: static CEvent::Type s_connectingEvent; }; #endif synergy-1.4.12-Source/src/lib/net/ISocket.cpp0000600000175000017500000000175512021261364020704 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ISocket.h" #include "CEventQueue.h" // // ISocket // CEvent::Type ISocket::s_disconnectedEvent = CEvent::kUnknown; CEvent::Type ISocket::getDisconnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_disconnectedEvent, "ISocket::disconnected"); } synergy-1.4.12-Source/src/lib/net/ISocket.h0000600000175000017500000000340512021261364020343 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISOCKET_H #define ISOCKET_H #include "IInterface.h" #include "CEvent.h" class CNetworkAddress; //! Generic socket interface /*! This interface defines the methods common to all network sockets. Generated events use \c this as the target. */ class ISocket : public IInterface { public: //! @name manipulators //@{ //! Bind socket to address /*! Binds the socket to a particular address. */ virtual void bind(const CNetworkAddress&) = 0; //! Close socket /*! Closes the socket. This should flush the output stream. */ virtual void close() = 0; //@} //! @name accessors //@{ //! Get event target /*! Returns the event target for events generated by this socket. */ virtual void* getEventTarget() const = 0; //! Get disconnected event type /*! Returns the socket disconnected event type. A socket sends this event when the remote side of the socket has disconnected or shutdown both input and output. */ static CEvent::Type getDisconnectedEvent(); //@} private: static CEvent::Type s_disconnectedEvent; }; #endif synergy-1.4.12-Source/src/lib/net/ISocketFactory.h0000600000175000017500000000226112021261364021672 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISOCKETFACTORY_H #define ISOCKETFACTORY_H #include "IInterface.h" class IDataSocket; class IListenSocket; //! Socket factory /*! This interface defines the methods common to all factories used to create sockets. */ class ISocketFactory : public IInterface { public: //! @name accessors //@{ //! Create data socket virtual IDataSocket* create() const = 0; //! Create listen socket virtual IListenSocket* createListen() const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/net/ISocketMultiplexerJob.h0000600000175000017500000000435012021261364023231 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISOCKETMULTIPLEXERJOB_H #define ISOCKETMULTIPLEXERJOB_H #include "IArchNetwork.h" #include "IInterface.h" //! Socket multiplexer job /*! A socket multiplexer job handles events on a socket. */ class ISocketMultiplexerJob : public IInterface { public: //! @name manipulators //@{ //! Handle socket event /*! Called by a socket multiplexer when the socket becomes readable, writable, or has an error. It should return itself if the same job can continue to service events, a new job if the socket must be serviced differently, or NULL if the socket should no longer be serviced. The socket is readable if \p readable is true, writable if \p writable is true, and in error if \p error is true. This call must not attempt to directly change the job for this socket by calling \c addSocket() or \c removeSocket() on the multiplexer. It must instead return the new job. It can, however, add or remove jobs for other sockets. */ virtual ISocketMultiplexerJob* run(bool readable, bool writable, bool error) = 0; //@} //! @name accessors //@{ //! Get the socket /*! Return the socket to multiplex */ virtual CArchSocket getSocket() const = 0; //! Check for interest in readability /*! Return true if the job is interested in being run if the socket becomes readable. */ virtual bool isReadable() const = 0; //! Check for interest in writability /*! Return true if the job is interested in being run if the socket becomes writable. */ virtual bool isWritable() const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/net/TSocketMultiplexerMethodJob.h0000600000175000017500000000522712021261364024411 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 TSOCKERMULTIPLEXERMETHODJOB_H #define TSOCKERMULTIPLEXERMETHODJOB_H #include "ISocketMultiplexerJob.h" #include "CArch.h" //! Use a method as a socket multiplexer job /*! A socket multiplexer job class that invokes a member function. */ template class TSocketMultiplexerMethodJob : public ISocketMultiplexerJob { public: typedef ISocketMultiplexerJob* (T::*Method)(ISocketMultiplexerJob*, bool, bool, bool); //! run() invokes \c object->method(arg) TSocketMultiplexerMethodJob(T* object, Method method, CArchSocket socket, bool readable, bool writeable); virtual ~TSocketMultiplexerMethodJob(); // IJob overrides virtual ISocketMultiplexerJob* run(bool readable, bool writable, bool error); virtual CArchSocket getSocket() const; virtual bool isReadable() const; virtual bool isWritable() const; private: T* m_object; Method m_method; CArchSocket m_socket; bool m_readable; bool m_writable; void* m_arg; }; template inline TSocketMultiplexerMethodJob::TSocketMultiplexerMethodJob(T* object, Method method, CArchSocket socket, bool readable, bool writable) : m_object(object), m_method(method), m_socket(ARCH->copySocket(socket)), m_readable(readable), m_writable(writable) { // do nothing } template inline TSocketMultiplexerMethodJob::~TSocketMultiplexerMethodJob() { ARCH->closeSocket(m_socket); } template inline ISocketMultiplexerJob* TSocketMultiplexerMethodJob::run(bool read, bool write, bool error) { if (m_object != NULL) { return (m_object->*m_method)(this, read, write, error); } return NULL; } template inline CArchSocket TSocketMultiplexerMethodJob::getSocket() const { return m_socket; } template inline bool TSocketMultiplexerMethodJob::isReadable() const { return m_readable; } template inline bool TSocketMultiplexerMethodJob::isWritable() const { return m_writable; } #endif synergy-1.4.12-Source/src/lib/net/XSocket.cpp0000600000175000017500000000451312021261364020716 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XSocket.h" #include "CStringUtil.h" // // XSocketAddress // XSocketAddress::XSocketAddress(EError error, const CString& hostname, int port) throw() : m_error(error), m_hostname(hostname), m_port(port) { // do nothing } XSocketAddress::EError XSocketAddress::getError() const throw() { return m_error; } CString XSocketAddress::getHostname() const throw() { return m_hostname; } int XSocketAddress::getPort() const throw() { return m_port; } CString XSocketAddress::getWhat() const throw() { static const char* s_errorID[] = { "XSocketAddressUnknown", "XSocketAddressNotFound", "XSocketAddressNoAddress", "XSocketAddressUnsupported", "XSocketAddressBadPort" }; static const char* s_errorMsg[] = { "unknown error for: %{1}:%{2}", "address not found for: %{1}", "no address for: %{1}", "unsupported address for: %{1}", "invalid port" // m_port may not be set to the bad port }; return format(s_errorID[m_error], s_errorMsg[m_error], m_hostname.c_str(), CStringUtil::print("%d", m_port).c_str()); } // // XSocketIOClose // CString XSocketIOClose::getWhat() const throw() { return format("XSocketIOClose", "close: %{1}", what()); } // // XSocketBind // CString XSocketBind::getWhat() const throw() { return format("XSocketBind", "cannot bind address: %{1}", what()); } // // XSocketConnect // CString XSocketConnect::getWhat() const throw() { return format("XSocketConnect", "cannot connect socket: %{1}", what()); } // // XSocketCreate // CString XSocketCreate::getWhat() const throw() { return format("XSocketCreate", "cannot create socket: %{1}", what()); } synergy-1.4.12-Source/src/lib/net/XSocket.h0000600000175000017500000000476112021261364020370 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XSOCKET_H #define XSOCKET_H #include "XIO.h" #include "XBase.h" #include "CString.h" #include "BasicTypes.h" //! Generic socket exception XBASE_SUBCLASS(XSocket, XBase); //! Socket bad address exception /*! Thrown when attempting to create an invalid network address. */ class XSocketAddress : public XSocket { public: //! Failure codes enum EError { kUnknown, //!< Unknown error kNotFound, //!< The hostname is unknown kNoAddress, //!< The hostname is valid but has no IP address kUnsupported, //!< The hostname is valid but has no supported address kBadPort //!< The port is invalid }; XSocketAddress(EError, const CString& hostname, int port) throw(); //! @name accessors //@{ //! Get the error code EError getError() const throw(); //! Get the hostname CString getHostname() const throw(); //! Get the port int getPort() const throw(); //@} protected: // XBase overrides virtual CString getWhat() const throw(); private: EError m_error; CString m_hostname; int m_port; }; //! I/O closing exception /*! Thrown if a stream cannot be closed. */ XBASE_SUBCLASS_FORMAT(XSocketIOClose, XIOClose); //! Socket cannot bind address exception /*! Thrown when a socket cannot be bound to an address. */ XBASE_SUBCLASS_FORMAT(XSocketBind, XSocket); //! Socket address in use exception /*! Thrown when a socket cannot be bound to an address because the address is already in use. */ XBASE_SUBCLASS(XSocketAddressInUse, XSocketBind); //! Cannot connect socket exception /*! Thrown when a socket cannot connect to a remote endpoint. */ XBASE_SUBCLASS_FORMAT(XSocketConnect, XSocket); //! Cannot create socket exception /*! Thrown when a socket cannot be created (by the operating system). */ XBASE_SUBCLASS_FORMAT(XSocketCreate, XSocket); #endif synergy-1.4.12-Source/src/lib/platform/0000700000175000017500000000000012140644175017672 5ustar synergysynergysynergy-1.4.12-Source/src/lib/platform/CMakeLists.txt0000600000175000017500000001063112021261364022426 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . if (WIN32) set(inc CMSWindowsClipboard.h CMSWindowsClipboardAnyTextConverter.h CMSWindowsClipboardBitmapConverter.h CMSWindowsClipboardHTMLConverter.h CMSWindowsClipboardTextConverter.h CMSWindowsClipboardUTF16Converter.h CMSWindowsDesks.h CMSWindowsEventQueueBuffer.h CMSWindowsKeyState.h CMSWindowsScreen.h CMSWindowsScreenSaver.h CMSWindowsUtil.h CMSWindowsRelauncher.h CMSWindowsHookLibraryLoader.h IMSWindowsClipboardFacade.h CMSWindowsDebugOutputter.h CMSWindowsXInput.h ) set(src CMSWindowsClipboard.cpp CMSWindowsClipboardFacade.cpp CMSWindowsClipboardAnyTextConverter.cpp CMSWindowsClipboardBitmapConverter.cpp CMSWindowsClipboardHTMLConverter.cpp CMSWindowsClipboardTextConverter.cpp CMSWindowsClipboardUTF16Converter.cpp CMSWindowsDesks.cpp CMSWindowsEventQueueBuffer.cpp CMSWindowsKeyState.cpp CMSWindowsScreen.cpp CMSWindowsScreenSaver.cpp CMSWindowsUtil.cpp CMSWindowsRelauncher.cpp CMSWindowsHookLibraryLoader.cpp CMSWindowsDebugOutputter.cpp ) set(inc_hook CSynergyHook.h ) set(src_hook CSynergyHook.cpp ) if (GAME_DEVICE_SUPPORT) list(APPEND inc CMSWindowsXInput.h ) list(APPEND src CMSWindowsXInput.cpp ) set(inc_xinhook XInputHook.h HookDLL.h ) set(src_xinhook XInputHook.cpp HookDLL.cpp ) set(inc_xinproxy13 XInput13.h XInputProxy13.h ) set(src_xinproxy13 XInputProxy13.cpp ) endif() list(APPEND src ${inc} ) elseif (APPLE) set(src COSXClipboard.cpp COSXClipboardAnyTextConverter.cpp COSXClipboardTextConverter.cpp COSXClipboardUTF16Converter.cpp COSXEventQueueBuffer.cpp COSXKeyState.cpp COSXScreen.cpp COSXScreenSaver.cpp COSXScreenSaverUtil.m ) elseif (UNIX) set(src CXWindowsClipboard.cpp CXWindowsClipboardAnyBitmapConverter.cpp CXWindowsClipboardBMPConverter.cpp CXWindowsClipboardHTMLConverter.cpp CXWindowsClipboardTextConverter.cpp CXWindowsClipboardUCS2Converter.cpp CXWindowsClipboardUTF8Converter.cpp CXWindowsEventQueueBuffer.cpp CXWindowsKeyState.cpp CXWindowsScreen.cpp CXWindowsScreenSaver.cpp CXWindowsUtil.cpp ) endif() set(inc ../arch ../base ../common ../mt ../synergy ../ipc ../net ../io ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(platform STATIC ${src}) if (WIN32) add_library(synrgyhk SHARED ${inc_hook} ${src_hook}) # copy the dlls (and supporting files) from the lib dir to # the bin dir, so that synergyc and synergys can easily find them. # we should leave the other libraries compiling to the lib dir, # so that the bin dir remains tidy. the path is relative to the # build dir (in this case, that's: build\src\lib\platform). add_custom_command( TARGET synrgyhk POST_BUILD COMMAND xcopy /Y /Q ..\\..\\..\\..\\lib\\${CMAKE_CFG_INTDIR}\\synrgyhk.* ..\\..\\..\\..\\bin\\${CMAKE_CFG_INTDIR}\\ ) if (GAME_DEVICE_SUPPORT) include_directories($ENV{DXSDK_DIR}/Include) add_library(synxinhk SHARED ${inc_xinhook} ${src_xinhook}) add_custom_command( TARGET synxinhk POST_BUILD COMMAND xcopy /Y /Q ..\\..\\..\\..\\lib\\${CMAKE_CFG_INTDIR}\\synxinhk.* ..\\..\\..\\..\\bin\\${CMAKE_CFG_INTDIR}\\ ) # synergy xinput1_3.dll proxy include_directories($ENV{DXSDK_DIR}/Include) add_library(sxinpx13 SHARED ${inc_xinproxy13} ${src_xinproxy13}) target_link_libraries(sxinpx13 synxinhk) add_custom_command( TARGET sxinpx13 POST_BUILD COMMAND xcopy /Y /Q ..\\..\\..\\..\\lib\\${CMAKE_CFG_INTDIR}\\sxinpx13.* ..\\..\\..\\..\\bin\\${CMAKE_CFG_INTDIR}\\ ) endif() endif() if (UNIX) target_link_libraries(platform io net ipc synergy ${libs}) endif() synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboard.cpp0000600000175000017500000001412112021261364024205 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboard.h" #include "CMSWindowsClipboardTextConverter.h" #include "CMSWindowsClipboardUTF16Converter.h" #include "CMSWindowsClipboardBitmapConverter.h" #include "CMSWindowsClipboardHTMLConverter.h" #include "CLog.h" #include "CArchMiscWindows.h" #include "CMSWindowsClipboardFacade.h" // // CMSWindowsClipboard // UINT CMSWindowsClipboard::s_ownershipFormat = 0; CMSWindowsClipboard::CMSWindowsClipboard(HWND window) : m_window(window), m_time(0), m_facade(new CMSWindowsClipboardFacade()), m_deleteFacade(true) { // add converters, most desired first m_converters.push_back(new CMSWindowsClipboardUTF16Converter); if (CArchMiscWindows::isWindows95Family()) { // windows nt family converts to/from unicode automatically. // let it do so to avoid text encoding issues. m_converters.push_back(new CMSWindowsClipboardTextConverter); } m_converters.push_back(new CMSWindowsClipboardBitmapConverter); m_converters.push_back(new CMSWindowsClipboardHTMLConverter); } CMSWindowsClipboard::~CMSWindowsClipboard() { clearConverters(); // dependency injection causes confusion over ownership, so we need // logic to decide whether or not we delete the facade. there must // be a more elegant way of doing this. if (m_deleteFacade) delete m_facade; } void CMSWindowsClipboard::setFacade(IMSWindowsClipboardFacade& facade) { delete m_facade; m_facade = &facade; m_deleteFacade = false; } bool CMSWindowsClipboard::emptyUnowned() { LOG((CLOG_DEBUG "empty clipboard")); // empty the clipboard (and take ownership) if (!EmptyClipboard()) { // unable to cause this in integ tests, but this error has never // actually been reported by users. LOG((CLOG_DEBUG "failed to grab clipboard")); return false; } return true; } bool CMSWindowsClipboard::empty() { if (!emptyUnowned()) { return false; } // mark clipboard as being owned by synergy HGLOBAL data = GlobalAlloc(GMEM_MOVEABLE | GMEM_DDESHARE, 1); SetClipboardData(getOwnershipFormat(), data); return true; } void CMSWindowsClipboard::add(EFormat format, const CString& data) { LOG((CLOG_DEBUG "add %d bytes to clipboard format: %d", data.size(), format)); // convert data to win32 form for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IMSWindowsClipboardConverter* converter = *index; // skip converters for other formats if (converter->getFormat() == format) { HANDLE win32Data = converter->fromIClipboard(data); if (win32Data != NULL) { UINT win32Format = converter->getWin32Format(); m_facade->write(win32Data, win32Format); } } } } bool CMSWindowsClipboard::open(Time time) const { LOG((CLOG_DEBUG "open clipboard")); if (!OpenClipboard(m_window)) { // unable to cause this in integ tests; but this can happen! // * http://synergy-foss.org/pm/issues/86 // * http://synergy-foss.org/pm/issues/1256 // logging improved to see if we can catch more info next time. LOG((CLOG_WARN "failed to open clipboard: %d", GetLastError())); return false; } m_time = time; return true; } void CMSWindowsClipboard::close() const { LOG((CLOG_DEBUG "close clipboard")); CloseClipboard(); } IClipboard::Time CMSWindowsClipboard::getTime() const { return m_time; } bool CMSWindowsClipboard::has(EFormat format) const { for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IMSWindowsClipboardConverter* converter = *index; if (converter->getFormat() == format) { if (IsClipboardFormatAvailable(converter->getWin32Format())) { return true; } } } return false; } CString CMSWindowsClipboard::get(EFormat format) const { // find the converter for the first clipboard format we can handle IMSWindowsClipboardConverter* converter = NULL; UINT win32Format = EnumClipboardFormats(0); while (converter == NULL && win32Format != 0) { for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { converter = *index; if (converter->getWin32Format() == win32Format && converter->getFormat() == format) { break; } converter = NULL; } win32Format = EnumClipboardFormats(win32Format); } // if no converter then we don't recognize any formats if (converter == NULL) { return CString(); } // get a handle to the clipboard data HANDLE win32Data = GetClipboardData(converter->getWin32Format()); if (win32Data == NULL) { // nb: can't cause this using integ tests; this is only caused when // the selected converter returns an invalid format -- which you // cannot cause using public functions. return CString(); } // convert return converter->toIClipboard(win32Data); } void CMSWindowsClipboard::clearConverters() { for (ConverterList::iterator index = m_converters.begin(); index != m_converters.end(); ++index) { delete *index; } m_converters.clear(); } bool CMSWindowsClipboard::isOwnedBySynergy() { // create ownership format if we haven't yet if (s_ownershipFormat == 0) { s_ownershipFormat = RegisterClipboardFormat(TEXT("SynergyOwnership")); } return (IsClipboardFormatAvailable(getOwnershipFormat()) != 0); } UINT CMSWindowsClipboard::getOwnershipFormat() { // create ownership format if we haven't yet if (s_ownershipFormat == 0) { s_ownershipFormat = RegisterClipboardFormat(TEXT("SynergyOwnership")); } // return the format return s_ownershipFormat; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboard.h0000600000175000017500000000726512021261364023665 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARD_H #define CMSWINDOWSCLIPBOARD_H #include "IClipboard.h" #include "CMSWindowsClipboardFacade.h" #include "stdvector.h" #define WIN32_LEAN_AND_MEAN #include class IMSWindowsClipboardConverter; class IMSWindowsClipboardFacade; //! Microsoft windows clipboard implementation class CMSWindowsClipboard : public IClipboard { public: CMSWindowsClipboard(HWND window); CMSWindowsClipboard(HWND window, IMSWindowsClipboardFacade &facade); virtual ~CMSWindowsClipboard(); //! Empty clipboard without ownership /*! Take ownership of the clipboard and clear all data from it. This must be called between a successful open() and close(). Return false if the clipboard ownership could not be taken; the clipboard should not be emptied in this case. Unlike empty(), isOwnedBySynergy() will return false when emptied this way. This is useful when synergy wants to put data on clipboard but pretend (to itself) that some other app did it. When using empty(), synergy assumes the data came from the server and doesn't need to be sent back. emptyUnowned() makes synergy send the data to the server. */ bool emptyUnowned(); //! Test if clipboard is owned by synergy static bool isOwnedBySynergy(); // IClipboard overrides virtual bool empty(); virtual void add(EFormat, const CString& data); virtual bool open(Time) const; virtual void close() const; virtual Time getTime() const; virtual bool has(EFormat) const; virtual CString get(EFormat) const; void setFacade(IMSWindowsClipboardFacade& facade); private: void clearConverters(); UINT convertFormatToWin32(EFormat) const; HANDLE convertTextToWin32(const CString& data) const; CString convertTextFromWin32(HANDLE) const; static UINT getOwnershipFormat(); private: typedef std::vector ConverterList; HWND m_window; mutable Time m_time; ConverterList m_converters; static UINT s_ownershipFormat; IMSWindowsClipboardFacade* m_facade; bool m_deleteFacade; }; //! Clipboard format converter interface /*! This interface defines the methods common to all win32 clipboard format converters. */ class IMSWindowsClipboardConverter : public IInterface { public: // accessors // return the clipboard format this object converts from/to virtual IClipboard::EFormat getFormat() const = 0; // return the atom representing the win32 clipboard format that // this object converts from/to virtual UINT getWin32Format() const = 0; // convert from the IClipboard format to the win32 clipboard format. // the input data must be in the IClipboard format returned by // getFormat(). the return data will be in the win32 clipboard // format returned by getWin32Format(), allocated by GlobalAlloc(). virtual HANDLE fromIClipboard(const CString&) const = 0; // convert from the win32 clipboard format to the IClipboard format // (i.e., the reverse of fromIClipboard()). virtual CString toIClipboard(HANDLE data) const = 0; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardAnyTextConverter.cpp0000600000175000017500000000660612021261364027423 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboardAnyTextConverter.h" // // CMSWindowsClipboardAnyTextConverter // CMSWindowsClipboardAnyTextConverter::CMSWindowsClipboardAnyTextConverter() { // do nothing } CMSWindowsClipboardAnyTextConverter::~CMSWindowsClipboardAnyTextConverter() { // do nothing } IClipboard::EFormat CMSWindowsClipboardAnyTextConverter::getFormat() const { return IClipboard::kText; } HANDLE CMSWindowsClipboardAnyTextConverter::fromIClipboard(const CString& data) const { // convert linefeeds and then convert to desired encoding CString text = doFromIClipboard(convertLinefeedToWin32(data)); UInt32 size = (UInt32)text.size(); // copy to memory handle HGLOBAL gData = GlobalAlloc(GMEM_MOVEABLE | GMEM_DDESHARE, size); if (gData != NULL) { // get a pointer to the allocated memory char* dst = (char*)GlobalLock(gData); if (dst != NULL) { memcpy(dst, text.data(), size); GlobalUnlock(gData); } else { GlobalFree(gData); gData = NULL; } } return gData; } CString CMSWindowsClipboardAnyTextConverter::toIClipboard(HANDLE data) const { // get datator const char* src = (const char*)GlobalLock(data); UInt32 srcSize = (UInt32)GlobalSize(data); if (src == NULL || srcSize <= 1) { return CString(); } // convert text CString text = doToIClipboard(CString(src, srcSize)); // release handle GlobalUnlock(data); // convert newlines return convertLinefeedToUnix(text); } CString CMSWindowsClipboardAnyTextConverter::convertLinefeedToWin32( const CString& src) const { // note -- we assume src is a valid UTF-8 string // count newlines in string UInt32 numNewlines = 0; UInt32 n = (UInt32)src.size(); for (const char* scan = src.c_str(); n > 0; ++scan, --n) { if (*scan == '\n') { ++numNewlines; } } if (numNewlines == 0) { return src; } // allocate new string CString dst; dst.reserve(src.size() + numNewlines); // copy string, converting newlines n = (UInt32)src.size(); for (const char* scan = src.c_str(); n > 0; ++scan, --n) { if (scan[0] == '\n') { dst += '\r'; } dst += scan[0]; } return dst; } CString CMSWindowsClipboardAnyTextConverter::convertLinefeedToUnix( const CString& src) const { // count newlines in string UInt32 numNewlines = 0; UInt32 n = (UInt32)src.size(); for (const char* scan = src.c_str(); n > 0; ++scan, --n) { if (scan[0] == '\r' && scan[1] == '\n') { ++numNewlines; } } if (numNewlines == 0) { return src; } // allocate new string CString dst; dst.reserve(src.size()); // copy string, converting newlines n = (UInt32)src.size(); for (const char* scan = src.c_str(); n > 0; ++scan, --n) { if (scan[0] != '\r' || scan[1] != '\n') { dst += scan[0]; } } return dst; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardAnyTextConverter.h0000600000175000017500000000373212021261364027065 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDANYTEXTCONVERTER_H #define CMSWINDOWSCLIPBOARDANYTEXTCONVERTER_H #include "CMSWindowsClipboard.h" //! Convert to/from some text encoding class CMSWindowsClipboardAnyTextConverter : public IMSWindowsClipboardConverter { public: CMSWindowsClipboardAnyTextConverter(); virtual ~CMSWindowsClipboardAnyTextConverter(); // IMSWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual UINT getWin32Format() const = 0; virtual HANDLE fromIClipboard(const CString&) const; virtual CString toIClipboard(HANDLE) const; protected: //! Convert from IClipboard format /*! Do UTF-8 conversion only. Memory handle allocation and linefeed conversion is done by this class. doFromIClipboard() must include the nul terminator in the returned string (not including the CString's nul terminator). */ virtual CString doFromIClipboard(const CString&) const = 0; //! Convert to IClipboard format /*! Do UTF-8 conversion only. Memory handle allocation and linefeed conversion is done by this class. */ virtual CString doToIClipboard(const CString&) const = 0; private: CString convertLinefeedToWin32(const CString&) const; CString convertLinefeedToUnix(const CString&) const; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardBitmapConverter.cpp0000600000175000017500000001025612021261364027237 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboardBitmapConverter.h" #include "CLog.h" // // CMSWindowsClipboardBitmapConverter // CMSWindowsClipboardBitmapConverter::CMSWindowsClipboardBitmapConverter() { // do nothing } CMSWindowsClipboardBitmapConverter::~CMSWindowsClipboardBitmapConverter() { // do nothing } IClipboard::EFormat CMSWindowsClipboardBitmapConverter::getFormat() const { return IClipboard::kBitmap; } UINT CMSWindowsClipboardBitmapConverter::getWin32Format() const { return CF_DIB; } HANDLE CMSWindowsClipboardBitmapConverter::fromIClipboard(const CString& data) const { // copy to memory handle HGLOBAL gData = GlobalAlloc(GMEM_MOVEABLE | GMEM_DDESHARE, data.size()); if (gData != NULL) { // get a pointer to the allocated memory char* dst = (char*)GlobalLock(gData); if (dst != NULL) { memcpy(dst, data.data(), data.size()); GlobalUnlock(gData); } else { GlobalFree(gData); gData = NULL; } } return gData; } CString CMSWindowsClipboardBitmapConverter::toIClipboard(HANDLE data) const { // get datator const char* src = (const char*)GlobalLock(data); if (src == NULL) { return CString(); } UInt32 srcSize = (UInt32)GlobalSize(data); // check image type const BITMAPINFO* bitmap = reinterpret_cast(src); LOG((CLOG_INFO "bitmap: %dx%d %d", bitmap->bmiHeader.biWidth, bitmap->bmiHeader.biHeight, (int)bitmap->bmiHeader.biBitCount)); if (bitmap->bmiHeader.biPlanes == 1 && (bitmap->bmiHeader.biBitCount == 24 || bitmap->bmiHeader.biBitCount == 32) && bitmap->bmiHeader.biCompression == BI_RGB) { // already in canonical form CString image(src, srcSize); GlobalUnlock(data); return image; } // create a destination DIB section LOG((CLOG_INFO "convert image from: depth=%d comp=%d", bitmap->bmiHeader.biBitCount, bitmap->bmiHeader.biCompression)); void* raw; BITMAPINFOHEADER info; LONG w = bitmap->bmiHeader.biWidth; LONG h = bitmap->bmiHeader.biHeight; info.biSize = sizeof(BITMAPINFOHEADER); info.biWidth = w; info.biHeight = h; info.biPlanes = 1; info.biBitCount = 32; info.biCompression = BI_RGB; info.biSizeImage = 0; info.biXPelsPerMeter = 1000; info.biYPelsPerMeter = 1000; info.biClrUsed = 0; info.biClrImportant = 0; HDC dc = GetDC(NULL); HBITMAP dst = CreateDIBSection(dc, (BITMAPINFO*)&info, DIB_RGB_COLORS, &raw, NULL, 0); // find the start of the pixel data const char* srcBits = (const char*)bitmap + bitmap->bmiHeader.biSize; if (bitmap->bmiHeader.biBitCount >= 16) { if (bitmap->bmiHeader.biCompression == BI_BITFIELDS && (bitmap->bmiHeader.biBitCount == 16 || bitmap->bmiHeader.biBitCount == 32)) { srcBits += 3 * sizeof(DWORD); } } else if (bitmap->bmiHeader.biClrUsed != 0) { srcBits += bitmap->bmiHeader.biClrUsed * sizeof(RGBQUAD); } else { //http://msdn.microsoft.com/en-us/library/ke55d167(VS.80).aspx srcBits += (1i64 << bitmap->bmiHeader.biBitCount) * sizeof(RGBQUAD); } // copy source image to destination image HDC dstDC = CreateCompatibleDC(dc); HGDIOBJ oldBitmap = SelectObject(dstDC, dst); SetDIBitsToDevice(dstDC, 0, 0, w, h, 0, 0, 0, h, srcBits, bitmap, DIB_RGB_COLORS); SelectObject(dstDC, oldBitmap); DeleteDC(dstDC); GdiFlush(); // extract data CString image((const char*)&info, info.biSize); image.append((const char*)raw, 4 * w * h); // clean up GDI DeleteObject(dst); ReleaseDC(NULL, dc); // release handle GlobalUnlock(data); return image; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardBitmapConverter.h0000600000175000017500000000246012021261364026702 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDBITMAPCONVERTER_H #define CMSWINDOWSCLIPBOARDBITMAPCONVERTER_H #include "CMSWindowsClipboard.h" //! Convert to/from some text encoding class CMSWindowsClipboardBitmapConverter : public IMSWindowsClipboardConverter { public: CMSWindowsClipboardBitmapConverter(); virtual ~CMSWindowsClipboardBitmapConverter(); // IMSWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual UINT getWin32Format() const; virtual HANDLE fromIClipboard(const CString&) const; virtual CString toIClipboard(HANDLE) const; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardFacade.cpp0000600000175000017500000000207612021261364025277 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboard.h" #include "CMSWindowsClipboardFacade.h" void CMSWindowsClipboardFacade::write(HANDLE win32Data, UINT win32Format) { if (SetClipboardData(win32Format, win32Data) == NULL) { // free converted data if we couldn't put it on // the clipboard. // nb: couldn't cause this in integ tests. GlobalFree(win32Data); } } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardFacade.h0000600000175000017500000000177012021261364024744 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDFACADE_H #define CMSWINDOWSCLIPBOARDFACADE_H #include "IMSWindowsClipboardFacade.h" #include "IClipboard.h" class CMSWindowsClipboardFacade : public IMSWindowsClipboardFacade { public: virtual void write(HANDLE win32Data, UINT win32Format); }; #endifsynergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardHTMLConverter.cpp0000600000175000017500000000650612021261364026572 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboardHTMLConverter.h" #include "CStringUtil.h" // // CMSWindowsClipboardHTMLConverter // CMSWindowsClipboardHTMLConverter::CMSWindowsClipboardHTMLConverter() { m_format = RegisterClipboardFormat("HTML Format"); } CMSWindowsClipboardHTMLConverter::~CMSWindowsClipboardHTMLConverter() { // do nothing } IClipboard::EFormat CMSWindowsClipboardHTMLConverter::getFormat() const { return IClipboard::kHTML; } UINT CMSWindowsClipboardHTMLConverter::getWin32Format() const { return m_format; } CString CMSWindowsClipboardHTMLConverter::doFromIClipboard(const CString& data) const { // prepare to CF_HTML format prefix and suffix CString prefix("Version:0.9\r\nStartHTML:0000000105\r\n" "EndHTML:ZZZZZZZZZZ\r\n" "StartFragment:XXXXXXXXXX\r\nEndFragment:YYYYYYYYYY\r\n" ""); CString suffix("\r\n"); // Get byte offsets for header UInt32 StartFragment = (UInt32)prefix.size(); UInt32 EndFragment = StartFragment + (UInt32)data.size(); // StartHTML is constant by the design of the prefix UInt32 EndHTML = EndFragment + (UInt32)suffix.size(); prefix.replace(prefix.find("XXXXXXXXXX"), 10, CStringUtil::print("%010u", StartFragment)); prefix.replace(prefix.find("YYYYYYYYYY"), 10, CStringUtil::print("%010u", EndFragment)); prefix.replace(prefix.find("ZZZZZZZZZZ"), 10, CStringUtil::print("%010u", EndHTML)); // concatenate prefix += data; prefix += suffix; return prefix; } CString CMSWindowsClipboardHTMLConverter::doToIClipboard(const CString& data) const { // get fragment start/end args CString startArg = findArg(data, "StartFragment"); CString endArg = findArg(data, "EndFragment"); if (startArg.empty() || endArg.empty()) { return CString(); } // convert args to integers SInt32 start = (SInt32)atoi(startArg.c_str()); SInt32 end = (SInt32)atoi(endArg.c_str()); if (start <= 0 || end <= 0 || start >= end) { return CString(); } // extract the fragment return data.substr(start, end - start); } CString CMSWindowsClipboardHTMLConverter::findArg( const CString& data, const CString& name) const { CString::size_type i = data.find(name); if (i == CString::npos) { return CString(); } i = data.find_first_of(":\r\n", i); if (i == CString::npos || data[i] != ':') { return CString(); } i = data.find_first_of("0123456789\r\n", i + 1); if (i == CString::npos || data[i] == '\r' || data[i] == '\n') { return CString(); } CString::size_type j = data.find_first_not_of("0123456789", i); if (j == CString::npos) { j = data.size(); } return data.substr(i, j - i); } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardHTMLConverter.h0000600000175000017500000000275712021261364026243 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDHTMLCONVERTER_H #define CMSWINDOWSCLIPBOARDHTMLCONVERTER_H #include "CMSWindowsClipboardAnyTextConverter.h" //! Convert to/from HTML encoding class CMSWindowsClipboardHTMLConverter : public CMSWindowsClipboardAnyTextConverter { public: CMSWindowsClipboardHTMLConverter(); virtual ~CMSWindowsClipboardHTMLConverter(); // IMSWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual UINT getWin32Format() const; protected: // CMSWindowsClipboardAnyTextConverter overrides virtual CString doFromIClipboard(const CString&) const; virtual CString doToIClipboard(const CString&) const; private: CString findArg(const CString& data, const CString& name) const; private: UINT m_format; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardTextConverter.cpp0000600000175000017500000000304012021261364026740 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboardTextConverter.h" #include "CUnicode.h" // // CMSWindowsClipboardTextConverter // CMSWindowsClipboardTextConverter::CMSWindowsClipboardTextConverter() { // do nothing } CMSWindowsClipboardTextConverter::~CMSWindowsClipboardTextConverter() { // do nothing } UINT CMSWindowsClipboardTextConverter::getWin32Format() const { return CF_TEXT; } CString CMSWindowsClipboardTextConverter::doFromIClipboard(const CString& data) const { // convert and add nul terminator return CUnicode::UTF8ToText(data) += '\0'; } CString CMSWindowsClipboardTextConverter::doToIClipboard(const CString& data) const { // convert and truncate at first nul terminator CString dst = CUnicode::textToUTF8(data); CString::size_type n = dst.find('\0'); if (n != CString::npos) { dst.erase(n); } return dst; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardTextConverter.h0000600000175000017500000000252412021261364026413 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDTEXTCONVERTER_H #define CMSWINDOWSCLIPBOARDTEXTCONVERTER_H #include "CMSWindowsClipboardAnyTextConverter.h" //! Convert to/from locale text encoding class CMSWindowsClipboardTextConverter : public CMSWindowsClipboardAnyTextConverter { public: CMSWindowsClipboardTextConverter(); virtual ~CMSWindowsClipboardTextConverter(); // IMSWindowsClipboardConverter overrides virtual UINT getWin32Format() const; protected: // CMSWindowsClipboardAnyTextConverter overrides virtual CString doFromIClipboard(const CString&) const; virtual CString doToIClipboard(const CString&) const; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardUTF16Converter.cpp0000600000175000017500000000307112021261364026625 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboardUTF16Converter.h" #include "CUnicode.h" // // CMSWindowsClipboardUTF16Converter // CMSWindowsClipboardUTF16Converter::CMSWindowsClipboardUTF16Converter() { // do nothing } CMSWindowsClipboardUTF16Converter::~CMSWindowsClipboardUTF16Converter() { // do nothing } UINT CMSWindowsClipboardUTF16Converter::getWin32Format() const { return CF_UNICODETEXT; } CString CMSWindowsClipboardUTF16Converter::doFromIClipboard(const CString& data) const { // convert and add nul terminator return CUnicode::UTF8ToUTF16(data).append(sizeof(wchar_t), 0); } CString CMSWindowsClipboardUTF16Converter::doToIClipboard(const CString& data) const { // convert and strip nul terminator CString dst = CUnicode::UTF16ToUTF8(data); CString::size_type n = dst.find('\0'); if (n != CString::npos) { dst.erase(n); } return dst; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsClipboardUTF16Converter.h0000600000175000017500000000252412021261364026274 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSCLIPBOARDUTF16CONVERTER_H #define CMSWINDOWSCLIPBOARDUTF16CONVERTER_H #include "CMSWindowsClipboardAnyTextConverter.h" //! Convert to/from UTF-16 encoding class CMSWindowsClipboardUTF16Converter : public CMSWindowsClipboardAnyTextConverter { public: CMSWindowsClipboardUTF16Converter(); virtual ~CMSWindowsClipboardUTF16Converter(); // IMSWindowsClipboardConverter overrides virtual UINT getWin32Format() const; protected: // CMSWindowsClipboardAnyTextConverter overrides virtual CString doFromIClipboard(const CString&) const; virtual CString doToIClipboard(const CString&) const; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsDebugOutputter.cpp0000600000175000017500000000242712021261364025276 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsDebugOutputter.h" #define WIN32_LEAN_AND_MEAN #include #include CMSWindowsDebugOutputter::CMSWindowsDebugOutputter() { } CMSWindowsDebugOutputter::~CMSWindowsDebugOutputter() { } void CMSWindowsDebugOutputter::open(const char* title) { } void CMSWindowsDebugOutputter::close() { } void CMSWindowsDebugOutputter::show(bool showIfEmpty) { } bool CMSWindowsDebugOutputter::write(ELevel level, const char* msg) { OutputDebugString((std::string(msg) + "\n").c_str()); return true; } void CMSWindowsDebugOutputter::flush() { } synergy-1.4.12-Source/src/lib/platform/CMSWindowsDebugOutputter.h0000600000175000017500000000241612021261364024741 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "ILogOutputter.h" //! Write log to debugger /*! This outputter writes output to the debugger. In Visual Studio, this can be seen in the Output window. */ class CMSWindowsDebugOutputter : public ILogOutputter { public: CMSWindowsDebugOutputter(); virtual ~CMSWindowsDebugOutputter(); // ILogOutputter overrides virtual void open(const char* title); virtual void close(); virtual void show(bool showIfEmpty); virtual bool write(ELevel level, const char* message); virtual void flush(); }; synergy-1.4.12-Source/src/lib/platform/CMSWindowsDesks.cpp0000600000175000017500000006677312021261364023403 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsDesks.h" #include "CMSWindowsScreen.h" #include "CSynergyHook.h" #include "IScreenSaver.h" #include "XScreen.h" #include "CLock.h" #include "CThread.h" #include "CLog.h" #include "IEventQueue.h" #include "IJob.h" #include "TMethodEventJob.h" #include "TMethodJob.h" #include "CArchMiscWindows.h" #include #include "IEventQueue.h" // these are only defined when WINVER >= 0x0500 #if !defined(SPI_GETMOUSESPEED) #define SPI_GETMOUSESPEED 112 #endif #if !defined(SPI_SETMOUSESPEED) #define SPI_SETMOUSESPEED 113 #endif #if !defined(SPI_GETSCREENSAVERRUNNING) #define SPI_GETSCREENSAVERRUNNING 114 #endif // X button stuff #if !defined(WM_XBUTTONDOWN) #define WM_XBUTTONDOWN 0x020B #define WM_XBUTTONUP 0x020C #define WM_XBUTTONDBLCLK 0x020D #define WM_NCXBUTTONDOWN 0x00AB #define WM_NCXBUTTONUP 0x00AC #define WM_NCXBUTTONDBLCLK 0x00AD #define MOUSEEVENTF_XDOWN 0x0080 #define MOUSEEVENTF_XUP 0x0100 #define XBUTTON1 0x0001 #define XBUTTON2 0x0002 #endif #if !defined(VK_XBUTTON1) #define VK_XBUTTON1 0x05 #define VK_XBUTTON2 0x06 #endif // ; #define SYNERGY_MSG_SWITCH SYNERGY_HOOK_LAST_MSG + 1 // ; #define SYNERGY_MSG_ENTER SYNERGY_HOOK_LAST_MSG + 2 // ; #define SYNERGY_MSG_LEAVE SYNERGY_HOOK_LAST_MSG + 3 // wParam = flags, HIBYTE(lParam) = virtual key, LOBYTE(lParam) = scan code #define SYNERGY_MSG_FAKE_KEY SYNERGY_HOOK_LAST_MSG + 4 // flags, XBUTTON id #define SYNERGY_MSG_FAKE_BUTTON SYNERGY_HOOK_LAST_MSG + 5 // x; y #define SYNERGY_MSG_FAKE_MOVE SYNERGY_HOOK_LAST_MSG + 6 // xDelta; yDelta #define SYNERGY_MSG_FAKE_WHEEL SYNERGY_HOOK_LAST_MSG + 7 // POINT*; #define SYNERGY_MSG_CURSOR_POS SYNERGY_HOOK_LAST_MSG + 8 // IKeyState*; #define SYNERGY_MSG_SYNC_KEYS SYNERGY_HOOK_LAST_MSG + 9 // install; #define SYNERGY_MSG_SCREENSAVER SYNERGY_HOOK_LAST_MSG + 10 // dx; dy #define SYNERGY_MSG_FAKE_REL_MOVE SYNERGY_HOOK_LAST_MSG + 11 // enable; #define SYNERGY_MSG_FAKE_INPUT SYNERGY_HOOK_LAST_MSG + 12 // // CMSWindowsDesks // CMSWindowsDesks::CMSWindowsDesks( bool isPrimary, bool noHooks, HINSTANCE hookLibrary, const IScreenSaver* screensaver, IEventQueue& eventQueue, IJob* updateKeys, bool stopOnDeskSwitch) : m_isPrimary(isPrimary), m_noHooks(noHooks), m_is95Family(CArchMiscWindows::isWindows95Family()), m_isModernFamily(CArchMiscWindows::isWindowsModern()), m_isOnScreen(m_isPrimary), m_x(0), m_y(0), m_w(0), m_h(0), m_xCenter(0), m_yCenter(0), m_multimon(false), m_timer(NULL), m_screensaver(screensaver), m_screensaverNotify(false), m_activeDesk(NULL), m_activeDeskName(), m_mutex(), m_deskReady(&m_mutex, false), m_updateKeys(updateKeys), m_eventQueue(eventQueue), m_stopOnDeskSwitch(stopOnDeskSwitch) { if (hookLibrary != NULL) queryHookLibrary(hookLibrary); m_cursor = createBlankCursor(); m_deskClass = createDeskWindowClass(m_isPrimary); m_keyLayout = GetKeyboardLayout(GetCurrentThreadId()); resetOptions(); } CMSWindowsDesks::~CMSWindowsDesks() { disable(); destroyClass(m_deskClass); destroyCursor(m_cursor); delete m_updateKeys; } void CMSWindowsDesks::enable() { m_threadID = GetCurrentThreadId(); // set the active desk and (re)install the hooks checkDesk(); // install the desk timer. this timer periodically checks // which desk is active and reinstalls the hooks as necessary. // we wouldn't need this if windows notified us of a desktop // change but as far as i can tell it doesn't. m_timer = m_eventQueue.newTimer(0.2, NULL); m_eventQueue.adoptHandler(CEvent::kTimer, m_timer, new TMethodEventJob( this, &CMSWindowsDesks::handleCheckDesk)); updateKeys(); } void CMSWindowsDesks::disable() { // remove timer if (m_timer != NULL) { m_eventQueue.removeHandler(CEvent::kTimer, m_timer); m_eventQueue.deleteTimer(m_timer); m_timer = NULL; } // destroy desks removeDesks(); m_isOnScreen = m_isPrimary; } void CMSWindowsDesks::enter() { sendMessage(SYNERGY_MSG_ENTER, 0, 0); } void CMSWindowsDesks::leave(HKL keyLayout) { sendMessage(SYNERGY_MSG_LEAVE, (WPARAM)keyLayout, 0); } void CMSWindowsDesks::resetOptions() { m_leaveForegroundOption = false; } void CMSWindowsDesks::setOptions(const COptionsList& options) { for (UInt32 i = 0, n = (UInt32)options.size(); i < n; i += 2) { if (options[i] == kOptionWin32KeepForeground) { m_leaveForegroundOption = (options[i + 1] != 0); LOG((CLOG_DEBUG1 "%s the foreground window", m_leaveForegroundOption ? "don\'t grab" : "grab")); } } } void CMSWindowsDesks::updateKeys() { sendMessage(SYNERGY_MSG_SYNC_KEYS, 0, 0); } void CMSWindowsDesks::setShape(SInt32 x, SInt32 y, SInt32 width, SInt32 height, SInt32 xCenter, SInt32 yCenter, bool isMultimon) { m_x = x; m_y = y; m_w = width; m_h = height; m_xCenter = xCenter; m_yCenter = yCenter; m_multimon = isMultimon; } void CMSWindowsDesks::installScreensaverHooks(bool install) { if (m_isPrimary && m_screensaverNotify != install) { m_screensaverNotify = install; sendMessage(SYNERGY_MSG_SCREENSAVER, install, 0); } } void CMSWindowsDesks::fakeInputBegin() { sendMessage(SYNERGY_MSG_FAKE_INPUT, 1, 0); } void CMSWindowsDesks::fakeInputEnd() { sendMessage(SYNERGY_MSG_FAKE_INPUT, 0, 0); } void CMSWindowsDesks::getCursorPos(SInt32& x, SInt32& y) const { POINT pos; sendMessage(SYNERGY_MSG_CURSOR_POS, reinterpret_cast(&pos), 0); x = pos.x; y = pos.y; } void CMSWindowsDesks::fakeKeyEvent( KeyButton button, UINT virtualKey, bool press, bool /*isAutoRepeat*/) const { // win 95 family doesn't understand handed modifier virtual keys if (m_is95Family) { switch (virtualKey) { case VK_LSHIFT: case VK_RSHIFT: virtualKey = VK_SHIFT; break; case VK_LCONTROL: case VK_RCONTROL: virtualKey = VK_CONTROL; break; case VK_LMENU: case VK_RMENU: virtualKey = VK_MENU; break; } } // synthesize event DWORD flags = 0; if (((button & 0x100u) != 0)) { flags |= KEYEVENTF_EXTENDEDKEY; } if (!press) { flags |= KEYEVENTF_KEYUP; } sendMessage(SYNERGY_MSG_FAKE_KEY, flags, MAKEWORD(static_cast(button & 0xffu), static_cast(virtualKey & 0xffu))); } void CMSWindowsDesks::fakeMouseButton(ButtonID button, bool press) { // the system will swap the meaning of left/right for us if // the user has configured a left-handed mouse but we don't // want it to swap since we want the handedness of the // server's mouse. so pre-swap for a left-handed mouse. if (GetSystemMetrics(SM_SWAPBUTTON)) { switch (button) { case kButtonLeft: button = kButtonRight; break; case kButtonRight: button = kButtonLeft; break; } } // map button id to button flag and button data DWORD data = 0; DWORD flags; switch (button) { case kButtonLeft: flags = press ? MOUSEEVENTF_LEFTDOWN : MOUSEEVENTF_LEFTUP; break; case kButtonMiddle: flags = press ? MOUSEEVENTF_MIDDLEDOWN : MOUSEEVENTF_MIDDLEUP; break; case kButtonRight: flags = press ? MOUSEEVENTF_RIGHTDOWN : MOUSEEVENTF_RIGHTUP; break; case kButtonExtra0 + 0: data = XBUTTON1; flags = press ? MOUSEEVENTF_XDOWN : MOUSEEVENTF_XUP; break; case kButtonExtra0 + 1: data = XBUTTON2; flags = press ? MOUSEEVENTF_XDOWN : MOUSEEVENTF_XUP; break; default: return; } // do it sendMessage(SYNERGY_MSG_FAKE_BUTTON, flags, data); } void CMSWindowsDesks::fakeMouseMove(SInt32 x, SInt32 y) const { sendMessage(SYNERGY_MSG_FAKE_MOVE, static_cast(x), static_cast(y)); } void CMSWindowsDesks::fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const { sendMessage(SYNERGY_MSG_FAKE_REL_MOVE, static_cast(dx), static_cast(dy)); } void CMSWindowsDesks::fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const { sendMessage(SYNERGY_MSG_FAKE_WHEEL, xDelta, yDelta); } void CMSWindowsDesks::sendMessage(UINT msg, WPARAM wParam, LPARAM lParam) const { if (m_activeDesk != NULL && m_activeDesk->m_window != NULL) { PostThreadMessage(m_activeDesk->m_threadID, msg, wParam, lParam); waitForDesk(); } } void CMSWindowsDesks::queryHookLibrary(HINSTANCE hookLibrary) { // look up functions if (m_isPrimary && !m_noHooks) { m_install = (InstallFunc)GetProcAddress(hookLibrary, "install"); m_uninstall = (UninstallFunc)GetProcAddress(hookLibrary, "uninstall"); m_installScreensaver = (InstallScreenSaverFunc)GetProcAddress( hookLibrary, "installScreenSaver"); m_uninstallScreensaver = (UninstallScreenSaverFunc)GetProcAddress( hookLibrary, "uninstallScreenSaver"); if (m_install == NULL || m_uninstall == NULL || m_installScreensaver == NULL || m_uninstallScreensaver == NULL) { LOG((CLOG_ERR "Invalid hook library")); throw XScreenOpenFailure(); } } else { m_install = NULL; m_uninstall = NULL; m_installScreensaver = NULL; m_uninstallScreensaver = NULL; } } HCURSOR CMSWindowsDesks::createBlankCursor() const { // create a transparent cursor int cw = GetSystemMetrics(SM_CXCURSOR); int ch = GetSystemMetrics(SM_CYCURSOR); UInt8* cursorAND = new UInt8[ch * ((cw + 31) >> 2)]; UInt8* cursorXOR = new UInt8[ch * ((cw + 31) >> 2)]; memset(cursorAND, 0xff, ch * ((cw + 31) >> 2)); memset(cursorXOR, 0x00, ch * ((cw + 31) >> 2)); HCURSOR c = CreateCursor(CMSWindowsScreen::getWindowInstance(), 0, 0, cw, ch, cursorAND, cursorXOR); delete[] cursorXOR; delete[] cursorAND; return c; } void CMSWindowsDesks::destroyCursor(HCURSOR cursor) const { if (cursor != NULL) { DestroyCursor(cursor); } } ATOM CMSWindowsDesks::createDeskWindowClass(bool isPrimary) const { WNDCLASSEX classInfo; classInfo.cbSize = sizeof(classInfo); classInfo.style = CS_DBLCLKS | CS_NOCLOSE; classInfo.lpfnWndProc = isPrimary ? &CMSWindowsDesks::primaryDeskProc : &CMSWindowsDesks::secondaryDeskProc; classInfo.cbClsExtra = 0; classInfo.cbWndExtra = 0; classInfo.hInstance = CMSWindowsScreen::getWindowInstance(); classInfo.hIcon = NULL; classInfo.hCursor = m_cursor; classInfo.hbrBackground = NULL; classInfo.lpszMenuName = NULL; classInfo.lpszClassName = "SynergyDesk"; classInfo.hIconSm = NULL; return RegisterClassEx(&classInfo); } void CMSWindowsDesks::destroyClass(ATOM windowClass) const { if (windowClass != 0) { UnregisterClass(reinterpret_cast(windowClass), CMSWindowsScreen::getWindowInstance()); } } HWND CMSWindowsDesks::createWindow(ATOM windowClass, const char* name) const { HWND window = CreateWindowEx(WS_EX_TOPMOST | WS_EX_TRANSPARENT | WS_EX_TOOLWINDOW, reinterpret_cast(windowClass), name, WS_POPUP, 0, 0, 1, 1, NULL, NULL, CMSWindowsScreen::getWindowInstance(), NULL); if (window == NULL) { LOG((CLOG_ERR "failed to create window: %d", GetLastError())); throw XScreenOpenFailure(); } return window; } void CMSWindowsDesks::destroyWindow(HWND hwnd) const { if (hwnd != NULL) { DestroyWindow(hwnd); } } LRESULT CALLBACK CMSWindowsDesks::primaryDeskProc( HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { return DefWindowProc(hwnd, msg, wParam, lParam); } LRESULT CALLBACK CMSWindowsDesks::secondaryDeskProc( HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { // would like to detect any local user input and hide the hider // window but for now we just detect mouse motion. bool hide = false; switch (msg) { case WM_MOUSEMOVE: if (LOWORD(lParam) != 0 || HIWORD(lParam) != 0) { hide = true; } break; } if (hide && IsWindowVisible(hwnd)) { ReleaseCapture(); SetWindowPos(hwnd, HWND_BOTTOM, 0, 0, 0, 0, SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE | SWP_HIDEWINDOW); } return DefWindowProc(hwnd, msg, wParam, lParam); } void CMSWindowsDesks::deskMouseMove(SInt32 x, SInt32 y) const { // motion is simple (i.e. it's on the primary monitor) if there // is only one monitor. it's also simple if we're not on the // windows 95 family since those platforms don't have a broken // mouse_event() function (see the comment below). bool simple = (!m_multimon || !m_is95Family); if (!simple) { // also simple if motion is within the primary monitor simple = (x >= 0 && x < GetSystemMetrics(SM_CXSCREEN) && y >= 0 && y < GetSystemMetrics(SM_CYSCREEN)); } // move the mouse directly to target position if motion is simple if (simple) { // when using absolute positioning with mouse_event(), // the normalized device coordinates range over only // the primary screen. SInt32 w = GetSystemMetrics(SM_CXSCREEN); SInt32 h = GetSystemMetrics(SM_CYSCREEN); mouse_event(MOUSEEVENTF_MOVE | MOUSEEVENTF_ABSOLUTE, (DWORD)((65535.0f * x) / (w - 1) + 0.5f), (DWORD)((65535.0f * y) / (h - 1) + 0.5f), 0, 0); } // windows 98 and Me are broken. you cannot set the absolute // position of the mouse except on the primary monitor but you // can do relative moves onto any monitor. this is, in microsoft's // words, "by design." apparently the designers of windows 2000 // we're a little less lazy and did it right. // // microsoft recommends in Q193003 to absolute position the cursor // somewhere on the primary monitor then relative move to the // desired location. this doesn't work for us because when the // user drags a scrollbar, a window, etc. it causes the dragged // item to jump back and forth between the position on the primary // monitor and the desired position. while it always ends up in // the right place, the effect is disconcerting. // // instead we'll get the cursor's current position and do just a // relative move from there to the desired position. else { POINT pos; GetCursorPos(&pos); deskMouseRelativeMove(x - pos.x, y - pos.y); } } void CMSWindowsDesks::deskMouseRelativeMove(SInt32 dx, SInt32 dy) const { // relative moves are subject to cursor acceleration which we don't // want.so we disable acceleration, do the relative move, then // restore acceleration. there's a slight chance we'll end up in // the wrong place if the user moves the cursor using this system's // mouse while simultaneously moving the mouse on the server // system. that defeats the purpose of synergy so we'll assume // that won't happen. even if it does, the next mouse move will // correct the position. // save mouse speed & acceleration int oldSpeed[4]; bool accelChanged = SystemParametersInfo(SPI_GETMOUSE,0, oldSpeed, 0) && SystemParametersInfo(SPI_GETMOUSESPEED, 0, oldSpeed + 3, 0); // use 1:1 motion if (accelChanged) { int newSpeed[4] = { 0, 0, 0, 1 }; accelChanged = SystemParametersInfo(SPI_SETMOUSE, 0, newSpeed, 0) || SystemParametersInfo(SPI_SETMOUSESPEED, 0, newSpeed + 3, 0); } // move relative to mouse position mouse_event(MOUSEEVENTF_MOVE, dx, dy, 0, 0); // restore mouse speed & acceleration if (accelChanged) { SystemParametersInfo(SPI_SETMOUSE, 0, oldSpeed, 0); SystemParametersInfo(SPI_SETMOUSESPEED, 0, oldSpeed + 3, 0); } } void CMSWindowsDesks::deskEnter(CDesk* desk) { if (!m_isPrimary) { ReleaseCapture(); } ShowCursor(TRUE); SetWindowPos(desk->m_window, HWND_BOTTOM, 0, 0, 0, 0, SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE | SWP_HIDEWINDOW); // restore the foreground window // XXX -- this raises the window to the top of the Z-order. we // want it to stay wherever it was to properly support X-mouse // (mouse over activation) but i've no idea how to do that. // the obvious workaround of using SetWindowPos() to move it back // after being raised doesn't work. DWORD thisThread = GetWindowThreadProcessId(desk->m_window, NULL); DWORD thatThread = GetWindowThreadProcessId(desk->m_foregroundWindow, NULL); AttachThreadInput(thatThread, thisThread, TRUE); SetForegroundWindow(desk->m_foregroundWindow); AttachThreadInput(thatThread, thisThread, FALSE); EnableWindow(desk->m_window, desk->m_lowLevel ? FALSE : TRUE); desk->m_foregroundWindow = NULL; } void CMSWindowsDesks::deskLeave(CDesk* desk, HKL keyLayout) { ShowCursor(FALSE); if (m_isPrimary) { // map a window to hide the cursor and to use whatever keyboard // layout we choose rather than the keyboard layout of the last // active window. int x, y, w, h; if (desk->m_lowLevel) { // with a low level hook the cursor will never budge so // just a 1x1 window is sufficient. x = m_xCenter; y = m_yCenter; w = 1; h = 1; } else { // with regular hooks the cursor will jitter as it's moved // by the user then back to the center by us. to be sure // we never lose it, cover all the monitors with the window. x = m_x; y = m_y; w = m_w; h = m_h; } SetWindowPos(desk->m_window, HWND_TOPMOST, x, y, w, h, SWP_NOACTIVATE | SWP_SHOWWINDOW); // if not using low-level hooks we have to also activate the // window to ensure we don't lose keyboard focus. // FIXME -- see if this can be avoided. if so then always // disable the window (see handling of SYNERGY_MSG_SWITCH). if (!desk->m_lowLevel) { SetActiveWindow(desk->m_window); } // if using low-level hooks then disable the foreground window // so it can't mess up any of our keyboard events. the console // program, for example, will cause characters to be reported as // unshifted, regardless of the shift key state. interestingly // we do see the shift key go down and up. // // note that we must enable the window to activate it and we // need to disable the window on deskEnter. else { desk->m_foregroundWindow = getForegroundWindow(); if (desk->m_foregroundWindow != NULL) { EnableWindow(desk->m_window, TRUE); SetActiveWindow(desk->m_window); DWORD thisThread = GetWindowThreadProcessId(desk->m_window, NULL); DWORD thatThread = GetWindowThreadProcessId(desk->m_foregroundWindow, NULL); AttachThreadInput(thatThread, thisThread, TRUE); SetForegroundWindow(desk->m_window); AttachThreadInput(thatThread, thisThread, FALSE); } } // switch to requested keyboard layout ActivateKeyboardLayout(keyLayout, 0); } else { // move hider window under the cursor center, raise, and show it SetWindowPos(desk->m_window, HWND_TOPMOST, m_xCenter, m_yCenter, 1, 1, SWP_NOACTIVATE | SWP_SHOWWINDOW); // watch for mouse motion. if we see any then we hide the // hider window so the user can use the physically attached // mouse if desired. we'd rather not capture the mouse but // we aren't notified when the mouse leaves our window. SetCapture(desk->m_window); // warp the mouse to the cursor center LOG((CLOG_DEBUG2 "warping cursor to center: %+d,%+d", m_xCenter, m_yCenter)); deskMouseMove(m_xCenter, m_yCenter); } } void CMSWindowsDesks::deskThread(void* vdesk) { MSG msg; // use given desktop for this thread CDesk* desk = reinterpret_cast(vdesk); desk->m_threadID = GetCurrentThreadId(); desk->m_window = NULL; desk->m_foregroundWindow = NULL; if (desk->m_desk != NULL && SetThreadDesktop(desk->m_desk) != 0) { // create a message queue PeekMessage(&msg, NULL, 0,0, PM_NOREMOVE); // create a window. we use this window to hide the cursor. try { desk->m_window = createWindow(m_deskClass, "SynergyDesk"); LOG((CLOG_DEBUG "desk %s window is 0x%08x", desk->m_name.c_str(), desk->m_window)); } catch (...) { // ignore LOG((CLOG_DEBUG "can't create desk window for %s", desk->m_name.c_str())); } } // tell main thread that we're ready { CLock lock(&m_mutex); m_deskReady = true; m_deskReady.broadcast(); } while (GetMessage(&msg, NULL, 0, 0)) { switch (msg.message) { default: TranslateMessage(&msg); DispatchMessage(&msg); continue; case SYNERGY_MSG_SWITCH: if (m_isPrimary && !m_noHooks) { m_uninstall(); if (m_screensaverNotify) { m_uninstallScreensaver(); m_installScreensaver(); } switch (m_install()) { case kHOOK_FAILED: // we won't work on this desk desk->m_lowLevel = false; break; case kHOOK_OKAY: desk->m_lowLevel = false; break; case kHOOK_OKAY_LL: desk->m_lowLevel = true; break; } // a window on the primary screen with low-level hooks // should never activate. if (desk->m_window) EnableWindow(desk->m_window, desk->m_lowLevel ? FALSE : TRUE); } break; case SYNERGY_MSG_ENTER: m_isOnScreen = true; deskEnter(desk); break; case SYNERGY_MSG_LEAVE: m_isOnScreen = false; m_keyLayout = (HKL)msg.wParam; deskLeave(desk, m_keyLayout); break; case SYNERGY_MSG_FAKE_KEY: keybd_event(HIBYTE(msg.lParam), LOBYTE(msg.lParam), (DWORD)msg.wParam, 0); break; case SYNERGY_MSG_FAKE_BUTTON: if (msg.wParam != 0) { mouse_event((DWORD)msg.wParam, 0, 0, (DWORD)msg.lParam, 0); } break; case SYNERGY_MSG_FAKE_MOVE: deskMouseMove(static_cast(msg.wParam), static_cast(msg.lParam)); break; case SYNERGY_MSG_FAKE_REL_MOVE: deskMouseRelativeMove(static_cast(msg.wParam), static_cast(msg.lParam)); break; case SYNERGY_MSG_FAKE_WHEEL: // XXX -- add support for x-axis scrolling if (msg.lParam != 0) { mouse_event(MOUSEEVENTF_WHEEL, 0, 0, (DWORD)msg.lParam, 0); } break; case SYNERGY_MSG_CURSOR_POS: { POINT* pos = reinterpret_cast(msg.wParam); if (!GetCursorPos(pos)) { pos->x = m_xCenter; pos->y = m_yCenter; } break; } case SYNERGY_MSG_SYNC_KEYS: m_updateKeys->run(); break; case SYNERGY_MSG_SCREENSAVER: if (!m_noHooks) { if (msg.wParam != 0) { m_installScreensaver(); } else { m_uninstallScreensaver(); } } break; case SYNERGY_MSG_FAKE_INPUT: keybd_event(SYNERGY_HOOK_FAKE_INPUT_VIRTUAL_KEY, SYNERGY_HOOK_FAKE_INPUT_SCANCODE, msg.wParam ? 0 : KEYEVENTF_KEYUP, 0); break; } // notify that message was processed CLock lock(&m_mutex); m_deskReady = true; m_deskReady.broadcast(); } // clean up deskEnter(desk); if (desk->m_window != NULL) { DestroyWindow(desk->m_window); } if (desk->m_desk != NULL) { closeDesktop(desk->m_desk); } } CMSWindowsDesks::CDesk* CMSWindowsDesks::addDesk(const CString& name, HDESK hdesk) { CDesk* desk = new CDesk; desk->m_name = name; desk->m_desk = hdesk; desk->m_targetID = GetCurrentThreadId(); desk->m_thread = new CThread(new TMethodJob( this, &CMSWindowsDesks::deskThread, desk)); waitForDesk(); m_desks.insert(std::make_pair(name, desk)); return desk; } void CMSWindowsDesks::removeDesks() { for (CDesks::iterator index = m_desks.begin(); index != m_desks.end(); ++index) { CDesk* desk = index->second; PostThreadMessage(desk->m_threadID, WM_QUIT, 0, 0); desk->m_thread->wait(); delete desk->m_thread; delete desk; } m_desks.clear(); m_activeDesk = NULL; m_activeDeskName = ""; } void CMSWindowsDesks::checkDesk() { // get current desktop. if we already know about it then return. CDesk* desk; HDESK hdesk = openInputDesktop(); CString name = getDesktopName(hdesk); CDesks::const_iterator index = m_desks.find(name); if (index == m_desks.end()) { desk = addDesk(name, hdesk); // hold on to hdesk until thread exits so the desk can't // be removed by the system } else { closeDesktop(hdesk); desk = index->second; } // if we are told to shut down on desk switch, and this is not the // first switch, then shut down. if (m_stopOnDeskSwitch && m_activeDesk != NULL && name != m_activeDeskName) { LOG((CLOG_DEBUG "shutting down because of desk switch to \"%s\"", name.c_str())); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); return; } // if active desktop changed then tell the old and new desk threads // about the change. don't switch desktops when the screensaver is // active becaue we'd most likely switch to the screensaver desktop // which would have the side effect of forcing the screensaver to // stop. if (name != m_activeDeskName && !m_screensaver->isActive()) { // show cursor on previous desk bool wasOnScreen = m_isOnScreen; if (!wasOnScreen) { sendMessage(SYNERGY_MSG_ENTER, 0, 0); } // check for desk accessibility change. we don't get events // from an inaccessible desktop so when we switch from an // inaccessible desktop to an accessible one we have to // update the keyboard state. LOG((CLOG_DEBUG "switched to desk \"%s\"", name.c_str())); bool syncKeys = false; bool isAccessible = isDeskAccessible(desk); if (isDeskAccessible(m_activeDesk) != isAccessible) { if (isAccessible) { LOG((CLOG_DEBUG "desktop is now accessible")); syncKeys = true; } else { LOG((CLOG_DEBUG "desktop is now inaccessible")); } } // switch desk m_activeDesk = desk; m_activeDeskName = name; sendMessage(SYNERGY_MSG_SWITCH, 0, 0); // hide cursor on new desk if (!wasOnScreen) { sendMessage(SYNERGY_MSG_LEAVE, (WPARAM)m_keyLayout, 0); } // update keys if necessary if (syncKeys) { updateKeys(); } } else if (name != m_activeDeskName) { // screen saver might have started PostThreadMessage(m_threadID, SYNERGY_MSG_SCREEN_SAVER, TRUE, 0); } } bool CMSWindowsDesks::isDeskAccessible(const CDesk* desk) const { return (desk != NULL && desk->m_desk != NULL); } void CMSWindowsDesks::waitForDesk() const { CMSWindowsDesks* self = const_cast(this); CLock lock(&m_mutex); while (!(bool)m_deskReady) { m_deskReady.wait(); } self->m_deskReady = false; } void CMSWindowsDesks::handleCheckDesk(const CEvent&, void*) { checkDesk(); // also check if screen saver is running if on a modern OS and // this is the primary screen. if (m_isPrimary && m_isModernFamily) { BOOL running; SystemParametersInfo(SPI_GETSCREENSAVERRUNNING, 0, &running, FALSE); PostThreadMessage(m_threadID, SYNERGY_MSG_SCREEN_SAVER, running, 0); } } HDESK CMSWindowsDesks::openInputDesktop() { if (m_is95Family) { // there's only one desktop on windows 95 et al. return GetThreadDesktop(GetCurrentThreadId()); } else { return OpenInputDesktop(DF_ALLOWOTHERACCOUNTHOOK, TRUE, DESKTOP_CREATEWINDOW | DESKTOP_HOOKCONTROL | GENERIC_WRITE); } } void CMSWindowsDesks::closeDesktop(HDESK desk) { // on 95/98/me we don't need to close the desktop returned by // openInputDesktop(). if (desk != NULL && !m_is95Family) { CloseDesktop(desk); } } CString CMSWindowsDesks::getDesktopName(HDESK desk) { if (desk == NULL) { return CString(); } else if (m_is95Family) { return "desktop"; } else { DWORD size; GetUserObjectInformation(desk, UOI_NAME, NULL, 0, &size); TCHAR* name = (TCHAR*)alloca(size + sizeof(TCHAR)); GetUserObjectInformation(desk, UOI_NAME, name, size, &size); CString result(name); return result; } } HWND CMSWindowsDesks::getForegroundWindow() const { // Ideally we'd return NULL as much as possible, only returning // the actual foreground window when we know it's going to mess // up our keyboard input. For now we'll just let the user // decide. if (m_leaveForegroundOption) { return NULL; } return GetForegroundWindow(); } synergy-1.4.12-Source/src/lib/platform/CMSWindowsDesks.h0000600000175000017500000002046712021261364023036 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSDESKS_H #define CMSWINDOWSDESKS_H #include "CSynergyHook.h" #include "KeyTypes.h" #include "MouseTypes.h" #include "OptionTypes.h" #include "CCondVar.h" #include "CMutex.h" #include "CString.h" #include "stdmap.h" #define WIN32_LEAN_AND_MEAN #include class CEvent; class CEventQueueTimer; class CThread; class IJob; class IScreenSaver; class IEventQueue; //! Microsoft Windows desk handling /*! Desks in Microsoft Windows are only remotely like desktops on X11 systems. A desk is another virtual surface for windows but desks impose serious restrictions: a thread can interact with only one desk at a time, you can't switch desks if the thread has any hooks installed or owns any windows, windows cannot exist on multiple desks at once, etc. Basically, they're useless except for running the login window or the screensaver, which is what they're used for. Synergy must deal with them mainly because of the login window and screensaver but users can create their own desks and synergy should work on those too. This class encapsulates all the desk nastiness. Clients of this object don't have to know anything about desks. */ class CMSWindowsDesks { public: //! Constructor /*! \p isPrimary is true iff the desk is for a primary screen. \p screensaver points to a screensaver object and it's used only to check if the screensaver is active. The \p updateKeys job is adopted and is called when the key state should be updated in a thread attached to the current desk. \p hookLibrary must be a handle to the hook library. */ CMSWindowsDesks( bool isPrimary, bool noHooks, HINSTANCE hookLibrary, const IScreenSaver* screensaver, IEventQueue& eventQueue, IJob* updateKeys, bool stopOnDeskSwitch); ~CMSWindowsDesks(); //! @name manipulators //@{ //! Enable desk tracking /*! Enables desk tracking. While enabled, this object checks to see if the desk has changed and ensures that the hooks are installed on the new desk. \c setShape should be called at least once before calling \c enable. */ void enable(); //! Disable desk tracking /*! Disables desk tracking. \sa enable. */ void disable(); //! Notify of entering a desk /*! Prepares a desk for when the cursor enters it. */ void enter(); //! Notify of leaving a desk /*! Prepares a desk for when the cursor leaves it. */ void leave(HKL keyLayout); //! Notify of options changes /*! Resets all options to their default values. */ void resetOptions(); //! Notify of options changes /*! Set options to given values. Ignores unknown options and doesn't modify options that aren't given in \c options. */ void setOptions(const COptionsList& options); //! Update the key state /*! Causes the key state to get updated to reflect the physical keyboard state and current keyboard mapping. */ void updateKeys(); //! Tell desk about new size /*! This tells the desks that the display size has changed. */ void setShape(SInt32 x, SInt32 y, SInt32 width, SInt32 height, SInt32 xCenter, SInt32 yCenter, bool isMultimon); //! Install/uninstall screensaver hooks /*! If \p install is true then the screensaver hooks are installed and, if desk tracking is enabled, updated whenever the desk changes. If \p install is false then the screensaver hooks are uninstalled. */ void installScreensaverHooks(bool install); //! Start ignoring user input /*! Starts ignoring user input so we don't pick up our own synthesized events. */ void fakeInputBegin(); //! Stop ignoring user input /*! Undoes whatever \c fakeInputBegin() did. */ void fakeInputEnd(); //@} //! @name accessors //@{ //! Get cursor position /*! Return the current position of the cursor in \c x and \c y. */ void getCursorPos(SInt32& x, SInt32& y) const; //! Fake key press/release /*! Synthesize a press or release of key \c button. */ void fakeKeyEvent(KeyButton button, UINT virtualKey, bool press, bool isAutoRepeat) const; //! Fake mouse press/release /*! Synthesize a press or release of mouse button \c id. */ void fakeMouseButton(ButtonID id, bool press); //! Fake mouse move /*! Synthesize a mouse move to the absolute coordinates \c x,y. */ void fakeMouseMove(SInt32 x, SInt32 y) const; //! Fake mouse move /*! Synthesize a mouse move to the relative coordinates \c dx,dy. */ void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const; //! Fake mouse wheel /*! Synthesize a mouse wheel event of amount \c delta in direction \c axis. */ void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const; //@} private: class CDesk { public: CString m_name; CThread* m_thread; DWORD m_threadID; DWORD m_targetID; HDESK m_desk; HWND m_window; HWND m_foregroundWindow; bool m_lowLevel; }; typedef std::map CDesks; // initialization and shutdown operations void queryHookLibrary(HINSTANCE hookLibrary); HCURSOR createBlankCursor() const; void destroyCursor(HCURSOR cursor) const; ATOM createDeskWindowClass(bool isPrimary) const; void destroyClass(ATOM windowClass) const; HWND createWindow(ATOM windowClass, const char* name) const; void destroyWindow(HWND) const; // message handlers void deskMouseMove(SInt32 x, SInt32 y) const; void deskMouseRelativeMove(SInt32 dx, SInt32 dy) const; void deskEnter(CDesk* desk); void deskLeave(CDesk* desk, HKL keyLayout); void deskThread(void* vdesk); void xinputThread(); // desk switch checking and handling CDesk* addDesk(const CString& name, HDESK hdesk); void removeDesks(); void checkDesk(); bool isDeskAccessible(const CDesk* desk) const; void handleCheckDesk(const CEvent& event, void*); // communication with desk threads void waitForDesk() const; void sendMessage(UINT, WPARAM, LPARAM) const; // work around for messed up keyboard events from low-level hooks HWND getForegroundWindow() const; // desk API wrappers HDESK openInputDesktop(); void closeDesktop(HDESK); CString getDesktopName(HDESK); // our desk window procs static LRESULT CALLBACK primaryDeskProc(HWND, UINT, WPARAM, LPARAM); static LRESULT CALLBACK secondaryDeskProc(HWND, UINT, WPARAM, LPARAM); private: // true if screen is being used as a primary screen, false otherwise bool m_isPrimary; // true if hooks are not to be installed (useful for debugging) bool m_noHooks; // true if windows 95/98/me bool m_is95Family; // true if windows 98/2k or higher (i.e. not 95/nt) bool m_isModernFamily; // true if mouse has entered the screen bool m_isOnScreen; // our resources ATOM m_deskClass; HCURSOR m_cursor; // screen shape stuff SInt32 m_x, m_y; SInt32 m_w, m_h; SInt32 m_xCenter, m_yCenter; // true if system appears to have multiple monitors bool m_multimon; // the timer used to check for desktop switching CEventQueueTimer* m_timer; // screen saver stuff DWORD m_threadID; const IScreenSaver* m_screensaver; bool m_screensaverNotify; // the current desk and it's name CDesk* m_activeDesk; CString m_activeDeskName; // one desk per desktop and a cond var to communicate with it CMutex m_mutex; CCondVar m_deskReady; CDesks m_desks; // hook library stuff InstallFunc m_install; UninstallFunc m_uninstall; InstallScreenSaverFunc m_installScreensaver; UninstallScreenSaverFunc m_uninstallScreensaver; // keyboard stuff IJob* m_updateKeys; HKL m_keyLayout; // options bool m_leaveForegroundOption; IEventQueue& m_eventQueue; // true if program should stop on desk switch. bool m_stopOnDeskSwitch; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsEventQueueBuffer.cpp0000600000175000017500000000721212021261364025531 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsEventQueueBuffer.h" #include "CThread.h" #include "IEventQueue.h" #include "CArchMiscWindows.h" // // CEventQueueTimer // class CEventQueueTimer { }; // // CMSWindowsEventQueueBuffer // CMSWindowsEventQueueBuffer::CMSWindowsEventQueueBuffer() { // remember thread. we'll be posting messages to it. m_thread = GetCurrentThreadId(); // create a message type for custom events m_userEvent = RegisterWindowMessage("SYNERGY_USER_EVENT"); // get message type for daemon quit m_daemonQuit = CArchMiscWindows::getDaemonQuitMessage(); // make sure this thread has a message queue MSG dummy; PeekMessage(&dummy, NULL, WM_USER, WM_USER, PM_NOREMOVE); } CMSWindowsEventQueueBuffer::~CMSWindowsEventQueueBuffer() { // do nothing } void CMSWindowsEventQueueBuffer::waitForEvent(double timeout) { // check if messages are available first. if we don't do this then // MsgWaitForMultipleObjects() will block even if the queue isn't // empty if the messages in the queue were there before the last // call to GetMessage()/PeekMessage(). if (HIWORD(GetQueueStatus(QS_ALLINPUT)) != 0) { return; } // convert timeout DWORD t; if (timeout < 0.0) { t = INFINITE; } else { t = (DWORD)(1000.0 * timeout); } // wait for a message. we cannot be interrupted by thread // cancellation but that's okay because we're run in the main // thread and we never cancel that thread. HANDLE dummy[1]; MsgWaitForMultipleObjects(0, dummy, FALSE, t, QS_ALLINPUT); } IEventQueueBuffer::Type CMSWindowsEventQueueBuffer::getEvent(CEvent& event, UInt32& dataID) { // peek at messages first. waiting for QS_ALLINPUT will return // if a message has been sent to our window but GetMessage will // dispatch that message behind our backs and block. PeekMessage // will also dispatch behind our backs but won't block. if (!PeekMessage(&m_event, NULL, 0, 0, PM_NOREMOVE) && !PeekMessage(&m_event, (HWND)-1, 0, 0, PM_NOREMOVE)) { return kNone; } // BOOL. yeah, right. BOOL result = GetMessage(&m_event, NULL, 0, 0); if (result == -1) { return kNone; } else if (result == 0) { event = CEvent(CEvent::kQuit); return kSystem; } else if (m_daemonQuit != 0 && m_event.message == m_daemonQuit) { event = CEvent(CEvent::kQuit); return kSystem; } else if (m_event.message == m_userEvent) { dataID = static_cast(m_event.wParam); return kUser; } else { event = CEvent(CEvent::kSystem, IEventQueue::getSystemTarget(), &m_event); return kSystem; } } bool CMSWindowsEventQueueBuffer::addEvent(UInt32 dataID) { return (PostThreadMessage(m_thread, m_userEvent, static_cast(dataID), 0) != 0); } bool CMSWindowsEventQueueBuffer::isEmpty() const { return (HIWORD(GetQueueStatus(QS_ALLINPUT)) == 0); } CEventQueueTimer* CMSWindowsEventQueueBuffer::newTimer(double, bool) const { return new CEventQueueTimer; } void CMSWindowsEventQueueBuffer::deleteTimer(CEventQueueTimer* timer) const { delete timer; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsEventQueueBuffer.h0000600000175000017500000000274412021261364025203 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSEVENTQUEUEBUFFER_H #define CMSWINDOWSEVENTQUEUEBUFFER_H #include "IEventQueueBuffer.h" #define WIN32_LEAN_AND_MEAN #include //! Event queue buffer for Win32 class CMSWindowsEventQueueBuffer : public IEventQueueBuffer { public: CMSWindowsEventQueueBuffer(); virtual ~CMSWindowsEventQueueBuffer(); // IEventQueueBuffer overrides virtual void waitForEvent(double timeout); virtual Type getEvent(CEvent& event, UInt32& dataID); virtual bool addEvent(UInt32 dataID); virtual bool isEmpty() const; virtual CEventQueueTimer* newTimer(double duration, bool oneShot) const; virtual void deleteTimer(CEventQueueTimer*) const; private: DWORD m_thread; UINT m_userEvent; MSG m_event; UINT m_daemonQuit; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsHookLibraryLoader.cpp0000600000175000017500000000436712021261364025675 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsHookLibraryLoader.h" #include "XScreen.h" #include "CLog.h" CMSWindowsHookLibraryLoader::CMSWindowsHookLibraryLoader() : m_init(NULL), m_cleanup(NULL), m_setSides(NULL), m_setZone(NULL), m_setMode(NULL) { } CMSWindowsHookLibraryLoader::~CMSWindowsHookLibraryLoader() { // TODO: take ownership of m_ and delete them. } HINSTANCE CMSWindowsHookLibraryLoader::openHookLibrary(const char* name) { // load the hook library HINSTANCE hookLibrary = LoadLibrary(name); if (hookLibrary == NULL) { LOG((CLOG_ERR "failed to load hook library, %s.dll is missing or invalid", name)); throw XScreenOpenFailure(); } // look up functions m_setSides = (SetSidesFunc)GetProcAddress(hookLibrary, "setSides"); m_setZone = (SetZoneFunc)GetProcAddress(hookLibrary, "setZone"); m_setMode = (SetModeFunc)GetProcAddress(hookLibrary, "setMode"); m_init = (InitFunc)GetProcAddress(hookLibrary, "init"); m_cleanup = (CleanupFunc)GetProcAddress(hookLibrary, "cleanup"); if (m_setSides == NULL || m_setZone == NULL || m_setMode == NULL || m_init == NULL || m_cleanup == NULL) { LOG((CLOG_ERR "invalid hook library, use a newer %s.dll", name)); throw XScreenOpenFailure(); } // initialize hook library if (m_init(GetCurrentThreadId()) == 0) { LOG((CLOG_ERR "failed to init %s.dll, another program may be using it", name)); LOG((CLOG_INFO "restarting your computer may solve this error")); throw XScreenOpenFailure(); } return hookLibrary; }synergy-1.4.12-Source/src/lib/platform/CMSWindowsHookLibraryLoader.h0000600000175000017500000000244012021261364025330 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSHOOKLIBRARYLOADER_H #define CMSWINDOWSHOOKLIBRARYLOADER_H #define WIN32_LEAN_AND_MEAN #include #include "CSynergyHook.h" //! Loads Windows hook DLLs. class CMSWindowsHookLibraryLoader { public: CMSWindowsHookLibraryLoader(); virtual ~CMSWindowsHookLibraryLoader(); HINSTANCE openHookLibrary(const char* name); // TODO: either make these private or expose properly InitFunc m_init; CleanupFunc m_cleanup; SetSidesFunc m_setSides; SetZoneFunc m_setZone; SetModeFunc m_setMode; private: HINSTANCE m_hookLibrary; }; #endifsynergy-1.4.12-Source/src/lib/platform/CMSWindowsKeyState.cpp0000600000175000017500000013314612021261364024050 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsKeyState.h" #include "CMSWindowsDesks.h" #include "CThread.h" #include "CFunctionJob.h" #include "CLog.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "CArchMiscWindows.h" // extended mouse buttons #if !defined(VK_XBUTTON1) #define VK_XBUTTON1 0x05 #define VK_XBUTTON2 0x06 #endif // // CMSWindowsKeyState // // map virtual keys to synergy key enumeration const KeyID CMSWindowsKeyState::s_virtualKey[] = { /* 0x000 */ { kKeyNone }, // reserved /* 0x001 */ { kKeyNone }, // VK_LBUTTON /* 0x002 */ { kKeyNone }, // VK_RBUTTON /* 0x003 */ { kKeyNone }, // VK_CANCEL /* 0x004 */ { kKeyNone }, // VK_MBUTTON /* 0x005 */ { kKeyNone }, // VK_XBUTTON1 /* 0x006 */ { kKeyNone }, // VK_XBUTTON2 /* 0x007 */ { kKeyNone }, // undefined /* 0x008 */ { kKeyBackSpace }, // VK_BACK /* 0x009 */ { kKeyTab }, // VK_TAB /* 0x00a */ { kKeyNone }, // undefined /* 0x00b */ { kKeyNone }, // undefined /* 0x00c */ { kKeyClear }, // VK_CLEAR /* 0x00d */ { kKeyReturn }, // VK_RETURN /* 0x00e */ { kKeyNone }, // undefined /* 0x00f */ { kKeyNone }, // undefined /* 0x010 */ { kKeyShift_L }, // VK_SHIFT /* 0x011 */ { kKeyControl_L }, // VK_CONTROL /* 0x012 */ { kKeyAlt_L }, // VK_MENU /* 0x013 */ { kKeyPause }, // VK_PAUSE /* 0x014 */ { kKeyCapsLock }, // VK_CAPITAL /* 0x015 */ { kKeyHangulKana }, // VK_HANGUL, VK_KANA /* 0x016 */ { kKeyNone }, // undefined /* 0x017 */ { kKeyNone }, // VK_JUNJA /* 0x018 */ { kKeyNone }, // VK_FINAL /* 0x019 */ { kKeyHanjaKanzi }, // VK_KANJI /* 0x01a */ { kKeyNone }, // undefined /* 0x01b */ { kKeyEscape }, // VK_ESCAPE /* 0x01c */ { kKeyHenkan }, // VK_CONVERT /* 0x01d */ { kKeyNone }, // VK_NONCONVERT /* 0x01e */ { kKeyNone }, // VK_ACCEPT /* 0x01f */ { kKeyNone }, // VK_MODECHANGE /* 0x020 */ { kKeyNone }, // VK_SPACE /* 0x021 */ { kKeyKP_PageUp }, // VK_PRIOR /* 0x022 */ { kKeyKP_PageDown },// VK_NEXT /* 0x023 */ { kKeyKP_End }, // VK_END /* 0x024 */ { kKeyKP_Home }, // VK_HOME /* 0x025 */ { kKeyKP_Left }, // VK_LEFT /* 0x026 */ { kKeyKP_Up }, // VK_UP /* 0x027 */ { kKeyKP_Right }, // VK_RIGHT /* 0x028 */ { kKeyKP_Down }, // VK_DOWN /* 0x029 */ { kKeySelect }, // VK_SELECT /* 0x02a */ { kKeyNone }, // VK_PRINT /* 0x02b */ { kKeyExecute }, // VK_EXECUTE /* 0x02c */ { kKeyPrint }, // VK_SNAPSHOT /* 0x02d */ { kKeyKP_Insert }, // VK_INSERT /* 0x02e */ { kKeyKP_Delete }, // VK_DELETE /* 0x02f */ { kKeyHelp }, // VK_HELP /* 0x030 */ { kKeyNone }, // VK_0 /* 0x031 */ { kKeyNone }, // VK_1 /* 0x032 */ { kKeyNone }, // VK_2 /* 0x033 */ { kKeyNone }, // VK_3 /* 0x034 */ { kKeyNone }, // VK_4 /* 0x035 */ { kKeyNone }, // VK_5 /* 0x036 */ { kKeyNone }, // VK_6 /* 0x037 */ { kKeyNone }, // VK_7 /* 0x038 */ { kKeyNone }, // VK_8 /* 0x039 */ { kKeyNone }, // VK_9 /* 0x03a */ { kKeyNone }, // undefined /* 0x03b */ { kKeyNone }, // undefined /* 0x03c */ { kKeyNone }, // undefined /* 0x03d */ { kKeyNone }, // undefined /* 0x03e */ { kKeyNone }, // undefined /* 0x03f */ { kKeyNone }, // undefined /* 0x040 */ { kKeyNone }, // undefined /* 0x041 */ { kKeyNone }, // VK_A /* 0x042 */ { kKeyNone }, // VK_B /* 0x043 */ { kKeyNone }, // VK_C /* 0x044 */ { kKeyNone }, // VK_D /* 0x045 */ { kKeyNone }, // VK_E /* 0x046 */ { kKeyNone }, // VK_F /* 0x047 */ { kKeyNone }, // VK_G /* 0x048 */ { kKeyNone }, // VK_H /* 0x049 */ { kKeyNone }, // VK_I /* 0x04a */ { kKeyNone }, // VK_J /* 0x04b */ { kKeyNone }, // VK_K /* 0x04c */ { kKeyNone }, // VK_L /* 0x04d */ { kKeyNone }, // VK_M /* 0x04e */ { kKeyNone }, // VK_N /* 0x04f */ { kKeyNone }, // VK_O /* 0x050 */ { kKeyNone }, // VK_P /* 0x051 */ { kKeyNone }, // VK_Q /* 0x052 */ { kKeyNone }, // VK_R /* 0x053 */ { kKeyNone }, // VK_S /* 0x054 */ { kKeyNone }, // VK_T /* 0x055 */ { kKeyNone }, // VK_U /* 0x056 */ { kKeyNone }, // VK_V /* 0x057 */ { kKeyNone }, // VK_W /* 0x058 */ { kKeyNone }, // VK_X /* 0x059 */ { kKeyNone }, // VK_Y /* 0x05a */ { kKeyNone }, // VK_Z /* 0x05b */ { kKeySuper_L }, // VK_LWIN /* 0x05c */ { kKeySuper_R }, // VK_RWIN /* 0x05d */ { kKeyMenu }, // VK_APPS /* 0x05e */ { kKeyNone }, // undefined /* 0x05f */ { kKeySleep }, // VK_SLEEP /* 0x060 */ { kKeyKP_0 }, // VK_NUMPAD0 /* 0x061 */ { kKeyKP_1 }, // VK_NUMPAD1 /* 0x062 */ { kKeyKP_2 }, // VK_NUMPAD2 /* 0x063 */ { kKeyKP_3 }, // VK_NUMPAD3 /* 0x064 */ { kKeyKP_4 }, // VK_NUMPAD4 /* 0x065 */ { kKeyKP_5 }, // VK_NUMPAD5 /* 0x066 */ { kKeyKP_6 }, // VK_NUMPAD6 /* 0x067 */ { kKeyKP_7 }, // VK_NUMPAD7 /* 0x068 */ { kKeyKP_8 }, // VK_NUMPAD8 /* 0x069 */ { kKeyKP_9 }, // VK_NUMPAD9 /* 0x06a */ { kKeyKP_Multiply },// VK_MULTIPLY /* 0x06b */ { kKeyKP_Add }, // VK_ADD /* 0x06c */ { kKeyKP_Separator },// VK_SEPARATOR /* 0x06d */ { kKeyKP_Subtract },// VK_SUBTRACT /* 0x06e */ { kKeyKP_Decimal }, // VK_DECIMAL /* 0x06f */ { kKeyNone }, // VK_DIVIDE /* 0x070 */ { kKeyF1 }, // VK_F1 /* 0x071 */ { kKeyF2 }, // VK_F2 /* 0x072 */ { kKeyF3 }, // VK_F3 /* 0x073 */ { kKeyF4 }, // VK_F4 /* 0x074 */ { kKeyF5 }, // VK_F5 /* 0x075 */ { kKeyF6 }, // VK_F6 /* 0x076 */ { kKeyF7 }, // VK_F7 /* 0x077 */ { kKeyF8 }, // VK_F8 /* 0x078 */ { kKeyF9 }, // VK_F9 /* 0x079 */ { kKeyF10 }, // VK_F10 /* 0x07a */ { kKeyF11 }, // VK_F11 /* 0x07b */ { kKeyF12 }, // VK_F12 /* 0x07c */ { kKeyF13 }, // VK_F13 /* 0x07d */ { kKeyF14 }, // VK_F14 /* 0x07e */ { kKeyF15 }, // VK_F15 /* 0x07f */ { kKeyF16 }, // VK_F16 /* 0x080 */ { kKeyF17 }, // VK_F17 /* 0x081 */ { kKeyF18 }, // VK_F18 /* 0x082 */ { kKeyF19 }, // VK_F19 /* 0x083 */ { kKeyF20 }, // VK_F20 /* 0x084 */ { kKeyF21 }, // VK_F21 /* 0x085 */ { kKeyF22 }, // VK_F22 /* 0x086 */ { kKeyF23 }, // VK_F23 /* 0x087 */ { kKeyF24 }, // VK_F24 /* 0x088 */ { kKeyNone }, // unassigned /* 0x089 */ { kKeyNone }, // unassigned /* 0x08a */ { kKeyNone }, // unassigned /* 0x08b */ { kKeyNone }, // unassigned /* 0x08c */ { kKeyNone }, // unassigned /* 0x08d */ { kKeyNone }, // unassigned /* 0x08e */ { kKeyNone }, // unassigned /* 0x08f */ { kKeyNone }, // unassigned /* 0x090 */ { kKeyNumLock }, // VK_NUMLOCK /* 0x091 */ { kKeyScrollLock }, // VK_SCROLL /* 0x092 */ { kKeyNone }, // unassigned /* 0x093 */ { kKeyNone }, // unassigned /* 0x094 */ { kKeyNone }, // unassigned /* 0x095 */ { kKeyNone }, // unassigned /* 0x096 */ { kKeyNone }, // unassigned /* 0x097 */ { kKeyNone }, // unassigned /* 0x098 */ { kKeyNone }, // unassigned /* 0x099 */ { kKeyNone }, // unassigned /* 0x09a */ { kKeyNone }, // unassigned /* 0x09b */ { kKeyNone }, // unassigned /* 0x09c */ { kKeyNone }, // unassigned /* 0x09d */ { kKeyNone }, // unassigned /* 0x09e */ { kKeyNone }, // unassigned /* 0x09f */ { kKeyNone }, // unassigned /* 0x0a0 */ { kKeyShift_L }, // VK_LSHIFT /* 0x0a1 */ { kKeyShift_R }, // VK_RSHIFT /* 0x0a2 */ { kKeyControl_L }, // VK_LCONTROL /* 0x0a3 */ { kKeyControl_R }, // VK_RCONTROL /* 0x0a4 */ { kKeyAlt_L }, // VK_LMENU /* 0x0a5 */ { kKeyAlt_R }, // VK_RMENU /* 0x0a6 */ { kKeyNone }, // VK_BROWSER_BACK /* 0x0a7 */ { kKeyNone }, // VK_BROWSER_FORWARD /* 0x0a8 */ { kKeyNone }, // VK_BROWSER_REFRESH /* 0x0a9 */ { kKeyNone }, // VK_BROWSER_STOP /* 0x0aa */ { kKeyNone }, // VK_BROWSER_SEARCH /* 0x0ab */ { kKeyNone }, // VK_BROWSER_FAVORITES /* 0x0ac */ { kKeyNone }, // VK_BROWSER_HOME /* 0x0ad */ { kKeyNone }, // VK_VOLUME_MUTE /* 0x0ae */ { kKeyNone }, // VK_VOLUME_DOWN /* 0x0af */ { kKeyNone }, // VK_VOLUME_UP /* 0x0b0 */ { kKeyNone }, // VK_MEDIA_NEXT_TRACK /* 0x0b1 */ { kKeyNone }, // VK_MEDIA_PREV_TRACK /* 0x0b2 */ { kKeyNone }, // VK_MEDIA_STOP /* 0x0b3 */ { kKeyNone }, // VK_MEDIA_PLAY_PAUSE /* 0x0b4 */ { kKeyNone }, // VK_LAUNCH_MAIL /* 0x0b5 */ { kKeyNone }, // VK_LAUNCH_MEDIA_SELECT /* 0x0b6 */ { kKeyNone }, // VK_LAUNCH_APP1 /* 0x0b7 */ { kKeyNone }, // VK_LAUNCH_APP2 /* 0x0b8 */ { kKeyNone }, // unassigned /* 0x0b9 */ { kKeyNone }, // unassigned /* 0x0ba */ { kKeyNone }, // OEM specific /* 0x0bb */ { kKeyNone }, // OEM specific /* 0x0bc */ { kKeyNone }, // OEM specific /* 0x0bd */ { kKeyNone }, // OEM specific /* 0x0be */ { kKeyNone }, // OEM specific /* 0x0bf */ { kKeyNone }, // OEM specific /* 0x0c0 */ { kKeyNone }, // OEM specific /* 0x0c1 */ { kKeyNone }, // unassigned /* 0x0c2 */ { kKeyNone }, // unassigned /* 0x0c3 */ { kKeyNone }, // unassigned /* 0x0c4 */ { kKeyNone }, // unassigned /* 0x0c5 */ { kKeyNone }, // unassigned /* 0x0c6 */ { kKeyNone }, // unassigned /* 0x0c7 */ { kKeyNone }, // unassigned /* 0x0c8 */ { kKeyNone }, // unassigned /* 0x0c9 */ { kKeyNone }, // unassigned /* 0x0ca */ { kKeyNone }, // unassigned /* 0x0cb */ { kKeyNone }, // unassigned /* 0x0cc */ { kKeyNone }, // unassigned /* 0x0cd */ { kKeyNone }, // unassigned /* 0x0ce */ { kKeyNone }, // unassigned /* 0x0cf */ { kKeyNone }, // unassigned /* 0x0d0 */ { kKeyNone }, // unassigned /* 0x0d1 */ { kKeyNone }, // unassigned /* 0x0d2 */ { kKeyNone }, // unassigned /* 0x0d3 */ { kKeyNone }, // unassigned /* 0x0d4 */ { kKeyNone }, // unassigned /* 0x0d5 */ { kKeyNone }, // unassigned /* 0x0d6 */ { kKeyNone }, // unassigned /* 0x0d7 */ { kKeyNone }, // unassigned /* 0x0d8 */ { kKeyNone }, // unassigned /* 0x0d9 */ { kKeyNone }, // unassigned /* 0x0da */ { kKeyNone }, // unassigned /* 0x0db */ { kKeyNone }, // OEM specific /* 0x0dc */ { kKeyNone }, // OEM specific /* 0x0dd */ { kKeyNone }, // OEM specific /* 0x0de */ { kKeyNone }, // OEM specific /* 0x0df */ { kKeyNone }, // OEM specific /* 0x0e0 */ { kKeyNone }, // OEM specific /* 0x0e1 */ { kKeyNone }, // OEM specific /* 0x0e2 */ { kKeyNone }, // OEM specific /* 0x0e3 */ { kKeyNone }, // OEM specific /* 0x0e4 */ { kKeyNone }, // OEM specific /* 0x0e5 */ { kKeyNone }, // unassigned /* 0x0e6 */ { kKeyNone }, // OEM specific /* 0x0e7 */ { kKeyNone }, // unassigned /* 0x0e8 */ { kKeyNone }, // unassigned /* 0x0e9 */ { kKeyNone }, // OEM specific /* 0x0ea */ { kKeyNone }, // OEM specific /* 0x0eb */ { kKeyNone }, // OEM specific /* 0x0ec */ { kKeyNone }, // OEM specific /* 0x0ed */ { kKeyNone }, // OEM specific /* 0x0ee */ { kKeyNone }, // OEM specific /* 0x0ef */ { kKeyNone }, // OEM specific /* 0x0f0 */ { kKeyNone }, // OEM specific /* 0x0f1 */ { kKeyNone }, // OEM specific /* 0x0f2 */ { kKeyHiraganaKatakana }, // VK_OEM_COPY /* 0x0f3 */ { kKeyZenkaku }, // VK_OEM_AUTO /* 0x0f4 */ { kKeyZenkaku }, // VK_OEM_ENLW /* 0x0f5 */ { kKeyNone }, // OEM specific /* 0x0f6 */ { kKeyNone }, // VK_ATTN /* 0x0f7 */ { kKeyNone }, // VK_CRSEL /* 0x0f8 */ { kKeyNone }, // VK_EXSEL /* 0x0f9 */ { kKeyNone }, // VK_EREOF /* 0x0fa */ { kKeyNone }, // VK_PLAY /* 0x0fb */ { kKeyNone }, // VK_ZOOM /* 0x0fc */ { kKeyNone }, // reserved /* 0x0fd */ { kKeyNone }, // VK_PA1 /* 0x0fe */ { kKeyNone }, // VK_OEM_CLEAR /* 0x0ff */ { kKeyNone }, // reserved /* 0x100 */ { kKeyNone }, // reserved /* 0x101 */ { kKeyNone }, // VK_LBUTTON /* 0x102 */ { kKeyNone }, // VK_RBUTTON /* 0x103 */ { kKeyBreak }, // VK_CANCEL /* 0x104 */ { kKeyNone }, // VK_MBUTTON /* 0x105 */ { kKeyNone }, // VK_XBUTTON1 /* 0x106 */ { kKeyNone }, // VK_XBUTTON2 /* 0x107 */ { kKeyNone }, // undefined /* 0x108 */ { kKeyNone }, // VK_BACK /* 0x109 */ { kKeyNone }, // VK_TAB /* 0x10a */ { kKeyNone }, // undefined /* 0x10b */ { kKeyNone }, // undefined /* 0x10c */ { kKeyClear }, // VK_CLEAR /* 0x10d */ { kKeyKP_Enter }, // VK_RETURN /* 0x10e */ { kKeyNone }, // undefined /* 0x10f */ { kKeyNone }, // undefined /* 0x110 */ { kKeyShift_R }, // VK_SHIFT /* 0x111 */ { kKeyControl_R }, // VK_CONTROL /* 0x112 */ { kKeyAlt_R }, // VK_MENU /* 0x113 */ { kKeyNone }, // VK_PAUSE /* 0x114 */ { kKeyNone }, // VK_CAPITAL /* 0x115 */ { kKeyNone }, // VK_KANA /* 0x116 */ { kKeyNone }, // VK_HANGUL /* 0x117 */ { kKeyNone }, // VK_JUNJA /* 0x118 */ { kKeyNone }, // VK_FINAL /* 0x119 */ { kKeyNone }, // VK_KANJI /* 0x11a */ { kKeyNone }, // undefined /* 0x11b */ { kKeyNone }, // VK_ESCAPE /* 0x11c */ { kKeyNone }, // VK_CONVERT /* 0x11d */ { kKeyNone }, // VK_NONCONVERT /* 0x11e */ { kKeyNone }, // VK_ACCEPT /* 0x11f */ { kKeyNone }, // VK_MODECHANGE /* 0x120 */ { kKeyNone }, // VK_SPACE /* 0x121 */ { kKeyPageUp }, // VK_PRIOR /* 0x122 */ { kKeyPageDown }, // VK_NEXT /* 0x123 */ { kKeyEnd }, // VK_END /* 0x124 */ { kKeyHome }, // VK_HOME /* 0x125 */ { kKeyLeft }, // VK_LEFT /* 0x126 */ { kKeyUp }, // VK_UP /* 0x127 */ { kKeyRight }, // VK_RIGHT /* 0x128 */ { kKeyDown }, // VK_DOWN /* 0x129 */ { kKeySelect }, // VK_SELECT /* 0x12a */ { kKeyNone }, // VK_PRINT /* 0x12b */ { kKeyExecute }, // VK_EXECUTE /* 0x12c */ { kKeyPrint }, // VK_SNAPSHOT /* 0x12d */ { kKeyInsert }, // VK_INSERT /* 0x12e */ { kKeyDelete }, // VK_DELETE /* 0x12f */ { kKeyHelp }, // VK_HELP /* 0x130 */ { kKeyNone }, // VK_0 /* 0x131 */ { kKeyNone }, // VK_1 /* 0x132 */ { kKeyNone }, // VK_2 /* 0x133 */ { kKeyNone }, // VK_3 /* 0x134 */ { kKeyNone }, // VK_4 /* 0x135 */ { kKeyNone }, // VK_5 /* 0x136 */ { kKeyNone }, // VK_6 /* 0x137 */ { kKeyNone }, // VK_7 /* 0x138 */ { kKeyNone }, // VK_8 /* 0x139 */ { kKeyNone }, // VK_9 /* 0x13a */ { kKeyNone }, // undefined /* 0x13b */ { kKeyNone }, // undefined /* 0x13c */ { kKeyNone }, // undefined /* 0x13d */ { kKeyNone }, // undefined /* 0x13e */ { kKeyNone }, // undefined /* 0x13f */ { kKeyNone }, // undefined /* 0x140 */ { kKeyNone }, // undefined /* 0x141 */ { kKeyNone }, // VK_A /* 0x142 */ { kKeyNone }, // VK_B /* 0x143 */ { kKeyNone }, // VK_C /* 0x144 */ { kKeyNone }, // VK_D /* 0x145 */ { kKeyNone }, // VK_E /* 0x146 */ { kKeyNone }, // VK_F /* 0x147 */ { kKeyNone }, // VK_G /* 0x148 */ { kKeyNone }, // VK_H /* 0x149 */ { kKeyNone }, // VK_I /* 0x14a */ { kKeyNone }, // VK_J /* 0x14b */ { kKeyNone }, // VK_K /* 0x14c */ { kKeyNone }, // VK_L /* 0x14d */ { kKeyNone }, // VK_M /* 0x14e */ { kKeyNone }, // VK_N /* 0x14f */ { kKeyNone }, // VK_O /* 0x150 */ { kKeyNone }, // VK_P /* 0x151 */ { kKeyNone }, // VK_Q /* 0x152 */ { kKeyNone }, // VK_R /* 0x153 */ { kKeyNone }, // VK_S /* 0x154 */ { kKeyNone }, // VK_T /* 0x155 */ { kKeyNone }, // VK_U /* 0x156 */ { kKeyNone }, // VK_V /* 0x157 */ { kKeyNone }, // VK_W /* 0x158 */ { kKeyNone }, // VK_X /* 0x159 */ { kKeyNone }, // VK_Y /* 0x15a */ { kKeyNone }, // VK_Z /* 0x15b */ { kKeySuper_L }, // VK_LWIN /* 0x15c */ { kKeySuper_R }, // VK_RWIN /* 0x15d */ { kKeyMenu }, // VK_APPS /* 0x15e */ { kKeyNone }, // undefined /* 0x15f */ { kKeyNone }, // VK_SLEEP /* 0x160 */ { kKeyNone }, // VK_NUMPAD0 /* 0x161 */ { kKeyNone }, // VK_NUMPAD1 /* 0x162 */ { kKeyNone }, // VK_NUMPAD2 /* 0x163 */ { kKeyNone }, // VK_NUMPAD3 /* 0x164 */ { kKeyNone }, // VK_NUMPAD4 /* 0x165 */ { kKeyNone }, // VK_NUMPAD5 /* 0x166 */ { kKeyNone }, // VK_NUMPAD6 /* 0x167 */ { kKeyNone }, // VK_NUMPAD7 /* 0x168 */ { kKeyNone }, // VK_NUMPAD8 /* 0x169 */ { kKeyNone }, // VK_NUMPAD9 /* 0x16a */ { kKeyNone }, // VK_MULTIPLY /* 0x16b */ { kKeyNone }, // VK_ADD /* 0x16c */ { kKeyKP_Separator },// VK_SEPARATOR /* 0x16d */ { kKeyNone }, // VK_SUBTRACT /* 0x16e */ { kKeyNone }, // VK_DECIMAL /* 0x16f */ { kKeyKP_Divide }, // VK_DIVIDE /* 0x170 */ { kKeyNone }, // VK_F1 /* 0x171 */ { kKeyNone }, // VK_F2 /* 0x172 */ { kKeyNone }, // VK_F3 /* 0x173 */ { kKeyNone }, // VK_F4 /* 0x174 */ { kKeyNone }, // VK_F5 /* 0x175 */ { kKeyNone }, // VK_F6 /* 0x176 */ { kKeyNone }, // VK_F7 /* 0x177 */ { kKeyNone }, // VK_F8 /* 0x178 */ { kKeyNone }, // VK_F9 /* 0x179 */ { kKeyNone }, // VK_F10 /* 0x17a */ { kKeyNone }, // VK_F11 /* 0x17b */ { kKeyNone }, // VK_F12 /* 0x17c */ { kKeyF13 }, // VK_F13 /* 0x17d */ { kKeyF14 }, // VK_F14 /* 0x17e */ { kKeyF15 }, // VK_F15 /* 0x17f */ { kKeyF16 }, // VK_F16 /* 0x180 */ { kKeyF17 }, // VK_F17 /* 0x181 */ { kKeyF18 }, // VK_F18 /* 0x182 */ { kKeyF19 }, // VK_F19 /* 0x183 */ { kKeyF20 }, // VK_F20 /* 0x184 */ { kKeyF21 }, // VK_F21 /* 0x185 */ { kKeyF22 }, // VK_F22 /* 0x186 */ { kKeyF23 }, // VK_F23 /* 0x187 */ { kKeyF24 }, // VK_F24 /* 0x188 */ { kKeyNone }, // unassigned /* 0x189 */ { kKeyNone }, // unassigned /* 0x18a */ { kKeyNone }, // unassigned /* 0x18b */ { kKeyNone }, // unassigned /* 0x18c */ { kKeyNone }, // unassigned /* 0x18d */ { kKeyNone }, // unassigned /* 0x18e */ { kKeyNone }, // unassigned /* 0x18f */ { kKeyNone }, // unassigned /* 0x190 */ { kKeyNumLock }, // VK_NUMLOCK /* 0x191 */ { kKeyNone }, // VK_SCROLL /* 0x192 */ { kKeyNone }, // unassigned /* 0x193 */ { kKeyNone }, // unassigned /* 0x194 */ { kKeyNone }, // unassigned /* 0x195 */ { kKeyNone }, // unassigned /* 0x196 */ { kKeyNone }, // unassigned /* 0x197 */ { kKeyNone }, // unassigned /* 0x198 */ { kKeyNone }, // unassigned /* 0x199 */ { kKeyNone }, // unassigned /* 0x19a */ { kKeyNone }, // unassigned /* 0x19b */ { kKeyNone }, // unassigned /* 0x19c */ { kKeyNone }, // unassigned /* 0x19d */ { kKeyNone }, // unassigned /* 0x19e */ { kKeyNone }, // unassigned /* 0x19f */ { kKeyNone }, // unassigned /* 0x1a0 */ { kKeyShift_L }, // VK_LSHIFT /* 0x1a1 */ { kKeyShift_R }, // VK_RSHIFT /* 0x1a2 */ { kKeyControl_L }, // VK_LCONTROL /* 0x1a3 */ { kKeyControl_R }, // VK_RCONTROL /* 0x1a4 */ { kKeyAlt_L }, // VK_LMENU /* 0x1a5 */ { kKeyAlt_R }, // VK_RMENU /* 0x1a6 */ { kKeyWWWBack }, // VK_BROWSER_BACK /* 0x1a7 */ { kKeyWWWForward }, // VK_BROWSER_FORWARD /* 0x1a8 */ { kKeyWWWRefresh }, // VK_BROWSER_REFRESH /* 0x1a9 */ { kKeyWWWStop }, // VK_BROWSER_STOP /* 0x1aa */ { kKeyWWWSearch }, // VK_BROWSER_SEARCH /* 0x1ab */ { kKeyWWWFavorites },// VK_BROWSER_FAVORITES /* 0x1ac */ { kKeyWWWHome }, // VK_BROWSER_HOME /* 0x1ad */ { kKeyAudioMute }, // VK_VOLUME_MUTE /* 0x1ae */ { kKeyAudioDown }, // VK_VOLUME_DOWN /* 0x1af */ { kKeyAudioUp }, // VK_VOLUME_UP /* 0x1b0 */ { kKeyAudioNext }, // VK_MEDIA_NEXT_TRACK /* 0x1b1 */ { kKeyAudioPrev }, // VK_MEDIA_PREV_TRACK /* 0x1b2 */ { kKeyAudioStop }, // VK_MEDIA_STOP /* 0x1b3 */ { kKeyAudioPlay }, // VK_MEDIA_PLAY_PAUSE /* 0x1b4 */ { kKeyAppMail }, // VK_LAUNCH_MAIL /* 0x1b5 */ { kKeyAppMedia }, // VK_LAUNCH_MEDIA_SELECT /* 0x1b6 */ { kKeyAppUser1 }, // VK_LAUNCH_APP1 /* 0x1b7 */ { kKeyAppUser2 }, // VK_LAUNCH_APP2 /* 0x1b8 */ { kKeyNone }, // unassigned /* 0x1b9 */ { kKeyNone }, // unassigned /* 0x1ba */ { kKeyNone }, // OEM specific /* 0x1bb */ { kKeyNone }, // OEM specific /* 0x1bc */ { kKeyNone }, // OEM specific /* 0x1bd */ { kKeyNone }, // OEM specific /* 0x1be */ { kKeyNone }, // OEM specific /* 0x1bf */ { kKeyNone }, // OEM specific /* 0x1c0 */ { kKeyNone }, // OEM specific /* 0x1c1 */ { kKeyNone }, // unassigned /* 0x1c2 */ { kKeyNone }, // unassigned /* 0x1c3 */ { kKeyNone }, // unassigned /* 0x1c4 */ { kKeyNone }, // unassigned /* 0x1c5 */ { kKeyNone }, // unassigned /* 0x1c6 */ { kKeyNone }, // unassigned /* 0x1c7 */ { kKeyNone }, // unassigned /* 0x1c8 */ { kKeyNone }, // unassigned /* 0x1c9 */ { kKeyNone }, // unassigned /* 0x1ca */ { kKeyNone }, // unassigned /* 0x1cb */ { kKeyNone }, // unassigned /* 0x1cc */ { kKeyNone }, // unassigned /* 0x1cd */ { kKeyNone }, // unassigned /* 0x1ce */ { kKeyNone }, // unassigned /* 0x1cf */ { kKeyNone }, // unassigned /* 0x1d0 */ { kKeyNone }, // unassigned /* 0x1d1 */ { kKeyNone }, // unassigned /* 0x1d2 */ { kKeyNone }, // unassigned /* 0x1d3 */ { kKeyNone }, // unassigned /* 0x1d4 */ { kKeyNone }, // unassigned /* 0x1d5 */ { kKeyNone }, // unassigned /* 0x1d6 */ { kKeyNone }, // unassigned /* 0x1d7 */ { kKeyNone }, // unassigned /* 0x1d8 */ { kKeyNone }, // unassigned /* 0x1d9 */ { kKeyNone }, // unassigned /* 0x1da */ { kKeyNone }, // unassigned /* 0x1db */ { kKeyNone }, // OEM specific /* 0x1dc */ { kKeyNone }, // OEM specific /* 0x1dd */ { kKeyNone }, // OEM specific /* 0x1de */ { kKeyNone }, // OEM specific /* 0x1df */ { kKeyNone }, // OEM specific /* 0x1e0 */ { kKeyNone }, // OEM specific /* 0x1e1 */ { kKeyNone }, // OEM specific /* 0x1e2 */ { kKeyNone }, // OEM specific /* 0x1e3 */ { kKeyNone }, // OEM specific /* 0x1e4 */ { kKeyNone }, // OEM specific /* 0x1e5 */ { kKeyNone }, // unassigned /* 0x1e6 */ { kKeyNone }, // OEM specific /* 0x1e7 */ { kKeyNone }, // unassigned /* 0x1e8 */ { kKeyNone }, // unassigned /* 0x1e9 */ { kKeyNone }, // OEM specific /* 0x1ea */ { kKeyNone }, // OEM specific /* 0x1eb */ { kKeyNone }, // OEM specific /* 0x1ec */ { kKeyNone }, // OEM specific /* 0x1ed */ { kKeyNone }, // OEM specific /* 0x1ee */ { kKeyNone }, // OEM specific /* 0x1ef */ { kKeyNone }, // OEM specific /* 0x1f0 */ { kKeyNone }, // OEM specific /* 0x1f1 */ { kKeyNone }, // OEM specific /* 0x1f2 */ { kKeyNone }, // VK_OEM_COPY /* 0x1f3 */ { kKeyNone }, // VK_OEM_AUTO /* 0x1f4 */ { kKeyNone }, // VK_OEM_ENLW /* 0x1f5 */ { kKeyNone }, // OEM specific /* 0x1f6 */ { kKeyNone }, // VK_ATTN /* 0x1f7 */ { kKeyNone }, // VK_CRSEL /* 0x1f8 */ { kKeyNone }, // VK_EXSEL /* 0x1f9 */ { kKeyNone }, // VK_EREOF /* 0x1fa */ { kKeyNone }, // VK_PLAY /* 0x1fb */ { kKeyNone }, // VK_ZOOM /* 0x1fc */ { kKeyNone }, // reserved /* 0x1fd */ { kKeyNone }, // VK_PA1 /* 0x1fe */ { kKeyNone }, // VK_OEM_CLEAR /* 0x1ff */ { kKeyNone } // reserved }; struct CWin32Modifiers { public: UINT m_vk; KeyModifierMask m_mask; }; static const CWin32Modifiers s_modifiers[] = { { VK_SHIFT, KeyModifierShift }, { VK_LSHIFT, KeyModifierShift }, { VK_RSHIFT, KeyModifierShift }, { VK_CONTROL, KeyModifierControl }, { VK_LCONTROL, KeyModifierControl }, { VK_RCONTROL, KeyModifierControl }, { VK_MENU, KeyModifierAlt }, { VK_LMENU, KeyModifierAlt }, { VK_RMENU, KeyModifierAlt }, { VK_LWIN, KeyModifierSuper }, { VK_RWIN, KeyModifierSuper } }; CMSWindowsKeyState::CMSWindowsKeyState( CMSWindowsDesks* desks, void* eventTarget) : m_is95Family(CArchMiscWindows::isWindows95Family()), m_eventTarget(eventTarget), m_desks(desks), m_keyLayout(GetKeyboardLayout(0)), m_fixTimer(NULL), m_lastDown(0), m_useSavedModifiers(false), m_savedModifiers(0), m_originalSavedModifiers(0), m_eventQueue(*EVENTQUEUE) { init(); } CMSWindowsKeyState::CMSWindowsKeyState( CMSWindowsDesks* desks, void* eventTarget, IEventQueue& eventQueue, CKeyMap& keyMap) : CKeyState(eventQueue, keyMap), m_is95Family(CArchMiscWindows::isWindows95Family()), m_eventTarget(eventTarget), m_desks(desks), m_keyLayout(GetKeyboardLayout(0)), m_fixTimer(NULL), m_lastDown(0), m_useSavedModifiers(false), m_savedModifiers(0), m_originalSavedModifiers(0), m_eventQueue(eventQueue) { init(); } CMSWindowsKeyState::~CMSWindowsKeyState() { disable(); } void CMSWindowsKeyState::init() { // look up symbol that's available on winNT family but not win95 HMODULE userModule = GetModuleHandle("user32.dll"); m_ToUnicodeEx = (ToUnicodeEx_t)GetProcAddress(userModule, "ToUnicodeEx"); } void CMSWindowsKeyState::disable() { if (m_fixTimer != NULL) { getEventQueue().removeHandler(CEvent::kTimer, m_fixTimer); getEventQueue().deleteTimer(m_fixTimer); m_fixTimer = NULL; } m_lastDown = 0; } KeyButton CMSWindowsKeyState::virtualKeyToButton(UINT virtualKey) const { return m_virtualKeyToButton[virtualKey & 0xffu]; } void CMSWindowsKeyState::setKeyLayout(HKL keyLayout) { m_keyLayout = keyLayout; } bool CMSWindowsKeyState::testAutoRepeat(bool press, bool isRepeat, KeyButton button) { if (!isRepeat) { isRepeat = (press && m_lastDown != 0 && button == m_lastDown); } if (press) { m_lastDown = button; } else { m_lastDown = 0; } return isRepeat; } void CMSWindowsKeyState::saveModifiers() { m_savedModifiers = getActiveModifiers(); m_originalSavedModifiers = m_savedModifiers; } void CMSWindowsKeyState::useSavedModifiers(bool enable) { if (enable != m_useSavedModifiers) { m_useSavedModifiers = enable; if (!m_useSavedModifiers) { // transfer any modifier state changes to CKeyState's state KeyModifierMask mask = m_originalSavedModifiers ^ m_savedModifiers; getActiveModifiersRValue() = (getActiveModifiers() & ~mask) | (m_savedModifiers & mask); } } } KeyID CMSWindowsKeyState::mapKeyFromEvent(WPARAM charAndVirtKey, LPARAM info, KeyModifierMask* maskOut) const { static const KeyModifierMask s_controlAlt = KeyModifierControl | KeyModifierAlt; // extract character, virtual key, and if we didn't use AltGr char c = (char)((charAndVirtKey & 0xff00u) >> 8); UINT vkCode = (charAndVirtKey & 0xffu); bool noAltGr = ((charAndVirtKey & 0xff0000u) != 0); // handle some keys via table lookup KeyID id = getKeyID(vkCode, (KeyButton)((info >> 16) & 0x1ffu)); // check if not in table; map character to key id if (id == kKeyNone && c != 0) { if ((c & 0x80u) == 0) { // ASCII id = static_cast(c) & 0xffu; } else { // character is not really ASCII. instead it's some // character in the current ANSI code page. try to // convert that to a Unicode character. if we fail // then use the single byte character as is. char src = c; wchar_t unicode; if (MultiByteToWideChar(CP_THREAD_ACP, MB_PRECOMPOSED, &src, 1, &unicode, 1) > 0) { id = static_cast(unicode); } else { id = static_cast(c) & 0xffu; } } } // set modifier mask if (maskOut != NULL) { KeyModifierMask active = getActiveModifiers(); if (!noAltGr && (active & s_controlAlt) == s_controlAlt) { // if !noAltGr then we're only interested in matching the // key, not the AltGr. AltGr is down (i.e. control and alt // are down) but we don't want the client to have to match // that so we clear it. active &= ~s_controlAlt; } *maskOut = active; } return id; } bool CMSWindowsKeyState::didGroupsChange() const { GroupList groups; return (getGroups(groups) && groups != m_groups); } UINT CMSWindowsKeyState::mapKeyToVirtualKey(KeyID key) const { if (key == kKeyNone) { return 0; } KeyToVKMap::const_iterator i = m_keyToVKMap.find(key); if (i == m_keyToVKMap.end()) { return 0; } else { return i->second; } } void CMSWindowsKeyState::onKey(KeyButton button, bool down, KeyModifierMask newState) { // handle win32 brokenness and forward to superclass fixKeys(); CKeyState::onKey(button, down, newState); fixKeys(); } void CMSWindowsKeyState::sendKeyEvent(void* target, bool press, bool isAutoRepeat, KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button) { if (press || isAutoRepeat) { // send key if (press && !isAutoRepeat) { CKeyState::sendKeyEvent(target, true, false, key, mask, 1, button); if (count > 0) { --count; } } if (count >= 1) { CKeyState::sendKeyEvent(target, true, true, key, mask, count, button); } } else { // do key up CKeyState::sendKeyEvent(target, false, false, key, mask, 1, button); } } void CMSWindowsKeyState::fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button) { CKeyState::fakeKeyDown(id, mask, button); } bool CMSWindowsKeyState::fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { return CKeyState::fakeKeyRepeat(id, mask, count, button); } bool CMSWindowsKeyState::fakeCtrlAltDel() { if (!m_is95Family) { // to fake ctrl+alt+del on the NT family we broadcast a suitable // hotkey to all windows on the winlogon desktop. however, the // current thread must be on that desktop to do the broadcast // and we can't switch just any thread because some own windows // or hooks. so start a new thread to do the real work. HANDLE hEvtSendSas = OpenEvent( EVENT_MODIFY_STATE, FALSE, "Global\\SendSAS" ); if ( hEvtSendSas ) { LOG((CLOG_DEBUG "found the SendSAS event - signaling my launcher to simulate ctrl+alt+del")); SetEvent( hEvtSendSas ); CloseHandle( hEvtSendSas ); } else { CThread cad(new CFunctionJob(&CMSWindowsKeyState::ctrlAltDelThread)); cad.wait(); } } else { // simulate ctrl+alt+del fakeKeyDown(kKeyDelete, KeyModifierControl | KeyModifierAlt, virtualKeyToButton(VK_DELETE)); } return true; } void CMSWindowsKeyState::ctrlAltDelThread(void*) { // get the Winlogon desktop at whatever privilege we can HDESK desk = OpenDesktop("Winlogon", 0, FALSE, MAXIMUM_ALLOWED); if (desk != NULL) { if (SetThreadDesktop(desk)) { PostMessage(HWND_BROADCAST, WM_HOTKEY, 0, MAKELPARAM(MOD_CONTROL | MOD_ALT, VK_DELETE)); } else { LOG((CLOG_DEBUG "can't switch to Winlogon desk: %d", GetLastError())); } CloseDesktop(desk); } else { LOG((CLOG_DEBUG "can't open Winlogon desk: %d", GetLastError())); } } KeyModifierMask CMSWindowsKeyState::pollActiveModifiers() const { KeyModifierMask state = 0; // get non-toggle modifiers from our own shadow key state for (size_t i = 0; i < sizeof(s_modifiers) / sizeof(s_modifiers[0]); ++i) { KeyButton button = virtualKeyToButton(s_modifiers[i].m_vk); if (button != 0 && isKeyDown(button)) { state |= s_modifiers[i].m_mask; } } // we can get toggle modifiers from the system if ((GetKeyState(VK_CAPITAL) & 0x01) != 0) { state |= KeyModifierCapsLock; } if ((GetKeyState(VK_NUMLOCK) & 0x01) != 0) { state |= KeyModifierNumLock; } if ((GetKeyState(VK_SCROLL) & 0x01) != 0) { state |= KeyModifierScrollLock; } return state; } SInt32 CMSWindowsKeyState::pollActiveGroup() const { // determine the thread that'll receive this event HWND targetWindow = GetForegroundWindow(); DWORD targetThread = GetWindowThreadProcessId(targetWindow, NULL); // get keyboard layout for the thread HKL hkl = GetKeyboardLayout(targetThread); if (!hkl) { // GetKeyboardLayout failed. Maybe targetWindow is a console window. // We're getting the keyboard layout of the desktop instead. targetWindow = GetDesktopWindow(); targetThread = GetWindowThreadProcessId(targetWindow, NULL); hkl = GetKeyboardLayout(targetThread); } // get group GroupMap::const_iterator i = m_groupMap.find(hkl); if (i == m_groupMap.end()) { LOG((CLOG_DEBUG1 "can't find keyboard layout %08x", hkl)); return 0; } return i->second; } void CMSWindowsKeyState::pollPressedKeys(KeyButtonSet& pressedKeys) const { BYTE keyState[256]; if (!GetKeyboardState(keyState)) { LOG((CLOG_ERR "GetKeyboardState returned false on pollPressedKeys")); return; } for (KeyButton i = 1; i < 256; ++i) { if ((keyState[i] & 0x80) != 0) { pressedKeys.insert(i); } } } void CMSWindowsKeyState::getKeyMap(CKeyMap& keyMap) { // update keyboard groups if (getGroups(m_groups)) { m_groupMap.clear(); SInt32 numGroups = (SInt32)m_groups.size(); for (SInt32 g = 0; g < numGroups; ++g) { m_groupMap[m_groups[g]] = g; } } HKL activeLayout = GetKeyboardLayout(0); // clear table memset(m_virtualKeyToButton, 0, sizeof(m_virtualKeyToButton)); m_keyToVKMap.clear(); CKeyMap::KeyItem item; SInt32 numGroups = (SInt32)m_groups.size(); for (SInt32 g = 0; g < numGroups; ++g) { item.m_group = g; ActivateKeyboardLayout(m_groups[g], 0); // clear tables memset(m_buttonToVK, 0, sizeof(m_buttonToVK)); memset(m_buttonToNumpadVK, 0, sizeof(m_buttonToNumpadVK)); // map buttons (scancodes) to virtual keys for (KeyButton i = 1; i < 256; ++i) { UINT vk = MapVirtualKey(i, 1); if (vk == 0) { // unmapped continue; } // deal with certain virtual keys specially switch (vk) { case VK_SHIFT: // this is important for sending the correct modifier to the // client, a patch from bug #242 (right shift broken for ms // remote desktop) removed this to just use left shift, which // caused bug #2799 (right shift broken for osx). // we must not repeat this same mistake and must fix platform // specific bugs in code that only affects that platform. if (MapVirtualKey(VK_RSHIFT, 0) == i) { vk = VK_RSHIFT; } else { vk = VK_LSHIFT; } break; case VK_CONTROL: vk = VK_LCONTROL; break; case VK_MENU: vk = VK_LMENU; break; case VK_NUMLOCK: vk = VK_PAUSE; break; case VK_NUMPAD0: case VK_NUMPAD1: case VK_NUMPAD2: case VK_NUMPAD3: case VK_NUMPAD4: case VK_NUMPAD5: case VK_NUMPAD6: case VK_NUMPAD7: case VK_NUMPAD8: case VK_NUMPAD9: case VK_DECIMAL: // numpad keys are saved in their own table m_buttonToNumpadVK[i] = vk; continue; case VK_LWIN: case VK_RWIN: // add extended key only for these on 95 family if (m_is95Family) { m_buttonToVK[i | 0x100u] = vk; continue; } break; case VK_RETURN: case VK_PRIOR: case VK_NEXT: case VK_END: case VK_HOME: case VK_LEFT: case VK_UP: case VK_RIGHT: case VK_DOWN: case VK_INSERT: case VK_DELETE: // also add extended key for these m_buttonToVK[i | 0x100u] = vk; break; } if (m_buttonToVK[i] == 0) { m_buttonToVK[i] = vk; } } // now map virtual keys to buttons. multiple virtual keys may map // to a single button. if the virtual key matches the one in // m_buttonToVK then we use the button as is. if not then it's // either a numpad key and we use the button as is or it's an // extended button. for (UINT i = 1; i < 255; ++i) { // skip virtual keys we don't want switch (i) { case VK_LBUTTON: case VK_RBUTTON: case VK_MBUTTON: case VK_XBUTTON1: case VK_XBUTTON2: case VK_SHIFT: case VK_CONTROL: case VK_MENU: continue; } // get the button KeyButton button = static_cast(MapVirtualKey(i, 0)); if (button == 0) { continue; } // deal with certain virtual keys specially switch (i) { case VK_NUMPAD0: case VK_NUMPAD1: case VK_NUMPAD2: case VK_NUMPAD3: case VK_NUMPAD4: case VK_NUMPAD5: case VK_NUMPAD6: case VK_NUMPAD7: case VK_NUMPAD8: case VK_NUMPAD9: case VK_DECIMAL: m_buttonToNumpadVK[button] = i; break; default: // add extended key if virtual keys don't match if (m_buttonToVK[button] != i) { m_buttonToVK[button | 0x100u] = i; } break; } } // add alt+printscreen if (m_buttonToVK[0x54u] == 0) { m_buttonToVK[0x54u] = VK_SNAPSHOT; } // set virtual key to button table if (GetKeyboardLayout(0) == m_groups[g]) { for (KeyButton i = 0; i < 512; ++i) { if (m_buttonToVK[i] != 0) { if (m_virtualKeyToButton[m_buttonToVK[i]] == 0) { m_virtualKeyToButton[m_buttonToVK[i]] = i; } } if (m_buttonToNumpadVK[i] != 0) { if (m_virtualKeyToButton[m_buttonToNumpadVK[i]] == 0) { m_virtualKeyToButton[m_buttonToNumpadVK[i]] = i; } } } } // add numpad keys for (KeyButton i = 0; i < 512; ++i) { if (m_buttonToNumpadVK[i] != 0) { item.m_id = getKeyID(m_buttonToNumpadVK[i], i); item.m_button = i; item.m_required = KeyModifierNumLock; item.m_sensitive = KeyModifierNumLock | KeyModifierShift; item.m_generates = 0; item.m_client = m_buttonToNumpadVK[i]; addKeyEntry(keyMap, item); } } // add other keys BYTE keys[256]; memset(keys, 0, sizeof(keys)); for (KeyButton i = 0; i < 512; ++i) { if (m_buttonToVK[i] != 0) { // initialize item item.m_id = getKeyID(m_buttonToVK[i], i); item.m_button = i; item.m_required = 0; item.m_sensitive = 0; item.m_client = m_buttonToVK[i]; // get flags for modifier keys CKeyMap::initModifierKey(item); if (item.m_id == 0) { // translate virtual key to a character with and without // shift, caps lock, and AltGr. struct Modifier { UINT m_vk1; UINT m_vk2; BYTE m_state; KeyModifierMask m_mask; }; static const Modifier modifiers[] = { { VK_SHIFT, VK_SHIFT, 0x80u, KeyModifierShift }, { VK_CAPITAL, VK_CAPITAL, 0x01u, KeyModifierCapsLock }, { VK_CONTROL, VK_MENU, 0x80u, KeyModifierControl | KeyModifierAlt } }; static const size_t s_numModifiers = sizeof(modifiers) / sizeof(modifiers[0]); static const size_t s_numCombinations = 1 << s_numModifiers; KeyID id[s_numCombinations]; bool anyFound = false; KeyButton button = static_cast(i & 0xffu); for (size_t j = 0; j < s_numCombinations; ++j) { for (size_t k = 0; k < s_numModifiers; ++k) { //if ((j & (1 << k)) != 0) { // http://msdn.microsoft.com/en-us/library/ke55d167.aspx if ((j & (1i64 << k)) != 0) { keys[modifiers[k].m_vk1] = modifiers[k].m_state; keys[modifiers[k].m_vk2] = modifiers[k].m_state; } else { keys[modifiers[k].m_vk1] = 0; keys[modifiers[k].m_vk2] = 0; } } id[j] = getIDForKey(item, button, m_buttonToVK[i], keys, m_groups[g]); if (id[j] != 0) { anyFound = true; } } if (anyFound) { // determine what modifiers we're sensitive to. // we're sensitive if the KeyID changes when the // modifier does. item.m_sensitive = 0; for (size_t k = 0; k < s_numModifiers; ++k) { for (size_t j = 0; j < s_numCombinations; ++j) { //if (id[j] != id[j ^ (1u << k)]) { // http://msdn.microsoft.com/en-us/library/ke55d167.aspx if (id[j] != id[j ^ (1ui64 << k)]) { item.m_sensitive |= modifiers[k].m_mask; break; } } } // save each key. the map will automatically discard // duplicates, like an unshift and shifted version of // a key that's insensitive to shift. for (size_t j = 0; j < s_numCombinations; ++j) { item.m_id = id[j]; item.m_required = 0; for (size_t k = 0; k < s_numModifiers; ++k) { if ((j & (1i64 << k)) != 0) { item.m_required |= modifiers[k].m_mask; } } addKeyEntry(keyMap, item); } } } else { // found in table switch (m_buttonToVK[i]) { case VK_TAB: // add kKeyLeftTab, too item.m_id = kKeyLeftTab; item.m_required |= KeyModifierShift; item.m_sensitive |= KeyModifierShift; addKeyEntry(keyMap, item); item.m_id = kKeyTab; item.m_required &= ~KeyModifierShift; break; case VK_CANCEL: item.m_required |= KeyModifierControl; item.m_sensitive |= KeyModifierControl; break; case VK_SNAPSHOT: item.m_sensitive |= KeyModifierAlt; if ((i & 0x100u) == 0) { // non-extended snapshot key requires alt item.m_required |= KeyModifierAlt; } break; } addKeyEntry(keyMap, item); } } } } // restore keyboard layout ActivateKeyboardLayout(activeLayout, 0); } void CMSWindowsKeyState::fakeKey(const Keystroke& keystroke) { switch (keystroke.m_type) { case Keystroke::kButton: { LOG((CLOG_DEBUG1 " %03x (%08x) %s", keystroke.m_data.m_button.m_button, keystroke.m_data.m_button.m_client, keystroke.m_data.m_button.m_press ? "down" : "up")); KeyButton button = keystroke.m_data.m_button.m_button; // windows doesn't send key ups for key repeats if (keystroke.m_data.m_button.m_repeat && !keystroke.m_data.m_button.m_press) { LOG((CLOG_DEBUG1 " discard key repeat release")); break; } // get the virtual key for the button UINT vk = keystroke.m_data.m_button.m_client; // special handling of VK_SNAPSHOT if (vk == VK_SNAPSHOT) { if ((getActiveModifiers() & KeyModifierAlt) != 0) { // snapshot active window button = 1; } else { // snapshot full screen button = 0; } } // synthesize event m_desks->fakeKeyEvent(button, vk, keystroke.m_data.m_button.m_press, keystroke.m_data.m_button.m_repeat); break; } case Keystroke::kGroup: // we don't restore the group. we'd like to but we can't be // sure the restoring group change will be processed after the // key events. if (!keystroke.m_data.m_group.m_restore) { if (keystroke.m_data.m_group.m_absolute) { LOG((CLOG_DEBUG1 " group %d", keystroke.m_data.m_group.m_group)); setWindowGroup(keystroke.m_data.m_group.m_group); } else { LOG((CLOG_DEBUG1 " group %+d", keystroke.m_data.m_group.m_group)); setWindowGroup(getEffectiveGroup(pollActiveGroup(), keystroke.m_data.m_group.m_group)); } } break; } } KeyModifierMask& CMSWindowsKeyState::getActiveModifiersRValue() { if (m_useSavedModifiers) { return m_savedModifiers; } else { return CKeyState::getActiveModifiersRValue(); } } bool CMSWindowsKeyState::getGroups(GroupList& groups) const { // get keyboard layouts UInt32 newNumLayouts = GetKeyboardLayoutList(0, NULL); if (newNumLayouts == 0) { LOG((CLOG_DEBUG1 "can't get keyboard layouts")); return false; } HKL* newLayouts = new HKL[newNumLayouts]; newNumLayouts = GetKeyboardLayoutList(newNumLayouts, newLayouts); if (newNumLayouts == 0) { LOG((CLOG_DEBUG1 "can't get keyboard layouts")); delete[] newLayouts; return false; } groups.clear(); groups.insert(groups.end(), newLayouts, newLayouts + newNumLayouts); delete[] newLayouts; return true; } void CMSWindowsKeyState::setWindowGroup(SInt32 group) { HWND targetWindow = GetForegroundWindow(); bool sysCharSet = true; // XXX -- determine if m_groups[group] can be used with the system // character set. PostMessage(targetWindow, WM_INPUTLANGCHANGEREQUEST, sysCharSet ? 1 : 0, (LPARAM)m_groups[group]); // XXX -- use a short delay to let the target window process the message // before it sees the keyboard events. i'm not sure why this is // necessary since the messages should arrive in order. if we don't // delay, though, some of our keyboard events may disappear. Sleep(100); } void CMSWindowsKeyState::fixKeys() { // fake key releases for the windows keys if we think they're // down but they're really up. we have to do this because if the // user presses and releases a windows key without pressing any // other key while it's down then the system will eat the key // release. if we don't detect that and synthesize the release // then the client won't take the usual windows key release action // (which on windows is to show the start menu). // // only check on the windows 95 family since the NT family reports // the key releases as usual. if (!m_is95Family) { return; } KeyButton leftButton = virtualKeyToButton(VK_LWIN); KeyButton rightButton = virtualKeyToButton(VK_RWIN); bool leftDown = isKeyDown(leftButton); bool rightDown = isKeyDown(rightButton); bool fix = (leftDown || rightDown); if (fix) { // check if either button is not really down bool leftAsyncDown = ((GetAsyncKeyState(VK_LWIN) & 0x8000) != 0); bool rightAsyncDown = ((GetAsyncKeyState(VK_RWIN) & 0x8000) != 0); if (leftAsyncDown != leftDown || rightAsyncDown != rightDown) { KeyModifierMask state = getActiveModifiers(); if (!leftAsyncDown && !rightAsyncDown) { // no win keys are down so remove super modifier state &= ~KeyModifierSuper; } // report up events if (leftDown && !leftAsyncDown) { LOG((CLOG_DEBUG1 "event: fake key release left windows key (0x%03x)", leftButton)); CKeyState::onKey(leftButton, false, state); CKeyState::sendKeyEvent(m_eventTarget, false, false, kKeySuper_L, state, 1, leftButton); } if (rightDown && !rightAsyncDown) { LOG((CLOG_DEBUG1 "event: fake key release right windows key (0x%03x)", rightButton)); CKeyState::onKey(rightButton, false, state); CKeyState::sendKeyEvent(m_eventTarget, false, false, kKeySuper_R, state, 1, rightButton); } } } if (fix && m_fixTimer == NULL) { // schedule check m_fixTimer = EVENTQUEUE->newTimer(0.1, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_fixTimer, new TMethodEventJob( this, &CMSWindowsKeyState::handleFixKeys)); } else if (!fix && m_fixTimer != NULL) { // remove scheduled check EVENTQUEUE->removeHandler(CEvent::kTimer, m_fixTimer); EVENTQUEUE->deleteTimer(m_fixTimer); m_fixTimer = NULL; } } void CMSWindowsKeyState::handleFixKeys(const CEvent&, void*) { fixKeys(); } KeyID CMSWindowsKeyState::getKeyID(UINT virtualKey, KeyButton button) { if ((button & 0x100u) != 0) { virtualKey += 0x100u; } return s_virtualKey[virtualKey]; } KeyID CMSWindowsKeyState::getIDForKey(CKeyMap::KeyItem& item, KeyButton button, UINT virtualKey, PBYTE keyState, HKL hkl) const { int n; KeyID id; if (m_is95Family) { // XXX -- how do we get characters not in Latin-1? WORD ascii; n = ToAsciiEx(virtualKey, button, keyState, &ascii, 0, hkl); id = static_cast(ascii & 0xffu); } else { WCHAR unicode[2]; n = m_ToUnicodeEx(virtualKey, button, keyState, unicode, sizeof(unicode) / sizeof(unicode[0]), 0, hkl); id = static_cast(unicode[0]); } switch (n) { case -1: return CKeyMap::getDeadKey(id); default: case 0: // unmapped return kKeyNone; case 1: return id; case 2: // left over dead key in buffer. this used to recurse, // but apparently this causes a stack overflow, so just // return no key instead. return kKeyNone; } } void CMSWindowsKeyState::addKeyEntry(CKeyMap& keyMap, CKeyMap::KeyItem& item) { keyMap.addKeyEntry(item); if (item.m_group == 0) { m_keyToVKMap[item.m_id] = static_cast(item.m_client); } } synergy-1.4.12-Source/src/lib/platform/CMSWindowsKeyState.h0000600000175000017500000001513212021261364023507 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSKEYSTATE_H #define CMSWINDOWSKEYSTATE_H #include "CKeyState.h" #include "CString.h" #include "stdvector.h" #define WIN32_LEAN_AND_MEAN #include class CEvent; class CEventQueueTimer; class CMSWindowsDesks; class IEventQueue; //! Microsoft Windows key mapper /*! This class maps KeyIDs to keystrokes. */ class CMSWindowsKeyState : public CKeyState { public: CMSWindowsKeyState(CMSWindowsDesks* desks, void* eventTarget); CMSWindowsKeyState(CMSWindowsDesks* desks, void* eventTarget, IEventQueue& eventQueue, CKeyMap& keyMap); virtual ~CMSWindowsKeyState(); //! @name manipulators //@{ //! Handle screen disabling /*! Called when screen is disabled. This is needed to deal with platform brokenness. */ void disable(); //! Set the active keyboard layout /*! Uses \p keyLayout when querying the keyboard. */ void setKeyLayout(HKL keyLayout); //! Test and set autorepeat state /*! Returns true if the given button is autorepeating and updates internal state. */ bool testAutoRepeat(bool press, bool isRepeat, KeyButton); //! Remember modifier state /*! Records the current non-toggle modifier state. */ void saveModifiers(); //! Set effective modifier state /*! Temporarily sets the non-toggle modifier state to those saved by the last call to \c saveModifiers if \p enable is \c true. Restores the modifier state to the current modifier state if \p enable is \c false. This is for synthesizing keystrokes on the primary screen when the cursor is on a secondary screen. When on a secondary screen we capture all non-toggle modifier state, track the state internally and do not pass it on. So if Alt+F1 synthesizes Alt+X we need to synthesize not just X but also Alt, despite the fact that our internal modifier state indicates Alt is down, because local apps never saw the Alt down event. */ void useSavedModifiers(bool enable); //@} //! @name accessors //@{ //! Map a virtual key to a button /*! Returns the button for the \p virtualKey. */ KeyButton virtualKeyToButton(UINT virtualKey) const; //! Map key event to a key /*! Converts a key event into a KeyID and the shadow modifier state to a modifier mask. */ KeyID mapKeyFromEvent(WPARAM charAndVirtKey, LPARAM info, KeyModifierMask* maskOut) const; //! Check if keyboard groups have changed /*! Returns true iff the number or order of the keyboard groups have changed since the last call to updateKeys(). */ bool didGroupsChange() const; //! Map key to virtual key /*! Returns the virtual key for key \p key or 0 if there's no such virtual key. */ UINT mapKeyToVirtualKey(KeyID key) const; //! Map virtual key and button to KeyID /*! Returns the KeyID for virtual key \p virtualKey and button \p button (button should include the extended key bit), or kKeyNone if there is no such key. */ static KeyID getKeyID(UINT virtualKey, KeyButton button); //@} // IKeyState overrides virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button); virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button); virtual bool fakeCtrlAltDel(); virtual KeyModifierMask pollActiveModifiers() const; virtual SInt32 pollActiveGroup() const; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const; // CKeyState overrides virtual void onKey(KeyButton button, bool down, KeyModifierMask newState); virtual void sendKeyEvent(void* target, bool press, bool isAutoRepeat, KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button); // Unit test accessors KeyButton getLastDown() const { return m_lastDown; } void setLastDown(KeyButton value) { m_lastDown = value; } KeyModifierMask getSavedModifiers() const { return m_savedModifiers; } void setSavedModifiers(KeyModifierMask value) { m_savedModifiers = value; } protected: // CKeyState overrides virtual void getKeyMap(CKeyMap& keyMap); virtual void fakeKey(const Keystroke& keystroke); virtual KeyModifierMask& getActiveModifiersRValue(); private: typedef std::vector GroupList; // send ctrl+alt+del hotkey event on NT family static void ctrlAltDelThread(void*); bool getGroups(GroupList&) const; void setWindowGroup(SInt32 group); void fixKeys(); void handleFixKeys(const CEvent&, void*); KeyID getIDForKey(CKeyMap::KeyItem& item, KeyButton button, UINT virtualKey, PBYTE keyState, HKL hkl) const; void addKeyEntry(CKeyMap& keyMap, CKeyMap::KeyItem& item); void init(); private: // not implemented CMSWindowsKeyState(const CMSWindowsKeyState&); CMSWindowsKeyState& operator=(const CMSWindowsKeyState&); private: typedef std::map GroupMap; typedef std::map KeyToVKMap; bool m_is95Family; void* m_eventTarget; CMSWindowsDesks* m_desks; HKL m_keyLayout; UINT m_buttonToVK[512]; UINT m_buttonToNumpadVK[512]; KeyButton m_virtualKeyToButton[256]; KeyToVKMap m_keyToVKMap; IEventQueue& m_eventQueue; // the timer used to check for fixing key state CEventQueueTimer* m_fixTimer; // the groups (keyboard layouts) GroupList m_groups; GroupMap m_groupMap; // the last button that we generated a key down event for. this // is zero if the last key event was a key up. we use this to // synthesize key repeats since the low level keyboard hook can't // tell us if an event is a key repeat. KeyButton m_lastDown; // modifier tracking bool m_useSavedModifiers; KeyModifierMask m_savedModifiers; KeyModifierMask m_originalSavedModifiers; // pointer to ToUnicodeEx. on win95 family this will be NULL. typedef int (WINAPI *ToUnicodeEx_t)(UINT wVirtKey, UINT wScanCode, PBYTE lpKeyState, LPWSTR pwszBuff, int cchBuff, UINT wFlags, HKL dwhkl); ToUnicodeEx_t m_ToUnicodeEx; static const KeyID s_virtualKey[]; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsRelauncher.cpp0000600000175000017500000003721412021261364024406 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2009 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsRelauncher.h" #include "CThread.h" #include "TMethodJob.h" #include "CLog.h" #include "CArch.h" #include "Version.h" #include "CArchDaemonWindows.h" #include "XArchWindows.h" #include "CApp.h" #include "CArgsBase.h" #include "CIpcLogOutputter.h" #include "CIpcServer.h" #include "CIpcMessage.h" #include "Ipc.h" #include #include #include #include #include enum { kOutputBufferSize = 4096 }; typedef VOID (WINAPI *SendSas)(BOOL asUser); CMSWindowsRelauncher::CMSWindowsRelauncher( bool autoDetectCommand, CIpcServer& ipcServer, CIpcLogOutputter& ipcLogOutputter) : m_thread(NULL), m_autoDetectCommand(autoDetectCommand), m_running(true), m_commandChanged(false), m_stdOutWrite(NULL), m_stdOutRead(NULL), m_ipcServer(ipcServer), m_ipcLogOutputter(ipcLogOutputter), m_elevateProcess(false) { } CMSWindowsRelauncher::~CMSWindowsRelauncher() { } void CMSWindowsRelauncher::startAsync() { m_thread = new CThread(new TMethodJob( this, &CMSWindowsRelauncher::mainLoop, nullptr)); m_outputThread = new CThread(new TMethodJob( this, &CMSWindowsRelauncher::outputLoop, nullptr)); } void CMSWindowsRelauncher::stop() { m_running = false; m_thread->wait(5); delete m_thread; m_outputThread->wait(5); delete m_outputThread; } // this still gets the physical session (the one the keyboard and // mouse is connected to), sometimes this returns -1 but not sure why DWORD CMSWindowsRelauncher::getSessionId() { return WTSGetActiveConsoleSessionId(); } BOOL CMSWindowsRelauncher::isProcessInSession(const char* name, DWORD sessionId, PHANDLE process = NULL) { // first we need to take a snapshot of the running processes HANDLE snapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0); if (snapshot == INVALID_HANDLE_VALUE) { LOG((CLOG_ERR "could not get process snapshot (error: %i)", GetLastError())); return 0; } PROCESSENTRY32 entry; entry.dwSize = sizeof(PROCESSENTRY32); // get the first process, and if we can't do that then it's // unlikely we can go any further BOOL gotEntry = Process32First(snapshot, &entry); if (!gotEntry) { LOG((CLOG_ERR "could not get first process entry (error: %i)", GetLastError())); return 0; } // used to record process names for debug info std::list nameList; // now just iterate until we can find winlogon.exe pid DWORD pid = 0; while(gotEntry) { // make sure we're not checking the system process if (entry.th32ProcessID != 0) { DWORD processSessionId; BOOL pidToSidRet = ProcessIdToSessionId( entry.th32ProcessID, &processSessionId); if (!pidToSidRet) { LOG((CLOG_ERR "could not get session id for process id %i (error: %i)", entry.th32ProcessID, GetLastError())); return 0; } // only pay attention to processes in the active session if (processSessionId == sessionId) { // store the names so we can record them for debug nameList.push_back(entry.szExeFile); if (_stricmp(entry.szExeFile, name) == 0) { pid = entry.th32ProcessID; } } } // now move on to the next entry (if we're not at the end) gotEntry = Process32Next(snapshot, &entry); if (!gotEntry) { DWORD err = GetLastError(); if (err != ERROR_NO_MORE_FILES) { // only worry about error if it's not the end of the snapshot LOG((CLOG_ERR "could not get subsiquent process entry (error: %i)", GetLastError())); return 0; } } } std::string nameListJoin; for(std::list::iterator it = nameList.begin(); it != nameList.end(); it++) { nameListJoin.append(*it); nameListJoin.append(", "); } LOG((CLOG_DEBUG "processes in session %d: %s", sessionId, nameListJoin.c_str())); CloseHandle(snapshot); if (pid) { if (process != NULL) { // now get the process so we can get the process, with which // we'll use to get the process token. LOG((CLOG_DEBUG "found %s in session %i", name, sessionId)); *process = OpenProcess(MAXIMUM_ALLOWED, FALSE, pid); } return true; } else { return false; } } HANDLE CMSWindowsRelauncher::duplicateProcessToken(HANDLE process, LPSECURITY_ATTRIBUTES security) { HANDLE sourceToken; BOOL tokenRet = OpenProcessToken( process, TOKEN_ASSIGN_PRIMARY | TOKEN_ALL_ACCESS, &sourceToken); if (!tokenRet) { LOG((CLOG_ERR "could not open token, process handle: %d (error: %i)", process, GetLastError())); return NULL; } LOG((CLOG_DEBUG "got token %i, duplicating", sourceToken)); HANDLE newToken; BOOL duplicateRet = DuplicateTokenEx( sourceToken, TOKEN_ASSIGN_PRIMARY | TOKEN_ALL_ACCESS, security, SecurityImpersonation, TokenPrimary, &newToken); if (!duplicateRet) { LOG((CLOG_ERR "could not duplicate token %i (error: %i)", sourceToken, GetLastError())); return NULL; } LOG((CLOG_DEBUG "duplicated, new token: %i", newToken)); return newToken; } HANDLE CMSWindowsRelauncher::getUserToken(DWORD sessionId, LPSECURITY_ATTRIBUTES security) { // always elevate if we are at the vista/7 login screen. we could also // elevate for the uac dialog (consent.exe) but this would be pointless, // since synergy would re-launch as non-elevated after the desk switch, // and so would be unusable with the new elevated process taking focus. if (m_elevateProcess || isProcessInSession("logonui.exe", sessionId)) { LOG((CLOG_DEBUG "getting elevated token, %s", (m_elevateProcess ? "elevation required" : "at login screen"))); HANDLE process; if (isProcessInSession("winlogon.exe", sessionId, &process)) { return duplicateProcessToken(process, security); } else { LOG((CLOG_ERR "could not find winlogon in session %i", sessionId)); return NULL; } } else { LOG((CLOG_DEBUG "getting non-elevated token")); return getSessionToken(sessionId, security); } } HANDLE CMSWindowsRelauncher::getSessionToken(DWORD sessionId, LPSECURITY_ATTRIBUTES security) { HANDLE sourceToken; if (!WTSQueryUserToken(sessionId, &sourceToken)) { LOG((CLOG_ERR "could not get token from session %d (error: %i)", sessionId, GetLastError())); return 0; } HANDLE newToken; if (!DuplicateTokenEx( sourceToken, TOKEN_ASSIGN_PRIMARY | TOKEN_ALL_ACCESS, security, SecurityImpersonation, TokenPrimary, &newToken)) { LOG((CLOG_ERR "could not duplicate token (error: %i)", GetLastError())); return 0; } LOG((CLOG_DEBUG "duplicated, new token: %i", newToken)); return newToken; } void CMSWindowsRelauncher::mainLoop(void*) { shutdownExistingProcesses(); SendSas sendSasFunc = NULL; HINSTANCE sasLib = LoadLibrary("sas.dll"); if (sasLib) { LOG((CLOG_DEBUG "found sas.dll")); sendSasFunc = (SendSas)GetProcAddress(sasLib, "SendSAS"); } DWORD sessionId = -1; bool launched = false; SECURITY_ATTRIBUTES saAttr; saAttr.nLength = sizeof(SECURITY_ATTRIBUTES); saAttr.bInheritHandle = TRUE; saAttr.lpSecurityDescriptor = NULL; if (!CreatePipe(&m_stdOutRead, &m_stdOutWrite, &saAttr, 0)) { throw XArch(new XArchEvalWindows()); } PROCESS_INFORMATION pi; ZeroMemory(&pi, sizeof(PROCESS_INFORMATION)); int failures = 0; while (m_running) { HANDLE sendSasEvent = 0; if (sasLib && sendSasFunc) { // can't we just create one event? seems weird creating a new // event every second... sendSasEvent = CreateEvent(NULL, FALSE, FALSE, "Global\\SendSAS"); } DWORD newSessionId = getSessionId(); bool running = false; if (launched) { DWORD exitCode; GetExitCodeProcess(pi.hProcess, &exitCode); running = (exitCode == STILL_ACTIVE); if (!running) { failures++; LOG((CLOG_INFO "detected application not running, pid=%d, failures=%d", pi.dwProcessId, failures)); // increasing backoff period, maximum of 10 seconds. int timeout = (failures * 2) < 10 ? (failures * 2) : 10; LOG((CLOG_DEBUG "waiting, backoff period is %d seconds", timeout)); ARCH->sleep(timeout); // double check, in case process started after we waited. GetExitCodeProcess(pi.hProcess, &exitCode); running = (exitCode == STILL_ACTIVE); } else { // reset failures when running. failures = 0; } } // only enter here when id changes, and the session isn't -1, which // may mean that there is no active session. bool sessionChanged = ((newSessionId != sessionId) && (newSessionId != -1)); // relaunch if it was running but has stopped unexpectedly. bool stoppedRunning = (launched && !running); if (stoppedRunning || sessionChanged || m_commandChanged) { m_commandChanged = false; if (launched) { LOG((CLOG_DEBUG "closing existing process to make way for new one")); shutdownProcess(pi.hProcess, pi.dwProcessId, 20); launched = false; } // ok, this is now the active session (forget the old one if any) sessionId = newSessionId; SECURITY_ATTRIBUTES sa; ZeroMemory(&sa, sizeof(SECURITY_ATTRIBUTES)); HANDLE userToken = getUserToken(sessionId, &sa); if (userToken == NULL) { // HACK: trigger retry mechanism. launched = true; continue; } std::string cmd = command(); if (cmd == "") { // this appears on first launch when the user hasn't configured // anything yet, so don't show it as a warning, only show it as // debug to devs to let them know why nothing happened. LOG((CLOG_DEBUG "nothing to launch, no command specified.")); continue; } // in case reusing process info struct ZeroMemory(&pi, sizeof(PROCESS_INFORMATION)); STARTUPINFO si; ZeroMemory(&si, sizeof(STARTUPINFO)); si.cb = sizeof(STARTUPINFO); si.lpDesktop = "winsta0\\Default"; // TODO: maybe this should be \winlogon if we have logonui.exe? si.hStdError = m_stdOutWrite; si.hStdOutput = m_stdOutWrite; si.dwFlags |= STARTF_USESTDHANDLES; LPVOID environment; BOOL blockRet = CreateEnvironmentBlock(&environment, userToken, FALSE); if (!blockRet) { LOG((CLOG_ERR "could not create environment block (error: %i)", GetLastError())); continue; } DWORD creationFlags = NORMAL_PRIORITY_CLASS | CREATE_NO_WINDOW | CREATE_UNICODE_ENVIRONMENT; // re-launch in current active user session LOG((CLOG_INFO "starting new process")); BOOL createRet = CreateProcessAsUser( userToken, NULL, LPSTR(cmd.c_str()), &sa, NULL, TRUE, creationFlags, environment, NULL, &si, &pi); DestroyEnvironmentBlock(environment); CloseHandle(userToken); if (!createRet) { LOG((CLOG_ERR "could not launch (error: %i)", GetLastError())); continue; } else { LOG((CLOG_DEBUG "launched in session %i (cmd: %s)", sessionId, cmd.c_str())); launched = true; } } if (sendSasEvent) { // use SendSAS event to wait for next session. if (WaitForSingleObject(sendSasEvent, 1000) == WAIT_OBJECT_0 && sendSasFunc) { LOG((CLOG_DEBUG "calling SendSAS")); sendSasFunc(FALSE); } CloseHandle(sendSasEvent); } else { // check for session change every second. ARCH->sleep(1); } } if (launched) { LOG((CLOG_DEBUG "terminated running process on exit")); shutdownProcess(pi.hProcess, pi.dwProcessId, 20); } LOG((CLOG_DEBUG "relauncher main thread finished")); } void CMSWindowsRelauncher::command(const std::string& command, bool elevate) { LOG((CLOG_INFO "service command updated")); m_command = command; m_elevateProcess = elevate; m_commandChanged = true; } std::string CMSWindowsRelauncher::command() const { if (!m_autoDetectCommand) { return m_command; } // seems like a fairly convoluted way to get the process name const char* launchName = CApp::instance().argsBase().m_pname; std::string args = ARCH->commandLine(); // build up a full command line std::stringstream cmdTemp; cmdTemp << launchName << args; std::string cmd = cmdTemp.str(); size_t i; std::string find = "--relaunch"; while((i = cmd.find(find)) != std::string::npos) { cmd.replace(i, find.length(), ""); } return cmd; } void CMSWindowsRelauncher::outputLoop(void*) { // +1 char for \0 CHAR buffer[kOutputBufferSize + 1]; while (m_running) { DWORD bytesRead; BOOL success = ReadFile(m_stdOutRead, buffer, kOutputBufferSize, &bytesRead, NULL); // assume the process has gone away? slow down // the reads until another one turns up. if (!success || bytesRead == 0) { ARCH->sleep(1); } else { buffer[bytesRead] = '\0'; // send process output over IPC to GUI, and force it to be sent // which bypasses the ipc logging anti-recursion mechanism. m_ipcLogOutputter.write(kINFO, buffer, true); } } } void CMSWindowsRelauncher::shutdownProcess(HANDLE handle, DWORD pid, int timeout) { DWORD exitCode; GetExitCodeProcess(handle, &exitCode); if (exitCode != STILL_ACTIVE) return; CIpcShutdownMessage shutdown; m_ipcServer.send(shutdown, kIpcClientNode); // wait for process to exit gracefully. double start = ARCH->time(); while (true) { GetExitCodeProcess(handle, &exitCode); if (exitCode != STILL_ACTIVE) { // yay, we got a graceful shutdown. there should be no hook in use errors! LOG((CLOG_INFO "process %d was shutdown gracefully", pid)); break; } else { double elapsed = (ARCH->time() - start); if (elapsed > timeout) { // if timeout reached, kill forcefully. // calling TerminateProcess on synergy is very bad! // it causes the hook DLL to stay loaded in some apps, // making it impossible to start synergy again. LOG((CLOG_WARN "shutdown timed out after %d secs, forcefully terminating", (int)elapsed)); TerminateProcess(handle, kExitSuccess); break; } ARCH->sleep(1); } } } void CMSWindowsRelauncher::shutdownExistingProcesses() { // first we need to take a snapshot of the running processes HANDLE snapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0); if (snapshot == INVALID_HANDLE_VALUE) { LOG((CLOG_ERR "could not get process snapshot (error: %i)", GetLastError())); return; } PROCESSENTRY32 entry; entry.dwSize = sizeof(PROCESSENTRY32); // get the first process, and if we can't do that then it's // unlikely we can go any further BOOL gotEntry = Process32First(snapshot, &entry); if (!gotEntry) { LOG((CLOG_ERR "could not get first process entry (error: %i)", GetLastError())); return; } // now just iterate until we can find winlogon.exe pid DWORD pid = 0; while(gotEntry) { // make sure we're not checking the system process if (entry.th32ProcessID != 0) { if (_stricmp(entry.szExeFile, "synergyc.exe") == 0 || _stricmp(entry.szExeFile, "synergys.exe") == 0) { HANDLE handle = OpenProcess(PROCESS_ALL_ACCESS, FALSE, entry.th32ProcessID); shutdownProcess(handle, entry.th32ProcessID, 10); } } // now move on to the next entry (if we're not at the end) gotEntry = Process32Next(snapshot, &entry); if (!gotEntry) { DWORD err = GetLastError(); if (err != ERROR_NO_MORE_FILES) { // only worry about error if it's not the end of the snapshot LOG((CLOG_ERR "could not get subsiquent process entry (error: %i)", GetLastError())); return; } } } CloseHandle(snapshot); } synergy-1.4.12-Source/src/lib/platform/CMSWindowsRelauncher.h0000600000175000017500000000366412021261364024055 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2009 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #define WIN32_LEAN_AND_MEAN #include #include #include class CThread; class CIpcLogOutputter; class CIpcServer; class CMSWindowsRelauncher { public: CMSWindowsRelauncher( bool autoDetectCommand, CIpcServer& ipcServer, CIpcLogOutputter& ipcLogOutputter); virtual ~CMSWindowsRelauncher(); void startAsync(); std::string command() const; void command(const std::string& command, bool elevate); void stop(); private: void mainLoop(void*); BOOL isProcessInSession(const char* name, DWORD sessionId, PHANDLE process); DWORD getSessionId(); void outputLoop(void*); void shutdownProcess(HANDLE handle, DWORD pid, int timeout); void shutdownExistingProcesses(); HANDLE duplicateProcessToken(HANDLE process, LPSECURITY_ATTRIBUTES security); HANDLE getSessionToken(DWORD sessionId, LPSECURITY_ATTRIBUTES security); HANDLE getUserToken(DWORD sessionId, LPSECURITY_ATTRIBUTES security); private: CThread* m_thread; bool m_autoDetectCommand; std::string m_command; bool m_running; bool m_commandChanged; HANDLE m_stdOutWrite; HANDLE m_stdOutRead; CThread* m_outputThread; CIpcServer& m_ipcServer; CIpcLogOutputter& m_ipcLogOutputter; bool m_elevateProcess; }; synergy-1.4.12-Source/src/lib/platform/CMSWindowsScreen.cpp0000600000175000017500000013366612021261364023545 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsScreen.h" #include "CMSWindowsClipboard.h" #include "CMSWindowsDesks.h" #include "CMSWindowsEventQueueBuffer.h" #include "CMSWindowsKeyState.h" #include "CMSWindowsScreenSaver.h" #include "CClipboard.h" #include "CKeyMap.h" #include "XScreen.h" #include "CLock.h" #include "CThread.h" #include "CFunctionJob.h" #include "CLog.h" #include "CString.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "TMethodJob.h" #include "CArch.h" #include "CArchMiscWindows.h" #include #include // // add backwards compatible multihead support (and suppress bogus warning). // this isn't supported on MinGW yet AFAICT. // #if defined(_MSC_VER) #pragma warning(push) #pragma warning(disable: 4706) // assignment within conditional #define COMPILE_MULTIMON_STUBS #include #pragma warning(pop) #endif // X button stuff #if !defined(WM_XBUTTONDOWN) #define WM_XBUTTONDOWN 0x020B #define WM_XBUTTONUP 0x020C #define WM_XBUTTONDBLCLK 0x020D #define WM_NCXBUTTONDOWN 0x00AB #define WM_NCXBUTTONUP 0x00AC #define WM_NCXBUTTONDBLCLK 0x00AD #define MOUSEEVENTF_XDOWN 0x0080 #define MOUSEEVENTF_XUP 0x0100 #define XBUTTON1 0x0001 #define XBUTTON2 0x0002 #endif #if !defined(VK_XBUTTON1) #define VK_XBUTTON1 0x05 #define VK_XBUTTON2 0x06 #endif // WM_POWERBROADCAST stuff #if !defined(PBT_APMRESUMEAUTOMATIC) #define PBT_APMRESUMEAUTOMATIC 0x0012 #endif // // CMSWindowsScreen // HINSTANCE CMSWindowsScreen::s_windowInstance = NULL; CMSWindowsScreen* CMSWindowsScreen::s_screen = NULL; CMSWindowsScreen::CMSWindowsScreen( bool isPrimary, bool noHooks, const CGameDeviceInfo& gameDeviceInfo, bool stopOnDeskSwitch) : m_isPrimary(isPrimary), m_noHooks(noHooks), m_is95Family(CArchMiscWindows::isWindows95Family()), m_isOnScreen(m_isPrimary), m_class(0), m_x(0), m_y(0), m_w(0), m_h(0), m_xCenter(0), m_yCenter(0), m_multimon(false), m_xCursor(0), m_yCursor(0), m_sequenceNumber(0), m_mark(0), m_markReceived(0), m_fixTimer(NULL), m_keyLayout(NULL), m_screensaver(NULL), m_screensaverNotify(false), m_screensaverActive(false), m_window(NULL), m_nextClipboardWindow(NULL), m_ownClipboard(false), m_desks(NULL), m_hookLibrary(NULL), m_keyState(NULL), m_hasMouse(GetSystemMetrics(SM_MOUSEPRESENT) != 0), m_showingMouse(false), m_gameDeviceInfo(gameDeviceInfo), m_gameDevice(NULL) { assert(s_windowInstance != NULL); assert(s_screen == NULL); s_screen = this; try { if (m_isPrimary && !m_noHooks) { m_hookLibrary = openHookLibrary("synrgyhk"); } m_screensaver = new CMSWindowsScreenSaver(); m_desks = new CMSWindowsDesks( m_isPrimary, m_noHooks, m_hookLibrary, m_screensaver, *EVENTQUEUE, new TMethodJob(this, &CMSWindowsScreen::updateKeysCB), stopOnDeskSwitch); m_keyState = new CMSWindowsKeyState(m_desks, getEventTarget()); updateScreenShape(); m_class = createWindowClass(); m_window = createWindow(m_class, "Synergy"); forceShowCursor(); LOG((CLOG_DEBUG "screen shape: %d,%d %dx%d %s", m_x, m_y, m_w, m_h, m_multimon ? "(multi-monitor)" : "")); LOG((CLOG_DEBUG "window is 0x%08x", m_window)); } catch (...) { delete m_keyState; delete m_desks; delete m_screensaver; destroyWindow(m_window); destroyClass(m_class); if (m_hookLibrary != NULL) closeHookLibrary(m_hookLibrary); s_screen = NULL; throw; } // install event handlers EVENTQUEUE->adoptHandler(CEvent::kSystem, IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CMSWindowsScreen::handleSystemEvent)); // install the platform event queue EVENTQUEUE->adoptBuffer(new CMSWindowsEventQueueBuffer); if ((gameDeviceInfo.m_mode == CGameDeviceInfo::kGameModeXInput) && (gameDeviceInfo.m_poll != CGameDeviceInfo::kGamePollDynamic)) LOG((CLOG_WARN "only dynamic polling is supported with xnput.")); if ((gameDeviceInfo.m_mode == CGameDeviceInfo::kGameModeJoyInfoEx) && (gameDeviceInfo.m_poll != CGameDeviceInfo::kGamePollStatic)) LOG((CLOG_WARN "only static polling is supported with joyinfoex.")); if (m_gameDeviceInfo.m_mode == CGameDeviceInfo::kGameModeXInput) { #if GAME_DEVICE_SUPPORT m_gameDevice = new CMSWindowsXInput(this, gameDeviceInfo); #else if _AMD64_ LOG((CLOG_WARN "xinput game device mode not supported for 64-bit.")); #endif } else { m_gameDevice = new CEventGameDevice(getEventTarget()); } } CMSWindowsScreen::~CMSWindowsScreen() { assert(s_screen != NULL); disable(); EVENTQUEUE->adoptBuffer(NULL); EVENTQUEUE->removeHandler(CEvent::kSystem, IEventQueue::getSystemTarget()); delete m_keyState; delete m_desks; delete m_screensaver; destroyWindow(m_window); destroyClass(m_class); if (m_gameDevice != NULL) delete m_gameDevice; if (m_hookLibrary != NULL) closeHookLibrary(m_hookLibrary); s_screen = NULL; } void CMSWindowsScreen::init(HINSTANCE windowInstance) { assert(s_windowInstance == NULL); assert(windowInstance != NULL); s_windowInstance = windowInstance; } HINSTANCE CMSWindowsScreen::getWindowInstance() { return s_windowInstance; } void CMSWindowsScreen::enable() { assert(m_isOnScreen == m_isPrimary); // we need to poll some things to fix them m_fixTimer = EVENTQUEUE->newTimer(1.0, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_fixTimer, new TMethodEventJob(this, &CMSWindowsScreen::handleFixes)); // install our clipboard snooper m_nextClipboardWindow = SetClipboardViewer(m_window); // track the active desk and (re)install the hooks m_desks->enable(); if (m_isPrimary) { if (m_hookLibrary != NULL) { // set jump zones m_hookLibraryLoader.m_setZone(m_x, m_y, m_w, m_h, getJumpZoneSize()); // watch jump zones m_hookLibraryLoader.m_setMode(kHOOK_WATCH_JUMP_ZONE); } } else { // prevent the system from entering power saving modes. if // it did we'd be forced to disconnect from the server and // the server would not be able to wake us up. CArchMiscWindows::addBusyState(CArchMiscWindows::kSYSTEM); } } void CMSWindowsScreen::disable() { // stop tracking the active desk m_desks->disable(); if (m_isPrimary) { if (m_hookLibrary != NULL) { // disable hooks m_hookLibraryLoader.m_setMode(kHOOK_DISABLE); } // enable special key sequences on win95 family enableSpecialKeys(true); } else { // allow the system to enter power saving mode CArchMiscWindows::removeBusyState(CArchMiscWindows::kSYSTEM | CArchMiscWindows::kDISPLAY); } // tell key state m_keyState->disable(); // stop snooping the clipboard ChangeClipboardChain(m_window, m_nextClipboardWindow); m_nextClipboardWindow = NULL; // uninstall fix timer if (m_fixTimer != NULL) { EVENTQUEUE->removeHandler(CEvent::kTimer, m_fixTimer); EVENTQUEUE->deleteTimer(m_fixTimer); m_fixTimer = NULL; } m_isOnScreen = m_isPrimary; forceShowCursor(); } void CMSWindowsScreen::enter() { m_desks->enter(); if (m_isPrimary) { // enable special key sequences on win95 family enableSpecialKeys(true); if (m_hookLibrary != NULL) { // watch jump zones m_hookLibraryLoader.m_setMode(kHOOK_WATCH_JUMP_ZONE); } // all messages prior to now are invalid nextMark(); } else { // Entering a secondary screen. Ensure that no screensaver is active // and that the screen is not in powersave mode. CArchMiscWindows::wakeupDisplay(); if(m_screensaver != NULL && m_screensaverActive) { m_screensaver->deactivate(); m_screensaverActive = 0; } } // now on screen m_isOnScreen = true; forceShowCursor(); } bool CMSWindowsScreen::leave() { // get keyboard layout of foreground window. we'll use this // keyboard layout for translating keys sent to clients. HWND window = GetForegroundWindow(); DWORD thread = GetWindowThreadProcessId(window, NULL); m_keyLayout = GetKeyboardLayout(thread); // tell the key mapper about the keyboard layout m_keyState->setKeyLayout(m_keyLayout); // tell desk that we're leaving and tell it the keyboard layout m_desks->leave(m_keyLayout); if (m_isPrimary) { // warp to center LOG((CLOG_DEBUG1 "warping cursor to center: %+d, %+d", m_xCenter, m_yCenter)); warpCursor(m_xCenter, m_yCenter); // disable special key sequences on win95 family enableSpecialKeys(false); // all messages prior to now are invalid nextMark(); // remember the modifier state. this is the modifier state // reflected in the internal keyboard state. m_keyState->saveModifiers(); if (m_hookLibrary != NULL) { // capture events m_hookLibraryLoader.m_setMode(kHOOK_RELAY_EVENTS); } } // now off screen m_isOnScreen = false; forceShowCursor(); return true; } bool CMSWindowsScreen::setClipboard(ClipboardID, const IClipboard* src) { CMSWindowsClipboard dst(m_window); if (src != NULL) { // save clipboard data return CClipboard::copy(&dst, src); } else { // assert clipboard ownership if (!dst.open(0)) { return false; } dst.empty(); dst.close(); return true; } } void CMSWindowsScreen::checkClipboards() { // if we think we own the clipboard but we don't then somebody // grabbed the clipboard on this screen without us knowing. // tell the server that this screen grabbed the clipboard. // // this works around bugs in the clipboard viewer chain. // sometimes NT will simply never send WM_DRAWCLIPBOARD // messages for no apparent reason and rebooting fixes the // problem. since we don't want a broken clipboard until the // next reboot we do this double check. clipboard ownership // won't be reflected on other screens until we leave but at // least the clipboard itself will work. if (m_ownClipboard && !CMSWindowsClipboard::isOwnedBySynergy()) { LOG((CLOG_DEBUG "clipboard changed: lost ownership and no notification received")); m_ownClipboard = false; sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardClipboard); sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardSelection); } } void CMSWindowsScreen::openScreensaver(bool notify) { assert(m_screensaver != NULL); m_screensaverNotify = notify; if (m_screensaverNotify) { m_desks->installScreensaverHooks(true); } else if (m_screensaver) { m_screensaver->disable(); } } void CMSWindowsScreen::closeScreensaver() { if (m_screensaver != NULL) { if (m_screensaverNotify) { m_desks->installScreensaverHooks(false); } else { m_screensaver->enable(); } } m_screensaverNotify = false; } void CMSWindowsScreen::screensaver(bool activate) { assert(m_screensaver != NULL); if (m_screensaver==NULL) return; if (activate) { m_screensaver->activate(); } else { m_screensaver->deactivate(); } } void CMSWindowsScreen::resetOptions() { m_desks->resetOptions(); } void CMSWindowsScreen::setOptions(const COptionsList& options) { m_desks->setOptions(options); } void CMSWindowsScreen::setSequenceNumber(UInt32 seqNum) { m_sequenceNumber = seqNum; } bool CMSWindowsScreen::isPrimary() const { return m_isPrimary; } void* CMSWindowsScreen::getEventTarget() const { return const_cast(this); } bool CMSWindowsScreen::getClipboard(ClipboardID, IClipboard* dst) const { CMSWindowsClipboard src(m_window); CClipboard::copy(dst, &src); return true; } void CMSWindowsScreen::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { assert(m_class != 0); x = m_x; y = m_y; w = m_w; h = m_h; } void CMSWindowsScreen::getCursorPos(SInt32& x, SInt32& y) const { m_desks->getCursorPos(x, y); } void CMSWindowsScreen::reconfigure(UInt32 activeSides) { assert(m_isPrimary); LOG((CLOG_DEBUG "active sides: %x", activeSides)); if (m_hookLibrary != NULL) m_hookLibraryLoader.m_setSides(activeSides); } void CMSWindowsScreen::warpCursor(SInt32 x, SInt32 y) { // warp mouse warpCursorNoFlush(x, y); // remove all input events before and including warp MSG msg; while (PeekMessage(&msg, NULL, SYNERGY_MSG_INPUT_FIRST, SYNERGY_MSG_INPUT_LAST, PM_REMOVE)) { // do nothing } // save position to compute delta of next motion saveMousePosition(x, y); } void CMSWindowsScreen::saveMousePosition(SInt32 x, SInt32 y) { m_xCursor = x; m_yCursor = y; LOG((CLOG_DEBUG5 "saved mouse position for next delta: %+d,%+d", x,y)); } UInt32 CMSWindowsScreen::registerHotKey(KeyID key, KeyModifierMask mask) { // only allow certain modifiers if ((mask & ~(KeyModifierShift | KeyModifierControl | KeyModifierAlt | KeyModifierSuper)) != 0) { // this should be a warning, but this can confuse users, // as this warning happens almost always. LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } // fail if no keys if (key == kKeyNone && mask == 0) { return 0; } // convert to win32 UINT modifiers = 0; if ((mask & KeyModifierShift) != 0) { modifiers |= MOD_SHIFT; } if ((mask & KeyModifierControl) != 0) { modifiers |= MOD_CONTROL; } if ((mask & KeyModifierAlt) != 0) { modifiers |= MOD_ALT; } if ((mask & KeyModifierSuper) != 0) { modifiers |= MOD_WIN; } UINT vk = m_keyState->mapKeyToVirtualKey(key); if (key != kKeyNone && vk == 0) { // can't map key // this should be a warning, but this can confuse users, // as this warning happens almost always. LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } // choose hotkey id UInt32 id; if (!m_oldHotKeyIDs.empty()) { id = m_oldHotKeyIDs.back(); m_oldHotKeyIDs.pop_back(); } else { //id = m_hotKeys.size() + 1; id = (UInt32)m_hotKeys.size() + 1; } // if this hot key has modifiers only then we'll handle it specially bool err; if (key == kKeyNone) { // check if already registered err = (m_hotKeyToIDMap.count(CHotKeyItem(vk, modifiers)) > 0); } else { // register with OS err = (RegisterHotKey(NULL, id, modifiers, vk) == 0); } if (!err) { m_hotKeys.insert(std::make_pair(id, CHotKeyItem(vk, modifiers))); m_hotKeyToIDMap[CHotKeyItem(vk, modifiers)] = id; } else { m_oldHotKeyIDs.push_back(id); m_hotKeys.erase(id); LOG((CLOG_WARN "failed to register hotkey %s (id=%04x mask=%04x)", CKeyMap::formatKey(key, mask).c_str(), key, mask)); return 0; } LOG((CLOG_DEBUG "registered hotkey %s (id=%04x mask=%04x) as id=%d", CKeyMap::formatKey(key, mask).c_str(), key, mask, id)); return id; } void CMSWindowsScreen::unregisterHotKey(UInt32 id) { // look up hotkey HotKeyMap::iterator i = m_hotKeys.find(id); if (i == m_hotKeys.end()) { return; } // unregister with OS bool err; if (i->second.getVirtualKey() != 0) { err = !UnregisterHotKey(NULL, id); } else { err = false; } if (err) { LOG((CLOG_WARN "failed to unregister hotkey id=%d", id)); } else { LOG((CLOG_DEBUG "unregistered hotkey id=%d", id)); } // discard hot key from map and record old id for reuse m_hotKeyToIDMap.erase(i->second); m_hotKeys.erase(i); m_oldHotKeyIDs.push_back(id); } void CMSWindowsScreen::fakeInputBegin() { assert(m_isPrimary); if (!m_isOnScreen) { m_keyState->useSavedModifiers(true); } m_desks->fakeInputBegin(); } void CMSWindowsScreen::fakeInputEnd() { assert(m_isPrimary); m_desks->fakeInputEnd(); if (!m_isOnScreen) { m_keyState->useSavedModifiers(false); } } SInt32 CMSWindowsScreen::getJumpZoneSize() const { return 1; } bool CMSWindowsScreen::isAnyMouseButtonDown() const { static const char* buttonToName[] = { "", "Left Button", "Middle Button", "Right Button", "X Button 1", "X Button 2" }; for (UInt32 i = 1; i < sizeof(m_buttons) / sizeof(m_buttons[0]); ++i) { if (m_buttons[i]) { LOG((CLOG_DEBUG "locked by \"%s\"", buttonToName[i])); return true; } } return false; } void CMSWindowsScreen::getCursorCenter(SInt32& x, SInt32& y) const { x = m_xCenter; y = m_yCenter; } void CMSWindowsScreen::gameDeviceTimingResp(UInt16 freq) { m_gameDevice->gameDeviceTimingResp(freq); } void CMSWindowsScreen::gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { m_gameDevice->gameDeviceFeedback(id, m1, m2); } void CMSWindowsScreen::fakeMouseButton(ButtonID id, bool press) { m_desks->fakeMouseButton(id, press); } void CMSWindowsScreen::fakeMouseMove(SInt32 x, SInt32 y) const { m_desks->fakeMouseMove(x, y); } void CMSWindowsScreen::fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const { m_desks->fakeMouseRelativeMove(dx, dy); } void CMSWindowsScreen::fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const { m_desks->fakeMouseWheel(xDelta, yDelta); } void CMSWindowsScreen::fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const { LOG((CLOG_DEBUG "fake game device buttons id=%d buttons=%d", id, buttons)); m_gameDevice->fakeGameDeviceButtons(id, buttons); } void CMSWindowsScreen::fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const { LOG((CLOG_DEBUG "fake game device sticks id=%d s1=%+d,%+d s2=%+d,%+d", id, x1, y1, x2, y2)); m_gameDevice->fakeGameDeviceSticks(id, x1, y1, x2, y2); } void CMSWindowsScreen::fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const { LOG((CLOG_DEBUG "fake game device triggers id=%d t1=%d t2=%d", id, t1, t2)); m_gameDevice->fakeGameDeviceTriggers(id, t1, t2); } void CMSWindowsScreen::queueGameDeviceTimingReq() const { LOG((CLOG_DEBUG "queue game device timing request")); m_gameDevice->queueGameDeviceTimingReq(); } void CMSWindowsScreen::updateKeys() { m_desks->updateKeys(); } void CMSWindowsScreen::fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button) { CPlatformScreen::fakeKeyDown(id, mask, button); updateForceShowCursor(); } bool CMSWindowsScreen::fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { bool result = CPlatformScreen::fakeKeyRepeat(id, mask, count, button); updateForceShowCursor(); return result; } bool CMSWindowsScreen::fakeKeyUp(KeyButton button) { bool result = CPlatformScreen::fakeKeyUp(button); updateForceShowCursor(); return result; } void CMSWindowsScreen::fakeAllKeysUp() { CPlatformScreen::fakeAllKeysUp(); updateForceShowCursor(); } HINSTANCE CMSWindowsScreen::openHookLibrary(const char* name) { return m_hookLibraryLoader.openHookLibrary(name); } void CMSWindowsScreen::closeHookLibrary(HINSTANCE hookLibrary) const { if (hookLibrary != NULL) { m_hookLibraryLoader.m_cleanup(); FreeLibrary(hookLibrary); } } HCURSOR CMSWindowsScreen::createBlankCursor() const { // create a transparent cursor int cw = GetSystemMetrics(SM_CXCURSOR); int ch = GetSystemMetrics(SM_CYCURSOR); UInt8* cursorAND = new UInt8[ch * ((cw + 31) >> 2)]; UInt8* cursorXOR = new UInt8[ch * ((cw + 31) >> 2)]; memset(cursorAND, 0xff, ch * ((cw + 31) >> 2)); memset(cursorXOR, 0x00, ch * ((cw + 31) >> 2)); HCURSOR c = CreateCursor(s_windowInstance, 0, 0, cw, ch, cursorAND, cursorXOR); delete[] cursorXOR; delete[] cursorAND; return c; } void CMSWindowsScreen::destroyCursor(HCURSOR cursor) const { if (cursor != NULL) { DestroyCursor(cursor); } } ATOM CMSWindowsScreen::createWindowClass() const { WNDCLASSEX classInfo; classInfo.cbSize = sizeof(classInfo); classInfo.style = CS_DBLCLKS | CS_NOCLOSE; classInfo.lpfnWndProc = &CMSWindowsScreen::wndProc; classInfo.cbClsExtra = 0; classInfo.cbWndExtra = 0; classInfo.hInstance = s_windowInstance; classInfo.hIcon = NULL; classInfo.hCursor = NULL; classInfo.hbrBackground = NULL; classInfo.lpszMenuName = NULL; classInfo.lpszClassName = "Synergy"; classInfo.hIconSm = NULL; return RegisterClassEx(&classInfo); } void CMSWindowsScreen::destroyClass(ATOM windowClass) const { if (windowClass != 0) { UnregisterClass(reinterpret_cast(windowClass), s_windowInstance); } } HWND CMSWindowsScreen::createWindow(ATOM windowClass, const char* name) const { HWND window = CreateWindowEx(WS_EX_TOPMOST | WS_EX_TRANSPARENT | WS_EX_TOOLWINDOW, reinterpret_cast(windowClass), name, WS_POPUP, 0, 0, 1, 1, NULL, NULL, s_windowInstance, NULL); if (window == NULL) { LOG((CLOG_ERR "failed to create window: %d", GetLastError())); throw XScreenOpenFailure(); } return window; } void CMSWindowsScreen::destroyWindow(HWND hwnd) const { if (hwnd != NULL) { DestroyWindow(hwnd); } } void CMSWindowsScreen::sendEvent(CEvent::Type type, void* data) { EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), data)); } void CMSWindowsScreen::sendClipboardEvent(CEvent::Type type, ClipboardID id) { CClipboardInfo* info = (CClipboardInfo*)malloc(sizeof(CClipboardInfo)); if(info == NULL) { LOG((CLOG_ERR "malloc failed on %s:%s", __FILE__, __LINE__ )); return; } info->m_id = id; info->m_sequenceNumber = m_sequenceNumber; sendEvent(type, info); } void CMSWindowsScreen::handleSystemEvent(const CEvent& event, void*) { MSG* msg = reinterpret_cast(event.getData()); assert(msg != NULL); if (CArchMiscWindows::processDialog(msg)) { return; } if (onPreDispatch(msg->hwnd, msg->message, msg->wParam, msg->lParam)) { return; } TranslateMessage(msg); DispatchMessage(msg); } void CMSWindowsScreen::updateButtons() { int numButtons = GetSystemMetrics(SM_CMOUSEBUTTONS); m_buttons[kButtonNone] = false; m_buttons[kButtonLeft] = (GetKeyState(VK_LBUTTON) < 0); m_buttons[kButtonRight] = (GetKeyState(VK_RBUTTON) < 0); m_buttons[kButtonMiddle] = (GetKeyState(VK_MBUTTON) < 0); m_buttons[kButtonExtra0 + 0] = (numButtons >= 4) && (GetKeyState(VK_XBUTTON1) < 0); m_buttons[kButtonExtra0 + 1] = (numButtons >= 5) && (GetKeyState(VK_XBUTTON2) < 0); } IKeyState* CMSWindowsScreen::getKeyState() const { return m_keyState; } bool CMSWindowsScreen::onPreDispatch(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam) { // handle event switch (message) { case SYNERGY_MSG_SCREEN_SAVER: return onScreensaver(wParam != 0); case SYNERGY_MSG_DEBUG: LOG((CLOG_DEBUG1 "hook: 0x%08x 0x%08x", wParam, lParam)); return true; } if (m_isPrimary) { return onPreDispatchPrimary(hwnd, message, wParam, lParam); } return false; } bool CMSWindowsScreen::onPreDispatchPrimary(HWND, UINT message, WPARAM wParam, LPARAM lParam) { LOG((CLOG_DEBUG5 "handling pre-dispatch primary")); // handle event switch (message) { case SYNERGY_MSG_MARK: return onMark(static_cast(wParam)); case SYNERGY_MSG_KEY: return onKey(wParam, lParam); case SYNERGY_MSG_MOUSE_BUTTON: return onMouseButton(wParam, lParam); case SYNERGY_MSG_MOUSE_MOVE: return onMouseMove(static_cast(wParam), static_cast(lParam)); case SYNERGY_MSG_MOUSE_WHEEL: // XXX -- support x-axis scrolling return onMouseWheel(0, static_cast(wParam)); case SYNERGY_MSG_PRE_WARP: { // save position to compute delta of next motion saveMousePosition(static_cast(wParam), static_cast(lParam)); // we warped the mouse. discard events until we find the // matching post warp event. see warpCursorNoFlush() for // where the events are sent. we discard the matching // post warp event and can be sure we've skipped the warp // event. MSG msg; do { GetMessage(&msg, NULL, SYNERGY_MSG_MOUSE_MOVE, SYNERGY_MSG_POST_WARP); } while (msg.message != SYNERGY_MSG_POST_WARP); } return true; case SYNERGY_MSG_POST_WARP: LOG((CLOG_WARN "unmatched post warp")); return true; case WM_HOTKEY: // we discard these messages. we'll catch the hot key in the // regular key event handling, where we can detect both key // press and release. we only register the hot key so no other // app will act on the key combination. break; } return false; } bool CMSWindowsScreen::onEvent(HWND, UINT msg, WPARAM wParam, LPARAM lParam, LRESULT* result) { switch (msg) { case WM_QUERYENDSESSION: if (m_is95Family) { *result = TRUE; return true; } break; case WM_ENDSESSION: if (m_is95Family) { if (wParam == TRUE && lParam == 0) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } return true; } break; case WM_DRAWCLIPBOARD: // first pass on the message if (m_nextClipboardWindow != NULL) { SendMessage(m_nextClipboardWindow, msg, wParam, lParam); } // now handle the message return onClipboardChange(); case WM_CHANGECBCHAIN: if (m_nextClipboardWindow == (HWND)wParam) { m_nextClipboardWindow = (HWND)lParam; LOG((CLOG_DEBUG "clipboard chain: new next: 0x%08x", m_nextClipboardWindow)); } else if (m_nextClipboardWindow != NULL) { SendMessage(m_nextClipboardWindow, msg, wParam, lParam); } return true; case WM_DISPLAYCHANGE: return onDisplayChange(); case WM_POWERBROADCAST: switch (wParam) { case PBT_APMRESUMEAUTOMATIC: case PBT_APMRESUMECRITICAL: case PBT_APMRESUMESUSPEND: EVENTQUEUE->addEvent(CEvent(IScreen::getResumeEvent(), getEventTarget(), NULL, CEvent::kDeliverImmediately)); break; case PBT_APMSUSPEND: EVENTQUEUE->addEvent(CEvent(IScreen::getSuspendEvent(), getEventTarget(), NULL, CEvent::kDeliverImmediately)); break; } *result = TRUE; return true; case WM_DEVICECHANGE: forceShowCursor(); break; case WM_SETTINGCHANGE: if (wParam == SPI_SETMOUSEKEYS) { forceShowCursor(); } break; } return false; } bool CMSWindowsScreen::onMark(UInt32 mark) { m_markReceived = mark; return true; } bool CMSWindowsScreen::onKey(WPARAM wParam, LPARAM lParam) { static const KeyModifierMask s_ctrlAlt = KeyModifierControl | KeyModifierAlt; LOG((CLOG_DEBUG1 "event: Key char=%d, vk=0x%02x, nagr=%d, lParam=0x%08x", (wParam & 0xff00u) >> 8, wParam & 0xffu, (wParam & 0x10000u) ? 1 : 0, lParam)); // get event info KeyButton button = (KeyButton)((lParam & 0x01ff0000) >> 16); bool down = ((lParam & 0x80000000u) == 0x00000000u); bool wasDown = isKeyDown(button); KeyModifierMask oldState = pollActiveModifiers(); // check for autorepeat if (m_keyState->testAutoRepeat(down, (lParam & 0x40000000u) == 1, button)) { lParam |= 0x40000000u; } // if the button is zero then guess what the button should be. // these are badly synthesized key events and logitech software // that maps mouse buttons to keys is known to do this. // alternatively, we could just throw these events out. if (button == 0) { button = m_keyState->virtualKeyToButton(wParam & 0xffu); if (button == 0) { return true; } wasDown = isKeyDown(button); } // record keyboard state m_keyState->onKey(button, down, oldState); // windows doesn't tell us the modifier key state on mouse or key // events so we have to figure it out. most apps would use // GetKeyState() or even GetAsyncKeyState() for that but we can't // because our hook doesn't pass on key events for several modifiers. // it can't otherwise the system would interpret them normally on // the primary screen even when on a secondary screen. so tapping // alt would activate menus and tapping the windows key would open // the start menu. if you don't pass those events on in the hook // then GetKeyState() understandably doesn't reflect the effect of // the event. curiously, neither does GetAsyncKeyState(), which is // surprising. // // so anyway, we have to track the modifier state ourselves for // at least those modifiers we don't pass on. pollActiveModifiers() // does that but we have to update the keyboard state before calling // pollActiveModifiers() to get the right answer. but the only way // to set the modifier state or to set the up/down state of a key // is via onKey(). so we have to call onKey() twice. KeyModifierMask state = pollActiveModifiers(); m_keyState->onKey(button, down, state); // check for hot keys if (oldState != state) { // modifier key was pressed/released if (onHotKey(0, lParam)) { return true; } } else { // non-modifier was pressed/released if (onHotKey(wParam, lParam)) { return true; } } // ignore message if posted prior to last mark change if (!ignore()) { // check for ctrl+alt+del. we do not want to pass that to the // client. the user can use ctrl+alt+pause to emulate it. UINT virtKey = (wParam & 0xffu); if (virtKey == VK_DELETE && (state & s_ctrlAlt) == s_ctrlAlt) { LOG((CLOG_DEBUG "discard ctrl+alt+del")); return true; } // check for ctrl+alt+del emulation if ((virtKey == VK_PAUSE || virtKey == VK_CANCEL) && (state & s_ctrlAlt) == s_ctrlAlt) { LOG((CLOG_DEBUG "emulate ctrl+alt+del")); // switch wParam and lParam to be as if VK_DELETE was // pressed or released. when mapping the key we require that // we not use AltGr (the 0x10000 flag in wParam) and we not // use the keypad delete key (the 0x01000000 flag in lParam). wParam = VK_DELETE | 0x00010000u; lParam &= 0xfe000000; lParam |= m_keyState->virtualKeyToButton(wParam & 0xffu) << 16; lParam |= 0x01000001; } // process key KeyModifierMask mask; KeyID key = m_keyState->mapKeyFromEvent(wParam, lParam, &mask); button = static_cast((lParam & 0x01ff0000u) >> 16); if (key != kKeyNone) { // fix key up. if the key isn't down according to // our table then we never got the key press event // for it. if it's not a modifier key then we'll // synthesize the press first. only do this on // the windows 95 family, which eats certain special // keys like alt+tab, ctrl+esc, etc. if (m_is95Family && !wasDown && !down) { switch (virtKey) { case VK_SHIFT: case VK_LSHIFT: case VK_RSHIFT: case VK_CONTROL: case VK_LCONTROL: case VK_RCONTROL: case VK_MENU: case VK_LMENU: case VK_RMENU: case VK_LWIN: case VK_RWIN: case VK_CAPITAL: case VK_NUMLOCK: case VK_SCROLL: break; default: m_keyState->sendKeyEvent(getEventTarget(), true, false, key, mask, 1, button); break; } } // do it m_keyState->sendKeyEvent(getEventTarget(), ((lParam & 0x80000000u) == 0), ((lParam & 0x40000000u) != 0), key, mask, (SInt32)(lParam & 0xffff), button); } else { LOG((CLOG_DEBUG1 "cannot map key")); } } return true; } bool CMSWindowsScreen::onHotKey(WPARAM wParam, LPARAM lParam) { // get the key info KeyModifierMask state = getActiveModifiers(); UINT virtKey = (wParam & 0xffu); UINT modifiers = 0; if ((state & KeyModifierShift) != 0) { modifiers |= MOD_SHIFT; } if ((state & KeyModifierControl) != 0) { modifiers |= MOD_CONTROL; } if ((state & KeyModifierAlt) != 0) { modifiers |= MOD_ALT; } if ((state & KeyModifierSuper) != 0) { modifiers |= MOD_WIN; } // find the hot key id HotKeyToIDMap::const_iterator i = m_hotKeyToIDMap.find(CHotKeyItem(virtKey, modifiers)); if (i == m_hotKeyToIDMap.end()) { return false; } // find what kind of event CEvent::Type type; if ((lParam & 0x80000000u) == 0u) { if ((lParam & 0x40000000u) != 0u) { // ignore key repeats but it counts as a hot key return true; } type = getHotKeyDownEvent(); } else { type = getHotKeyUpEvent(); } // generate event EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), CHotKeyInfo::alloc(i->second))); return true; } bool CMSWindowsScreen::onMouseButton(WPARAM wParam, LPARAM lParam) { // get which button bool pressed = mapPressFromEvent(wParam, lParam); ButtonID button = mapButtonFromEvent(wParam, lParam); // keep our shadow key state up to date if (button >= kButtonLeft && button <= kButtonExtra0 + 1) { if (pressed) { m_buttons[button] = true; } else { m_buttons[button] = false; } } // ignore message if posted prior to last mark change if (!ignore()) { KeyModifierMask mask = m_keyState->getActiveModifiers(); if (pressed) { LOG((CLOG_DEBUG1 "event: button press button=%d", button)); if (button != kButtonNone) { sendEvent(getButtonDownEvent(), CButtonInfo::alloc(button, mask)); } } else { LOG((CLOG_DEBUG1 "event: button release button=%d", button)); if (button != kButtonNone) { sendEvent(getButtonUpEvent(), CButtonInfo::alloc(button, mask)); } } } return true; } // here's how mouse movements are sent across the network to a client: // 1. synergy checks the mouse position on server screen // 2. records the delta (current x,y minus last x,y) // 3. records the current x,y as "last" (so we can calc delta next time) // 4. on the server, puts the cursor back to the center of the screen // - remember the cursor is hidden on the server at this point // - this actually records the current x,y as "last" a second time (it seems) // 5. sends the delta movement to the client (could be +1,+1 or -1,+4 for example) bool CMSWindowsScreen::onMouseMove(SInt32 mx, SInt32 my) { // compute motion delta (relative to the last known // mouse position) SInt32 x = mx - m_xCursor; SInt32 y = my - m_yCursor; LOG((CLOG_DEBUG3 "mouse move - motion delta: %+d=(%+d - %+d),%+d=(%+d - %+d)", x, mx, m_xCursor, y, my, m_yCursor)); // ignore if the mouse didn't move or if message posted prior // to last mark change. if (ignore() || (x == 0 && y == 0)) { return true; } // save position to compute delta of next motion saveMousePosition(mx, my); if (m_isOnScreen) { // motion on primary screen sendEvent( getMotionOnPrimaryEvent(), CMotionInfo::alloc(m_xCursor, m_yCursor)); } else { // the motion is on the secondary screen, so we warp mouse back to // center on the server screen. if we don't do this, then the mouse // will always try to return to the original entry point on the // secondary screen. LOG((CLOG_DEBUG5 "warping server cursor to center: %+d,%+d", m_xCenter, m_yCenter)); warpCursorNoFlush(m_xCenter, m_yCenter); // examine the motion. if it's about the distance // from the center of the screen to an edge then // it's probably a bogus motion that we want to // ignore (see warpCursorNoFlush() for a further // description). static SInt32 bogusZoneSize = 10; if (-x + bogusZoneSize > m_xCenter - m_x || x + bogusZoneSize > m_x + m_w - m_xCenter || -y + bogusZoneSize > m_yCenter - m_y || y + bogusZoneSize > m_y + m_h - m_yCenter) { LOG((CLOG_DEBUG "dropped bogus delta motion: %+d,%+d", x, y)); } else { // send motion sendEvent(getMotionOnSecondaryEvent(), CMotionInfo::alloc(x, y)); } } return true; } bool CMSWindowsScreen::onMouseWheel(SInt32 xDelta, SInt32 yDelta) { // ignore message if posted prior to last mark change if (!ignore()) { LOG((CLOG_DEBUG1 "event: button wheel delta=%+d,%+d", xDelta, yDelta)); sendEvent(getWheelEvent(), CWheelInfo::alloc(xDelta, yDelta)); } return true; } bool CMSWindowsScreen::onScreensaver(bool activated) { // ignore this message if there are any other screen saver // messages already in the queue. this is important because // our checkStarted() function has a deliberate delay, so it // can't respond to events at full CPU speed and will fall // behind if a lot of screen saver events are generated. // that can easily happen because windows will continually // send SC_SCREENSAVE until the screen saver starts, even if // the screen saver is disabled! MSG msg; if (PeekMessage(&msg, NULL, SYNERGY_MSG_SCREEN_SAVER, SYNERGY_MSG_SCREEN_SAVER, PM_NOREMOVE)) { return true; } if (activated) { if (!m_screensaverActive && m_screensaver->checkStarted(SYNERGY_MSG_SCREEN_SAVER, FALSE, 0)) { m_screensaverActive = true; sendEvent(getScreensaverActivatedEvent()); // enable display power down CArchMiscWindows::removeBusyState(CArchMiscWindows::kDISPLAY); } } else { if (m_screensaverActive) { m_screensaverActive = false; sendEvent(getScreensaverDeactivatedEvent()); // disable display power down CArchMiscWindows::addBusyState(CArchMiscWindows::kDISPLAY); } } return true; } bool CMSWindowsScreen::onDisplayChange() { // screen resolution may have changed. save old shape. SInt32 xOld = m_x, yOld = m_y, wOld = m_w, hOld = m_h; // update shape updateScreenShape(); // do nothing if resolution hasn't changed if (xOld != m_x || yOld != m_y || wOld != m_w || hOld != m_h) { if (m_isPrimary) { // warp mouse to center if off screen if (!m_isOnScreen) { LOG((CLOG_DEBUG1 "warping cursor to center: %+d, %+d", m_xCenter, m_yCenter)); warpCursor(m_xCenter, m_yCenter); } // tell hook about resize if on screen else { m_hookLibraryLoader.m_setZone(m_x, m_y, m_w, m_h, getJumpZoneSize()); } } // send new screen info sendEvent(getShapeChangedEvent()); LOG((CLOG_DEBUG "screen shape: %d,%d %dx%d %s", m_x, m_y, m_w, m_h, m_multimon ? "(multi-monitor)" : "")); } return true; } bool CMSWindowsScreen::onClipboardChange() { // now notify client that somebody changed the clipboard (unless // we're the owner). if (!CMSWindowsClipboard::isOwnedBySynergy()) { if (m_ownClipboard) { LOG((CLOG_DEBUG "clipboard changed: lost ownership")); m_ownClipboard = false; sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardClipboard); sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardSelection); } } else if (!m_ownClipboard) { LOG((CLOG_DEBUG "clipboard changed: synergy owned")); m_ownClipboard = true; } return true; } void CMSWindowsScreen::warpCursorNoFlush(SInt32 x, SInt32 y) { // send an event that we can recognize before the mouse warp PostThreadMessage(GetCurrentThreadId(), SYNERGY_MSG_PRE_WARP, x, y); // warp mouse. hopefully this inserts a mouse motion event // between the previous message and the following message. SetCursorPos(x, y); // check to see if the mouse pos was set correctly POINT cursorPos; GetCursorPos(&cursorPos); if ((cursorPos.x != x) && (cursorPos.y != y)) { LOG((CLOG_DEBUG "SetCursorPos did not work; using fakeMouseMove instead")); // when at Vista/7 login screen, SetCursorPos does not work (which could be // an MS security feature). instead we can use fakeMouseMove, which calls // mouse_event. // IMPORTANT: as of implementing this function, it has an annoying side // effect; instead of the mouse returning to the correct exit point, it // returns to the center of the screen. this could have something to do with // the center screen warping technique used (see comments for onMouseMove // definition). fakeMouseMove(x, y); } // yield the CPU. there's a race condition when warping: // a hardware mouse event occurs // the mouse hook is not called because that process doesn't have the CPU // we send PRE_WARP, SetCursorPos(), send POST_WARP // we process all of those events and update m_x, m_y // we finish our time slice // the hook is called // the hook sends us a mouse event from the pre-warp position // we get the CPU // we compute a bogus warp // we need the hook to process all mouse events that occur // before we warp before we do the warp but i'm not sure how // to guarantee that. yielding the CPU here may reduce the // chance of undesired behavior. we'll also check for very // large motions that look suspiciously like about half width // or height of the screen. ARCH->sleep(0.0); // send an event that we can recognize after the mouse warp PostThreadMessage(GetCurrentThreadId(), SYNERGY_MSG_POST_WARP, 0, 0); } void CMSWindowsScreen::nextMark() { // next mark ++m_mark; // mark point in message queue where the mark was changed PostThreadMessage(GetCurrentThreadId(), SYNERGY_MSG_MARK, m_mark, 0); } bool CMSWindowsScreen::ignore() const { return (m_mark != m_markReceived); } void CMSWindowsScreen::updateScreenShape() { // get shape m_x = GetSystemMetrics(SM_XVIRTUALSCREEN); m_y = GetSystemMetrics(SM_YVIRTUALSCREEN); m_w = GetSystemMetrics(SM_CXVIRTUALSCREEN); m_h = GetSystemMetrics(SM_CYVIRTUALSCREEN); // get center for cursor m_xCenter = GetSystemMetrics(SM_CXSCREEN) >> 1; m_yCenter = GetSystemMetrics(SM_CYSCREEN) >> 1; // check for multiple monitors m_multimon = (m_w != GetSystemMetrics(SM_CXSCREEN) || m_h != GetSystemMetrics(SM_CYSCREEN)); // tell the desks m_desks->setShape(m_x, m_y, m_w, m_h, m_xCenter, m_yCenter, m_multimon); } void CMSWindowsScreen::handleFixes(const CEvent&, void*) { // fix clipboard chain fixClipboardViewer(); // update keys if keyboard layouts have changed if (m_keyState->didGroupsChange()) { updateKeys(); } } void CMSWindowsScreen::fixClipboardViewer() { // XXX -- disable this code for now. somehow it can cause an infinite // recursion in the WM_DRAWCLIPBOARD handler. either we're sending // the message to our own window or some window farther down the chain // forwards the message to our window or a window farther up the chain. // i'm not sure how that could happen. the m_nextClipboardWindow = NULL // was not in the code that infinite loops and may fix the bug but i // doubt it. /* ChangeClipboardChain(m_window, m_nextClipboardWindow); m_nextClipboardWindow = NULL; m_nextClipboardWindow = SetClipboardViewer(m_window); */ } void CMSWindowsScreen::enableSpecialKeys(bool enable) const { // enable/disable ctrl+alt+del, alt+tab, etc on win95 family. // since the win95 family doesn't support low-level hooks, we // use this undocumented feature to suppress normal handling // of certain key combinations. if (m_is95Family) { DWORD dummy = 0; SystemParametersInfo(SPI_SETSCREENSAVERRUNNING, enable ? FALSE : TRUE, &dummy, 0); } } ButtonID CMSWindowsScreen::mapButtonFromEvent(WPARAM msg, LPARAM button) const { switch (msg) { case WM_LBUTTONDOWN: case WM_LBUTTONDBLCLK: case WM_LBUTTONUP: case WM_NCLBUTTONDOWN: case WM_NCLBUTTONDBLCLK: case WM_NCLBUTTONUP: return kButtonLeft; case WM_MBUTTONDOWN: case WM_MBUTTONDBLCLK: case WM_MBUTTONUP: case WM_NCMBUTTONDOWN: case WM_NCMBUTTONDBLCLK: case WM_NCMBUTTONUP: return kButtonMiddle; case WM_RBUTTONDOWN: case WM_RBUTTONDBLCLK: case WM_RBUTTONUP: case WM_NCRBUTTONDOWN: case WM_NCRBUTTONDBLCLK: case WM_NCRBUTTONUP: return kButtonRight; case WM_XBUTTONDOWN: case WM_XBUTTONDBLCLK: case WM_XBUTTONUP: case WM_NCXBUTTONDOWN: case WM_NCXBUTTONDBLCLK: case WM_NCXBUTTONUP: switch (button) { case XBUTTON1: if (GetSystemMetrics(SM_CMOUSEBUTTONS) >= 4) { return kButtonExtra0 + 0; } break; case XBUTTON2: if (GetSystemMetrics(SM_CMOUSEBUTTONS) >= 5) { return kButtonExtra0 + 1; } break; } return kButtonNone; default: return kButtonNone; } } bool CMSWindowsScreen::mapPressFromEvent(WPARAM msg, LPARAM) const { switch (msg) { case WM_LBUTTONDOWN: case WM_MBUTTONDOWN: case WM_RBUTTONDOWN: case WM_XBUTTONDOWN: case WM_LBUTTONDBLCLK: case WM_MBUTTONDBLCLK: case WM_RBUTTONDBLCLK: case WM_XBUTTONDBLCLK: case WM_NCLBUTTONDOWN: case WM_NCMBUTTONDOWN: case WM_NCRBUTTONDOWN: case WM_NCXBUTTONDOWN: case WM_NCLBUTTONDBLCLK: case WM_NCMBUTTONDBLCLK: case WM_NCRBUTTONDBLCLK: case WM_NCXBUTTONDBLCLK: return true; case WM_LBUTTONUP: case WM_MBUTTONUP: case WM_RBUTTONUP: case WM_XBUTTONUP: case WM_NCLBUTTONUP: case WM_NCMBUTTONUP: case WM_NCRBUTTONUP: case WM_NCXBUTTONUP: return false; default: return false; } } void CMSWindowsScreen::updateKeysCB(void*) { // record which keys we think are down bool down[IKeyState::kNumButtons]; bool sendFixes = (isPrimary() && !m_isOnScreen); if (sendFixes) { for (KeyButton i = 0; i < IKeyState::kNumButtons; ++i) { down[i] = m_keyState->isKeyDown(i); } } // update layouts if necessary if (m_keyState->didGroupsChange()) { CPlatformScreen::updateKeyMap(); } // now update the keyboard state CPlatformScreen::updateKeyState(); // now see which keys we thought were down but now think are up. // send key releases for these keys to the active client. if (sendFixes) { KeyModifierMask mask = pollActiveModifiers(); for (KeyButton i = 0; i < IKeyState::kNumButtons; ++i) { if (down[i] && !m_keyState->isKeyDown(i)) { m_keyState->sendKeyEvent(getEventTarget(), false, false, kKeyNone, mask, 1, i); } } } } void CMSWindowsScreen::forceShowCursor() { // check for mouse m_hasMouse = (GetSystemMetrics(SM_MOUSEPRESENT) != 0); // decide if we should show the mouse bool showMouse = (!m_hasMouse && !m_isPrimary && m_isOnScreen); // show/hide the mouse if (showMouse != m_showingMouse) { if (showMouse) { m_oldMouseKeys.cbSize = sizeof(m_oldMouseKeys); m_gotOldMouseKeys = (SystemParametersInfo(SPI_GETMOUSEKEYS, m_oldMouseKeys.cbSize, &m_oldMouseKeys, 0) != 0); if (m_gotOldMouseKeys) { m_mouseKeys = m_oldMouseKeys; m_showingMouse = true; updateForceShowCursor(); } } else { if (m_gotOldMouseKeys) { SystemParametersInfo(SPI_SETMOUSEKEYS, m_oldMouseKeys.cbSize, &m_oldMouseKeys, SPIF_SENDCHANGE); m_showingMouse = false; } } } } void CMSWindowsScreen::updateForceShowCursor() { DWORD oldFlags = m_mouseKeys.dwFlags; // turn on MouseKeys m_mouseKeys.dwFlags = MKF_AVAILABLE | MKF_MOUSEKEYSON; // make sure MouseKeys is active in whatever state the NumLock is // not currently in. if ((m_keyState->getActiveModifiers() & KeyModifierNumLock) != 0) { m_mouseKeys.dwFlags |= MKF_REPLACENUMBERS; } // update MouseKeys if (oldFlags != m_mouseKeys.dwFlags) { SystemParametersInfo(SPI_SETMOUSEKEYS, m_mouseKeys.cbSize, &m_mouseKeys, SPIF_SENDCHANGE); } } LRESULT CALLBACK CMSWindowsScreen::wndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { assert(s_screen != NULL); LRESULT result = 0; if (!s_screen->onEvent(hwnd, msg, wParam, lParam, &result)) { result = DefWindowProc(hwnd, msg, wParam, lParam); } return result; } // // CMSWindowsScreen::CHotKeyItem // CMSWindowsScreen::CHotKeyItem::CHotKeyItem(UINT keycode, UINT mask) : m_keycode(keycode), m_mask(mask) { // do nothing } UINT CMSWindowsScreen::CHotKeyItem::getVirtualKey() const { return m_keycode; } bool CMSWindowsScreen::CHotKeyItem::operator<(const CHotKeyItem& x) const { return (m_keycode < x.m_keycode || (m_keycode == x.m_keycode && m_mask < x.m_mask)); } synergy-1.4.12-Source/src/lib/platform/CMSWindowsScreen.h0000600000175000017500000002400712021261364023176 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSSCREEN_H #define CMSWINDOWSSCREEN_H #include "CPlatformScreen.h" #include "CSynergyHook.h" #include "CCondVar.h" #include "CMutex.h" #include "CString.h" #include "CMSWindowsHookLibraryLoader.h" #include "CGameDevice.h" #include "CMSWindowsXInput.h" #include "CEventGameDevice.h" #define WIN32_LEAN_AND_MEAN #include class CEventQueueTimer; class CMSWindowsDesks; class CMSWindowsKeyState; class CMSWindowsScreenSaver; class CThread; //! Implementation of IPlatformScreen for Microsoft Windows class CMSWindowsScreen : public CPlatformScreen { public: CMSWindowsScreen( bool isPrimary, bool noHooks, const CGameDeviceInfo &gameDevice, bool stopOnDeskSwitch); virtual ~CMSWindowsScreen(); //! @name manipulators //@{ //! Initialize /*! Saves the application's HINSTANCE. This \b must be called by WinMain with the HINSTANCE it was passed. */ static void init(HINSTANCE); //@} //! @name accessors //@{ //! Get instance /*! Returns the application instance handle passed to init(). */ static HINSTANCE getWindowInstance(); //@} // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IPrimaryScreen overrides virtual void reconfigure(UInt32 activeSides); virtual void warpCursor(SInt32 x, SInt32 y); virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask); virtual void unregisterHotKey(UInt32 id); virtual void fakeInputBegin(); virtual void fakeInputEnd(); virtual SInt32 getJumpZoneSize() const; virtual bool isAnyMouseButtonDown() const; virtual void getCursorCenter(SInt32& x, SInt32& y) const; virtual void gameDeviceTimingResp(UInt16 freq); virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); // ISecondaryScreen overrides virtual void fakeMouseButton(ButtonID id, bool press); virtual void fakeMouseMove(SInt32 x, SInt32 y) const; virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const; virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const; virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const; virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const; virtual void queueGameDeviceTimingReq() const; // IKeyState overrides virtual void updateKeys(); virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button); virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button); virtual bool fakeKeyUp(KeyButton button); virtual void fakeAllKeysUp(); // IPlatformScreen overrides virtual void enable(); virtual void disable(); virtual void enter(); virtual bool leave(); virtual bool setClipboard(ClipboardID, const IClipboard*); virtual void checkClipboards(); virtual void openScreensaver(bool notify); virtual void closeScreensaver(); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); virtual void setSequenceNumber(UInt32); virtual bool isPrimary() const; protected: // IPlatformScreen overrides virtual void handleSystemEvent(const CEvent&, void*); virtual void updateButtons(); virtual IKeyState* getKeyState() const; private: // initialization and shutdown operations HINSTANCE openHookLibrary(const char* name); void closeHookLibrary(HINSTANCE hookLibrary) const; HCURSOR createBlankCursor() const; void destroyCursor(HCURSOR cursor) const; ATOM createWindowClass() const; ATOM createDeskWindowClass(bool isPrimary) const; void destroyClass(ATOM windowClass) const; HWND createWindow(ATOM windowClass, const char* name) const; void destroyWindow(HWND) const; // convenience function to send events public: // HACK void sendEvent(CEvent::Type type, void* = NULL); private: // HACK void sendClipboardEvent(CEvent::Type type, ClipboardID id); // handle message before it gets dispatched. returns true iff // the message should not be dispatched. bool onPreDispatch(HWND, UINT, WPARAM, LPARAM); // handle message before it gets dispatched. returns true iff // the message should not be dispatched. bool onPreDispatchPrimary(HWND, UINT, WPARAM, LPARAM); // handle message. returns true iff handled and optionally sets // \c *result (which defaults to 0). bool onEvent(HWND, UINT, WPARAM, LPARAM, LRESULT* result); // message handlers bool onMark(UInt32 mark); bool onKey(WPARAM, LPARAM); bool onHotKey(WPARAM, LPARAM); bool onMouseButton(WPARAM, LPARAM); bool onMouseMove(SInt32 x, SInt32 y); bool onMouseWheel(SInt32 xDelta, SInt32 yDelta); bool onScreensaver(bool activated); bool onDisplayChange(); bool onClipboardChange(); // warp cursor without discarding queued events void warpCursorNoFlush(SInt32 x, SInt32 y); // discard posted messages void nextMark(); // test if event should be ignored bool ignore() const; // update screen size cache void updateScreenShape(); // fix timer callback void handleFixes(const CEvent&, void*); // fix the clipboard viewer chain void fixClipboardViewer(); // enable/disable special key combinations so we can catch/pass them void enableSpecialKeys(bool) const; // map a button event to a button ID ButtonID mapButtonFromEvent(WPARAM msg, LPARAM button) const; // map a button event to a press (true) or release (false) bool mapPressFromEvent(WPARAM msg, LPARAM button) const; // job to update the key state void updateKeysCB(void*); // determine whether the mouse is hidden by the system and force // it to be displayed if user has entered this secondary screen. void forceShowCursor(); // forceShowCursor uses MouseKeys to show the cursor. since we // don't actually want MouseKeys behavior we have to make sure // it applies when NumLock is in whatever state it's not in now. // this method does that. void updateForceShowCursor(); // our window proc static LRESULT CALLBACK wndProc(HWND, UINT, WPARAM, LPARAM); private: struct CHotKeyItem { public: CHotKeyItem(UINT vk, UINT modifiers); UINT getVirtualKey() const; bool operator<(const CHotKeyItem&) const; private: UINT m_keycode; UINT m_mask; }; typedef std::map HotKeyMap; typedef std::vector HotKeyIDList; typedef std::map HotKeyToIDMap; static HINSTANCE s_windowInstance; // true if screen is being used as a primary screen, false otherwise bool m_isPrimary; // true if hooks are not to be installed (useful for debugging) bool m_noHooks; // true if windows 95/98/me bool m_is95Family; // true if mouse has entered the screen bool m_isOnScreen; // our resources ATOM m_class; // screen shape stuff SInt32 m_x, m_y; SInt32 m_w, m_h; SInt32 m_xCenter, m_yCenter; // true if system appears to have multiple monitors bool m_multimon; // last mouse position SInt32 m_xCursor, m_yCursor; // last clipboard UInt32 m_sequenceNumber; // used to discard queued messages that are no longer needed UInt32 m_mark; UInt32 m_markReceived; // the main loop's thread id DWORD m_threadID; // timer for periodically checking stuff that requires polling CEventQueueTimer* m_fixTimer; // the keyboard layout to use when off primary screen HKL m_keyLayout; // screen saver stuff CMSWindowsScreenSaver* m_screensaver; bool m_screensaverNotify; bool m_screensaverActive; // clipboard stuff. our window is used mainly as a clipboard // owner and as a link in the clipboard viewer chain. HWND m_window; HWND m_nextClipboardWindow; bool m_ownClipboard; // one desk per desktop and a cond var to communicate with it CMSWindowsDesks* m_desks; // hook library stuff HINSTANCE m_hookLibrary; // keyboard stuff CMSWindowsKeyState* m_keyState; // hot key stuff HotKeyMap m_hotKeys; HotKeyIDList m_oldHotKeyIDs; HotKeyToIDMap m_hotKeyToIDMap; // map of button state bool m_buttons[1 + kButtonExtra0 + 1]; // the system shows the mouse cursor when an internal display count // is >= 0. this count is maintained per application but there's // apparently a system wide count added to the application's count. // this system count is 0 if there's a mouse attached to the system // and -1 otherwise. the MouseKeys accessibility feature can modify // this system count by making the system appear to have a mouse. // // m_hasMouse is true iff there's a mouse attached to the system or // MouseKeys is simulating one. we track this so we can force the // cursor to be displayed when the user has entered this screen. // m_showingMouse is true when we're doing that. bool m_hasMouse; bool m_showingMouse; bool m_gotOldMouseKeys; MOUSEKEYS m_mouseKeys; MOUSEKEYS m_oldMouseKeys; // loads synrgyhk.dll CMSWindowsHookLibraryLoader m_hookLibraryLoader; const CGameDeviceInfo& m_gameDeviceInfo; CGameDevice* m_gameDevice; static CMSWindowsScreen* s_screen; // save last position of mouse to compute next delta movement void saveMousePosition(SInt32 x, SInt32 y); }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsScreenSaver.cpp0000600000175000017500000003157312021261364024540 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsScreenSaver.h" #include "CMSWindowsScreen.h" #include "CThread.h" #include "CLog.h" #include "TMethodJob.h" #include "CArch.h" #include "CArchMiscWindows.h" #include #include #if !defined(SPI_GETSCREENSAVERRUNNING) #define SPI_GETSCREENSAVERRUNNING 114 #endif static const TCHAR* g_isSecureNT = "ScreenSaverIsSecure"; static const TCHAR* g_isSecure9x = "ScreenSaveUsePassword"; static const TCHAR* const g_pathScreenSaverIsSecure[] = { "Control Panel", "Desktop", NULL }; // // CMSWindowsScreenSaver // CMSWindowsScreenSaver::CMSWindowsScreenSaver() : m_wasSecure(false), m_wasSecureAnInt(false), m_process(NULL), m_watch(NULL), m_threadID(0), m_active(false) { // detect OS m_is95Family = false; m_is95 = false; m_isNT = false; OSVERSIONINFO info; info.dwOSVersionInfoSize = sizeof(info); if (GetVersionEx(&info)) { m_is95Family = (info.dwPlatformId == VER_PLATFORM_WIN32_WINDOWS); if (info.dwPlatformId == VER_PLATFORM_WIN32_NT && info.dwMajorVersion <= 4) { m_isNT = true; } else if (info.dwPlatformId == VER_PLATFORM_WIN32_WINDOWS && info.dwMajorVersion == 4 && info.dwMinorVersion == 0) { m_is95 = true; } } // check if screen saver is enabled SystemParametersInfo(SPI_GETSCREENSAVEACTIVE, 0, &m_wasEnabled, 0); } CMSWindowsScreenSaver::~CMSWindowsScreenSaver() { unwatchProcess(); } bool CMSWindowsScreenSaver::checkStarted(UINT msg, WPARAM wParam, LPARAM lParam) { // if already started then say it didn't just start if (m_active) { return false; } // screen saver may have started. look for it and get // the process. if we can't find it then assume it // didn't really start. we wait a moment before // looking to give the screen saver a chance to start. // this shouldn't be a problem since we only get here // if the screen saver wants to kick in, meaning that // the system is idle or the user deliberately started // the screen saver. Sleep(250); // set parameters common to all screen saver handling m_threadID = GetCurrentThreadId(); m_msg = msg; m_wParam = wParam; m_lParam = lParam; // we handle the screen saver differently for the windows // 95 and nt families. if (m_is95Family) { // on windows 95 we wait for the screen saver process // to terminate. get the process. DWORD processID = findScreenSaver(); HANDLE process = OpenProcess(SYNCHRONIZE, FALSE, processID); if (process == NULL) { // didn't start LOG((CLOG_DEBUG2 "can't open screen saver process")); return false; } // watch for the process to exit watchProcess(process); } else { // on the windows nt family we wait for the desktop to // change until it's neither the Screen-Saver desktop // nor a desktop we can't open (the login desktop). // since windows will send the request-to-start-screen- // saver message even when the screen saver is disabled // we first check that the screen saver is indeed active // before watching for it to stop. if (!isActive()) { LOG((CLOG_DEBUG2 "can't open screen saver desktop")); return false; } watchDesktop(); } return true; } void CMSWindowsScreenSaver::enable() { SystemParametersInfo(SPI_SETSCREENSAVEACTIVE, m_wasEnabled, 0, 0); // restore password protection if (m_wasSecure) { setSecure(true, m_wasSecureAnInt); } // restore display power down CArchMiscWindows::removeBusyState(CArchMiscWindows::kDISPLAY); } void CMSWindowsScreenSaver::disable() { SystemParametersInfo(SPI_GETSCREENSAVEACTIVE, 0, &m_wasEnabled, 0); SystemParametersInfo(SPI_SETSCREENSAVEACTIVE, FALSE, 0, 0); // disable password protected screensaver m_wasSecure = isSecure(&m_wasSecureAnInt); if (m_wasSecure) { setSecure(false, m_wasSecureAnInt); } // disable display power down CArchMiscWindows::addBusyState(CArchMiscWindows::kDISPLAY); } void CMSWindowsScreenSaver::activate() { // don't activate if already active if (!isActive()) { // activate HWND hwnd = GetForegroundWindow(); if (hwnd != NULL) { PostMessage(hwnd, WM_SYSCOMMAND, SC_SCREENSAVE, 0); } else { // no foreground window. pretend we got the event instead. DefWindowProc(NULL, WM_SYSCOMMAND, SC_SCREENSAVE, 0); } // restore power save when screen saver activates CArchMiscWindows::removeBusyState(CArchMiscWindows::kDISPLAY); } } void CMSWindowsScreenSaver::deactivate() { bool killed = false; if (!m_is95Family) { // NT runs screen saver in another desktop HDESK desktop = OpenDesktop("Screen-saver", 0, FALSE, DESKTOP_READOBJECTS | DESKTOP_WRITEOBJECTS); if (desktop != NULL) { EnumDesktopWindows(desktop, &CMSWindowsScreenSaver::killScreenSaverFunc, reinterpret_cast(&killed)); CloseDesktop(desktop); } } // if above failed or wasn't tried, try the windows 95 way if (!killed) { // find screen saver window and close it HWND hwnd = FindWindow("WindowsScreenSaverClass", NULL); if (hwnd == NULL) { // win2k may use a different class hwnd = FindWindow("Default Screen Saver", NULL); } if (hwnd != NULL) { PostMessage(hwnd, WM_CLOSE, 0, 0); } } // force timer to restart SystemParametersInfo(SPI_GETSCREENSAVEACTIVE, 0, &m_wasEnabled, 0); SystemParametersInfo(SPI_SETSCREENSAVEACTIVE, !m_wasEnabled, 0, SPIF_SENDWININICHANGE); SystemParametersInfo(SPI_SETSCREENSAVEACTIVE, m_wasEnabled, 0, SPIF_SENDWININICHANGE); // disable display power down CArchMiscWindows::removeBusyState(CArchMiscWindows::kDISPLAY); } bool CMSWindowsScreenSaver::isActive() const { if (m_is95) { return (FindWindow("WindowsScreenSaverClass", NULL) != NULL); } else if (m_isNT) { // screen saver runs on a separate desktop HDESK desktop = OpenDesktop("Screen-saver", 0, FALSE, MAXIMUM_ALLOWED); if (desktop == NULL && GetLastError() != ERROR_ACCESS_DENIED) { // desktop doesn't exist so screen saver is not running return false; } // desktop exists. this should indicate that the screen saver // is running but an OS bug can cause a valid handle to be // returned even if the screen saver isn't running (Q230117). // we'll try to enumerate the windows on the desktop and, if // there are any, we assume the screen saver is running. (note // that if we don't have permission to enumerate then we'll // assume that the screen saver is not running.) that'd be // easy enough except there's another OS bug (Q198590) that can // cause EnumDesktopWindows() to enumerate the windows of // another desktop if the requested desktop has no windows. to // work around that we have to verify that the enumerated // windows are, in fact, on the expected desktop. CFindScreenSaverInfo info; info.m_desktop = desktop; info.m_window = NULL; EnumDesktopWindows(desktop, &CMSWindowsScreenSaver::findScreenSaverFunc, reinterpret_cast(&info)); // done with desktop CloseDesktop(desktop); // screen saver is running if a window was found return (info.m_window != NULL); } else { BOOL running; SystemParametersInfo(SPI_GETSCREENSAVERRUNNING, 0, &running, 0); return (running != FALSE); } } BOOL CALLBACK CMSWindowsScreenSaver::findScreenSaverFunc(HWND hwnd, LPARAM arg) { CFindScreenSaverInfo* info = reinterpret_cast(arg); if (info->m_desktop != NULL) { DWORD threadID = GetWindowThreadProcessId(hwnd, NULL); HDESK desktop = GetThreadDesktop(threadID); if (desktop != NULL && desktop != info->m_desktop) { // stop enumerating -- wrong desktop return FALSE; } } // found a window info->m_window = hwnd; // don't need to enumerate further return FALSE; } BOOL CALLBACK CMSWindowsScreenSaver::killScreenSaverFunc(HWND hwnd, LPARAM arg) { if (IsWindowVisible(hwnd)) { HINSTANCE instance = (HINSTANCE)GetWindowLongPtr(hwnd, GWLP_HINSTANCE); if (instance != CMSWindowsScreen::getWindowInstance()) { PostMessage(hwnd, WM_CLOSE, 0, 0); *reinterpret_cast(arg) = true; } } return TRUE; } DWORD CMSWindowsScreenSaver::findScreenSaver() { // try windows 95 way HWND hwnd = FindWindow("WindowsScreenSaverClass", NULL); // get process ID of process that owns the window, if found if (hwnd != NULL) { DWORD processID; GetWindowThreadProcessId(hwnd, &processID); return processID; } // not found return 0; } void CMSWindowsScreenSaver::watchDesktop() { // stop watching previous process/desktop unwatchProcess(); // watch desktop in another thread LOG((CLOG_DEBUG "watching screen saver desktop")); m_active = true; m_watch = new CThread(new TMethodJob(this, &CMSWindowsScreenSaver::watchDesktopThread)); } void CMSWindowsScreenSaver::watchProcess(HANDLE process) { // stop watching previous process/desktop unwatchProcess(); // watch new process in another thread if (process != NULL) { LOG((CLOG_DEBUG "watching screen saver process")); m_process = process; m_active = true; m_watch = new CThread(new TMethodJob(this, &CMSWindowsScreenSaver::watchProcessThread)); } } void CMSWindowsScreenSaver::unwatchProcess() { if (m_watch != NULL) { LOG((CLOG_DEBUG "stopped watching screen saver process/desktop")); m_watch->cancel(); m_watch->wait(); delete m_watch; m_watch = NULL; m_active = false; } if (m_process != NULL) { CloseHandle(m_process); m_process = NULL; } } void CMSWindowsScreenSaver::watchDesktopThread(void*) { DWORD reserved = 0; TCHAR* name = NULL; for (;;) { // wait a bit ARCH->sleep(0.2); if (m_isNT) { // get current desktop HDESK desk = OpenInputDesktop(0, FALSE, GENERIC_READ); if (desk == NULL) { // can't open desktop so keep waiting continue; } // get current desktop name length DWORD size; GetUserObjectInformation(desk, UOI_NAME, NULL, 0, &size); // allocate more space for the name, if necessary if (size > reserved) { reserved = size; name = (TCHAR*)alloca(reserved + sizeof(TCHAR)); } // get current desktop name GetUserObjectInformation(desk, UOI_NAME, name, size, &size); CloseDesktop(desk); // compare name to screen saver desktop name if (_tcsicmp(name, TEXT("Screen-saver")) == 0) { // still the screen saver desktop so keep waiting continue; } } else { // 2000/XP have a sane way to detect a runnin screensaver. BOOL running; SystemParametersInfo(SPI_GETSCREENSAVERRUNNING, 0, &running, 0); if (running) { continue; } } // send screen saver deactivation message m_active = false; PostThreadMessage(m_threadID, m_msg, m_wParam, m_lParam); return; } } void CMSWindowsScreenSaver::watchProcessThread(void*) { for (;;) { CThread::testCancel(); if (WaitForSingleObject(m_process, 50) == WAIT_OBJECT_0) { // process terminated LOG((CLOG_DEBUG "screen saver died")); // send screen saver deactivation message m_active = false; PostThreadMessage(m_threadID, m_msg, m_wParam, m_lParam); return; } } } void CMSWindowsScreenSaver::setSecure(bool secure, bool saveSecureAsInt) { HKEY hkey = CArchMiscWindows::addKey(HKEY_CURRENT_USER, g_pathScreenSaverIsSecure); if (hkey == NULL) { return; } const TCHAR* isSecure = m_is95Family ? g_isSecure9x : g_isSecureNT; if (saveSecureAsInt) { CArchMiscWindows::setValue(hkey, isSecure, secure ? 1 : 0); } else { CArchMiscWindows::setValue(hkey, isSecure, secure ? "1" : "0"); } CArchMiscWindows::closeKey(hkey); } bool CMSWindowsScreenSaver::isSecure(bool* wasSecureFlagAnInt) const { // get the password protection setting key HKEY hkey = CArchMiscWindows::openKey(HKEY_CURRENT_USER, g_pathScreenSaverIsSecure); if (hkey == NULL) { return false; } // get the value. the value may be an int or a string, depending // on the version of windows. bool result; const TCHAR* isSecure = m_is95Family ? g_isSecure9x : g_isSecureNT; switch (CArchMiscWindows::typeOfValue(hkey, isSecure)) { default: result = false; break; case CArchMiscWindows::kUINT: { DWORD value = CArchMiscWindows::readValueInt(hkey, isSecure); *wasSecureFlagAnInt = true; result = (value != 0); break; } case CArchMiscWindows::kSTRING: { std::string value = CArchMiscWindows::readValueString(hkey, isSecure); *wasSecureFlagAnInt = false; result = (value != "0"); break; } } CArchMiscWindows::closeKey(hkey); return result; } synergy-1.4.12-Source/src/lib/platform/CMSWindowsScreenSaver.h0000600000175000017500000000474012021261364024201 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSSCREENSAVER_H #define CMSWINDOWSSCREENSAVER_H #include "IScreenSaver.h" #include "CString.h" #define WIN32_LEAN_AND_MEAN #include class CThread; //! Microsoft windows screen saver implementation class CMSWindowsScreenSaver : public IScreenSaver { public: CMSWindowsScreenSaver(); virtual ~CMSWindowsScreenSaver(); //! @name manipulators //@{ //! Check if screen saver started /*! Check if the screen saver really started. Returns false if it hasn't, true otherwise. When the screen saver stops, \c msg will be posted to the current thread's message queue with the given parameters. */ bool checkStarted(UINT msg, WPARAM, LPARAM); //@} // IScreenSaver overrides virtual void enable(); virtual void disable(); virtual void activate(); virtual void deactivate(); virtual bool isActive() const; private: class CFindScreenSaverInfo { public: HDESK m_desktop; HWND m_window; }; static BOOL CALLBACK findScreenSaverFunc(HWND hwnd, LPARAM lParam); static BOOL CALLBACK killScreenSaverFunc(HWND hwnd, LPARAM lParam); DWORD findScreenSaver(); void watchDesktop(); void watchProcess(HANDLE process); void unwatchProcess(); void watchDesktopThread(void*); void watchProcessThread(void*); void setSecure(bool secure, bool saveSecureAsInt); bool isSecure(bool* wasSecureAnInt) const; private: bool m_is95Family; bool m_is95; bool m_isNT; BOOL m_wasEnabled; bool m_wasSecure; bool m_wasSecureAnInt; HANDLE m_process; CThread* m_watch; DWORD m_threadID; UINT m_msg; WPARAM m_wParam; LPARAM m_lParam; // checkActive state. true if the screen saver is being watched // for deactivation (and is therefore active). bool m_active; }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsUtil.cpp0000600000175000017500000000374512021261364023235 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsUtil.h" #include "CStringUtil.h" #include // // CMSWindowsUtil // CString CMSWindowsUtil::getString(HINSTANCE instance, DWORD id) { char buffer[1024]; int size = static_cast(sizeof(buffer) / sizeof(buffer[0])); char* msg = buffer; // load string int n = LoadString(instance, id, msg, size); msg[n] = '\0'; if (n < size) { return msg; } // not enough buffer space. keep trying larger buffers until // we get the whole string. msg = NULL; do { size <<= 1; delete[] msg; char* msg = new char[size]; n = LoadString(instance, id, msg, size); } while (n == size); msg[n] = '\0'; CString result(msg); delete[] msg; return result; } CString CMSWindowsUtil::getErrorString(HINSTANCE hinstance, DWORD error, DWORD id) { char* buffer; if (FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, 0, error, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPTSTR)&buffer, 0, NULL) == 0) { CString errorString = CStringUtil::print("%d", error); return CStringUtil::format(getString(hinstance, id).c_str(), errorString.c_str()); } else { CString result(buffer); LocalFree(buffer); return result; } } synergy-1.4.12-Source/src/lib/platform/CMSWindowsUtil.h0000600000175000017500000000240712021261364022674 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMSWINDOWSUTIL_H #define CMSWINDOWSUTIL_H #include "CString.h" #define WINDOWS_LEAN_AND_MEAN #include class CMSWindowsUtil { public: //! Get message string /*! Gets a string for \p id from the string table of \p instance. */ static CString getString(HINSTANCE instance, DWORD id); //! Get error string /*! Gets a system error message for \p error. If the error cannot be found return the string for \p id, replacing ${1} with \p error. */ static CString getErrorString(HINSTANCE, DWORD error, DWORD id); }; #endif synergy-1.4.12-Source/src/lib/platform/CMSWindowsXInput.cpp0000600000175000017500000002437712021261364023553 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 notsee . */ #include "CMSWindowsXInput.h" #include "XScreen.h" #include "CThread.h" #include "TMethodJob.h" #include "CLog.h" #include "XInputHook.h" #include "CMSWindowsScreen.h" #include "XInput.h" typedef DWORD (WINAPI *XInputGetStateFunc)(DWORD, XINPUT_STATE*); typedef DWORD (WINAPI *XInputSetStateFunc)(DWORD, XINPUT_VIBRATION*); CMSWindowsXInput::CMSWindowsXInput(CMSWindowsScreen* screen, const CGameDeviceInfo& gameDeviceInfo) : m_screen(screen), m_gameDeviceInfo(gameDeviceInfo), m_xInputPollThread(NULL), m_xInputTimingThread(NULL), m_xInputFeedbackThread(NULL), m_gameButtonsLast(0), m_gameLeftTriggerLast(0), m_gameRightTriggerLast(0), m_gameLeftStickXLast(0), m_gameLeftStickYLast(0), m_gameRightStickXLast(0), m_gameRightStickYLast(0), m_gameLastTimingSent(0), m_gameTimingWaiting(false), m_gameFakeLag(0), m_gamePollFreq(kGamePollFreqDefault), m_gamePollFreqAdjust(0), m_gameFakeLagMin(kGamePollFreqDefault), m_gameTimingStarted(false), m_gameTimingFirst(0), m_gameFakeLagLast(0), m_gameTimingCalibrated(false), m_xinputModule(NULL) { m_xinputModule = LoadLibrary("xinput1_3.dll"); if (m_xinputModule == NULL) { throw XScreenXInputFailure("could not load xinput library"); } if (screen->isPrimary()) { // only capture xinput on the server. m_xInputPollThread = new CThread(new TMethodJob( this, &CMSWindowsXInput::xInputPollThread)); } else { // check for queued timing requests on client. m_xInputTimingThread = new CThread(new TMethodJob( this, &CMSWindowsXInput::xInputTimingThread)); // check for waiting feedback state on client. m_xInputFeedbackThread = new CThread(new TMethodJob( this, &CMSWindowsXInput::xInputFeedbackThread)); } } CMSWindowsXInput::~CMSWindowsXInput() { } void CMSWindowsXInput::fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const { SetXInputButtons(id, buttons); } void CMSWindowsXInput::fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const { SetXInputSticks(id, x1, y1, x2, y2); } void CMSWindowsXInput::fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const { SetXInputTriggers(id, t1, t2); } void CMSWindowsXInput::queueGameDeviceTimingReq() const { QueueXInputTimingReq(); } void CMSWindowsXInput::gameDeviceTimingResp(UInt16 freq) { if (!m_gameTimingStarted) { // record when timing started for calibration period. m_gameTimingFirst = (UInt16)(ARCH->time() * 1000); m_gameTimingStarted = true; } m_gameTimingWaiting = false; m_gameFakeLagLast = m_gameFakeLag; m_gameFakeLag = (UInt16)((ARCH->time() - m_gameLastTimingSent) * 1000); m_gameFakeLagRecord.push_back(m_gameFakeLag); if (m_gameFakeLag < m_gameFakeLagMin) { // record the lowest value so that the poll frequency // is adjusted to track. m_gameFakeLagMin = m_gameFakeLag; } else if (m_gameFakeLag > (m_gameFakeLagLast * 2)) { // if fake lag has increased significantly since the last // timing, then we must have reached the safe minimum. m_gameFakeLagMin = m_gameFakeLagLast; } // only change poll frequency if it's a sensible value. if (freq > kGamePollFreqMin && freq < kGamePollFreqMax) { m_gamePollFreq = freq; } UInt16 timeSinceStart = ((UInt16)(ARCH->time() * 1000) - m_gameTimingFirst); if (!m_gameTimingCalibrated && (timeSinceStart < kGameCalibrationPeriod)) { // during the calibration period, increase polling speed // to try and find the lowest lag value. m_gamePollFreqAdjust = 1; LOG((CLOG_DEBUG2 "calibrating game device poll frequency, start=%d, now=%d, since=%d", m_gameTimingFirst, (int)(ARCH->time() * 1000), timeSinceStart)); } else { // @bug - calibration seems to re-occur after a period of time, // though, this would actually be a nice feature (but could be // a bit risky -- could cause poor game play)... setting this // stops calibration from happening again. m_gameTimingCalibrated = true; // only adjust poll frequency if outside desired limits. m_gamePollFreqAdjust = 0; if (m_gameFakeLag > m_gameFakeLagMin * 3) { m_gamePollFreqAdjust = 1; } else if (m_gameFakeLag < m_gameFakeLagMin) { m_gamePollFreqAdjust = -1; } } LOG((CLOG_DEBUG3 "game device timing, lag=%dms, freq=%dms, adjust=%dms, min=%dms", m_gameFakeLag, m_gamePollFreq, m_gamePollFreqAdjust, m_gameFakeLagMin)); if (m_gameFakeLagRecord.size() >= kGameLagRecordMax) { UInt16 v, min = 65535, max = 0, total = 0; std::vector::iterator it; for (it = m_gameFakeLagRecord.begin(); it < m_gameFakeLagRecord.end(); ++it) { v = *it; if (v < min) { min = v; } if (v > max) { max = v; } total += v; } LOG((CLOG_INFO "game device timing, min=%dms, max=%dms, avg=%dms", min, max, (UInt16)(total / m_gameFakeLagRecord.size()))); m_gameFakeLagRecord.clear(); } } void CMSWindowsXInput::gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { XInputSetStateFunc xInputSetStateFunc = (XInputSetStateFunc)GetProcAddress(m_xinputModule, "XInputSetState"); if (xInputSetStateFunc == NULL) { throw XScreenXInputFailure("could not get function address: XInputSetState"); } XINPUT_VIBRATION vibration; ZeroMemory(&vibration, sizeof(XINPUT_VIBRATION)); vibration.wLeftMotorSpeed = m1; vibration.wRightMotorSpeed = m2; xInputSetStateFunc(id, &vibration); } void CMSWindowsXInput::xInputPollThread(void*) { LOG((CLOG_DEBUG "xinput poll thread started")); XInputGetStateFunc xInputGetStateFunc = (XInputGetStateFunc)GetProcAddress(m_xinputModule, "XInputGetState"); if (xInputGetStateFunc == NULL) { throw XScreenXInputFailure("could not get function address: XInputGetState"); } int index = 0; XINPUT_STATE state; bool end = false; while (!end) { ZeroMemory(&state, sizeof(XINPUT_STATE)); DWORD result = xInputGetStateFunc(index, &state); // timeout the timing request after 10 seconds if (m_gameTimingWaiting && (ARCH->time() - m_gameLastTimingSent > 2)) { m_gameTimingWaiting = false; LOG((CLOG_DEBUG "game device timing request timed out")); } // xinput controller is connected if (result == ERROR_SUCCESS) { // @todo game device state class bool buttonsChanged = state.Gamepad.wButtons != m_gameButtonsLast; bool leftTriggerChanged = state.Gamepad.bLeftTrigger != m_gameLeftTriggerLast; bool rightTriggerChanged = state.Gamepad.bRightTrigger != m_gameRightTriggerLast; bool leftStickXChanged = state.Gamepad.sThumbLX != m_gameLeftStickXLast; bool leftStickYChanged = state.Gamepad.sThumbLY != m_gameLeftStickYLast; bool rightStickXChanged = state.Gamepad.sThumbRX != m_gameRightStickXLast; bool rightStickYChanged = state.Gamepad.sThumbRY != m_gameRightStickYLast; m_gameButtonsLast = state.Gamepad.wButtons; m_gameLeftTriggerLast = state.Gamepad.bLeftTrigger; m_gameRightTriggerLast = state.Gamepad.bRightTrigger; m_gameLeftStickXLast = state.Gamepad.sThumbLX; m_gameLeftStickYLast = state.Gamepad.sThumbLY; m_gameRightStickXLast = state.Gamepad.sThumbRX; m_gameRightStickYLast = state.Gamepad.sThumbRY; bool eventSent = false; if (buttonsChanged) { LOG((CLOG_DEBUG "xinput buttons changed")); // xinput buttons convert exactly to synergy buttons m_screen->sendEvent(m_screen->getGameDeviceButtonsEvent(), new IPrimaryScreen::CGameDeviceButtonInfo(index, state.Gamepad.wButtons)); eventSent = true; } if (leftStickXChanged || leftStickYChanged || rightStickXChanged || rightStickYChanged) { LOG((CLOG_DEBUG "xinput sticks changed")); m_screen->sendEvent(m_screen->getGameDeviceSticksEvent(), new IPrimaryScreen::CGameDeviceStickInfo( index, m_gameLeftStickXLast, m_gameLeftStickYLast, m_gameRightStickXLast, m_gameRightStickYLast)); eventSent = true; } if (leftTriggerChanged || rightTriggerChanged) { LOG((CLOG_DEBUG "xinput triggers changed")); // @todo seems wrong re-using x/y for a single value... m_screen->sendEvent(m_screen->getGameDeviceTriggersEvent(), new IPrimaryScreen::CGameDeviceTriggerInfo( index, state.Gamepad.bLeftTrigger, state.Gamepad.bRightTrigger)); eventSent = true; } if (/*eventSent && */!m_gameTimingWaiting && (ARCH->time() - m_gameLastTimingSent > .5)) { m_screen->sendEvent(m_screen->getGameDeviceTimingReqEvent(), NULL); m_gameLastTimingSent = ARCH->time(); m_gameTimingWaiting = true; LOG((CLOG_DEBUG "game device timing request at %.4f", m_gameLastTimingSent)); } } UInt16 sleep = m_gamePollFreq + m_gamePollFreqAdjust; LOG((CLOG_DEBUG5 "xinput poll sleeping for %dms", sleep)); Sleep(sleep); } } void CMSWindowsXInput::xInputTimingThread(void*) { LOG((CLOG_DEBUG "xinput timing thread started")); bool end = false; while (!end) { // if timing request was queued, a timing response is queued // when the xinput status is faked; if it was faked, go tell // the server when this happened. if (DequeueXInputTimingResp()) { LOG((CLOG_DEBUG "dequeued game device timing response")); m_screen->sendEvent(m_screen->getGameDeviceTimingRespEvent(), new IPrimaryScreen::CGameDeviceTimingRespInfo(GetXInputFakeFreqMillis())); } // give the cpu a break. Sleep(1); } } void CMSWindowsXInput::xInputFeedbackThread(void*) { LOG((CLOG_DEBUG "xinput feedback thread started")); int index = 0; bool end = false; while (!end) { WORD leftMotor, rightMotor; if (DequeueXInputFeedback(&leftMotor, &rightMotor)) { LOG((CLOG_DEBUG "dequeued game device feedback")); m_screen->sendEvent(m_screen->getGameDeviceFeedbackEvent(), new IPrimaryScreen::CGameDeviceFeedbackInfo(index, leftMotor, rightMotor)); } Sleep(50); } } synergy-1.4.12-Source/src/lib/platform/CMSWindowsXInput.h0000600000175000017500000000541712021261364023212 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CGameDevice.h" #include "CThread.h" #include "CGameDevice.h" #include "BasicTypes.h" #include "GameDeviceTypes.h" #include "IPrimaryScreen.h" #define WIN32_LEAN_AND_MEAN #include #include class CMSWindowsScreen; enum { kGamePollFreqDefault = 100, kGamePollFreqMin = 50, kGamePollFreqMax = 200, kGameCalibrationPeriod = 10000, // 10 seconds kGameLagRecordMax = 10, }; class CMSWindowsXInput : public CGameDevice { public: CMSWindowsXInput(CMSWindowsScreen* screen, const CGameDeviceInfo& gameDevice); virtual ~CMSWindowsXInput(); void init(CMSWindowsScreen* screen); // thread for polling xinput state. void xInputPollThread(void*); // thread for checking queued timing requests. void xInputTimingThread(void*); // thread for checking pending feedback state. void xInputFeedbackThread(void*); virtual void gameDeviceTimingResp(UInt16 freq); virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const; virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const; virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const; virtual void queueGameDeviceTimingReq() const; private: CMSWindowsScreen* m_screen; const CGameDeviceInfo& m_gameDeviceInfo; CThread* m_xInputPollThread; CThread* m_xInputTimingThread; CThread* m_xInputFeedbackThread; WORD m_gameButtonsLast; BYTE m_gameLeftTriggerLast; BYTE m_gameRightTriggerLast; SHORT m_gameLeftStickXLast; SHORT m_gameLeftStickYLast; SHORT m_gameRightStickXLast; SHORT m_gameRightStickYLast; double m_gameLastTimingSent; bool m_gameTimingWaiting; UInt16 m_gameFakeLag; UInt16 m_gameFakeLagMin; UInt16 m_gamePollFreq; SInt8 m_gamePollFreqAdjust; UInt16 m_gameTimingStarted; UInt16 m_gameTimingFirst; UInt16 m_gameFakeLagLast; bool m_gameTimingCalibrated; std::vector m_gameFakeLagRecord; HMODULE m_xinputModule; }; synergy-1.4.12-Source/src/lib/platform/COSXClipboard.cpp0000600000175000017500000001351012021261364022765 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClipboard.h" #include "CClipboard.h" #include "COSXClipboardUTF16Converter.h" #include "COSXClipboardTextConverter.h" #include "CLog.h" #include "XArch.h" // // COSXClipboard // COSXClipboard::COSXClipboard() : m_time(0), m_pboard(NULL) { m_converters.push_back(new COSXClipboardUTF16Converter); m_converters.push_back(new COSXClipboardTextConverter); OSStatus createErr = PasteboardCreate(kPasteboardClipboard, &m_pboard); if (createErr != noErr) { LOG((CLOG_DEBUG "failed to create clipboard reference: error %i", createErr)); LOG((CLOG_ERR "unable to connect to pasteboard, clipboard sharing disabled", createErr)); m_pboard = NULL; return; } OSStatus syncErr = PasteboardSynchronize(m_pboard); if (syncErr != noErr) { LOG((CLOG_DEBUG "failed to syncronize clipboard: error %i", syncErr)); } } COSXClipboard::~COSXClipboard() { clearConverters(); } bool COSXClipboard::empty() { LOG((CLOG_DEBUG "emptying clipboard")); if (m_pboard == NULL) return false; OSStatus err = PasteboardClear(m_pboard); if (err != noErr) { LOG((CLOG_DEBUG "failed to clear clipboard: error %i", err)); return false; } return true; } bool COSXClipboard::synchronize() { if (m_pboard == NULL) return false; PasteboardSyncFlags flags = PasteboardSynchronize(m_pboard); LOG((CLOG_DEBUG2 "flags: %x", flags)); if (flags & kPasteboardModified) { return true; } return false; } void COSXClipboard::add(EFormat format, const CString & data) { bool emptied = false; if (m_pboard == NULL) return; LOG((CLOG_DEBUG "add %d bytes to clipboard format: %d", data.size(), format)); for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IOSXClipboardConverter* converter = *index; // skip converters for other formats if (converter->getFormat() == format) { CString osXData = converter->fromIClipboard(data); CFStringRef flavorType = converter->getOSXFormat(); CFDataRef dataRef = CFDataCreate(kCFAllocatorDefault, (UInt8 *)osXData.data(), osXData.size()); // integ tests showed that if you call add(...) twice, then the // second call will actually fail to set clipboard data. calling // empty() seems to solve this problem. but, only clear the clipboard // for the first converter, otherwise further converters will wipe out // what we just added. if (!emptied) { empty(); emptied = true; } PasteboardPutItemFlavor( m_pboard, (PasteboardItemID) 0, flavorType, dataRef, kPasteboardFlavorNoFlags); LOG((CLOG_DEBUG "added %d bytes to clipboard format: %d", data.size(), format)); } } } bool COSXClipboard::open(Time time) const { if (m_pboard == NULL) return false; LOG((CLOG_DEBUG "opening clipboard")); m_time = time; return true; } void COSXClipboard::close() const { LOG((CLOG_DEBUG "closing clipboard")); /* not needed */ } IClipboard::Time COSXClipboard::getTime() const { return m_time; } bool COSXClipboard::has(EFormat format) const { if (m_pboard == NULL) return false; PasteboardItemID item; PasteboardGetItemIdentifier(m_pboard, (CFIndex) 1, &item); for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IOSXClipboardConverter* converter = *index; if (converter->getFormat() == format) { PasteboardFlavorFlags flags; CFStringRef type = converter->getOSXFormat(); OSStatus res; if ((res = PasteboardGetItemFlavorFlags(m_pboard, item, type, &flags)) == noErr) { return true; } } } return false; } CString COSXClipboard::get(EFormat format) const { CFStringRef type; PasteboardItemID item; CString result; if (m_pboard == NULL) return result; PasteboardGetItemIdentifier(m_pboard, (CFIndex) 1, &item); // find the converter for the first clipboard format we can handle IOSXClipboardConverter* converter = NULL; for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { converter = *index; PasteboardFlavorFlags flags; type = converter->getOSXFormat(); if (converter->getFormat() == format && PasteboardGetItemFlavorFlags(m_pboard, item, type, &flags) == noErr) { break; } converter = NULL; } // if no converter then we don't recognize any formats if (converter == NULL) { LOG((CLOG_DEBUG "Unable to find converter for data")); return result; } // get the clipboard data. CFDataRef buffer = NULL; try { OSStatus err = PasteboardCopyItemFlavorData(m_pboard, item, type, &buffer); if (err != noErr) { throw err; } result = CString((char *) CFDataGetBytePtr(buffer), CFDataGetLength(buffer)); } catch (OSStatus err) { LOG((CLOG_DEBUG "exception thrown in COSXClipboard::get MacError (%d)", err)); } catch (...) { LOG((CLOG_DEBUG "unknown exception in COSXClipboard::get")); RETHROW_XTHREAD } if (buffer != NULL) CFRelease(buffer); return converter->toIClipboard(result); } void COSXClipboard::clearConverters() { if (m_pboard == NULL) return; for (ConverterList::iterator index = m_converters.begin(); index != m_converters.end(); ++index) { delete *index; } m_converters.clear(); } synergy-1.4.12-Source/src/lib/platform/COSXClipboard.h0000600000175000017500000000504712021261364022440 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXCLIPBOARD_H #define COSXCLIPBOARD_H #include #include "IClipboard.h" #include class IOSXClipboardConverter; //! OS X clipboard implementation class COSXClipboard : public IClipboard { public: COSXClipboard(); virtual ~COSXClipboard(); //! Test if clipboard is owned by synergy static bool isOwnedBySynergy(); // IClipboard overrides virtual bool empty(); virtual void add(EFormat, const CString& data); virtual bool open(Time) const; virtual void close() const; virtual Time getTime() const; virtual bool has(EFormat) const; virtual CString get(EFormat) const; bool synchronize(); private: void clearConverters(); private: typedef std::vector ConverterList; mutable Time m_time; ConverterList m_converters; PasteboardRef m_pboard; }; //! Clipboard format converter interface /*! This interface defines the methods common to all Scrap book format */ class IOSXClipboardConverter : public IInterface { public: //! @name accessors //@{ //! Get clipboard format /*! Return the clipboard format this object converts from/to. */ virtual IClipboard::EFormat getFormat() const = 0; //! returns the scrap flavor type that this object converts from/to virtual CFStringRef getOSXFormat() const = 0; //! Convert from IClipboard format /*! Convert from the IClipboard format to the Carbon scrap format. The input data must be in the IClipboard format returned by getFormat(). The return data will be in the scrap format returned by getOSXFormat(). */ virtual CString fromIClipboard(const CString&) const = 0; //! Convert to IClipboard format /*! Convert from the carbon scrap format to the IClipboard format (i.e., the reverse of fromIClipboard()). */ virtual CString toIClipboard(const CString&) const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/platform/COSXClipboardAnyTextConverter.cpp0000600000175000017500000000373112021261364026176 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClipboardAnyTextConverter.h" #include // // COSXClipboardAnyTextConverter // COSXClipboardAnyTextConverter::COSXClipboardAnyTextConverter() { // do nothing } COSXClipboardAnyTextConverter::~COSXClipboardAnyTextConverter() { // do nothing } IClipboard::EFormat COSXClipboardAnyTextConverter::getFormat() const { return IClipboard::kText; } CString COSXClipboardAnyTextConverter::fromIClipboard(const CString& data) const { // convert linefeeds and then convert to desired encoding return doFromIClipboard(convertLinefeedToMacOS(data)); } CString COSXClipboardAnyTextConverter::toIClipboard(const CString& data) const { // convert text then newlines return convertLinefeedToUnix(doToIClipboard(data)); } static bool isLF(char ch) { return (ch == '\n'); } static bool isCR(char ch) { return (ch == '\r'); } CString COSXClipboardAnyTextConverter::convertLinefeedToMacOS(const CString& src) { // note -- we assume src is a valid UTF-8 string CString copy = src; std::replace_if(copy.begin(), copy.end(), isLF, '\r'); return copy; } CString COSXClipboardAnyTextConverter::convertLinefeedToUnix(const CString& src) { CString copy = src; std::replace_if(copy.begin(), copy.end(), isCR, '\n'); return copy; } synergy-1.4.12-Source/src/lib/platform/COSXClipboardAnyTextConverter.h0000600000175000017500000000332012021261364025635 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXCLIPBOARDANYTEXTCONVERTER_H #define COSXCLIPBOARDANYTEXTCONVERTER_H #include "COSXClipboard.h" //! Convert to/from some text encoding class COSXClipboardAnyTextConverter : public IOSXClipboardConverter { public: COSXClipboardAnyTextConverter(); virtual ~COSXClipboardAnyTextConverter(); // IOSXClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual CFStringRef getOSXFormat() const = 0; virtual CString fromIClipboard(const CString &) const; virtual CString toIClipboard(const CString &) const; protected: //! Convert from IClipboard format /*! Do UTF-8 conversion and linefeed conversion. */ virtual CString doFromIClipboard(const CString&) const = 0; //! Convert to IClipboard format /*! Do UTF-8 conversion and Linefeed conversion. */ virtual CString doToIClipboard(const CString&) const = 0; private: static CString convertLinefeedToMacOS(const CString&); static CString convertLinefeedToUnix(const CString&); }; #endif synergy-1.4.12-Source/src/lib/platform/COSXClipboardTextConverter.cpp0000600000175000017500000000430312021261364025522 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClipboardTextConverter.h" #include "CUnicode.h" // // COSXClipboardTextConverter // COSXClipboardTextConverter::COSXClipboardTextConverter() { // do nothing } COSXClipboardTextConverter::~COSXClipboardTextConverter() { // do nothing } CFStringRef COSXClipboardTextConverter::getOSXFormat() const { return CFSTR("public.plain-text"); } CString COSXClipboardTextConverter::convertString( const CString& data, CFStringEncoding fromEncoding, CFStringEncoding toEncoding) { CFStringRef stringRef = CFStringCreateWithCString(kCFAllocatorDefault, data.c_str(), fromEncoding); if (stringRef == NULL) { return CString(); } CFIndex buffSize; CFRange entireString = CFRangeMake(0, CFStringGetLength(stringRef)); CFStringGetBytes(stringRef, entireString, toEncoding, 0, false, NULL, 0, &buffSize); char* buffer = new char[buffSize]; if (buffer == NULL) { CFRelease(stringRef); return CString(); } CFStringGetBytes(stringRef, entireString, toEncoding, 0, false, (UInt8*)buffer, buffSize, NULL); CString result(buffer, buffSize); delete[] buffer; CFRelease(stringRef); return result; } CString COSXClipboardTextConverter::doFromIClipboard(const CString& data) const { return convertString(data, kCFStringEncodingUTF8, CFStringGetSystemEncoding()); } CString COSXClipboardTextConverter::doToIClipboard(const CString& data) const { return convertString(data, CFStringGetSystemEncoding(), kCFStringEncodingUTF8); } synergy-1.4.12-Source/src/lib/platform/COSXClipboardTextConverter.h0000600000175000017500000000271412021261364025173 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXCLIPBOARDTEXTCONVERTER_H #define COSXCLIPBOARDTEXTCONVERTER_H #include "COSXClipboardAnyTextConverter.h" //! Convert to/from locale text encoding class COSXClipboardTextConverter : public COSXClipboardAnyTextConverter { public: COSXClipboardTextConverter(); virtual ~COSXClipboardTextConverter(); // IOSXClipboardAnyTextConverter overrides virtual CFStringRef getOSXFormat() const; protected: // COSXClipboardAnyTextConverter overrides virtual CString doFromIClipboard(const CString&) const; virtual CString doToIClipboard(const CString&) const; // generic encoding converter static CString convertString(const CString& data, CFStringEncoding fromEncoding, CFStringEncoding toEncoding); }; #endif synergy-1.4.12-Source/src/lib/platform/COSXClipboardUTF16Converter.cpp0000600000175000017500000000261412021261364025406 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClipboardUTF16Converter.h" #include "CUnicode.h" // // COSXClipboardUTF16Converter // COSXClipboardUTF16Converter::COSXClipboardUTF16Converter() { // do nothing } COSXClipboardUTF16Converter::~COSXClipboardUTF16Converter() { // do nothing } CFStringRef COSXClipboardUTF16Converter::getOSXFormat() const { return CFSTR("public.utf16-plain-text"); } CString COSXClipboardUTF16Converter::doFromIClipboard(const CString& data) const { // convert and add nul terminator return CUnicode::UTF8ToUTF16(data); } CString COSXClipboardUTF16Converter::doToIClipboard(const CString& data) const { // convert and strip nul terminator return CUnicode::UTF16ToUTF8(data); } synergy-1.4.12-Source/src/lib/platform/COSXClipboardUTF16Converter.h0000600000175000017500000000245312021261364025054 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXCLIPBOARDUTF16CONVERTER_H #define COSXCLIPBOARDUTF16CONVERTER_H #include "COSXClipboardAnyTextConverter.h" //! Convert to/from UTF-16 encoding class COSXClipboardUTF16Converter : public COSXClipboardAnyTextConverter { public: COSXClipboardUTF16Converter(); virtual ~COSXClipboardUTF16Converter(); // IOSXClipboardAnyTextConverter overrides virtual CFStringRef getOSXFormat() const; protected: // COSXClipboardAnyTextConverter overrides virtual CString doFromIClipboard(const CString&) const; virtual CString doToIClipboard(const CString&) const; }; #endif synergy-1.4.12-Source/src/lib/platform/COSXEventQueueBuffer.cpp0000600000175000017500000000521612021261364024312 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXEventQueueBuffer.h" #include "CEvent.h" #include "IEventQueue.h" // // CEventQueueTimer // class CEventQueueTimer { }; // // COSXEventQueueBuffer // COSXEventQueueBuffer::COSXEventQueueBuffer() : m_event(NULL) { // do nothing } COSXEventQueueBuffer::~COSXEventQueueBuffer() { // release the last event if (m_event != NULL) { ReleaseEvent(m_event); } } void COSXEventQueueBuffer::waitForEvent(double timeout) { EventRef event; ReceiveNextEvent(0, NULL, timeout, false, &event); } IEventQueueBuffer::Type COSXEventQueueBuffer::getEvent(CEvent& event, UInt32& dataID) { // release the previous event if (m_event != NULL) { ReleaseEvent(m_event); m_event = NULL; } // get the next event OSStatus error = ReceiveNextEvent(0, NULL, 0.0, true, &m_event); // handle the event if (error == eventLoopQuitErr) { event = CEvent(CEvent::kQuit); return kSystem; } else if (error != noErr) { return kNone; } else { UInt32 eventClass = GetEventClass(m_event); switch (eventClass) { case 'Syne': dataID = GetEventKind(m_event); return kUser; default: event = CEvent(CEvent::kSystem, IEventQueue::getSystemTarget(), &m_event); return kSystem; } } } bool COSXEventQueueBuffer::addEvent(UInt32 dataID) { EventRef event; OSStatus error = CreateEvent( kCFAllocatorDefault, 'Syne', dataID, 0, kEventAttributeNone, &event); if (error == noErr) { error = PostEventToQueue(GetMainEventQueue(), event, kEventPriorityStandard); ReleaseEvent(event); } return (error == noErr); } bool COSXEventQueueBuffer::isEmpty() const { EventRef event; OSStatus status = ReceiveNextEvent(0, NULL, 0.0, false, &event); return (status == eventLoopTimedOutErr); } CEventQueueTimer* COSXEventQueueBuffer::newTimer(double, bool) const { return new CEventQueueTimer; } void COSXEventQueueBuffer::deleteTimer(CEventQueueTimer* timer) const { delete timer; } synergy-1.4.12-Source/src/lib/platform/COSXEventQueueBuffer.h0000600000175000017500000000256112021261364023757 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXEVENTQUEUEBUFFER_H #define COSXEVENTQUEUEBUFFER_H #include #include "IEventQueueBuffer.h" //! Event queue buffer for OS X class COSXEventQueueBuffer : public IEventQueueBuffer { public: COSXEventQueueBuffer(); virtual ~COSXEventQueueBuffer(); // IEventQueueBuffer overrides virtual void waitForEvent(double timeout); virtual Type getEvent(CEvent& event, UInt32& dataID); virtual bool addEvent(UInt32 dataID); virtual bool isEmpty() const; virtual CEventQueueTimer* newTimer(double duration, bool oneShot) const; virtual void deleteTimer(CEventQueueTimer*) const; private: EventRef m_event; }; #endif synergy-1.4.12-Source/src/lib/platform/COSXKeyState.cpp0000600000175000017500000010221012021261364022613 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXKeyState.h" #include "CLog.h" #include "CArch.h" #if defined(MAC_OS_X_VERSION_10_5) #include #endif // Note that some virtual keys codes appear more than once. The // first instance of a virtual key code maps to the KeyID that we // want to generate for that code. The others are for mapping // different KeyIDs to a single key code. #if defined(MAC_OS_X_VERSION_10_5) static const UInt32 s_shiftVK = kVK_Shift; static const UInt32 s_controlVK = kVK_Control; static const UInt32 s_altVK = kVK_Option; static const UInt32 s_superVK = kVK_Command; static const UInt32 s_capsLockVK = kVK_CapsLock; static const UInt32 s_numLockVK = kVK_ANSI_KeypadClear; // 71 #else // Hardcoded virtual key table on 10.4 and below. static const UInt32 s_shiftVK = 56; static const UInt32 s_controlVK = 59; static const UInt32 s_altVK = 58; static const UInt32 s_superVK = 55; static const UInt32 s_capsLockVK = 57; static const UInt32 s_numLockVK = 71; #endif static const UInt32 s_osxNumLock = 1 << 16; struct CKeyEntry { public: KeyID m_keyID; UInt32 m_virtualKey; }; static const CKeyEntry s_controlKeys[] = { #if defined(MAC_OS_X_VERSION_10_5) // cursor keys. if we don't do this we'll may still get these from // the keyboard resource but they may not correspond to the arrow // keys. { kKeyLeft, kVK_LeftArrow }, { kKeyRight, kVK_RightArrow }, { kKeyUp, kVK_UpArrow }, { kKeyDown, kVK_DownArrow }, { kKeyHome, kVK_Home }, { kKeyEnd, kVK_End }, { kKeyPageUp, kVK_PageUp }, { kKeyPageDown, kVK_PageDown }, { kKeyInsert, kVK_Help }, // Mac Keyboards have 'Help' on 'Insert' // function keys { kKeyF1, kVK_F1 }, { kKeyF2, kVK_F2 }, { kKeyF3, kVK_F3 }, { kKeyF4, kVK_F4 }, { kKeyF5, kVK_F5 }, { kKeyF6, kVK_F6 }, { kKeyF7, kVK_F7 }, { kKeyF8, kVK_F8 }, { kKeyF9, kVK_F9 }, { kKeyF10, kVK_F10 }, { kKeyF11, kVK_F11 }, { kKeyF12, kVK_F12 }, { kKeyF13, kVK_F13 }, { kKeyF14, kVK_F14 }, { kKeyF15, kVK_F15 }, { kKeyF16, kVK_F16 }, { kKeyKP_0, kVK_ANSI_Keypad0 }, { kKeyKP_1, kVK_ANSI_Keypad1 }, { kKeyKP_2, kVK_ANSI_Keypad2 }, { kKeyKP_3, kVK_ANSI_Keypad3 }, { kKeyKP_4, kVK_ANSI_Keypad4 }, { kKeyKP_5, kVK_ANSI_Keypad5 }, { kKeyKP_6, kVK_ANSI_Keypad6 }, { kKeyKP_7, kVK_ANSI_Keypad7 }, { kKeyKP_8, kVK_ANSI_Keypad8 }, { kKeyKP_9, kVK_ANSI_Keypad9 }, { kKeyKP_Decimal, kVK_ANSI_KeypadDecimal }, { kKeyKP_Equal, kVK_ANSI_KeypadEquals }, { kKeyKP_Multiply, kVK_ANSI_KeypadMultiply }, { kKeyKP_Add, kVK_ANSI_KeypadPlus }, { kKeyKP_Divide, kVK_ANSI_KeypadDivide }, { kKeyKP_Subtract, kVK_ANSI_KeypadMinus }, { kKeyKP_Enter, kVK_ANSI_KeypadEnter }, #else // Hardcoded virtual key table on 10.4 and below. // cursor keys. { kKeyLeft, 123 }, { kKeyRight, 124 }, { kKeyUp, 126 }, { kKeyDown, 125 }, { kKeyHome, 115 }, { kKeyEnd, 119 }, { kKeyPageUp, 116 }, { kKeyPageDown, 121 }, { kKeyInsert, 114 }, // function keys { kKeyF1, 122 }, { kKeyF2, 120 }, { kKeyF3, 99 }, { kKeyF4, 118 }, { kKeyF5, 96 }, { kKeyF6, 97 }, { kKeyF7, 98 }, { kKeyF8, 100 }, { kKeyF9, 101 }, { kKeyF10, 109 }, { kKeyF11, 103 }, { kKeyF12, 111 }, { kKeyF13, 105 }, { kKeyF14, 107 }, { kKeyF15, 113 }, { kKeyF16, 106 }, { kKeyKP_0, 82 }, { kKeyKP_1, 83 }, { kKeyKP_2, 84 }, { kKeyKP_3, 85 }, { kKeyKP_4, 86 }, { kKeyKP_5, 87 }, { kKeyKP_6, 88 }, { kKeyKP_7, 89 }, { kKeyKP_8, 91 }, { kKeyKP_9, 92 }, { kKeyKP_Decimal, 65 }, { kKeyKP_Equal, 81 }, { kKeyKP_Multiply, 67 }, { kKeyKP_Add, 69 }, { kKeyKP_Divide, 75 }, { kKeyKP_Subtract, 78 }, { kKeyKP_Enter, 76 }, #endif // virtual key 110 is fn+enter and i have no idea what that's supposed // to map to. also the enter key with numlock on is a modifier but i // don't know which. // modifier keys. OS X doesn't seem to support right handed versions // of modifier keys so we map them to the left handed versions. { kKeyShift_L, s_shiftVK }, { kKeyShift_R, s_shiftVK }, // 60 { kKeyControl_L, s_controlVK }, { kKeyControl_R, s_controlVK }, // 62 { kKeyAlt_L, s_altVK }, { kKeyAlt_R, s_altVK }, { kKeySuper_L, s_superVK }, { kKeySuper_R, s_superVK }, // 61 { kKeyMeta_L, s_superVK }, { kKeyMeta_R, s_superVK }, // 61 // toggle modifiers { kKeyNumLock, s_numLockVK }, { kKeyCapsLock, s_capsLockVK } }; // // COSXKeyState // COSXKeyState::COSXKeyState() : m_deadKeyState(0) { init(); } COSXKeyState::COSXKeyState(IEventQueue& eventQueue, CKeyMap& keyMap) : CKeyState(eventQueue, keyMap), m_deadKeyState(0) { init(); } COSXKeyState::~COSXKeyState() { } void COSXKeyState::init() { // initialize modifier key values shiftPressed = false; controlPressed = false; altPressed = false; superPressed = false; capsPressed = false; // build virtual key map for (size_t i = 0; i < sizeof(s_controlKeys) / sizeof(s_controlKeys[0]); ++i) { m_virtualKeyMap[s_controlKeys[i].m_virtualKey] = s_controlKeys[i].m_keyID; } } KeyModifierMask COSXKeyState::mapModifiersFromOSX(UInt32 mask) const { LOG((CLOG_DEBUG1 "mask: %04x", mask)); KeyModifierMask outMask = 0; if ((mask & kCGEventFlagMaskShift) != 0) { outMask |= KeyModifierShift; } if ((mask & kCGEventFlagMaskControl) != 0) { outMask |= KeyModifierControl; } if ((mask & kCGEventFlagMaskAlternate) != 0) { outMask |= KeyModifierAlt; } if ((mask & kCGEventFlagMaskCommand) != 0) { outMask |= KeyModifierSuper; } if ((mask & kCGEventFlagMaskAlphaShift) != 0) { outMask |= KeyModifierCapsLock; } if ((mask & kCGEventFlagMaskNumericPad) != 0) { outMask |= KeyModifierNumLock; } return outMask; } KeyModifierMask COSXKeyState::mapModifiersToCarbon(UInt32 mask) const { KeyModifierMask outMask = 0; if ((mask & kCGEventFlagMaskShift) != 0) { outMask |= shiftKey; } if ((mask & kCGEventFlagMaskControl) != 0) { outMask |= controlKey; } if ((mask & kCGEventFlagMaskCommand) != 0) { outMask |= cmdKey; } if ((mask & kCGEventFlagMaskAlternate) != 0) { outMask |= optionKey; } if ((mask & kCGEventFlagMaskAlphaShift) != 0) { outMask |= alphaLock; } if ((mask & kCGEventFlagMaskNumericPad) != 0) { outMask |= s_osxNumLock; } return outMask; } KeyButton COSXKeyState::mapKeyFromEvent(CKeyIDs& ids, KeyModifierMask* maskOut, CGEventRef event) const { ids.clear(); // map modifier key if (maskOut != NULL) { KeyModifierMask activeMask = getActiveModifiers(); activeMask &= ~KeyModifierAltGr; *maskOut = activeMask; } // get virtual key UInt32 vkCode = CGEventGetIntegerValueField(event, kCGKeyboardEventKeycode); // handle up events UInt32 eventKind = CGEventGetType(event); if (eventKind == kCGEventKeyUp) { // the id isn't used. we just need the same button we used on // the key press. note that we don't use or reset the dead key // state; up events should not affect the dead key state. ids.push_back(kKeyNone); return mapVirtualKeyToKeyButton(vkCode); } // check for special keys CVirtualKeyMap::const_iterator i = m_virtualKeyMap.find(vkCode); if (i != m_virtualKeyMap.end()) { m_deadKeyState = 0; ids.push_back(i->second); return mapVirtualKeyToKeyButton(vkCode); } // get keyboard info #if defined(MAC_OS_X_VERSION_10_5) TISInputSourceRef currentKeyboardLayout = TISCopyCurrentKeyboardLayoutInputSource(); #else KeyboardLayoutRef currentKeyboardLayout; OSStatus status = KLGetCurrentKeyboardLayout(¤tKeyboardLayout); #endif if (currentKeyboardLayout == NULL) { return kKeyNone; } // get the event modifiers and remove the command and control // keys. note if we used them though. // UCKeyTranslate expects old-style Carbon modifiers, so convert. UInt32 modifiers; modifiers = mapModifiersToCarbon(CGEventGetFlags(event)); static const UInt32 s_commandModifiers = cmdKey | controlKey | rightControlKey; bool isCommand = ((modifiers & s_commandModifiers) != 0); modifiers &= ~s_commandModifiers; // if we've used a command key then we want the glyph produced without // the option key (i.e. the base glyph). //if (isCommand) { modifiers &= ~optionKey; //} // choose action UInt16 action; if(eventKind==kCGEventKeyDown) { action = kUCKeyActionDown; } else if(CGEventGetIntegerValueField(event, kCGKeyboardEventAutorepeat)==1) { action = kUCKeyActionAutoKey; } else { return 0; } // translate via uchr resource #if defined(MAC_OS_X_VERSION_10_5) CFDataRef ref = (CFDataRef) TISGetInputSourceProperty(currentKeyboardLayout, kTISPropertyUnicodeKeyLayoutData); const UCKeyboardLayout* layout = (const UCKeyboardLayout*) CFDataGetBytePtr(ref); const bool layoutValid = (layout != NULL); #else const void* resource; int err = KLGetKeyboardLayoutProperty(currentKeyboardLayout, kKLuchrData, &resource); const bool layoutValid = (err == noErr); const UCKeyboardLayout* layout = (const UCKeyboardLayout*)resource; #endif if (layoutValid) { // translate key UniCharCount count; UniChar chars[2]; LOG((CLOG_DEBUG2 "modifiers: %08x", modifiers & 0xffu)); OSStatus status = UCKeyTranslate(layout, vkCode & 0xffu, action, (modifiers >> 8) & 0xffu, LMGetKbdType(), 0, &m_deadKeyState, sizeof(chars) / sizeof(chars[0]), &count, chars); // get the characters if (status == 0) { if (count != 0 || m_deadKeyState == 0) { m_deadKeyState = 0; for (UniCharCount i = 0; i < count; ++i) { ids.push_back(CKeyResource::unicharToKeyID(chars[i])); } adjustAltGrModifier(ids, maskOut, isCommand); return mapVirtualKeyToKeyButton(vkCode); } return 0; } } return 0; } bool COSXKeyState::fakeCtrlAltDel() { // pass keys through unchanged return false; } KeyModifierMask COSXKeyState::pollActiveModifiers() const { return mapModifiersFromOSX(GetCurrentKeyModifiers()); } SInt32 COSXKeyState::pollActiveGroup() const { bool layoutValid = true; #if defined(MAC_OS_X_VERSION_10_5) TISInputSourceRef keyboardLayout = TISCopyCurrentKeyboardLayoutInputSource(); #else KeyboardLayoutRef keyboardLayout; OSStatus status = KLGetCurrentKeyboardLayout(&keyboardLayout); layoutValid = (status == noErr); #endif if (layoutValid) { GroupMap::const_iterator i = m_groupMap.find(keyboardLayout); if (i != m_groupMap.end()) { return i->second; } } return 0; } void COSXKeyState::pollPressedKeys(KeyButtonSet& pressedKeys) const { KeyMap km; GetKeys(km); const UInt8* m = reinterpret_cast(km); for (UInt32 i = 0; i < 16; ++i) { for (UInt32 j = 0; j < 8; ++j) { if ((m[i] & (1u << j)) != 0) { pressedKeys.insert(mapVirtualKeyToKeyButton(8 * i + j)); } } } } void COSXKeyState::getKeyMap(CKeyMap& keyMap) { // update keyboard groups if (getGroups(m_groups)) { m_groupMap.clear(); SInt32 numGroups = (SInt32)m_groups.size(); for (SInt32 g = 0; g < numGroups; ++g) { m_groupMap[m_groups[g]] = g; } } UInt32 keyboardType = LMGetKbdType(); for (SInt32 g = 0, n = (SInt32)m_groups.size(); g < n; ++g) { // add special keys getKeyMapForSpecialKeys(keyMap, g); const void* resource; bool layoutValid = false; // add regular keys // try uchr resource first #if defined(MAC_OS_X_VERSION_10_5) CFDataRef resourceRef = (CFDataRef)TISGetInputSourceProperty( m_groups[g], kTISPropertyUnicodeKeyLayoutData); layoutValid = resourceRef != NULL; if (layoutValid) resource = CFDataGetBytePtr(resourceRef); #else layoutValid = KLGetKeyboardLayoutProperty( m_groups[g], kKLuchrData, &resource); #endif if (layoutValid) { CUCHRKeyResource uchr(resource, keyboardType); if (uchr.isValid()) { LOG((CLOG_DEBUG1 "using uchr resource for group %d", g)); getKeyMap(keyMap, g, uchr); continue; } } LOG((CLOG_DEBUG1 "no keyboard resource for group %d", g)); } } void COSXKeyState::fakeKey(const Keystroke& keystroke) { CGEventRef ref; switch (keystroke.m_type) { case Keystroke::kButton: { LOG((CLOG_DEBUG1 " %03x (%08x) %s", keystroke.m_data.m_button.m_button, keystroke.m_data.m_button.m_client, keystroke.m_data.m_button.m_press ? "down" : "up")); // let system figure out character for us ref = CGEventCreateKeyboardEvent(0, mapKeyButtonToVirtualKey( keystroke.m_data.m_button.m_button), keystroke.m_data.m_button.m_press); if (ref == NULL) { LOG((CLOG_CRIT "unable to create keyboard event for keystroke")); } UInt32 vk = mapKeyButtonToVirtualKey(keystroke.m_data.m_button.m_button); UInt32 modifierDown = keystroke.m_data.m_button.m_press; // check the key for specials and store the value (persistent until changed) if (vk == s_shiftVK) shiftPressed=modifierDown; if (vk == s_controlVK) controlPressed=modifierDown; if (vk == s_altVK) altPressed=modifierDown; if (vk == s_superVK) superPressed=modifierDown; if (vk == s_capsLockVK) capsPressed=modifierDown; //Set the event flags for special keys - see following link: //http://stackoverflow.com/questions/2008126/cgeventpost-possible-bug-when-simulating-keyboard-events CGEventFlags modifiers = 0; if (shiftPressed) modifiers |= kCGEventFlagMaskShift; if (controlPressed) modifiers |= kCGEventFlagMaskControl; if (altPressed) modifiers |= kCGEventFlagMaskAlternate; if (superPressed) modifiers |= kCGEventFlagMaskCommand; if (capsPressed) modifiers |= kCGEventFlagMaskAlphaShift; CGEventSetFlags(ref, modifiers); CGEventPost(kCGHIDEventTap, ref); // add a delay if client data isn't zero if (keystroke.m_data.m_button.m_client) { ARCH->sleep(0.01); } } break; case Keystroke::kGroup: if (keystroke.m_data.m_group.m_absolute) { LOG((CLOG_DEBUG1 " group %d", keystroke.m_data.m_group.m_group)); setGroup(keystroke.m_data.m_group.m_group); } else { LOG((CLOG_DEBUG1 " group %+d", keystroke.m_data.m_group.m_group)); setGroup(getEffectiveGroup(pollActiveGroup(), keystroke.m_data.m_group.m_group)); } break; } } void COSXKeyState::getKeyMapForSpecialKeys(CKeyMap& keyMap, SInt32 group) const { // special keys are insensitive to modifers and none are dead keys CKeyMap::KeyItem item; for (size_t i = 0; i < sizeof(s_controlKeys) / sizeof(s_controlKeys[0]); ++i) { const CKeyEntry& entry = s_controlKeys[i]; item.m_id = entry.m_keyID; item.m_group = group; item.m_button = mapVirtualKeyToKeyButton(entry.m_virtualKey); item.m_required = 0; item.m_sensitive = 0; item.m_dead = false; item.m_client = 0; CKeyMap::initModifierKey(item); keyMap.addKeyEntry(item); if (item.m_lock) { // all locking keys are half duplex on OS X keyMap.addHalfDuplexButton(item.m_button); } } // note: we don't special case the number pad keys. querying the // mac keyboard returns the non-keypad version of those keys but // a CKeyState always provides a mapping from keypad keys to // non-keypad keys so we'll be able to generate the characters // anyway. } bool COSXKeyState::getKeyMap(CKeyMap& keyMap, SInt32 group, const CKeyResource& r) const { if (!r.isValid()) { return false; } // space for all possible modifier combinations std::vector modifiers(r.getNumModifierCombinations()); // make space for the keys that any single button can synthesize std::vector > buttonKeys(r.getNumTables()); // iterate over each button CKeyMap::KeyItem item; for (UInt32 i = 0; i < r.getNumButtons(); ++i) { item.m_button = mapVirtualKeyToKeyButton(i); // the KeyIDs we've already handled std::set keys; // convert the entry in each table for this button to a KeyID for (UInt32 j = 0; j < r.getNumTables(); ++j) { buttonKeys[j].first = r.getKey(j, i); buttonKeys[j].second = CKeyMap::isDeadKey(buttonKeys[j].first); } // iterate over each character table for (UInt32 j = 0; j < r.getNumTables(); ++j) { // get the KeyID for the button/table KeyID id = buttonKeys[j].first; if (id == kKeyNone) { continue; } // if we've already handled the KeyID in the table then // move on to the next table if (keys.count(id) > 0) { continue; } keys.insert(id); // prepare item. the client state is 1 for dead keys. item.m_id = id; item.m_group = group; item.m_dead = buttonKeys[j].second; item.m_client = buttonKeys[j].second ? 1 : 0; CKeyMap::initModifierKey(item); if (item.m_lock) { // all locking keys are half duplex on OS X keyMap.addHalfDuplexButton(i); } // collect the tables that map to the same KeyID. we know it // can't be any earlier tables because of the check above. std::set tables; tables.insert(static_cast(j)); for (UInt32 k = j + 1; k < r.getNumTables(); ++k) { if (buttonKeys[k].first == id) { tables.insert(static_cast(k)); } } // collect the modifier combinations that map to any of the // tables we just collected for (UInt32 k = 0; k < r.getNumModifierCombinations(); ++k) { modifiers[k] = (tables.count(r.getTableForModifier(k)) > 0); } // figure out which modifiers the key is sensitive to. the // key is insensitive to a modifier if for every modifier mask // with the modifier bit unset in the modifiers we also find // the same mask with the bit set. // // we ignore a few modifiers that we know aren't important // for generating characters. in fact, we want to ignore any // characters generated by the control key. we don't map // those and instead expect the control modifier plus a key. UInt32 sensitive = 0; for (UInt32 k = 0; (1u << k) < r.getNumModifierCombinations(); ++k) { UInt32 bit = (1u << k); if ((bit << 8) == cmdKey || (bit << 8) == controlKey || (bit << 8) == rightControlKey) { continue; } for (UInt32 m = 0; m < r.getNumModifierCombinations(); ++m) { if (modifiers[m] != modifiers[m ^ bit]) { sensitive |= bit; break; } } } // find each required modifier mask. the key can be synthesized // using any of the masks. std::set required; for (UInt32 k = 0; k < r.getNumModifierCombinations(); ++k) { if ((k & sensitive) == k && modifiers[k & sensitive]) { required.insert(k); } } // now add a key entry for each key/required modifier pair. item.m_sensitive = mapModifiersFromOSX(sensitive << 8); for (std::set::iterator k = required.begin(); k != required.end(); ++k) { item.m_required = mapModifiersFromOSX(*k << 8); keyMap.addKeyEntry(item); } } } return true; } bool COSXKeyState::mapSynergyHotKeyToMac(KeyID key, KeyModifierMask mask, UInt32 &macVirtualKey, UInt32 &macModifierMask) const { // look up button for key KeyButton button = getButton(key, pollActiveGroup()); if (button == 0 && key != kKeyNone) { return false; } macVirtualKey = mapKeyButtonToVirtualKey(button); // calculate modifier mask macModifierMask = 0; if ((mask & KeyModifierShift) != 0) { macModifierMask |= shiftKey; } if ((mask & KeyModifierControl) != 0) { macModifierMask |= controlKey; } if ((mask & KeyModifierAlt) != 0) { macModifierMask |= cmdKey; } if ((mask & KeyModifierSuper) != 0) { macModifierMask |= optionKey; } if ((mask & KeyModifierCapsLock) != 0) { macModifierMask |= alphaLock; } if ((mask & KeyModifierNumLock) != 0) { macModifierMask |= s_osxNumLock; } return true; } void COSXKeyState::handleModifierKeys(void* target, KeyModifierMask oldMask, KeyModifierMask newMask) { // compute changed modifiers KeyModifierMask changed = (oldMask ^ newMask); // synthesize changed modifier keys if ((changed & KeyModifierShift) != 0) { handleModifierKey(target, s_shiftVK, kKeyShift_L, (newMask & KeyModifierShift) != 0, newMask); } if ((changed & KeyModifierControl) != 0) { handleModifierKey(target, s_controlVK, kKeyControl_L, (newMask & KeyModifierControl) != 0, newMask); } if ((changed & KeyModifierAlt) != 0) { handleModifierKey(target, s_altVK, kKeyAlt_L, (newMask & KeyModifierAlt) != 0, newMask); } if ((changed & KeyModifierSuper) != 0) { handleModifierKey(target, s_superVK, kKeySuper_L, (newMask & KeyModifierSuper) != 0, newMask); } if ((changed & KeyModifierCapsLock) != 0) { handleModifierKey(target, s_capsLockVK, kKeyCapsLock, (newMask & KeyModifierCapsLock) != 0, newMask); } if ((changed & KeyModifierNumLock) != 0) { handleModifierKey(target, s_numLockVK, kKeyNumLock, (newMask & KeyModifierNumLock) != 0, newMask); } } void COSXKeyState::handleModifierKey(void* target, UInt32 virtualKey, KeyID id, bool down, KeyModifierMask newMask) { KeyButton button = mapVirtualKeyToKeyButton(virtualKey); onKey(button, down, newMask); sendKeyEvent(target, down, false, id, newMask, 0, button); } bool COSXKeyState::getGroups(GroupList& groups) const { CFIndex n; bool gotLayouts = false; #if defined(MAC_OS_X_VERSION_10_5) // get number of layouts CFStringRef keys[] = { kTISPropertyInputSourceCategory }; CFStringRef values[] = { kTISCategoryKeyboardInputSource }; CFDictionaryRef dict = CFDictionaryCreate(NULL, (const void **)keys, (const void **)values, 1, NULL, NULL); CFArrayRef kbds = TISCreateInputSourceList(dict, false); n = CFArrayGetCount(kbds); gotLayouts = (n != 0); #else OSStatus status = KLGetKeyboardLayoutCount(&n); gotLayouts = (status == noErr); #endif if (!gotLayouts) { LOG((CLOG_DEBUG1 "can't get keyboard layouts")); return false; } // get each layout groups.clear(); for (CFIndex i = 0; i < n; ++i) { bool addToGroups = true; #if defined(MAC_OS_X_VERSION_10_5) TISInputSourceRef keyboardLayout = (TISInputSourceRef)CFArrayGetValueAtIndex(kbds, i); #else KeyboardLayoutRef keyboardLayout; status = KLGetKeyboardLayoutAtIndex(i, &keyboardLayout); addToGroups == (status == noErr); #endif if (addToGroups) groups.push_back(keyboardLayout); } return true; } void COSXKeyState::setGroup(SInt32 group) { #if defined(MAC_OS_X_VERSION_10_5) TISSetInputMethodKeyboardLayoutOverride(m_groups[group]); #else KLSetCurrentKeyboardLayout(m_groups[group]); #endif } void COSXKeyState::checkKeyboardLayout() { // XXX -- should call this when notified that groups have changed. // if no notification for that then we should poll. GroupList groups; if (getGroups(groups) && groups != m_groups) { updateKeyMap(); updateKeyState(); } } void COSXKeyState::adjustAltGrModifier(const CKeyIDs& ids, KeyModifierMask* mask, bool isCommand) const { if (!isCommand) { for (CKeyIDs::const_iterator i = ids.begin(); i != ids.end(); ++i) { KeyID id = *i; if (id != kKeyNone && ((id < 0xe000u || id > 0xefffu) || (id >= kKeyKP_Equal && id <= kKeyKP_9))) { *mask |= KeyModifierAltGr; return; } } } } KeyButton COSXKeyState::mapVirtualKeyToKeyButton(UInt32 keyCode) { // 'A' maps to 0 so shift every id return static_cast(keyCode + KeyButtonOffset); } UInt32 COSXKeyState::mapKeyButtonToVirtualKey(KeyButton keyButton) { return static_cast(keyButton - KeyButtonOffset); } // // COSXKeyState::CKeyResource // KeyID COSXKeyState::CKeyResource::getKeyID(UInt8 c) { if (c == 0) { return kKeyNone; } else if (c >= 32 && c < 127) { // ASCII return static_cast(c); } else { // handle special keys switch (c) { case 0x01: return kKeyHome; case 0x02: return kKeyKP_Enter; case 0x03: return kKeyKP_Enter; case 0x04: return kKeyEnd; case 0x05: return kKeyHelp; case 0x08: return kKeyBackSpace; case 0x09: return kKeyTab; case 0x0b: return kKeyPageUp; case 0x0c: return kKeyPageDown; case 0x0d: return kKeyReturn; case 0x10: // OS X maps all the function keys (F1, etc) to this one key. // we can't determine the right key here so we have to do it // some other way. return kKeyNone; case 0x1b: return kKeyEscape; case 0x1c: return kKeyLeft; case 0x1d: return kKeyRight; case 0x1e: return kKeyUp; case 0x1f: return kKeyDown; case 0x7f: return kKeyDelete; case 0x06: case 0x07: case 0x0a: case 0x0e: case 0x0f: case 0x11: case 0x12: case 0x13: case 0x14: case 0x15: case 0x16: case 0x17: case 0x18: case 0x19: case 0x1a: // discard other control characters return kKeyNone; default: // not special or unknown break; } // create string with character char str[2]; str[0] = static_cast(c); str[1] = 0; #if defined(MAC_OS_X_VERSION_10_5) // get current keyboard script TISInputSourceRef isref = TISCopyCurrentKeyboardInputSource(); CFArrayRef langs = (CFArrayRef) TISGetInputSourceProperty(isref, kTISPropertyInputSourceLanguages); CFStringEncoding encoding = CFStringConvertIANACharSetNameToEncoding((CFStringRef)CFArrayGetValueAtIndex(langs, 0)); #else CFStringEncoding encoding = GetScriptManagerVariable(smKeyScript); #endif // convert to unicode CFStringRef cfString = CFStringCreateWithCStringNoCopy( kCFAllocatorDefault, str, encoding, kCFAllocatorNull); // sometimes CFStringCreate...() returns NULL (e.g. Apple Korean // encoding with char value 214). if it did then make no key, // otherwise CFStringCreateMutableCopy() will crash. if (cfString == NULL) { return kKeyNone; } // convert to precomposed CFMutableStringRef mcfString = CFStringCreateMutableCopy(kCFAllocatorDefault, 0, cfString); CFRelease(cfString); CFStringNormalize(mcfString, kCFStringNormalizationFormC); // check result int unicodeLength = CFStringGetLength(mcfString); if (unicodeLength == 0) { CFRelease(mcfString); return kKeyNone; } if (unicodeLength > 1) { // FIXME -- more than one character, we should handle this CFRelease(mcfString); return kKeyNone; } // get unicode character UniChar uc = CFStringGetCharacterAtIndex(mcfString, 0); CFRelease(mcfString); // convert to KeyID return static_cast(uc); } } KeyID COSXKeyState::CKeyResource::unicharToKeyID(UniChar c) { switch (c) { case 3: return kKeyKP_Enter; case 8: return kKeyBackSpace; case 9: return kKeyTab; case 13: return kKeyReturn; case 27: return kKeyEscape; case 127: return kKeyDelete; default: if (c < 32) { return kKeyNone; } return static_cast(c); } } // // COSXKeyState::CUCHRKeyResource // COSXKeyState::CUCHRKeyResource::CUCHRKeyResource(const void* resource, UInt32 keyboardType) : m_m(NULL), m_cti(NULL), m_sdi(NULL), m_sri(NULL), m_st(NULL) { m_resource = reinterpret_cast(resource); if (m_resource == NULL) { return; } // find the keyboard info for the current keyboard type const UCKeyboardTypeHeader* th = NULL; const UCKeyboardLayout* r = m_resource; for (ItemCount i = 0; i < r->keyboardTypeCount; ++i) { if (keyboardType >= r->keyboardTypeList[i].keyboardTypeFirst && keyboardType <= r->keyboardTypeList[i].keyboardTypeLast) { th = r->keyboardTypeList + i; break; } if (r->keyboardTypeList[i].keyboardTypeFirst == 0) { // found the default. use it unless we find a match. th = r->keyboardTypeList + i; } } if (th == NULL) { // cannot find a suitable keyboard type return; } // get tables for keyboard type const UInt8* base = reinterpret_cast(m_resource); m_m = reinterpret_cast(base + th->keyModifiersToTableNumOffset); m_cti = reinterpret_cast(base + th->keyToCharTableIndexOffset); m_sdi = reinterpret_cast(base + th->keySequenceDataIndexOffset); if (th->keyStateRecordsIndexOffset != 0) { m_sri = reinterpret_cast(base + th->keyStateRecordsIndexOffset); } if (th->keyStateTerminatorsOffset != 0) { m_st = reinterpret_cast(base + th->keyStateTerminatorsOffset); } // find the space key, but only if it can combine with dead keys. // a dead key followed by a space yields the non-dead version of // the dead key. m_spaceOutput = 0xffffu; UInt32 table = getTableForModifier(0); for (UInt32 button = 0, n = getNumButtons(); button < n; ++button) { KeyID id = getKey(table, button); if (id == 0x20) { UCKeyOutput c = reinterpret_cast(base + m_cti->keyToCharTableOffsets[table])[button]; if ((c & kUCKeyOutputTestForIndexMask) == kUCKeyOutputStateIndexMask) { m_spaceOutput = (c & kUCKeyOutputGetIndexMask); break; } } } } bool COSXKeyState::CUCHRKeyResource::isValid() const { return (m_m != NULL); } UInt32 COSXKeyState::CUCHRKeyResource::getNumModifierCombinations() const { // only 32 (not 256) because the righthanded modifier bits are ignored return 32; } UInt32 COSXKeyState::CUCHRKeyResource::getNumTables() const { return m_cti->keyToCharTableCount; } UInt32 COSXKeyState::CUCHRKeyResource::getNumButtons() const { return m_cti->keyToCharTableSize; } UInt32 COSXKeyState::CUCHRKeyResource::getTableForModifier(UInt32 mask) const { if (mask >= m_m->modifiersCount) { return m_m->defaultTableNum; } else { return m_m->tableNum[mask]; } } KeyID COSXKeyState::CUCHRKeyResource::getKey(UInt32 table, UInt32 button) const { assert(table < getNumTables()); assert(button < getNumButtons()); const UInt8* base = reinterpret_cast(m_resource); const UCKeyOutput* cPtr = reinterpret_cast(base + m_cti->keyToCharTableOffsets[table]); const UCKeyOutput c = cPtr[button]; KeySequence keys; switch (c & kUCKeyOutputTestForIndexMask) { case kUCKeyOutputStateIndexMask: if (!getDeadKey(keys, c & kUCKeyOutputGetIndexMask)) { return kKeyNone; } break; case kUCKeyOutputSequenceIndexMask: default: if (!addSequence(keys, c)) { return kKeyNone; } break; } // XXX -- no support for multiple characters if (keys.size() != 1) { return kKeyNone; } return keys.front(); } bool COSXKeyState::CUCHRKeyResource::getDeadKey( KeySequence& keys, UInt16 index) const { if (m_sri == NULL || index >= m_sri->keyStateRecordCount) { // XXX -- should we be using some other fallback? return false; } UInt16 state = 0; if (!getKeyRecord(keys, index, state)) { return false; } if (state == 0) { // not a dead key return true; } // no dead keys if we couldn't find the space key if (m_spaceOutput == 0xffffu) { return false; } // the dead key should not have put anything in the key list if (!keys.empty()) { return false; } // get the character generated by pressing the space key after the // dead key. if we're still in a compose state afterwards then we're // confused so we bail. if (!getKeyRecord(keys, m_spaceOutput, state) || state != 0) { return false; } // convert keys to their dead counterparts for (KeySequence::iterator i = keys.begin(); i != keys.end(); ++i) { *i = CKeyMap::getDeadKey(*i); } return true; } bool COSXKeyState::CUCHRKeyResource::getKeyRecord( KeySequence& keys, UInt16 index, UInt16& state) const { const UInt8* base = reinterpret_cast(m_resource); const UCKeyStateRecord* sr = reinterpret_cast(base + m_sri->keyStateRecordOffsets[index]); const UCKeyStateEntryTerminal* kset = reinterpret_cast(sr->stateEntryData); UInt16 nextState = 0; bool found = false; if (state == 0) { found = true; nextState = sr->stateZeroNextState; if (!addSequence(keys, sr->stateZeroCharData)) { return false; } } else { // we have a next entry switch (sr->stateEntryFormat) { case kUCKeyStateEntryTerminalFormat: for (UInt16 j = 0; j < sr->stateEntryCount; ++j) { if (kset[j].curState == state) { if (!addSequence(keys, kset[j].charData)) { return false; } nextState = 0; found = true; break; } } break; case kUCKeyStateEntryRangeFormat: // XXX -- not supported yet break; default: // XXX -- unknown format return false; } } if (!found) { // use a terminator if (m_st != NULL && state < m_st->keyStateTerminatorCount) { if (!addSequence(keys, m_st->keyStateTerminators[state - 1])) { return false; } } nextState = sr->stateZeroNextState; if (!addSequence(keys, sr->stateZeroCharData)) { return false; } } // next state = nextState; return true; } bool COSXKeyState::CUCHRKeyResource::addSequence( KeySequence& keys, UCKeyCharSeq c) const { if ((c & kUCKeyOutputTestForIndexMask) == kUCKeyOutputSequenceIndexMask) { UInt16 index = (c & kUCKeyOutputGetIndexMask); if (index < m_sdi->charSequenceCount && m_sdi->charSequenceOffsets[index] != m_sdi->charSequenceOffsets[index + 1]) { // XXX -- sequences not supported yet return false; } } if (c != 0xfffe && c != 0xffff) { KeyID id = unicharToKeyID(c); if (id != kKeyNone) { keys.push_back(id); } } return true; } synergy-1.4.12-Source/src/lib/platform/COSXKeyState.h0000600000175000017500000001535112021261364022271 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXKEYSTATE_H #define COSXKEYSTATE_H #include #include "CKeyState.h" #include "stdmap.h" #include "stdset.h" #include "stdvector.h" #if defined(MAC_OS_X_VERSION_10_5) typedef TISInputSourceRef KeyLayout; #else typedef KeyboardLayoutRef KeyLayout; #endif //! OS X key state /*! A key state for OS X. */ class COSXKeyState : public CKeyState { public: typedef std::vector CKeyIDs; COSXKeyState(); COSXKeyState(IEventQueue& eventQueue, CKeyMap& keyMap); virtual ~COSXKeyState(); //! @name modifiers //@{ //! Handle modifier key change /*! Determines which modifier keys have changed and updates the modifier state and sends key events as appropriate. */ void handleModifierKeys(void* target, KeyModifierMask oldMask, KeyModifierMask newMask); //@} //! @name accessors //@{ //! Convert OS X modifier mask to synergy mask /*! Returns the synergy modifier mask corresponding to the OS X modifier mask in \p mask. */ KeyModifierMask mapModifiersFromOSX(UInt32 mask) const; //! Convert CG flags-style modifier mask to old-style Carbon /*! Still required in a few places for translation calls. */ KeyModifierMask mapModifiersToCarbon(UInt32 mask) const; //! Map key event to keys /*! Converts a key event into a sequence of KeyIDs and the shadow modifier state to a modifier mask. The KeyIDs list, in order, the characters generated by the key press/release. It returns the id of the button that was pressed or released, or 0 if the button doesn't map to a known KeyID. */ KeyButton mapKeyFromEvent(CKeyIDs& ids, KeyModifierMask* maskOut, CGEventRef event) const; //! Map key and mask to native values /*! Calculates mac virtual key and mask for a key \p key and modifiers \p mask. Returns \c true if the key can be mapped, \c false otherwise. */ bool mapSynergyHotKeyToMac(KeyID key, KeyModifierMask mask, UInt32& macVirtualKey, UInt32& macModifierMask) const; //@} // IKeyState overrides virtual bool fakeCtrlAltDel(); virtual KeyModifierMask pollActiveModifiers() const; virtual SInt32 pollActiveGroup() const; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const; protected: // CKeyState overrides virtual void getKeyMap(CKeyMap& keyMap); virtual void fakeKey(const Keystroke& keystroke); private: class CKeyResource; typedef std::vector GroupList; // Add hard coded special keys to a CKeyMap. void getKeyMapForSpecialKeys( CKeyMap& keyMap, SInt32 group) const; // Convert keyboard resource to a key map bool getKeyMap(CKeyMap& keyMap, SInt32 group, const CKeyResource& r) const; // Get the available keyboard groups bool getGroups(GroupList&) const; // Change active keyboard group to group void setGroup(SInt32 group); // Check if the keyboard layout has changed and update keyboard state // if so. void checkKeyboardLayout(); // Send an event for the given modifier key void handleModifierKey(void* target, UInt32 virtualKey, KeyID id, bool down, KeyModifierMask newMask); // Checks if any in \p ids is a glyph key and if \p isCommand is false. // If so it adds the AltGr modifier to \p mask. This allows OS X // servers to use the option key both as AltGr and as a modifier. If // option is acting as AltGr (i.e. it generates a glyph and there are // no command modifiers active) then we don't send the super modifier // to clients because they'd try to match it as a command modifier. void adjustAltGrModifier(const CKeyIDs& ids, KeyModifierMask* mask, bool isCommand) const; // Maps an OS X virtual key id to a KeyButton. This simply remaps // the ids so we don't use KeyButton 0. static KeyButton mapVirtualKeyToKeyButton(UInt32 keyCode); // Maps a KeyButton to an OS X key code. This is the inverse of // mapVirtualKeyToKeyButton. static UInt32 mapKeyButtonToVirtualKey(KeyButton keyButton); void init(); private: class CKeyResource : public IInterface { public: virtual bool isValid() const = 0; virtual UInt32 getNumModifierCombinations() const = 0; virtual UInt32 getNumTables() const = 0; virtual UInt32 getNumButtons() const = 0; virtual UInt32 getTableForModifier(UInt32 mask) const = 0; virtual KeyID getKey(UInt32 table, UInt32 button) const = 0; // Convert a character in the current script to the equivalent KeyID static KeyID getKeyID(UInt8); // Convert a unicode character to the equivalent KeyID. static KeyID unicharToKeyID(UniChar); }; class CUCHRKeyResource : public CKeyResource { public: CUCHRKeyResource(const void*, UInt32 keyboardType); // CKeyResource overrides virtual bool isValid() const; virtual UInt32 getNumModifierCombinations() const; virtual UInt32 getNumTables() const; virtual UInt32 getNumButtons() const; virtual UInt32 getTableForModifier(UInt32 mask) const; virtual KeyID getKey(UInt32 table, UInt32 button) const; private: typedef std::vector KeySequence; bool getDeadKey(KeySequence& keys, UInt16 index) const; bool getKeyRecord(KeySequence& keys, UInt16 index, UInt16& state) const; bool addSequence(KeySequence& keys, UCKeyCharSeq c) const; private: const UCKeyboardLayout* m_resource; const UCKeyModifiersToTableNum* m_m; const UCKeyToCharTableIndex* m_cti; const UCKeySequenceDataIndex* m_sdi; const UCKeyStateRecordsIndex* m_sri; const UCKeyStateTerminators* m_st; UInt16 m_spaceOutput; }; // OS X uses a physical key if 0 for the 'A' key. synergy reserves // KeyButton 0 so we offset all OS X physical key ids by this much // when used as a KeyButton and by minus this much to map a KeyButton // to a physical button. enum { KeyButtonOffset = 1 }; typedef std::map GroupMap; typedef std::map CVirtualKeyMap; CVirtualKeyMap m_virtualKeyMap; mutable UInt32 m_deadKeyState; GroupList m_groups; GroupMap m_groupMap; // Hold the current state of modifier keys bool shiftPressed; bool controlPressed; bool altPressed; bool superPressed; bool capsPressed; }; #endif synergy-1.4.12-Source/src/lib/platform/COSXScreen.cpp0000600000175000017500000014126212127576354022332 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXScreen.h" #include "COSXClipboard.h" #include "COSXEventQueueBuffer.h" #include "COSXKeyState.h" #include "COSXScreenSaver.h" #include "CClipboard.h" #include "CKeyMap.h" #include "CCondVar.h" #include "CLock.h" #include "CMutex.h" #include "CThread.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "TMethodJob.h" #include "XArch.h" #include #include #include #include // Set some enums for fast user switching if we're building with an SDK // from before such support was added. #if !defined(MAC_OS_X_VERSION_10_3) || \ (MAC_OS_X_VERSION_MAX_ALLOWED < MAC_OS_X_VERSION_10_3) enum { kEventClassSystem = 'macs', kEventSystemUserSessionActivated = 10, kEventSystemUserSessionDeactivated = 11 }; #endif // This isn't in any Apple SDK that I know of as of yet. enum { kSynergyEventMouseScroll = 11, kSynergyMouseScrollAxisX = 'saxx', kSynergyMouseScrollAxisY = 'saxy' }; // // COSXScreen // bool COSXScreen::s_testedForGHOM = false; bool COSXScreen::s_hasGHOM = false; CEvent::Type COSXScreen::s_confirmSleepEvent = CEvent::kUnknown; COSXScreen::COSXScreen(bool isPrimary, bool autoShowHideCursor) : MouseButtonEventMap(NumButtonIDs), m_isPrimary(isPrimary), m_isOnScreen(m_isPrimary), m_cursorPosValid(false), m_cursorHidden(false), m_dragNumButtonsDown(0), m_dragTimer(NULL), m_keyState(NULL), m_sequenceNumber(0), m_screensaver(NULL), m_screensaverNotify(false), m_ownClipboard(false), m_clipboardTimer(NULL), m_hiddenWindow(NULL), m_userInputWindow(NULL), m_switchEventHandlerRef(0), m_pmMutex(new CMutex), m_pmWatchThread(NULL), m_pmThreadReady(new CCondVar(m_pmMutex, false)), m_activeModifierHotKey(0), m_activeModifierHotKeyMask(0), m_lastSingleClick(0), m_lastDoubleClick(0), m_lastSingleClickXCursor(0), m_lastSingleClickYCursor(0), m_autoShowHideCursor(autoShowHideCursor), m_eventTapRLSR(nullptr), m_eventTapPort(nullptr), m_pmRootPort(0) { try { m_displayID = CGMainDisplayID(); updateScreenShape(m_displayID, 0); m_screensaver = new COSXScreenSaver(getEventTarget()); m_keyState = new COSXKeyState(); // TODO: http://stackoverflow.com/questions/2950124/enable-access-for-assistive-device-programmatically if (m_isPrimary && !AXAPIEnabled()) throw XArch("system setting not enabled: \"Enable access for assistive devices\""); // install display manager notification handler #if defined(MAC_OS_X_VERSION_10_5) CGDisplayRegisterReconfigurationCallback(displayReconfigurationCallback, this); #else m_displayManagerNotificationUPP = NewDMExtendedNotificationUPP(displayManagerCallback); OSStatus err = GetCurrentProcess(&m_PSN); err = DMRegisterExtendedNotifyProc(m_displayManagerNotificationUPP, this, 0, &m_PSN); #endif // install fast user switching event handler EventTypeSpec switchEventTypes[2]; switchEventTypes[0].eventClass = kEventClassSystem; switchEventTypes[0].eventKind = kEventSystemUserSessionDeactivated; switchEventTypes[1].eventClass = kEventClassSystem; switchEventTypes[1].eventKind = kEventSystemUserSessionActivated; EventHandlerUPP switchEventHandler = NewEventHandlerUPP(userSwitchCallback); InstallApplicationEventHandler(switchEventHandler, 2, switchEventTypes, this, &m_switchEventHandlerRef); DisposeEventHandlerUPP(switchEventHandler); constructMouseButtonEventMap(); // watch for requests to sleep EVENTQUEUE->adoptHandler(COSXScreen::getConfirmSleepEvent(), getEventTarget(), new TMethodEventJob(this, &COSXScreen::handleConfirmSleep)); // create thread for monitoring system power state. *m_pmThreadReady = false; LOG((CLOG_DEBUG "starting watchSystemPowerThread")); m_pmWatchThread = new CThread(new TMethodJob (this, &COSXScreen::watchSystemPowerThread)); } catch (...) { EVENTQUEUE->removeHandler(COSXScreen::getConfirmSleepEvent(), getEventTarget()); if (m_switchEventHandlerRef != 0) { RemoveEventHandler(m_switchEventHandlerRef); } #if defined(MAC_OS_X_VERSION_10_5) CGDisplayRemoveReconfigurationCallback(displayReconfigurationCallback, this); #else if (m_displayManagerNotificationUPP != NULL) { DMRemoveExtendedNotifyProc(m_displayManagerNotificationUPP, NULL, &m_PSN, 0); } if (m_hiddenWindow) { ReleaseWindow(m_hiddenWindow); m_hiddenWindow = NULL; } if (m_userInputWindow) { ReleaseWindow(m_userInputWindow); m_userInputWindow = NULL; } #endif delete m_keyState; delete m_screensaver; throw; } // install event handlers EVENTQUEUE->adoptHandler(CEvent::kSystem, IEventQueue::getSystemTarget(), new TMethodEventJob(this, &COSXScreen::handleSystemEvent)); // install the platform event queue EVENTQUEUE->adoptBuffer(new COSXEventQueueBuffer); } COSXScreen::~COSXScreen() { disable(); EVENTQUEUE->adoptBuffer(NULL); EVENTQUEUE->removeHandler(CEvent::kSystem, IEventQueue::getSystemTarget()); if (m_pmWatchThread) { // make sure the thread has setup the runloop. { CLock lock(m_pmMutex); while (!(bool)*m_pmThreadReady) { m_pmThreadReady->wait(); } } // now exit the thread's runloop and wait for it to exit LOG((CLOG_DEBUG "stopping watchSystemPowerThread")); CFRunLoopStop(m_pmRunloop); m_pmWatchThread->wait(); delete m_pmWatchThread; m_pmWatchThread = NULL; } delete m_pmThreadReady; delete m_pmMutex; EVENTQUEUE->removeHandler(COSXScreen::getConfirmSleepEvent(), getEventTarget()); RemoveEventHandler(m_switchEventHandlerRef); #if defined(MAC_OS_X_VERSION_10_5) CGDisplayRemoveReconfigurationCallback(displayReconfigurationCallback, this); #else DMRemoveExtendedNotifyProc(m_displayManagerNotificationUPP, NULL, &m_PSN, 0); if (m_hiddenWindow) { ReleaseWindow(m_hiddenWindow); m_hiddenWindow = NULL; } if (m_userInputWindow) { ReleaseWindow(m_userInputWindow); m_userInputWindow = NULL; } #endif delete m_keyState; delete m_screensaver; } void* COSXScreen::getEventTarget() const { return const_cast(this); } bool COSXScreen::getClipboard(ClipboardID, IClipboard* dst) const { CClipboard::copy(dst, &m_pasteboard); return true; } void COSXScreen::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { x = m_x; y = m_y; w = m_w; h = m_h; } void COSXScreen::getCursorPos(SInt32& x, SInt32& y) const { Point mouse; GetGlobalMouse(&mouse); x = mouse.h; y = mouse.v; m_cursorPosValid = true; m_xCursor = x; m_yCursor = y; } void COSXScreen::reconfigure(UInt32) { // do nothing } void COSXScreen::warpCursor(SInt32 x, SInt32 y) { // move cursor without generating events CGPoint pos; pos.x = x; pos.y = y; CGWarpMouseCursorPosition(pos); // save new cursor position m_xCursor = x; m_yCursor = y; m_cursorPosValid = true; } void COSXScreen::fakeInputBegin() { // FIXME -- not implemented } void COSXScreen::fakeInputEnd() { // FIXME -- not implemented } SInt32 COSXScreen::getJumpZoneSize() const { return 1; } bool COSXScreen::isAnyMouseButtonDown() const { return (GetCurrentButtonState() != 0); } void COSXScreen::getCursorCenter(SInt32& x, SInt32& y) const { x = m_xCenter; y = m_yCenter; } UInt32 COSXScreen::registerHotKey(KeyID key, KeyModifierMask mask) { // get mac virtual key and modifier mask matching synergy key and mask UInt32 macKey, macMask; if (!m_keyState->mapSynergyHotKeyToMac(key, mask, macKey, macMask)) { LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } // choose hotkey id UInt32 id; if (!m_oldHotKeyIDs.empty()) { id = m_oldHotKeyIDs.back(); m_oldHotKeyIDs.pop_back(); } else { id = m_hotKeys.size() + 1; } // if this hot key has modifiers only then we'll handle it specially EventHotKeyRef ref = NULL; bool okay; if (key == kKeyNone) { if (m_modifierHotKeys.count(mask) > 0) { // already registered okay = false; } else { m_modifierHotKeys[mask] = id; okay = true; } } else { EventHotKeyID hkid = { 'SNRG', (UInt32)id }; OSStatus status = RegisterEventHotKey(macKey, macMask, hkid, GetApplicationEventTarget(), 0, &ref); okay = (status == noErr); m_hotKeyToIDMap[CHotKeyItem(macKey, macMask)] = id; } if (!okay) { m_oldHotKeyIDs.push_back(id); m_hotKeyToIDMap.erase(CHotKeyItem(macKey, macMask)); LOG((CLOG_WARN "failed to register hotkey %s (id=%04x mask=%04x)", CKeyMap::formatKey(key, mask).c_str(), key, mask)); return 0; } m_hotKeys.insert(std::make_pair(id, CHotKeyItem(ref, macKey, macMask))); LOG((CLOG_DEBUG "registered hotkey %s (id=%04x mask=%04x) as id=%d", CKeyMap::formatKey(key, mask).c_str(), key, mask, id)); return id; } void COSXScreen::unregisterHotKey(UInt32 id) { // look up hotkey HotKeyMap::iterator i = m_hotKeys.find(id); if (i == m_hotKeys.end()) { return; } // unregister with OS bool okay; if (i->second.getRef() != NULL) { okay = (UnregisterEventHotKey(i->second.getRef()) == noErr); } else { okay = false; // XXX -- this is inefficient for (ModifierHotKeyMap::iterator j = m_modifierHotKeys.begin(); j != m_modifierHotKeys.end(); ++j) { if (j->second == id) { m_modifierHotKeys.erase(j); okay = true; break; } } } if (!okay) { LOG((CLOG_WARN "failed to unregister hotkey id=%d", id)); } else { LOG((CLOG_DEBUG "unregistered hotkey id=%d", id)); } // discard hot key from map and record old id for reuse m_hotKeyToIDMap.erase(i->second); m_hotKeys.erase(i); m_oldHotKeyIDs.push_back(id); if (m_activeModifierHotKey == id) { m_activeModifierHotKey = 0; m_activeModifierHotKeyMask = 0; } } void COSXScreen::constructMouseButtonEventMap() { const CGEventType source[NumButtonIDs][3] = { kCGEventLeftMouseUp,kCGEventLeftMouseDragged,kCGEventLeftMouseDown, kCGEventOtherMouseUp,kCGEventOtherMouseDragged,kCGEventOtherMouseDown, kCGEventRightMouseUp,kCGEventRightMouseDragged,kCGEventRightMouseDown, kCGEventOtherMouseUp,kCGEventOtherMouseDragged,kCGEventOtherMouseDown, kCGEventOtherMouseUp,kCGEventOtherMouseDragged,kCGEventOtherMouseDown}; for (UInt16 button = 0; button < NumButtonIDs; button++) { MouseButtonEventMapType new_map; for (UInt16 state = (UInt32) kMouseButtonUp; state < kMouseButtonStateMax; state++) { CGEventType curEvent = source[button][state]; new_map[state] = curEvent; } MouseButtonEventMap[button] = new_map; } } void COSXScreen::postMouseEvent(CGPoint& pos) const { // check if cursor position is valid on the client display configuration // stkamp@users.sourceforge.net CGDisplayCount displayCount = 0; CGGetDisplaysWithPoint(pos, 0, NULL, &displayCount); if (displayCount == 0) { // cursor position invalid - clamp to bounds of last valid display. // find the last valid display using the last cursor position. displayCount = 0; CGDirectDisplayID displayID; CGGetDisplaysWithPoint(CGPointMake(m_xCursor, m_yCursor), 1, &displayID, &displayCount); if (displayCount != 0) { CGRect displayRect = CGDisplayBounds(displayID); if (pos.x < displayRect.origin.x) { pos.x = displayRect.origin.x; } else if (pos.x > displayRect.origin.x + displayRect.size.width - 1) { pos.x = displayRect.origin.x + displayRect.size.width - 1; } if (pos.y < displayRect.origin.y) { pos.y = displayRect.origin.y; } else if (pos.y > displayRect.origin.y + displayRect.size.height - 1) { pos.y = displayRect.origin.y + displayRect.size.height - 1; } } } CGEventType type = kCGEventMouseMoved; SInt8 button = m_buttonState.getFirstButtonDown(); if (button != -1) { MouseButtonEventMapType thisButtonType = MouseButtonEventMap[button]; type = thisButtonType[kMouseButtonDragged]; } CGEventRef event = CGEventCreateMouseEvent(NULL, type, pos, button); CGEventPost(kCGHIDEventTap, event); CFRelease(event); } void COSXScreen::fakeMouseButton(ButtonID id, bool press) { NXEventHandle handle = NXOpenEventStatus(); double clickTime = NXClickTime(handle); if ((ARCH->time() - m_lastDoubleClick) <= clickTime) { // drop all down and up fakes immedately after a double click. // TODO: perhaps there is a better way to do this, usually in // finder, if you tripple click a folder, it will open it and // then select a folder under the cursor -- and perhaps other // strange behaviour might happen? LOG((CLOG_DEBUG1 "dropping mouse button %s", press ? "press" : "release")); return; } // Buttons are indexed from one, but the button down array is indexed from zero UInt32 index = id - kButtonLeft; if (index >= NumButtonIDs) { return; } CGPoint pos; if (!m_cursorPosValid) { SInt32 x, y; getCursorPos(x, y); } pos.x = m_xCursor; pos.y = m_yCursor; // variable used to detect mouse coordinate differences between // old & new mouse clicks. Used in double click detection. SInt32 xDiff = m_xCursor - m_lastSingleClickXCursor; SInt32 yDiff = m_yCursor - m_lastSingleClickYCursor; double diff = sqrt(xDiff * xDiff + yDiff * yDiff); // max sqrt(x^2 + y^2) difference allowed to double click // since we don't have double click distance in NX APIs // we define our own defaults. const double maxDiff = sqrt(2) + 0.0001; if (press && (id == kButtonLeft) && ((ARCH->time() - m_lastSingleClick) <= clickTime) && diff <= maxDiff) { LOG((CLOG_DEBUG1 "faking mouse left double click")); // finder does not seem to detect double clicks from two separate // CGEventCreateMouseEvent calls. so, if we detect a double click we // use CGEventSetIntegerValueField to tell the OS. // // the caveat here is that findor will see this as a single click // followed by a double click (even though there should be only a // double click). this may cause weird behaviour in other apps. // // for some reason using the old CGPostMouseEvent function, doesn't // cause double clicks (though i'm sure it did work at some point). CGEventRef event = CGEventCreateMouseEvent( NULL, kCGEventLeftMouseDown, pos, kCGMouseButtonLeft); CGEventSetIntegerValueField(event, kCGMouseEventClickState, 2); m_buttonState.set(index, kMouseButtonDown); CGEventPost(kCGHIDEventTap, event); CGEventSetType(event, kCGEventLeftMouseUp); m_buttonState.set(index, kMouseButtonUp); CGEventPost(kCGHIDEventTap, event); CFRelease(event); m_lastDoubleClick = ARCH->time(); } else { // ... otherwise, perform a single press or release as normal. MouseButtonState state = press ? kMouseButtonDown : kMouseButtonUp; LOG((CLOG_DEBUG1 "faking mouse button %s", press ? "press" : "release")); MouseButtonEventMapType thisButtonMap = MouseButtonEventMap[index]; CGEventType type = thisButtonMap[state]; CGEventRef event = CGEventCreateMouseEvent(NULL, type, pos, index); m_buttonState.set(index, state); CGEventPost(kCGHIDEventTap, event); CFRelease(event); m_lastSingleClick = ARCH->time(); m_lastSingleClickXCursor = m_xCursor; m_lastSingleClickYCursor = m_yCursor; } } void COSXScreen::fakeMouseMove(SInt32 x, SInt32 y) const { // synthesize event CGPoint pos; pos.x = x; pos.y = y; postMouseEvent(pos); // save new cursor position m_xCursor = static_cast(pos.x); m_yCursor = static_cast(pos.y); m_cursorPosValid = true; } void COSXScreen::fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const { // OS X does not appear to have a fake relative mouse move function. // simulate it by getting the current mouse position and adding to // that. this can yield the wrong answer but there's not much else // we can do. // get current position Point oldPos; GetGlobalMouse(&oldPos); // synthesize event CGPoint pos; m_xCursor = static_cast(oldPos.h); m_yCursor = static_cast(oldPos.v); pos.x = oldPos.h + dx; pos.y = oldPos.v + dy; postMouseEvent(pos); // we now assume we don't know the current cursor position m_cursorPosValid = false; } void COSXScreen::fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const { if (xDelta != 0 || yDelta != 0) { #if defined(MAC_OS_X_VERSION_10_5) // create a scroll event, post it and release it. not sure if kCGScrollEventUnitLine // is the right choice here over kCGScrollEventUnitPixel CGEventRef scrollEvent = CGEventCreateScrollWheelEvent( NULL, kCGScrollEventUnitLine, 2, mapScrollWheelFromSynergy(yDelta), -mapScrollWheelFromSynergy(xDelta)); CGEventPost(kCGHIDEventTap, scrollEvent); CFRelease(scrollEvent); #else CGPostScrollWheelEvent( 2, mapScrollWheelFromSynergy(yDelta), -mapScrollWheelFromSynergy(xDelta)); #endif } } void COSXScreen::showCursor() { LOG((CLOG_DEBUG "showing cursor")); CFStringRef propertyString = CFStringCreateWithCString( NULL, "SetsCursorInBackground", kCFStringEncodingMacRoman); CGSSetConnectionProperty( _CGSDefaultConnection(), _CGSDefaultConnection(), propertyString, kCFBooleanTrue); CFRelease(propertyString); CGError error = CGDisplayShowCursor(m_displayID); if (error != kCGErrorSuccess) { LOG((CLOG_ERR "failed to show cursor, error=%d", error)); } // appears to fix "mouse randomly not showing" bug CGAssociateMouseAndMouseCursorPosition(true); if (!CGCursorIsVisible()) { LOG((CLOG_WARN "cursor may not be visible")); } m_cursorHidden = false; } void COSXScreen::hideCursor() { LOG((CLOG_DEBUG "hiding cursor")); CFStringRef propertyString = CFStringCreateWithCString( NULL, "SetsCursorInBackground", kCFStringEncodingMacRoman); CGSSetConnectionProperty( _CGSDefaultConnection(), _CGSDefaultConnection(), propertyString, kCFBooleanTrue); CFRelease(propertyString); CGError error = CGDisplayHideCursor(m_displayID); if (error != kCGErrorSuccess) { LOG((CLOG_ERR "failed to hide cursor, error=%d", error)); } // appears to fix "mouse randomly not hiding" bug CGAssociateMouseAndMouseCursorPosition(true); if (CGCursorIsVisible()) { LOG((CLOG_WARN "cursor may be still visible")); } m_cursorHidden = true; } void COSXScreen::enable() { // watch the clipboard m_clipboardTimer = EVENTQUEUE->newTimer(1.0, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_clipboardTimer, new TMethodEventJob(this, &COSXScreen::handleClipboardCheck)); if (m_isPrimary) { // FIXME -- start watching jump zones // kCGEventTapOptionDefault = 0x00000000 (Missing in 10.4, so specified literally) m_eventTapPort = CGEventTapCreate(kCGHIDEventTap, kCGHeadInsertEventTap, 0, kCGEventMaskForAllEvents, handleCGInputEvent, this); } else { // FIXME -- prevent system from entering power save mode if (m_autoShowHideCursor) { hideCursor(); } // warp the mouse to the cursor center fakeMouseMove(m_xCenter, m_yCenter); // there may be a better way to do this, but we register an event handler even if we're // not on the primary display (acting as a client). This way, if a local event comes in // (either keyboard or mouse), we can make sure to show the cursor if we've hidden it. m_eventTapPort = CGEventTapCreate(kCGHIDEventTap, kCGHeadInsertEventTap, 0, kCGEventMaskForAllEvents, handleCGInputEventSecondary, this); } if (!m_eventTapPort) { LOG((CLOG_ERR "failed to create quartz event tap")); } m_eventTapRLSR = CFMachPortCreateRunLoopSource(kCFAllocatorDefault, m_eventTapPort, 0); if (!m_eventTapRLSR) { LOG((CLOG_ERR "failed to create a CFRunLoopSourceRef for the quartz event tap")); } CFRunLoopAddSource(CFRunLoopGetCurrent(), m_eventTapRLSR, kCFRunLoopDefaultMode); } void COSXScreen::disable() { if (m_autoShowHideCursor) { showCursor(); } // FIXME -- stop watching jump zones, stop capturing input if (m_eventTapRLSR) { CFRelease(m_eventTapRLSR); m_eventTapRLSR = nullptr; } if (m_eventTapPort) { CFRelease(m_eventTapPort); m_eventTapPort = nullptr; } // FIXME -- allow system to enter power saving mode // disable drag handling m_dragNumButtonsDown = 0; enableDragTimer(false); // uninstall clipboard timer if (m_clipboardTimer != NULL) { EVENTQUEUE->removeHandler(CEvent::kTimer, m_clipboardTimer); EVENTQUEUE->deleteTimer(m_clipboardTimer); m_clipboardTimer = NULL; } m_isOnScreen = m_isPrimary; } void COSXScreen::enter() { showCursor(); if (m_isPrimary) { CGSetLocalEventsSuppressionInterval(0.0); // enable global hotkeys //setGlobalHotKeysEnabled(true); } else { // reset buttons m_buttonState.reset(); // avoid suppression of local hardware events // stkamp@users.sourceforge.net CGSetLocalEventsFilterDuringSupressionState( kCGEventFilterMaskPermitAllEvents, kCGEventSupressionStateSupressionInterval); CGSetLocalEventsFilterDuringSupressionState( (kCGEventFilterMaskPermitLocalKeyboardEvents | kCGEventFilterMaskPermitSystemDefinedEvents), kCGEventSupressionStateRemoteMouseDrag); } // now on screen m_isOnScreen = true; } bool COSXScreen::leave() { hideCursor(); if (m_isPrimary) { // warp to center //warpCursor(m_xCenter, m_yCenter); // This used to be necessary to get smooth mouse motion on other screens, // but now is just to avoid a hesitating cursor when transitioning to // the primary (this) screen. CGSetLocalEventsSuppressionInterval(0.0001); // disable global hotkeys //setGlobalHotKeysEnabled(false); } else { // warp the mouse to the cursor center //fakeMouseMove(m_xCenter, m_yCenter); // FIXME -- prepare to show cursor if it moves // take keyboard focus // FIXME } // now off screen m_isOnScreen = false; return true; } bool COSXScreen::setClipboard(ClipboardID, const IClipboard* src) { if(src != NULL) { LOG((CLOG_DEBUG "setting clipboard")); CClipboard::copy(&m_pasteboard, src); } return true; } void COSXScreen::checkClipboards() { LOG((CLOG_DEBUG2 "checking clipboard")); if (m_pasteboard.synchronize()) { LOG((CLOG_DEBUG "clipboard changed")); sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardClipboard); sendClipboardEvent(getClipboardGrabbedEvent(), kClipboardSelection); } } void COSXScreen::openScreensaver(bool notify) { m_screensaverNotify = notify; if (!m_screensaverNotify) { m_screensaver->disable(); } } void COSXScreen::closeScreensaver() { if (!m_screensaverNotify) { m_screensaver->enable(); } } void COSXScreen::screensaver(bool activate) { if (activate) { m_screensaver->activate(); } else { m_screensaver->deactivate(); } } void COSXScreen::resetOptions() { // no options } void COSXScreen::setOptions(const COptionsList&) { // no options } void COSXScreen::setSequenceNumber(UInt32 seqNum) { m_sequenceNumber = seqNum; } bool COSXScreen::isPrimary() const { return m_isPrimary; } void COSXScreen::sendEvent(CEvent::Type type, void* data) const { EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), data)); } void COSXScreen::sendClipboardEvent(CEvent::Type type, ClipboardID id) const { CClipboardInfo* info = (CClipboardInfo*)malloc(sizeof(CClipboardInfo)); info->m_id = id; info->m_sequenceNumber = m_sequenceNumber; sendEvent(type, info); } void COSXScreen::handleSystemEvent(const CEvent& event, void*) { EventRef* carbonEvent = reinterpret_cast(event.getData()); assert(carbonEvent != NULL); UInt32 eventClass = GetEventClass(*carbonEvent); switch (eventClass) { case kEventClassMouse: switch (GetEventKind(*carbonEvent)) { case kSynergyEventMouseScroll: { OSStatus r; long xScroll; long yScroll; // get scroll amount r = GetEventParameter(*carbonEvent, kSynergyMouseScrollAxisX, typeLongInteger, NULL, sizeof(xScroll), NULL, &xScroll); if (r != noErr) { xScroll = 0; } r = GetEventParameter(*carbonEvent, kSynergyMouseScrollAxisY, typeLongInteger, NULL, sizeof(yScroll), NULL, &yScroll); if (r != noErr) { yScroll = 0; } if (xScroll != 0 || yScroll != 0) { onMouseWheel(-mapScrollWheelToSynergy(xScroll), mapScrollWheelToSynergy(yScroll)); } } } break; case kEventClassKeyboard: switch (GetEventKind(*carbonEvent)) { case kEventHotKeyPressed: case kEventHotKeyReleased: onHotKey(*carbonEvent); break; } break; case kEventClassWindow: SendEventToWindow(*carbonEvent, m_userInputWindow); switch (GetEventKind(*carbonEvent)) { case kEventWindowActivated: LOG((CLOG_DEBUG1 "window activated")); break; case kEventWindowDeactivated: LOG((CLOG_DEBUG1 "window deactivated")); break; case kEventWindowFocusAcquired: LOG((CLOG_DEBUG1 "focus acquired")); break; case kEventWindowFocusRelinquish: LOG((CLOG_DEBUG1 "focus released")); break; } break; default: SendEventToEventTarget(*carbonEvent, GetEventDispatcherTarget()); break; } } bool COSXScreen::onMouseMove(SInt32 mx, SInt32 my) { LOG((CLOG_DEBUG2 "mouse move %+d,%+d", mx, my)); SInt32 x = mx - m_xCursor; SInt32 y = my - m_yCursor; if ((x == 0 && y == 0) || (mx == m_xCenter && mx == m_yCenter)) { return true; } // save position to compute delta of next motion m_xCursor = mx; m_yCursor = my; if (m_isOnScreen) { // motion on primary screen sendEvent(getMotionOnPrimaryEvent(), CMotionInfo::alloc(m_xCursor, m_yCursor)); } else { // motion on secondary screen. warp mouse back to // center. warpCursor(m_xCenter, m_yCenter); // examine the motion. if it's about the distance // from the center of the screen to an edge then // it's probably a bogus motion that we want to // ignore (see warpCursorNoFlush() for a further // description). static SInt32 bogusZoneSize = 10; if (-x + bogusZoneSize > m_xCenter - m_x || x + bogusZoneSize > m_x + m_w - m_xCenter || -y + bogusZoneSize > m_yCenter - m_y || y + bogusZoneSize > m_y + m_h - m_yCenter) { LOG((CLOG_DEBUG "dropped bogus motion %+d,%+d", x, y)); } else { // send motion sendEvent(getMotionOnSecondaryEvent(), CMotionInfo::alloc(x, y)); } } return true; } bool COSXScreen::onMouseButton(bool pressed, UInt16 macButton) { // Buttons 2 and 3 are inverted on the mac ButtonID button = mapMacButtonToSynergy(macButton); if (pressed) { LOG((CLOG_DEBUG1 "event: button press button=%d", button)); if (button != kButtonNone) { KeyModifierMask mask = m_keyState->getActiveModifiers(); sendEvent(getButtonDownEvent(), CButtonInfo::alloc(button, mask)); } } else { LOG((CLOG_DEBUG1 "event: button release button=%d", button)); if (button != kButtonNone) { KeyModifierMask mask = m_keyState->getActiveModifiers(); sendEvent(getButtonUpEvent(), CButtonInfo::alloc(button, mask)); } } // handle drags with any button other than button 1 or 2 if (macButton > 2) { if (pressed) { // one more button if (m_dragNumButtonsDown++ == 0) { enableDragTimer(true); } } else { // one less button if (--m_dragNumButtonsDown == 0) { enableDragTimer(false); } } } return true; } bool COSXScreen::onMouseWheel(SInt32 xDelta, SInt32 yDelta) const { LOG((CLOG_DEBUG1 "event: button wheel delta=%+d,%+d", xDelta, yDelta)); sendEvent(getWheelEvent(), CWheelInfo::alloc(xDelta, yDelta)); return true; } void COSXScreen::handleClipboardCheck(const CEvent&, void*) { checkClipboards(); } #if !defined(MAC_OS_X_VERSION_10_5) pascal void COSXScreen::displayManagerCallback(void* inUserData, SInt16 inMessage, void*) { COSXScreen* screen = (COSXScreen*)inUserData; if (inMessage == kDMNotifyEvent) { screen->onDisplayChange(); } } bool COSXScreen::onDisplayChange() { // screen resolution may have changed. save old shape. SInt32 xOld = m_x, yOld = m_y, wOld = m_w, hOld = m_h; // update shape updateScreenShape(); // do nothing if resolution hasn't changed if (xOld != m_x || yOld != m_y || wOld != m_w || hOld != m_h) { if (m_isPrimary) { // warp mouse to center if off screen if (!m_isOnScreen) { warpCursor(m_xCenter, m_yCenter); } } // send new screen info sendEvent(getShapeChangedEvent()); } return true; } #else void COSXScreen::displayReconfigurationCallback(CGDirectDisplayID displayID, CGDisplayChangeSummaryFlags flags, void* inUserData) { COSXScreen* screen = (COSXScreen*)inUserData; // Closing or opening the lid when an external monitor is // connected causes an kCGDisplayBeginConfigurationFlag event CGDisplayChangeSummaryFlags mask = kCGDisplayBeginConfigurationFlag | kCGDisplayMovedFlag | kCGDisplaySetModeFlag | kCGDisplayAddFlag | kCGDisplayRemoveFlag | kCGDisplayEnabledFlag | kCGDisplayDisabledFlag | kCGDisplayMirrorFlag | kCGDisplayUnMirrorFlag | kCGDisplayDesktopShapeChangedFlag; LOG((CLOG_DEBUG1 "event: display was reconfigured: %x %x %x", flags, mask, flags & mask)); if (flags & mask) { /* Something actually did change */ LOG((CLOG_DEBUG1 "event: screen changed shape; refreshing dimensions")); screen->updateScreenShape(displayID, flags); } } #endif bool COSXScreen::onKey(CGEventRef event) { CGEventType eventKind = CGEventGetType(event); // get the key and active modifiers UInt32 virtualKey = CGEventGetIntegerValueField(event, kCGKeyboardEventKeycode); CGEventFlags macMask = CGEventGetFlags(event); LOG((CLOG_DEBUG1 "event: Key event kind: %d, keycode=%d", eventKind, virtualKey)); // Special handling to track state of modifiers if (eventKind == kCGEventFlagsChanged) { // get old and new modifier state KeyModifierMask oldMask = getActiveModifiers(); KeyModifierMask newMask = m_keyState->mapModifiersFromOSX(macMask); m_keyState->handleModifierKeys(getEventTarget(), oldMask, newMask); // if the current set of modifiers exactly matches a modifiers-only // hot key then generate a hot key down event. if (m_activeModifierHotKey == 0) { if (m_modifierHotKeys.count(newMask) > 0) { m_activeModifierHotKey = m_modifierHotKeys[newMask]; m_activeModifierHotKeyMask = newMask; EVENTQUEUE->addEvent(CEvent(getHotKeyDownEvent(), getEventTarget(), CHotKeyInfo::alloc(m_activeModifierHotKey))); } } // if a modifiers-only hot key is active and should no longer be // then generate a hot key up event. else if (m_activeModifierHotKey != 0) { KeyModifierMask mask = (newMask & m_activeModifierHotKeyMask); if (mask != m_activeModifierHotKeyMask) { EVENTQUEUE->addEvent(CEvent(getHotKeyUpEvent(), getEventTarget(), CHotKeyInfo::alloc(m_activeModifierHotKey))); m_activeModifierHotKey = 0; m_activeModifierHotKeyMask = 0; } } return true; } // check for hot key. when we're on a secondary screen we disable // all hotkeys so we can capture the OS defined hot keys as regular // keystrokes but that means we don't get our own hot keys either. // so we check for a key/modifier match in our hot key map. if (!m_isOnScreen) { HotKeyToIDMap::const_iterator i = m_hotKeyToIDMap.find(CHotKeyItem(virtualKey, m_keyState->mapModifiersToCarbon(macMask) & 0xff00u)); if (i != m_hotKeyToIDMap.end()) { UInt32 id = i->second; // determine event type CEvent::Type type; //UInt32 eventKind = GetEventKind(event); if (eventKind == kCGEventKeyDown) { type = getHotKeyDownEvent(); } else if (eventKind == kCGEventKeyUp) { type = getHotKeyUpEvent(); } else { return false; } EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), CHotKeyInfo::alloc(id))); return true; } } // decode event type bool down = (eventKind == kCGEventKeyDown); bool up = (eventKind == kCGEventKeyUp); bool isRepeat = (CGEventGetIntegerValueField(event, kCGKeyboardEventAutorepeat) == 1); // map event to keys KeyModifierMask mask; COSXKeyState::CKeyIDs keys; KeyButton button = m_keyState->mapKeyFromEvent(keys, &mask, event); if (button == 0) { return false; } // check for AltGr in mask. if set we send neither the AltGr nor // the super modifiers to clients then remove AltGr before passing // the modifiers to onKey. KeyModifierMask sendMask = (mask & ~KeyModifierAltGr); if ((mask & KeyModifierAltGr) != 0) { sendMask &= ~KeyModifierSuper; } mask &= ~KeyModifierAltGr; // update button state if (down) { m_keyState->onKey(button, true, mask); } else if (up) { if (!m_keyState->isKeyDown(button)) { // up event for a dead key. throw it away. return false; } m_keyState->onKey(button, false, mask); } // send key events for (COSXKeyState::CKeyIDs::const_iterator i = keys.begin(); i != keys.end(); ++i) { m_keyState->sendKeyEvent(getEventTarget(), down, isRepeat, *i, sendMask, 1, button); } return true; } bool COSXScreen::onHotKey(EventRef event) const { // get the hotkey id EventHotKeyID hkid; GetEventParameter(event, kEventParamDirectObject, typeEventHotKeyID, NULL, sizeof(EventHotKeyID), NULL, &hkid); UInt32 id = hkid.id; // determine event type CEvent::Type type; UInt32 eventKind = GetEventKind(event); if (eventKind == kEventHotKeyPressed) { type = getHotKeyDownEvent(); } else if (eventKind == kEventHotKeyReleased) { type = getHotKeyUpEvent(); } else { return false; } EVENTQUEUE->addEvent(CEvent(type, getEventTarget(), CHotKeyInfo::alloc(id))); return true; } ButtonID COSXScreen::mapMacButtonToSynergy(UInt16 macButton) const { switch (macButton) { case 1: return kButtonLeft; case 2: return kButtonRight; case 3: return kButtonMiddle; } return static_cast(macButton); } SInt32 COSXScreen::mapScrollWheelToSynergy(SInt32 x) const { // return accelerated scrolling but not exponentially scaled as it is // on the mac. double d = (1.0 + getScrollSpeed()) * x / getScrollSpeedFactor(); return static_cast(120.0 * d); } SInt32 COSXScreen::mapScrollWheelFromSynergy(SInt32 x) const { // use server's acceleration with a little boost since other platforms // take one wheel step as a larger step than the mac does. return static_cast(3.0 * x / 120.0); } double COSXScreen::getScrollSpeed() const { double scaling = 0.0; CFPropertyListRef pref = ::CFPreferencesCopyValue( CFSTR("com.apple.scrollwheel.scaling") , kCFPreferencesAnyApplication, kCFPreferencesCurrentUser, kCFPreferencesAnyHost); if (pref != NULL) { CFTypeID id = CFGetTypeID(pref); if (id == CFNumberGetTypeID()) { CFNumberRef value = static_cast(pref); if (CFNumberGetValue(value, kCFNumberDoubleType, &scaling)) { if (scaling < 0.0) { scaling = 0.0; } } } CFRelease(pref); } return scaling; } double COSXScreen::getScrollSpeedFactor() const { return pow(10.0, getScrollSpeed()); } void COSXScreen::enableDragTimer(bool enable) { UInt32 modifiers; MouseTrackingResult res; if (enable && m_dragTimer == NULL) { m_dragTimer = EVENTQUEUE->newTimer(0.01, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_dragTimer, new TMethodEventJob(this, &COSXScreen::handleDrag)); TrackMouseLocationWithOptions(NULL, 0, 0, &m_dragLastPoint, &modifiers, &res); } else if (!enable && m_dragTimer != NULL) { EVENTQUEUE->removeHandler(CEvent::kTimer, m_dragTimer); EVENTQUEUE->deleteTimer(m_dragTimer); m_dragTimer = NULL; } } void COSXScreen::handleDrag(const CEvent&, void*) { Point p; UInt32 modifiers; MouseTrackingResult res; TrackMouseLocationWithOptions(NULL, 0, 0, &p, &modifiers, &res); if (res != kMouseTrackingTimedOut && (p.h != m_dragLastPoint.h || p.v != m_dragLastPoint.v)) { m_dragLastPoint = p; onMouseMove((SInt32)p.h, (SInt32)p.v); } } void COSXScreen::updateButtons() { UInt32 buttons = GetCurrentButtonState(); m_buttonState.overwrite(buttons); } IKeyState* COSXScreen::getKeyState() const { return m_keyState; } void COSXScreen::updateScreenShape(const CGDirectDisplayID, const CGDisplayChangeSummaryFlags flags) { updateScreenShape(); } void COSXScreen::updateScreenShape() { // get info for each display CGDisplayCount displayCount = 0; if (CGGetActiveDisplayList(0, NULL, &displayCount) != CGDisplayNoErr) { return; } if (displayCount == 0) { return; } CGDirectDisplayID* displays = new CGDirectDisplayID[displayCount]; if (displays == NULL) { return; } if (CGGetActiveDisplayList(displayCount, displays, &displayCount) != CGDisplayNoErr) { delete[] displays; return; } // get smallest rect enclosing all display rects CGRect totalBounds = CGRectZero; for (CGDisplayCount i = 0; i < displayCount; ++i) { CGRect bounds = CGDisplayBounds(displays[i]); totalBounds = CGRectUnion(totalBounds, bounds); } // get shape of default screen m_x = (SInt32)totalBounds.origin.x; m_y = (SInt32)totalBounds.origin.y; m_w = (SInt32)totalBounds.size.width; m_h = (SInt32)totalBounds.size.height; // get center of default screen CGDirectDisplayID main = CGMainDisplayID(); const CGRect rect = CGDisplayBounds(main); m_xCenter = (rect.origin.x + rect.size.width) / 2; m_yCenter = (rect.origin.y + rect.size.height) / 2; delete[] displays; // We want to notify the peer screen whether we are primary screen or not sendEvent(getShapeChangedEvent()); LOG((CLOG_DEBUG "screen shape: center=%d,%d size=%dx%d on %u %s", m_x, m_y, m_w, m_h, displayCount, (displayCount == 1) ? "display" : "displays")); } #pragma mark - // // FAST USER SWITCH NOTIFICATION SUPPORT // // COSXScreen::userSwitchCallback(void*) // // gets called if a fast user switch occurs // pascal OSStatus COSXScreen::userSwitchCallback(EventHandlerCallRef nextHandler, EventRef theEvent, void* inUserData) { COSXScreen* screen = (COSXScreen*)inUserData; UInt32 kind = GetEventKind(theEvent); if (kind == kEventSystemUserSessionDeactivated) { LOG((CLOG_DEBUG "user session deactivated")); EVENTQUEUE->addEvent(CEvent(IScreen::getSuspendEvent(), screen->getEventTarget())); } else if (kind == kEventSystemUserSessionActivated) { LOG((CLOG_DEBUG "user session activated")); EVENTQUEUE->addEvent(CEvent(IScreen::getResumeEvent(), screen->getEventTarget())); } return (CallNextEventHandler(nextHandler, theEvent)); } #pragma mark - // // SLEEP/WAKEUP NOTIFICATION SUPPORT // // COSXScreen::watchSystemPowerThread(void*) // // main of thread monitoring system power (sleep/wakup) using a CFRunLoop // void COSXScreen::watchSystemPowerThread(void*) { io_object_t notifier; IONotificationPortRef notificationPortRef; CFRunLoopSourceRef runloopSourceRef = 0; m_pmRunloop = CFRunLoopGetCurrent(); // install system power change callback m_pmRootPort = IORegisterForSystemPower(this, ¬ificationPortRef, powerChangeCallback, ¬ifier); if (m_pmRootPort == 0) { LOG((CLOG_WARN "IORegisterForSystemPower failed")); } else { runloopSourceRef = IONotificationPortGetRunLoopSource(notificationPortRef); CFRunLoopAddSource(m_pmRunloop, runloopSourceRef, kCFRunLoopCommonModes); } // thread is ready { CLock lock(m_pmMutex); *m_pmThreadReady = true; m_pmThreadReady->signal(); } // if we were unable to initialize then exit. we must do this after // setting m_pmThreadReady to true otherwise the parent thread will // block waiting for it. if (m_pmRootPort == 0) { return; } // start the run loop LOG((CLOG_DEBUG "started watchSystemPowerThread")); CFRunLoopRun(); // cleanup if (notificationPortRef) { CFRunLoopRemoveSource(m_pmRunloop, runloopSourceRef, kCFRunLoopDefaultMode); CFRunLoopSourceInvalidate(runloopSourceRef); CFRelease(runloopSourceRef); } CLock lock(m_pmMutex); IODeregisterForSystemPower(¬ifier); m_pmRootPort = 0; LOG((CLOG_DEBUG "stopped watchSystemPowerThread")); } void COSXScreen::powerChangeCallback(void* refcon, io_service_t service, natural_t messageType, void* messageArg) { ((COSXScreen*)refcon)->handlePowerChangeRequest(messageType, messageArg); } void COSXScreen::handlePowerChangeRequest(natural_t messageType, void* messageArg) { // we've received a power change notification switch (messageType) { case kIOMessageSystemWillSleep: // COSXScreen has to handle this in the main thread so we have to // queue a confirm sleep event here. we actually don't allow the // system to sleep until the event is handled. EVENTQUEUE->addEvent(CEvent(COSXScreen::getConfirmSleepEvent(), getEventTarget(), messageArg, CEvent::kDontFreeData)); return; case kIOMessageSystemHasPoweredOn: LOG((CLOG_DEBUG "system wakeup")); EVENTQUEUE->addEvent(CEvent(IScreen::getResumeEvent(), getEventTarget())); break; default: break; } CLock lock(m_pmMutex); if (m_pmRootPort != 0) { IOAllowPowerChange(m_pmRootPort, (long)messageArg); } } CEvent::Type COSXScreen::getConfirmSleepEvent() { return EVENTQUEUE->registerTypeOnce(s_confirmSleepEvent, "COSXScreen::confirmSleep"); } void COSXScreen::handleConfirmSleep(const CEvent& event, void*) { long messageArg = (long)event.getData(); if (messageArg != 0) { CLock lock(m_pmMutex); if (m_pmRootPort != 0) { // deliver suspend event immediately. EVENTQUEUE->addEvent(CEvent(IScreen::getSuspendEvent(), getEventTarget(), NULL, CEvent::kDeliverImmediately)); LOG((CLOG_DEBUG "system will sleep")); IOAllowPowerChange(m_pmRootPort, messageArg); } } } #pragma mark - // // GLOBAL HOTKEY OPERATING MODE SUPPORT (10.3) // // CoreGraphics private API (OSX 10.3) // Source: http://ichiro.nnip.org/osx/Cocoa/GlobalHotkey.html // // We load the functions dynamically because they're not available in // older SDKs. We don't use weak linking because we want users of // older SDKs to build an app that works on newer systems and older // SDKs will not provide the symbols. // // FIXME: This is hosed as of OS 10.5; patches to repair this are // a good thing. // #if 0 #ifdef __cplusplus extern "C" { #endif typedef int CGSConnection; typedef enum { CGSGlobalHotKeyEnable = 0, CGSGlobalHotKeyDisable = 1, } CGSGlobalHotKeyOperatingMode; extern CGSConnection _CGSDefaultConnection(void) WEAK_IMPORT_ATTRIBUTE; extern CGError CGSGetGlobalHotKeyOperatingMode(CGSConnection connection, CGSGlobalHotKeyOperatingMode *mode) WEAK_IMPORT_ATTRIBUTE; extern CGError CGSSetGlobalHotKeyOperatingMode(CGSConnection connection, CGSGlobalHotKeyOperatingMode mode) WEAK_IMPORT_ATTRIBUTE; typedef CGSConnection (*_CGSDefaultConnection_t)(void); typedef CGError (*CGSGetGlobalHotKeyOperatingMode_t)(CGSConnection connection, CGSGlobalHotKeyOperatingMode *mode); typedef CGError (*CGSSetGlobalHotKeyOperatingMode_t)(CGSConnection connection, CGSGlobalHotKeyOperatingMode mode); static _CGSDefaultConnection_t s__CGSDefaultConnection; static CGSGetGlobalHotKeyOperatingMode_t s_CGSGetGlobalHotKeyOperatingMode; static CGSSetGlobalHotKeyOperatingMode_t s_CGSSetGlobalHotKeyOperatingMode; #ifdef __cplusplus } #endif #define LOOKUP(name_) \ s_ ## name_ = NULL; \ if (NSIsSymbolNameDefinedWithHint("_" #name_, "CoreGraphics")) { \ s_ ## name_ = (name_ ## _t)NSAddressOfSymbol( \ NSLookupAndBindSymbolWithHint( \ "_" #name_, "CoreGraphics")); \ } bool COSXScreen::isGlobalHotKeyOperatingModeAvailable() { if (!s_testedForGHOM) { s_testedForGHOM = true; LOOKUP(_CGSDefaultConnection); LOOKUP(CGSGetGlobalHotKeyOperatingMode); LOOKUP(CGSSetGlobalHotKeyOperatingMode); s_hasGHOM = (s__CGSDefaultConnection != NULL && s_CGSGetGlobalHotKeyOperatingMode != NULL && s_CGSSetGlobalHotKeyOperatingMode != NULL); } return s_hasGHOM; } void COSXScreen::setGlobalHotKeysEnabled(bool enabled) { if (isGlobalHotKeyOperatingModeAvailable()) { CGSConnection conn = s__CGSDefaultConnection(); CGSGlobalHotKeyOperatingMode mode; s_CGSGetGlobalHotKeyOperatingMode(conn, &mode); if (enabled && mode == CGSGlobalHotKeyDisable) { s_CGSSetGlobalHotKeyOperatingMode(conn, CGSGlobalHotKeyEnable); } else if (!enabled && mode == CGSGlobalHotKeyEnable) { s_CGSSetGlobalHotKeyOperatingMode(conn, CGSGlobalHotKeyDisable); } } } bool COSXScreen::getGlobalHotKeysEnabled() { CGSGlobalHotKeyOperatingMode mode; if (isGlobalHotKeyOperatingModeAvailable()) { CGSConnection conn = s__CGSDefaultConnection(); s_CGSGetGlobalHotKeyOperatingMode(conn, &mode); } else { mode = CGSGlobalHotKeyEnable; } return (mode == CGSGlobalHotKeyEnable); } #endif // // COSXScreen::CHotKeyItem // COSXScreen::CHotKeyItem::CHotKeyItem(UInt32 keycode, UInt32 mask) : m_ref(NULL), m_keycode(keycode), m_mask(mask) { // do nothing } COSXScreen::CHotKeyItem::CHotKeyItem(EventHotKeyRef ref, UInt32 keycode, UInt32 mask) : m_ref(ref), m_keycode(keycode), m_mask(mask) { // do nothing } EventHotKeyRef COSXScreen::CHotKeyItem::getRef() const { return m_ref; } bool COSXScreen::CHotKeyItem::operator<(const CHotKeyItem& x) const { return (m_keycode < x.m_keycode || (m_keycode == x.m_keycode && m_mask < x.m_mask)); } // Quartz event tap support for the secondary display. This makes sure that we // will show the cursor if a local event comes in while synergy has the cursor // off the screen. CGEventRef COSXScreen::handleCGInputEventSecondary( CGEventTapProxy proxy, CGEventType type, CGEventRef event, void* refcon) { // this fix is really screwing with the correct show/hide behavior. it // should be tested better before reintroducing. return event; COSXScreen* screen = (COSXScreen*)refcon; if (screen->m_cursorHidden && type == kCGEventMouseMoved) { CGPoint pos = CGEventGetLocation(event); if (pos.x != screen->m_xCenter || pos.y != screen->m_yCenter) { LOG((CLOG_DEBUG "show cursor on secondary, type=%d pos=%d,%d", type, pos.x, pos.y)); screen->showCursor(); } } return event; } // Quartz event tap support CGEventRef COSXScreen::handleCGInputEvent(CGEventTapProxy proxy, CGEventType type, CGEventRef event, void* refcon) { COSXScreen* screen = (COSXScreen*)refcon; CGPoint pos; switch(type) { case kCGEventLeftMouseDown: case kCGEventRightMouseDown: case kCGEventOtherMouseDown: screen->onMouseButton(true, CGEventGetIntegerValueField(event, kCGMouseEventButtonNumber) + 1); break; case kCGEventLeftMouseUp: case kCGEventRightMouseUp: case kCGEventOtherMouseUp: screen->onMouseButton(false, CGEventGetIntegerValueField(event, kCGMouseEventButtonNumber) + 1); break; case kCGEventMouseMoved: case kCGEventLeftMouseDragged: case kCGEventRightMouseDragged: case kCGEventOtherMouseDragged: pos = CGEventGetLocation(event); screen->onMouseMove(pos.x, pos.y); // The system ignores our cursor-centering calls if // we don't return the event. This should be harmless, // but might register as slight movement to other apps // on the system. It hasn't been a problem before, though. return event; break; case kCGEventScrollWheel: screen->onMouseWheel(screen->mapScrollWheelToSynergy( CGEventGetIntegerValueField(event, kCGScrollWheelEventDeltaAxis2)), screen->mapScrollWheelToSynergy( CGEventGetIntegerValueField(event, kCGScrollWheelEventDeltaAxis1))); break; case kCGEventKeyDown: case kCGEventKeyUp: case kCGEventFlagsChanged: screen->onKey(event); break; case kCGEventTapDisabledByTimeout: // Re-enable our event-tap CGEventTapEnable(screen->m_eventTapPort, true); LOG((CLOG_NOTE "quartz event tap was disabled by timeout, re-enabling")); break; case kCGEventTapDisabledByUserInput: LOG((CLOG_ERR "quartz event tap was disabled by user input")); break; case NX_NULLEVENT: break; case NX_SYSDEFINED: // Unknown, forward it return event; break; case NX_NUMPROCS: break; default: LOG((CLOG_NOTE "unknown quartz event type: 0x%02x", type)); } if(screen->m_isOnScreen) { return event; } else { return NULL; } } void COSXScreen::CMouseButtonState::set(UInt32 button, MouseButtonState state) { bool newState = (state == kMouseButtonDown); m_buttons.set(button, newState); } bool COSXScreen::CMouseButtonState::any() { return m_buttons.any(); } void COSXScreen::CMouseButtonState::reset() { m_buttons.reset(); } void COSXScreen::CMouseButtonState::overwrite(UInt32 buttons) { m_buttons = std::bitset(buttons); } bool COSXScreen::CMouseButtonState::test(UInt32 button) const { return m_buttons.test(button); } SInt8 COSXScreen::CMouseButtonState::getFirstButtonDown() const { if (m_buttons.any()) { for (unsigned short button = 0; button < m_buttons.size(); button++) { if (m_buttons.test(button)) { return button; } } } return -1; } synergy-1.4.12-Source/src/lib/platform/COSXScreen.h0000600000175000017500000002504512043214276021764 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXSCREEN_H #define COSXSCREEN_H #include #include "stdmap.h" #include "stdvector.h" #include #include "COSXClipboard.h" #include "CPlatformScreen.h" #include #include #include #include #include extern "C" { typedef int CGSConnectionID; CGError CGSSetConnectionProperty(CGSConnectionID cid, CGSConnectionID targetCID, CFStringRef key, CFTypeRef value); int _CGSDefaultConnection(); } template class CCondVar; class CEventQueueTimer; class CMutex; class CThread; class COSXKeyState; class COSXScreenSaver; //! Implementation of IPlatformScreen for OS X class COSXScreen : public CPlatformScreen { public: COSXScreen(bool isPrimary, bool autoShowHideCursor=true); virtual ~COSXScreen(); // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IPrimaryScreen overrides virtual void reconfigure(UInt32 activeSides); virtual void warpCursor(SInt32 x, SInt32 y); virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask); virtual void unregisterHotKey(UInt32 id); virtual void fakeInputBegin(); virtual void fakeInputEnd(); virtual SInt32 getJumpZoneSize() const; virtual bool isAnyMouseButtonDown() const; virtual void getCursorCenter(SInt32& x, SInt32& y) const; virtual void gameDeviceTimingResp(UInt16 freq) { } // ISecondaryScreen overrides virtual void fakeMouseButton(ButtonID id, bool press); virtual void fakeMouseMove(SInt32 x, SInt32 y) const; virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const; virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const { } virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const { } virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const { } virtual void queueGameDeviceTimingReq() const { } // IPlatformScreen overrides virtual void enable(); virtual void disable(); virtual void enter(); virtual bool leave(); virtual bool setClipboard(ClipboardID, const IClipboard*); virtual void checkClipboards(); virtual void openScreensaver(bool notify); virtual void closeScreensaver(); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); virtual void setSequenceNumber(UInt32); virtual bool isPrimary() const; virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { } protected: // IPlatformScreen overrides virtual void handleSystemEvent(const CEvent&, void*); virtual void updateButtons(); virtual IKeyState* getKeyState() const; private: void updateScreenShape(); void updateScreenShape(const CGDirectDisplayID, const CGDisplayChangeSummaryFlags); void postMouseEvent(CGPoint&) const; // convenience function to send events void sendEvent(CEvent::Type type, void* = NULL) const; void sendClipboardEvent(CEvent::Type type, ClipboardID id) const; // message handlers bool onMouseMove(SInt32 mx, SInt32 my); // mouse button handler. pressed is true if this is a mousedown // event, false if it is a mouseup event. macButton is the index // of the button pressed using the mac button mapping. bool onMouseButton(bool pressed, UInt16 macButton); bool onMouseWheel(SInt32 xDelta, SInt32 yDelta) const; #if !defined(MAC_OS_X_VERSION_10_5) bool onDisplayChange(); #endif void constructMouseButtonEventMap(); bool onKey(CGEventRef event); bool onHotKey(EventRef event) const; // Added here to allow the carbon cursor hack to be called. void showCursor(); void hideCursor(); // map mac mouse button to synergy buttons ButtonID mapMacButtonToSynergy(UInt16) const; // map mac scroll wheel value to a synergy scroll wheel value SInt32 mapScrollWheelToSynergy(SInt32) const; // map synergy scroll wheel value to a mac scroll wheel value SInt32 mapScrollWheelFromSynergy(SInt32) const; // get the current scroll wheel speed double getScrollSpeed() const; // get the current scroll wheel speed double getScrollSpeedFactor() const; // enable/disable drag handling for buttons 3 and up void enableDragTimer(bool enable); // drag timer handler void handleDrag(const CEvent&, void*); // clipboard check timer handler void handleClipboardCheck(const CEvent&, void*); #if defined(MAC_OS_X_VERSION_10_5) // Resolution switch callback static void displayReconfigurationCallback(CGDirectDisplayID, CGDisplayChangeSummaryFlags, void*); #else static pascal void displayManagerCallback(void* inUserData, SInt16 inMessage, void* inNotifyData); #endif // fast user switch callback static pascal OSStatus userSwitchCallback(EventHandlerCallRef nextHandler, EventRef theEvent, void* inUserData); // sleep / wakeup support void watchSystemPowerThread(void*); static void testCanceled(CFRunLoopTimerRef timer, void*info); static void powerChangeCallback(void* refcon, io_service_t service, natural_t messageType, void* messageArgument); void handlePowerChangeRequest(natural_t messageType, void* messageArgument); static CEvent::Type getConfirmSleepEvent(); void handleConfirmSleep(const CEvent& event, void*); // global hotkey operating mode static bool isGlobalHotKeyOperatingModeAvailable(); static void setGlobalHotKeysEnabled(bool enabled); static bool getGlobalHotKeysEnabled(); // Quartz event tap support static CGEventRef handleCGInputEvent(CGEventTapProxy proxy, CGEventType type, CGEventRef event, void* refcon); static CGEventRef handleCGInputEventSecondary(CGEventTapProxy proxy, CGEventType type, CGEventRef event, void* refcon); private: struct CHotKeyItem { public: CHotKeyItem(UInt32, UInt32); CHotKeyItem(EventHotKeyRef, UInt32, UInt32); EventHotKeyRef getRef() const; bool operator<(const CHotKeyItem&) const; private: EventHotKeyRef m_ref; UInt32 m_keycode; UInt32 m_mask; }; enum MouseButtonState { kMouseButtonUp = 0, kMouseButtonDragged, kMouseButtonDown, kMouseButtonStateMax }; class CMouseButtonState { public: void set(UInt32 button, MouseButtonState state); bool any(); void reset(); void overwrite(UInt32 buttons); bool test(UInt32 button) const; SInt8 getFirstButtonDown() const; private: std::bitset m_buttons; }; typedef std::map HotKeyMap; typedef std::vector HotKeyIDList; typedef std::map ModifierHotKeyMap; typedef std::map HotKeyToIDMap; // true if screen is being used as a primary screen, false otherwise bool m_isPrimary; // true if mouse has entered the screen bool m_isOnScreen; // the display CGDirectDisplayID m_displayID; // screen shape stuff SInt32 m_x, m_y; SInt32 m_w, m_h; SInt32 m_xCenter, m_yCenter; // mouse state mutable SInt32 m_xCursor, m_yCursor; mutable bool m_cursorPosValid; /* FIXME: this data structure is explicitly marked mutable due to a need to track the state of buttons since the remote side only lets us know of change events, and because the fakeMouseButton button method is marked 'const'. This is Evil, and this should be moved to a place where it need not be mutable as soon as possible. */ mutable CMouseButtonState m_buttonState; typedef std::map MouseButtonEventMapType; std::vector MouseButtonEventMap; bool m_cursorHidden; SInt32 m_dragNumButtonsDown; Point m_dragLastPoint; CEventQueueTimer* m_dragTimer; // keyboard stuff COSXKeyState* m_keyState; // clipboards COSXClipboard m_pasteboard; UInt32 m_sequenceNumber; // screen saver stuff COSXScreenSaver* m_screensaver; bool m_screensaverNotify; // clipboard stuff bool m_ownClipboard; CEventQueueTimer* m_clipboardTimer; // window object that gets user input events when the server // has focus. WindowRef m_hiddenWindow; // window object that gets user input events when the server // does not have focus. WindowRef m_userInputWindow; #if !defined(MAC_OS_X_VERSION_10_5) // display manager stuff (to get screen resolution switches). DMExtendedNotificationUPP m_displayManagerNotificationUPP; ProcessSerialNumber m_PSN; #endif // fast user switching EventHandlerRef m_switchEventHandlerRef; // sleep / wakeup CMutex* m_pmMutex; CThread* m_pmWatchThread; CCondVar* m_pmThreadReady; CFRunLoopRef m_pmRunloop; io_connect_t m_pmRootPort; // hot key stuff HotKeyMap m_hotKeys; HotKeyIDList m_oldHotKeyIDs; ModifierHotKeyMap m_modifierHotKeys; UInt32 m_activeModifierHotKey; KeyModifierMask m_activeModifierHotKeyMask; HotKeyToIDMap m_hotKeyToIDMap; // global hotkey operating mode static bool s_testedForGHOM; static bool s_hasGHOM; // events static CEvent::Type s_confirmSleepEvent; // Quartz input event support CFMachPortRef m_eventTapPort; CFRunLoopSourceRef m_eventTapRLSR; // for double click coalescing. double m_lastSingleClick; double m_lastDoubleClick; SInt32 m_lastSingleClickXCursor; SInt32 m_lastSingleClickYCursor; // cursor will hide and show on enable and disable if true. bool m_autoShowHideCursor; }; #endif synergy-1.4.12-Source/src/lib/platform/COSXScreenSaver.cpp0000600000175000017500000001154512021261364023314 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #import "COSXScreenSaver.h" #import "COSXScreenSaverUtil.h" #import "CLog.h" #import "IEventQueue.h" #import "IPrimaryScreen.h" #import // // COSXScreenSaver // COSXScreenSaver::COSXScreenSaver(void* eventTarget) : m_eventTarget(eventTarget), m_enabled(true) { m_autoReleasePool = screenSaverUtilCreatePool(); m_screenSaverController = screenSaverUtilCreateController(); // install launch/termination event handlers EventTypeSpec launchEventTypes[2]; launchEventTypes[0].eventClass = kEventClassApplication; launchEventTypes[0].eventKind = kEventAppLaunched; launchEventTypes[1].eventClass = kEventClassApplication; launchEventTypes[1].eventKind = kEventAppTerminated; EventHandlerUPP launchTerminationEventHandler = NewEventHandlerUPP(launchTerminationCallback); InstallApplicationEventHandler(launchTerminationEventHandler, 2, launchEventTypes, this, &m_launchTerminationEventHandlerRef); DisposeEventHandlerUPP(launchTerminationEventHandler); m_screenSaverPSN.highLongOfPSN = 0; m_screenSaverPSN.lowLongOfPSN = 0; // test if screensaver is running and find process number if (isActive()) { ProcessInfoRec procInfo; Str31 procName; // pascal string. first byte holds length. memset(&procInfo, 0, sizeof(procInfo)); procInfo.processName = procName; procInfo.processInfoLength = sizeof(ProcessInfoRec); ProcessSerialNumber psn; OSErr err = GetNextProcess(&psn); while (err == 0) { memset(procName, 0, sizeof(procName)); err = GetProcessInformation(&psn, &procInfo); if (err != 0) { break; } if (strcmp("ScreenSaverEngine", (const char*)&procName[1]) == 0) { m_screenSaverPSN = psn; break; } err = GetNextProcess(&psn); } } } COSXScreenSaver::~COSXScreenSaver() { RemoveEventHandler(m_launchTerminationEventHandlerRef); // screenSaverUtilReleaseController(m_screenSaverController); screenSaverUtilReleasePool(m_autoReleasePool); } void COSXScreenSaver::enable() { m_enabled = true; screenSaverUtilEnable(m_screenSaverController); } void COSXScreenSaver::disable() { m_enabled = false; screenSaverUtilDisable(m_screenSaverController); } void COSXScreenSaver::activate() { screenSaverUtilActivate(m_screenSaverController); } void COSXScreenSaver::deactivate() { screenSaverUtilDeactivate(m_screenSaverController, m_enabled); } bool COSXScreenSaver::isActive() const { return (screenSaverUtilIsActive(m_screenSaverController) != 0); } void COSXScreenSaver::processLaunched(ProcessSerialNumber psn) { CFStringRef processName; OSStatus err = CopyProcessName(&psn, &processName); if (err == 0 && CFEqual(CFSTR("ScreenSaverEngine"), processName)) { m_screenSaverPSN = psn; LOG((CLOG_DEBUG1 "ScreenSaverEngine launched. Enabled=%d", m_enabled)); if (m_enabled) { EVENTQUEUE->addEvent( CEvent(IPrimaryScreen::getScreensaverActivatedEvent(), m_eventTarget)); } } } void COSXScreenSaver::processTerminated(ProcessSerialNumber psn) { if (m_screenSaverPSN.highLongOfPSN == psn.highLongOfPSN && m_screenSaverPSN.lowLongOfPSN == psn.lowLongOfPSN) { LOG((CLOG_DEBUG1 "ScreenSaverEngine terminated. Enabled=%d", m_enabled)); if (m_enabled) { EVENTQUEUE->addEvent( CEvent(IPrimaryScreen::getScreensaverDeactivatedEvent(), m_eventTarget)); } m_screenSaverPSN.highLongOfPSN = 0; m_screenSaverPSN.lowLongOfPSN = 0; } } pascal OSStatus COSXScreenSaver::launchTerminationCallback( EventHandlerCallRef nextHandler, EventRef theEvent, void* userData) { OSStatus result; ProcessSerialNumber psn; EventParamType actualType; UInt32 actualSize; result = GetEventParameter(theEvent, kEventParamProcessID, typeProcessSerialNumber, &actualType, sizeof(psn), &actualSize, &psn); if ((result == noErr) && (actualSize > 0) && (actualType == typeProcessSerialNumber)) { COSXScreenSaver* screenSaver = (COSXScreenSaver*)userData; UInt32 eventKind = GetEventKind(theEvent); if (eventKind == kEventAppLaunched) { screenSaver->processLaunched(psn); } else if (eventKind == kEventAppTerminated) { screenSaver->processTerminated(psn); } } return (CallNextEventHandler(nextHandler, theEvent)); } synergy-1.4.12-Source/src/lib/platform/COSXScreenSaver.h0000600000175000017500000000323112021261364022752 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXSCREENSAVER_H #define COSXSCREENSAVER_H #include "IScreenSaver.h" #include //! OSX screen saver implementation class COSXScreenSaver : public IScreenSaver { public: COSXScreenSaver(void* eventTarget); virtual ~COSXScreenSaver(); // IScreenSaver overrides virtual void enable(); virtual void disable(); virtual void activate(); virtual void deactivate(); virtual bool isActive() const; private: void processLaunched(ProcessSerialNumber psn); void processTerminated(ProcessSerialNumber psn); static pascal OSStatus launchTerminationCallback( EventHandlerCallRef nextHandler, EventRef theEvent, void* userData); private: // the target for the events we generate void* m_eventTarget; bool m_enabled; void* m_screenSaverController; void* m_autoReleasePool; EventHandlerRef m_launchTerminationEventHandlerRef; ProcessSerialNumber m_screenSaverPSN; }; #endif synergy-1.4.12-Source/src/lib/platform/COSXScreenSaverUtil.h0000600000175000017500000000243012021261364023610 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 COSXSCREENSAVERUTIL_H #define COSXSCREENSAVERUTIL_H #include "common.h" #if defined(__cplusplus) extern "C" { #endif void* screenSaverUtilCreatePool(); void screenSaverUtilReleasePool(void*); void* screenSaverUtilCreateController(); void screenSaverUtilReleaseController(void*); void screenSaverUtilEnable(void*); void screenSaverUtilDisable(void*); void screenSaverUtilActivate(void*); void screenSaverUtilDeactivate(void*, int isEnabled); int screenSaverUtilIsActive(void*); #if defined(__cplusplus) } #endif #endif synergy-1.4.12-Source/src/lib/platform/COSXScreenSaverUtil.m0000600000175000017500000000367311514217303023627 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2004 Chris Schoeneman, Nick Bolton, Sorin Sbarnea * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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. */ #import "COSXScreenSaverUtil.h" #import "OSXScreenSaverControl.h" #import // // screenSaverUtil functions // // Note: these helper functions exist only so we can avoid using ObjC++. // autoconf/automake don't know about ObjC++ and I don't know how to // teach them about it. // void* screenSaverUtilCreatePool() { return [[NSAutoreleasePool alloc] init]; } void screenSaverUtilReleasePool(void* pool) { [(NSAutoreleasePool*)pool release]; } void* screenSaverUtilCreateController() { return [[ScreenSaverController controller] retain]; } void screenSaverUtilReleaseController(void* controller) { [(ScreenSaverController*)controller release]; } void screenSaverUtilEnable(void* controller) { [(ScreenSaverController*)controller setScreenSaverCanRun:YES]; } void screenSaverUtilDisable(void* controller) { [(ScreenSaverController*)controller setScreenSaverCanRun:NO]; } void screenSaverUtilActivate(void* controller) { [(ScreenSaverController*)controller setScreenSaverCanRun:YES]; [(ScreenSaverController*)controller screenSaverStartNow]; } void screenSaverUtilDeactivate(void* controller, int isEnabled) { [(ScreenSaverController*)controller screenSaverStopNow]; [(ScreenSaverController*)controller setScreenSaverCanRun:isEnabled]; } int screenSaverUtilIsActive(void* controller) { return [(ScreenSaverController*)controller screenSaverIsRunning]; } synergy-1.4.12-Source/src/lib/platform/CSynergyHook.cpp0000600000175000017500000007202412021261364022762 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CSynergyHook.h" #include "ProtocolTypes.h" #include #include #if _MSC_VER >= 1400 // VS2005 hack - we don't use assert here because we don't want to link with the CRT. #undef assert #if _DEBUG #define assert(_X_) if (!(_X_)) __debugbreak() #else #define assert(_X_) __noop() #endif // VS2005 is a bit more smart than VC6 and optimize simple copy loop to // intrinsic memcpy. #pragma function(memcpy) #endif // // debugging compile flag. when not zero the server doesn't grab // the keyboard when the mouse leaves the server screen. this // makes it possible to use the debugger (via the keyboard) when // all user input would normally be caught by the hook procedures. // #define NO_GRAB_KEYBOARD 0 // // debugging compile flag. when not zero the server will not // install low level hooks. // #define NO_LOWLEVEL_HOOKS 0 // // extra mouse wheel stuff // enum EWheelSupport { kWheelNone, kWheelOld, kWheelWin2000, kWheelModern }; // declare extended mouse hook struct. useable on win2k typedef struct tagMOUSEHOOKSTRUCTWin2000 { MOUSEHOOKSTRUCT mhs; DWORD mouseData; } MOUSEHOOKSTRUCTWin2000; #if !defined(SM_MOUSEWHEELPRESENT) #define SM_MOUSEWHEELPRESENT 75 #endif // X button stuff #if !defined(WM_XBUTTONDOWN) #define WM_XBUTTONDOWN 0x020B #define WM_XBUTTONUP 0x020C #define WM_XBUTTONDBLCLK 0x020D #define WM_NCXBUTTONDOWN 0x00AB #define WM_NCXBUTTONUP 0x00AC #define WM_NCXBUTTONDBLCLK 0x00AD #define MOUSEEVENTF_XDOWN 0x0080 #define MOUSEEVENTF_XUP 0x0100 #define XBUTTON1 0x0001 #define XBUTTON2 0x0002 #endif // // globals // #if defined(_MSC_VER) #pragma comment(linker, "-section:shared,rws") #pragma data_seg("shared") #endif // all data in this shared section *must* be initialized static HINSTANCE g_hinstance = NULL; static DWORD g_processID = 0; static EWheelSupport g_wheelSupport = kWheelNone; static UINT g_wmMouseWheel = 0; static DWORD g_threadID = 0; static HHOOK g_keyboard = NULL; static HHOOK g_mouse = NULL; static HHOOK g_getMessage = NULL; static HHOOK g_keyboardLL = NULL; static HHOOK g_mouseLL = NULL; static bool g_screenSaver = false; static EHookMode g_mode = kHOOK_DISABLE; static UInt32 g_zoneSides = 0; static SInt32 g_zoneSize = 0; static SInt32 g_xScreen = 0; static SInt32 g_yScreen = 0; static SInt32 g_wScreen = 0; static SInt32 g_hScreen = 0; static WPARAM g_deadVirtKey = 0; static WPARAM g_deadRelease = 0; static LPARAM g_deadLParam = 0; static BYTE g_deadKeyState[256] = { 0 }; static DWORD g_hookThread = 0; static DWORD g_attachedThread = 0; static bool g_fakeInput = false; #if defined(_MSC_VER) #pragma data_seg() #endif // keep linker quiet about floating point stuff. we don't use any // floating point operations but our includes may define some // (unused) floating point values. #ifndef _DEBUG extern "C" { int _fltused=0; } #endif // // internal functions // static void detachThread() { if (g_attachedThread != 0 && g_hookThread != g_attachedThread) { AttachThreadInput(g_hookThread, g_attachedThread, FALSE); g_attachedThread = 0; } } static bool attachThreadToForeground() { // only attach threads if using low level hooks. a low level hook // runs in the thread that installed the hook but we have to make // changes that require being attached to the target thread (which // should be the foreground window). a regular hook runs in the // thread that just removed the event from its queue so we're // already in the right thread. if (g_hookThread != 0) { HWND window = GetForegroundWindow(); if (window == NULL) return false; DWORD threadID = GetWindowThreadProcessId(window, NULL); // skip if no change if (g_attachedThread != threadID) { // detach from previous thread detachThread(); // attach to new thread if (threadID != 0 && threadID != g_hookThread) { AttachThreadInput(g_hookThread, threadID, TRUE); g_attachedThread = threadID; } return true; } } return false; } #if !NO_GRAB_KEYBOARD static WPARAM makeKeyMsg(UINT virtKey, char c, bool noAltGr) { return MAKEWPARAM(MAKEWORD(virtKey & 0xff, (BYTE)c), noAltGr ? 1 : 0); } static void keyboardGetState(BYTE keys[256]) { // we have to use GetAsyncKeyState() rather than GetKeyState() because // we don't pass through most keys so the event synchronous state // doesn't get updated. we do that because certain modifier keys have // side effects, like alt and the windows key. SHORT key; for (int i = 0; i < 256; ++i) { key = GetAsyncKeyState(i); keys[i] = (BYTE)((key < 0) ? 0x80u : 0); } key = GetKeyState(VK_CAPITAL); keys[VK_CAPITAL] = (BYTE)(((key < 0) ? 0x80 : 0) | (key & 1)); } static bool doKeyboardHookHandler(WPARAM wParam, LPARAM lParam) { // check for special events indicating if we should start or stop // passing events through and not report them to the server. this // is used to allow the server to synthesize events locally but // not pick them up as user events. if (wParam == SYNERGY_HOOK_FAKE_INPUT_VIRTUAL_KEY && ((lParam >> 16) & 0xffu) == SYNERGY_HOOK_FAKE_INPUT_SCANCODE) { // update flag g_fakeInput = ((lParam & 0x80000000u) == 0); PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, 0xff000000u | wParam, lParam); // discard event return true; } // if we're expecting fake input then just pass the event through // and do not forward to the server if (g_fakeInput) { PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, 0xfe000000u | wParam, lParam); return false; } // VK_RSHIFT may be sent with an extended scan code but right shift // is not an extended key so we reset that bit. if (wParam == VK_RSHIFT) { lParam &= ~0x01000000u; } // tell server about event PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, wParam, lParam); // ignore dead key release if ((g_deadVirtKey == wParam || g_deadRelease == wParam) && (lParam & 0x80000000u) != 0) { g_deadRelease = 0; PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, wParam | 0x04000000, lParam); return false; } // we need the keyboard state for ToAscii() BYTE keys[256]; keyboardGetState(keys); // ToAscii() maps ctrl+letter to the corresponding control code // and ctrl+backspace to delete. we don't want those translations // so clear the control modifier state. however, if we want to // simulate AltGr (which is ctrl+alt) then we must not clear it. UINT control = keys[VK_CONTROL] | keys[VK_LCONTROL] | keys[VK_RCONTROL]; UINT menu = keys[VK_MENU] | keys[VK_LMENU] | keys[VK_RMENU]; if ((control & 0x80) == 0 || (menu & 0x80) == 0) { keys[VK_LCONTROL] = 0; keys[VK_RCONTROL] = 0; keys[VK_CONTROL] = 0; } else { keys[VK_LCONTROL] = 0x80; keys[VK_RCONTROL] = 0x80; keys[VK_CONTROL] = 0x80; keys[VK_LMENU] = 0x80; keys[VK_RMENU] = 0x80; keys[VK_MENU] = 0x80; } // ToAscii() needs to know if a menu is active for some reason. // we don't know and there doesn't appear to be any way to find // out. so we'll just assume a menu is active if the menu key // is down. // FIXME -- figure out some way to check if a menu is active UINT flags = 0; if ((menu & 0x80) != 0) flags |= 1; // if we're on the server screen then just pass numpad keys with alt // key down as-is. we won't pick up the resulting character but the // local app will. if on a client screen then grab keys as usual; // if the client is a windows system it'll synthesize the expected // character. if not then it'll probably just do nothing. if (g_mode != kHOOK_RELAY_EVENTS) { // we don't use virtual keys because we don't know what the // state of the numlock key is. we'll hard code the scan codes // instead. hopefully this works across all keyboards. UINT sc = (lParam & 0x01ff0000u) >> 16; if (menu && (sc >= 0x47u && sc <= 0x52u && sc != 0x4au && sc != 0x4eu)) { return false; } } WORD c = 0; // map the key event to a character. we have to put the dead // key back first and this has the side effect of removing it. if (g_deadVirtKey != 0) { if(ToAscii((UINT)g_deadVirtKey, (g_deadLParam & 0x10ff0000u) >> 16, g_deadKeyState, &c, flags) == 2) { // If ToAscii returned 2, it means that we accidentally removed // a double dead key instead of restoring it. Thus, we call // ToAscii again with the same parameters to restore the // internal dead key state. ToAscii((UINT)g_deadVirtKey, (g_deadLParam & 0x10ff0000u) >> 16, g_deadKeyState, &c, flags); // We need to keep track of this because g_deadVirtKey will be // cleared later on; this would cause the dead key release to // incorrectly restore the dead key state. g_deadRelease = g_deadVirtKey; } } UINT scanCode = ((lParam & 0x10ff0000u) >> 16); int n = ToAscii((UINT)wParam, scanCode, keys, &c, flags); // if mapping failed and ctrl and alt are pressed then try again // with both not pressed. this handles the case where ctrl and // alt are being used as individual modifiers rather than AltGr. // we note that's the case in the message sent back to synergy // because there's no simple way to deduce it after the fact. // we have to put the dead key back first, if there was one. bool noAltGr = false; if (n == 0 && (control & 0x80) != 0 && (menu & 0x80) != 0) { noAltGr = true; PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, wParam | 0x05000000, lParam); if (g_deadVirtKey != 0) { if(ToAscii((UINT)g_deadVirtKey, (g_deadLParam & 0x10ff0000u) >> 16, g_deadKeyState, &c, flags) == 2) { ToAscii((UINT)g_deadVirtKey, (g_deadLParam & 0x10ff0000u) >> 16, g_deadKeyState, &c, flags); g_deadRelease = g_deadVirtKey; } } BYTE keys2[256]; for (size_t i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i) { keys2[i] = keys[i]; } keys2[VK_LCONTROL] = 0; keys2[VK_RCONTROL] = 0; keys2[VK_CONTROL] = 0; keys2[VK_LMENU] = 0; keys2[VK_RMENU] = 0; keys2[VK_MENU] = 0; n = ToAscii((UINT)wParam, scanCode, keys2, &c, flags); } PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, wParam | ((c & 0xff) << 8) | ((n & 0xff) << 16) | 0x06000000, lParam); WPARAM charAndVirtKey = 0; bool clearDeadKey = false; switch (n) { default: // key is a dead key if(lParam & 0x80000000u) // This handles the obscure situation where a key has been // pressed which is both a dead key and a normal character // depending on which modifiers have been pressed. We // break here to prevent it from being considered a dead // key. break; g_deadVirtKey = wParam; g_deadLParam = lParam; for (size_t i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i) { g_deadKeyState[i] = keys[i]; } break; case 0: // key doesn't map to a character. this can happen if // non-character keys are pressed after a dead key. charAndVirtKey = makeKeyMsg((UINT)wParam, (char)0, noAltGr); break; case 1: // key maps to a character composed with dead key charAndVirtKey = makeKeyMsg((UINT)wParam, (char)LOBYTE(c), noAltGr); clearDeadKey = true; break; case 2: { // previous dead key not composed. send a fake key press // and release for the dead key to our window. WPARAM deadCharAndVirtKey = makeKeyMsg((UINT)g_deadVirtKey, (char)LOBYTE(c), noAltGr); PostThreadMessage(g_threadID, SYNERGY_MSG_KEY, deadCharAndVirtKey, g_deadLParam & 0x7fffffffu); PostThreadMessage(g_threadID, SYNERGY_MSG_KEY, deadCharAndVirtKey, g_deadLParam | 0x80000000u); // use uncomposed character charAndVirtKey = makeKeyMsg((UINT)wParam, (char)HIBYTE(c), noAltGr); clearDeadKey = true; break; } } // put back the dead key, if any, for the application to use if (g_deadVirtKey != 0) { ToAscii((UINT)g_deadVirtKey, (g_deadLParam & 0x10ff0000u) >> 16, g_deadKeyState, &c, flags); } // clear out old dead key state if (clearDeadKey) { g_deadVirtKey = 0; g_deadLParam = 0; } // forward message to our window. do this whether or not we're // forwarding events to clients because this'll keep our thread's // key state table up to date. that's important for querying // the scroll lock toggle state. // XXX -- with hot keys for actions we may only need to do this when // forwarding. if (charAndVirtKey != 0) { PostThreadMessage(g_threadID, SYNERGY_MSG_DEBUG, charAndVirtKey | 0x07000000, lParam); PostThreadMessage(g_threadID, SYNERGY_MSG_KEY, charAndVirtKey, lParam); } if (g_mode == kHOOK_RELAY_EVENTS) { // let certain keys pass through switch (wParam) { case VK_CAPITAL: case VK_NUMLOCK: case VK_SCROLL: // pass event on. we want to let these through to // the window proc because otherwise the keyboard // lights may not stay synchronized. break; case VK_HANGUL: // pass these modifiers if using a low level hook, discard // them if not. if (g_hookThread == 0) { return true; } break; default: // discard return true; } } return false; } static bool keyboardHookHandler(WPARAM wParam, LPARAM lParam) { attachThreadToForeground(); return doKeyboardHookHandler(wParam, lParam); } #endif static bool doMouseHookHandler(WPARAM wParam, SInt32 x, SInt32 y, SInt32 data) { switch (wParam) { case WM_LBUTTONDOWN: case WM_MBUTTONDOWN: case WM_RBUTTONDOWN: case WM_XBUTTONDOWN: case WM_LBUTTONDBLCLK: case WM_MBUTTONDBLCLK: case WM_RBUTTONDBLCLK: case WM_XBUTTONDBLCLK: case WM_LBUTTONUP: case WM_MBUTTONUP: case WM_RBUTTONUP: case WM_XBUTTONUP: case WM_NCLBUTTONDOWN: case WM_NCMBUTTONDOWN: case WM_NCRBUTTONDOWN: case WM_NCXBUTTONDOWN: case WM_NCLBUTTONDBLCLK: case WM_NCMBUTTONDBLCLK: case WM_NCRBUTTONDBLCLK: case WM_NCXBUTTONDBLCLK: case WM_NCLBUTTONUP: case WM_NCMBUTTONUP: case WM_NCRBUTTONUP: case WM_NCXBUTTONUP: // always relay the event. eat it if relaying. PostThreadMessage(g_threadID, SYNERGY_MSG_MOUSE_BUTTON, wParam, data); return (g_mode == kHOOK_RELAY_EVENTS); case WM_MOUSEWHEEL: if (g_mode == kHOOK_RELAY_EVENTS) { // relay event PostThreadMessage(g_threadID, SYNERGY_MSG_MOUSE_WHEEL, data, 0); } return (g_mode == kHOOK_RELAY_EVENTS); case WM_NCMOUSEMOVE: case WM_MOUSEMOVE: if (g_mode == kHOOK_RELAY_EVENTS) { // relay and eat event PostThreadMessage(g_threadID, SYNERGY_MSG_MOUSE_MOVE, x, y); return true; } else if (g_mode == kHOOK_WATCH_JUMP_ZONE) { // low level hooks can report bogus mouse positions that are // outside of the screen. jeez. naturally we end up getting // fake motion in the other direction to get the position back // on the screen, which plays havoc with switch on double tap. // CServer deals with that. we'll clamp positions onto the // screen. also, if we discard events for positions outside // of the screen then the mouse appears to get a bit jerky // near the edge. we can either accept that or pass the bogus // events. we'll try passing the events. bool bogus = false; if (x < g_xScreen) { x = g_xScreen; bogus = true; } else if (x >= g_xScreen + g_wScreen) { x = g_xScreen + g_wScreen - 1; bogus = true; } if (y < g_yScreen) { y = g_yScreen; bogus = true; } else if (y >= g_yScreen + g_hScreen) { y = g_yScreen + g_hScreen - 1; bogus = true; } // check for mouse inside jump zone bool inside = false; if (!inside && (g_zoneSides & kLeftMask) != 0) { inside = (x < g_xScreen + g_zoneSize); } if (!inside && (g_zoneSides & kRightMask) != 0) { inside = (x >= g_xScreen + g_wScreen - g_zoneSize); } if (!inside && (g_zoneSides & kTopMask) != 0) { inside = (y < g_yScreen + g_zoneSize); } if (!inside && (g_zoneSides & kBottomMask) != 0) { inside = (y >= g_yScreen + g_hScreen - g_zoneSize); } // relay the event PostThreadMessage(g_threadID, SYNERGY_MSG_MOUSE_MOVE, x, y); // if inside and not bogus then eat the event return inside && !bogus; } } // pass the event return false; } static bool mouseHookHandler(WPARAM wParam, SInt32 x, SInt32 y, SInt32 data) { // attachThreadToForeground(); return doMouseHookHandler(wParam, x, y, data); } #if !NO_GRAB_KEYBOARD static LRESULT CALLBACK keyboardHook(int code, WPARAM wParam, LPARAM lParam) { if (code >= 0) { // handle the message if (keyboardHookHandler(wParam, lParam)) { return 1; } } return CallNextHookEx(g_keyboard, code, wParam, lParam); } #endif static LRESULT CALLBACK mouseHook(int code, WPARAM wParam, LPARAM lParam) { if (code >= 0) { // decode message const MOUSEHOOKSTRUCT* info = (const MOUSEHOOKSTRUCT*)lParam; SInt32 x = (SInt32)info->pt.x; SInt32 y = (SInt32)info->pt.y; SInt32 w = 0; if (wParam == WM_MOUSEWHEEL) { // win2k and other systems supporting WM_MOUSEWHEEL in // the mouse hook are gratuitously different (and poorly // documented). if a low-level mouse hook is in place // it should capture these events so we'll never see // them. switch (g_wheelSupport) { case kWheelModern: w = static_cast(LOWORD(info->dwExtraInfo)); break; case kWheelWin2000: { const MOUSEHOOKSTRUCTWin2000* info2k = (const MOUSEHOOKSTRUCTWin2000*)lParam; w = static_cast(HIWORD(info2k->mouseData)); break; } default: break; } } // handle the message. note that we don't handle X buttons // here. that's okay because they're only supported on // win2k and winxp and up and on those platforms we'll get // get the mouse events through the low level hook. if (mouseHookHandler(wParam, x, y, w)) { return 1; } } return CallNextHookEx(g_mouse, code, wParam, lParam); } static LRESULT CALLBACK getMessageHook(int code, WPARAM wParam, LPARAM lParam) { if (code >= 0) { if (g_screenSaver) { MSG* msg = reinterpret_cast(lParam); if (msg->message == WM_SYSCOMMAND && msg->wParam == SC_SCREENSAVE) { // broadcast screen saver started message PostThreadMessage(g_threadID, SYNERGY_MSG_SCREEN_SAVER, TRUE, 0); } } if (g_mode == kHOOK_RELAY_EVENTS) { MSG* msg = reinterpret_cast(lParam); if (g_wheelSupport == kWheelOld && msg->message == g_wmMouseWheel) { // post message to our window PostThreadMessage(g_threadID, SYNERGY_MSG_MOUSE_WHEEL, static_cast(msg->wParam & 0xffffu), 0); // zero out the delta in the message so it's (hopefully) // ignored msg->wParam = 0; } } } return CallNextHookEx(g_getMessage, code, wParam, lParam); } #if (_WIN32_WINNT >= 0x0400) && defined(_MSC_VER) && !NO_LOWLEVEL_HOOKS // // low-level keyboard hook -- this allows us to capture and handle // alt+tab, alt+esc, ctrl+esc, and windows key hot keys. on the down // side, key repeats are not reported to us. // #if !NO_GRAB_KEYBOARD static LRESULT CALLBACK keyboardLLHook(int code, WPARAM wParam, LPARAM lParam) { if (code >= 0) { // decode the message KBDLLHOOKSTRUCT* info = reinterpret_cast(lParam); WPARAM wParam = info->vkCode; LPARAM lParam = 1; // repeat code lParam |= (info->scanCode << 16); // scan code if (info->flags & LLKHF_EXTENDED) { lParam |= (1lu << 24); // extended key } if (info->flags & LLKHF_ALTDOWN) { lParam |= (1lu << 29); // context code } if (info->flags & LLKHF_UP) { lParam |= (1lu << 31); // transition } // FIXME -- bit 30 should be set if key was already down but // we don't know that info. as a result we'll never generate // key repeat events. // handle the message if (keyboardHookHandler(wParam, lParam)) { return 1; } } return CallNextHookEx(g_keyboardLL, code, wParam, lParam); } #endif // // low-level mouse hook -- this allows us to capture and handle mouse // events very early. the earlier the better. // static LRESULT CALLBACK mouseLLHook(int code, WPARAM wParam, LPARAM lParam) { if (code >= 0) { // decode the message MSLLHOOKSTRUCT* info = reinterpret_cast(lParam); SInt32 x = static_cast(info->pt.x); SInt32 y = static_cast(info->pt.y); SInt32 w = static_cast(HIWORD(info->mouseData)); // handle the message if (mouseHookHandler(wParam, x, y, w)) { return 1; } } return CallNextHookEx(g_mouseLL, code, wParam, lParam); } #endif static EWheelSupport getWheelSupport() { // get operating system OSVERSIONINFO info; info.dwOSVersionInfoSize = sizeof(info); if (!GetVersionEx(&info)) { return kWheelNone; } // see if modern wheel is present if (GetSystemMetrics(SM_MOUSEWHEELPRESENT)) { // note if running on win2k if (info.dwPlatformId == VER_PLATFORM_WIN32_NT && info.dwMajorVersion == 5 && info.dwMinorVersion == 0) { return kWheelWin2000; } return kWheelModern; } // not modern. see if we've got old-style support. #if defined(MSH_WHEELSUPPORT) UINT wheelSupportMsg = RegisterWindowMessage(MSH_WHEELSUPPORT); HWND wheelSupportWindow = FindWindow(MSH_WHEELMODULE_CLASS, MSH_WHEELMODULE_TITLE); if (wheelSupportWindow != NULL && wheelSupportMsg != 0) { if (SendMessage(wheelSupportWindow, wheelSupportMsg, 0, 0) != 0) { g_wmMouseWheel = RegisterWindowMessage(MSH_MOUSEWHEEL); if (g_wmMouseWheel != 0) { return kWheelOld; } } } #endif // assume modern. we don't do anything special in this case // except respond to WM_MOUSEWHEEL messages. GetSystemMetrics() // can apparently return FALSE even if a mouse wheel is present // though i'm not sure exactly when it does that (WinME returns // FALSE for my logitech USB trackball). return kWheelModern; } // // external functions // BOOL WINAPI DllMain(HINSTANCE instance, DWORD reason, LPVOID) { if (reason == DLL_PROCESS_ATTACH) { DisableThreadLibraryCalls(instance); if (g_processID == 0) { g_hinstance = instance; g_processID = GetCurrentProcessId(); } } else if (reason == DLL_PROCESS_DETACH) { if (g_processID == GetCurrentProcessId()) { uninstall(); uninstallScreenSaver(); g_processID = 0; g_hinstance = NULL; } } return TRUE; } extern "C" { // VS2005 hack to not link with the CRT #if _MSC_VER >= 1400 BOOL WINAPI _DllMainCRTStartup( HINSTANCE instance, DWORD reason, LPVOID lpreserved) { return DllMain(instance, reason, lpreserved); } // VS2005 is a bit more bright than VC6 and optimize simple copy loop to // intrinsic memcpy. void * __cdecl memcpy(void * _Dst, const void * _Src, size_t _MaxCount) { void * _DstBackup = _Dst; switch (_MaxCount & 3) { case 3: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; --_MaxCount; case 2: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; --_MaxCount; case 1: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; --_MaxCount; break; case 0: break; default: __assume(0); break; } // I think it's faster on intel to deference than modify the pointer. const size_t max = _MaxCount / sizeof(UINT_PTR); for (size_t i = 0; i < max; ++i) { ((UINT_PTR*)_Dst)[i] = ((UINT_PTR*)_Src)[i]; } (UINT_PTR*&)_Dst += max; (UINT_PTR*&)_Src += max; switch (_MaxCount & 3) { case 3: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; case 2: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; case 1: ((char*)_Dst)[0] = ((char*)_Src)[0]; ++(char*&)_Dst; ++(char*&)_Src; break; case 0: break; default: __assume(0); break; } return _DstBackup; } #endif int init(DWORD threadID) { assert(g_hinstance != NULL); // try to open process that last called init() to see if it's // still running or if it died without cleaning up. if (g_processID != 0 && g_processID != GetCurrentProcessId()) { HANDLE process = OpenProcess(STANDARD_RIGHTS_REQUIRED, FALSE, g_processID); if (process != NULL) { // old process (probably) still exists so refuse to // reinitialize this DLL (and thus steal it from the // old process). CloseHandle(process); return 0; } // clean up after old process. the system should've already // removed the hooks so we just need to reset our state. g_hinstance = GetModuleHandle(_T("synrgyhk")); g_processID = GetCurrentProcessId(); g_wheelSupport = kWheelNone; g_threadID = 0; g_keyboard = NULL; g_mouse = NULL; g_getMessage = NULL; g_keyboardLL = NULL; g_mouseLL = NULL; g_screenSaver = false; } // save thread id. we'll post messages to this thread's // message queue. g_threadID = threadID; // set defaults g_mode = kHOOK_DISABLE; g_zoneSides = 0; g_zoneSize = 0; g_xScreen = 0; g_yScreen = 0; g_wScreen = 0; g_hScreen = 0; return 1; } int cleanup(void) { assert(g_hinstance != NULL); if (g_processID == GetCurrentProcessId()) { g_threadID = 0; } return 1; } EHookResult install() { assert(g_hinstance != NULL); assert(g_keyboard == NULL); assert(g_mouse == NULL); assert(g_getMessage == NULL || g_screenSaver); // must be initialized if (g_threadID == 0) { return kHOOK_FAILED; } // discard old dead keys g_deadVirtKey = 0; g_deadLParam = 0; // reset fake input flag g_fakeInput = false; // check for mouse wheel support g_wheelSupport = getWheelSupport(); // install GetMessage hook (unless already installed) if (g_wheelSupport == kWheelOld && g_getMessage == NULL) { g_getMessage = SetWindowsHookEx(WH_GETMESSAGE, &getMessageHook, g_hinstance, 0); } // install low-level hooks. we require that they both get installed. #if (_WIN32_WINNT >= 0x0400) && defined(_MSC_VER) && !NO_LOWLEVEL_HOOKS g_mouseLL = SetWindowsHookEx(WH_MOUSE_LL, &mouseLLHook, g_hinstance, 0); #if !NO_GRAB_KEYBOARD g_keyboardLL = SetWindowsHookEx(WH_KEYBOARD_LL, &keyboardLLHook, g_hinstance, 0); if (g_mouseLL == NULL || g_keyboardLL == NULL) { if (g_keyboardLL != NULL) { UnhookWindowsHookEx(g_keyboardLL); g_keyboardLL = NULL; } if (g_mouseLL != NULL) { UnhookWindowsHookEx(g_mouseLL); g_mouseLL = NULL; } } #endif #endif // install regular hooks if (g_mouseLL == NULL) { g_mouse = SetWindowsHookEx(WH_MOUSE, &mouseHook, g_hinstance, 0); } #if !NO_GRAB_KEYBOARD if (g_keyboardLL == NULL) { g_keyboard = SetWindowsHookEx(WH_KEYBOARD, &keyboardHook, g_hinstance, 0); } #endif // check that we got all the hooks we wanted if ((g_getMessage == NULL && g_wheelSupport == kWheelOld) || #if !NO_GRAB_KEYBOARD (g_keyboardLL == NULL && g_keyboard == NULL) || #endif (g_mouseLL == NULL && g_mouse == NULL)) { uninstall(); return kHOOK_FAILED; } if (g_keyboardLL != NULL || g_mouseLL != NULL) { g_hookThread = GetCurrentThreadId(); return kHOOK_OKAY_LL; } return kHOOK_OKAY; } int uninstall(void) { assert(g_hinstance != NULL); // discard old dead keys g_deadVirtKey = 0; g_deadLParam = 0; // detach from thread detachThread(); // uninstall hooks if (g_keyboardLL != NULL) { UnhookWindowsHookEx(g_keyboardLL); g_keyboardLL = NULL; } if (g_mouseLL != NULL) { UnhookWindowsHookEx(g_mouseLL); g_mouseLL = NULL; } if (g_keyboard != NULL) { UnhookWindowsHookEx(g_keyboard); g_keyboard = NULL; } if (g_mouse != NULL) { UnhookWindowsHookEx(g_mouse); g_mouse = NULL; } if (g_getMessage != NULL && !g_screenSaver) { UnhookWindowsHookEx(g_getMessage); g_getMessage = NULL; } g_wheelSupport = kWheelNone; return 1; } int installScreenSaver(void) { assert(g_hinstance != NULL); // must be initialized if (g_threadID == 0) { return 0; } // generate screen saver messages g_screenSaver = true; // install hook unless it's already installed if (g_getMessage == NULL) { g_getMessage = SetWindowsHookEx(WH_GETMESSAGE, &getMessageHook, g_hinstance, 0); } return (g_getMessage != NULL) ? 1 : 0; } int uninstallScreenSaver(void) { assert(g_hinstance != NULL); // uninstall hook unless the mouse wheel hook is installed if (g_getMessage != NULL && g_wheelSupport != kWheelOld) { UnhookWindowsHookEx(g_getMessage); g_getMessage = NULL; } // screen saver hook is no longer installed g_screenSaver = false; return 1; } void setSides(UInt32 sides) { g_zoneSides = sides; } void setZone(SInt32 x, SInt32 y, SInt32 w, SInt32 h, SInt32 jumpZoneSize) { g_zoneSize = jumpZoneSize; g_xScreen = x; g_yScreen = y; g_wScreen = w; g_hScreen = h; } void setMode(EHookMode mode) { if (mode == g_mode) { // no change return; } g_mode = mode; } } synergy-1.4.12-Source/src/lib/platform/CSynergyHook.h0000600000175000017500000000647712021261364022440 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSYNERGYHOOK_H #define CSYNERGYHOOK_H // hack: vs2005 doesn't declare _WIN32_WINNT, so we need to hard code it. // however, some say that this should be hard coded since it defines the // target system, but since this is suposed to compile on pre-XP, maybe // we should just leave it like this. #if _MSC_VER == 1400 #define _WIN32_WINNT 0x0400 #endif #include "BasicTypes.h" #define WIN32_LEAN_AND_MEAN #include // fix: cmake defines the library name in lower case (synrgyhk_EXPORTS) as // opposed to upper case (SYNRGYHK_EXPORTS), so rather than figuring out // how to change cmake's behaviour, it's easier to just change the code. #if defined(synrgyhk_EXPORTS) #define CSYNERGYHOOK_API __declspec(dllexport) #else #define CSYNERGYHOOK_API __declspec(dllimport) #endif #define SYNERGY_MSG_MARK WM_APP + 0x0011 // mark id; #define SYNERGY_MSG_KEY WM_APP + 0x0012 // vk code; key data #define SYNERGY_MSG_MOUSE_BUTTON WM_APP + 0x0013 // button msg; #define SYNERGY_MSG_MOUSE_WHEEL WM_APP + 0x0014 // delta; #define SYNERGY_MSG_MOUSE_MOVE WM_APP + 0x0015 // x; y #define SYNERGY_MSG_POST_WARP WM_APP + 0x0016 // ; #define SYNERGY_MSG_PRE_WARP WM_APP + 0x0017 // x; y #define SYNERGY_MSG_SCREEN_SAVER WM_APP + 0x0018 // activated; #define SYNERGY_MSG_DEBUG WM_APP + 0x0019 // data, data #define SYNERGY_MSG_INPUT_FIRST SYNERGY_MSG_KEY #define SYNERGY_MSG_INPUT_LAST SYNERGY_MSG_PRE_WARP #define SYNERGY_HOOK_LAST_MSG SYNERGY_MSG_DEBUG #define SYNERGY_HOOK_FAKE_INPUT_VIRTUAL_KEY VK_CANCEL #define SYNERGY_HOOK_FAKE_INPUT_SCANCODE 0 extern "C" { enum EHookResult { kHOOK_FAILED, kHOOK_OKAY, kHOOK_OKAY_LL }; enum EHookMode { kHOOK_DISABLE, kHOOK_WATCH_JUMP_ZONE, kHOOK_RELAY_EVENTS }; typedef int (*InitFunc)(DWORD targetQueueThreadID); typedef int (*CleanupFunc)(void); typedef EHookResult (*InstallFunc)(void); typedef int (*UninstallFunc)(void); typedef int (*InstallScreenSaverFunc)(void); typedef int (*UninstallScreenSaverFunc)(void); typedef void (*SetSidesFunc)(UInt32); typedef void (*SetZoneFunc)(SInt32, SInt32, SInt32, SInt32, SInt32); typedef void (*SetModeFunc)(int); CSYNERGYHOOK_API int init(DWORD); CSYNERGYHOOK_API int cleanup(void); CSYNERGYHOOK_API EHookResult install(void); CSYNERGYHOOK_API int uninstall(void); CSYNERGYHOOK_API int installScreenSaver(void); CSYNERGYHOOK_API int uninstallScreenSaver(void); CSYNERGYHOOK_API void setSides(UInt32 sides); CSYNERGYHOOK_API void setZone(SInt32 x, SInt32 y, SInt32 w, SInt32 h, SInt32 jumpZoneSize); CSYNERGYHOOK_API void setMode(EHookMode mode); } #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboard.cpp0000600000175000017500000011761012021261364024104 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboard.h" #include "CXWindowsClipboardTextConverter.h" #include "CXWindowsClipboardUCS2Converter.h" #include "CXWindowsClipboardUTF8Converter.h" #include "CXWindowsClipboardHTMLConverter.h" #include "CXWindowsClipboardBMPConverter.h" #include "CXWindowsUtil.h" #include "CThread.h" #include "CLog.h" #include "CStopwatch.h" #include "CArch.h" #include "stdvector.h" #include #include // // CXWindowsClipboard // CXWindowsClipboard::CXWindowsClipboard(Display* display, Window window, ClipboardID id) : m_display(display), m_window(window), m_id(id), m_open(false), m_time(0), m_owner(false), m_timeOwned(0), m_timeLost(0) { // get some atoms m_atomTargets = XInternAtom(m_display, "TARGETS", False); m_atomMultiple = XInternAtom(m_display, "MULTIPLE", False); m_atomTimestamp = XInternAtom(m_display, "TIMESTAMP", False); m_atomInteger = XInternAtom(m_display, "INTEGER", False); m_atomAtom = XInternAtom(m_display, "ATOM", False); m_atomAtomPair = XInternAtom(m_display, "ATOM_PAIR", False); m_atomData = XInternAtom(m_display, "CLIP_TEMPORARY", False); m_atomINCR = XInternAtom(m_display, "INCR", False); m_atomMotifClipLock = XInternAtom(m_display, "_MOTIF_CLIP_LOCK", False); m_atomMotifClipHeader = XInternAtom(m_display, "_MOTIF_CLIP_HEADER", False); m_atomMotifClipAccess = XInternAtom(m_display, "_MOTIF_CLIP_LOCK_ACCESS_VALID", False); m_atomGDKSelection = XInternAtom(m_display, "GDK_SELECTION", False); // set selection atom based on clipboard id switch (id) { case kClipboardClipboard: m_selection = XInternAtom(m_display, "CLIPBOARD", False); break; case kClipboardSelection: default: m_selection = XA_PRIMARY; break; } // add converters, most desired first m_converters.push_back(new CXWindowsClipboardHTMLConverter(m_display, "text/html")); m_converters.push_back(new CXWindowsClipboardBMPConverter(m_display)); m_converters.push_back(new CXWindowsClipboardUTF8Converter(m_display, "text/plain;charset=UTF-8")); m_converters.push_back(new CXWindowsClipboardUTF8Converter(m_display, "UTF8_STRING")); m_converters.push_back(new CXWindowsClipboardUCS2Converter(m_display, "text/plain;charset=ISO-10646-UCS-2")); m_converters.push_back(new CXWindowsClipboardUCS2Converter(m_display, "text/unicode")); m_converters.push_back(new CXWindowsClipboardTextConverter(m_display, "text/plain")); m_converters.push_back(new CXWindowsClipboardTextConverter(m_display, "STRING")); // we have no data clearCache(); } CXWindowsClipboard::~CXWindowsClipboard() { clearReplies(); clearConverters(); } void CXWindowsClipboard::lost(Time time) { LOG((CLOG_DEBUG "lost clipboard %d ownership at %d", m_id, time)); if (m_owner) { m_owner = false; m_timeLost = time; clearCache(); } } void CXWindowsClipboard::addRequest(Window owner, Window requestor, Atom target, ::Time time, Atom property) { // must be for our window and we must have owned the selection // at the given time. bool success = false; if (owner == m_window) { LOG((CLOG_DEBUG1 "request for clipboard %d, target %s by 0x%08x (property=%s)", m_selection, CXWindowsUtil::atomToString(m_display, target).c_str(), requestor, CXWindowsUtil::atomToString(m_display, property).c_str())); if (wasOwnedAtTime(time)) { if (target == m_atomMultiple) { // add a multiple request. property may not be None // according to ICCCM. if (property != None) { success = insertMultipleReply(requestor, time, property); } } else { addSimpleRequest(requestor, target, time, property); // addSimpleRequest() will have already handled failure success = true; } } else { LOG((CLOG_DEBUG1 "failed, not owned at time %d", time)); } } if (!success) { // send failure LOG((CLOG_DEBUG1 "failed")); insertReply(new CReply(requestor, target, time)); } // send notifications that are pending pushReplies(); } bool CXWindowsClipboard::addSimpleRequest(Window requestor, Atom target, ::Time time, Atom property) { // obsolete requestors may supply a None property. in // that case we use the target as the property to store // the conversion. if (property == None) { property = target; } // handle targets CString data; Atom type = None; int format = 0; if (target == m_atomTargets) { type = getTargetsData(data, &format); } else if (target == m_atomTimestamp) { type = getTimestampData(data, &format); } else { IXWindowsClipboardConverter* converter = getConverter(target); if (converter != NULL) { IClipboard::EFormat clipboardFormat = converter->getFormat(); if (m_added[clipboardFormat]) { try { data = converter->fromIClipboard(m_data[clipboardFormat]); format = converter->getDataSize(); type = converter->getAtom(); } catch (...) { // ignore -- cannot convert } } } } if (type != None) { // success LOG((CLOG_DEBUG1 "success")); insertReply(new CReply(requestor, target, time, property, data, type, format)); return true; } else { // failure LOG((CLOG_DEBUG1 "failed")); insertReply(new CReply(requestor, target, time)); return false; } } bool CXWindowsClipboard::processRequest(Window requestor, ::Time /*time*/, Atom property) { CReplyMap::iterator index = m_replies.find(requestor); if (index == m_replies.end()) { // unknown requestor window return false; } LOG((CLOG_DEBUG1 "received property %s delete from 0x08%x", CXWindowsUtil::atomToString(m_display, property).c_str(), requestor)); // find the property in the known requests. it should be the // first property but we'll check 'em all if we have to. CReplyList& replies = index->second; for (CReplyList::iterator index2 = replies.begin(); index2 != replies.end(); ++index2) { CReply* reply = *index2; if (reply->m_replied && reply->m_property == property) { // if reply is complete then remove it and start the // next one. pushReplies(index, replies, index2); return true; } } return false; } bool CXWindowsClipboard::destroyRequest(Window requestor) { CReplyMap::iterator index = m_replies.find(requestor); if (index == m_replies.end()) { // unknown requestor window return false; } // destroy all replies for this window clearReplies(index->second); m_replies.erase(index); // note -- we don't stop watching the window for events because // we're called in response to the window being destroyed. return true; } Window CXWindowsClipboard::getWindow() const { return m_window; } Atom CXWindowsClipboard::getSelection() const { return m_selection; } bool CXWindowsClipboard::empty() { assert(m_open); LOG((CLOG_DEBUG "empty clipboard %d", m_id)); // assert ownership of clipboard XSetSelectionOwner(m_display, m_selection, m_window, m_time); if (XGetSelectionOwner(m_display, m_selection) != m_window) { LOG((CLOG_DEBUG "failed to grab clipboard %d", m_id)); return false; } // clear all data. since we own the data now, the cache is up // to date. clearCache(); m_cached = true; // FIXME -- actually delete motif clipboard items? // FIXME -- do anything to motif clipboard properties? // save time m_timeOwned = m_time; m_timeLost = 0; // we're the owner now m_owner = true; LOG((CLOG_DEBUG "grabbed clipboard %d", m_id)); return true; } void CXWindowsClipboard::add(EFormat format, const CString& data) { assert(m_open); assert(m_owner); LOG((CLOG_DEBUG "add %d bytes to clipboard %d format: %d", data.size(), m_id, format)); m_data[format] = data; m_added[format] = true; // FIXME -- set motif clipboard item? } bool CXWindowsClipboard::open(Time time) const { assert(!m_open); LOG((CLOG_DEBUG "open clipboard %d", m_id)); // assume not motif m_motif = false; // lock clipboard if (m_id == kClipboardClipboard) { if (!motifLockClipboard()) { return false; } // check if motif owns the selection. unlock motif clipboard // if it does not. m_motif = motifOwnsClipboard(); LOG((CLOG_DEBUG1 "motif does %sown clipboard", m_motif ? "" : "not ")); if (!m_motif) { motifUnlockClipboard(); } } // now open m_open = true; m_time = time; // be sure to flush the cache later if it's dirty m_checkCache = true; return true; } void CXWindowsClipboard::close() const { assert(m_open); LOG((CLOG_DEBUG "close clipboard %d", m_id)); // unlock clipboard if (m_motif) { motifUnlockClipboard(); } m_motif = false; m_open = false; } IClipboard::Time CXWindowsClipboard::getTime() const { checkCache(); return m_timeOwned; } bool CXWindowsClipboard::has(EFormat format) const { assert(m_open); fillCache(); return m_added[format]; } CString CXWindowsClipboard::get(EFormat format) const { assert(m_open); fillCache(); return m_data[format]; } void CXWindowsClipboard::clearConverters() { for (ConverterList::iterator index = m_converters.begin(); index != m_converters.end(); ++index) { delete *index; } m_converters.clear(); } IXWindowsClipboardConverter* CXWindowsClipboard::getConverter(Atom target, bool onlyIfNotAdded) const { IXWindowsClipboardConverter* converter = NULL; for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { converter = *index; if (converter->getAtom() == target) { break; } } if (converter == NULL) { LOG((CLOG_DEBUG1 " no converter for target %s", CXWindowsUtil::atomToString(m_display, target).c_str())); return NULL; } // optionally skip already handled targets if (onlyIfNotAdded) { if (m_added[converter->getFormat()]) { LOG((CLOG_DEBUG1 " skipping handled format %d", converter->getFormat())); return NULL; } } return converter; } void CXWindowsClipboard::checkCache() const { if (!m_checkCache) { return; } m_checkCache = false; // get the time the clipboard ownership was taken by the current // owner. if (m_motif) { m_timeOwned = motifGetTime(); } else { m_timeOwned = icccmGetTime(); } // if we can't get the time then use the time passed to us if (m_timeOwned == 0) { m_timeOwned = m_time; } // if the cache is dirty then flush it if (m_timeOwned != m_cacheTime) { clearCache(); } } void CXWindowsClipboard::clearCache() const { const_cast(this)->doClearCache(); } void CXWindowsClipboard::doClearCache() { m_checkCache = false; m_cached = false; for (SInt32 index = 0; index < kNumFormats; ++index) { m_data[index] = ""; m_added[index] = false; } } void CXWindowsClipboard::fillCache() const { // get the selection data if not already cached checkCache(); if (!m_cached) { const_cast(this)->doFillCache(); } } void CXWindowsClipboard::doFillCache() { if (m_motif) { motifFillCache(); } else { icccmFillCache(); } m_checkCache = false; m_cached = true; m_cacheTime = m_timeOwned; } void CXWindowsClipboard::icccmFillCache() { LOG((CLOG_DEBUG "ICCCM fill clipboard %d", m_id)); // see if we can get the list of available formats from the selection. // if not then use a default list of formats. note that some clipboard // owners are broken and report TARGETS as the type of the TARGETS data // instead of the correct type ATOM; allow either. const Atom atomTargets = m_atomTargets; Atom target; CString data; if (!icccmGetSelection(atomTargets, &target, &data) || (target != m_atomAtom && target != m_atomTargets)) { LOG((CLOG_DEBUG1 "selection doesn't support TARGETS")); data = ""; CXWindowsUtil::appendAtomData(data, XA_STRING); } CXWindowsUtil::convertAtomProperty(data); const Atom* targets = reinterpret_cast(data.data()); const UInt32 numTargets = data.size() / sizeof(Atom); LOG((CLOG_DEBUG " available targets: %s", CXWindowsUtil::atomsToString(m_display, targets, numTargets).c_str())); // try each converter in order (because they're in order of // preference). for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IXWindowsClipboardConverter* converter = *index; // skip already handled targets if (m_added[converter->getFormat()]) { continue; } // see if atom is in target list Atom target = None; // XXX -- just ask for the converter's target to see if it's // available rather than checking TARGETS. i've seen clipboard // owners that don't report all the targets they support. target = converter->getAtom(); /* for (UInt32 i = 0; i < numTargets; ++i) { if (converter->getAtom() == targets[i]) { target = targets[i]; break; } } */ if (target == None) { continue; } // get the data Atom actualTarget; CString targetData; if (!icccmGetSelection(target, &actualTarget, &targetData)) { LOG((CLOG_DEBUG1 " no data for target %s", CXWindowsUtil::atomToString(m_display, target).c_str())); continue; } // add to clipboard and note we've done it IClipboard::EFormat format = converter->getFormat(); m_data[format] = converter->toIClipboard(targetData); m_added[format] = true; LOG((CLOG_DEBUG " added format %d for target %s (%u %s)", format, CXWindowsUtil::atomToString(m_display, target).c_str(), targetData.size(), targetData.size() == 1 ? "byte" : "bytes")); } } bool CXWindowsClipboard::icccmGetSelection(Atom target, Atom* actualTarget, CString* data) const { assert(actualTarget != NULL); assert(data != NULL); // request data conversion CICCCMGetClipboard getter(m_window, m_time, m_atomData); if (!getter.readClipboard(m_display, m_selection, target, actualTarget, data)) { LOG((CLOG_DEBUG1 "can't get data for selection target %s", CXWindowsUtil::atomToString(m_display, target).c_str())); LOGC(getter.m_error, (CLOG_WARN "ICCCM violation by clipboard owner")); return false; } else if (*actualTarget == None) { LOG((CLOG_DEBUG1 "selection conversion failed for target %s", CXWindowsUtil::atomToString(m_display, target).c_str())); return false; } return true; } IClipboard::Time CXWindowsClipboard::icccmGetTime() const { Atom actualTarget; CString data; if (icccmGetSelection(m_atomTimestamp, &actualTarget, &data) && actualTarget == m_atomInteger) { Time time = *reinterpret_cast(data.data()); LOG((CLOG_DEBUG1 "got ICCCM time %d", time)); return time; } else { // no timestamp LOG((CLOG_DEBUG1 "can't get ICCCM time")); return 0; } } bool CXWindowsClipboard::motifLockClipboard() const { // fail if anybody owns the lock (even us, so this is non-recursive) Window lockOwner = XGetSelectionOwner(m_display, m_atomMotifClipLock); if (lockOwner != None) { LOG((CLOG_DEBUG1 "motif lock owner 0x%08x", lockOwner)); return false; } // try to grab the lock // FIXME -- is this right? there's a race condition here -- // A grabs successfully, B grabs successfully, A thinks it // still has the grab until it gets a SelectionClear. Time time = CXWindowsUtil::getCurrentTime(m_display, m_window); XSetSelectionOwner(m_display, m_atomMotifClipLock, m_window, time); lockOwner = XGetSelectionOwner(m_display, m_atomMotifClipLock); if (lockOwner != m_window) { LOG((CLOG_DEBUG1 "motif lock owner 0x%08x", lockOwner)); return false; } LOG((CLOG_DEBUG1 "locked motif clipboard")); return true; } void CXWindowsClipboard::motifUnlockClipboard() const { LOG((CLOG_DEBUG1 "unlocked motif clipboard")); // fail if we don't own the lock Window lockOwner = XGetSelectionOwner(m_display, m_atomMotifClipLock); if (lockOwner != m_window) { return; } // release lock Time time = CXWindowsUtil::getCurrentTime(m_display, m_window); XSetSelectionOwner(m_display, m_atomMotifClipLock, None, time); } bool CXWindowsClipboard::motifOwnsClipboard() const { // get the current selection owner // FIXME -- this can't be right. even if the window is destroyed // Motif will still have a valid clipboard. how can we tell if // some other client owns CLIPBOARD? Window owner = XGetSelectionOwner(m_display, m_selection); if (owner == None) { return false; } // get the Motif clipboard header property from the root window Atom target; SInt32 format; CString data; Window root = RootWindow(m_display, DefaultScreen(m_display)); if (!CXWindowsUtil::getWindowProperty(m_display, root, m_atomMotifClipHeader, &data, &target, &format, False)) { return false; } // check the owner window against the current clipboard owner const CMotifClipHeader* header = reinterpret_cast(data.data()); if (data.size() >= sizeof(CMotifClipHeader) && header->m_id == kMotifClipHeader) { if (static_cast(header->m_selectionOwner) == owner) { return true; } } return false; } void CXWindowsClipboard::motifFillCache() { LOG((CLOG_DEBUG "Motif fill clipboard %d", m_id)); // get the Motif clipboard header property from the root window Atom target; SInt32 format; CString data; Window root = RootWindow(m_display, DefaultScreen(m_display)); if (!CXWindowsUtil::getWindowProperty(m_display, root, m_atomMotifClipHeader, &data, &target, &format, False)) { return; } // check that the header is okay const CMotifClipHeader* header = reinterpret_cast(data.data()); if (data.size() < sizeof(CMotifClipHeader) || header->m_id != kMotifClipHeader || header->m_numItems < 1) { return; } // get the Motif item property from the root window char name[18 + 20]; sprintf(name, "_MOTIF_CLIP_ITEM_%d", header->m_item); Atom atomItem = XInternAtom(m_display, name, False); data = ""; if (!CXWindowsUtil::getWindowProperty(m_display, root, atomItem, &data, &target, &format, False)) { return; } // check that the item is okay const CMotifClipItem* item = reinterpret_cast(data.data()); if (data.size() < sizeof(CMotifClipItem) || item->m_id != kMotifClipItem || item->m_numFormats - item->m_numDeletedFormats < 1) { return; } // format list is after static item structure elements const SInt32 numFormats = item->m_numFormats - item->m_numDeletedFormats; const SInt32* formats = reinterpret_cast(item->m_size + reinterpret_cast(data.data())); // get the available formats typedef std::map CMotifFormatMap; CMotifFormatMap motifFormats; for (SInt32 i = 0; i < numFormats; ++i) { // get Motif format property from the root window sprintf(name, "_MOTIF_CLIP_ITEM_%d", formats[i]); Atom atomFormat = XInternAtom(m_display, name, False); CString data; if (!CXWindowsUtil::getWindowProperty(m_display, root, atomFormat, &data, &target, &format, False)) { continue; } // check that the format is okay const CMotifClipFormat* motifFormat = reinterpret_cast(data.data()); if (data.size() < sizeof(CMotifClipFormat) || motifFormat->m_id != kMotifClipFormat || motifFormat->m_length < 0 || motifFormat->m_type == None || motifFormat->m_deleted != 0) { continue; } // save it motifFormats.insert(std::make_pair(motifFormat->m_type, data)); } //const UInt32 numMotifFormats = motifFormats.size(); // try each converter in order (because they're in order of // preference). for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IXWindowsClipboardConverter* converter = *index; // skip already handled targets if (m_added[converter->getFormat()]) { continue; } // see if atom is in target list CMotifFormatMap::const_iterator index2 = motifFormats.find(converter->getAtom()); if (index2 == motifFormats.end()) { continue; } // get format const CMotifClipFormat* motifFormat = reinterpret_cast( index2->second.data()); const Atom target = motifFormat->m_type; // get the data (finally) Atom actualTarget; CString targetData; if (!motifGetSelection(motifFormat, &actualTarget, &targetData)) { LOG((CLOG_DEBUG1 " no data for target %s", CXWindowsUtil::atomToString(m_display, target).c_str())); continue; } // add to clipboard and note we've done it IClipboard::EFormat format = converter->getFormat(); m_data[format] = converter->toIClipboard(targetData); m_added[format] = true; LOG((CLOG_DEBUG " added format %d for target %s", format, CXWindowsUtil::atomToString(m_display, target).c_str())); } } bool CXWindowsClipboard::motifGetSelection(const CMotifClipFormat* format, Atom* actualTarget, CString* data) const { // if the current clipboard owner and the owner indicated by the // motif clip header are the same then transfer via a property on // the root window, otherwise transfer as a normal ICCCM client. if (!motifOwnsClipboard()) { return icccmGetSelection(format->m_type, actualTarget, data); } // use motif way // FIXME -- this isn't right. it'll only work if the data is // already stored on the root window and only if it fits in a // property. motif has some scheme for transferring part by // part that i don't know. char name[18 + 20]; sprintf(name, "_MOTIF_CLIP_ITEM_%d", format->m_data); Atom target = XInternAtom(m_display, name, False); Window root = RootWindow(m_display, DefaultScreen(m_display)); return CXWindowsUtil::getWindowProperty(m_display, root, target, data, actualTarget, NULL, False); } IClipboard::Time CXWindowsClipboard::motifGetTime() const { return icccmGetTime(); } bool CXWindowsClipboard::insertMultipleReply(Window requestor, ::Time time, Atom property) { // get the requested targets Atom target; SInt32 format; CString data; if (!CXWindowsUtil::getWindowProperty(m_display, requestor, property, &data, &target, &format, False)) { // can't get the requested targets return false; } // fail if the requested targets isn't of the correct form if (format != 32 || target != m_atomAtomPair) { return false; } // data is a list of atom pairs: target, property CXWindowsUtil::convertAtomProperty(data); const Atom* targets = reinterpret_cast(data.data()); const UInt32 numTargets = data.size() / sizeof(Atom); // add replies for each target bool changed = false; for (UInt32 i = 0; i < numTargets; i += 2) { const Atom target = targets[i + 0]; const Atom property = targets[i + 1]; if (!addSimpleRequest(requestor, target, time, property)) { // note that we can't perform the requested conversion CXWindowsUtil::replaceAtomData(data, i, None); changed = true; } } // update the targets property if we changed it if (changed) { CXWindowsUtil::setWindowProperty(m_display, requestor, property, data.data(), data.size(), target, format); } // add reply for MULTIPLE request insertReply(new CReply(requestor, m_atomMultiple, time, property, CString(), None, 32)); return true; } void CXWindowsClipboard::insertReply(CReply* reply) { assert(reply != NULL); // note -- we must respond to requests in order if requestor,target,time // are the same, otherwise we can use whatever order we like with one // exception: each reply in a MULTIPLE reply must be handled in order // as well. those replies will almost certainly not share targets so // we can't simply use requestor,target,time as map index. // // instead we'll use just the requestor. that's more restrictive than // necessary but we're guaranteed to do things in the right order. // note that we could also include the time in the map index and still // ensure the right order. but since that'll just make it harder to // find the right reply when handling property notify events we stick // to just the requestor. const bool newWindow = (m_replies.count(reply->m_requestor) == 0); m_replies[reply->m_requestor].push_back(reply); // adjust requestor's event mask if we haven't done so already. we // want events in case the window is destroyed or any of its // properties change. if (newWindow) { // note errors while we adjust event masks bool error = false; { CXWindowsUtil::CErrorLock lock(m_display, &error); // get and save the current event mask XWindowAttributes attr; XGetWindowAttributes(m_display, reply->m_requestor, &attr); m_eventMasks[reply->m_requestor] = attr.your_event_mask; // add the events we want XSelectInput(m_display, reply->m_requestor, attr.your_event_mask | StructureNotifyMask | PropertyChangeMask); } // if we failed then the window has already been destroyed if (error) { m_replies.erase(reply->m_requestor); delete reply; } } } void CXWindowsClipboard::pushReplies() { // send the first reply for each window if that reply hasn't // been sent yet. for (CReplyMap::iterator index = m_replies.begin(); index != m_replies.end(); ) { assert(!index->second.empty()); if (!index->second.front()->m_replied) { pushReplies(index, index->second, index->second.begin()); } else { ++index; } } } void CXWindowsClipboard::pushReplies(CReplyMap::iterator& mapIndex, CReplyList& replies, CReplyList::iterator index) { CReply* reply = *index; while (sendReply(reply)) { // reply is complete. discard it and send the next reply, // if any. index = replies.erase(index); delete reply; if (index == replies.end()) { break; } reply = *index; } // if there are no more replies in the list then remove the list // and stop watching the requestor for events. if (replies.empty()) { CXWindowsUtil::CErrorLock lock(m_display); Window requestor = mapIndex->first; XSelectInput(m_display, requestor, m_eventMasks[requestor]); m_replies.erase(mapIndex++); m_eventMasks.erase(requestor); } else { ++mapIndex; } } bool CXWindowsClipboard::sendReply(CReply* reply) { assert(reply != NULL); // bail out immediately if reply is done if (reply->m_done) { LOG((CLOG_DEBUG1 "clipboard: finished reply to 0x%08x,%d,%d", reply->m_requestor, reply->m_target, reply->m_property)); return true; } // start in failed state if property is None bool failed = (reply->m_property == None); if (!failed) { LOG((CLOG_DEBUG1 "clipboard: setting property on 0x%08x,%d,%d", reply->m_requestor, reply->m_target, reply->m_property)); // send using INCR if already sending incrementally or if reply // is too large, otherwise just send it. const UInt32 maxRequestSize = 3 * XMaxRequestSize(m_display); const bool useINCR = (reply->m_data.size() > maxRequestSize); // send INCR reply if incremental and we haven't replied yet if (useINCR && !reply->m_replied) { UInt32 size = reply->m_data.size(); if (!CXWindowsUtil::setWindowProperty(m_display, reply->m_requestor, reply->m_property, &size, 4, m_atomINCR, 32)) { failed = true; } } // send more INCR reply or entire non-incremental reply else { // how much more data should we send? UInt32 size = reply->m_data.size() - reply->m_ptr; if (size > maxRequestSize) size = maxRequestSize; // send it if (!CXWindowsUtil::setWindowProperty(m_display, reply->m_requestor, reply->m_property, reply->m_data.data() + reply->m_ptr, size, reply->m_type, reply->m_format)) { failed = true; } else { reply->m_ptr += size; // we've finished the reply if we just sent the zero // size incremental chunk or if we're not incremental. reply->m_done = (size == 0 || !useINCR); } } } // if we've failed then delete the property and say we're done. // if we haven't replied yet then we can send a failure notify, // otherwise we've failed in the middle of an incremental // transfer; i don't know how to cancel that so i'll just send // the final zero-length property. // FIXME -- how do you gracefully cancel an incremental transfer? if (failed) { LOG((CLOG_DEBUG1 "clipboard: sending failure to 0x%08x,%d,%d", reply->m_requestor, reply->m_target, reply->m_property)); reply->m_done = true; if (reply->m_property != None) { CXWindowsUtil::CErrorLock lock(m_display); XDeleteProperty(m_display, reply->m_requestor, reply->m_property); } if (!reply->m_replied) { sendNotify(reply->m_requestor, m_selection, reply->m_target, None, reply->m_time); // don't wait for any reply (because we're not expecting one) return true; } else { static const char dummy = 0; CXWindowsUtil::setWindowProperty(m_display, reply->m_requestor, reply->m_property, &dummy, 0, reply->m_type, reply->m_format); // wait for delete notify return false; } } // send notification if we haven't yet if (!reply->m_replied) { LOG((CLOG_DEBUG1 "clipboard: sending notify to 0x%08x,%d,%d", reply->m_requestor, reply->m_target, reply->m_property)); reply->m_replied = true; // dump every property on the requestor window to the debug2 // log. we've seen what appears to be a bug in lesstif and // knowing the properties may help design a workaround, if // it becomes necessary. if (CLOG->getFilter() >= kDEBUG2) { CXWindowsUtil::CErrorLock lock(m_display); int n; Atom* props = XListProperties(m_display, reply->m_requestor, &n); LOG((CLOG_DEBUG2 "properties of 0x%08x:", reply->m_requestor)); for (int i = 0; i < n; ++i) { Atom target; CString data; char* name = XGetAtomName(m_display, props[i]); if (!CXWindowsUtil::getWindowProperty(m_display, reply->m_requestor, props[i], &data, &target, NULL, False)) { LOG((CLOG_DEBUG2 " %s: ", name)); } else { // if there are any non-ascii characters in string // then print the binary data. static const char* hex = "0123456789abcdef"; for (CString::size_type j = 0; j < data.size(); ++j) { if (data[j] < 32 || data[j] > 126) { CString tmp; tmp.reserve(data.size() * 3); for (j = 0; j < data.size(); ++j) { unsigned char v = (unsigned char)data[j]; tmp += hex[v >> 16]; tmp += hex[v & 15]; tmp += ' '; } data = tmp; break; } } char* type = XGetAtomName(m_display, target); LOG((CLOG_DEBUG2 " %s (%s): %s", name, type, data.c_str())); if (type != NULL) { XFree(type); } } if (name != NULL) { XFree(name); } } if (props != NULL) { XFree(props); } } sendNotify(reply->m_requestor, m_selection, reply->m_target, reply->m_property, reply->m_time); } // wait for delete notify return false; } void CXWindowsClipboard::clearReplies() { for (CReplyMap::iterator index = m_replies.begin(); index != m_replies.end(); ++index) { clearReplies(index->second); } m_replies.clear(); m_eventMasks.clear(); } void CXWindowsClipboard::clearReplies(CReplyList& replies) { for (CReplyList::iterator index = replies.begin(); index != replies.end(); ++index) { delete *index; } replies.clear(); } void CXWindowsClipboard::sendNotify(Window requestor, Atom selection, Atom target, Atom property, Time time) { XEvent event; event.xselection.type = SelectionNotify; event.xselection.display = m_display; event.xselection.requestor = requestor; event.xselection.selection = selection; event.xselection.target = target; event.xselection.property = property; event.xselection.time = time; CXWindowsUtil::CErrorLock lock(m_display); XSendEvent(m_display, requestor, False, 0, &event); } bool CXWindowsClipboard::wasOwnedAtTime(::Time time) const { // not owned if we've never owned the selection checkCache(); if (m_timeOwned == 0) { return false; } // if time is CurrentTime then return true if we still own the // selection and false if we do not. else if we still own the // selection then get the current time, otherwise use // m_timeLost as the end time. Time lost = m_timeLost; if (m_timeLost == 0) { if (time == CurrentTime) { return true; } else { lost = CXWindowsUtil::getCurrentTime(m_display, m_window); } } else { if (time == CurrentTime) { return false; } } // compare time to range Time duration = lost - m_timeOwned; Time when = time - m_timeOwned; return (/*when >= 0 &&*/ when <= duration); } Atom CXWindowsClipboard::getTargetsData(CString& data, int* format) const { assert(format != NULL); // add standard targets CXWindowsUtil::appendAtomData(data, m_atomTargets); CXWindowsUtil::appendAtomData(data, m_atomMultiple); CXWindowsUtil::appendAtomData(data, m_atomTimestamp); // add targets we can convert to for (ConverterList::const_iterator index = m_converters.begin(); index != m_converters.end(); ++index) { IXWindowsClipboardConverter* converter = *index; // skip formats we don't have if (m_added[converter->getFormat()]) { CXWindowsUtil::appendAtomData(data, converter->getAtom()); } } *format = 32; return m_atomAtom; } Atom CXWindowsClipboard::getTimestampData(CString& data, int* format) const { assert(format != NULL); checkCache(); CXWindowsUtil::appendTimeData(data, m_timeOwned); *format = 32; return m_atomInteger; } // // CXWindowsClipboard::CICCCMGetClipboard // CXWindowsClipboard::CICCCMGetClipboard::CICCCMGetClipboard( Window requestor, Time time, Atom property) : m_requestor(requestor), m_time(time), m_property(property), m_incr(false), m_failed(false), m_done(false), m_reading(false), m_data(NULL), m_actualTarget(NULL), m_error(false) { // do nothing } CXWindowsClipboard::CICCCMGetClipboard::~CICCCMGetClipboard() { // do nothing } bool CXWindowsClipboard::CICCCMGetClipboard::readClipboard(Display* display, Atom selection, Atom target, Atom* actualTarget, CString* data) { assert(actualTarget != NULL); assert(data != NULL); LOG((CLOG_DEBUG1 "request selection=%s, target=%s, window=%x", CXWindowsUtil::atomToString(display, selection).c_str(), CXWindowsUtil::atomToString(display, target).c_str(), m_requestor)); m_atomNone = XInternAtom(display, "NONE", False); m_atomIncr = XInternAtom(display, "INCR", False); // save output pointers m_actualTarget = actualTarget; m_data = data; // assume failure *m_actualTarget = None; *m_data = ""; // delete target property XDeleteProperty(display, m_requestor, m_property); // select window for property changes XWindowAttributes attr; XGetWindowAttributes(display, m_requestor, &attr); XSelectInput(display, m_requestor, attr.your_event_mask | PropertyChangeMask); // request data conversion XConvertSelection(display, selection, target, m_property, m_requestor, m_time); // synchronize with server before we start following timeout countdown XSync(display, False); // Xlib inexplicably omits the ability to wait for an event with // a timeout. (it's inexplicable because there's no portable way // to do it.) we'll poll until we have what we're looking for or // a timeout expires. we use a timeout so we don't get locked up // by badly behaved selection owners. XEvent xevent; std::vector events; CStopwatch timeout(true); static const double s_timeout = 0.25; // FIXME -- is this too short? bool noWait = false; while (!m_done && !m_failed) { // fail if timeout has expired if (timeout.getTime() >= s_timeout) { m_failed = true; break; } // process events if any otherwise sleep if (noWait || XPending(display) > 0) { while (!m_done && !m_failed && (noWait || XPending(display) > 0)) { XNextEvent(display, &xevent); if (!processEvent(display, &xevent)) { // not processed so save it events.push_back(xevent); } else { // reset timer since we've made some progress timeout.reset(); // don't sleep anymore, just block waiting for events. // we're assuming here that the clipboard owner will // complete the protocol correctly. if we continue to // sleep we'll get very bad performance. noWait = true; } } } else { ARCH->sleep(0.01); } } // put unprocessed events back for (UInt32 i = events.size(); i > 0; --i) { XPutBackEvent(display, &events[i - 1]); } // restore mask XSelectInput(display, m_requestor, attr.your_event_mask); // return success or failure LOG((CLOG_DEBUG1 "request %s", m_failed ? "failed" : "succeeded")); return !m_failed; } bool CXWindowsClipboard::CICCCMGetClipboard::processEvent( Display* display, XEvent* xevent) { // process event switch (xevent->type) { case DestroyNotify: if (xevent->xdestroywindow.window == m_requestor) { m_failed = true; return true; } // not interested return false; case SelectionNotify: if (xevent->xselection.requestor == m_requestor) { // done if we can't convert if (xevent->xselection.property == None || xevent->xselection.property == m_atomNone) { m_done = true; return true; } // proceed if conversion successful else if (xevent->xselection.property == m_property) { m_reading = true; break; } } // otherwise not interested return false; case PropertyNotify: // proceed if conversion successful and we're receiving more data if (xevent->xproperty.window == m_requestor && xevent->xproperty.atom == m_property && xevent->xproperty.state == PropertyNewValue) { if (!m_reading) { // we haven't gotten the SelectionNotify yet return true; } break; } // otherwise not interested return false; default: // not interested return false; } // get the data from the property Atom target; const CString::size_type oldSize = m_data->size(); if (!CXWindowsUtil::getWindowProperty(display, m_requestor, m_property, m_data, &target, NULL, True)) { // unable to read property m_failed = true; return true; } // note if incremental. if we're already incremental then the // selection owner is busted. if the INCR property has no size // then the selection owner is busted. if (target == m_atomIncr) { if (m_incr) { m_failed = true; m_error = true; } else if (m_data->size() == oldSize) { m_failed = true; m_error = true; } else { m_incr = true; // discard INCR data *m_data = ""; } } // handle incremental chunks else if (m_incr) { // if first incremental chunk then save target if (oldSize == 0) { LOG((CLOG_DEBUG1 " INCR first chunk, target %s", CXWindowsUtil::atomToString(display, target).c_str())); *m_actualTarget = target; } // secondary chunks must have the same target else { if (target != *m_actualTarget) { LOG((CLOG_WARN " INCR target mismatch")); m_failed = true; m_error = true; } } // note if this is the final chunk if (m_data->size() == oldSize) { LOG((CLOG_DEBUG1 " INCR final chunk: %d bytes total", m_data->size())); m_done = true; } } // not incremental; save the target. else { LOG((CLOG_DEBUG1 " target %s", CXWindowsUtil::atomToString(display, target).c_str())); *m_actualTarget = target; m_done = true; } // this event has been processed LOGC(!m_incr, (CLOG_DEBUG1 " got data, %d bytes", m_data->size())); return true; } // // CXWindowsClipboard::CReply // CXWindowsClipboard::CReply::CReply(Window requestor, Atom target, ::Time time) : m_requestor(requestor), m_target(target), m_time(time), m_property(None), m_replied(false), m_done(false), m_data(), m_type(None), m_format(32), m_ptr(0) { // do nothing } CXWindowsClipboard::CReply::CReply(Window requestor, Atom target, ::Time time, Atom property, const CString& data, Atom type, int format) : m_requestor(requestor), m_target(target), m_time(time), m_property(property), m_replied(false), m_done(false), m_data(data), m_type(type), m_format(format), m_ptr(0) { // do nothing } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboard.h0000600000175000017500000002354112021261364023550 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARD_H #define CXWINDOWSCLIPBOARD_H #include "IClipboard.h" #include "ClipboardTypes.h" #include "stdmap.h" #include "stdlist.h" #include "stdvector.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include #endif class IXWindowsClipboardConverter; //! X11 clipboard implementation class CXWindowsClipboard : public IClipboard { public: /*! Use \c window as the window that owns or interacts with the clipboard identified by \c id. */ CXWindowsClipboard(Display*, Window window, ClipboardID id); virtual ~CXWindowsClipboard(); //! Notify clipboard was lost /*! Tells clipboard it lost ownership at the given time. */ void lost(Time); //! Add clipboard request /*! Adds a selection request to the request list. If the given owner window isn't this clipboard's window then this simply sends a failure event to the requestor. */ void addRequest(Window owner, Window requestor, Atom target, ::Time time, Atom property); //! Process clipboard request /*! Continues processing a selection request. Returns true if the request was handled, false if the request was unknown. */ bool processRequest(Window requestor, ::Time time, Atom property); //! Cancel clipboard request /*! Terminate a selection request. Returns true iff the request was known and handled. */ bool destroyRequest(Window requestor); //! Get window /*! Returns the clipboard's window (passed the c'tor). */ Window getWindow() const; //! Get selection atom /*! Returns the selection atom that identifies the clipboard to X11 (e.g. XA_PRIMARY). */ Atom getSelection() const; // IClipboard overrides virtual bool empty(); virtual void add(EFormat, const CString& data); virtual bool open(Time) const; virtual void close() const; virtual Time getTime() const; virtual bool has(EFormat) const; virtual CString get(EFormat) const; private: // remove all converters from our list void clearConverters(); // get the converter for a clipboard format. returns NULL if no // suitable converter. iff onlyIfNotAdded is true then also // return NULL if a suitable converter was found but we already // have data of the converter's clipboard format. IXWindowsClipboardConverter* getConverter(Atom target, bool onlyIfNotAdded = false) const; // convert target atom to clipboard format EFormat getFormat(Atom target) const; // add a non-MULTIPLE request. does not verify that the selection // was owned at the given time. returns true if the conversion // could be performed, false otherwise. in either case, the // reply is inserted. bool addSimpleRequest( Window requestor, Atom target, ::Time time, Atom property); // if not already checked then see if the cache is stale and, if so, // clear it. this has the side effect of updating m_timeOwned. void checkCache() const; // clear the cache, resetting the cached flag and the added flag for // each format. void clearCache() const; void doClearCache(); // cache all formats of the selection void fillCache() const; void doFillCache(); // // helper classes // // read an ICCCM conforming selection class CICCCMGetClipboard { public: CICCCMGetClipboard(Window requestor, Time time, Atom property); ~CICCCMGetClipboard(); // convert the given selection to the given type. returns // true iff the conversion was successful or the conversion // cannot be performed (in which case *actualTarget == None). bool readClipboard(Display* display, Atom selection, Atom target, Atom* actualTarget, CString* data); private: bool processEvent(Display* display, XEvent* event); private: Window m_requestor; Time m_time; Atom m_property; bool m_incr; bool m_failed; bool m_done; // atoms needed for the protocol Atom m_atomNone; // NONE, not None Atom m_atomIncr; // true iff we've received the selection notify bool m_reading; // the converted selection data CString* m_data; // the actual type of the data. if this is None then the // selection owner cannot convert to the requested type. Atom* m_actualTarget; public: // true iff the selection owner didn't follow ICCCM conventions bool m_error; }; // Motif structure IDs enum { kMotifClipFormat = 1, kMotifClipItem, kMotifClipHeader }; // _MOTIF_CLIP_HEADER structure class CMotifClipHeader { public: SInt32 m_id; // kMotifClipHeader SInt32 m_pad1[3]; SInt32 m_item; SInt32 m_pad2[4]; SInt32 m_numItems; SInt32 m_pad3[3]; SInt32 m_selectionOwner; // a Window SInt32 m_pad4[2]; }; // Motif clip item structure class CMotifClipItem { public: SInt32 m_id; // kMotifClipItem SInt32 m_pad1[5]; SInt32 m_size; SInt32 m_numFormats; SInt32 m_numDeletedFormats; SInt32 m_pad2[6]; }; // Motif clip format structure class CMotifClipFormat { public: SInt32 m_id; // kMotifClipFormat SInt32 m_pad1[6]; SInt32 m_length; SInt32 m_data; SInt32 m_type; // an Atom SInt32 m_pad2[1]; SInt32 m_deleted; SInt32 m_pad3[4]; }; // stores data needed to respond to a selection request class CReply { public: CReply(Window, Atom target, ::Time); CReply(Window, Atom target, ::Time, Atom property, const CString& data, Atom type, int format); public: // information about the request Window m_requestor; Atom m_target; ::Time m_time; Atom m_property; // true iff we've sent the notification for this reply bool m_replied; // true iff the reply has sent its last message bool m_done; // the data to send and its type and format CString m_data; Atom m_type; int m_format; // index of next byte in m_data to send UInt32 m_ptr; }; typedef std::list CReplyList; typedef std::map CReplyMap; typedef std::map CReplyEventMask; // ICCCM interoperability methods void icccmFillCache(); bool icccmGetSelection(Atom target, Atom* actualTarget, CString* data) const; Time icccmGetTime() const; // motif interoperability methods bool motifLockClipboard() const; void motifUnlockClipboard() const; bool motifOwnsClipboard() const; void motifFillCache(); bool motifGetSelection(const CMotifClipFormat*, Atom* actualTarget, CString* data) const; Time motifGetTime() const; // reply methods bool insertMultipleReply(Window, ::Time, Atom); void insertReply(CReply*); void pushReplies(); void pushReplies(CReplyMap::iterator&, CReplyList&, CReplyList::iterator); bool sendReply(CReply*); void clearReplies(); void clearReplies(CReplyList&); void sendNotify(Window requestor, Atom selection, Atom target, Atom property, Time time); bool wasOwnedAtTime(::Time) const; // data conversion methods Atom getTargetsData(CString&, int* format) const; Atom getTimestampData(CString&, int* format) const; private: typedef std::vector ConverterList; Display* m_display; Window m_window; ClipboardID m_id; Atom m_selection; mutable bool m_open; mutable Time m_time; bool m_owner; mutable Time m_timeOwned; Time m_timeLost; // true iff open and clipboard owned by a motif app mutable bool m_motif; // the added/cached clipboard data mutable bool m_checkCache; bool m_cached; Time m_cacheTime; bool m_added[kNumFormats]; CString m_data[kNumFormats]; // conversion request replies CReplyMap m_replies; CReplyEventMask m_eventMasks; // clipboard format converters ConverterList m_converters; // atoms we'll need Atom m_atomTargets; Atom m_atomMultiple; Atom m_atomTimestamp; Atom m_atomInteger; Atom m_atomAtom; Atom m_atomAtomPair; Atom m_atomData; Atom m_atomINCR; Atom m_atomMotifClipLock; Atom m_atomMotifClipHeader; Atom m_atomMotifClipAccess; Atom m_atomGDKSelection; }; //! Clipboard format converter interface /*! This interface defines the methods common to all X11 clipboard format converters. */ class IXWindowsClipboardConverter : public IInterface { public: //! @name accessors //@{ //! Get clipboard format /*! Return the clipboard format this object converts from/to. */ virtual IClipboard::EFormat getFormat() const = 0; //! Get X11 format atom /*! Return the atom representing the X selection format that this object converts from/to. */ virtual Atom getAtom() const = 0; //! Get X11 property datum size /*! Return the size (in bits) of data elements returned by toIClipboard(). */ virtual int getDataSize() const = 0; //! Convert from IClipboard format /*! Convert from the IClipboard format to the X selection format. The input data must be in the IClipboard format returned by getFormat(). The return data will be in the X selection format returned by getAtom(). */ virtual CString fromIClipboard(const CString&) const = 0; //! Convert to IClipboard format /*! Convert from the X selection format to the IClipboard format (i.e., the reverse of fromIClipboard()). */ virtual CString toIClipboard(const CString&) const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardAnyBitmapConverter.cpp0000600000175000017500000001235012021261364027574 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardAnyBitmapConverter.h" // BMP info header structure struct CBMPInfoHeader { public: UInt32 biSize; SInt32 biWidth; SInt32 biHeight; UInt16 biPlanes; UInt16 biBitCount; UInt32 biCompression; UInt32 biSizeImage; SInt32 biXPelsPerMeter; SInt32 biYPelsPerMeter; UInt32 biClrUsed; UInt32 biClrImportant; }; // BMP is little-endian static void toLE(UInt8*& dst, UInt16 src) { dst[0] = static_cast(src & 0xffu); dst[1] = static_cast((src >> 8) & 0xffu); dst += 2; } static void toLE(UInt8*& dst, SInt32 src) { dst[0] = static_cast(src & 0xffu); dst[1] = static_cast((src >> 8) & 0xffu); dst[2] = static_cast((src >> 16) & 0xffu); dst[3] = static_cast((src >> 24) & 0xffu); dst += 4; } static void toLE(UInt8*& dst, UInt32 src) { dst[0] = static_cast(src & 0xffu); dst[1] = static_cast((src >> 8) & 0xffu); dst[2] = static_cast((src >> 16) & 0xffu); dst[3] = static_cast((src >> 24) & 0xffu); dst += 4; } static inline UInt16 fromLEU16(const UInt8* data) { return static_cast(data[0]) | (static_cast(data[1]) << 8); } static inline SInt32 fromLES32(const UInt8* data) { return static_cast(static_cast(data[0]) | (static_cast(data[1]) << 8) | (static_cast(data[2]) << 16) | (static_cast(data[3]) << 24)); } static inline UInt32 fromLEU32(const UInt8* data) { return static_cast(data[0]) | (static_cast(data[1]) << 8) | (static_cast(data[2]) << 16) | (static_cast(data[3]) << 24); } // // CXWindowsClipboardAnyBitmapConverter // CXWindowsClipboardAnyBitmapConverter::CXWindowsClipboardAnyBitmapConverter() { // do nothing } CXWindowsClipboardAnyBitmapConverter::~CXWindowsClipboardAnyBitmapConverter() { // do nothing } IClipboard::EFormat CXWindowsClipboardAnyBitmapConverter::getFormat() const { return IClipboard::kBitmap; } int CXWindowsClipboardAnyBitmapConverter::getDataSize() const { return 8; } CString CXWindowsClipboardAnyBitmapConverter::fromIClipboard(const CString& bmp) const { // fill BMP info header with native-endian data CBMPInfoHeader infoHeader; const UInt8* rawBMPInfoHeader = reinterpret_cast(bmp.data()); infoHeader.biSize = fromLEU32(rawBMPInfoHeader + 0); infoHeader.biWidth = fromLES32(rawBMPInfoHeader + 4); infoHeader.biHeight = fromLES32(rawBMPInfoHeader + 8); infoHeader.biPlanes = fromLEU16(rawBMPInfoHeader + 12); infoHeader.biBitCount = fromLEU16(rawBMPInfoHeader + 14); infoHeader.biCompression = fromLEU32(rawBMPInfoHeader + 16); infoHeader.biSizeImage = fromLEU32(rawBMPInfoHeader + 20); infoHeader.biXPelsPerMeter = fromLES32(rawBMPInfoHeader + 24); infoHeader.biYPelsPerMeter = fromLES32(rawBMPInfoHeader + 28); infoHeader.biClrUsed = fromLEU32(rawBMPInfoHeader + 32); infoHeader.biClrImportant = fromLEU32(rawBMPInfoHeader + 36); // check that format is acceptable if (infoHeader.biSize != 40 || infoHeader.biWidth == 0 || infoHeader.biHeight == 0 || infoHeader.biPlanes != 0 || infoHeader.biCompression != 0 || (infoHeader.biBitCount != 24 && infoHeader.biBitCount != 32)) { return CString(); } // convert to image format const UInt8* rawBMPPixels = rawBMPInfoHeader + 40; if (infoHeader.biBitCount == 24) { return doBGRFromIClipboard(rawBMPPixels, infoHeader.biWidth, infoHeader.biHeight); } else { return doBGRAFromIClipboard(rawBMPPixels, infoHeader.biWidth, infoHeader.biHeight); } } CString CXWindowsClipboardAnyBitmapConverter::toIClipboard(const CString& image) const { // convert to raw BMP data UInt32 w, h, depth; CString rawBMP = doToIClipboard(image, w, h, depth); if (rawBMP.empty() || w == 0 || h == 0 || (depth != 24 && depth != 32)) { return CString(); } // fill BMP info header with little-endian data UInt8 infoHeader[40]; UInt8* dst = infoHeader; toLE(dst, static_cast(40)); toLE(dst, static_cast(w)); toLE(dst, static_cast(h)); toLE(dst, static_cast(1)); toLE(dst, static_cast(depth)); toLE(dst, static_cast(0)); // BI_RGB toLE(dst, static_cast(image.size())); toLE(dst, static_cast(2834)); // 72 dpi toLE(dst, static_cast(2834)); // 72 dpi toLE(dst, static_cast(0)); toLE(dst, static_cast(0)); // construct image return CString(reinterpret_cast(infoHeader), sizeof(infoHeader)) + rawBMP; } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardAnyBitmapConverter.h0000600000175000017500000000377012021261364027247 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDANYBITMAPCONVERTER_H #define CXWINDOWSCLIPBOARDANYBITMAPCONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from some text encoding class CXWindowsClipboardAnyBitmapConverter : public IXWindowsClipboardConverter { public: CXWindowsClipboardAnyBitmapConverter(); virtual ~CXWindowsClipboardAnyBitmapConverter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const = 0; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; protected: //! Convert from IClipboard format /*! Convert raw BGR pixel data to another image format. */ virtual CString doBGRFromIClipboard(const UInt8* bgrData, UInt32 w, UInt32 h) const = 0; //! Convert from IClipboard format /*! Convert raw BGRA pixel data to another image format. */ virtual CString doBGRAFromIClipboard(const UInt8* bgrData, UInt32 w, UInt32 h) const = 0; //! Convert to IClipboard format /*! Convert an image into raw BGR or BGRA image data and store the width, height, and image depth (24 or 32). */ virtual CString doToIClipboard(const CString&, UInt32& w, UInt32& h, UInt32& depth) const = 0; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardBMPConverter.cpp0000600000175000017500000000622412021261364026331 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardBMPConverter.h" // BMP file header structure struct CBMPHeader { public: UInt16 type; UInt32 size; UInt16 reserved1; UInt16 reserved2; UInt32 offset; }; // BMP is little-endian static inline UInt32 fromLEU32(const UInt8* data) { return static_cast(data[0]) | (static_cast(data[1]) << 8) | (static_cast(data[2]) << 16) | (static_cast(data[3]) << 24); } static void toLE(UInt8*& dst, char src) { dst[0] = static_cast(src); dst += 1; } static void toLE(UInt8*& dst, UInt16 src) { dst[0] = static_cast(src & 0xffu); dst[1] = static_cast((src >> 8) & 0xffu); dst += 2; } static void toLE(UInt8*& dst, UInt32 src) { dst[0] = static_cast(src & 0xffu); dst[1] = static_cast((src >> 8) & 0xffu); dst[2] = static_cast((src >> 16) & 0xffu); dst[3] = static_cast((src >> 24) & 0xffu); dst += 4; } // // CXWindowsClipboardBMPConverter // CXWindowsClipboardBMPConverter::CXWindowsClipboardBMPConverter( Display* display) : m_atom(XInternAtom(display, "image/bmp", False)) { // do nothing } CXWindowsClipboardBMPConverter::~CXWindowsClipboardBMPConverter() { // do nothing } IClipboard::EFormat CXWindowsClipboardBMPConverter::getFormat() const { return IClipboard::kBitmap; } Atom CXWindowsClipboardBMPConverter::getAtom() const { return m_atom; } int CXWindowsClipboardBMPConverter::getDataSize() const { return 8; } CString CXWindowsClipboardBMPConverter::fromIClipboard(const CString& bmp) const { // create BMP image UInt8 header[14]; UInt8* dst = header; toLE(dst, 'B'); toLE(dst, 'M'); toLE(dst, static_cast(14 + bmp.size())); toLE(dst, static_cast(0)); toLE(dst, static_cast(0)); toLE(dst, static_cast(14 + 40)); return CString(reinterpret_cast(header), 14) + bmp; } CString CXWindowsClipboardBMPConverter::toIClipboard(const CString& bmp) const { // make sure data is big enough for a BMP file if (bmp.size() <= 14 + 40) { return CString(); } // check BMP file header const UInt8* rawBMPHeader = reinterpret_cast(bmp.data()); if (rawBMPHeader[0] != 'B' || rawBMPHeader[1] != 'M') { return CString(); } // get offset to image data UInt32 offset = fromLEU32(rawBMPHeader + 10); // construct BMP if (offset == 14 + 40) { return bmp.substr(14); } else { return bmp.substr(14, 40) + bmp.substr(offset, bmp.size() - offset); } } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardBMPConverter.h0000600000175000017500000000255212021261364025776 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDBMPCONVERTER_H #define CXWINDOWSCLIPBOARDBMPCONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from some text encoding class CXWindowsClipboardBMPConverter : public IXWindowsClipboardConverter { public: CXWindowsClipboardBMPConverter(Display* display); virtual ~CXWindowsClipboardBMPConverter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; private: Atom m_atom; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardHTMLConverter.cpp0000600000175000017500000000310212021261364026447 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardHTMLConverter.h" #include "CUnicode.h" // // CXWindowsClipboardHTMLConverter // CXWindowsClipboardHTMLConverter::CXWindowsClipboardHTMLConverter( Display* display, const char* name) : m_atom(XInternAtom(display, name, False)) { // do nothing } CXWindowsClipboardHTMLConverter::~CXWindowsClipboardHTMLConverter() { // do nothing } IClipboard::EFormat CXWindowsClipboardHTMLConverter::getFormat() const { return IClipboard::kHTML; } Atom CXWindowsClipboardHTMLConverter::getAtom() const { return m_atom; } int CXWindowsClipboardHTMLConverter::getDataSize() const { return 8; } CString CXWindowsClipboardHTMLConverter::fromIClipboard(const CString& data) const { return CUnicode::UTF8ToUTF16(data); } CString CXWindowsClipboardHTMLConverter::toIClipboard(const CString& data) const { return CUnicode::UTF16ToUTF8(data); } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardHTMLConverter.h0000600000175000017500000000270512021261364026124 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDHTMLCONVERTER_H #define CXWINDOWSCLIPBOARDHTMLCONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from HTML encoding class CXWindowsClipboardHTMLConverter : public IXWindowsClipboardConverter { public: /*! \c name is converted to an atom and that is reported by getAtom(). */ CXWindowsClipboardHTMLConverter(Display* display, const char* name); virtual ~CXWindowsClipboardHTMLConverter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; private: Atom m_atom; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardTextConverter.cpp0000600000175000017500000000364012021261364026636 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardTextConverter.h" #include "CUnicode.h" // // CXWindowsClipboardTextConverter // CXWindowsClipboardTextConverter::CXWindowsClipboardTextConverter( Display* display, const char* name) : m_atom(XInternAtom(display, name, False)) { // do nothing } CXWindowsClipboardTextConverter::~CXWindowsClipboardTextConverter() { // do nothing } IClipboard::EFormat CXWindowsClipboardTextConverter::getFormat() const { return IClipboard::kText; } Atom CXWindowsClipboardTextConverter::getAtom() const { return m_atom; } int CXWindowsClipboardTextConverter::getDataSize() const { return 8; } CString CXWindowsClipboardTextConverter::fromIClipboard(const CString& data) const { return CUnicode::UTF8ToText(data); } CString CXWindowsClipboardTextConverter::toIClipboard(const CString& data) const { // convert to UTF-8 bool errors; CString utf8 = CUnicode::textToUTF8(data, &errors); // if there were decoding errors then, to support old applications // that don't understand UTF-8 but can report the exact binary // UTF-8 representation, see if the data appears to be UTF-8. if // so then use it as is. if (errors && CUnicode::isUTF8(data)) { return data; } return utf8; } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardTextConverter.h0000600000175000017500000000271412021261364026304 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDTEXTCONVERTER_H #define CXWINDOWSCLIPBOARDTEXTCONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from locale text encoding class CXWindowsClipboardTextConverter : public IXWindowsClipboardConverter { public: /*! \c name is converted to an atom and that is reported by getAtom(). */ CXWindowsClipboardTextConverter(Display* display, const char* name); virtual ~CXWindowsClipboardTextConverter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; private: Atom m_atom; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardUCS2Converter.cpp0000600000175000017500000000310112021261364026416 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardUCS2Converter.h" #include "CUnicode.h" // // CXWindowsClipboardUCS2Converter // CXWindowsClipboardUCS2Converter::CXWindowsClipboardUCS2Converter( Display* display, const char* name) : m_atom(XInternAtom(display, name, False)) { // do nothing } CXWindowsClipboardUCS2Converter::~CXWindowsClipboardUCS2Converter() { // do nothing } IClipboard::EFormat CXWindowsClipboardUCS2Converter::getFormat() const { return IClipboard::kText; } Atom CXWindowsClipboardUCS2Converter::getAtom() const { return m_atom; } int CXWindowsClipboardUCS2Converter::getDataSize() const { return 16; } CString CXWindowsClipboardUCS2Converter::fromIClipboard(const CString& data) const { return CUnicode::UTF8ToUCS2(data); } CString CXWindowsClipboardUCS2Converter::toIClipboard(const CString& data) const { return CUnicode::UCS2ToUTF8(data); } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardUCS2Converter.h0000600000175000017500000000270612021261364026075 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDUCS2CONVERTER_H #define CXWINDOWSCLIPBOARDUCS2CONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from UCS-2 encoding class CXWindowsClipboardUCS2Converter : public IXWindowsClipboardConverter { public: /*! \c name is converted to an atom and that is reported by getAtom(). */ CXWindowsClipboardUCS2Converter(Display* display, const char* name); virtual ~CXWindowsClipboardUCS2Converter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; private: Atom m_atom; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardUTF8Converter.cpp0000600000175000017500000000277612021261364026451 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboardUTF8Converter.h" // // CXWindowsClipboardUTF8Converter // CXWindowsClipboardUTF8Converter::CXWindowsClipboardUTF8Converter( Display* display, const char* name) : m_atom(XInternAtom(display, name, False)) { // do nothing } CXWindowsClipboardUTF8Converter::~CXWindowsClipboardUTF8Converter() { // do nothing } IClipboard::EFormat CXWindowsClipboardUTF8Converter::getFormat() const { return IClipboard::kText; } Atom CXWindowsClipboardUTF8Converter::getAtom() const { return m_atom; } int CXWindowsClipboardUTF8Converter::getDataSize() const { return 8; } CString CXWindowsClipboardUTF8Converter::fromIClipboard(const CString& data) const { return data; } CString CXWindowsClipboardUTF8Converter::toIClipboard(const CString& data) const { return data; } synergy-1.4.12-Source/src/lib/platform/CXWindowsClipboardUTF8Converter.h0000600000175000017500000000270612021261364026107 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSCLIPBOARDUTF8CONVERTER_H #define CXWINDOWSCLIPBOARDUTF8CONVERTER_H #include "CXWindowsClipboard.h" //! Convert to/from UTF-8 encoding class CXWindowsClipboardUTF8Converter : public IXWindowsClipboardConverter { public: /*! \c name is converted to an atom and that is reported by getAtom(). */ CXWindowsClipboardUTF8Converter(Display* display, const char* name); virtual ~CXWindowsClipboardUTF8Converter(); // IXWindowsClipboardConverter overrides virtual IClipboard::EFormat getFormat() const; virtual Atom getAtom() const; virtual int getDataSize() const; virtual CString fromIClipboard(const CString&) const; virtual CString toIClipboard(const CString&) const; private: Atom m_atom; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsEventQueueBuffer.cpp0000600000175000017500000001620412021261364025422 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsEventQueueBuffer.h" #include "CLock.h" #include "CThread.h" #include "CEvent.h" #include "IEventQueue.h" #include #if HAVE_UNISTD_H # include #endif #if HAVE_POLL # include #else # if HAVE_SYS_SELECT_H # include # endif # if HAVE_SYS_TIME_H # include # endif # if HAVE_SYS_TYPES_H # include # endif #endif // // CEventQueueTimer // class CEventQueueTimer { }; // // CXWindowsEventQueueBuffer // CXWindowsEventQueueBuffer::CXWindowsEventQueueBuffer( Display* display, Window window) : m_display(display), m_window(window), m_waiting(false) { assert(m_display != NULL); assert(m_window != None); m_userEvent = XInternAtom(m_display, "SYNERGY_USER_EVENT", False); // set up for pipe hack int result = pipe(m_pipefd); assert(result == 0); int pipeflags; pipeflags = fcntl(m_pipefd[0], F_GETFL); fcntl(m_pipefd[0], F_SETFL, pipeflags | O_NONBLOCK); pipeflags = fcntl(m_pipefd[1], F_GETFL); fcntl(m_pipefd[1], F_SETFL, pipeflags | O_NONBLOCK); } CXWindowsEventQueueBuffer::~CXWindowsEventQueueBuffer() { // release pipe hack resources close(m_pipefd[0]); close(m_pipefd[1]); } void CXWindowsEventQueueBuffer::waitForEvent(double dtimeout) { CThread::testCancel(); // clear out the pipe in preparation for waiting. char buf[16]; ssize_t read_response = read(m_pipefd[0], buf, 15); // with linux automake, warnings are treated as errors by default if (read_response < 0) { // todo: handle read response } { CLock lock(&m_mutex); // we're now waiting for events m_waiting = true; // push out pending events flush(); } // calling flush may have queued up a new event. if (!CXWindowsEventQueueBuffer::isEmpty()) { CThread::testCancel(); return; } // use poll() to wait for a message from the X server or for timeout. // this is a good deal more efficient than polling and sleeping. #if HAVE_POLL struct pollfd pfds[2]; pfds[0].fd = ConnectionNumber(m_display); pfds[0].events = POLLIN; pfds[1].fd = m_pipefd[0]; pfds[1].events = POLLIN; int timeout = (dtimeout < 0.0) ? -1 : static_cast(1000.0 * dtimeout); int remaining = timeout; int retval = 0; #else struct timeval timeout; struct timeval* timeoutPtr; if (dtimeout < 0.0) { timeoutPtr = NULL; } else { timeout.tv_sec = static_cast(dtimeout); timeout.tv_usec = static_cast(1.0e+6 * (dtimeout - timeout.tv_sec)); timeoutPtr = &timeout; } // initialize file descriptor sets fd_set rfds; FD_ZERO(&rfds); FD_SET(ConnectionNumber(m_display), &rfds); FD_SET(m_pipefd[0], &rfds); int nfds; if (ConnectionNumber(m_display) > m_pipefd[0]) { nfds = ConnectionNumber(m_display) + 1; } else { nfds = m_pipefd[0] + 1; } #endif // It's possible that the X server has queued events locally // in xlib's event buffer and not pushed on to the fd. Hence we // can't simply monitor the fd as we may never be woken up. // ie addEvent calls flush, XFlush may not send via the fd hence // there is an event waiting to be sent but we must exit the poll // before it can. // Instead we poll for a brief period of time (so if events // queued locally in the xlib buffer can be processed) // and continue doing this until timeout is reached. // The human eye can notice 60hz (ansi) which is 16ms, however // we want to give the cpu a chance s owe up this to 25ms #define TIMEOUT_DELAY 25 while( ((dtimeout < 0.0) || (remaining > 0)) && QLength(m_display)==0 && retval==0){ #if HAVE_POLL retval = poll(pfds, 2, TIMEOUT_DELAY); //16ms = 60hz, but we make it > to play nicely with the cpu if (pfds[1].revents & POLLIN) { ssize_t read_response = read(m_pipefd[0], buf, 15); // with linux automake, warnings are treated as errors by default if (read_response < 0) { // todo: handle read response } } #else retval = select(nfds, SELECT_TYPE_ARG234 &rfds, SELECT_TYPE_ARG234 NULL, SELECT_TYPE_ARG234 NULL, SELECT_TYPE_ARG5 TIMEOUT_DELAY); if (FD_SET(m_pipefd[0], &rfds)) { read(m_pipefd[0], buf, 15); } #endif remaining-=TIMEOUT_DELAY; } { // we're no longer waiting for events CLock lock(&m_mutex); m_waiting = false; } CThread::testCancel(); } IEventQueueBuffer::Type CXWindowsEventQueueBuffer::getEvent(CEvent& event, UInt32& dataID) { CLock lock(&m_mutex); // push out pending events flush(); // get next event XNextEvent(m_display, &m_event); // process event if (m_event.xany.type == ClientMessage && m_event.xclient.message_type == m_userEvent) { dataID = static_cast(m_event.xclient.data.l[0]); return kUser; } else { event = CEvent(CEvent::kSystem, IEventQueue::getSystemTarget(), &m_event); return kSystem; } } bool CXWindowsEventQueueBuffer::addEvent(UInt32 dataID) { // prepare a message XEvent xevent; xevent.xclient.type = ClientMessage; xevent.xclient.window = m_window; xevent.xclient.message_type = m_userEvent; xevent.xclient.format = 32; xevent.xclient.data.l[0] = static_cast(dataID); // save the message CLock lock(&m_mutex); m_postedEvents.push_back(xevent); // if we're currently waiting for an event then send saved events to // the X server now. if we're not waiting then some other thread // might be using the display connection so we can't safely use it // too. if (m_waiting) { flush(); // Send a character through the round-trip pipe to wake a thread // that is waiting for a ConnectionNumber() socket to be readable. // The flush call can read incoming data from the socket and put // it in Xlib's input buffer. That sneaks it past the other thread. ssize_t write_response = write(m_pipefd[1], "!", 1); // with linux automake, warnings are treated as errors by default if (write_response < 0) { // todo: handle read response } } return true; } bool CXWindowsEventQueueBuffer::isEmpty() const { CLock lock(&m_mutex); return (XPending(m_display) == 0 ); } CEventQueueTimer* CXWindowsEventQueueBuffer::newTimer(double, bool) const { return new CEventQueueTimer; } void CXWindowsEventQueueBuffer::deleteTimer(CEventQueueTimer* timer) const { delete timer; } void CXWindowsEventQueueBuffer::flush() { // note -- m_mutex must be locked on entry // flush the posted event list to the X server for (size_t i = 0; i < m_postedEvents.size(); ++i) { XSendEvent(m_display, m_window, False, 0, &m_postedEvents[i]); } XFlush(m_display); m_postedEvents.clear(); } synergy-1.4.12-Source/src/lib/platform/CXWindowsEventQueueBuffer.h0000600000175000017500000000335612021261364025073 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSEVENTQUEUEBUFFER_H #define CXWINDOWSEVENTQUEUEBUFFER_H #include "IEventQueueBuffer.h" #include "CMutex.h" #include "stdvector.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include #endif //! Event queue buffer for X11 class CXWindowsEventQueueBuffer : public IEventQueueBuffer { public: CXWindowsEventQueueBuffer(Display*, Window); virtual ~CXWindowsEventQueueBuffer(); // IEventQueueBuffer overrides virtual void waitForEvent(double timeout); virtual Type getEvent(CEvent& event, UInt32& dataID); virtual bool addEvent(UInt32 dataID); virtual bool isEmpty() const; virtual CEventQueueTimer* newTimer(double duration, bool oneShot) const; virtual void deleteTimer(CEventQueueTimer*) const; private: void flush(); private: typedef std::vector CEventList; CMutex m_mutex; Display* m_display; Window m_window; Atom m_userEvent; XEvent m_event; CEventList m_postedEvents; bool m_waiting; int m_pipefd[2]; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsKeyState.cpp0000600000175000017500000006072112021261364023736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsKeyState.h" #include "CXWindowsUtil.h" #include "CLog.h" #include "CStringUtil.h" #include "stdmap.h" #include #include #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include # include # define XK_MISCELLANY # define XK_XKB_KEYS # include #if HAVE_XKB_EXTENSION # include #endif #endif static const size_t ModifiersFromXDefaultSize = 32; CXWindowsKeyState::CXWindowsKeyState(Display* display, bool useXKB) : m_display(display), m_modifierFromX(ModifiersFromXDefaultSize) { init(display, useXKB); } CXWindowsKeyState::CXWindowsKeyState( Display* display, bool useXKB, IEventQueue& eventQueue, CKeyMap& keyMap) : CKeyState(eventQueue, keyMap), m_display(display), m_modifierFromX(ModifiersFromXDefaultSize) { init(display, useXKB); } CXWindowsKeyState::~CXWindowsKeyState() { #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { XkbFreeKeyboard(m_xkb, 0, True); } #endif } void CXWindowsKeyState::init(Display* display, bool useXKB) { XGetKeyboardControl(m_display, &m_keyboardState); #if HAVE_XKB_EXTENSION if (useXKB) { m_xkb = XkbGetMap(m_display, XkbKeyActionsMask | XkbKeyBehaviorsMask | XkbAllClientInfoMask, XkbUseCoreKbd); } else { m_xkb = NULL; } #endif setActiveGroup(kGroupPollAndSet); } void CXWindowsKeyState::setActiveGroup(SInt32 group) { if (group == kGroupPollAndSet) { // we need to set the group to -1 in order for pollActiveGroup() to // actually poll for the group m_group = -1; m_group = pollActiveGroup(); } else if (group == kGroupPoll) { m_group = -1; } else { assert(group >= 0); m_group = group; } } void CXWindowsKeyState::setAutoRepeat(const XKeyboardState& state) { m_keyboardState = state; } KeyModifierMask CXWindowsKeyState::mapModifiersFromX(unsigned int state) const { LOG((CLOG_DEBUG2 "mapping state: %i", state)); UInt32 offset = 8 * getGroupFromState(state); KeyModifierMask mask = 0; for (int i = 0; i < 8; ++i) { if ((state & (1u << i)) != 0) { LOG((CLOG_DEBUG2 "|= modifier: %i", offset + i)); if (offset + i >= m_modifierFromX.size()) { LOG((CLOG_ERR "m_modifierFromX is too small (%d) for the " "requested offset (%d)", m_modifierFromX.size(), offset+i)); } else { mask |= m_modifierFromX[offset + i]; } } } return mask; } bool CXWindowsKeyState::mapModifiersToX(KeyModifierMask mask, unsigned int& modifiers) const { modifiers = 0; for (SInt32 i = 0; i < kKeyModifierNumBits; ++i) { KeyModifierMask bit = (1u << i); if ((mask & bit) != 0) { KeyModifierToXMask::const_iterator j = m_modifierToX.find(bit); if (j == m_modifierToX.end()) { return false; } else { modifiers |= j->second; } } } return true; } void CXWindowsKeyState::mapKeyToKeycodes(KeyID key, CKeycodeList& keycodes) const { keycodes.clear(); std::pair range = m_keyCodeFromKey.equal_range(key); for (KeyToKeyCodeMap::const_iterator i = range.first; i != range.second; ++i) { keycodes.push_back(i->second); } } bool CXWindowsKeyState::fakeCtrlAltDel() { // pass keys through unchanged return false; } KeyModifierMask CXWindowsKeyState::pollActiveModifiers() const { Window root = DefaultRootWindow(m_display), window; int xRoot, yRoot, xWindow, yWindow; unsigned int state = 0; if (XQueryPointer(m_display, root, &root, &window, &xRoot, &yRoot, &xWindow, &yWindow, &state) == False) { state = 0; } return mapModifiersFromX(state); } SInt32 CXWindowsKeyState::pollActiveGroup() const { // fixed condition where any group < -1 would have undetermined behaviour if (m_group >= 0) { return m_group; } #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { XkbStateRec state; if (XkbGetState(m_display, XkbUseCoreKbd, &state) == Success) { return state.group; } } #endif return 0; } void CXWindowsKeyState::pollPressedKeys(KeyButtonSet& pressedKeys) const { char keys[32]; XQueryKeymap(m_display, keys); for (UInt32 i = 0; i < 32; ++i) { for (UInt32 j = 0; j < 8; ++j) { if ((keys[i] & (1u << j)) != 0) { pressedKeys.insert(8 * i + j); } } } } void CXWindowsKeyState::getKeyMap(CKeyMap& keyMap) { // get autorepeat info. we must use the global_auto_repeat told to // us because it may have modified by synergy. int oldGlobalAutoRepeat = m_keyboardState.global_auto_repeat; XGetKeyboardControl(m_display, &m_keyboardState); m_keyboardState.global_auto_repeat = oldGlobalAutoRepeat; #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { if (XkbGetUpdatedMap(m_display, XkbKeyActionsMask | XkbKeyBehaviorsMask | XkbAllClientInfoMask, m_xkb) == Success) { updateKeysymMapXKB(keyMap); return; } } #endif updateKeysymMap(keyMap); } void CXWindowsKeyState::fakeKey(const Keystroke& keystroke) { switch (keystroke.m_type) { case Keystroke::kButton: LOG((CLOG_DEBUG1 " %03x (%08x) %s", keystroke.m_data.m_button.m_button, keystroke.m_data.m_button.m_client, keystroke.m_data.m_button.m_press ? "down" : "up")); if (keystroke.m_data.m_button.m_repeat) { int c = keystroke.m_data.m_button.m_button; int i = (c >> 3); int b = 1 << (c & 7); if (m_keyboardState.global_auto_repeat == AutoRepeatModeOff || (c!=113 && c!=116 && (m_keyboardState.auto_repeats[i] & b) == 0)) { LOG((CLOG_DEBUG1 " discard autorepeat")); break; } } XTestFakeKeyEvent(m_display, keystroke.m_data.m_button.m_button, keystroke.m_data.m_button.m_press ? True : False, CurrentTime); break; case Keystroke::kGroup: if (keystroke.m_data.m_group.m_absolute) { LOG((CLOG_DEBUG1 " group %d", keystroke.m_data.m_group.m_group)); #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { if (XkbLockGroup(m_display, XkbUseCoreKbd, keystroke.m_data.m_group.m_group) == False) { LOG((CLOG_DEBUG1 "XkbLockGroup request not sent")); } } else #endif { LOG((CLOG_DEBUG1 " ignored")); } } else { LOG((CLOG_DEBUG1 " group %+d", keystroke.m_data.m_group.m_group)); #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { if (XkbLockGroup(m_display, XkbUseCoreKbd, getEffectiveGroup(pollActiveGroup(), keystroke.m_data.m_group.m_group)) == False) { LOG((CLOG_DEBUG1 "XkbLockGroup request not sent")); } } else #endif { LOG((CLOG_DEBUG1 " ignored")); } } break; } XFlush(m_display); } void CXWindowsKeyState::updateKeysymMap(CKeyMap& keyMap) { // there are up to 4 keysyms per keycode static const int maxKeysyms = 4; LOG((CLOG_DEBUG1 "non-XKB mapping")); // prepare map from X modifier to KeyModifierMask. certain bits // are predefined. std::fill(m_modifierFromX.begin(), m_modifierFromX.end(), 0); m_modifierFromX[ShiftMapIndex] = KeyModifierShift; m_modifierFromX[LockMapIndex] = KeyModifierCapsLock; m_modifierFromX[ControlMapIndex] = KeyModifierControl; m_modifierToX.clear(); m_modifierToX[KeyModifierShift] = ShiftMask; m_modifierToX[KeyModifierCapsLock] = LockMask; m_modifierToX[KeyModifierControl] = ControlMask; // prepare map from KeyID to KeyCode m_keyCodeFromKey.clear(); // get the number of keycodes int minKeycode, maxKeycode; XDisplayKeycodes(m_display, &minKeycode, &maxKeycode); int numKeycodes = maxKeycode - minKeycode + 1; // get the keyboard mapping for all keys int keysymsPerKeycode; KeySym* allKeysyms = XGetKeyboardMapping(m_display, minKeycode, numKeycodes, &keysymsPerKeycode); // it's more convenient to always have maxKeysyms KeySyms per key { KeySym* tmpKeysyms = new KeySym[maxKeysyms * numKeycodes]; for (int i = 0; i < numKeycodes; ++i) { for (int j = 0; j < maxKeysyms; ++j) { if (j < keysymsPerKeycode) { tmpKeysyms[maxKeysyms * i + j] = allKeysyms[keysymsPerKeycode * i + j]; } else { tmpKeysyms[maxKeysyms * i + j] = NoSymbol; } } } XFree(allKeysyms); allKeysyms = tmpKeysyms; } // get the buttons assigned to modifiers. X11 does not predefine // the meaning of any modifiers except shift, caps lock, and the // control key. the meaning of a modifier bit (other than those) // depends entirely on the KeySyms mapped to that bit. unfortunately // you cannot map a bit back to the KeySym used to produce it. // for example, let's say button 1 maps to Alt_L without shift and // Meta_L with shift. now if mod1 is mapped to button 1 that could // mean the user used Alt or Meta to turn on that modifier and there's // no way to know which. it's also possible for one button to be // mapped to multiple bits so both mod1 and mod2 could be generated // by button 1. // // we're going to ignore any modifier for a button except the first. // with the above example, that means we'll ignore the mod2 modifier // bit unless it's also mapped to some other button. we're also // going to ignore all KeySyms except the first modifier KeySym, // which means button 1 above won't map to Meta, just Alt. std::map modifierButtons; XModifierKeymap* modifiers = XGetModifierMapping(m_display); for (unsigned int i = 0; i < 8; ++i) { const KeyCode* buttons = modifiers->modifiermap + i * modifiers->max_keypermod; for (int j = 0; j < modifiers->max_keypermod; ++j) { modifierButtons.insert(std::make_pair(buttons[j], i)); } } XFreeModifiermap(modifiers); modifierButtons.erase(0); // Hack to deal with VMware. When a VMware client grabs input the // player clears out the X modifier map for whatever reason. We're // notified of the change and arrive here to discover that there // are no modifiers at all. Since this prevents the modifiers from // working in the VMware client we'll use the last known good set // of modifiers when there are no modifiers. If there are modifiers // we update the last known good set. if (!modifierButtons.empty()) { m_lastGoodNonXKBModifiers = modifierButtons; } else { modifierButtons = m_lastGoodNonXKBModifiers; } // add entries for each keycode CKeyMap::KeyItem item; for (int i = 0; i < numKeycodes; ++i) { KeySym* keysyms = allKeysyms + maxKeysyms * i; KeyCode keycode = static_cast(i + minKeycode); item.m_button = static_cast(keycode); item.m_client = 0; // determine modifier sensitivity item.m_sensitive = 0; // if the keysyms in levels 2 or 3 exist and differ from levels // 0 and 1 then the key is sensitive AltGr (Mode_switch) if ((keysyms[2] != NoSymbol && keysyms[2] != keysyms[0]) || (keysyms[3] != NoSymbol && keysyms[2] != keysyms[1])) { item.m_sensitive |= KeyModifierAltGr; } // check if the key is caps-lock sensitive. some systems only // provide one keysym for keys sensitive to caps-lock. if we // find that then fill in the missing keysym. if (keysyms[0] != NoSymbol && keysyms[1] == NoSymbol && keysyms[2] == NoSymbol && keysyms[3] == NoSymbol) { KeySym lKeysym, uKeysym; XConvertCase(keysyms[0], &lKeysym, &uKeysym); if (lKeysym != uKeysym) { keysyms[0] = lKeysym; keysyms[1] = uKeysym; item.m_sensitive |= KeyModifierCapsLock; } } else if (keysyms[0] != NoSymbol && keysyms[1] != NoSymbol) { KeySym lKeysym, uKeysym; XConvertCase(keysyms[0], &lKeysym, &uKeysym); if (lKeysym != uKeysym && lKeysym == keysyms[0] && uKeysym == keysyms[1]) { item.m_sensitive |= KeyModifierCapsLock; } else if (keysyms[2] != NoSymbol && keysyms[3] != NoSymbol) { XConvertCase(keysyms[2], &lKeysym, &uKeysym); if (lKeysym != uKeysym && lKeysym == keysyms[2] && uKeysym == keysyms[3]) { item.m_sensitive |= KeyModifierCapsLock; } } } // key is sensitive to shift if keysyms in levels 0 and 1 or // levels 2 and 3 don't match. it's also sensitive to shift // if it's sensitive to caps-lock. if ((item.m_sensitive & KeyModifierCapsLock) != 0) { item.m_sensitive |= KeyModifierShift; } else if ((keysyms[0] != NoSymbol && keysyms[1] != NoSymbol && keysyms[0] != keysyms[1]) || (keysyms[2] != NoSymbol && keysyms[3] != NoSymbol && keysyms[2] != keysyms[3])) { item.m_sensitive |= KeyModifierShift; } // key is sensitive to numlock if any keysym on it is if (IsKeypadKey(keysyms[0]) || IsPrivateKeypadKey(keysyms[0]) || IsKeypadKey(keysyms[1]) || IsPrivateKeypadKey(keysyms[1]) || IsKeypadKey(keysyms[2]) || IsPrivateKeypadKey(keysyms[2]) || IsKeypadKey(keysyms[3]) || IsPrivateKeypadKey(keysyms[3])) { item.m_sensitive |= KeyModifierNumLock; } // do each keysym (shift level) for (int j = 0; j < maxKeysyms; ++j) { item.m_id = CXWindowsUtil::mapKeySymToKeyID(keysyms[j]); if (item.m_id == kKeyNone) { if (j != 0 && modifierButtons.count(keycode) > 0) { // pretend the modifier works in other shift levels // because it probably does. if (keysyms[1] == NoSymbol || j != 3) { item.m_id = CXWindowsUtil::mapKeySymToKeyID(keysyms[0]); } else { item.m_id = CXWindowsUtil::mapKeySymToKeyID(keysyms[1]); } } if (item.m_id == kKeyNone) { continue; } } // group is 0 for levels 0 and 1 and 1 for levels 2 and 3 item.m_group = (j >= 2) ? 1 : 0; // compute required modifiers item.m_required = 0; if ((j & 1) != 0) { item.m_required |= KeyModifierShift; } if ((j & 2) != 0) { item.m_required |= KeyModifierAltGr; } item.m_generates = 0; item.m_lock = false; if (modifierButtons.count(keycode) > 0) { // get flags for modifier keys CKeyMap::initModifierKey(item); // add mapping from X (unless we already have) if (item.m_generates != 0) { unsigned int bit = modifierButtons[keycode]; if (m_modifierFromX[bit] == 0) { m_modifierFromX[bit] = item.m_generates; m_modifierToX[item.m_generates] = (1u << bit); } } } // add key keyMap.addKeyEntry(item); m_keyCodeFromKey.insert(std::make_pair(item.m_id, keycode)); // add other ways to synthesize the key if ((j & 1) != 0) { // add capslock version of key is sensitive to capslock KeySym lKeysym, uKeysym; XConvertCase(keysyms[j], &lKeysym, &uKeysym); if (lKeysym != uKeysym && lKeysym == keysyms[j - 1] && uKeysym == keysyms[j]) { item.m_required &= ~KeyModifierShift; item.m_required |= KeyModifierCapsLock; keyMap.addKeyEntry(item); item.m_required |= KeyModifierShift; item.m_required &= ~KeyModifierCapsLock; } // add numlock version of key if sensitive to numlock if (IsKeypadKey(keysyms[j]) || IsPrivateKeypadKey(keysyms[j])) { item.m_required &= ~KeyModifierShift; item.m_required |= KeyModifierNumLock; keyMap.addKeyEntry(item); item.m_required |= KeyModifierShift; item.m_required &= ~KeyModifierNumLock; } } } } delete[] allKeysyms; } #if HAVE_XKB_EXTENSION void CXWindowsKeyState::updateKeysymMapXKB(CKeyMap& keyMap) { static const XkbKTMapEntryRec defMapEntry = { True, // active 0, // level { 0, // mods.mask 0, // mods.real_mods 0 // mods.vmods } }; LOG((CLOG_DEBUG1 "XKB mapping")); // find the number of groups int maxNumGroups = 0; for (int i = m_xkb->min_key_code; i <= m_xkb->max_key_code; ++i) { int numGroups = XkbKeyNumGroups(m_xkb, static_cast(i)); if (numGroups > maxNumGroups) { maxNumGroups = numGroups; } } // prepare map from X modifier to KeyModifierMask std::vector modifierLevel(maxNumGroups * 8, 4); m_modifierFromX.clear(); m_modifierFromX.resize(maxNumGroups * 8); m_modifierToX.clear(); // prepare map from KeyID to KeyCode m_keyCodeFromKey.clear(); // Hack to deal with VMware. When a VMware client grabs input the // player clears out the X modifier map for whatever reason. We're // notified of the change and arrive here to discover that there // are no modifiers at all. Since this prevents the modifiers from // working in the VMware client we'll use the last known good set // of modifiers when there are no modifiers. If there are modifiers // we update the last known good set. bool useLastGoodModifiers = !hasModifiersXKB(); if (!useLastGoodModifiers) { m_lastGoodXKBModifiers.clear(); } // check every button. on this pass we save all modifiers as native // X modifier masks. CKeyMap::KeyItem item; for (int i = m_xkb->min_key_code; i <= m_xkb->max_key_code; ++i) { KeyCode keycode = static_cast(i); item.m_button = static_cast(keycode); item.m_client = 0; // skip keys with no groups (they generate no symbols) if (XkbKeyNumGroups(m_xkb, keycode) == 0) { continue; } // note half-duplex keys const XkbBehavior& b = m_xkb->server->behaviors[keycode]; if ((b.type & XkbKB_OpMask) == XkbKB_Lock) { keyMap.addHalfDuplexButton(item.m_button); } // iterate over all groups for (int group = 0; group < maxNumGroups; ++group) { item.m_group = group; int eGroup = getEffectiveGroup(keycode, group); // get key info XkbKeyTypePtr type = XkbKeyKeyType(m_xkb, keycode, eGroup); // set modifiers the item is sensitive to item.m_sensitive = type->mods.mask; // iterate over all shift levels for the button (including none) for (int j = -1; j < type->map_count; ++j) { const XkbKTMapEntryRec* mapEntry = ((j == -1) ? &defMapEntry : type->map + j); if (!mapEntry->active) { continue; } int level = mapEntry->level; // set required modifiers for this item item.m_required = mapEntry->mods.mask; if ((item.m_required & LockMask) != 0 && j != -1 && type->preserve != NULL && (type->preserve[j].mask & LockMask) != 0) { // sensitive caps lock and we preserve caps-lock. // preserving caps-lock means we Xlib functions would // yield the capitialized KeySym so we'll adjust the // level accordingly. if ((level ^ 1) < type->num_levels) { level ^= 1; } } // get the keysym for this item KeySym keysym = XkbKeySymEntry(m_xkb, keycode, level, eGroup); // check for group change actions, locking modifiers, and // modifier masks. item.m_lock = false; bool isModifier = false; UInt32 modifierMask = m_xkb->map->modmap[keycode]; if (XkbKeyHasActions(m_xkb, keycode) == True) { XkbAction* action = XkbKeyActionEntry(m_xkb, keycode, level, eGroup); if (action->type == XkbSA_SetMods || action->type == XkbSA_LockMods) { isModifier = true; // note toggles item.m_lock = (action->type == XkbSA_LockMods); // maybe use action's mask if ((action->mods.flags & XkbSA_UseModMapMods) == 0) { modifierMask = action->mods.mask; } } else if (action->type == XkbSA_SetGroup || action->type == XkbSA_LatchGroup || action->type == XkbSA_LockGroup) { // ignore group change key continue; } } level = mapEntry->level; // VMware modifier hack if (useLastGoodModifiers) { XKBModifierMap::const_iterator k = m_lastGoodXKBModifiers.find(eGroup * 256 + keycode); if (k != m_lastGoodXKBModifiers.end()) { // Use last known good modifier isModifier = true; level = k->second.m_level; modifierMask = k->second.m_mask; item.m_lock = k->second.m_lock; } } else if (isModifier) { // Save known good modifier XKBModifierInfo& info = m_lastGoodXKBModifiers[eGroup * 256 + keycode]; info.m_level = level; info.m_mask = modifierMask; info.m_lock = item.m_lock; } // record the modifier mask for this key. don't bother // for keys that change the group. item.m_generates = 0; UInt32 modifierBit = CXWindowsUtil::getModifierBitForKeySym(keysym); if (isModifier && modifierBit != kKeyModifierBitNone) { item.m_generates = (1u << modifierBit); for (SInt32 j = 0; j < 8; ++j) { // skip modifiers this key doesn't generate if ((modifierMask & (1u << j)) == 0) { continue; } // skip keys that map to a modifier that we've // already seen using fewer modifiers. that is // if this key must combine with other modifiers // and we know of a key that combines with fewer // modifiers (or no modifiers) then prefer the // other key. if (level >= modifierLevel[8 * group + j]) { continue; } modifierLevel[8 * group + j] = level; // save modifier m_modifierFromX[8 * group + j] |= (1u << modifierBit); m_modifierToX.insert(std::make_pair( 1u << modifierBit, 1u << j)); } } // handle special cases of just one keysym for the keycode if (type->num_levels == 1) { // if there are upper- and lowercase versions of the // keysym then add both. KeySym lKeysym, uKeysym; XConvertCase(keysym, &lKeysym, &uKeysym); if (lKeysym != uKeysym) { if (j != -1) { continue; } item.m_sensitive |= ShiftMask | LockMask; KeyID lKeyID = CXWindowsUtil::mapKeySymToKeyID(lKeysym); KeyID uKeyID = CXWindowsUtil::mapKeySymToKeyID(uKeysym); if (lKeyID == kKeyNone || uKeyID == kKeyNone) { continue; } item.m_id = lKeyID; item.m_required = 0; keyMap.addKeyEntry(item); item.m_id = uKeyID; item.m_required = ShiftMask; keyMap.addKeyEntry(item); item.m_required = LockMask; keyMap.addKeyEntry(item); if (group == 0) { m_keyCodeFromKey.insert( std::make_pair(lKeyID, keycode)); m_keyCodeFromKey.insert( std::make_pair(uKeyID, keycode)); } continue; } } // add entry item.m_id = CXWindowsUtil::mapKeySymToKeyID(keysym); keyMap.addKeyEntry(item); if (group == 0) { m_keyCodeFromKey.insert(std::make_pair(item.m_id, keycode)); } } } } // change all modifier masks to synergy masks from X masks keyMap.foreachKey(&CXWindowsKeyState::remapKeyModifiers, this); // allow composition across groups keyMap.allowGroupSwitchDuringCompose(); } #endif void CXWindowsKeyState::remapKeyModifiers(KeyID id, SInt32 group, CKeyMap::KeyItem& item, void* vself) { CXWindowsKeyState* self = reinterpret_cast(vself); item.m_required = self->mapModifiersFromX(XkbBuildCoreState(item.m_required, group)); item.m_sensitive = self->mapModifiersFromX(XkbBuildCoreState(item.m_sensitive, group)); } bool CXWindowsKeyState::hasModifiersXKB() const { #if HAVE_XKB_EXTENSION // iterate over all keycodes for (int i = m_xkb->min_key_code; i <= m_xkb->max_key_code; ++i) { KeyCode keycode = static_cast(i); if (XkbKeyHasActions(m_xkb, keycode) == True) { // iterate over all groups int numGroups = XkbKeyNumGroups(m_xkb, keycode); for (int group = 0; group < numGroups; ++group) { // iterate over all shift levels for the button (including none) XkbKeyTypePtr type = XkbKeyKeyType(m_xkb, keycode, group); for (int j = -1; j < type->map_count; ++j) { if (j != -1 && !type->map[j].active) { continue; } int level = ((j == -1) ? 0 : type->map[j].level); XkbAction* action = XkbKeyActionEntry(m_xkb, keycode, level, group); if (action->type == XkbSA_SetMods || action->type == XkbSA_LockMods) { return true; } } } } } #endif return false; } int CXWindowsKeyState::getEffectiveGroup(KeyCode keycode, int group) const { (void)keycode; #if HAVE_XKB_EXTENSION // get effective group for key int numGroups = XkbKeyNumGroups(m_xkb, keycode); if (group >= numGroups) { unsigned char groupInfo = XkbKeyGroupInfo(m_xkb, keycode); switch (XkbOutOfRangeGroupAction(groupInfo)) { case XkbClampIntoRange: group = numGroups - 1; break; case XkbRedirectIntoRange: group = XkbOutOfRangeGroupNumber(groupInfo); if (group >= numGroups) { group = 0; } break; default: // wrap group %= numGroups; break; } } #endif return group; } UInt32 CXWindowsKeyState::getGroupFromState(unsigned int state) const { #if HAVE_XKB_EXTENSION if (m_xkb != NULL) { return XkbGroupForCoreState(state); } #endif return 0; } synergy-1.4.12-Source/src/lib/platform/CXWindowsKeyState.h0000600000175000017500000001061312021261364023376 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSKEYSTATE_H #define CXWINDOWSKEYSTATE_H #include "CKeyState.h" #include "stdmap.h" #include "stdvector.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include # if HAVE_X11_EXTENSIONS_XTEST_H # include # else # error The XTest extension is required to build synergy # endif # if HAVE_XKB_EXTENSION # include # endif #endif //! X Windows key state /*! A key state for X Windows. */ class CXWindowsKeyState : public CKeyState { public: typedef std::vector CKeycodeList; enum { kGroupPoll = -1, kGroupPollAndSet = -2 }; CXWindowsKeyState(Display*, bool useXKB); CXWindowsKeyState(Display*, bool useXKB, IEventQueue& eventQueue, CKeyMap& keyMap); ~CXWindowsKeyState(); //! @name modifiers //@{ //! Set active group /*! Sets the active group to \p group. This is the group returned by \c pollActiveGroup(). If \p group is \c kGroupPoll then \c pollActiveGroup() will really poll, but that's a slow operation on X11. If \p group is \c kGroupPollAndSet then this will poll the active group now and use it for future calls to \c pollActiveGroup(). */ void setActiveGroup(SInt32 group); //! Set the auto-repeat state /*! Sets the auto-repeat state. */ void setAutoRepeat(const XKeyboardState&); //@} //! @name accessors //@{ //! Convert X modifier mask to synergy mask /*! Returns the synergy modifier mask corresponding to the X modifier mask in \p state. */ KeyModifierMask mapModifiersFromX(unsigned int state) const; //! Convert synergy modifier mask to X mask /*! Converts the synergy modifier mask to the corresponding X modifier mask. Returns \c true if successful and \c false if any modifier could not be converted. */ bool mapModifiersToX(KeyModifierMask, unsigned int&) const; //! Convert synergy key to all corresponding X keycodes /*! Converts the synergy key \p key to all of the keycodes that map to that key. */ void mapKeyToKeycodes(KeyID key, CKeycodeList& keycodes) const; //@} // IKeyState overrides virtual bool fakeCtrlAltDel(); virtual KeyModifierMask pollActiveModifiers() const; virtual SInt32 pollActiveGroup() const; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const; protected: // CKeyState overrides virtual void getKeyMap(CKeyMap& keyMap); virtual void fakeKey(const Keystroke& keystroke); private: void init(Display* display, bool useXKB); void updateKeysymMap(CKeyMap&); void updateKeysymMapXKB(CKeyMap&); bool hasModifiersXKB() const; int getEffectiveGroup(KeyCode, int group) const; UInt32 getGroupFromState(unsigned int state) const; static void remapKeyModifiers(KeyID, SInt32, CKeyMap::KeyItem&, void*); private: struct XKBModifierInfo { public: unsigned char m_level; UInt32 m_mask; bool m_lock; }; typedef std::vector KeyModifierMaskList; typedef std::map KeyModifierToXMask; typedef std::multimap KeyToKeyCodeMap; typedef std::map NonXKBModifierMap; typedef std::map XKBModifierMap; Display* m_display; #if HAVE_XKB_EXTENSION XkbDescPtr m_xkb; #endif SInt32 m_group; XKBModifierMap m_lastGoodXKBModifiers; NonXKBModifierMap m_lastGoodNonXKBModifiers; // X modifier (bit number) to synergy modifier (mask) mapping KeyModifierMaskList m_modifierFromX; // synergy modifier (mask) to X modifier (mask) KeyModifierToXMask m_modifierToX; // map KeyID to all keycodes that can synthesize that KeyID KeyToKeyCodeMap m_keyCodeFromKey; // autorepeat state XKeyboardState m_keyboardState; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsScreen.cpp0000600000175000017500000015570412021261364023432 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsScreen.h" #include "CXWindowsClipboard.h" #include "CXWindowsEventQueueBuffer.h" #include "CXWindowsKeyState.h" #include "CXWindowsScreenSaver.h" #include "CXWindowsUtil.h" #include "CClipboard.h" #include "CKeyMap.h" #include "XScreen.h" #include "XArch.h" #include "CLog.h" #include "CStopwatch.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include #include #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include # include # define XK_MISCELLANY # define XK_XKB_KEYS # include # if HAVE_X11_EXTENSIONS_DPMS_H extern "C" { # include } # endif # if HAVE_X11_EXTENSIONS_XTEST_H # include # else # error The XTest extension is required to build synergy # endif # if HAVE_X11_EXTENSIONS_XINERAMA_H // Xinerama.h may lack extern "C" for inclusion by C++ extern "C" { # include } # endif # if HAVE_X11_EXTENSIONS_XRANDR_H # include # endif # if HAVE_XKB_EXTENSION # include # endif # ifdef HAVE_XI2 # include # endif #endif #include "CArch.h" static int xi_opcode; // // CXWindowsScreen // // NOTE -- the X display is shared among several objects but is owned // by the CXWindowsScreen. Xlib is not reentrant so we must ensure // that no two objects can simultaneously call Xlib with the display. // this is easy since we only make X11 calls from the main thread. // we must also ensure that these objects do not use the display in // their destructors or, if they do, we can tell them not to. This // is to handle unexpected disconnection of the X display, when any // call on the display is invalid. In that situation we discard the // display and the X11 event queue buffer, ignore any calls that try // to use the display, and wait to be destroyed. CXWindowsScreen* CXWindowsScreen::s_screen = NULL; CXWindowsScreen::CXWindowsScreen(const char* displayName, bool isPrimary, bool disableXInitThreads, int mouseScrollDelta, IEventQueue& eventQueue) : m_isPrimary(isPrimary), m_mouseScrollDelta(mouseScrollDelta), m_display(NULL), m_root(None), m_window(None), m_isOnScreen(m_isPrimary), m_x(0), m_y(0), m_w(0), m_h(0), m_xCenter(0), m_yCenter(0), m_xCursor(0), m_yCursor(0), m_keyState(NULL), m_lastFocus(None), m_lastFocusRevert(RevertToNone), m_im(NULL), m_ic(NULL), m_lastKeycode(0), m_sequenceNumber(0), m_screensaver(NULL), m_screensaverNotify(false), m_xtestIsXineramaUnaware(true), m_preserveFocus(false), m_xkb(false), m_xi2detected(false), m_xrandr(false), m_eventQueue(eventQueue), CPlatformScreen(eventQueue) { assert(s_screen == NULL); if (mouseScrollDelta==0) m_mouseScrollDelta=120; s_screen = this; if (!disableXInitThreads) { // initializes Xlib support for concurrent threads. if (XInitThreads() == 0) throw XArch("XInitThreads() returned zero"); } else { LOG((CLOG_DEBUG "skipping XInitThreads()")); } // set the X I/O error handler so we catch the display disconnecting XSetIOErrorHandler(&CXWindowsScreen::ioErrorHandler); try { m_display = openDisplay(displayName); m_root = DefaultRootWindow(m_display); saveShape(); m_window = openWindow(); m_screensaver = new CXWindowsScreenSaver(m_display, m_window, getEventTarget(), eventQueue); m_keyState = new CXWindowsKeyState(m_display, m_xkb, eventQueue, m_keyMap); LOG((CLOG_DEBUG "screen shape: %d,%d %dx%d %s", m_x, m_y, m_w, m_h, m_xinerama ? "(xinerama)" : "")); LOG((CLOG_DEBUG "window is 0x%08x", m_window)); } catch (...) { if (m_display != NULL) { XCloseDisplay(m_display); } throw; } // primary/secondary screen only initialization if (m_isPrimary) { // start watching for events on other windows selectEvents(m_root); m_xi2detected = detectXI2(); if (m_xi2detected) { #ifdef HAVE_XI2 selectXIRawMotion(); #endif } else { // start watching for events on other windows selectEvents(m_root); } // prepare to use input methods openIM(); } else { // become impervious to server grabs XTestGrabControl(m_display, True); } // initialize the clipboards for (ClipboardID id = 0; id < kClipboardEnd; ++id) { m_clipboard[id] = new CXWindowsClipboard(m_display, m_window, id); } // install event handlers m_eventQueue.adoptHandler(CEvent::kSystem, IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CXWindowsScreen::handleSystemEvent)); // install the platform event queue m_eventQueue.adoptBuffer(new CXWindowsEventQueueBuffer(m_display, m_window)); } CXWindowsScreen::~CXWindowsScreen() { assert(s_screen != NULL); assert(m_display != NULL); m_eventQueue.adoptBuffer(NULL); m_eventQueue.removeHandler(CEvent::kSystem, IEventQueue::getSystemTarget()); for (ClipboardID id = 0; id < kClipboardEnd; ++id) { delete m_clipboard[id]; } delete m_keyState; delete m_screensaver; m_keyState = NULL; m_screensaver = NULL; if (m_display != NULL) { // FIXME -- is it safe to clean up the IC and IM without a display? if (m_ic != NULL) { XDestroyIC(m_ic); } if (m_im != NULL) { XCloseIM(m_im); } XDestroyWindow(m_display, m_window); XCloseDisplay(m_display); } XSetIOErrorHandler(NULL); s_screen = NULL; } void CXWindowsScreen::enable() { if (!m_isPrimary) { // get the keyboard control state XKeyboardState keyControl; XGetKeyboardControl(m_display, &keyControl); m_autoRepeat = (keyControl.global_auto_repeat == AutoRepeatModeOn); m_keyState->setAutoRepeat(keyControl); // move hider window under the cursor center XMoveWindow(m_display, m_window, m_xCenter, m_yCenter); // raise and show the window // FIXME -- take focus? XMapRaised(m_display, m_window); // warp the mouse to the cursor center fakeMouseMove(m_xCenter, m_yCenter); } } void CXWindowsScreen::disable() { // release input context focus if (m_ic != NULL) { XUnsetICFocus(m_ic); } // unmap the hider/grab window. this also ungrabs the mouse and // keyboard if they're grabbed. XUnmapWindow(m_display, m_window); // restore auto-repeat state if (!m_isPrimary && m_autoRepeat) { //XAutoRepeatOn(m_display); } } void CXWindowsScreen::enter() { screensaver(false); // release input context focus if (m_ic != NULL) { XUnsetICFocus(m_ic); } // set the input focus to what it had been when we took it if (m_lastFocus != None) { // the window may not exist anymore so ignore errors CXWindowsUtil::CErrorLock lock(m_display); XSetInputFocus(m_display, m_lastFocus, m_lastFocusRevert, CurrentTime); } #if HAVE_X11_EXTENSIONS_DPMS_H // Force the DPMS to turn screen back on since we don't // actually cause physical hardware input to trigger it int dummy; CARD16 powerlevel; BOOL enabled; if (DPMSQueryExtension(m_display, &dummy, &dummy) && DPMSCapable(m_display) && DPMSInfo(m_display, &powerlevel, &enabled)) { if (enabled && powerlevel != DPMSModeOn) DPMSForceLevel(m_display, DPMSModeOn); } #endif // unmap the hider/grab window. this also ungrabs the mouse and // keyboard if they're grabbed. XUnmapWindow(m_display, m_window); /* maybe call this if entering for the screensaver // set keyboard focus to root window. the screensaver should then // pick up key events for when the user enters a password to unlock. XSetInputFocus(m_display, PointerRoot, PointerRoot, CurrentTime); */ if (!m_isPrimary) { // get the keyboard control state XKeyboardState keyControl; XGetKeyboardControl(m_display, &keyControl); m_autoRepeat = (keyControl.global_auto_repeat == AutoRepeatModeOn); m_keyState->setAutoRepeat(keyControl); // turn off auto-repeat. we do this so fake key press events don't // cause the local server to generate their own auto-repeats of // those keys. //XAutoRepeatOff(m_display); } // now on screen m_isOnScreen = true; } bool CXWindowsScreen::leave() { if (!m_isPrimary) { // restore the previous keyboard auto-repeat state. if the user // changed the auto-repeat configuration while on the client then // that state is lost. that's because we can't get notified by // the X server when the auto-repeat configuration is changed so // we can't track the desired configuration. if (m_autoRepeat) { //XAutoRepeatOn(m_display); } // move hider window under the cursor center XMoveWindow(m_display, m_window, m_xCenter, m_yCenter); } // raise and show the window XMapRaised(m_display, m_window); // grab the mouse and keyboard, if primary and possible if (m_isPrimary && !grabMouseAndKeyboard()) { XUnmapWindow(m_display, m_window); return false; } // save current focus XGetInputFocus(m_display, &m_lastFocus, &m_lastFocusRevert); // take focus if (m_isPrimary || !m_preserveFocus) { XSetInputFocus(m_display, m_window, RevertToPointerRoot, CurrentTime); } // now warp the mouse. we warp after showing the window so we're // guaranteed to get the mouse leave event and to prevent the // keyboard focus from changing under point-to-focus policies. if (m_isPrimary) { warpCursor(m_xCenter, m_yCenter); } else { fakeMouseMove(m_xCenter, m_yCenter); } // set input context focus to our window if (m_ic != NULL) { XmbResetIC(m_ic); XSetICFocus(m_ic); m_filtered.clear(); } // now off screen m_isOnScreen = false; return true; } bool CXWindowsScreen::setClipboard(ClipboardID id, const IClipboard* clipboard) { // fail if we don't have the requested clipboard if (m_clipboard[id] == NULL) { return false; } // get the actual time. ICCCM does not allow CurrentTime. Time timestamp = CXWindowsUtil::getCurrentTime( m_display, m_clipboard[id]->getWindow()); if (clipboard != NULL) { // save clipboard data return CClipboard::copy(m_clipboard[id], clipboard, timestamp); } else { // assert clipboard ownership if (!m_clipboard[id]->open(timestamp)) { return false; } m_clipboard[id]->empty(); m_clipboard[id]->close(); return true; } } void CXWindowsScreen::checkClipboards() { // do nothing, we're always up to date } void CXWindowsScreen::openScreensaver(bool notify) { m_screensaverNotify = notify; if (!m_screensaverNotify) { m_screensaver->disable(); } } void CXWindowsScreen::closeScreensaver() { if (!m_screensaverNotify) { m_screensaver->enable(); } } void CXWindowsScreen::screensaver(bool activate) { if (activate) { m_screensaver->activate(); } else { m_screensaver->deactivate(); } } void CXWindowsScreen::resetOptions() { m_xtestIsXineramaUnaware = true; m_preserveFocus = false; } void CXWindowsScreen::setOptions(const COptionsList& options) { for (UInt32 i = 0, n = options.size(); i < n; i += 2) { if (options[i] == kOptionXTestXineramaUnaware) { m_xtestIsXineramaUnaware = (options[i + 1] != 0); LOG((CLOG_DEBUG1 "XTest is Xinerama unaware %s", m_xtestIsXineramaUnaware ? "true" : "false")); } else if (options[i] == kOptionScreenPreserveFocus) { m_preserveFocus = (options[i + 1] != 0); LOG((CLOG_DEBUG1 "Preserve Focus = %s", m_preserveFocus ? "true" : "false")); } } } void CXWindowsScreen::setSequenceNumber(UInt32 seqNum) { m_sequenceNumber = seqNum; } bool CXWindowsScreen::isPrimary() const { return m_isPrimary; } void* CXWindowsScreen::getEventTarget() const { return const_cast(this); } bool CXWindowsScreen::getClipboard(ClipboardID id, IClipboard* clipboard) const { assert(clipboard != NULL); // fail if we don't have the requested clipboard if (m_clipboard[id] == NULL) { return false; } // get the actual time. ICCCM does not allow CurrentTime. Time timestamp = CXWindowsUtil::getCurrentTime( m_display, m_clipboard[id]->getWindow()); // copy the clipboard return CClipboard::copy(clipboard, m_clipboard[id], timestamp); } void CXWindowsScreen::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { x = m_x; y = m_y; w = m_w; h = m_h; } void CXWindowsScreen::getCursorPos(SInt32& x, SInt32& y) const { Window root, window; int mx, my, xWindow, yWindow; unsigned int mask; if (XQueryPointer(m_display, m_root, &root, &window, &mx, &my, &xWindow, &yWindow, &mask)) { x = mx; y = my; } else { x = m_xCenter; y = m_yCenter; } } void CXWindowsScreen::reconfigure(UInt32) { // do nothing } void CXWindowsScreen::warpCursor(SInt32 x, SInt32 y) { // warp mouse warpCursorNoFlush(x, y); // remove all input events before and including warp XEvent event; while (XCheckMaskEvent(m_display, PointerMotionMask | ButtonPressMask | ButtonReleaseMask | KeyPressMask | KeyReleaseMask | KeymapStateMask, &event)) { // do nothing } // save position as last position m_xCursor = x; m_yCursor = y; } UInt32 CXWindowsScreen::registerHotKey(KeyID key, KeyModifierMask mask) { // only allow certain modifiers if ((mask & ~(KeyModifierShift | KeyModifierControl | KeyModifierAlt | KeyModifierSuper)) != 0) { LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } // fail if no keys if (key == kKeyNone && mask == 0) { return 0; } // convert to X unsigned int modifiers; if (!m_keyState->mapModifiersToX(mask, modifiers)) { // can't map all modifiers LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } CXWindowsKeyState::CKeycodeList keycodes; m_keyState->mapKeyToKeycodes(key, keycodes); if (key != kKeyNone && keycodes.empty()) { // can't map key LOG((CLOG_DEBUG "could not map hotkey id=%04x mask=%04x", key, mask)); return 0; } // choose hotkey id UInt32 id; if (!m_oldHotKeyIDs.empty()) { id = m_oldHotKeyIDs.back(); m_oldHotKeyIDs.pop_back(); } else { id = m_hotKeys.size() + 1; } HotKeyList& hotKeys = m_hotKeys[id]; // all modifier hotkey must be treated specially. for each modifier // we need to grab the modifier key in combination with all the other // requested modifiers. bool err = false; { CXWindowsUtil::CErrorLock lock(m_display, &err); if (key == kKeyNone) { static const KeyModifierMask s_hotKeyModifiers[] = { KeyModifierShift, KeyModifierControl, KeyModifierAlt, KeyModifierMeta, KeyModifierSuper }; XModifierKeymap* modKeymap = XGetModifierMapping(m_display); for (size_t j = 0; j < sizeof(s_hotKeyModifiers) / sizeof(s_hotKeyModifiers[0]) && !err; ++j) { // skip modifier if not in mask if ((mask & s_hotKeyModifiers[j]) == 0) { continue; } // skip with error if we can't map remaining modifiers unsigned int modifiers2; KeyModifierMask mask2 = (mask & ~s_hotKeyModifiers[j]); if (!m_keyState->mapModifiersToX(mask2, modifiers2)) { err = true; continue; } // compute modifier index for modifier. there should be // exactly one X modifier missing int index; switch (modifiers ^ modifiers2) { case ShiftMask: index = ShiftMapIndex; break; case LockMask: index = LockMapIndex; break; case ControlMask: index = ControlMapIndex; break; case Mod1Mask: index = Mod1MapIndex; break; case Mod2Mask: index = Mod2MapIndex; break; case Mod3Mask: index = Mod3MapIndex; break; case Mod4Mask: index = Mod4MapIndex; break; case Mod5Mask: index = Mod5MapIndex; break; default: err = true; continue; } // grab each key for the modifier const KeyCode* modifiermap = modKeymap->modifiermap + index * modKeymap->max_keypermod; for (int k = 0; k < modKeymap->max_keypermod && !err; ++k) { KeyCode code = modifiermap[k]; if (modifiermap[k] != 0) { XGrabKey(m_display, code, modifiers2, m_root, False, GrabModeAsync, GrabModeAsync); if (!err) { hotKeys.push_back(std::make_pair(code, modifiers2)); m_hotKeyToIDMap[CHotKeyItem(code, modifiers2)] = id; } } } } XFreeModifiermap(modKeymap); } // a non-modifier key must be insensitive to CapsLock, NumLock and // ScrollLock, so we have to grab the key with every combination of // those. else { // collect available toggle modifiers unsigned int modifier; unsigned int toggleModifiers[3]; size_t numToggleModifiers = 0; if (m_keyState->mapModifiersToX(KeyModifierCapsLock, modifier)) { toggleModifiers[numToggleModifiers++] = modifier; } if (m_keyState->mapModifiersToX(KeyModifierNumLock, modifier)) { toggleModifiers[numToggleModifiers++] = modifier; } if (m_keyState->mapModifiersToX(KeyModifierScrollLock, modifier)) { toggleModifiers[numToggleModifiers++] = modifier; } for (CXWindowsKeyState::CKeycodeList::iterator j = keycodes.begin(); j != keycodes.end() && !err; ++j) { for (size_t i = 0; i < (1u << numToggleModifiers); ++i) { // add toggle modifiers for index i unsigned int tmpModifiers = modifiers; if ((i & 1) != 0) { tmpModifiers |= toggleModifiers[0]; } if ((i & 2) != 0) { tmpModifiers |= toggleModifiers[1]; } if ((i & 4) != 0) { tmpModifiers |= toggleModifiers[2]; } // add grab XGrabKey(m_display, *j, tmpModifiers, m_root, False, GrabModeAsync, GrabModeAsync); if (!err) { hotKeys.push_back(std::make_pair(*j, tmpModifiers)); m_hotKeyToIDMap[CHotKeyItem(*j, tmpModifiers)] = id; } } } } } if (err) { // if any failed then unregister any we did get for (HotKeyList::iterator j = hotKeys.begin(); j != hotKeys.end(); ++j) { XUngrabKey(m_display, j->first, j->second, m_root); m_hotKeyToIDMap.erase(CHotKeyItem(j->first, j->second)); } m_oldHotKeyIDs.push_back(id); m_hotKeys.erase(id); LOG((CLOG_WARN "failed to register hotkey %s (id=%04x mask=%04x)", CKeyMap::formatKey(key, mask).c_str(), key, mask)); return 0; } LOG((CLOG_DEBUG "registered hotkey %s (id=%04x mask=%04x) as id=%d", CKeyMap::formatKey(key, mask).c_str(), key, mask, id)); return id; } void CXWindowsScreen::unregisterHotKey(UInt32 id) { // look up hotkey HotKeyMap::iterator i = m_hotKeys.find(id); if (i == m_hotKeys.end()) { return; } // unregister with OS bool err = false; { CXWindowsUtil::CErrorLock lock(m_display, &err); HotKeyList& hotKeys = i->second; for (HotKeyList::iterator j = hotKeys.begin(); j != hotKeys.end(); ++j) { XUngrabKey(m_display, j->first, j->second, m_root); m_hotKeyToIDMap.erase(CHotKeyItem(j->first, j->second)); } } if (err) { LOG((CLOG_WARN "failed to unregister hotkey id=%d", id)); } else { LOG((CLOG_DEBUG "unregistered hotkey id=%d", id)); } // discard hot key from map and record old id for reuse m_hotKeys.erase(i); m_oldHotKeyIDs.push_back(id); } void CXWindowsScreen::fakeInputBegin() { // FIXME -- not implemented } void CXWindowsScreen::fakeInputEnd() { // FIXME -- not implemented } SInt32 CXWindowsScreen::getJumpZoneSize() const { return 1; } bool CXWindowsScreen::isAnyMouseButtonDown() const { // query the pointer to get the button state Window root, window; int xRoot, yRoot, xWindow, yWindow; unsigned int state; if (XQueryPointer(m_display, m_root, &root, &window, &xRoot, &yRoot, &xWindow, &yWindow, &state)) { return ((state & (Button1Mask | Button2Mask | Button3Mask | Button4Mask | Button5Mask)) != 0); } return false; } void CXWindowsScreen::getCursorCenter(SInt32& x, SInt32& y) const { x = m_xCenter; y = m_yCenter; } void CXWindowsScreen::fakeMouseButton(ButtonID button, bool press) { const unsigned int xButton = mapButtonToX(button); if (xButton != 0) { XTestFakeButtonEvent(m_display, xButton, press ? True : False, CurrentTime); XFlush(m_display); } } void CXWindowsScreen::fakeMouseMove(SInt32 x, SInt32 y) const { if (m_xinerama && m_xtestIsXineramaUnaware) { XWarpPointer(m_display, None, m_root, 0, 0, 0, 0, x, y); } else { XTestFakeMotionEvent(m_display, DefaultScreen(m_display), x, y, CurrentTime); } XFlush(m_display); } void CXWindowsScreen::fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const { // FIXME -- ignore xinerama for now if (false && m_xinerama && m_xtestIsXineramaUnaware) { // XWarpPointer(m_display, None, m_root, 0, 0, 0, 0, x, y); } else { XTestFakeRelativeMotionEvent(m_display, dx, dy, CurrentTime); } XFlush(m_display); } void CXWindowsScreen::fakeMouseWheel(SInt32, SInt32 yDelta) const { // XXX -- support x-axis scrolling if (yDelta == 0) { return; } // choose button depending on rotation direction const unsigned int xButton = mapButtonToX(static_cast( (yDelta >= 0) ? -1 : -2)); if (xButton == 0) { // If we get here, then the XServer does not support the scroll // wheel buttons, so send PageUp/PageDown keystrokes instead. // Patch by Tom Chadwick. KeyCode keycode = 0; if (yDelta >= 0) { keycode = XKeysymToKeycode(m_display, XK_Page_Up); } else { keycode = XKeysymToKeycode(m_display, XK_Page_Down); } if (keycode != 0) { XTestFakeKeyEvent(m_display, keycode, True, CurrentTime); XTestFakeKeyEvent(m_display, keycode, False, CurrentTime); } return; } // now use absolute value of delta if (yDelta < 0) { yDelta = -yDelta; } if (yDelta < m_mouseScrollDelta) { LOG((CLOG_WARN "Wheel scroll delta (%d) smaller than threshold (%d)", yDelta, m_mouseScrollDelta)); } // send as many clicks as necessary for (; yDelta >= m_mouseScrollDelta; yDelta -= m_mouseScrollDelta) { XTestFakeButtonEvent(m_display, xButton, True, CurrentTime); XTestFakeButtonEvent(m_display, xButton, False, CurrentTime); } XFlush(m_display); } Display* CXWindowsScreen::openDisplay(const char* displayName) { // get the DISPLAY if (displayName == NULL) { displayName = getenv("DISPLAY"); if (displayName == NULL) { displayName = ":0.0"; } } // open the display LOG((CLOG_DEBUG "XOpenDisplay(\"%s\")", displayName)); Display* display = XOpenDisplay(displayName); if (display == NULL) { throw XScreenUnavailable(60.0); } // verify the availability of the XTest extension if (!m_isPrimary) { int majorOpcode, firstEvent, firstError; if (!XQueryExtension(display, XTestExtensionName, &majorOpcode, &firstEvent, &firstError)) { LOG((CLOG_ERR "XTEST extension not available")); XCloseDisplay(display); throw XScreenOpenFailure(); } } #if HAVE_XKB_EXTENSION { m_xkb = false; int major = XkbMajorVersion, minor = XkbMinorVersion; if (XkbLibraryVersion(&major, &minor)) { int opcode, firstError; if (XkbQueryExtension(display, &opcode, &m_xkbEventBase, &firstError, &major, &minor)) { m_xkb = true; XkbSelectEvents(display, XkbUseCoreKbd, XkbMapNotifyMask, XkbMapNotifyMask); XkbSelectEventDetails(display, XkbUseCoreKbd, XkbStateNotifyMask, XkbGroupStateMask, XkbGroupStateMask); } } } #endif #if HAVE_X11_EXTENSIONS_XRANDR_H // query for XRandR extension int dummyError; m_xrandr = XRRQueryExtension(display, &m_xrandrEventBase, &dummyError); if (m_xrandr) { // enable XRRScreenChangeNotifyEvent XRRSelectInput(display, DefaultRootWindow(display), RRScreenChangeNotifyMask | RRCrtcChangeNotifyMask); } #endif return display; } void CXWindowsScreen::saveShape() { // get shape of default screen m_x = 0; m_y = 0; m_w = WidthOfScreen(DefaultScreenOfDisplay(m_display)); m_h = HeightOfScreen(DefaultScreenOfDisplay(m_display)); #if HAVE_X11_EXTENSIONS_XRANDR_H if (m_xrandr){ int numSizes; XRRScreenSize* xrrs; Rotation rotation; xrrs = XRRSizes(m_display, DefaultScreen(m_display), &numSizes); XRRRotations(m_display, DefaultScreen(m_display), &rotation); if (xrrs != NULL) { if (rotation & (RR_Rotate_90|RR_Rotate_270) ){ m_w = xrrs->height; m_h = xrrs->width; } } } #endif // get center of default screen m_xCenter = m_x + (m_w >> 1); m_yCenter = m_y + (m_h >> 1); // check if xinerama is enabled and there is more than one screen. // get center of first Xinerama screen. Xinerama appears to have // a bug when XWarpPointer() is used in combination with // XGrabPointer(). in that case, the warp is successful but the // next pointer motion warps the pointer again, apparently to // constrain it to some unknown region, possibly the region from // 0,0 to Wm,Hm where Wm (Hm) is the minimum width (height) over // all physical screens. this warp only seems to happen if the // pointer wasn't in that region before the XWarpPointer(). the // second (unexpected) warp causes synergy to think the pointer // has been moved when it hasn't. to work around the problem, // we warp the pointer to the center of the first physical // screen instead of the logical screen. m_xinerama = false; #if HAVE_X11_EXTENSIONS_XINERAMA_H int eventBase, errorBase; if (XineramaQueryExtension(m_display, &eventBase, &errorBase) && XineramaIsActive(m_display)) { int numScreens; XineramaScreenInfo* screens; screens = XineramaQueryScreens(m_display, &numScreens); if (screens != NULL) { if (numScreens > 1) { m_xinerama = true; m_xCenter = screens[0].x_org + (screens[0].width >> 1); m_yCenter = screens[0].y_org + (screens[0].height >> 1); } XFree(screens); } } #endif } Window CXWindowsScreen::openWindow() const { // default window attributes. we don't want the window manager // messing with our window and we don't want the cursor to be // visible inside the window. XSetWindowAttributes attr; attr.do_not_propagate_mask = 0; attr.override_redirect = True; attr.cursor = createBlankCursor(); // adjust attributes and get size and shape SInt32 x, y, w, h; if (m_isPrimary) { // grab window attributes. this window is used to capture user // input when the user is focused on another client. it covers // the whole screen. attr.event_mask = PointerMotionMask | ButtonPressMask | ButtonReleaseMask | KeyPressMask | KeyReleaseMask | KeymapStateMask | PropertyChangeMask; x = m_x; y = m_y; w = m_w; h = m_h; } else { // cursor hider window attributes. this window is used to hide the // cursor when it's not on the screen. the window is hidden as soon // as the cursor enters the screen or the display's real mouse is // moved. we'll reposition the window as necessary so its // position here doesn't matter. it only needs to be 1x1 because // it only needs to contain the cursor's hotspot. attr.event_mask = LeaveWindowMask; x = 0; y = 0; w = 1; h = 1; } // create and return the window Window window = XCreateWindow(m_display, m_root, x, y, w, h, 0, 0, InputOnly, CopyFromParent, CWDontPropagate | CWEventMask | CWOverrideRedirect | CWCursor, &attr); if (window == None) { throw XScreenOpenFailure(); } return window; } void CXWindowsScreen::openIM() { // open the input methods XIM im = XOpenIM(m_display, NULL, NULL, NULL); if (im == NULL) { LOG((CLOG_INFO "no support for IM")); return; } // find the appropriate style. synergy supports XIMPreeditNothing // only at the moment. XIMStyles* styles; if (XGetIMValues(im, XNQueryInputStyle, &styles, NULL) != NULL || styles == NULL) { LOG((CLOG_WARN "cannot get IM styles")); XCloseIM(im); return; } XIMStyle style = 0; for (unsigned short i = 0; i < styles->count_styles; ++i) { style = styles->supported_styles[i]; if ((style & XIMPreeditNothing) != 0) { if ((style & (XIMStatusNothing | XIMStatusNone)) != 0) { break; } } } XFree(styles); if (style == 0) { LOG((CLOG_INFO "no supported IM styles")); XCloseIM(im); return; } // create an input context for the style and tell it about our window XIC ic = XCreateIC(im, XNInputStyle, style, XNClientWindow, m_window, NULL); if (ic == NULL) { LOG((CLOG_WARN "cannot create IC")); XCloseIM(im); return; } // find out the events we must select for and do so unsigned long mask; if (XGetICValues(ic, XNFilterEvents, &mask, NULL) != NULL) { LOG((CLOG_WARN "cannot get IC filter events")); XDestroyIC(ic); XCloseIM(im); return; } // we have IM m_im = im; m_ic = ic; m_lastKeycode = 0; // select events on our window that IM requires XWindowAttributes attr; XGetWindowAttributes(m_display, m_window, &attr); XSelectInput(m_display, m_window, attr.your_event_mask | mask); } void CXWindowsScreen::sendEvent(CEvent::Type type, void* data) { m_eventQueue.addEvent(CEvent(type, getEventTarget(), data)); } void CXWindowsScreen::sendClipboardEvent(CEvent::Type type, ClipboardID id) { CClipboardInfo* info = (CClipboardInfo*)malloc(sizeof(CClipboardInfo)); info->m_id = id; info->m_sequenceNumber = m_sequenceNumber; sendEvent(type, info); } IKeyState* CXWindowsScreen::getKeyState() const { return m_keyState; } Bool CXWindowsScreen::findKeyEvent(Display*, XEvent* xevent, XPointer arg) { CKeyEventFilter* filter = reinterpret_cast(arg); return (xevent->type == filter->m_event && xevent->xkey.window == filter->m_window && xevent->xkey.time == filter->m_time && xevent->xkey.keycode == filter->m_keycode) ? True : False; } void CXWindowsScreen::handleSystemEvent(const CEvent& event, void*) { XEvent* xevent = reinterpret_cast(event.getData()); assert(xevent != NULL); // update key state bool isRepeat = false; if (m_isPrimary) { if (xevent->type == KeyRelease) { // check if this is a key repeat by getting the next // KeyPress event that has the same key and time as // this release event, if any. first prepare the // filter info. CKeyEventFilter filter; filter.m_event = KeyPress; filter.m_window = xevent->xkey.window; filter.m_time = xevent->xkey.time; filter.m_keycode = xevent->xkey.keycode; XEvent xevent2; isRepeat = (XCheckIfEvent(m_display, &xevent2, &CXWindowsScreen::findKeyEvent, (XPointer)&filter) == True); } if (xevent->type == KeyPress || xevent->type == KeyRelease) { if (xevent->xkey.window == m_root) { // this is a hot key onHotKey(xevent->xkey, isRepeat); return; } else if (!m_isOnScreen) { // this might be a hot key if (onHotKey(xevent->xkey, isRepeat)) { return; } } bool down = (isRepeat || xevent->type == KeyPress); KeyModifierMask state = m_keyState->mapModifiersFromX(xevent->xkey.state); m_keyState->onKey(xevent->xkey.keycode, down, state); } } // let input methods try to handle event first if (m_ic != NULL) { // XFilterEvent() may eat the event and generate a new KeyPress // event with a keycode of 0 because there isn't an actual key // associated with the keysym. but the KeyRelease may pass // through XFilterEvent() and keep its keycode. this means // there's a mismatch between KeyPress and KeyRelease keycodes. // since we use the keycode on the client to detect when a key // is released this won't do. so we remember the keycode on // the most recent KeyPress (and clear it on a matching // KeyRelease) so we have a keycode for a synthesized KeyPress. if (xevent->type == KeyPress && xevent->xkey.keycode != 0) { m_lastKeycode = xevent->xkey.keycode; } else if (xevent->type == KeyRelease && xevent->xkey.keycode == m_lastKeycode) { m_lastKeycode = 0; } // now filter the event if (XFilterEvent(xevent, DefaultRootWindow(m_display))) { if (xevent->type == KeyPress) { // add filtered presses to the filtered list m_filtered.insert(m_lastKeycode); } return; } // discard matching key releases for key presses that were // filtered and remove them from our filtered list. else if (xevent->type == KeyRelease && m_filtered.count(xevent->xkey.keycode) > 0) { m_filtered.erase(xevent->xkey.keycode); return; } } // let screen saver have a go if (m_screensaver->handleXEvent(xevent)) { // screen saver handled it return; } #ifdef HAVE_XI2 if (m_xi2detected) { // Process RawMotion XGenericEventCookie *cookie = (XGenericEventCookie*)&xevent->xcookie; if (XGetEventData(m_display, cookie) && cookie->type == GenericEvent && cookie->extension == xi_opcode) { if (cookie->evtype == XI_RawMotion) { // Get current pointer's position Window root, child; XMotionEvent xmotion; xmotion.type = MotionNotify; xmotion.send_event = False; // Raw motion xmotion.display = m_display; xmotion.window = m_window; /* xmotion's time, state and is_hint are not used */ unsigned int msk; xmotion.same_screen = XQueryPointer( m_display, m_root, &xmotion.root, &xmotion.subwindow, &xmotion.x_root, &xmotion.y_root, &xmotion.x, &xmotion.y, &msk); onMouseMove(xmotion); XFreeEventData(m_display, cookie); return; } XFreeEventData(m_display, cookie); } } #endif // handle the event ourself switch (xevent->type) { case CreateNotify: if (m_isPrimary) { // select events on new window selectEvents(xevent->xcreatewindow.window); } break; case MappingNotify: refreshKeyboard(xevent); break; case LeaveNotify: if (!m_isPrimary) { // mouse moved out of hider window somehow. hide the window. XUnmapWindow(m_display, m_window); } break; case SelectionClear: { // we just lost the selection. that means someone else // grabbed the selection so this screen is now the // selection owner. report that to the receiver. ClipboardID id = getClipboardID(xevent->xselectionclear.selection); if (id != kClipboardEnd) { LOG((CLOG_DEBUG "lost clipboard %d ownership at time %d", id, xevent->xselectionclear.time)); m_clipboard[id]->lost(xevent->xselectionclear.time); sendClipboardEvent(getClipboardGrabbedEvent(), id); return; } } break; case SelectionNotify: // notification of selection transferred. we shouldn't // get this here because we handle them in the selection // retrieval methods. we'll just delete the property // with the data (satisfying the usual ICCCM protocol). if (xevent->xselection.property != None) { XDeleteProperty(m_display, xevent->xselection.requestor, xevent->xselection.property); } break; case SelectionRequest: { // somebody is asking for clipboard data ClipboardID id = getClipboardID( xevent->xselectionrequest.selection); if (id != kClipboardEnd) { m_clipboard[id]->addRequest( xevent->xselectionrequest.owner, xevent->xselectionrequest.requestor, xevent->xselectionrequest.target, xevent->xselectionrequest.time, xevent->xselectionrequest.property); return; } } break; case PropertyNotify: // property delete may be part of a selection conversion if (xevent->xproperty.state == PropertyDelete) { processClipboardRequest(xevent->xproperty.window, xevent->xproperty.time, xevent->xproperty.atom); } break; case DestroyNotify: // looks like one of the windows that requested a clipboard // transfer has gone bye-bye. destroyClipboardRequest(xevent->xdestroywindow.window); break; case KeyPress: if (m_isPrimary) { onKeyPress(xevent->xkey); } return; case KeyRelease: if (m_isPrimary) { onKeyRelease(xevent->xkey, isRepeat); } return; case ButtonPress: if (m_isPrimary) { onMousePress(xevent->xbutton); } return; case ButtonRelease: if (m_isPrimary) { onMouseRelease(xevent->xbutton); } return; case MotionNotify: if (m_isPrimary) { onMouseMove(xevent->xmotion); } return; default: #if HAVE_XKB_EXTENSION if (m_xkb && xevent->type == m_xkbEventBase) { XkbEvent* xkbEvent = reinterpret_cast(xevent); switch (xkbEvent->any.xkb_type) { case XkbMapNotify: refreshKeyboard(xevent); return; case XkbStateNotify: LOG((CLOG_INFO "group change: %d", xkbEvent->state.group)); m_keyState->setActiveGroup((SInt32)xkbEvent->state.group); return; } } #endif #if HAVE_X11_EXTENSIONS_XRANDR_H if (m_xrandr) { if (xevent->type == m_xrandrEventBase + RRScreenChangeNotify || xevent->type == m_xrandrEventBase + RRNotify && reinterpret_cast(xevent)->subtype == RRNotify_CrtcChange) { LOG((CLOG_INFO "XRRScreenChangeNotifyEvent or RRNotify_CrtcChange received")); // we're required to call back into XLib so XLib can update its internal state XRRUpdateConfiguration(xevent); // requery/recalculate the screen shape saveShape(); // we need to resize m_window, otherwise we'll get a weird problem where moving // off the server onto the client causes the pointer to warp to the // center of the server (so you can't move the pointer off the server) if (m_isPrimary) { XMoveWindow(m_display, m_window, m_x, m_y); XResizeWindow(m_display, m_window, m_w, m_h); } } } #endif break; } } void CXWindowsScreen::onKeyPress(XKeyEvent& xkey) { LOG((CLOG_DEBUG1 "event: KeyPress code=%d, state=0x%04x", xkey.keycode, xkey.state)); const KeyModifierMask mask = m_keyState->mapModifiersFromX(xkey.state); KeyID key = mapKeyFromX(&xkey); if (key != kKeyNone) { // check for ctrl+alt+del emulation if ((key == kKeyPause || key == kKeyBreak) && (mask & (KeyModifierControl | KeyModifierAlt)) == (KeyModifierControl | KeyModifierAlt)) { // pretend it's ctrl+alt+del LOG((CLOG_DEBUG "emulate ctrl+alt+del")); key = kKeyDelete; } // get which button. see call to XFilterEvent() in onEvent() // for more info. bool isFake = false; KeyButton keycode = static_cast(xkey.keycode); if (keycode == 0) { isFake = true; keycode = static_cast(m_lastKeycode); if (keycode == 0) { // no keycode return; } } // handle key m_keyState->sendKeyEvent(getEventTarget(), true, false, key, mask, 1, keycode); // do fake release if this is a fake press if (isFake) { m_keyState->sendKeyEvent(getEventTarget(), false, false, key, mask, 1, keycode); } } } void CXWindowsScreen::onKeyRelease(XKeyEvent& xkey, bool isRepeat) { const KeyModifierMask mask = m_keyState->mapModifiersFromX(xkey.state); KeyID key = mapKeyFromX(&xkey); if (key != kKeyNone) { // check for ctrl+alt+del emulation if ((key == kKeyPause || key == kKeyBreak) && (mask & (KeyModifierControl | KeyModifierAlt)) == (KeyModifierControl | KeyModifierAlt)) { // pretend it's ctrl+alt+del and ignore autorepeat LOG((CLOG_DEBUG "emulate ctrl+alt+del")); key = kKeyDelete; isRepeat = false; } KeyButton keycode = static_cast(xkey.keycode); if (!isRepeat) { // no press event follows so it's a plain release LOG((CLOG_DEBUG1 "event: KeyRelease code=%d, state=0x%04x", keycode, xkey.state)); m_keyState->sendKeyEvent(getEventTarget(), false, false, key, mask, 1, keycode); } else { // found a press event following so it's a repeat. // we could attempt to count the already queued // repeats but we'll just send a repeat of 1. // note that we discard the press event. LOG((CLOG_DEBUG1 "event: repeat code=%d, state=0x%04x", keycode, xkey.state)); m_keyState->sendKeyEvent(getEventTarget(), false, true, key, mask, 1, keycode); } } } bool CXWindowsScreen::onHotKey(XKeyEvent& xkey, bool isRepeat) { // find the hot key id HotKeyToIDMap::const_iterator i = m_hotKeyToIDMap.find(CHotKeyItem(xkey.keycode, xkey.state)); if (i == m_hotKeyToIDMap.end()) { return false; } // find what kind of event CEvent::Type type; if (xkey.type == KeyPress) { type = getHotKeyDownEvent(); } else if (xkey.type == KeyRelease) { type = getHotKeyUpEvent(); } else { return false; } // generate event (ignore key repeats) if (!isRepeat) { m_eventQueue.addEvent(CEvent(type, getEventTarget(), CHotKeyInfo::alloc(i->second))); } return true; } void CXWindowsScreen::onMousePress(const XButtonEvent& xbutton) { LOG((CLOG_DEBUG1 "event: ButtonPress button=%d", xbutton.button)); ButtonID button = mapButtonFromX(&xbutton); KeyModifierMask mask = m_keyState->mapModifiersFromX(xbutton.state); if (button != kButtonNone) { sendEvent(getButtonDownEvent(), CButtonInfo::alloc(button, mask)); } } void CXWindowsScreen::onMouseRelease(const XButtonEvent& xbutton) { LOG((CLOG_DEBUG1 "event: ButtonRelease button=%d", xbutton.button)); ButtonID button = mapButtonFromX(&xbutton); KeyModifierMask mask = m_keyState->mapModifiersFromX(xbutton.state); if (button != kButtonNone) { sendEvent(getButtonUpEvent(), CButtonInfo::alloc(button, mask)); } else if (xbutton.button == 4) { // wheel forward (away from user) sendEvent(getWheelEvent(), CWheelInfo::alloc(0, 120)); } else if (xbutton.button == 5) { // wheel backward (toward user) sendEvent(getWheelEvent(), CWheelInfo::alloc(0, -120)); } // XXX -- support x-axis scrolling } void CXWindowsScreen::onMouseMove(const XMotionEvent& xmotion) { LOG((CLOG_DEBUG2 "event: MotionNotify %d,%d", xmotion.x_root, xmotion.y_root)); // compute motion delta (relative to the last known // mouse position) SInt32 x = xmotion.x_root - m_xCursor; SInt32 y = xmotion.y_root - m_yCursor; // save position to compute delta of next motion m_xCursor = xmotion.x_root; m_yCursor = xmotion.y_root; if (xmotion.send_event) { // we warped the mouse. discard events until we // find the matching sent event. see // warpCursorNoFlush() for where the events are // sent. we discard the matching sent event and // can be sure we've skipped the warp event. XEvent xevent; char cntr = 0; do { XMaskEvent(m_display, PointerMotionMask, &xevent); if (cntr++ > 10) { LOG((CLOG_WARN "too many discarded events! %d", cntr)); break; } } while (!xevent.xany.send_event); cntr = 0; } else if (m_isOnScreen) { // motion on primary screen sendEvent(getMotionOnPrimaryEvent(), CMotionInfo::alloc(m_xCursor, m_yCursor)); } else { // motion on secondary screen. warp mouse back to // center. // // my lombard (powerbook g3) running linux and // using the adbmouse driver has two problems: // first, the driver only sends motions of +/-2 // pixels and, second, it seems to discard some // physical input after a warp. the former isn't a // big deal (we're just limited to every other // pixel) but the latter is a PITA. to work around // it we only warp when the mouse has moved more // than s_size pixels from the center. static const SInt32 s_size = 32; if (xmotion.x_root - m_xCenter < -s_size || xmotion.x_root - m_xCenter > s_size || xmotion.y_root - m_yCenter < -s_size || xmotion.y_root - m_yCenter > s_size) { warpCursorNoFlush(m_xCenter, m_yCenter); } // send event if mouse moved. do this after warping // back to center in case the motion takes us onto // the primary screen. if we sent the event first // in that case then the warp would happen after // warping to the primary screen's enter position, // effectively overriding it. if (x != 0 || y != 0) { sendEvent(getMotionOnSecondaryEvent(), CMotionInfo::alloc(x, y)); } } } Cursor CXWindowsScreen::createBlankCursor() const { // this seems just a bit more complicated than really necessary // get the closet cursor size to 1x1 unsigned int w, h; XQueryBestCursor(m_display, m_root, 1, 1, &w, &h); // make bitmap data for cursor of closet size. since the cursor // is blank we can use the same bitmap for shape and mask: all // zeros. const int size = ((w + 7) >> 3) * h; char* data = new char[size]; memset(data, 0, size); // make bitmap Pixmap bitmap = XCreateBitmapFromData(m_display, m_root, data, w, h); // need an arbitrary color for the cursor XColor color; color.pixel = 0; color.red = color.green = color.blue = 0; color.flags = DoRed | DoGreen | DoBlue; // make cursor from bitmap Cursor cursor = XCreatePixmapCursor(m_display, bitmap, bitmap, &color, &color, 0, 0); // don't need bitmap or the data anymore delete[] data; XFreePixmap(m_display, bitmap); return cursor; } ClipboardID CXWindowsScreen::getClipboardID(Atom selection) const { for (ClipboardID id = 0; id < kClipboardEnd; ++id) { if (m_clipboard[id] != NULL && m_clipboard[id]->getSelection() == selection) { return id; } } return kClipboardEnd; } void CXWindowsScreen::processClipboardRequest(Window requestor, Time time, Atom property) { // check every clipboard until one returns success for (ClipboardID id = 0; id < kClipboardEnd; ++id) { if (m_clipboard[id] != NULL && m_clipboard[id]->processRequest(requestor, time, property)) { break; } } } void CXWindowsScreen::destroyClipboardRequest(Window requestor) { // check every clipboard until one returns success for (ClipboardID id = 0; id < kClipboardEnd; ++id) { if (m_clipboard[id] != NULL && m_clipboard[id]->destroyRequest(requestor)) { break; } } } void CXWindowsScreen::onError() { // prevent further access to the X display m_eventQueue.adoptBuffer(NULL); m_screensaver->destroy(); m_screensaver = NULL; m_display = NULL; // notify of failure sendEvent(getErrorEvent(), NULL); // FIXME -- should ensure that we ignore operations that involve // m_display from now on. however, Xlib will simply exit the // application in response to the X I/O error so there's no // point in trying to really handle the error. if we did want // to handle the error, it'd probably be easiest to delegate to // one of two objects. one object would take the implementation // from this class. the other object would be stub methods that // don't use X11. on error, we'd switch to the latter. } int CXWindowsScreen::ioErrorHandler(Display*) { // the display has disconnected, probably because X is shutting // down. X forces us to exit at this point which is annoying. // we'll pretend as if we won't exit so we try to make sure we // don't access the display anymore. LOG((CLOG_CRIT "X display has unexpectedly disconnected")); s_screen->onError(); return 0; } void CXWindowsScreen::selectEvents(Window w) const { // ignore errors while we adjust event masks. windows could be // destroyed at any time after the XQueryTree() in doSelectEvents() // so we must ignore BadWindow errors. CXWindowsUtil::CErrorLock lock(m_display); // adjust event masks doSelectEvents(w); } void CXWindowsScreen::doSelectEvents(Window w) const { // we want to track the mouse everywhere on the display. to achieve // that we select PointerMotionMask on every window. we also select // SubstructureNotifyMask in order to get CreateNotify events so we // select events on new windows too. // // note that this can break certain clients due a design flaw of X. // X will deliver a PointerMotion event to the deepest window in the // hierarchy that contains the pointer and has PointerMotionMask // selected by *any* client. if another client doesn't select // motion events in a subwindow so the parent window will get them // then by selecting for motion events on the subwindow we break // that client because the parent will no longer get the events. // FIXME -- should provide some workaround for event selection // design flaw. perhaps only select for motion events on windows // that already do or are top-level windows or don't propagate // pointer events. or maybe an option to simply poll the mouse. // we don't want to adjust our grab window if (w == m_window) { return; } // select events of interest. do this before querying the tree so // we'll get notifications of children created after the XQueryTree() // so we won't miss them. XSelectInput(m_display, w, PointerMotionMask | SubstructureNotifyMask); // recurse on child windows Window rw, pw, *cw; unsigned int nc; if (XQueryTree(m_display, w, &rw, &pw, &cw, &nc)) { for (unsigned int i = 0; i < nc; ++i) { doSelectEvents(cw[i]); } XFree(cw); } } KeyID CXWindowsScreen::mapKeyFromX(XKeyEvent* event) const { // convert to a keysym KeySym keysym; if (event->type == KeyPress && m_ic != NULL) { // do multibyte lookup. can only call XmbLookupString with a // key press event and a valid XIC so we checked those above. char scratch[32]; int n = sizeof(scratch) / sizeof(scratch[0]); char* buffer = scratch; int status; n = XmbLookupString(m_ic, event, buffer, n, &keysym, &status); if (status == XBufferOverflow) { // not enough space. grow buffer and try again. buffer = new char[n]; n = XmbLookupString(m_ic, event, buffer, n, &keysym, &status); delete[] buffer; } // see what we got. since we don't care about the string // we'll just look for a keysym. switch (status) { default: case XLookupNone: case XLookupChars: keysym = 0; break; case XLookupKeySym: case XLookupBoth: break; } } else { // plain old lookup char dummy[1]; XLookupString(event, dummy, 0, &keysym, NULL); } // convert key return CXWindowsUtil::mapKeySymToKeyID(keysym); } ButtonID CXWindowsScreen::mapButtonFromX(const XButtonEvent* event) const { unsigned int button = event->button; // first three buttons map to 1, 2, 3 (kButtonLeft, Middle, Right) if (button >= 1 && button <= 3) { return static_cast(button); } // buttons 4 and 5 are ignored here. they're used for the wheel. // buttons 6, 7, etc and up map to 4, 5, etc. else if (button >= 6) { return static_cast(button - 2); } // unknown button else { return kButtonNone; } } unsigned int CXWindowsScreen::mapButtonToX(ButtonID id) const { // map button -1 to button 4 (+wheel) if (id == static_cast(-1)) { id = 4; } // map button -2 to button 5 (-wheel) else if (id == static_cast(-2)) { id = 5; } // map buttons 4, 5, etc. to 6, 7, etc. to make room for buttons // 4 and 5 used to simulate the mouse wheel. else if (id >= 4) { id += 2; } // check button is in legal range if (id < 1 || id > m_buttons.size()) { // out of range return 0; } // map button return static_cast(id); } void CXWindowsScreen::warpCursorNoFlush(SInt32 x, SInt32 y) { assert(m_window != None); // send an event that we can recognize before the mouse warp XEvent eventBefore; eventBefore.type = MotionNotify; eventBefore.xmotion.display = m_display; eventBefore.xmotion.window = m_window; eventBefore.xmotion.root = m_root; eventBefore.xmotion.subwindow = m_window; eventBefore.xmotion.time = CurrentTime; eventBefore.xmotion.x = x; eventBefore.xmotion.y = y; eventBefore.xmotion.x_root = x; eventBefore.xmotion.y_root = y; eventBefore.xmotion.state = 0; eventBefore.xmotion.is_hint = NotifyNormal; eventBefore.xmotion.same_screen = True; XEvent eventAfter = eventBefore; XSendEvent(m_display, m_window, False, 0, &eventBefore); // warp mouse XWarpPointer(m_display, None, m_root, 0, 0, 0, 0, x, y); // send an event that we can recognize after the mouse warp XSendEvent(m_display, m_window, False, 0, &eventAfter); XSync(m_display, False); LOG((CLOG_DEBUG2 "warped to %d,%d", x, y)); } void CXWindowsScreen::updateButtons() { // query the button mapping UInt32 numButtons = XGetPointerMapping(m_display, NULL, 0); unsigned char* tmpButtons = new unsigned char[numButtons]; XGetPointerMapping(m_display, tmpButtons, numButtons); // find the largest logical button id unsigned char maxButton = 0; for (UInt32 i = 0; i < numButtons; ++i) { if (tmpButtons[i] > maxButton) { maxButton = tmpButtons[i]; } } // allocate button array m_buttons.resize(maxButton); // fill in button array values. m_buttons[i] is the physical // button number for logical button i+1. for (UInt32 i = 0; i < numButtons; ++i) { m_buttons[i] = 0; } for (UInt32 i = 0; i < numButtons; ++i) { m_buttons[tmpButtons[i] - 1] = i + 1; } // clean up delete[] tmpButtons; } bool CXWindowsScreen::grabMouseAndKeyboard() { unsigned int event_mask = ButtonPressMask | ButtonReleaseMask | EnterWindowMask | LeaveWindowMask | PointerMotionMask; // grab the mouse and keyboard. keep trying until we get them. // if we can't grab one after grabbing the other then ungrab // and wait before retrying. give up after s_timeout seconds. static const double s_timeout = 1.0; int result; CStopwatch timer; do { // keyboard first do { result = XGrabKeyboard(m_display, m_window, True, GrabModeAsync, GrabModeAsync, CurrentTime); assert(result != GrabNotViewable); if (result != GrabSuccess) { LOG((CLOG_DEBUG2 "waiting to grab keyboard")); ARCH->sleep(0.05); if (timer.getTime() >= s_timeout) { LOG((CLOG_DEBUG2 "grab keyboard timed out")); return false; } } } while (result != GrabSuccess); LOG((CLOG_DEBUG2 "grabbed keyboard")); // now the mouse --- use event_mask to get EnterNotify, LeaveNotify events result = XGrabPointer(m_display, m_window, False, event_mask, GrabModeAsync, GrabModeAsync, m_window, None, CurrentTime); assert(result != GrabNotViewable); if (result != GrabSuccess) { // back off to avoid grab deadlock XUngrabKeyboard(m_display, CurrentTime); LOG((CLOG_DEBUG2 "ungrabbed keyboard, waiting to grab pointer")); ARCH->sleep(0.05); if (timer.getTime() >= s_timeout) { LOG((CLOG_DEBUG2 "grab pointer timed out")); return false; } } } while (result != GrabSuccess); LOG((CLOG_DEBUG1 "grabbed pointer and keyboard")); return true; } void CXWindowsScreen::refreshKeyboard(XEvent* event) { if (XPending(m_display) > 0) { XEvent tmpEvent; XPeekEvent(m_display, &tmpEvent); if (tmpEvent.type == MappingNotify) { // discard this event since another follows. // we tend to get a bunch of these in a row. return; } } // keyboard mapping changed #if HAVE_XKB_EXTENSION if (m_xkb && event->type == m_xkbEventBase) { XkbRefreshKeyboardMapping((XkbMapNotifyEvent*)event); } else #else { XRefreshKeyboardMapping(&event->xmapping); } #endif m_keyState->updateKeyMap(); m_keyState->updateKeyState(); } // // CXWindowsScreen::CHotKeyItem // CXWindowsScreen::CHotKeyItem::CHotKeyItem(int keycode, unsigned int mask) : m_keycode(keycode), m_mask(mask) { // do nothing } bool CXWindowsScreen::CHotKeyItem::operator<(const CHotKeyItem& x) const { return (m_keycode < x.m_keycode || (m_keycode == x.m_keycode && m_mask < x.m_mask)); } bool CXWindowsScreen::detectXI2() { int event, error; return XQueryExtension(m_display, "XInputExtension", &xi_opcode, &event, &error); } #ifdef HAVE_XI2 void CXWindowsScreen::selectXIRawMotion() { XIEventMask mask; mask.deviceid = XIAllDevices; mask.mask_len = XIMaskLen(XI_RawMotion); mask.mask = (unsigned char*)calloc(mask.mask_len, sizeof(char)); mask.deviceid = XIAllMasterDevices; memset(mask.mask, 0, 2); XISetMask(mask.mask, XI_RawKeyRelease); XISetMask(mask.mask, XI_RawMotion); XISelectEvents(m_display, DefaultRootWindow(m_display), &mask, 1); free(mask.mask); } #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsScreen.h0000600000175000017500000001660512021261364023073 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSSCREEN_H #define CXWINDOWSSCREEN_H #include "CPlatformScreen.h" #include "stdset.h" #include "stdvector.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include #endif #include "CKeyMap.h" class CXWindowsClipboard; class CXWindowsKeyState; class CXWindowsScreenSaver; //! Implementation of IPlatformScreen for X11 class CXWindowsScreen : public CPlatformScreen { public: CXWindowsScreen(const char* displayName, bool isPrimary, bool disableXInitThreads, int mouseScrollDelta, IEventQueue& eventQueue); virtual ~CXWindowsScreen(); //! @name manipulators //@{ //@} // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IPrimaryScreen overrides virtual void reconfigure(UInt32 activeSides); virtual void warpCursor(SInt32 x, SInt32 y); virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask); virtual void unregisterHotKey(UInt32 id); virtual void fakeInputBegin(); virtual void fakeInputEnd(); virtual SInt32 getJumpZoneSize() const; virtual bool isAnyMouseButtonDown() const; virtual void getCursorCenter(SInt32& x, SInt32& y) const; virtual void gameDeviceTimingResp(UInt16 freq) { } // ISecondaryScreen overrides virtual void fakeMouseButton(ButtonID id, bool press); virtual void fakeMouseMove(SInt32 x, SInt32 y) const; virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const; virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const { } virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const { } virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const { } virtual void queueGameDeviceTimingReq() const { } // IPlatformScreen overrides virtual void enable(); virtual void disable(); virtual void enter(); virtual bool leave(); virtual bool setClipboard(ClipboardID, const IClipboard*); virtual void checkClipboards(); virtual void openScreensaver(bool notify); virtual void closeScreensaver(); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); virtual void setSequenceNumber(UInt32); virtual bool isPrimary() const; virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { } protected: // IPlatformScreen overrides virtual void handleSystemEvent(const CEvent&, void*); virtual void updateButtons(); virtual IKeyState* getKeyState() const; private: // event sending void sendEvent(CEvent::Type, void* = NULL); void sendClipboardEvent(CEvent::Type, ClipboardID); // create the transparent cursor Cursor createBlankCursor() const; // determine the clipboard from the X selection. returns // kClipboardEnd if no such clipboard. ClipboardID getClipboardID(Atom selection) const; // continue processing a selection request void processClipboardRequest(Window window, Time time, Atom property); // terminate a selection request void destroyClipboardRequest(Window window); // X I/O error handler void onError(); static int ioErrorHandler(Display*); private: class CKeyEventFilter { public: int m_event; Window m_window; Time m_time; KeyCode m_keycode; }; Display* openDisplay(const char* displayName); void saveShape(); Window openWindow() const; void openIM(); bool grabMouseAndKeyboard(); void onKeyPress(XKeyEvent&); void onKeyRelease(XKeyEvent&, bool isRepeat); bool onHotKey(XKeyEvent&, bool isRepeat); void onMousePress(const XButtonEvent&); void onMouseRelease(const XButtonEvent&); void onMouseMove(const XMotionEvent&); bool detectXI2(); #ifdef HAVE_XI2 void selectXIRawMotion(); #endif void selectEvents(Window) const; void doSelectEvents(Window) const; KeyID mapKeyFromX(XKeyEvent*) const; ButtonID mapButtonFromX(const XButtonEvent*) const; unsigned int mapButtonToX(ButtonID id) const; void warpCursorNoFlush(SInt32 x, SInt32 y); void refreshKeyboard(XEvent*); static Bool findKeyEvent(Display*, XEvent* xevent, XPointer arg); private: struct CHotKeyItem { public: CHotKeyItem(int, unsigned int); bool operator<(const CHotKeyItem&) const; private: int m_keycode; unsigned int m_mask; }; typedef std::set CFilteredKeycodes; typedef std::vector > HotKeyList; typedef std::map HotKeyMap; typedef std::vector HotKeyIDList; typedef std::map HotKeyToIDMap; // true if screen is being used as a primary screen, false otherwise bool m_isPrimary; int m_mouseScrollDelta; Display* m_display; Window m_root; Window m_window; // true if mouse has entered the screen bool m_isOnScreen; // screen shape stuff SInt32 m_x, m_y; SInt32 m_w, m_h; SInt32 m_xCenter, m_yCenter; // last mouse position SInt32 m_xCursor, m_yCursor; // keyboard stuff CXWindowsKeyState* m_keyState; // hot key stuff HotKeyMap m_hotKeys; HotKeyIDList m_oldHotKeyIDs; HotKeyToIDMap m_hotKeyToIDMap; // input focus stuff Window m_lastFocus; int m_lastFocusRevert; // input method stuff XIM m_im; XIC m_ic; KeyCode m_lastKeycode; CFilteredKeycodes m_filtered; // clipboards CXWindowsClipboard* m_clipboard[kClipboardEnd]; UInt32 m_sequenceNumber; // screen saver stuff CXWindowsScreenSaver* m_screensaver; bool m_screensaverNotify; // logical to physical button mapping. m_buttons[i] gives the // physical button for logical button i+1. std::vector m_buttons; // true if global auto-repeat was enabled before we turned it off bool m_autoRepeat; // stuff to workaround xtest being xinerama unaware. attempting // to fake a mouse motion under xinerama may behave strangely, // especially if screen 0 is not at 0,0 or if faking a motion on // a screen other than screen 0. bool m_xtestIsXineramaUnaware; bool m_xinerama; // stuff to work around lost focus issues on certain systems // (ie: a MythTV front-end). bool m_preserveFocus; // XKB extension stuff bool m_xkb; int m_xkbEventBase; bool m_xi2detected; // XRandR extension stuff bool m_xrandr; int m_xrandrEventBase; IEventQueue& m_eventQueue; CKeyMap m_keyMap; // pointer to (singleton) screen. this is only needed by // ioErrorHandler(). static CXWindowsScreen* s_screen; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsScreenSaver.cpp0000600000175000017500000003500612021261364024423 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsScreenSaver.h" #include "CXWindowsUtil.h" #include "IPlatformScreen.h" #include "CLog.h" #include "CEvent.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include #if HAVE_X11_EXTENSIONS_XTEST_H # include #else # error The XTest extension is required to build synergy #endif #if HAVE_X11_EXTENSIONS_DPMS_H extern "C" { # include # include # if !HAVE_DPMS_PROTOTYPES # undef DPMSModeOn # undef DPMSModeStandby # undef DPMSModeSuspend # undef DPMSModeOff # define DPMSModeOn 0 # define DPMSModeStandby 1 # define DPMSModeSuspend 2 # define DPMSModeOff 3 extern Bool DPMSQueryExtension(Display *, int *, int *); extern Bool DPMSCapable(Display *); extern Status DPMSEnable(Display *); extern Status DPMSDisable(Display *); extern Status DPMSForceLevel(Display *, CARD16); extern Status DPMSInfo(Display *, CARD16 *, BOOL *); # endif } #endif // // CXWindowsScreenSaver // CXWindowsScreenSaver::CXWindowsScreenSaver( Display* display, Window window, void* eventTarget, IEventQueue& eventQueue) : m_display(display), m_xscreensaverSink(window), m_eventTarget(eventTarget), m_xscreensaver(None), m_xscreensaverActive(false), m_dpms(false), m_disabled(false), m_suppressDisable(false), m_disableTimer(NULL), m_disablePos(0), m_eventQueue(eventQueue) { // get atoms m_atomScreenSaver = XInternAtom(m_display, "SCREENSAVER", False); m_atomScreenSaverVersion = XInternAtom(m_display, "_SCREENSAVER_VERSION", False); m_atomScreenSaverActivate = XInternAtom(m_display, "ACTIVATE", False); m_atomScreenSaverDeactivate = XInternAtom(m_display, "DEACTIVATE", False); // check for DPMS extension. this is an alternative screen saver // that powers down the display. #if HAVE_X11_EXTENSIONS_DPMS_H int eventBase, errorBase; if (DPMSQueryExtension(m_display, &eventBase, &errorBase)) { if (DPMSCapable(m_display)) { // we have DPMS m_dpms = true; } } #endif // watch top-level windows for changes bool error = false; { CXWindowsUtil::CErrorLock lock(m_display, &error); Window root = DefaultRootWindow(m_display); XWindowAttributes attr; XGetWindowAttributes(m_display, root, &attr); m_rootEventMask = attr.your_event_mask; XSelectInput(m_display, root, m_rootEventMask | SubstructureNotifyMask); } if (error) { LOG((CLOG_DEBUG "didn't set root event mask")); m_rootEventMask = 0; } // get the built-in settings XGetScreenSaver(m_display, &m_timeout, &m_interval, &m_preferBlanking, &m_allowExposures); // get the DPMS settings m_dpmsEnabled = isDPMSEnabled(); // get the xscreensaver window, if any if (!findXScreenSaver()) { setXScreenSaver(None); } // install disable timer event handler m_eventQueue.adoptHandler(CEvent::kTimer, this, new TMethodEventJob(this, &CXWindowsScreenSaver::handleDisableTimer)); } CXWindowsScreenSaver::~CXWindowsScreenSaver() { // done with disable job if (m_disableTimer != NULL) { m_eventQueue.deleteTimer(m_disableTimer); } m_eventQueue.removeHandler(CEvent::kTimer, this); if (m_display != NULL) { enableDPMS(m_dpmsEnabled); XSetScreenSaver(m_display, m_timeout, m_interval, m_preferBlanking, m_allowExposures); clearWatchForXScreenSaver(); CXWindowsUtil::CErrorLock lock(m_display); XSelectInput(m_display, DefaultRootWindow(m_display), m_rootEventMask); } } void CXWindowsScreenSaver::destroy() { m_display = NULL; delete this; } bool CXWindowsScreenSaver::handleXEvent(const XEvent* xevent) { switch (xevent->type) { case CreateNotify: if (m_xscreensaver == None) { if (isXScreenSaver(xevent->xcreatewindow.window)) { // found the xscreensaver setXScreenSaver(xevent->xcreatewindow.window); } else { // another window to watch. to detect the xscreensaver // window we look for a property but that property may // not yet exist by the time we get this event so we // have to watch the window for property changes. // this would be so much easier if xscreensaver did the // smart thing and stored its window in a property on // the root window. addWatchXScreenSaver(xevent->xcreatewindow.window); } } break; case DestroyNotify: if (xevent->xdestroywindow.window == m_xscreensaver) { // xscreensaver is gone LOG((CLOG_DEBUG "xscreensaver died")); setXScreenSaver(None); return true; } break; case PropertyNotify: if (xevent->xproperty.state == PropertyNewValue) { if (isXScreenSaver(xevent->xproperty.window)) { // found the xscreensaver setXScreenSaver(xevent->xcreatewindow.window); } } break; case MapNotify: if (xevent->xmap.window == m_xscreensaver) { // xscreensaver has activated setXScreenSaverActive(true); return true; } break; case UnmapNotify: if (xevent->xunmap.window == m_xscreensaver) { // xscreensaver has deactivated setXScreenSaverActive(false); return true; } break; } return false; } void CXWindowsScreenSaver::enable() { // for xscreensaver m_disabled = false; updateDisableTimer(); // for built-in X screen saver XSetScreenSaver(m_display, m_timeout, m_interval, m_preferBlanking, m_allowExposures); // for DPMS enableDPMS(m_dpmsEnabled); } void CXWindowsScreenSaver::disable() { // for xscreensaver m_disabled = true; updateDisableTimer(); // use built-in X screen saver XGetScreenSaver(m_display, &m_timeout, &m_interval, &m_preferBlanking, &m_allowExposures); XSetScreenSaver(m_display, 0, m_interval, m_preferBlanking, m_allowExposures); // for DPMS m_dpmsEnabled = isDPMSEnabled(); enableDPMS(false); // FIXME -- now deactivate? } void CXWindowsScreenSaver::activate() { // remove disable job timer m_suppressDisable = true; updateDisableTimer(); // enable DPMS if it was enabled enableDPMS(m_dpmsEnabled); // try xscreensaver findXScreenSaver(); if (m_xscreensaver != None) { sendXScreenSaverCommand(m_atomScreenSaverActivate); return; } // try built-in X screen saver if (m_timeout != 0) { XForceScreenSaver(m_display, ScreenSaverActive); } // try DPMS activateDPMS(true); } void CXWindowsScreenSaver::deactivate() { // reinstall disable job timer m_suppressDisable = false; updateDisableTimer(); // try DPMS activateDPMS(false); // disable DPMS if screen saver is disabled if (m_disabled) { enableDPMS(false); } // try xscreensaver findXScreenSaver(); if (m_xscreensaver != None) { sendXScreenSaverCommand(m_atomScreenSaverDeactivate); return; } // use built-in X screen saver XForceScreenSaver(m_display, ScreenSaverReset); } bool CXWindowsScreenSaver::isActive() const { // check xscreensaver if (m_xscreensaver != None) { return m_xscreensaverActive; } // check DPMS if (isDPMSActivated()) { return true; } // can't check built-in X screen saver activity return false; } bool CXWindowsScreenSaver::findXScreenSaver() { // do nothing if we've already got the xscreensaver window if (m_xscreensaver == None) { // find top-level window xscreensaver window Window root = DefaultRootWindow(m_display); Window rw, pw, *cw; unsigned int nc; if (XQueryTree(m_display, root, &rw, &pw, &cw, &nc)) { for (unsigned int i = 0; i < nc; ++i) { if (isXScreenSaver(cw[i])) { setXScreenSaver(cw[i]); break; } } XFree(cw); } } return (m_xscreensaver != None); } void CXWindowsScreenSaver::setXScreenSaver(Window window) { LOG((CLOG_DEBUG "xscreensaver window: 0x%08x", window)); // save window m_xscreensaver = window; if (m_xscreensaver != None) { // clear old watch list clearWatchForXScreenSaver(); // see if xscreensaver is active bool error = false; XWindowAttributes attr; { CXWindowsUtil::CErrorLock lock(m_display, &error); XGetWindowAttributes(m_display, m_xscreensaver, &attr); } setXScreenSaverActive(!error && attr.map_state != IsUnmapped); // save current DPMS state; xscreensaver may have changed it. m_dpmsEnabled = isDPMSEnabled(); } else { // screen saver can't be active if it doesn't exist setXScreenSaverActive(false); // start watching for xscreensaver watchForXScreenSaver(); } } bool CXWindowsScreenSaver::isXScreenSaver(Window w) const { // check for m_atomScreenSaverVersion string property Atom type; return (CXWindowsUtil::getWindowProperty(m_display, w, m_atomScreenSaverVersion, NULL, &type, NULL, False) && type == XA_STRING); } void CXWindowsScreenSaver::setXScreenSaverActive(bool activated) { if (m_xscreensaverActive != activated) { LOG((CLOG_DEBUG "xscreensaver %s on window 0x%08x", activated ? "activated" : "deactivated", m_xscreensaver)); m_xscreensaverActive = activated; // if screen saver was activated forcefully (i.e. against // our will) then just accept it. don't try to keep it // from activating since that'll just pop up the password // dialog if locking is enabled. m_suppressDisable = activated; updateDisableTimer(); if (activated) { m_eventQueue.addEvent(CEvent( IPlatformScreen::getScreensaverActivatedEvent(), m_eventTarget)); } else { m_eventQueue.addEvent(CEvent( IPlatformScreen::getScreensaverDeactivatedEvent(), m_eventTarget)); } } } void CXWindowsScreenSaver::sendXScreenSaverCommand(Atom cmd, long arg1, long arg2) { XEvent event; event.xclient.type = ClientMessage; event.xclient.display = m_display; event.xclient.window = m_xscreensaverSink; event.xclient.message_type = m_atomScreenSaver; event.xclient.format = 32; event.xclient.data.l[0] = static_cast(cmd); event.xclient.data.l[1] = arg1; event.xclient.data.l[2] = arg2; event.xclient.data.l[3] = 0; event.xclient.data.l[4] = 0; LOG((CLOG_DEBUG "send xscreensaver command: %d %d %d", (long)cmd, arg1, arg2)); bool error = false; { CXWindowsUtil::CErrorLock lock(m_display, &error); XSendEvent(m_display, m_xscreensaver, False, 0, &event); } if (error) { findXScreenSaver(); } } void CXWindowsScreenSaver::watchForXScreenSaver() { // clear old watch list clearWatchForXScreenSaver(); // add every child of the root to the list of windows to watch Window root = DefaultRootWindow(m_display); Window rw, pw, *cw; unsigned int nc; if (XQueryTree(m_display, root, &rw, &pw, &cw, &nc)) { for (unsigned int i = 0; i < nc; ++i) { addWatchXScreenSaver(cw[i]); } XFree(cw); } // now check for xscreensaver window in case it set the property // before we could request property change events. if (findXScreenSaver()) { // found it so clear out our watch list clearWatchForXScreenSaver(); } } void CXWindowsScreenSaver::clearWatchForXScreenSaver() { // stop watching all windows CXWindowsUtil::CErrorLock lock(m_display); for (CWatchList::iterator index = m_watchWindows.begin(); index != m_watchWindows.end(); ++index) { XSelectInput(m_display, index->first, index->second); } m_watchWindows.clear(); } void CXWindowsScreenSaver::addWatchXScreenSaver(Window window) { // get window attributes bool error = false; XWindowAttributes attr; { CXWindowsUtil::CErrorLock lock(m_display, &error); XGetWindowAttributes(m_display, window, &attr); } // if successful and window uses override_redirect (like xscreensaver // does) then watch it for property changes. if (!error && attr.override_redirect == True) { error = false; { CXWindowsUtil::CErrorLock lock(m_display, &error); XSelectInput(m_display, window, attr.your_event_mask | PropertyChangeMask); } if (!error) { // if successful then add the window to our list m_watchWindows.insert(std::make_pair(window, attr.your_event_mask)); } } } void CXWindowsScreenSaver::updateDisableTimer() { if (m_disabled && !m_suppressDisable && m_disableTimer == NULL) { // 5 seconds should be plenty often to suppress the screen saver m_disableTimer = m_eventQueue.newTimer(5.0, this); } else if ((!m_disabled || m_suppressDisable) && m_disableTimer != NULL) { m_eventQueue.deleteTimer(m_disableTimer); m_disableTimer = NULL; } } void CXWindowsScreenSaver::handleDisableTimer(const CEvent&, void*) { // send fake mouse motion directly to xscreensaver if (m_xscreensaver != None) { XEvent event; event.xmotion.type = MotionNotify; event.xmotion.display = m_display; event.xmotion.window = m_xscreensaver; event.xmotion.root = DefaultRootWindow(m_display); event.xmotion.subwindow = None; event.xmotion.time = CurrentTime; event.xmotion.x = m_disablePos; event.xmotion.y = 0; event.xmotion.x_root = m_disablePos; event.xmotion.y_root = 0; event.xmotion.state = 0; event.xmotion.is_hint = NotifyNormal; event.xmotion.same_screen = True; CXWindowsUtil::CErrorLock lock(m_display); XSendEvent(m_display, m_xscreensaver, False, 0, &event); m_disablePos = 20 - m_disablePos; } } void CXWindowsScreenSaver::activateDPMS(bool activate) { #if HAVE_X11_EXTENSIONS_DPMS_H if (m_dpms) { // DPMSForceLevel will generate a BadMatch if DPMS is disabled CXWindowsUtil::CErrorLock lock(m_display); DPMSForceLevel(m_display, activate ? DPMSModeStandby : DPMSModeOn); } #endif } void CXWindowsScreenSaver::enableDPMS(bool enable) { #if HAVE_X11_EXTENSIONS_DPMS_H if (m_dpms) { if (enable) { DPMSEnable(m_display); } else { DPMSDisable(m_display); } } #endif } bool CXWindowsScreenSaver::isDPMSEnabled() const { #if HAVE_X11_EXTENSIONS_DPMS_H if (m_dpms) { CARD16 level; BOOL state; DPMSInfo(m_display, &level, &state); return (state != False); } else { return false; } #else return false; #endif } bool CXWindowsScreenSaver::isDPMSActivated() const { #if HAVE_X11_EXTENSIONS_DPMS_H if (m_dpms) { CARD16 level; BOOL state; DPMSInfo(m_display, &level, &state); return (level != DPMSModeOn); } else { return false; } #else return false; #endif } synergy-1.4.12-Source/src/lib/platform/CXWindowsScreenSaver.h0000600000175000017500000001107712021261364024072 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSSCREENSAVER_H #define CXWINDOWSSCREENSAVER_H #include "IScreenSaver.h" #include "stdmap.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include #endif #include "IEventQueue.h" class CEvent; class CEventQueueTimer; //! X11 screen saver implementation class CXWindowsScreenSaver : public IScreenSaver { public: CXWindowsScreenSaver(Display*, Window, void* eventTarget, IEventQueue& eventQueue); virtual ~CXWindowsScreenSaver(); //! @name manipulators //@{ //! Event filtering /*! Should be called for each system event before event translation and dispatch. Returns true to skip translation and dispatch. */ bool handleXEvent(const XEvent*); //! Destroy without the display /*! Tells this object to delete itself without using the X11 display. It may leak some resources as a result. */ void destroy(); //@} // IScreenSaver overrides virtual void enable(); virtual void disable(); virtual void activate(); virtual void deactivate(); virtual bool isActive() const; private: // find and set the running xscreensaver's window. returns true iff // found. bool findXScreenSaver(); // set the xscreensaver's window, updating the activation state flag void setXScreenSaver(Window); // returns true if the window appears to be the xscreensaver window bool isXScreenSaver(Window) const; // set xscreensaver's activation state flag. sends notification // if the state has changed. void setXScreenSaverActive(bool activated); // send a command to xscreensaver void sendXScreenSaverCommand(Atom, long = 0, long = 0); // watch all windows that could potentially be the xscreensaver for // the events that will confirm it. void watchForXScreenSaver(); // stop watching all watched windows void clearWatchForXScreenSaver(); // add window to the watch list void addWatchXScreenSaver(Window window); // install/uninstall the job used to suppress the screensaver void updateDisableTimer(); // called periodically to prevent the screen saver from starting void handleDisableTimer(const CEvent&, void*); // force DPMS to activate or deactivate void activateDPMS(bool activate); // enable/disable DPMS screen saver void enableDPMS(bool); // check if DPMS is enabled bool isDPMSEnabled() const; // check if DPMS is activate bool isDPMSActivated() const; private: typedef std::map CWatchList; // the X display Display* m_display; // window to receive xscreensaver repsonses Window m_xscreensaverSink; // the target for the events we generate void* m_eventTarget; // xscreensaver's window Window m_xscreensaver; // xscreensaver activation state bool m_xscreensaverActive; // old event mask on root window long m_rootEventMask; // potential xscreensaver windows being watched CWatchList m_watchWindows; // atoms used to communicate with xscreensaver's window Atom m_atomScreenSaver; Atom m_atomScreenSaverVersion; Atom m_atomScreenSaverActivate; Atom m_atomScreenSaverDeactivate; // built-in screen saver settings int m_timeout; int m_interval; int m_preferBlanking; int m_allowExposures; // DPMS screen saver settings bool m_dpms; bool m_dpmsEnabled; // true iff the client wants the screen saver suppressed bool m_disabled; // true iff we're ignoring m_disabled. this is true, for example, // when the client has called activate() and so presumably wants // to activate the screen saver even if disabled. bool m_suppressDisable; // the disable timer (NULL if not installed) CEventQueueTimer* m_disableTimer; // fake mouse motion position for suppressing the screen saver. // xscreensaver since 2.21 requires the mouse to move more than 10 // pixels to be considered significant. SInt32 m_disablePos; IEventQueue& m_eventQueue; }; #endif synergy-1.4.12-Source/src/lib/platform/CXWindowsUtil.cpp0000600000175000017500000024203712021261364023124 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsUtil.h" #include "KeyTypes.h" #include "CThread.h" #include "CLog.h" #include "CStringUtil.h" #include #define XK_APL #define XK_ARABIC #define XK_ARMENIAN #define XK_CAUCASUS #define XK_CURRENCY #define XK_CYRILLIC #define XK_GEORGIAN #define XK_GREEK #define XK_HEBREW #define XK_KATAKANA #define XK_KOREAN #define XK_LATIN1 #define XK_LATIN2 #define XK_LATIN3 #define XK_LATIN4 #define XK_LATIN8 #define XK_LATIN9 #define XK_MISCELLANY #define XK_PUBLISHING #define XK_SPECIAL #define XK_TECHNICAL #define XK_THAI #define XK_VIETNAMESE #define XK_XKB_KEYS #include #if !defined(XK_OE) #define XK_OE 0x13bc #endif #if !defined(XK_oe) #define XK_oe 0x13bd #endif #if !defined(XK_Ydiaeresis) #define XK_Ydiaeresis 0x13be #endif /* * This table maps keysym values into the corresponding ISO 10646 * (UCS, Unicode) values. * * The array keysymtab[] contains pairs of X11 keysym values for graphical * characters and the corresponding Unicode value. * * Author: Markus G. Kuhn , * University of Cambridge, April 2001 * * Special thanks to Richard Verhoeven for preparing * an initial draft of the mapping table. * * This software is in the public domain. Share and enjoy! */ struct codepair { KeySym keysym; UInt32 ucs4; } s_keymap[] = { { XK_Aogonek, 0x0104 }, /* LATIN CAPITAL LETTER A WITH OGONEK */ { XK_breve, 0x02d8 }, /* BREVE */ { XK_Lstroke, 0x0141 }, /* LATIN CAPITAL LETTER L WITH STROKE */ { XK_Lcaron, 0x013d }, /* LATIN CAPITAL LETTER L WITH CARON */ { XK_Sacute, 0x015a }, /* LATIN CAPITAL LETTER S WITH ACUTE */ { XK_Scaron, 0x0160 }, /* LATIN CAPITAL LETTER S WITH CARON */ { XK_Scedilla, 0x015e }, /* LATIN CAPITAL LETTER S WITH CEDILLA */ { XK_Tcaron, 0x0164 }, /* LATIN CAPITAL LETTER T WITH CARON */ { XK_Zacute, 0x0179 }, /* LATIN CAPITAL LETTER Z WITH ACUTE */ { XK_Zcaron, 0x017d }, /* LATIN CAPITAL LETTER Z WITH CARON */ { XK_Zabovedot, 0x017b }, /* LATIN CAPITAL LETTER Z WITH DOT ABOVE */ { XK_aogonek, 0x0105 }, /* LATIN SMALL LETTER A WITH OGONEK */ { XK_ogonek, 0x02db }, /* OGONEK */ { XK_lstroke, 0x0142 }, /* LATIN SMALL LETTER L WITH STROKE */ { XK_lcaron, 0x013e }, /* LATIN SMALL LETTER L WITH CARON */ { XK_sacute, 0x015b }, /* LATIN SMALL LETTER S WITH ACUTE */ { XK_caron, 0x02c7 }, /* CARON */ { XK_scaron, 0x0161 }, /* LATIN SMALL LETTER S WITH CARON */ { XK_scedilla, 0x015f }, /* LATIN SMALL LETTER S WITH CEDILLA */ { XK_tcaron, 0x0165 }, /* LATIN SMALL LETTER T WITH CARON */ { XK_zacute, 0x017a }, /* LATIN SMALL LETTER Z WITH ACUTE */ { XK_doubleacute, 0x02dd }, /* DOUBLE ACUTE ACCENT */ { XK_zcaron, 0x017e }, /* LATIN SMALL LETTER Z WITH CARON */ { XK_zabovedot, 0x017c }, /* LATIN SMALL LETTER Z WITH DOT ABOVE */ { XK_Racute, 0x0154 }, /* LATIN CAPITAL LETTER R WITH ACUTE */ { XK_Abreve, 0x0102 }, /* LATIN CAPITAL LETTER A WITH BREVE */ { XK_Lacute, 0x0139 }, /* LATIN CAPITAL LETTER L WITH ACUTE */ { XK_Cacute, 0x0106 }, /* LATIN CAPITAL LETTER C WITH ACUTE */ { XK_Ccaron, 0x010c }, /* LATIN CAPITAL LETTER C WITH CARON */ { XK_Eogonek, 0x0118 }, /* LATIN CAPITAL LETTER E WITH OGONEK */ { XK_Ecaron, 0x011a }, /* LATIN CAPITAL LETTER E WITH CARON */ { XK_Dcaron, 0x010e }, /* LATIN CAPITAL LETTER D WITH CARON */ { XK_Dstroke, 0x0110 }, /* LATIN CAPITAL LETTER D WITH STROKE */ { XK_Nacute, 0x0143 }, /* LATIN CAPITAL LETTER N WITH ACUTE */ { XK_Ncaron, 0x0147 }, /* LATIN CAPITAL LETTER N WITH CARON */ { XK_Odoubleacute, 0x0150 }, /* LATIN CAPITAL LETTER O WITH DOUBLE ACUTE */ { XK_Rcaron, 0x0158 }, /* LATIN CAPITAL LETTER R WITH CARON */ { XK_Uring, 0x016e }, /* LATIN CAPITAL LETTER U WITH RING ABOVE */ { XK_Udoubleacute, 0x0170 }, /* LATIN CAPITAL LETTER U WITH DOUBLE ACUTE */ { XK_Tcedilla, 0x0162 }, /* LATIN CAPITAL LETTER T WITH CEDILLA */ { XK_racute, 0x0155 }, /* LATIN SMALL LETTER R WITH ACUTE */ { XK_abreve, 0x0103 }, /* LATIN SMALL LETTER A WITH BREVE */ { XK_lacute, 0x013a }, /* LATIN SMALL LETTER L WITH ACUTE */ { XK_cacute, 0x0107 }, /* LATIN SMALL LETTER C WITH ACUTE */ { XK_ccaron, 0x010d }, /* LATIN SMALL LETTER C WITH CARON */ { XK_eogonek, 0x0119 }, /* LATIN SMALL LETTER E WITH OGONEK */ { XK_ecaron, 0x011b }, /* LATIN SMALL LETTER E WITH CARON */ { XK_dcaron, 0x010f }, /* LATIN SMALL LETTER D WITH CARON */ { XK_dstroke, 0x0111 }, /* LATIN SMALL LETTER D WITH STROKE */ { XK_nacute, 0x0144 }, /* LATIN SMALL LETTER N WITH ACUTE */ { XK_ncaron, 0x0148 }, /* LATIN SMALL LETTER N WITH CARON */ { XK_odoubleacute, 0x0151 }, /* LATIN SMALL LETTER O WITH DOUBLE ACUTE */ { XK_rcaron, 0x0159 }, /* LATIN SMALL LETTER R WITH CARON */ { XK_uring, 0x016f }, /* LATIN SMALL LETTER U WITH RING ABOVE */ { XK_udoubleacute, 0x0171 }, /* LATIN SMALL LETTER U WITH DOUBLE ACUTE */ { XK_tcedilla, 0x0163 }, /* LATIN SMALL LETTER T WITH CEDILLA */ { XK_abovedot, 0x02d9 }, /* DOT ABOVE */ { XK_Hstroke, 0x0126 }, /* LATIN CAPITAL LETTER H WITH STROKE */ { XK_Hcircumflex, 0x0124 }, /* LATIN CAPITAL LETTER H WITH CIRCUMFLEX */ { XK_Iabovedot, 0x0130 }, /* LATIN CAPITAL LETTER I WITH DOT ABOVE */ { XK_Gbreve, 0x011e }, /* LATIN CAPITAL LETTER G WITH BREVE */ { XK_Jcircumflex, 0x0134 }, /* LATIN CAPITAL LETTER J WITH CIRCUMFLEX */ { XK_hstroke, 0x0127 }, /* LATIN SMALL LETTER H WITH STROKE */ { XK_hcircumflex, 0x0125 }, /* LATIN SMALL LETTER H WITH CIRCUMFLEX */ { XK_idotless, 0x0131 }, /* LATIN SMALL LETTER DOTLESS I */ { XK_gbreve, 0x011f }, /* LATIN SMALL LETTER G WITH BREVE */ { XK_jcircumflex, 0x0135 }, /* LATIN SMALL LETTER J WITH CIRCUMFLEX */ { XK_Cabovedot, 0x010a }, /* LATIN CAPITAL LETTER C WITH DOT ABOVE */ { XK_Ccircumflex, 0x0108 }, /* LATIN CAPITAL LETTER C WITH CIRCUMFLEX */ { XK_Gabovedot, 0x0120 }, /* LATIN CAPITAL LETTER G WITH DOT ABOVE */ { XK_Gcircumflex, 0x011c }, /* LATIN CAPITAL LETTER G WITH CIRCUMFLEX */ { XK_Ubreve, 0x016c }, /* LATIN CAPITAL LETTER U WITH BREVE */ { XK_Scircumflex, 0x015c }, /* LATIN CAPITAL LETTER S WITH CIRCUMFLEX */ { XK_cabovedot, 0x010b }, /* LATIN SMALL LETTER C WITH DOT ABOVE */ { XK_ccircumflex, 0x0109 }, /* LATIN SMALL LETTER C WITH CIRCUMFLEX */ { XK_gabovedot, 0x0121 }, /* LATIN SMALL LETTER G WITH DOT ABOVE */ { XK_gcircumflex, 0x011d }, /* LATIN SMALL LETTER G WITH CIRCUMFLEX */ { XK_ubreve, 0x016d }, /* LATIN SMALL LETTER U WITH BREVE */ { XK_scircumflex, 0x015d }, /* LATIN SMALL LETTER S WITH CIRCUMFLEX */ { XK_kra, 0x0138 }, /* LATIN SMALL LETTER KRA */ { XK_Rcedilla, 0x0156 }, /* LATIN CAPITAL LETTER R WITH CEDILLA */ { XK_Itilde, 0x0128 }, /* LATIN CAPITAL LETTER I WITH TILDE */ { XK_Lcedilla, 0x013b }, /* LATIN CAPITAL LETTER L WITH CEDILLA */ { XK_Emacron, 0x0112 }, /* LATIN CAPITAL LETTER E WITH MACRON */ { XK_Gcedilla, 0x0122 }, /* LATIN CAPITAL LETTER G WITH CEDILLA */ { XK_Tslash, 0x0166 }, /* LATIN CAPITAL LETTER T WITH STROKE */ { XK_rcedilla, 0x0157 }, /* LATIN SMALL LETTER R WITH CEDILLA */ { XK_itilde, 0x0129 }, /* LATIN SMALL LETTER I WITH TILDE */ { XK_lcedilla, 0x013c }, /* LATIN SMALL LETTER L WITH CEDILLA */ { XK_emacron, 0x0113 }, /* LATIN SMALL LETTER E WITH MACRON */ { XK_gcedilla, 0x0123 }, /* LATIN SMALL LETTER G WITH CEDILLA */ { XK_tslash, 0x0167 }, /* LATIN SMALL LETTER T WITH STROKE */ { XK_ENG, 0x014a }, /* LATIN CAPITAL LETTER ENG */ { XK_eng, 0x014b }, /* LATIN SMALL LETTER ENG */ { XK_Amacron, 0x0100 }, /* LATIN CAPITAL LETTER A WITH MACRON */ { XK_Iogonek, 0x012e }, /* LATIN CAPITAL LETTER I WITH OGONEK */ { XK_Eabovedot, 0x0116 }, /* LATIN CAPITAL LETTER E WITH DOT ABOVE */ { XK_Imacron, 0x012a }, /* LATIN CAPITAL LETTER I WITH MACRON */ { XK_Ncedilla, 0x0145 }, /* LATIN CAPITAL LETTER N WITH CEDILLA */ { XK_Omacron, 0x014c }, /* LATIN CAPITAL LETTER O WITH MACRON */ { XK_Kcedilla, 0x0136 }, /* LATIN CAPITAL LETTER K WITH CEDILLA */ { XK_Uogonek, 0x0172 }, /* LATIN CAPITAL LETTER U WITH OGONEK */ { XK_Utilde, 0x0168 }, /* LATIN CAPITAL LETTER U WITH TILDE */ { XK_Umacron, 0x016a }, /* LATIN CAPITAL LETTER U WITH MACRON */ { XK_amacron, 0x0101 }, /* LATIN SMALL LETTER A WITH MACRON */ { XK_iogonek, 0x012f }, /* LATIN SMALL LETTER I WITH OGONEK */ { XK_eabovedot, 0x0117 }, /* LATIN SMALL LETTER E WITH DOT ABOVE */ { XK_imacron, 0x012b }, /* LATIN SMALL LETTER I WITH MACRON */ { XK_ncedilla, 0x0146 }, /* LATIN SMALL LETTER N WITH CEDILLA */ { XK_omacron, 0x014d }, /* LATIN SMALL LETTER O WITH MACRON */ { XK_kcedilla, 0x0137 }, /* LATIN SMALL LETTER K WITH CEDILLA */ { XK_uogonek, 0x0173 }, /* LATIN SMALL LETTER U WITH OGONEK */ { XK_utilde, 0x0169 }, /* LATIN SMALL LETTER U WITH TILDE */ { XK_umacron, 0x016b }, /* LATIN SMALL LETTER U WITH MACRON */ #if defined(XK_Babovedot) { XK_Babovedot, 0x1e02 }, /* LATIN CAPITAL LETTER B WITH DOT ABOVE */ { XK_babovedot, 0x1e03 }, /* LATIN SMALL LETTER B WITH DOT ABOVE */ { XK_Dabovedot, 0x1e0a }, /* LATIN CAPITAL LETTER D WITH DOT ABOVE */ { XK_Wgrave, 0x1e80 }, /* LATIN CAPITAL LETTER W WITH GRAVE */ { XK_Wacute, 0x1e82 }, /* LATIN CAPITAL LETTER W WITH ACUTE */ { XK_dabovedot, 0x1e0b }, /* LATIN SMALL LETTER D WITH DOT ABOVE */ { XK_Ygrave, 0x1ef2 }, /* LATIN CAPITAL LETTER Y WITH GRAVE */ { XK_Fabovedot, 0x1e1e }, /* LATIN CAPITAL LETTER F WITH DOT ABOVE */ { XK_fabovedot, 0x1e1f }, /* LATIN SMALL LETTER F WITH DOT ABOVE */ { XK_Mabovedot, 0x1e40 }, /* LATIN CAPITAL LETTER M WITH DOT ABOVE */ { XK_mabovedot, 0x1e41 }, /* LATIN SMALL LETTER M WITH DOT ABOVE */ { XK_Pabovedot, 0x1e56 }, /* LATIN CAPITAL LETTER P WITH DOT ABOVE */ { XK_wgrave, 0x1e81 }, /* LATIN SMALL LETTER W WITH GRAVE */ { XK_pabovedot, 0x1e57 }, /* LATIN SMALL LETTER P WITH DOT ABOVE */ { XK_wacute, 0x1e83 }, /* LATIN SMALL LETTER W WITH ACUTE */ { XK_Sabovedot, 0x1e60 }, /* LATIN CAPITAL LETTER S WITH DOT ABOVE */ { XK_ygrave, 0x1ef3 }, /* LATIN SMALL LETTER Y WITH GRAVE */ { XK_Wdiaeresis, 0x1e84 }, /* LATIN CAPITAL LETTER W WITH DIAERESIS */ { XK_wdiaeresis, 0x1e85 }, /* LATIN SMALL LETTER W WITH DIAERESIS */ { XK_sabovedot, 0x1e61 }, /* LATIN SMALL LETTER S WITH DOT ABOVE */ { XK_Wcircumflex, 0x0174 }, /* LATIN CAPITAL LETTER W WITH CIRCUMFLEX */ { XK_Tabovedot, 0x1e6a }, /* LATIN CAPITAL LETTER T WITH DOT ABOVE */ { XK_Ycircumflex, 0x0176 }, /* LATIN CAPITAL LETTER Y WITH CIRCUMFLEX */ { XK_wcircumflex, 0x0175 }, /* LATIN SMALL LETTER W WITH CIRCUMFLEX */ { XK_tabovedot, 0x1e6b }, /* LATIN SMALL LETTER T WITH DOT ABOVE */ { XK_ycircumflex, 0x0177 }, /* LATIN SMALL LETTER Y WITH CIRCUMFLEX */ #endif // defined(XK_Babovedot) #if defined(XK_overline) { XK_overline, 0x203e }, /* OVERLINE */ { XK_kana_fullstop, 0x3002 }, /* IDEOGRAPHIC FULL STOP */ { XK_kana_openingbracket, 0x300c }, /* LEFT CORNER BRACKET */ { XK_kana_closingbracket, 0x300d }, /* RIGHT CORNER BRACKET */ { XK_kana_comma, 0x3001 }, /* IDEOGRAPHIC COMMA */ { XK_kana_conjunctive, 0x30fb }, /* KATAKANA MIDDLE DOT */ { XK_kana_WO, 0x30f2 }, /* KATAKANA LETTER WO */ { XK_kana_a, 0x30a1 }, /* KATAKANA LETTER SMALL A */ { XK_kana_i, 0x30a3 }, /* KATAKANA LETTER SMALL I */ { XK_kana_u, 0x30a5 }, /* KATAKANA LETTER SMALL U */ { XK_kana_e, 0x30a7 }, /* KATAKANA LETTER SMALL E */ { XK_kana_o, 0x30a9 }, /* KATAKANA LETTER SMALL O */ { XK_kana_ya, 0x30e3 }, /* KATAKANA LETTER SMALL YA */ { XK_kana_yu, 0x30e5 }, /* KATAKANA LETTER SMALL YU */ { XK_kana_yo, 0x30e7 }, /* KATAKANA LETTER SMALL YO */ { XK_kana_tsu, 0x30c3 }, /* KATAKANA LETTER SMALL TU */ { XK_prolongedsound, 0x30fc }, /* KATAKANA-HIRAGANA PROLONGED SOUND MARK */ { XK_kana_A, 0x30a2 }, /* KATAKANA LETTER A */ { XK_kana_I, 0x30a4 }, /* KATAKANA LETTER I */ { XK_kana_U, 0x30a6 }, /* KATAKANA LETTER U */ { XK_kana_E, 0x30a8 }, /* KATAKANA LETTER E */ { XK_kana_O, 0x30aa }, /* KATAKANA LETTER O */ { XK_kana_KA, 0x30ab }, /* KATAKANA LETTER KA */ { XK_kana_KI, 0x30ad }, /* KATAKANA LETTER KI */ { XK_kana_KU, 0x30af }, /* KATAKANA LETTER KU */ { XK_kana_KE, 0x30b1 }, /* KATAKANA LETTER KE */ { XK_kana_KO, 0x30b3 }, /* KATAKANA LETTER KO */ { XK_kana_SA, 0x30b5 }, /* KATAKANA LETTER SA */ { XK_kana_SHI, 0x30b7 }, /* KATAKANA LETTER SI */ { XK_kana_SU, 0x30b9 }, /* KATAKANA LETTER SU */ { XK_kana_SE, 0x30bb }, /* KATAKANA LETTER SE */ { XK_kana_SO, 0x30bd }, /* KATAKANA LETTER SO */ { XK_kana_TA, 0x30bf }, /* KATAKANA LETTER TA */ { XK_kana_CHI, 0x30c1 }, /* KATAKANA LETTER TI */ { XK_kana_TSU, 0x30c4 }, /* KATAKANA LETTER TU */ { XK_kana_TE, 0x30c6 }, /* KATAKANA LETTER TE */ { XK_kana_TO, 0x30c8 }, /* KATAKANA LETTER TO */ { XK_kana_NA, 0x30ca }, /* KATAKANA LETTER NA */ { XK_kana_NI, 0x30cb }, /* KATAKANA LETTER NI */ { XK_kana_NU, 0x30cc }, /* KATAKANA LETTER NU */ { XK_kana_NE, 0x30cd }, /* KATAKANA LETTER NE */ { XK_kana_NO, 0x30ce }, /* KATAKANA LETTER NO */ { XK_kana_HA, 0x30cf }, /* KATAKANA LETTER HA */ { XK_kana_HI, 0x30d2 }, /* KATAKANA LETTER HI */ { XK_kana_FU, 0x30d5 }, /* KATAKANA LETTER HU */ { XK_kana_HE, 0x30d8 }, /* KATAKANA LETTER HE */ { XK_kana_HO, 0x30db }, /* KATAKANA LETTER HO */ { XK_kana_MA, 0x30de }, /* KATAKANA LETTER MA */ { XK_kana_MI, 0x30df }, /* KATAKANA LETTER MI */ { XK_kana_MU, 0x30e0 }, /* KATAKANA LETTER MU */ { XK_kana_ME, 0x30e1 }, /* KATAKANA LETTER ME */ { XK_kana_MO, 0x30e2 }, /* KATAKANA LETTER MO */ { XK_kana_YA, 0x30e4 }, /* KATAKANA LETTER YA */ { XK_kana_YU, 0x30e6 }, /* KATAKANA LETTER YU */ { XK_kana_YO, 0x30e8 }, /* KATAKANA LETTER YO */ { XK_kana_RA, 0x30e9 }, /* KATAKANA LETTER RA */ { XK_kana_RI, 0x30ea }, /* KATAKANA LETTER RI */ { XK_kana_RU, 0x30eb }, /* KATAKANA LETTER RU */ { XK_kana_RE, 0x30ec }, /* KATAKANA LETTER RE */ { XK_kana_RO, 0x30ed }, /* KATAKANA LETTER RO */ { XK_kana_WA, 0x30ef }, /* KATAKANA LETTER WA */ { XK_kana_N, 0x30f3 }, /* KATAKANA LETTER N */ { XK_voicedsound, 0x309b }, /* KATAKANA-HIRAGANA VOICED SOUND MARK */ { XK_semivoicedsound, 0x309c }, /* KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK */ #endif // defined(XK_overline) #if defined(XK_Farsi_0) { XK_Farsi_0, 0x06f0 }, /* EXTENDED ARABIC-INDIC DIGIT 0 */ { XK_Farsi_1, 0x06f1 }, /* EXTENDED ARABIC-INDIC DIGIT 1 */ { XK_Farsi_2, 0x06f2 }, /* EXTENDED ARABIC-INDIC DIGIT 2 */ { XK_Farsi_3, 0x06f3 }, /* EXTENDED ARABIC-INDIC DIGIT 3 */ { XK_Farsi_4, 0x06f4 }, /* EXTENDED ARABIC-INDIC DIGIT 4 */ { XK_Farsi_5, 0x06f5 }, /* EXTENDED ARABIC-INDIC DIGIT 5 */ { XK_Farsi_6, 0x06f6 }, /* EXTENDED ARABIC-INDIC DIGIT 6 */ { XK_Farsi_7, 0x06f7 }, /* EXTENDED ARABIC-INDIC DIGIT 7 */ { XK_Farsi_8, 0x06f8 }, /* EXTENDED ARABIC-INDIC DIGIT 8 */ { XK_Farsi_9, 0x06f9 }, /* EXTENDED ARABIC-INDIC DIGIT 9 */ { XK_Arabic_percent, 0x066a }, /* ARABIC PERCENT */ { XK_Arabic_superscript_alef, 0x0670 }, /* ARABIC LETTER SUPERSCRIPT ALEF */ { XK_Arabic_tteh, 0x0679 }, /* ARABIC LETTER TTEH */ { XK_Arabic_peh, 0x067e }, /* ARABIC LETTER PEH */ { XK_Arabic_tcheh, 0x0686 }, /* ARABIC LETTER TCHEH */ { XK_Arabic_ddal, 0x0688 }, /* ARABIC LETTER DDAL */ { XK_Arabic_rreh, 0x0691 }, /* ARABIC LETTER RREH */ { XK_Arabic_comma, 0x060c }, /* ARABIC COMMA */ { XK_Arabic_fullstop, 0x06d4 }, /* ARABIC FULLSTOP */ { XK_Arabic_semicolon, 0x061b }, /* ARABIC SEMICOLON */ { XK_Arabic_0, 0x0660 }, /* ARABIC 0 */ { XK_Arabic_1, 0x0661 }, /* ARABIC 1 */ { XK_Arabic_2, 0x0662 }, /* ARABIC 2 */ { XK_Arabic_3, 0x0663 }, /* ARABIC 3 */ { XK_Arabic_4, 0x0664 }, /* ARABIC 4 */ { XK_Arabic_5, 0x0665 }, /* ARABIC 5 */ { XK_Arabic_6, 0x0666 }, /* ARABIC 6 */ { XK_Arabic_7, 0x0667 }, /* ARABIC 7 */ { XK_Arabic_8, 0x0668 }, /* ARABIC 8 */ { XK_Arabic_9, 0x0669 }, /* ARABIC 9 */ { XK_Arabic_question_mark, 0x061f }, /* ARABIC QUESTION MARK */ { XK_Arabic_hamza, 0x0621 }, /* ARABIC LETTER HAMZA */ { XK_Arabic_maddaonalef, 0x0622 }, /* ARABIC LETTER ALEF WITH MADDA ABOVE */ { XK_Arabic_hamzaonalef, 0x0623 }, /* ARABIC LETTER ALEF WITH HAMZA ABOVE */ { XK_Arabic_hamzaonwaw, 0x0624 }, /* ARABIC LETTER WAW WITH HAMZA ABOVE */ { XK_Arabic_hamzaunderalef, 0x0625 }, /* ARABIC LETTER ALEF WITH HAMZA BELOW */ { XK_Arabic_hamzaonyeh, 0x0626 }, /* ARABIC LETTER YEH WITH HAMZA ABOVE */ { XK_Arabic_alef, 0x0627 }, /* ARABIC LETTER ALEF */ { XK_Arabic_beh, 0x0628 }, /* ARABIC LETTER BEH */ { XK_Arabic_tehmarbuta, 0x0629 }, /* ARABIC LETTER TEH MARBUTA */ { XK_Arabic_teh, 0x062a }, /* ARABIC LETTER TEH */ { XK_Arabic_theh, 0x062b }, /* ARABIC LETTER THEH */ { XK_Arabic_jeem, 0x062c }, /* ARABIC LETTER JEEM */ { XK_Arabic_hah, 0x062d }, /* ARABIC LETTER HAH */ { XK_Arabic_khah, 0x062e }, /* ARABIC LETTER KHAH */ { XK_Arabic_dal, 0x062f }, /* ARABIC LETTER DAL */ { XK_Arabic_thal, 0x0630 }, /* ARABIC LETTER THAL */ { XK_Arabic_ra, 0x0631 }, /* ARABIC LETTER REH */ { XK_Arabic_zain, 0x0632 }, /* ARABIC LETTER ZAIN */ { XK_Arabic_seen, 0x0633 }, /* ARABIC LETTER SEEN */ { XK_Arabic_sheen, 0x0634 }, /* ARABIC LETTER SHEEN */ { XK_Arabic_sad, 0x0635 }, /* ARABIC LETTER SAD */ { XK_Arabic_dad, 0x0636 }, /* ARABIC LETTER DAD */ { XK_Arabic_tah, 0x0637 }, /* ARABIC LETTER TAH */ { XK_Arabic_zah, 0x0638 }, /* ARABIC LETTER ZAH */ { XK_Arabic_ain, 0x0639 }, /* ARABIC LETTER AIN */ { XK_Arabic_ghain, 0x063a }, /* ARABIC LETTER GHAIN */ { XK_Arabic_tatweel, 0x0640 }, /* ARABIC TATWEEL */ { XK_Arabic_feh, 0x0641 }, /* ARABIC LETTER FEH */ { XK_Arabic_qaf, 0x0642 }, /* ARABIC LETTER QAF */ { XK_Arabic_kaf, 0x0643 }, /* ARABIC LETTER KAF */ { XK_Arabic_lam, 0x0644 }, /* ARABIC LETTER LAM */ { XK_Arabic_meem, 0x0645 }, /* ARABIC LETTER MEEM */ { XK_Arabic_noon, 0x0646 }, /* ARABIC LETTER NOON */ { XK_Arabic_ha, 0x0647 }, /* ARABIC LETTER HEH */ { XK_Arabic_waw, 0x0648 }, /* ARABIC LETTER WAW */ { XK_Arabic_alefmaksura, 0x0649 }, /* ARABIC LETTER ALEF MAKSURA */ { XK_Arabic_yeh, 0x064a }, /* ARABIC LETTER YEH */ { XK_Arabic_fathatan, 0x064b }, /* ARABIC FATHATAN */ { XK_Arabic_dammatan, 0x064c }, /* ARABIC DAMMATAN */ { XK_Arabic_kasratan, 0x064d }, /* ARABIC KASRATAN */ { XK_Arabic_fatha, 0x064e }, /* ARABIC FATHA */ { XK_Arabic_damma, 0x064f }, /* ARABIC DAMMA */ { XK_Arabic_kasra, 0x0650 }, /* ARABIC KASRA */ { XK_Arabic_shadda, 0x0651 }, /* ARABIC SHADDA */ { XK_Arabic_sukun, 0x0652 }, /* ARABIC SUKUN */ { XK_Arabic_madda_above, 0x0653 }, /* ARABIC MADDA ABOVE */ { XK_Arabic_hamza_above, 0x0654 }, /* ARABIC HAMZA ABOVE */ { XK_Arabic_hamza_below, 0x0655 }, /* ARABIC HAMZA BELOW */ { XK_Arabic_jeh, 0x0698 }, /* ARABIC LETTER JEH */ { XK_Arabic_veh, 0x06a4 }, /* ARABIC LETTER VEH */ { XK_Arabic_keheh, 0x06a9 }, /* ARABIC LETTER KEHEH */ { XK_Arabic_gaf, 0x06af }, /* ARABIC LETTER GAF */ { XK_Arabic_noon_ghunna, 0x06ba }, /* ARABIC LETTER NOON GHUNNA */ { XK_Arabic_heh_doachashmee, 0x06be }, /* ARABIC LETTER HEH DOACHASHMEE */ { XK_Arabic_farsi_yeh, 0x06cc }, /* ARABIC LETTER FARSI YEH */ { XK_Arabic_yeh_baree, 0x06d2 }, /* ARABIC LETTER YEH BAREE */ { XK_Arabic_heh_goal, 0x06c1 }, /* ARABIC LETTER HEH GOAL */ #endif // defined(XK_Farsi_0) #if defined(XK_Serbian_dje) { XK_Serbian_dje, 0x0452 }, /* CYRILLIC SMALL LETTER DJE */ { XK_Macedonia_gje, 0x0453 }, /* CYRILLIC SMALL LETTER GJE */ { XK_Cyrillic_io, 0x0451 }, /* CYRILLIC SMALL LETTER IO */ { XK_Ukrainian_ie, 0x0454 }, /* CYRILLIC SMALL LETTER UKRAINIAN IE */ { XK_Macedonia_dse, 0x0455 }, /* CYRILLIC SMALL LETTER DZE */ { XK_Ukrainian_i, 0x0456 }, /* CYRILLIC SMALL LETTER BYELORUSSIAN-UKRAINIAN I */ { XK_Ukrainian_yi, 0x0457 }, /* CYRILLIC SMALL LETTER YI */ { XK_Cyrillic_je, 0x0458 }, /* CYRILLIC SMALL LETTER JE */ { XK_Cyrillic_lje, 0x0459 }, /* CYRILLIC SMALL LETTER LJE */ { XK_Cyrillic_nje, 0x045a }, /* CYRILLIC SMALL LETTER NJE */ { XK_Serbian_tshe, 0x045b }, /* CYRILLIC SMALL LETTER TSHE */ { XK_Macedonia_kje, 0x045c }, /* CYRILLIC SMALL LETTER KJE */ #if defined(XK_Ukrainian_ghe_with_upturn) { XK_Ukrainian_ghe_with_upturn, 0x0491 }, /* CYRILLIC SMALL LETTER GHE WITH UPTURN */ #endif { XK_Byelorussian_shortu, 0x045e }, /* CYRILLIC SMALL LETTER SHORT U */ { XK_Cyrillic_dzhe, 0x045f }, /* CYRILLIC SMALL LETTER DZHE */ { XK_numerosign, 0x2116 }, /* NUMERO SIGN */ { XK_Serbian_DJE, 0x0402 }, /* CYRILLIC CAPITAL LETTER DJE */ { XK_Macedonia_GJE, 0x0403 }, /* CYRILLIC CAPITAL LETTER GJE */ { XK_Cyrillic_IO, 0x0401 }, /* CYRILLIC CAPITAL LETTER IO */ { XK_Ukrainian_IE, 0x0404 }, /* CYRILLIC CAPITAL LETTER UKRAINIAN IE */ { XK_Macedonia_DSE, 0x0405 }, /* CYRILLIC CAPITAL LETTER DZE */ { XK_Ukrainian_I, 0x0406 }, /* CYRILLIC CAPITAL LETTER BYELORUSSIAN-UKRAINIAN I */ { XK_Ukrainian_YI, 0x0407 }, /* CYRILLIC CAPITAL LETTER YI */ { XK_Cyrillic_JE, 0x0408 }, /* CYRILLIC CAPITAL LETTER JE */ { XK_Cyrillic_LJE, 0x0409 }, /* CYRILLIC CAPITAL LETTER LJE */ { XK_Cyrillic_NJE, 0x040a }, /* CYRILLIC CAPITAL LETTER NJE */ { XK_Serbian_TSHE, 0x040b }, /* CYRILLIC CAPITAL LETTER TSHE */ { XK_Macedonia_KJE, 0x040c }, /* CYRILLIC CAPITAL LETTER KJE */ #if defined(XK_Ukrainian_GHE_WITH_UPTURN) { XK_Ukrainian_GHE_WITH_UPTURN, 0x0490 }, /* CYRILLIC CAPITAL LETTER GHE WITH UPTURN */ #endif { XK_Byelorussian_SHORTU, 0x040e }, /* CYRILLIC CAPITAL LETTER SHORT U */ { XK_Cyrillic_DZHE, 0x040f }, /* CYRILLIC CAPITAL LETTER DZHE */ { XK_Cyrillic_yu, 0x044e }, /* CYRILLIC SMALL LETTER YU */ { XK_Cyrillic_a, 0x0430 }, /* CYRILLIC SMALL LETTER A */ { XK_Cyrillic_be, 0x0431 }, /* CYRILLIC SMALL LETTER BE */ { XK_Cyrillic_tse, 0x0446 }, /* CYRILLIC SMALL LETTER TSE */ { XK_Cyrillic_de, 0x0434 }, /* CYRILLIC SMALL LETTER DE */ { XK_Cyrillic_ie, 0x0435 }, /* CYRILLIC SMALL LETTER IE */ { XK_Cyrillic_ef, 0x0444 }, /* CYRILLIC SMALL LETTER EF */ { XK_Cyrillic_ghe, 0x0433 }, /* CYRILLIC SMALL LETTER GHE */ { XK_Cyrillic_ha, 0x0445 }, /* CYRILLIC SMALL LETTER HA */ { XK_Cyrillic_i, 0x0438 }, /* CYRILLIC SMALL LETTER I */ { XK_Cyrillic_shorti, 0x0439 }, /* CYRILLIC SMALL LETTER SHORT I */ { XK_Cyrillic_ka, 0x043a }, /* CYRILLIC SMALL LETTER KA */ { XK_Cyrillic_el, 0x043b }, /* CYRILLIC SMALL LETTER EL */ { XK_Cyrillic_em, 0x043c }, /* CYRILLIC SMALL LETTER EM */ { XK_Cyrillic_en, 0x043d }, /* CYRILLIC SMALL LETTER EN */ { XK_Cyrillic_o, 0x043e }, /* CYRILLIC SMALL LETTER O */ { XK_Cyrillic_pe, 0x043f }, /* CYRILLIC SMALL LETTER PE */ { XK_Cyrillic_ya, 0x044f }, /* CYRILLIC SMALL LETTER YA */ { XK_Cyrillic_er, 0x0440 }, /* CYRILLIC SMALL LETTER ER */ { XK_Cyrillic_es, 0x0441 }, /* CYRILLIC SMALL LETTER ES */ { XK_Cyrillic_te, 0x0442 }, /* CYRILLIC SMALL LETTER TE */ { XK_Cyrillic_u, 0x0443 }, /* CYRILLIC SMALL LETTER U */ { XK_Cyrillic_zhe, 0x0436 }, /* CYRILLIC SMALL LETTER ZHE */ { XK_Cyrillic_ve, 0x0432 }, /* CYRILLIC SMALL LETTER VE */ { XK_Cyrillic_softsign, 0x044c }, /* CYRILLIC SMALL LETTER SOFT SIGN */ { XK_Cyrillic_yeru, 0x044b }, /* CYRILLIC SMALL LETTER YERU */ { XK_Cyrillic_ze, 0x0437 }, /* CYRILLIC SMALL LETTER ZE */ { XK_Cyrillic_sha, 0x0448 }, /* CYRILLIC SMALL LETTER SHA */ { XK_Cyrillic_e, 0x044d }, /* CYRILLIC SMALL LETTER E */ { XK_Cyrillic_shcha, 0x0449 }, /* CYRILLIC SMALL LETTER SHCHA */ { XK_Cyrillic_che, 0x0447 }, /* CYRILLIC SMALL LETTER CHE */ { XK_Cyrillic_hardsign, 0x044a }, /* CYRILLIC SMALL LETTER HARD SIGN */ { XK_Cyrillic_YU, 0x042e }, /* CYRILLIC CAPITAL LETTER YU */ { XK_Cyrillic_A, 0x0410 }, /* CYRILLIC CAPITAL LETTER A */ { XK_Cyrillic_BE, 0x0411 }, /* CYRILLIC CAPITAL LETTER BE */ { XK_Cyrillic_TSE, 0x0426 }, /* CYRILLIC CAPITAL LETTER TSE */ { XK_Cyrillic_DE, 0x0414 }, /* CYRILLIC CAPITAL LETTER DE */ { XK_Cyrillic_IE, 0x0415 }, /* CYRILLIC CAPITAL LETTER IE */ { XK_Cyrillic_EF, 0x0424 }, /* CYRILLIC CAPITAL LETTER EF */ { XK_Cyrillic_GHE, 0x0413 }, /* CYRILLIC CAPITAL LETTER GHE */ { XK_Cyrillic_HA, 0x0425 }, /* CYRILLIC CAPITAL LETTER HA */ { XK_Cyrillic_I, 0x0418 }, /* CYRILLIC CAPITAL LETTER I */ { XK_Cyrillic_SHORTI, 0x0419 }, /* CYRILLIC CAPITAL LETTER SHORT I */ { XK_Cyrillic_KA, 0x041a }, /* CYRILLIC CAPITAL LETTER KA */ { XK_Cyrillic_EL, 0x041b }, /* CYRILLIC CAPITAL LETTER EL */ { XK_Cyrillic_EM, 0x041c }, /* CYRILLIC CAPITAL LETTER EM */ { XK_Cyrillic_EN, 0x041d }, /* CYRILLIC CAPITAL LETTER EN */ { XK_Cyrillic_O, 0x041e }, /* CYRILLIC CAPITAL LETTER O */ { XK_Cyrillic_PE, 0x041f }, /* CYRILLIC CAPITAL LETTER PE */ { XK_Cyrillic_YA, 0x042f }, /* CYRILLIC CAPITAL LETTER YA */ { XK_Cyrillic_ER, 0x0420 }, /* CYRILLIC CAPITAL LETTER ER */ { XK_Cyrillic_ES, 0x0421 }, /* CYRILLIC CAPITAL LETTER ES */ { XK_Cyrillic_TE, 0x0422 }, /* CYRILLIC CAPITAL LETTER TE */ { XK_Cyrillic_U, 0x0423 }, /* CYRILLIC CAPITAL LETTER U */ { XK_Cyrillic_ZHE, 0x0416 }, /* CYRILLIC CAPITAL LETTER ZHE */ { XK_Cyrillic_VE, 0x0412 }, /* CYRILLIC CAPITAL LETTER VE */ { XK_Cyrillic_SOFTSIGN, 0x042c }, /* CYRILLIC CAPITAL LETTER SOFT SIGN */ { XK_Cyrillic_YERU, 0x042b }, /* CYRILLIC CAPITAL LETTER YERU */ { XK_Cyrillic_ZE, 0x0417 }, /* CYRILLIC CAPITAL LETTER ZE */ { XK_Cyrillic_SHA, 0x0428 }, /* CYRILLIC CAPITAL LETTER SHA */ { XK_Cyrillic_E, 0x042d }, /* CYRILLIC CAPITAL LETTER E */ { XK_Cyrillic_SHCHA, 0x0429 }, /* CYRILLIC CAPITAL LETTER SHCHA */ { XK_Cyrillic_CHE, 0x0427 }, /* CYRILLIC CAPITAL LETTER CHE */ { XK_Cyrillic_HARDSIGN, 0x042a }, /* CYRILLIC CAPITAL LETTER HARD SIGN */ #endif // defined(XK_Serbian_dje) #if defined(XK_Greek_ALPHAaccent) { XK_Greek_ALPHAaccent, 0x0386 }, /* GREEK CAPITAL LETTER ALPHA WITH TONOS */ { XK_Greek_EPSILONaccent, 0x0388 }, /* GREEK CAPITAL LETTER EPSILON WITH TONOS */ { XK_Greek_ETAaccent, 0x0389 }, /* GREEK CAPITAL LETTER ETA WITH TONOS */ { XK_Greek_IOTAaccent, 0x038a }, /* GREEK CAPITAL LETTER IOTA WITH TONOS */ { XK_Greek_IOTAdiaeresis, 0x03aa }, /* GREEK CAPITAL LETTER IOTA WITH DIALYTIKA */ { XK_Greek_OMICRONaccent, 0x038c }, /* GREEK CAPITAL LETTER OMICRON WITH TONOS */ { XK_Greek_UPSILONaccent, 0x038e }, /* GREEK CAPITAL LETTER UPSILON WITH TONOS */ { XK_Greek_UPSILONdieresis, 0x03ab }, /* GREEK CAPITAL LETTER UPSILON WITH DIALYTIKA */ { XK_Greek_OMEGAaccent, 0x038f }, /* GREEK CAPITAL LETTER OMEGA WITH TONOS */ { XK_Greek_accentdieresis, 0x0385 }, /* GREEK DIALYTIKA TONOS */ { XK_Greek_horizbar, 0x2015 }, /* HORIZONTAL BAR */ { XK_Greek_alphaaccent, 0x03ac }, /* GREEK SMALL LETTER ALPHA WITH TONOS */ { XK_Greek_epsilonaccent, 0x03ad }, /* GREEK SMALL LETTER EPSILON WITH TONOS */ { XK_Greek_etaaccent, 0x03ae }, /* GREEK SMALL LETTER ETA WITH TONOS */ { XK_Greek_iotaaccent, 0x03af }, /* GREEK SMALL LETTER IOTA WITH TONOS */ { XK_Greek_iotadieresis, 0x03ca }, /* GREEK SMALL LETTER IOTA WITH DIALYTIKA */ { XK_Greek_iotaaccentdieresis, 0x0390 }, /* GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS */ { XK_Greek_omicronaccent, 0x03cc }, /* GREEK SMALL LETTER OMICRON WITH TONOS */ { XK_Greek_upsilonaccent, 0x03cd }, /* GREEK SMALL LETTER UPSILON WITH TONOS */ { XK_Greek_upsilondieresis, 0x03cb }, /* GREEK SMALL LETTER UPSILON WITH DIALYTIKA */ { XK_Greek_upsilonaccentdieresis, 0x03b0 }, /* GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS */ { XK_Greek_omegaaccent, 0x03ce }, /* GREEK SMALL LETTER OMEGA WITH TONOS */ { XK_Greek_ALPHA, 0x0391 }, /* GREEK CAPITAL LETTER ALPHA */ { XK_Greek_BETA, 0x0392 }, /* GREEK CAPITAL LETTER BETA */ { XK_Greek_GAMMA, 0x0393 }, /* GREEK CAPITAL LETTER GAMMA */ { XK_Greek_DELTA, 0x0394 }, /* GREEK CAPITAL LETTER DELTA */ { XK_Greek_EPSILON, 0x0395 }, /* GREEK CAPITAL LETTER EPSILON */ { XK_Greek_ZETA, 0x0396 }, /* GREEK CAPITAL LETTER ZETA */ { XK_Greek_ETA, 0x0397 }, /* GREEK CAPITAL LETTER ETA */ { XK_Greek_THETA, 0x0398 }, /* GREEK CAPITAL LETTER THETA */ { XK_Greek_IOTA, 0x0399 }, /* GREEK CAPITAL LETTER IOTA */ { XK_Greek_KAPPA, 0x039a }, /* GREEK CAPITAL LETTER KAPPA */ { XK_Greek_LAMBDA, 0x039b }, /* GREEK CAPITAL LETTER LAMDA */ { XK_Greek_MU, 0x039c }, /* GREEK CAPITAL LETTER MU */ { XK_Greek_NU, 0x039d }, /* GREEK CAPITAL LETTER NU */ { XK_Greek_XI, 0x039e }, /* GREEK CAPITAL LETTER XI */ { XK_Greek_OMICRON, 0x039f }, /* GREEK CAPITAL LETTER OMICRON */ { XK_Greek_PI, 0x03a0 }, /* GREEK CAPITAL LETTER PI */ { XK_Greek_RHO, 0x03a1 }, /* GREEK CAPITAL LETTER RHO */ { XK_Greek_SIGMA, 0x03a3 }, /* GREEK CAPITAL LETTER SIGMA */ { XK_Greek_TAU, 0x03a4 }, /* GREEK CAPITAL LETTER TAU */ { XK_Greek_UPSILON, 0x03a5 }, /* GREEK CAPITAL LETTER UPSILON */ { XK_Greek_PHI, 0x03a6 }, /* GREEK CAPITAL LETTER PHI */ { XK_Greek_CHI, 0x03a7 }, /* GREEK CAPITAL LETTER CHI */ { XK_Greek_PSI, 0x03a8 }, /* GREEK CAPITAL LETTER PSI */ { XK_Greek_OMEGA, 0x03a9 }, /* GREEK CAPITAL LETTER OMEGA */ { XK_Greek_alpha, 0x03b1 }, /* GREEK SMALL LETTER ALPHA */ { XK_Greek_beta, 0x03b2 }, /* GREEK SMALL LETTER BETA */ { XK_Greek_gamma, 0x03b3 }, /* GREEK SMALL LETTER GAMMA */ { XK_Greek_delta, 0x03b4 }, /* GREEK SMALL LETTER DELTA */ { XK_Greek_epsilon, 0x03b5 }, /* GREEK SMALL LETTER EPSILON */ { XK_Greek_zeta, 0x03b6 }, /* GREEK SMALL LETTER ZETA */ { XK_Greek_eta, 0x03b7 }, /* GREEK SMALL LETTER ETA */ { XK_Greek_theta, 0x03b8 }, /* GREEK SMALL LETTER THETA */ { XK_Greek_iota, 0x03b9 }, /* GREEK SMALL LETTER IOTA */ { XK_Greek_kappa, 0x03ba }, /* GREEK SMALL LETTER KAPPA */ { XK_Greek_lambda, 0x03bb }, /* GREEK SMALL LETTER LAMDA */ { XK_Greek_mu, 0x03bc }, /* GREEK SMALL LETTER MU */ { XK_Greek_nu, 0x03bd }, /* GREEK SMALL LETTER NU */ { XK_Greek_xi, 0x03be }, /* GREEK SMALL LETTER XI */ { XK_Greek_omicron, 0x03bf }, /* GREEK SMALL LETTER OMICRON */ { XK_Greek_pi, 0x03c0 }, /* GREEK SMALL LETTER PI */ { XK_Greek_rho, 0x03c1 }, /* GREEK SMALL LETTER RHO */ { XK_Greek_sigma, 0x03c3 }, /* GREEK SMALL LETTER SIGMA */ { XK_Greek_finalsmallsigma, 0x03c2 }, /* GREEK SMALL LETTER FINAL SIGMA */ { XK_Greek_tau, 0x03c4 }, /* GREEK SMALL LETTER TAU */ { XK_Greek_upsilon, 0x03c5 }, /* GREEK SMALL LETTER UPSILON */ { XK_Greek_phi, 0x03c6 }, /* GREEK SMALL LETTER PHI */ { XK_Greek_chi, 0x03c7 }, /* GREEK SMALL LETTER CHI */ { XK_Greek_psi, 0x03c8 }, /* GREEK SMALL LETTER PSI */ { XK_Greek_omega, 0x03c9 }, /* GREEK SMALL LETTER OMEGA */ #endif // defined(XK_Greek_ALPHAaccent) { XK_leftradical, 0x23b7 }, /* ??? */ { XK_topleftradical, 0x250c }, /* BOX DRAWINGS LIGHT DOWN AND RIGHT */ { XK_horizconnector, 0x2500 }, /* BOX DRAWINGS LIGHT HORIZONTAL */ { XK_topintegral, 0x2320 }, /* TOP HALF INTEGRAL */ { XK_botintegral, 0x2321 }, /* BOTTOM HALF INTEGRAL */ { XK_vertconnector, 0x2502 }, /* BOX DRAWINGS LIGHT VERTICAL */ { XK_topleftsqbracket, 0x23a1 }, /* ??? */ { XK_botleftsqbracket, 0x23a3 }, /* ??? */ { XK_toprightsqbracket, 0x23a4 }, /* ??? */ { XK_botrightsqbracket, 0x23a6 }, /* ??? */ { XK_topleftparens, 0x239b }, /* ??? */ { XK_botleftparens, 0x239d }, /* ??? */ { XK_toprightparens, 0x239e }, /* ??? */ { XK_botrightparens, 0x23a0 }, /* ??? */ { XK_leftmiddlecurlybrace, 0x23a8 }, /* ??? */ { XK_rightmiddlecurlybrace, 0x23ac }, /* ??? */ { XK_lessthanequal, 0x2264 }, /* LESS-THAN OR EQUAL TO */ { XK_notequal, 0x2260 }, /* NOT EQUAL TO */ { XK_greaterthanequal, 0x2265 }, /* GREATER-THAN OR EQUAL TO */ { XK_integral, 0x222b }, /* INTEGRAL */ { XK_therefore, 0x2234 }, /* THEREFORE */ { XK_variation, 0x221d }, /* PROPORTIONAL TO */ { XK_infinity, 0x221e }, /* INFINITY */ { XK_nabla, 0x2207 }, /* NABLA */ { XK_approximate, 0x223c }, /* TILDE OPERATOR */ { XK_similarequal, 0x2243 }, /* ASYMPTOTICALLY EQUAL TO */ { XK_ifonlyif, 0x21d4 }, /* LEFT RIGHT DOUBLE ARROW */ { XK_implies, 0x21d2 }, /* RIGHTWARDS DOUBLE ARROW */ { XK_identical, 0x2261 }, /* IDENTICAL TO */ { XK_radical, 0x221a }, /* SQUARE ROOT */ { XK_includedin, 0x2282 }, /* SUBSET OF */ { XK_includes, 0x2283 }, /* SUPERSET OF */ { XK_intersection, 0x2229 }, /* INTERSECTION */ { XK_union, 0x222a }, /* UNION */ { XK_logicaland, 0x2227 }, /* LOGICAL AND */ { XK_logicalor, 0x2228 }, /* LOGICAL OR */ { XK_partialderivative, 0x2202 }, /* PARTIAL DIFFERENTIAL */ { XK_function, 0x0192 }, /* LATIN SMALL LETTER F WITH HOOK */ { XK_leftarrow, 0x2190 }, /* LEFTWARDS ARROW */ { XK_uparrow, 0x2191 }, /* UPWARDS ARROW */ { XK_rightarrow, 0x2192 }, /* RIGHTWARDS ARROW */ { XK_downarrow, 0x2193 }, /* DOWNWARDS ARROW */ /*{ XK_blank, ??? }, */ { XK_soliddiamond, 0x25c6 }, /* BLACK DIAMOND */ { XK_checkerboard, 0x2592 }, /* MEDIUM SHADE */ { XK_ht, 0x2409 }, /* SYMBOL FOR HORIZONTAL TABULATION */ { XK_ff, 0x240c }, /* SYMBOL FOR FORM FEED */ { XK_cr, 0x240d }, /* SYMBOL FOR CARRIAGE RETURN */ { XK_lf, 0x240a }, /* SYMBOL FOR LINE FEED */ { XK_nl, 0x2424 }, /* SYMBOL FOR NEWLINE */ { XK_vt, 0x240b }, /* SYMBOL FOR VERTICAL TABULATION */ { XK_lowrightcorner, 0x2518 }, /* BOX DRAWINGS LIGHT UP AND LEFT */ { XK_uprightcorner, 0x2510 }, /* BOX DRAWINGS LIGHT DOWN AND LEFT */ { XK_upleftcorner, 0x250c }, /* BOX DRAWINGS LIGHT DOWN AND RIGHT */ { XK_lowleftcorner, 0x2514 }, /* BOX DRAWINGS LIGHT UP AND RIGHT */ { XK_crossinglines, 0x253c }, /* BOX DRAWINGS LIGHT VERTICAL AND HORIZONTAL */ { XK_horizlinescan1, 0x23ba }, /* HORIZONTAL SCAN LINE-1 (Unicode 3.2 draft) */ { XK_horizlinescan3, 0x23bb }, /* HORIZONTAL SCAN LINE-3 (Unicode 3.2 draft) */ { XK_horizlinescan5, 0x2500 }, /* BOX DRAWINGS LIGHT HORIZONTAL */ { XK_horizlinescan7, 0x23bc }, /* HORIZONTAL SCAN LINE-7 (Unicode 3.2 draft) */ { XK_horizlinescan9, 0x23bd }, /* HORIZONTAL SCAN LINE-9 (Unicode 3.2 draft) */ { XK_leftt, 0x251c }, /* BOX DRAWINGS LIGHT VERTICAL AND RIGHT */ { XK_rightt, 0x2524 }, /* BOX DRAWINGS LIGHT VERTICAL AND LEFT */ { XK_bott, 0x2534 }, /* BOX DRAWINGS LIGHT UP AND HORIZONTAL */ { XK_topt, 0x252c }, /* BOX DRAWINGS LIGHT DOWN AND HORIZONTAL */ { XK_vertbar, 0x2502 }, /* BOX DRAWINGS LIGHT VERTICAL */ { XK_emspace, 0x2003 }, /* EM SPACE */ { XK_enspace, 0x2002 }, /* EN SPACE */ { XK_em3space, 0x2004 }, /* THREE-PER-EM SPACE */ { XK_em4space, 0x2005 }, /* FOUR-PER-EM SPACE */ { XK_digitspace, 0x2007 }, /* FIGURE SPACE */ { XK_punctspace, 0x2008 }, /* PUNCTUATION SPACE */ { XK_thinspace, 0x2009 }, /* THIN SPACE */ { XK_hairspace, 0x200a }, /* HAIR SPACE */ { XK_emdash, 0x2014 }, /* EM DASH */ { XK_endash, 0x2013 }, /* EN DASH */ /*{ XK_signifblank, ??? }, */ { XK_ellipsis, 0x2026 }, /* HORIZONTAL ELLIPSIS */ { XK_doubbaselinedot, 0x2025 }, /* TWO DOT LEADER */ { XK_onethird, 0x2153 }, /* VULGAR FRACTION ONE THIRD */ { XK_twothirds, 0x2154 }, /* VULGAR FRACTION TWO THIRDS */ { XK_onefifth, 0x2155 }, /* VULGAR FRACTION ONE FIFTH */ { XK_twofifths, 0x2156 }, /* VULGAR FRACTION TWO FIFTHS */ { XK_threefifths, 0x2157 }, /* VULGAR FRACTION THREE FIFTHS */ { XK_fourfifths, 0x2158 }, /* VULGAR FRACTION FOUR FIFTHS */ { XK_onesixth, 0x2159 }, /* VULGAR FRACTION ONE SIXTH */ { XK_fivesixths, 0x215a }, /* VULGAR FRACTION FIVE SIXTHS */ { XK_careof, 0x2105 }, /* CARE OF */ { XK_figdash, 0x2012 }, /* FIGURE DASH */ { XK_leftanglebracket, 0x2329 }, /* LEFT-POINTING ANGLE BRACKET */ /*{ XK_decimalpoint, ??? }, */ { XK_rightanglebracket, 0x232a }, /* RIGHT-POINTING ANGLE BRACKET */ /*{ XK_marker, ??? }, */ { XK_oneeighth, 0x215b }, /* VULGAR FRACTION ONE EIGHTH */ { XK_threeeighths, 0x215c }, /* VULGAR FRACTION THREE EIGHTHS */ { XK_fiveeighths, 0x215d }, /* VULGAR FRACTION FIVE EIGHTHS */ { XK_seveneighths, 0x215e }, /* VULGAR FRACTION SEVEN EIGHTHS */ { XK_trademark, 0x2122 }, /* TRADE MARK SIGN */ { XK_signaturemark, 0x2613 }, /* SALTIRE */ /*{ XK_trademarkincircle, ??? }, */ { XK_leftopentriangle, 0x25c1 }, /* WHITE LEFT-POINTING TRIANGLE */ { XK_rightopentriangle, 0x25b7 }, /* WHITE RIGHT-POINTING TRIANGLE */ { XK_emopencircle, 0x25cb }, /* WHITE CIRCLE */ { XK_emopenrectangle, 0x25af }, /* WHITE VERTICAL RECTANGLE */ { XK_leftsinglequotemark, 0x2018 }, /* LEFT SINGLE QUOTATION MARK */ { XK_rightsinglequotemark, 0x2019 }, /* RIGHT SINGLE QUOTATION MARK */ { XK_leftdoublequotemark, 0x201c }, /* LEFT DOUBLE QUOTATION MARK */ { XK_rightdoublequotemark, 0x201d }, /* RIGHT DOUBLE QUOTATION MARK */ { XK_prescription, 0x211e }, /* PRESCRIPTION TAKE */ { XK_minutes, 0x2032 }, /* PRIME */ { XK_seconds, 0x2033 }, /* DOUBLE PRIME */ { XK_latincross, 0x271d }, /* LATIN CROSS */ /*{ XK_hexagram, ??? }, */ { XK_filledrectbullet, 0x25ac }, /* BLACK RECTANGLE */ { XK_filledlefttribullet, 0x25c0 }, /* BLACK LEFT-POINTING TRIANGLE */ { XK_filledrighttribullet, 0x25b6 }, /* BLACK RIGHT-POINTING TRIANGLE */ { XK_emfilledcircle, 0x25cf }, /* BLACK CIRCLE */ { XK_emfilledrect, 0x25ae }, /* BLACK VERTICAL RECTANGLE */ { XK_enopencircbullet, 0x25e6 }, /* WHITE BULLET */ { XK_enopensquarebullet, 0x25ab }, /* WHITE SMALL SQUARE */ { XK_openrectbullet, 0x25ad }, /* WHITE RECTANGLE */ { XK_opentribulletup, 0x25b3 }, /* WHITE UP-POINTING TRIANGLE */ { XK_opentribulletdown, 0x25bd }, /* WHITE DOWN-POINTING TRIANGLE */ { XK_openstar, 0x2606 }, /* WHITE STAR */ { XK_enfilledcircbullet, 0x2022 }, /* BULLET */ { XK_enfilledsqbullet, 0x25aa }, /* BLACK SMALL SQUARE */ { XK_filledtribulletup, 0x25b2 }, /* BLACK UP-POINTING TRIANGLE */ { XK_filledtribulletdown, 0x25bc }, /* BLACK DOWN-POINTING TRIANGLE */ { XK_leftpointer, 0x261c }, /* WHITE LEFT POINTING INDEX */ { XK_rightpointer, 0x261e }, /* WHITE RIGHT POINTING INDEX */ { XK_club, 0x2663 }, /* BLACK CLUB SUIT */ { XK_diamond, 0x2666 }, /* BLACK DIAMOND SUIT */ { XK_heart, 0x2665 }, /* BLACK HEART SUIT */ { XK_maltesecross, 0x2720 }, /* MALTESE CROSS */ { XK_dagger, 0x2020 }, /* DAGGER */ { XK_doubledagger, 0x2021 }, /* DOUBLE DAGGER */ { XK_checkmark, 0x2713 }, /* CHECK MARK */ { XK_ballotcross, 0x2717 }, /* BALLOT X */ { XK_musicalsharp, 0x266f }, /* MUSIC SHARP SIGN */ { XK_musicalflat, 0x266d }, /* MUSIC FLAT SIGN */ { XK_malesymbol, 0x2642 }, /* MALE SIGN */ { XK_femalesymbol, 0x2640 }, /* FEMALE SIGN */ { XK_telephone, 0x260e }, /* BLACK TELEPHONE */ { XK_telephonerecorder, 0x2315 }, /* TELEPHONE RECORDER */ { XK_phonographcopyright, 0x2117 }, /* SOUND RECORDING COPYRIGHT */ { XK_caret, 0x2038 }, /* CARET */ { XK_singlelowquotemark, 0x201a }, /* SINGLE LOW-9 QUOTATION MARK */ { XK_doublelowquotemark, 0x201e }, /* DOUBLE LOW-9 QUOTATION MARK */ /*{ XK_cursor, ??? }, */ { XK_leftcaret, 0x003c }, /* LESS-THAN SIGN */ { XK_rightcaret, 0x003e }, /* GREATER-THAN SIGN */ { XK_downcaret, 0x2228 }, /* LOGICAL OR */ { XK_upcaret, 0x2227 }, /* LOGICAL AND */ { XK_overbar, 0x00af }, /* MACRON */ { XK_downtack, 0x22a5 }, /* UP TACK */ { XK_upshoe, 0x2229 }, /* INTERSECTION */ { XK_downstile, 0x230a }, /* LEFT FLOOR */ { XK_underbar, 0x005f }, /* LOW LINE */ { XK_jot, 0x2218 }, /* RING OPERATOR */ { XK_quad, 0x2395 }, /* APL FUNCTIONAL SYMBOL QUAD */ { XK_uptack, 0x22a4 }, /* DOWN TACK */ { XK_circle, 0x25cb }, /* WHITE CIRCLE */ { XK_upstile, 0x2308 }, /* LEFT CEILING */ { XK_downshoe, 0x222a }, /* UNION */ { XK_rightshoe, 0x2283 }, /* SUPERSET OF */ { XK_leftshoe, 0x2282 }, /* SUBSET OF */ { XK_lefttack, 0x22a2 }, /* RIGHT TACK */ { XK_righttack, 0x22a3 }, /* LEFT TACK */ #if defined(XK_hebrew_doublelowline) { XK_hebrew_doublelowline, 0x2017 }, /* DOUBLE LOW LINE */ { XK_hebrew_aleph, 0x05d0 }, /* HEBREW LETTER ALEF */ { XK_hebrew_bet, 0x05d1 }, /* HEBREW LETTER BET */ { XK_hebrew_gimel, 0x05d2 }, /* HEBREW LETTER GIMEL */ { XK_hebrew_dalet, 0x05d3 }, /* HEBREW LETTER DALET */ { XK_hebrew_he, 0x05d4 }, /* HEBREW LETTER HE */ { XK_hebrew_waw, 0x05d5 }, /* HEBREW LETTER VAV */ { XK_hebrew_zain, 0x05d6 }, /* HEBREW LETTER ZAYIN */ { XK_hebrew_chet, 0x05d7 }, /* HEBREW LETTER HET */ { XK_hebrew_tet, 0x05d8 }, /* HEBREW LETTER TET */ { XK_hebrew_yod, 0x05d9 }, /* HEBREW LETTER YOD */ { XK_hebrew_finalkaph, 0x05da }, /* HEBREW LETTER FINAL KAF */ { XK_hebrew_kaph, 0x05db }, /* HEBREW LETTER KAF */ { XK_hebrew_lamed, 0x05dc }, /* HEBREW LETTER LAMED */ { XK_hebrew_finalmem, 0x05dd }, /* HEBREW LETTER FINAL MEM */ { XK_hebrew_mem, 0x05de }, /* HEBREW LETTER MEM */ { XK_hebrew_finalnun, 0x05df }, /* HEBREW LETTER FINAL NUN */ { XK_hebrew_nun, 0x05e0 }, /* HEBREW LETTER NUN */ { XK_hebrew_samech, 0x05e1 }, /* HEBREW LETTER SAMEKH */ { XK_hebrew_ayin, 0x05e2 }, /* HEBREW LETTER AYIN */ { XK_hebrew_finalpe, 0x05e3 }, /* HEBREW LETTER FINAL PE */ { XK_hebrew_pe, 0x05e4 }, /* HEBREW LETTER PE */ { XK_hebrew_finalzade, 0x05e5 }, /* HEBREW LETTER FINAL TSADI */ { XK_hebrew_zade, 0x05e6 }, /* HEBREW LETTER TSADI */ { XK_hebrew_qoph, 0x05e7 }, /* HEBREW LETTER QOF */ { XK_hebrew_resh, 0x05e8 }, /* HEBREW LETTER RESH */ { XK_hebrew_shin, 0x05e9 }, /* HEBREW LETTER SHIN */ { XK_hebrew_taw, 0x05ea }, /* HEBREW LETTER TAV */ #endif // defined(XK_hebrew_doublelowline) #if defined(XK_Thai_kokai) { XK_Thai_kokai, 0x0e01 }, /* THAI CHARACTER KO KAI */ { XK_Thai_khokhai, 0x0e02 }, /* THAI CHARACTER KHO KHAI */ { XK_Thai_khokhuat, 0x0e03 }, /* THAI CHARACTER KHO KHUAT */ { XK_Thai_khokhwai, 0x0e04 }, /* THAI CHARACTER KHO KHWAI */ { XK_Thai_khokhon, 0x0e05 }, /* THAI CHARACTER KHO KHON */ { XK_Thai_khorakhang, 0x0e06 }, /* THAI CHARACTER KHO RAKHANG */ { XK_Thai_ngongu, 0x0e07 }, /* THAI CHARACTER NGO NGU */ { XK_Thai_chochan, 0x0e08 }, /* THAI CHARACTER CHO CHAN */ { XK_Thai_choching, 0x0e09 }, /* THAI CHARACTER CHO CHING */ { XK_Thai_chochang, 0x0e0a }, /* THAI CHARACTER CHO CHANG */ { XK_Thai_soso, 0x0e0b }, /* THAI CHARACTER SO SO */ { XK_Thai_chochoe, 0x0e0c }, /* THAI CHARACTER CHO CHOE */ { XK_Thai_yoying, 0x0e0d }, /* THAI CHARACTER YO YING */ { XK_Thai_dochada, 0x0e0e }, /* THAI CHARACTER DO CHADA */ { XK_Thai_topatak, 0x0e0f }, /* THAI CHARACTER TO PATAK */ { XK_Thai_thothan, 0x0e10 }, /* THAI CHARACTER THO THAN */ { XK_Thai_thonangmontho, 0x0e11 }, /* THAI CHARACTER THO NANGMONTHO */ { XK_Thai_thophuthao, 0x0e12 }, /* THAI CHARACTER THO PHUTHAO */ { XK_Thai_nonen, 0x0e13 }, /* THAI CHARACTER NO NEN */ { XK_Thai_dodek, 0x0e14 }, /* THAI CHARACTER DO DEK */ { XK_Thai_totao, 0x0e15 }, /* THAI CHARACTER TO TAO */ { XK_Thai_thothung, 0x0e16 }, /* THAI CHARACTER THO THUNG */ { XK_Thai_thothahan, 0x0e17 }, /* THAI CHARACTER THO THAHAN */ { XK_Thai_thothong, 0x0e18 }, /* THAI CHARACTER THO THONG */ { XK_Thai_nonu, 0x0e19 }, /* THAI CHARACTER NO NU */ { XK_Thai_bobaimai, 0x0e1a }, /* THAI CHARACTER BO BAIMAI */ { XK_Thai_popla, 0x0e1b }, /* THAI CHARACTER PO PLA */ { XK_Thai_phophung, 0x0e1c }, /* THAI CHARACTER PHO PHUNG */ { XK_Thai_fofa, 0x0e1d }, /* THAI CHARACTER FO FA */ { XK_Thai_phophan, 0x0e1e }, /* THAI CHARACTER PHO PHAN */ { XK_Thai_fofan, 0x0e1f }, /* THAI CHARACTER FO FAN */ { XK_Thai_phosamphao, 0x0e20 }, /* THAI CHARACTER PHO SAMPHAO */ { XK_Thai_moma, 0x0e21 }, /* THAI CHARACTER MO MA */ { XK_Thai_yoyak, 0x0e22 }, /* THAI CHARACTER YO YAK */ { XK_Thai_rorua, 0x0e23 }, /* THAI CHARACTER RO RUA */ { XK_Thai_ru, 0x0e24 }, /* THAI CHARACTER RU */ { XK_Thai_loling, 0x0e25 }, /* THAI CHARACTER LO LING */ { XK_Thai_lu, 0x0e26 }, /* THAI CHARACTER LU */ { XK_Thai_wowaen, 0x0e27 }, /* THAI CHARACTER WO WAEN */ { XK_Thai_sosala, 0x0e28 }, /* THAI CHARACTER SO SALA */ { XK_Thai_sorusi, 0x0e29 }, /* THAI CHARACTER SO RUSI */ { XK_Thai_sosua, 0x0e2a }, /* THAI CHARACTER SO SUA */ { XK_Thai_hohip, 0x0e2b }, /* THAI CHARACTER HO HIP */ { XK_Thai_lochula, 0x0e2c }, /* THAI CHARACTER LO CHULA */ { XK_Thai_oang, 0x0e2d }, /* THAI CHARACTER O ANG */ { XK_Thai_honokhuk, 0x0e2e }, /* THAI CHARACTER HO NOKHUK */ { XK_Thai_paiyannoi, 0x0e2f }, /* THAI CHARACTER PAIYANNOI */ { XK_Thai_saraa, 0x0e30 }, /* THAI CHARACTER SARA A */ { XK_Thai_maihanakat, 0x0e31 }, /* THAI CHARACTER MAI HAN-AKAT */ { XK_Thai_saraaa, 0x0e32 }, /* THAI CHARACTER SARA AA */ { XK_Thai_saraam, 0x0e33 }, /* THAI CHARACTER SARA AM */ { XK_Thai_sarai, 0x0e34 }, /* THAI CHARACTER SARA I */ { XK_Thai_saraii, 0x0e35 }, /* THAI CHARACTER SARA II */ { XK_Thai_saraue, 0x0e36 }, /* THAI CHARACTER SARA UE */ { XK_Thai_sarauee, 0x0e37 }, /* THAI CHARACTER SARA UEE */ { XK_Thai_sarau, 0x0e38 }, /* THAI CHARACTER SARA U */ { XK_Thai_sarauu, 0x0e39 }, /* THAI CHARACTER SARA UU */ { XK_Thai_phinthu, 0x0e3a }, /* THAI CHARACTER PHINTHU */ /*{ XK_Thai_maihanakat_maitho, ??? }, */ { XK_Thai_baht, 0x0e3f }, /* THAI CURRENCY SYMBOL BAHT */ { XK_Thai_sarae, 0x0e40 }, /* THAI CHARACTER SARA E */ { XK_Thai_saraae, 0x0e41 }, /* THAI CHARACTER SARA AE */ { XK_Thai_sarao, 0x0e42 }, /* THAI CHARACTER SARA O */ { XK_Thai_saraaimaimuan, 0x0e43 }, /* THAI CHARACTER SARA AI MAIMUAN */ { XK_Thai_saraaimaimalai, 0x0e44 }, /* THAI CHARACTER SARA AI MAIMALAI */ { XK_Thai_lakkhangyao, 0x0e45 }, /* THAI CHARACTER LAKKHANGYAO */ { XK_Thai_maiyamok, 0x0e46 }, /* THAI CHARACTER MAIYAMOK */ { XK_Thai_maitaikhu, 0x0e47 }, /* THAI CHARACTER MAITAIKHU */ { XK_Thai_maiek, 0x0e48 }, /* THAI CHARACTER MAI EK */ { XK_Thai_maitho, 0x0e49 }, /* THAI CHARACTER MAI THO */ { XK_Thai_maitri, 0x0e4a }, /* THAI CHARACTER MAI TRI */ { XK_Thai_maichattawa, 0x0e4b }, /* THAI CHARACTER MAI CHATTAWA */ { XK_Thai_thanthakhat, 0x0e4c }, /* THAI CHARACTER THANTHAKHAT */ { XK_Thai_nikhahit, 0x0e4d }, /* THAI CHARACTER NIKHAHIT */ { XK_Thai_leksun, 0x0e50 }, /* THAI DIGIT ZERO */ { XK_Thai_leknung, 0x0e51 }, /* THAI DIGIT ONE */ { XK_Thai_leksong, 0x0e52 }, /* THAI DIGIT TWO */ { XK_Thai_leksam, 0x0e53 }, /* THAI DIGIT THREE */ { XK_Thai_leksi, 0x0e54 }, /* THAI DIGIT FOUR */ { XK_Thai_lekha, 0x0e55 }, /* THAI DIGIT FIVE */ { XK_Thai_lekhok, 0x0e56 }, /* THAI DIGIT SIX */ { XK_Thai_lekchet, 0x0e57 }, /* THAI DIGIT SEVEN */ { XK_Thai_lekpaet, 0x0e58 }, /* THAI DIGIT EIGHT */ { XK_Thai_lekkao, 0x0e59 }, /* THAI DIGIT NINE */ #endif // defined(XK_Thai_kokai) #if defined(XK_Hangul_Kiyeog) { XK_Hangul_Kiyeog, 0x3131 }, /* HANGUL LETTER KIYEOK */ { XK_Hangul_SsangKiyeog, 0x3132 }, /* HANGUL LETTER SSANGKIYEOK */ { XK_Hangul_KiyeogSios, 0x3133 }, /* HANGUL LETTER KIYEOK-SIOS */ { XK_Hangul_Nieun, 0x3134 }, /* HANGUL LETTER NIEUN */ { XK_Hangul_NieunJieuj, 0x3135 }, /* HANGUL LETTER NIEUN-CIEUC */ { XK_Hangul_NieunHieuh, 0x3136 }, /* HANGUL LETTER NIEUN-HIEUH */ { XK_Hangul_Dikeud, 0x3137 }, /* HANGUL LETTER TIKEUT */ { XK_Hangul_SsangDikeud, 0x3138 }, /* HANGUL LETTER SSANGTIKEUT */ { XK_Hangul_Rieul, 0x3139 }, /* HANGUL LETTER RIEUL */ { XK_Hangul_RieulKiyeog, 0x313a }, /* HANGUL LETTER RIEUL-KIYEOK */ { XK_Hangul_RieulMieum, 0x313b }, /* HANGUL LETTER RIEUL-MIEUM */ { XK_Hangul_RieulPieub, 0x313c }, /* HANGUL LETTER RIEUL-PIEUP */ { XK_Hangul_RieulSios, 0x313d }, /* HANGUL LETTER RIEUL-SIOS */ { XK_Hangul_RieulTieut, 0x313e }, /* HANGUL LETTER RIEUL-THIEUTH */ { XK_Hangul_RieulPhieuf, 0x313f }, /* HANGUL LETTER RIEUL-PHIEUPH */ { XK_Hangul_RieulHieuh, 0x3140 }, /* HANGUL LETTER RIEUL-HIEUH */ { XK_Hangul_Mieum, 0x3141 }, /* HANGUL LETTER MIEUM */ { XK_Hangul_Pieub, 0x3142 }, /* HANGUL LETTER PIEUP */ { XK_Hangul_SsangPieub, 0x3143 }, /* HANGUL LETTER SSANGPIEUP */ { XK_Hangul_PieubSios, 0x3144 }, /* HANGUL LETTER PIEUP-SIOS */ { XK_Hangul_Sios, 0x3145 }, /* HANGUL LETTER SIOS */ { XK_Hangul_SsangSios, 0x3146 }, /* HANGUL LETTER SSANGSIOS */ { XK_Hangul_Ieung, 0x3147 }, /* HANGUL LETTER IEUNG */ { XK_Hangul_Jieuj, 0x3148 }, /* HANGUL LETTER CIEUC */ { XK_Hangul_SsangJieuj, 0x3149 }, /* HANGUL LETTER SSANGCIEUC */ { XK_Hangul_Cieuc, 0x314a }, /* HANGUL LETTER CHIEUCH */ { XK_Hangul_Khieuq, 0x314b }, /* HANGUL LETTER KHIEUKH */ { XK_Hangul_Tieut, 0x314c }, /* HANGUL LETTER THIEUTH */ { XK_Hangul_Phieuf, 0x314d }, /* HANGUL LETTER PHIEUPH */ { XK_Hangul_Hieuh, 0x314e }, /* HANGUL LETTER HIEUH */ { XK_Hangul_A, 0x314f }, /* HANGUL LETTER A */ { XK_Hangul_AE, 0x3150 }, /* HANGUL LETTER AE */ { XK_Hangul_YA, 0x3151 }, /* HANGUL LETTER YA */ { XK_Hangul_YAE, 0x3152 }, /* HANGUL LETTER YAE */ { XK_Hangul_EO, 0x3153 }, /* HANGUL LETTER EO */ { XK_Hangul_E, 0x3154 }, /* HANGUL LETTER E */ { XK_Hangul_YEO, 0x3155 }, /* HANGUL LETTER YEO */ { XK_Hangul_YE, 0x3156 }, /* HANGUL LETTER YE */ { XK_Hangul_O, 0x3157 }, /* HANGUL LETTER O */ { XK_Hangul_WA, 0x3158 }, /* HANGUL LETTER WA */ { XK_Hangul_WAE, 0x3159 }, /* HANGUL LETTER WAE */ { XK_Hangul_OE, 0x315a }, /* HANGUL LETTER OE */ { XK_Hangul_YO, 0x315b }, /* HANGUL LETTER YO */ { XK_Hangul_U, 0x315c }, /* HANGUL LETTER U */ { XK_Hangul_WEO, 0x315d }, /* HANGUL LETTER WEO */ { XK_Hangul_WE, 0x315e }, /* HANGUL LETTER WE */ { XK_Hangul_WI, 0x315f }, /* HANGUL LETTER WI */ { XK_Hangul_YU, 0x3160 }, /* HANGUL LETTER YU */ { XK_Hangul_EU, 0x3161 }, /* HANGUL LETTER EU */ { XK_Hangul_YI, 0x3162 }, /* HANGUL LETTER YI */ { XK_Hangul_I, 0x3163 }, /* HANGUL LETTER I */ { XK_Hangul_J_Kiyeog, 0x11a8 }, /* HANGUL JONGSEONG KIYEOK */ { XK_Hangul_J_SsangKiyeog, 0x11a9 }, /* HANGUL JONGSEONG SSANGKIYEOK */ { XK_Hangul_J_KiyeogSios, 0x11aa }, /* HANGUL JONGSEONG KIYEOK-SIOS */ { XK_Hangul_J_Nieun, 0x11ab }, /* HANGUL JONGSEONG NIEUN */ { XK_Hangul_J_NieunJieuj, 0x11ac }, /* HANGUL JONGSEONG NIEUN-CIEUC */ { XK_Hangul_J_NieunHieuh, 0x11ad }, /* HANGUL JONGSEONG NIEUN-HIEUH */ { XK_Hangul_J_Dikeud, 0x11ae }, /* HANGUL JONGSEONG TIKEUT */ { XK_Hangul_J_Rieul, 0x11af }, /* HANGUL JONGSEONG RIEUL */ { XK_Hangul_J_RieulKiyeog, 0x11b0 }, /* HANGUL JONGSEONG RIEUL-KIYEOK */ { XK_Hangul_J_RieulMieum, 0x11b1 }, /* HANGUL JONGSEONG RIEUL-MIEUM */ { XK_Hangul_J_RieulPieub, 0x11b2 }, /* HANGUL JONGSEONG RIEUL-PIEUP */ { XK_Hangul_J_RieulSios, 0x11b3 }, /* HANGUL JONGSEONG RIEUL-SIOS */ { XK_Hangul_J_RieulTieut, 0x11b4 }, /* HANGUL JONGSEONG RIEUL-THIEUTH */ { XK_Hangul_J_RieulPhieuf, 0x11b5 }, /* HANGUL JONGSEONG RIEUL-PHIEUPH */ { XK_Hangul_J_RieulHieuh, 0x11b6 }, /* HANGUL JONGSEONG RIEUL-HIEUH */ { XK_Hangul_J_Mieum, 0x11b7 }, /* HANGUL JONGSEONG MIEUM */ { XK_Hangul_J_Pieub, 0x11b8 }, /* HANGUL JONGSEONG PIEUP */ { XK_Hangul_J_PieubSios, 0x11b9 }, /* HANGUL JONGSEONG PIEUP-SIOS */ { XK_Hangul_J_Sios, 0x11ba }, /* HANGUL JONGSEONG SIOS */ { XK_Hangul_J_SsangSios, 0x11bb }, /* HANGUL JONGSEONG SSANGSIOS */ { XK_Hangul_J_Ieung, 0x11bc }, /* HANGUL JONGSEONG IEUNG */ { XK_Hangul_J_Jieuj, 0x11bd }, /* HANGUL JONGSEONG CIEUC */ { XK_Hangul_J_Cieuc, 0x11be }, /* HANGUL JONGSEONG CHIEUCH */ { XK_Hangul_J_Khieuq, 0x11bf }, /* HANGUL JONGSEONG KHIEUKH */ { XK_Hangul_J_Tieut, 0x11c0 }, /* HANGUL JONGSEONG THIEUTH */ { XK_Hangul_J_Phieuf, 0x11c1 }, /* HANGUL JONGSEONG PHIEUPH */ { XK_Hangul_J_Hieuh, 0x11c2 }, /* HANGUL JONGSEONG HIEUH */ { XK_Hangul_RieulYeorinHieuh, 0x316d }, /* HANGUL LETTER RIEUL-YEORINHIEUH */ { XK_Hangul_SunkyeongeumMieum, 0x3171 }, /* HANGUL LETTER KAPYEOUNMIEUM */ { XK_Hangul_SunkyeongeumPieub, 0x3178 }, /* HANGUL LETTER KAPYEOUNPIEUP */ { XK_Hangul_PanSios, 0x317f }, /* HANGUL LETTER PANSIOS */ { XK_Hangul_KkogjiDalrinIeung, 0x3181 }, /* HANGUL LETTER YESIEUNG */ { XK_Hangul_SunkyeongeumPhieuf, 0x3184 }, /* HANGUL LETTER KAPYEOUNPHIEUPH */ { XK_Hangul_YeorinHieuh, 0x3186 }, /* HANGUL LETTER YEORINHIEUH */ { XK_Hangul_AraeA, 0x318d }, /* HANGUL LETTER ARAEA */ { XK_Hangul_AraeAE, 0x318e }, /* HANGUL LETTER ARAEAE */ { XK_Hangul_J_PanSios, 0x11eb }, /* HANGUL JONGSEONG PANSIOS */ { XK_Hangul_J_KkogjiDalrinIeung, 0x11f0 }, /* HANGUL JONGSEONG YESIEUNG */ { XK_Hangul_J_YeorinHieuh, 0x11f9 }, /* HANGUL JONGSEONG YEORINHIEUH */ { XK_Korean_Won, 0x20a9 }, /* WON SIGN */ #endif // defined(XK_Hangul_Kiyeog) { XK_OE, 0x0152 }, /* LATIN CAPITAL LIGATURE OE */ { XK_oe, 0x0153 }, /* LATIN SMALL LIGATURE OE */ { XK_Ydiaeresis, 0x0178 }, /* LATIN CAPITAL LETTER Y WITH DIAERESIS */ { XK_EuroSign, 0x20ac }, /* EURO SIGN */ /* combining dead keys */ { XK_dead_abovedot, 0x0307 }, /* COMBINING DOT ABOVE */ { XK_dead_abovering, 0x030a }, /* COMBINING RING ABOVE */ { XK_dead_acute, 0x0301 }, /* COMBINING ACUTE ACCENT */ { XK_dead_breve, 0x0306 }, /* COMBINING BREVE */ { XK_dead_caron, 0x030c }, /* COMBINING CARON */ { XK_dead_cedilla, 0x0327 }, /* COMBINING CEDILLA */ { XK_dead_circumflex, 0x0302 }, /* COMBINING CIRCUMFLEX ACCENT */ { XK_dead_diaeresis, 0x0308 }, /* COMBINING DIAERESIS */ { XK_dead_doubleacute, 0x030b }, /* COMBINING DOUBLE ACUTE ACCENT */ { XK_dead_grave, 0x0300 }, /* COMBINING GRAVE ACCENT */ { XK_dead_macron, 0x0304 }, /* COMBINING MACRON */ { XK_dead_ogonek, 0x0328 }, /* COMBINING OGONEK */ { XK_dead_tilde, 0x0303 } /* COMBINING TILDE */ }; /* XXX -- map these too XK_Cyrillic_GHE_bar XK_Cyrillic_ZHE_descender XK_Cyrillic_KA_descender XK_Cyrillic_KA_vertstroke XK_Cyrillic_EN_descender XK_Cyrillic_U_straight XK_Cyrillic_U_straight_bar XK_Cyrillic_HA_descender XK_Cyrillic_CHE_descender XK_Cyrillic_CHE_vertstroke XK_Cyrillic_SHHA XK_Cyrillic_SCHWA XK_Cyrillic_I_macron XK_Cyrillic_O_bar XK_Cyrillic_U_macron XK_Cyrillic_ghe_bar XK_Cyrillic_zhe_descender XK_Cyrillic_ka_descender XK_Cyrillic_ka_vertstroke XK_Cyrillic_en_descender XK_Cyrillic_u_straight XK_Cyrillic_u_straight_bar XK_Cyrillic_ha_descender XK_Cyrillic_che_descender XK_Cyrillic_che_vertstroke XK_Cyrillic_shha XK_Cyrillic_schwa XK_Cyrillic_i_macron XK_Cyrillic_o_bar XK_Cyrillic_u_macron XK_Armenian_eternity XK_Armenian_ligature_ew XK_Armenian_full_stop XK_Armenian_verjaket XK_Armenian_parenright XK_Armenian_parenleft XK_Armenian_guillemotright XK_Armenian_guillemotleft XK_Armenian_em_dash XK_Armenian_dot XK_Armenian_mijaket XK_Armenian_but XK_Armenian_separation_mark XK_Armenian_comma XK_Armenian_en_dash XK_Armenian_hyphen XK_Armenian_yentamna XK_Armenian_ellipsis XK_Armenian_amanak XK_Armenian_exclam XK_Armenian_accent XK_Armenian_shesht XK_Armenian_paruyk XK_Armenian_question XK_Armenian_AYB XK_Armenian_ayb XK_Armenian_BEN XK_Armenian_ben XK_Armenian_GIM XK_Armenian_gim XK_Armenian_DA XK_Armenian_da XK_Armenian_YECH XK_Armenian_yech XK_Armenian_ZA XK_Armenian_za XK_Armenian_E XK_Armenian_e XK_Armenian_AT XK_Armenian_at XK_Armenian_TO XK_Armenian_to XK_Armenian_ZHE XK_Armenian_zhe XK_Armenian_INI XK_Armenian_ini XK_Armenian_LYUN XK_Armenian_lyun XK_Armenian_KHE XK_Armenian_khe XK_Armenian_TSA XK_Armenian_tsa XK_Armenian_KEN XK_Armenian_ken XK_Armenian_HO XK_Armenian_ho XK_Armenian_DZA XK_Armenian_dza XK_Armenian_GHAT XK_Armenian_ghat XK_Armenian_TCHE XK_Armenian_tche XK_Armenian_MEN XK_Armenian_men XK_Armenian_HI XK_Armenian_hi XK_Armenian_NU XK_Armenian_nu XK_Armenian_SHA XK_Armenian_sha XK_Armenian_VO XK_Armenian_vo XK_Armenian_CHA XK_Armenian_cha XK_Armenian_PE XK_Armenian_pe XK_Armenian_JE XK_Armenian_je XK_Armenian_RA XK_Armenian_ra XK_Armenian_SE XK_Armenian_se XK_Armenian_VEV XK_Armenian_vev XK_Armenian_TYUN XK_Armenian_tyun XK_Armenian_RE XK_Armenian_re XK_Armenian_TSO XK_Armenian_tso XK_Armenian_VYUN XK_Armenian_vyun XK_Armenian_PYUR XK_Armenian_pyur XK_Armenian_KE XK_Armenian_ke XK_Armenian_O XK_Armenian_o XK_Armenian_FE XK_Armenian_fe XK_Armenian_apostrophe XK_Armenian_section_sign XK_Georgian_an XK_Georgian_ban XK_Georgian_gan XK_Georgian_don XK_Georgian_en XK_Georgian_vin XK_Georgian_zen XK_Georgian_tan XK_Georgian_in XK_Georgian_kan XK_Georgian_las XK_Georgian_man XK_Georgian_nar XK_Georgian_on XK_Georgian_par XK_Georgian_zhar XK_Georgian_rae XK_Georgian_san XK_Georgian_tar XK_Georgian_un XK_Georgian_phar XK_Georgian_khar XK_Georgian_ghan XK_Georgian_qar XK_Georgian_shin XK_Georgian_chin XK_Georgian_can XK_Georgian_jil XK_Georgian_cil XK_Georgian_char XK_Georgian_xan XK_Georgian_jhan XK_Georgian_hae XK_Georgian_he XK_Georgian_hie XK_Georgian_we XK_Georgian_har XK_Georgian_hoe XK_Georgian_fi XK_Ccedillaabovedot XK_Xabovedot XK_Qabovedot XK_Ibreve XK_IE XK_UO XK_Zstroke XK_Gcaron XK_Obarred XK_ccedillaabovedot XK_xabovedot XK_Ocaron XK_qabovedot XK_ibreve XK_ie XK_uo XK_zstroke XK_gcaron XK_ocaron XK_obarred XK_SCHWA XK_Lbelowdot XK_Lstrokebelowdot XK_Gtilde XK_lbelowdot XK_lstrokebelowdot XK_gtilde XK_schwa XK_Abelowdot XK_abelowdot XK_Ahook XK_ahook XK_Acircumflexacute XK_acircumflexacute XK_Acircumflexgrave XK_acircumflexgrave XK_Acircumflexhook XK_acircumflexhook XK_Acircumflextilde XK_acircumflextilde XK_Acircumflexbelowdot XK_acircumflexbelowdot XK_Abreveacute XK_abreveacute XK_Abrevegrave XK_abrevegrave XK_Abrevehook XK_abrevehook XK_Abrevetilde XK_abrevetilde XK_Abrevebelowdot XK_abrevebelowdot XK_Ebelowdot XK_ebelowdot XK_Ehook XK_ehook XK_Etilde XK_etilde XK_Ecircumflexacute XK_ecircumflexacute XK_Ecircumflexgrave XK_ecircumflexgrave XK_Ecircumflexhook XK_ecircumflexhook XK_Ecircumflextilde XK_ecircumflextilde XK_Ecircumflexbelowdot XK_ecircumflexbelowdot XK_Ihook XK_ihook XK_Ibelowdot XK_ibelowdot XK_Obelowdot XK_obelowdot XK_Ohook XK_ohook XK_Ocircumflexacute XK_ocircumflexacute XK_Ocircumflexgrave XK_ocircumflexgrave XK_Ocircumflexhook XK_ocircumflexhook XK_Ocircumflextilde XK_ocircumflextilde XK_Ocircumflexbelowdot XK_ocircumflexbelowdot XK_Ohornacute XK_ohornacute XK_Ohorngrave XK_ohorngrave XK_Ohornhook XK_ohornhook XK_Ohorntilde XK_ohorntilde XK_Ohornbelowdot XK_ohornbelowdot XK_Ubelowdot XK_ubelowdot XK_Uhook XK_uhook XK_Uhornacute XK_uhornacute XK_Uhorngrave XK_uhorngrave XK_Uhornhook XK_uhornhook XK_Uhorntilde XK_uhorntilde XK_Uhornbelowdot XK_uhornbelowdot XK_Ybelowdot XK_ybelowdot XK_Yhook XK_yhook XK_Ytilde XK_ytilde XK_Ohorn XK_ohorn XK_Uhorn XK_uhorn */ // map "Internet" keys to KeyIDs static const KeySym s_map1008FF[] = { /* 0x00 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x08 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x10 */ 0, kKeyAudioDown, kKeyAudioMute, kKeyAudioUp, /* 0x14 */ kKeyAudioPlay, kKeyAudioStop, kKeyAudioPrev, kKeyAudioNext, /* 0x18 */ kKeyWWWHome, kKeyAppMail, 0, kKeyWWWSearch, 0, 0, 0, 0, /* 0x20 */ 0, 0, 0, 0, 0, 0, kKeyWWWBack, kKeyWWWForward, /* 0x28 */ kKeyWWWStop, kKeyWWWRefresh, 0, 0, kKeyEject, 0, 0, 0, /* 0x30 */ kKeyWWWFavorites, 0, kKeyAppMedia, 0, 0, 0, 0, 0, /* 0x38 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x40 */ kKeyAppUser1, kKeyAppUser2, 0, 0, 0, 0, 0, 0, /* 0x48 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x50 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x58 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x60 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x68 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x70 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x78 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x88 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0x98 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa8 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb8 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc8 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd8 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe8 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf0 */ 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf8 */ 0, 0, 0, 0, 0, 0, 0, 0 }; // // CXWindowsUtil // CXWindowsUtil::CKeySymMap CXWindowsUtil::s_keySymToUCS4; bool CXWindowsUtil::getWindowProperty(Display* display, Window window, Atom property, CString* data, Atom* type, SInt32* format, bool deleteProperty) { assert(display != NULL); Atom actualType; int actualDatumSize; // ignore errors. XGetWindowProperty() will report failure. CXWindowsUtil::CErrorLock lock(display); // read the property bool okay = true; const long length = XMaxRequestSize(display); long offset = 0; unsigned long bytesLeft = 1; while (bytesLeft != 0) { // get more data unsigned long numItems; unsigned char* rawData; if (XGetWindowProperty(display, window, property, offset, length, False, AnyPropertyType, &actualType, &actualDatumSize, &numItems, &bytesLeft, &rawData) != Success || actualType == None || actualDatumSize == 0) { // failed okay = false; break; } // compute bytes read and advance offset unsigned long numBytes; switch (actualDatumSize) { case 8: default: numBytes = numItems; offset += numItems / 4; break; case 16: numBytes = 2 * numItems; offset += numItems / 2; break; case 32: numBytes = 4 * numItems; offset += numItems; break; } // append data if (data != NULL) { data->append((char*)rawData, numBytes); } else { // data is not required so don't try to get any more bytesLeft = 0; } // done with returned data XFree(rawData); } // delete the property if requested if (deleteProperty) { XDeleteProperty(display, window, property); } // save property info if (type != NULL) { *type = actualType; } if (format != NULL) { *format = static_cast(actualDatumSize); } if (okay) { LOG((CLOG_DEBUG2 "read property %d on window 0x%08x: bytes=%d", property, window, (data == NULL) ? 0 : data->size())); return true; } else { LOG((CLOG_DEBUG2 "can't read property %d on window 0x%08x", property, window)); return false; } } bool CXWindowsUtil::setWindowProperty(Display* display, Window window, Atom property, const void* vdata, UInt32 size, Atom type, SInt32 format) { const UInt32 length = 4 * XMaxRequestSize(display); const unsigned char* data = reinterpret_cast(vdata); UInt32 datumSize = static_cast(format / 8); // format 32 on 64bit systems is 8 bytes not 4. if (format == 32) { datumSize = sizeof(Atom); } // save errors bool error = false; CXWindowsUtil::CErrorLock lock(display, &error); // how much data to send in first chunk? UInt32 chunkSize = size; if (chunkSize > length) { chunkSize = length; } // send first chunk XChangeProperty(display, window, property, type, format, PropModeReplace, data, chunkSize / datumSize); // append remaining chunks data += chunkSize; size -= chunkSize; while (!error && size > 0) { chunkSize = size; if (chunkSize > length) { chunkSize = length; } XChangeProperty(display, window, property, type, format, PropModeAppend, data, chunkSize / datumSize); data += chunkSize; size -= chunkSize; } return !error; } Time CXWindowsUtil::getCurrentTime(Display* display, Window window) { // select property events on window XWindowAttributes attr; XGetWindowAttributes(display, window, &attr); XSelectInput(display, window, attr.your_event_mask | PropertyChangeMask); // make a property name to receive dummy change Atom atom = XInternAtom(display, "TIMESTAMP", False); // do a zero-length append to get the current time unsigned char dummy; XChangeProperty(display, window, atom, XA_INTEGER, 8, PropModeAppend, &dummy, 0); // look for property notify events with the following CPropertyNotifyPredicateInfo filter; filter.m_window = window; filter.m_property = atom; // wait for reply XEvent xevent; XIfEvent(display, &xevent, &CXWindowsUtil::propertyNotifyPredicate, (XPointer)&filter); assert(xevent.type == PropertyNotify); assert(xevent.xproperty.window == window); assert(xevent.xproperty.atom == atom); // restore event mask XSelectInput(display, window, attr.your_event_mask); return xevent.xproperty.time; } KeyID CXWindowsUtil::mapKeySymToKeyID(KeySym k) { initKeyMaps(); switch (k & 0xffffff00) { case 0x0000: // Latin-1 return static_cast(k); case 0xfe00: // ISO 9995 Function and Modifier Keys switch (k) { case XK_ISO_Left_Tab: return kKeyLeftTab; case XK_ISO_Level3_Shift: return kKeyAltGr; #ifdef XK_ISO_Level5_Shift case XK_ISO_Level5_Shift: return XK_ISO_Level5_Shift; //FIXME: there is no "usual" key for this... #endif case XK_ISO_Next_Group: return kKeyNextGroup; case XK_ISO_Prev_Group: return kKeyPrevGroup; case XK_dead_grave: return kKeyDeadGrave; case XK_dead_acute: return kKeyDeadAcute; case XK_dead_circumflex: return kKeyDeadCircumflex; case XK_dead_tilde: return kKeyDeadTilde; case XK_dead_macron: return kKeyDeadMacron; case XK_dead_breve: return kKeyDeadBreve; case XK_dead_abovedot: return kKeyDeadAbovedot; case XK_dead_diaeresis: return kKeyDeadDiaeresis; case XK_dead_abovering: return kKeyDeadAbovering; case XK_dead_doubleacute: return kKeyDeadDoubleacute; case XK_dead_caron: return kKeyDeadCaron; case XK_dead_cedilla: return kKeyDeadCedilla; case XK_dead_ogonek: return kKeyDeadOgonek; default: return kKeyNone; } case 0xff00: // MISCELLANY return static_cast(k - 0xff00 + 0xef00); case 0x1008ff00: // "Internet" keys return s_map1008FF[k & 0xff]; default: { // lookup character in table CKeySymMap::const_iterator index = s_keySymToUCS4.find(k); if (index != s_keySymToUCS4.end()) { return static_cast(index->second); } // unknown character return kKeyNone; } } } UInt32 CXWindowsUtil::getModifierBitForKeySym(KeySym keysym) { switch (keysym) { case XK_Shift_L: case XK_Shift_R: return kKeyModifierBitShift; case XK_Control_L: case XK_Control_R: return kKeyModifierBitControl; case XK_Alt_L: case XK_Alt_R: return kKeyModifierBitAlt; case XK_Meta_L: case XK_Meta_R: return kKeyModifierBitMeta; case XK_Super_L: case XK_Super_R: case XK_Hyper_L: case XK_Hyper_R: return kKeyModifierBitSuper; case XK_Mode_switch: case XK_ISO_Level3_Shift: return kKeyModifierBitAltGr; #ifdef XK_ISO_Level5_Shift case XK_ISO_Level5_Shift: return kKeyModifierBitLevel5Lock; #endif case XK_Caps_Lock: return kKeyModifierBitCapsLock; case XK_Num_Lock: return kKeyModifierBitNumLock; case XK_Scroll_Lock: return kKeyModifierBitScrollLock; default: return kKeyModifierBitNone; } } CString CXWindowsUtil::atomToString(Display* display, Atom atom) { if (atom == 0) { return "None"; } bool error = false; CXWindowsUtil::CErrorLock lock(display, &error); char* name = XGetAtomName(display, atom); if (error) { return CStringUtil::print(" (%d)", (int)atom); } else { CString msg = CStringUtil::print("%s (%d)", name, (int)atom); XFree(name); return msg; } } CString CXWindowsUtil::atomsToString(Display* display, const Atom* atom, UInt32 num) { char** names = new char*[num]; bool error = false; CXWindowsUtil::CErrorLock lock(display, &error); XGetAtomNames(display, const_cast(atom), (int)num, names); CString msg; if (error) { for (UInt32 i = 0; i < num; ++i) { msg += CStringUtil::print(" (%d), ", (int)atom[i]); } } else { for (UInt32 i = 0; i < num; ++i) { msg += CStringUtil::print("%s (%d), ", names[i], (int)atom[i]); XFree(names[i]); } } delete[] names; if (msg.size() > 2) { msg.erase(msg.size() - 2); } return msg; } void CXWindowsUtil::convertAtomProperty(CString& data) { // as best i can tell, 64-bit systems don't pack Atoms into properties // as 32-bit numbers but rather as the 64-bit numbers they are. that // seems wrong but we have to cope. sometimes we'll get a list of // atoms that's 8*n+4 bytes long, missing the trailing 4 bytes which // should all be 0. since we're going to reference the Atoms as // 64-bit numbers we have to ensure the last number is a full 64 bits. if (sizeof(Atom) != 4 && ((data.size() / 4) & 1) != 0) { UInt32 zero = 0; data.append(reinterpret_cast(&zero), sizeof(zero)); } } void CXWindowsUtil::appendAtomData(CString& data, Atom atom) { data.append(reinterpret_cast(&atom), sizeof(Atom)); } void CXWindowsUtil::replaceAtomData(CString& data, UInt32 index, Atom atom) { data.replace(index * sizeof(Atom), sizeof(Atom), reinterpret_cast(&atom), sizeof(Atom)); } void CXWindowsUtil::appendTimeData(CString& data, Time time) { data.append(reinterpret_cast(&time), sizeof(Time)); } Bool CXWindowsUtil::propertyNotifyPredicate(Display*, XEvent* xevent, XPointer arg) { CPropertyNotifyPredicateInfo* filter = reinterpret_cast(arg); return (xevent->type == PropertyNotify && xevent->xproperty.window == filter->m_window && xevent->xproperty.atom == filter->m_property && xevent->xproperty.state == PropertyNewValue) ? True : False; } void CXWindowsUtil::initKeyMaps() { if (s_keySymToUCS4.empty()) { for (size_t i =0; i < sizeof(s_keymap) / sizeof(s_keymap[0]); ++i) { s_keySymToUCS4[s_keymap[i].keysym] = s_keymap[i].ucs4; } } } // // CXWindowsUtil::CErrorLock // CXWindowsUtil::CErrorLock* CXWindowsUtil::CErrorLock::s_top = NULL; CXWindowsUtil::CErrorLock::CErrorLock(Display* display) : m_display(display) { install(&CXWindowsUtil::CErrorLock::ignoreHandler, NULL); } CXWindowsUtil::CErrorLock::CErrorLock(Display* display, bool* flag) : m_display(display) { install(&CXWindowsUtil::CErrorLock::saveHandler, flag); } CXWindowsUtil::CErrorLock::CErrorLock(Display* display, ErrorHandler handler, void* data) : m_display(display) { install(handler, data); } CXWindowsUtil::CErrorLock::~CErrorLock() { // make sure everything finishes before uninstalling handler if (m_display != NULL) { XSync(m_display, False); } // restore old handler XSetErrorHandler(m_oldXHandler); s_top = m_next; } void CXWindowsUtil::CErrorLock::install(ErrorHandler handler, void* data) { // make sure everything finishes before installing handler if (m_display != NULL) { XSync(m_display, False); } // install handler m_handler = handler; m_userData = data; m_oldXHandler = XSetErrorHandler( &CXWindowsUtil::CErrorLock::internalHandler); m_next = s_top; s_top = this; } int CXWindowsUtil::CErrorLock::internalHandler(Display* display, XErrorEvent* event) { if (s_top != NULL && s_top->m_handler != NULL) { s_top->m_handler(display, event, s_top->m_userData); } return 0; } void CXWindowsUtil::CErrorLock::ignoreHandler(Display*, XErrorEvent* e, void*) { LOG((CLOG_DEBUG1 "ignoring X error: %d", e->error_code)); } void CXWindowsUtil::CErrorLock::saveHandler(Display*, XErrorEvent* e, void* flag) { LOG((CLOG_DEBUG1 "flagging X error: %d", e->error_code)); *reinterpret_cast(flag) = true; } synergy-1.4.12-Source/src/lib/platform/CXWindowsUtil.h0000600000175000017500000001155612021261364022571 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CXWINDOWSUTIL_H #define CXWINDOWSUTIL_H #include "CString.h" #include "BasicTypes.h" #include "stdmap.h" #include "stdvector.h" #if X_DISPLAY_MISSING # error X11 is required to build synergy #else # include #endif //! X11 utility functions class CXWindowsUtil { public: typedef std::vector KeySyms; //! Get property /*! Gets property \c property on \c window. \b Appends the data to \c *data if \c data is not NULL, saves the property type in \c *type if \c type is not NULL, and saves the property format in \c *format if \c format is not NULL. If \c deleteProperty is true then the property is deleted after being read. */ static bool getWindowProperty(Display*, Window window, Atom property, CString* data, Atom* type, SInt32* format, bool deleteProperty); //! Set property /*! Sets property \c property on \c window to \c size bytes of data from \c data. */ static bool setWindowProperty(Display*, Window window, Atom property, const void* data, UInt32 size, Atom type, SInt32 format); //! Get X server time /*! Returns the current X server time. */ static Time getCurrentTime(Display*, Window); //! Convert KeySym to KeyID /*! Converts a KeySym to the equivalent KeyID. Returns kKeyNone if the KeySym cannot be mapped. */ static UInt32 mapKeySymToKeyID(KeySym); //! Convert KeySym to corresponding KeyModifierMask /*! Converts a KeySym to the corresponding KeyModifierMask, or 0 if the KeySym is not a modifier. */ static UInt32 getModifierBitForKeySym(KeySym keysym); //! Convert Atom to its string /*! Converts \p atom to its string representation. */ static CString atomToString(Display*, Atom atom); //! Convert several Atoms to a string /*! Converts each atom in \p atoms to its string representation and concatenates the results. */ static CString atomsToString(Display* display, const Atom* atom, UInt32 num); //! Prepare a property of atoms for use /*! 64-bit systems may need to modify a property's data if it's a list of Atoms before using it. */ static void convertAtomProperty(CString& data); //! Append an Atom to property data /*! Converts \p atom to a 32-bit on-the-wire format and appends it to \p data. */ static void appendAtomData(CString& data, Atom atom); //! Replace an Atom in property data /*! Converts \p atom to a 32-bit on-the-wire format and replaces the atom at index \p index in \p data. */ static void replaceAtomData(CString& data, UInt32 index, Atom atom); //! Append an Time to property data /*! Converts \p time to a 32-bit on-the-wire format and appends it to \p data. */ static void appendTimeData(CString& data, Time time); //! X11 error handler /*! This class sets an X error handler in the c'tor and restores the previous error handler in the d'tor. A lock should only be installed while the display is locked by the thread. CErrorLock() ignores errors CErrorLock(bool* flag) sets *flag to true if any error occurs */ class CErrorLock { public: //! Error handler type typedef void (*ErrorHandler)(Display*, XErrorEvent*, void* userData); /*! Ignore X11 errors. */ CErrorLock(Display*); /*! Set \c *errorFlag if any error occurs. */ CErrorLock(Display*, bool* errorFlag); /*! Call \c handler on each error. */ CErrorLock(Display*, ErrorHandler handler, void* userData); ~CErrorLock(); private: void install(ErrorHandler, void*); static int internalHandler(Display*, XErrorEvent*); static void ignoreHandler(Display*, XErrorEvent*, void*); static void saveHandler(Display*, XErrorEvent*, void*); private: typedef int (*XErrorHandler)(Display*, XErrorEvent*); Display* m_display; ErrorHandler m_handler; void* m_userData; XErrorHandler m_oldXHandler; CErrorLock* m_next; static CErrorLock* s_top; }; private: class CPropertyNotifyPredicateInfo { public: Window m_window; Atom m_property; }; static Bool propertyNotifyPredicate(Display*, XEvent* xevent, XPointer arg); static void initKeyMaps(); private: typedef std::map CKeySymMap; static CKeySymMap s_keySymToUCS4; }; #endif synergy-1.4.12-Source/src/lib/platform/HookDLL.cpp0000600000175000017500000002642012021261364021631 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ /*-------------------------------------------------------------------------------------------------------- Original comment: APIHIJACK.CPP - Based on DelayLoadProfileDLL.CPP, by Matt Pietrek for MSJ February 2000. http://msdn.microsoft.com/library/periodic/period00/hood0200.htm Adapted by Wade Brainerd, wadeb@wadeb.com --------------------------------------------------------------------------------------------------------*/ #define WIN32_LEAN_AND_MEAN #include #include #include "HookDLL.h" #include std::stringstream _hookDllLogStream; #define LOG(s) \ _hookDllLogStream.str(""); \ _hookDllLogStream << "Synergy HookDLL: " << s << std::endl; \ OutputDebugString( _hookDllLogStream.str().c_str() ); //=========================================================================== // Called from the DLPD_IAT_STUB stubs. Increments "count" field of the stub void __cdecl DefaultHook( PVOID dummy ) { // asm only supported on 32-bit #ifdef _M_IX86 __asm pushad // Save all general purpose registers // Get return address, then subtract 5 (size of a CALL X instruction) // The result points at a DLPD_IAT_STUB // pointer math! &dummy-1 really subtracts sizeof(PVOID) PDWORD pRetAddr = (PDWORD)(&dummy - 1); DLPD_IAT_STUB * pDLPDStub = (DLPD_IAT_STUB *)(*pRetAddr - 5); pDLPDStub->count++; #if 0 // Remove the above conditional to get a cheezy API trace from // the loader process. It's slow! if ( !IMAGE_SNAP_BY_ORDINAL( pDLPDStub->pszNameOrOrdinal) ) { LOG( "Called hooked function: " ); LOG( (PSTR)pDLPDStub->pszNameOrOrdinal ); } #endif __asm popad // Restore all general purpose registers #endif } // This function must be __cdecl!!! void __cdecl DelayLoadProfileDLL_UpdateCount( PVOID dummy ); PIMAGE_IMPORT_DESCRIPTOR g_pFirstImportDesc; //=========================================================================== // Given an HMODULE, returns a pointer to the PE header PIMAGE_NT_HEADERS PEHeaderFromHModule(HMODULE hModule) { PIMAGE_NT_HEADERS pNTHeader = 0; __try { if ( PIMAGE_DOS_HEADER(hModule)->e_magic != IMAGE_DOS_SIGNATURE ) __leave; pNTHeader = PIMAGE_NT_HEADERS(PBYTE(hModule) + PIMAGE_DOS_HEADER(hModule)->e_lfanew); if ( pNTHeader->Signature != IMAGE_NT_SIGNATURE ) pNTHeader = 0; } __except( EXCEPTION_EXECUTE_HANDLER ) { } return pNTHeader; } //=========================================================================== // Builds stubs for and redirects the IAT for one DLL (pImportDesc) bool RedirectIAT( SDLLHook* DLLHook, PIMAGE_IMPORT_DESCRIPTOR pImportDesc, PVOID pBaseLoadAddr ) { PIMAGE_THUNK_DATA pIAT; // Ptr to import address table PIMAGE_THUNK_DATA pINT; // Ptr to import names table PIMAGE_THUNK_DATA pIteratingIAT; // Figure out which OS platform we're on OSVERSIONINFO osvi; osvi.dwOSVersionInfoSize = sizeof(osvi); GetVersionEx( &osvi ); // If no import names table, we can't redirect this, so bail if ( pImportDesc->OriginalFirstThunk == 0 ) { LOG( "no IAT available." ); return false; } pIAT = MakePtr( PIMAGE_THUNK_DATA, pBaseLoadAddr, pImportDesc->FirstThunk ); pINT = MakePtr( PIMAGE_THUNK_DATA, pBaseLoadAddr, pImportDesc->OriginalFirstThunk ); // Count how many entries there are in this IAT. Array is 0 terminated pIteratingIAT = pIAT; unsigned cFuncs = 0; while ( pIteratingIAT->u1.Function ) { cFuncs++; pIteratingIAT++; } if ( cFuncs == 0 ) // If no imported functions, we're done! { LOG( "no imported functions" ); return false; } // These next few lines ensure that we'll be able to modify the IAT, // which is often in a read-only section in the EXE. DWORD flOldProtect, flNewProtect, flDontCare; MEMORY_BASIC_INFORMATION mbi; // Get the current protection attributes VirtualQuery( pIAT, &mbi, sizeof(mbi) ); // remove ReadOnly and ExecuteRead attributes, add on ReadWrite flag flNewProtect = mbi.Protect; flNewProtect &= ~(PAGE_READONLY | PAGE_EXECUTE_READ); flNewProtect |= (PAGE_READWRITE); if ( !VirtualProtect( pIAT, sizeof(PVOID) * cFuncs, flNewProtect, &flOldProtect) ) { LOG( "could not remove ReadOnly and ExecuteRead attributes, or add ReadWrite flag" ); return false; } // If the Default hook is enabled, build an array of redirection stubs in the processes memory. DLPD_IAT_STUB * pStubs = 0; if ( DLLHook->UseDefault ) { // Allocate memory for the redirection stubs. Make one extra stub at the // end to be a sentinel pStubs = new DLPD_IAT_STUB[ cFuncs + 1]; if ( !pStubs ) { LOG( "could not allocate memory for redirection stubs" ); return false; } } // Scan through the IAT, completing the stubs and redirecting the IAT // entries to point to the stubs pIteratingIAT = pIAT; while ( pIteratingIAT->u1.Function ) { void* HookFn = 0; // Set to either the SFunctionHook or pStubs. if ( !IMAGE_SNAP_BY_ORDINAL( pINT->u1.Ordinal ) ) // import by name { PIMAGE_IMPORT_BY_NAME pImportName = MakePtr( PIMAGE_IMPORT_BY_NAME, pBaseLoadAddr, pINT->u1.AddressOfData ); LOG( "checking function with name: " << pImportName->Name ); // Iterate through the hook functions, searching for this import. SFunctionHook* FHook = DLLHook->Functions; while ( FHook->Name ) { if ( lstrcmpi( FHook->Name, (char*)pImportName->Name ) == 0 ) { // Save the old function in the SFunctionHook structure and get the new one. FHook->OrigFn = (void*)pIteratingIAT->u1.Function; HookFn = FHook->HookFn; LOG( "hooked function: " << pImportName->Name ); break; } FHook++; } // If the default function is enabled, store the name for the user. if ( DLLHook->UseDefault ) pStubs->pszNameOrOrdinal = (DWORD)&pImportName->Name; } else // added comparison for ordinal { LOG( "checking function at ordinal: " << pINT->u1.Ordinal ); SFunctionHook* FHook = DLLHook->Functions; while ( FHook->Name ) { if ( (DWORD)FHook->Name == pINT->u1.Ordinal ) { // Save the old function in the SFunctionHook structure and get the new one. FHook->OrigFn = (void*)pIteratingIAT->u1.Function; HookFn = FHook->HookFn; LOG( "hooked ordinal: " << pINT->u1.Ordinal ); break; } FHook++; } // If the default function is enabled, store the ordinal for the user. if ( DLLHook->UseDefault ) pStubs->pszNameOrOrdinal = (DWORD)pINT->u1.Ordinal; } // If the default function is enabled, fill in the fields to the stub code. if ( DLLHook->UseDefault ) { pStubs->data_call = (DWORD)(PDWORD)DLLHook->DefaultFn - (DWORD)(PDWORD)&pStubs->instr_JMP; pStubs->data_JMP = *(PDWORD)pIteratingIAT - (DWORD)(PDWORD)&pStubs->count; // If it wasn't manually hooked, use the Stub function. if ( !HookFn ) HookFn = (void*)pStubs; } // Replace the IAT function pointer if we have a hook. if ( HookFn ) { // Cheez-o hack to see if what we're importing is code or data. // If it's code, we shouldn't be able to write to it if ( IsBadWritePtr( (PVOID)pIteratingIAT->u1.Function, 1 ) ) { pIteratingIAT->u1.Function = (DWORD)(PDWORD)HookFn; } else if ( osvi.dwPlatformId == VER_PLATFORM_WIN32_WINDOWS ) { // Special hack for Win9X, which builds stubs for imported // functions in system DLLs (Loaded above 2GB). These stubs are // writeable, so we have to explicitly check for this case if ( pIteratingIAT->u1.Function > (DWORD)(PDWORD)0x80000000 ) pIteratingIAT->u1.Function = (DWORD)(PDWORD)HookFn; } } if ( DLLHook->UseDefault ) pStubs++; // Advance to next stub pIteratingIAT++; // Advance to next IAT entry pINT++; // Advance to next INT entry } if ( DLLHook->UseDefault ) pStubs->pszNameOrOrdinal = 0; // Final stub is a sentinel // Put the page attributes back the way they were. VirtualProtect( pIAT, sizeof(PVOID) * cFuncs, flOldProtect, &flDontCare); return true; } //=========================================================================== // Top level routine to find the EXE's imports, and redirect them bool HookAPICalls( SDLLHook* hook ) { if ( !hook ) { LOG("no hook"); return false; } HMODULE hModEXE = GetModuleHandle( 0 ); PIMAGE_NT_HEADERS pExeNTHdr = PEHeaderFromHModule( hModEXE ); if ( !pExeNTHdr ) { LOG("no PE header"); return false; } DWORD importRVA = pExeNTHdr->OptionalHeader.DataDirectory [IMAGE_DIRECTORY_ENTRY_IMPORT].VirtualAddress; if ( !importRVA ) { LOG("no virtual address for image directory entry import"); return false; } // Convert imports RVA to a usable pointer PIMAGE_IMPORT_DESCRIPTOR pImportDesc = MakePtr( PIMAGE_IMPORT_DESCRIPTOR, hModEXE, importRVA ); // Save off imports address in a global for later use g_pFirstImportDesc = pImportDesc; // Iterate through each import descriptor, and redirect if appropriate while ( pImportDesc->FirstThunk ) { PSTR pszImportModuleName = MakePtr( PSTR, hModEXE, pImportDesc->Name); if ( lstrcmpi( pszImportModuleName, hook->Name ) == 0 ) { LOG( "found " << hook->Name << " in process" ); if ( RedirectIAT( hook, pImportDesc, (PVOID)hModEXE ) ) { LOG( "redirected IAT ok" ); return true; } else { LOG( "failed to redirect IAT" ); } } pImportDesc++; // Advance to next import descriptor } return false; } synergy-1.4.12-Source/src/lib/platform/HookDLL.h0000600000175000017500000000546512021261364021304 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ /*-------------------------------------------------------------------------------------------------------- Original comment: APIHIJACK.H - Based on DelayLoadProfileDLL.CPP, by Matt Pietrek for MSJ February 2000. http://msdn.microsoft.com/library/periodic/period00/hood0200.htm Adapted by Wade Brainerd, wadeb@wadeb.com --------------------------------------------------------------------------------------------------------*/ #pragma once #define WIN32_LEAN_AND_MEAN #include #pragma warning(disable:4200) // Macro for convenient pointer addition. // Essentially treats the last two parameters as DWORDs. The first // parameter is used to typecast the result to the appropriate pointer type. #define MakePtr(cast, ptr, addValue ) (cast)( (DWORD)(ptr)+(DWORD)(addValue)) // Default Hook Stub Structure: Contains data about the original function, Name/Ordinal, Address // and a Count field. This is actually a block of assembly code. #pragma pack( push, 1 ) struct DLPD_IAT_STUB { BYTE instr_CALL; DWORD data_call; BYTE instr_JMP; DWORD data_JMP; DWORD count; DWORD pszNameOrOrdinal; DLPD_IAT_STUB() : instr_CALL( 0xE8 ), instr_JMP( 0xE9 ), count( 0 ) {} }; #pragma pack( pop ) // Example DefaultHook procedure, called from the DLPD_IAT_STUB stubs. // Increments "count" field of the stub. // See the implementation for more information. void __cdecl DefaultHook( PVOID dummy ); struct SFunctionHook { char* Name; // Function name, e.g. "DirectDrawCreateEx". void* HookFn; // Address of your function. void* OrigFn; // Stored by HookAPICalls, the address of the original function. }; struct SDLLHook { // Name of the DLL, e.g. "DDRAW.DLL" char* Name; // Set true to call the default for all non-hooked functions before they are executed. bool UseDefault; void* DefaultFn; // Function hook array. Terminated with a NULL Name field. SFunctionHook Functions[]; }; // Hook functions one or more DLLs. bool HookAPICalls( SDLLHook* hook ); synergy-1.4.12-Source/src/lib/platform/IMSWindowsClipboardFacade.h0000600000175000017500000000210012021261364024736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IMWINDOWSCLIPBOARDFACADE #define IMWINDOWSCLIPBOARDFACADE #include "IInterface.h" #define WIN32_LEAN_AND_MEAN #include class IMSWindowsClipboardConverter; class IMSWindowsClipboardFacade : public IInterface { public: virtual void write(HANDLE win32Data, UINT win32Format) = 0; virtual ~IMSWindowsClipboardFacade() { } }; #endifsynergy-1.4.12-Source/src/lib/platform/OSXScreenSaverControl.h0000600000175000017500000000301312021261364024206 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2009 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // ScreenSaver.framework private API // Class dumping by Alex Harper http://www.ragingmenace.com/ #import @protocol ScreenSaverControl - (double)screenSaverTimeRemaining; - (void)restartForUser:fp12; - (void)screenSaverStopNow; - (void)screenSaverStartNow; - (void)setScreenSaverCanRun:(char)fp12; - (BOOL)screenSaverCanRun; - (BOOL)screenSaverIsRunning; @end @interface ScreenSaverController:NSObject + controller; + monitor; + daemonConnectionName; + daemonPath; + enginePath; - init; - (void)dealloc; - (void)_connectionClosed:fp12; - (BOOL)screenSaverIsRunning; - (BOOL)screenSaverCanRun; - (void)setScreenSaverCanRun:(char)fp12; - (void)screenSaverStartNow; - (void)screenSaverStopNow; - (void)restartForUser:fp12; - (double)screenSaverTimeRemaining; @end synergy-1.4.12-Source/src/lib/platform/XInput13.h0000600000175000017500000001633512021261364021441 0ustar synergysynergy/*************************************************************************** * * * XInput.h -- This module defines XBOX controller APIs * * and constansts for the Windows platform. * * * * Copyright (C) 2012 Bolton Software Ltd. * Copyright (c) Microsoft Corp. All rights reserved. * * * ***************************************************************************/ #ifndef _XINPUT_H_ #define _XINPUT_H_ #include // Current name of the DLL shipped in the same SDK as this header. // The name reflects the current version #ifndef XINPUT_USE_9_1_0 #define XINPUT_DLL_A "xinput1_3.dll" #define XINPUT_DLL_W L"xinput1_3.dll" #else #define XINPUT_DLL_A "xinput9_1_0.dll" #define XINPUT_DLL_W L"xinput9_1_0.dll" #endif #ifdef UNICODE #define XINPUT_DLL XINPUT_DLL_W #else #define XINPUT_DLL XINPUT_DLL_A #endif // // Device types available in XINPUT_CAPABILITIES // #define XINPUT_DEVTYPE_GAMEPAD 0x01 // // Device subtypes available in XINPUT_CAPABILITIES // #define XINPUT_DEVSUBTYPE_GAMEPAD 0x01 #ifndef XINPUT_USE_9_1_0 #define XINPUT_DEVSUBTYPE_WHEEL 0x02 #define XINPUT_DEVSUBTYPE_ARCADE_STICK 0x03 #define XINPUT_DEVSUBTYPE_FLIGHT_SICK 0x04 #define XINPUT_DEVSUBTYPE_DANCE_PAD 0x05 #define XINPUT_DEVSUBTYPE_GUITAR 0x06 #define XINPUT_DEVSUBTYPE_DRUM_KIT 0x08 #endif // !XINPUT_USE_9_1_0 // // Flags for XINPUT_CAPABILITIES // #define XINPUT_CAPS_VOICE_SUPPORTED 0x0004 // // Constants for gamepad buttons // #define XINPUT_GAMEPAD_DPAD_UP 0x0001 #define XINPUT_GAMEPAD_DPAD_DOWN 0x0002 #define XINPUT_GAMEPAD_DPAD_LEFT 0x0004 #define XINPUT_GAMEPAD_DPAD_RIGHT 0x0008 #define XINPUT_GAMEPAD_START 0x0010 #define XINPUT_GAMEPAD_BACK 0x0020 #define XINPUT_GAMEPAD_LEFT_THUMB 0x0040 #define XINPUT_GAMEPAD_RIGHT_THUMB 0x0080 #define XINPUT_GAMEPAD_LEFT_SHOULDER 0x0100 #define XINPUT_GAMEPAD_RIGHT_SHOULDER 0x0200 #define XINPUT_GAMEPAD_A 0x1000 #define XINPUT_GAMEPAD_B 0x2000 #define XINPUT_GAMEPAD_X 0x4000 #define XINPUT_GAMEPAD_Y 0x8000 // // Gamepad thresholds // #define XINPUT_GAMEPAD_LEFT_THUMB_DEADZONE 7849 #define XINPUT_GAMEPAD_RIGHT_THUMB_DEADZONE 8689 #define XINPUT_GAMEPAD_TRIGGER_THRESHOLD 30 // // Flags to pass to XInputGetCapabilities // #define XINPUT_FLAG_GAMEPAD 0x00000001 #ifndef XINPUT_USE_9_1_0 // // Devices that support batteries // #define BATTERY_DEVTYPE_GAMEPAD 0x00 #define BATTERY_DEVTYPE_HEADSET 0x01 // // Flags for battery status level // #define BATTERY_TYPE_DISCONNECTED 0x00 // This device is not connected #define BATTERY_TYPE_WIRED 0x01 // Wired device, no battery #define BATTERY_TYPE_ALKALINE 0x02 // Alkaline battery source #define BATTERY_TYPE_NIMH 0x03 // Nickel Metal Hydride battery source #define BATTERY_TYPE_UNKNOWN 0xFF // Cannot determine the battery type // These are only valid for wireless, connected devices, with known battery types // The amount of use time remaining depends on the type of device. #define BATTERY_LEVEL_EMPTY 0x00 #define BATTERY_LEVEL_LOW 0x01 #define BATTERY_LEVEL_MEDIUM 0x02 #define BATTERY_LEVEL_FULL 0x03 // User index definitions #define XUSER_MAX_COUNT 4 #define XUSER_INDEX_ANY 0x000000FF // // Codes returned for the gamepad keystroke // #define VK_PAD_A 0x5800 #define VK_PAD_B 0x5801 #define VK_PAD_X 0x5802 #define VK_PAD_Y 0x5803 #define VK_PAD_RSHOULDER 0x5804 #define VK_PAD_LSHOULDER 0x5805 #define VK_PAD_LTRIGGER 0x5806 #define VK_PAD_RTRIGGER 0x5807 #define VK_PAD_DPAD_UP 0x5810 #define VK_PAD_DPAD_DOWN 0x5811 #define VK_PAD_DPAD_LEFT 0x5812 #define VK_PAD_DPAD_RIGHT 0x5813 #define VK_PAD_START 0x5814 #define VK_PAD_BACK 0x5815 #define VK_PAD_LTHUMB_PRESS 0x5816 #define VK_PAD_RTHUMB_PRESS 0x5817 #define VK_PAD_LTHUMB_UP 0x5820 #define VK_PAD_LTHUMB_DOWN 0x5821 #define VK_PAD_LTHUMB_RIGHT 0x5822 #define VK_PAD_LTHUMB_LEFT 0x5823 #define VK_PAD_LTHUMB_UPLEFT 0x5824 #define VK_PAD_LTHUMB_UPRIGHT 0x5825 #define VK_PAD_LTHUMB_DOWNRIGHT 0x5826 #define VK_PAD_LTHUMB_DOWNLEFT 0x5827 #define VK_PAD_RTHUMB_UP 0x5830 #define VK_PAD_RTHUMB_DOWN 0x5831 #define VK_PAD_RTHUMB_RIGHT 0x5832 #define VK_PAD_RTHUMB_LEFT 0x5833 #define VK_PAD_RTHUMB_UPLEFT 0x5834 #define VK_PAD_RTHUMB_UPRIGHT 0x5835 #define VK_PAD_RTHUMB_DOWNRIGHT 0x5836 #define VK_PAD_RTHUMB_DOWNLEFT 0x5837 // // Flags used in XINPUT_KEYSTROKE // #define XINPUT_KEYSTROKE_KEYDOWN 0x0001 #define XINPUT_KEYSTROKE_KEYUP 0x0002 #define XINPUT_KEYSTROKE_REPEAT 0x0004 #endif //!XINPUT_USE_9_1_0 // // Structures used by XInput APIs // typedef struct _XINPUT_GAMEPAD { WORD wButtons; BYTE bLeftTrigger; BYTE bRightTrigger; SHORT sThumbLX; SHORT sThumbLY; SHORT sThumbRX; SHORT sThumbRY; } XINPUT_GAMEPAD, *PXINPUT_GAMEPAD; typedef struct _XINPUT_STATE { DWORD dwPacketNumber; XINPUT_GAMEPAD Gamepad; } XINPUT_STATE, *PXINPUT_STATE; typedef struct _XINPUT_VIBRATION { WORD wLeftMotorSpeed; WORD wRightMotorSpeed; } XINPUT_VIBRATION, *PXINPUT_VIBRATION; typedef struct _XINPUT_CAPABILITIES { BYTE Type; BYTE SubType; WORD Flags; XINPUT_GAMEPAD Gamepad; XINPUT_VIBRATION Vibration; } XINPUT_CAPABILITIES, *PXINPUT_CAPABILITIES; #ifndef XINPUT_USE_9_1_0 typedef struct _XINPUT_BATTERY_INFORMATION { BYTE BatteryType; BYTE BatteryLevel; } XINPUT_BATTERY_INFORMATION, *PXINPUT_BATTERY_INFORMATION; typedef struct _XINPUT_KEYSTROKE { WORD VirtualKey; WCHAR Unicode; WORD Flags; BYTE UserIndex; BYTE HidCode; } XINPUT_KEYSTROKE, *PXINPUT_KEYSTROKE; #endif // !XINPUT_USE_9_1_0 // // XInput APIs // // now defined in proxy class. #endif //_XINPUT_H_ synergy-1.4.12-Source/src/lib/platform/XInputHook.cpp0000600000175000017500000001564712021261364022456 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define WIN32_LEAN_AND_MEAN #define SYNERGY_EXPORT_XINPUT_HOOKS #define REQUIRED_XINPUT_DLL "xinput1_3.dll" #define HOOK_TIMEOUT 10000 // 10 sec #include #include #include "XInputHook.h" #include "HookDLL.h" #include HINSTANCE dll; char name[256]; #pragma data_seg(".SHARED") HHOOK s_hook = NULL; // @todo use a struct for multiple gamepad support WORD s_buttons = 0; SHORT s_leftStickX = 0; SHORT s_leftStickY = 0; SHORT s_rightStickX = 0; SHORT s_rightStickY = 0; BYTE s_leftTrigger = 0; BYTE s_rightTrigger = 0; BOOL s_timingReqQueued = FALSE; BOOL s_timingRespQueued = FALSE; DWORD s_lastFakeMillis = 0; WORD s_fakeFreqMillis = 0; DWORD s_packetNumber = 0; WORD s_leftMotor = 0; WORD s_rightMotor = 0; BOOL s_feedbackQueued = FALSE; #pragma data_seg() #pragma comment(linker, "/SECTION:.SHARED,RWS") #include std::stringstream _xInputHookLogStream; #define LOG(s) \ _xInputHookLogStream.str(""); \ _xInputHookLogStream << "Synergy XInputHook: " << s << endl; \ OutputDebugString( _xInputHookLogStream.str().c_str()) using namespace std; SDLLHook s_xInputHook = { XINPUT_DLL, false, NULL, { { (char*)(0x80000002), HookXInputGetState }, { (char*)(0x80000003), HookXInputSetState }, { (char*)(0x80000004), HookXInputGetCapabilities }, } }; BOOL APIENTRY DllMain(HINSTANCE module, DWORD reason, LPVOID reserved) { if (reason == DLL_PROCESS_ATTACH) { dll = module; // disable unwanted thread notifications to reduce overhead DisableThreadLibraryCalls(dll); GetModuleFileName(GetModuleHandle(NULL), name, sizeof(name)); // don't hook synergys (this needs to detect real input) if (string(name).find("synergy") == string::npos) { LOG("checking '" << name << "' for " << XINPUT_DLL); HookAPICalls(&s_xInputHook); } } return TRUE; } void SetXInputButtons(DWORD userIndex, WORD buttons) { s_buttons = buttons; s_packetNumber++; LOG("SetXInputButtons: idx=" << userIndex << ", btns=" << buttons); } void SetXInputSticks(DWORD userIndex, SHORT lx, SHORT ly, SHORT rx, SHORT ry) { s_leftStickX = lx; s_leftStickY = ly; s_rightStickX = rx; s_rightStickY = ry; s_packetNumber++; LOG("SetXInputSticks:" << " l=" << s_leftStickX << "," << s_leftStickY << " r=" << s_rightStickX << "," << s_rightStickY); } void SetXInputTriggers(DWORD userIndex, BYTE left, BYTE right) { s_leftTrigger = left; s_rightTrigger = right; s_packetNumber++; LOG("SetXInputTriggers: " << "l=" << (int)left << " r=" << (int)right); } void QueueXInputTimingReq() { s_timingReqQueued = TRUE; } BOOL DequeueXInputTimingResp() { BOOL result = s_timingRespQueued; s_timingRespQueued = FALSE; return result; } BOOL DequeueXInputFeedback(WORD* leftMotor, WORD* rightMotor) { if (s_feedbackQueued) { *leftMotor = s_leftMotor; *rightMotor = s_rightMotor; s_feedbackQueued = FALSE; return TRUE; } return FALSE; } WORD GetXInputFakeFreqMillis() { return s_fakeFreqMillis; } DWORD WINAPI HookXInputGetState(DWORD userIndex, XINPUT_STATE* state) { // @todo multiple device support if (userIndex != 0) { return ERROR_DEVICE_NOT_CONNECTED; } DWORD now = GetTickCount(); s_fakeFreqMillis = (WORD)(now - s_lastFakeMillis); s_lastFakeMillis = now; state->dwPacketNumber = s_packetNumber; state->Gamepad.wButtons = s_buttons; state->Gamepad.bLeftTrigger = s_leftTrigger; state->Gamepad.bRightTrigger = s_rightTrigger; state->Gamepad.sThumbLX = s_leftStickX; state->Gamepad.sThumbLY = s_leftStickY; state->Gamepad.sThumbRX = s_rightStickX; state->Gamepad.sThumbRY = s_rightStickY; LOG("HookXInputGetState" << ", idx=" << userIndex << ", pkt=" << state->dwPacketNumber << ", btn=" << state->Gamepad.wButtons << ", t1=" << (int)state->Gamepad.bLeftTrigger << ", t2=" << (int)state->Gamepad.bRightTrigger << ", s1=" << state->Gamepad.sThumbLX << "," << state->Gamepad.sThumbLY << ", s2=" << state->Gamepad.sThumbRX << "," << state->Gamepad.sThumbRY); if (s_timingReqQueued) { s_timingRespQueued = TRUE; s_timingReqQueued = FALSE; LOG("timing response queued"); } return ERROR_SUCCESS; } DWORD WINAPI HookXInputSetState(DWORD userIndex, XINPUT_VIBRATION* vibration) { // @todo multiple device support if (userIndex != 0) { return ERROR_DEVICE_NOT_CONNECTED; } // only change values and queue feedback change if // feedback has actually changed. if ((s_leftMotor != vibration->wLeftMotorSpeed) || (s_rightMotor != vibration->wRightMotorSpeed)) { s_leftMotor = vibration->wLeftMotorSpeed; s_rightMotor = vibration->wRightMotorSpeed; s_feedbackQueued = TRUE; LOG("HookXInputSetState" ", idx=" << userIndex << ", lm=" << s_leftMotor << ", rm=" << s_rightMotor); } return ERROR_SUCCESS; } DWORD WINAPI HookXInputGetCapabilities(DWORD userIndex, DWORD flags, XINPUT_CAPABILITIES* capabilities) { // @todo multiple device support if (userIndex != 0) { return ERROR_DEVICE_NOT_CONNECTED; } LOG("HookXInputGetCapabilities" ", idx=" << userIndex << ", flags=" << flags); capabilities->Type = 1; capabilities->SubType = 1; capabilities->Flags = 4; capabilities->Gamepad.bLeftTrigger = 1; capabilities->Gamepad.bRightTrigger = 1; capabilities->Gamepad.sThumbLX = 1; capabilities->Gamepad.sThumbLY = 1; capabilities->Gamepad.sThumbRX = 1; capabilities->Gamepad.sThumbRY = 1; capabilities->Gamepad.wButtons = 62463; capabilities->Vibration.wLeftMotorSpeed = 1; capabilities->Vibration.wRightMotorSpeed = 1; return ERROR_SUCCESS; } synxinhk_API LRESULT CALLBACK HookProc(int code, WPARAM wParam, LPARAM lParam) { return CallNextHookEx(s_hook, code, wParam, lParam); } synxinhk_API BOOL InstallXInputHook() { if (_stricmp(XINPUT_DLL, REQUIRED_XINPUT_DLL) != 0) { LOG("DLL not supported: " << XINPUT_DLL); return FALSE; } LOG("installing hook"); s_hook = SetWindowsHookEx(WH_CBT, HookProc, dll, 0); LOG("hook installed"); return TRUE; } synxinhk_API void RemoveXInputHook() { LOG("removing hook"); UnhookWindowsHookEx(s_hook); LOG("hook removed"); } synergy-1.4.12-Source/src/lib/platform/XInputHook.h0000600000175000017500000000350712021261364022113 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #ifdef synxinhk_EXPORTS #define synxinhk_API __declspec(dllexport) #else #define synxinhk_API __declspec(dllimport) #endif synxinhk_API LRESULT CALLBACK HookProc(int nCode, WPARAM wParam, LPARAM lParam); synxinhk_API BOOL InstallXInputHook(); synxinhk_API void RemoveXInputHook(); synxinhk_API void SetXInputButtons(DWORD userIndex, WORD buttons); synxinhk_API void SetXInputSticks(DWORD userIndex, SHORT lx, SHORT ly, SHORT rx, SHORT ry); synxinhk_API void SetXInputTriggers(DWORD userIndex, BYTE left, BYTE right); synxinhk_API void QueueXInputTimingReq(); synxinhk_API BOOL DequeueXInputTimingResp(); synxinhk_API WORD GetXInputFakeFreqMillis(); synxinhk_API BOOL DequeueXInputFeedback(WORD* leftMotor, WORD* rightMotor); #ifdef SYNERGY_EXPORT_XINPUT_HOOKS synxinhk_API DWORD WINAPI HookXInputGetState(DWORD dwUserIndex, XINPUT_STATE* pState); synxinhk_API DWORD WINAPI HookXInputSetState(DWORD dwUserIndex, XINPUT_VIBRATION* pVibration); synxinhk_API DWORD WINAPI HookXInputGetCapabilities(DWORD userIndex, DWORD flags, XINPUT_CAPABILITIES* capabilities); #endif synergy-1.4.12-Source/src/lib/platform/XInputProxy13.cpp0000600000175000017500000000473312021261364023035 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define SYNERGY_EXPORT_XINPUT_HOOKS #define WIN32_LEAN_AND_MEAN #include #include "XInputProxy13.h" #include "XInputHook.h" #pragma comment(linker, "/EXPORT:XInputGetState=_XInputGetState@8,@2") #pragma comment(linker, "/EXPORT:XInputSetState=_XInputSetState@8,@3") #pragma comment(linker, "/EXPORT:XInputGetCapabilities=_XInputGetCapabilities@12,@4") #pragma comment(linker, "/EXPORT:XInputEnable=_XInputEnable@4,@5") #pragma comment(linker, "/EXPORT:XInputGetDSoundAudioDeviceGuids=_XInputGetDSoundAudioDeviceGuids@12,@6") #pragma comment(linker, "/EXPORT:XInputGetBatteryInformation=_XInputGetBatteryInformation@12,@7") #pragma comment(linker, "/EXPORT:XInputGetKeystroke=_XInputGetKeystroke@12,@8") sxinpx13_API DWORD WINAPI XInputGetState(DWORD dwUserIndex, XINPUT_STATE* pState) { return HookXInputGetState(dwUserIndex, pState); } sxinpx13_API DWORD WINAPI XInputSetState(DWORD dwUserIndex, XINPUT_VIBRATION* pVibration) { return HookXInputSetState(dwUserIndex, pVibration); } sxinpx13_API DWORD WINAPI XInputGetCapabilities(DWORD dwUserIndex, DWORD dwFlags, XINPUT_CAPABILITIES* pCapabilities) { return HookXInputGetCapabilities(dwUserIndex, dwFlags, pCapabilities); } sxinpx13_API void WINAPI XInputEnable(BOOL enable) { } sxinpx13_API DWORD WINAPI XInputGetDSoundAudioDeviceGuids(DWORD dwUserIndex, GUID* pDSoundRenderGuid, GUID* pDSoundCaptureGuid) { return ERROR_DEVICE_NOT_CONNECTED; } sxinpx13_API DWORD WINAPI XInputGetBatteryInformation(DWORD dwUserIndex, BYTE devType, XINPUT_BATTERY_INFORMATION* pBatteryInformation) { return ERROR_DEVICE_NOT_CONNECTED; } sxinpx13_API DWORD WINAPI XInputGetKeystroke(DWORD dwUserIndex, DWORD dwReserved, PXINPUT_KEYSTROKE pKeystroke) { return ERROR_DEVICE_NOT_CONNECTED; } synergy-1.4.12-Source/src/lib/platform/XInputProxy13.h0000600000175000017500000000551612021261364022502 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #ifdef sxinpx13_EXPORTS #define sxinpx13_API __declspec(dllexport) #else #define sxinpx13_API __declspec(dllimport) #endif #include "XInput13.h" #ifdef __cplusplus extern "C" { #endif sxinpx13_API DWORD WINAPI XInputGetState ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __out XINPUT_STATE* pState // Receives the current state ); sxinpx13_API DWORD WINAPI XInputSetState ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __in XINPUT_VIBRATION* pVibration // The vibration information to send to the controller ); sxinpx13_API DWORD WINAPI XInputGetCapabilities ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __in DWORD dwFlags, // Input flags that identify the device type __out XINPUT_CAPABILITIES* pCapabilities // Receives the capabilities ); sxinpx13_API void WINAPI XInputEnable ( __in BOOL enable // [in] Indicates whether xinput is enabled or disabled. ); sxinpx13_API DWORD WINAPI XInputGetDSoundAudioDeviceGuids ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __out GUID* pDSoundRenderGuid, // DSound device ID for render __out GUID* pDSoundCaptureGuid // DSound device ID for capture ); sxinpx13_API DWORD WINAPI XInputGetBatteryInformation ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __in BYTE devType, // Which device on this user index __out XINPUT_BATTERY_INFORMATION* pBatteryInformation // Contains the level and types of batteries ); sxinpx13_API DWORD WINAPI XInputGetKeystroke ( __in DWORD dwUserIndex, // Index of the gamer associated with the device __reserved DWORD dwReserved, // Reserved for future use __out PXINPUT_KEYSTROKE pKeystroke // Pointer to an XINPUT_KEYSTROKE structure that receives an input event. ); #ifdef __cplusplus } #endifsynergy-1.4.12-Source/src/lib/server/0000700000175000017500000000000012140644175017354 5ustar synergysynergysynergy-1.4.12-Source/src/lib/server/CBaseClientProxy.cpp0000600000175000017500000000226112021261364023232 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2006 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CBaseClientProxy.h" // // CBaseClientProxy // CBaseClientProxy::CBaseClientProxy(const CString& name) : m_name(name), m_x(0), m_y(0) { // do nothing } CBaseClientProxy::~CBaseClientProxy() { // do nothing } void CBaseClientProxy::setJumpCursorPos(SInt32 x, SInt32 y) { m_x = x; m_y = y; } void CBaseClientProxy::getJumpCursorPos(SInt32& x, SInt32& y) const { x = m_x; y = m_y; } CString CBaseClientProxy::getName() const { return m_name; } synergy-1.4.12-Source/src/lib/server/CBaseClientProxy.h0000600000175000017500000000572312021261364022705 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CBASECLIENTPROXY_H #define CBASECLIENTPROXY_H #include "IClient.h" #include "CString.h" //! Generic proxy for client or primary class CBaseClientProxy : public IClient { public: /*! \c name is the name of the client. */ CBaseClientProxy(const CString& name); ~CBaseClientProxy(); //! @name manipulators //@{ //! Save cursor position /*! Save the position of the cursor when jumping from client. */ void setJumpCursorPos(SInt32 x, SInt32 y); //@} //! @name accessors //@{ //! Get cursor position /*! Get the position of the cursor when last jumping from client. */ void getJumpCursorPos(SInt32& x, SInt32& y) const; //@} // IScreen virtual void* getEventTarget() const = 0; virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; // IClient overrides virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver) = 0; virtual bool leave() = 0; virtual void setClipboard(ClipboardID, const IClipboard*) = 0; virtual void grabClipboard(ClipboardID) = 0; virtual void setClipboardDirty(ClipboardID, bool) = 0; virtual void keyDown(KeyID, KeyModifierMask, KeyButton) = 0; virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton) = 0; virtual void keyUp(KeyID, KeyModifierMask, KeyButton) = 0; virtual void mouseDown(ButtonID) = 0; virtual void mouseUp(ButtonID) = 0; virtual void mouseMove(SInt32 xAbs, SInt32 yAbs) = 0; virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel) = 0; virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta) = 0; virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) = 0; virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) = 0; virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) = 0; virtual void gameDeviceTimingReq() = 0; virtual void screensaver(bool activate) = 0; virtual void resetOptions() = 0; virtual void setOptions(const COptionsList& options) = 0; virtual CString getName() const; private: CString m_name; SInt32 m_x, m_y; }; #endif synergy-1.4.12-Source/src/lib/server/CClientListener.cpp0000600000175000017500000001441612131107263023107 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientListener.h" #include "CClientProxy.h" #include "CClientProxyUnknown.h" #include "CPacketStreamFilter.h" #include "IStreamFilterFactory.h" #include "IDataSocket.h" #include "IListenSocket.h" #include "ISocketFactory.h" #include "XSocket.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "CCryptoStream.h" #include "CCryptoOptions.h" // TODO: these are just for testing -- make sure they're gone by release! const byte g_key[] = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"; const byte g_iv[] = "aaaaaaaaaaaaaaa"; // // CClientListener // CEvent::Type CClientListener::s_connectedEvent = CEvent::kUnknown; CClientListener::CClientListener(const CNetworkAddress& address, ISocketFactory* socketFactory, IStreamFilterFactory* streamFilterFactory, const CCryptoOptions& crypto) : m_socketFactory(socketFactory), m_streamFilterFactory(streamFilterFactory), m_server(NULL), m_crypto(crypto) { assert(m_socketFactory != NULL); try { // create listen socket m_listen = m_socketFactory->createListen(); // bind listen address LOG((CLOG_DEBUG1 "binding listen socket")); m_listen->bind(address); } catch (XSocketAddressInUse&) { delete m_listen; delete m_socketFactory; delete m_streamFilterFactory; throw; } catch (XBase&) { delete m_listen; delete m_socketFactory; delete m_streamFilterFactory; throw; } LOG((CLOG_DEBUG1 "listening for clients")); // setup event handler EVENTQUEUE->adoptHandler(m_listen->getConnectingEvent(), m_listen, new TMethodEventJob(this, &CClientListener::handleClientConnecting)); } CClientListener::~CClientListener() { LOG((CLOG_DEBUG1 "stop listening for clients")); // discard already connected clients for (CNewClients::iterator index = m_newClients.begin(); index != m_newClients.end(); ++index) { CClientProxyUnknown* client = *index; EVENTQUEUE->removeHandler( CClientProxyUnknown::getSuccessEvent(), client); EVENTQUEUE->removeHandler( CClientProxyUnknown::getFailureEvent(), client); EVENTQUEUE->removeHandler( CClientProxy::getDisconnectedEvent(), client); delete client; } // discard waiting clients CClientProxy* client = getNextClient(); while (client != NULL) { delete client; client = getNextClient(); } EVENTQUEUE->removeHandler(m_listen->getConnectingEvent(), m_listen); delete m_listen; delete m_socketFactory; delete m_streamFilterFactory; } void CClientListener::setServer(CServer* server) { assert(server != NULL); m_server = server; } CClientProxy* CClientListener::getNextClient() { CClientProxy* client = NULL; if (!m_waitingClients.empty()) { client = m_waitingClients.front(); m_waitingClients.pop_front(); EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), client); } return client; } CEvent::Type CClientListener::getConnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_connectedEvent, "CClientListener::connected"); } void CClientListener::handleClientConnecting(const CEvent&, void*) { // accept client connection synergy::IStream* stream = m_listen->accept(); if (stream == NULL) { return; } LOG((CLOG_NOTE "accepted client connection")); // filter socket messages, including a packetizing filter if (m_streamFilterFactory != NULL) { stream = m_streamFilterFactory->create(stream, true); } stream = new CPacketStreamFilter(stream, true); if (m_crypto.m_mode != kDisabled) { CCryptoStream* cryptoStream = new CCryptoStream( EVENTQUEUE, stream, m_crypto, true); stream = cryptoStream; } assert(m_server != NULL); // create proxy for unknown client CClientProxyUnknown* client = new CClientProxyUnknown(stream, 30.0, m_server); m_newClients.insert(client); // watch for events from unknown client EVENTQUEUE->adoptHandler(CClientProxyUnknown::getSuccessEvent(), client, new TMethodEventJob(this, &CClientListener::handleUnknownClient, client)); EVENTQUEUE->adoptHandler(CClientProxyUnknown::getFailureEvent(), client, new TMethodEventJob(this, &CClientListener::handleUnknownClient, client)); } void CClientListener::handleUnknownClient(const CEvent&, void* vclient) { CClientProxyUnknown* unknownClient = reinterpret_cast(vclient); // we should have the client in our new client list assert(m_newClients.count(unknownClient) == 1); // get the real client proxy and install it CClientProxy* client = unknownClient->orphanClientProxy(); if (client != NULL) { // handshake was successful m_waitingClients.push_back(client); EVENTQUEUE->addEvent(CEvent(getConnectedEvent(), this)); // watch for client to disconnect while it's in our queue EVENTQUEUE->adoptHandler(CClientProxy::getDisconnectedEvent(), client, new TMethodEventJob(this, &CClientListener::handleClientDisconnected, client)); } // now finished with unknown client EVENTQUEUE->removeHandler(CClientProxyUnknown::getSuccessEvent(), client); EVENTQUEUE->removeHandler(CClientProxyUnknown::getFailureEvent(), client); m_newClients.erase(unknownClient); delete unknownClient; } void CClientListener::handleClientDisconnected(const CEvent&, void* vclient) { CClientProxy* client = reinterpret_cast(vclient); // find client in waiting clients queue for (CWaitingClients::iterator i = m_waitingClients.begin(), n = m_waitingClients.end(); i != n; ++i) { if (*i == client) { m_waitingClients.erase(i); EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), client); delete client; break; } } } synergy-1.4.12-Source/src/lib/server/CClientListener.h0000600000175000017500000000454412131107263022555 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTLISTENER_H #define CCLIENTLISTENER_H #include "CConfig.h" #include "CEvent.h" #include "stddeque.h" #include "stdset.h" #include "CCryptoOptions.h" class CClientProxy; class CClientProxyUnknown; class CNetworkAddress; class IListenSocket; class ISocketFactory; class IStreamFilterFactory; class CServer; class CClientListener { public: // The factories are adopted. CClientListener(const CNetworkAddress&, ISocketFactory*, IStreamFilterFactory*, const CCryptoOptions& crypto); ~CClientListener(); //! @name manipulators //@{ void setServer(CServer* server); //@} //! @name accessors //@{ //! Get next connected client /*! Returns the next connected client and removes it from the internal list. The client is responsible for deleting the returned client. Returns NULL if no clients are available. */ CClientProxy* getNextClient(); //! Get connected event type /*! Returns the connected event type. This is sent whenever a a client connects. */ static CEvent::Type getConnectedEvent(); //@} private: // client connection event handlers void handleClientConnecting(const CEvent&, void*); void handleUnknownClient(const CEvent&, void*); void handleClientDisconnected(const CEvent&, void*); private: typedef std::set CNewClients; typedef std::deque CWaitingClients; IListenSocket* m_listen; ISocketFactory* m_socketFactory; IStreamFilterFactory* m_streamFilterFactory; CNewClients m_newClients; CWaitingClients m_waitingClients; CServer* m_server; CCryptoOptions m_crypto; static CEvent::Type s_connectedEvent; }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy.cpp0000600000175000017500000000452112131442575022447 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy.h" #include "CProtocolUtil.h" #include "IStream.h" #include "CLog.h" #include "CEventQueue.h" // // CClientProxy // CEvent::Type CClientProxy::s_readyEvent = CEvent::kUnknown; CEvent::Type CClientProxy::s_disconnectedEvent = CEvent::kUnknown; CEvent::Type CClientProxy::s_clipboardChangedEvent= CEvent::kUnknown; CEvent::Type CClientProxy::s_gameDeviceTimingRecvEvent= CEvent::kUnknown; CClientProxy::CClientProxy(const CString& name, synergy::IStream* stream) : CBaseClientProxy(name), m_stream(stream) { } CClientProxy::~CClientProxy() { delete m_stream; } void CClientProxy::close(const char* msg) { LOG((CLOG_DEBUG1 "send close \"%s\" to \"%s\"", msg, getName().c_str())); CProtocolUtil::writef(getStream(), msg); // force the close to be sent before we return getStream()->flush(); } synergy::IStream* CClientProxy::getStream() const { return m_stream; } CEvent::Type CClientProxy::getReadyEvent() { return EVENTQUEUE->registerTypeOnce(s_readyEvent, "CClientProxy::ready"); } CEvent::Type CClientProxy::getDisconnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_disconnectedEvent, "CClientProxy::disconnected"); } CEvent::Type CClientProxy::getClipboardChangedEvent() { return EVENTQUEUE->registerTypeOnce(s_clipboardChangedEvent, "CClientProxy::clipboardChanged"); } CEvent::Type CClientProxy::getGameDeviceTimingRespEvent() { return EVENTQUEUE->registerTypeOnce(s_gameDeviceTimingRecvEvent, "CClientProxy::gameDeviceTimingRecv"); } void* CClientProxy::getEventTarget() const { return static_cast(const_cast(this)); } synergy-1.4.12-Source/src/lib/server/CClientProxy.h0000600000175000017500000001021112131062123022070 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXY_H #define CCLIENTPROXY_H #include "CBaseClientProxy.h" #include "CEvent.h" #include "CString.h" namespace synergy { class IStream; } //! Generic proxy for client class CClientProxy : public CBaseClientProxy { public: /*! \c name is the name of the client. */ CClientProxy(const CString& name, synergy::IStream* adoptedStream); ~CClientProxy(); //! @name manipulators //@{ //! Disconnect /*! Ask the client to disconnect, using \p msg as the reason. */ void close(const char* msg); //@} //! @name accessors //@{ //! Get stream /*! Returns a crypto stream if the user has this enabled, otherwise returns the original stream passed to the c'tor. */ synergy::IStream* getStream() const; //! Get ready event type /*! Returns the ready event type. This is sent when the client has completed the initial handshake. Until it is sent, the client is not fully connected. */ static CEvent::Type getReadyEvent(); //! Get disconnect event type /*! Returns the disconnect event type. This is sent when the client disconnects or is disconnected. The target is getEventTarget(). */ static CEvent::Type getDisconnectedEvent(); //! Get clipboard changed event type /*! Returns the clipboard changed event type. This is sent whenever the contents of the clipboard has changed. The data is a pointer to a IScreen::CClipboardInfo. */ static CEvent::Type getClipboardChangedEvent(); //! Get game device timing receive event type /*! Returns the game device timing receive event type. This is set whenever the server receives to a timing event response from a client. */ static CEvent::Type getGameDeviceTimingRespEvent(); //@} // IScreen virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; // IClient overrides virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver) = 0; virtual bool leave() = 0; virtual void setClipboard(ClipboardID, const IClipboard*) = 0; virtual void grabClipboard(ClipboardID) = 0; virtual void setClipboardDirty(ClipboardID, bool) = 0; virtual void keyDown(KeyID, KeyModifierMask, KeyButton) = 0; virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton) = 0; virtual void keyUp(KeyID, KeyModifierMask, KeyButton) = 0; virtual void mouseDown(ButtonID) = 0; virtual void mouseUp(ButtonID) = 0; virtual void mouseMove(SInt32 xAbs, SInt32 yAbs) = 0; virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel) = 0; virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta) = 0; virtual void screensaver(bool activate) = 0; virtual void resetOptions() = 0; virtual void setOptions(const COptionsList& options) = 0; virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) = 0; virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) = 0; virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) = 0; virtual void gameDeviceTimingReq() = 0; virtual void cryptoIv(const UInt8* iv) = 0; private: synergy::IStream* m_stream; static CEvent::Type s_readyEvent; static CEvent::Type s_disconnectedEvent; static CEvent::Type s_clipboardChangedEvent; static CEvent::Type s_gameDeviceTimingRecvEvent; }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy1_0.cpp0000600000175000017500000003305512131062123022736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_0.h" #include "CProtocolUtil.h" #include "XSynergy.h" #include "IStream.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include // // CClientProxy1_0 // CClientProxy1_0::CClientProxy1_0(const CString& name, synergy::IStream* stream, IEventQueue* eventQueue) : CClientProxy(name, stream), m_heartbeatTimer(NULL), m_parser(&CClientProxy1_0::parseHandshakeMessage), m_eventQueue(eventQueue) { // install event handlers m_eventQueue->adoptHandler(stream->getInputReadyEvent(), stream->getEventTarget(), new TMethodEventJob(this, &CClientProxy1_0::handleData, NULL)); m_eventQueue->adoptHandler(stream->getOutputErrorEvent(), stream->getEventTarget(), new TMethodEventJob(this, &CClientProxy1_0::handleWriteError, NULL)); m_eventQueue->adoptHandler(stream->getInputShutdownEvent(), stream->getEventTarget(), new TMethodEventJob(this, &CClientProxy1_0::handleDisconnect, NULL)); m_eventQueue->adoptHandler(stream->getOutputShutdownEvent(), stream->getEventTarget(), new TMethodEventJob(this, &CClientProxy1_0::handleWriteError, NULL)); m_eventQueue->adoptHandler(CEvent::kTimer, this, new TMethodEventJob(this, &CClientProxy1_0::handleFlatline, NULL)); setHeartbeatRate(kHeartRate, kHeartRate * kHeartBeatsUntilDeath); LOG((CLOG_DEBUG1 "querying client \"%s\" info", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgQInfo); } CClientProxy1_0::~CClientProxy1_0() { removeHandlers(); } void CClientProxy1_0::disconnect() { removeHandlers(); getStream()->close(); m_eventQueue->addEvent(CEvent(getDisconnectedEvent(), getEventTarget())); } void CClientProxy1_0::removeHandlers() { // uninstall event handlers m_eventQueue->removeHandler(getStream()->getInputReadyEvent(), getStream()->getEventTarget()); m_eventQueue->removeHandler(getStream()->getOutputErrorEvent(), getStream()->getEventTarget()); m_eventQueue->removeHandler(getStream()->getInputShutdownEvent(), getStream()->getEventTarget()); m_eventQueue->removeHandler(getStream()->getOutputShutdownEvent(), getStream()->getEventTarget()); m_eventQueue->removeHandler(CEvent::kTimer, this); // remove timer removeHeartbeatTimer(); } void CClientProxy1_0::addHeartbeatTimer() { if (m_heartbeatAlarm > 0.0) { m_heartbeatTimer = m_eventQueue->newOneShotTimer(m_heartbeatAlarm, this); } } void CClientProxy1_0::removeHeartbeatTimer() { if (m_heartbeatTimer != NULL) { m_eventQueue->deleteTimer(m_heartbeatTimer); m_heartbeatTimer = NULL; } } void CClientProxy1_0::resetHeartbeatTimer() { // reset the alarm removeHeartbeatTimer(); addHeartbeatTimer(); } void CClientProxy1_0::resetHeartbeatRate() { setHeartbeatRate(kHeartRate, kHeartRate * kHeartBeatsUntilDeath); } void CClientProxy1_0::setHeartbeatRate(double, double alarm) { m_heartbeatAlarm = alarm; } void CClientProxy1_0::handleData(const CEvent&, void*) { // handle messages until there are no more. first read message code. UInt8 code[4]; UInt32 n = getStream()->read(code, 4); while (n != 0) { // verify we got an entire code if (n != 4) { LOG((CLOG_ERR "incomplete message from \"%s\": %d bytes", getName().c_str(), n)); disconnect(); return; } // parse message LOG((CLOG_DEBUG2 "msg from \"%s\": %c%c%c%c", getName().c_str(), code[0], code[1], code[2], code[3])); if (!(this->*m_parser)(code)) { LOG((CLOG_ERR "invalid message from client \"%s\": %c%c%c%c", getName().c_str(), code[0], code[1], code[2], code[3])); disconnect(); return; } // next message n = getStream()->read(code, 4); } // restart heartbeat timer resetHeartbeatTimer(); } bool CClientProxy1_0::parseHandshakeMessage(const UInt8* code) { if (memcmp(code, kMsgCNoop, 4) == 0) { // discard no-ops LOG((CLOG_DEBUG2 "no-op from", getName().c_str())); return true; } else if (memcmp(code, kMsgDInfo, 4) == 0) { // future messages get parsed by parseMessage m_parser = &CClientProxy1_0::parseMessage; if (recvInfo()) { m_eventQueue->addEvent(CEvent(getReadyEvent(), getEventTarget())); addHeartbeatTimer(); return true; } } return false; } bool CClientProxy1_0::parseMessage(const UInt8* code) { if (memcmp(code, kMsgDInfo, 4) == 0) { if (recvInfo()) { m_eventQueue->addEvent( CEvent(getShapeChangedEvent(), getEventTarget())); return true; } return false; } else if (memcmp(code, kMsgCNoop, 4) == 0) { // discard no-ops LOG((CLOG_DEBUG2 "no-op from", getName().c_str())); return true; } else if (memcmp(code, kMsgCClipboard, 4) == 0) { return recvGrabClipboard(); } else if (memcmp(code, kMsgDClipboard, 4) == 0) { return recvClipboard(); } return false; } void CClientProxy1_0::handleDisconnect(const CEvent&, void*) { LOG((CLOG_NOTE "client \"%s\" has disconnected", getName().c_str())); disconnect(); } void CClientProxy1_0::handleWriteError(const CEvent&, void*) { LOG((CLOG_WARN "error writing to client \"%s\"", getName().c_str())); disconnect(); } void CClientProxy1_0::handleFlatline(const CEvent&, void*) { // didn't get a heartbeat fast enough. assume client is dead. LOG((CLOG_NOTE "client \"%s\" is dead", getName().c_str())); disconnect(); } bool CClientProxy1_0::getClipboard(ClipboardID id, IClipboard* clipboard) const { CClipboard::copy(clipboard, &m_clipboard[id].m_clipboard); return true; } void CClientProxy1_0::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { x = m_info.m_x; y = m_info.m_y; w = m_info.m_w; h = m_info.m_h; } void CClientProxy1_0::getCursorPos(SInt32& x, SInt32& y) const { // note -- this returns the cursor pos from when we last got client info x = m_info.m_mx; y = m_info.m_my; } void CClientProxy1_0::enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool) { LOG((CLOG_DEBUG1 "send enter to \"%s\", %d,%d %d %04x", getName().c_str(), xAbs, yAbs, seqNum, mask)); CProtocolUtil::writef(getStream(), kMsgCEnter, xAbs, yAbs, seqNum, mask); } bool CClientProxy1_0::leave() { LOG((CLOG_DEBUG1 "send leave to \"%s\"", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgCLeave); // we can never prevent the user from leaving return true; } void CClientProxy1_0::setClipboard(ClipboardID id, const IClipboard* clipboard) { // ignore if this clipboard is already clean if (m_clipboard[id].m_dirty) { // this clipboard is now clean m_clipboard[id].m_dirty = false; CClipboard::copy(&m_clipboard[id].m_clipboard, clipboard); CString data = m_clipboard[id].m_clipboard.marshall(); LOG((CLOG_DEBUG "send clipboard %d to \"%s\" size=%d", id, getName().c_str(), data.size())); CProtocolUtil::writef(getStream(), kMsgDClipboard, id, 0, &data); } } void CClientProxy1_0::grabClipboard(ClipboardID id) { LOG((CLOG_DEBUG "send grab clipboard %d to \"%s\"", id, getName().c_str())); CProtocolUtil::writef(getStream(), kMsgCClipboard, id, 0); // this clipboard is now dirty m_clipboard[id].m_dirty = true; } void CClientProxy1_0::setClipboardDirty(ClipboardID id, bool dirty) { m_clipboard[id].m_dirty = dirty; } void CClientProxy1_0::keyDown(KeyID key, KeyModifierMask mask, KeyButton) { LOG((CLOG_DEBUG1 "send key down to \"%s\" id=%d, mask=0x%04x", getName().c_str(), key, mask)); CProtocolUtil::writef(getStream(), kMsgDKeyDown1_0, key, mask); } void CClientProxy1_0::keyRepeat(KeyID key, KeyModifierMask mask, SInt32 count, KeyButton) { LOG((CLOG_DEBUG1 "send key repeat to \"%s\" id=%d, mask=0x%04x, count=%d", getName().c_str(), key, mask, count)); CProtocolUtil::writef(getStream(), kMsgDKeyRepeat1_0, key, mask, count); } void CClientProxy1_0::keyUp(KeyID key, KeyModifierMask mask, KeyButton) { LOG((CLOG_DEBUG1 "send key up to \"%s\" id=%d, mask=0x%04x", getName().c_str(), key, mask)); CProtocolUtil::writef(getStream(), kMsgDKeyUp1_0, key, mask); } void CClientProxy1_0::mouseDown(ButtonID button) { LOG((CLOG_DEBUG1 "send mouse down to \"%s\" id=%d", getName().c_str(), button)); CProtocolUtil::writef(getStream(), kMsgDMouseDown, button); } void CClientProxy1_0::mouseUp(ButtonID button) { LOG((CLOG_DEBUG1 "send mouse up to \"%s\" id=%d", getName().c_str(), button)); CProtocolUtil::writef(getStream(), kMsgDMouseUp, button); } void CClientProxy1_0::mouseMove(SInt32 xAbs, SInt32 yAbs) { LOG((CLOG_DEBUG2 "send mouse move to \"%s\" %d,%d", getName().c_str(), xAbs, yAbs)); CProtocolUtil::writef(getStream(), kMsgDMouseMove, xAbs, yAbs); } void CClientProxy1_0::mouseRelativeMove(SInt32, SInt32) { // ignore -- not supported in protocol 1.0 } void CClientProxy1_0::mouseWheel(SInt32, SInt32 yDelta) { // clients prior to 1.3 only support the y axis LOG((CLOG_DEBUG2 "send mouse wheel to \"%s\" %+d", getName().c_str(), yDelta)); CProtocolUtil::writef(getStream(), kMsgDMouseWheel1_0, yDelta); } void CClientProxy1_0::gameDeviceButtons(GameDeviceID, GameDeviceButton) { // ignore -- not supported in protocol 1.0 LOG((CLOG_DEBUG "gameDeviceButtons not supported")); } void CClientProxy1_0::gameDeviceSticks(GameDeviceID, SInt16, SInt16, SInt16, SInt16) { // ignore -- not supported in protocol 1.0 LOG((CLOG_DEBUG "gameDeviceSticks not supported")); } void CClientProxy1_0::gameDeviceTriggers(GameDeviceID, UInt8, UInt8) { // ignore -- not supported in protocol 1.0 LOG((CLOG_DEBUG "gameDeviceTriggers not supported")); } void CClientProxy1_0::gameDeviceTimingReq() { // ignore -- not supported in protocol 1.0 LOG((CLOG_DEBUG "gameDeviceTimingReq not supported")); } void CClientProxy1_0::cryptoIv(const UInt8* iv) { // ignore -- not supported in protocol 1.0 LOG((CLOG_DEBUG "cryptoIv not supported")); } void CClientProxy1_0::screensaver(bool on) { LOG((CLOG_DEBUG1 "send screen saver to \"%s\" on=%d", getName().c_str(), on ? 1 : 0)); CProtocolUtil::writef(getStream(), kMsgCScreenSaver, on ? 1 : 0); } void CClientProxy1_0::resetOptions() { LOG((CLOG_DEBUG1 "send reset options to \"%s\"", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgCResetOptions); // reset heart rate and death resetHeartbeatRate(); removeHeartbeatTimer(); addHeartbeatTimer(); } void CClientProxy1_0::setOptions(const COptionsList& options) { LOG((CLOG_DEBUG1 "send set options to \"%s\" size=%d", getName().c_str(), options.size())); CProtocolUtil::writef(getStream(), kMsgDSetOptions, &options); // check options for (UInt32 i = 0, n = (UInt32)options.size(); i < n; i += 2) { if (options[i] == kOptionHeartbeat) { double rate = 1.0e-3 * static_cast(options[i + 1]); if (rate <= 0.0) { rate = -1.0; } setHeartbeatRate(rate, rate * kHeartBeatsUntilDeath); removeHeartbeatTimer(); addHeartbeatTimer(); } } } bool CClientProxy1_0::recvInfo() { // parse the message SInt16 x, y, w, h, dummy1, mx, my; if (!CProtocolUtil::readf(getStream(), kMsgDInfo + 4, &x, &y, &w, &h, &dummy1, &mx, &my)) { return false; } LOG((CLOG_DEBUG "received client \"%s\" info shape=%d,%d %dx%d at %d,%d", getName().c_str(), x, y, w, h, mx, my)); // validate if (w <= 0 || h <= 0) { return false; } if (mx < x || mx >= x + w || my < y || my >= y + h) { mx = x + w / 2; my = y + h / 2; } // save m_info.m_x = x; m_info.m_y = y; m_info.m_w = w; m_info.m_h = h; m_info.m_mx = mx; m_info.m_my = my; // acknowledge receipt LOG((CLOG_DEBUG1 "send info ack to \"%s\"", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgCInfoAck); return true; } bool CClientProxy1_0::recvClipboard() { // parse message ClipboardID id; UInt32 seqNum; CString data; if (!CProtocolUtil::readf(getStream(), kMsgDClipboard + 4, &id, &seqNum, &data)) { return false; } LOG((CLOG_DEBUG "received client \"%s\" clipboard %d seqnum=%d, size=%d", getName().c_str(), id, seqNum, data.size())); // validate if (id >= kClipboardEnd) { return false; } // save clipboard m_clipboard[id].m_clipboard.unmarshall(data, 0); m_clipboard[id].m_sequenceNumber = seqNum; // notify CClipboardInfo* info = new CClipboardInfo; info->m_id = id; info->m_sequenceNumber = seqNum; m_eventQueue->addEvent(CEvent(getClipboardChangedEvent(), getEventTarget(), info)); return true; } bool CClientProxy1_0::recvGrabClipboard() { // parse message ClipboardID id; UInt32 seqNum; if (!CProtocolUtil::readf(getStream(), kMsgCClipboard + 4, &id, &seqNum)) { return false; } LOG((CLOG_DEBUG "received client \"%s\" grabbed clipboard %d seqnum=%d", getName().c_str(), id, seqNum)); // validate if (id >= kClipboardEnd) { return false; } // notify CClipboardInfo* info = new CClipboardInfo; info->m_id = id; info->m_sequenceNumber = seqNum; m_eventQueue->addEvent(CEvent(getClipboardGrabbedEvent(), getEventTarget(), info)); return true; } // // CClientProxy1_0::CClientClipboard // CClientProxy1_0::CClientClipboard::CClientClipboard() : m_clipboard(), m_sequenceNumber(0), m_dirty(true) { // do nothing } synergy-1.4.12-Source/src/lib/server/CClientProxy1_0.h0000600000175000017500000000712212131062123022377 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXY1_0_H #define CCLIENTPROXY1_0_H #include "CClientProxy.h" #include "CClipboard.h" #include "ProtocolTypes.h" class CEvent; class CEventQueueTimer; class IEventQueue; //! Proxy for client implementing protocol version 1.0 class CClientProxy1_0 : public CClientProxy { public: CClientProxy1_0(const CString& name, synergy::IStream* adoptedStream, IEventQueue* eventQueue); ~CClientProxy1_0(); // IScreen virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IClient overrides virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver); virtual bool leave(); virtual void setClipboard(ClipboardID, const IClipboard*); virtual void grabClipboard(ClipboardID); virtual void setClipboardDirty(ClipboardID, bool); virtual void keyDown(KeyID, KeyModifierMask, KeyButton); virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton); virtual void keyUp(KeyID, KeyModifierMask, KeyButton); virtual void mouseDown(ButtonID); virtual void mouseUp(ButtonID); virtual void mouseMove(SInt32 xAbs, SInt32 yAbs); virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel); virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); virtual void gameDeviceTimingReq(); virtual void cryptoIv(const UInt8* iv); protected: virtual bool parseHandshakeMessage(const UInt8* code); virtual bool parseMessage(const UInt8* code); virtual void resetHeartbeatRate(); virtual void setHeartbeatRate(double rate, double alarm); virtual void resetHeartbeatTimer(); virtual void addHeartbeatTimer(); virtual void removeHeartbeatTimer(); private: void disconnect(); void removeHandlers(); void handleData(const CEvent&, void*); void handleDisconnect(const CEvent&, void*); void handleWriteError(const CEvent&, void*); void handleFlatline(const CEvent&, void*); bool recvInfo(); bool recvClipboard(); bool recvGrabClipboard(); private: typedef bool (CClientProxy1_0::*MessageParser)(const UInt8*); struct CClientClipboard { public: CClientClipboard(); public: CClipboard m_clipboard; UInt32 m_sequenceNumber; bool m_dirty; }; CClientInfo m_info; CClientClipboard m_clipboard[kClipboardEnd]; double m_heartbeatAlarm; CEventQueueTimer* m_heartbeatTimer; MessageParser m_parser; IEventQueue* m_eventQueue; }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy1_1.cpp0000600000175000017500000000363312131062123022736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_1.h" #include "CProtocolUtil.h" #include "CLog.h" #include // // CClientProxy1_1 // CClientProxy1_1::CClientProxy1_1(const CString& name, synergy::IStream* stream, IEventQueue* eventQueue) : CClientProxy1_0(name, stream, eventQueue) { // do nothing } CClientProxy1_1::~CClientProxy1_1() { // do nothing } void CClientProxy1_1::keyDown(KeyID key, KeyModifierMask mask, KeyButton button) { LOG((CLOG_DEBUG1 "send key down to \"%s\" id=%d, mask=0x%04x, button=0x%04x", getName().c_str(), key, mask, button)); CProtocolUtil::writef(getStream(), kMsgDKeyDown, key, mask, button); } void CClientProxy1_1::keyRepeat(KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button) { LOG((CLOG_DEBUG1 "send key repeat to \"%s\" id=%d, mask=0x%04x, count=%d, button=0x%04x", getName().c_str(), key, mask, count, button)); CProtocolUtil::writef(getStream(), kMsgDKeyRepeat, key, mask, count, button); } void CClientProxy1_1::keyUp(KeyID key, KeyModifierMask mask, KeyButton button) { LOG((CLOG_DEBUG1 "send key up to \"%s\" id=%d, mask=0x%04x, button=0x%04x", getName().c_str(), key, mask, button)); CProtocolUtil::writef(getStream(), kMsgDKeyUp, key, mask, button); } synergy-1.4.12-Source/src/lib/server/CClientProxy1_1.h0000600000175000017500000000240012131062123022372 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXY1_1_H #define CCLIENTPROXY1_1_H #include "CClientProxy1_0.h" //! Proxy for client implementing protocol version 1.1 class CClientProxy1_1 : public CClientProxy1_0 { public: CClientProxy1_1(const CString& name, synergy::IStream* adoptedStream, IEventQueue* eventQueue); ~CClientProxy1_1(); // IClient overrides virtual void keyDown(KeyID, KeyModifierMask, KeyButton); virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton); virtual void keyUp(KeyID, KeyModifierMask, KeyButton); }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy1_2.cpp0000600000175000017500000000241712131062123022736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_2.h" #include "CProtocolUtil.h" #include "CLog.h" // // CClientProxy1_1 // CClientProxy1_2::CClientProxy1_2(const CString& name, synergy::IStream* stream, IEventQueue* eventQueue) : CClientProxy1_1(name, stream, eventQueue) { // do nothing } CClientProxy1_2::~CClientProxy1_2() { // do nothing } void CClientProxy1_2::mouseRelativeMove(SInt32 xRel, SInt32 yRel) { LOG((CLOG_DEBUG2 "send mouse relative move to \"%s\" %d,%d", getName().c_str(), xRel, yRel)); CProtocolUtil::writef(getStream(), kMsgDMouseRelMove, xRel, yRel); } synergy-1.4.12-Source/src/lib/server/CClientProxy1_2.h0000600000175000017500000000221212131062123022374 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXY1_2_H #define CCLIENTPROXY1_2_H #include "CClientProxy1_1.h" class IEventQueue; //! Proxy for client implementing protocol version 1.2 class CClientProxy1_2 : public CClientProxy1_1 { public: CClientProxy1_2(const CString& name, synergy::IStream* adoptedStream, IEventQueue* eventQueue); ~CClientProxy1_2(); // IClient overrides virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel); }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy1_3.cpp0000600000175000017500000000617512131442575022761 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2006 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_3.h" #include "CProtocolUtil.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include #include // // CClientProxy1_3 // CClientProxy1_3::CClientProxy1_3(const CString& name, synergy::IStream* stream, IEventQueue* eventQueue) : CClientProxy1_2(name, stream, eventQueue), m_keepAliveRate(kKeepAliveRate), m_keepAliveTimer(NULL) { setHeartbeatRate(kKeepAliveRate, kKeepAliveRate * kKeepAlivesUntilDeath); } CClientProxy1_3::~CClientProxy1_3() { // cannot do this in superclass or our override wouldn't get called removeHeartbeatTimer(); } void CClientProxy1_3::mouseWheel(SInt32 xDelta, SInt32 yDelta) { LOG((CLOG_DEBUG2 "send mouse wheel to \"%s\" %+d,%+d", getName().c_str(), xDelta, yDelta)); CProtocolUtil::writef(getStream(), kMsgDMouseWheel, xDelta, yDelta); } bool CClientProxy1_3::parseMessage(const UInt8* code) { // process message if (memcmp(code, kMsgCKeepAlive, 4) == 0) { // reset alarm resetHeartbeatTimer(); return true; } else { return CClientProxy1_2::parseMessage(code); } } void CClientProxy1_3::resetHeartbeatRate() { setHeartbeatRate(kKeepAliveRate, kKeepAliveRate * kKeepAlivesUntilDeath); } void CClientProxy1_3::setHeartbeatRate(double rate, double) { m_keepAliveRate = rate; CClientProxy1_2::setHeartbeatRate(rate, rate * kKeepAlivesUntilDeath); } void CClientProxy1_3::resetHeartbeatTimer() { // reset the alarm but not the keep alive timer CClientProxy1_2::removeHeartbeatTimer(); CClientProxy1_2::addHeartbeatTimer(); } void CClientProxy1_3::addHeartbeatTimer() { // create and install a timer to periodically send keep alives if (m_keepAliveRate > 0.0) { m_keepAliveTimer = EVENTQUEUE->newTimer(m_keepAliveRate, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_keepAliveTimer, new TMethodEventJob(this, &CClientProxy1_3::handleKeepAlive, NULL)); } // superclass does the alarm CClientProxy1_2::addHeartbeatTimer(); } void CClientProxy1_3::removeHeartbeatTimer() { // remove the timer that sends keep alives periodically if (m_keepAliveTimer != NULL) { EVENTQUEUE->removeHandler(CEvent::kTimer, m_keepAliveTimer); EVENTQUEUE->deleteTimer(m_keepAliveTimer); m_keepAliveTimer = NULL; } // superclass does the alarm CClientProxy1_2::removeHeartbeatTimer(); } void CClientProxy1_3::handleKeepAlive(const CEvent&, void*) { CProtocolUtil::writef(getStream(), kMsgCKeepAlive); } synergy-1.4.12-Source/src/lib/server/CClientProxy1_3.h0000600000175000017500000000304212131062123022377 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2006 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXY1_3_H #define CCLIENTPROXY1_3_H #include "CClientProxy1_2.h" //! Proxy for client implementing protocol version 1.3 class CClientProxy1_3 : public CClientProxy1_2 { public: CClientProxy1_3(const CString& name, synergy::IStream* adoptedStream, IEventQueue* eventQueue); ~CClientProxy1_3(); // IClient overrides virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta); protected: // CClientProxy overrides virtual bool parseMessage(const UInt8* code); virtual void resetHeartbeatRate(); virtual void setHeartbeatRate(double rate, double alarm); virtual void resetHeartbeatTimer(); virtual void addHeartbeatTimer(); virtual void removeHeartbeatTimer(); private: void handleKeepAlive(const CEvent&, void*); private: double m_keepAliveRate; CEventQueueTimer* m_keepAliveTimer; }; #endif synergy-1.4.12-Source/src/lib/server/CClientProxy1_4.cpp0000600000175000017500000001005312140235162022740 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_4.h" #include "CProtocolUtil.h" #include "CLog.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include #include #include "CServer.h" #include "CCryptoStream.h" // // CClientProxy1_4 // CClientProxy1_4::CClientProxy1_4(const CString& name, synergy::IStream* stream, CServer* server, IEventQueue* eventQueue) : CClientProxy1_3(name, stream, eventQueue), m_server(server) { assert(m_server != NULL); } CClientProxy1_4::~CClientProxy1_4() { } void CClientProxy1_4::gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) { LOG((CLOG_DEBUG2 "send game device buttons to \"%s\" id=%d buttons=%d", getName().c_str(), id, buttons)); CProtocolUtil::writef(getStream(), kMsgDGameButtons, id, buttons); } void CClientProxy1_4::gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) { LOG((CLOG_DEBUG2 "send game device sticks to \"%s\" id=%d s1=%+d,%+d s2=%+d,%+d", getName().c_str(), id, x1, y1, x2, y2)); CProtocolUtil::writef(getStream(), kMsgDGameSticks, id, x1, y1, x2, y2); } void CClientProxy1_4::gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) { LOG((CLOG_DEBUG2 "send game device triggers to \"%s\" id=%d t1=%d t2=%d", getName().c_str(), id, t1, t2)); CProtocolUtil::writef(getStream(), kMsgDGameTriggers, id, t1, t2); } void CClientProxy1_4::gameDeviceTimingReq() { LOG((CLOG_DEBUG2 "send game device timing request to \"%s\"", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgCGameTimingReq); } void CClientProxy1_4::keyDown(KeyID key, KeyModifierMask mask, KeyButton button) { cryptoIv(); CClientProxy1_3::keyDown(key, mask, button); } void CClientProxy1_4::keyRepeat(KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button) { cryptoIv(); CClientProxy1_3::keyRepeat(key, mask, count, button); } void CClientProxy1_4::keyUp(KeyID key, KeyModifierMask mask, KeyButton button) { cryptoIv(); CClientProxy1_3::keyUp(key, mask, button); } void CClientProxy1_4::cryptoIv() { CCryptoStream* cryptoStream = dynamic_cast(getStream()); if (cryptoStream == NULL) { return; } byte iv[CRYPTO_IV_SIZE]; cryptoStream->newIv(iv); CString data(reinterpret_cast(iv), CRYPTO_IV_SIZE); LOG((CLOG_DEBUG2 "send crypto iv change to \"%s\"", getName().c_str())); CProtocolUtil::writef(getStream(), kMsgDCryptoIv, &data); // change IV only after we've sent the current IV, otherwise // the client won't be able to decrypt the new IV. cryptoStream->setEncryptIv(iv); } bool CClientProxy1_4::parseMessage(const UInt8* code) { // process message if (memcmp(code, kMsgCGameTimingResp, 4) == 0) { gameDeviceTimingResp(); } else if (memcmp(code, kMsgDGameFeedback, 4) == 0) { gameDeviceFeedback(); } else { return CClientProxy1_3::parseMessage(code); } return true; } void CClientProxy1_4::gameDeviceFeedback() { // parse GameDeviceID id; UInt16 m1, m2; CProtocolUtil::readf(getStream(), kMsgDGameFeedback + 4, &id, &m1, &m2); LOG((CLOG_DEBUG2 "recv game device feedback id=%d m1=%d m2=%d", id, m1, m2)); // forward m_server->gameDeviceFeedback(id, m1, m2); } void CClientProxy1_4::gameDeviceTimingResp() { // parse UInt16 freq; CProtocolUtil::readf(getStream(), kMsgCGameTimingResp + 4, &freq); LOG((CLOG_DEBUG2 "recv game device timing response freq=%dms", freq)); // forward m_server->gameDeviceTimingResp(freq); } synergy-1.4.12-Source/src/lib/server/CClientProxy1_4.h0000600000175000017500000000351212131062123022402 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CClientProxy1_3.h" #include "GameDeviceTypes.h" class CServer; //! Proxy for client implementing protocol version 1.4 class CClientProxy1_4 : public CClientProxy1_3 { public: CClientProxy1_4(const CString& name, synergy::IStream* adoptedStream, CServer* server, IEventQueue* eventQueue); ~CClientProxy1_4(); // IClient overrides virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); virtual void gameDeviceTimingReq(); virtual void keyDown(KeyID key, KeyModifierMask mask, KeyButton button); virtual void keyRepeat(KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button); virtual void keyUp(KeyID key, KeyModifierMask mask, KeyButton button); //! Send IV to make void cryptoIv(); protected: // CClientProxy overrides virtual bool parseMessage(const UInt8* code); private: // message handlers void gameDeviceTimingResp(); void gameDeviceFeedback(); CServer* m_server; }; synergy-1.4.12-Source/src/lib/server/CClientProxyUnknown.cpp0000600000175000017500000001715712131442575024040 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxyUnknown.h" #include "CClientProxy1_0.h" #include "CClientProxy1_1.h" #include "CClientProxy1_2.h" #include "CClientProxy1_3.h" #include "CClientProxy1_4.h" #include "ProtocolTypes.h" #include "CProtocolUtil.h" #include "XSynergy.h" #include "IStream.h" #include "XIO.h" #include "CLog.h" #include "CString.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "CServer.h" // // CClientProxyUnknown // CEvent::Type CClientProxyUnknown::s_successEvent = CEvent::kUnknown; CEvent::Type CClientProxyUnknown::s_failureEvent = CEvent::kUnknown; CClientProxyUnknown::CClientProxyUnknown(synergy::IStream* stream, double timeout, CServer* server) : m_stream(stream), m_proxy(NULL), m_ready(false), m_server(server) { assert(m_server != NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, this, new TMethodEventJob(this, &CClientProxyUnknown::handleTimeout, NULL)); m_timer = EVENTQUEUE->newOneShotTimer(timeout, this); addStreamHandlers(); LOG((CLOG_DEBUG1 "saying hello")); CProtocolUtil::writef(m_stream, kMsgHello, kProtocolMajorVersion, kProtocolMinorVersion); } CClientProxyUnknown::~CClientProxyUnknown() { removeHandlers(); removeTimer(); delete m_stream; delete m_proxy; } CClientProxy* CClientProxyUnknown::orphanClientProxy() { if (m_ready) { removeHandlers(); CClientProxy* proxy = m_proxy; m_proxy = NULL; return proxy; } else { return NULL; } } CEvent::Type CClientProxyUnknown::getSuccessEvent() { return EVENTQUEUE->registerTypeOnce(s_successEvent, "CClientProxy::success"); } CEvent::Type CClientProxyUnknown::getFailureEvent() { return EVENTQUEUE->registerTypeOnce(s_failureEvent, "CClientProxy::failure"); } void CClientProxyUnknown::sendSuccess() { m_ready = true; removeTimer(); EVENTQUEUE->addEvent(CEvent(getSuccessEvent(), this)); } void CClientProxyUnknown::sendFailure() { delete m_proxy; m_proxy = NULL; m_ready = false; removeHandlers(); removeTimer(); EVENTQUEUE->addEvent(CEvent(getFailureEvent(), this)); } void CClientProxyUnknown::addStreamHandlers() { assert(m_stream != NULL); EVENTQUEUE->adoptHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClientProxyUnknown::handleData)); EVENTQUEUE->adoptHandler(m_stream->getOutputErrorEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClientProxyUnknown::handleWriteError)); EVENTQUEUE->adoptHandler(m_stream->getInputShutdownEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClientProxyUnknown::handleDisconnect)); EVENTQUEUE->adoptHandler(m_stream->getOutputShutdownEvent(), m_stream->getEventTarget(), new TMethodEventJob(this, &CClientProxyUnknown::handleWriteError)); } void CClientProxyUnknown::addProxyHandlers() { assert(m_proxy != NULL); EVENTQUEUE->adoptHandler(CClientProxy::getReadyEvent(), m_proxy, new TMethodEventJob(this, &CClientProxyUnknown::handleReady)); EVENTQUEUE->adoptHandler(CClientProxy::getDisconnectedEvent(), m_proxy, new TMethodEventJob(this, &CClientProxyUnknown::handleDisconnect)); } void CClientProxyUnknown::removeHandlers() { if (m_stream != NULL) { EVENTQUEUE->removeHandler(m_stream->getInputReadyEvent(), m_stream->getEventTarget()); EVENTQUEUE->removeHandler(m_stream->getOutputErrorEvent(), m_stream->getEventTarget()); EVENTQUEUE->removeHandler(m_stream->getInputShutdownEvent(), m_stream->getEventTarget()); EVENTQUEUE->removeHandler(m_stream->getOutputShutdownEvent(), m_stream->getEventTarget()); } if (m_proxy != NULL) { EVENTQUEUE->removeHandler(CClientProxy::getReadyEvent(), m_proxy); EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), m_proxy); } } void CClientProxyUnknown::removeTimer() { if (m_timer != NULL) { EVENTQUEUE->deleteTimer(m_timer); EVENTQUEUE->removeHandler(CEvent::kTimer, this); m_timer = NULL; } } void CClientProxyUnknown::handleData(const CEvent&, void*) { LOG((CLOG_DEBUG1 "parsing hello reply")); CString name(""); try { // limit the maximum length of the hello UInt32 n = m_stream->getSize(); if (n > kMaxHelloLength) { LOG((CLOG_DEBUG1 "hello reply too long")); throw XBadClient(); } // parse the reply to hello SInt16 major, minor; if (!CProtocolUtil::readf(m_stream, kMsgHelloBack, &major, &minor, &name)) { throw XBadClient(); } // disallow invalid version numbers if (major <= 0 || minor < 0) { throw XIncompatibleClient(major, minor); } // remove stream event handlers. the proxy we're about to create // may install its own handlers and we don't want to accidentally // remove those later. removeHandlers(); // create client proxy for highest version supported by the client if (major == 1) { switch (minor) { case 0: m_proxy = new CClientProxy1_0(name, m_stream, EVENTQUEUE); break; case 1: m_proxy = new CClientProxy1_1(name, m_stream, EVENTQUEUE); break; case 2: m_proxy = new CClientProxy1_2(name, m_stream, EVENTQUEUE); break; case 3: m_proxy = new CClientProxy1_3(name, m_stream, EVENTQUEUE); break; case 4: m_proxy = new CClientProxy1_4(name, m_stream, m_server, EVENTQUEUE); break; } } // hangup (with error) if version isn't supported if (m_proxy == NULL) { throw XIncompatibleClient(major, minor); } // the proxy is created and now proxy now owns the stream LOG((CLOG_DEBUG1 "created proxy for client \"%s\" version %d.%d", name.c_str(), major, minor)); m_stream = NULL; // wait until the proxy signals that it's ready or has disconnected addProxyHandlers(); return; } catch (XIncompatibleClient& e) { // client is incompatible LOG((CLOG_WARN "client \"%s\" has incompatible version %d.%d)", name.c_str(), e.getMajor(), e.getMinor())); CProtocolUtil::writef(m_stream, kMsgEIncompatible, kProtocolMajorVersion, kProtocolMinorVersion); } catch (XBadClient&) { // client not behaving LOG((CLOG_WARN "protocol error from client \"%s\"", name.c_str())); CProtocolUtil::writef(m_stream, kMsgEBad); } catch (XBase& e) { // misc error LOG((CLOG_WARN "error communicating with client \"%s\": %s", name.c_str(), e.what())); } sendFailure(); } void CClientProxyUnknown::handleWriteError(const CEvent&, void*) { LOG((CLOG_NOTE "error communicating with new client")); sendFailure(); } void CClientProxyUnknown::handleTimeout(const CEvent&, void*) { LOG((CLOG_NOTE "new client is unresponsive")); sendFailure(); } void CClientProxyUnknown::handleDisconnect(const CEvent&, void*) { LOG((CLOG_NOTE "new client disconnected")); sendFailure(); } void CClientProxyUnknown::handleReady(const CEvent&, void*) { sendSuccess(); } synergy-1.4.12-Source/src/lib/server/CClientProxyUnknown.h0000600000175000017500000000455312127576354023511 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTPROXYUNKNOWN_H #define CCLIENTPROXYUNKNOWN_H #include "CEvent.h" class CClientProxy; class CEventQueueTimer; namespace synergy { class IStream; } class CServer; class CClientProxyUnknown { public: CClientProxyUnknown(synergy::IStream* stream, double timeout, CServer* server); ~CClientProxyUnknown(); //! @name manipulators //@{ //! Get the client proxy /*! Returns the client proxy created after a successful handshake (i.e. when this object sends a success event). Returns NULL if the handshake is unsuccessful or incomplete. */ CClientProxy* orphanClientProxy(); //@} //! @name accessors //@{ //! Get success event type /*! Returns the success event type. This is sent when the client has correctly responded to the hello message. The target is this. */ static CEvent::Type getSuccessEvent(); //! Get failure event type /*! Returns the failure event type. This is sent when a client fails to correctly respond to the hello message. The target is this. */ static CEvent::Type getFailureEvent(); //@} private: void sendSuccess(); void sendFailure(); void addStreamHandlers(); void addProxyHandlers(); void removeHandlers(); void removeTimer(); void handleData(const CEvent&, void*); void handleWriteError(const CEvent&, void*); void handleTimeout(const CEvent&, void*); void handleDisconnect(const CEvent&, void*); void handleReady(const CEvent&, void*); private: synergy::IStream* m_stream; CEventQueueTimer* m_timer; CClientProxy* m_proxy; bool m_ready; static CEvent::Type s_successEvent; static CEvent::Type s_failureEvent; CServer* m_server; }; #endif synergy-1.4.12-Source/src/lib/server/CConfig.cpp0000600000175000017500000015171712021261364021377 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CConfig.h" #include "CServer.h" #include "CKeyMap.h" #include "KeyTypes.h" #include "XSocket.h" #include "stdistream.h" #include "stdostream.h" #include // // CConfig // CConfig::CConfig() : m_hasLockToScreenAction(false) { // do nothing } CConfig::~CConfig() { // do nothing } bool CConfig::addScreen(const CString& name) { // alias name must not exist if (m_nameToCanonicalName.find(name) != m_nameToCanonicalName.end()) { return false; } // add cell m_map.insert(std::make_pair(name, CCell())); // add name m_nameToCanonicalName.insert(std::make_pair(name, name)); return true; } bool CConfig::renameScreen(const CString& oldName, const CString& newName) { // get canonical name and find cell CString oldCanonical = getCanonicalName(oldName); CCellMap::iterator index = m_map.find(oldCanonical); if (index == m_map.end()) { return false; } // accept if names are equal but replace with new name to maintain // case. otherwise, the new name must not exist. if (!CStringUtil::CaselessCmp::equal(oldName, newName) && m_nameToCanonicalName.find(newName) != m_nameToCanonicalName.end()) { return false; } // update cell CCell tmpCell = index->second; m_map.erase(index); m_map.insert(std::make_pair(newName, tmpCell)); // update name m_nameToCanonicalName.erase(oldCanonical); m_nameToCanonicalName.insert(std::make_pair(newName, newName)); // update connections CName oldNameObj(this, oldName); for (index = m_map.begin(); index != m_map.end(); ++index) { index->second.rename(oldNameObj, newName); } // update alias targets if (CStringUtil::CaselessCmp::equal(oldName, oldCanonical)) { for (CNameMap::iterator iter = m_nameToCanonicalName.begin(); iter != m_nameToCanonicalName.end(); ++iter) { if (CStringUtil::CaselessCmp::equal( iter->second, oldCanonical)) { iter->second = newName; } } } return true; } void CConfig::removeScreen(const CString& name) { // get canonical name and find cell CString canonical = getCanonicalName(name); CCellMap::iterator index = m_map.find(canonical); if (index == m_map.end()) { return; } // remove from map m_map.erase(index); // disconnect CName nameObj(this, name); for (index = m_map.begin(); index != m_map.end(); ++index) { index->second.remove(nameObj); } // remove aliases (and canonical name) for (CNameMap::iterator iter = m_nameToCanonicalName.begin(); iter != m_nameToCanonicalName.end(); ) { if (iter->second == canonical) { m_nameToCanonicalName.erase(iter++); } else { ++index; } } } void CConfig::removeAllScreens() { m_map.clear(); m_nameToCanonicalName.clear(); } bool CConfig::addAlias(const CString& canonical, const CString& alias) { // alias name must not exist if (m_nameToCanonicalName.find(alias) != m_nameToCanonicalName.end()) { return false; } // canonical name must be known if (m_map.find(canonical) == m_map.end()) { return false; } // insert alias m_nameToCanonicalName.insert(std::make_pair(alias, canonical)); return true; } bool CConfig::removeAlias(const CString& alias) { // must not be a canonical name if (m_map.find(alias) != m_map.end()) { return false; } // find alias CNameMap::iterator index = m_nameToCanonicalName.find(alias); if (index == m_nameToCanonicalName.end()) { return false; } // remove alias m_nameToCanonicalName.erase(index); return true; } bool CConfig::removeAliases(const CString& canonical) { // must be a canonical name if (m_map.find(canonical) == m_map.end()) { return false; } // find and removing matching aliases for (CNameMap::iterator index = m_nameToCanonicalName.begin(); index != m_nameToCanonicalName.end(); ) { if (index->second == canonical && index->first != canonical) { m_nameToCanonicalName.erase(index++); } else { ++index; } } return true; } void CConfig::removeAllAliases() { // remove all names m_nameToCanonicalName.clear(); // put the canonical names back in for (CCellMap::iterator index = m_map.begin(); index != m_map.end(); ++index) { m_nameToCanonicalName.insert( std::make_pair(index->first, index->first)); } } bool CConfig::connect(const CString& srcName, EDirection srcSide, float srcStart, float srcEnd, const CString& dstName, float dstStart, float dstEnd) { assert(srcSide >= kFirstDirection && srcSide <= kLastDirection); // find source cell CCellMap::iterator index = m_map.find(getCanonicalName(srcName)); if (index == m_map.end()) { return false; } // add link CCellEdge srcEdge(srcSide, CInterval(srcStart, srcEnd)); CCellEdge dstEdge(dstName, srcSide, CInterval(dstStart, dstEnd)); return index->second.add(srcEdge, dstEdge); } bool CConfig::disconnect(const CString& srcName, EDirection srcSide) { assert(srcSide >= kFirstDirection && srcSide <= kLastDirection); // find source cell CCellMap::iterator index = m_map.find(srcName); if (index == m_map.end()) { return false; } // disconnect side index->second.remove(srcSide); return true; } bool CConfig::disconnect(const CString& srcName, EDirection srcSide, float position) { assert(srcSide >= kFirstDirection && srcSide <= kLastDirection); // find source cell CCellMap::iterator index = m_map.find(srcName); if (index == m_map.end()) { return false; } // disconnect side index->second.remove(srcSide, position); return true; } void CConfig::setSynergyAddress(const CNetworkAddress& addr) { m_synergyAddress = addr; } bool CConfig::addOption(const CString& name, OptionID option, OptionValue value) { // find options CScreenOptions* options = NULL; if (name.empty()) { options = &m_globalOptions; } else { CCellMap::iterator index = m_map.find(name); if (index != m_map.end()) { options = &index->second.m_options; } } if (options == NULL) { return false; } // add option options->insert(std::make_pair(option, value)); return true; } bool CConfig::removeOption(const CString& name, OptionID option) { // find options CScreenOptions* options = NULL; if (name.empty()) { options = &m_globalOptions; } else { CCellMap::iterator index = m_map.find(name); if (index != m_map.end()) { options = &index->second.m_options; } } if (options == NULL) { return false; } // remove option options->erase(option); return true; } bool CConfig::removeOptions(const CString& name) { // find options CScreenOptions* options = NULL; if (name.empty()) { options = &m_globalOptions; } else { CCellMap::iterator index = m_map.find(name); if (index != m_map.end()) { options = &index->second.m_options; } } if (options == NULL) { return false; } // remove options options->clear(); return true; } bool CConfig::isValidScreenName(const CString& name) const { // name is valid if matches validname // name ::= [_A-Za-z0-9] | [_A-Za-z0-9][-_A-Za-z0-9]*[_A-Za-z0-9] // domain ::= . name // validname ::= name domain* // we also accept names ending in . because many OS X users have // so misconfigured their systems. // empty name is invalid if (name.empty()) { return false; } // check each dot separated part CString::size_type b = 0; for (;;) { // accept trailing . if (b == name.size()) { break; } // find end of part CString::size_type e = name.find('.', b); if (e == CString::npos) { e = name.size(); } // part may not be empty if (e - b < 1) { return false; } // check first and last characters if (!(isalnum(name[b]) || name[b] == '_') || !(isalnum(name[e - 1]) || name[e - 1] == '_')) { return false; } // check interior characters for (CString::size_type i = b; i < e; ++i) { if (!isalnum(name[i]) && name[i] != '_' && name[i] != '-') { return false; } } // next part if (e == name.size()) { // no more parts break; } b = e + 1; } return true; } CConfig::const_iterator CConfig::begin() const { return const_iterator(m_map.begin()); } CConfig::const_iterator CConfig::end() const { return const_iterator(m_map.end()); } CConfig::all_const_iterator CConfig::beginAll() const { return m_nameToCanonicalName.begin(); } CConfig::all_const_iterator CConfig::endAll() const { return m_nameToCanonicalName.end(); } bool CConfig::isScreen(const CString& name) const { return (m_nameToCanonicalName.count(name) > 0); } bool CConfig::isCanonicalName(const CString& name) const { return (!name.empty() && CStringUtil::CaselessCmp::equal(getCanonicalName(name), name)); } CString CConfig::getCanonicalName(const CString& name) const { CNameMap::const_iterator index = m_nameToCanonicalName.find(name); if (index == m_nameToCanonicalName.end()) { return CString(); } else { return index->second; } } CString CConfig::getNeighbor(const CString& srcName, EDirection srcSide, float position, float* positionOut) const { assert(srcSide >= kFirstDirection && srcSide <= kLastDirection); // find source cell CCellMap::const_iterator index = m_map.find(getCanonicalName(srcName)); if (index == m_map.end()) { return CString(); } // find edge const CCellEdge* srcEdge, *dstEdge; if (!index->second.getLink(srcSide, position, srcEdge, dstEdge)) { // no neighbor return ""; } else { // compute position on neighbor if (positionOut != NULL) { *positionOut = dstEdge->inverseTransform(srcEdge->transform(position)); } // return neighbor's name return getCanonicalName(dstEdge->getName()); } } bool CConfig::hasNeighbor(const CString& srcName, EDirection srcSide) const { return hasNeighbor(srcName, srcSide, 0.0f, 1.0f); } bool CConfig::hasNeighbor(const CString& srcName, EDirection srcSide, float start, float end) const { assert(srcSide >= kFirstDirection && srcSide <= kLastDirection); // find source cell CCellMap::const_iterator index = m_map.find(getCanonicalName(srcName)); if (index == m_map.end()) { return false; } return index->second.overlaps(CCellEdge(srcSide, CInterval(start, end))); } CConfig::link_const_iterator CConfig::beginNeighbor(const CString& srcName) const { CCellMap::const_iterator index = m_map.find(getCanonicalName(srcName)); assert(index != m_map.end()); return index->second.begin(); } CConfig::link_const_iterator CConfig::endNeighbor(const CString& srcName) const { CCellMap::const_iterator index = m_map.find(getCanonicalName(srcName)); assert(index != m_map.end()); return index->second.end(); } const CNetworkAddress& CConfig::getSynergyAddress() const { return m_synergyAddress; } const CConfig::CScreenOptions* CConfig::getOptions(const CString& name) const { // find options const CScreenOptions* options = NULL; if (name.empty()) { options = &m_globalOptions; } else { CCellMap::const_iterator index = m_map.find(name); if (index != m_map.end()) { options = &index->second.m_options; } } // return options return options; } bool CConfig::hasLockToScreenAction() const { return m_hasLockToScreenAction; } bool CConfig::operator==(const CConfig& x) const { if (m_synergyAddress != x.m_synergyAddress) { return false; } if (m_map.size() != x.m_map.size()) { return false; } if (m_nameToCanonicalName.size() != x.m_nameToCanonicalName.size()) { return false; } // compare global options if (m_globalOptions != x.m_globalOptions) { return false; } for (CCellMap::const_iterator index1 = m_map.begin(), index2 = x.m_map.begin(); index1 != m_map.end(); ++index1, ++index2) { // compare names if (!CStringUtil::CaselessCmp::equal(index1->first, index2->first)) { return false; } // compare cells if (index1->second != index2->second) { return false; } } for (CNameMap::const_iterator index1 = m_nameToCanonicalName.begin(), index2 = x.m_nameToCanonicalName.begin(); index1 != m_nameToCanonicalName.end(); ++index1, ++index2) { if (!CStringUtil::CaselessCmp::equal(index1->first, index2->first) || !CStringUtil::CaselessCmp::equal(index1->second, index2->second)) { return false; } } // compare input filters if (m_inputFilter != x.m_inputFilter) { return false; } return true; } bool CConfig::operator!=(const CConfig& x) const { return !operator==(x); } void CConfig::read(CConfigReadContext& context) { CConfig tmp; while (context) { tmp.readSection(context); } *this = tmp; } const char* CConfig::dirName(EDirection dir) { static const char* s_name[] = { "left", "right", "up", "down" }; assert(dir >= kFirstDirection && dir <= kLastDirection); return s_name[dir - kFirstDirection]; } CInputFilter* CConfig::getInputFilter() { return &m_inputFilter; } CString CConfig::formatInterval(const CInterval& x) { if (x.first == 0.0f && x.second == 1.0f) { return ""; } return CStringUtil::print("(%d,%d)", (int)(x.first * 100.0f + 0.5f), (int)(x.second * 100.0f + 0.5f)); } void CConfig::readSection(CConfigReadContext& s) { static const char s_section[] = "section:"; static const char s_options[] = "options"; static const char s_screens[] = "screens"; static const char s_links[] = "links"; static const char s_aliases[] = "aliases"; CString line; if (!s.readLine(line)) { // no more sections return; } // should be a section header if (line.find(s_section) != 0) { throw XConfigRead(s, "found data outside section"); } // get section name CString::size_type i = line.find_first_not_of(" \t", sizeof(s_section) - 1); if (i == CString::npos) { throw XConfigRead(s, "section name is missing"); } CString name = line.substr(i); i = name.find_first_of(" \t"); if (i != CString::npos) { throw XConfigRead(s, "unexpected data after section name"); } // read section if (name == s_options) { readSectionOptions(s); } else if (name == s_screens) { readSectionScreens(s); } else if (name == s_links) { readSectionLinks(s); } else if (name == s_aliases) { readSectionAliases(s); } else { throw XConfigRead(s, "unknown section name \"%{1}\"", name); } } void CConfig::readSectionOptions(CConfigReadContext& s) { CString line; while (s.readLine(line)) { // check for end of section if (line == "end") { return; } // parse argument: `nameAndArgs = [values][;[values]]' // nameAndArgs := [(arg[,...])] // values := valueAndArgs[,valueAndArgs]... // valueAndArgs := [(arg[,...])] CString::size_type i = 0; CString name, value; CConfigReadContext::ArgList nameArgs, valueArgs; s.parseNameWithArgs("name", line, "=", i, name, nameArgs); ++i; s.parseNameWithArgs("value", line, ",;\n", i, value, valueArgs); bool handled = true; if (name == "address") { try { m_synergyAddress = CNetworkAddress(value, kDefaultPort); m_synergyAddress.resolve(); } catch (XSocketAddress& e) { throw XConfigRead(s, CString("invalid address argument ") + e.what()); } } else if (name == "heartbeat") { addOption("", kOptionHeartbeat, s.parseInt(value)); } else if (name == "switchCorners") { addOption("", kOptionScreenSwitchCorners, s.parseCorners(value)); } else if (name == "switchCornerSize") { addOption("", kOptionScreenSwitchCornerSize, s.parseInt(value)); } else if (name == "switchDelay") { addOption("", kOptionScreenSwitchDelay, s.parseInt(value)); } else if (name == "switchDoubleTap") { addOption("", kOptionScreenSwitchTwoTap, s.parseInt(value)); } else if (name == "switchNeedsShift") { addOption("", kOptionScreenSwitchNeedsShift, s.parseBoolean(value)); } else if (name == "switchNeedsControl") { addOption("", kOptionScreenSwitchNeedsControl, s.parseBoolean(value)); } else if (name == "switchNeedsAlt") { addOption("", kOptionScreenSwitchNeedsAlt, s.parseBoolean(value)); } else if (name == "screenSaverSync") { addOption("", kOptionScreenSaverSync, s.parseBoolean(value)); } else if (name == "relativeMouseMoves") { addOption("", kOptionRelativeMouseMoves, s.parseBoolean(value)); } else if (name == "win32KeepForeground") { addOption("", kOptionWin32KeepForeground, s.parseBoolean(value)); } else { handled = false; } if (handled) { // make sure handled options aren't followed by more values if (i < line.size() && (line[i] == ',' || line[i] == ';')) { throw XConfigRead(s, "to many arguments to %s", name.c_str()); } } else { // make filter rule CInputFilter::CRule rule(parseCondition(s, name, nameArgs)); // save first action (if any) if (!value.empty() || line[i] != ';') { parseAction(s, value, valueArgs, rule, true); } // get remaining activate actions while (i < line.length() && line[i] != ';') { ++i; s.parseNameWithArgs("value", line, ",;\n", i, value, valueArgs); parseAction(s, value, valueArgs, rule, true); } // get deactivate actions if (i < line.length() && line[i] == ';') { // allow trailing ';' i = line.find_first_not_of(" \t", i + 1); if (i == CString::npos) { i = line.length(); } else { --i; } // get actions while (i < line.length()) { ++i; s.parseNameWithArgs("value", line, ",\n", i, value, valueArgs); parseAction(s, value, valueArgs, rule, false); } } // add rule m_inputFilter.addFilterRule(rule); } } throw XConfigRead(s, "unexpected end of options section"); } void CConfig::readSectionScreens(CConfigReadContext& s) { CString line; CString screen; while (s.readLine(line)) { // check for end of section if (line == "end") { return; } // see if it's the next screen if (line[line.size() - 1] == ':') { // strip : screen = line.substr(0, line.size() - 1); // verify validity of screen name if (!isValidScreenName(screen)) { throw XConfigRead(s, "invalid screen name \"%{1}\"", screen); } // add the screen to the configuration if (!addScreen(screen)) { throw XConfigRead(s, "duplicate screen name \"%{1}\"", screen); } } else if (screen.empty()) { throw XConfigRead(s, "argument before first screen"); } else { // parse argument: `=' CString::size_type i = line.find_first_of(" \t="); if (i == 0) { throw XConfigRead(s, "missing argument name"); } if (i == CString::npos) { throw XConfigRead(s, "missing ="); } CString name = line.substr(0, i); i = line.find_first_not_of(" \t", i); if (i == CString::npos || line[i] != '=') { throw XConfigRead(s, "missing ="); } i = line.find_first_not_of(" \t", i + 1); CString value; if (i != CString::npos) { value = line.substr(i); } // handle argument if (name == "halfDuplexCapsLock") { addOption(screen, kOptionHalfDuplexCapsLock, s.parseBoolean(value)); } else if (name == "halfDuplexNumLock") { addOption(screen, kOptionHalfDuplexNumLock, s.parseBoolean(value)); } else if (name == "halfDuplexScrollLock") { addOption(screen, kOptionHalfDuplexScrollLock, s.parseBoolean(value)); } else if (name == "shift") { addOption(screen, kOptionModifierMapForShift, s.parseModifierKey(value)); } else if (name == "ctrl") { addOption(screen, kOptionModifierMapForControl, s.parseModifierKey(value)); } else if (name == "alt") { addOption(screen, kOptionModifierMapForAlt, s.parseModifierKey(value)); } else if (name == "altgr") { addOption(screen, kOptionModifierMapForAltGr, s.parseModifierKey(value)); } else if (name == "meta") { addOption(screen, kOptionModifierMapForMeta, s.parseModifierKey(value)); } else if (name == "super") { addOption(screen, kOptionModifierMapForSuper, s.parseModifierKey(value)); } else if (name == "xtestIsXineramaUnaware") { addOption(screen, kOptionXTestXineramaUnaware, s.parseBoolean(value)); } else if (name == "switchCorners") { addOption(screen, kOptionScreenSwitchCorners, s.parseCorners(value)); } else if (name == "switchCornerSize") { addOption(screen, kOptionScreenSwitchCornerSize, s.parseInt(value)); } else if (name == "preserveFocus") { addOption(screen, kOptionScreenPreserveFocus, s.parseBoolean(value)); } else { // unknown argument throw XConfigRead(s, "unknown argument \"%{1}\"", name); } } } throw XConfigRead(s, "unexpected end of screens section"); } void CConfig::readSectionLinks(CConfigReadContext& s) { CString line; CString screen; while (s.readLine(line)) { // check for end of section if (line == "end") { return; } // see if it's the next screen if (line[line.size() - 1] == ':') { // strip : screen = line.substr(0, line.size() - 1); // verify we know about the screen if (!isScreen(screen)) { throw XConfigRead(s, "unknown screen name \"%{1}\"", screen); } if (!isCanonicalName(screen)) { throw XConfigRead(s, "cannot use screen name alias here"); } } else if (screen.empty()) { throw XConfigRead(s, "argument before first screen"); } else { // parse argument: `[(,)]=[(,)]' // the stuff in brackets is optional. interval values must be // in the range [0,100] and start < end. if not given the // interval is taken to be (0,100). CString::size_type i = 0; CString side, dstScreen, srcArgString, dstArgString; CConfigReadContext::ArgList srcArgs, dstArgs; s.parseNameWithArgs("link", line, "=", i, side, srcArgs); ++i; s.parseNameWithArgs("screen", line, "", i, dstScreen, dstArgs); CInterval srcInterval(s.parseInterval(srcArgs)); CInterval dstInterval(s.parseInterval(dstArgs)); // handle argument EDirection dir; if (side == "left") { dir = kLeft; } else if (side == "right") { dir = kRight; } else if (side == "up") { dir = kTop; } else if (side == "down") { dir = kBottom; } else { // unknown argument throw XConfigRead(s, "unknown side \"%{1}\" in link", side); } if (!isScreen(dstScreen)) { throw XConfigRead(s, "unknown screen name \"%{1}\"", dstScreen); } if (!connect(screen, dir, srcInterval.first, srcInterval.second, dstScreen, dstInterval.first, dstInterval.second)) { throw XConfigRead(s, "overlapping range"); } } } throw XConfigRead(s, "unexpected end of links section"); } void CConfig::readSectionAliases(CConfigReadContext& s) { CString line; CString screen; while (s.readLine(line)) { // check for end of section if (line == "end") { return; } // see if it's the next screen if (line[line.size() - 1] == ':') { // strip : screen = line.substr(0, line.size() - 1); // verify we know about the screen if (!isScreen(screen)) { throw XConfigRead(s, "unknown screen name \"%{1}\"", screen); } if (!isCanonicalName(screen)) { throw XConfigRead(s, "cannot use screen name alias here"); } } else if (screen.empty()) { throw XConfigRead(s, "argument before first screen"); } else { // verify validity of screen name if (!isValidScreenName(line)) { throw XConfigRead(s, "invalid screen alias \"%{1}\"", line); } // add alias if (!addAlias(screen, line)) { throw XConfigRead(s, "alias \"%{1}\" is already used", line); } } } throw XConfigRead(s, "unexpected end of aliases section"); } CInputFilter::CCondition* CConfig::parseCondition(CConfigReadContext& s, const CString& name, const std::vector& args) { if (name == "keystroke") { if (args.size() != 1) { throw XConfigRead(s, "syntax for condition: keystroke(modifiers+key)"); } IPlatformScreen::CKeyInfo* keyInfo = s.parseKeystroke(args[0]); return new CInputFilter::CKeystrokeCondition(keyInfo); } if (name == "mousebutton") { if (args.size() != 1) { throw XConfigRead(s, "syntax for condition: mousebutton(modifiers+button)"); } IPlatformScreen::CButtonInfo* mouseInfo = s.parseMouse(args[0]); return new CInputFilter::CMouseButtonCondition(mouseInfo); } if (name == "connect") { if (args.size() != 1) { throw XConfigRead(s, "syntax for condition: connect([screen])"); } CString screen = args[0]; if (isScreen(screen)) { screen = getCanonicalName(screen); } else if (!screen.empty()) { throw XConfigRead(s, "unknown screen name \"%{1}\" in connect", screen); } return new CInputFilter::CScreenConnectedCondition(screen); } throw XConfigRead(s, "unknown argument \"%{1}\"", name); } void CConfig::parseAction(CConfigReadContext& s, const CString& name, const std::vector& args, CInputFilter::CRule& rule, bool activate) { CInputFilter::CAction* action; if (name == "keystroke" || name == "keyDown" || name == "keyUp") { if (args.size() < 1 || args.size() > 2) { throw XConfigRead(s, "syntax for action: keystroke(modifiers+key[,screens])"); } IPlatformScreen::CKeyInfo* keyInfo; if (args.size() == 1) { keyInfo = s.parseKeystroke(args[0]); } else { std::set screens; parseScreens(s, args[1], screens); keyInfo = s.parseKeystroke(args[0], screens); } if (name == "keystroke") { IPlatformScreen::CKeyInfo* keyInfo2 = IKeyState::CKeyInfo::alloc(*keyInfo); action = new CInputFilter::CKeystrokeAction(keyInfo2, true); rule.adoptAction(action, true); action = new CInputFilter::CKeystrokeAction(keyInfo, false); activate = false; } else if (name == "keyDown") { action = new CInputFilter::CKeystrokeAction(keyInfo, true); } else { action = new CInputFilter::CKeystrokeAction(keyInfo, false); } } else if (name == "mousebutton" || name == "mouseDown" || name == "mouseUp") { if (args.size() != 1) { throw XConfigRead(s, "syntax for action: mousebutton(modifiers+button)"); } IPlatformScreen::CButtonInfo* mouseInfo = s.parseMouse(args[0]); if (name == "mousebutton") { IPlatformScreen::CButtonInfo* mouseInfo2 = IPlatformScreen::CButtonInfo::alloc(*mouseInfo); action = new CInputFilter::CMouseButtonAction(mouseInfo2, true); rule.adoptAction(action, true); action = new CInputFilter::CMouseButtonAction(mouseInfo, false); activate = false; } else if (name == "mouseDown") { action = new CInputFilter::CMouseButtonAction(mouseInfo, true); } else { action = new CInputFilter::CMouseButtonAction(mouseInfo, false); } } /* XXX -- not supported else if (name == "modifier") { if (args.size() != 1) { throw XConfigRead(s, "syntax for action: modifier(modifiers)"); } KeyModifierMask mask = s.parseModifier(args[0]); action = new CInputFilter::CModifierAction(mask, ~mask); } */ else if (name == "switchToScreen") { if (args.size() != 1) { throw XConfigRead(s, "syntax for action: switchToScreen(name)"); } CString screen = args[0]; if (isScreen(screen)) { screen = getCanonicalName(screen); } else if (!screen.empty()) { throw XConfigRead(s, "unknown screen name in switchToScreen"); } action = new CInputFilter::CSwitchToScreenAction(screen); } else if (name == "switchInDirection") { if (args.size() != 1) { throw XConfigRead(s, "syntax for action: switchInDirection()"); } EDirection direction; if (args[0] == "left") { direction = kLeft; } else if (args[0] == "right") { direction = kRight; } else if (args[0] == "up") { direction = kTop; } else if (args[0] == "down") { direction = kBottom; } else { throw XConfigRead(s, "unknown direction \"%{1}\" in switchToScreen", args[0]); } action = new CInputFilter::CSwitchInDirectionAction(direction); } else if (name == "lockCursorToScreen") { if (args.size() > 1) { throw XConfigRead(s, "syntax for action: lockCursorToScreen([{off|on|toggle}])"); } CInputFilter::CLockCursorToScreenAction::Mode mode = CInputFilter::CLockCursorToScreenAction::kToggle; if (args.size() == 1) { if (args[0] == "off") { mode = CInputFilter::CLockCursorToScreenAction::kOff; } else if (args[0] == "on") { mode = CInputFilter::CLockCursorToScreenAction::kOn; } else if (args[0] == "toggle") { mode = CInputFilter::CLockCursorToScreenAction::kToggle; } else { throw XConfigRead(s, "syntax for action: lockCursorToScreen([{off|on|toggle}])"); } } if (mode != CInputFilter::CLockCursorToScreenAction::kOff) { m_hasLockToScreenAction = true; } action = new CInputFilter::CLockCursorToScreenAction(mode); } else if (name == "keyboardBroadcast") { if (args.size() > 2) { throw XConfigRead(s, "syntax for action: keyboardBroadcast([{off|on|toggle}[,screens]])"); } CInputFilter::CKeyboardBroadcastAction::Mode mode = CInputFilter::CKeyboardBroadcastAction::kToggle; if (args.size() >= 1) { if (args[0] == "off") { mode = CInputFilter::CKeyboardBroadcastAction::kOff; } else if (args[0] == "on") { mode = CInputFilter::CKeyboardBroadcastAction::kOn; } else if (args[0] == "toggle") { mode = CInputFilter::CKeyboardBroadcastAction::kToggle; } else { throw XConfigRead(s, "syntax for action: keyboardBroadcast([{off|on|toggle}[,screens]])"); } } std::set screens; if (args.size() >= 2) { parseScreens(s, args[1], screens); } action = new CInputFilter::CKeyboardBroadcastAction(mode, screens); } else { throw XConfigRead(s, "unknown action argument \"%{1}\"", name); } rule.adoptAction(action, activate); } void CConfig::parseScreens(CConfigReadContext& c, const CString& s, std::set& screens) const { screens.clear(); CString::size_type i = 0; while (i < s.size()) { // find end of next screen name CString::size_type j = s.find(':', i); if (j == CString::npos) { j = s.size(); } // extract name CString rawName; i = s.find_first_not_of(" \t", i); if (i < j) { rawName = s.substr(i, s.find_last_not_of(" \t", j - 1) - i + 1); } // add name if (rawName == "*") { screens.insert("*"); } else if (!rawName.empty()) { CString name = getCanonicalName(rawName); if (name.empty()) { throw XConfigRead(c, "unknown screen name \"%{1}\"", rawName); } screens.insert(name); } // next i = j + 1; } } const char* CConfig::getOptionName(OptionID id) { if (id == kOptionHalfDuplexCapsLock) { return "halfDuplexCapsLock"; } if (id == kOptionHalfDuplexNumLock) { return "halfDuplexNumLock"; } if (id == kOptionHalfDuplexScrollLock) { return "halfDuplexScrollLock"; } if (id == kOptionModifierMapForShift) { return "shift"; } if (id == kOptionModifierMapForControl) { return "ctrl"; } if (id == kOptionModifierMapForAlt) { return "alt"; } if (id == kOptionModifierMapForAltGr) { return "altgr"; } if (id == kOptionModifierMapForMeta) { return "meta"; } if (id == kOptionModifierMapForSuper) { return "super"; } if (id == kOptionHeartbeat) { return "heartbeat"; } if (id == kOptionScreenSwitchCorners) { return "switchCorners"; } if (id == kOptionScreenSwitchCornerSize) { return "switchCornerSize"; } if (id == kOptionScreenSwitchDelay) { return "switchDelay"; } if (id == kOptionScreenSwitchTwoTap) { return "switchDoubleTap"; } if (id == kOptionScreenSwitchNeedsShift) { return "switchNeedsShift"; } if (id == kOptionScreenSwitchNeedsControl) { return "switchNeedsControl"; } if (id == kOptionScreenSwitchNeedsAlt) { return "switchNeedsAlt"; } if (id == kOptionScreenSaverSync) { return "screenSaverSync"; } if (id == kOptionXTestXineramaUnaware) { return "xtestIsXineramaUnaware"; } if (id == kOptionRelativeMouseMoves) { return "relativeMouseMoves"; } if (id == kOptionWin32KeepForeground) { return "win32KeepForeground"; } if (id == kOptionScreenPreserveFocus) { return "preserveFocus"; } return NULL; } CString CConfig::getOptionValue(OptionID id, OptionValue value) { if (id == kOptionHalfDuplexCapsLock || id == kOptionHalfDuplexNumLock || id == kOptionHalfDuplexScrollLock || id == kOptionScreenSwitchNeedsShift || id == kOptionScreenSwitchNeedsControl || id == kOptionScreenSwitchNeedsAlt || id == kOptionScreenSaverSync || id == kOptionXTestXineramaUnaware || id == kOptionRelativeMouseMoves || id == kOptionWin32KeepForeground || id == kOptionScreenPreserveFocus) { return (value != 0) ? "true" : "false"; } if (id == kOptionModifierMapForShift || id == kOptionModifierMapForControl || id == kOptionModifierMapForAlt || id == kOptionModifierMapForAltGr || id == kOptionModifierMapForMeta || id == kOptionModifierMapForSuper) { switch (value) { case kKeyModifierIDShift: return "shift"; case kKeyModifierIDControl: return "ctrl"; case kKeyModifierIDAlt: return "alt"; case kKeyModifierIDAltGr: return "altgr"; case kKeyModifierIDMeta: return "meta"; case kKeyModifierIDSuper: return "super"; default: return "none"; } } if (id == kOptionHeartbeat || id == kOptionScreenSwitchCornerSize || id == kOptionScreenSwitchDelay || id == kOptionScreenSwitchTwoTap) { return CStringUtil::print("%d", value); } if (id == kOptionScreenSwitchCorners) { std::string result("none"); if ((value & kTopLeftMask) != 0) { result += " +top-left"; } if ((value & kTopRightMask) != 0) { result += " +top-right"; } if ((value & kBottomLeftMask) != 0) { result += " +bottom-left"; } if ((value & kBottomRightMask) != 0) { result += " +bottom-right"; } return result; } return ""; } // // CConfig::CName // CConfig::CName::CName(CConfig* config, const CString& name) : m_config(config), m_name(config->getCanonicalName(name)) { // do nothing } bool CConfig::CName::operator==(const CString& name) const { CString canonical = m_config->getCanonicalName(name); return CStringUtil::CaselessCmp::equal(canonical, m_name); } // // CConfig::CCellEdge // CConfig::CCellEdge::CCellEdge(EDirection side, float position) { init("", side, CInterval(position, position)); } CConfig::CCellEdge::CCellEdge(EDirection side, const CInterval& interval) { assert(interval.first >= 0.0f); assert(interval.second <= 1.0f); assert(interval.first < interval.second); init("", side, interval); } CConfig::CCellEdge::CCellEdge(const CString& name, EDirection side, const CInterval& interval) { assert(interval.first >= 0.0f); assert(interval.second <= 1.0f); assert(interval.first < interval.second); init(name, side, interval); } CConfig::CCellEdge::~CCellEdge() { // do nothing } void CConfig::CCellEdge::init(const CString& name, EDirection side, const CInterval& interval) { assert(side != kNoDirection); m_name = name; m_side = side; m_interval = interval; } CConfig::CInterval CConfig::CCellEdge::getInterval() const { return m_interval; } void CConfig::CCellEdge::setName(const CString& newName) { m_name = newName; } CString CConfig::CCellEdge::getName() const { return m_name; } EDirection CConfig::CCellEdge::getSide() const { return m_side; } bool CConfig::CCellEdge::overlaps(const CCellEdge& edge) const { const CInterval& x = m_interval; const CInterval& y = edge.m_interval; if (m_side != edge.m_side) { return false; } return (x.first >= y.first && x.first < y.second) || (x.second > y.first && x.second <= y.second) || (y.first >= x.first && y.first < x.second) || (y.second > x.first && y.second <= x.second); } bool CConfig::CCellEdge::isInside(float x) const { return (x >= m_interval.first && x < m_interval.second); } float CConfig::CCellEdge::transform(float x) const { return (x - m_interval.first) / (m_interval.second - m_interval.first); } float CConfig::CCellEdge::inverseTransform(float x) const { return x * (m_interval.second - m_interval.first) + m_interval.first; } bool CConfig::CCellEdge::operator<(const CCellEdge& o) const { if (static_cast(m_side) < static_cast(o.m_side)) { return true; } else if (static_cast(m_side) > static_cast(o.m_side)) { return false; } return (m_interval.first < o.m_interval.first); } bool CConfig::CCellEdge::operator==(const CCellEdge& x) const { return (m_side == x.m_side && m_interval == x.m_interval); } bool CConfig::CCellEdge::operator!=(const CCellEdge& x) const { return !operator==(x); } // // CConfig::CCell // bool CConfig::CCell::add(const CCellEdge& src, const CCellEdge& dst) { // cannot add an edge that overlaps other existing edges but we // can exactly replace an edge. if (!hasEdge(src) && overlaps(src)) { return false; } m_neighbors.erase(src); m_neighbors.insert(std::make_pair(src, dst)); return true; } void CConfig::CCell::remove(EDirection side) { for (CEdgeLinks::iterator j = m_neighbors.begin(); j != m_neighbors.end(); ) { if (j->first.getSide() == side) { m_neighbors.erase(j++); } else { ++j; } } } void CConfig::CCell::remove(EDirection side, float position) { for (CEdgeLinks::iterator j = m_neighbors.begin(); j != m_neighbors.end(); ++j) { if (j->first.getSide() == side && j->first.isInside(position)) { m_neighbors.erase(j); break; } } } void CConfig::CCell::remove(const CName& name) { for (CEdgeLinks::iterator j = m_neighbors.begin(); j != m_neighbors.end(); ) { if (name == j->second.getName()) { m_neighbors.erase(j++); } else { ++j; } } } void CConfig::CCell::rename(const CName& oldName, const CString& newName) { for (CEdgeLinks::iterator j = m_neighbors.begin(); j != m_neighbors.end(); ++j) { if (oldName == j->second.getName()) { j->second.setName(newName); } } } bool CConfig::CCell::hasEdge(const CCellEdge& edge) const { CEdgeLinks::const_iterator i = m_neighbors.find(edge); return (i != m_neighbors.end() && i->first == edge); } bool CConfig::CCell::overlaps(const CCellEdge& edge) const { CEdgeLinks::const_iterator i = m_neighbors.upper_bound(edge); if (i != m_neighbors.end() && i->first.overlaps(edge)) { return true; } if (i != m_neighbors.begin() && (--i)->first.overlaps(edge)) { return true; } return false; } bool CConfig::CCell::getLink(EDirection side, float position, const CCellEdge*& src, const CCellEdge*& dst) const { CCellEdge edge(side, position); CEdgeLinks::const_iterator i = m_neighbors.upper_bound(edge); if (i == m_neighbors.begin()) { return false; } --i; if (i->first.getSide() == side && i->first.isInside(position)) { src = &i->first; dst = &i->second; return true; } return false; } bool CConfig::CCell::operator==(const CCell& x) const { // compare options if (m_options != x.m_options) { return false; } // compare links if (m_neighbors.size() != x.m_neighbors.size()) { return false; } for (CEdgeLinks::const_iterator index1 = m_neighbors.begin(), index2 = x.m_neighbors.begin(); index1 != m_neighbors.end(); ++index1, ++index2) { if (index1->first != index2->first) { return false; } if (index1->second != index2->second) { return false; } // operator== doesn't compare names. only compare destination // names. if (!CStringUtil::CaselessCmp::equal(index1->second.getName(), index2->second.getName())) { return false; } } return true; } bool CConfig::CCell::operator!=(const CCell& x) const { return !operator==(x); } CConfig::CCell::const_iterator CConfig::CCell::begin() const { return m_neighbors.begin(); } CConfig::CCell::const_iterator CConfig::CCell::end() const { return m_neighbors.end(); } // // CConfig I/O // std::istream& operator>>(std::istream& s, CConfig& config) { CConfigReadContext context(s); config.read(context); return s; } std::ostream& operator<<(std::ostream& s, const CConfig& config) { // screens section s << "section: screens" << std::endl; for (CConfig::const_iterator screen = config.begin(); screen != config.end(); ++screen) { s << "\t" << screen->c_str() << ":" << std::endl; const CConfig::CScreenOptions* options = config.getOptions(*screen); if (options != NULL && options->size() > 0) { for (CConfig::CScreenOptions::const_iterator option = options->begin(); option != options->end(); ++option) { const char* name = CConfig::getOptionName(option->first); CString value = CConfig::getOptionValue(option->first, option->second); if (name != NULL && !value.empty()) { s << "\t\t" << name << " = " << value << std::endl; } } } } s << "end" << std::endl; // links section CString neighbor; s << "section: links" << std::endl; for (CConfig::const_iterator screen = config.begin(); screen != config.end(); ++screen) { s << "\t" << screen->c_str() << ":" << std::endl; for (CConfig::link_const_iterator link = config.beginNeighbor(*screen), nend = config.endNeighbor(*screen); link != nend; ++link) { s << "\t\t" << CConfig::dirName(link->first.getSide()) << CConfig::formatInterval(link->first.getInterval()) << " = " << link->second.getName().c_str() << CConfig::formatInterval(link->second.getInterval()) << std::endl; } } s << "end" << std::endl; // aliases section (if there are any) if (config.m_map.size() != config.m_nameToCanonicalName.size()) { // map canonical to alias typedef std::multimap CMNameMap; CMNameMap aliases; for (CConfig::CNameMap::const_iterator index = config.m_nameToCanonicalName.begin(); index != config.m_nameToCanonicalName.end(); ++index) { if (index->first != index->second) { aliases.insert(std::make_pair(index->second, index->first)); } } // dump it CString screen; s << "section: aliases" << std::endl; for (CMNameMap::const_iterator index = aliases.begin(); index != aliases.end(); ++index) { if (index->first != screen) { screen = index->first; s << "\t" << screen.c_str() << ":" << std::endl; } s << "\t\t" << index->second.c_str() << std::endl; } s << "end" << std::endl; } // options section s << "section: options" << std::endl; const CConfig::CScreenOptions* options = config.getOptions(""); if (options != NULL && options->size() > 0) { for (CConfig::CScreenOptions::const_iterator option = options->begin(); option != options->end(); ++option) { const char* name = CConfig::getOptionName(option->first); CString value = CConfig::getOptionValue(option->first, option->second); if (name != NULL && !value.empty()) { s << "\t" << name << " = " << value << std::endl; } } } if (config.m_synergyAddress.isValid()) { s << "\taddress = " << config.m_synergyAddress.getHostname().c_str() << std::endl; } s << config.m_inputFilter.format("\t"); s << "end" << std::endl; return s; } // // CConfigReadContext // CConfigReadContext::CConfigReadContext(std::istream& s, SInt32 firstLine) : m_stream(s), m_line(firstLine - 1) { // do nothing } CConfigReadContext::~CConfigReadContext() { // do nothing } bool CConfigReadContext::readLine(CString& line) { ++m_line; while (std::getline(m_stream, line)) { // strip leading whitespace CString::size_type i = line.find_first_not_of(" \t"); if (i != CString::npos) { line.erase(0, i); } // strip comments and then trailing whitespace i = line.find('#'); if (i != CString::npos) { line.erase(i); } i = line.find_last_not_of(" \r\t"); if (i != CString::npos) { line.erase(i + 1); } // return non empty line if (!line.empty()) { // make sure there are no invalid characters for (i = 0; i < line.length(); ++i) { if (!isgraph(line[i]) && line[i] != ' ' && line[i] != '\t') { throw XConfigRead(*this, "invalid character %{1}", CStringUtil::print("%#2x", line[i])); } } return true; } // next line ++m_line; } return false; } UInt32 CConfigReadContext::getLineNumber() const { return m_line; } CConfigReadContext::operator void*() const { return m_stream; } bool CConfigReadContext::operator!() const { return !m_stream; } OptionValue CConfigReadContext::parseBoolean(const CString& arg) const { if (CStringUtil::CaselessCmp::equal(arg, "true")) { return static_cast(true); } if (CStringUtil::CaselessCmp::equal(arg, "false")) { return static_cast(false); } throw XConfigRead(*this, "invalid boolean argument \"%{1}\"", arg); } OptionValue CConfigReadContext::parseInt(const CString& arg) const { const char* s = arg.c_str(); char* end; long tmp = strtol(s, &end, 10); if (*end != '\0') { // invalid characters throw XConfigRead(*this, "invalid integer argument \"%{1}\"", arg); } OptionValue value = static_cast(tmp); if (value != tmp) { // out of range throw XConfigRead(*this, "integer argument \"%{1}\" out of range", arg); } return value; } OptionValue CConfigReadContext::parseModifierKey(const CString& arg) const { if (CStringUtil::CaselessCmp::equal(arg, "shift")) { return static_cast(kKeyModifierIDShift); } if (CStringUtil::CaselessCmp::equal(arg, "ctrl")) { return static_cast(kKeyModifierIDControl); } if (CStringUtil::CaselessCmp::equal(arg, "alt")) { return static_cast(kKeyModifierIDAlt); } if (CStringUtil::CaselessCmp::equal(arg, "altgr")) { return static_cast(kKeyModifierIDAltGr); } if (CStringUtil::CaselessCmp::equal(arg, "meta")) { return static_cast(kKeyModifierIDMeta); } if (CStringUtil::CaselessCmp::equal(arg, "super")) { return static_cast(kKeyModifierIDSuper); } if (CStringUtil::CaselessCmp::equal(arg, "none")) { return static_cast(kKeyModifierIDNull); } throw XConfigRead(*this, "invalid argument \"%{1}\"", arg); } OptionValue CConfigReadContext::parseCorner(const CString& arg) const { if (CStringUtil::CaselessCmp::equal(arg, "left")) { return kTopLeftMask | kBottomLeftMask; } else if (CStringUtil::CaselessCmp::equal(arg, "right")) { return kTopRightMask | kBottomRightMask; } else if (CStringUtil::CaselessCmp::equal(arg, "top")) { return kTopLeftMask | kTopRightMask; } else if (CStringUtil::CaselessCmp::equal(arg, "bottom")) { return kBottomLeftMask | kBottomRightMask; } else if (CStringUtil::CaselessCmp::equal(arg, "top-left")) { return kTopLeftMask; } else if (CStringUtil::CaselessCmp::equal(arg, "top-right")) { return kTopRightMask; } else if (CStringUtil::CaselessCmp::equal(arg, "bottom-left")) { return kBottomLeftMask; } else if (CStringUtil::CaselessCmp::equal(arg, "bottom-right")) { return kBottomRightMask; } else if (CStringUtil::CaselessCmp::equal(arg, "none")) { return kNoCornerMask; } else if (CStringUtil::CaselessCmp::equal(arg, "all")) { return kAllCornersMask; } throw XConfigRead(*this, "invalid argument \"%{1}\"", arg); } OptionValue CConfigReadContext::parseCorners(const CString& args) const { // find first token CString::size_type i = args.find_first_not_of(" \t", 0); if (i == CString::npos) { throw XConfigRead(*this, "missing corner argument"); } CString::size_type j = args.find_first_of(" \t", i); // parse first corner token OptionValue corners = parseCorner(args.substr(i, j - i)); // get +/- i = args.find_first_not_of(" \t", j); while (i != CString::npos) { // parse +/- bool add; if (args[i] == '-') { add = false; } else if (args[i] == '+') { add = true; } else { throw XConfigRead(*this, "invalid corner operator \"%{1}\"", CString(args.c_str() + i, 1)); } // get next corner token i = args.find_first_not_of(" \t", i + 1); j = args.find_first_of(" \t", i); if (i == CString::npos) { throw XConfigRead(*this, "missing corner argument"); } // parse next corner token if (add) { corners |= parseCorner(args.substr(i, j - i)); } else { corners &= ~parseCorner(args.substr(i, j - i)); } i = args.find_first_not_of(" \t", j); } return corners; } CConfig::CInterval CConfigReadContext::parseInterval(const ArgList& args) const { if (args.size() == 0) { return CConfig::CInterval(0.0f, 1.0f); } if (args.size() != 2 || args[0].empty() || args[1].empty()) { throw XConfigRead(*this, "invalid interval \"%{1}\"", concatArgs(args)); } char* end; long startValue = strtol(args[0].c_str(), &end, 10); if (end[0] != '\0') { throw XConfigRead(*this, "invalid interval \"%{1}\"", concatArgs(args)); } long endValue = strtol(args[1].c_str(), &end, 10); if (end[0] != '\0') { throw XConfigRead(*this, "invalid interval \"%{1}\"", concatArgs(args)); } if (startValue < 0 || startValue > 100 || endValue < 0 || endValue > 100 || startValue >= endValue) { throw XConfigRead(*this, "invalid interval \"%{1}\"", concatArgs(args)); } return CConfig::CInterval(startValue / 100.0f, endValue / 100.0f); } void CConfigReadContext::parseNameWithArgs( const CString& type, const CString& line, const CString& delim, CString::size_type& index, CString& name, ArgList& args) const { // skip leading whitespace CString::size_type i = line.find_first_not_of(" \t", index); if (i == CString::npos) { throw XConfigRead(*this, CString("missing ") + type); } // find end of name CString::size_type j = line.find_first_of(" \t(" + delim, i); if (j == CString::npos) { j = line.length(); } // save name name = line.substr(i, j - i); args.clear(); // is it okay to not find a delimiter? bool needDelim = (!delim.empty() && delim.find('\n') == CString::npos); // skip whitespace i = line.find_first_not_of(" \t", j); if (i == CString::npos && needDelim) { // expected delimiter but didn't find it throw XConfigRead(*this, CString("missing ") + delim[0]); } if (i == CString::npos) { // no arguments index = line.length(); return; } if (line[i] != '(') { // no arguments index = i; return; } // eat '(' ++i; // parse arguments j = line.find_first_of(",)", i); while (j != CString::npos) { // extract arg CString arg(line.substr(i, j - i)); i = j; // trim whitespace j = arg.find_first_not_of(" \t"); if (j != CString::npos) { arg.erase(0, j); } j = arg.find_last_not_of(" \t"); if (j != CString::npos) { arg.erase(j + 1); } // save arg args.push_back(arg); // exit loop at end of arguments if (line[i] == ')') { break; } // eat ',' ++i; // next j = line.find_first_of(",)", i); } // verify ')' if (j == CString::npos) { // expected ) throw XConfigRead(*this, "missing )"); } // eat ')' ++i; // skip whitespace j = line.find_first_not_of(" \t", i); if (j == CString::npos && needDelim) { // expected delimiter but didn't find it throw XConfigRead(*this, CString("missing ") + delim[0]); } // verify delimiter if (needDelim && delim.find(line[j]) == CString::npos) { throw XConfigRead(*this, CString("expected ") + delim[0]); } if (j == CString::npos) { j = line.length(); } index = j; return; } IPlatformScreen::CKeyInfo* CConfigReadContext::parseKeystroke(const CString& keystroke) const { return parseKeystroke(keystroke, std::set()); } IPlatformScreen::CKeyInfo* CConfigReadContext::parseKeystroke(const CString& keystroke, const std::set& screens) const { CString s = keystroke; KeyModifierMask mask; if (!CKeyMap::parseModifiers(s, mask)) { throw XConfigRead(*this, "unable to parse key modifiers"); } KeyID key; if (!CKeyMap::parseKey(s, key)) { throw XConfigRead(*this, "unable to parse key"); } if (key == kKeyNone && mask == 0) { throw XConfigRead(*this, "missing key and/or modifiers in keystroke"); } return IPlatformScreen::CKeyInfo::alloc(key, mask, 0, 0, screens); } IPlatformScreen::CButtonInfo* CConfigReadContext::parseMouse(const CString& mouse) const { CString s = mouse; KeyModifierMask mask; if (!CKeyMap::parseModifiers(s, mask)) { throw XConfigRead(*this, "unable to parse button modifiers"); } char* end; ButtonID button = (ButtonID)strtol(s.c_str(), &end, 10); if (*end != '\0') { throw XConfigRead(*this, "unable to parse button"); } if (s.empty() || button <= 0) { throw XConfigRead(*this, "invalid button"); } return IPlatformScreen::CButtonInfo::alloc(button, mask); } KeyModifierMask CConfigReadContext::parseModifier(const CString& modifiers) const { CString s = modifiers; KeyModifierMask mask; if (!CKeyMap::parseModifiers(s, mask)) { throw XConfigRead(*this, "unable to parse modifiers"); } if (mask == 0) { throw XConfigRead(*this, "no modifiers specified"); } return mask; } CString CConfigReadContext::concatArgs(const ArgList& args) { CString s("("); for (size_t i = 0; i < args.size(); ++i) { if (i != 0) { s += ","; } s += args[i]; } s += ")"; return s; } // // CConfig I/O exceptions // XConfigRead::XConfigRead(const CConfigReadContext& context, const CString& error) : m_error(CStringUtil::print("line %d: %s", context.getLineNumber(), error.c_str())) { // do nothing } XConfigRead::XConfigRead(const CConfigReadContext& context, const char* errorFmt, const CString& arg) : m_error(CStringUtil::print("line %d: ", context.getLineNumber()) + CStringUtil::format(errorFmt, arg.c_str())) { // do nothing } XConfigRead::~XConfigRead() { // do nothing } CString XConfigRead::getWhat() const throw() { return format("XConfigRead", "read error: %{1}", m_error.c_str()); } synergy-1.4.12-Source/src/lib/server/CConfig.h0000600000175000017500000003570512021261364021042 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCONFIG_H #define CCONFIG_H #include "OptionTypes.h" #include "ProtocolTypes.h" #include "CNetworkAddress.h" #include "CStringUtil.h" #include "CInputFilter.h" #include "XBase.h" #include "stdmap.h" #include "stdset.h" #include "IPlatformScreen.h" #include class CConfig; class CConfigReadContext; namespace std { template <> struct iterator_traits { typedef CString value_type; typedef ptrdiff_t difference_type; typedef bidirectional_iterator_tag iterator_category; typedef CString* pointer; typedef CString& reference; }; }; //! Server configuration /*! This class holds server configuration information. That includes the names of screens and their aliases, the links between them, and network addresses. Note that case is preserved in screen names but is ignored when comparing names. Screen names and their aliases share a namespace and must be unique. */ class CConfig { public: typedef std::map CScreenOptions; typedef std::pair CInterval; class CCellEdge { public: CCellEdge(EDirection side, float position); CCellEdge(EDirection side, const CInterval&); CCellEdge(const CString& name, EDirection side, const CInterval&); ~CCellEdge(); CInterval getInterval() const; void setName(const CString& newName); CString getName() const; EDirection getSide() const; bool overlaps(const CCellEdge&) const; bool isInside(float x) const; // transform position to [0,1] float transform(float x) const; // transform [0,1] to position float inverseTransform(float x) const; // compares side and start of interval bool operator<(const CCellEdge&) const; // compares side and interval bool operator==(const CCellEdge&) const; bool operator!=(const CCellEdge&) const; private: void init(const CString& name, EDirection side, const CInterval&); private: CString m_name; EDirection m_side; CInterval m_interval; }; private: class CName { public: CName(CConfig*, const CString& name); bool operator==(const CString& name) const; private: CConfig* m_config; CString m_name; }; class CCell { private: typedef std::map CEdgeLinks; public: typedef CEdgeLinks::const_iterator const_iterator; bool add(const CCellEdge& src, const CCellEdge& dst); void remove(EDirection side); void remove(EDirection side, float position); void remove(const CName& destinationName); void rename(const CName& oldName, const CString& newName); bool hasEdge(const CCellEdge&) const; bool overlaps(const CCellEdge&) const; bool getLink(EDirection side, float position, const CCellEdge*& src, const CCellEdge*& dst) const; bool operator==(const CCell&) const; bool operator!=(const CCell&) const; const_iterator begin() const; const_iterator end() const; private: CEdgeLinks m_neighbors; public: CScreenOptions m_options; }; typedef std::map CCellMap; typedef std::map CNameMap; public: typedef CCell::const_iterator link_const_iterator; typedef CCellMap::const_iterator internal_const_iterator; typedef CNameMap::const_iterator all_const_iterator; class const_iterator : std::iterator_traits { public: explicit const_iterator() : m_i() { } explicit const_iterator(const internal_const_iterator& i) : m_i(i) { } const_iterator& operator=(const const_iterator& i) { m_i = i.m_i; return *this; } CString operator*() { return m_i->first; } const CString* operator->() { return &(m_i->first); } const_iterator& operator++() { ++m_i; return *this; } const_iterator operator++(int) { return const_iterator(m_i++); } const_iterator& operator--() { --m_i; return *this; } const_iterator operator--(int) { return const_iterator(m_i--); } bool operator==(const const_iterator& i) const { return (m_i == i.m_i); } bool operator!=(const const_iterator& i) const { return (m_i != i.m_i); } private: internal_const_iterator m_i; }; CConfig(); virtual ~CConfig(); //! @name manipulators //@{ //! Add screen /*! Adds a screen, returning true iff successful. If a screen or alias with the given name exists then it fails. */ bool addScreen(const CString& name); //! Rename screen /*! Renames a screen. All references to the name are updated. Returns true iff successful. */ bool renameScreen(const CString& oldName, const CString& newName); //! Remove screen /*! Removes a screen. This also removes aliases for the screen and disconnects any connections to the screen. \c name may be an alias. */ void removeScreen(const CString& name); //! Remove all screens /*! Removes all screens, aliases, and connections. */ void removeAllScreens(); //! Add alias /*! Adds an alias for a screen name. An alias can be used any place the canonical screen name can (except addScreen()). Returns false if the alias name already exists or the canonical name is unknown, otherwise returns true. */ bool addAlias(const CString& canonical, const CString& alias); //! Remove alias /*! Removes an alias for a screen name. It returns false if the alias is unknown or a canonical name, otherwise returns true. */ bool removeAlias(const CString& alias); //! Remove aliases /*! Removes all aliases for a canonical screen name. It returns false if the canonical name is unknown, otherwise returns true. */ bool removeAliases(const CString& canonical); //! Remove all aliases /*! This removes all aliases but not the screens. */ void removeAllAliases(); //! Connect screens /*! Establishes a one-way connection between portions of opposite edges of two screens. Each portion is described by an interval defined by two numbers, the start and end of the interval half-open on the end. The numbers range from 0 to 1, inclusive, for the left/top to the right/bottom. The user will be able to jump from the \c srcStart to \c srcSend interval of \c srcSide of screen \c srcName to the opposite side of screen \c dstName in the interval \c dstStart and \c dstEnd when both screens are connected to the server and the user isn't locked to a screen. Returns false if \c srcName is unknown. \c srcStart must be less than or equal to \c srcEnd and \c dstStart must be less then or equal to \c dstEnd and all of \c srcStart, \c srcEnd, \c dstStart, or \c dstEnd must be inside the range [0,1]. */ bool connect(const CString& srcName, EDirection srcSide, float srcStart, float srcEnd, const CString& dstName, float dstStart, float dstEnd); //! Disconnect screens /*! Removes all connections created by connect() on side \c srcSide. Returns false if \c srcName is unknown. */ bool disconnect(const CString& srcName, EDirection srcSide); //! Disconnect screens /*! Removes the connections created by connect() on side \c srcSide covering position \c position. Returns false if \c srcName is unknown. */ bool disconnect(const CString& srcName, EDirection srcSide, float position); //! Set server address /*! Set the synergy listen addresses. There is no default address so this must be called to run a server using this configuration. */ void setSynergyAddress(const CNetworkAddress&); //! Add a screen option /*! Adds an option and its value to the named screen. Replaces the existing option's value if there is one. Returns true iff \c name is a known screen. */ bool addOption(const CString& name, OptionID option, OptionValue value); //! Remove a screen option /*! Removes an option and its value from the named screen. Does nothing if the option doesn't exist on the screen. Returns true iff \c name is a known screen. */ bool removeOption(const CString& name, OptionID option); //! Remove a screen options /*! Removes all options and values from the named screen. Returns true iff \c name is a known screen. */ bool removeOptions(const CString& name); //! Get the hot key input filter /*! Returns the hot key input filter. Clients can modify hotkeys using that object. */ CInputFilter* getInputFilter(); //@} //! @name accessors //@{ //! Test screen name validity /*! Returns true iff \c name is a valid screen name. */ bool isValidScreenName(const CString& name) const; //! Get beginning (canonical) screen name iterator const_iterator begin() const; //! Get ending (canonical) screen name iterator const_iterator end() const; //! Get beginning screen name iterator all_const_iterator beginAll() const; //! Get ending screen name iterator all_const_iterator endAll() const; //! Test for screen name /*! Returns true iff \c name names a screen. */ bool isScreen(const CString& name) const; //! Test for canonical screen name /*! Returns true iff \c name is the canonical name of a screen. */ bool isCanonicalName(const CString& name) const; //! Get canonical name /*! Returns the canonical name of a screen or the empty string if the name is unknown. Returns the canonical name if one is given. */ CString getCanonicalName(const CString& name) const; //! Get neighbor /*! Returns the canonical screen name of the neighbor in the given direction (set through connect()) at position \c position. Returns the empty string if there is no neighbor in that direction, otherwise saves the position on the neighbor in \c positionOut if it's not \c NULL. */ CString getNeighbor(const CString&, EDirection, float position, float* positionOut) const; //! Check for neighbor /*! Returns \c true if the screen has a neighbor anywhere along the edge given by the direction. */ bool hasNeighbor(const CString&, EDirection) const; //! Check for neighbor /*! Returns \c true if the screen has a neighbor in the given range along the edge given by the direction. */ bool hasNeighbor(const CString&, EDirection, float start, float end) const; //! Get beginning neighbor iterator link_const_iterator beginNeighbor(const CString&) const; //! Get ending neighbor iterator link_const_iterator endNeighbor(const CString&) const; //! Get the server address const CNetworkAddress& getSynergyAddress() const; //! Get the screen options /*! Returns all the added options for the named screen. Returns NULL if the screen is unknown and an empty collection if there are no options. */ const CScreenOptions* getOptions(const CString& name) const; //! Check for lock to screen action /*! Returns \c true if this configuration has a lock to screen action. This is for backwards compatible support of ScrollLock locking. */ bool hasLockToScreenAction() const; //! Compare configurations bool operator==(const CConfig&) const; //! Compare configurations bool operator!=(const CConfig&) const; //! Read configuration /*! Reads a configuration from a context. Throws XConfigRead on error and context is unchanged. */ void read(CConfigReadContext& context); //! Read configuration /*! Reads a configuration from a stream. Throws XConfigRead on error. */ friend std::istream& operator>>(std::istream&, CConfig&); //! Write configuration /*! Writes a configuration to a stream. */ friend std::ostream& operator<<(std::ostream&, const CConfig&); //! Get direction name /*! Returns the name of a direction (for debugging). */ static const char* dirName(EDirection); //! Get interval as string /*! Returns an interval as a parseable string. */ static CString formatInterval(const CInterval&); //@} private: void readSection(CConfigReadContext&); void readSectionOptions(CConfigReadContext&); void readSectionScreens(CConfigReadContext&); void readSectionLinks(CConfigReadContext&); void readSectionAliases(CConfigReadContext&); CInputFilter::CCondition* parseCondition(CConfigReadContext&, const CString& condition, const std::vector& args); void parseAction(CConfigReadContext&, const CString& action, const std::vector& args, CInputFilter::CRule&, bool activate); void parseScreens(CConfigReadContext&, const CString&, std::set& screens) const; static const char* getOptionName(OptionID); static CString getOptionValue(OptionID, OptionValue); private: CCellMap m_map; CNameMap m_nameToCanonicalName; CNetworkAddress m_synergyAddress; CScreenOptions m_globalOptions; CInputFilter m_inputFilter; bool m_hasLockToScreenAction; }; //! Configuration read context /*! Maintains a context when reading a configuration from a stream. */ class CConfigReadContext { public: typedef std::vector ArgList; CConfigReadContext(std::istream&, SInt32 firstLine = 1); ~CConfigReadContext(); bool readLine(CString&); UInt32 getLineNumber() const; operator void*() const; bool operator!() const; OptionValue parseBoolean(const CString&) const; OptionValue parseInt(const CString&) const; OptionValue parseModifierKey(const CString&) const; OptionValue parseCorner(const CString&) const; OptionValue parseCorners(const CString&) const; CConfig::CInterval parseInterval(const ArgList& args) const; void parseNameWithArgs( const CString& type, const CString& line, const CString& delim, CString::size_type& index, CString& name, ArgList& args) const; IPlatformScreen::CKeyInfo* parseKeystroke(const CString& keystroke) const; IPlatformScreen::CKeyInfo* parseKeystroke(const CString& keystroke, const std::set& screens) const; IPlatformScreen::CButtonInfo* parseMouse(const CString& mouse) const; KeyModifierMask parseModifier(const CString& modifiers) const; private: // not implemented CConfigReadContext& operator=(const CConfigReadContext&); static CString concatArgs(const ArgList& args); private: std::istream& m_stream; SInt32 m_line; }; //! Configuration stream read exception /*! Thrown when a configuration stream cannot be parsed. */ class XConfigRead : public XBase { public: XConfigRead(const CConfigReadContext& context, const CString&); XConfigRead(const CConfigReadContext& context, const char* errorFmt, const CString& arg); ~XConfigRead(); protected: // XBase overrides virtual CString getWhat() const throw(); private: CString m_error; }; #endif synergy-1.4.12-Source/src/lib/server/CInputFilter.cpp0000600000175000017500000006113412021261364022430 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2005 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CInputFilter.h" #include "CServer.h" #include "CPrimaryClient.h" #include "CKeyMap.h" #include "CEventQueue.h" #include "CLog.h" #include "TMethodEventJob.h" #include #include // ----------------------------------------------------------------------------- // Input Filter Condition Classes // ----------------------------------------------------------------------------- CInputFilter::CCondition::CCondition() { // do nothing } CInputFilter::CCondition::~CCondition() { // do nothing } void CInputFilter::CCondition::enablePrimary(CPrimaryClient*) { // do nothing } void CInputFilter::CCondition::disablePrimary(CPrimaryClient*) { // do nothing } CInputFilter::CKeystrokeCondition::CKeystrokeCondition( IPlatformScreen::CKeyInfo* info) : m_id(0), m_key(info->m_key), m_mask(info->m_mask) { free(info); } CInputFilter::CKeystrokeCondition::CKeystrokeCondition( KeyID key, KeyModifierMask mask) : m_id(0), m_key(key), m_mask(mask) { // do nothing } CInputFilter::CKeystrokeCondition::~CKeystrokeCondition() { // do nothing } KeyID CInputFilter::CKeystrokeCondition::getKey() const { return m_key; } KeyModifierMask CInputFilter::CKeystrokeCondition::getMask() const { return m_mask; } CInputFilter::CCondition* CInputFilter::CKeystrokeCondition::clone() const { return new CKeystrokeCondition(m_key, m_mask); } CString CInputFilter::CKeystrokeCondition::format() const { return CStringUtil::print("keystroke(%s)", CKeyMap::formatKey(m_key, m_mask).c_str()); } CInputFilter::EFilterStatus CInputFilter::CKeystrokeCondition::match(const CEvent& event) { EFilterStatus status; // check for hotkey events CEvent::Type type = event.getType(); if (type == IPrimaryScreen::getHotKeyDownEvent()) { status = kActivate; } else if (type == IPrimaryScreen::getHotKeyUpEvent()) { status = kDeactivate; } else { return kNoMatch; } // check if it's our hotkey IPrimaryScreen::CHotKeyInfo* kinfo = reinterpret_cast(event.getData()); if (kinfo->m_id != m_id) { return kNoMatch; } return status; } void CInputFilter::CKeystrokeCondition::enablePrimary(CPrimaryClient* primary) { m_id = primary->registerHotKey(m_key, m_mask); } void CInputFilter::CKeystrokeCondition::disablePrimary(CPrimaryClient* primary) { primary->unregisterHotKey(m_id); m_id = 0; } CInputFilter::CMouseButtonCondition::CMouseButtonCondition( IPlatformScreen::CButtonInfo* info) : m_button(info->m_button), m_mask(info->m_mask) { free(info); } CInputFilter::CMouseButtonCondition::CMouseButtonCondition( ButtonID button, KeyModifierMask mask) : m_button(button), m_mask(mask) { // do nothing } CInputFilter::CMouseButtonCondition::~CMouseButtonCondition() { // do nothing } ButtonID CInputFilter::CMouseButtonCondition::getButton() const { return m_button; } KeyModifierMask CInputFilter::CMouseButtonCondition::getMask() const { return m_mask; } CInputFilter::CCondition* CInputFilter::CMouseButtonCondition::clone() const { return new CMouseButtonCondition(m_button, m_mask); } CString CInputFilter::CMouseButtonCondition::format() const { CString key = CKeyMap::formatKey(kKeyNone, m_mask); if (!key.empty()) { key += "+"; } return CStringUtil::print("mousebutton(%s%d)", key.c_str(), m_button); } CInputFilter::EFilterStatus CInputFilter::CMouseButtonCondition::match(const CEvent& event) { static const KeyModifierMask s_ignoreMask = KeyModifierAltGr | KeyModifierCapsLock | KeyModifierNumLock | KeyModifierScrollLock; EFilterStatus status; // check for hotkey events CEvent::Type type = event.getType(); if (type == IPrimaryScreen::getButtonDownEvent()) { status = kActivate; } else if (type == IPrimaryScreen::getButtonUpEvent()) { status = kDeactivate; } else { return kNoMatch; } // check if it's the right button and modifiers. ignore modifiers // that cannot be combined with a mouse button. IPlatformScreen::CButtonInfo* minfo = reinterpret_cast(event.getData()); if (minfo->m_button != m_button || (minfo->m_mask & ~s_ignoreMask) != m_mask) { return kNoMatch; } return status; } CInputFilter::CScreenConnectedCondition::CScreenConnectedCondition( const CString& screen) : m_screen(screen) { // do nothing } CInputFilter::CScreenConnectedCondition::~CScreenConnectedCondition() { // do nothing } CInputFilter::CCondition* CInputFilter::CScreenConnectedCondition::clone() const { return new CScreenConnectedCondition(m_screen); } CString CInputFilter::CScreenConnectedCondition::format() const { return CStringUtil::print("connect(%s)", m_screen.c_str()); } CInputFilter::EFilterStatus CInputFilter::CScreenConnectedCondition::match(const CEvent& event) { if (event.getType() == CServer::getConnectedEvent()) { CServer::CScreenConnectedInfo* info = reinterpret_cast(event.getData()); if (m_screen == info->m_screen || m_screen.empty()) { return kActivate; } } return kNoMatch; } // ----------------------------------------------------------------------------- // Input Filter Action Classes // ----------------------------------------------------------------------------- CInputFilter::CAction::CAction() { // do nothing } CInputFilter::CAction::~CAction() { // do nothing } CInputFilter::CLockCursorToScreenAction::CLockCursorToScreenAction(Mode mode) : m_mode(mode) { // do nothing } CInputFilter::CLockCursorToScreenAction::Mode CInputFilter::CLockCursorToScreenAction::getMode() const { return m_mode; } CInputFilter::CAction* CInputFilter::CLockCursorToScreenAction::clone() const { return new CLockCursorToScreenAction(*this); } CString CInputFilter::CLockCursorToScreenAction::format() const { static const char* s_mode[] = { "off", "on", "toggle" }; return CStringUtil::print("lockCursorToScreen(%s)", s_mode[m_mode]); } void CInputFilter::CLockCursorToScreenAction::perform(const CEvent& event) { static const CServer::CLockCursorToScreenInfo::State s_state[] = { CServer::CLockCursorToScreenInfo::kOff, CServer::CLockCursorToScreenInfo::kOn, CServer::CLockCursorToScreenInfo::kToggle }; // send event CServer::CLockCursorToScreenInfo* info = CServer::CLockCursorToScreenInfo::alloc(s_state[m_mode]); EVENTQUEUE->addEvent(CEvent(CServer::getLockCursorToScreenEvent(), event.getTarget(), info, CEvent::kDeliverImmediately)); } CInputFilter::CSwitchToScreenAction::CSwitchToScreenAction( const CString& screen) : m_screen(screen) { // do nothing } CString CInputFilter::CSwitchToScreenAction::getScreen() const { return m_screen; } CInputFilter::CAction* CInputFilter::CSwitchToScreenAction::clone() const { return new CSwitchToScreenAction(*this); } CString CInputFilter::CSwitchToScreenAction::format() const { return CStringUtil::print("switchToScreen(%s)", m_screen.c_str()); } void CInputFilter::CSwitchToScreenAction::perform(const CEvent& event) { // pick screen name. if m_screen is empty then use the screen from // event if it has one. CString screen = m_screen; if (screen.empty() && event.getType() == CServer::getConnectedEvent()) { CServer::CScreenConnectedInfo* info = reinterpret_cast(event.getData()); screen = info->m_screen; } // send event CServer::CSwitchToScreenInfo* info = CServer::CSwitchToScreenInfo::alloc(screen); EVENTQUEUE->addEvent(CEvent(CServer::getSwitchToScreenEvent(), event.getTarget(), info, CEvent::kDeliverImmediately)); } CInputFilter::CSwitchInDirectionAction::CSwitchInDirectionAction( EDirection direction) : m_direction(direction) { // do nothing } EDirection CInputFilter::CSwitchInDirectionAction::getDirection() const { return m_direction; } CInputFilter::CAction* CInputFilter::CSwitchInDirectionAction::clone() const { return new CSwitchInDirectionAction(*this); } CString CInputFilter::CSwitchInDirectionAction::format() const { static const char* s_names[] = { "", "left", "right", "up", "down" }; return CStringUtil::print("switchInDirection(%s)", s_names[m_direction]); } void CInputFilter::CSwitchInDirectionAction::perform(const CEvent& event) { CServer::CSwitchInDirectionInfo* info = CServer::CSwitchInDirectionInfo::alloc(m_direction); EVENTQUEUE->addEvent(CEvent(CServer::getSwitchInDirectionEvent(), event.getTarget(), info, CEvent::kDeliverImmediately)); } CInputFilter::CKeyboardBroadcastAction::CKeyboardBroadcastAction(Mode mode) : m_mode(mode) { // do nothing } CInputFilter::CKeyboardBroadcastAction::CKeyboardBroadcastAction( Mode mode, const std::set& screens) : m_mode(mode), m_screens(IKeyState::CKeyInfo::join(screens)) { // do nothing } CInputFilter::CKeyboardBroadcastAction::Mode CInputFilter::CKeyboardBroadcastAction::getMode() const { return m_mode; } std::set CInputFilter::CKeyboardBroadcastAction::getScreens() const { std::set screens; IKeyState::CKeyInfo::split(m_screens.c_str(), screens); return screens; } CInputFilter::CAction* CInputFilter::CKeyboardBroadcastAction::clone() const { return new CKeyboardBroadcastAction(*this); } CString CInputFilter::CKeyboardBroadcastAction::format() const { static const char* s_mode[] = { "off", "on", "toggle" }; static const char* s_name = "keyboardBroadcast"; if (m_screens.empty() || m_screens[0] == '*') { return CStringUtil::print("%s(%s)", s_name, s_mode[m_mode]); } else { return CStringUtil::print("%s(%s,%.*s)", s_name, s_mode[m_mode], m_screens.size() - 2, m_screens.c_str() + 1); } } void CInputFilter::CKeyboardBroadcastAction::perform(const CEvent& event) { static const CServer::CKeyboardBroadcastInfo::State s_state[] = { CServer::CKeyboardBroadcastInfo::kOff, CServer::CKeyboardBroadcastInfo::kOn, CServer::CKeyboardBroadcastInfo::kToggle }; // send event CServer::CKeyboardBroadcastInfo* info = CServer::CKeyboardBroadcastInfo::alloc(s_state[m_mode], m_screens); EVENTQUEUE->addEvent(CEvent(CServer::getKeyboardBroadcastEvent(), event.getTarget(), info, CEvent::kDeliverImmediately)); } CInputFilter::CKeystrokeAction::CKeystrokeAction( IPlatformScreen::CKeyInfo* info, bool press) : m_keyInfo(info), m_press(press) { // do nothing } CInputFilter::CKeystrokeAction::~CKeystrokeAction() { free(m_keyInfo); } void CInputFilter::CKeystrokeAction::adoptInfo(IPlatformScreen::CKeyInfo* info) { free(m_keyInfo); m_keyInfo = info; } const IPlatformScreen::CKeyInfo* CInputFilter::CKeystrokeAction::getInfo() const { return m_keyInfo; } bool CInputFilter::CKeystrokeAction::isOnPress() const { return m_press; } CInputFilter::CAction* CInputFilter::CKeystrokeAction::clone() const { IKeyState::CKeyInfo* info = IKeyState::CKeyInfo::alloc(*m_keyInfo); return new CKeystrokeAction(info, m_press); } CString CInputFilter::CKeystrokeAction::format() const { const char* type = formatName(); if (m_keyInfo->m_screens[0] == '\0') { return CStringUtil::print("%s(%s)", type, CKeyMap::formatKey(m_keyInfo->m_key, m_keyInfo->m_mask).c_str()); } else if (m_keyInfo->m_screens[0] == '*') { return CStringUtil::print("%s(%s,*)", type, CKeyMap::formatKey(m_keyInfo->m_key, m_keyInfo->m_mask).c_str()); } else { return CStringUtil::print("%s(%s,%.*s)", type, CKeyMap::formatKey(m_keyInfo->m_key, m_keyInfo->m_mask).c_str(), strlen(m_keyInfo->m_screens + 1) - 1, m_keyInfo->m_screens + 1); } } void CInputFilter::CKeystrokeAction::perform(const CEvent& event) { CEvent::Type type = m_press ? IPlatformScreen::getKeyDownEvent(*EVENTQUEUE) : IPlatformScreen::getKeyUpEvent(*EVENTQUEUE); EVENTQUEUE->addEvent(CEvent(IPlatformScreen::getFakeInputBeginEvent(), event.getTarget(), NULL, CEvent::kDeliverImmediately)); EVENTQUEUE->addEvent(CEvent(type, event.getTarget(), m_keyInfo, CEvent::kDeliverImmediately | CEvent::kDontFreeData)); EVENTQUEUE->addEvent(CEvent(IPlatformScreen::getFakeInputEndEvent(), event.getTarget(), NULL, CEvent::kDeliverImmediately)); } const char* CInputFilter::CKeystrokeAction::formatName() const { return (m_press ? "keyDown" : "keyUp"); } CInputFilter::CMouseButtonAction::CMouseButtonAction( IPlatformScreen::CButtonInfo* info, bool press) : m_buttonInfo(info), m_press(press) { // do nothing } CInputFilter::CMouseButtonAction::~CMouseButtonAction() { free(m_buttonInfo); } const IPlatformScreen::CButtonInfo* CInputFilter::CMouseButtonAction::getInfo() const { return m_buttonInfo; } bool CInputFilter::CMouseButtonAction::isOnPress() const { return m_press; } CInputFilter::CAction* CInputFilter::CMouseButtonAction::clone() const { IPlatformScreen::CButtonInfo* info = IPrimaryScreen::CButtonInfo::alloc(*m_buttonInfo); return new CMouseButtonAction(info, m_press); } CString CInputFilter::CMouseButtonAction::format() const { const char* type = formatName(); CString key = CKeyMap::formatKey(kKeyNone, m_buttonInfo->m_mask); return CStringUtil::print("%s(%s%s%d)", type, key.c_str(), key.empty() ? "" : "+", m_buttonInfo->m_button); } void CInputFilter::CMouseButtonAction::perform(const CEvent& event) { // send modifiers IPlatformScreen::CKeyInfo* modifierInfo = NULL; if (m_buttonInfo->m_mask != 0) { KeyID key = m_press ? kKeySetModifiers : kKeyClearModifiers; modifierInfo = IKeyState::CKeyInfo::alloc(key, m_buttonInfo->m_mask, 0, 1); EVENTQUEUE->addEvent(CEvent(IPlatformScreen::getKeyDownEvent(*EVENTQUEUE), event.getTarget(), modifierInfo, CEvent::kDeliverImmediately)); } // send button CEvent::Type type = m_press ? IPlatformScreen::getButtonDownEvent() : IPlatformScreen::getButtonUpEvent(); EVENTQUEUE->addEvent(CEvent(type, event.getTarget(), m_buttonInfo, CEvent::kDeliverImmediately | CEvent::kDontFreeData)); } const char* CInputFilter::CMouseButtonAction::formatName() const { return (m_press ? "mouseDown" : "mouseUp"); } // // CInputFilter::CRule // CInputFilter::CRule::CRule() : m_condition(NULL) { // do nothing } CInputFilter::CRule::CRule(CCondition* adoptedCondition) : m_condition(adoptedCondition) { // do nothing } CInputFilter::CRule::CRule(const CRule& rule) : m_condition(NULL) { copy(rule); } CInputFilter::CRule::~CRule() { clear(); } CInputFilter::CRule& CInputFilter::CRule::operator=(const CRule& rule) { if (&rule != this) { copy(rule); } return *this; } void CInputFilter::CRule::clear() { delete m_condition; for (CActionList::iterator i = m_activateActions.begin(); i != m_activateActions.end(); ++i) { delete *i; } for (CActionList::iterator i = m_deactivateActions.begin(); i != m_deactivateActions.end(); ++i) { delete *i; } m_condition = NULL; m_activateActions.clear(); m_deactivateActions.clear(); } void CInputFilter::CRule::copy(const CRule& rule) { clear(); if (rule.m_condition != NULL) { m_condition = rule.m_condition->clone(); } for (CActionList::const_iterator i = rule.m_activateActions.begin(); i != rule.m_activateActions.end(); ++i) { m_activateActions.push_back((*i)->clone()); } for (CActionList::const_iterator i = rule.m_deactivateActions.begin(); i != rule.m_deactivateActions.end(); ++i) { m_deactivateActions.push_back((*i)->clone()); } } void CInputFilter::CRule::setCondition(CCondition* adopted) { delete m_condition; m_condition = adopted; } void CInputFilter::CRule::adoptAction(CAction* action, bool onActivation) { if (action != NULL) { if (onActivation) { m_activateActions.push_back(action); } else { m_deactivateActions.push_back(action); } } } void CInputFilter::CRule::removeAction(bool onActivation, UInt32 index) { if (onActivation) { delete m_activateActions[index]; m_activateActions.erase(m_activateActions.begin() + index); } else { delete m_deactivateActions[index]; m_deactivateActions.erase(m_deactivateActions.begin() + index); } } void CInputFilter::CRule::replaceAction(CAction* adopted, bool onActivation, UInt32 index) { if (adopted == NULL) { removeAction(onActivation, index); } else if (onActivation) { delete m_activateActions[index]; m_activateActions[index] = adopted; } else { delete m_deactivateActions[index]; m_deactivateActions[index] = adopted; } } void CInputFilter::CRule::enable(CPrimaryClient* primaryClient) { if (m_condition != NULL) { m_condition->enablePrimary(primaryClient); } } void CInputFilter::CRule::disable(CPrimaryClient* primaryClient) { if (m_condition != NULL) { m_condition->disablePrimary(primaryClient); } } bool CInputFilter::CRule::handleEvent(const CEvent& event) { // NULL condition never matches if (m_condition == NULL) { return false; } // match const CActionList* actions; switch (m_condition->match(event)) { default: // not handled return false; case kActivate: actions = &m_activateActions; LOG((CLOG_DEBUG1 "activate actions")); break; case kDeactivate: actions = &m_deactivateActions; LOG((CLOG_DEBUG1 "deactivate actions")); break; } // perform actions for (CActionList::const_iterator i = actions->begin(); i != actions->end(); ++i) { LOG((CLOG_DEBUG1 "hotkey: %s", (*i)->format().c_str())); (*i)->perform(event); } return true; } CString CInputFilter::CRule::format() const { CString s; if (m_condition != NULL) { // condition s += m_condition->format(); s += " = "; // activate actions CActionList::const_iterator i = m_activateActions.begin(); if (i != m_activateActions.end()) { s += (*i)->format(); while (++i != m_activateActions.end()) { s += ", "; s += (*i)->format(); } } // deactivate actions if (!m_deactivateActions.empty()) { s += "; "; i = m_deactivateActions.begin(); if (i != m_deactivateActions.end()) { s += (*i)->format(); while (++i != m_deactivateActions.end()) { s += ", "; s += (*i)->format(); } } } } return s; } const CInputFilter::CCondition* CInputFilter::CRule::getCondition() const { return m_condition; } UInt32 CInputFilter::CRule::getNumActions(bool onActivation) const { if (onActivation) { return static_cast(m_activateActions.size()); } else { return static_cast(m_deactivateActions.size()); } } const CInputFilter::CAction& CInputFilter::CRule::getAction(bool onActivation, UInt32 index) const { if (onActivation) { return *m_activateActions[index]; } else { return *m_deactivateActions[index]; } } // ----------------------------------------------------------------------------- // Input Filter Class // ----------------------------------------------------------------------------- CInputFilter::CInputFilter() : m_primaryClient(NULL) { // do nothing } CInputFilter::CInputFilter(const CInputFilter& x) : m_ruleList(x.m_ruleList), m_primaryClient(NULL) { setPrimaryClient(x.m_primaryClient); } CInputFilter::~CInputFilter() { setPrimaryClient(NULL); } CInputFilter& CInputFilter::operator=(const CInputFilter& x) { if (&x != this) { CPrimaryClient* oldClient = m_primaryClient; setPrimaryClient(NULL); m_ruleList = x.m_ruleList; setPrimaryClient(oldClient); } return *this; } void CInputFilter::addFilterRule(const CRule& rule) { m_ruleList.push_back(rule); if (m_primaryClient != NULL) { m_ruleList.back().enable(m_primaryClient); } } void CInputFilter::removeFilterRule(UInt32 index) { if (m_primaryClient != NULL) { m_ruleList[index].disable(m_primaryClient); } m_ruleList.erase(m_ruleList.begin() + index); } CInputFilter::CRule& CInputFilter::getRule(UInt32 index) { return m_ruleList[index]; } void CInputFilter::setPrimaryClient(CPrimaryClient* client) { if (m_primaryClient == client) { return; } if (m_primaryClient != NULL) { for (CRuleList::iterator rule = m_ruleList.begin(); rule != m_ruleList.end(); ++rule) { rule->disable(m_primaryClient); } EVENTQUEUE->removeHandler(IPlatformScreen::getKeyDownEvent(*EVENTQUEUE), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getKeyUpEvent(*EVENTQUEUE), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getKeyRepeatEvent(*EVENTQUEUE), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getButtonDownEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getButtonUpEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getHotKeyDownEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getHotKeyUpEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(CServer::getConnectedEvent(), m_primaryClient->getEventTarget()); } m_primaryClient = client; if (m_primaryClient != NULL) { EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyDownEvent(*EVENTQUEUE), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyUpEvent(*EVENTQUEUE), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyRepeatEvent(*EVENTQUEUE), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getButtonDownEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getButtonUpEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getHotKeyDownEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getHotKeyUpEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); EVENTQUEUE->adoptHandler(CServer::getConnectedEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CInputFilter::handleEvent)); for (CRuleList::iterator rule = m_ruleList.begin(); rule != m_ruleList.end(); ++rule) { rule->enable(m_primaryClient); } } } CString CInputFilter::format(const CString& linePrefix) const { CString s; for (CRuleList::const_iterator i = m_ruleList.begin(); i != m_ruleList.end(); ++i) { s += linePrefix; s += i->format(); s += "\n"; } return s; } UInt32 CInputFilter::getNumRules() const { return static_cast(m_ruleList.size()); } bool CInputFilter::operator==(const CInputFilter& x) const { // if there are different numbers of rules then we can't be equal if (m_ruleList.size() != x.m_ruleList.size()) { return false; } // compare rule lists. the easiest way to do that is to format each // rule into a string, sort the strings, then compare the results. std::vector aList, bList; for (CRuleList::const_iterator i = m_ruleList.begin(); i != m_ruleList.end(); ++i) { aList.push_back(i->format()); } for (CRuleList::const_iterator i = x.m_ruleList.begin(); i != x.m_ruleList.end(); ++i) { bList.push_back(i->format()); } std::partial_sort(aList.begin(), aList.end(), aList.end()); std::partial_sort(bList.begin(), bList.end(), bList.end()); return (aList == bList); } bool CInputFilter::operator!=(const CInputFilter& x) const { return !operator==(x); } void CInputFilter::handleEvent(const CEvent& event, void*) { // copy event and adjust target CEvent myEvent(event.getType(), this, event.getData(), event.getFlags() | CEvent::kDontFreeData | CEvent::kDeliverImmediately); // let each rule try to match the event until one does for (CRuleList::iterator rule = m_ruleList.begin(); rule != m_ruleList.end(); ++rule) { if (rule->handleEvent(myEvent)) { // handled return; } } // not handled so pass through EVENTQUEUE->addEvent(myEvent); } synergy-1.4.12-Source/src/lib/server/CInputFilter.h0000600000175000017500000002054712021261364022100 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2005 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CINPUTFILTER_H #define CINPUTFILTER_H #include "KeyTypes.h" #include "MouseTypes.h" #include "ProtocolTypes.h" #include "IPlatformScreen.h" #include "CString.h" #include "stdmap.h" #include "stdset.h" class CPrimaryClient; class CEvent; class CInputFilter { public: // ------------------------------------------------------------------------- // Input Filter Condition Classes // ------------------------------------------------------------------------- enum EFilterStatus { kNoMatch, kActivate, kDeactivate }; class CCondition { public: CCondition(); virtual ~CCondition(); virtual CCondition* clone() const = 0; virtual CString format() const = 0; virtual EFilterStatus match(const CEvent&) = 0; virtual void enablePrimary(CPrimaryClient*); virtual void disablePrimary(CPrimaryClient*); }; // CKeystrokeCondition class CKeystrokeCondition : public CCondition { public: CKeystrokeCondition(IPlatformScreen::CKeyInfo*); CKeystrokeCondition(KeyID key, KeyModifierMask mask); virtual ~CKeystrokeCondition(); KeyID getKey() const; KeyModifierMask getMask() const; // CCondition overrides virtual CCondition* clone() const; virtual CString format() const; virtual EFilterStatus match(const CEvent&); virtual void enablePrimary(CPrimaryClient*); virtual void disablePrimary(CPrimaryClient*); private: UInt32 m_id; KeyID m_key; KeyModifierMask m_mask; }; // CMouseButtonCondition class CMouseButtonCondition : public CCondition { public: CMouseButtonCondition(IPlatformScreen::CButtonInfo*); CMouseButtonCondition(ButtonID, KeyModifierMask mask); virtual ~CMouseButtonCondition(); ButtonID getButton() const; KeyModifierMask getMask() const; // CCondition overrides virtual CCondition* clone() const; virtual CString format() const; virtual EFilterStatus match(const CEvent&); private: ButtonID m_button; KeyModifierMask m_mask; }; // CScreenConnectedCondition class CScreenConnectedCondition : public CCondition { public: CScreenConnectedCondition(const CString& screen); virtual ~CScreenConnectedCondition(); // CCondition overrides virtual CCondition* clone() const; virtual CString format() const; virtual EFilterStatus match(const CEvent&); private: CString m_screen; }; // ------------------------------------------------------------------------- // Input Filter Action Classes // ------------------------------------------------------------------------- class CAction { public: CAction(); virtual ~CAction(); virtual CAction* clone() const = 0; virtual CString format() const = 0; virtual void perform(const CEvent&) = 0; }; // CLockCursorToScreenAction class CLockCursorToScreenAction : public CAction { public: enum Mode { kOff, kOn, kToggle }; CLockCursorToScreenAction(Mode = kToggle); Mode getMode() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); private: Mode m_mode; }; // CSwitchToScreenAction class CSwitchToScreenAction : public CAction { public: CSwitchToScreenAction(const CString& screen); CString getScreen() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); private: CString m_screen; }; // CSwitchInDirectionAction class CSwitchInDirectionAction : public CAction { public: CSwitchInDirectionAction(EDirection); EDirection getDirection() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); private: EDirection m_direction; }; // CKeyboardBroadcastAction class CKeyboardBroadcastAction : public CAction { public: enum Mode { kOff, kOn, kToggle }; CKeyboardBroadcastAction(Mode = kToggle); CKeyboardBroadcastAction(Mode, const std::set& screens); Mode getMode() const; std::set getScreens() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); private: Mode m_mode; CString m_screens; }; // CKeystrokeAction class CKeystrokeAction : public CAction { public: CKeystrokeAction(IPlatformScreen::CKeyInfo* adoptedInfo, bool press); ~CKeystrokeAction(); void adoptInfo(IPlatformScreen::CKeyInfo*); const IPlatformScreen::CKeyInfo* getInfo() const; bool isOnPress() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); protected: virtual const char* formatName() const; private: IPlatformScreen::CKeyInfo* m_keyInfo; bool m_press; }; // CMouseButtonAction -- modifier combinations not implemented yet class CMouseButtonAction : public CAction { public: CMouseButtonAction(IPlatformScreen::CButtonInfo* adoptedInfo, bool press); ~CMouseButtonAction(); const IPlatformScreen::CButtonInfo* getInfo() const; bool isOnPress() const; // CAction overrides virtual CAction* clone() const; virtual CString format() const; virtual void perform(const CEvent&); protected: virtual const char* formatName() const; private: IPlatformScreen::CButtonInfo* m_buttonInfo; bool m_press; }; class CRule { public: CRule(); CRule(CCondition* adopted); CRule(const CRule&); ~CRule(); CRule& operator=(const CRule&); // replace the condition void setCondition(CCondition* adopted); // add an action to the rule void adoptAction(CAction*, bool onActivation); // remove an action from the rule void removeAction(bool onActivation, UInt32 index); // replace an action in the rule void replaceAction(CAction* adopted, bool onActivation, UInt32 index); // enable/disable void enable(CPrimaryClient*); void disable(CPrimaryClient*); // event handling bool handleEvent(const CEvent&); // convert rule to a string CString format() const; // get the rule's condition const CCondition* getCondition() const; // get number of actions UInt32 getNumActions(bool onActivation) const; // get action by index const CAction& getAction(bool onActivation, UInt32 index) const; private: void clear(); void copy(const CRule&); private: typedef std::vector CActionList; CCondition* m_condition; CActionList m_activateActions; CActionList m_deactivateActions; }; // ------------------------------------------------------------------------- // Input Filter Class // ------------------------------------------------------------------------- typedef std::vector CRuleList; CInputFilter(); CInputFilter(const CInputFilter&); virtual ~CInputFilter(); CInputFilter& operator=(const CInputFilter&); // add rule, adopting the condition and the actions void addFilterRule(const CRule& rule); // remove a rule void removeFilterRule(UInt32 index); // get rule by index CRule& getRule(UInt32 index); // enable event filtering using the given primary client. disable // if client is NULL. void setPrimaryClient(CPrimaryClient* client); // convert rules to a string CString format(const CString& linePrefix) const; // get number of rules UInt32 getNumRules() const; //! Compare filters bool operator==(const CInputFilter&) const; //! Compare filters bool operator!=(const CInputFilter&) const; private: // event handling void handleEvent(const CEvent&, void*); private: CRuleList m_ruleList; CPrimaryClient* m_primaryClient; }; #endif synergy-1.4.12-Source/src/lib/server/CMakeLists.txt0000600000175000017500000000312512127576354022127 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CBaseClientProxy.h CClientListener.h CClientProxy.h CClientProxy1_0.h CClientProxy1_1.h CClientProxy1_2.h CClientProxy1_3.h CClientProxy1_4.h CClientProxyUnknown.h CConfig.h CInputFilter.h CPrimaryClient.h CServer.h ) set(src CBaseClientProxy.cpp CClientListener.cpp CClientProxy.cpp CClientProxy1_0.cpp CClientProxy1_1.cpp CClientProxy1_2.cpp CClientProxy1_3.cpp CClientProxy1_4.cpp CClientProxyUnknown.cpp CConfig.cpp CInputFilter.cpp CPrimaryClient.cpp CServer.cpp ) if (WIN32) list(APPEND src ${inc}) endif() set(inc ../arch ../base ../common ../io ../mt ../net ../synergy ../../../tools ) if (UNIX) list(APPEND inc ../../.. ) endif() include_directories(${inc}) add_library(server STATIC ${src}) if (WIN32) if (GAME_DEVICE_SUPPORT) include_directories($ENV{DXSDK_DIR}/Include) endif() endif() if (UNIX) target_link_libraries(server synergy) endif() synergy-1.4.12-Source/src/lib/server/CPrimaryClient.cpp0000600000175000017500000001161112021261364022740 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CPrimaryClient.h" #include "CScreen.h" #include "CClipboard.h" #include "CLog.h" // // CPrimaryClient // CPrimaryClient::CPrimaryClient(const CString& name, CScreen* screen) : CBaseClientProxy(name), m_screen(screen), m_fakeInputCount(0) { // all clipboards are clean for (UInt32 i = 0; i < kClipboardEnd; ++i) { m_clipboardDirty[i] = false; } } CPrimaryClient::~CPrimaryClient() { // do nothing } void CPrimaryClient::reconfigure(UInt32 activeSides) { m_screen->reconfigure(activeSides); } UInt32 CPrimaryClient::registerHotKey(KeyID key, KeyModifierMask mask) { return m_screen->registerHotKey(key, mask); } void CPrimaryClient::unregisterHotKey(UInt32 id) { m_screen->unregisterHotKey(id); } void CPrimaryClient::fakeInputBegin() { if (++m_fakeInputCount == 1) { m_screen->fakeInputBegin(); } } void CPrimaryClient::fakeInputEnd() { if (--m_fakeInputCount == 0) { m_screen->fakeInputEnd(); } } SInt32 CPrimaryClient::getJumpZoneSize() const { return m_screen->getJumpZoneSize(); } void CPrimaryClient::getCursorCenter(SInt32& x, SInt32& y) const { m_screen->getCursorCenter(x, y); } KeyModifierMask CPrimaryClient::getToggleMask() const { return m_screen->pollActiveModifiers(); } bool CPrimaryClient::isLockedToScreen() const { return m_screen->isLockedToScreen(); } void* CPrimaryClient::getEventTarget() const { return m_screen->getEventTarget(); } bool CPrimaryClient::getClipboard(ClipboardID id, IClipboard* clipboard) const { return m_screen->getClipboard(id, clipboard); } void CPrimaryClient::getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const { m_screen->getShape(x, y, width, height); } void CPrimaryClient::getCursorPos(SInt32& x, SInt32& y) const { m_screen->getCursorPos(x, y); } void CPrimaryClient::enable() { m_screen->enable(); } void CPrimaryClient::disable() { m_screen->disable(); } void CPrimaryClient::enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool screensaver) { m_screen->setSequenceNumber(seqNum); if (!screensaver) { m_screen->warpCursor(xAbs, yAbs); } m_screen->enter(mask); } bool CPrimaryClient::leave() { return m_screen->leave(); } void CPrimaryClient::setClipboard(ClipboardID id, const IClipboard* clipboard) { // ignore if this clipboard is already clean if (m_clipboardDirty[id]) { // this clipboard is now clean m_clipboardDirty[id] = false; // set clipboard m_screen->setClipboard(id, clipboard); } } void CPrimaryClient::grabClipboard(ClipboardID id) { // grab clipboard m_screen->grabClipboard(id); // clipboard is dirty (because someone else owns it now) m_clipboardDirty[id] = true; } void CPrimaryClient::setClipboardDirty(ClipboardID id, bool dirty) { m_clipboardDirty[id] = dirty; } void CPrimaryClient::keyDown(KeyID key, KeyModifierMask mask, KeyButton button) { if (m_fakeInputCount > 0) { // XXX -- don't forward keystrokes to primary screen for now (void)key; (void)mask; (void)button; // m_screen->keyDown(key, mask, button); } } void CPrimaryClient::keyRepeat(KeyID, KeyModifierMask, SInt32, KeyButton) { // ignore } void CPrimaryClient::keyUp(KeyID key, KeyModifierMask mask, KeyButton button) { if (m_fakeInputCount > 0) { // XXX -- don't forward keystrokes to primary screen for now (void)key; (void)mask; (void)button; // m_screen->keyUp(key, mask, button); } } void CPrimaryClient::mouseDown(ButtonID) { // ignore } void CPrimaryClient::mouseUp(ButtonID) { // ignore } void CPrimaryClient::mouseMove(SInt32 x, SInt32 y) { m_screen->warpCursor(x, y); } void CPrimaryClient::mouseRelativeMove(SInt32, SInt32) { // ignore } void CPrimaryClient::mouseWheel(SInt32, SInt32) { // ignore } void CPrimaryClient::gameDeviceButtons(GameDeviceID, GameDeviceButton) { // ignore } void CPrimaryClient::gameDeviceSticks(GameDeviceID, SInt16, SInt16, SInt16, SInt16) { // ignore } void CPrimaryClient::gameDeviceTriggers(GameDeviceID, UInt8, UInt8) { // ignore } void CPrimaryClient::gameDeviceTimingReq() { // ignore } void CPrimaryClient::screensaver(bool) { // ignore } void CPrimaryClient::resetOptions() { m_screen->resetOptions(); } void CPrimaryClient::setOptions(const COptionsList& options) { m_screen->setOptions(options); } synergy-1.4.12-Source/src/lib/server/CPrimaryClient.h0000600000175000017500000001111512021261364022404 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CPRIMARYCLIENT_H #define CPRIMARYCLIENT_H #include "CBaseClientProxy.h" #include "ProtocolTypes.h" class CScreen; //! Primary screen as pseudo-client /*! The primary screen does not have a client associated with it. This class provides a pseudo-client to allow the primary screen to be treated as if it was a client. */ class CPrimaryClient : public CBaseClientProxy { public: /*! \c name is the name of the server and \p screen is primary screen. */ CPrimaryClient(const CString& name, CScreen* screen); ~CPrimaryClient(); //! @name manipulators //@{ //! Update configuration /*! Handles reconfiguration of jump zones. */ void reconfigure(UInt32 activeSides); //! Register a system hotkey /*! Registers a system-wide hotkey for key \p key with modifiers \p mask. Returns an id used to unregister the hotkey. */ UInt32 registerHotKey(KeyID key, KeyModifierMask mask); //! Unregister a system hotkey /*! Unregisters a previously registered hot key. */ void unregisterHotKey(UInt32 id); //! Prepare to synthesize input on primary screen /*! Prepares the primary screen to receive synthesized input. We do not want to receive this synthesized input as user input so this method ensures that we ignore it. Calls to \c fakeInputBegin() and \c fakeInputEnd() may be nested; only the outermost have an effect. */ void fakeInputBegin(); //! Done synthesizing input on primary screen /*! Undoes whatever \c fakeInputBegin() did. */ void fakeInputEnd(); //@} //! @name accessors //@{ //! Get jump zone size /*! Return the jump zone size, the size of the regions on the edges of the screen that cause the cursor to jump to another screen. */ SInt32 getJumpZoneSize() const; //! Get cursor center position /*! Return the cursor center position which is where we park the cursor to compute cursor motion deltas and should be far from the edges of the screen, typically the center. */ void getCursorCenter(SInt32& x, SInt32& y) const; //! Get toggle key state /*! Returns the primary screen's current toggle modifier key state. */ KeyModifierMask getToggleMask() const; //! Get screen lock state /*! Returns true if the user is locked to the screen. */ bool isLockedToScreen() const; //@} // FIXME -- these probably belong on IScreen virtual void enable(); virtual void disable(); // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; // IClient overrides virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver); virtual bool leave(); virtual void setClipboard(ClipboardID, const IClipboard*); virtual void grabClipboard(ClipboardID); virtual void setClipboardDirty(ClipboardID, bool); virtual void keyDown(KeyID, KeyModifierMask, KeyButton); virtual void keyRepeat(KeyID, KeyModifierMask, SInt32 count, KeyButton); virtual void keyUp(KeyID, KeyModifierMask, KeyButton); virtual void mouseDown(ButtonID); virtual void mouseUp(ButtonID); virtual void mouseMove(SInt32 xAbs, SInt32 yAbs); virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel); virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta); virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); virtual void gameDeviceTimingReq(); virtual void screensaver(bool activate); virtual void resetOptions(); virtual void setOptions(const COptionsList& options); private: CScreen* m_screen; bool m_clipboardDirty[kClipboardEnd]; SInt32 m_fakeInputCount; }; #endif synergy-1.4.12-Source/src/lib/server/CServer.cpp0000600000175000017500000016715012131062123021430 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CServer.h" #include "CClientProxy.h" #include "CClientProxyUnknown.h" #include "CPrimaryClient.h" #include "IPlatformScreen.h" #include "OptionTypes.h" #include "ProtocolTypes.h" #include "XScreen.h" #include "XSynergy.h" #include "IDataSocket.h" #include "IListenSocket.h" #include "XSocket.h" #include "IEventQueue.h" #include "CLog.h" #include "TMethodEventJob.h" #include "CArch.h" #include "CKeyState.h" #include #include #include "CScreen.h" // // CServer // CEvent::Type CServer::s_errorEvent = CEvent::kUnknown; CEvent::Type CServer::s_connectedEvent = CEvent::kUnknown; CEvent::Type CServer::s_disconnectedEvent = CEvent::kUnknown; CEvent::Type CServer::s_switchToScreen = CEvent::kUnknown; CEvent::Type CServer::s_switchInDirection = CEvent::kUnknown; CEvent::Type CServer::s_keyboardBroadcast = CEvent::kUnknown; CEvent::Type CServer::s_lockCursorToScreen = CEvent::kUnknown; CEvent::Type CServer::s_screenSwitched = CEvent::kUnknown; CServer::CServer(const CConfig& config, CPrimaryClient* primaryClient, CScreen* screen) : m_mock(false), m_primaryClient(primaryClient), m_active(primaryClient), m_seqNum(0), m_xDelta(0), m_yDelta(0), m_xDelta2(0), m_yDelta2(0), m_config(), m_inputFilter(m_config.getInputFilter()), m_activeSaver(NULL), m_switchDir(kNoDirection), m_switchScreen(NULL), m_switchWaitDelay(0.0), m_switchWaitTimer(NULL), m_switchTwoTapDelay(0.0), m_switchTwoTapEngaged(false), m_switchTwoTapArmed(false), m_switchTwoTapZone(3), m_switchNeedsShift(false), m_switchNeedsControl(false), m_switchNeedsAlt(false), m_relativeMoves(false), m_keyboardBroadcasting(false), m_lockedToScreen(false), m_screen(screen) { // must have a primary client and it must have a canonical name assert(m_primaryClient != NULL); assert(config.isScreen(primaryClient->getName())); assert(m_screen != NULL); CString primaryName = getName(primaryClient); // clear clipboards for (ClipboardID id = 0; id < kClipboardEnd; ++id) { CClipboardInfo& clipboard = m_clipboards[id]; clipboard.m_clipboardOwner = primaryName; clipboard.m_clipboardSeqNum = m_seqNum; if (clipboard.m_clipboard.open(0)) { clipboard.m_clipboard.empty(); clipboard.m_clipboard.close(); } clipboard.m_clipboardData = clipboard.m_clipboard.marshall(); } // install event handlers EVENTQUEUE->adoptHandler(CEvent::kTimer, this, new TMethodEventJob(this, &CServer::handleSwitchWaitTimeout)); EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyDownEvent(*EVENTQUEUE), m_inputFilter, new TMethodEventJob(this, &CServer::handleKeyDownEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyUpEvent(*EVENTQUEUE), m_inputFilter, new TMethodEventJob(this, &CServer::handleKeyUpEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getKeyRepeatEvent(* EVENTQUEUE), m_inputFilter, new TMethodEventJob(this, &CServer::handleKeyRepeatEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getButtonDownEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleButtonDownEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getButtonUpEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleButtonUpEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getMotionOnPrimaryEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleMotionPrimaryEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getMotionOnSecondaryEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleMotionSecondaryEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getWheelEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleWheelEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getGameDeviceButtonsEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleGameDeviceButtons)); EVENTQUEUE->adoptHandler(IPlatformScreen::getGameDeviceSticksEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleGameDeviceSticks)); EVENTQUEUE->adoptHandler(IPlatformScreen::getGameDeviceTriggersEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleGameDeviceTriggers)); EVENTQUEUE->adoptHandler(IPlatformScreen::getGameDeviceTimingReqEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleGameDeviceTimingReq)); EVENTQUEUE->adoptHandler(IPlatformScreen::getScreensaverActivatedEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleScreensaverActivatedEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getScreensaverDeactivatedEvent(), m_primaryClient->getEventTarget(), new TMethodEventJob(this, &CServer::handleScreensaverDeactivatedEvent)); EVENTQUEUE->adoptHandler(getSwitchToScreenEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleSwitchToScreenEvent)); EVENTQUEUE->adoptHandler(getSwitchInDirectionEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleSwitchInDirectionEvent)); EVENTQUEUE->adoptHandler(getKeyboardBroadcastEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleKeyboardBroadcastEvent)); EVENTQUEUE->adoptHandler(getLockCursorToScreenEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleLockCursorToScreenEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getFakeInputBeginEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleFakeInputBeginEvent)); EVENTQUEUE->adoptHandler(IPlatformScreen::getFakeInputEndEvent(), m_inputFilter, new TMethodEventJob(this, &CServer::handleFakeInputEndEvent)); // add connection addClient(m_primaryClient); // set initial configuration setConfig(config); // enable primary client m_primaryClient->enable(); m_inputFilter->setPrimaryClient(m_primaryClient); // Determine if scroll lock is already set. If so, lock the cursor to the primary screen int keyValue = m_primaryClient->getToggleMask (); if (m_primaryClient->getToggleMask () & KeyModifierScrollLock) { LOG((CLOG_DEBUG "scroll lock on initially. locked to screen")); m_lockedToScreen = true; } } CServer::~CServer() { if (m_mock) { return; } // remove event handlers and timers EVENTQUEUE->removeHandler(IPlatformScreen::getKeyDownEvent(*EVENTQUEUE), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getKeyUpEvent(*EVENTQUEUE), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getKeyRepeatEvent(*EVENTQUEUE), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getButtonDownEvent(), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getButtonUpEvent(), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getMotionOnPrimaryEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getMotionOnSecondaryEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getWheelEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getScreensaverActivatedEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getScreensaverDeactivatedEvent(), m_primaryClient->getEventTarget()); EVENTQUEUE->removeHandler(IPlatformScreen::getFakeInputBeginEvent(), m_inputFilter); EVENTQUEUE->removeHandler(IPlatformScreen::getFakeInputEndEvent(), m_inputFilter); EVENTQUEUE->removeHandler(CEvent::kTimer, this); stopSwitch(); // force immediate disconnection of secondary clients disconnect(); for (COldClients::iterator index = m_oldClients.begin(); index != m_oldClients.begin(); ++index) { CBaseClientProxy* client = index->first; EVENTQUEUE->deleteTimer(index->second); EVENTQUEUE->removeHandler(CEvent::kTimer, client); EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), client); delete client; } // remove input filter m_inputFilter->setPrimaryClient(NULL); // disable and disconnect primary client m_primaryClient->disable(); removeClient(m_primaryClient); } bool CServer::setConfig(const CConfig& config) { // refuse configuration if it doesn't include the primary screen if (!config.isScreen(m_primaryClient->getName())) { return false; } // close clients that are connected but being dropped from the // configuration. closeClients(config); // cut over m_config = config; processOptions(); // add ScrollLock as a hotkey to lock to the screen. this was a // built-in feature in earlier releases and is now supported via // the user configurable hotkey mechanism. if the user has already // registered ScrollLock for something else then that will win but // we will unfortunately generate a warning. if the user has // configured a CLockCursorToScreenAction then we don't add // ScrollLock as a hotkey. if (!m_config.hasLockToScreenAction()) { IPlatformScreen::CKeyInfo* key = IPlatformScreen::CKeyInfo::alloc(kKeyScrollLock, 0, 0, 0); CInputFilter::CRule rule(new CInputFilter::CKeystrokeCondition(key)); rule.adoptAction(new CInputFilter::CLockCursorToScreenAction, true); m_inputFilter->addFilterRule(rule); } // tell primary screen about reconfiguration m_primaryClient->reconfigure(getActivePrimarySides()); // tell all (connected) clients about current options for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { CBaseClientProxy* client = index->second; sendOptions(client); } return true; } void CServer::adoptClient(CBaseClientProxy* client) { assert(client != NULL); // watch for client disconnection EVENTQUEUE->adoptHandler(CClientProxy::getDisconnectedEvent(), client, new TMethodEventJob(this, &CServer::handleClientDisconnected, client)); // name must be in our configuration if (!m_config.isScreen(client->getName())) { LOG((CLOG_WARN "unrecognised client name \"%s\", check server config", client->getName().c_str())); closeClient(client, kMsgEUnknown); return; } // add client to client list if (!addClient(client)) { // can only have one screen with a given name at any given time LOG((CLOG_WARN "a client with name \"%s\" is already connected", getName(client).c_str())); closeClient(client, kMsgEBusy); return; } LOG((CLOG_NOTE "client \"%s\" has connected", getName(client).c_str())); // send configuration options to client sendOptions(client); // activate screen saver on new client if active on the primary screen if (m_activeSaver != NULL) { client->screensaver(true); } // send notification CServer::CScreenConnectedInfo* info = new CServer::CScreenConnectedInfo(getName(client)); EVENTQUEUE->addEvent(CEvent(CServer::getConnectedEvent(), m_primaryClient->getEventTarget(), info)); } void CServer::disconnect() { // close all secondary clients if (m_clients.size() > 1 || !m_oldClients.empty()) { CConfig emptyConfig; closeClients(emptyConfig); } else { EVENTQUEUE->addEvent(CEvent(getDisconnectedEvent(), this)); } } void CServer::gameDeviceTimingResp(UInt16 freq) { m_screen->gameDeviceTimingResp(freq); } void CServer::gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { m_screen->gameDeviceFeedback(id, m1, m2); } UInt32 CServer::getNumClients() const { return (SInt32)m_clients.size(); } void CServer::getClients(std::vector& list) const { list.clear(); for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { list.push_back(index->first); } } CEvent::Type CServer::getErrorEvent() { return EVENTQUEUE->registerTypeOnce(s_errorEvent, "CServer::error"); } CEvent::Type CServer::getConnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_connectedEvent, "CServer::connected"); } CEvent::Type CServer::getDisconnectedEvent() { return EVENTQUEUE->registerTypeOnce(s_disconnectedEvent, "CServer::disconnected"); } CEvent::Type CServer::getSwitchToScreenEvent() { return EVENTQUEUE->registerTypeOnce(s_switchToScreen, "CServer::switchToScreen"); } CEvent::Type CServer::getSwitchInDirectionEvent() { return EVENTQUEUE->registerTypeOnce(s_switchInDirection, "CServer::switchInDirection"); } CEvent::Type CServer::getKeyboardBroadcastEvent() { return EVENTQUEUE->registerTypeOnce(s_keyboardBroadcast, "CServer:keyboardBroadcast"); } CEvent::Type CServer::getLockCursorToScreenEvent() { return EVENTQUEUE->registerTypeOnce(s_lockCursorToScreen, "CServer::lockCursorToScreen"); } CEvent::Type CServer::getScreenSwitchedEvent() { return EVENTQUEUE->registerTypeOnce(s_screenSwitched, "CServer::screenSwitched"); } CString CServer::getName(const CBaseClientProxy* client) const { CString name = m_config.getCanonicalName(client->getName()); if (name.empty()) { name = client->getName(); } return name; } UInt32 CServer::getActivePrimarySides() const { UInt32 sides = 0; if (!isLockedToScreenServer()) { if (hasAnyNeighbor(m_primaryClient, kLeft)) { sides |= kLeftMask; } if (hasAnyNeighbor(m_primaryClient, kRight)) { sides |= kRightMask; } if (hasAnyNeighbor(m_primaryClient, kTop)) { sides |= kTopMask; } if (hasAnyNeighbor(m_primaryClient, kBottom)) { sides |= kBottomMask; } } return sides; } bool CServer::isLockedToScreenServer() const { // locked if scroll-lock is toggled on return m_lockedToScreen; } bool CServer::isLockedToScreen() const { // locked if we say we're locked if (isLockedToScreenServer()) { LOG((CLOG_DEBUG "locked to screen")); return true; } // locked if primary says we're locked if (m_primaryClient->isLockedToScreen()) { return true; } // not locked return false; } SInt32 CServer::getJumpZoneSize(CBaseClientProxy* client) const { if (client == m_primaryClient) { return m_primaryClient->getJumpZoneSize(); } else { return 0; } } void CServer::switchScreen(CBaseClientProxy* dst, SInt32 x, SInt32 y, bool forScreensaver) { assert(dst != NULL); #ifndef NDEBUG { SInt32 dx, dy, dw, dh; dst->getShape(dx, dy, dw, dh); assert(x >= dx && y >= dy && x < dx + dw && y < dy + dh); } #endif assert(m_active != NULL); LOG((CLOG_INFO "switch from \"%s\" to \"%s\" at %d,%d", getName(m_active).c_str(), getName(dst).c_str(), x, y)); // stop waiting to switch stopSwitch(); // record new position m_x = x; m_y = y; m_xDelta = 0; m_yDelta = 0; m_xDelta2 = 0; m_yDelta2 = 0; // wrapping means leaving the active screen and entering it again. // since that's a waste of time we skip that and just warp the // mouse. if (m_active != dst) { // leave active screen if (!m_active->leave()) { // cannot leave screen LOG((CLOG_WARN "can't leave screen")); return; } // update the primary client's clipboards if we're leaving the // primary screen. if (m_active == m_primaryClient) { for (ClipboardID id = 0; id < kClipboardEnd; ++id) { CClipboardInfo& clipboard = m_clipboards[id]; if (clipboard.m_clipboardOwner == getName(m_primaryClient)) { onClipboardChanged(m_primaryClient, id, clipboard.m_clipboardSeqNum); } } } // cut over m_active = dst; // increment enter sequence number ++m_seqNum; // enter new screen m_active->enter(x, y, m_seqNum, m_primaryClient->getToggleMask(), forScreensaver); // send the clipboard data to new active screen for (ClipboardID id = 0; id < kClipboardEnd; ++id) { m_active->setClipboard(id, &m_clipboards[id].m_clipboard); } CServer::CSwitchToScreenInfo* info = CServer::CSwitchToScreenInfo::alloc(m_active->getName()); EVENTQUEUE->addEvent(CEvent(CServer::getScreenSwitchedEvent(), this, info)); } else { m_active->mouseMove(x, y); } } void CServer::jumpToScreen(CBaseClientProxy* newScreen) { assert(newScreen != NULL); // record the current cursor position on the active screen m_active->setJumpCursorPos(m_x, m_y); // get the last cursor position on the target screen SInt32 x, y; newScreen->getJumpCursorPos(x, y); switchScreen(newScreen, x, y, false); } float CServer::mapToFraction(CBaseClientProxy* client, EDirection dir, SInt32 x, SInt32 y) const { SInt32 sx, sy, sw, sh; client->getShape(sx, sy, sw, sh); switch (dir) { case kLeft: case kRight: return static_cast(y - sy + 0.5f) / static_cast(sh); case kTop: case kBottom: return static_cast(x - sx + 0.5f) / static_cast(sw); case kNoDirection: assert(0 && "bad direction"); break; } return 0.0f; } void CServer::mapToPixel(CBaseClientProxy* client, EDirection dir, float f, SInt32& x, SInt32& y) const { SInt32 sx, sy, sw, sh; client->getShape(sx, sy, sw, sh); switch (dir) { case kLeft: case kRight: y = static_cast(f * sh) + sy; break; case kTop: case kBottom: x = static_cast(f * sw) + sx; break; case kNoDirection: assert(0 && "bad direction"); break; } } bool CServer::hasAnyNeighbor(CBaseClientProxy* client, EDirection dir) const { assert(client != NULL); return m_config.hasNeighbor(getName(client), dir); } CBaseClientProxy* CServer::getNeighbor(CBaseClientProxy* src, EDirection dir, SInt32& x, SInt32& y) const { // note -- must be locked on entry assert(src != NULL); // get source screen name CString srcName = getName(src); assert(!srcName.empty()); LOG((CLOG_DEBUG2 "find neighbor on %s of \"%s\"", CConfig::dirName(dir), srcName.c_str())); // convert position to fraction float t = mapToFraction(src, dir, x, y); // search for the closest neighbor that exists in direction dir float tTmp; for (;;) { CString dstName(m_config.getNeighbor(srcName, dir, t, &tTmp)); // if nothing in that direction then return NULL. if the // destination is the source then we can make no more // progress in this direction. since we haven't found a // connected neighbor we return NULL. if (dstName.empty()) { LOG((CLOG_DEBUG2 "no neighbor on %s of \"%s\"", CConfig::dirName(dir), srcName.c_str())); return NULL; } // look up neighbor cell. if the screen is connected and // ready then we can stop. CClientList::const_iterator index = m_clients.find(dstName); if (index != m_clients.end()) { LOG((CLOG_DEBUG2 "\"%s\" is on %s of \"%s\" at %f", dstName.c_str(), CConfig::dirName(dir), srcName.c_str(), t)); mapToPixel(index->second, dir, tTmp, x, y); return index->second; } // skip over unconnected screen LOG((CLOG_DEBUG2 "ignored \"%s\" on %s of \"%s\"", dstName.c_str(), CConfig::dirName(dir), srcName.c_str())); srcName = dstName; // use position on skipped screen t = tTmp; } } CBaseClientProxy* CServer::mapToNeighbor(CBaseClientProxy* src, EDirection srcSide, SInt32& x, SInt32& y) const { // note -- must be locked on entry assert(src != NULL); // get the first neighbor CBaseClientProxy* dst = getNeighbor(src, srcSide, x, y); if (dst == NULL) { return NULL; } // get the source screen's size SInt32 dx, dy, dw, dh; CBaseClientProxy* lastGoodScreen = src; lastGoodScreen->getShape(dx, dy, dw, dh); // find destination screen, adjusting x or y (but not both). the // searches are done in a sort of canonical screen space where // the upper-left corner is 0,0 for each screen. we adjust from // actual to canonical position on entry to and from canonical to // actual on exit from the search. switch (srcSide) { case kLeft: x -= dx; while (dst != NULL) { lastGoodScreen = dst; lastGoodScreen->getShape(dx, dy, dw, dh); x += dw; if (x >= 0) { break; } LOG((CLOG_DEBUG2 "skipping over screen %s", getName(dst).c_str())); dst = getNeighbor(lastGoodScreen, srcSide, x, y); } assert(lastGoodScreen != NULL); x += dx; break; case kRight: x -= dx; while (dst != NULL) { x -= dw; lastGoodScreen = dst; lastGoodScreen->getShape(dx, dy, dw, dh); if (x < dw) { break; } LOG((CLOG_DEBUG2 "skipping over screen %s", getName(dst).c_str())); dst = getNeighbor(lastGoodScreen, srcSide, x, y); } assert(lastGoodScreen != NULL); x += dx; break; case kTop: y -= dy; while (dst != NULL) { lastGoodScreen = dst; lastGoodScreen->getShape(dx, dy, dw, dh); y += dh; if (y >= 0) { break; } LOG((CLOG_DEBUG2 "skipping over screen %s", getName(dst).c_str())); dst = getNeighbor(lastGoodScreen, srcSide, x, y); } assert(lastGoodScreen != NULL); y += dy; break; case kBottom: y -= dy; while (dst != NULL) { y -= dh; lastGoodScreen = dst; lastGoodScreen->getShape(dx, dy, dw, dh); if (y < dh) { break; } LOG((CLOG_DEBUG2 "skipping over screen %s", getName(dst).c_str())); dst = getNeighbor(lastGoodScreen, srcSide, x, y); } assert(lastGoodScreen != NULL); y += dy; break; case kNoDirection: assert(0 && "bad direction"); return NULL; } // save destination screen assert(lastGoodScreen != NULL); dst = lastGoodScreen; // if entering primary screen then be sure to move in far enough // to avoid the jump zone. if entering a side that doesn't have // a neighbor (i.e. an asymmetrical side) then we don't need to // move inwards because that side can't provoke a jump. avoidJumpZone(dst, srcSide, x, y); return dst; } void CServer::avoidJumpZone(CBaseClientProxy* dst, EDirection dir, SInt32& x, SInt32& y) const { // we only need to avoid jump zones on the primary screen if (dst != m_primaryClient) { return; } const CString dstName(getName(dst)); SInt32 dx, dy, dw, dh; dst->getShape(dx, dy, dw, dh); float t = mapToFraction(dst, dir, x, y); SInt32 z = getJumpZoneSize(dst); // move in far enough to avoid the jump zone. if entering a side // that doesn't have a neighbor (i.e. an asymmetrical side) then we // don't need to move inwards because that side can't provoke a jump. switch (dir) { case kLeft: if (!m_config.getNeighbor(dstName, kRight, t, NULL).empty() && x > dx + dw - 1 - z) x = dx + dw - 1 - z; break; case kRight: if (!m_config.getNeighbor(dstName, kLeft, t, NULL).empty() && x < dx + z) x = dx + z; break; case kTop: if (!m_config.getNeighbor(dstName, kBottom, t, NULL).empty() && y > dy + dh - 1 - z) y = dy + dh - 1 - z; break; case kBottom: if (!m_config.getNeighbor(dstName, kTop, t, NULL).empty() && y < dy + z) y = dy + z; break; case kNoDirection: assert(0 && "bad direction"); } } bool CServer::isSwitchOkay(CBaseClientProxy* newScreen, EDirection dir, SInt32 x, SInt32 y, SInt32 xActive, SInt32 yActive) { LOG((CLOG_DEBUG1 "try to leave \"%s\" on %s", getName(m_active).c_str(), CConfig::dirName(dir))); // is there a neighbor? if (newScreen == NULL) { // there's no neighbor. we don't want to switch and we don't // want to try to switch later. LOG((CLOG_DEBUG1 "no neighbor %s", CConfig::dirName(dir))); stopSwitch(); return false; } // should we switch or not? bool preventSwitch = false; bool allowSwitch = false; // note if the switch direction has changed. save the new // direction and screen if so. bool isNewDirection = (dir != m_switchDir); if (isNewDirection || m_switchScreen == NULL) { m_switchDir = dir; m_switchScreen = newScreen; } // is this a double tap and do we care? if (!allowSwitch && m_switchTwoTapDelay > 0.0) { if (isNewDirection || !isSwitchTwoTapStarted() || !shouldSwitchTwoTap()) { // tapping a different or new edge or second tap not // fast enough. prepare for second tap. preventSwitch = true; startSwitchTwoTap(); } else { // got second tap allowSwitch = true; } } // if waiting before a switch then prepare to switch later if (!allowSwitch && m_switchWaitDelay > 0.0) { if (isNewDirection || !isSwitchWaitStarted()) { startSwitchWait(x, y); } preventSwitch = true; } // are we in a locked corner? first check if screen has the option set // and, if not, check the global options. const CConfig::CScreenOptions* options = m_config.getOptions(getName(m_active)); if (options == NULL || options->count(kOptionScreenSwitchCorners) == 0) { options = m_config.getOptions(""); } if (options != NULL && options->count(kOptionScreenSwitchCorners) > 0) { // get corner mask and size CConfig::CScreenOptions::const_iterator i = options->find(kOptionScreenSwitchCorners); UInt32 corners = static_cast(i->second); i = options->find(kOptionScreenSwitchCornerSize); SInt32 size = 0; if (i != options->end()) { size = i->second; } // see if we're in a locked corner if ((getCorner(m_active, xActive, yActive, size) & corners) != 0) { // yep, no switching LOG((CLOG_DEBUG1 "locked in corner")); preventSwitch = true; stopSwitch(); } } // ignore if mouse is locked to screen and don't try to switch later if (!preventSwitch && isLockedToScreen()) { LOG((CLOG_DEBUG1 "locked to screen")); preventSwitch = true; stopSwitch(); } // check for optional needed modifiers KeyModifierMask mods = this->m_primaryClient->getToggleMask( ); if (!preventSwitch && ( (this->m_switchNeedsShift && ((mods & KeyModifierShift) != KeyModifierShift)) || (this->m_switchNeedsControl && ((mods & KeyModifierControl) != KeyModifierControl)) || (this->m_switchNeedsAlt && ((mods & KeyModifierAlt) != KeyModifierAlt)) )) { LOG((CLOG_DEBUG1 "need modifiers to switch")); preventSwitch = true; stopSwitch(); } return !preventSwitch; } void CServer::noSwitch(SInt32 x, SInt32 y) { armSwitchTwoTap(x, y); stopSwitchWait(); } void CServer::stopSwitch() { if (m_switchScreen != NULL) { m_switchScreen = NULL; m_switchDir = kNoDirection; stopSwitchTwoTap(); stopSwitchWait(); } } void CServer::startSwitchTwoTap() { m_switchTwoTapEngaged = true; m_switchTwoTapArmed = false; m_switchTwoTapTimer.reset(); LOG((CLOG_DEBUG1 "waiting for second tap")); } void CServer::armSwitchTwoTap(SInt32 x, SInt32 y) { if (m_switchTwoTapEngaged) { if (m_switchTwoTapTimer.getTime() > m_switchTwoTapDelay) { // second tap took too long. disengage. stopSwitchTwoTap(); } else if (!m_switchTwoTapArmed) { // still time for a double tap. see if we left the tap // zone and, if so, arm the two tap. SInt32 ax, ay, aw, ah; m_active->getShape(ax, ay, aw, ah); SInt32 tapZone = m_primaryClient->getJumpZoneSize(); if (tapZone < m_switchTwoTapZone) { tapZone = m_switchTwoTapZone; } if (x >= ax + tapZone && x < ax + aw - tapZone && y >= ay + tapZone && y < ay + ah - tapZone) { // win32 can generate bogus mouse events that appear to // move in the opposite direction that the mouse actually // moved. try to ignore that crap here. switch (m_switchDir) { case kLeft: m_switchTwoTapArmed = (m_xDelta > 0 && m_xDelta2 > 0); break; case kRight: m_switchTwoTapArmed = (m_xDelta < 0 && m_xDelta2 < 0); break; case kTop: m_switchTwoTapArmed = (m_yDelta > 0 && m_yDelta2 > 0); break; case kBottom: m_switchTwoTapArmed = (m_yDelta < 0 && m_yDelta2 < 0); break; default: break; } } } } } void CServer::stopSwitchTwoTap() { m_switchTwoTapEngaged = false; m_switchTwoTapArmed = false; } bool CServer::isSwitchTwoTapStarted() const { return m_switchTwoTapEngaged; } bool CServer::shouldSwitchTwoTap() const { // this is the second tap if two-tap is armed and this tap // came fast enough return (m_switchTwoTapArmed && m_switchTwoTapTimer.getTime() <= m_switchTwoTapDelay); } void CServer::startSwitchWait(SInt32 x, SInt32 y) { stopSwitchWait(); m_switchWaitX = x; m_switchWaitY = y; m_switchWaitTimer = EVENTQUEUE->newOneShotTimer(m_switchWaitDelay, this); LOG((CLOG_DEBUG1 "waiting to switch")); } void CServer::stopSwitchWait() { if (m_switchWaitTimer != NULL) { EVENTQUEUE->deleteTimer(m_switchWaitTimer); m_switchWaitTimer = NULL; } } bool CServer::isSwitchWaitStarted() const { return (m_switchWaitTimer != NULL); } UInt32 CServer::getCorner(CBaseClientProxy* client, SInt32 x, SInt32 y, SInt32 size) const { assert(client != NULL); // get client screen shape SInt32 ax, ay, aw, ah; client->getShape(ax, ay, aw, ah); // check for x,y on the left or right SInt32 xSide; if (x <= ax) { xSide = -1; } else if (x >= ax + aw - 1) { xSide = 1; } else { xSide = 0; } // check for x,y on the top or bottom SInt32 ySide; if (y <= ay) { ySide = -1; } else if (y >= ay + ah - 1) { ySide = 1; } else { ySide = 0; } // if against the left or right then check if y is within size if (xSide != 0) { if (y < ay + size) { return (xSide < 0) ? kTopLeftMask : kTopRightMask; } else if (y >= ay + ah - size) { return (xSide < 0) ? kBottomLeftMask : kBottomRightMask; } } // if against the left or right then check if y is within size if (ySide != 0) { if (x < ax + size) { return (ySide < 0) ? kTopLeftMask : kBottomLeftMask; } else if (x >= ax + aw - size) { return (ySide < 0) ? kTopRightMask : kBottomRightMask; } } return kNoCornerMask; } void CServer::stopRelativeMoves() { if (m_relativeMoves && m_active != m_primaryClient) { // warp to the center of the active client so we know where we are SInt32 ax, ay, aw, ah; m_active->getShape(ax, ay, aw, ah); m_x = ax + (aw >> 1); m_y = ay + (ah >> 1); m_xDelta = 0; m_yDelta = 0; m_xDelta2 = 0; m_yDelta2 = 0; LOG((CLOG_DEBUG2 "synchronize move on %s by %d,%d", getName(m_active).c_str(), m_x, m_y)); m_active->mouseMove(m_x, m_y); } } void CServer::sendOptions(CBaseClientProxy* client) const { COptionsList optionsList; // look up options for client const CConfig::CScreenOptions* options = m_config.getOptions(getName(client)); if (options != NULL) { // convert options to a more convenient form for sending optionsList.reserve(2 * options->size()); for (CConfig::CScreenOptions::const_iterator index = options->begin(); index != options->end(); ++index) { optionsList.push_back(index->first); optionsList.push_back(static_cast(index->second)); } } // look up global options options = m_config.getOptions(""); if (options != NULL) { // convert options to a more convenient form for sending optionsList.reserve(optionsList.size() + 2 * options->size()); for (CConfig::CScreenOptions::const_iterator index = options->begin(); index != options->end(); ++index) { optionsList.push_back(index->first); optionsList.push_back(static_cast(index->second)); } } // send the options client->resetOptions(); client->setOptions(optionsList); } void CServer::processOptions() { const CConfig::CScreenOptions* options = m_config.getOptions(""); if (options == NULL) { return; } m_switchNeedsShift = false; // it seems if i don't add these m_switchNeedsControl = false; // lines, the 'reload config' option m_switchNeedsAlt = false; // doesnt' work correct. bool newRelativeMoves = m_relativeMoves; for (CConfig::CScreenOptions::const_iterator index = options->begin(); index != options->end(); ++index) { const OptionID id = index->first; const OptionValue value = index->second; if (id == kOptionScreenSwitchDelay) { m_switchWaitDelay = 1.0e-3 * static_cast(value); if (m_switchWaitDelay < 0.0) { m_switchWaitDelay = 0.0; } stopSwitchWait(); } else if (id == kOptionScreenSwitchTwoTap) { m_switchTwoTapDelay = 1.0e-3 * static_cast(value); if (m_switchTwoTapDelay < 0.0) { m_switchTwoTapDelay = 0.0; } stopSwitchTwoTap(); } else if (id == kOptionScreenSwitchNeedsControl) { m_switchNeedsControl = (value != 0); } else if (id == kOptionScreenSwitchNeedsShift) { m_switchNeedsShift = (value != 0); } else if (id == kOptionScreenSwitchNeedsAlt) { m_switchNeedsAlt = (value != 0); } else if (id == kOptionRelativeMouseMoves) { newRelativeMoves = (value != 0); } } if (m_relativeMoves && !newRelativeMoves) { stopRelativeMoves(); } m_relativeMoves = newRelativeMoves; } void CServer::handleShapeChanged(const CEvent&, void* vclient) { // ignore events from unknown clients CBaseClientProxy* client = reinterpret_cast(vclient); if (m_clientSet.count(client) == 0) { return; } LOG((CLOG_DEBUG "screen \"%s\" shape changed", getName(client).c_str())); // update jump coordinate SInt32 x, y; client->getCursorPos(x, y); client->setJumpCursorPos(x, y); // update the mouse coordinates if (client == m_active) { m_x = x; m_y = y; } // handle resolution change to primary screen if (client == m_primaryClient) { if (client == m_active) { onMouseMovePrimary(m_x, m_y); } else { onMouseMoveSecondary(0, 0); } } } void CServer::handleClipboardGrabbed(const CEvent& event, void* vclient) { // ignore events from unknown clients CBaseClientProxy* grabber = reinterpret_cast(vclient); if (m_clientSet.count(grabber) == 0) { return; } const IScreen::CClipboardInfo* info = reinterpret_cast(event.getData()); // ignore grab if sequence number is old. always allow primary // screen to grab. CClipboardInfo& clipboard = m_clipboards[info->m_id]; if (grabber != m_primaryClient && info->m_sequenceNumber < clipboard.m_clipboardSeqNum) { LOG((CLOG_INFO "ignored screen \"%s\" grab of clipboard %d", getName(grabber).c_str(), info->m_id)); return; } // mark screen as owning clipboard LOG((CLOG_INFO "screen \"%s\" grabbed clipboard %d from \"%s\"", getName(grabber).c_str(), info->m_id, clipboard.m_clipboardOwner.c_str())); clipboard.m_clipboardOwner = getName(grabber); clipboard.m_clipboardSeqNum = info->m_sequenceNumber; // clear the clipboard data (since it's not known at this point) if (clipboard.m_clipboard.open(0)) { clipboard.m_clipboard.empty(); clipboard.m_clipboard.close(); } clipboard.m_clipboardData = clipboard.m_clipboard.marshall(); // tell all other screens to take ownership of clipboard. tell the // grabber that it's clipboard isn't dirty. for (CClientList::iterator index = m_clients.begin(); index != m_clients.end(); ++index) { CBaseClientProxy* client = index->second; if (client == grabber) { client->setClipboardDirty(info->m_id, false); } else { client->grabClipboard(info->m_id); } } } void CServer::handleClipboardChanged(const CEvent& event, void* vclient) { // ignore events from unknown clients CBaseClientProxy* sender = reinterpret_cast(vclient); if (m_clientSet.count(sender) == 0) { return; } const IScreen::CClipboardInfo* info = reinterpret_cast(event.getData()); onClipboardChanged(sender, info->m_id, info->m_sequenceNumber); } void CServer::handleKeyDownEvent(const CEvent& event, void*) { IPlatformScreen::CKeyInfo* info = reinterpret_cast(event.getData()); onKeyDown(info->m_key, info->m_mask, info->m_button, info->m_screens); } void CServer::handleKeyUpEvent(const CEvent& event, void*) { IPlatformScreen::CKeyInfo* info = reinterpret_cast(event.getData()); onKeyUp(info->m_key, info->m_mask, info->m_button, info->m_screens); } void CServer::handleKeyRepeatEvent(const CEvent& event, void*) { IPlatformScreen::CKeyInfo* info = reinterpret_cast(event.getData()); onKeyRepeat(info->m_key, info->m_mask, info->m_count, info->m_button); } void CServer::handleButtonDownEvent(const CEvent& event, void*) { IPlatformScreen::CButtonInfo* info = reinterpret_cast(event.getData()); onMouseDown(info->m_button); } void CServer::handleButtonUpEvent(const CEvent& event, void*) { IPlatformScreen::CButtonInfo* info = reinterpret_cast(event.getData()); onMouseUp(info->m_button); } void CServer::handleMotionPrimaryEvent(const CEvent& event, void*) { IPlatformScreen::CMotionInfo* info = reinterpret_cast(event.getData()); onMouseMovePrimary(info->m_x, info->m_y); } void CServer::handleMotionSecondaryEvent(const CEvent& event, void*) { IPlatformScreen::CMotionInfo* info = reinterpret_cast(event.getData()); onMouseMoveSecondary(info->m_x, info->m_y); } void CServer::handleWheelEvent(const CEvent& event, void*) { IPlatformScreen::CWheelInfo* info = reinterpret_cast(event.getData()); onMouseWheel(info->m_xDelta, info->m_yDelta); } void CServer::handleGameDeviceButtons(const CEvent& event, void*) { IPlatformScreen::CGameDeviceButtonInfo* info = reinterpret_cast(event.getData()); onGameDeviceButtons(info->m_id, info->m_buttons); } void CServer::handleGameDeviceSticks(const CEvent& event, void*) { IPlatformScreen::CGameDeviceStickInfo* info = reinterpret_cast(event.getData()); onGameDeviceSticks(info->m_id, info->m_x1, info->m_y1, info->m_x2, info->m_y2); } void CServer::handleGameDeviceTriggers(const CEvent& event, void*) { IPlatformScreen::CGameDeviceTriggerInfo* info = reinterpret_cast(event.getData()); onGameDeviceTriggers(info->m_id, info->m_t1, info->m_t2); } void CServer::handleGameDeviceTimingReq(const CEvent& event, void*) { onGameDeviceTimingReq(); } void CServer::handleScreensaverActivatedEvent(const CEvent&, void*) { onScreensaver(true); } void CServer::handleScreensaverDeactivatedEvent(const CEvent&, void*) { onScreensaver(false); } void CServer::handleSwitchWaitTimeout(const CEvent&, void*) { // ignore if mouse is locked to screen if (isLockedToScreen()) { LOG((CLOG_DEBUG1 "locked to screen")); stopSwitch(); return; } // switch screen switchScreen(m_switchScreen, m_switchWaitX, m_switchWaitY, false); } void CServer::handleClientDisconnected(const CEvent&, void* vclient) { // client has disconnected. it might be an old client or an // active client. we don't care so just handle it both ways. CBaseClientProxy* client = reinterpret_cast(vclient); removeActiveClient(client); removeOldClient(client); delete client; } void CServer::handleClientCloseTimeout(const CEvent&, void* vclient) { // client took too long to disconnect. just dump it. CBaseClientProxy* client = reinterpret_cast(vclient); LOG((CLOG_NOTE "forced disconnection of client \"%s\"", getName(client).c_str())); removeOldClient(client); delete client; } void CServer::handleSwitchToScreenEvent(const CEvent& event, void*) { CSwitchToScreenInfo* info = reinterpret_cast(event.getData()); CClientList::const_iterator index = m_clients.find(info->m_screen); if (index == m_clients.end()) { LOG((CLOG_DEBUG1 "screen \"%s\" not active", info->m_screen)); } else { jumpToScreen(index->second); } } void CServer::handleSwitchInDirectionEvent(const CEvent& event, void*) { CSwitchInDirectionInfo* info = reinterpret_cast(event.getData()); // jump to screen in chosen direction from center of this screen SInt32 x = m_x, y = m_y; CBaseClientProxy* newScreen = getNeighbor(m_active, info->m_direction, x, y); if (newScreen == NULL) { LOG((CLOG_DEBUG1 "no neighbor %s", CConfig::dirName(info->m_direction))); } else { jumpToScreen(newScreen); } } void CServer::handleKeyboardBroadcastEvent(const CEvent& event, void*) { CKeyboardBroadcastInfo* info = (CKeyboardBroadcastInfo*)event.getData(); // choose new state bool newState; switch (info->m_state) { case CKeyboardBroadcastInfo::kOff: newState = false; break; default: case CKeyboardBroadcastInfo::kOn: newState = true; break; case CKeyboardBroadcastInfo::kToggle: newState = !m_keyboardBroadcasting; break; } // enter new state if (newState != m_keyboardBroadcasting || info->m_screens != m_keyboardBroadcastingScreens) { m_keyboardBroadcasting = newState; m_keyboardBroadcastingScreens = info->m_screens; LOG((CLOG_DEBUG "keyboard broadcasting %s: %s", m_keyboardBroadcasting ? "on" : "off", m_keyboardBroadcastingScreens.c_str())); } } void CServer::handleLockCursorToScreenEvent(const CEvent& event, void*) { CLockCursorToScreenInfo* info = (CLockCursorToScreenInfo*)event.getData(); // choose new state bool newState; switch (info->m_state) { case CLockCursorToScreenInfo::kOff: newState = false; break; default: case CLockCursorToScreenInfo::kOn: newState = true; break; case CLockCursorToScreenInfo::kToggle: newState = !m_lockedToScreen; break; } // enter new state if (newState != m_lockedToScreen) { m_lockedToScreen = newState; LOG((CLOG_DEBUG "cursor %s current screen", m_lockedToScreen ? "locked to" : "unlocked from")); m_primaryClient->reconfigure(getActivePrimarySides()); if (!isLockedToScreenServer()) { stopRelativeMoves(); } } } void CServer::handleFakeInputBeginEvent(const CEvent&, void*) { m_primaryClient->fakeInputBegin(); } void CServer::handleFakeInputEndEvent(const CEvent&, void*) { m_primaryClient->fakeInputEnd(); } void CServer::onClipboardChanged(CBaseClientProxy* sender, ClipboardID id, UInt32 seqNum) { CClipboardInfo& clipboard = m_clipboards[id]; // ignore update if sequence number is old if (seqNum < clipboard.m_clipboardSeqNum) { LOG((CLOG_INFO "ignored screen \"%s\" update of clipboard %d (missequenced)", getName(sender).c_str(), id)); return; } // should be the expected client assert(sender == m_clients.find(clipboard.m_clipboardOwner)->second); // get data sender->getClipboard(id, &clipboard.m_clipboard); // ignore if data hasn't changed CString data = clipboard.m_clipboard.marshall(); if (data == clipboard.m_clipboardData) { LOG((CLOG_DEBUG "ignored screen \"%s\" update of clipboard %d (unchanged)", clipboard.m_clipboardOwner.c_str(), id)); return; } // got new data LOG((CLOG_INFO "screen \"%s\" updated clipboard %d", clipboard.m_clipboardOwner.c_str(), id)); clipboard.m_clipboardData = data; // tell all clients except the sender that the clipboard is dirty for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { CBaseClientProxy* client = index->second; client->setClipboardDirty(id, client != sender); } // send the new clipboard to the active screen m_active->setClipboard(id, &clipboard.m_clipboard); } void CServer::onScreensaver(bool activated) { LOG((CLOG_DEBUG "onScreenSaver %s", activated ? "activated" : "deactivated")); if (activated) { // save current screen and position m_activeSaver = m_active; m_xSaver = m_x; m_ySaver = m_y; // jump to primary screen if (m_active != m_primaryClient) { switchScreen(m_primaryClient, 0, 0, true); } } else { // jump back to previous screen and position. we must check // that the position is still valid since the screen may have // changed resolutions while the screen saver was running. if (m_activeSaver != NULL && m_activeSaver != m_primaryClient) { // check position CBaseClientProxy* screen = m_activeSaver; SInt32 x, y, w, h; screen->getShape(x, y, w, h); SInt32 zoneSize = getJumpZoneSize(screen); if (m_xSaver < x + zoneSize) { m_xSaver = x + zoneSize; } else if (m_xSaver >= x + w - zoneSize) { m_xSaver = x + w - zoneSize - 1; } if (m_ySaver < y + zoneSize) { m_ySaver = y + zoneSize; } else if (m_ySaver >= y + h - zoneSize) { m_ySaver = y + h - zoneSize - 1; } // jump switchScreen(screen, m_xSaver, m_ySaver, false); } // reset state m_activeSaver = NULL; } // send message to all clients for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { CBaseClientProxy* client = index->second; client->screensaver(activated); } } void CServer::onKeyDown(KeyID id, KeyModifierMask mask, KeyButton button, const char* screens) { LOG((CLOG_DEBUG1 "onKeyDown id=%d mask=0x%04x button=0x%04x", id, mask, button)); assert(m_active != NULL); // relay if (!m_keyboardBroadcasting && IKeyState::CKeyInfo::isDefault(screens)) { m_active->keyDown(id, mask, button); } else { if (!screens && m_keyboardBroadcasting) { screens = m_keyboardBroadcastingScreens.c_str(); if (IKeyState::CKeyInfo::isDefault(screens)) { screens = "*"; } } for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { if (IKeyState::CKeyInfo::contains(screens, index->first)) { index->second->keyDown(id, mask, button); } } } } void CServer::onKeyUp(KeyID id, KeyModifierMask mask, KeyButton button, const char* screens) { LOG((CLOG_DEBUG1 "onKeyUp id=%d mask=0x%04x button=0x%04x", id, mask, button)); assert(m_active != NULL); // relay if (!m_keyboardBroadcasting && IKeyState::CKeyInfo::isDefault(screens)) { m_active->keyUp(id, mask, button); } else { if (!screens && m_keyboardBroadcasting) { screens = m_keyboardBroadcastingScreens.c_str(); if (IKeyState::CKeyInfo::isDefault(screens)) { screens = "*"; } } for (CClientList::const_iterator index = m_clients.begin(); index != m_clients.end(); ++index) { if (IKeyState::CKeyInfo::contains(screens, index->first)) { index->second->keyUp(id, mask, button); } } } } void CServer::onKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { LOG((CLOG_DEBUG1 "onKeyRepeat id=%d mask=0x%04x count=%d button=0x%04x", id, mask, count, button)); assert(m_active != NULL); // relay m_active->keyRepeat(id, mask, count, button); } void CServer::onMouseDown(ButtonID id) { LOG((CLOG_DEBUG1 "onMouseDown id=%d", id)); assert(m_active != NULL); // relay m_active->mouseDown(id); } void CServer::onMouseUp(ButtonID id) { LOG((CLOG_DEBUG1 "onMouseUp id=%d", id)); assert(m_active != NULL); // relay m_active->mouseUp(id); } bool CServer::onMouseMovePrimary(SInt32 x, SInt32 y) { LOG((CLOG_DEBUG4 "onMouseMovePrimary %d,%d", x, y)); // mouse move on primary (server's) screen if (m_active != m_primaryClient) { // stale event -- we're actually on a secondary screen return false; } // save last delta m_xDelta2 = m_xDelta; m_yDelta2 = m_yDelta; // save current delta m_xDelta = x - m_x; m_yDelta = y - m_y; // save position m_x = x; m_y = y; // get screen shape SInt32 ax, ay, aw, ah; m_active->getShape(ax, ay, aw, ah); SInt32 zoneSize = getJumpZoneSize(m_active); // clamp position to screen SInt32 xc = x, yc = y; if (xc < ax + zoneSize) { xc = ax; } else if (xc >= ax + aw - zoneSize) { xc = ax + aw - 1; } if (yc < ay + zoneSize) { yc = ay; } else if (yc >= ay + ah - zoneSize) { yc = ay + ah - 1; } // see if we should change screens EDirection dir; if (x < ax + zoneSize) { x -= zoneSize; dir = kLeft; } else if (x >= ax + aw - zoneSize) { x += zoneSize; dir = kRight; } else if (y < ay + zoneSize) { y -= zoneSize; dir = kTop; } else if (y >= ay + ah - zoneSize) { y += zoneSize; dir = kBottom; } else { // still on local screen noSwitch(x, y); return false; } // get jump destination CBaseClientProxy* newScreen = mapToNeighbor(m_active, dir, x, y); // should we switch or not? if (isSwitchOkay(newScreen, dir, x, y, xc, yc)) { // switch screen switchScreen(newScreen, x, y, false); return true; } else { return false; } } void CServer::onMouseMoveSecondary(SInt32 dx, SInt32 dy) { LOG((CLOG_DEBUG2 "onMouseMoveSecondary %+d,%+d", dx, dy)); // mouse move on secondary (client's) screen assert(m_active != NULL); if (m_active == m_primaryClient) { // stale event -- we're actually on the primary screen return; } // if doing relative motion on secondary screens and we're locked // to the screen (which activates relative moves) then send a // relative mouse motion. when we're doing this we pretend as if // the mouse isn't actually moving because we're expecting some // program on the secondary screen to warp the mouse on us, so we // have no idea where it really is. if (m_relativeMoves && isLockedToScreenServer()) { LOG((CLOG_DEBUG2 "relative move on %s by %d,%d", getName(m_active).c_str(), dx, dy)); m_active->mouseRelativeMove(dx, dy); return; } // save old position const SInt32 xOld = m_x; const SInt32 yOld = m_y; // save last delta m_xDelta2 = m_xDelta; m_yDelta2 = m_yDelta; // save current delta m_xDelta = dx; m_yDelta = dy; // accumulate motion m_x += dx; m_y += dy; // get screen shape SInt32 ax, ay, aw, ah; m_active->getShape(ax, ay, aw, ah); // find direction of neighbor and get the neighbor bool jump = true; CBaseClientProxy* newScreen; do { // clamp position to screen SInt32 xc = m_x, yc = m_y; if (xc < ax) { xc = ax; } else if (xc >= ax + aw) { xc = ax + aw - 1; } if (yc < ay) { yc = ay; } else if (yc >= ay + ah) { yc = ay + ah - 1; } EDirection dir; if (m_x < ax) { dir = kLeft; } else if (m_x > ax + aw - 1) { dir = kRight; } else if (m_y < ay) { dir = kTop; } else if (m_y > ay + ah - 1) { dir = kBottom; } else { // we haven't left the screen newScreen = m_active; jump = false; // if waiting and mouse is not on the border we're waiting // on then stop waiting. also if it's not on the border // then arm the double tap. if (m_switchScreen != NULL) { bool clearWait; SInt32 zoneSize = m_primaryClient->getJumpZoneSize(); switch (m_switchDir) { case kLeft: clearWait = (m_x >= ax + zoneSize); break; case kRight: clearWait = (m_x <= ax + aw - 1 - zoneSize); break; case kTop: clearWait = (m_y >= ay + zoneSize); break; case kBottom: clearWait = (m_y <= ay + ah - 1 + zoneSize); break; default: clearWait = false; break; } if (clearWait) { // still on local screen noSwitch(m_x, m_y); } } // skip rest of block break; } // try to switch screen. get the neighbor. newScreen = mapToNeighbor(m_active, dir, m_x, m_y); // see if we should switch if (!isSwitchOkay(newScreen, dir, m_x, m_y, xc, yc)) { newScreen = m_active; jump = false; } } while (false); if (jump) { // switch screens switchScreen(newScreen, m_x, m_y, false); } else { // same screen. clamp mouse to edge. m_x = xOld + dx; m_y = yOld + dy; if (m_x < ax) { m_x = ax; LOG((CLOG_DEBUG2 "clamp to left of \"%s\"", getName(m_active).c_str())); } else if (m_x > ax + aw - 1) { m_x = ax + aw - 1; LOG((CLOG_DEBUG2 "clamp to right of \"%s\"", getName(m_active).c_str())); } if (m_y < ay) { m_y = ay; LOG((CLOG_DEBUG2 "clamp to top of \"%s\"", getName(m_active).c_str())); } else if (m_y > ay + ah - 1) { m_y = ay + ah - 1; LOG((CLOG_DEBUG2 "clamp to bottom of \"%s\"", getName(m_active).c_str())); } // warp cursor if it moved. if (m_x != xOld || m_y != yOld) { LOG((CLOG_DEBUG2 "move on %s to %d,%d", getName(m_active).c_str(), m_x, m_y)); m_active->mouseMove(m_x, m_y); } } } void CServer::onMouseWheel(SInt32 xDelta, SInt32 yDelta) { LOG((CLOG_DEBUG1 "onMouseWheel %+d,%+d", xDelta, yDelta)); assert(m_active != NULL); // relay m_active->mouseWheel(xDelta, yDelta); } void CServer::onGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) { LOG((CLOG_DEBUG1 "onGameDeviceButtons id=%d buttons=%d", id, buttons)); m_active->gameDeviceButtons(id, buttons); } void CServer::onGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) { LOG((CLOG_DEBUG1 "onGameDeviceSticks id=%d s1=%+d,%+d s2=%+d,%+d", id, x1, y1, x2, y2)); m_active->gameDeviceSticks(id, x1, y1, x2, y2); } void CServer::onGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) { LOG((CLOG_DEBUG1 "onGameDeviceTriggers id=%d t1=%d t2=%d", id, t1, t2)); m_active->gameDeviceTriggers(id, t1, t2); } void CServer::onGameDeviceTimingReq() { LOG((CLOG_DEBUG1 "onGameDeviceTimingReq")); m_active->gameDeviceTimingReq(); } bool CServer::addClient(CBaseClientProxy* client) { CString name = getName(client); if (m_clients.count(name) != 0) { return false; } // add event handlers EVENTQUEUE->adoptHandler(IScreen::getShapeChangedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CServer::handleShapeChanged, client)); EVENTQUEUE->adoptHandler(IScreen::getClipboardGrabbedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CServer::handleClipboardGrabbed, client)); EVENTQUEUE->adoptHandler(CClientProxy::getClipboardChangedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CServer::handleClipboardChanged, client)); // add to list m_clientSet.insert(client); m_clients.insert(std::make_pair(name, client)); // initialize client data SInt32 x, y; client->getCursorPos(x, y); client->setJumpCursorPos(x, y); // tell primary client about the active sides m_primaryClient->reconfigure(getActivePrimarySides()); return true; } bool CServer::removeClient(CBaseClientProxy* client) { // return false if not in list CClientSet::iterator i = m_clientSet.find(client); if (i == m_clientSet.end()) { return false; } // remove event handlers EVENTQUEUE->removeHandler(IScreen::getShapeChangedEvent(), client->getEventTarget()); EVENTQUEUE->removeHandler(IScreen::getClipboardGrabbedEvent(), client->getEventTarget()); EVENTQUEUE->removeHandler(CClientProxy::getClipboardChangedEvent(), client->getEventTarget()); // remove from list m_clients.erase(getName(client)); m_clientSet.erase(i); return true; } void CServer::closeClient(CBaseClientProxy* client, const char* msg) { assert(client != m_primaryClient); assert(msg != NULL); // send message to client. this message should cause the client // to disconnect. we add this client to the closed client list // and install a timer to remove the client if it doesn't respond // quickly enough. we also remove the client from the active // client list since we're not going to listen to it anymore. // note that this method also works on clients that are not in // the m_clients list. adoptClient() may call us with such a // client. LOG((CLOG_NOTE "disconnecting client \"%s\"", getName(client).c_str())); // send message // FIXME -- avoid type cast (kinda hard, though) ((CClientProxy*)client)->close(msg); // install timer. wait timeout seconds for client to close. double timeout = 5.0; CEventQueueTimer* timer = EVENTQUEUE->newOneShotTimer(timeout, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, timer, new TMethodEventJob(this, &CServer::handleClientCloseTimeout, client)); // move client to closing list removeClient(client); m_oldClients.insert(std::make_pair(client, timer)); // if this client is the active screen then we have to // jump off of it forceLeaveClient(client); } void CServer::closeClients(const CConfig& config) { // collect the clients that are connected but are being dropped // from the configuration (or who's canonical name is changing). typedef std::set CRemovedClients; CRemovedClients removed; for (CClientList::iterator index = m_clients.begin(); index != m_clients.end(); ++index) { if (!config.isCanonicalName(index->first)) { removed.insert(index->second); } } // don't close the primary client removed.erase(m_primaryClient); // now close them. we collect the list then close in two steps // because closeClient() modifies the collection we iterate over. for (CRemovedClients::iterator index = removed.begin(); index != removed.end(); ++index) { closeClient(*index, kMsgCClose); } } void CServer::removeActiveClient(CBaseClientProxy* client) { if (removeClient(client)) { forceLeaveClient(client); EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), client); if (m_clients.size() == 1 && m_oldClients.empty()) { EVENTQUEUE->addEvent(CEvent(getDisconnectedEvent(), this)); } } } void CServer::removeOldClient(CBaseClientProxy* client) { COldClients::iterator i = m_oldClients.find(client); if (i != m_oldClients.end()) { EVENTQUEUE->removeHandler(CClientProxy::getDisconnectedEvent(), client); EVENTQUEUE->removeHandler(CEvent::kTimer, i->second); EVENTQUEUE->deleteTimer(i->second); m_oldClients.erase(i); if (m_clients.size() == 1 && m_oldClients.empty()) { EVENTQUEUE->addEvent(CEvent(getDisconnectedEvent(), this)); } } } void CServer::forceLeaveClient(CBaseClientProxy* client) { CBaseClientProxy* active = (m_activeSaver != NULL) ? m_activeSaver : m_active; if (active == client) { // record new position (center of primary screen) m_primaryClient->getCursorCenter(m_x, m_y); // stop waiting to switch to this client if (active == m_switchScreen) { stopSwitch(); } // don't notify active screen since it has probably already // disconnected. LOG((CLOG_INFO "jump from \"%s\" to \"%s\" at %d,%d", getName(active).c_str(), getName(m_primaryClient).c_str(), m_x, m_y)); // cut over m_active = m_primaryClient; // enter new screen (unless we already have because of the // screen saver) if (m_activeSaver == NULL) { m_primaryClient->enter(m_x, m_y, m_seqNum, m_primaryClient->getToggleMask(), false); } } // if this screen had the cursor when the screen saver activated // then we can't switch back to it when the screen saver // deactivates. if (m_activeSaver == client) { m_activeSaver = NULL; } // tell primary client about the active sides m_primaryClient->reconfigure(getActivePrimarySides()); } // // CServer::CClipboardInfo // CServer::CClipboardInfo::CClipboardInfo() : m_clipboard(), m_clipboardData(), m_clipboardOwner(), m_clipboardSeqNum(0) { // do nothing } // // CServer::CLockCursorToScreenInfo // CServer::CLockCursorToScreenInfo* CServer::CLockCursorToScreenInfo::alloc(State state) { CLockCursorToScreenInfo* info = (CLockCursorToScreenInfo*)malloc(sizeof(CLockCursorToScreenInfo)); info->m_state = state; return info; } // // CServer::CSwitchToScreenInfo // CServer::CSwitchToScreenInfo* CServer::CSwitchToScreenInfo::alloc(const CString& screen) { CSwitchToScreenInfo* info = (CSwitchToScreenInfo*)malloc(sizeof(CSwitchToScreenInfo) + screen.size()); strcpy(info->m_screen, screen.c_str()); return info; } // // CServer::CSwitchInDirectionInfo // CServer::CSwitchInDirectionInfo* CServer::CSwitchInDirectionInfo::alloc(EDirection direction) { CSwitchInDirectionInfo* info = (CSwitchInDirectionInfo*)malloc(sizeof(CSwitchInDirectionInfo)); info->m_direction = direction; return info; } // // CServer::CKeyboardBroadcastInfo // CServer::CKeyboardBroadcastInfo* CServer::CKeyboardBroadcastInfo::alloc(State state) { CKeyboardBroadcastInfo* info = (CKeyboardBroadcastInfo*)malloc(sizeof(CKeyboardBroadcastInfo)); info->m_state = state; info->m_screens[0] = '\0'; return info; } CServer::CKeyboardBroadcastInfo* CServer::CKeyboardBroadcastInfo::alloc(State state, const CString& screens) { CKeyboardBroadcastInfo* info = (CKeyboardBroadcastInfo*)malloc(sizeof(CKeyboardBroadcastInfo) + screens.size()); info->m_state = state; strcpy(info->m_screens, screens.c_str()); return info; } synergy-1.4.12-Source/src/lib/server/CServer.h0000600000175000017500000003641512131062123021074 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSERVER_H #define CSERVER_H #include "CConfig.h" #include "CClipboard.h" #include "ClipboardTypes.h" #include "KeyTypes.h" #include "MouseTypes.h" #include "CEvent.h" #include "CStopwatch.h" #include "stdmap.h" #include "stdset.h" #include "stdvector.h" #include "INode.h" class CBaseClientProxy; class CEventQueueTimer; class CPrimaryClient; class CInputFilter; class CScreen; //! Synergy server /*! This class implements the top-level server algorithms for synergy. */ class CServer : public INode { public: //! Lock cursor to screen data class CLockCursorToScreenInfo { public: enum State { kOff, kOn, kToggle }; static CLockCursorToScreenInfo* alloc(State state = kToggle); public: State m_state; }; //! Switch to screen data class CSwitchToScreenInfo { public: static CSwitchToScreenInfo* alloc(const CString& screen); public: // this is a C-string; this type is a variable size structure char m_screen[1]; }; //! Switch in direction data class CSwitchInDirectionInfo { public: static CSwitchInDirectionInfo* alloc(EDirection direction); public: EDirection m_direction; }; //! Screen connected data class CScreenConnectedInfo { public: CScreenConnectedInfo(CString screen) : m_screen(screen) { } public: CString m_screen; // was char[1] }; //! Keyboard broadcast data class CKeyboardBroadcastInfo { public: enum State { kOff, kOn, kToggle }; static CKeyboardBroadcastInfo* alloc(State state = kToggle); static CKeyboardBroadcastInfo* alloc(State state, const CString& screens); public: State m_state; char m_screens[1]; }; /*! Start the server with the configuration \p config and the primary client (local screen) \p primaryClient. The client retains ownership of \p primaryClient. */ CServer(const CConfig& config, CPrimaryClient* primaryClient, CScreen* screen); ~CServer(); #ifdef TEST_ENV CServer() { } #endif //! @name manipulators //@{ //! Set configuration /*! Change the server's configuration. Returns true iff the new configuration was accepted (it must include the server's name). This will disconnect any clients no longer in the configuration. */ bool setConfig(const CConfig&); //! Add a client /*! Adds \p client to the server. The client is adopted and will be destroyed when the client disconnects or is disconnected. */ void adoptClient(CBaseClientProxy* client); //! Disconnect clients /*! Disconnect clients. This tells them to disconnect but does not wait for them to actually do so. The server sends the disconnected event when they're all disconnected (or immediately if none are connected). The caller can also just destroy this object to force the disconnection. */ void disconnect(); //! Notify of game device timing response void gameDeviceTimingResp(UInt16 freq); //! Notify of game device feedback void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); //@} //! @name accessors //@{ //! Get number of connected clients /*! Returns the number of connected clients, including the server itself. */ UInt32 getNumClients() const; //! Get the list of connected clients /*! Set the \c list to the names of the currently connected clients. */ void getClients(std::vector& list) const; //! Get error event type /*! Returns the error event type. This is sent when the server fails for some reason. */ static CEvent::Type getErrorEvent(); //! Get connected event type /*! Returns the connected event type. This is sent when a client screen has connected. The event data is a \c CScreenConnectedInfo* that indicates the connected screen. */ static CEvent::Type getConnectedEvent(); //! Get disconnected event type /*! Returns the disconnected event type. This is sent when all the clients have disconnected. */ static CEvent::Type getDisconnectedEvent(); //! Get switch to screen event type /*! Returns the switch to screen event type. The server responds to this by switching screens. The event data is a \c CSwitchToScreenInfo* that indicates the target screen. */ static CEvent::Type getSwitchToScreenEvent(); //! Get switch in direction event type /*! Returns the switch in direction event type. The server responds to this by switching screens. The event data is a \c CSwitchInDirectionInfo* that indicates the target direction. */ static CEvent::Type getSwitchInDirectionEvent(); //! Get keyboard broadcast event type /*! Returns the keyboard broadcast event type. The server responds to this by turning on keyboard broadcasting or turning it off. The event data is a \c CKeyboardBroadcastInfo*. */ static CEvent::Type getKeyboardBroadcastEvent(); //! Get lock cursor event type /*! Returns the lock cursor event type. The server responds to this by locking the cursor to the active screen or unlocking it. The event data is a \c CLockCursorToScreenInfo*. */ static CEvent::Type getLockCursorToScreenEvent(); //! Get screen switched event type /*! Returns the screen switched event type. This is raised when the screen has been switched to a client. */ static CEvent::Type getScreenSwitchedEvent(); //@} private: // get canonical name of client CString getName(const CBaseClientProxy*) const; // get the sides of the primary screen that have neighbors UInt32 getActivePrimarySides() const; // returns true iff mouse should be locked to the current screen // according to this object only, ignoring what the primary client // says. bool isLockedToScreenServer() const; // returns true iff mouse should be locked to the current screen // according to this object or the primary client. bool isLockedToScreen() const; // returns the jump zone of the client SInt32 getJumpZoneSize(CBaseClientProxy*) const; // change the active screen void switchScreen(CBaseClientProxy*, SInt32 x, SInt32 y, bool forScreenSaver); // jump to screen void jumpToScreen(CBaseClientProxy*); // convert pixel position to fraction, using x or y depending on the // direction. float mapToFraction(CBaseClientProxy*, EDirection, SInt32 x, SInt32 y) const; // convert fraction to pixel position, writing only x or y depending // on the direction. void mapToPixel(CBaseClientProxy*, EDirection, float f, SInt32& x, SInt32& y) const; // returns true if the client has a neighbor anywhere along the edge // indicated by the direction. bool hasAnyNeighbor(CBaseClientProxy*, EDirection) const; // lookup neighboring screen, mapping the coordinate independent of // the direction to the neighbor's coordinate space. CBaseClientProxy* getNeighbor(CBaseClientProxy*, EDirection, SInt32& x, SInt32& y) const; // lookup neighboring screen. given a position relative to the // source screen, find the screen we should move onto and where. // if the position is sufficiently far from the source then we // cross multiple screens. if there is no suitable screen then // return NULL and x,y are not modified. CBaseClientProxy* mapToNeighbor(CBaseClientProxy*, EDirection, SInt32& x, SInt32& y) const; // adjusts x and y or neither to avoid ending up in a jump zone // after entering the client in the given direction. void avoidJumpZone(CBaseClientProxy*, EDirection, SInt32& x, SInt32& y) const; // test if a switch is permitted. this includes testing user // options like switch delay and tracking any state required to // implement them. returns true iff a switch is permitted. bool isSwitchOkay(CBaseClientProxy* dst, EDirection, SInt32 x, SInt32 y, SInt32 xActive, SInt32 yActive); // update switch state due to a mouse move at \p x, \p y that // doesn't switch screens. void noSwitch(SInt32 x, SInt32 y); // stop switch timers void stopSwitch(); // start two tap switch timer void startSwitchTwoTap(); // arm the two tap switch timer if \p x, \p y is outside the tap zone void armSwitchTwoTap(SInt32 x, SInt32 y); // stop the two tap switch timer void stopSwitchTwoTap(); // returns true iff the two tap switch timer is started bool isSwitchTwoTapStarted() const; // returns true iff should switch because of two tap bool shouldSwitchTwoTap() const; // start delay switch timer void startSwitchWait(SInt32 x, SInt32 y); // stop delay switch timer void stopSwitchWait(); // returns true iff the delay switch timer is started bool isSwitchWaitStarted() const; // returns the corner (EScreenSwitchCornerMasks) where x,y is on the // given client. corners have the given size. UInt32 getCorner(CBaseClientProxy*, SInt32 x, SInt32 y, SInt32 size) const; // stop relative mouse moves void stopRelativeMoves(); // send screen options to \c client void sendOptions(CBaseClientProxy* client) const; // process options from configuration void processOptions(); // event handlers void handleShapeChanged(const CEvent&, void*); void handleClipboardGrabbed(const CEvent&, void*); void handleClipboardChanged(const CEvent&, void*); void handleKeyDownEvent(const CEvent&, void*); void handleKeyUpEvent(const CEvent&, void*); void handleKeyRepeatEvent(const CEvent&, void*); void handleButtonDownEvent(const CEvent&, void*); void handleButtonUpEvent(const CEvent&, void*); void handleMotionPrimaryEvent(const CEvent&, void*); void handleMotionSecondaryEvent(const CEvent&, void*); void handleWheelEvent(const CEvent&, void*); void handleGameDeviceButtons(const CEvent&, void*); void handleGameDeviceSticks(const CEvent&, void*); void handleGameDeviceTriggers(const CEvent&, void*); void handleGameDeviceTimingReq(const CEvent&, void*); void handleScreensaverActivatedEvent(const CEvent&, void*); void handleScreensaverDeactivatedEvent(const CEvent&, void*); void handleSwitchWaitTimeout(const CEvent&, void*); void handleClientDisconnected(const CEvent&, void*); void handleClientCloseTimeout(const CEvent&, void*); void handleSwitchToScreenEvent(const CEvent&, void*); void handleSwitchInDirectionEvent(const CEvent&, void*); void handleKeyboardBroadcastEvent(const CEvent&,void*); void handleLockCursorToScreenEvent(const CEvent&, void*); void handleFakeInputBeginEvent(const CEvent&, void*); void handleFakeInputEndEvent(const CEvent&, void*); // event processing void onClipboardChanged(CBaseClientProxy* sender, ClipboardID id, UInt32 seqNum); void onScreensaver(bool activated); void onKeyDown(KeyID, KeyModifierMask, KeyButton, const char* screens); void onKeyUp(KeyID, KeyModifierMask, KeyButton, const char* screens); void onKeyRepeat(KeyID, KeyModifierMask, SInt32, KeyButton); void onMouseDown(ButtonID); void onMouseUp(ButtonID); bool onMouseMovePrimary(SInt32 x, SInt32 y); void onMouseMoveSecondary(SInt32 dx, SInt32 dy); void onMouseWheel(SInt32 xDelta, SInt32 yDelta); void onGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); void onGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); void onGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); void onGameDeviceTimingReq(); // add client to list and attach event handlers for client bool addClient(CBaseClientProxy*); // remove client from list and detach event handlers for client bool removeClient(CBaseClientProxy*); // close a client void closeClient(CBaseClientProxy*, const char* msg); // close clients not in \p config void closeClients(const CConfig& config); // close all clients whether they've completed the handshake or not, // except the primary client void closeAllClients(); // remove clients from internal state void removeActiveClient(CBaseClientProxy*); void removeOldClient(CBaseClientProxy*); // force the cursor off of \p client void forceLeaveClient(CBaseClientProxy* client); public: bool m_mock; private: class CClipboardInfo { public: CClipboardInfo(); public: CClipboard m_clipboard; CString m_clipboardData; CString m_clipboardOwner; UInt32 m_clipboardSeqNum; }; // the primary screen client CPrimaryClient* m_primaryClient; // all clients (including the primary client) indexed by name typedef std::map CClientList; typedef std::set CClientSet; CClientList m_clients; CClientSet m_clientSet; // all old connections that we're waiting to hangup typedef std::map COldClients; COldClients m_oldClients; // the client with focus CBaseClientProxy* m_active; // the sequence number of enter messages UInt32 m_seqNum; // current mouse position (in absolute screen coordinates) on // whichever screen is active SInt32 m_x, m_y; // last mouse deltas. this is needed to smooth out double tap // on win32 which reports bogus mouse motion at the edge of // the screen when using low level hooks, synthesizing motion // in the opposite direction the mouse actually moved. SInt32 m_xDelta, m_yDelta; SInt32 m_xDelta2, m_yDelta2; // current configuration CConfig m_config; // input filter (from m_config); CInputFilter* m_inputFilter; // clipboard cache CClipboardInfo m_clipboards[kClipboardEnd]; // state saved when screen saver activates CBaseClientProxy* m_activeSaver; SInt32 m_xSaver, m_ySaver; // common state for screen switch tests. all tests are always // trying to reach the same screen in the same direction. EDirection m_switchDir; CBaseClientProxy* m_switchScreen; // state for delayed screen switching double m_switchWaitDelay; CEventQueueTimer* m_switchWaitTimer; SInt32 m_switchWaitX, m_switchWaitY; // state for double-tap screen switching double m_switchTwoTapDelay; CStopwatch m_switchTwoTapTimer; bool m_switchTwoTapEngaged; bool m_switchTwoTapArmed; SInt32 m_switchTwoTapZone; // modifiers needed before switching bool m_switchNeedsShift; bool m_switchNeedsControl; bool m_switchNeedsAlt; // relative mouse move option bool m_relativeMoves; // flag whether or not we have broadcasting enabled and the screens to // which we should send broadcasted keys. bool m_keyboardBroadcasting; CString m_keyboardBroadcastingScreens; // screen locking (former scroll lock) bool m_lockedToScreen; // server screen CScreen* m_screen; static CEvent::Type s_errorEvent; static CEvent::Type s_connectedEvent; static CEvent::Type s_disconnectedEvent; static CEvent::Type s_switchToScreen; static CEvent::Type s_switchInDirection; static CEvent::Type s_keyboardBroadcast; static CEvent::Type s_lockCursorToScreen; static CEvent::Type s_screenSwitched; }; #endif synergy-1.4.12-Source/src/lib/synergy/0000700000175000017500000000000012140644175017546 5ustar synergysynergysynergy-1.4.12-Source/src/lib/synergy/CApp.cpp0000600000175000017500000002200112131107263021062 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CApp.h" #include "CLog.h" #include "Version.h" #include "ProtocolTypes.h" #include "CArch.h" #include "XBase.h" #include "XArch.h" #include "LogOutputters.h" #include "XSynergy.h" #include "CArgsBase.h" #include "CIpcServerProxy.h" #include "TMethodEventJob.h" #include "CIpcMessage.h" #include "Ipc.h" #include "CEventQueue.h" #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #include "IEventQueue.h" #include "TMethodJob.h" #endif #include #include #if WINAPI_CARBON #include #endif CApp* CApp::s_instance = nullptr; CApp::CApp(CreateTaskBarReceiverFunc createTaskBarReceiver, CArgsBase* args) : m_createTaskBarReceiver(createTaskBarReceiver), m_args(args), m_bye(&exit), m_taskBarReceiver(NULL), m_suspended(false), m_ipcClient(nullptr) { assert(s_instance == nullptr); s_instance = this; } CApp::~CApp() { delete m_args; } bool CApp::isArg( int argi, int argc, const char* const* argv, const char* name1, const char* name2, int minRequiredParameters) { if ((name1 != NULL && strcmp(argv[argi], name1) == 0) || (name2 != NULL && strcmp(argv[argi], name2) == 0)) { // match. check args left. if (argi + minRequiredParameters >= argc) { LOG((CLOG_PRINT "%s: missing arguments for `%s'" BYE, argsBase().m_pname, argv[argi], argsBase().m_pname)); m_bye(kExitArgs); } return true; } // no match return false; } bool CApp::parseArg(const int& argc, const char* const* argv, int& i) { if (appUtil().parseArg(argc, argv, i)) { // handled by platform util return true; } else if (isArg(i, argc, argv, "-d", "--debug", 1)) { // change logging level argsBase().m_logFilter = argv[++i]; } else if (isArg(i, argc, argv, "-l", "--log", 1)) { argsBase().m_logFile = argv[++i]; } else if (isArg(i, argc, argv, "-f", "--no-daemon")) { // not a daemon argsBase().m_daemon = false; } else if (isArg(i, argc, argv, NULL, "--daemon")) { // daemonize argsBase().m_daemon = true; } else if (isArg(i, argc, argv, "-n", "--name", 1)) { // save screen name argsBase().m_name = argv[++i]; } else if (isArg(i, argc, argv, "-1", "--no-restart")) { // don't try to restart argsBase().m_restartable = false; } else if (isArg(i, argc, argv, NULL, "--restart")) { // try to restart argsBase().m_restartable = true; } else if (isArg(i, argc, argv, "-z", NULL)) { argsBase().m_backend = true; } else if (isArg(i, argc, argv, NULL, "--no-hooks")) { argsBase().m_noHooks = true; } else if (isArg(i, argc, argv, "-h", "--help")) { help(); m_bye(kExitSuccess); } else if (isArg(i, argc, argv, NULL, "--version")) { version(); m_bye(kExitSuccess); } else if (isArg(i, argc, argv, NULL, "--no-tray")) { argsBase().m_disableTray = true; } else if (isArg(i, argc, argv, NULL, "--ipc")) { argsBase().m_enableIpc = true; } else if (isArg(i, argc, argv, NULL, "--server")) { // HACK: stop error happening when using portable (synergyp) } else if (isArg(i, argc, argv, NULL, "--client")) { // HACK: stop error happening when using portable (synergyp) } else if (isArg(i, argc, argv, NULL, "--crypto-pass")) { argsBase().m_crypto.m_pass = argv[++i]; } else if (isArg(i, argc, argv, NULL, "--crypto-mode")) { argsBase().m_crypto.setMode(argv[++i]); } #if VNC_SUPPORT else if (isArg(i, argc, argv, NULL, "--vnc")) { argsBase().m_enableVnc = true; } #endif else { // option not supported here return false; } return true; } void CApp::parseArgs(int argc, const char* const* argv, int& i) { // about these use of assert() here: // previously an /analyze warning was displayed if we only used assert and // did not return on failure. however, this warning does not appear to show // any more (could be because new compiler args have been added). // the asserts are programmer benefit only; the os should never pass 0 args, // because the first is always the binary name. the only way assert would // evaluate to true, is if this parse function were implemented incorrectly, // which is unlikely because it's old code and has a specific use. // we should avoid using anything other than assert here, because it will // look like important code, which it's not really. assert(argsBase().m_pname != NULL); assert(argv != NULL); assert(argc >= 1); // set defaults argsBase().m_name = ARCH->getHostName(); // parse options for (i = 1; i < argc; ++i) { if (parseArg(argc, argv, i)) { continue; } else if (isArg(i, argc, argv, "--", NULL)) { // remaining arguments are not options ++i; break; } else if (argv[i][0] == '-') { std::cerr << "Unrecognized option: " << argv[i] << std::endl; m_bye(kExitArgs); } else { // this and remaining arguments are not options break; } } #if SYSAPI_WIN32 // suggest that user installs as a windows service. when launched as // service, process should automatically detect that it should run in // daemon mode. if (argsBase().m_daemon) { LOG((CLOG_ERR "the --daemon argument is not supported on windows. " "instead, install %s as a service (--service install)", argsBase().m_pname)); m_bye(kExitArgs); } #endif } void CApp::version() { char buffer[500]; sprintf( buffer, "%s %s, protocol version %d.%d\n%s", argsBase().m_pname, kVersion, kProtocolMajorVersion, kProtocolMinorVersion, kCopyright ); std::cout << buffer << std::endl; } int CApp::run(int argc, char** argv) { #if MAC_OS_X_VERSION_10_7 // dock hide only supported on lion :( ProcessSerialNumber psn = { 0, kCurrentProcess }; GetCurrentProcess(&psn); TransformProcessType(&psn, kProcessTransformToBackgroundApplication); #endif // install application in to arch appUtil().adoptApp(this); // HACK: fail by default (saves us setting result in each catch) int result = kExitFailed; try { result = appUtil().run(argc, argv); } catch (XExitApp& e) { // instead of showing a nasty error, just exit with the error code. // not sure if i like this behaviour, but it's probably better than // using the exit(int) function! result = e.getCode(); } catch (XBase& e) { LOG((CLOG_CRIT "Exception: %s\n", e.what())); } catch (XArch& e) { LOG((CLOG_CRIT "Init failed: %s" BYE, e.what().c_str(), argsBase().m_pname)); } catch (std::exception& e) { LOG((CLOG_CRIT "Exception: %s\n", e.what())); } catch (...) { LOG((CLOG_CRIT "An unexpected exception occurred.\n")); } appUtil().beforeAppExit(); return result; } int CApp::daemonMainLoop(int, const char**) { #if SYSAPI_WIN32 CSystemLogger sysLogger(daemonName(), false); #else CSystemLogger sysLogger(daemonName(), true); #endif return mainLoop(); } void CApp::setupFileLogging() { if (argsBase().m_logFile != NULL) { m_fileLog = new CFileLogOutputter(argsBase().m_logFile); CLOG->insert(m_fileLog); LOG((CLOG_DEBUG1 "logging to file (%s) enabled", argsBase().m_logFile)); } } void CApp::loggingFilterWarning() { if (CLOG->getFilter() > CLOG->getConsoleMaxLevel()) { if (argsBase().m_logFile == NULL) { LOG((CLOG_WARN "log messages above %s are NOT sent to console (use file logging)", CLOG->getFilterName(CLOG->getConsoleMaxLevel()))); } } } void CApp::initApp(int argc, const char** argv) { // parse command line parseArgs(argc, argv); // setup file logging after parsing args setupFileLogging(); // load configuration loadConfig(); if (!argsBase().m_disableTray) { // create a log buffer so we can show the latest message // as a tray icon tooltip CBufferedLogOutputter* logBuffer = new CBufferedLogOutputter(1000); CLOG->insert(logBuffer, true); // make the task bar receiver. the user can control this app // through the task bar. m_taskBarReceiver = m_createTaskBarReceiver(logBuffer); } } void CApp::initIpcClient() { m_ipcClient = new CIpcClient(); m_ipcClient->connect(); EVENTQUEUE->adoptHandler( CIpcClient::getMessageReceivedEvent(), m_ipcClient, new TMethodEventJob(this, &CApp::handleIpcMessage)); } void CApp::cleanupIpcClient() { m_ipcClient->disconnect(); EVENTQUEUE->removeHandler(CIpcClient::getMessageReceivedEvent(), m_ipcClient); delete m_ipcClient; } void CApp::handleIpcMessage(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); if (m->type() == kIpcShutdown) { LOG((CLOG_INFO "got ipc shutdown message")); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } } synergy-1.4.12-Source/src/lib/synergy/CApp.h0000600000175000017500000001337712021261364020550 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "common.h" #include "CString.h" #include "IApp.h" #include "CIpcClient.h" #if SYSAPI_WIN32 #include "CAppUtilWindows.h" #elif SYSAPI_UNIX #include "CAppUtilUnix.h" #endif class IArchTaskBarReceiver; class CBufferedLogOutputter; class ILogOutputter; class CFileLogOutputter; class CScreen; typedef IArchTaskBarReceiver* (*CreateTaskBarReceiverFunc)(const CBufferedLogOutputter*); class CApp : public IApp { public: CApp(CreateTaskBarReceiverFunc createTaskBarReceiver, CArgsBase* args); virtual ~CApp(); // Returns args that are common between server and client. CArgsBase& argsBase() const { return *m_args; } // Prints the current compiled version. virtual void version(); // Prints help specific to client or server. virtual void help() = 0; // Parse command line arguments. virtual void parseArgs(int argc, const char* const* argv) = 0; int run(int argc, char** argv); int daemonMainLoop(int, const char**); virtual void loadConfig() = 0; virtual bool loadConfig(const CString& pathname) = 0; // A description of the daemon (used only on Windows). virtual const char* daemonInfo() const = 0; // Function pointer for function to exit immediately. // TODO: this is old C code - use inheritance to normalize void (*m_bye)(int); // Returns true if argv[argi] is equal to name1 or name2. bool isArg(int argi, int argc, const char* const* argv, const char* name1, const char* name2, int minRequiredParameters = 0); static CApp& instance() { assert(s_instance != nullptr); return *s_instance; } // If --log was specified in args, then add a file logger. void setupFileLogging(); // If messages will be hidden (to improve performance), warn user. void loggingFilterWarning(); // Parses args, sets up file logging, and loads the config. void initApp(int argc, const char** argv); // HACK: accept non-const, but make it const anyway void initApp(int argc, char** argv) { initApp(argc, (const char**)argv); } ARCH_APP_UTIL& appUtil() { return m_appUtil; } virtual IArchTaskBarReceiver* taskBarReceiver() const { return m_taskBarReceiver; } virtual void setByeFunc(void(*bye)(int)) { m_bye = bye; } virtual void bye(int error) { m_bye(error); } private: void handleIpcMessage(const CEvent&, void*); protected: virtual void parseArgs(int argc, const char* const* argv, int &i); virtual bool parseArg(const int& argc, const char* const* argv, int& i); void initIpcClient(); void cleanupIpcClient(); IArchTaskBarReceiver* m_taskBarReceiver; bool m_suspended; private: CArgsBase* m_args; static CApp* s_instance; CFileLogOutputter* m_fileLog; CreateTaskBarReceiverFunc m_createTaskBarReceiver; ARCH_APP_UTIL m_appUtil; CIpcClient* m_ipcClient; }; #define BYE "\nTry `%s --help' for more information." #if WINAPI_MSWINDOWS #define DAEMON_RUNNING(running_) CArchMiscWindows::daemonRunning(running_) #else #define DAEMON_RUNNING(running_) #endif #define HELP_COMMON_INFO_1 \ " -d, --debug filter out log messages with priority below level.\n" \ " level may be: FATAL, ERROR, WARNING, NOTE, INFO,\n" \ " DEBUG, DEBUGn (1-5).\n" \ " -n, --name use screen-name instead the hostname to identify\n" \ " this screen in the configuration.\n" \ " -1, --no-restart do not try to restart on failure.\n" \ "* --restart restart the server automatically if it fails.\n" \ " -l --log write log messages to file.\n" \ " --no-tray disable the system tray icon.\n" #define HELP_COMMON_INFO_2 \ " -h, --help display this help and exit.\n" \ " --version display version information and exit.\n" #define HELP_COMMON_ARGS \ " [--name ]" \ " [--restart|--no-restart]" \ " [--debug ]" // system args (windows/unix) #if SYSAPI_UNIX // unix daemon mode args # define HELP_SYS_ARGS \ " [--daemon|--no-daemon]" # define HELP_SYS_INFO \ " -f, --no-daemon run in the foreground.\n" \ "* --daemon run as a daemon.\n" #elif SYSAPI_WIN32 #if GAME_DEVICE_SUPPORT # define HELP_GAME_DEVICE \ " --game-mode enable game device support. valid modes:\n" \ " xinput, joyinfoex\n" \ " --game-poll game polling mode. valid modes:\n" \ " dynamic, static\n" \ " --game-poll-freq frequency for static polling.\n" #else # define HELP_GAME_DEVICE "" #endif // windows args # define HELP_SYS_ARGS \ " [--service ] [--relaunch] [--exit-pause]" # define HELP_SYS_INFO \ " --service manage the windows service, valid options are:\n" \ " install/uninstall/start/stop\n" \ " --relaunch persistently relaunches process in current user \n" \ " session (useful for vista and upward).\n" \ " --exit-pause wait for key press on exit, can be useful for\n" \ " reading error messages that occur on exit.\n" \ HELP_GAME_DEVICE #endif synergy-1.4.12-Source/src/lib/synergy/CAppUtil.cpp0000600000175000017500000000237212021261364021732 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CAppUtil.h" CAppUtil* CAppUtil::s_instance = nullptr; CAppUtil::CAppUtil() : m_app(nullptr) { s_instance = this; } CAppUtil::~CAppUtil() { } bool CAppUtil::parseArg(const int& argc, const char* const* argv, int& i) { // no common platform args (yet) return false; } void CAppUtil::adoptApp(IApp* app) { app->setByeFunc(&exitAppStatic); m_app = app; } IApp& CAppUtil::app() const { assert(m_app != nullptr); return *m_app; } CAppUtil& CAppUtil::instance() { assert(s_instance != nullptr); return *s_instance; } synergy-1.4.12-Source/src/lib/synergy/CAppUtil.h0000600000175000017500000000234312021261364021375 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IAppUtil.h" #include "XSynergy.h" class CAppUtil : public IAppUtil { public: CAppUtil(); virtual ~CAppUtil(); virtual bool parseArg(const int& argc, const char* const* argv, int& i); virtual void adoptApp(IApp* app); IApp& app() const; virtual void exitApp(int code) { throw XExitApp(code); } static CAppUtil& instance(); static void exitAppStatic(int code) { instance().exitApp(code); } virtual void beforeAppExit() {} private: IApp* m_app; static CAppUtil* s_instance; }; synergy-1.4.12-Source/src/lib/synergy/CAppUtilUnix.cpp0000600000175000017500000000314012021261364022570 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CAppUtilUnix.h" #include "CArgsBase.h" CAppUtilUnix::CAppUtilUnix() { } CAppUtilUnix::~CAppUtilUnix() { } bool CAppUtilUnix::parseArg(const int& argc, const char* const* argv, int& i) { #if WINAPI_XWINDOWS if (app().isArg(i, argc, argv, "-display", "--display", 1)) { // use alternative display app().argsBase().m_display = argv[++i]; } else if (app().isArg(i, argc, argv, NULL, "--no-xinitthreads")) { app().argsBase().m_disableXInitThreads = true; } else { // option not supported here return false; } return true; #else // no options for carbon return false; #endif } int standardStartupStatic(int argc, char** argv) { return CAppUtil::instance().app().standardStartup(argc, argv); } int CAppUtilUnix::run(int argc, char** argv) { return app().runInner(argc, argv, NULL, &standardStartupStatic); } void CAppUtilUnix::startNode() { app().startNode(); } synergy-1.4.12-Source/src/lib/synergy/CAppUtilUnix.h0000600000175000017500000000177512021261364022251 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CAppUtil.h" #define ARCH_APP_UTIL CAppUtilUnix class CAppUtilUnix : public CAppUtil { public: CAppUtilUnix(); virtual ~CAppUtilUnix(); bool parseArg(const int& argc, const char* const* argv, int& i); int run(int argc, char** argv); void startNode(); }; synergy-1.4.12-Source/src/lib/synergy/CAppUtilWindows.cpp0000600000175000017500000001246312021261364023307 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CAppUtilWindows.h" #include "Version.h" #include "CLog.h" #include "XArchWindows.h" #include "CArchMiscWindows.h" #include "CApp.h" #include "LogOutputters.h" #include "CMSWindowsScreen.h" #include "XSynergy.h" #include "IArchTaskBarReceiver.h" #include "CScreen.h" #include "CArgsBase.h" #include "IEventQueue.h" #include "CEvent.h" #include #include #include CAppUtilWindows::CAppUtilWindows() : m_exitMode(kExitModeNormal) { if (SetConsoleCtrlHandler((PHANDLER_ROUTINE)consoleHandler, TRUE) == FALSE) { throw XArch(new XArchEvalWindows()); } } CAppUtilWindows::~CAppUtilWindows() { } BOOL WINAPI CAppUtilWindows::consoleHandler(DWORD) { LOG((CLOG_INFO "got shutdown signal")); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); return TRUE; } bool CAppUtilWindows::parseArg(const int& argc, const char* const* argv, int& i) { if (app().isArg(i, argc, argv, NULL, "--service")) { LOG((CLOG_WARN "obsolete argument --service, use synergyd instead.")); app().bye(kExitFailed); } else if (app().isArg(i, argc, argv, NULL, "--exit-pause")) { app().argsBase().m_pauseOnExit = true; } else if (app().isArg(i, argc, argv, NULL, "--game-mode")) { CString mode(argv[++i]); if (mode == "xinput") { app().argsBase().m_gameDevice.m_mode = CGameDeviceInfo::kGameModeXInput; } else if (mode == "joyinfoex") { app().argsBase().m_gameDevice.m_mode = CGameDeviceInfo::kGameModeJoyInfoEx; } } else if (app().isArg(i, argc, argv, NULL, "--game-poll")) { CString mode(argv[++i]); if (mode == "dynamic") { app().argsBase().m_gameDevice.m_poll = CGameDeviceInfo::kGamePollDynamic; } else if (mode == "static") { app().argsBase().m_gameDevice.m_poll = CGameDeviceInfo::kGamePollStatic; } } else if (app().isArg(i, argc, argv, NULL, "--game-poll-freq")) { app().argsBase().m_gameDevice.m_pollFreq = atoi(argv[++i]); } else if (app().isArg(i, argc, argv, NULL, "--stop-on-desk-switch")) { app().argsBase().m_stopOnDeskSwitch = true; } else { // option not supported here return false; } return true; } static int mainLoopStatic() { return CAppUtil::instance().app().mainLoop(); } int CAppUtilWindows::daemonNTMainLoop(int argc, const char** argv) { app().initApp(argc, argv); debugServiceWait(); // NB: what the hell does this do?! app().argsBase().m_backend = false; return CArchMiscWindows::runDaemon(mainLoopStatic); } void CAppUtilWindows::exitApp(int code) { switch (m_exitMode) { case kExitModeDaemon: CArchMiscWindows::daemonFailed(code); break; default: throw XExitApp(code); } } int daemonNTMainLoopStatic(int argc, const char** argv) { return CAppUtilWindows::instance().daemonNTMainLoop(argc, argv); } int CAppUtilWindows::daemonNTStartup(int, char**) { CSystemLogger sysLogger(app().daemonName(), false); m_exitMode = kExitModeDaemon; return ARCH->daemonize(app().daemonName(), daemonNTMainLoopStatic); } static int daemonNTStartupStatic(int argc, char** argv) { return CAppUtilWindows::instance().daemonNTStartup(argc, argv); } static int foregroundStartupStatic(int argc, char** argv) { return CAppUtil::instance().app().foregroundStartup(argc, argv); } void CAppUtilWindows::beforeAppExit() { // this can be handy for debugging, since the application is launched in // a new console window, and will normally close on exit (making it so // that we can't see error messages). if (app().argsBase().m_pauseOnExit) { std::cout << std::endl << "press any key to exit..." << std::endl; int c = _getch(); } } int CAppUtilWindows::run(int argc, char** argv) { // record window instance for tray icon, etc CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); CMSWindowsScreen::init(CArchMiscWindows::instanceWin32()); CThread::getCurrentThread().setPriority(-14); StartupFunc startup; if (CArchMiscWindows::wasLaunchedAsService()) { startup = &daemonNTStartupStatic; } else { startup = &foregroundStartupStatic; app().argsBase().m_daemon = false; } return app().runInner(argc, argv, NULL, startup); } CAppUtilWindows& CAppUtilWindows::instance() { return (CAppUtilWindows&)CAppUtil::instance(); } void CAppUtilWindows::debugServiceWait() { if (app().argsBase().m_debugServiceWait) { while(true) { // this code is only executed when the process is launched via the // windows service controller (and --debug-service-wait arg is // used). to debug, set a breakpoint on this line so that // execution is delayed until the debugger is attached. ARCH->sleep(1); LOG((CLOG_INFO "waiting for debugger to attach")); } } } void CAppUtilWindows::startNode() { app().startNode(); } synergy-1.4.12-Source/src/lib/synergy/CAppUtilWindows.h0000600000175000017500000000265512021261364022756 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CAppUtil.h" #include "CString.h" #define WIN32_LEAN_AND_MEAN #include "Windows.h" #define ARCH_APP_UTIL CAppUtilWindows enum AppExitMode { kExitModeNormal, kExitModeDaemon }; class CAppUtilWindows : public CAppUtil { public: CAppUtilWindows(); virtual ~CAppUtilWindows(); bool parseArg(const int& argc, const char* const* argv, int& i); int daemonNTStartup(int, char**); int daemonNTMainLoop(int argc, const char** argv); void debugServiceWait(); int run(int argc, char** argv); void exitApp(int code); void beforeAppExit(); static CAppUtilWindows& instance(); void startNode(); private: AppExitMode m_exitMode; static BOOL WINAPI consoleHandler(DWORD CEvent); }; synergy-1.4.12-Source/src/lib/synergy/CArgsBase.cpp0000600000175000017500000000243112021261364022037 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArgsBase.h" CArgsBase::CArgsBase() : #if SYSAPI_WIN32 m_daemon(false), // daemon mode not supported on windows (use --service) m_debugServiceWait(false), m_pauseOnExit(false), m_stopOnDeskSwitch(false), #else m_daemon(true), // backward compatibility for unix (daemon by default) #endif #if WINAPI_XWINDOWS m_disableXInitThreads(false), #endif m_backend(false), m_restartable(true), m_noHooks(false), m_disableTray(false), m_pname(NULL), m_logFilter(NULL), m_logFile(NULL), m_display(NULL), m_enableVnc(false), m_enableIpc(false) { } CArgsBase::~CArgsBase() { } synergy-1.4.12-Source/src/lib/synergy/CArgsBase.h0000600000175000017500000000247212131107263021510 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CString.h" #include "CGameDevice.h" #include "CCryptoOptions.h" class CArgsBase { public: CArgsBase(); virtual ~CArgsBase(); bool m_daemon; bool m_backend; bool m_restartable; bool m_noHooks; const char* m_pname; const char* m_logFilter; const char* m_logFile; const char* m_display; CString m_name; bool m_disableTray; bool m_enableVnc; bool m_enableIpc; CCryptoOptions m_crypto; #if SYSAPI_WIN32 bool m_debugServiceWait; bool m_pauseOnExit; CGameDeviceInfo m_gameDevice; bool m_stopOnDeskSwitch; #endif #if WINAPI_XWINDOWS bool m_disableXInitThreads; #endif }; synergy-1.4.12-Source/src/lib/synergy/CClientApp.cpp0000600000175000017500000003334312131107263022234 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientApp.h" #include "CLog.h" #include "CArch.h" #include "XSocket.h" #include "Version.h" #include "ProtocolTypes.h" #include "CString.h" #include "CScreen.h" #include "CEvent.h" #include "CClient.h" #include "CNetworkAddress.h" #include "IArchTaskBarReceiver.h" #include "IEventQueue.h" #include "TMethodEventJob.h" #include "CTCPSocketFactory.h" #include "XScreen.h" #include "LogOutputters.h" #include "CSocketMultiplexer.h" #include "CEventQueue.h" #include "CThread.h" #include "TMethodJob.h" #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #if VNC_SUPPORT #include "vnc/win/winvnc/winvnc.h" #endif #endif #if SYSAPI_WIN32 && GAME_DEVICE_SUPPORT #include #include "XInputHook.h" #endif #if WINAPI_MSWINDOWS #include "CMSWindowsScreen.h" #elif WINAPI_XWINDOWS #include "CXWindowsScreen.h" #elif WINAPI_CARBON #include "COSXScreen.h" #endif #include #include #define RETRY_TIME 1.0 CClientApp::CClientApp(CreateTaskBarReceiverFunc createTaskBarReceiver) : CApp(createTaskBarReceiver, new CArgs()), s_client(NULL), s_clientScreen(NULL), m_vncThread(NULL) { } CClientApp::~CClientApp() { if (m_vncThread) delete m_vncThread; } CClientApp::CArgs::CArgs() : m_yscroll(0), m_serverAddress(NULL) { } CClientApp::CArgs::~CArgs() { } bool CClientApp::parseArg(const int& argc, const char* const* argv, int& i) { if (CApp::parseArg(argc, argv, i)) { // found common arg return true; } else if (isArg(i, argc, argv, NULL, "--camp")) { // ignore -- included for backwards compatibility } else if (isArg(i, argc, argv, NULL, "--no-camp")) { // ignore -- included for backwards compatibility } else if (isArg(i, argc, argv, NULL, "--yscroll", 1)) { // define scroll args().m_yscroll = atoi(argv[++i]); } else { // option not supported here return false; } // argument was valid return true; } void CClientApp::parseArgs(int argc, const char* const* argv) { // asserts values, sets defaults, and parses args int i; CApp::parseArgs(argc, argv, i); // exactly one non-option argument (server-address) if (i == argc) { LOG((CLOG_PRINT "%s: a server address or name is required" BYE, args().m_pname, args().m_pname)); m_bye(kExitArgs); } if (i + 1 != argc) { LOG((CLOG_PRINT "%s: unrecognized option `%s'" BYE, args().m_pname, argv[i], args().m_pname)); m_bye(kExitArgs); } // save server address try { *args().m_serverAddress = CNetworkAddress(argv[i], kDefaultPort); args().m_serverAddress->resolve(); } catch (XSocketAddress& e) { // allow an address that we can't look up if we're restartable. // we'll try to resolve the address each time we connect to the // server. a bad port will never get better. patch by Brent // Priddy. if (!args().m_restartable || e.getError() == XSocketAddress::kBadPort) { LOG((CLOG_PRINT "%s: %s" BYE, args().m_pname, e.what(), args().m_pname)); m_bye(kExitFailed); } } // set log filter if (!CLOG->setFilter(args().m_logFilter)) { LOG((CLOG_PRINT "%s: unrecognized log level `%s'" BYE, args().m_pname, args().m_logFilter, args().m_pname)); m_bye(kExitArgs); } // identify system LOG((CLOG_INFO "%s Client on %s %s", kAppVersion, ARCH->getOSName().c_str(), ARCH->getPlatformName().c_str())); loggingFilterWarning(); } void CClientApp::help() { #if WINAPI_XWINDOWS # define WINAPI_ARG \ " [--display ] [--no-xinitthreads]" # define WINAPI_INFO \ " --display connect to the X server at \n" \ " --no-xinitthreads do not call XInitThreads()\n" #else # define WINAPI_ARG # define WINAPI_INFO #endif char buffer[2000]; sprintf( buffer, "Usage: %s" " [--yscroll ]" WINAPI_ARG HELP_SYS_ARGS HELP_COMMON_ARGS " " "\n\n" "Connect to a synergy mouse/keyboard sharing server.\n" "\n" HELP_COMMON_INFO_1 WINAPI_INFO HELP_SYS_INFO " --yscroll defines the vertical scrolling delta, which is\n" " 120 by default.\n" HELP_COMMON_INFO_2 "\n" "* marks defaults.\n" "\n" "The server address is of the form: [][:]. The hostname\n" "must be the address or hostname of the server. The port overrides the\n" "default port, %d.\n", args().m_pname, kDefaultPort ); LOG((CLOG_PRINT "%s", buffer)); } const char* CClientApp::daemonName() const { #if SYSAPI_WIN32 return "Synergy Client"; #elif SYSAPI_UNIX return "synergyc"; #endif } const char* CClientApp::daemonInfo() const { #if SYSAPI_WIN32 return "Allows another computer to share it's keyboard and mouse with this computer."; #elif SYSAPI_UNIX return ""; #endif } CScreen* CClientApp::createScreen() { #if WINAPI_MSWINDOWS return new CScreen(new CMSWindowsScreen( false, args().m_noHooks, args().m_gameDevice, args().m_stopOnDeskSwitch)); #elif WINAPI_XWINDOWS return new CScreen(new CXWindowsScreen( args().m_display, false, args().m_disableXInitThreads, args().m_yscroll, *EVENTQUEUE)); #elif WINAPI_CARBON return new CScreen(new COSXScreen(false)); #endif } void CClientApp::updateStatus() { updateStatus(""); } void CClientApp::updateStatus(const CString& msg) { if (m_taskBarReceiver) { m_taskBarReceiver->updateStatus(s_client, msg); } } void CClientApp::resetRestartTimeout() { // retry time can nolonger be changed //s_retryTime = 0.0; } double CClientApp::nextRestartTimeout() { // retry at a constant rate (Issue 52) return RETRY_TIME; /* // choose next restart timeout. we start with rapid retries // then slow down. if (s_retryTime < 1.0) { s_retryTime = 1.0; } else if (s_retryTime < 3.0) { s_retryTime = 3.0; } else { s_retryTime = 5.0; } return s_retryTime; */ } void CClientApp::handleScreenError(const CEvent&, void*) { LOG((CLOG_CRIT "error on screen")); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } CScreen* CClientApp::openClientScreen() { CScreen* screen = createScreen(); EVENTQUEUE->adoptHandler(IScreen::getErrorEvent(), screen->getEventTarget(), new TMethodEventJob( this, &CClientApp::handleScreenError)); return screen; } void CClientApp::closeClientScreen(CScreen* screen) { if (screen != NULL) { EVENTQUEUE->removeHandler(IScreen::getErrorEvent(), screen->getEventTarget()); delete screen; } } void CClientApp::handleClientRestart(const CEvent&, void* vtimer) { // discard old timer CEventQueueTimer* timer = reinterpret_cast(vtimer); EVENTQUEUE->deleteTimer(timer); EVENTQUEUE->removeHandler(CEvent::kTimer, timer); // reconnect startClient(); } void CClientApp::scheduleClientRestart(double retryTime) { // install a timer and handler to retry later LOG((CLOG_DEBUG "retry in %.0f seconds", retryTime)); CEventQueueTimer* timer = EVENTQUEUE->newOneShotTimer(retryTime, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, timer, new TMethodEventJob(this, &CClientApp::handleClientRestart, timer)); } void CClientApp::handleClientConnected(const CEvent&, void*) { LOG((CLOG_NOTE "connected to server")); resetRestartTimeout(); updateStatus(); } void CClientApp::handleClientFailed(const CEvent& e, void*) { CClient::CFailInfo* info = reinterpret_cast(e.getData()); updateStatus(CString("Failed to connect to server: ") + info->m_what); if (!args().m_restartable || !info->m_retry) { LOG((CLOG_ERR "failed to connect to server: %s", info->m_what.c_str())); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } else { LOG((CLOG_WARN "failed to connect to server: %s", info->m_what.c_str())); if (!m_suspended) { scheduleClientRestart(nextRestartTimeout()); } } delete info; } void CClientApp::handleClientDisconnected(const CEvent&, void*) { LOG((CLOG_NOTE "disconnected from server")); if (!args().m_restartable) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } else if (!m_suspended) { s_client->connect(); } updateStatus(); } CClient* CClientApp::openClient(const CString& name, const CNetworkAddress& address, CScreen* screen, const CCryptoOptions& crypto) { CClient* client = new CClient( EVENTQUEUE, name, address, new CTCPSocketFactory, NULL, screen, crypto); try { EVENTQUEUE->adoptHandler( CClient::getConnectedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CClientApp::handleClientConnected)); EVENTQUEUE->adoptHandler( CClient::getConnectionFailedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CClientApp::handleClientFailed)); EVENTQUEUE->adoptHandler( CClient::getDisconnectedEvent(), client->getEventTarget(), new TMethodEventJob(this, &CClientApp::handleClientDisconnected)); } catch (std::bad_alloc &ba) { delete client; throw ba; } return client; } void CClientApp::closeClient(CClient* client) { if (client == NULL) { return; } EVENTQUEUE->removeHandler(CClient::getConnectedEvent(), client); EVENTQUEUE->removeHandler(CClient::getConnectionFailedEvent(), client); EVENTQUEUE->removeHandler(CClient::getDisconnectedEvent(), client); delete client; } int CClientApp::foregroundStartup(int argc, char** argv) { initApp(argc, argv); // never daemonize return mainLoop(); } bool CClientApp::startClient() { double retryTime; CScreen* clientScreen = NULL; try { if (s_clientScreen == NULL) { clientScreen = openClientScreen(); s_client = openClient(args().m_name, *args().m_serverAddress, clientScreen, args().m_crypto); s_clientScreen = clientScreen; LOG((CLOG_NOTE "started client")); } #if SYSAPI_WIN32 && GAME_DEVICE_SUPPORT if (args().m_gameDevice.m_mode == CGameDeviceInfo::kGameModeXInput) { // TODO: currently this is failing because we're not // forcing compile with the DX XInput.h (so the win // SDK is being used)... we need to figure out how to // tell cmake to prefer the DX include path. LOG((CLOG_DEBUG "installing xinput hook")); InstallXInputHook(); } #endif s_client->connect(); updateStatus(); return true; } catch (XScreenUnavailable& e) { LOG((CLOG_WARN "secondary screen unavailable: %s", e.what())); closeClientScreen(clientScreen); updateStatus(CString("secondary screen unavailable: ") + e.what()); retryTime = e.getRetryTime(); } catch (XScreenOpenFailure& e) { LOG((CLOG_CRIT "failed to start client: %s", e.what())); closeClientScreen(clientScreen); return false; } catch (XBase& e) { LOG((CLOG_CRIT "failed to start client: %s", e.what())); closeClientScreen(clientScreen); return false; } if (args().m_restartable) { scheduleClientRestart(retryTime); return true; } else { // don't try again return false; } } void CClientApp::stopClient() { #if SYSAPI_WIN32 && GAME_DEVICE_SUPPORT if (args().m_gameDevice.m_mode == CGameDeviceInfo::kGameModeXInput) { LOG((CLOG_DEBUG "removing xinput hook")); RemoveXInputHook(); } #endif closeClient(s_client); closeClientScreen(s_clientScreen); s_client = NULL; s_clientScreen = NULL; } int CClientApp::mainLoop() { // create socket multiplexer. this must happen after daemonization // on unix because threads evaporate across a fork(). CSocketMultiplexer multiplexer; // start client, etc appUtil().startNode(); // init ipc client after node start, since create a new screen wipes out // the event queue (the screen ctors call adoptBuffer). if (argsBase().m_enableIpc) { initIpcClient(); } // load all available plugins. ARCH->plugin().init(s_clientScreen->getEventTarget()); // run event loop. if startClient() failed we're supposed to retry // later. the timer installed by startClient() will take care of // that. DAEMON_RUNNING(true); EVENTQUEUE->loop(); DAEMON_RUNNING(false); // close down LOG((CLOG_DEBUG1 "stopping client")); stopClient(); updateStatus(); LOG((CLOG_NOTE "stopped client")); if (argsBase().m_enableIpc) { cleanupIpcClient(); } return kExitSuccess; } static int daemonMainLoopStatic(int argc, const char** argv) { return CClientApp::instance().daemonMainLoop(argc, argv); } int CClientApp::standardStartup(int argc, char** argv) { initApp(argc, argv); // daemonize if requested if (args().m_daemon) { return ARCH->daemonize(daemonName(), &daemonMainLoopStatic); } else { return mainLoop(); } } int CClientApp::runInner(int argc, char** argv, ILogOutputter* outputter, StartupFunc startup) { // general initialization args().m_serverAddress = new CNetworkAddress; args().m_pname = ARCH->getBasename(argv[0]); // install caller's output filter if (outputter != NULL) { CLOG->insert(outputter); } int result; try { // run result = startup(argc, argv); } catch (...) { if (m_taskBarReceiver) { // done with task bar receiver delete m_taskBarReceiver; } delete args().m_serverAddress; throw; } return result; } void CClientApp::startNode() { if (args().m_enableVnc) { m_vncThread = new CThread(new TMethodJob( this, &CClientApp::vncThread, NULL)); } // start the client. if this return false then we've failed and // we shouldn't retry. LOG((CLOG_DEBUG1 "starting client")); if (!startClient()) { m_bye(kExitFailed); } } void CClientApp::vncThread(void*) { #if VNC_SUPPORT vncServerMain(0, NULL); #endif } synergy-1.4.12-Source/src/lib/synergy/CClientApp.h0000600000175000017500000000536412131107263021703 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CApp.h" #include "CArgsBase.h" class CScreen; class CEvent; class CClient; class CNetworkAddress; class CThread; class CClientApp : public CApp { public: class CArgs : public CArgsBase { public: CArgs(); ~CArgs(); public: int m_yscroll; CNetworkAddress* m_serverAddress; }; CClientApp(CreateTaskBarReceiverFunc createTaskBarReceiver); virtual ~CClientApp(); // Parse client specific command line arguments. void parseArgs(int argc, const char* const* argv); // Prints help specific to client. void help(); // Returns arguments that are common and for client. CArgs& args() const { return (CArgs&)argsBase(); } const char* daemonName() const; const char* daemonInfo() const; // TODO: move to server only (not supported on client) void loadConfig() { } bool loadConfig(const CString& pathname) { return false; } int foregroundStartup(int argc, char** argv); int standardStartup(int argc, char** argv); int runInner(int argc, char** argv, ILogOutputter* outputter, StartupFunc startup); CScreen* createScreen(); void updateStatus(); void updateStatus(const CString& msg); void resetRestartTimeout(); double nextRestartTimeout(); void handleScreenError(const CEvent&, void*); CScreen* openClientScreen(); void closeClientScreen(CScreen* screen); void handleClientRestart(const CEvent&, void* vtimer); void scheduleClientRestart(double retryTime); void handleClientConnected(const CEvent&, void*); void handleClientFailed(const CEvent& e, void*); void handleClientDisconnected(const CEvent&, void*); CClient* openClient(const CString& name, const CNetworkAddress& address, CScreen* screen, const CCryptoOptions& crypto); void closeClient(CClient* client); bool startClient(); void stopClient(); int mainLoop(); void startNode(); static CClientApp& instance() { return (CClientApp&)CApp::instance(); } private: virtual bool parseArg(const int& argc, const char* const* argv, int& i); void vncThread(void*); private: CClient* s_client; CScreen* s_clientScreen; CThread* m_vncThread; }; synergy-1.4.12-Source/src/lib/synergy/CClientTaskBarReceiver.cpp0000600000175000017500000000544212021261364024530 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientTaskBarReceiver.h" #include "CClient.h" #include "CLock.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "CArch.h" #include "Version.h" // // CClientTaskBarReceiver // CClientTaskBarReceiver::CClientTaskBarReceiver() : m_state(kNotRunning) { // do nothing } CClientTaskBarReceiver::~CClientTaskBarReceiver() { // do nothing } void CClientTaskBarReceiver::updateStatus(CClient* client, const CString& errorMsg) { { // update our status m_errorMessage = errorMsg; if (client == NULL) { if (m_errorMessage.empty()) { m_state = kNotRunning; } else { m_state = kNotWorking; } } else { m_server = client->getServerAddress().getHostname(); if (client->isConnected()) { m_state = kConnected; } else if (client->isConnecting()) { m_state = kConnecting; } else { m_state = kNotConnected; } } // let subclasses have a go onStatusChanged(client); } // tell task bar ARCH->updateReceiver(this); } CClientTaskBarReceiver::EState CClientTaskBarReceiver::getStatus() const { return m_state; } const CString& CClientTaskBarReceiver::getErrorMessage() const { return m_errorMessage; } void CClientTaskBarReceiver::quit() { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CClientTaskBarReceiver::onStatusChanged(CClient*) { // do nothing } void CClientTaskBarReceiver::lock() const { // do nothing } void CClientTaskBarReceiver::unlock() const { // do nothing } std::string CClientTaskBarReceiver::getToolTip() const { switch (m_state) { case kNotRunning: return CStringUtil::print("%s: Not running", kAppVersion); case kNotWorking: return CStringUtil::print("%s: %s", kAppVersion, m_errorMessage.c_str()); case kNotConnected: return CStringUtil::print("%s: Not connected: %s", kAppVersion, m_errorMessage.c_str()); case kConnecting: return CStringUtil::print("%s: Connecting to %s...", kAppVersion, m_server.c_str()); case kConnected: return CStringUtil::print("%s: Connected to %s", kAppVersion, m_server.c_str()); default: return ""; } } synergy-1.4.12-Source/src/lib/synergy/CClientTaskBarReceiver.h0000600000175000017500000000447612021261364024203 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIENTTASKBARRECEIVER_H #define CCLIENTTASKBARRECEIVER_H #include "CString.h" #include "IArchTaskBarReceiver.h" #include "LogOutputters.h" #include "CClient.h" //! Implementation of IArchTaskBarReceiver for the synergy server class CClientTaskBarReceiver : public IArchTaskBarReceiver { public: CClientTaskBarReceiver(); virtual ~CClientTaskBarReceiver(); //! @name manipulators //@{ //! Update status /*! Determine the status and query required information from the client. */ void updateStatus(CClient*, const CString& errorMsg); void updateStatus(INode* n, const CString& errorMsg) { updateStatus((CClient*)n, errorMsg); } //@} // IArchTaskBarReceiver overrides virtual void showStatus() = 0; virtual void runMenu(int x, int y) = 0; virtual void primaryAction() = 0; virtual void lock() const; virtual void unlock() const; virtual const Icon getIcon() const = 0; virtual std::string getToolTip() const; virtual void cleanup() {} protected: enum EState { kNotRunning, kNotWorking, kNotConnected, kConnecting, kConnected, kMaxState }; //! Get status EState getStatus() const; //! Get error message const CString& getErrorMessage() const; //! Quit app /*! Causes the application to quit gracefully */ void quit(); //! Status change notification /*! Called when status changes. The default implementation does nothing. */ virtual void onStatusChanged(CClient* client); private: EState m_state; CString m_errorMessage; CString m_server; }; IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer); #endif synergy-1.4.12-Source/src/lib/synergy/CClipboard.cpp0000600000175000017500000000364712021261364022261 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClipboard.h" // // CClipboard // CClipboard::CClipboard() : m_open(false), m_owner(false) { open(0); empty(); close(); } CClipboard::~CClipboard() { // do nothing } bool CClipboard::empty() { assert(m_open); // clear all data for (SInt32 index = 0; index < kNumFormats; ++index) { m_data[index] = ""; m_added[index] = false; } // save time m_timeOwned = m_time; // we're the owner now m_owner = true; return true; } void CClipboard::add(EFormat format, const CString& data) { assert(m_open); assert(m_owner); m_data[format] = data; m_added[format] = true; } bool CClipboard::open(Time time) const { assert(!m_open); m_open = true; m_time = time; return true; } void CClipboard::close() const { assert(m_open); m_open = false; } CClipboard::Time CClipboard::getTime() const { return m_timeOwned; } bool CClipboard::has(EFormat format) const { assert(m_open); return m_added[format]; } CString CClipboard::get(EFormat format) const { assert(m_open); return m_data[format]; } void CClipboard::unmarshall(const CString& data, Time time) { IClipboard::unmarshall(this, data, time); } CString CClipboard::marshall() const { return IClipboard::marshall(this); } synergy-1.4.12-Source/src/lib/synergy/CClipboard.h0000600000175000017500000000354612021261364021724 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CCLIPBOARD_H #define CCLIPBOARD_H #include "IClipboard.h" //! Memory buffer clipboard /*! This class implements a clipboard that stores data in memory. */ class CClipboard : public IClipboard { public: CClipboard(); virtual ~CClipboard(); //! @name manipulators //@{ //! Unmarshall clipboard data /*! Extract marshalled clipboard data and store it in this clipboard. Sets the clipboard time to \c time. */ void unmarshall(const CString& data, Time time); //@} //! @name accessors //@{ //! Marshall clipboard data /*! Merge this clipboard's data into a single buffer that can be later unmarshalled to restore the clipboard and return the buffer. */ CString marshall() const; //@} // IClipboard overrides virtual bool empty(); virtual void add(EFormat, const CString& data); virtual bool open(Time) const; virtual void close() const; virtual Time getTime() const; virtual bool has(EFormat) const; virtual CString get(EFormat) const; private: mutable bool m_open; mutable Time m_time; bool m_owner; Time m_timeOwned; bool m_added[kNumFormats]; CString m_data[kNumFormats]; }; #endif synergy-1.4.12-Source/src/lib/synergy/CCryptoMode.cpp0000600000175000017500000001030412131402061022424 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CCryptoMode.h" #include "XSynergy.h" using namespace CryptoPP; CCryptoMode::CCryptoMode(ECryptoMode mode, bool encryption) : m_mode(mode), m_crypto(NULL), m_encryption(encryption) { if (m_encryption) { switch (m_mode) { case kOfb: m_crypto = new COfbModeEnc; break; case kCfb: m_crypto = new CCfbModeEnc; break; case kCtr: m_crypto = new CCtrModeEnc; break; case kGcm: m_crypto = new CGcmModeEnc; break; case kDisabled: break; default: throw XBadCryptoMode(); } } else { switch (m_mode) { case kOfb: m_crypto = new COfbModeDec; break; case kCfb: m_crypto = new CCfbModeDec; break; case kCtr: m_crypto = new CCtrModeDec; break; case kGcm: m_crypto = new CGcmModeDec; break; case kDisabled: break; default: throw XBadCryptoMode(); } } } CCryptoMode::~CCryptoMode() { if (m_crypto == NULL) { return; } if (m_encryption) { switch (m_mode) { case kOfb: delete reinterpret_cast(m_crypto); break; case kCfb: delete reinterpret_cast(m_crypto); break; case kCtr: delete reinterpret_cast(m_crypto); break; case kGcm: delete reinterpret_cast(m_crypto); break; } } else { switch (m_mode) { case kOfb: delete reinterpret_cast(m_crypto); break; case kCfb: delete reinterpret_cast(m_crypto); break; case kCtr: delete reinterpret_cast(m_crypto); break; case kGcm: delete reinterpret_cast(m_crypto); break; } } } void CCryptoMode::processData(byte* out, const byte* in, size_t length) { if (m_crypto == NULL) { return; } if (m_encryption) { switch (m_mode) { case kOfb: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kCfb: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kCtr: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kGcm: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; } } else { switch (m_mode) { case kOfb: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kCfb: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kCtr: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; case kGcm: reinterpret_cast(m_crypto)->ProcessData(out, in, length); break; } } } void CCryptoMode::setKeyWithIv(const byte* key, size_t length, const byte* iv) { if (m_crypto == NULL) { return; } if (m_encryption) { switch (m_mode) { case kOfb: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kCfb: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kCtr: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kGcm: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; } } else { switch (m_mode) { case kOfb: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kCfb: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kCtr: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; case kGcm: reinterpret_cast(m_crypto)->SetKeyWithIV(key, length, iv); break; } } } synergy-1.4.12-Source/src/lib/synergy/CCryptoMode.h0000600000175000017500000000371612131402061022102 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include #include #include "ECryptoMode.h" #include "CString.h" //! Encapsulation of modes /*! Polymorphism is tricky in Crypto++, so we encapsulate all crypto modes and switch based on an enum for ctor, dtor and all functions. */ class CCryptoMode { public: CCryptoMode(ECryptoMode mode, bool encryption = true); ~CCryptoMode(); //! Encrypt or decrypt data void processData(byte* out, const byte* in, size_t length); //! Variable length key and initialization vector void setKeyWithIv(const byte* key, size_t length, const byte* iv); private: typedef CryptoPP::OFB_Mode::Encryption COfbModeEnc; typedef CryptoPP::CFB_Mode::Encryption CCfbModeEnc; typedef CryptoPP::CTR_Mode::Encryption CCtrModeEnc; typedef CryptoPP::GCM::Encryption CGcmModeEnc; typedef CryptoPP::OFB_Mode::Decryption COfbModeDec; typedef CryptoPP::CFB_Mode::Decryption CCfbModeDec; typedef CryptoPP::CTR_Mode::Decryption CCtrModeDec; typedef CryptoPP::GCM::Decryption CGcmModeDec; static ECryptoMode parseMode(CString& mode); ECryptoMode m_mode; void* m_crypto; bool m_encryption; }; synergy-1.4.12-Source/src/lib/synergy/CCryptoOptions.cpp0000600000175000017500000000242112131402061023174 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CCryptoOptions.h" #include "XSynergy.h" CCryptoOptions::CCryptoOptions( const CString& modeString, const CString& pass) : m_mode(parseMode(modeString)), m_pass(pass) { } void CCryptoOptions::setMode(CString modeString) { m_modeString = modeString; m_mode = parseMode(modeString); } ECryptoMode CCryptoOptions::parseMode(CString modeString) { if (modeString == "ofb") { return kOfb; } else if (modeString == "cfb") { return kCfb; } else if (modeString == "ctr") { return kCtr; } else if (modeString == "gcm") { return kGcm; } else { throw XBadCryptoMode(); } } synergy-1.4.12-Source/src/lib/synergy/CCryptoOptions.h0000600000175000017500000000221212131107263022645 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CString.h" #include "ECryptoMode.h" //! Encapsulates basic crypto options class CCryptoOptions { public: CCryptoOptions() : m_mode(kDisabled) { } CCryptoOptions(const CString& modeString, const CString& pass); //! Return enum for mode string static ECryptoMode parseMode(CString modeString); //! Parse and set mode string void setMode(CString modeString); CString m_pass; ECryptoMode m_mode; CString m_modeString; }; synergy-1.4.12-Source/src/lib/synergy/CCryptoStream.cpp0000600000175000017500000000750412140235162023011 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CCryptoStream.h" #include "CLog.h" #include "CCryptoOptions.h" #include #include #include using namespace CryptoPP; using namespace synergy::crypto; CCryptoStream::CCryptoStream( IEventQueue* eventQueue, synergy::IStream* stream, const CCryptoOptions& options, bool adoptStream) : CStreamFilter(eventQueue, stream, adoptStream), m_key(NULL), m_encryption(options.m_mode, true), m_decryption(options.m_mode, false) { LOG((CLOG_INFO "crypto mode: %s", options.m_modeString.c_str())); m_key = new byte[kKeyLength]; if (!options.m_pass.empty()) { createKey(m_key, options.m_pass, kKeyLength, static_cast(options.m_pass.length())); byte iv[CRYPTO_IV_SIZE]; createKey(iv, options.m_pass, CRYPTO_IV_SIZE, static_cast(options.m_pass.length()) * 2); setEncryptIv(iv); setDecryptIv(iv); } } CCryptoStream::~CCryptoStream() { delete[] m_key; } UInt32 CCryptoStream::read(void* out, UInt32 n) { assert(m_key != NULL); LOG((CLOG_DEBUG4 "crypto: read %i (decrypt)", n)); byte* cypher = new byte[n]; int result = getStream()->read(cypher, n); if (result == 0) { // nothing to read. return 0; } if (result != n) { LOG((CLOG_ERR "crypto: decrypt failed, only %i of %i bytes", result, n)); return 0; } logBuffer("cypher", cypher, n); m_decryption.processData(static_cast(out), cypher, n); logBuffer("plaintext", static_cast(out), n); delete[] cypher; return result; } void CCryptoStream::write(const void* in, UInt32 n) { assert(m_key != NULL); LOG((CLOG_DEBUG4 "crypto: write %i (encrypt)", n)); logBuffer("plaintext", static_cast(const_cast(in)), n); byte* cypher = new byte[n]; m_encryption.processData(cypher, static_cast(in), n); logBuffer("cypher", cypher, n); getStream()->write(cypher, n); delete[] cypher; } void CCryptoStream::createKey(byte* out, const CString& password, UInt8 keyLength, UInt8 hashCount) { assert(keyLength <= SHA256::DIGESTSIZE); byte temp[SHA256::DIGESTSIZE]; byte* in = reinterpret_cast(const_cast(password.c_str())); SHA256().CalculateDigest(temp, in, password.length()); byte* tempKey = new byte[SHA256::DIGESTSIZE]; for (int i = 0; i < hashCount; ++i) { memcpy(tempKey, temp, SHA256::DIGESTSIZE); SHA256().CalculateDigest(temp, tempKey, SHA256::DIGESTSIZE); } delete[] tempKey; memcpy(out, temp, keyLength); } void CCryptoStream::setEncryptIv(const byte* iv) { assert(m_key != NULL); logBuffer("encrypt iv", iv, CRYPTO_IV_SIZE); m_encryption.setKeyWithIv(m_key, kKeyLength, iv); } void CCryptoStream::setDecryptIv(const byte* iv) { assert(m_key != NULL); logBuffer("decrypt iv", iv, CRYPTO_IV_SIZE); m_decryption.setKeyWithIv(m_key, kKeyLength, iv); } void CCryptoStream::newIv(byte* out) { m_autoSeedRandomPool.GenerateBlock(out, CRYPTO_IV_SIZE); } void CCryptoStream::logBuffer(const char* name, const byte* buf, int length) { if (CLOG->getFilter() < kDEBUG4) { return; } std::stringstream ss; ss << "crypto: " << name << ":"; char buffer[4]; for (int i = 0; i < length; i++) { sprintf(buffer, " %02X", buf[i]); ss << buffer; } LOG((CLOG_DEBUG4 "%s", ss.str().c_str())); } synergy-1.4.12-Source/src/lib/synergy/CCryptoStream.h0000600000175000017500000000442012140235162022450 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "BasicTypes.h" #include "CStreamFilter.h" #include "CCryptoMode.h" #include #include class CCryptoOptions; #define CRYPTO_IV_SIZE CryptoPP::AES::BLOCKSIZE //! Bidirectional encrypted stream /*! Encrypts (on write) and decrypts (on read) to and from an underlying stream. */ class CCryptoStream : public CStreamFilter { public: CCryptoStream(IEventQueue* eventQueue, synergy::IStream* stream, const CCryptoOptions& options, bool adoptStream = true); virtual ~CCryptoStream(); //! @name manipulators //@{ //! Read from stream /*! Read up to \p n bytes into \p buffer to the stream using encryption. Returns the number of bytes read by the underlying stream. */ virtual UInt32 read(void* out, UInt32 n); //! Write to stream /*! Write \c n bytes from \c buffer to the stream using encryption. */ virtual void write(const void* in, UInt32 n); //! Set the IV for encryption void setEncryptIv(const byte* iv); //! Set the IV for decryption void setDecryptIv(const byte* iv); //! Get a new IV /*! Writes a new IV to the \c out buffer, and also uses the IV for further crypto. */ void newIv(byte* out); //! Creates a key from a password static void createKey(byte* out, const CString& password, UInt8 keyLength, UInt8 hashCount); private: void logBuffer(const char* name, const byte* buf, int length); byte* m_key; CCryptoMode m_encryption; CCryptoMode m_decryption; CryptoPP::AutoSeededRandomPool m_autoSeedRandomPool; }; namespace synergy { namespace crypto { const UInt32 kKeyLength = 32; } } synergy-1.4.12-Source/src/lib/synergy/CDaemonApp.cpp0000600000175000017500000002037412131277556022236 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ // TODO: split this class into windows and unix to get rid // of all the #ifdefs! #include "CDaemonApp.h" #include "CEventQueue.h" #include "LogOutputters.h" #include "CLog.h" #include "XArch.h" #include "CApp.h" #include "TMethodJob.h" #include "TMethodEventJob.h" #include "CIpcClientProxy.h" #include "CIpcMessage.h" #include "CSocketMultiplexer.h" #include "CIpcLogOutputter.h" #include "CLog.h" #include #include #include #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #include "XArchWindows.h" #include "CScreen.h" #include "CMSWindowsScreen.h" #include "CMSWindowsRelauncher.h" #include "CMSWindowsDebugOutputter.h" #define WIN32_LEAN_AND_MEAN #include #endif using namespace std; CDaemonApp* CDaemonApp::s_instance = NULL; int mainLoopStatic() { CDaemonApp::s_instance->mainLoop(true); return kExitSuccess; } int unixMainLoopStatic(int, const char**) { return mainLoopStatic(); } #if SYSAPI_WIN32 int winMainLoopStatic(int, const char**) { return CArchMiscWindows::runDaemon(mainLoopStatic); } #endif CDaemonApp::CDaemonApp() : m_ipcServer(nullptr), m_ipcLogOutputter(nullptr) #if SYSAPI_WIN32 ,m_relauncher(nullptr) #endif { s_instance = this; } CDaemonApp::~CDaemonApp() { } int CDaemonApp::run(int argc, char** argv) { #if SYSAPI_WIN32 // win32 instance needed for threading, etc. CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; CEventQueue events; bool uninstall = false; try { #if SYSAPI_WIN32 // sends debug messages to visual studio console window. log.insert(new CMSWindowsDebugOutputter()); #endif // default log level to system setting. string logLevel = arch.setting("LogLevel"); if (logLevel != "") log.setFilter(logLevel.c_str()); bool foreground = false; for (int i = 1; i < argc; ++i) { string arg(argv[i]); if (arg == "/f" || arg == "-f") { foreground = true; } #if SYSAPI_WIN32 else if (arg == "/install") { uninstall = true; arch.installDaemon(); return kExitSuccess; } else if (arg == "/uninstall") { arch.uninstallDaemon(); return kExitSuccess; } #endif else { stringstream ss; ss << "Unrecognized argument: " << arg; foregroundError(ss.str().c_str()); return kExitArgs; } } if (foreground) { // run process in foreground instead of daemonizing. // useful for debugging. mainLoop(false); } else { #if SYSAPI_WIN32 arch.daemonize("Synergy", winMainLoopStatic); #elif SYSAPI_UNIX arch.daemonize("Synergy", unixMainLoopStatic); #endif } return kExitSuccess; } catch (XArch& e) { CString message = e.what(); if (uninstall && (message.find("The service has not been started") != CString::npos)) { // TODO: if we're keeping this use error code instead (what is it?!). // HACK: this message happens intermittently, not sure where from but // it's quite misleading for the user. they thing something has gone // horribly wrong, but it's just the service manager reporting a false // positive (the service has actually shut down in most cases). } else { foregroundError(message.c_str()); } return kExitFailed; } catch (std::exception& e) { foregroundError(e.what()); return kExitFailed; } catch (...) { foregroundError("Unrecognized error."); return kExitFailed; } } void CDaemonApp::mainLoop(bool logToFile) { try { DAEMON_RUNNING(true); /*while (true) { }*/ if (logToFile) CLOG->insert(new CFileLogOutputter(logPath().c_str())); // create socket multiplexer. this must happen after daemonization // on unix because threads evaporate across a fork(). CSocketMultiplexer multiplexer; // uses event queue, must be created here. m_ipcServer = new CIpcServer(); // send logging to gui via ipc, log system adopts outputter. m_ipcLogOutputter = new CIpcLogOutputter(*m_ipcServer); CLOG->insert(m_ipcLogOutputter); #if SYSAPI_WIN32 m_relauncher = new CMSWindowsRelauncher(false, *m_ipcServer, *m_ipcLogOutputter); #endif EVENTQUEUE->adoptHandler( CIpcServer::getMessageReceivedEvent(), m_ipcServer, new TMethodEventJob(this, &CDaemonApp::handleIpcMessage)); m_ipcServer->listen(); #if SYSAPI_WIN32 // HACK: create a dummy screen, which can handle system events // (such as a stop request from the service controller). CMSWindowsScreen::init(CArchMiscWindows::instanceWin32()); CGameDeviceInfo gameDevice; CScreen dummyScreen(new CMSWindowsScreen(false, true, gameDevice, false)); CString command = ARCH->setting("Command"); bool elevate = ARCH->setting("Elevate") == "1"; if (command != "") { LOG((CLOG_INFO "using last known command: %s", command.c_str())); m_relauncher->command(command, elevate); } m_relauncher->startAsync(); #endif EVENTQUEUE->loop(); #if SYSAPI_WIN32 m_relauncher->stop(); delete m_relauncher; #endif EVENTQUEUE->removeHandler( CIpcServer::getMessageReceivedEvent(), m_ipcServer); CLOG->remove(m_ipcLogOutputter); delete m_ipcLogOutputter; delete m_ipcServer; DAEMON_RUNNING(false); } catch (XArch& e) { LOG((CLOG_ERR "xarch exception: %s", e.what().c_str())); } catch (std::exception& e) { LOG((CLOG_ERR "std exception: %s", e.what())); } catch (...) { LOG((CLOG_ERR "unrecognized error.")); } } void CDaemonApp::foregroundError(const char* message) { #if SYSAPI_WIN32 MessageBox(NULL, message, "Synergy Service", MB_OK | MB_ICONERROR); #elif SYSAPI_UNIX cerr << message << endl; #endif } std::string CDaemonApp::logPath() { #ifdef SYSAPI_WIN32 // TODO: move to CArchMiscWindows // on windows, log to the same dir as the binary. char fileNameBuffer[MAX_PATH]; GetModuleFileName(NULL, fileNameBuffer, MAX_PATH); string fileName(fileNameBuffer); size_t lastSlash = fileName.find_last_of("\\"); string path(fileName.substr(0, lastSlash)); path.append("\\").append(LOG_FILENAME); return path; #elif SYSAPI_UNIX return "/var/log/" LOG_FILENAME; #endif } void CDaemonApp::handleIpcMessage(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); switch (m->type()) { case kIpcCommand: { CIpcCommandMessage* cm = static_cast(m); CString command = cm->command(); LOG((CLOG_DEBUG "new command, elevate=%d command=%s", cm->elevate(), command.c_str())); CString debugArg("--debug"); UInt32 debugArgPos = static_cast(command.find(debugArg)); if (debugArgPos != CString::npos) { UInt32 from = debugArgPos + static_cast(debugArg.size()) + 1; UInt32 nextSpace = static_cast(command.find(" ", from)); CString logLevel(command.substr(from, nextSpace - from)); try { // change log level based on that in the command string // and change to that log level now. ARCH->setting("LogLevel", logLevel); CLOG->setFilter(logLevel.c_str()); } catch (XArch& e) { LOG((CLOG_ERR "failed to save LogLevel setting, %s", e.what().c_str())); } } try { // store command in system settings. this is used when the daemon // next starts. ARCH->setting("Command", command); // TODO: it would be nice to store bools/ints... ARCH->setting("Elevate", CString(cm->elevate() ? "1" : "0")); } catch (XArch& e) { LOG((CLOG_ERR "failed to save settings, %s", e.what().c_str())); } #if SYSAPI_WIN32 // tell the relauncher about the new command. this causes the // relauncher to stop the existing command and start the new // command. m_relauncher->command(command, cm->elevate()); #endif break; } case kIpcHello: m_ipcLogOutputter->notifyBuffer(); break; } } synergy-1.4.12-Source/src/lib/synergy/CDaemonApp.h0000600000175000017500000000260112021261364021660 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CArch.h" #include "CIpcServer.h" #if SYSAPI_WIN32 #include "CMSWindowsRelauncher.h" #endif #include class CEvent; class CIpcLogOutputter; class CDaemonApp { public: CDaemonApp(); virtual ~CDaemonApp(); int run(int argc, char** argv); void mainLoop(bool logToFile); private: void daemonize(); void foregroundError(const char* message); std::string logPath(); void handleIpcMessage(const CEvent&, void*); public: static CDaemonApp* s_instance; #if SYSAPI_WIN32 CMSWindowsRelauncher* m_relauncher; #endif private: CIpcServer* m_ipcServer; CIpcLogOutputter* m_ipcLogOutputter; }; #define LOG_FILENAME "synergyd.log" synergy-1.4.12-Source/src/lib/synergy/CEventGameDevice.cpp0000600000175000017500000000260212021261364023343 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CEventGameDevice.h" CEventGameDevice::CEventGameDevice(void* eventTarget) : m_eventTarget(eventTarget) { } CEventGameDevice::~CEventGameDevice() { } void CEventGameDevice::gameDeviceTimingResp(UInt16 freq) { } void CEventGameDevice::gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { } void CEventGameDevice::fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const { } void CEventGameDevice::fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const { } void CEventGameDevice::fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const { } void CEventGameDevice::queueGameDeviceTimingReq() const { } synergy-1.4.12-Source/src/lib/synergy/CEventGameDevice.h0000600000175000017500000000245212021261364023013 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CGameDevice.h" class CEventGameDevice : public CGameDevice { public: CEventGameDevice(void* eventTarget); virtual ~CEventGameDevice(); void gameDeviceTimingResp(UInt16 freq); void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const; void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const; void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const; void queueGameDeviceTimingReq() const; private: void* m_eventTarget; }; synergy-1.4.12-Source/src/lib/synergy/CGameDevice.cpp0000600000175000017500000000175112021261364022345 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CGameDevice.h" CGameDeviceInfo::CGameDeviceInfo() : m_mode(CGameDeviceInfo::kGameModeNone), m_poll(CGameDeviceInfo::kGamePollDynamic), m_pollFreq(60) { } CGameDeviceInfo::~CGameDeviceInfo() { } CGameDevice::CGameDevice() { } CGameDevice::~CGameDevice() { } synergy-1.4.12-Source/src/lib/synergy/CGameDevice.h0000600000175000017500000000307112021261364022007 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "GameDeviceTypes.h" class CGameDeviceInfo { public: enum EGameMode { kGameModeNone, kGameModeXInput, kGameModeJoyInfoEx }; enum EGamePoll { kGamePollDynamic, kGamePollStatic }; CGameDeviceInfo(); virtual ~CGameDeviceInfo(); EGameMode m_mode; EGamePoll m_poll; int m_pollFreq; }; class CGameDevice { public: CGameDevice(); virtual ~CGameDevice(); virtual void gameDeviceTimingResp(UInt16 freq) = 0; virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) = 0; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const = 0; virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const = 0; virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const = 0; virtual void queueGameDeviceTimingReq() const = 0; }; synergy-1.4.12-Source/src/lib/synergy/CKeyMap.cpp0000600000175000017500000010554012127576354021562 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2005 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CKeyMap.h" #include "KeyTypes.h" #include "CLog.h" #include #include #include CKeyMap::CNameToKeyMap* CKeyMap::s_nameToKeyMap = NULL; CKeyMap::CNameToModifierMap* CKeyMap::s_nameToModifierMap = NULL; CKeyMap::CKeyToNameMap* CKeyMap::s_keyToNameMap = NULL; CKeyMap::CModifierToNameMap* CKeyMap::s_modifierToNameMap = NULL; CKeyMap::CKeyMap() : m_numGroups(0), m_composeAcrossGroups(false) { m_modifierKeyItem.m_id = kKeyNone; m_modifierKeyItem.m_group = 0; m_modifierKeyItem.m_button = 0; m_modifierKeyItem.m_required = 0; m_modifierKeyItem.m_sensitive = 0; m_modifierKeyItem.m_generates = 0; m_modifierKeyItem.m_dead = false; m_modifierKeyItem.m_lock = false; m_modifierKeyItem.m_client = 0; } CKeyMap::~CKeyMap() { // do nothing } void CKeyMap::swap(CKeyMap& x) { m_keyIDMap.swap(x.m_keyIDMap); m_modifierKeys.swap(x.m_modifierKeys); m_halfDuplex.swap(x.m_halfDuplex); m_halfDuplexMods.swap(x.m_halfDuplexMods); SInt32 tmp1 = m_numGroups; m_numGroups = x.m_numGroups; x.m_numGroups = tmp1; bool tmp2 = m_composeAcrossGroups; m_composeAcrossGroups = x.m_composeAcrossGroups; x.m_composeAcrossGroups = tmp2; } void CKeyMap::addKeyEntry(const KeyItem& item) { // ignore kKeyNone if (item.m_id == kKeyNone) { return; } // resize number of groups for key SInt32 numGroups = item.m_group + 1; if (getNumGroups() > numGroups) { numGroups = getNumGroups(); } KeyGroupTable& groupTable = m_keyIDMap[item.m_id]; if (groupTable.size() < static_cast(numGroups)) { groupTable.resize(numGroups); } // make a list from the item KeyItemList items; items.push_back(item); // set group and dead key flag on the item KeyItem& newItem = items.back(); newItem.m_dead = isDeadKey(item.m_id); // mask the required bits with the sensitive bits newItem.m_required &= newItem.m_sensitive; // see if we already have this item; just return if so KeyEntryList& entries = groupTable[item.m_group]; for (size_t i = 0, n = entries.size(); i < n; ++i) { if (entries[i].size() == 1 && newItem == entries[i][0]) { return; } } // add item list entries.push_back(items); LOG((CLOG_DEBUG5 "add key: %04x %d %03x %04x (%04x %04x %04x)%s", newItem.m_id, newItem.m_group, newItem.m_button, newItem.m_client, newItem.m_required, newItem.m_sensitive, newItem.m_generates, newItem.m_dead ? " dead" : "")); } void CKeyMap::addKeyAliasEntry(KeyID targetID, SInt32 group, KeyModifierMask targetRequired, KeyModifierMask targetSensitive, KeyID sourceID, KeyModifierMask sourceRequired, KeyModifierMask sourceSensitive) { // if we can already generate the target as desired then we're done. if (findCompatibleKey(targetID, group, targetRequired, targetSensitive) != NULL) { return; } // find a compatible source, preferably in the same group for (SInt32 gd = 0, n = getNumGroups(); gd < n; ++gd) { SInt32 eg = getEffectiveGroup(group, gd); const KeyItemList* sourceEntry = findCompatibleKey(sourceID, eg, sourceRequired, sourceSensitive); if (sourceEntry != NULL && sourceEntry->size() == 1) { CKeyMap::KeyItem targetItem = sourceEntry->back(); targetItem.m_id = targetID; targetItem.m_group = eg; addKeyEntry(targetItem); break; } } } bool CKeyMap::addKeyCombinationEntry(KeyID id, SInt32 group, const KeyID* keys, UInt32 numKeys) { // disallow kKeyNone if (id == kKeyNone) { return false; } SInt32 numGroups = group + 1; if (getNumGroups() > numGroups) { numGroups = getNumGroups(); } KeyGroupTable& groupTable = m_keyIDMap[id]; if (groupTable.size() < static_cast(numGroups)) { groupTable.resize(numGroups); } if (!groupTable[group].empty()) { // key is already in the table return false; } // convert to buttons KeyItemList items; for (UInt32 i = 0; i < numKeys; ++i) { KeyIDMap::const_iterator gtIndex = m_keyIDMap.find(keys[i]); if (gtIndex == m_keyIDMap.end()) { return false; } const KeyGroupTable& groupTable = gtIndex->second; // if we allow group switching during composition then search all // groups for keys, otherwise search just the given group. SInt32 n = 1; if (m_composeAcrossGroups) { n = (SInt32)groupTable.size(); } bool found = false; for (SInt32 gd = 0; gd < n && !found; ++gd) { SInt32 eg = (group + gd) % getNumGroups(); const KeyEntryList& entries = groupTable[eg]; for (size_t j = 0; j < entries.size(); ++j) { if (entries[j].size() == 1) { found = true; items.push_back(entries[j][0]); break; } } } if (!found) { // required key is not in keyboard group return false; } } // add key groupTable[group].push_back(items); return true; } void CKeyMap::allowGroupSwitchDuringCompose() { m_composeAcrossGroups = true; } void CKeyMap::addHalfDuplexButton(KeyButton button) { m_halfDuplex.insert(button); } void CKeyMap::clearHalfDuplexModifiers() { m_halfDuplexMods.clear(); } void CKeyMap::addHalfDuplexModifier(KeyID key) { m_halfDuplexMods.insert(key); } void CKeyMap::finish() { m_numGroups = findNumGroups(); // make sure every key has the same number of groups for (KeyIDMap::iterator i = m_keyIDMap.begin(); i != m_keyIDMap.end(); ++i) { i->second.resize(m_numGroups); } // compute keys that generate each modifier setModifierKeys(); } void CKeyMap::foreachKey(ForeachKeyCallback cb, void* userData) { for (KeyIDMap::iterator i = m_keyIDMap.begin(); i != m_keyIDMap.end(); ++i) { KeyGroupTable& groupTable = i->second; for (size_t group = 0; group < groupTable.size(); ++group) { KeyEntryList& entryList = groupTable[group]; for (size_t j = 0; j < entryList.size(); ++j) { KeyItemList& itemList = entryList[j]; for (size_t k = 0; k < itemList.size(); ++k) { (*cb)(i->first, static_cast(group), itemList[k], userData); } } } } } const CKeyMap::KeyItem* CKeyMap::mapKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const { LOG((CLOG_DEBUG1 "mapKey %04x (%d) with mask %04x, start state: %04x", id, id, desiredMask, currentState)); // handle group change if (id == kKeyNextGroup) { keys.push_back(Keystroke(1, false, false)); return NULL; } else if (id == kKeyPrevGroup) { keys.push_back(Keystroke(-1, false, false)); return NULL; } const KeyItem* item; switch (id) { case kKeyShift_L: case kKeyShift_R: case kKeyControl_L: case kKeyControl_R: case kKeyAlt_L: case kKeyAlt_R: case kKeyMeta_L: case kKeyMeta_R: case kKeySuper_L: case kKeySuper_R: case kKeyAltGr: case kKeyCapsLock: case kKeyNumLock: case kKeyScrollLock: item = mapModifierKey(keys, id, group, activeModifiers, currentState, desiredMask, isAutoRepeat); break; case kKeySetModifiers: if (!keysForModifierState(0, group, activeModifiers, currentState, desiredMask, desiredMask, 0, keys)) { LOG((CLOG_DEBUG1 "unable to set modifiers %04x", desiredMask)); return NULL; } return &m_modifierKeyItem; case kKeyClearModifiers: if (!keysForModifierState(0, group, activeModifiers, currentState, currentState & ~desiredMask, desiredMask, 0, keys)) { LOG((CLOG_DEBUG1 "unable to clear modifiers %04x", desiredMask)); return NULL; } return &m_modifierKeyItem; default: if (isCommand(desiredMask)) { item = mapCommandKey(keys, id, group, activeModifiers, currentState, desiredMask, isAutoRepeat); } else { item = mapCharacterKey(keys, id, group, activeModifiers, currentState, desiredMask, isAutoRepeat); } break; } if (item != NULL) { LOG((CLOG_DEBUG1 "mapped to %03x, new state %04x", item->m_button, currentState)); } return item; } SInt32 CKeyMap::getNumGroups() const { return m_numGroups; } SInt32 CKeyMap::getEffectiveGroup(SInt32 group, SInt32 offset) const { return (group + offset + getNumGroups()) % getNumGroups(); } const CKeyMap::KeyItemList* CKeyMap::findCompatibleKey(KeyID id, SInt32 group, KeyModifierMask required, KeyModifierMask sensitive) const { assert(group >= 0 && group < getNumGroups()); KeyIDMap::const_iterator i = m_keyIDMap.find(id); if (i == m_keyIDMap.end()) { return NULL; } const KeyEntryList& entries = i->second[group]; for (size_t j = 0; j < entries.size(); ++j) { if ((entries[j].back().m_sensitive & sensitive) == 0 || (entries[j].back().m_required & sensitive) == (required & sensitive)) { return &entries[j]; } } return NULL; } bool CKeyMap::isHalfDuplex(KeyID key, KeyButton button) const { return (m_halfDuplex.count(button) + m_halfDuplexMods.count(key) > 0); } bool CKeyMap::isCommand(KeyModifierMask mask) const { return ((mask & getCommandModifiers()) != 0); } KeyModifierMask CKeyMap::getCommandModifiers() const { // we currently treat ctrl, alt, meta and super as command modifiers. // some platforms may have a more limited set (OS X only needs Alt) // but this works anyway. return KeyModifierControl | KeyModifierAlt | KeyModifierAltGr | KeyModifierMeta | KeyModifierSuper; } void CKeyMap::collectButtons(const ModifierToKeys& mods, ButtonToKeyMap& keys) { keys.clear(); for (ModifierToKeys::const_iterator i = mods.begin(); i != mods.end(); ++i) { keys.insert(std::make_pair(i->second.m_button, &i->second)); } } void CKeyMap::initModifierKey(KeyItem& item) { item.m_generates = 0; item.m_lock = false; switch (item.m_id) { case kKeyShift_L: case kKeyShift_R: item.m_generates = KeyModifierShift; break; case kKeyControl_L: case kKeyControl_R: item.m_generates = KeyModifierControl; break; case kKeyAlt_L: case kKeyAlt_R: item.m_generates = KeyModifierAlt; break; case kKeyMeta_L: case kKeyMeta_R: item.m_generates = KeyModifierMeta; break; case kKeySuper_L: case kKeySuper_R: item.m_generates = KeyModifierSuper; break; case kKeyAltGr: item.m_generates = KeyModifierAltGr; break; case kKeyCapsLock: item.m_generates = KeyModifierCapsLock; item.m_lock = true; break; case kKeyNumLock: item.m_generates = KeyModifierNumLock; item.m_lock = true; break; case kKeyScrollLock: item.m_generates = KeyModifierScrollLock; item.m_lock = true; break; default: // not a modifier break; } } SInt32 CKeyMap::findNumGroups() const { size_t max = 0; for (KeyIDMap::const_iterator i = m_keyIDMap.begin(); i != m_keyIDMap.end(); ++i) { if (i->second.size() > max) { max = i->second.size(); } } return static_cast(max); } void CKeyMap::setModifierKeys() { m_modifierKeys.clear(); m_modifierKeys.resize(kKeyModifierNumBits * getNumGroups()); for (KeyIDMap::const_iterator i = m_keyIDMap.begin(); i != m_keyIDMap.end(); ++i) { const KeyGroupTable& groupTable = i->second; for (size_t g = 0; g < groupTable.size(); ++g) { const KeyEntryList& entries = groupTable[g]; for (size_t j = 0; j < entries.size(); ++j) { // skip multi-key sequences if (entries[j].size() != 1) { continue; } // skip keys that don't generate a modifier const KeyItem& item = entries[j].back(); if (item.m_generates == 0) { continue; } // add key to each indicated modifier in this group for (SInt32 b = 0; b < kKeyModifierNumBits; ++b) { // skip if item doesn't generate bit b if (((1u << b) & item.m_generates) != 0) { SInt32 mIndex = (SInt32)g * kKeyModifierNumBits + b; m_modifierKeys[mIndex].push_back(&item); } } } } } } const CKeyMap::KeyItem* CKeyMap::mapCommandKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const { static const KeyModifierMask s_overrideModifiers = 0xffffu; // find KeySym in table KeyIDMap::const_iterator i = m_keyIDMap.find(id); if (i == m_keyIDMap.end()) { // unknown key LOG((CLOG_DEBUG1 "key %04x is not on keyboard", id)); return NULL; } const KeyGroupTable& keyGroupTable = i->second; // find the first key that generates this KeyID const KeyItem* keyItem = NULL; SInt32 numGroups = getNumGroups(); for (SInt32 groupOffset = 0; groupOffset < numGroups; ++groupOffset) { SInt32 effectiveGroup = getEffectiveGroup(group, groupOffset); const KeyEntryList& entryList = keyGroupTable[effectiveGroup]; for (size_t i = 0; i < entryList.size(); ++i) { if (entryList[i].size() != 1) { // ignore multikey entries continue; } // only match based on shift; we're after the right button // not the right character. we'll use desiredMask as-is, // overriding the key's required modifiers, when synthesizing // this button. const KeyItem& item = entryList[i].back(); if ((item.m_required & KeyModifierShift & desiredMask) == (item.m_sensitive & KeyModifierShift & desiredMask)) { LOG((CLOG_DEBUG1 "found key in group %d", effectiveGroup)); keyItem = &item; break; } } if (keyItem != NULL) { break; } } if (keyItem == NULL) { // no mapping for this keysym LOG((CLOG_DEBUG1 "no mapping for key %04x", id)); return NULL; } // make working copy of modifiers ModifierToKeys newModifiers = activeModifiers; KeyModifierMask newState = currentState; SInt32 newGroup = group; // don't try to change CapsLock desiredMask = (desiredMask & ~KeyModifierCapsLock) | (currentState & KeyModifierCapsLock); // add the key if (!keysForKeyItem(*keyItem, newGroup, newModifiers, newState, desiredMask, s_overrideModifiers, isAutoRepeat, keys)) { LOG((CLOG_DEBUG1 "can't map key")); keys.clear(); return NULL; } // add keystrokes to restore modifier keys if (!keysToRestoreModifiers(*keyItem, group, newModifiers, newState, activeModifiers, keys)) { LOG((CLOG_DEBUG1 "failed to restore modifiers")); keys.clear(); return NULL; } // add keystrokes to restore group if (newGroup != group) { keys.push_back(Keystroke(group, true, true)); } // save new modifiers activeModifiers = newModifiers; currentState = newState; return keyItem; } const CKeyMap::KeyItem* CKeyMap::mapCharacterKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const { // find KeySym in table KeyIDMap::const_iterator i = m_keyIDMap.find(id); if (i == m_keyIDMap.end()) { // unknown key LOG((CLOG_DEBUG1 "key %04x is not on keyboard", id)); return NULL; } const KeyGroupTable& keyGroupTable = i->second; // find best key in any group, starting with the active group SInt32 keyIndex = -1; SInt32 numGroups = getNumGroups(); SInt32 groupOffset; LOG((CLOG_DEBUG1 "find best: %04x %04x", currentState, desiredMask)); for (groupOffset = 0; groupOffset < numGroups; ++groupOffset) { SInt32 effectiveGroup = getEffectiveGroup(group, groupOffset); keyIndex = findBestKey(keyGroupTable[effectiveGroup], currentState, desiredMask); if (keyIndex != -1) { LOG((CLOG_DEBUG1 "found key in group %d", effectiveGroup)); break; } } if (keyIndex == -1) { // no mapping for this keysym LOG((CLOG_DEBUG1 "no mapping for key %04x", id)); return NULL; } // get keys to press for key SInt32 effectiveGroup = getEffectiveGroup(group, groupOffset); const KeyItemList& itemList = keyGroupTable[effectiveGroup][keyIndex]; if (itemList.empty()) { return NULL; } const KeyItem& keyItem = itemList.back(); // make working copy of modifiers ModifierToKeys newModifiers = activeModifiers; KeyModifierMask newState = currentState; SInt32 newGroup = group; // add each key for (size_t j = 0; j < itemList.size(); ++j) { if (!keysForKeyItem(itemList[j], newGroup, newModifiers, newState, desiredMask, 0, isAutoRepeat, keys)) { LOG((CLOG_DEBUG1 "can't map key")); keys.clear(); return NULL; } } // add keystrokes to restore modifier keys if (!keysToRestoreModifiers(keyItem, group, newModifiers, newState, activeModifiers, keys)) { LOG((CLOG_DEBUG1 "failed to restore modifiers")); keys.clear(); return NULL; } // add keystrokes to restore group if (newGroup != group) { keys.push_back(Keystroke(group, true, true)); } // save new modifiers activeModifiers = newModifiers; currentState = newState; return &keyItem; } const CKeyMap::KeyItem* CKeyMap::mapModifierKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const { return mapCharacterKey(keys, id, group, activeModifiers, currentState, desiredMask, isAutoRepeat); } SInt32 CKeyMap::findBestKey(const KeyEntryList& entryList, KeyModifierMask /*currentState*/, KeyModifierMask desiredState) const { // check for an item that can accommodate the desiredState exactly for (SInt32 i = 0; i < (SInt32)entryList.size(); ++i) { const KeyItem& item = entryList[i].back(); if ((item.m_required & desiredState) == (item.m_sensitive & desiredState)) { LOG((CLOG_DEBUG1 "best key index %d of %d (exact)", i, entryList.size())); return i; } } // choose the item that requires the fewest modifier changes SInt32 bestCount = 32; SInt32 bestIndex = -1; for (SInt32 i = 0; i < (SInt32)entryList.size(); ++i) { const KeyItem& item = entryList[i].back(); KeyModifierMask change = ((item.m_required ^ desiredState) & item.m_sensitive); SInt32 n = getNumModifiers(change); if (n < bestCount) { bestCount = n; bestIndex = i; } } if (bestIndex != -1) { LOG((CLOG_DEBUG1 "best key index %d of %d (%d modifiers)", bestIndex, entryList.size(), bestCount)); } return bestIndex; } const CKeyMap::KeyItem* CKeyMap::keyForModifier(KeyButton button, SInt32 group, SInt32 modifierBit) const { assert(modifierBit >= 0 && modifierBit < kKeyModifierNumBits); assert(group >= 0 && group < getNumGroups()); // find a key that generates the given modifier in the given group // but doesn't use the given button, presumably because we're trying // to generate a KeyID that's only bound the the given button. // this is important when a shift button is modified by shift; we // must use the other shift button to do the shifting. const ModifierKeyItemList& items = m_modifierKeys[group * kKeyModifierNumBits + modifierBit]; for (ModifierKeyItemList::const_iterator i = items.begin(); i != items.end(); ++i) { if ((*i)->m_button != button) { return (*i); } } return NULL; } bool CKeyMap::keysForKeyItem(const KeyItem& keyItem, SInt32& group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredState, KeyModifierMask overrideModifiers, bool isAutoRepeat, Keystrokes& keystrokes) const { static const KeyModifierMask s_notRequiredMask = KeyModifierAltGr | KeyModifierNumLock | KeyModifierScrollLock; // add keystrokes to adjust the group if (group != keyItem.m_group) { group = keyItem.m_group; keystrokes.push_back(Keystroke(group, true, false)); } EKeystroke type; if (keyItem.m_dead) { // adjust modifiers for dead key if (!keysForModifierState(keyItem.m_button, group, activeModifiers, currentState, keyItem.m_required, keyItem.m_sensitive, 0, keystrokes)) { LOG((CLOG_DEBUG1 "unable to match modifier state for dead key %d", keyItem.m_button)); return false; } // press and release the dead key type = kKeystrokeClick; } else { // if this a command key then we don't have to match some of the // key's required modifiers. KeyModifierMask sensitive = keyItem.m_sensitive & ~overrideModifiers; // XXX -- must handle pressing a modifier. in particular, if we want // to synthesize a KeyID on level 1 of a KeyButton that has Shift_L // mapped to level 0 then we must release that button if it's down // (in order to satisfy a shift modifier) then press a different // button (any other button) mapped to the shift modifier and then // the Shift_L button. // match key's required state LOG((CLOG_DEBUG1 "state: %04x,%04x,%04x", currentState, keyItem.m_required, sensitive)); if (!keysForModifierState(keyItem.m_button, group, activeModifiers, currentState, keyItem.m_required, sensitive, 0, keystrokes)) { LOG((CLOG_DEBUG1 "unable to match modifier state (%04x,%04x) for key %d", keyItem.m_required, keyItem.m_sensitive, keyItem.m_button)); return false; } // match desiredState as closely as possible. we must not // change any modifiers in keyItem.m_sensitive. and if the key // is a modifier, we don't want to change that modifier. LOG((CLOG_DEBUG1 "desired state: %04x %04x,%04x,%04x", desiredState, currentState, keyItem.m_required, keyItem.m_sensitive)); if (!keysForModifierState(keyItem.m_button, group, activeModifiers, currentState, desiredState, ~(sensitive | keyItem.m_generates), s_notRequiredMask, keystrokes)) { LOG((CLOG_DEBUG1 "unable to match desired modifier state (%04x,%04x) for key %d", desiredState, ~keyItem.m_sensitive & 0xffffu, keyItem.m_button)); return false; } // repeat or press of key type = isAutoRepeat ? kKeystrokeRepeat : kKeystrokePress; } addKeystrokes(type, keyItem, activeModifiers, currentState, keystrokes); return true; } bool CKeyMap::keysToRestoreModifiers(const KeyItem& keyItem, SInt32, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, const ModifierToKeys& desiredModifiers, Keystrokes& keystrokes) const { // XXX -- we're not considering modified modifiers here ModifierToKeys oldModifiers = activeModifiers; // get the pressed modifier buttons before and after ButtonToKeyMap oldKeys, newKeys; collectButtons(oldModifiers, oldKeys); collectButtons(desiredModifiers, newKeys); // release unwanted keys for (ModifierToKeys::const_iterator i = oldModifiers.begin(); i != oldModifiers.end(); ++i) { KeyButton button = i->second.m_button; if (button != keyItem.m_button && newKeys.count(button) == 0) { EKeystroke type = kKeystrokeRelease; if (i->second.m_lock) { type = kKeystrokeUnmodify; } addKeystrokes(type, i->second, activeModifiers, currentState, keystrokes); } } // press wanted keys for (ModifierToKeys::const_iterator i = desiredModifiers.begin(); i != desiredModifiers.end(); ++i) { KeyButton button = i->second.m_button; if (button != keyItem.m_button && oldKeys.count(button) == 0) { EKeystroke type = kKeystrokePress; if (i->second.m_lock) { type = kKeystrokeModify; } addKeystrokes(type, i->second, activeModifiers, currentState, keystrokes); } } return true; } bool CKeyMap::keysForModifierState(KeyButton button, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask requiredState, KeyModifierMask sensitiveMask, KeyModifierMask notRequiredMask, Keystrokes& keystrokes) const { // compute which modifiers need changing KeyModifierMask flipMask = ((currentState ^ requiredState) & sensitiveMask); // if a modifier is not required then don't even try to match it. if // we don't mask out notRequiredMask then we'll try to match those // modifiers but succeed if we can't. however, this is known not // to work if the key itself is a modifier (the numlock toggle can // interfere) so we don't try to match at all. flipMask &= ~notRequiredMask; LOG((CLOG_DEBUG1 "flip: %04x (%04x vs %04x in %04x - %04x)", flipMask, currentState, requiredState, sensitiveMask & 0xffffu, notRequiredMask & 0xffffu)); if (flipMask == 0) { return true; } // fix modifiers. this is complicated by the fact that a modifier may // be sensitive to other modifiers! (who thought that up?) // // we'll assume that modifiers with higher bits are affected by modifiers // with lower bits. there's not much basis for that assumption except // that we're pretty sure shift isn't changed by other modifiers. for (SInt32 bit = kKeyModifierNumBits; bit-- > 0; ) { KeyModifierMask mask = (1u << bit); if ((flipMask & mask) == 0) { // modifier is already correct continue; } // do we want the modifier active or inactive? bool active = ((requiredState & mask) != 0); // get the KeyItem for the modifier in the group const KeyItem* keyItem = keyForModifier(button, group, bit); if (keyItem == NULL) { if ((mask & notRequiredMask) == 0) { LOG((CLOG_DEBUG1 "no key for modifier %04x", mask)); return false; } else { continue; } } // if this modifier is sensitive to modifiers then adjust those // modifiers. also check if our assumption was correct. note // that we only need to adjust the modifiers on key down. KeyModifierMask sensitive = keyItem->m_sensitive; if ((sensitive & mask) != 0) { // modifier is sensitive to itself. that makes no sense // so ignore it. LOG((CLOG_DEBUG1 "modifier %04x modified by itself", mask)); sensitive &= ~mask; } if (sensitive != 0) { if (sensitive > mask) { // our assumption is incorrect LOG((CLOG_DEBUG1 "modifier %04x modified by %04x", mask, sensitive)); return false; } if (active && !keysForModifierState(button, group, activeModifiers, currentState, keyItem->m_required, sensitive, notRequiredMask, keystrokes)) { return false; } else if (!active) { // release the modifier // XXX -- this doesn't work! if Alt and Meta are mapped // to one key and we want to release Meta we can't do // that without also releasing Alt. // need to think about support for modified modifiers. } } // current state should match required state if ((currentState & sensitive) != (keyItem->m_required & sensitive)) { LOG((CLOG_DEBUG1 "unable to match modifier state for modifier %04x (%04x vs %04x in %04x)", mask, currentState, keyItem->m_required, sensitive)); return false; } // add keystrokes EKeystroke type = active ? kKeystrokeModify : kKeystrokeUnmodify; addKeystrokes(type, *keyItem, activeModifiers, currentState, keystrokes); } return true; } void CKeyMap::addKeystrokes(EKeystroke type, const KeyItem& keyItem, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, Keystrokes& keystrokes) const { KeyButton button = keyItem.m_button; UInt32 data = keyItem.m_client; switch (type) { case kKeystrokePress: keystrokes.push_back(Keystroke(button, true, false, data)); if (keyItem.m_generates != 0) { if (!keyItem.m_lock || (currentState & keyItem.m_generates) == 0) { // add modifier key and activate modifier activeModifiers.insert(std::make_pair( keyItem.m_generates, keyItem)); currentState |= keyItem.m_generates; } else { // deactivate locking modifier activeModifiers.erase(keyItem.m_generates); currentState &= ~keyItem.m_generates; } } break; case kKeystrokeRelease: keystrokes.push_back(Keystroke(button, false, false, data)); if (keyItem.m_generates != 0 && !keyItem.m_lock) { // remove key from active modifiers std::pair range = activeModifiers.equal_range(keyItem.m_generates); for (ModifierToKeys::iterator i = range.first; i != range.second; ++i) { if (i->second.m_button == button) { activeModifiers.erase(i); break; } } // if no more keys for this modifier then deactivate modifier if (activeModifiers.count(keyItem.m_generates) == 0) { currentState &= ~keyItem.m_generates; } } break; case kKeystrokeRepeat: keystrokes.push_back(Keystroke(button, false, true, data)); keystrokes.push_back(Keystroke(button, true, true, data)); // no modifier changes on key repeat break; case kKeystrokeClick: keystrokes.push_back(Keystroke(button, true, false, data)); keystrokes.push_back(Keystroke(button, false, false, data)); // no modifier changes on key click break; case kKeystrokeModify: case kKeystrokeUnmodify: if (keyItem.m_lock) { // we assume there's just one button for this modifier if (m_halfDuplex.count(button) > 0) { if (type == kKeystrokeModify) { // turn half-duplex toggle on (press) keystrokes.push_back(Keystroke(button, true, false, data)); } else { // turn half-duplex toggle off (release) keystrokes.push_back(Keystroke(button, false, false, data)); } } else { // toggle (click) keystrokes.push_back(Keystroke(button, true, false, data)); keystrokes.push_back(Keystroke(button, false, false, data)); } } else if (type == kKeystrokeModify) { // press modifier keystrokes.push_back(Keystroke(button, true, false, data)); } else { // release all the keys that generate the modifier that are // currently down std::pair range = activeModifiers.equal_range(keyItem.m_generates); for (ModifierToKeys::const_iterator i = range.first; i != range.second; ++i) { keystrokes.push_back(Keystroke(i->second.m_button, false, false, i->second.m_client)); } } if (type == kKeystrokeModify) { activeModifiers.insert(std::make_pair( keyItem.m_generates, keyItem)); currentState |= keyItem.m_generates; } else { activeModifiers.erase(keyItem.m_generates); currentState &= ~keyItem.m_generates; } break; } } SInt32 CKeyMap::getNumModifiers(KeyModifierMask state) { SInt32 n = 0; for (; state != 0; state >>= 1) { if ((state & 1) != 0) { ++n; } } return n; } bool CKeyMap::isDeadKey(KeyID key) { return (key == kKeyCompose || (key >= 0x0300 && key <= 0x036f)); } KeyID CKeyMap::getDeadKey(KeyID key) { if (isDeadKey(key)) { // already dead return key; } switch (key) { case '`': return kKeyDeadGrave; case 0xb4u: return kKeyDeadAcute; case '^': case 0x2c6: return kKeyDeadCircumflex; case '~': case 0x2dcu: return kKeyDeadTilde; case 0xafu: return kKeyDeadMacron; case 0x2d8u: return kKeyDeadBreve; case 0x2d9u: return kKeyDeadAbovedot; case 0xa8u: return kKeyDeadDiaeresis; case 0xb0u: case 0x2dau: return kKeyDeadAbovering; case '\"': case 0x2ddu: return kKeyDeadDoubleacute; case 0x2c7u: return kKeyDeadCaron; case 0xb8u: return kKeyDeadCedilla; case 0x2dbu: return kKeyDeadOgonek; default: // unknown return kKeyNone; } } CString CKeyMap::formatKey(KeyID key, KeyModifierMask mask) { // initialize tables initKeyNameMaps(); CString x; for (SInt32 i = 0; i < kKeyModifierNumBits; ++i) { KeyModifierMask mod = (1u << i); if ((mask & mod) != 0 && s_modifierToNameMap->count(mod) > 0) { x += s_modifierToNameMap->find(mod)->second; x += "+"; } } if (key != kKeyNone) { if (s_keyToNameMap->count(key) > 0) { x += s_keyToNameMap->find(key)->second; } // XXX -- we're assuming ASCII here else if (key >= 33 && key < 127) { x += (char)key; } else { x += CStringUtil::print("\\u%04x", key); } } else if (!x.empty()) { // remove trailing '+' x.erase(x.size() - 1); } return x; } bool CKeyMap::parseKey(const CString& x, KeyID& key) { // initialize tables initKeyNameMaps(); // parse the key key = kKeyNone; if (s_nameToKeyMap->count(x) > 0) { key = s_nameToKeyMap->find(x)->second; } // XXX -- we're assuming ASCII encoding here else if (x.size() == 1) { if (!isgraph(x[0])) { // unknown key return false; } key = (KeyID)x[0]; } else if (x.size() == 6 && x[0] == '\\' && x[1] == 'u') { // escaped unicode (\uXXXX where XXXX is a hex number) char* end; key = (KeyID)strtol(x.c_str() + 2, &end, 16); if (*end != '\0') { return false; } } else if (!x.empty()) { // unknown key return false; } return true; } bool CKeyMap::parseModifiers(CString& x, KeyModifierMask& mask) { // initialize tables initKeyNameMaps(); mask = 0; CString::size_type tb = x.find_first_not_of(" \t", 0); while (tb != CString::npos) { // get next component CString::size_type te = x.find_first_of(" \t+)", tb); if (te == CString::npos) { te = x.size(); } CString c = x.substr(tb, te - tb); if (c.empty()) { // missing component return false; } if (s_nameToModifierMap->count(c) > 0) { KeyModifierMask mod = s_nameToModifierMap->find(c)->second; if ((mask & mod) != 0) { // modifier appears twice return false; } mask |= mod; } else { // unknown string x.erase(0, tb); CString::size_type tb = x.find_first_not_of(" \t"); CString::size_type te = x.find_last_not_of(" \t"); if (tb == CString::npos) { x = ""; } else { x = x.substr(tb, te - tb + 1); } return true; } // check for '+' or end of string tb = x.find_first_not_of(" \t", te); if (tb != CString::npos) { if (x[tb] != '+') { // expected '+' return false; } tb = x.find_first_not_of(" \t", tb + 1); } } // parsed the whole thing x = ""; return true; } void CKeyMap::initKeyNameMaps() { // initialize tables if (s_nameToKeyMap == NULL) { s_nameToKeyMap = new CNameToKeyMap; s_keyToNameMap = new CKeyToNameMap; for (const KeyNameMapEntry* i = kKeyNameMap; i->m_name != NULL; ++i) { (*s_nameToKeyMap)[i->m_name] = i->m_id; (*s_keyToNameMap)[i->m_id] = i->m_name; } } if (s_nameToModifierMap == NULL) { s_nameToModifierMap = new CNameToModifierMap; s_modifierToNameMap = new CModifierToNameMap; for (const KeyModifierNameMapEntry* i = kModifierNameMap; i->m_name != NULL; ++i) { (*s_nameToModifierMap)[i->m_name] = i->m_mask; (*s_modifierToNameMap)[i->m_mask] = i->m_name; } } } // // CKeyMap::KeyItem // bool CKeyMap::KeyItem::operator==(const KeyItem& x) const { return (m_id == x.m_id && m_group == x.m_group && m_button == x.m_button && m_required == x.m_required && m_sensitive == x.m_sensitive && m_generates == x.m_generates && m_dead == x.m_dead && m_lock == x.m_lock && m_client == x.m_client); } // // CKeyMap::Keystroke // CKeyMap::Keystroke::Keystroke(KeyButton button, bool press, bool repeat, UInt32 data) : m_type(kButton) { m_data.m_button.m_button = button; m_data.m_button.m_press = press; m_data.m_button.m_repeat = repeat; m_data.m_button.m_client = data; } CKeyMap::Keystroke::Keystroke(SInt32 group, bool absolute, bool restore) : m_type(kGroup) { m_data.m_group.m_group = group; m_data.m_group.m_absolute = absolute; m_data.m_group.m_restore = restore; } synergy-1.4.12-Source/src/lib/synergy/CKeyMap.h0000600000175000017500000004002312021261364021202 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2005 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CKEYMAP_H #define CKEYMAP_H #include "KeyTypes.h" #include "CString.h" #include "CStringUtil.h" #include "stdmap.h" #include "stdset.h" #include "stdvector.h" //! Key map /*! This class provides a keyboard mapping. */ class CKeyMap { public: CKeyMap(); ~CKeyMap(); //! KeyID synthesis info /*! This structure contains the information necessary to synthesize a keystroke that generates a KeyID (stored elsewhere). \c m_sensitive lists the modifiers that the key is affected by and must therefore be in the correct state, which is listed in \c m_required. If the key is mapped to a modifier, that modifier is in \c m_generates and is not in \c m_sensitive. */ struct KeyItem { public: KeyID m_id; //!< KeyID SInt32 m_group; //!< Group for key KeyButton m_button; //!< Button to generate KeyID KeyModifierMask m_required; //!< Modifiers required for KeyID KeyModifierMask m_sensitive; //!< Modifiers key is sensitive to KeyModifierMask m_generates; //!< Modifiers key is mapped to bool m_dead; //!< \c true if this is a dead KeyID bool m_lock; //!< \c true if this locks a modifier UInt32 m_client; //!< Client data public: bool operator==(const KeyItem&) const; }; //! The KeyButtons needed to synthesize a KeyID /*! An ordered list of \c KeyItems produces a particular KeyID. If the KeyID can be synthesized directly then there is one entry in the list. If dead keys are required then they're listed first. A list is the minimal set of keystrokes necessary to synthesize the KeyID, so it doesn't include no-ops. A list does not include any modifier keys unless the KeyID is a modifier, in which case it has exactly one KeyItem for the modifier itself. */ typedef std::vector KeyItemList; //! A keystroke class Keystroke { public: enum EType { kButton, //!< Synthesize button kGroup //!< Set new group }; Keystroke(KeyButton, bool press, bool repeat, UInt32 clientData); Keystroke(SInt32 group, bool absolute, bool restore); public: struct CButton { public: KeyButton m_button; //!< Button to synthesize bool m_press; //!< \c true iff press bool m_repeat; //!< \c true iff for an autorepeat UInt32 m_client; //!< Client data }; struct CGroup { public: SInt32 m_group; //!< Group/offset to change to/by bool m_absolute; //!< \c true iff change to, else by bool m_restore; //!< \c true iff for restoring state }; union CData { public: CButton m_button; CGroup m_group; }; EType m_type; CData m_data; }; //! A sequence of keystrokes typedef std::vector Keystrokes; //! A mapping of a modifier to keys for that modifier typedef std::multimap ModifierToKeys; //! A set of buttons typedef std::map ButtonToKeyMap; //! Callback type for \c foreachKey typedef void (*ForeachKeyCallback)(KeyID, SInt32 group, KeyItem&, void* userData); //! @name manipulators //@{ //! Swap with another \c CKeyMap virtual void swap(CKeyMap&); //! Add a key entry /*! Adds \p item to the entries for the item's id and group. The \c m_dead member is set automatically. */ void addKeyEntry(const KeyItem& item); //! Add an alias key entry /*! If \p targetID with the modifiers given by \p targetRequired and \p targetSensitive is not available in group \p group then find an entry for \p sourceID with modifiers given by \p sourceRequired and \p sourceSensitive in any group with exactly one item and, if found, add a new item just like it except using id \p targetID. This effectively makes the \p sourceID an alias for \p targetID (i.e. we can generate \p targetID using \p sourceID). */ void addKeyAliasEntry(KeyID targetID, SInt32 group, KeyModifierMask targetRequired, KeyModifierMask targetSensitive, KeyID sourceID, KeyModifierMask sourceRequired, KeyModifierMask sourceSensitive); //! Add a key sequence entry /*! Adds the sequence of keys \p keys (\p numKeys elements long) to synthesize key \p id in group \p group. This looks up in the map each key in \p keys. If all are found then each key is converted to the button for that key and the buttons are added as the entry for \p id. If \p id is already in the map or at least one key in \p keys is not in the map then nothing is added and this returns \c false, otherwise it returns \c true. */ bool addKeyCombinationEntry(KeyID id, SInt32 group, const KeyID* keys, UInt32 numKeys); //! Enable composition across groups /*! If called then the keyboard map will allow switching between groups during key composition. Not all systems allow that. */ void allowGroupSwitchDuringCompose(); //! Add a half-duplex button /*! Records that button \p button is a half-duplex key. This is called when translating the system's keyboard map. It's independent of the half-duplex modifier calls. */ void addHalfDuplexButton(KeyButton button); //! Remove all half-duplex modifiers /*! Removes all half-duplex modifiers. This is called to set user configurable half-duplex settings. */ void clearHalfDuplexModifiers(); //! Add a half-duplex modifier /*! Records that modifier key \p key is half-duplex. This is called to set user configurable half-duplex settings. */ virtual void addHalfDuplexModifier(KeyID key); //! Finish adding entries /*! Called after adding entries, this does some internal housekeeping. */ virtual void finish(); //! Iterate over all added keys items /*! Calls \p cb for every key item. */ virtual void foreachKey(ForeachKeyCallback cb, void* userData); //@} //! @name accessors //@{ //! Map key press/repeat to keystrokes. /*! Converts press/repeat of key \p id in group \p group with current modifiers as given in \p currentState and the desired modifiers in \p desiredMask into the keystrokes necessary to synthesize that key event in \p keys. It returns the \c KeyItem of the key being pressed/repeated, or NULL if the key cannot be mapped. */ virtual const KeyItem* mapKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const; //! Get number of groups /*! Returns the number of keyboard groups (independent layouts) in the map. */ SInt32 getNumGroups() const; //! Compute a group number /*! Returns the number of the group \p offset groups after group \p group. */ SInt32 getEffectiveGroup(SInt32 group, SInt32 offset) const; //! Find key entry compatible with modifiers /*! Returns the \c KeyItemList for the first entry for \p id in group \p group that is compatible with the given modifiers, or NULL if there isn't one. A button list is compatible with a modifiers if it is either insensitive to all modifiers in \p sensitive or it requires the modifiers to be in the state indicated by \p required for every modifier indicated by \p sensitive. */ const KeyItemList* findCompatibleKey(KeyID id, SInt32 group, KeyModifierMask required, KeyModifierMask sensitive) const; //! Test if modifier is half-duplex /*! Returns \c true iff modifier key \p key or button \p button is half-duplex. */ virtual bool isHalfDuplex(KeyID key, KeyButton button) const; //! Test if modifiers indicate a command /*! Returns \c true iff the modifiers in \p mask contain any command modifiers. A command modifier is used for keyboard shortcuts and hotkeys, Rather than trying to synthesize a character, a command is trying to synthesize a particular set of buttons. So it's not important to match the shift or AltGr state to achieve a character but it is important to match the modifier state exactly. */ bool isCommand(KeyModifierMask mask) const; // Get the modifiers that indicate a command /*! Returns the modifiers that when combined with other keys indicate a command (e.g. shortcut or hotkey). */ KeyModifierMask getCommandModifiers() const; //! Get buttons from modifier map /*! Put all the keys in \p modifiers into \p keys. */ static void collectButtons(const ModifierToKeys& modifiers, ButtonToKeyMap& keys); //! Set modifier key state /*! Sets the modifier key state (\c m_generates and \c m_lock) in \p item based on the \c m_id in \p item. */ static void initModifierKey(KeyItem& item); //! Test for a dead key /*! Returns \c true if \p key is a dead key. */ static bool isDeadKey(KeyID key); //! Get corresponding dead key /*! Returns the dead key corresponding to \p key if one exists, otherwise return \c kKeyNone. This returns \p key if it's already a dead key. */ static KeyID getDeadKey(KeyID key); //! Get string for a key and modifier mask /*! Converts a key and modifier mask into a string representing the combination. */ static CString formatKey(KeyID key, KeyModifierMask); //! Parse a string into a key /*! Converts a string into a key. Returns \c true on success and \c false if the string cannot be parsed. */ static bool parseKey(const CString&, KeyID&); //! Parse a string into a modifier mask /*! Converts a string into a modifier mask. Returns \c true on success and \c false if the string cannot be parsed. The modifiers plus any remaining leading and trailing whitespace is stripped from the input string. */ static bool parseModifiers(CString&, KeyModifierMask&); //@} private: //! Ways to synthesize a key enum EKeystroke { kKeystrokePress, //!< Synthesize a press kKeystrokeRelease, //!< Synthesize a release kKeystrokeRepeat, //!< Synthesize an autorepeat kKeystrokeClick, //!< Synthesize a press and release kKeystrokeModify, //!< Synthesize pressing a modifier kKeystrokeUnmodify //!< Synthesize releasing a modifier }; // A list of ways to synthesize a KeyID typedef std::vector KeyEntryList; // computes the number of groups SInt32 findNumGroups() const; // computes the map of modifiers to the keys that generate the modifiers void setModifierKeys(); // maps a command key. a command key is a keyboard shortcut and we're // trying to synthesize a button press with an exact sets of modifiers, // not trying to synthesize a character. so we just need to find the // right button and synthesize the requested modifiers without regard // to what character they would synthesize. we disallow multikey // entries since they don't make sense as hotkeys. const KeyItem* mapCommandKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const; // maps a character key. a character key is trying to synthesize a // particular KeyID and isn't entirely concerned with the modifiers // used to do it. const KeyItem* mapCharacterKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const; // maps a modifier key const KeyItem* mapModifierKey(Keystrokes& keys, KeyID id, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) const; // returns the index into \p entryList of the KeyItemList requiring // the fewest modifier changes between \p currentState and // \p desiredState. SInt32 findBestKey(const KeyEntryList& entryList, KeyModifierMask currentState, KeyModifierMask desiredState) const; // gets the \c KeyItem used to synthesize the modifier who's bit is // given by \p modifierBit in group \p group and does not synthesize // the key \p button. const KeyItem* keyForModifier(KeyButton button, SInt32 group, SInt32 modifierBit) const; // fills \p keystrokes with the keys to synthesize the key in // \p keyItem taking the modifiers into account. returns \c true // iff successful and sets \p currentState to the // resulting modifier state. bool keysForKeyItem(const KeyItem& keyItem, SInt32& group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredState, KeyModifierMask overrideModifiers, bool isAutoRepeat, Keystrokes& keystrokes) const; // fills \p keystrokes with the keys to synthesize the modifiers // in \p desiredModifiers from the active modifiers listed in // \p activeModifiers not including the key in \p keyItem. // returns \c true iff successful. bool keysToRestoreModifiers(const KeyItem& keyItem, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, const ModifierToKeys& desiredModifiers, Keystrokes& keystrokes) const; // fills \p keystrokes and \p undo with the keys to change the // current modifier state in \p currentState to match the state in // \p requiredState for each modifier indicated in \p sensitiveMask. // returns \c true iff successful and sets \p currentState to the // resulting modifier state. bool keysForModifierState(KeyButton button, SInt32 group, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask requiredState, KeyModifierMask sensitiveMask, KeyModifierMask notRequiredMask, Keystrokes& keystrokes) const; // Adds keystrokes to synthesize key \p keyItem in mode \p type to // \p keystrokes and to undo the synthesis to \p undo. void addKeystrokes(EKeystroke type, const KeyItem& keyItem, ModifierToKeys& activeModifiers, KeyModifierMask& currentState, Keystrokes& keystrokes) const; // Returns the number of modifiers indicated in \p state. static SInt32 getNumModifiers(KeyModifierMask state); // Initialize key name/id maps static void initKeyNameMaps(); // not implemented CKeyMap(const CKeyMap&); CKeyMap& operator=(const CKeyMap&); private: // Ways to synthesize a KeyID over multiple keyboard groups typedef std::vector KeyGroupTable; // Table of KeyID to ways to synthesize that KeyID typedef std::map KeyIDMap; // List of KeyItems that generate a particular modifier typedef std::vector ModifierKeyItemList; // Map a modifier to the KeyItems that synthesize that modifier typedef std::vector ModifierToKeyTable; // A set of keys typedef std::set KeySet; // A set of buttons typedef std::set KeyButtonSet; // Key maps for parsing/formatting typedef std::map CNameToKeyMap; typedef std::map CNameToModifierMap; typedef std::map CKeyToNameMap; typedef std::map CModifierToNameMap; // KeyID info KeyIDMap m_keyIDMap; SInt32 m_numGroups; ModifierToKeyTable m_modifierKeys; // composition info bool m_composeAcrossGroups; // half-duplex info KeyButtonSet m_halfDuplex; // half-duplex set by synergy KeySet m_halfDuplexMods; // half-duplex set by user // dummy KeyItem for changing modifiers KeyItem m_modifierKeyItem; // parsing/formatting tables static CNameToKeyMap* s_nameToKeyMap; static CNameToModifierMap* s_nameToModifierMap; static CKeyToNameMap* s_keyToNameMap; static CModifierToNameMap* s_modifierToNameMap; }; #endif synergy-1.4.12-Source/src/lib/synergy/CKeyState.cpp0000600000175000017500000010446412021261364022112 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CKeyState.h" #include "CLog.h" #include #include #include #include static const KeyButton kButtonMask = (KeyButton)(IKeyState::kNumButtons - 1); static const KeyID s_decomposeTable[] = { // spacing version of dead keys 0x0060, 0x0300, 0x0020, 0, // grave, dead_grave, space 0x00b4, 0x0301, 0x0020, 0, // acute, dead_acute, space 0x005e, 0x0302, 0x0020, 0, // asciicircum, dead_circumflex, space 0x007e, 0x0303, 0x0020, 0, // asciitilde, dead_tilde, space 0x00a8, 0x0308, 0x0020, 0, // diaeresis, dead_diaeresis, space 0x00b0, 0x030a, 0x0020, 0, // degree, dead_abovering, space 0x00b8, 0x0327, 0x0020, 0, // cedilla, dead_cedilla, space 0x02db, 0x0328, 0x0020, 0, // ogonek, dead_ogonek, space 0x02c7, 0x030c, 0x0020, 0, // caron, dead_caron, space 0x02d9, 0x0307, 0x0020, 0, // abovedot, dead_abovedot, space 0x02dd, 0x030b, 0x0020, 0, // doubleacute, dead_doubleacute, space 0x02d8, 0x0306, 0x0020, 0, // breve, dead_breve, space 0x00af, 0x0304, 0x0020, 0, // macron, dead_macron, space // Latin-1 (ISO 8859-1) 0x00c0, 0x0300, 0x0041, 0, // Agrave, dead_grave, A 0x00c1, 0x0301, 0x0041, 0, // Aacute, dead_acute, A 0x00c2, 0x0302, 0x0041, 0, // Acircumflex, dead_circumflex, A 0x00c3, 0x0303, 0x0041, 0, // Atilde, dead_tilde, A 0x00c4, 0x0308, 0x0041, 0, // Adiaeresis, dead_diaeresis, A 0x00c5, 0x030a, 0x0041, 0, // Aring, dead_abovering, A 0x00c7, 0x0327, 0x0043, 0, // Ccedilla, dead_cedilla, C 0x00c8, 0x0300, 0x0045, 0, // Egrave, dead_grave, E 0x00c9, 0x0301, 0x0045, 0, // Eacute, dead_acute, E 0x00ca, 0x0302, 0x0045, 0, // Ecircumflex, dead_circumflex, E 0x00cb, 0x0308, 0x0045, 0, // Ediaeresis, dead_diaeresis, E 0x00cc, 0x0300, 0x0049, 0, // Igrave, dead_grave, I 0x00cd, 0x0301, 0x0049, 0, // Iacute, dead_acute, I 0x00ce, 0x0302, 0x0049, 0, // Icircumflex, dead_circumflex, I 0x00cf, 0x0308, 0x0049, 0, // Idiaeresis, dead_diaeresis, I 0x00d1, 0x0303, 0x004e, 0, // Ntilde, dead_tilde, N 0x00d2, 0x0300, 0x004f, 0, // Ograve, dead_grave, O 0x00d3, 0x0301, 0x004f, 0, // Oacute, dead_acute, O 0x00d4, 0x0302, 0x004f, 0, // Ocircumflex, dead_circumflex, O 0x00d5, 0x0303, 0x004f, 0, // Otilde, dead_tilde, O 0x00d6, 0x0308, 0x004f, 0, // Odiaeresis, dead_diaeresis, O 0x00d9, 0x0300, 0x0055, 0, // Ugrave, dead_grave, U 0x00da, 0x0301, 0x0055, 0, // Uacute, dead_acute, U 0x00db, 0x0302, 0x0055, 0, // Ucircumflex, dead_circumflex, U 0x00dc, 0x0308, 0x0055, 0, // Udiaeresis, dead_diaeresis, U 0x00dd, 0x0301, 0x0059, 0, // Yacute, dead_acute, Y 0x00e0, 0x0300, 0x0061, 0, // agrave, dead_grave, a 0x00e1, 0x0301, 0x0061, 0, // aacute, dead_acute, a 0x00e2, 0x0302, 0x0061, 0, // acircumflex, dead_circumflex, a 0x00e3, 0x0303, 0x0061, 0, // atilde, dead_tilde, a 0x00e4, 0x0308, 0x0061, 0, // adiaeresis, dead_diaeresis, a 0x00e5, 0x030a, 0x0061, 0, // aring, dead_abovering, a 0x00e7, 0x0327, 0x0063, 0, // ccedilla, dead_cedilla, c 0x00e8, 0x0300, 0x0065, 0, // egrave, dead_grave, e 0x00e9, 0x0301, 0x0065, 0, // eacute, dead_acute, e 0x00ea, 0x0302, 0x0065, 0, // ecircumflex, dead_circumflex, e 0x00eb, 0x0308, 0x0065, 0, // ediaeresis, dead_diaeresis, e 0x00ec, 0x0300, 0x0069, 0, // igrave, dead_grave, i 0x00ed, 0x0301, 0x0069, 0, // iacute, dead_acute, i 0x00ee, 0x0302, 0x0069, 0, // icircumflex, dead_circumflex, i 0x00ef, 0x0308, 0x0069, 0, // idiaeresis, dead_diaeresis, i 0x00f1, 0x0303, 0x006e, 0, // ntilde, dead_tilde, n 0x00f2, 0x0300, 0x006f, 0, // ograve, dead_grave, o 0x00f3, 0x0301, 0x006f, 0, // oacute, dead_acute, o 0x00f4, 0x0302, 0x006f, 0, // ocircumflex, dead_circumflex, o 0x00f5, 0x0303, 0x006f, 0, // otilde, dead_tilde, o 0x00f6, 0x0308, 0x006f, 0, // odiaeresis, dead_diaeresis, o 0x00f9, 0x0300, 0x0075, 0, // ugrave, dead_grave, u 0x00fa, 0x0301, 0x0075, 0, // uacute, dead_acute, u 0x00fb, 0x0302, 0x0075, 0, // ucircumflex, dead_circumflex, u 0x00fc, 0x0308, 0x0075, 0, // udiaeresis, dead_diaeresis, u 0x00fd, 0x0301, 0x0079, 0, // yacute, dead_acute, y 0x00ff, 0x0308, 0x0079, 0, // ydiaeresis, dead_diaeresis, y // Latin-2 (ISO 8859-2) 0x0104, 0x0328, 0x0041, 0, // Aogonek, dead_ogonek, A 0x013d, 0x030c, 0x004c, 0, // Lcaron, dead_caron, L 0x015a, 0x0301, 0x0053, 0, // Sacute, dead_acute, S 0x0160, 0x030c, 0x0053, 0, // Scaron, dead_caron, S 0x015e, 0x0327, 0x0053, 0, // Scedilla, dead_cedilla, S 0x0164, 0x030c, 0x0054, 0, // Tcaron, dead_caron, T 0x0179, 0x0301, 0x005a, 0, // Zacute, dead_acute, Z 0x017d, 0x030c, 0x005a, 0, // Zcaron, dead_caron, Z 0x017b, 0x0307, 0x005a, 0, // Zabovedot, dead_abovedot, Z 0x0105, 0x0328, 0x0061, 0, // aogonek, dead_ogonek, a 0x013e, 0x030c, 0x006c, 0, // lcaron, dead_caron, l 0x015b, 0x0301, 0x0073, 0, // sacute, dead_acute, s 0x0161, 0x030c, 0x0073, 0, // scaron, dead_caron, s 0x015f, 0x0327, 0x0073, 0, // scedilla, dead_cedilla, s 0x0165, 0x030c, 0x0074, 0, // tcaron, dead_caron, t 0x017a, 0x0301, 0x007a, 0, // zacute, dead_acute, z 0x017e, 0x030c, 0x007a, 0, // zcaron, dead_caron, z 0x017c, 0x0307, 0x007a, 0, // zabovedot, dead_abovedot, z 0x0154, 0x0301, 0x0052, 0, // Racute, dead_acute, R 0x0102, 0x0306, 0x0041, 0, // Abreve, dead_breve, A 0x0139, 0x0301, 0x004c, 0, // Lacute, dead_acute, L 0x0106, 0x0301, 0x0043, 0, // Cacute, dead_acute, C 0x010c, 0x030c, 0x0043, 0, // Ccaron, dead_caron, C 0x0118, 0x0328, 0x0045, 0, // Eogonek, dead_ogonek, E 0x011a, 0x030c, 0x0045, 0, // Ecaron, dead_caron, E 0x010e, 0x030c, 0x0044, 0, // Dcaron, dead_caron, D 0x0143, 0x0301, 0x004e, 0, // Nacute, dead_acute, N 0x0147, 0x030c, 0x004e, 0, // Ncaron, dead_caron, N 0x0150, 0x030b, 0x004f, 0, // Odoubleacute, dead_doubleacute, O 0x0158, 0x030c, 0x0052, 0, // Rcaron, dead_caron, R 0x016e, 0x030a, 0x0055, 0, // Uring, dead_abovering, U 0x0170, 0x030b, 0x0055, 0, // Udoubleacute, dead_doubleacute, U 0x0162, 0x0327, 0x0054, 0, // Tcedilla, dead_cedilla, T 0x0155, 0x0301, 0x0072, 0, // racute, dead_acute, r 0x0103, 0x0306, 0x0061, 0, // abreve, dead_breve, a 0x013a, 0x0301, 0x006c, 0, // lacute, dead_acute, l 0x0107, 0x0301, 0x0063, 0, // cacute, dead_acute, c 0x010d, 0x030c, 0x0063, 0, // ccaron, dead_caron, c 0x0119, 0x0328, 0x0065, 0, // eogonek, dead_ogonek, e 0x011b, 0x030c, 0x0065, 0, // ecaron, dead_caron, e 0x010f, 0x030c, 0x0064, 0, // dcaron, dead_caron, d 0x0144, 0x0301, 0x006e, 0, // nacute, dead_acute, n 0x0148, 0x030c, 0x006e, 0, // ncaron, dead_caron, n 0x0151, 0x030b, 0x006f, 0, // odoubleacute, dead_doubleacute, o 0x0159, 0x030c, 0x0072, 0, // rcaron, dead_caron, r 0x016f, 0x030a, 0x0075, 0, // uring, dead_abovering, u 0x0171, 0x030b, 0x0075, 0, // udoubleacute, dead_doubleacute, u 0x0163, 0x0327, 0x0074, 0, // tcedilla, dead_cedilla, t // Latin-3 (ISO 8859-3) 0x0124, 0x0302, 0x0048, 0, // Hcircumflex, dead_circumflex, H 0x0130, 0x0307, 0x0049, 0, // Iabovedot, dead_abovedot, I 0x011e, 0x0306, 0x0047, 0, // Gbreve, dead_breve, G 0x0134, 0x0302, 0x004a, 0, // Jcircumflex, dead_circumflex, J 0x0125, 0x0302, 0x0068, 0, // hcircumflex, dead_circumflex, h 0x011f, 0x0306, 0x0067, 0, // gbreve, dead_breve, g 0x0135, 0x0302, 0x006a, 0, // jcircumflex, dead_circumflex, j 0x010a, 0x0307, 0x0043, 0, // Cabovedot, dead_abovedot, C 0x0108, 0x0302, 0x0043, 0, // Ccircumflex, dead_circumflex, C 0x0120, 0x0307, 0x0047, 0, // Gabovedot, dead_abovedot, G 0x011c, 0x0302, 0x0047, 0, // Gcircumflex, dead_circumflex, G 0x016c, 0x0306, 0x0055, 0, // Ubreve, dead_breve, U 0x015c, 0x0302, 0x0053, 0, // Scircumflex, dead_circumflex, S 0x010b, 0x0307, 0x0063, 0, // cabovedot, dead_abovedot, c 0x0109, 0x0302, 0x0063, 0, // ccircumflex, dead_circumflex, c 0x0121, 0x0307, 0x0067, 0, // gabovedot, dead_abovedot, g 0x011d, 0x0302, 0x0067, 0, // gcircumflex, dead_circumflex, g 0x016d, 0x0306, 0x0075, 0, // ubreve, dead_breve, u 0x015d, 0x0302, 0x0073, 0, // scircumflex, dead_circumflex, s // Latin-4 (ISO 8859-4) 0x0156, 0x0327, 0x0052, 0, // Rcedilla, dead_cedilla, R 0x0128, 0x0303, 0x0049, 0, // Itilde, dead_tilde, I 0x013b, 0x0327, 0x004c, 0, // Lcedilla, dead_cedilla, L 0x0112, 0x0304, 0x0045, 0, // Emacron, dead_macron, E 0x0122, 0x0327, 0x0047, 0, // Gcedilla, dead_cedilla, G 0x0157, 0x0327, 0x0072, 0, // rcedilla, dead_cedilla, r 0x0129, 0x0303, 0x0069, 0, // itilde, dead_tilde, i 0x013c, 0x0327, 0x006c, 0, // lcedilla, dead_cedilla, l 0x0113, 0x0304, 0x0065, 0, // emacron, dead_macron, e 0x0123, 0x0327, 0x0067, 0, // gcedilla, dead_cedilla, g 0x0100, 0x0304, 0x0041, 0, // Amacron, dead_macron, A 0x012e, 0x0328, 0x0049, 0, // Iogonek, dead_ogonek, I 0x0116, 0x0307, 0x0045, 0, // Eabovedot, dead_abovedot, E 0x012a, 0x0304, 0x0049, 0, // Imacron, dead_macron, I 0x0145, 0x0327, 0x004e, 0, // Ncedilla, dead_cedilla, N 0x014c, 0x0304, 0x004f, 0, // Omacron, dead_macron, O 0x0136, 0x0327, 0x004b, 0, // Kcedilla, dead_cedilla, K 0x0172, 0x0328, 0x0055, 0, // Uogonek, dead_ogonek, U 0x0168, 0x0303, 0x0055, 0, // Utilde, dead_tilde, U 0x016a, 0x0304, 0x0055, 0, // Umacron, dead_macron, U 0x0101, 0x0304, 0x0061, 0, // amacron, dead_macron, a 0x012f, 0x0328, 0x0069, 0, // iogonek, dead_ogonek, i 0x0117, 0x0307, 0x0065, 0, // eabovedot, dead_abovedot, e 0x012b, 0x0304, 0x0069, 0, // imacron, dead_macron, i 0x0146, 0x0327, 0x006e, 0, // ncedilla, dead_cedilla, n 0x014d, 0x0304, 0x006f, 0, // omacron, dead_macron, o 0x0137, 0x0327, 0x006b, 0, // kcedilla, dead_cedilla, k 0x0173, 0x0328, 0x0075, 0, // uogonek, dead_ogonek, u 0x0169, 0x0303, 0x0075, 0, // utilde, dead_tilde, u 0x016b, 0x0304, 0x0075, 0, // umacron, dead_macron, u // Latin-8 (ISO 8859-14) 0x1e02, 0x0307, 0x0042, 0, // Babovedot, dead_abovedot, B 0x1e03, 0x0307, 0x0062, 0, // babovedot, dead_abovedot, b 0x1e0a, 0x0307, 0x0044, 0, // Dabovedot, dead_abovedot, D 0x1e80, 0x0300, 0x0057, 0, // Wgrave, dead_grave, W 0x1e82, 0x0301, 0x0057, 0, // Wacute, dead_acute, W 0x1e0b, 0x0307, 0x0064, 0, // dabovedot, dead_abovedot, d 0x1ef2, 0x0300, 0x0059, 0, // Ygrave, dead_grave, Y 0x1e1e, 0x0307, 0x0046, 0, // Fabovedot, dead_abovedot, F 0x1e1f, 0x0307, 0x0066, 0, // fabovedot, dead_abovedot, f 0x1e40, 0x0307, 0x004d, 0, // Mabovedot, dead_abovedot, M 0x1e41, 0x0307, 0x006d, 0, // mabovedot, dead_abovedot, m 0x1e56, 0x0307, 0x0050, 0, // Pabovedot, dead_abovedot, P 0x1e81, 0x0300, 0x0077, 0, // wgrave, dead_grave, w 0x1e57, 0x0307, 0x0070, 0, // pabovedot, dead_abovedot, p 0x1e83, 0x0301, 0x0077, 0, // wacute, dead_acute, w 0x1e60, 0x0307, 0x0053, 0, // Sabovedot, dead_abovedot, S 0x1ef3, 0x0300, 0x0079, 0, // ygrave, dead_grave, y 0x1e84, 0x0308, 0x0057, 0, // Wdiaeresis, dead_diaeresis, W 0x1e85, 0x0308, 0x0077, 0, // wdiaeresis, dead_diaeresis, w 0x1e61, 0x0307, 0x0073, 0, // sabovedot, dead_abovedot, s 0x0174, 0x0302, 0x0057, 0, // Wcircumflex, dead_circumflex, W 0x1e6a, 0x0307, 0x0054, 0, // Tabovedot, dead_abovedot, T 0x0176, 0x0302, 0x0059, 0, // Ycircumflex, dead_circumflex, Y 0x0175, 0x0302, 0x0077, 0, // wcircumflex, dead_circumflex, w 0x1e6b, 0x0307, 0x0074, 0, // tabovedot, dead_abovedot, t 0x0177, 0x0302, 0x0079, 0, // ycircumflex, dead_circumflex, y // Latin-9 (ISO 8859-15) 0x0178, 0x0308, 0x0059, 0, // Ydiaeresis, dead_diaeresis, Y // Compose key sequences 0x00c6, kKeyCompose, 0x0041, 0x0045, 0, // AE, A, E 0x00c1, kKeyCompose, 0x0041, 0x0027, 0, // Aacute, A, apostrophe 0x00c2, kKeyCompose, 0x0041, 0x0053, 0, // Acircumflex, A, asciicircum 0x00c3, kKeyCompose, 0x0041, 0x0022, 0, // Adiaeresis, A, quotedbl 0x00c0, kKeyCompose, 0x0041, 0x0060, 0, // Agrave, A, grave 0x00c5, kKeyCompose, 0x0041, 0x002a, 0, // Aring, A, asterisk 0x00c3, kKeyCompose, 0x0041, 0x007e, 0, // Atilde, A, asciitilde 0x00c7, kKeyCompose, 0x0043, 0x002c, 0, // Ccedilla, C, comma 0x00d0, kKeyCompose, 0x0044, 0x002d, 0, // ETH, D, minus 0x00c9, kKeyCompose, 0x0045, 0x0027, 0, // Eacute, E, apostrophe 0x00ca, kKeyCompose, 0x0045, 0x0053, 0, // Ecircumflex, E, asciicircum 0x00cb, kKeyCompose, 0x0045, 0x0022, 0, // Ediaeresis, E, quotedbl 0x00c8, kKeyCompose, 0x0045, 0x0060, 0, // Egrave, E, grave 0x00cd, kKeyCompose, 0x0049, 0x0027, 0, // Iacute, I, apostrophe 0x00ce, kKeyCompose, 0x0049, 0x0053, 0, // Icircumflex, I, asciicircum 0x00cf, kKeyCompose, 0x0049, 0x0022, 0, // Idiaeresis, I, quotedbl 0x00cc, kKeyCompose, 0x0049, 0x0060, 0, // Igrave, I, grave 0x00d1, kKeyCompose, 0x004e, 0x007e, 0, // Ntilde, N, asciitilde 0x00d3, kKeyCompose, 0x004f, 0x0027, 0, // Oacute, O, apostrophe 0x00d4, kKeyCompose, 0x004f, 0x0053, 0, // Ocircumflex, O, asciicircum 0x00d6, kKeyCompose, 0x004f, 0x0022, 0, // Odiaeresis, O, quotedbl 0x00d2, kKeyCompose, 0x004f, 0x0060, 0, // Ograve, O, grave 0x00d8, kKeyCompose, 0x004f, 0x002f, 0, // Ooblique, O, slash 0x00d5, kKeyCompose, 0x004f, 0x007e, 0, // Otilde, O, asciitilde 0x00de, kKeyCompose, 0x0054, 0x0048, 0, // THORN, T, H 0x00da, kKeyCompose, 0x0055, 0x0027, 0, // Uacute, U, apostrophe 0x00db, kKeyCompose, 0x0055, 0x0053, 0, // Ucircumflex, U, asciicircum 0x00dc, kKeyCompose, 0x0055, 0x0022, 0, // Udiaeresis, U, quotedbl 0x00d9, kKeyCompose, 0x0055, 0x0060, 0, // Ugrave, U, grave 0x00dd, kKeyCompose, 0x0059, 0x0027, 0, // Yacute, Y, apostrophe 0x00e1, kKeyCompose, 0x0061, 0x0027, 0, // aacute, a, apostrophe 0x00e2, kKeyCompose, 0x0061, 0x0053, 0, // acircumflex, a, asciicircum 0x00b4, kKeyCompose, 0x0027, 0x0027, 0, // acute, apostrophe, apostrophe 0x00e4, kKeyCompose, 0x0061, 0x0022, 0, // adiaeresis, a, quotedbl 0x00e6, kKeyCompose, 0x0061, 0x0065, 0, // ae, a, e 0x00e0, kKeyCompose, 0x0061, 0x0060, 0, // agrave, a, grave 0x00e5, kKeyCompose, 0x0061, 0x002a, 0, // aring, a, asterisk 0x0040, kKeyCompose, 0x0041, 0x0054, 0, // at, A, T 0x00e3, kKeyCompose, 0x0061, 0x007e, 0, // atilde, a, asciitilde 0x005c, kKeyCompose, 0x002f, 0x002f, 0, // backslash, slash, slash 0x007c, kKeyCompose, 0x004c, 0x0056, 0, // bar, L, V 0x007b, kKeyCompose, 0x0028, 0x002d, 0, // braceleft, parenleft, minus 0x007d, kKeyCompose, 0x0029, 0x002d, 0, // braceright, parenright, minus 0x005b, kKeyCompose, 0x0028, 0x0028, 0, // bracketleft, parenleft, parenleft 0x005d, kKeyCompose, 0x0029, 0x0029, 0, // bracketright, parenright, parenright 0x00a6, kKeyCompose, 0x0042, 0x0056, 0, // brokenbar, B, V 0x00e7, kKeyCompose, 0x0063, 0x002c, 0, // ccedilla, c, comma 0x00b8, kKeyCompose, 0x002c, 0x002c, 0, // cedilla, comma, comma 0x00a2, kKeyCompose, 0x0063, 0x002f, 0, // cent, c, slash 0x00a9, kKeyCompose, 0x0028, 0x0063, 0, // copyright, parenleft, c 0x00a4, kKeyCompose, 0x006f, 0x0078, 0, // currency, o, x 0x00b0, kKeyCompose, 0x0030, 0x0053, 0, // degree, 0, asciicircum 0x00a8, kKeyCompose, 0x0022, 0x0022, 0, // diaeresis, quotedbl, quotedbl 0x00f7, kKeyCompose, 0x003a, 0x002d, 0, // division, colon, minus 0x00e9, kKeyCompose, 0x0065, 0x0027, 0, // eacute, e, apostrophe 0x00ea, kKeyCompose, 0x0065, 0x0053, 0, // ecircumflex, e, asciicircum 0x00eb, kKeyCompose, 0x0065, 0x0022, 0, // ediaeresis, e, quotedbl 0x00e8, kKeyCompose, 0x0065, 0x0060, 0, // egrave, e, grave 0x00f0, kKeyCompose, 0x0064, 0x002d, 0, // eth, d, minus 0x00a1, kKeyCompose, 0x0021, 0x0021, 0, // exclamdown, exclam, exclam 0x00ab, kKeyCompose, 0x003c, 0x003c, 0, // guillemotleft, less, less 0x00bb, kKeyCompose, 0x003e, 0x003e, 0, // guillemotright, greater, greater 0x0023, kKeyCompose, 0x002b, 0x002b, 0, // numbersign, plus, plus 0x00ad, kKeyCompose, 0x002d, 0x002d, 0, // hyphen, minus, minus 0x00ed, kKeyCompose, 0x0069, 0x0027, 0, // iacute, i, apostrophe 0x00ee, kKeyCompose, 0x0069, 0x0053, 0, // icircumflex, i, asciicircum 0x00ef, kKeyCompose, 0x0069, 0x0022, 0, // idiaeresis, i, quotedbl 0x00ec, kKeyCompose, 0x0069, 0x0060, 0, // igrave, i, grave 0x00af, kKeyCompose, 0x002d, 0x0053, 0, // macron, minus, asciicircum 0x00ba, kKeyCompose, 0x006f, 0x005f, 0, // masculine, o, underscore 0x00b5, kKeyCompose, 0x0075, 0x002f, 0, // mu, u, slash 0x00d7, kKeyCompose, 0x0078, 0x0078, 0, // multiply, x, x 0x00a0, kKeyCompose, 0x0020, 0x0020, 0, // nobreakspace, space, space 0x00ac, kKeyCompose, 0x002c, 0x002d, 0, // notsign, comma, minus 0x00f1, kKeyCompose, 0x006e, 0x007e, 0, // ntilde, n, asciitilde 0x00f3, kKeyCompose, 0x006f, 0x0027, 0, // oacute, o, apostrophe 0x00f4, kKeyCompose, 0x006f, 0x0053, 0, // ocircumflex, o, asciicircum 0x00f6, kKeyCompose, 0x006f, 0x0022, 0, // odiaeresis, o, quotedbl 0x00f2, kKeyCompose, 0x006f, 0x0060, 0, // ograve, o, grave 0x00bd, kKeyCompose, 0x0031, 0x0032, 0, // onehalf, 1, 2 0x00bc, kKeyCompose, 0x0031, 0x0034, 0, // onequarter, 1, 4 0x00b9, kKeyCompose, 0x0031, 0x0053, 0, // onesuperior, 1, asciicircum 0x00aa, kKeyCompose, 0x0061, 0x005f, 0, // ordfeminine, a, underscore 0x00f8, kKeyCompose, 0x006f, 0x002f, 0, // oslash, o, slash 0x00f5, kKeyCompose, 0x006f, 0x007e, 0, // otilde, o, asciitilde 0x00b6, kKeyCompose, 0x0070, 0x0021, 0, // paragraph, p, exclam 0x00b7, kKeyCompose, 0x002e, 0x002e, 0, // periodcentered, period, period 0x00b1, kKeyCompose, 0x002b, 0x002d, 0, // plusminus, plus, minus 0x00bf, kKeyCompose, 0x003f, 0x003f, 0, // questiondown, question, question 0x00ae, kKeyCompose, 0x0028, 0x0072, 0, // registered, parenleft, r 0x00a7, kKeyCompose, 0x0073, 0x006f, 0, // section, s, o 0x00df, kKeyCompose, 0x0073, 0x0073, 0, // ssharp, s, s 0x00a3, kKeyCompose, 0x004c, 0x002d, 0, // sterling, L, minus 0x00fe, kKeyCompose, 0x0074, 0x0068, 0, // thorn, t, h 0x00be, kKeyCompose, 0x0033, 0x0034, 0, // threequarters, 3, 4 0x00b3, kKeyCompose, 0x0033, 0x0053, 0, // threesuperior, 3, asciicircum 0x00b2, kKeyCompose, 0x0032, 0x0053, 0, // twosuperior, 2, asciicircum 0x00fa, kKeyCompose, 0x0075, 0x0027, 0, // uacute, u, apostrophe 0x00fb, kKeyCompose, 0x0075, 0x0053, 0, // ucircumflex, u, asciicircum 0x00fc, kKeyCompose, 0x0075, 0x0022, 0, // udiaeresis, u, quotedbl 0x00f9, kKeyCompose, 0x0075, 0x0060, 0, // ugrave, u, grave 0x00fd, kKeyCompose, 0x0079, 0x0027, 0, // yacute, y, apostrophe 0x00ff, kKeyCompose, 0x0079, 0x0022, 0, // ydiaeresis, y, quotedbl 0x00a5, kKeyCompose, 0x0079, 0x003d, 0, // yen, y, equal // end of table 0 }; static const KeyID s_numpadTable[] = { kKeyKP_Space, 0x0020, kKeyKP_Tab, kKeyTab, kKeyKP_Enter, kKeyReturn, kKeyKP_F1, kKeyF1, kKeyKP_F2, kKeyF2, kKeyKP_F3, kKeyF3, kKeyKP_F4, kKeyF4, kKeyKP_Home, kKeyHome, kKeyKP_Left, kKeyLeft, kKeyKP_Up, kKeyUp, kKeyKP_Right, kKeyRight, kKeyKP_Down, kKeyDown, kKeyKP_PageUp, kKeyPageUp, kKeyKP_PageDown, kKeyPageDown, kKeyKP_End, kKeyEnd, kKeyKP_Begin, kKeyBegin, kKeyKP_Insert, kKeyInsert, kKeyKP_Delete, kKeyDelete, kKeyKP_Equal, 0x003d, kKeyKP_Multiply, 0x002a, kKeyKP_Add, 0x002b, kKeyKP_Separator, 0x002c, kKeyKP_Subtract, 0x002d, kKeyKP_Decimal, 0x002e, kKeyKP_Divide, 0x002f, kKeyKP_0, 0x0030, kKeyKP_1, 0x0031, kKeyKP_2, 0x0032, kKeyKP_3, 0x0033, kKeyKP_4, 0x0034, kKeyKP_5, 0x0035, kKeyKP_6, 0x0036, kKeyKP_7, 0x0037, kKeyKP_8, 0x0038, kKeyKP_9, 0x0039 }; // // CKeyState // CKeyState::CKeyState() : IKeyState(), m_mask(0), m_keyMapPtr(new CKeyMap()), m_keyMap(*m_keyMapPtr) { init(); } CKeyState::CKeyState(IEventQueue& eventQueue, CKeyMap& keyMap) : IKeyState(eventQueue), m_mask(0), m_keyMapPtr(0), m_keyMap(keyMap) { init(); } CKeyState::~CKeyState() { if (m_keyMapPtr) delete m_keyMapPtr; } void CKeyState::init() { memset(&m_keys, 0, sizeof(m_keys)); memset(&m_syntheticKeys, 0, sizeof(m_syntheticKeys)); memset(&m_keyClientData, 0, sizeof(m_keyClientData)); memset(&m_serverKeys, 0, sizeof(m_serverKeys)); } void CKeyState::onKey(KeyButton button, bool down, KeyModifierMask newState) { // update modifier state m_mask = newState; LOG((CLOG_DEBUG1 "new mask: 0x%04x", m_mask)); // ignore bogus buttons button &= kButtonMask; if (button == 0) { return; } // update key state if (down) { m_keys[button] = 1; m_syntheticKeys[button] = 1; } else { m_keys[button] = 0; m_syntheticKeys[button] = 0; } } void CKeyState::sendKeyEvent( void* target, bool press, bool isAutoRepeat, KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button) { if (m_keyMap.isHalfDuplex(key, button)) { if (isAutoRepeat) { // ignore auto-repeat on half-duplex keys } else { getEventQueue().addEvent(CEvent(getKeyDownEvent(), target, CKeyInfo::alloc(key, mask, button, 1))); getEventQueue().addEvent(CEvent(getKeyUpEvent(), target, CKeyInfo::alloc(key, mask, button, 1))); } } else { if (isAutoRepeat) { getEventQueue().addEvent(CEvent(getKeyRepeatEvent(), target, CKeyInfo::alloc(key, mask, button, count))); } else if (press) { getEventQueue().addEvent(CEvent(getKeyDownEvent(), target, CKeyInfo::alloc(key, mask, button, 1))); } else { getEventQueue().addEvent(CEvent(getKeyUpEvent(), target, CKeyInfo::alloc(key, mask, button, 1))); } } } void CKeyState::updateKeyMap() { // get the current keyboard map CKeyMap keyMap; getKeyMap(keyMap); m_keyMap.swap(keyMap); m_keyMap.finish(); // add special keys addCombinationEntries(); addKeypadEntries(); addAliasEntries(); } void CKeyState::updateKeyState() { // reset our state memset(&m_keys, 0, sizeof(m_keys)); memset(&m_syntheticKeys, 0, sizeof(m_syntheticKeys)); memset(&m_keyClientData, 0, sizeof(m_keyClientData)); memset(&m_serverKeys, 0, sizeof(m_serverKeys)); m_activeModifiers.clear(); // get the current keyboard state KeyButtonSet keysDown; pollPressedKeys(keysDown); for (KeyButtonSet::const_iterator i = keysDown.begin(); i != keysDown.end(); ++i) { m_keys[*i] = 1; } // get the current modifier state m_mask = pollActiveModifiers(); // set active modifiers CAddActiveModifierContext addModifierContext(pollActiveGroup(), m_mask, m_activeModifiers); m_keyMap.foreachKey(&CKeyState::addActiveModifierCB, &addModifierContext); LOG((CLOG_DEBUG1 "modifiers on update: 0x%04x", m_mask)); } void CKeyState::addActiveModifierCB(KeyID, SInt32 group, CKeyMap::KeyItem& keyItem, void* vcontext) { CAddActiveModifierContext* context = reinterpret_cast(vcontext); if (group == context->m_activeGroup && (keyItem.m_generates & context->m_mask) != 0) { context->m_activeModifiers.insert(std::make_pair( keyItem.m_generates, keyItem)); } } void CKeyState::setHalfDuplexMask(KeyModifierMask mask) { m_keyMap.clearHalfDuplexModifiers(); if ((mask & KeyModifierCapsLock) != 0) { m_keyMap.addHalfDuplexModifier(kKeyCapsLock); } if ((mask & KeyModifierNumLock) != 0) { m_keyMap.addHalfDuplexModifier(kKeyNumLock); } if ((mask & KeyModifierScrollLock) != 0) { m_keyMap.addHalfDuplexModifier(kKeyScrollLock); } } void CKeyState::fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton serverID) { // if this server key is already down then this is probably a // mis-reported autorepeat. serverID &= kButtonMask; if (m_serverKeys[serverID] != 0) { fakeKeyRepeat(id, mask, 1, serverID); return; } // ignore certain keys if (isIgnoredKey(id, mask)) { LOG((CLOG_DEBUG1 "ignored key %04x %04x", id, mask)); return; } // get keys for key press Keystrokes keys; ModifierToKeys oldActiveModifiers = m_activeModifiers; const CKeyMap::KeyItem* keyItem = m_keyMap.mapKey(keys, id, pollActiveGroup(), m_activeModifiers, getActiveModifiersRValue(), mask, false); if (keyItem == NULL) { return; } KeyButton localID = (KeyButton)(keyItem->m_button & kButtonMask); updateModifierKeyState(localID, oldActiveModifiers, m_activeModifiers); if (localID != 0) { // note keys down ++m_keys[localID]; ++m_syntheticKeys[localID]; m_keyClientData[localID] = keyItem->m_client; m_serverKeys[serverID] = localID; } // generate key events fakeKeys(keys, 1); } bool CKeyState::fakeKeyRepeat( KeyID id, KeyModifierMask mask, SInt32 count, KeyButton serverID) { serverID &= kButtonMask; // if we haven't seen this button go down then ignore it KeyButton oldLocalID = m_serverKeys[serverID]; if (oldLocalID == 0) { return false; } // get keys for key repeat Keystrokes keys; ModifierToKeys oldActiveModifiers = m_activeModifiers; const CKeyMap::KeyItem* keyItem = m_keyMap.mapKey(keys, id, pollActiveGroup(), m_activeModifiers, getActiveModifiersRValue(), mask, true); if (keyItem == NULL) { return false; } KeyButton localID = (KeyButton)(keyItem->m_button & kButtonMask); if (localID == 0) { return false; } // if the KeyButton for the auto-repeat is not the same as for the // initial press then mark the initial key as released and the new // key as pressed. this can happen when we auto-repeat after a // dead key. for example, a dead accent followed by 'a' will // generate an 'a with accent' followed by a repeating 'a'. the // KeyButtons for the two KeyIDs might be different. if (localID != oldLocalID) { // replace key up with previous KeyButton but leave key down // alone so it uses the new KeyButton. for (Keystrokes::iterator index = keys.begin(); index != keys.end(); ++index) { if (index->m_type == Keystroke::kButton && index->m_data.m_button.m_button == localID) { index->m_data.m_button.m_button = oldLocalID; break; } } // note that old key is now up --m_keys[oldLocalID]; --m_syntheticKeys[oldLocalID]; // note keys down updateModifierKeyState(localID, oldActiveModifiers, m_activeModifiers); ++m_keys[localID]; ++m_syntheticKeys[localID]; m_keyClientData[localID] = keyItem->m_client; m_serverKeys[serverID] = localID; } // generate key events fakeKeys(keys, count); return true; } bool CKeyState::fakeKeyUp(KeyButton serverID) { // if we haven't seen this button go down then ignore it KeyButton localID = m_serverKeys[serverID & kButtonMask]; if (localID == 0) { return false; } // get the sequence of keys to simulate key release Keystrokes keys; keys.push_back(Keystroke(localID, false, false, m_keyClientData[localID])); // note keys down --m_keys[localID]; --m_syntheticKeys[localID]; m_serverKeys[serverID] = 0; // check if this is a modifier ModifierToKeys::iterator i = m_activeModifiers.begin(); while (i != m_activeModifiers.end()) { if (i->second.m_button == localID && !i->second.m_lock) { // modifier is no longer down KeyModifierMask mask = i->first; ModifierToKeys::iterator tmp = i; ++i; m_activeModifiers.erase(tmp); if (m_activeModifiers.count(mask) == 0) { // no key for modifier is down so deactivate modifier m_mask &= ~mask; LOG((CLOG_DEBUG1 "new state %04x", m_mask)); } } else { ++i; } } // generate key events fakeKeys(keys, 1); return true; } void CKeyState::fakeAllKeysUp() { Keystrokes keys; for (KeyButton i = 0; i < IKeyState::kNumButtons; ++i) { if (m_syntheticKeys[i] > 0) { keys.push_back(Keystroke(i, false, false, m_keyClientData[i])); m_keys[i] = 0; m_syntheticKeys[i] = 0; } } fakeKeys(keys, 1); memset(&m_serverKeys, 0, sizeof(m_serverKeys)); m_activeModifiers.clear(); m_mask = pollActiveModifiers(); } bool CKeyState::isKeyDown(KeyButton button) const { return (m_keys[button & kButtonMask] > 0); } KeyModifierMask CKeyState::getActiveModifiers() const { return m_mask; } KeyModifierMask& CKeyState::getActiveModifiersRValue() { return m_mask; } SInt32 CKeyState::getEffectiveGroup(SInt32 group, SInt32 offset) const { return m_keyMap.getEffectiveGroup(group, offset); } bool CKeyState::isIgnoredKey(KeyID key, KeyModifierMask) const { switch (key) { case kKeyCapsLock: case kKeyNumLock: case kKeyScrollLock: return true; default: return false; } } KeyButton CKeyState::getButton(KeyID id, SInt32 group) const { const CKeyMap::KeyItemList* items = m_keyMap.findCompatibleKey(id, group, 0, 0); if (items == NULL) { return 0; } else { return items->back().m_button; } } void CKeyState::addAliasEntries() { for (SInt32 g = 0, n = m_keyMap.getNumGroups(); g < n; ++g) { // if we can't shift any kKeyTab key in a particular group but we can // shift kKeyLeftTab then add a shifted kKeyTab entry that matches a // shifted kKeyLeftTab entry. m_keyMap.addKeyAliasEntry(kKeyTab, g, KeyModifierShift, KeyModifierShift, kKeyLeftTab, KeyModifierShift, KeyModifierShift); // if we have no kKeyLeftTab but we do have a kKeyTab that can be // shifted then add kKeyLeftTab that matches a kKeyTab. m_keyMap.addKeyAliasEntry(kKeyLeftTab, g, KeyModifierShift, KeyModifierShift, kKeyTab, 0, KeyModifierShift); // map non-breaking space to space m_keyMap.addKeyAliasEntry(0x20, g, 0, 0, 0xa0, 0, 0); } } void CKeyState::addKeypadEntries() { // map every numpad key to its equivalent non-numpad key if it's not // on the keyboard. for (SInt32 g = 0, n = m_keyMap.getNumGroups(); g < n; ++g) { for (size_t i = 0; i < sizeof(s_numpadTable) / sizeof(s_numpadTable[0]); i += 2) { m_keyMap.addKeyCombinationEntry(s_numpadTable[i], g, s_numpadTable + i + 1, 1); } } } void CKeyState::addCombinationEntries() { for (SInt32 g = 0, n = m_keyMap.getNumGroups(); g < n; ++g) { // add dead and compose key composition sequences for (const KeyID* i = s_decomposeTable; *i != 0; ++i) { // count the decomposed keys for this key UInt32 numKeys = 0; for (const KeyID* j = i; *++j != 0; ) { ++numKeys; } // add an entry for this key m_keyMap.addKeyCombinationEntry(*i, g, i + 1, numKeys); // next key i += numKeys + 1; } } } void CKeyState::fakeKeys(const Keystrokes& keys, UInt32 count) { // do nothing if no keys or no repeats if (count == 0 || keys.empty()) { return; } // generate key events LOG((CLOG_DEBUG1 "keystrokes:")); for (Keystrokes::const_iterator k = keys.begin(); k != keys.end(); ) { if (k->m_type == Keystroke::kButton && k->m_data.m_button.m_repeat) { // repeat from here up to but not including the next key // with m_repeat == false count times. Keystrokes::const_iterator start = k; while (count-- > 0) { // send repeating events for (k = start; k != keys.end() && k->m_type == Keystroke::kButton && k->m_data.m_button.m_repeat; ++k) { fakeKey(*k); } } // note -- k is now on the first non-repeat key after the // repeat keys, exactly where we'd like to continue from. } else { // send event fakeKey(*k); // next key ++k; } } } void CKeyState::updateModifierKeyState(KeyButton button, const ModifierToKeys& oldModifiers, const ModifierToKeys& newModifiers) { // get the pressed modifier buttons before and after CKeyMap::ButtonToKeyMap oldKeys, newKeys; for (ModifierToKeys::const_iterator i = oldModifiers.begin(); i != oldModifiers.end(); ++i) { oldKeys.insert(std::make_pair(i->second.m_button, &i->second)); } for (ModifierToKeys::const_iterator i = newModifiers.begin(); i != newModifiers.end(); ++i) { newKeys.insert(std::make_pair(i->second.m_button, &i->second)); } // get the modifier buttons that were pressed or released CKeyMap::ButtonToKeyMap pressed, released; std::set_difference(oldKeys.begin(), oldKeys.end(), newKeys.begin(), newKeys.end(), std::inserter(released, released.end()), ButtonToKeyLess()); std::set_difference(newKeys.begin(), newKeys.end(), oldKeys.begin(), oldKeys.end(), std::inserter(pressed, pressed.end()), ButtonToKeyLess()); // update state for (CKeyMap::ButtonToKeyMap::const_iterator i = released.begin(); i != released.end(); ++i) { if (i->first != button) { m_keys[i->first] = 0; m_syntheticKeys[i->first] = 0; } } for (CKeyMap::ButtonToKeyMap::const_iterator i = pressed.begin(); i != pressed.end(); ++i) { if (i->first != button) { m_keys[i->first] = 1; m_syntheticKeys[i->first] = 1; m_keyClientData[i->first] = i->second->m_client; } } } // // CKeyState::CAddActiveModifierContext // CKeyState::CAddActiveModifierContext::CAddActiveModifierContext( SInt32 group, KeyModifierMask mask, ModifierToKeys& activeModifiers) : m_activeGroup(group), m_mask(mask), m_activeModifiers(activeModifiers) { // do nothing } synergy-1.4.12-Source/src/lib/synergy/CKeyState.h0000600000175000017500000001465612021261364021562 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CKEYSTATE_H #define CKEYSTATE_H #include "IKeyState.h" #include "CKeyMap.h" //! Core key state /*! This class provides key state services. Subclasses must implement a few platform specific methods. */ class CKeyState : public IKeyState { public: CKeyState(); CKeyState(IEventQueue& eventQueue, CKeyMap& keyMap); virtual ~CKeyState(); //! @name manipulators //@{ //! Handle key event /*! Sets the state of \p button to down or up and updates the current modifier state to \p newState. This method should be called by primary screens only in response to local events. For auto-repeat set \p down to \c true. Overrides must forward to the superclass. */ virtual void onKey(KeyButton button, bool down, KeyModifierMask newState); //! Post a key event /*! Posts a key event. This may adjust the event or post additional events in some circumstances. If this is overridden it must forward to the superclass. */ virtual void sendKeyEvent(void* target, bool press, bool isAutoRepeat, KeyID key, KeyModifierMask mask, SInt32 count, KeyButton button); //@} //! @name accessors //@{ //@} // IKeyState overrides virtual void updateKeyMap(); virtual void updateKeyState(); virtual void setHalfDuplexMask(KeyModifierMask); virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button); virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button); virtual bool fakeKeyUp(KeyButton button); virtual void fakeAllKeysUp(); virtual bool fakeCtrlAltDel() = 0; virtual bool isKeyDown(KeyButton) const; virtual KeyModifierMask getActiveModifiers() const; virtual KeyModifierMask pollActiveModifiers() const = 0; virtual SInt32 pollActiveGroup() const = 0; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const = 0; SInt32 getKeyState(KeyButton keyButton) { return m_keys[keyButton]; } protected: typedef CKeyMap::Keystroke Keystroke; //! @name protected manipulators //@{ //! Get the keyboard map /*! Fills \p keyMap with the current keyboard map. */ virtual void getKeyMap(CKeyMap& keyMap) = 0; //! Fake a key event /*! Synthesize an event for \p keystroke. */ virtual void fakeKey(const Keystroke& keystroke) = 0; //! Get the active modifiers /*! Returns the modifiers that are currently active according to our shadowed state. The state may be modified. */ virtual KeyModifierMask& getActiveModifiersRValue(); //@} //! @name protected accessors //@{ //! Compute a group number /*! Returns the number of the group \p offset groups after group \p group. */ SInt32 getEffectiveGroup(SInt32 group, SInt32 offset) const; //! Check if key is ignored /*! Returns \c true if and only if the key should always be ignored. The default returns \c true only for the toggle keys. */ virtual bool isIgnoredKey(KeyID key, KeyModifierMask mask) const; //! Get button for a KeyID /*! Return the button mapped to key \p id in group \p group if any, otherwise returns 0. */ KeyButton getButton(KeyID id, SInt32 group) const; //@} private: typedef CKeyMap::Keystrokes Keystrokes; typedef CKeyMap::ModifierToKeys ModifierToKeys; public: struct CAddActiveModifierContext { public: CAddActiveModifierContext(SInt32 group, KeyModifierMask mask, ModifierToKeys& activeModifiers); public: SInt32 m_activeGroup; KeyModifierMask m_mask; ModifierToKeys& m_activeModifiers; private: // not implemented CAddActiveModifierContext(const CAddActiveModifierContext&); CAddActiveModifierContext& operator=(const CAddActiveModifierContext&); }; private: class ButtonToKeyLess { public: bool operator()(const CKeyMap::ButtonToKeyMap::value_type& a, const CKeyMap::ButtonToKeyMap::value_type b) const { return (a.first < b.first); } }; // not implemented CKeyState(const CKeyState&); CKeyState& operator=(const CKeyState&); // called by all ctors. void init(); // adds alias key sequences. these are sequences that are equivalent // to other sequences. void addAliasEntries(); // adds non-keypad key sequences for keypad KeyIDs void addKeypadEntries(); // adds key sequences for combination KeyIDs (those built using // dead keys) void addCombinationEntries(); // synthesize key events. synthesize auto-repeat events count times. void fakeKeys(const Keystrokes&, UInt32 count); // update key state to match changes to modifiers void updateModifierKeyState(KeyButton button, const ModifierToKeys& oldModifiers, const ModifierToKeys& newModifiers); // active modifiers collection callback static void addActiveModifierCB(KeyID id, SInt32 group, CKeyMap::KeyItem& keyItem, void* vcontext); private: // must be declared before m_keyMap. used when this class owns the key map. CKeyMap* m_keyMapPtr; // the keyboard map CKeyMap& m_keyMap; // current modifier state KeyModifierMask m_mask; // the active modifiers and the buttons activating them ModifierToKeys m_activeModifiers; // current keyboard state (> 0 if pressed, 0 otherwise). this is // initialized to the keyboard state according to the system then // it tracks synthesized events. SInt32 m_keys[kNumButtons]; // synthetic keyboard state (> 0 if pressed, 0 otherwise). this // tracks the synthesized keyboard state. if m_keys[n] > 0 but // m_syntheticKeys[n] == 0 then the key was pressed locally and // not synthesized yet. SInt32 m_syntheticKeys[kNumButtons]; // client data for each pressed key UInt32 m_keyClientData[kNumButtons]; // server keyboard state. an entry is 0 if not the key isn't pressed // otherwise it's the local KeyButton synthesized for the server key. KeyButton m_serverKeys[kNumButtons]; }; #endif synergy-1.4.12-Source/src/lib/synergy/ClipboardTypes.h0000600000175000017500000000274712021261364022650 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CLIPBOARDTYPES_H #define CLIPBOARDTYPES_H #include "BasicTypes.h" //! Clipboard ID /*! Type to hold a clipboard identifier. */ typedef UInt8 ClipboardID; //! @name Clipboard identifiers //@{ // clipboard identifiers. kClipboardClipboard is what is normally // considered the clipboard (e.g. the cut/copy/paste menu items // affect it). kClipboardSelection is the selection on those // platforms that can treat the selection as a clipboard (e.g. X // windows). clipboard identifiers must be sequential starting // at zero. static const ClipboardID kClipboardClipboard = 0; static const ClipboardID kClipboardSelection = 1; // the number of clipboards (i.e. one greater than the last clipboard id) static const ClipboardID kClipboardEnd = 2; //@} #endif synergy-1.4.12-Source/src/lib/synergy/CMakeLists.txt0000600000175000017500000000470412131107263022305 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc CClientTaskBarReceiver.h CServerTaskBarReceiver.h CPortableTaskBarReceiver.h CApp.h CClientApp.h CServerApp.h CClipboard.h CKeyMap.h CKeyState.h CPacketStreamFilter.h CPlatformScreen.h CProtocolUtil.h CScreen.h ClipboardTypes.h IClient.h IClipboard.h IKeyState.h IPlatformScreen.h IPrimaryScreen.h IScreen.h IScreenSaver.h ISecondaryScreen.h KeyTypes.h MouseTypes.h OptionTypes.h ProtocolTypes.h XScreen.h XSynergy.h GameDeviceTypes.h CDaemonApp.h CAppUtil.h CArgsBase.h IAppUtil.h CEventGameDevice.h CVncClient.h CCryptoStream.h CCryptoMode.h ECryptoMode.h CCryptoOptions.h ) set(src CClientTaskBarReceiver.cpp CServerTaskBarReceiver.cpp CPortableTaskBarReceiver.cpp CApp.cpp CClientApp.cpp CServerApp.cpp CClipboard.cpp CKeyMap.cpp CKeyState.cpp CPacketStreamFilter.cpp CPlatformScreen.cpp CProtocolUtil.cpp CScreen.cpp IClipboard.cpp IKeyState.cpp IPrimaryScreen.cpp IScreen.cpp KeyTypes.cpp ProtocolTypes.cpp XScreen.cpp XSynergy.cpp ISecondaryScreen.cpp CDaemonApp.cpp CAppUtil.cpp CArgsBase.cpp CEventGameDevice.cpp CVncClient.cpp CGameDevice.cpp CCryptoStream.cpp CCryptoMode.cpp CCryptoOptions.cpp ) if (WIN32) list(APPEND inc CAppUtilWindows.h CGameDevice.h ) list(APPEND src ${inc} CAppUtilWindows.cpp ) elseif(UNIX) list(APPEND src CAppUtilUnix.cpp ) endif() set(inc ../arch ../base ../client ../common ../io ../ipc ../mt ../net ../platform ../server ../synergy ../.. ../../../tools ) if (UNIX) list(APPEND inc ../../.. ) elseif (WIN32) list(APPEND inc ../../vnc/win ) endif() include_directories(${inc}) add_library(synergy STATIC ${src}) if (UNIX) target_link_libraries(synergy arch client ipc net base platform mt server cryptopp) endif() synergy-1.4.12-Source/src/lib/synergy/CPacketStreamFilter.cpp0000600000175000017500000001023712131062123024076 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CPacketStreamFilter.h" #include "IEventQueue.h" #include "CLock.h" #include "TMethodEventJob.h" #include #include // // CPacketStreamFilter // CPacketStreamFilter::CPacketStreamFilter(synergy::IStream* stream, bool adoptStream) : CStreamFilter(EVENTQUEUE, stream, adoptStream), m_size(0), m_inputShutdown(false) { // do nothing } CPacketStreamFilter::~CPacketStreamFilter() { // do nothing } void CPacketStreamFilter::close() { CLock lock(&m_mutex); m_size = 0; m_buffer.pop(m_buffer.getSize()); CStreamFilter::close(); } UInt32 CPacketStreamFilter::read(void* buffer, UInt32 n) { if (n == 0) { return 0; } CLock lock(&m_mutex); // if not enough data yet then give up if (!isReadyNoLock()) { return 0; } // read no more than what's left in the buffered packet if (n > m_size) { n = m_size; } // read it if (buffer != NULL) { memcpy(buffer, m_buffer.peek(n), n); } m_buffer.pop(n); m_size -= n; // get next packet's size if we've finished with this packet and // there's enough data to do so. readPacketSize(); if (m_inputShutdown && m_size == 0) { EVENTQUEUE->addEvent(CEvent(getInputShutdownEvent(), getEventTarget(), NULL)); } return n; } void CPacketStreamFilter::write(const void* buffer, UInt32 count) { // write the length of the payload UInt8 length[4]; length[0] = (UInt8)((count >> 24) & 0xff); length[1] = (UInt8)((count >> 16) & 0xff); length[2] = (UInt8)((count >> 8) & 0xff); length[3] = (UInt8)( count & 0xff); getStream()->write(length, sizeof(length)); // write the payload getStream()->write(buffer, count); } void CPacketStreamFilter::shutdownInput() { CLock lock(&m_mutex); m_size = 0; m_buffer.pop(m_buffer.getSize()); CStreamFilter::shutdownInput(); } bool CPacketStreamFilter::isReady() const { CLock lock(&m_mutex); return isReadyNoLock(); } UInt32 CPacketStreamFilter::getSize() const { CLock lock(&m_mutex); return isReadyNoLock() ? m_size : 0; } bool CPacketStreamFilter::isReadyNoLock() const { return (m_size != 0 && m_buffer.getSize() >= m_size); } void CPacketStreamFilter::readPacketSize() { // note -- m_mutex must be locked on entry if (m_size == 0 && m_buffer.getSize() >= 4) { UInt8 buffer[4]; memcpy(buffer, m_buffer.peek(sizeof(buffer)), sizeof(buffer)); m_buffer.pop(sizeof(buffer)); m_size = ((UInt32)buffer[0] << 24) | ((UInt32)buffer[1] << 16) | ((UInt32)buffer[2] << 8) | (UInt32)buffer[3]; } } bool CPacketStreamFilter::readMore() { // note if we have whole packet bool wasReady = isReadyNoLock(); // read more data char buffer[4096]; UInt32 n = getStream()->read(buffer, sizeof(buffer)); while (n > 0) { m_buffer.write(buffer, n); n = getStream()->read(buffer, sizeof(buffer)); } // if we don't yet have the next packet size then get it, // if possible. readPacketSize(); // note if we now have a whole packet bool isReady = isReadyNoLock(); // if we weren't ready before but now we are then send a // input ready event apparently from the filtered stream. return (wasReady != isReady); } void CPacketStreamFilter::filterEvent(const CEvent& event) { if (event.getType() == getInputReadyEvent()) { CLock lock(&m_mutex); if (!readMore()) { return; } } else if (event.getType() == getInputShutdownEvent()) { // discard this if we have buffered data CLock lock(&m_mutex); m_inputShutdown = true; if (m_size != 0) { return; } } // pass event CStreamFilter::filterEvent(event); } synergy-1.4.12-Source/src/lib/synergy/CPacketStreamFilter.h0000600000175000017500000000314712021261364023553 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CPACKETSTREAMFILTER_H #define CPACKETSTREAMFILTER_H #include "CStreamFilter.h" #include "CStreamBuffer.h" #include "CMutex.h" //! Packetizing stream filter /*! Filters a stream to read and write packets. */ class CPacketStreamFilter : public CStreamFilter { public: CPacketStreamFilter(synergy::IStream* stream, bool adoptStream = true); ~CPacketStreamFilter(); // IStream overrides virtual void close(); virtual UInt32 read(void* buffer, UInt32 n); virtual void write(const void* buffer, UInt32 n); virtual void shutdownInput(); virtual bool isReady() const; virtual UInt32 getSize() const; protected: // CStreamFilter overrides virtual void filterEvent(const CEvent&); private: bool isReadyNoLock() const; void readPacketSize(); bool readMore(); private: CMutex m_mutex; UInt32 m_size; CStreamBuffer m_buffer; bool m_inputShutdown; }; #endif synergy-1.4.12-Source/src/lib/synergy/CPlatformScreen.cpp0000600000175000017500000000446712021261364023307 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CPlatformScreen.h" CPlatformScreen::CPlatformScreen() { // do nothing } CPlatformScreen::CPlatformScreen(IEventQueue& eventQueue) : IPlatformScreen(eventQueue) { } CPlatformScreen::~CPlatformScreen() { // do nothing } void CPlatformScreen::updateKeyMap() { getKeyState()->updateKeyMap(); } void CPlatformScreen::updateKeyState() { getKeyState()->updateKeyState(); updateButtons(); } void CPlatformScreen::setHalfDuplexMask(KeyModifierMask mask) { getKeyState()->setHalfDuplexMask(mask); } void CPlatformScreen::fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button) { getKeyState()->fakeKeyDown(id, mask, button); } bool CPlatformScreen::fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { return getKeyState()->fakeKeyRepeat(id, mask, count, button); } bool CPlatformScreen::fakeKeyUp(KeyButton button) { return getKeyState()->fakeKeyUp(button); } void CPlatformScreen::fakeAllKeysUp() { getKeyState()->fakeAllKeysUp(); } bool CPlatformScreen::fakeCtrlAltDel() { return getKeyState()->fakeCtrlAltDel(); } bool CPlatformScreen::isKeyDown(KeyButton button) const { return getKeyState()->isKeyDown(button); } KeyModifierMask CPlatformScreen::getActiveModifiers() const { return getKeyState()->getActiveModifiers(); } KeyModifierMask CPlatformScreen::pollActiveModifiers() const { return getKeyState()->pollActiveModifiers(); } SInt32 CPlatformScreen::pollActiveGroup() const { return getKeyState()->pollActiveGroup(); } void CPlatformScreen::pollPressedKeys(KeyButtonSet& pressedKeys) const { getKeyState()->pollPressedKeys(pressedKeys); } synergy-1.4.12-Source/src/lib/synergy/CPlatformScreen.h0000600000175000017500000001047212021261364022745 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CPLATFORMSCREEN_H #define CPLATFORMSCREEN_H #include "IPlatformScreen.h" //! Base screen implementation /*! This screen implementation is the superclass of all other screen implementations. It implements a handful of methods and requires subclasses to implement the rest. */ class CPlatformScreen : public IPlatformScreen { public: CPlatformScreen(); CPlatformScreen(IEventQueue& eventQueue); virtual ~CPlatformScreen(); // IScreen overrides virtual void* getEventTarget() const = 0; virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; // IPrimaryScreen overrides virtual void reconfigure(UInt32 activeSides) = 0; virtual void warpCursor(SInt32 x, SInt32 y) = 0; virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask) = 0; virtual void unregisterHotKey(UInt32 id) = 0; virtual void fakeInputBegin() = 0; virtual void fakeInputEnd() = 0; virtual SInt32 getJumpZoneSize() const = 0; virtual bool isAnyMouseButtonDown() const = 0; virtual void getCursorCenter(SInt32& x, SInt32& y) const = 0; virtual void gameDeviceTimingResp(UInt16 freq) = 0; // ISecondaryScreen overrides virtual void fakeMouseButton(ButtonID id, bool press) = 0; virtual void fakeMouseMove(SInt32 x, SInt32 y) const = 0; virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const = 0; virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const = 0; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const = 0; virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const = 0; virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const = 0; virtual void queueGameDeviceTimingReq() const = 0; // IKeyState overrides virtual void updateKeyMap(); virtual void updateKeyState(); virtual void setHalfDuplexMask(KeyModifierMask); virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button); virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button); virtual bool fakeKeyUp(KeyButton button); virtual void fakeAllKeysUp(); virtual bool fakeCtrlAltDel(); virtual bool isKeyDown(KeyButton) const; virtual KeyModifierMask getActiveModifiers() const; virtual KeyModifierMask pollActiveModifiers() const; virtual SInt32 pollActiveGroup() const; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const; // IPlatformScreen overrides virtual void enable() = 0; virtual void disable() = 0; virtual void enter() = 0; virtual bool leave() = 0; virtual bool setClipboard(ClipboardID, const IClipboard*) = 0; virtual void checkClipboards() = 0; virtual void openScreensaver(bool notify) = 0; virtual void closeScreensaver() = 0; virtual void screensaver(bool activate) = 0; virtual void resetOptions() = 0; virtual void setOptions(const COptionsList& options) = 0; virtual void setSequenceNumber(UInt32) = 0; virtual bool isPrimary() const = 0; protected: //! Update mouse buttons /*! Subclasses must implement this method to update their internal mouse button mapping and, if desired, state tracking. */ virtual void updateButtons() = 0; //! Get the key state /*! Subclasses must implement this method to return the platform specific key state object that each subclass must have. */ virtual IKeyState* getKeyState() const = 0; // IPlatformScreen overrides virtual void handleSystemEvent(const CEvent& event, void*) = 0; }; #endif synergy-1.4.12-Source/src/lib/synergy/CPortableTaskBarReceiver.cpp0000600000175000017500000000516712120644363025072 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CPortableTaskBarReceiver.h" #include "CLock.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "CArch.h" #include "Version.h" // // CPortableTaskBarReceiver // CPortableTaskBarReceiver::CPortableTaskBarReceiver() : m_state(kNotRunning) { // do nothing } CPortableTaskBarReceiver::~CPortableTaskBarReceiver() { // do nothing } void CPortableTaskBarReceiver::updateStatus(INode* node, const CString& errorMsg) { { // update our status m_errorMessage = errorMsg; if (node == NULL) { if (m_errorMessage.empty()) { m_state = kNotRunning; } else { m_state = kNotWorking; } } else { m_state = kNotConnected; } // let subclasses have a go onStatusChanged(node); } // tell task bar ARCH->updateReceiver(this); } CPortableTaskBarReceiver::EState CPortableTaskBarReceiver::getStatus() const { return m_state; } const CString& CPortableTaskBarReceiver::getErrorMessage() const { return m_errorMessage; } void CPortableTaskBarReceiver::quit() { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CPortableTaskBarReceiver::onStatusChanged(INode*) { // do nothing } void CPortableTaskBarReceiver::lock() const { // do nothing } void CPortableTaskBarReceiver::unlock() const { // do nothing } std::string CPortableTaskBarReceiver::getToolTip() const { switch (m_state) { case kNotRunning: return CStringUtil::print("%s: Not running", kAppVersion); case kNotWorking: return CStringUtil::print("%s: %s", kAppVersion, m_errorMessage.c_str()); case kNotConnected: return CStringUtil::print("%s: Unknown", kAppVersion); default: return ""; } } CEvent::Type CPortableTaskBarReceiver::getReloadConfigEvent() { // do nothing return NULL; } CEvent::Type CPortableTaskBarReceiver::getForceReconnectEvent() { // do nothing return NULL; } CEvent::Type CPortableTaskBarReceiver::getResetServerEvent() { // do nothing return NULL; } synergy-1.4.12-Source/src/lib/synergy/CPortableTaskBarReceiver.h0000600000175000017500000000454012120644363024531 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CString.h" #include "IArchTaskBarReceiver.h" #include "stdvector.h" #include "CEvent.h" #include "INode.h" #include "LogOutputters.h" //! Implementation of IArchTaskBarReceiver for the synergy server class CPortableTaskBarReceiver : public IArchTaskBarReceiver { public: CPortableTaskBarReceiver(); virtual ~CPortableTaskBarReceiver(); //! @name manipulators //@{ //! Update status /*! Determine the status and query required information from the server. */ void updateStatus(INode*, const CString& errorMsg); //@} // IArchTaskBarReceiver overrides virtual void showStatus() = 0; virtual void runMenu(int x, int y) = 0; virtual void primaryAction() = 0; virtual void lock() const; virtual void unlock() const; virtual const Icon getIcon() const = 0; virtual std::string getToolTip() const; protected: typedef std::vector CClients; enum EState { kNotRunning, kNotWorking, kNotConnected, kConnected, kMaxState }; //! Get status EState getStatus() const; //! Get error message const CString& getErrorMessage() const; //! Quit app /*! Causes the application to quit gracefully */ void quit(); //! Status change notification /*! Called when status changes. The default implementation does nothing. */ virtual void onStatusChanged(INode* node); protected: CEvent::Type getReloadConfigEvent(); CEvent::Type getForceReconnectEvent(); CEvent::Type getResetServerEvent(); private: EState m_state; CString m_errorMessage; CString m_server; CClients m_clients; }; IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer); synergy-1.4.12-Source/src/lib/synergy/CProtocolUtil.cpp0000600000175000017500000003142312021261364023012 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CProtocolUtil.h" #include "IStream.h" #include "CLog.h" #include "stdvector.h" #include #include // // CProtocolUtil // void CProtocolUtil::writef(synergy::IStream* stream, const char* fmt, ...) { assert(stream != NULL); assert(fmt != NULL); LOG((CLOG_DEBUG2 "writef(%s)", fmt)); va_list args; va_start(args, fmt); UInt32 size = getLength(fmt, args); va_end(args); va_start(args, fmt); vwritef(stream, fmt, size, args); va_end(args); } bool CProtocolUtil::readf(synergy::IStream* stream, const char* fmt, ...) { assert(stream != NULL); assert(fmt != NULL); LOG((CLOG_DEBUG2 "readf(%s)", fmt)); bool result; va_list args; va_start(args, fmt); try { vreadf(stream, fmt, args); result = true; } catch (XIO&) { result = false; } va_end(args); return result; } void CProtocolUtil::vwritef(synergy::IStream* stream, const char* fmt, UInt32 size, va_list args) { assert(stream != NULL); assert(fmt != NULL); // done if nothing to write if (size == 0) { return; } // fill buffer UInt8* buffer = new UInt8[size]; writef(buffer, fmt, args); try { // write buffer stream->write(buffer, size); LOG((CLOG_DEBUG2 "wrote %d bytes", size)); delete[] buffer; } catch (XBase&) { delete[] buffer; throw; } } void CProtocolUtil::vreadf(synergy::IStream* stream, const char* fmt, va_list args) { assert(stream != NULL); assert(fmt != NULL); // begin scanning while (*fmt) { if (*fmt == '%') { // format specifier. determine argument size. ++fmt; UInt32 len = eatLength(&fmt); switch (*fmt) { case 'i': { // check for valid length assert(len == 1 || len == 2 || len == 4); // read the data UInt8 buffer[4]; read(stream, buffer, len); // convert it void* v = va_arg(args, void*); switch (len) { case 1: // 1 byte integer *reinterpret_cast(v) = buffer[0]; LOG((CLOG_DEBUG2 "readf: read %d byte integer: %d (0x%x)", len, *reinterpret_cast(v), *reinterpret_cast(v))); break; case 2: // 2 byte integer *reinterpret_cast(v) = static_cast( (static_cast(buffer[0]) << 8) | static_cast(buffer[1])); LOG((CLOG_DEBUG2 "readf: read %d byte integer: %d (0x%x)", len, *reinterpret_cast(v), *reinterpret_cast(v))); break; case 4: // 4 byte integer *reinterpret_cast(v) = (static_cast(buffer[0]) << 24) | (static_cast(buffer[1]) << 16) | (static_cast(buffer[2]) << 8) | static_cast(buffer[3]); LOG((CLOG_DEBUG2 "readf: read %d byte integer: %d (0x%x)", len, *reinterpret_cast(v), *reinterpret_cast(v))); break; } break; } case 'I': { // check for valid length assert(len == 1 || len == 2 || len == 4); // read the vector length UInt8 buffer[4]; read(stream, buffer, 4); UInt32 n = (static_cast(buffer[0]) << 24) | (static_cast(buffer[1]) << 16) | (static_cast(buffer[2]) << 8) | static_cast(buffer[3]); // convert it void* v = va_arg(args, void*); switch (len) { case 1: // 1 byte integer for (UInt32 i = 0; i < n; ++i) { read(stream, buffer, 1); reinterpret_cast*>(v)->push_back( buffer[0]); LOG((CLOG_DEBUG2 "readf: read %d byte integer[%d]: %d (0x%x)", len, i, reinterpret_cast*>(v)->back(), reinterpret_cast*>(v)->back())); } break; case 2: // 2 byte integer for (UInt32 i = 0; i < n; ++i) { read(stream, buffer, 2); reinterpret_cast*>(v)->push_back( static_cast( (static_cast(buffer[0]) << 8) | static_cast(buffer[1]))); LOG((CLOG_DEBUG2 "readf: read %d byte integer[%d]: %d (0x%x)", len, i, reinterpret_cast*>(v)->back(), reinterpret_cast*>(v)->back())); } break; case 4: // 4 byte integer for (UInt32 i = 0; i < n; ++i) { read(stream, buffer, 4); reinterpret_cast*>(v)->push_back( (static_cast(buffer[0]) << 24) | (static_cast(buffer[1]) << 16) | (static_cast(buffer[2]) << 8) | static_cast(buffer[3])); LOG((CLOG_DEBUG2 "readf: read %d byte integer[%d]: %d (0x%x)", len, i, reinterpret_cast*>(v)->back(), reinterpret_cast*>(v)->back())); } break; } break; } case 's': { assert(len == 0); // read the string length UInt8 buffer[128]; read(stream, buffer, 4); UInt32 len = (static_cast(buffer[0]) << 24) | (static_cast(buffer[1]) << 16) | (static_cast(buffer[2]) << 8) | static_cast(buffer[3]); // use a fixed size buffer if its big enough const bool useFixed = (len <= sizeof(buffer)); // allocate a buffer to read the data UInt8* sBuffer = buffer; if (!useFixed) { sBuffer = new UInt8[len]; } // read the data try { read(stream, sBuffer, len); } catch (...) { if (!useFixed) { delete[] sBuffer; } throw; } LOG((CLOG_DEBUG2 "readf: read %d byte string: %.*s", len, len, sBuffer)); // save the data CString* dst = va_arg(args, CString*); dst->assign((const char*)sBuffer, len); // release the buffer if (!useFixed) { delete[] sBuffer; } break; } case '%': assert(len == 0); break; default: assert(0 && "invalid format specifier"); } // next format character ++fmt; } else { // read next character char buffer[1]; read(stream, buffer, 1); // verify match if (buffer[0] != *fmt) { LOG((CLOG_DEBUG2 "readf: format mismatch: %c vs %c", *fmt, buffer[0])); throw XIOReadMismatch(); } // next format character ++fmt; } } } UInt32 CProtocolUtil::getLength(const char* fmt, va_list args) { UInt32 n = 0; while (*fmt) { if (*fmt == '%') { // format specifier. determine argument size. ++fmt; UInt32 len = eatLength(&fmt); switch (*fmt) { case 'i': assert(len == 1 || len == 2 || len == 4); (void)va_arg(args, UInt32); break; case 'I': assert(len == 1 || len == 2 || len == 4); switch (len) { case 1: len = (UInt32)(va_arg(args, std::vector*))->size() + 4; break; case 2: len = 2 * (UInt32)(va_arg(args, std::vector*))->size() + 4; break; case 4: len = 4 * (UInt32)(va_arg(args, std::vector*))->size() + 4; break; } break; case 's': assert(len == 0); len = (UInt32)(va_arg(args, CString*))->size() + 4; (void)va_arg(args, UInt8*); break; case 'S': assert(len == 0); len = va_arg(args, UInt32) + 4; (void)va_arg(args, UInt8*); break; case '%': assert(len == 0); len = 1; break; default: assert(0 && "invalid format specifier"); } // accumulate size n += len; ++fmt; } else { // regular character ++n; ++fmt; } } return n; } void CProtocolUtil::writef(void* buffer, const char* fmt, va_list args) { UInt8* dst = reinterpret_cast(buffer); while (*fmt) { if (*fmt == '%') { // format specifier. determine argument size. ++fmt; UInt32 len = eatLength(&fmt); switch (*fmt) { case 'i': { const UInt32 v = va_arg(args, UInt32); switch (len) { case 1: // 1 byte integer *dst++ = static_cast(v & 0xff); break; case 2: // 2 byte integer *dst++ = static_cast((v >> 8) & 0xff); *dst++ = static_cast( v & 0xff); break; case 4: // 4 byte integer *dst++ = static_cast((v >> 24) & 0xff); *dst++ = static_cast((v >> 16) & 0xff); *dst++ = static_cast((v >> 8) & 0xff); *dst++ = static_cast( v & 0xff); break; default: assert(0 && "invalid integer format length"); return; } break; } case 'I': { switch (len) { case 1: { // 1 byte integers const std::vector* list = va_arg(args, const std::vector*); const UInt32 n = (UInt32)list->size(); *dst++ = static_cast((n >> 24) & 0xff); *dst++ = static_cast((n >> 16) & 0xff); *dst++ = static_cast((n >> 8) & 0xff); *dst++ = static_cast( n & 0xff); for (UInt32 i = 0; i < n; ++i) { *dst++ = (*list)[i]; } break; } case 2: { // 2 byte integers const std::vector* list = va_arg(args, const std::vector*); const UInt32 n = (UInt32)list->size(); *dst++ = static_cast((n >> 24) & 0xff); *dst++ = static_cast((n >> 16) & 0xff); *dst++ = static_cast((n >> 8) & 0xff); *dst++ = static_cast( n & 0xff); for (UInt32 i = 0; i < n; ++i) { const UInt16 v = (*list)[i]; *dst++ = static_cast((v >> 8) & 0xff); *dst++ = static_cast( v & 0xff); } break; } case 4: { // 4 byte integers const std::vector* list = va_arg(args, const std::vector*); const UInt32 n = (UInt32)list->size(); *dst++ = static_cast((n >> 24) & 0xff); *dst++ = static_cast((n >> 16) & 0xff); *dst++ = static_cast((n >> 8) & 0xff); *dst++ = static_cast( n & 0xff); for (UInt32 i = 0; i < n; ++i) { const UInt32 v = (*list)[i]; *dst++ = static_cast((v >> 24) & 0xff); *dst++ = static_cast((v >> 16) & 0xff); *dst++ = static_cast((v >> 8) & 0xff); *dst++ = static_cast( v & 0xff); } break; } default: assert(0 && "invalid integer vector format length"); return; } break; } case 's': { assert(len == 0); const CString* src = va_arg(args, CString*); const UInt32 len = (src != NULL) ? (UInt32)src->size() : 0; *dst++ = static_cast((len >> 24) & 0xff); *dst++ = static_cast((len >> 16) & 0xff); *dst++ = static_cast((len >> 8) & 0xff); *dst++ = static_cast( len & 0xff); if (len != 0) { memcpy(dst, src->data(), len); dst += len; } break; } case 'S': { assert(len == 0); const UInt32 len = va_arg(args, UInt32); const UInt8* src = va_arg(args, UInt8*); *dst++ = static_cast((len >> 24) & 0xff); *dst++ = static_cast((len >> 16) & 0xff); *dst++ = static_cast((len >> 8) & 0xff); *dst++ = static_cast( len & 0xff); memcpy(dst, src, len); dst += len; break; } case '%': assert(len == 0); *dst++ = '%'; break; default: assert(0 && "invalid format specifier"); } // next format character ++fmt; } else { // copy regular character *dst++ = *fmt++; } } } UInt32 CProtocolUtil::eatLength(const char** pfmt) { const char* fmt = *pfmt; UInt32 n = 0; for (;;) { UInt32 d; switch (*fmt) { case '0': d = 0; break; case '1': d = 1; break; case '2': d = 2; break; case '3': d = 3; break; case '4': d = 4; break; case '5': d = 5; break; case '6': d = 6; break; case '7': d = 7; break; case '8': d = 8; break; case '9': d = 9; break; default: *pfmt = fmt; return n; } n = 10 * n + d; ++fmt; } } void CProtocolUtil::read(synergy::IStream* stream, void* vbuffer, UInt32 count) { assert(stream != NULL); assert(vbuffer != NULL); UInt8* buffer = reinterpret_cast(vbuffer); while (count > 0) { // read more UInt32 n = stream->read(buffer, count); // bail if stream has hungup if (n == 0) { LOG((CLOG_DEBUG2 "unexpected disconnect in readf(), %d bytes left", count)); throw XIOEndOfStream(); } // prepare for next read buffer += n; count -= n; } } // // XIOReadMismatch // CString XIOReadMismatch::getWhat() const throw() { return format("XIOReadMismatch", "CProtocolUtil::readf() mismatch"); } synergy-1.4.12-Source/src/lib/synergy/CProtocolUtil.h0000600000175000017500000000645012021261364022461 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CPROTOCOLUTIL_H #define CPROTOCOLUTIL_H #include "BasicTypes.h" #include "XIO.h" #include namespace synergy { class IStream; } //! Synergy protocol utilities /*! This class provides various functions for implementing the synergy protocol. */ class CProtocolUtil { public: //! Write formatted data /*! Write formatted binary data to a stream. \c fmt consists of regular characters and format specifiers. Format specifiers begin with \%. All characters not part of a format specifier are regular and are transmitted unchanged. Format specifiers are: - \%\% -- literal `\%' - \%1i -- converts integer argument to 1 byte integer - \%2i -- converts integer argument to 2 byte integer in NBO - \%4i -- converts integer argument to 4 byte integer in NBO - \%1I -- converts std::vector* to 1 byte integers - \%2I -- converts std::vector* to 2 byte integers in NBO - \%4I -- converts std::vector* to 4 byte integers in NBO - \%s -- converts CString* to stream of bytes - \%S -- converts integer N and const UInt8* to stream of N bytes */ static void writef(synergy::IStream*, const char* fmt, ...); //! Read formatted data /*! Read formatted binary data from a buffer. This performs the reverse operation of writef(). Returns true if the entire format was successfully parsed, false otherwise. Format specifiers are: - \%\% -- read (and discard) a literal `\%' - \%1i -- reads a 1 byte integer; argument is a SInt32* or UInt32* - \%2i -- reads an NBO 2 byte integer; arg is SInt32* or UInt32* - \%4i -- reads an NBO 4 byte integer; arg is SInt32* or UInt32* - \%1I -- reads 1 byte integers; arg is std::vector* - \%2I -- reads NBO 2 byte integers; arg is std::vector* - \%4I -- reads NBO 4 byte integers; arg is std::vector* - \%s -- reads bytes; argument must be a CString*, \b not a char* */ static bool readf(synergy::IStream*, const char* fmt, ...); private: static void vwritef(synergy::IStream*, const char* fmt, UInt32 size, va_list); static void vreadf(synergy::IStream*, const char* fmt, va_list); static UInt32 getLength(const char* fmt, va_list); static void writef(void*, const char* fmt, va_list); static UInt32 eatLength(const char** fmt); static void read(synergy::IStream*, void*, UInt32); }; //! Mismatched read exception /*! Thrown by CProtocolUtil::readf() when the data being read does not match the format. */ class XIOReadMismatch : public XIO { public: // XBase overrides virtual CString getWhat() const throw(); }; #endif synergy-1.4.12-Source/src/lib/synergy/CScreen.cpp0000600000175000017500000002344212021261364021574 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CScreen.h" #include "IPlatformScreen.h" #include "ProtocolTypes.h" #include "CLog.h" #include "IEventQueue.h" #include "CClientProxy.h" #include "TMethodEventJob.h" // // CScreen // CScreen::CScreen(IPlatformScreen* platformScreen) : m_screen(platformScreen), m_isPrimary(platformScreen->isPrimary()), m_enabled(false), m_entered(m_isPrimary), m_screenSaverSync(true), m_fakeInput(false) { assert(m_screen != NULL); // reset options resetOptions(); LOG((CLOG_DEBUG "opened display")); } CScreen::~CScreen() { if (m_enabled) { disable(); } assert(!m_enabled); assert(m_entered == m_isPrimary); delete m_screen; LOG((CLOG_DEBUG "closed display")); } void CScreen::enable() { assert(!m_enabled); m_screen->updateKeyMap(); m_screen->updateKeyState(); m_screen->enable(); if (m_isPrimary) { enablePrimary(); } else { enableSecondary(); } // note activation m_enabled = true; } void CScreen::disable() { assert(m_enabled); if (!m_isPrimary && m_entered) { leave(); } else if (m_isPrimary && !m_entered) { enter(0); } m_screen->disable(); if (m_isPrimary) { disablePrimary(); } else { disableSecondary(); } // note deactivation m_enabled = false; } void CScreen::enter(KeyModifierMask toggleMask) { assert(m_entered == false); LOG((CLOG_INFO "entering screen")); // now on screen m_entered = true; m_screen->enter(); if (m_isPrimary) { enterPrimary(); } else { enterSecondary(toggleMask); } } bool CScreen::leave() { assert(m_entered == true); LOG((CLOG_INFO "leaving screen")); if (!m_screen->leave()) { return false; } if (m_isPrimary) { leavePrimary(); } else { leaveSecondary(); } // make sure our idea of clipboard ownership is correct m_screen->checkClipboards(); // now not on screen m_entered = false; return true; } void CScreen::reconfigure(UInt32 activeSides) { assert(m_isPrimary); m_screen->reconfigure(activeSides); } void CScreen::warpCursor(SInt32 x, SInt32 y) { assert(m_isPrimary); m_screen->warpCursor(x, y); } void CScreen::setClipboard(ClipboardID id, const IClipboard* clipboard) { m_screen->setClipboard(id, clipboard); } void CScreen::grabClipboard(ClipboardID id) { m_screen->setClipboard(id, NULL); } void CScreen::screensaver(bool activate) { if (!m_isPrimary) { // activate/deactivation screen saver iff synchronization enabled if (m_screenSaverSync) { m_screen->screensaver(activate); } } } void CScreen::keyDown(KeyID id, KeyModifierMask mask, KeyButton button) { assert(!m_isPrimary || m_fakeInput); // check for ctrl+alt+del emulation if (id == kKeyDelete && (mask & (KeyModifierControl | KeyModifierAlt)) == (KeyModifierControl | KeyModifierAlt)) { LOG((CLOG_DEBUG "emulating ctrl+alt+del press")); if (m_screen->fakeCtrlAltDel()) { return; } } m_screen->fakeKeyDown(id, mask, button); } void CScreen::keyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) { assert(!m_isPrimary); m_screen->fakeKeyRepeat(id, mask, count, button); } void CScreen::keyUp(KeyID, KeyModifierMask, KeyButton button) { assert(!m_isPrimary || m_fakeInput); m_screen->fakeKeyUp(button); } void CScreen::mouseDown(ButtonID button) { assert(!m_isPrimary); m_screen->fakeMouseButton(button, true); } void CScreen::mouseUp(ButtonID button) { assert(!m_isPrimary); m_screen->fakeMouseButton(button, false); } void CScreen::mouseMove(SInt32 x, SInt32 y) { assert(!m_isPrimary); m_screen->fakeMouseMove(x, y); } void CScreen::mouseRelativeMove(SInt32 dx, SInt32 dy) { assert(!m_isPrimary); m_screen->fakeMouseRelativeMove(dx, dy); } void CScreen::mouseWheel(SInt32 xDelta, SInt32 yDelta) { assert(!m_isPrimary); m_screen->fakeMouseWheel(xDelta, yDelta); } void CScreen::gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) { assert(!m_isPrimary); m_screen->fakeGameDeviceButtons(id, buttons); } void CScreen::gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) { assert(!m_isPrimary); m_screen->fakeGameDeviceSticks(id, x1, y1, x2, y2); } void CScreen::gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) { assert(!m_isPrimary); m_screen->fakeGameDeviceTriggers(id, t1, t2); } void CScreen::gameDeviceTimingReq() { assert(!m_isPrimary); m_screen->queueGameDeviceTimingReq(); } void CScreen::resetOptions() { // reset options m_halfDuplex = 0; // if screen saver synchronization was off then turn it on since // that's the default option state. if (!m_screenSaverSync) { m_screenSaverSync = true; if (!m_isPrimary) { m_screen->openScreensaver(false); } } // let screen handle its own options m_screen->resetOptions(); } void CScreen::setOptions(const COptionsList& options) { // update options bool oldScreenSaverSync = m_screenSaverSync; for (UInt32 i = 0, n = (UInt32)options.size(); i < n; i += 2) { if (options[i] == kOptionScreenSaverSync) { m_screenSaverSync = (options[i + 1] != 0); LOG((CLOG_DEBUG1 "screen saver synchronization %s", m_screenSaverSync ? "on" : "off")); } else if (options[i] == kOptionHalfDuplexCapsLock) { if (options[i + 1] != 0) { m_halfDuplex |= KeyModifierCapsLock; } else { m_halfDuplex &= ~KeyModifierCapsLock; } LOG((CLOG_DEBUG1 "half-duplex caps-lock %s", ((m_halfDuplex & KeyModifierCapsLock) != 0) ? "on" : "off")); } else if (options[i] == kOptionHalfDuplexNumLock) { if (options[i + 1] != 0) { m_halfDuplex |= KeyModifierNumLock; } else { m_halfDuplex &= ~KeyModifierNumLock; } LOG((CLOG_DEBUG1 "half-duplex num-lock %s", ((m_halfDuplex & KeyModifierNumLock) != 0) ? "on" : "off")); } else if (options[i] == kOptionHalfDuplexScrollLock) { if (options[i + 1] != 0) { m_halfDuplex |= KeyModifierScrollLock; } else { m_halfDuplex &= ~KeyModifierScrollLock; } LOG((CLOG_DEBUG1 "half-duplex scroll-lock %s", ((m_halfDuplex & KeyModifierScrollLock) != 0) ? "on" : "off")); } } // update half-duplex options m_screen->setHalfDuplexMask(m_halfDuplex); // update screen saver synchronization if (!m_isPrimary && oldScreenSaverSync != m_screenSaverSync) { if (m_screenSaverSync) { m_screen->openScreensaver(false); } else { m_screen->closeScreensaver(); } } // let screen handle its own options m_screen->setOptions(options); } void CScreen::setSequenceNumber(UInt32 seqNum) { m_screen->setSequenceNumber(seqNum); } UInt32 CScreen::registerHotKey(KeyID key, KeyModifierMask mask) { return m_screen->registerHotKey(key, mask); } void CScreen::unregisterHotKey(UInt32 id) { m_screen->unregisterHotKey(id); } void CScreen::fakeInputBegin() { assert(!m_fakeInput); m_fakeInput = true; m_screen->fakeInputBegin(); } void CScreen::fakeInputEnd() { assert(m_fakeInput); m_fakeInput = false; m_screen->fakeInputEnd(); } bool CScreen::isOnScreen() const { return m_entered; } bool CScreen::isLockedToScreen() const { // check for pressed mouse buttons if (m_screen->isAnyMouseButtonDown()) { LOG((CLOG_DEBUG "locked by mouse button")); return true; } // not locked return false; } SInt32 CScreen::getJumpZoneSize() const { if (!m_isPrimary) { return 0; } else { return m_screen->getJumpZoneSize(); } } void CScreen::getCursorCenter(SInt32& x, SInt32& y) const { m_screen->getCursorCenter(x, y); } KeyModifierMask CScreen::getActiveModifiers() const { return m_screen->getActiveModifiers(); } KeyModifierMask CScreen::pollActiveModifiers() const { return m_screen->pollActiveModifiers(); } void* CScreen::getEventTarget() const { return m_screen; } bool CScreen::getClipboard(ClipboardID id, IClipboard* clipboard) const { return m_screen->getClipboard(id, clipboard); } void CScreen::getShape(SInt32& x, SInt32& y, SInt32& w, SInt32& h) const { m_screen->getShape(x, y, w, h); } void CScreen::getCursorPos(SInt32& x, SInt32& y) const { m_screen->getCursorPos(x, y); } void CScreen::enablePrimary() { // get notified of screen saver activation/deactivation m_screen->openScreensaver(true); // claim screen changed size EVENTQUEUE->addEvent(CEvent(getShapeChangedEvent(), getEventTarget())); } void CScreen::enableSecondary() { // assume primary has all clipboards for (ClipboardID id = 0; id < kClipboardEnd; ++id) { grabClipboard(id); } // disable the screen saver if synchronization is enabled if (m_screenSaverSync) { m_screen->openScreensaver(false); } } void CScreen::disablePrimary() { // done with screen saver m_screen->closeScreensaver(); } void CScreen::disableSecondary() { // done with screen saver m_screen->closeScreensaver(); } void CScreen::enterPrimary() { // do nothing } void CScreen::enterSecondary(KeyModifierMask) { // do nothing } void CScreen::leavePrimary() { // we don't track keys while on the primary screen so update our // idea of them now. this is particularly to update the state of // the toggle modifiers. m_screen->updateKeyState(); } void CScreen::leaveSecondary() { // release any keys we think are still down m_screen->fakeAllKeysUp(); } void CScreen::gameDeviceTimingResp(UInt16 freq) { m_screen->gameDeviceTimingResp(freq); } void CScreen::gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) { m_screen->gameDeviceFeedback(id, m1, m2); } synergy-1.4.12-Source/src/lib/synergy/CScreen.h0000600000175000017500000002224312021261364021237 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSCREEN_H #define CSCREEN_H #include "IScreen.h" #include "ClipboardTypes.h" #include "KeyTypes.h" #include "MouseTypes.h" #include "OptionTypes.h" #include "GameDeviceTypes.h" class IClipboard; class IPlatformScreen; //! Platform independent screen /*! This is a platform independent screen. It can work as either a primary or secondary screen. */ class CScreen : public IScreen { public: CScreen(IPlatformScreen* platformScreen); virtual ~CScreen(); //! @name manipulators //@{ //! Activate screen /*! Activate the screen, preparing it to report system and user events. For a secondary screen it also means disabling the screen saver if synchronizing it and preparing to synthesize events. */ void enable(); //! Deactivate screen /*! Undoes the operations in activate() and events are no longer reported. It also releases keys that are logically pressed. */ void disable(); //! Enter screen /*! Called when the user navigates to this screen. \p toggleMask has the toggle keys that should be turned on on the secondary screen. */ void enter(KeyModifierMask toggleMask); //! Leave screen /*! Called when the user navigates off this screen. */ bool leave(); //! Update configuration /*! This is called when the configuration has changed. \c activeSides is a bitmask of EDirectionMask indicating which sides of the primary screen are linked to clients. */ void reconfigure(UInt32 activeSides); //! Warp cursor /*! Warps the cursor to the absolute coordinates \c x,y. Also discards input events up to and including the warp before returning. */ void warpCursor(SInt32 x, SInt32 y); //! Set clipboard /*! Sets the system's clipboard contents. This is usually called soon after an enter(). */ void setClipboard(ClipboardID, const IClipboard*); //! Grab clipboard /*! Grabs (i.e. take ownership of) the system clipboard. */ void grabClipboard(ClipboardID); //! Activate/deactivate screen saver /*! Forcibly activates the screen saver if \c activate is true otherwise forcibly deactivates it. */ void screensaver(bool activate); //! Notify of key press /*! Synthesize key events to generate a press of key \c id. If possible match the given modifier mask. The KeyButton identifies the physical key on the server that generated this key down. The client must ensure that a key up or key repeat that uses the same KeyButton will synthesize an up or repeat for the same client key synthesized by keyDown(). */ void keyDown(KeyID id, KeyModifierMask, KeyButton); //! Notify of key repeat /*! Synthesize key events to generate a press and release of key \c id \c count times. If possible match the given modifier mask. */ void keyRepeat(KeyID id, KeyModifierMask, SInt32 count, KeyButton); //! Notify of key release /*! Synthesize key events to generate a release of key \c id. If possible match the given modifier mask. */ void keyUp(KeyID id, KeyModifierMask, KeyButton); //! Notify of mouse press /*! Synthesize mouse events to generate a press of mouse button \c id. */ void mouseDown(ButtonID id); //! Notify of mouse release /*! Synthesize mouse events to generate a release of mouse button \c id. */ void mouseUp(ButtonID id); //! Notify of mouse motion /*! Synthesize mouse events to generate mouse motion to the absolute screen position \c xAbs,yAbs. */ void mouseMove(SInt32 xAbs, SInt32 yAbs); //! Notify of mouse motion /*! Synthesize mouse events to generate mouse motion by the relative amount \c xRel,yRel. */ void mouseRelativeMove(SInt32 xRel, SInt32 yRel); //! Notify of mouse wheel motion /*! Synthesize mouse events to generate mouse wheel motion of \c xDelta and \c yDelta. Deltas are positive for motion away from the user or to the right and negative for motion towards the user or to the left. Each wheel click should generate a delta of +/-120. */ void mouseWheel(SInt32 xDelta, SInt32 yDelta); //! Notify of game device buttons changed /*! Synthesize game device button states. */ virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons); //! Notify of game device sticks changed /*! Synthesize game device stick states. */ virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2); //! Notify of game device trigger changes /*! Synthesize game device trigger states. */ virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2); //! Notify of game device timing request /*! Causes a game device timing response when state is next faked. */ virtual void gameDeviceTimingReq(); //! Notify of game device timing response /*! Handles a game device timing response coming back from the client. */ virtual void gameDeviceTimingResp(UInt16 freq); //! Notify of game device feedback changes /*! Sets the game device state with new feedback values. */ virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2); //! Notify of options changes /*! Resets all options to their default values. */ void resetOptions(); //! Notify of options changes /*! Set options to given values. Ignores unknown options and doesn't modify options that aren't given in \c options. */ void setOptions(const COptionsList& options); //! Set clipboard sequence number /*! Sets the sequence number to use in subsequent clipboard events. */ void setSequenceNumber(UInt32); //! Register a system hotkey /*! Registers a system-wide hotkey for key \p key with modifiers \p mask. Returns an id used to unregister the hotkey. */ UInt32 registerHotKey(KeyID key, KeyModifierMask mask); //! Unregister a system hotkey /*! Unregisters a previously registered hot key. */ void unregisterHotKey(UInt32 id); //! Prepare to synthesize input on primary screen /*! Prepares the primary screen to receive synthesized input. We do not want to receive this synthesized input as user input so this method ensures that we ignore it. Calls to \c fakeInputBegin() may not be nested. */ void fakeInputBegin(); //! Done synthesizing input on primary screen /*! Undoes whatever \c fakeInputBegin() did. */ void fakeInputEnd(); //@} //! @name accessors //@{ //! Test if cursor on screen /*! Returns true iff the cursor is on the screen. */ bool isOnScreen() const; //! Get screen lock state /*! Returns true if there's any reason that the user should not be allowed to leave the screen (usually because a button or key is pressed). If this method returns true it logs a message as to why at the CLOG_DEBUG level. */ bool isLockedToScreen() const; //! Get jump zone size /*! Return the jump zone size, the size of the regions on the edges of the screen that cause the cursor to jump to another screen. */ SInt32 getJumpZoneSize() const; //! Get cursor center position /*! Return the cursor center position which is where we park the cursor to compute cursor motion deltas and should be far from the edges of the screen, typically the center. */ void getCursorCenter(SInt32& x, SInt32& y) const; //! Get the active modifiers /*! Returns the modifiers that are currently active according to our shadowed state. */ KeyModifierMask getActiveModifiers() const; //! Get the active modifiers from OS /*! Returns the modifiers that are currently active according to the operating system. */ KeyModifierMask pollActiveModifiers() const; //@} // IScreen overrides virtual void* getEventTarget() const; virtual bool getClipboard(ClipboardID id, IClipboard*) const; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const; virtual void getCursorPos(SInt32& x, SInt32& y) const; protected: void enablePrimary(); void enableSecondary(); void disablePrimary(); void disableSecondary(); void enterPrimary(); void enterSecondary(KeyModifierMask toggleMask); void leavePrimary(); void leaveSecondary(); private: // our platform dependent screen IPlatformScreen* m_screen; // true if screen is being used as a primary screen, false otherwise bool m_isPrimary; // true if screen is enabled bool m_enabled; // true if the cursor is on this screen bool m_entered; // true if screen saver should be synchronized to server bool m_screenSaverSync; // note toggle keys that toggles on up/down (false) or on // transition (true) KeyModifierMask m_halfDuplex; // true if we're faking input on a primary screen bool m_fakeInput; }; #endif synergy-1.4.12-Source/src/lib/synergy/CServerApp.cpp0000600000175000017500000005501712131107263022266 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CServerApp.h" #include "CLog.h" #include "CArch.h" #include "XSocket.h" #include "Version.h" #include "IEventQueue.h" #include "CServer.h" #include "CClientListener.h" #include "CClientProxy.h" #include "TMethodEventJob.h" #include "CServerTaskBarReceiver.h" #include "CPrimaryClient.h" #include "CScreen.h" #include "CSocketMultiplexer.h" #include "CEventQueue.h" #include "LogOutputters.h" #include "CFunctionEventJob.h" #include "TMethodJob.h" #include "CVncClient.h" #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #endif #if WINAPI_MSWINDOWS #include "CMSWindowsScreen.h" #elif WINAPI_XWINDOWS #include "CXWindowsScreen.h" #elif WINAPI_CARBON #include "COSXScreen.h" #endif #include #include #include #include "XScreen.h" #include "CTCPSocketFactory.h" CEvent::Type CServerApp::s_reloadConfigEvent = CEvent::kUnknown; CServerApp::CServerApp(CreateTaskBarReceiverFunc createTaskBarReceiver) : CApp(createTaskBarReceiver, new CArgs()), s_server(NULL), s_forceReconnectEvent(CEvent::kUnknown), s_resetServerEvent(CEvent::kUnknown), s_serverState(kUninitialized), s_serverScreen(NULL), s_primaryClient(NULL), s_listener(NULL), s_timer(NULL), m_vncClient(NULL) { } CServerApp::~CServerApp() { } CServerApp::CArgs::CArgs() : m_synergyAddress(NULL), m_config(NULL) { } CServerApp::CArgs::~CArgs() { } bool CServerApp::parseArg(const int& argc, const char* const* argv, int& i) { if (CApp::parseArg(argc, argv, i)) { // found common arg return true; } else if (isArg(i, argc, argv, "-a", "--address", 1)) { // save listen address try { *args().m_synergyAddress = CNetworkAddress(argv[i + 1], kDefaultPort); args().m_synergyAddress->resolve(); } catch (XSocketAddress& e) { LOG((CLOG_PRINT "%s: %s" BYE, args().m_pname, e.what(), args().m_pname)); m_bye(kExitArgs); } ++i; } else if (isArg(i, argc, argv, "-c", "--config", 1)) { // save configuration file path args().m_configFile = argv[++i]; } else { // option not supported here return false; } // argument was valid return true; } void CServerApp::parseArgs(int argc, const char* const* argv) { // asserts values, sets defaults, and parses args int i; CApp::parseArgs(argc, argv, i); // no non-option arguments are allowed if (i != argc) { LOG((CLOG_PRINT "%s: unrecognized option `%s'" BYE, args().m_pname, argv[i], args().m_pname)); m_bye(kExitArgs); } // set log filter if (!CLOG->setFilter(args().m_logFilter)) { LOG((CLOG_PRINT "%s: unrecognized log level `%s'" BYE, args().m_pname, args().m_logFilter, args().m_pname)); m_bye(kExitArgs); } // identify system LOG((CLOG_INFO "%s Server on %s %s", kAppVersion, ARCH->getOSName().c_str(), ARCH->getPlatformName().c_str())); loggingFilterWarning(); } void CServerApp::help() { // window api args (windows/x-windows/carbon) #if WINAPI_XWINDOWS # define WINAPI_ARGS \ " [--display ] [--no-xinitthreads]" # define WINAPI_INFO \ " --display connect to the X server at \n" \ " --no-xinitthreads do not call XInitThreads()\n" #else # define WINAPI_ARGS # define WINAPI_INFO #endif char buffer[2000]; sprintf( buffer, "Usage: %s" " [--address
]" " [--config ]" WINAPI_ARGS HELP_SYS_ARGS HELP_COMMON_ARGS "\n\n" "Start the synergy mouse/keyboard sharing server.\n" "\n" " -a, --address
listen for clients on the given address.\n" " -c, --config use the named configuration file instead.\n" HELP_COMMON_INFO_1 WINAPI_INFO HELP_SYS_INFO HELP_COMMON_INFO_2 "\n" "* marks defaults.\n" "\n" "The argument for --address is of the form: [][:]. The\n" "hostname must be the address or hostname of an interface on the system.\n" "The default is to listen on all interfaces. The port overrides the\n" "default port, %d.\n" "\n" "If no configuration file pathname is provided then the first of the\n" "following to load successfully sets the configuration:\n" " %s\n" " %s\n", args().m_pname, kDefaultPort, ARCH->concatPath(ARCH->getUserDirectory(), USR_CONFIG_NAME).c_str(), ARCH->concatPath(ARCH->getSystemDirectory(), SYS_CONFIG_NAME).c_str() ); LOG((CLOG_PRINT "%s", buffer)); } void CServerApp::reloadSignalHandler(CArch::ESignal, void*) { EVENTQUEUE->addEvent(CEvent(getReloadConfigEvent(), IEventQueue::getSystemTarget())); } void CServerApp::reloadConfig(const CEvent&, void*) { LOG((CLOG_DEBUG "reload configuration")); if (loadConfig(args().m_configFile)) { if (s_server != NULL) { s_server->setConfig(*args().m_config); } LOG((CLOG_NOTE "reloaded configuration")); } } void CServerApp::loadConfig() { bool loaded = false; // load the config file, if specified if (!args().m_configFile.empty()) { loaded = loadConfig(args().m_configFile); } // load the default configuration if no explicit file given else { // get the user's home directory CString path = ARCH->getUserDirectory(); if (!path.empty()) { // complete path path = ARCH->concatPath(path, USR_CONFIG_NAME); // now try loading the user's configuration if (loadConfig(path)) { loaded = true; args().m_configFile = path; } } if (!loaded) { // try the system-wide config file path = ARCH->getSystemDirectory(); if (!path.empty()) { path = ARCH->concatPath(path, SYS_CONFIG_NAME); if (loadConfig(path)) { loaded = true; args().m_configFile = path; } } } } if (!loaded) { LOG((CLOG_PRINT "%s: no configuration available", args().m_pname)); m_bye(kExitConfig); } } bool CServerApp::loadConfig(const CString& pathname) { try { // load configuration LOG((CLOG_DEBUG "opening configuration \"%s\"", pathname.c_str())); std::ifstream configStream(pathname.c_str()); if (!configStream.is_open()) { // report failure to open configuration as a debug message // since we try several paths and we expect some to be // missing. LOG((CLOG_DEBUG "cannot open configuration \"%s\"", pathname.c_str())); return false; } configStream >> *args().m_config; LOG((CLOG_DEBUG "configuration read successfully")); return true; } catch (XConfigRead& e) { // report error in configuration file LOG((CLOG_ERR "cannot read configuration \"%s\": %s", pathname.c_str(), e.what())); } return false; } CEvent::Type CServerApp::getReloadConfigEvent() { return EVENTQUEUE->registerTypeOnce(s_reloadConfigEvent, "reloadConfig"); } void CServerApp::forceReconnect(const CEvent&, void*) { if (s_server != NULL) { s_server->disconnect(); } } CEvent::Type CServerApp::getForceReconnectEvent() { return EVENTQUEUE->registerTypeOnce(s_forceReconnectEvent, "forceReconnect"); } CEvent::Type CServerApp::getResetServerEvent() { return EVENTQUEUE->registerTypeOnce(s_resetServerEvent, "resetServer"); } void CServerApp::handleClientConnected(const CEvent&, void* vlistener) { CClientListener* listener = reinterpret_cast(vlistener); CClientProxy* client = listener->getNextClient(); if (client != NULL) { s_server->adoptClient(client); updateStatus(); if (args().m_enableVnc) { // TODO: figure out client IP address from name. CVncClient* vncClient = new CVncClient("192.168.0.13", client->getName()); vncClient->start(); m_vncClients.insert(std::pair(client->getName(), vncClient)); } } } void CServerApp::handleClientsDisconnected(const CEvent&, void*) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CServerApp::closeServer(CServer* server) { if (server == NULL) { return; } // tell all clients to disconnect server->disconnect(); // wait for clients to disconnect for up to timeout seconds double timeout = 3.0; CEventQueueTimer* timer = EVENTQUEUE->newOneShotTimer(timeout, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, timer, new TMethodEventJob(this, &CServerApp::handleClientsDisconnected)); EVENTQUEUE->adoptHandler(CServer::getDisconnectedEvent(), server, new TMethodEventJob(this, &CServerApp::handleClientsDisconnected)); EVENTQUEUE->loop(); EVENTQUEUE->removeHandler(CEvent::kTimer, timer); EVENTQUEUE->deleteTimer(timer); EVENTQUEUE->removeHandler(CServer::getDisconnectedEvent(), server); // done with server delete server; } void CServerApp::stopRetryTimer() { if (s_timer != NULL) { EVENTQUEUE->deleteTimer(s_timer); EVENTQUEUE->removeHandler(CEvent::kTimer, NULL); s_timer = NULL; } } void CServerApp::updateStatus() { updateStatus(""); } void CServerApp::updateStatus( const CString& msg ) { if (m_taskBarReceiver) { m_taskBarReceiver->updateStatus(s_server, msg); } } void CServerApp::closeClientListener(CClientListener* listen) { if (listen != NULL) { EVENTQUEUE->removeHandler(CClientListener::getConnectedEvent(), listen); delete listen; } } void CServerApp::stopServer() { if (s_serverState == kStarted) { closeClientListener(s_listener); closeServer(s_server); s_server = NULL; s_listener = NULL; s_serverState = kInitialized; } else if (s_serverState == kStarting) { stopRetryTimer(); s_serverState = kInitialized; } assert(s_server == NULL); assert(s_listener == NULL); } void CServerApp::closePrimaryClient(CPrimaryClient* primaryClient) { delete primaryClient; } void CServerApp::closeServerScreen(CScreen* screen) { if (screen != NULL) { EVENTQUEUE->removeHandler(IScreen::getErrorEvent(), screen->getEventTarget()); EVENTQUEUE->removeHandler(IScreen::getSuspendEvent(), screen->getEventTarget()); EVENTQUEUE->removeHandler(IScreen::getResumeEvent(), screen->getEventTarget()); delete screen; } } void CServerApp::cleanupServer() { stopServer(); if (s_serverState == kInitialized) { closePrimaryClient(s_primaryClient); closeServerScreen(s_serverScreen); s_primaryClient = NULL; s_serverScreen = NULL; s_serverState = kUninitialized; } else if (s_serverState == kInitializing || s_serverState == kInitializingToStart) { stopRetryTimer(); s_serverState = kUninitialized; } assert(s_primaryClient == NULL); assert(s_serverScreen == NULL); assert(s_serverState == kUninitialized); } void CServerApp::retryHandler(const CEvent&, void*) { // discard old timer assert(s_timer != NULL); stopRetryTimer(); // try initializing/starting the server again switch (s_serverState) { case kUninitialized: case kInitialized: case kStarted: assert(0 && "bad internal server state"); break; case kInitializing: LOG((CLOG_DEBUG1 "retry server initialization")); s_serverState = kUninitialized; if (!initServer()) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } break; case kInitializingToStart: LOG((CLOG_DEBUG1 "retry server initialization")); s_serverState = kUninitialized; if (!initServer()) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } else if (s_serverState == kInitialized) { LOG((CLOG_DEBUG1 "starting server")); if (!startServer()) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } } break; case kStarting: LOG((CLOG_DEBUG1 "retry starting server")); s_serverState = kInitialized; if (!startServer()) { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } break; } } bool CServerApp::initServer() { // skip if already initialized or initializing if (s_serverState != kUninitialized) { return true; } double retryTime; CScreen* serverScreen = NULL; CPrimaryClient* primaryClient = NULL; try { CString name = args().m_config->getCanonicalName(args().m_name); serverScreen = openServerScreen(); primaryClient = openPrimaryClient(name, serverScreen); s_serverScreen = serverScreen; s_primaryClient = primaryClient; s_serverState = kInitialized; updateStatus(); return true; } catch (XScreenUnavailable& e) { LOG((CLOG_WARN "primary screen unavailable: %s", e.what())); closePrimaryClient(primaryClient); closeServerScreen(serverScreen); updateStatus(CString("primary screen unavailable: ") + e.what()); retryTime = e.getRetryTime(); } catch (XScreenOpenFailure& e) { LOG((CLOG_CRIT "failed to start server: %s", e.what())); closePrimaryClient(primaryClient); closeServerScreen(serverScreen); return false; } catch (XBase& e) { LOG((CLOG_CRIT "failed to start server: %s", e.what())); closePrimaryClient(primaryClient); closeServerScreen(serverScreen); return false; } if (args().m_restartable) { // install a timer and handler to retry later assert(s_timer == NULL); LOG((CLOG_DEBUG "retry in %.0f seconds", retryTime)); s_timer = EVENTQUEUE->newOneShotTimer(retryTime, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, s_timer, new TMethodEventJob(this, &CServerApp::retryHandler)); s_serverState = kInitializing; return true; } else { // don't try again return false; } } CScreen* CServerApp::openServerScreen() { CScreen* screen = createScreen(); EVENTQUEUE->adoptHandler(IScreen::getErrorEvent(), screen->getEventTarget(), new TMethodEventJob( this, &CServerApp::handleScreenError)); EVENTQUEUE->adoptHandler(IScreen::getSuspendEvent(), screen->getEventTarget(), new TMethodEventJob( this, &CServerApp::handleSuspend)); EVENTQUEUE->adoptHandler(IScreen::getResumeEvent(), screen->getEventTarget(), new TMethodEventJob( this, &CServerApp::handleResume)); return screen; } bool CServerApp::startServer() { // skip if already started or starting if (s_serverState == kStarting || s_serverState == kStarted) { return true; } // initialize if necessary if (s_serverState != kInitialized) { if (!initServer()) { // hard initialization failure return false; } if (s_serverState == kInitializing) { // not ready to start s_serverState = kInitializingToStart; return true; } assert(s_serverState == kInitialized); } double retryTime; CClientListener* listener = NULL; try { listener = openClientListener(args().m_config->getSynergyAddress()); s_server = openServer(*args().m_config, s_primaryClient); listener->setServer(s_server); s_listener = listener; updateStatus(); LOG((CLOG_NOTE "started server, waiting for clients")); s_serverState = kStarted; return true; } catch (XSocketAddressInUse& e) { LOG((CLOG_WARN "cannot listen for clients: %s", e.what())); closeClientListener(listener); updateStatus(CString("cannot listen for clients: ") + e.what()); retryTime = 10.0; } catch (XBase& e) { LOG((CLOG_CRIT "failed to start server: %s", e.what())); closeClientListener(listener); return false; } if (args().m_restartable) { // install a timer and handler to retry later assert(s_timer == NULL); LOG((CLOG_DEBUG "retry in %.0f seconds", retryTime)); s_timer = EVENTQUEUE->newOneShotTimer(retryTime, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, s_timer, new TMethodEventJob(this, &CServerApp::retryHandler)); s_serverState = kStarting; return true; } else { // don't try again return false; } } CScreen* CServerApp::createScreen() { #if WINAPI_MSWINDOWS return new CScreen(new CMSWindowsScreen( true, args().m_noHooks, args().m_gameDevice, args().m_stopOnDeskSwitch)); #elif WINAPI_XWINDOWS return new CScreen(new CXWindowsScreen( args().m_display, true, args().m_disableXInitThreads, 0, *EVENTQUEUE)); #elif WINAPI_CARBON return new CScreen(new COSXScreen(true)); #endif } CPrimaryClient* CServerApp::openPrimaryClient(const CString& name, CScreen* screen) { LOG((CLOG_DEBUG1 "creating primary screen")); return new CPrimaryClient(name, screen); } void CServerApp::handleScreenError(const CEvent&, void*) { LOG((CLOG_CRIT "error on screen")); EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CServerApp::handleSuspend(const CEvent&, void*) { if (!m_suspended) { LOG((CLOG_INFO "suspend")); stopServer(); m_suspended = true; } } void CServerApp::handleResume(const CEvent&, void*) { if (m_suspended) { LOG((CLOG_INFO "resume")); startServer(); m_suspended = false; } } CClientListener* CServerApp::openClientListener(const CNetworkAddress& address) { CClientListener* listen = new CClientListener(address, new CTCPSocketFactory, NULL, args().m_crypto); EVENTQUEUE->adoptHandler(CClientListener::getConnectedEvent(), listen, new TMethodEventJob( this, &CServerApp::handleClientConnected, listen)); return listen; } CServer* CServerApp::openServer(const CConfig& config, CPrimaryClient* primaryClient) { CServer* server = new CServer(config, primaryClient, s_serverScreen); try { EVENTQUEUE->adoptHandler( CServer::getDisconnectedEvent(), server, new TMethodEventJob(this, &CServerApp::handleNoClients)); EVENTQUEUE->adoptHandler( CServer::getScreenSwitchedEvent(), server, new TMethodEventJob(this, &CServerApp::handleScreenSwitched)); } catch (std::bad_alloc &ba) { delete server; throw ba; } return server; } void CServerApp::handleNoClients(const CEvent&, void*) { updateStatus(); } void CServerApp::handleScreenSwitched(const CEvent& e, void*) { if (!args().m_enableVnc) return; if (m_vncClient != NULL) { LOG((CLOG_DEBUG "hiding vnc viewer for: %s", m_vncClient->m_screen.c_str())); m_vncClient->hideViewer(); } CServer::CSwitchToScreenInfo* info = reinterpret_cast(e.getData()); std::map::iterator it = m_vncClients.find(info->m_screen); if (it == m_vncClients.end()) { LOG((CLOG_DEBUG "could not find vnc client for: %s", info->m_screen)); return; } LOG((CLOG_DEBUG "showing vnc viewer for: %s", info->m_screen)); m_vncClient = it->second; m_vncClient->showViewer(); } int CServerApp::mainLoop() { // create socket multiplexer. this must happen after daemonization // on unix because threads evaporate across a fork(). CSocketMultiplexer multiplexer; // if configuration has no screens then add this system // as the default if (args().m_config->begin() == args().m_config->end()) { args().m_config->addScreen(args().m_name); } // set the contact address, if provided, in the config. // otherwise, if the config doesn't have an address, use // the default. if (args().m_synergyAddress->isValid()) { args().m_config->setSynergyAddress(*args().m_synergyAddress); } else if (!args().m_config->getSynergyAddress().isValid()) { args().m_config->setSynergyAddress(CNetworkAddress(kDefaultPort)); } // canonicalize the primary screen name CString primaryName = args().m_config->getCanonicalName(args().m_name); if (primaryName.empty()) { LOG((CLOG_CRIT "unknown screen name `%s'", args().m_name.c_str())); return kExitFailed; } // start server, etc appUtil().startNode(); // init ipc client after node start, since create a new screen wipes out // the event queue (the screen ctors call adoptBuffer). if (argsBase().m_enableIpc) { initIpcClient(); } // load all available plugins. ARCH->plugin().init(s_serverScreen->getEventTarget()); // handle hangup signal by reloading the server's configuration ARCH->setSignalHandler(CArch::kHANGUP, &reloadSignalHandler, NULL); EVENTQUEUE->adoptHandler(getReloadConfigEvent(), IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CServerApp::reloadConfig)); // handle force reconnect event by disconnecting clients. they'll // reconnect automatically. EVENTQUEUE->adoptHandler(getForceReconnectEvent(), IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CServerApp::forceReconnect)); // to work around the sticky meta keys problem, we'll give users // the option to reset the state of synergys EVENTQUEUE->adoptHandler(getResetServerEvent(), IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CServerApp::resetServer)); // run event loop. if startServer() failed we're supposed to retry // later. the timer installed by startServer() will take care of // that. DAEMON_RUNNING(true); EVENTQUEUE->loop(); DAEMON_RUNNING(false); // close down LOG((CLOG_DEBUG1 "stopping server")); EVENTQUEUE->removeHandler(getForceReconnectEvent(), IEventQueue::getSystemTarget()); EVENTQUEUE->removeHandler(getReloadConfigEvent(), IEventQueue::getSystemTarget()); cleanupServer(); updateStatus(); LOG((CLOG_NOTE "stopped server")); if (argsBase().m_enableIpc) { cleanupIpcClient(); } return kExitSuccess; } void CServerApp::resetServer(const CEvent&, void*) { LOG((CLOG_DEBUG1 "resetting server")); stopServer(); cleanupServer(); startServer(); } int CServerApp::runInner(int argc, char** argv, ILogOutputter* outputter, StartupFunc startup) { // general initialization args().m_synergyAddress = new CNetworkAddress; args().m_config = new CConfig; args().m_pname = ARCH->getBasename(argv[0]); // install caller's output filter if (outputter != NULL) { CLOG->insert(outputter); } // run int result = startup(argc, argv); if (m_taskBarReceiver) { // done with task bar receiver delete m_taskBarReceiver; } delete args().m_config; delete args().m_synergyAddress; return result; } int daemonMainLoopStatic(int argc, const char** argv) { return CServerApp::instance().daemonMainLoop(argc, argv); } int CServerApp::standardStartup(int argc, char** argv) { initApp(argc, argv); // daemonize if requested if (args().m_daemon) { return ARCH->daemonize(daemonName(), daemonMainLoopStatic); } else { return mainLoop(); } } int CServerApp::foregroundStartup(int argc, char** argv) { initApp(argc, argv); // never daemonize return mainLoop(); } static int mainLoopStatic() { return CServerApp::instance().mainLoop(); } const char* CServerApp::daemonName() const { #if SYSAPI_WIN32 return "Synergy Server"; #elif SYSAPI_UNIX return "synergys"; #endif } const char* CServerApp::daemonInfo() const { #if SYSAPI_WIN32 return "Shares this computers mouse and keyboard with other computers."; #elif SYSAPI_UNIX return ""; #endif } void CServerApp::startNode() { // start the server. if this return false then we've failed and // we shouldn't retry. LOG((CLOG_DEBUG1 "starting server")); if (!startServer()) { m_bye(kExitFailed); } } synergy-1.4.12-Source/src/lib/synergy/CServerApp.h0000600000175000017500000001016412021261364021726 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "CApp.h" #include "CString.h" #include "CConfig.h" #include "CNetworkAddress.h" #include "CArch.h" #include "IArchMultithread.h" #include "CArgsBase.h" #include enum EServerState { kUninitialized, kInitializing, kInitializingToStart, kInitialized, kStarting, kStarted }; class CServer; class CScreen; class CClientListener; class CEventQueueTimer; class ILogOutputter; class CVncClient; class CServerApp : public CApp { public: class CArgs : public CArgsBase { public: CArgs(); ~CArgs(); public: CString m_configFile; CNetworkAddress* m_synergyAddress; CConfig* m_config; }; CServerApp(CreateTaskBarReceiverFunc createTaskBarReceiver); virtual ~CServerApp(); // Parse server specific command line arguments. void parseArgs(int argc, const char* const* argv); // Prints help specific to server. void help(); // Returns arguments that are common and for server. CArgs& args() const { return (CArgs&)argsBase(); } const char* daemonName() const; const char* daemonInfo() const; // TODO: Document these functions. static void reloadSignalHandler(CArch::ESignal, void*); static CEvent::Type getReloadConfigEvent(); void reloadConfig(const CEvent&, void*); void loadConfig(); bool loadConfig(const CString& pathname); void forceReconnect(const CEvent&, void*); CEvent::Type getForceReconnectEvent(); void resetServer(const CEvent&, void*); CEvent::Type getResetServerEvent(); void handleClientConnected(const CEvent&, void* vlistener); void handleClientsDisconnected(const CEvent&, void*); void closeServer(CServer* server); void stopRetryTimer(); void updateStatus(); void updateStatus(const CString& msg); void closeClientListener(CClientListener* listen); void stopServer(); void closePrimaryClient(CPrimaryClient* primaryClient); void closeServerScreen(CScreen* screen); void cleanupServer(); bool initServer(); void retryHandler(const CEvent&, void*); CScreen* openServerScreen(); CScreen* createScreen(); CPrimaryClient* openPrimaryClient(const CString& name, CScreen* screen); void handleScreenError(const CEvent&, void*); void handleSuspend(const CEvent&, void*); void handleResume(const CEvent&, void*); CClientListener* openClientListener(const CNetworkAddress& address); CServer* openServer(const CConfig& config, CPrimaryClient* primaryClient); void handleNoClients(const CEvent&, void*); bool startServer(); int mainLoop(); int runInner(int argc, char** argv, ILogOutputter* outputter, StartupFunc startup); int standardStartup(int argc, char** argv); int foregroundStartup(int argc, char** argv); void startNode(); static CServerApp& instance() { return (CServerApp&)CApp::instance(); } // TODO: change s_ to m_ CServer* s_server; static CEvent::Type s_reloadConfigEvent; CEvent::Type s_forceReconnectEvent; CEvent::Type s_resetServerEvent; EServerState s_serverState; CScreen* s_serverScreen; CPrimaryClient* s_primaryClient; CClientListener* s_listener; CEventQueueTimer* s_timer; private: virtual bool parseArg(const int& argc, const char* const* argv, int& i); void vncThread(void*); void handleScreenSwitched(const CEvent&, void* data); std::map m_vncClients; CVncClient* m_vncClient; }; // configuration file name #if SYSAPI_WIN32 #define USR_CONFIG_NAME "synergy.sgc" #define SYS_CONFIG_NAME "synergy.sgc" #elif SYSAPI_UNIX #define USR_CONFIG_NAME ".synergy.conf" #define SYS_CONFIG_NAME "synergy.conf" #endif synergy-1.4.12-Source/src/lib/synergy/CServerTaskBarReceiver.cpp0000600000175000017500000000600312021261364024552 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CServerTaskBarReceiver.h" #include "CServer.h" #include "CLock.h" #include "CStringUtil.h" #include "IEventQueue.h" #include "CArch.h" #include "Version.h" // // CServerTaskBarReceiver // CServerTaskBarReceiver::CServerTaskBarReceiver() : m_state(kNotRunning) { // do nothing } CServerTaskBarReceiver::~CServerTaskBarReceiver() { // do nothing } void CServerTaskBarReceiver::updateStatus(CServer* server, const CString& errorMsg) { { // update our status m_errorMessage = errorMsg; if (server == NULL) { if (m_errorMessage.empty()) { m_state = kNotRunning; } else { m_state = kNotWorking; } } else { m_clients.clear(); server->getClients(m_clients); if (m_clients.size() <= 1) { m_state = kNotConnected; } else { m_state = kConnected; } } // let subclasses have a go onStatusChanged(server); } // tell task bar ARCH->updateReceiver(this); } CServerTaskBarReceiver::EState CServerTaskBarReceiver::getStatus() const { return m_state; } const CString& CServerTaskBarReceiver::getErrorMessage() const { return m_errorMessage; } const CServerTaskBarReceiver::CClients& CServerTaskBarReceiver::getClients() const { return m_clients; } void CServerTaskBarReceiver::quit() { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CServerTaskBarReceiver::onStatusChanged(CServer*) { // do nothing } void CServerTaskBarReceiver::lock() const { // do nothing } void CServerTaskBarReceiver::unlock() const { // do nothing } std::string CServerTaskBarReceiver::getToolTip() const { switch (m_state) { case kNotRunning: return CStringUtil::print("%s: Not running", kAppVersion); case kNotWorking: return CStringUtil::print("%s: %s", kAppVersion, m_errorMessage.c_str()); case kNotConnected: return CStringUtil::print("%s: Waiting for clients", kAppVersion); case kConnected: return CStringUtil::print("%s: Connected", kAppVersion); default: return ""; } } CEvent::Type CServerTaskBarReceiver::getReloadConfigEvent() { return CServerApp::instance().getReloadConfigEvent(); } CEvent::Type CServerTaskBarReceiver::getForceReconnectEvent() { return CServerApp::instance().getForceReconnectEvent(); } CEvent::Type CServerTaskBarReceiver::getResetServerEvent() { return CServerApp::instance().getResetServerEvent(); } synergy-1.4.12-Source/src/lib/synergy/CServerTaskBarReceiver.h0000600000175000017500000000504712021261364024226 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CSERVERTASKBARRECEIVER_H #define CSERVERTASKBARRECEIVER_H #include "CString.h" #include "IArchTaskBarReceiver.h" #include "stdvector.h" #include "CEvent.h" #include "CServerApp.h" #include "CServer.h" //! Implementation of IArchTaskBarReceiver for the synergy server class CServerTaskBarReceiver : public IArchTaskBarReceiver { public: CServerTaskBarReceiver(); virtual ~CServerTaskBarReceiver(); //! @name manipulators //@{ //! Update status /*! Determine the status and query required information from the server. */ void updateStatus(CServer*, const CString& errorMsg); void updateStatus(INode* n, const CString& errorMsg) { updateStatus((CServer*)n, errorMsg); } //@} // IArchTaskBarReceiver overrides virtual void showStatus() = 0; virtual void runMenu(int x, int y) = 0; virtual void primaryAction() = 0; virtual void lock() const; virtual void unlock() const; virtual const Icon getIcon() const = 0; virtual std::string getToolTip() const; protected: typedef std::vector CClients; enum EState { kNotRunning, kNotWorking, kNotConnected, kConnected, kMaxState }; //! Get status EState getStatus() const; //! Get error message const CString& getErrorMessage() const; //! Get connected clients const CClients& getClients() const; //! Quit app /*! Causes the application to quit gracefully */ void quit(); //! Status change notification /*! Called when status changes. The default implementation does nothing. */ virtual void onStatusChanged(CServer* server); protected: CEvent::Type getReloadConfigEvent(); CEvent::Type getForceReconnectEvent(); CEvent::Type getResetServerEvent(); private: EState m_state; CString m_errorMessage; CClients m_clients; }; IArchTaskBarReceiver* createTaskBarReceiver(const CBufferedLogOutputter* logBuffer); #endif synergy-1.4.12-Source/src/lib/synergy/CVncClient.cpp0000600000175000017500000000302312021261364022233 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CVncClient.h" #include "CThread.h" #include "TMethodJob.h" #if VNC_SUPPORT #include "vnc/win/vncviewer/vncviewer.h" #include "vnc/win/vncviewer/CConn.h" #include "vnc/win/vncviewer/CConnThread.h" #endif CVncClient::CVncClient(const char* hostInfo, const std::string& screen) : m_hostInfo(hostInfo), m_screen(screen), m_thread(NULL), m_connThread(NULL) { } CVncClient::~CVncClient() { if (m_thread) delete m_thread; } void CVncClient::thread(void*) { #if VNC_SUPPORT vncClientMain(this); #endif } void CVncClient::start() { m_thread = new CThread(new TMethodJob( this, &CVncClient::thread, NULL)); } void CVncClient::showViewer() { #if VNC_SUPPORT m_connThread->connRef->showViewer(); #endif } void CVncClient::hideViewer() { #if VNC_SUPPORT m_connThread->connRef->hideViewer(); #endif } synergy-1.4.12-Source/src/lib/synergy/CVncClient.h0000600000175000017500000000220112021261364021675 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include class CThread; namespace rfb { namespace win32 { class CConnThread; } } class CVncClient { public: CVncClient(const char* hostInfo, const std::string& screen); virtual ~CVncClient(); void thread(void*); void start(); void showViewer(); void hideViewer(); std::string m_screen; public: const char* m_hostInfo; rfb::win32::CConnThread* m_connThread; private: CThread* m_thread; }; synergy-1.4.12-Source/src/lib/synergy/ECryptoMode.h0000600000175000017500000000140212131107263022100 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once enum ECryptoMode { kDisabled, kOfb, kCfb, kCtr, kGcm, kNumOfModes }; synergy-1.4.12-Source/src/lib/synergy/GameDeviceTypes.h0000600000175000017500000000365612021261364022742 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "BasicTypes.h" //! Game device ID /*! Type to hold a game device ID. */ typedef UInt8 GameDeviceID; //! Game device button /*! Type to hold a game device button. */ typedef UInt16 GameDeviceButton; //! @name Game device buttons //@{ static const GameDeviceButton kGameDeviceDpadUp = 0x0001; static const GameDeviceButton kGameDeviceDpadDown = 0x0002; static const GameDeviceButton kGameDeviceDpadLeft = 0x0004; static const GameDeviceButton kGameDeviceDpadRight = 0x0008; static const GameDeviceButton kGameDeviceButtonStart = 0x0010; static const GameDeviceButton kGameDeviceButtonBack = 0x0020; static const GameDeviceButton kGameDeviceThumb1 = 0x0040; static const GameDeviceButton kGameDeviceThumb2 = 0x0080; static const GameDeviceButton kGameDeviceShoulder1 = 0x0100; static const GameDeviceButton kGameDeviceShoulder2 = 0x0200; static const GameDeviceButton kGameDeviceButton1 = 0x1000; static const GameDeviceButton kGameDeviceButton2 = 0x2000; static const GameDeviceButton kGameDeviceButton3 = 0x4000; static const GameDeviceButton kGameDeviceButton4 = 0x8000; //@} static const UInt8 NumGameDeviceButtons = 14; synergy-1.4.12-Source/src/lib/synergy/Global.h0000600000175000017500000000157412021261364021121 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 GLOBAL_H #define GLOBAL_H // Makes everything public for unit tests #ifdef TEST_ENV #define protected public #define private public #endif #endif synergy-1.4.12-Source/src/lib/synergy/IApp.h0000600000175000017500000000321312021261364020542 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IInterface.h" typedef int (*StartupFunc)(int, char**); class ILogOutputter; class CArgsBase; class IArchTaskBarReceiver; class CScreen; class IApp : public IInterface { public: virtual void setByeFunc(void(*bye)(int)) = 0; virtual bool isArg(int argi, int argc, const char* const* argv, const char* name1, const char* name2, int minRequiredParameters = 0) = 0; virtual CArgsBase& argsBase() const = 0; virtual int standardStartup(int argc, char** argv) = 0; virtual int runInner(int argc, char** argv, ILogOutputter* outputter, StartupFunc startup) = 0; virtual void startNode() = 0; virtual IArchTaskBarReceiver* taskBarReceiver() const = 0; virtual void bye(int error) = 0; virtual int mainLoop() = 0; virtual void initApp(int argc, const char** argv) = 0; virtual const char* daemonName() const = 0; virtual int foregroundStartup(int argc, char** argv) = 0; virtual CScreen* createScreen() = 0; }; synergy-1.4.12-Source/src/lib/synergy/IAppUtil.h0000600000175000017500000000211512021261364021400 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include "IInterface.h" #include "IApp.h" class IAppUtil : public IInterface { public: virtual bool parseArg(const int& argc, const char* const* argv, int& i) = 0; virtual void adoptApp(IApp* app) = 0; virtual IApp& app() const = 0; virtual int run(int argc, char** argv) = 0; virtual void beforeAppExit() = 0; virtual void startNode() = 0; }; synergy-1.4.12-Source/src/lib/synergy/IClient.h0000600000175000017500000001363612021261364021252 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ICLIENT_H #define ICLIENT_H #include "IScreen.h" #include "ClipboardTypes.h" #include "KeyTypes.h" #include "MouseTypes.h" #include "OptionTypes.h" #include "CString.h" #include "GameDeviceTypes.h" //! Client interface /*! This interface defines the methods necessary for the server to communicate with a client. */ class IClient : public IScreen { public: //! @name manipulators //@{ //! Enter screen /*! Enter the screen. The cursor should be warped to \p xAbs,yAbs. \p mask is the expected toggle button state and the client should update its state to match. \p forScreensaver is true iff the screen is being entered because the screen saver is starting. Subsequent clipboard events should report \p seqNum. */ virtual void enter(SInt32 xAbs, SInt32 yAbs, UInt32 seqNum, KeyModifierMask mask, bool forScreensaver) = 0; //! Leave screen /*! Leave the screen. Return false iff the user may not leave the client's screen (because, for example, a button is down). */ virtual bool leave() = 0; //! Set clipboard /*! Update the client's clipboard. This implies that the client's clipboard is now up to date. If the client's clipboard was already known to be up to date then this may do nothing. \c data has marshalled clipboard data. */ virtual void setClipboard(ClipboardID, const IClipboard*) = 0; //! Grab clipboard /*! Grab (i.e. take ownership of) the client's clipboard. Since this is called when another client takes ownership of the clipboard it implies that the client's clipboard is out of date. */ virtual void grabClipboard(ClipboardID) = 0; //! Mark clipboard dirty /*! Mark the client's clipboard as dirty (out of date) or clean (up to date). */ virtual void setClipboardDirty(ClipboardID, bool dirty) = 0; //! Notify of key press /*! Synthesize key events to generate a press of key \c id. If possible match the given modifier mask. The KeyButton identifies the physical key on the server that generated this key down. The client must ensure that a key up or key repeat that uses the same KeyButton will synthesize an up or repeat for the same client key synthesized by keyDown(). */ virtual void keyDown(KeyID id, KeyModifierMask, KeyButton) = 0; //! Notify of key repeat /*! Synthesize key events to generate a press and release of key \c id \c count times. If possible match the given modifier mask. */ virtual void keyRepeat(KeyID id, KeyModifierMask, SInt32 count, KeyButton) = 0; //! Notify of key release /*! Synthesize key events to generate a release of key \c id. If possible match the given modifier mask. */ virtual void keyUp(KeyID id, KeyModifierMask, KeyButton) = 0; //! Notify of mouse press /*! Synthesize mouse events to generate a press of mouse button \c id. */ virtual void mouseDown(ButtonID id) = 0; //! Notify of mouse release /*! Synthesize mouse events to generate a release of mouse button \c id. */ virtual void mouseUp(ButtonID id) = 0; //! Notify of mouse motion /*! Synthesize mouse events to generate mouse motion to the absolute screen position \c xAbs,yAbs. */ virtual void mouseMove(SInt32 xAbs, SInt32 yAbs) = 0; //! Notify of mouse motion /*! Synthesize mouse events to generate mouse motion by the relative amount \c xRel,yRel. */ virtual void mouseRelativeMove(SInt32 xRel, SInt32 yRel) = 0; //! Notify of mouse wheel motion /*! Synthesize mouse events to generate mouse wheel motion of \c xDelta and \c yDelta. Deltas are positive for motion away from the user or to the right and negative for motion towards the user or to the left. Each wheel click should generate a delta of +/-120. */ virtual void mouseWheel(SInt32 xDelta, SInt32 yDelta) = 0; //! Notify of game device buttons changed /*! Synthesize game device button states. */ virtual void gameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) = 0; //! Notify of game device sticks changed /*! Synthesize game device stick states. */ virtual void gameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) = 0; //! Notify of game device trigger changes /*! Synthesize game device trigger states. */ virtual void gameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) = 0; //! Notify of game device timing request /*! Causes a game device timing response when state is next faked. */ virtual void gameDeviceTimingReq() = 0; //! Notify of screen saver change virtual void screensaver(bool activate) = 0; //! Notify of options changes /*! Reset all options to their default values. */ virtual void resetOptions() = 0; //! Notify of options changes /*! Set options to given values. Ignore unknown options and don't modify our options that aren't given in \c options. */ virtual void setOptions(const COptionsList& options) = 0; //@} //! @name accessors //@{ //! Get client name /*! Return the client's name. */ virtual CString getName() const = 0; //@} // IScreen overrides virtual void* getEventTarget() const = 0; virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; }; #endif synergy-1.4.12-Source/src/lib/synergy/IClipboard.cpp0000600000175000017500000000757612021261364022274 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IClipboard.h" #include "stdvector.h" // // IClipboard // void IClipboard::unmarshall(IClipboard* clipboard, const CString& data, Time time) { assert(clipboard != NULL); const char* index = data.data(); // clear existing data clipboard->open(time); clipboard->empty(); // read the number of formats const UInt32 numFormats = readUInt32(index); index += 4; // read each format for (UInt32 i = 0; i < numFormats; ++i) { // get the format id IClipboard::EFormat format = static_cast(readUInt32(index)); index += 4; // get the size of the format data UInt32 size = readUInt32(index); index += 4; // save the data if it's a known format. if either the client // or server supports more clipboard formats than the other // then one of them will get a format >= kNumFormats here. if (format add(format, CString(index, size)); } index += size; } // done clipboard->close(); } CString IClipboard::marshall(const IClipboard* clipboard) { assert(clipboard != NULL); CString data; std::vector formatData; formatData.resize(IClipboard::kNumFormats); // FIXME -- use current time clipboard->open(0); // compute size of marshalled data UInt32 size = 4; UInt32 numFormats = 0; for (UInt32 format = 0; format != IClipboard::kNumFormats; ++format) { if (clipboard->has(static_cast(format))) { ++numFormats; formatData[format] = clipboard->get(static_cast(format)); size += 4 + 4 + (UInt32)formatData[format].size(); } } // allocate space data.reserve(size); // marshall the data writeUInt32(&data, numFormats); for (UInt32 format = 0; format != IClipboard::kNumFormats; ++format) { if (clipboard->has(static_cast(format))) { writeUInt32(&data, format); writeUInt32(&data, (UInt32)formatData[format].size()); data += formatData[format]; } } clipboard->close(); return data; } bool IClipboard::copy(IClipboard* dst, const IClipboard* src) { assert(dst != NULL); assert(src != NULL); return copy(dst, src, src->getTime()); } bool IClipboard::copy(IClipboard* dst, const IClipboard* src, Time time) { assert(dst != NULL); assert(src != NULL); bool success = false; if (src->open(time)) { if (dst->open(time)) { if (dst->empty()) { for (SInt32 format = 0; format != IClipboard::kNumFormats; ++format) { IClipboard::EFormat eFormat = (IClipboard::EFormat)format; if (src->has(eFormat)) { dst->add(eFormat, src->get(eFormat)); } } success = true; } dst->close(); } src->close(); } return success; } UInt32 IClipboard::readUInt32(const char* buf) { const unsigned char* ubuf = reinterpret_cast(buf); return (static_cast(ubuf[0]) << 24) | (static_cast(ubuf[1]) << 16) | (static_cast(ubuf[2]) << 8) | static_cast(ubuf[3]); } void IClipboard::writeUInt32(CString* buf, UInt32 v) { *buf += static_cast((v >> 24) & 0xff); *buf += static_cast((v >> 16) & 0xff); *buf += static_cast((v >> 8) & 0xff); *buf += static_cast( v & 0xff); } synergy-1.4.12-Source/src/lib/synergy/IClipboard.h0000600000175000017500000001220512021261364021722 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ICLIPBOARD_H #define ICLIPBOARD_H #include "IInterface.h" #include "CString.h" #include "BasicTypes.h" //! Clipboard interface /*! This interface defines the methods common to all clipboards. */ class IClipboard : public IInterface { public: //! Timestamp type /*! Timestamp type. Timestamps are in milliseconds from some arbitrary starting time. Timestamps will wrap around to 0 after about 49 3/4 days. */ typedef UInt32 Time; //! Clipboard formats /*! The list of known clipboard formats. kNumFormats must be last and formats must be sequential starting from zero. Clipboard data set via add() and retrieved via get() must be in one of these formats. Platform dependent clipboard subclasses can and should present any suitable formats derivable from these formats. \c kText is a text format encoded in UTF-8. Newlines are LF (not CR or LF/CR). \c kBitmap is an image format. The data is a BMP file without the 14 byte header (i.e. starting at the INFOHEADER) and with the image data immediately following the 40 byte INFOHEADER. \c kHTML is a text format encoded in UTF-8 and containing a valid HTML fragment (but not necessarily a complete HTML document). Newlines are LF. */ enum EFormat { kText, //!< Text format, UTF-8, newline is LF kBitmap, //!< Bitmap format, BMP 24/32bpp, BI_RGB kHTML, //!< HTML format, HTML fragment, UTF-8, newline is LF kNumFormats //!< The number of clipboard formats }; //! @name manipulators //@{ //! Empty clipboard /*! Take ownership of the clipboard and clear all data from it. This must be called between a successful open() and close(). Return false if the clipboard ownership could not be taken; the clipboard should not be emptied in this case. */ virtual bool empty() = 0; //! Add data /*! Add data in the given format to the clipboard. May only be called after a successful empty(). */ virtual void add(EFormat, const CString& data) = 0; //@} //! @name accessors //@{ //! Open clipboard /*! Open the clipboard. Return true iff the clipboard could be opened. If open() returns true then the client must call close() at some later time; if it returns false then close() must not be called. \c time should be the current time or a time in the past when the open should effectively have taken place. */ virtual bool open(Time time) const = 0; //! Close clipboard /*! Close the clipboard. close() must match a preceding successful open(). This signals that the clipboard has been filled with all the necessary data or all data has been read. It does not mean the clipboard ownership should be released (if it was taken). */ virtual void close() const = 0; //! Get time /*! Return the timestamp passed to the last successful open(). */ virtual Time getTime() const = 0; //! Check for data /*! Return true iff the clipboard contains data in the given format. Must be called between a successful open() and close(). */ virtual bool has(EFormat) const = 0; //! Get data /*! Return the data in the given format. Returns the empty string if there is no data in that format. Must be called between a successful open() and close(). */ virtual CString get(EFormat) const = 0; //! Marshall clipboard data /*! Merge \p clipboard's data into a single buffer that can be later unmarshalled to restore the clipboard and return the buffer. */ static CString marshall(const IClipboard* clipboard); //! Unmarshall clipboard data /*! Extract marshalled clipboard data and store it in \p clipboard. Sets the clipboard time to \c time. */ static void unmarshall(IClipboard* clipboard, const CString& data, Time time); //! Copy clipboard /*! Transfers all the data in one clipboard to another. The clipboards can be of any concrete clipboard type (and they don't have to be the same type). This also sets the destination clipboard's timestamp to source clipboard's timestamp. Returns true iff the copy succeeded. */ static bool copy(IClipboard* dst, const IClipboard* src); //! Copy clipboard /*! Transfers all the data in one clipboard to another. The clipboards can be of any concrete clipboard type (and they don't have to be the same type). This also sets the timestamp to \c time. Returns true iff the copy succeeded. */ static bool copy(IClipboard* dst, const IClipboard* src, Time); //@} private: static UInt32 readUInt32(const char*); static void writeUInt32(CString*, UInt32); }; #endif synergy-1.4.12-Source/src/lib/synergy/IKeyState.cpp0000600000175000017500000001074612021261364022117 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IKeyState.h" #include "CEventQueue.h" #include #include // // IKeyState // CEvent::Type IKeyState::s_keyDownEvent = CEvent::kUnknown; CEvent::Type IKeyState::s_keyUpEvent = CEvent::kUnknown; CEvent::Type IKeyState::s_keyRepeatEvent = CEvent::kUnknown; IKeyState::IKeyState() : m_eventQueue(*EVENTQUEUE) { } IKeyState::IKeyState(IEventQueue& eventQueue) : m_eventQueue(eventQueue) { } CEvent::Type IKeyState::getKeyDownEvent(IEventQueue& eventQueue) { return eventQueue.registerTypeOnce(s_keyDownEvent, "IKeyState::keyDown"); } CEvent::Type IKeyState::getKeyUpEvent(IEventQueue& eventQueue) { return eventQueue.registerTypeOnce(s_keyUpEvent, "IKeyState::keyUp"); } CEvent::Type IKeyState::getKeyRepeatEvent(IEventQueue& eventQueue) { return eventQueue.registerTypeOnce(s_keyRepeatEvent, "IKeyState::keyRepeat"); } // // IKeyState::CKeyInfo // IKeyState::CKeyInfo* IKeyState::CKeyInfo::alloc(KeyID id, KeyModifierMask mask, KeyButton button, SInt32 count) { CKeyInfo* info = (CKeyInfo*)malloc(sizeof(CKeyInfo)); info->m_key = id; info->m_mask = mask; info->m_button = button; info->m_count = count; info->m_screens = NULL; info->m_screensBuffer[0] = '\0'; return info; } IKeyState::CKeyInfo* IKeyState::CKeyInfo::alloc(KeyID id, KeyModifierMask mask, KeyButton button, SInt32 count, const std::set& destinations) { CString screens = join(destinations); // build structure CKeyInfo* info = (CKeyInfo*)malloc(sizeof(CKeyInfo) + screens.size()); info->m_key = id; info->m_mask = mask; info->m_button = button; info->m_count = count; info->m_screens = info->m_screensBuffer; strcpy(info->m_screensBuffer, screens.c_str()); return info; } IKeyState::CKeyInfo* IKeyState::CKeyInfo::alloc(const CKeyInfo& x) { CKeyInfo* info = (CKeyInfo*)malloc(sizeof(CKeyInfo) + strlen(x.m_screensBuffer)); info->m_key = x.m_key; info->m_mask = x.m_mask; info->m_button = x.m_button; info->m_count = x.m_count; info->m_screens = x.m_screens ? info->m_screensBuffer : NULL; strcpy(info->m_screensBuffer, x.m_screensBuffer); return info; } bool IKeyState::CKeyInfo::isDefault(const char* screens) { return (screens == NULL || screens[0] == '\0'); } bool IKeyState::CKeyInfo::contains(const char* screens, const CString& name) { // special cases if (isDefault(screens)) { return false; } if (screens[0] == '*') { return true; } // search CString match; match.reserve(name.size() + 2); match += ":"; match += name; match += ":"; return (strstr(screens, match.c_str()) != NULL); } bool IKeyState::CKeyInfo::equal(const CKeyInfo* a, const CKeyInfo* b) { return (a->m_key == b->m_key && a->m_mask == b->m_mask && a->m_button == b->m_button && a->m_count == b->m_count && strcmp(a->m_screensBuffer, b->m_screensBuffer) == 0); } CString IKeyState::CKeyInfo::join(const std::set& destinations) { // collect destinations into a string. names are surrounded by ':' // which makes searching easy. the string is empty if there are no // destinations and "*" means all destinations. CString screens; for (std::set::const_iterator i = destinations.begin(); i != destinations.end(); ++i) { if (*i == "*") { screens = "*"; break; } else { if (screens.empty()) { screens = ":"; } screens += *i; screens += ":"; } } return screens; } void IKeyState::CKeyInfo::split(const char* screens, std::set& dst) { dst.clear(); if (isDefault(screens)) { return; } if (screens[0] == '*') { dst.insert("*"); return; } const char* i = screens + 1; while (*i != '\0') { const char* j = strchr(i, ':'); dst.insert(CString(i, j - i)); i = j + 1; } } synergy-1.4.12-Source/src/lib/synergy/IKeyState.h0000600000175000017500000001254512021261364021563 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IKEYSTATE_H #define IKEYSTATE_H #include "IInterface.h" #include "KeyTypes.h" #include "CEvent.h" #include "CString.h" #include "stdset.h" #include "IEventQueue.h" //! Key state interface /*! This interface provides access to set and query the keyboard state and to synthesize key events. */ class IKeyState : public IInterface { public: IKeyState(); IKeyState(IEventQueue& eventQueue); enum { kNumButtons = 0x200 }; //! Key event data class CKeyInfo { public: static CKeyInfo* alloc(KeyID, KeyModifierMask, KeyButton, SInt32 count); static CKeyInfo* alloc(KeyID, KeyModifierMask, KeyButton, SInt32 count, const std::set& destinations); static CKeyInfo* alloc(const CKeyInfo&); static bool isDefault(const char* screens); static bool contains(const char* screens, const CString& name); static bool equal(const CKeyInfo*, const CKeyInfo*); static CString join(const std::set& destinations); static void split(const char* screens, std::set&); public: KeyID m_key; KeyModifierMask m_mask; KeyButton m_button; SInt32 m_count; char* m_screens; char m_screensBuffer[1]; }; typedef std::set KeyButtonSet; //! @name manipulators //@{ //! Update the keyboard map /*! Causes the key state to get updated to reflect the current keyboard mapping. */ virtual void updateKeyMap() = 0; //! Update the key state /*! Causes the key state to get updated to reflect the physical keyboard state. */ virtual void updateKeyState() = 0; //! Set half-duplex mask /*! Sets which modifier toggle keys are half-duplex. A half-duplex toggle key doesn't report a key release when toggled on and doesn't report a key press when toggled off. */ virtual void setHalfDuplexMask(KeyModifierMask) = 0; //! Fake a key press /*! Synthesizes a key press event and updates the key state. */ virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button) = 0; //! Fake a key repeat /*! Synthesizes a key repeat event and updates the key state. */ virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) = 0; //! Fake a key release /*! Synthesizes a key release event and updates the key state. */ virtual bool fakeKeyUp(KeyButton button) = 0; //! Fake key releases for all fake pressed keys /*! Synthesizes a key release event for every key that is synthetically pressed and updates the key state. */ virtual void fakeAllKeysUp() = 0; //! Fake ctrl+alt+del /*! Synthesize a press of ctrl+alt+del. Return true if processing is complete and false if normal key processing should continue. */ virtual bool fakeCtrlAltDel() = 0; //@} //! @name accessors //@{ //! Test if key is pressed /*! Returns true iff the given key is down. Half-duplex toggles always return false. */ virtual bool isKeyDown(KeyButton) const = 0; //! Get the active modifiers /*! Returns the modifiers that are currently active according to our shadowed state. */ virtual KeyModifierMask getActiveModifiers() const = 0; //! Get the active modifiers from OS /*! Returns the modifiers that are currently active according to the operating system. */ virtual KeyModifierMask pollActiveModifiers() const = 0; //! Get the active keyboard layout from OS /*! Returns the active keyboard layout according to the operating system. */ virtual SInt32 pollActiveGroup() const = 0; //! Get the keys currently pressed from OS /*! Adds any keys that are currently pressed according to the operating system to \p pressedKeys. */ virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const = 0; //! Get key down event type. Event data is CKeyInfo*, count == 1. CEvent::Type getKeyDownEvent() { return getKeyDownEvent(m_eventQueue); } //! Get key up event type. Event data is CKeyInfo*, count == 1. CEvent::Type getKeyUpEvent() { return getKeyUpEvent(m_eventQueue); } //! Get key repeat event type. Event data is CKeyInfo*. CEvent::Type getKeyRepeatEvent() { return getKeyRepeatEvent(m_eventQueue); } //! Get key down event type. Event data is CKeyInfo*, count == 1. static CEvent::Type getKeyDownEvent(IEventQueue& eventQueue); //! Get key up event type. Event data is CKeyInfo*, count == 1. static CEvent::Type getKeyUpEvent(IEventQueue& eventQueue); //! Get key repeat event type. Event data is CKeyInfo*. static CEvent::Type getKeyRepeatEvent(IEventQueue& eventQueue); //@} protected: IEventQueue& getEventQueue() const { return m_eventQueue; } private: static CEvent::Type s_keyDownEvent; static CEvent::Type s_keyUpEvent; static CEvent::Type s_keyRepeatEvent; IEventQueue& m_eventQueue; }; #endif synergy-1.4.12-Source/src/lib/synergy/INode.h0000600000175000017500000000143012021261364020706 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IInterface.h" class INode : IInterface { }; synergy-1.4.12-Source/src/lib/synergy/IPlatformScreen.h0000600000175000017500000001620512021261364022753 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IPLATFORMSCREEN_H #define IPLATFORMSCREEN_H #include "IScreen.h" #include "IPrimaryScreen.h" #include "ISecondaryScreen.h" #include "IKeyState.h" #include "ClipboardTypes.h" #include "OptionTypes.h" class IClipboard; //! Screen interface /*! This interface defines the methods common to all platform dependent screen implementations that are used by both primary and secondary screens. */ class IPlatformScreen : public IScreen, public IPrimaryScreen, public ISecondaryScreen, public IKeyState { public: //! @name manipulators //@{ IPlatformScreen() { } IPlatformScreen(IEventQueue& eventQueue) : IKeyState(eventQueue) { } //! Enable screen /*! Enable the screen, preparing it to report system and user events. For a secondary screen it also means preparing to synthesize events and hiding the cursor. */ virtual void enable() = 0; //! Disable screen /*! Undoes the operations in enable() and events should no longer be reported. */ virtual void disable() = 0; //! Enter screen /*! Called when the user navigates to this screen. */ virtual void enter() = 0; //! Leave screen /*! Called when the user navigates off the screen. Returns true on success, false on failure. A typical reason for failure is being unable to install the keyboard and mouse snoopers on a primary screen. Secondary screens should not fail. */ virtual bool leave() = 0; //! Set clipboard /*! Set the contents of the system clipboard indicated by \c id. */ virtual bool setClipboard(ClipboardID id, const IClipboard*) = 0; //! Check clipboard owner /*! Check ownership of all clipboards and post grab events for any that have changed. This is used as a backup in case the system doesn't reliably report clipboard ownership changes. */ virtual void checkClipboards() = 0; //! Open screen saver /*! Open the screen saver. If \c notify is true then this object must send events when the screen saver activates or deactivates until \c closeScreensaver() is called. If \c notify is false then the screen saver is disabled and restored on \c closeScreensaver(). */ virtual void openScreensaver(bool notify) = 0; //! Close screen saver /*! // Close the screen saver. Stop reporting screen saver activation and deactivation and, if the screen saver was disabled by openScreensaver(), enable the screen saver. */ virtual void closeScreensaver() = 0; //! Activate/deactivate screen saver /*! Forcibly activate the screen saver if \c activate is true otherwise forcibly deactivate it. */ virtual void screensaver(bool activate) = 0; //! Notify of options changes /*! Reset all options to their default values. */ virtual void resetOptions() = 0; //! Notify of options changes /*! Set options to given values. Ignore unknown options and don't modify options that aren't given in \c options. */ virtual void setOptions(const COptionsList& options) = 0; //! Set clipboard sequence number /*! Sets the sequence number to use in subsequent clipboard events. */ virtual void setSequenceNumber(UInt32) = 0; //@} //! @name accessors //@{ //! Test if is primary screen /*! Return true iff this screen is a primary screen. */ virtual bool isPrimary() const = 0; //@} // IScreen overrides virtual void* getEventTarget() const = 0; virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; // IPrimaryScreen overrides virtual void reconfigure(UInt32 activeSides) = 0; virtual void warpCursor(SInt32 x, SInt32 y) = 0; virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask) = 0; virtual void unregisterHotKey(UInt32 id) = 0; virtual void fakeInputBegin() = 0; virtual void fakeInputEnd() = 0; virtual SInt32 getJumpZoneSize() const = 0; virtual bool isAnyMouseButtonDown() const = 0; virtual void getCursorCenter(SInt32& x, SInt32& y) const = 0; virtual void gameDeviceTimingResp(UInt16 freq) = 0; virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) = 0; // ISecondaryScreen overrides virtual void fakeMouseButton(ButtonID id, bool press) = 0; virtual void fakeMouseMove(SInt32 x, SInt32 y) const = 0; virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const = 0; virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const = 0; virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const = 0; virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const = 0; virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const = 0; virtual void queueGameDeviceTimingReq() const = 0; // IKeyState overrides virtual void updateKeyMap() = 0; virtual void updateKeyState() = 0; virtual void setHalfDuplexMask(KeyModifierMask) = 0; virtual void fakeKeyDown(KeyID id, KeyModifierMask mask, KeyButton button) = 0; virtual bool fakeKeyRepeat(KeyID id, KeyModifierMask mask, SInt32 count, KeyButton button) = 0; virtual bool fakeKeyUp(KeyButton button) = 0; virtual void fakeAllKeysUp() = 0; virtual bool fakeCtrlAltDel() = 0; virtual bool isKeyDown(KeyButton) const = 0; virtual KeyModifierMask getActiveModifiers() const = 0; virtual KeyModifierMask pollActiveModifiers() const = 0; virtual SInt32 pollActiveGroup() const = 0; virtual void pollPressedKeys(KeyButtonSet& pressedKeys) const = 0; protected: //! Handle system event /*! A platform screen is expected to install a handler for system events in its c'tor like so: \code EVENTQUEUE->adoptHandler(CEvent::kSystem, IEventQueue::getSystemTarget(), new TMethodEventJob(this, &CXXXPlatformScreen::handleSystemEvent)); \endcode It should remove the handler in its d'tor. Override the \c handleSystemEvent() method to process system events. It should post the events \c IScreen as appropriate. A primary screen has further responsibilities. It should post the events in \c IPrimaryScreen as appropriate. It should also call \c onKey() on its \c CKeyState whenever a key is pressed or released (but not for key repeats). And it should call \c updateKeyMap() on its \c CKeyState if necessary when the keyboard mapping changes. The target of all events should be the value returned by \c getEventTarget(). */ virtual void handleSystemEvent(const CEvent& event, void*) = 0; }; #endif synergy-1.4.12-Source/src/lib/synergy/IPrimaryScreen.cpp0000600000175000017500000001305212021261364023142 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IPrimaryScreen.h" #include "CEventQueue.h" #include // // IPrimaryScreen // CEvent::Type IPrimaryScreen::s_buttonDownEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_buttonUpEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_motionPrimaryEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_motionSecondaryEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_wheelEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_ssActivatedEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_ssDeactivatedEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_hotKeyDownEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_hotKeyUpEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_fakeInputBegin = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_fakeInputEnd = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_gameButtonsEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_gameSticksEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_gameTriggersEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::s_gameTimingReqEvent = CEvent::kUnknown; CEvent::Type IPrimaryScreen::getButtonDownEvent() { return EVENTQUEUE->registerTypeOnce(s_buttonDownEvent, "IPrimaryScreen::buttonDown"); } CEvent::Type IPrimaryScreen::getButtonUpEvent() { return EVENTQUEUE->registerTypeOnce(s_buttonUpEvent, "IPrimaryScreen::buttonUp"); } CEvent::Type IPrimaryScreen::getMotionOnPrimaryEvent() { return EVENTQUEUE->registerTypeOnce(s_motionPrimaryEvent, "IPrimaryScreen::motionPrimary"); } CEvent::Type IPrimaryScreen::getMotionOnSecondaryEvent() { return EVENTQUEUE->registerTypeOnce(s_motionSecondaryEvent, "IPrimaryScreen::motionSecondary"); } CEvent::Type IPrimaryScreen::getWheelEvent() { return EVENTQUEUE->registerTypeOnce(s_wheelEvent, "IPrimaryScreen::wheel"); } CEvent::Type IPrimaryScreen::getScreensaverActivatedEvent() { return EVENTQUEUE->registerTypeOnce(s_ssActivatedEvent, "IPrimaryScreen::screensaverActivated"); } CEvent::Type IPrimaryScreen::getScreensaverDeactivatedEvent() { return EVENTQUEUE->registerTypeOnce(s_ssDeactivatedEvent, "IPrimaryScreen::screensaverDeactivated"); } CEvent::Type IPrimaryScreen::getHotKeyDownEvent() { return EVENTQUEUE->registerTypeOnce(s_hotKeyDownEvent, "IPrimaryScreen::hotKeyDown"); } CEvent::Type IPrimaryScreen::getHotKeyUpEvent() { return EVENTQUEUE->registerTypeOnce(s_hotKeyUpEvent, "IPrimaryScreen::hotKeyUp"); } CEvent::Type IPrimaryScreen::getFakeInputBeginEvent() { return EVENTQUEUE->registerTypeOnce(s_fakeInputBegin, "IPrimaryScreen::fakeInputBegin"); } CEvent::Type IPrimaryScreen::getFakeInputEndEvent() { return EVENTQUEUE->registerTypeOnce(s_fakeInputEnd, "IPrimaryScreen::fakeInputEnd"); } CEvent::Type IPrimaryScreen::getGameDeviceButtonsEvent() { return EVENTQUEUE->registerTypeOnce(s_gameButtonsEvent, "IPrimaryScreen::getGameDeviceButtonsEvent"); } CEvent::Type IPrimaryScreen::getGameDeviceSticksEvent() { return EVENTQUEUE->registerTypeOnce(s_gameSticksEvent, "IPrimaryScreen::getGameDeviceSticksEvent"); } CEvent::Type IPrimaryScreen::getGameDeviceTriggersEvent() { return EVENTQUEUE->registerTypeOnce(s_gameTriggersEvent, "IPrimaryScreen::getGameDeviceTriggersEvent"); } CEvent::Type IPrimaryScreen::getGameDeviceTimingReqEvent() { return EVENTQUEUE->registerTypeOnce(s_gameTimingReqEvent, "IPrimaryScreen::getGameDeviceTimingReqEvent"); } // // IPrimaryScreen::CButtonInfo // IPrimaryScreen::CButtonInfo* IPrimaryScreen::CButtonInfo::alloc(ButtonID id, KeyModifierMask mask) { CButtonInfo* info = (CButtonInfo*)malloc(sizeof(CButtonInfo)); info->m_button = id; info->m_mask = mask; return info; } IPrimaryScreen::CButtonInfo* IPrimaryScreen::CButtonInfo::alloc(const CButtonInfo& x) { CButtonInfo* info = (CButtonInfo*)malloc(sizeof(CButtonInfo)); info->m_button = x.m_button; info->m_mask = x.m_mask; return info; } bool IPrimaryScreen::CButtonInfo::equal(const CButtonInfo* a, const CButtonInfo* b) { return (a->m_button == b->m_button && a->m_mask == b->m_mask); } // // IPrimaryScreen::CMotionInfo // IPrimaryScreen::CMotionInfo* IPrimaryScreen::CMotionInfo::alloc(SInt32 x, SInt32 y) { CMotionInfo* info = (CMotionInfo*)malloc(sizeof(CMotionInfo)); info->m_x = x; info->m_y = y; return info; } // // IPrimaryScreen::CWheelInfo // IPrimaryScreen::CWheelInfo* IPrimaryScreen::CWheelInfo::alloc(SInt32 xDelta, SInt32 yDelta) { CWheelInfo* info = (CWheelInfo*)malloc(sizeof(CWheelInfo)); info->m_xDelta = xDelta; info->m_yDelta = yDelta; return info; } // // IPrimaryScreen::CHotKeyInfo // IPrimaryScreen::CHotKeyInfo* IPrimaryScreen::CHotKeyInfo::alloc(UInt32 id) { CHotKeyInfo* info = (CHotKeyInfo*)malloc(sizeof(CHotKeyInfo)); info->m_id = id; return info; } synergy-1.4.12-Source/src/lib/synergy/IPrimaryScreen.h0000600000175000017500000002074212021261364022613 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 IPRIMARYSCREEN_H #define IPRIMARYSCREEN_H #include "IInterface.h" #include "KeyTypes.h" #include "MouseTypes.h" #include "CEvent.h" #include "GameDeviceTypes.h" //! Primary screen interface /*! This interface defines the methods common to all platform dependent primary screen implementations. */ class IPrimaryScreen : public IInterface { public: //! Button event data class CButtonInfo { public: static CButtonInfo* alloc(ButtonID, KeyModifierMask); static CButtonInfo* alloc(const CButtonInfo&); static bool equal(const CButtonInfo*, const CButtonInfo*); public: ButtonID m_button; KeyModifierMask m_mask; }; //! Motion event data class CMotionInfo { public: static CMotionInfo* alloc(SInt32 x, SInt32 y); public: SInt32 m_x; SInt32 m_y; }; //! Wheel motion event data class CWheelInfo { public: static CWheelInfo* alloc(SInt32 xDelta, SInt32 yDelta); public: SInt32 m_xDelta; SInt32 m_yDelta; }; //! Hot key event data class CHotKeyInfo { public: static CHotKeyInfo* alloc(UInt32 id); public: UInt32 m_id; }; //! Game device button event data class CGameDeviceButtonInfo { public: CGameDeviceButtonInfo(GameDeviceID id, GameDeviceButton buttons) : m_id(id), m_buttons(buttons) { } public: GameDeviceID m_id; GameDeviceButton m_buttons; }; //! Game device sticks event data class CGameDeviceStickInfo { public: CGameDeviceStickInfo(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) : m_id(id), m_x1(x1), m_x2(x2), m_y1(y1), m_y2(y2) { } public: GameDeviceID m_id; SInt16 m_x1; SInt16 m_x2; SInt16 m_y1; SInt16 m_y2; }; //! Game device triggers event data class CGameDeviceTriggerInfo { public: CGameDeviceTriggerInfo(GameDeviceID id, UInt8 t1, UInt8 t2) : m_id(id), m_t1(t1), m_t2(t2) { } public: GameDeviceID m_id; UInt8 m_t1; UInt8 m_t2; }; //! Game device timing response event data class CGameDeviceTimingRespInfo { public: CGameDeviceTimingRespInfo(UInt16 freq) : m_freq(freq) { } public: UInt16 m_freq; }; //! Game device feedback event data class CGameDeviceFeedbackInfo { public: CGameDeviceFeedbackInfo(GameDeviceID id, UInt16 m1, UInt16 m2) : m_id(id), m_m1(m1), m_m2(m2) { } public: GameDeviceID m_id; UInt16 m_m1; UInt16 m_m2; }; //! @name manipulators //@{ //! Update configuration /*! This is called when the configuration has changed. \c activeSides is a bitmask of EDirectionMask indicating which sides of the primary screen are linked to clients. Override to handle the possible change in jump zones. */ virtual void reconfigure(UInt32 activeSides) = 0; //! Warp cursor /*! Warp the cursor to the absolute coordinates \c x,y. Also discard input events up to and including the warp before returning. */ virtual void warpCursor(SInt32 x, SInt32 y) = 0; //! Register a system hotkey /*! Registers a system-wide hotkey. The screen should arrange for an event to be delivered to itself when the hot key is pressed or released. When that happens the screen should post a \c getHotKeyDownEvent() or \c getHotKeyUpEvent(), respectively. The hot key is key \p key with exactly the modifiers \p mask. Returns 0 on failure otherwise an id that can be used to unregister the hotkey. A hot key is a set of modifiers and a key, which may itself be a modifier. The hot key is pressed when the hot key's modifiers and only those modifiers are logically down (active) and the key is pressed. The hot key is released when the key is released, regardless of the modifiers. The hot key event should be generated no matter what window or application has the focus. No other window or application should receive the key press or release events (they can and should see the modifier key events). When the key is a modifier, it's acceptable to allow the user to press the modifiers in any order or to require the user to press the given key last. */ virtual UInt32 registerHotKey(KeyID key, KeyModifierMask mask) = 0; //! Unregister a system hotkey /*! Unregisters a previously registered hot key. */ virtual void unregisterHotKey(UInt32 id) = 0; //! Prepare to synthesize input on primary screen /*! Prepares the primary screen to receive synthesized input. We do not want to receive this synthesized input as user input so this method ensures that we ignore it. Calls to \c fakeInputBegin() may not be nested. */ virtual void fakeInputBegin() = 0; //! Done synthesizing input on primary screen /*! Undoes whatever \c fakeInputBegin() did. */ virtual void fakeInputEnd() = 0; //@} //! @name accessors //@{ //! Get jump zone size /*! Return the jump zone size, the size of the regions on the edges of the screen that cause the cursor to jump to another screen. */ virtual SInt32 getJumpZoneSize() const = 0; //! Test if mouse is pressed /*! Return true if any mouse button is currently pressed. Ideally, "current" means up to the last processed event but it can mean the current physical mouse button state. */ virtual bool isAnyMouseButtonDown() const = 0; //! Get cursor center position /*! Return the cursor center position which is where we park the cursor to compute cursor motion deltas and should be far from the edges of the screen, typically the center. */ virtual void getCursorCenter(SInt32& x, SInt32& y) const = 0; //! Handle incoming game device timing responses. virtual void gameDeviceTimingResp(UInt16 freq) = 0; //! Handle incoming game device feedback changes. virtual void gameDeviceFeedback(GameDeviceID id, UInt16 m1, UInt16 m2) = 0; //! Get button down event type. Event data is CButtonInfo*. static CEvent::Type getButtonDownEvent(); //! Get button up event type. Event data is CButtonInfo*. static CEvent::Type getButtonUpEvent(); //! Get mouse motion on the primary screen event type /*! Event data is CMotionInfo* and the values are an absolute position. */ static CEvent::Type getMotionOnPrimaryEvent(); //! Get mouse motion on a secondary screen event type /*! Event data is CMotionInfo* and the values are motion deltas not absolute coordinates. */ static CEvent::Type getMotionOnSecondaryEvent(); //! Get mouse wheel event type. Event data is CWheelInfo*. static CEvent::Type getWheelEvent(); //! Get screensaver activated event type static CEvent::Type getScreensaverActivatedEvent(); //! Get screensaver deactivated event type static CEvent::Type getScreensaverDeactivatedEvent(); //! Get hot key down event type. Event data is CHotKeyInfo*. static CEvent::Type getHotKeyDownEvent(); //! Get hot key up event type. Event data is CHotKeyInfo*. static CEvent::Type getHotKeyUpEvent(); //! Get start of fake input event type static CEvent::Type getFakeInputBeginEvent(); //! Get end of fake input event type static CEvent::Type getFakeInputEndEvent(); public: // HACK //! Get game device buttons event type. static CEvent::Type getGameDeviceButtonsEvent(); //! Get game device sticks event type. static CEvent::Type getGameDeviceSticksEvent(); //! Get game device triggers event type. static CEvent::Type getGameDeviceTriggersEvent(); //! Get game device timing request event type. static CEvent::Type getGameDeviceTimingReqEvent(); private: // HACK //@} private: static CEvent::Type s_buttonDownEvent; static CEvent::Type s_buttonUpEvent; static CEvent::Type s_motionPrimaryEvent; static CEvent::Type s_motionSecondaryEvent; static CEvent::Type s_wheelEvent; static CEvent::Type s_ssActivatedEvent; static CEvent::Type s_ssDeactivatedEvent; static CEvent::Type s_hotKeyDownEvent; static CEvent::Type s_hotKeyUpEvent; static CEvent::Type s_fakeInputBegin; static CEvent::Type s_fakeInputEnd; static CEvent::Type s_gameButtonsEvent; static CEvent::Type s_gameSticksEvent; static CEvent::Type s_gameTriggersEvent; static CEvent::Type s_gameTimingReqEvent; }; #endif synergy-1.4.12-Source/src/lib/synergy/IScreen.cpp0000600000175000017500000000341712021261364021602 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2004 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "IScreen.h" #include "CEventQueue.h" // // IScreen // CEvent::Type IScreen::s_errorEvent = CEvent::kUnknown; CEvent::Type IScreen::s_shapeChangedEvent = CEvent::kUnknown; CEvent::Type IScreen::s_clipboardGrabbedEvent = CEvent::kUnknown; CEvent::Type IScreen::s_suspendEvent = CEvent::kUnknown; CEvent::Type IScreen::s_resumeEvent = CEvent::kUnknown; CEvent::Type IScreen::getErrorEvent() { return EVENTQUEUE->registerTypeOnce(s_errorEvent, "IScreen::error"); } CEvent::Type IScreen::getShapeChangedEvent() { return EVENTQUEUE->registerTypeOnce(s_shapeChangedEvent, "IScreen::shapeChanged"); } CEvent::Type IScreen::getClipboardGrabbedEvent() { return EVENTQUEUE->registerTypeOnce(s_clipboardGrabbedEvent, "IScreen::clipboardGrabbed"); } CEvent::Type IScreen::getSuspendEvent() { return EVENTQUEUE->registerTypeOnce(s_suspendEvent, "IScreen::suspend"); } CEvent::Type IScreen::getResumeEvent() { return EVENTQUEUE->registerTypeOnce(s_resumeEvent, "IScreen::resume"); } synergy-1.4.12-Source/src/lib/synergy/IScreen.h0000600000175000017500000000613312021261364021245 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISCREEN_H #define ISCREEN_H #include "IInterface.h" #include "ClipboardTypes.h" #include "CEvent.h" class IClipboard; //! Screen interface /*! This interface defines the methods common to all screens. */ class IScreen : public IInterface { public: struct CClipboardInfo { public: ClipboardID m_id; UInt32 m_sequenceNumber; }; //! @name accessors //@{ //! Get event target /*! Returns the target used for events created by this object. */ virtual void* getEventTarget() const = 0; //! Get clipboard /*! Save the contents of the clipboard indicated by \c id and return true iff successful. */ virtual bool getClipboard(ClipboardID id, IClipboard*) const = 0; //! Get screen shape /*! Return the position of the upper-left corner of the screen in \c x and \c y and the size of the screen in \c width and \c height. */ virtual void getShape(SInt32& x, SInt32& y, SInt32& width, SInt32& height) const = 0; //! Get cursor position /*! Return the current position of the cursor in \c x and \c y. */ virtual void getCursorPos(SInt32& x, SInt32& y) const = 0; //! Get error event type /*! Returns the error event type. This is sent whenever the screen has failed for some reason (e.g. the X Windows server died). */ static CEvent::Type getErrorEvent(); //! Get shape changed event type /*! Returns the shape changed event type. This is sent whenever the screen's shape changes. */ static CEvent::Type getShapeChangedEvent(); //! Get clipboard grabbed event type /*! Returns the clipboard grabbed event type. This is sent whenever the clipboard is grabbed by some other application so we don't own it anymore. The data is a pointer to a CClipboardInfo. */ static CEvent::Type getClipboardGrabbedEvent(); //! Get suspend event type /*! Returns the suspend event type. This is sent whenever the system goes to sleep or a user session is deactivated (fast user switching). */ static CEvent::Type getSuspendEvent(); //! Get resume event type /*! Returns the suspend event type. This is sent whenever the system wakes up or a user session is activated (fast user switching). */ static CEvent::Type getResumeEvent(); //@} private: static CEvent::Type s_errorEvent; static CEvent::Type s_shapeChangedEvent; static CEvent::Type s_clipboardGrabbedEvent; static CEvent::Type s_suspendEvent; static CEvent::Type s_resumeEvent; }; #endif synergy-1.4.12-Source/src/lib/synergy/IScreenSaver.h0000600000175000017500000000366012021261364022250 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISCREENSAVER_H #define ISCREENSAVER_H #include "IInterface.h" #include "CEvent.h" //! Screen saver interface /*! This interface defines the methods common to all screen savers. */ class IScreenSaver : public IInterface { public: // note -- the c'tor/d'tor must *not* enable/disable the screen saver //! @name manipulators //@{ //! Enable screen saver /*! Enable the screen saver, restoring the screen saver settings to what they were when disable() was previously called. If disable() wasn't previously called then it should keep the current settings or use reasonable defaults. */ virtual void enable() = 0; //! Disable screen saver /*! Disable the screen saver, saving the old settings for the next call to enable(). */ virtual void disable() = 0; //! Activate screen saver /*! Activate (i.e. show) the screen saver. */ virtual void activate() = 0; //! Deactivate screen saver /*! Deactivate (i.e. hide) the screen saver, reseting the screen saver timer. */ virtual void deactivate() = 0; //@} //! @name accessors //@{ //! Test if screen saver on /*! Returns true iff the screen saver is currently active (showing). */ virtual bool isActive() const = 0; //@} }; #endif synergy-1.4.12-Source/src/lib/synergy/ISecondaryScreen.cpp0000600000175000017500000000242712021261364023452 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ISecondaryScreen.h" #include "IEventQueue.h" CEvent::Type ISecondaryScreen::s_gameTimingRespEvent = CEvent::kUnknown; CEvent::Type ISecondaryScreen::s_gameFeedbackEvent = CEvent::kUnknown; CEvent::Type ISecondaryScreen::getGameDeviceTimingRespEvent() { return EVENTQUEUE->registerTypeOnce(s_gameTimingRespEvent, "ISecondaryScreen::getGameDeviceTimingRespEvent"); } CEvent::Type ISecondaryScreen::getGameDeviceFeedbackEvent() { return EVENTQUEUE->registerTypeOnce(s_gameFeedbackEvent, "ISecondaryScreen::getGameDeviceFeedbackEvent"); } synergy-1.4.12-Source/src/lib/synergy/ISecondaryScreen.h0000600000175000017500000000503112021261364023111 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2003 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 ISECONDARYSCREEN_H #define ISECONDARYSCREEN_H #include "IInterface.h" #include "MouseTypes.h" #include "GameDeviceTypes.h" #include "CEvent.h" //! Secondary screen interface /*! This interface defines the methods common to all platform dependent secondary screen implementations. */ class ISecondaryScreen : public IInterface { public: //! @name accessors //@{ //! Fake mouse press/release /*! Synthesize a press or release of mouse button \c id. */ virtual void fakeMouseButton(ButtonID id, bool press) = 0; //! Fake mouse move /*! Synthesize a mouse move to the absolute coordinates \c x,y. */ virtual void fakeMouseMove(SInt32 x, SInt32 y) const = 0; //! Fake mouse move /*! Synthesize a mouse move to the relative coordinates \c dx,dy. */ virtual void fakeMouseRelativeMove(SInt32 dx, SInt32 dy) const = 0; //! Fake mouse wheel /*! Synthesize a mouse wheel event of amount \c xDelta and \c yDelta. */ virtual void fakeMouseWheel(SInt32 xDelta, SInt32 yDelta) const = 0; //! Fake game device buttons /*! Synthesize game device buttons state. */ virtual void fakeGameDeviceButtons(GameDeviceID id, GameDeviceButton buttons) const = 0; //! Fake game device sticks /*! Synthesize game device sticks state. */ virtual void fakeGameDeviceSticks(GameDeviceID id, SInt16 x1, SInt16 y1, SInt16 x2, SInt16 y2) const = 0; //! Fake game device triggers /*! Synthesize game device triggers state. */ virtual void fakeGameDeviceTriggers(GameDeviceID id, UInt8 t1, UInt8 t2) const = 0; //! Get game device timing response event type. static CEvent::Type getGameDeviceTimingRespEvent(); //! Get game device feedback event type. static CEvent::Type getGameDeviceFeedbackEvent(); //@} private: static CEvent::Type s_gameTimingRespEvent; static CEvent::Type s_gameFeedbackEvent; }; #endif synergy-1.4.12-Source/src/lib/synergy/KeyTypes.cpp0000600000175000017500000001346012021261364022026 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "KeyTypes.h" const KeyNameMapEntry kKeyNameMap[] = { { "AltGr", kKeyAltGr }, { "Alt_L", kKeyAlt_L }, { "Alt_R", kKeyAlt_R }, { "AppMail", kKeyAppMail }, { "AppMedia", kKeyAppMedia }, { "AppUser1", kKeyAppUser1 }, { "AppUser2", kKeyAppUser2 }, { "AudioDown", kKeyAudioDown }, { "AudioMute", kKeyAudioMute }, { "AudioNext", kKeyAudioNext }, { "AudioPlay", kKeyAudioPlay }, { "AudioPrev", kKeyAudioPrev }, { "AudioStop", kKeyAudioStop }, { "AudioUp", kKeyAudioUp }, { "BackSpace", kKeyBackSpace }, { "Begin", kKeyBegin }, { "Break", kKeyBreak }, { "Cancel", kKeyCancel }, { "CapsLock", kKeyCapsLock }, { "Clear", kKeyClear }, { "Control_L", kKeyControl_L }, { "Control_R", kKeyControl_R }, { "Delete", kKeyDelete }, { "Down", kKeyDown }, { "Eject", kKeyEject }, { "End", kKeyEnd }, { "Escape", kKeyEscape }, { "Execute", kKeyExecute }, { "F1", kKeyF1 }, { "F2", kKeyF2 }, { "F3", kKeyF3 }, { "F4", kKeyF4 }, { "F5", kKeyF5 }, { "F6", kKeyF6 }, { "F7", kKeyF7 }, { "F8", kKeyF8 }, { "F9", kKeyF9 }, { "F10", kKeyF10 }, { "F11", kKeyF11 }, { "F12", kKeyF12 }, { "F13", kKeyF13 }, { "F14", kKeyF14 }, { "F15", kKeyF15 }, { "F16", kKeyF16 }, { "F17", kKeyF17 }, { "F18", kKeyF18 }, { "F19", kKeyF19 }, { "F20", kKeyF20 }, { "F21", kKeyF21 }, { "F22", kKeyF22 }, { "F23", kKeyF23 }, { "F24", kKeyF24 }, { "F25", kKeyF25 }, { "F26", kKeyF26 }, { "F27", kKeyF27 }, { "F28", kKeyF28 }, { "F29", kKeyF29 }, { "F30", kKeyF30 }, { "F31", kKeyF31 }, { "F32", kKeyF32 }, { "F33", kKeyF33 }, { "F34", kKeyF34 }, { "F35", kKeyF35 }, { "Find", kKeyFind }, { "Help", kKeyHelp }, { "Henkan", kKeyHenkan }, { "Home", kKeyHome }, { "Hyper_L", kKeyHyper_L }, { "Hyper_R", kKeyHyper_R }, { "Insert", kKeyInsert }, { "KP_0", kKeyKP_0 }, { "KP_1", kKeyKP_1 }, { "KP_2", kKeyKP_2 }, { "KP_3", kKeyKP_3 }, { "KP_4", kKeyKP_4 }, { "KP_5", kKeyKP_5 }, { "KP_6", kKeyKP_6 }, { "KP_7", kKeyKP_7 }, { "KP_8", kKeyKP_8 }, { "KP_9", kKeyKP_9 }, { "KP_Add", kKeyKP_Add }, { "KP_Begin", kKeyKP_Begin }, { "KP_Decimal", kKeyKP_Decimal }, { "KP_Delete", kKeyKP_Delete }, { "KP_Divide", kKeyKP_Divide }, { "KP_Down", kKeyKP_Down }, { "KP_End", kKeyKP_End }, { "KP_Enter", kKeyKP_Enter }, { "KP_Equal", kKeyKP_Equal }, { "KP_F1", kKeyKP_F1 }, { "KP_F2", kKeyKP_F2 }, { "KP_F3", kKeyKP_F3 }, { "KP_F4", kKeyKP_F4 }, { "KP_Home", kKeyKP_Home }, { "KP_Insert", kKeyKP_Insert }, { "KP_Left", kKeyKP_Left }, { "KP_Multiply", kKeyKP_Multiply }, { "KP_PageDown", kKeyKP_PageDown }, { "KP_PageUp", kKeyKP_PageUp }, { "KP_Right", kKeyKP_Right }, { "KP_Separator", kKeyKP_Separator }, { "KP_Space", kKeyKP_Space }, { "KP_Subtract", kKeyKP_Subtract }, { "KP_Tab", kKeyKP_Tab }, { "KP_Up", kKeyKP_Up }, { "Left", kKeyLeft }, { "LeftTab", kKeyLeftTab }, { "Linefeed", kKeyLinefeed }, { "Menu", kKeyMenu }, { "Meta_L", kKeyMeta_L }, { "Meta_R", kKeyMeta_R }, { "NumLock", kKeyNumLock }, { "PageDown", kKeyPageDown }, { "PageUp", kKeyPageUp }, { "Pause", kKeyPause }, { "Print", kKeyPrint }, { "Redo", kKeyRedo }, { "Return", kKeyReturn }, { "Right", kKeyRight }, { "ScrollLock", kKeyScrollLock }, { "Select", kKeySelect }, { "ShiftLock", kKeyShiftLock }, { "Shift_L", kKeyShift_L }, { "Shift_R", kKeyShift_R }, { "Sleep", kKeySleep }, { "Super_L", kKeySuper_L }, { "Super_R", kKeySuper_R }, { "SysReq", kKeySysReq }, { "Tab", kKeyTab }, { "Undo", kKeyUndo }, { "Up", kKeyUp }, { "WWWBack", kKeyWWWBack }, { "WWWFavorites", kKeyWWWFavorites }, { "WWWForward", kKeyWWWForward }, { "WWWHome", kKeyWWWHome }, { "WWWRefresh", kKeyWWWRefresh }, { "WWWSearch", kKeyWWWSearch }, { "WWWStop", kKeyWWWStop }, { "Zenkaku", kKeyZenkaku }, { "Space", 0x0020 }, { "Exclaim", 0x0021 }, { "DoubleQuote", 0x0022 }, { "Number", 0x0023 }, { "Dollar", 0x0024 }, { "Percent", 0x0025 }, { "Ampersand", 0x0026 }, { "Apostrophe", 0x0027 }, { "ParenthesisL", 0x0028 }, { "ParenthesisR", 0x0029 }, { "Asterisk", 0x002a }, { "Plus", 0x002b }, { "Comma", 0x002c }, { "Minus", 0x002d }, { "Period", 0x002e }, { "Slash", 0x002f }, { "Colon", 0x003a }, { "Semicolon", 0x003b }, { "Less", 0x003c }, { "Equal", 0x003d }, { "Greater", 0x003e }, { "Question", 0x003f }, { "At", 0x0040 }, { "BracketL", 0x005b }, { "Backslash", 0x005c }, { "BracketR", 0x005d }, { "Circumflex", 0x005e }, { "Underscore", 0x005f }, { "Grave", 0x0060 }, { "BraceL", 0x007b }, { "Bar", 0x007c }, { "BraceR", 0x007d }, { "Tilde", 0x007e }, { NULL, 0 }, }; const KeyModifierNameMapEntry kModifierNameMap[] = { { "Alt", KeyModifierAlt }, { "AltGr", KeyModifierAltGr }, // { "CapsLock", KeyModifierCapsLock }, { "Control", KeyModifierControl }, { "Meta", KeyModifierMeta }, // { "NumLock", KeyModifierNumLock }, // { "ScrollLock", KeyModifierScrollLock }, { "Shift", KeyModifierShift }, { "Super", KeyModifierSuper }, { NULL, 0 }, }; synergy-1.4.12-Source/src/lib/synergy/KeyTypes.h0000600000175000017500000002764512021261364021505 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 KEYTYPES_H #define KEYTYPES_H #include "BasicTypes.h" //! Key ID /*! Type to hold a key symbol identifier. The encoding is UTF-32, using U+E000 through U+EFFF for the various control keys (e.g. arrow keys, function keys, modifier keys, etc). */ typedef UInt32 KeyID; //! Key Code /*! Type to hold a physical key identifier. That is, it identifies a physical key on the keyboard. KeyButton 0 is reserved to be an invalid key; platforms that use 0 as a physical key identifier will have to remap that value to some arbitrary unused id. */ typedef UInt16 KeyButton; //! Modifier key mask /*! Type to hold a bitmask of key modifiers (e.g. shift keys). */ typedef UInt32 KeyModifierMask; //! Modifier key ID /*! Type to hold the id of a key modifier (e.g. a shift key). */ typedef UInt32 KeyModifierID; //! @name Modifier key masks //@{ static const KeyModifierMask KeyModifierShift = 0x0001; static const KeyModifierMask KeyModifierControl = 0x0002; static const KeyModifierMask KeyModifierAlt = 0x0004; static const KeyModifierMask KeyModifierMeta = 0x0008; static const KeyModifierMask KeyModifierSuper = 0x0010; static const KeyModifierMask KeyModifierAltGr = 0x0020; static const KeyModifierMask KeyModifierLevel5Lock = 0x0040; static const KeyModifierMask KeyModifierCapsLock = 0x1000; static const KeyModifierMask KeyModifierNumLock = 0x2000; static const KeyModifierMask KeyModifierScrollLock = 0x4000; //@} //! @name Modifier key bits //@{ static const UInt32 kKeyModifierBitNone = 16; static const UInt32 kKeyModifierBitShift = 0; static const UInt32 kKeyModifierBitControl = 1; static const UInt32 kKeyModifierBitAlt = 2; static const UInt32 kKeyModifierBitMeta = 3; static const UInt32 kKeyModifierBitSuper = 4; static const UInt32 kKeyModifierBitAltGr = 5; static const UInt32 kKeyModifierBitLevel5Lock = 6; static const UInt32 kKeyModifierBitCapsLock = 12; static const UInt32 kKeyModifierBitNumLock = 13; static const UInt32 kKeyModifierBitScrollLock = 14; static const SInt32 kKeyModifierNumBits = 16; //@} //! @name Modifier key identifiers //@{ static const KeyModifierID kKeyModifierIDNull = 0; static const KeyModifierID kKeyModifierIDShift = 1; static const KeyModifierID kKeyModifierIDControl = 2; static const KeyModifierID kKeyModifierIDAlt = 3; static const KeyModifierID kKeyModifierIDMeta = 4; static const KeyModifierID kKeyModifierIDSuper = 5; static const KeyModifierID kKeyModifierIDAltGr = 6; static const KeyModifierID kKeyModifierIDLast = 7; //@} //! @name Key identifiers //@{ // all identifiers except kKeyNone and those in 0xE000 to 0xE0FF // inclusive are equal to the corresponding X11 keysym - 0x1000. // no key static const KeyID kKeyNone = 0x0000; // TTY functions static const KeyID kKeyBackSpace = 0xEF08; /* back space, back char */ static const KeyID kKeyTab = 0xEF09; static const KeyID kKeyLinefeed = 0xEF0A; /* Linefeed, LF */ static const KeyID kKeyClear = 0xEF0B; static const KeyID kKeyReturn = 0xEF0D; /* Return, enter */ static const KeyID kKeyPause = 0xEF13; /* Pause, hold */ static const KeyID kKeyScrollLock = 0xEF14; static const KeyID kKeySysReq = 0xEF15; static const KeyID kKeyEscape = 0xEF1B; static const KeyID kKeyHenkan = 0xEF23; /* Start/Stop Conversion */ static const KeyID kKeyHangulKana = 0xEF26; /* Hangul, Kana */ static const KeyID kKeyHiraganaKatakana = 0xEF27; /* Hiragana/Katakana toggle */ static const KeyID kKeyZenkaku = 0xEF2A; /* Zenkaku/Hankaku */ static const KeyID kKeyHanjaKanzi = 0xEF2A; /* Hanja, Kanzi */ static const KeyID kKeyDelete = 0xEFFF; /* Delete, rubout */ // cursor control static const KeyID kKeyHome = 0xEF50; static const KeyID kKeyLeft = 0xEF51; /* Move left, left arrow */ static const KeyID kKeyUp = 0xEF52; /* Move up, up arrow */ static const KeyID kKeyRight = 0xEF53; /* Move right, right arrow */ static const KeyID kKeyDown = 0xEF54; /* Move down, down arrow */ static const KeyID kKeyPageUp = 0xEF55; static const KeyID kKeyPageDown = 0xEF56; static const KeyID kKeyEnd = 0xEF57; /* EOL */ static const KeyID kKeyBegin = 0xEF58; /* BOL */ // misc functions static const KeyID kKeySelect = 0xEF60; /* Select, mark */ static const KeyID kKeyPrint = 0xEF61; static const KeyID kKeyExecute = 0xEF62; /* Execute, run, do */ static const KeyID kKeyInsert = 0xEF63; /* Insert, insert here */ static const KeyID kKeyUndo = 0xEF65; /* Undo, oops */ static const KeyID kKeyRedo = 0xEF66; /* redo, again */ static const KeyID kKeyMenu = 0xEF67; static const KeyID kKeyFind = 0xEF68; /* Find, search */ static const KeyID kKeyCancel = 0xEF69; /* Cancel, stop, abort, exit */ static const KeyID kKeyHelp = 0xEF6A; /* Help */ static const KeyID kKeyBreak = 0xEF6B; static const KeyID kKeyAltGr = 0xEF7E; /* Character set switch */ static const KeyID kKeyNumLock = 0xEF7F; // keypad static const KeyID kKeyKP_Space = 0xEF80; /* space */ static const KeyID kKeyKP_Tab = 0xEF89; static const KeyID kKeyKP_Enter = 0xEF8D; /* enter */ static const KeyID kKeyKP_F1 = 0xEF91; /* PF1, KP_A, ... */ static const KeyID kKeyKP_F2 = 0xEF92; static const KeyID kKeyKP_F3 = 0xEF93; static const KeyID kKeyKP_F4 = 0xEF94; static const KeyID kKeyKP_Home = 0xEF95; static const KeyID kKeyKP_Left = 0xEF96; static const KeyID kKeyKP_Up = 0xEF97; static const KeyID kKeyKP_Right = 0xEF98; static const KeyID kKeyKP_Down = 0xEF99; static const KeyID kKeyKP_PageUp = 0xEF9A; static const KeyID kKeyKP_PageDown = 0xEF9B; static const KeyID kKeyKP_End = 0xEF9C; static const KeyID kKeyKP_Begin = 0xEF9D; static const KeyID kKeyKP_Insert = 0xEF9E; static const KeyID kKeyKP_Delete = 0xEF9F; static const KeyID kKeyKP_Equal = 0xEFBD; /* equals */ static const KeyID kKeyKP_Multiply = 0xEFAA; static const KeyID kKeyKP_Add = 0xEFAB; static const KeyID kKeyKP_Separator= 0xEFAC; /* separator, often comma */ static const KeyID kKeyKP_Subtract = 0xEFAD; static const KeyID kKeyKP_Decimal = 0xEFAE; static const KeyID kKeyKP_Divide = 0xEFAF; static const KeyID kKeyKP_0 = 0xEFB0; static const KeyID kKeyKP_1 = 0xEFB1; static const KeyID kKeyKP_2 = 0xEFB2; static const KeyID kKeyKP_3 = 0xEFB3; static const KeyID kKeyKP_4 = 0xEFB4; static const KeyID kKeyKP_5 = 0xEFB5; static const KeyID kKeyKP_6 = 0xEFB6; static const KeyID kKeyKP_7 = 0xEFB7; static const KeyID kKeyKP_8 = 0xEFB8; static const KeyID kKeyKP_9 = 0xEFB9; // function keys static const KeyID kKeyF1 = 0xEFBE; static const KeyID kKeyF2 = 0xEFBF; static const KeyID kKeyF3 = 0xEFC0; static const KeyID kKeyF4 = 0xEFC1; static const KeyID kKeyF5 = 0xEFC2; static const KeyID kKeyF6 = 0xEFC3; static const KeyID kKeyF7 = 0xEFC4; static const KeyID kKeyF8 = 0xEFC5; static const KeyID kKeyF9 = 0xEFC6; static const KeyID kKeyF10 = 0xEFC7; static const KeyID kKeyF11 = 0xEFC8; static const KeyID kKeyF12 = 0xEFC9; static const KeyID kKeyF13 = 0xEFCA; static const KeyID kKeyF14 = 0xEFCB; static const KeyID kKeyF15 = 0xEFCC; static const KeyID kKeyF16 = 0xEFCD; static const KeyID kKeyF17 = 0xEFCE; static const KeyID kKeyF18 = 0xEFCF; static const KeyID kKeyF19 = 0xEFD0; static const KeyID kKeyF20 = 0xEFD1; static const KeyID kKeyF21 = 0xEFD2; static const KeyID kKeyF22 = 0xEFD3; static const KeyID kKeyF23 = 0xEFD4; static const KeyID kKeyF24 = 0xEFD5; static const KeyID kKeyF25 = 0xEFD6; static const KeyID kKeyF26 = 0xEFD7; static const KeyID kKeyF27 = 0xEFD8; static const KeyID kKeyF28 = 0xEFD9; static const KeyID kKeyF29 = 0xEFDA; static const KeyID kKeyF30 = 0xEFDB; static const KeyID kKeyF31 = 0xEFDC; static const KeyID kKeyF32 = 0xEFDD; static const KeyID kKeyF33 = 0xEFDE; static const KeyID kKeyF34 = 0xEFDF; static const KeyID kKeyF35 = 0xEFE0; // modifiers static const KeyID kKeyShift_L = 0xEFE1; /* Left shift */ static const KeyID kKeyShift_R = 0xEFE2; /* Right shift */ static const KeyID kKeyControl_L = 0xEFE3; /* Left control */ static const KeyID kKeyControl_R = 0xEFE4; /* Right control */ static const KeyID kKeyCapsLock = 0xEFE5; /* Caps lock */ static const KeyID kKeyShiftLock = 0xEFE6; /* Shift lock */ static const KeyID kKeyMeta_L = 0xEFE7; /* Left meta */ static const KeyID kKeyMeta_R = 0xEFE8; /* Right meta */ static const KeyID kKeyAlt_L = 0xEFE9; /* Left alt */ static const KeyID kKeyAlt_R = 0xEFEA; /* Right alt */ static const KeyID kKeySuper_L = 0xEFEB; /* Left super */ static const KeyID kKeySuper_R = 0xEFEC; /* Right super */ static const KeyID kKeyHyper_L = 0xEFED; /* Left hyper */ static const KeyID kKeyHyper_R = 0xEFEE; /* Right hyper */ // multi-key character composition static const KeyID kKeyCompose = 0xEF20; static const KeyID kKeyDeadGrave = 0x0300; static const KeyID kKeyDeadAcute = 0x0301; static const KeyID kKeyDeadCircumflex = 0x0302; static const KeyID kKeyDeadTilde = 0x0303; static const KeyID kKeyDeadMacron = 0x0304; static const KeyID kKeyDeadBreve = 0x0306; static const KeyID kKeyDeadAbovedot = 0x0307; static const KeyID kKeyDeadDiaeresis = 0x0308; static const KeyID kKeyDeadAbovering = 0x030a; static const KeyID kKeyDeadDoubleacute = 0x030b; static const KeyID kKeyDeadCaron = 0x030c; static const KeyID kKeyDeadCedilla = 0x0327; static const KeyID kKeyDeadOgonek = 0x0328; // more function and modifier keys static const KeyID kKeyLeftTab = 0xEE20; // update modifiers static const KeyID kKeySetModifiers = 0xEE06; static const KeyID kKeyClearModifiers = 0xEE07; // group change static const KeyID kKeyNextGroup = 0xEE08; static const KeyID kKeyPrevGroup = 0xEE0A; // extended keys static const KeyID kKeyEject = 0xE001; static const KeyID kKeySleep = 0xE05F; static const KeyID kKeyWWWBack = 0xE0A6; static const KeyID kKeyWWWForward = 0xE0A7; static const KeyID kKeyWWWRefresh = 0xE0A8; static const KeyID kKeyWWWStop = 0xE0A9; static const KeyID kKeyWWWSearch = 0xE0AA; static const KeyID kKeyWWWFavorites = 0xE0AB; static const KeyID kKeyWWWHome = 0xE0AC; static const KeyID kKeyAudioMute = 0xE0AD; static const KeyID kKeyAudioDown = 0xE0AE; static const KeyID kKeyAudioUp = 0xE0AF; static const KeyID kKeyAudioNext = 0xE0B0; static const KeyID kKeyAudioPrev = 0xE0B1; static const KeyID kKeyAudioStop = 0xE0B2; static const KeyID kKeyAudioPlay = 0xE0B3; static const KeyID kKeyAppMail = 0xE0B4; static const KeyID kKeyAppMedia = 0xE0B5; static const KeyID kKeyAppUser1 = 0xE0B6; static const KeyID kKeyAppUser2 = 0xE0B7; //@} struct KeyNameMapEntry { public: const char* m_name; KeyID m_id; }; struct KeyModifierNameMapEntry { public: const char* m_name; KeyModifierMask m_mask; }; //! Key name to KeyID table /*! A table of key names to the corresponding KeyID. Only the keys listed above plus non-alphanumeric ASCII characters are in the table. The end of the table is the first pair with a NULL m_name. */ extern const KeyNameMapEntry kKeyNameMap[]; //! Modifier key name to KeyModifierMask table /*! A table of modifier key names to the corresponding KeyModifierMask. The end of the table is the first pair with a NULL m_name. */ extern const KeyModifierNameMapEntry kModifierNameMap[]; #endif synergy-1.4.12-Source/src/lib/synergy/MouseTypes.h0000600000175000017500000000225712021261364022035 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 MOUSETYPES_H #define MOUSETYPES_H #include "BasicTypes.h" //! Mouse button ID /*! Type to hold a mouse button identifier. */ typedef UInt8 ButtonID; //! @name Mouse button identifiers //@{ static const ButtonID kButtonNone = 0; static const ButtonID kButtonLeft = 1; static const ButtonID kButtonMiddle = 2; static const ButtonID kButtonRight = 3; static const ButtonID kButtonExtra0 = 4; //@} static const UInt8 NumButtonIDs = 5; #endif synergy-1.4.12-Source/src/lib/synergy/OptionTypes.h0000600000175000017500000000732112021261364022212 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 OPTIONTYPES_H #define OPTIONTYPES_H #include "BasicTypes.h" #include "stdvector.h" //! Option ID /*! Type to hold an option identifier. */ typedef UInt32 OptionID; //! Option Value /*! Type to hold an option value. */ typedef SInt32 OptionValue; // for now, options are just pairs of integers typedef std::vector COptionsList; // macro for packing 4 character strings into 4 byte integers #define OPTION_CODE(_s) \ (static_cast(static_cast(_s[0]) << 24) | \ static_cast(static_cast(_s[1]) << 16) | \ static_cast(static_cast(_s[2]) << 8) | \ static_cast(static_cast(_s[3]) )) //! @name Option identifiers //@{ static const OptionID kOptionHalfDuplexCapsLock = OPTION_CODE("HDCL"); static const OptionID kOptionHalfDuplexNumLock = OPTION_CODE("HDNL"); static const OptionID kOptionHalfDuplexScrollLock = OPTION_CODE("HDSL"); static const OptionID kOptionModifierMapForShift = OPTION_CODE("MMFS"); static const OptionID kOptionModifierMapForControl = OPTION_CODE("MMFC"); static const OptionID kOptionModifierMapForAlt = OPTION_CODE("MMFA"); static const OptionID kOptionModifierMapForAltGr = OPTION_CODE("MMFG"); static const OptionID kOptionModifierMapForMeta = OPTION_CODE("MMFM"); static const OptionID kOptionModifierMapForSuper = OPTION_CODE("MMFR"); static const OptionID kOptionHeartbeat = OPTION_CODE("HART"); static const OptionID kOptionScreenSwitchCorners = OPTION_CODE("SSCM"); static const OptionID kOptionScreenSwitchCornerSize = OPTION_CODE("SSCS"); static const OptionID kOptionScreenSwitchDelay = OPTION_CODE("SSWT"); static const OptionID kOptionScreenSwitchTwoTap = OPTION_CODE("SSTT"); static const OptionID kOptionScreenSwitchNeedsShift = OPTION_CODE("SSNS"); static const OptionID kOptionScreenSwitchNeedsControl = OPTION_CODE("SSNC"); static const OptionID kOptionScreenSwitchNeedsAlt = OPTION_CODE("SSNA"); static const OptionID kOptionScreenSaverSync = OPTION_CODE("SSVR"); static const OptionID kOptionXTestXineramaUnaware = OPTION_CODE("XTXU"); static const OptionID kOptionScreenPreserveFocus = OPTION_CODE("SFOC"); static const OptionID kOptionRelativeMouseMoves = OPTION_CODE("MDLT"); static const OptionID kOptionWin32KeepForeground = OPTION_CODE("_KFW"); //@} //! @name Screen switch corner enumeration //@{ enum EScreenSwitchCorners { kNoCorner, kTopLeft, kTopRight, kBottomLeft, kBottomRight, kFirstCorner = kTopLeft, kLastCorner = kBottomRight }; //@} //! @name Screen switch corner masks //@{ enum EScreenSwitchCornerMasks { kNoCornerMask = 0, kTopLeftMask = 1 << (kTopLeft - kFirstCorner), kTopRightMask = 1 << (kTopRight - kFirstCorner), kBottomLeftMask = 1 << (kBottomLeft - kFirstCorner), kBottomRightMask = 1 << (kBottomRight - kFirstCorner), kAllCornersMask = kTopLeftMask | kTopRightMask | kBottomLeftMask | kBottomRightMask }; //@} #undef OPTION_CODE #endif synergy-1.4.12-Source/src/lib/synergy/ProtocolTypes.cpp0000600000175000017500000000471512131062123023074 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "ProtocolTypes.h" const char* kMsgHello = "Synergy%2i%2i"; const char* kMsgHelloBack = "Synergy%2i%2i%s"; const char* kMsgCNoop = "CNOP"; const char* kMsgCClose = "CBYE"; const char* kMsgCEnter = "CINN%2i%2i%4i%2i"; const char* kMsgCLeave = "COUT"; const char* kMsgCClipboard = "CCLP%1i%4i"; const char* kMsgCScreenSaver = "CSEC%1i"; const char* kMsgCResetOptions = "CROP"; const char* kMsgCInfoAck = "CIAK"; const char* kMsgCKeepAlive = "CALV"; const char* kMsgCGameTimingReq = "CGRQ"; const char* kMsgCGameTimingResp = "CGRS%2i"; const char* kMsgDKeyDown = "DKDN%2i%2i%2i"; const char* kMsgDKeyDown1_0 = "DKDN%2i%2i"; const char* kMsgDKeyRepeat = "DKRP%2i%2i%2i%2i"; const char* kMsgDKeyRepeat1_0 = "DKRP%2i%2i%2i"; const char* kMsgDKeyUp = "DKUP%2i%2i%2i"; const char* kMsgDKeyUp1_0 = "DKUP%2i%2i"; const char* kMsgDMouseDown = "DMDN%1i"; const char* kMsgDMouseUp = "DMUP%1i"; const char* kMsgDMouseMove = "DMMV%2i%2i"; const char* kMsgDMouseRelMove = "DMRM%2i%2i"; const char* kMsgDMouseWheel = "DMWM%2i%2i"; const char* kMsgDMouseWheel1_0 = "DMWM%2i"; const char* kMsgDClipboard = "DCLP%1i%4i%s"; const char* kMsgDInfo = "DINF%2i%2i%2i%2i%2i%2i%2i"; const char* kMsgDSetOptions = "DSOP%4I"; const char* kMsgDGameButtons = "DGBT%1i%2i"; const char* kMsgDGameSticks = "DGST%1i%2i%2i%2i%2i"; const char* kMsgDGameTriggers = "DGTR%1i%1i%1i"; const char* kMsgDGameFeedback = "DGFB%1i%2i%2i"; const char* kMsgDCryptoIv = "DCIV%s"; const char* kMsgQInfo = "QINF"; const char* kMsgEIncompatible = "EICV%2i%2i"; const char* kMsgEBusy = "EBSY"; const char* kMsgEUnknown = "EUNK"; const char* kMsgEBad = "EBAD"; synergy-1.4.12-Source/src/lib/synergy/ProtocolTypes.h0000600000175000017500000002620612131062123022540 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 PROTOCOLTYPES_H #define PROTOCOLTYPES_H #include "BasicTypes.h" // protocol version number // 1.0: initial protocol // 1.1: adds KeyCode to key press, release, and repeat // 1.2: adds mouse relative motion // 1.3: adds keep alive and deprecates heartbeats, // adds horizontal mouse scrolling // 1.4: adds game device support static const SInt16 kProtocolMajorVersion = 1; static const SInt16 kProtocolMinorVersion = 4; // default contact port number static const UInt16 kDefaultPort = 24800; // maximum total length for greeting returned by client static const UInt32 kMaxHelloLength = 1024; // time between kMsgCKeepAlive (in seconds). a non-positive value disables // keep alives. this is the default rate that can be overridden using an // option. static const double kKeepAliveRate = 3.0; // number of skipped kMsgCKeepAlive messages that indicates a problem static const double kKeepAlivesUntilDeath = 3.0; // obsolete heartbeat stuff static const double kHeartRate = -1.0; static const double kHeartBeatsUntilDeath = 3.0; // direction constants enum EDirection { kNoDirection, kLeft, kRight, kTop, kBottom, kFirstDirection = kLeft, kLastDirection = kBottom, kNumDirections = kLastDirection - kFirstDirection + 1 }; enum EDirectionMask { kNoDirMask = 0, kLeftMask = 1 << kLeft, kRightMask = 1 << kRight, kTopMask = 1 << kTop, kBottomMask = 1 << kBottom }; // // message codes (trailing NUL is not part of code). in comments, $n // refers to the n'th argument (counting from one). message codes are // always 4 bytes optionally followed by message specific parameters // except those for the greeting handshake. // // // positions and sizes are signed 16 bit integers. // // // greeting handshake messages // // say hello to client; primary -> secondary // $1 = protocol major version number supported by server. $2 = // protocol minor version number supported by server. extern const char* kMsgHello; // respond to hello from server; secondary -> primary // $1 = protocol major version number supported by client. $2 = // protocol minor version number supported by client. $3 = client // name. extern const char* kMsgHelloBack; // // command codes // // no operation; secondary -> primary extern const char* kMsgCNoop; // close connection; primary -> secondary extern const char* kMsgCClose; // enter screen: primary -> secondary // entering screen at screen position $1 = x, $2 = y. x,y are // absolute screen coordinates. $3 = sequence number, which is // used to order messages between screens. the secondary screen // must return this number with some messages. $4 = modifier key // mask. this will have bits set for each toggle modifier key // that is activated on entry to the screen. the secondary screen // should adjust its toggle modifiers to reflect that state. extern const char* kMsgCEnter; // leave screen: primary -> secondary // leaving screen. the secondary screen should send clipboard // data in response to this message for those clipboards that // it has grabbed (i.e. has sent a kMsgCClipboard for and has // not received a kMsgCClipboard for with a greater sequence // number) and that were grabbed or have changed since the // last leave. extern const char* kMsgCLeave; // grab clipboard: primary <-> secondary // sent by screen when some other app on that screen grabs a // clipboard. $1 = the clipboard identifier, $2 = sequence number. // secondary screens must use the sequence number passed in the // most recent kMsgCEnter. the primary always sends 0. extern const char* kMsgCClipboard; // screensaver change: primary -> secondary // screensaver on primary has started ($1 == 1) or closed ($1 == 0) extern const char* kMsgCScreenSaver; // reset options: primary -> secondary // client should reset all of its options to their defaults. extern const char* kMsgCResetOptions; // resolution change acknowledgment: primary -> secondary // sent by primary in response to a secondary screen's kMsgDInfo. // this is sent for every kMsgDInfo, whether or not the primary // had sent a kMsgQInfo. extern const char* kMsgCInfoAck; // keep connection alive: primary <-> secondary // sent by the server periodically to verify that connections are still // up and running. clients must reply in kind on receipt. if the server // gets an error sending the message or does not receive a reply within // a reasonable time then the server disconnects the client. if the // client doesn't receive these (or any message) periodically then it // should disconnect from the server. the appropriate interval is // defined by an option. extern const char* kMsgCKeepAlive; // game device timing: primary -> secondary // periodically, sent from primary to secondary when game device device is polled. // this causes a game timing response to be queued, which is dequeued when // the device is next faked. extern const char* kMsgCGameTimingReq; // game device timing: primary <- secondary // in response, sent from secondary to primary when game device device is faked. // the difference between when the message was sent and received is a // measurement of time it took for the game device device state to reach the // game device device user. a timing request is not retransmitted until after // the pending timing response is received. extern const char* kMsgCGameTimingResp; // // data codes // // key pressed: primary -> secondary // $1 = KeyID, $2 = KeyModifierMask, $3 = KeyButton // the KeyButton identifies the physical key on the primary used to // generate this key. the secondary should note the KeyButton along // with the physical key it uses to generate the key press. on // release, the secondary can then use the primary's KeyButton to // find its corresponding physical key and release it. this is // necessary because the KeyID on release may not be the KeyID of // the press. this can happen with combining (dead) keys or if // the keyboard layouts are not identical and the user releases // a modifier key before releasing the modified key. extern const char* kMsgDKeyDown; // key pressed 1.0: same as above but without KeyButton extern const char* kMsgDKeyDown1_0; // key auto-repeat: primary -> secondary // $1 = KeyID, $2 = KeyModifierMask, $3 = number of repeats, $4 = KeyButton extern const char* kMsgDKeyRepeat; // key auto-repeat 1.0: same as above but without KeyButton extern const char* kMsgDKeyRepeat1_0; // key released: primary -> secondary // $1 = KeyID, $2 = KeyModifierMask, $3 = KeyButton extern const char* kMsgDKeyUp; // key released 1.0: same as above but without KeyButton extern const char* kMsgDKeyUp1_0; // mouse button pressed: primary -> secondary // $1 = ButtonID extern const char* kMsgDMouseDown; // mouse button released: primary -> secondary // $1 = ButtonID extern const char* kMsgDMouseUp; // mouse moved: primary -> secondary // $1 = x, $2 = y. x,y are absolute screen coordinates. extern const char* kMsgDMouseMove; // relative mouse move: primary -> secondary // $1 = dx, $2 = dy. dx,dy are motion deltas. extern const char* kMsgDMouseRelMove; // mouse scroll: primary -> secondary // $1 = xDelta, $2 = yDelta. the delta should be +120 for one tick forward // (away from the user) or right and -120 for one tick backward (toward // the user) or left. extern const char* kMsgDMouseWheel; // mouse vertical scroll: primary -> secondary // like as kMsgDMouseWheel except only sends $1 = yDelta. extern const char* kMsgDMouseWheel1_0; // game device buttons: primary -> secondary // $1 = device id // $2 = buttons bit mask extern const char* kMsgDGameButtons; // game device sticks: primary -> secondary // $1 = device id // $2 = x1 // $3 = y1 // $4 = x2 // $5 = y2 extern const char* kMsgDGameSticks; // game device triggers: primary -> secondary // $1 = device id // $2 = t1 // $3 = t2 extern const char* kMsgDGameTriggers; // game device feedback: secondary -> primary // $1 = device id // $2 = motor 1 // $3 = motor 2 extern const char* kMsgDGameFeedback; // clipboard data: primary <-> secondary // $2 = sequence number, $3 = clipboard data. the sequence number // is 0 when sent by the primary. secondary screens should use the // sequence number from the most recent kMsgCEnter. $1 = clipboard // identifier. extern const char* kMsgDClipboard; // client data: secondary -> primary // $1 = coordinate of leftmost pixel on secondary screen, // $2 = coordinate of topmost pixel on secondary screen, // $3 = width of secondary screen in pixels, // $4 = height of secondary screen in pixels, // $5 = size of warp zone, (obsolete) // $6, $7 = the x,y position of the mouse on the secondary screen. // // the secondary screen must send this message in response to the // kMsgQInfo message. it must also send this message when the // screen's resolution changes. in this case, the secondary screen // should ignore any kMsgDMouseMove messages until it receives a // kMsgCInfoAck in order to prevent attempts to move the mouse off // the new screen area. extern const char* kMsgDInfo; // set options: primary -> secondary // client should set the given option/value pairs. $1 = option/value // pairs. extern const char* kMsgDSetOptions; // crypto iv: primary -> secondary // sends a new iv (initialization vector) to the client for the // cryptography stream. extern const char* kMsgDCryptoIv; // // query codes // // query screen info: primary -> secondary // client should reply with a kMsgDInfo. extern const char* kMsgQInfo; // // error codes // // incompatible versions: primary -> secondary // $1 = major version of primary, $2 = minor version of primary. extern const char* kMsgEIncompatible; // name provided when connecting is already in use: primary -> secondary extern const char* kMsgEBusy; // unknown client: primary -> secondary // name provided when connecting is not in primary's screen // configuration map. extern const char* kMsgEUnknown; // protocol violation: primary -> secondary // primary should disconnect after sending this message. extern const char* kMsgEBad; // // structures // //! Screen information /*! This class contains information about a screen. */ class CClientInfo { public: //! Screen position /*! The position of the upper-left corner of the screen. This is typically 0,0. */ SInt32 m_x, m_y; //! Screen size /*! The size of the screen in pixels. */ SInt32 m_w, m_h; //! Obsolete (jump zone size) SInt32 obsolete1; //! Mouse position /*! The current location of the mouse cursor. */ SInt32 m_mx, m_my; }; #endif synergy-1.4.12-Source/src/lib/synergy/XScreen.cpp0000600000175000017500000000261112021261364021614 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XScreen.h" // // XScreenOpenFailure // CString XScreenOpenFailure::getWhat() const throw() { return format("XScreenOpenFailure", "unable to open screen"); } // // XScreenXInputFailure // CString XScreenXInputFailure::getWhat() const throw() { return ""; } // // XScreenUnavailable // XScreenUnavailable::XScreenUnavailable(double timeUntilRetry) : m_timeUntilRetry(timeUntilRetry) { // do nothing } XScreenUnavailable::~XScreenUnavailable() { // do nothing } double XScreenUnavailable::getRetryTime() const { return m_timeUntilRetry; } CString XScreenUnavailable::getWhat() const throw() { return format("XScreenUnavailable", "unable to open screen"); } synergy-1.4.12-Source/src/lib/synergy/XScreen.h0000600000175000017500000000335712021261364021271 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XSCREEN_H #define XSCREEN_H #include "XBase.h" //! Generic screen exception XBASE_SUBCLASS(XScreen, XBase); //! Cannot open screen exception /*! Thrown when a screen cannot be opened or initialized. */ XBASE_SUBCLASS_WHAT(XScreenOpenFailure, XScreen); //! XInput exception /*! Thrown when an XInput error occurs */ XBASE_SUBCLASS_WHAT(XScreenXInputFailure, XScreen); //! Screen unavailable exception /*! Thrown when a screen cannot be opened or initialized but retrying later may be successful. */ class XScreenUnavailable : public XScreenOpenFailure { public: /*! \c timeUntilRetry is the suggested time the caller should wait until trying to open the screen again. */ XScreenUnavailable(double timeUntilRetry); virtual ~XScreenUnavailable(); //! @name manipulators //@{ //! Get retry time /*! Returns the suggested time to wait until retrying to open the screen. */ double getRetryTime() const; //@} protected: virtual CString getWhat() const throw(); private: double m_timeUntilRetry; }; #endif synergy-1.4.12-Source/src/lib/synergy/XSynergy.cpp0000600000175000017500000000461112131402061022030 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "XSynergy.h" #include "CStringUtil.h" // // XBadClient // CString XBadClient::getWhat() const throw() { return "XBadClient"; } // // XBadCryptoMode // CString XBadCryptoMode::getWhat() const throw() { return "XBadCryptoMode"; } // // XIncompatibleClient // XIncompatibleClient::XIncompatibleClient(int major, int minor) : m_major(major), m_minor(minor) { // do nothing } int XIncompatibleClient::getMajor() const throw() { return m_major; } int XIncompatibleClient::getMinor() const throw() { return m_minor; } CString XIncompatibleClient::getWhat() const throw() { return format("XIncompatibleClient", "incompatible client %{1}.%{2}", CStringUtil::print("%d", m_major).c_str(), CStringUtil::print("%d", m_minor).c_str()); } // // XDuplicateClient // XDuplicateClient::XDuplicateClient(const CString& name) : m_name(name) { // do nothing } const CString& XDuplicateClient::getName() const throw() { return m_name; } CString XDuplicateClient::getWhat() const throw() { return format("XDuplicateClient", "duplicate client %{1}", m_name.c_str()); } // // XUnknownClient // XUnknownClient::XUnknownClient(const CString& name) : m_name(name) { // do nothing } const CString& XUnknownClient::getName() const throw() { return m_name; } CString XUnknownClient::getWhat() const throw() { return format("XUnknownClient", "unknown client %{1}", m_name.c_str()); } // // XExitApp // XExitApp::XExitApp(int code) : m_code(code) { // do nothing } int XExitApp::getCode() const throw() { return m_code; } CString XExitApp::getWhat() const throw() { return format( "XExitApp", "exiting with code %{1}", CStringUtil::print("%d", m_code).c_str()); } synergy-1.4.12-Source/src/lib/synergy/XSynergy.h0000600000175000017500000000550512131402061021500 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2002 Chris Schoeneman * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 XSYNERGY_H #define XSYNERGY_H #include "XBase.h" //! Generic synergy exception XBASE_SUBCLASS(XSynergy, XBase); //! Client error exception /*! Thrown when the client fails to follow the protocol. */ XBASE_SUBCLASS_WHAT(XBadClient, XSynergy); //! Bad crypto mode /*! Thrown when the user enters an invalid crypto mode. */ XBASE_SUBCLASS_WHAT(XBadCryptoMode, XSynergy); //! Incompatible client exception /*! Thrown when a client attempting to connect has an incompatible version. */ class XIncompatibleClient : public XSynergy { public: XIncompatibleClient(int major, int minor); //! @name accessors //@{ //! Get client's major version number int getMajor() const throw(); //! Get client's minor version number int getMinor() const throw(); //@} protected: virtual CString getWhat() const throw(); private: int m_major; int m_minor; }; //! Client already connected exception /*! Thrown when a client attempting to connect is using the same name as a client that is already connected. */ class XDuplicateClient : public XSynergy { public: XDuplicateClient(const CString& name); //! @name accessors //@{ //! Get client's name virtual const CString& getName() const throw(); //@} protected: virtual CString getWhat() const throw(); private: CString m_name; }; //! Client not in map exception /*! Thrown when a client attempting to connect is using a name that is unknown to the server. */ class XUnknownClient : public XSynergy { public: XUnknownClient(const CString& name); //! @name accessors //@{ //! Get the client's name virtual const CString& getName() const throw(); //@} protected: virtual CString getWhat() const throw(); private: CString m_name; }; //! Generic exit eception /*! Thrown when we want to abort, with the opportunity to clean up. This is a little bit of a hack, but it's a better way of exiting, than just calling exit(int). */ class XExitApp : public XSynergy { public: XExitApp(int code); //! Get the exit code int getCode() const throw(); protected: virtual CString getWhat() const throw(); private: int m_code; }; #endif synergy-1.4.12-Source/src/micro/0000700000175000017500000000000012140644175016411 5ustar synergysynergysynergy-1.4.12-Source/src/micro/CMakeLists.txt0000600000175000017500000000145512021261364021151 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2012 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src uSynergy.c ) if (WIN32) list(APPEND src uSynergy.h) endif() add_library(micro STATIC ${src}) synergy-1.4.12-Source/src/micro/COPYING.zlib0000600000175000017500000000170011777061705020412 0ustar synergysynergyuSynergy client -- Implementation for the embedded Synergy client library Copyright (c) 2012 Alex Evans This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. synergy-1.4.12-Source/src/micro/uSynergy.c0000600000175000017500000004475512131276042020415 0ustar synergysynergy/* uSynergy client -- Implementation for the embedded Synergy client library version 1.0.0, July 7th, 2012 Copyright (c) 2012 Alex Evans This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ #include "uSynergy.h" #include #include //--------------------------------------------------------------------------------------------------------------------- // Internal helpers //--------------------------------------------------------------------------------------------------------------------- /** @brief Read 16 bit integer in network byte order and convert to native byte order **/ static int16_t sNetToNative16(const unsigned char *value) { #ifdef USYNERGY_LITTLE_ENDIAN return value[1] | (value[0] << 8); #else return value[0] | (value[1] << 8); #endif } /** @brief Read 32 bit integer in network byte order and convert to native byte order **/ static int32_t sNetToNative32(const unsigned char *value) { #ifdef USYNERGY_LITTLE_ENDIAN return value[3] | (value[2] << 8) | (value[1] << 16) | (value[0] << 24); #else return value[0] | (value[1] << 8) | (value[2] << 16) | (value[3] << 24); #endif } /** @brief Trace text to client **/ static void sTrace(uSynergyContext *context, const char* text) { // Don't trace if we don't have a trace function if (context->m_traceFunc != 0L) context->m_traceFunc(context->m_cookie, text); } /** @brief Add string to reply packet **/ static void sAddString(uSynergyContext *context, const char *string) { size_t len = strlen(string); memcpy(context->m_replyCur, string, len); context->m_replyCur += len; } /** @brief Add uint8 to reply packet **/ static void sAddUInt8(uSynergyContext *context, uint8_t value) { *context->m_replyCur++ = value; } /** @brief Add uint16 to reply packet **/ static void sAddUInt16(uSynergyContext *context, uint16_t value) { uint8_t *reply = context->m_replyCur; *reply++ = (uint8_t)(value >> 8); *reply++ = (uint8_t)value; context->m_replyCur = reply; } /** @brief Add uint32 to reply packet **/ static void sAddUInt32(uSynergyContext *context, uint32_t value) { uint8_t *reply = context->m_replyCur; *reply++ = (uint8_t)(value >> 24); *reply++ = (uint8_t)(value >> 16); *reply++ = (uint8_t)(value >> 8); *reply++ = (uint8_t)value; context->m_replyCur = reply; } /** @brief Send reply packet **/ static uSynergyBool sSendReply(uSynergyContext *context) { // Set header size uint8_t *reply_buf = context->m_replyBuffer; uint32_t reply_len = (uint32_t)(context->m_replyCur - reply_buf); /* Total size of reply */ uint32_t body_len = reply_len - 4; /* Size of body */ uSynergyBool ret; reply_buf[0] = (uint8_t)(body_len >> 24); reply_buf[1] = (uint8_t)(body_len >> 16); reply_buf[2] = (uint8_t)(body_len >> 8); reply_buf[3] = (uint8_t)body_len; // Send reply ret = context->m_sendFunc(context->m_cookie, context->m_replyBuffer, reply_len); // Reset reply buffer write pointer context->m_replyCur = context->m_replyBuffer+4; return ret; } /** @brief Call mouse callback after a mouse event **/ static void sSendMouseCallback(uSynergyContext *context) { // Skip if no callback is installed if (context->m_mouseCallback == 0L) return; // Send callback context->m_mouseCallback(context->m_cookie, context->m_mouseX, context->m_mouseY, context->m_mouseWheelX, context->m_mouseWheelY, context->m_mouseButtonLeft, context->m_mouseButtonRight, context->m_mouseButtonMiddle); } /** @brief Send keyboard callback when a key has been pressed or released **/ static void sSendKeyboardCallback(uSynergyContext *context, uint16_t key, uint16_t modifiers, uSynergyBool down, uSynergyBool repeat) { // Skip if no callback is installed if (context->m_keyboardCallback == 0L) return; // Send callback context->m_keyboardCallback(context->m_cookie, key, modifiers, down, repeat); } /** @brief Send joystick callback **/ static void sSendJoystickCallback(uSynergyContext *context, uint8_t joyNum) { int8_t *sticks; // Skip if no callback is installed if (context->m_joystickCallback == 0L) return; // Send callback sticks = context->m_joystickSticks[joyNum]; context->m_joystickCallback(context->m_cookie, joyNum, context->m_joystickButtons[joyNum], sticks[0], sticks[1], sticks[2], sticks[3]); } /** @brief Parse a single client message, update state, send callbacks and send replies **/ #define USYNERGY_IS_PACKET(pkt_id) memcmp(message+4, pkt_id, 4)==0 static void sProcessMessage(uSynergyContext *context, const uint8_t *message) { // We have a packet! if (memcmp(message+4, "Synergy", 7)==0) { // Welcome message // kMsgHello = "Synergy%2i%2i" // kMsgHelloBack = "Synergy%2i%2i%s" sAddString(context, "Synergy"); sAddUInt16(context, USYNERGY_PROTOCOL_MAJOR); sAddUInt16(context, USYNERGY_PROTOCOL_MINOR); sAddUInt32(context, (uint32_t)strlen(context->m_clientName)); sAddString(context, context->m_clientName); if (!sSendReply(context)) { // Send reply failed, let's try to reconnect sTrace(context, "SendReply failed, trying to reconnect in a second"); context->m_connected = USYNERGY_FALSE; context->m_sleepFunc(context->m_cookie, 1000); } else { // Let's assume we're connected char buffer[256+1]; sprintf(buffer, "Connected as client \"%s\"", context->m_clientName); sTrace(context, buffer); context->m_hasReceivedHello = USYNERGY_TRUE; } return; } else if (USYNERGY_IS_PACKET("QINF")) { // Screen info. Reply with DINF // kMsgQInfo = "QINF" // kMsgDInfo = "DINF%2i%2i%2i%2i%2i%2i%2i" uint16_t x = 0, y = 0, warp = 0; sAddString(context, "DINF"); sAddUInt16(context, x); sAddUInt16(context, y); sAddUInt16(context, context->m_clientWidth); sAddUInt16(context, context->m_clientHeight); sAddUInt16(context, warp); sAddUInt16(context, 0); // mx? sAddUInt16(context, 0); // my? sSendReply(context); return; } else if (USYNERGY_IS_PACKET("CIAK")) { // Do nothing? // kMsgCInfoAck = "CIAK" return; } else if (USYNERGY_IS_PACKET("CROP")) { // Do nothing? // kMsgCResetOptions = "CROP" return; } else if (USYNERGY_IS_PACKET("CINN")) { // Screen enter. Reply with CNOP // kMsgCEnter = "CINN%2i%2i%4i%2i" // Obtain the Synergy sequence number context->m_sequenceNumber = sNetToNative32(message + 12); context->m_isCaptured = USYNERGY_TRUE; // Call callback if (context->m_screenActiveCallback != 0L) context->m_screenActiveCallback(context->m_cookie, USYNERGY_TRUE); } else if (USYNERGY_IS_PACKET("COUT")) { // Screen leave // kMsgCLeave = "COUT" context->m_isCaptured = USYNERGY_FALSE; // Call callback if (context->m_screenActiveCallback != 0L) context->m_screenActiveCallback(context->m_cookie, USYNERGY_FALSE); } else if (USYNERGY_IS_PACKET("DMDN")) { // Mouse down // kMsgDMouseDown = "DMDN%1i" char btn = message[8]-1; if (btn==2) context->m_mouseButtonRight = USYNERGY_TRUE; else if (btn==1) context->m_mouseButtonMiddle = USYNERGY_TRUE; else context->m_mouseButtonLeft = USYNERGY_TRUE; sSendMouseCallback(context); } else if (USYNERGY_IS_PACKET("DMUP")) { // Mouse up // kMsgDMouseUp = "DMUP%1i" char btn = message[8]-1; if (btn==2) context->m_mouseButtonRight = USYNERGY_FALSE; else if (btn==1) context->m_mouseButtonMiddle = USYNERGY_FALSE; else context->m_mouseButtonLeft = USYNERGY_FALSE; sSendMouseCallback(context); } else if (USYNERGY_IS_PACKET("DMMV")) { // Mouse move. Reply with CNOP // kMsgDMouseMove = "DMMV%2i%2i" context->m_mouseX = sNetToNative16(message+8); context->m_mouseY = sNetToNative16(message+10); sSendMouseCallback(context); } else if (USYNERGY_IS_PACKET("DMWM")) { // Mouse wheel // kMsgDMouseWheel = "DMWM%2i%2i" // kMsgDMouseWheel1_0 = "DMWM%2i" context->m_mouseWheelX += sNetToNative16(message+8); context->m_mouseWheelY += sNetToNative16(message+10); sSendMouseCallback(context); } else if (USYNERGY_IS_PACKET("DKDN")) { // Key down // kMsgDKeyDown = "DKDN%2i%2i%2i" // kMsgDKeyDown1_0 = "DKDN%2i%2i" //uint16_t id = sNetToNative16(message+8); uint16_t mod = sNetToNative16(message+10); uint16_t key = sNetToNative16(message+12); sSendKeyboardCallback(context, key, mod, USYNERGY_TRUE, USYNERGY_FALSE); } else if (USYNERGY_IS_PACKET("DKRP")) { // Key repeat // kMsgDKeyRepeat = "DKRP%2i%2i%2i%2i" // kMsgDKeyRepeat1_0 = "DKRP%2i%2i%2i" uint16_t mod = sNetToNative16(message+10); // uint16_t count = sNetToNative16(message+12); uint16_t key = sNetToNative16(message+14); sSendKeyboardCallback(context, key, mod, USYNERGY_TRUE, USYNERGY_TRUE); } else if (USYNERGY_IS_PACKET("DKUP")) { // Key up // kMsgDKeyUp = "DKUP%2i%2i%2i" // kMsgDKeyUp1_0 = "DKUP%2i%2i" //uint16 id=Endian::sNetToNative(sbuf[4]); uint16_t mod = sNetToNative16(message+10); uint16_t key = sNetToNative16(message+12); sSendKeyboardCallback(context, key, mod, USYNERGY_FALSE, USYNERGY_FALSE); } else if (USYNERGY_IS_PACKET("DGBT")) { // Joystick buttons // kMsgDGameButtons = "DGBT%1i%2i"; uint8_t joy_num = message[8]; if (joy_numm_joystickButtons[joy_num] = (message[9] << 8) | message[10]; sSendJoystickCallback(context, joy_num); } } else if (USYNERGY_IS_PACKET("DGST")) { // Joystick sticks // kMsgDGameSticks = "DGST%1i%1i%1i%1i%1i"; uint8_t joy_num = message[8]; if (joy_numm_joystickSticks[joy_num], message+9, 4); sSendJoystickCallback(context, joy_num); } } else if (USYNERGY_IS_PACKET("DSOP")) { // Set options // kMsgDSetOptions = "DSOP%4I" } else if (USYNERGY_IS_PACKET("CALV")) { // Keepalive, reply with CALV and then CNOP // kMsgCKeepAlive = "CALV" sAddString(context, "CALV"); sSendReply(context); // now reply with CNOP } else if (USYNERGY_IS_PACKET("DCLP")) { // Clipboard message // kMsgDClipboard = "DCLP%1i%4i%s" // // The clipboard message contains: // 1 uint32: The size of the message // 4 chars: The identifier ("DCLP") // 1 uint8: The clipboard index // 1 uint32: The sequence number. It's zero, because this message is always coming from the server? // 1 uint32: The total size of the remaining 'string' (as per the Synergy %s string format (which is 1 uint32 for size followed by a char buffer (not necessarily null terminated)). // 1 uint32: The number of formats present in the message // And then 'number of formats' times the following: // 1 uint32: The format of the clipboard data // 1 uint32: The size n of the clipboard data // n uint8: The clipboard data const uint8_t * parse_msg = message+17; uint32_t num_formats = sNetToNative32(parse_msg); parse_msg += 4; for (; num_formats; num_formats--) { // Parse clipboard format header uint32_t format = sNetToNative32(parse_msg); uint32_t size = sNetToNative32(parse_msg+4); parse_msg += 8; // Call callback if (context->m_clipboardCallback) context->m_clipboardCallback(context->m_cookie, format, parse_msg, size); parse_msg += size; } } else { // Unknown packet, could be any of these // kMsgCNoop = "CNOP" // kMsgCClose = "CBYE" // kMsgCClipboard = "CCLP%1i%4i" // kMsgCScreenSaver = "CSEC%1i" // kMsgDKeyRepeat = "DKRP%2i%2i%2i%2i" // kMsgDKeyRepeat1_0 = "DKRP%2i%2i%2i" // kMsgDMouseRelMove = "DMRM%2i%2i" // kMsgEIncompatible = "EICV%2i%2i" // kMsgEBusy = "EBSY" // kMsgEUnknown = "EUNK" // kMsgEBad = "EBAD" char buffer[64]; sprintf(buffer, "Unknown packet '%c%c%c%c'", message[4], message[5], message[6], message[7]); sTrace(context, buffer); return; } // Reply with CNOP maybe? sAddString(context, "CNOP"); sSendReply(context); } #undef USYNERGY_IS_PACKET /** @brief Mark context as being disconnected **/ static void sSetDisconnected(uSynergyContext *context) { context->m_connected = USYNERGY_FALSE; context->m_hasReceivedHello = USYNERGY_FALSE; context->m_isCaptured = USYNERGY_FALSE; context->m_replyCur = context->m_replyBuffer + 4; context->m_sequenceNumber = 0; } /** @brief Update a connected context **/ static void sUpdateContext(uSynergyContext *context) { /* Receive data (blocking) */ int receive_size = USYNERGY_RECEIVE_BUFFER_SIZE - context->m_receiveOfs; int num_received = 0; int packlen = 0; if (context->m_receiveFunc(context->m_cookie, context->m_receiveBuffer + context->m_receiveOfs, receive_size, &num_received) == USYNERGY_FALSE) { /* Receive failed, let's try to reconnect */ char buffer[128]; sprintf(buffer, "Receive failed (%d bytes asked, %d bytes received), trying to reconnect in a second", receive_size, num_received); sTrace(context, buffer); sSetDisconnected(context); context->m_sleepFunc(context->m_cookie, 1000); return; } context->m_receiveOfs += num_received; /* If we didn't receive any data then we're probably still polling to get connected and therefore not getting any data back. To avoid overloading the system with a Synergy thread that would hammer on polling, we let it rest for a bit if there's no data. */ if (num_received == 0) context->m_sleepFunc(context->m_cookie, 500); /* Check for timeouts */ if (context->m_hasReceivedHello) { uint32_t cur_time = context->m_getTimeFunc(); if (num_received == 0) { /* Timeout after 2 secs of inactivity (we received no CALV) */ if ((cur_time - context->m_lastMessageTime) > USYNERGY_IDLE_TIMEOUT) sSetDisconnected(context); } else context->m_lastMessageTime = cur_time; } /* Eat packets */ for (;;) { /* Grab packet length and bail out if the packet goes beyond the end of the buffer */ packlen = sNetToNative32(context->m_receiveBuffer); if (packlen+4 > context->m_receiveOfs) break; /* Process message */ sProcessMessage(context, context->m_receiveBuffer); /* Move packet to front of buffer */ memmove(context->m_receiveBuffer, context->m_receiveBuffer+packlen+4, context->m_receiveOfs-packlen-4); context->m_receiveOfs -= packlen+4; } /* Throw away over-sized packets */ if (packlen > USYNERGY_RECEIVE_BUFFER_SIZE) { /* Oversized packet, ditch tail end */ char buffer[128]; sprintf(buffer, "Oversized packet: '%c%c%c%c' (length %d)", context->m_receiveBuffer[4], context->m_receiveBuffer[5], context->m_receiveBuffer[6], context->m_receiveBuffer[7], packlen); sTrace(context, buffer); num_received = context->m_receiveOfs-4; // 4 bytes for the size field while (num_received != packlen) { int buffer_left = packlen - num_received; int to_receive = buffer_left < USYNERGY_RECEIVE_BUFFER_SIZE ? buffer_left : USYNERGY_RECEIVE_BUFFER_SIZE; int ditch_received = 0; if (context->m_receiveFunc(context->m_cookie, context->m_receiveBuffer, to_receive, &ditch_received) == USYNERGY_FALSE) { /* Receive failed, let's try to reconnect */ sTrace(context, "Receive failed, trying to reconnect in a second"); sSetDisconnected(context); context->m_sleepFunc(context->m_cookie, 1000); break; } else { num_received += ditch_received; } } context->m_receiveOfs = 0; } } //--------------------------------------------------------------------------------------------------------------------- // Public interface //--------------------------------------------------------------------------------------------------------------------- /** @brief Initialize uSynergy context **/ void uSynergyInit(uSynergyContext *context) { /* Zero memory */ memset(context, 0, sizeof(uSynergyContext)); /* Initialize to default state */ sSetDisconnected(context); } /** @brief Update uSynergy **/ void uSynergyUpdate(uSynergyContext *context) { if (context->m_connected) { /* Update context, receive data, call callbacks */ sUpdateContext(context); } else { /* Try to connect */ if (context->m_connectFunc(context->m_cookie)) context->m_connected = USYNERGY_TRUE; } } /** @brief Send clipboard data **/ void uSynergySendClipboard(uSynergyContext *context, const char *text) { // Calculate maximum size that will fit in a reply packet uint32_t overhead_size = 4 + /* Message size */ 4 + /* Message ID */ 1 + /* Clipboard index */ 4 + /* Sequence number */ 4 + /* Rest of message size (because it's a Synergy string from here on) */ 4 + /* Number of clipboard formats */ 4 + /* Clipboard format */ 4; /* Clipboard data length */ uint32_t max_length = USYNERGY_REPLY_BUFFER_SIZE - overhead_size; // Clip text to max length uint32_t text_length = (uint32_t)strlen(text); if (text_length > max_length) { char buffer[128]; sprintf(buffer, "Clipboard buffer too small, clipboard truncated at %d characters", max_length); sTrace(context, buffer); text_length = max_length; } // Assemble packet sAddString(context, "DCLP"); sAddUInt8(context, 0); /* Clipboard index */ sAddUInt32(context, context->m_sequenceNumber); sAddUInt32(context, 4+4+4+text_length); /* Rest of message size: numFormats, format, length, data */ sAddUInt32(context, 1); /* Number of formats (only text for now) */ sAddUInt32(context, USYNERGY_CLIPBOARD_FORMAT_TEXT); sAddUInt32(context, text_length); sAddString(context, text); sSendReply(context); } synergy-1.4.12-Source/src/micro/uSynergy.h0000600000175000017500000004124512021261364020410 0ustar synergysynergy/* uSynergy client -- Interface for the embedded Synergy client library version 1.0.0, July 7th, 2012 Copyright (C) 2012 Bolton Software Ltd. Copyright (c) 2012 Alex Evans This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ #include #ifdef __cplusplus extern "C" { #endif //--------------------------------------------------------------------------------------------------------------------- // Configuration //--------------------------------------------------------------------------------------------------------------------- /** @brief Determine endianness **/ #if defined(USYNERGY_LITTLE_ENDIAN) && defined(USYNERGY_BIG_ENDIAN) /* Ambiguous: both endians specified */ #error "Can't define both USYNERGY_LITTLE_ENDIAN and USYNERGY_BIG_ENDIAN" #elif !defined(USYNERGY_LITTLE_ENDIAN) && !defined(USYNERGY_BIG_ENDIAN) /* Attempt to auto detect */ #if defined(__LITTLE_ENDIAN__) || defined(LITTLE_ENDIAN) || (_BYTE_ORDER == _LITTLE_ENDIAN) #define USYNERGY_LITTLE_ENDIAN #elif defined(__BIG_ENDIAN__) || defined(BIG_ENDIAN) || (_BYTE_ORDER == _BIG_ENDIAN) #define USYNERGY_BIG_ENDIAN #else #error "Can't detect endian-nes, please defined either USYNERGY_LITTLE_ENDIAN or USYNERGY_BIG_ENDIAN"; #endif #else /* User-specified endian-nes, nothing to do for us */ #endif //--------------------------------------------------------------------------------------------------------------------- // Types and Constants //--------------------------------------------------------------------------------------------------------------------- /** @brief Boolean type **/ typedef int uSynergyBool; #define USYNERGY_FALSE 0 /* False value */ #define USYNERGY_TRUE 1 /* True value */ /** @brief User context type The uSynergyCookie type is an opaque type that is used by uSynergy to communicate to the client. It is passed along to callback functions as context. **/ typedef struct { int ignored; } * uSynergyCookie; /** @brief Clipboard types **/ enum uSynergyClipboardFormat { USYNERGY_CLIPBOARD_FORMAT_TEXT = 0, /* Text format, UTF-8, newline is LF */ USYNERGY_CLIPBOARD_FORMAT_BITMAP = 1, /* Bitmap format, BMP 24/32bpp, BI_RGB */ USYNERGY_CLIPBOARD_FORMAT_HTML = 2, /* HTML format, HTML fragment, UTF-8, newline is LF */ }; /** @brief Constants and limits **/ #define USYNERGY_NUM_JOYSTICKS 4 /* Maximum number of supported joysticks */ #define USYNERGY_PROTOCOL_MAJOR 1 /* Major protocol version */ #define USYNERGY_PROTOCOL_MINOR 4 /* Minor protocol version */ #define USYNERGY_IDLE_TIMEOUT 2000 /* Timeout in milliseconds before reconnecting */ #define USYNERGY_TRACE_BUFFER_SIZE 1024 /* Maximum length of traced message */ #define USYNERGY_REPLY_BUFFER_SIZE 1024 /* Maximum size of a reply packet */ #define USYNERGY_RECEIVE_BUFFER_SIZE 4096 /* Maximum size of an incoming packet */ /** @brief Keyboard constants **/ #define USYNERGY_MODIFIER_SHIFT 0x0001 /* Shift key modifier */ #define USYNERGY_MODIFIER_CTRL 0x0002 /* Ctrl key modifier */ #define USYNERGY_MODIFIER_ALT 0x0004 /* Alt key modifier */ #define USYNERGY_MODIFIER_META 0x0008 /* Meta key modifier */ #define USYNERGY_MODIFIER_WIN 0x0010 /* Windows key modifier */ #define USYNERGY_MODIFIER_ALT_GR 0x0020 /* AltGr key modifier */ #define USYNERGY_MODIFIER_LEVEL5LOCK 0x0040 /* Level5Lock key modifier */ #define USYNERGY_MODIFIER_CAPSLOCK 0x1000 /* CapsLock key modifier */ #define USYNERGY_MODIFIER_NUMLOCK 0x2000 /* NumLock key modifier */ #define USYNERGY_MODIFIER_SCROLLOCK 0x4000 /* ScrollLock key modifier */ //--------------------------------------------------------------------------------------------------------------------- // Functions and Callbacks //--------------------------------------------------------------------------------------------------------------------- /** @brief Connect function This function is called when uSynergy needs to connect to the host. It doesn't imply a network implementation or destination address, that must all be handled on the user side. The function should return USYNERGY_TRUE if a connection was established or USYNERGY_FALSE if it could not connect. When network errors occur (e.g. uSynergySend or uSynergyReceive fail) then the connect call will be called again so the implementation of the function must close any old connections and clean up resources before retrying. @param cookie Cookie supplied in the Synergy context **/ typedef uSynergyBool (*uSynergyConnectFunc)(uSynergyCookie cookie); /** @brief Send function This function is called when uSynergy needs to send something over the default connection. It should return USYNERGY_TRUE if sending succeeded and USYNERGY_FALSE otherwise. This function should block until the send operation is completed. @param cookie Cookie supplied in the Synergy context @param buffer Address of buffer to send @param length Length of buffer to send **/ typedef uSynergyBool (*uSynergySendFunc)(uSynergyCookie cookie, const uint8_t *buffer, int length); /** @brief Receive function This function is called when uSynergy needs to receive data from the default connection. It should return USYNERGY_TRUE if receiving data succeeded and USYNERGY_FALSE otherwise. This function should block until data has been received and wait for data to become available. If @a outLength is set to 0 upon completion it is assumed that the connection is alive, but still in a connecting state and needs time to settle. @param cookie Cookie supplied in the Synergy context @param buffer Address of buffer to receive data into @param maxLength Maximum amount of bytes to write into the receive buffer @param outLength Address of integer that receives the actual amount of bytes written into @a buffer **/ typedef uSynergyBool (*uSynergyReceiveFunc)(uSynergyCookie cookie, uint8_t *buffer, int maxLength, int* outLength); /** @brief Thread sleep function This function is called when uSynergy wants to suspend operation for a while before retrying an operation. It is mostly used when a socket times out or disconnect occurs to prevent uSynergy from continuously hammering a network connection in case the network is down. @param cookie Cookie supplied in the Synergy context @param timeMs Time to sleep the current thread (in milliseconds) **/ typedef void (*uSynergySleepFunc)(uSynergyCookie cookie, int timeMs); /** @brief Get time function This function is called when uSynergy needs to know the current time. This is used to determine when timeouts have occured. The time base should be a cyclic millisecond time value. @returns Time value in milliseconds **/ typedef uint32_t (*uSynergyGetTimeFunc)(); /** @brief Trace function This function is called when uSynergy wants to trace something. It is optional to show these messages, but they are often useful when debugging. uSynergy only traces major events like connecting and disconnecting. Usually only a single trace is shown when the connection is established and no more trace are called. @param cookie Cookie supplied in the Synergy context @param text Text to be traced **/ typedef void (*uSynergyTraceFunc)(uSynergyCookie cookie, const char *text); /** @brief Screen active callback This callback is called when Synergy makes the screen active or inactive. This callback is usually sent when the mouse enters or leaves the screen. @param cookie Cookie supplied in the Synergy context @param active Activation flag, 1 if the screen has become active, 0 if the screen has become inactive **/ typedef void (*uSynergyScreenActiveCallback)(uSynergyCookie cookie, uSynergyBool active); /** @brief Mouse callback This callback is called when a mouse events happens. The mouse X and Y position, wheel and button state is communicated in the message. It's up to the user to interpret if this is a mouse up, down, double-click or other message. @param cookie Cookie supplied in the Synergy context @param x Mouse X position @param y Mouse Y position @param wheelX Mouse wheel X position @param wheelY Mouse wheel Y position @param buttonLeft Left button pressed status, 0 for released, 1 for pressed @param buttonMiddle Middle button pressed status, 0 for released, 1 for pressed @param buttonRight Right button pressed status, 0 for released, 1 for pressed **/ typedef void (*uSynergyMouseCallback)(uSynergyCookie cookie, uint16_t x, uint16_t y, int16_t wheelX, int16_t wheelY, uSynergyBool buttonLeft, uSynergyBool buttonRight, uSynergyBool buttonMiddle); /** @brief Key event callback This callback is called when a key is pressed or released. @param cookie Cookie supplied in the Synergy context @param key Key code of key that was pressed or released @param modifiers Status of modifier keys (alt, shift, etc.) @param down Down or up status, 1 is key is pressed down, 0 if key is released (up) @param repeat Repeat flag, 1 if the key is down because the key is repeating, 0 if the key is initially pressed by the user **/ typedef void (*uSynergyKeyboardCallback)(uSynergyCookie cookie, uint16_t key, uint16_t modifiers, uSynergyBool down, uSynergyBool repeat); /** @brief Joystick event callback This callback is called when a joystick stick or button changes. It is possible that multiple callbacks are fired when different sticks or buttons change as these are individual messages in the packet stream. Each callback will contain all the valid state for the different axes and buttons. The last callback received will represent the most current joystick state. @param cookie Cookie supplied in the Synergy context @param joyNum Joystick number, always in the range [0 ... USYNERGY_NUM_JOYSTICKS> @param buttons Button pressed mask @param leftStickX Left stick X position, in range [-127 ... 127] @param leftStickY Left stick Y position, in range [-127 ... 127] @param rightStickX Right stick X position, in range [-127 ... 127] @param rightStickY Right stick Y position, in range [-127 ... 127] **/ typedef void (*uSynergyJoystickCallback)(uSynergyCookie cookie, uint8_t joyNum, uint16_t buttons, int8_t leftStickX, int8_t leftStickY, int8_t rightStickX, int8_t rightStickY); /** @brief Clipboard event callback This callback is called when something is placed on the clipboard. Multiple callbacks may be fired for multiple clipboard formats if they are supported. The data provided is read-only and may not be modified by the application. @param cookie Cookie supplied in the Synergy context @param format Clipboard format @param data Memory area containing the clipboard raw data @param size Size of clipboard data **/ typedef void (*uSynergyClipboardCallback)(uSynergyCookie cookie, enum uSynergyClipboardFormat format, const uint8_t *data, uint32_t size); //--------------------------------------------------------------------------------------------------------------------- // Context //--------------------------------------------------------------------------------------------------------------------- /** @brief uSynergy context **/ typedef struct { /* Mandatory configuration data, filled in by client */ uSynergyConnectFunc m_connectFunc; /* Connect function */ uSynergySendFunc m_sendFunc; /* Send data function */ uSynergyReceiveFunc m_receiveFunc; /* Receive data function */ uSynergySleepFunc m_sleepFunc; /* Thread sleep function */ uSynergyGetTimeFunc m_getTimeFunc; /* Get current time function */ const char* m_clientName; /* Name of Synergy Screen / Client */ uint16_t m_clientWidth; /* Width of screen */ uint16_t m_clientHeight; /* Height of screen */ /* Optional configuration data, filled in by client */ uSynergyCookie m_cookie; /* Cookie pointer passed to callback functions (can be NULL) */ uSynergyTraceFunc m_traceFunc; /* Function for tracing status (can be NULL) */ uSynergyScreenActiveCallback m_screenActiveCallback; /* Callback for entering and leaving screen */ uSynergyMouseCallback m_mouseCallback; /* Callback for mouse events */ uSynergyKeyboardCallback m_keyboardCallback; /* Callback for keyboard events */ uSynergyJoystickCallback m_joystickCallback; /* Callback for joystick events */ uSynergyClipboardCallback m_clipboardCallback; /* Callback for clipboard events */ /* State data, used internall by client, initialized by uSynergyInit() */ uSynergyBool m_connected; /* Is our socket connected? */ uSynergyBool m_hasReceivedHello; /* Have we received a 'Hello' from the server? */ uSynergyBool m_isCaptured; /* Is Synergy active (i.e. this client is receiving input messages?) */ uint32_t m_lastMessageTime; /* Time at which last message was received */ uint32_t m_sequenceNumber; /* Packet sequence number */ uint8_t m_receiveBuffer[USYNERGY_RECEIVE_BUFFER_SIZE]; /* Receive buffer */ int m_receiveOfs; /* Receive buffer offset */ uint8_t m_replyBuffer[USYNERGY_REPLY_BUFFER_SIZE]; /* Reply buffer */ uint8_t* m_replyCur; /* Write offset into reply buffer */ uint16_t m_mouseX; /* Mouse X position */ uint16_t m_mouseY; /* Mouse Y position */ int16_t m_mouseWheelX; /* Mouse wheel X position */ int16_t m_mouseWheelY; /* Mouse wheel Y position */ uSynergyBool m_mouseButtonLeft; /* Mouse left button */ uSynergyBool m_mouseButtonRight; /* Mouse right button */ uSynergyBool m_mouseButtonMiddle; /* Mouse middle button */ int8_t m_joystickSticks[USYNERGY_NUM_JOYSTICKS][4]; /* Joystick stick position in 2 axes for 2 sticks */ uint16_t m_joystickButtons[USYNERGY_NUM_JOYSTICKS]; /* Joystick button state */ } uSynergyContext; //--------------------------------------------------------------------------------------------------------------------- // Interface //--------------------------------------------------------------------------------------------------------------------- /** @brief Initialize uSynergy context This function initializes @a context for use. Call this function directly after creating the context, before filling in any configuration data in it. Not calling this function will cause undefined behavior. @param context Context to be initialized **/ extern void uSynergyInit(uSynergyContext *context); /** @brief Update uSynergy This function updates uSynergy and does the bulk of the work. It does connection management, receiving data, reconnecting after errors or timeouts and so on. It assumes that networking operations are blocking and it can suspend the current thread if it needs to wait. It is best practice to call uSynergyUpdate from a background thread so it is responsive. Because uSynergy relies mostly on blocking calls it will mostly stay in thread sleep state waiting for system mutexes and won't eat much memory. uSynergyUpdate doesn't do any memory allocations or have any side effects beyond those of the callbacks it calls. @param context Context to be updated **/ extern void uSynergyUpdate(uSynergyContext *context); /** @brief Send clipboard data This function sets new clipboard data and sends it to the server. Use this function if your client cuts or copies data onto the clipboard that it needs to share with the server. Currently there is only support for plaintext, but HTML and image data could be supported with some effort. @param context Context to send clipboard data to @param text Text to set to the clipboard **/ extern void uSynergySendClipboard(uSynergyContext *context, const char *text); #ifdef __cplusplus }; #endif synergy-1.4.12-Source/src/plugin/0000700000175000017500000000000012140644175016576 5ustar synergysynergysynergy-1.4.12-Source/src/plugin/CMakeLists.txt0000600000175000017500000000136312021261364021334 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2012 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . if (WIN32) add_subdirectory(winmmjoy) endif() synergy-1.4.12-Source/src/plugin/winmmjoy/0000700000175000017500000000000012140644175020447 5ustar synergysynergysynergy-1.4.12-Source/src/plugin/winmmjoy/CMakeLists.txt0000600000175000017500000000173612021261364023211 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2012 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(inc winmmjoy.h ) set(src winmmjoy.cpp ${inc} ) add_library(winmmjoy SHARED ${inc} ${src}) add_custom_command( TARGET winmmjoy POST_BUILD COMMAND xcopy /Y /Q ..\\..\\..\\..\\lib\\${CMAKE_CFG_INTDIR}\\winmmjoy.* ..\\..\\..\\..\\bin\\${CMAKE_CFG_INTDIR}\\plugins\\ ) synergy-1.4.12-Source/src/plugin/winmmjoy/winmmjoy.cpp0000600000175000017500000000477612021261364023035 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "winmmjoy.h" #include #include #include #pragma comment(lib, "winmm.lib") std::stringstream _logStream; #define LOG(s) \ _logStream.str(""); \ _logStream << "winmmjoy: " << s << std::endl; \ s_log( _logStream.str().c_str()) static bool s_running = true; static void (*s_sendEvent)(const char*, void*) = NULL; static void (*s_log)(const char*) = NULL; extern "C" { int init(void (*sendEvent)(const char*, void*), void (*log)(const char*)) { s_sendEvent = sendEvent; s_log = log; LOG("init"); CreateThread(NULL, 0, mainLoop, NULL, 0, NULL); return 0; } int cleanup() { LOG("cleanup"); s_running = false; return 0; } } DWORD WINAPI mainLoop(void* data) { const char* buttonsEvent = "IPrimaryScreen::getGameDeviceButtonsEvent"; const char* sticksEvent = "IPrimaryScreen::getGameDeviceSticksEvent"; const char* triggersEvent = "IPrimaryScreen::getGameDeviceTriggersEvent"; JOYINFOEX joyInfo; ZeroMemory(&joyInfo, sizeof(joyInfo)); joyInfo.dwSize = sizeof(joyInfo); joyInfo.dwFlags = JOY_RETURNALL; // note: synergy data is often 16-bit, where winmm is 32-bit. UINT index = JOYSTICKID1; DWORD buttons, buttonsLast = 0; DWORD xPos, xPosLast = 0; DWORD yPos, yPosLast = 0; while (s_running) { if (joyGetPosEx(index, &joyInfo) != JOYERR_NOERROR) { Sleep(1000); continue; } buttons = joyInfo.dwButtons; xPos = joyInfo.dwXpos; yPos = joyInfo.dwYpos; if (buttons != buttonsLast) { s_sendEvent(buttonsEvent, new CGameDeviceButtonInfo(index, (GameDeviceButton)joyInfo.dwButtons)); } if (xPos != xPosLast || yPos != yPosLast) { s_sendEvent(sticksEvent, new CGameDeviceStickInfo(index, (short)xPos, (short)yPos, 0, 0)); } buttonsLast = buttons; xPosLast = xPos; yPosLast = yPos; Sleep(1); } return 0; } synergy-1.4.12-Source/src/plugin/winmmjoy/winmmjoy.h0000600000175000017500000000350612021261364022470 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #define WIN32_LEAN_AND_MEAN #include #if defined(winmmjoy_EXPORTS) #define WINMMJOY_API __declspec(dllexport) #else #define WINMMJOY_API __declspec(dllimport) #endif extern "C" { WINMMJOY_API int init(void (*sendEvent)(const char*, void*), void (*log)(const char*)); WINMMJOY_API int cleanup(); } DWORD WINAPI mainLoop(void* data); typedef unsigned char GameDeviceID; typedef unsigned short GameDeviceButton; class CGameDeviceButtonInfo { public: CGameDeviceButtonInfo(GameDeviceID id, GameDeviceButton buttons) : m_id(id), m_buttons(buttons) { } public: GameDeviceID m_id; GameDeviceButton m_buttons; }; class CGameDeviceStickInfo { public: CGameDeviceStickInfo(GameDeviceID id, short x1, short y1, short x2, short y2) : m_id(id), m_x1(x1), m_x2(x2), m_y1(y1), m_y2(y2) { } public: GameDeviceID m_id; short m_x1; short m_x2; short m_y1; short m_y2; }; class CGameDeviceTriggerInfo { public: CGameDeviceTriggerInfo(GameDeviceID id, unsigned char t1, unsigned char t2) : m_id(id), m_t1(t1), m_t2(t2) { } public: GameDeviceID m_id; unsigned char m_t1; unsigned char m_t2; }; synergy-1.4.12-Source/src/test/0000700000175000017500000000000012140644175016257 5ustar synergysynergysynergy-1.4.12-Source/src/test/CMakeLists.txt0000600000175000017500000000202012021261364021004 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2011 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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_directories( ../../tools/gtest-1.6.0 ../../tools/gtest-1.6.0/include ../../tools/gmock-1.6.0 ../../tools/gmock-1.6.0/include) add_library(gtest STATIC ../../tools/gtest-1.6.0/src/gtest-all.cc) add_library(gmock STATIC ../../tools/gmock-1.6.0/src/gmock-all.cc) add_subdirectory(integtests) add_subdirectory(unittests) synergy-1.4.12-Source/src/test/guitests/0000700000175000017500000000000012140644175020126 5ustar synergysynergysynergy-1.4.12-Source/src/test/guitests/guitests.pro0000600000175000017500000000062411727172043022523 0ustar synergysynergyQT += network QT -= gui TARGET = guitests CONFIG += qtestlib CONFIG += console CONFIG -= app_bundle TEMPLATE = app INCLUDEPATH += ../../gui/src SOURCES += src/main.cpp \ src/VersionCheckerTests.cpp HEADERS += src/VersionCheckerTests.h \ src/VersionChecker.h win32 { Debug:DESTDIR = ../../../bin/Debug Release:DESTDIR = ../../../bin/Release } else:DESTDIR = ../../../bin synergy-1.4.12-Source/src/test/guitests/src/0000700000175000017500000000000012140644175020715 5ustar synergysynergysynergy-1.4.12-Source/src/test/guitests/src/main.cpp0000600000175000017500000000165512021261364022347 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "VersionCheckerTests.h" int main(int argc, char *argv[]) { VersionCheckerTests versionCheckerTests; QTest::qExec(&versionCheckerTests, argc, argv); } synergy-1.4.12-Source/src/test/guitests/src/VersionCheckerTests.cpp0000600000175000017500000000354612021261364025361 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "VersionCheckerTests.h" #include "VersionChecker.cpp" #include "../../gui/tmp/debug/moc_VersionChecker.cpp" #include void VersionCheckerTests::compareVersions() { VersionChecker versionChecker; // compare majors QCOMPARE(versionChecker.compareVersions("1.0.0", "2.0.0"), 1); QCOMPARE(versionChecker.compareVersions("2.0.0", "1.0.0"), -1); QCOMPARE(versionChecker.compareVersions("1.0.0", "1.0.0"), 0); QCOMPARE(versionChecker.compareVersions("1.4.8", "2.4.7"), 1); QCOMPARE(versionChecker.compareVersions("2.4.7", "1.4.8"), -1); // compare minors QCOMPARE(versionChecker.compareVersions("1.3.0", "1.4.0"), 1); QCOMPARE(versionChecker.compareVersions("1.4.0", "1.3.0"), -1); QCOMPARE(versionChecker.compareVersions("1.4.0", "1.4.0"), 0); QCOMPARE(versionChecker.compareVersions("1.3.8", "1.4.7"), 1); QCOMPARE(versionChecker.compareVersions("1.4.7", "1.3.8"), -1); // compare revs QCOMPARE(versionChecker.compareVersions("1.4.7", "1.4.8"), 1); QCOMPARE(versionChecker.compareVersions("1.4.8", "1.4.7"), -1); QCOMPARE(versionChecker.compareVersions("1.4.7", "1.4.7"), 0); } synergy-1.4.12-Source/src/test/guitests/src/VersionCheckerTests.h0000600000175000017500000000155312021261364025022 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "QObject.h" class VersionCheckerTests : public QObject { Q_OBJECT private slots: void compareVersions(); }; synergy-1.4.12-Source/src/test/integtests/0000700000175000017500000000000012140644175020450 5ustar synergysynergysynergy-1.4.12-Source/src/test/integtests/CIpcTests.cpp0000600000175000017500000001546112021261364023017 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2012 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 #define TEST_ENV #include "Global.h" #include "CIpcServer.h" #include "CIpcClient.h" #include "CSocketMultiplexer.h" #include "CEventQueue.h" #include "TMethodEventJob.h" #include "CThread.h" #include "TMethodJob.h" #include "CArch.h" #include "CLog.h" #include "CIpcClientProxy.h" #include "Ipc.h" #include "CString.h" #include "CIpcServerProxy.h" #include "CIpcMessage.h" #include "CSimpleEventQueueBuffer.h" #define TEST_IPC_PORT 24802 class CIpcTests : public ::testing::Test { public: CIpcTests(); virtual ~CIpcTests(); void connectToServer_handleMessageReceived(const CEvent&, void*); void sendMessageToServer_serverHandleMessageReceived(const CEvent&, void*); void sendMessageToClient_serverHandleClientConnected(const CEvent&, void*); void sendMessageToClient_clientHandleMessageReceived(const CEvent&, void*); void handleQuitTimeout(const CEvent&, void* vclient); void raiseQuitEvent(); void initQuitTimeout(double timeout); void cleanupQuitTimeout(); private: void timeoutThread(void*); public: CSocketMultiplexer m_multiplexer; CEventQueue m_events; CEventQueueTimer* m_quitTimeoutTimer; bool m_connectToServer_helloMessageReceived; bool m_connectToServer_hasClientNode; CIpcServer* m_connectToServer_server; CString m_sendMessageToServer_receivedString; CString m_sendMessageToClient_receivedString; CIpcClient* m_sendMessageToServer_client; CIpcServer* m_sendMessageToClient_server; }; TEST_F(CIpcTests, connectToServer) { CIpcServer server(TEST_IPC_PORT); server.listen(); m_connectToServer_server = &server; m_events.adoptHandler( CIpcServer::getMessageReceivedEvent(), &server, new TMethodEventJob( this, &CIpcTests::connectToServer_handleMessageReceived)); CIpcClient client(TEST_IPC_PORT); client.connect(); initQuitTimeout(5); m_events.loop(); m_events.removeHandler(CIpcServer::getMessageReceivedEvent(), &server); cleanupQuitTimeout(); EXPECT_EQ(true, m_connectToServer_helloMessageReceived); EXPECT_EQ(true, m_connectToServer_hasClientNode); } TEST_F(CIpcTests, sendMessageToServer) { CIpcServer server(TEST_IPC_PORT); server.listen(); // event handler sends "test" command to server. m_events.adoptHandler( CIpcServer::getMessageReceivedEvent(), &server, new TMethodEventJob( this, &CIpcTests::sendMessageToServer_serverHandleMessageReceived)); CIpcClient client(TEST_IPC_PORT); client.connect(); m_sendMessageToServer_client = &client; initQuitTimeout(5); m_events.loop(); m_events.removeHandler(CIpcServer::getMessageReceivedEvent(), &server); cleanupQuitTimeout(); EXPECT_EQ("test", m_sendMessageToServer_receivedString); } TEST_F(CIpcTests, sendMessageToClient) { CIpcServer server(TEST_IPC_PORT); server.listen(); m_sendMessageToClient_server = &server; // event handler sends "test" log line to client. m_events.adoptHandler( CIpcServer::getMessageReceivedEvent(), &server, new TMethodEventJob( this, &CIpcTests::sendMessageToClient_serverHandleClientConnected)); CIpcClient client(TEST_IPC_PORT); client.connect(); m_events.adoptHandler( CIpcClient::getMessageReceivedEvent(), &client, new TMethodEventJob( this, &CIpcTests::sendMessageToClient_clientHandleMessageReceived)); initQuitTimeout(5); m_events.loop(); m_events.removeHandler(CIpcServer::getMessageReceivedEvent(), &server); m_events.removeHandler(CIpcClient::getMessageReceivedEvent(), &client); cleanupQuitTimeout(); EXPECT_EQ("test", m_sendMessageToClient_receivedString); } CIpcTests::CIpcTests() : m_quitTimeoutTimer(nullptr), m_connectToServer_helloMessageReceived(false), m_connectToServer_hasClientNode(false), m_connectToServer_server(nullptr), m_sendMessageToClient_server(nullptr), m_sendMessageToServer_client(nullptr) { } CIpcTests::~CIpcTests() { } void CIpcTests::connectToServer_handleMessageReceived(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); if (m->m_type == kIpcHello) { m_connectToServer_hasClientNode = m_connectToServer_server->hasClients(kIpcClientNode); m_connectToServer_helloMessageReceived = true; raiseQuitEvent(); } } void CIpcTests::sendMessageToServer_serverHandleMessageReceived(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); if (m->m_type == kIpcHello) { LOG((CLOG_DEBUG "client said hello, sending test to server")); CIpcCommandMessage m("test", true); m_sendMessageToServer_client->send(m); } else if (m->m_type == kIpcCommand) { CIpcCommandMessage* cm = static_cast(m); LOG((CLOG_DEBUG "got ipc command message, %d", cm->command().c_str())); m_sendMessageToServer_receivedString = cm->command(); raiseQuitEvent(); } } void CIpcTests::sendMessageToClient_serverHandleClientConnected(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); if (m->m_type == kIpcHello) { LOG((CLOG_DEBUG "client said hello, sending test to client")); CIpcLogLineMessage m("test"); m_sendMessageToClient_server->send(m, kIpcClientNode); } } void CIpcTests::sendMessageToClient_clientHandleMessageReceived(const CEvent& e, void*) { CIpcMessage* m = static_cast(e.getDataObject()); if (m->m_type == kIpcLogLine) { CIpcLogLineMessage* llm = static_cast(m); LOG((CLOG_DEBUG "got ipc log message, %d", llm->logLine().c_str())); m_sendMessageToClient_receivedString = llm->logLine(); raiseQuitEvent(); } } void CIpcTests::raiseQuitEvent() { EVENTQUEUE->addEvent(CEvent(CEvent::kQuit)); } void CIpcTests::initQuitTimeout(double timeout) { assert(m_quitTimeoutTimer == nullptr); m_quitTimeoutTimer = EVENTQUEUE->newOneShotTimer(timeout, NULL); EVENTQUEUE->adoptHandler(CEvent::kTimer, m_quitTimeoutTimer, new TMethodEventJob( this, &CIpcTests::handleQuitTimeout)); } void CIpcTests::cleanupQuitTimeout() { EVENTQUEUE->removeHandler(CEvent::kTimer, m_quitTimeoutTimer); delete m_quitTimeoutTimer; m_quitTimeoutTimer = nullptr; } void CIpcTests::handleQuitTimeout(const CEvent&, void* vclient) { LOG((CLOG_ERR "timeout")); raiseQuitEvent(); } synergy-1.4.12-Source/src/test/integtests/CMakeLists.txt0000600000175000017500000000340712043214276023213 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(src Main.cpp CIpcTests.cpp ) if (WIN32) list(APPEND src platform/CMSWindowsClipboardTests.cpp platform/CMSWindowsKeyStateTests.cpp ) elseif (APPLE) list(APPEND src platform/COSXClipboardTests.cpp platform/COSXKeyStateTests.cpp platform/COSXScreenTests.cpp ) elseif (UNIX) list(APPEND src platform/CXWindowsClipboardTests.cpp platform/CXWindowsKeyStateTests.cpp platform/CXWindowsScreenTests.cpp platform/CXWindowsScreenSaverTests.cpp ) endif() set(inc ../../lib/arch ../../lib/base ../../lib/client ../../lib/common ../../lib/io ../../lib/ipc ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ../../../tools/gtest-1.6.0/include ../../../tools/gmock-1.6.0/include ../unittests ../unittests/synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() if (WIN32) if (GAME_DEVICE_SUPPORT) link_directories("$ENV{DXSDK_DIR}/Lib/x86") endif() endif() include_directories(${inc}) add_executable(integtests ${src}) target_link_libraries(integtests arch base client common io ipc mt net platform server synergy gtest gmock ${libs}) synergy-1.4.12-Source/src/test/integtests/Main.cpp0000600000175000017500000000373112021261364022037 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArch.h" #include "CLog.h" #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #endif #define LOCK_TIMEOUT 30 using namespace std; void lock(string lockFile); void unlock(string lockFile); int main(int argc, char **argv) { #if SYSAPI_WIN32 // record window instance for tray icon, etc CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; log.setFilter(kDEBUG2); string lockFile; for (int i = 0; i < argc; i++) { if (string(argv[i]).compare("--lock-file") == 0) { lockFile = argv[i + 1]; } } if (!lockFile.empty()) { lock(lockFile); } testing::InitGoogleTest(&argc, argv); int result = RUN_ALL_TESTS(); if (!lockFile.empty()) { unlock(lockFile); } return result; } void lock(string lockFile) { double start = ARCH->time(); // keep checking until timeout is reached. while ((ARCH->time() - start) < LOCK_TIMEOUT) { ifstream is(lockFile.c_str()); bool noLock = !is; is.close(); if (noLock) { break; } // check every second if file has gone. ARCH->sleep(1); } // write empty lock file. ofstream os(lockFile.c_str()); os.close(); } void unlock(string lockFile) { remove(lockFile.c_str()); } synergy-1.4.12-Source/src/test/integtests/platform/0000700000175000017500000000000012140644175022274 5ustar synergysynergysynergy-1.4.12-Source/src/test/integtests/platform/CMSWindowsClipboardTests.cpp0000600000175000017500000001251712021261364027641 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CMSWindowsClipboard.h" #include "IMSWindowsClipboardFacade.h" class CMSWindowsClipboardTests : public ::testing::Test { protected: virtual void SetUp() { emptyClipboard(); } virtual void TearDown() { emptyClipboard(); } private: void emptyClipboard() { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.empty(); } }; class MockFacade : public IMSWindowsClipboardFacade { public: MOCK_METHOD2(write, void(HANDLE, UINT)); }; TEST_F(CMSWindowsClipboardTests, emptyUnowned_openCalled_returnsTrue) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); bool actual = clipboard.emptyUnowned(); EXPECT_EQ(true, actual); } TEST_F(CMSWindowsClipboardTests, empty_openCalled_returnsTrue) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); bool actual = clipboard.empty(); EXPECT_EQ(true, actual); } TEST_F(CMSWindowsClipboardTests, empty_singleFormat_hasReturnsFalse) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.add(CMSWindowsClipboard::kText, "synergy rocks!"); clipboard.empty(); bool actual = clipboard.has(CMSWindowsClipboard::kText); EXPECT_EQ(false, actual); } TEST_F(CMSWindowsClipboardTests, add_newValue_valueWasStored) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST_F(CMSWindowsClipboardTests, add_newValue_writeWasCalled) { MockFacade facade; EXPECT_CALL(facade, write(testing::_, testing::_)); CMSWindowsClipboard clipboard(NULL); clipboard.setFacade(facade); clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); } TEST_F(CMSWindowsClipboardTests, add_replaceValue_valueWasReplaced) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.add(IClipboard::kText, "maxivista sucks"); // haha, just kidding. CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("maxivista sucks", actual); } TEST_F(CMSWindowsClipboardTests, open_timeIsZero_returnsTrue) { CMSWindowsClipboard clipboard(NULL); bool actual = clipboard.open(0); EXPECT_EQ(true, actual); } TEST_F(CMSWindowsClipboardTests, open_timeIsOne_returnsTrue) { CMSWindowsClipboard clipboard(NULL); bool actual = clipboard.open(1); EXPECT_EQ(true, actual); } TEST_F(CMSWindowsClipboardTests, close_isOpen_noErrors) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.close(); // can't assert anything } // looks like this test may fail intermittently: // * http://buildbot.synergy-foss.org:8000/builders/trunk-win32/builds/246/steps/shell_3/logs/stdio /*TEST_F(CMSWindowsClipboardTests, getTime_openWithNoEmpty_returnsOne) { CMSWindowsClipboard clipboard(NULL); clipboard.open(1); CMSWindowsClipboard::Time actual = clipboard.getTime(); // this behavior is different to that of CClipboard which only // returns the value passed into open(t) after empty() is called. EXPECT_EQ(1, actual); }*/ // this also fails intermittently: // http://buildbot.synergy-foss.org:8000/builders/trunk-win32/builds/266/steps/shell_3/logs/stdio /*TEST_F(CMSWindowsClipboardTests, getTime_openAndEmpty_returnsOne) { CMSWindowsClipboard clipboard(NULL); clipboard.open(1); clipboard.empty(); CMSWindowsClipboard::Time actual = clipboard.getTime(); EXPECT_EQ(1, actual); }*/ TEST_F(CMSWindowsClipboardTests, has_withFormatAdded_returnsTrue) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.empty(); clipboard.add(IClipboard::kText, "synergy rocks!"); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(true, actual); } TEST_F(CMSWindowsClipboardTests, has_withNoFormats_returnsFalse) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.empty(); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(false, actual); } TEST_F(CMSWindowsClipboardTests, get_withNoFormats_returnsEmpty) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.empty(); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("", actual); } TEST_F(CMSWindowsClipboardTests, get_withFormatAdded_returnsExpected) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); clipboard.empty(); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST_F(CMSWindowsClipboardTests, isOwnedBySynergy_defaultState_noError) { CMSWindowsClipboard clipboard(NULL); clipboard.open(0); bool actual = clipboard.isOwnedBySynergy(); EXPECT_EQ(true, actual); } synergy-1.4.12-Source/src/test/integtests/platform/CMSWindowsKeyStateTests.cpp0000600000175000017500000000756512021261364027502 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 #define TEST_ENV #include "Global.h" #include "CMSWindowsKeyState.h" #include "CMSWindowsDesks.h" #include "CMSWindowsScreen.h" #include "CMSWindowsScreenSaver.h" #include "TMethodJob.h" #include "CMockEventQueue.h" #include "CMockKeyMap.h" // wParam = flags, HIBYTE(lParam) = virtual key, LOBYTE(lParam) = scan code #define SYNERGY_MSG_FAKE_KEY SYNERGY_HOOK_LAST_MSG + 4 using ::testing::_; using ::testing::NiceMock; class CMSWindowsKeyStateTests : public ::testing::Test { protected: virtual void SetUp() { // load synrgyhk.dll m_hookLibrary = m_hookLibraryLoader.openHookLibrary("synrgyhk"); m_screensaver = new CMSWindowsScreenSaver(); } virtual void TearDown() { delete m_screensaver; } CMSWindowsDesks* newDesks(IEventQueue& eventQueue) { return new CMSWindowsDesks( true, false, m_hookLibrary, m_screensaver, eventQueue, new TMethodJob( this, &CMSWindowsKeyStateTests::updateKeysCB), false); } void* getEventTarget() const { return const_cast(this); } private: void updateKeysCB(void*) { } HINSTANCE m_hookLibrary; IScreenSaver* m_screensaver; CMSWindowsHookLibraryLoader m_hookLibraryLoader; }; TEST_F(CMSWindowsKeyStateTests, disable_nonWin95OS_eventQueueNotUsed) { NiceMock eventQueue; CMSWindowsDesks* desks = newDesks(eventQueue); CMockKeyMap keyMap; CMSWindowsKeyState keyState(desks, getEventTarget(), eventQueue, keyMap); // in anything above win95-family, event handler should not be called. EXPECT_CALL(eventQueue, removeHandler(_, _)).Times(0); keyState.disable(); delete desks; } TEST_F(CMSWindowsKeyStateTests, testAutoRepeat_noRepeatAndButtonIsZero_resultIsTrue) { NiceMock eventQueue; CMSWindowsDesks* desks = newDesks(eventQueue); CMockKeyMap keyMap; CMSWindowsKeyState keyState(desks, getEventTarget(), eventQueue, keyMap); keyState.setLastDown(1); bool actual = keyState.testAutoRepeat(true, false, 1); ASSERT_TRUE(actual); delete desks; } TEST_F(CMSWindowsKeyStateTests, testAutoRepeat_pressFalse_lastDownIsZero) { NiceMock eventQueue; CMSWindowsDesks* desks = newDesks(eventQueue); CMockKeyMap keyMap; CMSWindowsKeyState keyState(desks, getEventTarget(), eventQueue, keyMap); keyState.setLastDown(1); keyState.testAutoRepeat(false, false, 1); ASSERT_EQ(0, keyState.getLastDown()); delete desks; } TEST_F(CMSWindowsKeyStateTests, saveModifiers_noModifiers_savedModifiers0) { NiceMock eventQueue; CMSWindowsDesks* desks = newDesks(eventQueue); CMockKeyMap keyMap; CMSWindowsKeyState keyState(desks, getEventTarget(), eventQueue, keyMap); keyState.saveModifiers(); ASSERT_EQ(0, keyState.getSavedModifiers()); delete desks; } /* TEST_F(CMSWindowsKeyStateTests, saveModifiers_shiftKeyDown_savedModifiers4) { NiceMock eventQueue; CMSWindowsDesks* desks = newDesks(eventQueue); CMockKeyMap keyMap; CMSWindowsKeyState keyState(desks, getEventTarget(), eventQueue, keyMap); desks->enable(); desks->fakeKeyEvent(1, 1, true, false); keyState.saveModifiers(); ASSERT_EQ(1, keyState.getSavedModifiers()); delete desks; } */synergy-1.4.12-Source/src/test/integtests/platform/COSXClipboardTests.cpp0000600000175000017500000000730212021261364026414 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXClipboard.h" TEST(COSXClipboardTests, empty_openCalled_returnsTrue) { COSXClipboard clipboard; clipboard.open(0); bool actual = clipboard.empty(); EXPECT_EQ(true, actual); } TEST(COSXClipboardTests, empty_singleFormat_hasReturnsFalse) { COSXClipboard clipboard; clipboard.open(0); clipboard.add(COSXClipboard::kText, "synergy rocks!"); clipboard.empty(); bool actual = clipboard.has(COSXClipboard::kText); EXPECT_EQ(false, actual); } TEST(COSXClipboardTests, add_newValue_valueWasStored) { COSXClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST(COSXClipboardTests, add_replaceValue_valueWasReplaced) { COSXClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.add(IClipboard::kText, "maxivista sucks"); // haha, just kidding. CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("maxivista sucks", actual); } TEST(COSXClipboardTests, open_timeIsZero_returnsTrue) { COSXClipboard clipboard; bool actual = clipboard.open(0); EXPECT_EQ(true, actual); } TEST(COSXClipboardTests, open_timeIsOne_returnsTrue) { COSXClipboard clipboard; bool actual = clipboard.open(1); EXPECT_EQ(true, actual); } TEST(COSXClipboardTests, close_isOpen_noErrors) { COSXClipboard clipboard; clipboard.open(0); clipboard.close(); // can't assert anything } TEST(COSXClipboardTests, getTime_openWithNoEmpty_returnsOne) { COSXClipboard clipboard; clipboard.open(1); COSXClipboard::Time actual = clipboard.getTime(); // this behavior is different to that of CClipboard which only // returns the value passed into open(t) after empty() is called. EXPECT_EQ((UInt32)1, actual); } TEST(COSXClipboardTests, getTime_openAndEmpty_returnsOne) { COSXClipboard clipboard; clipboard.open(1); clipboard.empty(); COSXClipboard::Time actual = clipboard.getTime(); EXPECT_EQ((UInt32)1, actual); } TEST(COSXClipboardTests, has_withFormatAdded_returnsTrue) { COSXClipboard clipboard; clipboard.open(0); clipboard.empty(); clipboard.add(IClipboard::kText, "synergy rocks!"); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(true, actual); } TEST(COSXClipboardTests, has_withNoFormats_returnsFalse) { COSXClipboard clipboard; clipboard.open(0); clipboard.empty(); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(false, actual); } TEST(COSXClipboardTests, get_withNoFormats_returnsEmpty) { COSXClipboard clipboard; clipboard.open(0); clipboard.empty(); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("", actual); } TEST(COSXClipboardTests, get_withFormatAdded_returnsExpected) { COSXClipboard clipboard; clipboard.open(0); clipboard.empty(); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } synergy-1.4.12-Source/src/test/integtests/platform/COSXKeyStateTests.cpp0000600000175000017500000000623612021261364026253 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "COSXKeyState.h" #include "CMockKeyMap.h" #include "CMockEventQueue.h" #include "CLog.h" #define SHIFT_ID_L kKeyShift_L #define SHIFT_ID_R kKeyShift_R #define SHIFT_BUTTON 57 #define A_CHAR_ID 0x00000061 #define A_CHAR_BUTTON 001 class COSXKeyStateTests : public ::testing::Test { public: static bool isKeyPressed(const COSXKeyState& keyState, KeyButton button); }; TEST_F(COSXKeyStateTests, fakeAndPoll_shift) { CKeyMap keyMap; CMockEventQueue eventQueue; COSXKeyState keyState((IEventQueue&)eventQueue, keyMap); keyState.updateKeyMap(); keyState.fakeKeyDown(SHIFT_ID_L, 0, 1); EXPECT_TRUE(isKeyPressed(keyState, SHIFT_BUTTON)); keyState.fakeKeyUp(1); EXPECT_TRUE(!isKeyPressed(keyState, SHIFT_BUTTON)); keyState.fakeKeyDown(SHIFT_ID_R, 0, 2); EXPECT_TRUE(isKeyPressed(keyState, SHIFT_BUTTON)); keyState.fakeKeyUp(2); EXPECT_TRUE(!isKeyPressed(keyState, SHIFT_BUTTON)); } TEST_F(COSXKeyStateTests, fakeAndPoll_charKey) { CKeyMap keyMap; CMockEventQueue eventQueue; COSXKeyState keyState((IEventQueue&)eventQueue, keyMap); keyState.updateKeyMap(); keyState.fakeKeyDown(A_CHAR_ID, 0, 1); EXPECT_TRUE(isKeyPressed(keyState, A_CHAR_BUTTON)); keyState.fakeKeyUp(1); EXPECT_TRUE(!isKeyPressed(keyState, A_CHAR_BUTTON)); // HACK: delete the key in case it was typed into a text editor. // we should really set focus to an invisible window. keyState.fakeKeyDown(kKeyBackSpace, 0, 2); keyState.fakeKeyUp(2); } TEST_F(COSXKeyStateTests, fakeAndPoll_charKeyAndModifier) { CKeyMap keyMap; CMockEventQueue eventQueue; COSXKeyState keyState((IEventQueue&)eventQueue, keyMap); keyState.updateKeyMap(); keyState.fakeKeyDown(A_CHAR_ID, KeyModifierShift, 1); EXPECT_TRUE(isKeyPressed(keyState, A_CHAR_BUTTON)); keyState.fakeKeyUp(1); EXPECT_TRUE(!isKeyPressed(keyState, A_CHAR_BUTTON)); // HACK: delete the key in case it was typed into a text editor. // we should really set focus to an invisible window. keyState.fakeKeyDown(kKeyBackSpace, 0, 2); keyState.fakeKeyUp(2); } bool COSXKeyStateTests::isKeyPressed(const COSXKeyState& keyState, KeyButton button) { // allow os to realize key state changes. ARCH->sleep(.01); IKeyState::KeyButtonSet pressed; keyState.pollPressedKeys(pressed); IKeyState::KeyButtonSet::const_iterator it; for (it = pressed.begin(); it != pressed.end(); ++it) { LOG((CLOG_DEBUG "checking key %d", *it)); if (*it == button) { return true; } } return false; } synergy-1.4.12-Source/src/test/integtests/platform/COSXScreenTests.cpp0000600000175000017500000000253112043507562025742 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 #define private public #include "COSXScreen.h" #include "CEventQueue.h" #include "CArch.h" // disabling these tests - the return value of CGCursorIsVisible is unreliable. /* TEST(COSXScreenTests, hideCursor_notPrimary) { CEventQueue queue; COSXScreen screen(true, false); screen.hideCursor(); EXPECT_EQ(false, CGCursorIsVisible()); // workaround for screen class race condition. ARCH->sleep(.1f); } TEST(COSXScreenTests, showCursor_notPrimary) { CEventQueue queue; COSXScreen screen(false, false); screen.showCursor(); EXPECT_EQ(true, CGCursorIsVisible()); // workaround for screen class race condition. ARCH->sleep(.1f); } */ synergy-1.4.12-Source/src/test/integtests/platform/CXWindowsClipboardTests.cpp0000600000175000017500000000745412021261364027535 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsClipboard.h" class CXWindowsClipboardTests : public ::testing::Test { protected: virtual void SetUp() { m_display = XOpenDisplay(NULL); int screen = DefaultScreen(m_display); Window root = XRootWindow(m_display, screen); XSetWindowAttributes attr; attr.do_not_propagate_mask = 0; attr.override_redirect = True; attr.cursor = Cursor(); m_window = XCreateWindow( m_display, root, 0, 0, 1, 1, 0, 0, InputOnly, CopyFromParent, 0, &attr); } virtual void TearDown() { XDestroyWindow(m_display, m_window); XCloseDisplay(m_display); } CXWindowsClipboard& createClipboard() { CXWindowsClipboard* clipboard; clipboard = new CXWindowsClipboard(m_display, m_window, 0); clipboard->open(0); // needed to empty the clipboard clipboard->empty(); // needed to own the clipboard return *clipboard; } Display* m_display; Window m_window; }; TEST_F(CXWindowsClipboardTests, empty_openCalled_returnsTrue) { CXWindowsClipboard clipboard = createClipboard(); bool actual = clipboard.empty(); EXPECT_EQ(true, actual); } TEST_F(CXWindowsClipboardTests, empty_singleFormat_hasReturnsFalse) { CXWindowsClipboard clipboard = createClipboard(); clipboard.add(CXWindowsClipboard::kText, "synergy rocks!"); clipboard.empty(); bool actual = clipboard.has(CXWindowsClipboard::kText); EXPECT_FALSE(actual); } TEST_F(CXWindowsClipboardTests, add_newValue_valueWasStored) { CXWindowsClipboard clipboard = createClipboard(); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST_F(CXWindowsClipboardTests, add_replaceValue_valueWasReplaced) { CXWindowsClipboard clipboard = createClipboard(); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.add(IClipboard::kText, "maxivista sucks"); // haha, just kidding. CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("maxivista sucks", actual); } TEST_F(CXWindowsClipboardTests, close_isOpen_noErrors) { CXWindowsClipboard clipboard = createClipboard(); // clipboard opened in createClipboard() clipboard.close(); // can't assert anything } TEST_F(CXWindowsClipboardTests, has_withFormatAdded_returnsTrue) { CXWindowsClipboard clipboard = createClipboard(); clipboard.add(IClipboard::kText, "synergy rocks!"); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(true, actual); } TEST_F(CXWindowsClipboardTests, has_withNoFormats_returnsFalse) { CXWindowsClipboard clipboard = createClipboard(); bool actual = clipboard.has(IClipboard::kText); EXPECT_FALSE(actual); } TEST_F(CXWindowsClipboardTests, get_withNoFormats_returnsEmpty) { CXWindowsClipboard clipboard = createClipboard(); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("", actual); } TEST_F(CXWindowsClipboardTests, get_withFormatAdded_returnsExpected) { CXWindowsClipboard clipboard = createClipboard(); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } synergy-1.4.12-Source/src/test/integtests/platform/CXWindowsKeyStateTests.cpp0000600000175000017500000001325212021261364027360 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 #define TEST_ENV #include "Global.h" #include "CMockKeyMap.h" #include "CMockEventQueue.h" #include "CXWindowsKeyState.h" #include "CLog.h" #include #define XK_LATIN1 #define XK_MISCELLANY #include "X11/keysymdef.h" #if HAVE_XKB_EXTENSION # include #endif class CXWindowsKeyStateTests : public ::testing::Test { protected: CXWindowsKeyStateTests() : m_display(NULL) { } ~CXWindowsKeyStateTests() { if (m_display != NULL) { LOG((CLOG_DEBUG "closing display")); XCloseDisplay(m_display); } } virtual void SetUp() { // open the display only once for the entire test suite if (this->m_display == NULL) { LOG((CLOG_DEBUG "opening display")); this->m_display = XOpenDisplay(NULL); ASSERT_TRUE(this->m_display != NULL) << "unable to open display: " << errno; } } virtual void TearDown() { } Display* m_display; }; TEST_F(CXWindowsKeyStateTests, setActiveGroup_pollAndSet_groupIsZero) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); keyState.setActiveGroup(CXWindowsKeyState::kGroupPollAndSet); ASSERT_EQ(0, keyState.m_group); } TEST_F(CXWindowsKeyStateTests, setActiveGroup_poll_groupIsNotSet) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); keyState.setActiveGroup(CXWindowsKeyState::kGroupPoll); ASSERT_LE(-1, keyState.m_group); } TEST_F(CXWindowsKeyStateTests, setActiveGroup_customGroup_groupWasSet) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); keyState.setActiveGroup(1); ASSERT_EQ(1, keyState.m_group); } TEST_F(CXWindowsKeyStateTests, mapModifiersFromX_zeroState_zeroMask) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); int mask = keyState.mapModifiersFromX(0); ASSERT_EQ(0, mask); } TEST_F(CXWindowsKeyStateTests, mapModifiersToX_zeroMask_resultIsTrue) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); unsigned int modifiers = 0; bool result = keyState.mapModifiersToX(0, modifiers); ASSERT_TRUE(result); } TEST_F(CXWindowsKeyStateTests, fakeCtrlAltDel_default_returnsFalse) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); bool result = keyState.fakeCtrlAltDel(); ASSERT_FALSE(result); } TEST_F(CXWindowsKeyStateTests, pollActiveModifiers_defaultState_returnsZero) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); KeyModifierMask actual = keyState.pollActiveModifiers(); ASSERT_EQ(0, actual); } TEST_F(CXWindowsKeyStateTests, pollActiveModifiers_shiftKeyDownThenUp_masksAreCorrect) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); // set mock modifier mapping std::fill( keyState.m_modifierFromX.begin(), keyState.m_modifierFromX.end(), 0); keyState.m_modifierFromX[ShiftMapIndex] = KeyModifierShift; KeyCode key = XKeysymToKeycode(m_display, XK_Shift_L); // fake shift key down (without using synergy) XTestFakeKeyEvent(m_display, key, true, CurrentTime); // function under test (1st call) KeyModifierMask modDown = keyState.pollActiveModifiers(); // fake shift key up (without using synergy) XTestFakeKeyEvent(m_display, key, false, CurrentTime); // function under test (2nd call) KeyModifierMask modUp = keyState.pollActiveModifiers(); EXPECT_TRUE((modDown & KeyModifierShift) == KeyModifierShift) << "shift key not in mask - key was not pressed"; EXPECT_TRUE((modUp & KeyModifierShift) == 0) << "shift key still in mask - make sure no keys are being held down"; } TEST_F(CXWindowsKeyStateTests, pollActiveGroup_defaultState_returnsZero) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); SInt32 actual = keyState.pollActiveGroup(); ASSERT_EQ(0, actual); } TEST_F(CXWindowsKeyStateTests, pollActiveGroup_positiveGroup_returnsGroup) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); keyState.m_group = 3; SInt32 actual = keyState.pollActiveGroup(); ASSERT_EQ(3, actual); } TEST_F(CXWindowsKeyStateTests, pollActiveGroup_xkb_areEqual) { #if HAVE_XKB_EXTENSION CMockKeyMap keyMap; CMockEventQueue eventQueue; CXWindowsKeyState keyState(m_display, true, eventQueue, keyMap); // reset the group keyState.m_group = -1; XkbStateRec state; // compare pollActiveGroup() with XkbGetState() if (XkbGetState(m_display, XkbUseCoreKbd, &state) == Success) { SInt32 actual = keyState.pollActiveGroup(); ASSERT_EQ(state.group, actual); } else { FAIL() << "XkbGetState() returned error " << errno; } #else SUCCEED() << "Xkb extension not installed"; #endif } synergy-1.4.12-Source/src/test/integtests/platform/CXWindowsScreenSaverTests.cpp0000600000175000017500000000251612021261364030050 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsScreenSaver.h" #include "CMockEventQueue.h" #include using ::testing::_; // TODO: not working on build machine for some reason #if 0 TEST(CXWindowsScreenSaverTests, activate_defaultScreen_todo) { Display* display = XOpenDisplay(":0.0"); Window window = DefaultRootWindow(display); CMockEventQueue eventQueue; EXPECT_CALL(eventQueue, removeHandler(_, _)).Times(1); CXWindowsScreenSaver screenSaver(display, window, NULL, eventQueue); screenSaver.activate(); bool isActive = screenSaver.isActive(); screenSaver.deactivate(); ASSERT_EQ(true, isActive); } #endifsynergy-1.4.12-Source/src/test/integtests/platform/CXWindowsScreenTests.cpp0000600000175000017500000000240212021261364027041 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CXWindowsScreen.h" #include "CMockEventQueue.h" using ::testing::_; TEST(CXWindowsScreenTests, fakeMouseMove_nonPrimary_getCursorPosValuesCorrect) { CMockEventQueue eventQueue; EXPECT_CALL(eventQueue, adoptHandler(_, _, _)).Times(2); EXPECT_CALL(eventQueue, adoptBuffer(_)).Times(2); EXPECT_CALL(eventQueue, removeHandler(_, _)).Times(2); CXWindowsScreen screen(":0.0", false, false, 0, eventQueue); screen.fakeMouseMove(10, 20); int x, y; screen.getCursorPos(x, y); ASSERT_EQ(10, x); ASSERT_EQ(20, y); } synergy-1.4.12-Source/src/test/unittests/0000700000175000017500000000000012140644175020321 5ustar synergysynergysynergy-1.4.12-Source/src/test/unittests/client/0000700000175000017500000000000012140644175021577 5ustar synergysynergysynergy-1.4.12-Source/src/test/unittests/client/CMockClient.h0000600000175000017500000000211612140235162024075 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #define TEST_ENV #include "CClient.h" class IEventQueue; class CMockClient : public CClient { public: CMockClient() { m_mock = true; } MOCK_METHOD2(mouseMove, void(SInt32, SInt32)); MOCK_METHOD1(setOptions, void(const COptionsList&)); MOCK_METHOD0(handshakeComplete, void()); MOCK_METHOD1(setDecryptIv, void(const UInt8*)); }; synergy-1.4.12-Source/src/test/unittests/client/CServerProxyTests.cpp0000600000175000017500000000610112140235572025736 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #define TEST_ENV #include #include "CServerProxy.h" #include "CMockClient.h" #include "CMockStream.h" #include "CMockEventQueue.h" #include "ProtocolTypes.h" using ::testing::_; using ::testing::Invoke; using ::testing::NiceMock; using ::testing::AnyNumber; const UInt8 g_mouseMove_bufferLen = 16; UInt8 g_mouseMove_buffer[g_mouseMove_bufferLen]; UInt32 g_mouseMove_bufferIndex; UInt32 mouseMove_mockRead(void* buffer, UInt32 n); const UInt8 g_readCryptoIv_bufferLen = 20; UInt8 g_readCryptoIv_buffer[g_readCryptoIv_bufferLen]; UInt32 g_readCryptoIv_bufferIndex; CString g_readCryptoIv_result; UInt32 readCryptoIv_mockRead(void* buffer, UInt32 n); void readCryptoIv_setDecryptIv(const UInt8*); TEST(CServerProxyTests, mouseMove) { g_mouseMove_bufferIndex = 0; NiceMock eventQueue; NiceMock client; NiceMock stream; ON_CALL(stream, read(_, _)).WillByDefault(Invoke(mouseMove_mockRead)); EXPECT_CALL(client, mouseMove(1, 2)).Times(1); const char data[] = "DSOP\0\0\0\0DMMV\0\1\0\2"; memcpy(g_mouseMove_buffer, data, g_mouseMove_bufferLen); CServerProxy serverProxy(&client, &stream, &eventQueue); serverProxy.handleDataForTest(); } TEST(CServerProxyTests, readCryptoIv) { g_readCryptoIv_bufferIndex = 0; NiceMock eventQueue; NiceMock client; NiceMock stream; ON_CALL(stream, read(_, _)).WillByDefault(Invoke(readCryptoIv_mockRead)); ON_CALL(client, setDecryptIv(_)).WillByDefault(Invoke(readCryptoIv_setDecryptIv)); const char data[] = "DSOP\0\0\0\0DCIV\0\0\0\4mock"; memcpy(g_readCryptoIv_buffer, data, g_readCryptoIv_bufferLen); CServerProxy serverProxy(&client, &stream, &eventQueue); serverProxy.handleDataForTest(); EXPECT_EQ("mock", g_readCryptoIv_result); } UInt32 mouseMove_mockRead(void* buffer, UInt32 n) { if (g_mouseMove_bufferIndex >= g_mouseMove_bufferLen) { return 0; } memcpy(buffer, &g_mouseMove_buffer[g_mouseMove_bufferIndex], n); g_mouseMove_bufferIndex += n; return n; } UInt32 readCryptoIv_mockRead(void* buffer, UInt32 n) { if (g_readCryptoIv_bufferIndex >= g_readCryptoIv_bufferLen) { return 0; } memcpy(buffer, &g_readCryptoIv_buffer[g_readCryptoIv_bufferIndex], n); g_readCryptoIv_bufferIndex += n; return n; } void readCryptoIv_setDecryptIv(const UInt8* data) { g_readCryptoIv_result = reinterpret_cast(data); } synergy-1.4.12-Source/src/test/unittests/CMakeLists.txt0000600000175000017500000000321312131062123023045 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(h synergy/CKeyStateTests.h synergy/CMockEventQueue.h synergy/CMockKeyMap.h client/CMockClient.h io/CMockStream.h server/CMockServer.h io/CMockCryptoStream.h ) set(src ${h} Main.cpp synergy/CClipboardTests.cpp synergy/CKeyStateTests.cpp client/CServerProxyTests.cpp synergy/CCryptoStreamTests.cpp server/CClientProxyTests.cpp ) set(inc ../../lib/arch ../../lib/base ../../lib/client ../../lib/server ../../lib/common ../../lib/io ../../lib/mt ../../lib/net ../../lib/platform ../../lib/synergy ../../../tools/gtest-1.6.0/include ../../../tools/gmock-1.6.0/include ../../../tools io synergy ) if (UNIX) list(APPEND inc ../../.. ) endif() if (WIN32) if (GAME_DEVICE_SUPPORT) link_directories("$ENV{DXSDK_DIR}/Lib/x86") endif() endif() include_directories(${inc}) add_executable(unittests ${src}) target_link_libraries(unittests arch base client server common io net platform server synergy mt gtest gmock cryptopp ${libs}) synergy-1.4.12-Source/src/test/unittests/io/0000700000175000017500000000000012140644175020730 5ustar synergysynergysynergy-1.4.12-Source/src/test/unittests/io/CMockCryptoStream.h0000600000175000017500000000207412131107263024447 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include "CCryptoStream.h" #include "CCryptoOptions.h" class CMockCryptoStream : public CCryptoStream { public: CMockCryptoStream(IEventQueue* eventQueue, IStream* stream) : CCryptoStream(eventQueue, stream, CCryptoOptions("gcm", "stub"), false) { } MOCK_METHOD2(read, UInt32(void*, UInt32)); MOCK_METHOD2(write, void(const void*, UInt32)); }; synergy-1.4.12-Source/src/test/unittests/io/CMockStream.h0000600000175000017500000000270412131062123023241 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #include "IStream.h" class IEventQueue; class CMockStream : public synergy::IStream { public: CMockStream() : synergy::IStream(NULL) { } MOCK_METHOD0(close, void()); MOCK_METHOD2(read, UInt32(void*, UInt32)); MOCK_METHOD2(write, void(const void*, UInt32)); MOCK_METHOD0(flush, void()); MOCK_METHOD0(shutdownInput, void()); MOCK_METHOD0(shutdownOutput, void()); MOCK_METHOD0(getInputReadyEvent, CEvent::Type()); MOCK_METHOD0(getOutputErrorEvent, CEvent::Type()); MOCK_METHOD0(getInputShutdownEvent, CEvent::Type()); MOCK_METHOD0(getOutputShutdownEvent, CEvent::Type()); MOCK_CONST_METHOD0(getEventTarget, void*()); MOCK_CONST_METHOD0(isReady, bool()); MOCK_CONST_METHOD0(getSize, UInt32()); }; synergy-1.4.12-Source/src/test/unittests/Main.cpp0000600000175000017500000000221312127576354021721 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CArch.h" #include "CLog.h" #if SYSAPI_WIN32 #include "CArchMiscWindows.h" #endif int main(int argc, char **argv) { #if SYSAPI_WIN32 // HACK: shouldn't be needed, but logging fails without this. CArchMiscWindows::setInstanceWin32(GetModuleHandle(NULL)); #endif CArch arch; arch.init(); CLog log; log.setFilter(kDEBUG4); testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/src/test/unittests/server/0000700000175000017500000000000012140644175021627 5ustar synergysynergysynergy-1.4.12-Source/src/test/unittests/server/CClientProxyTests.cpp0000600000175000017500000000757212140235162025746 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClientProxy1_4.h" #include "CMockServer.h" #include "CMockStream.h" #include "CMockCryptoStream.h" #include "CMockEventQueue.h" using ::testing::_; using ::testing::NiceMock; using ::testing::Invoke; const UInt8 g_cryptoIvWrite_bufferLen = 200; UInt8 g_cryptoIvWrite_buffer[g_cryptoIvWrite_bufferLen]; UInt32 g_cryptoIvWrite_writeBufferIndex; UInt32 g_cryptoIvWrite_readBufferIndex; void cryptoIv_mockWrite(const void* in, UInt32 n); UInt8 cryptoIv_mockRead(void* out, UInt32 n); TEST(CClientProxyTests, cryptoIvWrite) { g_cryptoIvWrite_writeBufferIndex = 0; g_cryptoIvWrite_readBufferIndex = 0; NiceMock eventQueue; NiceMock innerStream; NiceMock server; CCryptoOptions options("ctr", "mock"); CCryptoStream* serverStream = new CCryptoStream(&eventQueue, &innerStream, options, false); CCryptoStream* clientStream = new CCryptoStream(&eventQueue, &innerStream, options, false); byte iv[CRYPTO_IV_SIZE]; serverStream->newIv(iv); serverStream->setEncryptIv(iv); clientStream->setDecryptIv(iv); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(cryptoIv_mockWrite)); ON_CALL(innerStream, read(_, _)).WillByDefault(Invoke(cryptoIv_mockRead)); CClientProxy1_4 clientProxy("stub", serverStream, &server, &eventQueue); UInt8 buffer[100]; clientStream->read(buffer, 4); g_cryptoIvWrite_writeBufferIndex = 0; g_cryptoIvWrite_readBufferIndex = 0; // DCIV, then DKDN. clientProxy.keyDown(1, 2, 3); clientStream->read(buffer, 24); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('C', buffer[1]); EXPECT_EQ('I', buffer[2]); EXPECT_EQ('V', buffer[3]); clientStream->setDecryptIv(&buffer[8]); clientStream->read(buffer, 10); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('K', buffer[1]); EXPECT_EQ('D', buffer[2]); EXPECT_EQ('N', buffer[3]); g_cryptoIvWrite_writeBufferIndex = 0; g_cryptoIvWrite_readBufferIndex = 0; // DCIV, then DKUP. clientProxy.keyUp(1, 2, 3); clientStream->read(buffer, 24); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('C', buffer[1]); EXPECT_EQ('I', buffer[2]); EXPECT_EQ('V', buffer[3]); clientStream->setDecryptIv(&buffer[8]); clientStream->read(buffer, 10); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('K', buffer[1]); EXPECT_EQ('U', buffer[2]); EXPECT_EQ('P', buffer[3]); g_cryptoIvWrite_writeBufferIndex = 0; g_cryptoIvWrite_readBufferIndex = 0; // DCIV, then DKRP. clientProxy.keyRepeat(1, 2, 4, 4); clientStream->read(buffer, 24); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('C', buffer[1]); EXPECT_EQ('I', buffer[2]); EXPECT_EQ('V', buffer[3]); clientStream->setDecryptIv(&buffer[8]); clientStream->read(buffer, 12); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('K', buffer[1]); EXPECT_EQ('R', buffer[2]); EXPECT_EQ('P', buffer[3]); } void cryptoIv_mockWrite(const void* in, UInt32 n) { assert(g_cryptoIvWrite_writeBufferIndex <= sizeof(g_cryptoIvWrite_buffer)); memcpy(&g_cryptoIvWrite_buffer[g_cryptoIvWrite_writeBufferIndex], in, n); g_cryptoIvWrite_writeBufferIndex += n; } UInt8 cryptoIv_mockRead(void* out, UInt32 n) { assert(g_cryptoIvWrite_readBufferIndex <= sizeof(g_cryptoIvWrite_buffer)); memcpy(out, &g_cryptoIvWrite_buffer[g_cryptoIvWrite_readBufferIndex], n); g_cryptoIvWrite_readBufferIndex += n; return n; } synergy-1.4.12-Source/src/test/unittests/server/CMockServer.h0000600000175000017500000000156712131447503024172 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 . */ #pragma once #include #define TEST_ENV #include "CServer.h" class IEventQueue; class CMockServer : public CServer { public: CMockServer() : CServer() { m_mock = true; } }; synergy-1.4.12-Source/src/test/unittests/synergy/0000700000175000017500000000000012140644175022021 5ustar synergysynergysynergy-1.4.12-Source/src/test/unittests/synergy/CClipboardTests.cpp0000600000175000017500000002401112021261364025543 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CClipboard.h" TEST(CClipboardTests, empty_openCalled_returnsTrue) { CClipboard clipboard; clipboard.open(0); bool actual = clipboard.empty(); EXPECT_EQ(true, actual); } TEST(CClipboardTests, empty_singleFormat_hasReturnsFalse) { CClipboard clipboard; clipboard.open(0); clipboard.add(CClipboard::kText, "synergy rocks!"); clipboard.empty(); bool actual = clipboard.has(CClipboard::kText); EXPECT_FALSE(actual); } TEST(CClipboardTests, add_newValue_valueWasStored) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST(CClipboardTests, add_replaceValue_valueWasReplaced) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.add(IClipboard::kText, "maxivista sucks"); // haha, just kidding. CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("maxivista sucks", actual); } TEST(CClipboardTests, open_timeIsZero_returnsTrue) { CClipboard clipboard; bool actual = clipboard.open(0); EXPECT_EQ(true, actual); } TEST(CClipboardTests, open_timeIsOne_returnsTrue) { CClipboard clipboard; bool actual = clipboard.open(1); EXPECT_EQ(true, actual); } TEST(CClipboardTests, close_isOpen_noErrors) { CClipboard clipboard; clipboard.open(0); clipboard.close(); // can't assert anything } TEST(CClipboardTests, getTime_openWithNoEmpty_returnsZero) { CClipboard clipboard; clipboard.open(1); CClipboard::Time actual = clipboard.getTime(); EXPECT_EQ(0, actual); } TEST(CClipboardTests, getTime_openAndEmpty_returnsOne) { CClipboard clipboard; clipboard.open(1); clipboard.empty(); CClipboard::Time actual = clipboard.getTime(); EXPECT_EQ(1, actual); } TEST(CClipboardTests, has_withFormatAdded_returnsTrue) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); bool actual = clipboard.has(IClipboard::kText); EXPECT_EQ(true, actual); } TEST(CClipboardTests, has_withNoFormats_returnsFalse) { CClipboard clipboard; clipboard.open(0); bool actual = clipboard.has(IClipboard::kText); EXPECT_FALSE(actual); } TEST(CClipboardTests, get_withNoFormats_returnsEmpty) { CClipboard clipboard; clipboard.open(0); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("", actual); } TEST(CClipboardTests, get_withFormatAdded_returnsExpected) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST(CClipboardTests, marshall_addNotCalled_firstCharIsZero) { CClipboard clipboard; CString actual = clipboard.marshall(); // seems to return "\0\0\0\0" but EXPECT_EQ can't assert this, // so instead, just assert that first char is '\0'. EXPECT_EQ(0, (int)actual[0]); } TEST(CClipboardTests, marshall_withTextAdded_typeCharIsText) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.close(); CString actual = clipboard.marshall(); // string contains other data, but 8th char should be kText. EXPECT_EQ(IClipboard::kText, (int)actual[7]); } TEST(CClipboardTests, marshall_withTextAdded_lastSizeCharIs14) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); // 14 chars clipboard.close(); CString actual = clipboard.marshall(); EXPECT_EQ(14, (int)actual[11]); } // TODO: there's some integer -> char encoding going on here. i find it // hard to believe that the clipboard is the only thing doing this. maybe // we should refactor this stuff out of the clipboard. TEST(CClipboardTests, marshall_withTextSize285_sizeCharsValid) { // 285 chars CString data; data.append("Synergy is Free and Open Source Software that lets you "); data.append("easily share your mouse and keyboard between multiple "); data.append("computers, where each computer has it's own display. No "); data.append("special hardware is required, all you need is a local area "); data.append("network. Synergy is supported on Windows, Mac OS X and Linux."); CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, data); clipboard.close(); CString actual = clipboard.marshall(); // 4 asserts here, but that's ok because we're really just asserting 1 // thing. the 32-bit size value is split into 4 chars. if the size is 285 // (29 more than the 8-bit max size), the last char "rolls over" to 29 // (this is caused by a bit-wise & on 0xff and 8-bit truncation). each // char before the last stores a bit-shifted version of the number, each // 1 more power than the last, which is done by bit-shifting [0] by 24, // [1] by 16, [2] by 8 ([3] is not bit-shifted). EXPECT_EQ(0, actual[8]); // 285 >> 24 = 285 / (256^3) = 0 EXPECT_EQ(0, actual[9]); // 285 >> 16 = 285 / (256^2) = 0 EXPECT_EQ(1, actual[10]); // 285 >> 8 = 285 / (256^1) = 1(.11328125) EXPECT_EQ(29, actual[11]); // 285 - 256 = 29 } TEST(CClipboardTests, marshall_withHtmlAdded_typeCharIsHtml) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kHTML, "html sucks"); clipboard.close(); CString actual = clipboard.marshall(); // string contains other data, but 8th char should be kHTML. EXPECT_EQ(IClipboard::kHTML, (int)actual[7]); } TEST(CClipboardTests, marshall_withHtmlAndText_has2Formats) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks"); clipboard.add(IClipboard::kHTML, "html sucks"); clipboard.close(); CString actual = clipboard.marshall(); // the number of formats is stored inside the first 4 chars. // the writeUInt32 function right-aligns numbers in 4 chars, // so if you right align 2, it will be "\0\0\0\2" in a string. // we assert that the char at the 4th index is 2 (the number of // formats that we've added). EXPECT_EQ(2, (int)actual[3]); } TEST(CClipboardTests, marshall_withTextAdded_endsWithAdded) { CClipboard clipboard; clipboard.open(0); clipboard.add(IClipboard::kText, "synergy rocks!"); clipboard.close(); CString actual = clipboard.marshall(); // string contains other data, but should end in the string we added. EXPECT_EQ("synergy rocks!", actual.substr(12)); } TEST(CClipboardTests, unmarshall_emptyData_hasTextIsFalse) { CClipboard clipboard; CString data; data += (char)0; data += (char)0; data += (char)0; data += (char)0; // 0 formats added clipboard.unmarshall(data, 0); clipboard.open(0); bool actual = clipboard.has(IClipboard::kText); EXPECT_FALSE(actual); } TEST(CClipboardTests, unmarshall_withTextSize285_getTextIsValid) { CClipboard clipboard; // 285 chars CString text; text.append("Synergy is Free and Open Source Software that lets you "); text.append("easily share your mouse and keyboard between multiple "); text.append("computers, where each computer has it's own display. No "); text.append("special hardware is required, all you need is a local area "); text.append("network. Synergy is supported on Windows, Mac OS X and Linux."); CString data; data += (char)0; data += (char)0; data += (char)0; data += (char)1; // 1 format added data += (char)0; data += (char)0; data += (char)0; data += (char)IClipboard::kText; data += (char)0; // 285 >> 24 = 285 / (256^3) = 0 data += (char)0; // 285 >> 16 = 285 / (256^2) = 0 data += (char)1; // 285 >> 8 = 285 / (256^1) = 1(.11328125) data += (char)29; // 285 - 256 = 29 data += text; clipboard.unmarshall(data, 0); clipboard.open(0); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ(text, actual); } TEST(CClipboardTests, unmarshall_withTextAndHtml_getTextIsValid) { CClipboard clipboard; CString data; data += (char)0; data += (char)0; data += (char)0; data += (char)2; // 2 formats added data += (char)0; data += (char)0; data += (char)0; data += (char)IClipboard::kText; data += (char)0; data += (char)0; data += (char)0; data += (char)14; data += "synergy rocks!"; data += (char)0; data += (char)0; data += (char)0; data += (char)IClipboard::kHTML; data += (char)0; data += (char)0; data += (char)0; data += (char)10; data += "html sucks"; clipboard.unmarshall(data, 0); clipboard.open(0); CString actual = clipboard.get(IClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } TEST(CClipboardTests, unmarshall_withTextAndHtml_getHtmlIsValid) { CClipboard clipboard; CString data; data += (char)0; data += (char)0; data += (char)0; data += (char)2; // 2 formats added data += (char)0; data += (char)0; data += (char)0; data += (char)IClipboard::kText; data += (char)0; data += (char)0; data += (char)0; data += (char)14; data += "synergy rocks!"; data += (char)0; data += (char)0; data += (char)0; data += (char)IClipboard::kHTML; data += (char)0; data += (char)0; data += (char)0; data += (char)10; data += "html sucks"; clipboard.unmarshall(data, 0); clipboard.open(0); CString actual = clipboard.get(IClipboard::kHTML); EXPECT_EQ("html sucks", actual); } TEST(CClipboardTests, copy_withSingleText_clipboardsAreEqual) { CClipboard clipboard1; clipboard1.open(0); clipboard1.add(CClipboard::kText, "synergy rocks!"); clipboard1.close(); CClipboard clipboard2; CClipboard::copy(&clipboard2, &clipboard1); clipboard2.open(0); CString actual = clipboard2.get(CClipboard::kText); EXPECT_EQ("synergy rocks!", actual); } synergy-1.4.12-Source/src/test/unittests/synergy/CCryptoStreamTests.cpp0000600000175000017500000002207612140235270026310 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2013 Bolton Software Ltd. * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CCryptoStream.h" #include "CMockStream.h" #include "CMockEventQueue.h" #include "CPacketStreamFilter.h" #include "CCryptoOptions.h" using ::testing::_; using ::testing::Invoke; using ::testing::NiceMock; using namespace std; const byte kIv[] = "aaaaaaaaaaaaaaaa"; // AES block size = 16 (\0 not used) UInt8 g_write_buffer[4]; void write_mockWrite(const void* in, UInt32 n); UInt8 g_read_buffer[4]; UInt8 read_mockRead(void* out, UInt32 n); UInt8 g_write4Read1_buffer[4]; UInt32 g_write4Read1_bufferIndex; void write4Read1_mockWrite(const void* in, UInt32 n); UInt8 write4Read1_mockRead(void* out, UInt32 n); UInt8 g_write1Read4_buffer[4]; UInt32 g_write1Read4_bufferIndex; void write1Read4_mockWrite(const void* in, UInt32 n); UInt8 write1Read4_mockRead(void* out, UInt32 n); UInt8 g_readWriteIvChanged_buffer[4]; UInt32 g_readWriteIvChangeTrigger_writeBufferIndex; UInt32 g_readWriteIvChangeTrigger_readBufferIndex; void readWriteIvChanged_mockWrite(const void* in, UInt32 n); UInt8 readWriteIvChanged_mockRead(void* out, UInt32 n); UInt8 g_readWriteIvChangeTrigger_buffer[4 + 4 + 16]; // abcd, DCIV, 16-byte IV void readWriteIvChangeTrigger_mockWrite(const void* in, UInt32 n); UInt8 readWriteIvChangeTrigger_mockRead(void* out, UInt32 n); UInt8 g_newIvDoesNotChangeIv_buffer[1]; void newIvDoesNotChangeIv_mockWrite(const void* in, UInt32 n); TEST(CCryptoStreamTests, write) { const UInt32 size = 4; UInt8* buffer = new UInt8[size]; buffer[0] = 'D'; buffer[1] = 'K'; buffer[2] = 'D'; buffer[3] = 'N'; NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(write_mockWrite)); CCryptoStream cs(&eventQueue, &innerStream, options, false); cs.setEncryptIv(kIv); cs.write(buffer, size); EXPECT_EQ(95, g_write_buffer[0]); EXPECT_EQ(107, g_write_buffer[1]); EXPECT_EQ(152, g_write_buffer[2]); EXPECT_EQ(220, g_write_buffer[3]); } TEST(CCryptoStreamTests, read) { NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, read(_, _)).WillByDefault(Invoke(read_mockRead)); CCryptoStream cs(&eventQueue, &innerStream, options, false); cs.setEncryptIv(kIv); cs.setDecryptIv(kIv); g_read_buffer[0] = 95; g_read_buffer[1] = 107; g_read_buffer[2] = 152; g_read_buffer[3] = 220; const UInt32 size = 4; UInt8* buffer = new UInt8[size]; cs.read(buffer, size); EXPECT_EQ('D', buffer[0]); EXPECT_EQ('K', buffer[1]); EXPECT_EQ('D', buffer[2]); EXPECT_EQ('N', buffer[3]); } TEST(CCryptoStreamTests, write4Read1) { g_write4Read1_bufferIndex = 0; NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(write4Read1_mockWrite)); ON_CALL(innerStream, read(_, _)).WillByDefault(Invoke(write4Read1_mockRead)); CCryptoStream cs1(&eventQueue, &innerStream, options, false); cs1.setEncryptIv(kIv); cs1.write("a", 1); cs1.write("b", 1); cs1.write("c", 1); cs1.write("d", 1); CCryptoStream cs2(&eventQueue, &innerStream, options, false); cs2.setDecryptIv(kIv); UInt8 buffer[4]; cs2.read(buffer, 4); EXPECT_EQ('a', buffer[0]); EXPECT_EQ('b', buffer[1]); EXPECT_EQ('c', buffer[2]); EXPECT_EQ('d', buffer[3]); } TEST(CCryptoStreamTests, write1Read4) { g_write1Read4_bufferIndex = 0; NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(write1Read4_mockWrite)); ON_CALL(innerStream, read(_, _)).WillByDefault(Invoke(write1Read4_mockRead)); CCryptoStream cs1(&eventQueue, &innerStream, options, false); cs1.setEncryptIv(kIv); UInt8 bufferIn[4]; bufferIn[0] = 'a'; bufferIn[1] = 'b'; bufferIn[2] = 'c'; bufferIn[3] = 'd'; cs1.write(bufferIn, 4); CCryptoStream cs2(&eventQueue, &innerStream, options, false); cs2.setDecryptIv(kIv); UInt8 bufferOut[4]; cs2.read(&bufferOut[0], 1); cs2.read(&bufferOut[1], 1); cs2.read(&bufferOut[2], 1); cs2.read(&bufferOut[3], 1); EXPECT_EQ('a', bufferOut[0]); EXPECT_EQ('b', bufferOut[1]); EXPECT_EQ('c', bufferOut[2]); EXPECT_EQ('d', bufferOut[3]); } TEST(CCryptoStreamTests, readWriteIvChanged) { g_readWriteIvChangeTrigger_writeBufferIndex = 0; g_readWriteIvChangeTrigger_readBufferIndex = 0; NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(readWriteIvChanged_mockWrite)); ON_CALL(innerStream, read(_, _)).WillByDefault(Invoke(readWriteIvChanged_mockRead)); // AES block size = 16 (\0 not used) const byte iv1[] = "aaaaaaaaaaaaaaaa"; const byte iv2[] = "bbbbbbbbbbbbbbbb"; CCryptoStream cs1(&eventQueue, &innerStream, options, false); cs1.setEncryptIv(iv1); UInt8 bufferIn[4]; bufferIn[0] = 'a'; bufferIn[1] = 'b'; bufferIn[2] = 'c'; bufferIn[3] = 'd'; cs1.write(bufferIn, 4); CCryptoStream cs2(&eventQueue, &innerStream, options, false); cs1.setDecryptIv(iv2); UInt8 bufferOut[4]; cs2.read(bufferOut, 4); // assert that the values cannot be decrypted, since the second crypto // class instance is using a different IV. EXPECT_NE('a', bufferOut[0]); EXPECT_NE('b', bufferOut[1]); EXPECT_NE('c', bufferOut[2]); EXPECT_NE('d', bufferOut[3]); // generate a new IV and copy it to the second crypto class, and // ensure that the new IV is used. byte iv[CRYPTO_IV_SIZE]; cs1.newIv(iv); cs1.setEncryptIv(iv); cs2.setDecryptIv(iv); cs1.write(bufferIn, 4); cs2.read(bufferOut, 4); EXPECT_EQ('a', bufferOut[0]); EXPECT_EQ('b', bufferOut[1]); EXPECT_EQ('c', bufferOut[2]); EXPECT_EQ('d', bufferOut[3]); } TEST(CCryptoStreamTests, createKey) { byte hash1[16]; CCryptoStream::createKey(hash1, "MockLongPassword", 16, 16); EXPECT_EQ(hash1[0], 149); EXPECT_EQ(hash1[15], 235); byte hash2[32]; CCryptoStream::createKey(hash2, "MockLongPassword", 32, 16); EXPECT_EQ(hash2[0], 149); EXPECT_EQ(hash2[15], 235); EXPECT_EQ(hash2[31], 7); byte hash3[32]; CCryptoStream::createKey(hash3, "7accbf2f86a9191da0947107d4fe7054", 32, 16); EXPECT_EQ(hash3[0], 120); EXPECT_EQ(hash3[15], 11); EXPECT_EQ(hash3[31], 233); } TEST(CCryptoStreamTests, newIvDoesNotChangeIv) { NiceMock eventQueue; NiceMock innerStream; CCryptoOptions options("ctr", "mock"); ON_CALL(innerStream, write(_, _)).WillByDefault(Invoke(newIvDoesNotChangeIv_mockWrite)); CCryptoStream cs1(&eventQueue, &innerStream, options, false); cs1.write("a", 1); EXPECT_EQ(175, g_newIvDoesNotChangeIv_buffer[0]); byte iv[CRYPTO_IV_SIZE]; cs1.newIv(iv); cs1.write("a", 1); EXPECT_EQ(92, g_newIvDoesNotChangeIv_buffer[0]); } void write_mockWrite(const void* in, UInt32 n) { memcpy(g_write_buffer, in, n); } UInt8 read_mockRead(void* out, UInt32 n) { memcpy(out, g_read_buffer, n); return n; } void write4Read1_mockWrite(const void* in, UInt32 n) { UInt8* buffer = static_cast(const_cast(in)); g_write4Read1_buffer[g_write4Read1_bufferIndex++] = buffer[0]; } UInt8 write4Read1_mockRead(void* out, UInt32 n) { memcpy(out, g_write4Read1_buffer, n); return n; } void write1Read4_mockWrite(const void* in, UInt32 n) { memcpy(g_write1Read4_buffer, in, n); } UInt8 write1Read4_mockRead(void* out, UInt32 n) { UInt8* buffer = static_cast(out); buffer[0] = g_write1Read4_buffer[g_write1Read4_bufferIndex++]; return 1; } void readWriteIvChanged_mockWrite(const void* in, UInt32 n) { memcpy(g_readWriteIvChanged_buffer, in, n); } UInt8 readWriteIvChanged_mockRead(void* out, UInt32 n) { memcpy(out, g_readWriteIvChanged_buffer, n); return n; } void readWriteIvChangeTrigger_mockWrite(const void* in, UInt32 n) { assert(g_readWriteIvChangeTrigger_writeBufferIndex <= sizeof(g_readWriteIvChangeTrigger_buffer)); memcpy(&g_readWriteIvChangeTrigger_buffer[g_readWriteIvChangeTrigger_writeBufferIndex], in, n); g_readWriteIvChangeTrigger_writeBufferIndex += n; } UInt8 readWriteIvChangeTrigger_mockRead(void* out, UInt32 n) { assert(g_readWriteIvChangeTrigger_readBufferIndex <= sizeof(g_readWriteIvChangeTrigger_buffer)); memcpy(out, &g_readWriteIvChangeTrigger_buffer[g_readWriteIvChangeTrigger_readBufferIndex], n); g_readWriteIvChangeTrigger_readBufferIndex += n; return n; } void newIvDoesNotChangeIv_mockWrite(const void* in, UInt32 n) { memcpy(g_newIvDoesNotChangeIv_buffer, in, 1); } synergy-1.4.12-Source/src/test/unittests/synergy/CKeyStateTests.cpp0000600000175000017500000002766512021261364025417 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 "CKeyStateTests.h" #include "CMockEventQueue.h" #include "CMockKeyMap.h" using ::testing::_; using ::testing::NiceMock; using ::testing::Invoke; using ::testing::Return; using ::testing::SaveArg; TEST(CKeyStateTests, onKey_aKeyDown_keyStateOne) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); keyState.onKey(1, true, KeyModifierAlt); EXPECT_EQ(1, keyState.getKeyState(1)); } TEST(CKeyStateTests, onKey_aKeyUp_keyStateZero) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); keyState.onKey(1, false, KeyModifierAlt); EXPECT_EQ(0, keyState.getKeyState(1)); } TEST(CKeyStateTests, onKey_invalidKey_keyStateZero) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); keyState.onKey(0, true, KeyModifierAlt); EXPECT_EQ(0, keyState.getKeyState(0)); } TEST(CKeyStateTests, sendKeyEvent_halfDuplexAndRepeat_addEventNotCalled) { NiceMock keyMap; NiceMock eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); ON_CALL(keyMap, isHalfDuplex(_, _)).WillByDefault(Return(true)); EXPECT_CALL(eventQueue, addEvent(_)).Times(0); keyState.sendKeyEvent(NULL, false, true, kKeyCapsLock, 0, 0, 0); } TEST(CKeyStateTests, sendKeyEvent_halfDuplex_addEventCalledTwice) { NiceMock keyMap; NiceMock eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); ON_CALL(keyMap, isHalfDuplex(_, _)).WillByDefault(Return(true)); EXPECT_CALL(eventQueue, addEvent(_)).Times(2); keyState.sendKeyEvent(NULL, false, false, kKeyCapsLock, 0, 0, 0); } TEST(CKeyStateTests, sendKeyEvent_keyRepeat_addEventCalledOnce) { NiceMock keyMap; NiceMock eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(eventQueue, addEvent(_)).Times(1); keyState.sendKeyEvent(NULL, false, true, 1, 0, 0, 0); } TEST(CKeyStateTests, sendKeyEvent_keyDown_addEventCalledOnce) { NiceMock keyMap; NiceMock eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(eventQueue, addEvent(_)).Times(1); keyState.sendKeyEvent(NULL, true, false, 1, 0, 0, 0); } TEST(CKeyStateTests, sendKeyEvent_keyUp_addEventCalledOnce) { NiceMock keyMap; NiceMock eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(eventQueue, addEvent(_)).Times(1); keyState.sendKeyEvent(NULL, false, false, 1, 0, 0, 0); } TEST(CKeyStateTests, updateKeyMap_mockKeyMap_keyMapGotMock) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // key map member gets a new key map via swap() EXPECT_CALL(keyMap, swap(_)); keyState.updateKeyMap(); } TEST(CKeyStateTests, updateKeyState_pollInsertsSingleKey_keyIsDown) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); ON_CALL(keyState, pollPressedKeys(_)).WillByDefault(Invoke(stubPollPressedKeys)); keyState.updateKeyState(); bool actual = keyState.isKeyDown(1); ASSERT_TRUE(actual); } TEST(CKeyStateTests, updateKeyState_pollDoesNothing_keyNotSet) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); keyState.updateKeyState(); bool actual = keyState.isKeyDown(1); ASSERT_FALSE(actual); } TEST(CKeyStateTests, updateKeyState_activeModifiers_maskSet) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); ON_CALL(keyState, pollActiveModifiers()).WillByDefault(Return(KeyModifierAlt)); keyState.updateKeyState(); KeyModifierMask actual = keyState.getActiveModifiers(); ASSERT_EQ(KeyModifierAlt, actual); } TEST(CKeyStateTests, updateKeyState_activeModifiers_maskNotSet) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); keyState.updateKeyState(); KeyModifierMask actual = keyState.getActiveModifiers(); ASSERT_EQ(0, actual); } TEST(CKeyStateTests, updateKeyState_activeModifiers_keyMapGotModifers) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); ON_CALL(keyState, pollActiveModifiers()).WillByDefault(Return(1)); ON_CALL(keyMap, foreachKey(_, _)).WillByDefault(Invoke(assertMaskIsOne)); // key map gets new modifiers via foreachKey() EXPECT_CALL(keyMap, foreachKey(_, _)); keyState.updateKeyState(); } TEST(CKeyStateTests, setHalfDuplexMask_capsLock_halfDuplexCapsLockAdded) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(keyMap, addHalfDuplexModifier(kKeyCapsLock)); keyState.setHalfDuplexMask(KeyModifierCapsLock); } TEST(CKeyStateTests, setHalfDuplexMask_numLock_halfDuplexNumLockAdded) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(keyMap, addHalfDuplexModifier(kKeyNumLock)); keyState.setHalfDuplexMask(KeyModifierNumLock); } TEST(CKeyStateTests, setHalfDuplexMask_scrollLock_halfDuplexScollLockAdded) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(keyMap, addHalfDuplexModifier(kKeyScrollLock)); keyState.setHalfDuplexMask(KeyModifierScrollLock); } TEST(CKeyStateTests, fakeKeyDown_serverKeyAlreadyDown_fakeKeyCalledTwice) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); s_stubKeyItem.m_client = 0; s_stubKeyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); // 2 calls to fakeKeyDown should still call fakeKey, even though // repeated keys are handled differently. EXPECT_CALL(keyState, fakeKey(_)).Times(2); // call twice to simulate server key already down (a misreported autorepeat). keyState.fakeKeyDown(1, 0, 0); keyState.fakeKeyDown(1, 0, 0); } TEST(CKeyStateTests, fakeKeyDown_isIgnoredKey_fakeKeyNotCalled) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); EXPECT_CALL(keyState, fakeKey(_)).Times(0); keyState.fakeKeyDown(kKeyCapsLock, 0, 0); } TEST(CKeyStateTests, fakeKeyDown_mapReturnsKeystrokes_fakeKeyCalled) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); s_stubKeyItem.m_button = 0; s_stubKeyItem.m_client = 0; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); EXPECT_CALL(keyState, fakeKey(_)).Times(1); keyState.fakeKeyDown(1, 0, 0); } TEST(CKeyStateTests, fakeKeyRepeat_invalidKey_returnsFalse) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); bool actual = keyState.fakeKeyRepeat(0, 0, 0, 0); ASSERT_FALSE(actual); } TEST(CKeyStateTests, fakeKeyRepeat_nullKey_returnsFalse) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // set the key to down (we need to make mapKey return a valid key to do this). CKeyMap::KeyItem keyItem; keyItem.m_client = 0; keyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Return(&keyItem)); keyState.fakeKeyDown(1, 0, 0); // change mapKey to return NULL so that fakeKeyRepeat exits early. CKeyMap::KeyItem* nullKeyItem = NULL; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Return(nullKeyItem)); bool actual = keyState.fakeKeyRepeat(1, 0, 0, 0); ASSERT_FALSE(actual); } TEST(CKeyStateTests, fakeKeyRepeat_invalidButton_returnsFalse) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // set the key to down (we need to make mapKey return a valid key to do this). CKeyMap::KeyItem keyItem; keyItem.m_client = 0; keyItem.m_button = 1; // set to 1 to make fakeKeyDown work. ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Return(&keyItem)); keyState.fakeKeyDown(1, 0, 0); // change button to 0 so that fakeKeyRepeat will return early. keyItem.m_button = 0; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Return(&keyItem)); bool actual = keyState.fakeKeyRepeat(1, 0, 0, 0); ASSERT_FALSE(actual); } TEST(CKeyStateTests, fakeKeyRepeat_validKey_returnsTrue) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); s_stubKeyItem.m_client = 0; s_stubKeystroke.m_type = CKeyMap::Keystroke::kButton; s_stubKeystroke.m_data.m_button.m_button = 2; // set the button to 1 for fakeKeyDown call s_stubKeyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); keyState.fakeKeyDown(1, 0, 0); // change the button to 2 s_stubKeyItem.m_button = 2; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); bool actual = keyState.fakeKeyRepeat(1, 0, 0, 0); ASSERT_TRUE(actual); } TEST(CKeyStateTests, fakeKeyUp_buttonNotDown_returnsFalse) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); bool actual = keyState.fakeKeyUp(0); ASSERT_FALSE(actual); } TEST(CKeyStateTests, fakeKeyUp_buttonAlreadyDown_returnsTrue) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // press alt down so we get full coverage. ON_CALL(keyState, pollActiveModifiers()).WillByDefault(Return(KeyModifierAlt)); keyState.updateKeyState(); // press button 1 down. s_stubKeyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); keyState.fakeKeyDown(1, 0, 1); // this takes the button id, which is the 3rd arg of fakeKeyDown bool actual = keyState.fakeKeyUp(1); ASSERT_TRUE(actual); } TEST(CKeyStateTests, fakeAllKeysUp_keysWereDown_keysAreUp) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // press button 1 down. s_stubKeyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); keyState.fakeKeyDown(1, 0, 1); // method under test keyState.fakeAllKeysUp(); bool actual = keyState.isKeyDown(1); ASSERT_FALSE(actual); } TEST(CKeyStateTests, isKeyDown_keyDown_returnsTrue) { NiceMock keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // press button 1 down. s_stubKeyItem.m_button = 1; ON_CALL(keyMap, mapKey(_, _, _, _, _, _, _)).WillByDefault(Invoke(stubMapKey)); keyState.fakeKeyDown(1, 0, 1); // method under test bool actual = keyState.isKeyDown(1); ASSERT_TRUE(actual); } TEST(CKeyStateTests, isKeyDown_noKeysDown_returnsFalse) { CMockKeyMap keyMap; CMockEventQueue eventQueue; CKeyStateImpl keyState(eventQueue, keyMap); // method under test bool actual = keyState.isKeyDown(1); ASSERT_FALSE(actual); } void stubPollPressedKeys(IKeyState::KeyButtonSet& pressedKeys) { pressedKeys.insert(1); } void assertMaskIsOne(ForeachKeyCallback cb, void* userData) { ASSERT_EQ(1, ((CKeyState::CAddActiveModifierContext*)userData)->m_mask); } const CKeyMap::KeyItem* stubMapKey( CKeyMap::Keystrokes& keys, KeyID id, SInt32 group, CKeyMap::ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat) { keys.push_back(s_stubKeystroke); return &s_stubKeyItem; } synergy-1.4.12-Source/src/test/unittests/synergy/CKeyStateTests.h0000600000175000017500000000415712021261364025053 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CKEYSTATETESTS_H #define CKEYSTATETESTS_H #include "CKeyState.h" #include "gmock/gmock.h" class CMockKeyMap; class CMockEventQueue; // NOTE: do not mock methods that are not pure virtual. this mock exists only // to provide an implementation of the CKeyState abstract class. class CMockKeyState : public CKeyState { public: CMockKeyState() : CKeyState() { } CMockKeyState(const CMockEventQueue& eventQueue, const CMockKeyMap& keyMap) : CKeyState((IEventQueue&)eventQueue, (CKeyMap&)keyMap) { } MOCK_CONST_METHOD0(pollActiveGroup, SInt32()); MOCK_CONST_METHOD0(pollActiveModifiers, KeyModifierMask()); MOCK_METHOD0(fakeCtrlAltDel, bool()); MOCK_METHOD1(getKeyMap, void(CKeyMap&)); MOCK_METHOD1(fakeKey, void(const Keystroke&)); MOCK_CONST_METHOD1(pollPressedKeys, void(KeyButtonSet&)); }; typedef ::testing::NiceMock CKeyStateImpl; typedef UInt32 KeyID; typedef void (*ForeachKeyCallback)( KeyID, SInt32 group, CKeyMap::KeyItem&, void* userData); void stubPollPressedKeys(IKeyState::KeyButtonSet& pressedKeys); void assertMaskIsOne(ForeachKeyCallback cb, void* userData); const CKeyMap::KeyItem* stubMapKey( CKeyMap::Keystrokes& keys, KeyID id, SInt32 group, CKeyMap::ModifierToKeys& activeModifiers, KeyModifierMask& currentState, KeyModifierMask desiredMask, bool isAutoRepeat); CKeyMap::Keystroke s_stubKeystroke(1, false, false); CKeyMap::KeyItem s_stubKeyItem; #endif synergy-1.4.12-Source/src/test/unittests/synergy/CMockEventQueue.h0000600000175000017500000000345212021261364025174 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMOCKEVENTQUEUE_H #define CMOCKEVENTQUEUE_H #include #include "IEventQueue.h" class CMockEventQueue : public IEventQueue { public: MOCK_METHOD0(loop, void()); MOCK_METHOD2(newOneShotTimer, CEventQueueTimer*(double, void*)); MOCK_METHOD2(newTimer, CEventQueueTimer*(double, void*)); MOCK_METHOD2(getEvent, bool(CEvent&, double)); MOCK_METHOD1(adoptBuffer, void(IEventQueueBuffer*)); MOCK_METHOD2(registerTypeOnce, CEvent::Type(CEvent::Type&, const char*)); MOCK_METHOD1(removeHandlers, void(void*)); MOCK_METHOD1(registerType, CEvent::Type(const char*)); MOCK_CONST_METHOD0(isEmpty, bool()); MOCK_METHOD3(adoptHandler, void(CEvent::Type, void*, IEventJob*)); MOCK_METHOD1(getTypeName, const char*(CEvent::Type)); MOCK_METHOD1(addEvent, void(const CEvent&)); MOCK_METHOD2(removeHandler, void(CEvent::Type, void*)); MOCK_METHOD1(dispatchEvent, bool(const CEvent&)); MOCK_CONST_METHOD2(getHandler, IEventJob*(CEvent::Type, void*)); MOCK_METHOD1(deleteTimer, void(CEventQueueTimer*)); MOCK_CONST_METHOD1(getRegisteredType, CEvent::Type(const CString&)); }; #endif synergy-1.4.12-Source/src/test/unittests/synergy/CMockKeyMap.h0000600000175000017500000000235312021261364024273 0ustar synergysynergy/* * synergy -- mouse and keyboard sharing utility * Copyright (C) 2012 Bolton Software Ltd. * Copyright (C) 2011 Nick Bolton * * This package is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * found in the file COPYING that should have accompanied this file. * * This package 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 CMOCKKEYMAP_H #define CMOCKKEYMAP_H #include #include "CKeyMap.h" class CMockKeyMap : public CKeyMap { public: MOCK_METHOD1(swap, void(CKeyMap&)); MOCK_METHOD0(finish, void()); MOCK_METHOD2(foreachKey, void(ForeachKeyCallback, void*)); MOCK_METHOD1(addHalfDuplexModifier, void(KeyID)); MOCK_CONST_METHOD2(isHalfDuplex, bool(KeyID, KeyButton)); MOCK_CONST_METHOD7(mapKey, const CKeyMap::KeyItem*( Keystrokes&, KeyID, SInt32, ModifierToKeys&, KeyModifierMask&, KeyModifierMask, bool)); }; #endif synergy-1.4.12-Source/tools/0000700000175000017500000000000012140644175015651 5ustar synergysynergysynergy-1.4.12-Source/tools/build/0000700000175000017500000000000012140644175016750 5ustar synergysynergysynergy-1.4.12-Source/tools/build/ftputil.py0000600000175000017500000000234512021261364021010 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2010 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . from ftplib import FTP class FtpUploader: def __init__(self, host, user, password, dir): self.host = host self.user = user self.password = password self.dir = dir def run(self, src, dest, replace=False): ftp = FTP(self.host, self.user, self.password) ftp.cwd(self.dir) # check to see if we should stop here if not replace: files = ftp.nlst() if dest in files: print 'Already exists, skipping.' ftp.close() return f = open(src, 'rb') ftp.storbinary('STOR ' + dest, f) f.close() ftp.close() synergy-1.4.12-Source/tools/build/generators.py0000600000175000017500000000373412021261364021475 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . class Generator(object): def __init__(self, cmakeName, buildDir='build', sourceDir='..', binDir='bin'): self.cmakeName = cmakeName self.buildDir = buildDir self.sourceDir = sourceDir self.binDir = binDir def getBuildDir(self, target): return self.buildDir def getBinDir(self, target=''): return self.binDir def getSourceDir(self): return self.sourceDir class MakefilesGenerator(Generator): def __init__(self): super(MakefilesGenerator, self).__init__('Unix Makefiles', 'build', '..', 'bin') def getBuildDir(self, target): return super(MakefilesGenerator, self).getBuildDir(target) + '/' + target def getBinDir(self, target=''): workingDir = super(MakefilesGenerator, self).getBinDir(target) # only put debug files in separate bin dir if target == 'debug': workingDir += '/debug' return workingDir def getSourceDir(self): return super(MakefilesGenerator, self).getSourceDir() + '/..' class EclipseGenerator(Generator): def __init__(self): super(EclipseGenerator, self).__init__('Eclipse CDT4 - Unix Makefiles', '', '') def getBuildDir(self, target): # eclipse only works with in-source build. return '' def getBinDir(self, target=''): # eclipse only works with in-source build. return 'bin' def getSourceDir(self): return '' synergy-1.4.12-Source/tools/build/README.txt0000600000175000017500000000007311557776337020471 0ustar synergysynergySource code for the build system belongs in this directory.synergy-1.4.12-Source/tools/build/toolchain.py0000600000175000017500000011126412140221647021304 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . # TODO: split this file up, it's too long! import sys, os, ConfigParser, shutil, re, ftputil, zipfile from generators import Generator, EclipseGenerator, MakefilesGenerator if sys.version_info >= (2, 4): import subprocess class InternalCommands: project = 'synergy' setup_version = 5 # increment to force setup/config website_url = 'http://synergy-foss.org/' this_cmd = 'hm' cmake_cmd = 'cmake' qmake_cmd = 'qmake' make_cmd = 'make' xcodebuild_cmd = 'xcodebuild' w32_make_cmd = 'mingw32-make' w32_qt_version = '4.6.2' defaultTarget = 'release' cmake_dir = 'res' gui_dir = 'src/gui' doc_dir = 'doc' toolsDir = 'tools' sln_filename = '%s.sln' % project xcodeproj_filename = '%s.xcodeproj' % project configDir = 'build' configFilename = '%s/%s.cfg' % (configDir, this_cmd) qtpro_filename = 'gui.pro' doxygen_filename = 'doxygen.cfg' cmake_url = 'http://www.cmake.org/cmake/resources/software.html' # try_chdir(...) and restore_chdir() will use this prevdir = '' # by default, no index specified as arg generator_id = None # by default, prompt user for input no_prompts = False # by default, don't compile the gui enable_make_gui = False # by default, do not compile with game device support. gameDevice = False # by default, do not compile with vnc support. vncSupport = False # by default, let cmake decide macSdk = None # cryptoPP dir with version number cryptoPPDir = 'cryptopp562' win32_generators = { 1 : Generator('Visual Studio 10'), 2 : Generator('Visual Studio 10 Win64'), 3 : Generator('Visual Studio 9 2008'), 4 : Generator('Visual Studio 9 2008 Win64'), 5 : Generator('Visual Studio 8 2005'), 6 : Generator('Visual Studio 8 2005 Win64') } unix_generators = { 1 : MakefilesGenerator(), 2 : EclipseGenerator(), } darwin_generators = { 1 : MakefilesGenerator(), 2 : Generator('Xcode'), 3 : EclipseGenerator(), } def getBuildDir(self, target=''): return self.getGenerator().getBuildDir(target) def getBinDir(self, target=''): return self.getGenerator().getBinDir(target) def sln_filepath(self): return '%s\%s' % (self.getBuildDir(), self.sln_filename) def xcodeproj_filepath(self, target=''): return '%s/%s' % (self.getBuildDir(target), self.xcodeproj_filename) def usage(self): app = sys.argv[0] print ('Usage: %s [-g |-v|--no-prompts|]\n' '\n' 'Replace [command] with one of:\n' ' about Show information about this script\n' ' setup Runs the initial setup for this script\n' ' conf Runs cmake (generates project files)\n' ' open Attempts to open the generated project file\n' ' build Builds using the platform build chain\n' ' clean Cleans using the platform build chain\n' ' kill Kills all synergy processes (run as admin)\n' ' update Updates the source code from repository\n' ' revision Display the current source code revision\n' ' package Create a distribution package (e.g. tar.gz)\n' ' install Installs the program\n' ' doxygen Builds doxygen documentation\n' ' reformat Reformat .cpp and .h files using AStyle\n' ' usage Shows the help screen\n' '\n' 'Example: %s build -g 3' ) % (app, app) def configureAll(self, targets, extraArgs=''): # if no mode specified, use default if len(targets) == 0: targets += [self.defaultTarget,] for target in targets: self.configure(target) def checkCryptoPP(self): dir = self.toolsDir + '/' + self.cryptoPPDir if (os.path.isdir(dir)): return zipFilename = dir + '.zip' if (not os.path.exists(zipFilename)): raise Exception('Crypto++ zip not found at: ' + zipFilename) if not os.path.exists(dir): os.mkdir(dir) zip = zipfile.ZipFile(zipFilename) zip.extractall(dir) def configure(self, target='', extraArgs=''): cmake_args = '' # ensure latest setup and do not ask config for generator (only fall # back to prompt if not specified as arg) self.ensure_setup_latest() # ensure that we have access to cmake _cmake_cmd = self.persist_cmake() # now that we know we've got the latest setup, we can ask the config # file for the generator (but again, we only fall back to this if not # specified as arg). generator = self.getGenerator() if generator != self.findGeneratorFromConfig(): print('Generator changed, running setup.') self.setup(target) if generator.cmakeName != '': cmake_args += ' -G "' + generator.cmakeName + '"' # default is release if target == '': print 'Defaulting target to: ' + self.defaultTarget target = self.defaultTarget # for makefiles always specify a build type (debug, release, etc) if generator.cmakeName.find('Unix Makefiles') != -1: cmake_args += ' -DCMAKE_BUILD_TYPE=' + target.capitalize() if self.gameDevice: cmake_args += " -DGAME_DEVICE_SUPPORT:BOOL=TRUE" else: cmake_args += " -DGAME_DEVICE_SUPPORT:BOOL=FALSE" if self.vncSupport: cmake_args += " -DVNC_SUPPORT:BOOL=TRUE" else: cmake_args += " -DVNC_SUPPORT:BOOL=FALSE" if self.macSdk: path = "/Developer/SDKs/MacOSX" + self.macSdk + ".sdk/" cmake_args += " -DCMAKE_OSX_SYSROOT=" + path cmake_args += " -DCMAKE_OSX_DEPLOYMENT_TARGET=" + self.macSdk os.environ["MACOSX_DEPLOYMENT_TARGET"] = self.macSdk # store the sdk version for the build command config = self.getConfig() config.set('cmake', 'mac_sdk', self.macSdk) self.write_config(config) elif sys.platform == "darwin": # seems that this is now needed on 10.8 raise Exception("Arg missing: --mac-sdk "); # if not visual studio, use parent dir sourceDir = generator.getSourceDir() # ensure that the cryptopp source exists self.checkCryptoPP() if extraArgs != '': cmake_args += ' ' + extraArgs cmake_cmd_string = _cmake_cmd + cmake_args + ' ' + sourceDir # Run from build dir so we have an out-of-source build. self.try_chdir(self.getBuildDir(target)) print "CMake command: " + cmake_cmd_string err = os.system(cmake_cmd_string) self.restore_chdir() if generator.cmakeName.find('Eclipse') != -1: self.fixCmakeEclipseBug() if err != 0: raise Exception('CMake encountered error: ' + str(err)) # allow user to skip qui compile if self.enable_make_gui: # make sure we have qmake self.persist_qmake() qmake_cmd_string = self.qmake_cmd + " " + self.qtpro_filename + " -r" if sys.platform == "darwin": # create makefiles on mac (not xcode). qmake_cmd_string += " -spec macx-g++" (major, minor) = self.getMacVersion() if major == 10 and minor <= 4: # 10.4: universal (intel and power pc) qmake_cmd_string += ' CONFIG+="ppc i386"' print "QMake command: " + qmake_cmd_string # run qmake from the gui dir self.try_chdir(self.gui_dir) err = os.system(qmake_cmd_string) self.restore_chdir() if err != 0: raise Exception('QMake encountered error: ' + str(err)) self.setConfRun(target) # http://tinyurl.com/cs2rxxb def fixCmakeEclipseBug(self): print "Fixing CMake Eclipse bugs..." file = open('.project', 'r+') content = file.read() pattern = re.compile('\s+.+', re.S) content = pattern.sub('', content) file.seek(0) file.write(content) file.truncate() file.close() def persist_cmake(self): # even though we're running `cmake --version`, we're only doing this for the 0 return # code; we don't care about the version, since CMakeLists worrys about this for us. err = os.system('%s --version' % self.cmake_cmd) if err != 0: # if return code from cmake is not 0, then either something has # gone terribly wrong with --version, or it genuinely doesn't exist. print ('Could not find `%s` in system path.\n' 'Download the latest version from:\n %s') % ( self.cmake_cmd, self.cmake_url) raise Exception('Cannot continue without CMake.') else: return self.cmake_cmd def persist_qt(self): self.persist_qmake() def persist_qmake(self): # cannot use subprocess on < python 2.4 if sys.version_info < (2, 4): return try: p = subprocess.Popen( [self.qmake_cmd, '--version'], stdout=subprocess.PIPE, stderr=subprocess.PIPE) except: print >> sys.stderr, 'Error: Could not find qmake.' if sys.platform == 'win32': # windows devs usually need hints ;) print ( 'Suggestions:\n' '1. Ensure that qmake.exe exists in your system path.\n' '2. Try to download Qt (check our dev FAQ for links):\n' ' qt-sdk-win-opensource-2010.02.exe') raise Exception('Cannot continue without qmake.') stdout, stderr = p.communicate() if p.returncode != 0: raise Exception('Could not test for cmake: %s' % stderr) else: m = re.search('.*Using Qt version (\d+\.\d+\.\d+).*', stdout) if m: if sys.platform == 'win32': ver = m.group(1) if ver != self.w32_qt_version: # TODO: test properly print >> sys.stderr, ( 'Warning: Not using supported Qt version %s' ' (your version is %s).' ) % (self.w32_qt_version, ver) else: pass # any version should be ok for other platforms else: raise Exception('Could not find qmake version.') def ensureConfHasRun(self, target, skipConfig): if self.hasConfRun(target): print 'Skipping config for target: ' + target skipConfig = True if not skipConfig: self.configure(target) def build(self, targets=[], skipConfig=False): # if no mode specified, use default if len(targets) == 0: targets += [self.defaultTarget,] self.ensure_setup_latest() generator = self.getGeneratorFromConfig().cmakeName config = self.getConfig() if config.has_option("cmake", "mac_sdk"): macSdk = config.get("cmake", "mac_sdk") os.environ["MACOSX_DEPLOYMENT_TARGET"] = macSdk if generator.find('Unix Makefiles') != -1: for target in targets: self.runBuildCommand(self.make_cmd, target) else: for target in targets: if generator.startswith('Visual Studio'): self.run_vcbuild(generator, target) elif generator == 'Xcode': cmd = self.xcodebuild_cmd + ' -configuration ' + target.capitalize() self.runBuildCommand(cmd, target) else: raise Exception('Build command not supported with generator: ' + generator) # allow user to skip qui compile if self.enable_make_gui: self.make_gui(targets) def signmac(self, identity): self.try_chdir("bin") err = os.system( 'codesign -fs "' + identity + '" Synergy.app') self.restore_chdir() def signwin(self, pfx, pwdFile, dist): generator = self.getGeneratorFromConfig().cmakeName if not generator.startswith('Visual Studio'): raise Exception('only windows is supported') f = open(pwdFile) lines = f.readlines() f.close() pwd = lines[0] if (dist): self.signFile(pfx, pwd, 'bin', self.dist_name('win')) else: self.signFile(pfx, pwd, 'bin/Release', 'synergy.exe') self.signFile(pfx, pwd, 'bin/Release', 'synergyc.exe') self.signFile(pfx, pwd, 'bin/Release', 'synergys.exe') self.signFile(pfx, pwd, 'bin/Release', 'synergyd.exe') self.signFile(pfx, pwd, 'bin/Release', 'synrgyhk.dll') def signFile(self, pfx, pwd, dir, file): self.try_chdir(dir) err = os.system( 'signtool sign' ' /f ' + pfx + ' /p ' + pwd + ' /t http://timestamp.verisign.com/scripts/timstamp.dll ' + file) self.restore_chdir() def runBuildCommand(self, cmd, target): self.try_chdir(self.getBuildDir(target)) err = os.system(cmd) self.restore_chdir() if err != 0: raise Exception(cmd + ' failed: ' + str(err)) def clean(self, targets=[]): # if no mode specified, use default if len(targets) == 0: targets += [self.defaultTarget,] generator = self.getGeneratorFromConfig().cmakeName if generator.startswith('Visual Studio'): # special case for version 10, use new /target:clean if generator.startswith('Visual Studio 10'): for target in targets: self.run_vcbuild(generator, target, '/target:clean') # any other version of visual studio, use /clean elif generator.startswith('Visual Studio'): for target in targets: self.run_vcbuild(generator, target, '/clean') else: cmd = '' if generator == "Unix Makefiles": print 'Cleaning with GNU Make...' cmd = self.make_cmd elif generator == 'Xcode': print 'Cleaning with Xcode...' cmd = self.xcodebuild_cmd else: raise Exception('Not supported with generator: ' + generator) for target in targets: self.try_chdir(self.getBuildDir(target)) err = os.system(cmd + ' clean') self.restore_chdir() if err != 0: raise Exception('Clean failed: ' + str(err)) # allow user to skip qui compile clean_targets = [] if self.enable_make_gui: for target in targets: clean_targets.append(target + '-clean') self.make_gui(clean_targets) def make_gui(self, targets): if sys.platform == 'win32': gui_make_cmd = self.w32_make_cmd elif sys.platform in ['linux2', 'sunos5', 'freebsd7', 'darwin']: gui_make_cmd = self.make_cmd + " -w" else: raise Exception('Unsupported platform: ' + sys.platform) print 'Make GUI command: ' + gui_make_cmd if sys.platform == 'win32': for target in targets: self.try_chdir(self.gui_dir) err = os.system(gui_make_cmd + ' ' + target) self.restore_chdir() if err != 0: raise Exception(gui_make_cmd + ' failed with error: ' + str(err)) else: self.try_chdir(self.gui_dir) err = os.system(gui_make_cmd) self.restore_chdir() if err != 0: raise Exception(gui_make_cmd + ' failed with error: ' + str(err)) if sys.platform == 'darwin': self.macPostMakeGui() def macPostMakeGui(self): dir = self.getGenerator().binDir # copy synergy[cs] binaries into the bundle, since the gui # now looks for the binaries in the current app dir. shutil.copy(dir + "/synergyc", dir + "/Synergy.app/Contents/MacOS/") shutil.copy(dir + "/synergys", dir + "/Synergy.app/Contents/MacOS/") # use qt to copy libs to bundle so no dependencies are needed. do not create a # dmg at this point, since we need to sign it first, and then create our own # after signing (so that qt does not affect the signed app bundle). bin = "macdeployqt Synergy.app -verbose=2" self.try_chdir(dir) err = os.system(bin) self.restore_chdir() if err != 0: raise Exception(bin + " failed with error: " + str(err)) def open(self): generator = self.getGeneratorFromConfig().cmakeName if generator.startswith('Visual Studio'): print 'Opening with %s...' % generator self.open_internal(self.sln_filepath()) elif generator.startswith('Xcode'): print 'Opening with %s...' % generator self.open_internal(self.xcodeproj_filepath(), 'open') else: raise Exception('Not supported with generator: ' + generator) def update(self): print "Running Subversion update..." err = os.system('svn update') if err != 0: raise Exception('Could not update from repository with error code code: ' + str(err)) def revision(self): print self.find_revision() def find_revision(self): if sys.version_info < (2, 4): import commands stdout = commands.getoutput('svn info') else: p = subprocess.Popen(['svn', 'info'], stdout=subprocess.PIPE, stderr=subprocess.PIPE) stdout, stderr = p.communicate() if p.returncode != 0: raise Exception('Could not get revision - svn info failed with code: ' + str(p.returncode)) m = re.search('.*Revision: (\d+).*', stdout) if not m: raise Exception('Could not find revision number in svn info output.') return m.group(1) def kill(self): if sys.platform == 'win32': return os.system('taskkill /F /FI "IMAGENAME eq synergy*"') else: raise Exception('Not implemented for platform: ' + sys.platform) def doxygen(self): # The conf generates doc/doxygen.cfg from cmake/doxygen.cfg.in self.configure(self.defaultTarget, '-DCONF_DOXYGEN:BOOL=TRUE') err = os.system('doxygen %s/%s' % (self.doc_dir, self.doxygen_filename)) if err != 0: raise Exception('doxygen failed with error code: ' + str(err)) def dist(self, type, vcRedistDir, qtDir): # Package is supported by default. package_unsupported = False unixTarget = self.defaultTarget if type == '' or type == None: raise Exception('No type specified.') if type != 'win' and type != 'mac': self.configure(unixTarget, '-DCONF_CPACK:BOOL=TRUE') moveExt = '' if type == None: self.dist_usage() return elif type == 'src': if sys.platform in ['linux2', 'darwin']: self.distSrc() else: package_unsupported = True elif type == 'rpm': if sys.platform == 'linux2': self.dist_run('cpack -G RPM', unixTarget) moveExt = 'rpm' else: package_unsupported = True elif type == 'deb': if sys.platform == 'linux2': self.dist_run('cpack -G DEB', unixTarget) moveExt = 'deb' else: package_unsupported = True elif type == 'win': if sys.platform == 'win32': self.distNsis(vcRedistDir, qtDir) else: package_unsupported = True elif type == 'mac': if sys.platform == 'darwin': self.distMac() else: package_unsupported = True else: raise Exception('Package type not supported: ' + type) if moveExt != '': self.unixMove( self.getGenerator().buildDir + '/release/*.' + moveExt, self.getGenerator().binDir) if package_unsupported: raise Exception( ("Package type, '%s' is not supported for platform, '%s'") % (type, sys.platform)) def distSrc(self): version = self.getVersionFromCmake() name = (self.project + '-' + version + '-Source') exportPath = self.getGenerator().buildDir + '/' + name if os.path.exists(exportPath): print "Removing existing export..." shutil.rmtree(exportPath) print 'Exporting repository to: ' + exportPath err = os.system('svn export . ' + exportPath) if err != 0: raise Exception('Repository export failed: ' + str(err)) packagePath = '../' + self.getGenerator().binDir + '/' + name + '.tar.gz' try: self.try_chdir(self.getGenerator().buildDir) print 'Packaging to: ' + packagePath err = os.system('tar cfvz ' + packagePath + ' ' + name) if err != 0: raise Exception('Package failed: ' + str(err)) finally: self.restore_chdir() def unixMove(self, source, dest): print 'Moving ' + source + ' to ' + dest err = os.system('mv ' + source + ' ' + dest) if err != 0: raise Exception('Package failed: ' + str(err)) def distMac(self): dir = self.getGenerator().binDir name = "Synergy" dist = dir + "/" + name # ensure dist dir is clean if os.path.exists(dist): os.rmdir(dist) os.makedirs(dist) shutil.copytree(dir + "/" + name + ".app", dist + "/" + name + ".app") fileName = "%s-%s-%s.dmg" % ( self.project, self.getVersionFromCmake(), self.getMacPackageName()) cmd = "hdiutil create " + fileName + " -srcfolder ./" + name + "/ -ov" self.try_chdir(dir) err = os.system(cmd) self.restore_chdir() def distNsis(self, vcRedistDir, qtDir): if vcRedistDir == '': raise Exception( 'VC++ redist dir path not specified (--vcredist-dir).') if qtDir == '': raise Exception( 'QT SDK dir path not specified (--qt-dir).') generator = self.getGeneratorFromConfig().cmakeName arch = 'x86' installDirVar = '$PROGRAMFILES32' if generator.endswith('Win64'): arch = 'x64' installDirVar = '$PROGRAMFILES64' templateFile = open(self.cmake_dir + '\Installer.nsi.in') template = templateFile.read() template = template.replace('${in:version}', self.getVersionFromCmake()) template = template.replace('${in:arch}', arch) template = template.replace('${in:vcRedistDir}', vcRedistDir) template = template.replace('${in:qtDir}', qtDir) template = template.replace('${in:installDirVar}', installDirVar) nsiPath = self.getGenerator().buildDir + '\Installer.nsi' nsiFile = open(nsiPath, 'w') nsiFile.write(template) nsiFile.close() command = 'makensis ' + nsiPath print 'NSIS command: ' + command err = os.system(command) if err != 0: raise Exception('Package failed: ' + str(err)) def getVersionFromCmake(self): cmakeFile = open('CMakeLists.txt') cmake = cmakeFile.read() majorRe = re.search('VERSION_MAJOR (\d+)', cmake) major = majorRe.group(1) minorRe = re.search('VERSION_MINOR (\d+)', cmake) minor = minorRe.group(1) revRe = re.search('VERSION_REV (\d+)', cmake) rev = revRe.group(1) return major + '.' + minor + '.' + rev def distftp(self, type, ftp): if not type: raise Exception('Type not specified.') if not ftp: raise Exception('FTP info not defined.') src = self.dist_name(type) dest = self.dist_name_rev(type) print 'Uploading %s to FTP server %s...' % (dest, ftp.host) srcDir = 'bin/' generator = self.getGeneratorFromConfig().cmakeName #if not generator.startswith('Visual Studio'): # srcDir += 'release/' ftp.run(srcDir + src, dest) print 'Done' def dist_name(self, type): ext = None platform = None if type == 'src': ext = 'tar.gz' platform = 'Source' elif type == 'rpm' or type == 'deb': # os_bits should be loaded with '32bit' or '64bit' import platform (os_bits, other) = platform.architecture() # get platform based on current platform ext = type if os_bits == '32bit': platform = 'Linux-i686' elif os_bits == '64bit': platform = 'Linux-x86_64' elif type == 'win': # get platform based on last generator used ext = 'exe' generator = self.getGeneratorFromConfig().cmakeName if generator.find('Win64') != -1: platform = 'Windows-x64' else: platform = 'Windows-x86' elif type == 'mac': ext = "dmg" platform = self.getMacPackageName() if not platform: raise Exception('Unable to detect package platform.') pattern = re.escape(self.project + '-') + '\d+\.\d+\.\d+' + re.escape('-' + platform + '.' + ext) # only use release dir if not windows target = '' for filename in os.listdir(self.getBinDir(target)): if re.search(pattern, filename): return filename # still here? package probably not created yet. raise Exception('Could not find package name with pattern: ' + pattern) def dist_name_rev(self, type): # find the version number (we're puting the rev in after this) pattern = '(.*\d+\.\d+\.\d+)(.*)' replace = '\g<1>-r' + self.find_revision() + '\g<2>' return re.sub(pattern, replace, self.dist_name(type)) def dist_run(self, command, target=''): self.try_chdir(self.getBuildDir(target)) print 'CPack command: ' + command err = os.system(command) self.restore_chdir() if err != 0: raise Exception('Package failed: ' + str(err)) def dist_usage(self): print ('Usage: %s package [package-type]\n' '\n' 'Replace [package-type] with one of:\n' ' src .tar.gz source (Posix only)\n' ' rpm .rpm package (Red Hat)\n' ' deb .deb paclage (Debian)\n' ' win .exe installer (Windows)\n' ' mac .dmg package (Mac OS X)\n' '\n' 'Example: %s package src-tgz') % (self.this_cmd, self.this_cmd) def about(self): print ('Help Me script, from the Synergy project.\n' '%s\n' '\n' 'For help, run: %s help') % (self.website_url, self.this_cmd) def try_chdir(self, dir): global prevdir if dir == '': prevdir = '' return # Ensure temp build dir exists. if not os.path.exists(dir): print 'Creating dir: ' + dir os.makedirs(dir) prevdir = os.path.abspath(os.curdir) # It will exist by this point, so it's safe to chdir. print 'Entering dir: ' + dir os.chdir(dir) def restore_chdir(self): global prevdir if prevdir == '': return print 'Going back to: ' + prevdir os.chdir(prevdir) def open_internal(self, project_filename, application = ''): if not os.path.exists(project_filename): raise Exception('Project file (%s) not found, run hm conf first.' % project_filename) else: path = project_filename if application != '': path = application + ' ' + path err = os.system(path) if err != 0: raise Exception('Could not open project with error code code: ' + str(err)) def setup(self, target=''): print "Running setup..." oldGenerator = self.findGeneratorFromConfig() if not oldGenerator == None: for target in ['debug', 'release']: buildDir = oldGenerator.getBuildDir(target) cmakeCacheFilename = 'CMakeCache.txt' if buildDir != '': cmakeCacheFilename = buildDir + '/' + cmakeCacheFilename if os.path.exists(cmakeCacheFilename): print "Removing %s, since generator changed." % cmakeCacheFilename os.remove(cmakeCacheFilename) # always either get generator from args, or prompt user when # running setup generator = self.get_generator_from_prompt() config = self.getConfig() config.set('hm', 'setup_version', self.setup_version) # store the generator so we don't need to ask again config.set('cmake', 'generator', generator) self.write_config(config) # for all targets, set conf not run self.setConfRun('all', False) self.setConfRun('debug', False) self.setConfRun('release', False) print "Setup complete." def getConfig(self): if os.path.exists(self.configFilename): config = ConfigParser.ConfigParser() config.read(self.configFilename) else: config = ConfigParser.ConfigParser() if not config.has_section('hm'): config.add_section('hm') if not config.has_section('cmake'): config.add_section('cmake') return config def write_config(self, config, target=''): if not os.path.isdir(self.configDir): os.mkdir(self.configDir) configfile = open(self.configFilename, 'wb') config.write(configfile) def getGeneratorFromConfig(self): generator = self.findGeneratorFromConfig() if generator: return generator raise Exception("Could not find generator: " + name) def findGeneratorFromConfig(self): config = ConfigParser.RawConfigParser() config.read(self.configFilename) if not config.has_section('cmake'): return None name = config.get('cmake', 'generator') generators = self.get_generators() keys = generators.keys() keys.sort() for k in keys: if generators[k].cmakeName == name: return generators[k] return None def min_setup_version(self, version): if os.path.exists(self.configFilename): config = ConfigParser.RawConfigParser() config.read(self.configFilename) try: return config.getint('hm', 'setup_version') >= version except: return False else: return False def hasConfRun(self, target): if self.min_setup_version(2): config = ConfigParser.RawConfigParser() config.read(self.configFilename) try: return config.getboolean('hm', 'conf_done_' + target) except: return False else: return False def setConfRun(self, target, hasRun=True): if self.min_setup_version(3): config = ConfigParser.RawConfigParser() config.read(self.configFilename) config.set('hm', 'conf_done_' + target, hasRun) self.write_config(config) else: raise Exception("User does not have correct setup version.") def get_generators(self): if sys.platform == 'win32': return self.win32_generators elif sys.platform in ['linux2', 'sunos5', 'freebsd7', 'aix5']: return self.unix_generators elif sys.platform == 'darwin': return self.darwin_generators else: raise Exception('Unsupported platform: ' + sys.platform) def get_generator_from_prompt(self): return self.getGenerator().cmakeName def getGenerator(self): generators = self.get_generators() if len(generators.keys()) == 1: return generators[generators.keys()[0]] # if user has specified a generator as an argument if self.generator_id: return generators[int(self.generator_id)] conf = self.findGeneratorFromConfig() if conf: return conf raise Exception( 'Generator not specified, use -g arg ' + '(use `hm genlist` for a list of generators).') def setup_generator_prompt(self, generators): if self.no_prompts: raise Exception('User prompting is disabled.') prompt = 'Enter a number:' print prompt, generator_id = raw_input() if generator_id in generators: print 'Selected generator:', generators[generator_id] else: print 'Invalid number, try again.' self.setup_generator_prompt(generators) return generators[generator_id] def get_vcvarsall(self, generator): import platform, _winreg # os_bits should be loaded with '32bit' or '64bit' (os_bits, other) = platform.architecture() # visual studio is a 32-bit app, so when we're on 64-bit, we need to check the WoW dungeon if os_bits == '64bit': key_name = r'SOFTWARE\Wow6432Node\Microsoft\VisualStudio\SxS\VS7' else: key_name = r'SOFTWARE\Microsoft\VisualStudio\SxS\VC7' try: key = _winreg.OpenKey(_winreg.HKEY_LOCAL_MACHINE, key_name) except: raise Exception('Unable to open Visual Studio registry key. Application may not be installed.') if generator.startswith('Visual Studio 8'): value,type = _winreg.QueryValueEx(key, '8.0') elif generator.startswith('Visual Studio 9'): value,type = _winreg.QueryValueEx(key, '9.0') elif generator.startswith('Visual Studio 10'): value,type = _winreg.QueryValueEx(key, '10.0') else: raise Exception('Cannot determine vcvarsall.bat location for: ' + generator) # not sure why, but the value on 64-bit differs slightly to the original if os_bits == '64bit': path = value + r'vc\vcvarsall.bat' else: path = value + r'vcvarsall.bat' if not os.path.exists(path): raise Exception("'%s' not found." % path) return path def run_vcbuild(self, generator, mode, args=''): import platform # os_bits should be loaded with '32bit' or '64bit' (os_bits, other) = platform.architecture() # Now we choose the parameters bases on OS 32/64 and our target 32/64 # http://msdn.microsoft.com/en-us/library/x4d2c09s%28VS.80%29.aspx # valid options are only: ia64 amd64 x86_amd64 x86_ia64 # but calling vcvarsall.bat does not garantee that it will work # ret code from vcvarsall.bat is always 0 so the only way of knowing that I worked is by analysing the text output # ms bugg: install VS9, FeaturePack, VS9SP1 and you'll obtain a vcvarsall.bat that fails. if generator.find('Win64') != -1: # target = 64bit if os_bits == '32bit': vcvars_platform = 'x86_amd64' # 32bit OS building 64bit app else: vcvars_platform = 'amd64' # 64bit OS building 64bit app config_platform = 'x64' else: # target = 32bit vcvars_platform = 'x86' # 32/64bit OS building 32bit app config_platform = 'Win32' if mode == 'release': config = 'Release' else: config = 'Debug' if generator.startswith('Visual Studio 10'): cmd = ('@echo off\n' 'call "%s" %s \n' 'msbuild /nologo %s /p:Configuration="%s" /p:Platform="%s" "%s"' ) % (self.get_vcvarsall(generator), vcvars_platform, args, config, config_platform, self.sln_filepath()) else: config = config + '|' + config_platform cmd = ('@echo off\n' 'call "%s" %s \n' 'vcbuild /nologo %s "%s" "%s"' ) % (self.get_vcvarsall(generator), vcvars_platform, args, self.sln_filepath(), config) # Generate a batch file, since we can't use environment variables directly. temp_bat = self.getBuildDir() + r'\vcbuild.bat' file = open(temp_bat, 'w') file.write(cmd) file.close() err = os.system(temp_bat) if err != 0: raise Exception('Microsoft compiler failed with error code: ' + str(err)) def ensure_setup_latest(self): if not self.min_setup_version(self.setup_version): self.setup() def reformat(self): err = os.system( r'tool\astyle\AStyle.exe ' '--quiet --suffix=none --style=java --indent=force-tab=4 --recursive ' 'lib/*.cpp lib/*.h cmd/*.cpp cmd/*.h') if err != 0: raise Exception('Reformat failed with error code: ' + str(err)) def printGeneratorList(self): generators = self.get_generators() keys = generators.keys() keys.sort() for k in keys: print str(k) + ': ' + generators[k].cmakeName def getMacVersion(self): # if we've built with an older sdk, then use that as the # os version for package names, etc. config = self.getConfig() if config.has_option("cmake", "mac_sdk"): macSdk = config.get("cmake", "mac_sdk") split = macSdk.split('.') major = int(split[0]) minor = int(split[1]) return (major, minor) import commands versions = commands.getoutput('/usr/bin/sw_vers') result = re.search('ProductVersion:\t(\d+)\.(\d+)', versions) if not result: print versions raise Exception( 'Could not find Mac OS X version in sw_vers output.') major = int(result.group(1)) minor = int(result.group(2)) return (major, minor) def getMacPackageName(self): (major, minor) = self.getMacVersion() if major == 10: if minor <= 4: # 10.4: intel and power pc arch = "Universal" elif minor <= 6: # 10.5: 32-bit intel arch = "i386" else: # 10.7: 64-bit intel (gui only) arch = "x86_64" else: raise Exception("Mac OS major version unknown: " + str(major)) # version is major and minor with no dots (e.g. 106) version = str(major) + str(minor) return "MacOSX%s-%s" % (version, arch) def reset(self): if os.path.exists('build'): shutil.rmtree('build') if os.path.exists('bin'): shutil.rmtree('bin') if os.path.exists('lib'): shutil.rmtree('lib') if os.path.exists('src/gui/tmp'): shutil.rmtree('src/gui/tmp') # the command handler should be called only from hm.py (i.e. directly # from the command prompt). the purpose of this class is so that we # don't need to do argument handling all over the place in the internal # commands class. class CommandHandler: ic = InternalCommands() build_targets = [] vcRedistDir = '' qtDir = '' def __init__(self, argv, opts, args, verbose): self.ic.verbose = verbose self.opts = opts self.args = args for o, a in self.opts: if o == '--no-prompts': self.ic.no_prompts = True elif o in ('-g', '--generator'): self.ic.generator_id = a elif o == '--make-gui': self.ic.enable_make_gui = True elif o in ('-d', '--debug'): self.build_targets += ['debug',] elif o in ('-r', '--release'): self.build_targets += ['release',] elif o == '--vcredist-dir': self.vcRedistDir = a elif o == '--qt-dir': self.qtDir = a elif o == '--game-device': self.ic.gameDevice = True elif o == '--vnc': self.ic.vncSupport = True elif o == '--mac-sdk': self.ic.macSdk = a def about(self): self.ic.about() def setup(self): self.ic.setup() def configure(self): self.ic.configureAll(self.build_targets) def build(self): self.ic.build(self.build_targets) def clean(self): self.ic.clean(self.build_targets) def update(self): self.ic.update() def install(self): print 'Not yet implemented: install' def doxygen(self): self.ic.doxygen () def dist(self): type = None if len(self.args) > 0: type = self.args[0] self.ic.dist(type, self.vcRedistDir, self.qtDir) def distftp(self): type = None host = None user = None password = None dir = None if len(self.args) > 0: type = self.args[0] for o, a in self.opts: if o == '--host': host = a elif o == '--user': user = a elif o == '--pass': password = a elif o == '--dir': dir = a ftp = None if host: ftp = ftputil.FtpUploader( host, user, password, dir) self.ic.distftp(type, ftp) def destroy(self): self.ic.destroy() def kill(self): self.ic.kill() def usage(self): self.ic.usage() def revision(self): self.ic.revision() def reformat(self): self.ic.reformat() def open(self): self.ic.open() def genlist(self): self.ic.printGeneratorList() def reset(self): self.ic.reset() def signwin(self): pfx = None pwd = None dist = False for o, a in self.opts: if o == '--pfx': pfx = a elif o == '--pwd': pwd = a elif o == '--dist': dist = True self.ic.signwin(pfx, pwd, dist) def signmac(self): idenity = None for o, a in self.opts: if o == '--identity': identity = a # HACK: codesign fails intermittently. we need some sort of retry mechanism # but i don't have time right now so just hammer the crap out of it and hope # one attempt works. self.ic.signmac(identity) self.ic.signmac(identity) self.ic.signmac(identity) self.ic.signmac(identity) self.ic.signmac(identity) synergy-1.4.12-Source/tools/build/__init__.py0000600000175000017500000000134112021261364021053 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2012 Bolton Software Ltd. # Copyright (C) 2009 Nick Bolton # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . from build import generators synergy-1.4.12-Source/tools/CMakeLists.txt0000600000175000017500000000364612131445632020421 0ustar synergysynergy# synergy -- mouse and keyboard sharing utility # Copyright (C) 2013 Bolton Software Ltd. # # This package is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # found in the file COPYING that should have accompanied this file. # # This package 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 . set(cpp_dir cryptopp562) file(GLOB cpp_src ${cpp_dir}/*.cpp) if (WIN32) file(GLOB cpp_hdr ${cpp_dir}/*.h) list(APPEND cpp_src ${cpp_hdr}) endif() file(GLOB cpp_ignore ${cpp_dir}/simple.cpp ${cpp_dir}/strciphr.cpp ${cpp_dir}/polynomi.cpp ${cpp_dir}/eprecomp.cpp ${cpp_dir}/eccrypto.cpp ${cpp_dir}/algebra.cpp) list(REMOVE_ITEM cpp_src ${cpp_ignore}) # if 64-bit windows, compile asm file. if (CMAKE_CL_64) list(APPEND cpp_src ${cpp_dir}/x64dll.asm ${cpp_dir}/x64masm.asm) add_custom_command(OUTPUT $(IntDir)x64dll.obj COMMAND ml64.exe /c /nologo /Fo$(IntDir)x64dll.obj /Zi "${CMAKE_CURRENT_SOURCE_DIR}/${cpp_dir}/x64dll.asm" MAIN_DEPENDENCY ${cpp_dir}/x64dll.asm VERBATIM) add_custom_command(OUTPUT $(IntDir)x64masm.obj COMMAND ml64.exe /c /nologo /Fo$(IntDir)x64masm.obj /Zi "${CMAKE_CURRENT_SOURCE_DIR}/${cpp_dir}/x64masm.asm" MAIN_DEPENDENCY ${cpp_dir}/x64masm.asm VERBATIM) endif() if (UNIX) add_definitions(-DCRYPTOPP_DISABLE_ASM) set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -g -O2 -pipe") if (APPLE) if (DARWIN_VERSION GREATER 10) set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wno-tautological-compare") endif() else() set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -march=native") endif() endif() add_library(cryptopp STATIC ${cpp_src}) synergy-1.4.12-Source/tools/cryptopp562.zip0000600000175000017500000257673612127023626020543 0ustar synergysynergyPK‘=ÌÐÖͪþ 3way.cppåWmSã6þÿŠíÝ µlCo˜$0CH¸¡åh†—^gî #Û Ñ$–2² ¤Üõ·w%ˉíP¦ýÐ释DzöY­v¯Ìî.ì=’åN¼XÀŠ„MhÑ>QÂ`"E ? ÂqFSÊ¿Ï,ÁÙÝ…ë)!Ù=ãd±H(ž™Ï O,&Š ž‘…æ‹<š³‘Æwç-ãñTš»Äo ð7ôZ8¾8Ï­r|Áè ¯zf‚A=½jøÚ@Sý&–T"¤º«m*-Øøž¤)/X=´F`v÷M¢°[®FÚ±j~Êžh‚;¶!¸1»Ô¯£È Ã5Lê0Zßž÷«ûGzžõTF_± µ]ä£&dz>‹ÜÝam£P{ð½r<, VM Ÿe ŒH>Ð'+*`"$b,ªMÙïØn°/(‚Ïe™¢bÞ¨›ÍÀ3´ê£‘*$Ä]¨Á1ž†è³êxÑÝ ðú°1¦áý‡†µµƒF’1:#Ô}Ïä0Ô¢<(¾°ß}£sÔ$f`˜A•éW˜a…Ô˜:üCˆ‰üjø­U l`a‰éjëgõ½q™pR°j¼®+§¢QŒŠTq“rÙ‡à/”ÞmlÖhÙNŸd´Ó¹áñ”Æ3š\Qõ3]ºEC‹–ŠÂ»|Ö†œg잣z¶Ã9å÷jÚ¶]ôW2Ïéˆ`„­‘$ÍL;Î2*‚,A§ç†ællN+›.ša¡>Pui¾óƒg“3þ ™ná°mtlhZÔn-"vˆ…b½=ü³½í9-ô<ûÌnµ ¹zùìóþ;¶½wkZY}1¼íõ¼€]à ×µZ06÷»³ìTÈG"“kIx†á¥æös= Ó`k¦còoÛ ?ûÞêæÛÂÆùj Y˶‹\™¹WXiU¨å‚¢ØÁ¬cÝÑÿ(W½"Ámè³û!OáG……Îry5®ta°ÓA®ÄÓ·…¾RÌÝ°¦IÝt웃ÕOE>…tJ)– Òe+ú€Í>>Ç26rÐ)-Ú@‘c3Ëy¨Me¬²Þº…±ôz‡ ß}Œvd¼…¯>OÇyWycÀ¼B#‚—ØlÎ*m˜qw]«U•êÜÔ¾¥ýWº8gJÍé¿'éHy=_ÿg­l$ã‹gýÃðbàü PK‘='Æ-\Eð3way.hÅT]oÚ0}Æ¿Âi*ˆѾA‰tEíB¬]¥I‘q.EbG¶3ʪþ÷Ù¡ Dë¶Ç½$Êý8÷œs·Ø†Ç°Á“ÅC¸š‡a´º^øþýè!ºF-“`ÞÍ!§ÓÁß7,Ôqj1NÓ"ÜT@·°ï%Ízl ºµQŒ¾øËp4ñ£±ÿyœMä>×" ÛÓù€#¤´,¨Æ«DÜ“}4ã8/Ö)£øŠ=A<¶hKöÜþ…×­¥n` üQ'µÔ‘Œ¬SXˆ‚ÇÊí÷=ôŒJm’Tp¥1MˆÄe¥B2dÉଟ%èBrܼ<7ŒšÃô2´tìlxn>5­óãìv»ÞXLXŠÌQ”ðóŒI)¤CU/ÑYÚ:`xåËuˆ‡hJ”ªô¥Ö¨¤”Ú',O@N-2à–²àVЩÚW0îV£ñ­ÇDÁøb–å©[䡆A:TP£ñC°å4±‹— ÃgËÖ{ ¸cÖÝÅWì‘CŒ×8-Ð}5ÖzxGÒB¤Âs"I¦ÚÆÀF.…ª!¶ƒjY$ËU M¢Ü«ÝöhIÝÝ _^tñ¥g ·¦Æ®ãÏê}NOÄ+Þ“JAA©¿ YŽ©©d¼Œ½‰:Ÿ^+»¯ß¢ÐåwûPõObSø¯ÄªAzŸƒ½NÆã$uý d=›]ë¢gö5çmø—¶©l3=û¨Úìä·Î·“7«àé¬ßŽUðtÊÉ=ãSsCÙýPK=+t†ý adler32.cppT]oÚ0}ŽÅ]§JÉm‹`A¢-xB£Ó¦ ¹±!–R'Šf]ÅŸ?h Ýíð=çž{|}Äå%`’Ñr^$E}¨K&%å€9"à %À8È”BQÝg,’?`U¹‚ï”Á f½e<É*Bá¬HÒ‹ôì¤ð"®Šh9û2_¯f×óÍÕüóbé^—O…ÌW+¡Çœ˜Yîxü­ XR7ɹj¤ðŽñ¢’ïA°ßt#!£|'S=#Ç’*.ØŽ+¯YÎwp5[Ï!†Ñp„œ6*…=l„‚^#¡EBÝĶàÚ9p¼‰Á÷£&:$Wú‡£¤zñÁ\¯71¥P—Œ¸ãØþ~_öP§,£‹êafšR›ÆƼwïÛ£nWºçÍi¯ZÚjÓÆõd,ýðNàÔÐ)t`a6èÀ>t`ÃlÔ}laèe©z7‘æ–†£ÿ[dë]ý_‘ïûÛÇýÇ–±´”Zñ“œk᱆(•·ÎKŒ ŠžÛ•0Âz~øJFO rxh9µÂc®¿…õ‹pŒªíì ü' R¨ÒV~8ðsÝ)æ*ø5**½}Eå  ú¯§wÊ`©TX c39ûf[-l§|¸u¦À=cÝŒl`±Šj8†l—‹dÙh´Uкz—Ž <ŒÕ¨JøZóóou i5>¹1ƒaìam°­ 3u[†à¢™‹Î{öè¹Ñ|ú³ÏMOvHH^ÃÏ÷' w5BqÜ7PKŽ=þý±ÓâJaes.heOkƒ@Åïó)¶zI ¸6Çš¬;ýsˆY{ÈIÄã¶2Š–|ûnCKB{˜7?æÍ›Ð6l¨Ùî ‹­ÖeŠûòB¯Y¦¿2„–ëîdH£ý`SQµ@žnp¯Ó Ë'|yËgÙx¦^ë9€”wbU‰v¤æ1h§ixÒ9Õ¤ëO|¤¨ÒÙO+½M°öe%«µp–™Æ…¨˜=V“=‹ûX.å2ŽcPÛì}ƒyª,>Ïv?G-„ß1O¦ó@ßñ~È_ëyâÚ%ÿHE·äµKnÓb®üOˆmà PKÛ{TBO™Z6< ã# algebra.cppµZ{oÛFÿÛú›1HK²E:MP[RáW ã‹]¤‡À0(r-¯#‘ ’ÕÖßýfö½"ýJsôJÍîÎã7³óXwk‹D“1åÑf<›‘.Yä¬,iJ¢4!³IÓ„°””7”̪фÅ$ɦPFKò™2r±Vë5KãI•PòÓ,¾Ù¼ù )×iB¯ÉÁ§ÿž]|<;»ÚûýøhÿÓÞÕÁÙÙÚÖ9¯Òƒ²Èò¯QžUi²Câl:cšÃG5IHU±¬ ×@&eFF”H9 ),¦­× ‚¥´QŠ­•²43D––tLs©®¤öç4.³|Øjî}8:?Û;8ºÚ?:>9õòå¬ÌÎÎüV«¤S@¦„Ýñ$* r1¥Ó¢$ëdoT”y—Ç`Ö¬1ÜÙ9Ì7ê‰G:¥iIÖ#_œiýÝZËiYå)7¶;ÜK/êÈßmÝ¿TÔy5┚°Y¡Œ,ñàŽiô•a¶$Ù5‰ÐáqðŸ¤sšÔóI´ ¬l­)>Qà¡¢ }zä?hK£{q\M+Üé=Ó)>"ÄÑË¢I¿Pþ£’kîûÄÒ±ðÞ·*ÊŸ(ªIÉf“å £E‹;ds–Ð*RG%›Óï cDCZaûHDÕì=ªâ Ø¥‡?Úƒ•µù3äŠzÚ´.fGO®–d<Ä–¯ßXÛZ¼í¨Á3>PÚMáÇlunÔ¹í:D­LÜ°©ÉBÕ6\iOÛ¾a‹{À6/Õ@Ã"<.Z ʧ1ÁÍ£Óm-Sé˜àg0E÷¤-¡üÎéü,+X …(âªu8:ʲ …yQ^°)Þ¨2¯(b.ÌÅ"i l8ÀzÐíúV|£ÄpC~¶ dcZBÆð˜ ðÐì qOhïMx¿dòÏ?†×p`Ýv³: !ªb`(xó_ìS0m²Íï²Ý¦½{×%$I‹¯®à%ŽÈÎÀ“º:BŸ¬¯Kä߀•ÀCÂ7¡LBC×`±k¡Eptïv"W²Ýæ´{ü?M;Ï£=+ˆ„Þ!*à/¹ìmÿ_G»Œ‘É_ ÁŠŽ"†P'm ª/¡¾5øÄikPUÅõ)å}£¦«ÇIéõ´Z:†Í•Aú=Þ¶gÔry¡àòŸ' ;Âg]Œi ¤‰,îv§š¥²¸»­€.aëcüÝÑ<ɈŽYjý¦iâc=ç9Mº|c0°ª2g²¹ÒTðÝ¡h`äÝÉFjlÃÛæ–å1î"–Û¯vX„UDšQ] ̃˜ðÖ49ú”Dr·‹¿y>á-Î×W74šy8ÄkW­Î²YÃbKGÓ«W«¸¨L}8 2+„@ÉÇ´1v®ÇM)½+ÕNä„Ê»¬xHJ{õ»…ÏÅe“ÛTRø†ÎÒL>¦ÔóÅmN³.›ã)!¿ý]42šg,áÏ€S‚+~öíñóÆ04Á(_Z ¼S7¾{Ìyk¼@>ø¶DVQ_ÜÅ*.Ég–&Ùâßr¼döo¯>Pœ€¢œ×S::ħ‚Ô¬“T”…Œ†>[¬C°·â¾Žuܳ9é•}DÂëÁo£g>‘®½‡ežRVÜÐÄãi_ÖtÞêj¼¢Õk,Ú£Çø°&Q--ÄôöÁû†~ÿ­l÷-Ú{¶]Zð ~ëÞþˆ?¯ì|»<ßõ½ÿ“ù|ÍA†ªì®xÈÿÔS¸ªÂåžæaã?gy"­‡QüóÇO‡Wû'絺øÊf|VZ]u…–aÇÕ¤¹&«Ä„"eû¤9úÚGè?#h¨à·úåvÝï‰B‰—ÆÔTÍBtüb'2ŽzmWƒÊ£´WÖà€ÀD-¤íÝDÞ@„Á//ðùD¦-÷M3hÛ)Ëb{·29åÑc¶I¶pOJ¯I$]¢÷©Sh†**~Tªsä)÷ B*!“NÅÉÀ¹¿°MhêhUË+FëV›û ÊnÓ«C‹GwÃJÓ+ÇÙmO¡.šŸS6@Õ}‘†W¯ˆMóð`OêSûŒªø+- OŸ^ðí4<ÔÕñÕß› 7ÍçÔáá>ý™‡4}µ‡¸¶¼ï€ÍKOYמfÂlNÅCˆ%’׫Qõœ:¡±i·Õ_q í;)~gâÛJo…Ì©›«Ù7HTpŒÃôûžsÌDT7ÎÖC¥ ÎUçÀm²¦œžõT:†ßèiziV‚ k>”©H.HÀÌ6²Ãؤ«WŽ!:=‰‹ï¨9 6s€­üfÿ8jhŒ†ï‹s^_²­ðÒÌ(ÎsÕ꣊`kþ<7ö夣{¢¦Ýcµé)§‹DlPU_0<5#¦5Za|#`A§ÊñGjà‚«ò<çðÔÝÐãÔ¬ò„à»x[‘ËãÖU¬­Áý´Âú â8|øu^ø¬‚5.€Ë‘OÄ@ w®ÌíeÇÖí¶­ÆHgu÷؃f3מËUñÌåSŽš9}gWïÒ×x?õDlþø"½ÎPƒõÒmgGÀ}çÖFÈ™ñ1[~Ä#·TÏýÓ¯yž¿ùÜÇwP%/ñÜÿó¿eu}þç™ñ?‡ŸÏ˜þ¥¡½3h¦òÜlĤCœYêþéÂü¹ý¡zQ!òÙÓMÄs=ÚØÕhu„–X«Y¸·ÿ›•£ÓÃVë5€Â®[ÿPK=t£ïÚ" algebra.hÅZKsÛ6>‹¿±§Éu”´‡$+3²Ãºžñ«¶’™ô¢IHbK :ÑxÒßÞ‚ êe%Í! ì·‹öÛÅZÇá4È]<|ºßÝßOF×—îùÃhò‡s ïØ؆œã0ö£, èȧñ4œõæGŽs;ºqïGîäܽ¼ºí\°eÂéý}×qü§)ºŠ9™6pœ7orÉ”#7" óöb„g,&ò–hAahšÅ>aÂŒÀ„)a$öI*ä9E!à±G(À+™´‡Á8‚öçˆzŸ£^¢9~"ˆÆÑRSXWšÁCM)Csa<]iñôñ9(¢_ÄkŸDÈ £%Œhu”1¡GIõÅìù¢£YÒA§ü†O½î©1âŸÝî@g4†)Jç4‹À öÀˆM ÏR¯ÐÈK9Ã`Ü¥v8Y$æÉ=¿Cò‹ÞæÛ»ÉÇñèüÚÕ¢RòÙI2/ ý¾ÓâË„ˆS3.¶tµžBÆ3ØŒWÄ:]ôüÍõ(û¾vVjÃr*o¼®z3|;(VÏ º à#äËÎ6“sçFmü‡ÔЬ²ù¢¥œæ«ôwœrmï³<øhŠ£” L_UT¾§àÿFͦ>f^¾Û¯ÜÀ*]çûÙ"G§³'Âá²tM=ú8Âìâ+L¢eãZÇ 6i´]àÔÇYøµŽøKÍàe}Ò¯–5<Ñ0Z÷qš¥Zit¢ §êœ’ª’ò5‹Åô,NÙ`M C¤ß_Ð,æÚoU*x.Û‹ „ ê#I«üp6~·‘"LA ‹ÉbÖ[L’v˜3Àê4¹ôÚ)͘O¶h#š†9eÃõX* OH5zÓqÈ· ÷Jü©Í}ÌÃ'²_m<VÅ’-(¬™T€ÂÙdô>| ² Õã×UÇ<dt"X‡÷]i`Eñ¡‚ê¾TC¸zFŠžÏvZ­"JDà‰ IXøÆCÀKî°H×FëÙiiÊhÕÃ3·è’„QX¡Í8Q±ŸÇkkŸÚÂDÓŠz¤¼®„ÞPtØQšß ¹Si²VßÒ4|Ïüm*ÀÀ¬ë•ìVmå,ív/iìJÙüµ}µÒì«:üN%ÝfżxÕà½ë£†0™ „IEÛ)¡ì¦ÙH4 hÀaiéÿZså–[ÖÄùÚ©ÒÐQ5OO… KtZ¢ÒkY98'lU ¢“=ÿÉ2òlE8t®—’§ª”t!”ß9`uŧÅ6ŠÆʼ;ÖÞJ/ŒW÷É…s£&t!ሡŽø¯[º²SN°y¶(jÃ3…ZÑu+qß¡6›§ÕëZ†ÎŒöŠGQ~Žsõ°®ž¥]ÿñâ··è eÿ`Ø—8èçÝðï©>„öfš% eu÷ªƒZ8ùŠË5@:-Žð%‰á]¤BÅ<4îØ2¿„¥æ]„S Š<2 cã™ÄAwðb“Œ(¨›”ìÒ" zù±Ö·#7ó# m=/pïuSÒ £^©èݺ­’ó™H(¢…0Šf”…|¾(ó;- ìsÒêÙ+ت̿¡‡j˜\úÁNUÂ('>'8f‘q yRÏ“´y :«ìÔÝ´y¿kSëÛZ™²Í×P‹žÙžõ¬®E†C/Ï›‹×BDÍé÷ÿ"ŒªBõ…uj-÷ òþYZµeªøsÃ7ÖŸ5£^cÐ^ef}Á¯+ Þ©´Ô‹}m_ìƲnOOÊö ^ß®°–»˜¬…Z¾Ð'Ö…¯ï@Ø.eŠ…oÑØ17 §¦nãµÝO n¸YµíÚE±*|cuëNŒoÅýIâ~¯„%t꣧X2±³ºïW4þjD+ªg£¶3V¥*Yío¬ÏA¯ÐŸå¡Xß\-¦Ù;©yQ ’DŒûý¢ jH"« ”c 3å˜VØþÎ?kÛ° AeiœÕ‡[…œÕ‘PlÃ=CNèe.kP"îuò»µÉ$amÇän”"kwJŽ F +TSH?Š@Ñ:Säw}à ùw5©äÒîŽyÙqÈܬáÕŸU·âåº.Jü½ÓvéŽÕ6Ñ!ÓwÃÖ “kd%Ýè­S»FTxŸüV:UJègQ¹cóH¿¬l(h]{ô•„=dW™æú^Tm4ðCÑ´Û¤g§:bИêL‚oÎr…yh8Ì›ú¹Ý.Í, R5ogUR×´]^þKÙ<_–¿qoß‹_“LW~ƒr3ºý0º¾þ4¹º}nÇW£±;»7÷×ðåÑøñ ŽfÄc¸ç'É‘sLâ œ:ÅçPK=”ìqà algparam.cppÅUQOÛ0~ŽÅ©“ª¤ƒ²í1]‘J©P%(¦=EnrI,%¶e;¬hðßg'-tÐ2˜˜–‡(¹ÜÝw÷ÝwÎÁÐ2—TѪŸH ûðC1cå)È’&˜ã` Y/J–@**j-‹[ø† Ž)#äãIY§™ý¢ã,O1ƒñÅ÷h~Eñô,:¿˜_nú>»€ÙèlrÆ“øhr2ùcu+ˆ¢€h¤5Ëù”›¹°7ÌQAË-Ö!Ì®NO„,„(a,ªã˜Îh…×´¬1¢Lé0% )(Æþ¨“🣤ÊWí1Mè.Úº@ú…Л=$‡å°ÉìÄîq&ò_æ®ã»›Ùõt⌋ÉÜ6Q”pmŽáýÇl‚ÞGì^ï ï$µÈ`@º(£^³B„nÌ´ÚD>"Y|,ïÑh<„þŠH:ߢM©EMÌÂP£±sÄÉÙS/˜‚à狘)=úb'Âþà§åjTJá‹/齘c_MRÂê߉’MMí!Cÿk™ VÇò ;@zÍGKÎìå4Œˆùàp¹êóeý²¼rSIÁh,¨‡Îú(F}ãkß‘àpÐøyîÙÉO44Ä)?Û…7ÏÑ”ZınK©¸[äËW-ý’À\Þ©’ýršE rÚ ±ÃN!­~ÐÞßfRÑ'·B ^M§avKÈf«J°ïa–J(ÇlÝJy¨+ä."üé¶É·WJób®)~¸ÒÅ{SN“ G}C“÷P8­R²€ƒâ'«^#™ãë\ðÐfÃs›ðhÔŠøz©â~Q¥zq•ˆíìÏ+¡ß½"Ç-&C©~”‰½¥Ûˆ²1ŽÕªy…ûVtÇ“°ÚÙÉ{­1D+¦.ó6¯áï$³†`iÊ_nähâøSÆÃÌÙ ³ »HõâÈ:LÁ÷ErÂç{¹Y”#6‹é=¤o™‚_›4ó©Mž”ø±—±S†PP¡ # Kypo”7ÛëÙ~º^£¸7>³ÄÛd¼P…þÊäê ämöÊÓ‹²¬³F£0ðë°ä¡ŠzÁ*R95ÉضÈÙ@IÞc ÚÒ ¿q¬×ûê¦Ùb‚&eÇsãäEa¤54•É,òË€4íÏB¾¢×äC™pî|Ö&r§´Ú™2ÆÅ‚ dÂÍ6é^ CʹùÔ_ºWm »’ÑO°'!­÷5“9P‹RÊ€Hõ÷Ë>—y˜ÎõÚ¨xJNáT—Ñ09ì@9Ë“= ·Bhr“qŒ¦INœ f§=P;jCÜ »Íc$¹ Š¶iÕFô9L3¤¶¢¥¸âF%ð£óóàÆOA¿Ù×;6:«J¨ëï,ùæüHÏœ—…à~3c Ôø'Â[i¢VQó 9®Æ‚Îä>—•±ã\ßÚ“©ª&æËKr=ž’tºäSÈ>º ™÷È5¿ í"KÖ‹>De,l^&F"5xSî(aÔÃà)O dBAGı£B˜¢¬[Áº?%‚é%vÕKZ™—ÔzÇ9S­u’*$²ËôŠUœ VIQö¾,[JÎ~Vypáö‚e¡§* e ½; V_ÿ`5u Ê¥MºÛ=ò @ Rü¡-˜™¨51º]Ê3 2 .­Õ’ý×QÑ ±OÒDªÖ‰ÿöU ùlNÞºÞGç]»éVÈùš…;Þ»™Ó5e4ð>βWqosSo$ Ì'®á4,®)¸â0e­7Ö\Ú§(‰XÓQ¼ÌÂ|•z.†¦XVãXº‚G¤TIMÉ£`~‡ 1Ôqdt¿ÐÈ6žwSqWÀ WÂ%¶–H±sŒUÀ\¶XWYùV•P2 ëp’V/O!$~Ô2p4·,ÌÌïÇ{^JËÍÌ šdŽD<7!1g‰š2²\CgbÿYæš‹“ú8Ö÷÷qÌÐl™ØÄiYü¸ç5ÐÙS.¯ [:õ²BJ0‡ì€15b÷éŽI±35ÙŸ4{2nŒðѧ>£+l¤‹6yÖ„)8g>kÊzª »2X^´öl¬NËâ4cw÷÷Õž´Éâçú@÷/á]éÝ?à ºE?XÆWߣ†ÅRÕTÃÕŸ¡†«§C7“§þ\äØR‹*÷»obÃ9XD¯< jÏX«¯NA‡ÑÜa®9‚É‚±Õ’±¿Cò£ä´k„ü. ‹“¸Û-ø'–ƒ[?øÎc+?ö\¶â¥ã=¯W<ÓaBJWtÕ1Ðk± å`æW±³kÒ"3±Xo‡’ˆ žOcT¹@©-…=—:çô3†@ÇŒÜ;Ñþ(¸gi½^ RÚ‹\Š^¯'êZø£í}Èüd³Ëî5â—nL‹K¬ÊÞ߆É;¼êͺü“Ïå·À<ÚËeNkuÉ^¤lµyg¿ÌÉ|~7o“b”iÖÙ+Ä•M¬Î³<û¡É-ŽwÒMqƒ'3†¼®v½$z$.Ù…a¾¸“†|ªg(7Pó–\|Vp’GÃÏÙÛA蘈ê\iß•‡ø¬T½Ã?$Æ"à-Fcš˜<]+ÅÐülu²U[Š‚‹¤ (çH‘ÅáÍá!?0±‹;®ÛmÝN”W2>CƒÿÖ‰£:H¥O+ÞÝŽGïÞ¼µÉ?Ç“™}}wëŒÞ®§£—Ó‰BÜ•ÒÊý&qhæoåÎåoÂóÆ•>«ûÀ6ÍYf›,Aî¹¹4»ì‹T¿yBd7n:Ž‚JykåçÞ\5 —† Äiº‚C¿f>p•ÙOcÕ~Qspøl\¶‰­>@—7„âÈa§+¼ìf$ùņb΂c.ÿäÆÉày¿Âäâ‚%SN/ÌÄ  ÔŒòØÁÇš–e‚ñ]šðæ¥|ŸÊQº[RæD «;ÙC"uÍuaV1ﯶÕÜ,föЩU½-µ} TÔo٨ܜ ¬xD¬| ò#AD\°qQÏð0¢¢3Ìñ€¨Ö 2t‘çþá¼Aþ‰HÇü;…Lm^Çš!_ùòe5€œ…ï´‹MMÃêB*̲N¿LÀ6ñq=â¼C,ÙJ ž™¨r”–éJ’²¸Ù {Ø"è'S-=<ß䥥jƒ<žÙ¹„_+`ʱ'7³éÈž8ãéh±8ÈÝzØ?y9èð;V×|Ð5<Ùóe†fÇŽ2ó:ÎË»ùttûjì8º¯ÎôNŠÄ(¾€Àg‚Ÿ‹wż٠ ’ÃMÏ£˜™Æx¤{ä¡6¼B&8¥\.7ojòݬB*hÅi…LAW`´Fœzü°úfñ~LþÞy®uÙÖ§¬£„Õ}.‰ët¸lé'Ìe$HÑpøé4¯wÅù·ddç>’%æf)š,±K¡aV€YŦrÏ$aPT¦ð\¾ŒÜ¸iîmn-úÙEkê3EÁ†p ËËÍr§Õ,wùãoòñ78­KmÊQ½ó2¿¾¬îtÝ°'ŸCe]]ê‹éÒéÁàˆÝ1•uöþw7Ûy $/'·öüQt7&ºP¯'ú°€ñ2Š7áøç9çç|Ú>ÁÅ)ßDðJYž[Ü*î"åüñª–Q÷ü|¬ÄßWVñÿs˜Ü¾2”¾þPK=èÁ‘~¸„arc4.cppÅUmoâ8þœüŠQWªÂh{ÚÛ˲TUÝåЖ»êTõI&Ä"Ø‘ílÉ­z¿ýÆ@é}= Œ=žyæ™7sqLEºQžCž70Cž±càLŠ‹ŒGË5#É¢„ä0bÜ÷/.`F ƒï×€eKIéž™†„+m@ádY…ÄìGŠr- HPiñ-JTæ)ª¼+ öŠ‹%d\›.ás‹–!ú’ –e%DRâBÀZ®+#-9'Y¢äš€ùÖM×qt )1Ó\D ¤PÖA?©bTŠXES<)]ôZ’çÔ€6Ìw™Tà–TnIžÊ"‹AÈg‚­È¬ó ÓS)ìúþ;"‘Äè,Ònzæ¿‹1¡€àúûŸÓÙoÓé|< ¿Žç“Á·ñýtp=ž?ŒwpÕ°tµ#S¯3ßÜN‚kUæFN§-_°5êœjI%c«+øéû?$]Áæ3ÔæVPPÂpf¸:hù?}ÏUsÓó_|ßé ™ÆOŸþÙí+­õ|}XÏKZ/ò¹²ø]D)F+ŒïÑÜaPѨ%¥Ax¿Â² …Ð|)\w ÉWm¨´&Dü–8eÔHpž3ÅÖº¢§5*C—<¾s6K“•u«ç×Ä®zv·%ç{®8Ý%RAÀû—=àŸùõ#ý„aË÷ÈÆVù™òW¦äçVÄh=\¶]Càîü6*±>„a.uµ'2ôPaߺy¬]=AìHåœÜm’¤wL¸>ìUŸš: 1);Pž@†»°¾ô·…°¹ðšÑ’2Õسìc®#¦â!URÓUU›î R7W´zF˜°"3ÁÙ¨¡}ÖRÛ^5/‚ÕÎ;4½´\ƒ¤±¢à3ͧÖ0ûâÛˆh®¸Èìðäø[¡5fp¾i­ÔrU÷Uôª"úÑ¥Ë6MP†¬çu–TNµ´ªÖ‚N ·-ë¤Ú|›ðª ÐJYÀÂE-:967(PQ”ÃLF« ", “†Žÿsã~\Ï©}{îtlɶšaHv  ‰hÛIm×ýÑ:éxªd„Z˜a{·÷FÑ[\e%梖nùdn#ÛOÕúÔ5–S»¥Ê¼‚Òûv=Npõ°lŽÅeõÞX ë¥faýìˆn‡-–´Ø·ròW#)”Jˆí,Ï{m";m(®Û=Ì4þ'`Ÿ ÿ:}þ|ýTmvOUy².SñeÜ&ÀÆ*Âÿu|o÷Òø·OFþ¿PK=o³ÒÀ? arc4.håVQoÚH~fÅH¨8(Õ] DÀÉE-’*OÖ²ð*ö®µ»å¢ô·ß¬š¤m®¯Çã™Ù™ïûv††\©W0º¸ž-Îg³px1ú3ü›5È(>³³†T"É#„ºuFÈ,6¸ÎØt8 æ³á(ƒÓ³isd¶™Ó³Y‹1ÅS´Ÿ‘ßôàŽ±n÷7™H¸µ'LÏëÅðøSÅYÇÜ"ô!Ë—‰pÅäË?âöªµ‹{ïÛÐkû¿Þµ+¯ ®"Nót‰æî´yx;ߦ):#ňÊÆïÚÇZä)*ÇԊݱҫÏj_êj¶ŒÕ¬w ´²DÌ ¼™¦a²ÖFº8RëÍÜt¹QP÷ êƒ{Š½Õ2‚]‰xœhqÓ\n»,wm°ò ]ñ ÃJÿ±´‚›è˜msç |)@ŸÂcf´@kÇÜñÇ|sêM­Û»BK³T•u—')PõG±ÚRëÎl‰æPøŒÔE^õ²â‰Ej¥ržc²:S·he}æíL¾ï|¢Í†Y®ìJ›´€ú{A¬æ¶z‘>!êD*ž>r^v”kðú 1>±Ìh‡ÂaÔßA~©DŒâ£9:Ò^sÃܶ!WV®F Ub…´gÿŠ'9θ4~ϸá©-Ø”Æå<ù6øÝWÇ¿‚[ÁõÞÜ^üP\cýP-·Åž ZÙD$R )§îbÿû)É$•%§ÃÂÌ÷̓Ù‘Ú,â!Dd°øÇ[Î=oÕ[Œf½©ë¯>·Ú(`^”µÚŒqyÈ}ªc¶þsû¦Õ²r¯7pW}w4žÝŒPxžÓj 烯Sw¶t‡«§Z3šj<38tïÇ3ת¯üåb<Ýr£zÃxlÁ•&Á–JòÎnò¯INÚæùã­VÙ7g`Œ+çæææýû?>¥%ã›;BIÌ[Ddg”ˆ¡Sä‘é-Š$,±àäöíÇ·¡‘I€[«Wm¤b‚ 2®+õ}€Ð(çÚq¯¡'%Ý{T¢9´]Éð7ì_G0þfñ•˜±X BƒR­Š“Y£yG"!ÉšT†F”¤T³5‹™ÞW‡®E <·nmç|•˜…Èx¨Žñ^Jï=¦×ø泟XWõ0ß… ýପÚÅÁVS¬Eh¶<Ð ðÞ:O(˜V—*áeÛ—€Sfq¦ž$©ÖÏÖ)²t.C9C3O²ÕàþH®-ÅUîâs › Eïe똥Q§ òÜ_§±Í’†&ÏrÜ8 ´RSZI-ú{GÜ×ízžÞ}wЙÏÕÎdrÇ«‹,%º6²‘‡‡ðuš' —O*b(R`Ñyë:]è9V÷ÃÑñšE’@§Ë87u}…•WPd±f)Ö)5½hÌw8Ð`å´~ÉhˆeÄ‚(fð;9:nŸž‚Rtslk!âJÌRfám@éóövyx4 qÝðƒ-$%Ð×h²””+œ %ø=‹±`»Ýç JŸ©Úâ¾Á"{X%Í}L7ª¬öGœeu*Yz™Þb‰°ÛpŠ üÒ­ºLcžfºŸáL<ÜÜkv›y¦Ÿñ4]Œ'ƒÝ$Ï»H¾šÖGgaY9Á£aXé:yݽÍ)·Ù°ÛÅ=ÖHêpô§r—§ôââÈówuôçð+ÃÏI~¿¨Qàò@˜ëx¨•²†¯\Õ‡`;3^‹ßÂèCJ‹mÎæ:’%ÈóJ–¯i 2  J’‹¹µ“ý¸±^nªØ‹‘Zƒ½è£& §€àßJÈDl:ý“.ùSÇDˆ‡,µ¹r,ðôý¨’ûí+Æ\Ô|_îã5xPN½ìLéƒ)_4j…{:¿ÞL>œ¼×4/é:† Ã/}pgÃÓOö± ÐÜp­ëd¹Ä^L#'ˆ—aôè/ ÐÑœÔÿF ä3rÛüÅ4¯}Ú2 o‰,þ ]¶ÑéOKÛ4€È˜“Æ(!Öü™`A`Û@ox''ðñbØq‘ôþEØõbP@ND¿çw§:´D–ô±]:§…>¶P½þÔaBJBWWÈúX?³ßqÖ’÷ S0Â$‰äµÌÓœ‡¡®¥ÛzxO·qI5Äæ¼À#ø6õ&ÕÍ[&wåÐòƒ–6Õ[h°tÀUŠÂš£#áî¾,SÔF$J05×ó¼Ç“ ö†i"BKSZÆýbIåiÑ!ÄÊ¡¹BOC).y1÷R“âÉxZy>ÎH­×•H m4vïŽ- Æp)ƒ±dŽ3 R?ŠÂȲ[,1Õ™‡ A$DáGK?|2%ï¬û‹ДU¨¿Dï(@çàpû~vÄ ;ÒX…O …±ËzS,Ä7y!ˆµ53®à Ábâ,q7 À3Ä¢Sý­S„©ymÀèMè-hžáf˜ø~¥É f#|²%:í@»¿½¥äØ©rUzlåê™õÅ­ó_ô+„ ½i#%¬Ü@ «›½@ù‰òÈx#K‘ë ÏËÉMHä±–˜¹Ãî\‚ ¸*nÄ1#c)ìÀwP‘{€{ð®;íOg“鶉‚erõç7†FΪ¥8q9jT`àìDcuÂ3S_gÚ»”㵺ŸÐ°e6 ™¥<…Î9~ðËæ?¨–më ©¸ì«P¹*Y€©¢–ñ{)T,æ–žlJ²pˆSÀ~åR$¥ÁßÓò=lÞ}IúyâžY¼?®«V }¶m©Pw91­ŸÀí+'‡Ó)iº)ƒ“L÷מðe`êÉ+Ò} e »$Hb¼Æ±Ž¹ëÁ+v“3uT[“²k‹8ß±E(oïçŒB>ÎÙ”wÀjžù\ɇjÀµÊ©Á«0—ÑQó3Y¿~&ÑÌs?-ŽwdÿúY¦vc¼ý|‡IäâêÄ¿À1I]Oœª5›ÓaüÉ"<ùJ78À‘ãsÍ"((Ù§%ž"äÈŒW0²¨$EF½ 84q/SœZÌ ò©¶N5)»1Æô„ T[úJTÞHò~°cÇ]áaèD5©¯ÍOdrîÇÎ,‚(7,s7è5›Üþ:~²ý(A >GvfÎ,¯=“`q¿ž†Ÿxkß-­É´÷¡ó½uq_È¥'ë ÙíâÞ®_´ÇÊ[ø¬·/ìô ÏS‚E§p&²¬ =§y¶8SÚv!{…|¦gf#ÃÞ6m²«<ӧ؈ó¥ˆ=›‰ãsɹ¯d‰È֥ވç8{nÀ!¶MÏ—›’£e» Ûè‚=ÑÝFÉ1ßК€› Ô²ÅG6ß8¨{`ë¢G»ÇÙ†ú5;?ºj£s¶Á{ß&8Ál„¶·©Æ‰œö¯ÓÑ1úË):AjèìG^2åûs€ÈeN œP«tómW1ó~Ô rwý~w:ôúÃéàý ?¹ °I1e»Iá€LTÕÃFµ•þÈ­&¡m>Ü«‚-hº}'ñwß çÊKtVŵˆå왢‰Q¯Ã±‘0èQ¦Ð| ‘Ö‡ÏøðŸØ°™mÙ +vêeRäŠia/c6Ò"C[ÝÔЭ֗$ºRmÇŠU¤´_'ñj6wÜOg#t©·•ÄâÂQ ;Á¢»Â0w¯sðà(bú“•ÓèÃpåß |/À•;%â(^ÜÍ?b—¼÷|‚£fS@yêDQ†@*ðq¶ô‡fî§3Ž¹‰ÒŽáq‡¶eÅXé&)§+Zl]'î'* ]¥êе¨W ^À«4U†j +®g ,à|hÿÆøX ¤JÕú—Š}]¥;‹¨iÜ:??%(ˆ|õDÿ›f±*a +ˆàyŒ oœ¹-ÙXŸ<â®(YL‚eÒubŒÒÞTÍCÉŽ®¾Ç™·È4Y_TRhÉ(â:³) å¶?¼™~͘KÇ÷YEaò°’šðÇMÕæ–Ê!ðñûtU¢£#DÕb]\þƒkÃJ1Hb04W-^Îí !‹å•Œ©³ø“y„Oìë [ÙrÏi6¿süOÈ'ö!ãÃÙ—·=òÌÉÐý„G]Õr¥½ÐƒcÄÙÓ@‹G£0ö8líT)‹¡Vi÷nçŠûî´ßc‰¼T…²üÆùäo Tp¸”!œc9K&^Ϧ”ðú®÷CË(ä‹%¥hšBX&4'ïãâÂD»eê Î2U¨­4çEÞg(‚/¾T2—`ãÇ@ Y ­£Ð…²œ uŸpŠB–Ñ(ýÉI>ééjëiûC2é oú³þ°7뼟ödz~§ûµHçܘêܘ=¤v$\9;ÕéÜުͅê}¶É˜ôǃþäu¢&v¬ Ìêãû€¬Ê½P,mé¿È+KáLÊ †ìЖ»‡oùî“éMšù#K|2¤KpY좉mŸXði{po} éÏ¡Š¼„Éë÷wý”ÐÚ¥9^ñJ“ý¶×]—R'w+ ià°µ$¥–^*ºN„PaH Þ#ìÌÞX9ðÅ ¤Q~T„ò·b,™÷HôLe8Ìå4Ï>ÑÄã¼—„‘vŒMãÇVQ®­ÐvVÑ4 ^ã¼è÷“y¥ôŽFZÿòe]Ü“DA)CÁÒhÚ0až¢E6ÂÁ¢.ëÀ@žB!½[ˆÅiáìoì„+y¥!f5ÊwŒÂòìvûœFÊk·OmY×3œ•A'ÒC7!‹IQþìèmE>;>0)Œ53´ý9Ì ²ŠC•,=¨TDóôN½"F¿˜ÙýS]Q–þ’‰]„CÀó>Áã´u®âFåSó½’3-á¼Òªá¼2VG¨·0ˆ˜ÂÏ¥·4î –1öÅ‹sÚR¦5Gà)ü2L¡À–^¥feŸµÕ³´-ÅDàEJ ¦›'ÍÈ믔•zß1^$®lrf&è0Ö¤¶¶»¹®ŸÇNð€ð3»‘¿+‡¸zw††à)Úœ ­4åðfaêÈŒRQ¡!×­Äà®}‰G2æT ìÇÞ¢taÉ]Ê9•-´wÁ([ú;%b´,´ÂY'0;´í‹Êª@>³ä—²º€ñYVº×ï«U±‹ÿ‡*ô[Q£?n¯•W+y¥öÉêú›x0šés²öœtkšJ”õJSR½¯¢ÇRùº :~Íaø÷=ýûˆ½?ù ~> í „ Å}àbYØÆ ;Ô(nƒ`):»F¹ã?„‘GVVÙD~€­ª#É=Ën;„ŠÖ“X;‘óˆ ŽâQ„cº-¶Sq™k!ô• 5Ó«N%q¤Ø䤤¼ ‡¬b½Ÿ·®ÔÜÊ^Fžª‘V4§¼Ìå·Žhî±ý>M]Õ’jEÏÔäÍ€]XzÛVÔ+·Ìʬ«¸6ËaïÀk“^ )™´ªheô¿ ‚©š9詯P1ÿ·$^Ú+ŽÒ¼ZÆ>±?(ø£oº“w£ÈÛ8¿:õ¬=éÈÛð?Ìoéeý½¸r½ä4WV–CMNª¡ÁpÚ¿ékèþŠó%;5 sWvËrþÿÉk¡ö ZÞ{ù7õì¤H-ÃÖÌ”å^‘—4fEíYycSx; }¹nMñæøìæ æ%AÌqÛä¯ÏqåPW|w[`XCïÖĸzÿð”xöÒôVŠ½ÝðI_jý|È؆¾ Q­…ÞÛB©Xà±(´L ;ìiWûé“é{¦ù%œ÷¼¥ùPKŽ=áa̯ ´.asn.híisÚHö3üŠvRåäo v°`@Îdv*E ©m„ÄH-ÛÙŒç·ï{Ý­0vœ­ý°þbÔýúÝW/í©kÑ)ièýÁ`¬Œ´ñ‡òK³]š.¿´]Ó -J^Lm‡Q?8œ¿H þÒf†În¨É<ÿ¼\Ö”+u4PÚ긥^vµJÛÿºdÞ`P-—Ž›Ó€fÌb¸™:ü—O‰ë1bz‹¥C-S7\`E7fåoåR«ßï©ŠFJ¥R“ß×kåRWÓÕKu½‚±VWôaW»ŒF_Ãh¿­«É8~úr9Ö®{½ô-‚¶þ¡¶õq·£jz÷¢«ÅÔ»dª£ŽÚÃ.èJNýSê']jJŒéƆ*ÿïH»¾R‡Š®v¢QF¯õ‹“Ë& Ô_®U­­Ê±ú1ÓI„±Žà»íŒduTþu¥ÕSåS¨ ý]=K®Žªø÷u#»5ÒUÞæ¼ãl·Çz÷J´_G5\ªØëþSíÈI>…Ú¸*ƒyVßsÊ£n¨œ0dÙ‰Iùþ´;G׺p„\kÝêp”XôutTê(ºRJù }P•X5í4í¾D®ÁI:D ¿Bu+ƒA¯ÛVôn_“ÃoŽ´PÔ@mƒ‡´ùÌɱÐúG0o¤ó˜3k»Æ×g[¤¥;Ôô,ªú¾çWªä›ûÞmf¼R=½/—MÇ‚$(;½¹v¿¸Þ­ÛïvHƒ,Éc›™… 1Ú}Ä°@¤‘Åÿ¾ˆÅ? E>$àÄ›ü ‚˜Øu™=µ©ÿX¼Ï 3=7€8>ÙƒÕì| Ö èí¡Ø3—ZÄvÅ÷¨;csÕEðJfÒá352ùÊ(ÙóB¶ Yó¸zZÎ(!°ÿMÇ,•­ÝÚV8RŸZºo¸ÁÔó³=—ìÎqn=ß’Ä9°èSún@¦†‰Éž7<'ÚÀ‡€Ë²0ñ<'Ë@+b@¨a-¶[‹Ø9È"çn’—NÈ¥…Ž³I¶¼ªŠ¨bCmDe»®Öh]ðÕ7e#æÛîl³ê…ëûÌu¿A}[ZúI4GÔlÙ–ã™_È.ÐÛ†X¬­mˆ¡iÿ;TÖÍ zèÐ0HRe¥Fòå Æ+o’Ø¡xÞ=Bï³€ƒset uýQÚÙ‚.®>BÒ–ý N]Ë&ÀÐ jæ`»Ì‹ÿ03+0G~7¡/]%U ¦¾· ú&åÔH¹.pµ€Û"[ 墵¬ "ë=éþvH_T¤n\‘VUF¨Kéâ'ªÖ-ü…ùþõ+rƒ•j1¾1œ•z "uŒLÀÄ6¨À'–æ’¬èXˆw‰·¤¾}ï~3¢äÏX‘:\†Á|<1Ì/œ8•å†ì±¹pt\‰±Ûmd†;Û©\’0¶a ¨±Ä›îb›¥NØÞ"œWby4pÿÆý#4‚ rÕæÈ)®ÕžSg NË%‘bkp&t›æ—¾}c0Ú@@Xn —ªøˆ@¨ÔHlÛÓx½ #ÁêÖv¶,»}K8ßßÿ$=—øN;ïG±%ß×úXlFMp2ü„ÍÐHÑ.Õ±ªuÆÊìƪÒþ Áš¯ÖB)½^ŒëMj¿:Z|’”VÈ°N{c†9_@Œ‘&Á-Q.q¸K³õXgbç.w2n·AÈ*é„h»"kÅY1ézJ—”iábBýþ´-·€’ó "‰|“‘³»íÐ÷YA” s<Èü€mà6ÊÖŸ  l¯iq.å‚àwû3†eâ˜ë܇H.tßQVáBIÕ,Æ\9§9)s)T­ Ž8ô†:§Ù˜I#8Oó p˜ìÁ8Œó ù©ôÅÄ%ß’]lôTíRÿI·ßù­Ft¥ 6FŸéô5õÖcøàzn¸Åضà·è•‘/´Ú. èŠÝÙ©lîwxù¸¤.d@GFÜÊü `J%Á4i&–î–ðÃfÅEJWB¾ÖoDUàh-–¿Š«¹©ù6 täVAlV8«•@gjÕ™_ ê£>«äW&¥#2ââ\¨®5¤ÀÔª$5‚‹1 ô zI%W;xçlÂ%’1*ÔK}Ý{µVåŒû|´›Úer b V6°at]ê4;ê…rÝÓÇ튦©àƒ\€ v,×d~Hy2—Í·ü:4Ü}/:Ã^H|Q×jö~í;ã+åÓw3–T5(©¦áÈÉ[#×=9âMIz *•}EƒÀ˜Q°÷œ¥ Ðì[r  pÇSibÈ(à ˜¸Vô©|¤fê*g¡ Еœcó 8kè\foÍXˆÚ90l? »KÇ<¬ÆþÉ·ËÕ´?[¡…²¨ÃŒj’.:©t!ÊÓÊtщN¥Î;¢Œ·2enj݋ѵ,:v#’Ô©P&™‰ù}þ¿Šx«ßïiÕ°Å8â´èh<ɉj øÏæý‘$ý@âÀ ™¿V×U†G•õ*/—J…!F"ã„ï6rSñÇq’¤Xÿ›#)+„RÁßÖ…TÃsÅ»èô –•XÁÏ !$/Ù`º?ûÏgOvzýÙüe\=ìåús98{зÙ÷¸5{ºGëÏçÌ,ãÇl Ö¿Ó{…n΄Zõs©_e¤õ—(:ÔçX¡ Šû²ñ’ùg˜RfþbE"„ò$K)˜1“¿Fð¤ù++È7Et¤PJö”T‡ØÌV&U²»K*Ø!Š*i6+*¡äÓ6b.½%zj]ËëýÖç,x’.AòXvÎùþŽìˆ½1'•?8OŠcøRâÈザ[ÊH=_åÐñ‡Öäǵhº¸=½ ¾¶ ÎE[Ç(±ê‚…FÆ͇J žtI1ÄI—Xßó kÓz¹2sFI/ƒ#qÌ ä 8ƒ?Ó¯]wê­Rŧ·Çïc ¬ÈYuœÅP]sÓùØÎß`í3<#Ã3ÀKÊgæù6›/øɣ衛ǧ o­’´|÷Õ[k˜_Ý ãÑn÷áÜZiZ±<¤•xCöÞiElMJÉð¢M^½yû¾_&GôÓáëÃ:ï]w¢Óå¼å l)ï`W¸DÜÇKøX€´º:‘·Òsj`FEÍÚ9ƱñÄ«'ÙÐ 0i¸,9·‡Ua¼Äƒ$û±ž·a?í\ë‚LvýÂkðs{t2ˆÁ6X öÿûŸŽ°Äì±sf=!ë–üMÌ–q£yþÀzv®“pÚ†ë´+e´éE}Á˜oOB%^:á©,bôŽKjÚSè@`ùÞ9â»s‹NÐaÄÆ£l:à3¸%'ÇwÓ)ä{ŒÂÒÄÄûÑSH8ɲcç0¨”ÜÝ Ä ±ÏbÌð±¿Ï{b\i§°%¨Ü’óshà#Àƒú]Ý;©Æ¤0r;· }½IÎI[üœüó3ÊxÌIpñ¹ü«wù›,º¿ÏAAFPý!ÞP%G ™[)~x låŸq‹ML„0Éý,ÉB&ðú~ 'gà>95A›r¾#ò±ýîïÕ¾¾ºVCœQ»áŠ°9vì…ÍØ~5 ã#g U˜<5’+¨8¼0LßCdí_ßÔ·Gf„æ$;7¶Ê׳IçAOÇSxì®óô§T"€¶Ë›Ñëp0ƒÃŠ¿ThHÏß±ÝCè pOøçŸd‚4i[Àk—ºáà‘´…ìr–K™w`ëŠçÞf"™ˆp8å‹ÖÑKß…Â#œí´³Ç~„N/ „—ó`4ÐÏax_x±d"µpõ[Äkcô/ÂBÀž‘P&zx*e†ñÄD iìØD«‰ßÇïyW=’h6åC£= n4ø; gßæðݨC†@FPU~êš´Udwž›ìÎVdϾŸ*\‡ÞÙ¦7óåÜ6 gŒ¤ ŸVÒ,òk¯Jµ–aôâM@-Ãlé «‰$yÆâw.…ÊÞÃgeÉ­@ö«ûM€Áëöä͸ªuÊå—ÀŽ=-ÿPKŒ=ô%£ PG authenc.cppÍXÛnâ8¾¦RßÁËJU˜ÒÃ5³tE3‹fÚ¢Ât´WÈb5±£Ø²«¾ûþ>$8ZXͬö†–ÿ|ülsv†p¡bÊÃÓ0ËÐ ZäL)Êæe )AŒ#@Yñ”°‘b <-ÑwÊÐ5f‡‡¿2&¡¨…ñiܶ´ˆ¡«‡?G“ûÑh:¼Ý?LÆuùÒ»Õ¹ÜÞŒGƒ«›éåÍçá]p•/3%F£ŽfÎ#h`ä ±¢d¼LSªr^±,¦ù%–´×ó%®±ÂA(¸T°¢èãY¡ºH²¿èT¡„r°ü÷áA«à’͸ID>Aõ}LðË’t>®kñ"…túTDÍ)ÑοR>S±–Õþ? 4Oèô‰Î7Æ@„E(ÐF~é£óNëì e¹©”g¤˜ÓÜ胤¹?†,ÐEuG3D+¥i˜-­u ¢]äò¯dO€jRiµüº™<¥Ñó„ ±Žû(h2££9Ù³:·_ ?’‹ f+Å,6G„µœJ¥e^õM$}?#ÝÊ•œßœ°-7§ªÈíÿÚú«)<„ÂÅ¢*·Á&iÚ¥§Ýԉț ÝPi¢–xN’î“n˜Ðc×,ݧ¦™„ªIŒÔ½npmâÊ>¬ç¸ê€©v¥m¹šÖ¯h«,½Òm”Ív¦©f¯{¬Þ˜ª/tY[¸BÒhÕÊ=Óebv¢‹¬ØNé#N : w”á§Ò­eÓ2•”N¥‚HàëXÿÂg®ì"Ù8¾3‹B=P¹äaPâEà|5YQ°bÍ­ÐÂír Qæ ó™ªá〓 Ìòb ù'ŒÖ~×i?zØܬ¨ 4¸6ïÇ–Ý ïSúº±z€]ƒOή-¬£Lù·ZÊ&4½“ t‰‰áƒd&à\ˆSݬ ÓEíš»6 ªˆI$©j;4{»wJ(œüA1¡yÅrÔ[ØA<£ëäOB(Oøü½®¹¾ëôUÌäÉE½9ÃGk*puiœ‚á£5·O'¾eD×ìÍS§ÞˆÄå¤a_W¿Â(={ ¦Â¸jV‰!¸òç¾W§Ù:ôvj¥W÷š§Ÿé 1¸6|4½ô ›‚»Çì QÊYolóqß[¤ÖSNñóšmùW9æ2yJIo“?©skÑ|ÅR] 1¢)81 ”mÊîk£vê N‰'Iy`mee÷­Nm®·TîQ¸Hlá±$S„"í‰üºß|Žì)g¢²ã 9)>+1¹œÚ’Ú4¸ËZ ßǘ‹ÚF¡££æe¿@·ø¥F : ¹Õä³"…$ׇ£v¥VÝ‚èKH)‘(Å/,-R‡NpÃ0‹ÕûOVÌ+ùŽ{¶6Nûx@ ,Qƒ Ç8ŽÀŠŒ!w¥‰+u>”ì¸ÝzŸì ÿ‹MªßŸ‡òžx?(ú¢‚N¿?”ŸD¾À9©ÚÈA/߆¨×ŒÆñLÀÍ«lî.¸Ò´©åØûË:u}×*èœúÛäíQ³‘mh·f?ÂÙFbžFcP?d&yÁ ÷ã8q8“â°Âøß݃WבÍÃÂàOÙb£]¢ÜàÛ@r5¶M~j…úfïУI3Bï9ׄñ&)Ÿb“ªÞtÜÕÍ`ŸÄ1!LïNÜßõË>j‚Áàº0Á¹¼/ß;/Œìái®Ÿà %€NÝ ÕËlŸ¨½Û¿û¶c­¶ÕèçC}}ðß@ûŸ„¼—”ÿÉÝj‡¸¶\Ÿ´K˲ΠŠ”ðñ¾ãÞv¸·¯õŸ§nî®ÍïX”üPK=ô¼–ûØ authenc.h­UßoÚ0~.ÿƒ×IU¨h»½ÂZ (mÑ( í´§È8°êØÈvº1Äÿ¾sœ”@i»‡½DÉÝ}÷ÝÏÎgžÈÒ»ÿNîÂ0êFwÑã¤ÓöI'³s–3j!/Ó¬æ¬ÇsÐ]j€´È"› ÎÞ¬×VõškÕk% ˜6ŒE0vÏŸÚ6Èjí:8˜*%ÈÀÜS«´Ãƒ¦¤±d¥ÁfZ’„ íõ&z "ÈgЖËÙ«p«3ý¬xL$›{ÂêÀ~‡eàc§K 丙IÃgbÂ¥mzO9àVkDSx¤"ƒrmÈÖŒsFÒ /¨Ñöä,{’gŠ¶&1üD–<ÁR€œÙy³¨w7ÿ‚jššF»ÌyÆ û[ñ„ÅÉñsÄÜÈÚ(§Kηì›`š%Î@+‰ulUÈŸ›®qâË:?ùºá~XÄnc[Ñr‘Ù—n^evŒb³²ß2Mi}#ÓDg2—Ó—TÉRÊ^ø>Æ7‡@)jeat«ÄW%™—SeÇ®h•9§õ;ê%GäìŽñ•Öò¯ˆQc¿}x¾Ž/;ç¦qráuþ*w{ÝöŠâÚfTì©è 9ÿÒ®àòSR)‡+90w2· ¿íKÛ°êaØwÝä†þ´r~p;ÇÕ{Õý—±kOz§æÊbwP…§º¤¼)ó¾<öqWs qó7@c\±Ëü §dÂcg¡¢„­Ö¡®*½ yûPx~Ì2Ký@V•‹·¹uK”_ƒÇʇ#~VSi¥Sˆ«ŽÉ~³/Îé÷Às·’3lé*¦Y’€†ØÍa¾$~)£×*K…Ÿè°Ga¼EåÓìX=ñ&OGä\c`Ýe±âNôû¶ù©öG—ù_dÌ“zí/PKÎ=O Ë-#¦ base32.cpp­”ooAÆ_ß~Š“†3WÚ€T…¨á_rZ)jCÈr7”-Ëî¹·ÓïîÞqô Úh¢/™Ýù=Ï<;ÇÉ Lhˆ¥bÁ 8†•bZ£*|8õÐ&@Ï‚h™¾\PS™¬á\Q1—rºÙH.äƒ0ÃÛg. ‘A“2Bž2áñÈGÈÞ¬0ËíR¦Fúµ^ë­5Zãz«Ýéçjhéº6!¡¦Úè{R„Ú5B8^¢7TW#x ¹Z½Ñl·ßuÞèõÝŸ.>.‡_¾~+–ž—Ï^¼|•«>éÊÕB'žÓë»™/Dð]…:Z®n×›=YJæC=qÝžôQU*PrªÑï¦ålƒù­JŸ.ð’ò]ÊTGU¦¢Q…6ùA¬‰”¢xσì¼ÐFt™ž5qJ#®ó1®Rìò¶ZEhW‰µO7ÇoöL4äbÂú‡6òIJ2!Çüêѹ9ÚUR™d:&®»RΣ ¦]Ç‚™Ý·p´÷ §#¨¤…m¢§#¦”‡h§À®¼.ÖSÛåÔ¹m¼ß„ÚÄ 5ÆôÇæ?Å‘ÃÒÜmà base64.cppTksÒ@ýœý×8Ó’JbK¦:¼D¥¶jí0K²-ÉnÜlh©ÓÿîÝ$<úð‹ßÈÍ=çž{Ï ûû0¦1+î¹Q»p­¸ÖLDu™\€öDÉ8à.x2¤X/àœqhRNÈs.Ü ñØ‘ëïùöF!çÆé×z­á Öhê­v§_h¨E¤å`àkª‘Ú•"ÖȬÄ£9s/.á„X–]«7š­÷ퟺ½þçÁ—¯ÃÓogçßü¤c×c“©Ï¯fA(dô[Å:™_ß,n^–^•_¿y±oWŸœQÏãb '°}²]%d.¹õTpK¸ÒcªRéÄ2 šyÁ5§¿e…Œ£OCvFƒ„ (W1lETaE3;ä±ÆRx¸˜)Ýå‚Õ£³'­ÛöÚL§ç\ûM6¡I  †‡>Àœ"h•0§J,.4„ôƼì21Õþ#ÒŽøoogHKHI¬l#ק v‚åTä}¤ÿØ¿„ °ñ¤±ÂÑ„8w÷íÆ}2#Ä»¡¹ÖYħá«e%—˜MéJ9K¢šRta„ney8¸,„1soåAfcM5­+_7{ÚJ&ÑШÎ'ÖºÑ l‚‡Ì×RpÃÜÊÌJµ­ôVws6¡§L…\ü¶+§%“Fƒ,çpЯ;B2ÃLv²¼6YžWô?ýýð„&“ù707‰æƒ4£ñˆ¯¬óÐóô¼ÕU³™¨!¹(•/M\ø ÏîáP6ò[ë<¥!§)fß6ît¸4ÇYu˜u±~G,Åt¢ÄREºÿú¯¤Õo’¿PK=¶–}:®base64.h¥SÑjÛ0}¶¾â®a—°Â(¸ìÁN½Ìàxbé{ Š}݈Ȓ‘ä®Yè¿OŽ“f^ZìÉâž{ŽŽîññJ–XÁôëz÷…Òe-’Éõò3¹2—øBF\¢-.VÌ`¡J|·¾ $æÉ‚FÓd'³4÷§zÛXEi@ÈÕÕˆ]ïäÙ4L3H±ÿôØ ¡iW‚°àu#jõ¸ýÄ…EMv¤‡Bâ 8~ÜVj,ï4“¦Rºf–+ —ÌZV¬k”>Bþ-ËÆ°RJ—µÍÜ clcju‹cX¨Ùc‡d(ïíÚ!ÞÄóÂs?¾ÄŸ{óùòh¤«Ì´jÔÁN×;…IÌb™Jn9üús¶AÊ4«Ñ)?w‡0Lÿòçã3ÏÁ¡wþ§Ý®qà?nˆ÷Dˆ÷ x /Ü_(i,tRß™h® ¼mž9þÓÍ Ã[|5Ã#ôœa?Cù<¿ðïùõI TýÚý‘ËûL©MÛDZ³m7‰É Øý×öôFóGt0Öy, §u¿ÍåiY"šÂk®úqž¶%ÉoÝN¡,yE~PK‘=¥8©}*û basecode.cppÍXkOãFýÿŠ)«"g“°„¶[*)ŠÁ"Ù®*EN :Ôñ|H9rÔëâÀ³vF”0b{ä/l.34¶}ü›í%زI£ÝÐŽ`‡á(nF#[î]`vƒÿHH„+Ý5w vvÚ¯×kBW—Ap—„'Qd?˜Í6ò綮ífÍ#cøˆ²ñ/ƒÕ#A„ÅŽÎÖv¸ â"³°‰ú´¾|)Š¢ã:l[GÁè=äÅ9‰V‰)+Yî¡Ô$òHÛÃÛ`è®è‘Ÿ‘(RLîñŽnñÀ Wl‡§œZÇ—Ê¿b袦 Í’*§ Î£SMî(<£ªQýLØú»vâ± …k³(Á<%Ø‹±pmXÁ¦?WàÔA¿¤ÆPuº<ȸa1HˆÜÉÇ}þŽP†,i³&F&ù¾˜àï@”ûMPKÊùó aaÂN½`y7&}ò¡ $Í‚ØiâîñƬè@ÇëŽZÞïåÌ´Q~¨Súl£âMÀÕ,/áqDcLùpÝc1Ò1sz=—xž™bÊ¿-˜²6ð¬AäTÅê<%ôô~P²ÂÇÄÂ9S3<™5Ë—ku ° C ‡¼èŒ7ˆpÄŸ—Sw³2¦l^…Y+'1y목¬q;§R‡\|­Ÿt \DÏ?!s¾âŠ2Šü ¼»åS÷"Õát+FçŒãТÛ4]£sLDðaŒ#ŸPþ¬)YÛ–ŸÚ/Ü+T°šó')6÷B*|{oûâß®º]gªýŸùz¥È]£ìļãÍlCpTÁÒ^,’×ÔA¥ª¹­›ÛË+/ƒ„òD‹ƒ#£rÝÿ‰W øh4^A튅¶ö€…^PÔPs†ç*Ÿó8ߌâ /$F“TöQ…$øÉ o@e2=¿Méu§N;ïmG[j¶åW%Ïo«¢P9–)¦.t©C™ßÙ¦$ÕÓÅ”üÐFªži!÷E;¾‚¥~äadMU\é|V8«˜Ö爊wcö_¦|Ãx‡©C\ãoPK=q½Ú³ basecode.hÍ–[OÛ0ÇŸ›OqiJP74Û1©·±J¥D+LÚSä&NjáØ‘íÀâ»ïœ¤—”EhBñæø\ü;ÇçŸäH¤*á)Œ~ü ¯.Ã0“Ñåx}÷ŽÐ oµyGBŲL8¦B:nì§Õac“ɬ`†åOvM¦XÎ+_o>¸˜,ÂÁh 'çÓ¹?2÷…ÓaxÞÉÉ,™å €«X'ÜtánÅ m }Ç èN½X2kwŒãÙ †:&u$ô (—RÄp­RYÚ[Jþå[ýÕ{ðjcÏëìEùÃ2MñÀäÊ0eSmræ„VpÌœcñ*çÊͯg³ÀëtÆœöü)è?zOÆZYË{Ç1‰,ƒ».å@ê씪íÂZ‡,I„ÊÎ>~FˆähÁÀÝ©Õ’9žL•p‚Iñ‡û솇t;œ.Οã¢×«81ßL뛲Ãîý  T*´³v!0Gö |Ó²„Lk@88ƒŠ±i'Ã{A~ÔíMÝ»Õ"øº”è'“%Ö!Œ…ŶŠ·è9Kwº×÷%Ï„êÂÚ,¹Êܪn&¥eŸ¨y´–°”:¾! ¾çFÜ"ÎH3Ymzƒ'V9¢u]\.…³!7£3ô¨KW”nHIxú6‚R…Ú®#p…–©5•sŠsÑ÷û{ÂHøK…1æ/Æ:êõ„±IX÷”Úq,«Ù{¡*^EÔ¿*¨Á‚çæÿÎmÇ:lU Òváv\mïÝEû{«TVdŠ'D}MÕñ1.§Êr4;qËÛÔSeÏ£:ÿÛJ§þT[1„6œÝX¤Áä`>儦!3º,,i(¿±Bêz›˜Îɯ)£zN%ÞH›ŠÖŸM*êCEK}ÙÜ”uI¯‡õЛ÷ƒå4`N›V+"æBÕæ·Ùù†™´- ù…Xl¸ÉcDät­Õtn³ùÛâ‚fèÕ¶¨çbw¥¿ó/Γ‰n\híŠØäQc"ò(Ö¥B·Z»?®É|Œ¿p\%"õþPKÙ{TBO×­:' @2 bench.cppåZ{sÚHÿ>Å,[•’0o;>Ÿ \ ¡Ø¬y`'ÙJ5H(’Vb“­|÷ë™ ñ°ñe÷r®”#ÍtO÷tÿº§§å|ˆ­Osºë¢,zôLJ‰°m ×Â:1i#:%È,SG†3Ã02Z ÷ÄDul&“¿dlÚ ÕÞ`Ø×Ô»ž6lw†u­ÛÓTe …iëÖÜ (%dMS¡¡/Ø2 LIt?:0²æ3:EGǦµI8%OÑ™clÒŒ±NoÔÝ9X”©9µª¡‘¦ÓèˆéøÔ#x›aÛt«Éä]¿Ñ¾¶•–Öï*ª&©ÞÂ¥N·+oÍøÔ™ì1X©ÍŽzÛvµ3hRwlŸ‚éÁDÌ A§]G$ 9Ê|•ü•Xæ '’ÚfõVŽ½(gã«ùä@æbÿä ŒÍ6Ìq2°X΄:[@TÈ É[–£Œ˜œ L‰G¿^%ç¶oNlŽBʘtgÀt•LúS@¤Pe´ ¥ÅóYT$1 § ÅÒéÙÛó\üt0Âdj~~°f¶ãþáùtþåñiñU©©uíÝõMã·Ûf«Ýéþ»×ÜÝ¿ÿðñ÷ÂúIÁ†¾8¦:sêÎiøs‹Ö`¾$6¥O±‡Ò6fæY‘Ø:]½2´ð±åäŸÉD08ù`.A‰òkx–Š…ÒYšý’¯’ °,Eå2J}²Ëƒ^µ<¸©¦Ø;“x•Ìç×åA]Lù„ºÑMßtléTfC+A»ˆ—±…'¾——có‰òáë¯ôk¼›¡ ?#‘Mi` )€›œL¼´hñ¥E×N/Q Öf é쑽¦H¬bã¤Â /žÁ0GÿÉÉUòÛ°Ü’…iO‚xE&%„@g>2÷3•Xp§ù¯ÕÂùµT9¶i Ç™v-r·Y:îr~G …Gœ%aÇB®žA«ôc9ö$†MwÄGüu%‰ÛÑÕÑ¿`üÑ„¸aÖpf ;ŸN¡K”Jí‹ŽðÆC?2ÄJ‡äuðQú^|ÀKp ˆÛ‘¸^+¿vüvhæÓ†5Vì´°÷°y58ï¶ý±ãÍÞè¦ jGÁÅäàbk°s°v÷nØoü®AbïXãÎ8-€ºéZ¤3–J…³‹;À6_,×qalµç³ñ:ã.öà¬%—ïK2Ø* ä#}ó+‘d¶'ÅâÈïB|æci)\¤õ¥J¶X4Z)—ß±0ãaoCŠàôöØIÎß%nîh«@e0âËVŠW«- OÃI&À2 A…ÒT‚ÑXIWÈ,‹qx:9aK u=G'¾¯ØÆÇ[.0l1ƒÚwÍfñÇ`cLóÄ`•ÀER =TÎ|?2ìzw5üß’‰Ç)Ô«HZ/TF¥\!š^»šb»Ÿû’ØsÝÒØÆã·d:Ÿ|‚}^·~'+#ð|][Î[½öµ$箉͂OP 7E ø·˜•Ã[þÁçeì(s¸ÚP~³š½¿˜ÍìZW¹!^ÀËúÅÚ„~R° I~l£Ž)nòZ R?aŸ,ÂÓ…¾Zø©vÇ"æ$9ƒ Üë­Åa¨cŸ–w£¿¨&gPئ‡˜äûÓÍå¦ôð@âAósÆ”æî\v·ÿÉ£¡6‰—× ÷þ¿Ý?¢¹îœþL¾îX}sxiØPŽ±N íA†ómÈ;Íàr.\ݱ÷Øš“.6=½q¡ ›ù ûî¢Ë±ßÏyˆ»$Ò;÷2± yèàÊõ »7J o&¬t Þ+ø*ÚÐ ëü}Ühmy0°~ø¶á­|þ^=/ GÇ{À+L.»O$‚h‚àšLX¤òë»°Ö&y¢FÆ|6[ˆàÃb‚˜/ˆ-ßA6;­uЈð “ǽM­{Îl ”Ú‚yKÑg¢Ó`¢G&&ld±Ezy¹œ‚L¬BAA‰`”B;•—wÝ_"ú‡=³Õ:còe||fO”ªÎlÄzºQOIÂÔ‚¸è®à,1ªËËÆ=+T–ÏË‘ÀE6îƒR=NûË|Ñ‚*§aël½t¸²Šà¡*Ár¹ ¡|©íOlæÖ4Ðÿµ»|í<òBØñ߀籽™ŸÊ[™ms—Rd!ÿ†´]<ôÿ„+¶¬·Û^J¹×Ewù9î—R³çg»| s±t›û†q÷o”lQŽÍ;xt²`Ÿ…Ebs«üÅᬇ99t»ËÔòv³˜éÙSOK»t|–K1àVr_«þ66wßQ\¥·çGñ½-–Žâ;Í–JgÇr©ëiöôâX™Çìs`Â46×û©éY®ãX±9{®Öªg‹ç…cYOKG³îI9‡°þ<âHÝJÛgvÃm g›ÚÎä²—¾v(}[>Þm¶g¨Å¼å[{ÎþõÖg‡J±$ˆ‹—%\*®3lÏÜsKé©g‡ÚGSšÙÓ\áp½Wnµlç]-àxC ¼§¦ôÀˆÅs9&‡ø»8§¥55®Vœ#–Vœ#ŽVà¸ZÅæÐÔ8* [–‰cºqƒíP@A46ý)ç:ùÄs¡¾‰Á¡*ýË1XzjjÜ~œÜ(*Do)¦…7ØÎÄe]‹£Pg?hNc²hu-K£®)±¼ñ6Ø4ËÔð†$¯f;½ ,&ȱôûœãÊ€8¹mtSÔÛ8,šVYmùŠ¤b¾„‚{š°àºó•çÝ·p[,tMKÍÒÈ 2˜Âi1™²æú5q„"HùB<¸\¢Ô ïHž\iÙmÍ/û¬rXöutHÙë²Ù ÿI¼cý‹ïk81¦B0öuNͺµz¬ÃŽñàþþ-ùPK=¦^n‘Öbench.hu˱‚0…áý>ECMŒƒ+“T`qj¤½„Æz1µõéeЉ¸žóÜöd°g¢>ɶ’R%i)2•ŸWK¸<€[Òn2È"í_·àl·"|ôÄôH÷ÀÌ8unÆÇJªÍEÑ(™ÖªIEUb€Çh Kôp=ûËÞ¹ÕW„ÍÏèÃ{/ÓÝÿ8’±=|PKÛ{TB4À é‰/ bench2.cppíZmsÚHþ ¿b–«J‰]b9ñ]ÙÀ®Ì!'¹«Jk,Ae!i¥Á6»åÿ~=£·½ áx÷6{W©¤ ÕýL¿<Ý£rxˆn‰­¯ÔÝuÑ[ôè™”aÛ@®…ub ÓFtE»¹µL΃äv‹¾ ±Y¯ÿÅ´ukcÔàP«† zÀ–i`Jdéi_­ÈÏDzŠíÉß´‚µÑe÷('ºîm]ꤥnZ Ú²û)‘Šsýóƒ,x¢_+…ì›Ë’ëû©¸ÓH%ǃz¸ŽcÉêPs ‰í ’5¦+Yb:>õ^˲5¶M·W¯Ò.fã›Y:ÒæýÁHðôÌçÍÌŸÍzý|CWênè‚ø‹^¹ÄÃÔtl_ÑáŠôöÐ6^“%N¤ØB· rõÚØ,À1˱—ȤT ht#ˆxï‰Ý< ×>g›bï~dóô‚zÎÂó7ásÇCoîÉVFt(¶b7ºwØòI³þk½ûcÚYÐ]Ô>9«×4¢Ÿo)9·ýžµ<&OT&iº+âq,t0ˆ¿^{IW\ ܯ-ç[‹ÙXiŒ‰Íb •±Åe¡Ötöà†"Ÿb‚ü»Â`$M¤S¢;ˆZ‰]%PiµÙ=:KTQ'ɇ(î†ÙRÂea0pGšè .¯o®/µ›ùhq£W³! ÿôS³^«±„©W„ˆ[HRL¸€SA9I±-γ%s£fÞ!åWGoÞ æ˜Ð)ä×3±éÖ6®ëxÔŸ{DwÖ°GWšàð¯¡Ï}]'¾/ØĺDiŸ°Ä×ò¨øÇ &0‹zÂLžëÏiÚÉnÚ†Ïm]Ï|HS¦p–ÊÕ¹+pŠ¹Z@xf3ÅOóHZ%¨¾ù ¼îÉ÷~ k¾Û6aµ=k-GœD(~+$¤B×$\ƒ®áS.Ó8~j5Ó^æ““=$¯1PûK4[Cÿá% §*³Ãtã>Tµè[ȸ‚…P’qÊ‚Ÿ†É‘¨"†)d¬3â|þÆiD¹½gég¿3u\0M‰@Ûx †¤hžþVLfSîÛ˜Ìâû•5^°msA˜ÂÇh*ï‘Cš9³W30ƒ}šAâtàc@[ÎÔj}ñ‘lE9¡™k×"ð¸¿ôY›ƒãÜ£ZÈïà—b@0愨1¥¹·ì?3ŠO¾k&qsBHslz©w•¨Nho «±ÏØ{Æ^Ì Y8h|3×úº‚1*ã•)7‚×¢5¤ÍÚÁ½DçÏJÂ8Âÿ³1²ŠIö» ¿váô¡šÿ0s¸Úܶs'%¯Z0D«Œ¢6GhWÔVƒõ2þ=@¡ r,eÆglmÈwßE]5!$ Ky`åN2Æs}¨&é|®ÒP(¦Y~+íÅÝßd˜ú‡5Ö©z.“ýˆÊ…:iÂu÷&ð.µ³ŒÇA·„ÎäôŒ6M‘FÖÛqÇnÑâJjÙ–"4Y°xn«ù!Ïülk–Y©at²ÕîM€„Ë‘ìr Õ0ôÿÙ¡àÇéKª&&%G[MrÇk,äþµÆÆááçÁÉzt¼{ì9Û8El5-8ÐÞn–°?šË%ñ Í&]9Ê¿!OÔÃÈج×[äb„mدS»"Ðut û>Ò“ÑtÔKͦàgi0±Ÿp²·üá~E,úñ©;ûtyÉgÑÐœ§t§$hlwo!›<¢ yÂûA¼ ÁèÖå:!ØéirWÊß ïr•’ËSö^È™Zñ]®|Î’t…»Ûâ“Ù­FñÍ­LáõËŽÅ÷1¹%’œç¨âáùw(Ñ°—='åoðûhømµ"#(Aù{¶¤•¸ž«Ù„¼ÏŽ<^Þ°{ë_¤íÖ Ç²T%Š*Žëò€B;â‘}Mg™ïtP£sÝ?¿ÁKátÛ½Îàêr¼¸ú4çŸfq]‹ÜQñ;Ôp•#h0DbÖ™´ÀdÔö:× ø;éÅã™}™š–eúJÛðã'F‰œþ;‡èMÉë[Ý"’â)j4šÉªÂ²_aó«á¿`›ÚZ¤ûµq‹õûeÈÈ-±,çñk£×ËŒãÎBë´ÎU4ïh“~Á¥qM|:Äz>n©ï ̶’(#ö>ÓfØå§Á0k£‹` ¼lxy`2„a™DÄà:e.ÝdqÀý}[\]ŽHB˜ª©}\™”¼4³êÑ»¿‰™eß_œYŒevXQfEŒ ³%.d6Ue–Z¡DßFÛx‡bùÕ´Î\Ó°ç𜼀¸Ü—hØ—2,º¬j$p³E'ƒb{"ÈlQ†1ÔúR¹åü ËóÃÊ=™Î;yñør/½=¡™òÐFÚÅx–Åbÿµü8ŽÀ¸óìø…XïORX y&¯ÎÃJm^•‡Ø—2¬2Ve<A€‡å.Ó(ÕœG%´ÜQ|ð$U|&y•)$¾‰uþy½¸NÄÕáýÎXµÿÚŽV·Ã I&’*HÇïÔHv#É(àŒØì“ü¤îö†I~•%Vh*lȃbxñ!wNTJQ…!•5ýÇggýóƒO_„!¦†a¹yɈa7£ÛYGƒyO<¡êüø#ݱôµYûô^*]õýÉ};xC—Ì“³«ÎNFzt4%˜úL)˜ ñ‹_AìÒ‹OZìrBñEÅIäsp¥Htc¥+E>B®ÒêÍ|ý‚ÿ:Õà‘"ç¼PÜ&ȽÖ䟄£w±?êåšGGÈOHÖÖO•;~‹-1õó– WÌt2ÈšògŒ’³Ö~vÉbPœ\+V¡ÝËU°|–Ïd†¯pÖûCUnª{éáö¥¢Î*¶H¢XÒ#ß¹M’ò3hY_îÁ Z—¨ÿ¶¡*ÇÇû÷‰d¹w§Öû÷JÖxnŒ÷ì—RË‚Ž‘ìöì™"Ûg±iùM†ØÏõÿPKŒ=hc‚½²6 bfinit.cpp…›K«v×q„Ç9¿bcOr#¬ûE&Ë!ƒ("F£L";X`$a)˜üßóTWo9³`¾Wç¼{¯Õ—êêê>?ýú›¯~ÿ_¿ùíó“ï¾úÝßýî'?ýñ?üÇï¿ýã~ý}ü×ÏþOŸýê‹Ÿÿâ³_úÙ?üãçù‹?ü÷w?|ûÅõññÕ·ß|ÿÃóÇoÿð›ÞžOóKŸ|òé¿ÿÛO>ùî×_óõÿúçÿü/ÿüåç¿üÕß´{þþã>žg•Sû«½Ž­ëK‡Å1«( ŠÞ–Be•øðlb{ÛxåÂ!ý¬½GýŒð&^?gÄÁe/.ÄåãM›·–¦ß«XeÔKéÃi­Ý½{¼örWŽtV¼‰HV¨ÌðFåEœ½éµÄÖØcÝ°?¯o}Ÿ±Âzý,.xoD|;Sçã.ñ{üdÏ~}‚·Jq‰ÞÞK\·Î3NëX™CFx´C”7läœ)¡ÚŸ´ºDD<ž&"FHƧ)3¾ôl¬~w¸fp¼¶k„SgÝ%"b•Ë½§>|È,SÔÎ=œV¿wâµS9<[øiB®]™ˆ7Ý{É›»#N!ú¾ ?á×JH9” ø²ÊÚŽ½A¸Ù>ˆ}B»GìÕ†Û¸ØëM"ñ”áã ®;¯‡_’£s­ˆ©u;Î<3.x¿ÃÃOϼ«Þuol¢KaVžB œ©Q;ÇÁ ¶f%’Âïm/î„ë#ŒxãÞËÎUš¼è(æZ‹”q'Ršcà‘øR“½¶“뜦Œ6 Æ%ú£}µÛï ©ØžÀlŽ¼ˆ ÷k|é¬Z±ø9F[’c;rÀˆ¡ƒ7'!÷9@ÐrÕu9j|ºúN‰ÐñÆìÜ#3w*ú«#¢¯1äŸ#¼vùY$a«ežÁóü¸ (Ü £¾a]yº1÷­[ËVP:¹€¬9I†Ç#0˜P?žGV“£ ®×('„.çŠ×±×•…#‚¥ûâ7Vh<—S£¨~Ì°Á³ÛOd®B CßMrœjû‡çšX‚#\k?…KÅH3€oÛõÙW±xkJÀÅÉË8î„kÈ|Á9l 8™ÝÎÝŠÿ3¯k(ÇŒ˜ˆ¤ñ0ù,·îˆ\7 !IÝ£î° ’pî%Šteß xô®°•û° ÉÚ÷¨×Çk@ÚÈúÔ0ê&â÷€‡ok$a¼²¬nå{¿w¢•¡øçñ/‡<ˆC’W›h“A#òD†î1“l¡gm*”ô’žÞãŠÄ—@Ü3#ÂôžÒJ `Ç3ÀŽ5ò Ë*_uDV@¸8^'ÞF‰7Y³ÙÔƒ±– °òÜë’´pZ5|hÙÕãx$.el^[OEµÎÕÍö$•ÂRϳ1r$MW]¸áéˆQ—a‰@ÑBE‰‡Ã!„ëÕ•°QÝÏ].Ô24`ä Ya#Ÿ\Øs¡%RqœüƒÄAÌ#(|dŽ«öT=Q|Ä‚7¸šÒýpÛê€6*+?Ê’T(6øµÜ»ÚH,¯°ËéÎCTלÆ<š{ÅO`Dì<6ù¬Šƒþ¤€½¥ c>¿7Ä\„ã2¯Ñh\œ]ìB€"a‰l é0JPs€—Œ9M« p˜…³.nLÁ4žñ2Ô€'0Œ!ŒX„ИtMd·85(óóÆñTÜÀ˜v³ÔpÕzJ’(n×r'Ââê³râÕ_»ôìaþX`Ê`‹8ç¸ÔËbñÚQŒrõÁ5—à.¦I…òišöö@ÍÕ„˜ÌÂi+Á2è_,~¦̈©('¶{ÉãAð „4~¯øpˆ©Œ ,Á,£èŠÖÅ—îÄÌsØOjHê(~]&HD©Áíµ‰xéKÏ!dÝp\ð±ÇÅÕsà›f"ð¶8ãK•iT¶;òYU±Ì‘üF`~M–QR‰ë$°mŠ¸~QrøžÙ~-¸±Ì°þPm“ˆÆÍEQVùnmÂ%ˆšeO€k‹Ú6n: ä€ZŽ´&ÃÃÄcr nî‰ÊÝ a Ê'IPD•æ"+¸(”Z |Ò}@ Ðãh5O¥³ªæ¬"èw¸·€.mT°$%WXú Rxƒ}z¤F<)a“*ŒZwç5À€1ì/²WøJut¯°žÎÐ0f˜œƒ?}ð­¶– ÿ:g¨{âCDªÑjèNN0®8ê­@!°8™ª!×E‘ß„¸¶ÌÛ¡û]·Šð{ µDPBð(j«/S(I¥˜øM‹ÃÒ®˜z µ%ÍG¾¨ûÍ7ÑK©3ŠØ'¿=zWU§¥¦tE‚0¢ÚÔÄ,«ÛïbUœ.‰Wæÿª@WTͼæ‚æñOÈLòÆÅS-¼õ³8 ®‰‡¬W•º:bIFÏ€m÷ ÉYgSÃåt( ài4ã¬b„{%_QC¾Måq;õŽgšÄ¥Ôíl‘à˜c˜ÿØÅÔ£Á‰û’ L:nHËÊ°¬Â½’í ¢¶ÓíŠö–Ìã£&Є˜ðÃÓµ¼íå ®f¸OxĶg U0 M Us±41\h9‡†j†Ò ’ŸL%ú†YÄ°Á#m€2÷8ˆ&aù6¯Wáuš,ˆîE¶ª¡àúîÓ®ê2¨×Ü‘“âçäñT{·Ð=îÄ®Šn ðÅ»Gp%2÷&\ Â4ø¥ŠsðZ7m°.äQ¨- ï´§8â96˜Z¸ìQì¾Cˆ¹nA†š°ÎÇãh2LT1Z"Ûm+«‘ÚªA^yQ­‰Vµà³ê¿ ÑgUלòOÓ¨–é\bæ·Í©A…X€¾Ppî•„­eVŽù*ÃüS  _NŠ×2zÅxíZ/_ù±ÅÊÜ©%!ÛŠPBÝ:©%Øų ˆïòÔ ·tš¤È®“ºE|m;·’™t3ü]Ý¿)®uĺŠyÜ„?‚°áþ¼«žˆÉ_‡‡*À[ ¯ô£í²!œWƒ¬„Ê{¥Ú0€^ f¶ýL²n\ÜF¤ÒÌØÁ_·C^ý‘2ÃO4Å؈<4‘$²{Ì©vül„š3AccÄÔ[J²©üAuçC¾¯¬…ñY«T¬–½§t?(mÒ3zd1þø=¾¶WK”X˜¼‹z"CìÀ§!NžYeå¢4¾4ÄÁ(øÙ°>+ûsn0»Íê¥ZB€Ð&Rk‡£[¶‘êqVÊl@wW`¯´©D¬¨‡ãUÛä¦ÞÝ-1ü XVÚêRÍ8/=ï¤.çßì‘Tþî+³u¨ŸËÝ„ á¨v Š ÄTŒ¯±q9ào"Éý¹2Êe:à‘â xÔBXÀÌ]umÊ›t (Žš÷:aʪá–Èç!Í~ê@8x\t'ÊS©î Ë®! „ñŹQˆ¡é$„A6ª¡{YŠ¥’#˜Ÿ,±£™¦TßVü%òY4eº-¥# BÇzŽºúcû‹pJôN4Šî^}8ˆ5H«)¥ èͦ‚4ÌP‡nQKt ïF W{/^ÝkpAɨñÚ® A0+W§Om9î=§j!Oèj­×0õ¦Ç:¸Ó5—Z,œZ6~"Ò©V廫Á&Œ47T#2>”uÃÑʺbˆXR‚Q%ÿÞÄrºÈ)>hY^)s¶Q:ë›î¬2PR¢¸JŠ;INâÀǺS!UñU1á†ñÜfëÁ’ˆëLàÝ}7$‘HÝB€2[úNø¬L=!ľ&‰Û…4À$´«Ý„ªÃÜm¸%A`ä0QÂxrQ«r3ý°Õ=®¦ëýÈ÷Ä(ÜÏ)ø 1ÓÑ.‚X)Û¸'‹ÿ'5XVáèø²ÓÑ®ý¥n„‹K\VC‘ÃíUvݧÝ)Zá&œ®ŒŒYFìPéAwäjÂûžÓˆ{H(r©Iö‰ß“DÈMÏRh—2ç•%goÓœ" ƒÊNê¦âÐJÊbje[Dy—bÍ7o ߇΃h±¨Ò5á¸&ý k1˜í|’0yí'p I°ªŽŸ)»ºbÂSM¦9牑ÌJ-GJnö¨|¯RÑ@NJE(ËigG»òá6„SX$“ô¢QIœˆÝ5ý <#h5²jÐí?· œí0×ÜTiŸ‰zBhPš·% ,‹]zpgåÆ)7Û+â2GzÍŒ Kv±çÐC›†LϘㅶ±\‡J$îNýì†.µFÿõpZל;ænª%%Ýa>£õV)5 Ñ År-d¤A»Mzp ~OÊ2Åâ¦{ïêÁ2ÇÆH[s·p@×`ì 6\t•®ó¥,Ò¸LUeKÅÊ^®‹T$Nj 6 òO³™G ŠHš£@ÂÌŽÞdW:<7Þ+MÓ} !B xØ@eÙÖ­CÍW—èþî¡æâH[j²Ç›Dä--÷IØ-V$¨ÛD[O&MÃC·n•RR÷Vù‹ƒc<ö ¹œŠ6\6H‡ ¾Ñõv‘€/*09M)~ÙG¡¤[2£a•8o"ñ†Æ†N(‘YeTP¦ü;Sû˜âÈ9*S#³ŽÇEÏoÙ‡?QÍW‹ˆÕ8Ró`÷8K%.•:ÉÒвwfEûÚU)­Gk¬73uw„ï:;µÖ#(ëI2€¸ÅLSÒŒd§â4ÌpŒ”Á«JŒ¼z´F`Û'š(4Kaøóc²œÌJdŸY ¨%$Zö¬"½Ôœý¦'jxñ€¹jÖLÙuîË1œ#ÇëJDXYD rf"º&3XÑ+;f&9»¸àòJîFÚ¥±Œ§šÏ*žÛS@]>Å:WhgXx4 h÷¾“ Z½W2.jCoT>]ÕÌ(öB# oΙI ª:Ì>Ô‘¯áÔÀybææì„Ž?ù-˜þìX.çz#ë§&N"A¿c¦AzŠ¹4Àø.ëd#é#þ&j©T TÝ‹¶SƒØ”‡Æ±wÇžÑö"HÎj_I£EŒéYýU“új •j‹…Còˆ5èÄJ¦4 Ò©%,*˜žv*P¶ÚmP¹¸Ðn÷Vêf³Aäi~]ÞéÉéî(‹BHc̨Æ0ç;5&2‡C$ÔÄüJŸjrKtã©-À´¦xw’ 6¹†ºÍÙ¡·a5wR!S™i1¹4|õÂq.0þX! “_õÚwäÔeÈe-ú‹ +c´O›MIlè‘é\E$o»¡|RCý%®.ß[ ¤Ë©Êõ(V¯ZlWw½%fÔ˃.ɦcM«ùµjøJ£©”&|jÒ£Ùzio¡V‰ì9³ Aª.ËÁ”[qZ×殫×N—èý¦þHk¤Û­´‘w1÷rkqb¿9M¬Q¬cO‰dÍã¬!&N9‹fÓz¡¶%x•TÌu:7ÄÒô&°è=‘K]ÔT)% <¡öÊÔ²kwë-*ðôµ9q-ŠPrɶæãI âZö;y*5Íg…åírdzR2êNò~H¬¾©éñÈ,Ÿà m¼Iƒ­«šžÇ“ÖQ=AoBßÐR•¥ÇÊÁ#©UÃÓô“fÐ}{5„úéW9'@_Dì¼Ö¤ùÜé¦n½jzU¼ÂÃýà+Åé.ó5I^–É08™ý‡‘NìaìÌŸf°µ•DG±-†7;ugòU qìIþu`K³!ûÜc^!SóÂŒúJ²|XÁ#VûcÔ’´õnú¨8)%J ZÓðT pÎͺ8kZ­“kc«¬\¤[ÒÚl=uLoß ,æc.iç°Ñm–¨©=´ÎK"”Ó7ÌËÖska‰°Ï™ƒmåít9†pª¶L]µŠ<°ùNäR­íÍ®«ód÷®I-|ÊMšïÇî–„b~ïºóÐŒ¼Íéì’Hs¶[+‰@š¹kÆë2´´Læyú’j¶SÜÁMT†íEÚ ñ’kk &W®ÞlŠ1œt%Èè“4«ÊF·Lj€W‘øXj.‰ÅÖBËÚÐ$íK9ͦÐÕÝν"¾³¿Ù 1Þ"œVãðTíï^X9Ôfsö-1Œë»l”]ò ít§.îÞ¦§j‚D]7$4šD‚ãIé”në9¥j 0÷Xnh¥ɵ×!åS;¡G›—©²h“®{áNz¼ÆþÙ‚EkT­ÍkUˆ—ùx¡ªCTnNI¥í“’FÁû{øF‚«Ã(úZø¸‡ˆE—u ‰wh-×B½|HLÎY©Šœ-Sèj‘ºyú©ýjRh‚ X!²ê+HˆÙŸMýyõf“„ í7Ô› ìèöY4ô¿^›R£%yÝe#µÌ'Ðk¨ùÎõ® š Ô”k©®zà,MC’WIö§î•Z$ujÉJeK[ 4|.õɹK ¦1¢©±uÕHYÃP³©«ÂRSŒ˜ä57P’h›´$qݽ9Üj¬IÝXÁ3;æo¹!­ÅÝQïHÅüh0ä…¼¢’\r߈ÖsEc¤(‡7”cúýh%üÉe>87ÍÂÉ‘iT†t.Uòªé´ZMEvA‘ªô7–sg=ûæšÍ”’ Ûô5j,?{­W«{Ô2Kºy×"—ßD§EKçRÃ}HǤÁa8‚KˆvvFÏãmõ.j­ ©kÞd‡p«å1zH»}›Â®=òÆ+5ôÔP«Õ _v«[©˜«ñ‰q ÓU=^ùp~)[0è“ èʶ¦i{ìÆ"çÒlÕ¤(˜â-‡ã[RÂñö£šLh”ÁW2Œ¦9©Žn«wß(P îëuÅX{tYAÓʼ&óÙlóÏcXÖ> ÚJŒ¨ZŒ±^Õ(…Í Cñr²!Ú¯£{­?Q *zRØ%€‘');þìÞ¡ßä™–UDkÙãhẼLH n¦$Ý´èݬ jT¨!¤¥'ꢶŽ½)»ô— =X$ª¢5Wo‡hk¶ˆÙ›¾(ܧ'Pr@`¬SC›s¥¯TEô"íd‡‚'T¼Ü¡K'³Ûeò­ý&ëıñ¨†;ù†4dóç„qÌa‹fúݵˤ²}“·‚¯b‘c§–ÉÏkÜ£ 5IF™"­Éi×ÜV.£\}Mw[#MT|Á)IÚ‚„N¤ñH®âšÍEãü*çÙž¡ ýÙËËϤô—f–j†´›”ó#UÓ$Ù¤”àZ]B†Šñtû)©IôàÇ­?¶®.McdmŠä0‰V¡÷ï´ßî;6Ù±bë--‰]¯×6I£à¦™¥öôž“«fä¾ÿìA~Åöþž&’G‹Y9çFTPK(¯Z÷j±Êåž. Gf†e ¯5t3鄶qu·5]¢a½ðJšiñ‹F®Õo¢°,¶«¢òhGÚëÒZSm³ì—øj"U2öô-ÝW£!æöRÚ¦4äw\_›ÄÇ™$…¬ª .~[›ò571:u®U Åì…¨²Cñkâ«ë^¸¨rŠ¨WòU'«Æ ­Ï2´,uR"ìZ‘9ïß6p8/®W*·sQSÝÓ iÜ$ ]«N™¹ZíÎ;¥ãG9†\WR ×*DÝ8 õñ§Ÿýß¿=ûìó_~ü/PKŒ=ò„²¢U¾ blowfish.cppíVÛnÓ@}Ž¿b(­k—$nA(¤¦ U„ˆ¶\¹•ko’m’õÊ»iJÿÙ]Çvixç§xgΟ™9k¥^‡ëyº39} {°Ê˜R”CÄó(¦ 0jJA,¯ç,†$]D¹^Ã7Êà8bŽóœñx¾L(ìˆxújºS ì¢ &cq‡ŸúgÃãþU¯r: GÙZ¨t8tç6e ôòòV«IÚj]ðxJãMΨú@×$N¹T¨EQØÑõ•Tã–\² 7Ú`bNùDM}°øA´ _£ù’#–Ixé:÷NíPJš) ³™?šR”ºmÇ©•¬>Üt>ÌÚNm•fÉ~I¤")pd£ „.Ü# ñ ët‹5×éâŠq¦|ì'MÇÄ]äßÀ¤ÉÇ0YÀœZ½ßÓL·¶_Ýe ”Çzz,å&uKc•fNmŒPº hë|ù|18>ó_ÃR¢qá‹hFM©¹¬ZçöKSíÊ^€Ü³Œ£SýÍ)]*<ºöŽè‘Ççt¬pïn„¥ß36™æáfhF_eÞµ'ÙÕªÚ&EW˜°S3Üha¸óí”׬ê‚r„Ú³öõXI‘£“þyïÇyŸh:ß Á9ÂÝzš\êôî@¦tÿi®Q)XÌ<ÛvÑÂ#!FÞV%6SHyªÄþ"Å&eµ•„ùÍ*Æ" ;•z· ýQ2€¶ 4u@Ë7nÛja–ÆTÊCžà§Wqýä2nb›ïª ÞåH??ã«Ì¹â,µ4¡c0ñª¸TëzlÒç ‹ø;‹ÐTÌè]˜l«… $—âšm¹vPî_þã¾ÌˆË'¥m Ãä[´+5&-ÿ/ôÇÎoPKÛ{TBMh[¼s× blowfish.h}Tko›0ý~…—HS“± em5% )ºFë*m·©«cL° 6²MÓ¬êŸ1…½¾qï=÷Ü×Á=ÓÇ`~ùÝ¿Zù~8»X}=[çá¹ÑSBñ_c†5€1I1X†Ñ#¥E„AW`twä{è[§ Ý—^Û~q:wÙûiéÍù.—Ì÷ûŠÓzBCH^ f)ÛÆD$á’Æ ŒA^¬S‚ÀyÄѬd ÈOlpÌ:r9ëÆ» L72±ßšàØ'§{N¿d„ ;Æ“ÑJAŒ P9Ú5M7Œ™dÌðQ¶¬ív;ÜbA2D,³‚ômF8gÜBb˜È,í54Nýe[Ð1P …hÆßO~°³åE÷s’'˜/*2LËÞ-'«˜šóy«ðæj:»pÁ |@\S,³<µ 9FG1UȱÑé<0Ÿ3„…˜Òèã:ý¨Zßz'• Õ>´/HóÅf…Ôv¿BMjîkŠ’RCQ€¥:å±RV¨äAèÆdCq•@R}óºfy²˜؇„ ð:‡f¢¯ŽÕÉ9y€7àR€áº5Å–ñèýHߎîÌÚRý*³éVe畇„y{¹ºöÁ›ÑÝä8QᎣ“Ó;ͦ•Yj:ÀH/Æ® &¨É¯Ùãä¿XMèQKq6§“»—¿zëÜg„ÂÔv=-‘åÊ3µ2àR½%£Éòîïy ¼Ï+k·Rµ¢Æã=sãlû3aOÙ8ÛUZωë-ÔC„iDbãPK‘=w/o AX blumshub.cpp”YÚ0ÇŸñ§mÕÊpõiÅñ°BH-E¢jߊr `m°ãt¡ÇwïÄŽ]–íCœÌä?ãŸGù§^‡0ÉÖé* k‘ÖP…'#¬E ŒA'A„1 v… ³0ÄjP&ÜÁw0cï„Œ’,F¸ÓѪ¶º;K»S–M>gÓ‡þpÞŽÆÞ7;mÕtê16uÍ{¤Î¯U´Z/s-d‘=ð%(—vuN¸Ïœ÷óXNÑÿ…¾ܲŒ~a™Íë&ºâ@]&½8ki®=6|³·+n¡ss½äœ!>òäI™Ü.1nÝ„ ÁO4ù/³ñ×ñ·¡Ñ·# Ü…ûöIŽ4º`Ž[=ç„0€$=Ô w@š>pMV/ó ­y›g6nµ’ š.ß6|ÀëV§ÿ¤€÷Æ?ýÛ†“ûPK=Ÿ †S blumshub.h”Mo"1 †ÏäWx[iE+´ìç¥=A˶h ;*íaO(3ãˆL28I)­úß× ô‹î"Á0öëرŸd_&ÇN.ÿ$W¿“dܽ¸ŒÎ¯»ãs±ÏeðMŸØW&Ó!GØ+m.Iùé§éžÃΠ7J:'½q·wÖ6OhYy›$BdZ:]Ê3«ó¿ %!Õ*û…Ëã·Ý¤n¤Çèíö‡è®¿£iHaÁImðPÈÌ[RwÒ+kÀà§\UÐÁ­—]åy}U4Â¥4¹-‡¡L‘ÎÐ I^­%ñ°‘<¡,¯HWX*c2q/VÞ#Ñx¢™Yã<ôÇ |4-xaqˆùo­ŒSƒ9(ãa]v•o²·‘.=nü­7Vå[«¶Ù¬…‡Ü’*ø8u‡cú„l†ÎJ/·jÞ™2“Mq+³2ëzf⧱ØÔZ }7B]ôÍ ’g]ó`~OèððøáQüÓÒBRþ¼}»‚DEÖcæ1ç¾êAJêÔˆ•èyfÒqð¤~T‡sÑxôêéó]ì7YÃNVº§HñqÖÔqþŠo¯ÛšÊ§È<ÏÄÅÌ_o?¯Æ¸½¯zÃS¾ÕxüªPK=p³0ðMÁQ camellia.cppÝ\Ysו~&E'©8€IÝ•¦é)J¢2+²ÊR&“rl4LXàRhyß>ç[¸ÊR&ó4¸%³Ñ¸ËÙ·{’GŠÉø¤Y,æ㇓óóâAqôcñyóýü´xu¾œŸ~»h:E]–ÝíGŠ×ÇóU19›6Eü=n–MÌ=_Œ'Í´ˆùëã¦8¿8ZÌ'ÅôìdW¦,0åSŽoNùi¹·.žÍh¦­UõÕŸ^?þûëƒÖOËNÑmÝ)ªvñË•[­˜¾¼szíéŸ|RÔ½Í*®‰™—§<ùòï/_ñòåa,>ÄêÃýW‡›]ªv§jMª7É ®Ujƨ½{›ÅÞõ© "q¢+ˆÜ÷â"†á=È/0}³ftmɇ¢¾VÜgwƒMñÍ^0øÏ’mÁRü^\î º\#ˆ÷ÀšhÈqÔ­‰Ëcv}·@þÎY?-îi¹¸±Á­S0ëW*ÑéÙ2´Äºô X…†gëó‹ub|tö}S]@¥ 'a@¾m–R©uj*Þ„]j¦õyŸæ\*Äúø¦B\ùmqSŸ.›ÆO¯^~U~½áüzÑ(~ƒ×Õµ×Ý|]_{]çëîµ×äúåA·:¾Ü±ºöº¾ë cêЭƒŽ-š‚Y»·y;ݽÅÓ;^] Ó¹lM6<ý⯟¼ËŽ•ñ¯Šuü붱áoMloŽÕ¬ü5g{XûY_|öêðùg¯_Çñ/ž~¶ÿbÔÁ³ÏZóvѪÄŸööšÅª¹õã?œNç³ííïÏæÓâ‰ÇÇ?¯š?þëé丙¼i¦¯šõçÍ­ÉŒùÑ릸÷¦ù±S\œ®æßžÒ뮋x³hN;…f½ˆ½þs¼¸h^ŽÃéµ·ÞÞ:9´çÝ+Zš^|ºGKõoE¯ø¸èîno]ßs…91{TÜ+6«ï‡ÁÚÅn±ÇÃÍÛ§ÝãK Ô½7«øï^¡9ÓñzܯØód/H=Þ+ñuV´~÷ÙêÙÙòíx9}½Ÿ®fÐT8¯Vmkë$öxüÇ_žò ÚÝÞœòf®-Àß8³nÖg“7ŸhR§x<ÿö ¨<>ý´øÖ¿{Àsù}Q¶ã?þSã?Ý+ȼ)÷tRµ§Ãê=×Ýã‘Æ>ÙþäpÿéÓ/ëÖQp°SÌ;Åwí­VK9noÝùù‡ÄŽSŠBC?ù$¤²µüdÐkǾï;[ó¨@A AkùG¾ùoŧŸ­`Ã|ßÞ}牟~à‰Ÿ^ž¸¸uâòö‰¶6[á÷^½:¨‹ï›åÊáq·ücú²xñY„Ä‹â ‚Ûúañô¬Yþi­<@ §…àüx¼ ½CXŒÜ`ÝœŽO'!|ð–‹f¶f>Á³Bÿ4…WE0 -Vg'ÍYpç4¼f„áë‡Û[‡‡'U=šó ¥õîå›°ñhnÞ´A†ûãGõ?#Ì×8ýæmlxxrr¸jÖ‡Íù¼[·nx„Ý[’qÒd0À˜_Ìf‹&7‰Ÿÿò—ÃWÿþ×gÏž´b¿Ø¶‹HN ¼Í?·ú75I@rÃupíp5Bµ®ìªÅ+Ø àÐ~¢üüEÉ×ÍÉùîÖÖo*£øè#Ëùïöªâ—_Š0i\l2œ- 2QW‚ÀšA(¼Qkyå—`Ó ÷@¢}IÚÚ´~÷®×6½Ó0„eûg  nÝì³ðù¹Ño˜ÃÛ»)šÍ€°Ú‡ïí!rÞÞ Eüüyü½¥¡C[Wdªl_}ÑêEðÝGîrímbÙ»ã5xRv\y=èÃáíÙAÞ­×ulRU•Þðýøû>g»µu-໮ΡH?ì—;ƒÁðÙœºŸ<Ù)Gõíñ`¸0êô­÷dØ}\_,Ú›ò›<ú›<û›<ü›<ýÉààYwXûôƒÞ³Qýø@ßú½gÏúÝý¾¾=«žvϪ'<ý8vƒÚƒ;9´î–w2 |¬n¼î‰79SÞÍ°xÕKöþ*Ñþ—d.¡êÞ£» ªï”.`{SŒ¾Œ¿º-Á¡%X´–äáo„ˆÐ©û¡M­X‰ÿˆdו-æx·;† úoÑÕs…é"ÍûωâěˮEpOÛ…ð/-üK ?@‘ß¡ÇïŠÑÝ„\²ÿš^þhÇÿKÝ|‡*B»îo¨Ñr\nQýqâ½L¼—‰÷2ñ^~ÞUyЯ‡Ïö…ÛÓƒÁ¨~Z=5ÕËþ`4zRû[÷`ð¤zöôi“à/ºw”; qÅ üúŽ,øåòlÒ¬Vû§Óÿ:[*[»šÏOù.ó^½üÁ3;þQ)¿·5+ráË€¨Å$-²Ë¯æ÷z‘ÛÂ÷¨nß«óËëö×—I޳瑲ȃL ‚7ËE›îyq£$µ@ ÁÉ•b—K­˜÷ Ö·w¯•BZK¾_^ycÃ%7\jÃË<øz1#¨¹þñ¼A}‚H‡ â½¼Xß•sF¬àß?Ž¹-S´àÇ¿E;NÔCÑø2Ç¿á àjÙ¡¹Iø¦tyù;…gyù»D?$ÿZ¹:8viÇò¤¯.–ÍCä'·Šö7‹ô )ê “ñä¸yœ{5ÿ© €Å'W_ìkUùîµÂ*8 5ß+w‹ù'uîï]Ûá¢øh/Ò¹ëDj·VÕý9ÏxçÏu¿6í~A‘ å@>9~£FD«:(áò¡B½äÊ웥+Nªsv³…y¨Ê΃*+> Œ‹æŽ(³¾›Õ C0ø¡ÎžóÞ-º¹E7·èæ]oZßz9±—{9±‡‰»pX?÷èçýÜ£ïÃB°ï#¦V ó¯àÃ/ÿne£k½ºÖ»¡k½ºÖ£®¥Î‡eh]Ì©LµO3°»­Z:.ÝÒF«Gg?4«íí+Ö÷¦_U_…Ê|]ì¡YEÔW…èLÝA§îtº;j'HVïÄ¿QüÚ팆~`Û Dbú°×ô;Û[Ý`&—ÃNŽcóƒ‡ñSsñ²Û G“B%zqÀh'VVØiÿ†± Ä®q|, •(AÝéŪðS;ýNxáj'6‹ŸX:Ä/ýNSʪÛVngª˜×Ù SGªÎ(Î+Gpï82€ˆ“ú±Öõq t"*¨*€Ö PÂ×½0Ž±¨Šç*ðÞÞªë8%Î-cƒ€§ï˜*VÄÒ26Å/H_cvàSFÃ(f:B1sÛÆS¼Š3bqØtb9(Ð ùìaQ9€°A¾*¨P:U̬ØàSüàbÒNlxÊ~gTÏa HWáá+ò#3vâUàDß s¿VÚ WV±cÙbw@ÊÀ¨7ꀱ˜çvðs ®ŽHÞàD)Èç÷;!$UUYÏ{¨`v°®š<Î!Lqzh—÷ãTˆip†\­±²îBxâŒÄ $ß“*ˆ^9{qDP¬îGñ50 †VA)Éa%urÀðCœ„ñ5dRâ2WA;`@lÙ'­ ß13À’8„ øã§<+ã;P˜`oü§"‚£8 ’g€"A%§‚`AC" 2€£í_wS·í±nj÷«—_õ¾¶‚?Óe”? KŒ kÄ”£CÏõCÏÍ£fåG] ObèyRbxAà š†Oècè¹?ÄÐs·‘ Æú¡ô¶xæëFϽ à Bàcø膞GzÞébxA¯¡BÖbø„>†q«0¤)†Aj8Æ ÃÏDÔ ª)†ÁècŒCÏGS / 0üÃà Í0L½† 'FúÃøÌ0ÌrÎ º †é]bèy:Á0Of^@&zÁ¤aqè´1†Œ©Âði$¾7cxÁ´aò 1 ðâ)F.ØÁ0‡sÆg€‘8TžDF˜' Ÿ<ÅH>ø>aÊ!Æ1¼˜/˜a9~ÌDI²4ÅHÆS“RæIG~.1ò„ûV‡†Áã'©4Ã0r ƒw„ág*xŠFC?  ?0LŒ>‡ĦÌÑÃÒJ2™qF‚D…0ÒC ïÚãㆩ@Ôp3ŽfûŽ1̇ #O Žú’ÉÏüøy‚‘HÓl Ó˜¤œ`xHY¢•ò# =Ïj 3ŽŸd‘ùÀi?Ã0õÈv/˜t1üCÃ|c<¬´|= ã0âö0Ì“F2®Ä0܄äÜÁ0¹Åhë4?fÔA»–œË4 –Ð ŸPc‡!F’•ÖØGk“˜&Ä úiŒe…?>¡‡aP©r)K2¢=Âó‡ü¡6%”2Ÿ0Ä0¢ôY>æ;­‰ì]m\ɇ†Œ1¼ ÜáHÏ0<‰#ÝÃȆ¦­±IÜÅðÉ6’%Úu#7Æð®:X'ó“v©‹aRRóM€†Ÿ «Ðû)Eš&Ѩ1’Ó5†Á8Â0Ò# +å$qaVÂg&Ò|û=’¤õÒ'P¦‘01Ž0R4h¥ 7ݨt1 ‘HáÛÁ0Ò”cëuÔS‰a[. ù¶TR/ 7C2ŸFUÌ0T¾O»2ø¶>0æ1‰é^3öæÇ:@?eðèÀýžN.Å›ñ‘fh0hŒ ƒØ$+?Þ‰!¦ù ß"‘¡”åöÖ¯g¥ƒb[Uz=ËwëYÑ›ì_)£:ëY*¬g,^ „}£+=+-г¤Ö ]êùkƒÄ|éîmÃJMò3Ã=+åñ™}ý pÂøPõüL1Oè4 9¥g‘ÔÏDÔ î˜UƒA¥Ò³DÄ ³úª§‘¦)ñÉ”H/^QzrãCy1Häœ(ñ0½9ô,Íó3M©ÈÒ™Þ ¯ ƒ+ŸFN>Ð|ij•ñ!ñ -šȬøÚRƒÁ¼˜:A¢×°,Ñkz9g¹¢Žä Ôzÿ@F˜b4P‰Ñ¯(È5¢Œ‰Œ(£HãÆOò.Ô;ñc“Lf"Ó/PŒgq ”yÓ G.`Då]iÝL†Ÿ¤¹A¢Ÿð3ŸÉMO¦9ÔŠ.õ¬‚O£M} ‘ }´q ™üž!Aò a¤é—½+ ”ùCGᲫæ.‡ÅY˜ùÀ\(‘¦Žš$“OãÇïiÝiš sš4ö$f½^Ì#Z)Oâ0•˜p›qü¤hЙÞü˜ L%²=í=¼`¬`žÐÔ$¬Ô8F¿ÆÃâÍ´Í<¡3IcÌá] ‡0î68¼@¾Ø?P!Œ(=oDÎ%H4 ‰Qš™ÅÞ80òI²Ò›ÓÄÚ$¦ ñ¦[‰-°æÇ'0~3¨T¹”%ó q3‹°.%Òªi˜»ÌýLŸePi¾ÓjÈÞ•ÆÕ 1˜÷&I¹€‹4Ã4OâÇH3 LÿÀLדh}c(?Ólxu#Ç8È»òhË?ifånj¾‘f†îgš>ŽÖØ| ™ŒM¢7bΓœfeî2-0>Ìû-W”“Ä9³a%|f"Í·Oc@’T¢^QÊ´Å›H˜Ì/R4h¥¼ݨáf¦b"iùãiʱᦎZì wR‰¹—Á <ø4Zc/ ¾¦Æ1F0½é}w21Úä O¢í÷$bjSƒÒ.q˜ÔQË­ƒA¥3O£S0í©f¦Üø0ÇNNÓ§š2d»IÉYÞˆÆ+õ/`eÁ”¡l7ÆB)­Œ= 7ƒXƒAÁ²à'‘fôdäø1HŒH|­ZúÊ€e†ºè„Ïqd€Eóm08L%†dƪ˜æžÃ»rnÆʹÆ!o¯š’,†.”‚º\OMr±VQ$A²ÛSuW–.f7ùÖI~™GwiêÖI)¦2_¥jZ0Q`«ô¸Üè ýé1pûÄð‹œ)HQ±_ÁkEš÷ä}TåR#FJž¸Ó‘rR—OËLq›F—Isf ×½¨¢yRf*—«ëåª²Ï”Ψ‚¥8ƒÏ#ð¾F¤ÃÒ;òöœ4T¯;EG|íÆ#$K;rŽ¾#-Óᢙñn=è ɸ™*]R(!¢CEc*ʉJ•2F•®•ªé>N–›œ)ZµÂQ_ë0Š$H=e[êݔߓð9ÎÒ­“âWÕ-•ˆ«,¦N:ÝW¡Ê›ÒM]X”¯‡î¦ö`ƒà¿r]M)`Ñ¥˜êL23cù:ÕÈTðýP™q3n/YˆÑõy¹ñи‡È,KY½ #(Ê’M…®D”ÝÞÌ"p£Ã|^7gJÃx‘"3Õ[Uß § ¯}¹­Ð‡²T© FwÕðä©b?ù‡ž‚(*ÊLi¥ª¤òãºAPæk*ÕeTW"®Ò£’*ßÎÒlH–J TVõJ—.J=uƒ©º‡tzGõ$"ÚU½FÕP•»TWê)%ºPé‚’;S)OÕj•Ä\eWbD¸§Ê°t1¬ˆ ÔUê)î)Õ×å…ò"ݨšÂ÷SÕÊ’aÝ9¨(¨ûR%}j8PŠ)>ì(­ÔE¼JvºóUj£»S•–dî{Jéu B›êÇÊ/T®W]S ̓ë>EÉOkýë^y«¢™ž’>•ß•¡ëêPÝÙ)Ô‚¡ÊCœÔ(ŸÓ½ªWª¸«†æ¢¹2tÝU+oó-Z™9:CX5#Ò]¥0”¥®êjšPB«þUyŸ±êÂj¿P N*õU"V³‡Z)POõîT©ð¡['åsºòTž'vTíÑ}œBguV(U#ÒcåîÝP•; «CAå;߷Ӫɶ)…Ñ‚2`ŠC_5R©§2ª4*FéÖ[Åfòd¤Š/O«•$J\å‚žREöjXQyLviªü‡“zJ¤^¥ß;§ò© æºQ"¥~ UØuÑ­B­o;TÇÐå…òŠ‰+jÀQÊ|%‹:(Î.&økÙY’lV‚vn”6%!²ç™cÅ„Ù{„8pÓoÁË#Äx¦/Û›­DÐíMû,t¶ f !²3¹éB¼—@ˆ„IŸ‰D'}Eoš{ƒgCOš-ÝÞôí”@ jf$XZ!½È6(Ò¦õÙV¶Û@Ÿ¥!Ò‘ìªùÜtÒ ¸ÊîdUrbrcÙ$SfÔ¤¶ j…Q|<³÷Ížx«MŸ Ì{ö¶À‘K¤ Ù‚ŒqӶǗ­*ˆ¡ˆt%/»éH)]þRŠ4A}'Š•Õj¢JÚKf©¥D~_m$J5Ô9ât¤VNºé™Ì¾h>wåe³ýz±iù@xmˆe•ó*=Íně؞ìÚ@(+E•ªfsb‘MC´l€%‘6KŸ³×þpÓ_QnjÆ—qŒš(”F©qÂ…5KȨAÂCµ&ìd',̦ûQqv<ÀÆÊsËwgcC™I²Zì¨}A ³:v¦Ù§€HaÓ›s˜ýHmâ*ÈͶ¸€M«‚«l/@į AaCv :ØtÀ–f·²u…\ º²)~|Ó€ %/ÿîP7fʆóŽÑòæ^éÙæ.¿T±B—÷Šñuaï H—ôJ‘t1¯ˆî╧èþ}4Ýܺ£‚’7íˆÒäVäXòB~s‰Žì6/Î^S™&rüy?w°¹/mÜu ®8Fßrºìîu7WÜp‚y­ ]~Už5o¯u‹qµÒÇìlEŸÍ¬¨šd+òS-è«ÊªF6½©¥ò.u£öîΔõfß) SÙjŠ[åŒ8ïãbAìúY‚Ù˸ ³›%™%âˆàˆ¾Ÿé¿ 15ÓH~°nøaD¾>{qü_/ΆÆb´!«Kß”ùRÆ6e¡”ÑlèÉÑóäfV-ßÌc$¡I)ÎãtIæ³ðlº™úe3›.6 Ll8“ù˜¼»‚¿ùˆü}°·$O ËròW7o\=‰ÃwWduæ£G­Â„¼zB†Ãçôò¢}Âåè’¼"Ï/XÛ¬Ûæã-æ3¶mѶCÛ~´6‚ž¯~͈‡[Fìï0âÕ?3B|ž͈ý-#^í0âá–++Îûx4còv´Ï·Í%þß{¹N…s^jóûµE©-vj–¯#ô Ç“™÷u\Mó›åã6µ“ãæõÙ44nú‡¬Æÿ ›õ¾ååEsÐ’‹‡ÍÊõ"õ˦ΥÎ`¯ðE6¥Ùœ ›'ôi?a.ûp öÚ »Çå›6‹nÚ ðØu}C3~ .ÍgWäûó™”dø¾,fW‘,¢›û7¸GܼŽ6ö©Àü#,øທí¥ÝPÈË‹Cúá´Û©Ü<ïš:7Oº¦ÉͳRjÛ}@ËÌ23_1ÿRºfn›|Ý·m²5sÛå@G=3ÏÌ¢`6%³.™UÉ,GÅóV=³È̬`>*™«’ù¸d¶¥ëŽ3s»)AO¯Hí½¤¦$գ ¾&e閥ǟ僵ÃzR^ž”z§%©(I·Z­IEAzV’žß›´lždÒ—9wÜÊ0U2›’Yîv¬^ ”™Yf.g-CË˼ge²ÞõKfæ™™̦dÖ%³*™e™ ¬g™YÌG%sU2—Ì[9)ÖÁ“«àm>ÛnGl•‡ÓrªÙ5©*HYIJKÒ³’ô¼T>]“ê‚ô~ÇÚ’tË9o RU’ʲÛQIºåbÓWš×ÝUݵEá÷:â¤$=-§ÚF5« RV’Ò’ô¬$=/•O6Šy¹DÜïY[²nygs‰(׈­ú(Ë~G%ëñrùïÊû¯­¼ŒµÇÞËjJV]ζMVQ°Ý™<ŸáUT4d-—‰“;Ez«¼n²òÕ YËuâìÞ¹• ôÎZ„/„«ý6î´ Þî·÷GyÀKò¼ë|` _w`ïýâM$i6™ÌÞ7Ó×øêó+Mš«ëI¼ŠÓ¥k¿F’÷®Ý˜O—ó¦¾YÂîöÙå7àA~ÑéÞHZ`éß –?]]ØË ./Ÿ||Ú§;ËMUÁ›(ý˜bA;ÖÞKË™ñ:&ZÑq¡êC¸ó6Iç*:ãQR9© ؃Ñ4 ˆ[ã}#â)VžÕq£tml꘢.¨„-¨‚bP…ª¢qE!î±Ò1ÄE”ÆÞ1ÕŠ*9Jxµf{8^«: ÄYe«%âU¸§†‹ »ªÖS¾R^+áÐ;”מKŽÞÑ©fà#xpBÜÉ ìUˆ³ZWBkž­ª¸°ÐD 8Ö$ ½‚‘Á ž´Óbƒ>FScR*-«ŽIÕLzV¹½(YtzNzCQb¬‘\2ì“–1ÄaJò¹ÌÑ‹\ÔÜçèÕ01…ì=Å ¸pËŽâk˜³\¡w„µ‘sÄSV$x‚Ä©¼@òL§Jªl<µ†)„¥*U …=<ÀŒ*Ä¥Rxí DN#.(ÔTc:&gÀ$iP¢a‘YìQ)ÉD´ˆSÏhUW*G/¤d«£ç’R®c2ÔÄš;”D##M5öPòÚ×!GÂUy•£åG{Ä=·µ…JÕ{ÊJÃ×G©+Ð讹ãL2×”2kâAeÔÙ* ”,¢ÄKp!ä$z¡1Á2€Þá4ªŠ"Îm€‰A¯’ Pl;&¦ $C‰ Žc ‡Çæ1G/:˜J:G¯®¢ˆkk+HœŽ)$eA„¥¡8ÔJçè%£¬Š9z^¬sô*È08˜£t2º÷TD%" õÝ w˜€ ÓˆCqñ`=â># â0•\ Öt댇T%:•uöpŽÙh*ÄÁQVJ‡xejã˜C`˜¼uÇd•Òª®Q’ê÷^Åg×;;°ùj£j·- ºSƒ/ÕlC·÷IæŠ6m¾X3³·Û¬vs¥òÙÈkfvOa8 ÚæËkv¶Ã ífÐäóŸ/ÖÌìxŒ’v]“/Ñê¬ný3ƃ#íK´2/žNÁpmYæÝaÕ—hÞâ¬è+þÒVü•ðÌÞ•ÇùF\Žíƒf_ŽÊüKsÞ©°^…gµV íUXVÑk•~ ѫЬbPeòc7ß6nwŸÏù3ì¿ß «©@ñøÝ‚Ä©ogsÛ—öºñóâæ‘4Þï&$Â:ÕÊáͳ=®‡×ÀØÞ¹å m¾‹Øá¦ý™Ðƒƒƒ¶"õ¿~œŸÉvõöÞ­œ8Zùj´ ž¼Á‹ó³8‡§½"º}è÷í›ð߸Ð öþ2lÏèàÂò…ç‹È™/ê.Ù<þ狸EÖ& „âYÝÙÕ]µºct}Ëp€_9 ýìç¾Åìxa­¹&ný± =þþgAýî*¾vC< ÷ŸÞ¹ëkëÑh3<­¡‰ ³L_Žó¹·_èeûó—vûöïtU¯«³.[鲕®ète¯«²._éò•noƒèueÖ+]qÇÞ늬+WºòŽ ¬×åYW­tÕh¯Ë²®^éê;6˜^—f]³Ò5îíîýpo%į_£®P»Ï°Û/_9×òa3ãÈþ~Ó4çTäšì'üIÅ Ûg(~+ƒ¢xù¤÷(ù ÛG=¾Ïz ß–ð^"·%¢—èm‰ì%ær ªT îA±šdý@üÙÉ7‹ó\˜^ÌÝtÑ–ü–7uîè}õ¶õÕÛǺuÕÛö3a+Üö¤ìÙ‰÷PÆžØo÷Û#þá€@ÙyøvÔˆ;LƒaÃ7|Ôa‹e8<\¼w×Ão/ÈmøµæÙ!ï ®ÂíÿÚ½ŠW (á]^À`Ñüg)£œòë_ŽB2 þPK=c°Ùé cast.hÅVkoÚ0ýL~… Ò(%‚®‰W7ÔÐèªM]…Œs!V;rœQVõ¿Ï„úÒ:­û@”®Ï}ž›èœ90GÝ/ßÇ£ñxÚmO.¦ŸŒ‚)ƒ¸a•ËèÇœz`”-Ã(PF¼È”ÜÀªâæ³ØÌãäF£Æ°ý¹?·»ýi§ÿq0,vÅ*|<.ñp"íÁ¸3Á% NÃÈ…KJá,”hÉ…sTC“«úõUíøäºiÜ7U<ÖÂÞ‚ *]Q6çF(EDdÌW­Õ§…¡ ¢™§¸Né-8Õ„þ‚VÝ6“.± xæÁ¬Î-¤Ûªž˜èØDÕ[Å• †¸X ò$†Ú‰û!ö¡XBwd$ÊëUùæý&V µ0rÌ?ä])ƒ†e-—Ëʨƒi…pß f‡>‚ ‹„Wú^aKc'w- Û;USHšànÚÛÜâ„»4pAô8‰|`:rÎt^ž¤ÑÃÑôò¢Ý9ï£!ËûßÀ¼Ö®SÛÈ)Öµ¡êaî'§úʈ«'Ä™€T.®«8[I@å(¡0E,¤ Žj£D^ÜsSo]ÚKìE0ÆT„è]€öÃ’*jnw`r3Î=$À‰8Mõ·[wz$ºµ#Õlt¦Ltcž®AŸ‘´º %7œ@¶™ó‹ØK&?Êb,Ie Þn,ÍÍ3dü\Z[½Xþk`[Gr€^ ;qJöZýaõ`44um}Ñ’WS×|æX¯ŸS9Úú²=ö²àÕbx^ðJÌ/(^ÿÔpü…äU©ä^-yMc'w{’WHVšIâo*ùÄéÛJþ_÷Þ:yì$§~ü zÝÜ·Èd#§bk—Æ¡|Xà¢6¢fB{ƒƒ«ñN{foÕËÕÍõg:Ôí}×çö•˜Ý,ÿF#%N°]WÌS¾Ûõ±Wƒö€^aOÑÇæ{ô ËЧß#ýaO}ÉsèÜø PK=7¥vC /¨r casts.cppU}[Ëu]vÔµï¯øHn¢™çCÄ‹y”€6 ­W!ˆv$Ò-¶„þïÖØ{U­×æ»èýîÃZkÎ1jTÃ|þüþãoÿ×ÿþ»¿ÿåÏþé·ÿðïþáÏ~ü¹þá·ÿý÷°ùñ«ñŸÏo~=ÖùoóüÇ¿þÕ¿^ÿüÿé¿ûõ¯ÿÍù—¿¬ñ›ÿòËoþíÿøÝÿþ÷?~üöwÿøû?üò~÷ÏÃç­¿ú«ßüMûÛ¿ ¹üí/ÿá—ùñ/?þ•ûctw&·ÓýOñ‹ûc¿ÃÝëæ÷U™g­î÷U¼!·U^Ùý ÿô¼Ù—siïø|ѹxrrßWëö»zêÏçÝiÜP¿o¶6çÜ3_àbrýùboÛõRóóÅrJijs«œt#w5Üß~¶#ݬ°s¾GùãØ@–quEXçç¨ ~UžH!¯šÝ³ª°¿ØOxÐÁ·êq„Ç$1<­ñ„9ý³sX¦3W|n5§ìªúbJ¹Ÿ1‰Ö14¸(qÍ·uù*÷Öåù¢Kç8rƒeÔv]wL×óó1ä{Ë¢É5[¼ŽÐK\YHZÖ̃¸Sïõ}Æ5|s{1°4W[à®®zG^—(;VôÙsUc>µÿYª{tO ¹p›îZ!ž|§‘GKÁ?·i«?3Š‚NÍ«Ä&Áj\ÃkÞÜò1ÔçúÝÃàæU˜›^Î}bûi+c¦µº uÄçÆí2Î ŸjšëÞg©ü̸O;;!Ì$nÇiî¨øpƈç±Ø)¢‡c˜mrù,ì‹gì›ód|Ìs÷Ó8чèg¯˜5ð‹=§ú¦³îyRÏ3¥ksKåÐQ&­Ä¿>ïGí¯wÆ„ÕâvÀ“¿Ï>›Ö„g?]? —üY'É‘±âôÛÄ®gWÓë1‡ub«§(èñ¦/‹ðXÁ´êóŒ0¨¸ûêôŽ}cWD>€*Àç ‘ÇrSI ¥~Íø•-•‡'±ÐVK—q`‘gÉÚÕnˆ‹s–;õ…ÇTS‚½2z¿àÏ«½CÂ5ž[­Ç#æMqç}J—{eáùÌÇ‘Îxæ#–§fqlN¨Œ0ãEJTº«™Ï8°q>îcn.ºÄ§ZÃ¥°.¡ËûÀúlNÛ@ ¸àqÂs¹s1ð°ÁŸ‰u‘ÉVtålmGøp)¼¹Ôn ³7Üî ÆIºRr3É+BWÊd¯;DaÞxË£‡&º2®¿sJ1µêÄ^+1"nüÝÇp€Ž´6hæ!™.©º=Ÿ÷nk¾ù´^Øe;ëé:ù1ùmXÕÉ^cEŸK| ƒV¥=…«*€JçàOx^µX=¼ZÌjw›}Vµƒ ¤\#Ûp¤àY˜ûÊ•˜Ó Ä4ÄcÈþ ¶^†Ñ1ÃìZ£õÉÅñ£tDïçv\XÐ)’¼ÜŠkt2’ŽX·Vµ«:™ÅXžM“ßíºëžÍÉš;q7?þô?¾"Òß`ôêñ¦9à¤'®[ŸÇŽ=BD4šÏ=ÅãÍÇ`ÏY98¾Ê¹5,æó£5ÜåJæ ˜Î¹z˜ãw ·óáBc@ÙˆX½¯U  r×ðm¯=«Hû.ç^’V£¨XAÆó~Øeëñy¾ÏßïÝÝqOöJɉ—œÛ“5r†ךBLp»}éÍÛo„¬öøJ‡:|^]ð©ëù°c}ïíCè@ܦÁžt°TÜDo/‰È»Íxü]É»F…Xz·˜yYËʤ°@œQ$@nÙêY |G±®l„úù˜Ã,à%›!sÜZÁ åVÒ0‡Eï¨s5ª¿ ' “r ˜{rtI"„ŽÅ@x* €,ÍÈD$iÞ@«ûT¦´Ñ‡Àœµl’ /ˆ¦¤”¢0a?‡M\É¡âE$-èÐð™‘w°Éþ2Ø)&lŽäR%àóejwÖ|^R-ˆïP‘Y™C¿/Á ÔbMò™U@ ¸ªÐûAbÔ —}Õâ¤ÐøÁУ”ÙŒ‡!Kñ;ìÊè-¦N}(ÌÝ“ó‹òß<~qç`qÕ5&ŠëìŽ_¬ñ xsؘB“_`>ƒ\ñÕ`;J€ÏÇ8H…]˜¾2>A2ŒÝ™ã ˆV.®jvÑœLQô¦F;Z¡Ì]©…¾jG–ã"u-Šˆ5ŸúFKXÑ}yĨˆ9nÕ™0>uvdÂÅc« ×B:4r±™ú›q*#N¦Û…'5Âãw%éàf@ Rá»áòNïKÀ^·«ÙÆøès½»^ò¬ÛÀ—¸/¼ᜬcЗ¬›‹aæ¡Æídk.â·Ä¬@¡•\²ð›Gûfcâ8¥[5@«XÇl{„È0×°pÑ)°ö¹‘I¥ó…u("·¤å›ó¥gÆ­@&Á‘øüñæ$$›„_ ÂC áôç[Iv ³»íŽÈB[…¼]1Q(Gç/ÄÕ€ˆº"²CŒʱ‹dn™`«üh½w¦_H(Üzª±Ç-yˆy\B96„®JõÝÀÉ’h'À²Rýù2*L•²õB}(èŒêc9gJaO€P| À NŒˆ·´Ðøü ë±äÍgD(ðë)õYÏN4yĹ<Ÿ¿ƒ[pdr=ÜÀL¢Å€Àkx÷M•fÔûSr®tº.lfݲïÅ¥g©ÚJs¬CÐ"4œª^ø>È¢‘@ù„·x༒mð[#«N{Á: @Ée¬QW„ùoÈJ:2$È?("˜ñóE@L#Ó­B~À/ÞåqÜ7°“þ˜.da])©op&æÑ"Â…§[çåb‹”­˜§D$L®öLža­í;\Ùw+ãV¬V:ÜŽê‹9v¦®ç‡š¢¹V &ÄŸx>9WDBBÜ·Öòy³Hsfõ Ÿ1–¼º«öÅÁ…DÅû=Iv·€å…‘ˆxÖè¤Wó`»~õ\À3+DØ+ñ°!LU3Mi_ÙôÙ°ÖFK;&h65L7ï6y™÷ÞU=•«°–= áo~n5îtCËJ%ôqG LuÐëÀêÊpF}š<­†Úå[9ƒú œÔú0.F¹5úªßB“ k°Ä8`“¢â=ä¼2Ë{øbßûlÇñPµdIs?mhGH…éšv2x°SŽ>‚CTnG[ý6Ï°hE¡tç«·0óàªÂé³R¶UÀ[ …GïéFÊæ`yn‰È¾•Ô[~v3ô·ø^Šuž,îÙûüÉ'¨6Œlªf¶—cTȹù¾{Wa¸×Õ¼ª­ÎgÍj0ò­µ@uë&Ý ¬|”å@“•ZƒÖkU ½³·žÑ ¦G¤ $ÛÁlŒ ÙYÑ€YŸ 31ƶHö¾3› Vb :¢I[Ñ¿I "UO²¼ïŠ+ ±îK¡ÝÛU[^îfV>cõÃK:ˆÐƒ))P¿ÑÚlXPâI±î Ës92ú‚+&Ewåi9pù ”Ü©!wåp‰7›œ2øCÖâ8ÕäHÌÐ, Ün÷5³3¾RJWÍ ¸wOW!°v=—ª8 ÅVí7ÔrÒdt…C~RŒW@¯Y]ϘàÔkó•_¼ œÍ3¹NÚní¢wÅU°N軽þˆU½UHY°ŽÊ{½Ì &TÐLÓ§¦U"s²‘î¸A¯¸â›ʦ„GHÛ¢\³nƒA€-ö­ª@+†6]âe«™l0’3yð+*ìR TéV+ž^£ÕHSÝ8v;Ìí¾Æ·‚÷1òð.ŽŽ„pÞ[®îFOÌÙæ5,UéÊ‚ƒôad!( S÷`‚^.wÉ‹¶<ë%"ç|Æ2UUAÚÝÝP¹œÈ)–!  Ä=w…[3TË'0áˆß”&ïØ=7òŒýŠ˜Ï®LÂ"{“`DµÇ7ǶSo…„Æ ç¿·Dš€ë&µ1,c›„ŽíýIYðÅíÒU|¬7”cƒúVб¨;:9“Eý•F{wõd7Õ”çðt¤¸J¸)qs@Ì ˜V¶Jtˆ^9z0áÎí˜ÉÚ$èà~¥ & Ü©rS–kQEÙ;¨äF\½ënüÃfZùÂS%wJ‡ÖYì WXü"¸õnXñÂZTúBÜ›IÆÛÎeÕËö9«0'TF):G4s`Þ!ütE‹Ÿ‘Y8Óê•‘ÇÄ°Uép‰ùÒdèRHW¦DîÙj*tbwLü[ƒ\¾ê-ôÃYÑ›zwùˆÝ=/ƒqà)jÉ‚RV± ‘/B8»—_g}qÙo"ð@ATÙŠ<RAW,ûŠÔ"ØOgª¡G€MVY¨Áx¾x­ÑîâÞwì¡ÜPD=,ËÖL§HõÕZR~/² «Ñí¢F/@d“Wg¸U™èŠ%‚ÃQ}f¨„z:s»;V =ŸÊ=cc= d”Âä‚ÎÍ šÙ˜Çe)³³‚Ÿ ¶‡OSa8ÝR“ß ZYÏXzpQÍ;ØÇ•U?50"Iš'8¬oTFõZýˆŒz”Oi–BygÄ%Uö8«\fcúíXô®ôe*0kr¦Þ=b¶Z¯3ñnd)²Yô*ÅžßÔ·OoÞÓÁQ@áÉËàÆ^Ô Í´W°ˆ¦ªö±•C1Ü (Û`Ú ¡¾‚ðÐ3ÂÂ7—ö­µÀ犵·éT{´!·W q†(^¶AM$[-êa*™xp›Yµ8~ôÃL';Ó§(Óy©ëX:çTNعxsÐ_Ò»q˜¯h %YážQ)Ï»æöZðû<%ä‘/ì`I}Í”†&S¤¡»Y=¢±CŬüÊá’YU@`Iv«p+¦î}àåš÷)×”:]'·»ëáo<àé ÁøØ•†¸©wÐ"Rñ ®4ø +³«ºÔù›E€†‰WuÁó PwÛ=sÇÞrò…À®&¯ÀŠ\ÙÛ;3ÒWƒu$î0”¸Âf$u‰cç¬ÄËg k u³Ü;Ñú ë¼Ør¢ÂÞ%«r>_ß…«µºÚ=) "—‹ƒOŒP q˜Õ«J_^¢ë¯"+°ÖlÖl}†,øöÚ+»×¨BÂÿ±Y!:2bç!vÃirÊ쌀G#êŠð›2ÏS²4“¬7)ö{là¡ÉOÂ#¢c*¢ w㱟ñ¹eäÐO5J¶c/"³p„=tdXq å€•y„ÖDÙ‰ä$•I• ¶è2¯¸ŒûB¹™OöÌ•Þ{Oä«eX%š=ë@<åÛ©SR žWC¿¼Yv¬©ç3.ÐÜ­^À7+ã=B7n²å\”ÞwêÀÞu®j\ð"Mß´l™bj¿ˆÏÒV]tSÝþ÷ÎÈä\¼6AJæ RÁàÃÏ"²ž…‹¾Ñ¥œš¦Ú!؉´‡aÛo‘¦Œ·ØåAZ€!dIioÈ=&+ ·¨íÚ…4TdH aJ‰ =9¿ü™¬!cƒðKÝ”· Ü’vHß­¼ç±¤¬よ€ŒPD¦ÔS#¡\ëbµTÝèCü%MaN7šjŸ¥MßxýdpGˆ•oBt§¤B¬ ˆÌLÑæQKêccP{šÂ<ÖZ§é€ÔàÛtѶ-—J+@ø¶ÊœÀuäì÷qŽcçÍA'yP8’ f\_-èÁÓ[Å;(’VébŸ]9ú];0CYp¡Ô¨Û ¢`“?Ûˆ² ÚÄÈÛ hQ­£UJ%ó…3WÏ/"ZኚÂ, pvçCƒ´Rá'ÐùCñÕAõïÛcnc–ð 6[WàUfé)ë”N*)@›Š³\Gh83ç7íÖ‚·ž,uõ{D;Ñdhª¸TÃm0Ž­†Äz9÷zoo­å“c`ñA`GêMgýšXv0xWÕt1F¸é2©‚ÿ×KgÛ<¼¾C?fÅ£Ö¤ VþôI3€ô5“‰""löÁ~˜o(’æ01|JムՋ”ÙÞX+fJ áÀT¤ñþÔ؇ø-'¥Ⳍßx+&®œ“Þ”“³.P–,øZ\KKµZú†³X-ت£!·: ?Xk USg΃M´ r$dUEµ@B‡ÍŠòÚ{NÏ8„ ÓŸ¡ÜÛ¼’4’^³3=Z†Pì"!ž‡–^#¯±’‰hƒšž.ž.À>`h!Ä/¯8½É„@Š}“¼³á¡Y1Øy°?5 ƒQ!À½}oñJú䦬âA„Nß'þ&ŽM×JýåRÛç`0Vò VPå£ugŽÚϱÔPoŵ,}1‹kѽÙä93ðRб¡Ø/6 aÊQ¯sˆ£å¯W óF‚~?È®&( x<ìer­,çß!¼`D=¨fÖfÑr`GÑI¶,Wº¢ºÍ7÷à€Úš0«œßikuÞôÇ]Á¶¸ªn ~7¦€þN5a]÷<úæTãe·ìÛ”NþåÌä>èà‰R¤ø(›çÁ!±S§§  #®A‰[Ã&©ÔeÎå­(ïå.—V«WjYÖ—ªñM—¶¦¢­. ä⸋(Û¼±p™£d â`†ZU(†ó&rÂÏgµðã9Zfÿ(T ”¨r3µàz‚yK~mœ/À{æÌ3©cüõ¼%DË4zßæêù2«W! úºIþ˜¬ã€· âÕ™0mZt¾Gt}‹Åe ì.®Û#@±/à¼m¼›â'Á®¿hÍ` ©,“æSf[òîB=5ÖÓS«JÎt;‡X|-;5Þ¸³C"““%Âýó’#§ =̬Ø0 áq!^t>†³ ÛšZvñö%METß;hÎõXœærŸ?eJ ’0˜´¯[ÂA%“9²¥ ˆ SአV§ßµJؤôc[u“¸º œÔ‹`’a«ó†QUä [>6uŽ8WUw1ìzú\Í=„À“ ã+“{œAó¦/*(&ëãjŒˆà’^gh\À¡î w¼WÊ w]˜šÒ¿ I`+ ‹C£Ö=¼SqG÷+½;š¿,Kå€ßòβ³u™ˆÄéš:uÀ1Àææ°H8ó&Å›[«c„˜KiêjnžÃ 玢‚kýhoñÊ(\¬úËîÀŽ`Æ|tŽ©Œ©ò^^§—ÔºE¹‰@(:M8U\ +o¶XÜ¥ü÷õDðu®cšµWÖ‡n&jµ8em°}b»Ì—sc9gHÌÅ¢m¿®Ì·Újt©kTÐδ`ÑÔF@‘Y»¥æ0Dªp×ÊA w™\†š t%Ô#J†=µùY†³µÐR(ïTÁ߸p÷€yxE$ö‚£«?b,D^/e&¤"òÖw6~Ã|Ä„|i)*}¹`/Kýç 5?/¬³~ßÌÍÏ9 UMñ—š5š05f“Ï<ìâ½Ñæ˜k½õécSÇæõ©kæÂyhŒÉV’ììÈAŠÖ“›9êÏèß ñDö/Ö¾"©~}ú)]?Ô"øå$-Þ'_9ý|´f+êÖpŸ),bT7ÑJ8‡îjÅó‹Jc\†±0»®ºXFPà-x™[EÙäÚlX–îvÆ‚°€pî–MPØíáêV!ÊZ{ëîNÞw2ên%wiÁƒm;:œäì/ƒûlGE8Ë\Ç··¸MÛKLÔ¢²ÙÊJ?€w¦ûã–‚SG`¼¼~:¥º•£ðÃŽ1`¬)Ø‹©ÞÆ`M°±¨—«n|”·zF± IÿA$\•5+Ó¡}0œåegl´wqx«A¨5¸åƒ¾7Ê-?`þßzÖ·j¯»j‡·aôÀ~±n ‡ BqBßúI¶ fïò£ÃšÀœ¦yO[Êfã×ÝÚoªÝAGëÔ;Ij$‚«eè°p¼›ÒíØ‘*F_d³b¶Iš"/¤Z- ˆßη†=Cè4kX‚Írtä4Pv…<ï)êÖ˜pϦ ÖET*ÛyåÒŽF‡ÛF±¤'ÃÒ0'¡ ¡Å¦ŽXΘ£ƒ—ÒrÚà›ÌÂ윟G&‡µH<-gÁÖo[ö3&€t]>ªÃ;.«d3|a„¢°|¿{'Mî9´µiø^S$µ|mšoâÊÓ±íK“ÁiÕ‰óTã秵ø Yມ©3Wh¸Cõw¬/c0·m•£+ÚpmVÉ ¤ ¥þ°}Þ|þ”©Wñù„z…k{µq•9LÙ[ÌmÛ±:w,f_BÔz9r”E"üïn_´Ê|x1gs¯: 6Žá‡5“ìD_ÀvûÛ° Ç÷{äîGùj@ï3Ú„9 ÂÙH!†úïÒº;9RÈšÖu´–µÓÇLŸO6è¬Yo(È´ÎR£†ÍÄ zÇš.öB"°²Û÷°aî.U =@ú•´ªísVÉ$’"Á9ØPžÚý© ÌÂGåØ@E³ågß™Ü:õ”4Ý6s5˜R²q Uú°© ZNòNS¨ÄÐÚÔ>cvDâçwƒE'5{û눡ˆYì”!¢UC9Þ­täœîD‘ÖÝ5`ɤݩ&a¸q@ÄÔ(D\ihÒ´&ÖÈv‹_­ªHÔ–ƒq¥8ØXìï ÐºM̲Z–øˆk…±˜VŽvØD—†H§]§±ð’v á ¡cx°iÚœtØ€Ic×®¦ˆ D<»{Ëʳ´·8Ü6äÈë¿6k-5Uß:×𼡰5ÄU›ØU⪞¯ÞJùqtìUk&pXݹpÝú;L9lž—a^~5Ñ0mHä’Ù­×5†[쬠ÕE“áÿ‹ŽI ÔëíJ•f FsfßÅÛ5JÃØØÐpõÅŽ¨Sç ÆuOGâ\·â›Gä‘ÑÇbM,j =—eCǼYi#Bí;¶ãA3!¬®7WZ]ºì´c9Neª Êx |å“ ¢(s‰å°ÌgÍ« šgO@¹L³öþü–÷¼Vå©xÀµ²Q6ˆÄ¥+¨öÛÇVrÜõÝÎç¸*ŽÍøaýH|Ïùj i5BC˜í&xò±,B°ÃÊŒ¦IÛvòx{õfóƦ(†$Šf[í™ÉW{÷ó­aÇÜ™qþnͺ5;A‚–3lÔ9=´LípŠ*ïi+§¸ì7Û6Àrýnï‘LÖ2®³”.Ô&à’ õîàv«EgÎv5L9Â?]JÀ-›IeßL›@Î<¥H¢d ÔŠ‚·Sòô: ¨ÙÑfL»Ô¼>§tþ4™–^ã×1Ì›)K {ªØ¸î*¹¨E0 ö×+3û\ž¶±DF•™f0Ž¢@ÀYëT•?Yí§3ÕîÛµ”€ºÚ¯NüŽ¸OüÇ¦Þ nq*ÓNÖmÜU]š€YuÜÙpùNø· ~šWÂg &3½'$0íÉ„4^ñ³±ƒnHèòª}jxËŸ6®GÃ!²ºÚ±}ÀLb$Ìqã5è8ÌÓÞ2-bBј TÒØïxˆI³¥=¤ÇT Ó-AMÍ0ƒM–T,.ë ¤ oÞ6Èebdb8¥Žrs›‡è\•²ýzS{®b1t«qè váaQÇPÿæ\ôO¥s<àÍ„ì3}¸š29–µèÜã“úúÉŠ{Õ¤ç5Õî9çe™-ÇZ ‚€‡0Óq vCáÍ!€c3Ao[Öù<ËtÐRÂ4ÁRÁM¨*Dê9£”±5éZ±†þê×WÉíhýU;W{§Û»éÝèÅÉVÄrð¦ˆcMý¨-ÚΫj^ËooGqt"7|šG%\ž˜ßc ¢ù@Àïã©XN¨:‰egÓ6=ÿêùD¯–;;weÿùJ*ï­r@”5‘5NË-©hºÓ±?×(ífÇá⊫¥Èîêëa¹ïQÍ„êèjBºÅ]zÇa¥C ­T,*Òñà5œë6Û¤a•/§2ëÃFD•Mve€l2'\Éx0\€…\ÌPÎc§¶ÉrÜqÍ%.GÎ@UæO=9J:XœQú¸…À@ ç/¬š o Ó!ŠPº˜¾©Õo?sÙNg)ážÇÊE-dž¦9÷êAgššŒÎÚ¯a픋?V–¥ êµp’:Ë ÞZœA”(>@ÑÊÖÁ °ø:Ê‹9Ö$;u4žÍê;6—P–$s¨¹xTÂœÝlð¦<²¦çxª*Mo‡NèA6 œ(3·aÉÑÎ}ΫæÂÕ~§{›„¡Æ£ko‡Øº¬=z." Ð5;hLâc—Y•´óâ|¥øùœ?«“3²5žº¨óqBƒNg:ì‚Û¬¨Ò“è¿¥?Üw-j¸qã1¦ú¥€žµSU…0y‰ñ=ô¸z0#$à›r"úB!!ÿì¥~­PpAªëto‰„.5D™4m° 0•+Å#Öt¤0Cñn°›2"vŽ®07NÄîsJÆ’³™ Á”•ƒøtvg½wì˜]!8’îCD¨d±·²B<ð`Dû˽¿gMou|Zg‡¦Ö‰ÔÁZ¥» w}ýâúç!öýÔàmÆ‚ u3Vo-_\qHæ<4¿Ûã}ED#a]C, ¨ÎV±˜@Å—‚ÎÆ^A¸¨·¯¬+‚xm€•ÉAKÜ+8!÷Þ¡TÄ ÔP(.Næx;c÷긊XûFª7AÃA‘b XTM0U¨{M'Ù q¯ˆC Ða-àÄvò¸ÀªÅ{DWÎJXã!—Ø>XÍ{LÅŽÃA,: ¯¼†«®žÃÊ îu‡FF_­ˆ®t4žG´%ÄѪûóŽ=FÅŽácQƒ·;¿˜ÔAÎÇ3ã•fÀEU³¼î> ©‡Éúl5ãÌŽ³xï¸S|µ"rͧ‚)àW ÑÎœ:úÅŸôö"ì8aÉQµ¨€N‚ä'4«p3̬jI¶ X¤4ž9„ç9>¬cë¹"’฾hç¦"^2Š¸ô36•¾}õnlÔ›\ˆœÙs¼ßÚd°êïhT¿:Yܯ NšÚ¨À8¯3òF­¹sq¶£æû{tîÈMg«^<€×1ˈc֔ðbVµW«Trv‹¦ÛÃ’¯NK]:+å‰mÍNE¸à):la*ço~Ë}¶ ”µ´R‰rvjÇ:ÌFµÚvÞLI:„õ™t]løé®ZNƒD;§ ûÿf"OðÅÎ0'ØÛNvÑÁ\¸]JPhˆÔ\—oUë5ÓÙ„€ˆ~²4;^½8µ¹Üü|¹±¡šUî9\2ѳŒ_;OƒlQß]›ð¬X÷æ%)mâü2ëëÆÿTا­c™ÝøL>²Hdgf9²$]0LõÀÌi-²j­J éUÑ-ÁŸ:aÐÝ[{²ŽæÚú¬­ÛѬ²š°ŠuGí$©Ç6Ú«ˆq¤¶uΓmÛAÐQ§cà¦k ly‡ÂÝK ’1'Ø5“âc$X¤øõ„ÓÃJulÛ©PŠÊåêe°uÀЃšg¼¥6çJî†aE>±œ¥H+¬þN›uT“°Ý1H®ÓAtô¶±N‡í&…›Â2lÜŽUªRî|; |žÍ&éÉvóLU Ó<;N ³ó,ÙÎt jô·j“åt„ݬ¾l¨kuÓ1;á§aJ ÐÊoÛUÞΆå¹äB—)\pb7øÊ!²-§:ýÜ1ëtå€Ø—!£7·î›06¿ªmGœÙ;¿ÜÏ7; ™Ö'Ì&Ü} ÖÊCïØ!U§sÒ<ì1Ô%ê"ðž¡Mw`}¸Žµc‘&Ä×â•~€ørbN½ÎåÊDq?ß½…âÃÎf–2랺eßÃMß!0u³+kû¡ã«¯VŠo 'ê/žì´°˜þ˜ ~Ü{üàÂÖ” 8·1h¶%cL}é×ý”#CÀÞæ¶ÕgdóíSÇì$èÔåàÈИ4äx@J<ù= 7¯ÍAË}ù÷ «SRî:‚ÅNt_5kÊÃÕ9˜*s¥–•M® Ø}r~>ž‚ú¥À-jÙ”¼?÷í»kûW~fËÓÈ¡Äóô¬RÞíÆur+ÐÇãuì ÙÙy=: `Î4ô…½áö4ÚVV#b/­4=·á7UüÚþX vÚB)1Šþ ”žAÏJZÕ£¸ ÆéÍÿØían$ã7Þ?V5\´ê ;Gz5–bAfíï!‘ÃoµTÂ##60†­ÿѬùž£èÄIà?6’´©ç¢:oC‚N4+,p/•™ k‹w [Niè Š¶.?Ú­f—xŠà²H–ˆÐaã烮ÀDë¦4m6ƒ§C&ð´‘IÞ°ì@ò²®ÜãÆ ÁY'ÃnÖ X0ÈÛR-댴µåÊþ9hü³åÍÊä„ŽhÍ/:ªÚ ÃT‡™.PlX¬)ýqXgºÎÆ%géA&®@PaÕEsŸ¸FÑ ~qàK¢ÖÆH—ŽË¶¦óö)˜ýµø w«Êj!ÂLèIŽáý£*Þ©ÌÀº«Ëä‹O>W=—Þ”eåé~WÇÈ'F ËŒøÅ/w 4 É<¤Îóò.vÉMvX¿x ãSÃPàQ»EU[AÜÚ{èp ±÷CI „ú$Ê;ÈF×u@`½t"ûÍøèï°s;|ÂE” : §!3\»â! ¦®rÐI¤6êߢô.¤ñi›¶êlȯ3Å3R±?¤®²=ÜPÍ%S, rœ¤¾•[Ížæàaᕬalf'Ï8@=&ÚÆ{ê…8£Í›-ÊüøÓŸþýÏuòüjÿøPK=ók”Õ cbcmac.cppµTIÚ0>'¿Âš‘P(‹æ ¢ÉÐ*ª€hH«VUç…X$vd; Úίã,Àzë͉ßû–·ø‘2’•1 ‡‚¤ãôÁ¶iÂbH÷ò-×AùË`ýnª›6–lIŽ‰ _Í—‹M0÷‘»øè¯Oœ Ń oÛNcä¹^´œ{‘‹%L&ŸIì!Þ€ú'‡p&Úž w{8 QÉ$Ý1ˆe eÀv*¢:j…sø‚³L…D½ œË¾ý۶愀”-RNÜ€À£‰žÚV ؽ 0[ÁÑy“ëfœì7ô8ý:˜ð’)h†ž¦öëmWEŒ\™¡¬(ÕI µFŒÔ+ƒÛ–L£ß×1µmë˜Ò s–Óëu¨–†­]}ïîƒèç¬Ñ1h'M.óg³3»†°¬@ðJ€[&£eÕ裑>k×&»þ…Þ_§VìÏD­¦XoìÌãf▥ʗŽ=DM±š¯¶c&&˜É„‹+ÊÙdâ†Ñ3gÊgD@Õa]ª€ÓÊ“üs/å+~ÅaŒ64˜u~Fî ãÚBû·©@Ó‚¶.ÿ©î¯wf,%#zÊâ”áÌ©§L/a7cÒjIa*øÑO|vÀ»<3K&hÚ´³U鸖¡rRœÃÐ4¦I®®$¨¶yOCôϺmç’îÆ_ŽIMt{ϯÏbõ¬_(`1Mì¿PKŒ=l©læ„cbcmac.hTßoÚ:~ÆÅ•¦ÐÑdÓÞE !ݪRlÒž"㈵Ďl§Œ[í¿vmÙª«û”øüþŽ¿Ï|+ ÜBüõGš}IÓ<žÇ÷Qœ&Ö̾â!\°ª-†ÙO<øåðܶ©$ûé¬dÝ'ë4Š“|ž|º]y±:4F¦éˆ x9aÕú¹Éb¹|>¬¾äß³h¾LÀöÎ]ó9Õ!4í¦â îQkºÃ¨5% Ã5\ŠXHI’ÁËTo¿ iÁw¨ÍÚº,®¾×£BÓ*ÑŸrFµ™¾Ä9óLÉõèj1f—ó¦Dåü¹»°¾ÒÄ.¨QÒ ³óØý=peZZAÒ'À[8χë÷—Å,ˆð*UÒÅÌÛ­çF_#›[\]¨s…»?ñÔ9“­0¨&ä÷¤çÇ”B©p{=,i Øï÷þyA¹ÏdhFÅUÍ•’*°ëòKSWð•<œ¦‘àò IJn,E6ž›nnÓ5|øðч t)Ûª€ …ž’Z8v²­’õKð ÉÚÚÒ­#›ßáj‚Õ¶RÁ–ÿ²YýCÝ3Tûpc]TqêÚÿá…Ö²Ú‰ lÐÂ~}rƒuSÙ}´(›ÄÒßèÿÐÁ­­pF€ñ)yšÍ`6>X[:[ ,»±"m¯(¨ÏÓé/¹œQûúï’a¸Hn¢oË,¿K~,“Õ§ìóˆ Ž‘W³£»J'u8©j·hÚa¨âbëÎU;©ì5ÖN‹n¶#õ_DzÃ#¼áÞA†¯§¾ƒáhØóþÄàÿdû©•%lg²©shPØr®K"˜{æì%<‡t”~~ “Õ¾£( ¾%ÿPK=Ÿ|÷™Àccm.cppåWmoÛ6þìù× ëèDIl70 çðÛR¡yñì4ÙV #Q¶‰2$*©·ä¿ïHÊUËk:lû²6¤ãñî¹»çŽÔá!8NxàÌç°O±/ã@¹ ó€:ÌŸƒ˜1˜§÷%÷ ¸c>ô©¿½µ½õÏ uìÌÙÁlGË<î2z£_†7×Ãáľ^nÆE}éYë_u.ãa§7˜tçöéÅ‹¹ˆ†Ãª\|Œ|z½ËI—&¬Ý3ñ-î|1‹R1bÉ‚;ĉx"—`°›&,F ÿw6ðÀãS1³@«]ÑÝÒ eCêÇ ¼Ó˜† ºúc{«Ò "ç¡çÏg,†·÷ÆË)t‡%‰¡@ªÇ_ÅP;ÐèÈ „á=ó£÷øsŸ2;FĤ oNa4øé£=ô'Ý‹ëÞ‡±ýëñU*bGO`óGøn'ž¦!ã‚t‚i„¥›…22Ü¿;mPÆU ò ÅrÄÁÂçÓlÁÑQù ðH@½¹“á '®?e‰P0fùàœ › •4™ø>óh"ýµÛýÕRµ [3…Ò´ ¸`ü{hÀÔàù ò8Z“!ÂoM@ŽÂT²ƒÁ‘M ZÔkøkà%Q\ÿ>õ<¬Ç9ú!Ý’:+µ LN _JZBJÿqÅG¤Cל¯ÒL;]G´_ß'>U4,±Ñ¹'ˆÔ>;…†‘|@K¥1ÇoÄü©ö %^©»_¯WÁ èT*±Ð™/ÈRw¯nŒIs¬—&Œå=\±Ó\Š7Û¶B–ŠYB¸cù0±o±2 ŽˆtB±ô\òié¤Ì¶„å›Ñ”Σd®}Kt¢-XšYeW+³²±è”ºª™1OµcP²‹E§Ì—“â#ÀœæŽçÌñ½EŸ ª7%$xŠbfŒb“^dÓBË Ö—B/ŠÄR1£’™Æ7ëiÔmÓ¥®Zø²_,ØYµƒRl ê¡+Ó^Þ)f6LìSxϧê çÞéªJ R¯Û›èÅúŠî¡òFÁ¡TÒ%+k›G»ÄDxV“3¢µK i¿Q=lÈ…ŒþþSq‡¹?‘h§Ì‚®}>\õíÎÕäzÔŒðˆYºß+!~K²®‡eóÈÞÊ·ÖsvÊçÒBŒ:CúüÆÑjlä–Œ&û"~”JÞäÓB»cnN8E6gÖLà˜&¤~r‚soò©U­*®)³…|Õ››ó•73ѪUÓ‹Š°R)G µú"ÿdËCÆ»æÑ…}CêÕ““w `qêÕ>{^Ñקz&gÇk½kœ¢Ë¿Šh¯‘Å„~_S³ÓßÀë­ã•„}Þ×ã¬×V@_²—oùÈë¤xwäÂwpx(b&…3ÑE{%§â?>*1i̳+ÏAÇ}¤ï¶fÇ$yËX qu”)½›˜òÄ‹â ?âív÷fÒ8Þœ˜É›ˆÍ¯S1Œð4fqò¼iËÏQlóy*ªŽ 3o4ïUUtkÿ[IZ!ùTÇs$œˆHÐà½I‹o¼†iJ¾ãKø0Î ?-¨€©ÿˆßøYQr•ðï«Iö9ŠQÃ,d>[Ê6k~u|nìÕ/¯«`/âžïJ þ£:ß¼–—…ãç‹™ýŸWóGuÿÒÖuCê¬&>ËÛDV`ãZYËn‘R!”ˆÚl–ÝZÙXˆüûg·úˆfÜõ½í­?PK=3T:Í{< ccm.h¥Wmoâ8þ\$þƒ¯+­ Û-[ݪWåîF ”ÊêîKä&XMÎvJ¹ªÿýÆ6'¡/»÷¥Ô“yžÏ[&ïhÈ"gü×hz5yŽ3ð¾–Kï@H)Èá e~”âT.óO‡¶4N"´¬\¶½É¨íô¼Nï‹;¬8|½”ÉhTUkµßÐI¹äGXˆn¿¿; ¯¼Ù´Ýé÷2ßÁ‚ :Z¦7õQ[[—ÔÇ’“uÉ©ïÐå‚p¥Y.=”KF·^.l *`ûà Žb/ s"ä„þK*ŸªÇ èÃ/zxT¾Ôj/ !ƒz]€ˆÍQ;š'œÊE<Ä1X@~„Tv8‘)gè ‘(ño ºR=É#> ‹¯rXw«Geô$Pö¬û„ÍåâM²€ ¾ÿIª À¦ê’§‘ü9º"ȦõŽh°{¼yÀÞÂ]D3Ã~“$rÅÿ .€7Ì)tÎH€(“èj)iŒ£.–¸8† zSPöµwæÉ?)åD ‘;³Nû¸¯‡î÷ëžçΊî¹3]ï{@çEe¨ wö|^ÿ؃À÷/!N/Bº».܃°»Tc£UÂeç+ÁáÏÛúqö¹ïN¡£?žf"ž“ç‘0šçèOTÙPœV›ÍÊùˆ«@(O­KkHH Fœˆ%ñiHI 2iŒˆ}V$OÍî kæ/ˆ sFÃ×6Øx¾°î{ŒŒ,¶¯²†I"·ŠÕ†fK†XýõÁf&§¹’¥GæŠ+6Š0äŒÜËo”Éo–D×üsÉ.ô„¥½ Õ„¨Éñfg’Ê1kæW4ºYK‚ŽRA8(£Moß’u´ QS:9%#L¹@ï—˜ãX¨P{8éÝpiÕÍÑŽ¥vWd€ä±ÕVl` iêYSTž×rÒ@Ipôšî¥.£e¼‰±ÿä ü¯"«á¹@ïQÛ÷¡¶rrÈÙ®G|ÉæUyG¹Lq„¬Ü=1dò‰.>5,}ÝýæUPF´Í)Ë/” dëœ>y>„ ù´6µ*rAEõckcGå—‰‘Óq¼N†¹ëÞhчqïûµ;îu½NÿÊù6qÿîm‚@X£‡âctNÏ4½º®=ÎôÆ¡¨®=û §\;ÇÆ9(5g:ö°[y½{H+Ññ¾^ï1_­UÐ]›´”K kÁ’$^FP¨iV­©g]þX§aêqŒô ˜z®Øh=­k×K Nìö±m¨s{—Ðø¾½Ý ‰å6 {d<¬×÷ê¿°1m^õ— _aL9f"Lx¬о¹“½£Iè’Ó;ˆ™ºÁëumu…i/^.ïí‚ŽFËõ’0¸h>Ùdk»|×P£'áÅáBÊe½V[­V'‘DIÊæä$áóÚŠÞR¯üiÖpëW‹DW7 ! ©/U ¼m?ï&~ª¶]0úÂúCd[YÍœ {kT½sZÈJÞ/3…8@Õ%• ëî#¦7ìê/ –KÿPK=œÕ’ ^ö channels.cppÕYÙnÛ8}–¾‚m@v»G»Î q3ƒkÄíódÐm•) Iµ“)üïs¹H¢dÉK‘ÎRtãv—s)f0@á3FbÑÓ]¡¯œJIÂ,BiŒC!ÊÜ”f˘†(J¶z–è¡è-¦¾ÿ‚²0Î"‚ž§á¦¿y®zV,"+4yø}öáýl¶¸»Ÿ½ø0wçŽÕ‚é›ûÛùìÍävqsûëÝ4˜ðÇT&³YÇÿ8¿›þº(Æ!£Žv€^ú_¡{"^“ùW*ÃÍpø&ŠÞ’Îbùd’7ÙjE8‰>pÌÄ*á[,iÂÐED„¤L7z(L˜L‡BrÊÖè†×ñ¿ùÞv9&E?ÍÄf±ÄáçÀø¨³+;#ç·ÅhfLÐ5ÓK´$k Ë+}„E=ô)<`¶&Ú)âÚµõ¦ÉÂÓãï¨Ã!•„c™pD%£,M _,“ŒEÁvÁ :ÚrÐé¡¢œ¨¶n){Åe‚pPYdƒ®ÆXˆ6íþÎ:†d ‡¾'S¢hVƒ× W£²(‚®Xµp ÔhÇN(-ùÞ2IbÈ8Äæ¸å“`““ŒsÂd¯ì¹eL¯YÕö¯²ÄöéE¾×RPI]lÅa‚xÞ,ÛfPvq¼Sþú§¹ír׈+bBÑ·e…á>ù#ÃñBæ C¶m {û+Ê!œñØè ñE*åÓsã’gddú©T±xä~«ÛÓ°²Àjž¬¹©¦îàÈi a…a¬0 9–!8 ¹ŒK7=ëf—ÓåVù6…1Xs"3Î*4B?£½¤ÇÈMkˆêQÂÈøÓ24%ÊÀ–UUÂõ£ ÷./k¾F%(v°ôc-·©l’BNr§ÍùukN¯® 9†f¤ôxump,°Vþxï烹±Ô|[kP5W™àì+ÇxCøvþnÔ|DÌ2,A­)»yÔÂØ6Ëä¯çv)›kj§HLØZn:-®~‰á8 4!Ãd›ÆDÝÕÓkSž¤x­«8¾zÕ‡m*>Ÿ¼bw–œÅùQÍ §D´ÆÖø/@èʇ“g¿ÑÄÔ³zì ZYT›VÁYDÉktà~a[J¢ 2(¼°øé=®¼j§´èî¾ìZ¯­Â[ÕÝÆÙ¹ò‚"šmÓ@¡ºÇD÷æîÔ¥Bó»¹F® C ?D„wYb…ù›ß(UMªl…f_“ÁQ«"7;¯êt+ß­ÒQ“F7c{ÛÁø²mÁaqc†ìéªÀè[+ÄÄ÷¾nhLPðLëý£M—ˇű * ë»Ùëá¢æ½ü(O¯’Zž•sI,Ó(nˆ¶ˆ¯Ì]Ë*Cßl0›“òroWæõ¹IŒ%‰î•ǹ-ÓoÉo8ÎÈ ´Y ‹sèòŠA× –ÅqmNw`%¾è0&˜æ;¨ªˆîÈ^…jVã’9Ä‘é„þ_ç‡Ð92I×9T˱šßY$ÊÛ‡ytR}öî"‡Jõ?/Ë^®õ 9¹ý BhÉl)Å„ØÜ ?ó‡ä`!¬Ú^¨í6nÀMñ‡Y뇑Ä!dîUUŽíñäK $G{h”•1‘xpLÉ D¨@ ‹á/‚lÖ¬‹³è·å¢b/nê¿HinbúñÝ;]ƒcGß}wnŠ—19|Ö¿ Î>›.ˆÊ +7Tèò5m]Ós+zb=ÍüIQÕzM÷*ú4õ¬^‰B™#|ðô­n¹ÊMælK-Çïw<áy¦­˜«¾s~QGõ"•üµS¢ë@ѸÓiñl“/ä»Â„!ì?1V_VÛ>­Ôè³ýaó-…./©¾$Îä7tøqƒ@è­Ýˆ®YæX0fžÓ– Ÿ?]ñß&añä¤'øµulm?Te *S¢&&4»®,c&ÕµçÍn¦ãåüf4nÇLfþHþá7£ã[Mòò•M–Ò U©ºˆ–DÐìVvЋ• n­“!Á­Oæû@[j¢Œ¨í˜1%œ÷ßu¡Ôb¨{°uºGé QÓ*U¯ ÕõZ»Iƒ'Ѿ"îE‘V©‘O>Ê…î*®4r¾@gØÚsíbdïm–¢¬6Š³‹¤fÀ´5ì¤ÃŠj—T£5¥Ù«¸¾ûDãlØÃzd3PUhND¯G–9È×TBä¯i,];®Ÿ9á}Ó¬}Yö–ªÝ‘ßÜ8Y qgè|b]R±fHºêšÈ4Ƈ8šp¦Ù?àÊtFøS÷´9ö=IÚ(Áº—W›€çq\W0‹Äã*²‰ãÅoGj¾ðÙNîsªƒF²QºÄÜã:ZÒ~¼Bœ¦XÇŒ®b8Ž}ª»«ÔhG±NÞöp®p¬]_pX¯¦«c°'C †‰F2€%Á\f4„£.rmý©É¾¦ßM HÒ'x÷ñõs¢~_Î`vªõÝï•uÆGEĸ?ÿheè/†’b°4óÖ £eó+lzc9 ¸Ö¨µ×xOxDÏ%ö5,?gw^1œþ PK=ÒäÌ»õ cmac.cppÅVmoGþŒ%ÿ‡)‘¬³p[GCìT¨ŸN[E ZöXqìv÷ìÐ&ÿ=ûvÇÆJú!ícfŸ™}fæ™^¾¼Eø' 4à‘S) ÄBH"„I”\HÒED1„ñ)Ëb 7ˆžžœž¼  GiH šàõåºjmK’% ßþÌî‚`>wogÓ2Þ\m&ýñí4èoçƒÛßFoÈw‰Œƒà\ ‰¤ºý!¦!ŒÓèÞ[ì$‹MR&芞"ÂVr­<þ9=©FœïÀ‡fW‡©,cžFRßb­.О¯ÿ6ü¶ò¬hׂo[9oÞÓÐëÁuWŸ™o5g­Y”9ÈîRVÙA¯å'Ω­O¿^t ž±å Ä#•x ^žRÅÚ1^uô¿*ðõø¨’ûÔZ˜›* NЦ›ãZ¿fÀÖ/ùêú(òª!¯šùs2C˹¶¯]UƒQIë*×<~„{@ û|•n “^u8î;PUI˜œÅSÉ)[ei)k¨K@ Ò$‰¹TÍÄ4Y‹(ÆôoR=7~±3E3bÐÑç•A§sÏðšà §DþNvŽ™à„BvG¥R‹š -y‡¢”ˆrg âh+œšÅÐ2:sÌ|ècL„°fÏ°+Å7Ô§Š¹‚ZŸËAf2påà쎯á˜ÑrtØ휓Õå0"ˆMÈ£wu‘‡vÇ8N™4œš¥¸5Es­g¢ÔÁ|ÔÊÌ@Ôáà²ÅÉΡÚÜ7 ÁKn%Ôñ~&!’¤ÔFÊ’TÖ æÓ®'è§Â°p"SÎl=~Xõ¥ûú÷ ™ï¡ÖT{gSæíƒ7 ußJýSÌéÒ•®€q5PP‹³>ÐðµÉX B?7™aO17\‰½ïR>;s\²¤lVÏ+Ëry"Æ|b]±ò ûögCB.Ë„š6lÞ良{0±[ú µ\úábjQ9‰Lî®Xî[öä×Á f1¡6ÂVí–˜u:ƒÙü&frÄ0'úí±»T1ÕlÄçç\þŒùHßr^®}–j#§]j—Ÿ›»Ç Ô|¾0µ¬7¯ýƒaûÑäú*‰Â+êõÜÂöÄž0èÙÎÛOVƒ¾¡ EnQ«5Ÿ­°]×¹ÍôÊ-ÝÎÈ=͈ —Ô7¿¯¨ÒTò}ŽÉ–¨Õö÷(ð¹³ðþ89êá#‘ ÿŽìÿAµ°b´Tܽ .cl·Û­&Èk·Ž¶©Ý<>™ÊG%‹á†ÓÌÌ/P}ÅU—–\*¸[)„c=™5—,åã rä©Êh¢f¤À[’×8'LHxSA Ùëo±«˜(܃d¼ª•’ýÂh·KEÍõ_0Nòn“RºM0?6|¯« KQª…öéášjU-8\¢³*CÑíÌNš¨þÓKŒëJ±‚äÏbþiBñsm.ô^þŠö焾]R%J…TŸˆÙa"ò®þw»Ï¾ÝeƒnûjpáÍó/ªÛ¯ˆ©[^»*c²w:ô)Õ¤Ú¤Ú˜P5É_Ø„ó·ý¯æ¢4ÎQtíÂHGzŠH`z°Æ"¢eÍ íyê7âpa@ ˜œw2¥*Ïu—Ëåµ ÊutŠg¥HÝ%»g®¥34ÏK†:ûø„XT¹fXn¢‡dVÖy wd}˜1 ö ÛHDY<rRÒڬêʤ€?‰†Dðƒ…K¦2 bÕnÉ eŸx÷Ñûá=»í–Ú41hª…íàu³ÿ å/:·)Ǧ Â! MêB§å;µ‚òåÀ”8ÐÿZúÍûÐ÷4y~èy“à¿™†Ñ×àÇ4˜]†Ÿõ vtôhhs:\ßj£ëæž‘æø(H{žT‚ñÖäçi)ô æ"1Í­éù,²Û±Ívzp¡çý9ï:½ÎF/ìAŸ´™ø¯\ݔҜ³&ËrµªkHS)à–dz»˜ -wz0›Øÿ-K–´[¿PKÛ{TB)Sxn•òU×f_F´±|«Ì´,mÑÆ{uÔßk…}"Np_H‡ Žh›šÿ²—‡”Ìíš»'¤ÇÞÄ«oàl ³ïÜõH™ïZçå´6UÿoÔ—–GÒPao$E{óú '=’ßTæ9€¸BrÒ€QBk'€7!8ßZ‹p­±àˆ[†å'¸äÿ¦Æe ˈD 6‘Ú¸ëBð¯8FéB,|rÜo†ë°#iôcóà*å®°I'ƒ§!€á¨Ø#- Ù>ûøƒ€‘²N»Ín¯Ù†oø¯Åo­;ù’À/B¡8!|û–oŒoQŒu@étip¼Oo¥éønÔ§y}w£ÿ£ûîC»I.ÑtüðõFé“éXV4MÝaÒwÇ\²m 4ÊÞ„äL&——oÈÉV.’©qÑ hÇ,÷çzæ>N¦Y2>®$JƒýÃ原›Ußþ‰–Øw ŒG©„Ã`| PKg¤¡) -¡ÿ²åé¥ûcùn¨ Úè볯¥¯|:~F¬iFû…]‚ã¹e.Ø3ûý¿W0 ±gÑSÉØ_AAD,À¼\Åæ+SG_‡ã;M/PAÿ{&/B…éN¢2 ×Z¯’Ý‚ö³·ëLÈ(©ë~m#'¶ÈNÄßצ “2\%½A•sÓ^þÎ|‚Öîl²Œ?1 ïKÃ¥Äå%…[‹ÛºÏŽÒ$@¬µ= "ìûÍïE’@,ÉžÆWákw6lÃl˜NX· ŠÀ€øøBÔ`Ý"ߦO”9©LgkJÃa¬`Q° ÿ=a¤S}üIDç|jF§Œ¨Ðñ€DC¹mjt±6ìGà“;méäé+Óâ­¤î,A„-!ñ'Å3²Ây·P~Ë_o°Œ‚{cë Ì&,¼~[Fö´=4Ì(|f)IÑRy/ïJ^Ÿ×u*çîÏ»Ib‹qÄŽ‘(bsQœúüêàz@ ¡Ðóh9sÔ©ÁBŸ†ˆaÆ@`ú/¯þš9B»t> ¢éÇ«YÙ º_vzWåÏ«øxÞ½*h¨ÉúeZPÖõx:F}™ÔuP‚¦ë€×»{Wƒ$À÷.P)’>fï" Ve–#J5ü¶ÈÝ`PѽX† ¥“B\'ayOA–쮽òâÖ„Ú•D!.fÑŸW Q®…?°r²’ôÀ>Æ´ŸW…_Í«$QéúÍèâIÉNR×,$ª©ã;Ž÷±_)Ù"ݾÕÑxH—QoËŸÊÑ{V°¾&rOXø;1¸¤¿¶¢ìbÄ­É",®Ñ ˜¢¢¢"üVf¸°8;sA`U¬RåºÙBr.àÚG>êÂï°þ:ÝPšoZIaÖi·Ú-TU Å÷·—ggTŠ<1`l&Ý"LV ?Ÿ™ž}&ÇëgÜ>½ÓÎ@Z°ñÎüµËåÙy»{Þéußµ oû,Ló¸l›49(µæÔœ¨ƒÈt‹‹ì·Bà…©ÃPè]äm}¨«֚Ź@_‘凇\ØÐuÃÚ®iàPÜ\¤(wèùCOï]TœÒîF¨otY®=zN轡ú¯òË‘'Æ•AÙ"Gèá¾(z_ظôERÒõ@ÁÆ\¤ŒyËGӔ䥩üYŸLä¢(SÂóËsë•öŠŽØÜ8(PºLõ@&'ã_Ž+½îãGvÝwòR•&DyÒ–+ÏÁfÎÛ8 ‚(ˆã»€±whŽ34c=Pêܘž(]txˆ³ôÍsá‡øii~ÇOÑi|âÇ3µÉ°:àÜu¾QŠv|#”F‘Ÿ Û´Lª={ÅÂyë‚ Ôèþ Zû™uЄï¢BXîü*2F÷ƒø^²²Ú–1™ƒÈÆ‹PÚ?BÈ¡ªå„j† 7l/ZïÞÅéë4 ˜#'>¡ÁJ#Œ×8Î\Ì4€K쎦(¨Dñìr:²"ã^D ª:I%ˆkÂä8)U`!a÷ê› Ô妘;xæ¿E}¶u‘Ùç¨Ø€ ${T™YÜ#"Kb¼º6ß ‚ŠN£ž“Fjø8Ì•>‡Åqsãĵ“¤æÇ\ !"ˆ¦þSAš$Q8«c¢¤yU»ùZi”S“ƒ¿2X[#ßN•)tt1¨ÑêHñ„.íÌ ”OT8‰j¦B*t¢1Íq•-¦Ò°0IŒÀÄmÊ–4Õ¾¹!Õ¾o,¾y­B`¬Èi «Òw™v&DŸšZ™D²)¨,Lhâl˜ªª"®DÁᕈλE£¨.÷Bã)bvº"ðšö –œýmƒvÆY´Ö¿5RoÉžùMÉÉe³ÑW.ç•Rj_äþDÑ3fÊTâ‹ÌzäK ¸ƒù›ð$tCn*±jXúhŒ$t¡xŠ&¿¯Jy[“êÍHïK3)¯ùZÒ+ùK¡PéªëK¾°hxlXp ¬5CU‰î5à`œ®‰Êuý8 ÏÍjµ˜r0öËASäÒ`x¬Ók¼*+ÇY54lò?A>XB3‚>÷(ì{œoâV¢/1eòx4©NΠçµÙéjiøÆiôÕ|àR„qì*– <c9NfGºDävzov‹²,›W8Y>fÐäšFÍŠ(üIÒf²4°t[m5ïÍ6°ÏvfJxI¹8–9¹ñ“è“Ä(yÖsðçÖBCêÕNEsâècsTÒé8DPKN1<žFU|JPî$ta #›<âþ†²²ç°t‚¹ÅëÉýå^[%E”•@uál*mͪ\TSå#ˆO_fT6e£í|·µˆ’SµˆÈÑ.Ð5]2;¼p3%þì#©…÷ á%;¢×>Š'ë>ßl)°b'ÕV¦/.] ºß×.!ØwíKÈùа<^ª 7f6çK1’ÜÒ²NÅÝÎÊH6¿wÉæ†Ç÷oíõ€+&&ºŠÈ¡lÍ?i:…ämXÔ.¾ˆ;ŸÒ~¾Œ! ¡ é7…CS1…Ë'WˆT$"H„’“…˜ÉsÏ¡¾ÿЃCÑM¨¹¢ÙQn`‡Wlp§%§ñ»Iƒ¼MF”çï ‰# nGÐFxi‡¢‰„)HC¸ü7þn™1º¿v –£ŒÉ@t ×qý摨ÅR·tÞh‰]qÓW§ßík£õc ‘±k›Q ÉSF=imñSw¦”AB´¶œ‹ðh,ü@\† â»Î2X„±z£›ñn«óþ$º¦Ý.·¸Aá±wÖ=?#§?‰‡au] ˆ‡ÎŠniß´¼ð2Ž¢K«‘n:­n<ÎuÏ:ð{Í)˜.6ÅNiâù%y ‰·ö+2(ÔO4Š¼;¥:}]À»»ô¨?®°ò¡veáºßQ÷¹)uÈU×æ=à'ñf}¾² ¯Äý3¨Ô3ã\ò1´ÝáA¨!§êHSe-§ËºbÏÁö«™ŠÍr‡Ìm¤æ‡£{°“ê-:2ya2ŸîƒÄÞµÞwÿZ;·ïP™Q# AåOIqÇɼ_Ë~ÖŸëBdÆ@vxE=·a»©£¡Â¶þ^ ÛÛÙÖkM] #ò•®¬Ó;ŽÑ0!~rL±O8AãµÃò|fƒ±œó¾üìã“ËùµÖ/eì÷«–Çè%Ãõ*|2bŸÞ誦£I/¢D¾žË¯M»´–^VW S†á`%Ç[õÅË8¤Iéë‚ uÄ.E5꫾ÃÍå¤÷ÌK–Ÿ:³Àþxþ·cS¾+ «™f£nDõÇ‘å1 Âfñ=Ëø¬ÕjíÂQ%^pHmRØK&ô~¾k(ÜBU#GÚL‰lnöûsùÕNån^ -¢îˆ&èÏW5¦Ý#éêàð nvƇÜü_<âK®y·.]@´<'p4Pxä-›û´l¸‹ukío¬"‘¢x/\'Vé´˜_¢Ê¹(øŠƒñíZ~йîc[v…I)ÐÓ¡![º†Ø.ªI!׿G[‡Èê’LïÚRÄ¥yS”Jßõº5O—ô^i#Z.E´vTµôåtõ»þ¸A-?Ä>üw<¥ûBÚ^Sp¥Û,á¡$~m*@ÀnVµÍêÃÜu„6+Ót`ÆÓ?«7Ÿ§Š¦ÏÔ¡2}Eo^¤,#iumë@•$œ…Uý·J5äËÞzòròªÅœý‡ÑÒýԃʿy%e;_yeˆ¼jd— Ú´q¿Â^%åý&™­Õëg؈Y˜¨EûiOÈÐVü· Ù×°ãÑ5ê™[zÔIoÔ+,q¥ðeg«tÈò›à£èÇ)Îz×deJ}-]^ö¹í€Ò”£òÑ”ÓD0 ˆV×&ƒ´Ç*)q¯<ÐDU+‡lTé}ºÇ*MÅEXÅü»P¦€†Có 07 Šªk™~æ­œá'* -\# Fuê¯^5«ïàrù5™k—!*hØF„MŸ)à õoº<4…W Q™\`:ßdž†ÆÉk¶Aœ\ÀT£®RÅ^.vÃÜ…†ÒèÕÚW–¢(W tŒC«ñzãûsØ­€²_5µ×~Ûß3UÞeªET£ËKi줸éÏÖ~Ü*8ü#¬UŸ}ç…LÑøPKÌ=æÕ|0Ñcpu.cppÅWkOÛXýlÿŠ©W ›¦Š²B⥖’á´ ‹eì›Ä+¿ÖZñßwîñãÚ®TmT5æÜ™sçΙ™ë€›ûn’À;øœúyN"p"’Àq‰~ù’@R<¾ ^:ˆ<<ÁŸÄ‡¡ãËòo~ä…G@IÜåþR¡È<òÈ×·ÓÙÕtj›ãéÕõ̪ÛÒ=ѶB?s7S'XÄÏ2<ßB9¶lkv;2ls22'†Ý·,c|1º­ùgþ"r‚ýåy#ùßaÂ0yþœ1W¬WW#™t¤]›ËXvÿSßõ/FF‡„¡å©Õ©&ý±aMûþ0.͉:HŸ’<žN5¶ËFøƒéGsXcfaà¡ö'ãÎÏ sÔnÃîn#´›ã#Y~ˆãIazêç8õuÔ()òˆ¿öâ"Ç¿5ù«,Ù6&Ú÷T£…=¯´¸ƒÖ“¥”äEŠ §éÉÏ 2ò3é&«œ 2Pà«œ?%„º=ƾêžå/>`%$Õèþ¸ŸœåNŽe„ØÅ2Ÿ&1ËF¯\dÞèkpg댂ž)ˆ£º©uçt4v€íPI_á§Ë/ÑÓµ’ýy-õOhДþÅT~l;OŸd Ã@éœ,Äoú,…ñ#g%”£Óu½äù-à[–Ðb÷-êTGÞQìaëRÌÝÄ::= >ËøGV.IrP;Q”ÏÜÁªé1›çFMñ‚’ªR€8ðÊÇ3à=ªZæ¥9µ¶¨N‹[C­{ÚÛÆõµöM²Ä”IIV9òó oýªÑ8°˜  ÒÄ@æ<š;:]'#ðn>5àgð@ühEF¼-ãä¦{L ”¤È–°³ƒ=`âõ€f›!-úåù=Hâ„#J™9áùÂé÷\…‘R–):Ÿ€ræ(˜?Vwí{­…È°B:q+DçˆW!‡÷šà¢T|x @µÁ–“"VRÕ& Ïr¯ŒŒÞJ¢+™n³ô‰õ¢è›-Óï›êB+l/?"žúÝÓ6{ì…Ñß·ÆµÉ âÓ·t5‰SX…a»Åþ×Ê%¬ ²"n‘Ó* X!èæ~‰ôŠ¡}vô®+,I; m¬Û/$íÌGX¥)-s@WÝÇœ-àò¡®®4ÚíušÿŸÆ¥§ûU}˸_mÛRUŒWÌÌc`ýT…Ê»Ãõe_ŠÖû5ê‰ÈH¿ÿÚ^,Ÿ {Õ=’œ°RÆ©& –NfâJ¼Å!VÅMÈ2Øx|Ó@ú†51Ø`4þ8ªc~6=ªWæÂvwIFØÊ–ÿ…ºÎú¨cúƒ†ÍºÙ2ÿ2°bØ5Îφ#öâ`"HÆF‡$(Ù¬¼£W{êà£(ª7üîn‹­ªÈMƒNéºa!KµÓ«‚ûðv±ÁàôôCMƒ7LHF¶ÍäX˜PÞzÊ×#°'Ky¯Œðµ°dÔ9ãééïÚÚ¡”àuý}åQ ôºG‡:¼| ÷͉²­\ݪuqt.‰$äXµ»mþygs„m)ÌÛ÷ôí¸2¤¿"5):!•dõðõJ2þƃ—{''Ùg'áöwzYHôBÒ†$tCað·T.IT` ›QN_uÞÒbî®kBz sèjI{5çÆ«yÙ6¢ {piÌ.ngFéÞ¹ç/§4fšbØT¿Àßp^³ýñðÛ ỂĽ/›b{°œ´ËÖ8 m+Éë­-m[µ)Íß[Æd¸†ÿPKÉ=çÞ{z"cpu.hÍZmwÚFþ ¿b ']a³‰“¸»ç`Pl¼³–Ý:i{æi0jõ–‘ §ü÷½#$ÐËÈ&iûÁ¶¸óÌç>÷Þ™ÇucnëdŽ·ï¦w7Ó)LïñUµ6Ã&ysµnÌ3èKi"Ýöï$üÐíàq_W‹Sz] #¸ÿc$÷/d©¹¸¹‘™ $–Œ)ŠÔÊ:IA'ý±¤Lû K“! ¦GU[3 šæØsãñå¢ñçyMînGe4PÒ,?Ë2lŸöËÅ¿Á½­sž«¾¤LFe¾æè»5]]Àørr?À¸þøm Pi¬àN’ñàf<ÉÒm#ÅÊϲbAclØ&“cKlõ ø«ú™>ÁXwvc0n²aóI]zYõ¹¡ª dUlYØ[ó¹I0qçjs³Î¬QýT­¨ž…„šËÐ3ôBl¢'5ôՎÚ 6ØShÕ„Y£q^E¨B‰P©çÕU"êa2I,~†NÞ`àkiDBŸªšÏ4j·2"Aýy~´”ÉÄžèùF.6QG/ZÍ´dÿ¢ ]kÆÄk¢šQŒ¬t”I÷­rnØ¡¼pýY1ª8˜VŒf[4*n4‡‚°µB¿1ã÷ߧÊ`:Ç÷2 âÐòxúóÚH3­ÀAa¯ô pÌo¥Ri£éôåê†{ÔýV©Äû,‰­zžáùœèò!%CÛ>Èù(4D¸éë¯i hXZ!¶òp½+‚?•9±µ]5—*³5øó¶ïoKÜT¹%UNžMøÛ “ÏPÀ'⟧|<áÿ;ùã[Õö.w!]Ž&€.]ß™N¼ Ü,Ù._¸FV¹÷×Ñ0u!«¾z…üT òN`êÈvàT#(ðˆŽtƒÍ7—U8š ÝxÊ2š9Ž‰qØë‰0ñ‡ŽMÎwªÝîö¢ä>PtÂíÞ´Ã<9T‡ãükª¶ 2H¤ÏÀ=úèúvZ:BëHAî·D…ÔOhäæD+gæ Ü`¤ ñ‚†í~3YþÈ |ø >xI…üÅ59½bÚI-¡Qù×Or¾ÊƒF€Ú Š˜ø…a_þ¤Ö¾Ì0 û0ÀÂæÝ çHø®X]j¥ÂMBÒK)Ž«*_š/v¿¯è>õ‹½G¬ª›  ôÏWÑ(êÃbQï}…â..õíWX îÿÜ#èù/u¾Þ7¶ŽÙuí’øƒô^ñ¥kä6žÕæ}}ïš±‹M_É"ôW–G +£÷R¦~Rïé{¾²¨$§E_…°Â#›<12Gé¡–6ÑFá7ÐŽMô¼ÆÀ¦Ä08GÙU¿‰ô¯u;dz#±{¬uŽuîl™4Õ1ëõð râ‘@ùŒIH»aøJzv€z}Áùß¼[•þÞ©²/\7·r2d¯m[_›$Œ¬Ü½“%x/‹²²Hã ù]!p9ëŧpÅKE2V%™HAàój_"2p¸¹°ŒÀµ…åDÐAo¬ ùˆgmÒ²*IGâ}#÷Š—]¨€“þ¤!@ÙËs‰&ØêïDopÓ‚¸ËŠŽàÕº,pEŠÑë›’'擃<Ÿ¸ò¤š¦ó„TúXÄö#Ü H誶NôíZl‰8õÕÎkù¡$ŸlÞëP}ÉC¥²šFŸy¢ÜÔ~±kþMaü:ëpí/ï*&¾Wˆ™0J*1ľR,Ĩ¢+GxšÁT$„‹¯N•î;Å"¡,Å*¡:ÇÜF´W´v}]´ž"ªr\tOŠæ30‹zq¥”• §VhOçPûkŽ=©N¹M΄36 ²n}¨rôdEÉÑÓ3¸zò¢èð“rÊU¿ËUÿŒ/³7 OO.Á;%y9-Ñ¿[¢ÿY¢s¼µ±ÇoDÊoÄÿîmIJÎãô]÷ÚzË…}AL8¥jÔ‰öiϧDµf¸ °¯¿ØH¶n|s7½¿ëÑ…nJa,l®¿™ú´OŠÃøá§?í&ò›È“ &Ln›ÍÓ(a®Æ/Õ »tT|âù•­»äi=>*¿=7+•ÔÚõz»l®xºeô̬³Í,7th%´,H°û9™ìžÀ½äWLÌÀÄ2X+k•ÁÚX;Su½’Q#– @ÛØ,·ÉUDJ"¶œú‡`½¼XÈ,•ü'âÝvÒÚ¡êÁNÚ;4Ï9Ù«tNÍ\Õ¥Ê~gÙõ²¬ÕÊÏ›™±ú1³ðdRL#Å]ÈVÙÚ…l§‘íåõš+H/ŸC# Ž,88²`od9ö¯³…Jg¦ÒßéÇÿŸí¦ÿPK=[•b•crc.cppÕY]\·‘}ÖüŠ›ÈŽ$+.~“QÀ‘&^ZÁˆµØ‚D`±È¨±£‘03¶ã5üßsnW]ÇÙ ÈK^V/­îžK‹çTSýé§Û¸¿?nO¶onO÷÷ófë7²}¼îcÊvºÙîßÍíãW|}›|xßñ »ý×Øþ›ÞŸîΟ\¼þì?®¾üâ³çWosõùË×—Ïo¿ýxÿá‹/^\|úh{ÓùznÖöüwÏŸÿowûÿûõõvwºù¾áoïçöu¿þjÞm—ï»ìŸlïûÿÌóIn>½nîî·o>ÜJðû2Áÿò—ïßÞwþý¶gÛwˆiÉ\ÛË/ß¾zùæÍ««·W¯_¼üìõÅú3Ù¿WŸlôçR¨jùüfNšÙùq~ӵ丟ßPÉ2¢k¯>ÙW(”ûŠuéC-‡žBÒ‡fŽ-õ MáZƒ×š ®=ê “$Íæ¦>TÄK«Ujœãð¬Mve°èF…«*ºB#^Nš;å„‹£Ïorgò´tÛ¸uíyF'SWp]ºÄ¢‹g™qê¶+Jä”tí$Ô4Šnòh5e]!Ç̽Íä’ìW+š¯Úsmj&]$—FÔtå@9±L®N+HÖ|U¡J²4“óô44ð8rs”4]’2E7-“ÝçR\ÑÓ†AaFÑÀ#Î5pñ$5-=lOÔ9eÖBâÔëÒÀ£gßjÖÀ…™GG”9Œè5]cqo©Y&¹²à\º­¯ä¹6ÍWZ”j%ÍäȄ䳦‹ñlÞ2éW^eTÍWª¹Æá4“Ã!é Î9{ šI£é d8TTWñžXO;—$G^s\»šª&…2gNnª¯»žvV®ƒž¶T*£u œÑjAñÞ2µ^«¡z:š­:=mY¹nQªa{ ¼9€w4=ìÌ9¤AÎP­éânä‘]Ömü€#ŻϞ(jŽó ÜÒc“ë©è¶ÕS]H¥>„1é¶91Iš.ç¹Ì–,“•yrš¯5Õ¡h&‘{q"zÏ.I÷5“uH(c&û#k&£°Ï.ià¡ïÜx<ˆŠ¬ç@Óª»¬ž¢DjK¢wPlĬ™DNóŠKCn(ˆ†êó”¶4ð.¹Ôõ´Ò3árï1RôRôžC j$cw§GÒÓŠ”1ô´‰(tm_ÈG×5]< Àv–ÉÑhàtÛTråä5)žòª‰u[n9K$]{  ÌØ “¸Ö¹i¾|õ¦™ÄõQ«^Á1Š”^Y3™‡ ÎjµŸÍ$–4‚æk÷<ºxmš”Öy1Š 1ËÊ¡¢:²ßô´³KŠ%hàMÄ—Ò5]d·n=+h\õ´3  ³ÓÀ[Ì1pÕÀI²äô°¥çžz¯Æ¬Hs,ÒÀQÈÚZM§NÔ§Wp´¨†¾¥ÐUžZ…©…j»“8¤™ÌòðK·]%ûT’®])§ŒhÌjy„\tñ<3Sžºíš½çÚ €݈¤œÃØ]DbšÉÕ¸ Êž>4yNœI*¸§5]À*Õ)–IËÞ¸ŠªÔá‡f2.YË'=¬8æ\–U˜žyŠxXœíWªìCŽšcA7ô¨êºÑ¢ŽV0ŒY™BìKOE\•žÇ¡¹†Þ+Ž»’uT—gÅ Ý97žÅÏÙq¨š8qº­Oy‰ïºvÂuMÄgÌ4Jiº83q,¤Û¢î{—ÙˆšÏyÍñHŒŠÃV«§#öšIÏSoš¯48 tk&ŠÃZ]ÓÅIEÎ2éÑÌú„>Ä2ûtVàUFiàsä°¼×t•”{Í2IÖ•õ¡Ab×À'ÓÎ ¼xHÀRõ°dÅÇzVâ{ÕÀ'únéN/ ŽqWp%Y7òâël†ê™$­ÖR‡Œ¹XOK,,Ë›Óþ¥kCüÅé£Õê\E8,]Ü-é5dݶ:ž‚KÂ¥x´Eõb*eZ&]åKÑmw¹úÔ|­Eh£E3™3e´ M—ÛË,'Ëd]95HªÙcÍ$(¯% ù7VÔLZá° #…PÀ¦'Å’ž64TÀ04Ç7ásÖ¤@*‘ƒp1T·Üb‰zÚ0QŠèiû—{ÔÀ¢.uQ¼£4£ªeCu(R/=mo8êL¸LfHZ먅ýXE‹ZšÖš‡Ó+ÓÅGç>|ÕmÎÐÐàï‘c]sÌ]œ¶ 3™ÈM·MÝ°x“AZ.¬Û‚"¹t¯éB?v±³e2IÆÅ“æË÷¼<7Í$:øôžG€Âž]3™:AÇ:Ã$œ†Ÿ«Ê«‹ŸÍë»ùwÆ ®ºÁðâ¡‘hÚÅq‡ÔkÍêhÛ…ÂaZêZñ(…ÔS³™i ÖÉꨯUØ:n £XrÝœ Ö‰ ¦¸Ho"Σ8r¶Î °NƼâÑYçaœ ey5ƒ3j'$«±c׫”ÍTÈÔ¶Ž«Go™ÕÚØÞA¤[DÓˆ"¦…à“D“ŽåÖÉn1ï®â(ƒP™ÙüúuC}4 }““á%®]•Z1ÁÅCdf[!C^Ð2ÓU ëTu…Á™§é‹9 F˜ÑÁš‚À·ÃÇúº{05OEfMhÁ6í¬Ôt1zUïé0oÐ;‡óÝ}!ŸëѾÞ1ó"$h4å1äì‰Ï1¤4ä¨Ð{"Í5(Ng–£§Ò¬|Ô 0ÂÊV%©b6¥Å¡¡;lS´Òéa›8$s& %»k„‘‹P­.Cu“·Ž„”byŸ ‹NÃĺþ›J`˜IrÕ]MjwµìÆ!¡½äÌ,,P}È;HÞ"ô*Pm]±»}T` Ö¨6ÏÝ¼Û =ÍT[= PòõP(¸ÓþÈ':O¯ j>@«à°;Ú9DŽ•·ÝíÖ¡Cmî°ûzPØVÀEºÝ<™OAÕVqãqÖ=QØ x·~)ð<9[ )¨¼icx0\ ‚2€#› ´lÕ<1ü(lˆš(|à¢òá?PÚøÒå"0(œlF‚ž{V?gf¥8äð3°Á¨6fÍßÁLl$˜[›ô@bõN…ôh5PH8þ1e°NÝ:8dòj³Ï½uæ ²6!™+dœyÀ»‚ÃC@•ŽQÿ Á¡‡[àG‘1GŸ;À-ëŠ=%kpЛrß»9ý Îêno·å' Ú$X€^æS¨ ¤¤i½óžÏÖòŒjØ&0Õ†\uÀ:m ðÆIlÜñ [ ð) ªUû ðƒÃÖ 4@Ôr¸É[+%´ì:Åæ°M«™Ü§E–M—¶=íÊ!)PçÒ<Ô5„‚7;ã WÁÆô@7ƒ©&^Ð!x›WÁ6 ñ$±ÔèsÄÀ(msÚ´®¤3¡\:È`â“]› ªQº–™X(ð*ØØ "÷Îf‡k¢ZdÓY‘°N«š¾€s¶Ô*XæLÙB]€¨fò€pà]ßL‚$6šI8Hré;øc1ÀÜ€YÍ\ôê¬&ÛOÐѦn ¦Š²­0wó—mœV&*¼3é1 ÕA’j.cyÐÇt$z˜uŒfJ* ]>Æt\6ì D­6]€ð9f‡B½[µ_9v°$›¯+ð6áaÂ:Ù`%Àà\µáU…’<,GmSÍhî>Å -nWÝÙ&^5$1ëóúøÃ0”féßÁÇÎfk ÚÛ@i€"4óÉÆÀ»u^_÷rcS¼æSIlÈ}þX °M`–ÍFÝXà\:L ¥×FÝN Ž§Ù¦áj¶‘%‚6Çm(w@µ­@½Þ$9lP=ÌÑBÊN›%£T Ú<Hx?bð¬Ë ¤ƒ…‡m9DesÕ»y¶ÙGÛyî›eÕ¶|ZŠÊ\ ªM„œ,pØŒtDë 6B9‡:¬øª ¡qL!& uwfUá€jÓÆìQãÌoOW Pmˆ*°M¼A¶b— qhIpØ–ƒïël5Püœ;bÀT›7Ø&oNN‚e3§ÓX °Ñ©ªfÍ}¾mÓ¹ÛT›-ð€÷ÇùÝ1ØÀòx·¢ÄT7›{—À¡QÉ@T›½ئ,íð‚p:ÑVXphà°ÅúQmº[¸Z¹Yc¨6xm *&Ø ¨ßÍ“ý‚€Ð»Í@ ÖÉ|â À»Í«ÒB¶J‹š™x±Q]*@µÙÐx·²;KQmòWqB7â1p ¦Ú ¬,†²m¾×] °5dDµªÌŸÓœÖÅ÷O/.ìªóËåËï.ünÞÍûˇO/¾¿¸øúÃIŽ±þó£ôûy©¿o{t÷Évwúßùö~»9?j¿zÛ±=ÛÞ¿Å+vx°>Ü^>Ý~òòî³ëÓŸn¦üJÿì×—w·Ÿÿ|»Ù~½ÑÓíæÉ“‡Ïî?˜7~ûòõ‹«ÿ¾Äç·?bËÇÿ€WýêËùÛ7W/Î_î;}óît=·K¬øl‹Xí;[ð϶G—óÃÜ£‡wOÿÉnÿh›ÿOÝlOýwÛcýß÷?ÊÏ¿ ÕçÛÅãç;þ?HysûÕÍVä·§›~}©Xy×ïÞý—ý匘7ïn?|ór½¼ùº_Ÿä‡¿Ä÷—ç?úë^¸D åõÕ篞žaµ]Úz§g@ÐéWû;¼>~¼oßð÷§ýG×ÏçýóÛñ„qy:/øcˆÿõá«×/.þPK=ôIæcrc.h}S]o›0}ŽÅ]"UPMë”®ÓºJ”Ð)£(0i[•!0&XÙ¦[[õ¿Ï`š¯MõH¾çœ{|ì;¢9ËHÎò{ÝAì,óqÃû?y¿V«œ·^¼0^xQ´pcןz¶¿ç¥¥zþÔýf` '‚y„çÞMäN{ÌÕ|RR òŠ’B?¼.ty©…XFs„ÎÎÞ´(p ‚‰¦')qS&’Ö á2B‹À6MZR óDO˜Èk^iÜÒµ 삾õÃÈö#cêÍÜ0 ½®JJytz†i¡Á}M3øºÉI nú œR¶iä[ô‘ÄJÂÖ²Øâ#Þ0¬Ù eIihF¡Lm í¯…7LÐ5#P&aJ×DÈP• t³'NdÃìZÏÔR ÷(\$N!ìöìr]s*‹ÊOªVèEbØj¸åg“‰œ²53[ÿWU©ds­Ž¨Ï™ªŽUŒ9VQV±LÒ»ý'ÐULø éJ}ï^×”ò šépÜ ÷¡ÑckF­yÒ“Í;ºj­m8½W®&½Ç%D{Æv£Ñ¶Cƒƒ4ûñÑæÇWꞶ{Šo¡gk Õì —ÇúPKÙ{TBdmIʤ/ cryptdll.dspíZ]oÛ8}žù\O’ÁŒí8Ýb&^àXJjŒ¿`;ÛIQ@ )Úd-‰Jj’¿—’eËãÔ™\Nû°EƒJϽ‡yOÔïÉP2­µL‰Ã¿ð@Å\“YšùR‘‰VŸ9KÉ 8ù‰ŒhÈ;5¦ŸâÔ‚´L([Ó'㇈ëοÞþzzòý±€·úÑ”ûä:“Ÿþ‘Ü(Ò”ü›ëDªˆ¼«7›&Î?gLFã9qþnOOLó¼;½ßO\Rû £Ë9{üùÝ9qž"JöÓ@Fk2 MõS4›Í–Áõnn;%s ^@¾ÈV§'ÿº³Y÷Ö%s!#•J¾Ð@ú$¤k¾šu2Wd‘³NM·x37Y"£ »¿¹?VBe ‡~œ¸±Ò)n¢¦ÂF>1?:‹*ˆÊe4–d;Ùu Q«?ßû^e„ш$1grùÌ™Š–r•ÁL›ù|<2¹¢-Ñ xñD|`–?3|C /Àl@š†’p #˜xU„?Ò0øÕ«¸›»µ³ÿjÏGš¨$‘ 3gBIƲ„äûC£úk4SMyÀiÂkälÿøf|/¯ ó£! öè€Åz¾æ+•[Í4L¦ã éz˜pÝËÇëð˜G>˜„ihn;Íó ÐlLR«íµ£Á„¦"ЛL:,¨óG~z2œ:¡ô7wÓY¯£Yq Üú7„ÔÞœÁÛ:¯‘NçÈ<ìó|×Ý™Kîî ozzÛæ|ž¼b öGwgiœ¥ž#õ.çyy:o—® éG)×!÷%“WçT¯ø&×îÑ!÷ã´«ŒÁà0×!¿ç»­"¥¹W “©’ã€i×qŠ1ÀË$Hj¥Hc8'—¤qû;iŒ[¤áÀ"ì.[µürä¸×w·ÅµíÎøÃls7¼î•—w³)Ð+nzÓûÉÜuŸŒ§sÓåBß8¤ÁJ{nÿY!1-ˆ|”@æ~­v¯`4žL*Œ€Â¶qÔ½¸^o<œ úÝQÏ… ó÷ÞM2ó.Þ6½Vç"r7s½ÉÔ5ýú×ñÞ»]ÇæÃËj1uQ+Fù1l5›•ÁæS{f7âê€ÂuúrÑjÂðÌÂ+qHž 6$i ]o›¿†¿–¾þüzÖ»lu 3šUìèJÜüiÉhûd¿qÐý! Ö¯ðÅ3²æ:âÁe«#0*§7—+_n®`HI¬T߀|øÁjó„ú_h\vKÊ8*à»+š¥eøLúE«¿`e¸dñæf;¿¦@5@»¨ÔUÿòçw%õ ë½Ì[”©ÛW5˜ÉÖ/Mó§¶ ÕÙýûAICeéUu+7ò²£â¸žŸˆ*N¯4_šì³»ëù´Û›—±¿¸ŠTÄwE¿—%© ‹³Ðé Øìú§JüÓ“¢ ˜B¾ÿäS5óéI?‚‚ôb¯ÙønÚs;Pà·ýÏóB-EúóF^÷o\‘7gô܈C4wúSЃº+®OO¾ëÍ÷’ò$5§ ÏÌ蛳Ý0ÎA÷¾ã éæ)1 ȯäHzÓÝL™ ‡ý ¹r3÷eÉ*OhÁºx…`•É^)WÏÁlÄêâ«bõ§LÏKÕŸ;ýBåoD"܈DÂ?Є¿S±n?W­*£ªtÉ*ÿëªeFú—”Ë{½ryXåò^P.ïÿÊUγZzÓͯ§Vr&#¦yÈ£” @/)[¾ó¿™®m,÷ªåí/hÚs}¾±¢URþwôl䀜Ua‘¨h)|ÞGöÕ.»r^D½Õ*‹Im¦2Íxþk˜¤ª_Ò,H=xâñâ¸ÍÚìñ±­YÛç˶n+?hƒ‰l‹øs{AÓJìJPró†êŸh°â NuVŽ¯ë_ÀÇTÓ ‰ðØ,à¿Ñx³7™ò9:[0³‚Ðp†Ÿ7&h•3Á°bgx¬ÙP#Ñ|žØ`“xh”Øm±Î?æXtÏÌÙ7Áo^ÎZ‘¸¨¢ð/‚‡ máѱ†}âÓ›ß'6h(à6ø8ó¨Þ(':ÀÊ¢n­–knµŒóE‡ ø#kS0…NeÈ5/Á®lð°âMÄ7©A¡Lð3*›zþ‘ñ /àÑNJ?¡(ÊñeD%:Z¡ÑÆin°['}Ï6qÍ’˜úxFI‚_¡q¶Xsü‹°[šF~n2Ñü”.lDAËÏ‘O¹‹¥¤-ú MµÁ^âÁÒ|,ÅÃ×2þLÙ ÕLÆ¿YRíæ[⑦)w”ó=§>È 榌¼àÁ`Í ¬uÌ­§°3žH¸^EàÊÑÜÁµ +Ï*ì«°ñ«íV…Wx§Š„æ_ê±àÒ¨ ´MX›)Ð&S m¤À›Hag!Ú@ ;(,쟰2ÂÊú!ÑAªò!á+tÈMŸ°³|møÞî +³&ì¬úXÚ¹XGµLŽÞPûÇhæ…qÀ‚¿ ‘[ã)𶠕>vª ¿*ÐnUX¹Rac+……©v–RØùAvƒíqH8š.À•¬ñpü›2VRर±‘ÂÎD"á!ÕiœbE&I}°Žhðƾ ;óŠƒ?(}¤‚=c{žïÍW`ÍŽ+¿õwÛÿüPKÈ=7\pü µ?cryptdll.vcprojíkoÛ8†?g€ù†§(Z ê[²Nv_Òp#NÚî €AS´¥FY’Ê8³»ÿ}IQ¶sm\n§QgÞMt9‡¢¾‘hjû×yW.˜TOwªÍZ£Za)åA”Îvª³Ik³ÙªþúÏØ~©ŒÄ#Jþ‘QýãÅÖÉ¥`;UgRéþüsÕœz·(ôU­Ñ°IbŒ¨¼š Q]y¿9ÝïíTÿÝïô^½l½Þ|ñòõîë[ÿxÙyÑyÕÜzñºù²ßlíî¾îtöþkÝŽ9׶0%½QâˆÒ§$îTkö©üÆö0&zÊe¢ìÞj×îõz¥›-k¿Q¿×fþrke±]¿Vèö çñ^3·W¿¾Ûåé4še’h’¢׎]¹Ê1‹Qì?«meZdºI-./wªOž-.n}žŸõƒ±3:{òìZÁùyWÊ~ª™LXÍ>S–Ùwí²Ø½¯¼kÇ] ´W ™Œ4 LI‚I}9 ÓÊ^ë]w?UšÄ±©ÁówÝâR=6%Y¬ÕÙ©˜I°=É“wÝ_šµ %LÊ{ªØÑô`¯»Sm¸»'ƒƒ(’覺ÇYz%lM$‘—§ŠÌL…¦$V¬¨nH$¡&#¦—5}ò˜™J˜«&GBÛ¢òcú‚3ÈÛʵn¾U4’­9ëdQô/Xªíig_¿×¡›)Í“Ügen‚˜$$ QºHÂ3îRº<8Ëó›)]Iq\yú)ãºýäÙ ‘3¦mª?w‡žþ4oôòŸ»mFCn=*OYåéL·—~Gy*>g‹îS3Æ5k|µ”¢’»AÙ¨¸ÇKƒˆˆ™æ,N»ÌË›·(ûv©EçÃÁ G4yÃRfŠËu"z°ß\ ¥i“,”)Å¥I(“yoÛ©öúÓ7…ÕÁ¹IU“$&ðÂ4õ$6Ei™ÜeBHSÄH©3Ñ!©©Ð5 ö~zIž&¦ñ—¹²a;A‘®Žµ¼g=º¾ ŠŽ'…Ç[f²]ZP8‡“h`ëm̯èJóØÎ?rý·¤ÕhT tWf›^›¬ÛËRj÷炤ŽØEßØè§Ä„Ç`CFæ ]XªkáØ#\ŽL<’#ÁX°r?J"½gúòÈ¢çºß­Õ~¿¸ÙjͯÞÑûQ{|::6±lwÿ5<9Çýãã“Ñ•‡»AÜ=:öw»}ã{òv¼·?›[qk§Ù>õÇÃã¾µÙô{ã·ýÝ^ÿx´h{ûAgCØ|ø»RYýbË’?E„° ›ž|~ÓÝ™õÓ¤”€2Ë=r-ÚÃàÍ…ºö \f¬¢yëÔI(y63Ãœ a-\Zå(³]©cRn•X«®yA_5j"Xdà{"SSß¼î;Õ͵»AM²Ù~jÇ<¯öòe Ÿéµ$5hŽ™â™¤ìv>ßïz¿Ïš¿k™Lš²šÍ+jŠ´¹6à­ñµ:9.Ú6¸†åkG»à"»õ]jÙø“¢ñí…°ìµ——^5v̦L®[¬/RÎfa‹­™IùùVëuÃþ[à#\êe—¸ó:q4y(j»6lkÑž¤ÑÔŒƒëØ~èós¶ŽiGÑuM÷æ].Ö1ÜÂÈßh­—ÖC®ôýZb»~Mh­'RÒÒÒ±ÄÒqÒÒñ3Ò¢¢ð¯* æcXóˆÅo)ó¼Á}Æo!O ¶‘¡ÿo%8~䛈yg-‹l|‰Ì{ ¤!×Ì ÑB™uCFÏÕJåÜlMÜÄ{t½6†^ÃM¼¿™.Ã-<¨2¨²ÇVe›Pe¥VeÐ[Ð[¸?æ¯ÃnröV-ëLnì/göå›FU\Qo£¼·Urwig²S¥B´i›ÎçmIÛ›¶e›q;2ÿCñ±=!úš,±%ðcF£EÌMk$ñŒ™ü©Q7çqéà_Ô³¾WýV¼¾,K…Ž0ú„ñÖíç¯ÆÆÃa—*ŒŸU=_+È_5Sÿn!v'†²0a& 2¨ *ƒÊ r)¨¬R@d¹ @®‘L‡,¥·°¼–»½CGyÀu@PÔõ2@N¨} &ƒÉ`2˜ &—BhSšø‰lÚGé±Ðt@ÐKô»Döº¾"ó 쬤8š`0À`€Áƒƒ2 ƒ:d@. •’d H’Kä<Ácð<.ã@ömŸ»¿æÞ°¿¯0èÓæ5€ÿ'6Áz‚ÂwءССÐìR(tF[øº$ˆ "ƒÈ rIˆìV•AePT•ËAeLõd@.EZ~ßo11Ìïsè:€ èeúÔ.ž $É@2 $—ÉöEÌ€2  (Ê€r9 ,”©  (Ê€2 \(Û·z‚Ê 2¨ *ƒÊåX?oæ» êlŠyÑ€9`Òæå€ùl*ò‰Ñ 2¨ *ƒÊ r¨²9€ È2€\ ãµ\ 2ˆ \€È¥¹ J[¼ô»¥šÍîpÓÁt0LÓé‘f2$ ËMcuS¬n ªcuS¬njF…$R¸÷b—B§'¯M’dðH. ’?e,c`2˜ &ƒÉ`r˜œNtȸ¼•AePT•Ë@eNÖ(‘AdD.‘•Lg@2 $É@r,(&á}åÙaMûû 3€î=¬ à?M°Þ€pN• ¨t¨t¨t@»ßJy~Rd“s†G“à9xžƒç¥à9æðÉ@2x$—É’¤01•AePT•KAå@“ ^l *ƒÊ@¨\*GÓ€0hePT•AårPs«d´KdEd@ärL£“¿ûM¢S!P”å@9P^ ”«(1¦ÐÉ`2˜ &—ƒÉç‘øHè9¨ *ƒÊ 2¨\ *kI#â ˆ 2¨ *ƒÊ¥ ²–AÌ)Á:PT•Aå’< 41â¸FTâEåµ›(Sš',Šƒkmd.!i0ˆRc–Ä/·jlÎ*uZ©§<æ3^©ïñ§Ÿ2®MˆöSÝ‹äóE•ùä£;S©ÿUVF"ÓöÃ=wGžþ4oôòŸ»íUfdÚX™pÞUèc%ñ_0BWr0ßÔLº·Û¸Ïï÷ªXsåŠw&&EC·ÿ@&¦–_òœ›Ä36‘ÄÓUI/_9KÍçö«²J}Üjg$Ó!K©óÄôuÊæãK'4!ԯʔz…—†$MY¬nÊ«k2ÚJýüò€r?_áå–(ÒòrniDߩŬ§£²§«PFy¹ÆZÚÇß~]kæÇÙÔ/‡fS‘'‘oÈæ^nžÀŠRÍfLz¹š4‰òbAxÕ6[¶ˆÑÕ¡§¯_G±Žs!ü*ìVKòò¼ðq[¾ÎËÃ7éŒ_xÖ½RÁÃÑ.üíãV,ë…ž|ÃÐ{ COïÔY.ãã»øz¬¯_kJ?aOˆõð3êwszîéëÙ˜v®››*æ㹘Ðà㛩…öÊw¥*„Ÿgñ°ÏÃwyKÚÃ÷w.?ǯ[íºBîïÜ|nI¯ü‰»*Åm©|óMÌ'$vÛõÕÎvý]¤2tD|(ùGFµ9þ?PK=Oy{6 æ cryptest.dspíY[oâF~n¤ü‡So6« æ’®vi©D Dh¹XØé6U%k°˜Æö¸c;—þúžñÌ%@Xõ!RPÆãs¾óÍí|gàô™-xÈ'´èuy@Qì0ºàS;‚s)œÃ€x´¡Øâ1ˆh)Ø£û–L) ï}*¿^üvzòî9À+Šv$¢\ÆÌuàÐáÂ#üNEȸŸJå²ÄùðZC Mh·º&>žžÈn³9º2oô6(ߘ_«Âû‡ÏŸÎ@ã~È‘e3\f“(?”+åštÓ:Wœ8òN=[tOOO~ì· £yÕsÆBÀ?ŸG@àŽ¸ÌÜÒ ²,ÉaœŽ¤YMM2 ƒ~ókûc*)ÚQh?\DÐÏPÀæžG|äGÄ~Á£ÐLÐ@À|®KHC)m¶¾á1Øć0 6›<"s›û6E2 p?£¾ŒåωœÇà ³ääë\;ÀÙô”9a—ù8¸R@ˆ¸´þ"îr±u–W@ÙŒ¤ó0dc9g3Îlƒ/ˆ§hlÕëw½d5FÔ¥$¤ ¼ã?Guë^:Û<ÒëAìA ÓCxI§ÌÏóƒìÐGCš®Ëïu*´d•Z4 ¾C}›áâ•çF†m[ÒQfP”¥þ·‰«“h–¼Ðt½a»%ú@OOF†ÖvÚF6Ý€òÓ{ÜUg 4»­wJ= vÙ4ÚpR«ßÑ ÜæÝÉY=6D,ÓOL†qÄ‘ÕbbÙ²¬$²Õéê†U¹([‹¸Eß®QáQ‡aÜaêsA­4·H’«ôL"¦4£·ð]îó#-R3-œP+ÐuZëcÚæðÌÖØ7[­t\¸!@õ¹Ë§Ô«Ÿñó/¨}Ôo5lÿêŸ ÔaÔîéî VU’æ Õ¾¼¾JÛ–6Ã^;{ê_j6oзÓB¯Z.ƒjçQŸ8*­àg\] §nts¨ëV·¯G¦¡¬rÛÆçb‰O2 x@uQÜ.Ê_@uæs£§ß_Z­Ú‡¶Tµô,p“·ùpço–;{ÝÁW„@5¸]óOßÁ->ukÕ’‹«Š:(²æÔaYëžùaÀ¹›< À8î4{Cœ;äfጺ9f¤E‹ÄQ3'íuÆvn€M;Ⱦ…U+kÎ×1ŒÇácQ¯ng¹Nuä!Õo†:WïÖ>ÂõÔÍú`ˆkõås>Îlˆ‡ ò8ª+òhdgBë$Î'.=‚˜—l”%2éèÝI]­#éח権™9G5pÆuŸûȃù¶ õ#âÖi¸È߆,ˆ›c&.Éé‰1¼ií&×®Ç_&ã3Ü:º =\tKóœ°AQ’ÓjiYý'f“H2&%ÇuK?$æy™’ÖP,‚G‹º“¬„JŠ é†.yuõ¸H½ù8"H˜àz.!ðÌ’€Yò¼šÖjI]‰³V‚îD¢¯‡J±d$$»‘Œ‹¸!1¦¬úƲàñCæPXI€9têû. C £¶‰)ÇÑípJr‚ÛX3mš^Ô®vÏh¿H¿ò*ioõªì£^yÔ}µk£ÿ1•«²ƒr­Ú¦[«æ‡«Vßt rÕÅ#ì¬IÂkË•³A¯ØZ¨ï"UÖ©²Þ¤jQÁ\=´Ò :ºp%‡bU¶–,‰XvßX¥õ&Aÿw ú.÷¦ò®³jxŒKÎN›c\frE8äò²Y^r[ÙŒ_àóv/y¥dÿ\ö-¦Ý•ü½ÄcÇdî‘`ûç…wŠ—Ô±Ç/^+»¦Šrüjs‡ óõ«Êä€{…~@QùTÙ­Š|åòV/î•B¶‰¯W^^ˆnI'ƒf“â×ËéæO{Òo‹wû–wëÅ|Âv¸9FÊ÷Jð8ÅÀRϦ qg©tjÑ Á‚Ïê`åHñ8—ì ø¥4+øgŽòG1é—•Á¥¿ˆ3ã¶4ŸWuEÃmÞcêÛ³½gûûV÷¥,In{¸îAþ„Äî èô 9g·Ê¡ÕCj‡Ð'÷ŸìJN]þ§ŒôiþûÔPK=zt a cryptest.dswÍRÁNƒ@½“ðc½jÓÄê“*K%V @äbÒl—±ÁnY² ¦!ü{×ML¥LŠB¼–`ár‘£„°|OR±ë"§ ÁN9^€-䆖ðŒ²HE7ÃÑH×Î!ž®ãÎ °jŸ´É&þ{Hƒ(šÜ]Æӧͳ²©gâzpn" Ì‘ƒ€=›»À…† 1'†é8Èuý—Éxt“G_òžèmþèÑÝt¿ i’Å;°$Í—ø™›gDßáT‘k.p<ÛØÄ–mÐÆþì…ŸÛÈ‘d”3.S*Ñ$=kÄÇE„r믑e›ÁÈ3“p¼c{-f q±pFü7„6þO¢p}Öˆ‹ å6 þþžj•‹i8 Z˜@`. OcŽ €8ãbž¹ ¦e*”J¨[²R m¼^ªÏ[¯"¾ï}pÊöä!˜í·á‡‡h•n¹›¼'ÓÓ¦,q®»¿Â½eòÅÂÓeñÏÜ>/ññÛÂý=øúx`qªU GrlÃteûÑUB›b”–ZŽÕâ²#U|Y•Oó’” P+H^°Žzð©X±dZPwêðPOowõ ö ¹Ç0 ¦º"‹ËÓW.¹4©š“$§ñ¥B¶f°²‚ =¡.ft0]KMSʵÖNªðK΢« W9Tøù÷¦··}×jœÆßdÀ(ÕèÙá×LW9‚Œÿö!vù¯ïšÿÊÓÚýWèÿ:aÿ•§µû¯ «ÛeImþ+ÈQò_¥BþÛ3‚°ÿ*ðüWšÞÓãúoï(þ«CÈÅ"Èøob—ÿÊñ®ù¯<­Ý….´„ýWžÖî¿2¬nÿ•%µù¯ Gþž@ ¬¬ Ü=t0]eZYÞÕÕ½Ñ×\ ¬ÚëË;´¢ÃÊ(¢ÝÕ ÚÓÝëCÌ4NO×ûå[ò/ap~þÎÊwøÎý’48ÏŒG¯PKÛ{TB9ì( ( ° cryptest.vcprojí]moÛ8þœö?¾bÑb/Žß’¦hr‹ÄŽ{œÆˆÓäöÀ %ÚfC‰*I9ɽü÷Jò[²Nœx¶uó¥ä™‡CÎÏ#Ve÷~» ¥7âÚíÊÅRÁ㑯 ö ƒ^¥Z®~ûÛÏ?í]“0Ù±I T[«¯Ü·?ÿ´‘_ßÅ|¿™xõ_-ÀOcÐÝb©ä|f!ùú.¶ÜØÂÔûÓ—ãÆ~áߎšµíÍ݇µÍÚîû›Zs³^©Wkåòn­ÞÜþ¯s;SÊ:03ÿbÇ÷[Êg²Íìp¿Pt ø½¶d¶¯thÜÝôÖÝäq]Š¨Zqö[ mnwjS‹½­9нs¥dSHžÝmÍßÖUÔƒD3 C’1÷l¦•3.93ü?Óˆ6N'¶!4Œ–Òwû…7oÇ;ŸwW™ÁÕ›·s éoÂqd¹y ˜åàÀ}–“ñí"¼¹çYúËã–†\ Ë@Š¹¶w!çÖ¸¶.êÇ‘±LJˆàÝE=oªÁû,‘Ö\}‰š¼©UxQ_.ŽL &ƒýbøiÿ¤Yß/”²ç­‰Pü‹›úY‹·DO3}÷Å°ÔgÒð<Ü!Ó̇!èp»_ÈGõr¨$‡  Õð4¶*íΤ+iž²Ì¦Wy‚\äü028ñȺŸ3û­…õÄX¦>˘ÿã¤Õ`–}â‡VzŸKÞëp=¾ëÒíݳ|OŽ­©Ý†Ëg>”™Eñª~ž—åÖxº­ìåöç6íª=3r4ZuÆ`>ÜÆA7úLº\À,Ù/lý3¬•J^n0Ÿ¢<‡PnRD¼™D¾{~t³ÈÌE¬'9Ô¿ð‹?¶x«>Æ…mBð¶n¦Ìÿº¸PfJ V3õêsc”†š†ÚÌÛùÜ8:üòéc·~ú¹sÚ:úxyüy<±7:.¬A†!]qg…’¶Ó’ž”}ÞŸq7Z|ÄeKD×÷Ýa¾@@~6ÎA–¡)È%Óx¤Þû…ê8˜$Ž5Äß±LÛ$>dQäœfP¼— Ž#·`¤#ÐL/&T‹`NgܨDûüaþ».öyjÈs«:¬.‰v+T©úd é†sé™íŒÔqƒÇ< €N‡TÐó«•¢=Ï]úq~si*Ýìré,äs›ßÏÆœQ'éuîŒåád9Ï ~Æû\C\.¬ùiR?=iœ7•Ì@å©Þ¸î/µÂ°HôaÕXjõk€ù5_ÆôÐøËš6oë*^Æð ŽA»ˆ¾àË®»h©îÂ%+¦­Œ]Ì{[sÔºœT  $¾«P`zÀíQ4ZE®þ§\Bbþ×õR™ÙQ4dÀ›l:I=Ò²/‘† ¬!òµâ„ùC˜k€÷ž´ÅZk‹F«µyÆJ[ï%;àÞÍÅFîNú‚ôÆFDוVV™]Ú”øƒ¢y†ê¨ŸýÞ>?m·»Ç'íÓ³óN¦>&b„6)^“À€µ0 Y´R‚åþPyçCa<v‰ô4ÿ–Àº ÝœQq\ ¤,þò—ÛRã£ûóàcêù»J<ŸE^Ï-ž°ÞôÏpÙ÷IñìgàíÅÙúWOé@ªg™ˆ<F|Ó¡Yó¸ÝñʵÒfÅ1)à‚Àƒi]ôŽû®¡‡­>€uíC/`Ô\4àë݈$RÖëq×e# ˜6mkÒÊœ$’×T:KŒÌ¬ ÙÜà i¹h¶)T>áÆš¾y{š2ò;Ú%"%÷„’[~Èté¸ï¾OD$I<’x$ñÖKâÑ&Þë•~i¼t /u&á·HøÑþÜñ–ÖͺH·ÒSÒ­ôé¶ó»ÏÑ]÷ÕUù‡È¦ÚšÉ¦.É&’Mk'›H引ó¢í-Ò8¤q÷®Hþ¼ ùS%ùCò‡äÏS»F´ùóÊdѳw|èëpF«mþ¬¥âA4øö"ýòø÷Õ´Éóg¨œÿ‹ï«‰LךLéZ•®Á±,íÒKê«áÕ{²CQ¦_Ÿd&÷î'§§¤—À3l|y¸H)3'£ÌVÇ€Ù9.q(ù*ÂXňçgÃ\Í`\1nŠö6÷»n9ßçÁH‰ãC¥ ËQ`BæcàRà u`L·\Ý©b`qv‹cÄ Âà¤~ˆ”úi”ÌG%²QJè tGÈ14£b<ÆŠ¯}Sî–»Ûh€%ƒúÅÀËJ g‡(8C†SEÂñ™¬ @)ÃC%×`–£ “µHëÛ çÔ ÎPˤÙcXé%§2«“¾”xuð{2ËãÅáRJ‹Cå;‡¹ 2û‡»-œ‚7q•¤O¼ËÞY-Ož/|¯[lÝzéóº0Ù4zYþü@ÿ§þÃ^ù±½Y1kÑ—›‡Ñ—Òì jV¾kO^}*Ö{ü—"»ü!Ñ Ñ Ñ Ñ Ñ Ñ &­ _òò•ºVPÒRÞ³,ý»<"4"4"4"4"4"4B ¤$b!b!b!b!b!bÁ#–>K?Y}É»R_ĆÉ‘‘‘‘‘‘)i> ·"""""FQN€P€Á È`äÃ(ÅðÛ¥_€ƒRŠ‘F 'Ò(ÑhÖ(ñ8 œˆü FÚµ¿³ƒ#¾Fã@H$88Ù2¬V*Å=, ,?« i}ƒ3Ð7(ãlXŸkŒJ4\Ç<²«s~H ¾FéÚµˆ¿2ÿzu o Ó|´z ÙÕf¸ú%î4ý•Qn­†—¨÷e jíQ’Ÿ}qÏg‡<’ªÇd~ôôfoëB˜„ÉŽM¡òÿ–žÿPK=^;y”lZcryptest_bds.bdsgroup“ßn‚0Ư·dïÐô¾R°$ÓR¶x³yáv» TÂ@ñÉv±GÚ+¬þCc$!Ð/çüÎ÷Qú÷óKûËy¾eQÆYêB½ƒ!é$‹âtæÂE5E6ì{O”gE¦Ñ°È¾ä¤Rʪ®, “¸Z Òi¶Õè[^)Òîý¸¯á\º°Q=!§á"©: ‘j7z÷cG«\BïVáÇ> ôT’[u/ï½5 Ĉ1ƒ bè q¨gÚØ ,ßg±9ã4T»ò è•hô¡T5`wÕÊÁÒ¤Xå•,«ÏqTväR=SÔ«5ó.Pwmêy•ûA£°˜Éª¼0¢¬Ë-X[2—i¤þ­X6&Öê l·Ä…kî‚-ÝD~—`DlÇGŽi1dúÛÎÅ3cX®2,ì‡ 1Çè"‚uqßï!“ëœ÷8#zWl v²¡u€–á­ÔÞZu6´ÖáøPKÊ=ŸÌæå¹Tcryptest_bds.bdsproj½\Ûrâ8¾î­Úwp¹æbg§bNÉN÷ a l’f‡¤û†ª”l ¢D>”,Hè­}²½ØGÚWXù± ,KtWSmÙÿ÷ý'ý’Ñÿþóßæ¯.ÑVˆ†Ø÷®õšQÕ5ä9>ÄÞâZ_²ùÅgýÖ_ÿÒìø”Ž¨ÿ„Æ[>5G\Ê÷ÁlÝóæ~Ôö©9 GŠÿ¿¹ÐÀE×zæq½eŽÈ2Œþu–˜@DÌÝfåHÂ?]ˆƒé{¡OP;v@ôà1éo‰z‹Ûyì¹Ûûž¥·þÕùb]V­]]˜ËêÅåç/æÅ—«_ÛW¦UýÜ­u¬›vûß9œìE³²ÇAÍc†'I”ª•\¤jÝì% zˡ뀡=Ø04ì`Þ¬däò³3ÿÙ5§üZ‹ÿ4ƒÄ™ÈWyè·÷“'DÙZãnE Ÿ®¯u;RÙp|oŽºæÅ:‡áÒµ K~YÓ+ Ž¿ôXI ôê%DÍÁ’°¹O êo1«…0£^ Æ­Ó-…ìåBì­ó8q¢EŸy8­ \ˆã>4^°×¨Û[äÔ¡‚¨,ꨨ©ïN#ë•jg싈?kû¢3F•ÂËÅ'ÔÊJPM^„j§EHħžÑ€mº¼,HlS@1 ·ˆ”ƒ· `å«Îè àÀy‹Œj+‡¼þÎ?~ç: à… ˆ›&ÃÖ%÷ù;ýN-±QyvŒ qúB% ˜)K:‡n—‚Ï% ‚M–‰<` ±ûÑÒ^4ÿû:õ6ß)p9&(º ÑÇf twÁ YD Û·ŸTA¿R4/í›Úœu¼ÏX Ë4®å)üƒÕíÜߪàPl†hZžH0„ªžUÐwU¹+Õ¬°jÖ2M€{~²”3 e: žP3J– ¨¾d@Õ%cÁ7™˜`ïù‚ψÀ¢Æ„ÏK†àw@½x™°½¥Ž=5°¿›cBTõ-ÕOëX“Ÿg|;ƒ'-Í…ø¤åß!‰!ÊO!R†ê Ìj³Ÿ [‘Ÿ´ï«ûï;RôUž‹Äß*JèM«p ªŠ”Õ‚,b‰]€D¹·†g ¨ §öéõ3pLÎà+pû Î8àbŽÎ`Çâ ø ä î8‚3p¬ÎÀñC=dzú.HÕ[q†`¬ÎÐ×r)N\vW¥s ÕÛñM®§­ëŠí·Òí]ÛÑE§Äi°ì^ÉUàÄ…dU>< >‰÷QH’CÄ6»a„<$»œKš¬<³oeì×*»5q°ÎíF¶ ÑÌí»îÎ`í`®kæp0m÷ÝqϺÖ;£]ëÍvßÞݵ¼I×î½é{i]»Žï’v]³º“ÞíÀì·'~Y9UýV5§Á…ÑžOÕ"AÓÁñº1§„iúnÀ£B©‘Š‹²S´(ÞŠ‹²—¡.ÃËÓCÀj¢Üù’üõ’üõ’ü’ü Q~yΣ°õ‰t)îRÔÂ=0Pª«§ò§ñ7+ï q³gu‡£io8˜dÕLϾI¢É &™é93½d·—߈õÖ !jV ´—Ìç(É{‚òwàɧ¼YoÕŠÉa/•«’Kßè**–ÚWL(9AFÀ)#Š¶z—žÈÁ€ˆãÏIÑhY@¬ï;€pÂZµÑ($húÀ"­_Õ‰lÏ4ÿ‰ÖáA¶èæ–Ñ €·Ž.ôVøT„^,:ǯ(Ù󭢿B@=!êR¢>ZbúÁšâÅ#+2¥"ÐçPeÈUÀÜš›t×BfD}¸tØ 4‚”ñœ‹ËÇU9z/®BÜ3‹<߶9[¬’ÃÄ,LcÂ}’ZGѲñtÚ±ê­}S—^ÜÆ VÍÊÉb}°ä#uTî ݇èMnJ—¨€ll¥ùÝÒ[F©¯~È2'Ôé-ë·™³ gÎÕ,óÓ×Ùî¡AÆÈõŠx ¹"ö($–¬° hÔv¥Óa¥ {½ÂRùA»X¾h“µkû$Ô&PçQ+ìï¾`›¦pÒFâ÷^ÿsŒàæ˜1‡š»é){£ôø§<÷»Û© Îo³€ú Ž¨Åß@Ììä8ÉOõÙ¥Qu°7ƒiÔ^¢7ší€ÏS,D‚G¬ñ:©Åc,Ã6ŽNIŒ¯|/ªÍŠJ}lÇÆh«Nz¦fþòKzt£–Œ”ˆiÝ×€ø”·\e”ÓRÎãJ~p·½gDóF%m›àb›Ï çø5ʨSžž,çžÞW{×Ô¬¼[z4+¹Ó'?}jÆK¡Uä¡JrLæGbrˆÝ³GÿPK‘=Ø%8…q¨cryptest_bds.bpfU1ƒ0 Ew$îð7ÎÑ0p·1M ØUâ ܾ†–É’õÞSLsÊ ¿­rÀs‡EƧèÂ/ÃFBo.PÉ;HjÔ–cXa27rZùæ{}×w“‚Bý¦y墼vZãUbi.8ùÇÌFI¾PKÊ=Ì:B¿%` cryptlib.cppÕßÜ^ŒÚ÷íîUûãUgÒ1ÃÊù}­Ñi04û“zÝ‹Â$%I:nµ0F8%ËöÝÕptþK»×ë\”€´Û²›œ’=øs¯ lÿc6™Ð˜Ž‡±&“(ž»©…­VïîêJCP X÷7IH/ ‚xͽd´ïúqBZr˜íõouÞުע( Ÿhzùc„p8gÞÌÉkæ…M¢ñš.t䇓ˆì?1è!üÝ$O0˜¼^àø†ÿÓ4‹C2qƒ„ž|¯Fæ¾t´HãEnÏH2Z›~)‘­!Uh‰¼?…EEœ’×¥Èæ£ðU®y²O†3úÑO?fÞ#Mè­–¤ÐçÕJ䯓zMˆ¬5}¯×ÛÁ4‚5›·Z꧃j÷fÔ{Ð`2¤I:ÄY‚4ü qJúÈþ>¹ìö#ˆ£ãÑyÊôÝУÐ}èØi4ê5ŽãÁ¤ýè ï&¼ó¹s;ºë«ËÑ°3Žz7ÃÑÅM¯Ã¨¼²†vÃ~Mcš$7ápæ'ÃYL]N¯VKgqô…HÐKײ˜:{<¨Lcw1}¹Rò„¸1%c?A–ÉuS¬Í·Ù‚$€Š¤€‹Ã.hÌLBÇ{`ôï‚@çâù »ˆìÄ-á<Ý—µïÌò8-èó¿Ò%Ìñnƒ'°BµZšB›˜l,¬’×tÙ$,ðŒRÐpšÎäÔ³}×î+)˜ãíÙ‰ÔtC˜”þ_áx‡£a q¸»ýŠŽy$édaâOC\6Ó†¤,hœl&ÈgPÕm”…ãd­H@„ÄŠèœHk÷Dú”-£¿ÕèM9zÞº÷ªš÷ûOªÛâºÜŽY Œž3”c;ŽÝ¥rz…w9ªÌkH BÇ«nr_êÌû¹ó0Á|ʃSã@ýfÒ0I”#mÆé-M–àjqú²yã(æºI±¯ÀW;žfs¦kØ"oÈ^‹0Ï&ÑÃ?¨~Eÿ™ù§ $Ýû½m5ky‰ÿ”ëÔb±{Ë) wkîzýÛÎE÷|ÈRŒÑm»wqs=êÞïN&Ï Ã(%YB!ì°µ-—LØCÙ„©Ùüc•lìò2–Å Ö½@£Ã…å›00ám ~í‡ å3-ؽþEö $F̉$ÐGëhÆå¹ýÜýy6'Ѥ0Êd­Zˆ3˜»_ÿJ!èWÒqÂùw¿Vòop%ùϭâýug­òà½{ßǦ78«ûö•ŸTD2ˆb,ºr^OsöœˆôrÂâ5ä`<„%<—ä›lå4XŠù§@uô H"kž›z3RÊ}«u/3Òk?™#à~ƒ|=¡›#=™!=aùÁú!:|­ °vô™SR1­Ø¼j(œB8TUò]sÇÕ²Ë|n CÚd-#dà(_ Ñ¡†›ä1Àz~sn¡þŽæ½lþ@ãO4¤±›F1Ù‡:´)<‚EEà…U¦€~„ÚõÑéÞ7•FdÃn»jŸXÖ;†œÔƒ€0fÚᇼÑ\Ô¿F±læ Q–Ê+àÕ(™î4 &ÿê p}”¿Q“2g»¡Ç q TÎÇá¨ËYë&çàŽ ÅAÛE¦j@7¼É ·õY'ä8äïäê8E2'âèT”t0"g°…F#@ÞR¾V³Pä@̧|ô-}Hz £Çl$üªR§"û ÿ®ë œ =OZŠ¼9•áó­!l-—«DٱĴÈá[íoAÄì× @oÀyR¯}™AþO¤¸g§9Z]¦ií7Fc‘¥lÝaÝŒ‹‡lâhn©¹lîÓ9ZÆYMŸùXìƒ — +Áo©“£Ôè˜,–mïÅz §ÇÈs“ôŸWg sãwÅìÛ£?Þ¼±Mn™Á0¤¥aÓlûH«ŸfgVñ,K4éåNy„¹Y¤þÜ .ÜÔm+²=NL D÷ÍägN£HvêÎ_œÌ/n2{ "|(•A¸ÕXŸ;• ­<™±êªP¶K- ySÈx\Ñ¢öîÏ‹'YˆQ†$³( ؉ þÄþ˜†$‚Ü*þâƒÏó(%P\ÃúÄ–¤¥†šù¯€)ÈÑØÎYÍ‹hµn ¬¯NyÖ̳Æ^”vÙÉTHÇÎÚÄ~Ñä? Ï‹(N!¹OÔóÝ€n"½‚ig Z˜úAý¾œCûÞ¹¿¡Ôec'K&O?'`F$3êŽi|%6Þ6yÝ)5'Q”J@Uè£y¾ü‹ÖòÜœ™c¯Ê›uÚÛæÏ— ¹h’s®õ¦çJ$ðW‰dßV&›Q Ð2·ÍmÇ¥ºÔZž+Ç^%“á7[Šdq‰fÊ÷¨Š.m:³åÆ#›Î›Nˆ‡:°,êp"Šy”B~+Sƹë©Ø¿Y)î±P,·wÌ^οÂ`Š£ ÑrZ†ã°Ù©gòÔÜQ¿ØNwlÄÝbÌ—“ºE”¦Ó£X- Æ©™Ö/ýÐ ÔP·V‡«ísA¥}îi 9–~ ¥™Æ¹ªØØÛytùpÞ´;#pnk§\MÃeXE ,&”-M¦O*#ã(-úXU(Ê;_›¨,C´ƒ!ºì“#îL©ëPᆠ¡€i³ˆÜhⱤ:…AÔ¢’[ƒü3B‰CH¶µ¤J@ˆ_HTü ÙÏ”•}ÐüÀÔ–Ó´¼ì° þׇRÈO KqpF6ÎØßãˆ×¦ÂÃü€ûW4qð/óñ'9£…# q<{ ¢ápg$ç@¨;Þ ÿ2J®Ó¾™ÛAÕ¢_íáÖÐÀIâè0 ÍTÿ£òÓ6jëhS _Ãä…Ÿxn!‰£kµÐ ýÔû“®:òÁ£kž/ ©p§.ßÆÍ·e^U ɤì&QÀf‚F,G«¥úUL^Y2ãwbf°ãŸn`Aa¸/zؘ9y¤)xä´42 áz>E>€ B“N8v^†Å‹E~ÞWŤXŠÏc ¸`A,\O¿<¿(œöñ HØ{@ç‹tÉC–`ÓÂ,S<±Ñ,×FÁÆ€ïnÙ»aæ)ÏjI€ÒñJþõ ÏñJZôYf¦Õ"# u`VÐ_n ÕÃu4ö'>;¸[­‘Ö…ÎÆvZ‘.¤[V1½¦usT æÓ|¥Žð »Dajó³Z9’¬ÕÄøñ³l3ñªŒ¸9ïU oÏlÔEŽËad•ب._Šgõ‰~@효yL)T9 <ÄÕØš@ ¯‹öÙI» ¾¾Z‰° gÖ)Éñ ž-øÔϡĘ)æ”;e\R¨ µç›"®üU>DR“7”85ƒ©‘:ü&öâ&6 ¶CwCì•vÃÞm —3\b¹t2á_@II’ØÆ„ÚÛ†"FhöÓ€¿¯oƒG!Žñø¹3¿E¼cÁršçÙ›cù˜µ¼£Ô pKî¥Â]…‚<ÅP¾i­Ë·Yn&b‰KvÊ~yé#»p­yÖ ¼®K´Æטu슻dbœ³³m 5¦¶*Îtô™,®,òɺ‘Ï°¹¥p#<¶{±» ¬ˆp¼•Ó¸ÒšDŽ\˜‹ÈŽ×niÂï‹t·pVow—' Ï %ìK6-Æ…Ä•9Œ!Ó\ɳCó `@Ý7ÀÆÓÈ|00ìïs^ÀoÞ¨kbú-DÊO=ð"Ç©5V]¬OœØ"ÞßB¤5{Ht…ïç®Û¿!úšN݃UËD®KI…>küb™ðŒ_¥©)käûŽ’àŽšqèp­ ż–dײ4€±Ü Ÿ$Ìë'œž wÄ…ÎÓ$ ØÎ^IðPAƒ©{vÍáVÁ ð[Í(oÝLÚeÄ·ÍO­ôISŒAlÓ²PÖ‚Í¢ýꈈhŒé*ÜÞ— ¼nôɶï[DB ¶Iü_ t‚;ÅÅê¨&—Akåæ%½Ã¯åX¡Ï vì(›#Â’»no¨BHIäÒÉçb,1æµF4Ó¬¾âW’ë2Ž²*¤D<ÕÌd»ºé}ÚP8](…cçåÜåâØiåldó}玽EÜYp8#–oë¹J7!L:hN@‹«#Måbˆ¥hÅNÛsã[1¥‘mö?ã»ü•{‚üé>WK˜£ÝÄì¢fã£bÜhL—›n>zÈ&MŽF;æ(»+ @í­Þ­¤úéx­TòúÍ_*Õû-¥Ê´µ! ÌD…[-¥Dôìå÷¥žÉ Ú){”>šêÛ/gP‹S|s4›ü~üÄìo‡Mrø=7ÃoËð½)ôRu˜ãÑ®d1€ßÿ >¿5È¿çÑy^dÀ™p‡œï¶67ƾWÂòVˆü~#‘ß3Y4ÙØ÷?Dñ!,ùý§*­üd£:¶QY¨~Dqì0~#'ÑÜVnëaʨ¹™î¬ÆÔ×[muÀPB}å²ÅטªõýuH¿Üdë·)°\­Þ ž¼Æ\骹K\P³]J%î<1Ôüƒ ×n ‹½ä·ðø)öóWºÄK1«ž&ií#`Ü䃶Þúï {M‚Ï?åpÎ/¿ÈÖÿutA'.”Šâª9~‰ßʯµÝ…vRÈ„úÀûÎôKmÕ(VJÆ×B,F±*6+oè¸hviåç'øÝ°T –9 ÇÔ`Kž"á¨_Øžr ßrkç¤âõ–˜GÚ€•‰Öžn#µËîÕ°sË?~ÄDà-pÙkǯée4£l/yÿ#ÞÃåèÕ–Œ¾/£p©WÑ|Ø«;ä<|b käyÇ ÷@Ü¿´ˆ­ŠŠ;cÕþÑÊ‘4ŠH…Ó½†^®Ø—ÁÙFVnƒs«Û±ã»&ÆÅ=R\+Ñ6;ESMEÑÅ œÑƒ˜â5Õ²{ì 2ç^¨ÃAÕ0ˆ0ÿ4Þ4ŒŒûK5^dÕØ¿Âynî†ý»¡sT©1*oÓj# 6¦Ó»õnF×Á ý©ÃþŽ_1±Quëܜۚä žºº`ÄŒ†F ¶UìÛ˜º\'xµ*~\AŠŽ·…¶ \;‰L…Žì;R+")R~ÍÞç5‰NȾÈfGuñ@å9QÝF±YT£Xǘ¾xTW$õëÿ|TÏ=vaÝŽ6UqÝ&jöBÐÚ0²Û>ÒÒ0U„ö¹ûµo†9 îÊ~×€²˜Zˆï9Le¶•ÀBüº'HÆÊ c|Q ªöèu‰„–dÀ_E²©‡¼²ˆ¶•t|þM¥óhÌ=ζY¾P::C¥ï)}>Dci¯¡p”¬0£‚#ëõã ®1Z¤Ñdû‘5Æò‹â"£…. ‹Ú¾å––‚¯_}¿rõÙ*Àþ«O¡MW9±£-|ø ÿ_)ÀŠm϶çeó,À>ù‚Rk“×FY=äÓúe!ÜQs³4Â7–¢<#s§ˆTÛ!cœ¶Ã1˜3uÙùŠ³¸x‰µñÔÞñLæä5^ÏWs*U¾éÔÔá4¨GV¢E~tà<†sèal×&÷åSŽe›ü3½RqÖZg¨P¸®cLVõJd‹¿c/|é~\àm ù¤T‰¹³€c"úÿå^ÏŠ:ÛÌüæ[{S|çzŸRÏ÷Z¡%?|ümûO|€jÁJ4 K¼}̓c>ZMÞ—l &É‘W| d•T|?ûR²qì›I(`_HÎdãsø¼”¨ŠÀfÒæà œËꚺüPûÿPKÚ{TB­Ì%1 ÓT cryptlib.dspíœQS9ÇŸ*¾ƒÎ»ÉÖŒ!¹»Ü‘*° ëZÀ.Û\–­«rÉÙ­0#ÍJšØäÓŸ4ƒ „8Ýav· ŠñŒþ­I­–æ7ø;v®„5ÎLnoÅÓãþéðª×fµ÷Jï7Ø‹ù?ß¼ p¯;ScËíMÕçõ½úAT4ON>—+QKŽ‹éöÖßÏÛƒÁÑi› A9~´ñŒ³©FúïÉ#!¨øñWôQ¢ï÷É‚G×³ç´ 6{-âå6[­ ¶Ï$‹«_žŠƒgÎ@Î\óü ¦¾éX¯?Êøbž@%‡e^øÇ2/¬æÜX¶¹þ6Î/Za˜¯n·ª^«ÎT»§Ív=›”¾ Ÿ)»‰¹¥ÊßSkŠœÕ¦°B–tÜjD¶ä„©… a¸²ÚŽÈóõŠ,ŠÝË~³}¸ó¿ý¿‰EcɶNÖË}IÌ0"ªwrk¼¡î%«Êš…ó&«ž\mout˸‡}¼ºÚÝ9ar%“{˾Qyø2:Ò¹¶:ýàK8î^VÇÛ[S“ò!”œ+çÙÒ FnJÕ¢Ú ¼»tR€yËÞ½c÷+Ž¸~ ÔýŸ½Yþ$ŸKÅà¶X™®ÓR*í~?­¥SV}Î-Ïð¬8À‹Æk R ´>>ÿ$4|”¿9 É…I$Þ@|NïñòÔÌ&ÊÁ@‘9(Æh",%ÒTq‚çIb‡WÃ"?ô„ÀÇ›®µL ¾“<Ï ¼Öê]à#¬¤ZrôŽ¢u9^ )~~KÒt¡\ûGÍaµŸ‹»¼+7]8»ñ’ÏñZÑÐq9 Á~ÈtÊ3žâõ™ãøq sUFpß©)¾å#'wuØ`Rô¹Û;¨“ô^ÒÔ”)¦“Æë7õˆ°< rMçe¼á J›RøÑ?E%3ƒõ*“­W 'h%A¬½œRün%ûM³UZà{$ã„™'Š ê¤Aд¯ñZåmm( ´ì·B’ ÿˆÖêqØÅ‹®©¥Ÿ{Ö.ñ³qVOÑêœë°°ÁËÅ2æ—°áJÜ’œÅkáržà=2é6™Âp?æÅøZâ-,+MPë$7¿Æµ¢Aо&hñ+,›x>¦¬n­ú . ­¦r™á‡;%ö-ahgh©ãÂRÃñ”ඓ„Mœ“2!ˆm.5~Eì€S´û±àiƒ¢'¤ÆR=6ø½SñÝh¼üZå¸ Ü€×ÒOoœÌ¸..üVp+‰rîç¼*|Ì{ÂÖ&4=m†÷Š²3*ÕÁ¼›¤ñ½l¼OÙÒ†…- Q|¤T>ãº2‹o Å`SÒbh¦t2;~Øͽ¥hiÏn>%r’ro¿OJ < â©ò—ï»ü$y"íï»üûv‡²Áû.@ÂÊHu;@ÂÑ@ƒÑ€GÑXé4ìEñ·í4VyK±Â°B°Æ¯†ŸŸ†žžŽŒ‘Òò°b‹®vÁ‹D‹ÍŠËzMz‘J|ßF”‹TÎŒMÚ€€€~~€}qÚ >>20.FªSoã¤|ŠÎ( &<$"< <4<4<$òßØøÔ ÐÄð¼мдЬ«D7QdÄ€%ÄÜ*x9:©Dí<ÏÑžWdÐlhdH\©Æ‰³‘R•`{¸âà@¡à€fà@bÝ@#Ý€çÜ@¡ÜHñ,)¿ö)§bȆÇ ÇÆ ÆFµÂ´M´ͳK³À²@²ϱ±R1N zmäøØ/ :ø9 é9àÙ9È9¸9P 7Ð7RÖÐ>÷è¨Xðr °n j@cj 0f b¬¼Ð„ZE—Ä–‡†††…‘rcÑëã9:$—8h0h(ð ¾#Ÿ‡]®LS®¥)žäÈ0ä–™ßLVjü*ÿO/.ßx‰{¢„ÔNîø¹Ç-$O²§äkm?,¾(£ú´ü–ÂÿPKÛ{TBécZåºE¼# cryptlib.h̯>ïnòþ=ó“õ2 Ť9gïØ}"²ŒGÌ‹¶ =ŸLD,›s¶\MBá³ ^x02Y³/\°Ž'ªïß¾b7Sò*«Œæ"eøÌü8Ê`bJkî‡^âe"†iœÐ 7I³Äó36ñR^­ÀŒ4å8ßËØ2‰ïDsØ*°`Td<™A,‹a ’/Y7«oßW‘ˆÊ R¶ôfœµ‘¥øçŸÙ…œÃ~m~jî±Vße>å |^= Âcø“·4!'@kK:ƒàˆ2²‘3W@x” ßË@0ND¯)9¹ðv¸^,x–¿-–sžtbµ€—$‚e&09Ca|vݹ—ÎÙé*òIšjÑyk·ÁàïÞÞ/òó×Oôùñ¯òû¯»{ 63ž4Ø—¹HÂe‡ 6pûÎeg÷ÓýøqÏ<îîýU?´/Ü»ÝÝ߇oÖó/Öó¯D^7ŽÞIñÏo9GöæÜ¿MW Ek{Ðþ ZAÈ“{´æ’§)n›%@àµã@ïÃõe«Ý`çô·}ÒËúÛ¡¿£}œµ/Yí ëxj/Xwµ˜ð„ñˆƒÆZÔÝUºgµzƒ]´ÇðüÒ‚> ç$Œý[ÍѬÁ€­‰ýH‡œ<°—䣿ý×î_âëŸz«0³tψ¸>èÙ}œïPÿf m-éÓP-ƒÏ|Ýቸ#Ñèí—p¤aÂ#]§×âî\¸Î°Áœ6}\\µñc0lч7‘ÃûMpC1‹¼l•p6ôç|¡7£3lÁžÁÂ¥îñ/€J æcì{ }Á¿ÎÐ=ëBÄÔš%œ£žK ¯;ç°±ç€åõå߯ Ë9þ¥/¿ãι´ÇpÆÁÀÜa–¬|$UÑè‚» mïÇá:Š /ã`ÏþÞ»Ã÷ØÑÞ4Mi¸ZÙ+ðY-ð‡s0Há7Ø%¸´Y¼àÉzÀ—€I›%Èâ´¿7îuO`ÝÙé^·#d4ð1FmwÚ{]üÛ—¦Ïý„gl8÷ÀN¾ÖÐËI½ïˆt þÀ •qÓl5¬™¾¸¡ë†½Ò,,Œê©„º/ôÔ8-PÏm‚–¨§³ßÅþ®"úüø?½ ßâ÷ÀÔ#×–+à(^%þ† …ºåØÏV’xkýí"…~‚u›êÛVuŸöÅÒL†&mYŽæÞ*#Ô"º-E ã#¾€X– ‰†nzR˜éÙÆK¬0B8a-D#öŒu™{î,áÞb”xQjd/'‚ç§m?_ƒ)O•ŸÓãhm<±¿‘ímO%ND„ ‚áˆ?d‹À[&))îN`è:çê-àæêeƒ¢Ý§_Ì+ùµðöã^áíÇ=õ–ÐÌS<ï Ù”{–ýÄ‚¸ ѱžu!lÃh¢ .bß ‡ qàûõØUÊZ+åìö‡l÷—,Ḅ=Ë1&¿Ç^ue†Ò¹¸` è¨Û,žš$ Áâ(\ÓŒi†ñ=Úœà&°2J>˜žÎ»óDèMBÞÌŠÅ0Mþ³ã ÇNÇÙ3OãÏnÿ¿[íÏÒÚh 8d¬–pʨX¦Ô‘-!'ß3NÚì PÊ‘t¤•Â ó%RH–À†ë·Ó>#țÓöÍ1ÄApˆ…ï íï§'c”da°wZ‘ó渺9þSYƳ!äI1œoIaŽtL51Pl¹9ìnwïvåF>ô(Ƙ|CÐÍ¡üþ…Þï~üôqì\R(£ñ<œÝ‚£V£fý÷¹ÎSùÊŽ?ÌvÍ*å¹9ÔW6ø±dŸN€JsVÛÊbÄúáú™%7‡½–Ó¿9D]º9fH¦´áÃå1‰ÎÏÙ‹V^È`ÌcÝb!uÁ £N<Ë‚3]3 á¦™C’Ç *¨>BH«`KüDP–ž6KH¼e‡3=Ú‘„öûP4!Ü탹ñÃ÷Þ1ºVðYQ{Pï?w¦¶A¯¾†”­ì,ŒüpEÖŽ$¡9ß±ÆÒ,ð—K«v[—ΰßj;ãçÌíÖ´ÈêPv½GÎî½$(ÔxUéOUv ¾Ú¡Ô¨¢~y²šâÆÅøy€(^±&È SHo|1]Ãv"á¾”HÖS~çÄKÌQ[j\Vh ¦yøX¯òhµP¾¼#öÍé’PÜ^ݸ~þ¾9ÑÀ‘ @A˜ª‚èÒ ŠÔƒwÀ¶Ìힺ]wäŒGî¥ÃŽØÕE¯{¦úÁd×íOH¡½$^EÁ>àÀFº@“Ó¿‘2ß[¡žƒAdZ¤U3ç0[/yÓ˜Ó½º¾öÖÊìºuqåWSÊ‹!=X-FñæV¿U+)F=?_ÁF1N¨ÕÙ7H-W Hμ« ƒïU”Éîdñ^iûváŽFÎØévÜVwÜtœð %ä‰{¶9º XÔÕœœC J‡mhÇPÁgYÈ(^ô€M¬ÇìDÌôRÚN,µT°'½Á|.ÝØV½ ;(å4öƒ)†£°}ÝcÙß7€@Är|¿ZA¤wڟǧ-÷"çÖ(¨Ö ,Ô, bž"mèÆ°UæÊÀS Ï”Zò D§½ÁeˈDîfŸh‡Ó$^hüN@ ‚—Ø#Ç þEÖòîÁ 7ÐÐR L$nä„“O€…^´ÖQŸÂ<Ã>Ñ,NªE¥7:wRµ‚¶V@‡D–+\-×®ŸLº RÁ”Jö&­ƒn.ÆfRÍ<Õ0~R«Áœoß«•;‘dfÿ•c©KC¨É ¼å'{K ë £™¤}†ÜôÇ@F­^?0‹ ´ñì‹ F/—«qÑ] :=TÓʹû&gƒ[IqE.€n¾” 0r°ñä JäK¸Ì7@hƒ¨.©#Ã÷ml,èksÊ‹U\ŒÇОç~N­WcØÚžÑ+@FC*]æ’\9¿¥§Çä”ù$£XËjiR®[^…I5zš#Ë`)ÃSvüRã}œá€<¥I?Èr¾ð˜¶]Çs|C Q‡Êê(Œ“4²d­\‰šaï¸Ìc2(éŸ`»m&ålo1öû9€GÙßÔó{*´Š)ÎXÈ£m€dË›ðh&íú$ŽC%å89:RæV„ÏÞ$ótSÌ,ìèˆÁœfqðÍ›"Z=«0ˆZP âÕñÊ¢_– ”`²"ETDM-†B‡á²™:ü?>iµ?i :Ãq»wÙoÜŠ¸¯ÕŠÆÈ$ÄÚÓrùÛ†öÙ ñ5‡Êmjt,?ž’³…VCœZAm<ƒœ‚úÀPÔcAœÊƒip‘œQgIŦ4ï&xSôÏKjý˜D`ß—E²Y©º—LD–À8¶±ò4 uxLÛ®ZÁŽ é¿hz¨Ž¸åkÙ’§@[%}³ZQ´AI1Áv¦ñäŸ`†Ò“˜à™².,ºF°}O$ù úr•,ã”z‰pµ‚üÐIðIÓ.½[X¨Ã^hÂmf<#!Izgƒ­ã‹¸”Ümßhê<óðE¤+ÔdÕJklpE a"Xªn2¥YÏÅÁB*%U´©J4àMWKt´(ÇÆä0Žo™—r„,§/Q_û 6žsFåƒM5÷ <•˜°‹~Ûì-‚ew ' ŠóÈŠIn€Õ’㉠’‡˜æÀuIeð®Z¡µ.E y`ÍŽ{ìaN¸N<Êr Ú ª}ª×2m…AŠ‘ZƒñºÛ_Z'Άäí@mªÁâ”<ú=–âçI­²Ln´I¶·°eGˆ!D;lddR}uý£!¶µ™í¶L¿‡ab[Âeù‘Ü+ëR5P…@ú®‹½Í}&•ý­:j§(½}ÉðBsæûÓûYZÏÏlç'ÈS£–ÏM| ‚—ïKäKssZìù;Df8VM~PΓ¯¨YŒÈý­”3ŒJ?$(TFW#,5ŽÒ™v—GK2”0ÄÝ‘Ç“@ 6бIK?‚£Ý1²’ äKlÕF·cCvžïÇA{/­ë¯Z‚ÕaWÔ_ŠBå©åhŠxHƒŸ‘lZ¦ìø„¨†¿àY‘“ú2 A>I½ˆ§ ªR"ymr“¢‘›>ÀÊã#4ñmŠ¢Díd°šhò¦9oa”³ƒø]§Üq òi]Ú¶«ìÝÜH´yòd$ŠF4{<§’†o4ß·½è*åæ÷\0[«i¸æ -úðSjLgtʹ ,>T&XŒ×›²:,Ý ƒï/“Vd‰¼o4ƒØ µ¡ -L ™r‚7íBÒî^×Å’syKš¸~ŽÜ£ÇTðŒ·W–1¯<¹ ?£ãÐ?ÃK?‡óB†þ ©Q¤¶A¦Â´ZÛmIôW•Ñ—}ì%¸Ê¯QéŸÛÐ?¶6}jºŒB5ÛÆoKÐ\‹ë9æ´OØï2ÖìpM¿Œs†ûûù?®!Ûrõ“glò·~^ÆCü ÝþIó_þ»»¯oj$9úü>…–‹ÀbW0̬‡o0ëG̮♘]Ç/&Ô@?#ÔX- ƒ7ö»_å[UÖ›Ôìz}‡=¨»«²²ª²2³2Ér…2/Ȳ¤T1às+H»»»¬ÆGÝ€i\9äjéBŒ…IC–¬ÃŸÃ«ÍÎíV*Ð&ãI±Æºåìv’‡¢6Ó=6Õë|Ì8WÌ?ø'¬Rrª þlûSš^³@ÿÆßù{Dš×?ºèoi:60ƒü¾$BÈS‡"„UPoH¸4 ¾küwéöTS>‡æ$u°+ƒ¶ èÙÞKcÞP0ò|S¤ Qmé÷„õ¥%†z¶Á>áœGñ2eTÍÈœ1xk4LÒhdðßî6’„­Z›] zÔ½°ÇȃT×'ô&äô¡m’Fž4éA>úÚ¿›ñŽ# tGS„‘$f™{j+òpºV" úÜûe!c«ŠØ³<êå-%Áú»;ËpbŠ³êGW°ô¥Ë!8̉7"£æ²šn7Ü!4󧀋“ëSnEl̼tnŸß\|Ð4dBí¿ìuÌχõx:0,ÁÞã“Ù”/ÓšýWø‚YÙˆ²ÿGüó¬Ä©:””Ýý?ãÏ}Àb‚ö_þé—ÎÛQq¬ì?êê=Õ„ò*@æ ÑãëÉc䮡!’ásÛd¯Å ‚\wc†%Є…‘ñ,mœÔ£âæÌà¹î¤üÉÉ®Sâ«IËÜ&kMäø˜ o_ѸÕcÂe;ÍÄþA“›1ÙÅü׎˕6'—K–^I£h.Å©-¯8 +-NQ[¡àÂ89£+\ÏF”¨OÔæuˆ½¨AÌ…'λeomNx"VÚNÒ 0›B¦'¿:"9ää}•SÌ¡C&”—¼&0@é¡2BñeÖ|Á°xŒ_„Iê]Ar£÷¦åõµ‘I⤤ @œV>ïq{ɱAMÉ ‰±ŒÂÌRJSµM2þï̈!~îEÇæÓï:»ÞŽKɾüXSì½p4ÞA沺³ Æ0³À·³û ùAø¤ìFl·gòor 'T4÷I—8t»–}ôC{£äf¸¬¦¤òhqFbÑPü{äð;@¤÷±IÌBˆíZ©'mø2S~ !wÚâU+è< î3H‚§Ï H²Rq`€œ•àDú+ú[Ìó¦l´-f»n¶‚¢¢¤ƒ7Ûçh=ìdÇþÎt¥õÈ%»O0‡ºÖÝ€zfUã!ÂØ08‰-»7˜?yœ¥:¹ÕÜún0e¤ñ&õ]÷É7‡ùSzG+Ûi†(µ»]o"R¤zŸ.Må’SR>¯s!Zû¡ íÞ÷›(Pzùÿ—.¶6xH˜h,æß4|+"«E³sœùlÆØ &¾ÇlÓDš69Êúø0¾ÿÇÔ0ý½ìÿ$ý|"@­G3@X©¼ˆî•ËOÝèT°( V*_…`Lu:(uô/ð²jʽÁ$ã|Ó‡ÕÑõ6ZF¸“»åÎÍŽóK‚TÅvÄÒ äË|`…GÀóYGiõ1Ç2N›|ß?`· —ú!;`ëÈ(z;ÎGð›1eЕrðø‚“Þì­¯]ÝãþvÔ‡{C‡x‘;’Ü.bTÖ¬1a+¶Ãão«q1Ò"ÀH;ìŒ"Ð&18Æz½§õúÚ%¡…±]X•†pi!>nK–0æ²á+ y‡÷f(ü.²„ó*ÁÕß±ÖS;_çæEš(²BO91×—Ù(ë²ÊÜÝ—ÕÀ Åä–#•ÎLx­¶ ¹pRWçðU×ó w~†ÿ3_ÁWd‡ñz ÒhÏ€âÊ*/!ˆ¿,1…ïK5k\>xW4kžknXax–Qãñ_t°'ôZN4 úˆ‹‰™1ØXôœžô¼Æœ{kX5W#¦ulÚ¼¹ˆndááu¼ØMQ@ε]³¤ô!`Ü ¢ñ…‘&ÞÍ0ï—Œò£y|D‡Ð/©ÅMRgÒŸÉ)?àl<4Š4†^9hW»WPíÞû=âø) ·vÆ ­`³ ­Äaå¶ø\ŠaW£i4­À¥o•ae´m2KÃB³íå¿ØV¢¼jÛ×p«8‘= rÄ$y%y— ž‡bŒLÃÛGË9xGN…¦g@†Kú ]Í „„·ÑB=2!“`#p‡ü\4ÆŽÞ˜nW%Âðž‡d€Š&ä_Ľ“36LˆŒ.x(Éq>kÕXþKðÄÙYMѱk¼˜T ¨læ@œ>@°0@«0*~€úb DÒõo9•´âÅeE¿=_j=óRà>ÓkAB<’§-f7r7Ö©pFƒìF’‘î`}¹ëSÈä -Cõ©™ì$Ü[¹ bûMã§q+s¼©qÍgLv0ÃáLM²7’ ørN_1ûÔš yײßgYq¹Mç0À©IÜöÛvpŸ2¤<±CC@$:-âtóÙ™4I`O;ìÑ®¶}&*æc c½[oŽ®¬Å*™53L@˜su½&iòhB­•o)Èd‰ûhF¨¶º|21 'O€Î¯&¥e,J¨†ÿò Ìö.:Öõ‡Î¶¶· ~ñ¶lIYú¿&_l,”? ÈPmSEÂÚG°P§¶cŽ7ϯ9âgX z/R¤ÙÖ)N­Lß3‰³aêÛì*…‰z¡=Çà²èYœ<ãu눵7OÚ…±ù]xiÐ9Òí÷%VÆ|jL™?08H&±@´è†ÂÍÊVï+á«%$ɼÂ7n=eG¾piŸó½Õ’Yà¹x¡n]……åãòE€ae‹Ò‹8²È*öfÙn0Ž4† ‚«éÄ–Igð£ Ö¼)†çèåI àùÈ4›L>Y„LC¹Lè§c{6¯øu²Œíûù¸j§Î†Ô¿"[b'Äü¢'…Kh7Ø PjqYðÎÂugw*\×,l/P‚/%©)DA’ÅÍ÷3¢å+÷}ñ凲0ær.y,ÝëÂFß{ q-[M…‚`[ åmmDí$Š¼k/æçcœSÆX»Ô¸ÔåŽÙŸªb ^9Avˆ®*´—Ñ/ñ‚²U5£¡²F'øçƒ÷ Ûì¸,‡Í餴÷‹>MþðþoO'õÚñáÀ”5~À¨aÄ‚.4g$÷(fñÿV­£ωa'?^«YÚß•«9Â"ÒD®@󥶈6O¯ÍJºݶóç5 Œ!œì‡Z,³)äàe%¦Ä4hõunE&ts%o‰ûžt>Ââ+ŸÚù¨#Ã_¨d;u6ÖÉe4”`bã«z@Óòh<Ô÷-.^2p Éq¼Ntæplle#CÃé§+6xÂä '†”;Ô$«†¸é=¾ºi¬¦Á°ÄûzëJ6UMÖÚyfý.ü6šÜ4¤§ÀçÆåå稤ø¬¢q—3E¦ÒGfÆÀ¯Ót3C6§pC=MÂwÕù‚–I¼Ž|%ÑŒ/Ó4'}¸À2一¿á¿ c8%ób˜¬ÁÅwÍA½tF¼©Œ=cþe„0Gv€äíîÑ#ì2Oö:ß|ƒ#Ž¬2‚úcóPÜw¹ zÿ›píBÙpŸn¿ÜâŽå”y?OyŸ985o‡ÿÜ$°«â÷q¯™×í3öðâmµÄã, lƒ/ÿ„¡·õdÚå¿m‹æßÒ¢*BO¶rJrÜ¢}ÕùÙßú­BZ¹ #ïmFº :!Có‰oÌá`_Š„î/‡ý1ê«™¤>—ÎV¡Ý“蟊jJ WœåJhš²1á¯>¥ý¥ìQFš7øÁ´O×óxÀÐaGIjt±g]öâõ&jóóa²Æ¦ÕŸè§1›ú=A…À‹Ùpc¹VY^YN Ìž×ÔШ®ïqÊÎ 3îŽþX°f㛨Zc©kºFã·SÑݸ{ÄÃæûß6 Æàµmð1º÷ žMmI)#[ G·¸AX¹×ÜnÇ4jÆ|±˜¼÷˜ª÷úµÿ e­›¶Ct2GU7Xœ¦ù§ê—ænÓ aËÍ#Íá8Ɔ‘h ŒÈ¢Ú¸ {¦º(¦‘äÑ”§ðˆ¢¡Ð)a‰µø‚_¹íªõ5¥yðgæ ÅE¬i´W>öp¡¥OM³ÒþèÝ$ƈnxjÎpÓgëáÑÛþ‡w~è½c*tÏsÝÊ€~ÿp£e¯æÕ G_ò\òhƒ˜DÉËhT@šŒ…1¢$qÉÔK'RЄÇ7;FLõs4qÔ¢FŸ‘ÝÆwNÙ³ U—Ë.b²ÏœfG禄ÄT8 ÈÛEQX<\ywH¤QO ,ÉKFê 0‘¨ùSLmÆV:( b±?~|ÿ Æ'r ňRáYGæ@n†ƒ·%= b™®g“)¦fàÈ€UƒkW~NX±!ÕÎ7œäéIÕèl É²´B†=z:©ôÁH‘v Ž$÷ãÖ°QÞTË5rˆ_¸ÂÊ6~ž Ø‘5‹Œm…^Çå+ƒrarù]ÁDØ2¾ž³k*ƒsØqÁå$“Bäêñö?ËI-í¤²âåaC·PÙh `ÀÈšj<+­ÑäõÂ@Òá\J‰GsàU#ÈA-¹ ‡tß6ŠxÃjrŠË-ÃÊžRÙ‚©‘Q'šÞw;xÁ%ÃÑ>ZCÂØ'÷f5ƒ"QdÁ¥.¢Í1*¯§ìjµ“%‚xl/²Áe,6e§°e\;—ÅV $Q*bá™uh^½/nsB/Eõ;hí» ¤ “e>/„ ÆY_ˈ" R‰ó£Û—¤ §ŸRdm3-ïõ|AÛMg×,.è1Uw|¤ƒ¡þ}\7³Ë›I=»¡ßþ¶>Mx쑱·i)­îÅ ’A±ÔÁŒLKùé϶(hšƒ°I+ý¡ ÓèŸEœ£jÎGˆön(XkZ]V£jú¸žã=–÷q¾B*íþ bˆÓÔÎ#6“ œŸ~¸€þóg[¨owÈKÃ¥€9‚ݼÁÍél*I`ÞõÈy$r°Ð•®áýMy÷eϾ‰”êÖbò¡¦ûk‘„Ò†ŽWÝ0ŨÀ>E'^þi[¼;E?¡a(V$#뻊³5üï~Xç5Iâ^Ðã·¯ò=:ÑÓz´•Juè7]ų4„ ð)–D™ùÈf£‘œ®¨& ÈÔΘ*à¹2o0«)b_æü¥‹åŒM0¥4Iv–"² v¶ÁÍD"¤8€z¼æ…*é2CS÷Æv[ŽîùnaXcã/Fß‚ ùÚì=Hg _>ÃߤcÞÍø– xü«ïAÁyĤó9ŽÕì¦ qärKrEYzë»ÂJQÝ'ï×V»„-òUÉÑxˆ4ê|Ùß~¹°×¯¾ÂýÊ¡ðþ9úsŒþµcΰ×úço"Ù¢˜áhi%JV 8#^–§{Þü_K€ÂMMðD°{ÂZmÁ;;x>ô1W3©÷ ðT¤„8F™Ùo=tøRÆ ðv‡ãð«öŒuôLeË{Õåÿ;æŽÞ@OâP‹ç}¯+W+ÔsƒaRDˆfhùGâ+T.ñ ¿‚bí¬¶ç_s!ñÑÛÙ¢ ÁYCá:ÇMi¤t¥zíl€¢F¦ÿéë@?õƒãï­ÔÞÛ õ™O)Ïß÷ß[ýȦã{8°I óÀ»Ð~ËÞ@¦õÈס”`ÇtÞ]A®…É”D•}ÅŸn²fv}ò{Þqç%”ñ|š=i£øóáÚð^½Àµ¯’ù´ŠPÝÝ•Ã }Râ ÅYhl(½Ù‰¼Ö¤3íÿ«ÕNÂlZƒ@¿Â;@¹•§:äv6Û m3Ðsdtº‘}ç»2›vºmSµ( øÀô¾ùâ_8u-‡Ã“f$ª >ŽÓ-¤ÂJÅ•´Â6ë#cK‚EÙê®6>©ÏŽ.ÎG?ößuNÞvNŽ:ïÎÏûßy[í#pO N§)–’·\Õ†$ý5bE¿)¤8…]ñÕ ض&žŠ½G$ØÉgw“g€À›µ5£ qaLºh V¯ùõ^r9©I€P´9*dR.¾·QúãÇy=ñA¦ê¼‚ÚʶD¬¥›ÕEªù&À—™XY69ªr-}C½Ü Jéöê= } ?”K„Ii$*»ºÞÍIÂÚP NaÕ]¶UÔ'\ ­ÐkbÐÐ#Œzá%½m _{޶͖ίìfœlÜ‘s²-Ñ‘ß“°8ç?4W’?•Qwiç!w·ÂÀ‚ƒóÝžfFÞ,«ÛòZÿ7Æ^Y¡i†„Ä·qQ/ Û¢T§ûï~2Ä9þ·y1]ûÓŸ,g×ï«®t šîɵKùTOy!!qͧêÞ±aá^¡¡œ›8ð—¿w#r+ ÄÁÿ<…ÍæûÖ,æÎVd¯EŽµî èü "! ÒÓnOºQ¬þeé1÷M•ý©Õ•¡ŠÒ« £ÙÁ ÿòt«·ˆSBl;vI»ÏÎ>j®êìÛ.ö4ynáVæ¿ßÄì´®Ûöû•BûÖü˜w®—É"%á¹ßZUzoø08}gõ¥s­0E»ç¢ž#Œ6Mžý´œÞ3­ Š¡Váܵþ¤¼*ü®Ï«Ú»²Áà;€-zÖt2 Lk¹‡&¤$ŒÉN¼ÿ]g7¡Ùä$xW{5QÔDXIgÞ=b«P¶)–xî¦d·ìSÛ2æJÚêâLvמ½À?*m¢fEYQI®‚ˆ´ ðž`KûÌÚeq)«ÄGª¡Ím´ØÔszYý˜qý»]‹m'¶+þ.W¢á€`ÿÿ ãÿ‘EgfÉØ"]5 ŒªA£7ÏZк*o±uÅVwšxÄçžÅ—9›€,ønì¤l)Kcð½ØV|q ’Ö gZädÌ@TŸo¿ywrð_ƒãï;gýãó·Gghá~¸Ãf÷6s“ÒöÐa.1£/¨– fqRÆͱYG†j2°‡½CræË÷‚æZ+Z lwÚoÚá,³P’~uÉå3 #õ-³ÐÛ…ÂÞê7ûXJ(“å¨hrýìò´¶ü¢ôúËè«éEiªhë˜|¶d—ž=ü~»Õ¬:}*,%É7õØžÌÆHEy¦á±`~>q›£>’Uü¾S ù‚ò¸> –ÏÀtÞýdør„ qCé0桧Z¿ ·±·“B/£1XãÛRyG’ã÷!'¤Ø KȻ͌Žyy´6ˆþ}Àä'óªùÇã–Sæ"¹ÒYXËD•é&åû|”Ùrtj>ˆê›7è ìYBIÒÔ·ä+IKEíÍëÚÛ¼ …ÅjÝGaÔ(]»Îítõ+ÙT‡Ñ=é3l9otrm)Ž¦w<§£¤ZÒ¿¸èüðþèø‚’ÇÎ!Þ`~€?C¢¿Å{zù6 ânsBÅ‚&ÈB”ÊAxºÏ‡ Ê…¹®&¤*F5Ó²À{orºÒõ“ —ö@n”c‰S.è[×—­CÉ^VÊ䀯 ¸§è5L±0l«0ÓiX‚›‰ &b[ã«[›*Jov„(ð?%nUSÅw©Üv9Ûð‰¤ŽF¦z¨" EêrߎÛøïHÙFLªÓ$d&ñë>·%!HÝį4Ýδ« ^áÍ¥{Š<úø¡¡äc”íïr­ZžÒŒ{–E´0ÈúÂL¸Åp¥qùÐO1’ÐJx’³=¾ö¾…:étþd8ºzœ{O ÛÞ†w¡I’dÉÑ&Â!Ò‡í†èÄ‘FÁá ªÌYCó2êp”ÍôWï§íœÄ»„€Z}6»ã5CÜ}4Òäÿüñÿb^æòj"ÕT8¼²)Ç ”ìµ™‚`K KŽØwÀ_^°o}á(6Iìf~v}ˆÂËÀä‹¿Æe ®çì\yoªé›Ä0aÖ|œŽŠàMb~Ä¢>>ÆÆð„‰518a¾rÁˆm‹’à‡ï¹7e{QŒQeOГÐa”ÑYŠáHRÓRØA,¶0c"ø #½E.æ ƒ²áÃQƒÝ&€ïƒ$¬‹S„×·M=›D©[ë^¢‰†q r)iL€ÀˆÍz• úHÉ[ój&ò”èÒÔTXK Xd,H:*?Ë|Xùë¿àÕj=XͱQ¥€Ç»fÇå¤ œ0Í¡rÆFʺèN@G0‡ýÍØìD,Y{iZòÚ€¬U#*.4|tütÔŽõ:åôjg‹‚O¸Ó -uÅÊânJ2›ú|eú¼ƒtL”QïnÒ¤ùž·›ikê1"=ap€ÃÞà†ê[Ó¬y‡þv)œø‰w£pËhÞü»JË%HCC†Q[8Ý3z‡õ  wóªjµ­?ƒ£&,Þ€³‰ö– *Êúàe×éÒ"¢û¥ W" Î Óu÷+ÛÕ„ì7xe‹ÕpoøÂ)ˆ;7®HÚ²„}õâ… ÷Ù|QOþ¢ÂwûBî·rH ¡QJá(Ï‹Ï%ä"ì£ÞǦ?{WC÷Ì¢5à9† N©ñí`Œ Ÿ¬gôrª˜V>æ1 ³û±;„ƒUa#3-“r$£ðà5E¸ÊG ¹bT6-¤u /§uq¥–‘M…¢µ¸‡ qA„]ˆ¶¾}T‡–h­KN˜œy }&Vç|^Ê^O™¶DØý¤TH Áîç PŸê¥ù ¢Ã:jS Ë/t]Þ¤‘3¶e®õ¹S닃!øxÏñÀ•Äþ_IHLFqhZ±%…=Â~€ )¨”ÙÚŠ¸dé@K’'?HËE<Çš¬R¾ÔdúÜÐ¥4)>мð¹ªg @Ÿ17>=v „æd3…óÑùw0peþCìaæ9!Åž2b'åþeã^;ÄšŒªKLçá¢1Yÿ¯Yuõé¼}à¤lεŸƒsÒ‚cIÙ¦ÿà°¼®Ìï~üxþáøôìäãÁÁVgs³£þæ—ÿøŸ`ˆ‚ÎgãÎùt6¬êÎË—/ÌÓÿØù38ª?FM_ÃN•P{8 Y“AD}RËÁ8gìc Id¥ e JŽÅâ&Æ(kfãƒ×Á^ˆDæ›+Ü5 †¼é¢ì•§™+ß»î"ËEÆÄŠ¶ÿ<´`bÐF†FIËŸ}…EU`(³Î: –°‚÷°q›)gs-ÌrG§^/¨ï,Z¾[)h+jƒ´±¹JÙœ¼µ¦³ßIe­Í9#³3°`ÙѼ°\è­÷f=’5R\BT±ƒÄ§ÊiÁ´þßÂ&8ŒMgÃL€#oX<>Í­ŸLsüB{mö}°•+øè&­õb>ÅO %-o¦Sµ±Z÷JßP·Ü]vR³=Ë6YÍßpê¶Ëh(A+v;±5!}û±Ã~n[2r¡Ç2ðz .ä'»=¯Íeµ¦ÏV\¾´è8/+uLmDÝcZ³í;´%ç`ãôx׆ôï ŽÚ6îÀ7Gg”¿¹H3Ï6$šI b¼Ñì å(9<:;/¢Ä©#鶲Õ^’k’(O©E¯à/éǃ?ízºÂRo·Aç‡:nâšx¼7êÍâ)Ö=°”‘ÿ~‰uå`Y§~#n•:ɸwG[Ã_Ðú¿Ý Su_‘à­º«H r…’|^~ΗžDÛדfÑoEM£;j6=&'R´=g*<‹æÒ§2=™ s7“’ÑÞ–>U€ùüן¾ð0}Ê$&Û ,unofiHMkâódŸù)Ns6œää(æ)lÛ0ãìq®'\¨»”? ýû4ÿ÷“ús5„ÌÔ±jÎBwpRÏi Áºÿ1+¹dÓmYF4ò…í]= Ž»h–(zpú_iìçÍ´¼KÂ!ï¤P‘]•G¡GßTïј¿½Kø†µ>ä:”\·Ýi]“×òNÌ¿ÀãÊ5sHÊûâË©Æ%„rõD"=Æù²Ü8Õˆhˆ ´ä½OWfŒéaÄË ‚6S~þ„“ÔÂYc!ÓœÝe1ï6}˜œl¤&šñ|ÙjþA6©ÛšLM&Åí¬Î®‘‰Ý–$sùTÂ`;_d¶óE´ôUraHZô ‡Þ»Ho°|/Ñ,…ïÇPý-Ž™öBýH¾qJD Æ-hj¬Ï¶»¶«ºf–½Ü¯‰¼Ï_àÓ±¸¤`ú»îœ}š%¯-máŽØnõ]yDŒì8(sÑŒäšs¡\û¨ý4¶ï-–:Z›m-vËöb'¶½B¹ckãéí§©8%§xé=å6ŸÙRÙ3@o]L[Úѱ Çõ‰z’Û:Œªfñ–]‘^¼ê¶§²|йeFuFÈöÌ¿eöm‹ yjç*R«mÜ7íR;î°üî¸pM“Î…ëÓMØúZ°"P¢il³8r+ã™g_Åq UÔ½ê2£­öôvQ`’{O,AÈø[ñN?ÚÓß8EÉÿÀþî½íä›ÿ¶ý}^±C%\ñ‚ˆ}¬úY•+x Ò­ø*F‹¡µfªrIç"¤™y.ϱPB‹"…jª¨^=ÁÕuø°ˆ+Ư-¹€Dpp›¸<½+1Ø(DÚJÄÈ,êä<­Ò,Kê“ö‹TèâzÔ^j«BÂ(¬kâWá‚’K¼*à®&kšE Í$¯Ì/ê˘Eá³–·Ô7]븷Áë¦4š¶?ükÁidYñúÔŠ·ö;ËO»ž\¼< “°Ä˜ÖhU7ʬ֦kl³Ún­}GWÔ«ÙXÃÙ—Ú*"_„‹˜‰À8Ej6)ÿTH?QMœš/yQCÆA`sF£pÑz–°7OhÑQXÜQIñ»6¸ œ¬ø’^ZãS£;sÃÈryI:%øÐh¾Ô3ðÛ b­3s×ø?§ÜUÿ˜U,É‘©…+[šô(ŠW1§ç*ê-¬ë‡±Æ¹*}‘ nÐœb u5ªšiu•˜2 Zļ¤)WÉ­z¡Žâ#‚¾ú]u\ƒõžèsA‰÷á E6ˆ¬ŒÛJE\`Bjåàjà´ªYÄ宸ª‚Œ¹8(T«»2f˜]îÍâOÔ¼î%ÈÓÉœa&|íiÝñé(ýBƒd}-´HvÖ× £Ѹû‰2UmWªƒÀÚY_“Æ¥›"ÌæË‘fOi9ýÑÖ×d)hòœÊ6³+hÒ5årÚÛÌôv§ø»ͧâV÷msŒÿ¨L}’'L´Ü4pf ô]xŠ[t¾[v¬z¬+iÜÖ’¥Ü:1hG¸ZIä4t£ƒeg¥äÓ?3wJ·õ‘ˆàgÖ¼SÐÜ2ì„ñ…“°²B¾ˆ$BvÏÄ_Ô]É%ì‰t‹Äðù§èÌ/Wý»ß%{‚2|ŠCËÇ{È9$ØU ÈB÷ª ‚I&¥ìø 5¯ÆüªC¸˜Á^šV„K6÷,€‡°Õ½NY\Ýâ‘K¡æ^_³G&a+ÂQ»=Âb&ò«ÉÑõCÉO•¼è­¯Y·ÜòÏÿ¸¼}b–‹¼°ÄqÜ׃ü=ŸÊ™˜sËŸÎçøá g´ô¸ìQͶ>°ã‘µ=·©§VçbÈ…g:Ã#µ;Ê—'üßäXØœ8ÜÃ-üóô™Õî„Ëò[ìH¾]a—©~—Ýh®ÛÖ{-9ʶÛÍö×já&˜òL›.ŲvûnÕü›ì¾Ë01®6\ø5¶ak…»™«q7K©Ü·é5DÅè¡0Ý]:-Ñâ:øŸVÚzt(øJ; µßFuoy æ‚øë2^OÐÀq—£à$22ZÂ"â6òp ë"ô†Üñ÷u‚#éNs$ÙHð’”q˜»Pþ?°]ÂûQ£¾c}¦V†Kï8+u!úXNèl7‰VDŸu*óî®[ µ·õ°‰âÁ$o뺆˜BDq†R¯ÀŒ«ieÆöÏòœZ£êD€@‹f–×¹3hšÞPÐn«QÙér ’Ķ“Ùô¦6]‹Çû³‘aŒÌìÊ‘„òš)^·!¼ð^ü¸+Áæø|¯c(n0˜_S±fô®h¤,Çé¤ÔƒrHĬ]NÊâ,À¦¸š%¢ÂÝù­ñ—~’ ç—ujÙ'2 „d} ÷fp'tÔWüyvvá)?á)k—ŸZ8diÛ²\T˜\A<Àxéäp' x¯wñ/ïK‚M†% $5~z9D”Î J¥X»ÚT±ˆøÍ_ tä‹‚‘™º-jØ. µL“cŸ ˆA›>ØÎÞãä"ëBn¥¾ê.æ—`¡9¬LD¸ûh¶r’µ¶zædÛÉØŸ'ܤðç²K`¼Ø¶Ë=ˆÚÿù—8”.%+Âé‘ÜaÇT¼H‘F§G  Rq$Ù ö‘úÒ 3ݤR™ž˜âŠæGÇÒ˜NÇo¿Í‹J­f'ͧ¼äL}Ê:q$M½»ë­ lIL Ïl™½–¼)÷ÆsçGJ"%ºà¶þƒYf£2@²g^¿^B‰ßœê›B @<¤æ9’È›Ï=·®Ôd;}—ûÌ,üg<½7¾ÆM»çy€æÒ«Ð߸t—IRI;üx7ª¡üñ‘[T .ÝÂ¥^µÓ0ÌžÖ˜²>Íh‰‡ÞP|™Ô¶ýerïÃpÁšŸ2wÒX-ب½`éEßù3-ˆVy2‘¨¯ •ø×X†ÓOñ;ÐîRnÁ5 b[OÔš°!™ñÿmÔùüâ†ù<í¦f&3qXæ¦3詵oÆØâ“hMѲ––&WüÖé;ôËñì®sVÊ·£â¦éü|ðnpt|±ÿ²×9?:ûñèlÿU¯38\ ú'gûìuÎŽÎOOŽÍ“?ÿ':-¡=½|b~  ÐZK I•—DžDÒ)ËoŽÎ(¶¥tjXçöQ˜²ÊùFFÍÄÔß–ÌI]ëXDOCÎÖ"µ›ÍˆýE7UZtCõG§“z.¨íb#-3}AW fƒ´Ñ8|¶oy‘e>9!ˆÕâš{LŠ§ À½2óŠ/ôL˜Ó}S4  ýg³QÙl›²Öªsy"3|zæÖ¯zžCÈ'ß̨Xò|º–@^}:u† dBá—¼â`¹žaG‹±›Äé ÎÕ¸¼¾®®*ðsDnØ7KŒàg×…Œ} *Bíÿ"dãð£ô3÷õ¢Ö4²à'‹ŽûïüìAíÔuùùÿPKÛ{TBÞ‰0Åá¹$cryptlib.vcprojíÝioÔJºÀñ×i¾C”A4¢³Â9sCî²@¤pˆ–¹WH¨Ú®î6±]¦ªœtÎÜûݧÜNgºÙþ/@éîz첫\??^ŸþsXäÓûں̔+3ó¹™i]&&ÍÊþÊL¿»°8¿0óÏÿþë_ž¾Ë\­ò]_§™Ù¶æ“Nü_ÿ2uô×›ÃJ¯Ì´E¦Wÿþ÷™ðÓ»ñDïÌÍ5_ü¡ŠP(±‡•Ï³îÌIô‹·›k+3ÿ^\ZX\_ýdzGÖ—-=[Z{ôß/>Z_[¾ºøûo¿?^ßøÿ&lÇßLÌU*ùbŠ»I²e•o+?X™é4_…ÊO=ÝΕï[¸æÓÉÇæÃQ½ÞgåâBS~jöÜ2Ã'K'%žÎž™èÓ7ÆäY®ÛO³g?®š²—õk«|X%G•8óÝ©¹ìè\+§ÿï¤FS¯k_Õ~-³am{¸2sïÁxæMÌÃm÷œ™èè·v ›¥×¶Ði¦¼¾`:ásÛ&ãçMïÌ÷mó/ç4Ð6ó: Sª´õ‡»­½kæõnu³t^åy¨ÁÃw«G³ZÓ=UçÞ}x[õ­Jõ†5Å»Õßæ;û® “pídß:ýº÷jcuef®ýâÙ›­WY™ÙŸÚ­îÔ囬Ð[Y×*{øÖ©~¨POåN·…ßL®Ãü Š×•o¢F5]¾-0j’¶GµESIý¼Îòt}_—¾ù¹-?{nÀjí¼)F1“ÿ׫­5åÕ ]ê°2$æ½îîj»Ÿ%Í" £b_m®mM´[«¦¨B>5Õ©³«î¨s†ϳRoÔeÒ|¿>¬TéÎX/U7ס Ú,ü’ŒK†>ám­ÇÓ.2¿šGo›¬é¬g Í:C¢36t˜ÐðGSø#Œo_,|¿ùÇÚë÷»Ëow×?nאָ¾~µ½¹µ¾öñåú³µõÝåðûxkšÚm*ÒßË5æNÍ&ô#ÒŽûÚÑŒ+¾¥÷u¾••{_†‡N*š´+.}©Co¶'«á«ŸÞ ¬©ûa ª’Agp\jÔK›Nñ< ÍҶɽ¯GcÀÃûÉïs*íE¼W¶ 5Õjefq¼uUÙ°¾v½²¾®ž«²l*sª¶kº[÷7ËfëµèÆèã)\ЇT6°tG;SÛDÝQÎ=?fj5 µ ¥æç¿[…°.›˜x«l[4Så©~w ?¹gÍÌ'Ú¼×ÂÚÚÓ“}î’I‹n WM5IÁmãüùÃ×ÓÙ3Ãød,%Pº”¦Þ(Û×~½ÜϬ)‹°ˆŒIx…Wx…WÇ[ÛÚz´YTÆúiIFÂ?vŽY˜uó©óð§ëµ¼ºó?Ûo^ooÜ|µýzçÍ.œÁœý4Î&ÏÄÀ ÌîX†s8‡s7й¦·pîë'*GF/Õ\ Dç*òQp¬ïKæÏÔd½¨2ÑiÓ—l=ªË®ö'¥n‡ KÈ€ çÈÀé'\¸–ÉÍõ#ƒ4 îÀá°øŒáÔá°Q0&Ü”1ÿ¼ƒM·2˜Ñ #¸-ÁÝÔáîêðÅWíí6;º§­.“ñÍ8_|>¾/gôgòO™²;jíéQ‘vÖm‘•™NRUgÆɦÌÑ楃Ù¾no;ZÒ/Ò/Ò/Ò¯H< Å ¹Ð=Ð=ÐC¢|À|À|ÀG,)ϳððh<–À<À<À‚ ‚ ‚ ‘‚$¼î<À<À<¢ñà½àààÇðððH:œÊ¿qìj2{´âz-èè艧GëT*­téÁ|À|À|"› 8_ààñ™Ë@- 3—JTÎCÁ|À|À'>s±{ððð>ºfˆ ‚ ‚ )HVT9ïØÅüÀüÀX?ö²ê“J8†… ‚ ‚ ±‚˜dOû—ÿ"‚ ‚ Hü\ÆéB•õžð2®Ïµ²   Øfä‡ï"‚ ‚ ‚D âm’Užý… ‚ ‚ ‘‚xÍ=ðààà‹G7¾#‚ ‚ ˆH¬Ï“ëá>à>àCÄGÈAAAA"±in^a‚ ‚ ‚ Ñ‚øB%ððð‘|˜^æ   ±·±ï+™(ö@e<@yyy"å9P{<ý=Ð=Ð=bõؼ õAAA‰$+«¬âöCAA‰?wêŸæyG¹âÇY&yêtÚâyåisyq­'[?µóGQ§WЯ÷ãÛõ˜ ­W¨2ÝÊÊP¬ÈŸ,uôPOÏ&Ó³¥ÉMßLÏn˜ûŸkã—ï=Ø,ýZfŽ×­é~j™žýßlú¤PUû¦¶ßÜÿÛpnmôÿ³å“îQûP*4û·&úË躎íz1P—PãÛݾ—¯e£Ç ¹w{S¾)mz¨lÆRÓ‹:¨_R_­ÜŸÞÆS…uaÞy7¹oáöz 쾃 <ÏCÏó~8^ËñZŽ×r¼–ãµñx$ö°âšuAA‰äÏT÷Âg®[GAAXA²AAAD"HžñÄjô@ô@ôø¦£?½¶í‡öïQ™¶r/µJµnŠ»vòm‘•™ÎrgÐ~ó…Ôá¸hÌ3ƒTVÈâ‚(T;QXÞ×]«„¡•²ªÅÚdI×/C#ÉÕ•’°ÎUû.Ip7H!kÏ&òÉ’421©Åææ`ôÈDQl]¸AÝ•Ä&¡QóSGª’w¡R>áL®zþ4ÐeïƒP*§äßë¥;âÑëòÖÇË7í!#ý·3îRQÙz·Q}Ã$åW!U&a8’D2§Ï&‚ˆ7…¿§M,ߨ&¾õ¹½NùæŸÿ¨ýxñc³óÃûægçï/jõ³÷­vûêýe«Þj]µšõóοv|¶_4ªbÓx«Í©Å(ˆ…C³j¥/²jÝæ§åG¬BÉÙäqâF' Õ-Ýî‹V»5¼üÚmÕëRò§¦!ÜêôšêõÍûé'B*äªäIgX]—'ºÊ'ð§lV.ùIˆ#Ù’–KKÂcõ²^®&NûÒЃ>;RפÔebcÔ¡“xš-èj×ç1 ›þ¹kW2±‹¨”êx*OÌ??›lœ³€‚®R£k«qp…­’zeµ«î$žõC½sO9%5òÛéŸÌ°dbXhÕ‹ë¡úq=„ÄÔ\ºvç$’ëC¾(ËdÉ`4Ú8.^Q¥%!“ÿž;ݾ3Kc~!qd¶[ÅçŸÔŸT¿($‚ªª|1ÌÚZÊÚxƪ¾ªç±Snȉž®½WV”d8Vé€Üš*2à;î#ûAh°>¾ ´¤>™pêæ^r»eG|~ÓTþ÷µë8ª«7ã^¯2eœê×QÅ£bFqoI"oßœ³Hj€ ï`òÙ–õ³ SïíÃa=Wo^ͱR%š*5©‘íHêêœÖc/Dg¶Qeóþ~׬Uà~²ò½Ê.ªñA’¾W:"’…-³ìt[m0ìôáa9N×6Áe‘öR# ªØqka»1Âv –¶[°d¶›ðdà8Žu†p涫"ûÚ=ø®c0(2Hî¹á<îÚŸÇ]Ûóø!ÀïEgþÂn#>úöý½õÝßZÑ÷¨ó¦?Ü£¶† ^a£ë5ˆõ¸º2ífÅáÅ>Á-rº:Œ`p+vÏC ÍìmV¡¸ÜþÛô,ÈM¸Güvƃ}Æþúy—gÍIÁ&¹ëkpÄè rÆä ç zÆì v?Ã;#<cyÆ‹}F!û7GÓöÂ~ÌNÐõËîOö;Ãh/çxŠÉnÎÑ”U±=räŽN­pÆÀ~;~/¶¹ÏôEêb‹Y`"\ôùþAÈ‘§ãµâî) ìon]¥Œ¨\_&çü1½"éùûöí[‡kµ}Í^-Ì!'«Ûšœ—Ú»žÕošî]±´±ãœ…õü]_Ø2¾´e|U±ãý-‚‡Q÷qxßmn‡½~·óøK·ÙéÞŠ„½5AX[ Ð/ׯ¯$K‡×kµŠy…²¬HyÛŠcÍy¾üPåróbÍw£]+ÎÜRPz{!©i{¶?Ì™ŸÜ˜[$ãüÆ®ÊvbOlŠ»x §ŽÞ"9VŽÚž­Q4¨ÛZªgÖœ]kÎÌ–óÄ–q´Š\:UÙW´·Óý¸ßé÷­P¾LwƒÇÑø¾×[áX9–¶–*ùÉžsÛÖ@’Ÿ:ö¬o‹ˆkgtíMåîQSy­ãP ì…b`+÷vBqo/÷¶Bñ`'‡ÓÄý' ýÏm“ÏE2¬tçCáó]ž;érg.?s°øùô-ckµ. ܯ܎VHJ˜wsºXÂYa‡Ñ[”ƒk¹‹b1æCÚM7°‡®½14©MóО9!½-ÖÛÕÛíÌÑÜ0dôƒ…{€¡çÏËúYq®æGÏAg;qx#Ð{×nª›ë*Û¥z±,…DίËÏRèçëËGÖÊâ]˜ÇÃãïq¿Ýy/<Ùºôt¸§ªº«¾|¯A5Ü|7EVò¡×ïö{£ñ¶H—•ô»æmwï)Ý$EhîÆÍÞ]÷¾×¹.·Û*Š(—úƒv³ßÜÞ6ïÔåÒÃ]oüµG¹ôap›–—Kî¨÷ñ®ÝoŽFêeõzœ?‘Ê×Z”KÜyà àDŒ“•»°0;‘Ãt>£A`z*7 §™9ŽOô0_80[ianäÃØȇ©±œSå©¥OÔlŒóTm¾º0a_]˜°5ó›ÐdåùSæ3 Ó5ÌæÁÓ”Es˜žéq~ìEóx‚óS=ÊwÔòÎ9ƒ§×µçGgGÒ„™€áüÁ™8§¸T ³x!SR˜:'¾O9îLóMâmmc…5ÍqMsd”Ÿ} Šß| Jprd@BnÂä9œ°()NÅ¡0“sÊ9Là¥QIQ*%Ï(UIaªs'ýZ‹s“9'ÀÙ©ç‡8>r)ŸÀc:“Ãt/"ðÌ‘ˆar(ÔÙ‚‡‡<ÓÃüˆÍða®Å(Yo‚Á«S"6 K*LØZŽÓè~QÃé‰Ü„.)~–±Ö£üžsÏðœ{6={Ä÷2RµÛ7 ûÜË+ðåN“%‡§z˜àã[kaî ƒçq­E¹s çGJ S Î#çç‘s!™GŒNå(¹p¬¤8•`)Îõ%á±Îä0]-³s‚ïF®õ(ŸÇðWR”ê<5ÑZ®'»ðÒ¬¤8õ§^àÔKœz SYe­…¹ÁT"†ÉÆ4†¯á¤jœ½ÄÁK”êO䜾¿ÖÃ|*Ÿ±€ñ©¥„¹—ÖÂÜHø3¬Å(9$>ñଠUÃ셅ąᩦ|åƒñ™æGœi-Ì' ß©eM§F³© Ÿ@'b˜ìÀy‰’âÔKœz‰S¯p*¼S \©ïäƒS„µæ³Ï¾K(¼í¼Öãüz.N×j˜¯[«–À¯ ü ’x‚¡O(3"SüÌ9ÃdŠ_HÑZœK]œK]œ+BêKÈaúÑJj@=ÿÿ`ÂÏ ÈZn@ÇO0±y<Á•æ3/äpþ•ªaö‚…Ÿ‰ƒ>ÓÃüÀYP9ÅïLóÿŒ‰ÀcŸ¨ÍØrbF—ðíK‘ çø:–éQ¾Ä÷½%¾í­‹QZºÖÃ|f°éžˆÈªòFp¥‡ùÂ僧/k=Ì—Wµ1L~ Lî¼Îä(ý‰à·œk-Î]Pœ»€çÕ§¹àaÀãl­‡ùÌÕÙ<ìõ(ý„ €VRªÑk=Êqé” ¸µæ3ߌŸéñ­4ß5õk=|3vÃ÷a‡1~"ÎñM‡DŒg®õˆã©óÚ­ÁÒ`9[¬f/·Ü¿}»}£úÕ“²^§;Ž{ƒ»Ñvõ²ß¢žýJó­'t·ÞÈ~cy/ý¢<õ†.,ß|P#€6ª9š± ”Kú~ý-ùU\¾©çÓ1?ÓÕré²G¯óʲö奿‹ÊPÐM=ó«G!u˜J !0[ê9ê/¤d}Á*`½v~žKØ\:$3-=»<{MújùVñot½JÓonˆ^Hü•~Q¾Ù1>Öლ:4rK•7pÉÞQ¯ÔôQÏ—Tø„´¨Og„·ƒp%Øl.MLÆ‚¸jþ‹t¨*0ÕšÙ)6C¸±#ïŒ é"5æ<êËoÄäÍ÷’YHEf¶ËÛoOV£ í0‘)_)ê'Ý©¾U|—ò¥|=ÿÆ~R–ŽVõIì;s=Ûç=Dô‹.›™Ž'­lêä"þD²†œ9d}|ê’j@6$rÉr÷D*Dûc_·WR}ÞnIU»«q¾P­¼IÀ£ÒˆáÌK¹ã݈Ûä<³)ߌELsÊüH/ìSFÝÍ[y­¸Ïü»À´l c•€LÙ³ná1ŸÅÓŸÞÌ‹>þUQ£úUŽÛ¨¶Ú­áýà×n[§ÂïÞ5&:9£K=Oê|ù]£Úò8Ò“¼ŠÊPAµ80¹RŸPàêo¸ù6šÿPK=—–r«vÏcryptlib_bds.cpp­ËA Â0Ðý?Å@…‚ýÁ½ ^ M~M$MÊo"x{ƒzg7ÃæÃÿBÄ#™˜]j^p|º4…™Mí}µ^÷Z6™Œ—%fÁ%ÎjõÕŒ[õKL‚ZPƒ }Ú.Ÿ~ÕòW±JnÎÝwø‡‰è PKÛ{TBçRC7 cryptopp.rc½VÝn¢@¾7ñÎÒ›6²‚X›x‰‚,)#bÛ¤ eÔÉÂ`\פ/´7ûŒ;(XüíMݹ sþæœï›aÎH<‘ ‹“xšÂˆ$KB·Vƒ¦˜¡Àp/ÙC2ad‘Ö«IªVn„˃PØës¡Zá†O Å öÝ¡§™Ž?ÐUͱ­Wß}}ê8–›ÅáØ–#I`ì*ž²8‚tŽa¨¿ M»kyšÊÈ‚¡A¼Jr_\ÝÍ’rF.ÑqB@§³$s¸õênýn=Ùì™Â·í.·jï…—ä:Þ «ûšeÝÁû;”Cu`øºíÝm3(þ³i7•jÅRmÃS ² w1,Óý!‚ëuÊ ßão Í"“8ÀþÍðmCi)Ù’˜¼I*½Öéa–˜nåjeäú#}àšŽí›vÏ\ÈæÕ ôLKÏ5ÐDE”¹¶?p4¯;<6dî=K5Ü'Õ}ùwsj}¥éÏ(;q‡FfÇa‚ô²U0’œL{oåÒðµ¯sY)dÎt®Ê;ºaÚÜÂGÇrº ¸)#tÖ#!6é4rÛ‡[ÉU¾—ÛòýXJ–}ÇlŒTËÓAèÆQ„iš"S†1LØz‘Æ’1Cl-B3 „çdJ9ë€~!¢qˆ¥°Z­êۈŢ>‰#á\’¢kE8ËóŒ hˆœöÍ jx{?ñt™w“ Vû Ö¶*à‡û|t~<²È–"("ȧÝMšbFQXTV@9ímá »ñbÍÈlžn*+øv»õ]‘M¯á"ÄÍ:C†!ö3Ùƒx:ÂáI¯3ƒGj­ax:ªÏâ`9I pG4^ŒúŒEÝÖ¶Ân’¿b—iž‡@“å›Ì ¹-BC‘åÒ²›O~Ïíݼ¦=ruíZ7L©Ù·Lc¯íý¢¥¶ù–Q”W­\ˆøhX¥Ž%¼±7šs&”Wj^Xé\L~óÁñóvàp¾Ç|1Á»í¤ÿs??yO4ß×x;”é¦qzrOþPKÙ{TBvê9'ØT datatest.cppå<ûSÛHÒ?Ã_1xëŒ$GÝ™À–&¡–×a'»WÉ~.Yc%¶äH²Ùã¿îž‡fô╽û©ÚÅÍt÷t÷ôkfô“x“ù³ÚÈõ’0ºmŽkË?éF?Hø5ìÆ‘?IxÛc~c7Dn0œ…á$7–gF&Ñ<»ñØný:çsn7-܉?t»õµÆIÄÝéÑ6åS˜ÊÁòòûîÉùÛþyû¬Ó½lvœÃèv–„——õÜ›8Ö——“Ûòƒ§VkêÎ^Ó@à× f<°“#7q÷–ãÄM| `²,î'ã0 ç×ã½åeoâÆ1uKü0XþcY4µ–—ŒžNúêNÎEï]çªß¹ºº¸j°ÚÁxÁÂF0†kuöÇÝòà•ya/l=î{ó(âA¢›öÙùûÓÓtÄ"ô‡ìbžÌ溓²º¨ÉK£0bŽjlµ¨SßµpA‰˜Í¿ö§¾+ø̃!>mløõå%€±äñ(b¯_3ó`äG€~×Z¬&Ûb`‡ø#'{ËK0;›Ô®¸‹mH\fù‰×X2ŽÂoÌ»W¿Eaôhè©õ¯VË–åû€ß̸—ð!㈃ ç¨_la˸&ˆ#C?Nâœp`„Û‚÷ÆnÄÖwʉìJaá¸æÈQ˜@Ä“y0‡dG¯I|‚ ÀXl•½åÉÿ:÷#>4óéŸH›?Bºö-º@rÒJ§¡µ‰È'Ù^} §þw>ì©ŠGbãÆî«ßaÞK1̬øÝ(&¾„wruþÖ©7ßòÙË £áËg«Áv_Ö1TØn°÷A ÜæÃ3Xáˆö}ƒ½\/!þÅNÀ ¸²¨‹4o ÄI}+›‡‚S—óÄ‘Lk°|ï;-LèxòJÝ; ’ðúwŸTI8¦ãmdNVÙpRPð;@ÜÊßщ±¯``•|Wâí&ŸÎ’[GIO ~ûãÖï¨Ókl •_-.Ï€ÝÙ&‘ú[`àßu˜„h&÷–^¼`.ñÄȆ0pŽð0BÂý˜Ñ(œHA¯gÜEÙFà¶"%JIÑÝ`]úˆÞë#Iõ IT†TøEKg#»ÜÁ¨d;бVÛc@èY÷Ã!ÛeÃÇÁZÂÆî‚3oÂ]Z»9j>Õ ÎìØœi0º5Øv}³„°&hÏu2†EµÁv4e|s&9+»ÂÂØ©#æÚÖMMcî’tI‹Î;0gЈk@»þ½ã7B;#%?øÔÔë…dv{Gg'ç ¢½n~m[ÿÚRåʳ¹©™øµ‰K[.Q²_ëu ®"‡Pm‘#ñ˜ê¯0iuG.p@±°Â*€Xªz Î_¹ûtiê6­Èc<˜e!€–"ƒ”Úˆ†ÅçzóŠÄ\¥»Š‹H» øÁü(QÙP°`(¦14þE<ç0"×9¿t!ØKCa»=çGÎÃåiŸôG<þú·ð£dîN„c~»H€œ¼0ü5f}?…íbï<7DD¸>£ñuÑ]XðÊèEeÇ/i#ßêæmßSa‰aØùÐjù×€°K냭®2M"vAÒý¡†]8¸”%¤vÖ>¬‰µUNKÑ8û!C¥"Ðâ$[¾´4í'à}š§µ½%)š€×Љr6–Ú p†îÁ¿õˆcÊÍ}ßsãä5º¸õG‰mŸo$)ÂȈ¡’`´ Ô€¶U×ìt´3+òH€Ç9©+2«RT |/Q!âµï*‚"Rø2òµG6:–.ÄÛ Èõkõ‡ã?Da0ÔŽ"÷öÒ@‰Iig¡ZTiEÎhBnž%dóÞ(nœù1•ÞØ”KƼ@šu"ò±µlÙ,òƒUÌš?Áè5'p[ê(ÈÝ£²0÷ ¿EKJe„v0DÖ€ € VÖGÎQäƒÝ\S¬,cîD~¿›²,Á#u€j#­‰dÒ4#ñ–Pæ³À˜a÷à+D…ƒ¯‹#u].h«Ëg!ìã(œ:4»ÛŽ¢ F`Œ-eHï ÖRïzc>åN¶nbʵ¡(—X4X M=™Ys{Jô¤]–#ÜyögIôúò—>ÒÄ£F[ä\ >sè§rß¿ÑG·F¿VK5BæwÙCÂÅR_½ð5q&ª #‘-ä¯rtºïÖ…lFÁ‚º Ô§ rW™+¨|M&\‚ °Ú=Çñ¥XWðÞÈsEðh+ ¡ •®¦¦AP¼" ZUŽGä®ÒZI†¿ðÛcJBË$ý‹êPK“$cLú¨sEùJŽRµzÐÓÐ:Ò†‚d`µe‚_D¥gV«›ÖUÛ{ía8…˜‘{‘›kO²UND Ž´ã¶ÆþùO¦ÛÎÃD6kç¡”è˜jÒZëÄ£³®žTèl0»{«Õ=y{ÞêôÛ½þ›ÎÛ“ór÷ƒ ÑË»ÖÈàªwów¯ËFÙmMÙ¹CåRfú€´NÁ­]ñx>IŠ">‰h¬Øä*/“K5 -²É5+B]Iå ÄÂ-¶ß/AJµRÛëêÑ*­×áStºwFÓDJ‘¥Ø¥YÙ¬j¯]¾ÒLQlɈfüÌ¥Ó{wuñk¿óÛaç²wrqnYF©¤ù¿æ¼*ö6«,Žù2­M‡$ ²´i]LKt»âC°è_2«¤nZZ[³´b®‰†*½ã7 ­•ÀNñ§ÎYõÈΩH•1°ê0Æ$FTáJ)œÍ†²S¬'¾—Z¶$¾I9G†®X0ì]]´˜?M f ’,Â+þ@ðb–z±c;¾N±Äìú³1ˆãB˜ªA!2?\ý,~ÒÞω·@·Î!¿gÚû1!×s‚“R3Ž‚×ÿp[<paÜc.Š /a–„JÃÔêÙy“ÊY=ÈýHñŸa*ªƒaC¸’">l0½'¹Ï ù3q1½¾‘• ‡=±PÅÓî™jYhé5Ÿ¤OHÓ~M¯´½8Y݆I›š¹îG˜Ógºã A5˜!öœK~®Yì–[E•Ågr5ùC® "ñ¿Õ~¦f¥DÓh fàÏ”ö=D;KSÆD6_¦k–ñÀø°pÕæ9Õ°aä“OiãíXO6þF²˜j½…€þ6ð Gøapvس_É¥#_é5M'¦|:àyŠŒbÊPȽt¨Éí ¤È¢‘>ÀêR/tV b-'%~(CKƒuίþA1äc\¡a@‡î¨ó4tjº t±Cf*e…E¡léflbëATñO> 5ðTÂ÷² HV+5'D™¿Ü€eÓf©?y™lˆWã( ¦¯Ïç4DI\Óáî#f·$ ºf&#€¥¯k«ø[VS¿g’òDz³;æü PKtʯ~2>â#“éZ:A²¥ ŽªNˆ/ótšo½¹¦$ ô´7Ê€…Ö.Òü­ Å^VÖ± rØ^ l] a†Ò5¯a)‰ùt¹‡zýfz_ðô…ãH†k¬Ùž¶HU I˜cŠ…$4¸0L1h—»XšØtå§Ä.¥+q f"†}MUó—d¦P4µF“¹@H¨âj–¿¿µÇüׯ¶ðÏƆA¶6Ù©hÁí-øÇÖó\di˜Ÿæç×Ô~H¨¬œðæÁeb!#Š’’âÞ]A…¯K§víCW²PU(#PÉDÿz–bW¸V«u~Ñ¿lœ¿%Z Î…˜Ù ^’2ïk¤ÄèS#¤S%µÚëâx’aì¿ïU»lö¤I°ÄW>Å*&}8s1ê4Z,T`÷UŽRà”DS{2‘BÍš¾ïúPjU¢…õѧ³\ßá¯pë/L·¶R ×—ŸbÞÍ ¤À›Þ ÅÀOÓÕŽZYNc™áÊWWäAJ÷r&k# þh¨ýÿÚ}õ;ûï}fòJETÕ «SbQÀi ö=:=R÷p“óƒ-Ž68[¯þZbqŠ N‰½¹++lìUÛ觖ÔCª?Òî¤ÖLÙMŒawt[Îîäj©!»_¾z`™|Êгä[êP+Þüî©]D@™wLtÏ6ê’yeHˆåUJ Ö$Uœ×A)Z#ª“†Åpšà+A‡ЫîY}ß¹ñØNxÞÞ‡^ùWl}†é=óÇœßÕå ” }  *¬+ ë1œ¢“ð¨]K‡pUPÎħÐØôæÆã¶Ê‘ÒŠpR_¥) Fs‡FŠÎ኶^4(¾º'}ÀáP[ ~s{¯ø´o ‘vn—ÎÉ_€j iòÈ?qTÑ3K;ÙÓÄgu´±xL«õ®Ý}§ãĦ’³¾é*,<ìû¤Â÷~îùàÊ£1=¢îÚû|"/¹øâ lÕöe)q!&Š¬'­ŽôZЦoÙ·0úâFá<×¼ÓüÛ_š/ oƒ"Çìà@íÖ«£ æ½éì%5Õç#u”>sûwôYk­5õÕ 4¶ñàÇ_üÙ7úå)axéˆ2Ÿ¢êÓ‚$ÚM³ÖKã~ÜœážAݸmK‡¢+ðæÃáî–Å0 ?Ào\/ ²t×ýãöÎ_±´,n’~,ƒIÖ`a?˜óS@…” Cy¼/ÔÇÅc²eyƒâ‡p$e4$nÍmìK U ! ÉÞ"IÈ}ù¸©oŠ›ÜH#ã1=#=¥†¢9.]-7ÝmŽØŸøSzg½øÝ&ÔœD.¯"š7Ë2]Òë•Æ‚¿´ÿ€…Fú ¡wµZ3. 3­aÁ,Œ 6­ô¥¾JQ˜K¬›j*RßHAßîJ%—”ÕuÄ›=©]ú”Œ><# Æ Ò$­Ï@„A"¶£ K|EæÓ§Oƒ×Ý4ELîTžàÖqüî+0Èz¼®Èß4Ïü@ vu²­P‹oÔØ (¼¸œcEa¨[óÆ1±#"Ä"oí¥Æ‚ 6Ī  Bàì¸Ïò$SLªÑ§‹¶ýcmo­ÁüTß?£&çt$ÝÎ5wÚ "^IŒøv€ß`Ÿ7ýt'œlžPM0—…ˆ– eZˆÛŸÖíS‘ù¢Ïlƒ>b‘ Ø!ÚD9;wuñkTæíïûËù 6—_>a׬&a"l{îø(½Jì¤+DÌŽBoN‡ ¾h^‡¡¼Nýà º „…3 Vž(4xu—áþ$~æOÑ¢Îað¸ZÑ¢VÛò¾jƒ¶'×ꀠÔAÄhÞ„fd8±Ÿ„½¥fi¹OÎ{¢˜³ö)XKµ/;^b¼™kV¼™ý€ÈŠFpLä_„?àÇ ³Èïÿ®L¦}â'J»Ðà;éeT$fñ±Ö„ßè5ù¨Ú¶‘ÒŠÏ‘:VÝâ©;¹î=f_H-ƒýˆ¶"¹4Ζ˜ƒîKHÉåè NÉ¥/tIš•òRl”Š>*«_S%ðâ`¤FÆÇ ° «ø±oÞ¹“Ÿ(ºg»ÄêÃÜ»ÊoÁÉìñÁä öð*`Wm'˜ˆ*w5®À”½SÉ™K˜G-äõ£Ð±0*—epp¯«t´yv¨p8ZèS?C²Ü%»îóÉĶÜ@®a—MKœ’ ðæ5`—ÔjÕ|g˜<¼;!>|§>é·jžP´—ŠÄl({ B}‰°ÕÒÖœ­òbXE}=lO"?–Ç›ßÆn"Ö–üVžl ¿Q¦ÛCp(K$¦Z¶ ùÑŒ Z! p§óPÍ“%C:_ÞÐpšDÆ«¤Â¦2ïÌ ôjxm>Åí‹òžú9ôÔìë7@‡¤4b”fé¢ Û,*SÊ ÷zË•ZqiÈ=Cc˜ ÞºKx“õp0ñ1/ âˆÁìX¨½ÕɤØ0Ý©ÌÅ+JÌ–M±_œuX¯ÓíuÙqûä´s´"êœÛ`qânù_PK=E\VÖM” default.cppÕY{OãHÿ;þµ³Ò¨ †a8iµ )ÃD“„ˆæöV+Ëq:I ¿¶Ý&»Çw¿êö#mçì0;· »»ºúWï*óîLéÌM}qèÅ1ÀgBÐÜp ±ïzt ,± §Ÿy0W&KøD\¸Ì0~d¡ç§S oboq¸x£-Ì+‹¿§4¥•¥SÁ\ii+ "¾lÆ Ý·GÃvÇvÎí«î€tø2ÑphF"\¼(L¤aÂæ¡Â+ ß}pºcû¦=î^FpÇGG';ŒÚ½qÏ\? íÏ»(Ï{×£îl$¼ÈÄsÎýÈ»ï°xAy³i‡ž„È¢°Ù,‰wqühÿR^ý$Ç û²}Û;å¡Ãx÷ÆÊB<Ž Ñ Æ˜¥¡'AßMÄ\÷ž¢yÁå&¸Ë—àÓp.%N…ä•ιr½)”,d ‚÷—{óhšz›9D©@Åù$õ’X¸È{¼_€E÷ pdcÂ/žE‡hEà»|Nߘè%üòI:á:Û *az£>º‹}z=#4’Q›¹C~@ö}´¼OÑ»Wöh,½Ù6”t“_Ãçõ$vå¼ò’ßeÖ÷ð–óêöÚ=°ÀG »+ IÑ[;;:vš¡Å§ý³Ý@ê¶1ùõè7”›HÌ&­ü,oÇ÷ÚŽ¼¥!ï?¼§® db¡òë‹LYPڦܹd¡ë“Lº}&×Qt#”‡¬,}p€Ö|ŸƒÂLçÅK© +׋šb¤¸PÈ›¯?K`Å|‡È›dÞ,tuµŽo›ä(º’>—Où!_îÓ'Æc5š®h(uD?Òe÷®V±›$ñ‚» -£hµÔSùÇý@âú«€“/Q¶}O—Åc÷NE^ÅA bR¿`ÅF ˜ &I-ÐñÕÏÕˆ÷×ç`+ì+xî•Bʤ¿_I©rPFÆö+²+6làcÕk¦Zéª~TÛ—ëj{¿Üµ@Gø¨jÔÞ_ü1ŒÜÕó:aI¬¯ä¾â-\^õt·åt:Æ¢“¬êÌž+„ë-dîÄPiÂG_–—ÌÇ%ƒÛ^Ï‚#õ«‘Y8+ΤâfÅ=Ç‚¨y)ýëñb¼Àå¿™|;:“ÇP1».Õ%㉦¢ª"cèwŸŽà!â÷.—å§ ŽÓëlÇú%F$úI:7›_†ãëáÐé\÷‡Ýží´G#ûfìt£q{б‰Ö³–Óætha¶=yËUs÷4ÇcUT+Q*CìÎË*R: êÝ“'KëöšˆzL“ìU3üd#< Ç” „dT¸nåªÍ¥—S^-ù ¿‰3ù@Žä’΃ä6}›§ØhF„:§.ƃޙz"[zåAÏ,‰²""!›;¥TR:Ô%Æ<*ó/ˆ¨ÈòïÊ¡jˆ “)Tm2õˆ#æAKºüNJ¹iq¤úWI‹MÚœbçÉe{)äV÷n½Jî­ìbm¨T„j}REZÁVnj!_…?p<5ŠŽ¨@–Ÿ˜X Û¢,”L5y¢ 錧nPÕU¾]p5ó;fj9Sc¡ñµ:²%åôÜõŒÃÂQÞÇçÙÓ/“—v[Ÿ&‰;§v8%¯W©.h=Å—+ÕJõœŽ}Jù û‹GÕ$¸%«¯,¨—öj¢7Ò dÛEɧvwÜ\9—×7r¤ì|°;s‚íµnUâÌœ¶ŠÔ¡êÕïiÕ¼jõûþÊÛ]HŸ­>Ýñ5n¬µ…ç+WWq„QKVñP<íWòÔöK^]rˆ-"ìÓ1áì ¤’‹™'Ó N¨7ç¼}!ç…ìÔš¥Š‘E8w§6ç$›«ÔOhÁns4ëm2–â³]ìRsës…¾RV‡µ)B•&2_ôÛÿ&DdÍã=ÍŪ[»û•,·uß´ ze ü‡V¦DL›M7‘ ~º½2µ`Z¦¤Õ°òØ®"¦S]FÜ£úEEWmï ãF©\OF:#½Ô–ç9õ©L;"S?ÜQÎfKÌ•‰ý{ZÒ‚Ì_?Lk¼®®¯/¾¾ÚæŸòhè·;°úPop㥥EÅr¾¸ •ÏÓgÚmÍæH@KÝɯq%yÿÓZ d\ˆÎLÒÈï­,ô¨úú(%` Ð 8¦ÙR¹F€>˜`mÃ&Qõ’ê›üªŸ”_‰7\jßó»ê•Ã²*BæÓ§"å!ÈXÉL6ÈŠG]í2•–¶lü 3{V^*Ùâ/šâó¯··2ç¯{ê"K××j®×ØX xJͯÒÙwù@ð¤2wv:¯¢¼ |+êÜ8”:ýêF¯o|E ¼¤ýýæÑó¼^·æ$kCBµcý‰ªoŒò³Â©Š…Ò­2õ­fsx;vúöhÔ¾’_ej8*ÑùRC}·æÕCöõ-¶¡ý½6ÌŠ6…­¶í¤œ£î.ʤRȼf=‡ãa.9ÍÌ]ç{­Úôc´ª\2e×í0dw&3–4Ó:ŒªÖT·(‰oh‚ÜÈŽiîÕ³áƆÞ¾…ª"¬þy‰¯«ñQÿ¿=¸0þPKŽ=4ž„Z9 default.hÍV[Oã8~Ž…¤Á¢ÝÇÀ ¥IJ+J‰hgGå":R öyh \JÆ*0'¦ÚpíÞYÙ¸(ïSâ@äß—#sy´BµÐFÖ¶ÃQ˜s©p˜P?:d‘}ð1–q ¢… \ƹȨb9ÇŸ¨R4L2à Ƴ/ÓéàloÔû¥‚~TÉþ¢p'šPÉûŽC…È„ "}¡o9‹ðˆ ©‚Rõέ€í”î*Ÿ+¡ÚBJ ::ûFèØs‡ÚÚð3Ò¡Ö‘Ý¡K4‰pþBU\Øv“Šê ›Zy~™cÞÂqgõFŽ[‡ŸçøßçyŠU"ò'ÿ{æbŸ•(aƒýíó>‚ýW «N˜/6rÔZ!k…¬6G–6jpJÙ¶4Õ€•¬•–ÝùyÎÂ!“Ù¿¼,îˆ;öÝ+2r&SßÓWàÕ3²4³ÍáW°Ò¨A¬š“;ýÑ@[T¿Ûù³qH9ÏŽj Î@Júø‰©DßÉTªÂ²€—ž+]ºxõÕ™,&³K2º¹%WþÁ|Œõ?rysãÕÿ†ŽWÁ®=ÜRfó¡‘Õ™Y P¥¨*XVò³ç·¶Þº»~´Pës7{Ò„su&{ñ$MÕ1Þ”<ÂÒXÖ!¼™fúÍle݃ …çu~Õô¬+y‹R]hóhͪö0µ›‘~õî ûF?¦<2ûäTß÷l‚ Œ¶y÷Bhü>f/ôƒÿ·ë¡­QÓÀ?·(6J¡[èûú}òî±ÿ*¿­Ó[ù­½µåöTÚ™:voNµfN½h¼;¹PÆ[׎n=S–BÔM©=.ÿöŽúøJü‡Uµ›Ñýƒx=:Ì0«Š´BÞêþwõnUÜ?A°˜f3#ÉÆ÷ëc°{Žû3O?ýG,FPKŒ=ŸgŽ…3des.cppÝ[ûwÛ¶þÙú+°ö¬•Ú_’lÇîÇéÉÚ&^œvÝ|J„$X©d­Íÿ¾{/”åGÖä´››Ä÷ñÝï^„º»ËbžïŒ—K¶ÍY,&‚Çl´bç‚=‹›ÈlÁÎf"aßE2ý:WÃ[»»ìÍŒ³LŠ©H£„³˜³(Y”$ZÎ8*D–æ,’œ‰”0|YŽ1fq¶ˆDºÓjí>j±G Hä þDl]e’I~-EÂ'l±bY7ç±g§çJ+xŠ2ÆBŽ#æî ú»ž‰ñŒT–2e£LÊ윚ñèHVÊ£¿ŠûV$I6MVà”»×¦"T²Ã^°¥äE±b‹ÄÎù²@³æ|ÅòñŒÇe"Ò) uب,P º‹páéX®–ÅnÌé7“YYˆ”+TŠhÎSeýóìŽdŒ"^•—#)â)ó*£Œiî€}çãYÊ—0â‹ãå2ÁРšl*£ålµóˆª&ˆô¦X€—×Y PGKðv,"ÀTN!ËL9†ñt¥c¾ài‘ïhá9ØwÇ{sØÿR¦âýÎ<Úû×N´XÊLNv\N˼¬÷œ»Ûj})ÒqR‚Y_,dzÙVÃBäãf Z/8=?;>9½|zúí‹—måñÙY§Õ*VKó {šdãù·¼8Nã³²xrÉØ÷öTLOÓXDé‘qÐBkÔ× ©(pÉå¢,ˆÊÀí)¾˜-¸"…Àsö.1{qvúú‡¶RþJø¤êO!³¢Óú¥µ¥[àjÆsvÈÚmÏŽŽXÐao™ξbÝ÷݉úï µE­ìí¡ž¼ESôGöä 6Ès{k'ðóanÏ–¦Fƒ8¥áX%Ì×?klùm#Ñël”8hJœLº]2ð^yƒNÕ|)U$J¦Ã\[‘céŸ;tؘhÙ*ž(úC#êÏÿ›¨[VËÏhµ´¬¾ÉŒÁ bhäï£Æ`“4oMšÅŒûäyy¡ˆkãNZÜÃÛ )Ìʪûq¬SP%ôz•Á^ÝX‘}Dý@9U q  C5ÎR*Ê“(‡ÙLLØ*+Ù,z‡+Șç9j€xb=i^Èr¬VU”ÕNÄœÖÖÎ:é´rT3f¿¹0Ù‰õ\¼ç±áiðãÝDÕÈvoƒV1Óù»æuï/`k‹å;ÎÆ%íkÕ†Yr:€À”7ê(Ê! »ê˜àAˆö–ŽDØÉß/#@ Z2莊L:t|Z&‘„uVNg04¢ÄŽAù’ó’‘3\^¶iû¢;xòZ} “NC%ŸÀ#lÌa9IV¸¹fÇIž)»ÎɈ38½×çÀÎxËù2’¸¶,%ž`Qšò4_îŒ:Çdp‰ò`œ-Fä9‰rØù~] ks"P©lº‚}¾q£²Míù!d±4+à†iÓBùâ ‡êjE„Ë‹!ðÄ  »@\ØÓû$F“þBóÓƒçúè÷¡ß`ÁhcÏ!ôÐïC¿ý´¹ÐÆzz <‡Ð@ýxŽð Í…66PcB8t{ð×…~úCè‡6mÌÕcà9„þú}è÷ ß…6Ú˜¯uÁsýôûÐïA¿m.´±Pçúè÷¡ß‡~Ú\hcýÖ‡â>qq Ò·Ûî:ªUôŽ ”§èzž"¾F5²¾ÒŽÑÔŽVùÚSD’õªˆ$"Œ¨"Ú€°Ó'ÈSô½FOðZéQ¤(‚5Œ&F#ëiäIæ+TIDQE´a5& V[!Èd ²ÈÓQƨ1WE£†ÑÄbd½QP×sŸQ!Åûu\¹°pEÆ l´mEŸ(š[êÀBP|†Îo©²½Bï]ÍýLÈb0R®öT?«\ØShy:*ú™"ÃÈzšSú™òyI¹¢£ Ÿ)7kʾj‹´3‰Y™³ómUcÖÐȱN †½ &ŸÉî@¡âú5R䛫Añun÷tþ†:·ºÖ5  éödW‡˜iêPS(\=q 'ö´W[ãé‰}Ë¢¬P^˜1ë ªjNXe»Š^W{ÐSÑ­pñ*\B={PÕ¤JB%½_»JÚµU.ZµåkW5zµÀj‚…3E)4ÀšÉf©P óêÉdŠ òÂ×c´"fªUPãkR áò°Æůp1ÈíÕ¸TR5fÚr£ÍÔl²ª_Ë©0íU눊dXCe˜`jzÅ‹î÷•\ÒkøìUq1ˆ¼Rׯ©`U\6PøU\ŒÀš€ Ùê×µ­‰¬Ð·ýr«õðf´Üº8¹¡–eQ©òɵ|Ò5æëZigì -&µKdW`xZéÑ­ƒª«¤)£µƨÀÂ%T¸xµŸ&Mme½Ã!Ž†OoËê¯e‚.C®ÁÊ„²gJŒÌŽ{ß"ΞUàz‘ô†ÅÄÊ_w­ÖÙÁÚ«ÓU;WãÒ«RÉ¡)«ž‹±Ò·*k]̪pÛ ]%òžå‰kQ³k•1ª¾{õzfsÁ5+¦ÉÓ I?­oGk6Áp N¦÷´ÀÁZéí+¾Ø±,H5Õ ´Ê§]º5ïíÕ Ê_Ïõê5¯æ‹.Z®]Ì4fùpÃf¤XAЫ'Ó×B°o…§k¯ò®eP‘ÅoäiE7Sç\«–VyÝ­èªë]è4—ߪu÷Ih„Ú'»š»uÂT¶[£ª4~µN©RPeMßdPO¨BÛµ&“Ef{í{Û#Q4öד2¥3*´èx•©ãfV˲Ð'ÉÛ6HKß³7Œ®^ Û7í(nÇ\JÚË_Bµñó]³øëHyA]@èôÒ¯ª“R·§\÷»õ©ÇójœÕþ÷KžÆbBÞ+·ÁÇñ,c}:fí9œÊ-Ϭ·˱kŸÞn?-)·n9ÞÕK‹çl:NÕÎèÚ²vlÝw~RôºåPXoT{Φƒš‚­>¬­8 sÒr1â’^G«×ºô2èm¯È hÓÃñœÀé9Àé`‚ï`8ˆÞÀ(]Þ]¶)j·̳úXá*2±jwèkBêñ õ _ŸoõZéYçåŠàšäº®¨S¨«‚Fg }Ò õÞC§T |¨Øh™ddÆO®HœPŸ™0”H&$½ ÀqžAç41ÏNÏ·Í»"õ¾‡®(a¦z_ÒcÔ¶ $Rýl =| †0Å°ëu»N×ÅÀ|ø„àáÉØqÎ ýFDü›Û·ÌœERF*ÅèMÝëèš^ÖÕo̪×e,Ò±ú“_¿óñSh ëO6*'.Ûaï1ü¡;55XMF.Õ¶þƒ¬J"LþL]ˆ¬ˆÁàF«ESÍÝ2„[ ;FUTÍA}´úDEEY˜ó sÙ>ëXæ᜼È$g.­n’çeRÐøP€Š'.*nŠæge:§÷~<Â/aæE‰‡/r^´ç¹Óu€oöä“„G²Éwš²1jŠE\\Õ+o|‘ÚK`   !|ÛÉáÕc]NÅ°ó¤}õÄ| {ö KöY²í †@¡­ZkDGi˜EÉ;ŽðÇ| ‹"O‹duÓÖ` lýEÙšó„ E2˜)Þ‰¸Œ3•Ñ»v Åjšqºû›çè%&¬.ayF^;¿`3Î^DùÐFRÀ(Q|#&Ò„È̮؟fü ÐÝÞýzXU«dHW¹Ôᦿ ÷ev]% X“Åñ.ÇSÊ !{ÕÜ^PÈaベ0)…tU‹tï„~4¿…LzQ±ù$iB¹ÙnsÉéñâ°k.$U¸ ©[À˜iE*f%¦>î_¡›0Œ¨íK ~Y*8ckø ÅŒbHe!2@@ž@'Böb}ÿ0oŸ‡ÐÒkû•¤Khm¶7l&ÆŒ©¨(–œå&Û²ãK”¶Ý/¨-‚¬¬ˆé÷–Júç£Ë‹öÉ™'>¦ÐØÑê6—1Vl*´UAÌR]¹F~ç6+dr.²zªBÆM¹iˆeÕXÃÈ¥ò c.ý8£ŸIϱ~¢ŒsüB€m^ ™Ëp=ãvmSÇó²Z<‹LÛçR«CÈ2£±¼5¦ÒØòMÒ´ ïêúzài><,`Ñâû m‚;ù²G*z‘R3o×úôžq?nz}ÛÛÞy¿j[ÚFØÿã{üºÞ¶_—®üvίëÕ:|^¿µÓgcZï&¥A{ÐûŽÉòÒìéñãKd'Œ…³c¦”ÍzS{e"@“øƒÔXFmý4Ä,Öþ`Vò É(¤êu5ÿ®o+õ‰Á}¨êo~˜ÜWîm!¸·„àþ'Bpÿ‡B(¾Ý§(ˆ+ï걂ءï`½ üxÖ_åœ7`†óUhŸ¶M^Wkì7/7Ù_&ý£Ïae Ÿ–ð·ïAÆéwvÞ9öþôZHþ¹•ÂÜÀÜb.‡õW¯~17«©/EÆÃÌãØ\Zf1þ±å)Þ9C£ö`W¢l-.–ñÂÅÄáÆw”jY3%]>4·œ[¹¼Ÿ€º—®ÛÙáózˆ ³†y^G\·³g˜mÌü`srá± Ÿ{ÜÄÝĽ/ˆ»+ˆ{w£É[A¬Pï ’{l±AVÿððú]Bö)Ù„üPKŒ=Ehˆ'% dessp.cppX]OG|Ÿ_ѱbKÈôlFdD”PdÅÆ'@‰"ËB»p«{è>8#‹ÿîݯîž9Ç~p{®¦ªºº÷¸c.fí nÚyý¿w‹Õzþ·M×,§ë¦†«G˜ÌÚ9ü1]v?®†V÷o®•zÙv×óMÝÀ‹ûëÙ›Ù‹á䦫›8:û{rñq2¹|÷aòñìâœbëf5bOß~89Ÿ¼=:¹üíä÷w§¯Ž–÷ëÅdòZ©ý}øóèa»Xþ3].6]}·íC³‚)™Ÿíl{+mw Ûv=[lÖ°Øt×ëvÑ ÷·³¦ƒå¦[·w ÌÛ«¡±UÓp·™¯ûkËfZCÝ\mnáøýûáNóÐßøngQ`TëïÖíjz5oêÔâ­áøäür°øWtøêµúªž”º^t«õà¼þ©‚³é¶Gžß_-¾|²Ÿ?˜Ïð+|í¡øuÿ× îõ¥ÿãJJ0{àkìk0¡Dz:ÜSþØPFGŽÃ1ÑÔ‘IÌ™1u¢#3rm,”ŽMEÿD[–2/L]ij.¥‘%Ê£ Ž@æ…Ô(ÓsÌb(È# öyƒÂ¾’Fµ4Jî ©œ†ŽžÿÃ1¦rëä¶úžöÆ•¶ýÿ,VÃ+¶?¶)²Xz¸š­˜¿§S‰¬\M––ÀÁ¶å‚ψ¨`‰€¹6ÄòÅ“]fŒÌ„‘†@—w¥¹^•†¸C»bmk…ÐYÚ¶ïD › L˜6òåPÔ®‘ë!Û 9 –⎠âûÁ³¥]Ø©ÀæWÚKÚá•QeÀpÚó¶íÎßÒ«DáÊc:ÎK@Ï9ؽŠn÷P‘ƒØ(Ù¯ââÅcBg“H°¯¢rŒÔ(@IÛRmâSqw–G‡ôžž‰ÑŠj³ôщ¡€ŒŸw! Ìì‘òa²¶mLC$šï"² Ú¸™^Zéñ%íñýÍB9€ù¶.…ñ™Ò±$})ß—œ~©ì)b D‰R‘ÄL ‚ˆPæ ¢m¿VØ`â2m‚àÑiÂŒ2¯ïJ#T•Ý•;ï·*·RNÊ[PÞUŽÿÿM¦Oߥµ{e8&¥Ã›Ê¹¥ù:°!Q‡{j<Žtä^EïÙÀlÈqEE¬QžGVÒ9sVFGŠi“{d—LE>ã  ö‹€ôÊÓçžqç$HtJ&JlXJ¡#³}F›ÜS<$¤Ñ1°&idÏžm#ICåÆÀ.:’~¸çWºòí ¥¡€qåpjdrϸÀ3›ÎD±dž"ˆ#.÷4³A Ö¶öž#1´×5éŠåÅíË4rmBåD™^ŒNe‰>dã.ÛO‹—÷Í‚‰öu%¶G¦¨b÷‘¥‘w•Ý‹ïÒU¹ç¨K÷ñ<ÿî9>&QÅÒT bùOO×mEžÄ*KGþ ƒcN6PŠûγ!̼WB™µ´$ zÏCäö‘¦‘‹ô11.ˆYôTÞ7£c" úþ× Ò¾yŠ–ZL# ¦JD™†œ  _ií/âA:2OÞŸ˜œŽé=t¥æ_[L:Îè@û@t¨ÃqÁ‘Q’ŽjpðŒœ™92ÉQ"ëJŽ(Þƒg´iƒ4 y,ÛFÍ~ÔJ£XQYßl<}}“œ«Êúfö¹dCÑ;ÖãåÈ’Nwi³ŸÔÓ/ô÷ò'§ÇJ½lºº½QßPKŽ=¹ÍYšÂñdh.cppMŽM‹Â0E×æW<œM 3~m]i[´ c¨qUb^Jd^ƒMdð¿[Ñ…»ËápïN›‰ñ~àïB!XÍÞicˆ!4|vdÛ_=ó Ž– Õ$ıq=Z{ÓLšñ“ÔŒ¶†¤8©r¯T•ïÔ¾(Ÿ.¾T¹ÚeµJ²jmr%—›­R±×–ÒmUÚ.äÜÍt –»(ÿb”n‡ßóå;,"Ù;WÈMÃ|/Åý³=“é°n©PKŽ=`ôË>@ dh.h­WmoªHþ,¿bj“»­ni?¡5Á—Úf½J”»ÉM6!#tRÌ0Öu{ï¿D›în?e8çyž3çÌápÉ<î‚Gú³o¦55M{ðl?+—¸Ä8V•Öõ5ùËc>(×-E¹dÜñ7.úÒ[;b·–ÍU]Q&Æ—áÜ4úC»7½LÔ~ü$4Íú·.È"!XûTé8>"2šM¿š¶iÌÐÑÎæ7d¿ÞŸ>}k:³§¦õ2GÒG%Ö7sS”Üt}Ýø²zÔ‘¡˜®% yWÙ£aƒ0 Œ¬7 Ÿ9d0¶ç µÀ°3– .÷F=AGîÖÀig¨†~bÜUÞ•Zloá'À‘Ø°­({ú»èBF"ܬM*O‚ˆÚGÓ#Í©IÆB¿íéyц¿ “«óÞ9XßóÑ·4³Ìƒ¥;Ý)g¶Œ‘XbȵÌMm÷' NÈ#YŒ‡\­ãÿQC©ÕtØËÓÇêái«·ñ<àZ‚òÈ E@ã*!W ½—pš½álNè‚Š&í¬XÀ–ÖÍ3Ì(wÃ`²  FÀAP,Frõv‡…bix§Uнp&õÙ? Æh‡œµs¤é9±îÿ }vww÷ƒ×ýeÿþ¿´ìîïþP¼*2v—)<ÍÝêîóÓ•c¬H\5÷çç꬚Š¬}T×g$ªâ¤“ÈÂ"v‰½ñ»¹¼ÜâÐËH†ã@•Á~£ÔÞBæ’CÉ‚™tgl˜U-ø2ÝŒÅwýz-Ø:¢ËMº’bÂPjø&©Åí_×Ë< `äè·ÎóˆúôbÎí»‡ßmÍnF¹CN>¸j#I^µ98=TÐóCç5©©rÅ¢Û®™­Œ/å =Û±Ûþi¦,³*JÓö‚ 4©ÚŒ%]8%ù`øZ.þ³|4~‘¹RB㸒QÞäí´_&ÚaèîpÉY«9˜Š,i% ­C«Šõjœì‹TÉ÷ïä"EÄÿ9rñx`\qE¸%sð= "ùD™¿Ù&¥/ó –>‰ßHg%ÊÄ–E”)‹$pgG$úÁ­'¡áQ‹I$ñmêHººIÁøò8Bæ ™'Ï ÖWR®õVk»Ý6·À\ÊšN´"‡òÛ€ ŠÖ+m®dà_žëÝó<·ÏàûåíîGOêºA¶¸}ävä _5n2á)åñô£:Ñ¥ÿ®NøõÜežòPK=œØ‰';€dh2.cpp}’_KÃ0ÅŸ—OqQíœîq>͵èpÖBýó8Òä²²4d·“"~w³±¸Î·äžäwνÉt ²˜M„µp N¡n$XÍJP¨@°U®•Yä5¼£‚ˆ+Æ.•º’V“â¢S8‚}%‹§8KËxs߯’`éjKeš†ŒJ%!z˜m^pO+³'nHqR¥Ù!ûd¯ù€Á(ÈÔÎj|Äz±uˆ;45aFaòº^‡·ì‹±¼,õ‘6Ÿ7‡‚¼&„?®å׎Ù` <› •¼)‘¡pH=†®ˆ¶ð>ŽëŽÞ{ÿÙOȥ̈́ÎCþò &ík%9aÖC [Òq Þ¿räͤí¬ÛœtÑë_+Ÿg89;å_ý˜¶Û5š-A8†¾ùœkÈUØ>Òïoˆ“ˆ}PKŽ=;3 ¥][dh2.h­VaoÚ0ýŒ…¢,%j>B[‰*Ó6•mÒ¤IÈ$bÍq"Ç)BUÿûŽ@ $h×/Il¿{÷r~ñ¥Á=é‚GO¿í¶=Ž­Ù˜4pŽK(N³Ý¦<.€´MB\:"qÖµŠ´àóŽ_'dÒÿ>šÚýÁhöyôðeÒ¬CÛ¾ÂxÓ¤·Œú ¼»º¯uÔ5ÍårÙYwï8a`Æ“×W*Tæ_Öñu ˜½~ÿSrƒK‡ÜÃûõ„˜¼5Ù=q‹cŠ(Ú¥Q2Ü¡ýDû 5w˜÷+¬ú àÌ0 —ä…l€]Rø֔‘€2Ž6Ýô~Ejµ.uoZÛ¡A]+{¦/¯çHbÍPÊfdÐjD>ŽÃìùøMî"r-‚Ô¶¥fŠ AÅ´IûŽq\\ha€(‰ô*Lo͙Ș/$žKMSÅî/&ør¡}$rBkTš'<û„²-”“LÓ·µÆÍÃ2ÊTF!ßQºt»Ï±Ak²ç»ô$V[CQ[ë‰IôÁ$ æ ¶ PѦ’ ƒÎWh;Ús91YF™#K£røªô™Ì“ÙÓ\% ;UG…¨]Š‚&ƒî#+äá’͸zSi.”•QŸU0À(ûV.±”u‰¥öŒç]e]àª# ßm,ë]Æ*¿ÑG{ËúOoí~¸½¬7Ûk†bs¶6¼l®È™/O\81‹å7èQ†GlhjWº –‰R©ÏL`ƒÍ¾ÏCÐV lËÑ#$R¡›&vÆ]ñÆÀ‹Õ#¯½|ÃM†ø[ÒåùPK=0~–ƒodll.cpp¥Wis›Hý ¿¢ãT¹Pâغ¬òZ>K8VEkäÄÞ£(#‰ZÔ0Dñ&ùïÛ3’!rë õLw¿~ófŽŽÀñ¼C; á,©ËñÁò=Ë&¸>°90žx® N°°Ð2y„OÄ…®åÊòk‡L]Ÿ@çöAtݨÃ;µß0{Cc¬Ç=u¬™cm ÷q`”×wµkõ®?6‡#³Ûïc@×·½Ø!°ÇÍ÷ä×!µf –õ]¦`+öØ)4[­j…;L! ê(yTí^ÝŽ ìï—'?õ†º©~T{}õª¯UV9Ï–®ïËèp~!¿&¾ãNE|C¬÷"¶,ÕfèjG3¯´÷½¡Ò¡! tA1²@9»;ð#†œ1ú‡Žav݉X—ص˜øgÆZ»8=urË_ÿÀ9|­~iTª_굃tTý?ZüqÌ'®øHãÔñQS³Ùªðhr[ó{»Œ'ö#wæ‹fÏãòˆ?csD¹ÿ‘`ªlYD¥ýË,ÔëÍgxprœœÎH‹ÛNøßæ ·q¾ZÇ9-ÍŒ›dTàÆ~97 Ú­Ù)÷~Ž[›ùiÔvå§Væ§^Ýv{~ Ž€ŸÆÉ3úiîÌO½ÌOc~´[óS,îü×ê›ù9Þ™ŸF™Ÿæü$h·æ§XÜf~´¡Öo¬hÞs¸#z¹&Àêíí\’³œylë%žy5·ôJö=ójmé•°‘y·×›•6ìÊëÝíIsK§,ß½á{3÷Zon¼ã¾R²¶jŒŽùQ»½6ÿgPkT«•ŠGص!bÎéiD˜é“¥9Ç7 ÐvŽ"b¸g6èC²„È ùÏ9 ïúýv>Õ%Á:q6e ²Ÿ,÷ p_…‹ÅdB3ù«,%sa[––s×# ¼RB °°º”Å–÷GLè£À>®<È Ž+¿„»…Õ^œƒbÏ- o*8uxeEDuJ¢Þò‡·d†è A™$IJ¬…?¿­kžð·«œ^q¹|û?°žŸg\ˆ¼¨iæúqiERJ›R©¿º XDqQÿë4°Ój”4Ýì^4ÓÿæK9-FC;ß©8¡$’>X‰WÄH•Å‡ßE F±ã%Û–P”' ?¨ÁØPC~ ÷ñ§ZrûSJˆ°”kE]Î}¹zAÀÑ0ú3¿1ð»ÕḔØÌ{„äYXþÌÃÎá[ A0 +¾WœZ¼þa¼•x£dœleo}¶)sB­k ü©[îµrâ”!üFýÝÄeðO?Š3’×hTøݶy³./ë¿?¨ºzßûýÏdwÖéVôŸmöåeýï1@æϦÙñ^^)oúu«¹#jM½7?ì†[û5àB/£˜…1¾Lâ™Á(ÿ4ÜKþö-~,Fà ¬ î$ ˜0þåZPË4½²!Lïìÿ}‚Íi°„ª¸òÓ¾’)KÄ(5!¢5úÓÖ°ÖX¯¤ ­æéR¨J #érV”°²$¾Þ•p¦9ËÅ<“šÇy’½„-‘ts.©MoÿPK=DŒKhYdll.h…T]o›0}.¿â®‘"X£µÝöÔV“Ò„¦‘‚’tÚžƒ/Á+ØÌ&M³_?Sµoö¹Çç~øØ=qŠŒ¿ýÕÜ÷ƒñÃCpoõ4Æ8š°Õc|ªbÔn‚Ó™?_¬–ôûoDÝ_ïEÇîÝðñaxó"‡SdhÕ3š{wÓIQJ)$¬lB#h><£TLpúˆÜg¹8;è S±!ݪÖŒ‡É–"ÕëHHÂ÷ ´†lNAŒ„ê}qL}ÑÙ8eQw‡Vë¸.·R†S¢Å§G@¸SX˜@—Î11Ĩ©Ncc¯HÀð+7‘°lÖD³6PMÀ€2uùý¢ nÌ^b|1€Ns©è4’þÝâÛ_ë»rßF…’|Ó†²§Pe„ R²HÂi&Db æÈ䮽W±APO,ûC§6šKšˆ”êÿÖ†©…Ë­ósIaãÑbUÚ8•KYÎHÂþ½µ±§ÚÖ$‡꣼|)It^íe ‘Dº•Œo`œ$3¸ݼ%oìÞ>N¬^&É&%Š4EžÛ [ôøÕs(óSMÖžÃwI´dUÿ›ôÊfY¦ùæɉnùÑFyÃq÷£ êÞA¯ýh‚Ò²¼áÌ]úÑܺ“©gWsñ}çð'ÙõÇÌ–£à§»(¿›f7pùíâÂq¬­*f¤rzuu”àºé(ßgXTù,…ÏðúQ ý©Þûî[é+ rçºÍîpǘ`ŽŽ]i}HŸ`®Õ‡œÖçŠdÐÔBÐ?’8*¾«´,•î«°cq?,bùVM Sûúøj\o\_¸õPKÇ==-Nµ3 dlltest.cppµXÿoÛÆÿ9ú+ØXäGµÇi’f€b+]0×1¢¤Û°u‚,Q¶VY2¤SoëÿþÈÓ˶’øám€q–îxä‡<’Gñ­ï….zпýe|w3[ƒáк QÞÒ´beŸÒï‡wÖ膉”·º¾§(oýÐ Raß m¶¯(÷æõè£5Ò?æXïj?^.D47¶Vá6å!ò]¸º›ínË2íù"@}±|Ç~ª å/eÏ÷@}Ã4u¬~Dd¾:h„ö$@Wm4”="Üs0ŽáÃØgj êÃ8%5<Ú ˆ4Ñ…ÈóÀrÑ„?Gí·pÿœ˜Ø“(jƒ¿)ÊÞ»wàÌÐù L$Âi’áúˆb=b|¿0iýŽ–M¹ª6àÍŒo~2n­û±eÃ+ëÎ0בּnšÆ`¯žŠhN*;°`n‡é¢"ϳ ¢[oωR!´4x‘ÇÂN’‚‡T*ñçi` »ŽœpE±²gæD*^ 4F BÄËLâIÏ~8Aš0cG>ØÁ4Š}1›ƒí ŒŸ•~@ŒIðC°CÀ'ì $@7̳3#”LilLX©Ì,JÂHÀa†1V{O`"hnJFèØcEÄ+èêío gê†aà;,¸8Ÿ¶};ΈÙÓA V‚gÂ\?zb¨QÏ1Iì)‚Aô˜œDUBíqf<ùºAÅ‹´c3Ü2;û3›Â%Û»Q”½A4‚ /6øcàk¥ïäÿ žÝ¿åû˜9‘TÙEù̬B¢,É_qù븀¿ZO­v³õÔ9¢¡{LC÷§4Ø—ôšðO~;_ä?xÚZ?êÒpÜ£áä= §­—w/Û>‰Œ [`=‚ŸHwàÜGÞSœ°OA(flUAVggl‘Í +2VE2à‹ì1ê“£âõ¤Û”¤=ÆÔ;®Lç¤=·²‘öJ®’+Û§çC§ÅÚH=A¡-ét¿³ù¢›M*{ý«KKÞŸ"? Ó2ÆÑ÷k¹ËG« °hñ|fE3QüˆËŸÈ8ןUr&ìŸyüÜhÒ 5^Ø<Ž#‡ÂÖ1YT]éÑ\M:ÝÆ‹ðXÂwñ9øϬìÿ¹ÍëðKƒ7¡ªIŸÂçÎ|¡Vt«ì!:N ­Íð'‰‡,ñ$Âê¨Þ­@픎4ØS’:¢»–fv2[‹›<ÓfQs`4á`ƒs°`EJøSÊ7E¨êìó§<<°¯w9xZüô^º¹NÃ¥^t86NÚE\s8ô90z}fÅÀç2êe`¸™ÜN‹ƒ‚níô6]‰6½Ð¨Ý/\Êïj®MŽù•ÚšmÞ<»l¶¹¡^«þôHæa[šp§SêjPÙQwNŒòV¢¢æ0‘‹ðó©Ö>ÛÑGˆ&*r[*âHWTŒz\ÍÞ˜‘Xúgýz¨_ e #S²øù´}B‹¨øâpzN•l (f”éGe,l¾^³Y/ é6\7ä#½‘ Ê›sN£TKºQx H¡‡uÔ$jÅ[ºk¢ù(O0þˆ!ƶ ŒûaPGi±çeaÍ€¦ÂÀÔùJ¢[ØÔÏÎƱÿ@³Íà&öêã·ú®åb0Í¡O³&E½JR›ÐnɈ͙¦ª¹ žÅKβxÕô$ñ§áUÍÕ5QE!ðfÀg;ð¥ëIyG øûox³Æp“b+'dš¦Ø5kP³³ÎË(aS–]Y˜>JÎΙçò5wPܬNnZ¾Ôj`Ü’LÍ2¦é‡_Õn í=yì'÷ƒ•áKRJpkÚlù Öƒ¯™Ö.ÛV1¿â+ ¶| ·t^WšìUiÛ6+\®|½çÕÈÝÕ3$ïrï⃽•®o®sC+Y>`ì{Ë<­ó,ÕÑ1þÚ•™]ZפIúJIäßvr©Kh²eÍ,8 1œŠäÐmÉ `Eñ)»2¬®‰æ €4·ÿ™úà!P«®_&‚bU“ôËBB-ó²Y‰«=‡rye©¼M°Óœdò—Í“QòoZNûÙÁð÷¢>°Ó¬e¶Ìªõ~¿€vn†× 5`¤. ºabW ¾l™÷›–Ù¶J’xtK-sæ$¨†}Õ\ù·ua+Ž‚@º`¥a`ô/ÿ׶°Ï,åEnVÞ7vkÅ"øÜ{šc(2µ]?Û’›3ÍzÛ ½Ô¸Î¨õxš2㚶Àé«m4ỨFîÿÛ(1üVºeY *=¸¬† -¤b‡Ê¢e¦ó7¥(¹Ê6áõ§ñÍí©(ÜRððkÁ0ºÏË¥2S^ÍŸ …¾0a¿¿–EY3HÈ4ªd#2rdÓв^:tb¯‡nƆ«“¢é¨Jù,½YÊË¥ÑD¶ñJ·}Ö^eß±Îçò½„š?I+H8ÿ)E‹¼º i³ÊQm Ü’iŒÜÌ"W+&[,ÜLžš‹X¸2éê"Û»jÇzõý\…¾ÃJæsú*Ë«/ô]ÏK¤­ªˆÿPKŽ=?»!.Ñ dlltest.dspíWmoâFþ)ÿaâë‡ätÅNÑ•J`„°…I¯9U²Öë¶1^Ë/yé¯ïø˜HHûá>T1;;ó̳³»Í˜ÉX.Ðñ}bv’zB‚É¿'0>ÂÏ0ekì*žï'' 9,ÆoÙÁ¼0êþúù·Ó“‡ð†Hq,Aú©ð½÷ d´f üŽQ,dWf3Ãùøt¦æ }4§áéIæž÷fÃùe€òMíœ?|¹ºM±$’½0ôg )Ð|h^6ÛYš6vKÞD»HÔÑM—§'gö{Cæ+}™ƒ;æ ÖìD²s nÎ9ɲ1i,‚%L'½¯Æ§T#Å!¡Œ˜”(ÀåzͲo”µŒš™£º€ªÓ b¡4vßÈ8 ‘‹Å#ç2Xˆeå=€ûY©`ó–ì>‚GÄò¹ŒîšÑÎõ (3sT|}P hŸØ:ô±s õ qsl¶Û¯ìƱd 7kØJ Ž1,¨ôöÂX´Ä‹J3ô‘ŨÀ¹K?^¶¸WÏÎÅ!À‚ú{áŠcÜÇ¥ª –9¬™iAÏ÷å½…‘–¯UÇ.¨ÍM͹“%f×eË?–œùKVù„fY]î7ðOOf¶Öxa›Ñ@ù霶æBnw× ºy~Ï6à:Fg2Ðj|6î¼/ÎX¸‹¶)ç!fš„iâè"ÚTs'¯æ[-r3³í¦_ ‚4ïöE~1·è·[ Ÿ6Ä>*Í¥'Jë^q(¥ŸHF=YÎ0UX¼B¿Â!Íx²XšTð©ð ¯çò*€L–ƒŠÌæüÄ©?Æ ®;¼ÔC•/+ztFí/WUWˆN i‹³[º ªL“Ž’¥òj©ÕS‡¶Žñ I ·Br9;3ƶñªV¨wËßåÛ寪uœøíÊú7Òwù&é{Võhšÿ•ì­KQ‘ yÏõÈy³ü ¿–@¯V®®ƒâø’¯Hà“Ý2è¼"ƒÎÿ2øÃËàN) =7y ±c˜¡‡e1¿xÏD±^è™D> Þ™1ÕIëoªÅÍ,<Å‹çþÆ}OBP`Ú28æÿ3`Û¼žiF·ñg؇alÐ?­ÐÂU1*F›7éPKÎ=ÓŒá4¥#dlltest.vcprojíZ[oÚH~¦RÿCdõ¡U®QƒØ*È"9á\¶R$4ؘ=cÇ(ÙËß3žq IIÜn7jV~Ažãssù<6Ï·a°·SκV£Z·ö€yܧlÙµ–óf«Ñ´>ÿòöMç’Æ \™ø”Oÿ<ùöMÅ\ßEе4Ëžýñ£…·.3¥íj½®g$D&?$ÄÒÊ…O.Fý®õçñáA»eÚûÍÃöÁþÁ'{°ß¶{mü©Û~ópÐl5ÿVb®ç9Ü#Á„ÈUת*:XéL"\„±ZåKµ0¶¯(k5¥¶“çöÓAÎÑ©m)íœs izUÛ^Úœ-è2DbØƉ-Ú†•)@bø+÷¨2Nd”È>¸%\Üu­wï3ãJæÃußqfšéúÝû-Åé}­eÄ$ˆ|J$<¡ ×zó³å.}[tæFfi‚JðQSBÞ¹++[—öˆÅ’zðáÒ6¦ú° I ãë‹h)ˆCÁÃKû°Q]ǪˆµÚ‹Ƌӡݵêšp|îœRFCúÄö4aç4‡Îw1Y¢C Ä`Ü]A<Üd×2;{µâ h5GR©Jù%Í•Înze’¤<‡^B°&ÕmÍ_Û)`'±äa*S„ý·S§O$9¸Ã\‘9õœ¯¢rb¶CsT¯M‹Íf³´¼f¦Øj†^•ÁÜÿ ˜¡JXË>žcó0Bö O+_ÝR,€2&ÌSôÁmD˜&)•#ó°^Å;^Ɖ$EbÒY’5.¦~,ÜÀÏÅÇ!•CL(L8U5¿-‡‰Ãšò Ž¹ÀºÃú1º¯Fg­æÑYл89šÙã3wì Žìé—Éùx2™¥=væ|1j\åÜr‚±¦ópÃ¢Ì ñ¾XMTY0¬!p(»y(®ÙlE˜¾ê‘¤iÝf{ˆ½€xzË}¬ÜÔ õ¦6ºV+s9‰"q»’™D=˜Ú°mcc¢v¶ªêÍœ¾K8p^u ÔE€Útþ)ñVØMH>,ü%ƒ”³‚HÙ#hÁ€¢½ï&Îë!V6~‚3íÃ9 éÏÁSX€ÀÉ>?Xß7Ö—©) üÑ5è/ÛÙ@ô¢h !ûc´ÞýaÙÈmFúôÈÜñ pwS†lGk<üÏï5^‰ßÞ)ü[¿ëEý~Y~DP?,/’¦ëfËÿ•qð9>yir¾èÔ¾ò‡¤ÿPK‹=äp“àó dmac.hµVÛnâH}Æ_QC´+“HòI$0ž JBPìŒ4;¡Æ. …i[Ýíìf¢üûVû†!ÉLöaŸ0]—®sêTÙ|!B\€sÿmêßM§³ÑíÀ™}±è |unpDiˆÐ æÁ†UÓ²&ƒ[×›w6t¯ÆÛ‘O‰Ž§Ó–eu»Ÿ`fiÜ$ÓçAÄ”ÿÒʪü“»ÙW0¼q!»iÈB’tñ<¶Ák|ºA±Ô«:÷/Û¥é•bK¤z…Bó€i 'Ñz¶r—žÕPšŽP:ìõ”–\,ÁËŽÑ2–\¯6ºÁnÁ³DJQ÷´›¦ »Ù‚#ð{½·ãŽ Ùjö_,«Qrî&ž?˜øöh|åz¾7þ˽ øáÍsmþ7 ª¹ÚD?Æ<„¬0Xcè¡&Ôv ¥aþDô®ñ© ©P|)0.4D)mȽL=_Y”â”q©àÏ„I¶Q­~™: © ;¹HRÝÅâ¬ÌVùû2D)†Ÿ¹`‘GP×+óc¼wJñ%*푉påw•ÄnÉ0l%’?RvêPžù J:ðÒ9W¯‘·ÒsU(u7?ÜÌT:¯,T“‡ÁB‡Q¬+«"ƒ3tfÄ<ɈŽ Í)駑gzìŠÀ˜„DöÅÙ>¼Í,ˆS¡Qö­—~®pÓH«{ø L3C À&]t ‹XÂ=²èØç”}Ä4/Ne€ªIÈÀ•ø¦¨%k«ÁDΊÉܳ`/ðA­â4 aŽÀ Ÿ›‰:ºi!ã dž¬PŽâ ÝÐ dcб»ïž©y;bïÎQÖùóJ©†´ËúleÓ‘É7|¯gy[.ê‰z½‘ûyðpãÏ®Ýo7îäÊÿÒ²g½âêø²P–£ìöKÆø2µîæþƈp7veÛ¥p…šbxXm*{gÞûÛXÕ‘hh±ÏŠ"n¹°ízE­zp{OÝ­<›Ñn§€·?;uÞöÃi{V{Á(¼ÌQÕw´­4«³Õ=ûuŽb"ˆŽ“·pž×ˇ÷Á%•w#ã )ܶK¬^Ø.»¶½µ•ðìµìÃElSš’ý•Œÿ/Æâш¥ŠËÖe±N‹}˜°ð{½žý­Ál6eþîÈ츂•áÇBm“» ªj*è«»Õ¬{Ð*P•z¦2¦u¦²5dÌ‚]M4º] - Îö¡ÀhæçŠsw9þï¯Ã÷;›=Èöe>&õ÷IÉY¥á6œlµ_΃qÌ3ì¡/ývÆýûëqÊ¿&ª¶Á1œþ ¦N—÷É4W¯×Ú[î¥þYæNFôé†"ä ë_PKÕj =$ÕÞÍKà Doxyfile¼\{“ÚØ•ÿ¿?ÅÝöV¹)Óxf²™M¼ëªÐ4m3Û hO¼qB]àJ ‰Ñ£1“ä»ïùs¯t%ÔãöîÔº26éÜó~+/Ôuüù¸B£¾íü{çÛ³³j¶ RÅ—V&]&Á¤*Û•š, ¢ }‰Õ¨<5+µ8òO«x™ïL”é,ˆ#•ÓÌìÒŠ`oL¤.‡CÇ~éÄɦ¥Öq¢´Ú'ñßÌ2;{A÷vÃPeæs¦ô:3øq«Ó­ºxÑR„Í2ŽÒ`e:QÓ—ÎR:Z©C@2Á&ŠéWÆÞúNgôຠfÝwê­zÔanÔŸùŸ¶êt:¡n—0H³T„6¦#¥Ã”‰Ôû½‰VtlžéUp¯ž€÷ßÀ2BÏt@,Ùë%]K·q®xÒ|ʆ8ôSgôûŹ:o‘ .½?„ÐXجêŒ%¤ÖÁ&ODZñÿ¤¿î¡N2½!ÚÍ2XV‹L´ŒWÄKÑÖár«½$Á“"¾Od=$`ÌÌu†ñ¡Ã"^™µÎCÈXÝÏn.§Û`¹ÅWÝ“'´laè‚áûÖA’f*^.ó$¡gŒŠ×t]ï°}@‡ HJj²±GuAÐèY‚&ßyd"2 ºg) àY¢£Tð訩ÁÛ,Û¿yý6±‰rØÃë4^g˜×Åîy(&ÚÇi,Â’ª´svv=úÓÇ›ÁmÞöF׃á;Qη’3k ãÉè‡~o6vïú,0IAŸ Ü!NVL ]1?åŽ~\&u%ŽÄ9ôŸ@‘©‹–¶DV—É,£,X‹°M¨U-ÿ¼U½ä¸ÏâW¯N°»¿»êO? s0ÄP‚oÏÀ‹ÁšØUÀet:óѬÚä把›2±™0^2D"§:~Ф™Nèìà‡fMFêèA¬•m'S« !Åɱ8Á²ì„%Nˆ3Apz“~wÖŸOï¯èΩãE ø±?mã®¨Ä ‡,C,!ÿöÍï¿']\:,às.ÈŸ|Gè>š4Ê,†çqËC˜´Þhr!ò³Q¤3+2EŠ†$žš,à£R? d’šw>ÄÑô" $bÄßzJ¾ÎC0;RkcØ_9ê(æŠA;²A8•Æy²4rbÛŠˆ°E\f?ZGÊ:ÓTïŒ/˜ A‹é·äÆKCÛLÂDà µ‘»¡pè<gb $Ïš JûŽjVpÛ¾»ï¾ëÿ’mrM´¾âÈÅUWµ¼$Ž|‘cA<$A–QfQøjÃaØ‘È@èdG"žLƒ¿¢–cD>q£@¬cira§D8%ñnÈKoÛÂNRÀý>†7‘»M r‡î: 4„¶ê&š<}[]%úç tÔV=é?lƒˆÔ¨øp9Kô*ö:l˜^-|çÏfI_눸Î3|ík)ìdq[ÝhreôOÉ7ˆpôï;1ػʇ¶zŸG0СÁ~Ð{-ˆ¸O—HæÜb39K=AÚ™4µ­¶ú/Š­€ ÿÒSmuK7ç„'.ãä`6üñiP,—Çð»‚Õ8–Ž‰“ù&g$&ñÎ>?ÉS¾‘j²ð?\öŽ q“ø: ãGýPøD§K{˦éì îJάüC`²ˆ,%5¥Ã*´·PpGpé´®&ƒþÍü®`0¿îO{§~K]d¥ö´*ŠÊú¹ ó•Q òkâ#bšM¾%9³I1`ȯ6½$½â ”-ˆ8M²v r–¡NÓš ]¤Á.u´~Ðú:^¶ ÛSÁt8ÂßÄTÖCœ8%Ïr‚èò¸0éÉ%Ìùî¯bÙšA–mñ&xÔÃ3kÇrFëgc°žæf誡î¢L=¸dŽö^½g£Ã‚o‹0^>¨‹ c:À•¿_¿þØëׯ=íkËM‰‰;¿p%´Z˜»T¼$®™ƒßþ‡'kƵŠ#ŸíÒZª)õ¯+Æ,O("““Aʳv=Cn.[tHóÈïhdO°ú$Oå|lNv0ýb̪Nb¢*Ì.FÚVÁ6cM"‡hUùœ{JªÄŒ‹—˲âäŒÑC­¡NuÞ¾?îNPLØZyÜ}×f“–*™U¾„ÅiàÍ3(8÷\Á&[kÛ–kÿèz{Y"Âk¡¯ÙñcîVÅaÊßHJÅ€fÝ«ùtðßýÆ4Äú™?àp;á жÍô¢ãUE<:bí’y!=o«GÜ™¢›Y>½Œ)|¯½q²)Шþy«~Wé Ô´IöPD[/u“I½d¦SçnšKŽêFò ²¶^NvêÜ}ËôœwìÕ|ÖP*¥WÜ-8ÇÈ֬ה;¾ýD2RSú®ú|!}ó‰ªTÖ ê›--‹‘7æYádá?•PxNõ‡ò{«c›Ð9çl{ ,—zÒ¨7‰Þo¥‚ßÚÇyK¦í#áöµOÑË‚Q"M§}Úñ‰“D:)ƒ¢Ã¥\ʺÓjvQäRS«L£ñlpG’žÛÞãÍh2ïz¤¤˜„ñXƒk:¾WL¤¨®uÃÙ"‹ Ìöº]ÛhÇm4rŒ˜¡³UöœLîŽ/M[FcÖÊ$§*Z¬t® [Ä; ƒ¤AYBgÍÝö¢8¶7Ç;´îWme²%š®(¬ò)F!»x.Ÿýš¬"XÙ©q«p>%­¶M#Eýô€fyݾK=`µ¤jß>ÆñCȨ́8Ĥÿ‡ÀAúo6éŸË!"Së_™IªO‚Û—…üáýõísIÀ½%þ_ƒz kjà:ãR¢ìÀ§&„×°Uh’–ÕáŠÛ&ð/±øó93QZô’\ë„£3?JXÿ(EëàÖ IsȧÕS$aÜh²ø‘h+ –.ɉí4·"Ú ˜ƒ9fÈ=C·‡RSWrׂ#*‹6¸ó­›w¹Á$÷žq —iB2lq7#…OýÖ‡”zs´rÚ÷F ®oÛlpò·¤pmÕ›nu²§y>öêU[]·Õøý¸­F h±ä²GWŽÙXel³|ñž©š°K‰½5&I3;Tc[i7-${áÂËKéô–ÚY—÷ÃMûwÙçéNàÔïo o{`¸í—D-©Ä ô®`%„¹ñÎKdÊÜ„·B¨`Ÿõ'é7ç-5Mš×܇IÙûšõ‡ÓÁh8¿ëŽÇåV‰Mq”m:»-º’ÿ§ÙêÍéWµåË#÷ÄwµXËV1ŸzБíø¹ŽÅ…f-gU!R[¶óv[8!tY#2U›] i€ÀЛÒw¯Aš¬"7ÒŠ!RJ¦ITÈ.w_+­—ótw’M.œÛèªo:dyáñ õê±Ã ¡“_ÔßÿÙ²U‹Žk/éßpbÏ È3¼8 õ"NÜRÆ*@β³±7ˆãð±* ö½n%Ýdl6‘«Ã(ï~@•ÊpŅ÷ã19ßZŸÃI÷.X&1Ö’(Ý!ÛxÝ»¨Ò¾Kæ—¬·{ EAIðLÄsDX4¼‡µhlP™D}TC˜ÆÅ-Ïôüi°¯†­út‚Ý  ï¤V—Æ׋ÐOIIÓ”¤-ë–­¼‘/¨NçžW~¼—•#¾àx™#ŠËºžÍìäÁyåŠfó# Õ<Ü’/!{X166FúëøŒh¦3»©b³ÑU°’t›´ÜpoÊ_(##—¸JËÌ=e®G®ˆ³úÎJS¥êòlVáÂSz¯ÊdîÈâ¼ÅÑ;ÎfÔõk" ŸÛ¨Äº;>*D!œßÆâÌ¡Û®«òª—%Ùqo:RÊPú—D¢j ÏT´Ë§â¤èxÐÇ/iÿp„‚úúv>žŒÆýÉì£'Z¿ ¶eì&‰s;<º±_í&§×4e¯î©p}7ÝQ±K@þr ž˜ÜF€†a–m’ù-Ð#ÿŽúæX®5ʪ‹7.+îí¨«£Shš—ôsõ.wè•-Œß¤pÖ›=k¢³ÉAÜ_ñÏRžƒ¨µRb[cú38Á#-§¼"Qk? pÃÖÙþËÐѲÝ*¶8R(]¾(ng-9>”»gctSÄ ;mI#*ÈÄ}Ê6¹‰Gt±hÞ$í†d»rÂc[TÐvxš„Ý%!—7Kã§(ö ¸ÈãcSÿçG(Óìã¸Ý¿™c‹bJ!drß›É^!¼<Õpš©%¾‹¤e¦ÙÆ”9ÒÉ(ßI¾çÉ ›îlž¬Û#ˆS`‘;P ¨}Rpå3»‘€n¤ºÖ”-Ê®:Ľ+!ÀyÐqÅÆA9þà ]:EèikÖvÝûÃ2ý"Ô—X—p¥:¯»íöXí°¼÷i‰z ivÅÄÊ‹Ÿá:t 9GÆ®:²Íq´©š´£ÚP›~¼»ÝÎ{ÝÞû¾´´V”£$;´H„%ÁÏ…œ¹¯¡Ó¬—[#Û|1çfö[¥ÇÝ"9Î=³CHVòâ¦Ìöbµótk—›:N¥Åû>^yÈð-ƒ(Š³Ò·[ðœì²¡ ñ9Åtk³ Hw™› P‚øŸß~óÍ7’¿Jþݪô¸¥“ĵö.IÝŽjÇä£8ßl¥2¡,uc’(™[Ûƒ…>jÃëœ~åÂ~j‘§G•¤èóÇÃôAeiÑNÍ‚OI´Ôˆ¥›(X“N’Gª¬‹’ƒìØ)»Åvm5§¡öÛc uv¢ÜŸÊbò(DÈÈl‡ÕãfÉÞA”7@Îx†S]GF!w¿f*»tÈr:Œ±ë˜mwä„S‡ Äud˜—t¼©„O"‡õ¹ìÆÙ]БcïQ*bO¤RRŠóK2§X»<ÔØýî¯ß~ÿêÄ Z„PVŠj@Y0ý¦Óù}»¢/¸ØæÉJBIä>–Ö$é#@2üî¯ß~O6øýoû›ï«ÈÝŸ¢u÷ßüêïž\å¥Iÿ¿ožXý£:vÒíÍæÝÛÛ†qK%5ò~ÞÜ ¸²€¬?ciÛL”ë×öñu"ptø)*k@’ãi(œtG·Áj?Á)Ùî¨Oº³>Ãpצ³îlÐ+·µJr¹ª/¸ñôˆ»ý”oš‡9BÍéºT9u…}sBÛ)rGý2B%i øXVб/}-6öœ/`s;êuÉ~n»ÓiãêPÑ #Ч-×XÀfxÌAÈøýÏÅöEeP&ñÚ鎠'ý5+[& XÞ*%µÍTìKz^îáõÔ8 ±‰’Ç&°,Ü’ P‰ Çy7‡´ïÚ:µ8ê³b­™ó5*JŸ’ç1¨Z05®¦sX4B?áÓ]ö~t=­é…Ç©ZVQÉ(ŽŽ;,ážÎÐ+ùœñp’‚}1g-‡›Ð$¼,N˜¿þÂÿçKבe/S¾ûSß`Åf¡M[ý¶tm~*‹¸'ÄÔ ¿Ó;˜·âÓ<Îv‡£á|8w{<«Y\ÃÊvC±[éðlѼ–ÍNzîË»jí¦íÞâI<ñ|A‘äeŸºÓ®©&pË×è¬?涭z×ß›µºÄÁ½êR¼Úf ȦÐZ’(Å߯—Åñ·sêùû¤;{&*Æ‚ÅÎ^ÖCÒä^íä ¸ ˆÂd¹=>‹Ë•}×iyŒI£ãrçÿθÂ/>Á¸›É ?¼ž÷Fwã=ñU¼['f+LÙ?$Hüƒ+àV¥'ý,öTšØOkb=ê5ÑHê`8¿]|b{¥‘Ìèx’Añ*Njß.ø¥nñ<ñêhã¶mŠ<‹l Î\¼­-Û¶óh/Sï‘SŒ+*DžlT †§P(xàÕ¯Áº Ø{+ƒËèâ½öOeekWÐtÇñ¼äp±Ý° t+ÌgÂ^”=%·êåf.•:»®UjŸÊˆzÝ)•ý!ýÝ´*ûܵ%rÀÎÃAHŲ'45Œ&¹ä¦FÈ-êÔß 9‰¹z»LR¤ãHVÖú¥«Ê;£2ÜàU=çMb—É”Gpl¼Ë›1| j}²vꆩܕb.Ç ÖþëùÉCjïwzÉ›(ëyG©è´™|Âcõ¤CšöFã'%Ñ @µMUnz—MÒ‚ áÖˆ{Ù((#º]Xxª}_•—Õx Và8ëó‘o$qú~ô#V‘oïᶷýgîÑÕ¨ä~mñf}9-Wá8yHÁ’lÊÄd­E†³ê¼³›öènF“^ߦ”öîé3w‰kg¿®hȶ®-aÿ$žÀ–ìm+{€‘<•bj®”x>^6kÄìé7nnFÏ\däÛþDX‡ú‹´€eGꩇôày•Ó½4ã½ØBçþÒš"–¹Ýë|Ï^¶\ÕL äü‚¾ ­Ó¹Ií]K‹);¡ýV/Œ}] zdûÃÜ-­6¿N¨6¬¹b,»Œ³¡euúšwÉ«O0áªûÚæ4’lÍïúuí‰mу‘lOÏö8Æ–¸ BÈ–w½¡[‚Bªk h l©?ìoߎîáHy#K`Æ[¶„Ï „"Á"Œ±ªøâ1Ôß]/†á¶1‰íao¼@œü‚d¤³œgà ¥´‡€¤7:¿´€´ƒÔîTŠk¡ï¾úôËZsïk’ôþ¶×«ZkŠn-ìªÚ÷Ö,ŤXž¨&Ht››7áýK¥G)¯Tº²+ãíj=‡-üº6+âÀ¼'ñêP5º6¹ n÷»'6‘(­ó-“J YÄn¶ ôæ[õ5ùjVWR £b”,[«oÙôR/\ë긵=Çñ{cìÝ) ¯¤GxÜdVc–ŠÞ'uQvuJƒÂÛT2·Xˆ¢épÜ>mcºù¨ßêw;,|J@7˜.³o(­QƒTâïŸöI8®³IFŸ¥):3 ®¦À¼‡g¹ú¢:½{o¯LZ±F]“ߎ¾„üKdv#?É×"_HÛBþ«óã/ þjs½+ñæчÐ.tm£½Õ>´Ìµ¾` (#¹;ÍÄŒñ^½³ó„|b½ µO›¯¸˜{Ô韷Ìd -Â=)yØYfäÔ<^} ¢ß‚ý;ú0Fôòn§ào,~·P€Úk^Ͳ3ê4»ÿe® P5KV>*(ñm:ßÌUa&ù[?µ¡ØÈ ;¢K|S8ŸLD½—²†ª.Š­í*1:Sý…ôOÈñPã`8tÆd~Úb¸Õ°Ü~]4¼¢s¬\µ´è¼Qɼ…Ô`¥±EKó©2ÿ9gÓÉ9AÓµgJþ’ É(¡·f‚¼½ÓÔûÆ*z”ªs'.lS¬’ëx5á?YÚœ$5\Áå7gñù¡—qÞùÐì#g€SpÙhÖŸ WÈš]^kÈåeö…õÈDb„A ØÓf8wÑrÍsÑ¢E 9Y6ï=t|‹“«°¯$¿2]øy˜ݱ YBÄš?bh”‚z¬|ݤãQg1In]:-ðëla¼Ñ*I¢èfãÙÃ]+M=E~ÐVö¦‰ºE`vŸ+(S.’µuÊê¹êy³`ú‚y«ù„îTÌŽcÌHr7…] Ùáv B‡*Ī+BÀ³ ³µŒ'˜‚¶ä]û6¿ §Íb?Œ?X+”±È·¬ É3W`r›Œ7x¨ö?¦‘¸Ì–Éb¿VóŠêþÉÿñ[ôOÌIzÔü&QB÷kš«›*YÁ>*vÐÊûP4ìu)P”ëð6^ýAôÖpÖ&˜ÉÌ ëŠ’™!-sbĸÃéó¡'ˆ±ÌB„ÜäK{wÑÔ•)¢»+0­t›ïúP†fÛ¾Af±‘„kŽ¯b¨ÛV}A¾9ãgÚ9baœz…Wš&p=Ë®â ýÍÊÞ°úáª% òu;üO\’³ ’#Ø{Ÿâ;NNBýŽ÷ì×%Rင„PŒšàù2j |8£™#ÆOflEé:IúÜÕŽCµÅa™Ñƒˆ7Å…€.[¿‹6nç3ßEVYǨÕ\Ìšê5+TZ~ÝÔ¦`2“Mu2ÛãS¼Zd„6r‚ž!BÉûx»FšžwÚAÓÀì#Cââ ›Jò5æÎýiøVãùä5ÌU@ ê2B‘äŸpE¼‡TF¹¹Ä¶ƒ$'áïö`Ðì†é"“áºÉe¶eÔˆ±dµÊVyE¥vH01yrä'ÌMÍ0íJ´ç‰ BÇ:mC»˜Y­_UïØ;0a’[TÈéŒÆÍÒ´ŸVÙâKÊ `öáC§ýKèAm‚êÊùâ¤Xã*ÏìÙÓ9…‚1ÊRz×^¤+5G¸ Ï îò­þõI) Är3¼I‘ F^l™ýVqí$C _¦¤ «œñ£©%Ž……÷š£ÝÍ7[¶E( ö t‚.?*½MMÊø`¨¿PPã/`;“󀤺›»VJ›bì{Â`;PiÊB®±®ÓE,y^z& iè.O5éy|'$›ÁþÂêÍ}¤‰"©s¹@‰Nׄ”MEÙ kÞ2 cH·«ñâñÊx²ðòî²î±í‘·œÝþñýÚ“`kñlˆl üp«ìô-êo°L |-40åPäkcO¬d/ e?TE ωU徉RÐ9=;m[U¼˜€î±Ÿa²`ù¹qƒ|f1a©å£%~âÁ§keÏC%ÒìNÞ–ÚÒg¬|¡kp“QÛ*Ëðòs ¢Ö^·G°iŽ%AOn²±^c~òrø®×íœþ^¶Öø¤¸Â"® ÒÞª½T”ŽAsúÅÑù"½¥×(¹nšÄà©áãÂIÌe^âæpsq#æ_(}ä#Ÿ#€ÐwÅ3Å Y¡úI,âéd…Ö…B6’v;áÁb<áˆ_;W[Z‰ hQ2·°ÙR¾.\¤Ê;&Ó¶ôçxáàgÇë‚äxØ-¯úÝá¶3¤9F»”IqIu•¤/Æ“`ŠèV4*íUûÏId#À}ÄÚj”ÿùùPÍ @ h_¦âﶫú³ˆxÎL2.Q›}‹/¢æ©+þm!Ò,t€ÀÿzñÂûÕþ÷‹? ê½Wda™ÅÍÞ ï“]ù»í4Š5$‹ïƒÐ#÷ó$‘¢rÉFd[º†ÇQÑWÒÁB§±<£¥}ñßI+€VQxU · É.øWkÀõã_¡:·§êU­Ûì`Bª“ Ü(VLÙxÿJç“ÖÏ£+?ßoXž9¿×<þúÛ?*ey·£ÉÞÀÕPô•àþ¬Mö Ð“gkXíÂœxÃÚø’[õ긿ß ǯ@ªÑ‹Ñ#þ‘"3ák÷Q#œhÅtð Èe¥ÁÜÊä(’8¼8«ŒD—;œZ‹ª;ˆ)wÒ8£ÑÚ@.ˆT\òâÐÛUKt`BrByàµÎB‹ZƒQ7 ಋWI#9îz\_H&*¿&é® 1©’í!ô`½‚Ÿ8Ÿ­æ/íÆ~Éc)¹úr~wiþç’~©‘íéñ ¶ìt³‚s¯&˜8Dûõw =¼DÉ|¹¾«{£Òî£Ô¾ CÀ°²†7D@ó#Ãþ9$ÄWÔÔ}ÿ Î<%ï«À®hšj~$ËÚ‚ˆ¤ÈyIÞp¸|¸P†dø*û”' »†O3¡¯ý·ÃvÁg_sSöæãdêwöz±íƒ³@6}€O*.Q·¡K¥Øäuµ˜æ¼9¸"Á °=€VæÆ{âpRì›ÛŒ•J¡U:dTþ¸€ºøæHFÕ d+߸b§7íÁ«æ¨Ó»ê÷ b5¬†zbB- Â?‘’Ä0‚9Û`Žãj9ÐÞÃ]击µ’]Š¸c.+JÐC¤£Üò‹~]ZíáBèÈï¤nÌ=^<Ü(2í|ؾ<5·öʱò/W‚žOßeéBò飓Q¯ëÇî‘kvÛ vX6Ó`‹®2ÇBØê«Š1Fò>¿œ[|îãÓóŸr›\#WªyôšÐÐáJýVÏ8½ÏÿÓ¸YÏg5Œ}Èô„UânküÚø;X 7éõ Vv8F[PXJRýsªU.CÏ•Yì¹Yˆå]¨=›T÷@^†ìX¸–7JnlmXš€íü€ ›W·!½0éðÛèÍîÙIóU{Ô¡JÊVû"$(3^Æ$‰N `mNÉPºH{a9.˜¶ŸºóžØÕZå×%™˜Ñör ÷3ú !Õ—(‰Ð2Ý EÎQy¤š4ŒÃÒñ~w÷ø˜âÑ–ÈœK¹g³ÍñmËXÛÀЕíí[G¿.rˆ¯õ¿Ÿ6ÏÿOmo/DNü9N[êÀ(,&¥Hö3vGfß+*èðÉ4½­3âCÃ~ ‰”|(™Â2Å"ëŸöíË3#º;»º@ˆ—*áܦR—g9s™¾¬Ñâeìó¾ý££çx…H.è·9˶ª¿õÀÞ®V +Bu¥ þsLS†Ÿq¾ªy²k Žã`)åCšûþ™R“nççàÖÈF‹ÁVÔÐD¥àÂû/¸  &kJHûÓííéy…<%ø;õµ(ò]Ò¦>]`x£9í9„}göU ãE·x‚¥õFœ/k8¯h^r`8ïM•à£6 q÷÷B!78<êM—.Ê{\æüAjÍDîï­S N¦b*c¯.s`ꪫß=Œúi–­¿õ4º]¢®’úáè]·=¥Òe2Ic´Iào0àT.xÕç¾Ø¿G úCé¿¿öß±£bI,õèé3üëõ*I°ûÓ_ñïã;h˜ñìoø—+3P=z~xhÖzµœqÚäsî JÛjA‚äQˆ¦À—ç¿üCNhaÑPF>{vXµ°Ã樼°†t}‡ Q9d j®jÅ_Dï`£ü*HKÀ½@hº×«øáb¥#NÓ½óì—_¼Fg”eHº¡’¿˜ïR*_FO+ç{Üìõšå_ÇóyL°cUÉÎBEÉfž.pùÑ”X$ ë¹ßÂŽ7±»J̪Áú›U6S‡ZNN”VÌŸ™1m¬åèOœÛxßÁ»ÜEE½3ŠÝ•ÅºÝ@,ÕÁ+ŠÇk(Ú¡yòäðTdѯÞ.ŽùX¼Æ¯u5°ÙE>k<«³G> ½C1ke|ƒ»Ô28°f´ЂíP0ÁSÆèmGÍÞÙ6' _~†ˆÀ͇єëDb:.MysCe&¯?%hÀÃ±Æ *rZ$3®›d¶¤W)Z$:>/ TK½æj³°ûÕͪª&kvm° §±‰)6© mxè‹ÖÍì1F Å}ʽˆ°¦¸HífÐïų9² ²r2­w§Í^çȯS¯XÐÒ @Ùd)¥pCϤ 0Ò/ûBoW$%Ûð gYŒq¯1§“[bÄâã|Æ$ãÞdC*Y„Á[ÈÀTZ‚¥îu;èeZãèiãð¯õèµybšCâ4YÉ·L¢¿ã”ãš@UÅÚe­¢_ðßÏl’´ü1£ã©Ùa5á{‰¡E·—Cè Û£ Ãd"€l–J*nÉAâ±WŒ²ÚšFš$?åÑ\žs#Ùkzu’|4²o‰ádñ15Fü7@¢¬I¼st§?¼0£ñK´ßM2sœ öÿ‚;\i—@ ÖU4qÔ3rRa™‚jR#lTú¢¸té€ (šUD8Ë쀿üßÆ…ŸÍ¹ÈIL1u7ŒáÿtÓ«U¼º;hg’Õ4ÜJ&-=?ø›=öˆ¹‹c 9 ùJ6K'´ÎDo€¬OFD€7?@vª‰¨x/E^hI=®ÐöŠ[ªàoEØⶠüJRT"ÐÀálËvÀ#Ì•®¨ìmæWÆ7‡Œ|?ä¼±À¹Xç’í ro–È`«h_ê§bç‹;8v´@ ¤ë¤æ:Õ# ŠAšèåëv»eÑj¨œC4`wŒ€å>‹W¢är‹ ºj´ãi³H´€(!”©Š)_š¾è‹É,á$Yç´‹z£@?§Iñ¶'¸lµp2l½b¸Ó˜ß1½;Ú§¢ËœðC£ï}¶v¸Á3íÕùi˨–ešÑŲÏØ[â×Ùù«nǘ-xs w*y‚¡Ž4ù éR>sªYƒÙýÌ)F‰xþÞDÊó‚Jð5î=‡TESK“|ëÔŸ¦]û2ò>òÖ´»gßôAùD,$l£.ñÒ€ÂÍ'n²¥ÀAgÐÜ“T¢ÕßÌk‚.YÔ.ªAw섃JÍN|A¿üIÏ«x·­gÂ^7]‰MÍva/Ã8]‹¢cغr2Gº •/Ñ•êQd3ƒNŽ.HÕy…¢„óYùrÜÛ³ä:í>”''G†9R.Èjvè=¥zÉ× ÜÌ2LÙ¥nñy?¹~s3n$· ù"Ùâ f8Ý5æ>¯(+ª§D¸¹Y‚R¦'÷…Œ²t°™cPh«¦Ø J ¹ÌÎHÕ¡óÐÎ-v•Ü©Nî.æcÎã”d»ÕæJ ¦2Èú ó€Ñ [à¤@'¬ µœ³O€û47³†jud¨‘°¤5AÀxC/ð¼qýï|þz¼êœ6ï.Gý£ÒjH‘†±ÒE ›ˆ°©¦BJ^±$pßr·Äò+ˆ0ÆëâÎþÞž"¤ªÖf…ÖgÍÓ•±³¬ÕvV†¢[$˜-‘Ì©]!·’³ «‚Ý'4i'ž‹@O½Œ‹ãŒ  ñÐÈÊ‘í°{þu2õÑ1˜™³o~vh4Ü^þíMg0:o‚oº žuîÖBáÐÝT¾˜¤þ°òjúôŠü&Îïàuå{ÌÿµŽŽŒ°d ¸^€Iû?Æ7µ‡Þ=À†JfýëäأŴZóÈÑÉW¸tþ``q<¢øuÎÖ4w°€+{Š€C\!ÄDáìmQ}mÎǯäÆÌŸTËiòËÆ#·Yaô\‘E;&2v‹#@)KÙ¸iëd|ƒ¦ÒkXk/h=¶„˜9y4«•ªP_ež…úo¥©r³#jÄ,ù»ˆ;?™|íÑWžp4M¨Dma_Úß/›£{áüYèümÕ(Öš±Å¹í:³ÆÑÍ*™¾|ôùS|ô[`·DGDÑkzèŸño23hº>3ÀÕäÿ¾3;¸Õ9ûSîå¥M UàaRïgM†{â¾Y1{švÔ´Ï)”'Ö‚·T=,œwÓq Ç 'Ü«²異¢j†iüq³-£ñUµ}Ôíœ Û¶üÊ7¬Ô篳kR™lÉ…°áÅ:–@ÀµÝÏÒež ¦g¶¹Nê+Sn5HGÄGébÕ·}zÞ»|Óìž·‡—g ‹ÿ­Œš=h·ßtÚo·dq±I†Èô&I*¨ƒt‡G9§0õv9‹*' z™*sDZÍúB1ÂNLËx‘Ì‚–†Ú¾%"‰û˜2!Þ0ä¨òÚ¤„“…<…›®ö™ñ¬:³êÑÑì­éŠpúup ¤À/>7&ºÙë<,†i¸+êÅc{ï^a[¡ŽÅ&÷Î,yé–ÀC—%öví«;: 0¤~sÝ <\‰¤†—6'73TµÏ«ÆòèÄv)€ÃÈ]¾yiÐÕió1÷ËÐoJC×´„Í6ŒÆ*$ö–f]SPtîBƒ¸Â1tìOéÄ\¥ûæ¤-ÓÛd–[{Qçô´ƒ04 &:öòm§¥*l_FÏ~9ÜÓ½Û#,iÀ¼Þ·F´ôߪþUÝ`¡ä•+,¶[dÙ^Ãó%54€ Y˜¯Ãát~®O¸½¨Ña‰ÅìóAcÁ[bU€/ýƒm«€8:3Ö®¼û)¹2ï®>&+ïJdHó£ÑîÍÛxWÁÛÿiÙTð.h¦>”»ìÑÙ$WSªöKDmÞxò16²ùÚz1éG*îO°@•!Ž' 3Šr™Õ€ðæ¯2öCª%:+6ˆñs»fZù0»¾<&EIF6ÿ‰¾èz˜ŽáŠ ;{#°(6;¥À ¨4,°l/ã«t†›¸ðåýa¥æÀÚnDÎ üt» ùàúäüÞ¦0宜/ð\ïwvÁ™Ùáò”V\døLp°)`höDÒT쀺‡m¿w†=Þ+Žn1)Š…%fÌ`µ¥=U @o\D/èË0ÇÚaûòBù’ƒtðk4zp¥é£3ˆ{d…ÁY<£wgím¾’e ˜2ЕثV!üª#ÅŠÐ Ìâ‹(þ[Ýü¿±à’:÷ß…ÿ½6öyyAècR\Mz©˜“«h.ÀZG " _šÉÿÞJ0¹–°†‰Îý)Æ9ÐÃ(È7VcŠÀÕ‚áçS*‚êþRfœ’¶’'8Ý0F³Æ§JNO¹@¸ÒßïKÍY€a»†ð Bq}«Zr—zäVf ЖyÕôú­`Cˉ_¤EºÉû÷W›3†Ü|×¹IÑNò@W5dŒì´,ú$ ûJ¶´ÙëÜÈ 7«ºgKäÄE®D\g鶒»éѹOè{~Ü»ÜaÇÙëØñ¢Ì1>`Ô¹¾Õ9*ö» tŸ0:*<º<\Á,.r—S mª¨1SsD°ÂÿŽØ›Îs`åe€  É ¡p8÷RìÐ5Da~ß™ýu‹»Ëp¥B‚Ü×ËÀ±(=Ìbr¬CŬ 5ÍAäµ BÜ¢ ñ‰™1>þ‹µžSôc žÁèõ÷2wàSÕ“¿h²;ÚþCÄÇdžþÉ’ümf.¡üO«$r‹•±ØñÕýõš‚'‹K£­¥d’®3?öO„'óËÎ6ŒòC-¨Õzº“ý¤&åkVf€€ú»})+•_fÇwQ}ý,¡gvQ&pšUÂ+Ò²ÀMæ®Hf“¼a÷ë×Ö_¢8¼íZ°×3Od Ë\„¹’Zšgb1èÞxihÚGXLJNÅ ÿ—öXÓüxCmQLº™MUGc©|J Ýý¬NÔ†¥1ç}£+Ëv³2Ž[ÍSÜc)©ô±1I®¼Û ëj¦è—•<’X‚ÍPðÁz4Os䘦‰“.YjRn01Fbèó®£^ÑNþN÷L¯yúÙN5¡5WWŒ¾ Ì/;_väv vº Ô¬‚)­ð»¶R(usà*"<î­kÍ’í¸²¯"ŽèäÞèÂPz)ytç5¢ÏI±ˆáÏÕv€§*„;ÅxÊ—•íŒX B–°û<*- ^ñQÑŽðÎï~# R ¿ÞÏÉÀ̽ñ$̆rŠuØÒ«äÁ}†!Ççvƒ±1W”¸-6Œý•aY%;Ù@%çûÞ:æ…Û€ ¹ø~ÈMAà¦*a˜.yY’c¿„„ÞĪ1§Å–˜$ªÌG£Y–2å/4Þ“'y.÷tÁyX?NòÜîˆöt{2¿uHðÌðè¤-(^4Z–|lNG\·…úé«;òH'dV›V9ÅËÌ‹ãì8fÛ‘£o6 fb‚¢~oZ;Pjžú¶d[êÜà‘³AÿxÐìu;ÃTÝ{&›ùÒk½ )Cؾpßmð€áÍB™ r›ŠV+Ÿ|? ņKÖÖ5Ê^:M ÷OJÁ9±C2c #k óþÞð“’µÐܬ³cçTzçw’yÍóQßüå²Õ~ý0Ù¢ó¾ ³(¤™æÓÆ"1 —î\)"+d©E¤×íZšR’’½†Ü›,Åf¼ÛTŸJŽèÏ3R®÷‚lø‘·Ý™1(!Ïd3ûnJ3Xj½~ë!«ï‘ù/ÀÂê"Z–õ ¯.äÁ—ÖW&t ð÷†ö<…ç´H × *$m,uµÁ”äå}+CbËŽ)cXÊa³¬§8ê¨o:¶àLràÊ{ÂíUNyêlÐÞ…Ajã«»~‘ŽÊE3Rš°Ï±C(ÝWÔ¿œn¬› è£äc³~ RS¦ØGúÄ3fhaD‰DàqØPDYÉ}ö£÷îÆ&+t‘Ùƒ c 5;EÅ$Ÿ¦oà…8ÚE¦Bìo•Á1…@ê·‘¦íS¬K05*ÅQ{8 «Q[] èÜ(_Í•• øݱ¨)VE>Ö;VQºâY¨ÑHȱ ÷¸)ʽA¥A\Q¤õ×t^/Ù‰‡„šÝ.„Z§Ín0Š† Ÿ¸bÏê´æŒÕJ©`¢ H„ΡùSUá-Únq•^/yäòxÐ??»wXã_= ò"§Qwó0j^±FKz±E‘¾©®² |X <ÐN°,\:ß#ƒ¯ [BªŒP4oüm}x駻oÊm‰ ]›|up•.àÑãÌ™@á- œoãÈ9ê6‡Fê4!.4üìl’X64fOÒ£dûœ·[Ç$1ë®QVº=DfAá“ ‘o ƒlx]/Ù8·çì2i1%weÓ©6+Ôá¸FR8wßIó ”›Žä!4ÜÖˆ[ò¸§æÔ@? lS‚@ ÔÝ’=, LO³bu%£?õóËðŽÃ5û”¬À9ih^Þ€d*ð¿t&Äl&³&šƒóý”usO` ƒcáå0#BÓ¶ßt@ ïçùØ%‡úEãå?S{Ðl&ý¼Uó¿ùÅÇ¢1O›ôðAÓÌ,à6ÒÅn:£RA¥µ¼ËUø½áZ2âá ’M¼Œ …S U.ÖA5Ñ椬´3ê u ·÷?dÛ’¯mmz¨ò)vÝH²¢0Z.7@vçcÀFщ¯2>í´þÄüJÍ+¾°É)'’܃¶ÝÊ[©²Â™[¶÷¸ c H¼‚hÍŒ•˜ÂÂHžø"ù*–r$V‰Üç­š«¥ƒ[}6¬¼A˜{Ì>¸]ÎÒq y€zlj2Xd@4 ê[{’½Ñ1¡ŽÈñ ¶3ªëO‰!òèì6è+Ѓ¹Ë„AØ}NZf2rŒœMoGRx&&lê'e/òÆz=õË;Ëèÿb ²¢@íZûG'Å:ÚԈĀá%¶D3Ǽn©4Z=FAA&Æc,(¹1KýjŠmQF-så eãЩ¡¼f! åŸêcfÜÉ’iÒòµ¬‚K§z=Ù(ªì3tÔïv›¯ú¼àÿ}x# $$¨Š òßL›³Œ«ËÁ¥v24 }D5ζñv‹ŠE ù@·‘FŒ ‡xj&)ý<üŠ¼#c¸âÛÉš-{{Õ ~Þë^vûýßöZ¸Š¹ \¢°Ôú¨5£Xzc³?fÔïëþ|An›ž¹ÐfséÆ‹ë $XïíYº*;y¾š ,äSã”bÑ+Œî‚Žê\bJ©ëß»`Ôîu±ÚM©Á€w  ^Œ×mìשîmJÒÙºav?j‚š>kZ ‘Öá1ÝCÂ+ TÇD'¼ Uo»‡±§uùêb Eíz¦îa‘_t {¶{œ*Ì“59d™Q¢8Øgÿi.åE¥™TÈßf·»bŽ„ÃkUs£þ)Ky§çŽež×³ì*v±#2ýHΓõM6Ñy…~ò0›;[rˆùNÂnz0¶ˆ¹ÏÀÍA!à”ëN¤y‰Ð¥ˆ~:¹ŒTf ÃcX¦Ù»Xï¼D…ÝŽ­[ á©öà!·Þ=¼‡#òÿ7÷1ÁeçøŸ¬B+`y[Ýö~Æ~ö'ö„Á»Ï¼BáóÕzc¡< ^wy1€H^Ð Ó!àä8¬¶²CdÓð¤ÿÖÖ{tÚ÷_ÿ’×äm"¹ž|!+ÕšÚz•|B.÷XÍþS|'ÕJvº;r?¸Íz3»t¸Àõxãr=³‰ÀÉ , :æA5ïôšÇm£ zÍÑ6ëQ"U±9ÒPnl‚  N´„N\ÿ½¼FœÀëtJë§Jm«±šS"Q¦až•iÕðZ[à™”Ýâ9º,ˆ+åoó†TÆzËoúiìZ´U´Ö;²‰Ì: ¿BþWÁ·ì.BþøMa0¯T¯÷æe¼iYHÔˆ|G^˜|ÚX—½æÅåi¿ÕnÛ=óø6oæÎq…P¡!×&Ö!@…äÃÙ±)FÎåEï¹ã…®(CºùGíÂBñŒ»¯x\<|CAðïÑù#KÚ̶¥.Á×À·©!™]e·¡&ã©4˜P^BRêÆ7élbŒÛÑ%3˶ ’«)|L5r­”yn;³â»}☠›a6kDMˆüš_l‹vyȧe?oV(Ðq~•Žù\ÃG ­öÙè„÷y‘(< ¿º’ÛÒ‹»ì#(Á fòÝW5M~Ò–û=7·v,}gñR¤-³=“ ¬7—àꎓ¤$›™÷ñŠ~%]‚HøÌfé'(þðCM.ŒóG_d Œóáô¾É•gt >ôNþ3ĸ†h9B »pL6_nø4£v~?NÁƒâa’ û8W;àóÖ?¼Ñ9#;Ùå:dö/2þ7†²´B»Á¹ƒ‡¼ à ¹«£ªÖ„1–9/J¡£×\úÕ» €Çâæ!‡\¤GÌQ>¸Ì.]ÀÔ‘™ÎDŠÕmrŽQ¼Wà§|µð†§òî—¯±{lõz©ü–yz°â f ­Ó'Fa6„1¡“™Ð~D9*‹gÃâw,v²¢Øƒ•…zÇX«~š÷½óî¨s9jŽÛ£¡æ>†4Äe餙¶uÇ[Õ.0~yöÁ'êdOœEÅ3H+HŽ«Y—<†Àga¬)6Ä£Rr ËÒ1\±ˆqÑrñßîÿö´ñkãé!dÔ謗Êﻃ¹æ³ckŸ´nÛügë ¢î3ÀþžèDj”ûî«)8¯Òl“Ãö#/ frŠ»ó×JbÚu‘Ø ßÌü¨ÛnžžŸ=t>œIî Ðk“I Ó è)"ÿ Ui29K´¦¦äGûPKÙ{TB0±Dädsa.cpp¥TÁŽ›0=ÃWŒ¶R¥DíJ=ìž²®"5‰"U{Š `%±‰mº¢Õþ{í¬²»‡^=óæ½™g›ÉREý¤,á Àc##d}bXNaD¦³pû>ΗÞLÖ¥„Œ\W±?¸ÕDÓ™à¿QêˆåœêJâ!T{q­>ÇU–¡C o¶‘ÙŒmé«ТYŒ!\ø‰Cu¨3Í9òùU¢LŠC³¹]gÎ5æ(Á6rï:‘–Œç‘AÙ¯w!Ñs x*%­#Æw&Ãw^7P?‰¹Žzf:)À ;F9¡ mƒ[òõöûíë8Ò0©Ñ´Ê—z“oVÑQCb‰tw?àÂõÝIÑy×+ä 64®S­ô ¤SÀc+y%†GJÑCžzº/é —ä‘4íJäf3 x+ÓSö6vámCÞИ3ÆÙÁ÷óïØôö5­}†¨uÏ :ö³{WbÿáÞ ùKó^'†ÞI4W„ƒ×¼‘‘Åø¡éžTÚ\œ\¶‰—á«—ù OYæþPKŽ= $J»dsa.huTKoâ0>׿b¶•* ÕªÒŠzHi–fËÂì£ÒJQ€1X N;TlÕÿ¾ã˜ÐPµ‡(Æ3ßkìp&…Z¢€þô‘GÎ㻙߳3Ú“ ßo³ËNþ ™"ë\2v&Õ"-—§+‘/Š]nºëSÆÆþ(˜q¿Ä·Á ·ú¶’qÞ¶ø/­ˆ´\©Ä”‚ÈŠMb Ô¸„ù\ÿÅH ‰g¥ª„AÿzõíªË~$ÛÄ‚4KL÷D$j “ð·†zÃ5u *7Öˬ¶òÝ9y±q+Ï–câv‹ ÆÄñÚ«&­É¡(ÕÂÈLÁ"S[,Œ†9šgDeEuN;S’ŠÒ¢Z™5d¢1Y!À$Å Mí’„L¶÷us góR,fò¦Ôð©LRÈËy*¸ëR +µVÛFÖÔKÓw~ßeoÍw¡ã¸=Ø·¿IyÍ«6è;¡1Çrw Ò OR‰"Û¸e»go˜8º#?GôÄ·~ÿá·?½›ÅýɈûQxÃè‘1³ËÑBˆúúÚ’ca×¼ÛÄ ¥wÜò )侩)»R‘\5õi8 âa0D÷pãжÖÜï5qþŸÏqTû ÷~£ƒüa‘,K•Úovže) ‚S`}ƒºut.ˆË·#¡î†x•þù"+•±‡ÒkE£9Ï=(•=:ú mKn)kÌ¡ë©ÍN^Ü wFk{{Õ†ÜA‰Ž8ŸÚ½W:}TK)š(Áøî°ýPK=T‡Ð(eax.cppÍTÁNÛ@='RþaD%äPGP‰ZTE …JUMÖƒ½Â^[»k ­ø÷îÚÆvTÓæR©7{üæ½7óF>9ÂçKS8†'ɵ&(|H#dä C‚4ÛDœŸÄh*›-܇)ò^·×}Ç‹2Ÿà eá ¤þø|èô+ÉQ–‹5Ì¿X¹û‘Ø¿àkÒcüOX?ŸëÅ¥û¸<}¿Ž`—#èÀŒ&‘¾Šä›#BÔ”F,Ü}Í>ðËÚ8qËù"DD<õó„G>)_›s ãš –šÅ4êPMÝÍ16Ä¥eŸÆZoêàŸ„I06âMso'ŸûÞ_Ï]ß›¥äMǸ¶KILè<…ùboxÓ³ÅûxŒ§ïðÏ^â÷ÜoGn6¥*Íh%dhâ}‚<óéë`ÔÙÝ:õ@):‡«¼œ¥ÜÓÿ¿Íí©vXÆ÷Ô€#Š‹…÷Så›ÑHÁ‘.û÷‘^ψT7¾o‚…d f}ŃB$zj̓²E“—µò!Q pK²Ž…ude¸MI‰9^°ÑR&¹YRIcU¹ËøOP²·-Rdö–—Êf¯öüBìúCO#ï÷D•NklÊgAË”R~œ [z|6Ò‘â6ÄUÞ¨û–Fá4û6öc:*n¶Ý™‰·ñ°o~€i5·såC«¬LU~k¥ñ¬Ÿ­“:¡ÑoB>¼sœB{2ò{8ùüî;®“Ó(M³ÑèòÀ 9ì,QçÇÝfÚiˆ— DšéÜ›øV Ôõ–ØNøžÚq´² iÒ~`f77+ÉÏ=¥±7ƒü("ck:W¹^ÝË¡Ñ8 ??ݲãûAÈ•áDR®fBÆv‡œØû‹K·3{CE0÷szçÊŽmc‚ds/ïÖæ«»ÄfæzƒIšÿS$½Ü„D R¯¬Îc»M>U¯~ºÅ9|,"*÷Gµ^wJ ÏœðÍLk¤IÉBÂìsq¡õ²Q«­V«ª]ŒˆDÂçPr^[±WfjáO³F[—ËÞrPÕ$Ð6Ï«.;$fîX‘±ú½^B–nÚ$̓ÆÂÐ"9á¯ð±g` o ;'£íîF×íwœ:ÿPKÍ=_þY%$ec2n.cpp­koÛ8òsô+˜]¬A¥®òØýä<y¸A€&uììî‹@–h›¨,©•Ø¹í¿’’(K~4·ýàŠÃyÏpfÈœÄ^¦ä#y\J?Iù ‰œ1’æãˆ$Læ>@ÆKòOÆÉÏçgQ2òS̼ÙO™Ä!›ëá¿O_ƒç»ûÁ—áÓÈÆUB¹‚øYl¨KH4ecá£n6"K ’yªáÎÃå}4¸¼î?_õoïèµX¦2 \Çé_Ÿ<ôzøK¯òÉ„ > ?Î&‰˜û’'1錥ëìõÈüyÂYÒ«þð˜‡ìöÓÉÀ®ëü×Ùðˆ}ËY0½-Hƾáö©³gh?^”ÄýˆÍY,)àtµ¿Ö±Iö•§$IQ=?1,töø„Ð}Àóúq8d~0c!Íö@µ½ ®–’]EIðU¡›½<Îø4Vá“$óLƒKÙW\Ž¤àñTKG²®ÁC5¾;{(íže™?e ”ô»ã¼$<$Ú«7ýa?FV›\K‚$Î$z°4¿¢ÓÞ»©\«á­®-©6ºv–rm«Aã$‰ ƒ”c xŒjˆú&AW›Y/9`JB¨6Ásü=Kb?³Ø2\»y$ÁH†¿´Î`•4Læ"&¶B ƒ"nÃßÝŒõ‘ÚÁe½\¦ìTçã &9#Ç䯿ÈþXz·LRÄÄ-¬™øQ¤‡W.ƒÑ*…?c䨸‡7.—äœH‘£¬‚Y*ä“žùøµ§A›Bûç¤oF` E&J«†ZuٌЅ§]JÑKeªÝû “dxø@ÜTÎàHžÇhƒ„wÙ¿™HÔIUZ7d^2}Ë}Á†I"©IÒUká$ÂÏ'D7âÈ[“ SÔ~–1!qIÎÛå¼¹®6«¦È ãi¹¾ ÃjqŸG’§Ñ’¾Yö#ˆÑgÐÕ‡¬KÞ6j‘¥ðI׊mb”²Aad_ 2’Q^Ý#IôÂs?ÜA,ÇGz[·vK7ߔԽ zóFL^'l2áÇÂrÔUGtȱk²§æPÛgEpê‘ýn2ø·Ì`•™kR¸Võ#`p¾-aOwMüH—&´³ Ü° ú¿>è5 lÖ‰¶P¬MJ×ઘ©š‡s€€¢m«ªTúøF¡«ò(R%˜ºžæÍÄS¢,h8Øb‰¦1К G ®#…nKzB>@sÆdÿ‘^ãP©ÌÅÀ²}—¹Å\xe+Ü¡´(¿¢:Züû‚m”þÍ=ÅY#+«šÙ1o‚7ű­Sî¿K!üåˆÇ0ÎÀÏJ¿Ü/[ $ßwm1€bjîzO‰ô#ðHá#<õ[D|/Km‹þ.'«m‰lµÉMŠS§о’#šjÏR êZäÀ´àýƈ Ô‡ÍRƵG¾¾‰ Ö|1X;Òý‡qÕHúCDƒñ+õlwR}ú‡ñЗlà Î$Âõ&™?äó1·,fÐ)A:"žâ \;U/,²G d›BúÀYÛ߇Nʘ¥ú¯ÓÁ¦äYâ:ÉÁ —œµN.­³Ùà4~''Jyrq Ò ÁÜ°€štŸ„y”gPï²;Ï>Ž˜®e¶ e÷LðÉR‡ªž–ÓôFm„éÀ`@ÔôÐYª¯¥••U7‚i4 ‹w¹(ÁÎåÿA»O)]|À)ã`q€ã°^ºK÷—Vÿ¹äÃñ#¢«‡¥¶~\Û¸0Nµ6Vë²mèû­ø倠jÆJ³®&$m†î:Z-“Š­%l-+´¥Vµì˜ÅJ-ë0(üÓˆÉ$>S—C6¡ÛÆ/p´Ùú4lU´ºêüyØ:!¼6á•p1#"†Ékk"hÑ+×ꎬޙ#.1rMKxlnݨKÝrï&Éñ¨\ƒÓh²!ÒuwÏ#è ˜lÚ{ÔÓûšÝò¢5;l•70C«¼†å`½@%ÉÑ™*ß¼ìÕOé¢Ð¡%sí<Ü”„&v=?«Éµ_ê{—ýsuûûñ4X™×øAZ»Ã¶+5µ¶(Á†„0û«O͵Æ]Q»[)‡^áí…1þàÿ€øÀéýžšK5àa>\@Z´Â{½$Õӹɕv<§f™«_þXÚÃÒÃOe@˜}‘~»f%”ÑÚ9‡ d‘Âô‘­LŸøàçOKÕRÏâ`xÛUøœøáÆ—ðmOݯ‰=!Øjƾ¯üa4?Ó(úéÕ vÉÝÃSÿ¶?ì’ã®z1)"Îiãð>ôJfHl!½r˜×_ñ® s£IÈËÙî#9®12™DÌן×XûKz$ͳ|_)†Øz³7×Poí“òæôô_v|0ßø.^Þ€ÚÝ~¬o÷ÆûíήÞá³AbeæùÑ)ág5¯è[%€?|0 ¬7÷Ò5]bSý‡ÿ¹ÖUµkôõÒK¤>½w±dSðG§0¨9D* j¤%îÎ’¯ý,ðáÞ¼ƒE]¹ùüü‰/˜*«Lu¿ƒÂ˜'~ƒÑÉSÚt©„g(#xüLžm.ʤ»ªìvI%}rphÿ-­ÿpã8?³8äçPKŽ=a ul ec2n.h­WmSã6þÿ q7“ÚW†ô[Þnòb(3@}ÀÜL¿4£Økð`Ë>YÎÅåøï]I~OLÛÄöj÷yV«ÝÕò1ð™>YÜþéÜÿá8+{1¸Yýn|DaÀ`Gn| ˜fþ€<~hH áàÆQÒ–¦å"¼-M²õäRfÜÌ®í;g¶°WsûâòÆ\ð<±ãX†qzzDì0 ¸d‘ñ '˜0RÁ3WÔî-¯®ˆtQ¯>½êôÈ0ˆÜD3°ÈóKSÁY*7ÌY4¼Ž½éoÉþ…Ü2z½¤Oìc²5·ø››¹Â7zë8Iœ§"æ“IASÑ’¾°4Â=sgÄ,QI¿OÄIùe‘Ÿ?‰yÔ\<ªWåçv2'[ù–˷ܽt<“wyP~iQ ‘¾ÍhnÇ’Q:Ö KnK²ô¥ÉÈèu‰FéËÈ0š§¸º·¯«Ù½½Z\ÍîîÈlGM]qÁã,W¾OG{“#Þ'çæà/fnHÓt7Ep/˜|!ÚÂÆüÑC£'òd\œã*9 ôFµT}‡vnS ­:âê]WÙgÖ‰X²'}_>ÊôëPôé¡…µÎËh¥ÌMõ‹ ­¨IÕsm®5ã驆P%äó8"sû–sc<’PN#ÀS¥)ƒ´V9ù„!ñ@*Ê<[DTõ§ˆSý¸\*WŽ¯ÖSøž!`Xœ• Ã<ó}ààÝsÊR?æAÌpoÂ’QCw´—ÿ…hYÚ·¶BzRo{T¦²ý=£aÕ-T9u“Pß_+›^CÞ'—e³8´Î0qSè€×ÊŠ_+¡s—é9ME‰EÊÒ•½M–} yæyÿÎåeŒ%pÐ#YÍRt…"H¼лd°ûOg·Óܹ4¤¼@¿žT×Ò šºÔƒƒøg]‚ò»VØiÇ‚e+ˆÿƒF+ûFÃÀ£êd2o1éâè&‹ÖÀ/€éNKúœ=“Œ¥ÁÂ’ä!l œüÖ9ÑoÀ?oßB;náè¤õ”Ú]ð7˜ G^ºÒ•&DßG;[=#¿Ê Tür6XŸŠfñyzM·E#™ç®€=ˆGSÖœFH52 |’(/U_¨ˆeù±XŒ1½Rö‹ î#¸OÒ&cµ²U쩺ˆÞ}Ž‡+ò˜¤¸ç• 'ë„r?”ê·D>A#tûTgÐÖ@û »Y×9€WÐ^Û×{QËòÀ†ÝÜñ;šX§ïýŸ.•%§n$••ÝÖTh ‡NüøÀÜ—w(ÓΪ»Xq#’ êu¹LáŽIu+JËÙŽ^Š¯Ì÷¬G¯uXõénÙ5ŸLªœ4$81¡'å‚|U’u-Q¬ 6ØwpqØQlË+œ§Ç eZ^øx­ šºôQeBg­nß»–W«ó` Þœ¦àè©Adr\FI¨f%y˜z{HWm€!Qq‹d¬‡¶û)Ñ/¶Û6,Ç>ð¤µRaŒÙ*Òi=þ½Ãµ}“ â.çN5v£É~¼2Ë:æ>¥©Î7%Û“sàÊ,-O´ªùBðvÕ· N:=CÎT/ݶð6tÙª‚ÙTdŠ¥Óa¤Á游”T a¤XÌ>ìo?^áÂÌVIkiX¼×t0š«2tÚæ@è•£,”Xå~ý?§}³ÄÿjyoüPKÚ{TB‘ ©9)Dv eccrypto.cppÔšyo\Ç•Åÿ?Ń‚1ZŽFª}‘œ jM Ä6ÇÒ8£E¶¤†©&ÓlÙÖþîó«—&mm´²LÛ¢Ôõ^Õ»u—sÏ©Çû÷§ÅÁÁúÕÉæøÞÁÉÉôïÓëåf³XMóÕátr4?XNËÕ´y¾˜N^>9ZL‡Ç/æŒ:>ønÚ,^œÌŽÆð÷ð×ñáb6†îNÛ±õbór½:·cçÊO{ç6.WGËÕâ]¦ž_>³ñlÝwzr||4•ç‹ƒï¾øê–9\]Ÿÿ×»Óµ‘õvEqº ÿëäp¾aó# çëÃÓé)1þ~~´d|¹z6-ŽŽ–'ãy/×ß/Noßžo6'îß_œ¬ñؽåü`}ïxýì¾Âß×FïÝ:ÔgŽ´½âჽ÷ùiû~±šÝ™þc’Óòrsæñ»Ó nYïŒ<ÜÛ»5¬š]Yhù»Õé.OpÎâOÇÏþLJõù):[ÞùìÅ}õpZþöw«;{·Øî-JpvùXoÝæÍ6¿ÝÜù·5FÞZ..‡?ýëÙð˜È;ÙN:‹ÄÓ9wsù§‹ØlÖ/ÛðàÙOõgooäΡ™>;8šŸžNOŒÖ/6S;øzAͼ ¤‡ûó5U°Y¬O^Îùì]÷¾®ê-Öüò giôÕçuúÀº;]qýF]Ð×ÌyÞ<Ÿ¯§OçW¿>¹úõÙÕ¯«k‹=ž0aÇŒ?$ÈFÌÄøK¾þ üSão=0íîÛ Ïgs~>™=áç³Ù3~®f+~>Ÿ=¿3ýí§›î]\ÿzÞÙœ¹‡¾ðküC’LŸ~¹ø¡*ukÃëbz´¡ôŸ=:~¹>XL§§iÆFþ³Ââ‡é‹é ãz@âõ›óìÉ[nÞV›å&vËmÜ9¬™ý¡«/φ‡‡S·Ûãôåâè°-æf†Iw§ÙéòßnîðåÞó¿^`Çâûù“£õÿ†iywZþù´;»@ñK¶íïÏF‚Œœø§ùÓÀÌ‘Á¤Äuþ¹Üq-GŽÄûtu}ös@î¡fÿƒf×’“¿gœÌNÞ¯ öߧög'ï_±b®dáþìœF`Ðnšìÿrvíß('÷?FJ^ ó ð,ëXðO‹ÓÓÇÏç«‘d—]sóêd1"sïÖéÚR¦ã“Åz>X³Ô{Sâ>þý'ÓEÆñœO¦'dÄ™¿ç÷ÿlzòð§›=u»àÅòo³a÷©ã‰ãÉ7}ê{íõ}9wÁ™A¯£r)rþ°Ø¼­âßJM¦O?y²x¶\½Ë¤ó›?§µ›çË!ÖóWÓ‹—L}B ¯ÇERâõ½[gF¾ÏÊëÅÁ_þB8 þ­wÎÒ£/僧‹ƒtú;9xìh|¹;ù»“»;ñqwŒÝïû‘·o:ÁÕ›ÔEXís.R¦’’ðÕG]›i®ÚfK4­µ TˆÂ‹ž…­:ônƒV²+.0™u(¥¦¤k¼\üç%¤I5QŠ¨1ölë¯'@>>Ì}ëw¸Ïg‚bC­§`z´ÖôŒ ¹†Ð”qUù RSç{©TµÔZ²)åh\®IÅ’¢ì^'Ö©ïîP»}tѧltˆÞ‡hÛþôÝŸøã’³øÂhÛj6 kzV1Äjeo½4]‚ˆ!t#1/èóÅuÿ… ˜åB,Ã(/…ò1ßÄ}JÇËìãËÝIÚðá™÷ ŸÛ¿z‰ËìT1‰ìRÀ1轎J.xåSȪJåŠ1¥¨R|VøÙZµÐ¶ï4©&L—ªYsÍBÊ"…!6¯­©dåm/ZªÄ—=óu% Þj¦M>öVœ/Ù5òƒÅk¢šñdõë%̇å´|ÓÛ”–dr܉ve1Î5_|oÎÄÒ‚ Jtáórk¦ê¦”Þ-¯ôNYÆêÉt×µí&eiFÅkëîéB$«‚&³<ÙNá›*µ$u5‹¹óEäU_ÔXJ+!éج»Y=³wuQÏ×7OÆGjnÅ7›D­®öB…Z[.7m‹)¶©.Ÿ«É]»&,M¿Ü¼LÖ'—HWøXÕKÍA:ã£"ëTâUjÓyS„k.Úœr’õ—7O–QïY™è}S0S¹(‘œ@v%Z]’4A¶,…•j “1I+a{ݳ.ût*¸¤ªõ- Ü.]¨&…Ú· nÚp°+W¼L8Þô¤@Mkl¦Æl_jEí½µDš÷Í‹B¥MÑ7réºf¯Iµu¡ý(ˆöqÑí }Ø Ú©&0%Cè2é‘•ªSv \*U9Û•.’ÖBè+Qê,ŠJELdçD|tap%[£ kUAÝåz ¾ÔUábàKtJ;Ó´!ÒÒûZ•²Nöw~(º¦O°ÞcbíÝ÷hŒ•M8ÙÈæâäMÐí¬ÿ1Q½¬™Aè !ÜR“M&AQ$mˆ¦Ò¡¾W‘òɊʦ,ˆ†Iu»U!* rá×(ÍÉôP¼È¢Ò;TkUY6j­Dxž”1pËÀº\–Ô(ÏvÞè ¬EY2·@ÎLV¢ •ñµÃëBi+Z¥Ñå@ïH(žCUnªÞ¼•Z\‹jBÇèœè%ê¢ÎfZròS³þFP§åoÓòî¶8§vx[’2‹˜¼Ëô$iFë›CQ×…‹pIsup0Ùé ©(á_=Vz}‚Ì ³ìµÃ$t1TE‘8Èh§TµQ;…Œ€í ÷™,³ÁMZñ&(Sð Â& ÒdkêMÝ¢ÞîMç !JšwI½dø¢í¼à¬×ù‚ÆšLü]2®XË•T<ÈÚàì?*Õâ[ÝeŒZ¦ê¬ªc72gÍA8ÃÛ1nšW,æ¢Rôè©Ð¥7QoÄ ŒØ9à Ðtöþe÷P}šYtt3d=ùMnËu÷Ðt%Eë•^椫S¨*ÚH&c:E2Š0ÐÁ­”´R)…ÖËÚZ#J„¥øqâ-¢52¥Iò¥2d-?û8k‰Es‹‚Ì7§]]ÝFh1èi©k­( ÀbŒ ðßbB M Ï»€ïüi¶Š¼Mjø…U!Çu?Ð1HW›áXDæQtë^n„$ØúŸm—h¡d²1Ðc 3¶˜ ùµ¨‰làÀHgg—]×êÓßp ò¾É ¤F•øL·4v÷ÄVÒ!Ô‚6Ñ!#TÏ÷€oÓ'Q>¨AÚó88áÆf£ºBá¢a$ƒ°èQ¡SK™Ü‰Üb@(„CòdµÌ²t®d"E{É=ù Õ8]Ÿ¼ÓÎn“ÏtûP±+lÍFÿb[×ÁJÓe7Ùt#ª‚°ƒvAkN0”rï…Xo ¤„.–ècX~Xš <ù ’ãh¨TúÚNÒun‚nÖËKtã ,Kl…¬ú‡cÜ¿&ÞäÍ…Ä¡Ngí¹ÐYCtzÛÅt'}ËÀ¦q¤'U%áP&þQå8dÑðÕql2z±m$MÇšÑJ(è’IÊœt4Ñxï:’;PŽÒ›Za6Í8(…`Ä-ÐÄ YõÝôÜAÛn(ŠÚt. u(M­6”Vb'ËÒxQœl±‰ºJŠVo"š]¤bÆDæÓ«¡=¨•Z-Ù)(7,8£S ˆ£EaÿÔŽéã䧚"aä]Á¬„úHŽ×2XÑd—1ö&Ã=R¨Ð26,u@‹Š G59)šemÙØ2ÎøBw(y?ó¡Õ³þÿU=—'JàVó£K ª™ŒDu]궸q¦É#5:«/ íÀg¦¯öd#\27\Óɹ‘©Wâª2$³ÐJSáïHn¤Ì¦Øýx´ïLv”?ÿAܵÉ(2]‘®ˆ ÈêR½§sD]átÌë)Œ“v6ÒË8ÈÊȸšk³:ZÑ ³TdRe_I[¤ÝĽB7 œ*J`¿¦¶H¢Šk’¬pqô¼¢ê`©>wðܨJz!+§iŸb‡3ƒõ°d¤2Q1ˆŽXÑQÉ6Þ£ÈJµ›¬gKHØ-ƒ!ÉvPTxN°‘‚U]ÚñMUC¹LPÛº © 4>à¤ì½hsˆÔqŒe-"t©Âz- Xö°– €®†¨˜eU™nJ&ü¦Ë†xRzËÕ‰„1Sx†öŠƒ!™ÕL‡amó†QËDgEhØA±µZ2mr×ÜΖãMíoªèk•Ríðr¸l7s²éŠ D€ƒi I[ô!<‚å w^ ~Ä(Ô™“ô!í1³‰ˆÌ´ ‰äi<Ò0YœIv(êÂã/¹Lí<…캯 :•xQ¨€=0ÖÀ™1\-!’Råçk…õQË {ðÌ%wu|!T X…Lf\ÑB»s.̃–0„/F"åôÔࣄwr¦°h@ÙÆBžk\Z©ˆ–&bFåÄ+ÔˆAשh PJ-@o5ºÊ7f!»+5&ä2A! >²3TÝ{Ž‘ÃK~™ƒÄ"ÉÅŽFD塲&E-Õ•¦q cCý¥,+\0%X¸%æƒp RZi¯Z™Í° q)%™Ò6"3$W/„äc‰7Qº–IJ¼1D-Gl(6²˜c` §@ÁGDâ6pQ”+\lˆ:( ¼–õ°6œ#m$AS$v! Œ¾`ˆLÈ£h-3è¬*¥>PfÑâzaÈ¡(Ü’)!ÌzYÿgJÛ”Œì}6bÛ° ÚB.ÊdÉ‚·BÅßHB—t† åbĪ ‡ ÁÖž – ¹ ±YU —þËDë$«ÃHÂg «ªÑ8¹ÑpU:hÃ7o9[HK+"Ä°%Œelb¤œ2Æà=¬îí¹]Âv¼CZR¸a"‰²Ob²Thºa„\’´§Ò·öe%–(…æ±ÒQÙP8e«BÖ¢rX8aÀ ^á#Vö"!Îd®c^™AEðp‰¼ ŒÖ2?¹“y,Щ Pl´ƒÀ Œ­¨mh“xB¼Æpùc±óÌ$ƃÕiuWÝ@R2Ap¯Ú`ò¾”\0xP.ÑÂ`¢Î¡9`¥ƒ;b¼ZR)QÈ+¦K@»§°¼ ô„-Í’öÕ(á¸0•&ÔMÊ‚Ç1 —2IˈeQJî.a,ª(+Òh}Ÿˆ­øL&Õà<v, OÉ|•yÂ$ÊàCÂp2Ymƒˆi'„² \­ªÊ)+&-/¬‘@j Òï5ûð'X!A¼„jâUhr!<,ßã®YNÇ(ÄÿÍéY*o„ê!\jIhÈâ|]¦¸Ó(,¯`|i·ºÓÚàpù0:€QåSàwQl(ÎÁheûµ ë@nC¬[ŒTí$9Ò‚¦Ê5L½”l^¬6!¹29Ú!àì¨Imq$ðÃ1h²,„)!ªP³`8îM[¨ªa¢$ ÇÏñN ÆT÷±ª2{§5WI\¼ã.äÝ.Ÿ?:PÈ΄Ð0L‹áà™"”’y‹:_‰Í¡5Nölƒ¬¥¢°O>¨€µ¼Ér(lJ7Ž§·M­°ÕZâ?yøÃýVQo=ž7/Rƒ3¿ÓnïïSÌb^*ç¸"vë=ÆŠènÕp²’C Š:/o° µÑ×h@Æ­’€ Q‰µä¥×LLiL¬ewlRò“¨*tƒl Fôà$êÚ+"ï<ÓøK£èkÙ¡%¶ÉóYP ßD Š…ˆùHÂö}¼EÛ5ô‰·[_XãfìLå$ ¯’Õ$¡)…s¹$x&I´YpùöWIÖ˜uŽ1FŒXɱ¬°…24FrÓäñÆ@#Ôò´œ†~Œå—›•æÓk€ù¨¼ËrI!1÷}ÇщSfØR³ÌPòm8~l\½P£„_Xøoĺ†õ•¤:/ûôf‘ WÁïù]ø2O¢ )Ô_V­dÁ‹ ˆø„ï%HPW™<‘Ég²Ô3D­•â“³JwîÍ°çȥ·¼|ðt Ó9ýk<4ÇCs¼ì3¢rÊBVÙÑ¥ðÓÅƳÁU=‚K»œ¹Gë˶”3—\7çb®ñ tL²ŒÖìsÙ9GV 9 Åwà4ߢ]r¾¾1ù‡Ǹ[æ¼–„k5ä¦ÝÍÚœ¾3Ò¶•ˆ'÷„ÄûݶðÝèe\³dmRžÐ)K,Ú"`d¥WElW¡ë”•¡B"óš2:¸2¯²H¨2—œ,ŸPQ…, £ c“Žo6—$«ÂM€æ6¥Ãꪀ°!ïçtqï8×Í‚)ãW¦¯»}ÁÛjT±ñ9³w±ÁêÁTÌÒÕaÎ¥¢x”ÄÏTš,A *Y㨺ªU(r!k¡n|»"¦!%v—t«ÔPe,Umn“§ˆ\6"Ke‘ZPhW©ªt²šXÝo¾nÏ›¿?s×­ùáó9:!Økk²€È1’Ío2¢5p„XyQ ÈÚÌç®È!Å^<î᫬]™*½/<-Ïè¹Ì£Œ!zˆOSZÒ9÷0P§².®•—M¼Ý¼ª$;­ZGyÚÐb~3þHgQ€‘V‚ZŽ©,nÑm"ŠN2ËÞ% ̓FËïã]—Ö<¿6ËåºY½[æÄ×V3ðüLiÉ®@2§*¹”ÄkÞXÉ9BŽwe"(ÃÑ”$±ƒr–¥r(R+ sø‚œWÀåQcIÁ¦e N‹„ZpR¤5Héå$  •B¡ê¬Fì– SñÀª¯!´L6[(\Z›‚iƒzf€/Ò¸1FR±òZ–ØsyʽD˳ڕ$äºR—äˆKÎz4\+h'yN*ú¨­`ª\¬s%ô¡ÁPB&O{É?BÃXy~¬.r~.Ku–Ì}§E±/¢%‚ËãNm®Ð^Œœ»–¬åÊ:„@·ªûh£ÕÂ:oó0êýÏÃÿ3M™?Ä$ÉD&OÞßIL@ £ÖL†—‡F³”jxy¥‡ÅçÊ49D­hŸ¨O¬a+S*'I²©âò ùÃ' À“•o²*7Ue¿+j¸kƒeF5±(½‘‡Æ—”ebÜŒ¸ÅoEr[Å_|YÊc…Ð^Ë’ó§ÀµÂmݔ܌H)UxÓn¤Ê8mì6(]Õæi#„PÖƒ’ýÂBôŸ«’„Ayb¤.3¥Ð$Z2Ðñ‡ÜcÿDP¨;0¬a:€3€K(( ‡¢I¥•M[Ô•lXê@‘Iön =Õe!«£ >¸ÐÔ1«`æF2Ïå1ùJ-¨á“+$hFU–‹gE¿ÞLj#Y‚•Í½<¤Y¶û !S…mªÌAáDmTŒµ­x­:Ev ’Ähùò*èW¥ ®ž4˜Â³ö8®ø×ÝíééÅÙ‰wSÀŸ=y²=9>ùtuv!·®œéÕ¦~!ݯ?e2È!“ÏFûäÃÇ\Gg®Mdì/“ôÃïîZÅ‘ô8;?xòäâìl2Ý}+§‘.•¸9j#[:`j¼±tÆçXî*Žþ"7FOFGçß>“_;®m^æ »srt~´÷Iú6†N½ÃÊ1‹ñûí·aàFžŽÚÎ~óÍùÏÓÓ_G?ž¼?9ýõ¤_9?ìNÍ{t&_ÑBÚI¥Ç»RÃÓþü±¶Õ{移gçÓÕ;'ûãöÞ­þÜ7i³$¶~ûìx÷°º©4àìBRYOO¶^OÎÛ;Çñ1içÊnÛ}q‡×äÖ¦6ÚW–³»¦“ÙÅßí¡ð­îú—§G'çãíM)xùàµíõƒ×æí¦…¯/Þ¶mßžœô§‚mË÷˜ædz>ªñÏûÆŸ\ßøãÝ“¾mc®_nÓó+Ût¼ûžŽuÅþ|³ü©†›Qè'&󧽃»ôGÿqå¹Üγ¶{tòîtôè¹ú ¿ovÎøø¬½8ÚïqÎΧûÇgã® çüŸÚ¤­!n çS˶–µu¼Û–=Û¢+çŸûCf/ŸÛÚµLDZîwÒŽŽfÇ{çû?÷•ISÆT´A ‡Æ¶Gý=žN˜øÉôŒBw÷÷fçß :<~6ºðtÔ¶déXÀîTZ9¦¶?µ²ÿ\†Nîù×É°ïûõAþ¾·Çg£gciòæ¨kÞÒðõµnÕ39¯›\éòüLîíôf·ùñyx³óâùnzþæÕßÇ­!_ úyò_“éi‹—ge²Oéesô¾=Wò¾ÆÔÄäÕÞÉÕýõüâøíd:¤Ñ£éÉü\ÑUcÛûpØZÚùôsgKæ)ßuŽ·/Î=‡j×ÓËçõøÑŹç§ç;ô u¹ÉÁ £þ¤;‡{tصà3:šNNÏGG‹ûGŸ'ç¿jl|zÕ㹿x÷n‚I¼™îÌÞN»J½=oûþö3¿íìÁÛó­—“ÉûñÛÖ“æ…¤éT¦¶¿ê­Àç ÿo)¼Ù݉àÂN³“^­¸ž8%U\v? |…NNö'}ðÍ&å:1¸o~=äzô ¡‰íGó&üØ!ú}wѳ17n—bsÏߤíôjs$ m|'²ìËÑêÃRÖªóK]Å=`è“ý­y•]˜ž_4‡õÞ·¿µán¿wÆLÌäéè—o¥“ƒW“=št0în•\¹¶ßoÞ/°¨h8²øqÆÿj€*~€¡íN¨iü‡¹\L¯úCóo0«Ë‘øxwÒÞQÏZ*ühôàúhÛ}³¨¤3Œ…ýÄ…ýtW\²Ÿù}WÛJo ƒXæeó*‡!¿ê˹AlŽ:°})“ðw…\2«³¶¬–]­ÕÐ Îû- £J™aùdýÚõù½~£¼™x-ûòt1;ï{d úx™Ã¶G¿«º&>¾þ8sÿ¸õúãÅÞtòêô´{ýBOÇÿ¬·ýYmü CÒöa.Ǹ軯èQÿ†žô¬¾aàæ&ÝK}î«_{CåÖ§Ëçeß…ßþÔ½…aÒ~c|ºü‹É/“KMl«9“J/ÍÃPú’lËên¸Õö·áL̃§ån±†¶¬Ñ³§#½j×ÎözyÏŠnÞ¯ø¶}ŸÉç—Ó£ãI×x.ï{𭾪¸ÖcvfÈðlë ëºêæõ—m|lkܸlŠrù½5Í0+ÃÙÚë3;$s0Ê9?¡ØæèÓäÀïÍ&—ê‚Í?><Û¿Æ6ìÌv¸è8=Ü/[K7Ò-‚‘|>½jI I‚D+ƒÇÇß>KŸÎNO¤ z8žcàöº¢¾Ä_œLzÑuØQªË¦%¥K-}V_€Òï Iý®%óÝÊ%4oô—{4ò£,ût-ß7Lß¡\q…)-õÇK/¹Ñ|¾`_Cª÷N&§³Ký:û¸Óù³5+z‹Ñ¬¾+æñ¤/b¶1óÏÛ7´,ÙÓ’Å,7å~::ûðy<¯½«n©ü•"¯€°|ó÷—IÞ·tÓH »á’¡Uý¥³U´ß[¤uä_êq}p çú¿ý§4>ìÍö÷ ÖË“|u´Rk¯ÆZ­u°¿E_{‹¾qúFͧ{©¢EcæEÍ?Ô×Ø—¢ë‡§Såq»»Ú¸nÇéè`w²ÿ²}¿Ø¿O>7þÈõ,»é¼ÊuaµhÍõTxsÔãóÐïžéoŽºõµö¯N‚oHáÉ“NŽ¼DÙ „-ÂýÆÖ5K‹/©¸¯ä:!7_Uìú1àÝË/¯í¬É‚ ßbL–¦øv[æÞÒ«ù]—[¾±ôÍ•åµ%„ž—·èÿÏ3£éÑ/|uµÍ¿û] éf‰½®°7Ý•ÕÛCÕÊÞ½oÒ›Ý×o^í<ßž«Ÿ| ™‹“wGHÕÉ_''‡ç?÷:è ““ÏOò˧aÁú@Äí°`-%¾šÈ‹ëŽNçÊõòÍŠ„ê±6¨ßEpÉJˆ¼8Tzà /‚ÿ¤/SØivÂè·Ñ¥é[ä·ìú–·­®\QÏÓÛ×󾮕_ô¦ø[”Ö®0t¾Sïï3Dëî³X’X”ßÝ·ø}mtÿ纎ϛ//±{t6:ň–_!Ù‡¹äÒËûfoÿ{²>‡™¶—ˆÍÅÉÅ }t>ûîšñ™CÔí†Gm\^‡¢èn{e«wÞ¡/ˆƒëGÝzý¸–³±1:ð7w÷xÛY¤ÖˆËðÙE“ºÙ…ÕÚ´²+tef– ß ¶>ˮګìýúχì¶üü© ^Ÿ(cÍÐU›_j×ÃISåØ=]o€ÝwHsâ3b!u<`¤›¹Æ Tˆ?[Š,Ǥð× L}ϵ)bb+ŒcÒ9Aÿ¹Á®…‘·« þÔü#.R&Æ}þµóþ5M‡zÈÐTtÒêpµ2¼ö“at&©hêE]^ FóëÀÛø G`ÔC }Ø->¦3ÍÒlykÃLF<÷ ¢‹ús½Æ¶>ænPŠWl㪜v¿^—Tz ÐŽT%4ÕOñ_.ovC¯§{àHüMí–«šƒ×8³>t9ÛÀôƒUoaZÌ Æ‡² ^˜°=ú|˜­•ÊÔl¶ÖsŽ G› Ð=nµa ¬åÙX¡Óá \EÏ_«°XžK‚­¨á»U¯Õ^uèFL‡ü…›¸ÿ•ŒQ[m$H¥5®£û¡ 7Ôp +÷è<ºéõþ…¯Ùz;Óœ Tîw0¹Y,p€íY`ºtáki®Æ{%åKív€ùr@^½öjC)†~´ž Pj âàøb=_ I3áÔ10DA3­~¼VÍØ]˜àÍk±a=w+/9Í{¸üZ%XìfÜ«»]4-2 ÖM)©vçyºÆììë!œµ2tă0’“2»×ã±5'îÂC¾{÷m$Hù¾%·÷C†JÉÒ½ ¼uˆ8ËjPoX8b/V„¬H«cHeH„x= L1ß÷q5! JD½tÛÃÔýCËÓq¶h)±ad"‹ë¸Cl€ 뉊ëÇî‡ [!üD(#î )AOËF‡Cõºx [Cz¹ÞGôazŠº‹"oû7&ùÞ*ÊŸ¸¡'ïpxQPB÷ä­ç @j:$< ‰ úƒÔÌ•þœ!á —Î~âP—TgÞò W*Ÿžñz‡|nˆ0’€ÏM W­Á“ ¿C º{‰Î õ¯ýpħFC³{¨[;'nºØå-?k‹ˆ)[õ Ú ³³d@¦FS±xþU5 ¨&ÑÊ.v yŸõ,cTžØrx–¢}.¤dQKö1ñíâÔEMZbº;†-¯á­S2vjíæS”ÜÏ¿üý×Ø:ùz?ØQËÂoÒ^c(1×pý Æa÷·óþ;a+šXšT1G$zThl)ƒq;Ô•‰Û–üžq©Œåô—÷P! :Hä2£ÉÆî:@¤€™J<»æ”‹¥7S¡Ãcú•Î‹³šì”ˆðAM"Çäö-bT¹“Û/Ãä6-Â+ÒœlâÌ z¸ÖÞ'r~Û0Î2®+}¨hñx=öÊ14æ‹šCÜ峕gÏak›|ÎØgs¶ÀQS,æ “á°”=0ØžÜMnóÌe¹hxÙo øÛ>^. k…ׯÏèVœÑ‡šÁ-?ÂRüÅ]˜ù\¬9ñ*¾€Þ –¢óñt ¢ÂwÈ|ä}H@¶•/ M= ò5åO?¡tN;õÚl…ùî;âJ¬pmîñ!B¸£#B3ç]ÎÊæs ƒExr ÃQ˜°m•~R]ê´vCE}¤\4\¯¥4=]Îâe`Ñ &ÞJ1ø‹µ-Á1À"·ƒ ýäç÷?—âI¸o#±kþapuzpy:Äš¸^‚ò³œÝŒUnM#PÒ¹âï`Þ0Ïæ'î±ý¯¼‘MÓZ'ù~Û\@Í_þpO:®m6ô¡¶ˆ©äC$m2(~M~SF£/óáĘ)“ÙP™ió™6ÖGpad¾l*ð:–ïÄC¤Ÿ9Å$£QŒq®Žèl„ô‹þ›àN'/î7KÑÁ^ß 0õ\{k ±—ìûÝ÷~?\{JŸë–ô׃ì#®!:QñzÐÓÉÞ°ß¡}ÔSý£žj ÿ´A³ ñÓI†z!¯È„ðPKŒ=êH® I-ecp.cppÍkSã8òsò+ÄnmJv¶®*!lñš9®„Û­™­-ÊqÐŒc{mbfæ¿_·Z²eÇ°÷¨ýÄ–úÝ­î–”&ü¸ëÇ1Ûf‰TJ„Ì ',<_L˜ ™º,žé³I4ó`dœ±_…d'žl6¿—¡Ì'‚}û÷ÝûïpdNÄ”_Þ\‡·gçÃË뛑 ‹<¶ðÒ°<Žo”d†d܉qâ¡À0~qx~:ŸÞ¾?»àÇI«h8l7›‡—Î/ÿ5º­5Så)ÐE† ;=özÃH†ŠÝDçQ¨î¢™H2îGaªØy4™^r†¹Ÿ DkÍ’£Iµ,¿4‰Pó$dPI•±ŸÙõH>KºÇQø uòawÑî°ÊPÖn÷›ßš«å|—D³ÿ«¤—sµ$*Y Ÿ^œ4›š|ñœ;kÇ;lEŠ„\k_‹8)G¡PN’µZlcé½Pï¤&¼Ý=KWAóv»ÙÒÙí‡*éâ´â¡xd+±*ôáQÛzž=ÐÉylÀ›ˆ Ólü<ØÁ¾5"HÀG±H<%œ¦È {4ŸNE"&7‰¦Ó(™sŒ¨Øc…‚Z5bsÚ²G§×#ñÇ\„¾8~4 KÅ8 ìñŽæO1kp€‚ mÖ€Óêìì°ô³ŒY£€^¬Ä„¼»pÝÓpr-<ÿ^Lr”)qDþg ŽÆ›‡©¼ uBRlÎSÎyI5R‰ ïˆ;¢u œ±*r;iêÝ `ÊÉ ‘œPÌŸœ^Ÿ†Hé9ÛÒrB#:ú˜d“¾4¾Â¾9Þ ö]§í[«•^f¤•6­çR°™a –f›BÓŸèI0ž|·Š¹ƒÿ¡£‹ä½©‹e­$¼Ã–¬´¤Dà¨òLÁÒ cˆ*ÌçÐã_Nt³Ó°Cøƒ›¨=0{!îÀ–€‹ƒ0¶›ÙqÍìx_W(ô·–ˆ ˜.L✿ÝZö³µ÷7øã§ýCŒa”J"¼Do¯†Þ/"‘Ól˜È™àÚ8TÙLð TÕÖ„ =WLj4¡ÍgÒk-VÇE‡µ2ýÕpµ±kö†_¿‚ô|c±d¼…1l¶4“íÇ€ƒsœóŦé tO°mfh±j(B¡x5òKïW+K ò¼*œR9¬ߨ…Ïk¹^ÿk0ÈÌ;wj©„¦¿‚ý3’¨™Ì`Ònú«ûõ=Ÿ¶ÜÑß°ƒ$~…ûá_‹)žn@¡†`›tJâž"ÙmëbYpÅË‘·¸®«R¡ägYÆ*„ÚäxX·dßö›ê^¦ˆ´¶þdÜê¹ØÈ÷ÀËy8Õïòt÷Ùi}mK˜ˆ°MÇò¹{$Õq4×¥`À~Â,f;£÷I4÷mžéFr¨^(¢yš‹Ð"‚ú`©õ¹…)ß46Häµ±Œ­¬„¥Ó´Z*Žu6 +­½¯fS,â#êïJ} kcTv ¯»pÆpáÇPO´×;úPB¯ég–*¶“ˆã\>#Õ*Ÿ+\ú'Â!äµBÃ\©¾í¶Ê½ãà 6\Jw]æ¶Cӧΰò/äRÌ;{z““–K7KÜíŽÞàèkM”¶ÿü²`c/ièWN¢ÇQåÚ|> Á•?ëëþäAp×. ÷ù1J&?î0âvN¤/Òµ01›"eÐ#À~%C+0©TfZmó›y¿\ç4Œ>soý¿}p©â°Ž‚*·PwA¤$¼!ë„r‹SôµI$ºÞØÞ5XE ?Ê€Ðá´{9ÌNªp¡}Â[÷Z'P7j÷=y =Áz¶;ÕÄËÞÚÚrZÙû7$6…<Æâ<Á01o:Å¿\ù˜D† TÚ¬îbÝÄU4d<³¯­™¡M.JçF¢krwÝ¢Žz-ðÔ…UûQ$‘.*¤p>Y9É BÐa%²Nñ^{bµ|ñ¯Å3¼þ„ Æcn¢Ä@< '§&Bö͵¥©å˜@Á^p쥾7ý—3¤ Ž5]QY)毾b~BÒŸökQ`ÂÉ/Õæ»…8`RºLà·O¿ÿÞ·I § ÎÒ"ÊrtWÕüá¤rXñZž/W€.ŒÀf¯I‹ÑMIÖ㯸  9“r¬ÄÏ ‡"TmPÜüBx9:»9ûå´ÃÞtØr:Eì&»ÔõÐ}¦åân¡¡Ý3Í])šòC®Ò¨=í¢Ó™jKo ^ÙÙïV/B–Aöþ:m¬éìkºH‚®·Amc‹š/M\áÄ^ù?–iy;c÷2õ‡DÿJSÓ;ÊŸ]¿_ÊióßPK=ˆS‹ô4ecp.hµXYoÛ8~¶~Û^)M´ûÛ)ÇɈSmØ'ƒ–ÆŽ‰T)ʱ7Íß!iêò‘îõÐVÎ|s‡=Šæ,„9Þýá?|õýéhèOsŽ1h’£ˆqyŸðŠH>vßW¨ x’Ö©YB…L¥¨SÓ|ökEsn“ѽ?Ž¦£ëñ­;ëTrß÷çôôÅq”Ê( 1æb Äç“N&EÈÒÆË›‚všÃ§e¿]œ‘(&#¹vQ<òòZ98Ë$3 ¤½:! ÊÚsZ­ ÆœÆx'då®ðïµ»Ö€NkÆyLx ‚J.úý °ÕCÚÒ3Ȉö"@æ‚ׂ’v›ÈŽýå‘?ˆû®zø®ʲ9‰ l{&=•%´Æùoô,y’ËÑÝH#Ri¼îÚ&}Ïi¼Éê¦u}›¶Íïß ™V…Þ&c;¤ö«ÒÊ ^2ký† gW4“‹Ø¡¡†¨š75äAþ3“/9¶Ý~‹ åÇ?“<–Q¯÷(*:à©)>¤Y@Cø›(Ÿšl³|.5étßG ¢S<Ï =Fü;)YtF3hâÃ*å 3‰Ì9Ë¢ÃnQÜ}ÈsV­Öð¬4³¡Óß¾¡Áh<é;¥¿½øÍHíæç=åP±aw–”)ˆÁÇh—7Í7G!•Pvœ{‡É“Û<™¸fîAÒlÑc Kˆû¿6Êþˆh¾®.[Õè´j8¦³CÍvý îf~'jZgÈdõ–«ŸÈu?[Æ/ŸÎ>{Ç× ÍÄõ:ºÚÌ拵„` ùèê„àh2™Á&Ñœ¤ÚN== ÕjJ1.ÉRʼn¸!‡Œý"IðÁ“’ÉYÉìm"p©g­‰@™Éýƒë„dèõT”5‚¹Ê„u†.aW‚·Hw”‰±Ú%ج»F  òëgQmƒàµVõø'f}ãzø/Mª-%º.›¼Riø91¸©¯Êv@ÚÆÂq¹*4¤ŠB ¶q…8$p±C`Ö=¸^c‡?fÛ-V1½ß'ÈÒ©PpyECìúÔ”YIÑJq£\âŒÁ•0ˆ9£xOMñ%ÓÓ(ç•m ÓYsõ„ô$—Jn“¸dz÷ö.|y3½ŠV^àÕà›'Un6¿q’Æje=;³ëñ8zÉ­cÔå ˆ‰>’žYœΉùu9»ŠcÀÓÚAÑÛ'ªTž—øÛvíZÆ•bûÐÏ ®‡»á6s ¹]h²½»ŒÍœá•cfëËçŽ;ÓïTžOê…Qzà&S>žWú¬ö;+½%`X«7Uw˪¯¹üŸÌRȇí2Ú0Û½—”1éÜô±¦íšTÃ]ÌÍ áíÉY™ ÊÐÆàUûûks¶¾m§kÖe¡Í¨iÌi%±<±¯°Wób`œ}Œ>G# ¡ÝAêZ­¿ôð¾}Á„)èŽz×IýÚRïNtIzêm§¾Šh1ã.¡sZEô5– µQ°3ÔV¸>Ëp%ÈÍ Ó}©MÞ v=¢Êÿ—Ý^:ΰ0š;PKŒ=Œ ÀÒN elgamal.cppUŽÁjÃ0 †ÏóSˆîâÀÖÒö¸SטÐÃLØ;Ç6‹À•M¢l„±wŸS¶‘€Nßÿé—6ðáÝ\LXÛ”à>;dö†¤`¬w€ÜzHCЂ‹“I3›G( q‹dÃà<¬’m×íjþÊÐô´Ôä±'*ôáI½Ô‡£:?ªê¤å±Ǻ.„øˆè@…jª<¿úžOÔ³!Fé—…ø7¿¹"{]쀳¸•Û;˜¦xø7J?7vR!<ëJYÛígâ²j/¯zοçÏ*]ŠPK=¹=Ù)ˆ elgamal.hÍXmo£Fþl~Å^"E8!¹äª“*¿IŽCœ(~A±{ÒétB6Îö`A°¤q£ü÷Î. ,»¾V•š–=;óÌÌ3/,9&OÔÃOhôøÕZÎ-Ë6'ãát8±ï´cŠ›Ž´cB]?õ0: B¿F‘{ñ|¤H½Äám6œš k82íks|?ÓGñ&b¡eµ5Íõ$)ÁgsûËrx=1‘éÀñ¯£ŠÒ•O\t3±ðf¸Ž10eCÆ„=öÍ]ïž2¼Æ±fá(|r\ÆÓÔg$C‡‘ ¤µø_ìÇäEœh9TƒÁb˜ÅÄ5©Ë“PÍ´7-Sìh­—xH@cÝ i¸ñ8ÓÈrb pœnÐɺ8I ´Ú0ŒN=aìA„JÈŸØfHŠ&˜®Ù³2\ ‚NΊgú‚™­S=ÃAìø–QÀf*3ç‹ã§ØrHœ ¯ $ ¨éi­7 £âäH€ºëj¨•Û]­õ®i-ÿ³‚?PÎttyù¡Küʤ©ê5Æ,)·¯Q¨·/@8 ½ÔOùk n¦”é{\p³ÂÕ!¤4!kŠ=D(C>¦¨ÿÓÑ´ÈÒk>POàL×":‹k(Á³v›·¡$~s0ì'X‘^n¥»Sj¹‚ˆÿ8ãºÔïs85¥Åòf [áÓçÏ¿üìü—öžÅhÕçPt¨³4XáxŒ)t:Ì?:‰é:ïól¬~”Ÿ ŠŠcV«Q>e"»&'*x©0Y›Äè&»õ ÙÉD"ª º ìrѵº?Њê¥Åù•À..$5™¢. ûüÓy} ¸e€7Údêgû´ ¤ÐÙ„$ ¾©ß!3ܮ鋼›‘'öÊÛÕ%‹º(c Ó6r~rº‚Ó¨/+µŒ €l® J„®qÏŽ²Í@.Úlo+©Ð;FÌØîºÿ]/5N퇾ʖ2–UÆ$D`v•pG!ÊJÖk|qO_ ; ‰é‘¨©ðä•U8½ÚNº¾yû¥äÛå÷]ûyðw«T‰o?+( úè×›Æ¥­AS,F³ÔñÑ®û†=¾µÐIc¿H›>ìØw •á|@Ÿö²ëÙõpaB£Šï‹Ñ95í¹µ¼ŸÏ¹ôÁü:w9yq›¯~Ç.» Êõ­ó›]/C®cr4#7R.‚ê KØ-yŨ^—<¥7I!{&Éù AQl] Úíî{ÕǶJ£‡-µKŽ¤µþyQªø W§l·,º +LŸÅ’/±CŸ•ê„ÖÖV±”Zoe ð E±ÜÁžÒð"î(tö: Y—}åÞŒ2:¶u¶Ø;åôñšªØûîþxƒÒèû^2è};ðéLXœº,Ÿ ˆ0¹h±M„ù+øÎ^¯øï®N§Ö'¨ö»[1¶D¶¬¹±=÷½Û0Ök.u¨ü^ÃËß7€ËU-ÿš-¤?äù"\Ð…—¿Ô ?€2DCzž0èl'öPäx|jT5Ò´s˜ô¤¦¡²kðçGù1@þ ¿ 6UV2÷Ù‰Ñ)ZYQQþ|‡ªæõ<2ý5LJÚÌâ8;³² ÄçqV|RJNõ*æ!AÖƒ-û Fœ/¾^q‰ç·„:þR®üÞÖúæ•* ÄÒ._+Ñõ`•zPÑ£Üÿ&ÆâçbTZx€ ù”HNI¥)Ym)—9I‘‚®üKÄœÝhÚ1¦yÒþPK=¨Ž•%@´ emsa2.cpp•”aoÚ0†?Ç¿âÆ´Š´)´¬Ú*›ZÊ:ÔA#@š¦iBN|!Ö;³:6í¿ï ´£tHÛ§(ïÙï=ïÙr³ ˜[ÞjÄEÇpg¤s¨€+EÆc ¸¡(£LÆ tÎI‰–ð%\qÉØs©â¬µ"NimK¨¬I"-Qè?…ÓÛ0œ †áíx:alt1ìO‹^vÙ¿Œê=³,œCŸ±…–úÃÉE+ä¢Ýîé¼(ÑZ>Ç1-*Ç\`}LÈ:•y„æî´£æ0/ÖÊ:¢v‡c½ z”Ý[`åœ9xZú€jîÒ€yï¹M§†+›h“SK­à %-€Ue D& ¤~ˆ´Î ¯Üúyá–dv²` b[¾”®bða‚ýd·«ïYoº0”jü÷jý1_ÃRd%‚5vãJÎѺ qÔ}ßï0æÉööyç𬠯}æy.5ú›ÙDÎw¥ÁIœbŽíö@-x&Å .7µõ‰¶«ƒ¥´ßJIöÀá+.!«¬]ÊÈ•˜—™“E† 8¯­™6s°Ð}ŠßyX·ƒO£ßðw²Ø©^Iv_ÊuÇǵÏ'_hïö‘Â[8ù~A›>¯"jÓÍÇÝ:: ¨EÁ^¤ã?™ŽÏüŽ×lBÁÜI¢]í¼¿9P<ñƒ‡é´†Õ1Ý‘™ˆøš¹3s}ϹÁ½ûy2oŽìÒóZ„–f 5 î„j ã!ƒ]°cªãID^H¡û–4´¡À`µÕ‰<_ƒã“îß’£Ã¦R>åÜV©°°Ã T(ÀL¾æL$Òx!ÆÿƒÓG†eUÂ1P€š-‹ØÁŠ™\‰7¸æy-‚»ñðö–Gèµ–ò ÿ0ögóÐíÖÃ… Xa–0_OCáüÀÏ&fh‰$‘?¬Iv±0´B”?vzƒr¼˜xîì¡wýñÍBÿf°G÷¯®k³Ë›OµÙU¯_;Æ\%™”IÚG0ªF³€\Cµù«Å^ç8 –îÌ›:K7M߯G}gõw®®ßGÀ¤¼€yCBUDÝî eÖê‡,F{OÙýÎû<0ÃTʦ—‡>ߊFc3¦5Ý0W„Ò6‹3±Œ†­¸0¦ ÚûûoþàTídNSÖlÁKiäÓ˜ÓºÏâ?Y``ÆÅ‚eŠiô7rŸÙ=7S&6&n–ˆø°”v{(7#¾aº$´ a¶ÊÊ oÚõ}ø—=¼œ4ž%`$Ó,7UÔ‡"š *"™ÎótÅÔg&˜¢[湛൞ÓV,”ÏX%ÕY¯êŽ·Jùx„ý&KE…Æ^œâ¥RÀ¹ µó¶/Æß– ¤å·J3³µ§URêAÔdü1Áe¾ªVqRx¥³{rÍŠÖ°øŠfÄdÀÂw°òñÁ9G‘lß4 «Ö¹m$¨b ó,“Ê6™•Eãã¤+«í@Ušê{„¯Uõ\°TÓþEŒ«ú‰gÿë^Ëq˜ô |ÀÊ&ìõ.¯/‹§r_¯v÷K hð†ÙfÌö˜×úùwQ)Û?eîüTÅùPKŽ=ÁM‹è eprecomp.cppÅWmoâFþ ¿br•- ô[B¨ÂËEH‚UUUZìV5kßîÂõî¿wÖ^ð• ¹\[‰«™ggŸ™yÖ\\F½pÕ½(‚sØH®5 `‡(`úÀè%BÏî®í̶ðrè1^.ÿÄ…Ä>»È[Ö—ïÌÎ\ø8‡îãï£ÉÃh4Ü'ã}ßü` Øí2%„áí}<ºíö§þÝ`ètå6Òáhä–ËW”™FhyS &mX‡Ü‡Þ‡é{þŒ~‡)¥Ø±fš‡b@­IûêjŒÚX/J›€;ÆÑ¡s«à …nCea¬5H½í6TøtFnù¯ri•,áÏúÑï†bRr\øÅZÒ]=Ž†+HW×år‰ÏÁI¡T.§·ùù3œ9þ Xó—O®[.ÑÑ¥,@¢âŸÐi¸×»Mrƒ,†¶¿Ø3Ždéæ”eõåMDçÛ¯å:Š/DÒuVì¹ÿu¸VƒÒ¡d‹´”1›ó—áB. !Öhý¡u³‡éfÔgÖ64rn7\øáfL`ĉ³ ªZçó†{a—)ïø…‚®ÒIi ”ÄD¸AÙtö][’B³K‘uJpv7¾i\oeǯVݽZó§¼ïP',;n}ì±€Éû8Ð< ¶Nî|ÞxªÁaºî[«ý!dþ+ë܉çs”èO$Š®»Jü 2ÓIQ;ýÇ1~ŒQxØ# %(üè•ØÙ„Òÿ¹ ¶¯ïÔëWKY+ui;TËk0NúwýÇ4ègy¨ç8&.µôAÑën Mívë]A½™t’T—<@pίÞþ#2o‰þþÈ©z«%-½?í|æYXÒ’d ˜éÕ³¢NT*pÊXÈÐCœÏ‹‚6ùÝ£RÔ_”¦ó掳5þ¸ŽHØôEo×}Qì 2¦›ÿÜTñÒÅEÖ _?Ί_ÂK3„‡2“ÏbJo±W¹ìæôß`š¶#&±Ë”Çü“9çS˺ÒþÕÕ=Ò––9åVø}ËÊÎp–½ƒVÙhËúí•'õ¸)-™—J%iKœ<.E2œ!Ê]¦[3hâk†Ì™ÒC\†²Vd>PïÉšNÂÁ¼¶“™ÐÙ붢ΓJÉDHèõ!ð@áé‡ì`k„0^ŠîцŸœÒí:gúû¾â¾Õ½'ÎÎaR²-„s …1)³6Êrú MY±À‹Íe}HˆHx£7å Ÿ-†×Â@ÛìÍüå)“—DKñµ¬ß¡@ÉmŸîrâ§Ðà×g¸à®ÑHÓ·jEjûrµl?¾h5:¿”#I#Q>¼æQœæÿQý—ò¶ôA…2'¹Sf×›z$!­“CÛNrqÓ)G› ª@.õïí@û²gó?nÖÝÿÆþ°G7ÉÆçå¿PK=rK„áî/ eprecomp.hÕV]oÚ0}Ž…×J¤‰V{„®S€¬‹DiÙC5M‘‰o¨¥Ä‰l'mWõ¿Ïù‚@ŽVÚ‘¯ï9÷^û|ÊN!ÀÃé­ãÞ8Žg9SkxsíxßЩ0[cè”q?L)àÆ,@tïN‹$\À\µÅ‹ |‹K„&æµ5sÌ¡å ¬+{ÒŠÇDÅŽÓAHA”„DéÝ~H¤Äî%*?FcïJÄiâðã(IQ,æè %éü%lruE¬vӲߵ!"ïèzàDUpÞ>ºOÔã.ÕÌz€;øÃÈŸ2yË ª¨ ó‰^d“ 4ñØ3ór°Ö*á¤eÄròfþ!:r•ÚÜéÜ @”¬7êÞ5<bäê’¼OŸ/=s²•>øѶE,ñ¸³ ’ÔõÁ[ñŠÒn§£7!›p1 ÈÑ3r?Â{ƒ˜P«‡F>gi²5jGÊïÌ á6éW kÎéH¤›]…¾£SŒ†pê=ü9z¼&·ýÇÉÇÿ {ƒûá¤?||øÓº ÜÈ‹Ô×ØF&÷×a ˜ÐÈ]z?âÍ?ÊÀOÜ0˜؈r ~VA$fnoÆ»cXÊ‘Ã4~ôñ›¡Ÿœúü—8c ž™Ô\&¾Yó¯†~±ÛLÑ1^ÃáÇÆù ƒn¶ÏêmÐX™ Z òãP¬ÝeœµF^Î&ýE  30c¢ç3bå7¾ íst¨^È`…¦ãÅîÊy䃧­Z™/ˆ ™ƒeÁMw ÕqEtåSÏ«nøOrF~¹$§ß²éÎV~ž2âòg®Û‹³xS¼ù—™cŒW>C·pÃf4ò`‹Ýˆ?%iÆ:kÛl“?Þ Ò¤ïaÉ Òä'½ R“O7D¼bN$Y ÂùSï_§dÈ'*ƒH¸¨Gk.æØK)FèLCö%÷!¢À6âÐH1E@áÑ0„Ó€Åy"àýÀ1¥¬Zéa(^o4ëJI7FŽiS˜kÞ æÆÌAŽkz2ij[s|.FàÓÔOíÓs›\\ìœíÉÙñ{LÉ{‚tìtFÁŠÉö®œ}ܹ®7°§ó· UÞØK¨LO,£Á½àCÙðB×ø»ÁKþnbbÍN< îúÛCÞ «6ë{ëŽ.lš’aèY[bÓ¼Úä9«>ópc踖SÓœ²9Øðí $•Q¤?ÒµfÔSP®·ûnÝáäþúˆX¬A,bô4i2Âæ^R2Ù§øS…w7ÿX™/®LÌ. c‘m›6óÿ…ÚJ .>Ô/Õ Œñ–9+ÛêU »l_L’“ –Ô·¿—x˜Ðc@V°LçÊun²†¹¼ÜKÆ_¾Vo¾§ƒ¸Ï`¶è…tF/览ákÄe)1{+éËKMÿþ½Ø™Þ¼B _#.K‰¯9 Í¥>èQω¼mBи†W±7´£)Ÿª•”;\æ"b9#´ó¡ž#Èyi y€6Èêþ·P¡Ä—N6·àãk´ÍÂÿe2ÀtÆóÒ N•¦ äf$H¬ä»ã‹Ì/ÈBÃz!ÇÆþ"nø+Ûn A€“Yµb€t»'¦ÿU«9 t  =‚®¼{·:E†Êª…mÄ?q`„?«‡nÃYž¶x[6Œ%£@qÍŸÓ¼n:7*»¦¬1 -˜Bjíœ51¹‚,z ~–Æ”ÐØŠ¯,~ÏËáà#¡Ðèzˆ‡•ä=ÀxR¯V"…ýÎ*¤ÃùÅ”èH£·k3PQÃ'ã|&\/O•)UQ_RêK•¦TZD2<Ñ[[z«ˆ®S².¢ª”ª2jýd;ŠåFÀÒÛ÷c'Ü2åFK,X4ˆ%p˜À)[:æhX–hXîjX–k÷‹&üíʇ¸‹2&ààÝÂKT`G®DÆJľd»@Ò|{ÚŒ°ôÆ®2ˆ·íŽeÆQ6ø¿2âý¼O;{_ýÀ/Æ­7qµw?”:æ{> ú¶/¦Œ¿jJöIÓêßPKŽ=óÚn:Þesign.hÝW[oÛ6~–~ÅiŠ²¡&M‹ ƒð-©ÑÚb£Ã° #Ñ6‰TH*­[ä¿ï”lË—´ÛËžLžû÷‰|Éæ<¡sèÝþM‹¢Ù`2¼ÏÞû/QÊ8ÝßðÏ›MøkÎRê{Ó%S`– ® ã â”(Eè%ÑÀ²<¥åÿ¢º5Š-8Ñ…¤ â%î* œ·‡á`0€èâí/oÉ™ß<÷ý—ŒÇi‘P8É‹»{º:[žlÉ×tAe]H7Ü &Q§7˜u7ÃqГ«\‹(j`ç/`æÛpÁv]ðX3Á¡è'e1L%É!dµVÉø™M%#éedw>ÐÕ•ÿÍ÷ô*§¦¬uæ\=ã°íûÎRË÷K`È™F+ì+ °’J£Àf§ètGB¾ç}ËfÞoC6£¸ í'ß÷ÎÏaGi¹;¸íÓX$4èó9•4Á¬¸š ™Ôén´KåþàvÀ¿§ìâi;wõ*øÞ)|ÂL·„'"Ù•7”SI´À $_„Pp3¶åRúHÓµegå†êO+ªªÄK"¡ÉIF«ª(´Z¦Ú3ÆçNöÿ‡`3jæöüÆ´•v”ñ}-EV£I«&œ*QȘ6Ê$wçÀ÷ªftò<]UâÝÖ}Ùx­d‘¤,# ÚO‚r¾IŠxàØJŽm\+k–*­V$>Sù&ÀZ}j¸à¯ìÈ#M|o'*SבHŠ´PÇ8pÂÕàK.8ÂùÀA7€¶º“ƒÝanÀzpŸ6Ú;Æ÷æÝZy.…¦±¦ b§6C®ûu™îa1êó·¯.lœ•qÜmðþS»N CþH¥fw)=B5ñšÜÄ#Ž“Ý¡±]kFØĈAêasû/QÇž$ß“<¦\ä¸ÈÍâ¦8j k ¤Ír—ܯ9h+Äf„ÌMöNÙ€Jeê üÎô+71&íÙmõÍ$þ—äW¬GÒ¸Hב™Ö—­~6Ù£\a«Zj›9ø¿3¬wÞ|9‘¸)ª%y˜æ6/Îb}~ ¶»Iº°„^«¼#7É2zq€;ò=6Üè¿9 ÿP#ÁÒì.â,9,=í(¿ öÀh”+¼Õ¸oCayh]oQ˜¦xñ2¼td6½ª.:£Iççˆ$‹>Ìú¦ðãLiOªÛÙˆ*…ß Æ#ª—"AªZ³Ò8 1lÏÍÄŠ:éBHhf:€Uªêsb½Ÿ˜¬Ë¼{"Ë ]¹º¥¹¤ ¿häñùÑFFp~ïV˜eS"ÈráRÚ ñšù•Î4ìo}¤|¡—!šxOÔrãK”…`v† †Âæ k¼¬ý Á¢'+ ”åze¬U¡l'±ƶiÊEQŽïá'À›Ð¸‹6º©ˆï!a ªt`<ŸõíÚ’]à ƳÒkÆI8=+=ì -:_8D†§ÂˆTp,"ci ÙbnøsV¯Ã“Q÷«ÐnžÇ¼†e&Õi„0'©²ø÷ØŽE?Á¯ðâ¼6߯®ôçë¿1¥À”½Ñ“"ö¶CxƬqý´ÆŒM '¬P>ãøº/¼¯´,bí$3«¶Ï,8ø2Õt¨žíZA¿„×\k@Öɵ‚βðº8üb@‚ÚeÖJ6zpcÛàQÕäE˜E,<{o™ËR™>®öÙ‹ØK‰c·9/ÊxNO±4 …bBk§åBׄš°E£h½Ù Œ&<ü0šq&‘ƒ (,i¨¿ñÚr™Â ›Â×Kìl¦dlkõ•Åµû¦ñÖ'ëjˆóJéÛ T nðù MÝz6MyŠI‘¦5¥>§Ð·)SpÖ2«©k#:Çxzªl8ñŠ§µ‚qíº%h yôg1Ât …0ur‘J|sšpA–¦„I-Ìœ¶ú’Äñ\I¬Ð¡'j4‚s÷ÈZŒ·^»|¶If…¨+«>hÙSm˜Àj‡µ¢bÙ]ê3‘ôŽŸ¸çY„ŸHhÎxºÔ•ö¥Ÿ¢oš`ܲ/í“óµ$¢i\UPïcIbŒÄM˜qÃ,æÁG<÷¶ùK¹ÆÍW•½âGíF¶Ò¿W#Çë-Ïœ¢b«¸Ì¹äÀ3‰‰¯îW ô¸Š!ìïW<>ç÷±\åN«&sƒ`áÏç-(Û†¦B3$±B½ ô4Œ5ÜãÖ& våÙ àðîn.o:8±Ì3œ-ç°Zø~‚ÝC†( ì ú˜ ª£üÕ…½|ŽóEåy.ô &¯&áQäi³óˆVé±ÙW¤ ugÏ(£¤rö“Ä©h X7-ÌÈš#DÔZ¡ Â#=àÕšiε¢†§+ôÚH÷… ©T Ì³XÉ500O°Ï‚Öºe­Úñià yZ®}W.¨ðZýjW+ê°á_)È5øè±t9«‚‹9ö â·­ ŸÇ`#ðe°pÛíö‹8¸I¤®-»ƒ§ Sw#åÛÝO7 Ø‹Ùgò‘&®m¿ø]ã}±¸r+ôíL55›s±£h*× ¦^á\/.?"œ=*ÐXáMKR©ÆCöˆ{\x–γ%Úäî•ÚÃÒÿD—ÙÒ Ø¼ò) $$áÞ6Ç›—è¥Ê4e{ê kp7¦j–Ë&.¢¸jãX¾~Ýü¯–7zXøN»eÙk—KóúÛ.¸ïº^òÿÅz©úî“ùˆþbÁ¿hÙüKª½bõÔ³ÜËêñ.ÎÄÂÕ—˜“æë׬WV¥Ä^ÁÕ®A`µ`\‚2ÙÄjEŒ´T¯»cF.ù?¤T’ÍØv¾¡X›…3݉-ƒj¢ƒÊLøÌ&„´8žÏ%š¨¦Ð%Ÿ“šƒÿ“í6h„ªuÃ""Ï%|£w õ§ˆwµ9åêê=ÎËG[ 0Ö”Ò`j~$=Ý`ˆC26¨Íæ®~Î%®[­í^ÝAtöH -¹bÖ‚V¹ÞÙ›|Ñ)}éÕd¡þ¶X›Ù¡üx0ºtòTûPKË=WîT´®files.hÝXKOãH>Ç¿¢$ä°fv´§@B0)/%¡ï°eL'Œç' T£óÐ^ºÝæ—6¬ˆ”y|ôÈ"Û|Æø‰qmÜuú½k­ °2ÐD`{̇—É7Æè$ß“0Á:`2†£¨(«2£³1•n¤ä™Év> 0µº(N׫Ž‹Œ[•1¦#%h°.£:s±–ôµöpæÎ šÄ'§–—·ÇˆH¤·Ï1|å IÏ·Ęœýr¾:*Ô"¢zø–@X׈‰?§[/s¸Ï~ogÊA8û] hjЮª:&Joª]‡¤ÐŠ \ßí†] ¬€°Ññ…³âŠ’YÔ Ãü ÛJÁú¾ð;Ûÿ»]Êq"¦Í~¶“[ÇÍ*ÃEjLWè5¦ýŠóh5]éWÌØÆ4Ü/kï—hòÉÊ>°02þ¸,j®ñô¯ÏèÝÎíy.Ó©óÚöü€,t·9ùµ½Si¦cÛúŒ\¯nÏú>õPä°-•îpíXèúößZãú‰Ú ¨úQµžWðôE“½Sùk@g8~¤+ø çþŸHî ·¢¹†@bï…=Ý·XºÏê˜-{ø·úçŒß¬ƒŒÒ¦Åö7èÉDMk»c“ u¸ÿb®æûbnÍU˜ÄS;%aÀÍqSfe~¹ÈŠ‹¬Ø\duÛ–ÿúpz—VÑÿPK‹=ÛOÊÄî„ filters.cppÕ=ksÛ8’Ÿ¥_ñT¹([rlïÝÞž_SŠ-'®µeeÏ㶦T4Y¼P¤†¤âx³þï4Þ HQŠ’ÌnÕN,<îFw£Ñß¼A“0Êqšíó9ê ç4Ìs#?£yäxŒÂåSŒæ‹Ç( Ð8™ù¤äñý‚Ctá‡ÍæaD‹1F[ó`º7Ý¢%“xŒ'èüî·Áýí`0ººÜÞÝõ¶b\Ò^ÎþXà6Ë&Qž†³yd–úéSìÏ°Ùÿd†gIúr¦•Lq‡IìGgÍf¿{Óºç½ÑÛÞ»«¾wž¾Ìód0h5›—€ÎÑû×{»˜LpŠÇ÷©g“$ùÚñóܦ3ç­fãÍFªÀÓêÚ¤&Hâ<Œ¸›{û­æçæk³Y‰ÑûøùOüE”wÜ" ²œ€h¤8_¤1Šñ3ºÁYæ?áÿ¡;®œ´x·F8Až>™½'L>=Eý‡ëk2׆Q›âŒÔ»±mK<‹S˜*ÃwºŠË‘†¦£ÀÏòíœyù4ÌZ³ NècŽ%™/0mQ*A„w·‹ˆîÀ€×¡^ÅNsOÌ‚­€ÂþtÎÇ*Š°Ÿa6Gc†ÎÂâQ.?Oæ/w~ü„ï“ò‰mçdIâ¼¢ç$£íGüÆâŽÇmÆ7”å㣣Œ,éø mS?ŽqÔFI¡Ç( >ò¢À—ÉBçÌ@M ÀÇf£Ê!t× `œ®0Áœwyû’ãl•ÙÕš—ŽØÑ=3KlÂ<ô#2Y!Ø'Jóg?Zà¦Úžû))¡š¸M4}Žæi2÷Ÿ .£J¡S´Odç*K"?Çc ¶‚B…kÀa`g‹¶1  ô‘8ZdSŠ¦~:†ŸÜ\4ÍžÃ<˜R• P&J€Ô€ÑþQTeüÙ@ÚU‚EyJõ+q @5:_ä ÀA[ÇÓıà«‚‰e¸H®à‡8 qÖ‹ÇÞW AaŒú$N“E4–¬.@j¡ímÄèT¨;øB:"î’¶õdNË(k4ÊèrÙî8U §I2'¡ÿaàk…Ã0Ç„dy£0‚i#Þ?ÂñSÎWÂŒQ´Gœ!UzHzÙ »üÕézóшM f¬ø ÕËÀôÉzR+© Ì ¬•Î²u ú'(è4Ö œ¶Š2šüûÑõ[SÓÐ?ºŽ+ˆèJÚ¹ñ´îTs,%CLÒÇ­‚;¦rù Ž¬A5-B’¢îqØ¿jµ]¢òl ~Šp’Äûæ{óí|Éÿ¸ ¸¡JWþŽz±Pâ Ïe‘¦Ä¿åó¯‰ 4åIîGê'oÆèÂk KKX>ÅÙ(¥^hvŸ ?„ó½€øÚ©¾;0PíŽÇÜg¥½Eœ…O1lµ¥ næ<ÉB& ì7U#\X²$ÍûÉ3L–£PQJpú,á(´ïk×9Y5£G?øàQïDK‚n4˜’ßžÕ œl¶ºF9¦Æß°|ÆÜ©¹ð_±f™bæNûjZ~Î$(¹6~ ¬¢ë€˜f¶W2Hx%u1QzË«ëûÞ‹ЪÙð „Z RÄþ Íž§a„©ŸÅëÎÐ>ú׿a>sOÉhDWê6Åfóü…9LVÍ$MètÃ¥[[[*¡“KÒw‘6p \!”@]AŽÛ‡ûÁÃýè¦ûÛÛÞèæöâêòªûöºG7N ²!ñ%[CŸ—èøi¸x$„ ÒbØvcMÄ ´D[g*%x£ág°Îщœ׆dÙî)p´¡8ÖQ%N ©jM%°RZ̘·„¶'Ëh -(ñÀãmä \„x‘Lh@ÿý,«×'u5eŒ44¢ŸZT/h‘d>âp¡þµùÕxCKÕÛCMl¦U¶R¬ 6ÙÈY•Rqìke8‰œÁe¶jÿج6mÔ6T‚,–#HÜö6í^›ÀN¶^ÿbÔ¿Ýô†Ãî»ýY¥½=Ý^Ckë‡5Ðbvlˆ3iU»¾\qTmŸòµÐq¯JT©·¤…> <Ë÷æ,ªÄ¦Ü¯aµEOäæk¹jlv¿„ùT„×®bâE½¥‚(6wáào®íØt‡ ¦xÉÌÿ]2NG·×ÇÏžlŒv´f0[Uuª`BlHU°øj2Öœ‘Kxb@Æ<¡ZS{‡sø©‡Ûa€3€)Pân<ÏS6"÷D ›ÇïžêݘgÀiÁ<0]ýêx7ÄÔ:ÆÈš/OÆe®Ÿ ±‹Nèd¶cËéÙ"®¼ÈFŒXìáRËTq›¶šàï˜R kwF3MæQ’áY0ñ$Jm:½6ZÚn×â®f§öJä´c“{]E¹]íÕ-¹ÛÃGÞEÂ×ÓXLkâ4 ÇÑ´V$Òå ¥:zä¼â#E.rͧ0$˜jzªt`鸨Dù½n0†|‡ÇaŠƒ<ÙLb#K«$$UM©ÊZž ìm‰qI×{è3HDœngÒ Øiq]À©ÿ1LÒÂ@WqõXoyG2Ì ;Žz?÷î~»Õ'·rDóˆÂÜaø=#¬¾NºZkCáþAš|zÑ’óÄÒÈK<–«¢‰Y3îRŒõh ‰RU` ÀW˱>;-`yß-®âYî5˽¡f˜§<¼½º&ÅÁ”vÞchÕ ·LE×Ñp¢À¦Øj$õ #;“Ò@gˆsÎ/G®¹ÔJ‰v f42ýýçX$“ø‹<‘MÁ‰ÖæŒYahÈ<úJBê´™ÒÄ8ß'ËjÂÙ6ÚHƒuÓ J‹gºú®%ÔÈfˆTŽg%ÖKƒ¢º)ìÇãdÖ‡ =1ÖÑ™Êðÿ± Šo<¥DZC=h”½Ã1N}b ”:žR+Á¿ˆïÆŽ°a0ªYƒ$'Ò0'úôÅ<Ö®ìë˜uÓÔÙ0JÜE[Lvù/±+š/ÈËÖA‚3ÍDä‹@Ï¿HÂÆÑ¢þælÙ„ôÙž§˜ÐŠºs?'½Û,†dÑ“åèsÈœ` 5jiã®+¨t§`¤l"Ÿþäjï‡ûàQ"”Ù êÑB·VE4Xa‹fa–QWK‡A°–<Lç|Ê Št<ý¼ŒUÈs#ÁªS‡þšlzu|JR‚Þ7¶/WrÄÁÅþÌô/¤i,­ó\Uh;¨ã±´Y`xàÇ”ÁÏ0ñá'¬EÉsw‘OIó0 2<|™‘KÃà<œO©ÑE•û=†{ _ÐË ô½G°wÆtSûVžCµä!·³òŒýJuð‹V!ÝÓ–"N×ñKìÏ€¥üT6Þ9󶃖ˆ†—-¢ ¢9´ ÿ7FêŽ *[ÂX£Å¶Zب [Äw(ÿ–ª$㪢(Tap10Ói«DÔdQ¹T–Jœ4#%ß×ri]MŽÙ.qé [È‚ ö®²Ë$}&~jáŽ'©çQn÷oGƒîÅÙùXÿÛ»»Š:3ÇÈÇvF‹+©"jÓÄå{PaæŠÛ›íâIó¶ RTÊ­å›×*éºè]v®ï%ýh.U7!‹~ðEI LaTòS5r«©$î§ À—Us3ù þ~.¹MÔ ÅY½;ÿKj#AÙÓZŸšÐá W«¼í÷FÝþÅÈ”¸5µ1Õ4Nè(ðã8!vôÕ=¶¢-pr8¥»ÑS’’Òå2׻ꀎ%Ìè±£J>’¶2žŠLŠŽmE”V½µ#ƒ¯®Hw£¢Vg~Äl–ê-¯4u÷1.R´¨ÑýÕs4m—DÑÿcÿ¿ÿú@§XèѪ9Ûuà ž*íF]UR×ræ5ãÄŽB¯ÂdŽe‚aFpÒè=Žæ–W¾SvH©ó÷Ý~¿wMæ£Ò]Å‹+™HpfNÔع­ïh&zÍ–‚‡Œç°Öeç"p–ÁrÙµ”qÞE¥jË‘È®< ^-c”äqdJUÜ µöß €$Jñ%²O^]ÛÕd¯ffƒH vMܾlH±¯;gGß:Ø‹Ó”º+Æ`–šÚÐ/@KFÞ~Væ∗êöH‰­Š˜93Ë°‹Òå 5„=uº9z÷ROH](ƒ¦W³T¦ +WÀ›{õê ‹Õ¢¥å=Õ8¶´©Hê–E([ N[^[©Ô^üŒqCêÈ>òäa×jÖn³àh2v¥>Û×À¡ŽÕÅZ º}‹’9¢ÎŠf\ý¢dÂfÁR’©›£ùñ¤y6ÇÑx¼%ΘÅm¤˜ÇFG«F*íjb%Fæçó@y÷ÃaàjŠN‰”Ö½¿ìÓx$³ù@u è=ÝÿºÐé‚RhÜNÍ Š_ÕQ…Œc67Fܬœ®ü¾Þ*µºyzÂý„Zê‚T²wÐt§$ :üÏ¿r&‚é"}éUò§—uJ5Ñ®%ÒœL½c³ÖR Ðç¬ÑïÔÿÿô·ýR » ÞÐÎÖ–Oª,­Æ©UK" ˜î òüƌ߄ü–ë¾jššó±Ï5ö2~dƒß¥Ê¦5¾­¯@µM ™â©¼ea¼ë ‰ÎZÎV5Gy«Aºwû˨÷ëyopuÛoñ÷¯dy€ZŸìÇÞ¦’+³=ŽŽ*«½ê –šY><°ÉψÅîv/VÜHùtܪ28ˆ“P‘ªèùÎm•ioÒpÏaB[U&á¶å œØ“²Sx›ùFå!:-¯šoë“½¥W&…,鬥>VO“Æòâ«ž“.dLB² «ÉiÉ0U³päbÊUÌ!R%©±S D,ƒ`Fb(HSت¤Ç–|×ÚÈyªGCmgè¦Ü¦rl×#6 Wã}¨9à»oAÛ7ê,ÉUmvSa—Õ‚¹ßHò}KagýY–®ތ¥¨µ\jVÚ'2ËˬCõå Ö'¦)‹²ÌV˜FFÊ$@È;½Ê†8šÉ%Íinø?›Éªä*9ºÉMïÉúÞ{_]ìên€ëÑ®l,¶Búö4~ž'³Ç0Æcs²Æåµõc<›\—â½2CnoŠ „ÍÇ*7ÁV?õLA‰§P¯î)XùRç@Ÿðº 61ê¸ ¥üŽn‚ö&° q/Ù"XáùAت·mêºrË·*7èk,ci•Y'»ÔÆ߈³¸^£Z2æúcq-‰ˆ,AbU'ËÜt›DÒ¸‘ÜÐuBz[¹øôéw<õ’g8Ý XÌMm‘_S‚DxknY“¢7óØíCó®†1¿¯xrå»s¶4WqÔEOºÇ\¥'UpÓ‹GS9¡$•ØKòA ­šM;;3éÎïê¶Ù?èn"yÈ«ø?>æغüÈIöw3+*¹P þ>‹móYºúža5÷_Œã‰?V:*ª˜”ísi‰ÀUdú7;ªC€Òs J±ü ‚©×e³¥=*ÏkeÇÂú;–/h éà‘ûÛ‹Û#DÌï8Â(Å}U„¦s£L€@ìŸV:7^½ëwïîzú¡O¶â¡‘=92߀­”©UŠc¾[‘Àsþö=wå>ª |+…7óv\7ϕʹšLÏ cª ÚpÅ»¤³:×’ÍÁ<íDK¶N; DZñlË5†qj"bÕ„6ŽÃ*¹¿¾Ç¶–MÝôáXåܾ섬TΗ“ÕlCÐJÄË:{“#°0ÐþYîlœc”Ÿ¹­¾ø´œ½/Gjc+æOvPçÇÍžÖ ï9YM0õ›gón:>àúvÒy² ?NÑÃUŸ~ ä×cz7QÙ¸ëê÷GW—ÄyëÓLw‚ßF8ôtúw°(íä®zæj ©ùòEvH¤½ÛNµÜqho®iŸé $ïÆ/w4hŒ?Âu*õ .ÕîT¼'Zøö–y½Y=ócP‰£D¿œ*f~Ÿ,ýê©"`ªøH™ý•^m–4¬+¨·o~šI[Æ=‚–þáú¶ÿŽÒY°5Fæ[ä {øj ´âƘAØ3?‚f|þ¬OŠç˜&f̉ ÿ¬ºm=§Ö]´Û ‹èËçE4 öë"mé|_Dæz^áŒ5_1(õ­¿´k~F_ŠÖo°á±ø&‚ó[ÂêƒU5>¿+)°«>Ø$ZÝ`¨*.b:F¥$ü~ŸcæØ„T¹r}pÆžöM%6ÿ]öæý±WŸNjîØ=,Þ˜«Øü6&ÕÝ?^j$µç¸98ºFä·?ؽÛ2òß¼ú‚õ¾Ú‹Wt„ž¼‚œByYÂ=ÔUœ¯2ÒýØ–yîZø^És[ßgÁ—¼¾ÞOò«ñþ©‚#žJq¢G(NbÑO.vq“(T}‰—ÍÛLÿü±v{ië¢nMG}M,FVxMŒs˜ÈVž¸©%5“¤ßÒBF]ÁEá\ë/¢èûë–œ@ô³—˜ xÿãàðoô>Ûç}úùJ~‡ˆ­à:`Ëñðü^{jJªŽ§G@²íÇêúFâåÖ7 ¶¾qk˜‚z]Ê ïc?ÅWŒÊg™ \ÄW#kQ{-©/6‰Ï2‰’2µÝï’÷ {‘ÙfóGÂýpÒüPKÕj =W0ÎçŸÔ„ filters.hí=ûsÛF?[ÅÆq©TQœÜMçƶü,+Ž¯¶¬³”æë=FCK+›_(RGR¶ÕÔ÷·€}ò%Q~¤í]gÚXä.°À.€°~çMƒ Ÿ²Îå/ýáE¿?úpz6ì^FkßÁ{/àEEµ·o_±ÿœz>¯Õ¾ó‚±¿˜p¶{³¹Ï›7Ûö;>¾òÃñ—ôÛ™3õfn”Ì“(ýö¿|‘Aèú×s7rg©·Ukµ^û¼;è·;ÝÑQ÷ä´çt¢å< ûý:’ü–Í£ðÖ›ð˜¹#bgJ˜¨Ï£aø¾ ÇNâF×NøÔãÖ‹’…ë—Š%ëñ»c>u~b$++•§Ạđ RxŸˆßõý-0³©(v§øorãÅ, xÍ@ÄnÂ…?éK>¸äù“mæ4±¸é¤$’ ·ÁðçÎÖ·‹E2_$44!ýx W²zÅ^{Á€ÄµÁ$ŒÏƒëDÊÃL³ŸËMäÝR:AÏy8ñ¦¶,eß’&–™aÎR”éÝçkSha®Vkå³³œÖßctÞ»ÁŸñÙFà0+ý!›Ì´T§ †”ˆÙÈ €Ô~{µH6F@Uâ ÞÀhH[Œ“ô\/lCƒ7ð‘ûsÁ”¦ @# ÄMxÇf‹ñ KBæÆ_˜š®ˆðÂZ>t0 ÝÔ$|6§F ëI²±±NÄ¡‚j~íÜSÞÏZ=f 0ðK?[\èw;†æzm ¸Ý­¦ÍòaKáb;;6—¦ÅhË›2Ç⮉m€m;Е 6!¹Žx öüÁS³#èÏt„æÊ¢ˆZ£æŠÉĆDK[µ-aØ’öVPB¯ð› ˜i«“°Zæ4â<×XOb· ÉW Ò‡o2øÔå’Ž‚†4B­e&û£¾ÿðm¥5%˜OäÁ?`cÀÇè7¡Ñ²GGØŒ„fÜ:ìK1¹ÁDÍ31›c°ÜDáâ ²ëÇ!ŹÅP$f·®[Pœãì\Bø€ù@Ú¡‚R!^h¡s-­29Éààkò² #÷aóÞ±~C8!yƒ®¾Ï.yÌ"©§dÀ“¡…&ÛàJµƒZnžÈAB,íÉDzÛƒ/ÞÜY±wð‰=£+Çz.mºzŽÅÈb»q%=©S¾(!O®|Â8ôAx&¸RÀJ®  '<é,"dHN›ä¼9˜~òµ° 4–a˜¸¾6`‰~µScšSµD†Õ(BEí¢Hì’u ¢¡RxQLý' Ëh²š“âŒÒ—¡o †KLPðÞ±ÝZªmâ?Z~jßvRß;OñJµÛ¥2çxe«[¾’EŽ»¼â–ãü4G™g›¦±zô“Òyš1þd±ÇÂ_“d2„·â>f´¨™67 £9ävmptd+èÏuŽÞïîþÈ@ÿ¾¸`ÁƒÉžýnÀvƒ»v¶ž ”MÁÅ\ E À žÍUSýþí7p~äïVË*—IÙ.P$¨[E&o?còö-“‡žƒÎ¥;J”B{ÓHÛ“Œ"—ØŠFÖ4ŠU¦vÊÙØÝŽN{„?baá÷•êÏF¤Šû–ç.„ÔÌÁ£¢ùÓšs²³¨5OÚÓg¢ê$ZÔöÜkŠbža_V{1w¡C*ÒiW~§à’X4¾~%œÏ^r£ÐŸb°Ä&žH¡.æ ¢àKÐ8îÎP8Âږ˦0)&ÂT€³Ã‚éF8k2ñ¹(ñ@ÉeвrSŠæ58Ià]…säÊõX x]KÔCMIœpw¯ɛ¢–p¾[ì]½Y{ý¶hÊXÖƒ‘‡ C‚öeúŠhSLÓp„†e·a?[`@E´ÑØ;ïÊ Š¢±OY¡3öÞUU*Qýßh¿|®}äÄ(ìº4´S51‡¢CGµToè6Røõ'tB_/0§¯#Ý ]M¦òbJÔÛ±ëû1ûFcÞã÷ †‚_ÂlÂ0P‚´WQœÓ͹ÔÌPë¾—H`1qâbÒ"}M ²„û*FB´ˆ¿j±]Ðø­ ­S|•'Np~M±A/ríðr@€|H¦e’ÄÄƱ7!#ЂԄç8 d2U¦d3©ôc˜Ãnù¤L. ~d&®cUk^'wòJ¹£º‰\Û\ûŽ­U먭µÇø_J3dwq©…¿„*˜øèÍ•oüÅîÐU8Ÿ€{R hE¨³Y¡’¨_ï#+ì=(æ©lñZë.x™îÀE® Nõ$Î^ãæ90ŠyÔ呲@`)Ù;ÌdB© ×b—Q(àðæu“u;GèÌvŽ:8«ózä6Dg÷ÎùY(s.>5X‡þ^6âMg8 ¨çG0·œÝ$É|ïíÛ»»»æ÷&®×„)÷m ~é›™‡sîÛqá–mæúGzi\XÇï¼ij÷ðyû´7„ÿGGíÎOŸÛ—ǃQçâ¼ßžž©%Ë9GˆFN Y¯ökßñÆ Ôtã›4®"ʵÖ/¦W·’Ÿ“'€íÜÌ62¤ÜfOU‹tXx/0#¤éÇÞ5Z@;# öIH—ˆî”m-€ºòËA66$ˆ”fáócò"ÙãG®ÔVXX.fK@|šÃÌÇÓ‹ÉÖÂk‘PØXŒwn†=¯y=æÖrX,6 ¤Fbˆìà7$ÕæÍJ§¦ºý VŠ³OußÄÖ5‡fc`[#êR¢ŒSSai1œCnûžrŽÛÃöìQ÷äLHs·óÓèCûô¬{Ü`ÛÅlìéÕZì7tNÎÛˆòܤãM¶E¢”â0rD?øîu̾~l>ŽÚÃQ·wÜÇ\=Ò!„hjÿÓptÞ Ú'ÝÖ{ñˆuZÿ,~_v o­i°áÇË‹Ï£îß;Ýþðô`4Žé‡³öÉìE ;ûÍÂtmóõ —‹ÿé=›Ë­4Y« Õ3ÛÒ™žàÆ5Zªp`+X9)8³‰Î:'L¢ÀÜ<~?§ÑĆ…9SNE‰e2¯b̺¡­»rÇ_îÜhSZª_y¾—,S¶ñβ<¬cüòÈVyà 1äjÃkÇ\=ƒiÆUÇ+ήAfÜ,71²ívûx»ÉN§è@ÀoµÄ×`øpçù>‚‰ yR´ãÊ]Re ½xÍ<ÕÝ -Æ–—û{Ù¸¹Þ!náxaÜ Š|aŠÞVç¬ ¢6 ä”÷]õXÏÍ—ºl›„‰O^¡WNQñþêõ[s…ßd’å–ÏV þ þÜãìž™¬LØ4ç,ÙaÂÿø¡‚ÊfMúsL¶6ÛxQ–$Ÿ´{TÅëÉÔyP^Ì^d{æYíÅc}©GØ‚M=/5Uú^^ÛPÉmLñŸ©ü—+Y9¡U∥ûwUvÁ¨P9š+ÂÖþO£º“Qa6J²¶íS0ÅÅpÌ颰œK°×á¬Gë“'<»†ÙNdίiP¾ñïÓ?êð´âD´W W·#þÐ)ðí1Ø·…tÉÒ&Ißuà‚$¦Ššó³øLÇÆFD’PGþå~¬x§d€©óõ‘wkŒ‡û©sˆPá<7‡…ƒT’øɯ¯{¥Je‚OÃÿ,¹šbl6+€7ÍÚ(ŽU¶BG/÷(VM¬ÏÕ NOzíá§Ë®å¤Þ­ÊÚèŠKÝäÛÉåoVŒ›£EQuÛ‘qrôlÞÇÆ>Ãm¹¿ðW²æÅ“5"a†ä)*—´É˜'­qE9;+³Ê¥Õ¹Zræ’O¼DDn?ÆóÒ-—i†g!Ô ï”g/)2— khYÇÎ"NÂÑï÷Í)öƒ|9ÌE:Güƽõpcnè 3vÑ;ûôk÷~w—¶ûíÁ@X³xýN¿þÜ>Ž.Žþµ‹ËÚTö^—uî^þ2üˆ á-–BòËK‹gøqp7Íl$¾:´½†6 IrLÂjZàëNë*¾™ÂØÊbTI0M„ú!7ùÈg‚†5ˆÃ£ôºG¾Ô Mƒ$œ+Dâ.»6ö†ØŽ¢˜ÀmkŠ(³øãiú Ѧ &×Ô îVÙÆ>£²üiPÇÀ²ÔØ×i#¶MƒG8•ðš§ýÛâ·…í·´(í‹©vs-ö?Ž°õLÕ ñŸ]/¹¸úôp%li-æÂFXovÒõõlÕqZñ_Šƒ4’!뀩–Ÿ¿éŸosP{b†åö>í>– OÁYp•Ûêô¢%w˜=ûÉØuÄQ#êv$‰1§³Êw­oø¨ÕêI×Qº³SHŒ¦^4hµ•¾öÄ"R‰ÅÓ®@z ¹¶ÖÒø\Ÿµ‚¹ú2Ê‚ú­òIùt¨FŸA¶slÚ§ÑV1ü-XMÑòŒL «, 5[É)ÖF·ÑSúòzŸ¦ËÈWªýŠ¶@âÊ©é*v_žµ<9ªí æ#{Ĺ{o&÷N¸R,+'1ícØd–aEéaʱ€J6»6Y¤ ¾úÙÀ÷6´íÐi"zA=ÉäÝE+‰¬§i´Ë¬– brAL`WÎ+¤vˆ¦½J™/bŸb\Ù]âep÷K¹ÎZtäœö”S¥GD=t©‹1r©8VD$Tæп"%©Ë»êW;`¤µ ` ŠÝb'GÆWâ†Í].â¥ùû^@²AE>WªKV˜çý5Ç¢¿ñ©VÏÆË]—‰ ca‹ÝzÞ,bì° <¿¯›î±µDþ®>þA|ßµ¢‚#ü{û»yXéü>ÂÈünNou~«xÀ›pþûx¾jÖŸÑ~‹Oñ„×:v;’ kqÐ8#zðȹܙ‰‰r™F§xzøÆMè® çcwytùH“‹;Œãf‘Gh9Œ­Zp¥‡ ê*-æĶ5yÂi¡ÔbW¥+m§™ÝâÊ}›š„`ò8ø>‡å—´ãsLxä/QyDÍïc¹„B".í-^GÆ& åÂŽ.R»'2k%¢ÂpÓ‚SÁîÒ¹cÂåëvb£tÕM ¢í=Ðý$ûæ/ÙïaD,ûLs÷ÐᲜÜuF{{bRÏnC¥~t·€è|uqÀ?ð>$Tß,`±Øp¶» Ó ge;ýìös;r³£”Rç`µm0ˆípõsƒ•i1ÊyùѸšÅ}(·Èd„`ƒQ’{ýÌ(e7ÿ=n”ì}D+ÆH·¾ée«‘b;þ|c¤q5‹{põµçs åØ[,Å¥#ä8äê•U=[®ÇŸc“ãk¹ÉQÉ ~ÐÆ6Âà”†0™‰Ëk ÏD‘»¬>ºúÚÎ5-J²Aôlæ2<ÓŠì¼ÅTwZJ¤ý•xU¿ÜZû«LÇê;kÝô…3í[×óÑ­—×X¨`r€{›\<2X\Áä0NOcª›Û»éþk\q3Xþîë'o’­±~ )³®YTWáîUsW‘¼ÑH]9,˜Õb÷wÅ¥€Ò‚§‡='q²j™8[B£Ê×Ü8ô {eÊIÍ-$è°Lí›+—ò:€êóܧ̤}¦2ëÜ<¦‚;SËšª &îšñ¿RK|ÏÝ/ ³JXmÊ!Áßè .Ü_Hã ë9o½.>Åk\ä¥7>'ú'ALÞ%eyúÀ퓼L—Ô¶RŠñúDZ]Ô陵i2EµÚ@ñͬ°Ú•«ok@ùËËq‚ãbµ1„àú”km¸ˆÆ|õSÎËMÎÕÍ{D M+̆š\=3æ1¬ @ÅÝLyNVK²F¾9ñAÃ`y‰çîø­ü¨azøܽO«í…¢õ\qv Y4þF ÌÃ_Ÿ¬ªF"±b/LN•üò‰³”½4to+Å‹‹92/C—h’îl×ÓaŽÙÛ»¹j®v„µ‡Rª¢`õ“¥ «H{ ÜϱZótÇ|©fÎOg½áŸŸÔ$,7æ˜@+ʾºøò/ß|ÞPb뫱(ìV 4”“Ÿ/fóXݦ8×KRŸ–ue\ñ˲r:ÐRF¾Ã%ÇlZxª‘ œ2}_ÐÞ^ɹ@Áw8“²ŒL‚¤µÄÈí–› °Ê{G–š{hå‹Ü·‚°ºþÄPª„Ô±õé´7$UQ¸UetÑô%*Ù‚2äê¶ØÙ¯“ÕpððÞI]¡®Ý}$X 4í++–‡Ô]˼!*Å‚º¥ë‰Üb]IC”†­{ã.b4ÁJÛoþŒ•¨mÙy&•ÚSê²2Áˆ¶M`.“u+eÍôhyWZ3ÄasM”‚!¡ pE˜Êó)` —Ó¢:UWŸ¤þd2ØOKËJç°¹>©±¹X¦V¼E3¶M/ýZ³Ø8!ñæíaáþ¯'Èú 2Î5䦛¨Lq™.­ @ÖвºõUºi5ûJµ›óvwvR…æ+löŽÇö" sû7³›¬RâW ”Ýp&·ñW.:*#ð—ƒdÏ|™Ž—ªf3*ÄE20ÏL™S`Eï‡)GÌž{«šÈäõW… ™y-OJ÷|ƒXX²45ù Œ¾O@Úî—¢77eèŸ!σ=q=©OibÝ5°"ôçî“LÚIh„ñ\W÷JÊÇý¿#!Ê4à‡pQBE˜‰e¼=<7$¸”ÙA™•*a DÞ—~¿DfµÉÉÆåKVbTW%XÐ6¿„Àç‰L ´‰ªŒu!fÙ™’A \tÙ6š E ×>ïúíNïq¨©[‚ÿPK=v°)ý fips140.cpp­VQoÚ0~n~Åm•Lݦ½¡=dvh4‰HÚjO‘I.`ÍØ™í´BÓþûÎTÕ^ÀÜùîû¾»³Íå%”¼2ï?¾ëçUoáQskQ“T‚åX—`U=<‡B-Yf+¸G#Æ=ïœË\ÔÂë*_ô¯¥”–0œ~‹Ó(Ž³ñMMÓdï—öïŒVBåLõìò$baÀ*˜!lö ˜±P* ùjþÈ¥ç…þMÄþ0È>×ã°;ԫʪ8îyåaÉ%’Þdzï>l­%( Wã8"ñöäjY ÎdŽP"£ h.6˜\η\I&À¢±ŠZ;»C0–i[W ©jj ²^ÎPÃ%jæ‚.šr~ÇÕž­é n²-Ù XYbn¡BMâ–ŽIÿ°AèžÙ0º‰'c?$Í÷ãôKæ„d$$ûàkÁÿï¼s”/›ÆA÷„ÈN^­ñŠnúeø£$óïüñÄöz”WkêÔñ:küQsªs3^ìqÁf\p»U’M#£f»i  +Íæ®ÿg”dÓðú?ÑŒ¨´zàn0)ëŽa¬QßV Š2¥'–fÊÀ<«ŽÚ?AÝÓì6Î’`r•¥A’fa”f£( ž7SJÀNO6lé’Í©êy?½3Ídÿ{aÞ/Ï{P¼€„/kÁ,þÅûŠäÒYX§?‰ý•75ÇkѲôã1\£=ºë]Oà7n"N8%i3^7]Éz¸ ~ž£1ñËX«9õÃ…N»¥{ðHs1h©óýj‡¥i‘LéòZ6NÔºåð¬¼>uᎉšÚ ¯>Ax;™ ˆ£0è1cPÛnÉèWoà.g³Pµ(@*ë®gªa‹Õìl¶CvÐå'T6á­ï%¢ŸW›lÕvroz{€Ô™»g…nî˜qýÈ •4ÜÐc™¯\êx$Ū›“×Bü5ÛÒõÒÁíòZ÷[w±]¾Dî³üº{è;¤Ãñ¹lž¿eº8zô:¦ùÞx‡š—ܹ6«—È{ŽVw‹Û‚ì+ÛýC‘·uüPK=Rgk˜> fips140.hµVmoÚHþ\ÿŠi"E€hÓæZ)Êé>0-*/ž*dÙë1ìÕìZ»ëPõ¿ßì& T•î ZíÌ>óÌ3/æ’§"ÁºÓoÁ|aÌÞx~ö.éž ‘AФðׯ0Ìm0K%×ÖKC–e ©¸Y®€k(4ñŠRƒŠ4f)ÔÒˆgÚs ÷Yö†C˜‘Ëœ<úäP(„;È‹8ã ü*¨÷ä•WwÞ+ü‘Ó›ãg F"Ð&¹»ÓFq±€+Ý$°Jc2ÿìOC:LÛ@¶§ŸÞÏ?ËüšB‘ˆ”–YñJç77ÀäŠ"F‚!¤‘’OQœÙTó¡ú€á+ôjÉÅRfût;ÁÀA‡¶²7awí—Xæ–ŠbQVP0…9ÅDalNÚ ’D]"ä’˜¼)ò½Ìž{Øû‡¼’hV>z &“A8ó‡ýpîÏæáx2{“±ß†Æ~g0ô{'MAg6ó{•|9ªTªÕNm×›³ï;¢Ì¥®×£äI]¯ž<Êf[i¶Œ´V2)2ì“ø"ZaJ[¼1-jd4$#ç3ŠXó—èR[¥­1Ýâ–zSo[Š6kÄUŒIB Pr€Q§ûr.½,;N§bU t‚Ѷê4ig«ôRè_veE¯¦§YǃJQ×çSyºçj>¡9é墛MŽv9žÆiÔ€ZœÃj:°³j-°SPV4E,²Û +i¶êüƸƒ Ze›îÙwêªêsÄçS]WvÜï7j›¶»'Û½]ÐÐÊ;ÌQFø ÆÃa ¡ùBP÷e’šµ•“Í‚e™ÞÖ¯,kÙ»ÕjŽ7ÐÙíkGCÌHn‘gr}`–ñ¿ÄÌu^Œ{gûá±ÇÙs¢Õd %´¾ôD̉Ä|©0*לkÑÙ³*žyáÀùζ ÜR"®Ö\c—8rmP°ÍÁ²¾„Ö“6û•“MU ÃWT<åÖô¸=º÷…û¾‘œ/¢o]I”+¬Ž1z¸3'Õñ—swŸŒ‰È6ÿoFçbýf~ÏþÖôF£ov†B,¸ ŸðãûôñmßÞ¼‹ð¶ögÄ÷EÂSï?PK=\O»g · fipsalgt.cppì=ýWÛ¸²?“¿BÍ=¯uJ $´Ü.î !R’rw_/‡.‰“ÚK–ËÿþfF’-Ù²(íîû8g»±¥Ñh4š/dñæ »tÇAwp.÷Æc¶Ä~÷Ý0äëz}6t{¼Ï\…ל'·Çú£aJ.¦ìŸÜe;]·Pxó†u®ÝP 8s‡ãr/ ¨Õm×wG“€A#@}=d! Î㼸Ãwƒ€íî·Ú¬òvàn¿º#oYàåÓW>tîó€û·ÐâšÃ«Ó ±xMÂ’Øëœ5üé8-.ú±_pæs‰”÷— …¿¹—lÿïõù%kœüÖê·Zçû‡­ã“N»ð7(u=Wì4wëŸ?vÎŽÏw>~,ü{}÷Ú{½Á¤ÏY±?,_µ‚‘Û°¤ð¹½ôáü¨~Øl·ê¦#ˆkµJ©š ì— …Þ9ñzßöy÷¦ÕõaÈl]1¾> Gm÷ʃ±xWÛ“ËKîxl캃û[l«p_°ë……GÀó~ÇïzÁåÈÙënv{×ÈËÍ£Ï?–abCΠ Þôú›¯þå½*ÖÙð\–9ò·Äîw8¶ub¥ÚC¡°¸ðóµ&aæÉ Bóõ¿r½2“Õî]…×e˜º aÝ+Ä ýFv1õn`˜Ð÷=tSæ¼ÐÊÂkô;Û–EûÞx{ƒ©SLŒ»Xª8ü7ñàIsÈÜ2^‡l“­`5°ƒ9îæJ¹‚,xZ\ÄŽ°wꞈÿâž±Í͘D ,Ô‰ Iþ:¥¥-â5_ÄNaÄKâ÷ã9mù£q÷J6*Ç ¨vI­»X¡÷‡‚ø‡„QÕ ¨#bž@ÆŠÑ›ÄÏ{ù2‡ÒˆGÙF¨œl}Èèë(·QFO{ÅštYZ;“É{‡õ†hjZf»ö^=ÝL§êðø¨Ó,–Ø?˜+°Þ³±ž}°s:£Q{)Ä"D§}Ò-DL“UÝK7<—ï€T>Õ¤ Ç€BBM}h}¬ï¥u6i ö[à"°Xq“Øf I6W“>m™&ˆËê¼5 M¢ùC–%¨7ÛVKÐÙ Ãh¬—‘ !1ñøjª2öH‚Ná’âFžb› o>q‚€Á”ÞhâEáïƒ ƒF!ïÁi]Jãñ$„0Ã#àx9¢ò2¡½QþÍZk¯®”bÑš-n2®EøÏ,Áv ˜y†Ê<•H 4ª44ª%í{agÔ¦†—ž£sQÞæ½m8i óXíñ;°MùŽÇg‚¶ëÝHò!`ºì‚ô”–!ì'ÊË4Üe\|94ŠÀTQ<ã(¥/E·Èiìus©"Çg Š¶H"εöÔewó$U¢ÄR¶? Moâ–¾Sg3݇ÞþšßíÈ‘J1šø=Na™’A˜lÒ¦ è„õv™¡WÉv2mäe²Œü§@ÓƒýàÞro¾S4<ã’¿;€Ù½ê6Š†péz}'! %‘°£zÕ%Ãl)œÂ–ˆ¼P-Î/6ïzœ œèi}ò6çÍ““ã“2¨¸‘šYG{̼QÈ.!Â꣭XLJgœ‡²sLû%ÑêLq0K1è†àOdjj 0‘4Üñ5øÝ×ìˆÿ¾Ýq:쵞>—`‘‘«ÛmëFEmXŠOdª çÉÁ`šuÖ×w8¡~Ôb¥Ì–kœ9„öt8ä =}‡èa e¦ðåE¤"³ìÞZG:ßÄæÞ&ÓRoÞ—5¶\4”»¡Û3Aáבï˜zü‡]½ïìÅS9l`"÷CçNÙ[˜Ã©7ü±ìsz½ÓKïFþÅäÒ.=Dz%lôõyŒ(|jœϾùZ¸š©wÏã~C.?¬ë.\ WVVVÀ5à-Q°%t… eG抲»²ûü²r&ëjÉ8ìΑ(JqÒñbâÿfCÖÕbûuãQ€i÷˜æ×Z‡KI‹ìF¬6ù°7ž:wXPä †7q£3¨Â¢ÿˆ‹ÊÊD¥ð…7èŸr rײ"±,fµlĹ¢ØÁÜÅÍ÷Z8'…ª]™E ·ô~ ^ßËí À¼¾Þù>,()×N·Ý0íJ©è©``&Œç*ÎØ‹õP†2Õ³ü2<!õ6¯nz ÅöeÑ€ƒX“Æ«ÙØ’n­Ù8—‰='é̯§º?Þß·¯r×Ï?ø£É¸F%ä~pÞllZ6Æ’ÀAPCbåyæ.ài‰­  "B%5UKzåä‚êhyßsCX× ê Ï}ïª,»/Å ‡Ý!q µ˜›+öY±L½/ࡤ«y7yÜ ¥ý±¶ûtG 'ÔŽ:kŠýd§´|§ˆÂÊÆÄ¿5ÇÇ]—Àµwç÷#mååv6ÍélúôÎæ‘ÍuìëϧŠHäš(e eÖÞ«W¶Ö×cшd"XM²‘Ù’' Ùá–8tÒ>ßAi³ •ŽX¦>°&·ÈVFObƒ!Í‚Ï£YÂ(öìÔpD/¼îûÝ)»PJUÊ;–JiO’Poªà›ÚXº¨&@jQàÓ‚Ÿ©¶¾N°«“Ìê6V·ç²´bWc>õIDB @"aùtW<³ÌêÔ:U *Ïå;QåIñl±x],-÷Îq5kÂ1\; gªÉú:1X²–}ºC'do9ÀSfmš Á9Ÿé§©èü9LLÊj€LiFC ‚.gàyu/]àØ­|ˆ-IÊ0( ÓàG™´”zbu UÏÔÓ¨A_6Ä…Á“OhG5Â]S%`“&äÉVë„÷] ª`Ý Ð—µ"XÔÔ;õó㣿I%IÐN`P1-š.4Phç"[iy0„¨š˜kQl·˜«¦2>£…;hkëàÔ9ézýÑðh2¼à>x>îwfö’,ïcÖ<JþK{d@Œ0§òp›Cœ\Íš–=à=ˆé„9’óúš5|€'íº:¯e$d`*½~×ïkKl…ÛwZnÊ’ÖÁ¹Ò^3Ñ¢ˆ}Ò¢žoaŽ"¤d.¯ vû|¿}¼±§Ys÷ÙÀÛzÞV»]fs"®< ñA£]¹­¼Kc7rÅy<ÁÉssP`}vþÍDûÜ‹që·ð b†”çwžl[7B®»Áµ&ôøªG+ÏjrY‘ñ dœˆ°T«osð@íü˜Þ­åaz·67¦Õ÷y4AíܘÞUª9˜ 6“ÖL›é[×'ÝXëïŒ0ïêX2ÞÂkåñÉܸÒOåˆl‡Å®6þv%txuÔ‡˜ƒm2ðgÀwáw{7<þ]ml¬™1!X÷oWËÒ ráñäàHz¨‰@-WÙVßÜ¢Øp…‡£þd0 ¢.¬Á¾ßž\\áàŽ} /òZ}°´Š\¸ _74Fˆæ¨x–zv#ÚÎ&G‹Ã(…!™õ^â\`–Œ–¥ßÔ¹Y( (Á]ªE¦¨¶ öW=s¡ºÉJaØQü¦­¨b æÒJµÏ=±ë8"Á]¨—‘¥˜õ”¯Zme©TïJIÛæ|˜çœ×ý3O¢ZøŒËì[™]—™Tê‚N H·A´’Ñ=ç}lDµûšíN{ÿ¿šj¤ý‘ø•-мGÂ@íl_&, 6‰}߅߯ñkçIˆj ³<äAºíë÷eEqÇSYAûü-Ây½,$PÓ]°p㥪¸BŽžó»ñùn³œ÷à‡3^ª”Þoƹ)tWJ7‹cZîsVöó9-¤Õ@>ÌsX\(läÅãôe«ˆÛ˜©Dg»ð-†ý4–]Å°fÁNcØß²`MÑSˆ„À„N•TÆò£ÒwJŒ2²|qz/ONOL)?c—ƒ³ýp¦ôé±X3’‹zzÑ’`|tŠñÏÓýs†¿ž.\Ç°{Y°h'cù^*–OÇÝ‘àÑw8Iëf—QÍ1КN…æ‘«ˆ8\}­HyÂ$²/$d“ͯ— ‹ Õ+‚29‚›|À#Qã ÎúŸ¿Ñã·là+¬Ÿ#žÏ—u‰ïç |Á8ì–yr$ñÝÉÃîxC‹–˘†ßb˜À«ŽÜ>áW/ K•_ªôÉE½}T6¼7†¿"M…‰ù0JìïÖ’ïÖ¬˜Ï2!¡Ä ù®ZI@B‰ò`©²¶jB†Prcƒ¬®&!¡Äù>ùÞùvå—$”X!ßý=1¢J,ÛöùU ¤uD¾ §uDVH눬Ö ȼÏòîc#‚W Ô¢…JbÅöe…>î~Õz%;t1Á¦Ü¾Úh6Z[*®ÌØA¶VL©"G¢Sb«¼gº×êÑêvE´¤ÌÓÃ\Ÿ5ÞÏÍçøÜ”`²"$3õvÈ‘—ßýy…9‡/š£Ô#ú¿c‰¸gþa@Ãï†@ð¨ažÑcZæ®ò$å(e6)¸îÖWZ"©½W‡ ªä‡vó•yzqÔçÍŠy ˳`O(•ÜzNm>{eÆ•ÉrÜÁ?‡þ†¶Ý»ÅƧN´ËcÔÈÃæeÉ‹hätiKäò¡‘=9%yär× µó…OXª½Ÿ™jó ò¦¶°R§…™»¥r¯«Zf[?ÔñjåÕÿ¯Ù²Öl–¯·ä!uMÆÉX~o>õÑ©Û“??û¿5×êéy͹ҪÜ8&,҇ћ¢ôÍ{s䦉?°?mÓþÈò,ëÓža}´mÂTþÿðäåëq{îÌ¥5HŽFÏé*×ó|Y`JYA%W¬.„¸/˜¢²× ®w'^©iÙÛÕýnôé“:¬õØ5Ø@šŸ½z¥”¼÷"jåH·‚ªœvêà†¥Ý»µìvÑ1t;¨ÊnÊH·ƒ*{"oψÍx*YYÚêºXáÌ’T:ÜùRYYYÕ6ÏÜòW©]䟿â.ò× ‚ŸÄ>24Æ`“Èß*þbçҴȼVÑ‹cGºËV›Ä&A®@ä.­bdDOÕè©¢>ƾÝ3%ƒÀµ¥­÷ xÓ66!¨¦Ñô&xI€8Ô¶ ]á?û&´äŸ`Oõ,ÇPÒ'Ϩm_óÌéáNr ÷çî´fˆIؽÊdžyºs\9¦4i€§&€ñM§3 \źЗfm‚Š÷v“öè.#ñzš2Ÿõüó’Ö chròF‹ªò+óZî7bƹ¨ŠÃøõyÑø>]ÎpúÄt|YEÕ¼7[Ç?HO¼¯ÏÄHñ»>9Le6õÐÿš¹dú\,þ 0ëxŠa¢e}ˆtÐt5ê=š‰(䢱ø¥Çê™a¬l •3Òi#T1¶Ö«ÕgðÒRÄ@&=ä®LåMFDŸ¥±5^ø¯BKF­ š,X3ÝŸš"Éάm‡HóˬÆe§Xà+¾ýúKåï04¡u|ÞÜi®Ÿä&{¦Ñf8»†quERˆÄ稚 ¥OÁÌ7Ô×bçjUÈÛEög]‘øs"­èÊ®d¨%×—õIx ¼\™7@4 î‚6:ïEaý¸Y]Qa kq öG‡l·R1ŽÍû|4›Í‡hµ:Ñ»µù½ADoó!Z{›Â9 A>ùFƒ‰ÇïÆt3¡g’&Œ¾ºâÀ Rj %q@$©‹5õuÇâÖ±,é×SåØ°Yk.Ã÷¥VçO}Èk.ä[Î÷¤‡ÝžüLÕÔO»+n»SË: -þÀH!WG8Póº´R*ÕfÞnc ñô"À{)¢yÈcìf[p™ÑÎWM ¹°«lîe=ÆÅFidªz6_ê™l­'ØZx&½ŒúWÚßÄ…|/€š¥­ý€>…”i Ý/«¡1à]Hv¨É¿ìNaÜè_xó†¡wl÷.z·~/,Ð`u]×#)#Š2£T÷V_>žž)Quoˆ^M¢¶ÕÕ ­&þ‰›D@ÄC-yÅõ­ßÖ¡ÈÆý(b:šxJévêÏñé¼y¶ÄëL4æp¶;x+HJbÌ«Vr°Cý÷`ßͧê¿ûñ ìÇÂþ\Ê€ä)=  ‡iRõ 5iÚ£+4 99û”ãË—·+2A€/”šõeÞSUêו$Y8MZPÝRCïy‹ío;V@©ŽãÇV'zlÄâ Þèµó«u*‰¨VGŒà¾L»0R4’ÚÕ“âT@ìo‹_ù¹ô™h©Ú(f€[›ï.¶ÎÞŠ‹`žz‡ŒíŽ“¸ÿ8¨¿W®$2f8ɘÇ1.$ÑÉÔULT:ƒ•eQâäTò*Q­jøúùSõ5JLá¼|2S‰ûb¢!´ü¦¸Å*ƒð ”ÀO ‡X)¯ÖÐñ?¨Mˆxuš"Èh@ˆžDPË$¨Ô²ô/š3ÍQLêñv.M™$Q» ¯i W’Né@ô*è&$ª_Dñ±Vœ3ŒÈ#Ì'HœÎHTð?ŸYPN A<}&š1YóÎq¤eLU’#vŠŸ.yÝG)ôs ÔrãQÃ÷ÉY)jgA&g¼ÌöSè¤Tç BÞ…%%ŽÅÌ¿FÐKÑÖ^ªÅ¢Q­·È±ÈãV[CMÿ%¸–%6Ô_jPiá—?(TÓ¶y-+lùÇ2ÒiÚÁåÕ¼¤Ÿü³Y[ üsÞØ£ÇI^›‚ |&Ùñe\Řم^˜¶&òÄ_¡¸/še œ¸õ–$(m–*qâª0—ñå€*XzÙÐñ§¤g6}yék=¾–…> (•PÑ-ü¦+U ¿–J‰¶aAg÷³£™û ^‰H;g_PñJ1V~å³K¶Œ{A['úUý—MÖh¨ëŽõö{˜£ ÂZ"!”Ú°¯ÿ*?rýgôæÞÔÞ #Àz’¯ùm`¬¾$<%·ç ö½Ô"H,׳BeF×½Å.âMµëëû§8 Æþ*!q`€%Ä®þÇÈ(‘·Šn¶®°*+¶ÓŠPÊQG±[4éé¥ÏˆÛĬüz–ØïF‘8ØÜ|/nìžëyk*ÐSÌ'_//‘,XüZf•ÈBiÞTo㈈Zª¬Í±dДYˆÎj‰æ_±åŠ½• 6½?™IäYêdZfR4ϯË?L3üT—þÂäF† –ò˜Ù‰´«‘eC*˪xñË/¿œ•j†E+Ì4â’FÅ4ä è·vuOÛ@ü¹üÆ7sÄ`¾½^Ià†+G‡‡R¦0}.ã&N“9HR;\çøß«ý’V² tŽ'ˆ-­ä•´úIÚÕÏm¬Ê`9ûÓóДžPyØûì¨Ñ–I©ÍõôgzxKþÛП<žîýmìòYÉMU¤2ˆ˜å·(;îøä%¤¯&÷PmW }ãâT¹6/«²¸÷{‰=«¢f «¨( *s'Þí¢Î\ŸœœÿšEÒ¨ÖÒ õ7È©WÙtCÓ‡jç(^ð sˆ×>À¿ˆj›,Ç¡ H*h˜Ö²dô’ÎÚx^kÔ>ÊÕÅnƒWyÏ%Wó/å ’GkŽõmG±üô½àB¤Ú^øÀÝ¥‘ë<àÎËi]ÜÍî‘ñì%¬CøŒýø̱5h‹_ø‡z«uÄqˆ{èâ¡ž XŸbˆ{JûÒ[ªò¹¼†€ô0µç{‘b[ ä;¦¬Ú qð˜à¬žƒßH¹É'+©¿f›BÔ'>*½LgȹE­¬®æż@y²­?ʱŒ6²”¨'ŽÉy³¦¯ÞBPåÎ@†óÅ7`Q…×kŠM,pA`ÒK’ÛØ‘äÖ›6÷…OçH®Ëö\‘ž¹áÜ–õäSKVBŽ˜W}  ’W8œ‚‹XX¿º2–Ȳ+¡PE’©DDjŸ ÞÑÊ»øóq=y¾ÐÄÀ$ä•0š5­šé®«þ2J›¨Õi]X:tÂã¸aM=Oh= 4Ð ¦HË"±»¦­ëB¼Õ²Lùˆ†6o}ί§¹§™ø¼LXNG¬m'Ý,Jòõ"m”G4`]?Ô? ßôÔòE8ÅÆoáú–é=}Cs׌DÏâù¾X-œß=éփǣ ‡F†N;*ÇIü¾éùGɹm¦ßŠ…ëýöE/"Täx,ëfgG õ~{T`ÏWÕLâH²×á,Vÿbë$à‚¦85šV-’Ìš`Š¬§z Ó(©Ý-\Ý•×uƒ»¬¹ªœ&þœ!YN-'”—³ÿn®_)h4}D÷Î9\c˜Lëdz¿˜W˨kRV¥å!¢ý°F]Rl;x€›§þz"ì³Ia‡a5¢E…u¼Fwù8†½*‹/ãáÕ·æ%Ñ` ÄÓ´Mw½“f„ÝÒìõ på¾Á-œic'Ñ¡¤wr4`óK Y“_®Áì>½Z{Jê.SXŒÔ’nGÒQë2öìCêÒ ºxX, d™žd [mÐ pwûÁft•N*µ¿qD¢iÇ!¹³ÛÝÛÿñÝOï6hު܌¯pÏ &¢xûâºÁ(±í¢«dFÔãÑœ»™ì¿¨¹[$îé†ñš›†…¿³e™>1$šx¸Ug¾@Ð/W©çËÏa¼×ô¡ KGð4‹B‚„ÆccB‚ºÃå‡|Û»´›1ÿ@½UÅ,£N¦•ö½[Q$o”¹Ô %±<Üö'íÖìÑnPUþ“:žb*(ÈhúC3ïd­©ZÖA™ë$d«â8Thˆµ››5À·ÑwÛ¼ÏÉ…oà£^Dn†“´/ë¹\Y©«4ÀÂS“X˜ÄE¾ 69¡ Øxãù –à0;|D˜tÑèð)à·`Ãi=… Õ_buÜd°‰PÓ‡bµ2]kSéa±N’ÎÖÖϤPϤßORP¬ÙÌÿv¦7ÿ—³ÑR·À²d0,6vÇ´r‰Îíhí:ëÇ£É|•ÎÈ»*˜HË]hàþ,mÇæ2?ÞÆRžÀñS™éxå?PKÉ=&Fkžî`Z fipstest.cppÌ;ýsÚÈ’?ã¿bÖ¯*'blëûÃNr¥/l.ÆP†$»oß%¤‘Q'‰8¾Ýüï×3 „ƒ½ûî6©’a4ÝÓ_ÓÝÓ=œŸ£0Z¥N³3µB§è1‰² /‘· Ðjîù8@Ñe3ŒVëé<òQ/<™>¡/8BŽý#Zúóu€ÑñÊŸÍŽÉH¸ pˆì»_†ãÁp8éõ‡ƒ»ñÞÀp´Ä›7ŽÛ5?ÝŒ'·ƒ‰ssSÁÌ箪/½[Iœ˜ŸÍÞiݸ%Föž·cÄãežß`{÷-ƒø1=›} Qp“þÈž|vïÚèÍT|AÞ#!‡§kOú“ÞϺºYʾáÖ§«+÷nr=|D?É&ž®ïïq2™ÅñÃÑ?ð<ÅÏÂ4-ƒ(<Âß2œ,ѱ}Œ~' ?ô5Ž`Þ€Ž‹–Yûò{ý©ˆ ŠÓ,ÁÞ$pköÝÑд݉å^õn9;yZeñpØ>*VÆ8ù´áy8ëe^¶NÑýdÕ4~y4¾õ”akû0Ëó³µ7ï{þåÑz™F÷ i4—÷ðjáùÝhŽobßË¢x‰Þ#þòèèü­SŒ<”€áÅ ¬‹'ôF4à î ,FSŒRì%þ ç fæ9÷€`ôe3j¦ÀáõMû(ÒÀ^ýx™f`®ÀNq°žc ëׂ㋋k˜ünóutm ..œÞ•;zÿt7Öú©ßÿ…ê .Êq{Ðön܉9¹wc.þÇ!WY°ÞšÚ*ÕEÚ—?6tÆÐuà|ºq›YŸbún?ÝÜ\–*¯°üvƒÎöÐÎÌB5æ2(”À•JBo@E#` ƒêÃaEmí£ßZl¬_CЮèÿŒH‚îZa]é;†Sœ­ÁôjæóýèˆÚýÇeü¸4—)X±;îŽÚÉíz1ÅÉ^âÄËâ½I–÷¦ræ%èm¼ÎV댒ëþ7 ²';^¬¼$Jã%¬OlÇ/@ ­*æ ÅE ¶8ÇKŽá;Ûgc°Õ4ĉ9Ÿcnƒ¤ƒŽùcÂòˆšï(^'>f€`ÆÉ$»Äès°8áÈW{æ-—x>KögutÂq»M,¤µ=cÓû8M½{<ÂI„SwplíCf d&8ËÙEè?÷ÒÙ½áµ{÷!üφ ÝÝ^M¶@–؈ù?uP}(Å8Ø 0È{-£,y-ðg새;õYLTG­œ£Þ 7s¢J¶S£ ¡l³CZi\\0¯PÙ eìóˆ’ľ8Í´lër¶Wilj´|à6ëQeÕ±äÂxBjž}| ê=Œ33×YLÇÓü;f¶zÓ:ˆþ!ÄÁØÙ&Üq\Õí´7Ò8 ¼ÌãÚŠB˜Wè F²z Ô8c ˆÐµm­t ³½{É"s+›%ñ# ?Ìqîó5#6óí'‹Ü…½ÁKŸ¸óˆìÐæ@m9£jß°ÙÀMB ­ûÑ "‰»ª™Gós±CkŽ™«²ô—^¦ó ª‹ È熦ãôn¯ÌxÃêŸtˆ/Çú ûU}ý[Ù?DMÓp0zZ,0ð⻥­¼82Ìð·ÞçíÁŠLê/°?ÝŠþÔß ·çÄ;#~–<Rö„Ž¿*€³yZ᥷ÀLœ¢Í¾{…%êÝAŒ6Vý:ä jr}­¸‰3:6*é¨ÉŠ©y¯´Ì$ñž¨°¢¯À[,™/ g4Tß>jí8s׶&úâ‰KÏ*Þܦ¿*Ò mP!an/ØFXP‚U “Ðs™“6ØDšmÙ/ p]®³´‘¼h5 ]‰a£ôì®õj»?–àÐ*‰a)Ÿ™ÄÁëIü%$ÆÁm4Jq|÷j)î}™®ýÇ£k/m§#3«g‹<Ôƒè0ž‚l%¨úOŵ:Â’Æ F`„…윧ëÿËxymŽ®‹h‰ýu‚ ½Û :P Š­!\ÑaÂ}C²› ¥ÄÊÚHkß´©ðiò‘4òL5`ûˆ±dÕ…ç¿2ˆns˜”âȾvûn¡óè~ée ö?/Í´@ÕaK4È´ ýùŒ‹ ²>lQZI¸Ã$ËL-•(ð}‹#Àø•}àrÔíM±dÇsr<¼|Ý©¥a‹çL°Mž×_èÈ¡{}ëô½‘ãß-ß>jòerúZûÊ_;TãTŸ Úî]ÝšãOwîÄçÅ\ôÇΤñõÝàËÄýÙv‡ãÞàöUò¹ÃA”Ðc6W'±Sy1Ì›“ÁíÍ/‡¹ò½Xەච©C/J£Û°IàðQò©²µ†'l*)ââc±§à5‹°äuP|ÌwQòtÔ‚¿»];CF S$zL¾â˜L­ú·êa”­…¢ïºLà{«‚•~`€Ê‡|"2ª²Å¬‚¼jÑmA?UX¥ß·üd¥°ÛqžØ”£¤4]¡¡MI(j#MWyk¤·”s3½¥ì›é-ÅU%·D?=Cmë;ì=v0âÎÎÎÚ¹Nó·EË¢ëEs0u®Ú™9¿“(›-nÁïqmt‚Ž/Њ™5fkt]Ðmþ½´ÑÒëÿÐD™~S8´òEéhß[áyÓlÒLÝ&›´Só¬[z)H*•òùeÎhÛÏt("²~»ý"Ýä„üYŦŸWX%\ÿMCð)´ZZõ¬lû˜ël†—Y”7al ½E·ø±ÇŒû„òö€~È­8Ê-ͪ€_Icìwþ›¬uÿMpÉS’ÈÓPÉSUÈÓèg“<]‡ éÛ*Ú½ä æD-¸nÀÖ:üµoþ<šãk²'Yé¢>DùÜeµh qÛ×ȈŸÊ‹£ñ ¹³A&Œˆ3o·ÎÏQÉFãtùJ׫Uœdè1ÏK*b°ð<ë‡Á$WÿHhŸäSû5Ò6ä_²h…³Íâý¿pe¿»Ó€œ8smôñ$) Ñ¥U•öY n•k‚Í5§ðXBú¼ù:–^òD”ØjÍ@´%Y׋ç@Ô.6:"]+¿ý‘w–5;\™U®v´ZaêrÃÌFŸ»líòH“üT1ƒF -^,q£ôÌ­•ö0™ßm¨ðôU‡ª’^XõèРC®Üäa™;Î/eœœ ç憸ÖÜûB¨÷ËRŠ3dÃ.ΑµrÂÖ ÅÙqûr£h®h‡4Ïy¨g  ($W£úÛr@rÿ…vP˜ÄàEð"†±0JÒ¬hsä ÞX^J/eÔª ³Ëb^¯o^¹g0š\»¦Cš!+¢nw¼ÍmÞŽÙŒ…`TWß´¹‚”´š~À“yè§loa¹6I+Ĥ€0×íÝÆÅ Ž¬E /ƒ;-!˜§Of“7§ˆ ¯A'9æ×7a1‡¸aðãà}üu’@è%s‡qZDŒâ%Qzº^äo8&º79ú=‚zs¶Ï£õ¢˜¶ð°Íò”gÑ´+Ðp¶‚À1 ½é;ìˆütYŽ—y%À¯L§½;áàî—‰{;†'ôÓ]oüËo´ï[ýf^´ø3çŒþù%Î>G ‰ãf@Æ’î_ñö¬H0‹*’ƒ3XNn÷x¢ÇwªVÖ©™ ‘ÈspÏØEçy½½s#Â2Ó{œÈ•ðô”“”ÏØFzúÁ†hY,Jni¤EH_ç­çÙñõSð´ÆBÜsöíÄ?b¢Íf°ïöáh rïŽßï¸hÆÓ»í{æM3!Å©½°õü:Íycv1;ýÞm΄wÞ#±‹¢cý(õ [+Äݪ¹e†¯£ÌKˆË¬zG@±c©ÍåÁ$Ç@á†1‰YÉ8fQHfåézÊtT€ð$åý–ê/h-¡ÄäI“‚:éåä õÛüœl/vÉ* [„TéßaéP$…'ª|;mm`¶pùÛ† @J³ HØö]²N”>ä‡Üæ=Ÿßiî =oÍñ÷œ’*ÔoXFïùK½cž´qáöùsoåÁ{¢èä„V¿˜ÎêáÔaKšH5”äy¸æ£ß~»¬.ÃŽËm£QÓ7g V'ø Fõî=ª£ƒãH}àj;Ù2Œ\$…LZ;VSGyÚ€’‘¹ÇxvàwèÉYÏEôý(¾àæ98?ϼ\ÖqØt‡üg)9ÏN¯ê³ÌpúDoC—ËáÍ×(¦sR5‰i抢,Ï%IVzT襗: dNàè[µ±ýº+Ó’*Ãç^ÿ%z}n—kùØvh¶T]ÜÅþ½oW›¨Íï ¾@>L<Ätâõ2€ÓýOAÕ1èõ.®¬ÕKAûwl5œ]ñêMQ§HÿéGPígÏð·¼ p¿¹ËÆû8ù”v›x[Öè ž«ª¾Ý]ÊX”Ë›ô®Q”^ cpºŒÒ)$ÛñÌŸùtÂ9ÖësEûÖ‰·~ðöú†íúìù¡8üáà 䟆“‘{ÓŒÝùé#dƒ[—6h²-BzËaß“ìy°$¾i<#ÉG›ªô^qÑ&–Ñí GÈ'â„\À™GÞÒ³ ¸6úã†äbSΓêw{hÛbh°»7•oÑo[;%“E¿žÖ6égò?’™>âÜË¿:-Ø|ÇüÍçÌ3ßÏ2”Däé=zOG,q„^Ñ5¦]ᔌîùÓ;Ó}ÈûæâTÂ"¨¢îá@ôToj‚¢ë¼á‡r(ùÇVùÖxÀOŒçyy‰—y…WyÞ㧼Ï<æÃ-0òC™î¹Â\-0úJwMuGÔdC²xÉPº²#ðŠ¬Š’hñª!9¶Æ«‚ÍK¶d*ŠÜå Ûµ»jWµdÕ1dÅ„PEç?‰¡W ~x±ÿãŽ&®ãJLd’®8š ¦bKŽ¬+® i¼i*Ž RÐEK±áŸÃFWt Þ=¦×ŽmA,¥kÛŽ¨;¶n²aÕ,G³UAä Y3eU6UÓ´DC2ù.YD•P;’¬ –ª`²kšŽlÚ–,šŽjkª ¸š­¹²fˆ]WÑ5Ǻ"okŽØ• 0QR` Áì:’ šäJ–ÜÕL&ÁgÙå%Iºº«Û’¦ÚsEÕ2u^5Ä.ñŽ+ó¶)鮦™’+²åŠ–(ˆ]ÕqTQ¶ö€iL³mQ1yÝ2eÞ„§$)]ÅQyÙVÅ=`¼²E·Û•DG2mÇQ¥+). R¹ù}²C49úØþ—idšEqEÀZÕ°DGUJµØ†f(/teCW ùñ¼Ù5eÝ5TQpÄd9&HRUyA—Á4-¡+IŽá™¦îJv,×Ö$E&lÓµà/»–nº†¢h®ÕÕ4Y“º–¥ˆ`á¶#«ÙšÅ[šìŠB×0,½+ÚºÓ•4]3ºªÍ˲¡j]Y45Cul&ƒ·Žcš(»’ âvyÐ-1WMÐLþk]Œ@±MǶºª´LµÁº]²Ó²yÕ5»Š%ʆå*–àÂÆß&oº68ËPLCµl"!]–yKC4×ÖK¼Ô^)×íÔ¦‹"–y#4TlHà4ÉMô<,º§hæ%Ï7|O55ô|YñB+‚Äûºà˪')>–+!` Áã=EÄa¨¡(ËJ´SAóq* Ú«ªæ ‚#.¨¼Óž;/дéTæÍ“Àš<ÝÀ¾J¢¬ª84´P ¤@Ñ^šªaXÓÝPzÁà$ROa‚…ùÚŽÀPUËFAÚÝ.æ€c{ ½eNQnÛPÇÂo›DŠ¥‡‚-Èí¾C~',½zùà´h»Oâòm¯SÌc¹[cD¥ÁäéêÙy¥°ÅäëXª¨!Ö;Šý£Ñ•2÷ÆWZPÜ0ü T‰QÃÀKLÈÚE³”ÛÂñšR;ü®Ý7ÊõsŽgݽã-Ã3X ¹û0X$p·Û˜T¡a0íäБUð#®¬º `¢·cûœãêpž+{ ¬-ÛòØÁbA«ƒÊã#åÕÊd1o‡­ä‹vxËÂlÐꢖ!w¿®Xª° øKj³RàŸ—+Õ½¸Î¡í‘YûÉ¿+0×PñŽ_ZB¿ÔÙCÑïC‰÷î»3‹qÀÅ*F5ðÇÇJÐÚ-pžÒCû¾,›±f3F ½îAìj0ãhŽaÍ:à°Kܸ%æÑÛ¯ ^ÝÙ`®Õd?mµÓ^Ê}ÀŽ«ÞôNr Ù(sç.®}Ù~õ§;“'¢RÛÚ1…B¬Ù€hf]Ýêí¦Ì%¦ß}+õ‡ë$i*/U(Œ@ë£Ð¬ÅkyúË&ÂÌm ó´vç}„‚’‡s>Êmuít… ¾ \ü±ˆ‡gä¼Õ)HGù‰!fÚea «•:²0{Ïdäò Ç™}Ùc4”,vR>8vç×meÇÁÒ9;á²€¸é^ä©:giF& ²ÀU8˜GnšH#é°Ø„ð7qAD „Íy1¶õ@:ŒóŽÉo¬’uóöˆòà.±G{¥ñðÂŒÙB,µ†tAÀ›·ü¦¶#¡¦Ôm#g×`ãn'M%Äs¸ÂÁÚø6nÙP+¨$"sÿ ©o÷fNs$êŽ~ u[ Z¶•|¬ŽZ`ŠÃY8<8ë€0‡v ¨Ö2ÇÆîkd¤UV«iŒÛ níNbÏG›ED¨Ì£¯B-ÓÒŒé±4úgNó’v‡Ü<¬žBߨ3œ•¿lëF$L~,]€è¥^X,†Û•ÙÇ6lœcœ¦ÖázƒBØéÊ€qVYÌŒ{TðX´P(æŸðoÑ–m?vuõ··X'Ò7X¯'¬§3Ö»çõûXW¶ž÷™Qž±$«)h)S稓ÊÖ”klÖü‰«^tZÇæiv]cÑMt¦.‡VI¦ëô±GôÇT¯*[²U¬c.ë\d6e¶I¶G!kèº7I»IGRZS­”fÍls¢K„ Þ<}•‡^mj†¶¶Œ ó§*E–3›”±É…~’Xc²EQ2sÌÈCC¸½.4\4q1ÑOGI—KûÔh©ð™¼L]_Ö£ÑrÓžô™%9Ë»ËPD¦Sõ•CÈ¥ôȘÜ6“K&[¦´¤ÊAÐ…çPðP©${Õvïjï­›¨¦BÞm¶–<%٫ģڞѻ·…t‘m*Òoaýt­9Òìê­:Ú»i¾f®JI”Í–n¤Õ9GSž‹³•ÍÍÙXúdŒ>Ñ9ZAg]fñ$ÙÆâΣR45c„Zë5¨Xéª1’›£i:9¡Z3¡É÷¤ŽvœÅ ‰^Ô:ÓÌ<ã“(±ÓÖ×󨧎&]X²6>lfÒ IËž¢è>VI;ºûÔT‡7µR>éN²­UB¦ÚHyZÙü%¯´³°O¿D¤’Ð1XC^g§cDÓ NÖnR§*$ý¸LÅÒC­•y‚ð„Mò¥Ó­Æt©kºLEt] 0î$-u tUík öɧ PïÓØ\m´úáÌ«ªk†›i&.«%3*b§ÊÉ!.têž&ˆ ¬§Z ¡Z°ZÎsLIγ1˜äeäRT ž<¹e}‚î—ÕªpÏ$f6ÛVuÍz±Æn.Œ(—Ü^5Ó;ye*‰™•çÄ‚µ6ÇØ¥|É«n½dÅD৮uò³$½Jü"عP£ Z×NžèwÖªGêt˜ÐN¬q!(jíR±š~ƒŸ‚k˜ ›I±6 :Š’bÖUD#-UMZzK¯:µGú:ûäIBQíBùó6~£7;þrçrœ„-d¶÷*çœX¿’Ø’L^«2(Tº]ðMÁ§Zœ€Cﬡ-.Odõ즪ƒ1'£ž€…aKÒd˜˜TàB›àç›Sc8Ñ篟>º?Eõõ›;«.³ÑTENd=ÄyГV绚~È«y2.ar|ç§Nœ7],NQ²YÑ Mž/•xažÐÚ< IMò–“®.&þ©M­Aì’J %‡ J-DÒz†Ž¤-Á¥ˆM²Í¼]”8Ê–i²³-p‹YŠöN)š]/¸aú5Uœî¬4 ÍÒø.PW.©ì˨¨B„äurÞ—ßç÷#÷"=ª×émžÎ“©]|¾šç®¼“Š—¦ƒ€OΟÈv§×ÿH‡B}»yâ“D% ƒÒa:uÔ뀺:C…Æ4ÛS¹:p3µ–Ï;ìÕƒ)˜ú-æ0 B¥‰Œ†a‘3É¡X”úÕ‰2D(cÆ,%W¨BçrN²ú–["OZ¢t*½ÚŠ`†€.‘{YñXI™–5$hUs7sAÓ-c˼=YÙAn°]Φ7ôJƒq³û–Zfh¡¦ÅGýë¼;ä¼?Ohr¾oŸOÛžÔÏÈcÒ÷óÁÄ/ö}ûõò°ØË5äŸnn—qs5/ZÿúËX÷ùéÓï®Ò³Ç§oêÞíùÕ·éI7ÚÝÝõàêƒÎwŸ\ýçæ9ëùëí‹çÇíËç븹ùèß=ûçÓÇõêæ—ù¤Ä—¯÷í”Ûyýþ ó.½ùxÙg?<- K’~ü1•o/@»Îï>üõ«Ë-‚¾¼õÍ{[~x±NŸ±]¾ñãÿh_ºHïmúáÇ=ÿPKŽ=™'¨lê• fltrimpl.hµTík›@ÿœü‚CM÷­¡ Ó\ZÁ7ŒÂƒÃ˜39jΑ;ÛØÿ¾Sc²Ö$ÓŒ~Ñ;ž»ßÛóè MØŠ$ðä/¼Àõ<<³ß´= ¿ôod2r²v(ÎL+@>ž gÓé}í÷øw*â ([gLP–C¨EáWñˆ#N@(–½-¦ì[.¼ŒSA3 ¸È™bÇÅ6šÏgTo}„~I×[îHô:.–òb”§¢8';¡$QʉZ–·À.ε$Þ‘ïX)ùîöòÁípT)¢‰ …p­ b+ ÀÍ…ô¯ G8¡ei kp<¡Á2ÍâWÊÖj™_¯¦/ÊìßÞ5œºaà…Á'E&M4à"dK˜Ð +%h¶›·ôñ&bŒ¤Uój7BéçRª)ÌííT—€k_GŠÊàÞß<˜ÚƉó“`¡ŒÔdøn`ÔñÉ®V^ï»xUÿ ôª¨¦hf„V€Ÿ^ ÇA–zFÔ?³i ©}è¯áÓE€Þ6 öå"?W.`ùC¨JñVkF9 ú9Ž{l»Ssf uμýXÙÙŠ&4Z¦¤Ã€}À\5ÝvêfóúU•8Æb‚®Œ^®i¶nÃñ |†ÿé <@ç?Ň4òt‚bk×½5¦TJ˜ÜõÿPKÈ="8pÃagcm.cppä<ýWÛƲ?;çôØ’“T² heC|1ÐcI|Ë×Ã$íM.Ñ‘%²åJrbÒæ3»+iõe!í½ïѤÝÙ™ÙÙÙùÚµ××É•5^³¦S²J>n9bNl2õL˱‰;!ÑÈ!ÓÙÐs-bûcZ†·äWÇ%/M÷‡'?âL[¬éLP9î N{ûÆÞÁëþ±²ÜN#ÿôTÅÎÏ~`ÓMòzÿÈØ3Cgk+4ÇžY‘ëOÎÍ¡ç|Ð76/º?<ùä{fäzú¾·¾?q#×ôÜ/ çriz¡ÓEBŸ|×–†½Þ??ÛÚêO¬À;“hߟM"'Ø»j 0öÇOjÅΓ‰£Œ ‹¿ö‚À¼mìy¾u3jŠºÚn’– ľ Ù­ã4pB'øü\ú‰œ0r'W‚!›quiŒg^¤Xþ$ŒÈlºW¶Ff@êf“”¶›ùK°Ýl“÷ÚŽÖ$ï)þ~‡ÿ(C-º:¸²Œñ×Nԛا³h›j’=÷ê`b»æd—CÀ {‘9‘bªÊ; þQ•cÃ)î$"îŽÖ%î6݄߆J ™I®w´y`®DÈëÝݪ"ƒª!ÄÖkøÁ½ ÏÉu—µ¾×ÈÇhÿf@¶ˆ&ZiÒJÓV„Th|N(o„gh}Gww©Jþ„'m{{“­vj¬Sc‰‚ÝlöÏmî@Ûö6ÙØD |,+û'ÄRSŽß©Ê{Ê{š,¾aŒ©Þq‰1uñ`u© û&t¡U¬s ò7Ù£…œ—~f!Jävo‘ÕbõE!¨@·pÚ4dMå& ›º…‘´8’GÒ Ùœgתw08îW,–˜c2 wØ}l¼ì÷º©Š‰ B!·ûØfN¢p³ýmZ`Y²FZæäôYz¾O©u´h¦6Ô,ÍÖíR ÀTÓµ–ÖÖ6´MíEnd¡—TcE "&5fõüôPì9µ(‚<ºÄס¡àÌÝ£ëíO˜IFÔ®¤i1ý㷇Ɔ N²/,Ðéä™JÏzÁB÷ÖëèÖÎ1rKl\C‡°Ù 1©“ùGJ€™½À2ó¾ ÐŽç†—`q8†‚crœ¥{éZ 22½Kâ_"B3$¦D´I>\kÔ$öÌA Öü’¡!VÏaÁP“˜#"M4‘îÕ(bTlê‡.…M–"À“ï6Ó¶!f pÙl‹9\d½NŠú†z$ 0À€eGîeëL¡š‡*ñh HœÁ#8G—Wm ¢D*‘b`<£¹‚ÙÅlC+ŠŠ"úúº¿j} ÞíT÷Û@ðfo‘ÐqÈ(Š¦[ëë°ØÙÚص?ô/£5˯¿sÃ™é ¢™íúë—ŽcMëfÝv"ÓõÂõ-ò™ä-1*¶€ýt æ÷KSelÑâ Ê…žçÆMzTÙš.XŒ2`xÐSN¼fibpähdz%ÔÐiÑÜXä/žT“äz+™à`å²²ö榱PRaÌ&SXÏùKÏ‚0 i·’ò¬ôxV"¨(a8óJ ÍëWÆÑÌˇyó‚YUšÔFU vÞ5¹ÜRV_åHª6 M4&5‰ Ù˜Ó8"ËØ[®EMfW5œå²²ýâÜþêF#ˆåÎœðvb)r)qM‚Ù7"rãÜzÎä*JDylŽw¦7sNM¬ëó©˜ãPˆ•y‰}w:r²¥—Ò³,0x€Â$ ­qÞ”„‰¶ Â…†G‘ÇI"ùq‡œüÏÛþÙÁKcïðdÿ—Aÿý‹t£QN¡?ù©«Ý ®f˜x*=ïÊ@cœŒo•-Â3  ÉsæÞ-¤”¢ÃâsO4ñÁ`n®Ä|K‰b— F“\Ã$º÷nØ ß˜![fEUãTKCóþ$b‹  Û[[‰£V@ïÔ.šg“iÀ ë@V͘Û+Ä ?`²‰‡ g©òýõÉvEÆÆínbF·8‰ûrÌV*ÃŽ’¾ìîȪ dj«HŠGˆ‘uöÀ2Haÿs(€<£žLÑ'Ã2ïì°=±ÙþÅà=ùÊA6FÈVŒ£Á¾ñîàL%ÏŸ“ä ù¢-MÃƤm›Ð6DŠÈ ¬sZ+ã ÁN]Ö#®&A|aÚ¬šÄÊÀL˜_¡„»DÞÌTÖÆÆpv 1Ï„(ÙV½¸` à’~àdÛžµê#±ðŠÔ72ÃìGè}ßxç؇N¤ˆ^pAͲ—ß㧟Øx¬úˆ[$kïƒTŸ“ÐW$+‰í%žwÒóXDÁ-»ç›¶0ÃR²3Ý,b¦j5`iÜ8ˆ,œgàÉ`"¾ÓÒ¥:M2½MÆÝiÂÄ# ²ùã Ç*ñÈ7MÃ&GyðYqJ1xR'Aï3¤SFcK|@LbT˜$ÍÌ’+¶p{Âؤ¾-®Â$Õ·o¬½ÅK›­À¡¦IÛ/5BÙ œ¨­è´¸ÂWôæè>ëð J[\,Š»ÞQëúÆfn6î{ªno+”®Þ¨jŽ¥´œ'äÈw©Èf¸™Ÿ °bÅ,˜A}ê~‡úP­oìU„×à\^ïè]r½×Bë;ºèåÝ7; §›íkø%æ€?Ru);‹†rݸQÙtr×e7u>ãZ-￉½GåìkÆe§®úÇu~i± §¬B$JÄâ¬S›kÔÒ»åcXmH®™Î…Ô¤R¥ŽÊ&ää&râLÔæ ¨;q ºˆß­Â/WË).„ ¿RI5®/˜)øXl½æž…‰·ˆ,{n3§r‹éUpð¥v¤%dŠKvaF[ð^aXÐP¡uƒªµ-/ò¦Eè-‰‘w#¯Âûg³ÚËM–d¯òýL†y ¿Å¨uîj2þXlÙÊGÑrÈ­ Y*™F©ëº¼9ƒûë]Œæý§ÿX3ÿŽ“öX®värvaÄ0úÞc~ÿòØ0ÇVªN99§uØnòéFJ—þì °0Ï«ãᯙãŠBI¢¤ á~J ž3)+.XËê IêÂYÙ‹4! À1ÕAÀÞ·¦·J:RyàéŠþ8ñáý èb–AX¬´çô4ZèAh·ÄíŠ)ú{uˆl r ý›ÞàM6µŠ}7N²Ð@jîØ$%‘÷fÑÈ™D®i'Ïî•Ìkî'Ò£s¶šv}ÍQ%ZÖ¬¢èâD4'¸xZqw"·,߫逅§TŠ‚Iø—ÅÀ‹)@“¹à]áÐbdª>KL»Î ·ç/ؼÝ$sGibê„wJ`ø`ôß œˆ wlXQ°Æ÷É(ð'˜Ü˺Q‘wÇÅ>ñ ‚Å¿þ;…ï ȶD‚åܹQJ§tWådSË+¥‚ÄBÌØô^š‘Ùó€Õâıßí¢ÒYéh3Þ=l\¤I`ã{4)fâ`!Œ 6ÈO½eS²VÎhrf9 Ì«±I>›ÁÄ\)¶¢Áß"í-ªbåç«ndê»x¡…ΕâÃOÎpúû@Öá o‰0ýf:ã¡w›Þ*b¼!ª»ÞºÌ¥ðÃg8~ÙïóÝ[¢‡'¿ êÂä!¹–N¾h±*¶tu®us½TêUæÚîn+1 Œ.c ùÞVÍ`¨”$š&qÔZ¥û™®2@ÅþYùòô©µ» ?Û«tKSëmU}®Í/µ-Ö…êöv[EœBRÉíŽGæF±úPýY™?}j"OIÿ üQ™?+å/­[Çüá±öÉàÜô_½þù@1U¢˜OŸR²»K^Ôã ~ð¦ÿêÜè ƒÛðÛxƒ ð¦Å£»„½ái˜8a–¤ôB¢«’˜èƪ½š“”Ô–<æ׳J^ËeôÕååÝeR‘d“d´»+É(ñY6ÀKµô½¡óñ§`ª¸˜ÔZúóo΋©ºH°,ÁN€°Ø½#¤ËÒåi‚p¸ŒC}9‡-™Ã!]Ž.G˜rh-ã°½œÃ ™C‹.GH—#L9´—q¸¹œÃ2‡6]Ž.GÈ9ä%ò¬ÖîpÍkŠ²|¾û#ïgŠRÕÏÃv}Q?ųŽ¸<Á}G ¹ŽÂÁxq‡ÛênÏ8Ô”¶4¿l€ÊžÝÖº„_Ž£ƒ_îAÈâ„::§3ÔøÅú.Ä#üN¼Dçø‡êEõ£6ê! 6ê¡@ÍÛ÷}°AˆÙô¤› "@ÝU2‘‚*pp–ÞýbᘠˆY fÒäbG®ÈV~$‘‰ã`"ÊâÈ3Ó1ò­ùl€°àü·Š*rK?Œ~é°CHÚ0^¿Ý7 qng†cÀÆø3D‡Â~¯¬áY¿g„·“ÈœC€4 À–Í»+ ŸãIŸ'©^e®³ìCÍ„Nr¦t¹j§g'ûäÕYïˆ_# œ¹1…#Xª+„.kLì|ÃpÎÖ@†ÓÀ÷ü+~YÇÿ„ƒ!èì¤ï6Mð1áZz]ÁÞZ Í©qvðZ±æ`×q k¼"Y d#¬á"˜}„!Y~0ydíZŒKv&½qúölÿUgS© çjIãTX²õNÙ‚A@Ë€,¥ëªjº°YÅû­³™"ðSFPØGE®9Uûw³Æ¿àƒ,• >S6JøJ4oÜ­iD% ÒÒËi~a%S†Ç›E žÄüÇ,*ššev†Ì¶efA.âeapø=bJËË*jnÖ5g8gýZÒ/¯„cB/póæà7åRãÿ©0ØÏ 0åq„#¯Æ)ò…Ãeø/óšcÃ1Gµ&ÅÂm4ÉoGGL§çgäƒ,üFF.*°{•¸ÛÂÍ6“ Ý,c<7­2­ï8)ý~¸eEe–^”+07w‹…;®aàÙ¿ lK0ê¿3;ÞæbJµ0“*Y‰®”¢Œ0UwGµÞh ÅÅ[*ìERAÏ[B¯ýô¸f eÍú´þbèC¯`»òôŠÖ§\¯†Ð+óáz…ÛË-`%±‡+Õ‰•Øªo™|믜¼þPbˆ*oÊx’“oÕK[[9gšÛpEO¼ØÖ´Ê•¾”‚WA¡ýMŠvE½×üZß}~úÃ(”zÈq~šÓÐ. 3Þ‚Û–ø(¢§ @¯F¯/B¿‘-—<*Ý(£_“g/™Ç‚ q·#,a’LƒÏ¬üêúE! Ã‘Zy@)Kw£zú‹¦ßÎ.™>½ûôi ‰Ôò²4÷ç-K€S«D[™ ˜¶O,…0æSAš!ôO¥v=ùҬ᭓ªX=›^¥RPÓ,òäTÎómó9dmeÍŒ¢¸& Wàg‹$+Ö QÄ=Á{…ˆ+Ðø6€7©-/¡¥4ä¨ÆÎØnWвð÷3ÿJ|OU“:?ÎÙH÷W2µY&îý Sš”Øs\ƒÀgQ œhq™ƒ¿<ͧÉi)è™8Küz·âÓKy¸~X}gq9ç¿©|³´’äül-q¾¥EÅm^«¥uÅ­·×ñZZã e5ZRã(±k´¼ˆ‘5{ZÆì‰Y䢺»å¹Uù+-‹Se§Õ^Z{%YJÆ43×!¿UƸ„òrhjÞ…t.–…ø߃ºŒ²läo—þ"¯VeI‰¦>jZó¨a}xXð×8ûENÝv³ÎýáúþN]ê½r p—3.qÓ$§ìãã2[‡f½qLÛ øL‰OŽó×ò«ÙŽŸåaÜrÈ ä¸u¶8‰Z]Ï¡m¹ì ÙÍv×lu¯ŒA¾ío–Ò êa©ô9Ëe.Qìz]Jæqò¤,ç7[cQ;T>ïÖϵåP!ö‰vz½ýbpkN'ÍV¯« ZT©’epï0‹4uú’YT‚=Þ¸.HŸYm¶\€¯™'dàsr²åxÖCˆÎÎ’ˆ$—?)áN µg‡ý ¦$}Æo`Ó>—‹7EˆbTôñ;©b€(Uf4pä÷Ñ¥AQJtŸR‡ÙûÇÛü-Üi4Ùï=Ï!†øêxËpÁæl¸$JÐ.u:TÒ¦ƒf´+ Ê8cLÍü0ÔbL#«CÅ»_1M‡2¦cÌþ¨|žöF9Óã‡T>€ ¯!îŒÁÄì7¯=gÔmÉ­|î“|¹P¯WÊ…eä xP×”ÛÔ·“ô6!n¡¢rÖžo«L®ÚàÏ&>ïƒt¯à£Ÿ~+|<ÿ¥R(ýªX°-øž »À:CØKB¹Eü°Ëâ–Š{‡Çƒg=£Ž€ô9ÄY´&Uíº9¾6[½ÛöÍØø³«©V³ÉÔmûŠýÆ äĆ[y &÷ ä4à£C‘lïÃl]ªbƒ¨.…ê`H™/Èû%õ©+ µ]€œlõB‡\Úu»Œ–OoGÄ€6ÞTG‰{TÈPš"Ü«íñ³•…:ßò½ô𤷌a6.µ^’ÁÿUå5ÎBf÷Ä©§ZírKAx6Hƒ#F&ÖLBè£ßm/àJì>¡JÃÙ'£ƒ…Ò£¶‹¨æV®aú`– ¡«ð‚ÿŽ¸­< º'%½ ÎÔÅ@YÛ £ç³§tÉȶäb¢Áh£Ê06¡Ip—H=¬ÚÄŒ¨¥˜–ð$¶,†iNLCìK×ØÍ} |É°¼ûÊï4šඛNicmJL^ÑöË´Z=èÿʤ¶1.=ﻉO¹˜y¾K£3.ºÇÝ«†­°vU}æo¼ë{¾ècÒ·ûK¤;i“†ÉÍ8n7Y‘}¶{ÿèé×)Yø0»8YH¹¬–JëõúL#<•=‡3ÏŸ—Öìéª5ðO½D?*™‹Ø×ÒáÙ ÂìmódzuýhxMŸ¶P_J/‚«'rJªCBƒDŽóÿè  Su„%¬îþÛª;èè3à6›å²ÿPK=D“Í׋ gf2_32.cppUÛNÛ@}¶¿b)µÕ@l§-ɦ €©ªª"ÑÚÞ8+9kËޢ¿wÖ·8"…FJ´;—3gÎÎ@¯á™÷?IàžR.%@EID} — ’µq‚xEÑâmà'ãpA¹®qáGë€Áaâ/O–‡-Êgþ®¥ª†6ýv|3ypÇç“ùÙäêúÖ8O7‰Œ]×Ôõ«Kuz:‰ØŠ õýfIžD£vÐ.ÔGÏ?™ÔÿèÚSœ}$õ"öûËã@×Ê£õ¬æj«ëj¾Šƒu´ÎÐÌ`Pè€õüÕ*?¦®!^ïìÄà ƒ‡CÛ4} lhzÕ5eìM~ångì…|UÊ.àüþ—;½sÝùåøa:¿¿›Ž§£ï /3ÓX¦—ü™†×…¾õC%Vͧ,Cµ0¦,äuÔA×q G½8q¾ €ˆ5€ãc^5ZF ¨]`j šQžId[bnÂçÚ7õmó±lå:€!˜ð½f5 §Õe •Bí'nxˆg™ø*6ðK…ÄͽTÿ—§øBýp@¹O%ÏÙµÈYš±í´¶F´µ!ÛÔ´^làËæsO•"5+ªbÐM!.j‹Odº h‚—¥BˆÂwx¹¥1în —kd‹FäÐ"ÍÔu!´ nR躟Ü"Vr›Øøë[Q YÆRi„j@1pÉ#Æ:»;SÍš‡ªA5?ùö¬¦¢åÚzÐlÁŒ e.Ž¹Ó*„Þ¥W‰® mb+ðòºgH¬4t:кۊQ‘TwpÆ¥›¢ÒjbQvmØ…â­˜"£¢E)gÜîj½ßǽ ‹“‹d |üBÕz]½¹UVÄ/”jh…~µ$E“8Ð#•ú~“Ö[2ΖLóPí—*Ký ýp­Gl½bûv¦–hû`r{¡ÿPK=EɃBÓægf2_32.hTOoÚ0?ãOñZ$”HUËÂej”ƒ”q(‹h«i—"'~´–;slº õ»Ï@hÃʲª98²ßûýyö³»|).a4ÿ‘Ü~K’Åä*X ‚ÅWÒuË\â‘ér™ ËN3]Fðôüñ”Ùð:¾I†£xñ%žLgÞhTIârqq“+/¸>}¸„|Q¯{õ߇õ³ÃÖZ5{=óv³™ÍSÔ”¨©QzZ>œm½ð©42ˆ ïC¦diH§³Öh¬–à²Îk~ßzòüp£•*% þi©ðö²ôl_-¤o™h¥aÓ唹‘›Ê{›Û?H2ö^û‰ ³ÌæV8ó/ ½ÿQümS®P—¯xzs¸±©Ñ43õ÷.ìoôþî†ä9l¾Añlì^*”Œ/ÉPKÍ=†{ÝU%ëHgf2n.cppí<ûsÛ¸Ñ?Kr;¤$Ë’’K][Ô7~5Ÿgǵ}½¶žÔCIÌX"u$Ÿs—þíÝ]€xð!ɾÜL§ÓÎ\,‹ÝÅb±/ÝÝeÓI/l ¶Ãâ MyÈüpÌ3ÄÇ,YzÇÙb9œ#6Žæ>´ Ù<`'~P¯ÿ!G³å˜³ï£»öÝwØ2 Ç|ÂŽ/ÿ~qýáââöìýŇËë+–ˆ°nñgS>Œ}»ñ!ŠÇ‰Ýs‹(šåF'9tQ ê¦~%iÌýù ^??|zuqx|z{túöìÜ9ŽitqáÖëÑì1Œæ?{{ûûö·ãÖ©] …|³ÏþlÉ[, ¾ðÛ” ƒô§é[¯í³˜O£ M®£qŠŽîE5?Ixœ:„Áó:ì×_qDQ9î ãÔëµ`ÂÝȬ˜al o:™'8€–+ž 2ÐÕì¶X§e ÛéºÚ× f5ŠÂ$evã6KÕ„Ò¶ÆJÓ8ŽŠp‹Q¿IÕÏ°V,Oú–>Jü:_·<~ËCûi³í8œ*Ù† ¾„( UócÊõïî±&ëÂT¯øè:ŽfÑèž —GÀ¡i[Òýô·˜€O![›Üã8Z8¢­%¨°-¶‡€'|ynxAÄ…iÎfBž8E¥ÉåÆÆK¸ÀôL¬}SÁ¡¿ˆ~Û“+QæŽJS˜û[˜;´«É»Œ4>›·$suöS6ðrŒHñv2ä\âðl0`Nƶ¸½Uö*ÇY‹Ðëb¯Â*ë6»®P€ZRŸ'Ö^Ãbªt˜Z?A½|ØúÍø>_Ùœ—•mC½˜Ç†ÚRGñ)õzš×q`M;ÊÌ¥]ý³·Ž—´Ó$íV¼¤û3×Û3wà&œ^ð0õ7ãUÿ|¥¾v ¨ÏWöçëÂôR>‡T´OÞ:Ô! X<Š¿ Ðn!LëlÀ|þμËÀ}cÖ/ü8HKùhtÙƯd!mA_¯.|5›È>±Rü{|ÔŽ?Kó5, · ìeîޫ΂¥É>Lm‘ AG#½ ’'‘úçzZ:žÎçr‹âbæZÃZ3@ê”GÃ\"2l›¥‰\&‚¾h].kŒoXI¢93ÙÒ?Ã’úBÍ*BdšF+¶d k].IµsÁ5³zþœ†íMfeBÑøbK6«Ââ¼6¨V€å^¯k„¢$Ѹº>yvîT­ñ $×­~Ie£XYX—†sžüö¹ö¸ êO¸¡- ¼aû„Oc.ŒØÀ³Â6Â0ÊWb]£âBµæØøú !\ý´ô!Ê0mr’B¨1ßäPØÜ_Ütß`è˜0d}¯[ì{øñþûc‹õ ±­o ù ´¿ÙƒÿþÔb{оí{о÷=æDëdÙkTl)Hí.ªü SA}Âbä'ð©¯pÂGÓÛ“µUÊê5 ‹qÂŽð,T#ù´Ûs]¶ÅP*?o³[…ÔF /ÐEݸhv| ËërLáÄ„­‚šÿ´ŒÒrüò[cŒ•ï†1!Ç­ýI«ÒÜ Õ~ú\W«G"ý¥R7ì‘1íP39^o”œEÛΙŒ».ëLÈGÆ·±)ÑQeØ­ Œf²X¿ÝN 6*:R9æNÞ>(ô«Ì„‚¶–\°ný«˜ b‘ûPãËìÇÈãG Ëé³{€%;¡ =¯ëÖvwY²€tÁŸtÂf„ Õ{'1ÿi s¤>YTÇÌå +ÍwÁŒC‡(Š.²!”²ã¨%ZÇ.$¬‚1ê¡_й$»ª,ª8ú‚y6›B}å† pcLÛck^šÙ@:â°BUBg‹ÚPŠÉ]0)*O±]må 40Ô¿eö Á*÷ÛHLãÛHrÜ– ˜¡!Ãì&/A-¦>…©’åW#¡\…ʵ¤#š –e´Ó%KªáUy©&=±L#w4NBh[acHÇöÎOOþƒß²I›ze¥·ÍvzÓæ í|Žb‚Ò­UL¬OV+æÎNN1+T#4îX*!ê 9•hV¨DYIâɪ±Â|çc]:B$ i¸ð)tƒoC4[ÐFѬ’Ú '_^ßgW"07b’æÄ»¡YHc¼QEüžYUÚß%f"$÷H‹%s6ãñ4Àê–ä°0ÐNGíú•1¾d"X^•J¦¥0ÙHVËQv6Æd1ocSlU`ÌËž[³ûŠbèŠÇ^ã‡@_/£—Ô l ÏÿÙÄóÚÄÓ³ñÜYxÆ|âc%ÁÜ5ïÙƒ‡/´Õ|á¾ćV÷eç%Eröâf âê£TÀr;¾‘ùì"IáëÍÊn®¦@ò\.@7n>zßuº½W¯¿óǽ?Ÿœþù»ƒ2ðYô÷‡#˜-‚k¸ûÌGèVªVŸÈ¢°]ö‚¶/çölƒ¤×gæôÌ"嫨3ä+u' 8kÂ1 ffþ@Üü¤üZ»Ë¶oê£\Ëw"A¹ ‰‘Ôl{þÝ¢Åu=¯CIJ•k½´½P†@.åz¯ðvTUúó«6ïÐ]Žfêøá ])ü0)9ÒF¾ÈxÖ3tF6€ÃG_sÌÜ–¦ O/*®å…‰íFþ"³²Ë œöEçÀÑâg¤Úïa»‹Ù£Ï\²¨üb•:KÎ☗£`8ãVõM{ß1(²Q¡Šë{t °–7Ä9Q¤N˜\:©{`0î{ãÝžU0ë­J[Ú« »€‹´lfù©Û>K~ƒT]}²œð×¢O3Ûxæÿêõ·î_€.âŸ5«Žw­U[¿èg%Õ‹ ¿ù[Uiè’ÎWÅèéŒÏ1Ï•ŸB¨—Q”Jæ³~ðszѳFŒˆýƒB0¤Wn®¼3‚ äN\¸÷RÎËÿû³Éuìø*VäµÔùVyž¸<—ÁÝ­ãÎsæxÅ@éV GŽÇŽdTþ¹sA¾ÁôÝ ¦¯¢Ùgþ—¥?ŽÑ%`ô†nÕ Pe%ûÙuÙ îK‹= V‹û¦¸1ãpŠ-ã(ËP2Ø…Su-Õ¥{©s‘||)–_ê¡îè^Яj©Í)A•®‚x aRZ’M_dÓáh´œ/ñ‚“3“†èÑy@éA y!Z¿b¶Ä¤‡y€í,6ψ¾ä2rjÔ ä»ßfg_‹}m ï˜Ù Ý|Cv»° Õ÷ëŽp€Çûfxà Ûðj¶äO ææÝì´Ã‹^þ…Ÿ=úÙCOk\Ã’‘Š³}—;†5Š›vv€TŸånæ’øåŽ(Çë»2:Ã\UÜ{¾væ·™µ2ŽjŒ.ʉô~Zu­¾0tºn–R é5VM èUPvóyôŽ‡,ÏošxÀÖºßc´eÜ|¾¦‹îå„è.÷M磇°\Q߸Ҫqúèu›Iœ¸ù•0h LD­*¼*¬ëJÃ$®W#ìدH~‘(;Õ|u¶lËaC¯` c¿%17b5Iâô7MªYÍã¾B‰ìŠ3¿'Šå[}H·@ Ýhøÿã?\1H ÊnYµ‡|*ÒüáÆ·6‰ á_VHQ-ÃbÚ·ëÎ~î¾W w*Ÿ4ÛÜuƒ¹<³.PÍ÷fnÚöR§ÛRŠ-–¤7Õ×–là\¨•^¼ç¯¾@eÌ;”¯k…yîaœ9ê&^ù,N¼ˆË?†›ç6ÈjËÏïèß%–šøø·dó[ñ2¸å7ßXÆbâ1:êæeuuhËš–ŸÿÚhe¬{®¶-ÁN¥½(±-6tÎ=žTUÜ ±º,ËÞ*;—{P9nÕ Š,”M£šcs@`[²‘!Ûk¢Öoî'xð -Q·ß·W”‹K Þí_8RD^=ßõ'­ôﶥXÙ /†o·Xj¥Tub³±"ÕzÖr—<0Öf©ê…ñZ*ÝØp… [ñRXAÔSiË*ßË'åõÎvÅ«!øÞÿYŽÂ—Ù{·ÀŽ~³†ò¼ >*áˆØ¸6¤²âùýÈ銮exöÊ)á?9C:4¨^w÷÷ñTÍvâ IƒÑmúÝÒé©ãjÁ90Š†” \Àð9‡ñ‰‚ª©?ÈØÑPª°*ȧ‹#? ‹šÞxCZÓM¹7I5`«â©-îÅ£X›‰µ@Õxœ/#¯Áa^m×ÛN†™Fc~eŸºè´Þ¬ÁÔNõå‹.¯*üõøM¯Êßûq´ ÇûÌ_¦Ñí"ÙÌÝ'hÄxê€;˜sá(ûFoø2ygø µAóáì„Vïb¬S#ò=%OõÊÈ”)“•Î,l«ô xd°w êüãžò2ÖÕÎ6Ž=rE¡«Éfj ¯Û£¨ñi¶8X˜‹€Ž«>È ²C‹õ µè¡{úJ1Väª R2‘Ò ²®·!\&™U;¤Bn$¸WrÂeÔB*Ó2•6œÿðîø”ý˜‹ÚxÈO¸ÜªúÿÝçôü¤^ÿÇÁ¤þoPKÌ=Fð,ÀÛ .gf2n.hµksÚÆösøëdê ?pò¡c÷VÏØ@߶·m˜•´Ø;Z"­ìŒÿû=gWo! ý`À«=Ï=oí>õ6%Ýៃq0˜\~8îM>ÖÞÀ"÷Xi½v¸·Cþžr—‘½ÃZí ÷l7tymû‹¹t¹upÿ:³0Ûr…ý9¿:ã_¡î³|Š‹éêÁôÑ9¯Õzís4hwÍIǼ¼ê]$&ƒ:ðs¸CÂ]xbÆ©K¹¼']Á¦SnsæÉ€p\~0ŽëÈù«¿=„Ö/Â9÷îPÛ¥AŠyq}Aw#œãÚ÷Ú<´\nŸÔ^!±¿=:cÄìÝÞŒÄü£kÆWýü¦žCÆÌ ó÷þç{í•‚pøq¬ùÆ|AØW›Í%<ÖÔ/Ô†Îâøø„hrÄÌìCT ¯^eŒ:€${þø£9œ˜ÃaØ ¯ó¢œ(VØ3óºN¾?ƧÓ|ÊÅœ¡1„^Àï<æ€î$‚\€áEôêƒô’ù§J§ZV'Ý¡Ù÷‡yámŸQÉ"°;òüõÓJÌðáÒm)üòVõ°pT»DÖ• …÷À|I¦¾˜‘Gá;¸Æû@Ý‘à^„®C,F˜g dU–ƒ\ºŒfÔ#¢ ‹KBÀ˜˜‘‚|ýt„gÇ>kB¿÷‡“ÎÕx´ß¬#4l¼fÞv˜'PQ÷â‘ÌBûžÌØLø „£.øh΃KÕ](ØnI)(¦°ì|cʼn&ÐJHWèÈâwûÌs8EëbÔ÷é¢JñjÇ^¤;Ü‘„']zRÉ÷ý‚á#·3Ýrúô+SáÏH& Ì‘PÒ §Sÿ}êø”F>Ràsù>²»Mž•mO¾ò‘Œiƒ q¤é.ÀåÀˆ¹J@€ˆxš™6<‡Ýù m/@WÁ#àÒFreÁ´Cö™ÅüKæ1Ÿ‚vÈ®ïÝeÝNʼn=˜jOò0Äg2ô=°O MÙ×J#d{pEn„~bDôx⸠&yDÞâWS¯‡xìót£gzûšA ⵎÀ±g¨,ÜÂ%—L‚„iÜ.(xœéO ¯¾Ó::}ª¢ â ^ô.Ä ßEÄ ßK*lC"¤4.2@…û* ¥ÚH;ÏkzRûÍ„Ç˳ÈÈ•Sí|E‰³•2XwTŠ Ò‚¾’ŠC£VN„Ãà‡I qÛgwJuò+ògÀÊ_™=ÿós"?‘´4®ClBCu´>ƒb®K°¿þ1rÚàÏœ;kåÌ~˜óóL¾´H;–Mš"–Q.ó†òJ†[¤™T%¤à\ÀÅjUmË"ÊF^Ý ê=˨.‹Wê`$k°!y*` éÜ(:5UæQ Òø©âhɽo{í៤?0‡Ë<ƒDÍø0vŒR¡˜§›ì|[ LŸT¸_ Xâ½sµ’ù‚JÚžS­g¤"ÿ¥ 7 žM$E2V½RGØlÙ˜ÏXðR©ôPÑé,^Š>BW< ]žF‡|õž£›†¢JÀ’™©1)i¯ÆoÌñU—|¸íuÕ 7W!ÐËΔXäë&œÝd* X ¨Ïå¢TRÚ÷Ìþ¬ÊîC ÚÜ‚rU.Ò¼¯»¬ y„ºtèò.àžÍÈ#ûÙgXþ~Æ¢4æqÉ©Šp:%Œæ•¦4‚êÂOáf„ç. BBžpÈ%Sná¿™¨HQ£„RÑÇqä0l¸uºL°6ˆ€ì?rxm>Zbp¡+ùÜ… \òv¥±•XH8ûUO4 ºK„ø¹ÓCj ³tUjL®¦Îk j.íªDs–´%¶©k‡.Ng9a݈X7pĤ<æ$‘Ô𻂉’-&}õÊâ ¹“o*‰AI«Eœ½/PÝûP ïª}~žaÙoè>*Ò‰ÊS9MèRJ[~£ÄÔ—*ÍTªÌYÚ×^õ·ãÃþí¾ ™bꃇB"•Îɉ€›ÑÙn6TàÜ¢‚¥”òÜç ¹“ZŒ]¿¿ÁwccTðˆÙØWvð•ö§5|±‚üpÏÅ×iÊU’Š:.¼â×Y''•ê¨ÞbÕk±¥ÓƒÈÝTŽ¨"»³m²;mµb’èBsˆAÔ'.eÚ®mKžt°çÄJþÙ„¥Ö¿ÈRëe<ý‹j:{!Kÿ¢šÎÊjŠy¨D•4˜Ûa‹¤laiimÊƧ­³‘”|›°ñvël¨’wc>ö·Î‡.—7fdoëŒèR{cF·ÎHZ¶oÌÌOÛ?Ý(N€Òûú>‡Ò÷U­Rzu/9¨®*ÉfsW¿Ý†Ê“\M¶¡œJœ÷Byã Šoèc¶q¢îR_ok  Y êk¦:ùP×M¿…Bb•>„ ùÌ môD½ 1£ÜëOÏò‚œCâÀý¿]rÐ3Çäøèè]-{-d26o×í±9é^·G#Ò¶ v ¶¼ÄË$Ed§k*Æ^Yf3$Ϫb5ø¦jÕº„ó Z2õº;sc§C,»†ƒUÕ ½³)Ùì½…ª¢>V­S¨9Î÷%Pé=Òu…Wn(<ö¨wª2WmM ™´â­M:¿þ’3_S¨Üpµ&ñizM,ÿÊš~wâÛ8F†F:[ ¸¬2?LÁX @`,¥¬‹«ý¡•z8ÍìþHÝ)¿ÍVmÖœä[¦»üö /e|Ófè ÷ýRº‡¤î±U£ŸûB2[2礠­YÒnåƒMr©du¬§±Fywþâ_Öå¢ã'­%×NVÎ üÇ:ôŒós)¼R’_hŽU8Z/ ³ahÃðƒTršÞ‡*‹õ=v mT«+bˆS/怃%'mžË¹*ŒzVIÜ©ÅW˜oé°dBâ,”x;¡˜? _Ö*,/sŸè™<7ØŠñåï<åM?ÞáÇûÈ°›[eqá]qá=·N¢ìX¸|z’½]¥ÕÚP8 @Ö‘_x€ßMC6ñûØWÀ†|§®ª®ëƒÁyEj?K¬!f;>õô¦jJ__dÄj4JäìKÈppÛ½§XÁ1Ÿïö壨-){öò“µ$kÍ®à4{[Úì]à}j}Å{2éô‡×íÞEw2)ݨ¤S¯Å•øÙ9‰Zˆô]ÔÊau§_{Eõ++H½µ§{oð*Ì´ÿPKŽ=-wJ4CP gf256.cpp…‘]kÂ0†¯›_qp0ZtZûÀÚ §x¡^ìn’¦Qiš¥‰N†ÿÝTÛªƒ±›$çÍ{ÎÉyÒéÀzõøôÜ&RÂìÓš À"É1¡ 0zCAš˜3I–b«Ä{ø  F˜!tÇá&¡ÐdÓÞ4®„si+¡Ù`-æƒa´|‹Æ“™;T{©³ùÜChünM½^ÄiJ…†2œ®™ä{·Òq ªcìÉD®Ñrv™J@ÑÜÚ!¿Å9«LkDÎÖâ4†ú°þ«]šM96Ý)SûýºÙ ÜR»ÿ»ëûÖXÛ>CH—i–nò¢‡ó+ó¯$l ëWT%À½Ù+ÐáŒ`Ͷt"¶TåôÂæ H¥ÕLŠÞ'gÝÁK…À©m5ðÅ—ÁŠ–¼–-Ô¿½;½÷ò³Ñl„ŽPK=Hk’ Ç·gf256.hTMo1=ã_1 Ú•¢$­Ô²â@`C9„¬H{hEþK^{뵉(ʯÙn`7På8ãyoÞ|¹+Zà†³ïÙ×»,›o>~ú<ÿBºÁ+5î?®Ô\ypÊíªpJ²óÇSB¦ƒÛô> Óùu:žL£áæÑdYLÈÅÅ Œo¢€áIºG(ŒZi“Kª€ÑR–„+Z–P¥ kRx¦$¿"·*p£Ž­Bª0Gí’[j3ªE`úM4:£–æèÐ&„t*¶¨‚æFxåË® Ÿ×F´u®ŸCtÍ^óÕVôךúœ¡£FK±Ð³úá¬Ê.´±( —1p£KG:µEç­†u^ƒð:Ȉâd“‰£ ýå©Š^’Ò³—ê€íóÐ~Ÿ%M?Кh?î²4â­ü?[ô=pîs¯‚ì-Cï¯$Nôm¹ÃÓ˜àÞ3g)wïÕ|?NfÓ,¯µô ëIHW©pò .7E~ÅY×ß*K£ÞÃ`:îÝ æ׃»áH»A•îx¬7›O JfLÈ¡#$u$§’»Ž˜Ç†5½ù¯fã®?í]L?õ®ÎΦÜr˜O$ˆœçŸ™Ï—<"u€¤ûGmØödt§é-Ò9>Ö+xºšâDÒhR¶ø!»ž3x‚ÊéPŽÂÓ,©Ï²¤Ï›/‘ú÷ó;ß ¼1õéšI拹wÇÀ8•lÁv×Zøg¬ÌH kßw¬1Àq’Œ@ü3µ6¦ÜdŸÚ–òáБÌ´^‹lZÄ:o6|I4 ·ï˜TÚÞƒkv öZÄÓÉþ>ÉS§ÁÂBŒ‰aà³t½Ùõ ¹Ì±árÕgKØ2•|ôM†R7îÚ $»KÖ4O?ê¢Û'‡,°ù?™AÅå—fƒÙ‚…¦¸#É:D:>0Ü9îž´ˆšËCTA/ä·Št”Q§“ß~#%ö¿³m+z±!ž¹4VDË`‘T0î ¾4êðáNecá3úõ<–ìŸüô=Én÷¤BòÃñÝïJ~<ÍKF¼JN®|÷™ '…Ùó­`Í$æ$q\I(Qâù|͈ÍK®öT_Ð'é|w;.¥³Ê[H†w˜™Ï\ÌÌy _YªCC¨Èâf°¢ë6Ú"K ™£ëaº…ëÚµõöwE£ÔÜYn#ðdÀ³W‚ž˜­‡%ˆÕ¦lxTðs/ò¦”ÎP E^'ÈÃ(Y5½}Íå@(`Ë›”!·í(‹p¨?PÔš¦4_^bbâÂ&úzz¬r?&cöeÈh;ÉOsdÌÀ±øL¾£°ä?3Ü' /ìXU‹9—¤LºW™Ýj6>Q±šùÔK×_«[Šì¯`­E24Hx¬r_[D¥Â:ÚÕÚ“[PÉî "» ‘ 1d² œÇ|©Õ¡%——D]o_Q[€t1SèšjÛ3VIˆ˜¹¸$´:ˆEu&·àš‹Òa´ûÉŠVâö¨‰!O,N1!À‚cAzKŸR«Ã×ʘR§òš­+ò·Èq+o1(\3?p (Fó–;Ô.ȽÏÉ´ÈtÖ€>æU`ôø¦M×~"WµQ¯¸ø¶^•vPgT½+ruuYËvëì*鶪:ö&›/o¨âÑäÏ"þ³ˆÿŠøòVÅä=éü¾J®kŽ¢­\CsiþǺ¤0qb/í{…f§Eö7•í F#ÛaI?`å>ǃS6Ò}vöè@®ªÕöP<šfUc´©ؤa¨]`ð;ØætØw YîÎJ}À‘™{tò° eœ0þƒù®B—³Õ­°¥&Ðí;ð°}ÜDäaW¯¤{)7SìÅÞûÍÔLPŽp<Š&M†SP~Ë¿1Uñäû@Ãó9°<ã–# wË™mζ†âÐ!? B>vWw’NÎ`aäʳÂ[ª"u,rùÞ ExJË­fU§Œaa÷‰£VQ•g^ ¾y®ÃÔ{ÓâŒÉ{ ÷žÏ.…ß §åRòÄVË;îV¡ø5Ü׬ëð_./;jÚ=:"O*¯à(%rE%¹`ä„¡â}føyÙ»„ â®ñ¥Ê$ fÐÆR.ÿ*ˆt]¯ö6T‡ÏX'zˆs‡,¸DIfRÌ©e(£f8`W]¶g!@®Ún!Ùþ5˜¼»¥"I’›3¾öž(·ñâ ³E¹'§ ðG<Í'ç¹…YqÂTyC´6˜JYÞ¸„°tÕÉ_ŒB6™¼hºn¨—RËήXªWdR)R?‹í®ÿÿÞ‹Tãù$µëí ú½òkS”JïÞðæ¤Â–Ó*HçÀ§¯Q8…ë;L–ÞCö* ‡æEÅèê×<¬h¥‡0uÓô3M£ÚðS˜4ZõÛÂ8ì@{‚Y³Û½ª °þ@kxµ©•M¸(3‹V¸˜àÑô(ó+§äw‹ Ï°½Šë7;˜0Õx™ÑÈ`à9sëúJÛÃ"+îeî·äLÑÉüƒhžrâ¦à]ñ ÏßF¿Üß«H†ow°‡kjÆ,™·ë Å~=˜„[Õ®ƒå’ùÌ,ŽO ©Š§lÀX(ÁOßí€é<Ó{ZJË6u•G¸÷”-®9a< ½YrDcÈ7ê(ÅŒ¨*jrDºÙ“TIµÓædì%3mÔ N“0AΗ"L,õt=-¶&ý è&Q+¿#i6õÓ0„bUaÈåWj àúõ|SOÌô[™êªå¯õâ«»N<ÃÁaá©Ö›±¢>9p€?¾i„N 'Ëœ;K—ì?!7ž4-¢¼}à)ùŒ¿¢’ˆoˆOÌö˜QFsÕѹÒ䊋 íf,DºÁ9É/jwƒÙüö—ÑÍlø8šF³É¯Zäø·¤@O`ƒ}ëÃe[}¡ 7ð ¦Ê0å ·92ئ%lÝÌÆÅØ~GTËe82«ý=û¯Šl϶\î·õ°¯•ƒÓ›Ž:ggÜœ›‚j»§ÞÕ§| ÷u˜ˆ\gÅßlpˆ8mâõý */,R! Ãl²®Nç låEê÷ÔŽ˜äYS-[sXkڮřÀ ñdl*_Ô¹!ÞUýlpÏÞF|B+8ƒ–ÝSŽ K¸mÅ|1‡[{nh ´È_`¿ä …‹6ëž*~蔦ÎØYÒF"‘n­H÷­áŒÜQ­BœBÌ`JA¤VßÖ„ ú-¶TQ9ÑWy8Æ^+™Çî3ó»Z÷ Ï…’ìÞµ¾¸þ×Ûð#ß±Ôü¥GΕÈkvPÛ^æ4å~Ÿ-nó•ÈóýêKöÿ£~³ùsL¾lþPKÚ{TBÿw8ýg9L gfpcrypt.hí:›ë 4tn™sÓ÷J³Ë|¾[ï´ýz£5ºjÝ´»ZÃ]/|§ß/äó¡>šww£a«Ó¿«[£Æ]}0AG7®³\ô‘-êS×;oÛ>R÷ò ”V> £üØÒ=ÈX¢ÝÞèçaýꮕ‚i$0]1­Ö(Î2Ǥ>èV8wÀLÝ:ßÀ¹ÌÉçüõ‚â¶o#2œ™^Ù=Ëçòœ^-Ÿ[9¦AÚ¶é-ó©6vlÏߊëˆm•WÈçr_¤Å|´tCýŽc,­¥§Š$,¦ˆµçÔMŸº¡6uußéÂÙ×${÷ºm8óîrþ@Ý–¹ö´H–¶gNmàδ}²x€Ýgü 0Ê—j ´£?ÒH6íP°;‡E¢‚GÊבPè¢H”‘)#<ÕP·¤€°lZ8#U/ g¾Xúô&YÊÕßÆÈÓÛ²ö„\äså23ÔÞÃÿбڦîDSÁßUë¾IÇàôÚÕr2¡.5†®n{Çó rôàÎp³uß²·sÎ8eÁ¥ù`Ѹ§ÈŒ”¸q±ý­MÚà"‰ …CDsHM· ó¦Î&ÓãJuk ¦eº9‚†‚>8ŽÈüŸ)›û6žé.9¶aQ€ÀóZ ýydÚ‡­zŸ‹„qt¼`ëC…p>ëÚýµ <¦óá9KwL‘¦Á¤sçsŠ•¤· ¿¸Ô_º6™žÐ"ƒ“ ³×&µ &/.H…ü'‘Ãĉ@T«õl©ÅfßÇg‘0S*iºð•ÝcƒEWÔŠ”CÕâéOK.H¸å Á8¨õÚ|¡FȾ €nÌŒ8 ØÇ >¡¿Ö½PÝ?ÖWºié`âiªl8`ä,D¢&«a`àŽÀ»À¸ë¡¯\Ši‰û‡µOÉ1e‹ Ac„( ÿÅØÆ”®`qÃY=*cjH¾ØTÑ×TÆRLE/[/¤|}L ©ŒQ—׎Ëì£CÑ0¼™)i?@ØplàLJŽ×Òu&)I0-&èè/­—…c#“MbÌ}Ýó]ÓžF%C½ß&6_·¦Žkú³9:3˜ÓÄ|½ÃCˆ{í&Ò aÛMM –+Óõ—S|;Ô°˜¼øpÁ3cÚ’!vH ©0ÍD&QóËJSÈy:#QdjÌt{J ¶ýù…ëøq¨Q“wNÍ– ê9—"¹gbâDKNˆA'•0á±j¸«Ù¯Ÿ«ø¡)MØ»Œ(Eµª{4éD_Z~"!ÅÃϘwprBÀ¹SüúßÀ¡Ó=\Žð ƒîì³Ö2­?£çÜãæ#Õç´7w:P¦ .'mšH¡Ç“¡p…Gº&üf‹˜á7ò˜šÉŸK§¥S¼l¿¿nêÇï,‘á ŠTqÆ—½°R-ýˆëúŸò®R!«j©ò¡„wX‰ã¿¾äªáŽ'ºŒp†·Yý˜s¾ê²8a*ëBÔ…óSV(%.—æÚðø&¬ã]í«ù’[ý·âêé›ðù´UÖRüòý‡CCP¯uÉ W¶üþ¥H< <ò%>D§{ð¥»öðVxZR§žBÄiJÑ53Þ=GõmóŽÈ>¦KIƒWØâE|iª…S»øÑÎ7—¢N¿ Þ6ËÕ´tYýÏ0È‹ö}S±ãS‡4>6¾´8„®¶ &N÷ÑBߞ˧oÄ7K]0ö´Ÿ,¯‹›/¯Ž›Ü8ûɗ·Šœ/¯ŒœoÃ×Ó7áôif¥¸‚^kÚÓ2ë ‚æ‚Œ—e<ß]Ž™A„õ1xppv°éÆ ãŽ2v[Ëôç è% §•U±È–²,œ?“e¦öo¯@Ò²Aƒ_· ͯ¼v—8yóO¢‚…ë¬L\yÐÇϺkxÏcñrÏ´Lªj4!qýºô(JQâX» €öÇ6`á:yÿ^ªýÉO½³ŠºQÏ2®yÉæ%„O¤¡žkñj@ôi »Lù—xôIãϹ¢öxUÑ`X«¦ŒŠ1ÄÊ>•Z¶qOu¨ë ­ÀÊ~$œËíì©+èW•rþ­rr¹ŒÊcuÊç¿â?šŠˆZÈáLjë=Y@N·0ð1`›<½˜õ)„ç»û>’ãÕŒ6Š/Œo”rs%‹{}Ñ µ€Û´y¹ô:éà‚T ’²–(`Ýͤ˨‹³ËÂ6uþIÜ;þ•ü;Í£~7ŸWÒôê#tèBCi†½ŽçÌùþ°45××üÊø…\^°Óºñáû7Ž*³ßÿ!~ß‘\¬þD©»UØ|Tð}ÃϹNf.\Î|Q+—ŸŸŸKÏÔ4t³!¨ìuûdnº®ã–¡ø,Íü¹õ.¼¹ ~;/ë—‰Ps{”c‰Ë›Áàœ=eIT¦EÂÆ3Ål¸*” ä…²¸Cý™cŒ`E1Ÿ»Åæø5Rvï/»÷[$S¥w— 0ï'U÷^ •ª^FŠݥ¯+q^·,ç™_ób:AtA*ÙñÞRÝÖ-×”xr©[žÃOX'HÚ¢öÔŸyxè¸ ÀyÚÆ {Pÿ†Ïµ7½í/ àF”—þÑÇí%$d¾Ä÷Äþï?Sj£4µZ§ÝõïÛÖè®Õ½Þ2áùLý—ØL‘MæÊdœQ' N†u~º¶ûw­7ÿºAx…ÂT»:i{lXËtÇöQËøÎŒ8.g˜Â‰És˜Tä&¿#é2_\쬑ÚË9ù’À~A*ª‹IÌäôß!uf e˾ò~,%ˆRjP¯Jn‰i_êEY€q¥ ÷éþµK+‰‡saôÀ}{6=Ú€í4=’ñzH=ÿ<Ù}f,2aη@;½#U£)µKÏæ£ ¬™zÉq§eüTnšSÓ×­(®EÑ%Œ¬`ÕñtlNL~ùpÝîHå‡?œæñ*†)ß®0·¨ˆ¤)PÏjf¢!À3à×Y•nÃYؼ•©A=ØÅ7ÌQ µ}Ë¿w§ÞXîóž_y°P>$ï¡ŽnkµÔeòª fìþ T”ÂÞþccw’­2´ømû ñNæ¶ËNF½šoèNB͘Í~éÝKG[dÎì¢Èô ß…æÝ ÿ†,s¼500÷¦Û©7ÄwSš·õÖ`Ôé5å¯R‰Lö ³ñõ8p¡MËvɨ„–‹…ãúÐb©ïÜÔ·@`‚ãùBã¯ÐÐìjµÀ#ä¸Dñ¿äa_ XE‹#&A øøîÅçÃÉ×™ 8¨ªVk¶®ëÞGŸZ¿òhŸA°a.fÔÖ¿šnû¦5ÚÿÝŠìè/!Í~|i@r¬°’¤˺…/x¨=…òÄw¡5ÒTEe‰Â¢ôäR±ªþ½©Ç躟„z .ñTM_‹xͪK¢b-åm€Œ„½98žë"ƒ²V2rV˜`GÅð1Ë…«ùX¶íäy7/šù/)kÏT€Lœc0Îøø µºëêëÐ7Mx .‰´P ž…jÙÞULÁÂOM^÷a9ÑdµK{%)R5}dôB@:KȆð›ó?- ö¶3 §´ZMrWz SÓN缄&„oü³7•ÙÁÝ_ø;¨ýˇ"ûï+ÛþÒÿ‹ã{øQ$Wí›Q«Ûl×»£Þ=tÐEr÷JÅg9­jÙ´ ÁÖ"ÜÉ…À$püÚ´uKRBrëy?žc‡c@äž=_Žœ®Éï<´Ž%+9#b“>¸—g¥;,(vKKD®³?Üô·ºéž–áiÈÕNOÕ6ù›üð+îuZ,&"àNÑ0qªÏg­r˜¨ç‚ïV~j^K¥pѤ¬ Uw}<“‹Õwé€Ê3É7,îbôÒ+<~ÆŒ@t·§…<\l…Áô/b’ âG6$GúÔ¥á×Ä¥q 8‡ªÅꫯwŒ…:Fß¿²œñ#áT`´±ÁCd°R—>K×$åû쾋_þxO61—ž!ã_×G,àÐ)âÊÜl@ œVQ¤¼xLBZôÝO![eÝÎjakô6RLvsüδób*2Ƹ0$(f³øM6hÅ’eîãŸDXL§ÅòÔÙ(šK¿é!ZˆáΔ?hÁSCöç‚uÀþfS‘Ô?Õ÷9OëâÒà®Ý^²©‡êÞu½1ìÝzýa»×…D’õu–DpX´³ËèÈ ˆäs±çâxˆ“K¼ )òAøXGí¢ÑDa´yœêUî.£…™8Z,‡q65`g•K ÊhÓÏo!ësP‘X…ʲéµGFlξâõå°×ìÕÈÄ|á÷Îúƒ}ñ>Gð`E³Ÿè/aAbÏçßQÛ0'ùÿPKÚ{TBNB•¸½ § GNUmakefile½XmSÛHþýŠ)Bn퀄%×qwFöRÞ3†²aCŠÜ¹ÆÒØÖ"k´ ì«üøëžY/vHv?l*xÞzžîéé·‘ûððó s5&Ä컽Ëû+bΉyãoá÷˜Ìh ’rÑáq×ó— "W®KžY"˜:±>XÇH?»í»$DdqÌ“”ù¹ Œ$ 'Ödš0úDçŒð™ÞA¡dšÍ-Àps.Ô*Ì¥ Ff< 90ž§ÀT¤ŸyŒxÜgDÿc‡‘*t¡¥MÈ’>1=i×DžBð%ìZ‹”-Å×YyÈÃÌS¼Ì™OSºÃŽA·Øð)<4͹W,wF¥zÉ›·„&$bÌò$> á&fÑå¸kŒ:ÃAÿh…ÁÔpo¡ïÅÆõ¿»ýt—O~½«QØTiÜ;×=í7Ä‚…!É"ºdM£?~øxZŸ&æ’|…)‰Ð‰È^`}<ýº‚¿þèÒ?=ÙÃÍ“ñýp÷Zì7@3°çWâüãovÆuÛdœEjï ?¼رÕÏ–ñ’z‹ b;Aàn²•‚¸î¯>ý ˆ%˜Å @¸ƒÎðjâÞ\ßö½Ñ 3·Ø-”@y!ÓD÷Üe3š…)‰6 V`†Ê¦H‰”†¡ÌØ櫓߸õ~î?4›†ê÷£L$‹ü`flÈPŽÃ¹ç5Á*KÚ!˜¬@Ïzx@çU4Où™mÙÖ‰Kd~pPÇ“7Þ<´AVðÈgr3š :w;Oÿ¼SyÿE~¹^'Ö£cžÿçëãømâµ ïzƒ?§SÿÒè»î‰ãº¶m¿&Þ‘†ï±…2ÚJTÛþb=ÚZÜ«Îر[¯±Yyxä³ç£(ƒyó=Õ˜¼˜Ú%ÀÕðâ”`ËiÈ’B_Žæ­$z<.‹qö—Ša?ž¡(³-Ëù_+Ëù9Àf#e´UKm¶š{–­yØ¥ Ó¨Äešx Qkrz¢ÁñÇSƒ…‚U —¸xÑ4xfÚa6n£E¨šµ¡ñâŸ~Ä_â)4ÎÙ96ÇÎYáyUƒ–o!´F)K"–$§à¤àŒe%‹ÔGùÊŠœÄµ&b õ±™E>”.8ºXÂÀ/_Õ¶Î2ŸH„ÈC0K+ÊÎõD3NÌis+ØVë²mú‡Mi–òφpòeL¶µóUI'!p湦ÑÄ'îÁAˆ^IÁ¬üȹwN‹˜*Kî/"þŽ­RPܨ>ha¨ÊjÔå—f%>X̦–O“ŒJVˆÀðêó-«‰õž|€\ÚÂNÃiµ ©¶ìÖQ Ž™Q7z©2Ò©¨—úCwpßíM~í¹wÇ\ùHà * ¹ÓÌ8±ÌÞhðr—Ö0ÁT ‹çÜl9Å9‚ÿŽ-SÄpÈ+€ƒ’õš® J 2$l w„YEç¦9KÉ ÑÓ×dA}|øqèjÝSiS Ì3¼¦xbyÞ·¢íÖ©ªF=¹c©ó— ô=šøä½åÅqá”H€1þ½%/y+bÕ[¨& U+?æ9‘îH®jƒˆ‘Bdµ“÷àly?öIkÓ—ªÀÁ|¦‘ç³XBËÁ‚­T›ŸË9KTPT(I—PKžŸ{«8ÖÓ¿g,S*‰¦é‚ñd-œ2%/I4—½ØSñ“qßWýlúÄÔŽ(!婯rŠ¿E>ezEã&Z‰b¡Ûâ¤BOAü”·j&^/Ô!ÓÄ9r l,F„ö8(T|è`UýëÛ›Ñ݆RÛYÛâ°Ôthd5ÂÜîj”À©ä ¹ýBË£p vl@ÕV… lÅ •fÛX(;‰c‹þri}Zî«!¼±ŽÊcòl^ÈhÔ6Þ˜ûÑu³B^eTÃ/TÐ,;ÙÀQ*[Ðê« Z´`ªgw®ìË{ÉYU®"çÝ'•©’rñ]§>…À!!câG+Hc1Ù|9 "/Ì|v” VZqK£iIE¹ß[‹W Jd´ WZ‘Jܽ¤N]æk¨TUÜ”™Ì¾'’U8UMçû4`GÛD NÅŒ £Û.™ª¼3Âͺî¿jëª&Á…*àu$U”€§'ÈM^ƒ2Ê2Õ¼¤l¢’FÈÓwÕ­£:‚.²¤ÊÒxF¨PN¹ µú¢ ÅŒ L™©Êv2QÌ¡:.q÷Ò÷ïàäWâÁnOÑ:ÐîÖ.9Î7ÕWf_ö²- ôgdH¦&†Ø`z±åÝÕûËÝ»½å´¯XEªl;ÎÞþv¸Ù ª¸¯Þ9¼˜ Þ.¥¡bòí +¬±‚P P¯ÉS&Ü%ÌnÖªl‚Ö&›®'<å›ârSDnðÛð/®ï(ÆêÁý&å™·(Ϫbò]‘¼H›¼“KùÉÊg*Ž &7ÃÁg|Uìÿ]ò,ù£8êÂÆu˜<}ÿ(Lïa'Ìwö#±ñPKÉ=‘¬ gost.cppÍWkoâVýŒÅt£®Lâ&~òJR‰$Vm–E [uEÙ•±oÀ‰sìË6h›ÿÞ¹cƒnUµŸ sÏ™93sl”£”ÆÙ&!ðf¯NWoŒ£]`™—l?òœ–1£áûp2^‡_¯ÂÛ»‘y]l×,Û†qvlEJQAø'˜ü´È_H Ëô¡R®×YJ¤e­W[piarjÁú<Ï3✖ [FàöÃd:\E% Ê«üe֛ϜÎüò»Ñúî[àØô-pñ“gAÏüî`¼ƒßø³.^ ðå½ZHä~ìËãŽdsχ™Ë麂ØÄ Š ¼-€¾,﫲\GPû¼Œ vkŠÌÚ“§d*Å®”å6¤vêDT0¤¼º}žBŠtAT-r„lÂÝ ÷DµžìK•Bäp¼z82gP!mÕ_õØ“ieE§Vg FWÂýjEÞÞnz‚øzŽ®9ný³qx›Ê|SÄâM™¥%Ké²a,ƒ§ú[su|ÿxª-Dë5‰ `9,<ù³¨pNªÒj\8×ÊÛÒ)ÔpyoUg¼i1$Î邘 ¨E4MÂ1¢Oq]•§+sˆ¼^Cæ窞à÷•®ŽÒf×¹D=¿‘Kå‹R}8ò\äsy¥G­±º› ¯rT6öU­Jg_ivóRsªj:êÅV<å[ÁW5Eýêîr•FGiyU…3¬öâÔýïfé6rÙÕla÷ º¼Z÷n·=¥Iõ'øÕÜm¹Û×s0ŽÏ ã[žE,Í,ò<Û\M£EF®£,Þ Ÿy—ðe%97þÈ‹Äs5à™?Ÿ¹Ag~Îó¦ÉâW$~"É„°wdk6’Ç›’³`CËtI±VJd„.ÙʉEÏä×(Ûq”%¼mø –ÈdNäß ‚)ymÑ$®˜‰¦ˆßöIÖ4ïï¦Óûðk8º¹Ž¾~øx~´à‰lOd™R³-îôÀwáçûpt;ýÓ¼jºÔäBÓ08œh÷h´ZyfÝ9ÎÙ>ÇËøx99AÔ!æQbƒãƈãéZ-µFž×?;îq:Ÿ=þˆ?=ð'˜UèÄÁà^`5l‰³Õ*9~Žô"gÙû<1y6n¯“Þq*‘Ø…®{ºdÅ-‚‡x|”‡”âóÉ|i˜À._¬Vãï÷fAo>» §WŸ§¡ÉðaÛžÃPGîÞ‘ÛžK&Ôgá4ÉöÞ‘dü¥gÛ5Aqp•åñºaH“ñ†]ÈÉYpŸ2–‘&iD– }O‡4æËÎcR–Èý-/hÏÕ)±ÊÀ2ø¢–úžo˜øÞ–(îµ>Šw2E-ŒV`Tjª´m“:øv…Ÿ,„7OzÉMtáUâΠ.|Á›‰'hpŒØ#uTÔQGE÷±®ëi±¾h±-¶+¢Ü_pyp€–9éëžéêŽ)¦¸[šÈ¬W¼[.ßß×áCã†ü¯l¤5ˆÖZ{hÝ¡5‡ÖZkèœñýÞÕz­£õe ÅúZ¬§ÅºZ¬£ÅÚ;¿ÿ ÕÿÇào—ñPKÇ= ÚŒki$gost.hÅT]oÚ0}&¿Âi*(#Z»M°H|¤-ZѪM¬Bƹ4V;²QVõ¿Ï6‚öõ¸K9¾÷œ{Ͻqƒ®x +4üô5žMãxq9Mf‹+¯a@ÊáÜ Z-ômEx­Àó”V¦€ê È=lÚYý[2Aî-êMú£$î£Å ºON†rShÇMü@ OiYœÐ˜¯ê ¢\2JÐ}€t`™úzç¡tó6×ÀïtÖ;; ½G¯¦4Öæ’®4"–¨•8¨Ï:Ë'8‡“&z” KÉQÝŠÖ»OÞS×V F™„Õûz¦uÑ ‚õzÝ^M1m‘Š`þ*§R ÕÎtÎŽ"´g/À¡GVÊ5sècßÚ¾~×ÔÈ‘ eÜÖ)¸íbË°Àdº¸™õ×`Ò Å8/Xo/z5òêxµÚwASô™“ÌN*M@ßN¶-7P«T 棒+zÇ!E”kÄœµþÎMkÜ f%ĘJ…^Xâ\5mµB DCjÅv#pš±‚)ÖÌð’ëmÂñœ\ j æç·ó×ïn»U“jV-…`H9Šá3cZ \ ™žî"æonç§o-‘ p‹b·'âëmc}t"³¸†ÄÎþϦGœT<7ø»±”êóô‹NæÈ`ÊæW;n=ì"ýÝ·(µûnn£þYØþka{!½)À¾$•}¼ ³^4qU§ߺÚÃþûfÍ»IE‡4Óch}šU~δ ßéHPÕ8<Ð8 ÊZy£¢ÉȼnÀSºò~PK=MGsWŠö gzip.cpp¥VmoÚHþlÿŠIO:Ù)MB.ŠtA܉`Ã!9@19z­*´Ø¬bÖÖziŽ6ùï7»v !ª«?€½ûÌÎ3o}z ³¯<;‰² ÞÁ½äJ¡&bÈa \€š#dËIÂ#ˆÓ£•É FÈÁcܶá"J–1›,šŸÌßl,˜“iÅî6nü°ßhúãk¿Ýé:M¹ÊTÚﻶý%å1´ xu5"ïØ—˜+‰lñ²¥ãÚßlk1V©bI@ÔêpVÓ ‘ŒNeR9nͶ­†R,šc<”LäÓT.˜â©pÜwô—ʹi´;Í*w~çù­ 1ô½ÃÈ3·fY§”f(YÓ„ÍØŒRÿvn,ÉPñºÈlk²Rø¯’Œá´QyHç) ð &Ž õ:T]øZpWàì†ü®!aÐäìpÆßaXûc§?î…ãfÏó ýø¬¶}™F˜ç·"J•8ÇØcŠ9Q*r&¬c.B%¹˜U ç_q¬ A1Só²tÁo³˜"qÖÀQ{Ö"o)5÷&…n±¿M¦h´4WE§ OŠ> 1º&*×IÝ9t.ÜïÍÖâ‚%ÝÎ*pqW–yͼAg8 ü±ßõ:î¸7ðüA‘JêƒãŸ¹l»½&øâß¹^N§(·™Á13Œ(T&iš€Ä =p¡ “iÆféÚÖt„n­T:›VOÏÀßÖ%(y”±gÞ‹ÂíŸvÓ1“åôÓåçÚÓSÅÌV®·ù(¯\¼_âOhÂVàÜ=ªŸ»$h2½‡Â¡/¥>ÑXèóÎ>ÃQ ¹€‡㣺^{Åúhí0¼£ WÝ]X ¨”9í—cl(¿8@36;î~f~Çï6ÿôIŒàš½î°Ó½%aÚo¸Åó’’r¹ tY ‚)OÐ(Qe“·yQôBP« íç¬üÃAcÜêøºÖVÌ“˜‚¦J[zP«—ð4¨ÖËÒ Â)»GD—gOevE\ªÆQ½¼Ùiø¸P«øú=¶FçD°’“8¥‚o×p²§ Öý\'”ök[nš½›¿;ÜÈ)¦¬ü'Ýì™?ÿ§"¿.»%ú †—cÿš‚oÉÇ«øKI(eZ7ÏÉ™UdPŸ³5Öšöß(ùteômʨ„ÚVÁ·Œ¦9Çèn—ÓRó7Pû;úRöù”¸µA`žK“ÇÍ/0rcÿPKŽ=ŒmáÑ]gzip.h­VïoÚHýŒÿŠ¹D:Aä;íU9"pmC¬ƒÀ ×ê$k±°Îì¢õºm‚ò¿wü£iSé> ˳³ï½™}掃Ñx>¹ãðF;§`ÂñY\;Ox”æ1ÂÙ¥¤L៫³§Ñ„ŸˆF2*šoéØ´œð½3pý¦%ï7JŒÇ-Mk·ÛP€%Ö‰Y–ÍIß‚Îßu[Z”²,ƒÁC²lòyšD`— „Ô¶Zéi"£ù>_,PbHƳ…k¦ ¸ ¦‹VkäÊðo=O‡œgÉ’c WPÈÃϘ¶Ó7o½ ¤§gNè9wÎñ†T,»³„ÇâË4yÀÝo4è†3×·G³pê~rt˜ ‘¼ÂHÝòèûç)JæØÒÞî0ͽHý@’~ħŸDlÁö±®B$x¦Àgk¼ciŽc–È ~ß0I…2Óá•u:øaŸYk) MS+çkØÍkuŒË¯…åK—^®æ:PÏ s™qƒZ!¬Å(‰ .¼m\éÐ7§ñV‡©7šÝÇkMk|I 3™(ÓÑ•D¶¾)77[×õêXŠˆª²¯Æ6S¬®Ëü^!\Ð΄/uȨ !uùR­v¾ÈTE°$-àµÆ!ã7]X‡J(–zÈi‡5±Ê ûµVhܴч:çcíòçc­î7X\Ôïk½ž#%Ј+”êôEtT¼lkˆýz³EÅÓõïLϵCÛ Ì°?š Í@‡³JM¯nÍX$b* ”Bž]~Üqy™±^}%Ÿ¢lPB@¶RY2z™§ZÜÑ”ð®8ƒ‰| ­ÇúöM×sì'tÔ-ˆVýwò`^9/SîÖ‘µš¯SÄZ£}ñü[Þ-¸A¦ÊÚWsë›deÝEÚ[ô]ŽÏ9>N<ÇFŸ¾¦ËiºšÆ_VSÒs5Æñ¼LzŒg¥Íºkª19¾~è’ nãE:Å«a<™%ÁHí¥iruõ F‚ïP ÷l‡rj(Þ¾'YIµnÏç0Åǘ{xH».Y ¶•%¦J<î?°Ò "Rµ"Òi‚¡- T˜/åºjK .©14{Ø"7pÉÝ|Þ‡µ%X)QežË e±Ìk¤5%¬\°ï¾÷¦™àÚ€6yi£¿‡ ’*j„rݨûâŒãºe¼ꆤӉ~•püCÇ#YÕR|åHU؇V€C88™%5˜Ï83Œ–ŽfpK7˜:B[tˆ:HÜGÝÕ ‡ÒÈ OÝF£ïžÉ®gµJ?3ò ‡{ƒ¥è¾9-h¬ëµe#üO{­=a^“Î!`9¼ ¯r×£¦¥uR™Òp!ÅnÿéºJÝø˜Ï:eUêÖ4Û£çXè߯Úû)xÕœÊg¡;Uÿ=tÕå?ƒ &hÆXP[šcÅef.ÄÆÊ£OÞ¹wÏ.ÿé‘ŠíÜš“ #šBësÙú1Hgðj•Ûíó“±ûI ÏYA~PK‘=é|ö³Âhmac.cpp•UQoÚ0~N~Å•IU(”V›¶‡R(ek´¢B7MÓ†Œs!V'Švl꟤&:µ9¾ûî»ïœ“cB{4Má2&%r ܇4"}`dˆæˈQ𓘨Èr ßÁ%a¶ý†qå>B+¥a/léHÀ} `tóÝ›O=oá^{Ó›ù¬Ž-Šjðdx=žyÃÑxq1þäNœQ¶NeâymÛ¾O˜W×ÃÑâ‚<;»å4Dz‡þ åg\;4áB*.á(˜©Xr.ØŠÄ%Üá:B¾’aJð„Äø•D9z„eÛö_Û uYª0óUŠ/ÅÇ\m÷mÛºA!I&â㊈pž.‚$‹‰d ‡ÃPÅ`CJQ ÐP«Af%ônÆþ Âixïâ)P¦e8Ô¶-K†Yò.¿×Ô†Ù*‘K§¥%9J8$:v½ÝiQàûiÜãšÈ/8ýýžö ¶v2PGï>-=înŠ’Æå³RKíñªëƒxÁž}ÝðËý\hz›új,[Ù6t!äV-•Of9ö÷16 ¦ÉjoíÝã‘ÚVZûªDyë9ª6êãi.» Wc!¡ì¡ƒ=Œ¬¦ÐªTƒ_U¢JkŒ²‡ÌªÅF8ÔëÃ=‰Òýê|›zþÄý1ug7Þˆ˜Ïž ©_ôv+¦ °qjþ­J”;¥%X–.'Þ¤ôˆ’bÅÔDUCšò‚ ‹4FY¼î 4¬F!×:ÅkÐéÌ~@‘ø ­ýAMÈÿ?¥Ç)b–•ðöF)âã7Ç ék…"äkã_PK=¢Â"É«9 hrtimer.cpp­V]oÚH}¶ÅÝTªì. ¤]õÈJĸÅ $énY{+ÆÃÎŒÃf«ü÷½36ƦÑîò€†;wîÇ9wS¯Ã‚ËhIùi°ZÁ[XóHJšIBXÅ$ !D È…UzG„lIÐrÿ·4‚.‰LóU”qR8Y‹ÓÅIÉ° ^1.#T,m!ÃÎN¿F½3Æapíy%·U® k”ÐÐrÆŒ¦ÃÑÈ¿íÞ¿ó;7¾×¹ð\»tp%![ uö÷¾ô¿ì?+žD}“ø{«¨šÓ$Â.²œ’ð¯üÿtYs~ï‹a¾¥Óô—«˜.ñgIú5£sÞ?ö=wÚ¿rA?*ãJnòÀ¢³ƒªfaõvÂYv ^çg^XmCå2º·Ãqâ £Ù¿E‰`•W'.¹  ªyòŽçùƒáTí¹W.NxWÏ£Žl†dFãVæÈ$ƒÝFL–hÇç›õº¡ŠÜ£^´¬§\§/ ]¸öغK$Uá𤵣KáúS4_í6¼—ݖí6÷ ].T¨rÖYé¥^5•Ûaÿ€ì.E.†úšý“Tµ]üTíî^Éú¹{Ï~^A aض||ƒùõÄœøîÐY)‡_踚YþÄñïÒŸ:—%ªîÇËÒöåîºæ¿PKŽ=X-åŒ hrtimer.hÕTÁnâ0=Ç_1-—P!èaÕlW¢!*H4Dèî^Pš8à%Ø‘í´EUÿ}Ç%¡Ý½®„P<3~ö¼7Ï –ñ”fàM„Ñ$ —Ãi4zð§Ë!i`œqz.EŒ'y™R¸LÏت½¾ÄX5ݧþlY÷ýѸ7öë=_5ÛÒöúiPž²Œ ÿàϾç/ïüûQàzrWh†MsPö'LGï j ^„Lo¾@„Èò¿{ž+Z$¹H6Ký¹¢:¾Ó¹€%IòX©ºÙÁx\/‚Ér™«íw1"¿‘¢|ÊYÒ%ååæœix›ùÞ$Ìà®[ð0GûˆYyÓÉaôƒÅ{8\×â”øׂ'!rPºL6}ý“JÑtº°]ö¤©rMU³…¡£÷¸¾ÊÅRÓÔÍbä£ oï„8ÏLê2Îk2àžj¯”’rmc‹8/©Û„ÛëžÓéœd)ˆa'Rãð0[xpÓ¾>±d£B*gç$­õ1ðÇ…Æo ’*‘—š Þ‚_¥Òˆž©T‚,N´x– ,’2M–ÂÌtgÏs›Hc*P ~Š¦&ÞW³é’+¶â4…\ðÕq•É’B²çXÓîƳWБpëŽP–ƒBf“cWGªØþ†áü»™ÉM,EÉS#›ÙP1§vJÓíž@lÏÇŠýIÊ#õ>&Ä^a5iœYÝ#8@vˆ·4V¥Ä{‡s0÷U d@_i‚ÜbÇŒ+-ËÄð¬@d• z-iœ‚Ë2PeQs<í`2k’ÎÕtP$ ‘)<ßÙ¶ʃóh\cŒ§âEAê”#‰² n˜zl[R« "¡è2s¹Ä<êK/qžWµ¹6¹êì ÙÛÍ•–èBe»óN<©®Í„†A§Õ–¬Üxl,c#çoîù$Ú©jÕÖlµ>2€%@ž{Žþ‰€ÿ¢íúÁ÷ƒùxˆPK=&^-Ñ !,ida.cppÍZkoÛ¸ýlÿ 6 9±]§ÛÝ 8 7I ã6Ž7N\, ¶h›ˆ,i%*Ž·›ÿ~‡‰¤ŽûºÝ|hj8œÎœ3¤ôò%¢î΢uÐ:¦Œ‘áÀC‘gÄC4@lIP”N}:C^¸Â02Ý [BÑ9¦ÍæsÌüÔ#h/š-»Ë=c€+†cû 2±-¶˜¿ryeE¡¿ µFçi0c4 °Ú¬/`¹ÁèjôßË«w4¸¼˜ŒgwÃQ3a˜³0H:‹7 Çã~ÿÝ[nšSâ{GM=ébtÞl¦ (À+’D”0i4;™²V³yR]ãõð|Ðï“ÐÇŒxÀ2Š}úqäê#Pøû)c'èE„ca$NZÍÏÍ#ç™ë¾#l01ÁÙ»&³ðžÄ››eL’eè{{m´rYöW«Õl4à¯p†Á=,ê âEº"ƒ©Ò.´¢‰ð«¤ a%»×7…†jt|‚z;¨/«]¥àô” EL 1$PO.²r}œ°KÄòýE'à ¢”X@|xÖ%ç€8HÏä`rM°·Ùž5ú–4YBêfÖÝY›^H-›êa±ìï)IIÒ…$¾'!.¦L[7ô’îÌ'8VöNX ¡®QËäšu{Š¶†ó#¹v>¨d¸²E! “E: <ÏtŠB°ÄŽ4| 0L–|†(V§á-eËs2Ç©û>JWS_ÍåœB:‚êÆ<Œ‘ÃÕÒ“Þ¢ÇJ;üzpÀí+Hù¼Çæ#T`ÐE °ˆé `kÀc†ŠÝ,‹{^HåüzV›`-ªiÓ9Ô*C''æ"`ü"d!Jîh¹çqwJ“ê´n1½x¾ÞŠÇ]+kòŽÖy˜ié×ðd·š¼J€-9['7>&,s˜—ÃŽP‘ ÎÐî÷ïy¢ºlí^9fBµêŒlµº"ÎG ¢4YºS<»s.I’àã0Ã5Ôiq+Ä_¢qL   ‰#N+GV‰_)Y€bžu…ô> ïÒh{!IÆäå´Âѱ|ÜF¦ºÓ~_ȸŒÃ ª²ÝrM„²íU™ °²g”YÎZ4¬Tžc†KÞµU?0Ý0‚öi áºøF¸ ù$X°eMÃÐG+¹áhàf•]DÇ…åeâskÄR:Z2Íþ Ÿº—ø 9äO}â´J¹È…Æ)s´ÕÒÜV†6Bó1zÍ‘Dü~ $Ðé zÍ#Ë­(rêÁŸ¯´À¶å¼„Ä g˜¡¶Kšú˜g¹¶|Å¢¯¹Œœl–‡–ʈFI'²R…BoE# ¼)¸£Û„ ¤ªšVƒÿH>“\f&eÎg³*vxlJ;¼%¢<¦êŸGÅŽ2ƒ4-ÂŒ7é|Nbâm+ä,u+ÊßJݬ¸ììEÿ~:YQŸG«T‰á f‘#šs5剹rï3–eÂ`i>DUÈæ&Æ?]š’«ý-ws š•m•+axeQ´ ]òa¯×Ûçÿhx”•ÅöHAû›Ô¿«Ã ö- 0GœOxk%4MÉ‚üó¿+Ìo£enù£÷IȯÍÉ–!¥ý*õe•]VEC\M{õݱ–¿…nB9nL®hœõœ7Þ !µæIYl J^)ij¬«j‚æñÁ‰hPv5 û¹e×-õ¿ìÌÀ¬ÆçÚò`ÑÊ”‹@°ç\ŸÌvâ#RâX´¤>AN®€Ã ®§¨€ó$[ÉR¬Dõ§ ]p‚Ùñ¡ŠÿÊ°. Z<ä'¦[Q1àñFâJFn™7­f [H •¡ZŸ-Ó*˜’Çèï¿Õó\ó† gm »$vIÏš½KØù¬‚lí¢V-´²šO:H.$ ±¾uÞºF]s7&fظz±v'ëHÒ:ÜÿRäO ì÷¥Û¢“w/6ÖQ‘ç«8[¦õÊ]ßã·>Á•!èäXF¡ñ‘BºßT’u¸P{³$ºãî¦qOfpò961âÈp¤e$‹ª§Úsy.4ΚÉGv,[û"bz¸â@ÊUúêËnÞvÅÈB_8"Y¼³æÞ–¹‰q@Ï:ðý›ÐÙ0†gh9Æ+E¥mdõÅ<tU玊F¦"?81}–Kfg7êº IEÓ+6k—!¸ƒ”…0û@¾^¨E8ÔfÍç78Ù¨s¢sšeˆ>¸mq«êMíæ½çË—hÿTð&dg~Í|ýEüÊ°Wº-߀BŸ<Æžkíµ‹S¢n“=Ü­XÚXDl·ºk(Ø üÊ1/'¨–n&ø~궺©˜úáì´è· z$»¾£F­^þÆÙ³,·ó0Ä»k!Œ¦éÜù éþÕ¯¿åwÜc+ÉôH  „B—¿H »ìN"ÏXí"ÌÜœ_GN~“γӡ8ÐlÞðôæê„eÈ`nÍ1𲾎®*ˆÜäΡ j+7`À¯·d00Dh–V¶ƒ [K‹sþSwNøC>(ìäÝ›ü;'Góæäsîí¤®–´¼,*Űù'å$s¤h¶*k­›Ò–Ú¥jM½ÜÃíÛ2úðþ}õt©lèræ»S÷’~Pu—aÜJH²·U?%®É V*Å–×…pÜšR‰m mt‰ï`4û»ê•:µ·ŒmlµêÃPÕV.•»²Œýv£>=¯xé¼Öo£¾r™-¾m!ÓÌ7^&jä†Å°±æŸN@Öèšx4ÝÜ;¬«ª²²Q°•·ŒòšÞ·ð³AÌOpïw%Þa[qN“2ûßRY4*—óWºÿGN®vç'Ps•!œ¡ít,ª0Ñ f·&9‰1ycnIË!Y%ÖŽTS»BæòÞýbkÔî’â6Á.êêr ¯|V1ŒùGSK1ãë¯!„¼aØá€þ­çúÓ èÊ—Zmth¢§ÁUòÎkW†ª¾!ë¼Þ/ܛ䵻ú§"ýSèÉ6ÿŸCJ Mmg øÚ&ȃ‘iü¼RU+¯ìÐ_QEa’PÈ$¥«ê¤Ãߎ»tî(‡ˆ0Æ^A¸‚¹äÏû. ùª§ê^Þ^\ÿgâºb<—ïé~¯è ýùxö[O|ùøñì_¨âÇà“ׇ3õY‚Øû„èo–8Al"FVWdvåç4¸KWkB á0¼àߣ€i¹º)••*>lÌ•›ée~£p ¥}?dGÍçÄ7]¿¾…s²;ºrÏÞ&w<¸¾Þ»“ñÅY«¼hÍ2°^¸rñŒ¿ÅÉ…\†u&$dGåƤÀ£s»~ŒäbO˶œ"sµµC)t§8‘WŒ<Å8É<‡mßwW²Ï>?™ƒª:â—Îam.r¦-Öž(+(ÌùyŽ"Š„‰rIýf¹Wª¯u½íôÌ»‡f g}>${ûØÿPK‘=<´ý9$Hida.híXYo7~Öþ ÆÒ•¡&iú&[ä#®ªå¤è“@íŽ$»ä–äÊ‘ü÷ÕR+ÛI §/ Òpîùf†æ.›ñfäèêïÑõåh4&D»Hcšäh—ñ$+S ;ù?%”ðf±Ðf,Ó Õ&1YPÎ!Û¤ä´è_—h!ûQt18?G'“ÓÓáE|$W…£Q;ŠÞ¾}K¦TI2ª™ I$4Q *ŸÊSÂ8äT3ÁIÊTþÐ,r"Wôã ]R”ÓŒ%dPj1fsN3”>øÈgY‰ª¦œ—™fÞóƒ6¬>ÁŸè>r²Ý¨å´Å‡ålÒkI¹ªmïQ­i²ÈëÞÅdz³vÔj݃¡ÅõQ{ÿKµJ®Ð 0Îkr úz!A-D–Æm’®4¹Ç0KÉI>ÑÕJ¶–‚¥d¦—¥.J}äüo…LO¼ûô½ï9=Ã1Õt‹©ã-MWÈãcmRÚ!ŠÝÁD“ ø\/:d*DFrPŠÎá„[Õ™QE†=¨r±í‚Ó¾yO†JdTC:äL3LÿÄÎüÍáÍJQ&y]P‰ƒªÞ|ÂË,Ûd0ö½‡>¸Q©ß{]J§Ý®²q×Þ•Í0§0g|+FS…:Dó4É jÂ:Þc)ٌįZ«……·äГl:.y¶ŠwNvŒ«­°.Ã×â/ÌÕKX?ön¶Ñªó­rªvˆ¼ê‘wV›Å;üŒ0*¤ÐØF"6—Lê’fÄ&ûƒµƒÈŸ¦iUl²¸Óóµ ËÒæ+ÚöÒ6d΄¸)‹§e*hxŒŠ™áSêY#x$CŽˆ( „°ÕâàT$‚5WGµôª3ä, pòølwHh£OB7ÏiZl?ö5žn—¡o§rãÔÑH ÅŒ§¬Æ7í|º­§ýJ·ó»ÁéÑÑ°?Lâb"Âæß ] ë\CYÐýmq‡Ê¦‡Ø.k?E%ä³íÌ¥òIµ®€¦«N@øÀ8S HÆÆØ6Z‡mŒ.‘ië Ÿ”Fß­ù³Ú¾ì»-AÉEãbFÆ š3ù‹"c·,Æ~Y ²¹L/r¿ÜquºÞG¥Ò"·-„ð*èÜb®Ú á>ØP_á2ùE™OAž÷x-ÍL5iYçË}åF°v߸NüT¢i:Â_4ØÓ²3ˆº˜ ´ãoÛä…¥4æpë[cø¼Š÷ô‚¡-+âÚ« ©Ìészƒ³·šÊ8Þ K«õÒÚéÔÁµã—‚Ë™ }¨x4X{ä:”vÛ ´¶*‚ñü=€ê,ÁB#¶1®Ô~u²E—Þ¯¿5ä]½‚ÅŽuzãtjÀtcÚ?‚5‹ƒýê¢âLT^ç“‚¦/Ò1Uýë–qö¶[£âŒøÿ>ÈKÈQË6êýu,°¹q½€¯Bƒx¶á@ÛÝà^©›Ëü‰%þÄòþj¯è”q,ó0¸2WWæ­j\5Ó3ÆäCzâ>NÁÿÁ|tÌ5o$>W7ž—îo‡°ÿœ‰ÿùLl­/µH±¯ ®¤>¨¬«¾<0Ý6žçqÀL©B(ÅP³×Ïh¦L{<ònðÜ £Æ-[¤G¬5ó¬ð²"jas‚5‚k“ž·I¨Á>Àn±÷h¥U§,Áà~J„”X}R8q_Ëõ6ßL¡ºÁÁ–¨¸[C¢ÁS½kä“;âH”\;xÔ/T'ÇQ´‹N³Yô/PKÍ=ˆ"Qßæidea.cpp•Wis›Hý,ýŠÞ¤6ŠA²µ^먒m%늕dGq!Y#†‚!F›õßž–l¨È5ôôùæu3ÙÚê÷µEЂû˜rNBpC¢Àõˆ4¾ ¥³€zà³¥‹’Ù > ‡.­×_ÒÐ RŸÀ‹È[¼^¼( ¤çŠdIOHꧣ“ñÅdt0¾Ù¿=:5âUÄÙdbÖë w9†òX˜p Ïáèp<ºy7þx<>݆xÝÛ;?»:=¼hn›=€­-¸#+H¼ñÓ€@@Â[¾©¿6‡{ûN7ÁT}2§!î³{§kd&øç•Íñ1kèÅcˈ$†dÁÒÀ‡w†9qº¤ÿàzApïÝPåðÝéÂŒòdaAoEˆáÐébaç'—g“ÉÍÁÙÉäèx|3º¸Ÿ_ ºesCÕõ=š0@ÛìÕ똓N%M0—k „ÿyzœ2<‰”ÃÒõb†9ÅNƒæn±¬ÿäâýl¿¶×‰Ò˜xüäêØp­™YÏçú÷Úúù\¯¹IBbnÌ ?MOo•ÕDé6DC­L…ªk6f½ e„ʈ̒à{y·Á@Jd" 5z‘©¹¸]†GPµü^ÒGõ‡²k$¤I¸rZnkÖËe‚Âs„Gñìxtþv|0:øk\ÿÆd"ÿŒ±T¼}7!{{\°"ÙOiÀÑßÜÅ ½º¢YE/`·×væØøLŸTpC PQ¨ԯèˆ0þ1»½”A ³þ]áYJÂÄÊbÂÓ8ì©’`UÓäqŠYÖjø¯À²#„ú4©V˜³ :°{@û:7\6›"ð\˧Sq6ª23Öµ‚b™SÈ~îµ&¼^ËnERâœ6 9fì.Þ‘£‘)JkÀ§Ž4C$¨‰¯>Sð|º¶§’x·×b9íIY§urÙv!ÛÎe;…lGËšƒ®Hî‚5F«‹êŸ³«Ó­ýL‘ÏÒ±½r-(½Îdí‚Ü9„ªŠ•kN›3SFzIB „³å1ã7¾ q¨zwÄ¿ q6ÔTž­8Ž¤e¤aBoCù±àzøZz~ŸºKòÞ R2qiœÀ+™çHNS_œ40”ì¹~¬=î„ž.MjãP¤§S’^d“üv”¼añ½û—±&ÈÀ¥+§a ÒaôØ(¶ùeðF²ì LT¦XîˆÝu/,o·ºµÊsN;»n7è´ßß5á_(‰šÎ´ð)–¾›¹kAûJ_1Æ9KCÿ݇—ì$ 8r67¨µ{e¶v{Õ|™ %ùÚ40ªùûîú}øSäSÞiËáþ0ͼ…õǽD] y~+s;{ÔÈ°ˆÉ"ë*’W 9;åҊѳ²T¦+º²‘©dôÀ„\¯WJO·b)…‘ï?™eʼnÝÊ”› fh¢ ‹74ÃnÂOþñöæÝõ §tùÅfœ,#5ÀÄ áFr¦J=ÒJh›kÚè6åØÑðªc1”A‹šr[BS¶p„….õ Ouh››víÛµ[ÏØu~œagÓBNbýT-e³=}l²ó3“©$Dý×Áûì6 ~Ú†ÁÿA«®šU|îsö<ÁÉ/…ùuŠOxÅQ'®ZÕ;d>7I?‰™G’dú³XR½2i(eù—B 3­iéw–rùn*-Ñ@|Q”¿%ýORÞW— öéíráÒ˜¨¥æm(Œ$V½Ê¬Él+s¬¬me‹Û·#égoc:iÓÈlü9økã¯c®;³:äŸkSy;²-(Ø&™ž9Ð@Á()k—em)“æÂøTz¶ÊwQh÷^Ò˜ý—ÉoyœZ©'3ÐFx™ Ò`-|P>sÚÜÑY‰ÝVÀ„P©ðûœH’©#KPsKñ·Æ­´…`mîÝ ÝÆ bWsÇn©…ÏšÓñí(œ}øÜÅÙܧå(á? ¦—Q?è_쎃rfÏÞq …x(òëÛaÃíþ=imõ±¨ÊغØ+µ-§Lä̽‚²Ä˜nÈ‚Á[;3ÿ ðB†µs°îzÏDzža&V?OžNOÌïw nÂöã_êѳgúª¡p÷4wAÍqt¢‘Óé`†Ì '.´œß²Ÿý€í»Aicƒ Ãi­±4 =_ôEÁù<T0ª3âÄØ‘ï "G~8u#ýÝ~òK¥ï‚ép<‡a+³áèÕh[.¦žÁz§¿žœ½;9¾=ywzÖ×aS>oœ„ž ÒŒhëô„ £[ÚêÆSÚ^L[®ÃÈlrÇ—37r'´tðÉGü–ª¹#vÂëÍúàûß;X^_G PÊ·ãluá›R²8°|Œe@» @ë•1Z[ÂåátùšØ‡)KUÉe·ÍsnûQb£ô¢#mu>Ô>Â;~À[Réî”ßÐî–hS,XèÕö|Šv²ÍwX°{ *•TäJ¥ó! ‚Ôr}ó%bìûÏ)Æ:c÷‹Ä@!ä<.Cñ/Œûì:ŒÑbÆK¤¼çRBÀd¤FA&@ ÿÁO¤@ßIÂI0<œ^ùQì¿ ½“ðÚIº£ëª³ê´A{hM¢ó´ÝYmá›I½ŽÔ~wº?èžõáe­í §ÀÃéší¬Ÿ®u…^%âT/§‚Iˆþk_øOü2Þyyd;îœþt0ØÌe­ÌþøƒÙ)ð`pÓjšÁ ŒoŽåNK²¥¡¦f ÞîüŒÙξ)ô ]Ý|÷]­ŠÑeS`Ôv«ì]€-ï0xâðTÓá=O"îÞr1ÂH9ƒ6̆žãG…Ù¢@5TGᵤ‹D%Š¼ó‡àrdôrÌ2!ª, ó™Â¿“`6¾¼…?ö „ñ*SbÍ¿Á|2ƒâç/gbÆ­´>ˆlt4è½{{rx$ðçZ ¡.òëR©Ã*ó§'… âQp‘Œý‹q{BÏØWe€Ÿj‹PCR“ C¶ÖfŽ`EæIøƒõäö +€ò“%v×`gÈ%Ô ö Ê?b«.@®ººzU[Qv‰fF(u¤õô<>9}7èõ„}jï0ɵ›MŽ•¨úó)ë's/ÿ³Ëáp=Nn!±¨°‰Î79ß² f#ß½ àñ|~y .ìÆX\`@€š‚m¾Ú†$Žw­fc½¶ÍœZ­µÁ Þöç Ô.€%¬`íŸb}îTè†Ù+ ›ßØj}…½f+mw€ÊUxòà‰—±Ú\lŠVìsÑ0®HÂø-)^šuJáP˜S!ò&ø¢ç!˜í¾ á¥/\½üƒ³#˜¨€hC$ˆhŸÚ3¼}—EÞ#¹”ÌÕtæ¸ÆܪóX梈2(‡,ƒ²£Qšà91W£á*‹“_DÊyˆ”˜ŽÇRíò‘/%\ÏKKðË„ô¦NºùÐä·áÁW„Õ³¤Ìs½;¹MhÐ:pîiHSŸE>bÏ2ë-ð(g"¢  R²uÃ*=*Z;kžJJ(ÊÞžU 뼜‡k†ÉÌ.Âdñ:“I±£›@éËèeÎTùÞT¢¤ç*g „\ü3,Ž{nÝÚóLŸ³ZÒ­@ðŸKyeŽxÄ_h°“]·Œò!À.¬$îrÌýùy¹ÃÑwÃ( ¯süúuýº‰~/G¿GÑ¿ñÅ´Lîs™ÜóÞ”f9ëUöžÇ“EÎŽ˜Œ……6¦©yþ¢y~iZÕ¬r&R¸AunkùR„ýÇŒµeÌÇ3YP…‰ìá ÁDÉUº×Ú°Bå×µ|^^I€½½Ìô’³ÀÝ,Ozу.t¿5Ï‹§˜T(«f>;³Y‚d¬+ÛYnš™æåå*0Ïu×”2ÝõH£ƒÌÕ¥{s·UlD;4‘ÍpöQ‰ílg& à̸ŸÊMntàÒ½ùÒ2OáE|õ<öÝŸ›,BÆ_”ÆGitª¾š äk• Ä1ÛÇX+Ê Ì×°Feöùnq{¬xV²ü› ‰M®@Çá5L>,B­ÉàzBùÚÆ6°š»4.=4läŽ/âWÐ’ ÍG ’ZdÝeYÚ8@Ð' Äµd©Å¶Àš…)‰ÞUÈÏf ©uÑ£”fYÑ«\5i¤ck"Þ«Š…ì.ö%s>bÌD¬²ü¥Ê—,Y(M×íÑ}w¦•!·úRùALO±”ÆÒ¡"$á_²pæGnF•¶Â¯ð=^‰¹ Ó§ sÉòBŸu,vôF1ëÐjëP»ÀG‘šÖpµD$Èø§ìµ9,“…L°€ÓdS¢ÑY×€¤¬ŒZÉRa£BA×mùþì’®37m}´ÄrLöþéõªÁPÇžNáIŠ¹þVzyŠ>¥ƒ/ycƒÉ–˜ý6“ÀŸ&FÁpÄ&ó8an´3WµÛ˜*hC*È ®‚8ŒòÝÈ´5U öˆó‡´ç¤#±í.Tûhu*Þ_äV•*1ïÑÔ‚µ.5¦T w)«PÂ@ªý@RŽØg…Ky—ƒcê½^¤›‚XKæÀÚº1´4‹‚+7ñ!wϧA8}š’ä@W‘šyy4Z8>ìŽÏÎŽÇû‡ãRºKš:_–p‰É’V2 £v—* m§ÿU}b–'ZubåÙ^&-”¢UY®€å¥Áh±6ЪöˆmÀvwY^¥n8XEéé’Ö£4QŽH…Ç’öiÖ7ÜÍ0$ðã[MïÇ;º~⯎ ##0ŒHdl( ¢ËN©oháC¾'Nø¿îÈ?c[[JØ»”É{\ž°V&C–º=£¯}„U¡¸'<ˆL ÔÍÑ¿`즤®*º[æ°lw>8«üãT,Ÿ¼[»'ê{CwšZ??ý‚xºÊÅa¾µÛðá±aO­,róã$˜ x¤Ÿ"~-õä— $RC%«ÏÞ«ƒÆ¾Ýå^fmX“`mþ^J:x(™óѽ¼wßFòUUÃVÔ ¨&€¸êÖ£SˆQ±Z»³÷k]v…˜kŸá¾Éþë×YîµqÞe¤0ô‚Z¶–*ÃÔ \ª‰§XØåÒÂÜW*ø¡,t†òÇ£p>ö¦KXxåG¦dDSñà}zö*¬µñW«æÌ{ÀkÞׄ‹¿ç÷ú³:…ÚWný}8¨WŸ¥—$öÙËÎXi/Ýì&È‹.˜öºˆ îx°F{-Žºæ?mo·µ5ÛYÓ7ÓRéÁSFDÃà4#ªØÜ·pÎÁw¥Zgr¢;ã…:“S'{´b¢Ï}£‚Qõ¼Ç˜W‰°0 î‚’÷÷ì³ xI×¥»( àª=ˆëq˜2¾Á™”ùUÚÓ2»² aYbôúµQþ»bÚŸZÃE€«ï#ËŒ}h|Ôe)°Í]YåÚžUÙ+1vJʯò!/‹ó»+E"®>›ˆ«TDô2•¬IyAAZV…ºÒ†ØÈR[·yÑ™+ÁU&Krì°ÉÈÞžA@ìÐÍq莖&ù²ò>‚Ç;u%ŠJ’Ϋõõ3ª³)–‘0÷ÍÎ6ò’ÏøW]gÁxå/!Œ%Q0üãµÁxäFÚA¾¸/zî'×¾?exQÄá7½^‰^ xsücO\,жÿO¢p^Î}öO4ä‘CÂݱð}€6\…Ï!= vØ⯵ò ïÊñí4qo ª˜E€øfg…8˜9 ã&I:"…—]–%äa¦å¼ÕƒÆvboöá¡‹Cx8.kVý8XŽ‰? £[|%…òÎ?µÅ‡”œ m|±ô²»Óç¶5›Ç#Ë?¿)§mŽmMÂ+ ÛªÌ÷nÊ„>U•ÄÎ, Ã=ê{~mщ‚ÐÍ›©–Š˜¹OkÚÏoóTGb9}!©Ö·–bùUß{„gáì!âOB·å><åbŠaœÊš>,¬VؘW°ÐëMÒ]°Ä~<«p(IÌN/H;›—{µ¢Î ¢…pÎÇZôZö.ãõšv ­Kăî/j“|Ÿß䧰Π#£@ @ªQˆŠ–ÌÓ`bØð9Ö¼uÔ)/¶¡½—¶gŒS °æUþ®BaÜy iœ™î7b‰xÈ3³¤µÇô•¬êñÆÒ&¸(¬èÎn-šÈÂ1æ/ÍÆà-¹!_òoRÊJo…}.aíº±…Þ¾Œ«Èk=z ܼ>NPôçç_€B“j韰O¸'×]³*á‘w`¿^Zqó]ÔjiB.J¼%Ë.Ë —§þ¥e­ò2¾þݶþû÷ªeÁ*èB4¤Æ¶Z«~X­WZk«ücÚázžêhÐ1âê#[««5Ñqd×–¡¬´4¤C‚Të"h¡=Eœšù*‡Q¼â|ÌD‰†7 Í#…>EÄ>™U­š¼Û…Òq“«™È™­g>œ,Û^Fy݆wêdY&ú°§W9–wÕ ååÝŠ!™®diwÂm˜òrjbõ•®ñ/´·x~þüöŸŸÿKìͤûÿÓÞ–ÑV³ ˆ.|Kª¤­ßÿq°/¿”6}ßéŸõ:GG_>µ0Ûß}Í Mã>RUT`mÖë xŒ‘ááX·Uº7•Æt$†¢Ê@/(î#½|¤î'Ð"îkáö8P bÍàdWx!Ýóo¦ò®,œ\Ü-‰>ð~»»—ºÓÕ4;¾¥èö&mYw'ìñ…;ا¨C("çSð~ÁgºG‹µô¹?„xÌ~÷£°dT0:Ö+ûT&½#×VàÊËqV÷aÕz ¼Ð“a6=͠к—Bk)…Öƒ¼sç^ÔZ·‰º$rbh0»”ÔbÎ\ïÊ•!U™+¾JL‡j‡qèÎc˜´¦Ñ ¯§,œ2ü¦ß˜õ ÂcÎbT’Êr¨HèÒpÀ¤c?ZîXÞSÄMu,•u‚s‡Âél²Ã—â»»¾pÂdö´ðð¥Ùî?ááÿVx™óÙÃCÖgEž)<¡þOxÀm’Â/m?.pȯrÿukŠÙM1ø7™€'ÃR°;Zpø£‹´I¾‡8Ña'g§EŠÒ@9]PÛL|é(Å ð¤ÃJ•@¸°(Ê,ædÊÂáq4þ-ÓbÝÉ|îa1høy@ øùDÁ0÷°04>$Të)Bµ¾…P­ç›!c’Fƒ~Fq0˜?J±]#¼¬‘yÙô÷åÑÙ“(E ÑßLâÅ8ûø`ú®ÀþZÁx(¶nì°Òfç‘Á´V`Ú€ Y/rU癃i.ŠS,ÊóÓT˜?'˜>Ûü¨`ú,3ôåÁôùæèþ`ªÉó­‚©<5A¯'Õë’ßRGvßh_L]þ´Wyµ¯Ò¯±Š/"j_W˜ümESÿ]ñ‹&xÁÄüê$þÆJ•uñ·kð HOþôJúÕº¹¼²·8¦Âå¨ ÏÆUøÂÈ»l{4ekß—,g{âß`ßà[ª¯ø›£QâÒ‘_¨Êì[¥êÐLúé¿”sJt#ú ¾Êß2ÓI|Í g«­~9hùïõˆ/þõ΄ ßNUj’6e~EiiOâ’é·­K•(Eôï¨Å'ý¹ýw¿üúæàxprú®wÐï¿ÉZ X8xÌ]XÑN!x¤ïx²‹ß¹Å ~üí ­%…:˜zر`mP¬'bM¡¸€r”6ÆcÌAŽT'ƒ2HCQ/D­œ pŠº@aj Tƒ4Emb7UT‹*ªõ裡æ"ÅjKßEr4¾M‚¯Að-èWçaß,¾)°7 öM‚½A°× v‡`×h5‹h5­-B«IhmZ B«Nh9„–Fy«ˆò–0Þ-B«IhmZ B«Nh9„_ Õ6¿E°7 öM‚½A°× öÅг {ƒ`ß$Ø›û–Ànz Ú*A¸I6 Â-ÐD&CP4 Š-„3@m‰Az ‚ÒØÀ›48ðæ·Œ_þþbPnÊß(R¤o­">Z‚mÂG‹ðñl1EãCãj»ˆ«méM5ÂÖ6a«EØúŠÐ¤±å¶tg®z³rzêõ:×áºN¸~jüÓø¬>ʧÎMq’QˆaˆÆ!]Š:‘¢A¤x8k|7ßuÊ·CùÖÅ(Œ‹\FN##7B#ºT "Õ&‘ª(Ghrl9TŽ:•Ã¡rèbk.£5§ášÓxÍ€M#¶.å&‘²I¤Ü"R¶ˆ”Û4Àùƒ&N3§)„æ.“§Y„Ó4ÂiáF"¡™D—ºI¤Þ"R·ˆÔÛ4Õy&6N3§©ÓÜÆ “¶r*¶CÅ®S±TìM*v“Š½EÄn±·iž3R,ͱœ&YN³,§i–oÕ£ø —´NmPA7© M*è´Eݦ‰ÔÈè4¥sšÓ9Mêœfu¾YT ó-Q sš’9ÍÉœ&endeš–uѶi66ŠZ%pZ&pZ'pZ(ðÍÂJ¼%*qN39§©œÓ\ÎdN³9ÉÚFmA‹ N« NË Në ¾Y¸ Ø«Ns<§IžÓ,Ï4oäyÂ?-;8­;8-<8­<øfÑ Ä©‰§éÓüÎi‚çf†7R<ᘖœÖœ|S_ýd,¢‘Q[”Åm#íšÕ„QNp£žà´ à´¢à²¤0™BÕS¦¶,iF5Àr€õ§—ɲn¤-3[éšùš ››Ë”mPe#cr#er#gr#ir•5MR"ɤŒ,Å4Å<ÅU¢2Q‹Ph 6ò7W™ÁD%Û@eÄa®±9T˜³1TE=m'À‘oô›Ë]Z|Ðwiñ]Œ0€¸‘/ì`ã~à^ÚüÛûúï&’\ÑŸ“¿¢aÐŽíàn;!$qöØa92xæñ.ËætìNðÛÁn¹³¼¿ýIª/ÕGÛ_3»wöìw•J¥R©$՗ʃÑóL4óü:šŒ±[B/šj¬©‡U¯‘ð`SZNSvì¦ìü¸¦ד•XÚ0áı¬|i£½åV~Ë*ßbõ7½úõ’+¿m•gØš[ 5z ‘•ß¶Êo1j|ÓË‚¬+/Lì"ôÊ+²ÍªÜòA¯í©"[ºHI%f-OãÝöñêµ»‘ÝqDV¬Ú™M¶ÿÚ%´ÂmeؾJ„…É°íXØ–ˆ÷bé–CþÐB¾c!¿é@ÞÃÎ+K­ÊšVe_0„¤Æ+K¬ÊxÝM«î–U÷JcQº[¼¶Ô®-±jã•·¬Ê·¬ÊKÇx`…„WÞ´+OíÊ«rNË–E˶¦…šþÀoºY¸àµÛ£•Ó´‰iÙÄlÙÄl[Ä<ÐÄ”±Â,'ðÚ[víM»öÔ®=±jçÄ<ÐÄ/6ßLòy}-»¾¦]_j×—Xõñêwtõe­7q^_Ë®¯i×—Úõ%V}ªzjïC¿½f²ÌkhÙ54íR»VáCSaY Íô–×вkhÚ5¤v ·n ß¼™ )ÇÙ²q6mœ\Ë0WÒ 6¡ä8[6ΦƒÓ²Ê³l&„KËÁ±2UF©™ÞYXZnÍßœóÉšUŽãaj¢Œ6³Šqcžø֜ϲt960˪c3*ƒÞ7È|úTâŠaˆí‹u'Eøp fxû§˜híŸb‚;¹Â´ow²El/„·d…{èR«}BFmj¾R«%æÀ†jJËiÊŸgOþƒö—¹œh¿šÉɶ%'[–œ´ÌWË’¯-K¾¶-ùzàŽ”G¼þ<¾ðçñ…?/üy|áÏã _øóøÂ_à†­0Óž´l°i÷$µ¬{’Xæ[ÍìûC˾ËŸxhùòø‚þL,B_ПM˧Çôç–ëUPØ0Õ+jX‡$…o1®ÈðcîIü`r?œøÄmš½¯pÎëm_;ÌÌSrLLo0DúªgúŽ”“5ÐR·BåȬ˜ º©wÑhzš"ÅìÜwöåª+#¶ïªé÷ŠÑÊB»ˆ#ýfÿæ‚Ù7¯Ûñm¸›‰æBs`'çK„¶£„öXÄj·YíˆHP†¥x“/ ”ÍÖËT N‹Y,Ûë½QiC‡ÇFÉó…!!)‘ߎ²7o¡Eß #¾c:½îh†\€eaDC‘m£²E›¯#[X¥NØ*]Il%Véj‘U¢NÑuôSU}*¯K¯pß”.âÕÃ0ªÖ QµÊQíÜÕŽ úGr "*IÇmÊJ¶–•l••ÜYVr§¼á úŠÉè&B‹ß˶nˆ°µ áÎ R“Y@ßïïOàø xòåêdÏ&É2O‹Üܽ%.¸ƒW*ÑFÌTèwp'XU‰WÕ~/ PÝWvû›Q mE™–×´Ÿ™ËÙ=ñDD@sõ nyÍZZàžxóåX¼Ã‚/µì•K2Õú¢Œôb`%8bEF}™K¾dÄêÖ›_Un,½ªL8ri竸´csiËâRË|‰¥jõ%–ªÕ×–Å]½Tí2÷G-T»}òcnà6¾ë ÜäßÀM¿únó î߶–^¿%”*xß­`ô>Š #…_ÙO öÑÕÆÆ>7Ë£óù¸_ aDßæc @…Ñ™²Ùð2·ºd@%Û7tn’í2O£•v5BemK~#rÄfßBe±*¾mA‹€\©6-}‘¤–ÂHKcà'S-•±c¾Ä®ú »êë¡¥¢ä®þL,%%võgÓRSfa×ÕSÿ.¥¹:ò?ÿFZã?÷BÚÐ}´ôßú:Zóßì6ZëmëxmûqíÁïtmç‡]D{øÝî¡ )ù&÷Г¿èšhÌÒ{h;‹®öUo"–GÅ6‘\;Ïž>9:}Üéuè°˜ŒæfÄfÊŸ“zÝzc0ž>ê=ýùH H¶ažÿ[ãÓ9ü¯úƒOaÿeNÒô6O–¨Oí„ò–/œù§\6æIî·ì žäáÀȽþ€€žãHÙ§ìW¶VqŽ³KÄ¿“«Ò2åååûµµO£ ÆvÅdP `Ì Âl“5š|€œ—,¾%êÜÄoÔºÛGqy¡Ú“·Ãó®[àùD¡<á_^ù||Õ÷ö=P€”ݨøÊyPVðe'v£kAœÈÙ`šÞÊ,@×òZ`Ð=°ÐiÚ·%¯ضÜféB}e/è FÒôRWîêíÅülyL³²·Âý”júÆç#¯¹áèñÙÞ©úSÌ<1{{y5 KÚM„f¡P¾ÅxÿŠg*¥ú=Ûú:F‰NP²[+‰NY@}K!ÿ»§?§³Bª ÍÏ÷™êÀ3¬Ðñ¦Ù¡Àë.ÈÕh~9¼·™ª£…Î>‘ë¾fl[|på¿¢…š4øäÓ«o{ÄÄqùŽ½Þƒµ´t˜+ߢ„þÑ•SÝP‹„¡‡ÿ5t&¹>»ª7Ó±![Ä/Ç’˜^êþ¾Î_ž +ªfز>M¦2r;¾l²0¾öšÝ†äÇÛùù@ê I ¥Þà´:©¥5¥,ÀÄ W\q €Õ醚ƢÎfZY H¬)ŽÈôŸJ¶W¬¢$TQ²¸"ƒC×ÆZ$"^#GIŽþèJæ€WX&EÅÎ)öüYÅ+´¾¨›d 0˜Fýã«/ŸÅÏ ç/q’í1˜8: Óp”@&Uã<8,ºÂÃ6q†m¨†&áH-‡PêT T`X7T/•éÙ4œ¹@ª*lšù&å õÓ g>`ÒêvnB½ë¦¦”Ú9y÷³ËËZ¤:Ü…k+ä´–l-Ø^ð`ÀŽ`[5œÿÖ"sŠÅq¤Rpõfe±±["ä øA™%5Ò¿È*…+Þ62¸P°IöbÑ^,Ûk ld¹•,å¿LÎDNdš£ß@vò0|ZI÷;{š% xüV³gš-`œ${ÀìÉf¶èx4¹œÆ‰<÷¨î~ü÷5Û4CÌÙdkñ¤"q¤Ãx‡åN íÙý·ö¹šBÔ߸Ҫu­åGñ1Œ2­,•U(·é庣©ÄíK}ë¯$¯´×¶V]0qY¢Sƒc«¬¬¹¤²í•=¨,e½é°R+Ïë¯,íSšÙTʈhTÊHH* €Æ €ÁО?©äO_=.¾®n0ž~ÿ@á¦Á µUêÂ=ÐÃýO³öµfm½ô&>Ã÷-'f~×ÚY2¿û]'q`*§)!Œ|c m|Õ„aX8çp_=ísÑ„f~0MËYi¨Îti®3ýÞ³M¹âÕ¿©„&¢†nþÌ­êõŠçªúò‹7W…>W]8[Þ2ébþÂG¥²‘.Ÿ¿Þ¬Ô·™ÑÞ¬Îÿ¥s\)ÎW¦zs\)(.œ˜ã²B.@kÀÖ2€íe–ì,x¸ i Ä"€d@º  ¹  µ `kÀ¶ `Aøó®/™s)ÏIîsŸ2P[ㆵ­èà®B„¾qVùUß7Ön¥'ßm[ÖYr¿¯lÕç˳•»'à±~íû¬ Úíîe/(¹UÚÛÊßHteIï²=0ô–uăðÎû¶òelZ­-ÝkAöÞ˜³"Äqʯ㈪ u‰SNnó·rÊÁýþÓ)ÿÓ)ÿ¶N¹ÓŒäÔÙ¾óüõj£Ar Øï§8Ž–øï @]W>Šï5ó7]-žî¨”PxU¥Ü°•.O6Vw±Í¦;’ßY²zðw»!Ê=VÂÚ»i¯F|{÷À‘ÄA¥ñµîT|o§kR]©x™/””x)ºl¢ Óap\¶¼Ü—i&¥‹g´DF—:¬;°Ê®—¨`‹âKõ)Y²‚Ööqst»UÑžž>9úåÑé)s\¾K®cÓª·§yQ‰äCäòPc‰J7©!.ØÙPMªe7·l®¾³¤½;7j/ÃË"ôþ.¤>šÔ–›ÔÇl¨>ÔŽë¡_£Šå _„•²Â¸:¨™®ÖAtA©´CX˜i\›E ç¡„Wï¼?d¯µü^Ûò{m+ÐkÛ^ÛôÚ®é¦5äzn+·À÷ PïN€¾@;Ò†ßÜ4ñ¹’¦>óÒ¦Ïã4Ðé–ßcé¶ß±X×…Û±¥åÖ{7lã¯#j¿‚žÒ¾i$¾Z ‡´~!¥„æ/¢¹u#šù5vuí ZÂFi³bCIáàPMªes¥U•R³˜-;7b Çn!±ëTì–ØïÇÂ-Ÿ…Û”Tj[èõÀ‡Úñq=ôkWGòô'©Ý»;%½[j ÷nØ^éÛ Ö .~Á„ß[á×cø¥~3ˆÝUbW©¾°ü!¥ä¡/%IÓ$ ÈI’% IJ≔¼¼cCŠsÖäVr;„óA¨ö¡¥@ÓÓÄg…Øwáš>ÃÓ@¿¤[~÷¥Û~/§°c¹RÛhGϹ±…´гÐ+êü‚ª„¡û¶ªÙŠbÏ⑲H¥aF´2â‡Ø¶ÿ ƒfŇgq]YÀW –ň½Ioí,ì­¯°U7讃õGön~o»eG=f‚yÜat˜ÃðpÃ<Ö04ÌïÃï5J- Ÿô諃LñX(,ÎÈ÷žÖðõZEŽÆ°7¦N§ålYU£¯VŠsa‘\Xfêðð;k Îï‡ß|~oûZdëk¦™ªïZå}·ª~_)È·ÃcíXvx ž‡îa}X¨Ÿ,ÿžªäéN2ó_ö|µÐÿiÀP4¥°<[¾ú='éjl÷G° Ã…-ˆyðU±Šë«%o8.¢XWðSç¤÷¨óìY´½è •x6üŸü´ˆŽäx[êvíiÄ4¼cÀ­­Ä_\úäý¼¬tIeÀÉÊ •ÈÞ¢Ø2„ò#š^áŸvtWG(ƒï¦ŸÌϬtøÞSe%g§Ó¼?ŸÎ†“ñ³áhXüŽ ‰nª(‡O¶M¨jE´ €?¯¾!ZÀy€Ÿºzd"‘ø~n% faü¡•%ts^ü$#ѽ˜€œäÓYLúVVF1ïúá3÷i(±håÀÉ»"I+ÁƒÁ? PR ÔZØ¿kÿ-›áG\¡øŸ>?ytúëáqt ¸ž6Ñ¿þ‰ÞA|ôø°ûË¥²Og/ZTJ®­­!ã¿÷d²±7„ⱶf"£ „×ÝMhåÃE í5ö=“úÙ;,»åg£4éü?ßT½¨^.cì ´ h‡µÊ€4AµSeÈBáadÉÍå=“™º™;,³åfêê1wÇÍ5Õ¢¸Š.ùžh!t²ÁŠ@2ÖÄ[ Ò‚þæÊ&Û“?üµßŸe½>- Øì÷…ðÚë7®µÏ×`´X1Œ×n•Œc[Ðá1= ,\é ‰ÓëçpÈJ­­¡?Á®ÇBFôªVJaT¾ ôø]óéXÚ¨Lö#ÆXØÁm— GÄÚ”‚ª*¦Y¿ønäB+‘€Sä~•/¤îtkk󕬭ÅêQjÎCw k¾ Kæô@ôÌBô,½T$±”¦H±¢c󅈎-DÇ©Hb)M‘"K0dÿÑ›¨MóH%ˆig£‹=•Q䣫É4›^c÷½‹fWY?G€ÎkÌ®×£‘æa>Åä®›ÜÏÆ…œÊ ãõ!×7Jt¸Vñ£wÁYËf³|ZÄGí4º{7:º“¶Û ôÔÈæEûmÏ?ªpt¿õ&>6a¼…@¡µ<¬£xrt_*v‘Ö¡ÄG“Ñ ô¸~|üv`it5¢¿FðÏ.|¢Ð#ã¡¢*–?b@òü¬PQŽ¿káïBÉîrüÑ´]ÄßÕø»~¿Žº—ŠÈJö‚€½†Äv/<–€È$]Õ ²1ž|¹j€ x;¹Ì¢¸“Ô;Ê4±ÞM€Îc–Ùil`qЦNJ6º âBÓG¡zÂ&І*Êoâ‹Ä$­JØDÂ64,ÀUDMC5Juw›X‰n¨·#‹ñø2èˆ0 I²0;0ºÚ§ãþ4åã‚*Ç®ë ª„lG1€´¡¿A¾á'H´Èfåš²\³²'MHÉ°îÜlX磳|“è,fdÓî8¦nù(ÛŽY´´zÌ®:`]J¹pº¬@؈X:ØØßÓ‚™M«áŽZ)·Z–èX,`÷-uà9"ÑÛìò<šœµÝÜ€Æ/ïá Ú^Ii è÷RÝèš}‰ê(*໣¦`²µÔá‰Ô“Üëı4,mÆb÷7ŒÈùÕ H¯Ã— ègªøåä£_ü ¬8ó^—Á³$èbs™¨a£ñ!£ÿµfýæÖšÛÿ•¬5j8°Ç*jÈIè_e´™çF»@CµÇ-¸n)Rñ¬ŠÍ|¶ÈüÒ ”¬ Ú“Úš ¾54w±bsÏX{ÄRO y «~úÏ°ë³1æªÚj;PâËê®Ú àÕjŸ¥Ø“L€Oô*Ư0–¢g»Ìý&=Î]°zßs|”´0XÝI<DÎ -mñuö¢T{ÓhGÓéTûEž‰ç ¨:|KkXf.mö¦œÝð¤Mg-°þRí•ßu2˜ÒïÌ®G£¼˜û«w¨jcyëÅ! Rï!˜@CÆ=z’x¯?:–¤‡…¢#Y,hêªLM³b°»;û˜]ÅÊ›`IHúQ·" +ÕîD‚^fž:ma¶nÑ Š÷ÇaÑ -ÁÇ¥ég³™Fñ°Y{Ñpÿ¨ ÿVé³bõzJU‡?þ”5H KÊ 澃DÔø<+QÚ%¶¤¨«†KŠgGÝ:Vl J@–·}È:×Ñpü!Ÿ‚€&ƒ(Ý؈ñþÞi÷iïdôÒM&„8G“Á@ͳ ¿š{³ˆ§¢Îç“Á ôGÓªhk0Ô¤xõÄÆO´å°ï¡¦q·G`FŽõÆJà·€ù8™¡á¾”Ö²JÛ®¶­‰*Ý`ÂÝ«¦žà”8Ìó¨&kܰ樽†hgB¾¡R½F5š#•®wÍi2!'Ç6º’YÉqÚõ’wÒðæ6.ŸJÑ*T{Jf5Z_Ý]!¬h>ײ¸H_©‰µp1Íó~>@€çzN3Ì/ç3LûÅŸçÐ'zdÀDéyxxȹÐd\\LFùôú˜* H³øñÊëçöç/þ’x²¾ôÑ/r±€÷6‰ßeÜs AØÏ&Ó)¸òÜq8îI0`؈|<ˆ²‹lˆd0»_DYQdýwøÙ`"ÎÐcŒòùX<=†¯“ó|<–Of²åž¬EÑ#-¨ùWtK†9–uëá<'nÔev“ÁŠÀð—üxÓX_cÜ›ãÈ®ÿ#dÏÌs]¨_eª¤G\­ðJ˜P çшÒqÉö(ÅÁýýý³Ú6óïåN˜ï<§g;1×z2¡šjY^_$ û­]òíÝ'vË+¯&‹ª/Íåx¯y—ðYMÙŒÆ9#SV"J2yß/ó(¾¥Å‘d‘þ!9©D¿Ic”úWä:PîÑÀ“§ÿ}hv€NOGÛ-’ÓÑè´ÿ¡˜ ›éél¸ÝŠ…P€ä\í-§áAq ö©\P§³y3ÃsÊ¥û2–ÿ“O'¢teEÙ¹ ÷H!aüWðÙ` ò®jAÒ«ºDß-ÑÖ8r¦1l·NMÜ·ËΦ—C]¸™Ú¤,#…í¦Ä›2ËÈRú% X"·”ßT’×°°jÅuìîX®b%1@·“é÷±“¼¡Ú°ø¯ ¥MÞ¥¢]Ô¿e—ç+Un<—šVþùkÉ¢#-6Ò²ãA»Å_Q~ÞÍj¾p“õ¹µÉú+üj¾àW{Ÿö@¼2_ñÊBñ*I,¥)R¢R/Ò[ïûþ¾RÛWö6YOºa¯Žû ¼À¦YÍúEa°\Œ”| °ϵK'Vãìe±D ³±wROÊŠ7ÜU5½›WágÅ@ŠWÖÒ™·¬ùkÂùÁV¼j7N¬°Ðòš·1§±£Á‰è¾µVØÔR˜Xa3îNó ]OÄ Ú~›Ì{χÖ™ÝïXJu<H_ív—äbNƒlÇúò¸ÜY‘ãû¾÷®`Fª™‘pfHû¥§nRMÔÊËÚKôâAr¹H†)ÉWÃÊk”[Ùìt¯©¸"WþgR*£—Ýè|:G×At¥Píîê‡,|‰b+@Ћég…V•Àr\m>É ð!QÓSÔsÚ¹›n—MtYt6¤ÌyJgÖ¥™åx”%’²ŽX˜ût@7UÛ6ÊXñâ%®yæÙ¥î€óá§hX¬+'€°@?S-¦ÓÖé7mìsáqxÔ¥‰FcBœÔ¥Ì¸Â.o5ˆJµjŽ ÄÀ;z”úíd~9ß+¢ ˜üóËÉGáÙÈX/ÕJIlkÙð•ÉzÁàyÙ ±ü2Q—¯¶wüÁûr…ë}8.nu‘¸2ÛÅ•Ùh„d$hN9Ìgqðç8àç£\¥·Û詤ÚW‘}öR®7‰¡Ÿ‰øl¾q~ˆŒÞëÖ›=¶L…sÔ¨§ %ô‘j„¸ÆÁÐ)ì®îêáªO—–j©E{†.ÔÔ·IÄñd±Ï']ºk[§*áoð¸r­E£ì]úa 橈ò÷02f²ƒÇ#7·¨iÈwjüˆ{Ríá=1:ð²‘IûHnE8üÄÁ’ƒ »Ïòù¥Øiü¶Z³Gãß/Ȩ·Øš]ïÑf‚ˆ´˜ã-v—ùáËûëßPø¸­ø'¡ùi2ŸÊÙvïãdAkBs`§)EÝ EàV%¥”Ô4I¬ƒ±ÙRÞ»^ Ó{Oɹ"A¶‘@uÍ^Æ¿‹ è›ßF<Ìñ{¡Þp"?Ç T›ˆ öýtš÷‹oôg¦Êœ3÷Ûˤö²ñÙº?ñH|)ae©ÒUÄ—« pŽOöîÄr!®f¿¤í®ò„KV ¿,Ö¸U×IHì<˜ªŠÅ$miò ݧ¶Ãå¾UEíd£X‰ ®WSW‡"±3W«(Ù²S´m’rú’Ô[D®‹eŸô,ZnmÊå'‚®½C§/_uê¸'¦©ªÓÖà¾ÙYmnÄ´I§¦×¥[«T–tksUgÁ˜‘s^K³³¾þÚU%ˆ.ýÛ13Ý®ˆTÖ9òágú†eByð„äÞ:yͯÂË BŒ6q½N»·ç$uÛ´ß•ºé/dzõ¨+«éO®®£.ž2Ÿ@1Ò2ãÉt”]BKQ­€'V¼Íeô6›EoAµÁà‹Î0 („R ¸”ãÙðb £q†áIñ¢+%Û+™Ðë ÕÙSlë¾l—²[5åålݤïjUÔXv"Ð_/`ÈñS¬jb\6åöM9Ì?Ñõ<ËâaÒP3µU8×:’kkÐXédö„ÐÊÕP«;V«õî{˜ ÊF½b“„FEÕ ÅOÖ 2•hçJ B"B~èm;©Sd)¦U€>‚õ$vÅõAZV•¬SÂ-KK…¨jDåz³›9vІvÊtP9ûQCmàŠÙeO¸Ý4tÃic¯+C-UОVzbÐÌJi±÷c kqñ +õ,‚¡áöMî.yqé^4Æò&óq;+ˆ–•²FvôÕë£zªdö+Äþ@A¨“È Ð‘šÉïwáåÛÎ?âzR‰6¢ôïø¢mké©l2-lѶ@çʬ¿Wn×µ>¢ûD—£É¬ûÍ_||çy‰ÓÑÙo ÇÃñ>D)¼ÖȬ~Uô÷9}§&å‚Rš”"«;ë?ËÇmÊó üaw§Z5³ü®ªãl2¹Œfísð>s$ÈìŸÓæ9ÔÏp %–æ;gÚΤ^˜õ7%(J‰MÄö¹ØŠÔÛ…VF¨mºÏes*R¨œw4H(&%kâ<íZøÃBÓNx1#A÷ГJAøâþkúF-sKcZÓ M@¢­É®¢ôk¢Ctïªmm°ÄQHÍ¢Ôê™!vï4Âø¼øï|:™Å…Üa;í'ŠÖÞ!±C} ´h·iåüµ¶ '«J4ê©â¦fú¬"ØʼLèÄ3ÍYu’ÌÖC&_ jÝš°62\ê à4Ü€²?Þè3Ÿvw·l¿×ê"„&ÿ˜]±óÅ@Ë…®z"ô8Leð¶vvyÐúÎ6X(QYv¦6‡gÑ?ÚT«8­…5¡EŠoÅç¯e_€±ŽÔ‡œ˜~8µ*:Ïpºv&j’Œ¢¬³r.meìqïMU|?%̶ÎäÅqlI«S£L™³Þ½‡užOF‘†õç»ÅêÓ¸Ž£XÞÕëì@ä1 '¡Wƒ_ÛC5$ùÑeïh†½Ù° :œ«ÕÅlŒíï›­yÚ{úë!µrÄŒ¨)Z`¿üº/g^±iŒf¥¢*,6ñ3D h-*6éü³‰m‹+%8ò¸ë—4ð>d—óÜo×Ìn‚ÆtO$':ù$;ÏIÑPÜ׺æ@(!CŠÞåæG.J\(]ϱTªXn]’yG‡O:2oMnGuú!Öý¿²A±1Hveaû›‰Ë¸Ü!^N>.e7Àpª°4UBþƒ©iL :½É3 )®ˆ¡­ؽ.r)Aщüä<&ÚÙÐзպHñÏi´ ÈùxÑø…Ê×aW-² zÜÍÓ˘Õn›ñ¤É‹=–“D˜-S WîËÈÛ¥ù'¹çsNº'AþV~GFé@ «¢¿J vC, gw~~žOóøöãÙ9ÎðѸDwóq2ÈL›ä3%Fµè„*ç³Y$„öqŽEb·$+2«,Ò‚müЊËZVâîá±Ä}V”`8ÎƃÉèˆ&ùOòq>ÍŠÉ4º;_Ò‡EÉ7‡µ2è¼›c·LGtw4ûiø ÇÑ»¾³7Æ?pþ~>üࣘ ŒkâOUR ¥Ä…pÜoq¯A·ŠSr4)~B[-7°òh½daN4( iL.eïc‚“×›Û—WÚ^šn‚›qÎFÊ”ªÁÕšK<´±OãuxžËtÞW3ÿ(±óŠ6¢É•ày\Ñj¬ŒÄ:Îuóâ¡œº€Zpx¨…çX*x*³é˼˜Œ÷%ÌA\Ù<ÎÏ%WÊðü<Σ©±í'Ñjh{'7@›ºhm›¤8w‹ëS‰øéì(¿ óˆùWav@iÅBQÊÅæóˆ•)#&wýjÚWJŠ-¿ÕŽîljfœ#Ì"I}ÃT¾_óTÝ«(2 «§Ä $Éqv ûa0¼zãñß †g iãüÞCªh @M2§Žj8rpt\?•áÈjD"Ê\Dçeˆ2’².›*R÷EªÞ¿ùmh@ú„¯d‘¾Š®h“=R'R>0åV­îœ‡’Œ äHýáÞŽ3ž±ä"ür¬~“*¬¡«ëc^£ç'[¦©BPÌŸt×÷ÂøùÂƯA?ªÚñÔ‹¡DžP×¹|F'‚5§ï0â ÔdÖNQ#3PÚ‡¹:åT‹ïL4¹U{½wUšmÃ(—ø"í‘h›F_´wè-]a9!‡ñÿƲ¨*SÙÓë”_cØf•rjÊW6V!Km˛ϳOÇx1ÿ€k_1Õa´­¯Qƒ1î1¿Èówñ¹½ˆãY»}òôÉÑáã =ƒéCãÓN£‚ó>µF S?ã‡è­UËÍco©ë 牻ôýN©ŽŠ“wëXlo)õúžÈ3Š£ðÒ÷u's–ë«›+–üìC:*L…ƒ:uC xŒ¢6rPâ!HŸã“cy&f”o¹ô̘ Žš…í ‹s¢fߨ3J•áô C´h'>º¤¸‘ÓY±µ$ÈÑ"ù|8>ksÄ\.múghœ£F˜Ì Ñ$Ô¬½ÇÏ;¯âä—ZÄ´š÷²é—#)vfìjT²ÀѤ`Ë(cjþ¦!ñäX@¤Óé¾…ˆn£F`?ªËõ+]bcpù8|Ò¼-X Å"õÖåì1âjg:Í®O†ãw=~+D²QV…5Ž›!,'psrË{×g¬® ŽÃQ{` -0/t_ã˜ó– Àm§ÓZÅÇɽ¥D¯ÍRSáAӹ⶷r¹³!ÅUÒTa"ËÙ^#$WzÖÖצêðÂê-Ðj”9jÿðxi?0ö¸XO¾¥¦Q>îS•2 3È©Eî´@?j¢ló9ôUv‘êu]›H³ž^n,ÁÃ^l/…¬\”»¸ºåëü’~ “1´é›Ogqª6,ògjþFïô}c¹OÉÇt|Z£àQ5q‡Ó)®/;EjJ’+ÁòœíTïb¶kÙèÌ~îy!X»Ê€•SîUäæçG½ÃÞéIïøéÑWx$š É—R»¸G]:WèVÿ8¥Ö ËzÒ4>ØU®±üù*¿xòb‘ÖÇ°T±Ëa" ŒW©}%U‚^C²;YÊ'7λt ç4mI¶cTa‡D•ZÁë"çËeQƒ³Æ¥ Buz@¢d£¾™ê±ñ•ªl‰ r¸(S¸.óPüRξæ¢ÙŽ³È‘å‹´Ïì®° :>óÞØR+4ÂûgÍ”Gž¬?ÉûH@÷r‚ÁŒæç±€£>_lÊ:D~ ùµÈÐJ»øB'|~.i(UM'W±H«‰:£;Ñç€AfÙÜ/lýj›´zƒòÁY¡³{ú!»:Ó‹99Ý·h’£Ñe9Ç[TÓX2ÅË5ãÄâ6ÍVô2p6¾À£ €Ïì Ñ œý,i ðM>A}Mä 0{Xô¬ð äÔMxÁ •)Õ¶¨ÙÛÒú–ÌüV;ÞR¹(Y“H'=ìÑòçà"¾È¦Ù(§ƒx·¡CnÓ®x~CÐæ8üvé¹­6Ì!ïiÈ@±½Ém¹ŽÅ'ƒÛr]lÙÒúô=þ)==>zÓÞ«ùÙå°ÙÔ‹ìÝõ5UÄR{³<葉èÓ¡ÈíF£S:Oã¸ú«3œ\¬€aœ¶¤ß-#帠Q‹dMª 9Ÿ¥‘ä â¡› ²°iCbÚ+%õôÉéáÑ㧣S˜£û¤²š€W«ú?_$Ííæ)rgÿäoäN¦0ø¯ü:æT,D,Säü·ýòìYMß!º|о]¡Ü›iÄ °4œ‹pN¸»¾!9,.ÃS6`Ž@@i{èE6œÎ¢»W(²3ëDêv$2Ðâøÿo‹v%ÛÎIl¨F‘}RÞ”ƒ‡¶hjã™Ú¿ r¦à”%» èvÍ;¶¨Éüi—â«×ËTéh8›áõ, 4Êdöm©Ó¾¯^¦¿„÷ŽŽXÔ “Á²~$ÅbŸ$Ñ'MkM¼ AâA›ÔÑ íŠœˆ“[Y÷A2¡z‹ÁštûtÓÚKÚЭfoôèÿR ¡ ÷ôª˜î+ux½œ§Çã º)£#yÒZ¡“Ö’"íJ4)Ü[XêMI6ây9Ïçytö%tÓ 0æ=¹š1Íò÷ñÙ{’O«M3s‡ ‘š} ¤ŠÎ @OTò‹4íŽÁgY„íÙ<£ÇWeë¬+ù{gCÓ™:ƒYTvIÌQ³Ø³÷ž£*î‡PtƒX¨™²¼JÙW›Ó|ÐxèJ›5¯ öPÈ\îZ€Œ©*.ò‚Î$•iÖʆ„LZ–oJî®›¸Ñ ‚»êJ Îv$†Ý]*9Ogßp÷˘¦N"r£ð¶)ÉD=Ž;€]\9£ª@í¬¨È9à¨[è’š(ZE£û4ä¼ðà6H ðáÓ%ò‚›©ª˜Îé(±àËã§ÏwuX~²K/¦ÃQ~’_æ}äìÆ•þ¹pÄ‹¡'o?ô&j@yM³U2>tamm¨Ce³{ŠãÈÇjuØ–7T2Ý}›ƒ˜@ñ¦t Ðà¿ñu4›é„pt…•c8åèµêÓ7¢°êÆs°ÄE$Ýá5UÝO˜J”Ç OWšS•µHsIŠ¢jMDÉA·LÆ—×ðOî…‘sîIJdAµoI5Jb„ÿrœþ§”Ïâ¾²Gq7rñˆpyD”×h[àé‘øªU²ï³iÿ-ò{ Fź"P-i€Kþgue_Õz6Íq.èÎ`ww8+ÀKÝÕçMb;ᾡ½ïþ^ðLˆlT˨’÷öwøÕ¡˜goÓx j>â.—5ÉÃâ»}u›Ìœþ¨VqBÝW~›:fA'ø™:ü¤Sevl¢#÷]úíö½ú=ô5ð×'ú÷ÚòüD¿'tj¦SÏYjG§þ$R×[õoú×DÿúYÿªé_›÷Œ?L¸èË]&Á˜œe0]鋳Nì< päÞßéGfÜR¹ù¯'“ròK<Ÿ¸}¾¿;8 qf§™Šwº1š‚ì~È0¤]OÀ=ìhv•÷‡çîJŠ@pãæú{ÆËÛ€{óü2»˜á¾•8£4œÌvwÏ@[ŸóËgÁJ0EߘmŠóN˜î8 ÖžÃÙüüœŽ{SŸ³ãAù¤_D8~%=” ¿Ée ²rrÏ;dð¼Í?q<òœ‘DÔ²½½80d•nðÒM»ôæ=9eå»=I;«Ñto=‚ÿ aÉ,ÇY:ÀfÜKéVÛ; ?à§6woeŒR„ÒÅ.è“é9©×oÚ·IÚlmm?ØyØé>z|øÓí½8=eƒgg}àÀí=¡7¢9ÞïËd‚êÅ.@ÇH¼iµ+°[ʧÒ8Àv–ã~[.° ð4ª~­óÖ-b¿¥¯™m ƒ2dˆ?IDTh­×CPWmhák|cúN)R1ôCj%½…/{dFáÅïßúnHÑ“âá’èiÌP ·k·­CÜ ƒ Ï°W«æhh‡Óxìî¾ëãWö‰ÞtÃ9pN[ÿÖÁvŠ¢à…M±K™˜©¡Cìvt©Š² Îþuæm³ä¼{9‹êuâÀpû±ÂÚÊùb5·N^Isi9ìÅd6ĶàUo­ígó‘oœ”»Ñ™>‰J×¼÷”>bw`Þq¶i8çwË¡q9!ÎØãŒ>Uhá>pQÿ¶ö3;»/!KT9ˆ,JSÇz=ŒŠ # 0‡°X¯9òWBnμ@ó2«¦³²4EX¶zóVÄb5O9¦y—V`³ÆŠJã+"éµE7fh78‡YòL˜Y±Óg¾Ü1 oäk¡ ÏÏW Ú$e´T݆®° Št˜¹Ò;)7cg²Ì™SæL•9Seä0ð2é!nÀ‘ ‚²#^éæb+ƒ¢¤Ïñ.€”sÒ/€ü̪cr~“ÚhÀÈ´ýÀjzI<²¦éÚÍðP°UÊÔã^~àŸº)°P^yS¤1°ZËØ»ÀBހѦf’:ëƒèÎVjª_ä‹šÊ:[Åy~òë£hóè°¥F“ßnð¯O¨òšÄ]yd/u‚³=5Z¥9Ì¢ýè u‚o™•Ü ½œÏboÄûW^@Ù˜¢Š‚2}¨Ï–y\g›nÎÚ7Öd£åRÄ™µëà©3Ôs'Uf£9“˜¼À1‹i jbˆ«ûåóÑ2Ÿµäâ¥m6 Çd,âw±„ß²9òO±˜ã`çÅ*¸¿ß¶c Y§‹Ê/ŠX`VŒÙqt?âañ‡dx¨XûŠŽsYzo}ÑýZM]Õºñ,†c8†ù¦UUFz-²ÛÃa¡§À‹„I0±9í87阃ƒ?zÇ”Äa´YìrÕº`„tLniŒAcÝë2ÅÝÐ}g%ŠpU6£ÉR½±XNY¼¸ Ã‰ë9ÔÕt2˜÷‹¥s«è®ðÖdϨ™—gk–ÅOx`ÏØõ5IÈféªR¸ô„](÷Öµ=T‹’ä¼RˆV9u©šùG æ:#©fŠÚþ¼7‘ùìÂûrV{¦dÂä©uû"Ë-œ»zŠ\µÅ,>‡Œî[Æ5¾ƒ!Ññœ4uÜ(KqÔà8¥Ø°eR.ãêêØs:M¿ãB{t0 UäöZ(c6™JK,Û2&AÃl€ÌY›* ýÒ© J²UsE»uÚÒ_Š¦É¦Š”_¥Ôjb-²[¬\¿D^Hcy•¿­àË×4Qºtÿú ÃÐŽ4gÝu†E4Ô"Æí0}£Ð<”aE†à¼Yjû´ýTÒxâ6ŸqM–[¹0îê>•ÝÕšï ‹ð8ôüºyŽ.‹®P:ðnpjkÇȸT°Ë:û ª¬;þ+¤\3‹Ïj{qúuqÛQYnD‡¶E–‡È?y§w®½”?!ðiãúÎÈ©!ÿtµ:þ¼?™¿lÚ™‹·£OÑŽ¦ñˆuÈhºyøéj2ë9DM‡— JXø¤?ˆW\Y’ÈçýK0 ÙøñUìÏç<4¢“«½¡Údá#+î-f?ŠýÈÙ{ëÁs”Š.éŒ*›¬–‘.5‚ ¾çdi¤[#\'dî@•«WÐd)-ïæj” [!NM²h;ø¢öhSÒ&†/§ÏlÎK ·æ ¤¢rŒ0=Ú õ9©„˜m;²³Ëè­D½˜g‹6Ä3´ äî8mƒð@¹ý†ÛT¯9ÇE%™ÿ|Ñ”ÍvkøzNII+ò¹íð1ŽQ^ór¼Ð‹FÔWd.ð™è£;òö—ÜŠÐü‰<çG©×ì÷EÂdш§#MtÑDiZ¨í>TDOÙ4Ä÷ù Õ€wu üGp%hbáAë54¼€Üú‡†®%ÁZè“ÿÜ‘ßÐUKÃÚ…n|íS@ëëž~‘7OZ!D‘ºGª"ÚÐ=R²¶??}G¦.Òº=8h·@úNŽ’Ý]ºúuJ×:JƒNåCN›,²’ÀçßøhG˜­Ú ndJ±!æsáæA«‚wi‰–ú×b ‰^–ßÈU?”¡ðÊègWx$(^áaªy³$8|ž}’¥ðr­Žµ4ÓµKHÃe%4•„`‹HrŒk€8zÃÜ»Ñd»‚ü|r»*¡TŒcîëHK>õÍ`¹N˜`†6pV[©‰†;Ên*ZNFïgä+’Á‰³ª®K¸+3 Û¬àJÜ”{è ž­Êc:ȬùŒ-älèè;jcöú/¿¸ìCÒ† ½Ó&eõ Ôl|AgS€ÖÑYõLY“Œ¡tSh UgY¹Jœ©RXúýùhŽmã?’ dK/=8=Ÿ}ƒ.·+]¡s­žÌªmÝ}ÙAÛî´¬Þæ]õÙÌ첬¦ò5j—Œ—X±{¡|øßlÌÝd¼Õýñæmù±Õo0ÞŽñ±î?ÎX+‘ýûëFÆ,u6X|žÃXúÊá¢æDKüq7ÖàæÏ–I£ÕÊ¿ôf£Ä–ð¬„ùæbF‹s++D—{ÇkÝ,l ÀÔGÙ¬ŸóÇ—+–,ŒDwóÄKºöR§c ýOg?Z|ŸOÆÅÅd”O¯ó+ Ù2.„Ë9˜š2\ ¦›ò}½ŸçEŒ_F §ã˜¢8ÑVâ5&¦¶ «*:g3êÝcðcõúJ˜[ŸêkB¶ÐÕ>‚Y.²q>™Ï,úý0Ñg3_Ð z;q#—(fÎ).£?~ãN–6DÓo1š.W×"F¯Câž Çlo¼ˆ'4lX‘œêŠ¶H˜,»sKzuysÿ5à3NÛÃ,ÄÙ{8Ç_„Ãõ.Éll2àKþÀ¨R[_‹`¨ÏÙÚRHyI0sšuk#lN” IIY“ÒfG&'šÚB5Å*eclžj²ˆðuœ÷çÓ™YP††Ëzh©RÑìxíjê;dbJûKQ½‘c&ž£V/þ´9‘J£ïÙPÇå+~÷\ûQÔ6ËìOp3°ß>rÝH"Ö-÷jQ¯šnTéÝk}&¨g)çš4È#`®/¼sÍ{ü¨cMP/зRŽøj;7u+÷±ÜhYàLüú“:ù‚ö…]çôRº‘…ºÆNþýa\²Ž`zûß©3´OÙ[…ýÙ²qñ{…ð6^ygÜ¿æDíêí¨0–¬¦”{e?NÍ[:-MQéäáÏ_Øá öŒŽ©4ü{äá ¦@÷õUô™wíÛø÷}DGÍT$4ü›—jïÝÁ‘é>š½x˨ÇTï»: Ò 2e…| Cý]¸A¡?ê-Úª7äË‚y”4Ž«Õ·ÌŸ{¡KÉ›y°ÝHÍŽVo«‚ÎgŸÿWãåsÆÅâÁ½H¬8Þ’L®ÖÕj¿}ÛÛîô²{Ýë×:ˆš‡õjUÈ œKÒó™dŽÇþ¢=_Ò% *ÇÇ$Ô%’m!ÉæäÞ ˜3ó¨¨>U+9ØZýCõÛ‡jUn72¦óKäùün“´=xp$þö:uüpc¶"ý\7Ó?ûõ‚\ƒÕbÄÇÇ{dz’m@k›€Î™`Ü>ÕAâø.™9øt”(°,@Ï{d²b‚Ì=GÀOÇ'`A}I6\€÷TÁút騃PT+€‡83Á½PRß )ñ‘+ÀS{ÿ_ à‹JR¯¸ÕÔ2àª×ª•/>álðpÃüeî\ó‰~uscE&g »w€dNÉM² gÈØ÷O³ÿй„ËÐkgÕ ªè‹ï¬)éöïnÇMÒý³ÓNzƒ>üBN>»WÝc<úO¸Eá²{­ÊÙ–üENèãœn$¬ÀÍçqéåö_¸}f™è&Î!²ˆJ% P«Ht¶6˜|èŽFƒQ“¼1‚å¸xS'OßÚ”â3bf’ðu?\ÏhÐçò#A²2L–cÎç‘ °±`­€’%XŒO6NJ—`4E\S?\“1[úäi8÷&½ß»­“&éw¯ÛêïÓÂÃÔõÑÔž¢Ê]Ü»îw¯šñ’^ÈÁ'€?&±´ûŸ†£ÞmàѾU“ÔuÛ“Á(m*ó€‚]jÑ•©­Àv" ØÃ|³…¾Ž6í’BL €ÁTša Á€EÉû&ù­INÁ$x@N="ä—!h¹hSk†Ò‚W8xasµåCü2±K„‹{$|AVMrÀžƒÙ ês»¿†ˆ+4½ÓˆHˆA`-p]…¹˜ùÊ HX‰vzÀSSiÏI>cËCê» åÝBn¨e)RqM‘JtL Ò" ó æñåû„¡šµ^¯“wäÀ£LQ‡\2©:Õ¬(;ð«DÚ"sÊ!|£û«ÖîQiáùw…»Ï~çùFÁùHxmÛ-2†TÔdRÏyLÇe0é×îåö%l¿”ÁvËÝÐã%Sn Åù~v"± µ}Ð$'͘7Äû âóó– ÏÞÓÅEâX:ñê›Êï›Ïý’rc¨ÞÄñƒÒ‘ÝU%³ÁPÓzB ý©™’i†õ²p)ýí٠ѤðdOC‹gS‹ÌÌ)¬¾ïúíÑg2vGEI U©Ø@´WËÍO,öèÌ»\êÍV29Ãh÷c´ïjõg¶ ¶IßÞ“§(AXÍiÖÈ»wæ[#Âî³ >‹îð°]N÷—½ÝÊ·½꜀ Õb°ûXÁâÈáiÜë÷‰v g‹(E¥·PjK…F,Ì;ŠÍæ^'_¸Z±‡^(j™`6Ûi"·Ìÿžãºð(}<ÎæåÒiúH¨r P-¬™#9dqr¯e:„¨Ô±µ…vw¨ü£Œk‰’x èð ­Q}.AÚ£ÞäÓmwÒëwýŽúÞ¤¸²%m33S~wh¸â!ôÐn..(ëÑ<È5þâË”6‹4¡2pæÐ* pŽc<׶žµÅÁ<ªÆ[5¶1\Ž…,î˜<¬(ÎRï°æp\Ê‚F Åm†F™ë|Õ`åð4>zç³]tŽt¥cÀ’ +kÒÒõ§VÐ1£6z<ÇÅ-× ì‡Yê´ ;©/›£P‹¾€q¦¯g:›®é<ëZ™ÒgŸls+ë([vèã†ûêÍß÷³°å™¡…ÌØ·®Ž7v ÝëÏÓ¾ÎWøõ˜$5KR·ñ•¼#êkk'Xʘg¢¦§ öË;ÌÌ)6u\‰uÐŒ¹üš«ÜŠ© ß“:P ëÑGXч„úm¥ZçÊPÅŠ²k*˜½Ì—:æfßâ /fvîØÐj€°˜ymçס4ž…Òðÿ2[—[9X¼ÿÝ¥fQ~ÌëR %1á®y¤¥Þ8^ÏÝÚ‹÷KF´NydäÑÑP ÛœÄg,Äø,$—Z{aJ¨çı\äïõ‡w“ãÁÝ~eb½q¯”Ë éžá[{ê¬3_*$³Zê6PéJô%üY˜îR§8Ž©³WW¼æ+̳ª%¨ò·:Æ´£¯L?äørÉ×4ØŽìÐY…¡ì¹OŽ·Ø}¶½x?W+zM€6i»ƒÂrŒìǯ‰,Ê=,TÛucgáºDø˜Õwà‡3•Vc„.[,~£ÉCÛã&€˜ËŸAš Ÿtí0ߥ©Pr y:®öÝ ðÿzâòì÷ËÊ–À‹þˆ~èo¥Ñœ™ïáGâ*ƒGS?;ͲßlŸÅµµ%[°µ£­yœ#k ³z«…ÓË]Äö^—ØÞ³Ä.È«» Ï{]É.ž•ìüu%;V²óוì<+Y40ï"œð¿‚½aUÅÏêeI¾IÝH–§Ùxšºí(OóøhÆýfyº¿¼†~uûZÂÆ«¶'þ>!%E|ŽZR°Ä¿ÔtûWøŸ8ú¦ÓËÁè¦Ý¿êL§¹»’£nŒ'l/1’Ð2þ·s¤ 0Ÿ}Ëpñ¿CXTíïÿPKÌ=øý1Œ+ iterhash.cpp½XmoÛ6þ,ý ®Å:9¶—.†¡¶ 8®ÛH#VQÅ`¨e“E¢’yiþûîH‰’%n×bbÈä½<¼{îŽòñ1a’ŠØÏ㟃,#Cr#˜”4%~’,ñ–S’Ÿï|Xù´'ï)#¯}fÛÏY”†4"›ÍÛå»Ùfc?‡o,¥dvõaå]®V›‹éòÝôüüÃf±\{Ó¥·˜zó7¿XÃÃÚ~NÓEh( ’"¤ä™A?k¬îXàŠ½œ^Ì׫él¾9¿],™Øg’¯V=Û–t¸%%ã ñóœx¢N§ëù„\s’X‘ð <œú9ƒÚ~õê]ÂŽð4—pH°sÄÒ¬’³èF’„¦=ûÖ¶P÷=¡·Ï(áI8ãE*Ï9qÉnèçY?cõúÙ‹ˆãAØlX蓦möȸ!ѳ-Ëë÷G¤ùw|L_ˆ=‰ß‘„ßÉI̶±]ë¾Kœ¦“ÞÚèÉuÌ"9þãOË£¶ÐDa)Ñ×ÆÆÍc~þLîÙ:9zÊùÁ%/ñ@2€%oósžn³|8™&[ÄŒwKG`°­"ÍÙ6Uü„L%<øk ^ ”Zå´ZqqK8-v vÁÿ¡â2:qêØjS¨çàƒZDÆðký]™E‚h Øv4]z¥bÄ@¡7uH R“ P cB#Iø5JÙ¶€P•pÂB&nìá¾µ£» Û;¨ÑÁ)™i$‡°Š°,ÅN§D£—•‚Ê~‡úvo鈽TÏpŠPðŒ`Šm¬:EÈU‹4— rÿ4Éé!Ü%›,KPYˆt¤Uï nà#6TÑBÛº 5¶Ę52áϜܿ¦J ÃŒQαvkŒsGŒ«hG®«|™ØC¡B*=×msäÑh·Ž¥"BÐÁ"Ÿ&ŠŒco¢½õŒÓd"y‰ìpUE\‰dYB•Üq<`ÙýÖ©Uy4&êܺfmÔN’rü¼-»Ïöe´#&  f&Ê!#’ø9 A™ìQ±™à‡¤Ô‹‘ÆÝw¸^¼Ã{kwä&f íÈÝH“¦Êë‹š&Pt:ºv7Bº»ƒ#C—õSCc&(ìèѱÎ`h:e_äŠ[·ß·[5L+¹¶X[¢2lh"še:Œ%p8åyžˆAOõõ:&èVÆ_•Oœ'@Â+ŠBK_²kz ‡º!‹¼œo©4‹jXjãÈÓ+HKËâÙæpEñÓ™æ= 5•5¿F÷ú:/Td7¤{p0]ü4K©^W» Úq9c=%¤cŒí¼YDPóu áþý2*‰¢w¿„‡®S+?<÷s©OÑÊvR-£ï.²Ìß`Ëùß*æ›Æ»…Oqb÷ÿ„ý ü¨ûc·}̲åT6†áËA[¨šºšQ·¨<ÒÝ ¶¡ûЕîœßžå+˜û>LG•·æ­¶¾$êÛÃ"eÒé}by¢HÜ{ÃR?)s²- 1Æ4_Yo˜‹h‘^à š\Gã #`Ž*is].<$â!Öš.E¸ú¬¤Ú aµê¨ÙàO:ïÖ½’€êcG‡žô•C¤íŒCÑŒC›}Kíx˜,oÈÎAë¿ ÿ«õ3V^î»È¬ëª¾=5OY"ïŸ{îÎ:fKÓ%x·΂élŽÿöz0¿¯cÜ`œÜsŽ’<¦pÉÇJØâçõ‘µšÑh‘ˆèk}5eYÔ°cé&¡zÍ™ nüùlàùáпM\O‹Ù¬í8''?}ˆèF1ÁA­¥¸çp¿¦ø,_°&ÙR!)ÄD4"X$IÄ=añ¤°Yæ<Ò8N”,Û]ïb<†k4ñM®!Æ»°É ‹`ÄïHÂâ ľ2%ÊyrŠ­®Ó¢|`jÏßÏd*îv3%u¨oH²j;­VwÒ=)*‰¢±Æ’Œvi´âJšg’–æ©}µÚÅà~} <=;Ͻ‚¾ÐQ©Fp8+.t xæ~¿ÉÆdþ †cš1í8ÑŽ6 êqCµšÃÃ!ãW0€VÃm#JF"çj,ÜÓvgûvÍðMÞÊyÆVïǸ‚)¦>%ÉPkjÎþÖµO’ª\jQ°ì]ßÚ｡é$¸œR®ö`®¨ª6§Ë³ _Ý Ãç ¦–)]<"“oMv:ቡ‚„ò•Z·{N«ØORô(üæQ·´|£µ¡¾¥™"ƒÙ.S©ùºdœ$n³ÚU‡•ÎF E#´Å0žèŠ ô5†Ly%¡ÍKºóÐïƒûé­ÆK7h¿ûÐn£xÜ*pv ‡°1uMì´öDÇòJ3I¦L‚ÜZ^’í²Î[§ vCðê2S租N -Lªœ$`°FœéÌŸjimw†è7•1•&ÀíKŸ6®£h-úиb!€/Q÷ß.Ø.à ނ–ú0_ºÀqg®P]»-»Ã”P°Ë U“½oõ‘ÐŽ|ÛT‚°à–Ó,ë@-áAh¥{km:˹!!„gKÓ±›½²3YºÑkΚ‡õv.+ê¢<@϶ªåªÙìªH½éd &;O½ß磿|¼¡u{''0ô†ïOO?½_‰D¾ã.D„ÿ¨ GJv®k*i üf6ûá`>÷o×µpá Ô^ßÁ/XÖç瀥¤O\T;z@§ˆ±„÷Žùr·µÐè¾S|;·½Ýn |ž§n!Û²½`#T˜CS eY.èáÖ+Dè"8\:UÉéfb:Rý„CצU…£·né•8ÇÕs„†Ûá  žëM·®»êê³) uÑ­ô’=ÐXs7§‘áñD·üžl›sͤ݇ï«ÌÆŽiõš­ uÏøÂÌ*#1Tò'D²Å0ó-ÏaI]‡¯ªï/L­çFÕ©N«ªy/Á”.:BÎj ’•è›š-ñé61ýŽ}Ù>ÔZÇ~µ_Œ®üyP•»ÅÅoõ×®Mk»Q|;»½2ÚÐ{nüøeZ”…‹Zý·ùÎ0lt¼r>Y¬`ÙT‡lõ®‹y5ÆÕIåð®ûêEÃDÝ·h ͳ†W³ÂŒW­ÄJµý‹Jë4„«+¯8Ç”Þqù †W“Ï^ZŠÀ/Š0ðofãAà‡Þ;õþp®üµshðõ,(TV0ò^vƒ&+:È~$¡  'bÚ¯ ¨×øáý FûV€Ç…¸´?ýÉ…³]þPKÚ{TBéæÐzô# License.txtuUÑv›8}ç+æä)9ÅNÒlwOûFlÜÐ`ð’leX!âz¿~¯„ã:íÙ7¤™¹sçjf˜©¦’¡Zš©n¯Å¶6t^^ÐõçÏŸ&¯®oh½§'.hÎÄ”(’œSOš÷\¿òjêµè©<†³®“‚÷¤Z¹'£ÈXs¯6fÇ4§JôF‹õàrv¬|a[Në‰âÈÆ'ÖVT)À´Êh:`±“$fíÚˆrL“·’“h‘¿O=Ï2m%^E50IÖ©½éŸõ[rd%¯Ž ÃZŠ,†›õÞ;èà¸)xh´c5J÷HÑN ²")^øX:k_ÖFI©v¢ÝL oÜh—ÏÞÁChÄêËÍ(ï·ô_<ï›b-Òó†·4¡›ÛOË®ób®Z¦+ú†T†’õÆ|ê9“Î%7ü•SÆEub÷VµtÏ´E«xïÒ|GË)Ýe--· 5ÕÇ°©þp^3 ­äЬùÓ˜éèI©ªÇ¥.ÿ]k —Jo™Í£Å÷¶b|¤µbƒTt á ´zoûÑ}Ç3Nÿ ðsa™(k[ðœDð êÙ†kg^2õv”¿0É`1;µ}íl÷üÄóN£09ŠÕp);$©YÉä¡XcVŽŸ»ZËN©1-:ÞT#Õ¢ QÚ=iÔìÆY0œfzßõáÅb­™ÞÓù¯}~A¶ ­ykÐáxoÞöèÀ¡­€g»àV©ÞxùÛøÄ£]O¯è¼6¦ûry¹Ûí¦kë6…Ì—Ʋ¿< MkÓÈ t¦ƒ¡ß`&ôoÛþpBÁ°àwý—©}úxuuãy+®Ñ;pEÓsl„­f­á•OÍ9© Ù'Ùrß6½›K "-î^^üëªõÔÚ —ݸY¶‘¶Èãv°“ÅJ+P¬_¥Ê oÆ-Õ+òWvÝüª¤s röVÝÙ…¥ðV¼ÓªJ|bñ`ÜöþÏ Ä}ÿà¥ýp‰ Šêa¥7°ƒIQ,·À¸¯ ƒ‰v¬Áû=À gÁ„®&nQaóà~W«æ] «ëfÐ-º”ÛH¯RP8X]ý°þÎK3.““5òeì°Ÿ kbôo»+?UÔiÎ=¤´+Äøp-åPÌ­¶†¸GEÝûc$6=+Ç-éàN÷ä,% ×¾×ØæYóò¸Im éþ›_¤…j`Ñ(¢uÛÜÉçÙ ÿú$|h±ÌñoÁª:¦Ð'qÞgeè‘vP»·±p˜ð d2¶[[&£Þ¥ª Çr\®á0]B"Önû×BkAñ^iÌWqRž.Š§ )Êi•¥Ñ<œÓYã|æÓSTÜ¥Á# ’â™ÒÉ3ÝGÉܧðïUæ9¥™-Wqâ.JfñÃò¦§»Ð]Á,MŠ,˜ šfÅÑû){/ȢܦZdéÒ'«-THßâ’pVDiâtÏ.öü‡G@o1°r|ê<ýPKŒ=K±Èß lubyrack.hÍW]šZ}–_±;“Ü e¤×‡>¨5¥-‘¢fÚÞÜÄ ôdø0pèÔÛÌï> íXÍ›¦w ¬³?ÖÞ¬¥ŒªBT¬v™çßw7peŒ$à%l#Ï'Ð؆À¶XEÔ‡ =DV;øH(L=*I×4LÂÄþ¼pç‹ÅÒ¼Õ>ÛãÉlù^ºÆš“g’ÚéÀß!tT^&ñ£" p•Óx‘îæê#þ*J9Ë+I²Ætg1žèKMgXò$ÛmYºX´%‰Ìõ¡yyîr–>ƒ)]“œ9ô2Mqò1Íî½,-pÒ–ªÂÝäõ+x˜ôMj Ò“¹å¸cË•mݹ5]x½ŽÛïOwºã:Æ_z[zà<ê ð¢uŠ;Üĸ·0=AGÚÓ1í¥Я7{çeÔC^3²3I²f›áŸ¯x¥`/Ù°Üå‡ñ'µ×ÆÛ‘R§¼¥_I ñµð±†?ŸpèŽúýŠüˆO–3a~΂~ùÐd N kú–¹ ß2Š,9Œ”¯L[½j¿ÄœÌ<Še˜(­µ•†á©UT¦Ý,a¿ä+†,ç›Ðí†dÓÔ/b’ð®iÂç¨ ˆçdÍ—wîX3uмœ4UJHbØt‘ÔÂ:U\_jPB6Þ,…½–Ñ X<,ŸÓÈágGKT\ÊZòkµ¾¤4€ÛÄßÿžaøles7Ñ)r’!¦@‘ät”nc•_*’oõ΋ ²ðh–Ã[/óâ¼å‘x«…½ó›Ñ8ÇJ Ãh ô#WuÚø00ÎDÕV€Úp`U„!ɺy{§]bA© Û#÷d×ÅâHNd{³<|ÄÂÛ,eÄg$àË{jçÍ>iµŽF5|ãØdÏ TèaŒC| T>7~ZŽŒû\Øăƒû£àj*ªI0Œkñç:Ñÿ@&(š#9ˆ¯¯™ Õž‘KÚ ø²º2Å¡VgT„Ü>Â÷yŽ87LÜK9JÙ5ô$znBZ°ãð¹-0_kq‘¥>Éóq|J³2äHŽû6µò*ðë>RÙß×ÅÛUÔ±7q÷v Ë噩ì'­Äò$ÀÎoiâE²fW0öÇ]á­‚›8L9ÙÕ¾ÐU³/t5»"Éc¢ÏšU»0ku[iöÉÔ‡‡ÿyþ¹ý\&æy&4¹– ·¹H¬õ¢@£¤C ðï“#F$â6Ä¿˜Äþv·ÌJˆÐó5/ù~JÎùþ7¸åÒs3þ—ºý=}¶Fÿõüó_åÛ_æ–ƒç r]”/í3S\Ùõ•&0M`†À Í6·+à ±Ý–”š7¯rcCÝ*ÝhÌ-…ÿøŽø{ǦÁ™´©Þ¤¡wGüC¤ñÎÍ¿º5Ån’4”¾PKŒ=ˆcÝ^%luc.cpp½XmoÚHþ\~Å6§F6!´äz/"/Rš¸)º†p¶ªN'dÌ«Ø^{w–¾ü÷›YÛ± ¦ jtù@ðìÌì̳3³yþœù‰×ö¢ˆí³O’k !sÃ)‹|׃)ã!Ó `Q2ñ¹Ç¦"pQ2Y²ÀÙ¹Ë_xèùÉØNä-Ú‹’€W® «‚p‚Î…\V¥já®ØùóÈ•n@ÒFÿôÒNÏœñ+ç¢×·Îä2Òb0°[Á§ìí»³ñ”î…J»¡æ®æ"T–ÝøÚxBko.GÃ7§'ÝîÏCLwÍÊë$ôH—éôÂ[šO|¨,ýzØøžmtþv|êÏb¶Æ™çÔ©å᎚.¤H¢Å¤:ê…æ OØ®IHµXªšÉÙîç5ÉÍšZÅwYú®ìT“2]1‰Ù1Kwl_€&“9v%§ -³•Åºó9!àà•«Àº!… Ö ÛcŸ›–ÜÛfÏXl°˜áoÀâ=H>[nªLÁý˲R.«CdE"×$etraT墄É>Åv nß«ùðTöaIU.I5Ϭ¢bàø À2°?‹ÍiNdÈ,ܧI{í‘›&¹Úc²)él0³c£Àšf&“¸øÒ,™cË@¬)ªOQ¢M»Ðv»åXV±¢~”ňgd Y?ŸÌSé²Þ&ž«¬|½Å‚ñ¼Å¹õƸ¢~´/…ÉvO,³©M‡r)¦‰Ÿ`·Û•>])¼4½!GˆDURͲaM 5îÊ2—ïN°Õ›y¨ž„ŠF MOÍîäg"© 0’YU~üâñ£ªJööìÆ“'Y4ÿð±bª¸‘°ÅÒ°6 PšbÝî+çúœ‚õ*™Í@Ât$ÝPaDSÔf`¢ââBRÉÄ®bã°]xBy*„u!þk_‚Rîœpjm ëܹvÂûÂ*´‹AZÙï½ëó)Uä5ÞÈ"è'Áäà¥åjAC.œ¯›·à—1>#WÑøÖ2 "{2ÿvwi{v’gÑí^…`Ù™¼ÝSWSȺl0‚Ü(W;"OEîäaC¶X¸ï±$0é$7ÞÂÅÎ ±móvSzÚíêecÎÛ½%í>·˜©§fdì× y§•7àG8¯õ‚c£¦žK>2ëö©"P]¼ý-j½³ëƒÑÕ`0¾pFã×ïúg£ÞUìôG×­¬ÙîSˆy>Q{C¤[¿–"È@èc&¬Ë%¯D"=0íYèVÒÊ5J øðÁ?ΚùG#Éo±ÜÙ ,™ˆ¨Ê‰ºu ϧÂC˜’0 ãR]Íœ8q}¼ >e€,#QÙ±È0ô7ûž)®àFí•Z4EWD•jÅ÷k™s@—H^ÑÄ&F· ž °Œ¨Ä'64H/bŽPÙâ.Å)4ázý-½u Tñ^í Ú™S»¦ÒÀ¾?G!nÅp!‰ÊdLˆjûéÓLh3†#9À”˜J$äºÔR/°Lî"q¤ÙûÏà !J0®&ÛðÉ ¸="³Ì_ 'K}Ê?DÉ¿öú#ç¹n±N‹½øž…9H´•iµÌL³üÙÞŽ§f5¸N˜lIs7Àvæú^‚×dýö€›¥–c!…éœÈç8 µ`SÁ°ðÚ çìN1ºÞïcÎY«:¦ˆ>’•ÞÓã’êz×ÆGjVGž£ ä9ª’çèŽ<¯yˆ7xˆ«âÍÔʼnŠäê‰Q²I`âg'Ǭc§,§&3™é§†t—U•Z®ƒv{†åÇœÑg“ ?ý}ù¼X.W¯fƬQ—«ËKôÏ uˆqyegÔ³œÀ&¨é¿XÂÇvg×Ì,2Lüü õ$Ùž_´wêïtaàP—JÑÙ ãq4ŸšËÑxºº™ÞÝ?¶ÆüàK¶\^€*W@Ï;‚@3´ úQ ¸&x ~B|ŒÒ„1}‡ÙãÖdswMøñǾèœ{Û6 |øêã>^ÕGÁdÆرâQèèZ úÿ‹†ºº}Ìa@BôP+*Wr¥òÕˆZÝ8p$‚Ôº@pµ…â"ÓIèŽ\[T;ÛWˆBœº¤[>~ ¶Rúë ú×jú9ØI}°Òj§Íb²'ÕÊrè‘+JãXXïâë"ñ«&«'C|¢‚¥:UÌ’ ¬FP_!èk[£aTHí“‚H…sB‚H+ÌMØ¡Þ™ziäl¡×“;W\;¥ ›J÷ªN&iuúÇ4EÛÜU·féþT„$®ÿ|Uèh¢¾ùÏ}M‡ZßÓú!èiÉC^¹_„øÝÀDx$Ä·ôØeºÊ0ƒ©õ'¢¶à^¤ÍZÕвí<2ùÂYë"{(~‘£jò.ͧ­Ú-µ9jú՞݂gÕ5Îý°¤ Í““U>ß ã7èQÂ^8·¡Þ`³b ÛU—éŠ9±ó§3’L¼'¿«¤È«™i7nÔ(–?™ $âT¿ÇXX`à?.*Þ8¡¦ ²®k]GJ«$F¨˜{¸£µPTÍÚÊîU™ð$MÏ7¡ðT)'OMê ÈÂŽØU‰-ÛJl }•´Þ5wGºñSŠÛÊšAýԮǮ <*JqÈV‡Ò:¢XÖÑ2úü9&íõž¿å`ŠºÐ³b@G“ËŸø¦¸äD…(Ý ŽŠñ¾Œã],úd}Ì‚lÇÜ¢Æùýß/‰0\4£ÔKmÁ½’ HO'äK!ŸRíêë+Q'òt·¶º% ¢#?S4?m¢Î·Âè—ñ~¯¡ØhÀÈÒˆ’TñW{3âø„Ž”Ù°¥ž{Û(ž 脃6†9¥¥†é\o¡RÄÝRâØêTé.¿Ÿœ† Пë¹ÛĢǺE8¥%E÷ÓlÌÀÓp•d'G¸^"æñîÂW«ýül˜+0°*V(XkP_p˜ÙÕ“A«ê‘Jm”š€tëS·ÚÉ4þ2_欞:[ìbç¾3žÏ’•ÝW4¶f³ê„¹õnfFzU¼ï×g/(µX~š{+­¼T=À%ß<ó- HzÚ9|\ Mfî,Q¼v‹ /­ˆÌ#™€ ®$zz pU"ï‡ëxøÑ9ÖºèÜ$ÑÈ®o–4o¢D%ùÆÄå”AÍÍ[Xëç$îZÝÝ.Òaå †:•¿™ëgWT L¼ÊV?ñYTcÒLd+¿~†8äž„JŸ/tV=7ÞZ¡—'«%5h¨ÒÛ'¬ú$;=½ Ó#¤J>á,ŽYð˜?^Êx#2Ùˆú7Y"• d9¾LU˜Ùán¡RkËÔÞv¬&æwqÈjÆØB@w\à*ÆAa‹)„Ý×À˜Å»þÃfa™'OÕ ,WœG#u6wg+ùCÕc ‚¶>äb³ÛÊå0œÐ+±YˆíC”C`G¨ðQÕ¬^—ø7»l…že|ŒÃ§ºµ™ù2”2a+D߸t…³ 3 …csg­VËÂh¾²–ŒVaÌ­æÒìt—šÆ÷EGlGrwšòíopc{t¸Œ#åÔ/m´IàôzÓ8th’àÝŸÂX:•v ¤.__J¹Ë:‚ŸíÂß{¡Ù†dbô#Qj)zŽqóøC«¾]jž#ÜTÓ³æ~í¡éÏÅ?•ÔÌàˆj’¸ñE%È„pD»rˆ•|&§XÉçrŒ•|!ç8#r^/yàb™#Ï%æ_Ñÿ?óÿœø®¬È6T{´±»ß%jÙ¨eÛ!Cíëaü÷ì'’ý­Ny^¦?—ôoµ¥å¿ñ¿þ/ù_ÿêùŸqÛ,(o› )Ǹ^üûî—hòüò_ü“_ûPKÈ=ë;m¨DÆmars.hÅT]oÚ0}Ž…Òˆ‘µ[÷,é†Ö¦QÓU›¶ çÒXMìÈv¬êŸmhíëq¶äãësï9×v“-y K<¹þß\ÅñürtÌߣ¦‡_päw:øë’å€:>BMÆi^¥€ è=lzYã[ä‚Þ[E£Ë0‰G“p>ßÍ¢ÖDnJ-â¸m8ýgxŽ”–ÕØ%šñ¥À}\V‹œQ|ÎÖŽ-SÂ~ÀðäMÐ}Úº%’‘E`süNgf·‹í83ãu€§4Ñ&” ®4¦‘¸“8h”ß ÉtVD¤€V?HЕä¸akh ÑãÀçã!Á™„åÛF¦uÙ÷ýÕjÕ[K ëQQøŠþ¢`R éSÕËt‘7E`ç¡ODs¢”Ó¶—U+­Õ8Vf §‚Vp[§àVÅ–¡îGt5¿½/B<& ö¤³¢Ì‡u’y†eÕGž÷]°ä4³KÐÆÂÖÖ£ÅFîT ¤Áº¸âŠÝqH1ãçÎåîÎMkÜ-É+ˆ “ ?/‰$…jÛ¼R TCj“µ`%dúê' ±þrvrúÍF{®Ç¶½ P§a¸ 3M|àb~?@žmÇŸ}9=°Á˜ò;Á±”ñô“.Ï‘fÆö$o ®w‘ÝÝZTÚ­ÛÛ¨6…ÿZXHoJ°oýàŠœ3Nòa¹ªgWQ׺ØɾNsó96 ÷ÇŒÆÀNõ1›ù餽ƒýþžÔ‡9Ž÷48d=øEÂhjþà)[¢ŸPK=ê¢m  marss.cppMY]¯e7 }¿¿âª¼€Th>ÇÄC[FˆªŠyD%q¢"A§j‹(BüwÖŽwö­F#ms’ÛËk-ç~öÙëŸ>ÿó‡×¿þâãO//¿øû·ãÿ²ùúÉwã›ß|óÉÏ>øgûþ‡ë“—¯>ÿÓû_þåû¿}ñþüê—_~ÿŸï~üøõ׿zy¿ýáÇ×üÞrÚû¾{÷Eûa¾{÷¡üé/%¦¿¾þîõ¿/¯¯á§ UýÏI†¬5Ãõ,Ô¼?WkV“ÔO_÷’jkiŸùúÊ(±dŽ×óP¶®çª•ÆÐ|/‘b¡Hšû-z©¡\Ïq´ÈÓ^ž»¥ªv/ +®TæþY‰rMkÿŒµŒ¸úõLV׊“î%m–Å}íœxNâëy­”mJ»ž{K¦œƒ­HÒÜÈS›ígé«äÙ÷òº¨/iãÄ’9Ç%;üT´†ä±TnkVÙoÏ­jÞ©ØKh 1•Ø2˜F^{çC++Ê—pK|/I²hJbßC“8vÂ3…ÆìIžMªw/)‰YêðÃL3‹ig)§£EÛ¥:Wó ‹‘Œ]¾Öyjûg…W×^²§"Í€œßK:K)Üv)-¥zØK’R«5í­fBRÉO]bæJKˆ©µ);.Í™K ;UÂËù¬JC*m‡ÜY{Ú±üŠ«zò³u@až$óÀ‹Ì»f’˜÷Î¥¥”ÕË…ó°Òï%#jìH€u Ï."Ñ·²`cP;±ÖÀÙŽ%W”¬zø£¯¦ä£E‚â—{ÉlkÈh»ÊÖcLê‡ìHgÚ¨«P¨ëŒ#WÓ{I\T*ûÎÖš¢-÷ÛûE‹œƒuü ‘® e}´2„¼zÞ™¡Ök÷{õ­Ì{+’Ú›öKcZx«0„»š«@ô[«žI“PÖ8ºÏÙ‚ÒØÕ_%U?Xl ~›mÀÓZ 8§.S¡éªÎ]ت:G \0œ«…Jn‡A¿ÁÂ8Å!™HŒ~*¡zÎ0iÀh¨<‹e¶›|ðBÐOõZ(0æ<€þ¤eåÐE ]û+ŽdµYj•9J±j²‡-!IÑ—ä¼$Qß:L†ÞÛŸ/pG¹ì„fÀDÌá¶s˜êö t”«»ÖTƒµhtbé\ʱ¹¤&­7$cBðêÏŽD\õr†Árðø>@ɉÐrþFP2ª¾?_Ê<ÀP§ÅjLb~°`DÖŠ—ZIÞÈ0S3É2ëðŠ÷AÑ‚‹Å%Ã9®'Ë–*E…j®{·˜! ¢nGẺ:ÞȲì,¡Ãü-’‹b¿dFç¶æÕ[(ºõHà¢y¹&–•«8Û|ƒÙÞ Øi³×ÇÂõ,ÃN,Á Âœx»uØIüÚ,’CîíŸA—›NyUq°r†Õ)úè~n—'sÀ?w,|éÄ;Ø@»ë‘$¸vPüN¬ö0 ì»S!+¶8wÆ Øt…¤çŸÍJÝ;‹¡ÇÉ­)Épk anõM^cSà2l$£'áôºO…C‰â¤qŽígno¹LÙÉÌ×sH»ÅzD‡¨oò?¬ÐÔýU3y¬ê2-®¡E€ÏÆ'”:–²èNPT'¶vYAÉ°³ù0ÌD‹Öæ iÔ䤢ôbQó~\=[–¦®õ5gÌb·Óæ0¶à¼H|ÏDõ6ó ¶ñÁ˜(õ’[ãðRDo ‘˜áºN¿Äˆ2ç5‡1¼¿e¤>Zå{‚µñTÎvÅ-tAÃb’sâULŠóó÷•1gØ(/ÏH· iPª$.è#—@õqã9ŽœÜ*¬KÍÉ‘œOC1Æ.wÞ‡[€ïÛ&ê•@ª|È µm¯U%Ü™ÁYZ_î.FКƒ[ëÞQ}lð¿SÝ¥!WÏúa`ÞËò7¦ »zÆ £K®/qôÐáÏ6®0ÆuóF01÷þ&Ipk. ãy‡‘Êáv´ÂŽU Çõ…&—A˜–±Ê¹KCíÅ…ÌN°J–HŒbð3 š-•Íi˜ÎÌQå ì燓ªäX±/÷{®,‘SZ7ó‚£À ]¬æa2?wzÊG·(Òà¨Þ."´«y] "-iqûÅ­pt‘ǃ1ã:»ßWLè(›7/ y9çºñãút€}½”]òä”^AýÑ vt´[7EPÚµ(0V0ÇÞ#p°ÃîÍ&M¼è Ç̪nuP¾‹!Ãm³+{€±Õ?ÂÇKëÙGi؃2«³%(õ¾mnÞ¼?Ã@¾Ú®~äéÂg,œyê׆9Kà+'L©É(· DìcÏ&‚!÷ÀRà¬1^ø˜³.Ÿì®æý]`a»ú3Š¦}^~A„ãº-YnG‘£èÙ»FÇ4ç’'Þ'†ÑŒÓnßö Då`L¯·ÇuÛ›0)z[Y-–ÇE˜z&¢àQŧÔ< îǬ/Ò»õÊè­IRLëpúî“uFÔÌÌ àïò¤sx=¥”ØêêÉìéšÑ£›ö¶Ýý`5ø&Æî‹0êáC¸@+þv¢÷<’CÁö«»¼œe÷ù°ñ­"D¡Î”T œ9ž[ĹFK>ï3|öts2k£Ê3&\w=>ïAÖ[jNùN~ì4¸®>r¡ÇìÌÌÌ2n§z,Ó/'¡­çãÇ0Ü(*£x.©k Mº§'‹`Ñç²4¤Ï‡ô'PêúÒ"ë2K+Ù¢ÐOõi^鸵S³ëK£¢~]RD3Ÿ·Æ/£~߈3Or„!´£´%ö8›œ`}”¦l)ú[ú d슀Ï0õÈsu‰>UW+LP¦‹,Ÿyò[°òÏðg \tO&Æâ|'¶BÎùm\ˆ–>×9*9«Tð&Úï«dõÞ7x®ëºðÅ×A¬~wQ"¿“W›~£U#fê”O#Û¤TVõù‘fÑun®úÝøðn0QÎRÚ\¹hQS×Í0—:D‘ ÿqJ˜Ý¤Ü¶9ŽØ7H*Æ ŒüÃ6ƒ”G÷ó(€÷ŸYÊ:ÚMƒà1Œ NPyL/uŒ³!ÝÊ›@Š·ž¼â~Œöô÷ÄšVºÝẍ¿:Û+:ƒ©Mé˜ÄO,Ó0òLgÈ~NäKb 0ãnq®R—=n‚^–_œö¡Û~Û# C×Ý*X°—ñéýÖ¥ÞÓ÷€hXåÛ™ãÃêæ Ödvâ·‘§+ÿ£fâ°¤¸;Z=`pŸ Ñ°ð\¨ÎU¨~Ÿ01vòY2ã…aMççEk¤7+Pää~r$0ûŸ À?—Ó cÈó ÏÁ ¼¢T¿Á€üJ d As7Zá{}ùßoþGœ÷_ýþåÿPK‘=ÙˆÝ —— md2.cppmVkOÛHýÿŠQ+í&M žqœ8Ð| ®Pª²B]dì šØ‘í”fWü÷½çؤi3¾sÏ}ÌŒ÷÷Õ25{Éj¥Þªežº™³©ºÛ¨ÏÖ©“Ø©Y‘/ÕQ–öQï©ëd¾pÙýïeíçíï««¹Uyáî]/T’§VÅYªâÅ¢LâÊåY©âÂ*—©JÌWë»…KTš/c—íy5Š+•üV»h.«Š<]'U^lz¹´Yu æo<õFÕ Ô:?1j—s‰y/®Õ|¹'z˜Lã¢RùŒ ÓM5Ï3u\lVU~_Ä«ùF]åùâ««zê›-J!©ôžn\O\Yîn]Õé¬K+µ°v±9š¤‚t²\vI¢ ÌÖô ©+K»”L m`â{«ì÷Ä®*ÁÉÕ-WòEÍEüX‚ò&_× I¾–*l “X.µYb›üö=ïµË’ÅZjþj•Ì÷毼ש¹Ìªã¿þž^ý9ÞN.ŽÞŸMn/ŽÎ'—Ó£ãÉíçÉÑG¥wç [Ñ$¿DA YLölJœ›ˆ3ÊÈA\G)(ÖÔÉ 0rÌ ±‰ð`ëP+„í£r>cà1"  4+b*È ‰¡µt$ƪ#N¤O’âÑt:ž¬'B#Žl&k䓺À]Ç&ÎGÜPX`±$†ñAì5æÈpа`Á9!ŒÏÅ9BßGä^g÷¹ A[eEu@ýŒ@ž‹Šá6œ:N £áØA_Bæ‡\8%^ëéÐóZs·°ªcNnùÁi¶ÎJwŸÉ#÷«:“#îS#8w™œØŸÞ6ÇiÇ£¯8v“Õ¦>v»[-Ò³Ú –uÇgxƒU½€·õÊÍT»±åÔV"™OÛ &-ðq½®ñ÷lïS²%qÝÅjî€úhµª±Ü7:ü·Y^´ø)÷NäÙív f@½¾ L×}c¥²ú+Wû6P"_Þ0 ÖU­|zæöÌj7Rôk$( |x×åCwQÛ¨éúæ¡ë3Vâ‡X¿,6/‹ƒ—Åý—ÅáËâÁËâáO⧦Líªë:ê7åÿða['ÎÙÓÏ×ðU±ÎäCЦða×®/b|´mobüãU|5/òÇÓÙiö-^¸tëx)ú60×XÅi*£ÒAðzÌ‹40ÊÐÉûOSîàT«Æ22Ï.f;ýk\ÙÃ-¸L év¶ÀÍ'EcÐk"v~høɲý^ÁÌÖ™òûf›ÂÎ7ÑÓη×äâÄûPK‘=_c؇”md2.håTMoâ0=ã_1‚PUDÝÃB[‰l‹Ú¦h¡êv/‘“ ‰EâD¶SDÿ}ÇhÅ¢ý{±•ñ¼ùxó&-±1.`ôóm:žNƒ§ñ·àžµÈ&$žšYKÈ(«b„f¤Ö¥ÉDØK›_¬£0+¢¥µ2ðäͦƒ‘ ½»‰ßYH1v“UuºªŽ€ÓSˆ£V=\.áˆu$§RD0)à^Hp ÓDÇÐUQ"žà¶ïòp¾jö{Zæ‘ÓSÏèDΤâ u$€«øb±)òLj•OH†/óÉB†é˜KU'e™>³ÃjRe‰Žò0ÓI¥ãX¨ìà Cy¸€ÛA æ<£æ S³y\GÞ„Œx’ž®‹ŽŠl®ô“b™éY—óÆZ/eFá³HR¼$°:Û¤dš%r’ge;y*pB,ŠŽ©†­˜v”†D˜¸°l+LóÄð`jD2MEŒvS†ÏˆU(–ÖÑXUÆK|[Ý\sÁŸRsåBçe‘Pç8…Âœ¡–Œ„ Ŧ¿SBŽ¤ 9ÎüÍ2œ×çoÈQ$¦R èÿõ÷hüçhô0¼ëöÞãnøp?ì¾viæh2÷2 Í Ù'õ†×oïœrx£‘KEºä¡@§ðG_ ù¬edvqqñVÉìCÆ3áÜàZîu‹¥€ãÔœ¹ä+©­?}l|‚Kh¬ÎÚ-¿é5ØûΖ`%!¦aÄ'çÁžh–Dp>áQ8{Â+ Öðš~«}†Ä÷îҩNbpžð:^Ž#9ÃÕQœ¯J3ØžJeî‡~ÜÎñÊYQ((|qÁqœ• ¿S¸.|Cøo ¿¸®K^ŒÇ—`›…i™è}øµ¥ü®ú?kÝ&¯ÖÕw„>6mu)ô(ô) :„Ôº—eï8œ_o‹˜Aý-j4Ø"ÑNvš«µßN'4¤}¤© ü2ÑÙâJ®Däð“+gM¹'R}|ü„|§¤ûÜ.íÑ>PhPðÜÎÜ€–,0 ígœÉ1,4)cϸ²"6ëQ<ãvz-‹žoÑ;³èµ-zç½ Z5ªõ«ÖcÍj=æYôZ=¿Ô#G¹Bì0ö—Lqýƒ)N+ŸŸ7ÛA¼Ö¸K¿j_8÷ ªôŽWµ/f÷G¥^`Ñó,z–}¡ç*õÐÕz-‹žgÑk[ô˜EÏ/õ~öÇ/Ùãæ¹=ÎDˆ g¯µÇ Ø­Ëfw´‡ÿŠu½´’ÿóõaÖå¿ÆŽEÏ·èy=‹=^²ÀN¯mÿú0z¤¶ûÝ9¹ìvv!ìíaa=„ƒõÏù÷ƒÿ#ûùPK=+øÓ kmd4.hå”ooÚ0Æ_ãOq…ü#b«úZ$J£¶ZË¢µSUiRtıšØ‘í4Bˆï>›@×±j_`obéì{|÷øwi‰¥ä´„Ù÷çèñ[Å÷W§ñ k¹˜tf-!“¬äMaI§hÒAÚdl>½¢é,Œ/ÃëÛyg¦×…UQÔeLbN¦À„à‰ðeÆ‚àÎRMË‹fjm1 ‚ªª Žb¨<0 ÊO¹ÐZé çƒÔæYË•Ðœ¸Ïy€ôNàg…Z ¹a QÒNš8i()5õ%“ª2ã •…Aiˆ³F)32Öª\••–²5HòÉ–J;¹¼@+"v=€^À’ ]Š¿mE¹ÈD·Î´ÄoœO¦Ö¥$¥qùy¥4ÿò¹wÂÚŒBÉÊ>œöaxÖ÷R¶aµÖˆ5Ì.^•àp+…õjÔÙi;ÇuAÐóg¨;þóðÛ…úBèq±"cû;S,¼EÑâ»Üz3IQC¯®|š­”v}äs÷n.l4ÙRKhz÷Ç[¶3¶u¼#&œO/ïÂø7Oáô+L.`xôø°)®#$ÆÛF#@ä…ÒvO‰VÁ¢ÑÈY‹2Cìc‰ @å:‚=-¾xO|_ÏÌ☵5Ÿ 9®kH|¡òuãÁ°)ZpØ»#$ÁyƒnJø—&/N‰›cp¢ŒÐ´ÿš©¶¸$¨gÍ×aS‡÷ …¥ÈhGt¡© ·Ú” ¦Ò;R÷ÙöŒFmphÊÕ+Õùû6ͽ“­Bã*GpN\Qçi¿ëúws¸<,ïþ^áüŠ¿PK=ºü/}Ùómd5.cpp˜Ûn7†¯³OA$@+ÅÛ˜çCŒ\8¶ÒM\¡1mcðX/j )µå4}örµd$Kk€ºÚ!ùsø g¸\ƒ‰c/ì|~“™kBã0kðÑ7à\7 ,fp6»i¦`|óyb¾_‚ùgsÓXàf[7òêøèé:Í`õª™M—@/<˜ßhgŒW×þ¡´ªž5S{óÙyðtn¯_\?­ž9š©g¿þ6¾üe<¾]œ¾~7ºº8}?ú0>=]}þ ÐŽ²õß*· ÍÒ¶-ÕVôzôãÛ‹ÁÙb=_ÍÆãa5Õ¿œÇ…ELý7_ªêŸYãÀûsvué—«·ÓåJOWMÇ1V_ª'±ÜT_·C_¾|;mVVzå?éåõÇÙÂ]®ç<_¶mÕæéwø'xà”aÑ»“ܺ¬ÓFªmî:”4ÚÙà·¤ë@`F··¢Ë…ž.Ãl1ƒÛ¸‚Ás×ü‘j`#Ê äÖfÚ®/n[ù4¸«Áº÷C0¸ß5øü×>Ü«ÞA÷àS7r°ŽO÷ÃáÎ8¼5÷5hÍ~òÀÙ'ÐÍ°í§;ýëÎO\MôQ}y?\ŽÆƒPƒÛnþ8¼N¯t –CðGõä6Æj1[ݼiî¼Ü‚#¶óm‡»ªñ—¢[M Xœì¤ªžèW]ã6Æm0ÙB­e³…[Ëe‹Dk3a^äTïÌZÇzh“â(î¤\k*d Äðä@ãvdQƒ:—VÁx îÙ]áN„)†ºØ†ú<™]‘Nd‘qÖ{_Üçi‰v¢À„…A‡"$Öib„åX—!ñN¤%”#R†$ÒêåŠAT†$;W*éÊvIui( ¢ C JùâƒÊ˜PÊ©˜uÂîJ)Á‚a\–{$ÇOI)ÄJ9¡¹P”H_ˆ•³B %Î{õP†¹Ò 9ò˜ñØÏö]ᬔJRh…5P=š}¨äsæ™fí^ÑÕTÚ`¯ ·BÇ6 {D{H)Žã€ sEH9• ¦QFʘ²'©‘ç²)í®ŽceSªŒ<²Îó2¦äÉ" p¼ˆ)g,u :)ÊRÅSÆ4¢Þ•!åâÐʯ +bJU¬šY„”1.x€Ø©2¤\ïÒaM­Ì©÷PF˽x i¢hœöÀ9`JÑ“B Ðeê=ROÜ)Ç7çâ=ª}ªüºqž c&=ªþ3BS㽦´*9¢Æy´*ƒÊ¯n 52¥Ò5ÞÄz°)e–ÊoyT>Ž´FX]•9ê’•A¥#R)‘kk£„)1#¨ƒD!å<÷Ü¥<+̾”ç(h,l[‡%PÉ•¥Ú2Î3ÔC}ìÒ(V·Ùwà‰P¥D¢ëT{ŠÁÑcï]+—èVÅzT{P¹â­"ztŒzDÝ&3LYR•Ih­U¸êÛɇ@…+ƒÊW$&)s•Aå{_ÐRxŠ˜r"­ç–Aå»lü0¤ÑB¦?ê¡DHBåS0"¼ÄeP)|Æ0aePù›C;á°1eP©ä½‘Ü•™âgUþü:z¥O¾™(šfkâhÚ­I¢é6Ç_wþ]œWÿPKŽ=žVA½$md5.hå”Ínâ@ Çϧð†P!"ö£‡@‘(ZÔ–¶¬ªž"“˜dD2‰f†Fñîëèv»Õ¾À^2ŠÇþÛþÙIK®TL+˜þx߃ |¸þÞŠÛ¤¢÷fÑ’*Ê61#-éMÚO!æ“ÿ1˜LýðÊ¿™Í;S½-m]!ædJŒž×Ø áºŸ`„jZ]:©µ¥çºUUõ£CTVlTBýB'n%×ÒåÌΘ#Ç"ÊÐà7ð Ü,3ÁŒ AKñ-ó$múhÑÊh¡Q™U¡óQUèøËçÜKk3òU,Qõàâk½Zj,v¢ÑòÄ™9DÃK!c˜)ik5ê´Yg±- Îkêÿt~MØiÂy,2¶Q¡Œ…W+Z|Û\F)j8‡¦ôI–šÉ献Ӆ&»Ñ œšÄp/öC!ö<‰7Cóç“«{?ü=†'rãK¼ã»‘*wSîÏÎ\d^Ú%•-à4HÏ«¢E™!ñ±Ä¿ âŽ B­8¶.¾^º0¼™ÿœ†¡h/Ày.6ã–M„ª®OPÀ¦h7]H³A^Ô=,1Z³Rlk^2˥̤Ýö!È Aû¯µþÜ Íâ,HЬ{]‡M¥~ +™ Š¡ÔTŸ6%hÖ²&ÒôÙ® x^˜€¦¼x¡&þØfß9’l•“IL¨ó¿´ßåþùC\Ž7?~-Næ_PKŒ=UÛlØmdc.hVßoâH ~&…—J§ÀQ²O÷@9$JÓµK£…koO'¡!qȨÉL43Y–[õ?ϤhÙÛ{ÉÇþlöØ €"‰ûœÃFqcP ”9‹1.ÀdeµÊy ‰,IV[xBWŒ{ÞOE‚)L>‰Q´üt5YÞzg$ãߊ½ Û…¿Sž£× ¬±ˆó*AhkŒŸqÛÏÚ²‚ëØJ¼ÙøS8Æ“pyÞLgþDmK#£¨CxÁXz Š× ãœi ‹‘§ªbÖíT¤»®ù7L.s?Ïù?8\ WÓ›p¾˜Oÿ G½#­;ÜÞ£X›Ìj]Þ?L÷Ýkià ©i“ 䊋5Ìhœ¯%ј3V ßï M¥Ä¡¦ß¦¨‚vçWB=itñâ½\Ô¹ d ÓßÛ™1å 6›MƒkB2¤Æ÷Mä×8 «V`—Û¥ö‹å³uèn}MéwÈý.Ží.ürÎn·µ-%<‘JalB‘p&PkßfB†¯·Sf/ÞŽHɘlÆ"ùS*Çø \8Ù.ßZøíU³÷ú.+ãÞ;µÖ.ûS¡]ViŠÊ†åÕ©Ûi<Õñ6'¬Is¡˜Ð©TňK±Öà)ø»Àlê~Äþé¤×®ªÔß%؃}êÅråŒ`úb/˜küao Ø;ùï¨\íVRæ0Õª¢²SC ÿ•ýfȤŒ¼_8í£~( /X~Å ç$.P˜wƶùdzbÇa•Š¥ãnOÐqü®ýÛäê–Nȧ›h­VíîÄq þ)Å÷pÇßw¾Åz‡R—pDH´'¿}„TÏLÉJ$XUk i½^£²$¦t&íw{Á.ŽqN…cFª'šÛ“™¨J‚j¾Ï1v¥ÚóÒ;œ†ƒAs0{p ƙ쫇‚­¿-ø*Gø_èMëü½¦‚ØmÓŒI»vhÎbÛD¨Rú#ðšù{ðùš –Ù›îÓ‡YÏõ‘½ØEMzáöÙ~‡³+ZþHç"õþPKÉ=¤;f9‹misc.cppµWmoÚHþlÿŠm£«ÖyiB‚* «‡† ir§ªg¼”½3¶Ï/¥¹KþûÍìúe1¤iû…dggŸyfæÙe8>&KÏÞΑUÄ“„ùÄñ]zÎŒ¹„û$Y0¦Sψ,°LïÈ-ã¤çp]ßãþÌK]F^‡³ÅÛÅk´Ì}—ÍI÷êñõh<¶ûÃñèêz¢úŠ à\ZVAäÆk¦sŸ­ÚŽ÷™K È¡9ì úï-»sÓé:—Ó ÷÷[ü†68FÝŽ¿Y¿JÄ¥ãykë{Ìwù\×­ÎÐœŒ;]Ó¾4ß÷-ÚîÂ$ ]ÿp—| ¢i:§Ó»„‘}øïÌ?Nˆ4,øïCó™ÀFê'†þŸ®eÞÒu ²£ý¸ãñÏÀç«pvÚ¦€d7oÈæB†®Œ8ûªÈõr4Ø“ÁèÖ¾]õõÍóú.dÜÉ‘´6"BùÅI‹ðsÁü¸ ÿ ƒ¦Q*Oíˆ÷‘"^Ò( ÀÚBgqš]æ>A;«‚E,I#_l9(=GY?@½¶«—Ä$…³Ó-¼Ð¨ò*hÕ%x…UI*㔹å”äm*èÀÉŒžq¶é&H“0MÖ¥Ãý Ó‹Õ$ñwJúIbÛ7w~¹³pXsU2èÄШŒ¢ÊTøAºÝ’š7sx±žKþ¹§¿¾þ‰K0ÉVàHŠªÞ§Aà‘ñùÝe:ÍRÇ£ª®¿ýÙÔ„Ÿ3›5!ìÉ÷>£Ò†pð)ð~îÓ*­>³xOh\úÞ«ª.¸ïÔtÎ#'òø¬åU’E£â0|¥®­Ûí³Sãy—p÷ªÔ«‰½Hèy7³¬{õLG¨)*Ža>åªÝnV µFÕrZ7ž¼+"¤š-”·D!ÝÌ8?ÈÉçÍG{8éÚ7æ•X±"ç¤vvrâJcî&qâ¾{ƒ“½€!ÎcQKµÇ,±×öò)G|%uaø±ØêW¹IÅ•S¼‰_ìA±*PÔú0`°¥#f]õTvó‹»~ÀW8"óbÖd+™ÆÔqm1¨á~V§õ«*fÃZÃ6-œøzY‚û$»—<ì@ó²ÿˆtåó¶rm„Ý2GêÚjÁ=Ú£!>Õò¬a/—¶#ú!­@wö˜÷Ì9vî’*°§µ†|Cͨ"òд®íþÄ»K¶&ü)WrPd&4¤iUý´ô2Z#IÊìÙ‚bñ¦;î_iœ,\ì À=¢YkŒðˆ*ñ¾–^hùxTû”s3Ô­\ÕšÇ,JÊï…‘OCÙòÊ…åL–yõ˜“ëCÊ&Dmùà;Oˆ=K®UéuEÛúº¥vE¸íÕ+ ?¨¿©L«WÿPKÚ{TBAËÓL…misc.hÄ &F@†Ž=¶Ìa@æf0_¶&'dR7í€z–3üFG3¨]> bö¯ZýúåMóJoµµ^«Ýo5ôòFÝ£² 'ÇOÂ8ÚŽŽ PŽJ´^ Ö [gLCÖ’·iþœ“ã­ ñaËêy]ïkz¯£Õµ¦ò¨X›·ÔZÖž#¦=›æ*ø«Z%GòŸOŽUѧ;`“ì‘9Îrj>s¤èúíçfï¿ûº®’ý}¢Õ{ššÞèÞéÝnC%ÿüCþ'›‘Fhß5ÄظµÞk|Ô»Ÿ{6a¥9­U_iþVÛEvà—ó™Nx4ÿ²Ó¹Ñ¿€BÊ¥ÆÓÍ{D]qlò¡Ñxç—Rwâ€q;n`NÍ¿˜u“À!÷Ô¦`ë”xN€L\ÍlÈŒ?»…šˆ5Ý4°”ëù( ·wSo_w’ŸW†F# N—EÜh™öìZW=îå¯Z³ÿ¹ÞÕëŸê­´W Ñ`617\[»~Ûìwë¦~ÙüÐj+ tÐN·«f³ ÒƒÄ?ð‰S×´hÄI‰áûÔc"MŽ:Èf:u-”ìÅÀq,2¨e¹€Iƒ¨³©Ù¿³0ÑÀ’áÄðÈh6.~¯ òå¯çÙïçÙUö@»º­›¦^ï÷›=M‰HP× gÕ×êíF3{ëpÓj7™ü$YGš_ºžÖO(wÔÙºå›hKEŒŠfØCª ú!DÈ.!Ó I&µ®€÷_Xa¶;®«ó‘z’,îx–é’ç9$¿Jò¾ê¬ö®HE¾¼}ûkššMMTÂBúüUåbä›ÒœºÁÔ u¦X|CtIùðËz¿Y>$ñC¥¶ ¨ÝÑ?ih1D›;—â>#îlA@8]zªìˆN~8z ÷Ä£t3öÄÓ‘ e™ -ÄÓüA‡ÁGÇQƺà÷à™ŽÎ²Lu‡us“ãÚNÐp܆F8ž¡‚ÁR³¢’¿¿$óže ü“{!zò¹…ì«çlÔƒc‚vÑ;^uÍÀ5Ü/Ò¦sÎzí ‚¦¨@ø·Gƒ™g›Î‰vþ/ÕÁ¯é“ñÌfΞøƘZ Ð30 Ëü „n„fÅ…}Ð4YD5FtD¨ý`zŽ=¥6Y@f>„ªcŸ(ªºŽÓ2ƒ…Z`’£<®Ì¡ùdhXéÑ1PÁ„Qà\ÑÃâã‚LìXÃo¯ŽÇÔCÌe†Ô?d±æ&hÎfpî…3— (R{Œã-ˆE Ž \ ð°ç›÷v!{P\•x¨´×¤ ýB«¡Ë"·Q-…zÖT [Vš¨Q¹^é©’kEUAÏCJâ‰)Z7x×£ÈzXıçL—¦m¡·Îf$ÃjµÑÙ µÐÈ>öJ?8(ÿú)wæz™Â5É+) O„=’ÆŒ¾Ž}oíìl;¤]óÁìàú‰o!T‡ ‡øºÛ æ}à‚œ£¦ÂTwò Æ•.„ia'¬FÛá2ìåeÃÌ< HËŒ(°GIç<‰$ƒk™åÁáX©íûÚM"T‚”m·vå®÷5·>×ÛšÞo6îzMØû/uã©7Q@uÛ¼íô~ÕûúUód~,W%î­xÚ©û {:‹ AæQ=`Zö%FV‡BÉø(ßFƒ†l*®ÅžHMžŠ+Á™“–ýžhT÷îgè`”½ùÌÐö d½ÞØræ{¸¼W$!JŽ‹ m‰Ì—ÿsLpìk¹Àî5l°„^ 1-+=žTJ¨\îrfâÆF*¥r)‘Ü ûºf0`tvJœÅÐÀV3 #‡ú8¼0Ð]iß? `¢9a\ƒ‘Çpæ’ƒx[R‰x[^“œ Ù©þ—X0`î9@|3IÞžMQîÀ­ÁÆÑÇÀ3lg擹áÙèøxÎCŽ G… ¹€èfä´P.1ÙE>†`ZÛouÚ(CÈlKe¾šº>!¦­³Õ7ì@wD‹v«Õ’ä,€Ìó¡°s¢0õ8?4Þ奀m6IþÙxÄ]ö¶ÿ©qRÂÖÆâ~ åB¹PJ‰„—=:¸TíêãÚðÙ8ŒûLar›ù¿àï1e+У M«,#*“;·J:º5í[YFW ñ­ËW\Pg¬heõ¢~®ðl¾¢äËj­Ä²i\miXY C³á¼bÀêà,šÏqŸDUí££®1 0B¥ÙÃtÎðL´6TÚ Ÿ@ˆE!£˜([6C˜H@Ûî)NA‚…K÷"ìƒèF¸ ¤ó'©.6á2à0±Q%£x_,iTÚ‚¥«CýËê`†ABB‹î5µ»^[o]Ã6Üþ­Ùë`:/Œ‘O¦£O¨ä°w=žcH§$šU1*9˜‹]À÷ùºˆ™CÏÁ%>V­Ðœ»à7ÍÙ”±à.|:æÕH´rBúÝ÷d^$]Ï(ÐËéBˆ1ñ¡©a5@y<$C)3¡¼è_T¬`¦VSN”VlmÔ§,ÞPN‹‡¤8ÐVÙ½ó‹¢àù8|DJË~åý{õ‰¹Š‚”‘u¦©¿/¾ª)E¬zá$°*]šœÂSZ!“ó @W4r`ðžà˜ÕÓ¡Ì|X±k^+Á¯bËuÖLþ]å`H ”2Žd’a#öËk”9Iîª]MT%Š!cZYˆ##ã)¡1&àXÕÒ!™,sÃæ •IÞ‚­üTDp‰¹*Vn‚LCbŒ˜ kÆ‚,Ê6œ™ˆŒôM“âév›Áÿ#ÃåWdXÀð5Ï€¬Ð¾ÿzŽ¯€›UÈr·¶ð·~gG¥´‡P¨çËuUQÕf WH""-öúóO:,Ivïkǃ}c¤ìóØäÕXÅÃÑ¢0Š§5˜”M‚À=+ï=ØC¿€˜×¨@G³âÿú<õŠðhà·üÂ$˜Zo™X:vϼŸ·ôÆq¾ÍܸPÈt刦k-®è¥73ÿ°QußÄlà÷£ÊWX¶¸„€*À®^9…øÿ <Ã_ø9‚ÿÐYÁfôþÂOùçC½0gá\h)Ãè þÀsœh®ÀŸ2(Ãpü½ÀýúKè)j¡à, CÌ?¨–K?ÿܸ|T¾ƒt¯òó×(èÚZµNŽ_^µ,kWåJž@Üb?yrp«·êЦn«…'Ç[é¡håÒ¢a¯O³>èÁ"˜anM­«£ÊâOqdbE4È7ÜR)VäÂð‚%ÿ¤²úXHµ&܈NÑ”²J..8’Ç¥®ÄLlôæ 6$“æûƘ6ûã8ˆoÑhaÙF+„€U®aÏ9§Yö›*†‡©²Ç¸ÚhÄÏ’s@e¼B]Ê®QH–××–E*¢ ÜB#Ê8íT [s?«EåTUÓ`!Íù kƒ¶4hasîs§w¥÷[¿5!º.FêZR“П&•»li}„­DOêzèWóÀW’¤g"Q+gd\Øï¶È£ãAR."/øÆ˼ajøß–jç;Atf; ’@M{¥)OÓÙ¢OÔ3Ç‹ËÙØoþ93,E”“( ¥²Šb½)3|-¿ëÌ©×Wâ€Ä–—ÂF•g.ÎFcµaØÉfi{c“»uFËxÊd_Ê-É>O^DÚ%‘5P%y¤¡" c ʤ‡Éâ•3·5GìV´3–h±eZ¦‘/“™Ê†oƒŸ’™‚éÓU¯…£ìŸ¦»zçîF¦›æËàsí'ªT)€Ïpc¥÷Ë+A}ºÈ*Îí“;Ebïþ@ƒºH ÀÐÈ;­¶ïnnT~yåD®nñM=q §~sÓù¬ßµë7­íæ•~U×êz½ÑhöûÉìöˆ_¤µ*Ÿ'NŸ•å ª H%ƒr¾îà~u´®K㓧÷}$=ÞÑóäBËñ7Y†R]ÞÛ£ž”ØH˜/+u„B”Ú“ò7Bá'*acµZf»¤ìñ+dEn[ ÒtdD䧸—unÒ–$7˼l£/!W²H`jRó.´š¢FuWÔ¯V_¿iiÚMSo¶¯Zõ6„ —bÏm‚Ø ›´!> ¸ùv<룅 _š÷ëG&j£Q’¶4X‘—g©ïìLsšölª$6V&·¥‘-_‰‘8ø[ËpMÒЯ[%VÊä7ÖÀ±šÓgŸÁ%M>ÖÊ¥È7\b{Ü+í“a”ÛôU£@ŠO¸`ã1yðÐ*“h¤”7ιB»©±27±ÈŒÍo”ä ÌU32ÉQ¤-dƒÅqL7ïMÌ‹ ÐZ$ŸŸéà hÄ»ŠÂ‡€_)9¼+½C]g¼Ã`âAˆ¬Ùü¡J‹ÕÞwá¦7ª /¿'ÏZ õwØ7úÌ„õ´ïû³AàÃàé6ÜQË Ç >åñÓÙfƒm˜î„zW&Sãè!"œÁ ­üQhù"Á4Äö!Už²;K bn¶™ßÄüìŒ\5Çm¼†aYm:ÿù¶Åu8q Ѳ‡Eëgñ$õ.›*a æ` –P`?®“ñò˜ÛÝÐð¼EµŒ•±* ‡X<æó¸œì VóM.Ç`þn~]9£zŠ'¢Èâ]‚¦óÖèTŽè„'† >æÊjè¬3Ñ©`HšHEf®¼I;ø*9àøp… «?7\…Yü½9ê£*¢ÆŠRCr€ê÷oP?¬ýc¹ía >쌭ë°û’þ:¬nàám=±çCìù{.ÄîƧ4,úÌçóÂh>¡4®0t¦EŸgÍ»žsïS¿ØçÏ]ñœÿØù¬uŠâjJFƒ]ðš;ø²G ²/@shCg„7„‡ï¾ÈîìÎðRDqdú ‹EqèZ3ŠÓ”Nòn·»¤9ÌŒæœq.,içä[‚9 ÜΨµ€ÖÜs>µ±^ó@sx’&k&dÎÖgÓ¥—ì #9–S…gyL¶â†Ÿ×9vxä%HÀk(scÁÎƦúîŽGÙÕ<>°ÇÅã‚Þù€ilwàfA,ÈB6]—€Œœ»x›+ü’Ï»* ó•Õø 8r±&ŒòvºŸ+çEtb“./) Mˆ,↠Çw+9Y˜ M£›ÊžG]”ž?Ø·¹—î)¶z®öÝøž±§”Ø~Ef/1uMŒÎ$¤À®tT¥Õƒ6q‡‰}ùäIþÂ!»r8.‡s%"ëÅx<ªlä‡ìÊ£õ\GŠ’,-¾« ò«¬¾]És¾`~“NÜU>W*±ë93VØŒ–TeŒV’ÒâŸÐ©½º÷X³µÅ×=ÏX¤;Ýd ü9åIБ’AÿR+v…Ñzºœ˜ˆv÷Ìcñ4ªÚ’eRŽw'娲™”xÉ–H9^OJewRÊ'›IaÞ%”Š\Ë^+|o4S.|OÔ£Û€3¼9;‚ÊO¾6»Ýp‚—ÕgS*^íñi`9Cƒ]bxˆÚì"&eÅ9“œñL® ¡3áû“P¬ï»°ŠÕ”:vFy"Sã"MôzÒ[×3î§Fx CqgþD]i¯%‘ã_~á/7w!SïΖn±¾Ã3ÙåYqx¾ÎÓBtIG:„Ú"ñ`±Œy`!mt6kɧ€SɇǤØ+sÉC×”Òd™IëÁﻎ pj#VI‹QÂN,xvß05OeD š#ØâDè÷ÒWÁ;-I9Ú´"Ž«ÊÎmÅ“³úZùDo¶ÙûP)Ù×A2ÿå–º…ZPE>ÚXK“¯¨NEŸØo¦àÎ6~„†hz*)—3Å‹5O\Ï\‘GÃÙÖµùÛ…F—ò»…\_‹Ø!œJ‹½À³>Ey¼¸X¨ì¬ZM‘Fæñzì–.1Z¼¢¥V´\\<›ë“°ô瓳I,[‰äeÈxJ"[IãÖY¿. òSUÆýÂx>ê\/{¨”pTìî‘¥D!èظ(ÑÙ󣺤ªº…PÅ¥ªeµL£À{ ¼(ˆ¬â…ˆE°™ý×@îm‰-`;¼ÏbíYÐeÚùExjTê·)oÚ&¯åã›ÆÍ›ðm]lÙµðÖwøÞ›GÊ¥B‰ÅøöNá‹Ô`—^ùË9X%Y}á“`¥'á/½ ºF<ã'MÑñ#Š@OŽ·Ò|N‚÷$x;‘4¾§"!„ÍxìÞÖØ#óÛˆøyÌ=|’ú„.Ù[¹”b…Ç?b…÷æ$Yìu|œŒo*P‚GŸß[f¶ŽeÈ“6…i¥èøQ›*Ÿl¥Ðœï5Hðv"!iS?NEB›ð ؽ­±G6µñó˜{øMÔ³*E¬½øX㥋ÕÜÓZâö^··=îX_½Ìö&–_­·Z¦¡1>ƒ]á&è}ÂÓã]^~²³Ýw‰¼JÆqTYÖ1ݳæ¦=‡¥Ã£ò«¦O¡?ªäw¡àùéF‚…Q óÿšÉÆ:Ô1ï¯m<‹Å@²ÌLÒ&¶ÖþÕ‚åW—ðtÏ7¬mêYë®ùáe¢åëGxì.î‹'_=‚Hê1:¼ˆ.&%îcéÞ†eQ 5|§Jä0Vn^.Š y6>¼<*{(¤¹Ç .eÄïå¬ÜAOn»òLÑÍ]¾Å˜ò 6Ñ˃øå5:lÅáû<Û¾ƒp$¿Ë~ Ž>ó'‡LºX× …€NïÒî ý\f_é‘|úû|"Ö¿œžèõþm̹Š§w†?Õu¢ì1îÉO%vXõöÄ{IìЯ=IF.V#)¤'ä¬. ß|HôS曥x«E×­ùÀ{Tøk\‡¥\Ú9¡òtEàêæFUÓ–Ït—¨MýZ&öõZ`Þïi>ÏNV‹‡ä—ð>b¶âŠp¬dŸ”ÇãR Xq/MØ(>fÕ©Ú¹õ“†T©'¯ù_êS­ž»¬êi#U7»eJTBØî<ì]aHÞ Ø#Ò ç¿Töêóbͳúæ|ÚD `dà®&â½Õ „ëJ€RUhJwïèj_hª‚º×²À­“+þ^>úÜŽêpÏ0­>EWwuœÜ•›y‹UÆ_‘“_C^èC/;‚«¡¬ü¹8ÅÝãEÍŠĵ8Æì—ƒPßµôƒ§HKö,ÖÍ}ƒ°›òŽq êˆi?HHiÔZK¸ºÌ*A;êÔO¸í7sÍ^õgLC/ç×s*˜c¿š/íË ª˜QsF^A<ž%'ôþ›4¬Ÿªû3û²B_•p¶8y^‰G£’^w¬Þ–¢£¨lõP5¨Q¬`RvÕ÷ÞØtgÚçaÙø6#ÝÏ)ß$&o¸•ýúz9Šqån܆hæ##Xÿ5¸ðlźéRyEÒ£,uÄóôÅsç|ç‰5¼€åFä{nV|¤0ëâá…Ü’;›ªî¸@7Ó.Ä‚#Ì/pñ4žeâMÂ)^Èí¿S4àEYÁeá”Õ:¬íÞ×I®:ñlɺ“(ú7—(û_îæ8Ìðë<­8xdÙ), ÓNa¡Øö ™àNÑ)²,¾B¡‚ H賬pB?ò–×’ôó˜…xÌC<!ËUˆÇ‘æѹ §¬éüëfk2ìH¿×šfv{}ój e©¹â$‘Ïá~£e¥ž¡˜Ü“Ý–é+l¤qêí1}é–¬íà3wð×›@1yö…ÛÌ5}ÃFpß~ËòÀÝ´„æÞÑmtÇ¢´Í°µhñ¢jÑtj¾òâÇ2ß¼­Ž2J 3dñ(7äßiåñVâ²½£?Õ0maY[Èÿ»‰"ʲxÈïi:’€?Öt4jk‹U[[,ÛÚbA "~J. eüpª Uü€FßiJÅÇ*~<–ñãÑUï ÝB…[(íÿå¥Óå¥Å.Úé²í®ÚéÑϾÄF é"~H—ñCºŠÒ#º]0.Ú7?. ~ gU< ¿&-®œö“͇Vâsã2.Ý/F?äQèMn|ø–§7ÝO1Ö™>øVqÍàª:G—:y ÂGÖû7s Šó…Õ~ûþÝj}¬¾E’Îþ› uš¨`¶^ùêPX‚,ðg¥Âi„Pì1›!46›ÓÐ>VîÉ,<;cÓ,4µÜm²o©jMÌǵ b0ƒv%¼”Þè…8y66…!jLå!Æ'$Nfc_S A“1ÉgFüÀK¹3€LLøGψ¤š .1“bv á¶Ð°$qHmÄ0O“=š›k–ìÝŠ·ŒºâsÖ,O*êagçÖ´ÿ1ëBüëKàXUü¡©è÷1•Z"Fðpí:Å“Š–·ßä©FêÌD©Ëg†Ô¥†û>-ÈBKÊ*úZSq:’Pju$U$'ˆAà œÞö Ô èax“ª° ê?[(J’€Pd[èî¹Pžøó\éRdšCÚñd SˆÜ¥®˜.çsÈ'Ó ]ÀqÎ âö½Ç&ÖÏ—‹«¯‹5åXƒ0#ó[6ÜWßà!„Ápw+ oFS«x÷þ‘õœ©=ò b•øÎm!æªÇw:&§e çŒ,{H¿§q€m —bÞµVŽÄwÌÐäó½ôÀñ9R<ð… éaÑýtÏtgWþ þq*b»ðxÞBœ”Ë= $Ò+!JMq÷BÂ% ’Œ)ïžCUxnrA܆¶÷Aq¯6|œú’ÜÌ!]Í'uÅLySbWù4ãÊO>.>°Uí±qËÃ-?†9§eÞUŒeþÓóA`Ëžÿ¦Äåb½3—N ²ã› }ä_Í?lEýn#—b>¹?6Ur(ºW–yOÇǺ'sžpš«0¬äudãrI¿uSéA”ûÕéIO]Ùc›R%j ;µÆyc@Ž,bñhwÀáZî+<&¶~1<Á›:.Ù¸õä4tÒ=¿úóìåÛ!Wo¢4Yï³ywBÆÊ• ·†oŸß¾»ººÁèºl?y©&¤#Ñd2$õUÄø[§û½TU‘øîî'(ÝT©C—E¢C4¤ËÉ$#õ±ô ;ty4ºÌB—è²NÑÑèr ]a Ë;EWF£+,t¥®è]®´ÐUº²St£ht•…nd «:Ewnd¡;4кD7­Wo‘êΦFg»»‹t€ûbð ÷¹€î‚ûÑëù·6‡úâ`2{'þfB*³µîõøg“óñ^½”·Kü PKŽ=k¢õ«Ñ modarith.hÅX[o9~f~…ۨрRÒô’• )$²ZíMÈ3s«3ö¬íIJ£þ÷=ž+Ì…’DÚ•ìs÷w|>ç„­¸+2œÿ>{¸ŸÍ–ÓûÑ`>yø²übàãP»gŸ„>À5ÕLpE¨Â8þhXƒìºahY'Œ»~äyïÊm¨}æt7ïwV¦Üý•L}o‘úkp$5‹ÖÝ`:^ÌÃñòz|3¹³‡Æ°˜ÍÚ–•G:º½]>Œ§³ÛÁÃx9¼,dà(-©«o¤ˆÂËIâå—þQ:sÆ×/TG®Ï< |$ÊøŽ6–î‘h‘ˆq_˸ Äõ©R H ¼È„[çwä/.4½aªTn"!” ð«"@ÝMÅ¡ õ€¨€ú>(M¸à9¬Qû²C2ç¥7T§*s+ù°›!™š€¨H¦7hæ’ #Çǵ²ž­d»gY-½ Á ’9åžØ÷8•­ìB©2NÅZµ*ÎmL³ÉDOãrEŠ\eK½Þ=»Ý¶Z­ –é¾þmŸá.òµm? éµ?‘t¯+aÝUì»Ñ&Ï?x¯–ä4 ´›©w»|ãëhµ Þƒ¤\­„ œ:ºÝoa7ÆÉÈÕd%E@®Çs‚`x$ÌJ­Ðò#“:¢~M 2ô…)]b‹Y¤$œFã¤vp =RBã€+ììaÞ´…}Ktkå§m÷ˆAò¢øOyAmúû>W‚ù¥¦­¤•³ÖС–Âfvbƒî¶½«+gÛhœTÖP3à%æ+ê/XL¥J‹(ï×´bz+ùë•2ýÔzÐ7#ö;f± >Pf´À¡ ð©öó ‹·¹ˆ«^V¬Ò?IoCžZêû€\zï…$8c·ËSáì¥fA¯ÚZëVYØS*¯eýlÿyloUxP8Ñ]ÎçÐÛærV•‘‡ºÀ;¥#ÊYìý!~pìü§VF+ïa°Á¿à {‘¹ïÒ¿µêç¼GÿPgï¸ÜžÐø… Ó+ÑŽPsÔx³—28¼>?/ÙLÏ_–¹Þ\rh¸¤`£4ßRðMÝ]Qõ§é×ø7ÃaÖÞøn»itNø³`eÅ}±UGN¨€8(,‘Nž¦N9…ˆ´Ûf¨±!³Œ4™“¨©b/$¸ËÊš¹cåfgŒy+)ÓA*› ©PžPGaUê?=E?ɵ"¤N;jý±2.4–lÔÓÖº«W¯Ô”PÞQìØ~µ¬ ëhKÎG‰š’3>Xÿ¦wTk¦¿µÐÎaú§çÉåÁÖ¶ jp8«€Þ9pú¡±$ÄEÎ0pS‰ ùLÁÌ‚ o}¸0ÙRKW®ñ B *[pÝmOš±‹p°&¾–1¸mÀt©Úq¹AÙ_UÏÂ0~{Ì C*ß$‡:†ød2š¦_´ É!‡’`k˜—Y®iÇQ³³v]Y¢ö¢]® ×Nnm¾¯Ž0 ¬cÑVÖÚJñˆÅÁáBÁþ`†‚·Æ;ˆ Ð<îµå4¼¡á/\â±_A軪q]†C£WéJÅÍA <·H”¸<Ÿdoê¹ìSÖäþ\éRÄjå’ð ÷¾q&rŒsçfŽs´ÕÖZVÒ®¦Ì®¼2ù3 ä³ê{À`úªï /{J¸ ˜¦H€éê|›C@§sh+UŸ©n=Uä\HsýÔþ\ƒ¾Û›f*ϧ,ê‹ôïZa±dôdgüÖ¥û[†º]y*<¤ËkÕÕ ƒ/f—šïbéÜÓL¶ñ¤}m²™³˜ócýk~_[j¦›ßE´v [ã~;z‰‡Þäj&Î=.ôôüEÀ0ž¼é>Ã>™;ãE4å"†S¾Îlà¢<ôn1"0#Ä1⋘ÁÇ Ì„º@„k^`PBo÷ômÓ…ZAsGȽÉ@r¡åš1q-Ë­dáÔáâS“mJ` =nÐ G>Æl¶œÞeRã…Kb÷׌¾yiZöbãÔR”6Š7sûUIÌÈÍ¥¬¢š/Ã0ŸqåÖ ­ûmwxÛK´ùãW‚%{²þ¿°\ñÒT¦Ì¹FVóîÍs%…ÎÙõXù¼ä–%ì ¹­ø´ùôÉsëû玫AËg¯j^⬋¹QÏÀ‘ùs |kÁù–Y‡šLÜ9BobQ .YNsÌjBÕ‹¶x¢Ž ³£ÍZ–ܪÐây…U¬b M3Œe‚#þ9Ž(À¬”ø¯’Ò—Û5Ϥ:rìRLÍF"Ñr#•þkPIEÉ|àñ—/GnéÙtõ†@ª™Q¹ÙÃ~=ýGÚßPKÈ=æ^—ò yCmodes.hÝ\{oIÿ>E‡H+Hˆã½ÓVàøx¼Åˆ#¯N Ccú2Ìp=ƒÖ›ï~Õ™éž 1~ìʲlº««ª«õè‡ýšÌ½ž£Þèz8 ‡ÖåàÌ[«¯¡•x8ÛQ}ÿæúÏœ¸¸úæ}µúšxŽ»žaTsèfºdz´¨)­v¦®ï|Õ[—$pRt!uÈjAõV›Þxö©V÷feS{ÉZ«ýÎ¥1vz†Õ5~5ûõSàéûW¨L1EK†4óõ{¡ß;BcŒQßOÐxˆ~9>~÷÷_:hîSħNM€ü9 8À‚ƒÓYC“Çñl¼Y.qH‰#$©"87[¥FØãvb‚£0¨a; ä¸vJbJnrNý%È& ¬ƒXŽ…w> 7+4‘‘°²½:ÃÑÇ&ªV¦~¸`Êß-p&Ë•‹™Zl2(¥2"^ˆéÜvðQµrc¦ ÓŽQSŒløfr¹~L2S(á …$ÀM³Za1Y>cÁ,lFÈ–:ì,1 @4ªYÆ7ïÙ®P§ZL`d Ëfäˆv¡’?ý/vÂ-|wü(žƒŠžL}.p x¦î†x7ˆOŽ•ˆ„Øž1ÍÙ`Fa{ˆµÚl<4“ð1Ñ Óå:Ñ£›ùŒ©+Å8Ž®Ð§Òj¬µ&„qþLãØb¬³g?£ÄTÃ戂…¿†Ù€[ ©V4tÙDrðÕäÃßl¶¼üÁÇŽ1>b®)Ô“p ¦Ó¡ÙB«õÔ%Úàê}õ{»ZÀŒCÁÙÅEò¡?°®&î…¡HêÚà0E€§èhU+ù[!º$Þ'¼¹ÀÞM¸¨7„mÑ=Åáš‚›X¨ïNu²ö÷d¼ý­ÔxL†çöÚ ËðÈ’*|~Åá•í’YÒ+;¼b†Ù1g9õ}™ÁÞü2C8»jeíäÆãÑâÄÒvÏìÐî¸ÐÌ|ˤóɳlÍ«1è—aÄá+zØÌn ×àÖæ•5Âÿ[*"“y¥|Šy|8üUn}2ƒÐ Õ@? %ÕÊ}µRañòÝédAý;s>ÂÁÆsàwünO]&>&‰&‡>D’>Êv×sˆô=£Ã.Ì«îîPä`§ pæT(áÛæÙ!Nh'"O fïÚ2ûct…Ùi:$)ƒcèC.ØôüåÒ÷&«8yèFkFÍiTôPaõA‘M¸»ØpZ<ú³!®ñÐ&4@?ñ,èNÿošH†j—GáFYSq±Ef9ÉзZ‡S‘Ù0±ŒäÈéAST,ÃL6îä9A~Kaz!WˆEM™AëLËVKsÊF“¹xµ²#x}/]‘œw­Ä– ¨ í˃v¦P?ÙN(ÈNÕ¢¥TÞŠ 6êôÏ—–yÅËVU9’ÂYØàk‰Ú¡‰Æœ ãÞø,µd&Ž¯¨Wk§boõÌOƒ!¦&ø'¯árЯړ×lôHzv~zŠèÄçÑ[-h¿ËcÇJ—ží ðR!4ö½h´PÎ_‡«u˜Ê­o’u+¡1¨I4ÿž¿† Ñ–\'Ôöˆ«Ëh¦õ¸KðÑÓ]:•§º²gr‰Fdü‡^‹±,T´SË›25)2«Šø«Í€þ†©_çŸßÀ3¶™h ¨Ï"à.Ï2´²ÌµÄKgµ±‚º!C3µ±`AàP‹¾Òþ8Ø×;³ìÃoñNŸãTPÎÀæÓ_vA|s&Â@¶—î›ÿþlȱ“[˜å9qÊcÒ âÁÄ(ÛûëåÓÁ|aÛu±ËEŠG~Ù`H ° Ø^ÖãD"> 1»ü/ÏÉ íò½=v¦“ѳãvãûÃî°Ùc2Êd­Š4=GèÁ— ’Àæoÿø§N‡­­þÄpŸnE9ÈûÁŠç­dà—‘91¬OÆõx22:—Mñ`[£fÆQ”šaU*®o†:þMô°S?ú­‰væÕ'sä(‰â¯?€{çÓYVzўĘíPjoö‰ |ü€'žaéíjàª`ç+ÓI)ÕB[ÃkTMo+ÖéÔ ±Å}ºÉÙ1çûˆ<@*— %ñ»ìößÄ»ÙI}îÓ;›Îâ’ª¨ÜLŽ¦ FÄÞ^|%Æûðîglq¹’T§M”9 €q06}Ä"Ç$é¸Èg(#³Ä›É¼b»ænÃSÛþVΑÍÒ!ïÓsvç)¨ â}@nôºÖÀÃ_l%ùm~àE¸ÖH ÖííoZåž/IHŠÉ3Þzí§ao2.Ô2iÏ‹*ãЙæU=Šò,¬[l…˜An÷_*¥çíÏi׊‡>›UރŲµø#•2 ikÑj¥ôU´ÕHNô Žóâõ„´+ Üà72“‰¦„ç¾HK.¹ŸÎ*ÙUÊMô{¥'nYvÆ“Ÿó Š\q(´¿s™-iW ÷’¼Í•½ã°2gçâ:½)_Mt;ãä¢!¶ý9ñl7ÚÕË“ÝünžÙ!ZU4ào Dljà{_5Ä~l›&§YJÂI¤ W iÇeÆ×µ+Bõ0jO!¶ß[–µëf`OE²!åpʤ·“P® »«¯x=Çd,Q¬Ç¤1ä;˘¨Î6ºPýb­ñxSn]Z¾<#ÜòhºG¹AæÕ œµZ%Ò*Û>È@$üå ¼ôûÕÞ×Øåxc¬ÌòÃM™£?dRJa[Æýõñuqm^’8ÿMDå>^oI'»Úâ\úCF¾|7±aCõ „éuä‚•U¯§@ÿ¯ ó‘ÐRV¯ÕRàP3®51.‡‰aõ.:ã1Jn“ƒdíè8J ·ŒÍÔ…%$öNIM÷„B“ºá€BÅ{Íó.æPîOãgmr|Þ]ú […=˜ä¯\K¥m˜öäzh°‡¥qLI¬Ìƒ¡àÃÚLå*”Óz„á_ ßöSOéÖ›%|“J/B@¥€¦—¾0Ü> :Ë“?ÅRï©ós¬%:7‡ctkSb{aQ~Lâû|íºò.¨Â" ‘í8>åïsC_Œ”¯³ËFÿR#ƒ<ž:‡I³ ©8ý;yL =kÔ(žîcaðIP¸50Åð{ÑéÅÃí`óy:d ·Ïv+¬Ñ rÚ|‹ÈþžØ…b¼³kØgļþDãÑq¯_:?öS³j’o±â`«sDx"yЂï6IfE_“¹þ$:fßV·Óûô¥3:[½Áå°31»æ…9¹®Æ:äï¯T3UÿC•÷@£ª ” 4Š¬üêQWS¼AfdíêkìÍÈ\ýFÿ¬5ÿPKŒ=o~²à modexppc.h•“]‹â0†¯Í¯#H…ç~AÛ¬+øQÔ‹Ù«R›Ó1l›”ä¤;"óß7ýWEa÷ªðæísNޜөäRó3Ü­Ã0Z®ö†~ôƒtÝp÷Œt…L2Ë>åŠÇZàapxºP¡Ð¨¼¸VMk,P_«…Ýÿ‚c¥‘ÕdɶáÄgÑ”Íæ+Ï×ÇUö 9·,ÑŽ-ÃÅdÇ"1Ùni°ˆ¾‹àÓØ@ض£PržÙh.ÞA‡„$Yl ]*Î>Šk'}¥®‘L$m¦•½9?Sȉ4ÆWÒyyyà&½R]p_É´q¢ñú4q¤' hµ¤¨- ?I‡eƒDÚxq.½Æ÷¥÷ÊÛ?ó(×Ïã¿þ²_qJ¡Ñƽá­-þ°ú¡!6¦ÉÞ Ž¬o:j!cÚ£3h4ï>ni3…ËÊ…RBë¼¼ð”m—‡Vð¦6MAßéXšTé¼yœÞo+´ïṓúêJp° “ÿ†ûF&RÎœ–^¿´TòYȸiÞܺa²™5mÀmW5îT…0Ð`= ¿ÝØI|W9èã¦ÚãÊÖí¸¨/²>ªp¿à÷ã½4T]Z”1‚Ì2Î,DnÕFŠŽkÆ|/׎­·Ü ¹HÉPK= ï˜15 mqueue.cppµWmOãFþÿŠJ‘NHÒ~  ½ò!!%œNÕEŽ½IVçì{}¹´Çïì‹ß(=•ÀÎîÌ<óÌË®ÏÎ`óœ„t¼0„6l#*aà2ÂÀõˆ”X“E@=ðùÆEÉbŸ…—ZÖO”yAâ8½ug},%Kæ“%Œþ˜>ÞO§ó»ñôþáqV¶,kLâØ]‘ßåÙÁ ¸²ÓS0î“ý‹´¬Æ6seÛ΄ŠÂVbÛ=º•d£­xÂD*·þ¶^,+F¥¹€²ów.[‘GÞ·¯“å’DÄŒ\/y´qå šÂVD8lyäCsAV”¥+Â|<Îb±ðƒXD”­ é­]ÆHàÀ‚ó÷¾ ¼¥" ]‚­,ÁåÆî·‚šä«»ˆÝˆIÄ {nYéÿ†ƒN uŠÎÀš=ÞŒ‘îªEG"Åß9®ÒùAr4$z7¨\ï‰ßCŒ¤¤¤ Ãá”b _Y#~ªŸÒUŒ#Å[º‡–FV_eÄ™°[ЖϳÔ]+FUxe>?1!ß„Ú­´ &ÉfA¢û¥ÙˆÑÑ%t¡Ù„£+¶«*…<œtF™«4Áçî ‡Ú^e«#ySÞz²âÕíŠqªˆ‚Ë«A‚˜äò¥‹K{©‹ë —ÆùÈß,«’%O¢z­¨ í%a\~rƒ/$‚­úc›¢PU#Møת|/¥?§‚D®àP¡Ê(%[µ˜â¢„‹¢±ƒM‡Ýs  §¤Õ†Ðnç° QNO©# “O­P¨YžP‘Ug–a,¤«DðBpƒiÄCw¥xÓƒ£¡u;#­eؾEÏY•6ÐîµtnMR©JèWNýJ"ã­ÚE4£u¬j:í;u…ç9…]#Ò£H§wùƒ“ŠÏY¸³M«7ñ˜ «„'±º òÌõ#'(Œi¡¢y®T <þѤwŒé.o:õYíNEqv'?òSi¢ÛçÄ ¨Øø&t#sö+ °JñútC“hû_5†¬#•ca3_Ò(ÆDùÞQý 5…˜ 1¿®Ñ;¯N„~ñn9‚15MDß~íÆ(f–²™ÚvÀ˜×5ä(¶6YÉï»fd@G¹ûeñ-\É qÏ‚}|òqK^ÊåòÏS‘u¬öG%uýY÷‰@7öÏpIB ¾AUY^p`Óg¦·¾!‚x‚ø{2¨GL¹UŸ{º)>Ó'W}³êµé“„¬0?÷;xý.%œh(«Ö?\àjö¬¸à‚R¦¶k°õ™ôbÓ¶ko ´‘'Qi59øJí»ÂÅ]4#;©ÙØÐ:æÝ€‹”S½«#oÚ9éÒ’:Ö’³º«‚¨F!uœ*L©7R;—H<_h˜z‘<÷:XÚv5Ï­Œè<ß9ÿ5Žö¡Ë ¢š3­€ÒêÛ£¦Vy„Ìz5/‘×¼jû½Ná–É#/ûªg¥#pŸ0¼ù8_\ÏçîôÃÒY:î{ë?3N÷H¬#ƽ(õ)4ÿIiJ߆ÍÒ§€EŠ&²òñ§¸³oY³ÁÔ¹†Ž{é¼Ïìar+1Ÿ·,ëääL©”dM჆µ¼ˆH¹³?šLŠ FˆÓUÄ<¤Jܲ5'ãë‹Ë4hBýEB¸ D²!Š Þ·¬l{Çj”aì”KÔ¥>0®€ ŸÞ²ï´wþÛï­®e5îóa,EDõÇœ)†V¾SÛ\*˜‘ ý“D)–H8ŽI‚_tü-«ÑxظY‚öè—vvaãF”¯U(ßbÄèŒ}Ö†Ó¥l2W‡"åª.~´±\óTç.­î…W+ºf¼ ¹8Co›s@‡ûmX Á*ÞWLzü€N>#¤£dê˜--<]ï«Ý‚×½\¬¥,{‡oR€%¥8•¡k4O \£`†úúµbx„ª4ápŠk\‹d^Ef›O!I²e=$xÈIÚ­Cä}pKF%zl×¢KXu°ÔЭF´‰Sòí†*½#«ˆb–Li4\®°ËH®ìÖ“k~ÿ‹ªÐÇôhÛy±³¾§ÉBœÛûÏ+’¬©ÂÊwU®r‰½#Û™IÊït$ºÂ×pì…„sõFÎÕ`9Y¸Ã÷ƒÙÌ™ÔòÝSIJuasW†"¾¿!|MÁ—¢çÌŠr¿7ùëúfäNÿoÇ2ýîS™B‘ÈÄü³”gG¢^V]´ {ÌÒÍŠ&×AÞWrV…nZ»bêŒÙ­7gOðŽªý¦r(ÛÑù"d2ëå½ATùÓé—Ÿ¹ªCõ„”"©áëv(¼]ˆŸ6DE×Óà½åx¶øÕV(•½ÌpßÛyŸ£@±u*R©É¿¤aè_nIlWFÏqJ]‘8awH$8Rte²¼[ô)ÐÞ™Ñwa®¿;¼Ui9Ò~½R]ë-™ù8€lº‚ ¦$¤ÞWYºÌÚ ÈÓ S óFÝï¦N.Š N#&¿ÊПë’šUu·_LÓH±û"Û؇ÊTÅ:¤ž‚)“XI/átódwpÎ7ƦÆõMØeÜ kí¼»/>b%áîÕ`V‹ …¼ìQvG1O$ÎYð‰"õ5q<<êÜ6N^½œ]*LÄvÌ„2€ÉŒÙÛ(ÑÿgÙÙ²(‘ª8U@àåçϧ/³–Ú†”Sà›˜$ 7y”m½íì%ô'Ù2‰íwb5…qè`¼"J/ÜP<³å¤à¸š×†êöž¯(j˜’æisï&Iñ£ÿ´ë¬©§`{²fÆ®­[mÝ·õªšôi--Û·Ë £[1lWVf#&oïrÐ*½|gé´Šˆÿû©›³snïÙâG¶5rœˆ˜¬M={oΌϭT8pJâ"?‡í<‘Wæè{Âýˆ>;nõ¨òÝÏʼ¯ªw冫…}VÊnõº­éñÓù—ŒÔvÏg6ÒïŠì1⺗×7“Ál4tÝgO4ݲÝÄúwÑÇÄDú™²#êâMÑéT)›´áhÕBk·F…éx¬¹v„XÅï¿PKŒ=æC ™™ºmqv.cppMÎ1‚@…áÚ9Å(„X!l £Ñ’,»›0 ,+ b¼»Ðѽ|ÅŸEؽçP9‡'ü Äl,J«ÑµRd‘ƒnª[R¨ûN®R/ø2„©$€#YÕNÚ çT6Þ¶ð PŸ—q"ª‹¸f…Ÿ ‹ã¾,€¹'3rfG––I2õv¬òÛÓà ‡ulÏðÛwD‘ÂPK‹=èçëÄìmqv.hµX[sÚ8~Æ¿BM¦™¸°¡}" 3@h–i.¸d:»FØ"hâÛÈ2 Mûß÷È7°Í%ÍdÀ óû9’ÙܵèuGßuc¨ëÓÁ×ÉôoåÖ˜K‹ËJ½ZEÿΙM•j]QŽ™kÚ¡EÑÑýÜ7ùʵő¢Ü¶½±Þîö¦Þuÿw厧ë*ð×ß¡©"¨ãÛDPtaÚ$ÐõhøMŸêí0½ÑXCñzwø¹Ý5†£éP7úÃ[t‰º Šñ]ïI%¶fóŠÎIh‹®7'¦ðøÐÌs[JŒ&M¸òÂ\ÔD~8³™‰Ú¡XPW0´±¾ÐUûžSêÀJL¨<+1aS©ˆ•O¥§ŠRÑ5÷B_'œ8TPœ¯IåÓ…å"I³Ù³#)(yn𬵼(»¥àŠ)Ï¥²æÃ*zþ_1=7E-Љ/ªR©4‘3½Ïoãd·Ö çsÊ©epâs;DzÌ„Dz.Õ:½Ñ5=‹b 9—hÅ0ÎÒVN˜q†–°i4в±¾ï2ÁˆÍ~R,IdTö É~}Ü-ÑòãK¥j’öO$g¿>ÔŸÐòÓŸ¨¢IúÈÙ;‚®©(,BæÄÄÏœŠ»å¤ö•‘Ú¦Iƒ  ¶F©$m¡ TÜØ@Š Ú³@p¨ð’Ä7tvïR 1(°¨ ­ ±CzCÝ{±(Ùn؉WƒÍž+S×J*u,½<'v@£XçdT‚©s¶„ØC3y¥Àq8‹Ü5äå°ÔY ÚõBWà"£õz‰[L<¤±;—³Á¥¬*šˆGĵ<ç6tf”'DG'ܽ×Ð GU?#NÔR*ÏÇ}WÐ{ÊÑŽh“¿ÍæÐ¥XÕª< O½'ßs©t‹ ý³òT‹ÍÀkÚÎHŽ]Æ¥ÎÜk[ìࢅ™Í)FÎä˜çêfZ°è"q|+íÈ0èöÙžsßKÍ­¤3gð±œZêBäPüQ¦»‘?¶(#4BÖÆ%NÌedÏ_='öÁ:ØY.§»Òº”þka*`7`!¶¨ÿúÿ¾µ^’½Me¼]ªdð§T‰å¸¾y1:Ô1ýÎ6_¤¬¶'ãRCfžgÇcÇòÉziYRÄ[AANÞZÎE mEÂ)–ëkS¶¢ˆ(Ru '+ë~y¢Ëh lºMð•<„ÀçM³;˸»»uÊŇÆ4©¶[ºOû<òd² y—‡P<‰’–_€Ë1Û[Jgˆ·Æs?s¦üAÝõ—dorpQÖáKµ;ák å3HÎEH³þ£{”70æµÉ1åôL­7òLx0^4N]Ï]R.3 /¡Ãõý¢¡VƒÓPEïÏa ý™HæE#6”Í.\œšMÃ빡sâòݧÙþàÛÑ×oú]I&ÏÛq®gзwÄ4ww5"6½"i˧õ\P™o¯–ëäfÂ’ŠýÓø¯äÃD°°Ï\CôwL‘¨3f —za°©iDP¸$1‰<ò.aë}KR h±ÿüõCE¿~¡m[g?ÔÈ•J2R£\ÊiѾ†$§†6z`¬ÃoùEbíâBB>ä2½Òã öµ;èm£ß¹éí .èbžÚ„·9 ˆ31WkWlÉ`f‚ …àlk—&ó7]?™w d^Œ½$a#v—y."Æ#Ÿ%!÷„Ï‚ˆÁ–nxÌ×FÜö“Økôz_‘¾`/o5^½À‘eä‹%;}÷ÏËë·——7ç—oß]_™sËaA5ºŽ}(¬ê£<¼MxÊ× ¸>ZsœxlŒl…—Çé1a€ܼ½<{sqÙÛB…ð%5W?e³Éä€å1»‘Hy.˜§)¬fkK‘åÔxÐ6"òƒe¯÷æäâìêòäôìæÕÙ÷ço¬Óô!ÉãËK»×óâ(ËÙ]œú,» y–_­y^¦ÁZ0‡Íg™þuÑëeyZÀNoĽ¹æn(z¿õv²Ü?<”$!Œé×ǬÏâŒS˶lFôv`òŽÜ«ˆ²à6"Â÷û âUð+mz0ž;:/òø&ÉÓ£®½ŽYR-·"qÇ:fÙ «±úˤ\ Ûö P¸¢z9NE&Ò­°ZØÚ„§13)²Õ˽ÖŒ¶­›Ã!Eyˆì ¤ÕaSœ–qʬÚÔÄ™/Xrä4ÏÎ̆5ÈÐ:ø÷MÂzïLìýQ}C péÎN°dV²Wáýóû_˜ã°‰|»ã¦‚ h8ñ=¾ªƒ¢y„A7ñ ¿³Ó¢øG…ðEY/2cy µl¹òcÿÂTäE™Ç § žÁT˜ù±÷qa ñôk¿ïEnHEG_â&6Š®\ói±¸ ¢ÛPäqÔ%€ÃºJ[öøXf™æÚöv‹Z˜¨(4výyòË¢Ô»q²ó¬:}K"}åâV¤°„(© NM>šÎ’75ÚêŒJÚ¢Mr2>Ï.ã,ÈЛ}ù%KØ‘cú¹¾p4ýÅ®Ž˜æOn2ÁSoeìcÿ eÈ,‰³ŒOãh+Òü:þ!Žn¥„ˆ0Õ&KˮӀ‡¯ƒmqÔâÙ°²@n\ ,ÿ±<äÜzŠ_ìØQ¸à‚.lO*À^“…Éöà—#Z´`Ôk<-+a{õIv¥ÙŠ]`Ì…>]‚€3êk*ÞÀrÖä“Ì'i%æÇiv úÿ' ­Fk·.Éði‰5î;‘‚£¾Lcgtj^4d—ÈB–F¨sƒ…‘ãÌØ¿þ…¿ç†DDÇsÔ&÷xJ¿Ž¢ÑÔÀŸßˆûäƽøâƳÜ!ƒ×ðÃvÀ´›Æ!OA)þC¸JVâl+"i¢]pPâûÓׄ·ÍvÁÕÙ-‰éíh„¢uÙÍ¥bBM<8Î…€Èã¡W„úp˜òôÄ‹%ñ€ˆ—lQÏ™Gî‹L‚RÊÃPã•ž¨-Ç M¯‚Üâ6)ˆv|±5ì£fså_áMëˆÖHíBråW8(äüV H lø}å´¹öÓè_q›_ÇW›‚§Â·ì½h¡ð¯ƒmÀ-0ß)®£kíÖÜwìôE†"%½}!u¼~S¬]‘~/ƒNÀ÷Ë4ºm T4¬‡u)Ú‹ìs¤Ì6™ì¶xD&38’{hã‡ÌrÇeô¬„å µFbˆÆn·ºò®ý4§$_+­û¡ðxö´ÒÕ‰ïz[êNƒ=5¶ÌêlA¦í´xeØÛ¹[`+-ˆÿ‹{±Xn%C£—(¥ä¦ŠqˆÈ`8Î×/Iƒ'9°BÅãÛ8À}–A€ö…qœ0X± UÌhjÿvwÁðG‚9 &gb³3>…økE°x®4z³¶ÑûÿCø7‚aÑûÿ=–8š>n†Ÿe»Œ¯‘µÊèδÑÍ1¸ÚÙílP³³–ahaqÝÖJhØÙÙsíl•GÿPKëÔ¾(­šÆÇÓh-ŸíªÉ–þÝL튢*[RJôDFAa?jL ^µ}-/ItXÈÊ¥UÞ¤€%»L› ðí02i‡ž]“Pwºí<„€óÚë’àßE,äøïð…IÆb+Bb+AMÀž€°iþK„›®—à ©l‚iÙ0ƒ~=µzbÄ“8™h«!'ò2$ Ýò°)k~OØ+8ð8}=ï›[¶’jžÀ ƒH0¢ò;8çg»2È„û˜ožÉ=NÂÛËlëK,« @5cüƒ¨¿‹Ó뻘–eo—g Z!÷ºJû @À"ºÍW•¸7^°#¹'ð:_¥1*p&ðOÒÛb-€ð`n€'Œ+^ÔÜÄf—C*o•ytc‡½Za©Ò8…B©ñôˆ ŽÚkög£o(œAÀÕ‚ÃÃK4½³Žùöh*m‘ÔœöfåÚÖbŸ÷g»zS‰^kÉ—HÑר£­Ÿ“õÂT¦ë‡D¼ȼ;¿8³­AÈ*>ðû’™R¼%_Ênš‡(‹½‡ä|æœ\+%MÙZð(c~\`™á v²Ä jÖß°\ÒÛ©@6eu¤YÞÒu´Ž­Á, |†Ðp‡”‘”ã¸ÏOÔ*×y$@äå_Ç *$Ií¢q•–Õ2ËQö‹[ðz¨ó椅Y7_µ@Øë²|£®o$ÁëœFE®ª’{Cd “×7P¹¨—ˆ%š°ñ\3ª8gÿÇqôìPÓaÑO[“cá[eáz¢u–\=TôX2ÆñhgaÒñèù–N ãKª-Â/UÜ’Ç ±o)þŒ]q@H:[5ßÆæFUØlÄó5®(;*vÅí´'‘/Q;ô:UwUÆAòˆ ¬Ãj[cR¿V¼ìŠƒ´Ï¦r±ÞM¨ÌkÊy¹°Î>Þ}lØ09¬DUcJT¥6·xn¤Qæ¹ýyÚ¥½NùLD!ori T/Ädþ¢šòÃU„9›?’½—Àñh€XÄù` aì†I^­‹0°‚¥'˜9 ®|àc®Ž”æØÊÅSæ„a†æ6îÑ'–¿§&¡S"C{R½*Rðq §Ò(µž>R:þà mw_êÊ8†ùì/_ÓL†Ìsºº~}qþ¦ŒÃÍå –ÔŽ‘’X{_Ê(xËfmÑÑ*ç…—ѱë‘T$”k# C e´tÁ÷·ÎÖ’*$p< 6B–ЙŠ öÖ ÄCÓ)H×õzù<>Gº2qûV½´l7ãe¤ä:¡i Ú|Grç”Öf¤È´Ùñ±l¡é©+.¯„VÎø6ÁÒÚÎò…ñR)ÖÉnH×ÍÙnš~¸ÜHÓ'7›imGØ·Æóaõy”<¹¯dî°„<4÷¨,¯ör4[Fæf¾ÓÎZcbSÛöÌØ×c* Éä²~¢?’ò+Ù%(ãóì¸åU?ŠF ­·ÜzØrÄ2´Ú]N UÁw»Fü6ª| M´˜q>°$βí>ð9+¼•,o${Ïqäîw+‘ Ú i¢1{×™¢‰­*3K92"øã/x¶ÉìT2F‰:k·ä–6ʇÑñyvây"ÉÉ®át»[”WYtÔ,>V.¹]²ø㻉ÏèVwôFÉyž’&ŒFeìQïK’ÝÂiè4ÑwI"Òj\ý®Žcw¿±ä˜Ú"1® À°*õÑˣǷÀãܵˆ”´ÓRzžÌ´Ø–' NÉâÈ'¶¯I‡âi%‰’Á…n½7l^ë¤S%2ºÃ‰×1žî±)7ûpvo}¿Vñ1lKBÉÞ¾»6TwȦTÒŸÚôxt•™@à ÆrÅ(±‘Å¥ØS£]ñ¬â éÏ˽µ1QG+p=4Ml£tûÌóƒ5xÚÝõ]½Ò¥¡Ž’£‘VWeEe°–qÆw`äY~³eyyjÄ8X&—g ÓqÖÖtYÊ‹×XÊÈ°&‚uZ¯H]¦Âçì"Xq :ó ]ÛQ9N¼í.´·}ÀÆ´Û ZlÓ‡ÿœÛÊYÿ^( ÀV¤äoE€í á’1“ÅÀüÓ)Är Œ“©ŒyÐbµV ºü Qº¥B­BDþwÎ<IóîgŠ „è/Á˜øÆñز!Ðœ¯ð’ŠÛ &€t•+³kØ›²\…¥¯Œ`I¤ü ó`Zq0£™3 ÇO‰™Iƒ“Aˆ ^àOVqèñK”?‚ˆö½'R/ÈÇÌ6|%H¦öþFy8ËJ÷6¶Ùrè[éþƶÍÆB‡Fü™W!È(;ì€B>Y¯:|Y¢gRËÊÎK«õÚMS° eÓÏ•Ýgf¨R«o»Á$‹ÔíõÖ•b .TeʧÊÃu~ºA.û¢d²¨ »ªz¸HöÅË™Ôÿ<è´´µ8ñ¨ªÝ=Õ!(£Ÿªj³» «;‡\ÇAŠ|´9^´ fÞ´@ÇÑìÃVÅÐV¥ÏÈÍ“®dƒ‘lã‡ÁÌÞŸC :…¿y¬x-~’©ðd(¼?ÿÚd˜™GOŽð£Mj+f°dÆðh€Í­UÑNi¶di1™¼é¤/¢Òýе՗ky·Ê!·dbq3zþ'äkŒo_î.gðh¼JT¼ÜìTxEšAÆLŸ’¯‰»`¯Çì'!ÑÅ‘P(ücVdÚvæxŒÚG®í$¬ºò‡1;Áóõ> )ª¬²„ÁÑÝÀjþ×lÀý{…x7i“/\VhW"RýIzuHÌ“ |á¥x™/3‰‰£qïÙbtòæŸld©ºËŸ«ä<tu;¨ªÜßÌT}YªbºG¿ ¥PÇžræ†ÏÄtKºtSâe‚Euë(ÎÜ[ ¿gL1í/R‘~¦í)MO£Þ‘•Æà•¼æÅf~'¹3,j¦êÏHÝš8)½ócŠ^›rÑ´‚Ê\v¿°ñUKz¤ð¨#oÝ›ÊnY jŠ´‹ ž®yz ÚïÓA1&˜ O 3WØMÌ‚H¢¦D*BJh¥æ(š„øΚÁÈÉEV‡´íýÉýRý‡~À¤‹pé×ö¢›‡8òfB/Ðò¥hͬ‘Û·ø€ÛõŽGÙ…T›[V:­ÈèsLâ¦}~IZ°2!Én·li_BHóQÛä¼Ö>«ÔD°ÜBS`e#×îçWEP}ðó¨VÍš«fÏ%ûc‡}žiõÛ¾Ò§rGG«O•ïq¡e*0ÃD ðû"Iùíš³x0üÆcŠö0‡3!ëÚÎt¼“ß$›UzvŸÄ‘ˆ »&}³81 "ߤ I³ù˜ ‚Ù`.¦Ì•b8 H¦i3²Þ…½ølî‹gsºÆWëg…¾àÑ…ìÖ…ÒJ|-A±œé.üͳVmê«ŠO/J›tÿmðÃÆ.ìH¿ Ãzšüáò¨Ï‰ÉKˆœôöFž·"¾{jìáÌpÓÙ@§f È%f®Y½ç?O~qœ }wE~T®‘—8òãò„[ëmsEåk«—në¥öÁÚHóñ),_ݪˆ`X[„1rð¢5~nï°SC´¼/]B™šþ“‰¶1CmÃq·¶ ¯mÃÙÆp*M·b´‹õ‰}BÀ>í.Í>‚;6~ºbÀÇU7Ø?±1ßsñkeÙ¡&”q¹ØÆ1YòHÌÃääQ!ò$ð o|§vYáê(òêÛ+Åg`ÑhôZè§G…a4oD½…±ŒïÀl§ì¼ãÏó9°jæX.,;>.KËÈÅ0J‚:‚AÊ\Fn³XBÓÝY9ƒTSávw󹂭˯óê(Hi`e% ˆO>5åö¨^k6üÖ~…ONR%¼ù¸Þ_–_¹ÆØR.Å¢%XfO&m‰À‘š·%.T3‰üb´– ðGÛ¹>ç|Úh¡ä"Nñ•\©S-Zã;¤£.1uëaž¤¢Æ¦"žw|kð<ª)ãyTvqk_ŒAÒq9~5àìÁƒúZL*2sV·`±›yŠü"Mi–ôWD[Ÿn S'(ÛßÞ¢›j–»÷ãÌQéÓíGòS¹’ï½ÄéèèÓã³éjAvÇôp®ŒòØž>œ^¥gxBì[Mñ!Þw4¬¢üòJ+dhå§5n¢v!_òBqª)×w±¼dvGùm¼éÃ;‘à¿oå#±µ™ABâ¬õ}ˆóÈ„ö"ˆŸò»¸6^‡o®ß: ”õøªpó”{¹µVÁ°•HHÒFUÎ †%Õù—ZÒL÷­¶}Pµ£òÌZ*f„æfÊ´>XÛá‹Â*|Dþo§ÆÌ€1mQ‰r[é+ˆm¤¦¿+¢ÒcÕªÂÙòxÞ¹µµõ=kÕe¿Ä»ø¬’‚¯2VDt‰>ƒ„Põ…2±)Dä &¶<,”€pýMŒ±„‡ ¯œ‡,¢ö‰Ô%Ó@dÔ~—­Ÿ ûM>nb1_qÙ“ÿ6@ÚI 0¤dBu¯ì1c?FË8Í‹ˆçØä:ÇæýW9»9 rìc¥ •A‚ jÂ3}BÂ5€ºÂãØòŠå}Xqœ¤àJplF¦ÚÙÖÄË®ëlEXTß{Ý Ä/~Á~Gfi Ù«!;µwº¥_Ûø¾\ò™ubwŠÀ‰jê\N5¡=ºp• aÛO[M—YsjX€™†U›KNj¯°Õ† Áw€½‚:÷ù]Ù†ƒðwEcvä·šèq~zûîõÍ«óë+ì:™×—Í‹‡É ½RyO÷À>:² Ílݧôk,­…ÌžväM‹>Á‚pˆBhA>œ®S½‚'øᣃ»˜jlX(1›Š@’¨µý#a”ïÉÁøÀ]|Çg ¤´þíY¯¬¢Ïò_iÏ£pãÿŠ¹¾¦¶q þ\>…§ 3N‚!±z¤3®Ovhéô^sX8â8†¤”vøî·ÿ$KFÁIç:——Ȳ­ÝÕJë]é·ÚKð1,ª½„à7ÂG˜æG•µöBã7‘À‰*è€%~û6æO©<›À³ Vð¥5Wœdâ§Tº$_+ÆB‡*¨¹¥½[3v·Ç<ÐÒ_˜vÒHµ³ª2=áèB…ÿ‡ÃÀ…ãaHÃb{½ÄVW…¨vÕµÜÐ/©íLŸyäG¹Èz5Ɇ „êôÔ–„ê ËÌÆu›*Ÿ{¸ 9d]×Ù0]§;«F¥ÿÛ;Âå [£?Z #æy5°6¥‘øhY2¦‡ A¥E¤±Ø|åR:×#º’z}ç¬)Ñ̪ßȸ¬¿©©G쇫ý_Mdß|=óÌWêÖdÃnkÜýQ<Ïy{™'Ÿª‘Ï«MÙ“ MéÁ¥½ÍÝ?)>¶†“:·MÓ«ú¬e°Á£:P»»¢#ôntáïØ”’¿_:"¿CQ³éÏê†R¾ÁqÓR6é$oçQ߉{þûîŸÕ*÷"’°;Ý×ìTÏb7®ä.ÐÛÊMÐðÔH”ñlÑRˆ–[-…hélç7-ž;ÞÇ;±Nçøg·|á&åÌõ>=yç‹bFh¶›»"'Ÿ Ôˆªû˜ÎÜ´¼ÆäÝ ˜ Ï^«O(ý ö55¹Z¤ÔF êÁÙ šÖ<áëŸ>¢^Ò•SAN­@äëêó t€ï`MÂø ~gñNasZàÏöº‡ÉA·%wfE&7!†®Œõí(xúêĤ½/š{ &÷*GRy)bˆËÃìÜÊ'tâ8‡.$`à}%öÿ$+pÝþÅŸ)8š§óv|¬ÁPa=ýw?Ø¡[«+ tŽWÑ^©¾Oï7)iw¢b4bµ¿Ïg’ÊåÀ,œ•‚ ëÛhx©ÓHTÖJɈ3J²d t3\x¼ð:lÓ6à¦õͣΠ-ªè1ØîW¡š½ ª‰EN”4¹&Ȧ†Gq§×Ž0AÿÂw¢ˆ¶•Œ°¯¥ú+×4VêÆÖÃFËóCJ_¶ˆHháµtÞ—s®'3Ì)›ä¼˜SìU6ÌH2+ë-ãó†ªlLJMWŠ²$—†hß,˜€ Ñ9ÒR6ìCþ0~¼G|è-&Xa‚æ 2xP´¤C† û zN$,R<ž3ŸŒ'Ɇñ‰^ÉÎ4R‡ tY+øù$ [t7ªœëòu<[W«oj6;F'Åj–"JÚÍ¥__ƒ ”USp¾ÉøÑК¹Oêzº¸+®§ËGËÕ ¸ôLgÀQé ®gx@Ñ1¢z±¹IÅžÜNà6üõ½KŒÒ´Q•Ìr¿¢ÚYÔ¯+k^Ì#éËý@Þ¤5:K¿5ÕIƒ÷ÏýiƯîo¤ƒ}>F´úÎþ¸×ÆõSeëÉü–=»ô©ÒoÏÖ>jìÙﱓfªôXÀK²O—ÞT‡§@ÛÒ-’$ÄÈíhMVø8¸£Vr_*­™ -;EÄ,ƒŠÙ@˜”i ê…¥¾ÊžÁÖ&Ïñ¡F®ŒZ;±F«ûr&À8d¬iˆãˆâ¦^`=YmµFé¤=Ñ£´×2ÐŒ*J"1yä2ʘœ¬/vÄs‡;ÎÊØÙ ¯ßþëÃÅŽ>“û_PKŽ=žfŒ`Š nbtheory.hµX[S#·~Æ¿¢O¶–2ÄÀšJòÀƧŠ–ââ€+©¼J3#ÛªÕHcIƒíþûéî™ñeìÅfωÀÖHÝ_ß>uÏј( ¥uÓÃ!ÀØ©¤aÈ´ˆeÊn€,´Š!±©À•h HçB5ïTß$²g÷v{wÝîãí§Þ/w÷>þÒx‡”‘kŸáAë<‘ð2A¤;~·°(ô N¤´Ú¸=½¹xèžž]<~º¸¼ºmž¹il·»×h¡Ê, r,øTh ™S©„ "-Ù¤  ‚¯þ’¦óëkˆ­ñÆÖ%íŸ`Ž÷´{—2tIPä4sãÕÀ°cì’¤½ báÚ…Va Aú Ì`é1}øÌ@éD@txÂ>1P½ŒîªðÏ2¬‘;éºå1FؼG+mz›§‘t—…lë`×™A –€GèĽ…5JKçÿ›¦eU‘µzYÏ• ‹hTxv³ÒÃN†ÜÁåT2Põ¤¼"ÇaRz›–ÄŒ;‡“Õæ&¡óüŒEPN NÚB®…`¬@šà¦³´ŸgÐ& zN }Îh¬Y1aÁ+ ã5“nïz5³æÙì7Á`72 ë| úš7{Cé%©3ao NŽkŸ„±mU?ÁéÑkÚŽÑ3>H‘lègéR¥c£yÚÔ°˜ÔV¢zV®“|Ç¿.x»” ΚÁ?°¼%N ƽˆ”9¸QZãê2y´@ÊC Q† KLBñð,ŸH#š“o×ÇZôò «Rƒ£tó0VaŽ«"á7'C*q½Vñ5«Æ5( ”¦Ö­ÃK(óf\¸]ž_ùW¹"µN¢Ï´b÷p‘W'öæ:ÑCª?-5Î$TsÝì6¢øl¦ÄW耤1V:Ð&ô±H]KŠYÁƒÔ2F‘çFqŸ4v ¹Ka/¬êG·¸›{%‚ç‚pÐ!Ê|iì<)rL¶ìʟƱ̘íê~Ñ8• s*I/…¯‰$ô®z…–gñÚO8SûÊáz-Q‘]Ÿ'ð7d?w&?wR1áëyò>µI§#G¹zzYÃŽ}ð9ô¾Ÿë< «¶äÌÜ­FB,ŠŒ†;‡¥29Q>lŒägÂYr1L57 Ô•5Æ»ºÓ&ÕZ-HM=beÈåÙyÝ4±†„;U.—‹''—qÒ-äç—J&‡ù^j$N,°éZÆx£pètæ‹wéd®®’p}vó6-âhEÏ~´*÷"µJ¤07¹*C `î ò˜£aâ°ÐVñ>êt>´ Í?èG‚ yí¤W R™µà ]ÀXyIŠâ¡Œ¿à™Åz˜Rf~ákz<¡T ~šF˜°)F/lB ZX7¬D ‹4(\0‹¥g¦æneV¥ðû£l¢Û{l˜Ù"n, ®^n8ê‚–ñL 䜴Ó)$£(dßl„7x£òÚÆ«´óMiVæÿ–¨Ó-ìøJ¶Õª ­t“ »j”k†Õ¨­´XÎr’=FhücLŒÛSªê…ktÑ©“ýÉûŒ¸L/·ž9 è˜üNÞ[6ÃΊخà :õ¾˜0ü•@“"nìJJ¯:_ Íì ½·ßá_Ú˜dä=¯µ Ñ÷o&TR SîÂé½JÏ7æUiÓvîIV³(}{ªQïO—k³îxÑÝ“ÿÃ÷MðOL¡ÿM¦î=&¢ we®ÝÂS/ó¤X3¤z«óâ"çÖjãDjõ“,ò[ÅšÔ\p¬gøIóüÇñŠ}kxle%^›~‹6h;àñŽ9ö>à0BÉθf3êÜÙ¼¥û.Q>F)’E ¿ú‚Û¹ŠØ·íäÎK1×vð‡u_>³”fý•‰®Z«-¥bp:ÜFfýmÕ[>tø_Õ¤dÙaE^ð´à3+*0«RÿÕqæÔ$³)iq¤YyˆÃË3Ž*˯ËÊI¶Ð‘V6P#ï¾O¤˜0x‡âÈ?¨êÛ·ƒ¢4F´ ´·ež“ü®“˜>‰¢èŸ@F¯®àßð#? gп'<:ÑY¯-ι‘Œ5MåÉ8ð!AŽ„¡pIñJ’êru A*Qoýnâ%°ó\n“ÍRïåÇå?äµos¢«»q³ÇF¥Ç~€ÝÝ™ûxñŸ0|am´•#Š]ä|­J`¶ùÿ‹lg‰‰v¡|ùPÄ3‚SÛùGë7Öl^,“åÝêé1TOh!ÖUE‰x—àå1(¦÷ù{õ‹ÛóFãÄXöÿPK‘=z’ª; network.cppí[ëS"Ëÿ Eë­²†­›­—ÝòÁh@ï#7)j€F& ™‡®Ùëÿžsúôsf]Ý›¤*~fºOŸÇï<út»·ÇBžÞGñíîh±`;ì>Ò”‡ÌÇl1óG|Ì‚¥SÎÙpŒØ8šûðdøÀ~â;õƒjõ» Ͳ1g›‹Ñtwºi=Pć÷~â“êwc> BÎNz¿\^]\^®zG'íA·}õÓEïϬQ­vÎÛýK|xÜþÔéz'ñÃ"./k¸ê¦³:Ÿ~èµûƒ«Îy»78úñ¨svt|Ö®Vg°ð˜ó åãcç>§Ófó$š/²”ŸdqÌÃô*öÃdă;.Fzµê—j%˜0oc>˜ûŸRž\ò¸ÏGQ8®U+•˜§Y²ë³‹î§ÁùÑχÕjen8eñU0ç¬Å>ñô„~…ã“÷Ãë…W;¬Vˆ©4Jý kÀ“I3ïbñ—Œg¼ÙL‚ñAú°à,h5Y°Ñš¢E²‹ÏÛÞ "°Ýbâí¯ÁßwÁ Гüõ}øðÓ ¼égÃ4öG©W"PXΫU)EQc(ÇUÔåŸ-m=YQ T:$,”é^¢ÆV T$X•¤ðï¶gþ"áca„äTÈæÕHÒ»((CF7J¹%!Ù 5¯e-^>²è"K¦ƒ¡?ºõ’tÜlÎý[>XøAìIuZYÎ( *áó¸BžŠE^ŒÚ,L‚›PDˆô«ñZ.ÌñhÒ;V¦töAóÝ$¢»“8 Áw'Aœ¤l›í7Õ¸.—÷9¸.¨p%ø@Úûiã=[IlkK=( É×j<Ñb ——ÃV!$þ ‚ïÅð|”&žù~´ ¬ó˜mÔ×:ƒ¯Àlj?›õS@*¼S_m•b³U0çx1ÐÌ)q_ØØ51éÔ¶pÞÒ6hüqu»·$UKl@B¸ái_mÖ&f9 ¢Òq6‘ ‚jSLðl™š ꪊ€jä»–µœ(%­Ÿ6ÚÑä’‡c´_º/[Z¨¡§Im’ðð¿!_‹‚àQ䌧'çŠ)z&8½$;[ºÞ±‡8´:më˜jƒ9küÉÙ£_5eB+ÛriM^Q¹°4½âKÊ«6™–J˜rç,²m^<ÚéôE0þnýýrk>ü½n^µ±"⯈'…õ;I4óSÅ‚3õcúY–R-~ÕsöÁ H¬Iu¥dD“ÜØ(Á7~¥ýd—Z¥ªšp~zÄ@>=²7¾H›s`ðÓ,V%ž5[cÃlâí7¾³ÿ&à4 ÿÅ=žd³ÔiI ŽDù.kqùœ&ýÔ?æ75õR-ü̓6œâ''¥¶ö1¨Ù€†“Ö(ÅmÙLÀÝ6æË‘~wÕÈå•Æ’Y¦¡R”ä9ÝÓG¢n1·›‚1â¸èù”'¾Ö‰W2\tc·MRá`q&‹; ²Œ£–¨&|2F#(·\ü×aÄp™<Ç ÖDžqi«›ÄÓn$âѳ֘úw¼t ^+aô2Ï-ë_©mˆKFîÅ©*ÚZÓqb/l8ɵ•uÙV¬¾µXÞðf«ò¤ÞJ¾¤\VQ>³Z\EqÕeöTerÑ*7QAqLê,oý¬ó/¦Ü"UíBj‘j“E¸]éHzù˜mj­sØu!¬LpÇn³WÙУ„k<·Fª•ÊrHK,"”‘_&׃Oä„j’ϰ⤘sGœ³Ó ›X¯¤:ÄÓÀ%Lj‚*Ù蔳›~cÞö:P´Gꇽj-Im³Í&S¦`›ðÛža8#˜“¿…›µÝÑ IcQ|‡%ÂD¬¯NÅ°š{(_æ jïU-Z°êU$¹£3„rá+³úF‹Šyö õ/€,§P¨4}1O¿ääh1×´éZ@‹UZ’¨å{ŸD‚+š%ŶPÚ¶–¾îhqǸ4´Ü¢º€'ÅjÍ‚2Ý7ŸD£'&e7jÁ±>ž=0?¡ŸÈ Ì¡à=¾¾óƒ™›—º¦4ä#?ƒdŸDs®-a) ês&K2"²dŽ /—¬ó¼ºVíyß[¢û§ø¡ Ñ_m` ‰ßo­þóñjMÄZ•³ä1„œüÞQ$Û;Pþ¦4¸2úUߤä<òãÑ4´CÉ]4诤c8۱؊CjU8åPMÆB³„8ß°²¤Hçmë©ö ,]œ<¨£é´wTDÒó, O”s ×kèŠ å–„v÷§¤®€¥~§ZÁ©}MÎ\¹ *Ñä”inÈÔÇ:É@%3­ìimª3+ /‹Ø1ù˜¦¼³œE¼ãýj ø;ÖŒcyÆžv*ÕrO¥¬ùú£pÄ…ÙhˆÉ^c)\WqÐâ>0BõŒæ€ ÊÒw%­a–2¼ÉÂÌÇ­å(ða+á‹Ä"²6§|´À?3ž€Ù Û|ÌŸ >£ +¹$¹`€5¬”F<–&4K%²½Ö@M”€ *ôöŠg>¯×Ü,ë‡{L„÷Mt§ÉÚŸá;?K©‡{ ª‹n]P1­)ç—è˸“¼ rŽg$ãBûçÞOÜÞ>äÑ\8å^ûBÞ´%•¡XØë_žwºÞþÛë7ØfºÞ>øÃÛº+WMÐInƒ…8rð5F$D+âjÙFŽÚW Ò »?óêíë<Åæ“ 3¢žh¡Èþ0p1Lx J=¦FÕdùf-¬ãöõi¸uÌpY^בû>— Q,¯â½¡»>{lùò\+' ¶·AçG?{î’eRÃ*Ý?ýq"I­dˆ¶á‡÷0eo¯´LÙ„U©«Ô,!V+E¾¨"‘ܯ™kË(æåjë0Ï|¸ÄÜÔôsÑa5#eÓ‚NäJŽÉL÷xÎ>0 ÿ¢ˆtqiO}?ž¼tºWo¿góZ5K¬u¸´‘jñýŠmT&š¨ VµP‹ÍPÅÍÿH+´ŒÝ§7Bí¨ˆÌPŸËVÚË9˜<ZÝ’¥˜»ÛIÚóEú@Úù Ñ:,ŒRÆq¥\åÏ7¿;yØ‚yBgTPwè6£hd¾ B +úÌ~ÆÛtZ§4¬ï,½ª¡ó ÖV˜ O)ªž‘[!MLé4ŽîYûóˆ/DQk6/®~h÷í^ï¢Wg›EþkPávXÔQPM°šDeLý1¼‚-Á‚™v-¦~åLŽé÷ÌJßTVƒåúàW8Ù4.u–Ö½J?•*ùðº“5ˆJR©Z*†õKñNNÛ)¼G™Ñ ®g,D“Ì· }œ'všrŽÊ×´Ï|_(~„ö­3ÁF]œý™ Ös˲Dõ+ÔZêP× Ã¥ît© &¤v—pn_qµ®%W·åL0²7:–nѤ?ûn€>`ÆîþXùÁîv\QÌžŠŠw´À{Ï^¡Îök–žõ>ßæ¹åÂÖv ª­Œó _¶»§Ø÷ôáÕ+¡ŒÛå'×åýÂœ›l8¾­eÝ/»&/ Ù^«.]<붢 B&ÛJèS¨¨HZríæ•ÎHœŠÃÍK¿h¬:æ(EŒs³£æÜ_ÐÝ-ˆs.Bò¯:ÉØC^ÒšX–}”uc×*9Á°šÇŽþ-öˆˆOYd=µøµ@qí-_D~žÒÔíƒkÚs…ã簱ݲ¤•aȵ«ÛQqk˜£ð¡ÇG~çÓÿé”\¸)^ÝXÀÿðì‹>èúÊís@•ñPŸ8“ë.¯XJ1cÅ`EÝûƒ*(¸É¢,1N&ίuµ"Bk™ Ü_†¥îöîHÈ0© GÂìmÕT¥[&ZlËkËÌp÷Û¯»%¿Æ ;[uóaˆ-©Õ¯O?’ßH?ò„ÏFW¿^.ç——«ÙxùËüêçÕûîx/#Ñ6Ô}##7È<Á¾wUäË›½Í÷øÒGQï'çï¯Æ‹Õrr1¾Z~8LO‡Óqu‘/-’W•/7‰–¡H¬(ûöÈ¿gâ¤Û^Œ—§£ñj8>ŸÌz£ä>Öêò²ßíºOS6•¡ÔÂòÈû$=½é>tãlH÷°ÛiŽõ‚O*ñXÈ?ïµH/E²`ˆÇŽÙ~¿Ûé²pµ5ØÛzÓw`)Ý[âÿ‡‡“ét²æ³³  ‘ø¬— RWÈ;{´ÉC¾xo¡y¢IB¯?`ÝnÇèw.ôÅ–}RM¡³$jSÖˆ¹SÒc‹6)fƒ»\6OÜUU©0δeI"¢Š9äYÐ&z Ü-Ú±T³šÑfi3SZTŒôTþGà”"`ow¿CëáRÏ׿ W§`w˜¥š­syy"!ªLoÛÏ]á'*´~+T‘’ÿÌ|™‚(—g©°p7ÂË1¾8•…Bo”‡³`ü î1å3îy2ºaœ}ùLÑl÷m·“E©¼‰h²~J;VDn}lÓ0·º4Ò 1a;nþÓ±‚Fà È÷ÆòŸäÈDÞq-;yüÚRB¢ïc5›jïðJíˆ~Æ\&G& # 'ì„Íãe"àGû Ī8EA”½yBŠdhËþ"lNͶë£_J·@ÒáÛÓÈ‚G×1Ž?‚˜·o¿ƒ8,T–¸„zÃ5$HÄâ,ŒM6pÈ”; 3|•ÀC WúâÄC Ƶ޳8RÂÝ|õa‰È9­åÞBÜíf‡Ì¤*;Í´Z@ØyƒGfôÄÉG¿„I[B{ÃÌ÷E"m¤»aR§"ðqn¤4ƒ,J¸ Þff\&¼=ªK—V$Ô Ð=vvPMªL‡­• Xy¦!3 E] ¬±VOfï&³ÉrLmÎ.¯qLþuÈ¥òÇ?|Œ~ 8Ì1¾P«ìJèÃã)4Û³ÕÅé¿ÿºȦšWìÎŽõ½ÝÇiuJIX§¼ ™Åðæ1· W{dY«Ô|ìêª*†ç3…Lœ1ìµØd¡ªðàû{j“ÂÖ†é ±l ½(w(kžØõ W]e”¿Ø?êÚÌì“é•ý/L駽Z¿Ù±ð´FªÙGì Ђ±P„îd¢30»Á™ªäá3Õဉ­amÍÄföÙñ>M¶€ÓV«lÅ0¢(y³³Òšð¸‹OàaÙSfBƒnÙ• –”|¡3˜™ùIJ/`ûæпªˆŸ;›´¼2ƒ“–Ê.‹óŒ¡ªÅ¸·®x§’+‘fn[ê'F ó¸æ¦FÖ ”c]šŽÍµ’‡H*C(Y Þ î¿ã2 #êŠä cDwÙ:ó<à÷TD&¶Åš&/²Ë j“iƒ±òí¤‚îÒ,ŒÏ‹š´Œn'‘¯Úœÿß–yèÈÇ­b°ì›š2BEM•–É–?· ·ðRDH$ë“0|®¡EDK]#I‹ ö©7$h«·àMÛec i§å&~  íÖI;ezîoÜèFhÚêV†Y\6 øü•»Í­|·zô,cC‰¾ö;rIȽ´eÀ•ˆÀùA–n°ï[þ†[UŠOYkIŒ¯&r°l>|†p=æÀ7IUµæ½C[{ôjÃóØ]¢ è¾Â/¯DÀ¼T‚)ã/ð¬%†ÓÏ"—xå'‡Êj€å®µc¢Í„ð”ªPØÝŠhôcâPÜ5pݽÃ(>ZiH J›`“x §ª=3)çÃáÛA¶$RFE¢P‰T]c¦z¢ÔÏèJ‚«2<K‚°@Þ"zQf!1„s‘ÑÔ3åÂHvg>&}ªc&ÊJÁ7Ü»Çír@%[p<„dÅ3 g)ì½Êà9ª8§pfu#A$<Æ*M%k(ŠåþqMùñ‚äÐhUŒ~ƒ&Œ—‡q ‘ƒÈêq.“Oû}8³ílë|´"ÊÂ5”0ÄÇÔ³õB·ƒT¹BÛŒˆ'¼=ÍÀ"üxqB; Õ›‡íº°ú²H)‡´Ï ŧX™S:ÁPáZ—øìBenëû'àw[<®‘eCÜ$ׇv´Œ¤·œ©¯óIò§qœ ?Þ è‹™ö*ò‚K¿ si„ Äç¼’e „/PŒŠJЋ_¤™×ÚËæÒ¨!røT(ž©1c·6ÈCn¾7âiÏÇ­q±u¥PkSÕ5/¹kÀÔ}ùÖàu×XåIÙaµk,“ìFåñç à€®Š‡¢j`‡â]y¼¨cƒ*õø€.4T½µyò÷Pû|RêÿX]úô©._nuêVçç-š<(¾Ãàåubä`¯(½Dù—Ÿ§Ž‡Ž  áh(M`wãù;(ˆÙ¡®2pDg0`„þÑc厓ßê,ùì²ÁÍ^ÉÉZ@ײŸrÍc+à3-¿xØ¢ÉM¨ÍW×V9':AA|(¢ëЯËñìl2;_-àoýÍÙx:ù0¾úÕ)ÂÎ+@ÑÈoÄÝzÕ”ÃKæäj§r*a€YY‚Ce 6²b•Ð¢t‹¥eµƒß …)¦ýDY˜çY¸imž+KÌ"Ãäæ]p{Ë×~p}s»°±:¨,ý¸`¡ )ÃÉ¡ùÈŸ-‚Ñd¶Ï®^ÏÝ ße" ‚Bí6ÔÿáB9ýL–®G³`9Æ9éõ|üé7–á("ÑÂÖbã–ÛVƒ0e¹@_É(8ƒ–,([/Š•à8®} }éA·qQŸÒ5ÉÅBztkµ—è¡»”FvüGîä;Ý΋íŠð+ˆtœrxÁÙÚ3%á‚@²¬” ê• ç•Åê8IÃÐÁ"{gs¼%oqRSžÃ‹ si„çÖ=qž.Àµ¢@é²#¨;"GVHº¹SÇcžnaE$ƃHM¦f‰CÅü —ðlrdÎaï}çæ—¶­ÑË{äT´p©’ÈEÔëáB¤ËLðþ¯8ßÜrÌò8å[¬Úl™2ºsòQ?UêŽá§¤n£Ü ¬9´+yŠÌ‰fC‚7šæheVvbÍ$ÏšZ[œ ÑBîÙø³ é؆4þ3Q¨±<0âï‚}9°0d‹,¹t|¬vëŠÝ®êˆ^oöîÖ¼3NöEÖ izàëWèt Õjé_]õß—¡ uœ„E‚1ºûëœóÝZ‘5eçã¶òý9[²ÍÉÑSÃðÞ)©oªeÓêÜfW*Ñï ¨²¯»ëS§k|‡ÙîèûÚƒr-›æDl«œ_¢‹äËëí»DeRmN_‚Êcò¾¯J” ê_½Rý©úÖÊÐî#ŒX¤NºuM³GZuÆ<üG¼T=pm”lJLnH^$MÕ áÚÊõ=a*Q…мþ ™Z¥i"ëp‡ª&(ÆINžXƒŽÞÝŠiˆêôðÐ&tö¶êD.êÊC£[½3r$TÚ£‘ \«Ô•WÃ_ Ÿx\ð„-tÿâÜ|·ãŸfúþbýË#jm àK˜¦9¦,:ت&zZ15VÓÈóƒÜÉXàC %OcùžÉc%·/d*zÁR±$8YŠ´¯ª[wj55þ£ž•ƒò–pïžè5t2JFÊ¥ŽýwbU$]] _‹CùšÙkžÊnÓWÌžwsyo4ÏæSù±MXDcô PK‘=o,ÃÉoaep.hTßO£@~–¿bŽ&†jµ“{ ¶ImÑ6W*‘Þ%w/d Ó²vÉî"×3þï·”¶àQ_H˜_ßÌì÷M‹®X„+=üô÷žÜ/˜-m¤ ÿ³-ÊÂ$Ì,_>âæ<66“Ò`̇®ã{ÑÜ8wÓ¹5›LqÏkF·û#Lˆ”uõñl[„"lе‚÷-pXXæRÎ\”’¬QxDÙÚEóÈx6ªXÛ8Zrž€GIQ¡ðó,ãBad…œIaLœ0ílCey¨rÁ@*¦™Uº:0×_ÛÞƒªI«Ý†~.z/Æ‘¤0Pà’ßßYF¢£²µŠ­£iÛõŒ£'N#Ý^d=ñtž§KwÈPÅ ¶îì:[n‰ Ev%)ËrUUììÜÊ!¢ º¯Sóƒ$9z„ ÇÙaœº­1V£> ÌÛ‰¬fïâ4:ý4¤‘ ®0ÔO£í‰ •“r&éša¤'U0¦k”Ê×€Öþ±ú½:xBd¼„É))É'0Ç¢´¿áù¸Ûµžõ6gaåÞݾJzéU,½& \õÍX©Ìîv‹¢8/F„ž‡<íÊ°³” ÁE7Ô´WiÒ 1Ý*åL×¼4Žëœ•¿×]2è€nrM¶@  ú¤Ç^ žÂâ6p|Caš%DïõºRɤSEƒ.Ú÷.¯¾^eùÁND%@-™ƒŠ:{K­ _iæñJ4Ré„Z‘mk!èåÔªzSð·þa²æB·–Ï«—UKçf™ÛÁÍ6œ–ÚöÛ™§`Z¦þNÞ h›¥ÊÔ&Ãò4m¨w ‹àƒsð¹>"Õ~ ÝÌxzçø úË)±?E°}6Ã&eÖgIÖLÔvZR®y ƒ…ãz³á F³¡ïW;ð'ÃA¯y[ùXdd]PKÈ=냉ioids.h˜K“›8ÇÏáSP™Ë¸âMŒ~Ôœfš°ÑÝÕþP’Ñ=ò>Þ'œÊñA·®ªc„ ¯`¼®½-_bžù ߌþT™4ê®S–;¶úC¥®`S=ÀæMÐ}{xê6•^ýßÊ$Dusš.s1ÍÓ‡Àjh (Ib"ùIÈV"U‹J§ú[÷ܪ²M\±T9MÉ1r¦“rž±u3‰c .³Ò®†+Âl¶2?[P–&I¼ ªE8Ç ^[ÄyOçrMùYƒ¯ö‚ÁüBç12Îßi ž'à4FÐsò¼Úpv¾“c«TËNjÙEµ¨Õ×5y ‚Ø'¶HxvaÛží|˵%œ,°×G™„efp^R;Ê…T:aÃ\ÂìOoÓV9wÁM‹# Ïýn06«1d€Í ,¯õáآ¾›`Τ:¦Œ8T†‰æFa¢EÍ™Œ žÔÃbÄÕç·Q~Yáæã‚\3WœÑ¸`Wqj…pžâ<äTœZ,¬«êÑßlxÝ«¡“Λ•F…™e¢0„F½¹EoŽYo^™”“ãÕÉqÓ"»¹ÙX:³Š3[få$`ÇŒÃ5g’*§aa§WsFý•ã‰ ksVqfÅYôçN̪Ï*ά?µ½Joæ˜õ·¨¸¼?Šø–P&ýìñ†TÊæû¢±(Ú091É/?$Öò#ÂÚñA¡­PûËI4ïñ—‰^´ç–ÂöÉKû"£ìj3 ášÐõ„³Ú6<~µk{ÇK¹©(Þ”¤–6‚壮ÌðÎ7µ|è‘"]nÃ)Ö¥ÉnÛ#u^{¥¨v^ éÚþhÖµýá"·á·?µ*^¸¬¼¯‹tm¼.Öµ¯ ¯Ûð«iûÊ©bó<õâ}w5U)Á_èi€Jîƒ\p«o|¹\­[o‹èÎúPKÚ{TB«fMÚðÜ osrng.cppÅWmOÛHþìüŠ!HÈi„Þ‹N¹R)/†æ유|²Œ½IVuvsÞ5!×Âo¿ÙµØ„„–;é{ aù 2Sóä6¢„|æ£äv ׄBק•Êñ1Œ¦>û"@rèÎü8„?P@`Ìcm,’É„I9Ó¢V"ù„.â³çÑQ¥²OY%!ê<˜M«J2f!CǽŒœÁÀë] w4,ê¦ð3m¥ì =×>÷ZW­^¿Õî[Eå'ª+¿×=û§w“J(#%!4î?7•}ÂB:^Gz¿ ˜ÙBM?”…A¼œK-M-6 \Ú½Ï%$¹1‰cÆËþÆ“QY”0*dX `·.¬á Õ±¼¶u޳͎BÀƒšŽ iR¡i;v»ït>õ°v¥úÕàÛ·•Ö•JVt+Ž›Íõµp&$  fSȘ² ð9‰}E…ZÅh‚u¹º3ÑGËõ,×uÜ:T•6iBÞÂʯ«…»±O#$è‚Ê)`qXJûÅÞFµq¯4{LŽøPÃ2ωìûBZÊY«Ãɯ5,`$ªõtjym £VùZyxÚË­¥|™x• Ä\ð±ÌÚó;¬ê–¦B`б¹§å­à¯„ƤÙ$÷Ò<˜yÓ\³ ý;p+϶¼³Ë~¿žBñ®,·wvÓqì‘õyTÃÖrózY}&@µö;¦¿ôãNÔZæ’ˆøb…¸ 8u¿b2g·¾`#9šå{ísccltæC8U4bfõ8$wÇI¬·Pµîxn×±û7+ fªz ‡'ÏDù€’ ´ÌÀ>lÂ}|Þ â‚h(%çwœ†ð4Â9aj8H[ ÍÛ¥$ð†'ržÈ:ú7ñ¤þ—Þ½TáÚq?µ\çÒîzC¯}yîýùî—߸ò #î--äÞêú†ˆ1"’³÷[ô?˜µ#—ŒM•¥‘—jBÊkÌ,=+̵×#Úüú#>Œˆš\³‹»5•gÒäwñyå8ížøÅ ˜i© $ª!²êEØðSˆ‰êŽäÒê¢TU˜•Ú{d/Þ*kÈ"M´– zGÀj·zvºÃÄòÎ_Þ¢´g\ð,H)WÚµ^@°wš=>8€µD»ÑšÏd«bnUéb%e AÒJ’æoOUºJª’ƒÃüö¡ÀÂ|21Á7ÿægµwìÍòœ”Ïz}Ks¹Ïsp4Ûîç­NíÝ–®‘•&cÂÙ®MÓW¬4í‶ŸŒiíŽòºíT}{º`K7@–VP¾{Ú¯\<ÏL²sÁgø¦¸’Ì*Š|Þs U#ðÕ=Æ©­ðïðeÀ¿ÔÌ3àøÒ  'M&1ÃËÙŒ„FËçÝÓüówôöÙù.óæ¸+dYwP9"dnžÔôàÿ§¯Y„IåÜI×pÆ ü"€üh«Ã÷œdÛ_ºtB¹³õ»Û×vŽa(øå j£> ÊdB™ÜûÃK+-=ÜvÀÚ‘Q>ø_.Ÿâç>ÅšM—”=íBÂ0ýIˆÕG…a>ÒC´—YLýÄ\=F\Ûz¼r¬”ëP4é±€Çs®L,&c>_šJÅOË™ýÿPKÕj = ²‹@ŸBa]? Ô²£‡>£!Yt–¥1”'Ž+0ß™£±Ù[uoîÑ a,’þ5+]4 N›†té5 !IÒ£“Ã<¯m^YÎÔXnߺÙÆ€¯Á¦Ó–‚l}ñq"£È¼4E!ãh’`î BOu*pŒfŒÅÈÎâÌѦrñŽ®ž©ÈŽÇå-ÎQ%ÙMDüMý›®L=]Û8@S*P*‚^/£GLa`´uª?­è³'v<¼Á“;<† ÉÞìgÇ5‡=X¯ˆÏYÊBQÂÙŠ˜×QÞáb,í¯{ RµÊ‹“–®‰u‚%ÆŒ¦d+Èu /NPùä%áS­ÛEÒ]æp§³É»6òVŒ¨ùì–€(·P çúŽR¼'|ĀʭØàLêZÓªŠ¦Åh!¥Ë7ŽEÆ)ŠÝeéqú]O8Yy÷vÕÝ”t ÷±ÑâSaDä¦ U¬¼„<;îÀׇ­U^“˜ú^’f„GŠYs:zœªÏP}E9B¥v¼êf<ÿ¾O`›Ñ›ˆùŸ¡¤f@EU*‚ªçªœë²7Tjï±å’p_.7k@ý„e"ÉD¥ä+vEþü4&°/pÐûa¹hÅ z?™½5g“k{è^9nÿúÂýãøù‡ºvWu‚ 4EmQ$Pp°U!äì îj±mqrúûíJŽ”òP9HhßîS¦ÿ¯déokÒÿu‚Ô˜©SÒ@‡¯,P•rÜ•éú")ŒqTVKÝ‹A²jf‚Å0ïüh ]dP ÌM!šÞ}òÍ—$-u ^)""Åt|*‡¦G+G7JÕèNT@8û¢ƒžt÷i!“«¤*§L·-J¡¦„¥¸Ú# ùKÆÀ$‘IË-ˆÎP!Íê ±Ä(ñ¸ce ›ƒÁÅ8À…ñÉ(Áà°e¡ôƒÈ°î­<y7pÌjøKXˆØ‹¿©zBÊ¿½™Rm‰Ô`ùÙ1ÌgíÛ K›±Q®tiÁÈSÕUºüãøª®$q  9ôˆi;#ôáUçè%2“DVÜ4PI!D¥êÄi訃°IÞ€gJͼ_ÝÁhziÍÎ …7¤|xuôRf¼¿ÍÚåªÍÄ€%ëœãÿ½àÅÞîR#7{…7˜Ïp®3d3J{ m©þ³Z«ãQõ¶D^W¼È¢‚àf_ÇU·G˜.€ž×èPÎ)8àa7@^߸NeÓ6³ÖÃÆë*|VÁšä3M‹ 1~Óq9f´|Ž¨ÏxÂäÈ*°îõ’§Š„=þõ,„Ö‡šBÖBe'TNÅjº#*X? C •0‡ó#Râüúgì7£GÂã ,Ê 7îŽþÒ£Gî–ñ`)vá.ýôü'’VÁ«HðÚÅ'ƲƒÜDð³½-uŽòŒªïïïÙœ²>k8õzÿAa@‹k9ʇà ø•M%?Ë;%…nmàíõ,êˇä*GP¥n©éÕFµròýR¶N×V£Ü¤ƒýþº¸äæŽòoÎèO ý¶µ×¡õƼÏÝ·ÖDZe_Ì/eoi–€éäÑîº4Žõ»#a’M“©˜ç0#ä‚͹4Ÿ¿@K/]J/M~è\'D7öj¸lõ]µ<çÜãàÞó†ÀÈ*"]gסFî5$ LN»™(]¬ÁÞa¦É¥Þ*FÁ÷»œxþ÷bé©“N¶@ },`‹+8Jd©­¼(ƒq»„·id@—ùq¢ÊLátæÃ+x“5êgmëŽÜmtŸÛ®´-ôZh]+Š-OüƒÇJdrâ«j¯_°Ü¹u5›sËŒMÇÙSæ¦åœw!¯xdÏùýIz}:‡] 7£©ƒbÀ`epPò["ÏJñ8Ý{ÊßE+<–-ïòî`F¦=°àÍc~éÊîÑÉ¡{¬—¯‘ûa¢!½,µLöÅiñv±ûhíFy׃ꞽù?…eko$êïßPKÚ{TBOÜÓ3‡23 panama.cppÍks›Hò3úsN% ¶ „¶×©²%ÑÛ*KÙl.먌-cåq¿ýºgɲ³uw)—fú==Ý=3dw—¦gÎÌgV§äkèÄ1õˆéÙ$pM‹ÚÄñH<¥$˜O\Ç"¶?3¡g² ï¨C^˜N­¶»Kæ%[–Kv{² /N.ÞFçƒÁøUï¬wq4êÿlëãÓ£áiŽß‰}rM=š1%lÐòmZ«=r<ËÛ@3°¦Ï¦[ØsåÙôŠ¬¦[Àâ,1ë›9‘U챂9£}vtÚŽNzããÞ«þ™|.‚Ø ”Z-¦3°÷»åšQDŽŸ×n|Ç&Æà÷ãçûû4¢±¬Ô¾×¤a{6ŽbÀ©“F$ígCçí{Ç‹˜F²¢ >™.ÇççÆx8öšcPd|ôÇQß8:6z@‘£P;—ä¼6#%#êÙÎUíg-iI0 ›éª"Fr\émLCll‘ïyuAÄž6Ì]WŽ@q ³5÷â:ùê‡vS#Û‰Úâõ[¼(N; ÷O×­P(¥(IZVFZ–K\œŸ—0¡5)¤·ã`MÇ!½&¡íÔ$Óu} -j}–µmµ­Ô¤È¼¡ãÛÙLÕºm˜´i©·S'*v?K¡ïúרDDk‚мž™ä«zŽw-ÛNdN\ºOôNSUpJ®BskÇw<°)Iœ¿ÑIð™ù0q,1XMŽç:%àdt6q|!0ã§8;ïŸý³Þß7à´%+Ÿ½GïÞ˜3ƒYöN÷`¾hFÆã„ãÒñ¸&É5IÚz†º¹ãháÅæ-ñü ¤WÎíÁŒ ǃ·Ã×ãþËn[–&·Jb7Ðdiæß0‹Þ«±ZçÒ+cZ0UªÆšuò­ª_¯“…"Ia…l°@–œóÏn»&=<œ $îú~ÐólI’>Ð(¸L<šØòjâÊ*2è‰eVt….‰®ÑÔÍÛ®ÅlðOYúô­.I­:¹ª2JÛ®“¨;ú6DfÚvžž@€(U¤­³Éäs²¦¨**ËUHU–p)JàöJ¡£WÛ_L VDÑ?OOß_¼F9°„/•¼º ^­†×VÁkÕðÍUðÍ%xI¢æmظÞH‡EÛ#(²8à›×æ B K¼Î¦ù±‚œ§S ¡*õœ¡Í|!±í²*0ˆÈÉEY“õa¦¢éüÊÆV]DÉ:;h‚[B5ÁµËfëähæyñþv™¢Säµ±]PÿYP—:b-r»,T+'T˜›®sí…Ù0Õ×(XDI¬&P ¹£ÔÊNº¼3>,ϳh+»hB?”òÄR(1~‹Ìsdk"À°ìчzáVv‚ö;=!Ëð²­6w 9‚½;9øÀ!é¯Õšt1)rI²„¸h´¶:ß^îØQ•] 75Eù+¿²•“;Cɘ´Ê¶~Y­màè2bé¢NÌ:™@¾¥™)X³€~™d™© !“þ¬Ë;Uß°lfòAáÙî×9õî|’Ñš{õyúÅþ²$@Y÷#Š†˜Xtä~Í]sGìAÝ*i°Ñþ0¬@¯ªg@ÜÛSP …¬¡¥¶2 4^pPÈÊ]À¥ÌR D=ó˜|¦‹(©9cpØXtOæWWP,MiHq§0u jÌ0vL—@­í‡ , \7"¥°m †û•Ø,-v½¸|¸ÝÄÀÍd5J(”JZD#íâLp8=·VË]ª² ¦š7mƒi’ÑI·Š™–‡SU°XlÇM—Ú¬"4ÓeÐ,”biPÈzµ°z1Iýr)ƒäEÐWÈr‘–c¾)ZaÕ¼XZzVÂè—˃íÜàN.ç«…—|ŠP³¡l3OÊ2ÃlX[Á2'/›Â²¤y»U hȪR=·K†m–gµªDi^çy(ê’ËÌK26KFldFl.YicQæ¿&Š!7’ ’F—šù WPo“ÀÏ<Å+ÔÁMu»™NRžB§HAnjO5]Ù^A©“RÚ¼ºÕÛúŽjÝnɵš9×*TN o5—KUÚŠ)¯b¹1ÆÉÜú¹{yo¾MhVÃ7‘]«0—º±óWQ[ çÙêÞD¥ÆÃ,‘΀žøuu^ÛxCòÀ Ï}7TwmØþ¾ÍM·zsó«Û{ï‘*öj ¡U"T¨K%=G¨°¾;U;£êíS{=—©µˆË¡ÿâFl/KÝå-UgÕ–ªSÜRq”/Ëæ¯Ú†i8ù¨Úí©8ùI(âèiU›¨µ·¼ÝË6`ª²zßÔX»_[‰Ö\¿Í«JÚrøÒª£šZ]³4’=H%íN5ív5íV5mç"çzfÞ·1ë®Nº÷Hßjû™[ß4sWÉÖ¦™£{ƒ‚½µ®`oUO¢¾rª½úKÚ«ÿ%íÕjí™öà”xÂYQ¶Óú¬YÈŒfy‹Ö%q"\ݼ¡üx»ú¼ƒVå²5)¿23­Iù•‰iMÊ/%¸Õð¾±â,×sV¥QÀ#jrHìƒAù©q–æ ¹¥ÔîssÁ."ι{¼·0ãXÜZäî,¤ýÕGÞÒ>Ùz±Ed~UQ'[CxáwðbÃË7lXÐX( üã°»UÇÇ>BµÁÞ`>ñÉO1°eY¬ %ªhh¢Ñ ]4Z¢ÑÎVvðŽü­¼¼v^Þ¡÷EAÞ*Ñ2ëgWÜÏ–ì‡0 Ö6¦—µb=– ¨lœ€„èè™56ÿìî.¤qù¾ôÎ^ ’›“Ÿwßö¬»j¼óâtƒ«à~Ìn²—®ãŠ—n ÙdT¶ùÁ—æ}ŽÇºÞˆƒó :¾G|ÑbÍ ± Le“C’»&>HG·9es‡H6lA?GHI'*Ë\EFLȊ®øC x°©Æo)rå‡ìGùÅ…µ'Y옪M~°“-<µjA[#mvX¦C×öðÜìi²ÄRìWe¿ûm²²&•ÎÄsj”éCîš<& ?k'"ŽwCÈÿ D™ù6 §,¤`UR@&û¤A„|\b¦CfÙ©“O ™uᑱJÞtñ–yÊh¨2‹¸N6¶¯’§`ä(Ld,˜ÖÄ莪m6 kkê¸4‰·OŸBH…Å*A2‘ùjÇû=¥28:;:=Ÿ¿ ÞŽä[v‘F 7½÷ÃÑEïè4crÅ+Œ‚ØP¡˜rcgOQî¬"²ú@d ‘µ"7¹ù@d‘õ"·¹õ@ä6"·ˆÜAäC®aªÅœ“,×wðA׎­&=|×¼– ®&Ùî*ˆø)Ãÿ"ñ!‘E§"cß ÏrÇÛù(äI²ËaT–èëðÓ-Xáÿ¤$AíB‰\A¹±†òz™´Ö]Bi­’TÉR ø*3C\n@|„‡Ê4ùCç´ù£“r¯±8%ƒS28%ƒS28%ƒS28%ƒS2RJðQÑyKM[ZÚj¦-=mµÒV;mqšÐè¦]{ጉšqQ36jÆGÍAºdfAFQ«,Ê"/²a U44ÑhŠ†.-Ñh‹×A ÐmºUÆfÁ9ab&†`b&†`b&†`R0>sNMKˆi --!¥%”´„–ÐÑ8™ŸËßéq7ÄoÝjPÂŽÆ´(yGÍÏä{U™”‹¼|mFSVLbãtîÆNàÒc×·>Gr±’LŠÅÛ¥Þu6ÎOÞ ûÿêÕ #€ @m=½„ÔCKL‘õåo*õ(œ{€Ù/H·I)9…ÑTP|äÄMCÿkÿªïݘ®c§èø½$«£™—qÐif3cÈ%m· tI©&¡0°ãvLïÄCj¹<Îl Å™™£+,Qâ Év0ÈŠ”cH-†ÿ;·|tŸc¡w°Œùôì­aÔqðV”0òc'c[*+XÈÜÄm’“ä‚2Ï‘A‰•ÜŽçĬÎöèmŒ_ÙÂTÜ9'N0¥áÀwkÁ&…w i ‹Ä‰ÎÀ/ÿ0Ý9˜N‘'š³¨¸ùLUî…Ÿ(‚Œ¼çð­–ª63$öÃ*,XbáYà:B*ß³*{iët³±¬©­ñ»ÝªYdZà7ç†`Vïù?(þPKÛ{TBž0‰Ûpanama.h½Wmsâ6þŒ…ŽÌtHÊ…k®s“!@Ç€/aŽ’»¶Óñ(¶ÀšØ’G–Ò\þ{W’m &÷ò¥|¼Ò®vŸÝ}´>¡+æ“Ìÿ˜-§³™;³'ö­íÞX' ¦ŒY±N(óÂÔ'¨žHáÑ8çA½$¥’ˆ'’Z ä,föÀqûÎõhÒˆm,ùlvjY­V =à„ /ÄIÒD>GŒK”‚ħ‚x2ÜZ’Dqˆ%A½ õ{–ùSø5™º÷K»?vÐ 3aëÉŠÓ‡zm«ö™SÍIBdãô*{w`°‘Љ+‘ÇS&›ðÉ6\øo/ÐYÜÜÇMô°…“Ïx*ãTf"³Ñ,P¶“ [@ƒàh+û”3ÄóÝóÑÒq?8,–sǾ_¬Xp !ܔۘ¨,dÇ/$^“¿.ÿ‹(ÓÉbiO– ø¾v¨‹Þ^„µ÷ôâ/ ;¤k‰×¹÷Ø1¶šèâ ú]ž½½è¡ÈM$D~e=ÃùIbìô‘àGô¤³ÑÁ(dÕ­RÆíVk³Ùœoõ1=÷xÔJ<Ì^GT.Z‘È(<1 ×{æÝ@Þ;-Ü«&\S)Câ0Ÿb–çÑè)5ÔF(™¸Óï5‘É&²Ã5TÑ w²,úú¼<Ö  ý™ô!7SáÑŒ@w˜C½r}TáŽÝåbô§“A\Û©7NÑSáW»×Õ³UKY¢ÑG”I4¤k’H•P0åò$ˆLC;ëJK—ãR¤ÌS‘¼§ ‡ SXª{š(«Põ£ªW%p0½ t¦Jd4Hªò2;®ßn/¹ÃÒdÝ.ê®]g2Ùw::sôª›x^÷:ÀŸ?:ø·W¢¦u•/ƒ ·(œL‚\­­ë±±ß`>– É€&¯{yGþ äWÏ5¨Å8MÚ` ÌÞ¦¡¤qH´½äÀ nŲ°µ hfÝEú骄Žê[ðšáYqÑ+tk º"õt§ ek=ADDö*/h SË•_º7:oùÓˆ­8T‘çõ~“ÙR²÷™%upûx/(| ðdĨ´¬^YnxÈ3éÜ’$°S–5å ¸Ošè Š´þXCÒQmò¦‰F“¥{k‚v@Ð!ÆÕ^…9ï˜ïQ±Š2÷=’míÕ½=gHUŠ÷8LÉ S‘ Ÿb,p”@?=YµZä‚ú¹(톶´ËX JJba2S¸æôSÞjŒ‚/]´ÂaBÊÚw±¯ ¬Â݇cŒÓj¼Ê¬¨VƒØMÿ_íŽÎLffvîgml_sCq¬_PÅ}`9·Y2ö2ß`*ÐËÛ#;¬¼§Buº¿®_ÚRQŸÆ’F8ü+Õ/ƒè»0‚fø¦ÁƒÝGY¯HÁ^éeù×(7‘)èD{v€>°I¾a‚Ì=p¢l'<ª»ªDiÄ_¹ª³û¨ã¯Ú=²y:/ß™¨V˜Q\úl•ž¿‡TUg¼Ÿ±Ê^ÿ—ùçLê+~l4T6€I”MºE|z<Úg¿£ŒÚnßMF¿ß9îè^O ðÿ~ߪT«°Ý—‡Þr 3nK÷†ïS5þ˜ÕgxEÌ®bBº¶W´¢>™Þ!xjæ*¶Tç1U ‡b”÷.‰ãô¿?>ëÄWnlmÑ Ñ¤ª_¯÷çô##zq •™Ê@Mý§y fÁ'sÌ|Ùž7jev3,ú¼2Ü?[¸#gªó‹¨Œ§0m¬ÔºçÎçjÄ'´ôþÕŸNÇî§ËwèË—Cá»_ïšÈ Ó9M¿*¿TÞ .{ezQ5wlð÷ô›ZH­É9ëÖ†>Ò–y ,æý…5ƒã;ÿ#]»+ãc嘯-¶°• žYr/U±ëŒªŽÍߣöék²³ß7<„7„Nµ¡ôyû½´Ì"êèa鈃0E9LÃŽ\íüØ ÑìÖè»×b`+OÚPK =AÈØCpch.cpp#include "pch.h" PKŽ=i»y:žpch.heŽË‚0E×ô+ Ý»2î LÄD¤)˜èªÑ2Õ‰¥ÿ/W“œ{ÏÍp2®B³‰åM”¹JÄ©JŸ9\cÆÉxíœAF%¨ë~§²¨È 89mÇ 7¡nÇí+œ,´=úIã =—0øn^ PBBœgâx‚D¥% üh=Õ­ÅYó(ê‡mô{Íkêõ_·¾wC;t çè*2óÞýPK=i-qypÜ pkcspad.cppµWmoÛ6þlýŠ[ƒr-;–Ût®Hì¬ ¶¤‚.Š" %*&"QšDå¥mþûîôf)v^×ú-É»çž;ÞQ[[^ØqÈœŽ†Ð†«H(Å%0é@è1›; $¨‡0™{Â'ðJæ7pÊL˜Ð´ !m/q8¼ íEgñŠ$®t¸ ãé?ÖÉGË:³þϬ½ÉÙز[[0Käx WAtÁ¢ ‘ÎìÀ…Ç#|H<l–ÄÍŠ\ƒ `Î!·ã€º6×6Є|­•ªÜCDV wXóHu»šv¼wt€ûÆgûõqtªÀ²šš†Xý "Ëàxq¤)î#1Šïì"V+¤Bq ÓgqÎc5áv1%¹sÊÙ…9Mz»ƒSÊ?|ë^¿éÝë éSצá }š`8ôéõm¿xr£Y‡†^9lÓ*x‹ƒÙ½®‚Ld,ÎeMõ°—çj0cñ•®þ,ÿšCíe4mÿ$š¶MÛϧiûÑ4=´Ž&æ»î,™%KïK–ÈñÞœr¼û¦¤Å\CËÛÒR÷4VÖ»ó\RNP=@Èû’IIÉzûå«Y8Ÿ>Mö(•ÒßwÄú/$©û4‚V]#rhËYnà@ÚT«pÆbŽ#äùÌ^pŸcª±ëOkË¿R[z¾­*kfÀµoZ#â*‰$Ìþ¡%T”ÌUÄl¥W7lõ 0»ŸÅ­¦]Ây¾êSì$œøs}à’£ú ‚ÍHžÕà¾2L”9Ìô ù,•ð}/°/Ê¥$]•i:f>ÿ›y ·˜ˆbØ Y„Å£¸âjVøA/LÀÎV骪o6‡Ô´Òn/Òþ„Í}´/0ÚØ mæaëÒ4Z…v.I¿>Ì…‚<ÖÔÁÈ•ìUkjFàWèÃ/#è6µ¢l”sŸ»”ÏÝaUÖjáë­Ö¨)ØAóãîÎÞqÍIê&äÐË¢¿p%š dû+ˆÒX¥8c­ábœôeR£*sˆ;5êÛmšlµš5è‚褯‰ïäñç§Aä¼éé¦XªÝfô=Ú3€~ˆ=æ[Ì$­ásßo–\¶Ö*0 O°B%16ÊØ)ï±C•¦ˆ^MÚÇÒ2[$*5ýŒ$‡P/™‡‡l.óbŽ!Ïøìúcª“Âþhölb.QéµLK—À÷ïì§',‚›ò÷¬j–v´‡lõê¶R-ñ…1­‘äôšEë²\q¼I⥖f*ÙSÔ›‘‰¯t×ÔÅN ææ&T2ºÕúÒ„o”ƒ2ñ<˜Î :z[Ô]ŒFµÝ²²óx4ê¦!É-•@Ö6¶A k ,WîÖ2à.Àü•Nc^Úë™®§²£Sh6–ö[ÂXÃ¥÷(©.¹M/˯_ø[óÉpxd}œžÌ*Ƽ4·ÏfXŽ¨Kñ#ÇìœãiM!qµœÁ`Œ‰*f§<Œx̥¦vÉlFZ£z²#ô ›{…ªòˆ¯Ne§Îаxq‚U4ÆÚé§6(3€f"\_9‹Ú+ :ï~TV©zPQï µÒÒó|¼g!ìbÝrº~V¯ãëÄè²tŒv'»§Ì‡ÞlVS¹–¾£û h5ª©ôÊúăõgswÛ¦‰Kkw<§$7¬P3,"æmd…h¹\•í]·èNYXš]nÎÒ‹JH®¦ kC¸Ü1+j mÊ·· Oýn@ :-1Ç»`îIÖ·±^”JÚŹ]WNÑ(ztfǸ‹ÍÅF¨ŒõˆIaÊíïB2OÏýË Î—Žp«ðÇ“RüPK=×MþÍ4F pkcspad.hVmoâFþŒÅ„H¤bR¢SH#q`Q!gá´UÕVh±¼Š½¶v×P.Ê¿Y¿€rÍ=¯ÏÌì>ãS¶ä]Âpö§ýøÕ¶çö¯CÇŒæcãåŒÓC*ã”q7H< uWlc°EÛ¯—¤q²x¢[-Cá²’àÞ™&“’­ôIêL¹Ç–†ñ0˜Z˜fhÍ?[_îC ²í¦at:'pKÀtùKÝW*¾ét6›M{C™GXÛÂŽt ¿™‘è¸W…Á©Kûya¶{õ;kj]d¯ksÞ»í;à ˆ” …s‹§±ˆÛÄó_9®OC 7€5ÌE«’Í”JIV‘¶RåGžñld¶7FM*¢ÐɸTàúDÀ98©l¬"Á”>6šð,¨J‡z_½ÿb`öÎLÉ¿¿ñqQoBùJù\Q–5³l}£¶Ž˜XFcF¸…I¸ â åT 8|ÕÊ¡-¶ŠÂ¹ ›ä!•Elåê,Ë΢œ´ˆ£‹ù µ Îb"P¢¨{X#šukFe(H+j”aÍSBúÃ)_ú†¡h}o³iï 4ö[Q©42ì öͦé½Ý_ÿô_$\²§6PA‚Ît:‡SYXP´Ç8\1ÄèÁO(ŸÂ2 ‚hƒÝÒþ)`*H1uÙ’¥yÒ¸§&¬»íKÀQƒm^]_‘üX;ãÙÏŸg÷¶5™×—…àÁˆþÞ²Ûý¹üÖ».½]}*ëzf·opì´Œ‰KáJžLxÎõÓQ·¿{ìaý=^pˆ–0©Þ¤…Ý;¾Ì­©=÷Ú>Êå‹-'T%øTý¼cäÃ(xbO»‹ïäY[…fÿ%U¨jjS½Ž~½óÖ¯†ùâ:®Îf¶ÿ:µFFÁÄßPKŒ=WJºÔ {7 polynomi.cppí[[S;~¶…`«ì|ó°ørŠ’CÕ†P­ÝÚNj˜‘±ÌXãÌh0Þþû¶nsÕØc [[u60H-©õõEjuçð-Mƒé»Ë%ê¡UHÃ9ÔCKßq±‡El†Ñ2¾ó‰‹¼`á@ËÝýtæfóð]9!CÁTº‡Ñ4“©áGÇF93¡ ‡Ð-Zøø $÷„:¾¿F®³€áa°@¿ÂÀ„R¼nG…å#ìFKŸ°¾Ûo6ÿB¨ëÇ°èþÒõgûÙ½»\+Œ¾ó÷·¦Í£(b!v“L t[óòôÓùõÕéûóoïÎ?^\ZïÃõ’WWv³Éð°b@ïúN¡›Ió1 ºJøüˆÃÑÍäää lZþ-ùu/îpøS: 0k…ô¾ Òˆ!M+P„€ µ–ú3!$ôFÂO»ù£ÙX|s<—`Ê¢~ˆ#¾^2ªŸëÄ”ÙÃfƒKÌŠiDî©:Cd|4DdT˜NLfQ§Cìf£°ØWr‹ÆˆsÒ—ÜŸûx–ØV ÉÖ€çÐüjrÍBKÂàÎœ€À*p‰˜wrB ¤Xa›–%‡ÙÐÂa¸ 47"ŒD»þ†Ð¥ÐY[Ý«¾)d'ÕÕ‘b«£"yÌ—Åd§!bº¤ú[† 5ÝŸ à+?~xÉpWÅÎQ˾nhêaJzÔòVå‘+†v‘ŽµïUÒ‘S¤ÞVŽéWZÒ©çÕ•YÝ”µ`Ó2†&sR·ˆÔq×Øzò~WØ»ûßÙú8ãî_¡îŸý¿¾×úu|ÇBÇeV¥Õþw[Óæ‰ßÚÒÓ·9<ëkdÝp¸&\f°^w™€º! üb‡Áí÷"úmýñ(N¶%s›(Í.Ãݲ•rP8ot+µD5€ÀPÍÕCƒ‚$’+ÓÍE¤-éŽáK[„1˜.‰¼3×ïÄIP^Ç!cU8#ÄÃÞ»õKÕÁ<ÏVz<7ñ=ç$² ]wuKÒzƒéø×ûÁÿäþê×m0Ÿ5ÛîÕêÙ«ñøýbL™}ÒÑ­]ÿ¥¾*ºˆþN {§:£&(óVÅI’ Å΢e>C–1³²d¨Eª^MDÕ-Þ‚|LïÙLfù×Ø}dzî#N;áy.KõwÐà¯iîÕ 1MsjÍ|¯iHNZmumÒCuâ.“¨ ^ Þ¢hvãY-·+|O†_%/?‚\?U NÆœÝÌ«Ñÿ«âàsxˆ`è Ã'd€„Hð9Æ”ÉÝuyº«¼ã!ð™ÄçÔSÐ~  ùK•"s@®H„³ô<]ˆ^•\ø„âLÚ™+…eI4àÓåñnÛn‹óÉÚ+´ÿFÛ¶t¥) ½G¡ýÛQ¶$Lþ,`"ÕžÜf•‚ºQã‚ ÷9f‰ÊZå‚x—[û¶·:ý)TmJˆÝàp‘è ôhÅ˱J–ÃÀòMe¯ôt™Í‘ÃdzÑ®:ÙEÓ¼±z= \D[Þ6–HàÀ†F#Ó廡“ôi–^±V|š#ÒáÕ¹“‰ñ‰àÒ‹¥Ð•(Œð½³Uýjq=ŒÃ³F~ÃV¦ˆFc1w®Q!ð#Ä>˜èþ©Æ7{ Ú îï2s½­Ì)gCŸW7YãTßÞå"›v¦Ói^ߘP;ËeÔØ Ž#$·ún-Bé–ùz0ñ÷¾ù©üúæìÓé?y6€ð´#h¢šX ™|PîÚok2)¹^OÈö{é~ßStIh§¯‡}ƒ¹yÅF=8 ¾3ÇXõb•e +Y1„ø6p%ƒaGa•(ùÙ-!FEN¸úBïÁ ÿ‰Á3ì/qˆ¦1uEY%Çæ")«ä¾‘ZfZNá"Ti4\a?OS•ŽÒÔ±ã»"~;õ—3ÇÚ\§ãpšªDÏÓ×Ûª®5ïÊgç2'|eÄIy✠^, b[Ã/s<û0†(öAŽz¨ÌÕÍÇT冨כ'·€Å·¬vé»H}ÁI>䔎QO<‚埜žÄPøÙ{¸M‹îö™ºÌ{Ê›KÓ¾ÈÍ~pÀ*=Uƒ—Ù½š@ÙXʤg7—”%åÕª j97Pdð•ØÄ!³(¸¡#; ª4QlÜeV*úÔEk¸—lŸ)k·–ÅÍù³iWO/b/îy…@£RÔJv¬‹¤’UeŽioÎõ‘LøcŒ¼”6L¬yý*ø2^‹§H—Wr¾OÉ£Ša#ÅRÕÚ8ïQf^é/«^ÃrgÓ¾'Ô²»9øûñœ_¬ÁE•«¥ÉÕ1²4 oîñ~¢²W–×d5u«¢fŠrÌõ4EuI¡J´A;TC½V®Úe6_äÓ¦øVnJ_CÌÞw±ÿÊ9çJK.]=:Xiùé–'ƒÜÌg”z=Mª=8lzV§Ê{Ó±§ï;²>"ѹ:)JNºj-sòdmâÝÌ«»ù½‹ÙUéˆ×À~Ê6ÿX¾dl9‰ä›VBÚhVšäXÇ`¥”I=xA´ a7Cf)«ö*w¡f Ò©§î7]’Ÿóõø€ LüÖw Gúä-*Tà¶7Ȫ¢Øº(â3wzα¼èfG ?A–öx3íñ­>Ì >–‘O ‘í¢UeI‹Q µ.Ti 6ê_^ÖeÕz¬P-ÝŸ/3ÌôvQY˜Çd-@}µ#C“w|UlQ:Y»’W@Á¡.ž4Máïò„=äH+RÔªCur"ƒÕÌ#÷5Ðø˜tt3#‘8å,nÞÓª‡õŸÏãgŠ·°ØE—xdé|y¦Óÿ@v~yÖüPK=ˆ°ÇÕ+ áA polynomi.hÕ\ësÚ¸ÿþ µ2†æÑ~å5(Ý2ÓCÈÌíÝîf ‰î56õƒ„fú¿ï‘dY²-9@éMûekô8/󓲯ÈÒsðõ§Ÿ'³ñdr3ú<_o>V^Añ°¶¯rQ¾,‰‹Qý¢RyE¼…;½\Ûuä’ùùÝK¥uEÂE¶Åvoñ<°i£lm?\Þ;¥eƒ‘t*•Q÷rp5éö7½ÁÑէŒüɤ²\¼@^8Ä^¢x·.>Ûرç àÚw·ž¿"¶"ƒdsv°E ©.'_\Ñ¡ÿz¬œ°ÙøšoÑ7ø?,ð:‚ÀY¾‡!îmÿC»ˆ3D1Á@J-„þ:ÐE¢­US˜‘õ–»SÓ(d’"gV*TU ì£ólÃ9‡ñ­Gw$Dm5 æüËÍÊ,ÆÅÉ-ªb¾jzyÞ"ÑŸQ]0–üÐ=‰î’OÀÎ*™SÒ]Žeà¯Ô>ä/ÑÃßo©G¥5õ©!ø©M|Έ–è@s|K¼Ót oÖ+’ ¤ýYE€\Ä¥¢qÊ»5Ùmqg¨cD ‘Þ?«(°X?kkê™ÌÉíAl>AY;ì­‰'QÇÞÂw°“‘óh:’G¦–mÏé‘@)Q±§± û,!œ?¬!Â’¼ßf$ê ¦P&惩†ØÛ˜øÈF½x¹Äðk§C§ÄŠŸþü¿p—He˜W«†`a˜ð“§çŠæç‘t¯æ8ø{‰sUI’Õ7œkñ©qê˜b"¶5e¼p›b´ìöûƒ««|¸Ô„IØ„® ÙNÔª¾ 0¦[ììL¢Žòž5YEæ-É\jõó'X;{GeLânÆ ûÅ#QË¥™(ðR£Mþ&0 §þÀ‘Ò”=æ‰nO Vk^vGÃÉõ§ÂùSp««ùkîí’^EÒåà¿Ÿ8H®õÏq(™pሹƒÆ”(òÑÆvc,„ºÚÅ…S‚‘(APá[ØlÖ“ãÂ{{m™ŽÆtÕÔeëu¯†}Ôg/3ø¨9ºŸäJÎ}ßEƒ¯1$ôå'p™Óp*ÃåÇOmýFi·ßò3@Ë~âÆa¹7•Š§¥yI¼ãÒ@bó^6Mœ‘>º4¼nqzÛ£ÛÎwb×?:ÕØ=¹`Woð“¦LÝîÚ#ÑÞ¯¢îb¯bWnÀÝi‰N±/!XUÑ{J9ì<¹¹ØFaɯrB–¾‚­ì@˜ûgŽ²æàÐÐ&íF¦ ú¡Ä1Œf½º#Ëè^æ"°·×Ú0"Sr{·‘Ùî‚9 ìð…ñâÎ;B–ÚmäÔ¿¢7jÒjYoQ«­dj)¿X¶ É}Ù%‹ë|ƒ";œaúŽ¯B^}·]ÞíèmV8ø‡£Éõìb|=ƒÒã"ŒœFƒbØ^U!Ú­ãÈRÛP•˜Ö„ óÅÔq¥s}1×£§sYó3ŠZâ麃.)ãÇq°VÎ3;¹"¨Y¡Õ<µÇ¤z¡%yçaEï>ÚÊGmG¶ëú÷|‚ëÛ4›‰Q¨…ÄNyNÁJÓÖd(y¦R%vÐ$è°Pp(t¢^ÓÔ›o1Y„3Øò˜à\áØà(Œî5XNýaoÈõÍÍãÂ)©¥¬"P‚Úè-…{Ö*¼YŠ§ Š²""¹pW As>Æ %g¨÷òzÅ™û#y¢F„„1úá©@Šƒ,IF .;O <=+édmO‚!;®D¦¸•X¼RÝÅÈh7@$Ï®€Œñ¾hê@¥Ï Ó£%zq³° —,ßf’è§A(RÔ,…‰:ϬUI©–¬äjb.XHÑù]’£äã¿ÿhšŒ=li“‰ãc2ù•!¼'£È¥7èÝ“@Œ†taŒžÉñ0 ¹ñ$·t‡ !r’?ÿ:ŠûÀGÂm4‘좻XËQ­)4dÕˆRàh¾ÑSTJ¿(¯ÅÔÏôÔ“ðG(×õ”Uh°ëQ9©‹ÝI]gwD9Ñ%YíÈÆ>Wæ(dÓ"^k›Ìåžä´ƒøé¡n¶üU2מÆì­9Q)¡%#•¼7g¹”ÐPrĆŠàáÏ¿L Å–våá•ôþþâ‚Þ‚Ú!= ©/2P}™áÕÄö&+ÆÚ NòåLºQ‘Íƈ)ý€)îËDÌΊi^›­™ß¦„_ýŠ?‹;⮿/ªÍ®»¾³­ÒËüªMÇÙ2VàÅ‹¼ ÉÉÅ/ûN¶^§’_i¹³ŽU|”/v¯t1Ñ¢s­æQÅéFem !4ï„I³M÷‡ /H˜ÇZ±³ì·E‰6Z‰h•ùä« ñ\úw^<²-`sñwVÆN//äÑ´ïÄ9ÄQ]µbŸçëþƒ•zñ¬J½°ìv{ÎŽÞƒ5è ç]–ô"³ƒæéY’NûWQ¨}$Z¿ÊµŽ¥Ð¯²D­Üí¥Òž2ÈK•gÔ}¿¹–„Ir1sßå?ÐVg¿•­RˆäyŒUÿ­Œ•âÏc¬‹ßÊXˆáy öú÷ÚŠ)D¢±–ò—ÿƒÑûâÿ*ªZjNyE’ØOÞÜ›¤¢·TïÒ~Pï±rbŸ3JÃU¾X& ¸gÕ¤\ˆüP<93½¢O.—•PK= … ±ªšpssr.cppíX[sÚF~F¿âĺR,08ÖÁ˜Ž1Øa¦" ¸Ét2)#¤ìD·®V¶i’ÿÞ³+ $Ò&iòb¬ÝsùÎýH§§FkXaux`”sâƒéÛº¦El >ð%0ž»Ô;ðL<™¯à5¡Ð7©¢|G}ËmG¡µl,òBrþ¤ãľÅià›nWQFWÆ`:¾ºÌzƒÛáH½f«㱦(§§àŒí¶ë t 'Bâ¤Ó+ð#Ž 81½:{aFË¡Ý™ Ç£ßú©Ùm·© —Ð||Öº8œñì<Çxvãë%ennŽñç áÇ·‰דßÇw/ÇãÙпœÜM%¢‘‡ñt:™cÖ3#ÒnÔŸ‘ˆøÜäôžô(ÿ•ø ¾TS†¥Tˆ×Ô¡„%w:¤—6](eЬÊ{¥–ÞF¦+îÝ4ùO-Ð_¬ =êM;!5²ÿ·ˆá1óá9œÀùSuÃs²VtR„»À£¨•î0'Ä î 3ç.):‚íöÓÚÿÄQÔõÊuƒ‡TëJÕ4¥–Y:5ñµù‹i<çÌ´¸Z bO w+ ÒàÎ7.nJÍ1½ÊFcÌÍ9uiÄ©¥¦¶€0f:‰uKƒîIÒìQ೿Ç&ãjÎ;©@ÎbR)fRd¿¡,Ú%Ã1Ý(r`½”„\^sb(2¤èGu‚=)ðF±7'ì–ø¨‹ Ž™¿ÐA©åêóiΔTÔ:þÛWi”š¨è;fú‘0Ï= ŽEÈtxQ\)Átîði/ä+–É[±3ArÞ2£ˆ°Ê,ƒîåáyÖˆÐdßÖ%ìF_fÛq`†cfŽK‘ÅXø;Ù±†±‘‰KèÐâÞ% ˜è.GQ•ZYœ½†–‚(€-S‹V“Ò›š8ÔI©í©„_G7Ôsp„—¦Ä=7°Þ¥Wy}ºÄ£f „~iÁ ÅA—ÊÖé/iî&²$‹9F¥†£ÏJ ^¤®€Àã‡Ô(ëÍù[”5Žùë€Ùª,)zÃÛÙ`Ô^f/'ýÁDKõ)žiSÓ!ºXòé’:¼sö¼«VU‚ÈŠdŸü¨C"¼Rt:ðL[ûâ·ÐF«UDu^>ÛU°•øJ¼‰su(F?O±åâ|l–e—ÓB©ÝnÜÞ¨Ú:nW¾m˜Ñ;5é å?8«° õ£ôõ&s6åØIÿUê⃰»É§ÊXÕe}gJß4ß—ÙÑ*5‚Z"h[ñU»¶®ìô}™e"ÞËBÿ¶Ö™µ>sº¤Jz*î÷…Ž'ýIéKÏšö%eÖ Þó% `ð¡ºÄì#¶z”-VílåÉ$­Ð„Hˆ³´ Ì¡õ§dþÈ%í;âÛÔÉÅ°(PK=ÀeHÌmþ pssr.hÍVKoã6>G¿‚u€…ÓÚqvèÁ¯B±•Ø¨åRÚÅžZYD$R ©x]#ÿ½ÔË’w7)zèšÇ7ß<4ä% ¨šÙ_­ÇËr-DZ݅v©„„Â+¹vI¨¥> N’nž`v2ˆþ”‰”,há.w¾Z5LEˆs_ > 4m­›†cé3ý5î—ëîŒïÉ,ëJÓ¼ Q#)”³1 Ó½ÅÐ).ñõ»kƒÇžãMÙR,S&·`Pù„nM!óµƒvñL¸Lq„6ŒEH"¶+Ý÷Ý+ä1*$šÜŒj;AþW"Gr´[~†X„êó{&¡ößèSˆL,žîªT¤â|—ROFÑtÒ¼¿kÔŠü‡ÚEφ„ƒ*•ÿ3Ü’ŒñV†MK_©I@€º^E×'[¥CgTcão"·Qùù Gà5ïÍRXœmð†DDHâuOÔyëÖŒòš—…¹<5³Ûê;ÂEÓæ™ÍXœ¤²™v»6¦>‹×i¼^ö†qôÓmiEC6{ èç•ë˜çkUY±Pz䘊€ñÏŠÖC‹VéN*Ù+F8.=Nä>C«¨4“hÐ8Û«ºs(þDɪz%å;Îâ“êü/è7ýNË|LíEý2â$ÂÊpœÇþÃ1Ü…î,Üå|ŠŠÓZ2_ˆ ‹FG×ñ,Ç’§0­×“a:ú§Bµbì)MÆ-Ç):¼¼<À‘h¢·wâáLŽújõðŵÙ߆ýµWâ«e2±>~þõ³«N{ˆPµáôÕ£»2Ö“~)0—k×Òç¹ì¦lW£d“‚ŒÖfüÜ94«þÆ…|à v:=IfôòÎ-]ÁT™¢1ºA¿UVŠy¥8ƒü£m^a7Šö ¾¡kFxßî?ˆlú½¬…(Þ#TÎÎ/Í[¡0Ò…ä ³¾Nuk‰œ\¯G[ÆUoâ5ŽAŨÒh¸uÛUWu²Öö;*£ìÔï\¡_2:ÃáYLÅ*›ËÁà'4Æ(äL:¡”Ép0Øív×; >&׋Âôβ½e] ˆó‡H?›ÔÎôxðTS SOæ£VÞñ  èPóüÚ—û²ÇI5•åúý÷Âè¿`^?Çû½´Ë ðÞõóÊXϵêÕõ7PKÊ=„þ1‚ pubkey.cppíY[oÛ6~¶~ç™ÜzN/Àܦƒã\´v8m·½ŒDÛD$R%©Ä^‘ÿ¾CR’)Yr.@Q`ÈKbór®ßGžCïï£$½¼"ë^$è7t#¨R„!ÌB”D8 !¢ ©%ÑË" ÇF.×è+¡èSÏ{FY¥!Aí$Xö–m=2g!™£áùß“‹O“Éìl4ùt~1-­µjõòñ`t< †Ç³ÃãÓ³±?ëDñɤãyל†hòêÍïof£Ó“WŽN^φ<Ž9óÿÄry!0“s.b¬(gho c]0Nôœ§*IUIú/™)d¿~$l¡`IÀ™TÙBÊÜuæ[ݲzmôL°À±,vT'òÍ—œG(Æòª‹R&é‚™`*š2EÄTa¡:Þw¯5¯§”]¡çþ¾õZÚ·Á*47ÿ|뙞FF(ú1rƒÌÞ¿¸ÐÛýÜe××êo6¯ê€Ö.Â7¯sû@k©ž_Òˆ _ñÛûÁ5¦¾ŒÈ¢àwÐ{ô²ãµÀ›–µ¸7I•Ÿ…Ö‰©Öã¬øjTú™¢/*ÓþvÐë£íî)ñ‚³Ð×÷ޭç™\L>ÌŽ¬ˆ)£RÑ` 9Á*¤Øð²Åˆ¨%ûý/ j¾Î&ÏI"ˆ$LîkâÛÕãOÏœ…°”Î)ÄqYúšã"S'jÝõZb¢¤£Xyø™5ðÔš’à$F<¸‚ÑÂMŠŰO^p½LúMu¼†v{½Ûã4ŠÎǧ~§‹ÆŸ?~좗]d®zYr°Á¦n£k`‡ †lÓ¹<þ–âȯƨIrýxO´‚|ç$à×DX0ÿ/!!¬‡$Ì,÷Gxåxm77¡¢šÛž„,´Ã½#º RÙCÀàçˆØ™FÚRóïeú2 N·â׺”Äý ÔÝrÚ•5ªGåÑphìE{{ùx¦Ð Bè¥Á‹¹Œ.Nf$DbIúý3}´9¡Ì °Ê>‚ Ó+.Ð^¼5V¾dÄ–$'åÕ©­œ×*Õv‚b ):FÁ,ÀR½Û±ö½¿mf'»•C0Ð)QåasæZ—*:ÓGüj ´G²!+ iåµèùµ„+R ·Ï;”‹ì(kZGû1îw V[ïw*0(ª¥à7út(Ž„i°$1¤üY_p>]r¡¬…Y‚âNƒÃê8w—gݺßÏ‹ÿBÂãq_qJ`•=Æ[tÑŽ8{¸dž°Jž°Ÿ}€Uj…Ò­\kynv Ò; Gƒ í:>e0­!š-Øò½eZÐ0ÛG²š©U-v`#²©DJtHt€áï®76e~ (/n€iyÄ P•br.NRèZÑMoˆ£@ã–X‚äÎ="dIÑé´ß!UE³SïTfJÕŒ)ii©ž) ~lS2ª.*OœÿÙœÏøVÂò˜ÜÜÍ÷œ+‡]($I´Î'ülã.Äjù:t«ø?ÔæeáNƒëÚœLC¿ÿÜlíïC­Â~ÕųáÁG€•%4P 7¿BŠÆ:­X)\y­UN­šçÔî¦r‹V¶ot.Ö{ë‰)?›)y­bÛØÂÝOw^V¨]¼¯Ê}­Áa¥ ßBdVy:,u E×ü€:ï ª?ªMo/…I÷y„ù1È­y,–aÄüH9ûº³]që“€&p (²Ú¼ûo†Š÷{³4‰0ev¥•0Æ1ù‚£”L0í%úZ?+Kÿ*U‰è—tBW$V&ìÖÐÞò~Të|½@í¾c,Š¬l>Gm˜Ä^ð©¬-ýf¯éÝõc,³fù[J!-;D5™m$Ú>:kh¡ÛÛýD‚Äæ³?Ù|Ö YVÅq©$ÎË 7·[!p п©0#óÛüÇÔŽ¢nÖ þwG½Ï 6—¥¹Áuyç ØÁj© .²¯÷¦“£!cS1R&S)7cSE"äÌ€r„W“òŒIþJïj\çô«‡².yéEK'Øx!ÌÖùs“l›Ÿ¤`ãZò÷ªf6VBaYHV!¡4ŒŽñŠÆiÜÈäÚ •¹œýÜ›QºuûHVï1l´Üu!ZEÎý0î»uŸ¶dÓX J鹋¨Eîbºéœ4dÛüÌ}<>ò¼g„…tîýPKÍ=G)”º(«üpubkey.hí=ksÛ¶²Ÿí_º3¾’«(¶Óöôʲ;Š-Çšø¡k©9·ç1Z¢mK¤JR~4Íýíwñ~ ©‡çœvêH"ÝÅb±X,‹×¯Ñtvuç?ÕoÑ+ôiê‡È Gh:ö†þ!Jo}\h Ñ(šxðäê ýÕБ¬¯\‡#ÿ^þÚí_t»ƒî/oß·œ¬ ƒÐ·¼Y½µ…þqŒýõõµþm ü £0ð ºõÇS?Fñ—$~òúzÓ ‚×QŒ‚ÉtìOü0 ÂN4yã›è¿$uÕ§õÑmàÇÞþMhc4– „¶ŽP¡qÝ¡qpç“×õæ4öÖQæ¿ÇìÃ×虇O;ýn)ûü¯=}Üm>íÏßwJT ÐwúnèošO»äó÷ÝÒÐßô7ëÍׄk¯ Ñ5hP „¼ØGÞU’?S`fêÇ× $¼Ÿío"3ÃøišŽƒ«ú-± àï÷]Bô G{5º&2&&h–àÎݸ¦ô2ôàF =ÜCŠ¤é þ¹âtæ‘“ôÖKQrÍÆ#ûé,UàÐáä×ðÖ o|ï A• “ÈfÝz÷>Úxë%þJf××Á£‹A³Þ@³àï÷7è6T@)¦C#I´ÈŠ ¹N”¨©¢¤R½Ñ?l èxŠ&¾b4OyÓQcF²&¢¬¸ñcŒ—À;:- ï&ŽfSÁØd=W®&èúb$Cà¸Cê¸!ñ¨Z_ßzE8ÏF€p<Ì úí†òFdŠ©Òú@×0šLÍ¢Ódçûmý¡ß„ÞÄ×4'þ$ŠŸ@å¼FÜFQ|çÉá¨A•ÁÄƦUßäv]ý Ôî@PK× ~)´ˆF¨ `Žœz1`ª?\W2e¶þ패ÅÎy¿}yÜ:l¯¯Ÿ·ÎÚ½.|¼m¿ëœWñ‰ºÝ*&î4X§úJ¨Ë£ÓSùãübð¡ßz{ÚF}֩ǬOßâ¶$ëש.l¬¯q û?{ÑJ}ü´.‹u¨< nìïÆ'¥ ´;IÑþö^¶h§d¹3ï‘C?²ùê•pï“@ÇQ»£Wý´7/¡k£Ið»?2¹„|Z)ÏjNok:?Iмb…>:ŸM®üøâÃr3oj¬aÂ棕£WQX :Ñ4žù ðÁÝz7‡T ¬0F[Øhp÷ i¹÷ˆè;l¨Î©7ÁdÏÙA–C©ŸÔÐMpk'µ°¥hfDeá6SCQŒ¢Ùx–T%ñøÍ ÅSà/ é©Þ¤·öB}¦ö¶„p#hþ¨„àà6 ­Ø{¨q¼A8¥z½¦E úóm JQPçÀÐÞxæw½ NЦ°’;•G>íÂK?™SD[Q©*B«Ð>+ƒua 6©¼÷;5¶ô ¦°¸’ϳ3Yíï#BË¡ñØô3}cAW·ñ¤Åðf*ó¨×Ë’c@Íýœ?;)¥Ôd¢”Å–QëXPØì=³ÛÅŽë9€q­v>ã²óó…¤)pÔÐ ‰YtZëÓW¹£¨nK@)rQÔó ËÎn]ªÞÇÑðNèøJ5ƒßÙ™ì.=Y—‹Ëú[˜BáyJÖ’šBfHU² °)Pœô#\ )Ñ{‰¹Ûa¬£ë‹µåÕÎ"Vúñ¦d"™±.¼Én‚@‹Ò5>§5&y­„éw€TY7¬†«´E#5£°Le)¬.ÎÅfÚG7ƒp6ëEX×í-ÂrÆ•’,¥%ËÝk§¸N,GV¥4¯ÚgŠš¥SVÃê%æzn¤$é¨Ñ˜ì¦Ú&Þ”tâ%·Þw¸ü˜u°t‚ãePÉ%RÜ„^Š]×ÉðÖ‡J¹6E—žk¡”_Ë\'q$/±Ç5¡~ß{_j%VâVcïUörÜø‰Ó(ØVý{Ò湄ñ º»áuT±mIRÄÒ¼GWÞU0’4 í«”fÎZ¾5GçQK²aÆL+ ’ô6ŽÐy”v¸æÐ èkW0/´)hù £%tÂÅ0?mhSBÜ¥NÔ1Œ“/F^:Á‡'ÐCCj¢£SsyGC¨ßó'ÀTÁc ´X˜€ ÝØÄý­ë›D­#º^{ª¯Ž?*d‰"vzV2æä¼ÕVÑ™º‚¸ì+.¸ ,û™¦©Y=¨Öó‡Øà fÚÔš/úþ#” ®QÅ.!Ux»†wž@¿Ùps Jº=Â=½¾öÉô8F“é,åµt’;™¬€ÂÝOº 74HŽ!&ÌíÉ4}ÂÐ8)j#2¬:Êîç à?àÑðdgÍ ¦Ý°Â˜l°fÇÑÄh eýãÑ(µ¡Ö/ìÓŽ¥9«kÆ5ÎY¬HæìâÊf!ýûٟ݆UÌôÃÔ`ÝiÝͦTƒšž“”Sg· kÖKãÐìaíµºDkTˆ"&uÖ˜ñ¡Wªh~Ñêù/§§5´•ð¨aøÃê˜ÚÄådõ&ì$‰ý“o6jnŒòvéW¥øæäž2KþÉ;'ïŽN š<8êµ4Í!•™uëŸöÇÒÝq~ùgo|YÅÂÒg¼ l:†¬ETæ;aÏúdàã6UðâÖpØ8†ï :³ qïþ2Á„¨MKdãP0eLy@'PJUeÅY9<•1ÚÐ>§mn²÷xcc›­9´uÏd`“üTïªÉ@7v&Í^Ù“á“Áy½Ç”0£…vcÆhõN­Ów—þÉß°v¾äì%Õÿqõ/ørG~Ü4Q)]^ÜsºSy2ˆdÍI¼‚í¡!zÄ(ÓWçÞá`ÂÓÓíH«w¦Œ›_¡žþµ·™«cT^‘1üQŠÃìeÝsóv¥œ@˜çr››–c?Ê*P%v¥ŠQ“­‚²sïTur¶©´ùG™—-ã"g£×)Kô1=æg7d,ê­ÉŒz¿Ô†Œº–oMÙ¶e:x´xç¬S Úœdž1?óÛU¢Qõt+]ßñðȳêæ ’yädMF\L‘ìSËeñ 7²¨ Êw//ïÞä\¦?EµE»Ñ∱ªú=mM©tZi¼Ýw¥À´;}œBÀ}46dÏ­µÃÍšþ®øöæ`ùuäö+‘… ²Š#Àe`ÕL:ìÀG'¼Žö”W»è½ÿ”(Oð'Ž¦ ÏnÜ-ðɯ9ʼnØÒü›Ší ²Š\^h‹½õâÛ÷*ŒaÁXaÛ©Vß71 3UeÛ÷DÏó¡“G$¶ 9I½Ã“öY{pÑíw.Î{ü)>UvxÚêõòÍRjFcû[ó²ÿpE'X¯cl4´ÎÖ3oš^iìPúK{÷“U²¹å.ž(æ;}Cžá™“êµ*Lƒj=}ž†—¼* ”2(0ŠG…(ÕʧZ3©ñÇÛOa¨•µ^)¦Ã£6H¦~.`„U'm¡sÿAˆ¾ò&g’ÓvݪÐp/›‡ ªý_»m|D(#qê89 kß‹A„ÇT£±dd§bM÷ ÀØO£0ŸHûL,íkUŒ—ˆ²UˆR¤ÉÞþ¥£jíȲ[Úl3„:ʘÒX*øP®ŸtΪJÌÁX*æ.H£!ô¹u“¤™‡G“2tº'ˆd\8m4øÎ y«¶‡S¢y*Zt²'ÌI£qÔy×îõ{¿µ Æ%§->ai³SûÌûkmfÕ§.6G™P M¨¼&ƒÔÐ6¤Cì3ln%…Ç¢º¥`³õv+#BÄ•æð¯iF«fùè4夵‚9¼" ³€@-¶s¹ · }Ô#Q@œtr|NÖñÕtqê"}9Æ-½rtó3/¹c Ì…¶3²"0Ó^´Âô­CÅJù°˜Æ•r‚Ïè;š¥ê® ý©ŸË²íÎ臼È6`•®xW„÷LsªÐ½=5†¡»óæÇ7ƒ³wÇ;ïŽw‡Ñdmû„«ÅF>MÀCN2$2$Ôx‘iu ÍBlB‘“ü)a¬‡Uý$›*e·X XˆzJCç`+Lñ¬¨ß ŒocÏÌ/HB¨eeïJG®ce˜4,¦¥Æºd»ª˜Y+÷þœhŠé¶tXVÔ°,‘eî‹b¶»z‚n÷Üý0O'dñ»F9)[C;+ì¦4BW8X‚$Õñ2úm–DgähÝľÿW"tÀÈɈõæÑéà­7â5äÎcxïƒÑ‘—zÇdŒhçLÔ:d‹ !×îŽ9?ÄÆÛ }Þ¿üµÂ9tƒâ)]Zð“ÔPÏ3&&síy-Ø + ûM,§àónüýµ «„*]tXe4!Í׶Jkvì"Ó}y#ìÛÙ5^L!ê¾Q¸¸AN¬@÷B¼­RÞóîýe(WÅÒ¥%0Žˆgš-ŒÂWAx z-õG¦#›Ï8›ŽAžu?[)dÏDj¸—&‹Î é @‚†ÎéÖ^^°ÿ0 ;‡Þ~œF!öì¾#0Œt$>{ïPVrT˜94 ÐÔ˜G×ÄÎd¨X)æUb²á‰EºLà›úÑ,ÑÞ¤e(Ïj³•xã¤ì¶ˆ˜xµ&7 TʬL±íž˜äôt–á\[ØÀ–è:‘¢,ªPÒ€Gc„âì) +…nتh„-GÌzn›eÓëà=ï‘wZ~"3Îi e dnÁ£ÃŒ?2î÷>bCŸ¥:ªÒ‡…¾?J˜¹‹÷½ã`ä‡VÜT³J×ë,%êhÕf1(Jü÷>7z‰¯œ…Xàø”àjì[™ÂK«Ü¬V3"ë¾õ)b+t^G3ûµSV›-G‡·þð t‡3•Ém0ÍíÎÃGठx?bÏ+vªÝI²tsp!»6*o{¶®›¿å‡ù3$Üt{‰¦CÌåÖ½Œq4P%/oÝâIŸæá&Å\º”ƒØ¢Ú2É4ߦÁ·¸ÆM î‹çĤÒλi‰xhò$¾è9$ÙBÉÉi»£¹Â'ÀnœXTCœ©—çwyñKwнl^œuÕÐ[þ º»9»«Ák4¸¨)DsµX :+o£~~î¾âÔà"ˤf‹Š±#×®¢†Æ¶,³ðxmEs®Ü+¹±4â“‚géyXA5bÐKÏÅ&Dm<è]doßúšÆj '/þ(ßá=:7ºÑUšcƒ0­Åògýv Æ ‡òÉ J)͸zd¶‡¹½<2ŒGŒÊ Ëp숢†K§À£óâÜ`‹Øa'ÃÉš>× @ÙÁª­ˆ[ VÃ8,¾bÏ7’D³xHVÑs®ò4œ6óŒp®ñŠÛ]Ÿk¨Ócü$ÖªzËSUCO…+D‘ù ¯Ü!O<ªØóVLöž& .h¶^_xýyè%CìXcÜ G¹\À ÔÉ,KéȆ7ÏÍÙnëâÜÒ¬bV‰F9y_C²®E±kŽãÚßyÎÅ«28àåëj .6È Êâ@”o êâÌ»óe”¨9Ÿ`QÓ„ ~× &ź¢hKhô=5£·J蟌ÇI†ŸÊ%}µúR=à«šòô/4鱸8BÍý+§Ì5ùTkº€¯´¡W¾ nŸP¦ŸÝKÊlál¢d>’-ã”1FF£Qš³‰Q®Ò­©2ÀiøP·¥h-¬?ñ@îFD«T”âD ”ßøœž:„·0ß1ÿüqâñnÍZcŸøùç‹Î‘sMÐ}Ïפïĺ÷u”U&4×åäÓ-on¿g oá"°™ÈV›[[,cq¿T3;c¶–‚aÌ ýjìµÐY»wö…Ù¾B4^„éë¦F·|¿Päì2†‘âØÚÑpÙÝšsøCwW`ѱ“/Âȼ@Ûç^I¹öNY\ñªyñb¸r¥4w„LîvŸ4lŸæ‘q@6aÚ"ˆê¤%Gñþ~E´I³š0ãÃ<|›¸ÒðY½™ûûªÔ­ï`ŠuM—J=ãnùjæF–M¬ÙŽ­ÏöøÆ›xãWä2u™B^‰=ïf(x ðdÍÄ" oÂJ‰Mñìöºâ5^ÝeCÄkò{¬|OrB;IÖ­yH³mËrƒ1Kñ$ÎUIÏX.<\¡«[Œu˜Ú£Œ˜q¾³=Å{ceu_bÌHe±ÊŸZt½K;´õ%{øºóŒêü ñ[SUo³ðwRì_¤0ùtã-‡t»P`‰‡~‘w݃Øд ¹šlY9ruú²×øê“=¼?Ðä.^RSÏdû#Â\õ46¿¸³¼6ÉHµõ˜|xî q6ûÉ\ęǭ‹û+yšýq0Tn`.Õky]Ôã@åíqŸ§£d'Ap«Ì5¤®¬°Î|·šºÀyâ|׶ڢT 6—¾qïNJÐ3^ÁgÓsŠ&ð sÉ|ž[Ë]çú¾“¯–,w2‹œKœZI½º8›©³cõÑ­xåF³:©¹£s£:W¶šY¡´$Ùù•µ„jU5Ë”šëÎr"Ш–iþb÷øâZòÂÝ|EX6£½ðñ’Ä^†Ò îMbÖÖÅI ±¹X2ˆð;'”^I(Z~½²éòH”¿ýå3á³›ðȤ$£¶é)ÎþÅÑÅ3]Yžs«ËKÿ’‘~A—íž5=wªG]i @9/·éî£Û…¹ÅK¦QÕ@?{®ý9׶Œûvõ«fÜÏÄØjª–ßC*Î^":œ£‹ù™/½Å_´„¿Ç8‹‘/&x•æ¹z,Ã&{+>Ý!5Ã6ïH0²€¡O¯4­ ÙÆ#~×ñiö:šG÷ã ¹uÂi¾¼¤u[T¼©!à609Ѷ^ÌÕ,ã™óš¦Í‰ì¢ùÃC/I›9e*–$û$_ŠW·ÝkÄö+6òtï‰`ð|•ï¾ý¨Qï"t­ÍC­Ae\Âd>ª'D£ÔDyýV[&_îò =£°à*ÛÇËÑÿÌ‚á]Ï ƒô‰œg£è¹EæßUûh—}é—z1ë5×ü(-þ¹·ÕgWÓ¹'“f˨e2Í+ëcIÐfο ¹{Œ9ýJ³œækVW(ür5šàL{ú²þ›5€öLª8³£p¥Ó ×±O*B1($CÝá 'çž&Ι%Àqœ%x½|‡°› ª“ÝPøæŠÃ»Nqä³;&Þð6}Gãñ•7¼cqIÐ%õC/ì@wÆÓG1µÃ4Ž¦O<¼·¼,ÛZÉ¡;ݲSs;Ü_íh5ð ¶÷E'OÌÇ- E˜qyw}¡´M¹WgawYEÌdS{¦òC2A”Óýó6šÀÑ͆µ­×¸ù|F‡–A/`då,¢Û0}, P¡ '/“ÌËïð»ÔS É@9>Kඳi)«È©,M¼ªš´öHÆ+½`Z®NØsO‚| Òf6€wZ–"%»’6µOt϶ëô³ˆØd£ð®f)†5ò¯ýp„¼/À3‡31¦¡–OpâbA5ÃW§À’ˆîøáîAäsB÷ qŠSlÊ…C€Á„ó =e·- hÈŠrÏ=vœÓ»ï¾C^øôà=ñqõ²'\:*êâ*²Ò ,;,Ïýå„·%uõ—°¨¿…T¥¶Zå#n^uã=7’³`ñi¿̽ü”7‚™ß_ú’¯Ï³Ö§³PÕ‚«ØdJ‘¢àvƒ) Ò—†¹»ßÉ?¯¥”³…È}ëù"ˆ¨þÖS‹!5sËíxZDœ\ç¢Ì\&nÔäH~FÛÀ5¤Ê&‚;£¤2^1†{¾x-ÊVdLXRŠRwx˜‰Gá¿ì ,YŽ÷è; O=zU>.s1¤%°¯4²)?þ(Á%Wm3 ³_n 6"Ÿ¬e 2™ÛÛ™leF.äèð3²¶áD|´-¬$Ÿ;Þf¹ÔAÔŠÓ‘_4ظ`ÞV®;§9®«…—¡±•“Î&è0‚E0ýl6Nƒé˜¤Ôáƒ>‚õpxqÜ:ì_\Î~9íwº§rZ áë[ýXÎ"óÂB@7%Ú@N?Â)›yDÕ“¨tÙ«.€¥ô„c’¡¾jUXK°ìᓾE˜‰xtâJ{™±Û§`­ž÷¹¯M ¦ö«~-]vX “±ã`Ÿ‡ÕÏÆÞiÁ£De"5 PÚµ­nQ*àãýýJUq3h4úîš(¸§ÑÏhãèäpšŸÄ’ú:xj«Iœ9o&7#.Ï]ƒØ-‰—‹5@k˜Å¸ øUå!•×båò­kU݆’¹|´ɾ=eR·˜“Üf0ÚKŒ“³h4{q‹ .gÿr©­Ö‚û@ZïE ÝU·î„íOË£B”êB­*#nê©~Âg–*-—bçŒÄŒEršÃœ$¬^¶) ãLÞIä˜SëÞ Æô² ‚“4N»§Í¼œdW\Uͱ’«Æ(Åk4µfF2i[EkÖ¨Àˆü ”Z]æý¿ïþ¤þ£S*3€?Qúø(}Â@€Ó¨úÑ,ÑbœaØ»¬¹*; u¢§O•øïÛÿ,Ϭøï;ÿÍV¢ü–tµ˜èÅaœÍ€pÇDqB6IÙÜM̱—A&}?±îÕåxšºïa6 ½qŸWs^öd–ÄŽ!¬Ú3ÏiÏë—‘2¢Õ+ÈNµzÝ/.´gZpIlªyA—“ЖÈU¬l ¾Ó,ŠÖµÓ‹¹8ÅTp¿ã@Ð ç1v A ë[,»`~¡?ª Îz‡ƒíKrÇÿšhçÍövðæG&eÉêï`Zpœ |î–¡ Ö»»´åcŠ±ÖpXËæý›²Øáï ñÍ•%AÆæ”'¦†i6ï¿Ÿ‡(øû~ÖØc†æ¥°†Ãy6RøûaYjÅ·§>„Ï¡þ~\]Ä·¿,ßøü |þeÑVÁß_ž£eâÛO«k#|þŸ?-ÓVøû‰ª;bN̯ÉXz{Ööë³j57â×—ÔseÉ¿^Œþ[Œrñë…jÇU´Jüú*4èê[,~}…ºö¹¹!~­N7/l^~ uübñר‚ÿÝ”ï’ÚýSá>7žAÕ~뇣àZ„Q‘èÚ8äܳ”¤^8òâ÷ ÕQÿÖçõüy±O/`J#”øc˜¢ë8š {/¼0MPt­ÜÕTÇ7ßù(½õRrm7 k:?a@ø±R‰y‘á¯=NÕÇâÆ(Ç^P[äA%­)™À¶~ëü¨uy¤Ä‹¸øÖé»Açüø‚{äúǃv±£{ÓQŒQû˜A#……,Ä!ŒhŸ"kÊ´X@®\Vé‘>@\B=w$#æFCRg8vœ¸R/DøzηI – áëLp7ŠŽRÎö02¯¢n:¶¶jr~ðæÛ—ÍcBb‡“Dê‚<`Çlñ§ˆPªU0ÞFÃZ§]Ùx½ÿ:ªXk±4ßH·1N2$ã#åÝl’;¦Vl»´À˦Æ$^ïÙ°‰xҲش@Õ,6ñšD)ù“Üц}8üq=DñG³pÔ q†ÿ•’gx§ ×Äy{¯ñ½2òœª½¢‘*DÙzRž×ò0ÈZø¨N¯Û:lÚçGbAöÿPKÊ=›bû}S pwdbased.híYmoÚHþŒŤQ+/éUªD‚˜¶(Mb¢ê®ªÐKØÄØœw!áÚü÷›ÙµÁv!Mª\¥«Z©Å¬gfgžyfv––Ë0» ˜ä£Òöá&Jq˜?‚™Ç†|Â5á0›<1„Q0e¸2XÂG.Àa²vÅØñ1øÓí»nßý贚ݶÓgíâ áóïPÑzó‡gÃp9Sž”&Ï«“)fVB%¦ÅºE÷ꆬ½£˜µhèU?2}—óã¸ü 55 wxètÞ¶»½nç¯víÎÊÝËçXkÌ<ÉIº\Ž#Gd—2†$‚ ð½%(vÍáõ¾Î¡/KHT¤œ@ø”ûÊÀ§ÒÅl„àÛk88ä3B½aŠ0ƒùxÌC[k8â’KÕEÐL zñ@†ØFL«§AD±ÌŒ¡Ã ãÈÒblf ì**-nk£4ÉÙ¢Q­¨'¢GÐÒàÅ ”{^=x½ÓXa–Úfü!ƒMéèdbƒ¨gšGë…9¡#;fÞpN,6qG1!ýY’1VnʧÃÙÒ^‘7–\ƒ`‹Bs÷¨J1íùw¹¶W(.(È”¾»]+•¡E¾è¬1ÍÝ5ÝdÓá쉄 íkÒëÐY5ƽîêKÁÑÛì¹é•B×,whßh´“\ÙNqM3'²ED£n4¦VhL% «²ûI|FSÈ'Ïc~}Îè¸I×èÄph½6¨›üSx4…º?#ˆ-{qï¨rï\²inŠûFá§;Ì›"s¯vˆÿ¼[ÃvœÌßâ“*e;Ù€òâ;Çr’K­h»µ{-C¨¦ÐTZùóYûÓ1?µC«jã)ÛJB\(´ªµŒõNÄÔÆB›¶#u»ST´˜·V5_jûÃ`ÄãÅÇL‘é$g'HÂ33ÝüÈD²}YÿgCû̱¬]?ÆÖ¿PKÈ=j>‹8 >. queue.cppíÛRã8ö9þ ÁT¥œÐ$µ;Ðf‹zš*`ضw‹ê¢L¬W;²ÇV†ÉP½ß¾:ºXËI`ØËÃöHGç¦sWÞ½C¿,ðïNŠ ÑS™RŠ ŠI‚Š,žà¥ÑGŒŠÅC–NP’Ïc¶ò°D_pŠNâ4~HÉ$[$m“ÇÝÇmX™’OÑñç\Ýü|uuvqõóç›kVPeÐzišf—Gqytqz}ut|zÿáô§³Ëð¸\4¿ºêAEcÊ8™ä¤¢hAªtF8›U÷óø·£Í/ó_§¿c¡ÑýÑÞøOAðî$­Ð$‹« Mó-* ’|XRüW`å$[b¿^\Ás äß:ÖFX1*÷1º@¯t:ûèa1 õÂ3[›ß?â8aÜÌïiœfìÃÞ[&ø7*?‚NJ²”`$Q^ aOJú\bº( `ß­øÆAóÐñ¢,1¡æAÁ<,è?6Ù‡<ÏÐm…“ÛÂ{4‡¢¨f¬g#ø5Otœá¸ WŠÝäújAC!äS.ê?àYJj7ÃdF%JµÆp]ßœ\0ËÛ­¯¡ ÜuÒ) ™Âv$[â¸áž:s<ŸKc{€$aqVžÙ‰Pv Õù%Àø[È™ïæ &b©Øè¢H(…s Q2¥°oò\Äø¹0_ ²£5dû4.g˜ÖJ›äÅ’iÄâBëSkO lËò ý(ÄBO°;=S'˜xÙ;fÈoòðÃb:Å%NnʘTÌïæÌs‚º ³¸úŠ&ûû-S2CÝÉcL΢“ÓG·ç7÷ÇŸŽ./OÏÛÅq »#ï DÜÂÄǧ$¶òßF²õõ¶¢þ„©cɦ¸á©ýíêà,ïÆTú Ë5×M­>& ˜î ²ê€„| â qù¶öù*˼ȓtšÆ^}qN8}[!³§¼L•^j½¹oef¾HIhé``Ré½…F6¾ôëoi¡RvÅ>·˜™t9 á›æ6ž¸Œi^Þ}UÄS_†Õ‘'ý*ÑXÕêCÅÙâO`çC–O¾Á9­*©"e#ßEåÓå¿ ¨9Ø߯?*1ˆ¬³˜÷Å,þ})\3¼¼=?ï äÚ9OÑá^ÕQŒuªÊ³°>Ïøo ?Ùe³#ãS/9 MÜ ŸFlW‡[j›3@ô†ù4þóhiðï-šN£KÊ.îýKY>–ùœx¿Tˆ7LëY–Y Yx×^u¥– –RÖßJ_“Þt ¶ˈÊ42`‡‡Üœ‘ܪ?Dò±_×’ÜeÍìãBœ2k·:ú JÂ¥LpÀ´(B9súžÈXêí¹wÿO}ùü.N0‹–ù2ô_f½  >E[­/™7šJ2tm¥œa|ÔAÞÃÏY•g1ÅÉIigà9ÂÌ.ã9þ[œ-ðUœ–êqÉV A“gØÞÛe‰ýŒP~ðKJOð4^d4ÜV&·=W‚K’­×’È>¦Í{FUÀkG{ë,­Us®yñÐ ±¼Þ°¨¡ Õ8û¼w²”z:/èÒä¼nÀD% ´ÛEÊ,šQ´'ö4¡$öEÙq½ÄœZ=ï5F˜Þ&‹œZ(uÇ“píuž¸ÅðÉÈmÈÈ|sluˆ)qjFÕÂ`Ž«*žáSÂÒ ¿™H“ š+IôbÙC´Fð1%ÜüÏÙÄ~ï;cöé1Í0 ¡ãŒTHÍŒlU{è½Ýµ*£`ûhX/¾¬˜Í- v³÷Íùï"“þ™Žé•ý/»!öGòn¡“,¬§r°Iü…¢éèï­ŽuY÷Á-öML&€N%L½–‡§§­:?¥fò¿ x^Dº(—~i¹‡6wVuÝTQu\E‘0¤†í{„RF¶Ò¦+U¶¼Èd¸¶·Hë[Ï9†‡rBÂPØö[ÉÛÆY…UÚÕÉŒßûI\Ñ÷‚éÃú´¼eËŸ+QDXXtmϦ1£Ô–š¤XF3ð†Šr%SH›A©R•P‹ ´\`ï%ß’$W×rú^î±nè±ÌŸÐù•±œ•³ÅœÙX¸­‹4Tx˜À e´PZ!šç(ƒ®j›Û„Ei¨Dò°ÜPðê´³fîóž 4hÒºìrJtnÞ ï<<Ûþj¯gNÖßé4ÃFcšÆ͵Ø̳É1¹ú¦;;®©‡~äAÇŽm+„^1a¬•e¼¼NÉ7¶GZF jN+N÷ŒÞÎþÛ:Át.Áýôl±_©Ð×*Ï6µW°McºR‰ ¶©E9øÔ`^v´ÆÇŽ[ºjXªU—¶JF/p ´ ’êO)NPô&%³FÀòéúú¹£á‡FmX`=DV€LV!wKŸ³ºCu#r8c` ¹Ô=§I똈WGÚ0Ý(Î…Øl å gì¬4Ø•ÃØ–£V"Òb#h«uKÙrj<ë¦a¯<°\IûhåKœ}Ã%zâÿ…}x!ãlIÝsû‰ÀI°]ÓÒÕÕº¦\Û­²PÀÊp¤–Mbª(hº¸äç˜Ìð üL=ìðoƒÍ]M]I¥pÙÄóÒêTí;‰€ôƒèÝÛj˜#+rýÞ«boÑ2S))%u«]±2@£ÞŠ³ôiͲÂyÌSÉF\Ý~Ɇ0ÖÅ«•ÚfU/oØMàÒýXÝ8 w¬«;o5zê§Ob*Ölƒ2$XÝ3¹Ý†8ÿÉZké(•7˜ºµŸLd©Ï.ƒ¡él‘/*Þ¼ióµ7j†T;€†Žžd-çcUž;›0Tå!bŒzbåÿFÎ_ubæÒPÂq‰cŠ™þ®‹xR€»¯o£ìvÉl¦ôø†ÓIOwÌùZÛWJ‹a~[&{óÈ_«Î†2‡—¨kêO=SDÍAsùX¹³M=¹†MM‡EïT¬ÆßBÀ²T¶-BèD7ÙLÉ·Pd+B ×®gT©²átbùHóü>V2q#{±;†Crê íòâ}ÔoçÄÒ˜SäåÙˆÿæ`l>÷×,Èïuÿȉyôu÷UT8úÕèù&ŸªƒJYûé~šŒëû*Æø;U°X•ŸsKÜãªÂ%å¤ÜJÍî³'ÅTOqz S$rØ´ghn ö4á‰KZàDî0*-™ûâ7$b_ýÅÜ7«?¥W|°ç25iX­2?^]°6)Õ.×ìzt¯ExÓ}MàqNü0̘$y•ò¢N½kåÓi…iýÕãèóVzqÆ6”1ÈoV›J2ÿtÂi)Õž¨Övä£Þ¦DÿÛÓÅÐÊ)Á‹”a5Ö£ÍéþOtúŠ­ÿtÇ¿¾½÷7{Fò®æûÙÃ6uÂûP9$/eÂnxl¶Ã›L‹Ïòç %¯hÏêqTj5(ñ,5ËiŽ’œðÜjÆ ÝS7[g‰l«Þ©§uœ1ZrƒD‡'53p Ô˦ÔÓ5Y±‚úë.Äy¼HýÎ4ÂÕó†jö/ZfžÑS ÛVÏ/ÚÚ×vßüÿ˜à-Çú÷ا—'Aðã0ÿPKÛ{TBò䫶?~queue.hÍWmo9þÌþŠi+å ÊÁ©IS‰ÚF"”†äz§ÓiåegÁe×ÞØÞ¤4¢¿ýÆÞ×IÛë—æKØñ¼ùñÌ3v¯:Å9øœ.DæÐ*34bŽb¥$fFãxÇ)„X¿ïüöœÜK}KµLEÔ‚9ÄZ.&8“¸±…Ca>ô¨¦3ÒÔ0C$¨Ž©R ÃXÞ‚›± Ý%fÍXŸ!^{Lceo ß^å/‘m£'ñDâì1s:¨4EmrIoY~v&õð^º$5×ã.£N.Ÿ>*ð%ká¸B þ(Y;J¬Ë‰'9æGÕn»‡àc²xsG|ù­–q/ÂÚ—%Y:X"ÌÈ”={†§øŸÔ6zAöÐ`¬ÔQ’¦KNƒÍ$ðn.ÚheåþC$æD 1)#¦ß2ƒVºýM£è| 1)#¦ß8ÌVúß¡q˜ÆP\YÆlѲ¿mêuí™ê×`¼sØE€ÓS¡i_Õ«ƒ››±`k[¥¢VÂd#t W°Ž: ‡—il9ÌônŠÖÇW5lÈ°Š¨0¬‡ªÂ$­ÀùÄ}JÜS±ÖMBµl'ëÝ$Lòv‚M`Ù9°ÞCÄÕ^7 ámaTdFqìåwË;É&Q…‹‚ÂN¢‚0ÙR.ix»]×p6¨ÇØ`iƒÙ°Á©ÌÃßQ_J[Œ¢/áXæ ¡Úܵ:ýáBîÑkÁ_©ò<.'Nù¸R2"‹”@…Ùõaã&XÕºwL@Nâ¨áÎ G~‹Ë÷2Hæ·†•/e•%úc׳*p‡âËÖ*U±V)¿½½XpUîeI@²T¤Òž4“k!œ:vU¶Ô}ÚÜë–O%*ôZJÔd,O{¶˜>¼!ªÆv|I¾/V2šp Æd©ùËZŽKöÚ÷LóñÜ nþº]8‘ƒãFG’sTí¹lÿßÆûzE÷›¸o·ÆæKÛƒËtY¼{á•q‹Ùå{vàòpm·o·Ø–dðÝÉÿ3Ú½:­ÿPK=ZþÐJ rabin.hÝW[oâF~Æ¿b6‘"`i£ÝGH#p.ªB\@©*UBƒ} £µgÌ\hi”ÿÞ3c0à%}hš—ÌœûõópÉ<†Œ §Ïa8ûýÇÑìÁ»D*ãpÌð®Ûmòû‚%൯=ï’ñ(11 A!ûñõb’)%«Æ5,Á½‘ÿLBÌúÁýã¨9›L‹0l¡‹ëOdæE UŠŒéœñ;Ã#Í']’™yÂ"2•4‹…%§S2B÷ïgØxo^Co2°éUL_™Xã=Ï˵º^c-XL9ÓŒ&ì/hF‚+0¹ByDQ-¯ÑxKgœüDx¤3‰i ª÷înúÁx‘ˆ¡Ù7‹Hˆ1®B¦ÔEx5×­^!< Æ?'œ‡‚ù4Êhü,K6eʇÙü¹UØʇXJ—ІÇÍ‚OÞ$h#9¦À1ü­ðã9I¯1"!/X˘jhŽ)E:2éä=pT [C¾ìÃ[rˆ NI` É.:gåô V™²/Ñ+•¤Íi e”Ž»]Ûïã A®ÖVzŠ÷qelgNgÚQ}e}ßI‘†GhÒ †”I…=FFв•­ÔðÊFõ$b“UW­c…_ 1uA±Ø%KáË òŸ™øzÂÄÞÈMvÑNv‹lgö}']êá8ý|Ô? ÿµy´5V»!™" qw7n^ÇV¤ãròÞ{UˆxäkšÍ¨‹ ¹S!ÎŒ‚’H¶ÆÙ=€’:gÿ¨tTÜß#;]QÌDÂC†‡ÌVxXÙƒÁƒÙ¶r/ú/ñ7ØÌ™Îá°„\ùW¦_± kÎé•¢ÿ-8h™£*zþÝÔj±óÿrëö'’Q‰|ué’f¶a-‚üÜbµ©¨Þ¡Gš,k0µ³ÓxX ~«ÓòO&Ñ,ÃõÄùX—ý^äf¾‡Ç¦¦§±0sX–¯Ôûðð­œp¾v{ ðhÓ­±rukP4³ºê¸d¶(ê`ÌSZšH„;¥-vç‡<Æ—dâH~²·8µ-Å2•ºpª?䯸ϟ_¨d”ë ›ÙéWØö¡Ö;®;(>ˆ›¬Gò4¤™Ýir“&S4ôÇÃÛJrÁdïy7 &7¥\'¸Åô«>ìöPLj]à˜»ûCÕפêk²ïëáÈyHQ EÃÈœFßþ 2V8i†åŸ³„éMñÝ›<ø_z^¥º˜Î³„7–uKn»]„R×™ó·×sz¯èm¯½ý‡{0â/à1[xPKË=§Á\Á randpool.cppT]oÛ8|¶~Å^(¤|(m · ฺœÑ8b§Å=4µŠK¤@RÑùŠü÷.)ÙŽÛ<ôŇ˙áÎJ'' ™Ìj¥Ê˜×5C«…µ(P¨KÆ1!Áu³,‡LUŒå¾¡€ÏL''pOåªJ‰CG¬‚\•¥jýÉ x” ò­˜ãL¯S8ÏãÿŽò±ÀŒ«yBm„’pŸ°PºDr¤±ãéèiÕpôôZ˜•£püØ!½Žª@6Õ’Ø€å5Ë,U“¯%ã+ÛBð*¶Åy£E[8¡FJGB< mVR/„D(Å áë´e£8þ’—M†ð¦æE\¼qH.3Ìa|ÿo:¿KÓÅdšÞÝÏg/k·=§;”¡ÙLÁöB[Q¡Þ?9(..ƒàv4Mféhœ,®’ëÉm8ÖëÚª4‚`—Ïp¸{£`0„jQE] %¶0JfÃa"¹;K)DG´¿Âõ m˜³Ò`|V†¿sïúšx&þlj¼Z[4a}|Qg³¾Ð=þRùOJdðÒçDr¥k¥)´DZ­êuÈ•4–Fb<²nìbZX(Q>Ú››ý3:=;wsS÷?Ô±lüþuý´Ñsõ$›Í¿…dewÈ_¦ï\€ïÄ뮯Q¢³<‘V]5yŽ4¨sÊÛäJW̵4|†·–éG$Ý-͆Ccµ›Ä·¼`RbI[¥3iW‘Cèp ï(LB<ôÇÆ+aƒÁ6àãK‚¾àz¯T1wC~´>n–ßœŽmé²ÝÈ]£7Z£´~û++ ][ÛAßMÓÉM²ÍfÉýÜûRyhÛ>]Àûs_|îØ¢~(FpHZ­7ä$)TÛ«‡·77¿¥å¥>ôJ=ËAîé~褼R¦èçûO]JµâhÌU©øª?ë)»a#g²ûM… ߟw“Ø•uAÆã.´´±á6¿Í«@;J8¾p€[?Ó'H”ø"UBŸÝ¤íÞîäö3}LPf"~PKŒ=•*iæ randpool.h…SËŽ1<ã¯è]¤ ´(‰”¬"ñʉÀ¸ä4òØ=ŒÅ`;~,!ˆ=Ã&KD”›U.WWW·›"—s¯¾%›e’¤«áb’,—óô i† !ñæi ÉJÏî™9jWŠì±¸ƒæ¢thlÉbøuºN†ãi:š>Ï­q|¡’¤MH¯w+*¹ÚK´¥JÒëÜÁ¦XIƨ„ Á[äàlQ¢¡¡ª«¶†êB0øîi)Ü‘4´EÏ•©4!;:´@ó`,"r ®@С„+`&™2ZEÅ©tFéc« ©kÿn}2Ÿ_|F‹Ðí³2”­±…ßghžkgÊt_oʃ"ÍJ$'Rƒ}Òø#ÔjidQrLåM/LIëàdÐy#Áƒ3i¼(Áoy¯Ù±m詽ë‚?1uP¢Üº"Ô«ß^ÌâL:5òyŽù&¤fseöÔ %[·axpÔl1×µ¬ãý¾u&FûÀ *%–](ÊðªtÕa¯A2ÊvjxªÚë —‰8´Ç8Ü«(×ʆÝk,$ €\ÃBî*qk 6ý—åÜK—©H¼ûZpº‘ñ…ùè™mÄK „Ñ~?¯ƒÆÙ¨Tl÷Õ»ðáý'ا;<þÍy÷1râšÒcs©væ©âŒ…íE‚®ƒËÞTªktr¼ýjÓÅ$üR”\ääPKŽ=h¸XHíC rc2.cppÕWïOÛHýLþŠ§VNqZïÚ‰„‘"”Ò'ÄU®³«‰9N j¹¿ýÞ['$n+ºo'±$žy3óæí^¼<ÑÏ“ÙLò-O‹ÂdgC™ãÄ %ͤ™->ÓD†ÓI Ëç;ù`R9ŠÓZí4KÆ‹¡‘íY2z>ÚÞ0¸b˜¤ó¤j‰ó›,ž˜9­µ³î›ÞÛóîaïÓAïÕÉ™s˜ßÍŠéùy½Vû:M‡28ÔÎA<7λ,™ä‹¾5Å©¹s’i6/PWaäÙsçÊ"›§7™m Xú&s¥ô:CÂ÷ñxaÎã4ŸËÓYœÇ“y½ö½¶ÕÏM^`3žÚ˜›bä”Ñõ—µÚÁÌõµIŠô«Qö¤Œ~þÊ'Yaa?¤ÅèÈ\Ç‹qá0W§Ó[…¬Aë®õŽ»ïúŸzÇǽË“÷½O§½?û½³W¯‘l+½§’k_Þt?þÖ»¶µUŒòé79ɾ²ön~³˜˜¬p¶IÙºb!c[@Y·)L.æ61f8—I|›N“mÛ鼈 ¼dìÌdçr~rÑ=è÷.u³u@Û–V¡«´çê íªvËÝtµV®Š”«ýЕ{¾ïê¦?åJ¸ª›j¹ªº€Pí[m6]åÃ%€«Š\‰ðhW°/!Ü=ûðkÁßoiZš¢áÚ s@¬°0,…ÕF%-TèaH!øÔ\M¤õl·|¸(˜(”ZšA# M šìI[°!«±!T!ÌCaAèjÅ‚ÑpSÈá¡ÎT Ü‘T¤u ¡èÆP¸‹&i… Â5Š—û‡»Â~ß+TDÿÈ6‚bU¡ŠÕ:l{È,(6Â"u¤•ý“ò0€T#âBó‘ƒmÓä„Ù5>I›À ²ÛF™‚p°MÛˆ `ŸîÕ Js |†! {Š•‘¯¡Ð‡„°“³ÀUa0]hE7l·ùL Qp Q<øÑ Û˜ˆ`iÊ‹Õ¶Ji1;Ì-¸Fì@ŸEz°ûlŽZ¡á Az—ê´Â…k“sæìIµw4¦›pºS¨Ž¢X•Ü¶\ ƒ´yw­Ù?Y§6X8Ï ©äÔ(t¤DS ZÑÐ’=fdG ªÓš8ô03¦£Y ü¨ Uƒ;…jT«¬‚6yÌ8{˜CÊ ýR<^Ô'ÁÞÛl’vÕK:ñˆ3¢y¤BŠ"µ€U´qRT(‡ z58QL…æUèßózyk’\ÖãiòEútÁ+ob&ÉìÎé»bïðŸ.Þ×Ó\œt¯Üy)é."ñ±³Ã;°™òBZÝOžêJv„_Ê«º<ÅåÔ¼"håq!´ráî„uy!²Ú÷ÊÅ8 Tö÷Åq¢FÅ÷IT¯?±=ô/QRã"Ú¬dm{ ›{ÙxìïyøÝhü¦<î ¿ØÆ@6ã´Û (8-Cû—úYÊÎûá»»Âúîkµânf†æZ,ùxou³áù¢Øý6͇GèÇin}*¯à4³¶Õ·4Þ.=ÝåótQØçzéÅ÷oYƒ pFÐåø Õúu:(ÖYBׇ¥°4–__“B©€R#»8I+rø¢x²ƒ1&ñ7¢HÑ@ã¡ü~z€- [×=ɧÅø8½5C‡5)›e ÑD[¯ñ â­AT ¢ª hJ/At â[U‚xQk]‚è*¯Ø%ˆ_‚xD— ì­ü^‚ø%ˆ_á5P‚ð ¶'üø!ö›ò(&¶dìôÒÚ*±– ÀèmõÒ¨6þÒ¨×Æû~† í9ki<ˆâ×ùÞoªðÈü?T¨š”á~)G{¼¿ÿ;å¾4~æŒì6~eW-•9xK£¿Iù†òªV !£ 1æU1® |„ 7ŽE^=«†q´6h^= +sÈÿ£ ×ÿ¨ôÎŽjÿPK‘==\!: rc2.hÅ•Kã0Çÿ^_En±ž½‰ˆlsP·N‡Ú 7Eá`Äô© ¶iIRçN|ï÷¤ûíéyÇŒAžæùæÉçù&Ùá¡ $ËÛáx0N.;{“Skc\Àë°åÔjä[Èc°jŽeípÁâ<RVÀ`¶•·cwqʶ£4¾Ï¨¤‰‰Z¾{á†nÇ›{'}¿Ò‘³L§ÃaWr>‘‰¥´Ì™&fõ¾SÒ Y~sFzü ‚c#?âß¡uض—_®©äô.†3˜ƒ¸×Q«~`“:þöÛÖ³UZí©3ðGc×Wº^Ͻ:O¼^ÏëŒû×ÞäÌ»=÷ü“ñ)9"õ¯{ûÕ·Ò.Ü›_§(M5VÄR¡4a•¤6*Bn|ŸJ®£Ä§ TªäY‚Î¥ eÜh¹ùb½4 ‡´(‰$„GåHë¬á8Óétw < |—¥‰£_.e*¦v#Ä;F¡-‡¶-S¥ ½5¸%ʯb‡gÈnÊò„)1Õ<µs0¹»Çç9¦ Öšý$‹[Ë5ÚV Eæ“V©ô˜ò€\ ·#ÐأʜÎÝL©å $Æl’ Åï„ Mâ¢ö‚£AvM㆔KE>nRÕ&êoe 2Íw©¦nŒa³1D=Y?½ú8[ÓTõƒv¥Š=ÀÂeªiLí…áŒ×FÀŠý.&Ûä`¿MΚ„`¿à)£xœ‚‡hãB«dzù>HO° ŽHõ-dC™2PÊÁM*‹Å·¨qQÄ–€æÁ§ÅL{1Ns]ŒšÖ…ÿZØj¡yˆÉ\ hË7]×ã‚Æ-Ï/öÑø¶Ixí¾µ†9q/Û‘Í Œ¶z¢M#ñ9ZÞ«CŽ§»Tz^X¸H˜Ï4Îùa»°*„!úŒ?.î¬÷´mrAÐöèwÐ U¥ìm'â))Û?©%m4;û1Ë®·f‰ ¯Y®5–,7"—åo ÿK–§že`žN¼í ƒâx=jnOÛ`ãõ¨¹ùz~ßV­PK=ð(~Vsrc5.cppÅUmoÚHþlÿŠQ«;­Á¼8QãJ¸á(¶Ò©Ek{‰71kkmšp§ü÷›]Û`ú&õÓEJÈŽŸyfæyvL§2¸hi -x’<Ï™*BHc°¸€·LóKÂCX /z½kš±^o%‚ˆ,¼cùŸlO‚Dd9v3h<Ú°¿ºÑÙ>f†3£[öžÆ;6§\fð{J%Ýf–ù¯i ²ŒÉò9§LÜç)²-×4 Ü°|‘ìD˜ D¸Œdò4ÙLÄ•B &•áâlIý˜µg쉜5ˆl:–fÉrš£hE78ÒúÃ_‹Ün&Ãõ+tŸýKæ\8oΧ.àO§[z_ePh›DÂS"ÃŒÿÃ~ÎøN3^±óËË+ÿêGŒï~ƨ4\yêA²!½¥x~"v€õî–£ÛÁGRJ×\µ«³²ÁYY®µÃ7Ò”IÈè>ƒÀs€oJ—<¯kw,¸Ž“à±_{ 1 tE”…&)˧“år:^g£É`¶FÔxaCÜöÙ=ÄB»mÀ›P³¯ðãïî'l±”]Rƒ“ÞãÂC¿´NÍL,÷¡Ù´L£ÊPùÕÿ-ç4+©U‘ƒüÔëÚà{]÷™æŸ7*‘êêY'uqÝ÷i‡RB}ø¡ÛkÐcOü'<ª_™äñü™…„üÖŠ¿>>W÷×ð11ÖÀ â¸Má;&ÚôÕõ6^ÌÓÌ÷) Ù´‹hîÊ|—÷õþVÙ0Å×JÌÆ"äT¼-°n}ÓÇ"èõæ2 X¦¶íc"5æd׹бj¹‹às‰´Ës²ËõÙ*PjÕ¿Ú•F–æò ¡[·I” š ×ÃaHYÓ"Ô"¾šEÀTdÀ»…GÿptÔQScä¬ô²æ¸²’÷%þ91²š~ömßB…5ÙYƒ75¿ö¥Ž¡']ôåØ2*OŽŠ´¨º©K>bÿ“äm&Bbý¢ð_¯Æ÷ôTUZÞYM6©dó[¥A6 zŸºGí5€¶JC± ðµ¨ÈÑ:,ššÖÊ_ýøu‡ï0ó?PKŽ=jxÅÃcrc5.hÅTmoÓ0þ\ÿŠ£•P[…††P"õ%ƒŠÑFí !U®s]¬%vd;teÚÇN×7^?’–îñÝswÏ]Üà+‘à †³/ñÕ4Ž³áùâiXŒ ü&~» _W ˨֎÷ ÁN•}S•C^¤¨F’•9 W¼®µmü~r“éâúª?¸Œ`@58(Æy‘»!©Y’­S—Ôjß$Oà£`©q2Gcånnu[n B»Ô¨,æA)4¿˜²j"Þ£ÂNÌkš•S®4<-¨¢¹nYÅj…’™ÁÄ%;¡P=Ø~VTQæKT W ª9Zß9²ª‡`7‚ô•›t¯ŠÀ»‚ÚÕNÀ.&‡“šÑŸõ‰;’ÇŠõ;%b%jÝÉg©ªü'bpQa»¾·àÝ£§÷hËÒTvkëÕûWa#ü¯…ííVÿhu.¸ YMªªÇÓ‰çT Ýá~p»‘½¿„¢C˜í1tÇ>ÌeÞEÚ w»Ngg8q;p8û˜ñèŠ&#û|¡HøŠüPKŽ=˜:(JÌìrc6.cppÅVmoâFþŒÅ誶k0o‰’(N"F¨„rz'U Zï.Á‰Y[ör ­òß;»~Áîé®Uû¡Hvwö™™çyƤ݆˜·XA^b_)!JQ@™ààKP[ÑÞ |<ÜQÜñ°TÂÇ0ä‰ÕnƒGŒ qGø0¢þ Ü]Ÿ ¹hYÖw¾dÁž x±mkû®´¡sW6v~ÂôŽ5ÞŽóáõx}5¾™ÌÈu|ˆT8ŸÛ–õ9ô9âŸ÷zW˜·×[I¶ìYð…P?‹a¡L©ÔŸØËÄ”¦Ïâé@3£;ñ+ öbNý8"Ó]b[Xµa’ˆXá¡Ïs*ä£Ú’ô¶íZV-†Üuî%O†’/·qø2ÙLäg}…¤H’ç'_K–Ô Dk&^ÈIÄÛ $Š*ä5­[Züån·Ã›ÉõzŽ:¯Þ…èžuÏO§.à ¹ÞÑÇüÅ†æ° cx cžø¿‹o#~0ˆ—âôââÒ»üâ‡o!jW}nHoZIÏ+d3Ì·XŽn‡ŸHF]cÕìÚí•Ý•íÖ07B@D#CB °AüM¦Ò`бj Á®‚=÷ódï! ÌdDúW(’–|:Y.§ãõx6š gkŒß9´<ñèKb£Ü Jò¥züÖ¹Ç3ºQ%Ý8)Zxt]xêgÒ鞉í>5¶UËï?éûù÷f÷9Õ:IA?tð÷ š$Þ?­ç$•Ù³+y±SwµÂ-BÂú ñÆέÑcM[ø*8ºÞ8TÁOþ«à„|=¬ÿ•ïÓX·<écÉz½y2‘èiûÆ&¦2ë¾4{ùp§›¯Y¤“­Ã½2k;Ò£þ—Y©'‘Š ݲŒb¼Äq°ñÁ¢1`½6F²ü6¡6ñl4)ᚆ˜è6\òbÙÕK“ wN2uKÐâúýß iUE>¯Ž¯ÑEÎÏŒHûÊ1×ǼtLKÂÑåìmTìXY•ÎÙÃÞQŹ)Õd§.hÏíæš!ç.püP:¨ÔÀ¤•öY¥ý‚?´9JUˆT¥ò­ìˆ‘øŸÑ’û?û"“¾™2Åô—#Õ´Xvî¿ûÔ8öo”áÊReâdRe©`—¿1[æ–ظ¥™ÕŽØð )(ìfh3ëéÑ*sG¹hnšNŸH†¯´Ñù7n9þ¿ ÖŸPK=Õž‚Òdrc6.hÅTÛnÛ0 }Ž¾‚K€¡ ¼¸ëÐ>$™\Ü.XçI×mÀ€@‘™Z¨-’¼4+úï“œæ¶ëãü €Gä!yH«Á—"Á% §_â›IϧËù;Ò°ø3LüV ¾.y†¤åÒà‚ee‚P×ÈîqÝNëÇØ"“ìÞ¡$êgqÎáÕ8:ªuad7-§ÿæDU2.ÏX,%t (gpÉ08¢ÿŽ½×·½º¥ŠÓE†ïq}âΤöÖƒSÎÎÏõšÊR$ºwvGRÓ†{ɤÐXJ´fÔÏî¤â&Í#šãIšR ¨ÛÒêÝ'R3ëd+©’7gUÅŸ&ÓQ—ô(¤ —oë©1EÇ÷W«U{…<¡¼ÍdîkFÅ«œ+%•Ït;5yÖpÜ=z> ˨֎w/ÂV–]S• C^¤¨F’•9 W¼®µMüntÑd~{Ó\‡0 ÷œã¼ÈzÛ©Y’S‡Ôjß$Oà£`©›q2Ccå>Ùè¶X„V©QỸRh~'0. dÕD¼g…˜·4+1¦\ixYPEsÝ´ŠÕ % 2ƒ‰KvD¡º°ù¬¨¢Ì¨@.AUs´¾3dU½íÐ7nÒÝ* jw;»™`NjnDÖ'ì@+Ö•d¨u_$Ÿ¥ªò‰ÁE…mûހϞ޳-KSÙÍW÷_…ð¿¶K´]ýƒÕ¹ä‚f½0ªªO"Ï©¸Ãýáv#» …û0ÛcàŽ]˜Ë¼´îtöœÎ>Ìpä¶çpö!ãÁ+F#û~¡Hø’üPK=Õ •_W rdtables.cpp}XÛnÔH}^E/¼Êß/Aû!BHF$ÚÕ*BÈv·3^šK2ñïkŸÓ]=ÒFÇãºtuuUã9=Uû]›•ÚÕÍÊlƒàq?´«½6êÑ·vù|ùhzÒ Útêüã?‹ë‹Åç·ï>^_ën¬œžª¿ÎóPݯ7_êÍz?è3uÛß™­ªÕyZ”¹º¯7C?ܪû~·\ïwj·ì·ªÛí®_“ýýÒ j³výW£V}£FùÖŒŠkõu¿ÚfSk¥M³¿U¯ß½›lÌÝh3ù»]ÊXm´ÕývÚŸþ=¸[÷ZvýyŠóo óÉÓàGð3._¾¿¸Z¼<¿øüêâÍÛË'ç›ïßvëÅâ鸷gÁµ oŸÔŸêJÿŸß„ñ‰ #ûI>½¢¹B2 D ñ\–N ɯ ¢4*×ÚÑSÃŒ’jüèñÓL.t4WhF(A!ž+ÀÒ)A!™+ˆûIiTxvízØîTó}g$©gg¯ê­9;»27q–O~jü ùþ¡hq-pmN¬¬›ö~È\»éÚfN–„Ów$àÃ.övS¸§5¬‹ÜÉÚzú^Âs[A¦Å² OSXw¡“Õ>Sø„uÝ9Y…èkÈ z»†~`]a¯±Ä’äÓ÷;ë ×¶"ãJÙt5¸v‘“ص.aûHò®eF°^›8Y‹ «†ðYÕb‹Ñ—È­‰Ì ‡14h~=d«ä·H|F<9œF†ÜÖ’— ~hhDÔHœ1|úDvÊTìðTc×!ã”ó‹ñ½C 42©‰ë·X¯ADIåd)d)ì2䨕³Õ\QÔÐëÄgŠXRœm‚ûRò’òÌ°“9Ÿ|&X¯¢çRdˆ»¦g蕾Îà§âzˆ³“õî™Ôˆ3–z‰˜Öó'gÛÂ[È“ƒÌH f°¨pî)ê**ÄŽõÉŽe>årÈ2xŽØcr¶9÷„]¦ð¯e½û‹}E=ÉKŠ¬Ô`ï‘Ô„f…á²¢äŒ sÍjƒçPê3åéÀs̘%–©‘\rV!úŠ½É®—Z2ìcö&îsÉKÉ»ÑÖb—³úKŸFâÌaQ°ƒ¸KÉKƒ§Ö‹¡9wÎ%vç‚Ì ˆ ž­ÔYÊ.¬Ä})±Ì'Ïëåâ3…Oҡ㔑Xrä,EÆI"{/¡Ûr’qRŠÁÓŽ“‹ç.uãü4'"ª¤&*Äái‰õŒ¬×²^˜-æAö^2gXµd}Èù5¨WƒhSb“¯OÖ,bö”øl³ Ynט³Ÿ/þ*õC¨äÈäÀå8Óà€BÐHÊyØ&,>½lD;Šùx#(s '•…ÍYz9œ9XÊb]<;"ÓùØ`Úʎd·¿ÔÂ?’mëà—%{Xóã†Cã›Mú {›ØÆsÐUÚv‘÷¥lË¢ò£¡‘XŠÜB‹PÔ·ñQÓ¤b9#R–2Û#Oç-—¹ÄbI‡P3šÀ!ËÁá_Åó‘†ekf¿$$FÛF$h8ŸÆR »™œ->ÈC3G6i iWÎÛŠ Å¡êÇ0©)á7ô°VZj æsh¶¤ÃÌ¡’4Ô*ì,;Ydé› ¹Pà‰„’@XÖ–~ºº&0Ev±é]užˆêv>¾  $³-i¬Ô`úáÌÁâ¡’DàÃÇs˜!)åPõÔÃÄžz‚L9‡„"³CôÌí¡°4“$ŽDÓÙa%³6³ÃÑÕ3YXœ}R&OÒ®ÈÓô#È# ¤"ksKS®$w./µ…xm~×c¤oÚSÎNê3ê<äÕ¥%m®>Yw…'ωìT’Ô˜T*“½“[ÂÌýtsªCBWts¸'-"€’~z˜!|˜#Я<Lü‹ _;ŒÈjFzbŠOÒR«ŽÓBòI²B’OxJd¾Ø“tÜr_îµK^; ó€–žÞû×B:Á;‚].ç`A9ò¤tz=óPy¿Þè$þ,7£ô†XùÛÔÄ!þØöG÷éÑ}iï'«ÏyrtŸÝ—á±Á+/HrwúLuëŠâò¦a}µn¿lOüï)ƒ¹3µßš­úºÞµ[ÖƒŠB5E¯îêÕ~Œ/ÐÓnýÏ —¯ƒà±tßÿPKÚ{TB"yÕ!ÊY Readme.txt´[]sâF³¾×¯˜r.b'Àüñ&{‡ÔÚ^œÝ͹8§ 0¯…¤h$cöן§»g$!ã}:uR)- ™ž™þ|º§=ȶižüúëGªÁ¯¿ªAZ«nÍ4 ³­JjÀ–Y˜®ÌLMf+½Ö6ø¢3k’XuÎ;=ÕV½½cüß= ‚£X1´™Ö¼ÀŒˆªf; XY  Š,ÓqmU¾ÒåøY硉-ÿ¸H¢(Ù˜x©Âh™d&_­íÇ P¯ÿ+ß«|›j¥âp­10,@&ÎÍ,Ìõ\阷BÇr»Pêjp×RzŒúßUÒ^™åJÙTcšÍ3®Õ̤+0E©‡ÔÖš$V¯Ã¸xÂÇ0²a︥¾¹O;›ì&*Œçüï ÌÛ±òûáØü;ž‡::j©ñ༥îúãIK=n’…±+PÖYŠ´öºùß ?yl÷Î΃÷ ¾ŽúX'3i¤ÛCÚ íÑpÔ㽺/'GÍ•p4SÓ(™=U,€ÝQdˆ)£ÑNrÖRâ‘–úFÏ÷ìlòdÒ‡3bëuпm÷è@õÕ:™ƒÐ­$ÕYÈU£Á$y1à‡˜ë—òÓaDJt8xœ½“— õ™³¤ˆs·"9îB{l¸Ôu£mÌxgêË]¹æç?ò¼´ùßïÙ T¡ý˜4ñ]¢ÛÚ]æ^»§ùŸÞ©û~v.N~Ã/ô>z«Ð®Ô¢ˆgt"+ôκ½#7ò4KµÔ×ë›ñíÃçÏ·øÍÃènØîö~{ÝpÞŸz~\~>iЛd&Ы!=FÑl2j©ûíTgËö¸Ðiª#ux?Þ‘xZL#3k?émÝ-mA*œš¸ýÕ¯-Ìò+Ž{û瀣۫wkx{C†ôf&ŒsVÐá5¬¤F“›«{>TÎç¤Þ-’¬¾-õði0ù©«ž{0äsôÐR“ ?Æ-u3ÔC÷äüä²[è9ì_`}² õÓ™p‰_Ôïöªµ/x½É*\›ìg« `HEÙL³´=&φÿ3ÒZËFæ‘?³àu)U^ñðfØ?b‹Ðæj]D¹i§™žÆJ‘ŽQNÍœ:búimãdm@¬ VVh˜Øä9FGsò*Úl[N´Ñ«ËÃTèàSï¿cY=Í v¿+ Ú{?.ñàÂêE©8‰Û»H¬ÒX§%¿B%/oû#¸¿Ëêþ~Ö=bU„ZÐ?Ìuí›Ú`®Z~7i9¼w´R¾ԕ0XÙ"M“,/]é—+ü>Ç$ùr~JÁLàeéC9ã¤×žš\ ÆÁUóHg'=¡Îžl±æc Ýd¤™xYè¹Õ^ ¤ì&+Í?L†ÑÑÇjs„ñ2‰ fq΃>}5Píeßø"û¾ gêó¤œ{¡³'i1`7hdieft^1Þ¿%Ü 1©®ÞáüÏÄ[ò¥Øùfå[9þÎ̲Ä&‹ZÍXýJÇb‡µm3úr¼H?#T’öf‹p¦™Wë ŽøE0<œ&ϺEb$…0òm°J\ 4J•dLv  ½Z‡Ù“úš‹‚öæ"È_ÔËoþx _ÎO)HÜ}FN&C-ðõ4Ú2¦ò”A ×IŒWPnÑ·J™[¢˜Y·IXjðð§1œM®g¥©0] ÍJc± fÒÊή\ÜÉ1 ¸‘†-uÔÿ«žá¨ò`•çéÇ6›MGóH?Ù”£0m‚Ñ»`J˜0#X'”¨,õ1Ç6ªŽy—’l…<Ý–áCynüã5 ¶±AÖ?;¼oH6ÄjQE¼u2/"„­Ò4iÜf¦Û´ZÎÊ´W˜^ÄpöË„‘B©c5P€½³©R!§‚Ãñžé\X!#Ö æQDÌkœ*Ü#wYÙÃêä‚AÜÆ/m :ñÂ, ¢_³ ð9jZ5!xIQŽP†0í9ÒÕ{çB¯ÌÛUB.ýØÌ[?ÞŒ0„xAu´ÄY$ɈÔk)²Lé]i4k²Hv¼ôO΀Ô„ÔYÀ ,’Òré¤pXR[‘»ÏÄÎÅ‚ÓˆÔÞoÍâl3ȱ Áðúý"ÒQ¼¦·aëŠÉ0–ŸÒ,\®Åÿ#›?ÄáZÎaG,ŸxžÄ?“¢>sLÕ/t0Ceé)7“3"=/ÏgsÕ9a!‹¨—8KhˆÒ{=øœå“®9 <¼ë •)‹E˜çúy“á~av¼–cp𑉪K’Å”ËãXàÈ“¨Gc÷ªÜ}p+mXH3rć8±’ ïñ™¤J`wðY,ÁkÖ³z5ŸÄújûäwÅ3—ô JÀ.“¤IpF°nüLuV,êb7iÉ^“ZÜ…1@ž8n_èY(è9@·5à=¢ÞÑhº‚ÈX Ó‰\Óm ©8€×µ/¶•÷«Q–wO QÈ !­’¹„4‡d8¤!8Mº_Ð!lª÷¯È¸89ªE&v±XÅùíwÑRR\æ$àï4 ôÆyÄU†\&ð‘_@Ðoüð&Þ¢óÿ°'±&¼ß²c1yŒ¤€É=’ÒÜzqx'+uaØZ%ÅTñ'X™u{êôã•6øýQiÆ D}'¤#ÞìMBÁø´»“šNšl ‹€’Ås™.Kà„(­L%Sʳín X‡†Íb‡“c[Lí,3Ò[P¿Ið›±$9 U£¬ey“£^"œ¦jZW•pG…irE vÆFC Q¨*(^ߧ!UT‘SžÚœ+E6J"ðúY¯ù jë‹hTç»4føö²*6 ç«ynb_¢p¯¥ <žôÕprÓa·Ü®Œ¾ê¸¸˜¸ë5º­špÓÚ½çåöWòæË9¾‰ã¾¾ž\÷å®­Õ¸ûi•—µ» ·™²OÀ ™¤ Älé³Ú4]VÕîZ¨xÜ!>t1q ÀGõ^ÚïÄKr$ˣƣ˟-ƒ-ǼÒM»Yw&¦ËÃb §m^cÈãœÏ¤ä÷!FÄ¡–—¢À^ÝEqUÎÑDj€m€[Ò‚pÝÿÒ¿-¯¹GÃÝ,ò½7_ŒQG±¾J¢ù†ÊñYkÿÕkã*É/E¬»-€¸¨‡&‘2Å”•žJ¨!_n’u“œpë}:\Ù1ËXÊ÷þR!V®£Ë¾ÑáSL®Ï–\gµ¡Zl¼”‘î§^é8 $T¢J!»$âH0ß½*Éh©1¹ž¸²')ßÜ`hž{%Ò°6v†…±&µ¢Ìiíj—–ÄÚ-ùåú*\ÛßëRGDûnÈÝ®Á_˜«oŸÇ,I'“²W`쮃wdAªÍ)\"~\×쉭‹¸ý>ÉÒ­6é8O@­vCvNHÌÛ¥ PQ‚¯6Ý /%Ö9_„¢óÈ 0ŽÔÈÞYï0Â`é¶^<çWŒþgI&>Ó»µ«€JIŸ8Ò¸GÅBsò€$¡^ynºêã–½¡0l]êÐw{¸¨r´oh^kšëR÷óÂî ]t%¥ç{g“gH¥ŽmkÖÔHÇK€%BÚaU‡>ž6ÙN ç7—*ÈG]Ú½îñ©:”pí!»kLˆ|gAYà…–, UˆXsÆõ;ñwÿ}»=_vŸôŽ‚²AÃWñæüì¬×õ+dÎó~×Y¢žâdO»” [gä2\Ë- ß{ã ’óHbÝ a‰ËØC‘KÛ…W/ðx/“ùª+eDeŠìëкårxÇ] &;âB¤sž›U2Ì‹‹{ˆ?¬Ãæ>Bö¨0 …$—Ïu±9çäd¬*3Šƒ*5à7”X4|}OÚJê½…ã¯Y©³å/ÒãÓ“Ùá†bCt_²ãáÓÿL ä“Þö}¿Ï™­‰k·ÿÕ¯7_¾ÜP‘á5«…ø6b ¯Á%:êV-•Äß_3èàÅWÒæ¹ì- 3ðˆB%½'©Áõݽ”¤Ø}óÒËØMÄ·/^«°§ªïbëöâšwjÚ¾ap'osÛX’Ý® ÖÁƒË v¹Â®{Fö9…XK•û¤Èáñ³É2®§¦ÂZCYXÚƒÄ2&eøÅœû±¿áFåû5é >ÉÙ¸ñjðÏ xÔ ²×C2i|FpÚ6 ÙeW<Â¥®‚¹¥ˆYÏ3t(vJ×äñÑþñäÙ‘·TÄ’½V±\ZÃ|wÞÝ^ÐÃÛmÅtθS ºà¯Ü;k¨Ý"7D™ùŽ\§†|Õì†nwaR6U¶­ Öž¢ºî87Áwqº $P«OïøÔ«k‘ÊuMšáú*¨ÎûR×Ïk]‰ ¾¤Cìw¡­¥˜ëÃÈ„;±’à+Wû.õ}_&¬¤5¼‘Œ+4à{÷Z¾ÛÃBlv$6É(ª„ëõÙõV3Ýzϵ4c ¨Þœ¼â)–ûQ ‹T¿°~„pDëoñ‘öƪ{Ü;US“¿Â¶Þ®.{÷¢,T» ³~ÙŒ&¹<¥ ™aN3Œ`3ÐY–d»gYh™uŽß7±°MʼK$¿”™°ßÅ¿pM»Ó©u.×e²3”N¹! ˜ƒàTR#Ahe÷¸o‡oUûµŽèf#tÕå\3×oº}Âåº|9§u=„õ×°Ä4ýòo|ÿ`EíŸw©ùÖ´ö?nM+;ÓÚïïLkÿ 3­]ïLcJõæ4ÚÇ­‰‹~s‰ˆ}1–3ßÛ£Vs[5§> T·™©Y»Ciî’ìž6Mí~¼’èþP¬Óãƌš !£µ….÷Q UÕvfÛ-,ॠԣYƒÀ¾=µ½À"k§FG`¢)P=£ÖA3+‹|ßè*kTÄþßB®­)‘¤‰¾û+Ÿð e™q÷›ˆØ vä଻ûB ´JÈÅm`FÿýæÉKuUÑ8áBwuuUVæÉËÉK©1%ª"¤)Ÿó>÷#ØäЋ—œê¡à±lTÕÓZ›—X/4Å% lÐÈ,ùÒrX,¥?r»’ZôãþMê¬"ê(Wóíóó ÑvS*tiƒã÷Ä×^\Â3Œ$QRãmyNçÏå#£õ}×dšUý⺠¡¹I^þIºû[d(6~™ÁùjaÀaÄRÔš˜cù@ó‹Š'­µ¦‰WûÀ€!Fhð‘Î/.ƒ.Ú‚–HËåüúåõyJ/%äˆT4ãÎÞï‘#æ¶Cq¡OZy‰:l0}zuµåÕU+Ö°r¬’¡ÂldR©/»OÓ•¥FÖƒöbf$Õå*dšÃ¿·ýÁ`ÜM:½[ú_'ͯwÉ°57ûÝArÛ¹îÜtnÿFíC¶æt²`¸x?,!1j––V;ù©Fóä\a ëÛQÈP T ÀÕÕm¶[qtð7DŽ##7úÚüA/H‡i« ŒT\Ík¯CèŽ#@†.Ko¸¬~®ž×XÙäØ ±á•%‡˜2ögÆÚ°÷»Ïî ý£‹Nw/ ‡<ä*‹\‚å|«!^L Úµ%Ë {%K·x³\¨h¼š·öíVSžN÷C…3FÌ8ÜÌEv°tUïØXÑíw“ù¶Ïú»)UÃJ^a|÷cÂJë’r¯U©Q·ZÙ#ÒD\¡%8vhN©•?C„[ÜÔ-ð U(}I@WꟆ8Ôr(óf™¶”R©™>̓ rxWeN³Î=N —ÊZô¸§ê{ë)Ø<`j%S¢]…•¸Ò-زK—Œ¯8öÓÄ ¨–‹D¡â³§y–B8qþ—i&™Ý3Q—ª¡Xðú[ÊbX Òwú,‘áqhóoýÜððQÙWèY\µuSå8@ˆ¨½&Ú—¡6' G¯¼xY¯>•ßð´×# hp-ÔOe{VŒà¢kMÕÁdn™æóm“f(L”Ÿ@å&÷·îÓ>“î•Œ|ú>Ygƒ½e+L)äTéyK‚¹„D^´èÊ,•ŽÈÜ¢lpV4…2ýÜã‘2>Ñ Ð^iŠ(š­a÷=Ý}ËEÍB”Tji¥ôwóéó~Î{Ÿ]Xèæ׺ã_q)6ªÉâ剡“œ6êÆâ$ä>hâ׈„pÚаj—v³QN[¿×'½ÖøŸö°?’V«CXÑÇùë§s—6;¥ó1Ù˜B?‹¢Å?X’uApB£vš"£×\¼94̉r£üBmgs²ãbˆ¤*#ÌÒ? ÁÖûXJÇ…ÍŠ‘éÔ¹à¦ÆÂYÌ–a¾¦œf¥½ËéàӴªÆfó'/ ×°{ÖýÁùeºd\>‰F Ð¥2á^Aoçp‰Y⋾«®3&&ÎüêFY;¯^Bš¸qÈ98lѹtk4JNaÃ9É ë.·ò¸ò©#æ¡ó`}á5ºúÎ|‘Mð\¼3êçƒÓ°aÚ>gdñؾ)Ž2#0>ÀX…0@ŸFþ2žœ‡Ê¹ÊÝ% z¤mË'œ]ÐH¦wLƒW<á/ú}Œw¨ç ®ý‡Â œÓËQN/Ë_AúšÇìV\èpyöI^ázMÚjòwÏxú¥{:ÚÞ¨‡§½‘Je^Gåyïq»ObÝ$-— Ù"çîrQ¬ ',Z-e½—t¯=Ä„¤—tó·•ÂnÄò²).&žcb'{é6³zRéT¸ëÀ/_z oÉúÍj•Þ¦Pܤ’ÄÁÑ¢6dŠªˆÎzIJ:œ¼GòHt,•¤“3v54ü<å2VQïLWR~ˆ­õ¶ÒÃbBX+7AŒÑ{߬$»[jEëÈP­‡4 ¸)ß Ý«ï²v r½.>’ãUÉýW{Ã*gSéÿÞPr (m03Œˆø|ó ÉRY 9Iý T4Ý<Û¢tYùL&±Á2ò%£YÚz°báÆOpÙÝHvÛõˆÖ6éô%'eŒ<íP¡4¬°w î—Àv…bDW@\~Ù–HC²~Ö,ýÝùSœYØ¢F:ÔHâjc@(W5äJ…JÇwéäù8B®ZêÊDÿâ¶StÊ=“ÈçܼMæ n ³²Þ÷óÇSMçC©åúæÁÎ")—Çêc\¶DN»uVóº­ñ¹æu­FÍ]±è&£.É!0 >JäL§«ýr3 É£ Edót9ÓDË‘é.q1Èê”Uš{Íðþ\õº[¨Š"ÜxðÇX»'ў£Jgsë[1Y¼mY–¯ÉIàfƒ™è¤K~àãšñÛOùÄ‚–ÊN„û7Ýqð@ê²¥4ìæ[lö™ ÇÜq¡±Ò$6%«}³î+àþⵑcC—FHù½ŒpÞ¡‚–`BRߌq—V0Ö]J^‚µ–_ 6œVåY5U®QPø‚ÂÒRK kŸ0ä À”&«äPY•n Ôi¶r„Hà¿“ˆŸM_^l%ŒÔ$ˆ?ºÝñb=}+#ÉÝÀUn€ú×'õkÑ °*aœÂÉ¢eèÊÛÿ›íÒèÚºSÀÌpmùn­ ÚIØÝV× , r5ìºͲÜõ‡­F}Lö¥s“\ß´É—ÆJõ>‘NÕ‹±E µ¾t%:Ÿ½£}q^|¶/äÌ^ž ¼~¯#ɘ›î·¿€©L¼Ñá±J§sÿ‘Ô"ã­­4Z° VÙŽíh50Œ°‡W^·ÿykþ!H“ÓŸú…à8Có“‚ûYJø®r1ØnxçòïgA*÷õ7¶Kú–©ŨÑ2Ùò`™=…á-ÍDl[ 2sjš5½´Í˜ú-r µ¡I 0#|Î0ã–‰ÀŽ¡Ôå°A|‰^šç4+Š:Ƴ Oz”Lò¤¯‚`ƒñõáö¹&)qßB£’5ð5íª)zŒs½F³§ÑúaûŠN›O•.ÎÎ##ÀŽz©ü5N'Ϲz3GK%+@ ‰.ݤ)>®‰‹5¢q½Xå\µ@RXZgŸˆ@·W-‚²"ꉜ‹ŒÈÞ4öÌ‚ößË‚6®‘Èn%²™ò·Ä ’í!qìuÞ‡š‰ÃGÚ{ÀZò´5ÖHUmrÙ€Ö*øåGwÒL!¼Kç¥Öd~ôPKÚ{TBo¤"lü regtest.cpp­Y]oâ8}&¿"j_@jg6¡ Ñ”ÉuÜÂPh³[ö)ò$¼Í²C»Õjÿû:B1´‡7rísîõõñõç, ¢EHͳ ²”¿~™ÆyH',¡&ôþrG®ë£!¸¹Gþ vDþ#}Ó2Î×ð8 ©ÈÁS8Ûþ¦‚M“mSÚÛþ¢vh)Q lNãPñ¬v”DÛ–—æiªX³,&Á¶) 1"¦ÎH@"%øŒ*½æ$!±j‚o[ˆš8A"uÏ;qelJyI²D*hL’Å“âWÊ ƒxÛ0U ”ü£øI'LÌÔ<ó9M25ƒB±ð ­DN¸*5),T³ËƒVIþÅ›ÿMeøÁN.Ã˯(}Ù7<ª(í…<Ñ2©\!'aDyÓÞQT³X|àÞðn³Ôê¿Î³Ôu†ñœ²Ðô蔉ŒòÛbÁ2*ê ã_£&2’±Àü%5m Ÿ¯:ÑÐüÝœH=Ñk£Æ&fý}SèÕ8Í<¹6ŒÚ¯C'deKú×Û”w0‹çíÓW0å”Ær‚4&,¹0îzãú3l—ˆÙˆ“DLRËS‰‚lÚ:@°Lœô‘’§ïßNKŒ»ÀÒÄÙö•.²ÕÖD6¿éúlYzɱe5ÕòB¦ôz.8Vû7}pÓ®¶ìoú`ÍÙ]ÊØ-ö•¼½sϲ,¢( I~˜'¡¼aÓ*|¹}}ÙK¬¾ð}}é7ýÄ? B)‹l&« 8”GŸ ³;°³©2fUª¢æTfÙ¬‘S”ÏêIxä Ÿ‚'ŸíSðä3_…g4’Dðæq„+ñFra¶«eå}AÈ9+1GQh>a…§Hžs ’"a9¨©2ñÇ4ã,€l>S˜å)®ãaé¿óû¶ö%Ù´~Ím—ƒ»[«..­ÆÙQ¼Î}OòdÅÏú0…éò¶7ÙÄÖ³ÕÚœ íµ.‹¶KëK«.­ÕÈ×qoój„pïn¸ÉCñY$¡õá* ö15ϦŸÙïÃ},¸í ÆX>ƇZ²Ø1÷–€¼ñ²‚åYƒàÞÖÆÃÕ[‰6ÁmìX¼Ü‹–ŸîsG}¸¯<–=;QÞ@}쭾߇ X8ò´±8$S¯oe ± ¿=£[LàÁ«# |™×JŠ\“h«±¨%Ÿ…ðî DÃÒ¹†ƒ}Ó|ÇÝ 8W’ªn[Œ–§Úx¼|cÕÀ£}G¤Cñlk×5¹ô3_ ¬¹µ­ñNÉäW‚17+ì»SLÐsŽßßMxK_ìüŽ«€s•çtÚzé÷ÜŸöµ nVÿ èÆrôÃ߀šòw@ÆôÚøÏøPK=uÆê resource.huÎÁŠƒ0à»O1Ð{UØpM²š£e{ V'%‹$cwKé»o„î¡¥›ËÀÿ&Ž¯WÆ%¡;ÊeyAÅíÅ1Tºwv¶ÊÁ3ŽvBÂ/ƒ¶pBƒ®ó8€6ý¸ J¸]·Ú9¤Ç ôî2y;M[ׇ8Z+†?TÝ2z8wã‚3(ëÀà7Øãö~^Y´Ñ*(Èv¢iIÁeÁöüƒ’57EM3ÂYyâP½óRD›Pkƒ ‘Œ~6ÞÖ9•û¬l)Ü_š¤/lΫ*cä‘Â[’ü£YSóòI§A¿Àá@úüñý 4ƒVãPKÚ{TB¬IÏf#ä‘ rijndael.cppì[ÿsÚ:¶ÿþ mï¼[Á†Pš¤Ý:à¤ì%ÀbHÛéËõ[Iœ€ÍÚ¦InÛÿý#ÉÆ“&ißÎ{3Ûi$}tÎÑù* {w—îµçXtVµ ²Cæ¾ã^¸Ô!Ó{Ò¾ ÜœúÁ¥å‘C{Î>¼»]¸Uê,ßww‰å9äuIÇrÉEàÏÉÐZÎ|rd4Šü—! êÄ/ftN½ÈŠ\ßùã+JüÀ½t=kFlß¡Œš5› l† Ð"®G"€/–Ó™kÇŸ[®W-"•eHÉ {Fvõ!Ù…ÿöèÓp<ͽ¯´±n~l6ÌSÍ8Í,õ‰|rI=X%leš¥â?–³{¢Ö”Ú>Ñt. ?ˆÈ…M7vú](Œ‚¥ÍEüâZ0{¾pg4€‘(€Q׫ÅÒ.#xL§@¯özŸ-ú®Õܽk6ˆ†t>Vlñ·VHz¸QD=\0 V-ˆêø[z0˜#¼h[ö•ë]VÈí•k_±é®÷Ìm÷Þ÷.¯—ù°dj]ø‹åÌ Ü¿øhÇò\0Ê?ªäˆ° üŠˆRä`ØW·Ö4V»…µ€î}z‹ë'¡Ý¢]‚µýÀ _TÙòÓ!Å‹¥Ç´Ã$³f¡¿r-XŽëÙ³%šœ€²ìºsäÃ!ßcŒ¼îdf9sËO*‚Ú²*«€R@°>ÒÚ™ºÈqé†\C_(’š»Ðý‹2çñ–ó)Œù¤˜C0Ù,¬ å oÝȾâò¡5 Ü eMg4dZ´ýÅ=räK¼¡÷!b‹H=Œ,û\5Ð.—×üxþ-ºj˜CاÕz½ÁsÒ×zÝ“¾Þ1;ÚX3µv[7 ±èÐ ×£NâXÂSkÍ}Ò¡Ôƒ`°.-ôMÁÊQ9 r+0gθ–˜y`"c8‡(íÄòà»p ‹j˜Yðé ¬0¯Í|Ë 7ÇðIO!è¡”L)D ÂÖ%%pF$—ŒÌ(R*¢Å)×2£0OLžÁjå*)?€ ƒ{tfÝCDNCú¯%ΰlõÉLÁ¦2±‰´ ùbW²ׄ— ”;c9Ü|î(kJ! ÅÂ@ãP z±œÍWÑz/#Ô¤êùËË+æË(vj¿‡¦vÔíuÇŸ×ãðøid¨ÆÝö¤§Èp2 ©à2:]£ÝÓº§z§J@`Lô3½?&Æ{H°™e¥ö ?uA@l1"½®vÔÓ9Xi§;ÒÛc\ÏêS”Òõ*Äêí.~Ð?ê°mô©d‘ P6ôN㤣j'°8éj ´'#ý#crdŒ»ãÉX''ƒA‡Im裳.Ô…ÒLcC¯,È©€º`˜‹r41ºLwÝþX&ÃqwЗÉûÁÐ è@ƒÙ¦äAŸ­”4}Bº¨ fƒ ³Ò{†F¨V¦8 Õa€Ûã%}ŽS‹%}ýªšÞoëÂeHèC×Ðe°Z×@L—3ÿ ç .Ÿ dãS¾Ê„A«’î1Ñ:g]”_àÁŒ®ðè2&í÷Bûèö|~‹÷/öUõêö\xP]IR‰Á1A~cs`c_™&—l1æªò‘í±Kƶ¯êÆPkëæ‘~ÒíKíà~ùáÌ$Êð}`k€Øðh0虆¡«&gjgZ·Ç¼ùÛ·xÿ %Øx +˜\ô¬9 9Hàðbñ5%0g¬%¥)“[¨.°“ÓÏê^³¬ž|/.C,%4Š¿ÑYH‹!nˆììÄsô`s¸>ê$£kS몘ZjœW>®ÓùâÏà/,`êû3šcz û=ȈoÈTZ(mÐçdûXi*mûG†p`Jic®-=☒ëüs)K™£Á¤ß‘ c@èDbUÈ´BlØÏÊ…ÿ.,òçÒ“`¬÷•"Y> yûö ibš Ô-;A([N‚¨òÁ)Íž.mŠÑùâv"7Ÿ­sPœ$! R’¥1-ÇÜäÏÊy†ãjÒô9“ìçLr6&Eþ´ø*lÑM'G7(ÇI‰|B£>ÛA×7i’\z•]Ç*û Rö¯#ålŠ "âøg”i8Ÿ…°kê8û‘8Gà¢UzÙ*‘RÈü¸gžBÌÓõ ßB®ó8rιص»† %pÜÓM6.Z›æ!øq"¸Ã@µä­;#èä|JT&쑦2·Bîä‚T’D‘ŸŒsLÊä®Ô‚ßRsÇ•ÿ«QVd9Kâôñ$Ür=!!¼z‹0ÇîÝñç;(VR¸—ZÛY?»%(gÈë‰3{0ržf¿´§üûe þì×`öÛ°^¡P@:O5ˆû cð,Äí…*ÝÉ„@&¼;¼~ ÝKÝcExé>£”†ìÃ1óÌš-éÐrƒüÎ,¯…03‚n×ù=ê]FWŸ‡ÇœÂÜä׿ ïÝm@~oàtTûôVj”¤†E§Å%)¸‰ Ékñ éF¿kvñJ©otÛF*.~ÿH‹#Ã<5Úæ™>’1\âý§Ò¬Õ°/Köc« †“é©qÖÆ Ï1†Jò VH¦–³ºê4çs“ÞEeG&]¸`z8«_QOÜ[ã a”Ŭ@zo…LnIá!Ð\ËbåÝÓ?£+0ï¨ÝÕàh ¿Uö»Á~·*|H©aSe¿ìw«a³Þ¬ÝBQù·7SÜm‡•Õ­G¿Ð€#1ǯØU·R9||A«‡x™Þ‡.˜µØè¨ 0Z®`šsàâÜÔC?joº—fèB¿$Åã°Ý^Wæž±£4eæàs:·÷RpS!‰_¦\ªp{…× z{?ÁÍçØ¿PkЬCUÛ´ öX40˜Ó C7Œ„d(0¨K®:Ä’Ø kÔËŠ ¯ ý4Û ¤*견lbë[_ǪçlÍÌs Êé0j7":ª˜?Á¿i@­›Õ$ŽG¤Ú`¦/d®ÔSÒ\Ék.JöÄ(àùhÊ´®‡ñ/tË5Èç¢ú;þ¤J²ÒÔÕ”4§{"T3â?ÏÔj–d}cͨÿ ö.ÒŒõ,`/¼ŠGkm/Gk›úJÌänEÊ«lË+F‘ûÂߺá±ÜZ3,/„Œ0gßoq״ʸÐÌÔئ_saäìÖŽ©€n@¥k=åF)Îî²×Bà‰ìÿ$ˆ(‹.96ð§,;ð7ßWÀºîÜF]çëòlR(l›…‘h´ ¼ƒâª¼ '4šð(uOÄÅ‚9uôZ½’9/Qæ'iYˆ>¾†âZ>ý*.d÷ã˜ÅOZb*næĹQ‚-þ‰>>ú4Ö…?ªò¹L1ß@l…)†wÛÀjÖBÔÆh]fbmIÿwÙ<þè4þ„,þ”$þè¾Jáy<.xÛó÷Cé3ËÖtüU¤2cœNœß6sîV£Õçêã\@yÐjrF‡Rø2øC ü{1'µbèfö¨Ì`eÙ¯q*^¸˜É³Glfû¶y'Z3¼Üá-¤[Rþ€ž60N½¥FN§Kç¥(-¼³&üêDÈ„Ï+ñ%D×cºwm¶œ{pPb×I§ÞrÁ6eã;áL’ ¬Ô5€ºPÖõu&™bñÙ•‰E¤ˆ™Å ¹è^çòI>o^§€×10©5r(%ဟ·rX¯càc9¨)êCÔõ)ê)õ‡8ÔSêi¼š…rmÛ|Š ‚[V¶Ã”LÝSS°úvŠ\,&*xB˜~®‰Õ²%=eâÊË1LWJqÏ+v$å'ÄR6ÅR~R¬ØûÔŸKÝKýI±b—­ÿ„XõM±ÒÞÿýi·$9O©åFü;¹ÀÙQä+b»yEnøø¬æ9ý€}õ—¹Žr=Öß<ñÎ;¬ˆ¶¿ŒX[æ¨â×_zaºy+ô€íM­° ’@“ˆÉuKÅ—€X{Ö´«9_,ϦŽÐ2ÓR(%J])2V!z,‚["Ñý‚â-éì6\F‡|¿V!k_@¿å¸Ô=^5=„²8„âácÐŽ Õ›°¿¤c1e)¬Á?*üðÃíÚ‘&}T køŒK‘ØRD‹mÒCU´TÖª‹îû Qo÷Ø&/Rxc5TÞh²F7ð›u± l¡D»»Ù‡ãÇçÔ —­’ÒøÉÊÃü»‰c·l,wÆ Ã­{n³^bà#­o¨¤îÂíÕÚæju¢[Š;ý§Ü¯ó-¸·¯5Zxqÿ&#Eâ‚i¨RSùPî–…%ùý ¾²&“%)èò˜Êp Æ%!œ}3Á”æüö†,Àmâjü¡Î?€ö7¾šÝt.9ÅFÒÈ\TB#Fæ¢2Ü)s·èd‡¨c@ï³SFÆvó`>¼«Â…E_\ ×âÓ,ÓDìÒ¨ŒØ¡Q‰;×¾<ÆÇ$@¨lüÉy(™+d.*Ù‹Z‹ö©$i$h$g$f9”sÍ»‰Ê3ï&*ϼ›¨<óñ/ÉØøNÄ=ÊÎNþ#šÞòäÂ=ž{òÄ Þ£ˆPà¦O÷¸i”=vªÙÃï€ò ¡‚? v:jäb`%¯`þ(uLöy˜:;A-x (Í&23¤{i³nÈ®®vþ'ߢ²–ÂZŠh©¬¥ŠVµØ>xscÈßÆàI{¢l‰erþ§Äþ§Äþ)±N¦Ä:?Ub;<«Â¹jù%¶Ãsp‚È/±žƒD~‰íðœáúªÄvx‰UEüÕòKl‡—Ø‘_b;¼Ä&ˆüÛá%6Ãõ×”Ø-æÝDå™w•gÞMTžyUb7^x0 Q2ÝDZL½DX!lâúC¸äÖ×Å×jñV’¿\ê✵œûÔq¼,ïds Ìf=?lM †“J¹Ãê~!Š~ÄA§†(N Qœ’Êõkö9<>^±mîOrö9<8ê|›ó:w›Ã#wK¸ÏÙËÝæðxÅíR“í–þ×÷9¾â ÅoÙ>å‡E`]Î-rkø³ä¸!Þ¼ï“Æ«º"££]{OÐe/1'¯à¾¤ÓÅËÌk箇¯}fßõ- Û"¡Ç½‘óãÛâêµÛ¾ö‡Þ!ló—ôkƸ¯‹ÅÛ,S÷l3“Åf–ðÕÌYXÉ>5Sº‘sw{[ÍÕ·=s¤Ÿà·ëá"Õ×íwô’+ ”_5[-ÄÇÁè¨7hÿa°Å?–)È`2ÎÅ´²H#5éÍ_IãDP0¥YRöÒÒÃB!3ÚLöôþÉøý ÜHCþÐ?üE¨5T+õ¸êéà¬|æþgÕwÊÔT˜ÏûÍMAaå’U™Vlö2f¨ÎûëíÂÖ\Nu:0B½óa0êáxD>k*Ý|Un•°RèÊåSmX’-Ÿ' Â’+è@J¶ÁÙã…4ž,†Ø¬mxTÐzÈ¡ãL­G8“Òü¡7©{Óý¥…žðCyë-)ƒ˜5ÔÌë´ÿ˜ v)ªo£Mó¤?i›f£2ŒâeoŒÔœ¸­;&@žç™èW?áÏðÁŸa·öz ¤„ÉieÅZ&ahg°=ùˆ£˜5®¢®%5ã  YýÌbêYŸN»b I%x,(°<œ:øvG¥!—•”=É^ÖOÙê)¦z§µƒâfý,ØÞö·­báÇõ¯€¯,“ã‘vª³«„;s± ¯L¨ñ$]èZ5lsz—iBÉ)ð¡“EàÏüË" \žË*$°ïDG¼Î ùû˜¾o˜¾‹ß}÷®>ÔÌ?4¦Ž›QÒß/ÍÌæ4=¯«clC±NÓiöl¦i…sÓ„Ì¿W Ù¡  /ª¸§™™á½YwÄóa“|áÞ¼`¯Ã¬×}|æveÀÕÚääý6‡ã½Ù=n5¥)Žd{ršÄJi£'Ç÷ÌTXëq6zb8£Všáç1ýŸöŽµ·m#ùYú¬¢EõHJò3éÁÍÈ¡i$Àg%2±®²¤H2j¤Í¿Ù×ÌrIQŽÓCïrÀÕ wvvgf籯ÙKÖdö…ÃáËÐZoD\“».ª:ün÷Š˜ãÇ5$•ÿ€\kЉϢYQµ'B$ÒÔƒ¤-/D§kÁÔ´IÊ5…ºNœÌîB<‡¢ ³yîrIXÿþ1kÝÝ܈XÿÝ«WƒCÒ@çwÂêv)®KI<ö?H aż§f‰a &^iÐÑÿäí\(*XM2 òÎòöiY7NÙ0Atb+?…wéimCT»tàgŒcàU$ÓP–ç®­p&7Ër!zQþNëß³¨ÕŠÁ°ÊáÓ\3\`âfRÞ”ÈÔ“Ø0ÛŒÄVªž8œ¿„@ÁÊ:V0‚.9)Ij ô#Ä*q”DiÔgš8¾sá‡~ £ÃèˆÁOJð‡þ8:‰Äì5I¸®—j™I‰)³˜'CÉWX5P¹g0AZê4+Vv§Ö ·4à ­Çã*ãoÎóÿ W ƒ%`¦'¨âC"LÆûB¸|Ь¾)Ö›q¨:T¿„CmÇ'ã8 Þ‡Ú“Üe‹yÑÛLoŠ`]ln—µ¦XÇoÜHÜ‚ú¤tð…S Ñi™„…ÓH–ëÕ,ÿ¨t¢A2+²;,ã¬YÀÁ¼€Ûk®’¡éœVÕTt^à ·»;l- ù4´¯k/¶ÌV›i6S™¬péÒ;BWÓN2DU —ž% ¨êIt|v$t| ÎúÂ6$\-XÜnN¤Íê¼Pcýi™Y©\ß"°àíka[8ÑiµD‹ÀÂX™+Q ¿£ É®ÒlhWs½ÒÌK®¡¡¿€'•Ð©-+<}YÒ/1¹PÎ}§¨mçœ*Û÷a}ßsÞ÷C‡*Û÷£úî²Fõò¸ÌÕÍ“ŠnrI©^&Q©n:ÎÀöÓ%8Ö¡L±–z¿žucκdàY?äš².& ṉª<åùBüã×BÔƒñZZ[$acI,îÄ%²u¤ÕÁý•Ãa]œ’bm*âô%€…>&3d÷ß·å]7,A´cSv$‹L­ñ5²J”b‰f­$CpŠ#(F 0&X¨Š`**¹(cYÏ¢D·-ã MA¢(°H'¦3Iìôfb{#áö&·´³žB{¹E:pæ)JÓeÛÄPrìbúOÜZ¹)Ò ·sƒ0I1¹UÔ‰cLQìØGŒèØç ³ ‚AbXNŽ²»*€DŒ+R  l 8í›eÔ*§ W_^9%SéÀ—Ū‡×5™g*S‰Ú• úè”)Ò¶À”)U)&EúŽk¦w;4« c̲©Ù°Él _Ø硲{[÷-2øü5#GºOCf3kéÜI­Æù×€(Äà@­0h³™³™„tÎÓÛf2‘fœ5lñ,â ~ ôYUêBê±ÁÍM®ý‹Wœ ‡jÊ=¬ŸÂ,KÆzƒkLfÍQóK&öˆ®±@ R8öÁäÞõk"ƒ”µÓÅíZ~#1†ëEnæ“°¢Ý²]çVò¨ÆÊ4ðÝš8ÌÏ} ê”AÇpåA¬èIŠT)lüæwtiJ69áâJi¥"¡kyh@#Ïït@Rê»Cñ=GwßÝ9º…èP4Ù]G¹ó0Ú1ªUqµÞ‘9¦„ÞŽjbaº EÙ ý@G} BB¸ÌÄŒ)©Ž1cfcFÑíRMiªCíQm¬Í*f6 ÔElgÊþɈ2f})Ç裚 }T†J¯$°ïRQŠÑGuAú¨.Jm ÓG5qú¨&PÕE꣚P}¤ìuŠjÚ“É­g‹ÅÒ?ISKÑ=0þz®Vžë1(¥ÍjD—"Zâ¾¥kãNqÄ®7žB%îäRû8Ô~i6 ë¨]‡@× ]Ãmt¹¶Ë˜\\§T_µKƒ6ÿ„îz̶5œ:…`wÏß¼í¨w°zw"\d>Õí´Í*F»…̽ÌgÒ³áP*°f‡®N²ðZ™®8ôt u{À¡Æ J7˜8Îuâm1v‘B‡’ã°]; ¤‡^*æyc jༀ¨VÌý;k½½Ø|Úɧ„ƒpëN+Ù™£Çq,B¡S9…ðÍ^q“ÑéM9V·Ô%‹ÐØÇrc¤Ü”Ú&ÕJ¹Ë :¼Ý™÷ߥž6™M"jaØÃWOÌ^39Ž™ÝIÐîl9ÐD6ï+}Â@‡v}µõ âHN\ŠU¶.äó&‹9Û/Œ]®UËtÖ·©l·n¸ 3ƒ ãBp”^¸Ã†pÆpƒ†pý†piC¸¤œpýÍàšâkØ¿nCz» ù×m(.“ïöÍ3<õgA.õVeqs³¦£üêõ/¯ÙòAíÏ•òíïûÛµuÍ¡ýA«I:«bcÚopÎj¹XÊSOøNCá8%…?àô”@ÙäVðüçg¯¦Í!ÆÖÞ÷Ùf£O(ÙóI§üo²täée¡¹{¹ødÍÚ{#~¼-à×3ñË9ÕbMù*Íž™Là¿„K¯>÷ÔA&B®ŽåŸù'‰ÕßDýM÷ì‰(v{Ÿ&jrœ”o··‹»M±š{O÷‚ßùÀ{Ÿø†3ö5GžÞmýn:¯œÏ¦Âçÿœn®e.z‘j\|˜ÎùÍCÑ*fÁ\ ]m¼J$w:|4ˆO#y¯H@ü|fêmH=1T%¼ÀÓ±Ÿ»ðsñ~pUQÀý€—fôÅBQ)†ä–­Ð.ñû1ܼ.tÖ¿'Áã'Pp¦³ûÐêñêÇJV×xe 6‹Wvº`ÙV,G±J8½¼í©3¤íéEO“7Mr•ªôr Š±ºmÉׄU™×2UûB¦Á«4üžß“îÕèTx¹&ÕIl â¬Xó‰÷T&ƒi ®’Ì|n7®¢»‡õÊ•`QWQÝJñ ap¥tŽËA„ üCâ~HÝýÝe§!ñÖ©••¦2ö‹Uômõ«aEâJPêJPßÔ×@[†M€Ìš^šñWJÛÅ©*&0­L9`¿Ðø¹Í;®†+ÿ¨óKÅëŽÖ/#?¬¦Ä;ÚŸ5““;™œjðJ“SY¥ÎäˆJ÷69 „o&ç¿driW›°Úä8€Õ&Ǽ‡ÉñŒºJ“ã­49ØJ“ã%&GÅ—UÏy±0v}µ˜2ßwŒá04äŽÿ|ÖnÃ%Ú¼œû’DÀk_Á ¸'mþ1øA«– (¥rùƒéIÏÅ /øk°“ÖðXe’Xûr¬ÝŒâƒêá 3ÅGšþ÷³ìÚ†ÒÈL•Ÿ!!¡òtþr>YÉçKEtŒõ‚ý ƒèyºÍÓÓß^½”|¹~*71ÿ¨|¶˜o ê—ó_n7¯åíÙuâàÔöÉvGPJûc5,§xq[Õ¬ðRp~•»%'ÛPª”nϦ«_ Vî¯6)™àÁ•¸D‹îä+¸cKËr Ä †j.å¸Gþ­áåôƒj‚Ð*mkNÏf‹ß^g+x¢w¦Ø¤R¨Ž‹éÐàÀôÝäժĬKƒï¨\¨YF6PÚøHÃr¦ºoë´;äIêlÞè¸yPê #™ûš[Òba†JGÿÙ¾Ý`£‹üÞv"‘}EûŽ v1d·Öþ‚x_MÄì챜‚üÐ1„AŽÿnñãLÈY³à&í‹-Ú2D`kï6È Õþ¾v<×j¹™t\âƒrAÐÝ5j”­øëÍ2*+¤¦³n²íìnDž•ö(( ]>‚;H8ì{¥§Þ–„xB¶¦Wj÷ûº ªÍ³jH<äAˆ—ÿzŽàŒ|ñlu;Ù?᎞ž3饵ô38Àëôâë¯ø¸ùű|ÛÄ?0ÄÏw–%0Ì?±–3Bð[yI8üŽŒsdné·ù ˪øðf9Í´Îç¹²G/„0ð]žõ Q4Þ’ º};S5Œ³¯¬AÏ‚OÅj±&IÔàuít(ßûŸIˆ7_ÈWãä›ð¶Ž˜Å †wÒáPo%J(Ó"Á…¦ ˆÃžÚx ñë#h þ£BQn§´_ŠÐBýàۈǢ{×"ähpW# gìj„9‚±°b=‚Ãø$8ÌÔY #£Id°/7©qZ­>„V2²ô{Óï'F£Ïh©ºlˆ8ðCt­Éþ>•#… £ªP‰O¨þw¡n§1Gh°…¢øW¸š,f1ÎR†T¡¬ä‰•˜\ãüØŽÎeIUï*ôv$×bô€ŒL¥`¹‡h£¥pH.¨ákžë·‹§¡ÅfDt5•E7û¢›2øUÝ3– ¨MҞŠO? ! ÎtìëãèìHZä ¬ò9=–Ñx JmüÁ•†$#š°Þ4€¨2ðØRHª³<$9^\Â'‰º”ü/[÷‹ó¥k±´ G “¸øñ,Óºè´Z«Õêj…4%ô*yK%„ŸS)…l%ê*Ó9;ß¡>ëïþõZ¤ï$Œ(GÅïôjŽÛ³Rq5¤E†r$’2GnA nÙ8v'ñìÑŒ}…‡,µxA^°ÞQÖ¾Ó0a7–§Ñx4…ßx’Ù©H#Ô¦7¾çkÐ,J#s¡äŠ.9¦@¹VµÏÝvÆÒ>#¬Ä)¡RÁw‘$W—†äF!…ÆDcj“mÛY弧Œù)Jžv #ÏZìt††ÁAa’˜ê™¹Ê!maؾ¾û¨-ér‰²B–ÕyIYz(¢Æ@„Ú7·vO+Ó­ò¥ÖÔ˜¾mƒ4§õy\Õ¯lÔêÂØ»â±Ê ¤jaoÃ…ëæ››¾q1×ÖØÛÙýsaø­…’SÍŸJ‘ ROß Y%>ê?å•Ì­£n~ÜZºÛ³(uu¾ÜXuÍj©m¬Ád2Žßß^ÃçÏ/…w·–8ƒ=Öà¥Ï„'˜n ªªSµ¨ÓŨ—ÕÁ6ôn\·]Y0²T‡Z‘§tñ¿ˆ5£ùÍëùQÄAøø„Q0Œboæc[æ·Eíž½.оhµ=uO9a=?¬“е£Û·ûö˜]Øý·‘p3éÛÏÞÍfÞyîa§s¼Ös}íp¹Ö³ÔÞL?9;ÜÿPK=qçÂâ &z ripemd.cppí]ÿoÛ6ÿ9ù+ˆ 8Äo©ï3öÃnMô¶¢X7lÀ®=È’ÜMí v¶¤w½¿}¤dQ´ÉM¡í]/`É#ù>|O¢È÷¡úð!¹^\Õo«¯Ê««ã‡ÉÏÎ~xôWšäëÅfS/I±¬ÈÕeQÖY,ÉæuM®nf—‹’T«·—ÌîÈ/õ‚<*J! Ʋ1–ÉßYœÈ†¹âßëßy ϯ®ËW—µÐ½—ë•­Ëãã/Ëòò¦ªÉWåë¯^¡¶xvdoëRHŽŸ~ûÃÙógß~wöÏ¿M/žž|w}wµY={6âMVõ|±¬Éã“Û1¹“w#ÂNnÉKrÇ/þ§¬2Ý­òŽóz!'w/ßF#YïÜXïßä?wJ¥‹ÝJ¢/^“7vûòNmì‰n¯Ìã]öÖ¿ HÐÿAIpKó<ÿùû^θ<©«¼žT•‡\žÍélVV¥*¸¼Èãp^Eµ*EûAÁ²Y¨òDÈ˨ª(‹Ty*ú­Ò ¬ç¡*ϸ<-xIRïØ™s0"(|ÈOÓÂ|uMDP‹ðâ±)»x~3»^Ý,«“ù˜c2“rLª1©Ç„÷zLÞ4Ã-~þq|TÓoÈüd[kDNÉ-¿ÞLš¢oÈõjsùxq[W''¬®«x“kQ­UJcÞ ~æ.ü}µ¨¶· ·ôë¯/–‹ÍóM±©O΋õë_xíŸî®jò`-d£ã5¿ý¼àíòqM£˜…ý~Òж ž—U1Ëò¾€µy6+ªr^÷a[@ƒÅQšôQ[P†«é<àïuƒº.–k>ÐoÉyP-^Õë ®Õr½!ô×Æú›åzñjÉoñËÕò)(}~•üªøUó«`\Ư’_¿jÆ *(7¥`üŸ¶qŽŸKgB:S¤THK!-)ÒJH+E i-¤µ"¸ôøHÈã±ÑÆ_#Á îBþë›`4ÙUh@ì)q*"“‚D®(q&b“ÂÎpm•¸B(˜IAãV!â ÄØ …lèD(¤@§B!:ƒ~ s¡ºƒ¦tœ4¥ÐqfÐTxš$î i‡Õ šFpXèO+Sèê´³‰ît1…®Ž:Ôš‚ ufR®¦«5›«©IÁß¹;èv\SwÐíM»ƒnƒ)uÝ>ÉØÐ94 x:†£@3è[|MqhЙ:JŠÆ9Dv ØNç0¾ƒÎ&MÁ†:1)WËaÒl®ŽL ¶øÎÝA·ã:4‘OWWÐ b°=É2wÐ;€N ã€§Ãn¦vÝÆ7:†¡a›´:“ ˆšv7D¸ÓÅ…}ªf&êȤ¦ê  &MÁæjc¶øŽÝA·ãš»ƒnoêlèö`{’ v±á :înWOMpt1Ø&­.Z'ö÷oáˆh§‹'ö©:6)ØPê¼»G5›«“‚-¾³ Y÷tuMå #hÁQ²=ɘ;èö €Îº[Î4…Ž³ÅwæšâX²MZ]hì¡Öù»ëËXCÍt%u]£)t­ªJêúRSPMé”Ôu¾¦°oÁv×—š-×ù® )T e|;‚î×—® ¨`M‡zº_绂–ï® ¨@ËýWÐrk¯Lµ\_&£ Ù›¶Œ°û…M¢M[æ— LMÀ– }M¸|k ÀåB_S¾Ž•arÝ/ôA÷ LGÐýBßt¿ÀtÝ/ô]=-—‹®žÎahOã࠙ꇽe‡µtuª­µÌ¨¥#4€Z>^5€Z.ô5€Z.05ZzÎtl®ŽÜA÷ LWÐr¡ï Z.0]A3ˆÜÔ4Éö$ €Ž`ðС zo¯ÌŒZ.03m¯Ì2Wj¹ÖÒjù.ª)€ç·\`j àùM¡pµ\þ¹‚`4îÁß¹;è~é :„=Ð9ìÁö$‹€`´Oïß^®ÃŒZ.0s-×a™ªc“x?‘/4š‚í<7)WSظ©1àj¹ÀtÝ/ô]A'жøÝA÷ LWOG=Ýo¸¸‚!Zn¸¸‚¦ªB“íÞþ(YprÊ×ãüŸJäÎ{©’…¢F­Ô`/Ôì¸(5 ¥FøBÍ”‹BQc¦Ôˆ^¨9zQ(j”J†¹PÒ†Lðá,…Ž²Ïž?±-ˆÛ‚4‰£Q¥ i æuUΊ<ë Ò¶ Ë‹YYÕó¾ k ÊÂ(NÒ¾ o Â’U´æy£­ÿycL6C£nh¬ °±ÏÕPhG*$nUIÓ¨"H›FAÖ4ªrÏýðÜÏý€Ü¿oë÷mý¾íñÑFpé„lI‰“–˜¸ñ<)Ï“ò<)Ä“ò9Ÿãð9Žíì1ã³Ç–¼>i ìO*ô¤BO*D¤BŸôù@Ÿl'’OÛ3N“öœÓÆp=×p×çÎ}îÜçÎÛÉ£â“Çö(ì¤=»ñduOV÷duDV÷<Ï3ñ<“vò¨ùä±ýb¤ýjB3y(t&1¢RNN›Í.•brÚ²?JÉi3-©’Ó¦/)‰Û–IÒ¶¬HÒ¶eE’µ-+’¼m™5\ˆ/9üz.¿ò1?9²æ“#,N~rä£}od²ûi–}&\˜÷º]•u²{3}ºO…Ø3çVRH¥Ïg˜"qí­kâCÿâÄ`3&T ;•9Úœ8±ŠCÄ”`rgLøÐm¶=t›-DÃû&yè6[›1¹Ã`³å£ƒÕƒ“ÔƒÔƒ“ÓÖÄt^*sG›qBÝ„±£ÍlÈ8ã$´á&ÌrâÅ¡ä³!6Ø€q¶$ ãŒÝm°ÙòQƒÑ8wf0úpúeÿ.<˜z)åËçÊçÉçÈçǬ¹± þ2G›ƒ!6'ΉLk.Ì0Î8f°çÀ OhËG5­”¢-UÓTÈlÛ©ûwathÿ¸8´‡^“"G›ñÞ½Áf¼onÂÌÍæûõƒ÷êïÓÞ£·îÏ£W»ÄÑæd€ÍpOþïëìÂ-?Ä”ÍM•»•åo +«&Vî¨ÙfÀ5ÚŒ8£F›_Ôl3àŠ^`òQêhs+lÆ4Øœ gÀ 5ÇF+bðA6Ã3üç¹mz¾×ÖvŽŽM•  èlçx/Š9Ú hlf›c8†ôµsÌ'OmŽaeƒÍ ®ã ¨jF›MÍl3$Cl #øSã@ºÍÔh4 ÚL±Ñ±©²Áh@±™¡×Lñ¬’8ÚœÀÊ›¥fŠÏ 0ÇqT£ÍˆF3ÅÁájsÍ0Ø °ÑfŒ6Ã#ô1 î¼›¦Âضë¾otvhǽØKûL1¨¯˜6÷¯ò6÷¯˜.6°e[ŠßÅfv0eJí;Øܿʻ؜[óo¦JŽ±Aq¾Ç`óN }ð‰ßÂvâW;ÏþïÎó²8ù,ÏóêÇvctl7AÇvSíØî{û'Ì“|¼S¹ÅÞÇÓwáÆû‡p“ýC¸©O­øÔÊ=N­ø}¿Ïqö9ϼú4¢O#Þ¯4¢ßÓó{zÿï{zŽGN}ÊܧÌïOÊÜï_ûýëû°íxäÓÓC<=äþÐC|®ÆçjîC®Æräò“œšQ“;±vF&ÑÎȤòŒÌ{õÿI>{úèøOPK‘=ƒä+`ü–ripemd.hÕUakAýœýý¢rñ’K*A`õh„ÄQ(…‚¬·£7p·+»{9$ä¿wÏ£jÛÐORðÛ2³óÞ¼÷¶N+)p£—ïÑük-^&Qø<^<²º+“Ä:¬N2NsP#‹:á&i'5ƦÃçp Gáâsøe2mŒôvcU5óýKèsH4®j‰µ›®ïEÑ.§v¬2ßÄ\^e¤µÒ~&Ú‰ÍÒzEyuÓ¹® ç¾ÏÌo]˜Öh,<¡\ÛÀõ`IÖ@ËgqÊj¨¬wa“/SŠaâVæÅ£[ûÙdf¹¥x®¹4+¥³~¡´¸ ?Çã½óæ‹í9é»OÙŠ•×>oušÂö˜eÿììâ¢ç<£QJÿMÍV§Ó9ûŠQÍçÎI+Z(^[Á¶tœGÁ‚íáµÍ DÂÿÓ]<) %‘©$SHÙ_t®Ì—çüíÖ!C(¸ú¹Zõœ’ ¹©!ƒ>¤”õ½59õG¤"9B샢hbH O« K!3gl ®9º„Ê.ô=äÓ4-Ò„ð\†Ø\Í .—‘î^fƒ÷³‘«ù*( þ€CRóKRëKÒ™ç¡ÖÏÎgSu¥ÿø·Ãépò~<{ç7wã‡Élê8¿]4;&ùפ`& O±†°©0¬±’_›T›kÜ>% XZ1Ã*ÄJaszG},1 a|–„Tº¾Wq S×>W/¦)¦ÑõìQ ÙÒÚ´ ÐzòHäÔx‘TY˜lI'”»'è8q?Áº:ñˆ)„N»¥Q§›0"S¥ŠÄISà nC§¬ðIHíŒq©9¤½ç9oÞæå{Ǹ²Xºù™§526KáÓ4µ^‰öX?oõ·P¿¡¸ßÖßúŠþÖ÷êGL”ºÿ¿¾O‡TµåKy/_ZlO#ÙTþwþ®Ä [.©¤Á!üÜãdx®ˆ\Qµbª‚n7U’au?÷CÂ9*é&p´yä%®‰nø$ò³í0ó€rë;¹Î© LÞN­–Z(#Ÿ–yi»öfÒjÙé=f¾·Y¾lYŒ>ù41s`û«Û}˜ý<šÌG“ÉäÅ£ú eÀ©26‡:<<,B,pá7e¡«œq],ÜpØÊýYÎ2½Ôa´ê.¯¾ñ¼ºŽX 1ÒÓP7¯ø¯ßiL>jõ›ÓxÁ—kàN eèÁ%hÔšg­ž)"LI"¾°p=ê"]Z ›®ØÆÚÞ¾„f­+‹þìZš±†lš¾ï¬)ÖxüS5u~vûWÎ?PK={=¥R8\rng.h…Uas7ýÌýŠM2“`JÓiRCpê¸!”×m¦Óatw{‡&:é"éìROþ{WÒ ã´|9n%=í¾}û®Û-óÎ^BÁM—ósÐ(˜ÅÁŒAÓƒLÊøÍmÐL¦¥R¢³Ž¢g<“)f0¹ü´¸úu±XÆê]ôŒb\âa˜¶ËDT)ÂÓDoJ+xÜY?}͸°¨ Fóñ‡ér1žLWgÓó‹ysâN¨Åâ(ŠºÝ' ŸiH”Ìu…Òr& G‰šY¥£në (Ís.™ˆ7ð;‚³–˜Ê\P mHHe¡2™",C®Y¹æ ”•.Q­näÙ€ÙÄÕZŠí¸$UÌ«"F}¾»ú. ˃¨4o•N¿ï—Ü®ˆÎô(j4ŽØ´yƒ»¯QÔ¸Q<… Ï„J>7ãEh©Ê–•¥vðpeýãhHjìs´K‡G0m¥¥‡d©ù a v[ý4–Y*‚4êµbøxüËcñãWÀ¾×Ãèë0ôÉ1–"%A¢Ê´*`<_^À'ã×0.K”)ÿ&QMñN0og3Útüúÿ ooWçÊNT¹a±À‡Mèv!áå5Ü’ FJG Ó8©"Ecu•x˜”‚º ŽªçŠxnFЃ™4 b˸Kkp}Ifc,Q£N¸éwEsbHVÑ£$´B효ÐU׋ýÈ$áû½' iÕY•e¨1Ý¿®ùxž[¦s´Û;Mb€Ëž'k&%Š6×ÅÄîT #~UZýæ‘ OkšI•4<—Ä0—–ÃFÃ5!vG(¨¬Þ5–˜œmj¥Cjã*‚ßìÓ÷S‰2l&8G<É­(:G T+’‘õQ÷ò 6ku¶Zpµæ&xð¢X“øÀ*ú…ß$éV²–¥S¹C¡ÿW”„O-èθ…Mô£Sù¤o'|ÚL2•gڮѧ¬ ‰t1ÑÑZ¼û´¼˜Œg-7/¦ã1~v‡”vz%Ù ã­Øå[²’¸!!þ¢hÒ)!Bî(T¾iÃñÉI¿ãl«ªPÎåîFŸÿn¨‚RÅß,¹ü|úpv;Ùô:¬}hQÙ~ó¡~¹\z9íœJ Ì-}5œ¨{†å8uÞÓ$h‚v{Hj»k©™S'½•'3°V·P0¹ l¸{ýÑE: w³Ñm¸õxÕ†£~¯Gw¿÷Oš‡-–©ŠÃ–‡Ëâ?¯ÿ ctÿžÎßÒ'Þ9zý PKŽ=‘2Òî –"rsa.cpp½ksÚ¸ösøÚvš1 IKÒíî%iv(Дi\LÛÙûÅcl‘xkd#Ë l7ÿýž#Y~€MH›{;`÷KGòË—„Gö±†äˆÜqOʈÍ\ú¶C]â1"n( ã©ï9Ä æ6@¦+ò•z¤k{µÚs9~ìRò,tnŽožåȸ°#Vž!óÀµA‹5Nl J|U„F7ëüýëÐæö¼yaÔ|ý ‘_\:óuA·÷îóeìïg°ÎøÏÑd8Y}Óê~úTÏÛE™ ÚW=sÔîô¬w½ËþÀèðU(‚Ѩ^»{ÈØl[‰>‹„Í„g /`‘Q¯}¯íÁšiž>vÌæmó×1?´/Z­/”{3r²lÍiÖϪ0Mïš!Þ‰1ˆ}<¸4ê[ñ3ΧÆòd¼×€w|IÅGº2ê9ÓÜÄýÕXž ø”ûˆe]}í?š–•£¯«þ†¼ýñò4}Ұ甹ÞLR÷2%¸Çéd ÿM’ ½|î$"+‰~O4-ð¶{£sTŽ‘ÿ¥$€^¯¥^©;Îj÷¹à÷]Í0Õ&Ëž«Ñp<1k[’¥6ìw1YÞÇÌÁiµ@NÛ¿0ýçý®Q'$ŽÀ¼áTÄœ‘¶9h¶ZPV‰¶@¥´J3/cö®7îR'péH–.ð.žÍ(§î„Û,š|.S“ìOEƒLƒÀoÈû›ZB¦*ЛtSæPŇ“ˆ.Œ©À¤Ø›[ì8•`ÀB¥›Pø9¾¢Qd_Ós+õíöÆ`ÕŽúæ\ÓÍôTôz¦œ zn@Kõì3A¯eAÕvú+ýjHMˆFÜ_æu þ{Î7ÓfžXun¨ó ÙêhÚ]†ÖÔ‚–g9ƲA@-üÔhŒHQîÛ÷\[Pc :˜âù”òK eecâîsvÝ 1‹°Ò°s âÓ[êç’nGèT{êƒa?i™_ö&ÖûσΤ?@C˜Œÿ4®7öãè!4•å½e0ÊbWÔ…ýžóÄ PRª5²=;TÖl†[0Kcä42wSÜÜYñ—/ÉÁSþ«Õ³ |1âÞœšÔ§fyKÏ"0X¯À-ÙÝ kë ÙÐÂ\4àáû}Rý¨í842Æk”›,¼$È÷$‰ÆÔ‡–%¶’ YÀ)öQ± êg KóLpÛYð>»¥\x z­diSUî[«¾<5`’y­`®ÂkB‡‡Ê=yõúw¨B@ÀÝ ´Re† Z­« ç‹eüó)'‚†]F€û(Ì\F^ü9i¾ÁÄ7<¸C㱯µùu<‡Œ2ž•{ƒD!upðp5¹[/""H4·}ÿ™‡mæ­ÖRªøvÔ.Ù±/m‹YŒJ'‘1š¿Õ3¥eÃ:E£U+ëÝRØq¯»§ðtêÒD®Òw#Å#¸ »m:Œp¸¥‚BlC¤ï`ë•ýfkï>¹ $Ëh8ë-bÛ—‘ɇ,О ;(ŸÅšh5О`«Ñpn…Çk9*“1ÓMa-ÆB4,‘nFF²ÐøÔ¹'„GMÜGM)Úøà.DdD– Q×\BÉÆ%/ˆ"U:¸‹ÅhîjÃÚ•Šº´5ŒYbrrŠ]óÜJy7íe}/mÓéüÔ[â­Þ¦OØɇÞØêÇChðU Ç‹XùÓö å§ò˜c’å¶@„X €ô,wµ¸ÊîÔ*JìiïËYKŠ¬ìÎ0¬¸3 ‹w†azg¸ÁaQÁaQä°¨æàVpp‹Ü-ªÌp×ìp•!a)“*KÜ5S\eË¢ŒI\8'°T&¦¯Œ¹P3#NŒ%1‘'aœÚ”½%W½j8Ü8›Ëa´”‡M9S¾HfÍÔ˜ ¬ÍM³•^Hõ÷kÔ7Iå :¹™“©( _’Ô+0FÕ-uåmÝÿï¾ú<'ùâ /¯¥+š;a쀅M*SüÀ½¹’þƒt'¥+ÛF‡3Å+U¦x1_ùŸ¹¢/‹än÷õ%±2wŠ•ù¸X™?+óceþt¬žþ[DÉg@«oñ)PÅúnYä°Ìu-¯ùFv¼ò¼¶’Q<Ýb\=rsa.hÍXmoÚHþŒÅ4‘"Hi(T¹“"‘@Ô&AqÔ»“NB{ «Úkg½&M£ü÷ήñ+6pU*ÝXæ}ŸvŸÍ¹CçpvýÏôæj:][ÃÙ¹±4Æi™ltáß9s©Ñ¸Y°ÔlŸKÂx¶K† Dó—z”KüIõ†Í‚!î@Èî8‘‘ Ú ”Cj±W‡é§3 ö»°ì½=2;†±Ï¸íF…½ ºýJ{9 y‘|µÃ€8E¢OhP¤P/$=E2.‡ck:<ÏNÇ'—Í3ñH:má¶;¯`fèíeŒ>VÛúq[2Ÿƒ —Ël¸$p|_$œvÂøûøíŸS½üD'£!ªÐÏ›Q¸ž)O}ÈõL£±ô™Î$#.ûN›y(‘ ép€.JÚ2'oÆá=ð>x3Š Ú6ŒF§S ¤q5ÁG*‡î/˜\x“Q³ì¯\ŸŽ¯GÔöšj5O£ùœ êàny8÷…Gtø·² ·¾ïB@ñ¨ÄŸ b"´ñпәÔ_­Äôh|=滚NÃÒÛˆOè‚ ÄÅhh·_!IÍkL3ß»Œ¼[*>RN‘>"#ø]"®òOgš—.©›mX[A8¾`th,JжDÀ!Ç=%h‡Ò1Mu†3Æç>,•ô þnƒÞÚa õKXCåûƒð½•áK4©§„áí8ýHØ ½Ér6ä‡Aà>&ärJ|˼&4<æ‘;zêGÜINžÅkÈ1E8¦G*<Ù&©ƒã>ã úKêàõ.F 0¼ðÈÂ:gqŒ¿>Ç”©PŒ“X#ieÊ¢iò?gÒ%ãkwF)¥%¾¤¶¤Ž™¡‚6Û:㹿¡,Lø’ Én]ZY rÄv]ÑÐ&BšòU=ücŠHcj—ªGµ·êÈÎwÄ‹q>e2\¯5ˆX÷÷ôBÿ§2µFqÖ(Áå~]k]ÈY—Šª‹".\8jà"P‹{\Ük–"9šæ(¢£©®"•Z*æÄV°q¸Ã‹À!ˆO è*Ï^—¤”¡T 7Oµû’ºifš(‘^–´*o/Æ•V3ý¼ÕÏ>q^(@‹,_,¶úþ—ÖÜÍ2ͲlTÖ&Sw¿ Oîb»Ø(kŠKV×ΈkG.Z]q6†ÚN£}­¤ –£_ÓŸ;‡¯r˜™Ð\õ ÑjC±ÄC $‰\© T pŒŒÁ\ù£q ;ì¶Ü£‰{×úÿÍ ¹v¬£+-µÙ¸Ë æÑnEw ÖÚr&ß«¿¯•W9º¡;ÕŠx–ql;X6›èí`¢&ü Ì`á}Z&wâj›MC¬0†“•X¹Ÿé1#n4Ï%á^Yø^ Çͨ(\ØÚZ³PZqS{. KÕà®uÓXÕù*,ô¶YˆãNfÞÂnЮune.iº5£™£F³@}Ü·u~èO½Žâmó?¸ÙĺªÒpØJ'¨_3|¿~Ýıd0èª^Riå˜WŒ¹R¤*ú—©÷?»953©PŠÈ–kç¡fÛPb~د¦™Üp:K ¤mXÕEtœ¸ÜC3{*íªþa§4ûÛfè¬Õfÿ … ó÷{ )³Óyxx8z ØÒØ‘í{Ð&üÇ„ðEÇ&G é¹û*˜~€­bøJêtÈÀÀï@œÄnÝ /GÃëÑ ÁµÆVîiáÃll$RmÅ \?ö•Rpåx@`åû¦ÃU­×¢ߎÔÓN iÃôjnIVA¢}ssø¬Çü4£VBÎ`’AP.pHKâ€Mle3ÆfYÑXá ¶Y³ÛÐõj"_½a«æÞÝY“šéBÇ¡iŽQÖ®p†¾.ðpïæ ’f|€ûi€¡8_»Œí\±²'š›±£©Õ[H3ã©#ñò|pJ%3d†ó—æ[O´$Å‘V`ò#ûU×¢n¿Çz7ÂÅ:Í%‘–D.ü‚c‘êJž@¿žÀH¯}$ü¨¸môNN`š¸h¾éx‘G+àhÛ˜ÌÁQF‚•ÞI&3|&pH‘x,4D3Ë☾Å(Öá­i±3#Í[Ÿs5ßäѳºQ±n–­ûu)µ)¢Ûýa¾Ž ¶NôŸD£ÓGG•ZžšÃÒ§•0{^:ž]á05äÚIÝì˜Vß:©9•73àéB™_y ›Cj?tú7~ÿº_…'.AS‘(Ó‚HTJ,?‘ºJ §ŽŠ»˜*ÓÅHYÜ!~ì\hÙ˜°ZE#²xbDvDnä¨ãìQðÈ@ô„Èx—£ž4`-ôxè>+'.²c6ÑÃÉ¢â vanRí0{»pîÇ“ÆPîR¸n í|€9±Ug=>‚7»ËD y"  +âL%MÃ$‘åN»ÜpíÏïlGžIMïRfˆ:ˆ`8š=Br—.©mÂXpÍiÄÿf ¤Gi4h¶bê¢Ijµçx.à7½R8 oÄ‚$dA¶\2ÉB¬J¨e"cjsÕºÙ+À#ÇsÄÏÀ`÷Ê>ݾnj«¢›”/…ÿcB÷üguˆÜ“ÔÊc÷Ó4Ú•¼Sòc_ëïJÆcºbƒ$a£Ø‡gÉpf|üØ@oooly¥Ïø²¢m9‹$‰à;ö%¤š5<*Â$ždñ‚É{&˜¤:Ár¤Xµ!fDí0jˆØ–EU‘6Ê=Óß‘ –•=ÖTBKИµ‹üJ‡Ý®œ9Ëê[ƒžâÿ6XR[©õ¯B[k_™Üw2‰‹À i.åRA]%™ XÓôö•uSÕSfQ¦.pP C;O8ÎT&šš…ÝŠgˆ¼ôÞ¸dc±eRóEÄÎ]·ÊÖ¾tmŪ‹(ù;vtϦùWw²ì×Þ’žX6'–ìÕMFZR\¤f±ÁÅÆ,2\d†õNVù„1  íàAšŸ PÏNK|÷pÆy#\+[Pfy€×k¤Í7!­ï!ü#?CY„¤ƒõ&»Õɶ±@›©Ë¿7OVbÓþ{êRë´>@J%îãU…h˜ij~—óˆ¯'îÜg¤ÑꂘáÅÙÍ-KÍd\À>ƒßœÇ?e‘æ)Švt[NÇ·eO{1VÝ_汈X-ÍUáåüù¼±à\9eú}žH“ VªÏGÄm{˜½ž{3¢´ÌmV¨µJcâ 5Üàb¾5õ£U"Q\bÓL$¨¤æÊ›]™œy.íŸS½Ÿhx%÷‡…ù>Ñ _•F2¿æ_ÚŸŒúÞ¨¿=áᶪÞ÷^xwsßÿZ¡Ú¸Åó™èÕ3Ò™Œð©ÉDÈ—äPK‹=0Tm=÷g safer.cppÅXýoÛFýYú+-®GVrJR"õáø ;vrBLj/×à7 È•ÄX– ‰¾Zü¿ß¼·»é\‚´=à‚TÒgçóͦ?ü ¶éLožd··ê@ݬóbVè\Mwøû‹.ÔiZ¨Ùf}£^Ù"ÝäêT«—ëe±Ò›¿nÝåvûÛb•-ïr­¾¹ÍOßÔF§!º)¶YS’næ«ôFo!mŸ¿<»¼8~vöþäìÅäÜ{¶ÙÝ–ë‹ ¿ÝÎÖ«m)±•Z]??{=Ÿ¤[=ëûÛ÷e:}ÅÉ•:RíÖÇ°«úqWEQÒUa £ «’‘ˆäQ8èËG$’ž|÷D1L ÊG,7¢@n$½n»5i J#˜‘Cå¤ ÁòVq3’o è~Â> ÄìÇbh J!| ¢(Ær{ÈPy‹&âCÜG}† KQÌx!"‹°‡èC^ãCd- QÌûL…à4Þ a–©×ã}IË\ CœX#VU@QÀh1àb ¶ÂˆÌœjòpÄ€h™"lÞÃÇu€Œ°ºH?)†@EeDð0ÁGLVñƒiQ”šÙGbˆ&Q2¤0`ç$Å8X#DÁÙVƧ1ÃdaPû?DµÇ(ö›êÈ…iÒ5£Ÿµ@™i­Ïª3æEpà™!ŸÁ: ó6‚š f¾ðÅ¢¨Àª°µlÑCwÌ1ã¦(@€ž0 DK—WP-$Æí,ë#J$¬?XK^Hë-¹i@u”Ÿ–0q4‹Qð>Yˆ'ª0PèJ…˜ãåU ‹©S‹†à›±AÔd©QO3x†¬ÙÖš‰A„ÿXaqÃPÄ*iô‡Ž1N¸Âñ2$Iæ@ p!PÍàáðód¶\Ï“ÊØ®Ž,PQX6œ‰…¶Ü†;"Ž{âOª ¬D†áB–PAø‰c7RXl‰…GY‰áŠózçŽP'ýd»pà8vÄØb;aœXü  I6Q˜AÌعÄÕ¼gI0ìÙãd¡g:¤Ì›±›t3ÜËLóØ2.y™L s¨ÙeÀÇ4•]±Pˤñžë8Ñ Ö†)C¬tO\Räï óÃ>A:®ZÉcIdI12¼n¹Ò@/°h1ãÇåÅ8‡ ä0´ãÌmÄeÆùçh C WÎ.i”‹,ÂÅdØŒd‡§°™Øñ=»¬ØZl` $qpóňˆ4¨'vŸŽìâá"àA‚\¹Ü=¨ 'Ù„†^Ú-â…“l‘ÊB»ß€¢¾eÈÐ,ÆØ.<.BÃŒ†=Á?}³ZM¹{$î~®r³h#K%œ—¡Ý3`†>÷™, Ð¬"Ë´Àÿ(°{Ù,X–”†îÐR§žÌNb "³ÈK„ 7å(±ÛêtCXʈÝf K•bŠè€#‰eZÃDqlׇ›´ö ¯5dÅ„ð >H•‚; D òÈد’~úî,lÖåòyq/(©*/dß5âÞÔÜ«R¨Ú*r¹!3e"*0 ‡ªPOjuAÓgG]ðÔl}-%ÂN&Ì– «¦0­+<|É_å‹­CšÂZ»Ä«X0€+ä_Ä¡¯þ¢!ãŠwð§Sœû‡¼ØQ0^]ùê;Ü?Îôr«?õ'iý>;ÿ‹4§µ4ÿTŠÁWä8ýš›†Ú‚³rw«…è‡Vèëx•_Ü•O1ä]uRÌÏVy‘®þfž?¢å³U6_lÖ™ÞnåÞÛõ†Z b.V”96Â{«Ùµçõ]ɳo´ÈÇxŠ‚Ü쪼«$œYWÍ»Jؼµâ©(©3˜÷¼?3Úûÿ…v~ÚþPKŽ=¿,> safer.hÕVïOÛ0ýÜü^‘&¨MC¨„J-M· ÖV˜¡MÛT¹Î•X8vä8@‡øßg§mšþb_ФJiÎç÷ÞßYÙacÂ_ý\÷ƒ!nv‚«ágÇD™€õÇ«ÕЯ1ãàÔ<ÇÙa‚ò,TMÞÁä ª.ÇF\Ò;uzͯ4σa+øÜííž«I¢å`°g0=H ˆr’¦. %R£ÌDB¦€j>qò%”Ëpžœ$qFëNe.döúÛëfë2@-‹WGÓDÔ²2ÎYr*ON¥Ø_ÉDÊn„ˆ ú‰f1ám¢I“›p Bïî!*EªÑ“)ŽNŸÍ¾{ÉBôMÐÈÖbÐ0Ù&Ž&PͨW¦#.Zbà nuäÎ {$†Â3¦Rô>!ŠÄéÞ©c*©MåZ‘÷LéŒp4’’#¬U³wvh7U0ЖaÏËE†}aÆáÔ¬¥šhÓŠ’FxL†šŒ~~øtü{s—·åŒgK²µå ¥Ž›þ¯´:oÙ@I iÚáw©rK]c"¹eµÇY¦;{—™ÎßgÅÿSXÞR˜Õ¦!N81)þTd«‰wjwÔíuúîìh¯¯ÎÖ2¦3Ø5Hmü)˜…oØ1)™h»wæÆ6ìÆÚV®ç½CC'Õ*£zF{1슱\wØ#„9;fÀ?i¸ó•¢q0q™“ùGÇ.:qQþXÏ»’™SÿèÐd˜ßG+|ÙŠ4" Õpjò[©˜Žb;;¦„¹øj.sÿ¢Z”à!Ÿ HÁø¬iÔ=ïáááàXHØ•±—R"öc¦”TM"ó9JcöÇ÷H£|÷ /-(7Æ] ºŽ§-ifïS„å+LO°—p)·Ãá~ÐËMÐí÷ÜÒÙûfÌÜî1á)4PÃŽ ½V Ãé Àí`#°“­Àf­ÞâüŸX¿ŽGpa¼î¼fü–>)ÈÍy½ªOÖ€W}2ÇžÙª^_0V+‹YË_ùeŽ• x~‰oâÀ+$‹o— ×6_= B6vþPKÚ{TB sMEÉÆX salsa.cppå\{sÛ¶–ÿ›úXg²—Š™D’â›îȶ’xëÚ¾–Ó¦Ûõj(‰¶ØèUŠNäöæ»ßs>ÀHÓÎììÌfÚ„Äyâà‡ƒàë×dë.¶î«éfC^’¯†ÞŠ¸«Ù,Ü©7#þŠ„slî& Jfë¥ -“{ò‹ç“c×oµ^¿&w[ìMäõð‚¼†ÿŽ.½¸:¿¸¿ž /WÃñ'Çÿ4ý”šÛ#ášÜz+/pCpÚt=óZ­gþjº¸›ÊÍtþj¾‡-7«™wCÔje)aäÒ¦¥¿f[Üàvå.½m¶uº¹ãÏ? Gƒ£áøpøþäL? î7áúâ¢Ýj}Yû32B¬3¾ò¶áÉjº«ÐwC½ÚêíÖ_--¢¿y3\MQ(dwÐú–¿XCLïß¼9ò7s/yáÞ½>-!9ç~vwÞ…ë[òï7p—[ƒêäBöâ³wo­ÿ§7ÉÂ[݆sn|9Öw«Ù–¼%BêÕ{¼ ¹º_üp~ìݸw‹PGoÞ\rf½mÖi´ZšCôÓS-oIüóŸDn ,߲햦…ó`ý•œ¬¾¸ iN‚1 !FÓÁâv 0›/Ñ<šÕp〦å ýó·$ðÖÁÌ †7뀌FCÖÒ 3‡‹õôóß¿Íd9Ì.¼áj滫Q!Õ!2 MãÏ‘ºß¨yÝN_:ÒKWz¶®Q°ÞCd?Š;LêDYjÄ–-2é¥/=;×qÇ÷¼Ýgu^òþ¼G ×q«ÉâVb!Û¹†AîìÚít{Ž}R(RôÈ;1§MþXMÊ:Žåxä ¾˜âE’c ¹nßalf:\.za’œy2vתÃú¥·½_M,+€¯žÀyž»<¼»¹ñ‚,ÖO~.ƒº»ÝzA¹ûömïac§ŸüU::–¸[$é\ t,áx>„¥ôóv»ºß¨óÂd×\¢q(®7óá-v'_oºSØÛúªˆ#‘ áDÂɦ<„YB>„ObÐp<ýÆB$X-Jžãñû³Gã1hÝír<†¦/ëtsáñfþ×ö^áÚ·CAº;²Zo0·;ØCâÊ€£ã“w=G×&»vòhÍMkË(çèh¢è!'Š àÔ1]¤ábÌÂWà_¥kP‘/Qâß"û‹i‘¯]A; bfe­Ý»â´IŒLqË:k –ÿԵ߆¦Af½i+jÞŒÃ#ƒÀÈ'`oÅ¡`—0SâÖíÝ$jåë—h§º¶¹ÛÎQG;]et ?] ÎNºoßÛšöß-Øv~w3Ó` €Õþ~ö ’ÿÚ‚Qø8ûÃÕ~Ëb`ªû/¬ýßÛb-e¶sÍõ@¤Þ¡$4âŒpãB|Ý.òÑUð±Sð™9>3æˆ×âÒVZÚÊJ[Íb+-ÕKK5ÐR ¬ÔVª•j0K}0Kõš¥zM®·U=[÷¨$@Ïøs¤šž€ @'M6­¶(³Ë•‰,,)rg39/ ì¿Ì0 B”‡ŒÓNuªÊ.B‹äž ´Þ ëº(kWÙ‘P>²FZÖÈÊͶ* y cñA;ŒâžƒÊ?>.aÏ9¾<ÿxv¬»°;‚@ÎsQfÂƹhÔ„¼ñËd*W¦¦Âv”€4Yv»XIJ~ŽŠõeŽ¸[·5I•ªˆ¶ÔåÓÕÆ¡qd®11¦ÆÌ@Õ9WŸ=%€žÅ€F0·±šº7±ŽJµ³‡i?*Óîµw@»&©7Õê“Qྠ+mMhÙçnjâ¤Îz˜·‡‘¾A[KÿHjì ¯âñå^u œ*A¬àA¥£[¡#Dé¨N²qϪí=P­ðPüOZí~m´Ë}»Î„?UH;ßeø(} ¨þ¤ûuœÇ5^™U_¡Àz¨Ž9¨T:ìGƒjZ*ê4ÕqpVíî#@5­Uïû _¿¨â‰ÃöËçû>Pgô¡ ¢¦Bkª2J$æ£Q5«@³“ªJf?U³ T1§bÈ›ûå¨gÝïRÖ{0z ýI&£$ÕavšŒ[”~¡HùWÒF“[J3¹É·ˆ‚Šz6Û¸ñU甞ìË rk9ß`ÁÖ1¨Á ù„X*"Á2lÃ1º(tcÜsNàBL%Ä*„L•Y!d©„¬ ![%dW9*!§B¨«êVõTB½ ¡¾J¨¯‚¦\j!"h"¨ ´T…ZªB­@U!‚V ‚ªA+AUˆ ˆ *DÐ DP"h"˜ ¬L…V¦B«@S!‚U ‚©Á*ÁTˆ`ˆ`*D° D0"X"˜ ¬L…VS…³¦ f"L"ÌrDT¯l0 •K›A`†"ñÈ P òÎ ï òá‘KzFß  FQ·Xµce5 jøëÄ¡ñÎxo|xüR‰¥1Vc¬é‹¥1³ÆXÓ¥ JcV±¦K:”ÆìcMK$(95Æš–HPëÖkZz Ai¬Wc¬iÉ‚¥±~µ±Æ¥TÆ€Tm¬i‰„¥±š Ò¸´B‚ÒXMi\’!Ai¬&ƒ4.å 4V“A—€HP«É KG$(ÕdÆ%'”Æj2HãR Jc5¤q‰‹¥±š Ò¸4F‚Ê«É Kj$(ÕdÆ¥8”Æj2Hã Jc5¤q饱š ÒxË€¥±š Òx«¥±š Òx‹‚¥±š Òxkƒ¥±š ÒxK„¥±š Òx+…•1³&ƒ4Þ‚!Ai¬&ƒ4ݺq‚Ò˜:ƒ”âÇ [@ÿxuññÊ*ŽÇx`éxŸ|–Ïâ¸êhåÁ’œi ¼0mŠ†S¢óØ)! ²vjÔƒº\7êA ¢k8Ÿ{Ü )¬ƒ]§n¶u7Û:U³­¦3±Q…¿Õ&ÈOq~d1?ÅY:³Wtz’ÿA—ÖØÒÓnÎ#F³JyÊ…ÿ3{‚¨R$e– ØÇ9”"¥œŠ_í+ (EJ t+~Ë«0 ‰˜tmê.ðˆkI"Ž“ ¡Œ–vjI*R.Yf$Ä«Ñ©GÞ‰ÐÛ†Z.óH‡‹s9­ÏW“üáÀH†¦§kOõ~‘-ÎdŸ uÅ©à¾õ ò!N Ÿ_Dñxpä“]o”f"[rÿŸÊ}X]…¡Sž¤8àDU0Ðx ê+˜È…q-á0¹<ã¿·çîdT‹¥X˜kœYÂ%Öû”%ÉŒ.“s™ ‹|n·ÐoáuWítm¿Eä”ý¦ëwÖקõ;Ã.+±¬ä€TC>a«F|ÂV ø„M÷Lf©<•KÛ™ƒÊ•q;R¯!ãxLÒ ÎÁóPÃAö&ë•·mI'IâBNs¦ÅÚddén?§kÄWåøàðƒç\fîË2%'{;%é@Û5¥¸­fiaÚ-´[ù =j7ív^Ï:ÐäM€èn÷c°)³UÒ‚bªpÐÎ;ìd ÂÖvf^XŒ+(eŠ^ÐÌÈö`+ Km7ÏÅ¢ .X:û|ïI[ªÞZ%•ÙG˜0iHøņ4˜‰ÖN<ý#V ƒp¥À*ºf'¬Ø¹d„2œ,dÄÉ;ˆÁmñW±d“ä:ÿC¶0‡U[˜÷Ùg+»kµ“•üTïÅHk:^**Þìʲàý,mñu®ô2—j[¤½!{ûÁÑEécDoÑ5ªøµx7 å’|þˆßÅm°årNܘ\Ý‹%Ÿ{înˆÏƒÿwé-×Á=>M§¼?~ ñ‹ÌøÁŠìøÁ‰ºñC/~è' SÕ‰nš(§‰vš¨§ö^zõ‡ÌÍ„ì8²©2d³\ÈF…EŒ™ˆ$Ó4­\¥~À%éÌtŒn=óË×2­+ÑhŽÖ“h,GëK43G“®Yó›ËY"•ˆvžÈ$¢“'š±›'Z±—'ڱω|- ð’\á²7¿·ÞRÝ+'óã‹x—þ-û…tpêî âuáøªä3¦0LN¸6a’ÄäŠiWP‡]y8#rbœvö{Gm~ÅòëÜ_xyð½|‰¨BsÚ®#} ¤s} í¨Ô@±I L©ÁÄk· Æ’Ú,d²3_Gjp°¡+5t#5=©­‡L}©¡ÏÝ“¦ÂãŒË4REe¿)wœÊžS“7ÉŽSî9•]§à;ÆQÃ/öÀ‰ÿ6¹ÃJü:ð×Ë·|ÅM®ç–]]J~&`fBþ‡ëpñÎßy3ÝŽ2Öà1Ïx¦ž þÈËð„g<³ ÏjÀ+ñ„É&7Ã4Ã?/ÆEµ¬ÃV„4*:˜g¡(9ÍRaVàÔ*å1#L Ûm¥;ÝøÔUú#ÀO–Ò!œû¼_¶Ò>›°_¼ƒIÝ’†v48 ¢å_ßµµ¿D“¹ýãð×ÑÕåp—øÃÐkÓ“««ÓáÒÅÉàl ÃK^À,Ü—faûàI yLI#~+êi*yÔd'铽ä£.iì>U!¼%)´žªQBå>?U!Ÿ²‹ôÉ>Šy#«|²—81z’ÆÞSâ4²%…ö“ŽS†IÙ“5ŠÔ#Çñé^òI#»IŸî'Κ¾¤²ÿd8mI£ód8oäôƒÙç[ÉgÏ?ý eпÊ3NÎÞ·*­Ž~9¹:ú ËÙ×(û8UZ£>ü(Ëþ¾ü}²·âR»¦¥Í6/¾aõö 7}[Ï#Óõ?ÚEÜÉú‹G@»"ü»P+wÄ TVñ‚*ƒõtzlÉÜ â¯@}úÿõUÄO>‹¾~ÜzF¢BË1tûÕÄ»õWB_1øÆ#…â@ô$ó?ü´“·œnîõŒš}« —ä0ó­ÂG|•PýÝÁf_üô¿ùiAfñžçÝF£ob5Qø«ÿÛíª¯¶’âúÎ÷)ÉN(oè&[É;ߥą=6XBKlÞÐOÞþî$ï|ƒò=6K­úî#j‹ñÚR¼¾@^_„×—àµx]ùÅ·TÊB@wMªD±…¦-]ÞÀÒ‹7˜ò̵…%éa¢IRÔç-½´Áá ö¾¦™~r2[+ZÈÃ> ô/PKŽ=fì°f1~salsa.h½UmoÚHþœýS"Hå‹[®Š" H†Ð54NS÷“µ¬¼Êz×Z¯CÝ—ÿÞõ B«Þµ½ûÄ2;;óÌËóØu!£"£§1ü kÍA TF Ê0.ÁÄi¾œA¤j-‹Þ!‡ Ê 9æKáFWïç׳ù<ô½Kß _‘ckå/ìÉD!´2£Oc}·™zý¹7‡ÃñËÉ´=ÒEjÔ|~Bˆë>‚XïœðK¼'áD.t7Ðn¨æt!ð5—(W&îÿÕqàé™›_Ÿ'iuÏåj" ꥭ°Û};¼y;'7œÈ'r”jl@¦df€ÅTÃc¿2yb¥l‡âdJlŸÀ'&×Z ¢Vï ùÒ#„ še»º§³ðæÚ^Ž·ÈçÊ".vؽ(â†ßáÈöõHIf#cíÕ_+Õ%”èR­ 2ƒQ—Ý)AýÆGc kטKx7Tä8§\gðGJ5M2§©hQ„Ç·X8ñU¿NzMÄYŠšš²Q¶áH“ööTßp%AmNNOå&ÍÍ~.+S“…›æÉHåÒl³Õø¯0+$‹µ’Ö¹½…X§æË%êýØå¸à/”MÀIve·X%c˜evXõãÍÈì&¡V ÁG¼½V“ ¾¶([~ˆ×nún¨ÃÙì2 ÎÏàóç‡Æ³gä(—_ÉŠ?^¢ñ„ý› 4$½CŸYjxBÅP(vë—mغ£Œø’£üFå]Ï‘Uî÷—’°Ü`´ÊÀI¨-þ(ëU«éº.ô)Ä—Ï[±1i×u×ëõ)«¸&¬ç O•^¹k~ËÝÍ^šCߥî¦A¸ ç6o”†Îh[ÖÓ\{>y@Øݾßg°³5I‚FsVðB±¼lX5‚’–¦H±š~/¸¤¢¿Ï™WJD¨ûûtsÐì­Ø>õ`‹ºicY5ÄfîíïŒp»ûº­÷ô)ø¶@U³ÛW§+RçÙOJRðO5)øž(íÛKé©ìÿîüF%Ø“É-iØr^’Åÿnl<~Á=‚ÿ‰Á¿!Hðk Ù}ÜÇÓ ²Q´¯PKŒ=ž…¥âÓseal.cppXñSÚHþþŠwvÚÙ@N¢×‚ÚQᔫUFP§í)³$‹l%›˜l®p7ýßïí&Ä‚­u Êf¿oß~ï{o—nmAÈètÓö}ø¾\J&€ ü)µ™\€œ0ð£Ñ”Ûàx.Å‘Ñn‡6åå­-ˆ|‡Jœ*=èwÏ`{ÓR3Θ'hàÀ_T<°rùö4rløöds²‘Ñ!àPfdB—\Úu~ø±Óïw†G“î99æ¾ôz=£\þÇãŽa8`¡ìŠPR!9•Ü!1Êÿ•KêáÞA³Ù¶‚ᘵÊßËåP‘-cð u]º˜"6RHÜ•dPy`s£\*5á”ì&|ÖïmRÛÅ_SªvØŒX³qòƒ“‘¬tÂäUÈ‚lNŽº'ÃÎy»{x>¼¸lw.M8ݱ{.R였+˜P·ŒÂ\æ†L’¶ – » 5†ñ–¾y³]‡CߟÎIòãCŒšÙGSÏ~Ø‹GàcÄ[)( ·Žˆdôi·ÍfŽV‰‘|ÀÄh(ìßÚAN>’þ¶ÿDžlã·ý9ÁNÓ=µ¿X·H°€©¡þéa³9¨Ç^àªém=5¥[žÿ½\ ˜ŒŸ¿ð×;·:‰’¹èZLÑž°Ž2–èyhàùÞfÿ˜ûô™T¹ˆ3{N]vM§ëQ„ðƧuCry7!äÿ²¡„)÷r¢…q‡\„ÜaÇ^$$ 0NwèE2?„f ¤À–JT„°{¡kLÂŽÆ‹n¢QºBêhn¸œ´Ù˜FSI6Î#wÄ‚‹ñE$ýHqöXÐóB®|¬…Ù0a»^©Yum í3kŸÁ¼­½«k¯¤9‡{ísåíV.4®fbV€ð}«|o§VÇ_Õªªw8øÂU25~36NlÄ,¤¾³›ôW!Ö¬fYV5FºÃËÍsö4*älKÅj¬ª)*ÄÈð^ñÖ¼/vÈ% çžžP ¥&À^Á¨{Ç,XvH÷ºÈ ¸ $‰Gö÷“ܬX¤{ ïsƒ…¶¨]2¦Ó™°Ú0º×4•J9kå™[Eµ^¤FŸ±‡×]˜‰LUtšKÓ&¥ð¼ñ«@²Î2È2³È³Fážgz½ŽéÛ¾ðž}Xdœ¤ÅOÔéá-þ2 xº8—mÁ…JœQ [Ò[)’ ÒÇQÃW_ÛøjäKÒ7á1­ˆ<¯Îoæã^nÉT«éˆîÒ¯6æ‚Á@Ò™PY´þŠAßXè‹3ªŠ½ëµº;Peبäv«zù'ƒ?ùŒ9$5á핱_­iû µÝg(êšÂùE½ñ Åö­R=–})!_UWúº‡}ñkÜŒÔÑWòq- oÀšý1¶Õâ(Au?–Ù×Ç›ñ)tÀ»+Ýëbðh lçÁË‚Žr`{ ìäÁËZÚ9°³¦yð²ŠN.é«IIÔò¯Ú‚ò°ÒAùXE¥×XQ&/ÌZ]VdÉ«²V”Mò’¬UdE¼ëäÀxA¾gBw}ìÂîB%'Ûn#=ÑÖ˜¨X›"wàÁqVWüT¬”¶Æ]Âóh<9oôäâWm#çÍ"íŠ|ç(rû)&òXuŒœU‹ÕÄçâÒyp–â¢Fnw?[pI0#cMÑ=þLÑ­*ãä#X_x/–#ZÚÅõ9vq5è] °™—þ.—Ž/?õ½ÞðCçSpÙ9ü˜<Þàu‚Ìð‚—o¯#"W}Á/è$P÷´F…W­[£õr<¿lÝGc’Ú/‘àèd"©ÿ ž 4Éöm¢özšþMwp|J2BšÐ¨4œúÆÃ1C5U¢qÆ©Û:-qêC{QK‹'Ú É“ïêáõ.ÏRË²à‰’üdØjY¶zʦ›¯Š®Z]¹/í_ˆMF!Vî¥â›£^L­EuGQMUµG—zSM_w|ÝîÕ|U«·Îøöµtëâ÷áp*ZÏM;ãRNY:3ó_xG.ÿPK‘=9™çžseal.h•TßOÛ0~&…W¤© Ò²2öІNIk Z¢&Bâ)2ΕX$vä8tâß%)miÓÞ|ŸÏwŸ¿ûq(–2%™.î‚è&â:óøÚ:DPHø€[‡Bò¬J€tJ£¹(RÝO;–å;?i8S»ôÊó»S½.Œ ‚#Ë >‘Ø23@lž±²$.¹ ®x 2LN, VqCš,ž\*2"EuŸ N.Å/H~ÀzòÁ¤öð´GB±1!]8ÅÞm|XÏÖAi˜Áx\ÉÒž2MŽÃr²¥…IsŸåÐ="ÏL¥%qG£HQYåˆ]\¹EsSæ9~|³˜ÑùN:5哳þéÉœvõÎvigüb½Œ­ý½·Jû7ñmä¸sÚª(Ta½ÓÃIaÄLQ{ÐS%9Ò…ÖË^)œ {dxþmÒ{}±Õvk! ­ pÉÈ:xR"!m¤ *Úmå©•¸eYº$Ÿ ¦Y^ö6âݯñ/Ç°î‘Rü†Ø¬)ÎÑxñ¦ÿÅxXW`yw{jo„’D½žz›xª2EeÞæ²6Y„Ù<™ªJšm¶–ÿʵä©V»[ŠmZ·Z.A¿]wÆú÷Je›€^¹`2Q¹Ã9”%ö@ûøµ;°aëÛR#å½òëfu!>òEíÅ ƒÊ7mbú¸›)þ¸­Ýù—á„äq4þ›S]`t ÑéÝ] /0ÕAk¢…¯MC¡‡Ö–TÔíƒèxÏ‹PŠ¼ ýå0nú¹žh›‘TÃò¢“SŒƒÕjÕ_H˜ès•JÎäI.´VzÀË~jòìp2&µaØä?Ãnö;z×æë<£oË7S¼ÊAšæ¯õü›uõª{çw)$Ëì·st­²´½7M¢·£mˆÛ‚wû”È„P ‡Sw™w ™Áî¾–t·?q¿à–üþÒúPKÚ{TB¸ñÛy K0 secblock.hÅksÛÆñ3ñ+NÎT)Š’âDõP;”ÄÚšÒG„ídÒ $Ž"j@Ð2£È¿½»÷ÂáERNÒd’ˆÀíîíîíûptD:›úáìcgAÉCì¥) ˆ¸$òu‰tAI´šúÞŒ¸áÒ7Ó5ù@=ríx†ñ7\:'Ww?Ž­ÛñØž ®.‡·Wÿ¶ßßÀ‚ÐÊ5@ fþÊ¥äÅ, æÞ}gñB{·ô’Yî͹“$4N;‹žaŒúo“qÿj`_^ߌ̫x¥áxÜ4Œ£#ÒÊýƒ®bJ–tÆkâø ­“zaP€kFJ— uJÏg>lF¬žÁô9N_: 5 ®Œ®ÑH×EÙ-òÉñWÔÆç³ìuâý ïĶÊÊéêíäýÕuš¡Diìzó9`áÓ`¦p©»gÄS·ÛÝÀ;ljB/Hi¬±ªOR¶Æ~Ùe‹ì“˜ Ú˜ûSƒ1‚ q\7¦IbªE7æcLÓUs?nž=Üþ ±@»þ§ÐsùZ¼š¥¦$µ%§ûxHMòÐbFMb™ø|&Q] ˜á:CÐè°÷Å2Œ:D²t>ÛødYù¢`Ìãæ>„sÓìeòॳIC~pÁjIcofûÞÒK“s«×í]‚ÖF‡)¥ÔKR°Öa<^-èìã÷¦4Æ£Ñhxsb¤'Y€ýÉQP£‘.âðÜ ´çöã{` HÍ9ÛîÂIÿ²E€ã#6yW>hÕY%” ZîA1á'ÏýðáE¬áÉx‚ó.ùùÍèÍàîƲûCðö¾u{g[?Ž“Æ i>ø7p–4ï\L™/énµjvJ™Óí„XpŸ’;íDD™Žp¢òvŸ÷ÂhΡ\ð;gèe?†pEøѺ&Ī+ûýà®Iö÷‰z"çääåñqãnºðÅÎýÒá&“@"afŽ䗑烌4ŽÃ˜i™b–Kêz`ùþšLé<„`Í|$yp"Ói“iÓøF}pâÀ îÍh•,Êo]/q¦>Xñwÿ–ÐëÞ_ƒÇ8\nXð÷”| Àð¸ã=MI ¾ι‚˜ŒŸ*)™  ð¬Ð32åf‡?I!{:±{GEª¡fŸ€d!é(™µ†¾‹n]· !‹/OÃÐSÈ„ŸhRó|M..$$z¼ˆJÆc„ÊÐXȨâ°Çâçq:JµÿèÝpˆn߀l:‹Övbf(í,à´B¤¿X×o![+a%³Œ¢Óq3š€bkB”l/yIˆbÏ2ö’9†Qs“Á°cƒhè{÷ÁÉ)èvîë¥ò⃗.®|꫈teÉUô[½þØoõL,…׬J¦F–[ZÀÓ‡0ð…Ã^–p¦KžgÀÎŽYNªE4-G—··C`çæõèäÔŒú—ÃÁµ )”´”}Þ99Õ ËdÜdÔí«Ì°šªÔ1Êxï ðl„“Wé_iˆ«CX®P•ÐÊ„Õ’¼ˆöãØY›j#€F ý :¢_köY‰X€`¢ÉÓ³5« šòÆíᆩ@°UæZh3Ìå‹ÞΈÆ06O:£E&ÖТþ òk5B0î5Æc,NpýS‡ï9A*Í8Œ²p>Q àP,}ò ApUå}Ü· NM1­dš˜N½À}Ñ1üSôÓw=ÂkGF‰L¢Uzþ®¹t„Àz …(«ñ‰Šxœß*PA>B+1"ßïUnÌkâZžkŸÑ&‚õ™²ÈëáжoÇþ5°¯†ýɤšÎtÒÞÙóñ Õº ¯Ä|ùí×bž~×;«ð½^~=HÄñ 4€¦ e3«}ëc¼Œå£•ï+ªyç-³É²ž yÀ~nð+RCôÚ¢ã3Þ$€*-,°” ƒWb16¥jE—@ƒ´äah€ÇΰOO‚•“¼Æ¤kÖ¤xP%¦ ‡ENÿ ° ¯á zIJ&Û†±ç<¢AG}OiMB^ñÁ¿xÆØã0 È_âH„„¿îTåsÑ}MT)ˆj×OŽx[Öÿ—÷™²(ù§¦ÿ»ÀQuÉÒ–gÅà±Ùæòq“ˆu˜@ c›¼Âôª*†ó 2ÁL·§í†I©4´w $t¼3-ÿ½¦©Ìþ,å2;†¨)ª?·´{êÌ>*QµŠ¯˜·{ÒsÝõ_.C›0žžï¸¬úǪ­Ä‡â_%—’±'_éÒž•Ee&ÃÞo«òW‰š¯áƒ EŒ6ÝùúJ¦^-¬(ã¨\!5Ɇ+S–Þ†õô.¬¬—è@q%0%¼n3×ü¯º;«ïÍ ÍžlÖr­Úî}Ùs»²rîØÿÁ¬2‚ §Ê}ÂiDí”våôÔ†ä~7쮯lÛhX­Šó{TÅÂð,ùðÓäg5L݈ln,äÑFTpo’BMßjš¦‰¥i5ÅfMr@ÌãCfÔÛ¿!JWgOíŶ±¯ûVß|Õ$×Ïäfrð*AÂV\h>îW8<æ$š{Ÿ‰¼½G2åq^˜£C X%Гþ†A ˜ke¥eõˆÌ†2çVM×õIEõl°VúÿVU චTÁðégèRf^ª¤1ó€¬kÆcOä ¬miG)z´P|'—š¤[ƒ…(¢Ü•äã¹Åkþ4G;íð›ès¹Q#†Ð”²ÖjâNÍRÐg¦z(†²+Ç!ƨZË €ÂZŠáZ¸,®%4µ•·q—|ƒŸ%hZŠ±ë‹’‚Å|É’s*`ñ©2,…· Ôƒ HQÆ CP:{’±HaèUHªDË$hP‰¬µ#M«† ì€ŽŽ ¢¶øfêá|Ç‚#áú_A¶`Mñ³‰ˆàt )kŸH"?ý¬.ž~ŒˆÔÍ^a[~Œ!“?«Ó$ú?±ÕŸóìnÜIçöwí×zŸ{/¨<‰F>TIÈú³Up„eŠœ§  ¼šl†dT”]'uréX°RF¾\Ȭ9P+¥ ,—AFJ×5@lŠÉhòŒM.áÏ8õ@år]ã¤_¸‘Ô¡2ÜŒs, nDOjxki—‡lX¶GÀØ4…æ5a÷ó"º€~’@Þßw1Ύ苺¹ù}}°¯‰ÈÌ,ŒÖenÈ<—ðÄFaYF¯à±*wÉŠœµä{"¡±ªW í, æ_™«x'‚²äùÈ\ûb ŸB˜T/ƒÙô3›n:X¸‹óI&ŸPÔïx°mËR›Ã&³vX}‡"Ÿä4•WÔ*ñ7(LâT¶QL)FQÀL¾-âÞC÷²òÓÍqɵz*浃 *iȺ¨ŠÚŽZâô„šX(R¦UÐ2ÄjSö,TÉý0‹¼§±7__®æÉà—•ã›Kµ²–Ù{#{ÿi.,œàžGã6Ÿ…«T6ÚØÈ(!ºr©=¯©㚢K»VÈ&›RSr­šE«ôP z,xcmÉ&qMoÕ+êÏ:ÕùÀÑ"^Ë)CÌVq ±åŽ\cªæ®`”y{“lX¥¨ ÇÉÆTÏV1βä৤bHÿñØé8®ëáØ×ñqÑÁé,Xñœþ*°#7óÎ]nw(6+„…çèŽ}|'TRtx}ýó‡xmƒá‡éž ËkÒ=ûv£Y¦2—©¯;£m2툟Œ€ó;ÕS€¾Ì¤šòÈ'œíèHMŒØ¨ƒÑ=ËÍ¥dâ„b‰hlÒ![}Å7»cðƒ½:«j×_£‰«$Ò“7¹[ÈáõÛóü@b£.&˜æç8Ú7›ÆðÏÅày]5Y ã¿ÊÉ__l¼(ÀœdëR×ù#ק9j8RÂf×yDsÂn!Ø¡l—¢tÑÂ4^¾gQêÏó\bˆ‰ÛÞA%íŠ[íNå*Ÿ»¶Š2ßL¸;M´³k3/cŸPá…Ö‚‚>,hÀ‹Iéçãqÿè“n×ëJ;xƒ{<NJȦö¥l…1ˆAVÞ _×ô¥ˆòöü²gx_%V×_ò›án·NPŸË+¡-À°çeo_kyT}ú½Ìîý_˜EÔ“þ]õ`t]þÌânsã÷pB†,d¬sÓ&õ‹Söi›Óa4¦Ö‹ŸgM¬áؾ¾YöäÝx|{gÙwƒË›Ñµývðörp§îù›ä·ßˆ™CCà÷ƒ»ÉÍíˆÝóìå‰ð“&û¿$Ä¢¯‹: ã”|ß9é¼dîŠs“S2_R’mE'ROðû[¥ª-gÅ`÷ ÛNRŸç1›œbnG<öÒ¶iHªÅôª®7vÙ»i vròW0ñúPKŽ=–ýÔìÁáseckey.hÍYísÚFÿŒþŠM2} .±›¯Æð 9Ñâ6Î0‡t˜k¤ÕIvxÒüïÝÕ»Ò´Ï4ìèno_»·{¾ºÅ­|w¹—ðä‹ à˜´aë0‹Û $Ûpå lÏe¸²ÚÁO\À M»º‚ÅF(X ‡ƒåÉ l¸³å>XSŠ««u(­@x¸±ö|îÖá.—$Þç  Àœ5ظêRÓ^ˆµ´ù³ÓÅd:]ÎõÁ[ýÃòö—…ävð´œÐæðÜòwÛÀ«ËÍóª+”U^Q‘2´¦™ý±>ŸöúòVm˜Í±ð¦Ó–¦ éDÅvÃý¡ðaƹ¯x¶ÐÌ·lá·´ÏZ­ } Mü†nt3Òט˜-ø/ õô ® [í yô¬8:yŠÃ€_9žõ¬HŽ‚'ôúüíEJükGkXÀá&”J<È(€˜=-ŠÜÑ[¢Ÿùg-ŽëµÖÈœ9˜˜óEß\4oG“ÁÛ¹ñ‹]0[Ú—Në‹Ò?ð½PÚª²zqÔ†ÚËÐ]!R¼uÂë˜ ³’ ³˜¶Ö€Ùä½9œ£ö³TûÓ:=2_°"ù\µ†m(»ºûª²2îæb9îÿÜk4Сâ,`–øõ±-r©€áJàsFÊ19•˜ŸhxŽ†ú]ÿýh±Ì<1l"fNb&éÿœ“Œ‘D,À‚P²t­½æÁ¯Y豊MBæ2Êp‡Ë‡`Ó‚ÏIn”õë ö·¾p G{’¤{ô„%Æ÷žŒµ!™#’è7If6U@?­ pÅÕÄ<Ôh$ÊÒáË^&Àd.o¶Ú ‡VGk ö©Ê%¯ ?b}i—ÍhÆJ«{æ„|Êâð?[æ3·Þ¢ÌpŒFD~‰R Dl~Bò$Íç±èç튯IáÆA§¦%iD”–±¢M­˜(2úp] rGûìÚ€GóÙP,9»£%®’uÆýr¦¿C÷Ì£ÿ–ïð²Aq÷Úõµ9AWèóæàÍlb¿ôoGú>‹2ø±TxÑ(V¤6óð>éæëÅ›®y4åNÒ &OѤQ=E»ã½1ÓǺ¹@«â…c´1¯˜l”g{’ÉÙ‘þÔÈ“þž@”¹'Éú<×3 ;)f°õ·[Ïà÷û;ªµYùÍÞ†,âÒy@Śʤc¼ ®øƒ}Âø-0ÜxëÆ›ùÊ«ÖÙ%¼ZÀ+ß„ªWÿ<ÜÒB_D] .ûÈ©'Ã+cë‹G²³‰Eerè}Ú=`g{V˜6XHêRÇ]†'P^Ò—•¢?ž#}ÙŸÏõÙ¢ùkâ”ÿÇLøŽÑ­§ŸEeR]®#B.¦ZA=ºÝW5IùõI7>3éß«ÙþrŒäÆt¤wß‘Ýsr³gæ7¤&ÈÂý(1iÊ–Ü]‡I —6ènà‚0>ÞË=X<~ eƒ¿H—†„º°ï¸—¯:NgùÝ>Ñ|É/¥¦p/|¯¢éFaY¡n‹I?“±¥P.â„\üó9?GE²8õOtwe8/®¯«;…n:R Ö9`Çc{‹ÿ"Xç}&a*A ê|ìXNß9ÖÍd+£!6ni”ÍB=Øè,÷`tÛŸ# âÿæÝãOK)2SÍÉò~A˜9Œ/×pvLsâPDK⋱¹¡­¤¥L}BÂ+ AdGÙ§ãGÓTNX”:g‘4¡§4ØSEMñ:ÈëX%·q$Q ˜ü÷PøQŒ1) _û¦ŸÅ$ñL9H…JúÓ~Ä-YN$°¬âˆ¨RQø G4ÙÇ/5p*P•A”Í´|su7‹'ï–aûpC™éáÐ+°dgöâ°gj°êe/{jÈ2°œ8ùãÊИmN­,˜t'$+Ø4px;/¢1Ê[ýÆ­@A¨B’v 6^èØ€Í =R„ ³ÂƺnÎîæ<}£úÃ’ Vpf_jWÏ@gÖ&Ak:v­}ÏÜžŒæW!9v O»-WmÐeônM¼è ~ÈÓÏ6Pja׊=ìÓF ç¬'‰:ØB¾SÇ8¾„‹+M~hE‚’ÎñPù,g§ŽóÓ¤&=Ê·s;ßÊ*··ÇÝøëÊHöõæ|çº<ð…µïÑEÊžÎ&ct¢‘ÖÈ5Šv®AÑS®›=1“Åg|pB 1U&³˜L§5 Þ.ÈÄJŽ^ˆ_Ò"Ff¬$¡¯¨°G,}ÿYFf•ØÊ äJE]÷LPEUüvÐŽº:GH•äàþË ð õ‘Û5(Ì]^wâÿŸ'1÷\-ý©Èü­Âª1Ëÿ|§›CM{Á¥-ÖÚŸPKŽ=ß<05×Fseed.cpp­XkOÛVþ ÿᬓªhë{(•|EÕ:†F»‹EŽ}+Á‰b³Â¦þ÷ó<'جÝúeªê8ïy¯ç½=áÕ+ÑJY½,W+ñB|Z×]'Q4•X-ŠRV¢nDw#Åên¶¨KQ-o E™=ˆ_e-Ò¢ÞÙÞÙþ¾nÊÅ]%ųUyóòæÙåOI·u[‚´³}ý˜FIvgÇoOFÉúaÕ-OOÇú°íŠN™,—MÛ‰OËuå:¢½œ—çvp!ŽÄ_;Û[ÖýTº“Ét6ÝÖ½[òʸú}V• d ß¯ìÙ¬¬ÊR¿vðvðö‰~7ìWû°`¤>1ÐdBýnlX&;´vxaØ+ð“}öùð‹@gTa¶Ö¹ãâŒàqèëg }),øÚèð1g!&ð8!£õ Ï±ôs Þ3Ô„[Š`'ÌõÓâÇúãiƒ’B*ƒå ô„‰¹UÈEÐç‚+…µ±MàE/§°cA«Ë>è>­AÊBT離 Xô¶œä´†ût@É uz¿§ÐBkðÐãã3‹iÇ‚1x§ˆ×C„1=ÆM'Œ Ex·a3gŠ8ØL ;F<(¾C;Ø 5cƒ4+Ú‚g6ß!íCS/2æ²Øw ëà4f~6ñ †÷ÁË”)ôyÐÀÎwhÑ&⌡5Ã3ÂZawÁ¯<£ßRèvxo¬h²è%ü@@±àQ­Sæüð%f5B[j™{ù¦Ð‘AÚÁ{ÈŒ"ª”• ›.è.ëú\æ²°ì" ¹G;x=œ{ð&„¦Œý‹h§àqÁ“ ª„ºY¹à·Yà yÏàÏM~RÄ“Ãö”™¦ö)ï‘xœ¬_èKØ ¬:æz,PBfÁÔ›Ã~`à_Êš€—vpêAGÂZ&÷épÁfÌ8ñŒ9ƒlso¬f‰“ ñºìDð°0a½ÓP °f¼p‚øƒ ǭ‰Í-nj9èû„“…»(±û®àDMm²RÙSܥĜ9œáœ¡ÜU¦¿í¾8kˆC¸á¸9G2“N>ââv §Æ4ê·5÷Yjõs™3{ÁÌbîYµÏxoArˆA¸¹+ ŽìG¢%¢Î+w°¥¸í8ñÌn5vˆˆS¸Ý¸E9ɉˆeìÍNxÄWÜœ‘Ü0Ä>Dhܶ©ƒd€µˆ>ˆ88۸щˆ(ò¬ŸäD.Ćƒ f*ñØf:Q?O‰c9«‰N‰i‰ ¸éˆ¾ˆG¸¥¹[Ìœô–˜6Üì*Û ÌÇéÉÉÌ@¤ÌN¼L¤LœFäÄ]Á½ÁIí;åQ v/!Ñq‘*w w9ñ 7q±AKY#¹™‰Cˆ„Cƒ%ˆ¯ˆ¸ˆAˆT‰s¹‰ˆòˆ¾ˆ²ˆo q{¤nFlö&ìÄîï+yU7RœY£û±ð3äþbW'”ÿ>¼‹çŸIž«Çx(e?JÙ_—ÊÊ=‘r¾eKÛÑrO¤ÜoÙ¢îPê2:ºãì}üûûlt¯®a<áü€h¢3$:†è‰îxŒ«,ëJœeYzp­<8øД7²œËêLv?ȇÑ`3ïÞµr­hûâ®ië뿲;±Íuw³ovøIq+)wò´¨×­x¾*ÖÅm«lé]µJC§ŽëJéyÁåÇHå–þ½xb.t/ªÇU[Dz‹Ërþšçû"®¯³¦ª‹æ¸–ÝÈx¦•léï ¢ù¾;W¨âör®Imý§¼ìÄümS*¢£Iõ•}÷¶Í—ëOźz¿.šöj¹¾UeÙŒô…mé(¶´’ùžkâ å­úES>#%'Fúzê#ëPÔ¯þéÃIz¦Þööõ§:KÉóŽ¿yã:c±7 9.i/ø—„úâp(oÿC^ó eµ®¡ÜüÜÒèêxÔYcC° Á6„½£M8¸”ú¹­½VZŸb]/»E^ßËÊdä -í‹ ä¢•˦Àú c ¨KûüÕz<]/KÙ¶QSý¶\£ž”dÝ€¶?D»÷†sß|_Þ±zÆäb-v+©LàDÕ—²pz×½æ½=)0p Š¨Pó¯PžÏÔçL}vê³³58”¶‘ql<*,õ_ÕâL}ÎlSæÿ^GÎcy .f–j^U±çÎn½g]2Û3{@U¹û¨œÀ½ã”yÔuµw¤=c…1ÝZ^S-£©Ïy¡,A2…¯6¦3ÅÐgãL1tÆýœ™=ufÖ;cúË\µJÙ¨O÷c¢7·½¹ýCS^ýtgûoPK=ãüd‘ûzseed.h}S]kÛ0}Ž~Å]# &f-ì!ñ ùp·°Î1uW6G¾ŽElÉHòÒ¬ô¿ÏRÒ¤Ya/Ý{î9çÊ=–ó s˜ßýŒîWQ”ÄA°H¾^ 2Žopâ‡ð+g%’¡KHqZ6BW!Ýâ~Tt/±u)èÖ $œ~ âh:’Yðyöçr_kEƒ–Ó} QZ6Tƒ´ä¹€1ÔͺdnØ#f3ó?è}øè;W_q‹|£‹·Ww¢á™28y"¥SÝÞPÁ•Z¤†±…¦åFH¦‹*L+ìàI¢n$‡®QÓ<“牑邗B!1ÿÔ-´®Ç®»ÛíFÔ:)ÛI ¹qwlË\Û雯ç¦>¡eª”5wöu²zÒlMÎY] \ÚTÈ<ÁøÃi!á*y¸ŸÎn˜¥ Ϥ¯(–U]z§!>é´,‡ª1ét~ –ÁwN ³¹,FÝÆØ?D³Þk„a»O®Ø†cŒk(mÊÎ1@“ÕCZ6¥L*x_§2­Ô`òÂIAQ©)Ï~ie]Ð3n±¶øx¬tŽgÑh{ªÚ-tj)4R™1a—l^EŒÔz;!³ë+®¯|¨’m«Æìîd[ïk4þUL7Œ§¥„6Úå*tl¢>Ün¶òŸ¾EðoßÏ}föùåá¢ýgg,'PKŒ=YÔ™@( serpent.cppÕ–moÛ6Ç_[ŸâÚ¡eˉmÉqâNãB<Ϩҭ@z`bÂŽdHôwëw߉”dRɆ¾]€ :êw$ïÑé)d4ÝјŸ„»´á)eœÓü8‚ÝÖi,¾¦°Û[B”<ú¸àwÊàÊg†ñ‹Ãí>¢ðv®OÖo•…2¸¶øȲ0_yÉíÄòbúËÌ[N?ÎV—³Oî‚|L;ž,—¦aü™°< ¯®éÁ ×4Úo)yJÒÈîAscÁ>ÎØC, ç&û8Ê,“8ãX5§ÐÜc6ôµ cßèŠÃ†¶46¿ŒÆÏì™F.{4¼Ü&áæB¶`ô6s£ñ‰ò/ÒŸÌÝ››ùl5[\¹ÓÅê×ÏW³ÏB'}`11Ñ‹)sI0»"-¸»gƦs+WN;ø{2)éšpq¤ ß9fs„ŒF±YLw;¼Ã Ú¦.Ü')†Dç&C«ÅD²[v'=Åßñª— :*误z© ­‚x>Žê%ÀïÆžëw]Íãñ¥ŸÑñøKŒ’7¨BÊs‘½*\­Û¥:J‰/üGú›¿ÝÓ¥ÏÒ Þ YO3ôä¸Ì"ôŸÓø¯ÉQ‘¯ ”ÇÕ&Ï”Kÿ¥†±v~Øшރ˜8¦q´Üój\ÌqŒné,Ž˜Ðy}ó8—iÒ,C÷¯I*8mË,kú{.H«°“=¶)©|Ç• @_ " rM ŽÇX1)b›Ä7I`’Ð$‘/2U5QQ§â0^L™I7§£DÊ©êâë¯ÿÚÓóM'‚|U'ØUÁšò4°§‚µžÓ@[k}¬Ž Ö”¡}¬iM*(Õ‹‡(þ)ààœ€“ÈFR#^àÐÌC¼…@Œ|Èo²Añ!Ê"|ðE‚ò•˜vOŸ47…<ŸÖlKðtOEêrtäe) ‚ÍLŽ}Vu¶¡¢]ü×4|EÿW- -8¼ìk'w‘'ç–óð2î§\mzíZªÛ(.¡­_†rÅ-ˆ(c\åçÈTó¼È e·nÕeî †4­ªsÝ~ ík(Z•\§†:ŠV¥0×®¡¶†¢U©ÖíÕО†¢UM·[C»ŠV5]ÜNqQÇo·¼Á êk_´vw·èëãG(~ßÿPK=½Ë ßHã serpent.hÅT]oÓ0}®…i%´V¡ ñІHýÈ b¤Q3&"×¹]¬%vd;teÚÇN›6y±’ã{Ͻç\Û=¶á)lðlõ-º^FQ«(¯“¨gpÆá¹-äøû†å€.B=Æi^¥€» èì†Y÷)¶Î½³( 'Ÿƒ8šÌ‚d|X„g3¹+µˆ¢¾át_à)-+ªq ²®“ß<ÂeµÎÅ—ìÒ©%‹ÙOðÞ¼ófë†HFÖ9|‚Ýð[™]¿vðÅù)¨Î_‰Š§Ê38z@¥‰6;Tp¥1͈㸆&ù­LgEH 8ëã º’w­uÇèqlÛv±Gp&aó¾›i]Ž\w»Ý·ÀR†T®¢„¿*˜”BºT 3]但Å?|x.ñ͉Rö“ì¶G-µ 3Vf ç‚V… 0m nEíyŽƒ —ÉÍõdzà)QpâmQ,Š2÷Úu|Ô1DûÀêt~–â/œfvÂi Ú}¶wm½Ó€•i0W\±[)fFC^ÏÂ9øk­¼!yaRá—%‘¤P}ãb§”BÕÚbõœìˆc u“ÞVÈôâÜLóbðÖÇEbNÙu¬ÿpÚÒj”?')’‚‚Rž~²®õDã5Ö؃÷‡Hçð/*]ÿ÷÷Qÿllÿµ±c!½+Á^þÖ9¸dœä^Ö]/–¡c]ôíb/ª9^㿤̓SšÑèÛå˜f+7™‡ƒ6x¬]é·ð_ƒµ+´— œ›g xÊ6èPK= 5­! serpentp.h­ZßoÛ6~ŽÿŠCxv¦.")ÛÜðçe–\\ {½£#¸bæsȸ§ÂȃŸEIÜû²…€OŸ‘ã;:ÔaÃo_z>O²û_£'F¾ˆ §b ¬ „9ÈZ p¡ø |xÿ^è80Ùè½@èøRWxØ(Ô\‹A©DIÍä¨tHWá ãáô{¾ñ(~dFw?¦°ô—‚´7ó%c4Šo`µ,K훟{ÛE‰à®ø!ñÃâGÄÏ—ß`÷W9‘ËÝéNâÉÌD{}!!9 Wtêf\X×f¹¹Ž§ØÙ×!ŠeœÛA‰jçþ-$ûµ²‘º;¤˜"ù,·u–²ìòïûŽY'6p¾\߈²µ†3Ô€¥×º9•%¬áV*ÿH±Œ¶U_hÚ DÑÁæÕP$ ~ŠÜjwjÉ› 2@»6¦„.ÙÔ”0G?Vâ¨ÒS,«åÀ´žºŽ²B]Ît"D“jU©ï5Äb{c‹l)fa‹SSš´‚ÚP完ÕA5…”B $•.apg~l‚ƒ´Ö¬©ÆMh;•z3í™ëi05w…ºDÀÝš‡¾›*Í]M Ü "jéêÎúZ ‰¢ã¶Òƒ55r­/Q$SÃî]¤¯í.­äë¼R"èk½Zm=fú‚ç¶ö¢)]júô-OCØ¢™Rþå5Q—;ݹÁ­Ⱦ¸z&ð‹akc[iÊ/b3n­vØ¢Ÿ‹»n*tíÛ*ß;]ešöj:÷-ÉÈ°Àµ±¯4ñÜΪö˜js*žy¯”?}cK×Ež¹Cx™©Ý½ZðEálJNõþá¶R5A´6F0¶9–ºÝc®,ÎÍšÄkH*·µ!ÙÜE=‹s».…lŠžù«½Â5Ý«È +álÔ­Ê%! üÄpe^ƒX÷¬¢Ï=bxzY iêœÄp!Ó÷R›ÇgîùøulÚ«ŠÛpî|ék ¶¾µþÿ&ã5fq4×wKà ڸ{YÃSck2º†WÒp)%­ù`óìÕ”3ÄâÕ‡´>>3ùºd˜¼â!Y\Ulê7²xoö,€G/¼:5ÑeŠ)Ík n¸7ÛÜ°Ú³É+^{:tJÏê.kÎ µV «v¾6v׌«–js/m;VÁ{†§„o©:ûsÀðùm™:°ý°-ìÜýåÁ!pø ÜË)”ßTwRTHêRZ•’Ëé^ˆ|:kô+' Þ½åÃC¯p¼ý¼/GyX“ãœÖäU÷ó&÷ûS¼KaÃ/ÌíËGR¨ò±”‡ª|"åTºL"Z~.»>cÏóð–ÑÕ=üpJ0Þ9°ŠÓè&f¢8ž¬bšŠ5&qšAðœ18\¥Œ‹¹¤Ñ?ì:“”Þ³x8Ýÿç†Óó½ÿPKÉ= zž&œdsha.cppÔ[k[ÛH²þlÿŠ^ò$#Å‚¨[÷0ÌŽmL’Ì »Ë?º'¾­-‚ÉÌü÷SÕ­KKÂ1™Éù°<€¥º¼U]]Ýê’»_¼ «/\,È.™Î£q2Ž#Ü“ËxLý1I–ó)¦ñ瘜Çãè‡YÜ“qH¢ùÔÏP›î…íö‹’O“xÏR¾îîÒ½°Îb{¨Û›§7Ä_Æ Ó›¸jdÃß®b²NÈ‹Áy¿‡ýóž]œž^ Þ Î»ƒÑ?lstÒžämÚ!éœ|ˆgñÒOcÂ9á<ŠÛí'ãY8¹pÞìÝì %™EqB Ð7'g§çÃ&£aM†CÃW¦ãUX¥„‹[nñ]÷d0<ëö£ÞàÕ›wJy¿Hçgg*oí*õ—)™'ÕØgÞƒ?ãYL‚É']«D¹¼_“ù©Wª,@sgÔB™å<×q4eÜ¡†ŠŒ÷üÆ•®Y~Í5ª‚[ŸçcÞgôåË7³q:L!ªÊkus9_F÷‹˜<_!MmÿÖnñ«+mêkÛ1-fèôx?gPÁõ»=×+L0<·×=ì J†!T7˜e:vÉ0£o²=ÒñG£„*kí^ûAøò^Y?SîßQÕ2D +øë÷È+9FÁ½{õwåË3eýû}EÛ¬k·_<'ʹÞ9§ªFÎüðgòÜÆĆ–ÄKH2_`ZŽç³¦v„™±%Ï_ðçºòY»Ó¸ úñKçÚà j'ëýŽ¾¶º.s<Ïë”ûY³Ôý»ƒ’p§ºº_"Ó¯#Ó?̚Ȭ‰l½A¯K¿Ùh"Md÷ˆözýÃþ· ›Md³‰ÜïÚ¬OíG ËcåbéÏVÉ|9Uî`œ,%ŒæÙ*%9G/9áòŠÚ×ûm?SýùâÒxîþ$ÿ§7þ4ž} Ÿýå så3ÆE> ÷eFP0h• VeDè2â‚a–Κ0ÍÜ΢Î_L—3=öa¾%Çóù‚ÜΖóÉ$Žör¯!Û}-ÐB-Ò 8E¤ÄZN#TP+h„ ŠÐ@1Ôý+Gò5b 9 Ýj Û t§Ä’,¸BNB÷êè´á;¥%Vi6ü‡é¸†N¾S+Ç¢²î?•ÑA‘Ð]A‘н‹I÷ŸIèŒ J‰Î˜ ”èÌ(±J ÌrºÕ@·èN‰%Yp…œ„îÕцï-±J FÃè£ ß «Ä’,4ü7œzÃw£ˆ½!Y0¹ÿ†„nRA)ÑM&(%ºi”X¥ÓrºÕ@·èN‰%Yp…œ„îÕÑ­†ï-±J VÃ˨£[ ß-«Ä’,4ü·œzÃw«ˆ½)Y°¹ÿ¦„nSA)Ñm&(%ºm”X¥ÛrºÕ@·èN‰%Yp…œ„îÕцï-±J NÃǨ£; ß«Ä’,4üwœzÃw'=<(ºQÄWE•‡Xà‡Ÿ`5϶ìy·—?î²E±´ì_"QN dã¤P&œÉ$““b¾r„Åw<‹6,½ùü¯ü” ÆÌÇ.£¡ª,VW..yÓ×!Õ-/Ž\x\® Û #KwøµîèQDùuâè±å¿NB] Š×¶k¹Ô¢âÚL<7ñ¹|'¾ ¿À{OÃŽ’­WVð;þÏe¥ªWð\#¶¨%²Ç5hhÛ’…¤ò¶‰å9IèpÈ6#‰ŒÈòšÜoÝ}Û°¸«Ôdól¡ÀœÀÑ}‘«,¦£G5#p4J¸K–a@<¨ˆ’mé¾cX¦ðÒÞxŸ¸4d¡ÇDĘÃXèŠ~ðYÄ®OE¨oÛ&W™¸`œ_;vhQ_X€Œg±Kù˜lÏÓmÆ­%¦–p•B‡ø0OpêùfH)7 ÀÒyDØqLÞà ô ò\¢¡åžu‡ýîñ1Aϳ¹gßÞd~Zm/8Å$8JÉ$žUB2:öG¿ÎUòì)îÈÁ¡L×ÕvK#{{{ج_û¶Îà>/ú^’Å›³ÄïyƒðùžÞŒW$¹…X S>¾ÉvwÈ”éü3‰ÃµF®xã®er„dl¾ FÚ­¼Ø?>…€ GÃ7ÿ´Üç&éjóóùåéùáhø¯Rö5þ­ÖU¯;t0/NNª3³ãìGsÕçæu)ýŠK¿Æ×jjI=*¨L¢ ª!Q ª)QûÕ’¨½‚jKÔnAu$êeÊɼÐæj[¨ÅO±ç¦¬2b\ tás—UàFÔBfÆ£V•éÈŠ²oGƒw‡y@Ñ }GÏ/ÅrxãkØýuP—¦HãcøAa¶Iý¨ÉȾãŒóÁ+e5V;@@5W 0¥ÞèV+^-:&>Ýåì½z÷K4RëÂK7[Ôé«E‘ÅÅ«®®Œ5‘éq„.þ[äˇ%µÜ÷ë–Úä\nâˆ|ºdˆV Iœž¾‘SÕ)|ÃÁÙb GNÄýà9&y"†ïXðxŽ]Wy`¥Þêf)#S½Uò–ó¥Ð£ŽD]Ï+ ð€«)ÔÍC ³¢Êå(…áÕI%žˆ4 ÕFÈf£ñÆFõ6`\ä&Èf¸‘Š;‚Nö ÍÒ¿zÛe'êùÓtÒÖ¦ÔQ¿f½Ó¹w0_Ô¢Uï A|·ø@{$Ñ´ ÛECꨦ·•*÷ô—w‡˜ºKpÃÇì E ódFðk<{‰$ðmÐâ†v;ÃWø/%¥4ž.^ÖòE#óÛ•× |AIÕmî×Q#ŠœüªBögQ1¸6 ã;ãe i¯T0§¼z¯ ž)Gï_©ªZ³¼)Š·k™()0KðλOž,åQßâ.¼ÆnKáß[üW:ô¸\,°Z[SkH•Ac Fá a?Ède:O9ÊyïÛ[”§Gˆ=ÜåI½÷}­ÖërÎD[ÒÅÏÁÂØ žAȾZN`:öòœè¾ïÉAÂLòÔòe­ÿ£ÒÕzZ_å( À¨Ïðåk¹´uJå}ÄÍGë¼w:²±ºó°2Ð$R2ˆMIʾuâ¯Ìq_Ó(šÐH³êJWÝÔ ôüµðÜ_Wf¡áe÷lÔ?=û§"?×A^Z‡k§ýü&§Î¸X¾ç¨Ò Vwþ¢¢¤VàøLù\¡ÚBÆ6ÕH0£V ª5”¼¬i.lXY¶ø7dC¨7º“ñÐÆ!¯S~ î±:‘æ?ñ‚bµðÃxð²:a4òWÓшŒFŸç(†&ñhÔn)› îLbŸ<…ÒòéÓ¥»¿S"íìa6­îg) ¯Ùj–d¼‘êZík_«ÅßàBÜvëÁò«uv~Ú'GçÝ“H/ãõhq»ºAåG–«1ÊÛ¨z¬«· ¸õ':‚b'ü¤H¡ê¸èÊ4l±œOæàSk‰Ó&¬([-Œ˜ƒtù{þ2éç|¯ÁÏ?ÿÛ{ÓÃâÇÅR¦XfnXÜfuuÞ׃"™Ä² êÈk5§ƒéêÚr:Ü¢Zö Úü[³„ú»,$Ôä àÎ~¾½9rmÌƧ]c-T9ãŹ*ˆ0òUºF`‘W·ìöB­ä¦ÚnÏÛP*ëiÔ„8j$¡¢l‘d¢R¦>¿6äÇ|I$©]7±¡Ê‘ ýšù·5>túÈ× „c§ñ*Ù@¹¹ÿQZg_´ÓH¢f3S‡à"Z&gç¢.l†1úßZO§ºFþqrÂÝDá+9žPçÏÉ"wè¶Ü¡Ûr‡n˺-wè¶Ü¡Ûr‡n˺-wè¶Ü¡[s‡nͺ5wèÖÜ¡[s‡nÍM|¶ §‹ú´^}4Z«H¶Fiá:§X©eU—±ÍÊC0/À4éÝñãV[ßiÉS[ÎÈËXý´ÌÚúà«Ë•¼1ùReÛ’¨¯,‡µ(ƒH ‹‚®7ˆ_³þࣿf1_<”e‡Ö³@çYð}—aV¾Ê<Æu€¼þª„žç“ÜóZ¬ÈÄÓñA!SáíÍOåFµÑpEw(Qkf¨0ã¯7ð™à›øFÑ–†‡GzøêA_oöÐÚ⡽ÅCçaCù5Ê·æ¹ôèEn¹îªŽ§g¢ªËJÄ’À Éo¯Q u¹D˜-_O‹ˆ-±0­ÔúíÖbñào²«u~…ïľ\XÆé†×BwÖ®ùR–ô;{~šæoFŠ÷"­—ÿvÂ"vÐ@?ìDp÷-Ãõ®¥ÚI‡@šÄ³¯¼¡)/{®tù˜›ÆÓùò~äÂÿ?…¤Ûù*ÞSˆ—\ºâƒêÒ‹Üô-.ÿÈ7 ´Ä†ï»àq*"9GJÔlCÐN‡üÖþÿûâŸo’gá?Šf ™|—:yr;IÇ‹Iœ9[õn<[ܦ²{Ò¾{ìá–NGY3=Eh^w”Ïúáev~GÝÿw»qÛÏuÅçêL¼Ò0.AœKæËlH•ßèÊB¾œ§Kqe­1õ½|Kê=cR·A#êêvMÖÔ-I}Õ´îÔÔ]Ò姟 Y«i”ÖÕ<¡Fuù ŸKþÚÉšï=ÓჄop¯3n‚Z®b÷¸)l¤yBÒñÜ nÓêV(”šÏp«—GbpØÉa¿ÝêÒ¹R.5"&îrJØß4±da¸”„ë³G¶Õ$ ÉÅ•û'Îå[j/4’ïª[j/Ôr·mJ€4²ð—éZyO&ò) ‡I­ÜÎVüÛ!ÜN>èûä㶠ÿ;üÕôcë\çƒq(H'~ü‡sMqo‰[|89×÷|½"Në(üˆrÅ©EÅQÄù…ºiýñ÷­+ºúÀÖõ5Û½^£fØkÔl{jqjR£Úœú¡Fu8õ†SËU4—Hbj.yî®&ó»xù]ÆâÅÃÃiåÐ4ðäY«’¸×JÅøQŠ>Çí!w¿]äaZä!¾G.EñZz…5‡Ï¯Ð"Lºs"²)“ºËÐ~DZ—ð ”;¼¾ÃÀ3¹àsZ A+à1 wø,Ð@ÀºÆÿP”#Gx‚(€Sq¬>:||\‚é :ʵÐë»ì‹dÑ(Çd‚›^íRâà‡´ÝÝ?:øòñ©‹;(yaÒJÑ‚‹MînÆ“Ø?â 2 úÇgú:Ù¯Fˆ/Æjï‚ùl3Ž¸Çe~%…‡‘ù,–xƒÞeG•ÿ£Ê1²ð=žµ ´"œr]^ÊÉ "(™äÃéÐ2JºKÕmáB"q%…IÊP÷ë ÎÃaÅÄZS|ž6ˆ¥†ÅÄz±Ž)k4«BÈ þas5QN%h ‡®õÕ:ÎsalE¯‚tb˜ V—á¦Îy"X]ƒTƵ’Oex¹ŽµñžVÊ—8OOm§PÀ‚í‚á°k› VJø²dB‘1VŠ˜j5ë‰`匩•Æ“®Yh0¬(ˆ`å” B;ÓwD9•c&ïúÎq:ÆB:­× ÷v*XIh~èzÑõŠVRZ®l c¬$5ˆ­ƒh£$‚•µfœ(èH‹•Å¦µõ½ïZªœÂjk{á˜ÐD°²Üº¿•¡-VÚ› Šð1¹Bƒ3’óV:Úb¥ÅEˆ=a°Ô MN§¤€ý±Õ›ƒ ŠL72•GçbÌ3¬¼: =2ƒ'Z­<»^2‹FµZˆw . P‰x̲ØEM»Z‰y †"`!ÓQˆz­ ‚•¹×Z¯„Øjaòõ¡o ¬Ì>ãìÐÉétd¦ŸpÂR·ªÔ?¥c°0'$"* W¬8¯ã\j X2g²St3UÐÁ($cÔ;*w0°Áô |â…KȺV¹(©V+·0ÀêÓ NbNå¶m×Ú~f9•|ØjpG&,™ÇBF”¹ÀUN%':&É%˜’}¤kGåW ÙIÑjå[†yÄ& Ó“€áиZ™0vÑJA•ã­Ð2ú-¤t¼'c ÜÀüz-Pñ"'cеÁê:"ƒxOÜjhu}à4RK3 ƒ B ‡hèˆÉ1˜WXtZ+0˜Y8D¶Þ0…ceà‘Ääœæ‹¶¢¤ÒœŽQ˜à´ÇLé`ˆ?JiœÓV-TO @ú>Be9˜œ‹Ž(&>@b­`Mb,(:Êû6@GÁ\£®£9€DßûHÊ,µÕÁ»B¿´~DÒbç•â½ñÊ* ©‡Þd†í''k°©yøø8RZñH3{Þ5‡ø`Ó÷Ùêa趹¼ŽûŸw‡Ø|õö»7`¬mÞ~Ûpw~?éæï÷ûèC6‰ã¡¾ðŸ74f‹_ÿãŸ_~Ñâg×þÒü¼»¹iBôûô Â#?K•¿Y…ÇÜ6™…¿øew÷4zÅþ_b»8Èî*ù[ä5`Å[4Ä»ásæOkàwÑ?­@—ÅO··Š‚i*àF¼†µYV»JÒüi±Þ©öt§Ä9ÕÊS’3i §ßN¡/¾eÿ+Ùo°H˜¥ØËnÛì—‡Ãþæ§ ,½™Ó´ØÍM‘íÔ•ï£ñ¥²ðlY©»²+EW«õWîÜZE÷XP¯ÕºèÀ>×9ÓÙRX™¡3tVJ®Œïé„Þré§ó4·¬úm<-ÕñT´l× /Âÿ2¦;¿æ“ ,8ßý¿ÅÈ—_`þˆÃø:Væä½öxq)/Ú ” 2ù9¸³>Æâkês¢hZ@–ݱÀê3í[ŽFXŒÊMüüÀ$@`´âjË ~;íù:Ž‡G›¼b]Ïчí‡yÉK²iÉtþ¾>T~‰£xn¯Ö‹\éšZ¯ÄØZ•§8•ÊUÍê/}çYU¹ïH8mþŽC(ùnëW[Btmß !s{,S§böˆóÉ32Mj+ÌV*ü^îÂæ½P(ÊKôþ»~IÊ»Ê-©e/ôëé£D¥yD7@CÜí!“ƒ4%µrI‚ üéT­ÿ°+÷³y¬?įLÌJïq¤ò7¯. °½˜ùhêûîÎ_Ló¤œ|aJd6„……©“&,¬Œ¹À2³ØkC—I°0â’d¬’Ic{¨<Á Ý•VcãÇãÂC…/É6uT™Z5`˜SÂCJù¿·»ï!ƒÚÃf?“2‚E­2×úž*p|šÓ:C%Z‹Iصæ2uIÈ=F*@?ø¢~–§¹4Kðöøl5m›>Ö£4̘˜Ìôiã\7Æùðù³ƒ¼|ÁðcàÓúlY|<4ÈcG8 ±kLÖGRg¾‡f->Ák2_!î}s}ÿñŒñ¡ˆÎù¥1 7(€Òl÷´[ÙÌ,ö—pk2Û/8ªaÄQ ¹‚d=oîo\äwV»µ´§®à»”©ÿ°bÐ)‘§™|}R ªø i–mÖîòÕ»bõ®Ì‰ îè\·¦poo§é‘´I>q¾ø+þi>³Ëœ7ÆÛS ç\ös˜©ŒLé'A,Àñd£žúv´O‡ÝJÇEêˆÅ¡€åqîô•å¿ñ‰g=éuþ5Ëp’õ#•ÒƒÔæßG­ i5‡¯®¡ E J5»îŸ‡7rµ(N¯!{|ß8ƒCx£~ÞØS)Xk’X7Çž-ͯ$GléE1„’¬—ÿE€ aÿ9@а?‚ÿ[€à¯ÓÿÁâ˯¿˜Ñ)^¢?Q±ãT 1 zÉoJRIÇ0²,kdŒû”7¼82RŠzÄ¥Œ¥ù@EaûÕ›¥‹üÖ3èñBš¦{>W£àË&t YÍCîÁ QÅü$õž«`ª¨âÞLR‘.bõ²Xúgf ú|9>§¢-«æëZtAÖ¤@ê“4¯…O1÷÷-mgCÁ•f•¼ BÎ€U»ß©Ü©DàÔçK–ªx±Hì¢TÑG@ÅK/ NŸç³Ãe,ñ´Ñ„F¬R…µdj%”Šv7dÓ%D!I­r>1¼tOP$sêÝeTú)6Šœó«{-Û+àQ²ˆ •‚ ˜®«›ç-@fÂÇš$Ñ)¿*ŠPų’+öX 2_@áP¿²ëÿ¡ÝríéصßÙÑÝ ªðððLZËrÇOópÚü3shšãU¨8¼ÆÞ]ZyªÉ %ûš2±TªUfH~ñÏøç¾uÎK>0­ƒ>À”cùÀÔ‹Úþïƒõ¬‹íétöeÛôÂ(›#9Å´8å¼irŠNù)§hk[ÊØtÓ÷½ð­qñS¿Û ˜EU{¾— ™(¶æg–4ò|ì+æk^kê¥çnÛyÝí< ¦ì€©T&g«"ñ©É>[r%‚¤LøC!–’]ó,—‰è³Ÿ$f;õxÌ“~·ó³ð×ØŒóœgŠyÉ’}QÄ••«”¿æ§ìVf˜4¦(’•Ìb¯ìeÅùráù!“Y·ó¯‚+=ž>Žƒ{Š³Œ¯xÆrÉd‘±'¾P"ç—lçéå`êÌOÉC.“S™Ø1…©åº JŸbL™èÂûKžÈGè)öŠè›š<{uJM=HM#ÿ–ãM–J¥Ä"â¬H–˜Uä=õY­[c[OžøJ­â,ù2}ÎD°Î»¢%ã‘G" ÇÛ ™‰$`¡h˜ÔœÂ±ú«.y9B±•ÀÉǼËûDZ}後cdK¼œêr¦¿óLF§Cäãµæä/"ñ£|•úëÓõ«Ý;Z¤t«Ûùèþ Ÿgî <^Ç»ÎMöœær6ëQP¡>敨œ=Élyq^‰çöñ“DNn(â%¹úm|þ…½gÝÎÝÿ_/Îïïœá·áþߨ×7Ç&ÃÉx76Ùy½~­áÉ6X– /L±É6¡ƒ OFíY ßµu:4e\LÚ²jk¸ê¼½á‰a¸“ýN8~×JEÕøÙ*Æ:¥¹9ÀÅDÉ<ñrr¦<žúV9MPÿ^í<_¥Xn´?ºêqxMqÞÛ ¿úGÂ]x}¼pººHºWM`@À€€&`HÀ€!C†&`LÀ˜€1cÆ& " " " " 2¯ox}Ãé"è"ébN7EØQSM  f€˜bˆ01Ä 3@Ì1&f€˜bˆ fÀÄ 3@Ì1Ä ˜˜bˆ f€˜ÍÌ —g\ôoñÕþ™Äà¸}¶QÅÉIþœò%_±ëHúáž»ÉrVä?”Í÷Ù½ÈóˆC²¾ó¬àåõDzÂ5¡?]^be§l×AMÑEt‘t)ðP  @@€B „)R ¤@L˜1b ÄPPPPPEooèø^wðåXí¾23z/à«`xU}üÏ7Ÿß¼gcÖ{©¾ó´”DÒ5ÍxŠÜ©äÞ~Õ‡-ãàç8Î9iŽÙÏ1Ñ«:ŽkG–KŒEñNhœ@–KŒE‰NjœD–KŒEɮиqXB,1–š\Ê‘æ4¼Ok97kq'so¶3l§¤‹áSˆrëí× ØÕ<“yt+¾ñ¥£ŸÈQ¯–Δk ·& Ð@¾”& Ô@±,LÀBåЫ€ûPœN6£ºj™ìÚ}œRçÆIéO¯¤ççõÌp–uuaÔÂNuZ@ÎÏÕc©«K£DvªÓŠ2nð‚ZÐÕ £rvª+bµ‘<®˜+¹™;οq̽¿–¹› ØSõžêµl۴ξ4ªòª^õ"Ê^¤¡QAE•%´0@e•´(¡žZTТ‚z%”3“~ÚfÄÛ§”^/ãIcF‚¶©Ë gdäÿÛ„ÀA –&Ì&,M˜MXš0›°4!`6!®½ qíMțї«æ&ÎrÙpímˆkoCÜclXÚ0Û°´!`¶!`iCôdg¦—¶ ³ KfâÚ»×Þ…¸ö.ĵw!np”$ì\ˆþ td²Q6&D%zaÚEÛx0{°ô @dbÚØX0[×Þ‚¸öĵ· ®½qãagAÀlAÀÒ‚€Ù‚€¥³K f –Ìĵ· ®½qí-ˆkoAÜø(MØY0[°´ `¶ `iAÀlAÀÒ‚€Ù‚€¥Ñç/cÓ¶’°w ®½qíˆ{Øl`6•dy¨¤O~Ê}øöDhVäÎÇ_îï7çMÿës¡jzúÀôóßݳËË_Ò% üÁâ9çìµHÒ"Ç´Åïü1gO‚|]¢žT÷Têùüž¯r:{Z‹ˆ3§Ä±qG¹ “PœýÜæÑÇ}dγQD-|“Ù¢X9ñ£¦çô»žå„~ó‚î³M.›{úÐm÷¬·j  h8díexRåö¶~Û‘>Ã;šãR«ø¡Ú/ÍaÎîÉ[¯D]5ùÿı“,w*‚c+žoºî³aŸmÒøŒÜß%”ŒrzµþÊôëm?dEâÓ/\nEâEN9»kO­·“KÿªžÖ™|º[Ý%_½H,·U©WGÃÊk”ü¶Íá ­#3ËÛ‘Ða>aÚfÇï§ÏN™ä–…mÿ[¶6£}ù‰ |œv;ÿPKÚ{TBOñeÞxvsha3.hµ”]oÚ0†¯)ÿá(» ]K¶ð¡Š¶HhËÅ5™¦íÛ«‰9κ®êßqh …ÞU½ >OÞsü’ €"!­f'p¯…1\‘ ò”PÎ@H0 ‡¼\¦‚SÁÈò~r#"\Çu>‹•d|ÃÛ_óx6Ÿ/¢›Akqƒ Œ ɶGÒ´d<ªr“Še3ñvçËTÑ»*ì:ÓÁ÷q4 Ç‹Ëñõdêm—šÏ6œH4_]x‰1y/¸lÞ‹;‘s&HSéu`O 8iyýêq¾ëДXaÐ{™ò†I¬‰,VJgÄ%]çÑu6Ùžë|²å~) ±–ÕŠ 0±æ…‰Ä?Þ@N¶¨ÏþnêñmüÆÙr^!FuK¨’…GÍM©å+^ÕXÖëF ¹†AºVxoI6%Ùa«WÍzâÁ˜H«¨jòw‰G§o¨™åFd$C)†3.Íüš›mr¶:¿WšuÛýÍpü£ƒ9#†û›Æåƒáp$d^šc(ðÝ )—k“4Î^ê½Db]JŠv%$Iý $ÁKÚ2ìÃÖã%ie8ÅZ{OB¦Ö¯ÓS„_¿¢÷C8:Ø3"®Ä_Îì9âôÒòyÊc;}l@­†ŸíootŒ'ªJi¸Æº§JeíºE¶kçÙȞ׶žálŃiì&×ã(Ž&¿ÇpáiãÙ–ä[÷UÐuË “éóè4!çªØ¾ö¬ƒXÏ.ãPy§ûå­°VÞé~ˆòN÷må­Ówí¼]ïI¡±o+ï| ߣ¼ÛÞ*GÒG(GìŽòú³=žŽªï>—L¬\ç?PK=4ô= Ù shacal2.cppÍW[oÛ6~¶~Ñ+‰Hݦ@n늴™‘´Û€.-x“ÍØ– INã¬ùï;$mÇNê‡íaP¤ÏùÎíû2ûû¨RNÇdO§h±9:—·ªDWÓZ•ƒ±ô ‚ÐÙ߇¨_Õ­ªÊUj‡ªA¼}•µDBÖêV TÔÕD»þ&:¥êÇ©Ét,'²l©ÆjèÕÏG»dòÃP¢ªVUÒ± GKèxŒ&•P…âÔf¤ÊjÁ}:ccÅ‘¨&T•{Žóƒ*ùxÈS>ܾXÛX6·±9Q ×;ÎÅÑû³«þÑÉÙ—ã³7o/Ü“z>m«~ßstePåÉÑ»]‚ŠYÉM麲ºšÁO! U*Sä7_]î‡ÜºjëŸÔîO¼ÏëŸ8Üü&Äóáø Þ;0e÷—e«òVÖ´Gáot!ä?ꢿ­‹Ýç…Š]ÝÁîóövwGÐÅm¥ÄBݤ×;¦ìõ>–|(ùHŠ+ٞ˹ËAÙ-ü6h%Ú™5²†=ÍÊF J8ä ªÉùX–>²žt"¥ã™ìSU7è¥çüétŽ@¶°­àßÉrÐ]‹ÓÓì|­j´SÐ!š|ËÓÙH¢´ÛÙ~´%¸Çoß|9»8}{tñå—ËÓ³KÕ#ßB÷u/]ª\–»ÊÔ)ª¹ ’H¡W(ÊàÿnW£»]Ïé@­zô '×à‹àuõÒ{׬a‘›=lö¢kµ³ðB6Ü÷èt:û;Ní€ø§6>­k:GLg@m…¸še¸dO{î;“¾×ƒ!¸‹Š=P¸Ë<—{®ð@Ôná¹Ïé‹IÖ0ùÉê¶5-½cn=SPª©¬í…â£)…Ë .š9WÕÄ]Wã1èNW`hÜPâÍ!hç敦ó¦{˜-˜|þ»¥i\ºCÓ´2h¯uÓÊ`<šV†eì¥iexLkM+ÃzEÚ´2lK†‡MžÖ9Ñ=åmÁÓŠ(Щû¨¢•~¶söðT¼§òÿ'^8îÀö¿­àåµòo+¹¿E`Ø"¦þ6ùõ· ¶¿Mâým‡¢¿íõ·¼ÿ@É‹Gìê¹h_FUTßòæå*à‚‡·ìXñü¹°rÞs6Ôøä’>ÿ”DpCiQwÉ()òÌGÁ]ŠÃ4Šr¬×,æAÁx¡×2g±`4ö5 Ìã„“˜iCœãÂr¡‘^S†y,…ˆ,H)µ0ɘ@¢g1“&PðTðÐRÂd,R) „d¸0N9@)@º¢²4]µi›q.ÕÄŽl§”Uý÷Å Të¶Ç=ÄŠOî=÷žsw؆G°ÁÓO_Ûë0\-/½©·®.Q§À‡×>!»ßÇß7,Ô·ê0N“<ÜV@ïa7ˆÛ/±u"è½AQà}ô—¡7õWÿÃ<èNå.Ó" {§ý¯Ò2§×µæ|#ðgù:a_°Gˆ&†lÉ~‚s:t­úÓ-‘Œ¬¸‚ÝøŽwç6Ïù™‹žPKi¢‹8*¸Ò˜ÆDâþ²„¼äNH¦ã4 )t{øI‚Î%Çíª‡“a{üŒžÇ¦A;Ç6ïÛ±ÖÙȶ·Ûí` ,"l@Ej+JøIʤÒ¦jë4éhÜúͱ‰‹hB”ªu%6…Ä•’§,‹AÎÍSà¦sÁ®Šç0¤àzu{ãM>žGÞÅ<ͧYÇE­‚¨ ¡VëA°æ46ÓŒ–  S»•qëÜÏȳpλãaÆ5NJß­½ÅÆÍ[’ä&~›IRÕ+|leRh "S¬œ©çhÙ¤³2:–ƒÃéª8O&çåüª|õíüìǵÌtþl„ÏiǕ×ä†RPPÊãÑ!Ë>^(f¼Äjqø¸´ö{‘ërß«¢þÙØ þkc‡Bz—¹gä‚q’8~Pv=¿,ã¢kóÃGoü—´™L+4ºf9¤™ÊuæþŽFGÞkVú-üÈWcÍ KÆfÅõ¹4.d"=åÂ퇦=ûÜNJ¶ÓéÓˆu:_u²”dŠnB›…ÄÇçìZâ3Û²pð$˜i1dë¨T•³¨<…P¢¾_¢PÝJÈØ/dd0ýLs¿P3ƒií—h`ÌýBfs²_⤨y–™ØŸgžÝ*Æ1Ïj5›;ìF1ty–QÔ4wØõb´ò¬†©'ÙÌäÔ)ݪîÊ’®’>_  )PïLϪ=«sxdÉËþ*N8æANë §yÓ8È1rê9œ¹«šú)ùY¨T¿„ǹüÑñjjl;ÿ¦‘$R²hi]ÕkeKÍ÷õí{vÛ#÷dðÕOŒ öÿô!ûõƒSûPK=Ì °WŽËshark.hÅTïoÚ0ýLþ ¤ %jµ¡ ²HüHWÔ.JWmÚ*dœƒXMìÈv ¬êÿ>;!¶[?Mš„"òîüîÞ»‹tÉBX¢ñõ÷àæ*æ³óáõÅüÜjh”2x°ìvý\Ò¬¶mY ÊHœ…€ê„³%]u£z“@îaû [ÄœÜÔò‡_¼Y0{ó‘÷yê7Çb›*-]Ç~‡æ–T"# Õ§lÉQ¥Ù"¦Ñ „#C5£¿À9u;eä Š1\ÀöØJEÎq¯ƒŽõ¯÷:éšg,”ŽN8q­G«&V:¬åH…H„jÏrh¯¸ *J|œ@³…¨L0TÏ›;òêƒ'ëi`·‘ƒQ$`ù©)•öm{½^w×@CL»„'¶$˜%T.l"»‘JâFÉâîþ86v-c) õá3öbrÆ4@L8É`¦eÎŒ ‚c?Hÿj~{3]zh„%X+Ó$Cתiš"­oÕjœ†è+#‘™n8¥}n~-¶ P[ϼƒ2&éŠAˆ(S(ÎÇÐÙ¹j ¼Åq¦B¢÷)8iiëj©à ˆ‚ÐÔyÆÌE>¨Ì€äÝ:k.ÂÞ· ê>LÜ áïª=F*¢µRN@Ê! ¿q‘×z&²+õàf—ÙÙ½óLåï­"Ë4UÓ«‘I­h±-ÜW…i¿ÔË”–姌ª3.´ž™›;oèV`z|¶£y5¹à›'{wƒ—áÂ#DLÂé]™ó¶Gøýs™û¶Õ6sÙU6ýŒ2;žŸ{0½ò;f=\ó0‘þ€o›x‡cÚ1×<öÇLåòdþ)õûÖ©Vy‘z`**såÒôü‰¾‚…tiýPKŽ=Q(ÏOY³ÜË sharkbox.cppŒ½[¯®_rÕwÿÿ[pÈ ó|hÄ…V@$A¤\ +šG%²‘MñÝóÏÞmwM¢–­V˽Ö^ïû<óP5FÕ¨ª¿ÿýÅúþß}~ü½ÿ¸þÃÿôþÞoÿo~ð×ÿaüÕÿ­ýö¯ÿôû³÷oþôŸýÙÿù?ÿÙÿò/ÿõ?øgõ_ÿãúËóoþáo¿­¿ü‹¿þO?æýOçÇ¿ûúoÿÕï~÷g±~÷»¿žù_þ}ÈåÏüÓÿí7_ëŸü®üÉß3ÿ•úŸüøÑÿ_ü"zþçÀéßý(Ÿe¯Ç?þáù…ú³¢×ø³ß‚ãï¼þëGKüë ßT}`Òý]ÕÇ$§ÏÒÏrÐ7eý¬ë9x˜AOäõ?º>Fß\ÒÇèCÓçë=NzL=a×ÿLM¬ÿÙº~«ïü¡'Šü»ß|Ô×;½¨×¯õ?}Ôgýpú™>KôCîõM^‚>:ò_¾}oû}`ÖÖ量çÒËë‘|ú>FÿS¿^ïósAôwUßÞôïò÷NEÿD?Ó—üö£hmœMŸðãÇ÷o´JAŸàµâZHõùíÛ}ÝÏïÔҽطR¥è•þߨ—*zV}Œÿ^ô{Ÿ¤ÿÒfþø¹ßVèz­@Ñ—h-ÂÏEjz¨‡ýKÖc6„ïS«þ6Îë1ôo ¿Çü>FÏå¿eþŽ‰þ±Öÿ7ÿ=vÓbg-•žÿMKå«žæÛÖ orzùo½¾µ¨ß›|ÇK‹ä¾'ÔšzÕßÇh¼¶Õ‡ø;ºî[´ï1õíZ/ÿ‹ðx=¡×wö®ƒ­åó]?Ô+ÿЩ ßû8}©Ö>è~ôï¹¾¿Ów–ï8‹ô}±žHgŸ«§oNß©Ò~«û-¤žÆë ðaú;ý×w]ÜwÄõ%ßéîßÁÖSëس†úæòí™>æ{Âoçów¯ôßÑý.áwµË÷ÀúÇßüvU«´Â¿ùo÷Úw¿µÑ3øï†éï¾/iŸ­Ð/Â÷Ûï¼~æä;:ØßNh‘8‡ß]Óo¾ømuûN¤ž0|BoV?Ëò1-î·šßÉýŒÏ·\úw¿bÿ­®îvÈ߃|›ùÝD}Bü~û­×÷ ß‚kç¿/®ßêgzÖßþû?ùÿ3œÿüü†óçÝþÖô3<©ü² ßáüy™“ûýʵ¿9Kß~§ïÛ…ïúëEûŒÀwF~>öw¯¾sÿ­R.¿.ów¾>ãð½ÙOS¢³óó0~¯¢Mÿí³…?Íeª¿öúçmrþ÷‹ý=ˆÎág‡¾e éoîíw]Òw«¿óõ™úïâúôË~×à37ßmúŒÅ/KÙ´zýå¾ÛómÙwg~ûÍÏ»÷eY‚ïÈÿ<ãÚÖÏ^ý¼zù÷žê3vá§el¿Œîwjûizÿu.¿ú]ÅÏÇ|Æî3ÖŸúi.üþýt\Ÿ1ý¾®}—þ3qŸaøö»üÍîå÷¶Ü×_†æ;d?üÏs˜~]Âï®}fï·Ï3~Gí»MŸû.ÄÏ›¿ûÑ~ïÏ}®é³¿Ÿ=ü¼FøiŽ?÷˜ë/ ûË‘ùß{ÙÏÜü4ãñ—Kû<ãgGÃOבù°ÏWï·ÏÉ–ÿóùßÅýéT~Äß[–”9ÅÏ^}wè'|Ð#} á§ßìߥÿþÍwQ?ƒøÙ€Ÿf¯ür?~ºÌþËX|Þò'hˆ¿wHŸü¼Ëo?]û÷{DðYþÏÛ|¶ï§{ ¿¬Èg ~zûÏŽ~V½¥_Vö§¯øLׇa>Köð|é§ü¶¿ÿ²ž>ùiŒ¾ÇüîÌw«üÞZþöaÏ=þrŠé—×ø,Ù}~¢—ŸØà÷øç'0úÞî;é÷nè·Ÿ¶êónßÊý—Ëùé×jû½Õ-îù`ÚŸ—ü» î—õüiÚ?ðãç~”_vû§«ú[?úï¾5üÞéû¬PþƉô_ô çþË¿Ú%̹d:ÛŸÿ­õüÇÿè?úá~ü£üÛÿQÒÿú/ÿ÷àþ‹+n·Ø®/7ŽXò?ü“¿ýÝ(­åzN^ãärËþîÌ›1<9®°ÒnýW2ë™æií´<÷úÃß¹N͵²°‹ÁÿáïB£î×½#·a~×Úîs7°€3Gg¾¯ÇÙjÎ#]¾Ô›çÜcõܹe²¶Ãü]Ê+œXú1–q£y÷^Ž¿|ìŒ'›þðw³æÊŠ¥˜Ï¬çšÏl±ÛÜŒly¹ÕüÝ8±Þœ×ªþ†Z‡ù]âZd6bßë6ûsïþÔ4v\{–kžep_rO|ápu›5Ë1¥ '×0ë4ûǃŸ¼YÒxïIöÝcíåî•ü>ùdówaÝ^R\ù®Öøà?üݽ{^þ05îëÁ¼Cì©ï;ç\·6gÞÇÎ¥ö½Ý:«ÍmÞá惓]Ž›×Û4ï‡Á‰%¦ZÂ*-®cö}q,G¯Ñ%ë2ÏéfŠ ˆÛ] {$³GËåÜÛÙû®<Ê1ïÐO¾;úQkŽ7Íf~7îh\×å.ÎãšgáQn™Ž¶ þÝüݾ±Fœ+äåÌ»ói·¸SÎ^nõnÎõâÐn7çm9ÏsÌäèºêG;ëΔy¿àg½g®Ýç~™ßñÚ©„6gbëK¶gÐîPâ5Òâšu™ùÞ¼WàÏ ™½Íc¬X®zgfÿNs}ìÖb÷”d~çÎÄáÆÝv ;c_zË8ûž‹.×mÖlŒFâÇnrx£±=uúv’ç´°s›}À𬈹º¥®¾¼ùÌ͵¹N«'ÆÜÌû˜ÆL­Î/›oÖ,¸{ݵÆ=£æÞºÌ9i1ø]kÃ|Ÿ¯;d™;K›Å|_ß»N¥ìäÍïÜóæ9ÇðŸÃÅæ=ŠÙ¿8½8ÑšñõË™µžœ•Ä–»ÔÚʽšu™¼³«±­âúIÆNŒ¹ÊÚÝQn¸ÛüGâú1°¯1uçÍMÇÏ×µ¾xàjïtª³¶Çä÷%Ù3„ܽ<“K˜<³ž¥Vúì\Ríß. ùT.ôè½»tô7ûp+Ó½åØg©­®ØF#Ò¬]ºeß¾êI®Þq̾×>Ùº•ŠVz\³fN· å*«Òœµ=˜M–Š%u‡fþn²¥²‚—cgþ®»û=kÖÀnY‚ÓÁIcÖ8n%™38ã ûàÙAãsMówÉq'fGPX<ó;€Ð%§Õ±@ÓÜP蜸+Ö­žpì™o‘Ó "ÃÊôX¬ÃEŒGµ¤pÍgvwö…üܯ*ÙîÃÆòLxSÎ…—0ërÊœmñãl®°µÉ|Ïc̃ÈÁü]ôk¶À‘Ìä˜GÀÿ<=5·œy–ÎaÒZÀÜåÍ;¬>1U13ŠßÍþ®ºUÒ‚7°ÏÂírµÊçƒ9½NŽúŠ©°€ ów/¥›çýžáX 6‡Ã´O?³˜Ïl@(._Ï>×ú??;?^ÙaF×4÷ˆãy;°á~y5Ï2°J€›X±Ø3è9Ï,ä¦íÝͺäž#[=Ž%ÎmüØX4ÐiInìsÌsrZZg×ÃØ÷œcÖsì5ÙnY_œ sÿöᾶÄé… –cîCK ó΂XF¹×5Þ°ì¸=Ð(bÎ'w$…Š…h)û`l$æ=¼ú(“‹?Ìï.{Š Hµ×ê·çeûéBÙ¹»†1þÁÏÕ†®{ Íaö˜ßqánÏ´K¬v­yvÇj·ëJ™›ïKW[”0±\Îaö=_^¢Ëe;QGZmƒ3×áêF‹X²Tðí»-?²ùLWs?g³ ¬5ó,í ^í¦TÓ®Åü.òe-]nçÝ#$ó;Î׌Úrë㘵^@3. Á”‚Å­áÆp”XÌâòÜeçÜu³€Í>äÊ6ŒÈÙ¬°bΞht@bln4g—ÂåÃ\û`œùL Fwc%¼\tή™<)[f§cîmÄ>â÷.Æ Šey\ìÙ£ûhÏ 7´~eZKnÖÇÝI nÏæ®ä2! sj†™ï»±pjÇ„ éZ›{ÛA˜‰—d Âfx4®HX«yHB0gw.^¯ø9òî#MË㸠ã„>¹ cykË9]»‚»×“=6ç…³ã8‹È#›¿k³m†Ë)5ër'n“7ó=îæ Âls†ÈÍÊ‹„d¹öq8jWƒÏ ”cÞ!ÏËJ­Ìªb0®Ù#Çí¹¯³|œqY»Âvú:¹¾iš38áY«¦€IšøfÞ½åsÉO†y5{gຳ®Çû›ßáÅv»Ã ˆ×¬Kupʽ4o¾ï®ÀeÓÁ«W9æðk¹G·ëPˆlÖjê¹x :.{ÎÀï¢ÿל¥^¶©ZDÐ|ð…c?90ÓWœ«y?¬Mƒ÷ךˬ'gWÝ/¯vK6Ʋú µ NÍI%Û³Öélí¹›;¶Õ ÖX¹L«.ãÃa{]½Ày8oÎËñ'àZ¼+kå̺Ôt$?@2Û¼{Û2ú@@øîÆOXåUFô 0™¿ÔákùÓœÜÉÖ¶N9Ϻ®u ó,‡Èæe¶p²~ÖûÆÙóÎV9æýªãFlÔw¬iöˆ›ç`Ù©–êgóö,uNvu¶xX³în¡øÓë²ý4Ù=ˆ1Žwš÷ë(1<ì¢ØgÐeÈ-îÁézšõ Ý=~?ͳä5BjŒÕÚ,×[l¿2Æò@ËöV­‹r…+;‚jÑæ7V–Œ‰ªž__ÿˆEÁ©ÈqÅ [LÙ¦nï¹U˜=™Ñ§uÛUpuÚüM®}C+¹¿wé"X»®ÔÕ ØØ晇¸L?€l®Uk×ñ. ÒÄrXîes&À²Ç¹ ˲‡'äˆIéÙÆ~Ø—“¡ u@ç—ÃU´– *6&ÝÖ\«8{(.XLr±4› ˆÅîÝ'VØGM ð±eó0œÌ7›á¤åm¾ïòÏkr!S¹=ñÜÑ؃SX¹¼Í=bÐO<·…E³±z„âÆ96Gº øÉe¥?ËiÖ–n hk€d»Å$Pñ£T_gó´…6íôÌÛ5Á5n·ñGvŽ‹‹9H0¬hñfáp ø©¬kc½ ”Pâ†b瘦1øÀî<+nânãÀú­Ô2¼uë'0û‘šQe±¶ƒ'ù<”« 6ïÃAp)+\ÀM6AÚ‡…™©œ›¾ 6ü ,v³ü’³PÇm’Òˆ#Ÿ'ÇÚÄ_…½êƒ +,ã®\Böœ5$|É·£ÍK²TÐË3 úÜ!èäÆây«¡ñÝC>ÎÎm>´ÙóøÒäoyrqxàwoùjóL8`Lc.ƒÔÓ” è}út+olÞ|ºá^'+”Ÿ¬^‚O¹`]ü<–G]ÈÝîÝiV Á--Ð-¦.Ù¼Oš>H<„urÓ[½ÄQ$~@b‹2°6÷w“Õ^N\–—NÖÿœ¬N±9¶ €ZÄ\Ý(Ýââ(1’ ÷ ´œgÌœÐ,„ì]GΉP VýÉ+Úw7Ì}Àx–¯ÃLZ¿a±cÛ8¾[¼á[K±qç'+afvŸÅæ]³W¸6ŸæcÄ/;«{xÖ€ÅêÙœ3n/ m\3E›[ëLÞ “æ®6—¤°Ö”q²ñÇëRH3嬗ͩÃV- wŸ"ðÇÚ³q¸{q4üövÃaar«@jŽå_n¬x¦Yûi9Ö>°`Ч­°-~acú*¾Ý°qà /£|Ö.Éæ؎‶ì«Xš½Ó[}¢?k¨lžþbXfOàèÊÆÛøU/!] l‹S‘AË£J…Êl‹g‡¬^ ðÅE`EYW\®9°Šµ9wÛæ NìÀÞ¦+ çÕ'^£^Œul6娜1N"@Ò[™à“ ›˜mN69¸ÐVK÷l›gj32Ï-úØmîj­Í¶]ÌÇUâ®ZN^x@_—|Ñƽêž%G¡fsÅŠÂV° jóE‰'䶸®¬VÓÒ\i+(=ž CV_ƒ­šg{ųg~òÊ1ÀcEKù(´Å­~‚LpìàV£p6÷Ú1].ÙØÖˆÐÓ„´LÂb¾éï© …vü ÅðVXТ”Œ‚Å=ñB.vƒrµ¾lŽ­ŸÝb?|G¾Y} ^Öí\â ;ð8¦ã…áM>.·Í­z<ÆJ±Æƒ'·yeQüÓΕ ³fsl˜Á%bQ”²±®ë5¢VÏ:×ÅH–íJ½XBë;à7z©)±9¯_  ¬6£÷,¯ÒØ|›³Ü=5L„¹RpZ T†â$'Ǻݴy¦Q€Ð'Kz¹æ£‹‹Àš"i ä"l¾8Ø2,¢ÿÄ¡0ûÄž'\G`ã¸#èþø–˜¬æØ—Ä <Üö+%‚¦4\¾"©…“hc[’–LÊAåàšÕl~±á31Ã-î¼³zàGР=VåÀÙ¼ÎòâX7">qîÉÑŒ$rÓêƒ À›=áe;›‹‡P.ê"âÞê3ØÔÍ©`±‡Õ]^Œ+º9e¯'Ï{N#ߤ·67> öâá|ö\'ËW;J[e(¾Îê‡x¹¦‰V¯v%ùOJ`3ÝÆ–gkq€DÖæäì'¿1vÜà¥ïÝæ£{È£g`ª [ãåè×Tm¾ý¦ÈAIX¥påÖßú‰Qź ·Z;Ñ©§Û¸a×êþ6æ´x$~ms”ázv%÷ÃæÛÜÇjX¿ÝG+ÀF«cn­''ÿâ^«]ä.{®O¨%g𘹉¸ùÅu4«Yuq0ÁŠ„•ô专–lñOü6÷[Á—QÇúZ 70K …®ìVsåoΠà–ÒòaØÜ@â×^˜µYÛ°Œå ªXðof*ÊÝëü'4…æ¬æCI¯éÀ»ßGó_9\ØHÌÃæÍwa‹ÜšÐÔ~®Õ¦Tvvוx7›§8kIÇ£ö”ŠI—”1nÃõxËb¢àfŽå–Ýû]¶ ‚Ó'À;ÆÙ|Œ¹ûœëâc—ÕÚiA"˼Ғ=yl–ƒõθœcs²€Œ¾½“0¬§msÀlèÄñgÜÛ'9´Ú7ü@¿V´šHœÞ3]'¥á¶šGHñjÍ}´Zì€ÓäAÊ ªfõ_GñľUqy«_?Jñ9ìšÕËÃFR8θ2ìðÑ`äz%~>NðÆúbv{ãP¦$~áÑÐ`±¦d{¶¹ø¾Nu†q½WPÜêd01+˜,ä÷Öl„Pà%*­¹V¿P¸œÍ0<0XM ”ïãÑS¹«›†*/¼Ÿç úh5Pûq8µŽË"Xþ"+ã$À‹ÛZ²S÷ÇuÌ ¿ÉÖd@Òô?Êm«…ñ©Š7¬ÒÆ>z% ËPñH)`_«™Ë€Yd¹|ݵ¹x×îRÐ×êÝmÞ%ƒðAÏ áQ­.«âæ½ ݬž0¸Úî"ÚX%«Á¯ È]†ˆ=~Éæʼ6 §12ÖÄ[ý^”YÊÕÙ¡;swé`ªBû6Çv+02º2÷V*Á> |Œ‡hhó$`O }?'¬2­þß\ø0þxÚüwßØŽìQ]Õ±z¸{ç²Ï¦bµz‰ÂÄaÌ$ÃæHëNRö xømžK œŠß'€=gÓézAXÖÿÚý›)¦1Öq´±ÃíóäÀ¼\omäÄæ Ç30…6fïD.\§tn6¿ÒS®ÐИGÃÞ[Ý-ÄÂ7NX+™û¹ŸÚ5e 6tfbg-Sè^ ¶Öd²yl b| àG'sÛÔk‰¸šÙ懯ÊNfÔÃì~õ~¿rÁäë*P¯™AUPŽõèÿ=«ydæ±ØV­ê?°Ü^8!3ã)¹ã»jc1  dzòÅëÑw˜PéŠÁ3lL%âíV÷x_VaY^:`œ}ÀI@nÜÿ5I o¨®ïä1”¦ð¡ÇÌ­²þ \P{a€=ò£s¿-¶ÊoL´¾Éšÿ%Pì“H±¸'Ýòã ãXܶ¶¹ÝžÿÔxE©d„Ï£m=¢º3Á2ñë6VTc ean¾‡áãçð‘·‹ã\€‚@$TÀbæÁùÝš¤{0÷~e ïÞÎrkxÜe[ã„E®`ílV\õx89¯¸ësßøs¼öÅ)›·kØÁ…Á€•N쀳•S°ßõL˜ß±y&p-Ì,Æêà&­F\!ÄY;6?ò6îÜY–ÚbŠuÄõh¥Ì„~¤âù­o”âé(áº-JÇèØ_Ø[(¼' 7«‚4›‡90afuQÒS›£X/”/õ T°ùÌ KÀ4³I€¹'ï#aÙ©Cþ~fgó„|V±DpKsùGç·oðV·Â›8$ËËÓâþ…} ›÷žürÚ<áÅèÆÕ«œ„Õ~®ÃåÒCö³·9RPZ¯=G2ŸøÔ(¦ÆeL·|ÒSÇ ¾¾5Xm䣭Ždx(y=)¬¬êbëW0=‚•à_–{êdóV¡ž?hecT'ŒÎv5Ã|ê§Tf¯‚.«Hãæ7?'¹'&Í„ÖœÀ¢À1í;Àä×Á7óãà{øn“»êŠ`y~lª6Ó­- ûî/(gBJøòÔ´‚ÂŽ ÄoªíÑ[nž±ÁL æ0”§æ†„E^óª„ý‰ Íœƒ²Á2[íœfqsqaðhuÐðìo£à¯›Õ`¸=Ò† a@@Omœ"kB˜ nõ©Ú¶ÆI™À4oãêðítk‚*wQ û»8\èWV—Ëfq8ÆÒ©Â,ÈÛ9O½«(}t•î¨ätyzPL­\¥`ùÉTš»À) Ú±ùÌìqÕG p·ñ+_†æJ°I¿O,í`Ë2.7…’lîQ ŽüñròÞrÈ põ”Œ‡AÛ³ËÑ–ß(«\­¦ ž[m¥)mN(ÎÒÆåo†_’X./¨8L« UbûL |´Ám,R)„1O–¯xrƒxwUH_ËŸ;+ï%¾;¢³z‰Ài*×ÓÜnÕÆÜ!•u9¡–—Î"u¹ ëüíV‡ÇW¨èÔ1¤66‰ÃQ…4ü?íql®ÓK¶"¾köðÔ}€]¨=•ƒYMĬ‰kà¹Özà'Oчè:F˜fsWÁCè®Ú°Hé*»¾S’ Fíÿ½Z Ø~ XÇ­¾R-y«sM!⺼ëo Ñ]ÖÂkÅÆŒF¡ðW°Ö6‡Í‡! eÅ8•f[­Há¦4ßÙæ¿w(n&•le,f8.rÔ¤î¤=5gX›ïhðä>VÀ)4\„®FïÄŒ·$á2䙃o1ÑÌG +¦ù«‡„¼F°^ÔÅm<>:Çõ‚M»‚Ù~ê"$ZIô:têmMÁL+rbgÆÏöÔþÕá›Jâ%€³9¯{q™a—n5 ·í”±ô[¶ÕMþ9p?ÕÄ<±åØ £ pÍjHÝ=*ãˆþÞÆ¡À:õŽÐ'@s}m^«¨4w0|ô'q»…%ÇÜõe5{ô¾¿bDÜm±Z-v Eš*»~jÜbÛì÷ÞBSÁæ¸U˜Ó¸ W bÛ¼ò\éÌõãnÏAéìOOÏ8·grmÕ[=Oßœì˜qŽÐ–òô âÓ¼¹})ŒÞŸÜ¯å#³±ì.PÒ×5ÃLØ;Öý«ï½œX¥ÍåfÉg#Ü?ðƒÍ‹œ ¸X3´*÷R8gc:>"÷ò!qON-\ˆûÄàBÎ,æ:›}ÂIw®y‰ž—.*nk²RÇ cÛxg©jf´ç¨’PYý7(‚ÐúRs¦eõm`ÔRôðVÚæâáhé4ʪë<¹–P  HLztÉæ’¸™iløÅvXÉùh•ác=6\µ?y;m뉑óä°5|!«üÈX°¶À+4Òåa°çX—WÆb«D‘ņ•¸]JÁnÛ\Ù+(ÉÇÅٜ„ÞìTL °(ÜfNr 5Xõ[3Ù¥ž´º±|–gÈ]µl5zÂ×#Å'Y-v<1{PX“ˆ¸X}ð-+±xDœðèÆêZ·×TqßžzÞZ@×ÃO ŸÕ25îNºP@'YD~r«rŸ] 8fó§ pÓWºàccàINC S¶Ôâ,L5„ºÌ èF¯ìîoçóØÁæÍYÃ|;ŸNÞÑj„@ñ‹¾tm²ºp0[ª§Œ  móí³ûÈiaáTdecõà‹%Éß®>Äñh郜-@ja|¦­WÁÞ~ãn[l Õòv~p–ØŠÛ¯þ›ƒYåäÖ§>3HðåXÉn›ké Š‡¹æs•UzruŽà&DUbfk[;¦Îœ 7÷XhΩpmùPŸ£úÌq–;Ç€>'Â)äÉE j^d5‡Å¼Å+ªJ{ò‹jÁÒ»äV oc3pª2¸–{³*V¥«”£ª;ãî,N><ÄV£¨¦21[¿8€²8¿ZpÚjâ9Ñp¨%«IêWIŒ#:mÑž)`]ÜÊí¤duÅ2þºFU¨Lzòµv®Os9Ø\f³àÔ‰Å{ú×$àKæDB´Zì´gs‰6CªÉjSpù#YD8-[s“Cn7cZz“M°y¦ƒóò9tï89V²ü½Þm¡ Ùæâçî9Žo‚t«5_˜*L/ï¶ü¨V“›WIü‰‹;¥­´,7¡KÞßmmO§Y¥*þýôÜž—‚ø^Þ€Û”ýÞñp´øÜÖlØbëÙó÷74[ïPÔ8©Bí¥ýö6Gê¡¾ð„“¡Ô5Z후Zý`]3ÐüXÝ4K‘1Z:Õ_òÕꪀÜS‡ â­> Ê×b(XðM>6LiÞ¥¨[ÆYm;üõ( 뽃ÔXÍ—ºÕ­ÝTÓЧPîO ó+M.[Óâ)^’¡ùØD *?Þ¥•G7’D¼§+*Ë·±˜lŠ8¨“”«O<0ÊL&9(h½›úé35ÖéÑ“Žï'¶O sûÔJ«Ã¤2Ÿ"8%çOfã{µþµ‡ZÙBœ·qÄñ¦ÐjÍ6+øÎfY¼¶ÔÚà(¿€Z—e¹C-P§ßƒœâOÙj<.ÛÜ—)}-2/_—-× Ð9Èêip(L¼½§/ >Ç&Â3ãS[Uê 3GR-ˆT‹k³ùSˆœ ( 7­ÁÆFæMãôëcÞR€ž‡?·•Ó9ªæ/O.>UÐ/–øøxõs©c¥ë–ƒ~$!`g,µ³0çØØ 5‰è<5€|Ó¹%Üa}ŒUp1µžîþÑî‚mË\’¯Þ§Ž ¢ÊÊ€,3¸øáNÍḠ*eZظ‰U W5õpÁú×?– \j…©&Â6™¬/dÔ‘‡fËÖŠv/¤ƒ¼”F´šˆ¦¾·}¯ò´üy*©5&¾¨pmžiz Ú®.~­Ÿz x„ßNè!çmc¯íÌÑYlPe+ÞâTÉØÀ…|àV+û°o¸0Æ%fËO€Pî®T£Ã=5uàŸ ®âá-¦¶ë'öòbã²AEæ ê _g{ô¹Ñûœð‚0,ξ­}ðvæfÄ'?ìá&\øîȱÚ8k'b§ó²àV÷Z»`¡LÞÆÙÊZ0}|QeXwG§ |>ù.k‚ÚgàÊ®ªñ{´´u©ýëÂê âX}`Hp=lµÊø‚Õ˜Tµab/ öGÆæ•Gnª²À^ð†Vó±3»°A¿­Žê3ÀÆ ÍOO¶ ¥[ónE=Ÿ^ÞЪ0¶,÷- jã+±9‰33°±å$Kqk,ëÃS¨\ƒ Å´¬&i«kŒÝäÏŸš]œ^Á|æ ÀIá©}(*-øö fì–ëæÄa‡â^¢ÚÜ•ZÎLe[¡Ùq+^ÆÓäPg 6þ!€9(˜H̼åÁ Ðæ”À§°E¶ŽmELÜ7,“Í7|Øa¦W2„ñôŠÜ] 0 ó6® ·Èj*ÈÙêâTj=ꑜ͵°7Ö¹N6ßlÃûË¥À‘½gÑÀ…T'¿¾n?½Ç€¹MQ|µÆ_å©-v!Çdlª¶¶G‹<àŒYµ+6öSÆŽ~ªmxÁêJK`¨ :RwL3J\®YCŠ Z?­“Õ“¿‡­$¨Í/_×}tà |÷”tÛÙ<6¬B²J꽶'•†’&ç>W˜õÑD¨Ý:$a5XŽõÆá”+Q‰ÇÊÇÆ^ye×Tv¤¶)ÃÆB!}Jå¹ÌɈOŸxV?8Ì ø¶G_ªÀ3[>Fó‹«C㸾Ìü£ß»÷”€„,Ço›Ë?T±ÌtV³£ëÎkT€ÏìOÿWIKÙqç‹ß§Ù8†°a ôÆ~økcbX÷Q ¿ìîÙÞê€Ös߆Iˆ°aýQb‘ÕçÜC|«¯6c±Ôw4HìS÷18^À),6`ØjrÏ9º ²¼Õ·µÊñRIk^[â>›‹8 3ä¾=«^‘;i“Í·ßñ@EìoŠVŸÁC5Àf7x2<5Â,%–¬®“½ÍäZΡÁnÃŒ­/Vñ´€IþÓ6§8ìEGE<ÝÞ[(‚dç%ÞÒæ “’µ\¾³‹?á©mÜKMÐj󃆭 Á_†ê1Y™=ûœtÆÒÔ‚³®6 ZÀ•â—òô/ oiÀ)˜Å}z}ò#n4F†õéϼP”¤ýJ°öÕ¬¶¯¹Õf^¢´ƒÕè•yÀb‚"6¿xðâ°ÊæUÀjuWàæ3v3U«× Û#¡Ê–cãÎyG³1ÍÅ¿WQ@äýc5`–,·ZÝXQ# ¸@X‘ûbõ›«Ra•ÕŽ[¼yŽì•¾R— [ƒ:ƒ.\ñXO-й“¨˜Ç±:æ#§Ž£Åì欮8+$=€Ï`kζå°êÍx׈¸ñ䧮úÇz³˜Ûᘬøhl]8Žà°Úa®úœ8Ç eÑêÞ[cßçBBŠÍe‰cvV'¥pž^ŠK³¡¤²—ö==$2?ÍÅ6ÿ jBÃÇqpž>ôêÅÚÛRYOyzS *qç·W˜ö©ihøqCŸúâfsG½QYjëžœlPß¿u:D\hsP0&À!¼ÏSëÔæž ù X¹ÍæÑð•~K`±Xmoëc¹AÂç [ .õHÇ¥Àêæ=¶­©cÁJ$€>8P«!8áuëpïžžp­ª›Ï­×¿ýg¹Æ¼D.¦ÕÒCû&ĸuõµîîAÅŽP¿®ÂÿG÷wâÆä¼ø”JÃî;[ÀÇóñêÃjd'É#& ÓÀ-Û¹!j• †g«¼Êæ•g¿^C‡¢Òô6wåÛv h€“ƒ'Y-ö˜WÚÚÁWD[§`û+¶Ãwòh3kœj?Y¸ãé=x1d¡gn&¬mY=ÏÆÉ©Ôâïhµ7½®Ë[»înÕê,ÜÙjÎMs’ðÙx²š2¤ €P›ùÕ½cý܃‹ß¢­ñÑȶXXQßVCßRå´O¸ÿÔ=&Ïž€$µ?½ë0«ä™ø^·¦Õ!œ|T‡ʆ¹<µ`äÃóÃr/çÂÖEq¬óå \µN-V'ª) Çá©@ VÃ7¯,I°.«U.jં· V™¶FÄsç¢9xh 5¯‘òd±°èÀ7›¯å¹Û)¸ôíé.q>F¤ƒá¸IVë±,‹·Þ –ûÕýÊ&“ ܀ͦ"š88âö¬~ Jwìþœÿ袞Z­|1é©Aáã‚¿pRõë}fã4.¶v¬Ù³Åù.ˆ,¶ÇÙLO­SðÂjw7-&9‚[ÂÎEæ×ö÷P…ꆢ¦ OݨÒ`gý¡ 뉅V•ƒc!vO¯3NwÎЉ¦Ñõé1ÞcÀ@QÒQ³›c[üëy.@ =ýJñæ û©Î:bgãˆâÏ­VÕX÷©¿#ùœð„õïÃo£FȬù` ê=ÿ*TØ8¬oŸEÈqûB>Ùo6Þé%¥ó÷¥T›ÓûÀå#¬­cì݇6VRÔ]ÎöˆËýj ‡*÷bˆ$½R©¡ÅcXî5Ò‰…GOs`¸œ·¹Åó‰1B‚ü†·ÁÏ-·‚à7VþHšå¬ywžk$á“嬬  暺ëØzP?+œ¨2¢Ž‡½ÂÛWb'Ç£Øþ? ãåŠ*‚ 6‡ŸU5µ]»OüÈ}òhOxp õ,W˜¥(2·³K˜§óøWè=öy|åxorœ‹Zü(Ží‰‰Ïë©ñœ¬´œuaYTpÈZ®úÔÍ©Sîx'îo²<ßm«UÔàZæWéï p¾½}6`Å+Y}6G …‡á_@|ÿwÍrÞ¥ÂT¥"Kfy†ÂSžu1ÙÅ[íFtG ¹lßkß$GoQu;'?ÚÖ=¸aí„[´¸¸n}N ¡ä꣉PXƒàæV×qT»îXN\š ¢ãç©F¥AB«ôè%ÊÎjåÃZ¸W«{PyCcƒòÖ0‘§NÏ©MŒ¦ôâl~ªE²†ÃÄ"±1œ ìO*|Ä>å'Ö ÔTù„ï<6Æ4GIâÆ?¹¦jÎ~Õ{3cs㹃ÛPÝ`ˆÝÆÎ5¼7ãçSðäd³Ú¿I`Õ½{fñ€¸wã”vhë©…=Ü" ›S“üg6@H,2.¾_Sêp¬âŠ:ùÙØOȼõ¼Xy€®å.[d@1 ¥ù£ÕÞ¬v9EÄ äè6Ž•7K‚D<æ™ß0a­6xW¹6· ‘g—H˜Î“«öC)“$Ѷ³šù¾…ŽO |hH ¸(¸1«mm,²š§¨Ð}´ «D¸¾Ä£G«Ë‘̽¹“Õôb4‹ÿúH\°Â…}_›#õJáÎä°jUemc$Á7×oã«YÂ=•’p—êÛk×L8d,šf!Ûøÿ…*‹›JÏÃÆŒŠÃ;Ó*ÿvæ* IÜæXVŸèX¨€Çd¾=Ëáø»Â¸A«ÀC¸4œ°¸Y­^©€Tô\ö0K´qÙÍU€nkDÏàÂXÞßhÉ×JR=½sâPãåê\86ãÀ‘ÕøPX©³ü2`Ê®ª}0N­Z-hÒÖ05Ï!à³,ÿãF«a “~7—7 }^îô þ±œ<ªŸOíå@7V³#]FïR•]÷ÌHéÒ6¨±êmd?–ù;›ãYÎIÎêOpÝmó˜ãÄ D]_wÃG09ÛÜÀìXÏ=¶emíÞVRºÍ•vV{ V+6 *°qK QþZf`ÕNá¬fª>Ë«Üñè𮊙 %‹í°±úÊ¡uÚõ°\ÜÞM•§*ý…ôÚï«_“E^"÷è3ªHέ‚pëÓ×QÂÿ¢Ø¿ûÚ^É >8ÞS#¯81M=ÎØÆe¹ëe76@G­[=ä–b>]…f”æ~zH±`Æ»«õ±Õ5Þ5š©õS§ ùlüªcAaøøî­fGÍX‡jxµ:m,܉ÃE¢?y ¥ØjÙ€§°y­3³rd䊡|æŽá18Cüë·ùoZ,6ï¶z‹ÚþJq,¿–ç^z¬ÐÓ¿·àýë…¿¬6¥ÞS9*l+X:XMîÁ5ÁÃg60‹×ÀÔ¯ãÑ8»~U¨Þ'¯hcàøÒ˜wÃz€*žº¯üÉî4¤ñ‰ÇŸ´¹–C\zr Mæ †‹èùä)ŽP¬Æå 6ÿV:&|k<šÒLVãÜóÚ¬åÂõ´1lœTåL·JÒïWïVÛÀ;.šóËýmO~ä &Òü5ÇâÑY@Ãp ˆ)„gó>Üÿ˜3l+©b±‡özª‡œ³¹œ,Ö6§9ǪO%ôÑP<úmnœ÷ª#zˆBV?Vû5çÑkVß²`|ºJâêt,@zsñX˜¤®j÷ôÖ8ÔoKMøƒÕ°áA‚–5a9VÛÀ‡uøhñÌZTkr»:‡¨:ÎjôZIéϲ[›B_ùmxt’†Ãam8g¥f÷ﵺ¸-­d̪˳1M{©`÷g>F.‰±z(ç™QÆÕ[ªYe`5^ þ}›ñº¤"~«WJ˜ò‹_{«ÁÀŸî£‰ŽQ??mô¯\`¶=B“69‚‘r‡ Û8âVÛÿ¼Õ‰YóK' j’ƒJ¬†<½5+ôlUŠÛ»q4{”Sr²ÈõÓ‹9lÞðÎRM«gí¸lj# ãñãqòk8k*h¢¹µßÎy[ÙúoVåÓ—,f¹ù•Ž‹ã›`Û85PÌûôÁ¤/®¨ä©ßLb›7Xõ`Ä)ÉÆFÀjË äd>:M¹¸']M'ÔœjË]Ž&“³—¹érØœæ±kCRXo?zYV €‹KS£PÿÐb XºßÓ,ìŠ Ç›ïƒv%î °?àcm*å«ÈsTSåîžyN3R3ÞËyŽ¥µQ±¥ö2>åüÌ ¼©&š¬’ÔK´0`nÉòî¡nÑ‹ÊwÈÁS ‰Šè8Éž:“ P¶×Ô#Ͷ\~/ ˆÓÔªóôëW3|kÒ4!Ͷ1iÍkmj¡•|´¶¦cÏSrR@ÜZ QQ€&o…kó)îjÖp/ê¨ì²õ1õå®SáøÚ<ž)ãr××é½Úœ „´€tœ¦ômói85oüîoÀèÓã.½‹&@v­}†æ•ÌÂ(|Yl ub%Ž mÔnûéWÏ~‚«²«ðu‹™1W)% OÑ,x3rUÍ 4mGsVmn†5 ˆÞ³bmìl¶WÇoßmŒÿ¶·È_êÙæOÕŠ¨Aæ4)C³Ä-…ç^œNCå"Ö—~òZÇK0 ìþ›YosP¥ÆæªÍÏyzÕ©‚ . I¬öisšžTÈU"fãÿ5¶%0zÜ6>êÖu\>é<³f1ñk'T RϬ½ÉmÖÄMàx~zŒ»üvmiªáèù‰õfðk¹š8Zžž-j6ß›šB«–´–?/ã¸ðµäoözVµ×$ÖØŸ8RÃ9Sz³Ú v D¯2æ´Ù*«Éše¾›:àkNµÍ ,0èù&:¸=v‡­ˆÃy›+ p®–FSͶ¹(ùFÐôS¨ûÓ¿‰_ØNŽø©§Ð¼òÄÁ±“Í!,ÜÉii¨VëÓT<µ+§,j?¬¿i«(UåÂÛĘ1ªšèúkÂÆ5?MÕNÏœiLív@-M’àdXþ\—sÕ@Œlœ¨ ¹ßÐØøÌÑöK3É5œ«n\®µ¸ÅªDïÕ8‹™YhHâ–NñéQ¸KTÜçjÂây¸îÒt,l¿¦ì¦b㤵i.·¶i¸£ ­¡UkˆâjÏܪÅÁÓ°vÁ‘”}‚ÔäÉòÔ™HF2†»šV½«Í3-Ly…^k¢ãé–_Þ®Ò‡ðsªÓ£[©;¨íŒTp:«ÕŠÝkÔÄßÙŸ>Z\ºæÉ3lì ľ7†ZSeæ3“ÌCqÏšñV5›Ýj0È¥|Ó]±hÖ?hŠ;  ’¥ó̤þŠ9ÇâfswŸxT W¥}[ÞÆ;¹êbuNS‹w³ñ3Ï49«ìŸØÏêPMÒmOßÃÂÿ.‹•¾e@œ@pk^ä‰ A<1Øš.yÝÛw­:°Ö7q-o;{§ë—"} DucÕ(¾ùôpiõ¤Ý›¦Ô•fsÍ oâo¸òÑjH³Ns†orï£%Tñ6M—ÜÏ|-Ì ð•«[ývUSÔt®8,žÀ¯«A†&>eõJŸË{u¡áð[ýº \õß„ãæ¬`÷"¬_S¹v±º¥Ø :’ãå8­^)^w!”0ÎŽ#´ú`(˜RdjQ²àX:P–¯lñøðÄz•$½}êz²xV?ÔÂ<àMLÓ殶à1üIÓ Ò£Û­*ó5ù<5¯.'?ZÕÚöÌmd9€×K}ø«_ÏìI–¹²4šB[®ÕË×%çqŠ&ʵúôuŒœ’ˆÃÔ4Å`õÁ€nïAŸš˜>ž¹6û€ñ- 5õ°õZN°ô¢‰‡Ñê%üºuÈñtX›‹‡³k8šyÿölJj†¤æÌsbõÁUÍ'Bš¨ªqAOÏÎ~§ïšVÍÙš˜U–ŽüÎþéµË'qn«¦€¹ÿ±?Ôo.a]ùóýh7bnüŸÕü‡Ö*~h ¦t©JÁåRUo_s?õàçP‚&ÆüÔ ž NS)9ªOÏ4P-€H“ÅöÓs‹õC‚¦¦J)­n ЦÏ܆®ÔÍ9×€û*ñûXM k…ß°6ÖùÔƒ¼T£Š7ågN9¬ >©RÍ…µØ[cÇÎYšôåŸ~U€ 6‡e¾Y“lm\è»54±ÙU[ÏqC…©J)l®¬hðÝ:WSCIž']¨! ˜ÕÍ~´0¹2ñÁj7Þƒi4¼°x›#ÍО"ÄN|ôfy|…Õn·ô•Œ>½ É ÃÃùnVÛ€çíÃA–0ž¼ ær–g®ïw‹²&Ž¦ýô#©€6»c¶Z<úi‡ڠ[-ŒË€hÜ´f×ÄòÔf¹_š(ÞÓ30ìÉ=ÑP¶îŽÕ»à ˆ jâhyòí°×ëTﵨ°5gîjµî7¹×=½žV<Ü2Öܤµ/™?aIÔÓœÕ=4øVÂαj§.«½aEZl@Ϭ‚=«5¨Çk¸NLÃ朻Ê!Ù8 þ«O,ø¤ ±—¦nº`5=y-³Dÿs?3™né¸o@Ç,?ó…àÊ;€åÕÜí™ï¥v¸MžÉj¶Š©Kë:Á·=ïæ j\§‰ª¬ºÝÛ:éúÏЬE[ÃVßt¢&£*có’­ps¡±¸•fu·=.Í!]š@_½Õ”ÕŽ×hšeKV;¼6OgÒz€Œ=Ÿ‘?  ‘ª‚*›—ÌJX-§—©Oëú+Xl.PÉHu•4»[ž¿Ôî‘óÏ3Lߣ£Â×+0AO> tG„M)Åóôeqj¯ºAý3¿óá]öG:F=âUõ¤’•b‚mLÃßìÁÆ Y^Z$³‰Ó=°í^¶¸e?h¨Ç~x{¥dp»¥VsØ’›ê¹†ã+óéª¡c¾•ÓøÌ­J·5ŒOr=÷ô*NÆÅæÒìÂpŠ÷-jFŸ[UáT—Ç;›‡)‰G? òVç~êà& RpòLQR›„I¹ æ@€gkgdlê™ ¹HO}_TEÜ,2ÂSŸ~2jP| ÍxbÜ_ævF\ï= Ï\ž0_6߶8çé{ᥛ¹Bl€;–›Uy2œ|‡+䧾¡n‰IëªÜ®6ÿ拇|¨àpªà©£ÆÒ³ 8ûŸÙ“<õ§`ëX›üÔ‹¸„Ze{…ˆmlòôÒ.ß…iS²'æ®s«3sC6·ª6 Q|+j[ ë‚’ypÖ¹¾G~ôã Ñ”æ̪Ķq6€~¢ÖO?ºªõjR½â`­m»#«â^E/]mñæéwìSÅ1$«X[wOûË?ÊOœ[Í<ΰ€‘Ú3ÛC†ifÏûáùõFðc·plŒ#døšµ;¿Gyç™(>ŒVóaþ‡Z|Äp29>³°aCíkÙŠ[îÓïKÍ„;žÆæ[âe+œV •mnnå4rW ±7XNðÇrîkUãû¼%°4v6°F^€ü§:õ«Ï¸\½½6ô·u,o0¥zµà¼fsj¼ø¥/pÞ@.÷ÔkI7É¢` Ÿþ#œX•pMïøräàÔ•Ô52ÐÆPÛ¼ß}åFÓäz9%ƒ<~<µ›¡ƒÄ£ìt¯=õE°Â ô÷œýÔþaÃN¸ wß80ïœbùLݳ|4 pØêÎùÂ0mÆÆyÀ«~í<Ó;ÃèQÕÒãûöÃÂk8ç[á=ó7Ú˜*~hEn¼‰lü—}¬g~f‰¥9ßYT²÷äÍÙ%ÙI·yWX^<ŠÞ©T«ÁPwl‘þ &iÏ„dTª—ù·y•æ{™ŠímOÚøßãåÇ5ÃæOqïªFS¬umò‰°Ç"Û ¢ô6†º/ž,ÊØóS³t»ãXò’›aù,–'uñ.λžœ¬0`L±­b±vX!À…¸ M¿l­…Z¸C;1‹í·çìâ6è%`«Õ+%µ¾UŸ»öO6ïÊýYCáÚ qV £¢\çåÔ´<84[ ïÏü¨ªê­†—sH´osܬŽ Àjul,÷ÒçWð~nw·{ó5ïηÚØ+>1$‰­nóáÁ2ïË8ÏÑPRcÜîœ{A©lìµLÕ *ø+xzï‘5ÞgåSÆ}fé6 Üt¯ïpÕæô$ÂJ‚ya{ÃÆçÊ•¿ K Ä_›3ñQ¸Fvþôf.‡£Y€˜#å¼l|®ùÓ»D5T:gãI¸`À`§ô§ßzK%ø: ìD•Ù6F5ew´¦¹Aˆžš‰¬)ÃþbYUºc5^•#/»·Úr3Ü{Pl ZùXÍLV[ПÁê,ú‡Ÿ1«¸îëÑÕ+Xœ¥B´œ?Ó„ý•8I6«ž|VG|eËä“‚ü®Õ½ªûGÖšW…F6Ÿ zlºgùîG“ÏÔ8}r&›÷ÂÁŠáÑ6¦Ôý¤ÈïT¡ï§ÿ7(ÀÝo6^Ý•˜júý¸sÚÜ8¦O­Fäu{O¾vtňõ‰*|±šÕ:\ÿ¸Ñ0ÏV·9¦ž_w"ó´îÑÒÊîèow©>ã¤ÑöÔ¯xH«Z°ˆªú×ðöSÓz=WŽ„Á6çÅ·`;e³Õ¢ñéבuneC}ÇU[ûØÀ ±À?VÛ7½î,l§ž^åè$ì'OQzË~Ö¡V…¸ˆ§¿K-QDàØ>'Hõ™øNþ¶±¦ÝÄ9dÓ œÞæ,’dªë8†áé‹Td#´nÓ©ÄÚê|ÖÚ©?¨ßÆ#r”’¾Eì‰ícþñPQ jµñˆæ¾1mas;«³zVo¯S8Ňûô¼’ð/Æ^Á?Ëa§8ŽÈ\^° ®­û‰‰6¿ˆO¶ä~Æ|ž\Ù^âàò §fõ¬o©5 ¯€#{êdƒî³°ÏróéŸ µË·ÔÏÈœ;Ÿº_GŒTÑôÌ•=–-TÑõ“ûÿ|˜0Úò\‹[óPW<‹O»Y½` œÌ4˜Òj}ªx½pæüú™Uúñ&µ¦Ú˜k‹#§~®XQ’9Û˜´Î{;µf]w«'ˆâ#ò£¬üô5^â²-¬gΙÿBÑ Þ~ÔtÆúª®Ø‹0a_<ý̬=Oòƒ|zãÍÛ$–»±³ñåѺ‚%zÖ6ÞöÖœ »/Î ô OþT%ÕF¬m 5k>KþŽS:Ï5c+¥qH¯§ä" ™YѾža- c$?À³'ïyõË)UüÌ*?Æ΋oó7Ù)´¤~­^­›m®LxV>Þv­†¦~YÙŒ×3ûî~öCñ<`²{z ÙU¼|’8÷©ŸrâF_ kuP|ƒ8<Øà©Kj9Ç VVÛG›ßý‹#(t£1pO¯ ñ&q@VµX­–ŒÛ%¿Ú:Ïœ _Îòóä'ƒø¤|Īý©± þ„¦±¸|mü9ùvÝk§ÀÍÓ»G~xª°*áîÆS¿È‰ðêû«þî|ÒîÁ=µUçãüÂØ°[{Á!«C5Ù6¼=Åçß® `a㦊àUÅи.§wÅ‹?èÕÏæéeµÞ‡kèžwÅ/\•3°Ú7í¹Ö4¸˜_í°p¾bßAeí©§‡J o”RŸ:¯¡š*UÛåŠ!±zvG[¨îœkô§ï!'Á<(Õäl.Ÿ‹É‘¿âš›jë„÷»‹ÉæàqÅ/ôäpUVkàÄC¿ØTôÏ|;…œŽŽcv›;^j#<¾8KRÆg.˜ä¬ÛÙR²¹êµd“´¿jrf5«ÐÍ=%9 —mõònÈÎéýãiÞê³Îg)µ>³±0Ñ ‰ÀÉ®ç®Yû™Ä‰£*ŒÔÖÄ¡ø­ö"j–Õ´ˆÌ ñÉoî[w‚±nïÔec3K±ÙeŽÍ²Úv·ôŠÏ´zŸùÊlj‹ ûðDO¿nW¿8×'Ž+=5‘òß²1E©[»ïM¾V±èÛ¡\¶¿Ë]ÍÞ÷ˆ•´¼ê‚¸Äƒò^OÍÔLŠs)NVKŸOpVL_q¯Ñ¶åÉO© Þ4ÂÝVŸ¸’â¢ZÓê•R{zœ`ý•á¾x«/²bwtîÑêªx4,b)[“@ÎS£u“ÄžE­ lX”· Åx7¿±îúaVÅï}S‘©­¯Plâó«ƒëöÌàýbÂœ^'­—}‡/¦ÿåmn|úŸà1ØÅ©Sóã™É…å…£u]¬æ0»Ý‡oNíù¬^Wùá_aÐ#´š\àôÊŽûP5õ!Øó±ŽÔ™½muÁ»ÛkCT­;)wØØyÏR ¬ƒ×¹XÞͺ,)'=„®çðè¹¥´h;A,:Uê茻®Zco R´žôÁÚLÖRÅÁmkÇa9+öÌ«¢0ƒâ4~Äâ#U.Ì|À÷á ]ÐhðöÜ+ÌÛs÷¥-ê"yËcZ•šp¸ú‚G7é¥>…¡áDK°6 ~X¥ØkêÕt-1e};÷w>3ÒqdAŠËôO¤š¶p|bp[ÊÛ&Á>4ÑÞá$韒œ×òÔO5)ÈT3YÝÞ·£ê)©—xI̘ͣe«›‚°g‹a¯ŽK‚\Ö’ðÃv¶T^õôìâ¹W=IÕ¸w·šÅè¼ïT|ýhöèø“*VkŒôÔtK±U&-šñjÈ¢ªøàq=º¦"•¦ªoO:`ã' Ê ÷ƒœÏLSnÂW½øb‰½­ïmŸºçöºÛ¶yɶ¥Šw*¿¿{ZìËQRJ]ßes¹¨2*9®:Ÿk9AŠª–`Szæ!)0XçýèÜW™1ÕÏÆÃl®ÚKaÚÔ$?·hcç·©ú0Œ=O,¦fÿ).#€+V‹7³T*ª¸óynõ ë©’2k²¹UU¹Ç¡æ´ùG£À©7 “f×zH úa¹Ï3ïc«6ÔÕÄ|Úû£”x8ºC6¾Ã…V«pŒ»1lÌAã"Tµ4´½¬¿ó¼@§pM%Ä•Øv>J!Jå©áóYj¦­la›ÛââæÜWÁIY€t³Mª,åõxsÉ”Ÿº–ª iPíÑ4«»J„1äÙÛ)ÖXY %H¨Ô'F5>%¿Æ[ïdµ"A%\XU,W\çÉ™L)ÿ #;°ï3cCêè©Ö·¸§7^• *J¢¶R6ZUÅ”w[°ë4Ÿ¼«Ô§’f«iÔ3«M™ 5—ñW‚6›÷QĤsH¾Ù"ÎÄ©‚?8¬ZâB_åzа¾Ù愶IåÄIËغիÊüË:{~ûô©ª–‹ª29×YžØ‡”BX.žÚê4ƒ»ðÐ bqÎTõ½F¦– )4þR•åîÒÖD{‹}—”ÌÐËqí–ƒ`÷U +†I~j T­3vÔ,Úkã¤.I±‹'R–&=¹Õ£ f5‡]s=½Õø#¯ª:ØgŽïœOåÔ:&¤cùzݪœ-ì¡Ÿõ¾8NU„àé}sú(Ï©Š¿9Îæl´gf¬SU‘»°©£Ñ36÷¨êVL0»Í§Ä¡êt,ÝÒ ›·c5œ*ix¤>³¾°îê ¯XLOþTã µ!OøÍ“OQË‚o´ou£ZÞœªuî–TkçG?ä¥À¬ÃKšTlìÇ7)ÿVáðN¥J]vV'…ÌvO­LÈR+y€ÜÙ|Š:¸ÏLή _˜J㧛àÞ‡:„x€9¦Îž¥+e8ϳ9Onghô2>7àå}¶ñ2hjRe’†»îÕŸÚIýÂá`ºË«\ª†íM%î6O´RlNÄ6§žÍ™êÞN¾Úœ‡©»MË8Ng5l#©²{…™Ò×j}p±W]Âœµ<½‹‡Ä>záaÑæ’ðbAU×Ü…’óS_ôU5LÞwüô¡ [Ý/ÔÔÜîlŒ¸Uo{Ž5°¡=±Þ®jñ¥3íá‡öï¤Y©‡stañã©AQ—€¤™ðk³M]*õ(#È?²ÚaÎlš«Cë©o¯ª áÄI´:§pS§¬§ËêY—WÇ—¢Ö?ç4¯î@2à[iK«&ä¯jI©Üass|ÑQ•·†´€µlðPåìüÙúñ©S¿I]:RW¸»=ñ«ÓU¹·gÚEÓÎ,Ç‹ªR.JAíîm¾Èu9ÂmÌØ[XO®E•wÆX`ÖVZø:§tŽ (Ûòª¤î3À¥ŽÁO6W†!VCvðYm{kšªª0…e<ýýš:©hëÜ°û,­ÍÔ_6Ö®*K!á­ãUÙiO› ñÑ|¨roKÂGØØk–¾M£ÈÒØÛ+²¨â–ãt¿q¬ö9*dŽÊ§f™Oß©®jǨ†l%½Z˜­®'Õ÷;z?VÛоî:Ææ1À6÷±ÀWêZ}íý™' Oª« >ñè`U)ó,z·ùZ­U5zŽWÓ@m ŠÆ´–š½¼~V]ÔÔ0µ¬.GrU¥“4EôÑ©óU¹­W¬«Í‹Œ ŠT‡‰±>½XúTÐTms]T9³Íµ¨«‹of¬¬ñÇ©JÈ¡1[Ò̇'FU‡MÚ-Û\|ÆM««Ë¥±¾6oÞUu !Sí±´í7|Ëyj}êVÕa¦å¡²…`µ7ù«ø;x9LÓS=5Ìgóö*{ìV_s¸íª‹÷Ö3J•<£B_•UO=Œ†QÔ£9ÞÉêâæW­Ó1WxÆgF(y«;ÑÑo5åëìå°…Ëò䜓:†`4îçXÝôî*cýW Z~rêQÝ».&s­¦EcÇÔEBé8ŸÙI•—©h  æå飠Špn €6z«{ØK]•0Ù«+çðÌUS—8~̵ÎϬg‡QV·Xí'÷¸Ô.Þy Ç[-=ªªS ôã²FO-—:jBÕ­,ôG3§N#йFz[MµºMuUÈ•óÌzP£*U’&L̹홦 €¿@žŸ^ú±©¢1NXÙrÛê£fï_Ç€¥jíñ̼ߪÞî¡–¤¡öû®º‰¨YíŠeÛü>«¨aª«|â”gÆ@S«´ü•”ûéSæU¥Øù9ÞÑrß¡®Q2Y%·kuÌ{HP X–o™6W6²ª†%ÀI=39ã×±à¨ò‘…µÚ̦ž–ý¦ØØÆeë©bï_õ´R¨„óÑÚ寖çMÕÖ}íéFLJŸæ`u­¨"b•8üÍæ3ïP7BN¢D>saÏ×Ùka™¡jOÿ¨€×T‡¬z°¿ÅÖ¤Œ®ÒEã†A [Äsluáhk’À3'Yt00=Ž{m~¸8ucÂÙ& ?ü£#Qç–€1(0«ù8#~ݡΚÞlù¦f¶mзƠ[Ó ø:߀YÕØÆË«ºbÁåæÑÁªµ™ºþ¬•wøÙCú¿ÿ“ß~[ùýŸ~üç¿ü+XÓ÷/þôßþ«ßýõ»ß­ù—ÿåß·?ÿ÷!—?ÿñOü·ßgÉ.ØÌq’2Kc#>Òêv‰1xÍ¢›1€ã§¥éjOe5FnBç3ºn#aI‚¥³¹·yÙ›„_Q—Ë’ö*s?“‹S‹ \Š7ÓÊZkP‹SJrÈ6Z9Ú:°2—„Ý[d4cn¦rEe¬§Bæø³ü¸ƒWPÃÆÍnÐ+Lô¸§C14õàÞ¾ •özslH%à/ÛÈpÄws&8žQ=‘-Ý8M< 쨬ÓZŸì7ÿèf±h±ÂœšàâÂr?•mœ2ëm3Œ³|Nh>»Àñ«6›œÞà9qP×S)«†øŽEÆ æbYPÁfÁÖ•S³ê· ®M é¶|;þ‰0]·JYU­ÎûS±¢v@i% [kÊY#'–<+3g»|iü ?€ ¶IiÏÔj-œ™*/ÜÝzãIIž! –l¦dtŽÀ¸š®µEæؤO¬{+ØìîüÊ›a–×ïãSÅ¢­ERm¼±Í²G¬ÀØ&ïç½–ÍÀï~M¬Ê„Ó~RÛÇç§U@¹€. óNŸµÖ–¦ ¢¢LßžÎÛ°v6`A·Á‘6Òç¤OTø”݃@<™™+òÚTúðéÌKÁÞÙÁÉÎÚìKÌ+Û«šãœh‘2Ç"t‹Þ`½ÿl_;v`ÓVÜfûÍ7þì™Ä¾„¿‚cB›Õè‡ßv63Ÿ,ó¸'¨ÛXZêÇv-JQ™íLD½:-n`ÏR ©ZY7›Ø—Eá+´²ÉF›!1üÙp«b¸†U-¸ Ò µ¯¯ë3=QÕ#'.„¢46Š;5.:4FÁ*`²²!ÏÑWÅ*ô»Ô=Yae§î¨¶bewÍÐÞ)Ð[žJ‚$\ÄG âyTe¥±çYe—ÝfC¤ÄÉÄ&C};´ÊwñjòùT¥¨¯ËQ+«e†lô‰Ký&w’…#a\¡§§„[YøØ!ÑÝ*62ÜWÒl6µBÂLÚ Ù.`ÂÁ*®µj_@_é*­]Wz&Ƥ¥®wµtün±Š ¥ÖÂþŽýL{høÚ^$Í€‹.Ë*«Tü^"î'ó»$ËÒØÌ<6³V (¢©a`b>“.ŽH£¿úÜåé˜êñ6Xy6]E°62µy«y~A»`U yp+]ÓЕsžÎ½v¬rP¯jéüe`±1ö·*Ób£djÎýO)‘gmÈ W+“ÆÒYUÛ—âR$’«e±f”£Dáìã±Q9œÆP”%?õo•ÆÏ×|«ÅFY¸ã-À³»B‹á>Jû97,‚Ó™À$vrùÊ+NÁËìÇWwoÏqPõ¢U ‰ªz Ôób.ˆ;æÚx 6ÊfT›R€0\HÛéQ¢Õ±J ”øL‡Œ÷ìÝêÿøL?I)u¨Ì,j›žŽÅ 4«6´¡7ÿTZwì© ÞÓkŸ¥Ïp¦< ½´6dN.;v䜶Q¼ Tôø ‘V£F‡KðýT]ÿ£ª ù²»ê3ŠÍ8Î>Ô©¬OØèÖ*¿dœÄº™í²ÑíêÛ„ÏYc˜fipkH ×ÎÚY…ÝÌ©ž6æåÆgIŒÓÕ@b[Ä6#ÎGiX ¬CÒU‹¡y¹ˆAŽŽ¯Ua- S\ÂÃùN â¬@:4i†%°YÌ­v\½ñe{ã™,ÇÓø¡¨fÕm–g²[ç«!±ZXó·¶ËJ®~æáŒ2¾V}—a¾NñªÝªý€‘šDq Å|s~"ÊÉ—–øžcÕp@h#XDBv{2‡xDÐ"XÅ÷l3é‰Dt*PêÚ섆#âËæV¢è™ $ÕräËÕÐUM +Âç&)~ís.€0xN:S·*ðêÕ(•t}Oô>Jþ…ç-äê¬ïèEGV‚‘|" CÕÒå4gmL°BMã6Üßy&Ÿíu³kl×Íb°5:÷@rtF°Ø¦u@.ñà8U)I„¿÷Öp“¦&-6z¯NA†V¶Ø›ÓŽÉUIso³ìW.•käßyÛ,Ñ(jF91%ã®üt^”nmb•SP¦,=Õéz{à=ØhènTØ“Si>jiÜ^ï')|±¦U÷ÝÔLÆ{¸6âêe4ð&5¶^è>¦?b±4ï6<‘Ú°qP„äŸê5ìiå— †˜o~º|U.­F&ßã”üµ™_,E9c¨èýéL‡ÓdÔapZõ«g4òDÍÈy{ð²Iu0‘£=ãîeaÖÆ0eï³UdnÈÛíÁO L~&tÔŒ3Ÿ2ðóélÕ¹|6õcV w/×áj—SŸ.¬Á'>‡ô…ÜßyÚ{œî¶—{°ªY‡Óçâ…´$@³Jø¡’MÈZU'[¥‡ã~Tð@¸ÎeÕ¯ðeMȹ~¹Ä¥yºì{YìÙÍf2£;™ÏP«€qy‚@Ï•ü'«®?Qƒ…ý-PØÞŸ.tìõ ‹ ÒØ&«*“‡Ó#µßu5¶ì!&›Åy:2@‰kOár ÿ¶²ã˜óÄpE%,ßT—-ÀÞĪg3ð8ÈâA*Wæé4çÂù gâ7ŽÈâ%^‚UV_¨ý°¶Nech²€ÄVÊ’4LõÂ=ŒnÕTUmX1[j¯5¶ s0,hzåæ¯UIhD~AÝÃy*âò¸âÒ¡OC«t„,æy§ÀÝÇfÃæFªArËØQ¥.Ë&>v_E«méâæÐøà*aí3;:¼´ZAo•%QÕËï8À·™J°µ¦[´ª9ÇË*n0»³¨,õ»H6ƒ”ûr·UŒo“l%C)½n$Do³×wŸ¶{ “a+Ÿ* _SÛ¿´Ù¬|nðxTaÕp;/<†ƒ—Xe—Wk¨ÚdØ>‹{`#_£Ç=¼Ê¾­Ò_e#ÈÃË´§ûnîxZ•£´´Ÿ‰~îJ¹RæåaûP¢ñU9YYÕó‚~æ[?zòdw·„<àÖx «ZH@ŸpßHe•ErÅUplïµê&ß"6·¤ÞxAgÕ½Iíj_űIov©%ɯ¼=&ÏVöp…ÊÜö¿WµÊ_ŸA¼‹“sO5 Ÿå&²‚R–­jX_Ž§WñUOñQ0á¨5Ê;ã{y'º;ñ«!j¹å”»‰z¨BÅV@h°ìÁÀÊh¼©Uå¯R[ë½ )hީûÈàv±´ Þ,5&›¯ájó麷Q¥È Òâ¬b ÙçJê>6ÇÓõ$ö@ f9Æ´JãžÀ ÚªÚÌ`«ÒÚtvÉ››Ÿí©"IÀE83}¨½™Í¨B&;`ƒ½«­°—áÁ—:œª¤íí|Å…8 (¡ªUëÃ1pª›0za>Õ;ÁUü:ÞHƒä­ò‚ï÷‘qŒ5¹'k*˜X fµÙÏ€ÿŽï¡R oÕ*'‡#âʧ ‘“U÷bÌGilàõ÷S}ýÊz“ äo4XZÙr‚}.–\}S\lÏNw·ST¥IÃö}·Œ{ÍÕnÛ˜-$Ы!Ðg ÿäaÔ¦M.²èom® ’ïÇ-˜f±þ'sÊ^@©[Õ$wi 6¨”ÍE€Q øBòRUï=“aG‡WÌ,:žø#Ϊ·^šÞÿ™|¹ØerÇ7Äú^¨¥Æö`. oŸXŒÆâ"Óî.‡€DàygõÕ´¹¤s®ÚB@y›ÛÁ|Ž«!îRí¤g*<_SÂâpòžÊÜ1%ÌÀ•lLÑ°vÖšy@x)æòéPë¬Y<Ö¢¤ù µ8²‚äOíÔ»Äøà@ËO<†¯O5ýé*j|*5q¢O§ûiã;á¸>æR/v,”1ú zAÞJu>Ýp#ÎÐìA¾ã©Ú(ê\ *G+–϶è»Ó§pr6¦‚©ë‚šoî¥E?Cü{$‰ÎŸ|mQg¢Ú%¦–Ó-*>ˆm]ÛµŸ J Ë6U*hs^£,x°O+žûLÏ8£Ž* Ãhsl;ôck Ø^ÕÆÕa‚ x£¡À|ª…N\ä`2þ;F?æ0ßšAà‹ÿ~*|Á¯­c­rSèÕò¶<»Zúóy|@¶± !û _×´¹ôä04\Sl5mÖVæ“Zÿî6Íæ)4æOÍ£Ã^©?q&?i·«$õéì^7GÕÀsÄÏSYóŠD\(µ±î?ìKaVÓæÑ ˆ`JÙN^/Û\KIï/}¯£fãW0GŽ®Î‘ÖÆÆÁ~§¶L¾å™à=+%ûHܧ­²íOÄZ­A“­ê§º´†G «¤_°½ŸN`Ê ÅøÈÍYÀàË\V£™l<7øé¾àŽ…³ø¯5æÑÕZ½„FC•ï^B²Ýz»ªgˆ,~«ôt"MxH[÷ì>¨0íúÅèY|T3W“™B„º=œYŒäô]òãVëªW cöËÙ\®ÒÞôÁ«%^µ|¶hþÅ=EkúTçaâWß*œá¯-ïæD¬s@ 廃¶rVÁÊÔ$ÃLPyË%ZÀv€)ü~¸6¾©Ø >4¬Î‚=3϶ÆÌé©<<.^sÅR?ÅO`a *ÊØ®NâJךøÄe›"Ä®;a‘g2OT$¯ÉwÇj>ÊW&±8¥²[îÁ§ºWÃD²ÅÚkÄ;ųéÜ[¾—Ú +ç+D䙞җA¤Nx:]… 2P$£OîC-‘ÎwÖlþ´® >ðq Ûx*!´]*‹ë6o·z`±³Æ¢8¨˜µ/C’€›®µñ²{"Ô3]‡—«Óæ¿—?¼žÂ Â¼ïK a ncÄQmÜYãn6À–ó ,xr58ÈRUÓûêŸ Á’^®»´‰®ÛœS™H½#qAòy&µ¢Ž/ÖeÏmîQã°ç• IJ>Ý¥x5ܺì@ƒ`Û÷ZV§uæµy ‰Š·×»mïÆ£6O#TÕ7ùUw©O ·úc¥øLë˜Ò7ùvÙÉ'/é”Sø+HÙcµ>»@Êôn²½6grJƒ ‡±® Pp‹_Ô¡TYØàéÚn[wVí,ߎxà¯óùEð¾Í‘F`µÛòílÿµyì½åÀ¨`•ç±¹6)Î/.µ·+xÇ“rý©jk©Pú3W›ÕóÄjÇ=\/<5žØÈ:—gקšš5Q1A÷xºnð\º°Ÿü´ñ«"ýëÕÏuw­F¯eà‹fB¬[xº`©lô¾«¥}´ÕOx¿›ƒÃᤳŬÙÏ È(dõ_0¾-`íôj°(c|M’û3yIBl‹¢F…om>Å/òk]6ÛÆ;9žf¬ùsxjókØ·±d“ô6nòæ(Èîˆ?ÙØÖª«ì#\ƒ%\V/FÞwÈ×ÊXMÙfCKÂϸœG'ú ÐÅ9äs­–wqLp¸piþ»?ñq^㾆‡hOî£NŸåk}îûéêÒZŸ/±ú6Àudý±}r×lÞ®¤r‡„l\—Wdt2œÆ/›À2ú ¡ÊI¶ð™²šŽ^ Œ¬ýµš\AÝU¸[\Õê˜5€"Å;¨¹”Í·g`‡¨ßyº×•ÙØ^ñeî’ͱm|IªâÄŠ ؼˆš&Ç)»§È¨Ík]XŽl§¸Î35ü50Áä­¦L v9‡| yt@ õň²+ë™Î³ËvGqá›ÛÉ]¢oñЦ²›³ ÀŒ"î'¾f5-!IÆ#<+;òtÉÇxª”Ø}1«eÂ8¤´>ß·¸ÕÃÆWùy>‘·9ü TÌ“ _âÍéï<á¡b§œ×™δú“ŠVÃóÞãÙ¯jÍÛkØð |¼Õý%©DüáBŽÕ¾m dw䩘ˆÍ·w3 j.$ûc5*[®CöJñ«½QûC®®Æ È6Ùü¢D K{'¼ñäœ7nQó„2vØ<(G¡Hàv>lnµQ!Ð[Ê, ZýIÑVý™WlÃj,ÚN‘jÕ>YÝ_‡’” à•PôX}wÏqº¨”¥bSVó?Ý©jÔ%àÉk᤯Ýú°ë3îvà³l’†¿=“àÇrÊ® GÛÿ¼Í¥÷ÖÚX3ƽž­³¢8Ë£­…!°ªu³96Wðaü2]Å`lž)çê¸î<ã Ùק fw¨?¦ê+|¥è®k@•ÕT«b}öCxÿѻΡ¦xºXx0ð`ÅŸ|ŠÇFqq2›“…LO`¼Pûkóv¸ßºpÛC³wÚŨó'÷ÅÖ«¬ó«rQcº§‰¨.å¯ Laãך¨œën·¹§â‰¦xG’4Çê/aý% Ë‹ ØzŽ¯ÌLmäa©%ؘîºQü\±L›ÇÆr¨«€b ˜k›{,8Í%U».·ù{”°–ÇV¸G·y&4Arc ¾­[pàÜ(_Ò]²Zsž¿7͹?ŠõY=rÂLCOÈÅX­H9‚0˜l®ŸÕìXŠ™êÜ?Ú©=•¬s‰ZýIÉ'ªØĨZiõ³£q$àŒŠo?Uí®³çâiÂÊV+9Ô‰¡(¦˜¹Õ$áÝniŠã ?ÓÉ[À7(ÎüqܧBÛ)’ÒÂèâbíNvmñ-ñôøTn’8€î¼Õ‰*Ì\•«Š«ZíMŠø}¥!jõý¦›»pwî'YWz×+l-Ž{­rÓ, Ü´p´Õ¶ïU$VÅ+fþLÌq(ßÃç½'Wú³Ç_<ÝæBúT)ë%›mµLAöM{®øŒÕóÄäT.‡?•=ôù×%P>L±«çLJòÁ•?¶º8ŸÓMýRlßj%ïíŽËÒ÷°z,÷Kë¬<ƒÕœË ²úÛgÂ%¤6]ÙÅ!>mô¯\`0¹@) 2ú6UwØw•ú .œÝý*Ù½s˜ø´‚ÛœT;ØDLJ•÷L…iY¢'U1<IÃ(&¥”Ä]6ùDl›KR€<úq¬}PMHT¶ßÆËôuöXj‹Ñ¥ €ŠõevmÌ]T.·¿NÊz;—š‰Uõm~*êgPÏy”]„£sKñ2Ç »KÁjùÔoӵݯ*¶,ÿR¦¾øvðh—¯}¦©­d£¦TV†E¢d%?E©=RöÇ;'NrU[‰¯*;ìïlªÆ³qKUwÝãaR/=wÊ –…¼RÜ7¾ªö˜7LUbØX¡*HºçK‹T÷öîK9ÔŸ5«*äéþ Ns?Å‘:öý`;¯ä¾¨þÛE¢ÇäòRO<ù›æ|·œ¡j.Ë­¥Ð?|Psesªæ„–ˆà=O÷p} \§VŸvžL®¾šÃ,)©lŒJêö´Rˆ]ªë³Uéy嶢ª;¬ïýªRfŸKÉŸŸºÎp€@ãh”ǃsT™lnJ}mãIªbâôKT5hãWª(öu‚FUjqŽ*Í|¨ÍïýË–¨“UEk±½*Dნ#©1-QµP¦”ÑÓ'©¦S{¨‚Êò!U4æ¼+ÐOs\­F»»Z‹}*2˃Ռe /Uc#‹–Ó¶HM&(ÇtÔRÌ}Õ6ZvëJ*…ŸÖ —ãHa ,þ“z1UÖ[³æÓÑ"ï&¥|U×6Î@¸Á³¤Þ}:R& õl)ÁŸZaIŽŒ$S>?úÕSŠ— P*6¿/E«k ™¡*̧+#‡y(üÓTÑky›TYšÑ(å¤Í©«¡¯-v¶ÔýéÞÏ*ã飪¹,וrÊö©rç™|² x®´›ÏTjUoIJšJ¦…wÒ¨Ã*Iä§T·Õ¨jDM›8O)x,7 _9֪˩Øæ Tùu/8=©êÚò/UIbÄUq ò›?UÅ ÷ëxUb<ŽqZƒÖ6ö£ªvVd³”l»\*Í©Â"¯*L«iQ5nö¬Šz£RvÆ4¹*å¤Õ©b¬€È ¬³·lþØIåosÇRgâ5ºÒ å©'T¥ ï¢ bË餪–¬G=üÓHj ¯KCê]Ë¿¤ì_˜8ß…ŸZß/Ud^,´·ºUä@up¨ª:³üK•'j$³ª"­¦EªUŒš˜œ±Õƒ¨Â {…1ó\Doi‡Š¨RZmŠT–á4 ¢º ؼ*fŸ¾ÌŸÁ‡Gëʉˆ¶Ü3¥]•<£5Ñ$N·Í‹¨ƒ¼¦ê~˃UM ¹˜=«dÂê ÔyÚÃõ“’ÿ©Õ¾[­á¤ªÊzê}:ÖP¸sÑY †:U¬Ì‘‘ÆmYΪªÅª@¡¦Æ=uΪ°ÇÓÂ=?µ©Á©³‰JŽÔÐ6¦*ìpKŸ²×êŽÔ‘¡í£‰«LUÃ&ÙҸªG'su£a™ª ²¹+U;ú£Xê°Ÿú?5š† :9[M™*:œD^ ]«çQèëqüW`ó>ªÄ*X‚»TEkóLR»]¦„=Œwº‹Û0?Xr¡Ö¬8¹^œ(U¡X픪 ŽÚmuu󰨯â·ø O·Qlø˜«×òu”±>gƒxT@|ÔÁÆ#TÁÕ%\öªª³ñ©é!ªm.UPY…TÜøÒ):'{ºÐ…1ºçT5o5ª¾(*MR_[mŠ*}盲”üO·.™òUSjªÌ}&Ìyp`1|]¬JB±5©Ù­VKU®'¤S¾ÊˆöÄbŠ†—ñˆê`cucꄃ¹Åƒ¨„{rø€=˪â³ù0uðP‘áZªØzjã\•²~`ÌÕ.ÊîQõ@ zWUÖÓ…U'\÷®HøNƒUqw¯j¿XšQ}] ðn¸xÉm}ƒû)‡;.ˆÛØVT³•ðñ),«3T…=>©ß©Jn›V5ÒpP@MJtÏÒÜ»gÇ5läô§ŸÅŽ¹G¼àöhëŽcë7ߘ¿.<¶NB•‚ÉM…`2¶nAUíõ Zkþ  ±ø`^ „ikTYÊ.͘¾ndåÉ!æR]ÜÄ<ži¼q×QÉ@´5ªÔåJ †z8™¿Ì’ªDQ]žÚ1¸2˜‚úº+>ÚoÞô …Ÿ,Ž´%7<¹I¤c× j´jX€> :¶¹‰écõ¡ª]*Pÿ™ž¸+ðêä¢RVû­:3í±ƒ*4Ÿ‘ÒøT IT5¬ÕÌ©óÕä]V«}SÊØ×ôuä²y4üZÃT`Ž!PVg¨N1p¬’º<Ó¤Ü,7œ OPom{>qîSfÐIòè WÖ8žB m­€ºà5H/ôJèmµ)ðú¼d³öÓ—BÝ+kå×UüVó¯®mC‰›ùuzj˜RJñª¹Ïƒ°õ1\2uÛªþ«öSß"æ^•Ü_¾ýW.0š\àr\U¹ÂÒÚøŽ‹çv ¼š^…gbŒÄøë8®G J [¼9=çœ]ãŸ.¯§Ì…Ú -pºÅ°U=¹40¿Ÿ:Ç’‹øUWó.µ´qহ7¬Åjåá œÿ¶¯êIúb¹KWhÄÁšÖðœH¹ë€Qõ@ºÖÎ6µ x‚_g~¦˜xõIŒ{ƒÓ6N“†îþÄÙÜ\Ss•—„Ž±Ú\ o¦F„XÊ¡*Ó,Òu®6ÆÈc °t—;`ó"ù$õ¹IXÚŵ{tFJÖÖ.i+<18ÁÆ»9…øôvCgñ¿ŒñLúLOXÕü_̶<º»x±’–¨ÕûS×–çÕ™2YUL íäpf€Þc×zvcirÉO.žúÄ­Ö]À<;Á=`NàÎ`¿ºMÞˆ­ÉìŽM6¿:Ï8z¶ d±yÉrêMcïO´wž¼; ¦ˆ¾­Ÿ½‡Â±k,¥žx}:çŠ\ªüÙÚKõÔ»Q#0ÇÖæc,C>"m€Ž'ßWÔ3 V°ØÛ˜íˆgj ¦Dà6«•Ò@€PÔž9ÁÚíß©¯Øê¥ÇÅ´yåìœ1t²±ÐžúœÀ ØóÇÆ–÷ÝP)~‘qã<µÒ®À/ÀÚ°åþô… aÆ4dÔòô†<ûÈ‚õÃ_YÞ]RÿÚµ2¹™vJ—ý)ê ÁŶžBsÈÙù¯Eï«!›A“ä÷MìÔ°1‡“E[n;‹lØy¶52xTmÎ2žƒ-ö¹œ¥Ö©Vƒq’ðÈK"cϧú6qÞ¡ÿÒOZ>TY²ÓzÙüÆ?µ†óB…Ð‡å ¾W.™"cƒlëõgÓ îåƒBMéቌǕǔ¬bqÕpjLÔÉê~6Ž€Œ³ØØÁR_âyÒ j“cùBUûó–R™Â§7³ç"ð ®?Oì¶ÓÔ¸†O7v `[•ŠZ®ÛØyp³Šãq½Y­~ÓpPŒ“ÅÚ¡NÍä1KZÓbC!WJ8¸ÝfãàhýàÈÎ3eNÝ‚ÆÎuo1å’ÊeŒ9T£ZŸ)-nÉ «[¼ô™ OtúÅý{Ûj«†ž6XƒvlìÓ÷)§èú†w†{möŽ©+®kmòf°Ú^Z¸Xj'M{òEQ l8­xò±±&΃FÚasƒƒƒå'—ÛN™+݆9´¼f¯˜óò½/ eã;n5Wïæ<¤”mL3áq’J;°½<ñjY·«Ù͵1Ž³ È•œ¾Þhó"Ý«` ®ž³ÝÆ«ñ‹‘—¶óDÉƨŽÆ´¤‘*¾Üo«#ƺu¡IÎÊjo:/½ÛZ ÜŠÕJfãd&|ùzòÃ{Êš¦^Ï$Ç6UìÁÓã„û/Á|cq€´VkaœúŒ;·×ÚƒSyþÊËæA³¿øD×Grª¶Ž´}…«xwE´š+(Ea^>‡åxxö SÉå.6ßàÕ€y öq’‰=}gæî9Ö6÷ß…±rIPDµ(8F¨ƒwÔ‰¬ÜóÔ€Õ9Üd×¼åéɸËðÓ†ó*N°ùè-¹òê³®úô¦Ü0_*+l}jcQ‹=P/—°?½f|ë¾hìƒ/³û€AŽ•!¦§çfÕŸ<&Úfuáž?P‹þ))PµzÁ›@Пé&8ÍÖø` ±î@Xxu[4ÕËòÞ"îcµWϳ1!`H Ñ°:ôäHÙcÊ1&ÞjéWkJÔçGа«Éå2» ‹k“9$³/'`±ž¹=Xã3rª[ùÕ?gÎP€{A¬ÆR GwŠEÎmœVª¹4ïˆ'Ú:³èóÄLãuâÞÉj3ƒ²ÔŸtѤ¬–Û¡™šQ@ÀS?RníqÒÜx¦Ájp)[K Þl¹E¿ìLÑÅ ~´æcø$àÓïŸ=eå“Éf\‹Jx>.‡å³N;4pºÞŸÞhWä=5þñ[lCÝ: lµ6ø~ãäæÝuµ‘l,Zæ»ÖAEþÓÆõB¼£¤>Vdl÷„ÝÅ4Eè5äü„)™(F ºúÌ}pY»ì¯ Î3 Gñ™vh·ƒ^Z»ÇM Þ'LËò!' *DÄ÷èÏ“?UÉ6¸h¬Q×6W†—Ô^ 0Àâ•–'v¸ê€6çË-;8ýƢة•©köfˆ'›­Oël(hßUêÿLU리2"\W·±Ÿ+ä8®ÉÅÒÀh+LŽƒ1$¨Á£ÍºÜo‘HõvÎ^ƒAAí–Ë‚¨ > H6æà}^m†¶[ÅN[~yÔJQÆ+q§¢Í àzø3·:L:›gŠ¾8¶®>€V7BÇ©I“‘ ÒåÑÂÄ$ŽLªÍCe¬n)8>žZâÖ4¾ŽÓ§¢«msÜC€ú@?àí©_ôðËÖø¢^¦øÚØAj-vMõÒ€gJ­ç?YRö~Î3ÛAªGÎa<Ôbs^ß@# Î;´cã-çBP|» +òÓ#¾`'át벘㙵çTn¿£“qôŸºÜÁgA Ô…kZ-Ø)kKèÞXVß­/Ì®(NÈÃ&¶ËÆÄJ¾sÀÕá<}_]©fxZAp·í3Œ…Äô.7“â¨[è:˜ª¦åJœÂ%Qw¼=“å¥säÞÍkÝ`5× Uãç©$S±ù}WÁþÌ9žÔ~fÇ ¨cÔQÚ§_ì €zj¾Î§7¾i(Zn©ÕæH/ÕJ¨|®sËúŸ‘AoKb£î-ç© 9yãukî¾u«Á²´¯PÏÆÒÒˆCMºÂSo‡? -G€…žãÈ)¸¤>ûûhÒá4ÐÞû,çá\ °–£EËŸ§L…Ux ¶Åp<ýì…½êCþÌ®N5ºãpL«ÀüköôˆªœÛæ/ ¯ÑCqkUR ®Êq›Öh÷ê’¦Ò¨[¿=»Òú€TàÐ\A‹ÕTp¤Fü·€¢ÅÅG¼KÒ€h.ŒÍé­˜`Ÿnó¥Î'?UÆxèƒ×ò½¡ÚvqAº‡»ôvðÜx:®;Ìâ~`A™\ÝÕ²6GÓtˆøÓˆÇêr4zò °àÝY ¼Z³ávÓ””hã–´ï†[ýÓ;36òràØ=}zjκ’)¼½çPᮟ9R”Sx`?±åÚT1qN†¯Ï§÷_tC¹\è^µ9RÞ S |˜Ûkó}Cúbõ=eÓ7Þ;ñ½¥îGS9û7l·‘ò[¿?Ðëò±>fùzSB’Ïóx ‚}weÙÇá”õuŸÞèG½E3Îý¶~ÜÓó1cµ º”ÚÓ¿—Çü†§`éZµyBî3¨h( ¤Rtÿä35O"È ,Ë![Ÿ[R­å<¯Íc4/¦ÏÛo6×yfU›ŒíKƒÚØ8¾S{ ÈåømÿÔø.¡°¦Pi²…ÙrA p½³g°Ú|%”]upìacŒ¬!¦°«ÎæögnjìE…ˆüÙ¸1½ Ô Ÿ§w¸È§¾¥ »p¹ó1=³‰=—\wèJ|fÿ,VeáX«‡Œ¹ï¸óGâúôj0òq’ƒ`¡ü~´Z€ÐWö^jñ§v…ÚüPÒî–G ª¾õÉWµéoÛꊇc½n,5ÕÒX.£ZÉ!åÆ·F?;u[7@t†Í¿e°nrq¯/6—„{WöJ@BèVÓx9ߢT|@I«Oä)G–ÎPíռͭ&•µÅ‰U%ð65x³¥ä¿Ùj„ÔæŒ#Ó°Z+?s7&‹«P²Ð|°±Þ¸¶ƒº+™”nµq½¶°¨¹òS}tÞçÛîŠÌ¾ý£ àXq<nÌêÔ.{] ¡H…c5ês‰Z*V¾õï\8§Ÿ °½š¼‰Ëö¤út™%.¯ÕŒl¸?x”¼›ëOí´ZLÎfÚ «CбÜY¥x'²îöþM ¹Ž¼[ò)Y=kÐℵÞ6VߤæQ+É!y÷—e±9b{A¼Z¶š2,ÜÕ@€¨:ýlõ‰8LGmÜPVÁæðkJ\|‹þä®$¹Õ˜·úöñÑ³Æ …ùì“Õ¯4Ë… &g{ø©Iy ´Ñ`–;­³\ω«h}ªt‚ ¯ßO}Ea»¡nÞ â³z NgÚ 7încƒmþM=0WìpD•}>ùèû Á“ üÔ+f‘ãÝÕ8×Ö»Ž®~œaa­!&£„J58,á´:ʉÙuüW»‡§_)|øŒSaÀ1mssQ-a¸'*Šä’>=ÅD¦á÷`þhØx/Ñ»6w¢[=èx,üI€ŒÊS Á‰©%Õµõ*'AbÔ¥’À±õ™J÷áðãÍ=s‚ KêÕñ}þÄG‡ËÂSkê8TÍjŽûòRše§]´zÉì<—5Tí„'¿Ÿx~Îæê³<}$Ö²XÔ ´w o‰9hI}$†Íßô :Y];”|}êÛÕ¦¦Ìù3;*rчá&¬Á3g>ì¦ÌÜvÅõÌ´#/y ðÖæ±Ý©ÐÍÂwÑÆ“‹¯,/ò®Þ#V+¸ ÚÐW!­Í+¨S!ÅØ´cµo=Uá‹ZhíɱqÄwˆÝåØ| LRsÔ4¿¤Àl>Zu\„ÂæµGÄZ¼ŒÝjôVsPŠjåZCb‡¬¾m6HL(…‡Ÿž1H¾“M¾óeQX+V·"v{±xVƒ1zóØ¿ãaܾÙúŸÂÃäÐpuKmk­VƒááT5¶ÉMv>Zl‰´uu? ±Õõç®R©85p$›“åß/H@Õ ¯ÓŸÚ? 0V8¡¶Ï¶¶dª”ÚÓñ”õéY¨†!¬ ·’­F[€eemîæx[=dRÓ-€]Á”ßfë·Àñ~ŠüÄMœûhL‚F:«»nuN €U"æ³DãosÙÖf¥ì±ÀØK÷ô `Þ®~`Jë©ÄÀÂ#×ĪÜl÷ù`Ö4Ò£òÎp&‹™Ó<ÌÈ „Ø=Q@BÃjøÃýè-77 ßÂ’s#ŸÞ9ßЕÕxrËŸ›&ÃNlÔi§.bk´o©àCø†›`Ksî«“°Rû©7Ãp³¯½´11Œ7X½-vöOoÝ.îˆO;O_«Öy3<®D›#Ý8­+Ñnl9ë›rep¯uÍç3“lâ †â ÖlLl|-î£Ö&,¼“ªâȳ«h|-ïH(ÀW¶6#`²Ù=Uƒ§úè2Ört– ø1žü©Ú@† Î^jý ì"oÎuƒhÚ¼]` WaDŸ|±¸£‰Z3@Ö—êìÝ€îAeÕä†ëãm*º«Ì \CH­ÿNgÎfËg!ò*ŒPK]¥!m¬0÷¬AßCÁ©yfLˆÃ@NõÓÇŸÃ7ûh)œdñØ™óì–ó5ŸÇF…Ä Ï JÊåÚú0 …Ó„¥FzòjV·’ÿ¡…õÌŠ#Ì!S“e¬Ï–vVøÄÜ÷©a×í“DÈ5=3Œ¥eŸcÃ4º{tT€o·èðàlÞ@ƒµÛ¾<ìÎƯàðRú€lóéK½k‡ìy›—äþ÷íëÝðÊs­Ž„+l&KØ­*ò…a¶*ú4ŸyBÕ) Ëèê°ñ2•ùù@ êHîí÷JÃuÐu¶yú®.E±´›¦X;nLßg”Q°1~èÚlc:)[͇Ú5,¬ÁöÇÅðôšß°UÑÞRJ·ñ9¹¿DbuÁÆlU†êGµ¦ãé ÕY|¾k²*`ËÕØm¥ægà ­†töÒ»ƒÄ­îý3Ój¦ý.*mljÛ8Ôn§KpÝ÷²9D߃d‡ —Îj™Ò¸†ÕvXŠ§Þ®» ©‡kîùäÊè¦-6wý3ë²I¶’6Øý2fãj…´™SìÒæªÝ‚žÝ5H·Øxœ½¹%é`"Ù\'¾oÌP8Cc5^QªKM`aÑ]œ„ØÇ+-Ü;ƒ}Z\ð;¹ùg¶ì)¹žÍæo†«w‰pƒëÓŸ§à5a8Sã†ú´Z&çä)ÖÁJÎê({È"à¶6æ3÷º¬qüaayl¬>ôŒ'@å´pÙO—²äÔ`]­Fèåger ªø÷è:ÀÕ3†~ýÔÓ·µõA=ü~bîà–Ä c‹”ºµñNš&ª÷=9LV3§s¹ñ ÜP^ÓÚA÷5†rym ÅØÆ4@J8:ì¹Õ¢á÷‚šÞò(=>³‚sÑÅL\¡…V-tOáÂîÁj6.{À–7±Cíl, ±ŠÀ™IëWjNXlLá’[±˜+17§‰Cs²e«érÜ«w,P™Vã\Õy3õ“`&ëZÝ;¨s«x~—4¾ØêyØ¥Ðà3Їw7p©ƒ¾hë™EqO`ÐÈZööè!£[ ÂK›cß=`´Žä} ouxP>IóYx¹úèd2FÉO7ëV«OkO.ðë¿åÑ”Õ|ÄmøªR›§žc\–û`±õÏ| ¼ž¦! ½ø¥G¶owÁŽ†³Ze·3@~@{Ëgµ a¥âU?±X˜b5BûàÞà¯>o7ºÍ›Ë©ß°ÅÖbñµÂ5WM+1’×Öˆ°ÊüˆÖ4Öjseî܆£-°‘ÃæSŽ’„Q£LaÔé©÷‰Uómz®üzf6Ÿ‰ç0¨ÁD³:{þ=ÞäUDfk!‚´ž 4Ì–º¦=ÚÅ…ÐÐ nѱz¬g{q,rwO)¶½hHRç_púmžpÂcâÎß0çg¶-?iüÉÝ°c Ál EL©Žë„r[}>àZ­#|çàh8–Íóà’‰¹†èØXzÅNߦÑôê¸ok®aMù€ ¡ÚÛ½:Cà,¢m â¶ZìtKHêj¤Q¥!>º*`>ðh—Õcª`7_+^Œ²Õڽ‘48K¾aõ >A88ÛMŸVϺJjƒ‡©sLÐÈS•šl^UÎæ€q~²Lìbà%Ÿ¼$ÎD]GeNV£W7ëWÙƒ}´ßŠé›ãMâ£oów(Ń)Ñ¿s³Sye]1÷Ì/ƒ¦øâ|mÞ~lÙ˜¸œ|kY©«ÂŵØjhs¹¸~ ˜^³­Ùˆj·Ö½mÑCr8CCÈâ±µ:œ¢îy»+@ñôÒÙ~@–£&**´½™ï1.îí)«N*á%I¶Ò³•$åbóŽaZ]\J/Í ö£}:µ_¹Àbr=©;)æ Öpê‹4ñ ‹À{¥ýôXåVœ¶Õ$§¥f}ÌÅóýa¯ÑVö|$9ä'¹.›K×)˜Yë¼ÞGó;I0`r®ú~سâ>Ì ¯³¹ÿM¢ã?\üôöÿW!¡@®Š­óÓ—¥“¦+€;loä¥é>3òâ%DkkÎVÛiðQâÙ¢æOÕ«6jµiÏŽZ¼{\º“ˆÓædÕt3‚Ào÷¸`9ú$NŒ¨€Dµ¼4© C…/hfÞ~z™‚~&Ð7«k‚³÷î°YÌƵxSm‘ÎÖ®ÆÄöÝ9 SW÷æÚ¸—F¡†#á¤=Úx'<èαѸ­' ]í€ü̸ç¹7kvÅZB¢¢åQŸ +ë`S="еv]¢¼ñà1èûÞjµø]UÇÿ„xP,)Gå1û®KQôôÉÔ4Ë|'ör>µîa‡J¿ññYŽ(MëÜOÃYšà¾¸[gÿ©yQp<›UO¼Edûô}ªpµ<ÎSBym|µ±ŽðÝ4bÔعG³¦)Y¬fÂ1›§ïêá£ð1¸*¸§ÿù:çïÌMã¶<õ š*ºK«Õ'®†æ§¥ì{ SãÕ ©k2·¬:îáSS ÉwÝtëÓ«õj*P[*¢þÙÞ›ß$‚°Kšê:kϼúW³ù^ížYXSõ0€¼ÓO#wO x8£ZÙïG»”$£8@®èmŒ#I÷XA¾§?ó§¦f»IHÅKæ^]“&æ-–,:%mNA]¯á¦4ælÎÙ-MÑxçÀG<Ökîoˆ¶ßw5%2ûæC»ééRÕ™< 'l?-â”…è œlL?®I5CAºúÔ`ö¦.þëpÙ-«ÝÀÄÝ™‚¬¨ÕT}j;N(+2¹6§W¦¦þÅå«äpí‰#j".Ъµþ“ÿ¦>`c€Õ&{®«&Lµ–©‰ŸÕ‘hªÅ'iîgÙØ'·qD•á/6ÖtpV-ñjœŽÍ£AI#+Sàø陪€º’ûA%å×æ"&|¬Æ†9lá>õ§uj²æ‰S):o5-ãj Ñ1¬žÚµç€ ê<:+ûÔ|Öo2ô^ïSãö•æà¥T’õèüÕd€†mº›/‚aiÚªÚ^÷ÌFMC“Ó²B8ªˆÊOlZ%ãp“f X÷ɘÖJ¼»müjA›¹ñóìOyú¼AËVœ°2¼\\þX¸Aš£Ø­¦ìTMÂAc9ºÿÒÄ<ÊÄB››SÛL*V·øðpOÌ@ü" ÓlŒ8gM[ÝRŸlдÅ|œ–VVPB~kJA“\–‚føøG ÃñRÎïÂô­¾ÓiR){Giáé'¡•Ë T±ÚÅz4 ¹ÂF‡Z=éÕ´(ðožŸø¸#5ÐwÇÆ80<Þó¡Mó7û Õ”`›f¯U‹Ù*ÊÁˆŽ¶11OÌÖi ­mÝ{«PØr&µÈÐF›/šš’\ýåí5NÐj,5 äâ’–x„ÅIS²¦¡]O}{åÝ<¬š²Ù\¼Ëš€»¾A³mìõ›*“ ©_ÈÎ[=š¸¤¤€(Ÿ> š**qj= k{x±Txˆ€ÉÎVûÖ¼¦†ß,<§í>3Â@o¸h“†„?³—{S˜;Tµ1±µ¼8@iÎÉ¿ò6|&ÃmÜn¿ç™àê75'…6gï6_…¯è_8¬iã7íöÊ}V®Í+§o²mU°¥°æVŸQ.9 s¨£·í©w4i*¾üQ½}GVi\ˆÀ›gdÖa‡'è8A÷ê¥x8ËÙIšdsãØ îÉ·i^’å2\¬»K-p«Ý­0pm[ƒ ×£ºE¦1j„âMáÑgHÌ[6(ZÍë£ÛÔ䦫![¸CÓéA=ajh©Áê9…i”óÓ?[b ÈTÑ|™6ÎƱï\lv™þZ½fGÓ™Šýáé[´Ô;­—8D[œÕP Ã}/ÉY»Õ éy"fç—ž9˜ùj‚ä(ç™°¸NñXp´Wp¼Ø8÷­šPËoR€äZ¾öD•fzƒxjEG|tØSgc“ó›Ž}ÒüÚꎆtÖå!HÏÌ seâ$-øV³ýc¹À¢¡×l7s)žØ¦·ã?¦¨<9…þM*Õx¢Æ‘±Úö iÜ|îR ±Õ¶ë   ¸f/V š’¦¿á˶Ïé¼!MÏ@ØœºW½ZZ”ÚN·¹²¦^ã]³…î<½ø²&’m•Tµ|~z0òjÚà¬ÆYcb®ì]<ý$ß jåÇŒVҧ؆ƒáwVý©I¾ú™f¿¥Qg±üñƇ¤ð”³Ú> „éÊKªŸP{´ZUÓ§2h¶Öè¬ø/P-ëX[÷è­;WhëZÎ6V¯Á'w´Œû(`þg"ËâïÝg¬yÏS¯¬éßU4 Ùa€gg`µßwjÚ\I/ðhé{¯Âe‘ ·Yœžon+ÒÃO¾V·GäÚ*eõÝËR Fyy߬¶a W«„¢H‹¹g<÷­É]ÍVO¾ðßY‚%DêÆ5ùukäóòç<nMS?*\P«Z‡V­ëýlØmµúšÊ–¦ÐÏa1O±ùSVãZSö+'mœáhÚ*'´Õâ’Õ!”¢ilœCryúÔ¦«Pœš£*qiëq&ŽÊÏæ ½øõh04á"T-}†ùr¶lúØüÛ¾J[- ¡ÑD[dz4]¹ NüÝϼ-6]JXµ3Ê·?y¦©·›ÅÖHu[·àó7Ù=~%2yŸÃRhCãÛû¶zO IÃÛ*QÐó“'Të}°‚6±ëV·ŒË©¤µ{ú'^ ­á–Í ½š6ÿ›n‘gÕÀ4[çŒgÑ%_l”ÕÐÀ“¹×ÀšTã´`ŽÆŸUø>¶VPÐBL n³Z‘¬ÀÍ°Ï““ ß”y A`ôŽY“{ùäXSYV»ˆßãA´žö4…™ÈÔ÷¼óS{Ë b¡w’ɲ¼Ãk*³»hd§ÕÒߦAj*rv«e«¥˜ÜG œœRˆõ£ÛÔDê¼!dk„§Çïñ‰kçŸ}„~å«É.ˆàGw5¦nZ®Bè">4ë¡*ôX‘øÀòÏ|ø¦ Pš5:½à8Cž£ËŸlyð eøtÕŸ'¾ºêQ»¨¬ùže®§6£® ñ öÈ¿/_¸ÞoÁÌšõ#+ÇŸÃÀÙ1½„åf®AY5×iŽ'å8UP$vxzü—«v|´†Ø^¯â°S‰)q™mÜ>6€\Us]Ï3onH€Y·Ü¬w÷é€æët͆-Ç'†ã”àì¾ÂÆ;ÕžauM껡և[³1j}1•¸ o½+Ä, ÍánÏ|4\Ý]‡.e.é3/¢íƽÔX¼Þ-¶¿ ¢Êri.víÖJì•UÍ‘ƒÅjJ\¬ÀÅ-‡?³¹+0v”„rK±¹ñ¤æ(©͉WË!ë]í(­Z+fsI _~®‹›Ÿ9Ì“ð0äßáìÛ|Ÿ n!f#^-Q|bü™|d±W|ê>°ÛR´áFCy´6p«Öá˜Ç0ž¾ À•Ù¨©¢,›;v ŒÐךªFxúˆÜØÊ‘D7-lIÜ—(¨£÷–Kà= ÛE…$\›'öÃ% j„aƒ¡Úû m²Úßîz-O­váÖr ÔHå>ý4¥N´gºOïâ]‡,hV3˜ÙÖúj¬ª¤a*O t Òü$ÀŒ„ÆvÍ4sN¤”Éxú%–r×ÒàMÉÊO^K bÖQóÉÛ¶ñˆ€à-ÜÀŽä`ãlH¼÷WxpOâeå®Åi±q¡}qnêg‰Ó¸EËgÙ7¬µfQssm.B™"i^Õé%§F€Ër©“ŸúÓ¬!Â0Dµúæ3¬od“Çm-ËOS¨açœuZý ßÕîæ¦}RU‹E•™sXž²†J¬­^âø²{¬Ð¥î^Bª+5]Üú§O Aí®e”ž~/.3†§G>«5(Q#šk¸¤ð̬\@µ{CàlÀ¬ÞYm \ÕôÍe²±PN-73Æ­æÆ6ÿ]TëÃjf¶F³Xž?°ž#WÄiO½ëÀgzA¿Š5´y&p!T CËÛ´ñã­"KªæÒקFøô¤`JqEµ¬·üÒ‚EJ]aÛ'Ž ØÍ‚/åÉ¿9 ? ê!¥zêÃ4ìKÑS® ŒÃb"u°Å(Áfxj毚!JXÉÙôí¼?±`[IH›“š¾r¨9o­Ù˜ B©²«¹ôœTËé¤qÏ’»tœÍYr”œÂžÓ‹ÍÉvù`Px­[í óÙW`G~Z͇†ø¶TÐ*¯á(œÒ³W‹’ñÌëTÉÿéøñ¬íá³Úö¶ðpR—¥§†½@O ƒœªGóÑ}ÀìB<7ûøh7Ð Ç¡iè9N«¡9ª8–„1iOŸ,áÉÁdCŸY‚ R¼ÇÏ[›QU>ß]T›ÛbcpMQeU¡,>üZŽÅÛpÚŽ³°·Ïâhø(O€Ÿö žP²ë+‘óÓw¼35útd¬}ê0Ôø<·í©aè 3Î&°¤~ߧáÜ-ª_hÌØ3‘v=Ê`c)Ë3¯ƒ|’ÏŒ…´¯{§Á°r©6‡ÒæÏ&FºmÜ‹ûÔº\>®™³ñ§Ë‚SYÖ§j*öŒà:ÕG¯„9­ðuaæJ=3††ÕCu¤\zbÒP‘Ò$x¬Q«ÛTæÃTå½m¼ ¬kΡµ³÷±y»ÜNRK¯ ÁA5<õ)³Ì)mÉÏ\Jè=°Aªð/6ß>¼—Ðn²ƒ·« ²ßq-'¨2Ûb ŽÇgⳂB›OOYî%L¢æí|’hjªt'‡ôô_`g¡O«]¥èú3‡V®‹¯»á4½ÍÓ«Õ^¾áZ1kV?tj‚«t¼ëVç´¢$·>ö¯<Ðæ¿áüÉMðÛQ9åÓ¯ ¨ô5ŸNQun6Ž¨¯±1$ØŸlã4^çTÖ#ãžÚ¸S%¾(6÷(yóÙ')Ýlz…I‚©¤OoʤÆ+àr8¼V'šŸ\ Ö8lãøq+%¢Ñîó oã;-e—UHí”tÉj’ضÂzùÌÍ·±óy1ñjÙÕñç鑦¹\¨‘|]oŸ}(GÇøòü%%«­Åâ¸=%§Xl„ÕžªÐ_«6ñ>ý'ë q:®'~‡f±”ºóÁø@‡ÍÍE‘ÿšy'ð›Í; ­N)Y¯ooµéÞ[×ÔßÆî­ p0u,^·Ú¾‰A>ÀäŸÇj7JŒk‚3²djÙær¯Ô3U…Öc³¹Îª,‘çŠ|T÷wžÅÁ|N( JW­6,‚zxž”üŠV{£pÀyÈV"Z-ÇÌÃu&W3ööÔ>H)¨APN)O››ËXyØÿöh;#’L±±®Ìöi˜‡ß«×å×Ý!:NÍxj¤Òr§¥3aÈøô¡Hæ°çµy>ÈL \†jõlì<ô/IŠkœiØÕØÖb9 ’9f ’Eu‘Þó89‘x¡H>qùGßþe·5숚œO²%5´÷Üq<·-ç‘€_‡ÁíbÓ$tl3ìÀÒ¹Ë>‰W'ü+¾n®àÍÞÞ°áü<€‰n Î3 N õa+å‘+kî~Fߟ_#˜>qù u;¹jÍÍôAkØq^¡BY¶µ—¯A Þx,(>‘º._£9ÞÕ¶Ì)-ÔðO^ÿ“ Ê úŠÔ €£šÑÓ÷¾Á}5^AÁ ßã¬CDí·ò×¥ûD&°¬ôcëÌý*„n¢œ©¼ußCÓ¶-™°oê5Ì ÇÈtd¬4vóuM¤D˜Ô™ƒ.ºtòΪjèQO™¥&$‡×«aÞkÊg[ðxó=ÕÖΓu/|Ò´ªïiéø”ËÖÞ¯ÄúûÈÅA¯}]%­ y3çšÈ“iY=ËY!³)®¹„žêÁñ±N…ðàï¶Å$qAwwKŠ|?AÑiwÂP¸-ö÷õa\†M‹ª¯Értàýj’Vt»Ãç0qSœäkê04šð0¢gñ5çª<"ó[;ÑÜÏô[&ìì½×ÌÆïÛíö¼>¾¿îïŸÇóãöPK‘=»:Ž™Ì simple.cppMA‚0E÷œb¢]g@h  ㊔vK™`‰áö¢qÁöý—÷£^4²ÅP3ÃÞ3y”3ÀVi4@ü€ÀKgIƒ™Fµ‘n…;¤Š‚àHNÛÅ Xápø’Þì!©²)¥l³\–USïÝÿí¦ïêÎNúù‹q.j'¢½Š[Vœ’ye?IyÞO¢H·(:C}ðPKŒ= Ùmæsimple.h½YmsÚ8þŒÅ–ÎäL.iÒ~$!7@hË!L íÝÌÍ0 «‘[NJ3ùï·’l#CHÒ^¾léÙÝg_%NN b‹e@ßÍáîC&%å@¸Ë€xÔÆAÎ),ãIÀ<ðÅ‚à“É ¾R—„9'‡oàŸ) ¨•¡F.ø1ã’†SD/ QD#ðiÈîpŠEö±¼pµ”›¼›¿sOç-›rŸN¡}ó÷`t=Œ‡Ý«A¯3þì¼ÅnjӒ7¸‰{AìS¨®áªÖÓ‹<õÄé7¯:ÃA³Ý·:Ÿº}·­–‹Á æ8''o`ìHŠ6Iá\ë—›î—Îå‘QZÍaçÂ1Ÿ3=ú×ã/£f«×v 8™´‹ POYS›œÇ|«;•tê Ô­'x$á!¤29pzŸ v#I$óƉä¹Y–¼‚à WÎYT«=:gÛ,PÒSõ›½O×7ÝÑç«q·ÿñºñ„5Í`&0"æ‹Ýæ!’~½ÉñÙ¬9èÂP¿ÏÀúd¡,NmÍ«T¯—®F+6~,Oß¾kÎ \özÐåw$`þŸtÕ£|&çkû“7Íp/(—6ôû?0¹±Û5Ú6T¡#ÌÁt,!Ðkk(ª ÃÍÖÂïP­Cÿu¹‰¡ÆrÓøX„(€F€ot•àV‘ôýŒ¾1÷£Yl¶>anÌ#6㺺HõŽn,1šÇ‹ ALtÛt8Üõ·-‹F;ò¤O§4 hdQ6²Iš@7 ÐÿÄÑÜÕæ$4_@ŸÂû†¦­³cJ‚ˆîLï]ŠÝò©B×µf‡f–FžP%\ÒD+åŸe(–d†$xãø}AÓ† cZs*•TáöœpNyÙùؼíÆíÏÍ~¿Ó;*Â[ÐGkãU²?›1¥‚ê)¡t5gµ3(Ph0sú•D©gÞ'𖸽©x@UØÜl/À›._ÆÒJ7ê,–råÖ”Ò9Å=´QªF«ªå¶óÑET‘1ù—z5Š`¢atú (¾&<  z/õ«µ3„§h;(n”¨V²oME¸Ð–À!‘’x¸ZÔñE3y_èjÄJBk¶ ­³x?²7Çy²Sf-R­šÏ,þë‰ÛP zîÑqp¥Dû©A{ÇB“ÀÐ_Fl¡¼.‰´€ªØWRžG>±'íµÈL¶´/¤j¡TU5ê+wäºÊÞü·Zî¬|0ø‚Fü7,{A€1¤£AW:eh+]4qà«®Rà8‡11¹§‹LMZbZÑ –’ü˜¬¨Ã 1^èT&+XøÈŒv¸_–”&¾ öîHqƒ±Yó믌Ì!•4BÉn²i›´Ì®$$-óÊÓÿ×›žh²aI‰VZXFÌ6Ø—…w;Ž¤XhþV—‡y.óÊËòžu§g*«Ùêù²¹»Ü¿†!N'$(¥£œ.,Óe4Ý œEºœI†SÉš¸VÍŸ_HÓaaK⫯}ú]&›õÁ<‡ÞËUŠ<î§HΨ,ÜÇy"æ²qÛíÆWÍ¿ÒX–çBKLL8+?­›|)°ôô|ª]cµMɾ1›‘Q#?ö(¾RÝ;å¾3ñºo¸2þͺ/›»0%Û, áH|xÒÁ½}üšliaˆžãƒ­ãh1×¹O­¹JÎ á3ú ]Ó^¢¿Qî7z_¯o.Ÿ<å ¡XêN“J‰¿ZL¶bï•E©‹Ùs庋ü;?'T3äªbêG­_7a§¼¬ßêô/ç-ºƒMÿPKÍ=>7»V6± skipjack.cppÕXmoÛFþlýŠA ô¤D–ù.ÊrƒØ‰käÒ$BâözÈ9ÅŠ\ZŒ$R ©È¾ ÿ½ó %‘¢]r¸/ÔîÎÌ3³û<û¢žœP>U0í‹Ó< ã(Ö!ïé:¦ç*¦(Kç4RËYJ*Ët‘þ-ßÆÙV/è¶NNh5‰ƒ Å9-–ãYP˜ÎUœ ‚4 ãä–Š”&l^é1åq¡{­ÖqÌ–¡¦Á¤7ù#Qꈞ½ýçèúÍhôç‹W£7o¯ßÕ}·#àäµèÑÑ›EÏãsÝñ|1ÓsªˆÓ„ÒˆÞ½|1úûù³—¤f·i“9G ˆ;·q¢f³{Zñx¡Ìz¤’%½ó\%Ü=! öÈîRù(À?ÔèŠÔDÒ"ø˜†³f&&Àú²)ÀÁ݆5€5¤nQmÙQè*W•¤Œ"išÂ¦”Œ¢"”g‰Ì¥¡œH–†H¿T¸-•ÑÍ`ÌÆ„•Ð k(ªáçËš PSä°ÞײâB•Hî¸;@´Pm ªÇ˜èð&‡ (ŒeÖA¹g$£lZ9SàäÊy$› ÆØ8 émPo ½«‹0 cŽ×ú2Ü9¡§úþ8Ô ÍMRìÑWÄÍïL÷ª¢(]fÇYºLBúEÇy¡g”èb•fÓÞ«´FË$€2,¾“;¦ÐÇùrœq±cy/´ë %ß鮨.Ñ¥âÛ½Dç{âŠø:N³Eš©B#GÎ7üæ’‘÷BQN¬'wÇ|§Ç‰¦Û6ÃuiÕ¥¸K»4íÒ¬Cÿj}æ¿£}ø™Ú<›°Ã^ïãG|ŸÐc¡ŸÚéÜÐÙùÃ=¾+ß'OˆÈïÜìs›~äl?ä—V5c=›Nm^F—Ì.Y]²;•£¹ÇÑé’Û%¯Kýš£µÇÑïÒ Ä­9Ú{‘´Ä­9:{‘´ÄÝ})ÄÉ'åzû¨Kq—ÇÉwð8ûßsótRPÇIÅãä sã>'ÖÇ}ùÚÕA³=bž_¶gàsýÝg ‡ü¿³.Ÿ¥d£QÞ ltê’Ý¡v]ì;ijÑÚŸÓ›˜ûsZýzAœ–W/¨™Ó=¸v¶Lõ&ªKv½Ùª—U]xëmZ½Ïê’]oðê•Wûúh¨žWÍœ|¨T5sòqTÔÌÉYUÐP€±Ÿ sgMl˜nä¦S'¹Á†i¿®:óêÌCª3©Ž/¹oS@}I›dÔW´É…Wc¸I…[#¸Éþ!ÁÔÛ¹5Õö_Õÿܽ|ýœ¬h~'F­¿PKÉ=¡,$R” skipjack.hÍTaoÚ0ýL~…Òˆ‘¶Ûª ²HÒŽ•A4Xµ©«q.Õĉl§”Uýﳄ¤«ªíÛ¾DñùîÝ{ïl7hÀ|Ððëo1ó¼åübì}v†ËOFCmPÏîf»~4£mFƒ2e> ºr ›nX¯ÆVQBnuÔ˜:_ܹç ÝåÀ=O›C¾Ieây-…i¾BKCHž‰Šfc$¨‡ÒlQ‚Îè=ø6§¿Àú`w*;°™»‘¡u|dF­ ?šLXªL’0! 1Gíƒ:Ç£yžàD7 §2Œ§8†f =pg¨¾çTï?}MØDF!‡àc=”2í™æz½î®ú˜vI›‚`ö&¦œ'Ü$¢Ê8j0öþÏ2±m Qè>H®8QÈÍ=Ò4>JHÓܦEo‘*Ò‹Åt¶¼\8ƒ‰‹XÀ¡K o§‘Uéj5»ÍìµÚ]B}ô‘POÛŸƒT¾7·¶®6P;ÀU¬ƒ2&è Q&Q”¦³€v÷Gx˜r^§˜ãX´ú ¿R5K%q4Â;‘ k©j*[ýlÎA›³ÀZ'Ü?>µ›-5)Eœ'ˆ_s¯‚œm°À«®NÞŸ^«¡ÖjùIÒÇk$·ÅÒit|ÔV96’x¥Hêð—N»Œ”ŒV¶?g§ÇB8Ìÿžð¼mÅQÊòX§L¼}¿ËììÖI&óõξ–Nï°„ç…Ï÷¢Ÿlj÷Þž \½»ÞgüƒÜü§rý—åúOäŒå&ýJ–îÈe8²Üi.<›vômýÑ‡ýÊFî¡L™eëOQ¦;ï+÷—°×;Ár¯? E°Ü¥ô»Ó‘zÁù40~PKÊ=HϦߋ smartptr.hÍX[oâF~¶ÅÉFŠ )löª4ÚJ»)JèC!dì¦2k<$Ù²ô·÷ÌxlÈ®Vm8÷ËwfÎäœ.’ˆ,àöáÏñä÷ñxöøéæa2ž<Ì~uÏ‘AÒÈsÏiÆ›ˆÀ»% ºì¯ÞU´ë ^2NÅj=rÝû›Owã›Û»ÙOw¿üvïÝòÏ©`ãqÇuY§q P!Œƒ,ƒÉòE™¥‚»[7ÝÌc\§¢zè¦0„û?>~ìÀÖ³ÔK;°Ý¹Î?†R"t€¾ü¥uü㼊(˜¢BÆ bè@D2Á7¡ ,ïeEìér%€…á†Mà‘&K4Í’¼Ð8†9UÀ×1É2×Áð¤GwçHrMÖsÂí$ÉkŠ¨0ØíÙbº†X½9ØŽLÀäXJx ïbrâ8žäÁËÛ(ÍuK¹Þhß^iγ sK"ÚÉùûű¥AF¼Žël]G֚őj­ª¹ãä}¾’µºÀï;@ÏŒFh›_öJV.åLP›`5±"\OFÀWYÇW Yú& ˆcöB"m¾(Ãð>ª#è2Y“DÔŒEPÍÞ`PCA ô»&m¢e¢*HãÔHK.ÜýÊŸ* { žƒx£Æ‘OA=4s8JY]Ö \°ù_j&L/!/0ñ$+?*={”jj©-{)¿—½CdÙºHîËRý¹ó®&H/¹75¯u[6Lö=!hçŒÅ•äð@PÛ ñÞ™XѬ7’!]\ÀYÍ—/àÕXEàø±[1†C(3ƒÓÄzæ·ÁàxvØ[s~K÷èÑŽÕÅ5b‹A/Î1i‡è;A7ŒYÌãSÑkŠ0û·(Ž§\ŽÉšî) npf’Nƒ²þÔéXêXÞ³g7¼Ñá[Ñ’¶û€jNè­˜jIò?Û$x µîß¼¿“^‚‹ûÂö,"Wïø»&qƒb4 W Sôÿ»c¨ák¶ ¿Ø t}Êâ¥:Y³,Ѐò溥œ>c{Ç·Ášþ``7G´Üù$¸é¶Éøú¨ÐWPžb³Éf½ i)y`’+·ýIÊ8óY$ç&ªkÁ ˆ³ÐÂãºæ1Gs¢F…ˆEEƒû¢±¡éè2*»ÜPÝ$!G« d_¥ìžà<²ººä°Å(üó¦AÑs¶Ê¬ŒbI¯Jõ­å—‹L Œö‡Å›YØŸ÷É}Tƒ=¼7‰uúëéëÓ× k8V)§!Ÿîá°df‚"n%)LÏc£Jø ¢^ „¿ˆXu¹žXÓ$Ëuñ“UÊ,åËynQć„f!™wó¹õ€ôÉZ/(®çt@˜ù«FbÌòÞôÀ|¾mKÇÔŽn•}C'"j–§ãÒØ÷2¦Fæ*„§ ¨ÒZ5X¤“‰¿œµãtVêù ùƒ( ú± ®º¨]dö1 ¨®E²oɹ²ƒ/,±kéÊfH뢱Ô½ÚöÈ#æÆ“<òÉ‹ÂÀ3=PY» øŠ¼$¡9Z1÷m5zÎ7z+_LÕüóâkC!º¯Ù=ͲjÌ=ժứ *ï+ÅÍzð ¢;ìVJzáÍôz(+jàúTŽü†£ oè†ÎYoü¤H„>(Œ¥äž’ux»âdá~“˜Åljw y ÄÏð» øÑÅÇKž3Kzkãbk¿zý×£W§¯ÿbÔöFð¨"€ºÎÛ„Ž„Ø%˜q×nŽr-ØÄŒ\ˆmSõ¾0sªïBòSAqS¿Ã»!žâkÄ£YId÷¡øl´§ô  ÌÀ¨g`­1Ë”¯øª›hùÈ¿G³Át¢`™$ U5RÜj-À[¾˜ ÜÑÔ½r&ÃÑäW6â®ø ¦£mÕŒª©µ0NÆòéâ_PÈdVñ<`1÷˜¦¤ãëÇ.xQ¹Ïÿ"C`‡øzÃøžSBÎôú’¨¥\Õiî!Î&Ç:)&8h¡SP ‹G" •²×”¨€\1aÙzrQÜm¡®¯óJðòRÁX;$†¹íãÚ¯Ò4wLºYÙ‡*ž¦"·t¸Üðw8V£âÇõ‘L€Øé]òˆé_ÍÙ¢ž9õeUuzÆb©"M39“Á'ÏŸ †ÞòÆû0š¸C±OŸÍšoH=ŒÝ®¡säRõrï­@ÌT…‘åßd4ù2ns«¤O~¼ê9$Üo äªsÕù‰DœJöƒ"Ûà‘ÿãçÅr~›Bãþírî ½Ñô/{uŽïMn|u@¾™.>ùºFÖ>,½ù|:Ï=±‰:Ë;ýN([ª"ºÅ×™·œÞéÆÞd¹(ez DRJlSæ..Þ‘'¤)dmpˆhA(ÝPñ@º'¾N‘tÂ$2ÿËyvÒl•Äa×i  ú-¤©Š98 þĵF’h5§a´=!H—U2õ—¢ßi<;Â\hnQÙ&y¡TÔíJ%b¶9'ü ð¸¶Î—î¡ft ½T™óÝfnàYP• FvKÙ{qà@?Šv«ZÈs/=`çÚ¥#Pˆ:FÚdÅyB Úþ:œ5!20àÊfþdþk’ç—˜q$Ï˹,:ðo¡”ÛBµÇX¨,HÈ6tL áMŸr§'";=ÔçqDüª¨õìk)ÊÈ: “S(¼ ìÖsööìš“Jáö(‘GyëU,ßÒŠr´¥aÂ%­&ÁP…ºˆ¶€.€`°20æÞàS¡|˜v3&ã L`œ¬Wá6¤D‘èO>Çu­rF @‹¤2h—mEd0¦¬ÐÃP£L»³ @„oúÿB&ôžÚRÂè7…Ým¸ÎXˆè•$ÏšÎM.ð"€¹Ã8[%@Ø“¨6°HKm@€᭱Âߥ Å‹#ÞíhC†’}Žš!gŒ†‡eämr”tü„Îë©ÐJƒÇk*vŽ%·Š¤Š:ÓUm$‚~½9È&ÁŽº5õšU¥¥âÍJµÀ}ZÔ|µW´EVÙôâß((ÁoÐ1gÙ¿<20§!©ûfmÓ¡ÛLÝbë#sËŸÇæ¾(±>šUâ&`î¢JÁ4©ˆMZdÃ˜Ó Úç±à}ýc¤…?xVÖ6w÷ÙriO>úªw Hó‘Pôî–†Uô–èi]“ Ae–¨ÜÌçgè ×I¿_»›5JŠ!tâø?;ºBÏù¯..ßíàÍt:>vîU*Tî_¿¿˜öÈï¿û÷Ý`ì{ÍN÷Uþû’¦t2a¯f·½B$œ?,Õƒ 'aÙnkÉÊH¬`/†¦nç#S’KŒ‡Þšg,‚+DÝ°>Éf`GÁ‚O´±ZÆ\•’ ®xÈ“þ{¦ïÍì~›GÞØÍ(߆Èuq¢éaÊy®Õ ƒ$‘äÞ aeg[uŲkUÝ Œà²CK6hØtÇí ŒÂ¨Rå+Tn£®2 .Ô ÏüSFìÞPZ)¶¬!ÜA80Up-Ш{0ŒçÃmÀ6ðÞÑ{Œs¸`i̘-ÅÁe«ºYÊ‹U$06EuË<æ¢qC…Í¿ž~Àñ§”ØW´Ž²ý™Qá–¸N}9ò/Ÿ™•5vbžŽ–qì´å¸åæ׫½kn¼ù/ÞØûz8tž>eRݱZp{»”{™Õ}„Ïrq\1ç­‰;.æº'O™Ð­X»þô;º÷>§Zûöh¯sNtbW¤%Wï ‡F?ßÐïéê¿€µ!ôùñÂyU -/…¥[Ud*€ç· ç¡ýÙ&Ch€ <ºµÁsÝš`ðm_¶h5èVõ‘7½™„¨3 oÈéo>ÌfÞ-ö-Á·XTdfè «Ã6@¾½ŸÎQ©L®í+·ž¼C ]ÝC,ã¢pɆ|ŒcCÿQ¬—¬W œŸô=>ä¡©Š‘—–p†Æ©E~>ô^ÝOßl\ò SÚ‡Þ?Øÿ$ëëL;ÿã*ú¥Ož¸cC|] ™g"¤uÌkÒ1æ5¹m©Ç_9ªÚoø*f»t$ÀÖo;Øݲõš -DÀ$ì;ãk+Ðdtdõûö§nÝ-·j¶‰}Pë/Âû~lêO)ø)ÒÍ@k™ù­±ùR…ÀÁÕEÎõËMÊò © k{Tïåðb«2¿·B1{¨×ÇÕâ뵡Jeú‡u©ƒ+øf*âCo÷/¸A¦ø]’Éí î–ý«Ÿ[W—×?Õ+ƒ§Õ¬´ÔK%ÍP3…2{Q}PÀbb_‚ÅûïT¹ò±m‹e‡eõŒ&•…Ê5 †.RùÍNròÃÏ ñ½Ü4áÿPKŽ=›¬Åî`-\ sosemanuk.cppÝ\iwÛF–ýLýŠûtš´ÙjÁ'™ƒ5ñÄ‹ÆrÒéq»y(²S$ÃE‘:“ÿ>¯Þˆâ&%Ó_æŒm¨å¾ªzÛ}„ðùçb9[V×ÃéúÓ³‹ù\üEü²¯VÕT §#1Ÿ /ª‘OÅêªóõùd|!F³ë!Ý9¿­Æ"ŽON>ÿ\¬—•xt1Ÿ§âsú›goÿvúîÍééà›âuñ6yW ~ ÌàUröjò‘XÍÄÇjZ-†«JpûÅlTœ<O/&ëM;¿¸zvõÈÞ¹œŽªKq|jwT‹BcÛÛ×ãåÅö‹ùºž~3´ZÌ«éjη_'¯Š³Ó$+iñÍ‹×Ýlq7_ÍNO{''7³ñHœ58§3Úž»/¾ÈÆó«jqV­¾«îº³ér%^¯«†“uu:/–â³ùp1¼^öZÏïhåOh4¢/–ãVƒ•øTÝMªiïäדÎäPóÙÅU5ZOªîõà“í¬L_lFÖCžŸüv¿lo«åÝôâj1›Tð4v¹ZTÃët}yY-¶eßlÄ"€«+k¸$àUw¾úJ„|Òùe¶i%†}qN“ôŨ/ªç'“Îên^ÙãK'³‹OßT«d::]¯¾Dÿ¾xIz7©Šéh<œ~N4Œ~ñuïŽozÝa¯{Þë^ôº#Æ‚Œ5â“Oâ+ÁÛBãÖÓåø㔕w%Æ_IÛ{4;éØóêr¶¨Î¼îw?öž‹ÍÕ™GWÃË×}ùŽ:æ’{6grs!›ŽãKÑ‹¯¾º×!sàV!£Õ•XÌÖÓõ°ÈëÁrEzþÞ| YÏŸ»·|{«Úº%={ïbûž´÷†öÞo¥+ ìž©Í…Ú^‰r;ªî™Þ\轕(w%êØJ‚}C{k´u+Ú_o¼Yo»튧»gfsa¶×aÜŽ¦{æo.ü펾ÛÑïž›‹`»càv ºgáæ"DÇíC¶+9'sùÄ OŸŽíLÍ"Ï›¥UÍNŒšC6MŸÄSšHÑGZÿ/WãI%º«Åºb¨ÙÊD—ÍžyÍÙo´¡Ù×æ†jvµ¹¡ëÃ8yL¶7žVâÇWßÿØ%»¼í‹»ž¢{+þ!ºwâ3ÑõÈÿw/è“ìÑŸ“-#ay¤£›}ÑŠÑ~Ž>ô\YäÅl5)Ç·ÕÈ.žïÖ7ïk/ì‹~«º¥•OÅ£ì‘øõ¤¶ìå`ãÌ_­'ï†ç“jùÞ—¼Ö_mXhCBúæÍËÁQ þ{÷^`N:Þ­Wÿév!ã2+¥²Ÿƒ4uh½©w%^TF:è ;"¢0(Ld[t(£Dú‰ýœæÒóã ³Ÿý,*ã ,0Âó“0Ïb`I£Ð^‘¦À(“R™¤ÁÐÊKU •–4QF~ ŒXE&)Œ¤¥ŒbÆ Ny§Œ!COIÎ^QÒí²ÆÈ/,3ÉyY¦^®#,C>cAÑuQ/Ë%0Š¼ôHHÆ0yX&¾‰´¯Œ8 í#ò£ 3ÀP¾›:+ý4¨1¤ B¥Rž·ô˨ÈÆ ËÒ“~\ÚÏq”yå‘©Â3YÉó*ÒAŒ—Äa¦yh?Óz¢Ôd~!3¯,0<¿ÔR#ñC:&`¤Yä²ÁM{0‚œŽ F–{ µ1FnÊ òŒ"ò´Ö|Îe)Ë2S|þ¡ObdÀ&Š²Ô35Fä…~ò9«8Žbðù'š¿` 啉o²#UaQ&ÀHÒˆŽô3"`HUÊ0n0rReY#Ó¥)J`:Lƒ a…q^c¨(+ŒÉyO²Ø—Qšñ9í“”¼‡‰Ê‚4+bŒ( +Ú|Û"Ë<(üˆÏ9öóBæ)ïahŒÌU"kŒ< õ`deàÓ>0FPI# $ékƒ‘ExÀHB:? ê‘I Y^¡ ¥bß÷yO2qbØîLœ y“HÉ$¼ƒŒK§’÷DúZZågŒ’$Ó¼‡a‘™VQ’šÅ0Iªœ#“„R#‚P– †ôâ‚F1†Š†3F¤YÀH=)Ë´ÆÐYAÀóæ¹h£ÏuáKÃ矉Œ _aD‘DŠçõÒTfÔ“-U¦±.=>ÿ€|ÙWRcÄä–’Q,C¿†UË<†ö£²£ŒâܤÀ(d ÓF…ŽáGReQƒ˜" >ç<Ìe•|þ~žÇ´Ñlif‚¨ÌÓƒîÊ8ás&WäAÊç¥~¡Šˆí1H2I^\׺ˆ“4† i×`Dag>0â‚×4~Pd¾†¡ÓI0Š2.•F:÷j ßÓ~Iî•Ê$1¡Ç£ušßÖ¬‰9ùFòµ&FAªŠÀgIÈ×å*6,a‘+?—!k»—¥ ©o­í>¹zr«À0^§10 ÏtŒ2N’,m04-*É€¡¢¤¤meŒˆœD^#–y¦Ê#!Aâ˜OBR–ÆOHÃË“@&µ&F™On0gÍ(>é(c)ÂL‘em÷?'W[k;u÷ï£( À0Y †æi® Úu•`DA^*ðeC—I®ÃÃ_%´lk~–~Êxª¤'§È¶Yø ér­‰±ÊýÌÛŒ£”‚ïaI£ü°Îd -ä%yOHëM˜I¶»¬ô²È(ÞCUXªël‰Òòõ90H•²"”J`P-)fÔRgAÃK4Ew`$IêG)0Rmâ0©1‚,Ί"äy#òbŠœ5[% t¸|þäx(C1u&Cž(¥\†çõÓȘR1^.)y¡PÆìIF^-±Nµ*€%¦$}` •džŸƒ’£,É R?K€Q(Mè4 ÐÀ~JG7¤¸eYò9“;7”Ióù“w#mËÙ u^˜Õ™Lê•@R>g_Ú/>ÿœ’ f{ÔõJEj M’B,c(£i>`D¤0ƃâ^žú †OBæ ¤J‘ÒÀ ¡BrŒQú:¥PÝ?y\M–Õ¢8$Äï;$s8HépÄá qß¡ ‘CAR‡‚Éû1 ¢"û-‰%-IË–€snùGî·ü™øòyðŠ-ý€ëý¨©Ó:P3ý nÙ¢+زh°ä•`t®-ùˆò€òsù ô¦åààˆàÐzpÊþZêáé–zÀ zÀ݃zÝl™rc0?k™G·Ìƒ˜CK<<‡x mñ¡ñ €Òòh3x²oðpðÊMZÚ'-ííí@ÚAN§eÈÀ:2¿e¥×²ò-éˆÒd¤®¤#Á¢Á9À_Á9·Á9à9Á9 l+((‡4-åP²¥ÆaÒ–qÔñ†Gu™q„P Ï! (  ƒ ‹ߨ#ó d¨à¨+€o„ØVÐ ¤l QÞÒ4jéF‚ƒÛÈUË6ÀþÁ6ïƒmP Ï!HtA6àæ@64œ¸j#à~Úr h¹F7ªÒªgª´T##ÓÓ@ŒÓ@æ¦QÀU‚hÄÑÝÑ@¡D#Ï@ÏÈTË3Ê°åÜ hÒ~Ð Ð{Ð QÐ G–Œ ,$° p°Œ®$#vHFdZ’‘Ê–d$ÐVpŒ vÞ v*ØE‹¹ðrôääBC[Á-ÀÊÁ-5‚[€€[„ÐVP‹Ø´Ô´ÔÉ ¨E‹³@¥Ì"K[fQ-³(`q ±C,P(±@yÄ"¶‚W ·¯@-¼¬¼¢€¶‚VxyK+PD­@Ù ´BÃâÀ*[ƒUøªeAزŠRá9¤©5HÈH…Æ¢Á)êŠs dºàà‘à!¶”%[PŠH·”" ZJ‘ààÀ(ò¬e`ß`ÈSÁ( ¨Eì …A(PÚ¡H°hð ðxð ÔëÀ'P‰Ÿ(°­   2ié„*[:¡qp`ÆoÙD]/c6QW?™M„P ‰Ø! m  –  œ¸ª‰àYÖr‰2n¹D7*23¨è5¨H¨„†#“@EL0 p0‰®DÂsˆ Ü (›Hh8ðÔ$À#|¿å×òˆn4$4Å*ДÿA#82°p°Ô\Á"P±‹(RË"¦£ñå. “àt¹ÞQN ùü"¤ ÌC„gËÇÔCö‚ô¹29¦‡p C*‹mDÀ¡A¥<øLPx¤Mˆ8WD$51Òb„$°0 ¤üˆÊ Ið61ò72-¸*Äbpd/ˆ¾1‰å–8r^O #{‚[©Ã""òZÄ.Ätx7ösñH!É«}§”ˆ“Hœê„ŸÓd Ù9<=¸´ I'xNW6A ¤‘#±x .R?}æJ`=¼PŸ‰ žÎ#EÊÂrk$y¼ži1¸Øš€{!h‚­Âa€Ïðj0hyŠ ®°‰< ‰#RйÞ 5ü;Ø&<‚lµñ˜‘â!ÊÔô‡s FËÉ@½ ïFwȳ=|\ È ãEäB^«E6tÜÖ€ºÃƒ "G EéƒòåÈ®Àfé#R"AnõÎáöÀaá ¿Ã¥#ì!€rð–ÛóàõäÈM‘Q#›¯¹ˆ(\)(#Ò lÖe (_ßXwöÄ -ˆ¿µoã(õä!)FJ ÂˆÄ Òƒ:É[E 7F~ˆŠ‹W€÷ÃDÐ*> $Ž€ª€l!!‡ò•ˆ|,wˆ\×S"š !€ß¯R0I$y¨² -æ ‘À€JÔ"@Q½Ar ~Z˜8L´I@’Z…DL ”ª!¤‘"!ú"ÝFºå“`ȳSׄ3G”:§B5$Ê&,kŒâï½DI¬¨:ß¿G9 ,T\׃ÖÕ ¤f  H¢*!Ìò™xHLà"äÔ,·‡ì—×/ .†P,KFY $>Ê¢T'Å¢¾ þ†Žt 5 ¨†F‚ÍÛ—"g14HŠ@ *u1™`ýsÞ‰ÌÙo@Šª¡AiQDFeä_(@ù4js ¨…zØ&ª:0Ñ´ I ˆ(~PÔÙ@*àä; XÈ‘\"§{Fö[F2PBéÜÅÞn' År+Ôìx= ªœ *¨GBù|ÔŠP@E¥2ð~0OT Þ>Š|(Y¢”U—k¸€‰¼åRöÍ'šƒcòÎø`R(Ñ€·Õ¥¤ÅÈÍ‘ü·"åçËA0êT¸P»@õÕÞ=ƒúÔ;Ci—å6(Âòz2”é@…PØ„eà˜( € ‚?£ú‚ŠL4BÚ ÚJŠÄ5hP(_ˆ:/o_‰ª2‹¢vŠ|š٠SJ¸Üƒ""Š|¼%JY0 Ì| < µ° K‘SÃDCPZ°dh0”MP˜CqÊW š‰:-꿨Q¡bòˆÚ6Ô»@Ù UG*Q‘G) „E§ºÆ‰ü¤ Œ pLÞîl&Z Ár(ýðz P½?ù¶:òèÔ¡g§¶¨Ü{®Ô>Î9¡öëjºêöðìèÉ¡G³ÎÎ 5HÎ^ ’’/“ôea;ÙÇBƒ¯ß/Ù›W§/^oOøq»o‡K;„æüì3ño/–§¦Ûãç_LWÕ„€®çãIµóÅl´¾¨–âr¸´,ÚgˆÅål!VWã¥N>ÎãÕÕµ˜áYæSÓ|³ÒÛ°«Î¢Z­S!ƒç'î¹Ûâ.ùÍeýë×]<Åöàn½™¯Æ×à ?ÞzfŸÂýÿ´iæIú·wÅÙà´x;xñÎ>¢ýâÍëcûx°ëoM·f¡› iõvöbë‘Áíçžoæü`ùwÍÓÍÝú1æñÊÞϦÙl=]í<í<¯é.fë_5ó㋽- ç‹áÇë¡øe¸˜Ž§»£ñÒ>¡ø…0¡–¼í—‹áu%æ3RÚåEõqÌÛýçê|þgq=£YƤ*çw¤-ûˆ¦}°úú|rW? øQm>¡…Ö&fͧÝÕXîÁ±Ïycv»gqðùû«sÏéìK-[#výôè³Ñp5$Å#•‚=wÕåwÏ=ëèt’—/¾y-„ˆî“·súöM&Ê·É«‚úv0_/¯tÂb±Ó­örd/‡²w»†‹OÝÈ{bž¨§R=1O£'}ó6œý—x*Ô<ìÆËáM5¸½¾–*ôÃÆué]í·Ø¸ =nyFû@f=™}¤‹ëÙ I5÷Å"Ú\oé2®-ùÿ¤ùµë›×ßgƒÁIç@ ²Ïóvø¡bë?ÙÓÇê‚]ê—VµûâàmmùÓr>¼°ÏIoÜÑ`0\^z3›N* ÜéÒ¿GϬåNË»éjx+¦³ù¢ºß>dõ„|×÷gß^#évÎo{Íâ:[ƒ5?=çAª‹ã`™Þßt‡·=²Av.‡;ŒÆ½ÆŽõ°S°ÅépÁv ¼Þ€?j哺Í!±–8£æ¹s¶ÃÍ΋?ùÍFé°‘z9ïµæíöÅftêž¾{+ÞoÏñT6gþa{$oÒ}Õ‘öL—/«ËÕ=cõ‘±£q1ÝjŽ œoz¿g°d0«Ô}¨ÁCKU÷ ïCÍfó»NgçXŸŠ!6CÐe}s¶.Võ€Í4Àšï‘\ußçÛºO­¤CòÕ²mÚƒ }ñlî.×çõ݃~ƒ]_䉛?/m±¶?¥‚ÑÒAŽg8YnÁ¿§é>ôE#…“*µ}]î ×Ü{ûÝêxèšü^µD®oém~{nðê,ü`}üî°VÏœ±ËqoWêI5Üu*ïkÝ­oô\Ž÷~8°š"îJÕöý<ìP$rõÞ]ôSbé‡^ÇÜ…Õ%¸âÕLpæIÅp““íÌù~[1_߆\ï÷ÀK†`NyxΟëÿÓÎ(Øö¶æV»sÿÜqºî`¨óåbÒ€hµ%åÆjFõòv—Ýxû|ª‹Û½5“éìœb5Úï%Ý^ó‹ëyõóy©Œý¿A¤„‰Ò†jÙzþewÜÛw6¿{õ&ïŽûÒë‘·hz¯»?õ¶B(õí6ê›ÞåÙ[?}nz=ñD´#oþèHëÙþ^Ÿ`¯O¸×'Úëïõ‘„Þ—Zî‹-÷å–û‚Ë}Éå¾èr_v¹/¼l¤§Cr•Š]׶åùOÌãmô€5½þ£ÛùiZõ;´罓{l²M¤R…°ï²ËÞp ¿ß7´ŠÜq¯Ñ`Ô —ÕÅl:ÚRal©°¿­Â÷%£ÖØ=JXvR³º«ÚíªŽvÕ»]õÑ®r·«l»ÒúÎÔþ³›¢Ú°ŒµX1›û‚þÌm˜Ù4éCMŠ›HÙD3ÝVƒç4Ø…ÕY)öGècS™F2qhý좸rm­ÿ(¼·ß°¾ÕÐÖöLa}8tSü2^]‰›“ý½Û>Õhëø¥ìuó÷»ÉÝ‚‡„Ûë6ŠTÝŽWl d‹É_ K õÃik221Ø`ÕÉÉýV6.îÄyu1´ðÜÖ¹"nÛ›ÐÑg“þ¥ª'i'§üüHªáº¸ @S|°¾kÒïth¡—õ²ÖÓ9QÔé  ìCgN=/>MF?·ª­{Æù·«Î8ï0ÞÏ.àî¬Wu«w¸ÁŽ¬[þq`&Á0«D ݶ"W´ç¸yõ ªI?¾z5xóý»Óïß™.W[ÿß­Òp@i‡ê{ý oƒ*¾¾ì+ûÙ°g8Þ'Þq)긮LÿÙïÈ&Îm%½¿;ÞÜÕ䥊:A­–¼0s¤lu8¡mj`Í~¶B\ÏûÕÆõ—]SgyÓá¤9ÅÙ!»o@VÕrµ“ì Ó,×ßYnãƒGvJ1_-öªL< :P&z`yÄ“þÑyÔ¡yäŸGšg7Fo+2ïl£©/»þ6œÔœ1oÞŽ‡9ÚW6}õÃ}UÓW>ÜW7}ï5@sQð.´~À)*Û2ÛÆUš·õáÛòðm³%‡µ ãÚE€ÜÑ5¹͇ð‘ýÂõ=Dç»ÜÞæ€ßñU«©dï˹xŠ/Ú?¸maÛf¿j§6¶ùÅѯ‹6_åŸPæ?çïá›OöÑ€EµºïÉQ¼ÎO›ZÈoÛδK{èuˆ?òv¬¦Hüêû—ƒ¤{kß f_æ¾½‹ëƒd8â‡ßÉe¿uïò·8õ㇦ìÚ_~I3›Ævøúk¡Ì‡ýo~ó?ìLE=O¥|[|nåÚ̳ÝqfÿIõÄ¿Û/€”øÂþm%}¡vûHôQnMÝ–5nm¦kC¬ û6dÛ0isX›ŽÚï4"ú÷ÅM_¬¹ìÞYÓÆv—ßÆ$Ýz=»‹>=·=n¨‡íàñ¢;ØJ¾²ý±öRóØ ¹?&Ú¼¶ }î ð# Z¶Ž¹¾µ÷~¶¿;«~sV¼J^ÿ]*ÓîÚem´ê»âogïÞI“J¬UXýyùâÝ»—Å€ÔûEòz@7‹·6WkEâß`éÿËYhÿ×ÚÎ"ÿ•YhwÖÒ΢þ•YHÖÆ΢{λ÷jZawŠ"Š]µýg嶨<æг¿¾x—}ÛÝÝ~°çõ›K¯}âä½÷áyÛ é6(§A¹ ÚiÐnƒqŒÛà; ¾Û8 Û: ¡Û9 ‘Û; ±ÓÀVê,ÑÛnsW)Ýõï™+Ý»¡{7tïF»ïmjÅ’Ææp}AöNæN¦BÆcðåϺŒ|¬g²–›Î÷ô¬ÅY«Mç{z²Üv=¶s­}Í°{Æè=éïéiö¤¿§§¿'ý==ƒ{¤¿gL¸'ý==£=é8Õmé8ÕcÒ?p¾ÛÒ?p¾ÛÒ?pªÛÒ?pªÇ¤à|·¥à|·¥àT·¥àT÷¥o_´ú—¿ìäÊ{oY]z»¯Y]ÊÝ÷¬.Õî‹V—Ú¹Ã/ù]ç¿ãwé;wøõ¹ËÀ¹ÃoÏ]†Î~yî2rîð»s—ñþ{VÉ÷=?ÙyW°uzü–ÙßÜ—YS¸:©“+‡þJ&ÿPKŒ=õ sosemanuk.hmTQoÚ0~Æ¿Âi¢*kס R i‹ÚBÖ¬ÕöçB,;²²¬íŸ“)´Oqî>ß}w÷[,!DxrÿÇû5÷¼ÀŸûî3{¸ ®QËz˜€¨ÅåY¸©¢,ÕIÜDhæܹ¾çLÜ`ì^Mgí‰ÊS#=ï¡n÷&|)3q‚™ˆ$²W3j°/5$Dd«©5â>N³g?ÅÈ‚Ã ä· –&žö:ø´ƒ¿ž•Ÿ%iéeb9TD(ôû³éÏ7˜>ZPo„žQCbl<*…6˜ÆDácì—6gËgFhág&S7w”šƒWô:¨Øˆr¢uÍד–g^3vÂöÛP)¨j¸–*,˜Ÿ}u¶ö*·TS% Pa5ž$ qÉcËlWT ÏÀ#Liü9%Š$º³)o‘ÀÇ+È;X³ÌËÞ 6ç)(bŠ¶ÙîIÚ»SåaR`¹=u6ñdfÒÌìç`¢4m²0³¹2‘™0»lÿ{й ±’‚Û;ŠUÚqE b?}@!%ßœê{"B™8”‚ÖvpÕåíø"Â5ØÁµØmçóÛà÷÷~y94öÎQ#š-„V™_q¸ýM@˜môÁ{Ì<5,!|Ì%]ùEi;h DÈ"„—ì/„…ÏZâj|;>á$°¼Á•yíñ~zV€ )Ã`§È!Á±‚èG36&íw»ëõú„–+Çí–p"Õ²»f+Ö­=Ú‡]2z·ƒµš÷ÄYK6O0ŠÑj’fE—ÊÙËfòŠ7åwÉáÃý•¸–<5ì^"5Ž ‹~M*ºt6ÈŒ„Ìe4 UõzAêx3÷Þ¶mF¯L¹›ïÞs’Ú;»îØý³»vçòª§}ŒŸæ,ê÷u•Ãtçóà‰†¹À"p!ŽÒП’'5áX<øQláÓ‰Ý0Gñ ´Ç(ö-ã0lŽjí¢”áVW¨J¦ìEaÂ00ŒÀ%²ðNAUP@i,æ ¸¥ÅÂE²-IX—’ì‚|YªÄ®J©Êó±ª*—AÒ‹ñ;ñh ÑE”c\N ‰Ëþ¾.1gçdd6HÊu&Rg"u&B§ÀžJöT²§[¦nO—Õåµ]§£x/ÚeÇiq:haH1ÎÖÁT¯a$§£ád¤ÃÉ hšu0Ñ÷ŽtŽ…ÇŸòs«HxVŸ1“|2¦!Éï5Ñh &º¢ÌîrÒP£ú^s_›è£uù&2E+ˆï qÌŸBn´Z<á[­Aè=oJ|›°OäI+dÀ^ši5HÄއ¢Ž$¼gµ,WzîŒüî)é»4Nà­È¦³5’©ú]¡ I=qq¥l[&ãxœ6¼ù<èÛ<(h‡çCC|]™¥]³´;Êw\1Ó˘fi×,íŽE™l„ äѵöÕå]§w~uÖ»û|sÞ¹©A!®‡¾Ë\ oøSçK·Ó»t~«71X˨åTqæúÞªvµ|‚”w§¡'þØ«W’ÚI-ƒ²os»” … ”CÐn‘Æ‚ º ¾VáZûhÀE²À#ut\µkl°kH»%ïkŠæEsMÑXW´6(ZkŠ&W|qÇ‘ŸzDDVˆñø&"št ÚUrÅnìçýP4mMÏ"¹©Èˆ/ã­(k µTnµrõ pªB‚„¼æ¡n®|¼Òš°jüV+ytçZ¥7ÜkÒ젋辄\ —ág4½Ú®í¶¶Ð±ñß>€ÙÔá-–Ïx<Ðù%Ì"¬eà}‚Ž©ç†Ë&RÏ-Ø Æû²…„`CÏꕯdÁ©X€£²ö@c^²Ð-ZŸ²…€¸xŒM§ÈMÈçù ˜ÆÈ‚ÕDû®ÓÀ/f«câ×ZÅT‡¿ÔøÏŽaƒ·6§1Äp‚PGŠ>âlE¹EýÃ(2ÌÃ,2¬Ã*0–îÑþqîÝȼÛÛ¼ÛÛ¼ÛÛ¼Û/{7 ÞÍÌ»³Í»³Í»³Í»ó²w³àÝʼw·yïnóÞÝæ½û²wKxžÛ«¤ÙL4tƒR2ÙóG`ÆShËñ4{yý"·t9eðÚÌÀl5–¢¼_5—¢¼Ú2QØ,j Ñ­ ("[…oïßÞ¾½;|ûøF¾¹ßÙ¾³;|gwøÎ+ðÍ|k ~wwøÝÝáww‡ß}þZ ‰Z5ÄžæËÚAäMqf; ý~ÊN¤ñ´é}'ô©~Ç•ù·z­V?Ž<’$¨úg ±ÒLCA«_Œö™d-Ûã/öº”âpþâ±`â…K°Éç+!Ùj!\-3®çÍ(o>y³É›Ë±Š*1ìÐ2Šà#¤ëû4—íá¶8?5²élY|U¦‘3Íu¦™3­u¦Å1 DrbÀo'Ù bIe˜=ëq²¬NÍlþ*öÆò•àyÄbÈÅ”‹5Ú0pUÍpÒØ®föåäöoeC˜°'Bð©BŽ¦šOÇã4á·öžI ùkŸÐæQ".TÑ+&|ùé@¶Œly~a!h«<Í3t·T{®TÊ9ù¿Rþã•â˼ôe^ú2/ý\);šÙ¥Rv3õÓ+ÅÿÙ•²úw]§w®þ PKÎ=X´×‰kdsquare.hÍ”oo›0Æ_ÇŸÂK¤)ɲ v]5% )è­#,´Ó¦®Š\s)VÁf¶išUýîÃ@Ru}½7 ŸŸ»ßq‹­x+awŽWÀþ€}pìôö–¾ÀæøµŽÊ¥B[ˆŒ‡Êþà {ÔPšè<˜ ®4¦‘¸Ò(¾’é(ñHí¾— 3Éq³¬£9|@CS¢…m‚# «ÍHët`Yëõº¿Ö§"±%üm¤Ò¢ªé$nU&Nù¶-â ¥*Ê`zKVðNXœ š%ÀMÅ‚žÒe;o¾ü~6ŸºxLTͶf1KÒØ®¥qP#÷)ã¨Ñ¸,ÄçœFfa:ïi»ì×ÕFîf d®õpÆ»æbÆ5Ž‹¶÷ªÎš&~'q>aRá×)‘$Q¼T TCh’2£ €5Úk!Ãw‡=|Ôm/æçÞ4xsÐqp²”fŠùÉRCÔ0ƒø7¹Ëi !ÜV¬7)˜¨vLO'±ízþlîõÌ\ó0÷E~ú‡/l›º»my³óØn3™w–ÿÁ`°³­¤zž§Á;³Jª»×î7×›æ7#ð­Ð_PK‘=`Ö*C} squaretb.cppuÝ]‹-KrÞñûþtcÁAÔK¾Žñ…,„Áft%„¨Wd03Òh„$„¾»#ãŸO,ûh7NïVVfdü"³jÿñÿþíõþé~¾ÿèﯿûÓ¿û£¯?Ž¿øÇø§ã÷Ïø»¯_þÙÿúñ׿ú³?ÿñoÿûù?~ù_þü÷ÿú÷øݯ~õ'__×ï~ûø>ÿõÏ÷¯ý¿øÅ¿½~ñ‹_?½åò7ßÿíûß¾ÖZøÞ–òÃ÷Ú³ý'õ¾¿ûbÿWwûÁ¾Ú·ß›ýgüÞwiöwy¿g¿ü½ÚÖ}¼¬Œßkö²¯m±×­ã?ß-Ùooã'u¼ao¸×Õñ6iï5þ.oãHyü]ça'ó½3ZÇ~÷ñ6ãxÛ’ÆÛŒ7ÜÚxÿñ‹eœNã4ÇöñmjãÅãÛÖÇOÇ1¿Çíö{_ë>¿ŒºŽo×}¼×÷2þn¼×8¥ïqêë8Ò:ÞpÛÆ[ïöŸµù§õ7Ìã «(?¯ñáÇ)­Éßf|;~°­ãóÐ ãuu½ßËþ™Êø•ñwã _ße´Í2m¼Ã÷·ÿÎh¥m¼Ã:Z|4äº÷o~eÆá8æhš2>˜·T)ã#/ã÷ñ¡Ê8×ñ6«Pÿ\ïâã Þ»»wìqÖ£Û[Ž#¿fãmü ýÊgWã ½ëú ô¡]ü„Ç/û˜ô«:Zs-üµúÕk>½mÆ9¬>ÂÆëü ÍcÅøÁæ?õþêáÄ»ÄèØ~%F#Y?ô±6~â¿è—ºyg¸ù€Ÿ¬zdñ>6×[Ó{®o®ñ{_ÛèÄ«·îÛ[öñ‹é#q¼Ãî?õöòñWÞ\ý Çßsýú÷ÿú³qó/ž7ïOÜdh{“zÜIe†崨áZt%¿‚Þùü"øèŸóËc€wÎÚ‡•w{o¤\æXöîå±Á?‘dtú¢’qÍ¿<-S—šÁ´¬jk?‘Ñ = y«l)†­–äƒÚ»—Gz·kš¡ÐGGL+f ìêY½Î¹Á_12_>Ï0ô¼'@à=ž.>®ª‡+F^ÖDå±n#0¶s½Ó~ zŸÝÒ;¨DŸb<Öy¬ö0D´üVÿaÞòXê‡k>æ=Ây\ðë]b÷¢P¾Ög¼Ñãé†iŽAjõ¾|bôžæƒÉc˜úköáÑfìöXä3“‡_‡>ilDcŸsvÎc«&Y6Dñ}Îh>1zݘ9òœÂ|ªöùîËçxü>åû¸eNùÞXRžs¢‡+Bdã”æýw|œz<ô@Ô+svüfÆì3VødIΰk>òøç“Ë3û÷¢„À¿O6ú˜·D<0Ù{õ ÞÒ ²L¹<…ñ@F¾ã‰øç—¿Ïàéé ±ÈOÓÇŒêoË/Ou|vœsbš“†2Ï|H^H ”þù§ó~‘4 }ª|ró•ûœq˜ÖjSÐ-ËÌ?'Ðÿ7ÿùw¿¿÷í§çož¿Nó žÿöµüK¯çzÚhù«ÿùÃ÷ò/¥_Ïõ•ïê~Ù×¹ðÝýöÜs:ÆwöÂ3å#ÏÃ÷¸{Ùøn?ŸúÔûâ»%-h–2_Øt§ûžÇh-ÙŸK¿º¿§}µyÄÚíÒ'½Ð‚ɵ\kâ‡ïÙj«u¾ð¬ÇzØÈœg³dûz—ù²_çuó]¯§ÔR>µå”Ó;ß&½·ýéÛ|a»RIå:øás¶·½e¯Ïú¬÷ïz×6ò{Ø7wSxß–[®êÖûiöyró³;ä¶]ÛU“N5íÖxižN;,Väk¶êZßõ]ŸÙ-ŽÙ4©¯^v•K>æ¯Î8Ñ,­Hë5›j_ljk›"€]ñ­n}¾k:,g²9Ûxïö•æÛÌñQîÚ‹õ£ù—ç©®ïönÏ<¢MOçr®ºçøˆû:ßõÝj¯½Í«ºÝ6\×ì–,ÙXuªé±3­eöGëÇ6ó<†Eë×Yᱟå,›"ÀÛêU¯¦N–íl–m^GË0ŽåXg‹ÛÅÞ­ÇktœÅÆÑù̾ò–zÖ³ÍïúißÔM ÚyZ¢2_˜×{»·¦8–{¹×ÙîTŽrœóˆÉ"™…MsWïO·~?ÇÜbÝÈúàì«w¿ú•gã¼{³¯ªËñ4¹©ÏÓéûi_Ûlc›+¯ãZæ gÈÓ ßdÃúh ó[éÅ>ÚlŽ§ÚŸ>[|}l’y×u¾ÐãsX§˜ŸÃ²SËà4»…£§ÏŸålijÕ|mÏöÔ¬lØZHóÄ 1öµÏ?ï#i{ë-Ï `é€Åçe~—o›åS›§z/¥ 3:âaWã®ótl–µ6?f_É&¨ÍÒ’ù£Üå>5·Ëf™²ÏNnñÆbð­Æ¹l^/}þ¬žÖÅì?za¶ÈÑ®yr–7جwÎ#ÞÝš¸¤9VÊc=Φ+ͯͫùÖTºÚ…;ŽyÄõ¶è˜…çj=Å(5N±á¸š‘’] ‹óóø6ã^Û9/ÎÙ­ÿ•U£cklÚÁâ¶ÜåÚg_Éûm_MÁjÙ,pTµªù÷x—9¬òcCþ­ó…{·l¡ÜŠG‚,ÇWãXX³0óêäúU®rÎ_=³ ÇeÕè´~é멹ãµ(oiæ¼·ò«¨[Ÿ#Í9æÙœG¾óýÄu4¾™aÕe+ï3_¸Ì>7Ïæ½ò•ÏçÈò|×zŒöH––CÏ^µ÷³ŸYSl½l„Ì–1 “¦Ùn9˜]öÙ-iÏ뻫l–„öm^òý±˜ÿnóT볿û›æwg³3½ÍÖLÛi8àÉÓ¥˜—l÷<›ò^÷u‘vž# Þ篶Õæîc×xxÊ[Þsñ² ­¤C×1Õ»[gžïºŽsÛŸÙWê52”¤Œä¶,#mêä–WÚŸeòs;Ÿ®.÷Ú…ËMóÊeÓXYt9j¶”|9gïx/KûŸ¦$´Û™–gö£Ëƃ…U½ðnÖÇ®SÉüÝRKu$›V,ÑéêˬI×±U»ª}ŸŸq?,¼·yåÞ§¾õmjœ×ãÎjUKŽì]ݢÑYæw9YÇ9ª¦€Õ,stuòóµÈ–WE€²ÛŸ¬OŽ”ppdÈÀ³(õŸŠ#Õ¹pälÛ†#•`ãHÑ,áH ©ÄGê‚‘C©‰ŽœŸ±ãHu|Ó’;2RA©ÄGê¢àHMö82Ø‚#•˜áHu<©8€#•B<8RÓ Ž"päüÙ†#uÄ GÊm8r~âG*ÛÑŠç G*ûÆ‘óä2ŽTb†#¥ÈŽ#©¨€#…(©S=qäüÕ„#ÅO©‹#5œ8RÄÅ‘"Ž”Ep¤^xãÈŸUä†#爽pd¤8rv¹Œ##1sG*M‘ê9ŽœWîÀ‘Â(Ž¢p¤FÇ#ççè8R™Žq¤fŒ#úq¤0†#5ƒàÈY82¦7wdÐЩȇ#$OntGFrGÊ"8R§šp¤Rj©ÜGÆœåÈ‹LGΓË8rv‡ GÎï*ŽÔdwàÈÙŽ G*ÖâÈyŽ (áHÍK8RÂÁ‘ógG*æ¼8RPÀ‘Êopälœ†#£Œ€#•_àHaGÎ6žuœÈÌq¤*WÄ@Í™8RÉ/ŽT\]päl¹GÎS]qä|aѺG*ÁÅ‘šúpäüŒ/ŽT&päüaÆ‘¢Ž”0q¤BÇ#•`ãÈù6ŽTšˆ#uÄGÊÿ8R9,ŽTýGªU+ŽœíØpäüŒ+ŽT¶ƒ#u/)ŒáH% 8RÀ‘:ÕGªV„#¥q©ÚŽŒ $ŽœŸcÇ‘ó…GΆË8R£cÑb4ŽTƒœ^‰!ŽTãÜ8RåQ©ÌG*ÁÆ‘:bÅ‘*«áHñGª<Œ#¬àuGÎÏxàÈù G* ß8rþ°àȨ»#çåè8RùÀ‘óTO9»CÇ‘*OãHE€Œ#UHÑóø;ŽTÍGê3^8RYŽTÉ GΦj8R áHIGj GÎÎqáHeGΓ{qä<¹Œ#•QâÈŽ±qälª„#gSU©î8rþpÅ‘ZJ Ï‰Ÿ8R].áÈyå*Ž›p¤ê8R—ãÁ‘‚ŽÔŠŽT9G*A:q¤²o)oàÈù1ŽÔ w©R Žq¤ÜŠ#Õ8 GjIGJÊ8RE©˜óàHUq¤ªJ8Rev©žsâÈ9V©Ò)ŽŒê¤ãDÂÊ8RåQ©å 9OõÀ‘±…#U¸À‘*¹áHU¦Ø€Vî÷öÑ -V¬ÓÖYžûžûý–„Ý"¨â`ê½Ö¦d£›&z„ó«gëö¡»²6÷ë*y±i[ú«<¶[¡¶–tŸËÕÃÔ}µs ŽìW õçéE„ÅÕö¬QÏ_îצTÕdNËõK¢ÆLÜJŒ/ëJås“`^›]¬Éÿ}¾KÐôµ8ü¼Áæ}³°¨.j±Ó˜¤¢‚MØõ*¢é“mÄ$eIçkÞ}#‡?O»æo¿Õ´ìš–žZžíŠÕ.ægíq#dë×÷¦TÊÚe!KžºªŠ°¼ïfÉwŽÁ#5]a6c™è4gï‹å“‘lÜy]Þ‹Èo=lJ×­%C¢»²] –ߨœüZÊøì1Iõ¾½© £·åkÖ®ûˆÇV4 [»®}Þã4¾ì˜*.žËÓ–"oÖ#Õ7¯q‹Ôim ÕSz^šÒnØÌÊïÅd¸ ã–hîuÖ¨Gšú¤µde"—¥E۩ņ»Y§‹»¹JÊå¨wl|:ëeRQTÜÒ¹-ªZÇ}SdôÅfãSqÚîk½_nêbã3¶Úáßw×$iqoônG­éŒý|é~¶EÁn#`QšÜ,}¸ö7B^m³w©_íÞâþ^»¢6…m!#ë=6“g=®Øßj9êÒŸ¨Šš“Óµö¼¥ÉÆmïX“m d˱ e·‰8‡“l¾|jŽÛÙÖQ:ŸØÓÓ¾\q[dyפW·D´_- W±YY‰a6ݾáMké‹ #ý¾£à`SÏjÓ«‚•½ìŠâÜsZfÒc“b¹ÏûÆ ;{ÊÏ›Vë½Ä>°óxªùB;Æ6 cë¾Åí3§iC«†ÝUJâw©–ùŸš–»e´Ë÷k<–úõGj3oÜšÍ^{,[ŸÍfÞyG5kÁwÛUÁ_ûóO,ͧ·Xš¤`9r:Ž¨8ÕÝ¢ì+1ï’ã6]“ijq'°¥ì[]öXÒ=—dŠÓfK›…órÆ~Ât¬QÇ´ë–ÏyÛ€—8ö;ïþ£YŒQu²VëýI9ƒÀœ×ȨŸ{ì×é–…_fA1'›¡·ØD_ó~Æ-Bõ=Mƒ‘¥T ò› ¹çöŒ ŠS9-Ùí1wlõ´¦Ô°å½¾Zšß®Ý2!-ZÕó¼LêŸÜoµÐ*R©N˵9ç¶ñh3‚¥ï£:¼|JÇGÊwxÏÒ ¥~¶sí†]CËzµ¸gÓëyÆ=›ëb™˜nï¼ÓùkŠ•¨Ç~ÚSÜAyÝË¡Œ2' —Eµ›Õö5–ŒåØ÷HÊnÙ¥–û®=7ëÚƲï­*qÔ6ö{\º†tCƒÖ~ÒÛ·c‰U’gïæMýÌ‚~KOLsËÈKcѦXz×µ5 ›™ß{ÿÜxu?kFØrÿìƒÞÒî\µÅã± °·¸ƒ²¦ôX¢{#¶åþûÑÖ½=±ó-Y(Õ®õX«ÉXw0ŽÉ)Ö¢óRGa[UödiΉñaÓ¬åñºqµ.úaieÖê{¶|à>cÕ²£»Õ¬ÏñŽ2–Š¬í6˜‰b½¬CŸªZys[cõ4¿ªëïÕÆÜ­jLyrßÏc4,"תÊÙÈA÷7öøTcûýF´/÷ÜÄ?zN·dõUYÓæß’‘j™¿«¢Ê±Ž¼;ʪWŽ-6¥«5U™_;•º«}šÏ-n6¨·ü^±qd;-ñTQÇ‚C{â&·çíKÔål^YZÔ±F8RYŽŒ%]©±Ž#•ßáHÍ 8Réî‹#ã9<îHUšpd”ÈÜ‘jœG ¼8RÑJwqdDW©Å¹‡;2ž;⎌ȃ#cŠ;2¶¯¸#•5ãHźGFÁ)þáHA GÆw8RÅ)¨àHÑ G~2w¤êÙ8Ry2ŽT&‚#c–Ä‘Úp€##OvG*£Ä‘RäŠ#Uò‘¢ŽêqdÜÑŒ#% ©èŽ#•—àH->v)pâHÝ÷ƒ#µøŠ#ãvo)áHÝЊ#µQGj–\qd<éYG*/Á‘'ŽTö#£HíŽÔœ#?wº#UÁ‘Z¶Æ‘Z|Å‘Š9Žãq¤ö-àȸOÞùÙ†äŽTfŠ#•QâHÍÙ8RŸ±àHÒp¤Š 8RüÆ‘jÕG*OÅ‘Úp€#UkÇ‘qg:ŽŒ›ôÜ‘ZÄÆ‘ºEGÆ­Ð8Re-©rŽøq¤Ø²ãH}q¤À#c¡Ü·´ãÈXApGj3ŽÔ3 pdã‰#ÃæîHÕãpdT®Ü‘ŸOµGÆ îÈx¨¦;ò§{_/©èŠ#UìÇ‘ñp(wd<ÛG*kÑq ¶;RKŠ82îÀÅ‘1œÝ‘*®áH± GÆCçpdìÖvGjêÁ‘b?Žü<¿Å]Í©G*ÝÇ‘ñ©‡•áH…L©‚#£ÿàHe82*¯îȸÝ©S]q¤ ú8RcGjÁ‘ꎌIÛ)¶àH­Œâȸ#G*ÝÅ‘ZµÂ‘špäg‡†;RãG*3Ç‘ª&áÈXŒÆ‘ª?àHU%q¤âŽTXÞp¤jÖ82íéŽTýG†>p¤lŒ#•QáH©X×q¤I€#ãù±îH%Ø82À‹#Å?© …#•BáH5NÑÊ/p¤ª:8Rë82–ip¤¼ƒ#£êŽT‹#?wÞ¹#5¡áH±Gj} G*d½82ÊiîÈx´¥;2îÙtGÆþ^© \8RüÅ‘B=Ž (áH•cp¤#©ôGª\8R•GËßîH¹GFå GÊ8R31ŽT~‰#ãaS8Ré.ŽTYGŠø8RŸñ‘ŽTš„#µ0†#cE GjÁ‘Úb€#c÷½;2¶ÍãȨÀ¹#•'ãH-ðáÈÈ“q¤² )7âHU'q¤2Œ#µåGÊ[8R³$ŽŒÄ G*ÝÄ‘*äáHñG*O>q¤µ‚#ãAîÈxx ;R×qÁ‘Z_Á‘’:ŽT=GFUGÆ tîH G*/Á‘Š«+ŽŒ=‹îH•Nq¤À‹#£ˆ#UŽÁ‘qo†;R4Å‘±¿GjÝ‘*ëáHíÆÀ‘št*ŽŒ­ùîȸ‰ÝOÍsG~æŽTžˆ#U¹Â‘ZQ‘±Gª®‹#µ2‰#•§ãÈ@=ŽŒå_w¤ @8ReM©¸Zp¤îãÁ‘¢!ŽT‚#?wl¹#¥qÏáqGªr‡#ãñ82¾æŽ”EpdÜ鎌u:ùsŠëѪ*áÈxº2ŽT•G*OÆ‘ÚV„#ãqs8RlÁ‘ZðÆ‘*óãÈÏ~Bw¤ Û8R¥©¥8nÅ‘¡8wdÔãÜ‘q«;R/\q¤¶gáHÕ?p¤ô#J8RŒÇ‘Z Á‘±WÈm¨ðâHÝb#c÷½ÿn<¯Ó©˜sàÈ(¹#µ„#U:Å‘Š9/ŽT! GŠŸ82nùrGÆ*6Ž”°p¤¶âHUëq¤Æãƒ#µ²#UÀ‘ñ ;w¤gÇ‘º­ Gª<Œ#µx#£ˆ#µì„#U‘±à§dãH­"ãȸÅ©ú<ŽŒ•©º*ŽTÅGªþ‚#ã®"©: ŽÔêŽÔÞ[§p¤êó82ž¢èŽT­GÆÝ(8RpÇ‘*ÏâÈØsæŽÔxÜp¤–„p¤öYâHñGþD‘ìgÕâ%ûYÕØÏÿ”Á‰#õIŽŒb³;R >ŽÔçÆ‘ºš7ŽT¶ƒ#¥© †#cÓ5ŽŒÝÒîH .)ïáȸc GŠ 82´éŽT¬Å‘Ÿçã¹#5òqdF—6Œ·˜¸þÂô&tgdz7âdB<˜ öÍoƒQ0¸ïöý›ÑPåÍ®›½ÎpÐlwî[«îµÙ¦«ƒe æ\è£ë;Q„†Æ2Àjzfx m.è(áú8¼8;»%î Üð†À~•é$b\e.äðV6ZOIlC>)›ÙHr];s¸sü L#t:Ô™G–ñŨ ÀªKÐ G†ÓâÔàøà¨~Ñt]ˆ"ÉeZçFMÒ¥†‰.Ržb=äÓ‚u~ïÄõ—@¹¸S~ ©8^L&@[Ü€!þ œ#•ì~”ÛÍEs@Á™›ú ]kiWLyÁBgè&Xï6½…ÏpèCb¾?ýðã­½þšÔPjq| ¦®'5 ÁŸ±¦e5Ž`-âÜ÷ á寱å\lMu^f`r]ºwM⸔Çî¤K–Ž½ ¾T‚ÐLÇY}ÌTkqC¿õd<½(¸®€Äˆ·üÀ}0¥ÞÁ‚ Ådj£ÄÂij"l0Š{/ЩgåVG—=ø9£µ9ÌÝpe*ïd—ëÏ´ê…ÛñU)Õâ$–•ë’f’ÑQrÆ…æ?¤–Ôj5 lAIŒ]£”©†5xàÆ‘°sžè±Î@»LÀŒ’‡»ˆÏ"ÕÌ‚/1ô¢QQˆ¾ô8BdtR¾¤DÖ'^•SÜ˲J0*ïV‹Ï}³•÷©`e1ŠJ%¢*ÏÓRWè¼(©«‚T^ ÖZ´*#U—h—Ý%ꋲԼQËjÁŠzÂøµ`@Ê—sÊ•@+ld¿õᯀrë´À${ª©à¬Pü/ŠÇƆzp€öQ\4Íyw›’9ð¿T›éilj-SJ*)ì ÂÜÒ2Ù4»Q,¼>1ó˜È^³x¹ù`¡¿'2KeVb)ç¶ÔéTÖÒ*D ¦˜§†JSžŠªN,V†2Us_‰¼¶½}ƒ¾öý4´Ëôëµ6}ŒÖ‡t[Ù›^¶•Öm»Ø¸‡<{Ø—OëûC÷N.IÄð´šÃÎf„bŽ³³!Àƒé?”/ËA„e7øò*M,a‚œ–ªUâÍ„þ®Q²9&LyZî’E±6z_Á%£ëÈTa±R-ä~E§Û¼Ùþ¹u_íÉÿÞ'ƒïuã.ïÙ…tßÊ/õà~ ÖƒŸYkþ ¾ÉR’LèI;~—Øsˆç°€®âqe¶^qtß}‚–†S˜j<7|à‰X6ø¤¹•;k÷…¬Ìǘ@ìLgÕp†'ÙCê ”9ª,ªèÜWé¶V¹œ•V¸gmkÙô¥ŒÀé¼qYÓ7'©;l]˜yû¦!!/l[aâ‰=Q#Õ¡rÄâ®–)s‰©y(‚Ò²7ìh1ÌIŸºT|ÐÜ’ú~ƒ.ÊŸ/Qæ©ìÑØÝ(ËÓí›Ó3ï¤ÔÆÚ¯QåeeÍfœÀ1¢‰&gY°{¦¨ˆWC¤,(Ufi;ÊV¬vú·'3׎ücóÔ_èâŠ_YøÍbÙ¢kÖT³QVRõæ2——«zK²ÅW26å§,Ëbù1[FÝnÖ%¼’YÜçúÄŠpãôá‰W>:J—Z!k,>!Hq¿ã?’Øãoó8…¿,þøÏãj<•ÇãÔ¹ù/fëKÃx ÄÃãPKŒ=ï<>ïÒ 21 strciphr.hÕýoÚÈògû¯Ø¦RϤ”^OÕéD>ž! :ܦ•¢¢Å^‚_—³×I¸4ïo3»þþ€¤¯×êEm»³ó=³3c¿ÞF®ŽËt¢™K' ø™XÜÔñ²dîšùÄri0Øä>qVk—­˜'ïšÂgtE,g½d~ÐÒu­ãºD "Ç[øöCK„>#+º!.ç_È ó7@±ÜÉ¿Ôg6œÜ.©øÏ‘®¿Y þò%yÛºkêÚ<B)T8øôø- Âõšû‚P #_Ý’EèYB]Gl—ãYnh#ës&ˆâT+êYŒ+ÇsVÎ߸mñõþ6šÄg€âàüÂ6¡žMú‚¦ü°bbÉí$е¿BîvéXK²`h>â o€A%ªëœùìÄHØÝÚ¥ž” ‰%ß"æ’‘[îÛdoÍ]ÇÚìPqB@ÄP}+H¨:An±$T×€sD–ð*&«0 }ªCÅ•ãÙÎc‡ÔÍ+»¨ë–®EÒhwAÞ@ÂùHÃCîAõnUgÜoFêq‚ºÆ€i²mG87¬+Ϙ  ¨`\¯{v2+¬†É)½´È”K7ewÑ£Àê9P#Ó^g@¸Ì{ŒIë¥ìHty.:s„Zb,‰€®ÀuÔbºfà:ŽPV¤Ñ±Hâ&qZ¬¿¹ãà·T:Ò áŠs—"Â;ÑÝNSñã:Ã`u[Ë6øŠØ¬™Í€÷Í ê;–âíÌï¾:ìrÏò™`ŠÅsîÚÌ¿:D9gjéêðäê¸Y£Þ«Ã«c¢þõÄ(êã¹Úèùæ@_·Yà\{`Ó€+‡7ÄæÞ/B* ú #£ENKQ?"Fy‚˜àuÁ}Ãëe”XÌuù-³!8#€sÉHTÜfàA°Ã5 §è]Ò!(x¦„(øHß £¶bwuíšaúðÙb ­ Œ¢M#ãÇÜ&ÖÇ°±€tÁŽe± Pš6àZ`ó€¹ d´˜ßCC2ô›yH Œú*t€ÆaD/áÓ€Rh|È#4ZžM¯tÚ"Ò;ÜM³ÒkRŸ$&Èû*cK_õÀT\†dœE·gÄ°â°äÁcìˆ}ÿµ®?wúnwòilŽÆãÙÔœtûãóÉì\èìU{pPflFöfAð´–{ùµ¹Ë­/ùUê_{à;®êÃÎEo:ît{³“Þ»þÐP—ËxÜÐõÄוŽGƒ~÷Ó¬?4{“38ÑŒó¤3í‘#Ò[­ÅæXWk ³ÃÑìƒÙ9ôH>IDfh“u8‡ï‰~¯«oí4š‹D‰:Þì@×n_úê(€;Ý?èúÚç‚Y`‰v /ÍY&ð‚¼c"ñEtôk†Nʼn‚#øÃA³z‹?—p‘.hÏü4î¡…$l»]=QvEnËk¶ID¤P×g.½Èýè½9~oÎ:ƒþ»aïôèM“ô‡Ù…ßâ…áûÁ”õPÖ`$÷ºv9雽ٟ½O;½Î…?GMR‰)åÉW’ç O~MŠ¨-­Ïrü“£¼^\ dJ¬{k6[½ùí‡@¦ªãq¶ZÍî¸? €4hN–˜5E0—S;‚3bÌûˆåF„ Âz¨Æ°¡W¥ey>€“•ÏÇÊo!Q0¸ÁRøpLJG(ozÙ7»ç¨¿ô‰àÖÖ’‰74õ{÷Zú_5‹7…*ºìjwFa¯‘îÍÁm¿”å*ܶ–Å•ÛÊ`’*&/Èæ ƒíQòz»šT¨ñ¨æí_G¶à%ßD·¦Ãi×Z(Cî e;‘:q²0Oæ!ïwÊÇÕ¹rÇßÑ“Ãmwi tL¶6ª§€Å\}QeÎ0\Í™ÿŽyXÜÏŽ>äíí0Ù¦ùË#º)ð¤D?òÈØçXàœRAÓP-A-X¼pâÕ|UyÑΨÅJ/YuàèÕ<“»~wvWX¨½:ÎŒZ•=YÕ½A Ù¨ÇodO55ÈÈl!F7Ì/¡p¢ÒêË™Jž3àI1ѦÌ]ô= „Dj ‰øŒû·n·\-»ëPe^Ïiuu-«™¸V ô5™ã2Óô¤6®œ@•§qùIRx®„³I;×TeÚ¦œ=”gÅþZÝzIKÕ£,ô°†œ¦^[d÷…šµ=©©A÷3ûU¥%蟜É'J¬t qÅ®/3‹½r.w[6F¬4ÉV,=ÏÎà0*‘—Eä Åä”Y(  C@Gi &²ä,仚 Qúœ£4JSZ<%ª~ò„hëˆç‘“¡HÍp` Dj¨rO›Äh Z„Š› E“=rèCïì”ÒNŸØŽÿØáFÔAÿúó§?yœñ„~?W7Թ붾>=óM=ýSÚìb‡Tuiî†Ùö¸Î£“®¸.>îU*ŠÏ«¢úÝJÍAß$oTr*•nǘ”–cœ#Ðz@a˜_{bá8UkCÂS õÚÏÕL‚ò·üО‘´8Cç©¿ˆ}R'z$/üWä©FšL`3MqÌ6º» ƒò&Ôd/ùlH±Es|o|ã¤Ý6yÏ W8ËE8-˸7Oäû€9fS´Räè(c1‰JÊA¨Ê`dO-7bæc‘’])™ì\å…FKtfa—¾¥‹du¿ùL²|*dE©,­ï'¶@1#é~Œôey@–@¤íE5ȃÿŠeR"=V"…¥†Óœ`ŸÆkäÝ)ÎNi¤‡k¯_ç ãÛP@¦ô•¯ÈwA,êásî;î¿‚5ùRÍ"ôå#qɉĖ{ô§G4TdÆüàr6b3ªI£V:",=T?ZÅœº¥C«x£öÑóÿ{3Uóðê;tS?°ÚÚå$µÔ£š®ú{55¹Z‡¯æp\—ôšu<{ºtI9Y¸•Ô7ˆ­¼­ÔáÊÊêŸí¡jêþ§ Qê*¤§ PKúbU9DËá{¨þþ{éÚx?S‘§ì(2mg~š&5€LöWèøì,te ’ -¨Oñ¹p¹€TƒµÛfWž­œR©g3ÏȬ’ǸŸèÏFXpeØ®|ã,á¸ã^snÔ6D‡•ÜQDýqô'#'ѪˆD½våV!±ÈªU e™mÔÊiï¬ó~`âXwо3Ïeþ~ Ú¢«©ÄðmH‹ÐKD.A»ýYRpߨ^¤ërÎ]œàDzCø®¬5³h  Ì‘ýc_¤¬â9k.C–D؇ÒñzÃSùh6÷BàEgø¾3àkVòAo¿cöffïb<€Óì;ÂÇW8ý–µ^ïÅÏZ·¼æ—ï$gÝAg:ýcóƒí*ç‡ße\¿rE"üŸÓònŠå;îGP-_߃jÑa•§ýPKË=Y£¦›tea.cppÝWkoÚHýlÿŠ»EŠlÀÁ˜¤- ñ°²¨ Aì²Z˱‡0 Œ?HL•ÿ¾wüà‘ ªt·Ú¨(Ïûš3Çg&¥Ä<¶\X86RbÃ] ]“ÂÔs`96Ê ˜p}ªÞUëb¹Ä&ShÏëáœ-f ‘D¡MïufS“5º(.jõުÕÚ¦Ojµf͈õ@ì ¾HJJÞE|èmE™OïbBYsÂîƒY1m®o.Èæ<$“z>¹¦g.|Yü* -㜤6f¹ˆÃ¤$ZÆNì÷&© µ{ç†ÞïöZ}ãjØÕ‡EXÇwA–ä"œ` Y/_ô¿.ôþùõï˜CXsº ¢‚ɆNÈl!¸žyÎSoÚcK^[JZ*âÆQ_†|d]|ÙCgV­6ð‹ø<ÃØñbÀvà ,¶e+OŒÏ©g1;aåÄ‹ãîö¾Â–ãÙZ û•Ò„²ÉÒ*†$uõÃßhô~šÑ9‰~;ƒt¹²(|Q¸½p–­H">’VÐhÀ‰ Žâßê-L`…î<á³Í&œf³å[·Šã¢8ÇE›¸h'®ÂãÂl=H;iƒÅ…li;`wÉû;…ö ä*;FH9!ˆ·Dù¡-áSÊfk‡züŸ¼å¿Ìk>~GïyŽN¹jÆè¦?^Ž(”J\èL/A]·Áa0 ñ„6u ¬…åxÜ)àô¸¬òÁÕÈ •Ïqò³¦UUMU«%üÓÊ¢àÓ1‚·‚Âé}¤>OÓ¼£.92÷É÷‹QŽà3]kRªAÆ 'y³óz…ϱXÅ çÅ+k–o X*DIp”G¯ƒ›ÍrŽà5hüŽDèbµÛÇu?¾¡”k&ló€|-y™t~“¢A1§ŒÀåÓcÞ ¶©É Û¬Lx=yÂW5‰ÐÆ«¸G• ¹¬ä”Aퟮ%;ZÌbÔï¸ËwJpR_oJ~‰³R2ÈËY*œï8¸uðšÚÆ2C²$žOöhð²ÒöM3/¯»Þªº}dFXr‰§ò;~bJŸÉ¦)·8ó±pª•X}”¬Éó¨(ÐLNÙýW‚1Q4În™:Hnœ\hVLJBsÄÌ’öÜBr Iî-O{9æ¦1sRÓëO¶ŠµçÓ!._ƒõ²Ã•Ÿ©6¿2W7ùÞ›Y™op$!§þ(Êš#))””#QÆeÑbÔ·(³qÚsIû·¤ÙüWˆîâ?PK=iŽªWƒ tea.híWmoÛ6þ,ýŠ‹l¶¡Y][ƒí °b55š*Fìf.0@ ©³ED¢ ’šãùï%%¿©X7,غ ÈÁ<ïî9ÞóX:gKžà.n>NfדI< ‡ñ[û\ÛÇ/Ͷ×éÀ/K–¡Ýñlûœqš• ‚#‘Þᶛ:MÛ"+è±ÚÑð}8 /Â8/ÇQëBlת˜LÚ:¦w±-•(©“gÌ—ô`].2Fá »Ç$0¦ì7üä»w¸½B¾RéàÇWÇ­["YdxS”<‘ƒÏ}û“mIE”Þ¤— hJt¦•i˜­ ÁTšG$ÇV> T¥ààèrœþƒýÐ7ez0 \¾vR¥Ö=ÏÛl6Ý ²„°.-rORÂÈ™…ð¨ì¦*ÏÎM_?ñmš) Æ#¼=àCéÔ ¶NQŒ ZæÈM‰7êó‡K‰®ãÛÙ0¸ ! 1OBŒóu6ØçðmK©z¶eýZ°>pššÛK¦¨t3[uw[…Ð)% ms¡ä’­8&À¸‚¬ê·»ë£iÙ-ÉJœ&$|·&‚ä²­;f­E¡*LL²ê¶ÌN‘V6…H^µE¯2–3¥-¦ñ_GrzZ·à÷ðMDAQÊ!Oæ…¨7 2^ÙöhjãýÎÓÝ­‹RUëvíõ§…ð_-ìHm×hØ}2o'Ù ŒªªÇבkºè›‡a¤ž³þ…Çc£o‡c&óþ¤ž¸^ïÓ¬O34ÜŽ1Ìú4bSæÿ1m˜ÿMâ0oªÃ¼!óo¡ó'xˆo# F_atƒ·#gÐ çÙ£ÉI !ª ­±ÂŽ«Ð"”T°E5ôàÜß+$N»«ß‘Î`–2 õí§Dòïõõ rP(M¨-ª.è¨Ú!h>ø'hSE÷)ÓOÔMf|5æ Å’P¬vNR¹ÇJüæï/ ý«šq÷8½Ð¡uËÊãÅ^ðá5Ô›ÝKTIuêgs„KRfªåþ^=ë¼l±´÷‡Z¸ZÁø2£ÑxÅ×7£ðÆ5JÓ]àŠñV[+ U¹ïÂWat9{[xÐÔ¶yZ;¢&ñ¤ÜþÃc$¯‘ç4Ú“øýßÄïø¤GN>!OØÒþ PKŒ=¨YÞ¿ò_etest.cppì<ûsÚ¸Ö?“¿BËÎݘ† ig/yÜ¡„$Ló`€¦·Óv<Æð±ùl‘Çnû¿çH²-ùAI7ÝŸvg§1’ÎSGGçÉÞÛ#Œ†¬f/—d—<cÔ#–7!Kײé„8asJ–«±ëØdâ/,h?‘Ô!§–³µõë„N³3™Ãnçý k^ߘ§Ýþ Ûiºñ€ÎàctÓïC×Yûý刺¼Ìöw¯Ûo/Iûª;ì·;]óC·ýŽ4€”ãÙîjBIy⺵yYiXL^ë ³¤‹IªÍ›é ³?œ¥Þ¼X+—¥à@KßO‘t&–Þ0¶Búæ@o }ûŽ²i áƒå¤Z¦–Íüà)5l¸YºÌ™Ñ›”¶{ËvM1D={®€CÓä¯eØö½ÐwiŠ)Ô¤i¾½\¶¯O;¦¹õë2°f ‹ØþbA=f¸Î¸JÊvð´dðhŽ'a þ–+¦¹ßŒ†H:ëód©Äæ÷û•LOÈ&•­-d•Á¢fäªý_³1hÃL]v¯ÏGÇÍ×õí­{ß™9!£Á7K‡†F%ê:§ ÀÔÃö;úd¬¼Ð™yÜQ0rGŸ.©7có*„ì¹WËÀ¹?s\êY šêYó;BJ'@lÕñfhu=®¨!o06Æ¡·,hZ3ª!>¥…ˆ ٶ圌>2@%6lA8|C’—Ö—ÅVAÜ tÆà Î- œéS–R‘žMHHt n&d2Shˆ„¾€Õ0§`: $ ÚÝ¡Ù L9£ß†¶Þ­ÞäxˆQoóW,"#'wɸ°‹áô¥¬Ñ Ãþ<7žXH±y$F°‹Yr’Ñ•ãedXƒKL } T×pQ6„n>ý.a6h8÷]X9øÓã½av: —¬‚y@mÿœHî«Šq Ýòn*êc¦{xð…Åß;uÂ% Âc>bUÁ÷Sø=‡c³ÙB’°i¸à\M—ÞS7bñ|åmˆ$¦ú–Ç"`wþ$ ´né(°`h?{AŒ(>›¢€<óƒ+˜Œìeßtwú«À¦Ø¬£˜€gs<>çv"dB§×6êæÐZ,]Ú^.! 棌H†hD¼EBÜè/pÞÄþÉ=ø­ ÕЪ›tò8-ÁxÕžÌ}{ÜT¸5ZÁÌŽì žï?}©crýþò’»<`Å&7goÍ+Pâ8Ù“VKúà‘„æÌõÇ–;¸>‡á‚³ëÕbLÉ-„E¿‘óhŒQÙús«kx¤`¿ öâ±ÝïL Šx{%54æ“Ý„©âûÑÃÁ—Êa!šûĸ½Çø×á«C†×#µeÄþ#gGÁeÚs¼tká`»ëNY릚1m±‹Ÿ©©î+–ö\3ë'ö7š—‚æJ¦ŽÁ¤Ìdä~â@[L¹×g¬2ÖŸ>í@¾#°MÁO°Bx"bíÈÔôT •ÙŘj¶ àF%Cý4Â&‰'Ø71®K¬ëÊ£ Äœx +ÆdÁ8Adi» %Ó0Z‚•iX–NiÐvÝ‘o,XŠG—pt¦¬¨ätÁjç”a3o56[°9˜×M؆>´<‡=¾Åã†fHpZ‡-g*ÊS õEíøa«–úU:Ä°õwšøö a<Ú&Ó<Ñœ±ekoïáᡶpìÀý)¬<±÷0ŸØ{á„W‹=Hó&w{S'X@Ž@÷úÝÎÍÙYm.¹óƒÉ~â›é´ï‡ ÆW65Þ€hȶSÜ·…ør¨Ï£i˽-Ð@Eà;¤yúØ+kæØ9$2«ËCðË1©?6êcŒB û›õqžmŽÐ¥q:!ñ|ØI¿‹büïqà83Ö¹/­SQ®àpµÈje‡¼9Põ<0Øt!a¢#ŒO€òŠw1‚\ñ#ñÿC`ÿ„ݺqpPYGHWè–J_ÇÎZtr¹=ßÎA2£¹èpÊ*úL}°6™–JŸðÀ›½«öy×<í ºÑÍà£Ù½Á¿üä¥7úXÁÃÄDóÉŒfö$fV]°m¡«ç=êƒÿ‚5xÕîðˆ Óð䟾€ÔÉ Îû««xxc°ÃxÜ«©¿â>V$Ô ì¹¡¹üéN]üÁ ÀŸb2UQ\®ÀuœÀä™4Ðœc™ö.””CÖ¨>tÆîw/i­,¥"VH,ÝØ“<äÊØ{3cïÀ›°$ÝÑ .wç'Ui|8$Ûæ’G2 j¯€3É*BÒv®,Û¸¦÷ÑY{eGfÀ%Š)¬0«0pèî‰(Ó¢Á¶ ÚÊèòŠ2^Ò‚ÉÔð蹰¹h0^!’*ÁÖvXOCÇ»Cت†GbšÖÚ“ D3 )é³ÄÝBñUr°fÜšR%¿ ÅW³rmB…Cæ­¹EÅädÀv™5Už[+S*ÖˆœÐ$$w± 0ãÆåȘ†ÇM2vც6`±‰˜JvÅæ§ïűäßÙñЖÆ;rfòÖÇh"ESjýjȘ ”|L-L1Žòùæ—dc{ }Q®±Gc¹™&­–!‚p€’26¹…„{eØ DÇ(8r¹V¬<}j1‹K ªQx¡øL No;oêÖûàªn‘€pµZ¸6`n!ª€¸ ¬*8øΈ\ o;Û!‘i XÑ,Éã ü§Ìáæ†Ñ¡D~ÞÀKœ—=%¨«Ùƒ½lÖHåâJG¾“‹¥±N;kx¹,u“I¹ÖÞ ýR¬ª¾Önè›±p´2{ºþP¼†&:¼,|oOo|Rnqøù”ËäëW¢¡KW=ÖYùá Út)[/¤B°’zÞ–­ ¥$ªI–Ô³µï‚GV-_¨¬"Ò:íìÎb¾;oà:þ¹ÏŠBØ&e»P”±JÙ#<¬ìîîW‰¦šýbcq„m”ŠŽì6ây ú ƒþ/±{Ÿ±í{±×Å[M|vƒ¸Oš„h"@:R¯Fmøqlßoó&ûd‡ é` ¯ã²2–î/ð,¬à®íºœæ"i8ЪªÃ¾è«k} ÇW úï5tšYBÍŸBéA(> M×hãyúTÿ²»]ß.Æ´’˜’CÑÍÝ×ÔYʪôÚÓ¼5лxLGQpÜW„„IhýØò*ãVâg°+9.TSíQÏÉs)Åó¥’ª‚§Sò¬«°dµÆ—€IÙr¯‰®Šl>W–ôæéû"…š’¯×àœ'*ã…R~> q$F9Š"÷øo< ƒ¨+*$€ù:p™„¨ª(Ô­²HßgÒ·ÝÁ°wsMöðÖöl׶ù!EfÄ¿pD…TÆåË+ÏÆD“üÞƒ ÌŸy*L"§W#L“ÏâNÎÿüsã[ÌðÚ'× „Á±»m"­%Š‚Ÿ°°ìy|5­Õê>ÚTœJÿF+âHTsÆÙÖj6"FHyæÓ«Ð’ànC¥È£tº–XjÈÆtšœÎ·­ þ“ð›¡9¸>WîSBÄÁ¯›¶WÌÇ €N ŸÞ °«Gô¢ â¿ôVÉûË@QÎñJ£~Ï9®ç‹Ôu|ÚÙ©ð3]@Œ|#6iC=gv*<Ñ ÐÏÅyTm@§a7#?ÕæF«òfH–ï€ …àÅÅ{Ëq1å–vBfì6’3qПVžŽ#ÒœëVsúÈï$ˆ.¹rÃЀvu•Æ(\¡ö€† kÃÀìØd•0¬]Y øè=r)²Eh>§Ìƒ«(©D Úcø¯E¢„uôñ<7$|@Þäc­IA°ô‘¡®Çù¤]À¢BøyT)êx®64oÚݾ9¼h›2öÅ)¦!®&² .âô#9ì44W©ŠÈµ‡ µÓî@f-QÔÅ JE&5¹ k«1ÇfEh/ÅI¢RÁÈj¬ò!zeG߶~Ö]TœMe/Š˜×0™÷zÍÄ2ýs‘ʈV¶*“³Ü„ïþ»„;Y{Ll 8¥““È'O"Åé„d)2»_ì:oz6"«Ö7œÔ"RŒý; T¯–æÑ2¤JcR¥Êõ-qyCn®Ç¿ç.ó_VòpxÔ×64}Òj!Ç4«h•ÎÔÈð™Ððëõ˜2ÏØ·d%äúý¶õwÝÙþ‹>$G·âŽLÖ“(d4>²J(&‰²6<³ã™zèa4Jì9â HšíÔ‚$½ÇÇh|pÜà5ʸ×Ç-Õ^­ýGʧ(¯îõßÇ\D}’GbúÐÝ“þJ#WÈä&f«ãæœJÕ¤©‚—VÈ"ª$K}Í%ÿØ°À $œ[h+½~÷ê´ñ¦NÄëU‡¼·ùú öÃø=·“GIô¾n4±þÀïsG¼ÒD¢'®$,ô›É Yx”œQà ü ~ÇQþøTÿ‚waòR'Z@ª¢ŽkŒhC›C¹0ÚÈýbâ mèAñPP‰6ôuÁÐXUÂ-Hø1bgnyu‡$;'8uÉOŽC L#_âÊœA¦ ’iòqº !Ü=iO&2]@ÐOWßÎÝbiÊP5D5¼b…ÑÚRâ6šç[y²]‹½²ßj†—°ü»3?pØ|wWEVW–UWu˜’I†xª¯äŒe-÷{ÞK0¸ 6; ´‘«d½XÎrHÝ)fçâ$­‰%ö~îŒÁÅÅU»³Ç—ï=ÞÛ⯾!°xåSæî@GšÝÚcgHªEÆ÷gêrð„ûõ °†Ø´0&â¸0„Q“ ò¯Fz̾Š#êŽ%°HÙ‰“š±*Öxe'F˜”Åí)8HðÁ&Q¡ùHÜ­;1œ =‘(E¶!Áã ^gÃS—Êöª°Ýc•DŸè\´¯¯»—"&€¹ávÎk±ÄSÖÌ’yÑ—B•%ãQFñ‰òÁP5µÈÕ¢f±ir¥qòç0Á™‰¤ ®fn¤©¸;UíUÁc0Q¬«‚O‰ˆê“ÙÁqþ!ä=Èí”=žäü!mƬ¼$ȈTÊ] Zoto.²±øþßA6n• Ë·*‘zÄ"Ï÷¡ŸF®~ ÄCØøü¦H·¹ )K}±w¢×ºô—ñÅY^-×øÇÿã¿ãÖ{úßqÉY²ÿøåüò†~ù¯|ûìroOO´Õ„Q™ˆ¿šBÂÅØÛã7™-Y #³ÀZÎñZ¾¡ŽŽLK_¾ÂeM`RæÄйå"ŽEz÷]øï„3Àñ2À‡ÀŸIòßWl,©­âÚo.%­_£†¨é>i ä„t8§NÎôl•ºÿ·²\,X¥GØqê@%3þ'Çþ’ÑUR®—¹‰‰Áø"=¿Ÿez·I‹5ÅêɈOÂhòöÊðqá'Ç ;ÌÛÏ Ä™B´ÃlõU0Çi`›‰þ\hMÜF¹’»}'g‡‚P U“¤d?¤øLåQw‡›äd㕲ù'NôL9½,’ .L…×|å™ÔTLÁ&Ds?qòCDÕ2j!Ñ¢¯±<“bQ4‡ÜK˜*’ÛèÃ/×™ÚÅs>þr-ƒbyK~ÃN½Á5äø {žÃpD€çÁoþáožÑñnÞt‰ßüAñYÈ-žO’;AÂ>¬l¢ÕŠøùâR˜¡ ) Ö!È–ßMˆ¹­uŠ÷yØœ´¾Å·yò¼”ü%3Ta{ýþàftcŽ:ý*Ìë›Óîeû#¸ÏõF¹JÒµÈãä…K,‘}~Oчò”Âøc¤¹oÛx±ÏH4.|“$ÕñÁ1Ù¢ÔÍŠWŸA¶ãú!ê5t1®¬;ñ唘ì·ò½ÍüäËa Ñôü¥(+Ö’ž­K62Æžóu£\,¬ ýÏ!³&߀šŠµ½_*t"·¥N^˜ãø% ]¾kh üKY‡JÎ7—ïƒå°›ñÿ@2o²Â"}ˆÛÂÃ$”ü\QM€vçÖ fybð/þ€ÙŽŠŒ±d`Ô ä}¢â„~h(C«¤c¹î"â;£¬;3²‹AÇÉç~€±Eåx ¦»ˆÐè]Ÿõ®{£®9ê]u+ñ§x~É:}™¹ìs#™º«pÎo#˜Œ†›F|r+ßi/B©àëÞœaŽE{±"Ã(,ÁŽÎ-¿Å\æMY–I'Å$@ñX„p ‹Ê Éð ÿ§oËFÛÂjÉ>¾’ÌßÑöðúË„XŒ‡¯ü#ømÖâë³™OŠˉϊAZìÿßÚ¹4· CQxß_áU'Ù…g›dÑÁ‚`׺@‹Îd”@0­=Oÿ}%mìsÒUwžñIÜ#]éâ«›fóã_Ý›"f6à.ì«@µçŸú×Ïí ®þQ¦ ªTõ¬p»ÞõÓe\›.»lë^Öõÿ+kµnÏãgÊHíÒ}V‡©ÁÅUgõ¸;[êHngÀóëÁ“rµ¯×oõx}i@IûA}ëã´OÀ60‡ô? =à\Â¥£8pa”çnFØàf D¸~$`"ðI. 7¬ší÷rýÒƒUØœ)–²n–¹ [¡3¿÷òÒ6Ë­e1™ÂrL¦$E«ZL§¨Še-+„™X¡j'éÞjL¶‘:»N±u&\ÜD ¢L»é­ÀÉÏDKä“~cµ-:#6uÜTùÖ¼ŸÃ˜r‘X èPО³¸|1šD˜Óv™€ñ—4C’©gRåeªµ‰wÈ2ÙFÇCÝ?ÓíA±ø\Îw4ÉQ›Ï†G²0ç-'¤C}]D¦®ÃDÁa"¤¿7rU KUèlîò|™ýgA‚ŽÆ¥ ç9‹NU£ËDšãÒvéFôõAêâÊŸË\èº\¦P¶mNœ}S‘ŠÕ/]`¦R[a@§4á†ì2µD"b´Kê4BâÈ=&ØC–°Eà1ÑÒÉxñ9¸¼<›¯D®Ç´[È¥ÚLeòyU¬ˆ<Î2Üû=¦Üb8 oeºEé8ž#Ê §crœñè©B}£*ñðó†“Áà3Õ„¬‹ª*Ѿ>SmŸúŒ8“.ËØŽãS·¨¢2¦[Ú¬‹Z.7¯ˆ3õîèè¢3™t1™pâ¤ïî?shò(ý_Ç:äxÔáSž•¦~Ì!é¿ðùf Åh¬±Ú"=ëgCëò<•ùô¾kçüèõýLý;J®£5¯ôrØjþPKŽ=(f}©ÇC? tftables.cppe›Yf]R¯©_QÂ7 !³ç¡9•å Z-Ùw-dí³5¦ï³YþïŽ+vfYÒ«·NžakÅsò/ÿòûÿü—?ž¿ûåßÏßï_¾}û/÷óïÿÏÚßÿôçþëþô§¿òTüöÛ—¿ùø¿{yûø_¯ÿí¿ÿöÏÞþùßþñ×?þîwþíÛüã?üòë÷çß~Ý÷æ¿ùÍëøeÿæ7ÿôûð·¿¹üí÷¿þþ¿}ÿþÝýëKÿ ù,Ÿ¯Ÿ Ÿ.áóÇ;>_ôx-øì/úðÙœoÁ[}è%ïzÉ»Çgä­ôÈ›^³^®Ç½~þÐG¼i3ÞìV‰OÔ“£žôòút¯¿íú¸Ä›h{Þµ=íU¯rv«¦§e¶í‡ÞJ/÷ÚñÌ“µ…YüÐß¾|è'»ìVEå´kM¿=í·Òã]oXµ;/Úæ=ò¢}yý°[yý•ÓÓ>ôVE/côxÔÎþÐ +§Çƒq¯v«W½Ò–4Φɼ­Þ䕳©øà§6àU;žòAíï=ùUO(úù¦Ïí|®Þ6ëñw=Óëo=‡¢Ú­~hÞô䦿zÕË?´…o:¯üÔ~ègÕ¹ŽzÎË»UÔ›¼±kÚÂÊ)ÐϪÇ/ÑîmÕ›~ÿ¡Çß?—¨¶ás¡¿J½ÄéZjœ5mÉ‹>Âs°ïv+§§U¯W.?ýLl']ë¹8¿zNЛ÷»DƒžöƒÎï:2]dÞW½üEoÛu<»ÏzCCæ…\¨l0pÄ´ãI;þ¡7 쾞Óô3Þ[%mdÓÏÂÓ8éÜÈzyá¤èè}Ü›Óv†;ƒ?¸~ôVŽëYO~ÑãUŸû®Ç½Oz¹ãÔ«òË+†}bävÖ64=õ†I?ŽÌ«ç.àtÜ%šùDöËq@ŸøÆîë‘ÊÁãú½ëUõF†ªMõzÃÀÑÏÌÈéÖvF½¼èùYÛóΑ¼K´pqjÞu~èMÞôóE?·ô%Ù­Þ-õ´  à/áÖ®9íˆÓã…KEGåt;˜ôV™“Ë"«×:Ÿ¿â&£<#[Ï`á@[Ï{± CåsÍå¯i`âR°5l3f&憃ÏèfQÃ}u#è_¿4 ÷0—ûÆ`ÄèŸo«¸88FœŽw‡ƒû“K–y‘ãË ð~#,#s——2ƒcw_QžI—‘…ÑŸË:ßÙeæÒäl埒.×:ã{f"yûŠ/ £_lͽÙdæc.¦1n9Æ,f&KÀù+ ½ÝMÅàËH_¿B$×"SÃcƒ#37ÃÖëÝ LŸ–h‹?¾R ó31Cùë @Ü*ŒéÜâå®ö÷ú¥M©ð(%™ºÌ$”/eC]K…J!•Ë¿K·j¯T0þÛÿû«ëWþåÿ¼bøŽå¯_~Ÿ~ò,âþõ™ÏŒIgÏ=ƒ?"‚KqêCŸøÄÙ4W¬±†‹ëa/]hOÕï;잣ßûîûŒÙxÅì³ï™~³ÒJ®/š†æ[y¶>Ão¿û)¯è­7·™¿žð„ØêÂ÷QFYas#”PžšìŠ8ãÌu1<ÄÛˆf7ZØ{q-‡z;‹WTi÷JÌyüÄÊÌ—Ÿüôz<Pª-nÏ+B 2$L…Ùg¿ƒ;zõxÆ,‡‹y¤q¢·VÉpœÔ˜$Ýr«º££ð8ùMôæš×ŽÇF7¬pVÞú›UWpÏ`à+%ú¡ÇãˆcÄlÏÈ=w?Û`Vå¾Ï5WÏÔÑr© ;¯{ì0‹Žh=õŒgjoe ŸYýþlù×ÝæÛm73qmx—õjYO–3"”ôŒ•­mµÖ†^±ë®#›u<ùìfÉú‘ÞÛº 3Ìó3Ï|xôч&µ@s%h3k ãáœn6ÏÔ^{íù$½¢<åI>Û3Ò“˜ës̱tfüžzj'ZŠlÑŸ|ç|„ UÀL3õùPVÈÏlŽÂÊ+Ÿ–‡ÍùzÖŒg2§VU‘Ÿ¹©äFÓU8m•O¾Ö¢WÌ:ë.˜‚ÇjÊ¿!¡s.,±Nª•X¤1qºÔé(.d öqÚ´gÈÏé”rŸ´‡LG~žÎgË°û6«í¨L­Ž ®Û‘:¤Êd,™wʧœÊ¬Ö*ØžæÔ•xÜq1of`™6™t}Þ,³ø:míÊ#b:T-m¶¹ÓÒ±’M”r§‚™cŽ^‹%¥•ŸÁ¸Ôž–%L¶:×[Þ9ìc;JÂÕÊ¥ëNŶk‰bG×¼Ì3pï2;6V¹å¶—³Â†ï}^mÛ€r­çº{FuÕeG]$ªF·êwÙó+ü){[%fâºv[þÇõê‹i æÞ\}ivE?ý¸‡Zª¯¾š‹ƒšÏû"óÉTò\O·žŸqÖÚÔ2U®uÆà³N[CK(‰yv›s 2X•QF6H–ÓtD×^ËÕÁÌœdu{»â4Ybe™»çñg²5ëŠC[+ÍÉy‹>²ÍƒÌ¡îÙŽ²`÷yˆ!Ksµ’2ªlŸç’Ë®ŽY&î¸Õœl­ZÜàþ@@~¼Í  UcJ“Ÿ³¨A¥ñ²ð9磖£E8„¢š^![p.Où'A¬õ‡"0.ytÉw]IP]uë¬í$+÷PJR“1ƒ9¹{ç“͇Ìñ9Åâ–Ÿ1(eÊKñ[{.!¿JT³è#¬ž<9SYþ5ÏݵdŒ­#RVYO^ö ’6öä^Ë3—Eé—_;SiJ(#M›нæÐù1ð”Jõ)³Höã¨Ëóã¬U>È¿M9Z\q3S”Jr[z'Ióëoc%ÂbïžØCYLu=+ËO_‡­’4‘G²}ŽG øÑŠ¸XÇÑ9²C¡œ•m¾}o6ƒžR¨leÁäôdî( iSåÊÂ_)û;ÒxIÏl¯ìÞV6cb-»©£üŒ™mµûêkwÅJ/NÂDÕî&ámS§#!{Ë8"dzãÐz×3¥²‹ÎÃÂ¥tªJZ´~È´õp¨ÁŸ‰C§%Ò@Ø/C²Ê°\+ÂkKbÚ4$Iž¸i$%×@‘]å'çd­’.ùySè–^\J‹æTäÜ¢ö–í!ñ¼ØXIÀ‘ÅhÕ! ÂÝΦ,¬V‡¶J:žÒðÖ*yÀò™]–¨Ä±¡-yЩéKDR¹Õ­ç§œ2}ÑûÊ„j½Z~\Y‡ö'D‘wÖ)?%PÔKxõ3½/’¥óÐËÔHJ¶VIÀê;Xá³Êžô` ÁÌ>ò“c·%“&w¦ „ól¿QeÓKÆÒq“éßEt”.a ?.¸󹤃œ5ƒÈ„òí’:«hPÓBÿ SÓç‡^1ÊŒ;ŒÜ\:>£J@Œ´‚eyC‘ı÷ÇÆJïLɬ†%,Ú—ê9´’Ü%¡[«Ro¥ ñêj¡‘…ï|¤!‘9OͦdDî$?èMDÐKH¦C‘ŽŸÍr‡û „úM"B×(_ºÃ£é¨i€ÛkH›$ϯ”gõ–—è´ÜL¤VY.Ê6¼’´‘ [\€ ¤œšÓ ^$ªŒ+â$œ/¤O.¿Ç!´q¹? Å$GÁh[«VN˜`Šœa ˜FKÀ2¥¥~6‚‹“&#dËäT‰Qú–iErÑ™µBšˆ‹ÏÂ¥mˆæÉv¥j6,”þ iÙ–ÕÁxpàO‡ ¤à}ü1³–Dº"øÚ¡\NúNe\úòˆÂ€%¿ž0CwÒG†Ä§ L’›2C6íb:âÎ*¬ç=e„bÚ­ah˜`Kƒ< ¹÷!ä EÉ8“Évìèa‡¸ÜãÆ£Õó’É–{ì—%Y{‡r Å´ µU»{³➌dJ{猃pŽ ”%B|ÛeAJ±Ò2Sµ¨sG£øì±ü­çE¾N†K‰6Ò²&fHfJÀ±¥-Äñ$Z¯9ζàGsñ= m\[Ô<ìöp† Eq(»ÂQ`»gWÈ*?²vºÙ¢$‰éšì`¹ùÏö7IÅÑ!¦˜ögBð¥ ëa‡¹W˜iÛQ^F¾2 ïR˜½bÍ3E‘ê6¬¿]ʆhfj™e “p>i‹ç zÓÁ9òè{ÀèP@ìQÏ ŠdçyÓÁJÒ®‡"GrÆÉr„؆À°-®}"ÜÚJ“ŒR¬ˆ6 ºDŠ@h ó °³ÖéÒ2-–¤%O»ýœºa#XBvÿÊð’ 뙸[‚ma ( ¢N×Ø)âÂD\\²UŸÑ‚(g-Ì ãÉt‘cl>šìRæ¸`HhF2¦™Éd‰?ÚW"ËŽ_0…,.Œ©sÓû‚Ó±j{ÇY?r+ÉlÑÌcCœRÌ«B¡è$ȵ©9Cª˜mÔðLÉá#ÒË ÑÁd].ª¨²Œ#™ÙÁl0‰‹_õLŠ{µ‰t}eŸ¬$G_]™0±,4…’‚öCšÕäÒ »öK¯Õ‚²ÅhCˆ¢ˆ÷éÀÎÚ|x1âÏÔY“PYX™`§ƒI§äx 6º. àP¦–z–)°+²*Ÿ°an-«É¯PHÐU=ÓÑ«ýð³¢”£-|Ê8±+¶[\´XÏóϘ8ý‡%=IpE,ÛçGbÜ¢Yë1wsJVé\»N0\ö ¿R<¥×Ù0ÿ¦^ÚÌOñ0=Öó%vkÓø%Ù^þzõI¶Œ…¦õ ð`ó!“H˜Êl´Ba¢¸Eñ»ãTA§û\2J„z/Ñê0X_ ¼J=éÜÂOO°r:ƒ"¯!²i‘d£FÙ£|Jä3'šÉ±ªyÂZÓ(ä ƒ@!$9uí›?f«Ð,ĉÏ´K’"Êi,݉XÏWê' Õ(|²!3°)ª†aØaÍ!î>ßBœlÆ€‘~<Šn: GlXfá7ˆ´‡À·ÈÐÆ€=Õ³fŒ0,ZåƒÒ ¿’äëc{ð­¨m¹¡tÀ2gŸ(š‘ßœ‰Ò­«ì–5 #§À.²¸è' š,Ɔâ¯]!yfŒE2ßP¬Ò+ÖI0r4U¥£¬g­é¯ÁÒäÈJ¶ÔO.( ±˜µJ –9%M ‚B04,öõ ãÀ²¿ä…çJýÜDôõ\•…uòaAigXn+:tØÓ%{z é” Ëi‹óB „\Dä`I¶?J¶WGtöˆÂ.-„‹(Ækdh³ÀuXlg ¯+£µûÅï<(IÑ𪈾ûcîF‰Å…šaIY”iòœE¹¶P:²gŒ4ƒBÔ8P $ùªE çD‰çZ,‰æ)/ïPHÖq;"‘náÑÍ È3E¥LüžbÖ&ÃOpb-½°h»òI@0n„ú€€œ „d60K@Ò1Á@H@$6Êe¿Eí~.I „‰©.0ÝÀ@(õÓr ˆˆÎI^×eׂP¯b~\+ Hõ` ”äǃ€lr%@t` ”Èî€P¾œBâ0K@Z!9 „¡AÒ°{ìÍ´xÀ@.É „!à` ”zcƒPüæ ä‰Ëïßg‚0Œör HY` ¼ÓWõîØ ¡pwÊ@.iZüeÊ ÄSaY äélc…O”O!q(ö4# ä¹Ñ¤ý9³;00Á@̲F0+õemDÖÝ]4ïk\i‚P¸çTžO )B „¤&0Bù’šY¤ìÁ@n"Œ „aôq` ŠÒõ@ñ+úo€\"-·ÊzjÅ%“}ç“I/` W`• ÂàžM•hä‡ BŒ¹¤N¸,†ƒ+Î9•BÒ&È•–>‚0ŠÊµš¹$† b¤‚\"ký0ùM'‘Ú‘gT™q0ÞêÀ@.™ „ÁoG0JÙ–Á@Œ€<` ×ØŠÓŒ¬s¶¹ƒm` $ O¹d0ùÒ˜:e–\´âÀÎâEsØ—€ôBãW+ˆ„%q³_f’›4¼±¶å{9` F@tÐ`=§ç[6¨¢W« t™3e $ ¢6Sµ—@r H…³^F@& p´¿c€€´ëŠý$Ât t5{%P¬ž·÷æ$p\²Í¥¨×L1*(°lÔ+ȵ^uo¥˜(ݬB Q ˆ¯)^á~Z)` $ =°(3< ˆÇ#Ý% qM«ËŠp` L¶kƒ˜<` —€¸ „¥‚À@(~‡2#  äñ}eQð „b$G0¸Á@.i „eñTsÙk-ÒÔFe“ƒ\ëµ' H-` $ a4ã@]¶Z÷—¸Ó<M@k` $ {ƒÐnr ˆÄ›J›2D4‚P¤HlØÑdÿê` —€Hl43Ë f–tü’†,Vøk™ ä±À@(ï£a¡¡=` 49΃|Bƒ&úÚÑ”‹®\` 4¶þ€\’”Pê…B"›(³ŒS·DÊ}KA % '€Ðt– B‰Ó”\R Hž` ,ˆ¤/gÉZ)_+ÜáÎ` $ ½€ˆuŠc^R”Ð؈MÍm³Dë2M\I` —€ˆ8è,Ÿz' ܱäQű‚ÐNŠQ5_r2‹oO!‰ „%È‘Á@.™Ê@h4·2šÀÒÀ@XHI äy YwÉD „$Å`\_B®2[ Ê@XŽ „%á1Á@X¦ò äQ&‹%Ym¾÷t±Ï¥Û$Ö ä²Á@h.S1rÀ@XJ ä–¼$tMãË1rÀ@hÃ×¹$0–„f¯Vj¶l¤?` —€´î¬À<b¥ÂÂò—$©].B2 nоär È󀀈½¬,5‹A?` , e Ÿ¤‚˜ýõ` , K:Æ3£ÄÖØû% ÙÑ„Er ˆhÈ5è2¤“„y9 Í®šqk „D̼å(‘í „ÄõmƦŽgƒ°ß=ˆð¡ÝÂ$`ƒq{€‚°á¿l°Ôº%g¯éAÔwÞ‡¬ÔrÝøG·WÀ?úgkk™¤ÜjøBòdêÿaÕéÄ’I8Œvø(S$쓽Ä°H¹DÁ?@A,˜l ¤~ bRücÜÿ¹Ò”Ûü„¦ f†Vüä ØšðPVɬ™ªÁ?Òç <à  Lkeö EEB`:ÿ±e’!ð)ïÁ?@AøF46.·-ø(ˆ‰ÑŒ@L"þ Bçq@iþ rÓÌi°¿~€2+ð¸½À?@AlKe„[[ðP&&ÈFŠFðP+ÉJYÿ¡Q@@°?‰ÞåÖ9ÈÑh%$e¦dðPãÄƪê¦b…÷¨ðãZÊÌ”Ëà  yÓ¨'—ÿ!ÕCÒèáÖ¶a†h…À?@AŒ :PZ2ˆª]¯F²;’5S5ø(ëF°è× ƒ€‚Xu q"™Ž  V|@A¬UfšL ü„2VŠF üäÖŠ ™Y¯ÿaj@òdêÿ±±:ò¬÷ƒ€‚P¾BÒSЃ€‚|r™Äì(D$+ÇK)å9øGu×ä<(tØKMàÑ›Q€aµüäJ$e¦d凉 üå˜ýp+? ¢ž’ü„R’Ž‚üÄ╇h¥dÿaí¶“¦üä’ÈÑcÂv$ûCàfØÿ¹•jXBBði/Q€‚˜¬   ÖóYEQþ ÂÒŒ ëxà  ·2 ¡b¯÷ZxfÒ@Òñ&~`±â­ÝEX  ðPJ}X))ðPÛçQË/\‰–5HðP–ŠPÚ¸/(€€‚P èÅ’ø(eÌì­Ÿƒ€‚P†!­òõAð`üäVªaan$e¦dðP[XÛklÁ?@Aô$//ø(å¤É&à  ,yÁúÓøƒäÀWŒÀ?@A>ï!“†-§)ÿa9 v+Þw¢ÏØCW¶×j{ão\ŒÎ"gõruVuZ{‰SEœhC€Ö‡þûÑø¶?YƒÑ»ëü0~ŒÒðöVhµ¾…ž‹&„ìõëëÀKÇ©bþ?v²úÆîä1Âè"!˜ÐúÞâèÝ\Z úlh7×^ÚJ²¢jºav.ûƒáÕè­ÐÍõäŠÞÛÑÕpп옆®©Š,íô”ªžtiôõ6TÊH÷Tõso Ý·^`ûüò1'WಈïOl¥ôBž¬âðáúþ:øfûž[ŽAÎS¥n«ÅÝÚî¤?t¾ðº!"qoÆ1vÒQàzv€“„_[®Ú"ʯºA ØãÜ$q¼ÃéÀK‡á&HoBžŠ'±$÷a¼{qNp`ŒB'»¹‚°“”ú,“5^;Ñ#Ï".´Šp>²§06ǽz…bìÁ¼"x›¢M‚÷š9ˆø˜uCC.SDN$)ÊÑ)Iê¹w†Ÿf·“··ÖàãÇk<)VüÞêÿÚ¿¾énFèçŸk:ÓŽÑâÀ’ÔчPZ%sñ=²¬wþ7´¬ÇY–¬-  o¡o§ž)ÌÃßÙK/H±o%AjoQF1¾÷¶Ý3õÇ2ÏE›dÅáåVhcâ䈯ÖûñÐúuô ½A²*I [ *…YKí¥»”Fá¹uøã°»Q NfTLäc;Í©Í‚*ÀäÝWmÐ`9ª‚ÄÑ”øW³ùÊ­×°‚åB¨á2ÃÛòEgO¦C ¬å:ªdJƒ…Id](’ÖiK *FU¥>.„á@|8‰ ¶5\DÏ=û‘ a²YfÂÎEG¨N–“Õ:‡ðŒh!Å°v\Þ—¢#nÅõÆÐo9S´ cÎï I¿•ÉŸÌ8÷Gi0VA V}ü%HDÊ©>)ÿOò?òI=Õ§© Ò¾rdƒ^«§zz "Ûu¿rKB©Q”Ö(T¥u~ÿùe½|‰H˜k¨¹eÙUߧ¼JãXj­y­ZÏÊaÚËgÒ6{ëÛKì+–Žä:d"¥]"µæPdÃ;°/Ä!Yúâ´ä™/²»ÃÎ[<ƒox²AóÂöf>%[[›è7¨…>¨È5:³Ž² دü_žû‹—9N'_D÷u^Â:^¥‰–ñªÞu$r”nYDU¦>g_ð£•8+ìn|ÌÏ E¨i{›¶Íj!+ö÷Æ=mÊÞµº¡²úzúÊÍgT{·.êkjÊ^ ®U,r2¹ŒXΦŒÆ¬×)ÅåËýA”ƒ7º•­ž”õHZ´SÒ¢K‹þÏÒçiQ<ÖŸ—㤴GÒbž’óÇi™Õ+ùYÕ"='-³ZÙK‹üôÌje$-ʱ´¨ÿBµ¨ÏK‹vRZ´#iÑ÷Ór +ñf?.ÍÒAøÐdd¹Þ±ú%/ÎìýA_|´ ~z†×É!Ûr•ÊÆçé¶V•g ±ÎyLzNokGHÊMîåº,”jÊz–†6¢€)…PO ¥×Lò±kjò9<ÜÕ0õ9s’ôaD;¢éÀëu"4t%mÒ>’^ÓNÓ¼Ó,õ™ÜkúÙgˆÏ:<áiJn\¸¡¡éý‡Ü3‘\]\¡{ãGrç8„zö¼|jq´×ÌŸ¿ƒ8ëRmhRÙhsiÑÝáË.—qg‡+e|6ïÀcqžHåÂÛR2¨­èF VKð…RheAù$ØÜÈ9讇¶]rk£ÐzËów£É`6ñŽ( t.” …Aj Ò¤• CXPÊ%j÷ªyß^ÝEgPÙ³ ¼è!ð~] ,.vFEßAÏ Räõ¤.Ü>¬<CZâ &kŸH¹r6¦s¯--hJ虈l*”ËBòÕÄëõØ¡[ÆØþÒÝ“%5R*FížJ´žžv~7gì{Þ”\^@ÏÍÅ]ñ1®¯WÆ>cßö¦är‡C+ †K¥ V¬Ò¨Öâù¿ˆ†ðæ ¼{sZ)jŒVÍíuëŒVËaƒÁFF«´ÚBøåxwå´&S4­‘ÛCÄP-D¼‹êEÆ“3™™ƒ»øîzµÈ(…²ØE@)Ô‚BÉœÙÅB)ÊQP }±ó–R„âðwV²É•*Q‡ù$ }o’»¹«Sœ5éÍvz¬ /)X±í@m𨲠{—0 •½¨Ø€@èÀÔ•7¤'òr÷azôáªõ7PKŽ=û"|s<tiger.he’Ýjã0…¯WO187N6Äп‹$ ¤Y· l³¦5”RJPä±=¬#y¼&-}÷Êv)ÙÝ !t4ó™‘”êSXÝ?Eñ¯(ÚÆë›ð~{+N%ÿ_ˆiUÔ ‚§ŒN)›äÞ‘FŒ6—UÞªb³¼ ¢å*Ü^…7뿲‡’M …‚ær‹é¥—3—Ó hšf¢ºÂÔ:ɱYÐÐo bÊÐz‹n›r!T!« º3L¡¬w)X;oɘÜ:ÿGâü%“Š­ÔUjì~Þ›\œá'1ꄤC«œ¸ÕÁâMô´©øVuùðÇPkMÜòÐïèŽJ„QƒÃÙßÁ_–~o £ÄÁ+ƒYÅð¥J–mîgR­U[þ5iYø»;|;Ê1TôŠ[î¶#«ž¥ria}¯Ë"3Öu¾ßÈ=úCx³ÈµÕàõœ½ QZèœÍôÐgQ,w>ŸNÎ/¾Ÿ¾ÌÄûìøÃÍ÷Ð.PKŽ=ú#68Ѭ tigertab.cppl[[Ëh·q}îù‡ä%qK2iFš@t-4èC)¥uLqp]ÚÒ?ߥ“ðÍfK¾›ÃXßÞ³æ²ÖÚòÿð§oþø_¿ýöóþüÍïöû}úñÇoüð‡ß}ûýþ­O¿®ÿ8ÿéëÚ翵ù¿üõOú÷ÿûç¾ûúëŸ~úôÍwúÏ>ÿ÷wßÿVÓçßìÿâ¿øáßÿãßþKúŠEÿ6þëç¿ÿüéÿ>ýÍ?kúÕ/óúâZ[È}åiÔeþôóçÏ?ÿ ¿|¦Ï_ýüïö¿|ÄÖž85Š“S¬ev ;öqjæ>¤ÍHcÈê#z$§ê `ÍâÒeyÅê±ñujf¹¬58, ö85§fɱ†n™ ±MöXyÚ‚¦ÈÚŒ¹–اêqjÒR✓’)™<6¿NE’¯>Õ#Ëqj—ÔZ¡R£DyäÕ^§¦>³àg—1fOÙ#ÉÕÊ+5:•èûF+P˺B©96—#N´ºöÞ”£ÔjÓGì­3kà ™×äµ<òD+ÔTJÇ3˜ ãàUÞh¥ÖmÞ«QźdêÒY„SèÙcßh1ʆ—¯b)7G+œh%dªH—n6K7¯¬ðFkä2³†YMWÑÔ>"ùD«Ì¨‰KnÒCûFK­/-œcŽ¤±<ÑjŠYÖZꢞW~£•GaÂÓî¿›LÏ+ŸhiÂËwÀEÕ•<|ôÖŠ¥R.1ñô~á-YÚbŠÝÏ<(yì­ÅKx9j4»£Å'ZÚiŽ"+³ tªw¿ÑÊA0 Jq´´¦|DÆ­`šW“Öæµßh­!ŒÙVš©$^ñÒ[%Û´‘×¼ßÍcßh%NÅ“3KŽk<Ѫi™ÄØx3j>ßâ-#‰%jG"uûˆ<ÑMG_¥®%·åUßh…Òæ¬ÆLK¼ ã‰Å°ŒªP3#udã-­-RµœvÆæGd:ÑZi/âƒÀ<¯éØ[9b P& ½×éo•N´FY±%”@¯‰+=žàV¢X†KB,¼²ç5h%Yu))6j‹Ç¾Ñ ½„80,Ò¿ÊãÔ-àD3²Œã±k<öVÄzÃ&H%Wl[{DžhÅΘ­ü¡[JÁ»;½Ñj(·Nµ0/?U.½•Âœ+ÂÖ -9z««4#£ñ‰!'Z“°°5mŠCSÑcÞ*ibÖkìÞÛr¢e`84L8v,îåS[ÞhEÑX~”båFž+¹° ÂÀêK;)^Í+KÞhõîV£Å8ÖäÓM.,£64rVãÔÊ>3äc¼Xœ(EзH=ÑŠ`":'t¥ä«ÇÞb ¹‰¬Rýç뉖 Áh’r‰TÖ#öV5+ sT08<Ѩ 5-Úê5 Go” &fÑÜ‹W–^&a_k‚b¬ýó‹xêV_m+£çÊ\hµºØRosp`Î{ì­©–4-áºÐ²Ù«%Ÿhè{ˆuÐèÁß+¿Ñ"­ /rAm›øʃ…"- !xwç7Z w˜Ûi&䀰š=òDkŽÜÆŒ±”ÜsÎ2ò­l9éЩJ´èÕ’/,£Õ„¥Ydd¤€ÏúF+÷о´@Áš}äê2 ƒá)ƒaŽÚÕ++œpjGF€ˆbøˆ,'ZRBO‚AÄC“÷ay£5FwW$ ”šÃ#O´jM’0ÛfÊx}<Á-ã² b’%XG«\öV Z«rÒÒð¼–7Z-€RδɹWV9ÑÒÙK‡'ð{0øŒJ•¢“Çì[£œhAœØÄS˱ÇÞ¢8"€L;Ñš°µ€¢\AŽ=ö· õ<±‹w¬]XÆ2n` †n)­yì–t-½`ÃjÄœm> íD Ó5u̶ÐQ">‰ìVmmÕ4Q ¹<Þê²·BI¥:u0›wŒ½ÑjµR½í2 ;ˆ6´F-Ðœ¥xmÛ±·´Þæ”ë#W.ê¸Ï XZF+V}£…=Ä!r¦º×#O´X HôÂèÜÔ<öÖ¦îlÒ0…É<Ñ͆*- ù"nûF‹ 9@±DÐ1”yä‰V4‹àîC¢ŽÐzò؃– YÔ9€ô/H¼¨ãÜÓ!ÍC)h[ûF+@;ÕŠÔªæMŽ?"/^F® [V¡¤Àt ¥<öVÍàC{AE[w.^Fo6¤•-„)4<öD|Ñœ‡jÁ#/“p(H~èq±BÅcßhM4IIæ’ŽÃ=¯/c‡`VÌÖMKêÓcuŒ50™zË Ìg=ÑÂ~ïca×cÄ`qz ^†¡ûcÓxâW¼x}Q+ •€á]Vó'8¼ Ã#¢û’o‹Uï‚‹—QÑÓ¨¨P±=ÒcßhQuË=³WËÅ˘_l‘V´Ž½^/# (XP'Ç\HÏzaÁ0ˆhÛ?jsxe^M¬k¤v„dµòãÔ­óHÇ”] ²ßcNˆÕ" Ûe!uþ˜¯áâe@“Oé´P'Ïþˆ}£µTãÜ "¥Gu\/^F!ÚBÛF³ƒÃË ! £˜p_ûĸxq–¶›{ucuï­Ã˨Rilkbĵrö~¹x;û<ÁVÆI>‰/Cu ›‚>Ä@¤òÈÕ…eLê†5“ÁqrM^Y‡—ѯÕ1Ø@4cëþó/^í?0®1¯Àzųux‰c鵩y87/#(¸@ÆÂ0@íxì¡·B.aEI£Ö¾†#pñ2V”1} Z×ò½uxÄXÛS+Fx¼Õ‰VŽ³wFg7cªÃ÷ñáeÔ©Pý13 <òDËt‚a„]3ÚryœúFK*rÀkæ’ÉŸõâe På9¦m }^Æ`Ê*jÁ(`Ÿn/CÜ̵纒F¯ÃË0[¥Xcè((n¼ ãŠÔ–¤ ’O¢ÃË°jšAÛ†kv{<ëe¦ ‚™Öã[V½^/%X±´Rª³Z‘'ZûÝÓ–uaÈí"}€šxµ\¼ŒnQZ½Ê2ÎcßhEÐV°]-sĦÑëõâe´‚§ý¡9HKÞ[‡—±Ì ø&D’d¯‹—AJCZ ÍÄ+ëð2B ©ö¾M’ºóå‘'Z%A cd5°x~œúF«ã80ài˜£Çõâe@D×ÌŒž µ@%zì6 †›Å8Ý#O´@G–ìŠÒÚÇcN8Ð×Ø.BÎùÈÅËÀ» T'*f¤*ËŸõð2—ÜcA%˜•™|º\¼Œ5ã¼²mI]<[‡—Ñ3b{ï`ä«Ö+ëâeLL‹&†R°¶9²‡—æI­¢PáyÙ[se¢J¹®¡Þ‡‡—!Ö½RP ¼âÌáâe€â¯F õ%MÃzdàÐ[ ¹ub¥ ùyñ2ÀXDfyjµú©‡—1CÇaOáy½x µ‡ýyÖn²¼^/cÛÄÑ ŒQ‰éè‘—ÞŠø±s݆˜ò9px ÆF- =“¹xe_¼ › &bÍæš—Wááel×{p)›¨ŒüÈÀ-ŒMÌMlXµ\Äçëéeú¼° ¾PóòQ-|ñ2  1ÿh¯¶Rë#öpž2xnS•BÙ´M<ÑÁgÆ´féÜh@1´!¦K÷ØCo¥ýEƒê³u@ì‘´ H0ÙSÇÀÀàôl^ÆöÆTÆ@ì)òãçŸhAÅ14ì/­#Ùcßh‰‚:+¬hà5pñ2DÉ (¬-"uyìá<µÜUFŽ3A$xäå^FCWíË&#•™‡wìáeP«€$Nàsèâe0V‹BŸ!dÚO=¼ duÑ.û³$Ö²Gžh’’ŒöزÐ|<Á¡Ž×¨2t¤ÍkðâeLÎ ¦ µÓÂþ$ä±o´F,šÖ|βõŒG^¾FÒÔ÷7Ùåïuè-Žub¿ÕÕŠBP{äåû–Ë}Ù4£Ø#öøb‚†…âsfV›ž‹—‘‘PÔw_¦ö؃ÁÇØ(f€[[湺xÂC1W@á8d¢Ç_LHpp턤Y=W/c–*ûþaåÞÁbïuôVL–S¡0y@OûÔ¾ÝË<$䶠Ì‘=¼ŒÒˆ] H[§X¼/^ÆØFººðÕôÈëqç Bw_sÀƒÉ6«‹—2 °†)ˆÁ’êïuÞËØw¢d¬ŽJ\}Ýîed̪†¡•6ú$:¼ŒªqsœLØõ©°çêâeÌÖôÆțΑ=¼Œ©< Z*dÄ£/^FÛ1\!6$Êco^Û¶-$jj\/^FêI{cð]¤õqÛƒ/cXüB¡»5¬ÙÇt»x Ã5ÓLà€˜Ùþu…/cìÛ`#ûƒpé~“‹/^Æþ¶“%Ͻ=ÊðÛA|xc…е(šq’ú-I¾xcÌVÒ ö›k^>¼ ]<—RÂó jë‘‹:®eÒÂÚ¢IžÑcŸP&æÕ‚4m½Uydà ‘ª\iÖ³ßTåó^Æ^›PÒÔ¬ß4à‹—1zY«@Ã×€eà·•ùð2:„æ—¢éýrñ2BÁ*mþ‚Ýá_Løð20²©£kAHc ~Û„/^µ™¡øÁ_ÐõÁ2/#@…Ku‘àßøâeLˆË`åèšÞ×#[ËX`åk²½b¯›—‰ò—k9¶oì>²uÜ'ÄP+a¡¦I¸ú÷X¾x%ƒ<@–ŒÍ¶›ßãáÃËc `B…2%ú­3¾x“e!”gc¿…͇—‘J- "@{ˆÃüv_¼ŒºÆ¾^ž Aç|œúF‹pVයŽPÌ¿ôóÅˈ(SPxTkÙ×}^ÆÚŽ¡51‰jË~/„/^F¢kÆè)ð»º|z(¨±7wëþÅ„íÆ2Š¡·Y=¨?”ôáeŒÁp3Èù¾Qôà/£fà5È ¦“ß)e;o¦°{’Wçx°·‹—±¿h´… ›™åGìñ} {hÐ’´:µÿ?|ñ2:IßmÔä_YÙÎoÇX@¶¿´¯‰eóx« '”˜£ ±CE üÆ:^F¯%ÉyGUî\?^¼ ìŒA¨t¶ÁäŽZ<¼ ;ep±>»Ÿ/^Fiæ†ÝÀÂ?N=öõ0Áʃ ›oÇñâeHÍj£%¨s!zœzôÖ$&pRØöѽâxñ2z€èEùͦ Ç{x5ÇPgœ µöGd¹(NìHÍuRIÄòÈÖ1 ÷GfÍj¡×ÙÝMŠ/# KA|,Kí{Üþ oà äCˆË}Âxñ2OÀù ‹Jw óRŽê[à;)©3×79-Cë§gítyZø_Y¢ŠIO«âV«"(SÿÈ÷˜hÆ MÀû—9©(Ð2Rpv{r¼½-ßcÒD[V20Üe>x ´Œy+Â>ƒEË{dZ1y-°M{&péu«,P edÙˆ@Ûêíüñp÷e$ݱΛµ #[h½KvW#ó|®ê”§9v7N‰´î) ´ ÛB€‰Kæ—¦@˨ˆUÀûíì•MQ$ŠØ±ì²×xÌuåsU÷¶¨â%h¥ñY÷Zzûç÷©µ/«ò’Ó2„ÆV›fâ<—y-(Ð2°/‡^ŽU)¦Tùþ­0†ÍýÔÙjh9È×e!Û#%ÞϸHxA5^;‚Ç‹#kÑ%Ð2TSíjëx»ËhrZ^>&UÏHÖ•F–Á­àHäÜŒìi89-£]¤ $¯¤Å02¯0qÔ)©ªý+KÚZW1AT?Ìj*žÒÍÃB–Á·k‘qtÕ—«qnrZF™Ðñ¼ªÑ˜ÌÿJ‘–ѵC}WåS•œ– Å£ð9(ï™ß…jäPcOÒ~Œ™›õœ’×2ÀŠ›ÚšßÈë™JG‘–q‰20”  «ò’ï1AÞ®üJoÉœ\h»Ú Ûšæg­CàC[¨’fµ*Z¶óX+Ó£zŪVä´Œ•×‘—ŸšÀ0ìlZFÞH®kØìãdn rZF:i3qÉϺ|H"å‰i_€;ÈáæÍ!ïË-eœ•wWÅ¿°=h’û:««YÀÌ|’$¾7²`é«6>és¯A52¯jrpåÝúYëÞVË¡0-Äã‘Íë@–±Ûºwµ0²Ë1Ç ùºµ츅}ÓêgeT²”[œÿI6¿ 9-ãð}{¬¼w1U™¢-†¢6OÓ Éi“.rð¹Ð#«³S eŒÃ ½c‚–¥±ÍIE^Ëx¢L€ìì™ -C«;O›÷ΔÇÙZWé?÷‚‘œ{ÖãbÞ ´ $7|yíæmQ´Sà´Œ-«´’´º°ÍŸ«½‘s#a³ì”ð†,9-ã>ÙÄ,ì6eŸzÔ‰SÍ|ïÃqæç#§eàùlµŠ>>×z¤©Gž§w‘âh`wɧzNNËè¯í5pRN›\Ûçó¾µ– î| ´ŒÙ‰È ä”ý¹—·pds¯Mæá52ZÆ’zÝ1Þ4;-ã¶Á«½œJ³ªZFâËøb™@æ¬k€–ÁKq1Ó  xsñpäËØ%¼¸“Ô>^]vZ¥!½àé"Ù²úZÆ·FÎÊ'`±õ&²Ó2úÞôFSDÂã¥ÏÊÁk?LAŒÑ¦…!Ÿ§å;‚xe üœh¤ÍËà@Ëx}½ª[BÔëÚZ§ê¾„µ_lÀtÌkÁѼŒ8‘²'bæ° ;-c5€ÜÚ{ÃÉ|.¶2˜À :Þí,kt~÷sÎEÃçñÆ6Ü;ÏO‡2ZFªàoëä]¹q?[딧Ÿ›tg.{›>ß*PžŽnCQM/Á|šì´ í ëšÜôù›jÀ‘/ã&íºØȇ²9Øû2êÒ.¼APÌíYZFmuueÓÚ]¬{ˆ–ñæ¸8óZŠìcXEœ-ãä^èn°ÝVrµŽGvZÆ™ª‘”—$©[/ZÆœŠK± Imvs±Ó2Š ¬«cÛ~>?@ðK˯€ã“mbû\Y A*}œ‡LQÿV> À±ï—xš—Œ–´‚× $ÒÆÖø¬ P@-3@ñÏwc}Fì}8z/YÓ§7’-)V_Vé8Ÿ;ð>x@mà&ußåk}yõ˜¤–nÈDžÍŸ:7;-ƒŸ˜¡ÔÀË Ïço ¤L*€£Úª³Í€`òA™Ѻ––²Xß1ZƨéÒÙž2Ts_²Ó2ê@•A ÔmŸh06â¹M˜ÖK˾ÇdÔª“*L&óZp e̬ÅÛ=Õ×›uê3ûÞH„«\˜ûºÃüYõ˜ )•‹½Ëv¶œ–‘ðŠ~º1^—Íëà@ËX+5ÄÕ”OÕ­ð¹ªsÑ<vZè~×Ýòyëåå@Ëxå7 ¨pZy‰Í¦c§e0ïûó#¾¼[™-#㜖”@¼iƒÚ~uZÆxúuøÑl}7ó^r e¼´OÔ.¬‚Âú<-—·¶Œ*NB8†Ö§Ï–J ÙvÚwóµ™Pì´Œ¹"Iq6ë…¨Q‰Ö­\Aä&oë…¨N˘|5Ǩÿj±•ÊЙh ñg¿m]YÕiõì!j}“[ë§×¬F¾Œt.˜è£ÜðóvW¯eà<-zçà@[ Œ£í„{;›ÖkV–1RNsdðó–k?W xÜ“ÌÇT-Qäár‚¸Yì^–qû"urm<3{¯–š½ÜèÜȵš|Ížk/?ÈPÑZæw©ÑìOsW6i§5­T–1uB+²ÀÐGæNª–±îFlm!Ôûy[NËØH@Èò` Pl›ù2Zšs‚GæÕÏd‹ê´ŒÃ…Ò7éˆoÝØyzLîÛyžDµã>ûÅi`2€nYe~æÔhö§ÌÇà¡9d«mT§e”ŒT´ÎÞ³u‡ªQ âê¾ ±³a+Z¤ú“1ˆR× 6?÷)Ox§sŸÓ´æû¬® 1t’a¢¼û.†tk e€ßJiÚ$y,oUïËÕA†jVÉ<$5Ð2´Ò,pÁB=ò]â5=äÃôS ÍY]C_F«È誖7>Vá«~^è˜vóŽŒïñ©,Ô@ËHÚí·.`Õ&½Ÿ§åPÆx ©¸"ã¿ñùü@ƒß”šŽÈ¬x#}¾—sžrð•’Z"Ú7oZÆ]úÛ s²ðŸµNËè@x¯ƒœ {‘9ÿj e ¤Lœ£¢öÐc{NË8Ú•öÃÚ æfÑ-Ð26¾<F:J¦kW¯e¤špbþ˜Û¤ZlI:>KÊm×fuZPÀ •hø& ËÏU_Æجs€Zê¢N=[ë¼Îí*€pàR·™JV-#i» kúe$‹/cœz²ßzmÜÏU”¡Uø¥îÄ„cŽk'ÆiçÇŒ‡ t ÁNA e¬jÚKY€ËîýÜ«{[£bñ(JLúg¾v ´Œ®Öï &5t4™ÕªÓ2X_ Q”÷/¨–qNùè<˜¾Å g9-ã ¶‰¬ PÌw™»¿F³?ÕHÉ´f9©ú·ªÓ2ËU´nÐ>SŽj eL„ë½À88kåäó½<&Ôþø" a¾ßüùVª‹‡DQ€ëü¬u(CGìŒ LŽDpóç ó2ä0éÊ„ˆq­k :-cƒðkç˜Býÿ+-#ËEÿânu˜ê´ŒÜû\97Bê泺Z2ü,oô=’¢yɪ÷eÜ„˜ “6Ê[—O ´Œúh¥ºðpù§1£ê´ŒÀ4Ë)hõ•÷¹j µÅ á­Ý¾ŒñU§eä}nV|"L×®–¡Æ×Ó± øÒç¹:UW'Œ<#Á½”¬P-c<ÑÁágö]˜úX–!Ä)ñQ×ÙëÆ÷jü„À¥>Ç3ŸU‚ªÓ2®vî(Êz`;Ý:‚j e¼“H©zçæ¯Þ—¡)SGÁoµfºK ´Œ>µÏHÊ¢¤S2ítwïy’7îPûuU§¢­ "!’©Ž[Zßéó\Ýä ²[æàpÀÖ7R£y¤xgñ¤l®ƒZÆëG[‚ÒÎrf¥ÏU«ï²y' ,ì­Ï¯2H e4Ð¥yIìdÝϸHBBI´zÏŸÏ\4Ä«N0îwõ7:l­óêÞ %efd ´ŒÂˆ?Øœl ‘ÓΡŸ—57ë@Ë@º¾™«CIµ=[ë»ÄW½rƺÀ™×\½he¶ÛëÀ+Ëó³Ö)OW›úÄ«œÞçóU7§ÖïNHF:3÷ó½\5²ž«mߌG>þ, ´Œvñ¾&Á ~V‹§e´ö›‰×Ô׈ØcÙ8Ð2”ÃwÁDS§Ú.tZÆm³ä¤ƒ‚ñå(V†=&ÀÄiËÔ‡xŸµnz¿ ø ˆ4ëÏÙ~ ´Œ£^iÐuêÊçÄk¢£µEç¤ÞqÌÍ'-rV3PSßØ\ù;uPœ–qzZóà°Ò1?£D=&áW«/ãX•U|I©}2 Ä70ó:H e´B‡_É0YEXœ–±‘^'(úC>ÚÇ:i%Ð2°o¾ã;A’ÿ\Õõoi?^AÆñÏÊÁ·[«Ž¤o=ñg¦ª8-㦥½|³P·îP ´ >tAF ¶Ö±cîÈVav-µÙʨÇD[ndp&ë=§eüµu-ɶä4pÞ;aæ¿­`äï ‚ÀŒ]°w2oWÕH|Ï}^•Ë¶2ÓRjpC/ÆA‰g:¯Ž–QîŠÿ[J+‚šÍË@x_Àα\pz­NmâUÛ•\ª "áìxêÚÒ¬–‘Ù4€~c/Ì­Ù&ÍóËèt:#îz맫V3Z;!Œ†X¨¦¼Ï x5ýkŸ\ع¡#|fÀè„À}Åx}Yµ2±‰Ww\ pÓ'è5þ™[™Ù™‡ j~WVw´ æ1⥰þR”­µÝhÀm·Ò„äŽôé°caxž¼` g~žÀøe`5e­Îý~F:|+Wf_·ˆób4­¼îFËØóæ`yÄ’QŸ§îh1 ûf¼YXO«\ºÕ2ëm/¢§¼Õ´&«;ZÆ qKy)#¯OïÐnµŒs%Ó;IÍ]½º§eÜSÓ=/Í%ì cS+¨é£Uƒ‡æ5wGË %Ý.6x ZµÐ–‘k{–…°-5jv}w´Œ°‡±±Oà©êGÔ–QŸ3I§cmíùóVN^†Œû¸eœ´Ò©-£²‚3$a¢,0ÁçYUwíÀ\åUC‹Wnó2ÒÎq'&Ÿiåw÷jLhÖ+­ØhŠt¬á[¬oÈg¥˜U´J½'¯~kµÀ eÓeãóF'ÔžoÒ ùÐONGzî&ˆ½®U¤HÓèn´ ÁKm|ðxâ>E«Òº£eô±!^b½cÍŸ_µÕv/²¶å Ö“¶Ï[9uLJAMs u¬Á„x„ „Ì”ÃÇgª;ZÆÄ÷Ç¡ë3³Özu£eÐï03Mð&AëÊr´ ðL¢6|*DÕªÞÝhoϵNžMô±ûŒtˆl?†zØÃQÇV[õ„úÃ!€ «kÀÑ2[¢Ö8f~õ3¦’ucËVÖKàqkýÌ«çÊ…=›Fü*‹zÓu£eô2C] à-ﻵ"©{~-bsÇZ@òÕüþnµŒ÷¤ãH)öê Ö-„ c­0ÍË\gËz^Á‰Å&1/Ž¢îUÝÓ2Zã•-Â2ëÂÔo­[ïÏÓi‹J€°fvGËÞßw$œÊ±}~Õæê& v§ùä5w¯I¾ïž±Æ^kZyÝ–ÁFyë=fjÞXÕ…£;ZFa+lü¿pëXSµNÆ©€ðÅ´¢¾;ZÆc‘Õ¬j¥åÝhÒ„°ÑåÄ#h}Aw´Œ/Ó½&ÍÏÔj»n´ŒÆ 6ÅŒðX¹Š]¼“¾˜|x¤•òŠÖît›—ÁÒ†X7â(žúNvGËh¬ x#Z¸_ùÌ«Qž^ft³Õ*Z·Ñ½>& Åcð6¨Aj-m7ZÆzF RAùq|ëjq´Œ;×ܬ0L¶BÓSÛh¼´l èeGu]쎖Q€Z±ªéòž˜¡c­ òÙy<´úãr®# ž6ÈÀOlN=¦ÖÐu£eà·0’ª™M|?såé„¥Q§ï!-žu¬É¬ÆIU*Hïæõí;9ZPþ¬Ô±¨~#ŒíÉZ™"ˆ =Ÿæ¿vGËÀ.˜ÌÀž`èù|‘Ñ2j"cÆG£²fÈuG˘¼^J5W°½›5ç¨w{Ó]W±dÀ±îmGË@ÌÔøa¹²÷†Ž5ìø"°€“¾ÅŠ3ÍÓì^É}•7@‹«ªÝh¸íð‚ul½;û}à+ ø ÷ Ýæeì7X72j ÷h¾Mw´ŒÓÀÈÊzìÁ¶§ÞÛu£e4öN=•T6‚c}þ~Á㜚{µµ¨ÓiÖW7ZŹA£ÎÃp?#L<ò^]“‰ÀAÕÇ>lÎS;EÞ SùŒt0aœÙFéŒI‘¦Ñ2Ààñ´€àõÒ¿:Z¾îF,?C>c ß*}§Jšˆ0Oo!º£e0bÆ]c…K¤i´ ,|im• ÎÛšæt//£ºàÄ~ŒÌ˜Õ±NM?B€Æb{½OŒw´ŒV^À“î}˜³¬9ûÝhàyíÍ$`°3ͽ쎖qi·œh²4ßçWM á}À5¡ƒÞÉÏ/#¬Q ÷-€œª{ ëý¹è´‡1Ég¤×Û.¼‰Hçn[Çš¯•cX°i|´·áh»ƒ¿ôúèõ–?ÕKÃhÅížxë@ô(á3ÒA8+ÏÂ꼫‡¥ºÇ°Z›Èã$áfÓ,é¸ o©Z °Ó?O`ül‹»ô%Üž6-ã§áÍ›\NS=k-ã®ËD—Ð &­kf÷p´Œx6;ƒ?DõОޅ [cRN¸D‹H½YŽ–q-`XCýru¬ùZ€ll½“¸ü«Ÿ·ò*‚Ê[5bcƒìTåÃÖ˜´. Œÿðòr¦Ï¼:_‹½¯v óÁ¯:Öö1A|Ÿ8ä_L³hvÿp´ ħ.>@Q?z#=Œ–qö5Žvö˜Ì:Òq`?â{¬™ÕU!FË`7–l?ULz#=-H«æ­"Äé ؼ œl`9÷Tüc}fÀã[@£´æ†ßFË`öwj­J͈QÏGË`gö¥Ì–›TE¥Ãh5 ¼…‘|‹Þš Ï/#¬Y™T hL¤O`´ öÛ‰–`þ5ÿu8ZF@ØH ¾oO@U*‡Ñ2ð™?Û>£ 0b+GË‚€¨9À¥j4Ãh8±ãâE'@!õóVÎ×Êüå-ÌÀqûÌV·l¥] ÷Eóe\Ð"0ùQ7bxÑ,ð‘m<Ž¼Áàpn½9Ž–^RYº°kS­Ÿ±æî8̹FI8²1SZ¿5-#ðŠÊ668ö¹îX[c"¢qo)3Ï¥7§ÃÑ2°.g_ER`½óy{™mHVß,¸Ô¯åùeÔôØÑí!´­ü0Z†¤Î°jˆ%x?ÏêT²N°ZtÑ:£a´ŒY° @ðñ?I>î*ÃÑ2(ç\° p&~nw†Ñ2 B<5{sß–´&k¸~;–˜ƒ|VÖ¼âQíMh³_Ù£(êMÔp´ ¡Û6VLÀ‚yšo2Œ–‘ß `õî½Y?¿Ã·XÉv:83ëÕ|—a´ ,•›ävZÝ?såì-¬’{y¿‡Ïç˜Ûȉ™_ô;¤'ÞGË"–²Aâ±µÞç¾`-+»8߬Æö~:Ò¹ßb?à ºõ¶Ì¦7ÂÃæe8öŸœ€TKt½z=YÁ¡i èJ5×`-ã‚p÷!lP"ú¼•³·@w+N &,Ÿ¤uÃháµ×XG½#ûxèðò2 W¦,VGíÏlÙ*ñrº:»³£ÉïH¯ xîÂJ ‰r´’u-#÷+Fýö‹í 5QÃÑ2èÁÝRûé[ 6©HÏhc­õ@uKGnZg4-€”yL+±‡Ž5µ‘<6 ͆|žÕÙ[»`ÁÌYÈû©v¶Æ´0½´™¢ˆóèó«Nf5[2¿ñ_x½7Ö/ƒZjš˜ªÙÏÑléáõdMù'éiï£wœÃh¯yÜNHL2§¿×Ç¡‡K`÷Wúç Ì =áÖ™ù„üõK^“p„(—ÇÐ[³1l<LIùÒä•Ï³:ìXr  ´ùyë0^/ƦP~ƒÖš GË=ƒ®‰~ýS‘3¬_6TŸG) :Wž÷ç+XÆôèÛ8á´Ök-cMI+ À˘3ê}Áð´Œ}aåš4ÃбF'|ÂW@Ø Þ§ûÅÑ2^œ,ñqf­^6/¿VÚÂ+؆ªÁ//ãR!cq¨,r$k|b5ÜØ1ØfóóVßê‡ ·€vâÓõb{²’Ã.pˆóÓùH¼“„µ/ûµ×{µnClIœµÎƒ÷Á—lZ•&Ž–ö&?¦œ§h]šXïOÐ<D?î—!h†š8ZF é,WmÛA+.Åj«S Ìøeüíz#-^OV¶§_x+|…£cm ¢¬äŸ¾ÈÔ“t¤sÓÏ¢O0ƒ†×jï:Ö  l-–/áQérÿ‹ÞÄÑ2ˆWÏ‹é)/IýŒ5_ Ôqà?t+mŸÎïâhtÑL@Ë{®O±5&çí²xµƒ`°4;JÜ>&Ø°1³ìµœ«·¼b´ŒBÔX=ukyDâåeäÚ›&Á3gô3Ö¸÷O@rL¸¼P5Ö‘ŽÏhOãp´zIŒ–±˜£,rá ÒŠ$ñz²â´”#ý"â,Ÿ_µ™ÕùGý™{4ûúéhˆ‚½6ìÄ. lHW¡íÉŠcìü\tÊYWkÄÑ2Îl_tnê¼-ã= û@n’ô§#¯Å¶ )!ºµEClknLZïÀ" 3ýÓÁA-ƒ¾ umÎ{€ t-£°3Ã` ×¿Öd‰£e„v‚Ì,‹%àg}fËÞô6æ…êsÜzÅóˈ·íY&¾ÔˆOs:Åh4mÊ¥¥±wƒfpˆWc‚9í›­T«,t¶Œ–QæC<ù¦»ñßÏH¯×‚HÁJÙÌÙZo(FË(øL—W̘±±4—M¼ž¬yl ÀW¬Ø®•×b´ *nØqyW¼ÛìŸp²?#3¦7ø±°îóó ÌIˆc¸Öø±è=¨kÀÑ2hƒ4ß9xŠ?µ3b´  ¼™A vk,“Õ𴌴#›3‡ãîõyƒàÇæaqF‰tÓçW ~cæëj‰Þ¶:Öht±5€DŽ¨¾9âho\lƒˆ“ãæþ4CLŒ–‘y¬àtß#„Ò4§U-c„x}»ø—:ˆ‰Ñ2"¨mÍ2cÄ‚‰š"Ž–Q#@N0^§¦¢¹1bý2êêQvò~¥kí8Z{•1r’^6:Õ±ÖŸð²³^äµíZêC"Ž–ßOIà¨gél-ƒž1l4»@ ߧŠ8ZÆ«A¨¨`5f´Ÿ'0ìø­Jƒú6ëè^ÎpPaIý98ˆ>¿jîŽWe½cÀ±æV_ ñz²âAaöÈ딩~bµŒ›ÂåcºÅúÔ¾‹£e¼p3PWš©*FËàZãikÖ‘¶ºUˆ£eìyÀ‡Ø´îŒzÖg¬é–¶V)Øß4ƒŸW+‚ÄÑ2–ÔwQyª[„ ›«‹ÝZZÏHVÔO<¿ ð<œS9"„ëÚ6Zƺiò®§pŒÓ½åhB ŽÎ¡»®¨;Ÿ-c¼~œ(|ÓXBGz~ðc¬ˆ¿ ö£ÆÏce0«¼Ü×çY“ðu6V@™Ø‘Zu+F˨ë”þ€†XÝz¾:ZFi‘FPç<5]Œ–p R0 [çÇYC-c·râñ’BÈš})FË,îý4™ôdÿ߈Áóþ|f¦CÒ¿U.k”§JGþKåƒ]¢EG:q ±x•ðx-¿öýŒµ5&‘V/¨÷7#û­.ôëÅî7h¿•V4áûÿs 7îÃÝUfþu¶ÀHÇ=.yuÚûoö'ÆzÞŸø óVPóü[÷Œ‘^“8V.,ù’qäó¬¦Ú.·¢yów¨R ^É[ ¯9œm˜Ù¢c &Ì… л¾…õ 8ZÆh`/75ÁÙÍŒEknúo=l1¼k¼:Ž–QÎ->Ù’T»£`lµ™ª¿¾ÞÛÖ^”cœœÒfÌVñ•¹dF#`4J²0H†ažÃGØP¦¤äIb$#äëç„„e/¯_˜Ê”ns–Ù¶*I^L1ˆ ¡î²Œ+uJw?J˜¥ƒ‚EãqÁ(IW}Èr¤#Y:à ¥U¥Î,××ŃbywºãëŽc9[ôA†_ËOË€$œð†°¸‡Oo¢‘2/sw&”]}Ÿ¿¨ƒC?•—_ÒïöX§5Et·óì¼øœ#¾Á5xI¡%œ¿¢N¤Y‚²ßâ{†ë[žoÝú s¦×]£Ãbšm@”ëaysdFP°’’ÊÅz˜È%kŽü¬œíLú?që‡|ÅPéWÇ À|0ŒÚC þð¬Óa¹¦2©ÿ gØüyá Ë£ÝRćzš\lÿGðd˩Öį‰ -¶‹ì1HÖ¨ì:®^Åú‚Øû±ý«)'O Ôï¤P +r É’„Çg\HcÕ(œGrÕÆd^‡Sa÷ýŸÇQjP,Ö +¿“ù˜Úm·jê÷0@÷L«¼-NéÍÿMïÈC`u °‰ß¡ÈÖ4…rj"p47¤nΤª±3ÁÙë¹Òú PKŽ=Ç…â trdlocal.h}RÑjã0|ö~Å^%9Jûî”Ç1MÀuLlrôI8öÚçJFVÒšÒ~{¥8MR.woÚÙÝ™aG^Š‚Jô—Oqºˆc–.§áÂ÷B6ƒipA{0à"¯·áU.EÉ«ÛÍ•KK–Ζ7M˜·òæ¡7 ƒóñgÞæçÃ3/a¿çÑat×…·¢å• k)*L7Š²"”yVÏß×ÔLa@uK'êûFïÇn7¿Ž4ˆý¡ŽéÒˆ‚—‘÷$±çl<Ì£¡¯ºFË8ÜÝýÀžÉø1ÛØj©²Š ¯³¶=]h†ç"I?….6ÛuÍsŒ¤öeÓeëšà zÐÇÒÓkNæRX!ù"pÝ]¢Ú ‚ÓëJ¸ 3µTà¼s¤v 64µÚx.\·ÕŠ‹êeC*³r7È…F²›£18ïcçoÝ¡í}\ÆÁÙI^`Bz•Õ[î«Ÿ;û¶[}ùðÕáÞYkßešÜozÇ\ð™qûƒµtÊ&ˆ¦pˆÌÜ ÿóåúX?PK‘= ðÙ²ès trunhash.h¥T]o›@|öýŠM,U¸²’>›(’ë¸u¥„"›TÊ°˜SÝGRjù¿—/_À¡’›¾ÁíÎÎ0ÌÞ˜Æ<Âë'×û·~tVóÍÊ_‘qY kdLyÈt„pŠ"WŒn¯’KBœùÃrãÎKÿóòë7ÇZTÅÌu'„„,ÍØ* Ì ×[FC¨Þ<pg" Í8Ù“¦6#£çŒFð˜GB+̸T°-ÂGÊs­¦ éoô0ä;•L` #Í%ÝqŒ€rwt‡RmÊ.k ~/PiÁá“}hÇ{Bó°$ˆ¾P0«!ˆj¤aˆÌ †e›eìø‹žÀAüýQg«A ¥ŒƒMÈõõE#PèPÇ—Ú˜‡,Ò á…ªd0†¢ÿM±ÈRÀ_T*Êwq$ Óœ•¢à¦qÜ»m­7jkÇ]gþ‡A°åA’N¡çxÇ(2Í õ“ÔJÒÉ´|z­Y§~Ïïú ãfùÜXyy 4ˆ÷ y›‚vþß'µáZ—gPVØWz®Ì‰ à¹ù6#Z@ÛÔVíWø{÷À¨9ÁVû7¦â2Ò»”íœ>ç½1„ä‚>—}U‚k¤}âQψzU‘cu%áæí–À‡Û~o³³v÷2\:w啉<¢1ùPKŽ=ÿ7…ÓÒ×+ ttmac.cpp•ZmoÛ8þlÿ nØ•[»Õ›ßôC’º‰Û46éÝÞõÚB–˜D°-’ÜĹëýöŠE‰ªÚÎÃá33j,½}Kò|„o‡2 iœç4!A‘‡UÒˆÄ Éï)yØ.VqH¢Í:ÉbG>ÑŸðåú!“»ívÿ'ájQrðÞ¿¹?ÜBM´Ž³BÒ½<þ<»¾:>ý8™Í/­Ót÷o®®zÝîÏM‘››Ïǧ?N‚Œ~IÂ{.itMóOtg…›$Ëa-9%¯¶MAÖ'Û$‹ï’bá9YÒÝŠ&wù}ŸpåË`Mÿ¬¶ô*ˆÓŒüÞëþ§Û9Îœƒ8Ž`Š‹` hï¨Ûí¬é:|ØYëËÂFiìÓ쟳˳›sPêœnÒ”†ù,‰â ¡YVj¿|ȺÝÎ<‰s ¾ýÒðäcleëQ|G³ü«ý¼#â¯!ÿ ¦…#IÍ©©*5§¦æÖÔÆ•š[Sójj“JÍ«©ù5µi¥æÓó»I·Iä4ú'ÁÊâ¼2ˆR?ÓyñQ8à*ˆ.‚,?YmÂ¥Uü CVrÕ}Å´6·Ö9 ÿ±I£›Ýí!ˆ‚<`‘àŸ†ð•¼É Ä ðÞÍOâüt³Mò‹ ¤^×ièžÇV1ñM$Ùí&][¥ãªÕåé–J°Ï%¹+û·Q9âÉ#ETâ[b1Ûä·wäýülv}s=ÿ׬×í€3;Ùcœ‡÷\D…¬BLˆ3:dßk±-Í <^)âly%Ôm@Ý:ÔfÐÜ““ÀÖØb€š’SWò %—+-R,%¾Î@!jLØ”¹™§‘1è ÛÜðÛ·äK%Ê$Ë)ì 7ÉááŸ0E²-Þ˜#¢·Áv•óIòûtóHæÉOV—ŽÓ»íš&¹u m$É9Ë—b;‘€Ü÷:ÖùNvp=÷Äð™4ü C ó;±vߟ{½Jé\Uú/ùßNÒ˜K̨Á4Oßwò4KM˜,U«]ÚÄ®þpˆý4 &îx:~¹¨ä.ÈG4šÒEàÈrä“[g±£P–û ¦Cï6ò©,²ùíÀ,èH–˜<ô£Èq}Y>fv£±íÑ[O–O@>`dDkëœ]¹/kÝKÙzUæ?“Ké_}²ØlVdŸÿrÚëí"…ÚY·}åq¸>‰ú„ö ø7ë“e¯Óùw·°qk½Œ³´~‚kyT ½#é&_}ˆŸhd½¬£“eL2•P«39ö—^UŒVWW…+pAWWu«ý*g)zÜùrÂv«Ñ¿q–E æ*`Ÿûå¨ÑëáÛ‰º‚ÝQaNṮ‚ ñ1~·°Å}A( Šã%’Å©B%AQû·œ¼L* ø¤’€O* ø¤’€Ÿ("ÒúZGÿõ•Øß "ðui³Z#ŠH4@pÀ×Dø$\굘¿€à1€«(‰Â>ˆÖBzÈ“=H`¼é1L÷ =A〞2€gNÚ±ÑÀéI;8=i‡EšŒÌI;êV=iÇGÝŠ®EZBœ¡¡—krj&ÎÐPû%kÐÆz¢ ¡vÊP+€¶P;:@[~OÍIs¿ŽÍIóM=4'Í“ilNšW2wÒStIH¤‡¨—Ò.‡¶üÞƒ´ƒ§Bz"{IBœ£¬½’„[3qŽæ·]®I´±éH¨…›@[¨} -¿§æ¤¹_÷ MDu5%í¢Ú*ÙÄœ4Á‡¡C"í•'µ!ižßhj´Zå’$Äe픫™˜·Õ®ÐÆÚ×£Ú.“I´…Zk¡-¿‡æ¤¹_§æ¤ù¦žìAÚC-´U²}HËÜ0%=,7„i¤÷%Mp éÊ¡íÐ*³UB|l¿ÿfðk&>¶ÕC µ€°ž–{T´…z¤´å÷dÒnY] I;â†Æ´ã£^j«d®9i¾ƒ¼=HOÊ-gJÚA×–ßsÒžKm‡V™ ÖÊ/õþr¨°vUÜ×(€rV$÷— @^J ’û|Ð\àÖûK€}¾)i ¤E~’®úKSÒ# 'íìéªÏ7%-îLIÛ(!-~o1%-úü¡rË„°ýåH9µ´¬«¾F ù-úK€°}¾@ò[”c€ä·èó IWý¥!éªÏ7$]õ—†¤«>ßtÕ_šFÚE- ‘Ý¢i¤§hj ‘Æ“!íÊqhtzÖ"Ôc¥ÕÒ³PkQ]ÂZôù a-úK€‘3%=Bm¡öÍIWý¥)iÑç›’ý¥)iå€lj]R[%óö í£É‡ödÒŸÊô¬E9Q~*k9ªµ„µhµÂZÜŠ*¤~‹þR õÛAH¨E÷gJÚF- ¤q mù=5']õ—¦¤=ÔBzŠZh«dÃ=HÛh¶"‘®%_ãQ‡žµè/§Ê£Ž–£z¨ ÷'â†F´ÝOu$ÔjÙÔ8$Ô¢¿4$]õù¦¤GhÚòÛ3']õ—¦‘ö÷Œtõ{‹)i倿·˜’vd@ñP} L7ðpBÜÄÑÞQ)gü.ç4 ¿$¥›µ» W3Q,nEH`‘φ>Ð ÈöcTŠ(L€ÆD¸,WÓ@0ð£áŽe=! VèùlÉf;³gE~”¡\ˆ„)5:|7¼ìà âì*O’¹jKæs¹ŠC`ð7º¸Ðïþ­×žZ»»4xmtøfÐ|qI\ÏAÝ÷BÎt±é‰ƒelÂh!°Gh·<ä1•Q¬üåL$€üËJÜÑ€cè2‚Å*blDx«úQítq *c±ÎÙ¿b¿åÁçþeD‹($™j&ngNn¢{]›(³2bÐìèïãO£a[5Õ”+§ª¨–˜ª¢N ýþ¾^ãŽZœÕp„ `…o‡ ­ Ê:$ å*mçn÷ˆ&¼Û5ó€×NÖ™\Ÿóc¶ÉüŒ‡:5†·V¥XëxÒEV\¥q%X6#©&öÜç7*„:0ÅÓð6|ÓÉøtxuôéjH¤Ó´'*Ã/ãiUë¢6mmcU›—ÚTÚèW­Ôˆ1Y5†9C» *þÄu ©ÿp±V®˜ñ¸3ée¸VW@ \»Ày9®™ãªûy W«ˆÔ\E4'FÝÖÿ¡h?Z3¬6ºhÖ—7ná'HAÛ:«‚R»Uµ[¨½ªÚ+Ô­ª¹×ÙÜEÂßNâcÈfœÍñâpù–oHšÈtƒ÷¸¾Jxüöa*|ƒwóVÎò¬GtÁ§ÁŠŸS'ðBçy˜ ³Dµðq‹3í@ WLykH¡^M·x“ÜÎ'‡’©öÚ¨n¡ºm+ê.9; "6ï§ì¨ ¢ëž²žrù1Mƒœ½¹º:^G'oG×ï/N†º ;SŽ-b; ½0Ý<ïïÄ+zÙÉFG[ý6^6<²N ªÚDdÅÒZçÆ)ãH¯ÅšãŒ!¢áj úGA¼f ¾¸žÅÁ´1-ä†;1ÜiëãmþÕÖ]ü+ÉgÄ«g1TCGU>÷j 5öꊿ—â¥j³1Võ]ª«ÓÈÖ“íýð»X£Y¶2m|äBQ’±¸Æ–¯£OCç¸u$^U{’ã\ç8·Äy&Î3p^‰k™¸–Ó·¹D6ó™yꜤ ùÁE-‚|pW‹°\×"ãÆÚå©Þ“§¶ž<µùä©î“§zêÔâØáèøâýÇÑ (?6ü•±SŸGv6jí™âZ›Ø(uc ßLó1D ¡­ÞO! ‡î–µ´è®ŽÓ®fª¬©Å·~÷•óØ:>ª³Ð#Hv„‘FïQˆŠ1ÿ$*p…Ž“áÏÓQd‚ÙožàÆ7ðK˜É3,¸#1 5c¯2“§òtÚ½GaFâ–%7KŽ€ž38gCÿ|%³ãÀ™2àÃÐ4÷Ücß]±VhxùÅŸO}1ÿ4=ÏÎçVMÛ)ƒ§®,׶Ñ×À²]˪QF¢4T•@Ö°m†Õ‡¶eÄÉÚX­Iÿƒ7óûCo1ðÞ'õ¡Ø&Šû~Csº/ÐÂ’J¤D¡ù†¯¨ c¶â¨’tQ‚Îè-C6£?¡ûú´çWWXP¼Œà=l/€Ý¨Pß:èÈAÇ- Ê/yÊi¼¬;«"VÚp&"!Èže¦~tÃUa<Á1ÔèN€JCÕ<§jçÞºï˜|]ÔÅ(°z[ •JÚ®»Ùlš ¦MÂcWÌ^ÅT.\"›¡Š£ZÁÒË7]÷,a)‹¢õ–»°¯4«H“Ĉ“4fÒæ̵ãÙ+6™.®æýÁ…‡X·D1Ž“¨[ŽÓ³*šhl[•ÊNô‘‘ÐHÌ@é×w][n ;• ´ÍA)“ô†A€(S(ÊDpòþšV^á(S!ÑË ˆîb%\Q˜`¹(.‚ã êùî¶ ÊÏöúQÀµ–]>âøwŠG©Ìï×­o×­7§ß:¿_ç|q ¯O ˆÆdOÎ<Ó¬ßÝÐA'G=/ÖçA¶f28©qæ¹ýY[‘’´Zè§ô' eŸŸ¹ÈB=‘²Ìæ”K¶os¤“Ÿyª²sc‡úkb#ø¯‰í©mfÈ•žýe8êz“,ëñtâ˜.öÌb’þMgÜFÞÁM×Ø3ËÞÍD.<óÕnx [9Ò#ø¯°•#”†¨7éñ , +ëPKÛ{TB‘©ã6(þ¾ validat1.cppì=kWÛH²ŸáWt˜s2vb¿0„sŒ,ˆoŒáb 3;;ÇG–ÚX‹-y%™Çdøï·ªºõ´$ @†LîfG‘««º«ªëÕÝ’òî»Ô&¦¡yÕ²>›±Uv嘞Ç-¦Y›M4Ì´˜7æl6NLöTÈð†}æ&kkæòòO¦¥Oæg+3}\¯Äà#ÓâL9þíèäðèh öZ»]uÐk¨ý£–¢>«­O¬!™î"qóë8`¨¹¼^[„5qØÔ6’}éC}ªéq˜±1 ®%p’9z‚ÍÑI”µûjdºã8´~¥ÝÄ!®6âNtn»^i¬9 á´¤ÿÎ5‡'`\›$m&§9IqÍÿX†Æ„Þ•½(Ë·’Œ\˜³ÿhúÅ‚ º6©%¥˜òÉÄLL€í:Öyô'X×Dóâé³¹°=²å™SÀÙ‰@¦|j;7Qˆ úu¸6æšeÎv¢–-Ý„Æ\>íwzû¡1çfæÙGGÅ…×3ŠËËCÛž°3ÙCk2)ÀÛŽ=?—¿,/d¦¹îö w½>÷<Ó:w ÅËKô°?8îíŠìõkBý°,ý®•c¥^‹¶Ç›[Æ„;yíÜƵìÆþÇÖbãñÜB¶Ûš§íwVð××=Ûqß ÔËÞµ·’Ùç‰yÎì!;GêA;»ýH³´©–Ýþyl:“¨=G¡ZJv''‰æ$»ŸÚ{9ímµŸÝ¹bÎÆÜ9ÀH–Ôi«­œIií©Ç9 TòlåXiä‘æØ®Œv9Š;œÖn²1öû'¹Övü)Gu­\b 9íŸ:GÿÓRrúï«­nžnš9NÔ:Ιócls4'oo"çêNiusf^‘a8§ mâæ5Û.‡:¿ÈF9Ëõ+E9ȱŒ¼F%µßÜ8ĵëô0”½87’dI7ØÍ™éöÇùß³éç8¼:Ù‡—c>ín'/æôr¢E2VR÷4gZ¡q'7µç8Ö¯'ǹôÇÚдrš?GÛÞ½K­ùtßžWÌË:ªr”×Xë嵶s'¯ßÙïų…9b¼/./-éöÜc[[låßTÌct ‘¯þm­@o|âò8â¡=s_1Ö³=¦%hÊD³¼äpoîXrÄ[YªÄKXy¶™çÌ9’FB@f>Q¹ ýË®lǨ×Øpå—>»¸…×W%æšr{T¸*– ‡ëJþ«Áuø¯±Rb¢¯+¶½Í*­Ô+µJµ Úø•Ùª@Ö麓XZ¨½v§Õ‹Ê/Ýd Øø)©œ½V§«¶EãÒ’”l#²e˜£(öoöÜa°Zã¢ÆtÙIÎO³„*—nÅ °(ËU`¸^i,[#ÏCó<•ad-m$½ÅMX:‘~˜e;©ªHð#ùó,[ÝîáçÁi¯Õ«WÛƒvë¤5h)ŠÚÝxœ¬ªn÷÷jåèëKµTƒ?uùï«·„…¼)H#{S,ødoëE9 uñK 61Ä*!~n6`V €_£Ià¾XL ˜zÀ»ì+—Í-ðås ÖÌàÐÓt»n9êéª>M£cçÚ%(ÞÒmǬÃîÎ'ž›©bi.‹œÞGç4Á&ĺÝ(³Ï& ÒsLÛ³Y¦dÒòÄLH§Æ $­V‹YÖ«t CÄä0+á7ð5ùç g¿Ú$’Ú³r(Ê›Îæ®^#¢Æ³s'Jr‡àlîš "Úxvîä@Iîr—Œ)ŸÛÕÚÆ u#â~ÓâÜ×6„Y6ŸöåP Óð@†4çA,a¢o$dL y{­“Ι:h£ÜQ¡— ÒIJc±3Ù—Ÿ/žUã`ø¨$ñJ,)tR_PÜWî`ôÒ¢øÑn ¿_©Ÿ.씣ÓNl*†Æš{pð+ˆÿ‘nh§ÆoèôûªhÁ»Xü®‰&¼K4õպ߷a£é5 ¡д<¦Cêá]Ö} ÷¹§DA… ~*9ØDá•dú¯¿Ø+ÉK±ˆ¿ >g€%‘<>Ê8‚ãÐV[#ð+`оâÎá¨',‹4¤dé5ÌÈDû“ çWþ&ÌCØH¿ƒV1a+ýŽ´ÒlD›´·Ô~¯´”€B1ÄPº§Ý( 1©²•~xbb%B ú!fë4ð Ó;9îôú¥Ð¼{xØ$ÑB‹ÎG¯äÒ#6q}{ʙ©kæŠztÛ™çå1Vð“;Ží”;šp Šâ‘yÍLN ˜±§3XQ—W—–´¡íxdÝ·9« 4kM+Œ!w3ÏÙ:†ÁìioŽ€}nqGƒ•ûs¬ó ¢ìv•O¸a }FÜsnØÜv†ˆ{‹_±Ý‰­_€¨ÇÖyñF:ÍÓǬ ø¨ŽÃ^Ù—Û¸±‹sè`ÁüÓ=CÆðνq=>e3Ǿ4 (´†rDæ Ì"Iع/JtµÔrí¦oZ ¼u Ê߇bU%uá pUb§`ƒƒÖ¯%áu%†B¶i_Ýv ØÇ6B‚~ ½Ón·TOƾç–+ªÁ‰ z¶§M¶+%6áÖ¹7Þ® n¾ rÄÉ[¢‡¥žW@…x~÷ŽMëÌkZ‡as×úh´ àÕ¶ýÞ}™¡ÎëÑ\ÛÒ†°äЦö¡=’² $…n¯Æ`[¬@L‰ˆ…¡Æ…û †)jy³q«“£èU©ÖÇ™ZBU•æÓY¡J/‰þÞBí ~Vc‚±Uæ!ü釺L? }É؇ÖïG¿…ðG¡Î@MÂÛQS„ðLpHÃiÐ$cˆƒ•²»Ï|¬‚ób˜.©Ø›¸aàxeëg¢ÐÜE“„µßÜš9Ü€Å!Π3cî`+žÊóÓ¶Èêì+'¢(£é¿Ò\Ð땘æpvÅq¢'“›À ~‘È#Óq=ƯÇ0 G#ñkϱg7¸XáÎ%é-nt¤fß*b3æs"XYœóä¤Óì" èÞW¬KÆ:Õ¬¡RŒÓ¹ãáIih¦8xIöàBíZç Upù!hñ†]96ééÙX•hIL‹lØ©5"]¦í‚ÕŠŽ|»M7Ü„åúÚ3¤ù BÃD-F ;&wÜÈcy$‚…>Zž‡¹Ó8(áŽlgJVY(®î@ÀÐιj¢X’E¸u±ºs‚z;š{]â s¶pœgtæ¤w†úêÀ¬ 6¤èÔ„M+†WÌâ9Ôåð†µÕ½nëD*ë6mÓ°g?")Aå}aÎfPùÑè²fTiÖ2 ÷{ÈÄ=Û~ódl…ƒ>O>®Vð%*d™Ÿï²\Ñ÷3š®àeZì=f.ßh¥(Äî3e­Â` y¡9ÚeïfÆÑŽµ¹gSéIÅb<Þì0m6„aYŸ ¢Åé§I7PÌŠ‡k6——.MÇ›C*\ëQbQ‡u6$>ª±Rq?ñ›@!nˆŒl°¿R-ŸZÀP(ÐhÓõÍ¿IÃ'kóû݈0 3|Jƒm ‘UXÚÐM{GÞì™×Ü8Fº1}°Mÿa£L5e‘bº® ­lWŠÐãt ~Ä_¿ˆ¿6ÕÍM0³Öi÷dðIý­«ööO>RìXºc¾HÀ(xõ;ÿR?$É'Ã'óÙù€5Žç]Xv€4U”¨tX¤ˆxïéJë±ÒcB°€ý{Nõ™æ˜X(~ÝlçP§Ox)îä¦î6…ÀK`¿H2`$ÕP¢‡‚ø (äMŒâøð´×î×ÆŠúôf”è;àB,aZ´ÈO‰§˜²%/qkz­C6ÝFÜIÖ|ì5¬Jðü"aÞ|6á˜ü*×#øm.|ä× PÛ€<‰f6"ე€1ûPòís}÷†žy…,8 :/GfÌG'áÐG*0µ›äX .D‰I°]HÇÊ¢i&e1¹zò—´ëcî9&¿D·‡ÎB ««²<òQ÷¡d¢y\,†CLV‚ë–PE y8c¸y q£Fc£ÂXÝ9rl<„¢nüÑqVņ>ð¼Cõ'aadöÊߎ‡oÃGì>6|;1<àÏ\ÀÁ6±ñ×_>$ŸYÊ ÷Bé/Üõg0(x Ôë/~ùÆpå°é—fø‹ÆF ‹ÁìÙ‹pb6B²š2¡wæÒ„u\²°òk‚‰Çônð¼ 3œZ£ÉÜ£±n¡ÿíÄk$žhâx'O:3èAä‚J!r/ý ! H†ky¦R¾U zYÄüKÛ4è}”N!!¸à½t(,Ñ%9ÛÙûG‰ ý»Äù-3è@Tî®glnêÖ7¨ýðhXô%7ŠåboXÝòØ1u”<1ª,®Åê@:”Øf…ßô”Œ'¥÷— ²Ï·oÅKƒFj±i1­¾‡ûDÁœˆ¥Iä`M^bÌüâ]jQ2ABÁj)f››þ ã¼}®îÃî‹þ·¯°WÛqã IÉEÛBÒœ+BvbÞ1Ú$óGú4ÑeØë‡@}Oñùa^ô$I”_h¢•þ†è›±™æÀ´äa«wRË—¸»±7#duèï²F¸s%3eè”~xìR1¦#TêF$–hèÛlbµ í÷—å>ÿLgÔ¨ðüãjÑ NÄP„ ”*è†L w¼˜á«qè-‰ßò'mä­îD&4<–ˆ=Í‹ Š¬LÝ uç&(Ö™[˜et¿€ê ±' ³¥xÜ>|gp÷Ë^‰n@‰ù K”XæÅeÕKY«¦-à3Ì´%Xx÷ÃÌ·S€X'¹*f<÷¥¶ÕZ ¯õñüªþZ¨Ú-ÏÍ´‘´¢øI!ä$DÀt«%VM>±÷ˆ±ëic׿ÁØ8! cð^cçœÈáê³Bÿf:ÅŠRc³×0u 0ƒü#VÆBÒ÷:gû/ ¼Ü9‹»ôZF\NTØHD9iÙˆCÔÄͨšñøµ÷{­Òبü2:‹¯ÍíêfnÉçš"ßl×d¤âXÉö bGBÊ ¢ $óOa…p”Lü(âo¯ù[k¦Õ¼¤$ÅËan,}ìØêBöi¤£qȽÜBßfý“öAë×B~ü4‹a ååˆÀJ²lKë"Rq£rüc¿0ɾŠ¤"1W%¶€ž*¦iê64>‘ƒ“q7ö¢D"þúñ ã°x),ˆEÑÌ òïôŒ!>²Yª\×êpi¬Á¥¹—÷pцpÑ ¸ðÑmœÜ¼ô©«5h¯7à²Ö„Ëú\ÞWò©I ¢<ZéÙWx†ŽG[xèÁÐJñéÝvezc”̓ÄRU@]À'G>G82[ÃášÈñzÝÿ¹Þ(jùi®EÀµiDj3èµôŠºiêþ¥VAIb©ƒŠU©Ë"ØÒö[²V©_Ä©ðȱ§l¯sÔgU*+]q17„¾Ð\@ߣ¬Üµ^+¯^ßoàµaЕî«k%AÒ$„Ú:éºAW˜&¼'ä:^Gï% ü¬SokU¼rz&˜nl÷õ[rUÙ YÔkpK›KÝÜŒè R- Ö¢ëÖ¨å„7".1q·¹Ù;µÚíNo¿qd±ŠvüÅ/ì $*Zˆ é Ô‡¬OÉ9A;þXÀiì/Ow‹BñÛ¨»öWê®ýõºËÓR°¼iö©ugð4ÝÝ~­©khº yÒÆk[ ý¢¶‹×½^ו4 òU8†p¿ Ñ(!/zO÷•=Ÿ¦IÐúzèg ¢ßòûlâe¯)ÜHÙUàFAþ\ 4q%J̲¡[À4‘t­L}¦ºÖ#ôùݺê3t¯}&Ô"KaiK¤‚§f ;eP/ʳËLïb‰{ñ‚òÛ·À•s7{|Œ5—¥Ñ؆<€xçŸ]‘§‘$ ¡qJßÍVX¨4æžámý[GŸ—OŽ>)}öÓúßT^v˜ÈQÓÎÉÖʵÝAuªå‡D£Óµ©ëשâ6¨mý%–‡=uÐêµÿRûßG¥`[|U³ŒÕ?¹c»éIîe• wêøå……»tì‡ômŸµŸÁâÿËïœxrP𞜽AŽ¶&®ä\ífèÐ{tß®¼Dw»Ëͪ¯k}7.õ¹Ò].ôUÅ/ááV,ó®lqäè2÷J›Í “XšUNúÏ”b¿&]>$-‡þ 2üM . Áhæz\£=Õ(§˜VÝf*í«po¿.±,Ž{t(qçÌßØo'&çj‘Cmì…©S¡ûurCE½ý!è” ð×5¹ËE˜®gO8ŽºñÇc•@å>÷ú²Ï‚ßùúrýþËg¢Ór‰mˆ±ðYß ¾ããi5ŽoÊOáùTôÃý¿þ }>G_‹5lÂòS¶¥!‡íá1U…N¡ð¤©w ždíÑñ”Z¢óÛÂS©÷Ú@*(_Á›Zx‡¤{tX׸:Ä£c8<·ª×ý“¼ ¤§žj5™÷v¼„¸—qþ’§4‹Wÿ!¹n/ãLå'3`ã^›¼÷:A.§ßûÔ882¾#§¥{ö»ªâ††>ŽÑùzµá{;G6ª8Æúèk}UùG¸cacuhzlĹ1Ôô‹âúç×ë腹肎^ˆÏ.ðõÿÍr&Õ1uüν$<1‡0™ÇJ¤L½kDŽÅ£)³ŽOuŒ °†5ÄàøHJü¨|\Ãd 9…¤_CÒº©.n8üSæaNÊ<üSæáËH™ÈÆã¼-{Y(êSFÞÆüóC±/#vwöh×TýÇ‚MU<Ô ÷bZ´tÜ£…¢Bô Å?”ãˆóHÂب„}‹û]ÚËiŠ…æšL•'Ç?^Ù*ŸÖG¹³óc–bþÉõkT1/!)FùyD1»Þ\kÔkU–öXäŠL[ä‰uáskáÞJ<·.v[èÌêZÔ¿Œ `:ë÷Û¨fT(ƒc;´Íµx›OÓ4â­’¦§&Ú’ÅôTÓ«iutµZ—ùž˜7D ¢®š‘ b)š.ž‚Lé¼vÏH't'â"v°…|´_½!†!ˆZ‹œµ|Ä|‡‰b!xQî£æŽåÛ¢Eúø‘åpQÔt§)‘¾ þxòMO)î8í@J#CF#”Ðȑϸtµ¨tµ'•®Íw@?bnµ@Æ”⟧5%×ÄR‚h!¸¦}Ãl1à‘BPŠÌ~Éö ™D/Rf,ˆ2dV¾Ffå;YÉ‘Yµ>Læ8ÑË”#Õ‚ÌïêÄÿɈÄ{|ü‹jø¯çÜýú–äîÁ¯1!Ñ7˜ðwæ[jI©å?…‘› —›þÙž»_ü^á]¯tå|÷b‹x|Š½ÔåâjÙ(5CÍàgÕïÿFÙS R­=ý4úßP÷auPÉd!×[éßhIX-Ào³Ž^»Ûbñ `2ÔKä+'áç0r0ðÃùÍw ’ö± üðò×!C¾ûç¿.F/KóшëžyÉéíáÅofø¯GÁQš…FúRC¡L8y"§~i#‡ þÍ šÛv”Ÿ¸´Å§øG&g©ßäðÙ‹’ãNöžèKùZ|¦ovD,á~ßêÈ5Ž;¿Úq/êìïwÄÿ‘3úç£0po¨êcÍÁoUôª%Ãõl¼ŽlC/Ûy]3Þ…øÈBÀÉ:Ò‰–.xúõ{áx§cë{ñœÆ‚4ÕGñA¢ø]àXw]þ¯½këjäÆÖÏ'¿Â‹—@'ÑýÒ+9³êŠÀ€ òP¶ËiºéîLC:d²æ¿ÏÖV©ìÂ6Tƒa^Èi«$íû§’´KZ&JÕnÙY÷g„»kŽ êZ ÇÁ}6»Xö(.P¶Aª>Æõ¾ jQ8õN½Ü‰$q×¢X,÷=”“ï›fYÂ4ÿ ¦ïg¿êmì² Zsî˜.Ý7³ÿ8¹ÆŽ¿!n¸ÐÅ‚×WçnßêÜ(Â99 ^U?_ûç›ÿ{ióÒæ¥ÍK›—6/m^Ú¼´yióÒfY›e¯ÅîUÖ}SMµ¬ÄL"÷Þê^”) ÙI˜Ó„§æQ( ì\²:‰· i…÷êk]%ŠùJ6$C™ ¶14¤8iGGòp:Vªýh\•QmÆ&$S™"(ÏÔÜ"8Ú3…Ñ•ý‘™ÒÁ :V¡P$X«ãìidê芸N¡±M ‚ž…´CïcH‡7bqùÅãÓ£­¼<è¹X‰Ñà”¼–qX§FŠ*ò›?‰ƒaX…P0da‰mŠ*)=î ç" Ë£½Ó šV­—­b§9™Ò»"H†@ãžI°8³SÜA…û8F‘ÁÄSc° T‹tÐ’®'‰$T€¬é> ðL+¿ž„e%S»'ÊË´g¦:ù ãLy¼Æµ kLùƨAß@°Äˆ4ŽUãéˆQÈ:-XX‘C.¥û—åW×™šŽ ¨ÄfÌtÅ.ˆ ¹°è*hë±a1®™AH™È€Zø“`ùøAC¡ ó£ýübÔ8XõÆ+ì-CO¶ô(LlB, ì2Ôº·Že¬P<®ÉÔg³M|Ì‘¼c…Ôç´E@Yüiª˜+†ð2$÷¢þ½ûñ`.Ï€¬YÖ ,#䔵?¡iÐ\Xˆ4³p1?4@¡ VýÈYáuðÜÃ!ÃÆÆ»ŠÉ{ Ž0ìEL; ñnTàõ&D:8®×¦C§Ã2öÀ ˜4͵—gT¿LÚiPêc%#^׸þ‡ Gåë”lt°’ж“阅+xçE0±-‚(È º1ñ¸Sˆ0<ã[=H݇?*¯Kôkðý¿÷ÀUJô7ÿ6D‚9¨÷ v䃡ÇÁeqðF/Bøž”S:s~pÁ°FG!>4­_™Ìô£†Õ(€ò¢aiàÁ¿óŽ®ÍÈT€×´¨ÙkZÞÔ÷³t. ÷}·¿Rh£qià ,Þ¿yãv/þ¿S|‰¥†xçÅ­ãp]»V[³®ë™+¦T×ÝIýå~ø;~\ƒz'Ëk½î÷AêÊþ'Önnº…zÕ¦Ç\ƒj»mÙfÕÌNU•{ÒÿÜFr‡Ìfž,Û»SV:++].«¯ê·Kn5™“·Úù¾³ ÿ‡ËJ-+›å…yYñÚ waIµ é=ž@ë·UÜñ³ß}·Q®ÚPžt^m¾\ü‚â…}ø9rû×ËÍ-7Ÿ•›·—›·’›7åæ«’›?Zn1+·h/·h%·hÊ-V%·h#÷=9+rAΊ\EΊ|tzÙ]=Àäl.ü¼•ÅÓ™MeÚX$¹Z ¹Z…äê)òË–æÚÓMM¨¦&f“™Ø*Î(¿› ÏL³¥ïtýݨ7 €+|¼ |(>_=«8¶gUä~/÷± £ÜG²éü9H>Ôzï>Ž‹òrªõ(ëo¬ªþž*Šø©ÊžØAÚ’~GiKú‡©H÷~ÿ¬ç,ëmy\:2W+Ê«®o®×Z;ÚáŸ&Woç¾÷åw°kßÑ—çs°ŠõYMWEOì^í?sµ#üP,ê—Ÿ+?^ϧ¿ûò$ÀûŽžÑE*Ö©×¾h¹‹ÈUXªᦋˆç#ÜtÞÚE€?ÂHxÐÊIÚæ‹ûÏqðÞ½ñÓ_kÅp4.'¿¾½x÷þòÃÇO¿ýëóÕõï_þ¸ùóßîz²ÁÛOîëÏíOo?v6‹Ë뿯ý'Üìòªúbô§¿ü¥k¯6ÖâŸÿ1È·ú]hY—ßLÊó›ñèüfXœßXs~£Õùç7œßP2Ó¡OPnôèk ×ñ=M %åç7”Þ¤4*–xΆç7Ú0¨7ŠFL)>þi~™æ#ã¹_K3ÔýÜo©!nÎÈÂ4ñ¯™ ~ k~éT~­Æ/€êÕõçêT7wÄ,_¨öC5Ótíó‚=k®…¹;¥»ª3Mß^ÄTãJVLAµÛL…» gÉΰvw6÷Lý$nßÊÜ®R·CýoÏ×¾uÿ÷ü‡d-Xï³Þ»ק÷l¬sòú¶àw~ `ÚuçÛ¥‰ßæv†÷ÂoóLî÷ŸËrPü9‡ üõ :}üØÁÿ(þ|ºÆ÷‘µ*kýñØæ?ú‡sâ»ÂÇKÿ맫맓Þñ8+¹ûÝþ“¹nÔÛ™gp¥+xcìÿt‚#—¡Ò´=‰‚Áç_YÚp_Sf h5£Qqu %_žèê;Ç't?«‘ªhÑë¯èê¹–tÉÿ†®\BvÞÄL>dZÝ21”<¥‰¡ûÛ"CÑ"Cñ U}?ÝðBüÜtÃûðÝû¦Lÿú½ø\Σ¯þ°Ÿ/ÅSÁvßÀ?,iý;[ûÛQ²þ«+PÁû‹ßÞ£÷O¥‚ŠÑ†ª²öjÈ¢Ÿ«qÀ_çìnN®¾Ã]ì‚„M|L“À,LDðé~˜}!BžŸÏÐ’!3H|ê ¦LMB†Õa3~RFħ_ ara½ÅŽ‰?˜t-0ãDfgŽgÎ~ %3w*<÷Føküá2þb»Iõ]ÑôF<;½Poˆwçñ¸™ ž¢CÉôœ‰çÃh<õf„}Ž±¼Äž'¤ælzi¢'êŸñGñþ,ÈY¿K´ò9WñÇæÜçª,.ý•Õ.›;½%úÔ¸@Ó=žªjhîÅë˜3àvý¼~ñ¢×ÊÕvä~hî^‡ZØã´æ¢ûGIØ lìVf¼ÀKÁ N *~ªk2+²ý²|¿Ž'=V-¨Óñ,G¸X?¼“ßïª ë×lc~+pfj5i%Ûw•^ÔþTÍë©6ý{½ïè¦QÕnäÆÌ|äîeŠâªL¿œÕ¹þoˆé2)¹KÓð¼V46¸p »¸µFñ6¬kŒáá7k„JáDIÑÄK"“„¤$#9%”RF9TRE55ÔÒˆÆ4¡)ÍhΣŒ1ΓL1½öÍ3̲ˆÅ,a)ËXÎ §œqΗ\qÍ ·<â1OxÊ3ž "¨`‚ !¤PB #¬ˆD,‘ŠLäÐ¥$’J&¹RJ%µ4ÒÊHÆ2‘©Ìd®ˆ¢Š)®„’J)­Œ²*R±JTª2•k¢©fšk¡¥VÚq©¶:Ò±Ntª3b¨a†a¤QFc¬‰Ll“šÌä–Xj™åVXi•ÕÖXk#ÛĦ6³ŽËˆD4bD$#éÈD6Š¢8J¢4Ê¢<&1YÌcËXÅ:6±£8Ž“8³8OHB–ðD$2Q‰ã21‰M¢$N’$M²$OIJS–òT¤2U©NMjÓ(Ó$MÓ,Í3’ÑŒe<™ÌT¦3“Ù,Êâ,ÉÒ,Ë—95«ä"Åå yns`.‡Þólí–» ÁK9›õ€‰eÑ ’h;ÞÊû,Ý:ˆÕVœdý㤿s¸—3–fûñi7Ò)ëE[ÛI¶w”ìlvóhp4Øá{ùà,1{ñ!°´¹Åa8;ÝT*=:8”ݾ9V=måq¶y˜ä[<ôvv¶÷73q|ÔÛ‰·N²ìœìæ§ ßÝÞ?ag;fW÷7vœB—{‡G§{\níç'›§2Ýßçgg‘Ú=:ØÝ}|Ö‹ÕÙÀHÕ;±] êïÄl;ÞÛì›lë8ìm2ªþÑæöv7ÏN Ë#±Ë7÷ÄñÁÁ¶ìì é‹|KgƒÓãÞN¾}²s"øîþÁ‰a»éÞÉñé‘ûûšmêݳ^®Ï„Uqÿ a½do÷ð´ ]ò4S'GfŸu÷ì`óPìnë퓃Sa÷öOO¥<>ÐúÌFª{xÐåÝ\Écs(z;ºwz åYϤÌæÊÌ™ìõL—C—vWƒ“öÌ"C*}w›±G!ZK ñÇ |8D ‡xÏ!… €¹Ú0!•çƒH…€´Ò@¼24*4D”VX?Ü( ‘)è ÞeE¤-1Äà¸9€´I]èk+RI€‰ ¢ž‹ 圖kI„à„ÅÒa•Cªb@ \HAÐrà,È✧4Œ¹ØÊðÐa@‡âT‡)@A¢…â€&ðG)iA¥ ¾¹³‚8…V¹¢¸ÖŒDŠ Í)ôp&˜6€8iœ(!}—œ+ â'zã\Òe,Tiè>´g%à¨H(À9ª\K‘ªÈ*ÀàÔ¥(c.]—Ž±D%uRi‡s™ˆ8i2<® ð•k*r€‡ƒâž‚ŽSÀ<ÊÀœì£,ÖZ;!b@>êלiÁµ²•$7ZpŠåZƒY <¼–À6X„|áL$:)(!ב32P¼¤– `¡˜¾`XRþlY@`–+0=¨)Qzh›rÉbLÜ:|æhqÐ 8P'°šÎ#‰ÁA¡Ò XÉÁ#8‹I´vë=+Fÿ¾ã! Oû‡Á¯®ïÎoó¶àÌ»é¶Àz8/³SíaIxë[Ÿ9­ðÕÆt¬­ƒ§EÕîÁW­ÍÖÒì8öW€/[þ],C5+™Êð5ŒÏHüX‡ÈÏŒKmLÑÇj¡¥2ˆççá6ñíï1K!VdœJžGÙG‰`Ÿj.\ýlg­[ƒUCÜ[Ïm9%VMNLß]˜õ/·ã׈·B›‚¤ílz÷’RÞif‹VÔ¡üu»3½l¡ß·Î>*.ÙS-:V2ÝZiwEOœ©ÑŽ°jlÃSÒz;<)>”——Åœ±Âƒ'1Ö¨êü©Vˆ«îK¦UÙrsÑ•¤M´¥ÝLœx^ÚÍ܉&í»#»¸¼šw,½ÛOÖf@ãά°+×—Ï [@þÓUù¡øøûûy“{ÙhÇEèn'Ç»Q2Ç„+\ ý/ŠÑ2ÒI²;G9ÊúƒòÕ>,£½¹„öfÚ3mØNçÚå¦_½Y»µêx'g¿Vœ}ßÙ-Þ—ûÅgðmd¯Ö÷àoÞº.ûÿ.qLué &áh+Ñ ÞF#_MW‰W”@„ÏÖœyP²25<è¿PKÚ{TBHâ'æÍX validat2.cppíÆ}Gýå=£c)kÝé(k· Ò‡Ëp—ž/¦—.Þõzxq: ‰ üP…‹‚—þìãw" -„ÇKß—Û‚”„°C7ðb#C/ýŒ€‚?ClÃËÀâB Œ¬ÏÆ AEl .v˜(/AtÝDLýþˆñ÷W“_ˆòžýö““ÚT\M:QвhGqFgÁl)¦Ú‘2é›ç’`Âöìë»ï¤o¸ù‹é$3:ÿ’ZÃî«×î@‚¿‡"@’ߌÛ"–ä_Ÿ+O}Fàòø1ÌýœFBÓO2i‹[ˆ¾SùÊ?Øoˆ»Œ w5ûõýÓ‚7‡ÓLÏ1¥d•i¶Emu»ÚÁ¤ èá4WPs³Ý´v¨¿}ÔÉ_sÔcš®â9“â¾ûcÈÁ´Ó,þË£®°âÚw˜H:4üLãh±¦•Ú#fz³ˆ«ëP{âMʒƶð“ò €yë XÅ‘7•Û'9çÓ…ïM1™¶;ùIX ôþýwÀ‰>ýë Rž“ÌvÒzWÊ‹" –bÜ£Mïšw‘ÝÛ­”B¯hoå!ôh| Ëßç’JÖ˜½;ážRÎWfæ8óÖù(Îuz#·QÎ|áPéC ¢œqFUË î’‚HiN°¡džq—ÚÛ©Ëò°ƒ‚[‡[æ¸AyX?ÎA~Á°Ÿ©ó?©MpCƒ°¸¿`þUðl•§v4‘r_¸ ÁÔöüiî Ò÷’"ÖŽû½á]”ÞwxÆùO¯_w$¥æ"U‡99X%mr/fu/®Û—f¹ ÉjšiöŇOPÍÆ/gÛ$eãðå®-sº'QÂÂKŸ±Äí…˜Ÿ—ç,@‰tQ ÁvmÄcIf«ÛÜ×o™Ò'àlHî*n´97ŽƾMÖ};dzr­wÍ"Ü95çH¾yß%)•Ó$¸"ë)gJw^´ý*‹8ÆŒ’0>t¶¬Æž ZÞÐ8¥ë”Ÿ~þ[D™Ò„lב—SX丸FY‹À.ÈŸ`¾…ÌÛFmpè„+C "¥ôÊ8 «Ò(À;Ò^:…lµZŸeÈ‚5ûa,—9§T cà.”›£†¯f?…³lYÊΖSú½ë^Ç”Îè<Íý}³kÀ¿ Ù\ÄüâdçD^ìÍ(L›dë¤ÑÚå¥yI‘„±b>îe̲ÃÊeN·äÿåD!8ð#ÃNÇjTV>iìªÓé‘©Œ¿¢%*ÐI¶t¢_„ùF8Œ¼(®S“‰¢"Û  œ‡Ùû.å;ñéu4G v2ÂdÎæÿÓ2$©@ª\’{Þ7™FŒvYLå0J½¤,–Ún·ïç-8 é^×@™ÄÔ¯*[U¨yöJĤ ‘ÖŠ&Ò|‘JôãÊ›îêÀ©V&#¨`r-¢Dw•Þ.†hØ,¶B>ärmÀ7XŹ\Sår­Qè×[‚Š ¿TÀö¡70 |Ê¿P󂮈û€Ã™ÐGÔœ ürʃ^ùj€T¯rY‘"{d²‘|{ð±üŒŠØ–Ð Š>P0Ph×Ó*P6ðƒš'¾€£*¥£!¸þ˜=²DIäÖ[ؼÔ{'ž¡ïºÕc4§Ÿ¤—tͶ:4fï¨÷áô¼b<î^~èÕ[Õ¸:ì°è`Ò‘üŒü4qV¾,PYìØ~ê* ¶¼fŽÀ< BFOé\f¿ÚÌ3Ë'(bŠ—Ž[øØÔóGz¨ÄÎ%aª‚l0Øæü–é"Ó*?Ãà&ª¬îÕ´ùðèë+T9Û«ï?.ŸdýOë·qÞµy ™Å²3LUˆ¾o†ÁLqÇÅD)Ç6fV ²82kšOÂ(gp°#Yæg™VŒÕ³7]wôlü²û½ôýéé¦`•YÁ¤²Šù‚rÉ’H-'`¬·1Jú<:ˆœ:FqÈÄ+åqn¾°AC<¢mbCt|"®tUŒúpoc6€>jpú,RÛŒ‡ ‚sËÐcbLr‡X`¨þ 1“¬§ ÊyvR-í“Ïáz9eé‚/äUyú”CÇö<;aTKÚ/<ºÓ&å=0ÔDUe¢˜¡šœ±íp•,‡+¯X\µRf3DeÌ€§?{Âã"ýÇ]QÉÿÈùx2Z¥r&Iö9/’âùµìlד.ñguÚ銲¼Ý7ïÊTV~3ÿ°É‹Þ~Þ¾9yÙ‚N$°n@œƒ:lt{î'Sl¸äL—_ûuÄ3Ž‹É$„禫u*a-opEëˆGVè²Û™l¥#W°²8­€"wn{v”iÆF‰äƃ×|z ÅÊS£Æ‡F¿ÿ.ÉMO¾yn·K‡¬LÕP¹Ô+t)4·(c`T–ȉ"í>‚Ýþ°$‹yƒ—kòÁ˃–ä%‡ž”\9¼Ù“…ø>˜„7ò¤]lvœ ‡˜xë’Ÿýøó†èÐö%²Ï>Þ$<²ØŠøû¬£A×?õ¯šÿùe1]!dɽÊp¾t4þïíE“Ðü…j¬Ó\ÊR÷êÁ%øR=Üé ¬ÞPD´ ÉÆfôéÆÊm”¤Óëà…› ˆùÀûò$(÷áâtŸÅø>AxWÉ #|æ:[®ÀíjŽüˆ×f¤±wKsDf™Aoáñzá…[À÷,Å-v|Þ¯-Ãv‡³×¯ÜÍÂXÖúCN#zÈÐ1þÏ*‹ÚÊàåýÛ‡ï³LU9$gw˜ëPÄRâ€?Ø r*”Kô"^¬–Å¡¹t½Äîëe~ÈK¯±†|Œ§s•\¬{› Âìûóÿ©2©R¾^n³Íîäœê~‡ËA;þ}<ïübÃíÎ/¾’Ï•\nE·÷9ÜùÛ žŠSt‘1‹l–ŽwF‚;?Aß3?W ¹Y•È`˜/Žïá‹• ½º+6ëRqb˜'øîx3îÊ•Ú‘Ðsè禔= QËagïN_¬±ÆÝŠÕd “·—MÄ´o×Y’M–þa<Ë´Uàʶ긔SYTË0ÏÃÊ*ÉJE ÍCÄF¨¨…)•À»XÍ3©‹MÖÏì€(A5NÒ5jp}5_M§çÖØÑ:>ÄHšéîX<5-Ýî5ïŸóñÞ9ía1wH¢Ö•cPÜÁU`+T£;0 ³È7oR—[Oqj(•4¸!ÍÖ$Ø$оѻ¼n\{¿<}áâ;Ù½øΖÞÀhk¬®ö7µJäØ×Ê¥>BÍÃÖEÇ[W@ gp˜ž;W@%€mK û¯€ö þ¾‹·ù@ [¿úôÅ÷þ:œEîãñ³Ñx|Ñ‘6ÜBÌß&¨¯8ùíDZÛgq#â5—/ÞmŽå»/™Âñ§FìâݾÑÚ€h©ÒvuûH1Ÿ<ª½8]Í^,¦á'–^_ ,º¿ÄøÂíþ™^åWœ6– RÉÊ*ͱÇ=Ð"žÔwðýÑæî½X4wû…ºâñÁ¦ËwÇçêéiBƒ¥êXå+—2váö*dŽ_;‰²ò_¾¸€Æä‡ÏGˆ[YªóûÚ¦ ÷å4åˆÝäÍ«ŒÃ“ão¥îöaµ†òÖœ—UElƒÉÝk%  —™Õx™ ›@Þb¥³®CÏ>Þ6ƒ1ivíW6.6Qv[lBï<¶Øoî wÏͬÉìSnWœ 8¯ )sÙ¶ž|±Ñi@Ù†ÉGª’dóiöf,îè`‚-XòzÄ د¶©ÛT{‡cX¿ Uõî/%Âlñ™˜h‹ÏBý+*$Õ±Û—HG:5~Ûaz1LÝ%Næ±@0¤¡¬â[šÔ†B’´ˆB¸ûtÙ˶ðuúçÒàõUÍpWn_Ä[çt^Ä (Œq@¡Ý>™]ñê¦:[¦¸ƒäk˜í„yeÂÐÙ£@Ô •ƒõm© %•G0µG6¥Ç5-ö®g‹?Ä»ø%hc%*Úˆn¥ÃˆNC¸=óÖî” J/Jó÷Á?J“ÊHóÓ¤ýzÜ>9oÈŒäü^©‘œœSÕÑ깑¡ß+9>HNÜ– Éù¹°Ú‘ ¹³aÕ.<VÁ«é°ÿO‡g³¿³ÙŸ0ªßFI9zòDzûfðæTâ5ª7Q"ù^ðGø”^I3ï•XDœx E,á‹þK íͳț|%Û’ãäA$å?>>| ü ¢ÉþL8h¨Ef­åBð¤I¼˜Ic½Ù‚^ ‰#fæ2#U3µã£CrþVºž¹¬:jGrD +zò~yÿ¼Åk¼L“×YY=¸·øëªLh3»ð˜¡ß¯³r±ÞØä^áë²\€Ëpñcµ2n¾à:Pq‡*|+XÍ…R 9çžÂ«¸Ô¯*v¾ ’ Î)£4 ¥€t]•W½¹ýËg0{h £Öi´˜Þñ©s¶‰ìuˆÞÞhõ±µÍ×äüô”ÅiÄbÒ‰([Â&yT߶x¥³Vè¡l Çdî‚l|h‚¼}€Âoî¨V«¬Óç¸È®Y¦øz—[· ßÊ Ê€‘…ÃÆp-^…¦iœ)20\þKß1Â(. Ýïòr8ˆ»]Þ‡xXh‡mÃ^«æ:á‹‘é9Î_†ÈþsÑ\néÊ–?Ý# u”@sÓ lGó}ßñŒ—•}Ê- ÿ¡jzšF&NH<¨¦MtÇ7LǤTsB…†z¨h–©L8òˆü‘õäl5M£åôNaÛ;—NlåD€ëHà áž%Tåü'üFnuÇÑ\ÍÔ-Å´U³Ûëj.1,Õ² ¥O̾Ó(ÛT5þSêÔ"¾î¨Nè8ª¥Ù¡ATÛr&–m¾á(Þdb«6Ã7N€9X]ó ƒ¥6…qöx¡þÄç…ðTç…ø8!,høèÜÑlOA,¤¢ìÞÆÊF‹õcy(ükŠp0Ϻk÷u>çÂï±äËC“×í«X_pôbŒ!X ‰5ÿ¦Âkýѱ Ôd¯agV‰±â·^ù¿XØø˜è¢½ý†•@Ã5;ïÆ8Û©žz³µÏ…÷ ]þБn:%¼ÒËÊ2¶bÑ{Ì æäDüLö¿‹ì«ßþORòPãùLRƒó඘ ÉÚ!ù½JÝ·þK”\öõÝ¿ï/û½žìKµãW/vØúYÏÅ‹7{ßêAµªÿ¸lÛ[<-žÖ\OS¤4L%ÅÝ>q¦“ª©±?à/ò`í±5à3ÛØ4œÿ ᾫóâtù½Ñåé‹·µ¦‘v€_¯Ï3Œ<†*CVû,¢V„cžÒ1W÷Å{7Žº.g`ôy^Çfó(‚ùßåéÜq ¦%ñÞFLiŠÈù˜Û±Âœt¹‚ºÅó$†1CÜ Ç ³ž„ì›BH\ÂX"/²e ZÒä‰ ¡V¸X@$K0váÛÆ&îÏ£°Œ«ó’w¢òRs\‘‘s{*_¬ N×â¸Â8*È“¸+”S»Y"G!„F˜ˆÝ W ]:´¬XgõlNd òDŽÖÖ^ƒßÃ!ÂÔ€ö£R®Â‡Ô"œ6& ã0 ¢òøÌF‘ðU ŠCÊXýLH‡¯\ƒ›}9_m … (Z_Áöø𡸲°35³((c ùjDu¹¸\rz|IĘ=L$õ'@µwLðª†fîy Ħwõ©v¾ò—KÊù àVÜȸ]ŽÏ G ¨“cíŠh• ö^/•^ÞÊñÿ“ןš šj«ªÿùŒmYðPÖv¥Ü×ÝÁ&¹t4ÐÂ(Àúqñì©ÇÞ] ËåPÌÿA @Â_n‰‚ALPð2*ŸYìÈåúzNPËSÿPKÕj =`Ùõæ.Ll validat3.cppí\ûsÛF’þYú+°JU"mdÏàG®@‚Œs±¯å$»¹\x lÚ©#©ØÞ¬ÿ÷ë¯{|ˆ¤(ËÊ^ªÎ.ñ1ôôôôãëž!îÞu~+Nu1 ŽªósçŽón<˜NõÐ)†µs~ZTºvCgúZ;çåé rêÑYA-åç=pòb°»ûÅ`X^ÔÚÙ;¯^½Þ›k0Ô5Zw¿¨u3j§ûìOŸÿøôéËÞYçqïåÙ“ÞñÓ¬Û{ùK/ûÞñæãéùt¼HµW‹ E}ªÇ¿ØxV_j—¢Å†Éëb±a:x¥—ÎõY-j_ŸK,M§¦i®m0œêKôÎßÕe1Ñõbk38êñd±ñµ~©—ž,ò`0šLǺ8ûf¡í¬οÙÝýéø»¾I|¿;þp>=}zpéÊdZìî­‹jê<*&¯ŸëÉôùÅù©Þý}wg¡a¿ 'S§z]Œ¿†çÓCg¾it1嶋ádðjÈ*5uÆú\Óçƒ3=yèìîìÜsøÖýýòÃT;=ào‡ŽÜÝ6ËWjçëõ8ŸÒ›ô§ s”÷ç>8¿ÜÝÙ‚õ6í(×›Ñæc?\1•ÝáHèÞ g÷ww&ƒé—3þ©e³÷w?ÞßÝ-G£S^ç'£úâTCBû,ªq1œ4£ñY1Œ†Î—gµÅ‚ ¿Néã±^Ši=&n 8<Ìy1™<$ÍÒ‡NS N‰·c]uhÓQõÖ©Éêht²²œ?áæýƒbr‡qöè¡{ß<˜‡¾~ý5­6›óÜ-·¿Áoì¿^Í ÃyÃ7ïìÐð?ÃyíÏõ4b^nÁjÑ,pO0,N÷e ܆:3}V› ¬2-Ï×ùËCLj‹(ðÛ—_:™Ñ…ŠnusY§3ÁJŸK«½MZʷڅìkP„~m­Õ>–Š4Ú¥¿D}’V§.n%åZÃøZbե؟»Z¹Šþ“0@Xh^ ÷"åGV5ÍúS´YÒM¾p#í4¸™r>Éo¢˜I îI“ ú¬¡R•$ Õj|q]µ¥ä ¨e*mq°I‘x¤J”ïpŠ(•8Š(´¶)©QCïA(m%–ÂÛ¬ø5ÑJÀ!ÝçÍœÑòÕÄY Zp¸ô=(„[xÆšBEMïe¹µ¡€½H‡DB•Â¦O$£Àh¾'Bi2 ï ãb˜O !ݞЌjCVEbæ©/ìD…2—fWÑõßi-Ò,Ý^x¡a‚@„•(h8êá‰/‡; "z¨„5R›õŽjb"%y(’_œŠQC¡ Д*5:LZПR"gÝ oŒ~ÑÅÛ{÷È´Èæý%£Gë ìÝ¿¹Á‡70xè(Ì ¢ k¦FB áèT®MA0„K˜e’â}“ÁéÀøtwI"õð: E'€½"-a–Ç^ã÷ÃÍ} q&1ÐF#Ö‡åH#ú^Á,0“ÄôQâhÒzkƒ‡ÿð!“@0`9#Yþ’Ø°Bä5õ©ba+,?Éà!㔤âUâCòŠn –CC傆ÓôYâÉ•¦·fðnh¼*0‚/Fa±h0t° ¯Š8)À%júÜ –„ Á³†•‚ƒj©J¼öRódF(ñçU%Z¨K’Á‡— >¼‰Á‡77øè_‡bŠI%ú4.K_VYèBX‰Äênœ®Çz#T­ÄèàüËTÜB©DeáNÒTp"qK ®ˆð©+Vl®à’ã`ùJWt4®%ð@‘±ÅþÖߘÈάÕÈ`Ħ„aö-d‘~#ÓA¸ÅLáÓ"<$Ò`6?H!ºëPÖlÀ%2耄aŒ•·á!¼Ð@²D„Å‚Ê4‘ø$° Ã÷ „C@zœþ‘ g‹3DúX–âÙ£Hð%dÈâk n,Z— >"ƒ.|tƒnjðÇ21ø9ž¨í<=»‚™¼˜ýÖß~ÖÕt4žÜEÉ~ú~º·zdÿ?4ôsì\›[·}ƒs܆|1uè ‚+<â?¢ÕFlÁ¸„Àsi $ž˜Ä%¢sÊ€È1h›= ›Gã$¡à xÓȯžm€KÆØaLvKždòàF™Fä˜çÕc³0¹×âmü@¬#5fŽ6F;•dk0$‘ )*"æ†Àò`þÀÚž'Òæâ[ðR_ß1;–é20 $P@”p™‰ÁR`àÄs%”Á_ü#QBÕ‰.üRN˜0”ö2º&ã×sþõ²ƒf¬´H”u-‘õ…¿M&N6¬õx2’MÌÞéÀé ^g³" ¤£Q8€צ¡&™O ‰Lj—p¾±'F‚<ù&ƒ Ç<4Ê®o…ñCç|<ª´®ÉGLœQ#dŽGÍô]1ÖNoXaî$8tºÅY9Ô¯ô‘ ÐÚ%y§”ž˜ÎI ¥FÁ÷MÁ80YV!Pæ3JÒÿCó=t¼4UfÖPI¯,X«†Ùbe‘@³;,Å)4µàmàÀH¬( ðª°)ϔ͡5u}+áó8ø×Ðg€ôµ %a€m²o§¿Â$Ã…/Èu,%ª ÿŒ„™ÓÏX&!ùQ‹7d‰ysüþî:ìÀ—oŠž}÷´÷$ß1x~rUÒP™Ò*Ñ0…âµÉ¦ªRœ”ÛHRÜ(±ñÀUmJØÏj c©*!ˆ€RéʼÿC”@ÞÐ/¸ÀàŠ ‚2£7—û)³De!azÄñ€ú~QðŒ·¯Ÿ#Ä9 ÚÂ4€‘Sº/L1‚"`DŸŠY•É'% ¬L¦¦pÍQ°Ÿ¿„H?„µÀwDÈP¯£b`ŒáÁ˜`Ü€!ð¶À™)ȘdU8¿Ú•åÄŸoRq0T“˜lòà:œºÕ,†i*ÞË‹E ࿽FŒµ$eÊÜÊÀEÿÌb(ÃHêŽPU@èöïPc[­L†æ8AM%úÁ-î„À~bcs‡P\D;Ž|ž¤SHKa³(%Àž|Wvc½fyçdµÿQîUþk†˜™˜Ìk„umLì…ïAÊ0kQ5Øœ5ÄçGÆklÞo+MݨÅÅ]ððrÚ¤‘Є'1p:É{x®AÉÚÔÜ\‘ï°Ù¡Ÿœ;¤ëSòY5e‰’ñÞr*›˜( &Cáë&@vØ6N``h¶ ˜K%€ó†SnÌ 8‡Ø8i8 æΕäà“7=cYk.9ÕW“Ò¢ˆê@Рa«•ðÜ(iqí%ë‡t9ï0Å F …HÒ*GÁ†æ‰÷¨ e”© ÂH„8½Ð"’Jâje⧿ý©ŒÀ¤CHø(­–]m(Èû‚¡¼š»À‘` b…òði±À”œñÓˆ¥Ý|®-šP.VšZÀVÓHŽÄu%¾#6bMãOÛ6•V¤[ˆ‰Àózh|sjB2H«—šó5|¸-$Ó˜£` «šX ï L^w7†ÔŸæJã BSÓ&ÓtÓ[ˆ¯µ ¬rÆÕ )„c, Spc©yÀ´ Æˆ2ÉMjD¥µP±åiJâš@u-MYNêš•©WaM¹Žu{Dz!sX3RnȪ¥L(?㚪oJ?æTalªð`›O`)“ŠV¢Î˜.t§ qú8 ž)1¡ºÄµ/âÚPs kÞû#éS±M–# s*öˆ¬Oh€qÔ˜ll’Ðù<P†Ò…Da$3Ð1N’|ñ• oÖù#¿ôÙ‡Übü.Í.ÎCy÷¬BÀž˜c¬XßÄ 8/Îq ƒÂ òBÜÆ)º¤šÅX.’i 4[ÐBÐ.h’o¶µõ2æ|™RËñ½ý©…süØhé`„l-Üñüd›ÒÏjz¥CùÒ‰ ºz8·;±¼ñAMË{ØÃÀö~Ü#?DYɨr¯Á(u&V”»‰QåΕ1/1ªÜKŒ*w FýHmÏ(:ŸÕôºQºz8W_Xf”š–EâjF ëmÏ(:ŸÕôºQºz8$—¥¦eF7—]þIÒĨÙÏfŸõžüøs/_Ü({”ýœ=¾Áɺ.âM_rq.MôM>Ž¶üä}Þ—àÚ%ßƹÉ8£¿Ž}ãO›¨Gæ uù™A D!ïEPíÉ®q ˆCàÓr©d°>¯‰'or§®äFp-y<;£˜ˆ‘l*ѧ¿œF˨Fí=â.KÅÇfÄq‡¾wèsß3%qâ®—­}9Nv¨k'—Ïׇ§£‰f AÃõMªP›×‘k]s¾7'ú™@Á¤gÎã^%±÷ÚC6\•K? ²uSYÉœÈe˜¹©Š÷‰í´g3±ÚIDú4TÚU_LÒãcòÔÏ¥ïý¾Ùc6™*ÿê"3éR–®„õ^ïÖJ'4lû=H®/Òó̾N/ bQ;®,0”!Ç}Äjž jí²Qqø&×Lés·o¶×3é›ÂVM{—ÏÃa‡uu·Ã¦ŠÎù}OÌýtýo¾&¯ã͹“Ë”È mGÉÛ@)dJá–”ü+)%[R 6PÂéÇýÀß’RøÙ(E—(]òá_èa=h–Î6<-†ÅY!>{›ó†çÜÝ‘Ã_^ƧçÔ²=Áw¯åŽ9’[Åš'yô$ëÚãíoÐßê“_ý¿Êå{÷¾ïýãqï‡oŸ?zñ’ýÝ%÷p輧ߧ—  —0¤—(¢¥è%Žé%Iè%Mé¥(è¥,饪襮éEkziš‡†(ÓcRL… ð½|ßÑàÜVƒJ ¢)ƈ1d0ä¹?ÞoX/?]f§“_c™ÅK¼æ å |XÎõÍŵ^×oêò@ã³g8sàU•_§c]ãÙÒæß}Û;~~üÝ?{fmi<ÙãµáÅÅ:Dw…U×xI é°±Ò×被¯!Ö«HìâÆ…]%^u·yv]yéc\õÑÏÇÒkPIY³ÀKŒ.*²DyHV› ²ƒ7àÅ“)îõp‡ŸXîyȵÜ׬Ǡ\(K´b…FíÇZ^€| ^JŒð<@ÏGç]JßN¦Æ×Mù^\M”e‰ObI­­„ ¬µ¾ K+ç*µDƒÒNAƒ¼‡ùF ì¦–TÛµ "k£.èR‚rÉ£ù-§]sOÙ…âÛ˜– “bÊud©¸¬ ¼–‘]¼ªü(T‰¬ëJÛ5äeá‘Ù'ð' `b&u« ºD©íÖ–W…¶FÙum@%t트P³à +£€ye)/;•–hÄ·qŒ«˜«Ðj¯å:µšÀËÜ´ð<¸u¬]‘Q«"/†¶Óâ òª' ¥p/³Q±bpgÕò\¶œVLMh…Øð@ü•5_£Äª[RAT¼sÉj[¢kk>û^^ÍV J\pµU4vÀÂFm2 §ÁI+Sv$%.¸Êe‘„˜yZÚOÌ3ë>ûrËJÜ )•€385óØŠîìþºG”,ÿ¨‚nÜŒâöÚç•à1%oñÜ·|ziNb¨œÕ>Çη/£q2¤zÏÙkÞBx€Ç›—bìýO|€‡xé x@Æ܃2f£ãi+ƒñ}y Ïb:2OJ±µiƒæà%Áò|ž¹¶ž'ßxéq)kž—bÂq ’—Žç¾ãüûßÎ_@ög=4ä'û‹÷^ÇÕÏ^Ù¹î³WÖ­ßlíÞè,«žÁ27)ûØ•ùµý¸=b}Ô¾mà%?ëšÐòï4‚búá\ãn‚À¾‘/éãF±È³½þYÁçæ<¨|7×x4Èèbˆ|תºÖš‘ƒx…OPôÿ‘è$:·Ô«Àè\¶ÐX¸ÔvÁñ§-¬âxQ3‚(l4$YÉØÏ=7bÒ¾¥Ȳ”6BǦS Z98 °ÃK˜´˜³ÅÄucÛ¢bÝ@~‹ÚX-µ}á€XAKF½èWù6ØkeòªØ1úX;P`AkÑFhói;Ú·˜¯òšÀâ¦Â(`ýŒB;FÇImc?ã_†ÇùÆN†ñ9Û"KáuâZN«xÝ@¼‚…Å¡ŒübjJ _È6•Å€ ‘yð2´nÂs-*+Üu©6“h¬ï y}™#—VÃvFž¯%‹XÙÎŒíoŒ—3W^AÏdò—W)°n‰•…9ôc«¤ Ui'V°Olóšå|ëëØm&‹YC|žì@Y½XSº¹l•]/†¥*Y7P`sŽ¦nr[ÝnZ6ë©y Æ«q›^©À ´öÖ Zõ ØKD b0ÏwpÔˆ;Z궉ea͘ÅéºëŠ¬RE±õIœqÆ•5÷FY6Ö3ÆfÏÈú™­èÖ¤lgN¯8)a{äÜnæ Øx\“×Bsß"ë Z7PÜæ-Ú:N‹J¯U†ÂÊ”ïà•aå¹1˜ûf£W€ôÕž~;œÎ÷Þ½ò'ÐWCõ–‰y´~8 ã×€î«@ÊçEïÀ~N÷ÇŸ~xÞ{vÅÞÜmsÿ€þÊÅÿ“aý•sø3ÀýçÏ×”yå+—@öõ16ß´¡Æ{¸u¯ÇÅÉgÇÅŸ~Nèφª“vQ/ÁiSXÓ ¯Ú†shŽ[*5œÒ–€9/âðÅ.ª·w¶«?ò8³´çQè3‡¼eÈc.[‡ÚVi=¬K0gmoWDÚ·&Ò®ÄWÀCç’Ì8~nF+ À&ÆÖ!€OxÐò,þ_âûþ-=lyn:+"ÿ\Ô—c ÛÇ»?í|Ÿ÷_.<à¥v~1>Môò³ÃIÓƬuØížÄÄìSj\‡üí¸8ʧœ–ç7]¯?Ì=n#òØûö¶…O¸;aá|y^¾¥èa>¾Äòµ?>w&ðºÏ_ÍÀ—S~{8÷,j~F7‰˜,’ǹLX&õœ¾š÷ûv„QåÕ$eA¶!67’š­èvg3f² »ðÐw¹<×íhbŸûN†‰µ?’!é’íÕÊÑô%N˜=£¸3ë·Â9"gU _Û`o´=1ï¶Y$=S~fŒjÉu-ñ†©X‚‹ìnñˆw’goÈò$;®X¦¨´³Dá®ïŸˆÐÑÓ‹éþ‚¬óWyºúòŒ×v™SÖU× u¦}~ü5‹x°¼µÍ£ÚŬµqj¾{×iÆ£3çÇs=<>~ì<ý¾{ü…ç;OÇ£WãâÌégs~óŽÎ9ÅÔy=žß»{÷Ý»wGõøõØüÅé´V´–úl4<ªFGoïÂرDZ»³ì.Ÿ»üª=××U9ýEô»ôç×Ü,Jº}F›'~ÐG[’eYOùiÜQÝŽªÐÏ:QÇã$òü$ìubzë{™ŸÅýN7 öÓø×)NÓ4Èû=7Lò +Cé ž‰¡Nšf0ìwÂŽÇ”úA–Fý^—űçõÒ$êö{*Nݤe8ígAw£n–EyªÔv<¯©ëfA’«0‹ÓN/órC)ØL)È“ ëöÂ(TY× ¹-!F⪯r|W=ºÐè!­.¹JîŸP>Þé>Ÿ©Õ—©ÅŠ>y2V€÷Yˆþ'³×8X=Ÿ=•%iìvú*é¦~7ëeI˜%9M-òÜ$"û#‡­‚ÄívCR5?_бHT̉ö+-=óÿCŠ¶ŽÿPKÚ{TB7{H²Ò validate.hm”ÁnÛ0 †ï~ £Šn(V ëvèЃ"9Ž'ñd/ÙN3±6YÊ$»Aß~J»®M©£?R$þŸ4r«kØÆ”ÿ,ªyQ¬$Ï©’Õ8ø€ÔŒE©7ª¯!>Û؇}§äúCsEkcT¼JÖ¢¢ÔÅ#ècM¿kÞ}yJ¨Àu%tÔ;wñÎËŸ¥ÿÑs¡¡p@M ÇÀi„rúñå“Z ð) ±›û„X9&!† VrQžÉ”!\-Zð²‘Ví=ÁŠÇSBqÏê}ãŽÜ7`§Þ9‡;'l„Ÿ°¤D©KÚÉ(áX& LƒÓ܈SìñP™ÃVºëk,ÀR< @:/«ÐXøÓ„äRzÿ§0ždÅWB'ÑŸñ Žäò—®(¬ï`‚ºK°{Ð]H!%9¶šŠ”’x¡J¡\€­ÐýoY„¶ŒÒ)@€Ñà2‡Ø6ÆÆ}[`ßJ¼‰JýŸƒ­dyXá^U拯ÓsBþ[àÙŠåaŒµü¨xs±–Óå]]½ù#ú65ª>çW%¡E€]Ï…<,³ô17¢Ç#nŠâö– ]›vÖ·k°)h°¢36>SeÖB½¾Î¼×Ç›ÍD'FRÁÅÆh×Å›FØøýÖÙà2~¢/õgžúþ½?}ÒºøÜ܃µ²öŸÖG:°îî%y·Ò½R§O.ã“©Ýu¶‡£„èZn£¿PKŒ=nƒ~®Xvmac.cppÌßØxDãp1ñÈf2öwüM @(7½‹Ü¹—©Ðq²@ÀÆùчӫ‹£“Óáñé»Á¹~’>$y|qa ”)™xÓ ò&úðÃÕÉðóé¥A¶¶È/'—ÿsqýñâbxüñãÙðêìã—á——ow»¥€ƒ ÊÓ Úñ7^xÑ$˜?ÆŒ|þptÂ(‘Ȳ÷‰.ÄŒyËðèóÑàìèøì” ^Âû÷nwxtõAÂ3PoÀ#Cqyvtþöd8,dã(Ë5ˆÆõ"Åä¤Ý&¶iî’oq:sÓxM„ºYîæJ€Í“Ý.Ià!}òe·{6¸ÖÍû©üçM§FW-bÿ·‰ýz$i0÷i½ªe8ßµU†ÎTýã wííQ“¹›Íûkdè¨ ÷:k3\e²Ä°».Ã$d†gd© /mæ=”,amh!h£BDð0u—Ò¬¤Nâo^šŒ2¡ =ywrBŽwıvÿa¾!ƒ“Sò-È}nÀp¸€¤Æ¬ÌiÅ䙦q”o{˜6<Ãæ–½«ÁŸ®£Á€­CƒƒÝ®ñ8ÒÓ 3oÙ5Ø\SOÙÓ4ô  T<~áfóžö5&Ü~(:oÞ|ŠÆ¾7žy“+/ÿÍ{ЙÔÑCî‘Ö"óR€uÈ"Ê‚»ˆÖ²zÑ]îw¸ŠçPB>»á»pƒ4#[‰›ºóÌØø±¡!þ$¸ó²üŒ’€¬uç—¢œ’}?¾õ¦î"ÌuäõæÍ[Jr|÷t£Cx› 4zÀ{ ÅAæýKŸìc)¨­]cCÓr?¿‘AôÕ ƒÉQz·˜{Q®o¢+Þ’7™/Ð~XÅ)n¢¨ù0È0ýŠ1È»·íg8êY6Jh$°F©ÜúÄ$ýETèK$@ãÌ'm“É„q.Iâ,ȃ¯ho˜Iè‘xŠ<ÑÞ í( ã±›{Çð3Ët £×'Aâ{)Ù³ß>9½,c`ÄÓXËO§"…¤¬áù¸J^? AŸp&Ǥ7c¢/Ð%2 *¼"üÄS$¾òƔےx‘ëU&ñ[’0&ÑÎIè¹Ñ¹÷­¤@T>@ï@÷ûg†$òie‚Žt7æ-èeÞï›=RxæhòÕ`bp‘Æè:îâ êóOgg¢³Îġ‘.„äà—Ì-Õ¶Ná¬ëá ¢ÜÙ Ô¬ÜKQÉ“:~Ä‘¢]—ÞW/Í<áýxðnxzþvpt>„RxzY“ä>¥‚!; ÅYuÁ‰I=yc½¦÷p3…þ¥ô†˜æ:ó§Á{@ÛmÈn(#Âu²Ë¨Ç ˆ;hÕEž²¢]¸‚ zÞ­nÛFÐ1Â…Ùyºð:dÙx•!ÙbcR=cç–ü,çö¾Â›ù¥Ý†ëGÉ•ARãÈÓ%Gòѳ: €Í‡ôŠö™u¬Mbø]ý _kTøÂn›?ïä 'ëöo8•ò’¼©=’o~ÅM×]û8a3°®êŠhÞ`°ªž¸“ÆÇ ¨4ual.;}CfU‹ž4jÒfÃàóQ4¹Æâ<˜òꬳêב Ú—^öC1Ì°‡ÑF(Pé ñqyAçÞ=Ó/aîÏÏó‘—¾ó"/usˆÿVÝu¸rƒÏt\¾ æPòÁî º`¥˜ÂREæDI4|ÆÔÛÂÜÛ›Ö* ê¾ä‹-ØPý©hî¿PŒ•ª{Ÿùˆè¥·±¼>#cžqÞ䜻 ^±±Š £4Ãy™{óÌËu‰¦CÌɶÃ"ˆ3Ndœ¶hçñê ]úԣȡ‰Ä2ýqC£s<ªÓ²L2˜»È„7Ù6dä_Ä2p¦Árâ†É †è´j®~öÒ`úp¼˜f§.Üp‹¶-ÖyhÁ[ªFEÁà@0(JGUºbCp‹Ê›”ù#·ù ¿´`=#Bž%öIÕ‘[ÙSbÿLH«æc­Ö>-åæê?aòœ³iGÁzV^ßñß»™ £»ÄiêsoÂTUVU­‰›»´ë¹ÌÆrV2ÔœMMÊ—E•µûÕ©­. 1þ*ο÷w7^$©{7wÉ77 œÀœ€X ¼¶™¿˜~°MÁ€OG;§CìB2¬ÌBYP`‰Ô¡àÕ¤¯§NÅ:Ëpʳbr§ÜCàždÏD/%·¥Eˆ›¥!WÖ±—pÛÝÛÒ ûµŒÍÒƒæ>ù¿tí¯£i`â”g˜Yñ«Ùa³>ÂVc„­ÿJ„ÍšÄXŠ»¹:x&âX˾ܿU£Ç}éȾTÄ;õ¹c­oý­Ü¡êR§Ð\©êµ·’¥¦¿6£ï¯ƒ^d¬Yõ›Yç·]µšÇV•‡Õè{kuvGÞ Àˆg·µ"}þ9ðÿ+0R=ÇZ~«Vá+:¥K=X€‘<&tV, ~m”÷ªžÙkŒò^S”W×6Å»j( ›]Sìl£|Øåšà%÷¾m·º·%Ðb@GÚ h*@‡-8+xî«|gVÙ ðžÙeƒÂæ” T3&‡% MÂ"‰¿C‰¶E‰.Ó:Å̬À̆´«©u®ùtw•$Y˜Ý˜³•Â¶Bký‚ÁÕó|­Œ®­ðÄ2ç9“û¡ó¤£9å˜g/;ÑuV>ò 2sXrÖÌYrœkÖ–~0†™­™½äY·êí]9•±b—s²Z3K¥]»ÚupT\Ñ umONºÊà´Ç±[3s £+c8u¯ecìÒ˜Ä<¼dN·Ñku0¬2ŠT{9ù]³Ö‰Õ¼qšGù"oÌ2oÄ­ð©Uã:ëÉ°òžÕ\gkëœäHþ¶—ýýºÉßÎj;Ëþ~ÝÃÕ^®OT Ñqœg*+¦4O&7¦:X™KNeŠéÛáúv%ÌõÇ*lŠJ÷tvc?HášÅ•U\ÙÅ•#®fÞ¬À›xHlX+Œ¢s ¶Ø—ƒ`ÓŠ.«ë±r¿÷$âD+ö$àÞ›ãу¥M±Í7ÏÅþU±{UnU¼4ËÝ.í ÙìÏ7‰Ž[hüo¥Í!£C6ÇjÚKæ+h¦0pý®a¦Úæ{B-“MöŒ¢ÜMB¨ PºŸS w… ÞívõÔï¤a'°:m1!}A¤–ÑÒ¡µGRŸƒ.9<ćí$ %˜Ñ{,ùÇ ¨ nN•€ØvÈØ .i—¬GÀylH*±ó Ø–vhEP­TÒ†‹¥ Ò‚©vwò°O¬®i*gÆjö'e—86ÕÕ€|ò°¢él‹UÇØòË‘Qn8Ö’êâa¹Î© Gu‹[΂m&ÊìVœh“„ÉÁÕ4±·ì¾xaöqºøâ……^iMs³9Ñ7ÁÂ?ÉKg“`7p7õ4ļìOàÊ70p5Àî6ÑË‚Œ¤BVÆYåß#Xw Ó¥.Ý|Æû1½ÇÉðK‹Êo§›:š€Òøµ%tqÆ€d¼o¨š¼}K3‡êw‚Р'£˜.Lå ù6*S“;ì"¤bà*@þ†²éûŸ8©5÷Íç,¢*öÉÏú(4t¶Ð„5bóã÷2k<¥ö(( e¦£Î¸³•økC±ï \T”Þû¤MhàÈ4²PéerìãÁ5±žå úk?í”çüQ~À—8 ,|šIs}ØôKÞZ|„+çVŸ×`×6‡‡Îó™Ød€ŒÖf%ZüÕ°YCÎ&¬c³¦&%¥Cês‹â …^àåZÚTØØ%ûlŸÙ/ Ëi£šô|$€¹Té!¼1áà’”1 ™½Šµ;(‹*ešTñG5˜u*Z%Œâ±°ÊõtŠWéܽެR²¸nwñÍ t>¦/}óæ:>sݸ5&Ñ[MlÚÎv#~ÈMz; óßPrvlE‚ݬ¦¹¶šÎ*5­Uj*lÞ LI © ´Ïš\ EïN5;­v«ÂÈ^¥ÏÚÞ›9«õYÛ3Õl€0Šî¢ì#JXKÅ!vM+ŽHWÈ8Ýò‰T‰”¿U€§ƒƒƒ¾x£@ê°ÒÑ`ÁOT—\¼Ä væà:ÝÌäŒ5×íÐÿr¥D9ï•€šZ¡UGˆIW%µ9éû€c=²˜»äA´à6>#ÊúÆþ×ìI‡p5ÄL^ܤ՗‹oZ3‡£ËSPpT“>AY†³GßËp›>eðÜ–œ“ÜÃÃ>8¥^’Ó ÉnT§#kP†]/––ôäµx ÕàËvòõ”¤¢¥xÇlôŽY¯sÕÁ¥Öøà¯^o|¸û<ß±”¬WÌjp¦Ù¨–Ó¨–P˜vá(%ù¹Ž<õ“2õsy +èH7–|cË7Ž|ó>îf2‡™Ìa&s˜9š&ßRtN‡²†ÉÊÿyak\AH…xŠÄtÝ2Ìr/Á­¢™‹™š‹NŸãÄÁ²wÙR_<¦˜ù4Çé{G€Îj7˜*Cº¾+ 1—×æEµìr…‚Ž‡bÙ³Ê×?’Qð;aÊÁ¶Â¨}|§FˆïÓ0dAlô´Á¥‡×ýðÆ‹°÷Øh±S¼Àþ7Ÿï ¾ «¸„²+&åR¯~$Ð Çýx:SÊîˆ.)tÄ.S@n°nk"ä* K¶ tC&–Ô»FŒÄ«T×\»Fw«IwKQAQ´——®B{&“–ê?Ê#ðÆJE7uG–~b÷r|)C=Í»"姌Øêâ£L–Âux`åÔ·Z¬µ¶[p‡r^rÈéþjî÷]zoUÚ»H*`®+>ºæ¶±5ßu¤X‰†®,«Õ'vÉ8‹š¥s›Šã]õéUŸxO¦2ojâÙTŽàO.Î.-hÍ­CŒW6^9xåÀÕw˜Ä•døší8ž'‹'£ÖxÒ!pMFôýòÏ›BÔŠ·•2Òz¥<€ÐØó&”ƒb@ÍÙz{Ã*9(‡º…˜ Ï&{Ñ\Î’éyä@æ2Ù᳞á ëÜÉ„äñ—ãwÜ Œt£qé£Õä|°¾ãNxZU:$1qǤŒÕó¤3ã¹×1¿”Åߣ7:°ºìcÈó&$[ÌçAtWU§$§#s ï?¸óË4ë±›¦ø^.KC`Ë-»øŽþ{NÚ€ôI¼…eŒŸ*aqL~8$†Ù_ëÆ¢pø¬,°¼>N.¡Ö¬8—ÏœÞOdùuÕó¸Ÿ| ÷óïöRß»}%Öà¯Ò/¿,Ëi|/Ö,Y¾“ÿlX>4®ßÄ«õ"¥4¥¬òä¬jSñÔs¥Bô›·¬4Mp;ÀY‡Oò,—õ\¨¹‡k¨Æ¼ðˆ©ÅS¤òê8Ÿ•Šü¬È-þ ¾ôù†TˆÄ½¬xr_Íú8µuñ.¾ò ­RÒ˜1çÈÛ/ãý‚Gêå‹4*EÐ÷ÓùG±¸zgPQ9ˆ`þÖQ?)Æ>Š"‚VrƘ‚²)ÎÙô°xD™àŽr¼ÁG½‰]ÜÒ5‹x ˆXì"ˆ5³‹[Ä¢rp¼_„áØ3YŒ¡€&V'±6Zß1 |ÿ„Ù{ø™ÄDzÄbkBàŽšô–5À´¢Ÿ;ížv”ÓWœÙëö!ŽÄÍA¸Æþˆ£òéÄdÁ:J&tù€;è„>»Ý‚6›ÝÑÏ£Ôhò½ÔCRYè%¦Ú\¡W:~ oÛþîMá<„Ã_ÊpÕ%mª‚x°ÃÚÒî® Á`Mñ]:ïS¡Ü2YB—Wh1Û†¬U¼=³Œ—ÿÛÉô$ Cỿ‚‹„1Ye`âð`Œ^(ý±Ã"^ ¾ÖŽ²e|”¶êt¶‹ Rdc»Î¥p<`¸\ìáœéœ0çàT¿æàn&8°KíÎFN%ƒ)‚Õ‡Æ.Ï'Ø™ý§ø–`MC«Rݱ/¸Qô?§âPÐx~ õ¤ASÊ ÆSµ]Cªìõn±ž–Z.óqãú”Ã.¨æS¿îk%7FÏ Ž¥³½–Ê•HlmÕ¥l‘ÉD„ªˆ‡V%±øo5Z¾ EOeuAÃìãVcñ– tyÁ û6øø%ÒÂœ;Ð+U¡æôÀ)*ßÞ¾jMÕ%µ µ¼7…pdú%œdí%¶Š¹ Í‘!Á”ct¥žkª$-º)Žîûãå_ËXÙ‹=¦ü(Ö|ʺg;[Å—ÊŸüPK=.$•wv vmac.h•V]oêF}Æ¿bJ¤Ô&Ü’4Š¡â›XÅ„ª}±6ö«˜µµ^‡Òèþ÷ή͗A‰úÂ0sæÌÎì™=aSÐ)tG ÇÏá7é·»Þ“q‚FÆéÝ8aÜÓ€B™I*æ$™ŸÏË;Ö„úot¥lÆ Ý·Ýa»k{ûј]±Še4Z†Q«ÕàÜðC’$ ‘;$¡Ð€8} ™BIƒ'„W¿4—‘n®«Ð§IBf´Ê9å’ùD²ˆw£€¶Œ# n¥DF"ã3h‡³H09_ È‚šøO$|*SÁaÇÓ,+"fÙ‚3x¤²Ëâ9¦u^8ƒ²õ­Œ—ãÈÍbØŒ&Òeÿ¢GåÖºûi”Rž°§0.Á™d¿Òïæé„‘ÿ–y„÷w&=Êgr~€QWÞï `D“÷ç"â %óz]I qŸV5T¨Qî¿Õ­»< I è?Ò™˜#ƒh1H¯TO­hcx— ÆUmýŽ)õeÃÖ©ÁÜ—3…Yïä&¹ Óûò\ʸQ«-—Ës_¯í0JùŒžGbV[²7VS2Qn©¿ÍiÛÌ–úØÛ‘žì.Œ½L«p4U=pȵµóØî—!E~zXð10%>uжU§*¸¸6%´“f!åQŒFãeàüñb{ΤºÏ±ÑÈŽÔùÛnAá5¯ ÷© ‡ùÅ—ÁŠBºãG_…“³²ÂÞñ¼‘ߧkc»¾|mR¢øùöXG’ÖnU¨\Å”#Ób16×S¢Tj“IÕö ˆ£j¬åè?PK=‚Ç‹ÙÌ æ)wait.cppÝZ[SÛH~Æ¿¢ã©e%c ©}ÃÀ”ƒÅÄcSÈ ;“I¹„ÔŽµÑ­Ô-ð¿}OߤnI¶Ij·ö2Ü—Óçúsºut„½ü,C‡è1)Å ò’e‘çã… ¢kŒ²â> }¤±#÷Oè‡hì…ÎaâGE€Q7ó׃uWà”‘8$>¡U€WÈ_|pîrôóh2½›:åÌ­ë,ß97œ©óËÒ]ü2u–rqEîçy’ÖçÚy"Gô)äe8Œ±9Z$!¡ÃI®:ÙèÊq¯GìðŸ&3ë"Êhz}mw:EBÂÏ W Ew ÚüþïاiBA'8?9¹ò¾VãIJ;Ϻ4w“Ùx~çÖ„ÙË1-ò]þ6¹º½ZÞ&‹åüÝ_‹…‹zÈj?|kãˆàrûåxé¹É¯ÎPÉòÒé´rÙ2hil/r°{ÞC”ÿßîì x)~Xr¬#ø'tÍ-þ/H?™N'®s1Ÿ]ØÆ/Æ7˜U$Ô:æ[“”·eïsgï"Â^n˜{úQ—z¹Ü s áCíÆ^eƒx¹—Ài|u®To¼Œ½¯—:CÇÀ hùWçfníÇË{Á* ¶9Ê‹ai…=%/Xy@“‹´ sB%— Ò„IÌ£ÍB¹˜N=B…N­êÏx<ÊùŸ\}á Yâ':;•GåJ°Ì^Ã0À•ø™ÏWë7AhضQêåe»)ƘÂÀŒ«¡é>ºð¢¬ëA~šº|5°C ´¿oúÔÀ‰¼Œà€ý°ltŽÞÛB2F¦)Äù6Lal«Ü[†…Ý99!4“Ï(ÀÄ•tg)GU¥iƒLzÀCƒïÔrlÓÀË2ðk‘ºœ˜eXÍV+º}®D˜jNº¶ ±JsdÕTØC>föKEa`(}rx~ã!^‰îoÉ!ê–'²µ—i{V‹ã”Ï9ZËNAX‹Ñ‹^Ø?4BÏ@òô½ïÔ_#k0Øèùeoïè­qÄ”t_|þŒstõ¥Ã¶sÓÍbÿw{#ÄtÅ>gºíÈ]Ü8îít±œÍk.kuwdƒÕ*;ØÖJX yw€™ë¯qPD˜C†¤1ŠÃ( ÞòªÒ7 Ó3ôfüMRºïñíÔ¿BPƒ»a%Ãtô hׂnDÆ|Dï!åPÈñ¦ üQ#~Šêkð5€×ØÆ­°3]t Ú _Ô¨‹5ËczLÏ÷iñàg3\©}Dq‡‰Gö¿ÍÆS‡…oN%>üJ3ù–pû!¹°Çh½Ù æŒ"ÄgN_Ѥœ±FÇw󛱜j ‡ hJst¸¡>øG[À}¢™Gl&pÃá¯>Îh #|ð€k'Í+Ä{ 6ÈÇ}Ò@µ…uò±­æùÄAÅ?äCúÂ3@—ð´:‡„¿ƒûÀØÁ†Õ ‹¡}±¡WnþŠÃö×!x­õFŒ «ÚL$ƒblFRU1‡ ¬ö"Q³ä@ERè2ÛS,`×0Π,çÉsJw)±¡šT* ?qßëM»Kè½. Ÿ‹ˆ ÔÜM&ê@Àõ+@Ï0‹°ªZ-î&v]•}ÓF}´¸¹uúh2»œÌ& Çþ[@q—,Yu±!}E÷õù2|øô Ë{Zªá®ÈÓÂŒ’ K:¥¨ w"« U%©Ô¶ <«c[³„"—d½¼gdĈ(EŒL®'&YÓëŸç“1Š®½Ü‹9£¼Rñ š.3šŸ6báer«ÕŒ“ž- S[£HÒÊã0ƒ‚S¡Ñs©R²Ž .æà²8k 3-JuaVù«ôŸ‰§†Wn +‹q QõÐãŽÊk‘¡1¹„ƒ.ŸoŠ… ¢ìE*3¼¾’Ø[Ή\óñX ^ú…Òü4{²4¶Ë˜kŽèõ•~÷øs˜Xö;—åxî&ª~F»b¿îÂûã}t9šºfàKU幆ÛËcSU 5½$€Ìd®) *k"ž£!)¦h[ ƒ@Ê)gMÍÙ¥‘ç&¬I3§µ™dŠ[å&œSëM—gL†ë†çCíͤáNElŽÇÐ!Acø#…\{ä¹—ÑîI!if’ŸDkç°«‚±²Ãw—óü@ùÛC^T`q2ä#›ŸÆÄUÊ̦·í=2ð@±‡XÍÚBÀ¨e EžƒöU¡Ý€wQš™« ·UK©G(X.L:»NUJ‘ƆT™_Yú[v2å5x:U’I¶”2nÅ$;–ç2){x¦Ó`ÙÍ—ˆ”ÆÝE¯€Í?6+Dž¼¾­ i) Ô=B9YÓ­©ls¡®IC³ú² X©q£em˜×ýHZä`ô¯¤s¡IP9j«¡êšJlPA¸’ï?™J­½Riºq_¡§za‹2¸|ÚùÔ³¸a¯›L3UfàE¢ÕkÜÅÍ\½Æ «efáÅ^'ª×+-/ðY¦‡w@ «6Þ|V©Ⱦµ;m^±hH¡u¨5çoÈÞ¸?GU4…­ /l’vÌ štÌÞ1¤5¬®³ºê"°ÜØí£»ô FEÆž×ë;„v͈»Þ$FW-þ`áPYŒo„b¡ÏÝlËÞRæC“RE ö¾6¥ÓÏVÆä·¤k|ˆÖ\½!iÞcœ$¥ô -žÏϾ¡§ohXG·Í/£›ÞF«À}–«6¼n~•’I¢£ ÐÿpÕÑþ»±‹=ÈpA1²ûefëíî $›ËÀb¥Ô*Øz­Ë*ŸÅ|»°9ó›€ê»w1†bÕ’}8z×— ÀêûŽàu¼¢ïãUûRáÌþ‹;ò7êÄM¸&ÿ3íõGwÍkM¶ðŠsúÐG=¹«ÔqîYy—Ëqq'×Uv™c|Bôa ›‘)´oì;‹a¹¤kÌÃþ$>Æ@½jqyÔ>}P—v¼5“ØJp$*[î1oõH3õµØ˜-W@Ó?,§úy‡>F~TPÊ>zybïÈ ø û$­ŠÄg 5ÿΧTAIq ^Í÷Eÿ~Ñ™K¿ú'PK=›¸w) wait.h¥YmoÛ8þlý 6 ¹p6»‡[$Û\GÝçÚ9Ûi®‡ Z¢bn%QGRqœ`÷·ß I½Ùn’ÞåCâðeføÌ3/¤yœE,&ÃÙ×ËÅôòry=-–Ÿ¼cäÛ÷Žy&EÄÈQ(²˜ßô×G8£ùtø÷`1_¾ FãÁ‡qÐ\žrâ↹ÍuÂW­Ñ_oY¨…|_ ½šËëÑäbz=_Î_ÇÁÒ©iìÙðL‰ðÛiýÞ;f‰b9µU'z›3e'³ˆÇM³ÖRó”IsŒÉàs0¿ ƒå‡à·ÑÄ¢âò²ëyaB•" IC&½//V ϼŽñ‹Lñ›ŒE„gš$ì–%]rFÒ¥ù軇?¼Î-—º  ùÓm4£^.…†c³$žœ¼ Ó[&%óôš+I¶¢$J¿Ž˜ä· H›ýD  XÆ `çÙM¿Vu+xd-o›™õˆÒÑÙ™Ò6p§Ò/‰ê’wä͹†¼zA>l ø€‰î9Šlx’ÀhˆömÖ<\Û’2¥è Sh“¡a(d„ÂaˆºA†×é¤,\ÓŒ«´OFñ÷X(H x-f’ÙÕ¾-˜´©’éBf$¦@#ØL¥L¯ED줲³=ƒš;ÅçŸwww>ÂÕu;Üai’ԢߚE$-”&+Vš±Œ°»8Áu²%«­=;C,ä.F0M64Ó}òê¤vÕJˆ„\)@ìÂÚ¥€ Æ1äÁY‚ vNvHÓr¬£ú°öý(~†÷UÎù@xLü¬ë8ƒ »F¡aÄÌa˜IXÖk»¸ h"nˆbZÔª}FüOgf‘ªÛó:~p¯C‡¨µ(’á5¨EýJë´­©¦Á©†py&4œB§@W ´–pMl8ÁYÚH‚­‡S »šj/¥¸~E„" Í®·†»†OèWF#'@†Ôð9—]<Í–‚^ª9oIÐrφñŽÏd´=ͳ±Í-ÆÆyŽ&þ.^¾,‰AÞ¿kìüºò B\üpæä„|EîÚU…£M€&ž­aX#,%umF$±©ÛŠ S–¢ÐCòz%n(4Gè‘Šè*®•=œ,°.ôÑ8RëCX¢c‘$bƒ˜—a d\±ØŽò!çÛptv™ÒÆù¾9îSDCIi(1khÂvr Ž¤AF!_ÊU“®ÏQ¶MàH: f°¨W¶¢pƒ&8 Ù2ÙЭj¨0˜¸€¼HZÀõ÷ ôb…k¶N'óÅìj¸˜Îü‹`6ú\tÉ¿½Ž«XĨX˜÷±j¹ÊT­}]¦VÍEÛ0ÔiÕ’‚ `ˆñˆS9ËB(ÏÔ¥\Üã³fʺÇôîˆ^é'Ì•ŽÚpB`¯l{HWÐTØ %húDY5H‹BŽû„® 3½ª‚ë§ÚTç Ý ´ƒzí\t0Tšb—ŸƒÅ§éż¦yŒ§¿áß±IHeªÙgV#öÀ²58/µ(çMµ›²÷ÿm§¶Œ©šA›ÁQ†å˜”lù¦ƒ¶„gßà< » dé2—ì–¼ƒƒør¸……¯MA·ÀYä¶ïC5Hx<­"f'L«OrÛšu ß‚ª›µÞ0ümj~–kл£_£=4&Qè36ô™9ˆ²¾£*òú;ŒÇŽ¶ 5I^+MÃoMцjš~CËr*5ØŠØe[™’£!lœ›}ó°8‚funš ¨ªÁÉU±R J%®,é[un¯Zš3èÝçÅ ÏåSyU~ŸöHeˆ”n0B5ÉÌ,ª€‹éÎàÃQ¼¬ŒìvϽÜ|ÑKÑ-Üa°e/}Esp T"ã¥5H³=7tÉ[´ïÑòA‚2Þcq 7'8œŸg·"¹Å3do^"´n7]kÍhÞ#¿c§-¦ Öbõ;PÑôtšB?….˶`ÒpG!“B2˜G£ËE|HM¹PŠ¯ ÊÒ(âŽÌxQp4¨¦˜E]UéšÆÝö–Í×`à‡´yExùr,·ï<‹…Ï!ÊlÀø¹}5Ø[~‰“{™ÁnÂð¬â¾á‘èºÜvÞ¾A6 ´vœÐë4Ø‹&¼öÚζq&Ë&q»PËšxBúøšԇP¼†}¼—¸>ìqxíê]7P>:Å›îa¸kïÀâÜ€žI¼ø"äÏÎiÁ½ÿ.NÙ“°ÌõáËwiþ{ÿèÜû÷?N›U÷ Ç¯×”ë© `ÛÃõ\/×…ƒ=Ö’¾¹ûù—¿þåô—Ÿßâ+ÆáŽs"PüXˆ¼)m¯§ô:WôZL€¶ï¶ûžg0ÁåÖb-. ‹˜†õE™¡l…ØÀ¢2w9Ç×` «••ï'Fó-]%¬é}”ËîB–›´©×Ûa¸IU^ŠÙ”{½ÎCuoDa‘oNÃý¦a8«÷ø£é2˜Í¦³žé$€+èñŽË¸­Nç3½køÚïâº6îâUù®†Öê•k˜0*QŠýwδõ’ÿýr[/×,*fZ*?pf¸uóÊ ƒM‘Ú ’)Ð&¶Í3OᤢÐ^Ǽëc*-ICžäÉ'ïΟ‡ªÎ1ˆ¢OP^æL.ÆY›ÿž°Þ¾˜Wf@Ñ‘.Š£§^nº–\³çî*_ás¨¢Ðž5ý^ù8]Z/? Ë.ÍlŒ©öG(ŠL£½†ºö+†_-FïA“…IíÌï-y…‹µU‹Èéè-µ[Þy5ì`Ž£¥bøH‹Rb¤VºÜ z±‘ipSz÷1ª€²ü c ‹J†.c.•6¬]Û`ÿH˜`åØóðÚ„K¿gKMÆTéSpÏ\ÀDez¹ mÜ_bMuÏý³`~5^,'Süî‚õ54žñùðSpq5.pê´5µ}¦WfÏOødÒikÇÌjà|ïõ[Aý´sCt{  ƒ¥ÊµpG4+ž_0,l.­\úñ1Ö_2Aµðêo¤ìßÿPKË=Þc?Ž wake.cpp¥VmoÚHþŒÅ\*¥v!Á`^’€Ðj^PB/ªr4Zì5¬0kË^›^ÿûÍ®pš^´xvvw^žgvLµ ²¢ÇvÀlB&å@¸Glêã –‚xî1MP3Oá2¸ LÓÞ1n{±Cá °—Ç˃‚BYFvÓ¿ÝOúÃÑÓ`t9¾Ñ‡a214í›Ïxè=Mi$Æ<„ Fóy¤Úw­¤o?Î{gg#nË£¸I½órí‚î×퇦1î1Na㇎UÏœ HDÏήõ\—TžWSå+Ÿl  I9E!qÈAßôz'|ñ¸C0×)ûð3Ë—”¢é³ù•¹³¿ªíÅú^´”ÛjAfØ>†ïµ /ÅiÀ7ô׈õ7éiI©GÃ÷$ !ôa{+\ àô½…\.×Z)b ®ˆ2Ým‚NI¹LÏ[ØЂCm„¸Dpàù|q ©ÿÉƽdöR†H ·+Ò€ÃKƒ¿°âþ˜‹é•I·”˘ˆWy,€ ´&|<"( `/ _`Úðì1©ÚjWÕºY3µÒðîËdz;™< o¯'ã«ÑSÿþ~t7Õ#¶¥¾«'t»Ð0,¬E*3â±fκ€à–̤]o‘ךWJùq2÷¨Z¦­SbÍ›vEÍËn×\ÚÌfdŽSË©g³†c‘:·²™i¶œ=Éf–Ó°ën›d³SJëmÛµ*ð04ñhΰ¨V¦’kJ®)¹®äº’-%[(»~zÐm@‚óz³%ß岡•0!€¤+ƒ£Æ¬,_h¬YV ór™çÛp!Г^ÏRµ+“ÃöL†ƒ•ûìÂÌ\X;%y¬,=”ON3ÛÊîš%h;Œ ¡!£‘V’qX–ܳE©‰»ÿ»¬É§&m»ÛCy[Ú®| ó³Û]fð½„5™×‚ðì1ª<²tõ¤`Å(o³¨0(X–ëX¨†TØ»¼uù«îªiºÙ9Ä Á“2yĽٚu-”r–vå êÍ(3Œã»bø\»2†ãgñ˜[ÂÙ×tö55$B*Z¼o¾:è°Qv$)°†'è:P×ã/eÁ Wh4;qz>À–7d»§Bö;¦€²¦/¦‚\Áa@B²Ž*­ªO'Ÿ§X%"bKæQÐ_ž8:’Kßqì[קїûéݨz¸½»Ð±ÎΦþˆÇkݨB‚˜uäÉÐÂNppTLÕ@••«š™ª‰ªF®jeªªš™*KÊØ%ÕÛ³þ›žàÝßÈXn>_]2f\âÅê¢`{ÇôwQ|MQÕÑÞHîþa<þ®àÂÜÅÕo³{‡ü)+déÿe6æ…àk~K{óʺ†Õ+zÁã³/e3ûçRP»ô k’Ö×D¿æù5ͯY–TýÐ>T÷àfؾ¸1»ëÚykÛþôèngµú«½/h*Øý÷Ý?™/ü3Ý\hPKÈ=Õ5Êæ¹–wake.h¥UïoÚ0ý\ÿ7*M¥cƒ¶“€2%¶¨"@¦iŠBr€ÕÄŽ§kVõŸóRJÛµÚ‡H—³s÷î½ggŸ.˜‡ èM~X³±eÙßõKÓ¾ û*IîäÉ>e®{•ÝL>­*Û¹¹ÏÝ›'Y)\®Dš%#ýÊœZzÏ´ ó|0ªöDJnY„ÔëÀ&ƒÐw$BÇõ(NÁ K“yÔa]¢ŠÅ®„ ÏøÌ°lÁ¡a<÷© gô½KL†È–rÕi6ºäžìEÒ‘jÑå,’வi–Òý%T®‚‘`õîÊX00Z­7Y¨Üé) ³ÙдÍQ ìñ¤oNàTR ‡ ÃáЬ(å»aVÚä¡MH>†ÅÑؾžéÆÐÌñN„ _(¸DW¢×"{¿¹ðš ¸ªÁE”´ÉÞ-§œ#S#®wÜ|Þl¹ùR†2lª/7•åÏÆñ×_íÍ»hj ŽÔs¬ž“v†ú¼>”Å•I)‰îyTÒ[ì)  èqæ*’1ßÕÉAh €Ÿu5ØPñ"Ay­)Ê”‡\ÖTÁkÇÑr¨ˆàcè'ˆ´Bôy¢¦©)¿jÑ?hKð3‡¤œÖë D+*CjrUW  º‰òÊðu¤uy,ÃXn÷¢,Kݨ,>éñ˜É´ëœs¿˜cMæñ@w]Œ"e¹¼ÎÚŒ Ç°ðSzDÖ6{çI)Ù:;#¥=_˜&A€RP7ÇÕçn “ðôÉ$Äô¶x²ïŒ2Çïl+{Á}Eç‘#²FÛf˜tº ÖvpALUSݪ»l_&¡åzÆOímæÍZMÒ^Oíºø9ó 2-ñ³ˆ.™r:eÏøã Ç𱾓] _ÑmCÿ³Ò½$•¶C^.ջŪÕÿ Ôåªþ.¨f[¿PK=*6Ý/ª)<¡ whrlpool.cppík{7š¦?K¿¢.çê‰dËrq’mYVbmÛ–W¢“îÍz4(q,‰’Šíîéÿ¾O)™7a¥“tÏì~hÙÔU€ï÷‹â£GÑ»³éùÕdr¾k¯®¢‡Ñd:þq|iÎÏ?D7îÆÞEí‡èþ§ñetr5_þxî£n:¹Ø|ô(ze®Ï'Ñ3úù$2—.ún|iýå<:ÿû…¿ü|]]·çc¹É…Q vâüŽêßTºÛóúÊ™¹*Rßߊ~òÓÙxre»ñN4¹š/ÆÖ9}%''·‡s‹[üÞ£§fÜ—·w~¾¼{kæ:i™©®ÎÕ©º‹ù™ç}möWÎƳHÿû£7Ý ³çÓ‰»¶óÉôƒîþBš¡Óïßߌîë¿rÇgfv¦þ‰ºëKÛW»«Sú³¾|õõð£ýúØw~êÕC³/µ_ó0Ë2ç?êægÑ;3‹œÿÉŸO®††—˜èl껯îéæÏç“/®ÚÅü~f'W׳]Ýèn;½÷õb|Nv£ç»Ñ‹Ý›úò‘ùºïÇO•ôÓbüv§ÃøýÞN?\ÍÕEó³±íK½÷5¸/ꦙ'Þ÷?†¯W»'»Ïw?V¹}·»¼dçö¤û·Ÿï¿Ï?¿=÷åÁÉÉáA4»n/Ƴ~àw¢4ŽãhkþΛ·ê˜¥< o'Û+ùòl>¿š}ñèÑ»wïÔ‚™Úágf¾ûöúÜ_ÿä/wÝmý£K¯Rý£w“éÛÙÙäêÑÇŠf>ŠëŸÇWÃXõ¯ß›ëùÙdE7¼Ú^œÀ.»é®ß¯x´¥»ÖÏl7I·—Ç¿úG~-Ë|:înp˜Ã·³(ÝM¾Xžó0:¹n‡ù&ñ×ꮇ3$Óñûhê—ÓH3ÎŽ§[ÉN¤ÿùð½Þ‰ õÿNÔlïþ¿iDü±ßúK?f4é¢Ã“£G‡ûQ'Iý0‹æ~6×uý´ží..xr-É¿ÿ"ºœ\þÙO'‘ÕP~¦ßøÇËÉTm~wæ¥Ô ö? y~¸÷äùÁ¢µôéáñÁþ¨oÏÇßöÕIº»ç;ÑÉ«ƒýÃþ—ƒ?¨5{ÇÚQ±}1*ùäà½Öy:=Ý{±÷­·õ7ºE#°ÿúøàEÃGß †âõ““Ñáèõè úöèèép×'Çßîœ<Žž =öúä`G•ŒöúêûRÔ]:¼¸•'¯O‡¾;|9:8>~ýjtxôr;zvô½zF}°§«Ÿ|ôrh³:éèøO}¹}g c0؈ïŸèÐqß­CÇíõÝq¢Ü­œÙßús´ÒXY¤oŸ~{ðrÿ`)2G}AßžlkÔOús•¿§š_÷ÍK÷¶øuEV‡›éG5:ü&Ú{úÝaÿËó% '‡K¹Ñ['¯÷Ÿ-{9•mn~&s~í|tïÊžížÝ[yãÖÃû²n–ïØ«ëþÍ—{/N^ííœ>9øöðåÖþà¼zµ½¹ùÓdì>ìÓ‘tÙáåln.çã…£µµ½ù—Í&ýýãÍ¿®_öŇ—ãùÉ\.ßÖ3™üï'S7úpå£û³þ½¡„ 1óó­áH`}&÷oÒ-Þú!~³½ýÉ¢GS9½3ùM¯¤¶Ús•Û;;Q_Àé|ø1Ô1:›NÞv‡—?™ó±»½ðDÇ·†“onn¼2͟œOìÛ­,Õ{û™x;?¸tcÓ» [§½æÞ‰n~§© ß?,~ìö%nm?ÌßD_Eñã;Žf?{4í~ëçOÆóýÉõåüÙxkû®s“µsŸO¶†›MÍåLÆáBw½ìÝÅ…w´ìöœå/OÇ?jЇ>Ú*÷öêÃÖ¢‡oϺí¾cl¦sÕ½±!{êÇúÁ8]ú÷óèzæûA|tëL_^_´2N²ØSݵ›õ¿õf¥·ZÓÞêÈÙõýȹ’qÜ&ÁgÎwãKËÌ,trýãÙŠ“)Óì‡öõ |xé¯çSs¾3T"Ó׋zoòæ¦=÷‹°á|Üì¾,ß'‡ß><ÚÜ{Ù7B>ÑÌس¾Xãä5õQŒäJuN®çÑà Œ/®Î}7 S¤/h«Õ±óñ|~.ó8ÜŒœŽÅáèÝäú\ÓÝüÇõ†Í®ÇÃÝDãNÈ嬿ޥè ò*zòÁ»íÝ-ÐEûÇz5:zõêôÉÑÑóS…JééÞÉ‹Ó½ïöŸ÷f`óö„=鯗§½ŠÝJÊí¨;ED}sÝÆÔ•ùÊ\ßÿ!¿Ÿåƒã7k8‘ñÞ]””’¸¿l~æÏ5¨¿¸¬Å%êƒn³÷z¾/s©¹­ø}R'u'µ«:‹]½½óñXš¥YmÓ,.L——i¹zÌ–¶Ì:[V¾kš¤Åu¾öu]ù:ÉÊκ®í£„Õ:몮Ҳ®rk’$³íêµmÝÖδµiT¡K’Õc±¼Ê8׫Ž‹8›Õcy—wi¢ïié»õ:³2+]•Æy_ÚušRÿRSMœI×­s©KËNß}ëÚ&¶«ÇºBÿ2½Ú¸ìªØ¯×Y5UÓéå»:îÒýWveg’RË©óY¼z¬Iš¤òM¢C*¾t«ÇŠTÿŠ"5&®LÞÕëu–q7®ŒÓªs6Î+ô­m­5­­›ª,‹¬@mÓeÓk]Úf¸NÃéãT¯\b’Ôf½N“™¬-MV%IQ´.ŘÙØfqlË8³’4ô_ÕVm—èÕÕ¦+ë|õX¦ûsyV´…OJSÇëu&.qUž8_—Mf:´ÅÇ>6•‹,¯œk3Œg媪uUWÛf)ä˦6M;›Šš¦±ëu¦>õmúÒ5eas”›·y›%y[¦U/ºÍÎwÞÉç7ªÏ'dz*ÔŒ¢ªS5Ó»"hg¡>Õ ¦Î“Ô´¸¶Ò—M* Y[zï1³*«œÍ*Sxl0&¾ðE›ù¢Òˆ;‰çzZÍ÷¦«­kÒ,A;»¸‹}ÕÅ.K$a)ûÀä&+rM¦ªkò2팓¸:Óø¦0Mž¯×YÔE]¹¢îLZ´±ÁýÚÆ6Ÿ&.­©;‹ù™6icò´)ŠÚiùŠ ªc#e!ÕPrÛ&mÒùVc’wUWà~uiÜj’•Mb g1že[¶mR¶êãÊr«f©¯‹B-©\ÔéZg¥Kê¤ÊÊ*Ãý®peS8ukÞª¥«ÇÖTîµë•_¥WKÅÕzšöm¬WRÚ¸nd(ó™ÔS&‰—.·㩪Š$‹´Nõ$®+«²ª“²R–ÖWò¹ÏÛÊç•&²+è“´J«Æê{Ѷ¹4 d(É“¤É“,-ê:­p?2 jCݦ¶qœ ¦Ò? _¡Î*¤81W4ñ}£)!ÉìL‹:›¢)4G4Ì4_Ž±vµ«¥EêÚ7qE¹^g×vêÙNw–ž­0.š“ºÊûTšÑ&–s×VRü•µ•ô|Ý•úª‹²”ÈtB²^§Ó—zÕ™²öFÚ rR%U!¥ÐÖy›zÊ«¼Š½Ò\WæÔÿ²ššF¾ÎM“$˜+ÖXw2ØÞuã ó2‘®ÍSW&w=¤®‘—Ðv²hM™¥òUÅ꘸Êê¤}Öã©é¥º8Ñ„¨ çŠ)4Ð…ñ&í¤zÑïuVgY)coÛ"i=ú Ó—µYV]Wj"öSŽB“”YÖu©•–Çý¦úWÇiK9HC_è«‘UΚ¬Î›r«!I\S%¦3µ—'ômmë¸ÒËÛ®Ö<ÄxÊ(ó¤±ÒŽYê`¯ò&o2½4b)jÈk\“g®‘y42Aßvi—ú¾Yâº&C¹R ™i½”P^;)"ô{[´UR´>•5*[Ì•Z_‰©ë,oÒصýlLc ©k“Û:m2ÈB*w¯©õݵ>·1Ú"74µu–Ö®3eÞb<¥ØbÍçØ7¹‘ýô­Äº‘z“‹*ƒ¯öbžúrò¤¤Úr/# ù“Zì ½ªºë4¤˜÷²%òXâ.—{¢èc-¹)y¨i¦5O½œqâ4âŒö¡–¢vú®AqqL[f©®D»ÒĶóÈ_§Æ'Mjó¤ t¼æºî´ÍmSx¹Nô¥ò"Ï]‘7&iLm!_š(Y%WÑ[_d²Ü=}ÉØHf%šyÌ•2/ÕkeË)·uI(驮ĵI*ñB[ä‚eNv¾•S#+ ]’¤Iš×IÚ(¸Ò/Áxæ½µwêUy’4”«N¯Ó8®s9åò 0?mf³´µ™ Z-Ÿž~±õ¶©¼´_ÕÚÂí”k¢îU˜S6±º}«!“*UÄ’$}ÌB}+#ûÚ%š¤±ìdÚeš!zªÚØÀOPx¤`DÅvI&wí\ûB;å&­íÕibt˜+i›*ŽIÛ\.¥Ìh—Éy±…¤¡j{yÀýÖi-m#E$›’4ºØ•®”ÏWÊ“o4Üèw¹’mi9v•;›rÛG2¾•i–þ¬*Ì3Ù…®.M—Hò¬…Üö¡©Üt™y×9Å;÷ÞAs…\!Inì›­éPÄBÚT ×ÐC ,5©¥þÚ¤–×ÃØ!ζeŠ#;E“u*”éÙÔ´UøžÙ@÷©Ø®³Yç ÞAn·jrE“&Ö‹ûQü­a3r “¸hä@*AÞ°7q&ƒ,}ÌÏ¢”ORqçß–¨³5­Q@k$Ô2…1æ®L œ·´SàŸ>Çu [C+‚ö¾jä…sEQ{Ñ9éE)²¤„löΞ-ë°d XÐïF—IUË;óUùÊ]î$ŠcÊ^‡óS¡Žœæ&•ogš6Ð5 $5Ã@µVnõE—I—YœxE㸮6µ‘(K5uܘ šJê&½©¿&縔^ž/ËL#–ÔÐ5 Á}&¦Ò ©7 ÓR™W…ýò³Ô ÁxÊ G.·Y§åÊUåš “µEFÛ¡ÆÈ»è}‹4W„ý_6¥J-­b¥,)Bû© WbÛ4mf|W2þ,l!¯Qª¤“Î0”¡"-ëR]InÈ ©·¢édZ$Ûá:˜ŒzªÀ^!s¿,€kåÓ¥ò@4ÍŒ¢(‹>)“³ž5²¬®J=ä+·¹M.0eÒ(@ âlÿeQx«îkmC?¡–ƒàªZá\ÑÅ ýf9Õ’ºZ¡G]Å÷#÷ÕÆ2¸I^—š¼Žw‰“G-óPJšº„ó¾wä½)ò$n µò•úÔt>íÝ"§ ½(KÔ4eotk+—'Û¬U¨—ÿJÁ ÆLÆW=Ÿ$ª;—9±Í¾ç®L‹˜:ÞËK¬/­XfÖuê>³$ɳTBQ+|ƒ )àËZ[Ueg›¬Å1™2몮_j}‘£ßå¨kâ\^V.«®›ô D¹bò2 ›¾ y¡­‚HMbŒ™L™3ŒggsgRúÅ.vYË{S(dÊ`MJæª÷¥Üf_1^–‚+Z×µe›¬Ä±ÊWÞk]Õ((4´Ù¹4ÓL.ˆü¢@Çk8åTg½ßÒ÷!ô‰Ô»i³DrÛP÷¾³ i¤¡’ŽzZ_yž$u]iÚuÖ]­¡ÖËÖ²5׺¤„ÓBß42°9U[I3VNc#gúV£­õŠÛ2¶­Ö5å¾Ù.ÖËiÐ4¥0ÏÔ‚Lö¦²šEr÷1Ö K#©Í»Þýçúô¨ÂpE±¦$ˆËZ9Š²dšarŒº„2¯NÍm’5R ©\zŒ™Mm§¶r-ê÷*·/+[}/ÕÜ6dH¢Pµ­¯J¹D.«¡ÃdV¤J‰ŠmÍ 'Roy&«Pú.k C;·t\dë4nI oå&”2'¥,^fˆa<õ;Iƒ‘!¬ ÈWß}¾_îìß»!=µüÁ4ɪ¼«Ý'—¦·HFöHâRr=^_êŸ~-Q?bÊ­œˆ4“J-}Út5®+úÅñDÆO˜Ñ€úVmShdIµrû8·%y©âë¢N«¤,¨/\#êï‘´Š©omi“ù”áVS‚¾•˜$™¤QÐXª¹è¿\¾¢«¼¶¯;ÆO=éºÒËÝ” ¥°KöD/“KBò@nU@!G2nä0I—c®4u“(ÊäÅ]‹cI.£ }ª¨5Oë–6GJÞd2Çý‚V×>µÌŽœÍDÃ¥ù/g6ÒÈw¨{Ñr©„c&÷£é«²“rMc\§¼Isyêuêä«ãYÅU,K+Œw>v”¡²•„´¥kŠ\Jv%E®ø;¶^É%i¹¯NÑ°S,ì5?ÁêKŠÆ¦Þµš\£•²Nd9S W—Ðêöº0zÕ¦©K1ÇLú»‘Qø~=aããDQäeÐ*Ü­‹¸Â€Éÿ²¥“¢0YÒÖ5:O:º¶U§‘VСi!ϯоÌUq’ØÞé[©ÑÕ„ŸkËQ€ŸD”„Ÿ¸›–ð3\Š'ü¤9"ü\škÂÏ lh ?q¿á'Ñá'Ý{ÂÏ Î’ð“á%á'ÝÂOŽ4ágà~U„ŸÄ‰„ŸDe„Ÿkáàg jSÂOªLÂO”›~ry‘ð3p¿ ÂOÈfFøI·—ð“n/ágèÚ~Á~i~r‰•ð3De„ŸL1 üD[RÂObÂÏ@½g„ŸL‡ üı˜ð“®ág`ÆRÂϵe.ÀO"$ÂOâÂÏÀŠ ?‰[ ?i: ?‰?C×–ð2ß~r‰šð“‰ð3De„ŸtQ ?‰´?&~†Kš„ŸDH„Ÿ\.&ü„é¬?P~B'¤„ŸDH„Ÿ¡’ð3tK?‰9?éö~•~u¶„Ÿ\F%üD; ÂOâÂÏ@†rÂOôQMø ò„Ÿ°9áç'\[ÀO"/ÂO.Ï~ÒU$ü t‚%ü$® ü$Z!üÄó„Ÿ?T~âÚ„ðý×~[~†¡ á'— ?Ñ á'S«?ƒ:=á'C2ÂOâsÂO./~†ˆ—ð“©C„ŸDä„ŸL5!ü ÂÝŠð“K„Ÿ ×?‰ ?¹Í ?‰¦?áŸå„Ÿ … ?ƒñt„ŸÄÊ„ŸÐ‹†ð“ËF„Ÿîs„Ÿ\æ"üäòáçüüD:à'®5„Ÿ¸KøIÄFø´Ó~ƒ~2‡ð“Ë’„Ÿë?‰‚?™ªIø‰ëjÂÏ@n[ÂÏ_Š>»†ð“Kg„ŸÁ²[BøIœCø‰±® ?‰œ ?ƒñÌ ?!óžð6Ç~ ~}[~e~Bÿ;ÂO.=~~‚!üäò?á'd³%üD;ÂÏ`~ÂO.‡~2U“ð“龄ŸaŠ1á'Qá'—ó?‰ ?CdOø‰: á'ƺ$üdª ág ZÂO¦y~s~b<+ÂÏ@n ÂO./~ ~2eœð3Ä­„Ÿè£Œð“)©„ŸD2„ŸÁ\‰ ?‰[ ?™ÂBø‰û) ?ƒ¸,'ü„ï?™.MøÉåNÂÏ`=¡"üD¹9á'Óm?‰ž?¹M ?™bFøÉ´"ÂO¦²~2”~BÇ'„ŸÜ¶AøI$HøزŒð“Xžð“é^„Ÿ°Ÿág¸¥ƒð“Kü„ŸÄD„ŸLñ$ü üxOø ù3„ŸLÕ'ü$&ü ÐgFøI$MøÉÔeÂϵm€ŸA,˜~2m†ð2~2‡ð3˜Ÿ5á'ÓÍ ?¡SÂO¦Í~}k ?™ÚAøÉcÂO¦Ÿ~†Hðmñ„ŸÜAøÉt_ÂÏ@'T„ŸÜšAø‰r+ÂO¦[~ó3%ü$6%üäÖ2ÂO¦~k59á'Óì?1fáçZàgPgAø }[~âXNøÉT9ÂÏ Î’ð“)„ŸL?#üävÂÏ@n+ÂOn¡#üdªá'Ó8 ?»’~2­™ð“é„ŸÄ­„ŸÜ䟤˜äŸÜŠDþÉíl䟤ŸýfÏUþIOü“/ù'W}É?CºBþIòGþ¹¶ñ€D‡ü3ÐB–ü“Zœü“«}䟔vòÏpåü“+¢äŸ\&ÿ$<'ÿ ¬gLþI¯†ü“Úü“Z‘ü3\Á ÿÄ ¬É?™ôAþÉ„gòÏ`åÍ¢où'É(ùçZ¢øg¸2NþÉÄRòO&“2ú$ÿ ‡È?×6–rˆü“›_É?ƒ:3òOz`äŸL>#ÿ¤çKþPÞ˜ü“Tü“Q-ù')%ùg m;òOkòOZòOn¼#ÿ ½!òOZ^òO’eòOn@'ÿ <Í–ü“ô˜ü“Þù'WšÉ?‹]2r%ÿäª0ù' ùg0?3òO®‘2óƒü“+䟗В®%ï2‹…üsmÕü3ÜàJþIÚHþÉ=òOf…2Ô®mÂÿ„ÊÈ?™=DþfòÒƒ%ÿdDþ¹™‚†$’ü“/ùçAÿd;ùgзŽü“Ô‹üs-Ãü“œü3Üè@þ¹¶ þ¹–hþÉ 4òÏÀ®4䟌tÈ?IèÈ?¹¡›ü3ÏŽü“Ñù')ù'‰ùg¸ Fþɨ–ü“Qù'³_È??± þ¹FkÁ?¹1ü“T†ü3ÜœHþɤSòO®>’2$ÿ #$òOR{òOf 23‹ü3ܘMþÉÌIòO’4òO®j’:!&ÿäŠ;ùçÚ\À?¹¢NþØ•–ü“ÙäŸÌ¾"ÿä¦còÏÀÏÈ?)ýì7{®òOf,‘sÅ’r–ü“+ØäŸ$LäŸÜV䟿Œü“ÝÈ?¹*GþÈ!ÿd†2ù'ôPLþ¹¶±ü3h§'ÿ\[¹ÿd ù'3É?ÇRr5žüsmÅü“™äŸÁ\IÈ?×È2ø'Éù'WñÉ?ƒ¹Ò’„“2ƒ›ü“åäŸ!é ÿdfù'WÜÉ?ù°òÏ`@”ü“Yõ䟾É?×vJ€b:òOf"’¶¬ ÿä®5òϵ‡ÀòÁ/äŸán$òOî¶$ÿ$U%ÿänJòOÒÏÅÃn?òO® ‘2÷–ü“<šü3ŒÈ?qmJþ¹öF@€5ÚþH'ÿäª&ù'%ˆü“Ú–ü3\Á ÿ$= ÿäÞòO®4«šŽü3¥$ÿ$±&ÿ¤"ÿ ½xòOzŒäŸÜSJþIbHþhÛ†ü“w$ÿ„L[òOÎ"òÏp//ù'WyÈ?IÈ?iÈ? Ÿr%šü“{LÈ?×ö³žICþIºGþ¹¶¿üsÍkÿ ¬JAþɽ"äŸÜ×BþIï–ü3èÛŽü“ùçÚ#|Á?™ïKþx·ù'W…É?ùˆ3òOæ·“†äŸ||9ù'-ùçÚÊ.øgH"É?é“Ò£&ÿäŠùg­$äŸ$óäŸk+àŸôBÉ?ƒ©˜ü“ž ù'³‡È?ùØQòÏÀ®xòOF‚äŸÌf"ÿdÄAþÈPAþɬòOôACþ¹–« þfa2²'ÿä ù'iùg˜±Dþ¹ömðO®x’®í¥ÿ ù'éù'W¤È?×ò¡Á?ÃÇÆ“r%‚ü“{ÝÈ?IcÉ?CŠDþIÒFþÉÌòO®>’†û‚È?¹¿“ü“&ù'³TÈ?oÉ?™õFþÉOòO>Öü3˜+9ù'³‡È?¹jNþÉUjòÏÀÉ?× þÉÕ[òO排†í#ÿ$¹"ÿ\Û»þI*Cþ®ö‘2r%ÿä£<É?™1Bþ´Ó‘2z'ÿäJù'?f‚ü3ðocòO®¼‘’D’’\‘ú6!ÿü¥ôsñ°Ûü“äŸá#É?ùLòOfð‘r9ùg˜!Jþ¹öÜðϵÇ‚2Û„ü3ðo-ù'³RÉ?IAÈ?¹ÂCþèøŒü“DŒü“DŸü“Y»äŸ!Í&ÿ\{ü6ø'‰ù')%ùgàƒ%äŸ|Þù'³ÓÈ?×ö჆«`äŸ|îù'³|È?IËÈ?à òÏ5b þÉlòOfÄ‘:¡"ÿ$]!ÿ\{>ø'3€È?ÃljòOfi“2#‚ü“«äŸýôäŸ|Î ù'³»É?ù8XòÏðñ¡äŸÜËKþÉÕoòOîË ÿüÄ£“Á?™ÑJþIšMþÉìQòÏpeœü“Ú%ÿdf3ù'3'É?Ÿ’’ü‘rçù'3¸É?ƒ˜·&ÿä 7ù'÷ð“rïùg Cù'WÆÉ?™™EþÉlVòÏOìÿdùçZ†ø'WãÉ?ÃŒ_òO’+òOî¦!ÿdfùgø¸IòO>‡ü“„Žü“Ù/äŸaF>ù'³ÞÈ?I€É?×>¾ü3ÜIBþIBLþI’Kþ¹ö1&àŸá®+òOf/“rgùçZæ<øg C)ùçÚ£§Á?™1MþÉ]`äŸánòONòO>Žü“™üäŸá³É?¹ƒŒü“ÙWäŸÌ $ÿ bÞ’ü“KäŸkÙ®àŸÌŒ!ÿ ìŠ'ÿ$á$ÿ\{-ø'‰!ùgøñOäŸü¨òϵÇoƒòÙäŸáG 2c‰ü“YIäŸÜí@þÈmMþÉì5òOî$ÿänAòOÒÏDaž-{NÙÖñ°ÿiuc¨b —vE¥ájŸ”°±¢ÇåGµµ7Ò5UÛû}«Å¦®ð¹<ã^­,+V^aç¦oÉÊÁ¢¶ò綾Öەƒ­+\w¹íáVQ²XŸKú¤ÅûÙ¦ÐÕ§ñúÊ–¥s‰¦á@_6VðJêÚ.®Œ+úd¦l{ó¯77=Zù ÛÖÌÆ6šß|”ïðÁ±»ÑíGûΆrõýiÞE“ËÅGåî~â³’o> xù ­÷Ýðé¾;üÜÖûÃåýG&ÿ¢—ÝÐIýç:êØÖööæÆ_6‡Ïþ}ñâ·Ÿ(ffÃ'îÎÌ…¾Í§×v~=õ‘ÞÝ¿=§õç“w}•ÎwÑéé·/_nn„÷ðÇ2W ˛շ³+cýIùæ±N_|¶ìÆé©™]œžª Ÿ&çê°s߶¥ ïíö.|~:ûp97ï£ËÉÕÔwã÷ïéØÞÉé«×'ÏN¿©Ë­öýöð^ºµq1ùi8z|ðíi)ù>:~Úÿ¾eÞ«Å‹ÀîôôÅÉþiÿ‰ä_FIÇŸ.òæEŸ{³Zô+›û†õßÖjßkŽ-ÆîŽ3\Ær—Õ}¢#ëW{ó~'ò³«Û2Í¥Ó»³«èaRÞ¾;»n—ï&åýzñv²µqu=;ë‹è¸ü`æAZnG¨¿æÁp‡'ÿû¶Ï>}æï²MvÒûÉ´¯sÜßßxQåó­xµñÿ±qq÷Ý·ÒIêû·ê²7<ÿVº~òN¤·Q~{sÝUkõ¸_[O™ßQ•jšñÊŸkÌ⢛Þ_Ú•á×ñÛ{°W<²-ínmüû¥ßÙPsÚíÍŸíêDÇoÆê'Ïã-Ó_3\°ìûÏ>ÞZ=+Y9kÙs7g­ž¶5‘(©ºþˆT‘${{ãÿlÞ”½Ëp°Æo¶?žõç÷Þõeœ÷oªÐÏ>›\õÕÿp3³d÷Ó8¯W{ÑõCõ‰2ÎVËhWËH¶ŒÙÙty·š-wÝO¬W«²«U%wVusº[==N×L|ƒŽ~v3jÃ]œl]Íή»w7ƒ²ü‘ìD‡l'JonvmäVÊKVËû¹ÓŸ;ñcG}jJš7Ë[cS~£ÌlmäÛo~yToo?ÈNŽžýäèÙŸ=ûurôì7ÈÑè7NØAëýsÎþʾþÌÙOÍ©¿1·G¿tnþŽ¹=ÄÊô^)3ûe¢‰kvÒ¼aÍÁáP§Œ~£NZñ+ÕÊè VFÿ}jeôëÔÊèW©•~jlI|ó…/¤yûãûú_íDrŒ só~r#ôËC+匿‡VÞÏV­¼_¬V½ò~¹zhåýjõÐâýgwÜç³;ÚõìŽûvÇý?»ã>ŸÝqŸÏ¶ÒO¶wxíþ?áÙÞ Zô ªï'qšë—Uÿñ~ýóîgªsFwŒí莱Ý1¶£;ÆvtÇØŽîÛÑc;ºclGwŒí莱Ý1¶£;ÆvtÇØŽ>9¶¿É×Oâξ|ý UÑ-ÇæÓr2º[Nú2.®v6’Á,"ƒô¶°ìŽÂ²°°Ï®/û(_Sêã¯Ïn~}|W—o.cè£WËú&>UGø‹‹Y_š"Û…w[7 ÛÑþg´uûî2,ߎþå_Öcôíõ úýcÌÌÕˆ{»f>¿Y;XY9ØøbøÝ3÷¢­•^#pÏê­e´®¿œþZFæw.nl輩λS««}-¿Slvo§ÿ醟þb2ýÐÿfí½Ÿ/÷wÓæÞJiÛoCí¿nn Qùâï!ò]vÀmY¬Ëõ埿lÞ¬ÅÌ~¨ß<î¯ê—zìøêÌO+S·g¼]=c:Ñ Goý ±ÞÚŸ\\]Ï}dô¦¹º:ÿýá_ãh>ùDi:{ï|6Yžve¦óhÒ ç½0?^Û³ñÃWSéýydUìÔφ%¦îúÒökg›Ýdm/çÑø«øq4þ²Ö·zQX Ôã7ÑWjÐðc­þ׶Þ.Þº=KÝ÷ bÙ¹.ݲt»/á±Þ{'Do¯ÈÊòŠ^ínµæ~{>T8¹ŠþG4œû…tÌã¡°¯¿þ*ª—e´ke¤?SF{Gv­ŒägÊ°w”áÖʈ—eèêÅ×JnQÆ/‰èV{N?øW¿«ß|ýµþþ½8̧ߌßK-¼¼G•4Õ¯cN®¾ú*Ý–œš~”û㣾öŽúÚe}íß?:¨ÏÞQŸ]Ögÿþ‘D}îŽúܲ>§#¿ –\öÙ?'L0adO^ w*}¢Ú_?tJ/ýë#8㌸9’mߨBþ×Ûã¿ ¬ÂÄž…›-ÌÖ;påpÛ;Gw¶½Ou÷a·³ÁªÎý´')“ŸdlÌùùÂFÍdÛ{[1•­P7ŸÏ}´5Ÿ^û%ì¸ArzÞÉ÷y'蜞wrvÞÉçy'×ç]µ0{þâj25Ó²dúù£_^¥Ñüñ?ƒ¡ÿ‚¡·?ă cv+z0}óøŸÍADÓk’¦rÆûóúùtghrGl²Ñ{® ×u¥€ì®²O°ÑN½yûxQÔðÿ¯››/÷^œ¼ÚÛ?8=xùtóÿPK=kªŸ[$ whrlpool.hm‘ßo‚0ǟ׿â†/hˆ¼,{Pg¢ŽM§DMÌžH…B/Ö”2âŒÿû ,Ì%{hÚÞÏÝ}¯‡‰ˆY‹í{°ßAxXúÛU°Ù¬Â%é ö¿“ôPDY3°")L‡Üº±¡fŠÓ‚×V²ž½y»`¶ð¹÷ê¯í…:çZAŸ×½‡ ®Xòdq­ó‘ëVU5ŒšL–"eC©R·ÂtU–K™YÓî9qé”D- èl0‚¼[L{¶è>tÃîíÐ6õlœ@¨+£îg{6éöìÅ­}7‘^¼ŸLÕê<`ß$ŸÐÓ¶Û…-ùÔõ‡6ø,9oX£ZiÃzá¿aá7Jˆ’þY}9ÐõWQ™ £ûáЧÔuÍ)jh™¬sϧîS—yfãÔ 5e]Y) ywM× ¤Ž€ÇB'Š¨gAË‚$ø&¦\_0M_éWÐVú;å¡WLZ¶"Ë­ —°LWÚÌBÈõêå$ ¹(%RNÅ‹BÕÈ2Æ‹Ñäè'ÖÝãì;¿¥4¥ 8‡uŠcÚÀ™‹IÄÖÚPX¾€4¡FÀ8{9ˆmÀ´p9õå,™RÇûˆ]Iä0•>ß³$xdÔû0B×~º¼n}øÁÊ#±S"§*µ53©‡Uûcps-9š+…H18Yk5o*[@ßN%’xŠÀÏ9ù×A•mE[Ç:$«–õ•€®ƒ©P¨]ÜNÇ?Û#ÅÝíâ“l.Úãmí«´:g¨T–ؘO%S8)&ö¨?Ýe ‹¥ßßVÄšsB¹E(¢Ø}˜¦9¾lŒ—¿RW$d¿îq&ðE‡ÆPwó¥=' gˆÉ'=üêàæƒe öeæw š]ÏÛ‘‹‡¡’Ô¾Æþ¤ii XªúÞ Y0Ù })a£àÊŒŠ—šÉÛ=ÀªyÛû˜ð4CƒbSJ³îr&²sObZÝAÑx¤L¡_Â×útƒçÐ8ƒ»“}+_ô4ô´ŠÓàÓÏMøÇß‘@ P<ƒÅ3`<ŽÆÓp|Éb;Äœò¤cÎTÝùÇÉu†–KÔªE_"Ö½S¤õ?åÔòTËs%¿³—ij¤ªßó_|º+þꜣAúîÌ<=A›§{µÜý™ž2sfsÄ®üµPæ¢ÆIêÜÅe¶z†·^ÎÕð¿ÊK'üûZVz}ÙÖ«ùÇP)—ßJ=·ãñ0÷E=|+ Ie¯àm2ûqú†½ÿ³ 6uµúNÞ]UÿPK=(kÈ©<| winpipes.håWÝoÚHÆŶ‘"ƒ¸4©N÷å$œ‰€IPŸ±×ñf×·»miîo¿Y¯?Á-ÉÃ=ÝKbÏÎüæë7³æŒÔÇο8÷3ÇY-ÇSgìØ‹Õ­q„âÆ3ãŒP/J|ŒÞ{Œäé"|¯„½Ñl¹XieëÑO¬ë‰]5¢Xîß(«Røw‚\}Ú*˜·ùxþiSëÎ^8ÖÐ^]ÛŸÇSsÈ¿Å’9NÛ0>|x‡–„úl'ЭKý^ä ‘ 3ÙÞˆ“uD¼žÑª˜·Öt4±Qˆh<}´&ãÑJ‹Vðò`wÑš±±n$p»U²î ‡mÔCÛUh†ð·Ý…g€05Ú¿­gÂeâFèŸ:à­Ôåg,g;Š¹Il¶‘v³çX&œj¸¾‚aÄG‹ªj/¸Iµ 1­k´XŒ¹+G:C@-ñB…–\çáùMõRZåшŸëõ³€,)]/<¨pS)³³®è·s”aÄ®Ô%æLbOb¿W–/UÔ:ÃÐ¥OXŲWÉfÐ*â,`]4ã¥_gCâΤ’ cô¡Í94U Ñl±‚wÆÖÞhŠ-UòÕµÒïõ„ä„>#ÝÂh*V*á×–œqòìJÜ+mtŠ/?©ÐO—ýÆ:¦ye´öB—£NôA›‡!ö6õOÚuÑõl6A‹$’Ä¿‡²b.M- îç6úñåï7Öda·ûˆÈ|—W•Aiò¾ÆнßÖ®À>"Û8Â[Leª„X€¦zý̱‡É3æÇ}ÏOÊVW»¹ìæx½T±*S}—¹t‰¼a|ž&TBÉ\LWfk®¿IÜAë$è"A¾ã•TÏLi*ÈUy• Á™MœóÞfAvâ7° —§)¿Aïܯ*àÙú/`Ö%T\›ôKeaV ¡ p§ptîå]4t£h£¿Ñ€çÈËzÞs¦×·+Äü =…ôfö|b9Ž=Rà •ŽÜ8†<Š×¤q0õaú@÷¨ãùw{qcÛîíÍ|â¸_Ig§õÒ`|½= ;®?o.±†×SÇŽ§îhúefécqØGm·a|+iBöBÝÆAÌ£Û@x¡¾xÁ3ŽárÙÉV‹ü"Úó†m)è4›°¼³Œ«{Ó춈¦Y†Ñ#š Q,8X=rÌ~̇¦ä ­è$ü«œž+z? §3Ììö€õ9^Úm)!îØ=˜°ª‘ƒý¡Â^öPa>è>!“dÝÑÝzÐqâø¥ Óuf?¦­šÌ2o«”?âLÞàoç‹Ÿ©öÈÕt†Üû &›¯›|WüLµfݤ¢r6ÌOúñõ£ÑaÄ¢’f&Ò˜‡ì‰S ”›$R‰¯ÂŠõ³Ù¾êœÑlá`çhŠ,ÆúWB°¶¤ëJÚÛ壂¦Å—Põky|z ý~©øh(Œ!(†Áô¼ £€KØ1ÿNÓ'Ó™³§ÍÿLf 32ŒjÅÓÎLFi)1'8™afZ< |!üêë›û{ó\ÿôæMÑ™FpƸæuV+‰F×ç´†½– £õñ§1:çZÃ÷SÑÉÌŸF3ã‚ëÌ pe|5—^êôdŒèuÚ“¡á¥ƒ !¸_fŸ±2ÚÝLg]p=X =àb`š¦¦š[g+‹¦Ù`ì¼(ÈŠœ¼(‡.—m+=óV6ÚÉ«GgÏ4³#­Æ{¿ND¾ ÃòrM´Ùvum%kÞ±²¹Å÷8™]ÐîY ¯Á§¬QjÔbTDt v^C°bkm™¬fá×Ôî`Ñ&zDt¢—‰\v®¿øßÇ«Ôé’x v6;ž\»Ü qRq?™Pr›´\}Ü0;ù36QtÖ¹‘óaÀÂ]Ÿžžcs¤¿yûJ?µF£1°qæn©:ûm & ¹]1í±çÖÕ¡ÞÕ& ‰h3Ý"ÀlÀ´‰˜IÙnk_"¦Ûn|iÛ…}m(³äÌ}gVÖVÛ-úºýncÉÌÑwî¤=i*åI¥Å,†Ê­c£X,âò”]YMÂò3½’i¤s7 %-Ÿ ˜fÆŽ» ¸Ý­j6ö´fìL_jæÊÚä‹´¸ïäÌ›ª¦¾Ý­[Ë@ƒÚ@Cn5{xÛÅ-©6aM›lhÛœ`ë̺àQƒ=¶iöØê†CÙôdÍÌC°~Ëx&¹ïΉôR©AKS’—+–K+ÅP‡÷;Œ8ÙŒ š<Ùlˆ6ßL©gt0Z…FØ. ¾¿±ù›ëFjG¶©EU»•Ü•¾ÛG–vdiG–vdi#–&ëØ[¬CW º½ö*V²Bë «œc?bP Œ“ýlÃTðF£qIHWª~0£‹9}‚CD";]cì ¦Ý2CëÌáFgÞØl\š§=¨J>ÆnT%÷~1mbC~WgăÌ-/yš°Ý Ì’XlvÐE…í£gÄ]rºÏm²KHÕN€:?kDŠXzÆüVNÿ÷Øaøf‚@‘ß•\í@{œÞ;Iºo·Bÿ´­›²ÎçR‚#[føŇ]‚Ò¶ƒì“¾µ›ÛlÎØŽÀv¶#° lV;°Ù5`Ë™b!2ò™ðì»ùcFíipÓcÑÇê$¤ßˆ¸°áÞIŒ¹7ˆšŒU7˜rõ(‰Iò5×™¸x÷~ŸîÖ}‹;ú’ªLû¨§KKêôÒÅât©Ãø SˆÓ%8ì5otZ¬Z÷ƒÞ«^Þ}í±ì˜¤KÐ ÓÊ”E‰Ji|žAP1¥ÕǺåg³V%ó"å°Î—ò¾V¯Š•2?Xqš’Áõ 6xüè:}îv7‹zºÅSs.Û€äÄ0´¥c*ÀZUoÕ»IéLã|gn2ë^I]&©Z§HiIwýîYj W$ö}FKÒê|¹ÓRn·”[-åfK9j)‡ærÌè›ËÛê·È·è3nÑÜ2Þ1oŸåbI3¤èo’6E~“\ªÍíÑH×î­ZZ×Ï/ßÜ\>¬o£ù:üuĪݠ_;fsU¸¬¼"k5©¦5‘XI)ãé!ÏG ¸[ÓànM¶Rdæbk˜ñGú{ÞÇžÑb…’Û«n±òi¹.‡i ßSÕìjzWëcLrð0…á¡_—šÏÊéT"ÍVàš&f?MXó"Hbá'?³rnÑfËá¥)›¦-v;…g0:C¶Ó 2^+3 –„„ÖPÑÇì­’“À;§”ï X00hQÚ2b“v?°£¸VHNÈ>‰zû$Rꓨ·O¢ƒø$Rá“HµO">‰†öI³·OšJ}Òìí“æA|ÒTᓦjŸ4Uød›13{y—©Ì³Ì^^Um]Jšj¿Lféj’-Ry‹g–sÜÓ<‘Y‘'¼+i$¸HówVi¦„‘©Oœ£´Ûe ž¡kæåäºWÓÖæ:·ùέü2Ÿ^霰ÅzÞ1Š‚hmÖ–¤yU¹9}˜î²éŽ;,ïN󟹃 Û64­»Ñ}ŒcIldÚ÷.ûà÷+Pݯ@eÓo~Âçô—&Öªàµ'ùLíR*a«qfá]7¹ðn1*ïºOÂ’ .© ô$ôCÊô3%©µ((³(ìÅ¢ Ì¢0E‘2‹¢½X)³(È¢¦2‹š{±¨©Ì¢f³Ew­5кֈ­1xå¨-2Ÿ<ç&=hþ‹ŸÜ*:ö8]jþ ‹ºIÖ~ðç©wF7Âýeyø§7ª­M![›èÃWšÜzžHñ²°6Ærì‘wÈ3ïº8`Y¾†ØµpÃÏRSE3­—Ê2k Ò‡«eÚU«YJëƒ;I§œ œŒ›êåøô”pä±ûŒ?Óè§7Ñ„óì]cm·¡¶ÁÅÈùE¢‰6M¾ûŒ´”TMe…¾«ðÿ©HpR™Y«B$ˆ‰ ‘HL$’iŠ‰4%DZb"- ‘¶˜H[B¤#&Ò‘銉twŠdéB;¼žK›­Öt*5‹|€jM»IfÐTÓmª6ÕDM½7Ö„JMú” ä“„š±tš%k¶Ê¢“ûHÊ‘MÑ.“OQ–ÃZtQ½×+ÓS©Í)Ô4Þš:v¹<†KŠ| lz. x×´‘¬™7æÂî¶ÊòAS‰åÀoÚ;¶ÄíªÄdó8cðJ”/*¥VÚnúâ”RÓ-žÙT³Ù3c6ñfœg¦£$&mòÌ8óLà|-nöLhöÌ…Ú=“SÇ.—çÂÊžé·»4{fÀ7 DšmõÌ,¹©u°"ž MžwõÌ Ý3¡ÖM°iÅL$Œ™¨f"˜‰vc&ÅL4 f¢n˜‰Ôb&ñL4f"Ì4…1Ó솙¦ Ì4wc¦)Š™æ0˜ivÃLS-fš"ži…™¦ fZ˜iuÃLKfZ»1ÓÅLkÌ´ºa¦¥3-Ï´†ÂLK3maÌ´»a¦­3íݘi‹b¦= fÚÝ0ÓV‹™¶ˆgÚCa¦-ƒ™Ž0f:Ý0ÓQ™ÎnÌtD1Ó3n˜é¨ÅLGÄ3¡0Ó‘ÁLW3Ýn˜éªÀLw7fº¢˜éƒ™n7ÌtÕb¦+â™îP˜éÊ`¦'Œ™^7ÌôT`¦·3=QÌô†ÁL¯fzj1ÓñLo(Ìôd0s"Œ™“n˜9Q™“ݘ9ÅÌÉ0˜9醙µ˜9ñÌÉP˜9‘ÁLAÇ(( @„A0P$:†‚@q,„‚A0X4äÂAñ ®!5!‘xLh¨ Pרê°X\h¸ÀTdÄCCÐ16J‚C áð ‚Ž"P!¡ #© ˆG‰ c˜”ĉ@ P‘"(TcE 8XBÑ",\Rñ"ALj( @Ì„ƒF0PÔ:†@qÜ„G0Xä¤BG ;‚ŽÁ#P=ðÇ` tŒ âÅ`° 4F‘²ÓPù+g¬ôï<ý“ò>»Âݲ٧Oѳ‹-ßÍ -êwB᮸GvØ÷7‡nËä¢âox‘ÆT÷馽s·¹ïtèyßfaw»ÐÚóf[ò‰¶¹hì™Òh™BKîÎ (Æè˜i{Ì´í¼ª´a´bÁ¦½Åá°¶cÁ¦Ž›X[°`Ӝڜ‹Î±@2qY ` s›¹Íªy’æèX€öÀ /@¼õæH/8f“?ÍlrÕ¼À”ææ!±ÀÜ/0ex)Ì ÌÞ¼ÀTÄ ŽùûO3_5/°¤yuH,°öÀ ,^` ó«7/°ñ‚㉉§ybB5/°¥y}H,°÷À l^` ó»7/°ñ‚㕧yFE5/p¤ysH,pöÀ ^àó§7/pñ‚ã© §y*H5/p¥y{H,p÷À \^à ó·7/pñ‚ã9¬§yK5/ð¤ywH,ðöÀ <^à ó¯7/ðñ‚ãÉ·§yòM5/˜Hó‚É!±`²^0‘áa^0éÍ &ŠxÁñ¬á“=k¨š€|î!4ùö‘}Ré‡ žýAUâñ„çÓ>á©<±C*âas÷’Œ(—(‘Ž¨ QYBâñ\í“>W«œ5Èg&ÂASa¹‰ •œâÙ‰Ð?=Tå'O3?íÓÌÊYƒ|¢"4Sö‘ªR¹Š ž¬ý³AUºâñ ùÓ>C®œ5Èç-ÂAa™‹ •º⹋Ð?yTe/Oî?í“ûÊYƒ|#4ö‘ÈR™Œ žÊýsAU2ãñï%Èü½„à~™¾´¯ö’;ínqï/do8¬¿´Oô5z;_Ç·Ä#ó÷×îxX^Ù{í{É^¦Oõå{™üköÂÚhQþ®G XÖÖ7RÃÖe˜%ÃDÜÉ ®q®7½k‘¼_Æš~ؤØ{#IKöâÈÆ·A¦ïŒ¼ùxõé#ùüAÃ?´ÿPKË=#nð¶á› x64masm.asmí]ësÛ6ÿ\ýúh[n‹ÅƒK÷ææ®M.ÉÌu¦£ñ0’;‘eU²Z_ÿú#^$ž™Z.;ãÎÔKìbñÃXbÁ›Íb}X®¦Ÿ÷Õí2£ßÜl“ËŸÞ_¾ýñÕå÷ÓýÕþn¿º­6‡Ï?Öï«ëÕþâûo'ß|÷úÕådòâßÿüÇÓbò®Zï+Œ®^oW»ê~õ¯Õÿö÷»Uu;}óöõwÓïß¾øárr{÷Ûtè|úón¿Î¦ì¬˜Oªõúnqµ¿¯ŸOAV,ÿ-N'ûê·ÕÕÃí-àbZÿ“OFèÚ¥çœ>½àtìÓKN'>k‡0 /`Ì ²@áy €ò‚"PÀxAY|³Ú,·»»õÝÇÉâv;ÝÕÍ “Oëéºú°Z3nÈ寿EPm+nº¹QM 8%¸)ÁN iJˆ(Ù,yI­²”†Î2:ã²ê?õ}³êÑA<•½‡Y6·ÑPEÀ+âªÕê¡Š WE˜WÄ[Rÿ©„*½*"¼"ÞðúOý#TIWIA?A²iЯilôkNöî×k8Ù4ܯi8Ù4ܯi$Ùk¤_¯‘¤H?‘¤H?‘¤HØFÂÙÀ…pÛ«êá|ºüýn·œnïwÚKgt®¼:,åL—›%Bf!¥Õ–ndÖ"¼Ìçåò&Õr)õ‚úçBé€:åÁyðòðyøä‘òÈÊkz>,¢éxU«ó¬Ö&æâ Ú²KѲÐ à–‡ExZáÈÚJbrÚÅm‹ìmkk/•U¸:-AŽÚ¬%Ò‹£–Â(*·Ÿ÷¼6ƒÂÔ8n)¥ æ]DÖTË߯×Z¡¼½¢ÖUa]q5øåN]ÖŽm˜K(]/)w;#vçêrzîR«¼EG,7 ‘dw€)·ÄÀbU(â8U®þÜîCñ¹Ý5†Ês»‹ ]级±Ï„ÄS(÷ð5b!– K …¥Â²…”D”AÈ]€GašâÁ°HÀ°LÀP ‡@$sˆ™ƒ"ŠÄ2ŠD¡uŠBÝÿ|×Û`ŒÌcéc‘É!Ö›X4/ û’k"®-§hR˜G)=Šò‹@ˆtž>$Gg“4‰IvTç(šƤP>J%3Aé ‰¸HÊ=·>”رÜ6– K…ƒ¥Âum&%÷(ʹY$Ö¬~ÄN?f®oA^GÒÇwO(…(pÄqNÓŸÐîÊɧۭŒž`¹®y÷î_‰ ÕÕëÃýöpaÏTåRê°Ù.>¯—¿š`w=Lf³eÊÖTÓ¬íW³:}óµ¢b›*‰H3“žœLYÑ–ÓŒYKN¦¨÷«ýýt·ä6Z>L>ý1 çê1Xë>ü´‰³æ¶OZ>ÌdlJS±¢R‹Šµ°¨™¢J!–(R…ú²íÓ ¾QõTOš(™§¡Š›ø¨Û’_á¶-§Úe4W0Ú팶ñBuÊ"Ý)Æ@Y¨æºCk¡š§œƒIÎ!Z}…Ù®î(£(šîkvˆhvˆhvhÕêBZz¡-½[ÝKæì¢sáŠÒ W”^¸¢ W”\¸¢äÂ¥®(½pEÏ ×! W”X¸¢ÄÂ¥®èyáú¼pM.\QbáŠR W”\¸¢ç…ëóÂuÀÂ¥®(µpEÉ…+z^¸>/\ÿ¶ W¹P OAóä ”&' ,=ÿÌž§ŸÏégĉҔ-R>Ôô²ø¸^–ć{Y÷²øyúMC#ÓHššE‰‰¬Æò¸ÓPèpôqO_DÁX>OCÿÒihždÊ=&½cvTç˜GÑwqϘ=O?Ÿ§Ÿîôsø 7á6¤œ§š¨Ý4fÅÔÑv Î,žÓ)Ì*ƒBò¹9{èÛwÚÅóÉ¢Z¯#qì®évÌ4nƒ„ â  ШºM ŸhƒmPtÛ ˆÚ€uÛ€Em€»M€ã` °/²ànŽÚ ì¶AµAÖmƒ,jÒm’´@øµai¼·ÂÍ‹+ë%‹ sÿ"·´›Û?®d% ïb 4;ßé“í|7_ ÑèÂîöÐó14Wr„îO{yÍn]3O&reBBféÊ,·—Ô¹öez3Iœž­))Ä‘J"R½ÅII-<©î“Û} 3c³4X›îAï' ¶vÁ#½Ÿ,ÄÚMNôÞmHõO€§¯IÑP“>xÈ£‚§ï0ÁC‡ÉcÇíö/ ÁЄ YÓu˶srÇ6®#l \?È=wdó·Ü%Ùú]kWûöÕ¯Ú] ™°°Þ}B̆ËUA¦ÌÚ|$€`·9¾6Æ¢%o®ÛÌÆ°n{Í4¿½s@s8˜®ÐA…*Î$n 4òÀ¾G¤¿Á‡Ûmëd DÔäØD5Rl"Övǽ7½ì¿èej#ÞòUoÁÁMCÄÞDû€^F÷½´ö‘Ž}@$Àý=!>ì6-ÂGûŠˆÓÌhûozÙoD¶ûaT‹NŒÍ9]Ýô²ç. ˆìöñ;øŠE•2æ§6œ˜¼‡^gß"5<¿©¨áW/"un‡Ðš"bïIDNêÜ ›4eÌ)3^ÒðÌÔ¹ŸkÊr§ÌX¹óüÔ¹“iÊJ^&Œ¶ßžO½¬]±*š|ùã«7FÞ°Î.îÌÞ­®¶‡ýõÕnõ±z3i/–7V qQ?1Ï0ßþEgÅY¡žp³H&ñ/áLb‚ì\±XÞÔ¾±°Vü÷þûúí«é›÷o…yj„<ó©Ö*PˆUáC¨0“…ÕÃd½ª$¦gÅõÿsIÜßhâó·õïéÙ”gòQ£òùjÄKy…TPdò¹Ý²æ«­=Ÿð‡”$×2T˜‘¨*©ç‘›¥®°>ªE>bCæÒ•X•vøǃT´Zeµ•jÛW >‚¦#ÒtÄ3]Û6ï,ïÁÞ="o’CS7¬VLÖQk¶¿Þis:JBíÓg;‰Z»m7·‡µ6£cåײ[8)Wï e¼˜)@ÞI`ó;¾E Eˇ¡Â(Z<Š@¢† $Š †¢å££há£hCQ ay#N¢H´û‹á‹’ÂÆà‹°D‚",Q„Çé‹â`H ˆÈIEÂbÄïXr _”6_D$ŠÈ‰"2N_CETÞH“(¢‚ÍïXz _”6_D%ŠèQ‰":N_CELÞÈ’(b‚ÍïXv _”6_Ä$ŠØ1‰"6N_CE™¼1K¢(l~ÇfÇðEIacðE™DQ6E™DQ6N_CE¹¼1O¢(l~ÇæÇðEIacðE¹DQ>E¹DQ>N_CE…¼±H¢¨l~ÇÇðEIacðE…DQ1E…DQ1N_CE¥¼±L¢¨l~Ç–ÇðEIacðE¥DQ9E¥DQ9N_C*ê¨â•Ž^ƒb Àî#o > TE±A…±a¤qì.`¤0¥£—=bÙ2¾ 0'œÝCÞ("Ú:¤=,¦­ƒÚcjw#…)Ë„td¤ áf8Jp»¼Qø)à†AnP!niŒ» )L©È&¤ãÜ ->ÃQBÝ}äÂO©p7 Šwƒ xÃH#Þ]ÀHaJÅ9!õ*}|”Àwy£ðS*ø ƒ¢ß Âß0Òøw0R˜RQOHÇÀIÆ@% ÞGÞ(ü” …àX8¨`8Œ4ÞŒ¦T ÒqÈ$c ï#o~JÆaPdThFïF S*" éø8ä’1ÐÇG ‘÷‘7 ?¥Âä0(N*P#”w#…)…t´ Éèã£ÌûÈ…ŸRAs56‡‘ÆÍ»€‘”Š–B:v¥d ôñQÂç}äÂO©: Š¡ƒ ¢ÃH£è]ÀP&”y@7ç<¹NnOçå“O›•Nl¶´’t7ž‡ÒÒå÷¾ô\ÜØ~1ÈÌ#XÞÌP (u»™‹]—`¯„¨â•€*¯¤MpÝ,C'u¸Çn`ç4¬ïïʨuoñ’"ݸú¹"/S,–øꢭ)|‚)US™›`'¨î8’šÏÛžȾo’Í£Ïc9Œ`³—؈ìÚ¬³ÐÝ“ËóÌÍã̉Mô(‰}`»u:säè$j™Z'~*71²Í]¹dÄ`öóðf§ïª`rdåffçffÕÏ••YE’#=•;4ôJ¯G¹‡6¯Â ’!¾ðùç>qÜž“^$ÝfêIîò’]c$Iò—¡3Ñkz0I’¿17ém."ItJÙÑ3Q2¤Ü!¢Ü!¢ÜÁW®C1•*É­(,Þ<˜hý`çuhŸ¡ Ñ'OVkï)P3¶²dj[$¯.œ ¥2ò¼o@ЋÈè–Yà ¸f†»tî=6âìàøã;6Ù!ÉNLvý i…LbÆÎÕ‡™œ>6Ðq‹A“`1ÖÅ,&ºØÀ5º¸ÁÈs—OKb_‚}IEºO©yp¿üÌl Á2x¤j“iŒWÔ•i§AZwõHŒ´ÓýôHþrÞ®EU­æûÍšÓd/©9} Gù—hŽ2AVo,q¶žÑl¿úŠ'´Êõé½ñ¼]™àû¦ÚT·Õ•ð#oëu<×ÉàåbƒÙº¡T]°u÷×k™9Ëì±ÜÌÝå'<òy›ò]—ù½‹oZbàzé¤Ñ6cÔæ ;äñ òxÚ£ˆ¼Ïo6Ÿ" f¨ë1½ß[“£æ¼ f·áœR£ŠÔbÍ:·´•æÍ™ºRõá›H¥bý#ôÚÜÝk ëu¢¨ºvbíêž»4ÑhÎÈéÕ>/׳Aó;ÅÄV!od'ü?v§Ó^¿âa9¾ör)38ýŸ*©éåóÃìDUp§Æ §g@f5ˆÍZõÈöZÿn´Å?&¡-ó´eµe½µµ¦Ä¹ñÉ¡ýJO¿r ~åZˆßùdhï“Þ § Œl(ƒSœlöZƒ6?¡ñ3OÛl ¶ÙQ¡ È ô”h¦¾Ât¨ÂôÑÐœÙhFžßN4Ç›C‡&yBã瞶ù@móã¢9ðœü {Ê'ø:ú¬öhhf6š3Ïu'šãÍ¡C“>¡ñ OÛb ¶ÅqÑì?ê`賞òaþÓ†>î ÷ó.p£õ$VÌõÚü(%öÖ.àÜ Ö§&¯Íx-R1•Bœ–¤WaÈ[ „¿‡‰ƒß©ÔÇÓ•vðÎ ó/|6'+¤]:ÁÓrÖÄHŹñmìﮚå~97(¸­$¼×JBô›‘Æ6f;̈¹±Æ+æ^Û,µ‘ÊdÖš}¬ž´Z7ð˜r õl¬5s”M1V‘AöëÞU<ì÷¿õ/×î¹Á(†CÏqÁs —ðŸá¹†ƒúÓÉÉ?¨„ë9/NC¡.‡1ãÓ µàŸk~§®×áÄõ:Ϋã<–Âß·£oŒ§CÅæ˜÷xz‰U¤…rGĆ˜_óÕÊ ŠO}pS¤'Yû½ð×!’_Ás6å–N 2f:ß°-ŒÍò•v­Ná“×i -4À'FL‚Í]Ú~O¿?­È*A™¹ã8’½%Ì9ã_) z<9ŠGTauo ÙŒˆžöFx&¤³ãŽáŽùî{#ª;œÆÒY>¨r¤ÂiuXˆ ¢ ývaÑ*[Ǿ£k»eJöm~í†ÑàªïÃ>¡Á³j€Mc-6m.²B3Û· èÂXdx%Ò"‹Ô×"JI,é/ŠÈx¹%6JêC3°_‹zöõlæäg,Cp?ȸ‡÷p÷ùèÖ8µ*eâÓ®÷§ NÌå¤Dú<ö¡_$K1âWE¦™¤Q&”8à¨rtI½ÇžG¿-<ƒ¥麲5¦‚¦®!_Â!õ ~¥RZƒ¼œ5«,#÷o7×gŸ+:z´Gfs$>Na:‘Ô?“µ>z¦‰DsÚ:‡p÷˜@h“±âB«½²·ÓVl³"£ÄâƒlZMçð§M3Íü÷Ÿ¤àŽ.ÈCêšEÞ`ÂB Ûú SÃ(W3^ ½pOŽ:ƒMJè-ê9§ð¡[ra3Æ £V-Ø•Óf°Hl ]bun·bv¬Í؇õÁ;À-‹´ûhmMÑžÓXÆ°uV=˜=j«y;íBÛT-áÚÍn“ÔØ<¶ª¡µ6¡•kÿ_2šóÜæ1$[¤ål(ýò£;Ítß,Ýv‡P]¢63ðf¶TÑÑ›åðЃ—×uÝr=sTÏ#” sBjÇxŸ|“méÆ[>ré4Ô3»ÇÜdÓg|÷û=y½ìƒÄ/ƒÇe7ÒŒ7A (ËkE_* Ê2úK(›ƒ]¬ø” ÔuZ¿“âsÈu¤H°S˜(1·ÇZÈ ~Ù’V¶Ñb»{Ö¬Ù¬†ÓtE=óLï¹a+E,Ç[±ba|×¾·P÷’¤˜ÓÖ ¡š“=e‡tÞ[ZÆwÁ½W&0?—,oe+¿ð]¿på×¾oå‘|‹¥Yl`–ã”î-)|¯$So"ÿgMíwýÚµÚ·kz-ÄÅ£QѦVV ¸lñÏaZ½tÕÕ|Sèå9]©q. -d´à çZE‰‘*×^Ð:û†‰‹µÎáÝ'ƒY.±á?C‡ ¯ÁŠaü‹)üÚ‡ß0 Y€Q¦\ôá,qäjÇM;"Ôv#ÃáÊsP@ز¿<Ô´ëÉÕôv>9›>œN/g×úYûÌ›Ï bpÀ­vñ SÞ#\^èþ½ih¶‹Âÿ››Ó„©½i ¼‘ÖQȺoïeŠíq˜0£ ?áºö°U’iÀì¡n Î4uAh6cÅ Ã1¦¶ç`'eõ ¢!y¢ØÂQ‡äZ§#-V%s`&^ʼŸV."hµGxr¥ ¾¿ï7îÞöS½ c!d6 UÁpYÆò<<ˆyÁÉIš%KÐ –¡ÑIèofQ@yàä8£Ïu»<ôü¿9~¯X=hµ e« Áçé _¯—ÔQ‘ÉDIFȃ b¼™PÀß8ðt.§u²Þ‘ÝdŽµ÷qÒ½i¿öx<Œ¬ Ô ÄÃB! 5>B¾‹x¿$ý|ñUi쇛ëSÞ†éÐM,1[6[úôEAñUm|ûXÌøœ¢_ì:\f­Úú¾hs>‹¾î§ ! û?}†ƒ0EÏvØ2ð^¸Æ¹Ä™O‘ìýÃÌ¢TÜ(„U$¦~Žùa˜‚Ÿ³\–tᳫD_¯–SÀê«|YO5ýg]ã€Íh5,”ÚJBbp’› ñëòO¡Œ YùÔ­:á|4X|›ãJkeÎ;o 6«ÎûrÅÔ©¦ÑðMÄ~б°Ðà9%g®åNŸ#ä6ºë5M„UJ½ZÊÄðÚKø“_昒c–{%5Ý…™Ã„Åz“ Äh”Me“•‰ãè%’Ikaä2±«ÒF6”@ÆŠŒY‘QBÊ &¢-1¦-ZE¸O¦…ZÑ({c9÷øVù(”T©I!°7ÛÈ’›ï‡ë–ÚU 3ókñ¸çl9÷^pÀßÿ”Zß²G£3ÚÈÁÕFI][©÷Æ&á7…ÜÝç©h‚£Ø”ryÛY â;/wØâ õ•ËOÞÛƒ {>‰îýz·>¶ roäM‹xt¸=~“ᯕ¢ÏŠ>«q¦Ãƒ¶í´c‡lågC°¿)¥˜³{ó©? Š–FF­öÏt<ë}ît’•ÚœE’ô™© r€„òô8j›>¬€IRwÚE‡¬f Œ®! õêRÜùQ{=Š3Æ3â«A¼šƒxÂ’Ùs$f‘ç2}x’sOFX¨0Å{¡Ø=挄‡Z»ÌÙsQM…étt.Œ,ñ¿©Hë>^,@€3‹\¬,éqFês©Ãݛ㠄10z`s$‚âîMíc5Ñ Ù ˆ'`XºM»uoã¸4Ÿ!Š,LæÐ$ó5÷’¥ß3Ç&Ó.g$Néèå:·C9_AG¨uTãíc¼RÇœs¯ãÅò=Ç’ðþúða ~Aš¦ ¬("·DŠ0lú¦—z]Õ¹Ë ºÓ2 FŠ7ûÑÐщ;…'œÂ‚S±'äR ƒÂfÃÁýŸÏ܉}KtqH,W =ûŽbH£ùÀÙ„ì3ú©"ð%MO¹ ÀŹV‘þ$é!WÂ-rw«uîíʹ½MòS½¡ú•M ù0ªòlNÂغ¢Æ¾ýÑ2~Gé†ÿ§G.ç'/ئXÕ1¤£Õ^Z‚|T£9¤‘t:¹ `æ±'õµ²žâ{ƒèÿhÿB§1»Úù ~‚Ê¥‡³-a.p¤ÞÍn¤ºÆšûX((úaüm4ŽF³'s:{ü:x˜ö‡ƒ™9˜Ž¿Q]©qô–Ù$ž»‚ÇÁPày¯ñ¾™•Ãñ K²||•ž×õh#Ëø}" ô4ÎmK'Yò™¼OãäW4Nþ·Æt°È׸|ÝÙq7ßIÀ"Ø !»•·I«ìÇSÒ“ºh¯Zªi¶Ítç4 ’Çÿ ˜+—Ô0Î$«ÿ`ÞÊ5ùf‡ï5d•ÞL­4^wرպMúíw{ÕY`dÎËšKmÛu±½i’³¥ž“>-¯ˆsü=£< f^§÷Ú°´Y8†¢´ =ä¨JZÏÛ¼Éì=sów´izL•×–28¼štÈMÕe´©ºŠ6å‹hS¾†6ù%„ÌÙL[X~Y¨£ï»)ÎáË3î¯yaE¿XXß« Gû²úž•U©6ºùK‘:M,ùy-þŠ›ƒ^í?PK=äu:‰Ë xtrcrypt.hUÛnâ0}Ž¿b–JÛJ}õKJ«ni¨Ú•VB!™$ÞMì`;lQÕ_ǹ)­ú–xæœ9sfâ\ЀùÀdñËY=9Îúçjaž×wäB(ó1rÕëÁï€ÆH¬Ö*BÐ1H³ML=ø‹{{©0iÁf#ñ<\ÂdR \æƒ-tââžQD˜Å¤wEÈe^œù­%.£!óÑ£½tF{=¶g÷óÎDìSŧ«ë_}Ëk~ŸÞÁ?ª"StçÆÔwåŒ/v¥Ì3Ö:cPI[Ò$ñ÷£P &ÈÔ”'.eý*¡¬à 7A…B’Wb©}Š¹G%Ù*¢r’³‰E Ø€XE°ãqÝ#Ü3…! h§}hœl«“Ù­smÇF´Ãî°¦Xhx2Ï’ Š2®â(X؇ŒI2ôjTº¡J6ζùÙÙ8 评ËdÀEbì¶oÚ6}æéÄÚqêÃÔ^ØÌã>~ Wt’£7œÇð\Ø_ï ÆÆ5MÁ2Cõ¬µh² K;½ÈÐcz$•yRùƒA>—5e‡ö.Ï^é÷>˜Fz©Á¨ÍéHæµoOJ⹦4‰ŽK…„¶ä™ð0·¯¹І‘ç¡”Í@§ ¯U&ô”ÞŒá±Nz4›V´£?€PERU»î%ëôr¼W8áSî;GÐ6VïíÉzû9YÓñç$”¦•ă†Oç»ÑÚþ:¹1‚š­ô)Y!²IY©8dï9îÁýéŽÏ¹ŠPÔêt©œ±¼Xðé$x£ÄÑŠ«ñ¥ëE~ä~gò̸Ò|DïËl ž¥OÂGqnÊØÉýq­=<c]Ô5ï,½ÑZ Ü€YeŸJkÞj³Õ˜í9ÌAÓÙ»/džk䕃46Ø~I9ÓùcªNw8w¾Ò¡e÷KÄ:.‘7NÞ†Çÿ{>Õ?d> ÈPKÌ=ÒŒîg™³^ zdeflate.cppÔ<ýsÚJ’?Ã_1É«Ê6à`¼åØNâ[üQ±“¼]G .Bb‘ˆã—çûÛ¯»çC3#yo½[w)"£žžžîžžžžž¶¶Øocÿ.ôRs4›±:{˜iêGÌ‹Ælz#Ì‚ˆ¥ŸÍÃ0±q<õ2|d_ý€xA¹¼µÅνè‘Åw„è…÷1P™L¢’zÃÐOØ"R7õÙÝ<ž¶hžÓYèOý(õÒ Ž&4ñŸ¾ÕÃx1c¼ ö0 Föà%ÀÖ(\Œ9ÇóÇY×jl{³AúÞ< üù&;c£)§~øˆDçþÃ<ÆæR¬ÏÇþœ¥1» ~0 ÷À“—R­E8fQœBÑý¸Žé&»™ }$_A0xýïþÜÚ)›Ä3ÿnœ²i •ÐORà•@œ¡öRø€Írù!{=M6'¯5€êzp·ˆF¨!/<ÄÚwlp~}<ørú‰v™»Ûh kwñúæyâ¾ùã7Ÿ{ƒ õç^Ï5‚tXþÅÆÁ]¹|qt~z}ut|:xwúáì¢Âµ{uU-—Iݳz0™q°$wÊå^üð>9ßé×9Ò{û6ª¼[ÜÝA÷oæ^”ƒSêh¶á¥©7š`ÏWË¥·ì}"¶uØtÝ¥ÐtåÎ Ÿ@C¢Wið— Mdô˜ú:¬ü³üT.ƒ1+à÷:õæé±l‘K^’øó´ò*k½Ú)—²7Öeé|á Ú§Êkt°E”÷XgfAƒïƒ(H&…-®hÄàÜOóˆe wV wµÀ·¤b2õÝ ¾Ãì :ºO'Ä ˜–ÎI¹¤‹Yë TàÅ–Ê¥ŸôÍ~ïrêìàÀ꜎¤£ ­LÊA—%Áo~|gŠPÝh£†Jà`tÙ•`<´‘mä Ú„<=Pé­eµZ”[AXU „… \Öí2“Ú&òV©b[¼±ÒY¯më•jýºâ<†Qàø¯˜trVK‘¾LÐÆþÄ:?Dy;¤ë¡.à€þ´ÊJÞ‡‹dï¼be-#hoä´ÎUÃ(ŠTˆH²g^TWKTõ”ñaóºÓ4T[\ó²?,êYÛ+Õ~Âde©Ý"],UQsÐÎGL½è4Ây è›ï•Q%©9è7°„å ¢c€'ÄÐY¤¢gÈ¢œZMÀŽR&»À)ªáÀ¤,yœãX^Dèò ðÌ›ƒïdŽýY:q 6ðÿÑy²E÷=€z0ÙÞL¼ˆì2 ƒÈgÃ8L¹4UªÓ—M€G.®Æ{3Ÿ$UöSxP@b @›¼Õ¥¤ ­l€Ãµf¨«-˜ª#ßÇ gìóë/Çlóâô†5?̉!¼-¤Ö:4Œš%{´åƒa;>ölœrRYËV¦ÞcU²ÌÆÈm@¹è;„ÛçéCL Ì• ¯YuibÉš¬º²¶ª^û£wa<úöâÐÐþ¦.‡57šíÝC˜½}¿¢Œ¸„]P º 8¾ÕjUîÆù6èor[†Ñ†Í((i·Ë2!ØÁ_JbÑ6‡þ}Å¡v7!ÖÂïºaWP )"½Ã@v1ƒÞ ðx©FŽÄó:z‡ûsrWõAé'c2óG0Ì!DO|2É(&™õpmðËo5NÁá]&.:µ=÷ivX Î8uæêýþ0I{¾wG–@r8ø,ŸÄèE©~S]v@íò9YïA<²J_pÚ×”dÙï¿ ¸jñ€ìÍâèÖ(é˱•!1†Nø‹É:¬RÞf2Öjf”â …"`ÜqJü¿*Gí ³/Ôú¯îö7iVsž´_QŒ1^§pazÍ&ôýafõ:Åg’CIT5ˆ@ÎŽ,¬1—¦,Í‹%‹©`$ç`t<‡¹;5÷ CrÍSÕ\r58–Di6˜%@ŽgÍ)©qP위iK¡®oNÎaÝføäÕ‚ÒØíß´Ï{%†Ž$‡«„AKhUÑq†šbXß…ñ°‚õ™1‡T+9÷ ¶…ˆuVPôõ]–1¾$M݉¢ c@jõ뮶@"Z …%|­×u BTsû¨Œ¦¶P‘ÅZ“}9•Š ‰*jLŸnôî¥N-I÷zkÎ;}a~ÏH½¶á¬«˜ì y{º{*ÛZÒèg V;1bÍ?¬Ë¢`^>Ï>-ŸáäôiÔš³^ çPh}1õYŠ©¢xøß>D¯qôÐM>%ÁÊÿ>çaȬ qT÷©žúäÊÔ÷à\ðÏ2çÇQ$ç‘ÿ#EâyÖeÉ­+ Yp„Îú «[°f¤¢eêpV’Ó&‡*º âŠtИaV¯¹81rºÝ"§SgEc—¢”é€R71‚Íðæù(ÒN¶à°ÕéáÐâ`­:bõŠ¯äØÌUZ‚:Ÿ0™SR%PúfKðÄí ‘Iá}V­C!wâ0ÅŠ£pXò/•Ü –½y ¿Où€¥Ð_±2ÒZ:Çô +F('³)“U…è#Šß—QâNå„Ò¦1°,¿­‘{t¨GDƵ 9$Œï›_ƒh?\ƒÚ¾û) ëϦ–Á’`ú”¼Ìg=ì&r®7Q©»ÖêúÓß#¡ó„Bö³$Æ cÍ-ž{ßü+oîMÀz}¢Ñ|íRT+¯{†PnÊTÅúyyˆN˜KuÌ}õ0õ;äÊE°73ŦÃÖÌÿ›”˜q¦ÍE™\ËÉacÆ8e‹åÛf»Ý—>ZƒƒÛj8̸ÛÛkW‹±©Ð5wv¶¿Ÿ -PšÜ[†ßnäñÛ‚Ÿé !™{´7 Ñ7­$¨é`Åêš2·šÛÑ›8 p{dä?×F«YÜKù~}Îy^37´Áuf8›|\çœä Ao¦céäôýÑçÞÍ wù¡9øzvqrùup}ö÷S-¼ª@$ž+Åd†Õ<,É,àœýš§Œî?Ì!¼>‹À÷ã£ùý‚b—×J1ì5($¸‰¯Ó9î/XcJ_ã–ö@¥”›y-&ºœ†LˆxBÒˆõ]ËÏ®ÿ å¯NSõÇgê|u>juxT¤Û/ü‡JsãDªy:˜øÞ˜ 3x¬ïÓðÀáŒ&*ÚBË*}òó40qu(BKu§ZYÃ4,', þöŽnN½Ó/§=Jð,Br&XÔH¡§|Ó^QV s´ ›ü‹åMùr+?и~ˆuðÜ#ŸÞÕ*•ìŒ¶ÚX²»#Ö²'ýùW± íw‰¾;úî¡ÇU•¾#:<²äxB†Oûz Æñ7ÛPiõ4 ¸ó£›ã¶½è”‡ûš„ ć_¤p¹/È͘î¿3‰Kn­0ÃW rfcæ-ÒçÉQøˆÖg*iáq…ù«…€x×Ö 1äþœg(õf‘à5ÇÂMç«Z%Zݼ٣ʹ”=q¯i t‡†¡‚Ã4Þ…»´ÆÛŸñ•KžRYi¨“‚‘iƒÚ$4eË’£å˜­ Ä~6e?i>,ʈ!P¸tƒæë6ú·Û¸ÐÁEÅÖ£÷q6Hc¥ŽÔLfb—Dssê$'ßl0 8±iøZÀë(¨tÏÚÀʨáî‘t‚‚%ÞÇ¥áÜ÷¾©cšø_w?NHÀFi2q`HÎ^YÛ8þÁçi,Ê$¾_£§®³$9W%8¾óqö °¥»CËAðŠ*±vKïŠñÌ£"¥¾ÊÉñWœ½(#p5G°²œ¾²2AÂýÑvÀ,RPîô#aTD\igŽÄÑì'µ°—çÒ§Z¾¯«;?NÚÎåò=öl¤G¹iöJ?0UÎ2gMb8©'©ÌûüÂÁ䜑…"ªe1%Z¬a@vý¦¹RM¹”‹¶Vq€s'¹§|ótè"Á~ÍVÚáëüÔj®}ùx³ dP’ÉG1ÒµöɈë NÅáëƒDWöàDZ‘g»Šæfèý=ä3º îÖ­u•ÃlÑÕi𜽚xüÈ‹i¸õUhË“ËdéÏî‘n®KskÄ®iIì.½?c¸›[K3ý"Áùé$CH~RE¹[ÁõÏr1ÏòÈv®À´SêR»¬.ÓeÎ ×”»/™ç…ÎÉŒ®£8P75ÃsUiú2B£Üˆ6\¨™,rÿ’s¨ó?Ö»+Œ&ˆD‘6q,Òæ3ù$¾?…éÅ»÷)† WC  Ë r²É 2YüN@Î"˜/£ð1K¿Öªjëw´'á”ô@e¶ò‡?"ÿá(«­%ÉpÑ+)È~]_Ž—¬IA[[lä…!EÙ&?>ñR¯ReÞžÕ(žA3š¹Š&7ÓÔ¬’ÜVfœ¼ÉtÔÍÒ¢Tߨ¹ØÚi,‘W%ãäÎWɾ½ÒQñBœ¤\Ü0.^Àw³¤q_Ò½’JÃaŸ{=:HmX4,µÀ£/2§ü^4q·Ê&Þœ¿¾¤í*)¯£•{[¹d&q£Ø­’ŠéR†åÀêþòÓ鉦1Fóq>úi|µëDö¶Z—™[³Ùuª‚œ«zk«Õú›j3‹ÎC yKßàºòí†3DH^m¾6F¯ÜõzîúÜ?%êò!Þ.»•»@Í=µï°Ý>\|à†Än ÛøØQ]õØS6 Å]¢c>ö·àÑ´Hq¹X籽΃(¢ ëvwMšëÝÜôN§'gGƒËO'§ŸÖ&õ?/A+ð"S™cjŒg#¬Î0úàäoGçgÇÜè-L}›2Û|œ=ýô×ëÁÀÞ¾·ÐjpÇ°µÅ¾ïòMúr¼Çâù7oŽ“ß[6\aZ‡q8çŠÔ†n±ô!f©?ÑQHýšÇI}[L}½¾9\\Ž{G×׃«£O7gG½ÁõÕ)*ÌnxiSЉãx:À¤U’(´AêÝ/g#)”mIZEþkKPõ}ðÃãay±ÎºH¿V EEâVDgº­Æ¡s¨º"“lDÍݾ8ª\*­óÛy¦ð`îH1‰ ÚãÇÈ›®º\RDTÕ77.àÀeƒEŒÁ]…]@R®:l)‚8ß\ƒè¯V½&T‰âtàÿc–šÆ†–ù‘çêæµ Æ‚Ïå{hk©¸ ó¤ŽÍðûÚÒñŠÛ5…d%SɈúœ– ÈYj.Â*qÿ¤–WÓJ~æ¶-XV É(žÑ•H½£ma_ÕH~~Uø´Vd³ŠDuÃþõ*Ôà*‚5YÕa…U‘L-£¼Žkp÷µëYÇÚ´˜PÝÝX—¼²JÙ€ÂRýNAqP=£³È†2š|M±çshv9µKmŠÍ™ñ£±ç.ó9L[ZX`ÅeÛÜrH,}hm3[E¦šÑ±uEW°ÅÏ/ðˆ{7QØeÛs–t±»_-ðòröƒQ…„eýå)!ýº"Ϩà ~5.é÷ÅïD™à7±ù÷„ôB‡ów·MÛ1mdßa†wð~®ëЀ¦C 0‚Þñ©ÀøY0w_7=dÛ"Šz+ä LX‰h¿Pâ0¾ïÌ)Õ»l›>[ãH—5 ß<I€XbüÒ¢Æ<Í/^m;;¾¬(¬” è÷ÊÊ`•ÃíÿÃp‘3š ´?·ÀM] ªÅÎ34ŸäþùsùÁSY[í¸”dœù«}šÙ«´È\ùg[ûìhŸYïó¹Âg8ÒÛ×äìâ«ìÑØjÓgŸ>8Âè¿KÿÉmò¡æÒX£,aÉø2é?Þ„FXG¿ªh®#n` #Žðæ/óëEbgi“c3ÊY£M+.úßb®`¥ˆžíWèqm…¶(R•‚âŶ .xó¢B¡`úÿf&™äÍ$ëÉÞÚM“L2“l^ÞlÔ<ÊÂZ Z$4EdÉ‚Ò ¦TwêÒ’ÝR£qs( äFh€Æþµ#Ǭ€³PÆŸç‹+-CýbW›‘õ1Ò*œ©ÚZ´`Qÿ1óiŒÇò¿õ^Eʤ8 íÕœPêžé­Ãïgìo˜èaš7ÑÀõ°¢F>ÍA±`›¿ˆ0#;é–>±ôEÁ7¡Éñ؈UƒxQ”ªDÕhÀ†«–sH! X†9tRZ"Ò†tÊÉEM¾W}cIâÌ'Â*úÃóçú{ÿµ;ìß·F_L4âEß]ØD´¾m“õ×Õ‡“WWé*/_ÜU›ÍWKš¸¸,j[\Îÿ’D…‘°©t­!‹íIþ?©…·›‡×õêŦ[Å¢Ò$’\QoiGÜYæfy Ö]Ÿä “ã4}ô'…•L‚³æšSá*ŵúz+r•ù9þÎêΞ$³ABaÂè¶e*`cfþ00Yy ³ãDìÌ!W¬+ÚÿMDžÓ‘ßoîF?PK=•þ¦5Ê­ zdeflate.hWmOÛHþÿŠm+UE¥€¨Ú樇 š‘´\«“¢½&+ìÝÈ»†rˆÿ~3»¶ã7îªûdí¼íìÌ3/~Ã#²ˆ¸×?æË«ù|õsìMüÑÒ[M7Àà‚uòœ7\q2ò:â±f©z·y]!&\Hqf£Ko1¹ÞêÌ;¿˜õÝôq«å|¾ç8¯ÈÊ bªñåħJŸq}“r°G>“m¶Žy@&ƾóäØóg§×îŸeQÄR.S*T$Ó„j.Ù§ZÓ`“0¡÷†Nï^òÌ3ÔSýL(~+XHb)nÉ=36 %‘ Mb&nõ¦TœÄ™Ú€ª½«_ÒݘѴFÏ MSíÊLh.n|ýÎ \mªÎ6•šš…ðʵ”1IVAÎo©'«5·æ»XÆ™*_dTT¬ž5+ >á¿X¸à³ ÎbÜýrtòá ˆËLo³ü¥Cçyh“8…sBñD CH•MiN-ˆ•üéÇ-CÐÕ|C©>¥“kòƒl§W·Ûß#OÏ-b …Òu ûÈÁÌ7²,\ «2›‚kNcˆÀÿ2âô”ìÄ;g‚¥T3äúMÜý›½„þrKÎK~˜Ü_³«šær‹~»²Þ>˜ï ªýîÙ{ìÒ,Ðí9½'§×k%jØ$B­ Ñ+‘ƒúc~)]£W`&o%¤=qÉ᧓C¼?Ù¦L)™:9„Æ,Š©–•fÐzMWLd yº¼˜­ŠFå{ß=Ÿœ’÷¼pôÍ_¶Xärôg‹ü ­ô¯ÎV7³ñÕÍjqñÓC‰ÍîትÛÉBÛû¯È_Ê„ kþ›(ÞÏ×1Ü1E¸&U˜4- 4‡Ø€„š$ô_(Xg’Â#B …l¨"k©7¤&LEØÔßB—}Ž¨{„ëxŒ—"DÉ„½0ôÚšïÈþÓ+2õøtöÍ÷5¡Ñ‚Ò¸gñig‚¬\,on¸å¶¦Ó—ÂAÀžÙÏS€4Ã"Gìmåî4a^_õàU½hÐ:ˆ§¶áÊÓmÎÀÒwDüœPÉÛòˆñoÇÔ0:ª7\‘òeÄh±kF25RLcRŠ B ‚“.CLxÆ&o¥³Rs‰éê»úÍL`˜vÞË;yJ™ÎR•]Õ>—Zõ(vèÕó šEóUí…­&ürPÑÙ¼Âd?Êåqh‘}.:…ÑY¶H;Ñ-¦ ߊÞ2O„9lÖØ´@-Báü}CÚÐÔÛ:µÙ}ÏSÑØNÓ¨æ2šLÝ­šÜÜÖ÷_,SMkOR]ê°eï”JÛK—PÕöÊ¢©-–W×ÞضÆÅr´¼p±3ÆÀÆfGõx9ZºS Û¾VN>>—#g—·…™‚ù8V»eéšlm,ÿ3g0ÑX±½æ¾«_lqÒ B3MMB˜i6¥¹†j9èê>,N¢KªƒM}H¿]ôjþ\ÅRm1VWQ¸úíVN›ØÖ‚èã£ñxÖ7î­KsÝ|X7r0-‚ÿXUmÜͶ±f2jhä.aÕª(…u½Ê.`-†Æ­ÆNÛWàx‡9ýiØÁó~é”ó¤Æ,Þ’kv3 ÕÃãb¿°‹lXëÌÍ–20‹ó®KWûX{)¶cqÇ·ƒòÔZ¬Qtl§Ìør´ø: S{šÚÓùÕÕØVE>øG?øÞì|™ŸÝé÷C–ÛýÆt¬VÍÞž`„G÷P¯üîð•›a@ÓGÓ¹’•íæ_ÃÆAÞQ´jŒqáWÏ{.3eÒX%ØåtØÜ£y,ä©9yPÒÇE–vŒðfi—FÎh¨ íÂè7àËIŠ?ŒÝ2ù ÓðÐüƒTÓùÇRü¹|4Z%Jqgþ µã÷_L´ ˆæj¥tµ ¾y;{ᯫÂ̳fʯLš99@ïþš½Ù~¶™yäüPK‘=Å„öˆ@ zinflate.cpp½;kSÛÈ–Ÿí_ÑaëR26ÆŒ™âáL¨"„ ÎÝMQ”l·±YrIr’áþö{Î釺%ÈÔ&$–[ݧÏûÕÍÞûî3ßMx}²\²]¶Ž¼$ásƒ)[úî„O™°dÎÙr5ö½ ›† FÆìî±s×+—÷öØhîÅ ~\6 KŸ'œEÜç7ñ€…3‚s>|wy2²)Ç©c|éú÷!l=_ÔÜEÂây¸ò§,6æÌÍø$d`_7xd1Ÿ¬`ú#ûºò¹cÏ÷Ç Ùï¾7fÉÜÆ"7z¬³‹€-Ý(ñ&+ߘ— 渑¹ B™†@3g³ˆs6^Ý#žƒ÷»Ý€õdBĘÝé"_OˆHobí¶£ d°k8.tï.m ¡+˜…Á"–{m¶veLóz¸š 4ëlÂ清7ó&®¤”0Ç«ó:KÂ%F=M ˆTTxò¹›Y‰‹–aìa¤$ð­¿>·0½ýBv“ù Ø×hø³žƒ!°ƒ+!å~ó«…(”’â†f-í¢Ùë4+j%>…œ ¢sDe… ¥9SÑ’» ±¸E‹W1È1 YF‰\‡¸æ‘Ú˜WŒ½2H'Üh2çS±¸.V¢Ÿ­‚ %1 SŠU¢Ð!4 šbM+†½ U+‘Iì&®ïÃ[2«éC–ÑâF~á+bîTR º@ûá5&HÉšCÒ†<ÃÄ 6Ð@l£}Ñ‚äÃÂ(Sè†ÃÖÀ°•Ì£p͆Qäl+ß'"·ÀZÑ‚ŒÏ¤õWÚ‰“i¯cw\äNjšê©*Ͳ/7³a3Ë=d¶75‰›@*+-ÛÚðe"(g\¡¿X-Æà㥠ÄøÀÝÉ\n–ONýpòðd­ïÁÁ™Þ¦Æšjó˜ý3fcQÅPU"æÌ :rR}Ìï½À©ÔÔª:¦øµÓ-_æÁÚŽã }æ &ÂSµŠÔÉõ_“¿x··Õª¦N¨/šNœ` ‘„X™¥Ððè ÍF¿€f1EQðo ©Y¹êÝ—æ­& h!k…"Ó( cÐY‘{±Nq‚òÎüpÝS¨’ž±ªâão·y[ÁhÓ”Ù½?fEÓ01ËèXL;Ä«q<‰¼1˜)ÒS‹Öê¾ ßQQ®YùI¸Gª5ñ›f›‡l£,¼²µMSd‡1!RˆY/n l¨I)ËÐÀ‹moËøý ¶†¢HVŒ†ý y»ì+”c!Ùà‘È+„jÖØW×_ñcˆ,ÉÁ‹² §¡'ÂÏQøOœVß‹¹‚ôc)vÛœaý9hÈp3:ÿ5îáçZFiúzæ7~@–š¥WSŽOÓÒ€yf,°ùj«YPúFŠ_h`Æ]LÅ)4X'­ª ñé.Áð›Á™j41[jaŽ,„j*œ ]ût9 VO—Ò!oʱÆ"’†A=:—aø°ZÒ3Ûæø!08wƒ0Põ6æÈö ¶=`…üêc˜ ]âõ€CšµZBý7£›þ„‚Õ2ÈÕ¬F(à.åqK2£AFh}DµâyV1¢ŒBC ô}jÞ ¾(°Ñ=š‰˜©©®ÜâÌŽy3Ìùµ|ö¯BÙl`Xžc óˆÚî1:å®,ŽµúéP!K'’)ËÛÆr ‰ýªMí Jdt®Y½ŽUjîí°peßž 0¾M†.kƒ7y)­÷X¤WyaZ(©Î୶Є¤FäcÈD®f¤fù¥ý‹É:@2-m8c¼Åë›Ò”¦zì—õ¸mV½Ÿ±îÌF-Êq~c†A|q2Dg]úñq¾à¤j¶kÍ®Üâ½"ë1ö¬1­g¯ô ¥ÍNÀèVXöúJ]­ šëì°íˆ>k›•TL¨í±\„,ìªÞrW šABEîgúIYXÉɧFÏÊ¡,5Ó•”ót;ÉèÏä:† ìü?åò5ÆCjòˆ'Ga7ŠÜ ž¡<©|Ýq“4ËÊ“Æ%wá 2g…K÷žfM=v²JÂàèBpˆ …eZïl}"L·RÜEz%‘­ŸùÜÝ ±¬xõHF1ŠHù¸J O?}Ž‰f·DtíÓp ÉÿdEÀ‡jk—q_gOb}†š,½±tU×Q8#=×'D|zî&®£fCÄ[Üayç¯ây- …܆~]rý]VŸ%5°Ž\ð)Ó“} Åæ^Hû  Á½ ñ`'¦¡šL N ¬C‚tl÷Yš÷ýªÐ)"Mâ-ã‹ÉòÑæŒ|_c US¤$Wu𠑈€þë…R$•¼X6Ë…rA£Alíª§Ri£ü®aû¢^{¦u<õÀö‚‰0s)2jH•Vïeê)ÅCÈÁ$f Ôd»Æ¶I„Û†™Irµ€ã™½tý}êN©ƒu¸NȪê¨o0NªUú‚~v”$_ÈJàìîRZ`ø í h&Õàšœ†ÑÝ(ÀGÑú×_ájÆ&bYÞK·ªd“ g­Ì%5ã¨(gr⬈<ŠT¤T'¯WIËò%^pSäMDˆ[€ º÷Neü£Da6i)9¦#Zðrä"â?þ£³¥öí—K÷û#à…ùË4Àá–7©7‘ÔI—@ÀœÑöÐÕ²¯¨³PG33š ©ê'ïFÃOwës³wö9àß–tFð´ö Y:»ú|yYcð`qG±!MYDíLlˇfrH½œ»ÑTú³_Çc\§WÒx'øˆÎ 1¥·’2Zf'fy—fA!lgbƒ4ölyÖ^2™3% åæ'.¸¤T&=d=ÑI°Ð1y„ÐìámŽØ÷Û5:†yOYÄöW*¯ì¡$3ÙQAA%:œ\ŒîÞO·Ÿ6}t^6Š‚‹tW|-:14]†÷­?hX¢KSÇ€ØC_qÄ@…XBÒ]u¨• åÆlÌÁMræN’•ë³4b²)„Lá&bÑ è(¬ !±ÇÝÍÅÿ E…BtR±Ó®vàïÛjópç Úêîï`ÏýþøŠ0²I4Žßo¬ÉzÙ}òòõ„%Í ºÄ“ó!TmW¿ß~<ÿßTQÄâÓpúX y›«×oFÿ©¢…q"”gäzþ zfÍÍ©™J’;†3ꥨŸÆ ËÇ€î¤uÅuZK`Ù%¬˜á>žìA!ì*W‘×E<\,“—¦Qê ÔzQñh:;'Tdë%¥Ö)è§âÄÖ–½vsº.0êÓv%uzEŽä`]0ÕÕõ†&uMâÖre$úDTGTrÓ[t^¦–^!\q¦ÑC^Ó›©te¯.nØ?X·b\Ô) ´õR …»_R.ï¬ÃhÚÜÏÓc8[¼fÿªÙt +ÔÜÈeR;Cƒž$«šÄª™÷ ÜÁòx!dø\^€ž\šËii‹–NwáMôâϱŽœÖËܳòí¹ï%EjÓ)˜Š)îkçN·ssßR|-½C– +QÇœ™#]pºÕvK^ŠÃþÜžÌfâOîrÊdÇ£/XÿÀ;ÀÍ8¢.GâE ™ÍÚw J¥æ~5à_—œü_k ‡á{>š5ö>Z5Ö†øOMÁÚ'™:t6ˆH»ÍÆ ÄyòlN«oõ±DÉXòERçÝÞq¹-¸œDª¤´»gÆîrÄDH8.L C1y P[ª­ÎA•t¡Ú쳊Ѷpjâl¿&{E<"€™ j94겿¦(ª±‰ÐzyižÕq1ÿ+:ˆÚ4 ,‰ò`‚¼´@†DÐ¥¨+ìL9„°ìýžX¿Ñ¥{QQ›j"¬öñt“º´Ù Ù4™:£ŽÍ­C’sð9í_BN»ÅÆ&œº/átð³85›EH¼©§r*‡ª¼¹rœ3 K9 „Sèžg¹P›¤&¤T \z¥³Dˆ*2T\z0Ñõ•=Y½OÃÂÚiF+Ý;®.(½QsoSõû¡yA„ªPq+†¬ êŸï< ÓÆŠy}hÁ!Yb®ï3_ ?Ï1"O¶T :Ï%ìç ­*ÜkLÉG¦¤›‚°È¹Éê³'€ÛÖMº ø>eò€)Ÿ¹à³zBÈ4¼°}ÅK8Îð‡š"iÞlåÿEõ´Y è{ÀnhUo?•Ùé³¼âTn0AKV¼o ’lT¥7 Í:Õ׃~Zš‰FŒàÁÀ(In–N’çL×ÈÎDû¦b”²oL`Í·|ÈYóEš\î¦9 FV”Fª]²Áo³mj¥uá3éÞæìFÓ U·"ÇAÚ”•t(S9 ÄåP¤,˜¯`–ÒìÈÌÆ[˜µÀs»Y£µðê- u`j“ß­k#}„r_[¸¶Õé>õ_èð[¹tkGãÚ Ü*ÿÓ4~Zé$Oÿ¼5~:ÆOã|”OʲNì¦(>b‘ ¯ðòž‘…-œpØ&ÌÈô»ˆ®9Ø'¾ã²f§¸´Ý8@ \¾ß|Û¡¥]„ÐZÝCb/i½í¼’Xk2Òä\GéÉ>aq FèŒR¥:BE0Ý¥”ó>QŽ)0³]å¶rí*ÝPóÇs*ý«§¶oË3_4ê ‡–:t«Á&];¥vkÎŒbol„óièâNΨXÙäæ8²)wЀ nuöeº`´ÈUa®öë§é¨½ïôxÑbè€Lô KÌg‹{¦±shÝdAÀæ» Ò@$k*¹ˆÈI JYË4Œ ²ž«…¥·:°^(&ëL/¸L )°E6o`‘E)_FÌ'¡ˆ–ô¥#H«E<¥’l&³$*d¼§/S&Ξè"d@Ö&_È/ éÝ7s+—GR‰-UïŠ>È«lš0ö¨O÷±ªdZ’Ãœ¶f@È¢¥\µº{eƒöCÔO‚ûdöÈã÷ˆê"o™|‡ØŒþD%ƒÊhêÁ¥³à6âg¾–T&™'IOølÄÒÔ]Ѩ«ËïèÖ4"}æ ,:]Œùn±Y©Dù3¼.5•H5—ݧO4Ìô1‹²5ÙÜÛÎ{}¸CwF®HÊÿa"°´Vû lh;œ$!D+'΋Çb“Mnž[ºRé_\€›"sò¼¢²Œ%‡5³GÃþ¼o»ö|ð0½·Ý9ª»yAŽ t5ïæMYQ'°Ô%injý5ÛxY©4§úi„iH[ÆfqÉiî[M†œ 9/ºíÿSØ,í@w•Ã9m‘¼Ó"käDýÈoZ7¿W9ë,‘“D};‡Ø+õjD>Ù_šFe{Â46€iŪjóÕYÃ[¸[¸W ¾WgX¥»€@eÁ_+'´r31¿BD}婈YBáþ]æa/LOWiP6¹$pò" S!zFÓTÜ«™ o•Œ„xÌb'’É«ŽAMÞ7-Š¾H°#m¨™Þ^°%Wšßv˜÷Ù·Ãy+¸s[«¼È± +µ·S^;¨ÐX+¢uz+¦Üµ*®“†ŸN¡"*Tø¨c[]M$\Ó—^®[ž‡Âk‹{š>â¢"°Øî¢_*º‘_Þwˆ†ÂÚøÎåª2eqy|M®Q6¬\ñ-OÀ:“ØIU\Ź+¹P´Lã9"wßQ£±¦ƒ9ÿýóy‹øp-×q×H$få`Tˆ¢·8jgRÌ Jào´¼¨á床ñïa¯*Â’Ò@†?‘¸P‰„uÈ4Nq1ªh t©¾kXBZÝ׈½Äæ;‘_× ‹ñ›d–ÂyøîGøÂû (½‚‘ 숀±‚Äÿñ(‡ýÜ êßàöa[*?mÃ`AuÔn§íäï˜&tM3*+y%ë,”<†bªðC ]§(5e€ª)Ä;@Ë\OÓ¥ž)ΈD!–rRè.HR¤¦Ñ>5ÂæC£f›J ¹†› M|üu4êhÈ̾" SH5^Åýv\‘_ÏqÊ[\*@!ówZݘ®™ºK ݆œ(׎Ü8>$L2ù)§_¼JFÚ<š©ìœB]Úžuésn´ÊP·ŠWX3³te©­Môr—\à‰ÌhX‡8þFbùé;|ñs§Ž}ß!ßí¡;¿sì¾3í@»„7Çp|;¿yèÿèÉÃÌ- íëLçθè¯á« ¾E¢×sj8+Àc?Ï áµc'"SãÊ<¾\=—=‹Ä?ÿ­x,û#5N)kÇìEjOÈf4í6 çÈߺwêYög®=î9Û_ê-¬0ÃäR.v‚¡Ž2Z[”@×8=%pÿªÊ,kJšoäèš{õ¼u¶ôt÷üÏB‘êÃóð2¨ö‰±T¹sv²$΂ Ku©ôì³ý $Ì4¡›óÀüPK=ÂÀæµf zlib.cpp¥UmOÛHþŒÅÀéZ›¦ áM= H!/ h áîTE{¯ºÞµÖkB ü÷ÎÚ ±s»^Q>àñ¼<óÌÌãF¾ >ªûIïa¢¹1(ÉÁ| €K0B’÷!P1#Ëh ·È¡Ã¸ã4°aSlOsWÉbƒ ߤšHhƒ`rœ±1‚¯âDcšr%â4ÓS›ÄŒIÉdRÏ!)=ör$L¤j)s9G¨tÌLžâª×†æ{[¹3“ÇÌ*1J“ÖaÔ ´¦MžÔf°yÏÌØ*äaÓYd+ª×ç7.}‘‰Õ£’!o§j 0Ìà’•Ëg«sÙºè^÷[íîð¤{zvé¶õ41ªß÷'µ˜|‚!SC³ ¸nï¼5è/ºƒOŸ;ð>®ðêuÎÚƒ!yž’GŽŽ`ï0àæ¯ü9ÎâüEM¶gÄ(}ppK»„}z2Yü Y€Úõœg-²@ ÞÙ®_Ñ[¢ßõµ¡‡m©›GpÝS4çj¼}Ëe &×ü;ºÞûžma÷9˜¸§N¾íÅ„Îñ…›»î“gËæG 4“i1ý{#盂A‡æ–f±ÉåµÑ\ŽkR;CåØDK Ý$-„»pžy½\»à]¥¦ ~À¸(hïñ{ ,u×èŸå;²@j°{ ³j‡åÊ=.™pgOÞ¿17w¬åó l™LùXæbþqõ„rv,ÒÊæVÍÎf –ÃÿþJƒتAsþÛ®þvž¨&Óò•,¬S¼œúš7óë'bè _â`Ùâždaˆz™_Ød9ïV‰j0RJ6%ÈèÁ’h•°qîé9kp–+e+GÍ*Ε ªb›íï¿ÞÅùVŽÑ¾à!¸ëñË/fX'†í-yðøKæ<Ä£6ÖL¤ÕŠª]­‹ 6Qõ =øÖ?ÂÖê¨5…MU·ßÒ{¼÷1±Ô¬ý­FKˈÄŒžÒQ´!s:ˆå;&ˆ%ºCVBo`ëžÚX_–«’™fI¢´Á %ÆŠî2Š­jõ¦$Ê+#í h)¹o!Ó‡¬HEE ­âÃ;ÈÏoðõé.Œ?©N¯ Á ©úi=[½ÿWÓ,ÛÕM+‰•àî‚ùVñf¶tóå£ÿ5§Ï¢øRØSùëݽì8?PKŒ=‰p”s>zzlib.h¥Vßo£F~öþÓDªìÈ­ïÒö¡¶ü@ IÐ9$ÑE•Ð{UØEË’6åïòÃ`°£Ü©Èbvæ›ofg>|Ê"b‹ÕW×»u]ÿɱ/ükrªŒãœ2ÄyˆpBÃåoç¿nOöŒßt\Lö¬Œ7V²4n¬;×XXþ…ue/‡ ù’*áº#B&“ ‰`!’Tb– ÃÕå>ÿùǧ bšeð³õÞùÒ|³Ì2³ä•T–)t}‡y¡ÄГ”g‘ ULp8£JÑ`› Wóå½ãŒ!çÛp quI>c<7­KãÞñ|ýëžå;ÖƒÕˆÅæü‘ñPüsǾaâÜ^ûöÒ¼}ôïì'k k!b ¯0P÷<¨y²uŒs%s‘Á`Ú”5lIŽ;”ƽ|㣈#x};èG x¦`I| qŽ.e2ƒŸS*µE¡ÌÆðëQÝGh=K dÐiÕª[Ö3AÉkFH*EQ †ú*Ÿ áQ2…®öVir4D9ÍêSWŠ@µ…chREë2×/ áLG2¾C¦;åë«B¾Qۡ™ªx”Å<Õ°Câ×c?#o³½51ø`d;ÍÐÚüphÕKŠÅNîΦSKJÐfYáU…Ö¨xy­!ÚsÝËiq4´—†c›¾ix†y»º1¼1œôyMa[Fê D¨û(¥'Åͽ5Ùë^¼Ÿ¾uhò—yí¥g]­lï«¿¸¶_üKÃv,ó(Ãt¬•îw°Åàï£,îy–§©z:Œx#ôÅm“wøsýáÎä-ÐÊûœŠ!Ee² Ø*_>¦Öø_ Ó ÂmÇ” &g?Á_冂Ä©*o»‚$Kc„v… Ú…Lï+d(fzÙkš+q§·™Æz÷Rº©Ôá(*—DÁF¡´¸F*]ÉàlRIÑ>ÿïg˜C%Ï¥nÖäçÑ8ÓªWÈÉq>søås±â}åq:º¹Óx•X’Oü®°ÎÞ EbÏZx§=°úoO•Ž"žkˆŽT}$emƒ~Dʨuí(³ß˜ÁîAwÞÉöƒo-MýyÈ"òPK=\əε,adhoc.cpp.protouŽA ‚@…ÏͯX •ÑÅ $":(BuŠmr¡4vÇH¢ÿÞÚ!´è6ó½Ç{¯§ry.SdÝ£:j3̺ÐkBüBapÖNx@G#•6Üóá `H’ï&“(6eÎ'Ã>ýFä€y¶èPK‘=ÌÐÖͪþ  3way.cppPK‘='Æ-\Eð Ð3way.hPK=+t†ý  9adler32.cppPK‹=úmB…t  _ adler32.hPKŽ=þý±ÓâJ aes.hPKÛ{TBO™Z6< ã#   algebra.cppPK=t£ïÚ"  ualgebra.hPK=”ìqà  ‹algparam.cppPKÇ=åBÓÃ= z1  & algparam.hPK=èÁ‘~¸„ ‹,arc4.cppPK=o³ÒÀ?  i0arc4.hPKË=ñ¡á«×  M4argnames.hPKÈ= ¢ â3 L8asn.cppPKŽ=áa̯ ´. Easn.hPKŒ=ô%£ PG  åQauthenc.cppPK=ô¼–ûØ  ^Wauthenc.hPKÎ=O Ë-#¦  €Zbase32.cppPKŽ=e€ìOK@ Ë\base32.hPKÊ=>ÒÜmà  <_base64.cppPK=¶–}:® Ñabase64.hPK‘=¥8©}*û  ¥cbasecode.cppPK=q½Ú³  ùibasecode.hPKÙ{TBO×­:' @2  #mbench.cppPK=¦^n‘Ö qxbench.hPKÛ{TB4À é‰/  'ybench2.cppPKŒ=hc‚½²6  8‚bfinit.cppPKŒ=ò„²¢U¾  œblowfish.cppPKÛ{TBMh[¼s×  œŸblowfish.hPK‘=w/o AX  7¢blumshub.cppPK=Ÿ †S  ¢¤blumshub.hPK=p³0ðMÁQ  §camellia.cppPKŒ=qdòKc  ”Äcamellia.hPK=NœÝ + Çcast.cppPK=c°Ùé  Õcast.hPK=7¥vC /¨r  Øcasts.cppPK=ók”Õ  ^cbcmac.cppPKŒ=l©læ„ › cbcmac.hPK=Ÿ|÷™À § ccm.cppPK=3T:Í{<  åccm.hPK=œÕ’ ^ö  ƒchannels.cppPKŽ=¡ý"pÙ  channels.hPK=ÒäÌ»õ  £!cmac.cppPK=÷|éL „%cmac.hPKÛ{TB@  .Mdh.hPK=œØ‰';€ ŽQdh2.cppPKŽ=;3 ¥][ îRdh2.hPK=0~–ƒo nUdll.cppPK=DŒKhY §Zdll.hPKÇ==-Nµ3  2]dlltest.cppPKŽ=?»!.Ñ  edlltest.dspPKÎ=ÓŒá4¥# Widlltest.vcprojPK‹=äp“àó  (ndmac.hPKÕj =$ÕÞÍKà  ,rDoxyfilePKÙ{TB0±Dä ¾dsa.cppPKŽ= $J» (Àdsa.hPK=T‡Ð( •Âeax.cppPK=5æÕíÇR  âÄeax.hPKÍ=_þY%$ ÌÈec2n.cppPKŽ=a ul  Ñec2n.hPKÚ{TB‘ ©9)Dv  DÖeccrypto.cppPKÚ{TB*Çxð_ ö)  §ÿeccrypto.hPKŒ=êH® I- . ecp.cppPK=ˆS‹ô4 eecp.hPKŒ=Œ ÀÒN  |elgamal.cppPK=¹=Ù)ˆ  welgamal.hPK=¨Ž•%@´  Ç$emsa2.cppPK=ÓíƒRÄ .'emsa2.hPKŽ=ÁM‹è  ¥*eprecomp.cppPK=rK„áî/  Z/eprecomp.hPK=¾ m1­  p2esign.cppPKŽ=óÚn:Þ È9esign.hPKÛ{TBùž {Ÿ  '?factory.hPKÊ=••@Cé­  ÉCfiles.cppPKË=WîT´® ÙJfiles.hPK‹=ÛOÊÄî„  ²Ofilters.cppPKÕj =W0ÎçŸÔ„  Ÿifilters.hPK=v°)ý  e„fips140.cppPK=Rgk˜>  ·‡fips140.hPK=\O»g ·  v‹fipsalgt.cppPKÉ=&Fkžî`Z  ¶«fipstest.cppPKŽ=™'¨lê•  ÎËfltrimpl.hPKÈ="8pÃa àÍgcm.cppPKÌ=zTNt½Ó  Èägcm.hPK=D“Í׋  ¨égf2_32.cppPK=EɃBÓæ §ìgf2_32.hPKÍ=†{ÝU%ëH  îgf2n.cppPKÌ=Fð,ÀÛ . ëgf2n.hPKŽ=-wJ4CP  ê gf256.cppPK=Hk’ Ç· Tgf256.hPKÛ{TB~ Xñ3 k!  @gfpcrypt.cppPKÚ{TBÿw8ýg9L  gfpcrypt.hPKÚ{TBNB•¸½ §  ,+GNUmakefilePKÉ=‘¬  5gost.cppPKÇ= ÚŒki$ ä9gost.hPK=MGsWŠö  q<gzip.cppPKŽ=ŒmáÑ] !@gzip.hPKÎ=Ê9} ÒChex.cppPK=_èz{[ ùEhex.hPK‘=é|ö³Â Hhmac.cppPKŽ=pJëU& Khmac.hPK=¢Â"É«9  Nhrtimer.cppPKŽ=X-åŒ  UShrtimer.hPK=&^-Ñ !, aVida.cppPK‘=<´ý9$H Waida.hPKÍ=ˆ"Qßæ žfidea.cppPKÍ=ƒT]Pñ¶ ªlidea.hPKË=âõ×!£V³¡  ¿ointeger.cppPKÉ=—‚•,4  ‹Æinteger.hPKÌ=øý1Œ+  ÞÔiterhash.cppPKŒ=kpî1³  ”Úiterhash.hPKÚ{TBéæÐzô#  íßLicense.txtPKŒ=K±Èß  ålubyrack.hPKŒ=ˆcÝ^% Eéluc.cppPKŒ=£YÕû O  ðluc.hPKÇ= ¡U§"Û  Íùmars.cppPKÈ=ë;m¨DÆ ÿmars.hPK=ê¢m   }marss.cppPK‘=ÙˆÝ ——  md2.cppPK‘=_c؇” Ímd2.hPKŽ=–ñóu–½  wmd4.cppPK=+øÓ k 2md4.hPK=ºü/}Ùó Àmd5.cppPKŽ=žVA½$ ¾!md5.hPKŒ=UÛlØ $mdc.hPKÉ=¤;f9‹ (misc.cppPKÚ{TBAËÓL… _,misc.hPKŽ=k¢õ«Ñ  žJmodarith.hPKË=à¬y¨f  qPmodes.cppPKÈ=æ^—ò yC þWmodes.hPKŒ=o~²à  &dmodexppc.hPK= ï˜15  .fmqueue.cppPKÎ=à$Cßô6  ‡kmqueue.hPKŒ=æC ™™º ¡pmqv.cppPK‹=èçëÄì _qmqv.hPK=ÌÆ-É\  Fwnbtheory.cppPKŽ=žfŒ`Š  „“nbtheory.hPK‘=z’ª;  6›network.cppPKŒ=¦IFÐ   ñ©network.hPK=øÇ«à=K è³nr.hPKŒ=Ó%s¿â  G´oaep.cppPK‘=o,ÃÉ ,¸oaep.hPKÈ=냉i »oids.hPKÚ{TB«fMÚðÜ  À¿osrng.cppPKÕj = ²‹‹8 >.  rCqueue.cppPKÛ{TBò䫶?~ 6Nqueue.hPK=áéf¸BÞ  šSrabin.cppPK=ZþÐJ  Zrabin.hPKË=§Á\Á  ø]randpool.cppPKŒ=•*iæ  *arandpool.hPKŽ=h¸XHíC  ccrc2.cppPK‘==\!:  uirc2.hPK=ð(~Vs šlrc5.cppPKŽ=jxÅÃc prc5.hPKŽ=˜:(JÌì ›rrc6.cppPK=Õž‚Òd Œvrc6.hPK=Õ •_W  yrdtables.cppPKÚ{TB"yÕ!ÊY  ”Readme.txtPKÚ{TBo¤"lü  ‘¡regtest.cppPK=uÆê  &¦resource.hPKÚ{TB¬IÏf#ä‘  8§rijndael.cppPKÎ=øѨ”)¼  ÈÊrijndael.hPK=qçÂâ &z  Îripemd.cppPK‘=ƒä+`ü– #Ùripemd.hPK=&úó*É EÛrng.cppPK={=¥R8\ ”árng.hPKŽ=‘2Òî –" ïårsa.cppPK‘=>Ýb\= ðrsa.hPK=Žk÷ªø örw.cppPKÛ{TBB|ý¬  kýrw.hPK‹=0Tm=÷g  9safer.cppPKŽ=¿,>  W safer.hPKÚ{TB sMEÉÆX  ’ salsa.cppPKŽ=fì°f1~ ‚ salsa.hPKŒ=ž…¥âÓ Ø#seal.cppPK‘=9™çž à)seal.hPKÚ{TB¸ñÛy K0  ë,secblock.hPKŽ=–ýÔìÁá :seckey.hPKŽ=ß<05×F úAseed.cppPK=ãüd‘ûz ÷Iseed.hPKŒ=YÔ™@(  Lserpent.cppPK=½Ë ßHã  SPserpent.hPK= 5­!  ÂRserpentp.hPKÉ= zž&œd —Xsha.cppPKŒ=Õä[b€  âusha.hPKÛ{TBÐmY¶å% gxsha3.cppPKÚ{TBOñeÞxv Csha3.hPK=4ô= Ù  ߃shacal2.cppPK=B+©·Gë  (Šshacal2.hPK=àØ(Ô¬  –Œshark.cppPK=Ì °WŽË ‘’shark.hPKŽ=Q(ÏOY³ÜË  D•sharkbox.cppPK‘=»:Ž™Ì  ÇHsimple.cppPKŒ= Ùmæ ˆIsimple.hPKÍ=>7»V6±  °Pskipjack.cppPKÉ=¡,$R”  Yskipjack.hPKÊ=HϦߋ  Ì[smartptr.hPK=Ÿ ái ¶/  Ó`socketft.cppPK=f·ÉÌŸ  flsocketft.hPKŽ=›¬Åî`-\  Ztsosemanuk.cppPKŒ=õ  å“sosemanuk.hPKË=Ööº½ÓŒ  ©–square.cppPKÎ=X´×‰kd ¤œsquare.hPK‘=`Ö*C}  5Ÿsquaretb.cppPKÕj =×Å[  }Éstdcpp.hPK=—VfQ‹Ñ  CËstrciphr.cppPKŒ=ï<>ïÒ 21  øÐstrciphr.hPKË=Y£¦› òÝtea.cppPK=iŽªWƒ  0âtea.hPKŒ=¨YÞ¿ò_e ªåtest.cppPKŽ=(f}©ÇC?  Âÿtftables.cppPKŽ=¸Œ,2  ³ tiger.cppPKŽ=û"|s< # tiger.hPKŽ=ú#68Ѭ  ž$ tigertab.cppPK=‚7 P0  þ\ trdlocal.cppPKŽ=Ç…â  x_ trdlocal.hPK‘= ðÙ²ès  %a trunhash.hPKŽ=ÿ7…ÓÒ×+  5c ttmac.cppPK=¶S«I¤˜ .l ttmac.hPKÈ=H”YÍÜ4  ÷n twofish.cppPKÇ=³-Û²…Ë  üt twofish.hPKÛ{TB‘©ã6(þ¾  ¨w validat1.cppPKÚ{TBHâ'æÍX  éŸ validat2.cppPKÕj =`Ùõæ.Ll  ùµ validat3.cppPKÚ{TB7{H²Ò  QÕ validate.hPKŒ=nƒ~®X “× vmac.cppPK=.$•wv  7ð vmac.hPK=‚Ç‹ÙÌ æ) Òô wait.cppPK=›¸w)  Ä wait.hPKË=Þc?Ž   wake.cppPKÈ=Õ5Êæ¹– F wake.hPK=*6Ý/ª)<¡  # whrlpool.cppPK=kªŸ[$  ÷< whrlpool.hPK‹=ˆÕr   z> winpipes.cppPK=(kÈ©<|  °C winpipes.hPK=õ&Š H words.hPKÉ=&‡ÅˆÓ±  _J x64dll.asmPKË=#nð¶á›  ZZ x64masm.asmPKŒ=iðx¯c×  dl xtr.cppPK‘=Ôší† ìp xtr.hPKŽ=jFeD  •v xtrcrypt.cppPK=äu:‰Ë  Üz xtrcrypt.hPKÌ=ÒŒîg™³^  Ï} zdeflate.cppPK=•þ¦5Ê­  ’— zdeflate.hPK‘=Å„öˆ@  „ zinflate.cppPK=0Ÿp“¡Ç  ±° zinflate.hPK=ÂÀæµf  z· zlib.cppPKŒ=‰p”s>z U» zlib.hPK=\əε, ·¾ adhoc.cpp.protoPK""/>™¿ synergy-1.4.12-Source/tools/gmock-1.6.0/0000700000175000017500000000000012140644175017411 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/aclocal.m40000600000175000017500000117440111561126632021262 0ustar synergysynergy# generated automatically by aclocal 1.11.1 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.65],, [m4_warning([this file was generated for autoconf 2.65. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 56 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl _LT_PROG_ECHO_BACKSLASH case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from `configure', and `config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # `config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain="$ac_aux_dir/ltmain.sh" ])# _LT_PROG_LTMAIN # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the `libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to `config.status' so that its # declaration there will have the same value as in `configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "X$][$1" | $Xsed -e "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "X$" | $Xsed -e "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags="_LT_TAGS"dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the `libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into `config.status', and then the shell code to quote escape them in # for loops in `config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\[$]0 --fallback-echo"')dnl " lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\[$]0 --fallback-echo"\[$]/\[$]0 --fallback-echo"/'\` ;; esac _LT_OUTPUT_LIBTOOL_INIT ]) # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) cat >"$CONFIG_LT" <<_LTEOF #! $SHELL # Generated by $as_me. # Run this file to recreate a libtool stub with the current configuration. lt_cl_silent=false SHELL=\${CONFIG_SHELL-$SHELL} _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ \`$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2008 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test $[#] != 0 do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try \`$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try \`$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. if test "$no_create" != yes; then lt_cl_success=: test "$silent" = yes && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) fi ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) _LT_PROG_XSI_SHELLFNS sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS="$save_LDFLAGS" ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES # -------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(whole_archive_flag_spec, $1)='' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" m4_if([$1], [CXX], [ if test "$lt_cv_apple_cc_single_mod" != "yes"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX # ----------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl AC_LINK_IFELSE(AC_LANG_PROGRAM,[ lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [ifdef([AC_DIVERSION_NOTICE], [AC_DIVERT_PUSH(AC_DIVERSION_NOTICE)], [AC_DIVERT_PUSH(NOTICE)]) $1 AC_DIVERT_POP ])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Add some code to the start of the generated configure script which # will find an echo command which doesn't interpret backslashes. m4_defun([_LT_PROG_ECHO_BACKSLASH], [_LT_SHELL_INIT([ # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\[$]\\[$]0,'[$]0','` ;; esac ECHO=${lt_ECHO-echo} if test "X[$]1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X[$]1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "[$]0" --no-reexec ${1+"[$]@"} fi if test "X[$]1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF [$]* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "[$]0"' 'sed 20q "[$]0"' 'sed 10q "[$]0"' 'sed 2q "[$]0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "[$]0" --no-reexec ${1+"[$]@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL [$]0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL [$]0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "[$]0"' 'sed 10q "[$]0"' 'sed 20q "[$]0"' 'sed 50q "[$]0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "[$]0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "[$]0" ${1+"[$]@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL [$]0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\[$]0 --fallback-echo" fi AC_SUBST(lt_ECHO) ]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that does not interpret backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '[#]line __oline__ "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ])# _LT_ENABLE_LOCK # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [AC_CHECK_TOOL(AR, ar, false) test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1]) AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test x"[$]$2" = xyes; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" ]) if test x"[$]$2" = xyes; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL [$]0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n $lt_cv_sys_max_cmd_len ; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "$cross_compiling" = yes; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line __oline__ "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[ lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen="shl_load"], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen="dlopen"], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"]) ]) ]) ]) ]) ]) ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links="nottested" if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test "$hard_links" = no; then AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/", [Define to the sub-directory in which libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[[4-9]]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[123]]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[[3-9]]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program which can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$1; then lt_cv_path_MAGIC_CMD="$ac_dir/$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac]) MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program which can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]].[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method == "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi]) if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. AC_CHECK_TOOLS(DUMPBIN, ["dumpbin -symbols" "link -dump -symbols"], :) AC_SUBST([DUMPBIN]) if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:__oline__: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cygwin* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw") AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM="-lm") ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= AC_MSG_CHECKING([for $compiler option to produce PIC]) m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC*) # IBM XL 8.0 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_MSG_RESULT([$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;/^.*[[ ]]__nm__/s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; xl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='-rpath $libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(fix_srcfile_path, $1)='`cygpath -w "$srcfile"`' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; freebsd1*) _LT_TAGVAR(ld_shlibs, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" AC_LINK_IFELSE(int foo(void) {}, _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' ) LDFLAGS="$save_LDFLAGS" else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' else case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' ;; esac fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_MSG_CHECKING([whether -lc should be explicitly linked in]) $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then _LT_TAGVAR(archive_cmds_need_lc, $1)=no else _LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* AC_MSG_RESULT([$_LT_TAGVAR(archive_cmds_need_lc, $1)]) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_flag_spec_ld], [1], [[If ld is used when linking, flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting ${shlibpath_var} if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [fix_srcfile_path], [1], [Fix the shell variable $srcfile for the compiler]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC="$CC" AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report which library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC="$lt_save_CC" ])# _LT_LANG_C_CONFIG # _LT_PROG_CXX # ------------ # Since AC_PROG_CXX is broken, in that it returns g++ if there is no c++ # compiler, we have our own version here. m4_defun([_LT_PROG_CXX], [ pushdef([AC_MSG_ERROR], [_lt_caught_CXX_error=yes]) AC_PROG_CXX if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_CXX dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_CXX], []) # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [AC_REQUIRE([_LT_PROG_CXX])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd[[12]]*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; gnu*) ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]]* | *pgcpp\ [[1-5]]*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 will use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; xl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=echo else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && $ECHO "X${wl}-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(GCC, $1)="$GXX" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ]) dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}" else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)="${prev}${p}" else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)="$p" else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)="$p" else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_PROG_F77 # ------------ # Since AC_PROG_F77 is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_F77], [ pushdef([AC_MSG_ERROR], [_lt_disable_F77=yes]) AC_PROG_F77 if test -z "$F77" || test "X$F77" = "Xno"; then _lt_disable_F77=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_F77 dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_F77], []) # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_REQUIRE([_LT_PROG_F77])dnl AC_LANG_PUSH(Fortran 77) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_F77" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${F77-"f77"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$G77" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_F77" != yes AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_PROG_FC # ----------- # Since AC_PROG_FC is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_FC], [ pushdef([AC_MSG_ERROR], [_lt_disable_FC=yes]) AC_PROG_FC if test -z "$FC" || test "X$FC" = "Xno"; then _lt_disable_FC=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_FC dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_FC], []) # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_REQUIRE([_LT_PROG_FC])dnl AC_LANG_PUSH(Fortran) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_FC" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${FC-"f95"} compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_FC" != yes AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC="$lt_save_CC" ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC= CC=${RC-"windres"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC="$lt_save_CC" ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PROG_XSI_SHELLFNS # --------------------- # Bourne and XSI compatible variants of some useful shell functions. m4_defun([_LT_PROG_XSI_SHELLFNS], [case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $[*] )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } dnl func_dirname_and_basename dnl A portable version of this function is already defined in general.m4sh dnl so there is no need for it here. # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[[^=]]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[[^=]]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[[^.]]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$[@]"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$[1]" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]+=\$[2]" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]=\$$[1]\$[2]" } _LT_EOF ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option `$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl `shared' nor `disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [0], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [0], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [0], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the `shared' and # `disable-shared' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the `static' and # `disable-static' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the `fast-install' # and `disable-fast-install' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the `pic-only' and `no-pic' # LT_INIT options. # MODE is either `yes' or `no'. If omitted, it defaults to `both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [pic_mode="$withval"], [pic_mode=default]) test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) # ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59 which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) # ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # Generated from ltversion.in. # serial 3017 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.2.6b]) m4_define([LT_PACKAGE_REVISION], [1.3017]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.2.6b' macro_revision='1.3017' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) # lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 4 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_RC], [AC_DEFUN([AC_LIBTOOL_RC])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.11' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.11.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.11.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 10 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 5 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 16 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The `parallel-tests' driver may need to know about EXEEXT, so add the dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # ------------------------------ # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ---------------------------------- # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PATH_PYTHON([MINIMUM-VERSION], [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND]) # --------------------------------------------------------------------------- # Adds support for distributing Python modules and packages. To # install modules, copy them to $(pythondir), using the python_PYTHON # automake variable. To install a package with the same name as the # automake package, install to $(pkgpythondir), or use the # pkgpython_PYTHON automake variable. # # The variables $(pyexecdir) and $(pkgpyexecdir) are provided as # locations to install python extension modules (shared libraries). # Another macro is required to find the appropriate flags to compile # extension modules. # # If your package is configured with a different prefix to python, # users will have to add the install directory to the PYTHONPATH # environment variable, or create a .pth file (see the python # documentation for details). # # If the MINIMUM-VERSION argument is passed, AM_PATH_PYTHON will # cause an error if the version of python installed on the system # doesn't meet the requirement. MINIMUM-VERSION should consist of # numbers and dots only. AC_DEFUN([AM_PATH_PYTHON], [ dnl Find a Python interpreter. Python versions prior to 2.0 are not dnl supported. (2.0 was released on October 16, 2000). m4_define_default([_AM_PYTHON_INTERPRETER_LIST], [python python2 python3 python3.0 python2.5 python2.4 python2.3 python2.2 dnl python2.1 python2.0]) m4_if([$1],[],[ dnl No version check is needed. # Find any Python interpreter. if test -z "$PYTHON"; then AC_PATH_PROGS([PYTHON], _AM_PYTHON_INTERPRETER_LIST, :) fi am_display_PYTHON=python ], [ dnl A version check is needed. if test -n "$PYTHON"; then # If the user set $PYTHON, use it and don't search something else. AC_MSG_CHECKING([whether $PYTHON version >= $1]) AM_PYTHON_CHECK_VERSION([$PYTHON], [$1], [AC_MSG_RESULT(yes)], [AC_MSG_ERROR(too old)]) am_display_PYTHON=$PYTHON else # Otherwise, try each interpreter until we find one that satisfies # VERSION. AC_CACHE_CHECK([for a Python interpreter with version >= $1], [am_cv_pathless_PYTHON],[ for am_cv_pathless_PYTHON in _AM_PYTHON_INTERPRETER_LIST none; do test "$am_cv_pathless_PYTHON" = none && break AM_PYTHON_CHECK_VERSION([$am_cv_pathless_PYTHON], [$1], [break]) done]) # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON. if test "$am_cv_pathless_PYTHON" = none; then PYTHON=: else AC_PATH_PROG([PYTHON], [$am_cv_pathless_PYTHON]) fi am_display_PYTHON=$am_cv_pathless_PYTHON fi ]) if test "$PYTHON" = :; then dnl Run any user-specified action, or abort. m4_default([$3], [AC_MSG_ERROR([no suitable Python interpreter found])]) else dnl Query Python for its version number. Getting [:3] seems to be dnl the best way to do this; it's what "site.py" does in the standard dnl library. AC_CACHE_CHECK([for $am_display_PYTHON version], [am_cv_python_version], [am_cv_python_version=`$PYTHON -c "import sys; sys.stdout.write(sys.version[[:3]])"`]) AC_SUBST([PYTHON_VERSION], [$am_cv_python_version]) dnl Use the values of $prefix and $exec_prefix for the corresponding dnl values of PYTHON_PREFIX and PYTHON_EXEC_PREFIX. These are made dnl distinct variables so they can be overridden if need be. However, dnl general consensus is that you shouldn't need this ability. AC_SUBST([PYTHON_PREFIX], ['${prefix}']) AC_SUBST([PYTHON_EXEC_PREFIX], ['${exec_prefix}']) dnl At times (like when building shared libraries) you may want dnl to know which OS platform Python thinks this is. AC_CACHE_CHECK([for $am_display_PYTHON platform], [am_cv_python_platform], [am_cv_python_platform=`$PYTHON -c "import sys; sys.stdout.write(sys.platform)"`]) AC_SUBST([PYTHON_PLATFORM], [$am_cv_python_platform]) dnl Set up 4 directories: dnl pythondir -- where to install python scripts. This is the dnl site-packages directory, not the python standard library dnl directory like in previous automake betas. This behavior dnl is more consistent with lispdir.m4 for example. dnl Query distutils for this directory. distutils does not exist in dnl Python 1.5, so we fall back to the hardcoded directory if it dnl doesn't work. AC_CACHE_CHECK([for $am_display_PYTHON script directory], [am_cv_python_pythondir], [if test "x$prefix" = xNONE then am_py_prefix=$ac_default_prefix else am_py_prefix=$prefix fi am_cv_python_pythondir=`$PYTHON -c "import sys; from distutils import sysconfig; sys.stdout.write(sysconfig.get_python_lib(0,0,prefix='$am_py_prefix'))" 2>/dev/null || echo "$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages"` case $am_cv_python_pythondir in $am_py_prefix*) am__strip_prefix=`echo "$am_py_prefix" | sed 's|.|.|g'` am_cv_python_pythondir=`echo "$am_cv_python_pythondir" | sed "s,^$am__strip_prefix,$PYTHON_PREFIX,"` ;; *) case $am_py_prefix in /usr|/System*) ;; *) am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages ;; esac ;; esac ]) AC_SUBST([pythondir], [$am_cv_python_pythondir]) dnl pkgpythondir -- $PACKAGE directory under pythondir. Was dnl PYTHON_SITE_PACKAGE in previous betas, but this naming is dnl more consistent with the rest of automake. AC_SUBST([pkgpythondir], [\${pythondir}/$PACKAGE]) dnl pyexecdir -- directory for installing python extension modules dnl (shared libraries) dnl Query distutils for this directory. distutils does not exist in dnl Python 1.5, so we fall back to the hardcoded directory if it dnl doesn't work. AC_CACHE_CHECK([for $am_display_PYTHON extension module directory], [am_cv_python_pyexecdir], [if test "x$exec_prefix" = xNONE then am_py_exec_prefix=$am_py_prefix else am_py_exec_prefix=$exec_prefix fi am_cv_python_pyexecdir=`$PYTHON -c "import sys; from distutils import sysconfig; sys.stdout.write(sysconfig.get_python_lib(1,0,prefix='$am_py_exec_prefix'))" 2>/dev/null || echo "$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages"` case $am_cv_python_pyexecdir in $am_py_exec_prefix*) am__strip_prefix=`echo "$am_py_exec_prefix" | sed 's|.|.|g'` am_cv_python_pyexecdir=`echo "$am_cv_python_pyexecdir" | sed "s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,"` ;; *) case $am_py_exec_prefix in /usr|/System*) ;; *) am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages ;; esac ;; esac ]) AC_SUBST([pyexecdir], [$am_cv_python_pyexecdir]) dnl pkgpyexecdir -- $(pyexecdir)/$(PACKAGE) AC_SUBST([pkgpyexecdir], [\${pyexecdir}/$PACKAGE]) dnl Run any user-specified action. $2 fi ]) # AM_PYTHON_CHECK_VERSION(PROG, VERSION, [ACTION-IF-TRUE], [ACTION-IF-FALSE]) # --------------------------------------------------------------------------- # Run ACTION-IF-TRUE if the Python interpreter PROG has version >= VERSION. # Run ACTION-IF-FALSE otherwise. # This test uses sys.hexversion instead of the string equivalent (first # word of sys.version), in order to cope with versions such as 2.2c1. # This supports Python 2.0 or higher. (2.0 was released on October 16, 2000). AC_DEFUN([AM_PYTHON_CHECK_VERSION], [prog="import sys # split strings by '.' and convert to numeric. Append some zeros # because we need at least 4 digits for the hex conversion. # map returns an iterator in Python 3.0 and a list in 2.x minver = list(map(int, '$2'.split('.'))) + [[0, 0, 0]] minverhex = 0 # xrange is not present in Python 3.0 and range returns an iterator for i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[[i]] sys.exit(sys.hexversion < minverhex)" AS_IF([AM_RUN_LOG([$1 -c "$prog"])], [$3], [$4])]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. AM_MISSING_PROG([AMTAR], [tar]) m4_if([$1], [v7], [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/0000700000175000017500000000000012140644175021303 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/config.guess0000600000175000017500000013105411561126632023625 0ustar synergysynergy#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 # Free Software Foundation, Inc. timestamp='2009-06-10' # This file 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. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm:riscos:*:*|arm:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[456]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) case ${UNAME_MACHINE} in pc98) echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:[3456]*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; EM64T | authenticamd | genuineintel) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-gnu else echo ${UNAME_MACHINE}-unknown-linux-gnueabi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit ;; crisv32:Linux:*:*) echo crisv32-axis-linux-gnu exit ;; frv:Linux:*:*) echo frv-unknown-linux-gnu exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; or32:Linux:*:*) echo or32-unknown-linux-gnu exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-gnu exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-gnu exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-gnu exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-gnu exit ;; x86_64:Linux:*:*) echo x86_64-unknown-linux-gnu exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) LIBC=gnu #else LIBC=gnuaout #endif #endif #ifdef __dietlibc__ LIBC=dietlibc #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^LIBC/{ s: ::g p }'`" test x"${LIBC}" != x && { echo "${UNAME_MACHINE}-pc-linux-${LIBC}" exit } test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NSE-?:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/config.h.in0000600000175000017500000000346111561126632023333 0ustar synergysynergy/* build-aux/config.h.in. Generated from configure.ac by autoheader. */ /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define if you have POSIX threads libraries and header files. */ #undef HAVE_PTHREAD /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to the sub-directory in which libtool stores uninstalled libraries. */ #undef LT_OBJDIR /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define to necessary symbol if this constant uses a non-standard name on your system. */ #undef PTHREAD_CREATE_JOINABLE /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Version number of package */ #undef VERSION synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/config.sub0000600000175000017500000010242511561126632023270 0ustar synergysynergy#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 # Free Software Foundation, Inc. timestamp='2009-06-11' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file 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. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nios | nios2 \ | ns16k | ns32k \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* | tile-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; mvs) basic_machine=i370-ibm os=-mvs ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tile*) basic_machine=tile-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -kopensolaris* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -kaos*) os=-kaos ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/depcomp0000600000175000017500000004426711561126632022673 0ustar synergysynergy#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2009-04-28.21; # UTC # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009 Free # Software Foundation, Inc. # 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, 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 . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u="sed s,\\\\\\\\,/,g" depmode=msvisualcpp fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/install-sh0000600000175000017500000003253711561126632023317 0ustar synergysynergy#!/bin/sh # install - install a program, script, or datafile scriptversion=2009-04-28.21; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # 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 # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call `install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then trap '(exit $?); exit' 1 2 13 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names starting with `-'. case $src in -*) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # Protect names starting with `-'. case $dst in -*) dst=./$dst;; esac # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writeable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; -*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test -z "$d" && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/ltmain.sh0000600000175000017500000073341511561126632023141 0ustar synergysynergy# Generated from ltmain.m4sh. # ltmain.sh (GNU libtool) 2.2.6b # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007 2008 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, # or obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --config show all configuration variables # --debug enable verbose shell tracing # -n, --dry-run display commands without modifying any files # --features display basic configuration information and exit # --mode=MODE use operation mode MODE # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print informational messages (default) # --version print version information # -h, --help print short or long help message # # MODE must be one of the following: # # clean remove files from the build directory # compile compile a source file into a libtool object # execute automatically set library path, then run a program # finish complete the installation of libtool libraries # install install libraries or executables # link create a library or an executable # uninstall remove libraries from an installed directory # # MODE-ARGS vary depending on the MODE. # Try `$progname --help --mode=MODE' for a more detailed description of MODE. # # When reporting a bug, please describe a test case to reproduce it and # include the following information: # # host-triplet: $host # shell: $SHELL # compiler: $LTCC # compiler flags: $LTCFLAGS # linker: $LD (gnu? $with_gnu_ld) # $progname: (GNU libtool) 2.2.6b Debian-2.2.6b-2ubuntu1 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . PROGRAM=ltmain.sh PACKAGE=libtool VERSION="2.2.6b Debian-2.2.6b-2ubuntu1" TIMESTAMP="" package_revision=1.3017 # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # NLS nuisances: We save the old values to restore during execute mode. # Only set LANG and LC_ALL to C if already set. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done $lt_unset CDPATH : ${CP="cp -f"} : ${ECHO="echo"} : ${EGREP="/bin/grep -E"} : ${FGREP="/bin/grep -F"} : ${GREP="/bin/grep"} : ${LN_S="ln -s"} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SED="/bin/sed"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # Generated shell functions inserted here. # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" # The name of this program: # In the unlikely event $progname began with a '-', it would play havoc with # func_echo (imagine progname=-n), so we prepend ./ in that case: func_dirname_and_basename "$progpath" progname=$func_basename_result case $progname in -*) progname=./$progname ;; esac # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=: for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to double_quote_subst, that '$' was protected from expansion. # Since each input `\' is now two `\'s, look for any number of runs of # four `\'s followed by two `\'s and then a '$'. `\' that '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname${mode+: }$mode: $*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname${mode+: }$mode: "${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname${mode+: }$mode: warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "X$my_directory_path" | $Xsed -e "$dirname"` done my_dir_list=`$ECHO "X$my_dir_list" | $Xsed -e 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_mkdir_p_IFS" # mkdir can fail with a `File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "X$my_tmpdir" | $Xsed } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "X$1" | $Xsed -e "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # func_quote_for_expand arg # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "X$1" | $Xsed \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_version # Echo version message to standard output and exit. func_version () { $SED -n '/^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $SED -n '/^# Usage:/,/# -h/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" $ECHO $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help # Echo long help message to standard output and exit. func_help () { $SED -n '/^# Usage:/,/# Report bugs to/ { s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(automake --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(autoconf --version) 2>/dev/null |$SED 1q`"'/ p }' < "$progpath" exit $? } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { func_error "missing argument for $1" exit_cmd=exit } exit_cmd=: # Check that we have a working $ECHO. if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t'; then # Yippee, $ECHO works! : else # Restart under the correct shell, and then maybe $ECHO will work. exec $SHELL "$progpath" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat </dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # Parse options once, thoroughly. This comes as soon as possible in # the script to make things like `libtool --version' happen quickly. { # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Parse non-mode specific arguments: while test "$#" -gt 0; do opt="$1" shift case $opt in --config) func_config ;; --debug) preserve_args="$preserve_args $opt" func_echo "enabling shell trace mode" opt_debug='set -x' $opt_debug ;; -dlopen) test "$#" -eq 0 && func_missing_arg "$opt" && break execute_dlfiles="$execute_dlfiles $1" shift ;; --dry-run | -n) opt_dry_run=: ;; --features) func_features ;; --finish) mode="finish" ;; --mode) test "$#" -eq 0 && func_missing_arg "$opt" && break case $1 in # Valid mode arguments: clean) ;; compile) ;; execute) ;; finish) ;; install) ;; link) ;; relink) ;; uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac mode="$1" shift ;; --preserve-dup-deps) opt_duplicate_deps=: ;; --quiet|--silent) preserve_args="$preserve_args $opt" opt_silent=: ;; --verbose| -v) preserve_args="$preserve_args $opt" opt_silent=false ;; --tag) test "$#" -eq 0 && func_missing_arg "$opt" && break preserve_args="$preserve_args $opt $1" func_enable_tag "$1" # tagname is set here shift ;; # Separate optargs to long options: -dlopen=*|--mode=*|--tag=*) func_opt_split "$opt" set dummy "$func_opt_split_opt" "$func_opt_split_arg" ${1+"$@"} shift ;; -\?|-h) func_usage ;; --help) opt_help=: ;; --version) func_version ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) nonopt="$opt" break ;; esac done case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_duplicate_deps ;; esac # Having warned about all mis-specified options, bail out if # anything was wrong. $exit_cmd $EXIT_FAILURE } # func_check_version_match # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } ## ----------- ## ## Main. ## ## ----------- ## $opt_help || { # Sanity checks first: func_check_version_match if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi test -z "$mode" && func_fatal_error "error: you must specify a MODE." # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$execute_dlfiles" && test "$mode" != execute; then func_error "unrecognized option \`-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$progname --help --mode=$mode' for more information." } # func_lalib_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if `file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case "$lalib_p_line" in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test "$lalib_p" = yes } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_ltwrapper_scriptname_result="" if func_ltwrapper_executable_p "$1"; then func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper" fi } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. func_source () { $opt_debug case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $opt_debug if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case "$@ " in " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with \`--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=${1} if test "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; then write_oldobj=\'${3}\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T <?"'"'"' &()|`$[]' \ && func_warning "libobj name \`$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname="$func_basename_result" xdir="$func_dirname_result" lobj=${xdir}$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$ECHO "X$srcfile" | $Xsed -e 's%^.*/%%' -e 's%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi removelist="$removelist $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist removelist="$removelist $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 if test -n "$fix_srcfile_path"; then eval srcfile=\"$fix_srcfile_path\" fi func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir command="$command -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; then command="$command -o $obj" fi # Suppress compiler output if we already did a PIC compilation. command="$command$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$mode" = compile && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to building PIC objects only -prefer-non-pic try to building non-PIC objects only -shared do not build a \`.o' file suitable for static linking -static only build a \`.o' file suitable for static linking COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode \`$mode'" ;; esac $ECHO $ECHO "Try \`$progname --help' for more information about other modes." exit $? } # Now that we've collected a possible --mode arg, show help if necessary $opt_help && func_mode_help # func_mode_execute arg... func_mode_execute () { $opt_debug # The first argument is the command name. cmd="$nonopt" test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $execute_dlfiles; do test -f "$file" \ || func_fatal_help "\`$file' is not a file" dir= case $file in *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "\`$file' was not linked with \`-export-dynamic'" continue fi func_dirname "$file" "" "." dir="$func_dirname_result" if test -f "$dir/$objdir/$dlname"; then dir="$dir/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir="$func_dirname_result" ;; *) func_warning "\`-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -*) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file="$progdir/$program" elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). func_quote_for_eval "$file" args="$args $func_quote_for_eval_result" done if test "X$opt_dry_run" = Xfalse; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" $ECHO "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS fi } test "$mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug libdirs="$nonopt" admincmds= if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for dir do libdirs="$libdirs $dir" done for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || admincmds="$admincmds $cmds" fi done fi # Exit here if they wanted silent mode. $opt_silent && exit $EXIT_SUCCESS $ECHO "X----------------------------------------------------------------------" | $Xsed $ECHO "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done $ECHO $ECHO "If you ever happen to want to link against installed libraries" $ECHO "in a given directory, LIBDIR, you must either use libtool, and" $ECHO "specify the full pathname of the library, or use the \`-LLIBDIR'" $ECHO "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then $ECHO " - add LIBDIR to the \`$shlibpath_var' environment variable" $ECHO " during execution" fi if test -n "$runpath_var"; then $ECHO " - add LIBDIR to the \`$runpath_var' environment variable" $ECHO " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then $ECHO " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi $ECHO $ECHO "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) $ECHO "more information, such as the ld(1), crle(1) and ld.so(8) manual" $ECHO "pages." ;; *) $ECHO "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac $ECHO "X----------------------------------------------------------------------" | $Xsed exit $EXIT_SUCCESS } test "$mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. $ECHO "X$nonopt" | $GREP shtool >/dev/null; then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" install_prog="$install_prog$func_quote_for_eval_result" # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= for arg do if test -n "$dest"; then files="$files $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) case " $install_prog " in *[\\\ /]cp\ *) ;; *) prev=$arg ;; esac ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" install_prog="$install_prog $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the \`$prev' option requires an argument" if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else func_dirname_and_basename "$dest" "" "." destdir="$func_dirname_result" destname="$func_basename_result" # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "\`$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "\`$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. staticlibs="$staticlibs $file" ;; *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) current_libdirs="$current_libdirs $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) future_libdirs="$future_libdirs $libdir" ;; esac fi func_dirname "$file" "/" "" dir="$func_dirname_result" dir="$dir$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "X$destdir" | $Xsed -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%%"` fi func_warning "relinking \`$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname="$1" shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. func_show_eval "$install_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme="$stripme" case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme="" ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib="$destdir/$realname" func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name="$func_basename_result" instname="$dir/$name"i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest="$destfile" destfile= ;; *) func_fatal_help "cannot copy a libtool object to \`$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script \`$wrapper'" finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile="$libdir/"`$ECHO "X$lib" | $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file="$func_basename_result" outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$ECHO "X$relink_command" | $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'` $opt_silent || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink \`$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file="$outputname" else func_warning "cannot relink \`$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "X$file$stripped_ext" | $Xsed -e "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name="$func_basename_result" # Set up the ranlib parameters. oldlib="$destdir/$name" func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run \`$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test "$mode" = install && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms="${my_outputname}S.c" else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${my_outputname}.nm" func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then func_verbose "generating symbol list for \`$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "X$objs$old_deplibs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` for progfile in $progfiles; do func_verbose "extracting global C symbols from \`$progfile'" $opt_dry_run || eval "$NM $progfile | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $opt_dry_run || { $RM $export_symbols eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from \`$dlprefile'" func_basename "$dlprefile" name="$func_basename_result" $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' eval "$NM $dlprefile 2>/dev/null | $global_symbol_pipe >> '$nlist'" } done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else $ECHO '/* NONE */' >> "$output_objdir/$my_dlsyms" fi $ECHO >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; " case $host in *cygwin* | *mingw* | *cegcc* ) $ECHO >> "$output_objdir/$my_dlsyms" "\ /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */" lt_dlsym_const= ;; *osf5*) echo >> "$output_objdir/$my_dlsyms" "\ /* This system does not cope well with relocations in const data */" lt_dlsym_const= ;; *) lt_dlsym_const=const ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ extern $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[]; $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) symtab_cflags="$symtab_cflags $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"' # Transform the symbol file into the correct name. symfileobj="$output_objdir/${my_outputname}S.$objext" case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for \`$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "X$compile_command" | $Xsed -e "s% @SYMFILE@%%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s% @SYMFILE@%%"` fi } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. func_win32_libid () { $opt_debug win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then win32_nmres=`eval $NM -f posix -A $1 | $SED -n -e ' 1,100{ / I /{ s,.*,import, p q } }'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_extract_an_archive dir oldlib func_extract_an_archive () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" 'exit $?' if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $opt_debug my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib="$func_basename_result" my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir="$my_gentop/$my_xlib_u" func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`basename "$darwin_archive"` darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}" $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # func_emit_wrapper_part1 [arg=no] # # Emit the first part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part1 () { func_emit_wrapper_part1_arg1=no if test -n "$1" ; then func_emit_wrapper_part1_arg1=$1 fi $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='${SED} -e 1s/^X//' sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then ECHO=\"$qecho\" file=\"\$0\" # Make sure echo works. if test \"X\$1\" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test \"X\`{ \$ECHO '\t'; } 2>/dev/null\`\" = 'X\t'; then # Yippee, \$ECHO works! : else # Restart under the correct shell, and then maybe \$ECHO will work. exec $SHELL \"\$0\" --no-reexec \${1+\"\$@\"} fi fi\ " $ECHO "\ # Find the directory that this script lives in. thisdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | ${SED} -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"X\$file\" | \$Xsed -e 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | ${SED} -n 's/.*-> //p'\` done " } # end: func_emit_wrapper_part1 # func_emit_wrapper_part2 [arg=no] # # Emit the second part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part2 () { func_emit_wrapper_part2_arg1=no if test -n "$1" ; then func_emit_wrapper_part2_arg1=$1 fi $ECHO "\ # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_part2_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"X\$thisdir\" | \$Xsed -e 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"X\$$shlibpath_var\" | \$Xsed -e 's/::*\$//'\` export $shlibpath_var " fi # fixup the dll searchpath if we need to. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 fi else # The program doesn't exist. \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 $ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # end: func_emit_wrapper_part2 # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory in which it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=no if test -n "$1" ; then func_emit_wrapper_arg1=$1 fi # split this up so that func_emit_cwrapperexe_src # can call each part independently. func_emit_wrapper_part1 "${func_emit_wrapper_arg1}" func_emit_wrapper_part2 "${func_emit_wrapper_arg1}" } # func_to_host_path arg # # Convert paths to host format when used with build tools. # Intended for use with "native" mingw (where libtool itself # is running under the msys shell), or in the following cross- # build environments: # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # where wine is equipped with the `winepath' executable. # In the native mingw case, the (msys) shell automatically # converts paths for any non-msys applications it launches, # but that facility isn't available from inside the cwrapper. # Similar accommodations are necessary for $host mingw and # $build cygwin. Calling this function does no harm for other # $host/$build combinations not listed above. # # ARG is the path (on $build) that should be converted to # the proper representation for $host. The result is stored # in $func_to_host_path_result. func_to_host_path () { func_to_host_path_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' case $build in *mingw* ) # actually, msys # awkward: cmd appends spaces to result lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_path_tmp1=`( cmd //c echo "$1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_path_tmp1=`cygpath -w "$1"` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # Unfortunately, winepath does not exit with a non-zero # error code, so we are forced to check the contents of # stdout. On the other hand, if the command is not # found, the shell will set an exit code of 127 and print # *an error message* to stdout. So we must check for both # error code of zero AND non-empty stdout, which explains # the odd construction: func_to_host_path_tmp1=`winepath -w "$1" 2>/dev/null` if test "$?" -eq 0 && test -n "${func_to_host_path_tmp1}"; then func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` else # Allow warning below. func_to_host_path_result="" fi ;; esac if test -z "$func_to_host_path_result" ; then func_error "Could not determine host path corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_path_result="$1" fi ;; esac fi } # end: func_to_host_path # func_to_host_pathlist arg # # Convert pathlists to host format when used with build tools. # See func_to_host_path(), above. This function supports the # following $build/$host combinations (but does no harm for # combinations not listed here): # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # # Path separators are also converted from $build format to # $host format. If ARG begins or ends with a path separator # character, it is preserved (but converted to $host format) # on output. # # ARG is a pathlist (on $build) that should be converted to # the proper representation on $host. The result is stored # in $func_to_host_pathlist_result. func_to_host_pathlist () { func_to_host_pathlist_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_to_host_pathlist_tmp2="$1" # Once set for this call, this variable should not be # reassigned. It is used in tha fallback case. func_to_host_pathlist_tmp1=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e 's|^:*||' -e 's|:*$||'` case $build in *mingw* ) # Actually, msys. # Awkward: cmd appends spaces to result. lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_pathlist_tmp2=`( cmd //c echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_pathlist_tmp2=`cygpath -w -p "$func_to_host_pathlist_tmp1"` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # unfortunately, winepath doesn't convert pathlists func_to_host_pathlist_result="" func_to_host_pathlist_oldIFS=$IFS IFS=: for func_to_host_pathlist_f in $func_to_host_pathlist_tmp1 ; do IFS=$func_to_host_pathlist_oldIFS if test -n "$func_to_host_pathlist_f" ; then func_to_host_path "$func_to_host_pathlist_f" if test -n "$func_to_host_path_result" ; then if test -z "$func_to_host_pathlist_result" ; then func_to_host_pathlist_result="$func_to_host_path_result" else func_to_host_pathlist_result="$func_to_host_pathlist_result;$func_to_host_path_result" fi fi fi IFS=: done IFS=$func_to_host_pathlist_oldIFS ;; esac if test -z "$func_to_host_pathlist_result" ; then func_error "Could not determine the host path(s) corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This may break if $1 contains DOS-style drive # specifications. The fix is not to complicate the expression # below, but for the user to provide a working wine installation # with winepath so that path translation in the cross-to-mingw # case works properly. lt_replace_pathsep_nix_to_dos="s|:|;|g" func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_replace_pathsep_nix_to_dos"` fi # Now, add the leading and trailing path separators back case "$1" in :* ) func_to_host_pathlist_result=";$func_to_host_pathlist_result" ;; esac case "$1" in *: ) func_to_host_pathlist_result="$func_to_host_pathlist_result;" ;; esac ;; esac fi } # end: func_to_host_pathlist # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include # define setmode _setmode #else # include # include # ifdef __CYGWIN__ # include # define HAVE_SETENV # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif # endif #endif #include #include #include #include #include #include #include #include #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif #ifdef _MSC_VER # define S_IXUSR _S_IEXEC # define stat _stat # ifndef _INTPTR_T_DEFINED # define intptr_t int # endif #endif #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifdef __CYGWIN__ # define FOPEN_WB "wb" #endif #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) #undef LTWRAPPER_DEBUGPRINTF #if defined DEBUGWRAPPER # define LTWRAPPER_DEBUGPRINTF(args) ltwrapper_debugprintf args static void ltwrapper_debugprintf (const char *fmt, ...) { va_list args; va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } #else # define LTWRAPPER_DEBUGPRINTF(args) #endif const char *program_name = NULL; void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_fatal (const char *message, ...); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_opt_process_env_set (const char *arg); void lt_opt_process_env_prepend (const char *arg); void lt_opt_process_env_append (const char *arg); int lt_split_name_value (const char *arg, char** name, char** value); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); static const char *script_text_part1 = EOF func_emit_wrapper_part1 yes | $SED -e 's/\([\\"]\)/\\\1/g' \ -e 's/^/ "/' -e 's/$/\\n"/' echo ";" cat <"))); for (i = 0; i < newargc; i++) { LTWRAPPER_DEBUGPRINTF (("(main) newargz[%d] : %s\n", i, (newargz[i] ? newargz[i] : ""))); } EOF case $host_os in mingw*) cat <<"EOF" /* execv doesn't actually work on mingw as expected on unix */ rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz); if (rval == -1) { /* failed to start process */ LTWRAPPER_DEBUGPRINTF (("(main) failed to launch target \"%s\": errno = %d\n", lt_argv_zero, errno)); return 127; } return rval; EOF ;; *) cat <<"EOF" execv (lt_argv_zero, newargz); return rval; /* =127, but avoids unused variable warning */ EOF ;; esac cat <<"EOF" } void * xmalloc (size_t num) { void *p = (void *) malloc (num); if (!p) lt_fatal ("Memory exhausted"); return p; } char * xstrdup (const char *string) { return string ? strcpy ((char *) xmalloc (strlen (string) + 1), string) : NULL; } const char * base_name (const char *name) { const char *base; #if defined (HAVE_DOS_BASED_FILE_SYSTEM) /* Skip over the disk name in MSDOS pathnames. */ if (isalpha ((unsigned char) name[0]) && name[1] == ':') name += 2; #endif for (base = name; *name; name++) if (IS_DIR_SEPARATOR (*name)) base = name + 1; return base; } int check_executable (const char *path) { struct stat st; LTWRAPPER_DEBUGPRINTF (("(check_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if ((stat (path, &st) >= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; LTWRAPPER_DEBUGPRINTF (("(make_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char *concat_name; LTWRAPPER_DEBUGPRINTF (("(find_executable) : %s\n", wrapper ? (*wrapper ? wrapper : "EMPTY!") : "NULL!")); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { LTWRAPPER_DEBUGPRINTF (("checking path component for symlinks: %s\n", tmp_pathspec)); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { char *errstr = strerror (errno); lt_fatal ("Error accessing file %s (%s)", tmp_pathspec, errstr); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal ("Could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (strcmp (str, pat) == 0) *str = '\0'; } return str; } static void lt_error_core (int exit_status, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s: %s: ", program_name, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, "FATAL", message, ap); va_end (ap); } void lt_setenv (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_setenv) setting '%s' to '%s'\n", (name ? name : ""), (value ? value : ""))); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else int len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { int orig_value_len = strlen (orig_value); int add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } int lt_split_name_value (const char *arg, char** name, char** value) { const char *p; int len; if (!arg || !*arg) return 1; p = strchr (arg, (int)'='); if (!p) return 1; *value = xstrdup (++p); len = strlen (arg) - strlen (*value); *name = XMALLOC (char, len); strncpy (*name, arg, len-1); (*name)[len - 1] = '\0'; return 0; } void lt_opt_process_env_set (const char *arg) { char *name = NULL; char *value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_set_opt, arg); } lt_setenv (name, value); XFREE (name); XFREE (value); } void lt_opt_process_env_prepend (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_prepend_opt, arg); } new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_opt_process_env_append (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_append_opt, arg); } new_value = lt_extend_str (getenv (name), value, 1); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_update_exe_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_exe_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_lib_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF } # end: func_emit_cwrapperexe_src # func_mode_link arg... func_mode_link () { $opt_debug case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # which system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll which has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=no prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module="${wl}-single_module" func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then dlfiles="$dlfiles $arg" else dlprefiles="$dlprefiles $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" test -f "$arg" \ || func_fatal_error "symbol file \`$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) deplibs="$deplibs $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # moreargs="$moreargs $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file \`$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) rpath="$rpath $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) xrpath="$xrpath $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds="$arg" prev= continue ;; weak) weak_libs="$weak_libs $arg" prev= continue ;; xcclinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "\`-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname '-L' '' "$arg" dir=$func_stripname_result if test -z "$dir"; then if test "$#" -gt 0; then func_fatal_error "require no space between \`-L' and \`$1'" else func_fatal_error "need path for \`-L' option" fi fi # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of \`$dir'" dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "*) ;; *) deplibs="$deplibs -L$dir" lib_search_path="$lib_search_path $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "X$dir" | $Xsed -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) dllsearchpath="$dllsearchpath:$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework deplibs="$deplibs System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi deplibs="$deplibs $arg" continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $arg" ;; esac continue ;; -multi_module) single_module="${wl}-multi_module" continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "\`-no-install' is ignored for $host" func_warning "assuming \`-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $wl$func_quote_for_eval_result" linker_flags="$linker_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; # -64, -mips[0-9] enable 64-bit mode on the SGI compiler # -r[0-9][0-9]* specifies the processor on the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode on the Sun compiler # +DA*, +DD* enable 64-bit mode on the HP compiler # -q* pass through compiler args for the IBM compiler # -m*, -t[45]*, -txscale* pass through architecture-specific # compiler args for GCC # -F/path gives path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* pass through profiling flag for GCC # @file GCC response files -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" func_append compile_command " $arg" func_append finalize_command " $arg" compiler_flags="$compiler_flags $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; *.$objext) # A standard object. objs="$objs $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. deplibs="$deplibs $arg" old_deplibs="$old_deplibs $arg" continue ;; *.la) # A libtool-controlled library. if test "$prev" = dlfiles; then # This library was specified with -dlopen. dlfiles="$dlfiles $arg" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. dlprefiles="$dlprefiles $arg" prev= else deplibs="$deplibs $arg" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the \`$prevarg' option requires an argument" if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname="$func_basename_result" libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"X\${$shlibpath_var}\" \| \$Xsed -e \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir="$func_dirname_result$objdir" # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_duplicate_deps ; then case "$libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi libs="$libs $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) specialdeplibs="$specialdeplibs $pre_post_deps" ;; esac pre_post_deps="$pre_post_deps $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test "$linkmode,$pass" = "lib,link"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs="$tmp_deplibs" fi if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= case $lib in *.la) func_source "$lib" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do deplib_base=`$ECHO "X$deplib" | $Xsed -e "$basename"` case " $weak_libs " in *" $deplib_base "*) ;; *) deplibs="$deplibs $deplib" ;; esac done done libs="$dlprefiles" fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else compiler_flags="$compiler_flags $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; *) func_warning "\`-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then func_stripname '-R' '' "$deplib" dir=$func_stripname_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) lib="$deplib" ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"X$deplib\"" 2>/dev/null | $Xsed -e 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then $ECHO $ECHO "*** Warning: Trying to link with static lib archive $deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because the file extensions .$libext of this argument makes me believe" $ECHO "*** that it is just a static archive that I should not use here." else $ECHO $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. newdlprefiles="$newdlprefiles $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else newdlfiles="$newdlfiles $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "\`$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir="$func_dirname_result" dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "X$inherited_linker_flags" | $Xsed -e 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) new_inherited_linker_flags="$new_inherited_linker_flags $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO "X $dependency_libs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && dlfiles="$dlfiles $dlopen" test -n "$dlpreopen" && dlprefiles="$dlprefiles $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # It is a libtool convenience library, so add in its objects. convenience="$convenience $ladir/$objdir/$old_library" old_convenience="$old_convenience $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= for l in $old_library $library_names; do linklib="$l" done if test -z "$linklib"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. dlprefiles="$dlprefiles $lib $dependency_libs" else newdlfiles="$newdlfiles $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of \`$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir="$ladir" fi ;; esac func_basename "$lib" laname="$func_basename_result" # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library \`$lib' was moved." dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$libdir" absdir="$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; then func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'" fi # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then newdlprefiles="$newdlprefiles $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ dlpreconveniencelibs="$dlpreconveniencelibs $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then newdlprefiles="$newdlprefiles $dir/$dlname" else newdlprefiles="$newdlprefiles $dir/$linklib" fi fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then newlib_search_path="$newlib_search_path $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath:" in *"$absdir:"*) ;; *) temp_rpath="$temp_rpath$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded notinst_deplibs="$notinst_deplibs $lib" need_relink=no ;; *) if test "$installed" = no; then notinst_deplibs="$notinst_deplibs $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule="" for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule="$dlpremoduletest" break fi done if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then $ECHO if test "$linkmode" = prog; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname="$1" shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" func_basename "$soroot" soname="$func_basename_result" func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from \`$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for \`$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we can not # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null ; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library" ; then $ECHO $ECHO "*** And there doesn't seem to be a static archive available" $ECHO "*** The link will probably fail, sorry" else add="$dir/$old_library" fi elif test -n "$old_library"; then add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$dir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) compile_shlibpath="$compile_shlibpath$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. $ECHO $ECHO "*** Warning: This system can not link to static lib archive $lib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then $ECHO "*** But as you try to build a module library, libtool will still create " $ECHO "*** a static module, that should work as long as the dlopening application" $ECHO "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) xrpath="$xrpath $temp_xrpath";; esac;; *) temp_deplibs="$temp_deplibs $libdir";; esac done dependency_libs="$temp_deplibs" fi newlib_search_path="$newlib_search_path $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path="$deplib" ;; *.la) func_dirname "$deplib" "" "." dir="$func_dirname_result" # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of \`$dir'" absdir="$dir" fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl" ; then depdepl="$absdir/$objdir/$depdepl" darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`${OTOOL64} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi compiler_flags="$compiler_flags ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}" linker_flags="$linker_flags -dylib_file ${darwin_install_name}:${depdepl}" path= fi fi ;; *) path="-L$absdir/$objdir" ;; esac else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "\`$deplib' seems to be moved" path="-L$absdir" fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test "$pass" = link; then if test "$linkmode" = "prog"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) lib_search_path="$lib_search_path $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) tmp_libs="$tmp_libs $deplib" ;; esac ;; *) tmp_libs="$tmp_libs $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then tmp_libs="$tmp_libs $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "\`-R' is ignored for archives" test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "\`-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "\`-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" objs="$objs$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs" else $ECHO $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" libobjs="$libobjs $objs" fi fi test "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "\`-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 shift IFS="$save_ifs" test -n "$7" && \ func_fatal_help "too many parameters to \`-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$1" number_minor="$2" number_revision="$3" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_minor" lt_irix_increment=no ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; esac ;; no) current="$1" revision="$2" age="$3" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT \`$current' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION \`$revision' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE \`$age' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE \`$age' is greater than the current interface number \`$current'" func_fatal_error "\`$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring:${iface}.0" done # Make executables depend on our current version. verstring="$verstring:${current}.0" ;; qnx) major=".$current" versuffix=".$current" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; *) func_fatal_configuration "unknown library version type \`$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" libobjs="$libobjs $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi removelist="$removelist $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then oldlibs="$oldlibs $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}'$/d' -e "$lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "X$lib_search_path " | $Xsed -e "s% $path % %g"` # deplibs=`$ECHO "X$deplibs " | $Xsed -e "s% -L$path % %g"` # dependency_libs=`$ECHO "X$dependency_libs " | $Xsed -e "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do temp_xrpath="$temp_xrpath -R$libdir" case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) dlfiles="$dlfiles $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) dlprefiles="$dlprefiles $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework deplibs="$deplibs System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then deplibs="$deplibs -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$ECHO "X$potlib" | $Xsed -e 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) newdeplibs="$newdeplibs $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval "\$ECHO \"X$potent_lib\"" 2>/dev/null | $Xsed -e 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$ECHO "X $deplibs" | $Xsed \ -e 's/ -lc$//' -e 's/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO "X $tmp_deplibs" | $Xsed -e "s,$i,,"` done fi if $ECHO "X $tmp_deplibs" | $Xsed -e 's/[ ]//g' | $GREP . >/dev/null; then $ECHO if test "X$deplibs_check_method" = "Xnone"; then $ECHO "*** Warning: inter-library dependencies are not supported in this platform." else $ECHO "*** Warning: inter-library dependencies are not known to be supported." fi $ECHO "*** All declared inter-library dependencies are being dropped." droppeddeps=yes fi ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then $ECHO $ECHO "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" $ECHO "*** a static module, that should work as long as the dlopening" $ECHO "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else $ECHO "*** The inter-library dependencies that have been dropped here will be" $ECHO "*** automatically added whenever a program is linked with this library" $ECHO "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then $ECHO $ECHO "*** Since this library must not contain undefined symbols," $ECHO "*** because either the platform does not support them or" $ECHO "*** it was explicitly requested with -no-undefined," $ECHO "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO "X $deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" dep_rpath="$dep_rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" if test -n "$hardcode_libdir_flag_spec_ld"; then eval dep_rpath=\"$hardcode_libdir_flag_spec_ld\" else eval dep_rpath=\"$hardcode_libdir_flag_spec\" fi fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname="$1" shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do linknames="$linknames $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "X$libobjs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols="$output_objdir/$libname.uexp" delfiles="$delfiles $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols="$export_symbols" export_symbols= always_export_symbols=yes fi fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" func_len " $cmd" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then func_show_eval "$cmd" 'exit $?' skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) tmp_deplibs="$tmp_deplibs $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test "$compiler_needs_object" = yes && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $convenience libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" linker_flags="$linker_flags $flag" fi # Make a backup of the uninstalled library when relinking if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output output_la=`$ECHO "X$output" | $Xsed -e "$basename"` # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then output=${output_objdir}/${output_la}.lnkscript func_verbose "creating GNU ld script: $output" $ECHO 'INPUT (' > $output for obj in $save_libobjs do $ECHO "$obj" >> $output done $ECHO ')' >> $output delfiles="$delfiles $output" elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; then firstobj="$1 " shift fi for obj do $ECHO "$obj" >> $output done delfiles="$delfiles $output" output=$firstobj\"$file_list_spec$output\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-${k}.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test "X$objlist" = X || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. eval concat_cmds=\"$reload_cmds $objlist $last_robj\" else # All subsequent reloadable object files will link in # the last one created. eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-${k}.$objext objlist=$obj func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$reload_cmds $objlist $last_robj\" if test -n "$last_robj"; then eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\" fi delfiles="$delfiles $output" else output= fi if ${skipped_export-false}; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi fi test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi if ${skipped_export-false}; then if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi fi libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "\`-R' is ignored for objects" test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for objects" test -n "$release" && \ func_warning "\`-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object \`$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "X$tmp_whole_archive_flags" | $Xsed -e 's|,| |g'` else gentop="$output_objdir/${obj}x" generated="$generated $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # Create the old-style object. reload_objs="$objs$old_deplibs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}$'/d' -e '/\.lib$/d' -e "$lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for programs" test -n "$release" && \ func_warning "\`-release' is ignored for programs" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test "$tagname" = CXX ; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) compile_command="$compile_command ${wl}-bind_at_load" finalize_command="$finalize_command ${wl}-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done compile_deplibs="$new_libs" compile_command="$compile_command $compile_deplibs" finalize_command="$finalize_command $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) dllsearchpath="$dllsearchpath:$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) finalize_perm_rpath="$finalize_perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$ECHO "X$compile_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` finalize_command=`$ECHO "X$finalize_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *cegcc) # Disable wrappers for cegcc, we are cross compiling anyway. wrappers_required=no ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # Replace the output file specification. compile_command=`$ECHO "X$compile_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' # Delete the generated files. if test -f "$output_objdir/${outputname}S.${objext}"; then func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"' fi exit $exit_status fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do rpath="$rpath$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" func_warning "this platform does not like uninstalled shared libraries" func_warning "\`$output' will be relinked during installation" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "X$compile_var$compile_command$compile_rpath" | $Xsed -e 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` fi # Quote $ECHO for shipping. if test "X$ECHO" = "X$SHELL $progpath --fallback-echo"; then case $progpath in [\\/]* | [A-Za-z]:[\\/]*) qecho="$SHELL $progpath --fallback-echo";; *) qecho="$SHELL `pwd`/$progpath --fallback-echo";; esac qecho=`$ECHO "X$qecho" | $Xsed -e "$sed_quote_subst"` else qecho=`$ECHO "X$ECHO" | $Xsed -e "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host" ; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then oldobjs="$oldobjs $symfileobj" fi fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $addlibs oldobjs="$oldobjs $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles oldobjs="$oldobjs $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else $ECHO "copying selected object files to avoid basename conflicts..." gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase="$func_basename_result" case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" oldobjs="$oldobjs $gentop/$newobj" ;; *) oldobjs="$oldobjs $obj" ;; esac done fi eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" newdependency_libs="$newdependency_libs $libdir/$name" ;; *) newdependency_libs="$newdependency_libs $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlfiles="$newdlfiles $libdir/$name" ;; *) newdlfiles="$newdlfiles $lib" ;; esac done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlprefiles="$newdlprefiles $libdir/$name" ;; esac done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlfiles="$newdlfiles $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlprefiles="$newdlprefiles $abs" done dlprefiles="$newdlprefiles" fi $RM $output # place dlname in correct position for cygwin tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) tdlname=../bin/$dlname ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that can not go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } { test "$mode" = link || test "$mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) RM="$RM $arg"; rmforce=yes ;; -*) RM="$RM $arg" ;; *) files="$files $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= origobjdir="$objdir" for file in $files; do func_dirname "$file" "" "." dir="$func_dirname_result" if test "X$dir" = X.; then objdir="$origobjdir" else objdir="$dir/$origobjdir" fi func_basename "$file" name="$func_basename_result" test "$mode" = uninstall && objdir="$dir" # Remember objdir for removal later, being careful to avoid duplicates if test "$mode" = clean; then case " $rmdirs " in *" $objdir "*) ;; *) rmdirs="$rmdirs $objdir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do rmfiles="$rmfiles $objdir/$n" done test -n "$old_library" && rmfiles="$rmfiles $objdir/$old_library" case "$mode" in clean) case " $library_names " in # " " in the beginning catches empty $dlname *" $dlname "*) ;; *) rmfiles="$rmfiles $objdir/$dlname" ;; esac test -n "$libdir" && rmfiles="$rmfiles $objdir/$name $objdir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test "$pic_object" != none; then rmfiles="$rmfiles $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test "$non_pic_object" != none; then rmfiles="$rmfiles $dir/$non_pic_object" fi fi ;; *) if test "$mode" = clean ; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe rmfiles="$rmfiles $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result rmfiles="$rmfiles $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles rmfiles="$rmfiles $objdir/$name $objdir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then rmfiles="$rmfiles $objdir/lt-$name" fi if test "X$noexename" != "X$name" ; then rmfiles="$rmfiles $objdir/lt-${noexename}.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done objdir="$origobjdir" # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } { test "$mode" = uninstall || test "$mode" = clean; } && func_mode_uninstall ${1+"$@"} test -z "$mode" && { help="$generic_help" func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode \`$mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: # vi:sw=2 synergy-1.4.12-Source/tools/gmock-1.6.0/build-aux/missing0000600000175000017500000002623311561126632022706 0ustar synergysynergy#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2009-04-28.21; # UTC # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006, # 2008, 2009 Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # 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, 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 . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and \`g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # normalize program name to check for. program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). This is about non-GNU programs, so use $1 not # $program. case $1 in lex*|yacc*) # Not GNU programs, they don't have --version. ;; tar*) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $program in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te*) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison*|yacc*) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex*|flex*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit $? fi ;; makeinfo*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar*) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case $firstarg in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case $firstarg in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gmock-1.6.0/CHANGES0000600000175000017500000000751411561126632020414 0ustar synergysynergyChanges for 1.6.0: * Compilation is much faster and uses much less memory, especially when the constructor and destructor of a mock class are moved out of the class body. * New matchers: Pointwise(), Each(). * New actions: ReturnPointee() and ReturnRefOfCopy(). * CMake support. * Project files for Visual Studio 2010. * AllOf() and AnyOf() can handle up-to 10 arguments now. * Google Mock doctor understands Clang error messages now. * SetArgPointee<> now accepts string literals. * gmock_gen.py handles storage specifier macros and template return types now. * Compatibility fixes. * Bug fixes and implementation clean-ups. * Potentially incompatible changes: disables the harmful 'make install' command in autotools. Potentially breaking changes: * The description string for MATCHER*() changes from Python-style interpolation to an ordinary C++ string expression. * SetArgumentPointee is deprecated in favor of SetArgPointee. * Some non-essential project files for Visual Studio 2005 are removed. Changes for 1.5.0: * New feature: Google Mock can be safely used in multi-threaded tests on platforms having pthreads. * New feature: function for printing a value of arbitrary type. * New feature: function ExplainMatchResult() for easy definition of composite matchers. * The new matcher API lets user-defined matchers generate custom explanations more directly and efficiently. * Better failure messages all around. * NotNull() and IsNull() now work with smart pointers. * Field() and Property() now work when the matcher argument is a pointer passed by reference. * Regular expression matchers on all platforms. * Added GCC 4.0 support for Google Mock Doctor. * Added gmock_all_test.cc for compiling most Google Mock tests in a single file. * Significantly cleaned up compiler warnings. * Bug fixes, better test coverage, and implementation clean-ups. Potentially breaking changes: * Custom matchers defined using MatcherInterface or MakePolymorphicMatcher() need to be updated after upgrading to Google Mock 1.5.0; matchers defined using MATCHER or MATCHER_P* aren't affected. * Dropped support for 'make install'. Changes for 1.4.0 (we skipped 1.2.* and 1.3.* to match the version of Google Test): * Works in more environments: Symbian and minGW, Visual C++ 7.1. * Lighter weight: comes with our own implementation of TR1 tuple (no more dependency on Boost!). * New feature: --gmock_catch_leaked_mocks for detecting leaked mocks. * New feature: ACTION_TEMPLATE for defining templatized actions. * New feature: the .After() clause for specifying expectation order. * New feature: the .With() clause for for specifying inter-argument constraints. * New feature: actions ReturnArg(), ReturnNew(...), and DeleteArg(). * New feature: matchers Key(), Pair(), Args<...>(), AllArgs(), IsNull(), and Contains(). * New feature: utility class MockFunction, useful for checkpoints, etc. * New feature: functions Value(x, m) and SafeMatcherCast(m). * New feature: copying a mock object is rejected at compile time. * New feature: a script for fusing all Google Mock and Google Test source files for easy deployment. * Improved the Google Mock doctor to diagnose more diseases. * Improved the Google Mock generator script. * Compatibility fixes for Mac OS X and gcc. * Bug fixes and implementation clean-ups. Changes for 1.1.0: * New feature: ability to use Google Mock with any testing framework. * New feature: macros for easily defining new matchers * New feature: macros for easily defining new actions. * New feature: more container matchers. * New feature: actions for accessing function arguments and throwing exceptions. * Improved the Google Mock doctor script for diagnosing compiler errors. * Bug fixes and implementation clean-ups. Changes for 1.0.0: * Initial Open Source release of Google Mock synergy-1.4.12-Source/tools/gmock-1.6.0/CMakeLists.txt0000600000175000017500000001332411561126632022155 0ustar synergysynergy######################################################################## # CMake build script for Google Mock. # # To run the tests for Google Mock itself on Linux, use 'make test' or # ctest. You can select which tests to run using 'ctest -R regex'. # For more options, run 'ctest --help'. # BUILD_SHARED_LIBS is a standard CMake variable, but we declare it here to # make it prominent in the GUI. option(BUILD_SHARED_LIBS "Build shared libraries (DLLs)." OFF) # Forces BUILD_SHARED_LIBS to OFF as Google Mock currently does not support # working in a DLL. # TODO(vladl@google.com): Implement building gMock as a DLL. set(BUILD_SHARED_LIBS OFF) option(gmock_build_tests "Build all of Google Mock's own tests." OFF) # A directory to find Google Test sources. if (EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/gtest/CMakeLists.txt") set(gtest_dir gtest) else() set(gtest_dir ../gtest) endif() # Defines pre_project_set_up_hermetic_build() and set_up_hermetic_build(). include("${gtest_dir}/cmake/hermetic_build.cmake" OPTIONAL) if (COMMAND pre_project_set_up_hermetic_build) # Google Test also calls hermetic setup functions from add_subdirectory, # although its changes will not affect things at the current scope. pre_project_set_up_hermetic_build() endif() ######################################################################## # # Project-wide settings # Name of the project. # # CMake files in this project can refer to the root source directory # as ${gmock_SOURCE_DIR} and to the root binary directory as # ${gmock_BINARY_DIR}. # Language "C" is required for find_package(Threads). project(gmock CXX C) cmake_minimum_required(VERSION 2.6.2) if (COMMAND set_up_hermetic_build) set_up_hermetic_build() endif() # Instructs CMake to process Google Test's CMakeLists.txt and add its # targets to the current scope. We are placing Google Test's binary # directory in a subdirectory of our own as VC compilation may break # if they are the same (the default). add_subdirectory("${gtest_dir}" "${gmock_BINARY_DIR}/gtest") # Although Google Test's CMakeLists.txt calls this function, the # changes there don't affect the current scope. Therefore we have to # call it again here. config_compiler_and_linker() # from ${gtest_dir}/cmake/internal_utils.cmake # Adds Google Mock's and Google Test's header directories to the search path. include_directories("${gmock_SOURCE_DIR}/include" "${gmock_SOURCE_DIR}" "${gtest_SOURCE_DIR}/include" # This directory is needed to build directly from Google # Test sources. "${gtest_SOURCE_DIR}") ######################################################################## # # Defines the gmock & gmock_main libraries. User tests should link # with one of them. # Google Mock libraries. We build them using more strict warnings than what # are used for other targets, to ensure that Google Mock can be compiled by # a user aggressive about warnings. cxx_library(gmock "${cxx_strict}" src/gmock-all.cc) target_link_libraries(gmock gtest) cxx_library(gmock_main "${cxx_strict}" src/gmock_main.cc) target_link_libraries(gmock_main gmock) ######################################################################## # # Google Mock's own tests. # # You can skip this section if you aren't interested in testing # Google Mock itself. # # The tests are not built by default. To build them, set the # gmock_build_tests option to ON. You can do it by running ccmake # or specifying the -Dgmock_build_tests=ON flag when running cmake. if (gmock_build_tests) # This must be set in the root directory for the tests to be run by # 'make test' or ctest. enable_testing() ############################################################ # C++ tests built with standard compiler flags. cxx_test(gmock-actions_test gmock_main) cxx_test(gmock-cardinalities_test gmock_main) cxx_test(gmock-generated-actions_test gmock_main) cxx_test(gmock-generated-function-mockers_test gmock_main) cxx_test(gmock-generated-internal-utils_test gmock_main) cxx_test(gmock-generated-matchers_test gmock_main) cxx_test(gmock-internal-utils_test gmock_main) cxx_test(gmock-matchers_test gmock_main) cxx_test(gmock-more-actions_test gmock_main) cxx_test(gmock-nice-strict_test gmock_main) cxx_test(gmock-port_test gmock_main) cxx_test(gmock-spec-builders_test gmock_main) cxx_test(gmock_link_test gmock_main test/gmock_link2_test.cc) # cxx_test(gmock_stress_test gmock) cxx_test(gmock_test gmock_main) # gmock_all_test is commented to save time building and running tests. # Uncomment if necessary. # cxx_test(gmock_all_test gmock_main) ############################################################ # C++ tests built with non-standard compiler flags. cxx_library(gmock_main_no_exception "${cxx_no_exception}" "${gtest_dir}/src/gtest-all.cc" src/gmock-all.cc src/gmock_main.cc) cxx_library(gmock_main_no_rtti "${cxx_no_rtti}" "${gtest_dir}/src/gtest-all.cc" src/gmock-all.cc src/gmock_main.cc) cxx_library(gmock_main_use_own_tuple "${cxx_use_own_tuple}" "${gtest_dir}/src/gtest-all.cc" src/gmock-all.cc src/gmock_main.cc) cxx_test_with_flags(gmock-more-actions_no_exception_test "${cxx_no_exception}" gmock_main_no_exception test/gmock-more-actions_test.cc) cxx_test_with_flags(gmock_no_rtti_test "${cxx_no_rtti}" gmock_main_no_rtti test/gmock-spec-builders_test.cc) cxx_test_with_flags(gmock_use_own_tuple_test "${cxx_use_own_tuple}" gmock_main_use_own_tuple test/gmock-spec-builders_test.cc) ############################################################ # Python tests. cxx_executable(gmock_leak_test_ test gmock_main) py_test(gmock_leak_test) cxx_executable(gmock_output_test_ test gmock) py_test(gmock_output_test) endif() synergy-1.4.12-Source/tools/gmock-1.6.0/configure0000600000175000017500000205747411561126632021341 0ustar synergysynergy#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.65 for Google C++ Mocking Framework 1.6.0. # # Report bugs to . # # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV export CONFIG_SHELL exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"} fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org and $0: googlemock@googlegroups.com about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\$\\$0,'$0','` ;; esac ECHO=${lt_ECHO-echo} if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "$0" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF $* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "$0"' 'sed 20q "$0"' 'sed 10q "$0"' 'sed 2q "$0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "$0" --no-reexec ${1+"$@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL $0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL $0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "$0"' 'sed 10q "$0"' 'sed 20q "$0"' 'sed 50q "$0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "$0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "$0" ${1+"$@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL $0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\$0 --fallback-echo" fi test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='Google C++ Mocking Framework' PACKAGE_TARNAME='gmock' PACKAGE_VERSION='1.6.0' PACKAGE_STRING='Google C++ Mocking Framework 1.6.0' PACKAGE_BUGREPORT='googlemock@googlegroups.com' PACKAGE_URL='' ac_unique_file="./COPYING" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" enable_option_checking=no ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS LIBOBJS subdirs GTEST_VERSION GTEST_LIBS GTEST_LDFLAGS GTEST_CXXFLAGS GTEST_CPPFLAGS GTEST_CONFIG HAVE_PTHREADS_FALSE HAVE_PTHREADS_TRUE PTHREAD_CFLAGS PTHREAD_LIBS PTHREAD_CC acx_pthread_config HAVE_PYTHON_FALSE HAVE_PYTHON_TRUE PYTHON CXXCPP CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL lt_ECHO RANLIB AR OBJDUMP LN_S NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL am__fastdepCXX_FALSE am__fastdepCXX_TRUE CXXDEPMODE ac_ct_CXX CXXFLAGS CXX am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld enable_libtool_lock with_pthreads with_gtest enable_external_gtest ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CXX CXXFLAGS CCC CPP CXXCPP GTEST_CONFIG GTEST_CPPFLAGS GTEST_CXXFLAGS GTEST_LDFLAGS GTEST_LIBS GTEST_VERSION' ac_subdirs_all='gtest' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error "unrecognized option: \`$ac_option' Try \`$0 --help' for more information." ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe $as_echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures Google C++ Mocking Framework 1.6.0 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/gmock] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of Google C++ Mocking Framework 1.6.0:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --disable-external-gtest Disables any detection or use of a system installed or user provided gtest. Any option to '--with-gtest' is ignored. (Default is enabled.) Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-pthreads use pthreads (default is yes) --with-gtest Specifies how to find the gtest package. If no arguments are given, the default behavior, a system installed gtest will be used if present, and an internal version built otherwise. If a path is provided, the gtest built or installed at that prefix will be used. Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CXX C++ compiler command CXXFLAGS C++ compiler flags CPP C preprocessor CXXCPP C++ preprocessor GTEST_CONFIG The exact path of Google Test's 'gtest-config' script. GTEST_CPPFLAGS C-like preprocessor flags for Google Test. GTEST_CXXFLAGS C++ compile flags for Google Test. GTEST_LDFLAGS Linker path and option flags for Google Test. GTEST_LIBS Library linking flags for Google Test. GTEST_VERSION The version of Google Test available. Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF Google C++ Mocking Framework configure 1.6.0 generated by GNU Autoconf 2.65 Copyright (C) 2009 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_cxx_try_compile LINENO # ---------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_header_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_func # ac_fn_cxx_try_cpp LINENO # ------------------------ # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } >/dev/null && { test -z "$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_cpp # ac_fn_cxx_try_link LINENO # ------------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_link cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by Google C++ Mocking Framework $as_me 1.6.0, which was generated by GNU Autoconf 2.65. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------------- ## ## File substitutions. ## ## ------------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then ac_site_file1=$CONFIG_SITE elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Provide various options to initialize the Autoconf and configure processes. ac_aux_dir= for ac_dir in build-aux "$srcdir"/build-aux; do for ac_t in install-sh install.sh shtool; do if test -f "$ac_dir/$ac_t"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/$ac_t -c" break 2 fi done done if test -z "$ac_aux_dir"; then as_fn_error "cannot find install-sh, install.sh, or shtool in build-aux \"$srcdir\"/build-aux" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. ac_config_headers="$ac_config_headers build-aux/config.h" ac_config_files="$ac_config_files Makefile" ac_config_files="$ac_config_files scripts/gmock-config" # Initialize Automake with various options. We require at least v1.9, prevent # pedantic complaints about package files, and enable various distribution # targets. am__api_version='1.11' # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi test "$2" = conftest.file ) then # Ok. : else as_fn_error "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if test "${ac_cv_path_mkdir+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AWK+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='gmock' VERSION='1.6.0' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' # Check for programs used in building Google Test. ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "no acceptable C compiler found in \$PATH See \`config.log' for more details." "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "C compiler cannot create executables See \`config.log' for more details." "$LINENO" 5; }; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if test "${ac_cv_objext+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of object files: cannot compile See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if test "${ac_cv_c_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if test "${ac_cv_prog_cc_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if test "${ac_cv_prog_cc_c89+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if test "${ac_cv_cxx_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if test "${ac_cv_prog_cxx_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.2.6b' macro_revision='1.3017' ltmain="$ac_aux_dir/ltmain.sh" # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if test "${ac_cv_build+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if test "${ac_cv_host+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if test "${ac_cv_path_SED+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if test "${ac_cv_path_GREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if test "${ac_cv_path_EGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if test "${ac_cv_path_FGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if test "${lt_cv_path_LD+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if test "${lt_cv_prog_gnu_ld+set}" = set; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if test "${lt_cv_path_NM+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$ac_tool_prefix"; then for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if test "${lt_cv_nm_interface+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:4961: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:4964: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:4967: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if test "${lt_cv_sys_max_cmd_len+set}" = set; then : $as_echo_n "(cached) " >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL $0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if test "${lt_cv_ld_reload_flag+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if test "${lt_cv_deplibs_check_method+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. if ( file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9].[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ar", so it can be a program name with args. set dummy ${ac_tool_prefix}ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AR="${ac_tool_prefix}ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_AR"; then ac_ct_AR=$AR # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_AR="ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi else AR="$ac_cv_prog_AR" fi test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if test "${lt_cv_sys_global_symbol_pipe+set}" = set; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line 6173 "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if test "${lt_cv_cc_needs_belf+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if test "${lt_cv_apple_cc_single_mod+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if test "${lt_cv_ld_exported_symbols_list+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if test "${ac_cv_header_stdc+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " eval as_val=\$$as_ac_Header if test "x$as_val" = x""yes; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = x""yes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if test "${ac_cv_cxx_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if test "${ac_cv_prog_cxx_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5 $as_echo_n "checking how to run the C++ preprocessor... " >&6; } if test -z "$CXXCPP"; then if test "${ac_cv_prog_CXXCPP+set}" = set; then : $as_echo_n "(cached) " >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5 $as_echo "$CXXCPP" >&6; } ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} _lt_caught_CXX_error=yes; } fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu else _lt_caught_CXX_error=yes fi # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; pic_mode="$withval" else pic_mode=default fi test -z "$pic_mode" && pic_mode=default # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if test "${lt_cv_objdir+set}" = set; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC="$CC" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag=' -fno-builtin' { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8226: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8230: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_prog_compiler_pic" >&5 $as_echo "$lt_prog_compiler_pic" >&6; } # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if test "${lt_cv_prog_compiler_pic_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8565: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8569: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test x"$lt_cv_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if test "${lt_cv_prog_compiler_static_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test x"$lt_cv_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8670: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:8674: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8725: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:8729: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) link_all_deplibs=no ;; esac ld_shlibs=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; xl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld='-rpath $libdir' archive_cmds='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes=yes ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='' link_all_deplibs=yes allow_undefined_flag="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; freebsd1*) ld_shlibs=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld='+b $libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo(void) {} _ACEOF if ac_fn_c_try_link "$LINENO"; then : archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='${wl}-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test "$ld_shlibs" = no && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then archive_cmds_need_lc=no else archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* { $as_echo "$as_me:${as_lineno-$LINENO}: result: $archive_cmds_need_lc" >&5 $as_echo "$archive_cmds_need_lc" >&6; } ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[3-9]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if test "${ac_cv_lib_dld_shl_load+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld" else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if test "${ac_cv_lib_svld_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if test "${ac_cv_lib_dld_dld_link+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = x""yes; then : lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 11109 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self_static+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 11205 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report which library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= compiler_needs_object_CXX=no export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_direct_absolute_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_flag_spec_ld_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no inherit_rpath_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if test "${lt_cv_path_LD+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if test "${lt_cv_prog_gnu_ld+set}" = set; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes file_list_spec_CXX='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec_CXX='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. always_export_symbols_CXX=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty # executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' ${wl}-bernotok' allow_undefined_flag_CXX=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared # libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; darwin* | rhapsody*) archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported whole_archive_flag_spec_CXX='' link_all_deplibs_CXX=yes allow_undefined_flag_CXX="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds_CXX="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" if test "$lt_cv_apple_cc_single_mod" != "yes"; then archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi else ld_shlibs_CXX=no fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd[12]*) # C++ shared libraries reported to be fairly broken before # switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; gnu*) ;; hpux9*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) ;; *) export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix[3-9]*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: inherit_rpath_CXX=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [1-5]* | *pgcpp\ [1-5]*) prelink_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | $NL2SP`"' old_archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | $NL2SP`~ $RANLIB $oldlib' archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 will use weak symbols archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; xl*) # IBM XL 8.0 on PPC, with GNU ld hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' hardcode_libdir_flag_spec_CXX='-R$libdir' whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object_CXX=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) ld_shlibs_CXX=yes ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no hardcode_direct_absolute_CXX=yes archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='${wl}-E' whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=echo else ld_shlibs_CXX=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) case $host in osf3*) allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && $ECHO "X${wl}-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' ;; *) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' ;; esac hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then no_undefined_flag_CXX=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='${wl}-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_CXX='${wl}-z,text' allow_undefined_flag_CXX='${wl}-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-R,$libdir' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX="${prev}${p}" else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX="${prev}${p}" else postdeps_CXX="${postdeps_CXX} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$predep_objects_CXX"; then predep_objects_CXX="$p" else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX="$p" else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $RM -f confest.$objext # PORTME: override above test on systems where it is broken case $host_os in interix[3-9]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac compiler_lib_search_dirs_CXX= if test -n "${compiler_lib_search_path_CXX}"; then compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic_CXX='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix[4-9]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; xlc* | xlC*) # IBM XL 8.0 on PPC lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-qpic' lt_prog_compiler_static_CXX='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_prog_compiler_pic_CXX" >&5 $as_echo "$lt_prog_compiler_pic_CXX" >&6; } # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; } if test "${lt_cv_prog_compiler_pic_works_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13161: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:13165: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works_CXX=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if test "${lt_cv_prog_compiler_static_works_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works_CXX=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works_CXX=yes fi else lt_cv_prog_compiler_static_works_CXX=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_static_works_CXX" = xyes; then : else lt_prog_compiler_static_CXX= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13260: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:13264: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13312: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:13316: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix[4-9]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;/^.*[ ]__nm__/s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' ;; linux* | k*bsd*-gnu) link_all_deplibs_CXX=no ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no with_gnu_ld_CXX=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then archive_cmds_need_lc_CXX=no else archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* { $as_echo "$as_me:${as_lineno-$LINENO}: result: $archive_cmds_need_lc_CXX" >&5 $as_echo "$archive_cmds_need_lc_CXX" >&6; } ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[3-9]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || test -n "$runpath_var_CXX" || test "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct_CXX" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5 $as_echo "$hardcode_action_CXX" >&6; } if test "$hardcode_action_CXX" = relink || test "$inherit_rpath_CXX" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi fi # test -n "$compiler" CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu ac_config_commands="$ac_config_commands libtool" # Only expand once: # TODO(chandlerc@google.com): Currently we aren't running the Python tests # against the interpreter detected by AM_PATH_PYTHON, and so we condition # HAVE_PYTHON by requiring "python" to be in the PATH, and that interpreter's # version to be >= 2.3. This will allow the scripts to use a "/usr/bin/env" # hashbang. PYTHON= # We *do not* allow the user to specify a python interpreter # Extract the first word of "python", so it can be a program name with args. set dummy python; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_path_PYTHON+set}" = set; then : $as_echo_n "(cached) " >&6 else case $PYTHON in [\\/]* | ?:[\\/]*) ac_cv_path_PYTHON="$PYTHON" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_path_PYTHON="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_PYTHON" && ac_cv_path_PYTHON=":" ;; esac fi PYTHON=$ac_cv_path_PYTHON if test -n "$PYTHON"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PYTHON" >&5 $as_echo "$PYTHON" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$PYTHON" != ":"; then : prog="import sys # split strings by '.' and convert to numeric. Append some zeros # because we need at least 4 digits for the hex conversion. # map returns an iterator in Python 3.0 and a list in 2.x minver = list(map(int, '2.3'.split('.'))) + [0, 0, 0] minverhex = 0 # xrange is not present in Python 3.0 and range returns an iterator for i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i] sys.exit(sys.hexversion < minverhex)" if { echo "$as_me:$LINENO: $PYTHON -c "$prog"" >&5 ($PYTHON -c "$prog") >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then : : else PYTHON=":" fi fi if test "$PYTHON" != ":"; then HAVE_PYTHON_TRUE= HAVE_PYTHON_FALSE='#' else HAVE_PYTHON_TRUE='#' HAVE_PYTHON_FALSE= fi # TODO(chandlerc@google.com) Check for the necessary system headers. # Configure pthreads. # Check whether --with-pthreads was given. if test "${with_pthreads+set}" = set; then : withval=$with_pthreads; with_pthreads=$withval else with_pthreads=check fi have_pthreads=no if test "x$with_pthreads" != "xno"; then : ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu acx_pthread_ok=no # We used to check for pthread.h first, but this fails if pthread.h # requires special compiler flags (e.g. on True64 or Sequent). # It gets checked for in the link test anyway. # First of all, check if the user has set any of the PTHREAD_LIBS, # etcetera environment variables, and if threads linking works using # them: if test x"$PTHREAD_LIBS$PTHREAD_CFLAGS" != x; then save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for pthread_join in LIBS=$PTHREAD_LIBS with CFLAGS=$PTHREAD_CFLAGS" >&5 $as_echo_n "checking for pthread_join in LIBS=$PTHREAD_LIBS with CFLAGS=$PTHREAD_CFLAGS... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char pthread_join (); int main () { return pthread_join (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : acx_pthread_ok=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_ok" >&5 $as_echo "$acx_pthread_ok" >&6; } if test x"$acx_pthread_ok" = xno; then PTHREAD_LIBS="" PTHREAD_CFLAGS="" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" fi # We must check for the threads library under a number of different # names; the ordering is very important because some systems # (e.g. DEC) have both -lpthread and -lpthreads, where one of the # libraries is broken (non-POSIX). # Create a list of thread flags to try. Items starting with a "-" are # C compiler flags, and other items are library names, except for "none" # which indicates that we try without any flags at all, and "pthread-config" # which is a program returning the flags for the Pth emulation library. acx_pthread_flags="pthreads none -Kthread -kthread lthread -pthread -pthreads -mthreads pthread --thread-safe -mt pthread-config" # The ordering *is* (sometimes) important. Some notes on the # individual items follow: # pthreads: AIX (must check this before -lpthread) # none: in case threads are in libc; should be tried before -Kthread and # other compiler flags to prevent continual compiler warnings # -Kthread: Sequent (threads in libc, but -Kthread needed for pthread.h) # -kthread: FreeBSD kernel threads (preferred to -pthread since SMP-able) # lthread: LinuxThreads port on FreeBSD (also preferred to -pthread) # -pthread: Linux/gcc (kernel threads), BSD/gcc (userland threads) # -pthreads: Solaris/gcc # -mthreads: Mingw32/gcc, Lynx/gcc # -mt: Sun Workshop C (may only link SunOS threads [-lthread], but it # doesn't hurt to check since this sometimes defines pthreads too; # also defines -D_REENTRANT) # ... -mt is also the pthreads flag for HP/aCC # pthread: Linux, etcetera # --thread-safe: KAI C++ # pthread-config: use pthread-config program (for GNU Pth library) case "${host_cpu}-${host_os}" in *solaris*) # On Solaris (at least, for some versions), libc contains stubbed # (non-functional) versions of the pthreads routines, so link-based # tests will erroneously succeed. (We need to link with -pthreads/-mt/ # -lpthread.) (The stubs are missing pthread_cleanup_push, or rather # a function called by this macro, so we could check for that, but # who knows whether they'll stub that too in a future libc.) So, # we'll just look for -pthreads and -lpthread first: acx_pthread_flags="-pthreads pthread -mt -pthread $acx_pthread_flags" ;; esac if test x"$acx_pthread_ok" = xno; then for flag in $acx_pthread_flags; do case $flag in none) { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether pthreads work without any flags" >&5 $as_echo_n "checking whether pthreads work without any flags... " >&6; } ;; -*) { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether pthreads work with $flag" >&5 $as_echo_n "checking whether pthreads work with $flag... " >&6; } PTHREAD_CFLAGS="$flag" ;; pthread-config) # Extract the first word of "pthread-config", so it can be a program name with args. set dummy pthread-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_acx_pthread_config+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$acx_pthread_config"; then ac_cv_prog_acx_pthread_config="$acx_pthread_config" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_acx_pthread_config="yes" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_acx_pthread_config" && ac_cv_prog_acx_pthread_config="no" fi fi acx_pthread_config=$ac_cv_prog_acx_pthread_config if test -n "$acx_pthread_config"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_config" >&5 $as_echo "$acx_pthread_config" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test x"$acx_pthread_config" = xno; then continue; fi PTHREAD_CFLAGS="`pthread-config --cflags`" PTHREAD_LIBS="`pthread-config --ldflags` `pthread-config --libs`" ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the pthreads library -l$flag" >&5 $as_echo_n "checking for the pthreads library -l$flag... " >&6; } PTHREAD_LIBS="-l$flag" ;; esac save_LIBS="$LIBS" save_CFLAGS="$CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Check for various functions. We must include pthread.h, # since some functions may be macros. (On the Sequent, we # need a special flag -Kthread to make this header compile.) # We check for pthread_join because it is in -lpthread on IRIX # while pthread_create is in libc. We check for pthread_attr_init # due to DEC craziness with -lpthreads. We check for # pthread_cleanup_push because it is one of the few pthread # functions on Solaris that doesn't have a non-functional libc stub. # We try pthread_create on general principles. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : acx_pthread_ok=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_ok" >&5 $as_echo "$acx_pthread_ok" >&6; } if test "x$acx_pthread_ok" = xyes; then break; fi PTHREAD_LIBS="" PTHREAD_CFLAGS="" done fi # Various other checks: if test "x$acx_pthread_ok" = xyes; then save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Detect AIX lossage: JOINABLE attribute is called UNDETACHED. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for joinable pthread attribute" >&5 $as_echo_n "checking for joinable pthread attribute... " >&6; } attr_name=unknown for attr in PTHREAD_CREATE_JOINABLE PTHREAD_CREATE_UNDETACHED; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int attr=$attr; return attr; ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : attr_name=$attr; break fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext done { $as_echo "$as_me:${as_lineno-$LINENO}: result: $attr_name" >&5 $as_echo "$attr_name" >&6; } if test "$attr_name" != PTHREAD_CREATE_JOINABLE; then cat >>confdefs.h <<_ACEOF #define PTHREAD_CREATE_JOINABLE $attr_name _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if more special flags are required for pthreads" >&5 $as_echo_n "checking if more special flags are required for pthreads... " >&6; } flag=no case "${host_cpu}-${host_os}" in *-aix* | *-freebsd* | *-darwin*) flag="-D_THREAD_SAFE";; *solaris* | *-osf* | *-hpux*) flag="-D_REENTRANT";; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${flag}" >&5 $as_echo "${flag}" >&6; } if test "x$flag" != xno; then PTHREAD_CFLAGS="$flag $PTHREAD_CFLAGS" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" # More AIX lossage: must compile with xlc_r or cc_r if test x"$GCC" != xyes; then for ac_prog in xlc_r cc_r do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_PTHREAD_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$PTHREAD_CC"; then ac_cv_prog_PTHREAD_CC="$PTHREAD_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_PTHREAD_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi PTHREAD_CC=$ac_cv_prog_PTHREAD_CC if test -n "$PTHREAD_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PTHREAD_CC" >&5 $as_echo "$PTHREAD_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$PTHREAD_CC" && break done test -n "$PTHREAD_CC" || PTHREAD_CC="${CC}" else PTHREAD_CC=$CC fi # The next part tries to detect GCC inconsistency with -shared on some # architectures and systems. The problem is that in certain # configurations, when -shared is specified, GCC "forgets" to # internally use various flags which are still necessary. # # Prepare the flags # save_CFLAGS="$CFLAGS" save_LIBS="$LIBS" save_CC="$CC" # Try with the flags determined by the earlier checks. # # -Wl,-z,defs forces link-time symbol resolution, so that the # linking checks with -shared actually have any value # # FIXME: -fPIC is required for -shared on many architectures, # so we specify it here, but the right way would probably be to # properly detect whether it is actually required. CFLAGS="-shared -fPIC -Wl,-z,defs $CFLAGS $PTHREAD_CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CC="$PTHREAD_CC" # In order not to create several levels of indentation, we test # the value of "$done" until we find the cure or run out of ideas. done="no" # First, make sure the CFLAGS we added are actually accepted by our # compiler. If not (and OS X's ld, for instance, does not accept -z), # then we can't do this test. if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to check for GCC pthread/shared inconsistencies" >&5 $as_echo_n "checking whether to check for GCC pthread/shared inconsistencies... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : else done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi fi if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -pthread is sufficient with -shared" >&5 $as_echo_n "checking whether -pthread is sufficient with -shared... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi # # Linux gcc on some architectures such as mips/mipsel forgets # about -lpthread # if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lpthread fixes that" >&5 $as_echo_n "checking whether -lpthread fixes that... " >&6; } LIBS="-lpthread $PTHREAD_LIBS $save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } PTHREAD_LIBS="-lpthread $PTHREAD_LIBS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi # # FreeBSD 4.10 gcc forgets to use -lc_r instead of -lc # if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc_r fixes that" >&5 $as_echo_n "checking whether -lc_r fixes that... " >&6; } LIBS="-lc_r $PTHREAD_LIBS $save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } PTHREAD_LIBS="-lc_r $PTHREAD_LIBS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test x"$done" = xno; then # OK, we have run out of ideas { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Impossible to determine how to use pthreads with shared libraries" >&5 $as_echo "$as_me: WARNING: Impossible to determine how to use pthreads with shared libraries" >&2;} # so it's not safe to assume that we may use pthreads acx_pthread_ok=no fi CFLAGS="$save_CFLAGS" LIBS="$save_LIBS" CC="$save_CC" else PTHREAD_CC="$CC" fi # Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND: if test x"$acx_pthread_ok" = xyes; then $as_echo "#define HAVE_PTHREAD 1" >>confdefs.h : else acx_pthread_ok=no if test "x$with_pthreads" != "xcheck"; then : { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "--with-pthreads was specified, but unable to be used See \`config.log' for more details." "$LINENO" 5; } fi fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu have_pthreads="$acx_pthread_ok" fi if test "x$have_pthreads" == "xyes"; then HAVE_PTHREADS_TRUE= HAVE_PTHREADS_FALSE='#' else HAVE_PTHREADS_TRUE='#' HAVE_PTHREADS_FALSE= fi # GoogleMock currently has hard dependencies upon GoogleTest above and beyond # running its own test suite, so we both provide our own version in # a subdirectory and provide some logic to use a custom version or a system # installed version. # Check whether --with-gtest was given. if test "${with_gtest+set}" = set; then : withval=$with_gtest; else with_gtest=yes fi # Check whether --enable-external-gtest was given. if test "${enable_external_gtest+set}" = set; then : enableval=$enable_external_gtest; else enable_external_gtest=yes fi if test "x$with_gtest" == "xno"; then : as_fn_error "Support for GoogleTest was explicitly disabled. Currently GoogleMock has a hard dependency upon GoogleTest to build, please provide a version, or allow GoogleMock to use any installed version and fall back upon its internal version." "$LINENO" 5 fi # Setup various GTEST variables. TODO(chandlerc@google.com): When these are # used below, they should be used such that any pre-existing values always # trump values we set them to, so that they can be used to selectively override # details of the detection process. HAVE_BUILT_GTEST="no" GTEST_MIN_VERSION="1.6.0" if test "x${enable_external_gtest}" = "xyes"; then : # Begin filling in variables as we are able. if test "x${with_gtest}" != "xyes"; then : if test -x "${with_gtest}/scripts/gtest-config"; then : GTEST_CONFIG="${with_gtest}/scripts/gtest-config" else GTEST_CONFIG="${with_gtest}/bin/gtest-config" fi if test -x "${GTEST_CONFIG}"; then : else as_fn_error "Unable to locate either a built or installed Google Test at '${with_gtest}'." "$LINENO" 5 fi fi if test -x "${GTEST_CONFIG}"; then : else # Extract the first word of "gtest-config", so it can be a program name with args. set dummy gtest-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_path_GTEST_CONFIG+set}" = set; then : $as_echo_n "(cached) " >&6 else case $GTEST_CONFIG in [\\/]* | ?:[\\/]*) ac_cv_path_GTEST_CONFIG="$GTEST_CONFIG" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_path_GTEST_CONFIG="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS ;; esac fi GTEST_CONFIG=$ac_cv_path_GTEST_CONFIG if test -n "$GTEST_CONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $GTEST_CONFIG" >&5 $as_echo "$GTEST_CONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -x "${GTEST_CONFIG}"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for Google Test version >= ${GTEST_MIN_VERSION}" >&5 $as_echo_n "checking for Google Test version >= ${GTEST_MIN_VERSION}... " >&6; } if ${GTEST_CONFIG} --min-version=${GTEST_MIN_VERSION}; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } HAVE_BUILT_GTEST="yes" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test "x${HAVE_BUILT_GTEST}" = "xyes"; then : GTEST_CPPFLAGS=`${GTEST_CONFIG} --cppflags` GTEST_CXXFLAGS=`${GTEST_CONFIG} --cxxflags` GTEST_LDFLAGS=`${GTEST_CONFIG} --ldflags` GTEST_LIBS=`${GTEST_CONFIG} --libs` GTEST_VERSION=`${GTEST_CONFIG} --version` else subdirs="$subdirs gtest" # GTEST_CONFIG needs to be executable both in a Makefile environmont and # in a shell script environment, so resolve an absolute path for it here. GTEST_CONFIG="`pwd -P`/gtest/scripts/gtest-config" GTEST_CPPFLAGS='-I$(top_srcdir)/gtest/include' GTEST_CXXFLAGS='-g' GTEST_LDFLAGS='' GTEST_LIBS='$(top_builddir)/gtest/lib/libgtest.la' GTEST_VERSION="${GTEST_MIN_VERSION}" fi # TODO(chandlerc@google.com) Check the types, structures, and other compiler # and architecture characteristics. # Output the generated files. No further autoconf macros may be used. cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then test "x$cache_file" != "x/dev/null" && { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} cat confcache >$cache_file else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_PYTHON_TRUE}" && test -z "${HAVE_PYTHON_FALSE}"; then as_fn_error "conditional \"HAVE_PYTHON\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_PTHREADS_TRUE}" && test -z "${HAVE_PTHREADS_FALSE}"; then as_fn_error "conditional \"HAVE_PTHREADS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : ${CONFIG_STATUS=./config.status} ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by Google C++ Mocking Framework $as_me 1.6.0, which was generated by GNU Autoconf 2.65. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ Google C++ Mocking Framework config.status 1.6.0 configured by $0, generated by GNU Autoconf 2.65, with options \\"\$ac_cs_config\\" Copyright (C) 2009 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "X$macro_version" | $Xsed -e "$delay_single_quote_subst"`' macro_revision='`$ECHO "X$macro_revision" | $Xsed -e "$delay_single_quote_subst"`' enable_shared='`$ECHO "X$enable_shared" | $Xsed -e "$delay_single_quote_subst"`' enable_static='`$ECHO "X$enable_static" | $Xsed -e "$delay_single_quote_subst"`' pic_mode='`$ECHO "X$pic_mode" | $Xsed -e "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "X$enable_fast_install" | $Xsed -e "$delay_single_quote_subst"`' host_alias='`$ECHO "X$host_alias" | $Xsed -e "$delay_single_quote_subst"`' host='`$ECHO "X$host" | $Xsed -e "$delay_single_quote_subst"`' host_os='`$ECHO "X$host_os" | $Xsed -e "$delay_single_quote_subst"`' build_alias='`$ECHO "X$build_alias" | $Xsed -e "$delay_single_quote_subst"`' build='`$ECHO "X$build" | $Xsed -e "$delay_single_quote_subst"`' build_os='`$ECHO "X$build_os" | $Xsed -e "$delay_single_quote_subst"`' SED='`$ECHO "X$SED" | $Xsed -e "$delay_single_quote_subst"`' Xsed='`$ECHO "X$Xsed" | $Xsed -e "$delay_single_quote_subst"`' GREP='`$ECHO "X$GREP" | $Xsed -e "$delay_single_quote_subst"`' EGREP='`$ECHO "X$EGREP" | $Xsed -e "$delay_single_quote_subst"`' FGREP='`$ECHO "X$FGREP" | $Xsed -e "$delay_single_quote_subst"`' LD='`$ECHO "X$LD" | $Xsed -e "$delay_single_quote_subst"`' NM='`$ECHO "X$NM" | $Xsed -e "$delay_single_quote_subst"`' LN_S='`$ECHO "X$LN_S" | $Xsed -e "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "X$max_cmd_len" | $Xsed -e "$delay_single_quote_subst"`' ac_objext='`$ECHO "X$ac_objext" | $Xsed -e "$delay_single_quote_subst"`' exeext='`$ECHO "X$exeext" | $Xsed -e "$delay_single_quote_subst"`' lt_unset='`$ECHO "X$lt_unset" | $Xsed -e "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "X$lt_SP2NL" | $Xsed -e "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "X$lt_NL2SP" | $Xsed -e "$delay_single_quote_subst"`' reload_flag='`$ECHO "X$reload_flag" | $Xsed -e "$delay_single_quote_subst"`' reload_cmds='`$ECHO "X$reload_cmds" | $Xsed -e "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "X$OBJDUMP" | $Xsed -e "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "X$deplibs_check_method" | $Xsed -e "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "X$file_magic_cmd" | $Xsed -e "$delay_single_quote_subst"`' AR='`$ECHO "X$AR" | $Xsed -e "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "X$AR_FLAGS" | $Xsed -e "$delay_single_quote_subst"`' STRIP='`$ECHO "X$STRIP" | $Xsed -e "$delay_single_quote_subst"`' RANLIB='`$ECHO "X$RANLIB" | $Xsed -e "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "X$old_postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "X$old_postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "X$old_archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' CC='`$ECHO "X$CC" | $Xsed -e "$delay_single_quote_subst"`' CFLAGS='`$ECHO "X$CFLAGS" | $Xsed -e "$delay_single_quote_subst"`' compiler='`$ECHO "X$compiler" | $Xsed -e "$delay_single_quote_subst"`' GCC='`$ECHO "X$GCC" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "X$lt_cv_sys_global_symbol_pipe" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "X$lt_cv_sys_global_symbol_to_cdecl" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' objdir='`$ECHO "X$objdir" | $Xsed -e "$delay_single_quote_subst"`' SHELL='`$ECHO "X$SHELL" | $Xsed -e "$delay_single_quote_subst"`' ECHO='`$ECHO "X$ECHO" | $Xsed -e "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "X$MAGIC_CMD" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "X$lt_prog_compiler_no_builtin_flag" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "X$lt_prog_compiler_wl" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "X$lt_prog_compiler_pic" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "X$lt_prog_compiler_static" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "X$lt_cv_prog_compiler_c_o" | $Xsed -e "$delay_single_quote_subst"`' need_locks='`$ECHO "X$need_locks" | $Xsed -e "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "X$DSYMUTIL" | $Xsed -e "$delay_single_quote_subst"`' NMEDIT='`$ECHO "X$NMEDIT" | $Xsed -e "$delay_single_quote_subst"`' LIPO='`$ECHO "X$LIPO" | $Xsed -e "$delay_single_quote_subst"`' OTOOL='`$ECHO "X$OTOOL" | $Xsed -e "$delay_single_quote_subst"`' OTOOL64='`$ECHO "X$OTOOL64" | $Xsed -e "$delay_single_quote_subst"`' libext='`$ECHO "X$libext" | $Xsed -e "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "X$shrext_cmds" | $Xsed -e "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "X$extract_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "X$archive_cmds_need_lc" | $Xsed -e "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "X$enable_shared_with_static_runtimes" | $Xsed -e "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "X$export_dynamic_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "X$whole_archive_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "X$compiler_needs_object" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "X$old_archive_from_new_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "X$old_archive_from_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds='`$ECHO "X$archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "X$archive_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_cmds='`$ECHO "X$module_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "X$module_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "X$with_gnu_ld" | $Xsed -e "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "X$allow_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "X$no_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "X$hardcode_libdir_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_ld='`$ECHO "X$hardcode_libdir_flag_spec_ld" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "X$hardcode_libdir_separator" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "X$hardcode_direct" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "X$hardcode_direct_absolute" | $Xsed -e "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "X$hardcode_minus_L" | $Xsed -e "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "X$hardcode_shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "X$hardcode_automatic" | $Xsed -e "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "X$inherit_rpath" | $Xsed -e "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "X$link_all_deplibs" | $Xsed -e "$delay_single_quote_subst"`' fix_srcfile_path='`$ECHO "X$fix_srcfile_path" | $Xsed -e "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "X$always_export_symbols" | $Xsed -e "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "X$export_symbols_cmds" | $Xsed -e "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "X$exclude_expsyms" | $Xsed -e "$delay_single_quote_subst"`' include_expsyms='`$ECHO "X$include_expsyms" | $Xsed -e "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "X$prelink_cmds" | $Xsed -e "$delay_single_quote_subst"`' file_list_spec='`$ECHO "X$file_list_spec" | $Xsed -e "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "X$variables_saved_for_relink" | $Xsed -e "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "X$need_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' need_version='`$ECHO "X$need_version" | $Xsed -e "$delay_single_quote_subst"`' version_type='`$ECHO "X$version_type" | $Xsed -e "$delay_single_quote_subst"`' runpath_var='`$ECHO "X$runpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "X$shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "X$shlibpath_overrides_runpath" | $Xsed -e "$delay_single_quote_subst"`' libname_spec='`$ECHO "X$libname_spec" | $Xsed -e "$delay_single_quote_subst"`' library_names_spec='`$ECHO "X$library_names_spec" | $Xsed -e "$delay_single_quote_subst"`' soname_spec='`$ECHO "X$soname_spec" | $Xsed -e "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "X$postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "X$postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_cmds='`$ECHO "X$finish_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_eval='`$ECHO "X$finish_eval" | $Xsed -e "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "X$hardcode_into_libs" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "X$sys_lib_search_path_spec" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "X$sys_lib_dlsearch_path_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_action='`$ECHO "X$hardcode_action" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "X$enable_dlopen" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "X$enable_dlopen_self" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "X$enable_dlopen_self_static" | $Xsed -e "$delay_single_quote_subst"`' old_striplib='`$ECHO "X$old_striplib" | $Xsed -e "$delay_single_quote_subst"`' striplib='`$ECHO "X$striplib" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_dirs='`$ECHO "X$compiler_lib_search_dirs" | $Xsed -e "$delay_single_quote_subst"`' predep_objects='`$ECHO "X$predep_objects" | $Xsed -e "$delay_single_quote_subst"`' postdep_objects='`$ECHO "X$postdep_objects" | $Xsed -e "$delay_single_quote_subst"`' predeps='`$ECHO "X$predeps" | $Xsed -e "$delay_single_quote_subst"`' postdeps='`$ECHO "X$postdeps" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_path='`$ECHO "X$compiler_lib_search_path" | $Xsed -e "$delay_single_quote_subst"`' LD_CXX='`$ECHO "X$LD_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_cmds_CXX='`$ECHO "X$old_archive_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_CXX='`$ECHO "X$compiler_CXX" | $Xsed -e "$delay_single_quote_subst"`' GCC_CXX='`$ECHO "X$GCC_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "X$lt_prog_compiler_no_builtin_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_wl_CXX='`$ECHO "X$lt_prog_compiler_wl_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_pic_CXX='`$ECHO "X$lt_prog_compiler_pic_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_static_CXX='`$ECHO "X$lt_prog_compiler_static_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o_CXX='`$ECHO "X$lt_cv_prog_compiler_c_o_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_need_lc_CXX='`$ECHO "X$archive_cmds_need_lc_CXX" | $Xsed -e "$delay_single_quote_subst"`' enable_shared_with_static_runtimes_CXX='`$ECHO "X$enable_shared_with_static_runtimes_CXX" | $Xsed -e "$delay_single_quote_subst"`' export_dynamic_flag_spec_CXX='`$ECHO "X$export_dynamic_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' whole_archive_flag_spec_CXX='`$ECHO "X$whole_archive_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_needs_object_CXX='`$ECHO "X$compiler_needs_object_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_new_cmds_CXX='`$ECHO "X$old_archive_from_new_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds_CXX='`$ECHO "X$old_archive_from_expsyms_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_CXX='`$ECHO "X$archive_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_expsym_cmds_CXX='`$ECHO "X$archive_expsym_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' module_cmds_CXX='`$ECHO "X$module_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' module_expsym_cmds_CXX='`$ECHO "X$module_expsym_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' with_gnu_ld_CXX='`$ECHO "X$with_gnu_ld_CXX" | $Xsed -e "$delay_single_quote_subst"`' allow_undefined_flag_CXX='`$ECHO "X$allow_undefined_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' no_undefined_flag_CXX='`$ECHO "X$no_undefined_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_CXX='`$ECHO "X$hardcode_libdir_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_ld_CXX='`$ECHO "X$hardcode_libdir_flag_spec_ld_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_separator_CXX='`$ECHO "X$hardcode_libdir_separator_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_CXX='`$ECHO "X$hardcode_direct_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_absolute_CXX='`$ECHO "X$hardcode_direct_absolute_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_minus_L_CXX='`$ECHO "X$hardcode_minus_L_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_shlibpath_var_CXX='`$ECHO "X$hardcode_shlibpath_var_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_automatic_CXX='`$ECHO "X$hardcode_automatic_CXX" | $Xsed -e "$delay_single_quote_subst"`' inherit_rpath_CXX='`$ECHO "X$inherit_rpath_CXX" | $Xsed -e "$delay_single_quote_subst"`' link_all_deplibs_CXX='`$ECHO "X$link_all_deplibs_CXX" | $Xsed -e "$delay_single_quote_subst"`' fix_srcfile_path_CXX='`$ECHO "X$fix_srcfile_path_CXX" | $Xsed -e "$delay_single_quote_subst"`' always_export_symbols_CXX='`$ECHO "X$always_export_symbols_CXX" | $Xsed -e "$delay_single_quote_subst"`' export_symbols_cmds_CXX='`$ECHO "X$export_symbols_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' exclude_expsyms_CXX='`$ECHO "X$exclude_expsyms_CXX" | $Xsed -e "$delay_single_quote_subst"`' include_expsyms_CXX='`$ECHO "X$include_expsyms_CXX" | $Xsed -e "$delay_single_quote_subst"`' prelink_cmds_CXX='`$ECHO "X$prelink_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' file_list_spec_CXX='`$ECHO "X$file_list_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_action_CXX='`$ECHO "X$hardcode_action_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_dirs_CXX='`$ECHO "X$compiler_lib_search_dirs_CXX" | $Xsed -e "$delay_single_quote_subst"`' predep_objects_CXX='`$ECHO "X$predep_objects_CXX" | $Xsed -e "$delay_single_quote_subst"`' postdep_objects_CXX='`$ECHO "X$postdep_objects_CXX" | $Xsed -e "$delay_single_quote_subst"`' predeps_CXX='`$ECHO "X$predeps_CXX" | $Xsed -e "$delay_single_quote_subst"`' postdeps_CXX='`$ECHO "X$postdeps_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_path_CXX='`$ECHO "X$compiler_lib_search_path_CXX" | $Xsed -e "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ AR \ AR_FLAGS \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ SHELL \ ECHO \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_wl \ lt_prog_compiler_pic \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_flag_spec_ld \ hardcode_libdir_separator \ fix_srcfile_path \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ finish_eval \ old_striplib \ striplib \ compiler_lib_search_dirs \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ LD_CXX \ compiler_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_static_CXX \ lt_cv_prog_compiler_c_o_CXX \ export_dynamic_flag_spec_CXX \ whole_archive_flag_spec_CXX \ compiler_needs_object_CXX \ with_gnu_ld_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_flag_spec_ld_CXX \ hardcode_libdir_separator_CXX \ fix_srcfile_path_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX \ file_list_spec_CXX \ compiler_lib_search_dirs_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ export_symbols_cmds_CXX \ prelink_cmds_CXX; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\$0 --fallback-echo"') lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\$0 --fallback-echo"\$/\$0 --fallback-echo"/'\` ;; esac ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "build-aux/config.h") CONFIG_HEADERS="$CONFIG_HEADERS build-aux/config.h" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "scripts/gmock-config") CONFIG_FILES="$CONFIG_FILES scripts/gmock-config" ;; "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; *) as_fn_error "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= trap 'exit_status=$? { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error "cannot create a temporary directory in ." "$LINENO" 5 # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '$'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$tmp/subs1.awk" > "$tmp/subs.awk" \ || as_fn_error "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=/{ s/:*\$(srcdir):*/:/ s/:*\${srcdir}:*/:/ s/:*@srcdir@:*/:/ s/^\([^=]*=[ ]*\):*/\1/ s/:*$// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_t=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_t"; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$tmp/stdin" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$tmp/subs.awk" >$tmp/out \ || as_fn_error "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' "$tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&2;} rm -f "$tmp/stdin" case $ac_file in -) cat "$tmp/out" && rm -f "$tmp/out";; *) rm -f "$ac_file" && mv "$tmp/out" "$ac_file";; esac \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" } >"$tmp/config.h" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$tmp/config.h" "$ac_file" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "scripts/gmock-config":F) chmod +x scripts/gmock-config ;; "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags="CXX " # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == "file_magic". file_magic_cmd=$lt_file_magic_cmd # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # The name of the directory that contains temporary libtool files. objdir=$objdir # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that does not interpret backslashes. ECHO=$lt_ECHO # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # If ld is used when linking, flag to hardcode \$libdir into a binary # during linking. This must work even if \$libdir does not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path=$lt_fix_srcfile_path # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects postdep_objects=$lt_postdep_objects predeps=$lt_predeps postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain="$ac_aux_dir/ltmain.sh" # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $* )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[^=]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[^.]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$@"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$1" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1+=\$2" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1=\$$1\$2" } _LT_EOF ;; esac sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" cat <<_LT_EOF >> "$ofile" # ### BEGIN LIBTOOL TAG CONFIG: CXX # The linker used to build libraries. LD=$lt_LD_CXX # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds_CXX # A language specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU compiler? with_gcc=$GCC_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object_CXX # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld_CXX # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # If ld is used when linking, flag to hardcode \$libdir into a binary # during linking. This must work even if \$libdir does not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_CXX # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute_CXX # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic_CXX # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath_CXX # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path=$lt_fix_srcfile_path_CXX # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds_CXX # Specify filename containing input files. file_list_spec=$lt_file_list_spec_CXX # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects_CXX postdep_objects=$lt_postdep_objects_CXX predeps=$lt_predeps_CXX postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # ### END LIBTOOL TAG CONFIG: CXX _LT_EOF ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit $? fi # # CONFIG_SUBDIRS section. # if test "$no_recursion" != yes; then # Remove --cache-file, --srcdir, and --disable-option-checking arguments # so they do not pile up. ac_sub_configure_args= ac_prev= eval "set x $ac_configure_args" shift for ac_arg do if test -n "$ac_prev"; then ac_prev= continue fi case $ac_arg in -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* \ | --c=*) ;; --config-cache | -C) ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) ;; --disable-option-checking) ;; *) case $ac_arg in *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append ac_sub_configure_args " '$ac_arg'" ;; esac done # Always prepend --prefix to ensure using the same prefix # in subdir configurations. ac_arg="--prefix=$prefix" case $ac_arg in *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac ac_sub_configure_args="'$ac_arg' $ac_sub_configure_args" # Pass --silent if test "$silent" = yes; then ac_sub_configure_args="--silent $ac_sub_configure_args" fi # Always prepend --disable-option-checking to silence warnings, since # different subdirs can have different --enable and --with options. ac_sub_configure_args="--disable-option-checking $ac_sub_configure_args" ac_popdir=`pwd` for ac_dir in : $subdirs; do test "x$ac_dir" = x: && continue # Do not complain, so a configure script can configure whichever # parts of a large source tree are present. test -d "$srcdir/$ac_dir" || continue ac_msg="=== configuring in $ac_dir (`pwd`/$ac_dir)" $as_echo "$as_me:${as_lineno-$LINENO}: $ac_msg" >&5 $as_echo "$ac_msg" >&6 as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" # Check for guested configure; otherwise get Cygnus style configure. if test -f "$ac_srcdir/configure.gnu"; then ac_sub_configure=$ac_srcdir/configure.gnu elif test -f "$ac_srcdir/configure"; then ac_sub_configure=$ac_srcdir/configure elif test -f "$ac_srcdir/configure.in"; then # This should be Cygnus configure. ac_sub_configure=$ac_aux_dir/configure else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: no configuration information is in $ac_dir" >&5 $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2;} ac_sub_configure= fi # The recursion is here. if test -n "$ac_sub_configure"; then # Make the cache file name correct relative to the subdirectory. case $cache_file in [\\/]* | ?:[\\/]* ) ac_sub_cache_file=$cache_file ;; *) # Relative name. ac_sub_cache_file=$ac_top_build_prefix$cache_file ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: running $SHELL $ac_sub_configure $ac_sub_configure_args --cache-file=$ac_sub_cache_file --srcdir=$ac_srcdir" >&5 $as_echo "$as_me: running $SHELL $ac_sub_configure $ac_sub_configure_args --cache-file=$ac_sub_cache_file --srcdir=$ac_srcdir" >&6;} # The eval makes quoting arguments work. eval "\$SHELL \"\$ac_sub_configure\" $ac_sub_configure_args \ --cache-file=\"\$ac_sub_cache_file\" --srcdir=\"\$ac_srcdir\"" || as_fn_error "$ac_sub_configure failed for $ac_dir" "$LINENO" 5 fi cd "$ac_popdir" done fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi synergy-1.4.12-Source/tools/gmock-1.6.0/configure.ac0000600000175000017500000001415611561126632021707 0ustar synergysynergym4_include(gtest/m4/acx_pthread.m4) AC_INIT([Google C++ Mocking Framework], [1.6.0], [googlemock@googlegroups.com], [gmock]) # Provide various options to initialize the Autoconf and configure processes. AC_PREREQ([2.59]) AC_CONFIG_SRCDIR([./COPYING]) AC_CONFIG_AUX_DIR([build-aux]) AC_CONFIG_HEADERS([build-aux/config.h]) AC_CONFIG_FILES([Makefile]) AC_CONFIG_FILES([scripts/gmock-config], [chmod +x scripts/gmock-config]) # Initialize Automake with various options. We require at least v1.9, prevent # pedantic complaints about package files, and enable various distribution # targets. AM_INIT_AUTOMAKE([1.9 dist-bzip2 dist-zip foreign subdir-objects]) # Check for programs used in building Google Test. AC_PROG_CC AC_PROG_CXX AC_LANG([C++]) AC_PROG_LIBTOOL # TODO(chandlerc@google.com): Currently we aren't running the Python tests # against the interpreter detected by AM_PATH_PYTHON, and so we condition # HAVE_PYTHON by requiring "python" to be in the PATH, and that interpreter's # version to be >= 2.3. This will allow the scripts to use a "/usr/bin/env" # hashbang. PYTHON= # We *do not* allow the user to specify a python interpreter AC_PATH_PROG([PYTHON],[python],[:]) AS_IF([test "$PYTHON" != ":"], [AM_PYTHON_CHECK_VERSION([$PYTHON],[2.3],[:],[PYTHON=":"])]) AM_CONDITIONAL([HAVE_PYTHON],[test "$PYTHON" != ":"]) # TODO(chandlerc@google.com) Check for the necessary system headers. # Configure pthreads. AC_ARG_WITH([pthreads], [AS_HELP_STRING([--with-pthreads], [use pthreads (default is yes)])], [with_pthreads=$withval], [with_pthreads=check]) have_pthreads=no AS_IF([test "x$with_pthreads" != "xno"], [ACX_PTHREAD( [], [AS_IF([test "x$with_pthreads" != "xcheck"], [AC_MSG_FAILURE( [--with-pthreads was specified, but unable to be used])])]) have_pthreads="$acx_pthread_ok"]) AM_CONDITIONAL([HAVE_PTHREADS],[test "x$have_pthreads" == "xyes"]) AC_SUBST(PTHREAD_CFLAGS) AC_SUBST(PTHREAD_LIBS) # GoogleMock currently has hard dependencies upon GoogleTest above and beyond # running its own test suite, so we both provide our own version in # a subdirectory and provide some logic to use a custom version or a system # installed version. AC_ARG_WITH([gtest], [AS_HELP_STRING([--with-gtest], [Specifies how to find the gtest package. If no arguments are given, the default behavior, a system installed gtest will be used if present, and an internal version built otherwise. If a path is provided, the gtest built or installed at that prefix will be used.])], [], [with_gtest=yes]) AC_ARG_ENABLE([external-gtest], [AS_HELP_STRING([--disable-external-gtest], [Disables any detection or use of a system installed or user provided gtest. Any option to '--with-gtest' is ignored. (Default is enabled.)]) ], [], [enable_external_gtest=yes]) AS_IF([test "x$with_gtest" == "xno"], [AC_MSG_ERROR([dnl Support for GoogleTest was explicitly disabled. Currently GoogleMock has a hard dependency upon GoogleTest to build, please provide a version, or allow GoogleMock to use any installed version and fall back upon its internal version.])]) # Setup various GTEST variables. TODO(chandlerc@google.com): When these are # used below, they should be used such that any pre-existing values always # trump values we set them to, so that they can be used to selectively override # details of the detection process. AC_ARG_VAR([GTEST_CONFIG], [The exact path of Google Test's 'gtest-config' script.]) AC_ARG_VAR([GTEST_CPPFLAGS], [C-like preprocessor flags for Google Test.]) AC_ARG_VAR([GTEST_CXXFLAGS], [C++ compile flags for Google Test.]) AC_ARG_VAR([GTEST_LDFLAGS], [Linker path and option flags for Google Test.]) AC_ARG_VAR([GTEST_LIBS], [Library linking flags for Google Test.]) AC_ARG_VAR([GTEST_VERSION], [The version of Google Test available.]) HAVE_BUILT_GTEST="no" GTEST_MIN_VERSION="1.6.0" AS_IF([test "x${enable_external_gtest}" = "xyes"], [# Begin filling in variables as we are able. AS_IF([test "x${with_gtest}" != "xyes"], [AS_IF([test -x "${with_gtest}/scripts/gtest-config"], [GTEST_CONFIG="${with_gtest}/scripts/gtest-config"], [GTEST_CONFIG="${with_gtest}/bin/gtest-config"]) AS_IF([test -x "${GTEST_CONFIG}"], [], [AC_MSG_ERROR([dnl Unable to locate either a built or installed Google Test at '${with_gtest}'.]) ])]) AS_IF([test -x "${GTEST_CONFIG}"], [], [AC_PATH_PROG([GTEST_CONFIG], [gtest-config])]) AS_IF([test -x "${GTEST_CONFIG}"], [AC_MSG_CHECKING([for Google Test version >= ${GTEST_MIN_VERSION}]) AS_IF([${GTEST_CONFIG} --min-version=${GTEST_MIN_VERSION}], [AC_MSG_RESULT([yes]) HAVE_BUILT_GTEST="yes"], [AC_MSG_RESULT([no])])])]) AS_IF([test "x${HAVE_BUILT_GTEST}" = "xyes"], [GTEST_CPPFLAGS=`${GTEST_CONFIG} --cppflags` GTEST_CXXFLAGS=`${GTEST_CONFIG} --cxxflags` GTEST_LDFLAGS=`${GTEST_CONFIG} --ldflags` GTEST_LIBS=`${GTEST_CONFIG} --libs` GTEST_VERSION=`${GTEST_CONFIG} --version`], [AC_CONFIG_SUBDIRS([gtest]) # GTEST_CONFIG needs to be executable both in a Makefile environmont and # in a shell script environment, so resolve an absolute path for it here. GTEST_CONFIG="`pwd -P`/gtest/scripts/gtest-config" GTEST_CPPFLAGS='-I$(top_srcdir)/gtest/include' GTEST_CXXFLAGS='-g' GTEST_LDFLAGS='' GTEST_LIBS='$(top_builddir)/gtest/lib/libgtest.la' GTEST_VERSION="${GTEST_MIN_VERSION}"]) # TODO(chandlerc@google.com) Check the types, structures, and other compiler # and architecture characteristics. # Output the generated files. No further autoconf macros may be used. AC_OUTPUT synergy-1.4.12-Source/tools/gmock-1.6.0/CONTRIBUTORS0000600000175000017500000000253111561126632021273 0ustar synergysynergy# This file contains a list of people who've made non-trivial # contribution to the Google C++ Mocking Framework project. People # who commit code to the project are encouraged to add their names # here. Please keep the list sorted by first names. Benoit Sigoure Bogdan Piloca Chandler Carruth Dave MacLachlan David Anderson Dean Sturtevant Gene Volovich Hal Burch Jeffrey Yasskin Jim Keller Joe Walnes Jon Wray Keir Mierle Keith Ray Kostya Serebryany Lev Makhlis Manuel Klimek Mario Tanev Mark Paskin Markus Heule Matthew Simmons Mike Bland Neal Norwitz Nermin Ozkiranartli Owen Carlsen Paneendra Ba Paul Menage Piotr Kaminski Russ Rufer Sverre Sundsdal Takeshi Yoshino Vadim Berman Vlad Losev Wolfgang Klier Zhanyong Wan synergy-1.4.12-Source/tools/gmock-1.6.0/COPYING0000600000175000017500000000270311561126632020447 0ustar synergysynergyCopyright 2008, Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * 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. * Neither the name of Google Inc. 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 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. synergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/0000700000175000017500000000000012140644175021304 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gmock/0000700000175000017500000000000012140644175022404 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gmock-gtest-all.cc0000600000175000017500000137125311561126632024622 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // Google C++ Testing Framework (Google Test) // // Sometimes it's desirable to build Google Test by compiling a single file. // This file serves this purpose. // This line ensures that gtest.h can be compiled on its own, even // when it's fused. #include "gtest/gtest.h" // The following lines pull in the real gtest *.cc files. // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Utilities for testing Google Test itself and code that uses Google Test // (e.g. frameworks built on top of Google Test). #ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #define GTEST_INCLUDE_GTEST_GTEST_SPI_H_ namespace testing { // This helper class can be used to mock out Google Test failure reporting // so that we can test Google Test or code that builds on Google Test. // // An object of this class appends a TestPartResult object to the // TestPartResultArray object given in the constructor whenever a Google Test // failure is reported. It can either intercept only failures that are // generated in the same thread that created this object or it can intercept // all generated failures. The scope of this mock object can be controlled with // the second argument to the two arguments constructor. class GTEST_API_ ScopedFakeTestPartResultReporter : public TestPartResultReporterInterface { public: // The two possible mocking modes of this object. enum InterceptMode { INTERCEPT_ONLY_CURRENT_THREAD, // Intercepts only thread local failures. INTERCEPT_ALL_THREADS // Intercepts all failures. }; // The c'tor sets this object as the test part result reporter used // by Google Test. The 'result' parameter specifies where to report the // results. This reporter will only catch failures generated in the current // thread. DEPRECATED explicit ScopedFakeTestPartResultReporter(TestPartResultArray* result); // Same as above, but you can choose the interception scope of this object. ScopedFakeTestPartResultReporter(InterceptMode intercept_mode, TestPartResultArray* result); // The d'tor restores the previous test part result reporter. virtual ~ScopedFakeTestPartResultReporter(); // Appends the TestPartResult object to the TestPartResultArray // received in the constructor. // // This method is from the TestPartResultReporterInterface // interface. virtual void ReportTestPartResult(const TestPartResult& result); private: void Init(); const InterceptMode intercept_mode_; TestPartResultReporterInterface* old_reporter_; TestPartResultArray* const result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedFakeTestPartResultReporter); }; namespace internal { // A helper class for implementing EXPECT_FATAL_FAILURE() and // EXPECT_NONFATAL_FAILURE(). Its destructor verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. class GTEST_API_ SingleFailureChecker { public: // The constructor remembers the arguments. SingleFailureChecker(const TestPartResultArray* results, TestPartResult::Type type, const string& substr); ~SingleFailureChecker(); private: const TestPartResultArray* const results_; const TestPartResult::Type type_; const string substr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker); }; } // namespace internal } // namespace testing // A set of macros for testing Google Test assertions or code that's expected // to generate Google Test fatal failures. It verifies that the given // statement will cause exactly one fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_FATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_FATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - 'statement' cannot reference local non-static variables or // non-static members of the current object. // - 'statement' cannot return a value. // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. The AcceptsMacroThatExpandsToUnprotectedComma test in // gtest_unittest.cc will fail to compile if we do that. #define EXPECT_FATAL_FAILURE(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ALL_THREADS, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) // A macro for testing Google Test assertions or code that's expected to // generate Google Test non-fatal failures. It asserts that the given // statement will cause exactly one non-fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_NONFATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // 'statement' is allowed to reference local variables and members of // the current object. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. If we do that, the code won't compile when the user gives // EXPECT_NONFATAL_FAILURE() a statement that contains a macro that // expands to code containing an unprotected comma. The // AcceptsMacroThatExpandsToUnprotectedComma test in gtest_unittest.cc // catches that. // // For the same reason, we have to write // if (::testing::internal::AlwaysTrue()) { statement; } // instead of // GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) // to avoid an MSVC warning on unreachable code. #define EXPECT_NONFATAL_FAILURE(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS,\ >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #endif // GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #include #include #include #include #include #include #include #include #include // NOLINT #include #include #if GTEST_OS_LINUX // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # include // NOLINT # include // NOLINT // Declares vsnprintf(). This header is not available on Windows. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # include #elif GTEST_OS_SYMBIAN # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT #elif GTEST_OS_ZOS # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT // On z/OS we additionally need strings.h for strcasecmp. # include // NOLINT #elif GTEST_OS_WINDOWS_MOBILE // We are on Windows CE. # include // NOLINT #elif GTEST_OS_WINDOWS // We are on Windows proper. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # if GTEST_OS_WINDOWS_MINGW // MinGW has gettimeofday() but not _ftime64(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). // TODO(kenton@google.com): There are other ways to get the time on // Windows, like GetTickCount() or GetSystemTimeAsFileTime(). MinGW // supports these. consider using them instead. # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # endif // GTEST_OS_WINDOWS_MINGW // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT #else // Assume other platforms have gettimeofday(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT # include // NOLINT #endif // GTEST_OS_LINUX #if GTEST_HAS_EXCEPTIONS # include #endif #if GTEST_CAN_STREAM_RESULTS_ # include // NOLINT # include // NOLINT #endif // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Utility functions and classes used by the Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // // This file contains purely Google Test's internal implementation. Please // DO NOT #INCLUDE IT IN A USER PROGRAM. #ifndef GTEST_SRC_GTEST_INTERNAL_INL_H_ #define GTEST_SRC_GTEST_INTERNAL_INL_H_ // GTEST_IMPLEMENTATION_ is defined to 1 iff the current translation unit is // part of Google Test's implementation; otherwise it's undefined. #if !GTEST_IMPLEMENTATION_ // A user is trying to include this from his code - just say no. # error "gtest-internal-inl.h is part of Google Test's internal implementation." # error "It must not be included except by Google Test itself." #endif // GTEST_IMPLEMENTATION_ #ifndef _WIN32_WCE # include #endif // !_WIN32_WCE #include #include // For strtoll/_strtoul64/malloc/free. #include // For memmove. #include #include #include #if GTEST_OS_WINDOWS # include // NOLINT #endif // GTEST_OS_WINDOWS namespace testing { // Declares the flags. // // We don't want the users to modify this flag in the code, but want // Google Test's own unit tests to be able to access it. Therefore we // declare it here as opposed to in gtest.h. GTEST_DECLARE_bool_(death_test_use_fork); namespace internal { // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). GTEST_API_ extern const TypeId kTestTypeIdInGoogleTest; // Names of the flags (needed for parsing Google Test flags). const char kAlsoRunDisabledTestsFlag[] = "also_run_disabled_tests"; const char kBreakOnFailureFlag[] = "break_on_failure"; const char kCatchExceptionsFlag[] = "catch_exceptions"; const char kColorFlag[] = "color"; const char kFilterFlag[] = "filter"; const char kListTestsFlag[] = "list_tests"; const char kOutputFlag[] = "output"; const char kPrintTimeFlag[] = "print_time"; const char kRandomSeedFlag[] = "random_seed"; const char kRepeatFlag[] = "repeat"; const char kShuffleFlag[] = "shuffle"; const char kStackTraceDepthFlag[] = "stack_trace_depth"; const char kStreamResultToFlag[] = "stream_result_to"; const char kThrowOnFailureFlag[] = "throw_on_failure"; // A valid random seed must be in [1, kMaxRandomSeed]. const int kMaxRandomSeed = 99999; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. GTEST_API_ extern bool g_help_flag; // Returns the current time in milliseconds. GTEST_API_ TimeInMillis GetTimeInMillis(); // Returns true iff Google Test should use colors in the output. GTEST_API_ bool ShouldUseColor(bool stdout_is_tty); // Formats the given time in milliseconds as seconds. GTEST_API_ std::string FormatTimeInMillisAsSeconds(TimeInMillis ms); // Parses a string for an Int32 flag, in the form of "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. GTEST_API_ bool ParseInt32Flag( const char* str, const char* flag, Int32* value); // Returns a random seed in range [1, kMaxRandomSeed] based on the // given --gtest_random_seed flag value. inline int GetRandomSeedFromFlag(Int32 random_seed_flag) { const unsigned int raw_seed = (random_seed_flag == 0) ? static_cast(GetTimeInMillis()) : static_cast(random_seed_flag); // Normalizes the actual seed to range [1, kMaxRandomSeed] such that // it's easy to type. const int normalized_seed = static_cast((raw_seed - 1U) % static_cast(kMaxRandomSeed)) + 1; return normalized_seed; } // Returns the first valid random seed after 'seed'. The behavior is // undefined if 'seed' is invalid. The seed after kMaxRandomSeed is // considered to be 1. inline int GetNextRandomSeed(int seed) { GTEST_CHECK_(1 <= seed && seed <= kMaxRandomSeed) << "Invalid random seed " << seed << " - must be in [1, " << kMaxRandomSeed << "]."; const int next_seed = seed + 1; return (next_seed > kMaxRandomSeed) ? 1 : next_seed; } // This class saves the values of all Google Test flags in its c'tor, and // restores them in its d'tor. class GTestFlagSaver { public: // The c'tor. GTestFlagSaver() { also_run_disabled_tests_ = GTEST_FLAG(also_run_disabled_tests); break_on_failure_ = GTEST_FLAG(break_on_failure); catch_exceptions_ = GTEST_FLAG(catch_exceptions); color_ = GTEST_FLAG(color); death_test_style_ = GTEST_FLAG(death_test_style); death_test_use_fork_ = GTEST_FLAG(death_test_use_fork); filter_ = GTEST_FLAG(filter); internal_run_death_test_ = GTEST_FLAG(internal_run_death_test); list_tests_ = GTEST_FLAG(list_tests); output_ = GTEST_FLAG(output); print_time_ = GTEST_FLAG(print_time); random_seed_ = GTEST_FLAG(random_seed); repeat_ = GTEST_FLAG(repeat); shuffle_ = GTEST_FLAG(shuffle); stack_trace_depth_ = GTEST_FLAG(stack_trace_depth); stream_result_to_ = GTEST_FLAG(stream_result_to); throw_on_failure_ = GTEST_FLAG(throw_on_failure); } // The d'tor is not virtual. DO NOT INHERIT FROM THIS CLASS. ~GTestFlagSaver() { GTEST_FLAG(also_run_disabled_tests) = also_run_disabled_tests_; GTEST_FLAG(break_on_failure) = break_on_failure_; GTEST_FLAG(catch_exceptions) = catch_exceptions_; GTEST_FLAG(color) = color_; GTEST_FLAG(death_test_style) = death_test_style_; GTEST_FLAG(death_test_use_fork) = death_test_use_fork_; GTEST_FLAG(filter) = filter_; GTEST_FLAG(internal_run_death_test) = internal_run_death_test_; GTEST_FLAG(list_tests) = list_tests_; GTEST_FLAG(output) = output_; GTEST_FLAG(print_time) = print_time_; GTEST_FLAG(random_seed) = random_seed_; GTEST_FLAG(repeat) = repeat_; GTEST_FLAG(shuffle) = shuffle_; GTEST_FLAG(stack_trace_depth) = stack_trace_depth_; GTEST_FLAG(stream_result_to) = stream_result_to_; GTEST_FLAG(throw_on_failure) = throw_on_failure_; } private: // Fields for saving the original values of flags. bool also_run_disabled_tests_; bool break_on_failure_; bool catch_exceptions_; String color_; String death_test_style_; bool death_test_use_fork_; String filter_; String internal_run_death_test_; bool list_tests_; String output_; bool print_time_; bool pretty_; internal::Int32 random_seed_; internal::Int32 repeat_; bool shuffle_; internal::Int32 stack_trace_depth_; String stream_result_to_; bool throw_on_failure_; } GTEST_ATTRIBUTE_UNUSED_; // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. GTEST_API_ char* CodePointToUtf8(UInt32 code_point, char* str); // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. GTEST_API_ String WideStringToUtf8(const wchar_t* str, int num_chars); // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded(); // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (e.g., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. GTEST_API_ bool ShouldShard(const char* total_shards_str, const char* shard_index_str, bool in_subprocess_for_death_test); // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error and // and aborts. GTEST_API_ Int32 Int32FromEnvOrDie(const char* env_var, Int32 default_val); // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. GTEST_API_ bool ShouldRunTestOnShard( int total_shards, int shard_index, int test_id); // STL container utilities. // Returns the number of elements in the given container that satisfy // the given predicate. template inline int CountIf(const Container& c, Predicate predicate) { // Implemented as an explicit loop since std::count_if() in libCstd on // Solaris has a non-standard signature. int count = 0; for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) { if (predicate(*it)) ++count; } return count; } // Applies a function/functor to each element in the container. template void ForEach(const Container& c, Functor functor) { std::for_each(c.begin(), c.end(), functor); } // Returns the i-th element of the vector, or default_value if i is not // in range [0, v.size()). template inline E GetElementOr(const std::vector& v, int i, E default_value) { return (i < 0 || i >= static_cast(v.size())) ? default_value : v[i]; } // Performs an in-place shuffle of a range of the vector's elements. // 'begin' and 'end' are element indices as an STL-style range; // i.e. [begin, end) are shuffled, where 'end' == size() means to // shuffle to the end of the vector. template void ShuffleRange(internal::Random* random, int begin, int end, std::vector* v) { const int size = static_cast(v->size()); GTEST_CHECK_(0 <= begin && begin <= size) << "Invalid shuffle range start " << begin << ": must be in range [0, " << size << "]."; GTEST_CHECK_(begin <= end && end <= size) << "Invalid shuffle range finish " << end << ": must be in range [" << begin << ", " << size << "]."; // Fisher-Yates shuffle, from // http://en.wikipedia.org/wiki/Fisher-Yates_shuffle for (int range_width = end - begin; range_width >= 2; range_width--) { const int last_in_range = begin + range_width - 1; const int selected = begin + random->Generate(range_width); std::swap((*v)[selected], (*v)[last_in_range]); } } // Performs an in-place shuffle of the vector's elements. template inline void Shuffle(internal::Random* random, std::vector* v) { ShuffleRange(random, 0, static_cast(v->size()), v); } // A function for deleting an object. Handy for being used as a // functor. template static void Delete(T* x) { delete x; } // A predicate that checks the key of a TestProperty against a known key. // // TestPropertyKeyIs is copyable. class TestPropertyKeyIs { public: // Constructor. // // TestPropertyKeyIs has NO default constructor. explicit TestPropertyKeyIs(const char* key) : key_(key) {} // Returns true iff the test name of test property matches on key_. bool operator()(const TestProperty& test_property) const { return String(test_property.key()).Compare(key_) == 0; } private: String key_; }; // Class UnitTestOptions. // // This class contains functions for processing options the user // specifies when running the tests. It has only static members. // // In most cases, the user can specify an option using either an // environment variable or a command line flag. E.g. you can set the // test filter using either GTEST_FILTER or --gtest_filter. If both // the variable and the flag are present, the latter overrides the // former. class GTEST_API_ UnitTestOptions { public: // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. static String GetOutputFormat(); // Returns the absolute path of the requested output file, or the // default (test_detail.xml in the original working directory) if // none was explicitly specified. static String GetAbsolutePathToOutputFile(); // Functions for processing the gtest_filter flag. // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. static bool PatternMatchesString(const char *pattern, const char *str); // Returns true iff the user-specified filter matches the test case // name and the test name. static bool FilterMatchesTest(const String &test_case_name, const String &test_name); #if GTEST_OS_WINDOWS // Function for supporting the gtest_catch_exception flag. // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. static int GTestShouldProcessSEH(DWORD exception_code); #endif // GTEST_OS_WINDOWS // Returns true if "name" matches the ':' separated list of glob-style // filters in "filter". static bool MatchesFilter(const String& name, const char* filter); }; // Returns the current application's name, removing directory path if that // is present. Used by UnitTestOptions::GetOutputFile. GTEST_API_ FilePath GetCurrentExecutableName(); // The role interface for getting the OS stack trace as a string. class OsStackTraceGetterInterface { public: OsStackTraceGetterInterface() {} virtual ~OsStackTraceGetterInterface() {} // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. virtual String CurrentStackTrace(int max_depth, int skip_count) = 0; // UponLeavingGTest() should be called immediately before Google Test calls // user code. It saves some information about the current stack that // CurrentStackTrace() will use to find and hide Google Test stack frames. virtual void UponLeavingGTest() = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetterInterface); }; // A working implementation of the OsStackTraceGetterInterface interface. class OsStackTraceGetter : public OsStackTraceGetterInterface { public: OsStackTraceGetter() : caller_frame_(NULL) {} virtual String CurrentStackTrace(int max_depth, int skip_count); virtual void UponLeavingGTest(); // This string is inserted in place of stack frames that are part of // Google Test's implementation. static const char* const kElidedFramesMarker; private: Mutex mutex_; // protects all internal state // We save the stack frame below the frame that calls user code. // We do this because the address of the frame immediately below // the user code changes between the call to UponLeavingGTest() // and any calls to CurrentStackTrace() from within the user code. void* caller_frame_; GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter); }; // Information about a Google Test trace point. struct TraceInfo { const char* file; int line; String message; }; // This is the default global test part result reporter used in UnitTestImpl. // This class should only be used by UnitTestImpl. class DefaultGlobalTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultGlobalTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. Reports the test part // result in the current test. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultGlobalTestPartResultReporter); }; // This is the default per thread test part result reporter used in // UnitTestImpl. This class should only be used by UnitTestImpl. class DefaultPerThreadTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultPerThreadTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. The implementation just // delegates to the current global test part result reporter of *unit_test_. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultPerThreadTestPartResultReporter); }; // The private implementation of the UnitTest class. We don't protect // the methods under a mutex, as this class is not accessible by a // user and the UnitTest class that delegates work to this class does // proper locking. class GTEST_API_ UnitTestImpl { public: explicit UnitTestImpl(UnitTest* parent); virtual ~UnitTestImpl(); // There are two different ways to register your own TestPartResultReporter. // You can register your own repoter to listen either only for test results // from the current thread or for results from all threads. // By default, each per-thread test result repoter just passes a new // TestPartResult to the global test result reporter, which registers the // test part result for the currently running test. // Returns the global test part result reporter. TestPartResultReporterInterface* GetGlobalTestPartResultReporter(); // Sets the global test part result reporter. void SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter); // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* GetTestPartResultReporterForCurrentThread(); // Sets the test part result reporter for the current thread. void SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter); // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const { return !Failed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const { return failed_test_case_count() > 0 || ad_hoc_test_result()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[i]; } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i) { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[index]; } // Provides access to the event listener list. TestEventListeners* listeners() { return &listeners_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* current_test_result(); // Returns the TestResult for the ad hoc test. const TestResult* ad_hoc_test_result() const { return &ad_hoc_test_result_; } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter // are the same; otherwise, deletes the old getter and makes the // input the current getter. void set_os_stack_trace_getter(OsStackTraceGetterInterface* getter); // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* os_stack_trace_getter(); // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String CurrentOsStackTraceExceptTop(int skip_count); // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Adds a TestInfo to the unit test. // // Arguments: // // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // test_info: the TestInfo object void AddTestInfo(Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, TestInfo* test_info) { // In order to support thread-safe death tests, we need to // remember the original working directory when the test program // was first invoked. We cannot do this in RUN_ALL_TESTS(), as // the user may have changed the current directory before calling // RUN_ALL_TESTS(). Therefore we capture the current directory in // AddTestInfo(), which is called to register a TEST or TEST_F // before main() is reached. if (original_working_dir_.IsEmpty()) { original_working_dir_.Set(FilePath::GetCurrentDir()); GTEST_CHECK_(!original_working_dir_.IsEmpty()) << "Failed to get the current working directory."; } GetTestCase(test_info->test_case_name(), test_info->type_param(), set_up_tc, tear_down_tc)->AddTestInfo(test_info); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. internal::ParameterizedTestCaseRegistry& parameterized_test_registry() { return parameterized_test_registry_; } #endif // GTEST_HAS_PARAM_TEST // Sets the TestCase object for the test that's currently running. void set_current_test_case(TestCase* a_current_test_case) { current_test_case_ = a_current_test_case; } // Sets the TestInfo object for the test that's currently running. If // current_test_info is NULL, the assertion results will be stored in // ad_hoc_test_result_. void set_current_test_info(TestInfo* a_current_test_info) { current_test_info_ = a_current_test_info; } // Registers all parameterized tests defined using TEST_P and // INSTANTIATE_TEST_CASE_P, creating regular tests for each test/parameter // combination. This method can be called more then once; it has guards // protecting from registering the tests more then once. If // value-parameterized tests are disabled, RegisterParameterizedTests is // present but does nothing. void RegisterParameterizedTests(); // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, this test is considered to be failed, but // the rest of the tests will still be run. bool RunAllTests(); // Clears the results of all tests, except the ad hoc tests. void ClearNonAdHocTestResult() { ForEach(test_cases_, TestCase::ClearTestCaseResult); } // Clears the results of ad-hoc test assertions. void ClearAdHocTestResult() { ad_hoc_test_result_.Clear(); } enum ReactionToSharding { HONOR_SHARDING_PROTOCOL, IGNORE_SHARDING_PROTOCOL }; // Matches the full name of each test against the user-specified // filter to decide whether the test should run, then records the // result in each TestCase and TestInfo object. // If shard_tests == HONOR_SHARDING_PROTOCOL, further filters tests // based on sharding variables in the environment. // Returns the number of tests that should run. int FilterTests(ReactionToSharding shard_tests); // Prints the names of the tests matching the user-specified filter flag. void ListTestsMatchingFilter(); const TestCase* current_test_case() const { return current_test_case_; } TestInfo* current_test_info() { return current_test_info_; } const TestInfo* current_test_info() const { return current_test_info_; } // Returns the vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector& environments() { return environments_; } // Getters for the per-thread Google Test trace stack. std::vector& gtest_trace_stack() { return *(gtest_trace_stack_.pointer()); } const std::vector& gtest_trace_stack() const { return gtest_trace_stack_.get(); } #if GTEST_HAS_DEATH_TEST void InitDeathTestSubprocessControlInfo() { internal_run_death_test_flag_.reset(ParseInternalRunDeathTestFlag()); } // Returns a pointer to the parsed --gtest_internal_run_death_test // flag, or NULL if that flag was not specified. // This information is useful only in a death test child process. // Must not be called before a call to InitGoogleTest. const InternalRunDeathTestFlag* internal_run_death_test_flag() const { return internal_run_death_test_flag_.get(); } // Returns a pointer to the current death test factory. internal::DeathTestFactory* death_test_factory() { return death_test_factory_.get(); } void SuppressTestEventsIfInSubprocess(); friend class ReplaceDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST // Initializes the event listener performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Initializes the event listener for streaming test results to a socket. // Must not be called before InitGoogleTest. void ConfigureStreamingOutput(); #endif // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void PostFlagParsingInit(); // Gets the random seed used at the start of the current test iteration. int random_seed() const { return random_seed_; } // Gets the random number generator. internal::Random* random() { return &random_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void ShuffleTests(); // Restores the test cases and tests to their order before the first shuffle. void UnshuffleTests(); // Returns the value of GTEST_FLAG(catch_exceptions) at the moment // UnitTest::Run() starts. bool catch_exceptions() const { return catch_exceptions_; } private: friend class ::testing::UnitTest; // Used by UnitTest::Run() to capture the state of // GTEST_FLAG(catch_exceptions) at the moment it starts. void set_catch_exceptions(bool value) { catch_exceptions_ = value; } // The UnitTest object that owns this implementation object. UnitTest* const parent_; // The working directory when the first TEST() or TEST_F() was // executed. internal::FilePath original_working_dir_; // The default test part result reporters. DefaultGlobalTestPartResultReporter default_global_test_part_result_reporter_; DefaultPerThreadTestPartResultReporter default_per_thread_test_part_result_reporter_; // Points to (but doesn't own) the global test part result reporter. TestPartResultReporterInterface* global_test_part_result_repoter_; // Protects read and write access to global_test_part_result_reporter_. internal::Mutex global_test_part_result_reporter_mutex_; // Points to (but doesn't own) the per-thread test part result reporter. internal::ThreadLocal per_thread_test_part_result_reporter_; // The vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector environments_; // The vector of TestCases in their original order. It owns the // elements in the vector. std::vector test_cases_; // Provides a level of indirection for the test case list to allow // easy shuffling and restoring the test case order. The i-th // element of this vector is the index of the i-th test case in the // shuffled order. std::vector test_case_indices_; #if GTEST_HAS_PARAM_TEST // ParameterizedTestRegistry object used to register value-parameterized // tests. internal::ParameterizedTestCaseRegistry parameterized_test_registry_; // Indicates whether RegisterParameterizedTests() has been called already. bool parameterized_tests_registered_; #endif // GTEST_HAS_PARAM_TEST // Index of the last death test case registered. Initially -1. int last_death_test_case_; // This points to the TestCase for the currently running test. It // changes as Google Test goes through one test case after another. // When no test is running, this is set to NULL and Google Test // stores assertion results in ad_hoc_test_result_. Initially NULL. TestCase* current_test_case_; // This points to the TestInfo for the currently running test. It // changes as Google Test goes through one test after another. When // no test is running, this is set to NULL and Google Test stores // assertion results in ad_hoc_test_result_. Initially NULL. TestInfo* current_test_info_; // Normally, a user only writes assertions inside a TEST or TEST_F, // or inside a function called by a TEST or TEST_F. Since Google // Test keeps track of which test is current running, it can // associate such an assertion with the test it belongs to. // // If an assertion is encountered when no TEST or TEST_F is running, // Google Test attributes the assertion result to an imaginary "ad hoc" // test, and records the result in ad_hoc_test_result_. TestResult ad_hoc_test_result_; // The list of event listeners that can be used to track events inside // Google Test. TestEventListeners listeners_; // The OS stack trace getter. Will be deleted when the UnitTest // object is destructed. By default, an OsStackTraceGetter is used, // but the user can set this field to use a custom getter if that is // desired. OsStackTraceGetterInterface* os_stack_trace_getter_; // True iff PostFlagParsingInit() has been called. bool post_flag_parse_init_performed_; // The random number seed used at the beginning of the test run. int random_seed_; // Our random number generator. internal::Random random_; // How long the test took to run, in milliseconds. TimeInMillis elapsed_time_; #if GTEST_HAS_DEATH_TEST // The decomposed components of the gtest_internal_run_death_test flag, // parsed when RUN_ALL_TESTS is called. internal::scoped_ptr internal_run_death_test_flag_; internal::scoped_ptr death_test_factory_; #endif // GTEST_HAS_DEATH_TEST // A per-thread stack of traces created by the SCOPED_TRACE() macro. internal::ThreadLocal > gtest_trace_stack_; // The value of GTEST_FLAG(catch_exceptions) at the moment RunAllTests() // starts. bool catch_exceptions_; GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTestImpl); }; // class UnitTestImpl // Convenience function for accessing the global UnitTest // implementation object. inline UnitTestImpl* GetUnitTestImpl() { return UnitTest::GetInstance()->impl(); } #if GTEST_USES_SIMPLE_RE // Internal helper functions for implementing the simple regular // expression matcher. GTEST_API_ bool IsInSet(char ch, const char* str); GTEST_API_ bool IsAsciiDigit(char ch); GTEST_API_ bool IsAsciiPunct(char ch); GTEST_API_ bool IsRepeat(char ch); GTEST_API_ bool IsAsciiWhiteSpace(char ch); GTEST_API_ bool IsAsciiWordChar(char ch); GTEST_API_ bool IsValidEscape(char ch); GTEST_API_ bool AtomMatchesChar(bool escaped, char pattern, char ch); GTEST_API_ bool ValidateRegex(const char* regex); GTEST_API_ bool MatchRegexAtHead(const char* regex, const char* str); GTEST_API_ bool MatchRepetitionAndRegexAtHead( bool escaped, char ch, char repeat, const char* regex, const char* str); GTEST_API_ bool MatchRegexAnywhere(const char* regex, const char* str); #endif // GTEST_USES_SIMPLE_RE // Parses the command line for Google Test flags, without initializing // other parts of Google Test. GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, char** argv); GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv); #if GTEST_HAS_DEATH_TEST // Returns the message describing the last system error, regardless of the // platform. GTEST_API_ String GetLastErrnoDescription(); # if GTEST_OS_WINDOWS // Provides leak-safe Windows kernel handle ownership. class AutoHandle { public: AutoHandle() : handle_(INVALID_HANDLE_VALUE) {} explicit AutoHandle(HANDLE handle) : handle_(handle) {} ~AutoHandle() { Reset(); } HANDLE Get() const { return handle_; } void Reset() { Reset(INVALID_HANDLE_VALUE); } void Reset(HANDLE handle) { if (handle != handle_) { if (handle_ != INVALID_HANDLE_VALUE) ::CloseHandle(handle_); handle_ = handle; } } private: HANDLE handle_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AutoHandle); }; # endif // GTEST_OS_WINDOWS // Attempts to parse a string into a positive integer pointed to by the // number parameter. Returns true if that is possible. // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we can use // it here. template bool ParseNaturalNumber(const ::std::string& str, Integer* number) { // Fail fast if the given string does not begin with a digit; // this bypasses strtoXXX's "optional leading whitespace and plus // or minus sign" semantics, which are undesirable here. if (str.empty() || !IsDigit(str[0])) { return false; } errno = 0; char* end; // BiggestConvertible is the largest integer type that system-provided // string-to-number conversion routines can return. # if GTEST_OS_WINDOWS && !defined(__GNUC__) // MSVC and C++ Builder define __int64 instead of the standard long long. typedef unsigned __int64 BiggestConvertible; const BiggestConvertible parsed = _strtoui64(str.c_str(), &end, 10); # else typedef unsigned long long BiggestConvertible; // NOLINT const BiggestConvertible parsed = strtoull(str.c_str(), &end, 10); # endif // GTEST_OS_WINDOWS && !defined(__GNUC__) const bool parse_success = *end == '\0' && errno == 0; // TODO(vladl@google.com): Convert this to compile time assertion when it is // available. GTEST_CHECK_(sizeof(Integer) <= sizeof(parsed)); const Integer result = static_cast(parsed); if (parse_success && static_cast(result) == parsed) { *number = result; return true; } return false; } #endif // GTEST_HAS_DEATH_TEST // TestResult contains some private methods that should be hidden from // Google Test user but are required for testing. This class allow our tests // to access them. // // This class is supplied only for the purpose of testing Google Test's own // constructs. Do not use it in user tests, either directly or indirectly. class TestResultAccessor { public: static void RecordProperty(TestResult* test_result, const TestProperty& property) { test_result->RecordProperty(property); } static void ClearTestPartResults(TestResult* test_result) { test_result->ClearTestPartResults(); } static const std::vector& test_part_results( const TestResult& test_result) { return test_result.test_part_results(); } }; } // namespace internal } // namespace testing #endif // GTEST_SRC_GTEST_INTERNAL_INL_H_ #undef GTEST_IMPLEMENTATION_ #if GTEST_OS_WINDOWS # define vsnprintf _vsnprintf #endif // GTEST_OS_WINDOWS namespace testing { using internal::CountIf; using internal::ForEach; using internal::GetElementOr; using internal::Shuffle; // Constants. // A test whose test case name or test name matches this filter is // disabled and not run. static const char kDisableTestFilter[] = "DISABLED_*:*/DISABLED_*"; // A test case whose name matches this filter is considered a death // test case and will be run before test cases whose name doesn't // match this filter. static const char kDeathTestCaseFilter[] = "*DeathTest:*DeathTest/*"; // A test filter that matches everything. static const char kUniversalFilter[] = "*"; // The default output file for XML output. static const char kDefaultOutputFile[] = "test_detail.xml"; // The environment variable name for the test shard index. static const char kTestShardIndex[] = "GTEST_SHARD_INDEX"; // The environment variable name for the total number of test shards. static const char kTestTotalShards[] = "GTEST_TOTAL_SHARDS"; // The environment variable name for the test shard status file. static const char kTestShardStatusFile[] = "GTEST_SHARD_STATUS_FILE"; namespace internal { // The text used in failure messages to indicate the start of the // stack trace. const char kStackTraceMarker[] = "\nStack trace:\n"; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. bool g_help_flag = false; } // namespace internal GTEST_DEFINE_bool_( also_run_disabled_tests, internal::BoolFromGTestEnv("also_run_disabled_tests", false), "Run disabled tests too, in addition to the tests normally being run."); GTEST_DEFINE_bool_( break_on_failure, internal::BoolFromGTestEnv("break_on_failure", false), "True iff a failed assertion should be a debugger break-point."); GTEST_DEFINE_bool_( catch_exceptions, internal::BoolFromGTestEnv("catch_exceptions", true), "True iff " GTEST_NAME_ " should catch exceptions and treat them as test failures."); GTEST_DEFINE_string_( color, internal::StringFromGTestEnv("color", "auto"), "Whether to use colors in the output. Valid values: yes, no, " "and auto. 'auto' means to use colors if the output is " "being sent to a terminal and the TERM environment variable " "is set to xterm, xterm-color, xterm-256color, linux or cygwin."); GTEST_DEFINE_string_( filter, internal::StringFromGTestEnv("filter", kUniversalFilter), "A colon-separated list of glob (not regex) patterns " "for filtering the tests to run, optionally followed by a " "'-' and a : separated list of negative patterns (tests to " "exclude). A test is run if it matches one of the positive " "patterns and does not match any of the negative patterns."); GTEST_DEFINE_bool_(list_tests, false, "List all tests without running them."); GTEST_DEFINE_string_( output, internal::StringFromGTestEnv("output", ""), "A format (currently must be \"xml\"), optionally followed " "by a colon and an output file name or directory. A directory " "is indicated by a trailing pathname separator. " "Examples: \"xml:filename.xml\", \"xml::directoryname/\". " "If a directory is specified, output files will be created " "within that directory, with file-names based on the test " "executable's name and, if necessary, made unique by adding " "digits."); GTEST_DEFINE_bool_( print_time, internal::BoolFromGTestEnv("print_time", true), "True iff " GTEST_NAME_ " should display elapsed time in text output."); GTEST_DEFINE_int32_( random_seed, internal::Int32FromGTestEnv("random_seed", 0), "Random number seed to use when shuffling test orders. Must be in range " "[1, 99999], or 0 to use a seed based on the current time."); GTEST_DEFINE_int32_( repeat, internal::Int32FromGTestEnv("repeat", 1), "How many times to repeat each test. Specify a negative number " "for repeating forever. Useful for shaking out flaky tests."); GTEST_DEFINE_bool_( show_internal_stack_frames, false, "True iff " GTEST_NAME_ " should include internal stack frames when " "printing test failure stack traces."); GTEST_DEFINE_bool_( shuffle, internal::BoolFromGTestEnv("shuffle", false), "True iff " GTEST_NAME_ " should randomize tests' order on every run."); GTEST_DEFINE_int32_( stack_trace_depth, internal::Int32FromGTestEnv("stack_trace_depth", kMaxStackTraceDepth), "The maximum number of stack frames to print when an " "assertion fails. The valid range is 0 through 100, inclusive."); GTEST_DEFINE_string_( stream_result_to, internal::StringFromGTestEnv("stream_result_to", ""), "This flag specifies the host name and the port number on which to stream " "test results. Example: \"localhost:555\". The flag is effective only on " "Linux."); GTEST_DEFINE_bool_( throw_on_failure, internal::BoolFromGTestEnv("throw_on_failure", false), "When this flag is specified, a failed assertion will throw an exception " "if exceptions are enabled or exit the program with a non-zero code " "otherwise."); namespace internal { // Generates a random number from [0, range), using a Linear // Congruential Generator (LCG). Crashes if 'range' is 0 or greater // than kMaxRange. UInt32 Random::Generate(UInt32 range) { // These constants are the same as are used in glibc's rand(3). state_ = (1103515245U*state_ + 12345U) % kMaxRange; GTEST_CHECK_(range > 0) << "Cannot generate a number in the range [0, 0)."; GTEST_CHECK_(range <= kMaxRange) << "Generation of a number in [0, " << range << ") was requested, " << "but this can only generate numbers in [0, " << kMaxRange << ")."; // Converting via modulus introduces a bit of downward bias, but // it's simple, and a linear congruential generator isn't too good // to begin with. return state_ % range; } // GTestIsInitialized() returns true iff the user has initialized // Google Test. Useful for catching the user mistake of not initializing // Google Test before calling RUN_ALL_TESTS(). // // A user must call testing::InitGoogleTest() to initialize Google // Test. g_init_gtest_count is set to the number of times // InitGoogleTest() has been called. We don't protect this variable // under a mutex as it is only accessed in the main thread. int g_init_gtest_count = 0; static bool GTestIsInitialized() { return g_init_gtest_count != 0; } // Iterates over a vector of TestCases, keeping a running sum of the // results of calling a given int-returning method on each. // Returns the sum. static int SumOverTestCaseList(const std::vector& case_list, int (TestCase::*method)() const) { int sum = 0; for (size_t i = 0; i < case_list.size(); i++) { sum += (case_list[i]->*method)(); } return sum; } // Returns true iff the test case passed. static bool TestCasePassed(const TestCase* test_case) { return test_case->should_run() && test_case->Passed(); } // Returns true iff the test case failed. static bool TestCaseFailed(const TestCase* test_case) { return test_case->should_run() && test_case->Failed(); } // Returns true iff test_case contains at least one test that should // run. static bool ShouldRunTestCase(const TestCase* test_case) { return test_case->should_run(); } // AssertHelper constructor. AssertHelper::AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message) : data_(new AssertHelperData(type, file, line, message)) { } AssertHelper::~AssertHelper() { delete data_; } // Message assignment, for assertion streaming support. void AssertHelper::operator=(const Message& message) const { UnitTest::GetInstance()-> AddTestPartResult(data_->type, data_->file, data_->line, AppendUserMessage(data_->message, message), UnitTest::GetInstance()->impl() ->CurrentOsStackTraceExceptTop(1) // Skips the stack frame for this function itself. ); // NOLINT } // Mutex for linked pointers. GTEST_DEFINE_STATIC_MUTEX_(g_linked_ptr_mutex); // Application pathname gotten in InitGoogleTest. String g_executable_path; // Returns the current application's name, removing directory path if that // is present. FilePath GetCurrentExecutableName() { FilePath result; #if GTEST_OS_WINDOWS result.Set(FilePath(g_executable_path).RemoveExtension("exe")); #else result.Set(FilePath(g_executable_path)); #endif // GTEST_OS_WINDOWS return result.RemoveDirectoryName(); } // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. String UnitTestOptions::GetOutputFormat() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); return (colon == NULL) ? String(gtest_output_flag) : String(gtest_output_flag, colon - gtest_output_flag); } // Returns the name of the requested output file, or the default if none // was explicitly specified. String UnitTestOptions::GetAbsolutePathToOutputFile() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); if (colon == NULL) return String(internal::FilePath::ConcatPaths( internal::FilePath( UnitTest::GetInstance()->original_working_dir()), internal::FilePath(kDefaultOutputFile)).ToString() ); internal::FilePath output_name(colon + 1); if (!output_name.IsAbsolutePath()) // TODO(wan@google.com): on Windows \some\path is not an absolute // path (as its meaning depends on the current drive), yet the // following logic for turning it into an absolute path is wrong. // Fix it. output_name = internal::FilePath::ConcatPaths( internal::FilePath(UnitTest::GetInstance()->original_working_dir()), internal::FilePath(colon + 1)); if (!output_name.IsDirectory()) return output_name.ToString(); internal::FilePath result(internal::FilePath::GenerateUniqueFileName( output_name, internal::GetCurrentExecutableName(), GetOutputFormat().c_str())); return result.ToString(); } // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. bool UnitTestOptions::PatternMatchesString(const char *pattern, const char *str) { switch (*pattern) { case '\0': case ':': // Either ':' or '\0' marks the end of the pattern. return *str == '\0'; case '?': // Matches any single character. return *str != '\0' && PatternMatchesString(pattern + 1, str + 1); case '*': // Matches any string (possibly empty) of characters. return (*str != '\0' && PatternMatchesString(pattern, str + 1)) || PatternMatchesString(pattern + 1, str); default: // Non-special character. Matches itself. return *pattern == *str && PatternMatchesString(pattern + 1, str + 1); } } bool UnitTestOptions::MatchesFilter(const String& name, const char* filter) { const char *cur_pattern = filter; for (;;) { if (PatternMatchesString(cur_pattern, name.c_str())) { return true; } // Finds the next pattern in the filter. cur_pattern = strchr(cur_pattern, ':'); // Returns if no more pattern can be found. if (cur_pattern == NULL) { return false; } // Skips the pattern separater (the ':' character). cur_pattern++; } } // TODO(keithray): move String function implementations to gtest-string.cc. // Returns true iff the user-specified filter matches the test case // name and the test name. bool UnitTestOptions::FilterMatchesTest(const String &test_case_name, const String &test_name) { const String& full_name = String::Format("%s.%s", test_case_name.c_str(), test_name.c_str()); // Split --gtest_filter at '-', if there is one, to separate into // positive filter and negative filter portions const char* const p = GTEST_FLAG(filter).c_str(); const char* const dash = strchr(p, '-'); String positive; String negative; if (dash == NULL) { positive = GTEST_FLAG(filter).c_str(); // Whole string is a positive filter negative = String(""); } else { positive = String(p, dash - p); // Everything up to the dash negative = String(dash+1); // Everything after the dash if (positive.empty()) { // Treat '-test1' as the same as '*-test1' positive = kUniversalFilter; } } // A filter is a colon-separated list of patterns. It matches a // test if any pattern in it matches the test. return (MatchesFilter(full_name, positive.c_str()) && !MatchesFilter(full_name, negative.c_str())); } #if GTEST_HAS_SEH // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. int UnitTestOptions::GTestShouldProcessSEH(DWORD exception_code) { // Google Test should handle a SEH exception if: // 1. the user wants it to, AND // 2. this is not a breakpoint exception, AND // 3. this is not a C++ exception (VC++ implements them via SEH, // apparently). // // SEH exception code for C++ exceptions. // (see http://support.microsoft.com/kb/185294 for more information). const DWORD kCxxExceptionCode = 0xe06d7363; bool should_handle = true; if (!GTEST_FLAG(catch_exceptions)) should_handle = false; else if (exception_code == EXCEPTION_BREAKPOINT) should_handle = false; else if (exception_code == kCxxExceptionCode) should_handle = false; return should_handle ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH; } #endif // GTEST_HAS_SEH } // namespace internal // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. Intercepts only failures from the current thread. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( TestPartResultArray* result) : intercept_mode_(INTERCEPT_ONLY_CURRENT_THREAD), result_(result) { Init(); } // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( InterceptMode intercept_mode, TestPartResultArray* result) : intercept_mode_(intercept_mode), result_(result) { Init(); } void ScopedFakeTestPartResultReporter::Init() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { old_reporter_ = impl->GetGlobalTestPartResultReporter(); impl->SetGlobalTestPartResultReporter(this); } else { old_reporter_ = impl->GetTestPartResultReporterForCurrentThread(); impl->SetTestPartResultReporterForCurrentThread(this); } } // The d'tor restores the test part result reporter used by Google Test // before. ScopedFakeTestPartResultReporter::~ScopedFakeTestPartResultReporter() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { impl->SetGlobalTestPartResultReporter(old_reporter_); } else { impl->SetTestPartResultReporterForCurrentThread(old_reporter_); } } // Increments the test part result count and remembers the result. // This method is from the TestPartResultReporterInterface interface. void ScopedFakeTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { result_->Append(result); } namespace internal { // Returns the type ID of ::testing::Test. We should always call this // instead of GetTypeId< ::testing::Test>() to get the type ID of // testing::Test. This is to work around a suspected linker bug when // using Google Test as a framework on Mac OS X. The bug causes // GetTypeId< ::testing::Test>() to return different values depending // on whether the call is from the Google Test framework itself or // from user test code. GetTestTypeId() is guaranteed to always // return the same value, as it always calls GetTypeId<>() from the // gtest.cc, which is within the Google Test framework. TypeId GetTestTypeId() { return GetTypeId(); } // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). extern const TypeId kTestTypeIdInGoogleTest = GetTestTypeId(); // This predicate-formatter checks that 'results' contains a test part // failure of the given type and that the failure message contains the // given substring. AssertionResult HasOneFailure(const char* /* results_expr */, const char* /* type_expr */, const char* /* substr_expr */, const TestPartResultArray& results, TestPartResult::Type type, const string& substr) { const String expected(type == TestPartResult::kFatalFailure ? "1 fatal failure" : "1 non-fatal failure"); Message msg; if (results.size() != 1) { msg << "Expected: " << expected << "\n" << " Actual: " << results.size() << " failures"; for (int i = 0; i < results.size(); i++) { msg << "\n" << results.GetTestPartResult(i); } return AssertionFailure() << msg; } const TestPartResult& r = results.GetTestPartResult(0); if (r.type() != type) { return AssertionFailure() << "Expected: " << expected << "\n" << " Actual:\n" << r; } if (strstr(r.message(), substr.c_str()) == NULL) { return AssertionFailure() << "Expected: " << expected << " containing \"" << substr << "\"\n" << " Actual:\n" << r; } return AssertionSuccess(); } // The constructor of SingleFailureChecker remembers where to look up // test part results, what type of failure we expect, and what // substring the failure message should contain. SingleFailureChecker:: SingleFailureChecker( const TestPartResultArray* results, TestPartResult::Type type, const string& substr) : results_(results), type_(type), substr_(substr) {} // The destructor of SingleFailureChecker verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. SingleFailureChecker::~SingleFailureChecker() { EXPECT_PRED_FORMAT3(HasOneFailure, *results_, type_, substr_); } DefaultGlobalTestPartResultReporter::DefaultGlobalTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultGlobalTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->current_test_result()->AddTestPartResult(result); unit_test_->listeners()->repeater()->OnTestPartResult(result); } DefaultPerThreadTestPartResultReporter::DefaultPerThreadTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultPerThreadTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->GetGlobalTestPartResultReporter()->ReportTestPartResult(result); } // Returns the global test part result reporter. TestPartResultReporterInterface* UnitTestImpl::GetGlobalTestPartResultReporter() { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); return global_test_part_result_repoter_; } // Sets the global test part result reporter. void UnitTestImpl::SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter) { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); global_test_part_result_repoter_ = reporter; } // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* UnitTestImpl::GetTestPartResultReporterForCurrentThread() { return per_thread_test_part_result_reporter_.get(); } // Sets the test part result reporter for the current thread. void UnitTestImpl::SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter) { per_thread_test_part_result_reporter_.set(reporter); } // Gets the number of successful test cases. int UnitTestImpl::successful_test_case_count() const { return CountIf(test_cases_, TestCasePassed); } // Gets the number of failed test cases. int UnitTestImpl::failed_test_case_count() const { return CountIf(test_cases_, TestCaseFailed); } // Gets the number of all test cases. int UnitTestImpl::total_test_case_count() const { return static_cast(test_cases_.size()); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTestImpl::test_case_to_run_count() const { return CountIf(test_cases_, ShouldRunTestCase); } // Gets the number of successful tests. int UnitTestImpl::successful_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::successful_test_count); } // Gets the number of failed tests. int UnitTestImpl::failed_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::failed_test_count); } // Gets the number of disabled tests. int UnitTestImpl::disabled_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::disabled_test_count); } // Gets the number of all tests. int UnitTestImpl::total_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::total_test_count); } // Gets the number of tests that should run. int UnitTestImpl::test_to_run_count() const { return SumOverTestCaseList(test_cases_, &TestCase::test_to_run_count); } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String UnitTestImpl::CurrentOsStackTraceExceptTop(int skip_count) { (void)skip_count; return String(""); } // Returns the current time in milliseconds. TimeInMillis GetTimeInMillis() { #if GTEST_OS_WINDOWS_MOBILE || defined(__BORLANDC__) // Difference between 1970-01-01 and 1601-01-01 in milliseconds. // http://analogous.blogspot.com/2005/04/epoch.html const TimeInMillis kJavaEpochToWinFileTimeDelta = static_cast(116444736UL) * 100000UL; const DWORD kTenthMicrosInMilliSecond = 10000; SYSTEMTIME now_systime; FILETIME now_filetime; ULARGE_INTEGER now_int64; // TODO(kenton@google.com): Shouldn't this just use // GetSystemTimeAsFileTime()? GetSystemTime(&now_systime); if (SystemTimeToFileTime(&now_systime, &now_filetime)) { now_int64.LowPart = now_filetime.dwLowDateTime; now_int64.HighPart = now_filetime.dwHighDateTime; now_int64.QuadPart = (now_int64.QuadPart / kTenthMicrosInMilliSecond) - kJavaEpochToWinFileTimeDelta; return now_int64.QuadPart; } return 0; #elif GTEST_OS_WINDOWS && !GTEST_HAS_GETTIMEOFDAY_ __timeb64 now; # ifdef _MSC_VER // MSVC 8 deprecates _ftime64(), so we want to suppress warning 4996 // (deprecated function) there. // TODO(kenton@google.com): Use GetTickCount()? Or use // SystemTimeToFileTime() # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. _ftime64(&now); # pragma warning(pop) // Restores the warning state. # else _ftime64(&now); # endif // _MSC_VER return static_cast(now.time) * 1000 + now.millitm; #elif GTEST_HAS_GETTIMEOFDAY_ struct timeval now; gettimeofday(&now, NULL); return static_cast(now.tv_sec) * 1000 + now.tv_usec / 1000; #else # error "Don't know how to get the current time on your system." #endif } // Utilities // class String // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. String String::ShowCStringQuoted(const char* c_str) { return c_str ? String::Format("\"%s\"", c_str) : String("(null)"); } // Copies at most length characters from str into a newly-allocated // piece of memory of size length+1. The memory is allocated with new[]. // A terminating null byte is written to the memory, and a pointer to it // is returned. If str is NULL, NULL is returned. static char* CloneString(const char* str, size_t length) { if (str == NULL) { return NULL; } else { char* const clone = new char[length + 1]; posix::StrNCpy(clone, str, length); clone[length] = '\0'; return clone; } } // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting[] the return value. Returns the // cloned string, or NULL if the input is NULL. const char * String::CloneCString(const char* c_str) { return (c_str == NULL) ? NULL : CloneString(c_str, strlen(c_str)); } #if GTEST_OS_WINDOWS_MOBILE // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. LPCWSTR String::AnsiToUtf16(const char* ansi) { if (!ansi) return NULL; const int length = strlen(ansi); const int unicode_length = MultiByteToWideChar(CP_ACP, 0, ansi, length, NULL, 0); WCHAR* unicode = new WCHAR[unicode_length + 1]; MultiByteToWideChar(CP_ACP, 0, ansi, length, unicode, unicode_length); unicode[unicode_length] = 0; return unicode; } // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. const char* String::Utf16ToAnsi(LPCWSTR utf16_str) { if (!utf16_str) return NULL; const int ansi_length = WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, NULL, 0, NULL, NULL); char* ansi = new char[ansi_length + 1]; WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, ansi, ansi_length, NULL, NULL); ansi[ansi_length] = 0; return ansi; } #endif // GTEST_OS_WINDOWS_MOBILE // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::CStringEquals(const char * lhs, const char * rhs) { if ( lhs == NULL ) return rhs == NULL; if ( rhs == NULL ) return false; return strcmp(lhs, rhs) == 0; } #if GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING // Converts an array of wide chars to a narrow string using the UTF-8 // encoding, and streams the result to the given Message object. static void StreamWideCharsToMessage(const wchar_t* wstr, size_t length, Message* msg) { // TODO(wan): consider allowing a testing::String object to // contain '\0'. This will make it behave more like std::string, // and will allow ToUtf8String() to return the correct encoding // for '\0' s.t. we can get rid of the conditional here (and in // several other places). for (size_t i = 0; i != length; ) { // NOLINT if (wstr[i] != L'\0') { *msg << WideStringToUtf8(wstr + i, static_cast(length - i)); while (i != length && wstr[i] != L'\0') i++; } else { *msg << '\0'; i++; } } } #endif // GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING } // namespace internal #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::std::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_GLOBAL_WSTRING // AssertionResult constructors. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult::AssertionResult(const AssertionResult& other) : success_(other.success_), message_(other.message_.get() != NULL ? new ::std::string(*other.message_) : static_cast< ::std::string*>(NULL)) { } // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult AssertionResult::operator!() const { AssertionResult negation(!success_); if (message_.get() != NULL) negation << *message_; return negation; } // Makes a successful assertion result. AssertionResult AssertionSuccess() { return AssertionResult(true); } // Makes a failed assertion result. AssertionResult AssertionFailure() { return AssertionResult(false); } // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << message. AssertionResult AssertionFailure(const Message& message) { return AssertionFailure() << message; } namespace internal { // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case) { Message msg; msg << "Value of: " << actual_expression; if (actual_value != actual_expression) { msg << "\n Actual: " << actual_value; } msg << "\nExpected: " << expected_expression; if (ignoring_case) { msg << " (ignoring case)"; } if (expected_value != expected_expression) { msg << "\nWhich is: " << expected_value; } return AssertionFailure() << msg; } // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. String GetBoolAssertionFailureMessage(const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value) { const char* actual_message = assertion_result.message(); Message msg; msg << "Value of: " << expression_text << "\n Actual: " << actual_predicate_value; if (actual_message[0] != '\0') msg << " (" << actual_message << ")"; msg << "\nExpected: " << expected_predicate_value; return msg.GetString(); } // Helper function for implementing ASSERT_NEAR. AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error) { const double diff = fabs(val1 - val2); if (diff <= abs_error) return AssertionSuccess(); // TODO(wan): do not print the value of an expression if it's // already a literal. return AssertionFailure() << "The difference between " << expr1 << " and " << expr2 << " is " << diff << ", which exceeds " << abs_error_expr << ", where\n" << expr1 << " evaluates to " << val1 << ",\n" << expr2 << " evaluates to " << val2 << ", and\n" << abs_error_expr << " evaluates to " << abs_error << "."; } // Helper template for implementing FloatLE() and DoubleLE(). template AssertionResult FloatingPointLE(const char* expr1, const char* expr2, RawType val1, RawType val2) { // Returns success if val1 is less than val2, if (val1 < val2) { return AssertionSuccess(); } // or if val1 is almost equal to val2. const FloatingPoint lhs(val1), rhs(val2); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } // Note that the above two checks will both fail if either val1 or // val2 is NaN, as the IEEE floating-point standard requires that // any predicate involving a NaN must return false. ::std::stringstream val1_ss; val1_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val1; ::std::stringstream val2_ss; val2_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val2; return AssertionFailure() << "Expected: (" << expr1 << ") <= (" << expr2 << ")\n" << " Actual: " << StringStreamToString(&val1_ss) << " vs " << StringStreamToString(&val2_ss); } } // namespace internal // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } namespace internal { // The helper function for {ASSERT|EXPECT}_EQ with int or enum // arguments. AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { if (expected == actual) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_?? with integer or enum arguments. It is here // just to avoid copy-and-paste of similar code. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ BiggestInt val1, BiggestInt val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ } // Implements the helper function for {ASSERT|EXPECT}_NE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(NE, !=) // Implements the helper function for {ASSERT|EXPECT}_LE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LE, <=) // Implements the helper function for {ASSERT|EXPECT}_LT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LT, < ) // Implements the helper function for {ASSERT|EXPECT}_GE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GE, >=) // Implements the helper function for {ASSERT|EXPECT}_GT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GT, > ) #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), false); } // The helper function for {ASSERT|EXPECT}_STRCASEEQ. AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CaseInsensitiveCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), true); } // The helper function for {ASSERT|EXPECT}_STRNE. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } // The helper function for {ASSERT|EXPECT}_STRCASENE. AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CaseInsensitiveCStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << ") (ignoring case), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } } // namespace internal namespace { // Helper functions for implementing IsSubString() and IsNotSubstring(). // This group of overloaded functions return true iff needle is a // substring of haystack. NULL is considered a substring of itself // only. bool IsSubstringPred(const char* needle, const char* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return strstr(haystack, needle) != NULL; } bool IsSubstringPred(const wchar_t* needle, const wchar_t* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return wcsstr(haystack, needle) != NULL; } // StringType here can be either ::std::string or ::std::wstring. template bool IsSubstringPred(const StringType& needle, const StringType& haystack) { return haystack.find(needle) != StringType::npos; } // This function implements either IsSubstring() or IsNotSubstring(), // depending on the value of the expected_to_be_substring parameter. // StringType here can be const char*, const wchar_t*, ::std::string, // or ::std::wstring. template AssertionResult IsSubstringImpl( bool expected_to_be_substring, const char* needle_expr, const char* haystack_expr, const StringType& needle, const StringType& haystack) { if (IsSubstringPred(needle, haystack) == expected_to_be_substring) return AssertionSuccess(); const bool is_wide_string = sizeof(needle[0]) > 1; const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; return AssertionFailure() << "Value of: " << needle_expr << "\n" << " Actual: " << begin_string_quote << needle << "\"\n" << "Expected: " << (expected_to_be_substring ? "" : "not ") << "a substring of " << haystack_expr << "\n" << "Which is: " << begin_string_quote << haystack << "\""; } } // namespace // IsSubstring() and IsNotSubstring() check whether needle is a // substring of haystack (NULL is considered a substring of itself // only), and return an appropriate error message when they fail. AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #if GTEST_HAS_STD_WSTRING AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #endif // GTEST_HAS_STD_WSTRING namespace internal { #if GTEST_OS_WINDOWS namespace { // Helper function for IsHRESULT{SuccessFailure} predicates AssertionResult HRESULTFailureHelper(const char* expr, const char* expected, long hr) { // NOLINT # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't support FormatMessage. const char error_text[] = ""; # else // Looks up the human-readable system message for the HRESULT code // and since we're not passing any params to FormatMessage, we don't // want inserts expanded. const DWORD kFlags = FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS; const DWORD kBufSize = 4096; // String::Format can't exceed this length. // Gets the system's human readable message string for this HRESULT. char error_text[kBufSize] = { '\0' }; DWORD message_length = ::FormatMessageA(kFlags, 0, // no source, we're asking system hr, // the error 0, // no line width restrictions error_text, // output buffer kBufSize, // buf size NULL); // no arguments for inserts // Trims tailing white space (FormatMessage leaves a trailing cr-lf) for (; message_length && IsSpace(error_text[message_length - 1]); --message_length) { error_text[message_length - 1] = '\0'; } # endif // GTEST_OS_WINDOWS_MOBILE const String error_hex(String::Format("0x%08X ", hr)); return ::testing::AssertionFailure() << "Expected: " << expr << " " << expected << ".\n" << " Actual: " << error_hex << error_text << "\n"; } } // namespace AssertionResult IsHRESULTSuccess(const char* expr, long hr) { // NOLINT if (SUCCEEDED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "succeeds", hr); } AssertionResult IsHRESULTFailure(const char* expr, long hr) { // NOLINT if (FAILED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "fails", hr); } #endif // GTEST_OS_WINDOWS // Utility functions for encoding Unicode text (wide strings) in // UTF-8. // A Unicode code-point can have upto 21 bits, and is encoded in UTF-8 // like this: // // Code-point length Encoding // 0 - 7 bits 0xxxxxxx // 8 - 11 bits 110xxxxx 10xxxxxx // 12 - 16 bits 1110xxxx 10xxxxxx 10xxxxxx // 17 - 21 bits 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx // The maximum code-point a one-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint1 = (static_cast(1) << 7) - 1; // The maximum code-point a two-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint2 = (static_cast(1) << (5 + 6)) - 1; // The maximum code-point a three-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint3 = (static_cast(1) << (4 + 2*6)) - 1; // The maximum code-point a four-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint4 = (static_cast(1) << (3 + 3*6)) - 1; // Chops off the n lowest bits from a bit pattern. Returns the n // lowest bits. As a side effect, the original bit pattern will be // shifted to the right by n bits. inline UInt32 ChopLowBits(UInt32* bits, int n) { const UInt32 low_bits = *bits & ((static_cast(1) << n) - 1); *bits >>= n; return low_bits; } // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. char* CodePointToUtf8(UInt32 code_point, char* str) { if (code_point <= kMaxCodePoint1) { str[1] = '\0'; str[0] = static_cast(code_point); // 0xxxxxxx } else if (code_point <= kMaxCodePoint2) { str[2] = '\0'; str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xC0 | code_point); // 110xxxxx } else if (code_point <= kMaxCodePoint3) { str[3] = '\0'; str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xE0 | code_point); // 1110xxxx } else if (code_point <= kMaxCodePoint4) { str[4] = '\0'; str[3] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xF0 | code_point); // 11110xxx } else { // The longest string String::Format can produce when invoked // with these parameters is 28 character long (not including // the terminating nul character). We are asking for 32 character // buffer just in case. This is also enough for strncpy to // null-terminate the destination string. posix::StrNCpy( str, String::Format("(Invalid Unicode 0x%X)", code_point).c_str(), 32); str[31] = '\0'; // Makes sure no change in the format to strncpy leaves // the result unterminated. } return str; } // The following two functions only make sense if the the system // uses UTF-16 for wide string encoding. All supported systems // with 16 bit wchar_t (Windows, Cygwin, Symbian OS) do use UTF-16. // Determines if the arguments constitute UTF-16 surrogate pair // and thus should be combined into a single Unicode code point // using CreateCodePointFromUtf16SurrogatePair. inline bool IsUtf16SurrogatePair(wchar_t first, wchar_t second) { return sizeof(wchar_t) == 2 && (first & 0xFC00) == 0xD800 && (second & 0xFC00) == 0xDC00; } // Creates a Unicode code point from UTF16 surrogate pair. inline UInt32 CreateCodePointFromUtf16SurrogatePair(wchar_t first, wchar_t second) { const UInt32 mask = (1 << 10) - 1; return (sizeof(wchar_t) == 2) ? (((first & mask) << 10) | (second & mask)) + 0x10000 : // This function should not be called when the condition is // false, but we provide a sensible default in case it is. static_cast(first); } // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. String WideStringToUtf8(const wchar_t* str, int num_chars) { if (num_chars == -1) num_chars = static_cast(wcslen(str)); ::std::stringstream stream; for (int i = 0; i < num_chars; ++i) { UInt32 unicode_code_point; if (str[i] == L'\0') { break; } else if (i + 1 < num_chars && IsUtf16SurrogatePair(str[i], str[i + 1])) { unicode_code_point = CreateCodePointFromUtf16SurrogatePair(str[i], str[i + 1]); i++; } else { unicode_code_point = static_cast(str[i]); } char buffer[32]; // CodePointToUtf8 requires a buffer this big. stream << CodePointToUtf8(unicode_code_point, buffer); } return StringStreamToString(&stream); } // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". String String::ShowWideCString(const wchar_t * wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String(internal::WideStringToUtf8(wide_c_str, -1).c_str()); } // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. String String::ShowWideCStringQuoted(const wchar_t* wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String::Format("L\"%s\"", String::ShowWideCString(wide_c_str).c_str()); } // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::WideCStringEquals(const wchar_t * lhs, const wchar_t * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return wcscmp(lhs, rhs) == 0; } // Helper function for *_STREQ on wide strings. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual) { if (String::WideCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowWideCStringQuoted(expected), String::ShowWideCStringQuoted(actual), false); } // Helper function for *_STRNE on wide strings. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2) { if (!String::WideCStringEquals(s1, s2)) { return AssertionSuccess(); } return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: " << String::ShowWideCStringQuoted(s1) << " vs " << String::ShowWideCStringQuoted(s2); } // Compares two C strings, ignoring case. Returns true iff they have // the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. bool String::CaseInsensitiveCStringEquals(const char * lhs, const char * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return posix::StrCaseCmp(lhs, rhs) == 0; } // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. bool String::CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; #if GTEST_OS_WINDOWS return _wcsicmp(lhs, rhs) == 0; #elif GTEST_OS_LINUX && !GTEST_OS_LINUX_ANDROID return wcscasecmp(lhs, rhs) == 0; #else // Android, Mac OS X and Cygwin don't define wcscasecmp. // Other unknown OSes may not define it either. wint_t left, right; do { left = towlower(*lhs++); right = towlower(*rhs++); } while (left && left == right); return left == right; #endif // OS selector } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int String::Compare(const String & rhs) const { const char* const lhs_c_str = c_str(); const char* const rhs_c_str = rhs.c_str(); if (lhs_c_str == NULL) { return rhs_c_str == NULL ? 0 : -1; // NULL < anything except NULL } else if (rhs_c_str == NULL) { return 1; } const size_t shorter_str_len = length() <= rhs.length() ? length() : rhs.length(); for (size_t i = 0; i != shorter_str_len; i++) { if (lhs_c_str[i] < rhs_c_str[i]) { return -1; } else if (lhs_c_str[i] > rhs_c_str[i]) { return 1; } } return (length() < rhs.length()) ? -1 : (length() > rhs.length()) ? 1 : 0; } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool String::EndsWith(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CStringEquals(c_str() + this_len - suffix_len, suffix); } // Returns true iff this String ends with the given suffix, ignoring case. // Any String is considered to end with a NULL or empty suffix. bool String::EndsWithCaseInsensitive(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CaseInsensitiveCStringEquals(c_str() + this_len - suffix_len, suffix); } // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing 0). // If 4096 characters are not enough to format the input, or if // there's an error, "" is // returned. String String::Format(const char * format, ...) { va_list args; va_start(args, format); char buffer[4096]; const int kBufferSize = sizeof(buffer)/sizeof(buffer[0]); // MSVC 8 deprecates vsnprintf(), so we want to suppress warning // 4996 (deprecated function) there. #ifdef _MSC_VER // We are using MSVC. # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. const int size = vsnprintf(buffer, kBufferSize, format, args); # pragma warning(pop) // Restores the warning state. #else // We are not using MSVC. const int size = vsnprintf(buffer, kBufferSize, format, args); #endif // _MSC_VER va_end(args); // vsnprintf()'s behavior is not portable. When the buffer is not // big enough, it returns a negative value in MSVC, and returns the // needed buffer size on Linux. When there is an output error, it // always returns a negative value. For simplicity, we lump the two // error cases together. if (size < 0 || size >= kBufferSize) { return String(""); } else { return String(buffer, size); } } // Converts the buffer in a stringstream to a String, converting NUL // bytes to "\\0" along the way. String StringStreamToString(::std::stringstream* ss) { const ::std::string& str = ss->str(); const char* const start = str.c_str(); const char* const end = start + str.length(); // We need to use a helper stringstream to do this transformation // because String doesn't support push_back(). ::std::stringstream helper; for (const char* ch = start; ch != end; ++ch) { if (*ch == '\0') { helper << "\\0"; // Replaces NUL with "\\0"; } else { helper.put(*ch); } } return String(helper.str().c_str()); } // Appends the user-supplied message to the Google-Test-generated message. String AppendUserMessage(const String& gtest_msg, const Message& user_msg) { // Appends the user message if it's non-empty. const String user_msg_string = user_msg.GetString(); if (user_msg_string.empty()) { return gtest_msg; } Message msg; msg << gtest_msg << "\n" << user_msg_string; return msg.GetString(); } } // namespace internal // class TestResult // Creates an empty TestResult. TestResult::TestResult() : death_test_count_(0), elapsed_time_(0) { } // D'tor. TestResult::~TestResult() { } // Returns the i-th test part result among all the results. i can // range from 0 to total_part_count() - 1. If i is not in that range, // aborts the program. const TestPartResult& TestResult::GetTestPartResult(int i) const { if (i < 0 || i >= total_part_count()) internal::posix::Abort(); return test_part_results_.at(i); } // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& TestResult::GetTestProperty(int i) const { if (i < 0 || i >= test_property_count()) internal::posix::Abort(); return test_properties_.at(i); } // Clears the test part results. void TestResult::ClearTestPartResults() { test_part_results_.clear(); } // Adds a test part result to the list. void TestResult::AddTestPartResult(const TestPartResult& test_part_result) { test_part_results_.push_back(test_part_result); } // Adds a test property to the list. If a property with the same key as the // supplied property is already represented, the value of this test_property // replaces the old value for that key. void TestResult::RecordProperty(const TestProperty& test_property) { if (!ValidateTestProperty(test_property)) { return; } internal::MutexLock lock(&test_properites_mutex_); const std::vector::iterator property_with_matching_key = std::find_if(test_properties_.begin(), test_properties_.end(), internal::TestPropertyKeyIs(test_property.key())); if (property_with_matching_key == test_properties_.end()) { test_properties_.push_back(test_property); return; } property_with_matching_key->SetValue(test_property.value()); } // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. bool TestResult::ValidateTestProperty(const TestProperty& test_property) { internal::String key(test_property.key()); if (key == "name" || key == "status" || key == "time" || key == "classname") { ADD_FAILURE() << "Reserved key used in RecordProperty(): " << key << " ('name', 'status', 'time', and 'classname' are reserved by " << GTEST_NAME_ << ")"; return false; } return true; } // Clears the object. void TestResult::Clear() { test_part_results_.clear(); test_properties_.clear(); death_test_count_ = 0; elapsed_time_ = 0; } // Returns true iff the test failed. bool TestResult::Failed() const { for (int i = 0; i < total_part_count(); ++i) { if (GetTestPartResult(i).failed()) return true; } return false; } // Returns true iff the test part fatally failed. static bool TestPartFatallyFailed(const TestPartResult& result) { return result.fatally_failed(); } // Returns true iff the test fatally failed. bool TestResult::HasFatalFailure() const { return CountIf(test_part_results_, TestPartFatallyFailed) > 0; } // Returns true iff the test part non-fatally failed. static bool TestPartNonfatallyFailed(const TestPartResult& result) { return result.nonfatally_failed(); } // Returns true iff the test has a non-fatal failure. bool TestResult::HasNonfatalFailure() const { return CountIf(test_part_results_, TestPartNonfatallyFailed) > 0; } // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int TestResult::total_part_count() const { return static_cast(test_part_results_.size()); } // Returns the number of the test properties. int TestResult::test_property_count() const { return static_cast(test_properties_.size()); } // class Test // Creates a Test object. // The c'tor saves the values of all Google Test flags. Test::Test() : gtest_flag_saver_(new internal::GTestFlagSaver) { } // The d'tor restores the values of all Google Test flags. Test::~Test() { delete gtest_flag_saver_; } // Sets up the test fixture. // // A sub-class may override this. void Test::SetUp() { } // Tears down the test fixture. // // A sub-class may override this. void Test::TearDown() { } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, const char* value) { UnitTest::GetInstance()->RecordPropertyForCurrentTest(key, value); } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, int value) { Message value_message; value_message << value; RecordProperty(key, value_message.GetString().c_str()); } namespace internal { void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message) { // This function is a friend of UnitTest and as such has access to // AddTestPartResult. UnitTest::GetInstance()->AddTestPartResult( result_type, NULL, // No info about the source file where the exception occurred. -1, // We have no info on which line caused the exception. message, String()); // No stack trace, either. } } // namespace internal // Google Test requires all tests in the same test case to use the same test // fixture class. This function checks if the current test has the // same fixture class as the first test in the current test case. If // yes, it returns true; otherwise it generates a Google Test failure and // returns false. bool Test::HasSameFixtureClass() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); const TestCase* const test_case = impl->current_test_case(); // Info about the first test in the current test case. const TestInfo* const first_test_info = test_case->test_info_list()[0]; const internal::TypeId first_fixture_id = first_test_info->fixture_class_id_; const char* const first_test_name = first_test_info->name(); // Info about the current test. const TestInfo* const this_test_info = impl->current_test_info(); const internal::TypeId this_fixture_id = this_test_info->fixture_class_id_; const char* const this_test_name = this_test_info->name(); if (this_fixture_id != first_fixture_id) { // Is the first test defined using TEST? const bool first_is_TEST = first_fixture_id == internal::GetTestTypeId(); // Is this test defined using TEST? const bool this_is_TEST = this_fixture_id == internal::GetTestTypeId(); if (first_is_TEST || this_is_TEST) { // The user mixed TEST and TEST_F in this test case - we'll tell // him/her how to fix it. // Gets the name of the TEST and the name of the TEST_F. Note // that first_is_TEST and this_is_TEST cannot both be true, as // the fixture IDs are different for the two tests. const char* const TEST_name = first_is_TEST ? first_test_name : this_test_name; const char* const TEST_F_name = first_is_TEST ? this_test_name : first_test_name; ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class, so mixing TEST_F and TEST in the same test case is\n" << "illegal. In test case " << this_test_info->test_case_name() << ",\n" << "test " << TEST_F_name << " is defined using TEST_F but\n" << "test " << TEST_name << " is defined using TEST. You probably\n" << "want to change the TEST to TEST_F or move it to another test\n" << "case."; } else { // The user defined two fixture classes with the same name in // two namespaces - we'll tell him/her how to fix it. ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << this_test_info->test_case_name() << ",\n" << "you defined test " << first_test_name << " and test " << this_test_name << "\n" << "using two different test fixture classes. This can happen if\n" << "the two classes are from different namespaces or translation\n" << "units and have the same name. You should probably rename one\n" << "of the classes to put the tests into different test cases."; } return false; } return true; } #if GTEST_HAS_SEH // Adds an "exception thrown" fatal failure to the current test. This // function returns its result via an output parameter pointer because VC++ // prohibits creation of objects with destructors on stack in functions // using __try (see error C2712). static internal::String* FormatSehExceptionMessage(DWORD exception_code, const char* location) { Message message; message << "SEH exception with code 0x" << std::setbase(16) << exception_code << std::setbase(10) << " thrown in " << location << "."; return new internal::String(message.GetString()); } #endif // GTEST_HAS_SEH #if GTEST_HAS_EXCEPTIONS // Adds an "exception thrown" fatal failure to the current test. static internal::String FormatCxxExceptionMessage(const char* description, const char* location) { Message message; if (description != NULL) { message << "C++ exception with description \"" << description << "\""; } else { message << "Unknown C++ exception"; } message << " thrown in " << location << "."; return message.GetString(); } static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result); // A failed Google Test assertion will throw an exception of this type when // GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We // derive it from std::runtime_error, which is for errors presumably // detectable only at run time. Since std::runtime_error inherits from // std::exception, many testing frameworks know how to extract and print the // message inside it. class GoogleTestFailureException : public ::std::runtime_error { public: explicit GoogleTestFailureException(const TestPartResult& failure) : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {} }; #endif // GTEST_HAS_EXCEPTIONS namespace internal { // We put these helper functions in the internal namespace as IBM's xlC // compiler rejects the code if they were declared static. // Runs the given method and handles SEH exceptions it throws, when // SEH is supported; returns the 0-value for type Result in case of an // SEH exception. (Microsoft compilers cannot handle SEH and C++ // exceptions in the same function. Therefore, we provide a separate // wrapper function for handling SEH exceptions.) template Result HandleSehExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { #if GTEST_HAS_SEH __try { return (object->*method)(); } __except (internal::UnitTestOptions::GTestShouldProcessSEH( // NOLINT GetExceptionCode())) { // We create the exception message on the heap because VC++ prohibits // creation of objects with destructors on stack in functions using __try // (see error C2712). internal::String* exception_message = FormatSehExceptionMessage( GetExceptionCode(), location); internal::ReportFailureInUnknownLocation(TestPartResult::kFatalFailure, *exception_message); delete exception_message; return static_cast(0); } #else (void)location; return (object->*method)(); #endif // GTEST_HAS_SEH } // Runs the given method and catches and reports C++ and/or SEH-style // exceptions, if they are supported; returns the 0-value for type // Result in case of an SEH exception. template Result HandleExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { // NOTE: The user code can affect the way in which Google Test handles // exceptions by setting GTEST_FLAG(catch_exceptions), but only before // RUN_ALL_TESTS() starts. It is technically possible to check the flag // after the exception is caught and either report or re-throw the // exception based on the flag's value: // // try { // // Perform the test method. // } catch (...) { // if (GTEST_FLAG(catch_exceptions)) // // Report the exception as failure. // else // throw; // Re-throws the original exception. // } // // However, the purpose of this flag is to allow the program to drop into // the debugger when the exception is thrown. On most platforms, once the // control enters the catch block, the exception origin information is // lost and the debugger will stop the program at the point of the // re-throw in this function -- instead of at the point of the original // throw statement in the code under test. For this reason, we perform // the check early, sacrificing the ability to affect Google Test's // exception handling in the method where the exception is thrown. if (internal::GetUnitTestImpl()->catch_exceptions()) { #if GTEST_HAS_EXCEPTIONS try { return HandleSehExceptionsInMethodIfSupported(object, method, location); } catch (const GoogleTestFailureException&) { // NOLINT // This exception doesn't originate in code under test. It makes no // sense to report it as a test failure. throw; } catch (const std::exception& e) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(e.what(), location)); } catch (...) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(NULL, location)); } return static_cast(0); #else return HandleSehExceptionsInMethodIfSupported(object, method, location); #endif // GTEST_HAS_EXCEPTIONS } else { return (object->*method)(); } } } // namespace internal // Runs the test and updates the test result. void Test::Run() { if (!HasSameFixtureClass()) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported(this, &Test::SetUp, "SetUp()"); // We will run the test only if SetUp() was successful. if (!HasFatalFailure()) { impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TestBody, "the test body"); } // However, we want to clean up as much as possible. Hence we will // always call TearDown(), even if SetUp() or the test body has // failed. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TearDown, "TearDown()"); } // Returns true iff the current test has a fatal failure. bool Test::HasFatalFailure() { return internal::GetUnitTestImpl()->current_test_result()->HasFatalFailure(); } // Returns true iff the current test has a non-fatal failure. bool Test::HasNonfatalFailure() { return internal::GetUnitTestImpl()->current_test_result()-> HasNonfatalFailure(); } // class TestInfo // Constructs a TestInfo object. It assumes ownership of the test factory // object. // TODO(vladl@google.com): Make a_test_case_name and a_name const string&'s // to signify they cannot be NULLs. TestInfo::TestInfo(const char* a_test_case_name, const char* a_name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory) : test_case_name_(a_test_case_name), name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), value_param_(a_value_param ? new std::string(a_value_param) : NULL), fixture_class_id_(fixture_class_id), should_run_(false), is_disabled_(false), matches_filter_(false), factory_(factory), result_() {} // Destructs a TestInfo object. TestInfo::~TestInfo() { delete factory_; } namespace internal { // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param: text representation of the test's value parameter, // or NULL if this is not a value-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory) { TestInfo* const test_info = new TestInfo(test_case_name, name, type_param, value_param, fixture_class_id, factory); GetUnitTestImpl()->AddTestInfo(set_up_tc, tear_down_tc, test_info); return test_info; } #if GTEST_HAS_PARAM_TEST void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line) { Message errors; errors << "Attempted redefinition of test case " << test_case_name << ".\n" << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << test_case_name << ", you tried\n" << "to define a test using a fixture class different from the one\n" << "used earlier. This can happen if the two fixture classes are\n" << "from different namespaces and have the same name. You should\n" << "probably rename one of the classes to put the tests into different\n" << "test cases."; fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors.GetString().c_str()); } #endif // GTEST_HAS_PARAM_TEST } // namespace internal namespace { // A predicate that checks the test name of a TestInfo against a known // value. // // This is used for implementation of the TestCase class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestNameIs is copyable. class TestNameIs { public: // Constructor. // // TestNameIs has NO default constructor. explicit TestNameIs(const char* name) : name_(name) {} // Returns true iff the test name of test_info matches name_. bool operator()(const TestInfo * test_info) const { return test_info && internal::String(test_info->name()).Compare(name_) == 0; } private: internal::String name_; }; } // namespace namespace internal { // This method expands all parameterized tests registered with macros TEST_P // and INSTANTIATE_TEST_CASE_P into regular tests and registers those. // This will be done just once during the program runtime. void UnitTestImpl::RegisterParameterizedTests() { #if GTEST_HAS_PARAM_TEST if (!parameterized_tests_registered_) { parameterized_test_registry_.RegisterTests(); parameterized_tests_registered_ = true; } #endif } } // namespace internal // Creates the test object, runs it, records its result, and then // deletes it. void TestInfo::Run() { if (!should_run_) return; // Tells UnitTest where to store test result. internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_info(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); // Notifies the unit test event listeners that a test is about to start. repeater->OnTestStart(*this); const TimeInMillis start = internal::GetTimeInMillis(); impl->os_stack_trace_getter()->UponLeavingGTest(); // Creates the test object. Test* const test = internal::HandleExceptionsInMethodIfSupported( factory_, &internal::TestFactoryBase::CreateTest, "the test fixture's constructor"); // Runs the test only if the test object was created and its // constructor didn't generate a fatal failure. if ((test != NULL) && !Test::HasFatalFailure()) { // This doesn't throw as all user code that can throw are wrapped into // exception handling code. test->Run(); } // Deletes the test object. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( test, &Test::DeleteSelf_, "the test fixture's destructor"); result_.set_elapsed_time(internal::GetTimeInMillis() - start); // Notifies the unit test event listener that a test has just finished. repeater->OnTestEnd(*this); // Tells UnitTest to stop associating assertion results to this // test. impl->set_current_test_info(NULL); } // class TestCase // Gets the number of successful tests in this test case. int TestCase::successful_test_count() const { return CountIf(test_info_list_, TestPassed); } // Gets the number of failed tests in this test case. int TestCase::failed_test_count() const { return CountIf(test_info_list_, TestFailed); } int TestCase::disabled_test_count() const { return CountIf(test_info_list_, TestDisabled); } // Get the number of tests in this test case that should run. int TestCase::test_to_run_count() const { return CountIf(test_info_list_, ShouldRunTest); } // Gets the number of all tests. int TestCase::total_test_count() const { return static_cast(test_info_list_.size()); } // Creates a TestCase with the given name. // // Arguments: // // name: name of the test case // a_type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase::TestCase(const char* a_name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) : name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), set_up_tc_(set_up_tc), tear_down_tc_(tear_down_tc), should_run_(false), elapsed_time_(0) { } // Destructor of TestCase. TestCase::~TestCase() { // Deletes every Test in the collection. ForEach(test_info_list_, internal::Delete); } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* TestCase::GetTestInfo(int i) const { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* TestCase::GetMutableTestInfo(int i) { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Adds a test to this test case. Will delete the test upon // destruction of the TestCase object. void TestCase::AddTestInfo(TestInfo * test_info) { test_info_list_.push_back(test_info); test_indices_.push_back(static_cast(test_indices_.size())); } // Runs every test in this TestCase. void TestCase::Run() { if (!should_run_) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_case(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); repeater->OnTestCaseStart(*this); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunSetUpTestCase, "SetUpTestCase()"); const internal::TimeInMillis start = internal::GetTimeInMillis(); for (int i = 0; i < total_test_count(); i++) { GetMutableTestInfo(i)->Run(); } elapsed_time_ = internal::GetTimeInMillis() - start; impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunTearDownTestCase, "TearDownTestCase()"); repeater->OnTestCaseEnd(*this); impl->set_current_test_case(NULL); } // Clears the results of all tests in this test case. void TestCase::ClearResult() { ForEach(test_info_list_, TestInfo::ClearTestResult); } // Shuffles the tests in this test case. void TestCase::ShuffleTests(internal::Random* random) { Shuffle(random, &test_indices_); } // Restores the test order to before the first shuffle. void TestCase::UnshuffleTests() { for (size_t i = 0; i < test_indices_.size(); i++) { test_indices_[i] = static_cast(i); } } // Formats a countable noun. Depending on its quantity, either the // singular form or the plural form is used. e.g. // // FormatCountableNoun(1, "formula", "formuli") returns "1 formula". // FormatCountableNoun(5, "book", "books") returns "5 books". static internal::String FormatCountableNoun(int count, const char * singular_form, const char * plural_form) { return internal::String::Format("%d %s", count, count == 1 ? singular_form : plural_form); } // Formats the count of tests. static internal::String FormatTestCount(int test_count) { return FormatCountableNoun(test_count, "test", "tests"); } // Formats the count of test cases. static internal::String FormatTestCaseCount(int test_case_count) { return FormatCountableNoun(test_case_count, "test case", "test cases"); } // Converts a TestPartResult::Type enum to human-friendly string // representation. Both kNonFatalFailure and kFatalFailure are translated // to "Failure", as the user usually doesn't care about the difference // between the two when viewing the test result. static const char * TestPartResultTypeToString(TestPartResult::Type type) { switch (type) { case TestPartResult::kSuccess: return "Success"; case TestPartResult::kNonFatalFailure: case TestPartResult::kFatalFailure: #ifdef _MSC_VER return "error: "; #else return "Failure\n"; #endif default: return "Unknown result type"; } } // Prints a TestPartResult to a String. static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result) { return (Message() << internal::FormatFileLocation(test_part_result.file_name(), test_part_result.line_number()) << " " << TestPartResultTypeToString(test_part_result.type()) << test_part_result.message()).GetString(); } // Prints a TestPartResult. static void PrintTestPartResult(const TestPartResult& test_part_result) { const internal::String& result = PrintTestPartResultToString(test_part_result); printf("%s\n", result.c_str()); fflush(stdout); // If the test program runs in Visual Studio or a debugger, the // following statements add the test part result message to the Output // window such that the user can double-click on it to jump to the // corresponding source code location; otherwise they do nothing. #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // We don't call OutputDebugString*() on Windows Mobile, as printing // to stdout is done by OutputDebugString() there already - we don't // want the same message printed twice. ::OutputDebugStringA(result.c_str()); ::OutputDebugStringA("\n"); #endif } // class PrettyUnitTestResultPrinter namespace internal { enum GTestColor { COLOR_DEFAULT, COLOR_RED, COLOR_GREEN, COLOR_YELLOW }; #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns the character attribute for the given color. WORD GetColorAttribute(GTestColor color) { switch (color) { case COLOR_RED: return FOREGROUND_RED; case COLOR_GREEN: return FOREGROUND_GREEN; case COLOR_YELLOW: return FOREGROUND_RED | FOREGROUND_GREEN; default: return 0; } } #else // Returns the ANSI color code for the given color. COLOR_DEFAULT is // an invalid input. const char* GetAnsiColorCode(GTestColor color) { switch (color) { case COLOR_RED: return "1"; case COLOR_GREEN: return "2"; case COLOR_YELLOW: return "3"; default: return NULL; }; } #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns true iff Google Test should use colors in the output. bool ShouldUseColor(bool stdout_is_tty) { const char* const gtest_color = GTEST_FLAG(color).c_str(); if (String::CaseInsensitiveCStringEquals(gtest_color, "auto")) { #if GTEST_OS_WINDOWS // On Windows the TERM variable is usually not set, but the // console there does support colors. return stdout_is_tty; #else // On non-Windows platforms, we rely on the TERM variable. const char* const term = posix::GetEnv("TERM"); const bool term_supports_color = String::CStringEquals(term, "xterm") || String::CStringEquals(term, "xterm-color") || String::CStringEquals(term, "xterm-256color") || String::CStringEquals(term, "screen") || String::CStringEquals(term, "linux") || String::CStringEquals(term, "cygwin"); return stdout_is_tty && term_supports_color; #endif // GTEST_OS_WINDOWS } return String::CaseInsensitiveCStringEquals(gtest_color, "yes") || String::CaseInsensitiveCStringEquals(gtest_color, "true") || String::CaseInsensitiveCStringEquals(gtest_color, "t") || String::CStringEquals(gtest_color, "1"); // We take "yes", "true", "t", and "1" as meaning "yes". If the // value is neither one of these nor "auto", we treat it as "no" to // be conservative. } // Helpers for printing colored strings to stdout. Note that on Windows, we // cannot simply emit special characters and have the terminal change colors. // This routine must actually emit the characters rather than return a string // that would be colored when printed, as can be done on Linux. void ColoredPrintf(GTestColor color, const char* fmt, ...) { va_list args; va_start(args, fmt); #if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS const bool use_color = false; #else static const bool in_color_mode = ShouldUseColor(posix::IsATTY(posix::FileNo(stdout)) != 0); const bool use_color = in_color_mode && (color != COLOR_DEFAULT); #endif // GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS // The '!= 0' comparison is necessary to satisfy MSVC 7.1. if (!use_color) { vprintf(fmt, args); va_end(args); return; } #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE); // Gets the current text color. CONSOLE_SCREEN_BUFFER_INFO buffer_info; GetConsoleScreenBufferInfo(stdout_handle, &buffer_info); const WORD old_color_attrs = buffer_info.wAttributes; // We need to flush the stream buffers into the console before each // SetConsoleTextAttribute call lest it affect the text that is already // printed but has not yet reached the console. fflush(stdout); SetConsoleTextAttribute(stdout_handle, GetColorAttribute(color) | FOREGROUND_INTENSITY); vprintf(fmt, args); fflush(stdout); // Restores the text color. SetConsoleTextAttribute(stdout_handle, old_color_attrs); #else printf("\033[0;3%sm", GetAnsiColorCode(color)); vprintf(fmt, args); printf("\033[m"); // Resets the terminal to default. #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE va_end(args); } void PrintFullTestCommentIfPresent(const TestInfo& test_info) { const char* const type_param = test_info.type_param(); const char* const value_param = test_info.value_param(); if (type_param != NULL || value_param != NULL) { printf(", where "); if (type_param != NULL) { printf("TypeParam = %s", type_param); if (value_param != NULL) printf(" and "); } if (value_param != NULL) { printf("GetParam() = %s", value_param); } } } // This class implements the TestEventListener interface. // // Class PrettyUnitTestResultPrinter is copyable. class PrettyUnitTestResultPrinter : public TestEventListener { public: PrettyUnitTestResultPrinter() {} static void PrintTestName(const char * test_case, const char * test) { printf("%s.%s", test_case, test); } // The following methods override what's in the TestEventListener class. virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} private: static void PrintFailedTests(const UnitTest& unit_test); internal::String test_case_name_; }; // Fired before each iteration of tests starts. void PrettyUnitTestResultPrinter::OnTestIterationStart( const UnitTest& unit_test, int iteration) { if (GTEST_FLAG(repeat) != 1) printf("\nRepeating all tests (iteration %d) . . .\n\n", iteration + 1); const char* const filter = GTEST_FLAG(filter).c_str(); // Prints the filter if it's not *. This reminds the user that some // tests may be skipped. if (!internal::String::CStringEquals(filter, kUniversalFilter)) { ColoredPrintf(COLOR_YELLOW, "Note: %s filter = %s\n", GTEST_NAME_, filter); } if (internal::ShouldShard(kTestTotalShards, kTestShardIndex, false)) { const Int32 shard_index = Int32FromEnvOrDie(kTestShardIndex, -1); ColoredPrintf(COLOR_YELLOW, "Note: This is test shard %d of %s.\n", static_cast(shard_index) + 1, internal::posix::GetEnv(kTestTotalShards)); } if (GTEST_FLAG(shuffle)) { ColoredPrintf(COLOR_YELLOW, "Note: Randomizing tests' orders with a seed of %d .\n", unit_test.random_seed()); } ColoredPrintf(COLOR_GREEN, "[==========] "); printf("Running %s from %s.\n", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsSetUpStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment set-up.\n"); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseStart(const TestCase& test_case) { test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s", counts.c_str(), test_case_name_.c_str()); if (test_case.type_param() == NULL) { printf("\n"); } else { printf(", where TypeParam = %s\n", test_case.type_param()); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestStart(const TestInfo& test_info) { ColoredPrintf(COLOR_GREEN, "[ RUN ] "); PrintTestName(test_case_name_.c_str(), test_info.name()); printf("\n"); fflush(stdout); } // Called after an assertion failure. void PrettyUnitTestResultPrinter::OnTestPartResult( const TestPartResult& result) { // If the test part succeeded, we don't need to do anything. if (result.type() == TestPartResult::kSuccess) return; // Print failure message from the assertion (e.g. expected this and got that). PrintTestPartResult(result); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestEnd(const TestInfo& test_info) { if (test_info.result()->Passed()) { ColoredPrintf(COLOR_GREEN, "[ OK ] "); } else { ColoredPrintf(COLOR_RED, "[ FAILED ] "); } PrintTestName(test_case_name_.c_str(), test_info.name()); if (test_info.result()->Failed()) PrintFullTestCommentIfPresent(test_info); if (GTEST_FLAG(print_time)) { printf(" (%s ms)\n", internal::StreamableToString( test_info.result()->elapsed_time()).c_str()); } else { printf("\n"); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseEnd(const TestCase& test_case) { if (!GTEST_FLAG(print_time)) return; test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s (%s ms total)\n\n", counts.c_str(), test_case_name_.c_str(), internal::StreamableToString(test_case.elapsed_time()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsTearDownStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment tear-down\n"); fflush(stdout); } // Internal helper for printing the list of failed tests. void PrettyUnitTestResultPrinter::PrintFailedTests(const UnitTest& unit_test) { const int failed_test_count = unit_test.failed_test_count(); if (failed_test_count == 0) { return; } for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase& test_case = *unit_test.GetTestCase(i); if (!test_case.should_run() || (test_case.failed_test_count() == 0)) { continue; } for (int j = 0; j < test_case.total_test_count(); ++j) { const TestInfo& test_info = *test_case.GetTestInfo(j); if (!test_info.should_run() || test_info.result()->Passed()) { continue; } ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s.%s", test_case.name(), test_info.name()); PrintFullTestCommentIfPresent(test_info); printf("\n"); } } } void PrettyUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { ColoredPrintf(COLOR_GREEN, "[==========] "); printf("%s from %s ran.", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); if (GTEST_FLAG(print_time)) { printf(" (%s ms total)", internal::StreamableToString(unit_test.elapsed_time()).c_str()); } printf("\n"); ColoredPrintf(COLOR_GREEN, "[ PASSED ] "); printf("%s.\n", FormatTestCount(unit_test.successful_test_count()).c_str()); int num_failures = unit_test.failed_test_count(); if (!unit_test.Passed()) { const int failed_test_count = unit_test.failed_test_count(); ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s, listed below:\n", FormatTestCount(failed_test_count).c_str()); PrintFailedTests(unit_test); printf("\n%2d FAILED %s\n", num_failures, num_failures == 1 ? "TEST" : "TESTS"); } int num_disabled = unit_test.disabled_test_count(); if (num_disabled && !GTEST_FLAG(also_run_disabled_tests)) { if (!num_failures) { printf("\n"); // Add a spacer if no FAILURE banner is displayed. } ColoredPrintf(COLOR_YELLOW, " YOU HAVE %d DISABLED %s\n\n", num_disabled, num_disabled == 1 ? "TEST" : "TESTS"); } // Ensure that Google Test output is printed before, e.g., heapchecker output. fflush(stdout); } // End PrettyUnitTestResultPrinter // class TestEventRepeater // // This class forwards events to other event listeners. class TestEventRepeater : public TestEventListener { public: TestEventRepeater() : forwarding_enabled_(true) {} virtual ~TestEventRepeater(); void Append(TestEventListener *listener); TestEventListener* Release(TestEventListener* listener); // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled() const { return forwarding_enabled_; } void set_forwarding_enabled(bool enable) { forwarding_enabled_ = enable; } virtual void OnTestProgramStart(const UnitTest& unit_test); virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test); virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& unit_test); private: // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled_; // The list of listeners that receive events. std::vector listeners_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventRepeater); }; TestEventRepeater::~TestEventRepeater() { ForEach(listeners_, Delete); } void TestEventRepeater::Append(TestEventListener *listener) { listeners_.push_back(listener); } // TODO(vladl@google.com): Factor the search functionality into Vector::Find. TestEventListener* TestEventRepeater::Release(TestEventListener *listener) { for (size_t i = 0; i < listeners_.size(); ++i) { if (listeners_[i] == listener) { listeners_.erase(listeners_.begin() + i); return listener; } } return NULL; } // Since most methods are very similar, use macros to reduce boilerplate. // This defines a member that forwards the call to all listeners. #define GTEST_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (size_t i = 0; i < listeners_.size(); i++) { \ listeners_[i]->Name(parameter); \ } \ } \ } // This defines a member that forwards the call to all listeners in reverse // order. #define GTEST_REVERSE_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { \ listeners_[i]->Name(parameter); \ } \ } \ } GTEST_REPEATER_METHOD_(OnTestProgramStart, UnitTest) GTEST_REPEATER_METHOD_(OnEnvironmentsSetUpStart, UnitTest) GTEST_REPEATER_METHOD_(OnTestCaseStart, TestCase) GTEST_REPEATER_METHOD_(OnTestStart, TestInfo) GTEST_REPEATER_METHOD_(OnTestPartResult, TestPartResult) GTEST_REPEATER_METHOD_(OnEnvironmentsTearDownStart, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsSetUpEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsTearDownEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnTestEnd, TestInfo) GTEST_REVERSE_REPEATER_METHOD_(OnTestCaseEnd, TestCase) GTEST_REVERSE_REPEATER_METHOD_(OnTestProgramEnd, UnitTest) #undef GTEST_REPEATER_METHOD_ #undef GTEST_REVERSE_REPEATER_METHOD_ void TestEventRepeater::OnTestIterationStart(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (size_t i = 0; i < listeners_.size(); i++) { listeners_[i]->OnTestIterationStart(unit_test, iteration); } } } void TestEventRepeater::OnTestIterationEnd(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { listeners_[i]->OnTestIterationEnd(unit_test, iteration); } } } // End TestEventRepeater // This class generates an XML output file. class XmlUnitTestResultPrinter : public EmptyTestEventListener { public: explicit XmlUnitTestResultPrinter(const char* output_file); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); private: // Is c a whitespace character that is normalized to a space character // when it appears in an XML attribute value? static bool IsNormalizableWhitespace(char c) { return c == 0x9 || c == 0xA || c == 0xD; } // May c appear in a well-formed XML document? static bool IsValidXmlCharacter(char c) { return IsNormalizableWhitespace(c) || c >= 0x20; } // Returns an XML-escaped copy of the input string str. If // is_attribute is true, the text is meant to appear as an attribute // value, and normalizable whitespace is preserved by replacing it // with character references. static String EscapeXml(const char* str, bool is_attribute); // Returns the given string with all characters invalid in XML removed. static string RemoveInvalidXmlCharacters(const string& str); // Convenience wrapper around EscapeXml when str is an attribute value. static String EscapeXmlAttribute(const char* str) { return EscapeXml(str, true); } // Convenience wrapper around EscapeXml when str is not an attribute value. static String EscapeXmlText(const char* str) { return EscapeXml(str, false); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. static void OutputXmlCDataSection(::std::ostream* stream, const char* data); // Streams an XML representation of a TestInfo object. static void OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info); // Prints an XML representation of a TestCase object static void PrintXmlTestCase(FILE* out, const TestCase& test_case); // Prints an XML summary of unit_test to output stream out. static void PrintXmlUnitTest(FILE* out, const UnitTest& unit_test); // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. // When the String is not empty, it includes a space at the beginning, // to delimit this attribute from prior attributes. static String TestPropertiesAsXmlAttributes(const TestResult& result); // The output file. const String output_file_; GTEST_DISALLOW_COPY_AND_ASSIGN_(XmlUnitTestResultPrinter); }; // Creates a new XmlUnitTestResultPrinter. XmlUnitTestResultPrinter::XmlUnitTestResultPrinter(const char* output_file) : output_file_(output_file) { if (output_file_.c_str() == NULL || output_file_.empty()) { fprintf(stderr, "XML output file may not be null\n"); fflush(stderr); exit(EXIT_FAILURE); } } // Called after the unit test ends. void XmlUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { FILE* xmlout = NULL; FilePath output_file(output_file_); FilePath output_dir(output_file.RemoveFileName()); if (output_dir.CreateDirectoriesRecursively()) { xmlout = posix::FOpen(output_file_.c_str(), "w"); } if (xmlout == NULL) { // TODO(wan): report the reason of the failure. // // We don't do it for now as: // // 1. There is no urgent need for it. // 2. It's a bit involved to make the errno variable thread-safe on // all three operating systems (Linux, Windows, and Mac OS). // 3. To interpret the meaning of errno in a thread-safe way, // we need the strerror_r() function, which is not available on // Windows. fprintf(stderr, "Unable to open file \"%s\"\n", output_file_.c_str()); fflush(stderr); exit(EXIT_FAILURE); } PrintXmlUnitTest(xmlout, unit_test); fclose(xmlout); } // Returns an XML-escaped copy of the input string str. If is_attribute // is true, the text is meant to appear as an attribute value, and // normalizable whitespace is preserved by replacing it with character // references. // // Invalid XML characters in str, if any, are stripped from the output. // It is expected that most, if not all, of the text processed by this // module will consist of ordinary English text. // If this module is ever modified to produce version 1.1 XML output, // most invalid characters can be retained using character references. // TODO(wan): It might be nice to have a minimally invasive, human-readable // escaping scheme for invalid characters, rather than dropping them. String XmlUnitTestResultPrinter::EscapeXml(const char* str, bool is_attribute) { Message m; if (str != NULL) { for (const char* src = str; *src; ++src) { switch (*src) { case '<': m << "<"; break; case '>': m << ">"; break; case '&': m << "&"; break; case '\'': if (is_attribute) m << "'"; else m << '\''; break; case '"': if (is_attribute) m << """; else m << '"'; break; default: if (IsValidXmlCharacter(*src)) { if (is_attribute && IsNormalizableWhitespace(*src)) m << String::Format("&#x%02X;", unsigned(*src)); else m << *src; } break; } } } return m.GetString(); } // Returns the given string with all characters invalid in XML removed. // Currently invalid characters are dropped from the string. An // alternative is to replace them with certain characters such as . or ?. string XmlUnitTestResultPrinter::RemoveInvalidXmlCharacters(const string& str) { string output; output.reserve(str.size()); for (string::const_iterator it = str.begin(); it != str.end(); ++it) if (IsValidXmlCharacter(*it)) output.push_back(*it); return output; } // The following routines generate an XML representation of a UnitTest // object. // // This is how Google Test concepts map to the DTD: // // <-- corresponds to a UnitTest object // <-- corresponds to a TestCase object // <-- corresponds to a TestInfo object // ... // ... // ... // <-- individual assertion failures // // // // Formats the given time in milliseconds as seconds. std::string FormatTimeInMillisAsSeconds(TimeInMillis ms) { ::std::stringstream ss; ss << ms/1000.0; return ss.str(); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. void XmlUnitTestResultPrinter::OutputXmlCDataSection(::std::ostream* stream, const char* data) { const char* segment = data; *stream << ""); if (next_segment != NULL) { stream->write( segment, static_cast(next_segment - segment)); *stream << "]]>]]>"); } else { *stream << segment; break; } } *stream << "]]>"; } // Prints an XML representation of a TestInfo object. // TODO(wan): There is also value in printing properties with the plain printer. void XmlUnitTestResultPrinter::OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info) { const TestResult& result = *test_info.result(); *stream << " \n"; *stream << " "; const string location = internal::FormatCompilerIndependentFileLocation( part.file_name(), part.line_number()); const string message = location + "\n" + part.message(); OutputXmlCDataSection(stream, RemoveInvalidXmlCharacters(message).c_str()); *stream << "\n"; } } if (failures == 0) *stream << " />\n"; else *stream << " \n"; } // Prints an XML representation of a TestCase object void XmlUnitTestResultPrinter::PrintXmlTestCase(FILE* out, const TestCase& test_case) { fprintf(out, " \n", FormatTimeInMillisAsSeconds(test_case.elapsed_time()).c_str()); for (int i = 0; i < test_case.total_test_count(); ++i) { ::std::stringstream stream; OutputXmlTestInfo(&stream, test_case.name(), *test_case.GetTestInfo(i)); fprintf(out, "%s", StringStreamToString(&stream).c_str()); } fprintf(out, " \n"); } // Prints an XML summary of unit_test to output stream out. void XmlUnitTestResultPrinter::PrintXmlUnitTest(FILE* out, const UnitTest& unit_test) { fprintf(out, "\n"); fprintf(out, "\n"); for (int i = 0; i < unit_test.total_test_case_count(); ++i) PrintXmlTestCase(out, *unit_test.GetTestCase(i)); fprintf(out, "\n"); } // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. String XmlUnitTestResultPrinter::TestPropertiesAsXmlAttributes( const TestResult& result) { Message attributes; for (int i = 0; i < result.test_property_count(); ++i) { const TestProperty& property = result.GetTestProperty(i); attributes << " " << property.key() << "=" << "\"" << EscapeXmlAttribute(property.value()) << "\""; } return attributes.GetString(); } // End XmlUnitTestResultPrinter #if GTEST_CAN_STREAM_RESULTS_ // Streams test results to the given port on the given host machine. class StreamingListener : public EmptyTestEventListener { public: // Escapes '=', '&', '%', and '\n' characters in str as "%xx". static string UrlEncode(const char* str); StreamingListener(const string& host, const string& port) : sockfd_(-1), host_name_(host), port_num_(port) { MakeConnection(); Send("gtest_streaming_protocol_version=1.0\n"); } virtual ~StreamingListener() { if (sockfd_ != -1) CloseConnection(); } void OnTestProgramStart(const UnitTest& /* unit_test */) { Send("event=TestProgramStart\n"); } void OnTestProgramEnd(const UnitTest& unit_test) { // Note that Google Test current only report elapsed time for each // test iteration, not for the entire test program. Send(String::Format("event=TestProgramEnd&passed=%d\n", unit_test.Passed())); // Notify the streaming server to stop. CloseConnection(); } void OnTestIterationStart(const UnitTest& /* unit_test */, int iteration) { Send(String::Format("event=TestIterationStart&iteration=%d\n", iteration)); } void OnTestIterationEnd(const UnitTest& unit_test, int /* iteration */) { Send(String::Format("event=TestIterationEnd&passed=%d&elapsed_time=%sms\n", unit_test.Passed(), StreamableToString(unit_test.elapsed_time()).c_str())); } void OnTestCaseStart(const TestCase& test_case) { Send(String::Format("event=TestCaseStart&name=%s\n", test_case.name())); } void OnTestCaseEnd(const TestCase& test_case) { Send(String::Format("event=TestCaseEnd&passed=%d&elapsed_time=%sms\n", test_case.Passed(), StreamableToString(test_case.elapsed_time()).c_str())); } void OnTestStart(const TestInfo& test_info) { Send(String::Format("event=TestStart&name=%s\n", test_info.name())); } void OnTestEnd(const TestInfo& test_info) { Send(String::Format( "event=TestEnd&passed=%d&elapsed_time=%sms\n", (test_info.result())->Passed(), StreamableToString((test_info.result())->elapsed_time()).c_str())); } void OnTestPartResult(const TestPartResult& test_part_result) { const char* file_name = test_part_result.file_name(); if (file_name == NULL) file_name = ""; Send(String::Format("event=TestPartResult&file=%s&line=%d&message=", UrlEncode(file_name).c_str(), test_part_result.line_number())); Send(UrlEncode(test_part_result.message()) + "\n"); } private: // Creates a client socket and connects to the server. void MakeConnection(); // Closes the socket. void CloseConnection() { GTEST_CHECK_(sockfd_ != -1) << "CloseConnection() can be called only when there is a connection."; close(sockfd_); sockfd_ = -1; } // Sends a string to the socket. void Send(const string& message) { GTEST_CHECK_(sockfd_ != -1) << "Send() can be called only when there is a connection."; const int len = static_cast(message.length()); if (write(sockfd_, message.c_str(), len) != len) { GTEST_LOG_(WARNING) << "stream_result_to: failed to stream to " << host_name_ << ":" << port_num_; } } int sockfd_; // socket file descriptor const string host_name_; const string port_num_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamingListener); }; // class StreamingListener // Checks if str contains '=', '&', '%' or '\n' characters. If yes, // replaces them by "%xx" where xx is their hexadecimal value. For // example, replaces "=" with "%3D". This algorithm is O(strlen(str)) // in both time and space -- important as the input str may contain an // arbitrarily long test failure message and stack trace. string StreamingListener::UrlEncode(const char* str) { string result; result.reserve(strlen(str) + 1); for (char ch = *str; ch != '\0'; ch = *++str) { switch (ch) { case '%': case '=': case '&': case '\n': result.append(String::Format("%%%02x", static_cast(ch))); break; default: result.push_back(ch); break; } } return result; } void StreamingListener::MakeConnection() { GTEST_CHECK_(sockfd_ == -1) << "MakeConnection() can't be called when there is already a connection."; addrinfo hints; memset(&hints, 0, sizeof(hints)); hints.ai_family = AF_UNSPEC; // To allow both IPv4 and IPv6 addresses. hints.ai_socktype = SOCK_STREAM; addrinfo* servinfo = NULL; // Use the getaddrinfo() to get a linked list of IP addresses for // the given host name. const int error_num = getaddrinfo( host_name_.c_str(), port_num_.c_str(), &hints, &servinfo); if (error_num != 0) { GTEST_LOG_(WARNING) << "stream_result_to: getaddrinfo() failed: " << gai_strerror(error_num); } // Loop through all the results and connect to the first we can. for (addrinfo* cur_addr = servinfo; sockfd_ == -1 && cur_addr != NULL; cur_addr = cur_addr->ai_next) { sockfd_ = socket( cur_addr->ai_family, cur_addr->ai_socktype, cur_addr->ai_protocol); if (sockfd_ != -1) { // Connect the client socket to the server socket. if (connect(sockfd_, cur_addr->ai_addr, cur_addr->ai_addrlen) == -1) { close(sockfd_); sockfd_ = -1; } } } freeaddrinfo(servinfo); // all done with this structure if (sockfd_ == -1) { GTEST_LOG_(WARNING) << "stream_result_to: failed to connect to " << host_name_ << ":" << port_num_; } } // End of class Streaming Listener #endif // GTEST_CAN_STREAM_RESULTS__ // Class ScopedTrace // Pushes the given source file location and message onto a per-thread // trace stack maintained by Google Test. // L < UnitTest::mutex_ ScopedTrace::ScopedTrace(const char* file, int line, const Message& message) { TraceInfo trace; trace.file = file; trace.line = line; trace.message = message.GetString(); UnitTest::GetInstance()->PushGTestTrace(trace); } // Pops the info pushed by the c'tor. // L < UnitTest::mutex_ ScopedTrace::~ScopedTrace() { UnitTest::GetInstance()->PopGTestTrace(); } // class OsStackTraceGetter // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. // // L < mutex_ // We use "L < mutex_" to denote that the function may acquire mutex_. String OsStackTraceGetter::CurrentStackTrace(int, int) { return String(""); } // L < mutex_ void OsStackTraceGetter::UponLeavingGTest() { } const char* const OsStackTraceGetter::kElidedFramesMarker = "... " GTEST_NAME_ " internal frames ..."; } // namespace internal // class TestEventListeners TestEventListeners::TestEventListeners() : repeater_(new internal::TestEventRepeater()), default_result_printer_(NULL), default_xml_generator_(NULL) { } TestEventListeners::~TestEventListeners() { delete repeater_; } // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the user. void TestEventListeners::Append(TestEventListener* listener) { repeater_->Append(listener); } // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* TestEventListeners::Release(TestEventListener* listener) { if (listener == default_result_printer_) default_result_printer_ = NULL; else if (listener == default_xml_generator_) default_xml_generator_ = NULL; return repeater_->Release(listener); } // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* TestEventListeners::repeater() { return repeater_; } // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultResultPrinter(TestEventListener* listener) { if (default_result_printer_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_result_printer_); default_result_printer_ = listener; if (listener != NULL) Append(listener); } } // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultXmlGenerator(TestEventListener* listener) { if (default_xml_generator_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_xml_generator_); default_xml_generator_ = listener; if (listener != NULL) Append(listener); } } // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool TestEventListeners::EventForwardingEnabled() const { return repeater_->forwarding_enabled(); } void TestEventListeners::SuppressEventForwarding() { repeater_->set_forwarding_enabled(false); } // class UnitTest // Gets the singleton UnitTest object. The first time this method is // called, a UnitTest object is constructed and returned. Consecutive // calls will return the same object. // // We don't protect this under mutex_ as a user is not supposed to // call this before main() starts, from which point on the return // value will never change. UnitTest * UnitTest::GetInstance() { // When compiled with MSVC 7.1 in optimized mode, destroying the // UnitTest object upon exiting the program messes up the exit code, // causing successful tests to appear failed. We have to use a // different implementation in this case to bypass the compiler bug. // This implementation makes the compiler happy, at the cost of // leaking the UnitTest object. // CodeGear C++Builder insists on a public destructor for the // default implementation. Use this implementation to keep good OO // design with private destructor. #if (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) static UnitTest* const instance = new UnitTest; return instance; #else static UnitTest instance; return &instance; #endif // (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) } // Gets the number of successful test cases. int UnitTest::successful_test_case_count() const { return impl()->successful_test_case_count(); } // Gets the number of failed test cases. int UnitTest::failed_test_case_count() const { return impl()->failed_test_case_count(); } // Gets the number of all test cases. int UnitTest::total_test_case_count() const { return impl()->total_test_case_count(); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTest::test_case_to_run_count() const { return impl()->test_case_to_run_count(); } // Gets the number of successful tests. int UnitTest::successful_test_count() const { return impl()->successful_test_count(); } // Gets the number of failed tests. int UnitTest::failed_test_count() const { return impl()->failed_test_count(); } // Gets the number of disabled tests. int UnitTest::disabled_test_count() const { return impl()->disabled_test_count(); } // Gets the number of all tests. int UnitTest::total_test_count() const { return impl()->total_test_count(); } // Gets the number of tests that should run. int UnitTest::test_to_run_count() const { return impl()->test_to_run_count(); } // Gets the elapsed time, in milliseconds. internal::TimeInMillis UnitTest::elapsed_time() const { return impl()->elapsed_time(); } // Returns true iff the unit test passed (i.e. all test cases passed). bool UnitTest::Passed() const { return impl()->Passed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool UnitTest::Failed() const { return impl()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* UnitTest::GetTestCase(int i) const { return impl()->GetTestCase(i); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* UnitTest::GetMutableTestCase(int i) { return impl()->GetMutableTestCase(i); } // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& UnitTest::listeners() { return *impl()->listeners(); } // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in the // order they were registered. After all tests in the program have // finished, all global test environments will be torn-down in the // *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // We don't protect this under mutex_, as we only support calling it // from the main thread. Environment* UnitTest::AddEnvironment(Environment* env) { if (env == NULL) { return NULL; } impl_->environments().push_back(env); return env; } // Adds a TestPartResult to the current TestResult object. All Google Test // assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) eventually call // this to report their results. The user code should use the // assertion macros instead of calling this directly. // L < mutex_ void UnitTest::AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace) { Message msg; msg << message; internal::MutexLock lock(&mutex_); if (impl_->gtest_trace_stack().size() > 0) { msg << "\n" << GTEST_NAME_ << " trace:"; for (int i = static_cast(impl_->gtest_trace_stack().size()); i > 0; --i) { const internal::TraceInfo& trace = impl_->gtest_trace_stack()[i - 1]; msg << "\n" << internal::FormatFileLocation(trace.file, trace.line) << " " << trace.message; } } if (os_stack_trace.c_str() != NULL && !os_stack_trace.empty()) { msg << internal::kStackTraceMarker << os_stack_trace; } const TestPartResult result = TestPartResult(result_type, file_name, line_number, msg.GetString().c_str()); impl_->GetTestPartResultReporterForCurrentThread()-> ReportTestPartResult(result); if (result_type != TestPartResult::kSuccess) { // gtest_break_on_failure takes precedence over // gtest_throw_on_failure. This allows a user to set the latter // in the code (perhaps in order to use Google Test assertions // with another testing framework) and specify the former on the // command line for debugging. if (GTEST_FLAG(break_on_failure)) { #if GTEST_OS_WINDOWS // Using DebugBreak on Windows allows gtest to still break into a debugger // when a failure happens and both the --gtest_break_on_failure and // the --gtest_catch_exceptions flags are specified. DebugBreak(); #else // Dereference NULL through a volatile pointer to prevent the compiler // from removing. We use this rather than abort() or __builtin_trap() for // portability: Symbian doesn't implement abort() well, and some debuggers // don't correctly trap abort(). *static_cast(NULL) = 1; #endif // GTEST_OS_WINDOWS } else if (GTEST_FLAG(throw_on_failure)) { #if GTEST_HAS_EXCEPTIONS throw GoogleTestFailureException(result); #else // We cannot call abort() as it generates a pop-up in debug mode // that cannot be suppressed in VC 7.1 or below. exit(1); #endif } } } // Creates and adds a property to the current TestResult. If a property matching // the supplied value already exists, updates its value instead. void UnitTest::RecordPropertyForCurrentTest(const char* key, const char* value) { const TestProperty test_property(key, value); impl_->current_test_result()->RecordProperty(test_property); } // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // We don't protect this under mutex_, as we only support calling it // from the main thread. int UnitTest::Run() { // Captures the value of GTEST_FLAG(catch_exceptions). This value will be // used for the duration of the program. impl()->set_catch_exceptions(GTEST_FLAG(catch_exceptions)); #if GTEST_HAS_SEH const bool in_death_test_child_process = internal::GTEST_FLAG(internal_run_death_test).length() > 0; // Either the user wants Google Test to catch exceptions thrown by the // tests or this is executing in the context of death test child // process. In either case the user does not want to see pop-up dialogs // about crashes - they are expected. if (impl()->catch_exceptions() || in_death_test_child_process) { # if !GTEST_OS_WINDOWS_MOBILE // SetErrorMode doesn't exist on CE. SetErrorMode(SEM_FAILCRITICALERRORS | SEM_NOALIGNMENTFAULTEXCEPT | SEM_NOGPFAULTERRORBOX | SEM_NOOPENFILEERRORBOX); # endif // !GTEST_OS_WINDOWS_MOBILE # if (defined(_MSC_VER) || GTEST_OS_WINDOWS_MINGW) && !GTEST_OS_WINDOWS_MOBILE // Death test children can be terminated with _abort(). On Windows, // _abort() can show a dialog with a warning message. This forces the // abort message to go to stderr instead. _set_error_mode(_OUT_TO_STDERR); # endif # if _MSC_VER >= 1400 && !GTEST_OS_WINDOWS_MOBILE // In the debug version, Visual Studio pops up a separate dialog // offering a choice to debug the aborted program. We need to suppress // this dialog or it will pop up for every EXPECT/ASSERT_DEATH statement // executed. Google Test will notify the user of any unexpected // failure via stderr. // // VC++ doesn't define _set_abort_behavior() prior to the version 8.0. // Users of prior VC versions shall suffer the agony and pain of // clicking through the countless debug dialogs. // TODO(vladl@google.com): find a way to suppress the abort dialog() in the // debug mode when compiled with VC 7.1 or lower. if (!GTEST_FLAG(break_on_failure)) _set_abort_behavior( 0x0, // Clear the following flags: _WRITE_ABORT_MSG | _CALL_REPORTFAULT); // pop-up window, core dump. # endif } #endif // GTEST_HAS_SEH return internal::HandleExceptionsInMethodIfSupported( impl(), &internal::UnitTestImpl::RunAllTests, "auxiliary test code (environments or event listeners)") ? 0 : 1; } // Returns the working directory when the first TEST() or TEST_F() was // executed. const char* UnitTest::original_working_dir() const { return impl_->original_working_dir_.c_str(); } // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestCase* UnitTest::current_test_case() const { internal::MutexLock lock(&mutex_); return impl_->current_test_case(); } // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestInfo* UnitTest::current_test_info() const { internal::MutexLock lock(&mutex_); return impl_->current_test_info(); } // Returns the random seed used at the start of the current test run. int UnitTest::random_seed() const { return impl_->random_seed(); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // L < mutex_ internal::ParameterizedTestCaseRegistry& UnitTest::parameterized_test_registry() { return impl_->parameterized_test_registry(); } #endif // GTEST_HAS_PARAM_TEST // Creates an empty UnitTest. UnitTest::UnitTest() { impl_ = new internal::UnitTestImpl(this); } // Destructor of UnitTest. UnitTest::~UnitTest() { delete impl_; } // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. // L < mutex_ void UnitTest::PushGTestTrace(const internal::TraceInfo& trace) { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().push_back(trace); } // Pops a trace from the per-thread Google Test trace stack. // L < mutex_ void UnitTest::PopGTestTrace() { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().pop_back(); } namespace internal { UnitTestImpl::UnitTestImpl(UnitTest* parent) : parent_(parent), #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355 // (using this in initializer). default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), # pragma warning(pop) // Restores the warning state again. #else default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), #endif // _MSC_VER global_test_part_result_repoter_( &default_global_test_part_result_reporter_), per_thread_test_part_result_reporter_( &default_per_thread_test_part_result_reporter_), #if GTEST_HAS_PARAM_TEST parameterized_test_registry_(), parameterized_tests_registered_(false), #endif // GTEST_HAS_PARAM_TEST last_death_test_case_(-1), current_test_case_(NULL), current_test_info_(NULL), ad_hoc_test_result_(), os_stack_trace_getter_(NULL), post_flag_parse_init_performed_(false), random_seed_(0), // Will be overridden by the flag before first use. random_(0), // Will be reseeded before first use. elapsed_time_(0), #if GTEST_HAS_DEATH_TEST internal_run_death_test_flag_(NULL), death_test_factory_(new DefaultDeathTestFactory), #endif // Will be overridden by the flag before first use. catch_exceptions_(false) { listeners()->SetDefaultResultPrinter(new PrettyUnitTestResultPrinter); } UnitTestImpl::~UnitTestImpl() { // Deletes every TestCase. ForEach(test_cases_, internal::Delete); // Deletes every Environment. ForEach(environments_, internal::Delete); delete os_stack_trace_getter_; } #if GTEST_HAS_DEATH_TEST // Disables event forwarding if the control is currently in a death test // subprocess. Must not be called before InitGoogleTest. void UnitTestImpl::SuppressTestEventsIfInSubprocess() { if (internal_run_death_test_flag_.get() != NULL) listeners()->SuppressEventForwarding(); } #endif // GTEST_HAS_DEATH_TEST // Initializes event listeners performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureXmlOutput() { const String& output_format = UnitTestOptions::GetOutputFormat(); if (output_format == "xml") { listeners()->SetDefaultXmlGenerator(new XmlUnitTestResultPrinter( UnitTestOptions::GetAbsolutePathToOutputFile().c_str())); } else if (output_format != "") { printf("WARNING: unrecognized output format \"%s\" ignored.\n", output_format.c_str()); fflush(stdout); } } #if GTEST_CAN_STREAM_RESULTS_ // Initializes event listeners for streaming test results in String form. // Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureStreamingOutput() { const string& target = GTEST_FLAG(stream_result_to); if (!target.empty()) { const size_t pos = target.find(':'); if (pos != string::npos) { listeners()->Append(new StreamingListener(target.substr(0, pos), target.substr(pos+1))); } else { printf("WARNING: unrecognized streaming target \"%s\" ignored.\n", target.c_str()); fflush(stdout); } } } #endif // GTEST_CAN_STREAM_RESULTS_ // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void UnitTestImpl::PostFlagParsingInit() { // Ensures that this function does not execute more than once. if (!post_flag_parse_init_performed_) { post_flag_parse_init_performed_ = true; #if GTEST_HAS_DEATH_TEST InitDeathTestSubprocessControlInfo(); SuppressTestEventsIfInSubprocess(); #endif // GTEST_HAS_DEATH_TEST // Registers parameterized tests. This makes parameterized tests // available to the UnitTest reflection API without running // RUN_ALL_TESTS. RegisterParameterizedTests(); // Configures listeners for XML output. This makes it possible for users // to shut down the default XML output before invoking RUN_ALL_TESTS. ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Configures listeners for streaming test results to the specified server. ConfigureStreamingOutput(); #endif // GTEST_CAN_STREAM_RESULTS_ } } // A predicate that checks the name of a TestCase against a known // value. // // This is used for implementation of the UnitTest class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestCaseNameIs is copyable. class TestCaseNameIs { public: // Constructor. explicit TestCaseNameIs(const String& name) : name_(name) {} // Returns true iff the name of test_case matches name_. bool operator()(const TestCase* test_case) const { return test_case != NULL && strcmp(test_case->name(), name_.c_str()) == 0; } private: String name_; }; // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. It's the CALLER'S // RESPONSIBILITY to ensure that this function is only called WHEN THE // TESTS ARE NOT SHUFFLED. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* UnitTestImpl::GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) { // Can we find a TestCase with the given name? const std::vector::const_iterator test_case = std::find_if(test_cases_.begin(), test_cases_.end(), TestCaseNameIs(test_case_name)); if (test_case != test_cases_.end()) return *test_case; // No. Let's create one. TestCase* const new_test_case = new TestCase(test_case_name, type_param, set_up_tc, tear_down_tc); // Is this a death test case? if (internal::UnitTestOptions::MatchesFilter(String(test_case_name), kDeathTestCaseFilter)) { // Yes. Inserts the test case after the last death test case // defined so far. This only works when the test cases haven't // been shuffled. Otherwise we may end up running a death test // after a non-death test. ++last_death_test_case_; test_cases_.insert(test_cases_.begin() + last_death_test_case_, new_test_case); } else { // No. Appends to the end of the list. test_cases_.push_back(new_test_case); } test_case_indices_.push_back(static_cast(test_case_indices_.size())); return new_test_case; } // Helpers for setting up / tearing down the given environment. They // are for use in the ForEach() function. static void SetUpEnvironment(Environment* env) { env->SetUp(); } static void TearDownEnvironment(Environment* env) { env->TearDown(); } // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, the test is considered to be failed, but the // rest of the tests will still be run. // // When parameterized tests are enabled, it expands and registers // parameterized tests first in RegisterParameterizedTests(). // All other functions called from RunAllTests() may safely assume that // parameterized tests are ready to be counted and run. bool UnitTestImpl::RunAllTests() { // Makes sure InitGoogleTest() was called. if (!GTestIsInitialized()) { printf("%s", "\nThis test program did NOT call ::testing::InitGoogleTest " "before calling RUN_ALL_TESTS(). Please fix it.\n"); return false; } // Do not run any test if the --help flag was specified. if (g_help_flag) return true; // Repeats the call to the post-flag parsing initialization in case the // user didn't call InitGoogleTest. PostFlagParsingInit(); // Even if sharding is not on, test runners may want to use the // GTEST_SHARD_STATUS_FILE to query whether the test supports the sharding // protocol. internal::WriteToShardStatusFileIfNeeded(); // True iff we are in a subprocess for running a thread-safe-style // death test. bool in_subprocess_for_death_test = false; #if GTEST_HAS_DEATH_TEST in_subprocess_for_death_test = (internal_run_death_test_flag_.get() != NULL); #endif // GTEST_HAS_DEATH_TEST const bool should_shard = ShouldShard(kTestTotalShards, kTestShardIndex, in_subprocess_for_death_test); // Compares the full test names with the filter to decide which // tests to run. const bool has_tests_to_run = FilterTests(should_shard ? HONOR_SHARDING_PROTOCOL : IGNORE_SHARDING_PROTOCOL) > 0; // Lists the tests and exits if the --gtest_list_tests flag was specified. if (GTEST_FLAG(list_tests)) { // This must be called *after* FilterTests() has been called. ListTestsMatchingFilter(); return true; } random_seed_ = GTEST_FLAG(shuffle) ? GetRandomSeedFromFlag(GTEST_FLAG(random_seed)) : 0; // True iff at least one test has failed. bool failed = false; TestEventListener* repeater = listeners()->repeater(); repeater->OnTestProgramStart(*parent_); // How many times to repeat the tests? We don't want to repeat them // when we are inside the subprocess of a death test. const int repeat = in_subprocess_for_death_test ? 1 : GTEST_FLAG(repeat); // Repeats forever if the repeat count is negative. const bool forever = repeat < 0; for (int i = 0; forever || i != repeat; i++) { // We want to preserve failures generated by ad-hoc test // assertions executed before RUN_ALL_TESTS(). ClearNonAdHocTestResult(); const TimeInMillis start = GetTimeInMillis(); // Shuffles test cases and tests if requested. if (has_tests_to_run && GTEST_FLAG(shuffle)) { random()->Reseed(random_seed_); // This should be done before calling OnTestIterationStart(), // such that a test event listener can see the actual test order // in the event. ShuffleTests(); } // Tells the unit test event listeners that the tests are about to start. repeater->OnTestIterationStart(*parent_, i); // Runs each test case if there is at least one test to run. if (has_tests_to_run) { // Sets up all environments beforehand. repeater->OnEnvironmentsSetUpStart(*parent_); ForEach(environments_, SetUpEnvironment); repeater->OnEnvironmentsSetUpEnd(*parent_); // Runs the tests only if there was no fatal failure during global // set-up. if (!Test::HasFatalFailure()) { for (int test_index = 0; test_index < total_test_case_count(); test_index++) { GetMutableTestCase(test_index)->Run(); } } // Tears down all environments in reverse order afterwards. repeater->OnEnvironmentsTearDownStart(*parent_); std::for_each(environments_.rbegin(), environments_.rend(), TearDownEnvironment); repeater->OnEnvironmentsTearDownEnd(*parent_); } elapsed_time_ = GetTimeInMillis() - start; // Tells the unit test event listener that the tests have just finished. repeater->OnTestIterationEnd(*parent_, i); // Gets the result and clears it. if (!Passed()) { failed = true; } // Restores the original test order after the iteration. This // allows the user to quickly repro a failure that happens in the // N-th iteration without repeating the first (N - 1) iterations. // This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in // case the user somehow changes the value of the flag somewhere // (it's always safe to unshuffle the tests). UnshuffleTests(); if (GTEST_FLAG(shuffle)) { // Picks a new random seed for each iteration. random_seed_ = GetNextRandomSeed(random_seed_); } } repeater->OnTestProgramEnd(*parent_); return !failed; } // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded() { const char* const test_shard_file = posix::GetEnv(kTestShardStatusFile); if (test_shard_file != NULL) { FILE* const file = posix::FOpen(test_shard_file, "w"); if (file == NULL) { ColoredPrintf(COLOR_RED, "Could not write to the test shard status file \"%s\" " "specified by the %s environment variable.\n", test_shard_file, kTestShardStatusFile); fflush(stdout); exit(EXIT_FAILURE); } fclose(file); } } // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (i.e., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. bool ShouldShard(const char* total_shards_env, const char* shard_index_env, bool in_subprocess_for_death_test) { if (in_subprocess_for_death_test) { return false; } const Int32 total_shards = Int32FromEnvOrDie(total_shards_env, -1); const Int32 shard_index = Int32FromEnvOrDie(shard_index_env, -1); if (total_shards == -1 && shard_index == -1) { return false; } else if (total_shards == -1 && shard_index != -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestShardIndex << " = " << shard_index << ", but have left " << kTestTotalShards << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (total_shards != -1 && shard_index == -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestTotalShards << " = " << total_shards << ", but have left " << kTestShardIndex << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (shard_index < 0 || shard_index >= total_shards) { const Message msg = Message() << "Invalid environment variables: we require 0 <= " << kTestShardIndex << " < " << kTestTotalShards << ", but you have " << kTestShardIndex << "=" << shard_index << ", " << kTestTotalShards << "=" << total_shards << ".\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } return total_shards > 1; } // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error // and aborts. Int32 Int32FromEnvOrDie(const char* var, Int32 default_val) { const char* str_val = posix::GetEnv(var); if (str_val == NULL) { return default_val; } Int32 result; if (!ParseInt32(Message() << "The value of environment variable " << var, str_val, &result)) { exit(EXIT_FAILURE); } return result; } // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. bool ShouldRunTestOnShard(int total_shards, int shard_index, int test_id) { return (test_id % total_shards) == shard_index; } // Compares the name of each test with the user-specified filter to // decide whether the test should be run, then records the result in // each TestCase and TestInfo object. // If shard_tests == true, further filters tests based on sharding // variables in the environment - see // http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide. // Returns the number of tests that should run. int UnitTestImpl::FilterTests(ReactionToSharding shard_tests) { const Int32 total_shards = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestTotalShards, -1) : -1; const Int32 shard_index = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestShardIndex, -1) : -1; // num_runnable_tests are the number of tests that will // run across all shards (i.e., match filter and are not disabled). // num_selected_tests are the number of tests to be run on // this shard. int num_runnable_tests = 0; int num_selected_tests = 0; for (size_t i = 0; i < test_cases_.size(); i++) { TestCase* const test_case = test_cases_[i]; const String &test_case_name = test_case->name(); test_case->set_should_run(false); for (size_t j = 0; j < test_case->test_info_list().size(); j++) { TestInfo* const test_info = test_case->test_info_list()[j]; const String test_name(test_info->name()); // A test is disabled if test case name or test name matches // kDisableTestFilter. const bool is_disabled = internal::UnitTestOptions::MatchesFilter(test_case_name, kDisableTestFilter) || internal::UnitTestOptions::MatchesFilter(test_name, kDisableTestFilter); test_info->is_disabled_ = is_disabled; const bool matches_filter = internal::UnitTestOptions::FilterMatchesTest(test_case_name, test_name); test_info->matches_filter_ = matches_filter; const bool is_runnable = (GTEST_FLAG(also_run_disabled_tests) || !is_disabled) && matches_filter; const bool is_selected = is_runnable && (shard_tests == IGNORE_SHARDING_PROTOCOL || ShouldRunTestOnShard(total_shards, shard_index, num_runnable_tests)); num_runnable_tests += is_runnable; num_selected_tests += is_selected; test_info->should_run_ = is_selected; test_case->set_should_run(test_case->should_run() || is_selected); } } return num_selected_tests; } // Prints the names of the tests matching the user-specified filter flag. void UnitTestImpl::ListTestsMatchingFilter() { for (size_t i = 0; i < test_cases_.size(); i++) { const TestCase* const test_case = test_cases_[i]; bool printed_test_case_name = false; for (size_t j = 0; j < test_case->test_info_list().size(); j++) { const TestInfo* const test_info = test_case->test_info_list()[j]; if (test_info->matches_filter_) { if (!printed_test_case_name) { printed_test_case_name = true; printf("%s.\n", test_case->name()); } printf(" %s\n", test_info->name()); } } } fflush(stdout); } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter are // the same; otherwise, deletes the old getter and makes the input the // current getter. void UnitTestImpl::set_os_stack_trace_getter( OsStackTraceGetterInterface* getter) { if (os_stack_trace_getter_ != getter) { delete os_stack_trace_getter_; os_stack_trace_getter_ = getter; } } // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* UnitTestImpl::os_stack_trace_getter() { if (os_stack_trace_getter_ == NULL) { os_stack_trace_getter_ = new OsStackTraceGetter; } return os_stack_trace_getter_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* UnitTestImpl::current_test_result() { return current_test_info_ ? &(current_test_info_->result_) : &ad_hoc_test_result_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void UnitTestImpl::ShuffleTests() { // Shuffles the death test cases. ShuffleRange(random(), 0, last_death_test_case_ + 1, &test_case_indices_); // Shuffles the non-death test cases. ShuffleRange(random(), last_death_test_case_ + 1, static_cast(test_cases_.size()), &test_case_indices_); // Shuffles the tests inside each test case. for (size_t i = 0; i < test_cases_.size(); i++) { test_cases_[i]->ShuffleTests(random()); } } // Restores the test cases and tests to their order before the first shuffle. void UnitTestImpl::UnshuffleTests() { for (size_t i = 0; i < test_cases_.size(); i++) { // Unshuffles the tests in each test case. test_cases_[i]->UnshuffleTests(); // Resets the index of each test case. test_case_indices_[i] = static_cast(i); } } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. String GetCurrentOsStackTraceExceptTop(UnitTest* /*unit_test*/, int skip_count) { // We pass skip_count + 1 to skip this wrapper function in addition // to what the user really wants to skip. return GetUnitTestImpl()->CurrentOsStackTraceExceptTop(skip_count + 1); } // Used by the GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_ macro to // suppress unreachable code warnings. namespace { class ClassUniqueToAlwaysTrue {}; } bool IsTrue(bool condition) { return condition; } bool AlwaysTrue() { #if GTEST_HAS_EXCEPTIONS // This condition is always false so AlwaysTrue() never actually throws, // but it makes the compiler think that it may throw. if (IsTrue(false)) throw ClassUniqueToAlwaysTrue(); #endif // GTEST_HAS_EXCEPTIONS return true; } // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. bool SkipPrefix(const char* prefix, const char** pstr) { const size_t prefix_len = strlen(prefix); if (strncmp(*pstr, prefix, prefix_len) == 0) { *pstr += prefix_len; return true; } return false; } // Parses a string as a command line flag. The string should have // the format "--flag=value". When def_optional is true, the "=value" // part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. const char* ParseFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--" followed by GTEST_FLAG_PREFIX_. const String flag_str = String::Format("--%s%s", GTEST_FLAG_PREFIX_, flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a bool flag, in the form of either // "--flag=value" or "--flag". // // In the former case, the value is taken as true as long as it does // not start with '0', 'f', or 'F'. // // In the latter case, the value is taken as true. // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for an Int32 flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseInt32Flag(const char* str, const char* flag, Int32* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. return ParseInt32(Message() << "The value of flag --" << flag, value_str, value); } // Parses a string for a string flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // Determines whether a string has a prefix that Google Test uses for its // flags, i.e., starts with GTEST_FLAG_PREFIX_ or GTEST_FLAG_PREFIX_DASH_. // If Google Test detects that a command line flag has its prefix but is not // recognized, it will print its help message. Flags starting with // GTEST_INTERNAL_PREFIX_ followed by "internal_" are considered Google Test // internal flags and do not trigger the help message. static bool HasGoogleTestFlagPrefix(const char* str) { return (SkipPrefix("--", &str) || SkipPrefix("-", &str) || SkipPrefix("/", &str)) && !SkipPrefix(GTEST_FLAG_PREFIX_ "internal_", &str) && (SkipPrefix(GTEST_FLAG_PREFIX_, &str) || SkipPrefix(GTEST_FLAG_PREFIX_DASH_, &str)); } // Prints a string containing code-encoded text. The following escape // sequences can be used in the string to control the text color: // // @@ prints a single '@' character. // @R changes the color to red. // @G changes the color to green. // @Y changes the color to yellow. // @D changes to the default terminal text color. // // TODO(wan@google.com): Write tests for this once we add stdout // capturing to Google Test. static void PrintColorEncoded(const char* str) { GTestColor color = COLOR_DEFAULT; // The current color. // Conceptually, we split the string into segments divided by escape // sequences. Then we print one segment at a time. At the end of // each iteration, the str pointer advances to the beginning of the // next segment. for (;;) { const char* p = strchr(str, '@'); if (p == NULL) { ColoredPrintf(color, "%s", str); return; } ColoredPrintf(color, "%s", String(str, p - str).c_str()); const char ch = p[1]; str = p + 2; if (ch == '@') { ColoredPrintf(color, "@"); } else if (ch == 'D') { color = COLOR_DEFAULT; } else if (ch == 'R') { color = COLOR_RED; } else if (ch == 'G') { color = COLOR_GREEN; } else if (ch == 'Y') { color = COLOR_YELLOW; } else { --str; } } } static const char kColorEncodedHelpMessage[] = "This program contains tests written using " GTEST_NAME_ ". You can use the\n" "following command line flags to control its behavior:\n" "\n" "Test Selection:\n" " @G--" GTEST_FLAG_PREFIX_ "list_tests@D\n" " List the names of all tests instead of running them. The name of\n" " TEST(Foo, Bar) is \"Foo.Bar\".\n" " @G--" GTEST_FLAG_PREFIX_ "filter=@YPOSTIVE_PATTERNS" "[@G-@YNEGATIVE_PATTERNS]@D\n" " Run only the tests whose name matches one of the positive patterns but\n" " none of the negative patterns. '?' matches any single character; '*'\n" " matches any substring; ':' separates two patterns.\n" " @G--" GTEST_FLAG_PREFIX_ "also_run_disabled_tests@D\n" " Run all disabled tests too.\n" "\n" "Test Execution:\n" " @G--" GTEST_FLAG_PREFIX_ "repeat=@Y[COUNT]@D\n" " Run the tests repeatedly; use a negative count to repeat forever.\n" " @G--" GTEST_FLAG_PREFIX_ "shuffle@D\n" " Randomize tests' orders on every iteration.\n" " @G--" GTEST_FLAG_PREFIX_ "random_seed=@Y[NUMBER]@D\n" " Random number seed to use for shuffling test orders (between 1 and\n" " 99999, or 0 to use a seed based on the current time).\n" "\n" "Test Output:\n" " @G--" GTEST_FLAG_PREFIX_ "color=@Y(@Gyes@Y|@Gno@Y|@Gauto@Y)@D\n" " Enable/disable colored output. The default is @Gauto@D.\n" " -@G-" GTEST_FLAG_PREFIX_ "print_time=0@D\n" " Don't print the elapsed time of each test.\n" " @G--" GTEST_FLAG_PREFIX_ "output=xml@Y[@G:@YDIRECTORY_PATH@G" GTEST_PATH_SEP_ "@Y|@G:@YFILE_PATH]@D\n" " Generate an XML report in the given directory or with the given file\n" " name. @YFILE_PATH@D defaults to @Gtest_details.xml@D.\n" #if GTEST_CAN_STREAM_RESULTS_ " @G--" GTEST_FLAG_PREFIX_ "stream_result_to=@YHOST@G:@YPORT@D\n" " Stream test results to the given server.\n" #endif // GTEST_CAN_STREAM_RESULTS_ "\n" "Assertion Behavior:\n" #if GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "death_test_style=@Y(@Gfast@Y|@Gthreadsafe@Y)@D\n" " Set the default death test style.\n" #endif // GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "break_on_failure@D\n" " Turn assertion failures into debugger break-points.\n" " @G--" GTEST_FLAG_PREFIX_ "throw_on_failure@D\n" " Turn assertion failures into C++ exceptions.\n" " @G--" GTEST_FLAG_PREFIX_ "catch_exceptions=0@D\n" " Do not report exceptions as test failures. Instead, allow them\n" " to crash the program or throw a pop-up (on Windows).\n" "\n" "Except for @G--" GTEST_FLAG_PREFIX_ "list_tests@D, you can alternatively set " "the corresponding\n" "environment variable of a flag (all letters in upper-case). For example, to\n" "disable colored text output, you can either specify @G--" GTEST_FLAG_PREFIX_ "color=no@D or set\n" "the @G" GTEST_FLAG_PREFIX_UPPER_ "COLOR@D environment variable to @Gno@D.\n" "\n" "For more information, please read the " GTEST_NAME_ " documentation at\n" "@G" GTEST_PROJECT_URL_ "@D. If you find a bug in " GTEST_NAME_ "\n" "(not one in your own code or tests), please report it to\n" "@G<" GTEST_DEV_EMAIL_ ">@D.\n"; // Parses the command line for Google Test flags, without initializing // other parts of Google Test. The type parameter CharType can be // instantiated to either char or wchar_t. template void ParseGoogleTestFlagsOnlyImpl(int* argc, CharType** argv) { for (int i = 1; i < *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); using internal::ParseBoolFlag; using internal::ParseInt32Flag; using internal::ParseStringFlag; // Do we see a Google Test flag? if (ParseBoolFlag(arg, kAlsoRunDisabledTestsFlag, >EST_FLAG(also_run_disabled_tests)) || ParseBoolFlag(arg, kBreakOnFailureFlag, >EST_FLAG(break_on_failure)) || ParseBoolFlag(arg, kCatchExceptionsFlag, >EST_FLAG(catch_exceptions)) || ParseStringFlag(arg, kColorFlag, >EST_FLAG(color)) || ParseStringFlag(arg, kDeathTestStyleFlag, >EST_FLAG(death_test_style)) || ParseBoolFlag(arg, kDeathTestUseFork, >EST_FLAG(death_test_use_fork)) || ParseStringFlag(arg, kFilterFlag, >EST_FLAG(filter)) || ParseStringFlag(arg, kInternalRunDeathTestFlag, >EST_FLAG(internal_run_death_test)) || ParseBoolFlag(arg, kListTestsFlag, >EST_FLAG(list_tests)) || ParseStringFlag(arg, kOutputFlag, >EST_FLAG(output)) || ParseBoolFlag(arg, kPrintTimeFlag, >EST_FLAG(print_time)) || ParseInt32Flag(arg, kRandomSeedFlag, >EST_FLAG(random_seed)) || ParseInt32Flag(arg, kRepeatFlag, >EST_FLAG(repeat)) || ParseBoolFlag(arg, kShuffleFlag, >EST_FLAG(shuffle)) || ParseInt32Flag(arg, kStackTraceDepthFlag, >EST_FLAG(stack_trace_depth)) || ParseStringFlag(arg, kStreamResultToFlag, >EST_FLAG(stream_result_to)) || ParseBoolFlag(arg, kThrowOnFailureFlag, >EST_FLAG(throw_on_failure)) ) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } else if (arg_string == "--help" || arg_string == "-h" || arg_string == "-?" || arg_string == "/?" || HasGoogleTestFlagPrefix(arg)) { // Both help flag and unrecognized Google Test flags (excluding // internal ones) trigger help display. g_help_flag = true; } } if (g_help_flag) { // We print the help here instead of in RUN_ALL_TESTS(), as the // latter may not be called at all if the user is using Google // Test with another testing framework. PrintColorEncoded(kColorEncodedHelpMessage); } } // Parses the command line for Google Test flags, without initializing // other parts of Google Test. void ParseGoogleTestFlagsOnly(int* argc, char** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } // The internal implementation of InitGoogleTest(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleTestImpl(int* argc, CharType** argv) { g_init_gtest_count++; // We don't want to run the initialization code twice. if (g_init_gtest_count != 1) return; if (*argc <= 0) return; internal::g_executable_path = internal::StreamableToString(argv[0]); #if GTEST_HAS_DEATH_TEST g_argvs.clear(); for (int i = 0; i != *argc; i++) { g_argvs.push_back(StreamableToString(argv[i])); } #endif // GTEST_HAS_DEATH_TEST ParseGoogleTestFlagsOnly(argc, argv); GetUnitTestImpl()->PostFlagParsingInit(); } } // namespace internal // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. void InitGoogleTest(int* argc, char** argv) { internal::InitGoogleTestImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleTest(int* argc, wchar_t** argv) { internal::InitGoogleTestImpl(argc, argv); } } // namespace testing // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // // This file implements death tests. #if GTEST_HAS_DEATH_TEST # if GTEST_OS_MAC # include # endif // GTEST_OS_MAC # include # include # include # include # if GTEST_OS_WINDOWS # include # else # include # include # endif // GTEST_OS_WINDOWS #endif // GTEST_HAS_DEATH_TEST // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { // Constants. // The default death test style. static const char kDefaultDeathTestStyle[] = "fast"; GTEST_DEFINE_string_( death_test_style, internal::StringFromGTestEnv("death_test_style", kDefaultDeathTestStyle), "Indicates how to run a death test in a forked child process: " "\"threadsafe\" (child process re-executes the test binary " "from the beginning, running only the specific death test) or " "\"fast\" (child process runs the death test immediately " "after forking)."); GTEST_DEFINE_bool_( death_test_use_fork, internal::BoolFromGTestEnv("death_test_use_fork", false), "Instructs to use fork()/_exit() instead of clone() in death tests. " "Ignored and always uses fork() on POSIX systems where clone() is not " "implemented. Useful when running under valgrind or similar tools if " "those do not support clone(). Valgrind 3.3.1 will just fail if " "it sees an unsupported combination of clone() flags. " "It is not recommended to use this flag w/o valgrind though it will " "work in 99% of the cases. Once valgrind is fixed, this flag will " "most likely be removed."); namespace internal { GTEST_DEFINE_string_( internal_run_death_test, "", "Indicates the file, line number, temporal index of " "the single death test to run, and a file descriptor to " "which a success code may be sent, all separated by " "colons. This flag is specified if and only if the current " "process is a sub-process launched for running a thread-safe " "death test. FOR INTERNAL USE ONLY."); } // namespace internal #if GTEST_HAS_DEATH_TEST // ExitedWithCode constructor. ExitedWithCode::ExitedWithCode(int exit_code) : exit_code_(exit_code) { } // ExitedWithCode function-call operator. bool ExitedWithCode::operator()(int exit_status) const { # if GTEST_OS_WINDOWS return exit_status == exit_code_; # else return WIFEXITED(exit_status) && WEXITSTATUS(exit_status) == exit_code_; # endif // GTEST_OS_WINDOWS } # if !GTEST_OS_WINDOWS // KilledBySignal constructor. KilledBySignal::KilledBySignal(int signum) : signum_(signum) { } // KilledBySignal function-call operator. bool KilledBySignal::operator()(int exit_status) const { return WIFSIGNALED(exit_status) && WTERMSIG(exit_status) == signum_; } # endif // !GTEST_OS_WINDOWS namespace internal { // Utilities needed for death tests. // Generates a textual description of a given exit code, in the format // specified by wait(2). static String ExitSummary(int exit_code) { Message m; # if GTEST_OS_WINDOWS m << "Exited with exit status " << exit_code; # else if (WIFEXITED(exit_code)) { m << "Exited with exit status " << WEXITSTATUS(exit_code); } else if (WIFSIGNALED(exit_code)) { m << "Terminated by signal " << WTERMSIG(exit_code); } # ifdef WCOREDUMP if (WCOREDUMP(exit_code)) { m << " (core dumped)"; } # endif # endif // GTEST_OS_WINDOWS return m.GetString(); } // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. bool ExitedUnsuccessfully(int exit_status) { return !ExitedWithCode(0)(exit_status); } # if !GTEST_OS_WINDOWS // Generates a textual failure message when a death test finds more than // one thread running, or cannot determine the number of threads, prior // to executing the given statement. It is the responsibility of the // caller not to pass a thread_count of 1. static String DeathTestThreadWarning(size_t thread_count) { Message msg; msg << "Death tests use fork(), which is unsafe particularly" << " in a threaded context. For this test, " << GTEST_NAME_ << " "; if (thread_count == 0) msg << "couldn't detect the number of threads."; else msg << "detected " << thread_count << " threads."; return msg.GetString(); } # endif // !GTEST_OS_WINDOWS // Flag characters for reporting a death test that did not die. static const char kDeathTestLived = 'L'; static const char kDeathTestReturned = 'R'; static const char kDeathTestThrew = 'T'; static const char kDeathTestInternalError = 'I'; // An enumeration describing all of the possible ways that a death test can // conclude. DIED means that the process died while executing the test // code; LIVED means that process lived beyond the end of the test code; // RETURNED means that the test statement attempted to execute a return // statement, which is not allowed; THREW means that the test statement // returned control by throwing an exception. IN_PROGRESS means the test // has not yet concluded. // TODO(vladl@google.com): Unify names and possibly values for // AbortReason, DeathTestOutcome, and flag characters above. enum DeathTestOutcome { IN_PROGRESS, DIED, LIVED, RETURNED, THREW }; // Routine for aborting the program which is safe to call from an // exec-style death test child process, in which case the error // message is propagated back to the parent process. Otherwise, the // message is simply printed to stderr. In either case, the program // then exits with status 1. void DeathTestAbort(const String& message) { // On a POSIX system, this function may be called from a threadsafe-style // death test child process, which operates on a very small stack. Use // the heap for any additional non-minuscule memory requirements. const InternalRunDeathTestFlag* const flag = GetUnitTestImpl()->internal_run_death_test_flag(); if (flag != NULL) { FILE* parent = posix::FDOpen(flag->write_fd(), "w"); fputc(kDeathTestInternalError, parent); fprintf(parent, "%s", message.c_str()); fflush(parent); _exit(1); } else { fprintf(stderr, "%s", message.c_str()); fflush(stderr); posix::Abort(); } } // A replacement for CHECK that calls DeathTestAbort if the assertion // fails. # define GTEST_DEATH_TEST_CHECK_(expression) \ do { \ if (!::testing::internal::IsTrue(expression)) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // This macro is similar to GTEST_DEATH_TEST_CHECK_, but it is meant for // evaluating any system call that fulfills two conditions: it must return // -1 on failure, and set errno to EINTR when it is interrupted and // should be tried again. The macro expands to a loop that repeatedly // evaluates the expression as long as it evaluates to -1 and sets // errno to EINTR. If the expression evaluates to -1 but errno is // something other than EINTR, DeathTestAbort is called. # define GTEST_DEATH_TEST_CHECK_SYSCALL_(expression) \ do { \ int gtest_retval; \ do { \ gtest_retval = (expression); \ } while (gtest_retval == -1 && errno == EINTR); \ if (gtest_retval == -1) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s != -1", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // Returns the message describing the last system error in errno. String GetLastErrnoDescription() { return String(errno == 0 ? "" : posix::StrError(errno)); } // This is called from a death test parent process to read a failure // message from the death test child process and log it with the FATAL // severity. On Windows, the message is read from a pipe handle. On other // platforms, it is read from a file descriptor. static void FailFromInternalError(int fd) { Message error; char buffer[256]; int num_read; do { while ((num_read = posix::Read(fd, buffer, 255)) > 0) { buffer[num_read] = '\0'; error << buffer; } } while (num_read == -1 && errno == EINTR); if (num_read == 0) { GTEST_LOG_(FATAL) << error.GetString(); } else { const int last_error = errno; GTEST_LOG_(FATAL) << "Error while reading death test internal: " << GetLastErrnoDescription() << " [" << last_error << "]"; } } // Death test constructor. Increments the running death test count // for the current test. DeathTest::DeathTest() { TestInfo* const info = GetUnitTestImpl()->current_test_info(); if (info == NULL) { DeathTestAbort("Cannot run a death test outside of a TEST or " "TEST_F construct"); } } // Creates and returns a death test by dispatching to the current // death test factory. bool DeathTest::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { return GetUnitTestImpl()->death_test_factory()->Create( statement, regex, file, line, test); } const char* DeathTest::LastMessage() { return last_death_test_message_.c_str(); } void DeathTest::set_last_death_test_message(const String& message) { last_death_test_message_ = message; } String DeathTest::last_death_test_message_; // Provides cross platform implementation for some death functionality. class DeathTestImpl : public DeathTest { protected: DeathTestImpl(const char* a_statement, const RE* a_regex) : statement_(a_statement), regex_(a_regex), spawned_(false), status_(-1), outcome_(IN_PROGRESS), read_fd_(-1), write_fd_(-1) {} // read_fd_ is expected to be closed and cleared by a derived class. ~DeathTestImpl() { GTEST_DEATH_TEST_CHECK_(read_fd_ == -1); } void Abort(AbortReason reason); virtual bool Passed(bool status_ok); const char* statement() const { return statement_; } const RE* regex() const { return regex_; } bool spawned() const { return spawned_; } void set_spawned(bool is_spawned) { spawned_ = is_spawned; } int status() const { return status_; } void set_status(int a_status) { status_ = a_status; } DeathTestOutcome outcome() const { return outcome_; } void set_outcome(DeathTestOutcome an_outcome) { outcome_ = an_outcome; } int read_fd() const { return read_fd_; } void set_read_fd(int fd) { read_fd_ = fd; } int write_fd() const { return write_fd_; } void set_write_fd(int fd) { write_fd_ = fd; } // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void ReadAndInterpretStatusByte(); private: // The textual content of the code this object is testing. This class // doesn't own this string and should not attempt to delete it. const char* const statement_; // The regular expression which test output must match. DeathTestImpl // doesn't own this object and should not attempt to delete it. const RE* const regex_; // True if the death test child process has been successfully spawned. bool spawned_; // The exit status of the child process. int status_; // How the death test concluded. DeathTestOutcome outcome_; // Descriptor to the read end of the pipe to the child process. It is // always -1 in the child process. The child keeps its write end of the // pipe in write_fd_. int read_fd_; // Descriptor to the child's write end of the pipe to the parent process. // It is always -1 in the parent process. The parent keeps its end of the // pipe in read_fd_. int write_fd_; }; // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void DeathTestImpl::ReadAndInterpretStatusByte() { char flag; int bytes_read; // The read() here blocks until data is available (signifying the // failure of the death test) or until the pipe is closed (signifying // its success), so it's okay to call this in the parent before // the child process has exited. do { bytes_read = posix::Read(read_fd(), &flag, 1); } while (bytes_read == -1 && errno == EINTR); if (bytes_read == 0) { set_outcome(DIED); } else if (bytes_read == 1) { switch (flag) { case kDeathTestReturned: set_outcome(RETURNED); break; case kDeathTestThrew: set_outcome(THREW); break; case kDeathTestLived: set_outcome(LIVED); break; case kDeathTestInternalError: FailFromInternalError(read_fd()); // Does not return. break; default: GTEST_LOG_(FATAL) << "Death test child process reported " << "unexpected status byte (" << static_cast(flag) << ")"; } } else { GTEST_LOG_(FATAL) << "Read from death test child process failed: " << GetLastErrnoDescription(); } GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Close(read_fd())); set_read_fd(-1); } // Signals that the death test code which should have exited, didn't. // Should be called only in a death test child process. // Writes a status byte to the child's status file descriptor, then // calls _exit(1). void DeathTestImpl::Abort(AbortReason reason) { // The parent process considers the death test to be a failure if // it finds any data in our pipe. So, here we write a single flag byte // to the pipe, then exit. const char status_ch = reason == TEST_DID_NOT_DIE ? kDeathTestLived : reason == TEST_THREW_EXCEPTION ? kDeathTestThrew : kDeathTestReturned; GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Write(write_fd(), &status_ch, 1)); // We are leaking the descriptor here because on some platforms (i.e., // when built as Windows DLL), destructors of global objects will still // run after calling _exit(). On such systems, write_fd_ will be // indirectly closed from the destructor of UnitTestImpl, causing double // close if it is also closed here. On debug configurations, double close // may assert. As there are no in-process buffers to flush here, we are // relying on the OS to close the descriptor after the process terminates // when the destructors are not run. _exit(1); // Exits w/o any normal exit hooks (we were supposed to crash) } // Returns an indented copy of stderr output for a death test. // This makes distinguishing death test output lines from regular log lines // much easier. static ::std::string FormatDeathTestOutput(const ::std::string& output) { ::std::string ret; for (size_t at = 0; ; ) { const size_t line_end = output.find('\n', at); ret += "[ DEATH ] "; if (line_end == ::std::string::npos) { ret += output.substr(at); break; } ret += output.substr(at, line_end + 1 - at); at = line_end + 1; } return ret; } // Assesses the success or failure of a death test, using both private // members which have previously been set, and one argument: // // Private data members: // outcome: An enumeration describing how the death test // concluded: DIED, LIVED, THREW, or RETURNED. The death test // fails in the latter three cases. // status: The exit status of the child process. On *nix, it is in the // in the format specified by wait(2). On Windows, this is the // value supplied to the ExitProcess() API or a numeric code // of the exception that terminated the program. // regex: A regular expression object to be applied to // the test's captured standard error output; the death test // fails if it does not match. // // Argument: // status_ok: true if exit_status is acceptable in the context of // this particular death test, which fails if it is false // // Returns true iff all of the above conditions are met. Otherwise, the // first failing condition, in the order given above, is the one that is // reported. Also sets the last death test message string. bool DeathTestImpl::Passed(bool status_ok) { if (!spawned()) return false; const String error_message = GetCapturedStderr(); bool success = false; Message buffer; buffer << "Death test: " << statement() << "\n"; switch (outcome()) { case LIVED: buffer << " Result: failed to die.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case THREW: buffer << " Result: threw an exception.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case RETURNED: buffer << " Result: illegal return in test statement.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case DIED: if (status_ok) { const bool matched = RE::PartialMatch(error_message.c_str(), *regex()); if (matched) { success = true; } else { buffer << " Result: died but not with expected error.\n" << " Expected: " << regex()->pattern() << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } } else { buffer << " Result: died but not with expected exit code:\n" << " " << ExitSummary(status()) << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } break; case IN_PROGRESS: default: GTEST_LOG_(FATAL) << "DeathTest::Passed somehow called before conclusion of test"; } DeathTest::set_last_death_test_message(buffer.GetString()); return success; } # if GTEST_OS_WINDOWS // WindowsDeathTest implements death tests on Windows. Due to the // specifics of starting new processes on Windows, death tests there are // always threadsafe, and Google Test considers the // --gtest_death_test_style=fast setting to be equivalent to // --gtest_death_test_style=threadsafe there. // // A few implementation notes: Like the Linux version, the Windows // implementation uses pipes for child-to-parent communication. But due to // the specifics of pipes on Windows, some extra steps are required: // // 1. The parent creates a communication pipe and stores handles to both // ends of it. // 2. The parent starts the child and provides it with the information // necessary to acquire the handle to the write end of the pipe. // 3. The child acquires the write end of the pipe and signals the parent // using a Windows event. // 4. Now the parent can release the write end of the pipe on its side. If // this is done before step 3, the object's reference count goes down to // 0 and it is destroyed, preventing the child from acquiring it. The // parent now has to release it, or read operations on the read end of // the pipe will not return when the child terminates. // 5. The parent reads child's output through the pipe (outcome code and // any possible error messages) from the pipe, and its stderr and then // determines whether to fail the test. // // Note: to distinguish Win32 API calls from the local method and function // calls, the former are explicitly resolved in the global namespace. // class WindowsDeathTest : public DeathTestImpl { public: WindowsDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : DeathTestImpl(a_statement, a_regex), file_(file), line_(line) {} // All of these virtual functions are inherited from DeathTest. virtual int Wait(); virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; // Handle to the write end of the pipe to the child process. AutoHandle write_handle_; // Child process handle. AutoHandle child_handle_; // Event the child process uses to signal the parent that it has // acquired the handle to the write end of the pipe. After seeing this // event the parent can release its own handles to make sure its // ReadFile() calls return when the child terminates. AutoHandle event_handle_; }; // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int WindowsDeathTest::Wait() { if (!spawned()) return 0; // Wait until the child either signals that it has acquired the write end // of the pipe or it dies. const HANDLE wait_handles[2] = { child_handle_.Get(), event_handle_.Get() }; switch (::WaitForMultipleObjects(2, wait_handles, FALSE, // Waits for any of the handles. INFINITE)) { case WAIT_OBJECT_0: case WAIT_OBJECT_0 + 1: break; default: GTEST_DEATH_TEST_CHECK_(false); // Should not get here. } // The child has acquired the write end of the pipe or exited. // We release the handle on our side and continue. write_handle_.Reset(); event_handle_.Reset(); ReadAndInterpretStatusByte(); // Waits for the child process to exit if it haven't already. This // returns immediately if the child has already exited, regardless of // whether previous calls to WaitForMultipleObjects synchronized on this // handle or not. GTEST_DEATH_TEST_CHECK_( WAIT_OBJECT_0 == ::WaitForSingleObject(child_handle_.Get(), INFINITE)); DWORD status_code; GTEST_DEATH_TEST_CHECK_( ::GetExitCodeProcess(child_handle_.Get(), &status_code) != FALSE); child_handle_.Reset(); set_status(static_cast(status_code)); return status(); } // The AssumeRole process for a Windows death test. It creates a child // process with the same executable as the current process to run the // death test. The child process is given the --gtest_filter and // --gtest_internal_run_death_test flags such that it knows to run the // current death test only. DeathTest::TestRole WindowsDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { // ParseInternalRunDeathTestFlag() has performed all the necessary // processing. set_write_fd(flag->write_fd()); return EXECUTE_TEST; } // WindowsDeathTest uses an anonymous pipe to communicate results of // a death test. SECURITY_ATTRIBUTES handles_are_inheritable = { sizeof(SECURITY_ATTRIBUTES), NULL, TRUE }; HANDLE read_handle, write_handle; GTEST_DEATH_TEST_CHECK_( ::CreatePipe(&read_handle, &write_handle, &handles_are_inheritable, 0) // Default buffer size. != FALSE); set_read_fd(::_open_osfhandle(reinterpret_cast(read_handle), O_RDONLY)); write_handle_.Reset(write_handle); event_handle_.Reset(::CreateEvent( &handles_are_inheritable, TRUE, // The event will automatically reset to non-signaled state. FALSE, // The initial state is non-signalled. NULL)); // The even is unnamed. GTEST_DEATH_TEST_CHECK_(event_handle_.Get() != NULL); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format( "--%s%s=%s|%d|%d|%u|%Iu|%Iu", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, static_cast(::GetCurrentProcessId()), // size_t has the same with as pointers on both 32-bit and 64-bit // Windows platforms. // See http://msdn.microsoft.com/en-us/library/tcxf1dw6.aspx. reinterpret_cast(write_handle), reinterpret_cast(event_handle_.Get())); char executable_path[_MAX_PATH + 1]; // NOLINT GTEST_DEATH_TEST_CHECK_( _MAX_PATH + 1 != ::GetModuleFileNameA(NULL, executable_path, _MAX_PATH)); String command_line = String::Format("%s %s \"%s\"", ::GetCommandLineA(), filter_flag.c_str(), internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // Flush the log buffers since the log streams are shared with the child. FlushInfoLog(); // The child process will share the standard handles with the parent. STARTUPINFOA startup_info; memset(&startup_info, 0, sizeof(STARTUPINFO)); startup_info.dwFlags = STARTF_USESTDHANDLES; startup_info.hStdInput = ::GetStdHandle(STD_INPUT_HANDLE); startup_info.hStdOutput = ::GetStdHandle(STD_OUTPUT_HANDLE); startup_info.hStdError = ::GetStdHandle(STD_ERROR_HANDLE); PROCESS_INFORMATION process_info; GTEST_DEATH_TEST_CHECK_(::CreateProcessA( executable_path, const_cast(command_line.c_str()), NULL, // Retuned process handle is not inheritable. NULL, // Retuned thread handle is not inheritable. TRUE, // Child inherits all inheritable handles (for write_handle_). 0x0, // Default creation flags. NULL, // Inherit the parent's environment. UnitTest::GetInstance()->original_working_dir(), &startup_info, &process_info) != FALSE); child_handle_.Reset(process_info.hProcess); ::CloseHandle(process_info.hThread); set_spawned(true); return OVERSEE_TEST; } # else // We are not on Windows. // ForkingDeathTest provides implementations for most of the abstract // methods of the DeathTest interface. Only the AssumeRole method is // left undefined. class ForkingDeathTest : public DeathTestImpl { public: ForkingDeathTest(const char* statement, const RE* regex); // All of these virtual functions are inherited from DeathTest. virtual int Wait(); protected: void set_child_pid(pid_t child_pid) { child_pid_ = child_pid; } private: // PID of child process during death test; 0 in the child process itself. pid_t child_pid_; }; // Constructs a ForkingDeathTest. ForkingDeathTest::ForkingDeathTest(const char* a_statement, const RE* a_regex) : DeathTestImpl(a_statement, a_regex), child_pid_(-1) {} // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int ForkingDeathTest::Wait() { if (!spawned()) return 0; ReadAndInterpretStatusByte(); int status_value; GTEST_DEATH_TEST_CHECK_SYSCALL_(waitpid(child_pid_, &status_value, 0)); set_status(status_value); return status_value; } // A concrete death test class that forks, then immediately runs the test // in the child process. class NoExecDeathTest : public ForkingDeathTest { public: NoExecDeathTest(const char* a_statement, const RE* a_regex) : ForkingDeathTest(a_statement, a_regex) { } virtual TestRole AssumeRole(); }; // The AssumeRole process for a fork-and-run death test. It implements a // straightforward fork, with a simple pipe to transmit the status byte. DeathTest::TestRole NoExecDeathTest::AssumeRole() { const size_t thread_count = GetThreadCount(); if (thread_count != 1) { GTEST_LOG_(WARNING) << DeathTestThreadWarning(thread_count); } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); DeathTest::set_last_death_test_message(""); CaptureStderr(); // When we fork the process below, the log file buffers are copied, but the // file descriptors are shared. We flush all log files here so that closing // the file descriptors in the child process doesn't throw off the // synchronization between descriptors and buffers in the parent process. // This is as close to the fork as possible to avoid a race condition in case // there are multiple threads running before the death test, and another // thread writes to the log file. FlushInfoLog(); const pid_t child_pid = fork(); GTEST_DEATH_TEST_CHECK_(child_pid != -1); set_child_pid(child_pid); if (child_pid == 0) { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[0])); set_write_fd(pipe_fd[1]); // Redirects all logging to stderr in the child process to prevent // concurrent writes to the log files. We capture stderr in the parent // process and append the child process' output to a log. LogToStderr(); // Event forwarding to the listeners of event listener API mush be shut // down in death test subprocesses. GetUnitTestImpl()->listeners()->SuppressEventForwarding(); return EXECUTE_TEST; } else { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } } // A concrete death test class that forks and re-executes the main // program from the beginning, with command-line flags set that cause // only this specific death test to be run. class ExecDeathTest : public ForkingDeathTest { public: ExecDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : ForkingDeathTest(a_statement, a_regex), file_(file), line_(line) { } virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; }; // Utility class for accumulating command-line arguments. class Arguments { public: Arguments() { args_.push_back(NULL); } ~Arguments() { for (std::vector::iterator i = args_.begin(); i != args_.end(); ++i) { free(*i); } } void AddArgument(const char* argument) { args_.insert(args_.end() - 1, posix::StrDup(argument)); } template void AddArguments(const ::std::vector& arguments) { for (typename ::std::vector::const_iterator i = arguments.begin(); i != arguments.end(); ++i) { args_.insert(args_.end() - 1, posix::StrDup(i->c_str())); } } char* const* Argv() { return &args_[0]; } private: std::vector args_; }; // A struct that encompasses the arguments to the child process of a // threadsafe-style death test process. struct ExecDeathTestArgs { char* const* argv; // Command-line arguments for the child's call to exec int close_fd; // File descriptor to close; the read end of a pipe }; # if GTEST_OS_MAC inline char** GetEnviron() { // When Google Test is built as a framework on MacOS X, the environ variable // is unavailable. Apple's documentation (man environ) recommends using // _NSGetEnviron() instead. return *_NSGetEnviron(); } # else // Some POSIX platforms expect you to declare environ. extern "C" makes // it reside in the global namespace. extern "C" char** environ; inline char** GetEnviron() { return environ; } # endif // GTEST_OS_MAC // The main function for a threadsafe-style death test child process. // This function is called in a clone()-ed process and thus must avoid // any potentially unsafe operations like malloc or libc functions. static int ExecDeathTestChildMain(void* child_arg) { ExecDeathTestArgs* const args = static_cast(child_arg); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(args->close_fd)); // We need to execute the test program in the same environment where // it was originally invoked. Therefore we change to the original // working directory first. const char* const original_dir = UnitTest::GetInstance()->original_working_dir(); // We can safely call chdir() as it's a direct system call. if (chdir(original_dir) != 0) { DeathTestAbort(String::Format("chdir(\"%s\") failed: %s", original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // We can safely call execve() as it's a direct system call. We // cannot use execvp() as it's a libc function and thus potentially // unsafe. Since execve() doesn't search the PATH, the user must // invoke the test program via a valid path that contains at least // one path separator. execve(args->argv[0], args->argv, GetEnviron()); DeathTestAbort(String::Format("execve(%s, ...) in %s failed: %s", args->argv[0], original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // Two utility routines that together determine the direction the stack // grows. // This could be accomplished more elegantly by a single recursive // function, but we want to guard against the unlikely possibility of // a smart compiler optimizing the recursion away. // // GTEST_NO_INLINE_ is required to prevent GCC 4.6 from inlining // StackLowerThanAddress into StackGrowsDown, which then doesn't give // correct answer. bool StackLowerThanAddress(const void* ptr) GTEST_NO_INLINE_; bool StackLowerThanAddress(const void* ptr) { int dummy; return &dummy < ptr; } bool StackGrowsDown() { int dummy; return StackLowerThanAddress(&dummy); } // A threadsafe implementation of fork(2) for threadsafe-style death tests // that uses clone(2). It dies with an error message if anything goes // wrong. static pid_t ExecDeathTestFork(char* const* argv, int close_fd) { ExecDeathTestArgs args = { argv, close_fd }; pid_t child_pid = -1; # if GTEST_HAS_CLONE const bool use_fork = GTEST_FLAG(death_test_use_fork); if (!use_fork) { static const bool stack_grows_down = StackGrowsDown(); const size_t stack_size = getpagesize(); // MMAP_ANONYMOUS is not defined on Mac, so we use MAP_ANON instead. void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0); GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); void* const stack_top = static_cast(stack) + (stack_grows_down ? stack_size : 0); child_pid = clone(&ExecDeathTestChildMain, stack_top, SIGCHLD, &args); GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1); } # else const bool use_fork = true; # endif // GTEST_HAS_CLONE if (use_fork && (child_pid = fork()) == 0) { ExecDeathTestChildMain(&args); _exit(0); } GTEST_DEATH_TEST_CHECK_(child_pid != -1); return child_pid; } // The AssumeRole process for a fork-and-exec death test. It re-executes the // main program from the beginning, setting the --gtest_filter // and --gtest_internal_run_death_test flags to cause only the current // death test to be re-run. DeathTest::TestRole ExecDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { set_write_fd(flag->write_fd()); return EXECUTE_TEST; } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); // Clear the close-on-exec flag on the write end of the pipe, lest // it be closed when the child process does an exec: GTEST_DEATH_TEST_CHECK_(fcntl(pipe_fd[1], F_SETFD, 0) != -1); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format("--%s%s=%s|%d|%d|%d", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, pipe_fd[1]); Arguments args; args.AddArguments(GetArgvs()); args.AddArgument(filter_flag.c_str()); args.AddArgument(internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // See the comment in NoExecDeathTest::AssumeRole for why the next line // is necessary. FlushInfoLog(); const pid_t child_pid = ExecDeathTestFork(args.Argv(), pipe_fd[0]); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_child_pid(child_pid); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } # endif // !GTEST_OS_WINDOWS // Creates a concrete DeathTest-derived class that depends on the // --gtest_death_test_style flag, and sets the pointer pointed to // by the "test" argument to its address. If the test should be // skipped, sets that pointer to NULL. Returns true, unless the // flag is set to an invalid value. bool DefaultDeathTestFactory::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const int death_test_index = impl->current_test_info() ->increment_death_test_count(); if (flag != NULL) { if (death_test_index > flag->index()) { DeathTest::set_last_death_test_message(String::Format( "Death test count (%d) somehow exceeded expected maximum (%d)", death_test_index, flag->index())); return false; } if (!(flag->file() == file && flag->line() == line && flag->index() == death_test_index)) { *test = NULL; return true; } } # if GTEST_OS_WINDOWS if (GTEST_FLAG(death_test_style) == "threadsafe" || GTEST_FLAG(death_test_style) == "fast") { *test = new WindowsDeathTest(statement, regex, file, line); } # else if (GTEST_FLAG(death_test_style) == "threadsafe") { *test = new ExecDeathTest(statement, regex, file, line); } else if (GTEST_FLAG(death_test_style) == "fast") { *test = new NoExecDeathTest(statement, regex); } # endif // GTEST_OS_WINDOWS else { // NOLINT - this is more readable than unbalanced brackets inside #if. DeathTest::set_last_death_test_message(String::Format( "Unknown death test style \"%s\" encountered", GTEST_FLAG(death_test_style).c_str())); return false; } return true; } // Splits a given string on a given delimiter, populating a given // vector with the fields. GTEST_HAS_DEATH_TEST implies that we have // ::std::string, so we can use it here. static void SplitString(const ::std::string& str, char delimiter, ::std::vector< ::std::string>* dest) { ::std::vector< ::std::string> parsed; ::std::string::size_type pos = 0; while (::testing::internal::AlwaysTrue()) { const ::std::string::size_type colon = str.find(delimiter, pos); if (colon == ::std::string::npos) { parsed.push_back(str.substr(pos)); break; } else { parsed.push_back(str.substr(pos, colon - pos)); pos = colon + 1; } } dest->swap(parsed); } # if GTEST_OS_WINDOWS // Recreates the pipe and event handles from the provided parameters, // signals the event, and returns a file descriptor wrapped around the pipe // handle. This function is called in the child process only. int GetStatusFileDescriptor(unsigned int parent_process_id, size_t write_handle_as_size_t, size_t event_handle_as_size_t) { AutoHandle parent_process_handle(::OpenProcess(PROCESS_DUP_HANDLE, FALSE, // Non-inheritable. parent_process_id)); if (parent_process_handle.Get() == INVALID_HANDLE_VALUE) { DeathTestAbort(String::Format("Unable to open parent process %u", parent_process_id)); } // TODO(vladl@google.com): Replace the following check with a // compile-time assertion when available. GTEST_CHECK_(sizeof(HANDLE) <= sizeof(size_t)); const HANDLE write_handle = reinterpret_cast(write_handle_as_size_t); HANDLE dup_write_handle; // The newly initialized handle is accessible only in in the parent // process. To obtain one accessible within the child, we need to use // DuplicateHandle. if (!::DuplicateHandle(parent_process_handle.Get(), write_handle, ::GetCurrentProcess(), &dup_write_handle, 0x0, // Requested privileges ignored since // DUPLICATE_SAME_ACCESS is used. FALSE, // Request non-inheritable handler. DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the pipe handle %Iu from the parent process %u", write_handle_as_size_t, parent_process_id)); } const HANDLE event_handle = reinterpret_cast(event_handle_as_size_t); HANDLE dup_event_handle; if (!::DuplicateHandle(parent_process_handle.Get(), event_handle, ::GetCurrentProcess(), &dup_event_handle, 0x0, FALSE, DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the event handle %Iu from the parent process %u", event_handle_as_size_t, parent_process_id)); } const int write_fd = ::_open_osfhandle(reinterpret_cast(dup_write_handle), O_APPEND); if (write_fd == -1) { DeathTestAbort(String::Format( "Unable to convert pipe handle %Iu to a file descriptor", write_handle_as_size_t)); } // Signals the parent that the write end of the pipe has been acquired // so the parent can release its own write end. ::SetEvent(dup_event_handle); return write_fd; } # endif // GTEST_OS_WINDOWS // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag() { if (GTEST_FLAG(internal_run_death_test) == "") return NULL; // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we // can use it here. int line = -1; int index = -1; ::std::vector< ::std::string> fields; SplitString(GTEST_FLAG(internal_run_death_test).c_str(), '|', &fields); int write_fd = -1; # if GTEST_OS_WINDOWS unsigned int parent_process_id = 0; size_t write_handle_as_size_t = 0; size_t event_handle_as_size_t = 0; if (fields.size() != 6 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &parent_process_id) || !ParseNaturalNumber(fields[4], &write_handle_as_size_t) || !ParseNaturalNumber(fields[5], &event_handle_as_size_t)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } write_fd = GetStatusFileDescriptor(parent_process_id, write_handle_as_size_t, event_handle_as_size_t); # else if (fields.size() != 4 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &write_fd)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } # endif // GTEST_OS_WINDOWS return new InternalRunDeathTestFlag(fields[0], line, index, write_fd); } } // namespace internal #endif // GTEST_HAS_DEATH_TEST } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: keith.ray@gmail.com (Keith Ray) #include #if GTEST_OS_WINDOWS_MOBILE # include #elif GTEST_OS_WINDOWS # include # include #elif GTEST_OS_SYMBIAN || GTEST_OS_NACL // Symbian OpenC and NaCl have PATH_MAX in sys/syslimits.h # include #else # include # include // Some Linux distributions define PATH_MAX here. #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_WINDOWS # define GTEST_PATH_MAX_ _MAX_PATH #elif defined(PATH_MAX) # define GTEST_PATH_MAX_ PATH_MAX #elif defined(_XOPEN_PATH_MAX) # define GTEST_PATH_MAX_ _XOPEN_PATH_MAX #else # define GTEST_PATH_MAX_ _POSIX_PATH_MAX #endif // GTEST_OS_WINDOWS namespace testing { namespace internal { #if GTEST_OS_WINDOWS // On Windows, '\\' is the standard path separator, but many tools and the // Windows API also accept '/' as an alternate path separator. Unless otherwise // noted, a file path can contain either kind of path separators, or a mixture // of them. const char kPathSeparator = '\\'; const char kAlternatePathSeparator = '/'; const char kPathSeparatorString[] = "\\"; const char kAlternatePathSeparatorString[] = "/"; # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory. You should not use // the current directory in tests on Windows CE, but this at least // provides a reasonable fallback. const char kCurrentDirectoryString[] = "\\"; // Windows CE doesn't define INVALID_FILE_ATTRIBUTES const DWORD kInvalidFileAttributes = 0xffffffff; # else const char kCurrentDirectoryString[] = ".\\"; # endif // GTEST_OS_WINDOWS_MOBILE #else const char kPathSeparator = '/'; const char kPathSeparatorString[] = "/"; const char kCurrentDirectoryString[] = "./"; #endif // GTEST_OS_WINDOWS // Returns whether the given character is a valid path separator. static bool IsPathSeparator(char c) { #if GTEST_HAS_ALT_PATH_SEP_ return (c == kPathSeparator) || (c == kAlternatePathSeparator); #else return c == kPathSeparator; #endif } // Returns the current working directory, or "" if unsuccessful. FilePath FilePath::GetCurrentDir() { #if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory, so we just return // something reasonable. return FilePath(kCurrentDirectoryString); #elif GTEST_OS_WINDOWS char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(_getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #else char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #endif // GTEST_OS_WINDOWS_MOBILE } // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath FilePath::RemoveExtension(const char* extension) const { String dot_extension(String::Format(".%s", extension)); if (pathname_.EndsWithCaseInsensitive(dot_extension.c_str())) { return FilePath(String(pathname_.c_str(), pathname_.length() - 4)); } return *this; } // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FilePath::FindLastPathSeparator() const { const char* const last_sep = strrchr(c_str(), kPathSeparator); #if GTEST_HAS_ALT_PATH_SEP_ const char* const last_alt_sep = strrchr(c_str(), kAlternatePathSeparator); // Comparing two pointers of which only one is NULL is undefined. if (last_alt_sep != NULL && (last_sep == NULL || last_alt_sep > last_sep)) { return last_alt_sep; } #endif return last_sep; } // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveDirectoryName() const { const char* const last_sep = FindLastPathSeparator(); return last_sep ? FilePath(String(last_sep + 1)) : *this; } // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveFileName() const { const char* const last_sep = FindLastPathSeparator(); String dir; if (last_sep) { dir = String(c_str(), last_sep + 1 - c_str()); } else { dir = kCurrentDirectoryString; } return FilePath(dir); } // Helper functions for naming files in a directory for xml output. // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. FilePath FilePath::MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension) { String file; if (number == 0) { file = String::Format("%s.%s", base_name.c_str(), extension); } else { file = String::Format("%s_%d.%s", base_name.c_str(), number, extension); } return ConcatPaths(directory, FilePath(file)); } // Given directory = "dir", relative_path = "test.xml", returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. FilePath FilePath::ConcatPaths(const FilePath& directory, const FilePath& relative_path) { if (directory.IsEmpty()) return relative_path; const FilePath dir(directory.RemoveTrailingPathSeparator()); return FilePath(String::Format("%s%c%s", dir.c_str(), kPathSeparator, relative_path.c_str())); } // Returns true if pathname describes something findable in the file-system, // either a file, directory, or whatever. bool FilePath::FileOrDirectoryExists() const { #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(pathname_.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; return attributes != kInvalidFileAttributes; #else posix::StatStruct file_stat; return posix::Stat(pathname_.c_str(), &file_stat) == 0; #endif // GTEST_OS_WINDOWS_MOBILE } // Returns true if pathname describes a directory in the file-system // that exists. bool FilePath::DirectoryExists() const { bool result = false; #if GTEST_OS_WINDOWS // Don't strip off trailing separator if path is a root directory on // Windows (like "C:\\"). const FilePath& path(IsRootDirectory() ? *this : RemoveTrailingPathSeparator()); #else const FilePath& path(*this); #endif #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(path.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; if ((attributes != kInvalidFileAttributes) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) { result = true; } #else posix::StatStruct file_stat; result = posix::Stat(path.c_str(), &file_stat) == 0 && posix::IsDir(file_stat); #endif // GTEST_OS_WINDOWS_MOBILE return result; } // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool FilePath::IsRootDirectory() const { #if GTEST_OS_WINDOWS // TODO(wan@google.com): on Windows a network share like // \\server\share can be a root directory, although it cannot be the // current directory. Handle this properly. return pathname_.length() == 3 && IsAbsolutePath(); #else return pathname_.length() == 1 && IsPathSeparator(pathname_.c_str()[0]); #endif } // Returns true if pathname describes an absolute path. bool FilePath::IsAbsolutePath() const { const char* const name = pathname_.c_str(); #if GTEST_OS_WINDOWS return pathname_.length() >= 3 && ((name[0] >= 'a' && name[0] <= 'z') || (name[0] >= 'A' && name[0] <= 'Z')) && name[1] == ':' && IsPathSeparator(name[2]); #else return IsPathSeparator(name[0]); #endif } // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. FilePath FilePath::GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension) { FilePath full_pathname; int number = 0; do { full_pathname.Set(MakeFileName(directory, base_name, number++, extension)); } while (full_pathname.FileOrDirectoryExists()); return full_pathname; } // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool FilePath::IsDirectory() const { return !pathname_.empty() && IsPathSeparator(pathname_.c_str()[pathname_.length() - 1]); } // Create directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create directories // for any reason. bool FilePath::CreateDirectoriesRecursively() const { if (!this->IsDirectory()) { return false; } if (pathname_.length() == 0 || this->DirectoryExists()) { return true; } const FilePath parent(this->RemoveTrailingPathSeparator().RemoveFileName()); return parent.CreateDirectoriesRecursively() && this->CreateFolder(); } // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool FilePath::CreateFolder() const { #if GTEST_OS_WINDOWS_MOBILE FilePath removed_sep(this->RemoveTrailingPathSeparator()); LPCWSTR unicode = String::AnsiToUtf16(removed_sep.c_str()); int result = CreateDirectory(unicode, NULL) ? 0 : -1; delete [] unicode; #elif GTEST_OS_WINDOWS int result = _mkdir(pathname_.c_str()); #else int result = mkdir(pathname_.c_str(), 0777); #endif // GTEST_OS_WINDOWS_MOBILE if (result == -1) { return this->DirectoryExists(); // An error is OK if the directory exists. } return true; // No error. } // If input name has a trailing separator character, remove it and return the // name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath FilePath::RemoveTrailingPathSeparator() const { return IsDirectory() ? FilePath(String(pathname_.c_str(), pathname_.length() - 1)) : *this; } // Removes any redundant separators that might be in the pathname. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // TODO(wan@google.com): handle Windows network shares (e.g. \\server\share). void FilePath::Normalize() { if (pathname_.c_str() == NULL) { pathname_ = ""; return; } const char* src = pathname_.c_str(); char* const dest = new char[pathname_.length() + 1]; char* dest_ptr = dest; memset(dest_ptr, 0, pathname_.length() + 1); while (*src != '\0') { *dest_ptr = *src; if (!IsPathSeparator(*src)) { src++; } else { #if GTEST_HAS_ALT_PATH_SEP_ if (*dest_ptr == kAlternatePathSeparator) { *dest_ptr = kPathSeparator; } #endif while (IsPathSeparator(*src)) src++; } dest_ptr++; } *dest_ptr = '\0'; pathname_ = dest; delete[] dest; } } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include #include #include #if GTEST_OS_WINDOWS_MOBILE # include // For TerminateProcess() #elif GTEST_OS_WINDOWS # include # include #else # include #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_MAC # include # include # include #endif // GTEST_OS_MAC // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { namespace internal { #if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC and C++Builder do not provide a definition of STDERR_FILENO. const int kStdOutFileno = 1; const int kStdErrFileno = 2; #else const int kStdOutFileno = STDOUT_FILENO; const int kStdErrFileno = STDERR_FILENO; #endif // _MSC_VER #if GTEST_OS_MAC // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. size_t GetThreadCount() { const task_t task = mach_task_self(); mach_msg_type_number_t thread_count; thread_act_array_t thread_list; const kern_return_t status = task_threads(task, &thread_list, &thread_count); if (status == KERN_SUCCESS) { // task_threads allocates resources in thread_list and we need to free them // to avoid leaks. vm_deallocate(task, reinterpret_cast(thread_list), sizeof(thread_t) * thread_count); return static_cast(thread_count); } else { return 0; } } #else size_t GetThreadCount() { // There's no portable way to detect the number of threads, so we just // return 0 to indicate that we cannot detect it. return 0; } #endif // GTEST_OS_MAC #if GTEST_USES_POSIX_RE // Implements RE. Currently only needed for death tests. RE::~RE() { if (is_valid_) { // regfree'ing an invalid regex might crash because the content // of the regex is undefined. Since the regex's are essentially // the same, one cannot be valid (or invalid) without the other // being so too. regfree(&partial_regex_); regfree(&full_regex_); } free(const_cast(pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.full_regex_, str, 1, &match, 0) == 0; } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.partial_regex_, str, 1, &match, 0) == 0; } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = posix::StrDup(regex); // Reserves enough bytes to hold the regular expression used for a // full match. const size_t full_regex_len = strlen(regex) + 10; char* const full_pattern = new char[full_regex_len]; snprintf(full_pattern, full_regex_len, "^(%s)$", regex); is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0; // We want to call regcomp(&partial_regex_, ...) even if the // previous expression returns false. Otherwise partial_regex_ may // not be properly initialized can may cause trouble when it's // freed. // // Some implementation of POSIX regex (e.g. on at least some // versions of Cygwin) doesn't accept the empty string as a valid // regex. We change it to an equivalent form "()" to be safe. if (is_valid_) { const char* const partial_regex = (*regex == '\0') ? "()" : regex; is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0; } EXPECT_TRUE(is_valid_) << "Regular expression \"" << regex << "\" is not a valid POSIX Extended regular expression."; delete[] full_pattern; } #elif GTEST_USES_SIMPLE_RE // Returns true iff ch appears anywhere in str (excluding the // terminating '\0' character). bool IsInSet(char ch, const char* str) { return ch != '\0' && strchr(str, ch) != NULL; } // Returns true iff ch belongs to the given classification. Unlike // similar functions in , these aren't affected by the // current locale. bool IsAsciiDigit(char ch) { return '0' <= ch && ch <= '9'; } bool IsAsciiPunct(char ch) { return IsInSet(ch, "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"); } bool IsRepeat(char ch) { return IsInSet(ch, "?*+"); } bool IsAsciiWhiteSpace(char ch) { return IsInSet(ch, " \f\n\r\t\v"); } bool IsAsciiWordChar(char ch) { return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || ('0' <= ch && ch <= '9') || ch == '_'; } // Returns true iff "\\c" is a supported escape sequence. bool IsValidEscape(char c) { return (IsAsciiPunct(c) || IsInSet(c, "dDfnrsStvwW")); } // Returns true iff the given atom (specified by escaped and pattern) // matches ch. The result is undefined if the atom is invalid. bool AtomMatchesChar(bool escaped, char pattern_char, char ch) { if (escaped) { // "\\p" where p is pattern_char. switch (pattern_char) { case 'd': return IsAsciiDigit(ch); case 'D': return !IsAsciiDigit(ch); case 'f': return ch == '\f'; case 'n': return ch == '\n'; case 'r': return ch == '\r'; case 's': return IsAsciiWhiteSpace(ch); case 'S': return !IsAsciiWhiteSpace(ch); case 't': return ch == '\t'; case 'v': return ch == '\v'; case 'w': return IsAsciiWordChar(ch); case 'W': return !IsAsciiWordChar(ch); } return IsAsciiPunct(pattern_char) && pattern_char == ch; } return (pattern_char == '.' && ch != '\n') || pattern_char == ch; } // Helper function used by ValidateRegex() to format error messages. String FormatRegexSyntaxError(const char* regex, int index) { return (Message() << "Syntax error at index " << index << " in simple regular expression \"" << regex << "\": ").GetString(); } // Generates non-fatal failures and returns false if regex is invalid; // otherwise returns true. bool ValidateRegex(const char* regex) { if (regex == NULL) { // TODO(wan@google.com): fix the source file location in the // assertion failures to match where the regex is used in user // code. ADD_FAILURE() << "NULL is not a valid simple regular expression."; return false; } bool is_valid = true; // True iff ?, *, or + can follow the previous atom. bool prev_repeatable = false; for (int i = 0; regex[i]; i++) { if (regex[i] == '\\') { // An escape sequence i++; if (regex[i] == '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "'\\' cannot appear at the end."; return false; } if (!IsValidEscape(regex[i])) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "invalid escape sequence \"\\" << regex[i] << "\"."; is_valid = false; } prev_repeatable = true; } else { // Not an escape sequence. const char ch = regex[i]; if (ch == '^' && i > 0) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'^' can only appear at the beginning."; is_valid = false; } else if (ch == '$' && regex[i + 1] != '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'$' can only appear at the end."; is_valid = false; } else if (IsInSet(ch, "()[]{}|")) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' is unsupported."; is_valid = false; } else if (IsRepeat(ch) && !prev_repeatable) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' can only follow a repeatable token."; is_valid = false; } prev_repeatable = !IsInSet(ch, "^$?*+"); } } return is_valid; } // Matches a repeated regex atom followed by a valid simple regular // expression. The regex atom is defined as c if escaped is false, // or \c otherwise. repeat is the repetition meta character (?, *, // or +). The behavior is undefined if str contains too many // characters to be indexable by size_t, in which case the test will // probably time out anyway. We are fine with this limitation as // std::string has it too. bool MatchRepetitionAndRegexAtHead( bool escaped, char c, char repeat, const char* regex, const char* str) { const size_t min_count = (repeat == '+') ? 1 : 0; const size_t max_count = (repeat == '?') ? 1 : static_cast(-1) - 1; // We cannot call numeric_limits::max() as it conflicts with the // max() macro on Windows. for (size_t i = 0; i <= max_count; ++i) { // We know that the atom matches each of the first i characters in str. if (i >= min_count && MatchRegexAtHead(regex, str + i)) { // We have enough matches at the head, and the tail matches too. // Since we only care about *whether* the pattern matches str // (as opposed to *how* it matches), there is no need to find a // greedy match. return true; } if (str[i] == '\0' || !AtomMatchesChar(escaped, c, str[i])) return false; } return false; } // Returns true iff regex matches a prefix of str. regex must be a // valid simple regular expression and not start with "^", or the // result is undefined. bool MatchRegexAtHead(const char* regex, const char* str) { if (*regex == '\0') // An empty regex matches a prefix of anything. return true; // "$" only matches the end of a string. Note that regex being // valid guarantees that there's nothing after "$" in it. if (*regex == '$') return *str == '\0'; // Is the first thing in regex an escape sequence? const bool escaped = *regex == '\\'; if (escaped) ++regex; if (IsRepeat(regex[1])) { // MatchRepetitionAndRegexAtHead() calls MatchRegexAtHead(), so // here's an indirect recursion. It terminates as the regex gets // shorter in each recursion. return MatchRepetitionAndRegexAtHead( escaped, regex[0], regex[1], regex + 2, str); } else { // regex isn't empty, isn't "$", and doesn't start with a // repetition. We match the first atom of regex with the first // character of str and recurse. return (*str != '\0') && AtomMatchesChar(escaped, *regex, *str) && MatchRegexAtHead(regex + 1, str + 1); } } // Returns true iff regex matches any substring of str. regex must be // a valid simple regular expression, or the result is undefined. // // The algorithm is recursive, but the recursion depth doesn't exceed // the regex length, so we won't need to worry about running out of // stack space normally. In rare cases the time complexity can be // exponential with respect to the regex length + the string length, // but usually it's must faster (often close to linear). bool MatchRegexAnywhere(const char* regex, const char* str) { if (regex == NULL || str == NULL) return false; if (*regex == '^') return MatchRegexAtHead(regex + 1, str); // A successful match can be anywhere in str. do { if (MatchRegexAtHead(regex, str)) return true; } while (*str++ != '\0'); return false; } // Implements the RE class. RE::~RE() { free(const_cast(pattern_)); free(const_cast(full_pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.full_pattern_, str); } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.pattern_, str); } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = full_pattern_ = NULL; if (regex != NULL) { pattern_ = posix::StrDup(regex); } is_valid_ = ValidateRegex(regex); if (!is_valid_) { // No need to calculate the full pattern when the regex is invalid. return; } const size_t len = strlen(regex); // Reserves enough bytes to hold the regular expression used for a // full match: we need space to prepend a '^', append a '$', and // terminate the string with '\0'. char* buffer = static_cast(malloc(len + 3)); full_pattern_ = buffer; if (*regex != '^') *buffer++ = '^'; // Makes sure full_pattern_ starts with '^'. // We don't use snprintf or strncpy, as they trigger a warning when // compiled with VC++ 8.0. memcpy(buffer, regex, len); buffer += len; if (len == 0 || regex[len - 1] != '$') *buffer++ = '$'; // Makes sure full_pattern_ ends with '$'. *buffer = '\0'; } #endif // GTEST_USES_POSIX_RE const char kUnknownFile[] = "unknown file"; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) { return String::Format("%s:", file_name).c_str(); } #ifdef _MSC_VER return String::Format("%s(%d):", file_name, line).c_str(); #else return String::Format("%s:%d:", file_name, line).c_str(); #endif // _MSC_VER } // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. // Note that FormatCompilerIndependentFileLocation() does NOT append colon // to the file location it produces, unlike FormatFileLocation(). GTEST_API_ ::std::string FormatCompilerIndependentFileLocation( const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) return file_name; else return String::Format("%s:%d", file_name, line).c_str(); } GTestLog::GTestLog(GTestLogSeverity severity, const char* file, int line) : severity_(severity) { const char* const marker = severity == GTEST_INFO ? "[ INFO ]" : severity == GTEST_WARNING ? "[WARNING]" : severity == GTEST_ERROR ? "[ ERROR ]" : "[ FATAL ]"; GetStream() << ::std::endl << marker << " " << FormatFileLocation(file, line).c_str() << ": "; } // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. GTestLog::~GTestLog() { GetStream() << ::std::endl; if (severity_ == GTEST_FATAL) { fflush(stderr); posix::Abort(); } } // Disable Microsoft deprecation warnings for POSIX functions called from // this class (creat, dup, dup2, and close) #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4996) #endif // _MSC_VER #if GTEST_HAS_STREAM_REDIRECTION // Object that captures an output stream (stdout/stderr). class CapturedStream { public: // The ctor redirects the stream to a temporary file. CapturedStream(int fd) : fd_(fd), uncaptured_fd_(dup(fd)) { # if GTEST_OS_WINDOWS char temp_dir_path[MAX_PATH + 1] = { '\0' }; // NOLINT char temp_file_path[MAX_PATH + 1] = { '\0' }; // NOLINT ::GetTempPathA(sizeof(temp_dir_path), temp_dir_path); const UINT success = ::GetTempFileNameA(temp_dir_path, "gtest_redir", 0, // Generate unique file name. temp_file_path); GTEST_CHECK_(success != 0) << "Unable to create a temporary file in " << temp_dir_path; const int captured_fd = creat(temp_file_path, _S_IREAD | _S_IWRITE); GTEST_CHECK_(captured_fd != -1) << "Unable to open temporary file " << temp_file_path; filename_ = temp_file_path; # else // There's no guarantee that a test has write access to the // current directory, so we create the temporary file in the /tmp // directory instead. char name_template[] = "/tmp/captured_stream.XXXXXX"; const int captured_fd = mkstemp(name_template); filename_ = name_template; # endif // GTEST_OS_WINDOWS fflush(NULL); dup2(captured_fd, fd_); close(captured_fd); } ~CapturedStream() { remove(filename_.c_str()); } String GetCapturedString() { if (uncaptured_fd_ != -1) { // Restores the original stream. fflush(NULL); dup2(uncaptured_fd_, fd_); close(uncaptured_fd_); uncaptured_fd_ = -1; } FILE* const file = posix::FOpen(filename_.c_str(), "r"); const String content = ReadEntireFile(file); posix::FClose(file); return content; } private: // Reads the entire content of a file as a String. static String ReadEntireFile(FILE* file); // Returns the size (in bytes) of a file. static size_t GetFileSize(FILE* file); const int fd_; // A stream to capture. int uncaptured_fd_; // Name of the temporary file holding the stderr output. ::std::string filename_; GTEST_DISALLOW_COPY_AND_ASSIGN_(CapturedStream); }; // Returns the size (in bytes) of a file. size_t CapturedStream::GetFileSize(FILE* file) { fseek(file, 0, SEEK_END); return static_cast(ftell(file)); } // Reads the entire content of a file as a string. String CapturedStream::ReadEntireFile(FILE* file) { const size_t file_size = GetFileSize(file); char* const buffer = new char[file_size]; size_t bytes_last_read = 0; // # of bytes read in the last fread() size_t bytes_read = 0; // # of bytes read so far fseek(file, 0, SEEK_SET); // Keeps reading the file until we cannot read further or the // pre-determined file size is reached. do { bytes_last_read = fread(buffer+bytes_read, 1, file_size-bytes_read, file); bytes_read += bytes_last_read; } while (bytes_last_read > 0 && bytes_read < file_size); const String content(buffer, bytes_read); delete[] buffer; return content; } # ifdef _MSC_VER # pragma warning(pop) # endif // _MSC_VER static CapturedStream* g_captured_stderr = NULL; static CapturedStream* g_captured_stdout = NULL; // Starts capturing an output stream (stdout/stderr). void CaptureStream(int fd, const char* stream_name, CapturedStream** stream) { if (*stream != NULL) { GTEST_LOG_(FATAL) << "Only one " << stream_name << " capturer can exist at a time."; } *stream = new CapturedStream(fd); } // Stops capturing the output stream and returns the captured string. String GetCapturedStream(CapturedStream** captured_stream) { const String content = (*captured_stream)->GetCapturedString(); delete *captured_stream; *captured_stream = NULL; return content; } // Starts capturing stdout. void CaptureStdout() { CaptureStream(kStdOutFileno, "stdout", &g_captured_stdout); } // Starts capturing stderr. void CaptureStderr() { CaptureStream(kStdErrFileno, "stderr", &g_captured_stderr); } // Stops capturing stdout and returns the captured string. String GetCapturedStdout() { return GetCapturedStream(&g_captured_stdout); } // Stops capturing stderr and returns the captured string. String GetCapturedStderr() { return GetCapturedStream(&g_captured_stderr); } #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). ::std::vector g_argvs; // Returns the command line as a vector of strings. const ::std::vector& GetArgvs() { return g_argvs; } #endif // GTEST_HAS_DEATH_TEST #if GTEST_OS_WINDOWS_MOBILE namespace posix { void Abort() { DebugBreak(); TerminateProcess(GetCurrentProcess(), 1); } } // namespace posix #endif // GTEST_OS_WINDOWS_MOBILE // Returns the name of the environment variable corresponding to the // given flag. For example, FlagToEnvVar("foo") will return // "GTEST_FOO" in the open-source version. static String FlagToEnvVar(const char* flag) { const String full_flag = (Message() << GTEST_FLAG_PREFIX_ << flag).GetString(); Message env_var; for (size_t i = 0; i != full_flag.length(); i++) { env_var << ToUpper(full_flag.c_str()[i]); } return env_var.GetString(); } // Parses 'str' for a 32-bit signed integer. If successful, writes // the result to *value and returns true; otherwise leaves *value // unchanged and returns false. bool ParseInt32(const Message& src_text, const char* str, Int32* value) { // Parses the environment variable as a decimal integer. char* end = NULL; const long long_value = strtol(str, &end, 10); // NOLINT // Has strtol() consumed all characters in the string? if (*end != '\0') { // No - an invalid character was encountered. Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value \"" << str << "\".\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } // Is the parsed value in the range of an Int32? const Int32 result = static_cast(long_value); if (long_value == LONG_MAX || long_value == LONG_MIN || // The parsed value overflows as a long. (strtol() returns // LONG_MAX or LONG_MIN when the input overflows.) result != long_value // The parsed value overflows as an Int32. ) { Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value " << str << ", which overflows.\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } *value = result; return true; } // Reads and returns the Boolean environment variable corresponding to // the given flag; if it's not set, returns default_value. // // The value is considered true iff it's not "0". bool BoolFromGTestEnv(const char* flag, bool default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); return string_value == NULL ? default_value : strcmp(string_value, "0") != 0; } // Reads and returns a 32-bit integer stored in the environment // variable corresponding to the given flag; if it isn't set or // doesn't represent a valid 32-bit integer, returns default_value. Int32 Int32FromGTestEnv(const char* flag, Int32 default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); if (string_value == NULL) { // The environment variable is not set. return default_value; } Int32 result = default_value; if (!ParseInt32(Message() << "Environment variable " << env_var, string_value, &result)) { printf("The default value %s is used.\n", (Message() << default_value).GetString().c_str()); fflush(stdout); return default_value; } return result; } // Reads and returns the string environment variable corresponding to // the given flag; if it's not set, returns default_value. const char* StringFromGTestEnv(const char* flag, const char* default_value) { const String env_var = FlagToEnvVar(flag); const char* const value = posix::GetEnv(env_var.c_str()); return value == NULL ? default_value : value; } } // namespace internal } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // It uses the << operator when possible, and prints the bytes in the // object otherwise. A user can override its behavior for a class // type Foo by defining either operator<<(::std::ostream&, const Foo&) // or void PrintTo(const Foo&, ::std::ostream*) in the namespace that // defines Foo. #include #include #include // NOLINT #include namespace testing { namespace { using ::std::ostream; #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not define _snprintf_s. # define snprintf _snprintf #elif _MSC_VER >= 1400 // VC 8.0 and later deprecate snprintf and _snprintf. # define snprintf _snprintf_s #elif _MSC_VER # define snprintf _snprintf #endif // GTEST_OS_WINDOWS_MOBILE // Prints a segment of bytes in the given object. void PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, size_t count, ostream* os) { char text[5] = ""; for (size_t i = 0; i != count; i++) { const size_t j = start + i; if (i != 0) { // Organizes the bytes into groups of 2 for easy parsing by // human. if ((j % 2) == 0) *os << ' '; else *os << '-'; } snprintf(text, sizeof(text), "%02X", obj_bytes[j]); *os << text; } } // Prints the bytes in the given value to the given ostream. void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, ostream* os) { // Tells the user how big the object is. *os << count << "-byte object <"; const size_t kThreshold = 132; const size_t kChunkSize = 64; // If the object size is bigger than kThreshold, we'll have to omit // some details by printing only the first and the last kChunkSize // bytes. // TODO(wan): let the user control the threshold using a flag. if (count < kThreshold) { PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); } else { PrintByteSegmentInObjectTo(obj_bytes, 0, kChunkSize, os); *os << " ... "; // Rounds up to 2-byte boundary. const size_t resume_pos = (count - kChunkSize + 1)/2*2; PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); } *os << ">"; } } // namespace namespace internal2 { // Delegates to PrintBytesInObjectToImpl() to print the bytes in the // given object. The delegation simplifies the implementation, which // uses the << operator and thus is easier done outside of the // ::testing::internal namespace, which contains a << operator that // sometimes conflicts with the one in STL. void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ostream* os) { PrintBytesInObjectToImpl(obj_bytes, count, os); } } // namespace internal2 namespace internal { // Depending on the value of a char (or wchar_t), we print it in one // of three formats: // - as is if it's a printable ASCII (e.g. 'a', '2', ' '), // - as a hexidecimal escape sequence (e.g. '\x7F'), or // - as a special escape sequence (e.g. '\r', '\n'). enum CharFormat { kAsIs, kHexEscape, kSpecialEscape }; // Returns true if c is a printable ASCII character. We test the // value of c directly instead of calling isprint(), which is buggy on // Windows Mobile. inline bool IsPrintableAscii(wchar_t c) { return 0x20 <= c && c <= 0x7E; } // Prints a wide or narrow char c as a character literal without the // quotes, escaping it when necessary; returns how c was formatted. // The template argument UnsignedChar is the unsigned version of Char, // which is the type of c. template static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) { switch (static_cast(c)) { case L'\0': *os << "\\0"; break; case L'\'': *os << "\\'"; break; case L'\\': *os << "\\\\"; break; case L'\a': *os << "\\a"; break; case L'\b': *os << "\\b"; break; case L'\f': *os << "\\f"; break; case L'\n': *os << "\\n"; break; case L'\r': *os << "\\r"; break; case L'\t': *os << "\\t"; break; case L'\v': *os << "\\v"; break; default: if (IsPrintableAscii(c)) { *os << static_cast(c); return kAsIs; } else { *os << String::Format("\\x%X", static_cast(c)); return kHexEscape; } } return kSpecialEscape; } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsWideStringLiteralTo(wchar_t c, ostream* os) { switch (c) { case L'\'': *os << "'"; return kAsIs; case L'"': *os << "\\\""; return kSpecialEscape; default: return PrintAsCharLiteralTo(c, os); } } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsNarrowStringLiteralTo(char c, ostream* os) { return PrintAsWideStringLiteralTo(static_cast(c), os); } // Prints a wide or narrow character c and its code. '\0' is printed // as "'\\0'", other unprintable characters are also properly escaped // using the standard C++ escape sequence. The template argument // UnsignedChar is the unsigned version of Char, which is the type of c. template void PrintCharAndCodeTo(Char c, ostream* os) { // First, print c as a literal in the most readable form we can find. *os << ((sizeof(c) > 1) ? "L'" : "'"); const CharFormat format = PrintAsCharLiteralTo(c, os); *os << "'"; // To aid user debugging, we also print c's code in decimal, unless // it's 0 (in which case c was printed as '\\0', making the code // obvious). if (c == 0) return; *os << " (" << String::Format("%d", c).c_str(); // For more convenience, we print c's code again in hexidecimal, // unless c was already printed in the form '\x##' or the code is in // [1, 9]. if (format == kHexEscape || (1 <= c && c <= 9)) { // Do nothing. } else { *os << String::Format(", 0x%X", static_cast(c)).c_str(); } *os << ")"; } void PrintTo(unsigned char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } void PrintTo(signed char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its code. L'\0' is printed as "L'\\0'". void PrintTo(wchar_t wc, ostream* os) { PrintCharAndCodeTo(wc, os); } // Prints the given array of characters to the ostream. // The array starts at *begin, the length is len, it may include '\0' characters // and may not be null-terminated. static void PrintCharsAsStringTo(const char* begin, size_t len, ostream* os) { *os << "\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const char cur = begin[index]; if (is_previous_hex && IsXDigit(cur)) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" \""; } is_previous_hex = PrintAsNarrowStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints a (const) char array of 'len' elements, starting at address 'begin'. void UniversalPrintArray(const char* begin, size_t len, ostream* os) { PrintCharsAsStringTo(begin, len, os); } // Prints the given array of wide characters to the ostream. // The array starts at *begin, the length is len, it may include L'\0' // characters and may not be null-terminated. static void PrintWideCharsAsStringTo(const wchar_t* begin, size_t len, ostream* os) { *os << "L\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const wchar_t cur = begin[index]; if (is_previous_hex && isascii(cur) && IsXDigit(static_cast(cur))) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" L\""; } is_previous_hex = PrintAsWideStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints the given C string to the ostream. void PrintTo(const char* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintCharsAsStringTo(s, strlen(s), os); } } // MSVC compiler can be configured to define whar_t as a typedef // of unsigned short. Defining an overload for const wchar_t* in that case // would cause pointers to unsigned shorts be printed as wide strings, // possibly accessing more memory than intended and causing invalid // memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when // wchar_t is implemented as a native type. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Prints the given wide C string to the ostream. void PrintTo(const wchar_t* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintWideCharsAsStringTo(s, wcslen(s), os); } } #endif // wchar_t is native // Prints a ::string object. #if GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::std::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } // Prints a ::wstring object. #if GTEST_HAS_GLOBAL_WSTRING void PrintWideStringTo(const ::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING void PrintWideStringTo(const ::std::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_STD_WSTRING } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // The Google C++ Testing Framework (Google Test) // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { using internal::GetUnitTestImpl; // Gets the summary of the failure message by omitting the stack trace // in it. internal::String TestPartResult::ExtractSummary(const char* message) { const char* const stack_trace = strstr(message, internal::kStackTraceMarker); return stack_trace == NULL ? internal::String(message) : internal::String(message, stack_trace - message); } // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result) { return os << result.file_name() << ":" << result.line_number() << ": " << (result.type() == TestPartResult::kSuccess ? "Success" : result.type() == TestPartResult::kFatalFailure ? "Fatal failure" : "Non-fatal failure") << ":\n" << result.message() << std::endl; } // Appends a TestPartResult to the array. void TestPartResultArray::Append(const TestPartResult& result) { array_.push_back(result); } // Returns the TestPartResult at the given index (0-based). const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const { if (index < 0 || index >= size()) { printf("\nInvalid index (%d) into TestPartResultArray.\n", index); internal::posix::Abort(); } return array_[index]; } // Returns the number of TestPartResult objects in the array. int TestPartResultArray::size() const { return static_cast(array_.size()); } namespace internal { HasNewFatalFailureHelper::HasNewFatalFailureHelper() : has_new_fatal_failure_(false), original_reporter_(GetUnitTestImpl()-> GetTestPartResultReporterForCurrentThread()) { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread(this); } HasNewFatalFailureHelper::~HasNewFatalFailureHelper() { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread( original_reporter_); } void HasNewFatalFailureHelper::ReportTestPartResult( const TestPartResult& result) { if (result.fatally_failed()) has_new_fatal_failure_ = true; original_reporter_->ReportTestPartResult(result); } } // namespace internal } // namespace testing // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) namespace testing { namespace internal { #if GTEST_HAS_TYPED_TEST_P // Skips to the first non-space char in str. Returns an empty string if str // contains only whitespace characters. static const char* SkipSpaces(const char* str) { while (IsSpace(*str)) str++; return str; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* TypedTestCasePState::VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests) { typedef ::std::set::const_iterator DefinedTestIter; registered_ = true; // Skip initial whitespace in registered_tests since some // preprocessors prefix stringizied literals with whitespace. registered_tests = SkipSpaces(registered_tests); Message errors; ::std::set tests; for (const char* names = registered_tests; names != NULL; names = SkipComma(names)) { const String name = GetPrefixUntilComma(names); if (tests.count(name) != 0) { errors << "Test " << name << " is listed more than once.\n"; continue; } bool found = false; for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (name == *it) { found = true; break; } } if (found) { tests.insert(name); } else { errors << "No test named " << name << " can be found in this test case.\n"; } } for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (tests.count(*it) == 0) { errors << "You forgot to list test " << *it << ".\n"; } } const String& errors_str = errors.GetString(); if (errors_str != "") { fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors_str.c_str()); fflush(stderr); posix::Abort(); } return registered_tests; } #endif // GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Mocking Framework (Google Mock) // // This file #includes all Google Mock implementation .cc files. The // purpose is to allow a user to build Google Mock by compiling this // file alone. // This line ensures that gmock.h can be compiled on its own, even // when it's fused. #include "gmock/gmock.h" // The following lines pull in the real gmock *.cc files. // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements cardinalities. #include #include // NOLINT #include #include namespace testing { namespace { // Implements the Between(m, n) cardinality. class BetweenCardinalityImpl : public CardinalityInterface { public: BetweenCardinalityImpl(int min, int max) : min_(min >= 0 ? min : 0), max_(max >= min_ ? max : min_) { std::stringstream ss; if (min < 0) { ss << "The invocation lower bound must be >= 0, " << "but is actually " << min << "."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } else if (max < 0) { ss << "The invocation upper bound must be >= 0, " << "but is actually " << max << "."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } else if (min > max) { ss << "The invocation upper bound (" << max << ") must be >= the invocation lower bound (" << min << ")."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } } // Conservative estimate on the lower/upper bound of the number of // calls allowed. virtual int ConservativeLowerBound() const { return min_; } virtual int ConservativeUpperBound() const { return max_; } virtual bool IsSatisfiedByCallCount(int call_count) const { return min_ <= call_count && call_count <= max_ ; } virtual bool IsSaturatedByCallCount(int call_count) const { return call_count >= max_; } virtual void DescribeTo(::std::ostream* os) const; private: const int min_; const int max_; GTEST_DISALLOW_COPY_AND_ASSIGN_(BetweenCardinalityImpl); }; // Formats "n times" in a human-friendly way. inline internal::string FormatTimes(int n) { if (n == 1) { return "once"; } else if (n == 2) { return "twice"; } else { std::stringstream ss; ss << n << " times"; return ss.str(); } } // Describes the Between(m, n) cardinality in human-friendly text. void BetweenCardinalityImpl::DescribeTo(::std::ostream* os) const { if (min_ == 0) { if (max_ == 0) { *os << "never called"; } else if (max_ == INT_MAX) { *os << "called any number of times"; } else { *os << "called at most " << FormatTimes(max_); } } else if (min_ == max_) { *os << "called " << FormatTimes(min_); } else if (max_ == INT_MAX) { *os << "called at least " << FormatTimes(min_); } else { // 0 < min_ < max_ < INT_MAX *os << "called between " << min_ << " and " << max_ << " times"; } } } // Unnamed namespace // Describes the given call count to an ostream. void Cardinality::DescribeActualCallCountTo(int actual_call_count, ::std::ostream* os) { if (actual_call_count > 0) { *os << "called " << FormatTimes(actual_call_count); } else { *os << "never called"; } } // Creates a cardinality that allows at least n calls. Cardinality AtLeast(int n) { return Between(n, INT_MAX); } // Creates a cardinality that allows at most n calls. Cardinality AtMost(int n) { return Between(0, n); } // Creates a cardinality that allows any number of calls. Cardinality AnyNumber() { return AtLeast(0); } // Creates a cardinality that allows between min and max calls. Cardinality Between(int min, int max) { return Cardinality(new BetweenCardinalityImpl(min, max)); } // Creates a cardinality that allows exactly n calls. Cardinality Exactly(int n) { return Between(n, n); } } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file defines some utilities useful for implementing Google // Mock. They are subject to change without notice, so please DO NOT // USE THEM IN USER CODE. #include #include // NOLINT #include namespace testing { namespace internal { // Converts an identifier name to a space-separated list of lower-case // words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is // treated as one word. For example, both "FooBar123" and // "foo_bar_123" are converted to "foo bar 123". string ConvertIdentifierNameToWords(const char* id_name) { string result; char prev_char = '\0'; for (const char* p = id_name; *p != '\0'; prev_char = *(p++)) { // We don't care about the current locale as the input is // guaranteed to be a valid C++ identifier name. const bool starts_new_word = IsUpper(*p) || (!IsAlpha(prev_char) && IsLower(*p)) || (!IsDigit(prev_char) && IsDigit(*p)); if (IsAlNum(*p)) { if (starts_new_word && result != "") result += ' '; result += ToLower(*p); } } return result; } // This class reports Google Mock failures as Google Test failures. A // user can define another class in a similar fashion if he intends to // use Google Mock with a testing framework other than Google Test. class GoogleTestFailureReporter : public FailureReporterInterface { public: virtual void ReportFailure(FailureType type, const char* file, int line, const string& message) { AssertHelper(type == FATAL ? TestPartResult::kFatalFailure : TestPartResult::kNonFatalFailure, file, line, message.c_str()) = Message(); if (type == FATAL) { posix::Abort(); } } }; // Returns the global failure reporter. Will create a // GoogleTestFailureReporter and return it the first time called. FailureReporterInterface* GetFailureReporter() { // Points to the global failure reporter used by Google Mock. gcc // guarantees that the following use of failure_reporter is // thread-safe. We may need to add additional synchronization to // protect failure_reporter if we port Google Mock to other // compilers. static FailureReporterInterface* const failure_reporter = new GoogleTestFailureReporter(); return failure_reporter; } // Protects global resources (stdout in particular) used by Log(). static GTEST_DEFINE_STATIC_MUTEX_(g_log_mutex); // Returns true iff a log with the given severity is visible according // to the --gmock_verbose flag. bool LogIsVisible(LogSeverity severity) { if (GMOCK_FLAG(verbose) == kInfoVerbosity) { // Always show the log if --gmock_verbose=info. return true; } else if (GMOCK_FLAG(verbose) == kErrorVerbosity) { // Always hide it if --gmock_verbose=error. return false; } else { // If --gmock_verbose is neither "info" nor "error", we treat it // as "warning" (its default value). return severity == WARNING; } } // Prints the given message to stdout iff 'severity' >= the level // specified by the --gmock_verbose flag. If stack_frames_to_skip >= // 0, also prints the stack trace excluding the top // stack_frames_to_skip frames. In opt mode, any positive // stack_frames_to_skip is treated as 0, since we don't know which // function calls will be inlined by the compiler and need to be // conservative. void Log(LogSeverity severity, const string& message, int stack_frames_to_skip) { if (!LogIsVisible(severity)) return; // Ensures that logs from different threads don't interleave. MutexLock l(&g_log_mutex); // "using ::std::cout;" doesn't work with Symbian's STLport, where cout is a // macro. if (severity == WARNING) { // Prints a GMOCK WARNING marker to make the warnings easily searchable. std::cout << "\nGMOCK WARNING:"; } // Pre-pends a new-line to message if it doesn't start with one. if (message.empty() || message[0] != '\n') { std::cout << "\n"; } std::cout << message; if (stack_frames_to_skip >= 0) { #ifdef NDEBUG // In opt mode, we have to be conservative and skip no stack frame. const int actual_to_skip = 0; #else // In dbg mode, we can do what the caller tell us to do (plus one // for skipping this function's stack frame). const int actual_to_skip = stack_frames_to_skip + 1; #endif // NDEBUG // Appends a new-line to message if it doesn't end with one. if (!message.empty() && *message.rbegin() != '\n') { std::cout << "\n"; } std::cout << "Stack trace:\n" << ::testing::internal::GetCurrentOsStackTraceExceptTop( ::testing::UnitTest::GetInstance(), actual_to_skip); } std::cout << ::std::flush; } } // namespace internal } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements Matcher, Matcher, and // utilities for defining matchers. #include #include #include namespace testing { // Constructs a matcher that matches a const string& whose value is // equal to s. Matcher::Matcher(const internal::string& s) { *this = Eq(s); } // Constructs a matcher that matches a const string& whose value is // equal to s. Matcher::Matcher(const char* s) { *this = Eq(internal::string(s)); } // Constructs a matcher that matches a string whose value is equal to s. Matcher::Matcher(const internal::string& s) { *this = Eq(s); } // Constructs a matcher that matches a string whose value is equal to s. Matcher::Matcher(const char* s) { *this = Eq(internal::string(s)); } namespace internal { // Joins a vector of strings as if they are fields of a tuple; returns // the joined string. string JoinAsTuple(const Strings& fields) { switch (fields.size()) { case 0: return ""; case 1: return fields[0]; default: string result = "(" + fields[0]; for (size_t i = 1; i < fields.size(); i++) { result += ", "; result += fields[i]; } result += ")"; return result; } } // Returns the description for a matcher defined using the MATCHER*() // macro where the user-supplied description string is "", if // 'negation' is false; otherwise returns the description of the // negation of the matcher. 'param_values' contains a list of strings // that are the print-out of the matcher's parameters. string FormatMatcherDescription(bool negation, const char* matcher_name, const Strings& param_values) { string result = ConvertIdentifierNameToWords(matcher_name); if (param_values.size() >= 1) result += " " + JoinAsTuple(param_values); return negation ? "not (" + result + ")" : result; } } // namespace internal } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements the spec builder syntax (ON_CALL and // EXPECT_CALL). #include #include // NOLINT #include #include #include #if GTEST_OS_CYGWIN || GTEST_OS_LINUX || GTEST_OS_MAC # include // NOLINT #endif namespace testing { namespace internal { // Protects the mock object registry (in class Mock), all function // mockers, and all expectations. GTEST_DEFINE_STATIC_MUTEX_(g_gmock_mutex); // Logs a message including file and line number information. void LogWithLocation(testing::internal::LogSeverity severity, const char* file, int line, const string& message) { ::std::ostringstream s; s << file << ":" << line << ": " << message << ::std::endl; Log(severity, s.str(), 0); } // Constructs an ExpectationBase object. ExpectationBase::ExpectationBase(const char* a_file, int a_line, const string& a_source_text) : file_(a_file), line_(a_line), source_text_(a_source_text), cardinality_specified_(false), cardinality_(Exactly(1)), call_count_(0), retired_(false), extra_matcher_specified_(false), repeated_action_specified_(false), retires_on_saturation_(false), last_clause_(kNone), action_count_checked_(false) {} // Destructs an ExpectationBase object. ExpectationBase::~ExpectationBase() {} // Explicitly specifies the cardinality of this expectation. Used by // the subclasses to implement the .Times() clause. void ExpectationBase::SpecifyCardinality(const Cardinality& a_cardinality) { cardinality_specified_ = true; cardinality_ = a_cardinality; } // Retires all pre-requisites of this expectation. void ExpectationBase::RetireAllPreRequisites() { if (is_retired()) { // We can take this short-cut as we never retire an expectation // until we have retired all its pre-requisites. return; } for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { ExpectationBase* const prerequisite = it->expectation_base().get(); if (!prerequisite->is_retired()) { prerequisite->RetireAllPreRequisites(); prerequisite->Retire(); } } } // Returns true iff all pre-requisites of this expectation have been // satisfied. // L >= g_gmock_mutex bool ExpectationBase::AllPrerequisitesAreSatisfied() const { g_gmock_mutex.AssertHeld(); for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { if (!(it->expectation_base()->IsSatisfied()) || !(it->expectation_base()->AllPrerequisitesAreSatisfied())) return false; } return true; } // Adds unsatisfied pre-requisites of this expectation to 'result'. // L >= g_gmock_mutex void ExpectationBase::FindUnsatisfiedPrerequisites( ExpectationSet* result) const { g_gmock_mutex.AssertHeld(); for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { if (it->expectation_base()->IsSatisfied()) { // If *it is satisfied and has a call count of 0, some of its // pre-requisites may not be satisfied yet. if (it->expectation_base()->call_count_ == 0) { it->expectation_base()->FindUnsatisfiedPrerequisites(result); } } else { // Now that we know *it is unsatisfied, we are not so interested // in whether its pre-requisites are satisfied. Therefore we // don't recursively call FindUnsatisfiedPrerequisites() here. *result += *it; } } } // Describes how many times a function call matching this // expectation has occurred. // L >= g_gmock_mutex void ExpectationBase::DescribeCallCountTo(::std::ostream* os) const { g_gmock_mutex.AssertHeld(); // Describes how many times the function is expected to be called. *os << " Expected: to be "; cardinality().DescribeTo(os); *os << "\n Actual: "; Cardinality::DescribeActualCallCountTo(call_count(), os); // Describes the state of the expectation (e.g. is it satisfied? // is it active?). *os << " - " << (IsOverSaturated() ? "over-saturated" : IsSaturated() ? "saturated" : IsSatisfied() ? "satisfied" : "unsatisfied") << " and " << (is_retired() ? "retired" : "active"); } // Checks the action count (i.e. the number of WillOnce() and // WillRepeatedly() clauses) against the cardinality if this hasn't // been done before. Prints a warning if there are too many or too // few actions. // L < mutex_ void ExpectationBase::CheckActionCountIfNotDone() const { bool should_check = false; { MutexLock l(&mutex_); if (!action_count_checked_) { action_count_checked_ = true; should_check = true; } } if (should_check) { if (!cardinality_specified_) { // The cardinality was inferred - no need to check the action // count against it. return; } // The cardinality was explicitly specified. const int action_count = static_cast(untyped_actions_.size()); const int upper_bound = cardinality().ConservativeUpperBound(); const int lower_bound = cardinality().ConservativeLowerBound(); bool too_many; // True if there are too many actions, or false // if there are too few. if (action_count > upper_bound || (action_count == upper_bound && repeated_action_specified_)) { too_many = true; } else if (0 < action_count && action_count < lower_bound && !repeated_action_specified_) { too_many = false; } else { return; } ::std::stringstream ss; DescribeLocationTo(&ss); ss << "Too " << (too_many ? "many" : "few") << " actions specified in " << source_text() << "...\n" << "Expected to be "; cardinality().DescribeTo(&ss); ss << ", but has " << (too_many ? "" : "only ") << action_count << " WillOnce()" << (action_count == 1 ? "" : "s"); if (repeated_action_specified_) { ss << " and a WillRepeatedly()"; } ss << "."; Log(WARNING, ss.str(), -1); // -1 means "don't print stack trace". } } // Implements the .Times() clause. void ExpectationBase::UntypedTimes(const Cardinality& a_cardinality) { if (last_clause_ == kTimes) { ExpectSpecProperty(false, ".Times() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kTimes, ".Times() cannot appear after " ".InSequence(), .WillOnce(), .WillRepeatedly(), " "or .RetiresOnSaturation()."); } last_clause_ = kTimes; SpecifyCardinality(a_cardinality); } // Points to the implicit sequence introduced by a living InSequence // object (if any) in the current thread or NULL. ThreadLocal g_gmock_implicit_sequence; // Reports an uninteresting call (whose description is in msg) in the // manner specified by 'reaction'. void ReportUninterestingCall(CallReaction reaction, const string& msg) { switch (reaction) { case ALLOW: Log(INFO, msg, 3); break; case WARN: Log(WARNING, msg, 3); break; default: // FAIL Expect(false, NULL, -1, msg); } } UntypedFunctionMockerBase::UntypedFunctionMockerBase() : mock_obj_(NULL), name_("") {} UntypedFunctionMockerBase::~UntypedFunctionMockerBase() {} // Sets the mock object this mock method belongs to, and registers // this information in the global mock registry. Will be called // whenever an EXPECT_CALL() or ON_CALL() is executed on this mock // method. // L < g_gmock_mutex void UntypedFunctionMockerBase::RegisterOwner(const void* mock_obj) { { MutexLock l(&g_gmock_mutex); mock_obj_ = mock_obj; } Mock::Register(mock_obj, this); } // Sets the mock object this mock method belongs to, and sets the name // of the mock function. Will be called upon each invocation of this // mock function. // L < g_gmock_mutex void UntypedFunctionMockerBase::SetOwnerAndName( const void* mock_obj, const char* name) { // We protect name_ under g_gmock_mutex in case this mock function // is called from two threads concurrently. MutexLock l(&g_gmock_mutex); mock_obj_ = mock_obj; name_ = name; } // Returns the name of the function being mocked. Must be called // after RegisterOwner() or SetOwnerAndName() has been called. // L < g_gmock_mutex const void* UntypedFunctionMockerBase::MockObject() const { const void* mock_obj; { // We protect mock_obj_ under g_gmock_mutex in case this mock // function is called from two threads concurrently. MutexLock l(&g_gmock_mutex); Assert(mock_obj_ != NULL, __FILE__, __LINE__, "MockObject() must not be called before RegisterOwner() or " "SetOwnerAndName() has been called."); mock_obj = mock_obj_; } return mock_obj; } // Returns the name of this mock method. Must be called after // SetOwnerAndName() has been called. // L < g_gmock_mutex const char* UntypedFunctionMockerBase::Name() const { const char* name; { // We protect name_ under g_gmock_mutex in case this mock // function is called from two threads concurrently. MutexLock l(&g_gmock_mutex); Assert(name_ != NULL, __FILE__, __LINE__, "Name() must not be called before SetOwnerAndName() has " "been called."); name = name_; } return name; } // Calculates the result of invoking this mock function with the given // arguments, prints it, and returns it. The caller is responsible // for deleting the result. // L < g_gmock_mutex const UntypedActionResultHolderBase* UntypedFunctionMockerBase::UntypedInvokeWith(const void* const untyped_args) { if (untyped_expectations_.size() == 0) { // No expectation is set on this mock method - we have an // uninteresting call. // We must get Google Mock's reaction on uninteresting calls // made on this mock object BEFORE performing the action, // because the action may DELETE the mock object and make the // following expression meaningless. const CallReaction reaction = Mock::GetReactionOnUninterestingCalls(MockObject()); // True iff we need to print this call's arguments and return // value. This definition must be kept in sync with // the behavior of ReportUninterestingCall(). const bool need_to_report_uninteresting_call = // If the user allows this uninteresting call, we print it // only when he wants informational messages. reaction == ALLOW ? LogIsVisible(INFO) : // If the user wants this to be a warning, we print it only // when he wants to see warnings. reaction == WARN ? LogIsVisible(WARNING) : // Otherwise, the user wants this to be an error, and we // should always print detailed information in the error. true; if (!need_to_report_uninteresting_call) { // Perform the action without printing the call information. return this->UntypedPerformDefaultAction(untyped_args, ""); } // Warns about the uninteresting call. ::std::stringstream ss; this->UntypedDescribeUninterestingCall(untyped_args, &ss); // Calculates the function result. const UntypedActionResultHolderBase* const result = this->UntypedPerformDefaultAction(untyped_args, ss.str()); // Prints the function result. if (result != NULL) result->PrintAsActionResult(&ss); ReportUninterestingCall(reaction, ss.str()); return result; } bool is_excessive = false; ::std::stringstream ss; ::std::stringstream why; ::std::stringstream loc; const void* untyped_action = NULL; // The UntypedFindMatchingExpectation() function acquires and // releases g_gmock_mutex. const ExpectationBase* const untyped_expectation = this->UntypedFindMatchingExpectation( untyped_args, &untyped_action, &is_excessive, &ss, &why); const bool found = untyped_expectation != NULL; // True iff we need to print the call's arguments and return value. // This definition must be kept in sync with the uses of Expect() // and Log() in this function. const bool need_to_report_call = !found || is_excessive || LogIsVisible(INFO); if (!need_to_report_call) { // Perform the action without printing the call information. return untyped_action == NULL ? this->UntypedPerformDefaultAction(untyped_args, "") : this->UntypedPerformAction(untyped_action, untyped_args); } ss << " Function call: " << Name(); this->UntypedPrintArgs(untyped_args, &ss); // In case the action deletes a piece of the expectation, we // generate the message beforehand. if (found && !is_excessive) { untyped_expectation->DescribeLocationTo(&loc); } const UntypedActionResultHolderBase* const result = untyped_action == NULL ? this->UntypedPerformDefaultAction(untyped_args, ss.str()) : this->UntypedPerformAction(untyped_action, untyped_args); if (result != NULL) result->PrintAsActionResult(&ss); ss << "\n" << why.str(); if (!found) { // No expectation matches this call - reports a failure. Expect(false, NULL, -1, ss.str()); } else if (is_excessive) { // We had an upper-bound violation and the failure message is in ss. Expect(false, untyped_expectation->file(), untyped_expectation->line(), ss.str()); } else { // We had an expected call and the matching expectation is // described in ss. Log(INFO, loc.str() + ss.str(), 2); } return result; } // Returns an Expectation object that references and co-owns exp, // which must be an expectation on this mock function. Expectation UntypedFunctionMockerBase::GetHandleOf(ExpectationBase* exp) { for (UntypedExpectations::const_iterator it = untyped_expectations_.begin(); it != untyped_expectations_.end(); ++it) { if (it->get() == exp) { return Expectation(*it); } } Assert(false, __FILE__, __LINE__, "Cannot find expectation."); return Expectation(); // The above statement is just to make the code compile, and will // never be executed. } // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex bool UntypedFunctionMockerBase::VerifyAndClearExpectationsLocked() { g_gmock_mutex.AssertHeld(); bool expectations_met = true; for (UntypedExpectations::const_iterator it = untyped_expectations_.begin(); it != untyped_expectations_.end(); ++it) { ExpectationBase* const untyped_expectation = it->get(); if (untyped_expectation->IsOverSaturated()) { // There was an upper-bound violation. Since the error was // already reported when it occurred, there is no need to do // anything here. expectations_met = false; } else if (!untyped_expectation->IsSatisfied()) { expectations_met = false; ::std::stringstream ss; ss << "Actual function call count doesn't match " << untyped_expectation->source_text() << "...\n"; // No need to show the source file location of the expectation // in the description, as the Expect() call that follows already // takes care of it. untyped_expectation->MaybeDescribeExtraMatcherTo(&ss); untyped_expectation->DescribeCallCountTo(&ss); Expect(false, untyped_expectation->file(), untyped_expectation->line(), ss.str()); } } untyped_expectations_.clear(); return expectations_met; } } // namespace internal // Class Mock. namespace { typedef std::set FunctionMockers; // The current state of a mock object. Such information is needed for // detecting leaked mock objects and explicitly verifying a mock's // expectations. struct MockObjectState { MockObjectState() : first_used_file(NULL), first_used_line(-1), leakable(false) {} // Where in the source file an ON_CALL or EXPECT_CALL is first // invoked on this mock object. const char* first_used_file; int first_used_line; ::std::string first_used_test_case; ::std::string first_used_test; bool leakable; // true iff it's OK to leak the object. FunctionMockers function_mockers; // All registered methods of the object. }; // A global registry holding the state of all mock objects that are // alive. A mock object is added to this registry the first time // Mock::AllowLeak(), ON_CALL(), or EXPECT_CALL() is called on it. It // is removed from the registry in the mock object's destructor. class MockObjectRegistry { public: // Maps a mock object (identified by its address) to its state. typedef std::map StateMap; // This destructor will be called when a program exits, after all // tests in it have been run. By then, there should be no mock // object alive. Therefore we report any living object as test // failure, unless the user explicitly asked us to ignore it. ~MockObjectRegistry() { // "using ::std::cout;" doesn't work with Symbian's STLport, where cout is // a macro. if (!GMOCK_FLAG(catch_leaked_mocks)) return; int leaked_count = 0; for (StateMap::const_iterator it = states_.begin(); it != states_.end(); ++it) { if (it->second.leakable) // The user said it's fine to leak this object. continue; // TODO(wan@google.com): Print the type of the leaked object. // This can help the user identify the leaked object. std::cout << "\n"; const MockObjectState& state = it->second; std::cout << internal::FormatFileLocation(state.first_used_file, state.first_used_line); std::cout << " ERROR: this mock object"; if (state.first_used_test != "") { std::cout << " (used in test " << state.first_used_test_case << "." << state.first_used_test << ")"; } std::cout << " should be deleted but never is. Its address is @" << it->first << "."; leaked_count++; } if (leaked_count > 0) { std::cout << "\nERROR: " << leaked_count << " leaked mock " << (leaked_count == 1 ? "object" : "objects") << " found at program exit.\n"; std::cout.flush(); ::std::cerr.flush(); // RUN_ALL_TESTS() has already returned when this destructor is // called. Therefore we cannot use the normal Google Test // failure reporting mechanism. _exit(1); // We cannot call exit() as it is not reentrant and // may already have been called. } } StateMap& states() { return states_; } private: StateMap states_; }; // Protected by g_gmock_mutex. MockObjectRegistry g_mock_object_registry; // Maps a mock object to the reaction Google Mock should have when an // uninteresting method is called. Protected by g_gmock_mutex. std::map g_uninteresting_call_reaction; // Sets the reaction Google Mock should have when an uninteresting // method of the given mock object is called. // L < g_gmock_mutex void SetReactionOnUninterestingCalls(const void* mock_obj, internal::CallReaction reaction) { internal::MutexLock l(&internal::g_gmock_mutex); g_uninteresting_call_reaction[mock_obj] = reaction; } } // namespace // Tells Google Mock to allow uninteresting calls on the given mock // object. // L < g_gmock_mutex void Mock::AllowUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::ALLOW); } // Tells Google Mock to warn the user about uninteresting calls on the // given mock object. // L < g_gmock_mutex void Mock::WarnUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::WARN); } // Tells Google Mock to fail uninteresting calls on the given mock // object. // L < g_gmock_mutex void Mock::FailUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::FAIL); } // Tells Google Mock the given mock object is being destroyed and its // entry in the call-reaction table should be removed. // L < g_gmock_mutex void Mock::UnregisterCallReaction(const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); g_uninteresting_call_reaction.erase(mock_obj); } // Returns the reaction Google Mock will have on uninteresting calls // made on the given mock object. // L < g_gmock_mutex internal::CallReaction Mock::GetReactionOnUninterestingCalls( const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); return (g_uninteresting_call_reaction.count(mock_obj) == 0) ? internal::WARN : g_uninteresting_call_reaction[mock_obj]; } // Tells Google Mock to ignore mock_obj when checking for leaked mock // objects. // L < g_gmock_mutex void Mock::AllowLeak(const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); g_mock_object_registry.states()[mock_obj].leakable = true; } // Verifies and clears all expectations on the given mock object. If // the expectations aren't satisfied, generates one or more Google // Test non-fatal failures and returns false. // L < g_gmock_mutex bool Mock::VerifyAndClearExpectations(void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); return VerifyAndClearExpectationsLocked(mock_obj); } // Verifies all expectations on the given mock object and clears its // default actions and expectations. Returns true iff the // verification was successful. // L < g_gmock_mutex bool Mock::VerifyAndClear(void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); ClearDefaultActionsLocked(mock_obj); return VerifyAndClearExpectationsLocked(mock_obj); } // Verifies and clears all expectations on the given mock object. If // the expectations aren't satisfied, generates one or more Google // Test non-fatal failures and returns false. // L >= g_gmock_mutex bool Mock::VerifyAndClearExpectationsLocked(void* mock_obj) { internal::g_gmock_mutex.AssertHeld(); if (g_mock_object_registry.states().count(mock_obj) == 0) { // No EXPECT_CALL() was set on the given mock object. return true; } // Verifies and clears the expectations on each mock method in the // given mock object. bool expectations_met = true; FunctionMockers& mockers = g_mock_object_registry.states()[mock_obj].function_mockers; for (FunctionMockers::const_iterator it = mockers.begin(); it != mockers.end(); ++it) { if (!(*it)->VerifyAndClearExpectationsLocked()) { expectations_met = false; } } // We don't clear the content of mockers, as they may still be // needed by ClearDefaultActionsLocked(). return expectations_met; } // Registers a mock object and a mock method it owns. // L < g_gmock_mutex void Mock::Register(const void* mock_obj, internal::UntypedFunctionMockerBase* mocker) { internal::MutexLock l(&internal::g_gmock_mutex); g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker); } // Tells Google Mock where in the source code mock_obj is used in an // ON_CALL or EXPECT_CALL. In case mock_obj is leaked, this // information helps the user identify which object it is. // L < g_gmock_mutex void Mock::RegisterUseByOnCallOrExpectCall( const void* mock_obj, const char* file, int line) { internal::MutexLock l(&internal::g_gmock_mutex); MockObjectState& state = g_mock_object_registry.states()[mock_obj]; if (state.first_used_file == NULL) { state.first_used_file = file; state.first_used_line = line; const TestInfo* const test_info = UnitTest::GetInstance()->current_test_info(); if (test_info != NULL) { // TODO(wan@google.com): record the test case name when the // ON_CALL or EXPECT_CALL is invoked from SetUpTestCase() or // TearDownTestCase(). state.first_used_test_case = test_info->test_case_name(); state.first_used_test = test_info->name(); } } } // Unregisters a mock method; removes the owning mock object from the // registry when the last mock method associated with it has been // unregistered. This is called only in the destructor of // FunctionMockerBase. // L >= g_gmock_mutex void Mock::UnregisterLocked(internal::UntypedFunctionMockerBase* mocker) { internal::g_gmock_mutex.AssertHeld(); for (MockObjectRegistry::StateMap::iterator it = g_mock_object_registry.states().begin(); it != g_mock_object_registry.states().end(); ++it) { FunctionMockers& mockers = it->second.function_mockers; if (mockers.erase(mocker) > 0) { // mocker was in mockers and has been just removed. if (mockers.empty()) { g_mock_object_registry.states().erase(it); } return; } } } // Clears all ON_CALL()s set on the given mock object. // L >= g_gmock_mutex void Mock::ClearDefaultActionsLocked(void* mock_obj) { internal::g_gmock_mutex.AssertHeld(); if (g_mock_object_registry.states().count(mock_obj) == 0) { // No ON_CALL() was set on the given mock object. return; } // Clears the default actions for each mock method in the given mock // object. FunctionMockers& mockers = g_mock_object_registry.states()[mock_obj].function_mockers; for (FunctionMockers::const_iterator it = mockers.begin(); it != mockers.end(); ++it) { (*it)->ClearDefaultActionsLocked(); } // We don't clear the content of mockers, as they may still be // needed by VerifyAndClearExpectationsLocked(). } Expectation::Expectation() {} Expectation::Expectation( const internal::linked_ptr& an_expectation_base) : expectation_base_(an_expectation_base) {} Expectation::~Expectation() {} // Adds an expectation to a sequence. void Sequence::AddExpectation(const Expectation& expectation) const { if (*last_expectation_ != expectation) { if (last_expectation_->expectation_base() != NULL) { expectation.expectation_base()->immediate_prerequisites_ += *last_expectation_; } *last_expectation_ = expectation; } } // Creates the implicit sequence if there isn't one. InSequence::InSequence() { if (internal::g_gmock_implicit_sequence.get() == NULL) { internal::g_gmock_implicit_sequence.set(new Sequence); sequence_created_ = true; } else { sequence_created_ = false; } } // Deletes the implicit sequence if it was created by the constructor // of this object. InSequence::~InSequence() { if (sequence_created_) { delete internal::g_gmock_implicit_sequence.get(); internal::g_gmock_implicit_sequence.set(NULL); } } } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) namespace testing { // TODO(wan@google.com): support using environment variables to // control the flag values, like what Google Test does. GMOCK_DEFINE_bool_(catch_leaked_mocks, true, "true iff Google Mock should report leaked mock objects " "as failures."); GMOCK_DEFINE_string_(verbose, internal::kWarningVerbosity, "Controls how verbose Google Mock's output is." " Valid values:\n" " info - prints all messages.\n" " warning - prints warnings and errors.\n" " error - prints errors only."); namespace internal { // Parses a string as a command line flag. The string should have the // format "--gmock_flag=value". When def_optional is true, the // "=value" part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. static const char* ParseGoogleMockFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--gmock_". const String flag_str = String::Format("--gmock_%s", flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a Google Mock bool flag, in the form of // "--gmock_flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. static bool ParseGoogleMockBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseGoogleMockFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for a Google Mock string flag, in the form of // "--gmock_flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. static bool ParseGoogleMockStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseGoogleMockFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // The internal implementation of InitGoogleMock(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleMockImpl(int* argc, CharType** argv) { // Makes sure Google Test is initialized. InitGoogleTest() is // idempotent, so it's fine if the user has already called it. InitGoogleTest(argc, argv); if (*argc <= 0) return; for (int i = 1; i != *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); // Do we see a Google Mock flag? if (ParseGoogleMockBoolFlag(arg, "catch_leaked_mocks", &GMOCK_FLAG(catch_leaked_mocks)) || ParseGoogleMockStringFlag(arg, "verbose", &GMOCK_FLAG(verbose))) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } } } } // namespace internal // Initializes Google Mock. This must be called before running the // tests. In particular, it parses a command line for the flags that // Google Mock recognizes. Whenever a Google Mock flag is seen, it is // removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Mock flag variables are // updated. // // Since Google Test is needed for Google Mock to work, this function // also initializes Google Test and parses its flags, if that hasn't // been done. void InitGoogleMock(int* argc, char** argv) { internal::InitGoogleMockImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleMock(int* argc, wchar_t** argv) { internal::InitGoogleMockImpl(argc, argv); } } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gmock/gmock.h0000600000175000017500000172046611561126632023676 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This is the main header file a user should include. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_H_ // This file implements the following syntax: // // ON_CALL(mock_object.Method(...)) // .With(...) ? // .WillByDefault(...); // // where With() is optional and WillByDefault() must appear exactly // once. // // EXPECT_CALL(mock_object.Method(...)) // .With(...) ? // .Times(...) ? // .InSequence(...) * // .WillOnce(...) * // .WillRepeatedly(...) ? // .RetiresOnSaturation() ? ; // // where all clauses are optional and WillOnce() can be repeated. // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used actions. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ #include #include #ifndef _WIN32_WCE # include #endif // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file defines some utilities useful for implementing Google // Mock. They are subject to change without notice, so please DO NOT // USE THEM IN USER CODE. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ #include #include // NOLINT #include // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file contains template meta-programming utility classes needed // for implementing Google Mock. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vadimb@google.com (Vadim Berman) // // Low-level types and utilities for porting Google Mock to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ #include #include #include // Most of the types needed for porting Google Mock are also required // for Google Test and are defined in gtest-port.h. #include "gtest/gtest.h" // To avoid conditional compilation everywhere, we make it // gmock-port.h's responsibility to #include the header implementing // tr1/tuple. gmock-port.h does this via gtest-port.h, which is // guaranteed to pull in the tuple header. // For MS Visual C++, check the compiler version. At least VS 2003 is // required to compile Google Mock. #if defined(_MSC_VER) && _MSC_VER < 1310 # error "At least Visual C++ 2003 (7.1) is required to compile Google Mock." #endif // Macro for referencing flags. This is public as we want the user to // use this syntax to reference Google Mock flags. #define GMOCK_FLAG(name) FLAGS_gmock_##name // Macros for declaring flags. #define GMOCK_DECLARE_bool_(name) extern bool GMOCK_FLAG(name) #define GMOCK_DECLARE_int32_(name) \ extern ::testing::internal::Int32 GMOCK_FLAG(name) #define GMOCK_DECLARE_string_(name) \ extern ::testing::internal::String GMOCK_FLAG(name) // Macros for defining flags. #define GMOCK_DEFINE_bool_(name, default_val, doc) \ bool GMOCK_FLAG(name) = (default_val) #define GMOCK_DEFINE_int32_(name, default_val, doc) \ ::testing::internal::Int32 GMOCK_FLAG(name) = (default_val) #define GMOCK_DEFINE_string_(name, default_val, doc) \ ::testing::internal::String GMOCK_FLAG(name) = (default_val) #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ namespace testing { template class Matcher; namespace internal { // An IgnoredValue object can be implicitly constructed from ANY value. // This is used in implementing the IgnoreResult(a) action. class IgnoredValue { public: // This constructor template allows any value to be implicitly // converted to IgnoredValue. The object has no data member and // doesn't try to remember anything about the argument. We // deliberately omit the 'explicit' keyword in order to allow the // conversion to be implicit. template IgnoredValue(const T&) {} }; // MatcherTuple::type is a tuple type where each field is a Matcher // for the corresponding field in tuple type T. template struct MatcherTuple; template <> struct MatcherTuple< ::std::tr1::tuple<> > { typedef ::std::tr1::tuple< > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; // Template struct Function, where F must be a function type, contains // the following typedefs: // // Result: the function's return type. // ArgumentN: the type of the N-th argument, where N starts with 1. // ArgumentTuple: the tuple type consisting of all parameters of F. // ArgumentMatcherTuple: the tuple type consisting of Matchers for all // parameters of F. // MakeResultVoid: the function type obtained by substituting void // for the return type of F. // MakeResultIgnoredValue: // the function type obtained by substituting Something // for the return type of F. template struct Function; template struct Function { typedef R Result; typedef ::std::tr1::tuple<> ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(); typedef IgnoredValue MakeResultIgnoredValue(); }; template struct Function : Function { typedef A1 Argument1; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1); typedef IgnoredValue MakeResultIgnoredValue(A1); }; template struct Function : Function { typedef A2 Argument2; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2); typedef IgnoredValue MakeResultIgnoredValue(A1, A2); }; template struct Function : Function { typedef A3 Argument3; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3); }; template struct Function : Function { typedef A4 Argument4; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4); }; template struct Function : Function { typedef A5 Argument5; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5); }; template struct Function : Function { typedef A6 Argument6; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6); }; template struct Function : Function { typedef A7 Argument7; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7); }; template struct Function : Function { typedef A8 Argument8; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8); }; template struct Function : Function { typedef A9 Argument9; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8, A9); }; template struct Function : Function { typedef A10 Argument10; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); }; } // namespace internal } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ namespace testing { namespace internal { // Converts an identifier name to a space-separated list of lower-case // words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is // treated as one word. For example, both "FooBar123" and // "foo_bar_123" are converted to "foo bar 123". string ConvertIdentifierNameToWords(const char* id_name); // PointeeOf::type is the type of a value pointed to by a // Pointer, which can be either a smart pointer or a raw pointer. The // following default implementation is for the case where Pointer is a // smart pointer. template struct PointeeOf { // Smart pointer classes define type element_type as the type of // their pointees. typedef typename Pointer::element_type type; }; // This specialization is for the raw pointer case. template struct PointeeOf { typedef T type; }; // NOLINT // GetRawPointer(p) returns the raw pointer underlying p when p is a // smart pointer, or returns p itself when p is already a raw pointer. // The following default implementation is for the smart pointer case. template inline typename Pointer::element_type* GetRawPointer(const Pointer& p) { return p.get(); } // This overloaded version is for the raw pointer case. template inline Element* GetRawPointer(Element* p) { return p; } // This comparator allows linked_ptr to be stored in sets. template struct LinkedPtrLessThan { bool operator()(const ::testing::internal::linked_ptr& lhs, const ::testing::internal::linked_ptr& rhs) const { return lhs.get() < rhs.get(); } }; // Symbian compilation can be done with wchar_t being either a native // type or a typedef. Using Google Mock with OpenC without wchar_t // should require the definition of _STLP_NO_WCHAR_T. // // MSVC treats wchar_t as a native type usually, but treats it as the // same as unsigned short when the compiler option /Zc:wchar_t- is // specified. It defines _NATIVE_WCHAR_T_DEFINED symbol when wchar_t // is a native type. #if (GTEST_OS_SYMBIAN && defined(_STLP_NO_WCHAR_T)) || \ (defined(_MSC_VER) && !defined(_NATIVE_WCHAR_T_DEFINED)) // wchar_t is a typedef. #else # define GMOCK_WCHAR_T_IS_NATIVE_ 1 #endif // signed wchar_t and unsigned wchar_t are NOT in the C++ standard. // Using them is a bad practice and not portable. So DON'T use them. // // Still, Google Mock is designed to work even if the user uses signed // wchar_t or unsigned wchar_t (obviously, assuming the compiler // supports them). // // To gcc, // wchar_t == signed wchar_t != unsigned wchar_t == unsigned int #ifdef __GNUC__ // signed/unsigned wchar_t are valid types. # define GMOCK_HAS_SIGNED_WCHAR_T_ 1 #endif // In what follows, we use the term "kind" to indicate whether a type // is bool, an integer type (excluding bool), a floating-point type, // or none of them. This categorization is useful for determining // when a matcher argument type can be safely converted to another // type in the implementation of SafeMatcherCast. enum TypeKind { kBool, kInteger, kFloatingPoint, kOther }; // KindOf::value is the kind of type T. template struct KindOf { enum { value = kOther }; // The default kind. }; // This macro declares that the kind of 'type' is 'kind'. #define GMOCK_DECLARE_KIND_(type, kind) \ template <> struct KindOf { enum { value = kind }; } GMOCK_DECLARE_KIND_(bool, kBool); // All standard integer types. GMOCK_DECLARE_KIND_(char, kInteger); GMOCK_DECLARE_KIND_(signed char, kInteger); GMOCK_DECLARE_KIND_(unsigned char, kInteger); GMOCK_DECLARE_KIND_(short, kInteger); // NOLINT GMOCK_DECLARE_KIND_(unsigned short, kInteger); // NOLINT GMOCK_DECLARE_KIND_(int, kInteger); GMOCK_DECLARE_KIND_(unsigned int, kInteger); GMOCK_DECLARE_KIND_(long, kInteger); // NOLINT GMOCK_DECLARE_KIND_(unsigned long, kInteger); // NOLINT #if GMOCK_WCHAR_T_IS_NATIVE_ GMOCK_DECLARE_KIND_(wchar_t, kInteger); #endif // Non-standard integer types. GMOCK_DECLARE_KIND_(Int64, kInteger); GMOCK_DECLARE_KIND_(UInt64, kInteger); // All standard floating-point types. GMOCK_DECLARE_KIND_(float, kFloatingPoint); GMOCK_DECLARE_KIND_(double, kFloatingPoint); GMOCK_DECLARE_KIND_(long double, kFloatingPoint); #undef GMOCK_DECLARE_KIND_ // Evaluates to the kind of 'type'. #define GMOCK_KIND_OF_(type) \ static_cast< ::testing::internal::TypeKind>( \ ::testing::internal::KindOf::value) // Evaluates to true iff integer type T is signed. #define GMOCK_IS_SIGNED_(T) (static_cast(-1) < 0) // LosslessArithmeticConvertibleImpl::value // is true iff arithmetic type From can be losslessly converted to // arithmetic type To. // // It's the user's responsibility to ensure that both From and To are // raw (i.e. has no CV modifier, is not a pointer, and is not a // reference) built-in arithmetic types, kFromKind is the kind of // From, and kToKind is the kind of To; the value is // implementation-defined when the above pre-condition is violated. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // Converting bool to bool is lossless. template <> struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting bool to any integer type is lossless. template struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting bool to any floating-point type is lossless. template struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting an integer to bool is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting an integer to another non-bool integer is lossless iff // the target type's range encloses the source type's range. template struct LosslessArithmeticConvertibleImpl : public bool_constant< // When converting from a smaller size to a larger size, we are // fine as long as we are not converting from signed to unsigned. ((sizeof(From) < sizeof(To)) && (!GMOCK_IS_SIGNED_(From) || GMOCK_IS_SIGNED_(To))) || // When converting between the same size, the signedness must match. ((sizeof(From) == sizeof(To)) && (GMOCK_IS_SIGNED_(From) == GMOCK_IS_SIGNED_(To)))> {}; // NOLINT #undef GMOCK_IS_SIGNED_ // Converting an integer to a floating-point type may be lossy, since // the format of a floating-point number is implementation-defined. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to bool is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to an integer is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to another floating-point is lossless // iff the target type is at least as big as the source type. template struct LosslessArithmeticConvertibleImpl< kFloatingPoint, From, kFloatingPoint, To> : public bool_constant {}; // NOLINT // LosslessArithmeticConvertible::value is true iff arithmetic // type From can be losslessly converted to arithmetic type To. // // It's the user's responsibility to ensure that both From and To are // raw (i.e. has no CV modifier, is not a pointer, and is not a // reference) built-in arithmetic types; the value is // implementation-defined when the above pre-condition is violated. template struct LosslessArithmeticConvertible : public LosslessArithmeticConvertibleImpl< GMOCK_KIND_OF_(From), From, GMOCK_KIND_OF_(To), To> {}; // NOLINT // This interface knows how to report a Google Mock failure (either // non-fatal or fatal). class FailureReporterInterface { public: // The type of a failure (either non-fatal or fatal). enum FailureType { NONFATAL, FATAL }; virtual ~FailureReporterInterface() {} // Reports a failure that occurred at the given source file location. virtual void ReportFailure(FailureType type, const char* file, int line, const string& message) = 0; }; // Returns the failure reporter used by Google Mock. FailureReporterInterface* GetFailureReporter(); // Asserts that condition is true; aborts the process with the given // message if condition is false. We cannot use LOG(FATAL) or CHECK() // as Google Mock might be used to mock the log sink itself. We // inline this function to prevent it from showing up in the stack // trace. inline void Assert(bool condition, const char* file, int line, const string& msg) { if (!condition) { GetFailureReporter()->ReportFailure(FailureReporterInterface::FATAL, file, line, msg); } } inline void Assert(bool condition, const char* file, int line) { Assert(condition, file, line, "Assertion failed."); } // Verifies that condition is true; generates a non-fatal failure if // condition is false. inline void Expect(bool condition, const char* file, int line, const string& msg) { if (!condition) { GetFailureReporter()->ReportFailure(FailureReporterInterface::NONFATAL, file, line, msg); } } inline void Expect(bool condition, const char* file, int line) { Expect(condition, file, line, "Expectation failed."); } // Severity level of a log. enum LogSeverity { INFO = 0, WARNING = 1 }; // Valid values for the --gmock_verbose flag. // All logs (informational and warnings) are printed. const char kInfoVerbosity[] = "info"; // Only warnings are printed. const char kWarningVerbosity[] = "warning"; // No logs are printed. const char kErrorVerbosity[] = "error"; // Returns true iff a log with the given severity is visible according // to the --gmock_verbose flag. bool LogIsVisible(LogSeverity severity); // Prints the given message to stdout iff 'severity' >= the level // specified by the --gmock_verbose flag. If stack_frames_to_skip >= // 0, also prints the stack trace excluding the top // stack_frames_to_skip frames. In opt mode, any positive // stack_frames_to_skip is treated as 0, since we don't know which // function calls will be inlined by the compiler and need to be // conservative. void Log(LogSeverity severity, const string& message, int stack_frames_to_skip); // TODO(wan@google.com): group all type utilities together. // Type traits. // is_reference::value is non-zero iff T is a reference type. template struct is_reference : public false_type {}; template struct is_reference : public true_type {}; // type_equals::value is non-zero iff T1 and T2 are the same type. template struct type_equals : public false_type {}; template struct type_equals : public true_type {}; // remove_reference::type removes the reference from type T, if any. template struct remove_reference { typedef T type; }; // NOLINT template struct remove_reference { typedef T type; }; // NOLINT // Invalid() returns an invalid value of type T. This is useful // when a value of type T is needed for compilation, but the statement // will not really be executed (or we don't care if the statement // crashes). template inline T Invalid() { return *static_cast::type*>(NULL); } template <> inline void Invalid() {} // Given a raw type (i.e. having no top-level reference or const // modifier) RawContainer that's either an STL-style container or a // native array, class StlContainerView has the // following members: // // - type is a type that provides an STL-style container view to // (i.e. implements the STL container concept for) RawContainer; // - const_reference is a type that provides a reference to a const // RawContainer; // - ConstReference(raw_container) returns a const reference to an STL-style // container view to raw_container, which is a RawContainer. // - Copy(raw_container) returns an STL-style container view of a // copy of raw_container, which is a RawContainer. // // This generic version is used when RawContainer itself is already an // STL-style container. template class StlContainerView { public: typedef RawContainer type; typedef const type& const_reference; static const_reference ConstReference(const RawContainer& container) { // Ensures that RawContainer is not a const type. testing::StaticAssertTypeEq(); return container; } static type Copy(const RawContainer& container) { return container; } }; // This specialization is used when RawContainer is a native array type. template class StlContainerView { public: typedef GTEST_REMOVE_CONST_(Element) RawElement; typedef internal::NativeArray type; // NativeArray can represent a native array either by value or by // reference (selected by a constructor argument), so 'const type' // can be used to reference a const native array. We cannot // 'typedef const type& const_reference' here, as that would mean // ConstReference() has to return a reference to a local variable. typedef const type const_reference; static const_reference ConstReference(const Element (&array)[N]) { // Ensures that Element is not a const type. testing::StaticAssertTypeEq(); #if GTEST_OS_SYMBIAN // The Nokia Symbian compiler confuses itself in template instantiation // for this call without the cast to Element*: // function call '[testing::internal::NativeArray].NativeArray( // {lval} const char *[4], long, testing::internal::RelationToSource)' // does not match // 'testing::internal::NativeArray::NativeArray( // char *const *, unsigned int, testing::internal::RelationToSource)' // (instantiating: 'testing::internal::ContainsMatcherImpl // ::Matches(const char * (&)[4]) const') // (instantiating: 'testing::internal::StlContainerView:: // ConstReference(const char * (&)[4])') // (and though the N parameter type is mismatched in the above explicit // conversion of it doesn't help - only the conversion of the array). return type(const_cast(&array[0]), N, kReference); #else return type(array, N, kReference); #endif // GTEST_OS_SYMBIAN } static type Copy(const Element (&array)[N]) { #if GTEST_OS_SYMBIAN return type(const_cast(&array[0]), N, kCopy); #else return type(array, N, kCopy); #endif // GTEST_OS_SYMBIAN } }; // This specialization is used when RawContainer is a native array // represented as a (pointer, size) tuple. template class StlContainerView< ::std::tr1::tuple > { public: typedef GTEST_REMOVE_CONST_( typename internal::PointeeOf::type) RawElement; typedef internal::NativeArray type; typedef const type const_reference; static const_reference ConstReference( const ::std::tr1::tuple& array) { using ::std::tr1::get; return type(get<0>(array), get<1>(array), kReference); } static type Copy(const ::std::tr1::tuple& array) { using ::std::tr1::get; return type(get<0>(array), get<1>(array), kCopy); } }; // The following specialization prevents the user from instantiating // StlContainer with a reference type. template class StlContainerView; } // namespace internal } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ namespace testing { // To implement an action Foo, define: // 1. a class FooAction that implements the ActionInterface interface, and // 2. a factory function that creates an Action object from a // const FooAction*. // // The two-level delegation design follows that of Matcher, providing // consistency for extension developers. It also eases ownership // management as Action objects can now be copied like plain values. namespace internal { template class ActionAdaptor; // BuiltInDefaultValue::Get() returns the "built-in" default // value for type T, which is NULL when T is a pointer type, 0 when T // is a numeric type, false when T is bool, or "" when T is string or // std::string. For any other type T, this value is undefined and the // function will abort the process. template class BuiltInDefaultValue { public: // This function returns true iff type T has a built-in default value. static bool Exists() { return false; } static T Get() { Assert(false, __FILE__, __LINE__, "Default action undefined for the function return type."); return internal::Invalid(); // The above statement will never be reached, but is required in // order for this function to compile. } }; // This partial specialization says that we use the same built-in // default value for T and const T. template class BuiltInDefaultValue { public: static bool Exists() { return BuiltInDefaultValue::Exists(); } static T Get() { return BuiltInDefaultValue::Get(); } }; // This partial specialization defines the default values for pointer // types. template class BuiltInDefaultValue { public: static bool Exists() { return true; } static T* Get() { return NULL; } }; // The following specializations define the default values for // specific types we care about. #define GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(type, value) \ template <> \ class BuiltInDefaultValue { \ public: \ static bool Exists() { return true; } \ static type Get() { return value; } \ } GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(void, ); // NOLINT #if GTEST_HAS_GLOBAL_STRING GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(::string, ""); #endif // GTEST_HAS_GLOBAL_STRING GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(::std::string, ""); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(bool, false); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned char, '\0'); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed char, '\0'); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(char, '\0'); // There's no need for a default action for signed wchar_t, as that // type is the same as wchar_t for gcc, and invalid for MSVC. // // There's also no need for a default action for unsigned wchar_t, as // that type is the same as unsigned int for gcc, and invalid for // MSVC. #if GMOCK_WCHAR_T_IS_NATIVE_ GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(wchar_t, 0U); // NOLINT #endif GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned short, 0U); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed short, 0); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned int, 0U); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed int, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned long, 0UL); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed long, 0L); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(UInt64, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(Int64, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(float, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(double, 0); #undef GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_ } // namespace internal // When an unexpected function call is encountered, Google Mock will // let it return a default value if the user has specified one for its // return type, or if the return type has a built-in default value; // otherwise Google Mock won't know what value to return and will have // to abort the process. // // The DefaultValue class allows a user to specify the // default value for a type T that is both copyable and publicly // destructible (i.e. anything that can be used as a function return // type). The usage is: // // // Sets the default value for type T to be foo. // DefaultValue::Set(foo); template class DefaultValue { public: // Sets the default value for type T; requires T to be // copy-constructable and have a public destructor. static void Set(T x) { delete value_; value_ = new T(x); } // Unsets the default value for type T. static void Clear() { delete value_; value_ = NULL; } // Returns true iff the user has set the default value for type T. static bool IsSet() { return value_ != NULL; } // Returns true if T has a default return value set by the user or there // exists a built-in default value. static bool Exists() { return IsSet() || internal::BuiltInDefaultValue::Exists(); } // Returns the default value for type T if the user has set one; // otherwise returns the built-in default value if there is one; // otherwise aborts the process. static T Get() { return value_ == NULL ? internal::BuiltInDefaultValue::Get() : *value_; } private: static const T* value_; }; // This partial specialization allows a user to set default values for // reference types. template class DefaultValue { public: // Sets the default value for type T&. static void Set(T& x) { // NOLINT address_ = &x; } // Unsets the default value for type T&. static void Clear() { address_ = NULL; } // Returns true iff the user has set the default value for type T&. static bool IsSet() { return address_ != NULL; } // Returns true if T has a default return value set by the user or there // exists a built-in default value. static bool Exists() { return IsSet() || internal::BuiltInDefaultValue::Exists(); } // Returns the default value for type T& if the user has set one; // otherwise returns the built-in default value if there is one; // otherwise aborts the process. static T& Get() { return address_ == NULL ? internal::BuiltInDefaultValue::Get() : *address_; } private: static T* address_; }; // This specialization allows DefaultValue::Get() to // compile. template <> class DefaultValue { public: static bool Exists() { return true; } static void Get() {} }; // Points to the user-set default value for type T. template const T* DefaultValue::value_ = NULL; // Points to the user-set default value for type T&. template T* DefaultValue::address_ = NULL; // Implement this interface to define an action for function type F. template class ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; ActionInterface() {} virtual ~ActionInterface() {} // Performs the action. This method is not const, as in general an // action can have side effects and be stateful. For example, a // get-the-next-element-from-the-collection action will need to // remember the current element. virtual Result Perform(const ArgumentTuple& args) = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ActionInterface); }; // An Action is a copyable and IMMUTABLE (except by assignment) // object that represents an action to be taken when a mock function // of type F is called. The implementation of Action is just a // linked_ptr to const ActionInterface, so copying is fairly cheap. // Don't inherit from Action! // // You can view an object implementing ActionInterface as a // concrete action (including its current state), and an Action // object as a handle to it. template class Action { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; // Constructs a null Action. Needed for storing Action objects in // STL containers. Action() : impl_(NULL) {} // Constructs an Action from its implementation. A NULL impl is // used to represent the "do-default" action. explicit Action(ActionInterface* impl) : impl_(impl) {} // Copy constructor. Action(const Action& action) : impl_(action.impl_) {} // This constructor allows us to turn an Action object into an // Action, as long as F's arguments can be implicitly converted // to Func's and Func's return type can be implicitly converted to // F's. template explicit Action(const Action& action); // Returns true iff this is the DoDefault() action. bool IsDoDefault() const { return impl_.get() == NULL; } // Performs the action. Note that this method is const even though // the corresponding method in ActionInterface is not. The reason // is that a const Action means that it cannot be re-bound to // another concrete action, not that the concrete action it binds to // cannot change state. (Think of the difference between a const // pointer and a pointer to const.) Result Perform(const ArgumentTuple& args) const { internal::Assert( !IsDoDefault(), __FILE__, __LINE__, "You are using DoDefault() inside a composite action like " "DoAll() or WithArgs(). This is not supported for technical " "reasons. Please instead spell out the default action, or " "assign the default action to an Action variable and use " "the variable in various places."); return impl_->Perform(args); } private: template friend class internal::ActionAdaptor; internal::linked_ptr > impl_; }; // The PolymorphicAction class template makes it easy to implement a // polymorphic action (i.e. an action that can be used in mock // functions of than one type, e.g. Return()). // // To define a polymorphic action, a user first provides a COPYABLE // implementation class that has a Perform() method template: // // class FooAction { // public: // template // Result Perform(const ArgumentTuple& args) const { // // Processes the arguments and returns a result, using // // tr1::get(args) to get the N-th (0-based) argument in the tuple. // } // ... // }; // // Then the user creates the polymorphic action using // MakePolymorphicAction(object) where object has type FooAction. See // the definition of Return(void) and SetArgumentPointee(value) for // complete examples. template class PolymorphicAction { public: explicit PolymorphicAction(const Impl& impl) : impl_(impl) {} template operator Action() const { return Action(new MonomorphicImpl(impl_)); } private: template class MonomorphicImpl : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit MonomorphicImpl(const Impl& impl) : impl_(impl) {} virtual Result Perform(const ArgumentTuple& args) { return impl_.template Perform(args); } private: Impl impl_; GTEST_DISALLOW_ASSIGN_(MonomorphicImpl); }; Impl impl_; GTEST_DISALLOW_ASSIGN_(PolymorphicAction); }; // Creates an Action from its implementation and returns it. The // created Action object owns the implementation. template Action MakeAction(ActionInterface* impl) { return Action(impl); } // Creates a polymorphic action from its implementation. This is // easier to use than the PolymorphicAction constructor as it // doesn't require you to explicitly write the template argument, e.g. // // MakePolymorphicAction(foo); // vs // PolymorphicAction(foo); template inline PolymorphicAction MakePolymorphicAction(const Impl& impl) { return PolymorphicAction(impl); } namespace internal { // Allows an Action object to pose as an Action, as long as F2 // and F1 are compatible. template class ActionAdaptor : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit ActionAdaptor(const Action& from) : impl_(from.impl_) {} virtual Result Perform(const ArgumentTuple& args) { return impl_->Perform(args); } private: const internal::linked_ptr > impl_; GTEST_DISALLOW_ASSIGN_(ActionAdaptor); }; // Implements the polymorphic Return(x) action, which can be used in // any function that returns the type of x, regardless of the argument // types. // // Note: The value passed into Return must be converted into // Function::Result when this action is cast to Action rather than // when that action is performed. This is important in scenarios like // // MOCK_METHOD1(Method, T(U)); // ... // { // Foo foo; // X x(&foo); // EXPECT_CALL(mock, Method(_)).WillOnce(Return(x)); // } // // In the example above the variable x holds reference to foo which leaves // scope and gets destroyed. If copying X just copies a reference to foo, // that copy will be left with a hanging reference. If conversion to T // makes a copy of foo, the above code is safe. To support that scenario, we // need to make sure that the type conversion happens inside the EXPECT_CALL // statement, and conversion of the result of Return to Action is a // good place for that. // template class ReturnAction { public: // Constructs a ReturnAction object from the value to be returned. // 'value' is passed by value instead of by const reference in order // to allow Return("string literal") to compile. explicit ReturnAction(R value) : value_(value) {} // This template type conversion operator allows Return(x) to be // used in ANY function that returns x's type. template operator Action() const { // Assert statement belongs here because this is the best place to verify // conditions on F. It produces the clearest error messages // in most compilers. // Impl really belongs in this scope as a local class but can't // because MSVC produces duplicate symbols in different translation units // in this case. Until MS fixes that bug we put Impl into the class scope // and put the typedef both here (for use in assert statement) and // in the Impl class. But both definitions must be the same. typedef typename Function::Result Result; GTEST_COMPILE_ASSERT_( !internal::is_reference::value, use_ReturnRef_instead_of_Return_to_return_a_reference); return Action(new Impl(value_)); } private: // Implements the Return(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; // The implicit cast is necessary when Result has more than one // single-argument constructor (e.g. Result is std::vector) and R // has a type conversion operator template. In that case, value_(value) // won't compile as the compiler doesn't known which constructor of // Result to call. ImplicitCast_ forces the compiler to convert R to // Result without considering explicit constructors, thus resolving the // ambiguity. value_ is then initialized using its copy constructor. explicit Impl(R value) : value_(::testing::internal::ImplicitCast_(value)) {} virtual Result Perform(const ArgumentTuple&) { return value_; } private: GTEST_COMPILE_ASSERT_(!internal::is_reference::value, Result_cannot_be_a_reference_type); Result value_; GTEST_DISALLOW_ASSIGN_(Impl); }; R value_; GTEST_DISALLOW_ASSIGN_(ReturnAction); }; // Implements the ReturnNull() action. class ReturnNullAction { public: // Allows ReturnNull() to be used in any pointer-returning function. template static Result Perform(const ArgumentTuple&) { GTEST_COMPILE_ASSERT_(internal::is_pointer::value, ReturnNull_can_be_used_to_return_a_pointer_only); return NULL; } }; // Implements the Return() action. class ReturnVoidAction { public: // Allows Return() to be used in any void-returning function. template static void Perform(const ArgumentTuple&) { CompileAssertTypesEqual(); } }; // Implements the polymorphic ReturnRef(x) action, which can be used // in any function that returns a reference to the type of x, // regardless of the argument types. template class ReturnRefAction { public: // Constructs a ReturnRefAction object from the reference to be returned. explicit ReturnRefAction(T& ref) : ref_(ref) {} // NOLINT // This template type conversion operator allows ReturnRef(x) to be // used in ANY function that returns a reference to x's type. template operator Action() const { typedef typename Function::Result Result; // Asserts that the function return type is a reference. This // catches the user error of using ReturnRef(x) when Return(x) // should be used, and generates some helpful error message. GTEST_COMPILE_ASSERT_(internal::is_reference::value, use_Return_instead_of_ReturnRef_to_return_a_value); return Action(new Impl(ref_)); } private: // Implements the ReturnRef(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(T& ref) : ref_(ref) {} // NOLINT virtual Result Perform(const ArgumentTuple&) { return ref_; } private: T& ref_; GTEST_DISALLOW_ASSIGN_(Impl); }; T& ref_; GTEST_DISALLOW_ASSIGN_(ReturnRefAction); }; // Implements the polymorphic ReturnRefOfCopy(x) action, which can be // used in any function that returns a reference to the type of x, // regardless of the argument types. template class ReturnRefOfCopyAction { public: // Constructs a ReturnRefOfCopyAction object from the reference to // be returned. explicit ReturnRefOfCopyAction(const T& value) : value_(value) {} // NOLINT // This template type conversion operator allows ReturnRefOfCopy(x) to be // used in ANY function that returns a reference to x's type. template operator Action() const { typedef typename Function::Result Result; // Asserts that the function return type is a reference. This // catches the user error of using ReturnRefOfCopy(x) when Return(x) // should be used, and generates some helpful error message. GTEST_COMPILE_ASSERT_( internal::is_reference::value, use_Return_instead_of_ReturnRefOfCopy_to_return_a_value); return Action(new Impl(value_)); } private: // Implements the ReturnRefOfCopy(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(const T& value) : value_(value) {} // NOLINT virtual Result Perform(const ArgumentTuple&) { return value_; } private: T value_; GTEST_DISALLOW_ASSIGN_(Impl); }; const T value_; GTEST_DISALLOW_ASSIGN_(ReturnRefOfCopyAction); }; // Implements the polymorphic DoDefault() action. class DoDefaultAction { public: // This template type conversion operator allows DoDefault() to be // used in any function. template operator Action() const { return Action(NULL); } }; // Implements the Assign action to set a given pointer referent to a // particular value. template class AssignAction { public: AssignAction(T1* ptr, T2 value) : ptr_(ptr), value_(value) {} template void Perform(const ArgumentTuple& /* args */) const { *ptr_ = value_; } private: T1* const ptr_; const T2 value_; GTEST_DISALLOW_ASSIGN_(AssignAction); }; #if !GTEST_OS_WINDOWS_MOBILE // Implements the SetErrnoAndReturn action to simulate return from // various system calls and libc functions. template class SetErrnoAndReturnAction { public: SetErrnoAndReturnAction(int errno_value, T result) : errno_(errno_value), result_(result) {} template Result Perform(const ArgumentTuple& /* args */) const { errno = errno_; return result_; } private: const int errno_; const T result_; GTEST_DISALLOW_ASSIGN_(SetErrnoAndReturnAction); }; #endif // !GTEST_OS_WINDOWS_MOBILE // Implements the SetArgumentPointee(x) action for any function // whose N-th argument (0-based) is a pointer to x's type. The // template parameter kIsProto is true iff type A is ProtocolMessage, // proto2::Message, or a sub-class of those. template class SetArgumentPointeeAction { public: // Constructs an action that sets the variable pointed to by the // N-th function argument to 'value'. explicit SetArgumentPointeeAction(const A& value) : value_(value) {} template void Perform(const ArgumentTuple& args) const { CompileAssertTypesEqual(); *::std::tr1::get(args) = value_; } private: const A value_; GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction); }; template class SetArgumentPointeeAction { public: // Constructs an action that sets the variable pointed to by the // N-th function argument to 'proto'. Both ProtocolMessage and // proto2::Message have the CopyFrom() method, so the same // implementation works for both. explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) { proto_->CopyFrom(proto); } template void Perform(const ArgumentTuple& args) const { CompileAssertTypesEqual(); ::std::tr1::get(args)->CopyFrom(*proto_); } private: const internal::linked_ptr proto_; GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction); }; // Implements the InvokeWithoutArgs(f) action. The template argument // FunctionImpl is the implementation type of f, which can be either a // function pointer or a functor. InvokeWithoutArgs(f) can be used as an // Action as long as f's type is compatible with F (i.e. f can be // assigned to a tr1::function). template class InvokeWithoutArgsAction { public: // The c'tor makes a copy of function_impl (either a function // pointer or a functor). explicit InvokeWithoutArgsAction(FunctionImpl function_impl) : function_impl_(function_impl) {} // Allows InvokeWithoutArgs(f) to be used as any action whose type is // compatible with f. template Result Perform(const ArgumentTuple&) { return function_impl_(); } private: FunctionImpl function_impl_; GTEST_DISALLOW_ASSIGN_(InvokeWithoutArgsAction); }; // Implements the InvokeWithoutArgs(object_ptr, &Class::Method) action. template class InvokeMethodWithoutArgsAction { public: InvokeMethodWithoutArgsAction(Class* obj_ptr, MethodPtr method_ptr) : obj_ptr_(obj_ptr), method_ptr_(method_ptr) {} template Result Perform(const ArgumentTuple&) const { return (obj_ptr_->*method_ptr_)(); } private: Class* const obj_ptr_; const MethodPtr method_ptr_; GTEST_DISALLOW_ASSIGN_(InvokeMethodWithoutArgsAction); }; // Implements the IgnoreResult(action) action. template class IgnoreResultAction { public: explicit IgnoreResultAction(const A& action) : action_(action) {} template operator Action() const { // Assert statement belongs here because this is the best place to verify // conditions on F. It produces the clearest error messages // in most compilers. // Impl really belongs in this scope as a local class but can't // because MSVC produces duplicate symbols in different translation units // in this case. Until MS fixes that bug we put Impl into the class scope // and put the typedef both here (for use in assert statement) and // in the Impl class. But both definitions must be the same. typedef typename internal::Function::Result Result; // Asserts at compile time that F returns void. CompileAssertTypesEqual(); return Action(new Impl(action_)); } private: template class Impl : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit Impl(const A& action) : action_(action) {} virtual void Perform(const ArgumentTuple& args) { // Performs the action and ignores its result. action_.Perform(args); } private: // Type OriginalFunction is the same as F except that its return // type is IgnoredValue. typedef typename internal::Function::MakeResultIgnoredValue OriginalFunction; const Action action_; GTEST_DISALLOW_ASSIGN_(Impl); }; const A action_; GTEST_DISALLOW_ASSIGN_(IgnoreResultAction); }; // A ReferenceWrapper object represents a reference to type T, // which can be either const or not. It can be explicitly converted // from, and implicitly converted to, a T&. Unlike a reference, // ReferenceWrapper can be copied and can survive template type // inference. This is used to support by-reference arguments in the // InvokeArgument(...) action. The idea was from "reference // wrappers" in tr1, which we don't have in our source tree yet. template class ReferenceWrapper { public: // Constructs a ReferenceWrapper object from a T&. explicit ReferenceWrapper(T& l_value) : pointer_(&l_value) {} // NOLINT // Allows a ReferenceWrapper object to be implicitly converted to // a T&. operator T&() const { return *pointer_; } private: T* pointer_; }; // Allows the expression ByRef(x) to be printed as a reference to x. template void PrintTo(const ReferenceWrapper& ref, ::std::ostream* os) { T& value = ref; UniversalPrinter::Print(value, os); } // Does two actions sequentially. Used for implementing the DoAll(a1, // a2, ...) action. template class DoBothAction { public: DoBothAction(Action1 action1, Action2 action2) : action1_(action1), action2_(action2) {} // This template type conversion operator allows DoAll(a1, ..., a_n) // to be used in ANY function of compatible type. template operator Action() const { return Action(new Impl(action1_, action2_)); } private: // Implements the DoAll(...) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::MakeResultVoid VoidResult; Impl(const Action& action1, const Action& action2) : action1_(action1), action2_(action2) {} virtual Result Perform(const ArgumentTuple& args) { action1_.Perform(args); return action2_.Perform(args); } private: const Action action1_; const Action action2_; GTEST_DISALLOW_ASSIGN_(Impl); }; Action1 action1_; Action2 action2_; GTEST_DISALLOW_ASSIGN_(DoBothAction); }; } // namespace internal // An Unused object can be implicitly constructed from ANY value. // This is handy when defining actions that ignore some or all of the // mock function arguments. For example, given // // MOCK_METHOD3(Foo, double(const string& label, double x, double y)); // MOCK_METHOD3(Bar, double(int index, double x, double y)); // // instead of // // double DistanceToOriginWithLabel(const string& label, double x, double y) { // return sqrt(x*x + y*y); // } // double DistanceToOriginWithIndex(int index, double x, double y) { // return sqrt(x*x + y*y); // } // ... // EXEPCT_CALL(mock, Foo("abc", _, _)) // .WillOnce(Invoke(DistanceToOriginWithLabel)); // EXEPCT_CALL(mock, Bar(5, _, _)) // .WillOnce(Invoke(DistanceToOriginWithIndex)); // // you could write // // // We can declare any uninteresting argument as Unused. // double DistanceToOrigin(Unused, double x, double y) { // return sqrt(x*x + y*y); // } // ... // EXEPCT_CALL(mock, Foo("abc", _, _)).WillOnce(Invoke(DistanceToOrigin)); // EXEPCT_CALL(mock, Bar(5, _, _)).WillOnce(Invoke(DistanceToOrigin)); typedef internal::IgnoredValue Unused; // This constructor allows us to turn an Action object into an // Action, as long as To's arguments can be implicitly converted // to From's and From's return type cann be implicitly converted to // To's. template template Action::Action(const Action& from) : impl_(new internal::ActionAdaptor(from)) {} // Creates an action that returns 'value'. 'value' is passed by value // instead of const reference - otherwise Return("string literal") // will trigger a compiler error about using array as initializer. template internal::ReturnAction Return(R value) { return internal::ReturnAction(value); } // Creates an action that returns NULL. inline PolymorphicAction ReturnNull() { return MakePolymorphicAction(internal::ReturnNullAction()); } // Creates an action that returns from a void function. inline PolymorphicAction Return() { return MakePolymorphicAction(internal::ReturnVoidAction()); } // Creates an action that returns the reference to a variable. template inline internal::ReturnRefAction ReturnRef(R& x) { // NOLINT return internal::ReturnRefAction(x); } // Creates an action that returns the reference to a copy of the // argument. The copy is created when the action is constructed and // lives as long as the action. template inline internal::ReturnRefOfCopyAction ReturnRefOfCopy(const R& x) { return internal::ReturnRefOfCopyAction(x); } // Creates an action that does the default action for the give mock function. inline internal::DoDefaultAction DoDefault() { return internal::DoDefaultAction(); } // Creates an action that sets the variable pointed by the N-th // (0-based) function argument to 'value'. template PolymorphicAction< internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value> > SetArgPointee(const T& x) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value>(x)); } #if !((GTEST_GCC_VER_ && GTEST_GCC_VER_ < 40000) || GTEST_OS_SYMBIAN) // This overload allows SetArgPointee() to accept a string literal. // GCC prior to the version 4.0 and Symbian C++ compiler cannot distinguish // this overload from the templated version and emit a compile error. template PolymorphicAction< internal::SetArgumentPointeeAction > SetArgPointee(const char* p) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, const char*, false>(p)); } template PolymorphicAction< internal::SetArgumentPointeeAction > SetArgPointee(const wchar_t* p) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, const wchar_t*, false>(p)); } #endif // The following version is DEPRECATED. template PolymorphicAction< internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value> > SetArgumentPointee(const T& x) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value>(x)); } // Creates an action that sets a pointer referent to a given value. template PolymorphicAction > Assign(T1* ptr, T2 val) { return MakePolymorphicAction(internal::AssignAction(ptr, val)); } #if !GTEST_OS_WINDOWS_MOBILE // Creates an action that sets errno and returns the appropriate error. template PolymorphicAction > SetErrnoAndReturn(int errval, T result) { return MakePolymorphicAction( internal::SetErrnoAndReturnAction(errval, result)); } #endif // !GTEST_OS_WINDOWS_MOBILE // Various overloads for InvokeWithoutArgs(). // Creates an action that invokes 'function_impl' with no argument. template PolymorphicAction > InvokeWithoutArgs(FunctionImpl function_impl) { return MakePolymorphicAction( internal::InvokeWithoutArgsAction(function_impl)); } // Creates an action that invokes the given method on the given object // with no argument. template PolymorphicAction > InvokeWithoutArgs(Class* obj_ptr, MethodPtr method_ptr) { return MakePolymorphicAction( internal::InvokeMethodWithoutArgsAction( obj_ptr, method_ptr)); } // Creates an action that performs an_action and throws away its // result. In other words, it changes the return type of an_action to // void. an_action MUST NOT return void, or the code won't compile. template inline internal::IgnoreResultAction IgnoreResult(const A& an_action) { return internal::IgnoreResultAction(an_action); } // Creates a reference wrapper for the given L-value. If necessary, // you can explicitly specify the type of the reference. For example, // suppose 'derived' is an object of type Derived, ByRef(derived) // would wrap a Derived&. If you want to wrap a const Base& instead, // where Base is a base class of Derived, just write: // // ByRef(derived) template inline internal::ReferenceWrapper ByRef(T& l_value) { // NOLINT return internal::ReferenceWrapper(l_value); } } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used cardinalities. More // cardinalities can be defined by the user implementing the // CardinalityInterface interface if necessary. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ #include #include // NOLINT namespace testing { // To implement a cardinality Foo, define: // 1. a class FooCardinality that implements the // CardinalityInterface interface, and // 2. a factory function that creates a Cardinality object from a // const FooCardinality*. // // The two-level delegation design follows that of Matcher, providing // consistency for extension developers. It also eases ownership // management as Cardinality objects can now be copied like plain values. // The implementation of a cardinality. class CardinalityInterface { public: virtual ~CardinalityInterface() {} // Conservative estimate on the lower/upper bound of the number of // calls allowed. virtual int ConservativeLowerBound() const { return 0; } virtual int ConservativeUpperBound() const { return INT_MAX; } // Returns true iff call_count calls will satisfy this cardinality. virtual bool IsSatisfiedByCallCount(int call_count) const = 0; // Returns true iff call_count calls will saturate this cardinality. virtual bool IsSaturatedByCallCount(int call_count) const = 0; // Describes self to an ostream. virtual void DescribeTo(::std::ostream* os) const = 0; }; // A Cardinality is a copyable and IMMUTABLE (except by assignment) // object that specifies how many times a mock function is expected to // be called. The implementation of Cardinality is just a linked_ptr // to const CardinalityInterface, so copying is fairly cheap. // Don't inherit from Cardinality! class Cardinality { public: // Constructs a null cardinality. Needed for storing Cardinality // objects in STL containers. Cardinality() {} // Constructs a Cardinality from its implementation. explicit Cardinality(const CardinalityInterface* impl) : impl_(impl) {} // Conservative estimate on the lower/upper bound of the number of // calls allowed. int ConservativeLowerBound() const { return impl_->ConservativeLowerBound(); } int ConservativeUpperBound() const { return impl_->ConservativeUpperBound(); } // Returns true iff call_count calls will satisfy this cardinality. bool IsSatisfiedByCallCount(int call_count) const { return impl_->IsSatisfiedByCallCount(call_count); } // Returns true iff call_count calls will saturate this cardinality. bool IsSaturatedByCallCount(int call_count) const { return impl_->IsSaturatedByCallCount(call_count); } // Returns true iff call_count calls will over-saturate this // cardinality, i.e. exceed the maximum number of allowed calls. bool IsOverSaturatedByCallCount(int call_count) const { return impl_->IsSaturatedByCallCount(call_count) && !impl_->IsSatisfiedByCallCount(call_count); } // Describes self to an ostream void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); } // Describes the given actual call count to an ostream. static void DescribeActualCallCountTo(int actual_call_count, ::std::ostream* os); private: internal::linked_ptr impl_; }; // Creates a cardinality that allows at least n calls. Cardinality AtLeast(int n); // Creates a cardinality that allows at most n calls. Cardinality AtMost(int n); // Creates a cardinality that allows any number of calls. Cardinality AnyNumber(); // Creates a cardinality that allows between min and max calls. Cardinality Between(int min, int max); // Creates a cardinality that allows exactly n calls. Cardinality Exactly(int n); // Creates a cardinality from its implementation. inline Cardinality MakeCardinality(const CardinalityInterface* c) { return Cardinality(c); } } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic actions. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ namespace testing { namespace internal { // InvokeHelper knows how to unpack an N-tuple and invoke an N-ary // function or method with the unpacked values, where F is a function // type that takes N arguments. template class InvokeHelper; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple<>&) { return function(); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple<>&) { return (obj_ptr->*method_ptr)(); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } }; // CallableHelper has static methods for invoking "callables", // i.e. function pointers and functors. It uses overloading to // provide a uniform interface for invoking different kinds of // callables. In particular, you can use: // // CallableHelper::Call(callable, a1, a2, ..., an) // // to invoke an n-ary callable, where R is its return type. If an // argument, say a2, needs to be passed by reference, you should write // ByRef(a2) instead of a2 in the above expression. template class CallableHelper { public: // Calls a nullary callable. template static R Call(Function function) { return function(); } // Calls a unary callable. // We deliberately pass a1 by value instead of const reference here // in case it is a C-string literal. If we had declared the // parameter as 'const A1& a1' and write Call(function, "Hi"), the // compiler would've thought A1 is 'char[3]', which causes trouble // when you need to copy a value of type A1. By declaring the // parameter as 'A1 a1', the compiler will correctly infer that A1 // is 'const char*' when it sees Call(function, "Hi"). // // Since this function is defined inline, the compiler can get rid // of the copying of the arguments. Therefore the performance won't // be hurt. template static R Call(Function function, A1 a1) { return function(a1); } // Calls a binary callable. template static R Call(Function function, A1 a1, A2 a2) { return function(a1, a2); } // Calls a ternary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3) { return function(a1, a2, a3); } // Calls a 4-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4) { return function(a1, a2, a3, a4); } // Calls a 5-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { return function(a1, a2, a3, a4, a5); } // Calls a 6-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { return function(a1, a2, a3, a4, a5, a6); } // Calls a 7-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { return function(a1, a2, a3, a4, a5, a6, a7); } // Calls a 8-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { return function(a1, a2, a3, a4, a5, a6, a7, a8); } // Calls a 9-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { return function(a1, a2, a3, a4, a5, a6, a7, a8, a9); } // Calls a 10-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9, A10 a10) { return function(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10); } }; // class CallableHelper // An INTERNAL macro for extracting the type of a tuple field. It's // subject to change without notice - DO NOT USE IN USER CODE! #define GMOCK_FIELD_(Tuple, N) \ typename ::std::tr1::tuple_element::type // SelectArgs::type is the // type of an n-ary function whose i-th (1-based) argument type is the // k{i}-th (0-based) field of ArgumentTuple, which must be a tuple // type, and whose return type is Result. For example, // SelectArgs, 0, 3>::type // is int(bool, long). // // SelectArgs::Select(args) // returns the selected fields (k1, k2, ..., k_n) of args as a tuple. // For example, // SelectArgs, 2, 0>::Select( // ::std::tr1::make_tuple(true, 'a', 2.5)) // returns ::std::tr1::tuple (2.5, true). // // The numbers in list k1, k2, ..., k_n must be >= 0, where n can be // in the range [0, 10]. Duplicates are allowed and they don't have // to be in an ascending or descending order. template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8), GMOCK_FIELD_(ArgumentTuple, k9), GMOCK_FIELD_(ArgumentTuple, k10)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& /* args */) { using ::std::tr1::get; return SelectedArgs(); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8), GMOCK_FIELD_(ArgumentTuple, k9)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; #undef GMOCK_FIELD_ // Implements the WithArgs action. template class WithArgsAction { public: explicit WithArgsAction(const InnerAction& action) : action_(action) {} template operator Action() const { return MakeAction(new Impl(action_)); } private: template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(const InnerAction& action) : action_(action) {} virtual Result Perform(const ArgumentTuple& args) { return action_.Perform(SelectArgs::Select(args)); } private: typedef typename SelectArgs::type InnerFunctionType; Action action_; }; const InnerAction action_; GTEST_DISALLOW_ASSIGN_(WithArgsAction); }; // A macro from the ACTION* family (defined later in this file) // defines an action that can be used in a mock function. Typically, // these actions only care about a subset of the arguments of the mock // function. For example, if such an action only uses the second // argument, it can be used in any mock function that takes >= 2 // arguments where the type of the second argument is compatible. // // Therefore, the action implementation must be prepared to take more // arguments than it needs. The ExcessiveArg type is used to // represent those excessive arguments. In order to keep the compiler // error messages tractable, we define it in the testing namespace // instead of testing::internal. However, this is an INTERNAL TYPE // and subject to change without notice, so a user MUST NOT USE THIS // TYPE DIRECTLY. struct ExcessiveArg {}; // A helper class needed for implementing the ACTION* macros. template class ActionHelper { public: static Result Perform(Impl* impl, const ::std::tr1::tuple<>& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl<>(args, ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } }; } // namespace internal // Various overloads for Invoke(). // WithArgs(an_action) creates an action that passes // the selected arguments of the mock function to an_action and // performs it. It serves as an adaptor between actions with // different argument lists. C++ doesn't support default arguments for // function templates, so we have to overload it. template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } // Creates an action that does actions a1, a2, ..., sequentially in // each invocation. template inline internal::DoBothAction DoAll(Action1 a1, Action2 a2) { return internal::DoBothAction(a1, a2); } template inline internal::DoBothAction > DoAll(Action1 a1, Action2 a2, Action3 a3) { return DoAll(a1, DoAll(a2, a3)); } template inline internal::DoBothAction > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4) { return DoAll(a1, DoAll(a2, a3, a4)); } template inline internal::DoBothAction > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5) { return DoAll(a1, DoAll(a2, a3, a4, a5)); } template inline internal::DoBothAction > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6)); } template inline internal::DoBothAction > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7)); } template inline internal::DoBothAction > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8)); } template inline internal::DoBothAction > > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8, Action9 a9) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8, a9)); } template inline internal::DoBothAction > > > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8, Action9 a9, Action10 a10) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8, a9, a10)); } } // namespace testing // The ACTION* family of macros can be used in a namespace scope to // define custom actions easily. The syntax: // // ACTION(name) { statements; } // // will define an action with the given name that executes the // statements. The value returned by the statements will be used as // the return value of the action. Inside the statements, you can // refer to the K-th (0-based) argument of the mock function by // 'argK', and refer to its type by 'argK_type'. For example: // // ACTION(IncrementArg1) { // arg1_type temp = arg1; // return ++(*temp); // } // // allows you to write // // ...WillOnce(IncrementArg1()); // // You can also refer to the entire argument tuple and its type by // 'args' and 'args_type', and refer to the mock function type and its // return type by 'function_type' and 'return_type'. // // Note that you don't need to specify the types of the mock function // arguments. However rest assured that your code is still type-safe: // you'll get a compiler error if *arg1 doesn't support the ++ // operator, or if the type of ++(*arg1) isn't compatible with the // mock function's return type, for example. // // Sometimes you'll want to parameterize the action. For that you can use // another macro: // // ACTION_P(name, param_name) { statements; } // // For example: // // ACTION_P(Add, n) { return arg0 + n; } // // will allow you to write: // // ...WillOnce(Add(5)); // // Note that you don't need to provide the type of the parameter // either. If you need to reference the type of a parameter named // 'foo', you can write 'foo_type'. For example, in the body of // ACTION_P(Add, n) above, you can write 'n_type' to refer to the type // of 'n'. // // We also provide ACTION_P2, ACTION_P3, ..., up to ACTION_P10 to support // multi-parameter actions. // // For the purpose of typing, you can view // // ACTION_Pk(Foo, p1, ..., pk) { ... } // // as shorthand for // // template // FooActionPk Foo(p1_type p1, ..., pk_type pk) { ... } // // In particular, you can provide the template type arguments // explicitly when invoking Foo(), as in Foo(5, false); // although usually you can rely on the compiler to infer the types // for you automatically. You can assign the result of expression // Foo(p1, ..., pk) to a variable of type FooActionPk. This can be useful when composing actions. // // You can also overload actions with different numbers of parameters: // // ACTION_P(Plus, a) { ... } // ACTION_P2(Plus, a, b) { ... } // // While it's tempting to always use the ACTION* macros when defining // a new action, you should also consider implementing ActionInterface // or using MakePolymorphicAction() instead, especially if you need to // use the action a lot. While these approaches require more work, // they give you more control on the types of the mock function // arguments and the action parameters, which in general leads to // better compiler error messages that pay off in the long run. They // also allow overloading actions based on parameter types (as opposed // to just based on the number of parameters). // // CAVEAT: // // ACTION*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using ACTION*() inside // a function. // // MORE INFORMATION: // // To learn more about using these macros, please search for 'ACTION' // on http://code.google.com/p/googlemock/wiki/CookBook. // An internal macro needed for implementing ACTION*(). #define GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_\ const args_type& args GTEST_ATTRIBUTE_UNUSED_,\ arg0_type arg0 GTEST_ATTRIBUTE_UNUSED_,\ arg1_type arg1 GTEST_ATTRIBUTE_UNUSED_,\ arg2_type arg2 GTEST_ATTRIBUTE_UNUSED_,\ arg3_type arg3 GTEST_ATTRIBUTE_UNUSED_,\ arg4_type arg4 GTEST_ATTRIBUTE_UNUSED_,\ arg5_type arg5 GTEST_ATTRIBUTE_UNUSED_,\ arg6_type arg6 GTEST_ATTRIBUTE_UNUSED_,\ arg7_type arg7 GTEST_ATTRIBUTE_UNUSED_,\ arg8_type arg8 GTEST_ATTRIBUTE_UNUSED_,\ arg9_type arg9 GTEST_ATTRIBUTE_UNUSED_ // Sometimes you want to give an action explicit template parameters // that cannot be inferred from its value parameters. ACTION() and // ACTION_P*() don't support that. ACTION_TEMPLATE() remedies that // and can be viewed as an extension to ACTION() and ACTION_P*(). // // The syntax: // // ACTION_TEMPLATE(ActionName, // HAS_m_TEMPLATE_PARAMS(kind1, name1, ..., kind_m, name_m), // AND_n_VALUE_PARAMS(p1, ..., p_n)) { statements; } // // defines an action template that takes m explicit template // parameters and n value parameters. name_i is the name of the i-th // template parameter, and kind_i specifies whether it's a typename, // an integral constant, or a template. p_i is the name of the i-th // value parameter. // // Example: // // // DuplicateArg(output) converts the k-th argument of the mock // // function to type T and copies it to *output. // ACTION_TEMPLATE(DuplicateArg, // HAS_2_TEMPLATE_PARAMS(int, k, typename, T), // AND_1_VALUE_PARAMS(output)) { // *output = T(std::tr1::get(args)); // } // ... // int n; // EXPECT_CALL(mock, Foo(_, _)) // .WillOnce(DuplicateArg<1, unsigned char>(&n)); // // To create an instance of an action template, write: // // ActionName(v1, ..., v_n) // // where the ts are the template arguments and the vs are the value // arguments. The value argument types are inferred by the compiler. // If you want to explicitly specify the value argument types, you can // provide additional template arguments: // // ActionName(v1, ..., v_n) // // where u_i is the desired type of v_i. // // ACTION_TEMPLATE and ACTION/ACTION_P* can be overloaded on the // number of value parameters, but not on the number of template // parameters. Without the restriction, the meaning of the following // is unclear: // // OverloadedAction(x); // // Are we using a single-template-parameter action where 'bool' refers // to the type of x, or are we using a two-template-parameter action // where the compiler is asked to infer the type of x? // // Implementation notes: // // GMOCK_INTERNAL_*_HAS_m_TEMPLATE_PARAMS and // GMOCK_INTERNAL_*_AND_n_VALUE_PARAMS are internal macros for // implementing ACTION_TEMPLATE. The main trick we use is to create // new macro invocations when expanding a macro. For example, we have // // #define ACTION_TEMPLATE(name, template_params, value_params) // ... GMOCK_INTERNAL_DECL_##template_params ... // // which causes ACTION_TEMPLATE(..., HAS_1_TEMPLATE_PARAMS(typename, T), ...) // to expand to // // ... GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(typename, T) ... // // Since GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS is a macro, the // preprocessor will continue to expand it to // // ... typename T ... // // This technique conforms to the C++ standard and is portable. It // allows us to implement action templates using O(N) code, where N is // the maximum number of template/value parameters supported. Without // using it, we'd have to devote O(N^2) amount of code to implement all // combinations of m and n. // Declares the template parameters. #define GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(kind0, name0) kind0 name0 #define GMOCK_INTERNAL_DECL_HAS_2_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1) kind0 name0, kind1 name1 #define GMOCK_INTERNAL_DECL_HAS_3_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2) kind0 name0, kind1 name1, kind2 name2 #define GMOCK_INTERNAL_DECL_HAS_4_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3) kind0 name0, kind1 name1, kind2 name2, \ kind3 name3 #define GMOCK_INTERNAL_DECL_HAS_5_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4) kind0 name0, kind1 name1, \ kind2 name2, kind3 name3, kind4 name4 #define GMOCK_INTERNAL_DECL_HAS_6_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5) kind0 name0, \ kind1 name1, kind2 name2, kind3 name3, kind4 name4, kind5 name5 #define GMOCK_INTERNAL_DECL_HAS_7_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6) kind0 name0, kind1 name1, kind2 name2, kind3 name3, kind4 name4, \ kind5 name5, kind6 name6 #define GMOCK_INTERNAL_DECL_HAS_8_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7) kind0 name0, kind1 name1, kind2 name2, kind3 name3, \ kind4 name4, kind5 name5, kind6 name6, kind7 name7 #define GMOCK_INTERNAL_DECL_HAS_9_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7, kind8, name8) kind0 name0, kind1 name1, kind2 name2, \ kind3 name3, kind4 name4, kind5 name5, kind6 name6, kind7 name7, \ kind8 name8 #define GMOCK_INTERNAL_DECL_HAS_10_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1, kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6, kind7, name7, kind8, name8, kind9, name9) kind0 name0, \ kind1 name1, kind2 name2, kind3 name3, kind4 name4, kind5 name5, \ kind6 name6, kind7 name7, kind8 name8, kind9 name9 // Lists the template parameters. #define GMOCK_INTERNAL_LIST_HAS_1_TEMPLATE_PARAMS(kind0, name0) name0 #define GMOCK_INTERNAL_LIST_HAS_2_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1) name0, name1 #define GMOCK_INTERNAL_LIST_HAS_3_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2) name0, name1, name2 #define GMOCK_INTERNAL_LIST_HAS_4_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3) name0, name1, name2, name3 #define GMOCK_INTERNAL_LIST_HAS_5_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4) name0, name1, name2, name3, \ name4 #define GMOCK_INTERNAL_LIST_HAS_6_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5) name0, name1, \ name2, name3, name4, name5 #define GMOCK_INTERNAL_LIST_HAS_7_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6) name0, name1, name2, name3, name4, name5, name6 #define GMOCK_INTERNAL_LIST_HAS_8_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7) name0, name1, name2, name3, name4, name5, name6, name7 #define GMOCK_INTERNAL_LIST_HAS_9_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7, kind8, name8) name0, name1, name2, name3, name4, name5, \ name6, name7, name8 #define GMOCK_INTERNAL_LIST_HAS_10_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1, kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6, kind7, name7, kind8, name8, kind9, name9) name0, name1, name2, \ name3, name4, name5, name6, name7, name8, name9 // Declares the types of value parameters. #define GMOCK_INTERNAL_DECL_TYPE_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DECL_TYPE_AND_1_VALUE_PARAMS(p0) , typename p0##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_2_VALUE_PARAMS(p0, p1) , \ typename p0##_type, typename p1##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_3_VALUE_PARAMS(p0, p1, p2) , \ typename p0##_type, typename p1##_type, typename p2##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_4_VALUE_PARAMS(p0, p1, p2, p3) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type, typename p7##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type, typename p7##_type, typename p8##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9) , typename p0##_type, typename p1##_type, \ typename p2##_type, typename p3##_type, typename p4##_type, \ typename p5##_type, typename p6##_type, typename p7##_type, \ typename p8##_type, typename p9##_type // Initializes the value parameters. #define GMOCK_INTERNAL_INIT_AND_0_VALUE_PARAMS()\ () #define GMOCK_INTERNAL_INIT_AND_1_VALUE_PARAMS(p0)\ (p0##_type gmock_p0) : p0(gmock_p0) #define GMOCK_INTERNAL_INIT_AND_2_VALUE_PARAMS(p0, p1)\ (p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), p1(gmock_p1) #define GMOCK_INTERNAL_INIT_AND_3_VALUE_PARAMS(p0, p1, p2)\ (p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) #define GMOCK_INTERNAL_INIT_AND_4_VALUE_PARAMS(p0, p1, p2, p3)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3) #define GMOCK_INTERNAL_INIT_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4) #define GMOCK_INTERNAL_INIT_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) #define GMOCK_INTERNAL_INIT_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) #define GMOCK_INTERNAL_INIT_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) #define GMOCK_INTERNAL_INIT_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) #define GMOCK_INTERNAL_INIT_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8), p9(gmock_p9) // Declares the fields for storing the value parameters. #define GMOCK_INTERNAL_DEFN_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DEFN_AND_1_VALUE_PARAMS(p0) p0##_type p0; #define GMOCK_INTERNAL_DEFN_AND_2_VALUE_PARAMS(p0, p1) p0##_type p0; \ p1##_type p1; #define GMOCK_INTERNAL_DEFN_AND_3_VALUE_PARAMS(p0, p1, p2) p0##_type p0; \ p1##_type p1; p2##_type p2; #define GMOCK_INTERNAL_DEFN_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0##_type p0; \ p1##_type p1; p2##_type p2; p3##_type p3; #define GMOCK_INTERNAL_DEFN_AND_5_VALUE_PARAMS(p0, p1, p2, p3, \ p4) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; #define GMOCK_INTERNAL_DEFN_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, \ p5) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; #define GMOCK_INTERNAL_DEFN_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; p6##_type p6; #define GMOCK_INTERNAL_DEFN_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; p6##_type p6; p7##_type p7; #define GMOCK_INTERNAL_DEFN_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; \ p4##_type p4; p5##_type p5; p6##_type p6; p7##_type p7; p8##_type p8; #define GMOCK_INTERNAL_DEFN_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; \ p4##_type p4; p5##_type p5; p6##_type p6; p7##_type p7; p8##_type p8; \ p9##_type p9; // Lists the value parameters. #define GMOCK_INTERNAL_LIST_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_LIST_AND_1_VALUE_PARAMS(p0) p0 #define GMOCK_INTERNAL_LIST_AND_2_VALUE_PARAMS(p0, p1) p0, p1 #define GMOCK_INTERNAL_LIST_AND_3_VALUE_PARAMS(p0, p1, p2) p0, p1, p2 #define GMOCK_INTERNAL_LIST_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0, p1, p2, p3 #define GMOCK_INTERNAL_LIST_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) p0, p1, \ p2, p3, p4 #define GMOCK_INTERNAL_LIST_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) p0, \ p1, p2, p3, p4, p5 #define GMOCK_INTERNAL_LIST_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0, p1, p2, p3, p4, p5, p6 #define GMOCK_INTERNAL_LIST_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0, p1, p2, p3, p4, p5, p6, p7 #define GMOCK_INTERNAL_LIST_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0, p1, p2, p3, p4, p5, p6, p7, p8 #define GMOCK_INTERNAL_LIST_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0, p1, p2, p3, p4, p5, p6, p7, p8, p9 // Lists the value parameter types. #define GMOCK_INTERNAL_LIST_TYPE_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_LIST_TYPE_AND_1_VALUE_PARAMS(p0) , p0##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_2_VALUE_PARAMS(p0, p1) , p0##_type, \ p1##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_3_VALUE_PARAMS(p0, p1, p2) , p0##_type, \ p1##_type, p2##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_4_VALUE_PARAMS(p0, p1, p2, p3) , \ p0##_type, p1##_type, p2##_type, p3##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) , \ p0##_type, p1##_type, p2##_type, p3##_type, p4##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) , \ p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, p5##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, p5##_type, \ p6##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type, p8##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type, p8##_type, p9##_type // Declares the value parameters. #define GMOCK_INTERNAL_DECL_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DECL_AND_1_VALUE_PARAMS(p0) p0##_type p0 #define GMOCK_INTERNAL_DECL_AND_2_VALUE_PARAMS(p0, p1) p0##_type p0, \ p1##_type p1 #define GMOCK_INTERNAL_DECL_AND_3_VALUE_PARAMS(p0, p1, p2) p0##_type p0, \ p1##_type p1, p2##_type p2 #define GMOCK_INTERNAL_DECL_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3 #define GMOCK_INTERNAL_DECL_AND_5_VALUE_PARAMS(p0, p1, p2, p3, \ p4) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4 #define GMOCK_INTERNAL_DECL_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, \ p5) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5 #define GMOCK_INTERNAL_DECL_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5, p6##_type p6 #define GMOCK_INTERNAL_DECL_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5, p6##_type p6, p7##_type p7 #define GMOCK_INTERNAL_DECL_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8 #define GMOCK_INTERNAL_DECL_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9 // The suffix of the class template implementing the action template. #define GMOCK_INTERNAL_COUNT_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_COUNT_AND_1_VALUE_PARAMS(p0) P #define GMOCK_INTERNAL_COUNT_AND_2_VALUE_PARAMS(p0, p1) P2 #define GMOCK_INTERNAL_COUNT_AND_3_VALUE_PARAMS(p0, p1, p2) P3 #define GMOCK_INTERNAL_COUNT_AND_4_VALUE_PARAMS(p0, p1, p2, p3) P4 #define GMOCK_INTERNAL_COUNT_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) P5 #define GMOCK_INTERNAL_COUNT_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) P6 #define GMOCK_INTERNAL_COUNT_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6) P7 #define GMOCK_INTERNAL_COUNT_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) P8 #define GMOCK_INTERNAL_COUNT_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) P9 #define GMOCK_INTERNAL_COUNT_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) P10 // The name of the class template implementing the action template. #define GMOCK_ACTION_CLASS_(name, value_params)\ GTEST_CONCAT_TOKEN_(name##Action, GMOCK_INTERNAL_COUNT_##value_params) #define ACTION_TEMPLATE(name, template_params, value_params)\ template \ class GMOCK_ACTION_CLASS_(name, value_params) {\ public:\ GMOCK_ACTION_CLASS_(name, value_params)\ GMOCK_INTERNAL_INIT_##value_params {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ explicit gmock_Impl GMOCK_INTERNAL_INIT_##value_params {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(\ new gmock_Impl(GMOCK_INTERNAL_LIST_##value_params));\ }\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(GMOCK_ACTION_CLASS_(name, value_params));\ };\ template \ inline GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params> name(\ GMOCK_INTERNAL_DECL_##value_params) {\ return GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>(\ GMOCK_INTERNAL_LIST_##value_params);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>::gmock_Impl::\ gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION(name)\ class name##Action {\ public:\ name##Action() {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl() {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl());\ }\ private:\ GTEST_DISALLOW_ASSIGN_(name##Action);\ };\ inline name##Action name() {\ return name##Action();\ }\ template \ template \ typename ::testing::internal::Function::Result\ name##Action::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P(name, p0)\ template \ class name##ActionP {\ public:\ name##ActionP(p0##_type gmock_p0) : p0(gmock_p0) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ explicit gmock_Impl(p0##_type gmock_p0) : p0(gmock_p0) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0));\ }\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP);\ };\ template \ inline name##ActionP name(p0##_type p0) {\ return name##ActionP(p0);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P2(name, p0, p1)\ template \ class name##ActionP2 {\ public:\ name##ActionP2(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1));\ }\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP2);\ };\ template \ inline name##ActionP2 name(p0##_type p0, \ p1##_type p1) {\ return name##ActionP2(p0, p1);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP2::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P3(name, p0, p1, p2)\ template \ class name##ActionP3 {\ public:\ name##ActionP3(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP3);\ };\ template \ inline name##ActionP3 name(p0##_type p0, \ p1##_type p1, p2##_type p2) {\ return name##ActionP3(p0, p1, p2);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP3::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P4(name, p0, p1, p2, p3)\ template \ class name##ActionP4 {\ public:\ name##ActionP4(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP4);\ };\ template \ inline name##ActionP4 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3) {\ return name##ActionP4(p0, p1, \ p2, p3);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP4::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P5(name, p0, p1, p2, p3, p4)\ template \ class name##ActionP5 {\ public:\ name##ActionP5(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, \ p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4) : p0(gmock_p0), \ p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP5);\ };\ template \ inline name##ActionP5 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4) {\ return name##ActionP5(p0, p1, p2, p3, p4);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP5::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P6(name, p0, p1, p2, p3, p4, p5)\ template \ class name##ActionP6 {\ public:\ name##ActionP6(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP6);\ };\ template \ inline name##ActionP6 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3, p4##_type p4, p5##_type p5) {\ return name##ActionP6(p0, p1, p2, p3, p4, p5);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP6::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P7(name, p0, p1, p2, p3, p4, p5, p6)\ template \ class name##ActionP7 {\ public:\ name##ActionP7(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), \ p6(gmock_p6) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP7);\ };\ template \ inline name##ActionP7 name(p0##_type p0, p1##_type p1, \ p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6) {\ return name##ActionP7(p0, p1, p2, p3, p4, p5, p6);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP7::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P8(name, p0, p1, p2, p3, p4, p5, p6, p7)\ template \ class name##ActionP8 {\ public:\ name##ActionP8(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, \ p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7) : p0(gmock_p0), \ p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), \ p5(gmock_p5), p6(gmock_p6), p7(gmock_p7) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP8);\ };\ template \ inline name##ActionP8 name(p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6, p7##_type p7) {\ return name##ActionP8(p0, p1, p2, p3, p4, p5, \ p6, p7);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP8::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P9(name, p0, p1, p2, p3, p4, p5, p6, p7, p8)\ template \ class name##ActionP9 {\ public:\ name##ActionP9(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7, p8));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP9);\ };\ template \ inline name##ActionP9 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, \ p8##_type p8) {\ return name##ActionP9(p0, p1, p2, \ p3, p4, p5, p6, p7, p8);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP9::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P10(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)\ template \ class name##ActionP10 {\ public:\ name##ActionP10(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8, p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP10);\ };\ template \ inline name##ActionP10 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9) {\ return name##ActionP10(p0, \ p1, p2, p3, p4, p5, p6, p7, p8, p9);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP10::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const // TODO(wan@google.com): move the following to a different .h file // such that we don't have to run 'pump' every time the code is // updated. namespace testing { // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Various overloads for InvokeArgument(). // // The InvokeArgument(a1, a2, ..., a_k) action invokes the N-th // (0-based) argument, which must be a k-ary callable, of the mock // function, with arguments a1, a2, ..., a_k. // // Notes: // // 1. The arguments are passed by value by default. If you need to // pass an argument by reference, wrap it inside ByRef(). For // example, // // InvokeArgument<1>(5, string("Hello"), ByRef(foo)) // // passes 5 and string("Hello") by value, and passes foo by // reference. // // 2. If the callable takes an argument by reference but ByRef() is // not used, it will receive the reference to a copy of the value, // instead of the original value. For example, when the 0-th // argument of the mock function takes a const string&, the action // // InvokeArgument<0>(string("Hello")) // // makes a copy of the temporary string("Hello") object and passes a // reference of the copy, instead of the original temporary object, // to the callable. This makes it easy for a user to define an // InvokeArgument action from temporary values and have it performed // later. ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { return internal::CallableHelper::Call( ::std::tr1::get(args)); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(p0)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_2_VALUE_PARAMS(p0, p1)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_3_VALUE_PARAMS(p0, p1, p2)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_4_VALUE_PARAMS(p0, p1, p2, p3)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7, p8); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); } // Various overloads for ReturnNew(). // // The ReturnNew(a1, a2, ..., a_k) action returns a pointer to a new // instance of type T, constructed on the heap with constructor arguments // a1, a2, ..., and a_k. The caller assumes ownership of the returned value. ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_0_VALUE_PARAMS()) { return new T(); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_1_VALUE_PARAMS(p0)) { return new T(p0); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_2_VALUE_PARAMS(p0, p1)) { return new T(p0, p1); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_3_VALUE_PARAMS(p0, p1, p2)) { return new T(p0, p1, p2); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_4_VALUE_PARAMS(p0, p1, p2, p3)) { return new T(p0, p1, p2, p3); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)) { return new T(p0, p1, p2, p3, p4); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)) { return new T(p0, p1, p2, p3, p4, p5); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)) { return new T(p0, p1, p2, p3, p4, p5, p6); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7, p8); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); } #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ // This file was GENERATED by command: // pump.py gmock-generated-function-mockers.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements function mockers of various arities. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements the ON_CALL() and EXPECT_CALL() macros. // // A user can use the ON_CALL() macro to specify the default action of // a mock method. The syntax is: // // ON_CALL(mock_object, Method(argument-matchers)) // .With(multi-argument-matcher) // .WillByDefault(action); // // where the .With() clause is optional. // // A user can use the EXPECT_CALL() macro to specify an expectation on // a mock method. The syntax is: // // EXPECT_CALL(mock_object, Method(argument-matchers)) // .With(multi-argument-matchers) // .Times(cardinality) // .InSequence(sequences) // .After(expectations) // .WillOnce(action) // .WillRepeatedly(action) // .RetiresOnSaturation(); // // where all clauses are optional, and .InSequence()/.After()/ // .WillOnce() can appear any number of times. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ #include #include #include #include #include // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used argument matchers. More // matchers can be defined by the user implementing the // MatcherInterface interface if necessary. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ #include #include #include // NOLINT #include #include #include #include namespace testing { // To implement a matcher Foo for type T, define: // 1. a class FooMatcherImpl that implements the // MatcherInterface interface, and // 2. a factory function that creates a Matcher object from a // FooMatcherImpl*. // // The two-level delegation design makes it possible to allow a user // to write "v" instead of "Eq(v)" where a Matcher is expected, which // is impossible if we pass matchers by pointers. It also eases // ownership management as Matcher objects can now be copied like // plain values. // MatchResultListener is an abstract class. Its << operator can be // used by a matcher to explain why a value matches or doesn't match. // // TODO(wan@google.com): add method // bool InterestedInWhy(bool result) const; // to indicate whether the listener is interested in why the match // result is 'result'. class MatchResultListener { public: // Creates a listener object with the given underlying ostream. The // listener does not own the ostream. explicit MatchResultListener(::std::ostream* os) : stream_(os) {} virtual ~MatchResultListener() = 0; // Makes this class abstract. // Streams x to the underlying ostream; does nothing if the ostream // is NULL. template MatchResultListener& operator<<(const T& x) { if (stream_ != NULL) *stream_ << x; return *this; } // Returns the underlying ostream. ::std::ostream* stream() { return stream_; } // Returns true iff the listener is interested in an explanation of // the match result. A matcher's MatchAndExplain() method can use // this information to avoid generating the explanation when no one // intends to hear it. bool IsInterested() const { return stream_ != NULL; } private: ::std::ostream* const stream_; GTEST_DISALLOW_COPY_AND_ASSIGN_(MatchResultListener); }; inline MatchResultListener::~MatchResultListener() { } // The implementation of a matcher. template class MatcherInterface { public: virtual ~MatcherInterface() {} // Returns true iff the matcher matches x; also explains the match // result to 'listener', in the form of a non-restrictive relative // clause ("which ...", "whose ...", etc) that describes x. For // example, the MatchAndExplain() method of the Pointee(...) matcher // should generate an explanation like "which points to ...". // // You should override this method when defining a new matcher. // // It's the responsibility of the caller (Google Mock) to guarantee // that 'listener' is not NULL. This helps to simplify a matcher's // implementation when it doesn't care about the performance, as it // can talk to 'listener' without checking its validity first. // However, in order to implement dummy listeners efficiently, // listener->stream() may be NULL. virtual bool MatchAndExplain(T x, MatchResultListener* listener) const = 0; // Describes this matcher to an ostream. The function should print // a verb phrase that describes the property a value matching this // matcher should have. The subject of the verb phrase is the value // being matched. For example, the DescribeTo() method of the Gt(7) // matcher prints "is greater than 7". virtual void DescribeTo(::std::ostream* os) const = 0; // Describes the negation of this matcher to an ostream. For // example, if the description of this matcher is "is greater than // 7", the negated description could be "is not greater than 7". // You are not required to override this when implementing // MatcherInterface, but it is highly advised so that your matcher // can produce good error messages. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "not ("; DescribeTo(os); *os << ")"; } }; namespace internal { // A match result listener that ignores the explanation. class DummyMatchResultListener : public MatchResultListener { public: DummyMatchResultListener() : MatchResultListener(NULL) {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(DummyMatchResultListener); }; // A match result listener that forwards the explanation to a given // ostream. The difference between this and MatchResultListener is // that the former is concrete. class StreamMatchResultListener : public MatchResultListener { public: explicit StreamMatchResultListener(::std::ostream* os) : MatchResultListener(os) {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamMatchResultListener); }; // A match result listener that stores the explanation in a string. class StringMatchResultListener : public MatchResultListener { public: StringMatchResultListener() : MatchResultListener(&ss_) {} // Returns the explanation heard so far. internal::string str() const { return ss_.str(); } private: ::std::stringstream ss_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StringMatchResultListener); }; // An internal class for implementing Matcher, which will derive // from it. We put functionalities common to all Matcher // specializations here to avoid code duplication. template class MatcherBase { public: // Returns true iff the matcher matches x; also explains the match // result to 'listener'. bool MatchAndExplain(T x, MatchResultListener* listener) const { return impl_->MatchAndExplain(x, listener); } // Returns true iff this matcher matches x. bool Matches(T x) const { DummyMatchResultListener dummy; return MatchAndExplain(x, &dummy); } // Describes this matcher to an ostream. void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); } // Describes the negation of this matcher to an ostream. void DescribeNegationTo(::std::ostream* os) const { impl_->DescribeNegationTo(os); } // Explains why x matches, or doesn't match, the matcher. void ExplainMatchResultTo(T x, ::std::ostream* os) const { StreamMatchResultListener listener(os); MatchAndExplain(x, &listener); } protected: MatcherBase() {} // Constructs a matcher from its implementation. explicit MatcherBase(const MatcherInterface* impl) : impl_(impl) {} virtual ~MatcherBase() {} private: // shared_ptr (util/gtl/shared_ptr.h) and linked_ptr have similar // interfaces. The former dynamically allocates a chunk of memory // to hold the reference count, while the latter tracks all // references using a circular linked list without allocating // memory. It has been observed that linked_ptr performs better in // typical scenarios. However, shared_ptr can out-perform // linked_ptr when there are many more uses of the copy constructor // than the default constructor. // // If performance becomes a problem, we should see if using // shared_ptr helps. ::testing::internal::linked_ptr > impl_; }; } // namespace internal // A Matcher is a copyable and IMMUTABLE (except by assignment) // object that can check whether a value of type T matches. The // implementation of Matcher is just a linked_ptr to const // MatcherInterface, so copying is fairly cheap. Don't inherit // from Matcher! template class Matcher : public internal::MatcherBase { public: // Constructs a null matcher. Needed for storing Matcher objects in STL // containers. A default-constructed matcher is not yet initialized. You // cannot use it until a valid value has been assigned to it. Matcher() {} // Constructs a matcher from its implementation. explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Implicit constructor here allows people to write // EXPECT_CALL(foo, Bar(5)) instead of EXPECT_CALL(foo, Bar(Eq(5))) sometimes Matcher(T value); // NOLINT }; // The following two specializations allow the user to write str // instead of Eq(str) and "foo" instead of Eq("foo") when a string // matcher is expected. template <> class Matcher : public internal::MatcherBase { public: Matcher() {} explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Allows the user to write str instead of Eq(str) sometimes, where // str is a string object. Matcher(const internal::string& s); // NOLINT // Allows the user to write "foo" instead of Eq("foo") sometimes. Matcher(const char* s); // NOLINT }; template <> class Matcher : public internal::MatcherBase { public: Matcher() {} explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Allows the user to write str instead of Eq(str) sometimes, where // str is a string object. Matcher(const internal::string& s); // NOLINT // Allows the user to write "foo" instead of Eq("foo") sometimes. Matcher(const char* s); // NOLINT }; // The PolymorphicMatcher class template makes it easy to implement a // polymorphic matcher (i.e. a matcher that can match values of more // than one type, e.g. Eq(n) and NotNull()). // // To define a polymorphic matcher, a user should provide an Impl // class that has a DescribeTo() method and a DescribeNegationTo() // method, and define a member function (or member function template) // // bool MatchAndExplain(const Value& value, // MatchResultListener* listener) const; // // See the definition of NotNull() for a complete example. template class PolymorphicMatcher { public: explicit PolymorphicMatcher(const Impl& an_impl) : impl_(an_impl) {} // Returns a mutable reference to the underlying matcher // implementation object. Impl& mutable_impl() { return impl_; } // Returns an immutable reference to the underlying matcher // implementation object. const Impl& impl() const { return impl_; } template operator Matcher() const { return Matcher(new MonomorphicImpl(impl_)); } private: template class MonomorphicImpl : public MatcherInterface { public: explicit MonomorphicImpl(const Impl& impl) : impl_(impl) {} virtual void DescribeTo(::std::ostream* os) const { impl_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { impl_.DescribeNegationTo(os); } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return impl_.MatchAndExplain(x, listener); } private: const Impl impl_; GTEST_DISALLOW_ASSIGN_(MonomorphicImpl); }; Impl impl_; GTEST_DISALLOW_ASSIGN_(PolymorphicMatcher); }; // Creates a matcher from its implementation. This is easier to use // than the Matcher constructor as it doesn't require you to // explicitly write the template argument, e.g. // // MakeMatcher(foo); // vs // Matcher(foo); template inline Matcher MakeMatcher(const MatcherInterface* impl) { return Matcher(impl); }; // Creates a polymorphic matcher from its implementation. This is // easier to use than the PolymorphicMatcher constructor as it // doesn't require you to explicitly write the template argument, e.g. // // MakePolymorphicMatcher(foo); // vs // PolymorphicMatcher(foo); template inline PolymorphicMatcher MakePolymorphicMatcher(const Impl& impl) { return PolymorphicMatcher(impl); } // In order to be safe and clear, casting between different matcher // types is done explicitly via MatcherCast(m), which takes a // matcher m and returns a Matcher. It compiles only when T can be // statically converted to the argument type of m. template Matcher MatcherCast(M m); // Implements SafeMatcherCast(). // // We use an intermediate class to do the actual safe casting as Nokia's // Symbian compiler cannot decide between // template ... (M) and // template ... (const Matcher&) // for function templates but can for member function templates. template class SafeMatcherCastImpl { public: // This overload handles polymorphic matchers only since monomorphic // matchers are handled by the next one. template static inline Matcher Cast(M polymorphic_matcher) { return Matcher(polymorphic_matcher); } // This overload handles monomorphic matchers. // // In general, if type T can be implicitly converted to type U, we can // safely convert a Matcher to a Matcher (i.e. Matcher is // contravariant): just keep a copy of the original Matcher, convert the // argument from type T to U, and then pass it to the underlying Matcher. // The only exception is when U is a reference and T is not, as the // underlying Matcher may be interested in the argument's address, which // is not preserved in the conversion from T to U. template static inline Matcher Cast(const Matcher& matcher) { // Enforce that T can be implicitly converted to U. GTEST_COMPILE_ASSERT_((internal::ImplicitlyConvertible::value), T_must_be_implicitly_convertible_to_U); // Enforce that we are not converting a non-reference type T to a reference // type U. GTEST_COMPILE_ASSERT_( internal::is_reference::value || !internal::is_reference::value, cannot_convert_non_referentce_arg_to_reference); // In case both T and U are arithmetic types, enforce that the // conversion is not lossy. typedef GTEST_REMOVE_REFERENCE_AND_CONST_(T) RawT; typedef GTEST_REMOVE_REFERENCE_AND_CONST_(U) RawU; const bool kTIsOther = GMOCK_KIND_OF_(RawT) == internal::kOther; const bool kUIsOther = GMOCK_KIND_OF_(RawU) == internal::kOther; GTEST_COMPILE_ASSERT_( kTIsOther || kUIsOther || (internal::LosslessArithmeticConvertible::value), conversion_of_arithmetic_types_must_be_lossless); return MatcherCast(matcher); } }; template inline Matcher SafeMatcherCast(const M& polymorphic_matcher) { return SafeMatcherCastImpl::Cast(polymorphic_matcher); } // A() returns a matcher that matches any value of type T. template Matcher A(); // Anything inside the 'internal' namespace IS INTERNAL IMPLEMENTATION // and MUST NOT BE USED IN USER CODE!!! namespace internal { // If the explanation is not empty, prints it to the ostream. inline void PrintIfNotEmpty(const internal::string& explanation, std::ostream* os) { if (explanation != "" && os != NULL) { *os << ", " << explanation; } } // Returns true if the given type name is easy to read by a human. // This is used to decide whether printing the type of a value might // be helpful. inline bool IsReadableTypeName(const string& type_name) { // We consider a type name readable if it's short or doesn't contain // a template or function type. return (type_name.length() <= 20 || type_name.find_first_of("<(") == string::npos); } // Matches the value against the given matcher, prints the value and explains // the match result to the listener. Returns the match result. // 'listener' must not be NULL. // Value cannot be passed by const reference, because some matchers take a // non-const argument. template bool MatchPrintAndExplain(Value& value, const Matcher& matcher, MatchResultListener* listener) { if (!listener->IsInterested()) { // If the listener is not interested, we do not need to construct the // inner explanation. return matcher.Matches(value); } StringMatchResultListener inner_listener; const bool match = matcher.MatchAndExplain(value, &inner_listener); UniversalPrint(value, listener->stream()); #if GTEST_HAS_RTTI const string& type_name = GetTypeName(); if (IsReadableTypeName(type_name)) *listener->stream() << " (of type " << type_name << ")"; #endif PrintIfNotEmpty(inner_listener.str(), listener->stream()); return match; } // An internal helper class for doing compile-time loop on a tuple's // fields. template class TuplePrefix { public: // TuplePrefix::Matches(matcher_tuple, value_tuple) returns true // iff the first N fields of matcher_tuple matches the first N // fields of value_tuple, respectively. template static bool Matches(const MatcherTuple& matcher_tuple, const ValueTuple& value_tuple) { using ::std::tr1::get; return TuplePrefix::Matches(matcher_tuple, value_tuple) && get(matcher_tuple).Matches(get(value_tuple)); } // TuplePrefix::ExplainMatchFailuresTo(matchers, values, os) // describes failures in matching the first N fields of matchers // against the first N fields of values. If there is no failure, // nothing will be streamed to os. template static void ExplainMatchFailuresTo(const MatcherTuple& matchers, const ValueTuple& values, ::std::ostream* os) { using ::std::tr1::tuple_element; using ::std::tr1::get; // First, describes failures in the first N - 1 fields. TuplePrefix::ExplainMatchFailuresTo(matchers, values, os); // Then describes the failure (if any) in the (N - 1)-th (0-based) // field. typename tuple_element::type matcher = get(matchers); typedef typename tuple_element::type Value; Value value = get(values); StringMatchResultListener listener; if (!matcher.MatchAndExplain(value, &listener)) { // TODO(wan): include in the message the name of the parameter // as used in MOCK_METHOD*() when possible. *os << " Expected arg #" << N - 1 << ": "; get(matchers).DescribeTo(os); *os << "\n Actual: "; // We remove the reference in type Value to prevent the // universal printer from printing the address of value, which // isn't interesting to the user most of the time. The // matcher's MatchAndExplain() method handles the case when // the address is interesting. internal::UniversalPrint(value, os); PrintIfNotEmpty(listener.str(), os); *os << "\n"; } } }; // The base case. template <> class TuplePrefix<0> { public: template static bool Matches(const MatcherTuple& /* matcher_tuple */, const ValueTuple& /* value_tuple */) { return true; } template static void ExplainMatchFailuresTo(const MatcherTuple& /* matchers */, const ValueTuple& /* values */, ::std::ostream* /* os */) {} }; // TupleMatches(matcher_tuple, value_tuple) returns true iff all // matchers in matcher_tuple match the corresponding fields in // value_tuple. It is a compiler error if matcher_tuple and // value_tuple have different number of fields or incompatible field // types. template bool TupleMatches(const MatcherTuple& matcher_tuple, const ValueTuple& value_tuple) { using ::std::tr1::tuple_size; // Makes sure that matcher_tuple and value_tuple have the same // number of fields. GTEST_COMPILE_ASSERT_(tuple_size::value == tuple_size::value, matcher_and_value_have_different_numbers_of_fields); return TuplePrefix::value>:: Matches(matcher_tuple, value_tuple); } // Describes failures in matching matchers against values. If there // is no failure, nothing will be streamed to os. template void ExplainMatchFailureTupleTo(const MatcherTuple& matchers, const ValueTuple& values, ::std::ostream* os) { using ::std::tr1::tuple_size; TuplePrefix::value>::ExplainMatchFailuresTo( matchers, values, os); } // The MatcherCastImpl class template is a helper for implementing // MatcherCast(). We need this helper in order to partially // specialize the implementation of MatcherCast() (C++ allows // class/struct templates to be partially specialized, but not // function templates.). // This general version is used when MatcherCast()'s argument is a // polymorphic matcher (i.e. something that can be converted to a // Matcher but is not one yet; for example, Eq(value)). template class MatcherCastImpl { public: static Matcher Cast(M polymorphic_matcher) { return Matcher(polymorphic_matcher); } }; // This more specialized version is used when MatcherCast()'s argument // is already a Matcher. This only compiles when type T can be // statically converted to type U. template class MatcherCastImpl > { public: static Matcher Cast(const Matcher& source_matcher) { return Matcher(new Impl(source_matcher)); } private: class Impl : public MatcherInterface { public: explicit Impl(const Matcher& source_matcher) : source_matcher_(source_matcher) {} // We delegate the matching logic to the source matcher. virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return source_matcher_.MatchAndExplain(static_cast(x), listener); } virtual void DescribeTo(::std::ostream* os) const { source_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { source_matcher_.DescribeNegationTo(os); } private: const Matcher source_matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; }; // This even more specialized version is used for efficiently casting // a matcher to its own type. template class MatcherCastImpl > { public: static Matcher Cast(const Matcher& matcher) { return matcher; } }; // Implements A(). template class AnyMatcherImpl : public MatcherInterface { public: virtual bool MatchAndExplain( T /* x */, MatchResultListener* /* listener */) const { return true; } virtual void DescribeTo(::std::ostream* os) const { *os << "is anything"; } virtual void DescribeNegationTo(::std::ostream* os) const { // This is mostly for completeness' safe, as it's not very useful // to write Not(A()). However we cannot completely rule out // such a possibility, and it doesn't hurt to be prepared. *os << "never matches"; } }; // Implements _, a matcher that matches any value of any // type. This is a polymorphic matcher, so we need a template type // conversion operator to make it appearing as a Matcher for any // type T. class AnythingMatcher { public: template operator Matcher() const { return A(); } }; // Implements a matcher that compares a given value with a // pre-supplied value using one of the ==, <=, <, etc, operators. The // two values being compared don't have to have the same type. // // The matcher defined here is polymorphic (for example, Eq(5) can be // used to match an int, a short, a double, etc). Therefore we use // a template type conversion operator in the implementation. // // We define this as a macro in order to eliminate duplicated source // code. // // The following template definition assumes that the Rhs parameter is // a "bare" type (i.e. neither 'const T' nor 'T&'). #define GMOCK_IMPLEMENT_COMPARISON_MATCHER_( \ name, op, relation, negated_relation) \ template class name##Matcher { \ public: \ explicit name##Matcher(const Rhs& rhs) : rhs_(rhs) {} \ template \ operator Matcher() const { \ return MakeMatcher(new Impl(rhs_)); \ } \ private: \ template \ class Impl : public MatcherInterface { \ public: \ explicit Impl(const Rhs& rhs) : rhs_(rhs) {} \ virtual bool MatchAndExplain(\ Lhs lhs, MatchResultListener* /* listener */) const { \ return lhs op rhs_; \ } \ virtual void DescribeTo(::std::ostream* os) const { \ *os << relation " "; \ UniversalPrint(rhs_, os); \ } \ virtual void DescribeNegationTo(::std::ostream* os) const { \ *os << negated_relation " "; \ UniversalPrint(rhs_, os); \ } \ private: \ Rhs rhs_; \ GTEST_DISALLOW_ASSIGN_(Impl); \ }; \ Rhs rhs_; \ GTEST_DISALLOW_ASSIGN_(name##Matcher); \ } // Implements Eq(v), Ge(v), Gt(v), Le(v), Lt(v), and Ne(v) // respectively. GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Eq, ==, "is equal to", "isn't equal to"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Ge, >=, "is >=", "isn't >="); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Gt, >, "is >", "isn't >"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Le, <=, "is <=", "isn't <="); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Lt, <, "is <", "isn't <"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Ne, !=, "isn't equal to", "is equal to"); #undef GMOCK_IMPLEMENT_COMPARISON_MATCHER_ // Implements the polymorphic IsNull() matcher, which matches any raw or smart // pointer that is NULL. class IsNullMatcher { public: template bool MatchAndExplain(const Pointer& p, MatchResultListener* /* listener */) const { return GetRawPointer(p) == NULL; } void DescribeTo(::std::ostream* os) const { *os << "is NULL"; } void DescribeNegationTo(::std::ostream* os) const { *os << "isn't NULL"; } }; // Implements the polymorphic NotNull() matcher, which matches any raw or smart // pointer that is not NULL. class NotNullMatcher { public: template bool MatchAndExplain(const Pointer& p, MatchResultListener* /* listener */) const { return GetRawPointer(p) != NULL; } void DescribeTo(::std::ostream* os) const { *os << "isn't NULL"; } void DescribeNegationTo(::std::ostream* os) const { *os << "is NULL"; } }; // Ref(variable) matches any argument that is a reference to // 'variable'. This matcher is polymorphic as it can match any // super type of the type of 'variable'. // // The RefMatcher template class implements Ref(variable). It can // only be instantiated with a reference type. This prevents a user // from mistakenly using Ref(x) to match a non-reference function // argument. For example, the following will righteously cause a // compiler error: // // int n; // Matcher m1 = Ref(n); // This won't compile. // Matcher m2 = Ref(n); // This will compile. template class RefMatcher; template class RefMatcher { // Google Mock is a generic framework and thus needs to support // mocking any function types, including those that take non-const // reference arguments. Therefore the template parameter T (and // Super below) can be instantiated to either a const type or a // non-const type. public: // RefMatcher() takes a T& instead of const T&, as we want the // compiler to catch using Ref(const_value) as a matcher for a // non-const reference. explicit RefMatcher(T& x) : object_(x) {} // NOLINT template operator Matcher() const { // By passing object_ (type T&) to Impl(), which expects a Super&, // we make sure that Super is a super type of T. In particular, // this catches using Ref(const_value) as a matcher for a // non-const reference, as you cannot implicitly convert a const // reference to a non-const reference. return MakeMatcher(new Impl(object_)); } private: template class Impl : public MatcherInterface { public: explicit Impl(Super& x) : object_(x) {} // NOLINT // MatchAndExplain() takes a Super& (as opposed to const Super&) // in order to match the interface MatcherInterface. virtual bool MatchAndExplain( Super& x, MatchResultListener* listener) const { *listener << "which is located @" << static_cast(&x); return &x == &object_; } virtual void DescribeTo(::std::ostream* os) const { *os << "references the variable "; UniversalPrinter::Print(object_, os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "does not reference the variable "; UniversalPrinter::Print(object_, os); } private: const Super& object_; GTEST_DISALLOW_ASSIGN_(Impl); }; T& object_; GTEST_DISALLOW_ASSIGN_(RefMatcher); }; // Polymorphic helper functions for narrow and wide string matchers. inline bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs) { return String::CaseInsensitiveCStringEquals(lhs, rhs); } inline bool CaseInsensitiveCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { return String::CaseInsensitiveWideCStringEquals(lhs, rhs); } // String comparison for narrow or wide strings that can have embedded NUL // characters. template bool CaseInsensitiveStringEquals(const StringType& s1, const StringType& s2) { // Are the heads equal? if (!CaseInsensitiveCStringEquals(s1.c_str(), s2.c_str())) { return false; } // Skip the equal heads. const typename StringType::value_type nul = 0; const size_t i1 = s1.find(nul), i2 = s2.find(nul); // Are we at the end of either s1 or s2? if (i1 == StringType::npos || i2 == StringType::npos) { return i1 == i2; } // Are the tails equal? return CaseInsensitiveStringEquals(s1.substr(i1 + 1), s2.substr(i2 + 1)); } // String matchers. // Implements equality-based string matchers like StrEq, StrCaseNe, and etc. template class StrEqualityMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; StrEqualityMatcher(const StringType& str, bool expect_eq, bool case_sensitive) : string_(str), expect_eq_(expect_eq), case_sensitive_(case_sensitive) {} // When expect_eq_ is true, returns true iff s is equal to string_; // otherwise returns true iff s is not equal to string_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { if (s == NULL) { return !expect_eq_; } return MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { const bool eq = case_sensitive_ ? s == string_ : CaseInsensitiveStringEquals(s, string_); return expect_eq_ == eq; } void DescribeTo(::std::ostream* os) const { DescribeToHelper(expect_eq_, os); } void DescribeNegationTo(::std::ostream* os) const { DescribeToHelper(!expect_eq_, os); } private: void DescribeToHelper(bool expect_eq, ::std::ostream* os) const { *os << (expect_eq ? "is " : "isn't "); *os << "equal to "; if (!case_sensitive_) { *os << "(ignoring case) "; } UniversalPrint(string_, os); } const StringType string_; const bool expect_eq_; const bool case_sensitive_; GTEST_DISALLOW_ASSIGN_(StrEqualityMatcher); }; // Implements the polymorphic HasSubstr(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class HasSubstrMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit HasSubstrMatcher(const StringType& substring) : substring_(substring) {} // These overloaded methods allow HasSubstr(substring) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s contains substring_ as a substring. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.find(substring_) != StringType::npos; } // Describes what this matcher matches. void DescribeTo(::std::ostream* os) const { *os << "has substring "; UniversalPrint(substring_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "has no substring "; UniversalPrint(substring_, os); } private: const StringType substring_; GTEST_DISALLOW_ASSIGN_(HasSubstrMatcher); }; // Implements the polymorphic StartsWith(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class StartsWithMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit StartsWithMatcher(const StringType& prefix) : prefix_(prefix) { } // These overloaded methods allow StartsWith(prefix) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s starts with prefix_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.length() >= prefix_.length() && s.substr(0, prefix_.length()) == prefix_; } void DescribeTo(::std::ostream* os) const { *os << "starts with "; UniversalPrint(prefix_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't start with "; UniversalPrint(prefix_, os); } private: const StringType prefix_; GTEST_DISALLOW_ASSIGN_(StartsWithMatcher); }; // Implements the polymorphic EndsWith(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class EndsWithMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit EndsWithMatcher(const StringType& suffix) : suffix_(suffix) {} // These overloaded methods allow EndsWith(suffix) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s ends with suffix_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.length() >= suffix_.length() && s.substr(s.length() - suffix_.length()) == suffix_; } void DescribeTo(::std::ostream* os) const { *os << "ends with "; UniversalPrint(suffix_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't end with "; UniversalPrint(suffix_, os); } private: const StringType suffix_; GTEST_DISALLOW_ASSIGN_(EndsWithMatcher); }; // Implements polymorphic matchers MatchesRegex(regex) and // ContainsRegex(regex), which can be used as a Matcher as long as // T can be converted to a string. class MatchesRegexMatcher { public: MatchesRegexMatcher(const RE* regex, bool full_match) : regex_(regex), full_match_(full_match) {} // These overloaded methods allow MatchesRegex(regex) to be used as // a Matcher as long as T can be converted to string. Returns // true iff s matches regular expression regex. When full_match_ is // true, a full match is done; otherwise a partial match is done. bool MatchAndExplain(const char* s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(internal::string(s), listener); } bool MatchAndExplain(const internal::string& s, MatchResultListener* /* listener */) const { return full_match_ ? RE::FullMatch(s, *regex_) : RE::PartialMatch(s, *regex_); } void DescribeTo(::std::ostream* os) const { *os << (full_match_ ? "matches" : "contains") << " regular expression "; UniversalPrinter::Print(regex_->pattern(), os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't " << (full_match_ ? "match" : "contain") << " regular expression "; UniversalPrinter::Print(regex_->pattern(), os); } private: const internal::linked_ptr regex_; const bool full_match_; GTEST_DISALLOW_ASSIGN_(MatchesRegexMatcher); }; // Implements a matcher that compares the two fields of a 2-tuple // using one of the ==, <=, <, etc, operators. The two fields being // compared don't have to have the same type. // // The matcher defined here is polymorphic (for example, Eq() can be // used to match a tuple, a tuple, // etc). Therefore we use a template type conversion operator in the // implementation. // // We define this as a macro in order to eliminate duplicated source // code. #define GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(name, op, relation) \ class name##2Matcher { \ public: \ template \ operator Matcher< ::std::tr1::tuple >() const { \ return MakeMatcher(new Impl< ::std::tr1::tuple >); \ } \ template \ operator Matcher&>() const { \ return MakeMatcher(new Impl&>); \ } \ private: \ template \ class Impl : public MatcherInterface { \ public: \ virtual bool MatchAndExplain( \ Tuple args, \ MatchResultListener* /* listener */) const { \ return ::std::tr1::get<0>(args) op ::std::tr1::get<1>(args); \ } \ virtual void DescribeTo(::std::ostream* os) const { \ *os << "are " relation; \ } \ virtual void DescribeNegationTo(::std::ostream* os) const { \ *os << "aren't " relation; \ } \ }; \ } // Implements Eq(), Ge(), Gt(), Le(), Lt(), and Ne() respectively. GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(Eq, ==, "an equal pair"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Ge, >=, "a pair where the first >= the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Gt, >, "a pair where the first > the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Le, <=, "a pair where the first <= the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Lt, <, "a pair where the first < the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(Ne, !=, "an unequal pair"); #undef GMOCK_IMPLEMENT_COMPARISON2_MATCHER_ // Implements the Not(...) matcher for a particular argument type T. // We do not nest it inside the NotMatcher class template, as that // will prevent different instantiations of NotMatcher from sharing // the same NotMatcherImpl class. template class NotMatcherImpl : public MatcherInterface { public: explicit NotMatcherImpl(const Matcher& matcher) : matcher_(matcher) {} virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return !matcher_.MatchAndExplain(x, listener); } virtual void DescribeTo(::std::ostream* os) const { matcher_.DescribeNegationTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { matcher_.DescribeTo(os); } private: const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(NotMatcherImpl); }; // Implements the Not(m) matcher, which matches a value that doesn't // match matcher m. template class NotMatcher { public: explicit NotMatcher(InnerMatcher matcher) : matcher_(matcher) {} // This template type conversion operator allows Not(m) to be used // to match any type m can match. template operator Matcher() const { return Matcher(new NotMatcherImpl(SafeMatcherCast(matcher_))); } private: InnerMatcher matcher_; GTEST_DISALLOW_ASSIGN_(NotMatcher); }; // Implements the AllOf(m1, m2) matcher for a particular argument type // T. We do not nest it inside the BothOfMatcher class template, as // that will prevent different instantiations of BothOfMatcher from // sharing the same BothOfMatcherImpl class. template class BothOfMatcherImpl : public MatcherInterface { public: BothOfMatcherImpl(const Matcher& matcher1, const Matcher& matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} virtual void DescribeTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeTo(os); *os << ") and ("; matcher2_.DescribeTo(os); *os << ")"; } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeNegationTo(os); *os << ") or ("; matcher2_.DescribeNegationTo(os); *os << ")"; } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { // If either matcher1_ or matcher2_ doesn't match x, we only need // to explain why one of them fails. StringMatchResultListener listener1; if (!matcher1_.MatchAndExplain(x, &listener1)) { *listener << listener1.str(); return false; } StringMatchResultListener listener2; if (!matcher2_.MatchAndExplain(x, &listener2)) { *listener << listener2.str(); return false; } // Otherwise we need to explain why *both* of them match. const internal::string s1 = listener1.str(); const internal::string s2 = listener2.str(); if (s1 == "") { *listener << s2; } else { *listener << s1; if (s2 != "") { *listener << ", and " << s2; } } return true; } private: const Matcher matcher1_; const Matcher matcher2_; GTEST_DISALLOW_ASSIGN_(BothOfMatcherImpl); }; // Used for implementing the AllOf(m_1, ..., m_n) matcher, which // matches a value that matches all of the matchers m_1, ..., and m_n. template class BothOfMatcher { public: BothOfMatcher(Matcher1 matcher1, Matcher2 matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} // This template type conversion operator allows a // BothOfMatcher object to match any type that // both Matcher1 and Matcher2 can match. template operator Matcher() const { return Matcher(new BothOfMatcherImpl(SafeMatcherCast(matcher1_), SafeMatcherCast(matcher2_))); } private: Matcher1 matcher1_; Matcher2 matcher2_; GTEST_DISALLOW_ASSIGN_(BothOfMatcher); }; // Implements the AnyOf(m1, m2) matcher for a particular argument type // T. We do not nest it inside the AnyOfMatcher class template, as // that will prevent different instantiations of AnyOfMatcher from // sharing the same EitherOfMatcherImpl class. template class EitherOfMatcherImpl : public MatcherInterface { public: EitherOfMatcherImpl(const Matcher& matcher1, const Matcher& matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} virtual void DescribeTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeTo(os); *os << ") or ("; matcher2_.DescribeTo(os); *os << ")"; } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeNegationTo(os); *os << ") and ("; matcher2_.DescribeNegationTo(os); *os << ")"; } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { // If either matcher1_ or matcher2_ matches x, we just need to // explain why *one* of them matches. StringMatchResultListener listener1; if (matcher1_.MatchAndExplain(x, &listener1)) { *listener << listener1.str(); return true; } StringMatchResultListener listener2; if (matcher2_.MatchAndExplain(x, &listener2)) { *listener << listener2.str(); return true; } // Otherwise we need to explain why *both* of them fail. const internal::string s1 = listener1.str(); const internal::string s2 = listener2.str(); if (s1 == "") { *listener << s2; } else { *listener << s1; if (s2 != "") { *listener << ", and " << s2; } } return false; } private: const Matcher matcher1_; const Matcher matcher2_; GTEST_DISALLOW_ASSIGN_(EitherOfMatcherImpl); }; // Used for implementing the AnyOf(m_1, ..., m_n) matcher, which // matches a value that matches at least one of the matchers m_1, ..., // and m_n. template class EitherOfMatcher { public: EitherOfMatcher(Matcher1 matcher1, Matcher2 matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} // This template type conversion operator allows a // EitherOfMatcher object to match any type that // both Matcher1 and Matcher2 can match. template operator Matcher() const { return Matcher(new EitherOfMatcherImpl( SafeMatcherCast(matcher1_), SafeMatcherCast(matcher2_))); } private: Matcher1 matcher1_; Matcher2 matcher2_; GTEST_DISALLOW_ASSIGN_(EitherOfMatcher); }; // Used for implementing Truly(pred), which turns a predicate into a // matcher. template class TrulyMatcher { public: explicit TrulyMatcher(Predicate pred) : predicate_(pred) {} // This method template allows Truly(pred) to be used as a matcher // for type T where T is the argument type of predicate 'pred'. The // argument is passed by reference as the predicate may be // interested in the address of the argument. template bool MatchAndExplain(T& x, // NOLINT MatchResultListener* /* listener */) const { // Without the if-statement, MSVC sometimes warns about converting // a value to bool (warning 4800). // // We cannot write 'return !!predicate_(x);' as that doesn't work // when predicate_(x) returns a class convertible to bool but // having no operator!(). if (predicate_(x)) return true; return false; } void DescribeTo(::std::ostream* os) const { *os << "satisfies the given predicate"; } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't satisfy the given predicate"; } private: Predicate predicate_; GTEST_DISALLOW_ASSIGN_(TrulyMatcher); }; // Used for implementing Matches(matcher), which turns a matcher into // a predicate. template class MatcherAsPredicate { public: explicit MatcherAsPredicate(M matcher) : matcher_(matcher) {} // This template operator() allows Matches(m) to be used as a // predicate on type T where m is a matcher on type T. // // The argument x is passed by reference instead of by value, as // some matcher may be interested in its address (e.g. as in // Matches(Ref(n))(x)). template bool operator()(const T& x) const { // We let matcher_ commit to a particular type here instead of // when the MatcherAsPredicate object was constructed. This // allows us to write Matches(m) where m is a polymorphic matcher // (e.g. Eq(5)). // // If we write Matcher(matcher_).Matches(x) here, it won't // compile when matcher_ has type Matcher; if we write // Matcher(matcher_).Matches(x) here, it won't compile // when matcher_ has type Matcher; if we just write // matcher_.Matches(x), it won't compile when matcher_ is // polymorphic, e.g. Eq(5). // // MatcherCast() is necessary for making the code work // in all of the above situations. return MatcherCast(matcher_).Matches(x); } private: M matcher_; GTEST_DISALLOW_ASSIGN_(MatcherAsPredicate); }; // For implementing ASSERT_THAT() and EXPECT_THAT(). The template // argument M must be a type that can be converted to a matcher. template class PredicateFormatterFromMatcher { public: explicit PredicateFormatterFromMatcher(const M& m) : matcher_(m) {} // This template () operator allows a PredicateFormatterFromMatcher // object to act as a predicate-formatter suitable for using with // Google Test's EXPECT_PRED_FORMAT1() macro. template AssertionResult operator()(const char* value_text, const T& x) const { // We convert matcher_ to a Matcher *now* instead of // when the PredicateFormatterFromMatcher object was constructed, // as matcher_ may be polymorphic (e.g. NotNull()) and we won't // know which type to instantiate it to until we actually see the // type of x here. // // We write MatcherCast(matcher_) instead of // Matcher(matcher_), as the latter won't compile when // matcher_ has type Matcher (e.g. An()). const Matcher matcher = MatcherCast(matcher_); StringMatchResultListener listener; if (MatchPrintAndExplain(x, matcher, &listener)) return AssertionSuccess(); ::std::stringstream ss; ss << "Value of: " << value_text << "\n" << "Expected: "; matcher.DescribeTo(&ss); ss << "\n Actual: " << listener.str(); return AssertionFailure() << ss.str(); } private: const M matcher_; GTEST_DISALLOW_ASSIGN_(PredicateFormatterFromMatcher); }; // A helper function for converting a matcher to a predicate-formatter // without the user needing to explicitly write the type. This is // used for implementing ASSERT_THAT() and EXPECT_THAT(). template inline PredicateFormatterFromMatcher MakePredicateFormatterFromMatcher(const M& matcher) { return PredicateFormatterFromMatcher(matcher); } // Implements the polymorphic floating point equality matcher, which // matches two float values using ULP-based approximation. The // template is meant to be instantiated with FloatType being either // float or double. template class FloatingEqMatcher { public: // Constructor for FloatingEqMatcher. // The matcher's input will be compared with rhs. The matcher treats two // NANs as equal if nan_eq_nan is true. Otherwise, under IEEE standards, // equality comparisons between NANs will always return false. FloatingEqMatcher(FloatType rhs, bool nan_eq_nan) : rhs_(rhs), nan_eq_nan_(nan_eq_nan) {} // Implements floating point equality matcher as a Matcher. template class Impl : public MatcherInterface { public: Impl(FloatType rhs, bool nan_eq_nan) : rhs_(rhs), nan_eq_nan_(nan_eq_nan) {} virtual bool MatchAndExplain(T value, MatchResultListener* /* listener */) const { const FloatingPoint lhs(value), rhs(rhs_); // Compares NaNs first, if nan_eq_nan_ is true. if (nan_eq_nan_ && lhs.is_nan()) { return rhs.is_nan(); } return lhs.AlmostEquals(rhs); } virtual void DescribeTo(::std::ostream* os) const { // os->precision() returns the previously set precision, which we // store to restore the ostream to its original configuration // after outputting. const ::std::streamsize old_precision = os->precision( ::std::numeric_limits::digits10 + 2); if (FloatingPoint(rhs_).is_nan()) { if (nan_eq_nan_) { *os << "is NaN"; } else { *os << "never matches"; } } else { *os << "is approximately " << rhs_; } os->precision(old_precision); } virtual void DescribeNegationTo(::std::ostream* os) const { // As before, get original precision. const ::std::streamsize old_precision = os->precision( ::std::numeric_limits::digits10 + 2); if (FloatingPoint(rhs_).is_nan()) { if (nan_eq_nan_) { *os << "isn't NaN"; } else { *os << "is anything"; } } else { *os << "isn't approximately " << rhs_; } // Restore original precision. os->precision(old_precision); } private: const FloatType rhs_; const bool nan_eq_nan_; GTEST_DISALLOW_ASSIGN_(Impl); }; // The following 3 type conversion operators allow FloatEq(rhs) and // NanSensitiveFloatEq(rhs) to be used as a Matcher, a // Matcher, or a Matcher, but nothing else. // (While Google's C++ coding style doesn't allow arguments passed // by non-const reference, we may see them in code not conforming to // the style. Therefore Google Mock needs to support them.) operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } private: const FloatType rhs_; const bool nan_eq_nan_; GTEST_DISALLOW_ASSIGN_(FloatingEqMatcher); }; // Implements the Pointee(m) matcher for matching a pointer whose // pointee matches matcher m. The pointer can be either raw or smart. template class PointeeMatcher { public: explicit PointeeMatcher(const InnerMatcher& matcher) : matcher_(matcher) {} // This type conversion operator template allows Pointee(m) to be // used as a matcher for any pointer type whose pointee type is // compatible with the inner matcher, where type Pointer can be // either a raw pointer or a smart pointer. // // The reason we do this instead of relying on // MakePolymorphicMatcher() is that the latter is not flexible // enough for implementing the DescribeTo() method of Pointee(). template operator Matcher() const { return MakeMatcher(new Impl(matcher_)); } private: // The monomorphic implementation that works for a particular pointer type. template class Impl : public MatcherInterface { public: typedef typename PointeeOf::type Pointee; explicit Impl(const InnerMatcher& matcher) : matcher_(MatcherCast(matcher)) {} virtual void DescribeTo(::std::ostream* os) const { *os << "points to a value that "; matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "does not point to a value that "; matcher_.DescribeTo(os); } virtual bool MatchAndExplain(Pointer pointer, MatchResultListener* listener) const { if (GetRawPointer(pointer) == NULL) return false; *listener << "which points to "; return MatchPrintAndExplain(*pointer, matcher_, listener); } private: const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; const InnerMatcher matcher_; GTEST_DISALLOW_ASSIGN_(PointeeMatcher); }; // Implements the Field() matcher for matching a field (i.e. member // variable) of an object. template class FieldMatcher { public: FieldMatcher(FieldType Class::*field, const Matcher& matcher) : field_(field), matcher_(matcher) {} void DescribeTo(::std::ostream* os) const { *os << "is an object whose given field "; matcher_.DescribeTo(os); } void DescribeNegationTo(::std::ostream* os) const { *os << "is an object whose given field "; matcher_.DescribeNegationTo(os); } template bool MatchAndExplain(const T& value, MatchResultListener* listener) const { return MatchAndExplainImpl( typename ::testing::internal:: is_pointer::type(), value, listener); } private: // The first argument of MatchAndExplainImpl() is needed to help // Symbian's C++ compiler choose which overload to use. Its type is // true_type iff the Field() matcher is used to match a pointer. bool MatchAndExplainImpl(false_type /* is_not_pointer */, const Class& obj, MatchResultListener* listener) const { *listener << "whose given field is "; return MatchPrintAndExplain(obj.*field_, matcher_, listener); } bool MatchAndExplainImpl(true_type /* is_pointer */, const Class* p, MatchResultListener* listener) const { if (p == NULL) return false; *listener << "which points to an object "; // Since *p has a field, it must be a class/struct/union type and // thus cannot be a pointer. Therefore we pass false_type() as // the first argument. return MatchAndExplainImpl(false_type(), *p, listener); } const FieldType Class::*field_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(FieldMatcher); }; // Implements the Property() matcher for matching a property // (i.e. return value of a getter method) of an object. template class PropertyMatcher { public: // The property may have a reference type, so 'const PropertyType&' // may cause double references and fail to compile. That's why we // need GTEST_REFERENCE_TO_CONST, which works regardless of // PropertyType being a reference or not. typedef GTEST_REFERENCE_TO_CONST_(PropertyType) RefToConstProperty; PropertyMatcher(PropertyType (Class::*property)() const, const Matcher& matcher) : property_(property), matcher_(matcher) {} void DescribeTo(::std::ostream* os) const { *os << "is an object whose given property "; matcher_.DescribeTo(os); } void DescribeNegationTo(::std::ostream* os) const { *os << "is an object whose given property "; matcher_.DescribeNegationTo(os); } template bool MatchAndExplain(const T&value, MatchResultListener* listener) const { return MatchAndExplainImpl( typename ::testing::internal:: is_pointer::type(), value, listener); } private: // The first argument of MatchAndExplainImpl() is needed to help // Symbian's C++ compiler choose which overload to use. Its type is // true_type iff the Property() matcher is used to match a pointer. bool MatchAndExplainImpl(false_type /* is_not_pointer */, const Class& obj, MatchResultListener* listener) const { *listener << "whose given property is "; // Cannot pass the return value (for example, int) to MatchPrintAndExplain, // which takes a non-const reference as argument. RefToConstProperty result = (obj.*property_)(); return MatchPrintAndExplain(result, matcher_, listener); } bool MatchAndExplainImpl(true_type /* is_pointer */, const Class* p, MatchResultListener* listener) const { if (p == NULL) return false; *listener << "which points to an object "; // Since *p has a property method, it must be a class/struct/union // type and thus cannot be a pointer. Therefore we pass // false_type() as the first argument. return MatchAndExplainImpl(false_type(), *p, listener); } PropertyType (Class::*property_)() const; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(PropertyMatcher); }; // Type traits specifying various features of different functors for ResultOf. // The default template specifies features for functor objects. // Functor classes have to typedef argument_type and result_type // to be compatible with ResultOf. template struct CallableTraits { typedef typename Functor::result_type ResultType; typedef Functor StorageType; static void CheckIsValid(Functor /* functor */) {} template static ResultType Invoke(Functor f, T arg) { return f(arg); } }; // Specialization for function pointers. template struct CallableTraits { typedef ResType ResultType; typedef ResType(*StorageType)(ArgType); static void CheckIsValid(ResType(*f)(ArgType)) { GTEST_CHECK_(f != NULL) << "NULL function pointer is passed into ResultOf()."; } template static ResType Invoke(ResType(*f)(ArgType), T arg) { return (*f)(arg); } }; // Implements the ResultOf() matcher for matching a return value of a // unary function of an object. template class ResultOfMatcher { public: typedef typename CallableTraits::ResultType ResultType; ResultOfMatcher(Callable callable, const Matcher& matcher) : callable_(callable), matcher_(matcher) { CallableTraits::CheckIsValid(callable_); } template operator Matcher() const { return Matcher(new Impl(callable_, matcher_)); } private: typedef typename CallableTraits::StorageType CallableStorageType; template class Impl : public MatcherInterface { public: Impl(CallableStorageType callable, const Matcher& matcher) : callable_(callable), matcher_(matcher) {} virtual void DescribeTo(::std::ostream* os) const { *os << "is mapped by the given callable to a value that "; matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "is mapped by the given callable to a value that "; matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(T obj, MatchResultListener* listener) const { *listener << "which is mapped by the given callable to "; // Cannot pass the return value (for example, int) to // MatchPrintAndExplain, which takes a non-const reference as argument. ResultType result = CallableTraits::template Invoke(callable_, obj); return MatchPrintAndExplain(result, matcher_, listener); } private: // Functors often define operator() as non-const method even though // they are actualy stateless. But we need to use them even when // 'this' is a const pointer. It's the user's responsibility not to // use stateful callables with ResultOf(), which does't guarantee // how many times the callable will be invoked. mutable CallableStorageType callable_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; // class Impl const CallableStorageType callable_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(ResultOfMatcher); }; // Implements an equality matcher for any STL-style container whose elements // support ==. This matcher is like Eq(), but its failure explanations provide // more detailed information that is useful when the container is used as a set. // The failure message reports elements that are in one of the operands but not // the other. The failure messages do not report duplicate or out-of-order // elements in the containers (which don't properly matter to sets, but can // occur if the containers are vectors or lists, for example). // // Uses the container's const_iterator, value_type, operator ==, // begin(), and end(). template class ContainerEqMatcher { public: typedef internal::StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; // We make a copy of rhs in case the elements in it are modified // after this matcher is created. explicit ContainerEqMatcher(const Container& rhs) : rhs_(View::Copy(rhs)) { // Makes sure the user doesn't instantiate this class template // with a const or reference type. (void)testing::StaticAssertTypeEq(); } void DescribeTo(::std::ostream* os) const { *os << "equals "; UniversalPrint(rhs_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "does not equal "; UniversalPrint(rhs_, os); } template bool MatchAndExplain(const LhsContainer& lhs, MatchResultListener* listener) const { // GTEST_REMOVE_CONST_() is needed to work around an MSVC 8.0 bug // that causes LhsContainer to be a const type sometimes. typedef internal::StlContainerView LhsView; typedef typename LhsView::type LhsStlContainer; StlContainerReference lhs_stl_container = LhsView::ConstReference(lhs); if (lhs_stl_container == rhs_) return true; ::std::ostream* const os = listener->stream(); if (os != NULL) { // Something is different. Check for extra values first. bool printed_header = false; for (typename LhsStlContainer::const_iterator it = lhs_stl_container.begin(); it != lhs_stl_container.end(); ++it) { if (internal::ArrayAwareFind(rhs_.begin(), rhs_.end(), *it) == rhs_.end()) { if (printed_header) { *os << ", "; } else { *os << "which has these unexpected elements: "; printed_header = true; } UniversalPrint(*it, os); } } // Now check for missing values. bool printed_header2 = false; for (typename StlContainer::const_iterator it = rhs_.begin(); it != rhs_.end(); ++it) { if (internal::ArrayAwareFind( lhs_stl_container.begin(), lhs_stl_container.end(), *it) == lhs_stl_container.end()) { if (printed_header2) { *os << ", "; } else { *os << (printed_header ? ",\nand" : "which") << " doesn't have these expected elements: "; printed_header2 = true; } UniversalPrint(*it, os); } } } return false; } private: const StlContainer rhs_; GTEST_DISALLOW_ASSIGN_(ContainerEqMatcher); }; // Implements Pointwise(tuple_matcher, rhs_container). tuple_matcher // must be able to be safely cast to Matcher >, where T1 and T2 are the types of elements in the LHS // container and the RHS container respectively. template class PointwiseMatcher { public: typedef internal::StlContainerView RhsView; typedef typename RhsView::type RhsStlContainer; typedef typename RhsStlContainer::value_type RhsValue; // Like ContainerEq, we make a copy of rhs in case the elements in // it are modified after this matcher is created. PointwiseMatcher(const TupleMatcher& tuple_matcher, const RhsContainer& rhs) : tuple_matcher_(tuple_matcher), rhs_(RhsView::Copy(rhs)) { // Makes sure the user doesn't instantiate this class template // with a const or reference type. (void)testing::StaticAssertTypeEq(); } template operator Matcher() const { return MakeMatcher(new Impl(tuple_matcher_, rhs_)); } template class Impl : public MatcherInterface { public: typedef internal::StlContainerView< GTEST_REMOVE_REFERENCE_AND_CONST_(LhsContainer)> LhsView; typedef typename LhsView::type LhsStlContainer; typedef typename LhsView::const_reference LhsStlContainerReference; typedef typename LhsStlContainer::value_type LhsValue; // We pass the LHS value and the RHS value to the inner matcher by // reference, as they may be expensive to copy. We must use tuple // instead of pair here, as a pair cannot hold references (C++ 98, // 20.2.2 [lib.pairs]). typedef std::tr1::tuple InnerMatcherArg; Impl(const TupleMatcher& tuple_matcher, const RhsStlContainer& rhs) // mono_tuple_matcher_ holds a monomorphic version of the tuple matcher. : mono_tuple_matcher_(SafeMatcherCast(tuple_matcher)), rhs_(rhs) {} virtual void DescribeTo(::std::ostream* os) const { *os << "contains " << rhs_.size() << " values, where each value and its corresponding value in "; UniversalPrinter::Print(rhs_, os); *os << " "; mono_tuple_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't contain exactly " << rhs_.size() << " values, or contains a value x at some index i" << " where x and the i-th value of "; UniversalPrint(rhs_, os); *os << " "; mono_tuple_matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(LhsContainer lhs, MatchResultListener* listener) const { LhsStlContainerReference lhs_stl_container = LhsView::ConstReference(lhs); const size_t actual_size = lhs_stl_container.size(); if (actual_size != rhs_.size()) { *listener << "which contains " << actual_size << " values"; return false; } typename LhsStlContainer::const_iterator left = lhs_stl_container.begin(); typename RhsStlContainer::const_iterator right = rhs_.begin(); for (size_t i = 0; i != actual_size; ++i, ++left, ++right) { const InnerMatcherArg value_pair(*left, *right); if (listener->IsInterested()) { StringMatchResultListener inner_listener; if (!mono_tuple_matcher_.MatchAndExplain( value_pair, &inner_listener)) { *listener << "where the value pair ("; UniversalPrint(*left, listener->stream()); *listener << ", "; UniversalPrint(*right, listener->stream()); *listener << ") at index #" << i << " don't match"; PrintIfNotEmpty(inner_listener.str(), listener->stream()); return false; } } else { if (!mono_tuple_matcher_.Matches(value_pair)) return false; } } return true; } private: const Matcher mono_tuple_matcher_; const RhsStlContainer rhs_; GTEST_DISALLOW_ASSIGN_(Impl); }; private: const TupleMatcher tuple_matcher_; const RhsStlContainer rhs_; GTEST_DISALLOW_ASSIGN_(PointwiseMatcher); }; // Holds the logic common to ContainsMatcherImpl and EachMatcherImpl. template class QuantifierMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; typedef typename StlContainer::value_type Element; template explicit QuantifierMatcherImpl(InnerMatcher inner_matcher) : inner_matcher_( testing::SafeMatcherCast(inner_matcher)) {} // Checks whether: // * All elements in the container match, if all_elements_should_match. // * Any element in the container matches, if !all_elements_should_match. bool MatchAndExplainImpl(bool all_elements_should_match, Container container, MatchResultListener* listener) const { StlContainerReference stl_container = View::ConstReference(container); size_t i = 0; for (typename StlContainer::const_iterator it = stl_container.begin(); it != stl_container.end(); ++it, ++i) { StringMatchResultListener inner_listener; const bool matches = inner_matcher_.MatchAndExplain(*it, &inner_listener); if (matches != all_elements_should_match) { *listener << "whose element #" << i << (matches ? " matches" : " doesn't match"); PrintIfNotEmpty(inner_listener.str(), listener->stream()); return !all_elements_should_match; } } return all_elements_should_match; } protected: const Matcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(QuantifierMatcherImpl); }; // Implements Contains(element_matcher) for the given argument type Container. // Symmetric to EachMatcherImpl. template class ContainsMatcherImpl : public QuantifierMatcherImpl { public: template explicit ContainsMatcherImpl(InnerMatcher inner_matcher) : QuantifierMatcherImpl(inner_matcher) {} // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "contains at least one element that "; this->inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't contain any element that "; this->inner_matcher_.DescribeTo(os); } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { return this->MatchAndExplainImpl(false, container, listener); } private: GTEST_DISALLOW_ASSIGN_(ContainsMatcherImpl); }; // Implements Each(element_matcher) for the given argument type Container. // Symmetric to ContainsMatcherImpl. template class EachMatcherImpl : public QuantifierMatcherImpl { public: template explicit EachMatcherImpl(InnerMatcher inner_matcher) : QuantifierMatcherImpl(inner_matcher) {} // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "only contains elements that "; this->inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "contains some element that "; this->inner_matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { return this->MatchAndExplainImpl(true, container, listener); } private: GTEST_DISALLOW_ASSIGN_(EachMatcherImpl); }; // Implements polymorphic Contains(element_matcher). template class ContainsMatcher { public: explicit ContainsMatcher(M m) : inner_matcher_(m) {} template operator Matcher() const { return MakeMatcher(new ContainsMatcherImpl(inner_matcher_)); } private: const M inner_matcher_; GTEST_DISALLOW_ASSIGN_(ContainsMatcher); }; // Implements polymorphic Each(element_matcher). template class EachMatcher { public: explicit EachMatcher(M m) : inner_matcher_(m) {} template operator Matcher() const { return MakeMatcher(new EachMatcherImpl(inner_matcher_)); } private: const M inner_matcher_; GTEST_DISALLOW_ASSIGN_(EachMatcher); }; // Implements Key(inner_matcher) for the given argument pair type. // Key(inner_matcher) matches an std::pair whose 'first' field matches // inner_matcher. For example, Contains(Key(Ge(5))) can be used to match an // std::map that contains at least one element whose key is >= 5. template class KeyMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(PairType) RawPairType; typedef typename RawPairType::first_type KeyType; template explicit KeyMatcherImpl(InnerMatcher inner_matcher) : inner_matcher_( testing::SafeMatcherCast(inner_matcher)) { } // Returns true iff 'key_value.first' (the key) matches the inner matcher. virtual bool MatchAndExplain(PairType key_value, MatchResultListener* listener) const { StringMatchResultListener inner_listener; const bool match = inner_matcher_.MatchAndExplain(key_value.first, &inner_listener); const internal::string explanation = inner_listener.str(); if (explanation != "") { *listener << "whose first field is a value " << explanation; } return match; } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "has a key that "; inner_matcher_.DescribeTo(os); } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't have a key that "; inner_matcher_.DescribeTo(os); } private: const Matcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(KeyMatcherImpl); }; // Implements polymorphic Key(matcher_for_key). template class KeyMatcher { public: explicit KeyMatcher(M m) : matcher_for_key_(m) {} template operator Matcher() const { return MakeMatcher(new KeyMatcherImpl(matcher_for_key_)); } private: const M matcher_for_key_; GTEST_DISALLOW_ASSIGN_(KeyMatcher); }; // Implements Pair(first_matcher, second_matcher) for the given argument pair // type with its two matchers. See Pair() function below. template class PairMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(PairType) RawPairType; typedef typename RawPairType::first_type FirstType; typedef typename RawPairType::second_type SecondType; template PairMatcherImpl(FirstMatcher first_matcher, SecondMatcher second_matcher) : first_matcher_( testing::SafeMatcherCast(first_matcher)), second_matcher_( testing::SafeMatcherCast(second_matcher)) { } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "has a first field that "; first_matcher_.DescribeTo(os); *os << ", and has a second field that "; second_matcher_.DescribeTo(os); } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "has a first field that "; first_matcher_.DescribeNegationTo(os); *os << ", or has a second field that "; second_matcher_.DescribeNegationTo(os); } // Returns true iff 'a_pair.first' matches first_matcher and 'a_pair.second' // matches second_matcher. virtual bool MatchAndExplain(PairType a_pair, MatchResultListener* listener) const { if (!listener->IsInterested()) { // If the listener is not interested, we don't need to construct the // explanation. return first_matcher_.Matches(a_pair.first) && second_matcher_.Matches(a_pair.second); } StringMatchResultListener first_inner_listener; if (!first_matcher_.MatchAndExplain(a_pair.first, &first_inner_listener)) { *listener << "whose first field does not match"; PrintIfNotEmpty(first_inner_listener.str(), listener->stream()); return false; } StringMatchResultListener second_inner_listener; if (!second_matcher_.MatchAndExplain(a_pair.second, &second_inner_listener)) { *listener << "whose second field does not match"; PrintIfNotEmpty(second_inner_listener.str(), listener->stream()); return false; } ExplainSuccess(first_inner_listener.str(), second_inner_listener.str(), listener); return true; } private: void ExplainSuccess(const internal::string& first_explanation, const internal::string& second_explanation, MatchResultListener* listener) const { *listener << "whose both fields match"; if (first_explanation != "") { *listener << ", where the first field is a value " << first_explanation; } if (second_explanation != "") { *listener << ", "; if (first_explanation != "") { *listener << "and "; } else { *listener << "where "; } *listener << "the second field is a value " << second_explanation; } } const Matcher first_matcher_; const Matcher second_matcher_; GTEST_DISALLOW_ASSIGN_(PairMatcherImpl); }; // Implements polymorphic Pair(first_matcher, second_matcher). template class PairMatcher { public: PairMatcher(FirstMatcher first_matcher, SecondMatcher second_matcher) : first_matcher_(first_matcher), second_matcher_(second_matcher) {} template operator Matcher () const { return MakeMatcher( new PairMatcherImpl( first_matcher_, second_matcher_)); } private: const FirstMatcher first_matcher_; const SecondMatcher second_matcher_; GTEST_DISALLOW_ASSIGN_(PairMatcher); }; // Implements ElementsAre() and ElementsAreArray(). template class ElementsAreMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef internal::StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; typedef typename StlContainer::value_type Element; // Constructs the matcher from a sequence of element values or // element matchers. template ElementsAreMatcherImpl(InputIter first, size_t a_count) { matchers_.reserve(a_count); InputIter it = first; for (size_t i = 0; i != a_count; ++i, ++it) { matchers_.push_back(MatcherCast(*it)); } } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { if (count() == 0) { *os << "is empty"; } else if (count() == 1) { *os << "has 1 element that "; matchers_[0].DescribeTo(os); } else { *os << "has " << Elements(count()) << " where\n"; for (size_t i = 0; i != count(); ++i) { *os << "element #" << i << " "; matchers_[i].DescribeTo(os); if (i + 1 < count()) { *os << ",\n"; } } } } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { if (count() == 0) { *os << "isn't empty"; return; } *os << "doesn't have " << Elements(count()) << ", or\n"; for (size_t i = 0; i != count(); ++i) { *os << "element #" << i << " "; matchers_[i].DescribeNegationTo(os); if (i + 1 < count()) { *os << ", or\n"; } } } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { StlContainerReference stl_container = View::ConstReference(container); const size_t actual_count = stl_container.size(); if (actual_count != count()) { // The element count doesn't match. If the container is empty, // there's no need to explain anything as Google Mock already // prints the empty container. Otherwise we just need to show // how many elements there actually are. if (actual_count != 0) { *listener << "which has " << Elements(actual_count); } return false; } typename StlContainer::const_iterator it = stl_container.begin(); // explanations[i] is the explanation of the element at index i. std::vector explanations(count()); for (size_t i = 0; i != count(); ++it, ++i) { StringMatchResultListener s; if (matchers_[i].MatchAndExplain(*it, &s)) { explanations[i] = s.str(); } else { // The container has the right size but the i-th element // doesn't match its expectation. *listener << "whose element #" << i << " doesn't match"; PrintIfNotEmpty(s.str(), listener->stream()); return false; } } // Every element matches its expectation. We need to explain why // (the obvious ones can be skipped). bool reason_printed = false; for (size_t i = 0; i != count(); ++i) { const internal::string& s = explanations[i]; if (!s.empty()) { if (reason_printed) { *listener << ",\nand "; } *listener << "whose element #" << i << " matches, " << s; reason_printed = true; } } return true; } private: static Message Elements(size_t count) { return Message() << count << (count == 1 ? " element" : " elements"); } size_t count() const { return matchers_.size(); } std::vector > matchers_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcherImpl); }; // Implements ElementsAre() of 0 arguments. class ElementsAreMatcher0 { public: ElementsAreMatcher0() {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher* const matchers = NULL; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 0)); } }; // Implements ElementsAreArray(). template class ElementsAreArrayMatcher { public: ElementsAreArrayMatcher(const T* first, size_t count) : first_(first), count_(count) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; return MakeMatcher(new ElementsAreMatcherImpl(first_, count_)); } private: const T* const first_; const size_t count_; GTEST_DISALLOW_ASSIGN_(ElementsAreArrayMatcher); }; // Returns the description for a matcher defined using the MATCHER*() // macro where the user-supplied description string is "", if // 'negation' is false; otherwise returns the description of the // negation of the matcher. 'param_values' contains a list of strings // that are the print-out of the matcher's parameters. string FormatMatcherDescription(bool negation, const char* matcher_name, const Strings& param_values); } // namespace internal // Implements MatcherCast(). template inline Matcher MatcherCast(M matcher) { return internal::MatcherCastImpl::Cast(matcher); } // _ is a matcher that matches anything of any type. // // This definition is fine as: // // 1. The C++ standard permits using the name _ in a namespace that // is not the global namespace or ::std. // 2. The AnythingMatcher class has no data member or constructor, // so it's OK to create global variables of this type. // 3. c-style has approved of using _ in this case. const internal::AnythingMatcher _ = {}; // Creates a matcher that matches any value of the given type T. template inline Matcher A() { return MakeMatcher(new internal::AnyMatcherImpl()); } // Creates a matcher that matches any value of the given type T. template inline Matcher An() { return A(); } // Creates a polymorphic matcher that matches anything equal to x. // Note: if the parameter of Eq() were declared as const T&, Eq("foo") // wouldn't compile. template inline internal::EqMatcher Eq(T x) { return internal::EqMatcher(x); } // Constructs a Matcher from a 'value' of type T. The constructed // matcher matches any value that's equal to 'value'. template Matcher::Matcher(T value) { *this = Eq(value); } // Creates a monomorphic matcher that matches anything with type Lhs // and equal to rhs. A user may need to use this instead of Eq(...) // in order to resolve an overloading ambiguity. // // TypedEq(x) is just a convenient short-hand for Matcher(Eq(x)) // or Matcher(x), but more readable than the latter. // // We could define similar monomorphic matchers for other comparison // operations (e.g. TypedLt, TypedGe, and etc), but decided not to do // it yet as those are used much less than Eq() in practice. A user // can always write Matcher(Lt(5)) to be explicit about the type, // for example. template inline Matcher TypedEq(const Rhs& rhs) { return Eq(rhs); } // Creates a polymorphic matcher that matches anything >= x. template inline internal::GeMatcher Ge(Rhs x) { return internal::GeMatcher(x); } // Creates a polymorphic matcher that matches anything > x. template inline internal::GtMatcher Gt(Rhs x) { return internal::GtMatcher(x); } // Creates a polymorphic matcher that matches anything <= x. template inline internal::LeMatcher Le(Rhs x) { return internal::LeMatcher(x); } // Creates a polymorphic matcher that matches anything < x. template inline internal::LtMatcher Lt(Rhs x) { return internal::LtMatcher(x); } // Creates a polymorphic matcher that matches anything != x. template inline internal::NeMatcher Ne(Rhs x) { return internal::NeMatcher(x); } // Creates a polymorphic matcher that matches any NULL pointer. inline PolymorphicMatcher IsNull() { return MakePolymorphicMatcher(internal::IsNullMatcher()); } // Creates a polymorphic matcher that matches any non-NULL pointer. // This is convenient as Not(NULL) doesn't compile (the compiler // thinks that that expression is comparing a pointer with an integer). inline PolymorphicMatcher NotNull() { return MakePolymorphicMatcher(internal::NotNullMatcher()); } // Creates a polymorphic matcher that matches any argument that // references variable x. template inline internal::RefMatcher Ref(T& x) { // NOLINT return internal::RefMatcher(x); } // Creates a matcher that matches any double argument approximately // equal to rhs, where two NANs are considered unequal. inline internal::FloatingEqMatcher DoubleEq(double rhs) { return internal::FloatingEqMatcher(rhs, false); } // Creates a matcher that matches any double argument approximately // equal to rhs, including NaN values when rhs is NaN. inline internal::FloatingEqMatcher NanSensitiveDoubleEq(double rhs) { return internal::FloatingEqMatcher(rhs, true); } // Creates a matcher that matches any float argument approximately // equal to rhs, where two NANs are considered unequal. inline internal::FloatingEqMatcher FloatEq(float rhs) { return internal::FloatingEqMatcher(rhs, false); } // Creates a matcher that matches any double argument approximately // equal to rhs, including NaN values when rhs is NaN. inline internal::FloatingEqMatcher NanSensitiveFloatEq(float rhs) { return internal::FloatingEqMatcher(rhs, true); } // Creates a matcher that matches a pointer (raw or smart) that points // to a value that matches inner_matcher. template inline internal::PointeeMatcher Pointee( const InnerMatcher& inner_matcher) { return internal::PointeeMatcher(inner_matcher); } // Creates a matcher that matches an object whose given field matches // 'matcher'. For example, // Field(&Foo::number, Ge(5)) // matches a Foo object x iff x.number >= 5. template inline PolymorphicMatcher< internal::FieldMatcher > Field( FieldType Class::*field, const FieldMatcher& matcher) { return MakePolymorphicMatcher( internal::FieldMatcher( field, MatcherCast(matcher))); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // Field(&Foo::bar, m) // to compile where bar is an int32 and m is a matcher for int64. } // Creates a matcher that matches an object whose given property // matches 'matcher'. For example, // Property(&Foo::str, StartsWith("hi")) // matches a Foo object x iff x.str() starts with "hi". template inline PolymorphicMatcher< internal::PropertyMatcher > Property( PropertyType (Class::*property)() const, const PropertyMatcher& matcher) { return MakePolymorphicMatcher( internal::PropertyMatcher( property, MatcherCast(matcher))); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // Property(&Foo::bar, m) // to compile where bar() returns an int32 and m is a matcher for int64. } // Creates a matcher that matches an object iff the result of applying // a callable to x matches 'matcher'. // For example, // ResultOf(f, StartsWith("hi")) // matches a Foo object x iff f(x) starts with "hi". // callable parameter can be a function, function pointer, or a functor. // Callable has to satisfy the following conditions: // * It is required to keep no state affecting the results of // the calls on it and make no assumptions about how many calls // will be made. Any state it keeps must be protected from the // concurrent access. // * If it is a function object, it has to define type result_type. // We recommend deriving your functor classes from std::unary_function. template internal::ResultOfMatcher ResultOf( Callable callable, const ResultOfMatcher& matcher) { return internal::ResultOfMatcher( callable, MatcherCast::ResultType>( matcher)); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // ResultOf(Function, m) // to compile where Function() returns an int32 and m is a matcher for int64. } // String matchers. // Matches a string equal to str. inline PolymorphicMatcher > StrEq(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, true)); } // Matches a string not equal to str. inline PolymorphicMatcher > StrNe(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, true)); } // Matches a string equal to str, ignoring case. inline PolymorphicMatcher > StrCaseEq(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, false)); } // Matches a string not equal to str, ignoring case. inline PolymorphicMatcher > StrCaseNe(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, false)); } // Creates a matcher that matches any string, std::string, or C string // that contains the given substring. inline PolymorphicMatcher > HasSubstr(const internal::string& substring) { return MakePolymorphicMatcher(internal::HasSubstrMatcher( substring)); } // Matches a string that starts with 'prefix' (case-sensitive). inline PolymorphicMatcher > StartsWith(const internal::string& prefix) { return MakePolymorphicMatcher(internal::StartsWithMatcher( prefix)); } // Matches a string that ends with 'suffix' (case-sensitive). inline PolymorphicMatcher > EndsWith(const internal::string& suffix) { return MakePolymorphicMatcher(internal::EndsWithMatcher( suffix)); } // Matches a string that fully matches regular expression 'regex'. // The matcher takes ownership of 'regex'. inline PolymorphicMatcher MatchesRegex( const internal::RE* regex) { return MakePolymorphicMatcher(internal::MatchesRegexMatcher(regex, true)); } inline PolymorphicMatcher MatchesRegex( const internal::string& regex) { return MatchesRegex(new internal::RE(regex)); } // Matches a string that contains regular expression 'regex'. // The matcher takes ownership of 'regex'. inline PolymorphicMatcher ContainsRegex( const internal::RE* regex) { return MakePolymorphicMatcher(internal::MatchesRegexMatcher(regex, false)); } inline PolymorphicMatcher ContainsRegex( const internal::string& regex) { return ContainsRegex(new internal::RE(regex)); } #if GTEST_HAS_GLOBAL_WSTRING || GTEST_HAS_STD_WSTRING // Wide string matchers. // Matches a string equal to str. inline PolymorphicMatcher > StrEq(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, true)); } // Matches a string not equal to str. inline PolymorphicMatcher > StrNe(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, true)); } // Matches a string equal to str, ignoring case. inline PolymorphicMatcher > StrCaseEq(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, false)); } // Matches a string not equal to str, ignoring case. inline PolymorphicMatcher > StrCaseNe(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, false)); } // Creates a matcher that matches any wstring, std::wstring, or C wide string // that contains the given substring. inline PolymorphicMatcher > HasSubstr(const internal::wstring& substring) { return MakePolymorphicMatcher(internal::HasSubstrMatcher( substring)); } // Matches a string that starts with 'prefix' (case-sensitive). inline PolymorphicMatcher > StartsWith(const internal::wstring& prefix) { return MakePolymorphicMatcher(internal::StartsWithMatcher( prefix)); } // Matches a string that ends with 'suffix' (case-sensitive). inline PolymorphicMatcher > EndsWith(const internal::wstring& suffix) { return MakePolymorphicMatcher(internal::EndsWithMatcher( suffix)); } #endif // GTEST_HAS_GLOBAL_WSTRING || GTEST_HAS_STD_WSTRING // Creates a polymorphic matcher that matches a 2-tuple where the // first field == the second field. inline internal::Eq2Matcher Eq() { return internal::Eq2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field >= the second field. inline internal::Ge2Matcher Ge() { return internal::Ge2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field > the second field. inline internal::Gt2Matcher Gt() { return internal::Gt2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field <= the second field. inline internal::Le2Matcher Le() { return internal::Le2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field < the second field. inline internal::Lt2Matcher Lt() { return internal::Lt2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field != the second field. inline internal::Ne2Matcher Ne() { return internal::Ne2Matcher(); } // Creates a matcher that matches any value of type T that m doesn't // match. template inline internal::NotMatcher Not(InnerMatcher m) { return internal::NotMatcher(m); } // Returns a matcher that matches anything that satisfies the given // predicate. The predicate can be any unary function or functor // whose return type can be implicitly converted to bool. template inline PolymorphicMatcher > Truly(Predicate pred) { return MakePolymorphicMatcher(internal::TrulyMatcher(pred)); } // Returns a matcher that matches an equal container. // This matcher behaves like Eq(), but in the event of mismatch lists the // values that are included in one container but not the other. (Duplicate // values and order differences are not explained.) template inline PolymorphicMatcher > ContainerEq(const Container& rhs) { // This following line is for working around a bug in MSVC 8.0, // which causes Container to be a const type sometimes. typedef GTEST_REMOVE_CONST_(Container) RawContainer; return MakePolymorphicMatcher( internal::ContainerEqMatcher(rhs)); } // Matches an STL-style container or a native array that contains the // same number of elements as in rhs, where its i-th element and rhs's // i-th element (as a pair) satisfy the given pair matcher, for all i. // TupleMatcher must be able to be safely cast to Matcher >, where T1 and T2 are the types of elements in the // LHS container and the RHS container respectively. template inline internal::PointwiseMatcher Pointwise(const TupleMatcher& tuple_matcher, const Container& rhs) { // This following line is for working around a bug in MSVC 8.0, // which causes Container to be a const type sometimes. typedef GTEST_REMOVE_CONST_(Container) RawContainer; return internal::PointwiseMatcher( tuple_matcher, rhs); } // Matches an STL-style container or a native array that contains at // least one element matching the given value or matcher. // // Examples: // ::std::set page_ids; // page_ids.insert(3); // page_ids.insert(1); // EXPECT_THAT(page_ids, Contains(1)); // EXPECT_THAT(page_ids, Contains(Gt(2))); // EXPECT_THAT(page_ids, Not(Contains(4))); // // ::std::map page_lengths; // page_lengths[1] = 100; // EXPECT_THAT(page_lengths, // Contains(::std::pair(1, 100))); // // const char* user_ids[] = { "joe", "mike", "tom" }; // EXPECT_THAT(user_ids, Contains(Eq(::std::string("tom")))); template inline internal::ContainsMatcher Contains(M matcher) { return internal::ContainsMatcher(matcher); } // Matches an STL-style container or a native array that contains only // elements matching the given value or matcher. // // Each(m) is semantically equivalent to Not(Contains(Not(m))). Only // the messages are different. // // Examples: // ::std::set page_ids; // // Each(m) matches an empty container, regardless of what m is. // EXPECT_THAT(page_ids, Each(Eq(1))); // EXPECT_THAT(page_ids, Each(Eq(77))); // // page_ids.insert(3); // EXPECT_THAT(page_ids, Each(Gt(0))); // EXPECT_THAT(page_ids, Not(Each(Gt(4)))); // page_ids.insert(1); // EXPECT_THAT(page_ids, Not(Each(Lt(2)))); // // ::std::map page_lengths; // page_lengths[1] = 100; // page_lengths[2] = 200; // page_lengths[3] = 300; // EXPECT_THAT(page_lengths, Not(Each(Pair(1, 100)))); // EXPECT_THAT(page_lengths, Each(Key(Le(3)))); // // const char* user_ids[] = { "joe", "mike", "tom" }; // EXPECT_THAT(user_ids, Not(Each(Eq(::std::string("tom"))))); template inline internal::EachMatcher Each(M matcher) { return internal::EachMatcher(matcher); } // Key(inner_matcher) matches an std::pair whose 'first' field matches // inner_matcher. For example, Contains(Key(Ge(5))) can be used to match an // std::map that contains at least one element whose key is >= 5. template inline internal::KeyMatcher Key(M inner_matcher) { return internal::KeyMatcher(inner_matcher); } // Pair(first_matcher, second_matcher) matches a std::pair whose 'first' field // matches first_matcher and whose 'second' field matches second_matcher. For // example, EXPECT_THAT(map_type, ElementsAre(Pair(Ge(5), "foo"))) can be used // to match a std::map that contains exactly one element whose key // is >= 5 and whose value equals "foo". template inline internal::PairMatcher Pair(FirstMatcher first_matcher, SecondMatcher second_matcher) { return internal::PairMatcher( first_matcher, second_matcher); } // Returns a predicate that is satisfied by anything that matches the // given matcher. template inline internal::MatcherAsPredicate Matches(M matcher) { return internal::MatcherAsPredicate(matcher); } // Returns true iff the value matches the matcher. template inline bool Value(const T& value, M matcher) { return testing::Matches(matcher)(value); } // Matches the value against the given matcher and explains the match // result to listener. template inline bool ExplainMatchResult( M matcher, const T& value, MatchResultListener* listener) { return SafeMatcherCast(matcher).MatchAndExplain(value, listener); } // AllArgs(m) is a synonym of m. This is useful in // // EXPECT_CALL(foo, Bar(_, _)).With(AllArgs(Eq())); // // which is easier to read than // // EXPECT_CALL(foo, Bar(_, _)).With(Eq()); template inline InnerMatcher AllArgs(const InnerMatcher& matcher) { return matcher; } // These macros allow using matchers to check values in Google Test // tests. ASSERT_THAT(value, matcher) and EXPECT_THAT(value, matcher) // succeed iff the value matches the matcher. If the assertion fails, // the value and the description of the matcher will be printed. #define ASSERT_THAT(value, matcher) ASSERT_PRED_FORMAT1(\ ::testing::internal::MakePredicateFormatterFromMatcher(matcher), value) #define EXPECT_THAT(value, matcher) EXPECT_PRED_FORMAT1(\ ::testing::internal::MakePredicateFormatterFromMatcher(matcher), value) } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ namespace testing { // An abstract handle of an expectation. class Expectation; // A set of expectation handles. class ExpectationSet; // Anything inside the 'internal' namespace IS INTERNAL IMPLEMENTATION // and MUST NOT BE USED IN USER CODE!!! namespace internal { // Implements a mock function. template class FunctionMocker; // Base class for expectations. class ExpectationBase; // Implements an expectation. template class TypedExpectation; // Helper class for testing the Expectation class template. class ExpectationTester; // Base class for function mockers. template class FunctionMockerBase; // Protects the mock object registry (in class Mock), all function // mockers, and all expectations. // // The reason we don't use more fine-grained protection is: when a // mock function Foo() is called, it needs to consult its expectations // to see which one should be picked. If another thread is allowed to // call a mock function (either Foo() or a different one) at the same // time, it could affect the "retired" attributes of Foo()'s // expectations when InSequence() is used, and thus affect which // expectation gets picked. Therefore, we sequence all mock function // calls to ensure the integrity of the mock objects' states. GTEST_DECLARE_STATIC_MUTEX_(g_gmock_mutex); // Untyped base class for ActionResultHolder. class UntypedActionResultHolderBase; // Abstract base class of FunctionMockerBase. This is the // type-agnostic part of the function mocker interface. Its pure // virtual methods are implemented by FunctionMockerBase. class UntypedFunctionMockerBase { public: UntypedFunctionMockerBase(); virtual ~UntypedFunctionMockerBase(); // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex bool VerifyAndClearExpectationsLocked(); // Clears the ON_CALL()s set on this mock function. // L >= g_gmock_mutex virtual void ClearDefaultActionsLocked() = 0; // In all of the following Untyped* functions, it's the caller's // responsibility to guarantee the correctness of the arguments' // types. // Performs the default action with the given arguments and returns // the action's result. The call description string will be used in // the error message to describe the call in the case the default // action fails. // L = * virtual UntypedActionResultHolderBase* UntypedPerformDefaultAction( const void* untyped_args, const string& call_description) const = 0; // Performs the given action with the given arguments and returns // the action's result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformAction( const void* untyped_action, const void* untyped_args) const = 0; // Writes a message that the call is uninteresting (i.e. neither // explicitly expected nor explicitly unexpected) to the given // ostream. // L < g_gmock_mutex virtual void UntypedDescribeUninterestingCall(const void* untyped_args, ::std::ostream* os) const = 0; // Returns the expectation that matches the given function arguments // (or NULL is there's no match); when a match is found, // untyped_action is set to point to the action that should be // performed (or NULL if the action is "do default"), and // is_excessive is modified to indicate whether the call exceeds the // expected number. // L < g_gmock_mutex virtual const ExpectationBase* UntypedFindMatchingExpectation( const void* untyped_args, const void** untyped_action, bool* is_excessive, ::std::ostream* what, ::std::ostream* why) = 0; // Prints the given function arguments to the ostream. virtual void UntypedPrintArgs(const void* untyped_args, ::std::ostream* os) const = 0; // Sets the mock object this mock method belongs to, and registers // this information in the global mock registry. Will be called // whenever an EXPECT_CALL() or ON_CALL() is executed on this mock // method. // TODO(wan@google.com): rename to SetAndRegisterOwner(). // L < g_gmock_mutex void RegisterOwner(const void* mock_obj); // Sets the mock object this mock method belongs to, and sets the // name of the mock function. Will be called upon each invocation // of this mock function. // L < g_gmock_mutex void SetOwnerAndName(const void* mock_obj, const char* name); // Returns the mock object this mock method belongs to. Must be // called after RegisterOwner() or SetOwnerAndName() has been // called. // L < g_gmock_mutex const void* MockObject() const; // Returns the name of this mock method. Must be called after // SetOwnerAndName() has been called. // L < g_gmock_mutex const char* Name() const; // Returns the result of invoking this mock function with the given // arguments. This function can be safely called from multiple // threads concurrently. The caller is responsible for deleting the // result. // L < g_gmock_mutex const UntypedActionResultHolderBase* UntypedInvokeWith( const void* untyped_args); protected: typedef std::vector UntypedOnCallSpecs; typedef std::vector > UntypedExpectations; // Returns an Expectation object that references and co-owns exp, // which must be an expectation on this mock function. Expectation GetHandleOf(ExpectationBase* exp); // Address of the mock object this mock method belongs to. Only // valid after this mock method has been called or // ON_CALL/EXPECT_CALL has been invoked on it. const void* mock_obj_; // Protected by g_gmock_mutex. // Name of the function being mocked. Only valid after this mock // method has been called. const char* name_; // Protected by g_gmock_mutex. // All default action specs for this function mocker. UntypedOnCallSpecs untyped_on_call_specs_; // All expectations for this function mocker. UntypedExpectations untyped_expectations_; }; // class UntypedFunctionMockerBase // Untyped base class for OnCallSpec. class UntypedOnCallSpecBase { public: // The arguments are the location of the ON_CALL() statement. UntypedOnCallSpecBase(const char* a_file, int a_line) : file_(a_file), line_(a_line), last_clause_(kNone) {} // Where in the source file was the default action spec defined? const char* file() const { return file_; } int line() const { return line_; } protected: // Gives each clause in the ON_CALL() statement a name. enum Clause { // Do not change the order of the enum members! The run-time // syntax checking relies on it. kNone, kWith, kWillByDefault }; // Asserts that the ON_CALL() statement has a certain property. void AssertSpecProperty(bool property, const string& failure_message) const { Assert(property, file_, line_, failure_message); } // Expects that the ON_CALL() statement has a certain property. void ExpectSpecProperty(bool property, const string& failure_message) const { Expect(property, file_, line_, failure_message); } const char* file_; int line_; // The last clause in the ON_CALL() statement as seen so far. // Initially kNone and changes as the statement is parsed. Clause last_clause_; }; // class UntypedOnCallSpecBase // This template class implements an ON_CALL spec. template class OnCallSpec : public UntypedOnCallSpecBase { public: typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; // Constructs an OnCallSpec object from the information inside // the parenthesis of an ON_CALL() statement. OnCallSpec(const char* a_file, int a_line, const ArgumentMatcherTuple& matchers) : UntypedOnCallSpecBase(a_file, a_line), matchers_(matchers), // By default, extra_matcher_ should match anything. However, // we cannot initialize it with _ as that triggers a compiler // bug in Symbian's C++ compiler (cannot decide between two // overloaded constructors of Matcher). extra_matcher_(A()) { } // Implements the .With() clause. OnCallSpec& With(const Matcher& m) { // Makes sure this is called at most once. ExpectSpecProperty(last_clause_ < kWith, ".With() cannot appear " "more than once in an ON_CALL()."); last_clause_ = kWith; extra_matcher_ = m; return *this; } // Implements the .WillByDefault() clause. OnCallSpec& WillByDefault(const Action& action) { ExpectSpecProperty(last_clause_ < kWillByDefault, ".WillByDefault() must appear " "exactly once in an ON_CALL()."); last_clause_ = kWillByDefault; ExpectSpecProperty(!action.IsDoDefault(), "DoDefault() cannot be used in ON_CALL()."); action_ = action; return *this; } // Returns true iff the given arguments match the matchers. bool Matches(const ArgumentTuple& args) const { return TupleMatches(matchers_, args) && extra_matcher_.Matches(args); } // Returns the action specified by the user. const Action& GetAction() const { AssertSpecProperty(last_clause_ == kWillByDefault, ".WillByDefault() must appear exactly " "once in an ON_CALL()."); return action_; } private: // The information in statement // // ON_CALL(mock_object, Method(matchers)) // .With(multi-argument-matcher) // .WillByDefault(action); // // is recorded in the data members like this: // // source file that contains the statement => file_ // line number of the statement => line_ // matchers => matchers_ // multi-argument-matcher => extra_matcher_ // action => action_ ArgumentMatcherTuple matchers_; Matcher extra_matcher_; Action action_; }; // class OnCallSpec // Possible reactions on uninteresting calls. TODO(wan@google.com): // rename the enum values to the kFoo style. enum CallReaction { ALLOW, WARN, FAIL }; } // namespace internal // Utilities for manipulating mock objects. class Mock { public: // The following public methods can be called concurrently. // Tells Google Mock to ignore mock_obj when checking for leaked // mock objects. static void AllowLeak(const void* mock_obj); // Verifies and clears all expectations on the given mock object. // If the expectations aren't satisfied, generates one or more // Google Test non-fatal failures and returns false. static bool VerifyAndClearExpectations(void* mock_obj); // Verifies all expectations on the given mock object and clears its // default actions and expectations. Returns true iff the // verification was successful. static bool VerifyAndClear(void* mock_obj); private: friend class internal::UntypedFunctionMockerBase; // Needed for a function mocker to register itself (so that we know // how to clear a mock object). template friend class internal::FunctionMockerBase; template friend class NiceMock; template friend class StrictMock; // Tells Google Mock to allow uninteresting calls on the given mock // object. // L < g_gmock_mutex static void AllowUninterestingCalls(const void* mock_obj); // Tells Google Mock to warn the user about uninteresting calls on // the given mock object. // L < g_gmock_mutex static void WarnUninterestingCalls(const void* mock_obj); // Tells Google Mock to fail uninteresting calls on the given mock // object. // L < g_gmock_mutex static void FailUninterestingCalls(const void* mock_obj); // Tells Google Mock the given mock object is being destroyed and // its entry in the call-reaction table should be removed. // L < g_gmock_mutex static void UnregisterCallReaction(const void* mock_obj); // Returns the reaction Google Mock will have on uninteresting calls // made on the given mock object. // L < g_gmock_mutex static internal::CallReaction GetReactionOnUninterestingCalls( const void* mock_obj); // Verifies that all expectations on the given mock object have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex static bool VerifyAndClearExpectationsLocked(void* mock_obj); // Clears all ON_CALL()s set on the given mock object. // L >= g_gmock_mutex static void ClearDefaultActionsLocked(void* mock_obj); // Registers a mock object and a mock method it owns. // L < g_gmock_mutex static void Register(const void* mock_obj, internal::UntypedFunctionMockerBase* mocker); // Tells Google Mock where in the source code mock_obj is used in an // ON_CALL or EXPECT_CALL. In case mock_obj is leaked, this // information helps the user identify which object it is. // L < g_gmock_mutex static void RegisterUseByOnCallOrExpectCall( const void* mock_obj, const char* file, int line); // Unregisters a mock method; removes the owning mock object from // the registry when the last mock method associated with it has // been unregistered. This is called only in the destructor of // FunctionMockerBase. // L >= g_gmock_mutex static void UnregisterLocked(internal::UntypedFunctionMockerBase* mocker); }; // class Mock // An abstract handle of an expectation. Useful in the .After() // clause of EXPECT_CALL() for setting the (partial) order of // expectations. The syntax: // // Expectation e1 = EXPECT_CALL(...)...; // EXPECT_CALL(...).After(e1)...; // // sets two expectations where the latter can only be matched after // the former has been satisfied. // // Notes: // - This class is copyable and has value semantics. // - Constness is shallow: a const Expectation object itself cannot // be modified, but the mutable methods of the ExpectationBase // object it references can be called via expectation_base(). // - The constructors and destructor are defined out-of-line because // the Symbian WINSCW compiler wants to otherwise instantiate them // when it sees this class definition, at which point it doesn't have // ExpectationBase available yet, leading to incorrect destruction // in the linked_ptr (or compilation errors if using a checking // linked_ptr). class Expectation { public: // Constructs a null object that doesn't reference any expectation. Expectation(); ~Expectation(); // This single-argument ctor must not be explicit, in order to support the // Expectation e = EXPECT_CALL(...); // syntax. // // A TypedExpectation object stores its pre-requisites as // Expectation objects, and needs to call the non-const Retire() // method on the ExpectationBase objects they reference. Therefore // Expectation must receive a *non-const* reference to the // ExpectationBase object. Expectation(internal::ExpectationBase& exp); // NOLINT // The compiler-generated copy ctor and operator= work exactly as // intended, so we don't need to define our own. // Returns true iff rhs references the same expectation as this object does. bool operator==(const Expectation& rhs) const { return expectation_base_ == rhs.expectation_base_; } bool operator!=(const Expectation& rhs) const { return !(*this == rhs); } private: friend class ExpectationSet; friend class Sequence; friend class ::testing::internal::ExpectationBase; friend class ::testing::internal::UntypedFunctionMockerBase; template friend class ::testing::internal::FunctionMockerBase; template friend class ::testing::internal::TypedExpectation; // This comparator is needed for putting Expectation objects into a set. class Less { public: bool operator()(const Expectation& lhs, const Expectation& rhs) const { return lhs.expectation_base_.get() < rhs.expectation_base_.get(); } }; typedef ::std::set Set; Expectation( const internal::linked_ptr& expectation_base); // Returns the expectation this object references. const internal::linked_ptr& expectation_base() const { return expectation_base_; } // A linked_ptr that co-owns the expectation this handle references. internal::linked_ptr expectation_base_; }; // A set of expectation handles. Useful in the .After() clause of // EXPECT_CALL() for setting the (partial) order of expectations. The // syntax: // // ExpectationSet es; // es += EXPECT_CALL(...)...; // es += EXPECT_CALL(...)...; // EXPECT_CALL(...).After(es)...; // // sets three expectations where the last one can only be matched // after the first two have both been satisfied. // // This class is copyable and has value semantics. class ExpectationSet { public: // A bidirectional iterator that can read a const element in the set. typedef Expectation::Set::const_iterator const_iterator; // An object stored in the set. This is an alias of Expectation. typedef Expectation::Set::value_type value_type; // Constructs an empty set. ExpectationSet() {} // This single-argument ctor must not be explicit, in order to support the // ExpectationSet es = EXPECT_CALL(...); // syntax. ExpectationSet(internal::ExpectationBase& exp) { // NOLINT *this += Expectation(exp); } // This single-argument ctor implements implicit conversion from // Expectation and thus must not be explicit. This allows either an // Expectation or an ExpectationSet to be used in .After(). ExpectationSet(const Expectation& e) { // NOLINT *this += e; } // The compiler-generator ctor and operator= works exactly as // intended, so we don't need to define our own. // Returns true iff rhs contains the same set of Expectation objects // as this does. bool operator==(const ExpectationSet& rhs) const { return expectations_ == rhs.expectations_; } bool operator!=(const ExpectationSet& rhs) const { return !(*this == rhs); } // Implements the syntax // expectation_set += EXPECT_CALL(...); ExpectationSet& operator+=(const Expectation& e) { expectations_.insert(e); return *this; } int size() const { return static_cast(expectations_.size()); } const_iterator begin() const { return expectations_.begin(); } const_iterator end() const { return expectations_.end(); } private: Expectation::Set expectations_; }; // Sequence objects are used by a user to specify the relative order // in which the expectations should match. They are copyable (we rely // on the compiler-defined copy constructor and assignment operator). class Sequence { public: // Constructs an empty sequence. Sequence() : last_expectation_(new Expectation) {} // Adds an expectation to this sequence. The caller must ensure // that no other thread is accessing this Sequence object. void AddExpectation(const Expectation& expectation) const; private: // The last expectation in this sequence. We use a linked_ptr here // because Sequence objects are copyable and we want the copies to // be aliases. The linked_ptr allows the copies to co-own and share // the same Expectation object. internal::linked_ptr last_expectation_; }; // class Sequence // An object of this type causes all EXPECT_CALL() statements // encountered in its scope to be put in an anonymous sequence. The // work is done in the constructor and destructor. You should only // create an InSequence object on the stack. // // The sole purpose for this class is to support easy definition of // sequential expectations, e.g. // // { // InSequence dummy; // The name of the object doesn't matter. // // // The following expectations must match in the order they appear. // EXPECT_CALL(a, Bar())...; // EXPECT_CALL(a, Baz())...; // ... // EXPECT_CALL(b, Xyz())...; // } // // You can create InSequence objects in multiple threads, as long as // they are used to affect different mock objects. The idea is that // each thread can create and set up its own mocks as if it's the only // thread. However, for clarity of your tests we recommend you to set // up mocks in the main thread unless you have a good reason not to do // so. class InSequence { public: InSequence(); ~InSequence(); private: bool sequence_created_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InSequence); // NOLINT } GTEST_ATTRIBUTE_UNUSED_; namespace internal { // Points to the implicit sequence introduced by a living InSequence // object (if any) in the current thread or NULL. extern ThreadLocal g_gmock_implicit_sequence; // Base class for implementing expectations. // // There are two reasons for having a type-agnostic base class for // Expectation: // // 1. We need to store collections of expectations of different // types (e.g. all pre-requisites of a particular expectation, all // expectations in a sequence). Therefore these expectation objects // must share a common base class. // // 2. We can avoid binary code bloat by moving methods not depending // on the template argument of Expectation to the base class. // // This class is internal and mustn't be used by user code directly. class ExpectationBase { public: // source_text is the EXPECT_CALL(...) source that created this Expectation. ExpectationBase(const char* file, int line, const string& source_text); virtual ~ExpectationBase(); // Where in the source file was the expectation spec defined? const char* file() const { return file_; } int line() const { return line_; } const char* source_text() const { return source_text_.c_str(); } // Returns the cardinality specified in the expectation spec. const Cardinality& cardinality() const { return cardinality_; } // Describes the source file location of this expectation. void DescribeLocationTo(::std::ostream* os) const { *os << FormatFileLocation(file(), line()) << " "; } // Describes how many times a function call matching this // expectation has occurred. // L >= g_gmock_mutex void DescribeCallCountTo(::std::ostream* os) const; // If this mock method has an extra matcher (i.e. .With(matcher)), // describes it to the ostream. virtual void MaybeDescribeExtraMatcherTo(::std::ostream* os) = 0; protected: friend class ::testing::Expectation; friend class UntypedFunctionMockerBase; enum Clause { // Don't change the order of the enum members! kNone, kWith, kTimes, kInSequence, kAfter, kWillOnce, kWillRepeatedly, kRetiresOnSaturation }; typedef std::vector UntypedActions; // Returns an Expectation object that references and co-owns this // expectation. virtual Expectation GetHandle() = 0; // Asserts that the EXPECT_CALL() statement has the given property. void AssertSpecProperty(bool property, const string& failure_message) const { Assert(property, file_, line_, failure_message); } // Expects that the EXPECT_CALL() statement has the given property. void ExpectSpecProperty(bool property, const string& failure_message) const { Expect(property, file_, line_, failure_message); } // Explicitly specifies the cardinality of this expectation. Used // by the subclasses to implement the .Times() clause. void SpecifyCardinality(const Cardinality& cardinality); // Returns true iff the user specified the cardinality explicitly // using a .Times(). bool cardinality_specified() const { return cardinality_specified_; } // Sets the cardinality of this expectation spec. void set_cardinality(const Cardinality& a_cardinality) { cardinality_ = a_cardinality; } // The following group of methods should only be called after the // EXPECT_CALL() statement, and only when g_gmock_mutex is held by // the current thread. // Retires all pre-requisites of this expectation. // L >= g_gmock_mutex void RetireAllPreRequisites(); // Returns true iff this expectation is retired. // L >= g_gmock_mutex bool is_retired() const { g_gmock_mutex.AssertHeld(); return retired_; } // Retires this expectation. // L >= g_gmock_mutex void Retire() { g_gmock_mutex.AssertHeld(); retired_ = true; } // Returns true iff this expectation is satisfied. // L >= g_gmock_mutex bool IsSatisfied() const { g_gmock_mutex.AssertHeld(); return cardinality().IsSatisfiedByCallCount(call_count_); } // Returns true iff this expectation is saturated. // L >= g_gmock_mutex bool IsSaturated() const { g_gmock_mutex.AssertHeld(); return cardinality().IsSaturatedByCallCount(call_count_); } // Returns true iff this expectation is over-saturated. // L >= g_gmock_mutex bool IsOverSaturated() const { g_gmock_mutex.AssertHeld(); return cardinality().IsOverSaturatedByCallCount(call_count_); } // Returns true iff all pre-requisites of this expectation are satisfied. // L >= g_gmock_mutex bool AllPrerequisitesAreSatisfied() const; // Adds unsatisfied pre-requisites of this expectation to 'result'. // L >= g_gmock_mutex void FindUnsatisfiedPrerequisites(ExpectationSet* result) const; // Returns the number this expectation has been invoked. // L >= g_gmock_mutex int call_count() const { g_gmock_mutex.AssertHeld(); return call_count_; } // Increments the number this expectation has been invoked. // L >= g_gmock_mutex void IncrementCallCount() { g_gmock_mutex.AssertHeld(); call_count_++; } // Checks the action count (i.e. the number of WillOnce() and // WillRepeatedly() clauses) against the cardinality if this hasn't // been done before. Prints a warning if there are too many or too // few actions. // L < mutex_ void CheckActionCountIfNotDone() const; friend class ::testing::Sequence; friend class ::testing::internal::ExpectationTester; template friend class TypedExpectation; // Implements the .Times() clause. void UntypedTimes(const Cardinality& a_cardinality); // This group of fields are part of the spec and won't change after // an EXPECT_CALL() statement finishes. const char* file_; // The file that contains the expectation. int line_; // The line number of the expectation. const string source_text_; // The EXPECT_CALL(...) source text. // True iff the cardinality is specified explicitly. bool cardinality_specified_; Cardinality cardinality_; // The cardinality of the expectation. // The immediate pre-requisites (i.e. expectations that must be // satisfied before this expectation can be matched) of this // expectation. We use linked_ptr in the set because we want an // Expectation object to be co-owned by its FunctionMocker and its // successors. This allows multiple mock objects to be deleted at // different times. ExpectationSet immediate_prerequisites_; // This group of fields are the current state of the expectation, // and can change as the mock function is called. int call_count_; // How many times this expectation has been invoked. bool retired_; // True iff this expectation has retired. UntypedActions untyped_actions_; bool extra_matcher_specified_; bool repeated_action_specified_; // True if a WillRepeatedly() was specified. bool retires_on_saturation_; Clause last_clause_; mutable bool action_count_checked_; // Under mutex_. mutable Mutex mutex_; // Protects action_count_checked_. GTEST_DISALLOW_ASSIGN_(ExpectationBase); }; // class ExpectationBase // Impements an expectation for the given function type. template class TypedExpectation : public ExpectationBase { public: typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; typedef typename Function::Result Result; TypedExpectation(FunctionMockerBase* owner, const char* a_file, int a_line, const string& a_source_text, const ArgumentMatcherTuple& m) : ExpectationBase(a_file, a_line, a_source_text), owner_(owner), matchers_(m), // By default, extra_matcher_ should match anything. However, // we cannot initialize it with _ as that triggers a compiler // bug in Symbian's C++ compiler (cannot decide between two // overloaded constructors of Matcher). extra_matcher_(A()), repeated_action_(DoDefault()) {} virtual ~TypedExpectation() { // Check the validity of the action count if it hasn't been done // yet (for example, if the expectation was never used). CheckActionCountIfNotDone(); for (UntypedActions::const_iterator it = untyped_actions_.begin(); it != untyped_actions_.end(); ++it) { delete static_cast*>(*it); } } // Implements the .With() clause. TypedExpectation& With(const Matcher& m) { if (last_clause_ == kWith) { ExpectSpecProperty(false, ".With() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kWith, ".With() must be the first " "clause in an EXPECT_CALL()."); } last_clause_ = kWith; extra_matcher_ = m; extra_matcher_specified_ = true; return *this; } // Implements the .Times() clause. TypedExpectation& Times(const Cardinality& a_cardinality) { ExpectationBase::UntypedTimes(a_cardinality); return *this; } // Implements the .Times() clause. TypedExpectation& Times(int n) { return Times(Exactly(n)); } // Implements the .InSequence() clause. TypedExpectation& InSequence(const Sequence& s) { ExpectSpecProperty(last_clause_ <= kInSequence, ".InSequence() cannot appear after .After()," " .WillOnce(), .WillRepeatedly(), or " ".RetiresOnSaturation()."); last_clause_ = kInSequence; s.AddExpectation(GetHandle()); return *this; } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { return InSequence(s1).InSequence(s2); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3) { return InSequence(s1, s2).InSequence(s3); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3, const Sequence& s4) { return InSequence(s1, s2, s3).InSequence(s4); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3, const Sequence& s4, const Sequence& s5) { return InSequence(s1, s2, s3, s4).InSequence(s5); } // Implements that .After() clause. TypedExpectation& After(const ExpectationSet& s) { ExpectSpecProperty(last_clause_ <= kAfter, ".After() cannot appear after .WillOnce()," " .WillRepeatedly(), or " ".RetiresOnSaturation()."); last_clause_ = kAfter; for (ExpectationSet::const_iterator it = s.begin(); it != s.end(); ++it) { immediate_prerequisites_ += *it; } return *this; } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2) { return After(s1).After(s2); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3) { return After(s1, s2).After(s3); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3, const ExpectationSet& s4) { return After(s1, s2, s3).After(s4); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3, const ExpectationSet& s4, const ExpectationSet& s5) { return After(s1, s2, s3, s4).After(s5); } // Implements the .WillOnce() clause. TypedExpectation& WillOnce(const Action& action) { ExpectSpecProperty(last_clause_ <= kWillOnce, ".WillOnce() cannot appear after " ".WillRepeatedly() or .RetiresOnSaturation()."); last_clause_ = kWillOnce; untyped_actions_.push_back(new Action(action)); if (!cardinality_specified()) { set_cardinality(Exactly(static_cast(untyped_actions_.size()))); } return *this; } // Implements the .WillRepeatedly() clause. TypedExpectation& WillRepeatedly(const Action& action) { if (last_clause_ == kWillRepeatedly) { ExpectSpecProperty(false, ".WillRepeatedly() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kWillRepeatedly, ".WillRepeatedly() cannot appear " "after .RetiresOnSaturation()."); } last_clause_ = kWillRepeatedly; repeated_action_specified_ = true; repeated_action_ = action; if (!cardinality_specified()) { set_cardinality(AtLeast(static_cast(untyped_actions_.size()))); } // Now that no more action clauses can be specified, we check // whether their count makes sense. CheckActionCountIfNotDone(); return *this; } // Implements the .RetiresOnSaturation() clause. TypedExpectation& RetiresOnSaturation() { ExpectSpecProperty(last_clause_ < kRetiresOnSaturation, ".RetiresOnSaturation() cannot appear " "more than once."); last_clause_ = kRetiresOnSaturation; retires_on_saturation_ = true; // Now that no more action clauses can be specified, we check // whether their count makes sense. CheckActionCountIfNotDone(); return *this; } // Returns the matchers for the arguments as specified inside the // EXPECT_CALL() macro. const ArgumentMatcherTuple& matchers() const { return matchers_; } // Returns the matcher specified by the .With() clause. const Matcher& extra_matcher() const { return extra_matcher_; } // Returns the action specified by the .WillRepeatedly() clause. const Action& repeated_action() const { return repeated_action_; } // If this mock method has an extra matcher (i.e. .With(matcher)), // describes it to the ostream. virtual void MaybeDescribeExtraMatcherTo(::std::ostream* os) { if (extra_matcher_specified_) { *os << " Expected args: "; extra_matcher_.DescribeTo(os); *os << "\n"; } } private: template friend class FunctionMockerBase; // Returns an Expectation object that references and co-owns this // expectation. virtual Expectation GetHandle() { return owner_->GetHandleOf(this); } // The following methods will be called only after the EXPECT_CALL() // statement finishes and when the current thread holds // g_gmock_mutex. // Returns true iff this expectation matches the given arguments. // L >= g_gmock_mutex bool Matches(const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); return TupleMatches(matchers_, args) && extra_matcher_.Matches(args); } // Returns true iff this expectation should handle the given arguments. // L >= g_gmock_mutex bool ShouldHandleArguments(const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); // In case the action count wasn't checked when the expectation // was defined (e.g. if this expectation has no WillRepeatedly() // or RetiresOnSaturation() clause), we check it when the // expectation is used for the first time. CheckActionCountIfNotDone(); return !is_retired() && AllPrerequisitesAreSatisfied() && Matches(args); } // Describes the result of matching the arguments against this // expectation to the given ostream. // L >= g_gmock_mutex void ExplainMatchResultTo(const ArgumentTuple& args, ::std::ostream* os) const { g_gmock_mutex.AssertHeld(); if (is_retired()) { *os << " Expected: the expectation is active\n" << " Actual: it is retired\n"; } else if (!Matches(args)) { if (!TupleMatches(matchers_, args)) { ExplainMatchFailureTupleTo(matchers_, args, os); } StringMatchResultListener listener; if (!extra_matcher_.MatchAndExplain(args, &listener)) { *os << " Expected args: "; extra_matcher_.DescribeTo(os); *os << "\n Actual: don't match"; internal::PrintIfNotEmpty(listener.str(), os); *os << "\n"; } } else if (!AllPrerequisitesAreSatisfied()) { *os << " Expected: all pre-requisites are satisfied\n" << " Actual: the following immediate pre-requisites " << "are not satisfied:\n"; ExpectationSet unsatisfied_prereqs; FindUnsatisfiedPrerequisites(&unsatisfied_prereqs); int i = 0; for (ExpectationSet::const_iterator it = unsatisfied_prereqs.begin(); it != unsatisfied_prereqs.end(); ++it) { it->expectation_base()->DescribeLocationTo(os); *os << "pre-requisite #" << i++ << "\n"; } *os << " (end of pre-requisites)\n"; } else { // This line is here just for completeness' sake. It will never // be executed as currently the ExplainMatchResultTo() function // is called only when the mock function call does NOT match the // expectation. *os << "The call matches the expectation.\n"; } } // Returns the action that should be taken for the current invocation. // L >= g_gmock_mutex const Action& GetCurrentAction(const FunctionMockerBase* mocker, const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); const int count = call_count(); Assert(count >= 1, __FILE__, __LINE__, "call_count() is <= 0 when GetCurrentAction() is " "called - this should never happen."); const int action_count = static_cast(untyped_actions_.size()); if (action_count > 0 && !repeated_action_specified_ && count > action_count) { // If there is at least one WillOnce() and no WillRepeatedly(), // we warn the user when the WillOnce() clauses ran out. ::std::stringstream ss; DescribeLocationTo(&ss); ss << "Actions ran out in " << source_text() << "...\n" << "Called " << count << " times, but only " << action_count << " WillOnce()" << (action_count == 1 ? " is" : "s are") << " specified - "; mocker->DescribeDefaultActionTo(args, &ss); Log(WARNING, ss.str(), 1); } return count <= action_count ? *static_cast*>(untyped_actions_[count - 1]) : repeated_action(); } // Given the arguments of a mock function call, if the call will // over-saturate this expectation, returns the default action; // otherwise, returns the next action in this expectation. Also // describes *what* happened to 'what', and explains *why* Google // Mock does it to 'why'. This method is not const as it calls // IncrementCallCount(). A return value of NULL means the default // action. // L >= g_gmock_mutex const Action* GetActionForArguments(const FunctionMockerBase* mocker, const ArgumentTuple& args, ::std::ostream* what, ::std::ostream* why) { g_gmock_mutex.AssertHeld(); if (IsSaturated()) { // We have an excessive call. IncrementCallCount(); *what << "Mock function called more times than expected - "; mocker->DescribeDefaultActionTo(args, what); DescribeCallCountTo(why); // TODO(wan@google.com): allow the user to control whether // unexpected calls should fail immediately or continue using a // flag --gmock_unexpected_calls_are_fatal. return NULL; } IncrementCallCount(); RetireAllPreRequisites(); if (retires_on_saturation_ && IsSaturated()) { Retire(); } // Must be done after IncrementCount()! *what << "Mock function call matches " << source_text() <<"...\n"; return &(GetCurrentAction(mocker, args)); } // All the fields below won't change once the EXPECT_CALL() // statement finishes. FunctionMockerBase* const owner_; ArgumentMatcherTuple matchers_; Matcher extra_matcher_; Action repeated_action_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TypedExpectation); }; // class TypedExpectation // A MockSpec object is used by ON_CALL() or EXPECT_CALL() for // specifying the default behavior of, or expectation on, a mock // function. // Note: class MockSpec really belongs to the ::testing namespace. // However if we define it in ::testing, MSVC will complain when // classes in ::testing::internal declare it as a friend class // template. To workaround this compiler bug, we define MockSpec in // ::testing::internal and import it into ::testing. // Logs a message including file and line number information. void LogWithLocation(testing::internal::LogSeverity severity, const char* file, int line, const string& message); template class MockSpec { public: typedef typename internal::Function::ArgumentTuple ArgumentTuple; typedef typename internal::Function::ArgumentMatcherTuple ArgumentMatcherTuple; // Constructs a MockSpec object, given the function mocker object // that the spec is associated with. explicit MockSpec(internal::FunctionMockerBase* function_mocker) : function_mocker_(function_mocker) {} // Adds a new default action spec to the function mocker and returns // the newly created spec. internal::OnCallSpec& InternalDefaultActionSetAt( const char* file, int line, const char* obj, const char* call) { LogWithLocation(internal::INFO, file, line, string("ON_CALL(") + obj + ", " + call + ") invoked"); return function_mocker_->AddNewOnCallSpec(file, line, matchers_); } // Adds a new expectation spec to the function mocker and returns // the newly created spec. internal::TypedExpectation& InternalExpectedAt( const char* file, int line, const char* obj, const char* call) { const string source_text(string("EXPECT_CALL(") + obj + ", " + call + ")"); LogWithLocation(internal::INFO, file, line, source_text + " invoked"); return function_mocker_->AddNewExpectation( file, line, source_text, matchers_); } private: template friend class internal::FunctionMocker; void SetMatchers(const ArgumentMatcherTuple& matchers) { matchers_ = matchers; } // The function mocker that owns this spec. internal::FunctionMockerBase* const function_mocker_; // The argument matchers specified in the spec. ArgumentMatcherTuple matchers_; GTEST_DISALLOW_ASSIGN_(MockSpec); }; // class MockSpec // MSVC warns about using 'this' in base member initializer list, so // we need to temporarily disable the warning. We have to do it for // the entire class to suppress the warning, even though it's about // the constructor only. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355. #endif // _MSV_VER // C++ treats the void type specially. For example, you cannot define // a void-typed variable or pass a void value to a function. // ActionResultHolder holds a value of type T, where T must be a // copyable type or void (T doesn't need to be default-constructable). // It hides the syntactic difference between void and other types, and // is used to unify the code for invoking both void-returning and // non-void-returning mock functions. // Untyped base class for ActionResultHolder. class UntypedActionResultHolderBase { public: virtual ~UntypedActionResultHolderBase() {} // Prints the held value as an action's result to os. virtual void PrintAsActionResult(::std::ostream* os) const = 0; }; // This generic definition is used when T is not void. template class ActionResultHolder : public UntypedActionResultHolderBase { public: explicit ActionResultHolder(T a_value) : value_(a_value) {} // The compiler-generated copy constructor and assignment operator // are exactly what we need, so we don't need to define them. // Returns the held value and deletes this object. T GetValueAndDelete() const { T retval(value_); delete this; return retval; } // Prints the held value as an action's result to os. virtual void PrintAsActionResult(::std::ostream* os) const { *os << "\n Returns: "; // T may be a reference type, so we don't use UniversalPrint(). UniversalPrinter::Print(value_, os); } // Performs the given mock function's default action and returns the // result in a new-ed ActionResultHolder. template static ActionResultHolder* PerformDefaultAction( const FunctionMockerBase* func_mocker, const typename Function::ArgumentTuple& args, const string& call_description) { return new ActionResultHolder( func_mocker->PerformDefaultAction(args, call_description)); } // Performs the given action and returns the result in a new-ed // ActionResultHolder. template static ActionResultHolder* PerformAction(const Action& action, const typename Function::ArgumentTuple& args) { return new ActionResultHolder(action.Perform(args)); } private: T value_; // T could be a reference type, so = isn't supported. GTEST_DISALLOW_ASSIGN_(ActionResultHolder); }; // Specialization for T = void. template <> class ActionResultHolder : public UntypedActionResultHolderBase { public: void GetValueAndDelete() const { delete this; } virtual void PrintAsActionResult(::std::ostream* /* os */) const {} // Performs the given mock function's default action and returns NULL; template static ActionResultHolder* PerformDefaultAction( const FunctionMockerBase* func_mocker, const typename Function::ArgumentTuple& args, const string& call_description) { func_mocker->PerformDefaultAction(args, call_description); return NULL; } // Performs the given action and returns NULL. template static ActionResultHolder* PerformAction( const Action& action, const typename Function::ArgumentTuple& args) { action.Perform(args); return NULL; } }; // The base of the function mocker class for the given function type. // We put the methods in this class instead of its child to avoid code // bloat. template class FunctionMockerBase : public UntypedFunctionMockerBase { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; FunctionMockerBase() : current_spec_(this) {} // The destructor verifies that all expectations on this mock // function have been satisfied. If not, it will report Google Test // non-fatal failures for the violations. // L < g_gmock_mutex virtual ~FunctionMockerBase() { MutexLock l(&g_gmock_mutex); VerifyAndClearExpectationsLocked(); Mock::UnregisterLocked(this); ClearDefaultActionsLocked(); } // Returns the ON_CALL spec that matches this mock function with the // given arguments; returns NULL if no matching ON_CALL is found. // L = * const OnCallSpec* FindOnCallSpec( const ArgumentTuple& args) const { for (UntypedOnCallSpecs::const_reverse_iterator it = untyped_on_call_specs_.rbegin(); it != untyped_on_call_specs_.rend(); ++it) { const OnCallSpec* spec = static_cast*>(*it); if (spec->Matches(args)) return spec; } return NULL; } // Performs the default action of this mock function on the given arguments // and returns the result. Asserts with a helpful call descrption if there is // no valid return value. This method doesn't depend on the mutable state of // this object, and thus can be called concurrently without locking. // L = * Result PerformDefaultAction(const ArgumentTuple& args, const string& call_description) const { const OnCallSpec* const spec = this->FindOnCallSpec(args); if (spec != NULL) { return spec->GetAction().Perform(args); } Assert(DefaultValue::Exists(), "", -1, call_description + "\n The mock function has no default action " "set, and its return type has no default value set."); return DefaultValue::Get(); } // Performs the default action with the given arguments and returns // the action's result. The call description string will be used in // the error message to describe the call in the case the default // action fails. The caller is responsible for deleting the result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformDefaultAction( const void* untyped_args, // must point to an ArgumentTuple const string& call_description) const { const ArgumentTuple& args = *static_cast(untyped_args); return ResultHolder::PerformDefaultAction(this, args, call_description); } // Performs the given action with the given arguments and returns // the action's result. The caller is responsible for deleting the // result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformAction( const void* untyped_action, const void* untyped_args) const { // Make a copy of the action before performing it, in case the // action deletes the mock object (and thus deletes itself). const Action action = *static_cast*>(untyped_action); const ArgumentTuple& args = *static_cast(untyped_args); return ResultHolder::PerformAction(action, args); } // Implements UntypedFunctionMockerBase::ClearDefaultActionsLocked(): // clears the ON_CALL()s set on this mock function. // L >= g_gmock_mutex virtual void ClearDefaultActionsLocked() { g_gmock_mutex.AssertHeld(); for (UntypedOnCallSpecs::const_iterator it = untyped_on_call_specs_.begin(); it != untyped_on_call_specs_.end(); ++it) { delete static_cast*>(*it); } untyped_on_call_specs_.clear(); } protected: template friend class MockSpec; typedef ActionResultHolder ResultHolder; // Returns the result of invoking this mock function with the given // arguments. This function can be safely called from multiple // threads concurrently. // L < g_gmock_mutex Result InvokeWith(const ArgumentTuple& args) { return static_cast( this->UntypedInvokeWith(&args))->GetValueAndDelete(); } // Adds and returns a default action spec for this mock function. // L < g_gmock_mutex OnCallSpec& AddNewOnCallSpec( const char* file, int line, const ArgumentMatcherTuple& m) { Mock::RegisterUseByOnCallOrExpectCall(MockObject(), file, line); OnCallSpec* const on_call_spec = new OnCallSpec(file, line, m); untyped_on_call_specs_.push_back(on_call_spec); return *on_call_spec; } // Adds and returns an expectation spec for this mock function. // L < g_gmock_mutex TypedExpectation& AddNewExpectation( const char* file, int line, const string& source_text, const ArgumentMatcherTuple& m) { Mock::RegisterUseByOnCallOrExpectCall(MockObject(), file, line); TypedExpectation* const expectation = new TypedExpectation(this, file, line, source_text, m); const linked_ptr untyped_expectation(expectation); untyped_expectations_.push_back(untyped_expectation); // Adds this expectation into the implicit sequence if there is one. Sequence* const implicit_sequence = g_gmock_implicit_sequence.get(); if (implicit_sequence != NULL) { implicit_sequence->AddExpectation(Expectation(untyped_expectation)); } return *expectation; } // The current spec (either default action spec or expectation spec) // being described on this function mocker. MockSpec& current_spec() { return current_spec_; } private: template friend class TypedExpectation; // Some utilities needed for implementing UntypedInvokeWith(). // Describes what default action will be performed for the given // arguments. // L = * void DescribeDefaultActionTo(const ArgumentTuple& args, ::std::ostream* os) const { const OnCallSpec* const spec = FindOnCallSpec(args); if (spec == NULL) { *os << (internal::type_equals::value ? "returning directly.\n" : "returning default value.\n"); } else { *os << "taking default action specified at:\n" << FormatFileLocation(spec->file(), spec->line()) << "\n"; } } // Writes a message that the call is uninteresting (i.e. neither // explicitly expected nor explicitly unexpected) to the given // ostream. // L < g_gmock_mutex virtual void UntypedDescribeUninterestingCall(const void* untyped_args, ::std::ostream* os) const { const ArgumentTuple& args = *static_cast(untyped_args); *os << "Uninteresting mock function call - "; DescribeDefaultActionTo(args, os); *os << " Function call: " << Name(); UniversalPrint(args, os); } // Returns the expectation that matches the given function arguments // (or NULL is there's no match); when a match is found, // untyped_action is set to point to the action that should be // performed (or NULL if the action is "do default"), and // is_excessive is modified to indicate whether the call exceeds the // expected number. // // Critical section: We must find the matching expectation and the // corresponding action that needs to be taken in an ATOMIC // transaction. Otherwise another thread may call this mock // method in the middle and mess up the state. // // However, performing the action has to be left out of the critical // section. The reason is that we have no control on what the // action does (it can invoke an arbitrary user function or even a // mock function) and excessive locking could cause a dead lock. // L < g_gmock_mutex virtual const ExpectationBase* UntypedFindMatchingExpectation( const void* untyped_args, const void** untyped_action, bool* is_excessive, ::std::ostream* what, ::std::ostream* why) { const ArgumentTuple& args = *static_cast(untyped_args); MutexLock l(&g_gmock_mutex); TypedExpectation* exp = this->FindMatchingExpectationLocked(args); if (exp == NULL) { // A match wasn't found. this->FormatUnexpectedCallMessageLocked(args, what, why); return NULL; } // This line must be done before calling GetActionForArguments(), // which will increment the call count for *exp and thus affect // its saturation status. *is_excessive = exp->IsSaturated(); const Action* action = exp->GetActionForArguments(this, args, what, why); if (action != NULL && action->IsDoDefault()) action = NULL; // Normalize "do default" to NULL. *untyped_action = action; return exp; } // Prints the given function arguments to the ostream. virtual void UntypedPrintArgs(const void* untyped_args, ::std::ostream* os) const { const ArgumentTuple& args = *static_cast(untyped_args); UniversalPrint(args, os); } // Returns the expectation that matches the arguments, or NULL if no // expectation matches them. // L >= g_gmock_mutex TypedExpectation* FindMatchingExpectationLocked( const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); for (typename UntypedExpectations::const_reverse_iterator it = untyped_expectations_.rbegin(); it != untyped_expectations_.rend(); ++it) { TypedExpectation* const exp = static_cast*>(it->get()); if (exp->ShouldHandleArguments(args)) { return exp; } } return NULL; } // Returns a message that the arguments don't match any expectation. // L >= g_gmock_mutex void FormatUnexpectedCallMessageLocked(const ArgumentTuple& args, ::std::ostream* os, ::std::ostream* why) const { g_gmock_mutex.AssertHeld(); *os << "\nUnexpected mock function call - "; DescribeDefaultActionTo(args, os); PrintTriedExpectationsLocked(args, why); } // Prints a list of expectations that have been tried against the // current mock function call. // L >= g_gmock_mutex void PrintTriedExpectationsLocked(const ArgumentTuple& args, ::std::ostream* why) const { g_gmock_mutex.AssertHeld(); const int count = static_cast(untyped_expectations_.size()); *why << "Google Mock tried the following " << count << " " << (count == 1 ? "expectation, but it didn't match" : "expectations, but none matched") << ":\n"; for (int i = 0; i < count; i++) { TypedExpectation* const expectation = static_cast*>(untyped_expectations_[i].get()); *why << "\n"; expectation->DescribeLocationTo(why); if (count > 1) { *why << "tried expectation #" << i << ": "; } *why << expectation->source_text() << "...\n"; expectation->ExplainMatchResultTo(args, why); expectation->DescribeCallCountTo(why); } } // The current spec (either default action spec or expectation spec) // being described on this function mocker. MockSpec current_spec_; // There is no generally useful and implementable semantics of // copying a mock object, so copying a mock is usually a user error. // Thus we disallow copying function mockers. If the user really // wants to copy a mock object, he should implement his own copy // operation, for example: // // class MockFoo : public Foo { // public: // // Defines a copy constructor explicitly. // MockFoo(const MockFoo& src) {} // ... // }; GTEST_DISALLOW_COPY_AND_ASSIGN_(FunctionMockerBase); }; // class FunctionMockerBase #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSV_VER // Implements methods of FunctionMockerBase. // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures and // returns false if not. // L >= g_gmock_mutex // Reports an uninteresting call (whose description is in msg) in the // manner specified by 'reaction'. void ReportUninterestingCall(CallReaction reaction, const string& msg); } // namespace internal // The style guide prohibits "using" statements in a namespace scope // inside a header file. However, the MockSpec class template is // meant to be defined in the ::testing namespace. The following line // is just a trick for working around a bug in MSVC 8.0, which cannot // handle it if we define MockSpec in ::testing. using internal::MockSpec; // Const(x) is a convenient function for obtaining a const reference // to x. This is useful for setting expectations on an overloaded // const mock method, e.g. // // class MockFoo : public FooInterface { // public: // MOCK_METHOD0(Bar, int()); // MOCK_CONST_METHOD0(Bar, int&()); // }; // // MockFoo foo; // // Expects a call to non-const MockFoo::Bar(). // EXPECT_CALL(foo, Bar()); // // Expects a call to const MockFoo::Bar(). // EXPECT_CALL(Const(foo), Bar()); template inline const T& Const(const T& x) { return x; } // Constructs an Expectation object that references and co-owns exp. inline Expectation::Expectation(internal::ExpectationBase& exp) // NOLINT : expectation_base_(exp.GetHandle().expectation_base()) {} } // namespace testing // A separate macro is required to avoid compile errors when the name // of the method used in call is a result of macro expansion. // See CompilesWithMethodNameExpandedFromMacro tests in // internal/gmock-spec-builders_test.cc for more details. #define GMOCK_ON_CALL_IMPL_(obj, call) \ ((obj).gmock_##call).InternalDefaultActionSetAt(__FILE__, __LINE__, \ #obj, #call) #define ON_CALL(obj, call) GMOCK_ON_CALL_IMPL_(obj, call) #define GMOCK_EXPECT_CALL_IMPL_(obj, call) \ ((obj).gmock_##call).InternalExpectedAt(__FILE__, __LINE__, #obj, #call) #define EXPECT_CALL(obj, call) GMOCK_EXPECT_CALL_IMPL_(obj, call) #endif // GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ namespace testing { namespace internal { template class FunctionMockerBase; // Note: class FunctionMocker really belongs to the ::testing // namespace. However if we define it in ::testing, MSVC will // complain when classes in ::testing::internal declare it as a // friend class template. To workaround this compiler bug, we define // FunctionMocker in ::testing::internal and import it into ::testing. template class FunctionMocker; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With() { return this->current_spec(); } R Invoke() { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple()); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1)); return this->current_spec(); } R Invoke(A1 a1) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2)); return this->current_spec(); } R Invoke(A1 a1, A2 a2) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8, A9); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8, const Matcher& m9) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8, m9)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8, const Matcher& m9, const Matcher& m10) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8, m9, m10)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9, A10 a10) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10)); } }; } // namespace internal // The style guide prohibits "using" statements in a namespace scope // inside a header file. However, the FunctionMocker class template // is meant to be defined in the ::testing namespace. The following // line is just a trick for working around a bug in MSVC 8.0, which // cannot handle it if we define FunctionMocker in ::testing. using internal::FunctionMocker; // The result type of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_RESULT_(tn, F) tn ::testing::internal::Function::Result // The type of argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_ARG_(tn, F, N) tn ::testing::internal::Function::Argument##N // The matcher type for argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MATCHER_(tn, F, N) const ::testing::Matcher& // The variable for mocking the given method. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MOCKER_(arity, constness, Method) \ GTEST_CONCAT_TOKEN_(gmock##constness##arity##_##Method##_, __LINE__) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD0_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method() constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 0, \ this_method_does_not_take_0_arguments); \ GMOCK_MOCKER_(0, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(0, constness, Method).Invoke(); \ } \ ::testing::MockSpec& \ gmock_##Method() constness { \ GMOCK_MOCKER_(0, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(0, constness, Method).With(); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(0, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD1_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 1, \ this_method_does_not_take_1_argument); \ GMOCK_MOCKER_(1, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(1, constness, Method).Invoke(gmock_a1); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1) constness { \ GMOCK_MOCKER_(1, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(1, constness, Method).With(gmock_a1); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(1, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD2_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 2, \ this_method_does_not_take_2_arguments); \ GMOCK_MOCKER_(2, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(2, constness, Method).Invoke(gmock_a1, gmock_a2); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2) constness { \ GMOCK_MOCKER_(2, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(2, constness, Method).With(gmock_a1, gmock_a2); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(2, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD3_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 3, \ this_method_does_not_take_3_arguments); \ GMOCK_MOCKER_(3, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(3, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3) constness { \ GMOCK_MOCKER_(3, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(3, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(3, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD4_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 4, \ this_method_does_not_take_4_arguments); \ GMOCK_MOCKER_(4, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(4, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4) constness { \ GMOCK_MOCKER_(4, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(4, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(4, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD5_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 5, \ this_method_does_not_take_5_arguments); \ GMOCK_MOCKER_(5, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(5, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5) constness { \ GMOCK_MOCKER_(5, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(5, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(5, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD6_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 6, \ this_method_does_not_take_6_arguments); \ GMOCK_MOCKER_(6, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(6, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6) constness { \ GMOCK_MOCKER_(6, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(6, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(6, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD7_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 7, \ this_method_does_not_take_7_arguments); \ GMOCK_MOCKER_(7, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(7, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7) constness { \ GMOCK_MOCKER_(7, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(7, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(7, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD8_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 8, \ this_method_does_not_take_8_arguments); \ GMOCK_MOCKER_(8, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(8, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8) constness { \ GMOCK_MOCKER_(8, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(8, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(8, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD9_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8, \ GMOCK_ARG_(tn, F, 9) gmock_a9) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 9, \ this_method_does_not_take_9_arguments); \ GMOCK_MOCKER_(9, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(9, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, \ gmock_a9); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8, \ GMOCK_MATCHER_(tn, F, 9) gmock_a9) constness { \ GMOCK_MOCKER_(9, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(9, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, \ gmock_a9); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(9, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD10_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8, \ GMOCK_ARG_(tn, F, 9) gmock_a9, \ GMOCK_ARG_(tn, F, 10) gmock_a10) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 10, \ this_method_does_not_take_10_arguments); \ GMOCK_MOCKER_(10, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(10, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, gmock_a9, \ gmock_a10); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8, \ GMOCK_MATCHER_(tn, F, 9) gmock_a9, \ GMOCK_MATCHER_(tn, F, 10) gmock_a10) constness { \ GMOCK_MOCKER_(10, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(10, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, gmock_a9, \ gmock_a10); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(10, constness, Method) #define MOCK_METHOD0(m, F) GMOCK_METHOD0_(, , , m, F) #define MOCK_METHOD1(m, F) GMOCK_METHOD1_(, , , m, F) #define MOCK_METHOD2(m, F) GMOCK_METHOD2_(, , , m, F) #define MOCK_METHOD3(m, F) GMOCK_METHOD3_(, , , m, F) #define MOCK_METHOD4(m, F) GMOCK_METHOD4_(, , , m, F) #define MOCK_METHOD5(m, F) GMOCK_METHOD5_(, , , m, F) #define MOCK_METHOD6(m, F) GMOCK_METHOD6_(, , , m, F) #define MOCK_METHOD7(m, F) GMOCK_METHOD7_(, , , m, F) #define MOCK_METHOD8(m, F) GMOCK_METHOD8_(, , , m, F) #define MOCK_METHOD9(m, F) GMOCK_METHOD9_(, , , m, F) #define MOCK_METHOD10(m, F) GMOCK_METHOD10_(, , , m, F) #define MOCK_CONST_METHOD0(m, F) GMOCK_METHOD0_(, const, , m, F) #define MOCK_CONST_METHOD1(m, F) GMOCK_METHOD1_(, const, , m, F) #define MOCK_CONST_METHOD2(m, F) GMOCK_METHOD2_(, const, , m, F) #define MOCK_CONST_METHOD3(m, F) GMOCK_METHOD3_(, const, , m, F) #define MOCK_CONST_METHOD4(m, F) GMOCK_METHOD4_(, const, , m, F) #define MOCK_CONST_METHOD5(m, F) GMOCK_METHOD5_(, const, , m, F) #define MOCK_CONST_METHOD6(m, F) GMOCK_METHOD6_(, const, , m, F) #define MOCK_CONST_METHOD7(m, F) GMOCK_METHOD7_(, const, , m, F) #define MOCK_CONST_METHOD8(m, F) GMOCK_METHOD8_(, const, , m, F) #define MOCK_CONST_METHOD9(m, F) GMOCK_METHOD9_(, const, , m, F) #define MOCK_CONST_METHOD10(m, F) GMOCK_METHOD10_(, const, , m, F) #define MOCK_METHOD0_T(m, F) GMOCK_METHOD0_(typename, , , m, F) #define MOCK_METHOD1_T(m, F) GMOCK_METHOD1_(typename, , , m, F) #define MOCK_METHOD2_T(m, F) GMOCK_METHOD2_(typename, , , m, F) #define MOCK_METHOD3_T(m, F) GMOCK_METHOD3_(typename, , , m, F) #define MOCK_METHOD4_T(m, F) GMOCK_METHOD4_(typename, , , m, F) #define MOCK_METHOD5_T(m, F) GMOCK_METHOD5_(typename, , , m, F) #define MOCK_METHOD6_T(m, F) GMOCK_METHOD6_(typename, , , m, F) #define MOCK_METHOD7_T(m, F) GMOCK_METHOD7_(typename, , , m, F) #define MOCK_METHOD8_T(m, F) GMOCK_METHOD8_(typename, , , m, F) #define MOCK_METHOD9_T(m, F) GMOCK_METHOD9_(typename, , , m, F) #define MOCK_METHOD10_T(m, F) GMOCK_METHOD10_(typename, , , m, F) #define MOCK_CONST_METHOD0_T(m, F) GMOCK_METHOD0_(typename, const, , m, F) #define MOCK_CONST_METHOD1_T(m, F) GMOCK_METHOD1_(typename, const, , m, F) #define MOCK_CONST_METHOD2_T(m, F) GMOCK_METHOD2_(typename, const, , m, F) #define MOCK_CONST_METHOD3_T(m, F) GMOCK_METHOD3_(typename, const, , m, F) #define MOCK_CONST_METHOD4_T(m, F) GMOCK_METHOD4_(typename, const, , m, F) #define MOCK_CONST_METHOD5_T(m, F) GMOCK_METHOD5_(typename, const, , m, F) #define MOCK_CONST_METHOD6_T(m, F) GMOCK_METHOD6_(typename, const, , m, F) #define MOCK_CONST_METHOD7_T(m, F) GMOCK_METHOD7_(typename, const, , m, F) #define MOCK_CONST_METHOD8_T(m, F) GMOCK_METHOD8_(typename, const, , m, F) #define MOCK_CONST_METHOD9_T(m, F) GMOCK_METHOD9_(typename, const, , m, F) #define MOCK_CONST_METHOD10_T(m, F) GMOCK_METHOD10_(typename, const, , m, F) #define MOCK_METHOD0_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD0_(, , ct, m, F) #define MOCK_METHOD1_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD1_(, , ct, m, F) #define MOCK_METHOD2_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD2_(, , ct, m, F) #define MOCK_METHOD3_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD3_(, , ct, m, F) #define MOCK_METHOD4_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD4_(, , ct, m, F) #define MOCK_METHOD5_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD5_(, , ct, m, F) #define MOCK_METHOD6_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD6_(, , ct, m, F) #define MOCK_METHOD7_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD7_(, , ct, m, F) #define MOCK_METHOD8_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD8_(, , ct, m, F) #define MOCK_METHOD9_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD9_(, , ct, m, F) #define MOCK_METHOD10_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD10_(, , ct, m, F) #define MOCK_CONST_METHOD0_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(, const, ct, m, F) #define MOCK_CONST_METHOD1_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(, const, ct, m, F) #define MOCK_CONST_METHOD2_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(, const, ct, m, F) #define MOCK_CONST_METHOD3_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(, const, ct, m, F) #define MOCK_CONST_METHOD4_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(, const, ct, m, F) #define MOCK_CONST_METHOD5_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(, const, ct, m, F) #define MOCK_CONST_METHOD6_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(, const, ct, m, F) #define MOCK_CONST_METHOD7_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(, const, ct, m, F) #define MOCK_CONST_METHOD8_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(, const, ct, m, F) #define MOCK_CONST_METHOD9_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(, const, ct, m, F) #define MOCK_CONST_METHOD10_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(, const, ct, m, F) #define MOCK_METHOD0_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(typename, , ct, m, F) #define MOCK_METHOD1_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(typename, , ct, m, F) #define MOCK_METHOD2_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(typename, , ct, m, F) #define MOCK_METHOD3_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(typename, , ct, m, F) #define MOCK_METHOD4_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(typename, , ct, m, F) #define MOCK_METHOD5_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(typename, , ct, m, F) #define MOCK_METHOD6_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(typename, , ct, m, F) #define MOCK_METHOD7_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(typename, , ct, m, F) #define MOCK_METHOD8_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(typename, , ct, m, F) #define MOCK_METHOD9_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(typename, , ct, m, F) #define MOCK_METHOD10_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(typename, , ct, m, F) #define MOCK_CONST_METHOD0_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(typename, const, ct, m, F) #define MOCK_CONST_METHOD1_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(typename, const, ct, m, F) #define MOCK_CONST_METHOD2_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(typename, const, ct, m, F) #define MOCK_CONST_METHOD3_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(typename, const, ct, m, F) #define MOCK_CONST_METHOD4_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(typename, const, ct, m, F) #define MOCK_CONST_METHOD5_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(typename, const, ct, m, F) #define MOCK_CONST_METHOD6_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(typename, const, ct, m, F) #define MOCK_CONST_METHOD7_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(typename, const, ct, m, F) #define MOCK_CONST_METHOD8_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(typename, const, ct, m, F) #define MOCK_CONST_METHOD9_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(typename, const, ct, m, F) #define MOCK_CONST_METHOD10_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(typename, const, ct, m, F) // A MockFunction class has one mock method whose type is F. It is // useful when you just want your test code to emit some messages and // have Google Mock verify the right messages are sent (and perhaps at // the right times). For example, if you are exercising code: // // Foo(1); // Foo(2); // Foo(3); // // and want to verify that Foo(1) and Foo(3) both invoke // mock.Bar("a"), but Foo(2) doesn't invoke anything, you can write: // // TEST(FooTest, InvokesBarCorrectly) { // MyMock mock; // MockFunction check; // { // InSequence s; // // EXPECT_CALL(mock, Bar("a")); // EXPECT_CALL(check, Call("1")); // EXPECT_CALL(check, Call("2")); // EXPECT_CALL(mock, Bar("a")); // } // Foo(1); // check.Call("1"); // Foo(2); // check.Call("2"); // Foo(3); // } // // The expectation spec says that the first Bar("a") must happen // before check point "1", the second Bar("a") must happen after check // point "2", and nothing should happen between the two check // points. The explicit check points make it easy to tell which // Bar("a") is called by which call to Foo(). template class MockFunction; template class MockFunction { public: MockFunction() {} MOCK_METHOD0_T(Call, R()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD1_T(Call, R(A0)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD2_T(Call, R(A0, A1)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD3_T(Call, R(A0, A1, A2)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD4_T(Call, R(A0, A1, A2, A3)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD5_T(Call, R(A0, A1, A2, A3, A4)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD6_T(Call, R(A0, A1, A2, A3, A4, A5)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD7_T(Call, R(A0, A1, A2, A3, A4, A5, A6)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD8_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD9_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7, A8)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD10_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ // This file was GENERATED by command: // pump.py gmock-generated-matchers.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic matchers. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #include #include #include namespace testing { namespace internal { // The type of the i-th (0-based) field of Tuple. #define GMOCK_FIELD_TYPE_(Tuple, i) \ typename ::std::tr1::tuple_element::type // TupleFields is for selecting fields from a // tuple of type Tuple. It has two members: // // type: a tuple type whose i-th field is the ki-th field of Tuple. // GetSelectedFields(t): returns fields k0, ..., and kn of t as a tuple. // // For example, in class TupleFields, 2, 0>, we have: // // type is tuple, and // GetSelectedFields(make_tuple(true, 'a', 42)) is (42, true). template class TupleFields; // This generic version is used when there are 10 selectors. template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; // The following specialization is used for 0 ~ 9 selectors. template class TupleFields { public: typedef ::std::tr1::tuple<> type; static type GetSelectedFields(const Tuple& /* t */) { using ::std::tr1::get; return type(); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; #undef GMOCK_FIELD_TYPE_ // Implements the Args() matcher. template class ArgsMatcherImpl : public MatcherInterface { public: // ArgsTuple may have top-level const or reference modifiers. typedef GTEST_REMOVE_REFERENCE_AND_CONST_(ArgsTuple) RawArgsTuple; typedef typename internal::TupleFields::type SelectedArgs; typedef Matcher MonomorphicInnerMatcher; template explicit ArgsMatcherImpl(const InnerMatcher& inner_matcher) : inner_matcher_(SafeMatcherCast(inner_matcher)) {} virtual bool MatchAndExplain(ArgsTuple args, MatchResultListener* listener) const { const SelectedArgs& selected_args = GetSelectedArgs(args); if (!listener->IsInterested()) return inner_matcher_.Matches(selected_args); PrintIndices(listener->stream()); *listener << "are " << PrintToString(selected_args); StringMatchResultListener inner_listener; const bool match = inner_matcher_.MatchAndExplain(selected_args, &inner_listener); PrintIfNotEmpty(inner_listener.str(), listener->stream()); return match; } virtual void DescribeTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeNegationTo(os); } private: static SelectedArgs GetSelectedArgs(ArgsTuple args) { return TupleFields::GetSelectedFields(args); } // Prints the indices of the selected fields. static void PrintIndices(::std::ostream* os) { *os << "whose fields ("; const int indices[10] = { k0, k1, k2, k3, k4, k5, k6, k7, k8, k9 }; for (int i = 0; i < 10; i++) { if (indices[i] < 0) break; if (i >= 1) *os << ", "; *os << "#" << indices[i]; } *os << ") "; } const MonomorphicInnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcherImpl); }; template class ArgsMatcher { public: explicit ArgsMatcher(const InnerMatcher& inner_matcher) : inner_matcher_(inner_matcher) {} template operator Matcher() const { return MakeMatcher(new ArgsMatcherImpl(inner_matcher_)); } private: const InnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcher); }; // Implements ElementsAre() of 1-10 arguments. template class ElementsAreMatcher1 { public: explicit ElementsAreMatcher1(const T1& e1) : e1_(e1) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; // Nokia's Symbian Compiler has a nasty bug where the object put // in a one-element local array is not destructed when the array // goes out of scope. This leads to obvious badness as we've // added the linked_ptr in it to our other linked_ptrs list. // Hence we implement ElementsAreMatcher1 specially to avoid using // a local array. const Matcher matcher = MatcherCast(e1_); return MakeMatcher(new ElementsAreMatcherImpl(&matcher, 1)); } private: const T1& e1_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher1); }; template class ElementsAreMatcher2 { public: ElementsAreMatcher2(const T1& e1, const T2& e2) : e1_(e1), e2_(e2) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 2)); } private: const T1& e1_; const T2& e2_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher2); }; template class ElementsAreMatcher3 { public: ElementsAreMatcher3(const T1& e1, const T2& e2, const T3& e3) : e1_(e1), e2_(e2), e3_(e3) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 3)); } private: const T1& e1_; const T2& e2_; const T3& e3_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher3); }; template class ElementsAreMatcher4 { public: ElementsAreMatcher4(const T1& e1, const T2& e2, const T3& e3, const T4& e4) : e1_(e1), e2_(e2), e3_(e3), e4_(e4) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 4)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher4); }; template class ElementsAreMatcher5 { public: ElementsAreMatcher5(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 5)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher5); }; template class ElementsAreMatcher6 { public: ElementsAreMatcher6(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 6)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher6); }; template class ElementsAreMatcher7 { public: ElementsAreMatcher7(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 7)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher7); }; template class ElementsAreMatcher8 { public: ElementsAreMatcher8(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 8)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher8); }; template class ElementsAreMatcher9 { public: ElementsAreMatcher9(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8), e9_(e9) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), MatcherCast(e9_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 9)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; const T9& e9_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher9); }; template class ElementsAreMatcher10 { public: ElementsAreMatcher10(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9, const T10& e10) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8), e9_(e9), e10_(e10) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), MatcherCast(e9_), MatcherCast(e10_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 10)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; const T9& e9_; const T10& e10_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher10); }; } // namespace internal // Args(a_matcher) matches a tuple if the selected // fields of it matches a_matcher. C++ doesn't support default // arguments for function templates, so we have to overload it. template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } // ElementsAre(e0, e1, ..., e_n) matches an STL-style container with // (n + 1) elements, where the i-th element in the container must // match the i-th argument in the list. Each argument of // ElementsAre() can be either a value or a matcher. We support up to // 10 arguments. // // NOTE: Since ElementsAre() cares about the order of the elements, it // must not be used with containers whose elements's order is // undefined (e.g. hash_map). inline internal::ElementsAreMatcher0 ElementsAre() { return internal::ElementsAreMatcher0(); } template inline internal::ElementsAreMatcher1 ElementsAre(const T1& e1) { return internal::ElementsAreMatcher1(e1); } template inline internal::ElementsAreMatcher2 ElementsAre(const T1& e1, const T2& e2) { return internal::ElementsAreMatcher2(e1, e2); } template inline internal::ElementsAreMatcher3 ElementsAre(const T1& e1, const T2& e2, const T3& e3) { return internal::ElementsAreMatcher3(e1, e2, e3); } template inline internal::ElementsAreMatcher4 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4) { return internal::ElementsAreMatcher4(e1, e2, e3, e4); } template inline internal::ElementsAreMatcher5 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5) { return internal::ElementsAreMatcher5(e1, e2, e3, e4, e5); } template inline internal::ElementsAreMatcher6 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6) { return internal::ElementsAreMatcher6(e1, e2, e3, e4, e5, e6); } template inline internal::ElementsAreMatcher7 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7) { return internal::ElementsAreMatcher7(e1, e2, e3, e4, e5, e6, e7); } template inline internal::ElementsAreMatcher8 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8) { return internal::ElementsAreMatcher8(e1, e2, e3, e4, e5, e6, e7, e8); } template inline internal::ElementsAreMatcher9 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) { return internal::ElementsAreMatcher9(e1, e2, e3, e4, e5, e6, e7, e8, e9); } template inline internal::ElementsAreMatcher10 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9, const T10& e10) { return internal::ElementsAreMatcher10(e1, e2, e3, e4, e5, e6, e7, e8, e9, e10); } // ElementsAreArray(array) and ElementAreArray(array, count) are like // ElementsAre(), except that they take an array of values or // matchers. The former form infers the size of 'array', which must // be a static C-style array. In the latter form, 'array' can either // be a static array or a pointer to a dynamically created array. template inline internal::ElementsAreArrayMatcher ElementsAreArray( const T* first, size_t count) { return internal::ElementsAreArrayMatcher(first, count); } template inline internal::ElementsAreArrayMatcher ElementsAreArray(const T (&array)[N]) { return internal::ElementsAreArrayMatcher(array, N); } // AllOf(m1, m2, ..., mk) matches any value that matches all of the given // sub-matchers. AllOf is called fully qualified to prevent ADL from firing. template inline internal::BothOfMatcher AllOf(Matcher1 m1, Matcher2 m2) { return internal::BothOfMatcher(m1, m2); } template inline internal::BothOfMatcher > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3)); } template inline internal::BothOfMatcher > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4)); } template inline internal::BothOfMatcher > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5)); } template inline internal::BothOfMatcher > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6)); } template inline internal::BothOfMatcher > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7)); } template inline internal::BothOfMatcher > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8)); } template inline internal::BothOfMatcher > > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8, m9)); } template inline internal::BothOfMatcher > > > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9, Matcher10 m10) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8, m9, m10)); } // AnyOf(m1, m2, ..., mk) matches any value that matches any of the given // sub-matchers. AnyOf is called fully qualified to prevent ADL from firing. template inline internal::EitherOfMatcher AnyOf(Matcher1 m1, Matcher2 m2) { return internal::EitherOfMatcher(m1, m2); } template inline internal::EitherOfMatcher > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3)); } template inline internal::EitherOfMatcher > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4)); } template inline internal::EitherOfMatcher > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5)); } template inline internal::EitherOfMatcher > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6)); } template inline internal::EitherOfMatcher > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7)); } template inline internal::EitherOfMatcher > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8)); } template inline internal::EitherOfMatcher > > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8, m9)); } template inline internal::EitherOfMatcher > > > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9, Matcher10 m10) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8, m9, m10)); } } // namespace testing // The MATCHER* family of macros can be used in a namespace scope to // define custom matchers easily. // // Basic Usage // =========== // // The syntax // // MATCHER(name, description_string) { statements; } // // defines a matcher with the given name that executes the statements, // which must return a bool to indicate if the match succeeds. Inside // the statements, you can refer to the value being matched by 'arg', // and refer to its type by 'arg_type'. // // The description string documents what the matcher does, and is used // to generate the failure message when the match fails. Since a // MATCHER() is usually defined in a header file shared by multiple // C++ source files, we require the description to be a C-string // literal to avoid possible side effects. It can be empty, in which // case we'll use the sequence of words in the matcher name as the // description. // // For example: // // MATCHER(IsEven, "") { return (arg % 2) == 0; } // // allows you to write // // // Expects mock_foo.Bar(n) to be called where n is even. // EXPECT_CALL(mock_foo, Bar(IsEven())); // // or, // // // Verifies that the value of some_expression is even. // EXPECT_THAT(some_expression, IsEven()); // // If the above assertion fails, it will print something like: // // Value of: some_expression // Expected: is even // Actual: 7 // // where the description "is even" is automatically calculated from the // matcher name IsEven. // // Argument Type // ============= // // Note that the type of the value being matched (arg_type) is // determined by the context in which you use the matcher and is // supplied to you by the compiler, so you don't need to worry about // declaring it (nor can you). This allows the matcher to be // polymorphic. For example, IsEven() can be used to match any type // where the value of "(arg % 2) == 0" can be implicitly converted to // a bool. In the "Bar(IsEven())" example above, if method Bar() // takes an int, 'arg_type' will be int; if it takes an unsigned long, // 'arg_type' will be unsigned long; and so on. // // Parameterizing Matchers // ======================= // // Sometimes you'll want to parameterize the matcher. For that you // can use another macro: // // MATCHER_P(name, param_name, description_string) { statements; } // // For example: // // MATCHER_P(HasAbsoluteValue, value, "") { return abs(arg) == value; } // // will allow you to write: // // EXPECT_THAT(Blah("a"), HasAbsoluteValue(n)); // // which may lead to this message (assuming n is 10): // // Value of: Blah("a") // Expected: has absolute value 10 // Actual: -9 // // Note that both the matcher description and its parameter are // printed, making the message human-friendly. // // In the matcher definition body, you can write 'foo_type' to // reference the type of a parameter named 'foo'. For example, in the // body of MATCHER_P(HasAbsoluteValue, value) above, you can write // 'value_type' to refer to the type of 'value'. // // We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P10 to // support multi-parameter matchers. // // Describing Parameterized Matchers // ================================= // // The last argument to MATCHER*() is a string-typed expression. The // expression can reference all of the matcher's parameters and a // special bool-typed variable named 'negation'. When 'negation' is // false, the expression should evaluate to the matcher's description; // otherwise it should evaluate to the description of the negation of // the matcher. For example, // // using testing::PrintToString; // // MATCHER_P2(InClosedRange, low, hi, // string(negation ? "is not" : "is") + " in range [" + // PrintToString(low) + ", " + PrintToString(hi) + "]") { // return low <= arg && arg <= hi; // } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: is in range [4, 6] // ... // Expected: is not in range [2, 4] // // If you specify "" as the description, the failure message will // contain the sequence of words in the matcher name followed by the // parameter values printed as a tuple. For example, // // MATCHER_P2(InClosedRange, low, hi, "") { ... } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: in closed range (4, 6) // ... // Expected: not (in closed range (2, 4)) // // Types of Matcher Parameters // =========================== // // For the purpose of typing, you can view // // MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... } // // as shorthand for // // template // FooMatcherPk // Foo(p1_type p1, ..., pk_type pk) { ... } // // When you write Foo(v1, ..., vk), the compiler infers the types of // the parameters v1, ..., and vk for you. If you are not happy with // the result of the type inference, you can specify the types by // explicitly instantiating the template, as in Foo(5, // false). As said earlier, you don't get to (or need to) specify // 'arg_type' as that's determined by the context in which the matcher // is used. You can assign the result of expression Foo(p1, ..., pk) // to a variable of type FooMatcherPk. This // can be useful when composing matchers. // // While you can instantiate a matcher template with reference types, // passing the parameters by pointer usually makes your code more // readable. If, however, you still want to pass a parameter by // reference, be aware that in the failure message generated by the // matcher you will see the value of the referenced object but not its // address. // // Explaining Match Results // ======================== // // Sometimes the matcher description alone isn't enough to explain why // the match has failed or succeeded. For example, when expecting a // long string, it can be very helpful to also print the diff between // the expected string and the actual one. To achieve that, you can // optionally stream additional information to a special variable // named result_listener, whose type is a pointer to class // MatchResultListener: // // MATCHER_P(EqualsLongString, str, "") { // if (arg == str) return true; // // *result_listener << "the difference: " /// << DiffStrings(str, arg); // return false; // } // // Overloading Matchers // ==================== // // You can overload matchers with different numbers of parameters: // // MATCHER_P(Blah, a, description_string1) { ... } // MATCHER_P2(Blah, a, b, description_string2) { ... } // // Caveats // ======= // // When defining a new matcher, you should also consider implementing // MatcherInterface or using MakePolymorphicMatcher(). These // approaches require more work than the MATCHER* macros, but also // give you more control on the types of the value being matched and // the matcher parameters, which may leads to better compiler error // messages when the matcher is used wrong. They also allow // overloading matchers based on parameter types (as opposed to just // based on the number of parameters). // // MATCHER*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using MATCHER*() inside // a function. // // More Information // ================ // // To learn more about using these macros, please search for 'MATCHER' // on http://code.google.com/p/googlemock/wiki/CookBook. #define MATCHER(name, description)\ class name##Matcher {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl()\ {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple<>()));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl());\ }\ name##Matcher() {\ }\ private:\ GTEST_DISALLOW_ASSIGN_(name##Matcher);\ };\ inline name##Matcher name() {\ return name##Matcher();\ }\ template \ bool name##Matcher::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P(name, p0, description)\ template \ class name##MatcherP {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ explicit gmock_Impl(p0##_type gmock_p0)\ : p0(gmock_p0) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0));\ }\ name##MatcherP(p0##_type gmock_p0) : p0(gmock_p0) {\ }\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP);\ };\ template \ inline name##MatcherP name(p0##_type p0) {\ return name##MatcherP(p0);\ }\ template \ template \ bool name##MatcherP::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P2(name, p0, p1, description)\ template \ class name##MatcherP2 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1)\ : p0(gmock_p0), p1(gmock_p1) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1));\ }\ name##MatcherP2(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {\ }\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP2);\ };\ template \ inline name##MatcherP2 name(p0##_type p0, \ p1##_type p1) {\ return name##MatcherP2(p0, p1);\ }\ template \ template \ bool name##MatcherP2::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P3(name, p0, p1, p2, description)\ template \ class name##MatcherP3 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, \ p2)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2));\ }\ name##MatcherP3(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP3);\ };\ template \ inline name##MatcherP3 name(p0##_type p0, \ p1##_type p1, p2##_type p2) {\ return name##MatcherP3(p0, p1, p2);\ }\ template \ template \ bool name##MatcherP3::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P4(name, p0, p1, p2, p3, description)\ template \ class name##MatcherP4 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3));\ }\ name##MatcherP4(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP4);\ };\ template \ inline name##MatcherP4 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3) {\ return name##MatcherP4(p0, \ p1, p2, p3);\ }\ template \ template \ bool name##MatcherP4::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P5(name, p0, p1, p2, p3, p4, description)\ template \ class name##MatcherP5 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4));\ }\ name##MatcherP5(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, \ p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP5);\ };\ template \ inline name##MatcherP5 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4) {\ return name##MatcherP5(p0, p1, p2, p3, p4);\ }\ template \ template \ bool name##MatcherP5::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P6(name, p0, p1, p2, p3, p4, p5, description)\ template \ class name##MatcherP6 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5));\ }\ name##MatcherP6(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP6);\ };\ template \ inline name##MatcherP6 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3, p4##_type p4, p5##_type p5) {\ return name##MatcherP6(p0, p1, p2, p3, p4, p5);\ }\ template \ template \ bool name##MatcherP6::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P7(name, p0, p1, p2, p3, p4, p5, p6, description)\ template \ class name##MatcherP7 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, \ p6)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6));\ }\ name##MatcherP7(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), \ p6(gmock_p6) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP7);\ };\ template \ inline name##MatcherP7 name(p0##_type p0, p1##_type p1, \ p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6) {\ return name##MatcherP7(p0, p1, p2, p3, p4, p5, p6);\ }\ template \ template \ bool name##MatcherP7::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P8(name, p0, p1, p2, p3, p4, p5, p6, p7, description)\ template \ class name##MatcherP8 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, \ p3, p4, p5, p6, p7)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7));\ }\ name##MatcherP8(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, \ p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP8);\ };\ template \ inline name##MatcherP8 name(p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6, p7##_type p7) {\ return name##MatcherP8(p0, p1, p2, p3, p4, p5, \ p6, p7);\ }\ template \ template \ bool name##MatcherP8::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P9(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, description)\ template \ class name##MatcherP9 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, p6, p7, p8)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7, p8));\ }\ name##MatcherP9(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP9);\ };\ template \ inline name##MatcherP9 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, \ p8##_type p8) {\ return name##MatcherP9(p0, p1, p2, \ p3, p4, p5, p6, p7, p8);\ }\ template \ template \ bool name##MatcherP9::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P10(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, description)\ template \ class name##MatcherP10 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8), p9(gmock_p9) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9));\ }\ name##MatcherP10(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8, p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP10);\ };\ template \ inline name##MatcherP10 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9) {\ return name##MatcherP10(p0, \ p1, p2, p3, p4, p5, p6, p7, p8, p9);\ }\ template \ template \ bool name##MatcherP10::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some actions that depend on gmock-generated-actions.h. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ #include namespace testing { namespace internal { // Implements the Invoke(f) action. The template argument // FunctionImpl is the implementation type of f, which can be either a // function pointer or a functor. Invoke(f) can be used as an // Action as long as f's type is compatible with F (i.e. f can be // assigned to a tr1::function). template class InvokeAction { public: // The c'tor makes a copy of function_impl (either a function // pointer or a functor). explicit InvokeAction(FunctionImpl function_impl) : function_impl_(function_impl) {} template Result Perform(const ArgumentTuple& args) { return InvokeHelper::Invoke(function_impl_, args); } private: FunctionImpl function_impl_; GTEST_DISALLOW_ASSIGN_(InvokeAction); }; // Implements the Invoke(object_ptr, &Class::Method) action. template class InvokeMethodAction { public: InvokeMethodAction(Class* obj_ptr, MethodPtr method_ptr) : obj_ptr_(obj_ptr), method_ptr_(method_ptr) {} template Result Perform(const ArgumentTuple& args) const { return InvokeHelper::InvokeMethod( obj_ptr_, method_ptr_, args); } private: Class* const obj_ptr_; const MethodPtr method_ptr_; GTEST_DISALLOW_ASSIGN_(InvokeMethodAction); }; } // namespace internal // Various overloads for Invoke(). // Creates an action that invokes 'function_impl' with the mock // function's arguments. template PolymorphicAction > Invoke( FunctionImpl function_impl) { return MakePolymorphicAction( internal::InvokeAction(function_impl)); } // Creates an action that invokes the given method on the given object // with the mock function's arguments. template PolymorphicAction > Invoke( Class* obj_ptr, MethodPtr method_ptr) { return MakePolymorphicAction( internal::InvokeMethodAction(obj_ptr, method_ptr)); } // WithoutArgs(inner_action) can be used in a mock function with a // non-empty argument list to perform inner_action, which takes no // argument. In other words, it adapts an action accepting no // argument to one that accepts (and ignores) arguments. template inline internal::WithArgsAction WithoutArgs(const InnerAction& action) { return internal::WithArgsAction(action); } // WithArg(an_action) creates an action that passes the k-th // (0-based) argument of the mock function to an_action and performs // it. It adapts an action accepting one argument to one that accepts // multiple arguments. For convenience, we also provide // WithArgs(an_action) (defined below) as a synonym. template inline internal::WithArgsAction WithArg(const InnerAction& action) { return internal::WithArgsAction(action); } // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Action ReturnArg() returns the k-th argument of the mock function. ACTION_TEMPLATE(ReturnArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { return std::tr1::get(args); } // Action SaveArg(pointer) saves the k-th (0-based) argument of the // mock function to *pointer. ACTION_TEMPLATE(SaveArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(pointer)) { *pointer = ::std::tr1::get(args); } // Action SaveArgPointee(pointer) saves the value pointed to // by the k-th (0-based) argument of the mock function to *pointer. ACTION_TEMPLATE(SaveArgPointee, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(pointer)) { *pointer = *::std::tr1::get(args); } // Action SetArgReferee(value) assigns 'value' to the variable // referenced by the k-th (0-based) argument of the mock function. ACTION_TEMPLATE(SetArgReferee, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(value)) { typedef typename ::std::tr1::tuple_element::type argk_type; // Ensures that argument #k is a reference. If you get a compiler // error on the next line, you are using SetArgReferee(value) in // a mock function whose k-th (0-based) argument is not a reference. GTEST_COMPILE_ASSERT_(internal::is_reference::value, SetArgReferee_must_be_used_with_a_reference_argument); ::std::tr1::get(args) = value; } // Action SetArrayArgument(first, last) copies the elements in // source range [first, last) to the array pointed to by the k-th // (0-based) argument, which can be either a pointer or an // iterator. The action does not take ownership of the elements in the // source range. ACTION_TEMPLATE(SetArrayArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_2_VALUE_PARAMS(first, last)) { // Microsoft compiler deprecates ::std::copy, so we want to suppress warning // 4996 (Function call with parameters that may be unsafe) there. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. #endif ::std::copy(first, last, ::std::tr1::get(args)); #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif } // Action DeleteArg() deletes the k-th (0-based) argument of the mock // function. ACTION_TEMPLATE(DeleteArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { delete ::std::tr1::get(args); } // This action returns the value pointed to by 'pointer'. ACTION_P(ReturnPointee, pointer) { return *pointer; } // Action Throw(exception) can be used in a mock function of any type // to throw the given exception. Any copyable value can be thrown. #if GTEST_HAS_EXCEPTIONS // Suppresses the 'unreachable code' warning that VC generates in opt modes. # ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4702) // Temporarily disables warning 4702. # endif ACTION_P(Throw, exception) { throw exception; } # ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. # endif #endif // GTEST_HAS_EXCEPTIONS #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements class templates NiceMock and StrictMock. // // Given a mock class MockFoo that is created using Google Mock, // NiceMock is a subclass of MockFoo that allows // uninteresting calls (i.e. calls to mock methods that have no // EXPECT_CALL specs), and StrictMock is a subclass of // MockFoo that treats all uninteresting calls as errors. // // NiceMock and StrictMock "inherits" the constructors of their // respective base class, with up-to 10 arguments. Therefore you can // write NiceMock(5, "a") to construct a nice mock where // MockFoo has a constructor that accepts (int, const char*), for // example. // // A known limitation is that NiceMock and // StrictMock only works for mock methods defined using the // MOCK_METHOD* family of macros DIRECTLY in the MockFoo class. If a // mock method is defined in a base class of MockFoo, the "nice" or // "strict" modifier may not affect it, depending on the compiler. In // particular, nesting NiceMock and StrictMock is NOT supported. // // Another known limitation is that the constructors of the base mock // cannot have arguments passed by non-const reference, which are // banned by the Google C++ style guide anyway. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ namespace testing { template class NiceMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. NiceMock() { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } // C++ doesn't (yet) allow inheritance of constructors, so we have // to define it for each arity. template explicit NiceMock(const A1& a1) : MockClass(a1) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2) : MockClass(a1, a2) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4) : MockClass(a1, a2, a3, a4) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5) : MockClass(a1, a2, a3, a4, a5) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5, a6, a7) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9, const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } virtual ~NiceMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(NiceMock); }; template class StrictMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. StrictMock() { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template explicit StrictMock(const A1& a1) : MockClass(a1) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2) : MockClass(a1, a2) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4) : MockClass(a1, a2, a3, a4) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5) : MockClass(a1, a2, a3, a4, a5) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5, a6, a7) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9, const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } virtual ~StrictMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(StrictMock); }; // The following specializations catch some (relatively more common) // user errors of nesting nice and strict mocks. They do NOT catch // all possible errors. // These specializations are declared but not defined, as NiceMock and // StrictMock cannot be nested. template class NiceMock >; template class NiceMock >; template class StrictMock >; template class StrictMock >; } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ namespace testing { // Declares Google Mock flags that we want a user to use programmatically. GMOCK_DECLARE_bool_(catch_leaked_mocks); GMOCK_DECLARE_string_(verbose); // Initializes Google Mock. This must be called before running the // tests. In particular, it parses the command line for the flags // that Google Mock recognizes. Whenever a Google Mock flag is seen, // it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Mock flag variables are // updated. // // Since Google Test is needed for Google Mock to work, this function // also initializes Google Test and parses its flags, if that hasn't // been done. void InitGoogleMock(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleMock(int* argc, wchar_t** argv); } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gmock_main.cc0000600000175000017500000000501311561126632023717 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include "gmock/gmock.h" #include "gtest/gtest.h" // MS C++ compiler/linker has a bug on Windows (not on Windows CE), which // causes a link error when _tmain is defined in a static library and UNICODE // is enabled. For this reason instead of _tmain, main function is used on // Windows. See the following link to track the current status of this bug: // http://connect.microsoft.com/VisualStudio/feedback/ViewFeedback.aspx?FeedbackID=394464 // NOLINT #if GTEST_OS_WINDOWS_MOBILE # include // NOLINT int _tmain(int argc, TCHAR** argv) { #else int main(int argc, char** argv) { #endif // GTEST_OS_WINDOWS_MOBILE std::cout << "Running main() from gmock_main.cc\n"; // Since Google Mock depends on Google Test, InitGoogleMock() is // also responsible for initializing Google Test. Therefore there's // no need for calling testing::InitGoogleTest() separately. testing::InitGoogleMock(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gtest/0000700000175000017500000000000012140644175022432 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/fused-src/gtest/gtest.h0000600000175000017500000303564411561126632023751 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for Google Test. It should be // included by any test program that uses Google Test. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! // // Acknowledgment: Google Test borrowed the idea of automatic test // registration from Barthelemy Dagenais' (barthelemy@prologique.com) // easyUnit framework. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_H_ #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares functions and macros used internally by // Google Test. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan) // // Low-level types and utilities for porting Google Test to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ // The user can define the following macros in the build script to // control Google Test's behavior. If the user doesn't define a macro // in this list, Google Test will define it. // // GTEST_HAS_CLONE - Define it to 1/0 to indicate that clone(2) // is/isn't available. // GTEST_HAS_EXCEPTIONS - Define it to 1/0 to indicate that exceptions // are enabled. // GTEST_HAS_GLOBAL_STRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::string, which is different to std::string). // GTEST_HAS_GLOBAL_WSTRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::wstring, which is different to std::wstring). // GTEST_HAS_POSIX_RE - Define it to 1/0 to indicate that POSIX regular // expressions are/aren't available. // GTEST_HAS_PTHREAD - Define it to 1/0 to indicate that // is/isn't available. // GTEST_HAS_RTTI - Define it to 1/0 to indicate that RTTI is/isn't // enabled. // GTEST_HAS_STD_WSTRING - Define it to 1/0 to indicate that // std::wstring does/doesn't work (Google Test can // be used where std::wstring is unavailable). // GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple // is/isn't available. // GTEST_HAS_SEH - Define it to 1/0 to indicate whether the // compiler supports Microsoft's "Structured // Exception Handling". // GTEST_HAS_STREAM_REDIRECTION // - Define it to 1/0 to indicate whether the // platform supports I/O stream redirection using // dup() and dup2(). // GTEST_USE_OWN_TR1_TUPLE - Define it to 1/0 to indicate whether Google // Test's own tr1 tuple implementation should be // used. Unused when the user sets // GTEST_HAS_TR1_TUPLE to 0. // GTEST_LINKED_AS_SHARED_LIBRARY // - Define to 1 when compiling tests that use // Google Test as a shared library (known as // DLL on Windows). // GTEST_CREATE_SHARED_LIBRARY // - Define to 1 when compiling Google Test itself // as a shared library. // This header defines the following utilities: // // Macros indicating the current platform (defined to 1 if compiled on // the given platform; otherwise undefined): // GTEST_OS_AIX - IBM AIX // GTEST_OS_CYGWIN - Cygwin // GTEST_OS_HPUX - HP-UX // GTEST_OS_LINUX - Linux // GTEST_OS_LINUX_ANDROID - Google Android // GTEST_OS_MAC - Mac OS X // GTEST_OS_NACL - Google Native Client (NaCl) // GTEST_OS_SOLARIS - Sun Solaris // GTEST_OS_SYMBIAN - Symbian // GTEST_OS_WINDOWS - Windows (Desktop, MinGW, or Mobile) // GTEST_OS_WINDOWS_DESKTOP - Windows Desktop // GTEST_OS_WINDOWS_MINGW - MinGW // GTEST_OS_WINDOWS_MOBILE - Windows Mobile // GTEST_OS_ZOS - z/OS // // Among the platforms, Cygwin, Linux, Max OS X, and Windows have the // most stable support. Since core members of the Google Test project // don't have access to other platforms, support for them may be less // stable. If you notice any problems on your platform, please notify // googletestframework@googlegroups.com (patches for fixing them are // even more welcome!). // // Note that it is possible that none of the GTEST_OS_* macros are defined. // // Macros indicating available Google Test features (defined to 1 if // the corresponding feature is supported; otherwise undefined): // GTEST_HAS_COMBINE - the Combine() function (for value-parameterized // tests) // GTEST_HAS_DEATH_TEST - death tests // GTEST_HAS_PARAM_TEST - value-parameterized tests // GTEST_HAS_TYPED_TEST - typed tests // GTEST_HAS_TYPED_TEST_P - type-parameterized tests // GTEST_USES_POSIX_RE - enhanced POSIX regex is used. Do not confuse with // GTEST_HAS_POSIX_RE (see above) which users can // define themselves. // GTEST_USES_SIMPLE_RE - our own simple regex is used; // the above two are mutually exclusive. // GTEST_CAN_COMPARE_NULL - accepts untyped NULL in EXPECT_EQ(). // // Macros for basic C++ coding: // GTEST_AMBIGUOUS_ELSE_BLOCKER_ - for disabling a gcc warning. // GTEST_ATTRIBUTE_UNUSED_ - declares that a class' instances or a // variable don't have to be used. // GTEST_DISALLOW_ASSIGN_ - disables operator=. // GTEST_DISALLOW_COPY_AND_ASSIGN_ - disables copy ctor and operator=. // GTEST_MUST_USE_RESULT_ - declares that a function's result must be used. // // Synchronization: // Mutex, MutexLock, ThreadLocal, GetThreadCount() // - synchronization primitives. // GTEST_IS_THREADSAFE - defined to 1 to indicate that the above // synchronization primitives have real implementations // and Google Test is thread-safe; or 0 otherwise. // // Template meta programming: // is_pointer - as in TR1; needed on Symbian and IBM XL C/C++ only. // IteratorTraits - partial implementation of std::iterator_traits, which // is not available in libCstd when compiled with Sun C++. // // Smart pointers: // scoped_ptr - as in TR2. // // Regular expressions: // RE - a simple regular expression class using the POSIX // Extended Regular Expression syntax on UNIX-like // platforms, or a reduced regular exception syntax on // other platforms, including Windows. // // Logging: // GTEST_LOG_() - logs messages at the specified severity level. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. // // Stdout and stderr capturing: // CaptureStdout() - starts capturing stdout. // GetCapturedStdout() - stops capturing stdout and returns the captured // string. // CaptureStderr() - starts capturing stderr. // GetCapturedStderr() - stops capturing stderr and returns the captured // string. // // Integer types: // TypeWithSize - maps an integer to a int type. // Int32, UInt32, Int64, UInt64, TimeInMillis // - integers of known sizes. // BiggestInt - the biggest signed integer type. // // Command-line utilities: // GTEST_FLAG() - references a flag. // GTEST_DECLARE_*() - declares a flag. // GTEST_DEFINE_*() - defines a flag. // GetArgvs() - returns the command line as a vector of strings. // // Environment variable utilities: // GetEnv() - gets the value of an environment variable. // BoolFromGTestEnv() - parses a bool environment variable. // Int32FromGTestEnv() - parses an Int32 environment variable. // StringFromGTestEnv() - parses a string environment variable. #include // for isspace, etc #include // for ptrdiff_t #include #include #include #ifndef _WIN32_WCE # include # include #endif // !_WIN32_WCE #include // NOLINT #include // NOLINT #include // NOLINT #define GTEST_DEV_EMAIL_ "googletestframework@@googlegroups.com" #define GTEST_FLAG_PREFIX_ "gtest_" #define GTEST_FLAG_PREFIX_DASH_ "gtest-" #define GTEST_FLAG_PREFIX_UPPER_ "GTEST_" #define GTEST_NAME_ "Google Test" #define GTEST_PROJECT_URL_ "http://code.google.com/p/googletest/" // Determines the version of gcc that is used to compile this. #ifdef __GNUC__ // 40302 means version 4.3.2. # define GTEST_GCC_VER_ \ (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__) #endif // __GNUC__ // Determines the platform on which Google Test is compiled. #ifdef __CYGWIN__ # define GTEST_OS_CYGWIN 1 #elif defined __SYMBIAN32__ # define GTEST_OS_SYMBIAN 1 #elif defined _WIN32 # define GTEST_OS_WINDOWS 1 # ifdef _WIN32_WCE # define GTEST_OS_WINDOWS_MOBILE 1 # elif defined(__MINGW__) || defined(__MINGW32__) # define GTEST_OS_WINDOWS_MINGW 1 # else # define GTEST_OS_WINDOWS_DESKTOP 1 # endif // _WIN32_WCE #elif defined __APPLE__ # define GTEST_OS_MAC 1 #elif defined __linux__ # define GTEST_OS_LINUX 1 # ifdef ANDROID # define GTEST_OS_LINUX_ANDROID 1 # endif // ANDROID #elif defined __MVS__ # define GTEST_OS_ZOS 1 #elif defined(__sun) && defined(__SVR4) # define GTEST_OS_SOLARIS 1 #elif defined(_AIX) # define GTEST_OS_AIX 1 #elif defined(__hpux) # define GTEST_OS_HPUX 1 #elif defined __native_client__ # define GTEST_OS_NACL 1 #endif // __CYGWIN__ // Brings in definitions for functions used in the testing::internal::posix // namespace (read, write, close, chdir, isatty, stat). We do not currently // use them on Windows Mobile. #if !GTEST_OS_WINDOWS // This assumes that non-Windows OSes provide unistd.h. For OSes where this // is not the case, we need to include headers that provide the functions // mentioned above. # include # if !GTEST_OS_NACL // TODO(vladl@google.com): Remove this condition when Native Client SDK adds // strings.h (tracked in // http://code.google.com/p/nativeclient/issues/detail?id=1175). # include // Native Client doesn't provide strings.h. # endif #elif !GTEST_OS_WINDOWS_MOBILE # include # include #endif // Defines this to true iff Google Test can use POSIX regular expressions. #ifndef GTEST_HAS_POSIX_RE # define GTEST_HAS_POSIX_RE (!GTEST_OS_WINDOWS) #endif #if GTEST_HAS_POSIX_RE // On some platforms, needs someone to define size_t, and // won't compile otherwise. We can #include it here as we already // included , which is guaranteed to define size_t through // . # include // NOLINT # define GTEST_USES_POSIX_RE 1 #elif GTEST_OS_WINDOWS // is not available on Windows. Use our own simple regex // implementation instead. # define GTEST_USES_SIMPLE_RE 1 #else // may not be available on this platform. Use our own // simple regex implementation instead. # define GTEST_USES_SIMPLE_RE 1 #endif // GTEST_HAS_POSIX_RE #ifndef GTEST_HAS_EXCEPTIONS // The user didn't tell us whether exceptions are enabled, so we need // to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC's and C++Builder's implementations of the STL use the _HAS_EXCEPTIONS // macro to enable exceptions, so we'll do the same. // Assumes that exceptions are enabled by default. # ifndef _HAS_EXCEPTIONS # define _HAS_EXCEPTIONS 1 # endif // _HAS_EXCEPTIONS # define GTEST_HAS_EXCEPTIONS _HAS_EXCEPTIONS # elif defined(__GNUC__) && __EXCEPTIONS // gcc defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__SUNPRO_CC) // Sun Pro CC supports exceptions. However, there is no compile-time way of // detecting whether they are enabled or not. Therefore, we assume that // they are enabled unless the user tells us otherwise. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__IBMCPP__) && __EXCEPTIONS // xlC defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__HP_aCC) // Exception handling is in effect by default in HP aCC compiler. It has to // be turned of by +noeh compiler option if desired. # define GTEST_HAS_EXCEPTIONS 1 # else // For other compilers, we assume exceptions are disabled to be // conservative. # define GTEST_HAS_EXCEPTIONS 0 # endif // defined(_MSC_VER) || defined(__BORLANDC__) #endif // GTEST_HAS_EXCEPTIONS #if !defined(GTEST_HAS_STD_STRING) // Even though we don't use this macro any longer, we keep it in case // some clients still depend on it. # define GTEST_HAS_STD_STRING 1 #elif !GTEST_HAS_STD_STRING // The user told us that ::std::string isn't available. # error "Google Test cannot be used where ::std::string isn't available." #endif // !defined(GTEST_HAS_STD_STRING) #ifndef GTEST_HAS_GLOBAL_STRING // The user didn't tell us whether ::string is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_STRING 0 #endif // GTEST_HAS_GLOBAL_STRING #ifndef GTEST_HAS_STD_WSTRING // The user didn't tell us whether ::std::wstring is available, so we need // to figure it out. // TODO(wan@google.com): uses autoconf to detect whether ::std::wstring // is available. // Cygwin 1.7 and below doesn't support ::std::wstring. // Solaris' libc++ doesn't support it either. Android has // no support for it at least as recent as Froyo (2.2). # define GTEST_HAS_STD_WSTRING \ (!(GTEST_OS_LINUX_ANDROID || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS)) #endif // GTEST_HAS_STD_WSTRING #ifndef GTEST_HAS_GLOBAL_WSTRING // The user didn't tell us whether ::wstring is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_WSTRING \ (GTEST_HAS_STD_WSTRING && GTEST_HAS_GLOBAL_STRING) #endif // GTEST_HAS_GLOBAL_WSTRING // Determines whether RTTI is available. #ifndef GTEST_HAS_RTTI // The user didn't tell us whether RTTI is enabled, so we need to // figure it out. # ifdef _MSC_VER # ifdef _CPPRTTI // MSVC defines this macro iff RTTI is enabled. # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // Starting with version 4.3.2, gcc defines __GXX_RTTI iff RTTI is enabled. # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40302) # ifdef __GXX_RTTI # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // __GXX_RTTI // Starting with version 9.0 IBM Visual Age defines __RTTI_ALL__ to 1 if // both the typeid and dynamic_cast features are present. # elif defined(__IBMCPP__) && (__IBMCPP__ >= 900) # ifdef __RTTI_ALL__ # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif # else // For all other compilers, we assume RTTI is enabled. # define GTEST_HAS_RTTI 1 # endif // _MSC_VER #endif // GTEST_HAS_RTTI // It's this header's responsibility to #include when RTTI // is enabled. #if GTEST_HAS_RTTI # include #endif // Determines whether Google Test can use the pthreads library. #ifndef GTEST_HAS_PTHREAD // The user didn't tell us explicitly, so we assume pthreads support is // available on Linux and Mac. // // To disable threading support in Google Test, add -DGTEST_HAS_PTHREAD=0 // to your compiler flags. # define GTEST_HAS_PTHREAD (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_HPUX) #endif // GTEST_HAS_PTHREAD #if GTEST_HAS_PTHREAD // gtest-port.h guarantees to #include when GTEST_HAS_PTHREAD is // true. # include // NOLINT // For timespec and nanosleep, used below. # include // NOLINT #endif // Determines whether Google Test can use tr1/tuple. You can define // this macro to 0 to prevent Google Test from using tuple (any // feature depending on tuple with be disabled in this mode). #ifndef GTEST_HAS_TR1_TUPLE // The user didn't tell us not to do it, so we assume it's OK. # define GTEST_HAS_TR1_TUPLE 1 #endif // GTEST_HAS_TR1_TUPLE // Determines whether Google Test's own tr1 tuple implementation // should be used. #ifndef GTEST_USE_OWN_TR1_TUPLE // The user didn't tell us, so we need to figure it out. // We use our own TR1 tuple if we aren't sure the user has an // implementation of it already. At this time, GCC 4.0.0+ and MSVC // 2010 are the only mainstream compilers that come with a TR1 tuple // implementation. NVIDIA's CUDA NVCC compiler pretends to be GCC by // defining __GNUC__ and friends, but cannot compile GCC's tuple // implementation. MSVC 2008 (9.0) provides TR1 tuple in a 323 MB // Feature Pack download, which we cannot assume the user has. # if (defined(__GNUC__) && !defined(__CUDACC__) && (GTEST_GCC_VER_ >= 40000)) \ || _MSC_VER >= 1600 # define GTEST_USE_OWN_TR1_TUPLE 0 # else # define GTEST_USE_OWN_TR1_TUPLE 1 # endif #endif // GTEST_USE_OWN_TR1_TUPLE // To avoid conditional compilation everywhere, we make it // gtest-port.h's responsibility to #include the header implementing // tr1/tuple. #if GTEST_HAS_TR1_TUPLE # if GTEST_USE_OWN_TR1_TUPLE // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2009 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements a subset of TR1 tuple needed by Google Test and Google Mock. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #include // For ::std::pair. // The compiler used in Symbian has a bug that prevents us from declaring the // tuple template as a friend (it complains that tuple is redefined). This // hack bypasses the bug by declaring the members that should otherwise be // private as public. // Sun Studio versions < 12 also have the above bug. #if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) # define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: #else # define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ template friend class tuple; \ private: #endif // GTEST_n_TUPLE_(T) is the type of an n-tuple. #define GTEST_0_TUPLE_(T) tuple<> #define GTEST_1_TUPLE_(T) tuple #define GTEST_2_TUPLE_(T) tuple #define GTEST_3_TUPLE_(T) tuple #define GTEST_4_TUPLE_(T) tuple #define GTEST_5_TUPLE_(T) tuple #define GTEST_6_TUPLE_(T) tuple #define GTEST_7_TUPLE_(T) tuple #define GTEST_8_TUPLE_(T) tuple #define GTEST_9_TUPLE_(T) tuple #define GTEST_10_TUPLE_(T) tuple // GTEST_n_TYPENAMES_(T) declares a list of n typenames. #define GTEST_0_TYPENAMES_(T) #define GTEST_1_TYPENAMES_(T) typename T##0 #define GTEST_2_TYPENAMES_(T) typename T##0, typename T##1 #define GTEST_3_TYPENAMES_(T) typename T##0, typename T##1, typename T##2 #define GTEST_4_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3 #define GTEST_5_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4 #define GTEST_6_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5 #define GTEST_7_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6 #define GTEST_8_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, typename T##7 #define GTEST_9_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8 #define GTEST_10_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8, typename T##9 // In theory, defining stuff in the ::std namespace is undefined // behavior. We can do this as we are playing the role of a standard // library vendor. namespace std { namespace tr1 { template class tuple; // Anything in namespace gtest_internal is Google Test's INTERNAL // IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. namespace gtest_internal { // ByRef::type is T if T is a reference; otherwise it's const T&. template struct ByRef { typedef const T& type; }; // NOLINT template struct ByRef { typedef T& type; }; // NOLINT // A handy wrapper for ByRef. #define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type // AddRef::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference::type. template struct AddRef { typedef T& type; }; // NOLINT template struct AddRef { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type // A helper for implementing get(). template class Get; // A helper for implementing tuple_element. kIndexValid is true // iff k < the number of fields in tuple type T. template struct TupleElement; template struct TupleElement { typedef T0 type; }; template struct TupleElement { typedef T1 type; }; template struct TupleElement { typedef T2 type; }; template struct TupleElement { typedef T3 type; }; template struct TupleElement { typedef T4 type; }; template struct TupleElement { typedef T5 type; }; template struct TupleElement { typedef T6 type; }; template struct TupleElement { typedef T7 type; }; template struct TupleElement { typedef T8 type; }; template struct TupleElement { typedef T9 type; }; } // namespace gtest_internal template <> class tuple<> { public: tuple() {} tuple(const tuple& /* t */) {} tuple& operator=(const tuple& /* t */) { return *this; } }; template class GTEST_1_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_() {} explicit tuple(GTEST_BY_REF_(T0) f0) : f0_(f0) {} tuple(const tuple& t) : f0_(t.f0_) {} template tuple(const GTEST_1_TUPLE_(U)& t) : f0_(t.f0_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_1_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_1_TUPLE_(U)& t) { f0_ = t.f0_; return *this; } T0 f0_; }; template class GTEST_2_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1) : f0_(f0), f1_(f1) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const GTEST_2_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_2_TUPLE_(U)& t) { return CopyFrom(t); } template tuple& operator=(const ::std::pair& p) { f0_ = p.first; f1_ = p.second; return *this; } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_2_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; return *this; } T0 f0_; T1 f1_; }; template class GTEST_3_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2) : f0_(f0), f1_(f1), f2_(f2) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} template tuple(const GTEST_3_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_3_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_3_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; return *this; } T0 f0_; T1 f1_; T2 f2_; }; template class GTEST_4_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3) : f0_(f0), f1_(f1), f2_(f2), f3_(f3) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} template tuple(const GTEST_4_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_4_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_4_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; }; template class GTEST_5_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} template tuple(const GTEST_5_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_5_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_5_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; }; template class GTEST_6_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} template tuple(const GTEST_6_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_6_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_6_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; }; template class GTEST_7_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} template tuple(const GTEST_7_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_7_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_7_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; }; template class GTEST_8_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} template tuple(const GTEST_8_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_8_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_8_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; }; template class GTEST_9_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} template tuple(const GTEST_9_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_9_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_9_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; }; template class tuple { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), f9_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8, GTEST_BY_REF_(T9) f9) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8), f9_(f9) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} template tuple(const GTEST_10_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_10_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_10_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; f9_ = t.f9_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; T9 f9_; }; // 6.1.3.2 Tuple creation functions. // Known limitations: we don't support passing an // std::tr1::reference_wrapper to make_tuple(). And we don't // implement tie(). inline tuple<> make_tuple() { return tuple<>(); } template inline GTEST_1_TUPLE_(T) make_tuple(const T0& f0) { return GTEST_1_TUPLE_(T)(f0); } template inline GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) { return GTEST_2_TUPLE_(T)(f0, f1); } template inline GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) { return GTEST_3_TUPLE_(T)(f0, f1, f2); } template inline GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3) { return GTEST_4_TUPLE_(T)(f0, f1, f2, f3); } template inline GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4) { return GTEST_5_TUPLE_(T)(f0, f1, f2, f3, f4); } template inline GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5) { return GTEST_6_TUPLE_(T)(f0, f1, f2, f3, f4, f5); } template inline GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6) { return GTEST_7_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6); } template inline GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7) { return GTEST_8_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7); } template inline GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8) { return GTEST_9_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8); } template inline GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8, const T9& f9) { return GTEST_10_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9); } // 6.1.3.3 Tuple helper classes. template struct tuple_size; template struct tuple_size { static const int value = 0; }; template struct tuple_size { static const int value = 1; }; template struct tuple_size { static const int value = 2; }; template struct tuple_size { static const int value = 3; }; template struct tuple_size { static const int value = 4; }; template struct tuple_size { static const int value = 5; }; template struct tuple_size { static const int value = 6; }; template struct tuple_size { static const int value = 7; }; template struct tuple_size { static const int value = 8; }; template struct tuple_size { static const int value = 9; }; template struct tuple_size { static const int value = 10; }; template struct tuple_element { typedef typename gtest_internal::TupleElement< k < (tuple_size::value), k, Tuple>::type type; }; #define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type // 6.1.3.4 Element access. namespace gtest_internal { template <> class Get<0> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) Field(Tuple& t) { return t.f0_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) ConstField(const Tuple& t) { return t.f0_; } }; template <> class Get<1> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) Field(Tuple& t) { return t.f1_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) ConstField(const Tuple& t) { return t.f1_; } }; template <> class Get<2> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) Field(Tuple& t) { return t.f2_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) ConstField(const Tuple& t) { return t.f2_; } }; template <> class Get<3> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) Field(Tuple& t) { return t.f3_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) ConstField(const Tuple& t) { return t.f3_; } }; template <> class Get<4> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) Field(Tuple& t) { return t.f4_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) ConstField(const Tuple& t) { return t.f4_; } }; template <> class Get<5> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) Field(Tuple& t) { return t.f5_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) ConstField(const Tuple& t) { return t.f5_; } }; template <> class Get<6> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) Field(Tuple& t) { return t.f6_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) ConstField(const Tuple& t) { return t.f6_; } }; template <> class Get<7> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) Field(Tuple& t) { return t.f7_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) ConstField(const Tuple& t) { return t.f7_; } }; template <> class Get<8> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) Field(Tuple& t) { return t.f8_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) ConstField(const Tuple& t) { return t.f8_; } }; template <> class Get<9> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) Field(Tuple& t) { return t.f9_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) ConstField(const Tuple& t) { return t.f9_; } }; } // namespace gtest_internal template GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::Field(t); } template GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(const GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::ConstField(t); } // 6.1.3.5 Relational operators // We only implement == and !=, as we don't have a need for the rest yet. namespace gtest_internal { // SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the // first k fields of t1 equals the first k fields of t2. // SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if // k1 != k2. template struct SameSizeTuplePrefixComparator; template <> struct SameSizeTuplePrefixComparator<0, 0> { template static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { return true; } }; template struct SameSizeTuplePrefixComparator { template static bool Eq(const Tuple1& t1, const Tuple2& t2) { return SameSizeTuplePrefixComparator::Eq(t1, t2) && ::std::tr1::get(t1) == ::std::tr1::get(t2); } }; } // namespace gtest_internal template inline bool operator==(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return gtest_internal::SameSizeTuplePrefixComparator< tuple_size::value, tuple_size::value>::Eq(t, u); } template inline bool operator!=(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return !(t == u); } // 6.1.4 Pairs. // Unimplemented. } // namespace tr1 } // namespace std #undef GTEST_0_TUPLE_ #undef GTEST_1_TUPLE_ #undef GTEST_2_TUPLE_ #undef GTEST_3_TUPLE_ #undef GTEST_4_TUPLE_ #undef GTEST_5_TUPLE_ #undef GTEST_6_TUPLE_ #undef GTEST_7_TUPLE_ #undef GTEST_8_TUPLE_ #undef GTEST_9_TUPLE_ #undef GTEST_10_TUPLE_ #undef GTEST_0_TYPENAMES_ #undef GTEST_1_TYPENAMES_ #undef GTEST_2_TYPENAMES_ #undef GTEST_3_TYPENAMES_ #undef GTEST_4_TYPENAMES_ #undef GTEST_5_TYPENAMES_ #undef GTEST_6_TYPENAMES_ #undef GTEST_7_TYPENAMES_ #undef GTEST_8_TYPENAMES_ #undef GTEST_9_TYPENAMES_ #undef GTEST_10_TYPENAMES_ #undef GTEST_DECLARE_TUPLE_AS_FRIEND_ #undef GTEST_BY_REF_ #undef GTEST_ADD_REF_ #undef GTEST_TUPLE_ELEMENT_ #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ # elif GTEST_OS_SYMBIAN // On Symbian, BOOST_HAS_TR1_TUPLE causes Boost's TR1 tuple library to // use STLport's tuple implementation, which unfortunately doesn't // work as the copy of STLport distributed with Symbian is incomplete. // By making sure BOOST_HAS_TR1_TUPLE is undefined, we force Boost to // use its own tuple implementation. # ifdef BOOST_HAS_TR1_TUPLE # undef BOOST_HAS_TR1_TUPLE # endif // BOOST_HAS_TR1_TUPLE // This prevents , which defines // BOOST_HAS_TR1_TUPLE, from being #included by Boost's . # define BOOST_TR1_DETAIL_CONFIG_HPP_INCLUDED # include # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40000) // GCC 4.0+ implements tr1/tuple in the header. This does // not conform to the TR1 spec, which requires the header to be . # if !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 // Until version 4.3.2, gcc has a bug that causes , // which is #included by , to not compile when RTTI is // disabled. _TR1_FUNCTIONAL is the header guard for // . Hence the following #define is a hack to prevent // from being included. # define _TR1_FUNCTIONAL 1 # include # undef _TR1_FUNCTIONAL // Allows the user to #include // if he chooses to. # else # include // NOLINT # endif // !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 # else // If the compiler is not GCC 4.0+, we assume the user is using a // spec-conforming TR1 implementation. # include // NOLINT # endif // GTEST_USE_OWN_TR1_TUPLE #endif // GTEST_HAS_TR1_TUPLE // Determines whether clone(2) is supported. // Usually it will only be available on Linux, excluding // Linux on the Itanium architecture. // Also see http://linux.die.net/man/2/clone. #ifndef GTEST_HAS_CLONE // The user didn't tell us, so we need to figure it out. # if GTEST_OS_LINUX && !defined(__ia64__) # define GTEST_HAS_CLONE 1 # else # define GTEST_HAS_CLONE 0 # endif // GTEST_OS_LINUX && !defined(__ia64__) #endif // GTEST_HAS_CLONE // Determines whether to support stream redirection. This is used to test // output correctness and to implement death tests. #ifndef GTEST_HAS_STREAM_REDIRECTION // By default, we assume that stream redirection is supported on all // platforms except known mobile ones. # if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN # define GTEST_HAS_STREAM_REDIRECTION 0 # else # define GTEST_HAS_STREAM_REDIRECTION 1 # endif // !GTEST_OS_WINDOWS_MOBILE && !GTEST_OS_SYMBIAN #endif // GTEST_HAS_STREAM_REDIRECTION // Determines whether to support death tests. // Google Test does not support death tests for VC 7.1 and earlier as // abort() in a VC 7.1 application compiled as GUI in debug config // pops up a dialog window that cannot be suppressed programmatically. #if (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS || \ (GTEST_OS_WINDOWS_DESKTOP && _MSC_VER >= 1400) || \ GTEST_OS_WINDOWS_MINGW || GTEST_OS_AIX || GTEST_OS_HPUX) # define GTEST_HAS_DEATH_TEST 1 # include // NOLINT #endif // We don't support MSVC 7.1 with exceptions disabled now. Therefore // all the compilers we care about are adequate for supporting // value-parameterized tests. #define GTEST_HAS_PARAM_TEST 1 // Determines whether to support type-driven tests. // Typed tests need and variadic macros, which GCC, VC++ 8.0, // Sun Pro CC, IBM Visual Age, and HP aCC support. #if defined(__GNUC__) || (_MSC_VER >= 1400) || defined(__SUNPRO_CC) || \ defined(__IBMCPP__) || defined(__HP_aCC) # define GTEST_HAS_TYPED_TEST 1 # define GTEST_HAS_TYPED_TEST_P 1 #endif // Determines whether to support Combine(). This only makes sense when // value-parameterized tests are enabled. The implementation doesn't // work on Sun Studio since it doesn't understand templated conversion // operators. #if GTEST_HAS_PARAM_TEST && GTEST_HAS_TR1_TUPLE && !defined(__SUNPRO_CC) # define GTEST_HAS_COMBINE 1 #endif // Determines whether the system compiler uses UTF-16 for encoding wide strings. #define GTEST_WIDE_STRING_USES_UTF16_ \ (GTEST_OS_WINDOWS || GTEST_OS_CYGWIN || GTEST_OS_SYMBIAN || GTEST_OS_AIX) // Determines whether test results can be streamed to a socket. #if GTEST_OS_LINUX # define GTEST_CAN_STREAM_RESULTS_ 1 #endif // Defines some utility macros. // The GNU compiler emits a warning if nested "if" statements are followed by // an "else" statement and braces are not used to explicitly disambiguate the // "else" binding. This leads to problems with code like: // // if (gate) // ASSERT_*(condition) << "Some message"; // // The "switch (0) case 0:" idiom is used to suppress this. #ifdef __INTEL_COMPILER # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ #else # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ switch (0) case 0: default: // NOLINT #endif // Use this annotation at the end of a struct/class definition to // prevent the compiler from optimizing away instances that are never // used. This is useful when all interesting logic happens inside the // c'tor and / or d'tor. Example: // // struct Foo { // Foo() { ... } // } GTEST_ATTRIBUTE_UNUSED_; // // Also use it after a variable or parameter declaration to tell the // compiler the variable/parameter does not have to be used. #if defined(__GNUC__) && !defined(COMPILER_ICC) # define GTEST_ATTRIBUTE_UNUSED_ __attribute__ ((unused)) #else # define GTEST_ATTRIBUTE_UNUSED_ #endif // A macro to disallow operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_ASSIGN_(type)\ void operator=(type const &) // A macro to disallow copy constructor and operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_COPY_AND_ASSIGN_(type)\ type(type const &);\ GTEST_DISALLOW_ASSIGN_(type) // Tell the compiler to warn about unused return values for functions declared // with this macro. The macro should be used on function declarations // following the argument list: // // Sprocket* AllocateSprocket() GTEST_MUST_USE_RESULT_; #if defined(__GNUC__) && (GTEST_GCC_VER_ >= 30400) && !defined(COMPILER_ICC) # define GTEST_MUST_USE_RESULT_ __attribute__ ((warn_unused_result)) #else # define GTEST_MUST_USE_RESULT_ #endif // __GNUC__ && (GTEST_GCC_VER_ >= 30400) && !COMPILER_ICC // Determine whether the compiler supports Microsoft's Structured Exception // Handling. This is supported by several Windows compilers but generally // does not exist on any other system. #ifndef GTEST_HAS_SEH // The user didn't tell us, so we need to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // These two compilers are known to support SEH. # define GTEST_HAS_SEH 1 # else // Assume no SEH. # define GTEST_HAS_SEH 0 # endif #endif // GTEST_HAS_SEH #ifdef _MSC_VER # if GTEST_LINKED_AS_SHARED_LIBRARY # define GTEST_API_ __declspec(dllimport) # elif GTEST_CREATE_SHARED_LIBRARY # define GTEST_API_ __declspec(dllexport) # endif #endif // _MSC_VER #ifndef GTEST_API_ # define GTEST_API_ #endif #ifdef __GNUC__ // Ask the compiler to never inline a given function. # define GTEST_NO_INLINE_ __attribute__((noinline)) #else # define GTEST_NO_INLINE_ #endif namespace testing { class Message; namespace internal { class String; // The GTEST_COMPILE_ASSERT_ macro can be used to verify that a compile time // expression is true. For example, you could use it to verify the // size of a static array: // // GTEST_COMPILE_ASSERT_(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES, // content_type_names_incorrect_size); // // or to make sure a struct is smaller than a certain size: // // GTEST_COMPILE_ASSERT_(sizeof(foo) < 128, foo_too_large); // // The second argument to the macro is the name of the variable. If // the expression is false, most compilers will issue a warning/error // containing the name of the variable. template struct CompileAssert { }; #define GTEST_COMPILE_ASSERT_(expr, msg) \ typedef ::testing::internal::CompileAssert<(bool(expr))> \ msg[bool(expr) ? 1 : -1] // Implementation details of GTEST_COMPILE_ASSERT_: // // - GTEST_COMPILE_ASSERT_ works by defining an array type that has -1 // elements (and thus is invalid) when the expression is false. // // - The simpler definition // // #define GTEST_COMPILE_ASSERT_(expr, msg) typedef char msg[(expr) ? 1 : -1] // // does not work, as gcc supports variable-length arrays whose sizes // are determined at run-time (this is gcc's extension and not part // of the C++ standard). As a result, gcc fails to reject the // following code with the simple definition: // // int foo; // GTEST_COMPILE_ASSERT_(foo, msg); // not supposed to compile as foo is // // not a compile-time constant. // // - By using the type CompileAssert<(bool(expr))>, we ensures that // expr is a compile-time constant. (Template arguments must be // determined at compile-time.) // // - The outter parentheses in CompileAssert<(bool(expr))> are necessary // to work around a bug in gcc 3.4.4 and 4.0.1. If we had written // // CompileAssert // // instead, these compilers will refuse to compile // // GTEST_COMPILE_ASSERT_(5 > 0, some_message); // // (They seem to think the ">" in "5 > 0" marks the end of the // template argument list.) // // - The array size is (bool(expr) ? 1 : -1), instead of simply // // ((expr) ? 1 : -1). // // This is to avoid running into a bug in MS VC 7.1, which // causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1. // StaticAssertTypeEqHelper is used by StaticAssertTypeEq defined in gtest.h. // // This template is declared, but intentionally undefined. template struct StaticAssertTypeEqHelper; template struct StaticAssertTypeEqHelper {}; #if GTEST_HAS_GLOBAL_STRING typedef ::string string; #else typedef ::std::string string; #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING typedef ::wstring wstring; #elif GTEST_HAS_STD_WSTRING typedef ::std::wstring wstring; #endif // GTEST_HAS_GLOBAL_WSTRING // A helper for suppressing warnings on constant condition. It just // returns 'condition'. GTEST_API_ bool IsTrue(bool condition); // Defines scoped_ptr. // This implementation of scoped_ptr is PARTIAL - it only contains // enough stuff to satisfy Google Test's need. template class scoped_ptr { public: typedef T element_type; explicit scoped_ptr(T* p = NULL) : ptr_(p) {} ~scoped_ptr() { reset(); } T& operator*() const { return *ptr_; } T* operator->() const { return ptr_; } T* get() const { return ptr_; } T* release() { T* const ptr = ptr_; ptr_ = NULL; return ptr; } void reset(T* p = NULL) { if (p != ptr_) { if (IsTrue(sizeof(T) > 0)) { // Makes sure T is a complete type. delete ptr_; } ptr_ = p; } } private: T* ptr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(scoped_ptr); }; // Defines RE. // A simple C++ wrapper for . It uses the POSIX Extended // Regular Expression syntax. class GTEST_API_ RE { public: // A copy constructor is required by the Standard to initialize object // references from r-values. RE(const RE& other) { Init(other.pattern()); } // Constructs an RE from a string. RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT #if GTEST_HAS_GLOBAL_STRING RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT #endif // GTEST_HAS_GLOBAL_STRING RE(const char* regex) { Init(regex); } // NOLINT ~RE(); // Returns the string representation of the regex. const char* pattern() const { return pattern_; } // FullMatch(str, re) returns true iff regular expression re matches // the entire str. // PartialMatch(str, re) returns true iff regular expression re // matches a substring of str (including str itself). // // TODO(wan@google.com): make FullMatch() and PartialMatch() work // when str contains NUL characters. static bool FullMatch(const ::std::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::std::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #if GTEST_HAS_GLOBAL_STRING static bool FullMatch(const ::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #endif // GTEST_HAS_GLOBAL_STRING static bool FullMatch(const char* str, const RE& re); static bool PartialMatch(const char* str, const RE& re); private: void Init(const char* regex); // We use a const char* instead of a string, as Google Test may be used // where string is not available. We also do not use Google Test's own // String type here, in order to simplify dependencies between the // files. const char* pattern_; bool is_valid_; #if GTEST_USES_POSIX_RE regex_t full_regex_; // For FullMatch(). regex_t partial_regex_; // For PartialMatch(). #else // GTEST_USES_SIMPLE_RE const char* full_pattern_; // For FullMatch(); #endif GTEST_DISALLOW_ASSIGN_(RE); }; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line); // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. GTEST_API_ ::std::string FormatCompilerIndependentFileLocation(const char* file, int line); // Defines logging utilities: // GTEST_LOG_(severity) - logs messages at the specified severity level. The // message itself is streamed into the macro. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. enum GTestLogSeverity { GTEST_INFO, GTEST_WARNING, GTEST_ERROR, GTEST_FATAL }; // Formats log entry severity, provides a stream object for streaming the // log message, and terminates the message with a newline when going out of // scope. class GTEST_API_ GTestLog { public: GTestLog(GTestLogSeverity severity, const char* file, int line); // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. ~GTestLog(); ::std::ostream& GetStream() { return ::std::cerr; } private: const GTestLogSeverity severity_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestLog); }; #define GTEST_LOG_(severity) \ ::testing::internal::GTestLog(::testing::internal::GTEST_##severity, \ __FILE__, __LINE__).GetStream() inline void LogToStderr() {} inline void FlushInfoLog() { fflush(NULL); } // INTERNAL IMPLEMENTATION - DO NOT USE. // // GTEST_CHECK_ is an all-mode assert. It aborts the program if the condition // is not satisfied. // Synopsys: // GTEST_CHECK_(boolean_condition); // or // GTEST_CHECK_(boolean_condition) << "Additional message"; // // This checks the condition and if the condition is not satisfied // it prints message about the condition violation, including the // condition itself, plus additional message streamed into it, if any, // and then it aborts the program. It aborts the program irrespective of // whether it is built in the debug mode or not. #define GTEST_CHECK_(condition) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::IsTrue(condition)) \ ; \ else \ GTEST_LOG_(FATAL) << "Condition " #condition " failed. " // An all-mode assert to verify that the given POSIX-style function // call returns 0 (indicating success). Known limitation: this // doesn't expand to a balanced 'if' statement, so enclose the macro // in {} if you need to use it as the only statement in an 'if' // branch. #define GTEST_CHECK_POSIX_SUCCESS_(posix_call) \ if (const int gtest_error = (posix_call)) \ GTEST_LOG_(FATAL) << #posix_call << "failed with error " \ << gtest_error // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Use ImplicitCast_ as a safe version of static_cast for upcasting in // the type hierarchy (e.g. casting a Foo* to a SuperclassOfFoo* or a // const Foo*). When you use ImplicitCast_, the compiler checks that // the cast is safe. Such explicit ImplicitCast_s are necessary in // surprisingly many situations where C++ demands an exact type match // instead of an argument type convertable to a target type. // // The syntax for using ImplicitCast_ is the same as for static_cast: // // ImplicitCast_(expr) // // ImplicitCast_ would have been part of the C++ standard library, // but the proposal was submitted too late. It will probably make // its way into the language in the future. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., implicit_cast). The internal // namespace alone is not enough because the function can be found by ADL. template inline To ImplicitCast_(To x) { return x; } // When you upcast (that is, cast a pointer from type Foo to type // SuperclassOfFoo), it's fine to use ImplicitCast_<>, since upcasts // always succeed. When you downcast (that is, cast a pointer from // type Foo to type SubclassOfFoo), static_cast<> isn't safe, because // how do you know the pointer is really of type SubclassOfFoo? It // could be a bare Foo, or of type DifferentSubclassOfFoo. Thus, // when you downcast, you should use this macro. In debug mode, we // use dynamic_cast<> to double-check the downcast is legal (we die // if it's not). In normal mode, we do the efficient static_cast<> // instead. Thus, it's important to test in debug mode to make sure // the cast is legal! // This is the only place in the code we should use dynamic_cast<>. // In particular, you SHOULDN'T be using dynamic_cast<> in order to // do RTTI (eg code like this: // if (dynamic_cast(foo)) HandleASubclass1Object(foo); // if (dynamic_cast(foo)) HandleASubclass2Object(foo); // You should design the code some other way not to need this. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., down_cast). The internal // namespace alone is not enough because the function can be found by ADL. template // use like this: DownCast_(foo); inline To DownCast_(From* f) { // so we only accept pointers // Ensures that To is a sub-type of From *. This test is here only // for compile-time type checking, and has no overhead in an // optimized build at run-time, as it will be optimized away // completely. if (false) { const To to = NULL; ::testing::internal::ImplicitCast_(to); } #if GTEST_HAS_RTTI // RTTI: debug mode only! GTEST_CHECK_(f == NULL || dynamic_cast(f) != NULL); #endif return static_cast(f); } // Downcasts the pointer of type Base to Derived. // Derived must be a subclass of Base. The parameter MUST // point to a class of type Derived, not any subclass of it. // When RTTI is available, the function performs a runtime // check to enforce this. template Derived* CheckedDowncastToActualType(Base* base) { #if GTEST_HAS_RTTI GTEST_CHECK_(typeid(*base) == typeid(Derived)); return dynamic_cast(base); // NOLINT #else return static_cast(base); // Poor man's downcast. #endif } #if GTEST_HAS_STREAM_REDIRECTION // Defines the stderr capturer: // CaptureStdout - starts capturing stdout. // GetCapturedStdout - stops capturing stdout and returns the captured string. // CaptureStderr - starts capturing stderr. // GetCapturedStderr - stops capturing stderr and returns the captured string. // GTEST_API_ void CaptureStdout(); GTEST_API_ String GetCapturedStdout(); GTEST_API_ void CaptureStderr(); GTEST_API_ String GetCapturedStderr(); #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). extern ::std::vector g_argvs; // GTEST_HAS_DEATH_TEST implies we have ::std::string. const ::std::vector& GetArgvs(); #endif // GTEST_HAS_DEATH_TEST // Defines synchronization primitives. #if GTEST_HAS_PTHREAD // Sleeps for (roughly) n milli-seconds. This function is only for // testing Google Test's own constructs. Don't use it in user tests, // either directly or indirectly. inline void SleepMilliseconds(int n) { const timespec time = { 0, // 0 seconds. n * 1000L * 1000L, // And n ms. }; nanosleep(&time, NULL); } // Allows a controller thread to pause execution of newly created // threads until notified. Instances of this class must be created // and destroyed in the controller thread. // // This class is only for testing Google Test's own constructs. Do not // use it in user tests, either directly or indirectly. class Notification { public: Notification() : notified_(false) {} // Notifies all threads created with this notification to start. Must // be called from the controller thread. void Notify() { notified_ = true; } // Blocks until the controller thread notifies. Must be called from a test // thread. void WaitForNotification() { while(!notified_) { SleepMilliseconds(10); } } private: volatile bool notified_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Notification); }; // As a C-function, ThreadFuncWithCLinkage cannot be templated itself. // Consequently, it cannot select a correct instantiation of ThreadWithParam // in order to call its Run(). Introducing ThreadWithParamBase as a // non-templated base class for ThreadWithParam allows us to bypass this // problem. class ThreadWithParamBase { public: virtual ~ThreadWithParamBase() {} virtual void Run() = 0; }; // pthread_create() accepts a pointer to a function type with the C linkage. // According to the Standard (7.5/1), function types with different linkages // are different even if they are otherwise identical. Some compilers (for // example, SunStudio) treat them as different types. Since class methods // cannot be defined with C-linkage we need to define a free C-function to // pass into pthread_create(). extern "C" inline void* ThreadFuncWithCLinkage(void* thread) { static_cast(thread)->Run(); return NULL; } // Helper class for testing Google Test's multi-threading constructs. // To use it, write: // // void ThreadFunc(int param) { /* Do things with param */ } // Notification thread_can_start; // ... // // The thread_can_start parameter is optional; you can supply NULL. // ThreadWithParam thread(&ThreadFunc, 5, &thread_can_start); // thread_can_start.Notify(); // // These classes are only for testing Google Test's own constructs. Do // not use them in user tests, either directly or indirectly. template class ThreadWithParam : public ThreadWithParamBase { public: typedef void (*UserThreadFunc)(T); ThreadWithParam( UserThreadFunc func, T param, Notification* thread_can_start) : func_(func), param_(param), thread_can_start_(thread_can_start), finished_(false) { ThreadWithParamBase* const base = this; // The thread can be created only after all fields except thread_ // have been initialized. GTEST_CHECK_POSIX_SUCCESS_( pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base)); } ~ThreadWithParam() { Join(); } void Join() { if (!finished_) { GTEST_CHECK_POSIX_SUCCESS_(pthread_join(thread_, 0)); finished_ = true; } } virtual void Run() { if (thread_can_start_ != NULL) thread_can_start_->WaitForNotification(); func_(param_); } private: const UserThreadFunc func_; // User-supplied thread function. const T param_; // User-supplied parameter to the thread function. // When non-NULL, used to block execution until the controller thread // notifies. Notification* const thread_can_start_; bool finished_; // true iff we know that the thread function has finished. pthread_t thread_; // The native thread object. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam); }; // MutexBase and Mutex implement mutex on pthreads-based platforms. They // are used in conjunction with class MutexLock: // // Mutex mutex; // ... // MutexLock lock(&mutex); // Acquires the mutex and releases it at the end // // of the current scope. // // MutexBase implements behavior for both statically and dynamically // allocated mutexes. Do not use MutexBase directly. Instead, write // the following to define a static mutex: // // GTEST_DEFINE_STATIC_MUTEX_(g_some_mutex); // // You can forward declare a static mutex like this: // // GTEST_DECLARE_STATIC_MUTEX_(g_some_mutex); // // To create a dynamic mutex, just define an object of type Mutex. class MutexBase { public: // Acquires this mutex. void Lock() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&mutex_)); owner_ = pthread_self(); } // Releases this mutex. void Unlock() { // We don't protect writing to owner_ here, as it's the caller's // responsibility to ensure that the current thread holds the // mutex when this is called. owner_ = 0; GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&mutex_)); } // Does nothing if the current thread holds the mutex. Otherwise, crashes // with high probability. void AssertHeld() const { GTEST_CHECK_(owner_ == pthread_self()) << "The current thread is not holding the mutex @" << this; } // A static mutex may be used before main() is entered. It may even // be used before the dynamic initialization stage. Therefore we // must be able to initialize a static mutex object at link time. // This means MutexBase has to be a POD and its member variables // have to be public. public: pthread_mutex_t mutex_; // The underlying pthread mutex. pthread_t owner_; // The thread holding the mutex; 0 means no one holds it. }; // Forward-declares a static mutex. # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::MutexBase mutex // Defines and statically (i.e. at link time) initializes a static mutex. # define GTEST_DEFINE_STATIC_MUTEX_(mutex) \ ::testing::internal::MutexBase mutex = { PTHREAD_MUTEX_INITIALIZER, 0 } // The Mutex class can only be used for mutexes created at runtime. It // shares its API with MutexBase otherwise. class Mutex : public MutexBase { public: Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL)); owner_ = 0; } ~Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex); }; // We cannot name this class MutexLock as the ctor declaration would // conflict with a macro named MutexLock, which is defined on some // platforms. Hence the typedef trick below. class GTestMutexLock { public: explicit GTestMutexLock(MutexBase* mutex) : mutex_(mutex) { mutex_->Lock(); } ~GTestMutexLock() { mutex_->Unlock(); } private: MutexBase* const mutex_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestMutexLock); }; typedef GTestMutexLock MutexLock; // Helpers for ThreadLocal. // pthread_key_create() requires DeleteThreadLocalValue() to have // C-linkage. Therefore it cannot be templatized to access // ThreadLocal. Hence the need for class // ThreadLocalValueHolderBase. class ThreadLocalValueHolderBase { public: virtual ~ThreadLocalValueHolderBase() {} }; // Called by pthread to delete thread-local data stored by // pthread_setspecific(). extern "C" inline void DeleteThreadLocalValue(void* value_holder) { delete static_cast(value_holder); } // Implements thread-local storage on pthreads-based systems. // // // Thread 1 // ThreadLocal tl(100); // 100 is the default value for each thread. // // // Thread 2 // tl.set(150); // Changes the value for thread 2 only. // EXPECT_EQ(150, tl.get()); // // // Thread 1 // EXPECT_EQ(100, tl.get()); // In thread 1, tl has the original value. // tl.set(200); // EXPECT_EQ(200, tl.get()); // // The template type argument T must have a public copy constructor. // In addition, the default ThreadLocal constructor requires T to have // a public default constructor. // // An object managed for a thread by a ThreadLocal instance is deleted // when the thread exits. Or, if the ThreadLocal instance dies in // that thread, when the ThreadLocal dies. It's the user's // responsibility to ensure that all other threads using a ThreadLocal // have exited when it dies, or the per-thread objects for those // threads will not be deleted. // // Google Test only uses global ThreadLocal objects. That means they // will die after main() has returned. Therefore, no per-thread // object managed by Google Test will be leaked as long as all threads // using Google Test have exited when main() returns. template class ThreadLocal { public: ThreadLocal() : key_(CreateKey()), default_() {} explicit ThreadLocal(const T& value) : key_(CreateKey()), default_(value) {} ~ThreadLocal() { // Destroys the managed object for the current thread, if any. DeleteThreadLocalValue(pthread_getspecific(key_)); // Releases resources associated with the key. This will *not* // delete managed objects for other threads. GTEST_CHECK_POSIX_SUCCESS_(pthread_key_delete(key_)); } T* pointer() { return GetOrCreateValue(); } const T* pointer() const { return GetOrCreateValue(); } const T& get() const { return *pointer(); } void set(const T& value) { *pointer() = value; } private: // Holds a value of type T. class ValueHolder : public ThreadLocalValueHolderBase { public: explicit ValueHolder(const T& value) : value_(value) {} T* pointer() { return &value_; } private: T value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder); }; static pthread_key_t CreateKey() { pthread_key_t key; // When a thread exits, DeleteThreadLocalValue() will be called on // the object managed for that thread. GTEST_CHECK_POSIX_SUCCESS_( pthread_key_create(&key, &DeleteThreadLocalValue)); return key; } T* GetOrCreateValue() const { ThreadLocalValueHolderBase* const holder = static_cast(pthread_getspecific(key_)); if (holder != NULL) { return CheckedDowncastToActualType(holder)->pointer(); } ValueHolder* const new_holder = new ValueHolder(default_); ThreadLocalValueHolderBase* const holder_base = new_holder; GTEST_CHECK_POSIX_SUCCESS_(pthread_setspecific(key_, holder_base)); return new_holder->pointer(); } // A key pthreads uses for looking up per-thread values. const pthread_key_t key_; const T default_; // The default value for each thread. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadLocal); }; # define GTEST_IS_THREADSAFE 1 #else // GTEST_HAS_PTHREAD // A dummy implementation of synchronization primitives (mutex, lock, // and thread-local variable). Necessary for compiling Google Test where // mutex is not supported - using Google Test in multiple threads is not // supported on such platforms. class Mutex { public: Mutex() {} void AssertHeld() const {} }; # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::Mutex mutex # define GTEST_DEFINE_STATIC_MUTEX_(mutex) ::testing::internal::Mutex mutex class GTestMutexLock { public: explicit GTestMutexLock(Mutex*) {} // NOLINT }; typedef GTestMutexLock MutexLock; template class ThreadLocal { public: ThreadLocal() : value_() {} explicit ThreadLocal(const T& value) : value_(value) {} T* pointer() { return &value_; } const T* pointer() const { return &value_; } const T& get() const { return value_; } void set(const T& value) { value_ = value; } private: T value_; }; // The above synchronization primitives have dummy implementations. // Therefore Google Test is not thread-safe. # define GTEST_IS_THREADSAFE 0 #endif // GTEST_HAS_PTHREAD // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. GTEST_API_ size_t GetThreadCount(); // Passing non-POD classes through ellipsis (...) crashes the ARM // compiler and generates a warning in Sun Studio. The Nokia Symbian // and the IBM XL C/C++ compiler try to instantiate a copy constructor // for objects passed through ellipsis (...), failing for uncopyable // objects. We define this to ensure that only POD is passed through // ellipsis on these systems. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) || defined(__SUNPRO_CC) // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_ELLIPSIS_NEEDS_POD_ 1 #else # define GTEST_CAN_COMPARE_NULL 1 #endif // The Nokia Symbian and IBM XL C/C++ compilers cannot decide between // const T& and const T* in a function template. These compilers // _can_ decide between class template specializations for T and T*, // so a tr1::type_traits-like is_pointer works. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) # define GTEST_NEEDS_IS_POINTER_ 1 #endif template struct bool_constant { typedef bool_constant type; static const bool value = bool_value; }; template const bool bool_constant::value; typedef bool_constant false_type; typedef bool_constant true_type; template struct is_pointer : public false_type {}; template struct is_pointer : public true_type {}; template struct IteratorTraits { typedef typename Iterator::value_type value_type; }; template struct IteratorTraits { typedef T value_type; }; template struct IteratorTraits { typedef T value_type; }; #if GTEST_OS_WINDOWS # define GTEST_PATH_SEP_ "\\" # define GTEST_HAS_ALT_PATH_SEP_ 1 // The biggest signed integer type the compiler supports. typedef __int64 BiggestInt; #else # define GTEST_PATH_SEP_ "/" # define GTEST_HAS_ALT_PATH_SEP_ 0 typedef long long BiggestInt; // NOLINT #endif // GTEST_OS_WINDOWS // Utilities for char. // isspace(int ch) and friends accept an unsigned char or EOF. char // may be signed, depending on the compiler (or compiler flags). // Therefore we need to cast a char to unsigned char before calling // isspace(), etc. inline bool IsAlpha(char ch) { return isalpha(static_cast(ch)) != 0; } inline bool IsAlNum(char ch) { return isalnum(static_cast(ch)) != 0; } inline bool IsDigit(char ch) { return isdigit(static_cast(ch)) != 0; } inline bool IsLower(char ch) { return islower(static_cast(ch)) != 0; } inline bool IsSpace(char ch) { return isspace(static_cast(ch)) != 0; } inline bool IsUpper(char ch) { return isupper(static_cast(ch)) != 0; } inline bool IsXDigit(char ch) { return isxdigit(static_cast(ch)) != 0; } inline char ToLower(char ch) { return static_cast(tolower(static_cast(ch))); } inline char ToUpper(char ch) { return static_cast(toupper(static_cast(ch))); } // The testing::internal::posix namespace holds wrappers for common // POSIX functions. These wrappers hide the differences between // Windows/MSVC and POSIX systems. Since some compilers define these // standard functions as macros, the wrapper cannot have the same name // as the wrapped function. namespace posix { // Functions with a different name on Windows. #if GTEST_OS_WINDOWS typedef struct _stat StatStruct; # ifdef __BORLANDC__ inline int IsATTY(int fd) { return isatty(fd); } inline int StrCaseCmp(const char* s1, const char* s2) { return stricmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } # else // !__BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int IsATTY(int /* fd */) { return 0; } # else inline int IsATTY(int fd) { return _isatty(fd); } # endif // GTEST_OS_WINDOWS_MOBILE inline int StrCaseCmp(const char* s1, const char* s2) { return _stricmp(s1, s2); } inline char* StrDup(const char* src) { return _strdup(src); } # endif // __BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int FileNo(FILE* file) { return reinterpret_cast(_fileno(file)); } // Stat(), RmDir(), and IsDir() are not needed on Windows CE at this // time and thus not defined there. # else inline int FileNo(FILE* file) { return _fileno(file); } inline int Stat(const char* path, StatStruct* buf) { return _stat(path, buf); } inline int RmDir(const char* dir) { return _rmdir(dir); } inline bool IsDir(const StatStruct& st) { return (_S_IFDIR & st.st_mode) != 0; } # endif // GTEST_OS_WINDOWS_MOBILE #else typedef struct stat StatStruct; inline int FileNo(FILE* file) { return fileno(file); } inline int IsATTY(int fd) { return isatty(fd); } inline int Stat(const char* path, StatStruct* buf) { return stat(path, buf); } inline int StrCaseCmp(const char* s1, const char* s2) { return strcasecmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } inline int RmDir(const char* dir) { return rmdir(dir); } inline bool IsDir(const StatStruct& st) { return S_ISDIR(st.st_mode); } #endif // GTEST_OS_WINDOWS // Functions deprecated by MSVC 8.0. #ifdef _MSC_VER // Temporarily disable warning 4996 (deprecated function). # pragma warning(push) # pragma warning(disable:4996) #endif inline const char* StrNCpy(char* dest, const char* src, size_t n) { return strncpy(dest, src, n); } // ChDir(), FReopen(), FDOpen(), Read(), Write(), Close(), and // StrError() aren't needed on Windows CE at this time and thus not // defined there. #if !GTEST_OS_WINDOWS_MOBILE inline int ChDir(const char* dir) { return chdir(dir); } #endif inline FILE* FOpen(const char* path, const char* mode) { return fopen(path, mode); } #if !GTEST_OS_WINDOWS_MOBILE inline FILE *FReopen(const char* path, const char* mode, FILE* stream) { return freopen(path, mode, stream); } inline FILE* FDOpen(int fd, const char* mode) { return fdopen(fd, mode); } #endif inline int FClose(FILE* fp) { return fclose(fp); } #if !GTEST_OS_WINDOWS_MOBILE inline int Read(int fd, void* buf, unsigned int count) { return static_cast(read(fd, buf, count)); } inline int Write(int fd, const void* buf, unsigned int count) { return static_cast(write(fd, buf, count)); } inline int Close(int fd) { return close(fd); } inline const char* StrError(int errnum) { return strerror(errnum); } #endif inline const char* GetEnv(const char* name) { #if GTEST_OS_WINDOWS_MOBILE // We are on Windows CE, which has no environment variables. return NULL; #elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) // Environment variables which we programmatically clear will be set to the // empty string rather than unset (NULL). Handle that case. const char* const env = getenv(name); return (env != NULL && env[0] != '\0') ? env : NULL; #else return getenv(name); #endif } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif #if GTEST_OS_WINDOWS_MOBILE // Windows CE has no C library. The abort() function is used in // several places in Google Test. This implementation provides a reasonable // imitation of standard behaviour. void Abort(); #else inline void Abort() { abort(); } #endif // GTEST_OS_WINDOWS_MOBILE } // namespace posix // The maximum number a BiggestInt can represent. This definition // works no matter BiggestInt is represented in one's complement or // two's complement. // // We cannot rely on numeric_limits in STL, as __int64 and long long // are not part of standard C++ and numeric_limits doesn't need to be // defined for them. const BiggestInt kMaxBiggestInt = ~(static_cast(1) << (8*sizeof(BiggestInt) - 1)); // This template class serves as a compile-time function from size to // type. It maps a size in bytes to a primitive type with that // size. e.g. // // TypeWithSize<4>::UInt // // is typedef-ed to be unsigned int (unsigned integer made up of 4 // bytes). // // Such functionality should belong to STL, but I cannot find it // there. // // Google Test uses this class in the implementation of floating-point // comparison. // // For now it only handles UInt (unsigned int) as that's all Google Test // needs. Other types can be easily added in the future if need // arises. template class TypeWithSize { public: // This prevents the user from using TypeWithSize with incorrect // values of N. typedef void UInt; }; // The specialization for size 4. template <> class TypeWithSize<4> { public: // unsigned int has size 4 in both gcc and MSVC. // // As base/basictypes.h doesn't compile on Windows, we cannot use // uint32, uint64, and etc here. typedef int Int; typedef unsigned int UInt; }; // The specialization for size 8. template <> class TypeWithSize<8> { public: #if GTEST_OS_WINDOWS typedef __int64 Int; typedef unsigned __int64 UInt; #else typedef long long Int; // NOLINT typedef unsigned long long UInt; // NOLINT #endif // GTEST_OS_WINDOWS }; // Integer types of known sizes. typedef TypeWithSize<4>::Int Int32; typedef TypeWithSize<4>::UInt UInt32; typedef TypeWithSize<8>::Int Int64; typedef TypeWithSize<8>::UInt UInt64; typedef TypeWithSize<8>::Int TimeInMillis; // Represents time in milliseconds. // Utilities for command line flags and environment variables. // Macro for referencing flags. #define GTEST_FLAG(name) FLAGS_gtest_##name // Macros for declaring flags. #define GTEST_DECLARE_bool_(name) GTEST_API_ extern bool GTEST_FLAG(name) #define GTEST_DECLARE_int32_(name) \ GTEST_API_ extern ::testing::internal::Int32 GTEST_FLAG(name) #define GTEST_DECLARE_string_(name) \ GTEST_API_ extern ::testing::internal::String GTEST_FLAG(name) // Macros for defining flags. #define GTEST_DEFINE_bool_(name, default_val, doc) \ GTEST_API_ bool GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_int32_(name, default_val, doc) \ GTEST_API_ ::testing::internal::Int32 GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_string_(name, default_val, doc) \ GTEST_API_ ::testing::internal::String GTEST_FLAG(name) = (default_val) // Parses 'str' for a 32-bit signed integer. If successful, writes the result // to *value and returns true; otherwise leaves *value unchanged and returns // false. // TODO(chandlerc): Find a better way to refactor flag and environment parsing // out of both gtest-port.cc and gtest.cc to avoid exporting this utility // function. bool ParseInt32(const Message& src_text, const char* str, Int32* value); // Parses a bool/Int32/string from the environment variable // corresponding to the given Google Test flag. bool BoolFromGTestEnv(const char* flag, bool default_val); GTEST_API_ Int32 Int32FromGTestEnv(const char* flag, Int32 default_val); const char* StringFromGTestEnv(const char* flag, const char* default_val); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #if GTEST_OS_LINUX # include # include # include # include #endif // GTEST_OS_LINUX #include #include #include #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares the String class and functions used internally by // Google Test. They are subject to change without notice. They should not used // by code external to Google Test. // // This header file is #included by . // It should not be #included by other files. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #ifdef __BORLANDC__ // string.h is not guaranteed to provide strcpy on C++ Builder. # include #endif #include #include namespace testing { namespace internal { // String - a UTF-8 string class. // // For historic reasons, we don't use std::string. // // TODO(wan@google.com): replace this class with std::string or // implement it in terms of the latter. // // Note that String can represent both NULL and the empty string, // while std::string cannot represent NULL. // // NULL and the empty string are considered different. NULL is less // than anything (including the empty string) except itself. // // This class only provides minimum functionality necessary for // implementing Google Test. We do not intend to implement a full-fledged // string class here. // // Since the purpose of this class is to provide a substitute for // std::string on platforms where it cannot be used, we define a copy // constructor and assignment operators such that we don't need // conditional compilation in a lot of places. // // In order to make the representation efficient, the d'tor of String // is not virtual. Therefore DO NOT INHERIT FROM String. class GTEST_API_ String { public: // Static utility methods // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. static String ShowCStringQuoted(const char* c_str); // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting the return value using // delete[]. Returns the cloned string, or NULL if the input is // NULL. // // This is different from strdup() in string.h, which allocates // memory using malloc(). static const char* CloneCString(const char* c_str); #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not have the 'ANSI' versions of Win32 APIs. To be // able to pass strings to Win32 APIs on CE we need to convert them // to 'Unicode', UTF-16. // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. // // The wide string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static LPCWSTR AnsiToUtf16(const char* c_str); // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. // // The returned string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static const char* Utf16ToAnsi(LPCWSTR utf16_str); #endif // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CStringEquals(const char* lhs, const char* rhs); // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". If an error occurred during // the conversion, "(failed to convert from wide string)" is // returned. static String ShowWideCString(const wchar_t* wide_c_str); // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. static String ShowWideCStringQuoted(const wchar_t* wide_c_str); // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Compares two C strings, ignoring case. Returns true iff they // have the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs); // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. static bool CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing // 0). If 4096 characters are not enough to format the input, // "" is returned. static String Format(const char* format, ...); // C'tors // The default c'tor constructs a NULL string. String() : c_str_(NULL), length_(0) {} // Constructs a String by cloning a 0-terminated C string. String(const char* a_c_str) { // NOLINT if (a_c_str == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(a_c_str, strlen(a_c_str)); } } // Constructs a String by copying a given number of chars from a // buffer. E.g. String("hello", 3) creates the string "hel", // String("a\0bcd", 4) creates "a\0bc", String(NULL, 0) creates "", // and String(NULL, 1) results in access violation. String(const char* buffer, size_t a_length) { ConstructNonNull(buffer, a_length); } // The copy c'tor creates a new copy of the string. The two // String objects do not share content. String(const String& str) : c_str_(NULL), length_(0) { *this = str; } // D'tor. String is intended to be a final class, so the d'tor // doesn't need to be virtual. ~String() { delete[] c_str_; } // Allows a String to be implicitly converted to an ::std::string or // ::string, and vice versa. Converting a String containing a NULL // pointer to ::std::string or ::string is undefined behavior. // Converting a ::std::string or ::string containing an embedded NUL // character to a String will result in the prefix up to the first // NUL character. String(const ::std::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::std::string() const { return ::std::string(c_str(), length()); } #if GTEST_HAS_GLOBAL_STRING String(const ::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::string() const { return ::string(c_str(), length()); } #endif // GTEST_HAS_GLOBAL_STRING // Returns true iff this is an empty string (i.e. ""). bool empty() const { return (c_str() != NULL) && (length() == 0); } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int Compare(const String& rhs) const; // Returns true iff this String equals the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator==(const char* a_c_str) const { return Compare(a_c_str) == 0; } // Returns true iff this String is less than the given String. A // NULL string is considered less than "". bool operator<(const String& rhs) const { return Compare(rhs) < 0; } // Returns true iff this String doesn't equal the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator!=(const char* a_c_str) const { return !(*this == a_c_str); } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool EndsWith(const char* suffix) const; // Returns true iff this String ends with the given suffix, not considering // case. Any String is considered to end with a NULL or empty suffix. bool EndsWithCaseInsensitive(const char* suffix) const; // Returns the length of the encapsulated string, or 0 if the // string is NULL. size_t length() const { return length_; } // Gets the 0-terminated C string this String object represents. // The String object still owns the string. Therefore the caller // should NOT delete the return value. const char* c_str() const { return c_str_; } // Assigns a C string to this object. Self-assignment works. const String& operator=(const char* a_c_str) { return *this = String(a_c_str); } // Assigns a String object to this object. Self-assignment works. const String& operator=(const String& rhs) { if (this != &rhs) { delete[] c_str_; if (rhs.c_str() == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(rhs.c_str(), rhs.length()); } } return *this; } private: // Constructs a non-NULL String from the given content. This // function can only be called when c_str_ has not been allocated. // ConstructNonNull(NULL, 0) results in an empty string (""). // ConstructNonNull(NULL, non_zero) is undefined behavior. void ConstructNonNull(const char* buffer, size_t a_length) { char* const str = new char[a_length + 1]; memcpy(str, buffer, a_length); str[a_length] = '\0'; c_str_ = str; length_ = a_length; } const char* c_str_; size_t length_; }; // class String // Streams a String to an ostream. Each '\0' character in the String // is replaced with "\\0". inline ::std::ostream& operator<<(::std::ostream& os, const String& str) { if (str.c_str() == NULL) { os << "(null)"; } else { const char* const c_str = str.c_str(); for (size_t i = 0; i != str.length(); i++) { if (c_str[i] == '\0') { os << "\\0"; } else { os << c_str[i]; } } } return os; } // Gets the content of the stringstream's buffer as a String. Each '\0' // character in the buffer is replaced with "\\0". GTEST_API_ String StringStreamToString(::std::stringstream* stream); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: keith.ray@gmail.com (Keith Ray) // // Google Test filepath utilities // // This header file declares classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included in . // Do not include this header file separately! #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ namespace testing { namespace internal { // FilePath - a class for file and directory pathname manipulation which // handles platform-specific conventions (like the pathname separator). // Used for helper functions for naming files in a directory for xml output. // Except for Set methods, all methods are const or static, which provides an // "immutable value object" -- useful for peace of mind. // A FilePath with a value ending in a path separator ("like/this/") represents // a directory, otherwise it is assumed to represent a file. In either case, // it may or may not represent an actual file or directory in the file system. // Names are NOT checked for syntax correctness -- no checking for illegal // characters, malformed paths, etc. class GTEST_API_ FilePath { public: FilePath() : pathname_("") { } FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } explicit FilePath(const char* pathname) : pathname_(pathname) { Normalize(); } explicit FilePath(const String& pathname) : pathname_(pathname) { Normalize(); } FilePath& operator=(const FilePath& rhs) { Set(rhs); return *this; } void Set(const FilePath& rhs) { pathname_ = rhs.pathname_; } String ToString() const { return pathname_; } const char* c_str() const { return pathname_.c_str(); } // Returns the current working directory, or "" if unsuccessful. static FilePath GetCurrentDir(); // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. static FilePath MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension); // Given directory = "dir", relative_path = "test.xml", // returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. static FilePath ConcatPaths(const FilePath& directory, const FilePath& relative_path); // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. static FilePath GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension); // Returns true iff the path is NULL or "". bool IsEmpty() const { return c_str() == NULL || *c_str() == '\0'; } // If input name has a trailing separator character, removes it and returns // the name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath RemoveTrailingPathSeparator() const; // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveDirectoryName() const; // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveFileName() const; // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath RemoveExtension(const char* extension) const; // Creates directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create // directories for any reason. Will also return false if the FilePath does // not represent a directory (that is, it doesn't end with a path separator). bool CreateDirectoriesRecursively() const; // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool CreateFolder() const; // Returns true if FilePath describes something in the file-system, // either a file, directory, or whatever, and that something exists. bool FileOrDirectoryExists() const; // Returns true if pathname describes a directory in the file-system // that exists. bool DirectoryExists() const; // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool IsDirectory() const; // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool IsRootDirectory() const; // Returns true if pathname describes an absolute path. bool IsAbsolutePath() const; private: // Replaces multiple consecutive separators with a single separator. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // // A pathname with multiple consecutive separators may occur either through // user error or as a result of some scripts or APIs that generate a pathname // with a trailing separator. On other platforms the same API or script // may NOT generate a pathname with a trailing "/". Then elsewhere that // pathname may have another "/" and pathname components added to it, // without checking for the separator already being there. // The script language and operating system may allow paths like "foo//bar" // but some of the functions in FilePath will not handle that correctly. In // particular, RemoveTrailingPathSeparator() only removes one separator, and // it is called in CreateDirectoriesRecursively() assuming that it will change // a pathname from directory syntax (trailing separator) to filename syntax. // // On Windows this method also replaces the alternate path separator '/' with // the primary path separator '\\', so that for example "bar\\/\\foo" becomes // "bar\\foo". void Normalize(); // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FindLastPathSeparator() const; String pathname_; }; // class FilePath } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ // This file was GENERATED by command: // pump.py gtest-type-util.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Type utilities needed for implementing typed and type-parameterized // tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently we support at most 50 types in a list, and at most 50 // type-parameterized tests in one type-parameterized test case. // Please contact googletestframework@googlegroups.com if you need // more. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // #ifdef __GNUC__ is too general here. It is possible to use gcc without using // libstdc++ (which is where cxxabi.h comes from). # ifdef __GLIBCXX__ # include # elif defined(__HP_aCC) # include # endif // __GLIBCXX__ namespace testing { namespace internal { // GetTypeName() returns a human-readable name of type T. // NB: This function is also used in Google Mock, so don't move it inside of // the typed-test-only section below. template String GetTypeName() { # if GTEST_HAS_RTTI const char* const name = typeid(T).name(); # if defined(__GLIBCXX__) || defined(__HP_aCC) int status = 0; // gcc's implementation of typeid(T).name() mangles the type name, // so we have to demangle it. # ifdef __GLIBCXX__ using abi::__cxa_demangle; # endif // __GLIBCXX__ char* const readable_name = __cxa_demangle(name, 0, 0, &status); const String name_str(status == 0 ? readable_name : name); free(readable_name); return name_str; # else return name; # endif // __GLIBCXX__ || __HP_aCC # else return ""; # endif // GTEST_HAS_RTTI } #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // AssertyTypeEq::type is defined iff T1 and T2 are the same // type. This can be used as a compile-time assertion to ensure that // two types are equal. template struct AssertTypeEq; template struct AssertTypeEq { typedef bool type; }; // A unique type used as the default value for the arguments of class // template Types. This allows us to simulate variadic templates // (e.g. Types, Type, and etc), which C++ doesn't // support directly. struct None {}; // The following family of struct and struct templates are used to // represent type lists. In particular, TypesN // represents a type list with N types (T1, T2, ..., and TN) in it. // Except for Types0, every struct in the family has two member types: // Head for the first type in the list, and Tail for the rest of the // list. // The empty type list. struct Types0 {}; // Type lists of length 1, 2, 3, and so on. template struct Types1 { typedef T1 Head; typedef Types0 Tail; }; template struct Types2 { typedef T1 Head; typedef Types1 Tail; }; template struct Types3 { typedef T1 Head; typedef Types2 Tail; }; template struct Types4 { typedef T1 Head; typedef Types3 Tail; }; template struct Types5 { typedef T1 Head; typedef Types4 Tail; }; template struct Types6 { typedef T1 Head; typedef Types5 Tail; }; template struct Types7 { typedef T1 Head; typedef Types6 Tail; }; template struct Types8 { typedef T1 Head; typedef Types7 Tail; }; template struct Types9 { typedef T1 Head; typedef Types8 Tail; }; template struct Types10 { typedef T1 Head; typedef Types9 Tail; }; template struct Types11 { typedef T1 Head; typedef Types10 Tail; }; template struct Types12 { typedef T1 Head; typedef Types11 Tail; }; template struct Types13 { typedef T1 Head; typedef Types12 Tail; }; template struct Types14 { typedef T1 Head; typedef Types13 Tail; }; template struct Types15 { typedef T1 Head; typedef Types14 Tail; }; template struct Types16 { typedef T1 Head; typedef Types15 Tail; }; template struct Types17 { typedef T1 Head; typedef Types16 Tail; }; template struct Types18 { typedef T1 Head; typedef Types17 Tail; }; template struct Types19 { typedef T1 Head; typedef Types18 Tail; }; template struct Types20 { typedef T1 Head; typedef Types19 Tail; }; template struct Types21 { typedef T1 Head; typedef Types20 Tail; }; template struct Types22 { typedef T1 Head; typedef Types21 Tail; }; template struct Types23 { typedef T1 Head; typedef Types22 Tail; }; template struct Types24 { typedef T1 Head; typedef Types23 Tail; }; template struct Types25 { typedef T1 Head; typedef Types24 Tail; }; template struct Types26 { typedef T1 Head; typedef Types25 Tail; }; template struct Types27 { typedef T1 Head; typedef Types26 Tail; }; template struct Types28 { typedef T1 Head; typedef Types27 Tail; }; template struct Types29 { typedef T1 Head; typedef Types28 Tail; }; template struct Types30 { typedef T1 Head; typedef Types29 Tail; }; template struct Types31 { typedef T1 Head; typedef Types30 Tail; }; template struct Types32 { typedef T1 Head; typedef Types31 Tail; }; template struct Types33 { typedef T1 Head; typedef Types32 Tail; }; template struct Types34 { typedef T1 Head; typedef Types33 Tail; }; template struct Types35 { typedef T1 Head; typedef Types34 Tail; }; template struct Types36 { typedef T1 Head; typedef Types35 Tail; }; template struct Types37 { typedef T1 Head; typedef Types36 Tail; }; template struct Types38 { typedef T1 Head; typedef Types37 Tail; }; template struct Types39 { typedef T1 Head; typedef Types38 Tail; }; template struct Types40 { typedef T1 Head; typedef Types39 Tail; }; template struct Types41 { typedef T1 Head; typedef Types40 Tail; }; template struct Types42 { typedef T1 Head; typedef Types41 Tail; }; template struct Types43 { typedef T1 Head; typedef Types42 Tail; }; template struct Types44 { typedef T1 Head; typedef Types43 Tail; }; template struct Types45 { typedef T1 Head; typedef Types44 Tail; }; template struct Types46 { typedef T1 Head; typedef Types45 Tail; }; template struct Types47 { typedef T1 Head; typedef Types46 Tail; }; template struct Types48 { typedef T1 Head; typedef Types47 Tail; }; template struct Types49 { typedef T1 Head; typedef Types48 Tail; }; template struct Types50 { typedef T1 Head; typedef Types49 Tail; }; } // namespace internal // We don't want to require the users to write TypesN<...> directly, // as that would require them to count the length. Types<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Types // will appear as Types in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Types, and Google Test will translate // that to TypesN internally to make error messages // readable. The translation is done by the 'type' member of the // Types template. template struct Types { typedef internal::Types50 type; }; template <> struct Types { typedef internal::Types0 type; }; template struct Types { typedef internal::Types1 type; }; template struct Types { typedef internal::Types2 type; }; template struct Types { typedef internal::Types3 type; }; template struct Types { typedef internal::Types4 type; }; template struct Types { typedef internal::Types5 type; }; template struct Types { typedef internal::Types6 type; }; template struct Types { typedef internal::Types7 type; }; template struct Types { typedef internal::Types8 type; }; template struct Types { typedef internal::Types9 type; }; template struct Types { typedef internal::Types10 type; }; template struct Types { typedef internal::Types11 type; }; template struct Types { typedef internal::Types12 type; }; template struct Types { typedef internal::Types13 type; }; template struct Types { typedef internal::Types14 type; }; template struct Types { typedef internal::Types15 type; }; template struct Types { typedef internal::Types16 type; }; template struct Types { typedef internal::Types17 type; }; template struct Types { typedef internal::Types18 type; }; template struct Types { typedef internal::Types19 type; }; template struct Types { typedef internal::Types20 type; }; template struct Types { typedef internal::Types21 type; }; template struct Types { typedef internal::Types22 type; }; template struct Types { typedef internal::Types23 type; }; template struct Types { typedef internal::Types24 type; }; template struct Types { typedef internal::Types25 type; }; template struct Types { typedef internal::Types26 type; }; template struct Types { typedef internal::Types27 type; }; template struct Types { typedef internal::Types28 type; }; template struct Types { typedef internal::Types29 type; }; template struct Types { typedef internal::Types30 type; }; template struct Types { typedef internal::Types31 type; }; template struct Types { typedef internal::Types32 type; }; template struct Types { typedef internal::Types33 type; }; template struct Types { typedef internal::Types34 type; }; template struct Types { typedef internal::Types35 type; }; template struct Types { typedef internal::Types36 type; }; template struct Types { typedef internal::Types37 type; }; template struct Types { typedef internal::Types38 type; }; template struct Types { typedef internal::Types39 type; }; template struct Types { typedef internal::Types40 type; }; template struct Types { typedef internal::Types41 type; }; template struct Types { typedef internal::Types42 type; }; template struct Types { typedef internal::Types43 type; }; template struct Types { typedef internal::Types44 type; }; template struct Types { typedef internal::Types45 type; }; template struct Types { typedef internal::Types46 type; }; template struct Types { typedef internal::Types47 type; }; template struct Types { typedef internal::Types48 type; }; template struct Types { typedef internal::Types49 type; }; namespace internal { # define GTEST_TEMPLATE_ template class // The template "selector" struct TemplateSel is used to // represent Tmpl, which must be a class template with one type // parameter, as a type. TemplateSel::Bind::type is defined // as the type Tmpl. This allows us to actually instantiate the // template "selected" by TemplateSel. // // This trick is necessary for simulating typedef for class templates, // which C++ doesn't support directly. template struct TemplateSel { template struct Bind { typedef Tmpl type; }; }; # define GTEST_BIND_(TmplSel, T) \ TmplSel::template Bind::type // A unique struct template used as the default value for the // arguments of class template Templates. This allows us to simulate // variadic templates (e.g. Templates, Templates, // and etc), which C++ doesn't support directly. template struct NoneT {}; // The following family of struct and struct templates are used to // represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except // for Templates0, every struct in the family has two member types: // Head for the selector of the first template in the list, and Tail // for the rest of the list. // The empty template list. struct Templates0 {}; // Template lists of length 1, 2, 3, and so on. template struct Templates1 { typedef TemplateSel Head; typedef Templates0 Tail; }; template struct Templates2 { typedef TemplateSel Head; typedef Templates1 Tail; }; template struct Templates3 { typedef TemplateSel Head; typedef Templates2 Tail; }; template struct Templates4 { typedef TemplateSel Head; typedef Templates3 Tail; }; template struct Templates5 { typedef TemplateSel Head; typedef Templates4 Tail; }; template struct Templates6 { typedef TemplateSel Head; typedef Templates5 Tail; }; template struct Templates7 { typedef TemplateSel Head; typedef Templates6 Tail; }; template struct Templates8 { typedef TemplateSel Head; typedef Templates7 Tail; }; template struct Templates9 { typedef TemplateSel Head; typedef Templates8 Tail; }; template struct Templates10 { typedef TemplateSel Head; typedef Templates9 Tail; }; template struct Templates11 { typedef TemplateSel Head; typedef Templates10 Tail; }; template struct Templates12 { typedef TemplateSel Head; typedef Templates11 Tail; }; template struct Templates13 { typedef TemplateSel Head; typedef Templates12 Tail; }; template struct Templates14 { typedef TemplateSel Head; typedef Templates13 Tail; }; template struct Templates15 { typedef TemplateSel Head; typedef Templates14 Tail; }; template struct Templates16 { typedef TemplateSel Head; typedef Templates15 Tail; }; template struct Templates17 { typedef TemplateSel Head; typedef Templates16 Tail; }; template struct Templates18 { typedef TemplateSel Head; typedef Templates17 Tail; }; template struct Templates19 { typedef TemplateSel Head; typedef Templates18 Tail; }; template struct Templates20 { typedef TemplateSel Head; typedef Templates19 Tail; }; template struct Templates21 { typedef TemplateSel Head; typedef Templates20 Tail; }; template struct Templates22 { typedef TemplateSel Head; typedef Templates21 Tail; }; template struct Templates23 { typedef TemplateSel Head; typedef Templates22 Tail; }; template struct Templates24 { typedef TemplateSel Head; typedef Templates23 Tail; }; template struct Templates25 { typedef TemplateSel Head; typedef Templates24 Tail; }; template struct Templates26 { typedef TemplateSel Head; typedef Templates25 Tail; }; template struct Templates27 { typedef TemplateSel Head; typedef Templates26 Tail; }; template struct Templates28 { typedef TemplateSel Head; typedef Templates27 Tail; }; template struct Templates29 { typedef TemplateSel Head; typedef Templates28 Tail; }; template struct Templates30 { typedef TemplateSel Head; typedef Templates29 Tail; }; template struct Templates31 { typedef TemplateSel Head; typedef Templates30 Tail; }; template struct Templates32 { typedef TemplateSel Head; typedef Templates31 Tail; }; template struct Templates33 { typedef TemplateSel Head; typedef Templates32 Tail; }; template struct Templates34 { typedef TemplateSel Head; typedef Templates33 Tail; }; template struct Templates35 { typedef TemplateSel Head; typedef Templates34 Tail; }; template struct Templates36 { typedef TemplateSel Head; typedef Templates35 Tail; }; template struct Templates37 { typedef TemplateSel Head; typedef Templates36 Tail; }; template struct Templates38 { typedef TemplateSel Head; typedef Templates37 Tail; }; template struct Templates39 { typedef TemplateSel Head; typedef Templates38 Tail; }; template struct Templates40 { typedef TemplateSel Head; typedef Templates39 Tail; }; template struct Templates41 { typedef TemplateSel Head; typedef Templates40 Tail; }; template struct Templates42 { typedef TemplateSel Head; typedef Templates41 Tail; }; template struct Templates43 { typedef TemplateSel Head; typedef Templates42 Tail; }; template struct Templates44 { typedef TemplateSel Head; typedef Templates43 Tail; }; template struct Templates45 { typedef TemplateSel Head; typedef Templates44 Tail; }; template struct Templates46 { typedef TemplateSel Head; typedef Templates45 Tail; }; template struct Templates47 { typedef TemplateSel Head; typedef Templates46 Tail; }; template struct Templates48 { typedef TemplateSel Head; typedef Templates47 Tail; }; template struct Templates49 { typedef TemplateSel Head; typedef Templates48 Tail; }; template struct Templates50 { typedef TemplateSel Head; typedef Templates49 Tail; }; // We don't want to require the users to write TemplatesN<...> directly, // as that would require them to count the length. Templates<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Templates // will appear as Templates in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Templates, and Google Test will translate // that to TemplatesN internally to make error messages // readable. The translation is done by the 'type' member of the // Templates template. template struct Templates { typedef Templates50 type; }; template <> struct Templates { typedef Templates0 type; }; template struct Templates { typedef Templates1 type; }; template struct Templates { typedef Templates2 type; }; template struct Templates { typedef Templates3 type; }; template struct Templates { typedef Templates4 type; }; template struct Templates { typedef Templates5 type; }; template struct Templates { typedef Templates6 type; }; template struct Templates { typedef Templates7 type; }; template struct Templates { typedef Templates8 type; }; template struct Templates { typedef Templates9 type; }; template struct Templates { typedef Templates10 type; }; template struct Templates { typedef Templates11 type; }; template struct Templates { typedef Templates12 type; }; template struct Templates { typedef Templates13 type; }; template struct Templates { typedef Templates14 type; }; template struct Templates { typedef Templates15 type; }; template struct Templates { typedef Templates16 type; }; template struct Templates { typedef Templates17 type; }; template struct Templates { typedef Templates18 type; }; template struct Templates { typedef Templates19 type; }; template struct Templates { typedef Templates20 type; }; template struct Templates { typedef Templates21 type; }; template struct Templates { typedef Templates22 type; }; template struct Templates { typedef Templates23 type; }; template struct Templates { typedef Templates24 type; }; template struct Templates { typedef Templates25 type; }; template struct Templates { typedef Templates26 type; }; template struct Templates { typedef Templates27 type; }; template struct Templates { typedef Templates28 type; }; template struct Templates { typedef Templates29 type; }; template struct Templates { typedef Templates30 type; }; template struct Templates { typedef Templates31 type; }; template struct Templates { typedef Templates32 type; }; template struct Templates { typedef Templates33 type; }; template struct Templates { typedef Templates34 type; }; template struct Templates { typedef Templates35 type; }; template struct Templates { typedef Templates36 type; }; template struct Templates { typedef Templates37 type; }; template struct Templates { typedef Templates38 type; }; template struct Templates { typedef Templates39 type; }; template struct Templates { typedef Templates40 type; }; template struct Templates { typedef Templates41 type; }; template struct Templates { typedef Templates42 type; }; template struct Templates { typedef Templates43 type; }; template struct Templates { typedef Templates44 type; }; template struct Templates { typedef Templates45 type; }; template struct Templates { typedef Templates46 type; }; template struct Templates { typedef Templates47 type; }; template struct Templates { typedef Templates48 type; }; template struct Templates { typedef Templates49 type; }; // The TypeList template makes it possible to use either a single type // or a Types<...> list in TYPED_TEST_CASE() and // INSTANTIATE_TYPED_TEST_CASE_P(). template struct TypeList { typedef Types1 type; }; template struct TypeList > { typedef typename Types::type type; }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // Due to C++ preprocessor weirdness, we need double indirection to // concatenate two tokens when one of them is __LINE__. Writing // // foo ## __LINE__ // // will result in the token foo__LINE__, instead of foo followed by // the current line number. For more details, see // http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6 #define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar) #define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar // Google Test defines the testing::Message class to allow construction of // test messages via the << operator. The idea is that anything // streamable to std::ostream can be streamed to a testing::Message. // This allows a user to use his own types in Google Test assertions by // overloading the << operator. // // util/gtl/stl_logging-inl.h overloads << for STL containers. These // overloads cannot be defined in the std namespace, as that will be // undefined behavior. Therefore, they are defined in the global // namespace instead. // // C++'s symbol lookup rule (i.e. Koenig lookup) says that these // overloads are visible in either the std namespace or the global // namespace, but not other namespaces, including the testing // namespace which Google Test's Message class is in. // // To allow STL containers (and other types that has a << operator // defined in the global namespace) to be used in Google Test assertions, // testing::Message must access the custom << operator from the global // namespace. Hence this helper function. // // Note: Jeffrey Yasskin suggested an alternative fix by "using // ::operator<<;" in the definition of Message's operator<<. That fix // doesn't require a helper function, but unfortunately doesn't // compile with MSVC. template inline void GTestStreamToHelper(std::ostream* os, const T& val) { *os << val; } class ProtocolMessage; namespace proto2 { class Message; } namespace testing { // Forward declarations. class AssertionResult; // Result of an assertion. class Message; // Represents a failure message. class Test; // Represents a test. class TestInfo; // Information about a test. class TestPartResult; // Result of a test part. class UnitTest; // A collection of test cases. template ::std::string PrintToString(const T& value); namespace internal { struct TraceInfo; // Information about a trace point. class ScopedTrace; // Implements scoped trace. class TestInfoImpl; // Opaque implementation of TestInfo class UnitTestImpl; // Opaque implementation of UnitTest // How many times InitGoogleTest() has been called. extern int g_init_gtest_count; // The text used in failure messages to indicate the start of the // stack trace. GTEST_API_ extern const char kStackTraceMarker[]; // A secret type that Google Test users don't know about. It has no // definition on purpose. Therefore it's impossible to create a // Secret object, which is what we want. class Secret; // Two overloaded helpers for checking at compile time whether an // expression is a null pointer literal (i.e. NULL or any 0-valued // compile-time integral constant). Their return values have // different sizes, so we can use sizeof() to test which version is // picked by the compiler. These helpers have no implementations, as // we only need their signatures. // // Given IsNullLiteralHelper(x), the compiler will pick the first // version if x can be implicitly converted to Secret*, and pick the // second version otherwise. Since Secret is a secret and incomplete // type, the only expression a user can write that has type Secret* is // a null pointer literal. Therefore, we know that x is a null // pointer literal if and only if the first version is picked by the // compiler. char IsNullLiteralHelper(Secret* p); char (&IsNullLiteralHelper(...))[2]; // NOLINT // A compile-time bool constant that is true if and only if x is a // null pointer literal (i.e. NULL or any 0-valued compile-time // integral constant). #ifdef GTEST_ELLIPSIS_NEEDS_POD_ // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_IS_NULL_LITERAL_(x) false #else # define GTEST_IS_NULL_LITERAL_(x) \ (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1) #endif // GTEST_ELLIPSIS_NEEDS_POD_ // Appends the user-supplied message to the Google-Test-generated message. GTEST_API_ String AppendUserMessage(const String& gtest_msg, const Message& user_msg); // A helper class for creating scoped traces in user programs. class GTEST_API_ ScopedTrace { public: // The c'tor pushes the given source file location and message onto // a trace stack maintained by Google Test. ScopedTrace(const char* file, int line, const Message& message); // The d'tor pops the info pushed by the c'tor. // // Note that the d'tor is not virtual in order to be efficient. // Don't inherit from ScopedTrace! ~ScopedTrace(); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedTrace); } GTEST_ATTRIBUTE_UNUSED_; // A ScopedTrace object does its job in its // c'tor and d'tor. Therefore it doesn't // need to be used otherwise. // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); // The Symbian compiler has a bug that prevents it from selecting the // correct overload of FormatForComparisonFailureMessage (see below) // unless we pass the first argument by reference. If we do that, // however, Visual Age C++ 10.1 generates a compiler error. Therefore // we only apply the work-around for Symbian. #if defined(__SYMBIAN32__) # define GTEST_CREF_WORKAROUND_ const& #else # define GTEST_CREF_WORKAROUND_ #endif // When this operand is a const char* or char*, if the other operand // is a ::std::string or ::string, we print this operand as a C string // rather than a pointer (we do the same for wide strings); otherwise // we print it as a pointer to be safe. // This internal macro is used to avoid duplicated code. #define GTEST_FORMAT_IMPL_(operand2_type, operand1_printer)\ inline String FormatForComparisonFailureMessage(\ operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ }\ inline String FormatForComparisonFailureMessage(\ const operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ } GTEST_FORMAT_IMPL_(::std::string, String::ShowCStringQuoted) #if GTEST_HAS_STD_WSTRING GTEST_FORMAT_IMPL_(::std::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_STRING GTEST_FORMAT_IMPL_(::string, String::ShowCStringQuoted) #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING GTEST_FORMAT_IMPL_(::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_GLOBAL_WSTRING #undef GTEST_FORMAT_IMPL_ // The next four overloads handle the case where the operand being // printed is a char/wchar_t pointer and the other operand is not a // string/wstring object. In such cases, we just print the operand as // a pointer to be safe. #define GTEST_FORMAT_CHAR_PTR_IMPL_(CharType) \ template \ String FormatForComparisonFailureMessage(CharType* GTEST_CREF_WORKAROUND_ p, \ const T&) { \ return PrintToString(static_cast(p)); \ } GTEST_FORMAT_CHAR_PTR_IMPL_(char) GTEST_FORMAT_CHAR_PTR_IMPL_(const char) GTEST_FORMAT_CHAR_PTR_IMPL_(wchar_t) GTEST_FORMAT_CHAR_PTR_IMPL_(const wchar_t) #undef GTEST_FORMAT_CHAR_PTR_IMPL_ // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. GTEST_API_ AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case); // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. GTEST_API_ String GetBoolAssertionFailureMessage( const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value); // This template class represents an IEEE floating-point number // (either single-precision or double-precision, depending on the // template parameters). // // The purpose of this class is to do more sophisticated number // comparison. (Due to round-off error, etc, it's very unlikely that // two floating-points will be equal exactly. Hence a naive // comparison by the == operation often doesn't work.) // // Format of IEEE floating-point: // // The most-significant bit being the leftmost, an IEEE // floating-point looks like // // sign_bit exponent_bits fraction_bits // // Here, sign_bit is a single bit that designates the sign of the // number. // // For float, there are 8 exponent bits and 23 fraction bits. // // For double, there are 11 exponent bits and 52 fraction bits. // // More details can be found at // http://en.wikipedia.org/wiki/IEEE_floating-point_standard. // // Template parameter: // // RawType: the raw floating-point type (either float or double) template class FloatingPoint { public: // Defines the unsigned integer type that has the same size as the // floating point number. typedef typename TypeWithSize::UInt Bits; // Constants. // # of bits in a number. static const size_t kBitCount = 8*sizeof(RawType); // # of fraction bits in a number. static const size_t kFractionBitCount = std::numeric_limits::digits - 1; // # of exponent bits in a number. static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount; // The mask for the sign bit. static const Bits kSignBitMask = static_cast(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when // comparing two numbers. The larger the value, the more error we // allow. A 0 value means that two numbers must be exactly the same // to be considered equal. // // The maximum error of a single floating-point operation is 0.5 // units in the last place. On Intel CPU's, all floating-point // calculations are done with 80-bit precision, while double has 64 // bits. Therefore, 4 should be enough for ordinary use. // // See the following article for more details on ULP: // http://www.cygnus-software.com/papers/comparingfloats/comparingfloats.htm. static const size_t kMaxUlps = 4; // Constructs a FloatingPoint from a raw floating-point number. // // On an Intel CPU, passing a non-normalized NAN (Not a Number) // around may change its bits, although the new value is guaranteed // to be also a NAN. Therefore, don't expect this constructor to // preserve the bits in x when x is a NAN. explicit FloatingPoint(const RawType& x) { u_.value_ = x; } // Static methods // Reinterprets a bit pattern as a floating-point number. // // This function is needed to test the AlmostEquals() method. static RawType ReinterpretBits(const Bits bits) { FloatingPoint fp(0); fp.u_.bits_ = bits; return fp.u_.value_; } // Returns the floating-point number that represent positive infinity. static RawType Infinity() { return ReinterpretBits(kExponentBitMask); } // Non-static methods // Returns the bits that represents this number. const Bits &bits() const { return u_.bits_; } // Returns the exponent bits of this number. Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } // Returns the fraction bits of this number. Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } // Returns the sign bit of this number. Bits sign_bit() const { return kSignBitMask & u_.bits_; } // Returns true iff this is NAN (not a number). bool is_nan() const { // It's a NAN if the exponent bits are all ones and the fraction // bits are not entirely zeros. return (exponent_bits() == kExponentBitMask) && (fraction_bits() != 0); } // Returns true iff this number is at most kMaxUlps ULP's away from // rhs. In particular, this function: // // - returns false if either number is (or both are) NAN. // - treats really large numbers as almost equal to infinity. // - thinks +0.0 and -0.0 are 0 DLP's apart. bool AlmostEquals(const FloatingPoint& rhs) const { // The IEEE standard says that any comparison operation involving // a NAN must return false. if (is_nan() || rhs.is_nan()) return false; return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) <= kMaxUlps; } private: // The data type used to store the actual floating-point number. union FloatingPointUnion { RawType value_; // The raw floating-point number. Bits bits_; // The bits that represent the number. }; // Converts an integer from the sign-and-magnitude representation to // the biased representation. More precisely, let N be 2 to the // power of (kBitCount - 1), an integer x is represented by the // unsigned number x + N. // // For instance, // // -N + 1 (the most negative number representable using // sign-and-magnitude) is represented by 1; // 0 is represented by N; and // N - 1 (the biggest number representable using // sign-and-magnitude) is represented by 2N - 1. // // Read http://en.wikipedia.org/wiki/Signed_number_representations // for more details on signed number representations. static Bits SignAndMagnitudeToBiased(const Bits &sam) { if (kSignBitMask & sam) { // sam represents a negative number. return ~sam + 1; } else { // sam represents a positive number. return kSignBitMask | sam; } } // Given two numbers in the sign-and-magnitude representation, // returns the distance between them as an unsigned number. static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &sam1, const Bits &sam2) { const Bits biased1 = SignAndMagnitudeToBiased(sam1); const Bits biased2 = SignAndMagnitudeToBiased(sam2); return (biased1 >= biased2) ? (biased1 - biased2) : (biased2 - biased1); } FloatingPointUnion u_; }; // Typedefs the instances of the FloatingPoint template class that we // care to use. typedef FloatingPoint Float; typedef FloatingPoint Double; // In order to catch the mistake of putting tests that use different // test fixture classes in the same test case, we need to assign // unique IDs to fixture classes and compare them. The TypeId type is // used to hold such IDs. The user should treat TypeId as an opaque // type: the only operation allowed on TypeId values is to compare // them for equality using the == operator. typedef const void* TypeId; template class TypeIdHelper { public: // dummy_ must not have a const type. Otherwise an overly eager // compiler (e.g. MSVC 7.1 & 8.0) may try to merge // TypeIdHelper::dummy_ for different Ts as an "optimization". static bool dummy_; }; template bool TypeIdHelper::dummy_ = false; // GetTypeId() returns the ID of type T. Different values will be // returned for different types. Calling the function twice with the // same type argument is guaranteed to return the same ID. template TypeId GetTypeId() { // The compiler is required to allocate a different // TypeIdHelper::dummy_ variable for each T used to instantiate // the template. Therefore, the address of dummy_ is guaranteed to // be unique. return &(TypeIdHelper::dummy_); } // Returns the type ID of ::testing::Test. Always call this instead // of GetTypeId< ::testing::Test>() to get the type ID of // ::testing::Test, as the latter may give the wrong result due to a // suspected linker bug when compiling Google Test as a Mac OS X // framework. GTEST_API_ TypeId GetTestTypeId(); // Defines the abstract factory interface that creates instances // of a Test object. class TestFactoryBase { public: virtual ~TestFactoryBase() {} // Creates a test instance to run. The instance is both created and destroyed // within TestInfoImpl::Run() virtual Test* CreateTest() = 0; protected: TestFactoryBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase); }; // This class provides implementation of TeastFactoryBase interface. // It is used in TEST and TEST_F macros. template class TestFactoryImpl : public TestFactoryBase { public: virtual Test* CreateTest() { return new TestClass; } }; #if GTEST_OS_WINDOWS // Predicate-formatters for implementing the HRESULT checking macros // {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED} // We pass a long instead of HRESULT to avoid causing an // include dependency for the HRESULT type. GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr, long hr); // NOLINT GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr, long hr); // NOLINT #endif // GTEST_OS_WINDOWS // Types of SetUpTestCase() and TearDownTestCase() functions. typedef void (*SetUpTestCaseFunc)(); typedef void (*TearDownTestCaseFunc)(); // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param text representation of the test's value parameter, // or NULL if this is not a type-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. GTEST_API_ TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory); // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr); #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // State of the definition of a type-parameterized test case. class GTEST_API_ TypedTestCasePState { public: TypedTestCasePState() : registered_(false) {} // Adds the given test name to defined_test_names_ and return true // if the test case hasn't been registered; otherwise aborts the // program. bool AddTestName(const char* file, int line, const char* case_name, const char* test_name) { if (registered_) { fprintf(stderr, "%s Test %s must be defined before " "REGISTER_TYPED_TEST_CASE_P(%s, ...).\n", FormatFileLocation(file, line).c_str(), test_name, case_name); fflush(stderr); posix::Abort(); } defined_test_names_.insert(test_name); return true; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests); private: bool registered_; ::std::set defined_test_names_; }; // Skips to the first non-space char after the first comma in 'str'; // returns NULL if no comma is found in 'str'. inline const char* SkipComma(const char* str) { const char* comma = strchr(str, ','); if (comma == NULL) { return NULL; } while (IsSpace(*(++comma))) {} return comma; } // Returns the prefix of 'str' before the first comma in it; returns // the entire string if it contains no comma. inline String GetPrefixUntilComma(const char* str) { const char* comma = strchr(str, ','); return comma == NULL ? String(str) : String(str, comma - str); } // TypeParameterizedTest::Register() // registers a list of type-parameterized tests with Google Test. The // return value is insignificant - we just need to return something // such that we can call this function in a namespace scope. // // Implementation note: The GTEST_TEMPLATE_ macro declares a template // template parameter. It's defined in gtest-type-util.h. template class TypeParameterizedTest { public: // 'index' is the index of the test in the type list 'Types' // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase, // Types). Valid values for 'index' are [0, N - 1] where N is the // length of Types. static bool Register(const char* prefix, const char* case_name, const char* test_names, int index) { typedef typename Types::Head Type; typedef Fixture FixtureClass; typedef typename GTEST_BIND_(TestSel, Type) TestClass; // First, registers the first type-parameterized test in the type // list. MakeAndRegisterTestInfo( String::Format("%s%s%s/%d", prefix, prefix[0] == '\0' ? "" : "/", case_name, index).c_str(), GetPrefixUntilComma(test_names).c_str(), GetTypeName().c_str(), NULL, // No value parameter. GetTypeId(), TestClass::SetUpTestCase, TestClass::TearDownTestCase, new TestFactoryImpl); // Next, recurses (at compile time) with the tail of the type list. return TypeParameterizedTest ::Register(prefix, case_name, test_names, index + 1); } }; // The base case for the compile time recursion. template class TypeParameterizedTest { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/, int /*index*/) { return true; } }; // TypeParameterizedTestCase::Register() // registers *all combinations* of 'Tests' and 'Types' with Google // Test. The return value is insignificant - we just need to return // something such that we can call this function in a namespace scope. template class TypeParameterizedTestCase { public: static bool Register(const char* prefix, const char* case_name, const char* test_names) { typedef typename Tests::Head Head; // First, register the first test in 'Test' for each type in 'Types'. TypeParameterizedTest::Register( prefix, case_name, test_names, 0); // Next, recurses (at compile time) with the tail of the test list. return TypeParameterizedTestCase ::Register(prefix, case_name, SkipComma(test_names)); } }; // The base case for the compile time recursion. template class TypeParameterizedTestCase { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/) { return true; } }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. GTEST_API_ String GetCurrentOsStackTraceExceptTop(UnitTest* unit_test, int skip_count); // Helpers for suppressing warnings on unreachable code or constant // condition. // Always returns true. GTEST_API_ bool AlwaysTrue(); // Always returns false. inline bool AlwaysFalse() { return !AlwaysTrue(); } // Helper for suppressing false warning from Clang on a const char* // variable declared in a conditional expression always being NULL in // the else branch. struct GTEST_API_ ConstCharPtr { ConstCharPtr(const char* str) : value(str) {} operator bool() const { return true; } const char* value; }; // A simple Linear Congruential Generator for generating random // numbers with a uniform distribution. Unlike rand() and srand(), it // doesn't use global state (and therefore can't interfere with user // code). Unlike rand_r(), it's portable. An LCG isn't very random, // but it's good enough for our purposes. class GTEST_API_ Random { public: static const UInt32 kMaxRange = 1u << 31; explicit Random(UInt32 seed) : state_(seed) {} void Reseed(UInt32 seed) { state_ = seed; } // Generates a random number from [0, range). Crashes if 'range' is // 0 or greater than kMaxRange. UInt32 Generate(UInt32 range); private: UInt32 state_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Random); }; // Defining a variable of type CompileAssertTypesEqual will cause a // compiler error iff T1 and T2 are different types. template struct CompileAssertTypesEqual; template struct CompileAssertTypesEqual { }; // Removes the reference from a type if it is a reference type, // otherwise leaves it unchanged. This is the same as // tr1::remove_reference, which is not widely available yet. template struct RemoveReference { typedef T type; }; // NOLINT template struct RemoveReference { typedef T type; }; // NOLINT // A handy wrapper around RemoveReference that works when the argument // T depends on template parameters. #define GTEST_REMOVE_REFERENCE_(T) \ typename ::testing::internal::RemoveReference::type // Removes const from a type if it is a const type, otherwise leaves // it unchanged. This is the same as tr1::remove_const, which is not // widely available yet. template struct RemoveConst { typedef T type; }; // NOLINT template struct RemoveConst { typedef T type; }; // NOLINT // MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above // definition to fail to remove the const in 'const int[3]' and 'const // char[3][4]'. The following specialization works around the bug. // However, it causes trouble with GCC and thus needs to be // conditionally compiled. #if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__) template struct RemoveConst { typedef typename RemoveConst::type type[N]; }; #endif // A handy wrapper around RemoveConst that works when the argument // T depends on template parameters. #define GTEST_REMOVE_CONST_(T) \ typename ::testing::internal::RemoveConst::type // Turns const U&, U&, const U, and U all into U. #define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \ GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T)) // Adds reference to a type if it is not a reference type, // otherwise leaves it unchanged. This is the same as // tr1::add_reference, which is not widely available yet. template struct AddReference { typedef T& type; }; // NOLINT template struct AddReference { typedef T& type; }; // NOLINT // A handy wrapper around AddReference that works when the argument T // depends on template parameters. #define GTEST_ADD_REFERENCE_(T) \ typename ::testing::internal::AddReference::type // Adds a reference to const on top of T as necessary. For example, // it transforms // // char ==> const char& // const char ==> const char& // char& ==> const char& // const char& ==> const char& // // The argument T must depend on some template parameters. #define GTEST_REFERENCE_TO_CONST_(T) \ GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T)) // ImplicitlyConvertible::value is a compile-time bool // constant that's true iff type From can be implicitly converted to // type To. template class ImplicitlyConvertible { private: // We need the following helper functions only for their types. // They have no implementations. // MakeFrom() is an expression whose type is From. We cannot simply // use From(), as the type From may not have a public default // constructor. static From MakeFrom(); // These two functions are overloaded. Given an expression // Helper(x), the compiler will pick the first version if x can be // implicitly converted to type To; otherwise it will pick the // second version. // // The first version returns a value of size 1, and the second // version returns a value of size 2. Therefore, by checking the // size of Helper(x), which can be done at compile time, we can tell // which version of Helper() is used, and hence whether x can be // implicitly converted to type To. static char Helper(To); static char (&Helper(...))[2]; // NOLINT // We have to put the 'public' section after the 'private' section, // or MSVC refuses to compile the code. public: // MSVC warns about implicitly converting from double to int for // possible loss of data, so we need to temporarily disable the // warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4244) // Temporarily disables warning 4244. static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; # pragma warning(pop) // Restores the warning state. #elif defined(__BORLANDC__) // C++Builder cannot use member overload resolution during template // instantiation. The simplest workaround is to use its C++0x type traits // functions (C++Builder 2009 and above only). static const bool value = __is_convertible(From, To); #else static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; #endif // _MSV_VER }; template const bool ImplicitlyConvertible::value; // IsAProtocolMessage::value is a compile-time bool constant that's // true iff T is type ProtocolMessage, proto2::Message, or a subclass // of those. template struct IsAProtocolMessage : public bool_constant< ImplicitlyConvertible::value || ImplicitlyConvertible::value> { }; // When the compiler sees expression IsContainerTest(0), if C is an // STL-style container class, the first overload of IsContainerTest // will be viable (since both C::iterator* and C::const_iterator* are // valid types and NULL can be implicitly converted to them). It will // be picked over the second overload as 'int' is a perfect match for // the type of argument 0. If C::iterator or C::const_iterator is not // a valid type, the first overload is not viable, and the second // overload will be picked. Therefore, we can determine whether C is // a container class by checking the type of IsContainerTest(0). // The value of the expression is insignificant. // // Note that we look for both C::iterator and C::const_iterator. The // reason is that C++ injects the name of a class as a member of the // class itself (e.g. you can refer to class iterator as either // 'iterator' or 'iterator::iterator'). If we look for C::iterator // only, for example, we would mistakenly think that a class named // iterator is an STL container. // // Also note that the simpler approach of overloading // IsContainerTest(typename C::const_iterator*) and // IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++. typedef int IsContainer; template IsContainer IsContainerTest(int /* dummy */, typename C::iterator* /* it */ = NULL, typename C::const_iterator* /* const_it */ = NULL) { return 0; } typedef char IsNotContainer; template IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; } // EnableIf::type is void when 'Cond' is true, and // undefined when 'Cond' is false. To use SFINAE to make a function // overload only apply when a particular expression is true, add // "typename EnableIf::type* = 0" as the last parameter. template struct EnableIf; template<> struct EnableIf { typedef void type; }; // NOLINT // Utilities for native arrays. // ArrayEq() compares two k-dimensional native arrays using the // elements' operator==, where k can be any integer >= 0. When k is // 0, ArrayEq() degenerates into comparing a single pair of values. template bool ArrayEq(const T* lhs, size_t size, const U* rhs); // This generic version is used when k is 0. template inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } // This overload is used when k >= 1. template inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) { return internal::ArrayEq(lhs, N, rhs); } // This helper reduces code bloat. If we instead put its logic inside // the previous ArrayEq() function, arrays with different sizes would // lead to different copies of the template code. template bool ArrayEq(const T* lhs, size_t size, const U* rhs) { for (size_t i = 0; i != size; i++) { if (!internal::ArrayEq(lhs[i], rhs[i])) return false; } return true; } // Finds the first element in the iterator range [begin, end) that // equals elem. Element may be a native array type itself. template Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { for (Iter it = begin; it != end; ++it) { if (internal::ArrayEq(*it, elem)) return it; } return end; } // CopyArray() copies a k-dimensional native array using the elements' // operator=, where k can be any integer >= 0. When k is 0, // CopyArray() degenerates into copying a single value. template void CopyArray(const T* from, size_t size, U* to); // This generic version is used when k is 0. template inline void CopyArray(const T& from, U* to) { *to = from; } // This overload is used when k >= 1. template inline void CopyArray(const T(&from)[N], U(*to)[N]) { internal::CopyArray(from, N, *to); } // This helper reduces code bloat. If we instead put its logic inside // the previous CopyArray() function, arrays with different sizes // would lead to different copies of the template code. template void CopyArray(const T* from, size_t size, U* to) { for (size_t i = 0; i != size; i++) { internal::CopyArray(from[i], to + i); } } // The relation between an NativeArray object (see below) and the // native array it represents. enum RelationToSource { kReference, // The NativeArray references the native array. kCopy // The NativeArray makes a copy of the native array and // owns the copy. }; // Adapts a native array to a read-only STL-style container. Instead // of the complete STL container concept, this adaptor only implements // members useful for Google Mock's container matchers. New members // should be added as needed. To simplify the implementation, we only // support Element being a raw type (i.e. having no top-level const or // reference modifier). It's the client's responsibility to satisfy // this requirement. Element can be an array type itself (hence // multi-dimensional arrays are supported). template class NativeArray { public: // STL-style container typedefs. typedef Element value_type; typedef Element* iterator; typedef const Element* const_iterator; // Constructs from a native array. NativeArray(const Element* array, size_t count, RelationToSource relation) { Init(array, count, relation); } // Copy constructor. NativeArray(const NativeArray& rhs) { Init(rhs.array_, rhs.size_, rhs.relation_to_source_); } ~NativeArray() { // Ensures that the user doesn't instantiate NativeArray with a // const or reference type. static_cast(StaticAssertTypeEqHelper()); if (relation_to_source_ == kCopy) delete[] array_; } // STL-style container methods. size_t size() const { return size_; } const_iterator begin() const { return array_; } const_iterator end() const { return array_ + size_; } bool operator==(const NativeArray& rhs) const { return size() == rhs.size() && ArrayEq(begin(), size(), rhs.begin()); } private: // Initializes this object; makes a copy of the input array if // 'relation' is kCopy. void Init(const Element* array, size_t a_size, RelationToSource relation) { if (relation == kReference) { array_ = array; } else { Element* const copy = new Element[a_size]; CopyArray(array, a_size, copy); array_ = copy; } size_ = a_size; relation_to_source_ = relation; } const Element* array_; size_t size_; RelationToSource relation_to_source_; GTEST_DISALLOW_ASSIGN_(NativeArray); }; } // namespace internal } // namespace testing #define GTEST_MESSAGE_AT_(file, line, message, result_type) \ ::testing::internal::AssertHelper(result_type, file, line, message) \ = ::testing::Message() #define GTEST_MESSAGE_(message, result_type) \ GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type) #define GTEST_FATAL_FAILURE_(message) \ return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure) #define GTEST_NONFATAL_FAILURE_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure) #define GTEST_SUCCESS_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess) // Suppresses MSVC warnings 4072 (unreachable code) for the code following // statement if it returns or throws (or doesn't return or throw in some // situations). #define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \ if (::testing::internal::AlwaysTrue()) { statement; } #define GTEST_TEST_THROW_(statement, expected_exception, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::ConstCharPtr gtest_msg = "") { \ bool gtest_caught_expected = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (expected_exception const&) { \ gtest_caught_expected = true; \ } \ catch (...) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws a different type."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ if (!gtest_caught_expected) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws nothing."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \ fail(gtest_msg.value) #define GTEST_TEST_NO_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \ fail("Expected: " #statement " doesn't throw an exception.\n" \ " Actual: it throws.") #define GTEST_TEST_ANY_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ bool gtest_caught_any = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ gtest_caught_any = true; \ } \ if (!gtest_caught_any) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \ fail("Expected: " #statement " throws an exception.\n" \ " Actual: it doesn't.") // Implements Boolean test assertions such as EXPECT_TRUE. expression can be // either a boolean expression or an AssertionResult. text is a textual // represenation of expression as it was passed into the EXPECT_TRUE. #define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar_ = \ ::testing::AssertionResult(expression)) \ ; \ else \ fail(::testing::internal::GetBoolAssertionFailureMessage(\ gtest_ar_, text, #actual, #expected).c_str()) #define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \ fail("Expected: " #statement " doesn't generate new fatal " \ "failures in the current thread.\n" \ " Actual: it does.") // Expands to the name of the class that implements the given test. #define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ test_case_name##_##test_name##_Test // Helper macro for defining tests. #define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\ public:\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\ private:\ virtual void TestBody();\ static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\ };\ \ ::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\ ::test_info_ =\ ::testing::internal::MakeAndRegisterTestInfo(\ #test_case_name, #test_name, NULL, NULL, \ (parent_id), \ parent_class::SetUpTestCase, \ parent_class::TearDownTestCase, \ new ::testing::internal::TestFactoryImpl<\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for death tests. It is // #included by gtest.h so a user doesn't need to include this // directly. #ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file defines internal utilities needed for implementing // death tests. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #include namespace testing { namespace internal { GTEST_DECLARE_string_(internal_run_death_test); // Names of the flags (needed for parsing Google Test flags). const char kDeathTestStyleFlag[] = "death_test_style"; const char kDeathTestUseFork[] = "death_test_use_fork"; const char kInternalRunDeathTestFlag[] = "internal_run_death_test"; #if GTEST_HAS_DEATH_TEST // DeathTest is a class that hides much of the complexity of the // GTEST_DEATH_TEST_ macro. It is abstract; its static Create method // returns a concrete class that depends on the prevailing death test // style, as defined by the --gtest_death_test_style and/or // --gtest_internal_run_death_test flags. // In describing the results of death tests, these terms are used with // the corresponding definitions: // // exit status: The integer exit information in the format specified // by wait(2) // exit code: The integer code passed to exit(3), _exit(2), or // returned from main() class GTEST_API_ DeathTest { public: // Create returns false if there was an error determining the // appropriate action to take for the current death test; for example, // if the gtest_death_test_style flag is set to an invalid value. // The LastMessage method will return a more detailed message in that // case. Otherwise, the DeathTest pointer pointed to by the "test" // argument is set. If the death test should be skipped, the pointer // is set to NULL; otherwise, it is set to the address of a new concrete // DeathTest object that controls the execution of the current test. static bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); DeathTest(); virtual ~DeathTest() { } // A helper class that aborts a death test when it's deleted. class ReturnSentinel { public: explicit ReturnSentinel(DeathTest* test) : test_(test) { } ~ReturnSentinel() { test_->Abort(TEST_ENCOUNTERED_RETURN_STATEMENT); } private: DeathTest* const test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ReturnSentinel); } GTEST_ATTRIBUTE_UNUSED_; // An enumeration of possible roles that may be taken when a death // test is encountered. EXECUTE means that the death test logic should // be executed immediately. OVERSEE means that the program should prepare // the appropriate environment for a child process to execute the death // test, then wait for it to complete. enum TestRole { OVERSEE_TEST, EXECUTE_TEST }; // An enumeration of the three reasons that a test might be aborted. enum AbortReason { TEST_ENCOUNTERED_RETURN_STATEMENT, TEST_THREW_EXCEPTION, TEST_DID_NOT_DIE }; // Assumes one of the above roles. virtual TestRole AssumeRole() = 0; // Waits for the death test to finish and returns its status. virtual int Wait() = 0; // Returns true if the death test passed; that is, the test process // exited during the test, its exit status matches a user-supplied // predicate, and its stderr output matches a user-supplied regular // expression. // The user-supplied predicate may be a macro expression rather // than a function pointer or functor, or else Wait and Passed could // be combined. virtual bool Passed(bool exit_status_ok) = 0; // Signals that the death test did not die as expected. virtual void Abort(AbortReason reason) = 0; // Returns a human-readable outcome message regarding the outcome of // the last death test. static const char* LastMessage(); static void set_last_death_test_message(const String& message); private: // A string containing a description of the outcome of the last death test. static String last_death_test_message_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest); }; // Factory interface for death tests. May be mocked out for testing. class DeathTestFactory { public: virtual ~DeathTestFactory() { } virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) = 0; }; // A concrete DeathTestFactory implementation for normal use. class DefaultDeathTestFactory : public DeathTestFactory { public: virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); }; // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. GTEST_API_ bool ExitedUnsuccessfully(int exit_status); // Traps C++ exceptions escaping statement and reports them as test // failures. Note that trapping SEH exceptions is not implemented here. # if GTEST_HAS_EXCEPTIONS # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } catch (const ::std::exception& gtest_exception) { \ fprintf(\ stderr, \ "\n%s: Caught std::exception-derived exception escaping the " \ "death test statement. Exception message: %s\n", \ ::testing::internal::FormatFileLocation(__FILE__, __LINE__).c_str(), \ gtest_exception.what()); \ fflush(stderr); \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } catch (...) { \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } # else # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) # endif // This macro is for implementing ASSERT_DEATH*, EXPECT_DEATH*, // ASSERT_EXIT*, and EXPECT_EXIT*. # define GTEST_DEATH_TEST_(statement, predicate, regex, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ const ::testing::internal::RE& gtest_regex = (regex); \ ::testing::internal::DeathTest* gtest_dt; \ if (!::testing::internal::DeathTest::Create(#statement, >est_regex, \ __FILE__, __LINE__, >est_dt)) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ if (gtest_dt != NULL) { \ ::testing::internal::scoped_ptr< ::testing::internal::DeathTest> \ gtest_dt_ptr(gtest_dt); \ switch (gtest_dt->AssumeRole()) { \ case ::testing::internal::DeathTest::OVERSEE_TEST: \ if (!gtest_dt->Passed(predicate(gtest_dt->Wait()))) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ break; \ case ::testing::internal::DeathTest::EXECUTE_TEST: { \ ::testing::internal::DeathTest::ReturnSentinel \ gtest_sentinel(gtest_dt); \ GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, gtest_dt); \ gtest_dt->Abort(::testing::internal::DeathTest::TEST_DID_NOT_DIE); \ break; \ } \ default: \ break; \ } \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__): \ fail(::testing::internal::DeathTest::LastMessage()) // The symbol "fail" here expands to something into which a message // can be streamed. // A class representing the parsed contents of the // --gtest_internal_run_death_test flag, as it existed when // RUN_ALL_TESTS was called. class InternalRunDeathTestFlag { public: InternalRunDeathTestFlag(const String& a_file, int a_line, int an_index, int a_write_fd) : file_(a_file), line_(a_line), index_(an_index), write_fd_(a_write_fd) {} ~InternalRunDeathTestFlag() { if (write_fd_ >= 0) posix::Close(write_fd_); } String file() const { return file_; } int line() const { return line_; } int index() const { return index_; } int write_fd() const { return write_fd_; } private: String file_; int line_; int index_; int write_fd_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InternalRunDeathTestFlag); }; // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag(); #else // GTEST_HAS_DEATH_TEST // This macro is used for implementing macros such as // EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED on systems where // death tests are not supported. Those macros must compile on such systems // iff EXPECT_DEATH and ASSERT_DEATH compile with the same parameters on // systems that support death tests. This allows one to write such a macro // on a system that does not support death tests and be sure that it will // compile on a death-test supporting system. // // Parameters: // statement - A statement that a macro such as EXPECT_DEATH would test // for program termination. This macro has to make sure this // statement is compiled but not executed, to ensure that // EXPECT_DEATH_IF_SUPPORTED compiles with a certain // parameter iff EXPECT_DEATH compiles with it. // regex - A regex that a macro such as EXPECT_DEATH would use to test // the output of statement. This parameter has to be // compiled but not evaluated by this macro, to ensure that // this macro only accepts expressions that a macro such as // EXPECT_DEATH would accept. // terminator - Must be an empty statement for EXPECT_DEATH_IF_SUPPORTED // and a return statement for ASSERT_DEATH_IF_SUPPORTED. // This ensures that ASSERT_DEATH_IF_SUPPORTED will not // compile inside functions where ASSERT_DEATH doesn't // compile. // // The branch that has an always false condition is used to ensure that // statement and regex are compiled (and thus syntactically correct) but // never executed. The unreachable code macro protects the terminator // statement from generating an 'unreachable code' warning in case // statement unconditionally returns or throws. The Message constructor at // the end allows the syntax of streaming additional messages into the // macro, for compilational compatibility with EXPECT_DEATH/ASSERT_DEATH. # define GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, terminator) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ GTEST_LOG_(WARNING) \ << "Death tests are not supported on this platform.\n" \ << "Statement '" #statement "' cannot be verified."; \ } else if (::testing::internal::AlwaysFalse()) { \ ::testing::internal::RE::PartialMatch(".*", (regex)); \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ terminator; \ } else \ ::testing::Message() #endif // GTEST_HAS_DEATH_TEST } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ namespace testing { // This flag controls the style of death tests. Valid values are "threadsafe", // meaning that the death test child process will re-execute the test binary // from the start, running only a single death test, or "fast", // meaning that the child process will execute the test logic immediately // after forking. GTEST_DECLARE_string_(death_test_style); #if GTEST_HAS_DEATH_TEST // The following macros are useful for writing death tests. // Here's what happens when an ASSERT_DEATH* or EXPECT_DEATH* is // executed: // // 1. It generates a warning if there is more than one active // thread. This is because it's safe to fork() or clone() only // when there is a single thread. // // 2. The parent process clone()s a sub-process and runs the death // test in it; the sub-process exits with code 0 at the end of the // death test, if it hasn't exited already. // // 3. The parent process waits for the sub-process to terminate. // // 4. The parent process checks the exit code and error message of // the sub-process. // // Examples: // // ASSERT_DEATH(server.SendMessage(56, "Hello"), "Invalid port number"); // for (int i = 0; i < 5; i++) { // EXPECT_DEATH(server.ProcessRequest(i), // "Invalid request .* in ProcessRequest()") // << "Failed to die on request " << i); // } // // ASSERT_EXIT(server.ExitNow(), ::testing::ExitedWithCode(0), "Exiting"); // // bool KilledBySIGHUP(int exit_code) { // return WIFSIGNALED(exit_code) && WTERMSIG(exit_code) == SIGHUP; // } // // ASSERT_EXIT(client.HangUpServer(), KilledBySIGHUP, "Hanging up!"); // // On the regular expressions used in death tests: // // On POSIX-compliant systems (*nix), we use the library, // which uses the POSIX extended regex syntax. // // On other platforms (e.g. Windows), we only support a simple regex // syntax implemented as part of Google Test. This limited // implementation should be enough most of the time when writing // death tests; though it lacks many features you can find in PCRE // or POSIX extended regex syntax. For example, we don't support // union ("x|y"), grouping ("(xy)"), brackets ("[xy]"), and // repetition count ("x{5,7}"), among others. // // Below is the syntax that we do support. We chose it to be a // subset of both PCRE and POSIX extended regex, so it's easy to // learn wherever you come from. In the following: 'A' denotes a // literal character, period (.), or a single \\ escape sequence; // 'x' and 'y' denote regular expressions; 'm' and 'n' are for // natural numbers. // // c matches any literal character c // \\d matches any decimal digit // \\D matches any character that's not a decimal digit // \\f matches \f // \\n matches \n // \\r matches \r // \\s matches any ASCII whitespace, including \n // \\S matches any character that's not a whitespace // \\t matches \t // \\v matches \v // \\w matches any letter, _, or decimal digit // \\W matches any character that \\w doesn't match // \\c matches any literal character c, which must be a punctuation // . matches any single character except \n // A? matches 0 or 1 occurrences of A // A* matches 0 or many occurrences of A // A+ matches 1 or many occurrences of A // ^ matches the beginning of a string (not that of each line) // $ matches the end of a string (not that of each line) // xy matches x followed by y // // If you accidentally use PCRE or POSIX extended regex features // not implemented by us, you will get a run-time failure. In that // case, please try to rewrite your regular expression within the // above syntax. // // This implementation is *not* meant to be as highly tuned or robust // as a compiled regex library, but should perform well enough for a // death test, which already incurs significant overhead by launching // a child process. // // Known caveats: // // A "threadsafe" style death test obtains the path to the test // program from argv[0] and re-executes it in the sub-process. For // simplicity, the current implementation doesn't search the PATH // when launching the sub-process. This means that the user must // invoke the test program via a path that contains at least one // path separator (e.g. path/to/foo_test and // /absolute/path/to/bar_test are fine, but foo_test is not). This // is rarely a problem as people usually don't put the test binary // directory in PATH. // // TODO(wan@google.com): make thread-safe death tests search the PATH. // Asserts that a given statement causes the program to exit, with an // integer exit status that satisfies predicate, and emitting error output // that matches regex. # define ASSERT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_FATAL_FAILURE_) // Like ASSERT_EXIT, but continues on to successive tests in the // test case, if any: # define EXPECT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_NONFATAL_FAILURE_) // Asserts that a given statement causes the program to exit, either by // explicitly exiting with a nonzero exit code or being killed by a // signal, and emitting error output that matches regex. # define ASSERT_DEATH(statement, regex) \ ASSERT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Like ASSERT_DEATH, but continues on to successive tests in the // test case, if any: # define EXPECT_DEATH(statement, regex) \ EXPECT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Two predicate classes that can be used in {ASSERT,EXPECT}_EXIT*: // Tests that an exit code describes a normal exit with a given exit code. class GTEST_API_ ExitedWithCode { public: explicit ExitedWithCode(int exit_code); bool operator()(int exit_status) const; private: // No implementation - assignment is unsupported. void operator=(const ExitedWithCode& other); const int exit_code_; }; # if !GTEST_OS_WINDOWS // Tests that an exit code describes an exit due to termination by a // given signal. class GTEST_API_ KilledBySignal { public: explicit KilledBySignal(int signum); bool operator()(int exit_status) const; private: const int signum_; }; # endif // !GTEST_OS_WINDOWS // EXPECT_DEBUG_DEATH asserts that the given statements die in debug mode. // The death testing framework causes this to have interesting semantics, // since the sideeffects of the call are only visible in opt mode, and not // in debug mode. // // In practice, this can be used to test functions that utilize the // LOG(DFATAL) macro using the following style: // // int DieInDebugOr12(int* sideeffect) { // if (sideeffect) { // *sideeffect = 12; // } // LOG(DFATAL) << "death"; // return 12; // } // // TEST(TestCase, TestDieOr12WorksInDgbAndOpt) { // int sideeffect = 0; // // Only asserts in dbg. // EXPECT_DEBUG_DEATH(DieInDebugOr12(&sideeffect), "death"); // // #ifdef NDEBUG // // opt-mode has sideeffect visible. // EXPECT_EQ(12, sideeffect); // #else // // dbg-mode no visible sideeffect. // EXPECT_EQ(0, sideeffect); // #endif // } // // This will assert that DieInDebugReturn12InOpt() crashes in debug // mode, usually due to a DCHECK or LOG(DFATAL), but returns the // appropriate fallback value (12 in this case) in opt mode. If you // need to test that a function has appropriate side-effects in opt // mode, include assertions against the side-effects. A general // pattern for this is: // // EXPECT_DEBUG_DEATH({ // // Side-effects here will have an effect after this statement in // // opt mode, but none in debug mode. // EXPECT_EQ(12, DieInDebugOr12(&sideeffect)); // }, "death"); // # ifdef NDEBUG # define EXPECT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # define ASSERT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # else # define EXPECT_DEBUG_DEATH(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEBUG_DEATH(statement, regex) \ ASSERT_DEATH(statement, regex) # endif // NDEBUG for EXPECT_DEBUG_DEATH #endif // GTEST_HAS_DEATH_TEST // EXPECT_DEATH_IF_SUPPORTED(statement, regex) and // ASSERT_DEATH_IF_SUPPORTED(statement, regex) expand to real death tests if // death tests are supported; otherwise they just issue a warning. This is // useful when you are combining death test assertions with normal test // assertions in one test. #if GTEST_HAS_DEATH_TEST # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ ASSERT_DEATH(statement, regex) #else # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, ) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, return) #endif } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the Message class. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! #ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #include namespace testing { // The Message class works like an ostream repeater. // // Typical usage: // // 1. You stream a bunch of values to a Message object. // It will remember the text in a stringstream. // 2. Then you stream the Message object to an ostream. // This causes the text in the Message to be streamed // to the ostream. // // For example; // // testing::Message foo; // foo << 1 << " != " << 2; // std::cout << foo; // // will print "1 != 2". // // Message is not intended to be inherited from. In particular, its // destructor is not virtual. // // Note that stringstream behaves differently in gcc and in MSVC. You // can stream a NULL char pointer to it in the former, but not in the // latter (it causes an access violation if you do). The Message // class hides this difference by treating a NULL char pointer as // "(null)". class GTEST_API_ Message { private: // The type of basic IO manipulators (endl, ends, and flush) for // narrow streams. typedef std::ostream& (*BasicNarrowIoManip)(std::ostream&); public: // Constructs an empty Message. // We allocate the stringstream separately because otherwise each use of // ASSERT/EXPECT in a procedure adds over 200 bytes to the procedure's // stack frame leading to huge stack frames in some cases; gcc does not reuse // the stack space. Message() : ss_(new ::std::stringstream) { // By default, we want there to be enough precision when printing // a double to a Message. *ss_ << std::setprecision(std::numeric_limits::digits10 + 2); } // Copy constructor. Message(const Message& msg) : ss_(new ::std::stringstream) { // NOLINT *ss_ << msg.GetString(); } // Constructs a Message from a C-string. explicit Message(const char* str) : ss_(new ::std::stringstream) { *ss_ << str; } #if GTEST_OS_SYMBIAN // Streams a value (either a pointer or not) to this object. template inline Message& operator <<(const T& value) { StreamHelper(typename internal::is_pointer::type(), value); return *this; } #else // Streams a non-pointer value to this object. template inline Message& operator <<(const T& val) { ::GTestStreamToHelper(ss_.get(), val); return *this; } // Streams a pointer value to this object. // // This function is an overload of the previous one. When you // stream a pointer to a Message, this definition will be used as it // is more specialized. (The C++ Standard, section // [temp.func.order].) If you stream a non-pointer, then the // previous definition will be used. // // The reason for this overload is that streaming a NULL pointer to // ostream is undefined behavior. Depending on the compiler, you // may get "0", "(nil)", "(null)", or an access violation. To // ensure consistent result across compilers, we always treat NULL // as "(null)". template inline Message& operator <<(T* const& pointer) { // NOLINT if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } return *this; } #endif // GTEST_OS_SYMBIAN // Since the basic IO manipulators are overloaded for both narrow // and wide streams, we have to provide this specialized definition // of operator <<, even though its body is the same as the // templatized version above. Without this definition, streaming // endl or other basic IO manipulators to Message will confuse the // compiler. Message& operator <<(BasicNarrowIoManip val) { *ss_ << val; return *this; } // Instead of 1/0, we want to see true/false for bool values. Message& operator <<(bool b) { return *this << (b ? "true" : "false"); } // These two overloads allow streaming a wide C string to a Message // using the UTF-8 encoding. Message& operator <<(const wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } Message& operator <<(wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::std::wstring& wstr); #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::wstring& wstr); #endif // GTEST_HAS_GLOBAL_WSTRING // Gets the text streamed to this object so far as a String. // Each '\0' character in the buffer is replaced with "\\0". // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::String GetString() const { return internal::StringStreamToString(ss_.get()); } private: #if GTEST_OS_SYMBIAN // These are needed as the Nokia Symbian Compiler cannot decide between // const T& and const T* in a function template. The Nokia compiler _can_ // decide between class template specializations for T and T*, so a // tr1::type_traits-like is_pointer works, and we can overload on that. template inline void StreamHelper(internal::true_type /*dummy*/, T* pointer) { if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } } template inline void StreamHelper(internal::false_type /*dummy*/, const T& value) { ::GTestStreamToHelper(ss_.get(), value); } #endif // GTEST_OS_SYMBIAN // We'll hold the text streamed to this object here. const internal::scoped_ptr< ::std::stringstream> ss_; // We declare (but don't implement) this to prevent the compiler // from implementing the assignment operator. void operator=(const Message&); }; // Streams a Message to an ostream. inline std::ostream& operator <<(std::ostream& os, const Message& sb) { return os << sb.GetString(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ // This file was GENERATED by command: // pump.py gtest-param-test.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev) // // Macros and functions for implementing parameterized tests // in Google C++ Testing Framework (Google Test) // // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // #ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Value-parameterized tests allow you to test your code with different // parameters without writing multiple copies of the same test. // // Here is how you use value-parameterized tests: #if 0 // To write value-parameterized tests, first you should define a fixture // class. It is usually derived from testing::TestWithParam (see below for // another inheritance scheme that's sometimes useful in more complicated // class hierarchies), where the type of your parameter values. // TestWithParam is itself derived from testing::Test. T can be any // copyable type. If it's a raw pointer, you are responsible for managing the // lifespan of the pointed values. class FooTest : public ::testing::TestWithParam { // You can implement all the usual class fixture members here. }; // Then, use the TEST_P macro to define as many parameterized tests // for this fixture as you want. The _P suffix is for "parameterized" // or "pattern", whichever you prefer to think. TEST_P(FooTest, DoesBlah) { // Inside a test, access the test parameter with the GetParam() method // of the TestWithParam class: EXPECT_TRUE(foo.Blah(GetParam())); ... } TEST_P(FooTest, HasBlahBlah) { ... } // Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test // case with any set of parameters you want. Google Test defines a number // of functions for generating test parameters. They return what we call // (surprise!) parameter generators. Here is a summary of them, which // are all in the testing namespace: // // // Range(begin, end [, step]) - Yields values {begin, begin+step, // begin+step+step, ...}. The values do not // include end. step defaults to 1. // Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. // ValuesIn(container) - Yields values from a C-style array, an STL // ValuesIn(begin,end) container, or an iterator range [begin, end). // Bool() - Yields sequence {false, true}. // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product // for the math savvy) of the values generated // by the N generators. // // For more details, see comments at the definitions of these functions below // in this file. // // The following statement will instantiate tests from the FooTest test case // each with parameter values "meeny", "miny", and "moe". INSTANTIATE_TEST_CASE_P(InstantiationName, FooTest, Values("meeny", "miny", "moe")); // To distinguish different instances of the pattern, (yes, you // can instantiate it more then once) the first argument to the // INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the // actual test case name. Remember to pick unique prefixes for different // instantiations. The tests from the instantiation above will have // these names: // // * InstantiationName/FooTest.DoesBlah/0 for "meeny" // * InstantiationName/FooTest.DoesBlah/1 for "miny" // * InstantiationName/FooTest.DoesBlah/2 for "moe" // * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" // * InstantiationName/FooTest.HasBlahBlah/1 for "miny" // * InstantiationName/FooTest.HasBlahBlah/2 for "moe" // // You can use these names in --gtest_filter. // // This statement will instantiate all tests from FooTest again, each // with parameter values "cat" and "dog": const char* pets[] = {"cat", "dog"}; INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); // The tests from the instantiation above will have these names: // // * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" // * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" // * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" // * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" // // Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests // in the given test case, whether their definitions come before or // AFTER the INSTANTIATE_TEST_CASE_P statement. // // Please also note that generator expressions (including parameters to the // generators) are evaluated in InitGoogleTest(), after main() has started. // This allows the user on one hand, to adjust generator parameters in order // to dynamically determine a set of tests to run and on the other hand, // give the user a chance to inspect the generated tests with Google Test // reflection API before RUN_ALL_TESTS() is executed. // // You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc // for more examples. // // In the future, we plan to publish the API for defining new parameter // generators. But for now this interface remains part of the internal // implementation and is subject to change. // // // A parameterized test fixture must be derived from testing::Test and from // testing::WithParamInterface, where T is the type of the parameter // values. Inheriting from TestWithParam satisfies that requirement because // TestWithParam inherits from both Test and WithParamInterface. In more // complicated hierarchies, however, it is occasionally useful to inherit // separately from Test and WithParamInterface. For example: class BaseTest : public ::testing::Test { // You can inherit all the usual members for a non-parameterized test // fixture here. }; class DerivedTest : public BaseTest, public ::testing::WithParamInterface { // The usual test fixture members go here too. }; TEST_F(BaseTest, HasFoo) { // This is an ordinary non-parameterized test. } TEST_P(DerivedTest, DoesBlah) { // GetParam works just the same here as if you inherit from TestWithParam. EXPECT_TRUE(foo.Blah(GetParam())); } #endif // 0 #if !GTEST_OS_SYMBIAN # include #endif // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #include #include #include // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2003 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: Dan Egnor (egnor@google.com) // // A "smart" pointer type with reference tracking. Every pointer to a // particular object is kept on a circular linked list. When the last pointer // to an object is destroyed or reassigned, the object is deleted. // // Used properly, this deletes the object when the last reference goes away. // There are several caveats: // - Like all reference counting schemes, cycles lead to leaks. // - Each smart pointer is actually two pointers (8 bytes instead of 4). // - Every time a pointer is assigned, the entire list of pointers to that // object is traversed. This class is therefore NOT SUITABLE when there // will often be more than two or three pointers to a particular object. // - References are only tracked as long as linked_ptr<> objects are copied. // If a linked_ptr<> is converted to a raw pointer and back, BAD THINGS // will happen (double deletion). // // A good use of this class is storing object references in STL containers. // You can safely put linked_ptr<> in a vector<>. // Other uses may not be as good. // // Note: If you use an incomplete type with linked_ptr<>, the class // *containing* linked_ptr<> must have a constructor and destructor (even // if they do nothing!). // // Bill Gibbons suggested we use something like this. // // Thread Safety: // Unlike other linked_ptr implementations, in this implementation // a linked_ptr object is thread-safe in the sense that: // - it's safe to copy linked_ptr objects concurrently, // - it's safe to copy *from* a linked_ptr and read its underlying // raw pointer (e.g. via get()) concurrently, and // - it's safe to write to two linked_ptrs that point to the same // shared object concurrently. // TODO(wan@google.com): rename this to safe_linked_ptr to avoid // confusion with normal linked_ptr. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #include #include namespace testing { namespace internal { // Protects copying of all linked_ptr objects. GTEST_API_ GTEST_DECLARE_STATIC_MUTEX_(g_linked_ptr_mutex); // This is used internally by all instances of linked_ptr<>. It needs to be // a non-template class because different types of linked_ptr<> can refer to // the same object (linked_ptr(obj) vs linked_ptr(obj)). // So, it needs to be possible for different types of linked_ptr to participate // in the same circular linked list, so we need a single class type here. // // DO NOT USE THIS CLASS DIRECTLY YOURSELF. Use linked_ptr. class linked_ptr_internal { public: // Create a new circle that includes only this instance. void join_new() { next_ = this; } // Many linked_ptr operations may change p.link_ for some linked_ptr // variable p in the same circle as this object. Therefore we need // to prevent two such operations from occurring concurrently. // // Note that different types of linked_ptr objects can coexist in a // circle (e.g. linked_ptr, linked_ptr, and // linked_ptr). Therefore we must use a single mutex to // protect all linked_ptr objects. This can create serious // contention in production code, but is acceptable in a testing // framework. // Join an existing circle. // L < g_linked_ptr_mutex void join(linked_ptr_internal const* ptr) { MutexLock lock(&g_linked_ptr_mutex); linked_ptr_internal const* p = ptr; while (p->next_ != ptr) p = p->next_; p->next_ = this; next_ = ptr; } // Leave whatever circle we're part of. Returns true if we were the // last member of the circle. Once this is done, you can join() another. // L < g_linked_ptr_mutex bool depart() { MutexLock lock(&g_linked_ptr_mutex); if (next_ == this) return true; linked_ptr_internal const* p = next_; while (p->next_ != this) p = p->next_; p->next_ = next_; return false; } private: mutable linked_ptr_internal const* next_; }; template class linked_ptr { public: typedef T element_type; // Take over ownership of a raw pointer. This should happen as soon as // possible after the object is created. explicit linked_ptr(T* ptr = NULL) { capture(ptr); } ~linked_ptr() { depart(); } // Copy an existing linked_ptr<>, adding ourselves to the list of references. template linked_ptr(linked_ptr const& ptr) { copy(&ptr); } linked_ptr(linked_ptr const& ptr) { // NOLINT assert(&ptr != this); copy(&ptr); } // Assignment releases the old value and acquires the new. template linked_ptr& operator=(linked_ptr const& ptr) { depart(); copy(&ptr); return *this; } linked_ptr& operator=(linked_ptr const& ptr) { if (&ptr != this) { depart(); copy(&ptr); } return *this; } // Smart pointer members. void reset(T* ptr = NULL) { depart(); capture(ptr); } T* get() const { return value_; } T* operator->() const { return value_; } T& operator*() const { return *value_; } bool operator==(T* p) const { return value_ == p; } bool operator!=(T* p) const { return value_ != p; } template bool operator==(linked_ptr const& ptr) const { return value_ == ptr.get(); } template bool operator!=(linked_ptr const& ptr) const { return value_ != ptr.get(); } private: template friend class linked_ptr; T* value_; linked_ptr_internal link_; void depart() { if (link_.depart()) delete value_; } void capture(T* ptr) { value_ = ptr; link_.join_new(); } template void copy(linked_ptr const* ptr) { value_ = ptr->get(); if (value_) link_.join(&ptr->link_); else link_.join_new(); } }; template inline bool operator==(T* ptr, const linked_ptr& x) { return ptr == x.get(); } template inline bool operator!=(T* ptr, const linked_ptr& x) { return ptr != x.get(); } // A function to convert T* into linked_ptr // Doing e.g. make_linked_ptr(new FooBarBaz(arg)) is a shorter notation // for linked_ptr >(new FooBarBaz(arg)) template linked_ptr make_linked_ptr(T* ptr) { return linked_ptr(ptr); } } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // A user can teach this function how to print a class type T by // defining either operator<<() or PrintTo() in the namespace that // defines T. More specifically, the FIRST defined function in the // following list will be used (assuming T is defined in namespace // foo): // // 1. foo::PrintTo(const T&, ostream*) // 2. operator<<(ostream&, const T&) defined in either foo or the // global namespace. // // If none of the above is defined, it will print the debug string of // the value if it is a protocol buffer, or print the raw bytes in the // value otherwise. // // To aid debugging: when T is a reference type, the address of the // value is also printed; when T is a (const) char pointer, both the // pointer value and the NUL-terminated string it points to are // printed. // // We also provide some convenient wrappers: // // // Prints a value to a string. For a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // std::string ::testing::PrintToString(const T& value); // // // Prints a value tersely: for a reference type, the referenced // // value (but not the address) is printed; for a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // void ::testing::internal::UniversalTersePrint(const T& value, ostream*); // // // Prints value using the type inferred by the compiler. The difference // // from UniversalTersePrint() is that this function prints both the // // pointer and the NUL-terminated string for a (const or not) char pointer. // void ::testing::internal::UniversalPrint(const T& value, ostream*); // // // Prints the fields of a tuple tersely to a string vector, one // // element for each field. Tuple support must be enabled in // // gtest-port.h. // std::vector UniversalTersePrintTupleFieldsToStrings( // const Tuple& value); // // Known limitation: // // The print primitives print the elements of an STL-style container // using the compiler-inferred type of *iter where iter is a // const_iterator of the container. When const_iterator is an input // iterator but not a forward iterator, this inferred type may not // match value_type, and the print output may be incorrect. In // practice, this is rarely a problem as for most containers // const_iterator is a forward iterator. We'll fix this if there's an // actual need for it. Note that this fix cannot rely on value_type // being defined as many user-defined container types don't have // value_type. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #include // NOLINT #include #include #include #include namespace testing { // Definitions in the 'internal' and 'internal2' name spaces are // subject to change without notice. DO NOT USE THEM IN USER CODE! namespace internal2 { // Prints the given number of bytes in the given object to the given // ostream. GTEST_API_ void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ::std::ostream* os); // For selecting which printer to use when a given type has neither << // nor PrintTo(). enum TypeKind { kProtobuf, // a protobuf type kConvertibleToInteger, // a type implicitly convertible to BiggestInt // (e.g. a named or unnamed enum type) kOtherType // anything else }; // TypeWithoutFormatter::PrintValue(value, os) is called // by the universal printer to print a value of type T when neither // operator<< nor PrintTo() is defined for T, where kTypeKind is the // "kind" of T as defined by enum TypeKind. template class TypeWithoutFormatter { public: // This default version is called when kTypeKind is kOtherType. static void PrintValue(const T& value, ::std::ostream* os) { PrintBytesInObjectTo(reinterpret_cast(&value), sizeof(value), os); } }; // We print a protobuf using its ShortDebugString() when the string // doesn't exceed this many characters; otherwise we print it using // DebugString() for better readability. const size_t kProtobufOneLinerMaxLength = 50; template class TypeWithoutFormatter { public: static void PrintValue(const T& value, ::std::ostream* os) { const ::testing::internal::string short_str = value.ShortDebugString(); const ::testing::internal::string pretty_str = short_str.length() <= kProtobufOneLinerMaxLength ? short_str : ("\n" + value.DebugString()); *os << ("<" + pretty_str + ">"); } }; template class TypeWithoutFormatter { public: // Since T has no << operator or PrintTo() but can be implicitly // converted to BiggestInt, we print it as a BiggestInt. // // Most likely T is an enum type (either named or unnamed), in which // case printing it as an integer is the desired behavior. In case // T is not an enum, printing it as an integer is the best we can do // given that it has no user-defined printer. static void PrintValue(const T& value, ::std::ostream* os) { const internal::BiggestInt kBigInt = value; *os << kBigInt; } }; // Prints the given value to the given ostream. If the value is a // protocol message, its debug string is printed; if it's an enum or // of a type implicitly convertible to BiggestInt, it's printed as an // integer; otherwise the bytes in the value are printed. This is // what UniversalPrinter::Print() does when it knows nothing about // type T and T has neither << operator nor PrintTo(). // // A user can override this behavior for a class type Foo by defining // a << operator in the namespace where Foo is defined. // // We put this operator in namespace 'internal2' instead of 'internal' // to simplify the implementation, as much code in 'internal' needs to // use << in STL, which would conflict with our own << were it defined // in 'internal'. // // Note that this operator<< takes a generic std::basic_ostream type instead of the more restricted std::ostream. If // we define it to take an std::ostream instead, we'll get an // "ambiguous overloads" compiler error when trying to print a type // Foo that supports streaming to std::basic_ostream, as the compiler cannot tell whether // operator<<(std::ostream&, const T&) or // operator<<(std::basic_stream, const Foo&) is more // specific. template ::std::basic_ostream& operator<<( ::std::basic_ostream& os, const T& x) { TypeWithoutFormatter::value ? kProtobuf : internal::ImplicitlyConvertible::value ? kConvertibleToInteger : kOtherType)>::PrintValue(x, &os); return os; } } // namespace internal2 } // namespace testing // This namespace MUST NOT BE NESTED IN ::testing, or the name look-up // magic needed for implementing UniversalPrinter won't work. namespace testing_internal { // Used to print a value that is not an STL-style container when the // user doesn't define PrintTo() for it. template void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) { // With the following statement, during unqualified name lookup, // testing::internal2::operator<< appears as if it was declared in // the nearest enclosing namespace that contains both // ::testing_internal and ::testing::internal2, i.e. the global // namespace. For more details, refer to the C++ Standard section // 7.3.4-1 [namespace.udir]. This allows us to fall back onto // testing::internal2::operator<< in case T doesn't come with a << // operator. // // We cannot write 'using ::testing::internal2::operator<<;', which // gcc 3.3 fails to compile due to a compiler bug. using namespace ::testing::internal2; // NOLINT // Assuming T is defined in namespace foo, in the next statement, // the compiler will consider all of: // // 1. foo::operator<< (thanks to Koenig look-up), // 2. ::operator<< (as the current namespace is enclosed in ::), // 3. testing::internal2::operator<< (thanks to the using statement above). // // The operator<< whose type matches T best will be picked. // // We deliberately allow #2 to be a candidate, as sometimes it's // impossible to define #1 (e.g. when foo is ::std, defining // anything in it is undefined behavior unless you are a compiler // vendor.). *os << value; } } // namespace testing_internal namespace testing { namespace internal { // UniversalPrinter::Print(value, ostream_ptr) prints the given // value to the given ostream. The caller must ensure that // 'ostream_ptr' is not NULL, or the behavior is undefined. // // We define UniversalPrinter as a class template (as opposed to a // function template), as we need to partially specialize it for // reference types, which cannot be done with function templates. template class UniversalPrinter; template void UniversalPrint(const T& value, ::std::ostream* os); // Used to print an STL-style container when the user doesn't define // a PrintTo() for it. template void DefaultPrintTo(IsContainer /* dummy */, false_type /* is not a pointer */, const C& container, ::std::ostream* os) { const size_t kMaxCount = 32; // The maximum number of elements to print. *os << '{'; size_t count = 0; for (typename C::const_iterator it = container.begin(); it != container.end(); ++it, ++count) { if (count > 0) { *os << ','; if (count == kMaxCount) { // Enough has been printed. *os << " ..."; break; } } *os << ' '; // We cannot call PrintTo(*it, os) here as PrintTo() doesn't // handle *it being a native array. internal::UniversalPrint(*it, os); } if (count > 0) { *os << ' '; } *os << '}'; } // Used to print a pointer that is neither a char pointer nor a member // pointer, when the user doesn't define PrintTo() for it. (A member // variable pointer or member function pointer doesn't really point to // a location in the address space. Their representation is // implementation-defined. Therefore they will be printed as raw // bytes.) template void DefaultPrintTo(IsNotContainer /* dummy */, true_type /* is a pointer */, T* p, ::std::ostream* os) { if (p == NULL) { *os << "NULL"; } else { // C++ doesn't allow casting from a function pointer to any object // pointer. // // IsTrue() silences warnings: "Condition is always true", // "unreachable code". if (IsTrue(ImplicitlyConvertible::value)) { // T is not a function type. We just call << to print p, // relying on ADL to pick up user-defined << for their pointer // types, if any. *os << p; } else { // T is a function type, so '*os << p' doesn't do what we want // (it just prints p as bool). We want to print p as a const // void*. However, we cannot cast it to const void* directly, // even using reinterpret_cast, as earlier versions of gcc // (e.g. 3.4.5) cannot compile the cast when p is a function // pointer. Casting to UInt64 first solves the problem. *os << reinterpret_cast( reinterpret_cast(p)); } } } // Used to print a non-container, non-pointer value when the user // doesn't define PrintTo() for it. template void DefaultPrintTo(IsNotContainer /* dummy */, false_type /* is not a pointer */, const T& value, ::std::ostream* os) { ::testing_internal::DefaultPrintNonContainerTo(value, os); } // Prints the given value using the << operator if it has one; // otherwise prints the bytes in it. This is what // UniversalPrinter::Print() does when PrintTo() is not specialized // or overloaded for type T. // // A user can override this behavior for a class type Foo by defining // an overload of PrintTo() in the namespace where Foo is defined. We // give the user this option as sometimes defining a << operator for // Foo is not desirable (e.g. the coding style may prevent doing it, // or there is already a << operator but it doesn't do what the user // wants). template void PrintTo(const T& value, ::std::ostream* os) { // DefaultPrintTo() is overloaded. The type of its first two // arguments determine which version will be picked. If T is an // STL-style container, the version for container will be called; if // T is a pointer, the pointer version will be called; otherwise the // generic version will be called. // // Note that we check for container types here, prior to we check // for protocol message types in our operator<<. The rationale is: // // For protocol messages, we want to give people a chance to // override Google Mock's format by defining a PrintTo() or // operator<<. For STL containers, other formats can be // incompatible with Google Mock's format for the container // elements; therefore we check for container types here to ensure // that our format is used. // // The second argument of DefaultPrintTo() is needed to bypass a bug // in Symbian's C++ compiler that prevents it from picking the right // overload between: // // PrintTo(const T& x, ...); // PrintTo(T* x, ...); DefaultPrintTo(IsContainerTest(0), is_pointer(), value, os); } // The following list of PrintTo() overloads tells // UniversalPrinter::Print() how to print standard types (built-in // types, strings, plain arrays, and pointers). // Overloads for various char types. GTEST_API_ void PrintTo(unsigned char c, ::std::ostream* os); GTEST_API_ void PrintTo(signed char c, ::std::ostream* os); inline void PrintTo(char c, ::std::ostream* os) { // When printing a plain char, we always treat it as unsigned. This // way, the output won't be affected by whether the compiler thinks // char is signed or not. PrintTo(static_cast(c), os); } // Overloads for other simple built-in types. inline void PrintTo(bool x, ::std::ostream* os) { *os << (x ? "true" : "false"); } // Overload for wchar_t type. // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its decimal code (except for L'\0'). // The L'\0' char is printed as "L'\\0'". The decimal code is printed // as signed integer when wchar_t is implemented by the compiler // as a signed type and is printed as an unsigned integer when wchar_t // is implemented as an unsigned type. GTEST_API_ void PrintTo(wchar_t wc, ::std::ostream* os); // Overloads for C strings. GTEST_API_ void PrintTo(const char* s, ::std::ostream* os); inline void PrintTo(char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // signed/unsigned char is often used for representing binary data, so // we print pointers to it as void* to be safe. inline void PrintTo(const signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(const unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // MSVC can be configured to define wchar_t as a typedef of unsigned // short. It defines _NATIVE_WCHAR_T_DEFINED when wchar_t is a native // type. When wchar_t is a typedef, defining an overload for const // wchar_t* would cause unsigned short* be printed as a wide string, // possibly causing invalid memory accesses. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Overloads for wide C strings GTEST_API_ void PrintTo(const wchar_t* s, ::std::ostream* os); inline void PrintTo(wchar_t* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } #endif // Overload for C arrays. Multi-dimensional arrays are printed // properly. // Prints the given number of elements in an array, without printing // the curly braces. template void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { UniversalPrint(a[0], os); for (size_t i = 1; i != count; i++) { *os << ", "; UniversalPrint(a[i], os); } } // Overloads for ::string and ::std::string. #if GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::string&s, ::std::ostream* os); inline void PrintTo(const ::string& s, ::std::ostream* os) { PrintStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::std::string&s, ::std::ostream* os); inline void PrintTo(const ::std::string& s, ::std::ostream* os) { PrintStringTo(s, os); } // Overloads for ::wstring and ::std::wstring. #if GTEST_HAS_GLOBAL_WSTRING GTEST_API_ void PrintWideStringTo(const ::wstring&s, ::std::ostream* os); inline void PrintTo(const ::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING GTEST_API_ void PrintWideStringTo(const ::std::wstring&s, ::std::ostream* os); inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_TR1_TUPLE // Overload for ::std::tr1::tuple. Needed for printing function arguments, // which are packed as tuples. // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os); // Overloaded PrintTo() for tuples of various arities. We support // tuples of up-to 10 fields. The following implementation works // regardless of whether tr1::tuple is implemented using the // non-standard variadic template feature or not. inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo( const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } #endif // GTEST_HAS_TR1_TUPLE // Overload for std::pair. template void PrintTo(const ::std::pair& value, ::std::ostream* os) { *os << '('; // We cannot use UniversalPrint(value.first, os) here, as T1 may be // a reference type. The same for printing value.second. UniversalPrinter::Print(value.first, os); *os << ", "; UniversalPrinter::Print(value.second, os); *os << ')'; } // Implements printing a non-reference type T by letting the compiler // pick the right overload of PrintTo() for T. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER // Note: we deliberately don't call this PrintTo(), as that name // conflicts with ::testing::internal::PrintTo in the body of the // function. static void Print(const T& value, ::std::ostream* os) { // By default, ::testing::internal::PrintTo() is used for printing // the value. // // Thanks to Koenig look-up, if T is a class and has its own // PrintTo() function defined in its namespace, that function will // be visible here. Since it is more specific than the generic ones // in ::testing::internal, it will be picked by the compiler in the // following statement - exactly what we want. PrintTo(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // UniversalPrintArray(begin, len, os) prints an array of 'len' // elements, starting at address 'begin'. template void UniversalPrintArray(const T* begin, size_t len, ::std::ostream* os) { if (len == 0) { *os << "{}"; } else { *os << "{ "; const size_t kThreshold = 18; const size_t kChunkSize = 8; // If the array has more than kThreshold elements, we'll have to // omit some details by printing only the first and the last // kChunkSize elements. // TODO(wan@google.com): let the user control the threshold using a flag. if (len <= kThreshold) { PrintRawArrayTo(begin, len, os); } else { PrintRawArrayTo(begin, kChunkSize, os); *os << ", ..., "; PrintRawArrayTo(begin + len - kChunkSize, kChunkSize, os); } *os << " }"; } } // This overload prints a (const) char array compactly. GTEST_API_ void UniversalPrintArray(const char* begin, size_t len, ::std::ostream* os); // Implements printing an array type T[N]. template class UniversalPrinter { public: // Prints the given array, omitting some elements when there are too // many. static void Print(const T (&a)[N], ::std::ostream* os) { UniversalPrintArray(a, N, os); } }; // Implements printing a reference type T&. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER static void Print(const T& value, ::std::ostream* os) { // Prints the address of the value. We use reinterpret_cast here // as static_cast doesn't compile when T is a function type. *os << "@" << reinterpret_cast(&value) << " "; // Then prints the value itself. UniversalPrint(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // Prints a value tersely: for a reference type, the referenced value // (but not the address) is printed; for a (const) char pointer, the // NUL-terminated string (but not the pointer) is printed. template void UniversalTersePrint(const T& value, ::std::ostream* os) { UniversalPrint(value, os); } inline void UniversalTersePrint(const char* str, ::std::ostream* os) { if (str == NULL) { *os << "NULL"; } else { UniversalPrint(string(str), os); } } inline void UniversalTersePrint(char* str, ::std::ostream* os) { UniversalTersePrint(static_cast(str), os); } // Prints a value using the type inferred by the compiler. The // difference between this and UniversalTersePrint() is that for a // (const) char pointer, this prints both the pointer and the // NUL-terminated string. template void UniversalPrint(const T& value, ::std::ostream* os) { UniversalPrinter::Print(value, os); } #if GTEST_HAS_TR1_TUPLE typedef ::std::vector Strings; // This helper template allows PrintTo() for tuples and // UniversalTersePrintTupleFieldsToStrings() to be defined by // induction on the number of tuple fields. The idea is that // TuplePrefixPrinter::PrintPrefixTo(t, os) prints the first N // fields in tuple t, and can be defined in terms of // TuplePrefixPrinter. // The inductive case. template struct TuplePrefixPrinter { // Prints the first N fields of a tuple. template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { TuplePrefixPrinter::PrintPrefixTo(t, os); *os << ", "; UniversalPrinter::type> ::Print(::std::tr1::get(t), os); } // Tersely prints the first N fields of a tuple to a string vector, // one element for each field. template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { TuplePrefixPrinter::TersePrintPrefixToStrings(t, strings); ::std::stringstream ss; UniversalTersePrint(::std::tr1::get(t), &ss); strings->push_back(ss.str()); } }; // Base cases. template <> struct TuplePrefixPrinter<0> { template static void PrintPrefixTo(const Tuple&, ::std::ostream*) {} template static void TersePrintPrefixToStrings(const Tuple&, Strings*) {} }; // We have to specialize the entire TuplePrefixPrinter<> class // template here, even though the definition of // TersePrintPrefixToStrings() is the same as the generic version, as // Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't // support specializing a method template of a class template. template <> struct TuplePrefixPrinter<1> { template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { UniversalPrinter::type>:: Print(::std::tr1::get<0>(t), os); } template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { ::std::stringstream ss; UniversalTersePrint(::std::tr1::get<0>(t), &ss); strings->push_back(ss.str()); } }; // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os) { *os << "("; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: PrintPrefixTo(t, os); *os << ")"; } // Prints the fields of a tuple tersely to a string vector, one // element for each field. See the comment before // UniversalTersePrint() for how we define "tersely". template Strings UniversalTersePrintTupleFieldsToStrings(const Tuple& value) { Strings result; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: TersePrintPrefixToStrings(value, &result); return result; } #endif // GTEST_HAS_TR1_TUPLE } // namespace internal template ::std::string PrintToString(const T& value) { ::std::stringstream ss; internal::UniversalTersePrint(value, &ss); return ss.str(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #if GTEST_HAS_PARAM_TEST namespace testing { namespace internal { // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Outputs a message explaining invalid registration of different // fixture class for the same test case. This may happen when // TEST_P macro is used to define two tests with the same name // but in different namespaces. GTEST_API_ void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line); template class ParamGeneratorInterface; template class ParamGenerator; // Interface for iterating over elements provided by an implementation // of ParamGeneratorInterface. template class ParamIteratorInterface { public: virtual ~ParamIteratorInterface() {} // A pointer to the base generator instance. // Used only for the purposes of iterator comparison // to make sure that two iterators belong to the same generator. virtual const ParamGeneratorInterface* BaseGenerator() const = 0; // Advances iterator to point to the next element // provided by the generator. The caller is responsible // for not calling Advance() on an iterator equal to // BaseGenerator()->End(). virtual void Advance() = 0; // Clones the iterator object. Used for implementing copy semantics // of ParamIterator. virtual ParamIteratorInterface* Clone() const = 0; // Dereferences the current iterator and provides (read-only) access // to the pointed value. It is the caller's responsibility not to call // Current() on an iterator equal to BaseGenerator()->End(). // Used for implementing ParamGenerator::operator*(). virtual const T* Current() const = 0; // Determines whether the given iterator and other point to the same // element in the sequence generated by the generator. // Used for implementing ParamGenerator::operator==(). virtual bool Equals(const ParamIteratorInterface& other) const = 0; }; // Class iterating over elements provided by an implementation of // ParamGeneratorInterface. It wraps ParamIteratorInterface // and implements the const forward iterator concept. template class ParamIterator { public: typedef T value_type; typedef const T& reference; typedef ptrdiff_t difference_type; // ParamIterator assumes ownership of the impl_ pointer. ParamIterator(const ParamIterator& other) : impl_(other.impl_->Clone()) {} ParamIterator& operator=(const ParamIterator& other) { if (this != &other) impl_.reset(other.impl_->Clone()); return *this; } const T& operator*() const { return *impl_->Current(); } const T* operator->() const { return impl_->Current(); } // Prefix version of operator++. ParamIterator& operator++() { impl_->Advance(); return *this; } // Postfix version of operator++. ParamIterator operator++(int /*unused*/) { ParamIteratorInterface* clone = impl_->Clone(); impl_->Advance(); return ParamIterator(clone); } bool operator==(const ParamIterator& other) const { return impl_.get() == other.impl_.get() || impl_->Equals(*other.impl_); } bool operator!=(const ParamIterator& other) const { return !(*this == other); } private: friend class ParamGenerator; explicit ParamIterator(ParamIteratorInterface* impl) : impl_(impl) {} scoped_ptr > impl_; }; // ParamGeneratorInterface is the binary interface to access generators // defined in other translation units. template class ParamGeneratorInterface { public: typedef T ParamType; virtual ~ParamGeneratorInterface() {} // Generator interface definition virtual ParamIteratorInterface* Begin() const = 0; virtual ParamIteratorInterface* End() const = 0; }; // Wraps ParamGeneratorInterface and provides general generator syntax // compatible with the STL Container concept. // This class implements copy initialization semantics and the contained // ParamGeneratorInterface instance is shared among all copies // of the original object. This is possible because that instance is immutable. template class ParamGenerator { public: typedef ParamIterator iterator; explicit ParamGenerator(ParamGeneratorInterface* impl) : impl_(impl) {} ParamGenerator(const ParamGenerator& other) : impl_(other.impl_) {} ParamGenerator& operator=(const ParamGenerator& other) { impl_ = other.impl_; return *this; } iterator begin() const { return iterator(impl_->Begin()); } iterator end() const { return iterator(impl_->End()); } private: linked_ptr > impl_; }; // Generates values from a range of two comparable values. Can be used to // generate sequences of user-defined types that implement operator+() and // operator<(). // This class is used in the Range() function. template class RangeGenerator : public ParamGeneratorInterface { public: RangeGenerator(T begin, T end, IncrementT step) : begin_(begin), end_(end), step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} virtual ~RangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, begin_, 0, step_); } virtual ParamIteratorInterface* End() const { return new Iterator(this, end_, end_index_, step_); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, T value, int index, IncrementT step) : base_(base), value_(value), index_(index), step_(step) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { value_ = value_ + step_; index_++; } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const T* Current() const { return &value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const int other_index = CheckedDowncastToActualType(&other)->index_; return index_ == other_index; } private: Iterator(const Iterator& other) : ParamIteratorInterface(), base_(other.base_), value_(other.value_), index_(other.index_), step_(other.step_) {} // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; T value_; int index_; const IncrementT step_; }; // class RangeGenerator::Iterator static int CalculateEndIndex(const T& begin, const T& end, const IncrementT& step) { int end_index = 0; for (T i = begin; i < end; i = i + step) end_index++; return end_index; } // No implementation - assignment is unsupported. void operator=(const RangeGenerator& other); const T begin_; const T end_; const IncrementT step_; // The index for the end() iterator. All the elements in the generated // sequence are indexed (0-based) to aid iterator comparison. const int end_index_; }; // class RangeGenerator // Generates values from a pair of STL-style iterators. Used in the // ValuesIn() function. The elements are copied from the source range // since the source can be located on the stack, and the generator // is likely to persist beyond that stack frame. template class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface { public: template ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end) : container_(begin, end) {} virtual ~ValuesInIteratorRangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, container_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, container_.end()); } private: typedef typename ::std::vector ContainerType; class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, typename ContainerType::const_iterator iterator) : base_(base), iterator_(iterator) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { ++iterator_; value_.reset(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } // We need to use cached value referenced by iterator_ because *iterator_ // can return a temporary object (and of type other then T), so just // having "return &*iterator_;" doesn't work. // value_ is updated here and not in Advance() because Advance() // can advance iterator_ beyond the end of the range, and we cannot // detect that fact. The client code, on the other hand, is // responsible for not calling Current() on an out-of-range iterator. virtual const T* Current() const { if (value_.get() == NULL) value_.reset(new T(*iterator_)); return value_.get(); } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; return iterator_ == CheckedDowncastToActualType(&other)->iterator_; } private: Iterator(const Iterator& other) // The explicit constructor call suppresses a false warning // emitted by gcc when supplied with the -Wextra option. : ParamIteratorInterface(), base_(other.base_), iterator_(other.iterator_) {} const ParamGeneratorInterface* const base_; typename ContainerType::const_iterator iterator_; // A cached value of *iterator_. We keep it here to allow access by // pointer in the wrapping iterator's operator->(). // value_ needs to be mutable to be accessed in Current(). // Use of scoped_ptr helps manage cached value's lifetime, // which is bound by the lifespan of the iterator itself. mutable scoped_ptr value_; }; // class ValuesInIteratorRangeGenerator::Iterator // No implementation - assignment is unsupported. void operator=(const ValuesInIteratorRangeGenerator& other); const ContainerType container_; }; // class ValuesInIteratorRangeGenerator // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Stores a parameter value and later creates tests parameterized with that // value. template class ParameterizedTestFactory : public TestFactoryBase { public: typedef typename TestClass::ParamType ParamType; explicit ParameterizedTestFactory(ParamType parameter) : parameter_(parameter) {} virtual Test* CreateTest() { TestClass::SetParam(¶meter_); return new TestClass(); } private: const ParamType parameter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactoryBase is a base class for meta-factories that create // test factories for passing into MakeAndRegisterTestInfo function. template class TestMetaFactoryBase { public: virtual ~TestMetaFactoryBase() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) = 0; }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactory creates test factories for passing into // MakeAndRegisterTestInfo function. Since MakeAndRegisterTestInfo receives // ownership of test factory pointer, same factory object cannot be passed // into that method twice. But ParameterizedTestCaseInfo is going to call // it for each Test/Parameter value combination. Thus it needs meta factory // creator class. template class TestMetaFactory : public TestMetaFactoryBase { public: typedef typename TestCase::ParamType ParamType; TestMetaFactory() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) { return new ParameterizedTestFactory(parameter); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestMetaFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfoBase is a generic interface // to ParameterizedTestCaseInfo classes. ParameterizedTestCaseInfoBase // accumulates test information provided by TEST_P macro invocations // and generators provided by INSTANTIATE_TEST_CASE_P macro invocations // and uses that information to register all resulting test instances // in RegisterTests method. The ParameterizeTestCaseRegistry class holds // a collection of pointers to the ParameterizedTestCaseInfo objects // and calls RegisterTests() on each of them when asked. class ParameterizedTestCaseInfoBase { public: virtual ~ParameterizedTestCaseInfoBase() {} // Base part of test case name for display purposes. virtual const string& GetTestCaseName() const = 0; // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const = 0; // UnitTest class invokes this method to register tests in this // test case right before running them in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. virtual void RegisterTests() = 0; protected: ParameterizedTestCaseInfoBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfoBase); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfo accumulates tests obtained from TEST_P // macro invocations for a particular test case and generators // obtained from INSTANTIATE_TEST_CASE_P macro invocations for that // test case. It registers tests with all values generated by all // generators when asked. template class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase { public: // ParamType and GeneratorCreationFunc are private types but are required // for declarations of public methods AddTestPattern() and // AddTestCaseInstantiation(). typedef typename TestCase::ParamType ParamType; // A function that returns an instance of appropriate generator type. typedef ParamGenerator(GeneratorCreationFunc)(); explicit ParameterizedTestCaseInfo(const char* name) : test_case_name_(name) {} // Test case base name for display purposes. virtual const string& GetTestCaseName() const { return test_case_name_; } // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const { return GetTypeId(); } // TEST_P macro uses AddTestPattern() to record information // about a single test in a LocalTestInfo structure. // test_case_name is the base name of the test case (without invocation // prefix). test_base_name is the name of an individual test without // parameter index. For the test SequenceA/FooTest.DoBar/1 FooTest is // test case base name and DoBar is test base name. void AddTestPattern(const char* test_case_name, const char* test_base_name, TestMetaFactoryBase* meta_factory) { tests_.push_back(linked_ptr(new TestInfo(test_case_name, test_base_name, meta_factory))); } // INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information // about a generator. int AddTestCaseInstantiation(const string& instantiation_name, GeneratorCreationFunc* func, const char* /* file */, int /* line */) { instantiations_.push_back(::std::make_pair(instantiation_name, func)); return 0; // Return value used only to run this method in namespace scope. } // UnitTest class invokes this method to register tests in this test case // test cases right before running tests in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. // UnitTest has a guard to prevent from calling this method more then once. virtual void RegisterTests() { for (typename TestInfoContainer::iterator test_it = tests_.begin(); test_it != tests_.end(); ++test_it) { linked_ptr test_info = *test_it; for (typename InstantiationContainer::iterator gen_it = instantiations_.begin(); gen_it != instantiations_.end(); ++gen_it) { const string& instantiation_name = gen_it->first; ParamGenerator generator((*gen_it->second)()); Message test_case_name_stream; if ( !instantiation_name.empty() ) test_case_name_stream << instantiation_name << "/"; test_case_name_stream << test_info->test_case_base_name; int i = 0; for (typename ParamGenerator::iterator param_it = generator.begin(); param_it != generator.end(); ++param_it, ++i) { Message test_name_stream; test_name_stream << test_info->test_base_name << "/" << i; MakeAndRegisterTestInfo( test_case_name_stream.GetString().c_str(), test_name_stream.GetString().c_str(), NULL, // No type parameter. PrintToString(*param_it).c_str(), GetTestCaseTypeId(), TestCase::SetUpTestCase, TestCase::TearDownTestCase, test_info->test_meta_factory->CreateTestFactory(*param_it)); } // for param_it } // for gen_it } // for test_it } // RegisterTests private: // LocalTestInfo structure keeps information about a single test registered // with TEST_P macro. struct TestInfo { TestInfo(const char* a_test_case_base_name, const char* a_test_base_name, TestMetaFactoryBase* a_test_meta_factory) : test_case_base_name(a_test_case_base_name), test_base_name(a_test_base_name), test_meta_factory(a_test_meta_factory) {} const string test_case_base_name; const string test_base_name; const scoped_ptr > test_meta_factory; }; typedef ::std::vector > TestInfoContainer; // Keeps pairs of // received from INSTANTIATE_TEST_CASE_P macros. typedef ::std::vector > InstantiationContainer; const string test_case_name_; TestInfoContainer tests_; InstantiationContainer instantiations_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfo); }; // class ParameterizedTestCaseInfo // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseRegistry contains a map of ParameterizedTestCaseInfoBase // classes accessed by test case names. TEST_P and INSTANTIATE_TEST_CASE_P // macros use it to locate their corresponding ParameterizedTestCaseInfo // descriptors. class ParameterizedTestCaseRegistry { public: ParameterizedTestCaseRegistry() {} ~ParameterizedTestCaseRegistry() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { delete *it; } } // Looks up or creates and returns a structure containing information about // tests and instantiations of a particular test case. template ParameterizedTestCaseInfo* GetTestCasePatternHolder( const char* test_case_name, const char* file, int line) { ParameterizedTestCaseInfo* typed_test_info = NULL; for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { if ((*it)->GetTestCaseName() == test_case_name) { if ((*it)->GetTestCaseTypeId() != GetTypeId()) { // Complain about incorrect usage of Google Test facilities // and terminate the program since we cannot guaranty correct // test case setup and tear-down in this case. ReportInvalidTestCaseType(test_case_name, file, line); posix::Abort(); } else { // At this point we are sure that the object we found is of the same // type we are looking for, so we downcast it to that type // without further checks. typed_test_info = CheckedDowncastToActualType< ParameterizedTestCaseInfo >(*it); } break; } } if (typed_test_info == NULL) { typed_test_info = new ParameterizedTestCaseInfo(test_case_name); test_case_infos_.push_back(typed_test_info); } return typed_test_info; } void RegisterTests() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { (*it)->RegisterTests(); } } private: typedef ::std::vector TestCaseInfoContainer; TestCaseInfoContainer test_case_infos_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry); }; } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ // This file was GENERATED by command: // pump.py gtest-param-util-generated.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently Google Test supports at most 50 arguments in Values, // and at most 10 arguments in Combine. Please contact // googletestframework@googlegroups.com if you need more. // Please note that the number of arguments to Combine is limited // by the maximum arity of the implementation of tr1::tuple which is // currently set at 10. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #if GTEST_HAS_PARAM_TEST namespace testing { // Forward declarations of ValuesIn(), which is implemented in // include/gtest/gtest-param-test.h. template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end); template internal::ParamGenerator ValuesIn(const T (&array)[N]); template internal::ParamGenerator ValuesIn( const Container& container); namespace internal { // Used in the Values() function to provide polymorphic capabilities. template class ValueArray1 { public: explicit ValueArray1(T1 v1) : v1_(v1) {} template operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray1& other); const T1 v1_; }; template class ValueArray2 { public: ValueArray2(T1 v1, T2 v2) : v1_(v1), v2_(v2) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray2& other); const T1 v1_; const T2 v2_; }; template class ValueArray3 { public: ValueArray3(T1 v1, T2 v2, T3 v3) : v1_(v1), v2_(v2), v3_(v3) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray3& other); const T1 v1_; const T2 v2_; const T3 v3_; }; template class ValueArray4 { public: ValueArray4(T1 v1, T2 v2, T3 v3, T4 v4) : v1_(v1), v2_(v2), v3_(v3), v4_(v4) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray4& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; }; template class ValueArray5 { public: ValueArray5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray5& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; }; template class ValueArray6 { public: ValueArray6(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray6& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; }; template class ValueArray7 { public: ValueArray7(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray7& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; }; template class ValueArray8 { public: ValueArray8(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray8& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; }; template class ValueArray9 { public: ValueArray9(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray9& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; }; template class ValueArray10 { public: ValueArray10(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray10& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; }; template class ValueArray11 { public: ValueArray11(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray11& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; }; template class ValueArray12 { public: ValueArray12(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray12& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; }; template class ValueArray13 { public: ValueArray13(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray13& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; }; template class ValueArray14 { public: ValueArray14(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray14& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; }; template class ValueArray15 { public: ValueArray15(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray15& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; }; template class ValueArray16 { public: ValueArray16(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray16& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; }; template class ValueArray17 { public: ValueArray17(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray17& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; }; template class ValueArray18 { public: ValueArray18(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray18& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; }; template class ValueArray19 { public: ValueArray19(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray19& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; }; template class ValueArray20 { public: ValueArray20(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray20& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; }; template class ValueArray21 { public: ValueArray21(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray21& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; }; template class ValueArray22 { public: ValueArray22(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray22& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; }; template class ValueArray23 { public: ValueArray23(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray23& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; }; template class ValueArray24 { public: ValueArray24(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray24& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; }; template class ValueArray25 { public: ValueArray25(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray25& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; }; template class ValueArray26 { public: ValueArray26(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray26& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; }; template class ValueArray27 { public: ValueArray27(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray27& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; }; template class ValueArray28 { public: ValueArray28(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray28& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; }; template class ValueArray29 { public: ValueArray29(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray29& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; }; template class ValueArray30 { public: ValueArray30(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray30& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; }; template class ValueArray31 { public: ValueArray31(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray31& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; }; template class ValueArray32 { public: ValueArray32(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray32& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; }; template class ValueArray33 { public: ValueArray33(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray33& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; }; template class ValueArray34 { public: ValueArray34(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray34& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; }; template class ValueArray35 { public: ValueArray35(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray35& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; }; template class ValueArray36 { public: ValueArray36(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray36& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; }; template class ValueArray37 { public: ValueArray37(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray37& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; }; template class ValueArray38 { public: ValueArray38(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray38& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; }; template class ValueArray39 { public: ValueArray39(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray39& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; }; template class ValueArray40 { public: ValueArray40(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray40& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; }; template class ValueArray41 { public: ValueArray41(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray41& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; }; template class ValueArray42 { public: ValueArray42(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray42& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; }; template class ValueArray43 { public: ValueArray43(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray43& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; }; template class ValueArray44 { public: ValueArray44(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray44& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; }; template class ValueArray45 { public: ValueArray45(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray45& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; }; template class ValueArray46 { public: ValueArray46(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray46& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; }; template class ValueArray47 { public: ValueArray47(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray47& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; }; template class ValueArray48 { public: ValueArray48(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray48& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; }; template class ValueArray49 { public: ValueArray49(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray49& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; }; template class ValueArray50 { public: ValueArray50(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49), v50_(v50) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_, v50_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray50& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; const T50 v50_; }; # if GTEST_HAS_COMBINE // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Generates values from the Cartesian product of values produced // by the argument generators. // template class CartesianProductGenerator2 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator2(const ParamGenerator& g1, const ParamGenerator& g2) : g1_(g1), g2_(g2) {} virtual ~CartesianProductGenerator2() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current2_; if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; ParamType current_value_; }; // class CartesianProductGenerator2::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator2& other); const ParamGenerator g1_; const ParamGenerator g2_; }; // class CartesianProductGenerator2 template class CartesianProductGenerator3 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator3(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3) : g1_(g1), g2_(g2), g3_(g3) {} virtual ~CartesianProductGenerator3() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current3_; if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; ParamType current_value_; }; // class CartesianProductGenerator3::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator3& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; }; // class CartesianProductGenerator3 template class CartesianProductGenerator4 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator4(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} virtual ~CartesianProductGenerator4() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current4_; if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; ParamType current_value_; }; // class CartesianProductGenerator4::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator4& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; }; // class CartesianProductGenerator4 template class CartesianProductGenerator5 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator5(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} virtual ~CartesianProductGenerator5() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current5_; if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; ParamType current_value_; }; // class CartesianProductGenerator5::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator5& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; }; // class CartesianProductGenerator5 template class CartesianProductGenerator6 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator6(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} virtual ~CartesianProductGenerator6() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current6_; if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; ParamType current_value_; }; // class CartesianProductGenerator6::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator6& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; }; // class CartesianProductGenerator6 template class CartesianProductGenerator7 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator7(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} virtual ~CartesianProductGenerator7() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current7_; if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; ParamType current_value_; }; // class CartesianProductGenerator7::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator7& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; }; // class CartesianProductGenerator7 template class CartesianProductGenerator8 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator8(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} virtual ~CartesianProductGenerator8() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current8_; if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; ParamType current_value_; }; // class CartesianProductGenerator8::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator8& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; }; // class CartesianProductGenerator8 template class CartesianProductGenerator9 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator9(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} virtual ~CartesianProductGenerator9() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current9_; if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; ParamType current_value_; }; // class CartesianProductGenerator9::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator9& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; }; // class CartesianProductGenerator9 template class CartesianProductGenerator10 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator10(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9, const ParamGenerator& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} virtual ~CartesianProductGenerator10() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin(), g10_, g10_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end(), g10_, g10_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9, const ParamGenerator& g10, const typename ParamGenerator::iterator& current10) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9), begin10_(g10.begin()), end10_(g10.end()), current10_(current10) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current10_; if (current10_ == end10_) { current10_ = begin10_; ++current9_; } if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_ && current10_ == typed_other->current10_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_), begin10_(other.begin10_), end10_(other.end10_), current10_(other.current10_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_, *current10_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_ || current10_ == end10_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; const typename ParamGenerator::iterator begin10_; const typename ParamGenerator::iterator end10_; typename ParamGenerator::iterator current10_; ParamType current_value_; }; // class CartesianProductGenerator10::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator10& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; const ParamGenerator g10_; }; // class CartesianProductGenerator10 // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Helper classes providing Combine() with polymorphic features. They allow // casting CartesianProductGeneratorN to ParamGenerator if T is // convertible to U. // template class CartesianProductHolder2 { public: CartesianProductHolder2(const Generator1& g1, const Generator2& g2) : g1_(g1), g2_(g2) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator2( static_cast >(g1_), static_cast >(g2_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder2& other); const Generator1 g1_; const Generator2 g2_; }; // class CartesianProductHolder2 template class CartesianProductHolder3 { public: CartesianProductHolder3(const Generator1& g1, const Generator2& g2, const Generator3& g3) : g1_(g1), g2_(g2), g3_(g3) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator3( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder3& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; }; // class CartesianProductHolder3 template class CartesianProductHolder4 { public: CartesianProductHolder4(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator4( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder4& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; }; // class CartesianProductHolder4 template class CartesianProductHolder5 { public: CartesianProductHolder5(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator5( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder5& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; }; // class CartesianProductHolder5 template class CartesianProductHolder6 { public: CartesianProductHolder6(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator6( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder6& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; }; // class CartesianProductHolder6 template class CartesianProductHolder7 { public: CartesianProductHolder7(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator7( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder7& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; }; // class CartesianProductHolder7 template class CartesianProductHolder8 { public: CartesianProductHolder8(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator8( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder8& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; }; // class CartesianProductHolder8 template class CartesianProductHolder9 { public: CartesianProductHolder9(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator9( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder9& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; }; // class CartesianProductHolder9 template class CartesianProductHolder10 { public: CartesianProductHolder10(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator10( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_), static_cast >(g10_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder10& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; const Generator10 g10_; }; // class CartesianProductHolder10 # endif // GTEST_HAS_COMBINE } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #if GTEST_HAS_PARAM_TEST namespace testing { // Functions producing parameter generators. // // Google Test uses these generators to produce parameters for value- // parameterized tests. When a parameterized test case is instantiated // with a particular generator, Google Test creates and runs tests // for each element in the sequence produced by the generator. // // In the following sample, tests from test case FooTest are instantiated // each three times with parameter values 3, 5, and 8: // // class FooTest : public TestWithParam { ... }; // // TEST_P(FooTest, TestThis) { // } // TEST_P(FooTest, TestThat) { // } // INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); // // Range() returns generators providing sequences of values in a range. // // Synopsis: // Range(start, end) // - returns a generator producing a sequence of values {start, start+1, // start+2, ..., }. // Range(start, end, step) // - returns a generator producing a sequence of values {start, start+step, // start+step+step, ..., }. // Notes: // * The generated sequences never include end. For example, Range(1, 5) // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) // returns a generator producing {1, 3, 5, 7}. // * start and end must have the same type. That type may be any integral or // floating-point type or a user defined type satisfying these conditions: // * It must be assignable (have operator=() defined). // * It must have operator+() (operator+(int-compatible type) for // two-operand version). // * It must have operator<() defined. // Elements in the resulting sequences will also have that type. // * Condition start < end must be satisfied in order for resulting sequences // to contain any elements. // template internal::ParamGenerator Range(T start, T end, IncrementT step) { return internal::ParamGenerator( new internal::RangeGenerator(start, end, step)); } template internal::ParamGenerator Range(T start, T end) { return Range(start, end, 1); } // ValuesIn() function allows generation of tests with parameters coming from // a container. // // Synopsis: // ValuesIn(const T (&array)[N]) // - returns a generator producing sequences with elements from // a C-style array. // ValuesIn(const Container& container) // - returns a generator producing sequences with elements from // an STL-style container. // ValuesIn(Iterator begin, Iterator end) // - returns a generator producing sequences with elements from // a range [begin, end) defined by a pair of STL-style iterators. These // iterators can also be plain C pointers. // // Please note that ValuesIn copies the values from the containers // passed in and keeps them to generate tests in RUN_ALL_TESTS(). // // Examples: // // This instantiates tests from test case StringTest // each with C-string values of "foo", "bar", and "baz": // // const char* strings[] = {"foo", "bar", "baz"}; // INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); // // This instantiates tests from test case StlStringTest // each with STL strings with values "a" and "b": // // ::std::vector< ::std::string> GetParameterStrings() { // ::std::vector< ::std::string> v; // v.push_back("a"); // v.push_back("b"); // return v; // } // // INSTANTIATE_TEST_CASE_P(CharSequence, // StlStringTest, // ValuesIn(GetParameterStrings())); // // // This will also instantiate tests from CharTest // each with parameter values 'a' and 'b': // // ::std::list GetParameterChars() { // ::std::list list; // list.push_back('a'); // list.push_back('b'); // return list; // } // ::std::list l = GetParameterChars(); // INSTANTIATE_TEST_CASE_P(CharSequence2, // CharTest, // ValuesIn(l.begin(), l.end())); // template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end) { typedef typename ::testing::internal::IteratorTraits ::value_type ParamType; return internal::ParamGenerator( new internal::ValuesInIteratorRangeGenerator(begin, end)); } template internal::ParamGenerator ValuesIn(const T (&array)[N]) { return ValuesIn(array, array + N); } template internal::ParamGenerator ValuesIn( const Container& container) { return ValuesIn(container.begin(), container.end()); } // Values() allows generating tests from explicitly specified list of // parameters. // // Synopsis: // Values(T v1, T v2, ..., T vN) // - returns a generator producing sequences with elements v1, v2, ..., vN. // // For example, this instantiates tests from test case BarTest each // with values "one", "two", and "three": // // INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); // // This instantiates tests from test case BazTest each with values 1, 2, 3.5. // The exact type of values will depend on the type of parameter in BazTest. // // INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); // // Currently, Values() supports from 1 to 50 parameters. // template internal::ValueArray1 Values(T1 v1) { return internal::ValueArray1(v1); } template internal::ValueArray2 Values(T1 v1, T2 v2) { return internal::ValueArray2(v1, v2); } template internal::ValueArray3 Values(T1 v1, T2 v2, T3 v3) { return internal::ValueArray3(v1, v2, v3); } template internal::ValueArray4 Values(T1 v1, T2 v2, T3 v3, T4 v4) { return internal::ValueArray4(v1, v2, v3, v4); } template internal::ValueArray5 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) { return internal::ValueArray5(v1, v2, v3, v4, v5); } template internal::ValueArray6 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) { return internal::ValueArray6(v1, v2, v3, v4, v5, v6); } template internal::ValueArray7 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) { return internal::ValueArray7(v1, v2, v3, v4, v5, v6, v7); } template internal::ValueArray8 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) { return internal::ValueArray8(v1, v2, v3, v4, v5, v6, v7, v8); } template internal::ValueArray9 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) { return internal::ValueArray9(v1, v2, v3, v4, v5, v6, v7, v8, v9); } template internal::ValueArray10 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) { return internal::ValueArray10(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10); } template internal::ValueArray11 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) { return internal::ValueArray11(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11); } template internal::ValueArray12 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) { return internal::ValueArray12(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12); } template internal::ValueArray13 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) { return internal::ValueArray13(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13); } template internal::ValueArray14 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) { return internal::ValueArray14(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14); } template internal::ValueArray15 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) { return internal::ValueArray15(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15); } template internal::ValueArray16 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) { return internal::ValueArray16(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16); } template internal::ValueArray17 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) { return internal::ValueArray17(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17); } template internal::ValueArray18 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) { return internal::ValueArray18(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18); } template internal::ValueArray19 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) { return internal::ValueArray19(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19); } template internal::ValueArray20 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) { return internal::ValueArray20(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20); } template internal::ValueArray21 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) { return internal::ValueArray21(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21); } template internal::ValueArray22 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) { return internal::ValueArray22(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22); } template internal::ValueArray23 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) { return internal::ValueArray23(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23); } template internal::ValueArray24 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) { return internal::ValueArray24(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24); } template internal::ValueArray25 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) { return internal::ValueArray25(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25); } template internal::ValueArray26 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) { return internal::ValueArray26(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26); } template internal::ValueArray27 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) { return internal::ValueArray27(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27); } template internal::ValueArray28 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) { return internal::ValueArray28(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28); } template internal::ValueArray29 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) { return internal::ValueArray29(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29); } template internal::ValueArray30 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) { return internal::ValueArray30(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30); } template internal::ValueArray31 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) { return internal::ValueArray31(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31); } template internal::ValueArray32 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) { return internal::ValueArray32(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32); } template internal::ValueArray33 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) { return internal::ValueArray33(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33); } template internal::ValueArray34 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) { return internal::ValueArray34(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34); } template internal::ValueArray35 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) { return internal::ValueArray35(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35); } template internal::ValueArray36 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) { return internal::ValueArray36(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36); } template internal::ValueArray37 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) { return internal::ValueArray37(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37); } template internal::ValueArray38 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) { return internal::ValueArray38(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38); } template internal::ValueArray39 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) { return internal::ValueArray39(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39); } template internal::ValueArray40 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) { return internal::ValueArray40(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40); } template internal::ValueArray41 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) { return internal::ValueArray41(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41); } template internal::ValueArray42 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) { return internal::ValueArray42(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42); } template internal::ValueArray43 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) { return internal::ValueArray43(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43); } template internal::ValueArray44 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) { return internal::ValueArray44(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44); } template internal::ValueArray45 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) { return internal::ValueArray45(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45); } template internal::ValueArray46 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) { return internal::ValueArray46(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46); } template internal::ValueArray47 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) { return internal::ValueArray47(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47); } template internal::ValueArray48 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) { return internal::ValueArray48(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48); } template internal::ValueArray49 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) { return internal::ValueArray49(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49); } template internal::ValueArray50 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) { return internal::ValueArray50(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50); } // Bool() allows generating tests with parameters in a set of (false, true). // // Synopsis: // Bool() // - returns a generator producing sequences with elements {false, true}. // // It is useful when testing code that depends on Boolean flags. Combinations // of multiple flags can be tested when several Bool()'s are combined using // Combine() function. // // In the following example all tests in the test case FlagDependentTest // will be instantiated twice with parameters false and true. // // class FlagDependentTest : public testing::TestWithParam { // virtual void SetUp() { // external_flag = GetParam(); // } // } // INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); // inline internal::ParamGenerator Bool() { return Values(false, true); } # if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of // tuple where T1, T2, ..., TN are the types // of elements from sequences produces by gen1, gen2, ..., genN. // // Combine can have up to 10 arguments. This number is currently limited // by the maximum number of elements in the tuple implementation used by Google // Test. // // Example: // // This will instantiate tests in test case AnimalTest each one with // the parameter values tuple("cat", BLACK), tuple("cat", WHITE), // tuple("dog", BLACK), and tuple("dog", WHITE): // // enum Color { BLACK, GRAY, WHITE }; // class AnimalTest // : public testing::TestWithParam > {...}; // // TEST_P(AnimalTest, AnimalLooksNice) {...} // // INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, // Combine(Values("cat", "dog"), // Values(BLACK, WHITE))); // // This will instantiate tests in FlagDependentTest with all variations of two // Boolean flags: // // class FlagDependentTest // : public testing::TestWithParam > { // virtual void SetUp() { // // Assigns external_flag_1 and external_flag_2 values from the tuple. // tie(external_flag_1, external_flag_2) = GetParam(); // } // }; // // TEST_P(FlagDependentTest, TestFeature1) { // // Test your code using external_flag_1 and external_flag_2 here. // } // INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, // Combine(Bool(), Bool())); // template internal::CartesianProductHolder2 Combine( const Generator1& g1, const Generator2& g2) { return internal::CartesianProductHolder2( g1, g2); } template internal::CartesianProductHolder3 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3) { return internal::CartesianProductHolder3( g1, g2, g3); } template internal::CartesianProductHolder4 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) { return internal::CartesianProductHolder4( g1, g2, g3, g4); } template internal::CartesianProductHolder5 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) { return internal::CartesianProductHolder5( g1, g2, g3, g4, g5); } template internal::CartesianProductHolder6 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) { return internal::CartesianProductHolder6( g1, g2, g3, g4, g5, g6); } template internal::CartesianProductHolder7 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) { return internal::CartesianProductHolder7( g1, g2, g3, g4, g5, g6, g7); } template internal::CartesianProductHolder8 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) { return internal::CartesianProductHolder8( g1, g2, g3, g4, g5, g6, g7, g8); } template internal::CartesianProductHolder9 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) { return internal::CartesianProductHolder9( g1, g2, g3, g4, g5, g6, g7, g8, g9); } template internal::CartesianProductHolder10 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) { return internal::CartesianProductHolder10( g1, g2, g3, g4, g5, g6, g7, g8, g9, g10); } # endif // GTEST_HAS_COMBINE # define TEST_P(test_case_name, test_name) \ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ : public test_case_name { \ public: \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ virtual void TestBody(); \ private: \ static int AddToRegistry() { \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ #test_case_name, \ #test_name, \ new ::testing::internal::TestMetaFactory< \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ return 0; \ } \ static int gtest_registering_dummy_; \ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ }; \ int GTEST_TEST_CLASS_NAME_(test_case_name, \ test_name)::gtest_registering_dummy_ = \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() # define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ ::testing::internal::ParamGenerator \ gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ int gtest_##prefix##test_case_name##_dummy_ = \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ #prefix, \ >est_##prefix##test_case_name##_EvalGenerator_, \ __FILE__, __LINE__) } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Testing Framework definitions useful in production code. #ifndef GTEST_INCLUDE_GTEST_GTEST_PROD_H_ #define GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // When you need to test the private or protected members of a class, // use the FRIEND_TEST macro to declare your tests as friends of the // class. For example: // // class MyClass { // private: // void MyMethod(); // FRIEND_TEST(MyClassTest, MyMethod); // }; // // class MyClassTest : public testing::Test { // // ... // }; // // TEST_F(MyClassTest, MyMethod) { // // Can call MyClass::MyMethod() here. // } #define FRIEND_TEST(test_case_name, test_name)\ friend class test_case_name##_##test_name##_Test #endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // #ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #include #include namespace testing { // A copyable object representing the result of a test part (i.e. an // assertion or an explicit FAIL(), ADD_FAILURE(), or SUCCESS()). // // Don't inherit from TestPartResult as its destructor is not virtual. class GTEST_API_ TestPartResult { public: // The possible outcomes of a test part (i.e. an assertion or an // explicit SUCCEED(), FAIL(), or ADD_FAILURE()). enum Type { kSuccess, // Succeeded. kNonFatalFailure, // Failed but the test can continue. kFatalFailure // Failed and the test should be terminated. }; // C'tor. TestPartResult does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestPartResult object. TestPartResult(Type a_type, const char* a_file_name, int a_line_number, const char* a_message) : type_(a_type), file_name_(a_file_name), line_number_(a_line_number), summary_(ExtractSummary(a_message)), message_(a_message) { } // Gets the outcome of the test part. Type type() const { return type_; } // Gets the name of the source file where the test part took place, or // NULL if it's unknown. const char* file_name() const { return file_name_.c_str(); } // Gets the line in the source file where the test part took place, // or -1 if it's unknown. int line_number() const { return line_number_; } // Gets the summary of the failure message. const char* summary() const { return summary_.c_str(); } // Gets the message associated with the test part. const char* message() const { return message_.c_str(); } // Returns true iff the test part passed. bool passed() const { return type_ == kSuccess; } // Returns true iff the test part failed. bool failed() const { return type_ != kSuccess; } // Returns true iff the test part non-fatally failed. bool nonfatally_failed() const { return type_ == kNonFatalFailure; } // Returns true iff the test part fatally failed. bool fatally_failed() const { return type_ == kFatalFailure; } private: Type type_; // Gets the summary of the failure message by omitting the stack // trace in it. static internal::String ExtractSummary(const char* message); // The name of the source file where the test part took place, or // NULL if the source file is unknown. internal::String file_name_; // The line in the source file where the test part took place, or -1 // if the line number is unknown. int line_number_; internal::String summary_; // The test failure summary. internal::String message_; // The test failure message. }; // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result); // An array of TestPartResult objects. // // Don't inherit from TestPartResultArray as its destructor is not // virtual. class GTEST_API_ TestPartResultArray { public: TestPartResultArray() {} // Appends the given TestPartResult to the array. void Append(const TestPartResult& result); // Returns the TestPartResult at the given index (0-based). const TestPartResult& GetTestPartResult(int index) const; // Returns the number of TestPartResult objects in the array. int size() const; private: std::vector array_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray); }; // This interface knows how to report a test part result. class TestPartResultReporterInterface { public: virtual ~TestPartResultReporterInterface() {} virtual void ReportTestPartResult(const TestPartResult& result) = 0; }; namespace internal { // This helper class is used by {ASSERT|EXPECT}_NO_FATAL_FAILURE to check if a // statement generates new fatal failures. To do so it registers itself as the // current test part result reporter. Besides checking if fatal failures were // reported, it only delegates the reporting to the former result reporter. // The original result reporter is restored in the destructor. // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. class GTEST_API_ HasNewFatalFailureHelper : public TestPartResultReporterInterface { public: HasNewFatalFailureHelper(); virtual ~HasNewFatalFailureHelper(); virtual void ReportTestPartResult(const TestPartResult& result); bool has_new_fatal_failure() const { return has_new_fatal_failure_; } private: bool has_new_fatal_failure_; TestPartResultReporterInterface* original_reporter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(HasNewFatalFailureHelper); }; } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // This header implements typed tests and type-parameterized tests. // Typed (aka type-driven) tests repeat the same test for types in a // list. You must know which types you want to test with when writing // typed tests. Here's how you do it: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { public: ... typedef std::list List; static T shared_; T value_; }; // Next, associate a list of types with the test case, which will be // repeated for each type in the list. The typedef is necessary for // the macro to parse correctly. typedef testing::Types MyTypes; TYPED_TEST_CASE(FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // TYPED_TEST_CASE(FooTest, int); // Then, use TYPED_TEST() instead of TEST_F() to define as many typed // tests for this test case as you want. TYPED_TEST(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. // Since we are inside a derived class template, C++ requires use to // visit the members of FooTest via 'this'. TypeParam n = this->value_; // To visit static members of the fixture, add the TestFixture:: // prefix. n += TestFixture::shared_; // To refer to typedefs in the fixture, add the "typename // TestFixture::" prefix. typename TestFixture::List values; values.push_back(n); ... } TYPED_TEST(FooTest, HasPropertyA) { ... } #endif // 0 // Type-parameterized tests are abstract test patterns parameterized // by a type. Compared with typed tests, type-parameterized tests // allow you to define the test pattern without knowing what the type // parameters are. The defined pattern can be instantiated with // different types any number of times, in any number of translation // units. // // If you are designing an interface or concept, you can define a // suite of type-parameterized tests to verify properties that any // valid implementation of the interface/concept should have. Then, // each implementation can easily instantiate the test suite to verify // that it conforms to the requirements, without having to write // similar tests repeatedly. Here's an example: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { ... }; // Next, declare that you will define a type-parameterized test case // (the _P suffix is for "parameterized" or "pattern", whichever you // prefer): TYPED_TEST_CASE_P(FooTest); // Then, use TYPED_TEST_P() to define as many type-parameterized tests // for this type-parameterized test case as you want. TYPED_TEST_P(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. TypeParam n = 0; ... } TYPED_TEST_P(FooTest, HasPropertyA) { ... } // Now the tricky part: you need to register all test patterns before // you can instantiate them. The first argument of the macro is the // test case name; the rest are the names of the tests in this test // case. REGISTER_TYPED_TEST_CASE_P(FooTest, DoesBlah, HasPropertyA); // Finally, you are free to instantiate the pattern with the types you // want. If you put the above code in a header file, you can #include // it in multiple C++ source files and instantiate it multiple times. // // To distinguish different instances of the pattern, the first // argument to the INSTANTIATE_* macro is a prefix that will be added // to the actual test case name. Remember to pick unique prefixes for // different instances. typedef testing::Types MyTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, int); #endif // 0 // Implements typed tests. #if GTEST_HAS_TYPED_TEST // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the typedef for the type parameters of the // given test case. # define GTEST_TYPE_PARAMS_(TestCaseName) gtest_type_params_##TestCaseName##_ // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define TYPED_TEST_CASE(CaseName, Types) \ typedef ::testing::internal::TypeList< Types >::type \ GTEST_TYPE_PARAMS_(CaseName) # define TYPED_TEST(CaseName, TestName) \ template \ class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \ : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTest< \ CaseName, \ ::testing::internal::TemplateSel< \ GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \ GTEST_TYPE_PARAMS_(CaseName)>::Register(\ "", #CaseName, #TestName, 0); \ template \ void GTEST_TEST_CLASS_NAME_(CaseName, TestName)::TestBody() #endif // GTEST_HAS_TYPED_TEST // Implements type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the namespace name that the type-parameterized tests for // the given type-parameterized test case are defined in. The exact // name of the namespace is subject to change without notice. # define GTEST_CASE_NAMESPACE_(TestCaseName) \ gtest_case_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the variable used to remember the names of // the defined tests in the given test case. # define GTEST_TYPED_TEST_CASE_P_STATE_(TestCaseName) \ gtest_typed_test_case_p_state_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE DIRECTLY. // // Expands to the name of the variable used to remember the names of // the registered tests in the given test case. # define GTEST_REGISTERED_TEST_NAMES_(TestCaseName) \ gtest_registered_test_names_##TestCaseName##_ // The variables defined in the type-parameterized test macros are // static as typically these macros are used in a .h file that can be // #included in multiple translation units linked together. # define TYPED_TEST_CASE_P(CaseName) \ static ::testing::internal::TypedTestCasePState \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName) # define TYPED_TEST_P(CaseName, TestName) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ template \ class TestName : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\ __FILE__, __LINE__, #CaseName, #TestName); \ } \ template \ void GTEST_CASE_NAMESPACE_(CaseName)::TestName::TestBody() # define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \ } \ static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\ __FILE__, __LINE__, #__VA_ARGS__) // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types) \ bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTestCase::type>::Register(\ #Prefix, #CaseName, GTEST_REGISTERED_TEST_NAMES_(CaseName)) #endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // Depending on the platform, different string classes are available. // On Linux, in addition to ::std::string, Google also makes use of // class ::string, which has the same interface as ::std::string, but // has a different implementation. // // The user can define GTEST_HAS_GLOBAL_STRING to 1 to indicate that // ::string is available AND is a distinct type to ::std::string, or // define it to 0 to indicate otherwise. // // If the user's ::std::string and ::string are the same class due to // aliasing, he should define GTEST_HAS_GLOBAL_STRING to 0. // // If the user doesn't define GTEST_HAS_GLOBAL_STRING, it is defined // heuristically. namespace testing { // Declares the flags. // This flag temporary enables the disabled tests. GTEST_DECLARE_bool_(also_run_disabled_tests); // This flag brings the debugger on an assertion failure. GTEST_DECLARE_bool_(break_on_failure); // This flag controls whether Google Test catches all test-thrown exceptions // and logs them as failures. GTEST_DECLARE_bool_(catch_exceptions); // This flag enables using colors in terminal output. Available values are // "yes" to enable colors, "no" (disable colors), or "auto" (the default) // to let Google Test decide. GTEST_DECLARE_string_(color); // This flag sets up the filter to select by name using a glob pattern // the tests to run. If the filter is not given all tests are executed. GTEST_DECLARE_string_(filter); // This flag causes the Google Test to list tests. None of the tests listed // are actually run if the flag is provided. GTEST_DECLARE_bool_(list_tests); // This flag controls whether Google Test emits a detailed XML report to a file // in addition to its normal textual output. GTEST_DECLARE_string_(output); // This flags control whether Google Test prints the elapsed time for each // test. GTEST_DECLARE_bool_(print_time); // This flag specifies the random number seed. GTEST_DECLARE_int32_(random_seed); // This flag sets how many times the tests are repeated. The default value // is 1. If the value is -1 the tests are repeating forever. GTEST_DECLARE_int32_(repeat); // This flag controls whether Google Test includes Google Test internal // stack frames in failure stack traces. GTEST_DECLARE_bool_(show_internal_stack_frames); // When this flag is specified, tests' order is randomized on every iteration. GTEST_DECLARE_bool_(shuffle); // This flag specifies the maximum number of stack frames to be // printed in a failure message. GTEST_DECLARE_int32_(stack_trace_depth); // When this flag is specified, a failed assertion will throw an // exception if exceptions are enabled, or exit the program with a // non-zero code otherwise. GTEST_DECLARE_bool_(throw_on_failure); // When this flag is set with a "host:port" string, on supported // platforms test results are streamed to the specified port on // the specified host machine. GTEST_DECLARE_string_(stream_result_to); // The upper limit for valid stack trace depths. const int kMaxStackTraceDepth = 100; namespace internal { class AssertHelper; class DefaultGlobalTestPartResultReporter; class ExecDeathTest; class NoExecDeathTest; class FinalSuccessChecker; class GTestFlagSaver; class TestResultAccessor; class TestEventListenersAccessor; class TestEventRepeater; class WindowsDeathTest; class UnitTestImpl* GetUnitTestImpl(); void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared in gtest-internal.h but defined here, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable) { return (Message() << streamable).GetString(); } } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest; // A class for indicating whether an assertion was successful. When // the assertion wasn't successful, the AssertionResult object // remembers a non-empty message that describes how it failed. // // To create an instance of this class, use one of the factory functions // (AssertionSuccess() and AssertionFailure()). // // This class is useful for two purposes: // 1. Defining predicate functions to be used with Boolean test assertions // EXPECT_TRUE/EXPECT_FALSE and their ASSERT_ counterparts // 2. Defining predicate-format functions to be // used with predicate assertions (ASSERT_PRED_FORMAT*, etc). // // For example, if you define IsEven predicate: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then the failed expectation EXPECT_TRUE(IsEven(Fib(5))) // will print the message // // Value of: IsEven(Fib(5)) // Actual: false (5 is odd) // Expected: true // // instead of a more opaque // // Value of: IsEven(Fib(5)) // Actual: false // Expected: true // // in case IsEven is a simple Boolean predicate. // // If you expect your predicate to be reused and want to support informative // messages in EXPECT_FALSE and ASSERT_FALSE (negative assertions show up // about half as often as positive ones in our tests), supply messages for // both success and failure cases: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess() << n << " is even"; // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then a statement EXPECT_FALSE(IsEven(Fib(6))) will print // // Value of: IsEven(Fib(6)) // Actual: true (8 is even) // Expected: false // // NB: Predicates that support negative Boolean assertions have reduced // performance in positive ones so be careful not to use them in tests // that have lots (tens of thousands) of positive Boolean assertions. // // To use this class with EXPECT_PRED_FORMAT assertions such as: // // // Verifies that Foo() returns an even number. // EXPECT_PRED_FORMAT1(IsEven, Foo()); // // you need to define: // // testing::AssertionResult IsEven(const char* expr, int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() // << "Expected: " << expr << " is even\n Actual: it's " << n; // } // // If Foo() returns 5, you will see the following message: // // Expected: Foo() is even // Actual: it's 5 // class GTEST_API_ AssertionResult { public: // Copy constructor. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult(const AssertionResult& other); // Used in the EXPECT_TRUE/FALSE(bool_expression). explicit AssertionResult(bool success) : success_(success) {} // Returns true iff the assertion succeeded. operator bool() const { return success_; } // NOLINT // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult operator!() const; // Returns the text streamed into this AssertionResult. Test assertions // use it when they fail (i.e., the predicate's outcome doesn't match the // assertion's expectation). When nothing has been streamed into the // object, returns an empty string. const char* message() const { return message_.get() != NULL ? message_->c_str() : ""; } // TODO(vladl@google.com): Remove this after making sure no clients use it. // Deprecated; please use message() instead. const char* failure_message() const { return message(); } // Streams a custom failure message into this object. template AssertionResult& operator<<(const T& value) { AppendMessage(Message() << value); return *this; } // Allows streaming basic output manipulators such as endl or flush into // this object. AssertionResult& operator<<( ::std::ostream& (*basic_manipulator)(::std::ostream& stream)) { AppendMessage(Message() << basic_manipulator); return *this; } private: // Appends the contents of message to message_. void AppendMessage(const Message& a_message) { if (message_.get() == NULL) message_.reset(new ::std::string); message_->append(a_message.GetString().c_str()); } // Stores result of the assertion predicate. bool success_; // Stores the message describing the condition in case the expectation // construct is not satisfied with the predicate's outcome. // Referenced via a pointer to avoid taking too much stack frame space // with test assertions. internal::scoped_ptr< ::std::string> message_; GTEST_DISALLOW_ASSIGN_(AssertionResult); }; // Makes a successful assertion result. GTEST_API_ AssertionResult AssertionSuccess(); // Makes a failed assertion result. GTEST_API_ AssertionResult AssertionFailure(); // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << msg. GTEST_API_ AssertionResult AssertionFailure(const Message& msg); // The abstract class that all tests inherit from. // // In Google Test, a unit test program contains one or many TestCases, and // each TestCase contains one or many Tests. // // When you define a test using the TEST macro, you don't need to // explicitly derive from Test - the TEST macro automatically does // this for you. // // The only time you derive from Test is when defining a test fixture // to be used a TEST_F. For example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { ... } // virtual void TearDown() { ... } // ... // }; // // TEST_F(FooTest, Bar) { ... } // TEST_F(FooTest, Baz) { ... } // // Test is not copyable. class GTEST_API_ Test { public: friend class TestInfo; // Defines types for pointers to functions that set up and tear down // a test case. typedef internal::SetUpTestCaseFunc SetUpTestCaseFunc; typedef internal::TearDownTestCaseFunc TearDownTestCaseFunc; // The d'tor is virtual as we intend to inherit from Test. virtual ~Test(); // Sets up the stuff shared by all tests in this test case. // // Google Test will call Foo::SetUpTestCase() before running the first // test in test case Foo. Hence a sub-class can define its own // SetUpTestCase() method to shadow the one defined in the super // class. static void SetUpTestCase() {} // Tears down the stuff shared by all tests in this test case. // // Google Test will call Foo::TearDownTestCase() after running the last // test in test case Foo. Hence a sub-class can define its own // TearDownTestCase() method to shadow the one defined in the super // class. static void TearDownTestCase() {} // Returns true iff the current test has a fatal failure. static bool HasFatalFailure(); // Returns true iff the current test has a non-fatal failure. static bool HasNonfatalFailure(); // Returns true iff the current test has a (either fatal or // non-fatal) failure. static bool HasFailure() { return HasFatalFailure() || HasNonfatalFailure(); } // Logs a property for the current test. Only the last value for a given // key is remembered. // These are public static so they can be called from utility functions // that are not members of the test fixture. // The arguments are const char* instead strings, as Google Test is used // on platforms where string doesn't compile. // // Note that a driving consideration for these RecordProperty methods // was to produce xml output suited to the Greenspan charting utility, // which at present will only chart values that fit in a 32-bit int. It // is the user's responsibility to restrict their values to 32-bit ints // if they intend them to be used with Greenspan. static void RecordProperty(const char* key, const char* value); static void RecordProperty(const char* key, int value); protected: // Creates a Test object. Test(); // Sets up the test fixture. virtual void SetUp(); // Tears down the test fixture. virtual void TearDown(); private: // Returns true iff the current test has the same fixture class as // the first test in the current test case. static bool HasSameFixtureClass(); // Runs the test after the test fixture has been set up. // // A sub-class must implement this to define the test logic. // // DO NOT OVERRIDE THIS FUNCTION DIRECTLY IN A USER PROGRAM. // Instead, use the TEST or TEST_F macro. virtual void TestBody() = 0; // Sets up, executes, and tears down the test. void Run(); // Deletes self. We deliberately pick an unusual name for this // internal method to avoid clashing with names used in user TESTs. void DeleteSelf_() { delete this; } // Uses a GTestFlagSaver to save and restore all Google Test flags. const internal::GTestFlagSaver* const gtest_flag_saver_; // Often a user mis-spells SetUp() as Setup() and spends a long time // wondering why it is never called by Google Test. The declaration of // the following method is solely for catching such an error at // compile time: // // - The return type is deliberately chosen to be not void, so it // will be a conflict if a user declares void Setup() in his test // fixture. // // - This method is private, so it will be another compiler error // if a user calls it from his test fixture. // // DO NOT OVERRIDE THIS FUNCTION. // // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } // We disallow copying Tests. GTEST_DISALLOW_COPY_AND_ASSIGN_(Test); }; typedef internal::TimeInMillis TimeInMillis; // A copyable object representing a user specified test property which can be // output as a key/value string pair. // // Don't inherit from TestProperty as its destructor is not virtual. class TestProperty { public: // C'tor. TestProperty does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestProperty object. TestProperty(const char* a_key, const char* a_value) : key_(a_key), value_(a_value) { } // Gets the user supplied key. const char* key() const { return key_.c_str(); } // Gets the user supplied value. const char* value() const { return value_.c_str(); } // Sets a new value, overriding the one supplied in the constructor. void SetValue(const char* new_value) { value_ = new_value; } private: // The key supplied by the user. internal::String key_; // The value supplied by the user. internal::String value_; }; // The result of a single Test. This includes a list of // TestPartResults, a list of TestProperties, a count of how many // death tests there are in the Test, and how much time it took to run // the Test. // // TestResult is not copyable. class GTEST_API_ TestResult { public: // Creates an empty TestResult. TestResult(); // D'tor. Do not inherit from TestResult. ~TestResult(); // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int total_part_count() const; // Returns the number of the test properties. int test_property_count() const; // Returns true iff the test passed (i.e. no test part failed). bool Passed() const { return !Failed(); } // Returns true iff the test failed. bool Failed() const; // Returns true iff the test fatally failed. bool HasFatalFailure() const; // Returns true iff the test has a non-fatal failure. bool HasNonfatalFailure() const; // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test part result among all the results. i can range // from 0 to test_property_count() - 1. If i is not in that range, aborts // the program. const TestPartResult& GetTestPartResult(int i) const; // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& GetTestProperty(int i) const; private: friend class TestInfo; friend class UnitTest; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::ExecDeathTest; friend class internal::TestResultAccessor; friend class internal::UnitTestImpl; friend class internal::WindowsDeathTest; // Gets the vector of TestPartResults. const std::vector& test_part_results() const { return test_part_results_; } // Gets the vector of TestProperties. const std::vector& test_properties() const { return test_properties_; } // Sets the elapsed time. void set_elapsed_time(TimeInMillis elapsed) { elapsed_time_ = elapsed; } // Adds a test property to the list. The property is validated and may add // a non-fatal failure if invalid (e.g., if it conflicts with reserved // key names). If a property is already recorded for the same key, the // value will be updated, rather than storing multiple values for the same // key. void RecordProperty(const TestProperty& test_property); // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. // TODO(russr): Validate attribute names are legal and human readable. static bool ValidateTestProperty(const TestProperty& test_property); // Adds a test part result to the list. void AddTestPartResult(const TestPartResult& test_part_result); // Returns the death test count. int death_test_count() const { return death_test_count_; } // Increments the death test count, returning the new count. int increment_death_test_count() { return ++death_test_count_; } // Clears the test part results. void ClearTestPartResults(); // Clears the object. void Clear(); // Protects mutable state of the property vector and of owned // properties, whose values may be updated. internal::Mutex test_properites_mutex_; // The vector of TestPartResults std::vector test_part_results_; // The vector of TestProperties std::vector test_properties_; // Running count of death tests. int death_test_count_; // The elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestResult. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestResult); }; // class TestResult // A TestInfo object stores the following information about a test: // // Test case name // Test name // Whether the test should be run // A function pointer that creates the test object when invoked // Test result // // The constructor of TestInfo registers itself with the UnitTest // singleton such that the RUN_ALL_TESTS() macro knows which tests to // run. class GTEST_API_ TestInfo { public: // Destructs a TestInfo object. This function is not virtual, so // don't inherit from TestInfo. ~TestInfo(); // Returns the test case name. const char* test_case_name() const { return test_case_name_.c_str(); } // Returns the test name. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a typed // or a type-parameterized test. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns the text representation of the value parameter, or NULL if this // is not a value-parameterized test. const char* value_param() const { if (value_param_.get() != NULL) return value_param_->c_str(); return NULL; } // Returns true if this test should run, that is if the test is not disabled // (or it is disabled but the also_run_disabled_tests flag has been specified) // and its full name matches the user-specified filter. // // Google Test allows the user to filter the tests by their full names. // The full name of a test Bar in test case Foo is defined as // "Foo.Bar". Only the tests that match the filter will run. // // A filter is a colon-separated list of glob (not regex) patterns, // optionally followed by a '-' and a colon-separated list of // negative patterns (tests to exclude). A test is run if it // matches one of the positive patterns and does not match any of // the negative patterns. // // For example, *A*:Foo.* is a filter that matches any string that // contains the character 'A' or starts with "Foo.". bool should_run() const { return should_run_; } // Returns the result of the test. const TestResult* result() const { return &result_; } private: #if GTEST_HAS_DEATH_TEST friend class internal::DefaultDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST friend class Test; friend class TestCase; friend class internal::UnitTestImpl; friend TestInfo* internal::MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, internal::TypeId fixture_class_id, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, internal::TestFactoryBase* factory); // Constructs a TestInfo object. The newly constructed instance assumes // ownership of the factory object. TestInfo(const char* test_case_name, const char* name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory); // Increments the number of death tests encountered in this test so // far. int increment_death_test_count() { return result_.increment_death_test_count(); } // Creates the test object, runs it, records its result, and then // deletes it. void Run(); static void ClearTestResult(TestInfo* test_info) { test_info->result_.Clear(); } // These fields are immutable properties of the test. const std::string test_case_name_; // Test case name const std::string name_; // Test name // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // Text representation of the value parameter, or NULL if this is not a // value-parameterized test. const internal::scoped_ptr value_param_; const internal::TypeId fixture_class_id_; // ID of the test fixture class bool should_run_; // True iff this test should run bool is_disabled_; // True iff this test is disabled bool matches_filter_; // True if this test matches the // user-specified filter. internal::TestFactoryBase* const factory_; // The factory that creates // the test object // This field is mutable and needs to be reset before running the // test for the second time. TestResult result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestInfo); }; // A test case, which consists of a vector of TestInfos. // // TestCase is not copyable. class GTEST_API_ TestCase { public: // Creates a TestCase with the given name. // // TestCase does NOT have a default constructor. Always use this // constructor to create a TestCase object. // // Arguments: // // name: name of the test case // a_type_param: the name of the test's type parameter, or NULL if // this is not a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase(const char* name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Destructor of TestCase. virtual ~TestCase(); // Gets the name of the TestCase. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a // type-parameterized test case. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns true if any test in this test case should run. bool should_run() const { return should_run_; } // Gets the number of successful tests in this test case. int successful_test_count() const; // Gets the number of failed tests in this test case. int failed_test_count() const; // Gets the number of disabled tests in this test case. int disabled_test_count() const; // Get the number of tests in this test case that should run. int test_to_run_count() const; // Gets the number of all tests in this test case. int total_test_count() const; // Returns true iff the test case passed. bool Passed() const { return !Failed(); } // Returns true iff the test case failed. bool Failed() const { return failed_test_count() > 0; } // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* GetTestInfo(int i) const; private: friend class Test; friend class internal::UnitTestImpl; // Gets the (mutable) vector of TestInfos in this TestCase. std::vector& test_info_list() { return test_info_list_; } // Gets the (immutable) vector of TestInfos in this TestCase. const std::vector& test_info_list() const { return test_info_list_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* GetMutableTestInfo(int i); // Sets the should_run member. void set_should_run(bool should) { should_run_ = should; } // Adds a TestInfo to this test case. Will delete the TestInfo upon // destruction of the TestCase object. void AddTestInfo(TestInfo * test_info); // Clears the results of all tests in this test case. void ClearResult(); // Clears the results of all tests in the given test case. static void ClearTestCaseResult(TestCase* test_case) { test_case->ClearResult(); } // Runs every test in this TestCase. void Run(); // Runs SetUpTestCase() for this TestCase. This wrapper is needed // for catching exceptions thrown from SetUpTestCase(). void RunSetUpTestCase() { (*set_up_tc_)(); } // Runs TearDownTestCase() for this TestCase. This wrapper is // needed for catching exceptions thrown from TearDownTestCase(). void RunTearDownTestCase() { (*tear_down_tc_)(); } // Returns true iff test passed. static bool TestPassed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Passed(); } // Returns true iff test failed. static bool TestFailed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Failed(); } // Returns true iff test is disabled. static bool TestDisabled(const TestInfo* test_info) { return test_info->is_disabled_; } // Returns true if the given test should run. static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. internal::String name_; // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // The vector of TestInfos in their original order. It owns the // elements in the vector. std::vector test_info_list_; // Provides a level of indirection for the test list to allow easy // shuffling and restoring the test order. The i-th element in this // vector is the index of the i-th test in the shuffled test list. std::vector test_indices_; // Pointer to the function that sets up the test case. Test::SetUpTestCaseFunc set_up_tc_; // Pointer to the function that tears down the test case. Test::TearDownTestCaseFunc tear_down_tc_; // True iff any test in this test case should run. bool should_run_; // Elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestCases. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestCase); }; // An Environment object is capable of setting up and tearing down an // environment. The user should subclass this to define his own // environment(s). // // An Environment object does the set-up and tear-down in virtual // methods SetUp() and TearDown() instead of the constructor and the // destructor, as: // // 1. You cannot safely throw from a destructor. This is a problem // as in some cases Google Test is used where exceptions are enabled, and // we may want to implement ASSERT_* using exceptions where they are // available. // 2. You cannot use ASSERT_* directly in a constructor or // destructor. class Environment { public: // The d'tor is virtual as we need to subclass Environment. virtual ~Environment() {} // Override this to define how to set up the environment. virtual void SetUp() {} // Override this to define how to tear down the environment. virtual void TearDown() {} private: // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } }; // The interface for tracing execution of tests. The methods are organized in // the order the corresponding events are fired. class TestEventListener { public: virtual ~TestEventListener() {} // Fired before any test activity starts. virtual void OnTestProgramStart(const UnitTest& unit_test) = 0; // Fired before each iteration of tests starts. There may be more than // one iteration if GTEST_FLAG(repeat) is set. iteration is the iteration // index, starting from 0. virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration) = 0; // Fired before environment set-up for each iteration of tests starts. virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test) = 0; // Fired after environment set-up for each iteration of tests ends. virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test) = 0; // Fired before the test case starts. virtual void OnTestCaseStart(const TestCase& test_case) = 0; // Fired before the test starts. virtual void OnTestStart(const TestInfo& test_info) = 0; // Fired after a failed assertion or a SUCCEED() invocation. virtual void OnTestPartResult(const TestPartResult& test_part_result) = 0; // Fired after the test ends. virtual void OnTestEnd(const TestInfo& test_info) = 0; // Fired after the test case ends. virtual void OnTestCaseEnd(const TestCase& test_case) = 0; // Fired before environment tear-down for each iteration of tests starts. virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test) = 0; // Fired after environment tear-down for each iteration of tests ends. virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test) = 0; // Fired after each iteration of tests finishes. virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration) = 0; // Fired after all test activities have ended. virtual void OnTestProgramEnd(const UnitTest& unit_test) = 0; }; // The convenience class for users who need to override just one or two // methods and are not concerned that a possible change to a signature of // the methods they override will not be caught during the build. For // comments about each method please see the definition of TestEventListener // above. class EmptyTestEventListener : public TestEventListener { public: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& /*test_case*/) {} virtual void OnTestStart(const TestInfo& /*test_info*/) {} virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {} virtual void OnTestEnd(const TestInfo& /*test_info*/) {} virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {} virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} }; // TestEventListeners lets users add listeners to track events in Google Test. class GTEST_API_ TestEventListeners { public: TestEventListeners(); ~TestEventListeners(); // Appends an event listener to the end of the list. Google Test assumes // the ownership of the listener (i.e. it will delete the listener when // the test program finishes). void Append(TestEventListener* listener); // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* Release(TestEventListener* listener); // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the caller and makes this // function return NULL the next time. TestEventListener* default_result_printer() const { return default_result_printer_; } // Returns the standard listener responsible for the default XML output // controlled by the --gtest_output=xml flag. Can be removed from the // listeners list by users who want to shut down the default XML output // controlled by this flag and substitute it with custom one. Note that // removing this object from the listener list with Release transfers its // ownership to the caller and makes this function return NULL the next // time. TestEventListener* default_xml_generator() const { return default_xml_generator_; } private: friend class TestCase; friend class TestInfo; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::NoExecDeathTest; friend class internal::TestEventListenersAccessor; friend class internal::UnitTestImpl; // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* repeater(); // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultResultPrinter(TestEventListener* listener); // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultXmlGenerator(TestEventListener* listener); // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool EventForwardingEnabled() const; void SuppressEventForwarding(); // The actual list of listeners. internal::TestEventRepeater* repeater_; // Listener responsible for the standard result output. TestEventListener* default_result_printer_; // Listener responsible for the creation of the XML output file. TestEventListener* default_xml_generator_; // We disallow copying TestEventListeners. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventListeners); }; // A UnitTest consists of a vector of TestCases. // // This is a singleton class. The only instance of UnitTest is // created when UnitTest::GetInstance() is first called. This // instance is never deleted. // // UnitTest is not copyable. // // This class is thread-safe as long as the methods are called // according to their specification. class GTEST_API_ UnitTest { public: // Gets the singleton UnitTest object. The first time this method // is called, a UnitTest object is constructed and returned. // Consecutive calls will return the same object. static UnitTest* GetInstance(); // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // This method can only be called from the main thread. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. int Run() GTEST_MUST_USE_RESULT_; // Returns the working directory when the first TEST() or TEST_F() // was executed. The UnitTest object owns the string. const char* original_working_dir() const; // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. const TestCase* current_test_case() const; // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. const TestInfo* current_test_info() const; // Returns the random seed used at the start of the current test run. int random_seed() const; #if GTEST_HAS_PARAM_TEST // Returns the ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::ParameterizedTestCaseRegistry& parameterized_test_registry(); #endif // GTEST_HAS_PARAM_TEST // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const; // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const; // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const; // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const; // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& listeners(); private: // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in // the order they were registered. After all tests in the program // have finished, all global test environments will be torn-down in // the *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // This method can only be called from the main thread. Environment* AddEnvironment(Environment* env); // Adds a TestPartResult to the current TestResult object. All // Google Test assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) // eventually call this to report their results. The user code // should use the assertion macros instead of calling this directly. void AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace); // Adds a TestProperty to the current TestResult object. If the result already // contains a property with the same key, the value will be updated. void RecordPropertyForCurrentTest(const char* key, const char* value); // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i); // Accessors for the implementation object. internal::UnitTestImpl* impl() { return impl_; } const internal::UnitTestImpl* impl() const { return impl_; } // These classes and funcions are friends as they need to access private // members of UnitTest. friend class Test; friend class internal::AssertHelper; friend class internal::ScopedTrace; friend Environment* AddGlobalTestEnvironment(Environment* env); friend internal::UnitTestImpl* internal::GetUnitTestImpl(); friend void internal::ReportFailureInUnknownLocation( TestPartResult::Type result_type, const internal::String& message); // Creates an empty UnitTest. UnitTest(); // D'tor virtual ~UnitTest(); // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. void PushGTestTrace(const internal::TraceInfo& trace); // Pops a trace from the per-thread Google Test trace stack. void PopGTestTrace(); // Protects mutable state in *impl_. This is mutable as some const // methods need to lock it too. mutable internal::Mutex mutex_; // Opaque implementation object. This field is never changed once // the object is constructed. We don't mark it as const here, as // doing so will cause a warning in the constructor of UnitTest. // Mutable state in *impl_ is protected by mutex_. internal::UnitTestImpl* impl_; // We disallow copying UnitTest. GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTest); }; // A convenient wrapper for adding an environment for the test // program. // // You should call this before RUN_ALL_TESTS() is called, probably in // main(). If you use gtest_main, you need to call this before main() // starts for it to take effect. For example, you can define a global // variable like this: // // testing::Environment* const foo_env = // testing::AddGlobalTestEnvironment(new FooEnvironment); // // However, we strongly recommend you to write your own main() and // call AddGlobalTestEnvironment() there, as relying on initialization // of global variables makes the code harder to read and may cause // problems when you register multiple environments from different // translation units and the environments have dependencies among them // (remember that the compiler doesn't guarantee the order in which // global variables from different translation units are initialized). inline Environment* AddGlobalTestEnvironment(Environment* env) { return UnitTest::GetInstance()->AddEnvironment(env); } // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. GTEST_API_ void InitGoogleTest(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. GTEST_API_ void InitGoogleTest(int* argc, wchar_t** argv); namespace internal { // Formats a comparison assertion (e.g. ASSERT_EQ, EXPECT_LT, and etc) // operand to be used in a failure message. The type (but not value) // of the other operand may affect the format. This allows us to // print a char* as a raw pointer when it is compared against another // char*, and print it as a C string when it is compared against an // std::string object, for example. // // The default implementation ignores the type of the other operand. // Some specialized versions are used to handle formatting wide or // narrow C strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template String FormatForComparisonFailureMessage(const T1& value, const T2& /* other_operand */) { // C++Builder compiles this incorrectly if the namespace isn't explicitly // given. return ::testing::PrintToString(value); } // The helper function for {ASSERT|EXPECT}_EQ. template AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4389) // Temporarily disables warning on // signed/unsigned mismatch. #endif if (expected == actual) { return AssertionSuccess(); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous enums // can be implicitly cast to BiggestInt. GTEST_API_ AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual); // The helper class for {ASSERT|EXPECT}_EQ. The template argument // lhs_is_null_literal is true iff the first argument to ASSERT_EQ() // is a null pointer literal. The following default implementation is // for lhs_is_null_literal being false. template class EqHelper { public: // This templatized version is for the general case. template static AssertionResult Compare(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous // enums can be implicitly cast to BiggestInt. // // Even though its body looks the same as the above version, we // cannot merge the two, as it will make anonymous enums unhappy. static AssertionResult Compare(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } }; // This specialization is used when the first argument to ASSERT_EQ() // is a null pointer literal, like NULL, false, or 0. template <> class EqHelper { public: // We define two overloaded versions of Compare(). The first // version will be picked when the second argument to ASSERT_EQ() is // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or // EXPECT_EQ(false, a_bool). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual, // The following line prevents this overload from being considered if T2 // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr) // expands to Compare("", "", NULL, my_ptr), which requires a conversion // to match the Secret* in the other overload, which would otherwise make // this template match better. typename EnableIf::value>::type* = 0) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // This version will be picked when the second argument to ASSERT_EQ() is a // pointer, e.g. ASSERT_EQ(NULL, a_pointer). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, // We used to have a second template parameter instead of Secret*. That // template parameter would deduce to 'long', making this a better match // than the first overload even without the first overload's EnableIf. // Unfortunately, gcc with -Wconversion-null warns when "passing NULL to // non-pointer argument" (even a deduced integral argument), so the old // implementation caused warnings in user code. Secret* /* expected (NULL) */, T* actual) { // We already know that 'expected' is a null pointer. return CmpHelperEQ(expected_expression, actual_expression, static_cast(NULL), actual); } }; // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_??. It is here just to avoid copy-and-paste // of similar code. // // For each templatized helper function, we also define an overloaded // version for BiggestInt in order to reduce code bloat and allow // anonymous enums to be used with {ASSERT|EXPECT}_?? when compiled // with gcc 4. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ template \ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ const T1& val1, const T2& val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ }\ GTEST_API_ AssertionResult CmpHelper##op_name(\ const char* expr1, const char* expr2, BiggestInt val1, BiggestInt val2) // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // Implements the helper function for {ASSERT|EXPECT}_NE GTEST_IMPL_CMP_HELPER_(NE, !=); // Implements the helper function for {ASSERT|EXPECT}_LE GTEST_IMPL_CMP_HELPER_(LE, <=); // Implements the helper function for {ASSERT|EXPECT}_LT GTEST_IMPL_CMP_HELPER_(LT, < ); // Implements the helper function for {ASSERT|EXPECT}_GE GTEST_IMPL_CMP_HELPER_(GE, >=); // Implements the helper function for {ASSERT|EXPECT}_GT GTEST_IMPL_CMP_HELPER_(GT, > ); #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRCASEEQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRNE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // The helper function for {ASSERT|EXPECT}_STRCASENE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // Helper function for *_STREQ on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual); // Helper function for *_STRNE on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2); } // namespace internal // IsSubstring() and IsNotSubstring() are intended to be used as the // first argument to {EXPECT,ASSERT}_PRED_FORMAT2(), not by // themselves. They check whether needle is a substring of haystack // (NULL is considered a substring of itself only), and return an // appropriate error message when they fail. // // The {needle,haystack}_expr arguments are the stringified // expressions that generated the two real arguments. GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); #if GTEST_HAS_STD_WSTRING GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); #endif // GTEST_HAS_STD_WSTRING namespace internal { // Helper template function for comparing floating-points. // // Template parameter: // // RawType: the raw floating-point type (either float or double) // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template AssertionResult CmpHelperFloatingPointEQ(const char* expected_expression, const char* actual_expression, RawType expected, RawType actual) { const FloatingPoint lhs(expected), rhs(actual); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } ::std::stringstream expected_ss; expected_ss << std::setprecision(std::numeric_limits::digits10 + 2) << expected; ::std::stringstream actual_ss; actual_ss << std::setprecision(std::numeric_limits::digits10 + 2) << actual; return EqFailure(expected_expression, actual_expression, StringStreamToString(&expected_ss), StringStreamToString(&actual_ss), false); } // Helper function for implementing ASSERT_NEAR. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error); // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // A class that enables one to stream messages to assertion macros class GTEST_API_ AssertHelper { public: // Constructor. AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message); ~AssertHelper(); // Message assignment is a semantic trick to enable assertion // streaming; see the GTEST_MESSAGE_ macro below. void operator=(const Message& message) const; private: // We put our data in a struct so that the size of the AssertHelper class can // be as small as possible. This is important because gcc is incapable of // re-using stack space even for temporary variables, so every EXPECT_EQ // reserves stack space for another AssertHelper. struct AssertHelperData { AssertHelperData(TestPartResult::Type t, const char* srcfile, int line_num, const char* msg) : type(t), file(srcfile), line(line_num), message(msg) { } TestPartResult::Type const type; const char* const file; int const line; String const message; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelperData); }; AssertHelperData* const data_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelper); }; } // namespace internal #if GTEST_HAS_PARAM_TEST // The pure interface class that all value-parameterized tests inherit from. // A value-parameterized class must inherit from both ::testing::Test and // ::testing::WithParamInterface. In most cases that just means inheriting // from ::testing::TestWithParam, but more complicated test hierarchies // may need to inherit from Test and WithParamInterface at different levels. // // This interface has support for accessing the test parameter value via // the GetParam() method. // // Use it with one of the parameter generator defining functions, like Range(), // Values(), ValuesIn(), Bool(), and Combine(). // // class FooTest : public ::testing::TestWithParam { // protected: // FooTest() { // // Can use GetParam() here. // } // virtual ~FooTest() { // // Can use GetParam() here. // } // virtual void SetUp() { // // Can use GetParam() here. // } // virtual void TearDown { // // Can use GetParam() here. // } // }; // TEST_P(FooTest, DoesBar) { // // Can use GetParam() method here. // Foo foo; // ASSERT_TRUE(foo.DoesBar(GetParam())); // } // INSTANTIATE_TEST_CASE_P(OneToTenRange, FooTest, ::testing::Range(1, 10)); template class WithParamInterface { public: typedef T ParamType; virtual ~WithParamInterface() {} // The current parameter value. Is also available in the test fixture's // constructor. This member function is non-static, even though it only // references static data, to reduce the opportunity for incorrect uses // like writing 'WithParamInterface::GetParam()' for a test that // uses a fixture whose parameter type is int. const ParamType& GetParam() const { return *parameter_; } private: // Sets parameter value. The caller is responsible for making sure the value // remains alive and unchanged throughout the current test. static void SetParam(const ParamType* parameter) { parameter_ = parameter; } // Static value used for accessing parameter during a test lifetime. static const ParamType* parameter_; // TestClass must be a subclass of WithParamInterface and Test. template friend class internal::ParameterizedTestFactory; }; template const T* WithParamInterface::parameter_ = NULL; // Most value-parameterized classes can ignore the existence of // WithParamInterface, and can just inherit from ::testing::TestWithParam. template class TestWithParam : public Test, public WithParamInterface { }; #endif // GTEST_HAS_PARAM_TEST // Macros for indicating success/failure in test code. // ADD_FAILURE unconditionally adds a failure to the current test. // SUCCEED generates a success - it doesn't automatically make the // current test successful, as a test is only successful when it has // no failure. // // EXPECT_* verifies that a certain condition is satisfied. If not, // it behaves like ADD_FAILURE. In particular: // // EXPECT_TRUE verifies that a Boolean condition is true. // EXPECT_FALSE verifies that a Boolean condition is false. // // FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except // that they will also abort the current function on failure. People // usually want the fail-fast behavior of FAIL and ASSERT_*, but those // writing data-driven tests often find themselves using ADD_FAILURE // and EXPECT_* more. // // Examples: // // EXPECT_TRUE(server.StatusIsOK()); // ASSERT_FALSE(server.HasPendingRequest(port)) // << "There are still pending requests " << "on port " << port; // Generates a nonfatal failure with a generic message. #define ADD_FAILURE() GTEST_NONFATAL_FAILURE_("Failed") // Generates a nonfatal failure at the given source file location with // a generic message. #define ADD_FAILURE_AT(file, line) \ GTEST_MESSAGE_AT_(file, line, "Failed", \ ::testing::TestPartResult::kNonFatalFailure) // Generates a fatal failure with a generic message. #define GTEST_FAIL() GTEST_FATAL_FAILURE_("Failed") // Define this macro to 1 to omit the definition of FAIL(), which is a // generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_FAIL # define FAIL() GTEST_FAIL() #endif // Generates a success with a generic message. #define GTEST_SUCCEED() GTEST_SUCCESS_("Succeeded") // Define this macro to 1 to omit the definition of SUCCEED(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_SUCCEED # define SUCCEED() GTEST_SUCCEED() #endif // Macros for testing exceptions. // // * {ASSERT|EXPECT}_THROW(statement, expected_exception): // Tests that the statement throws the expected exception. // * {ASSERT|EXPECT}_NO_THROW(statement): // Tests that the statement doesn't throw any exception. // * {ASSERT|EXPECT}_ANY_THROW(statement): // Tests that the statement throws an exception. #define EXPECT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_NONFATAL_FAILURE_) #define EXPECT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define EXPECT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define ASSERT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_FATAL_FAILURE_) #define ASSERT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_FATAL_FAILURE_) #define ASSERT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_FATAL_FAILURE_) // Boolean assertions. Condition can be either a Boolean expression or an // AssertionResult. For more information on how to use AssertionResult with // these macros see comments on that class. #define EXPECT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_NONFATAL_FAILURE_) #define EXPECT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_NONFATAL_FAILURE_) #define ASSERT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_FATAL_FAILURE_) #define ASSERT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_FATAL_FAILURE_) // Includes the auto-generated header that implements a family of // generic predicate assertion macros. // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on 09/24/2010 by command // 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! // // Implements a family of generic predicate assertion macros. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Makes sure this header is not included before gtest.h. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ # error Do not include gtest_pred_impl.h directly. Include gtest.h instead. #endif // GTEST_INCLUDE_GTEST_GTEST_H_ // This header implements a family of generic predicate assertion // macros: // // ASSERT_PRED_FORMAT1(pred_format, v1) // ASSERT_PRED_FORMAT2(pred_format, v1, v2) // ... // // where pred_format is a function or functor that takes n (in the // case of ASSERT_PRED_FORMATn) values and their source expression // text, and returns a testing::AssertionResult. See the definition // of ASSERT_EQ in gtest.h for an example. // // If you don't care about formatting, you can use the more // restrictive version: // // ASSERT_PRED1(pred, v1) // ASSERT_PRED2(pred, v1, v2) // ... // // where pred is an n-ary function or functor that returns bool, // and the values v1, v2, ..., must support the << operator for // streaming to std::ostream. // // We also define the EXPECT_* variations. // // For now we only support predicates whose arity is at most 5. // Please email googletestframework@googlegroups.com if you need // support for higher arities. // GTEST_ASSERT_ is the basic statement to which all of the assertions // in this file reduce. Don't use this in your code. #define GTEST_ASSERT_(expression, on_failure) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar = (expression)) \ ; \ else \ on_failure(gtest_ar.failure_message()) // Helper function for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. template AssertionResult AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) { if (pred(v1)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT1. // Don't use this in your code. #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ GTEST_ASSERT_(pred_format(#v1, v1),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. #define GTEST_PRED1_(pred, v1, on_failure)\ GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ #v1, \ pred, \ v1), on_failure) // Unary predicate assertion macros. #define EXPECT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_FATAL_FAILURE_) #define ASSERT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. template AssertionResult AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) { if (pred(v1, v2)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT2. // Don't use this in your code. #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. #define GTEST_PRED2_(pred, v1, v2, on_failure)\ GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, \ #v1, \ #v2, \ pred, \ v1, \ v2), on_failure) // Binary predicate assertion macros. #define EXPECT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_FATAL_FAILURE_) #define ASSERT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. template AssertionResult AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) { if (pred(v1, v2, v3)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT3. // Don't use this in your code. #define GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, v1, v2, v3),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ GTEST_ASSERT_(::testing::AssertPred3Helper(#pred, \ #v1, \ #v2, \ #v3, \ pred, \ v1, \ v2, \ v3), on_failure) // Ternary predicate assertion macros. #define EXPECT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_FATAL_FAILURE_) #define ASSERT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. template AssertionResult AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) { if (pred(v1, v2, v3, v4)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT4. // Don't use this in your code. #define GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, v1, v2, v3, v4),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. #define GTEST_PRED4_(pred, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(::testing::AssertPred4Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ pred, \ v1, \ v2, \ v3, \ v4), on_failure) // 4-ary predicate assertion macros. #define EXPECT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) #define ASSERT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. template AssertionResult AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { if (pred(v1, v2, v3, v4, v5)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ", " << e5 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4 << "\n" << e5 << " evaluates to " << v5; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT5. // Don't use this in your code. #define GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, #v5, v1, v2, v3, v4, v5),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. #define GTEST_PRED5_(pred, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(::testing::AssertPred5Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ #v5, \ pred, \ v1, \ v2, \ v3, \ v4, \ v5), on_failure) // 5-ary predicate assertion macros. #define EXPECT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #define ASSERT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Macros for testing equalities and inequalities. // // * {ASSERT|EXPECT}_EQ(expected, actual): Tests that expected == actual // * {ASSERT|EXPECT}_NE(v1, v2): Tests that v1 != v2 // * {ASSERT|EXPECT}_LT(v1, v2): Tests that v1 < v2 // * {ASSERT|EXPECT}_LE(v1, v2): Tests that v1 <= v2 // * {ASSERT|EXPECT}_GT(v1, v2): Tests that v1 > v2 // * {ASSERT|EXPECT}_GE(v1, v2): Tests that v1 >= v2 // // When they are not, Google Test prints both the tested expressions and // their actual values. The values must be compatible built-in types, // or you will get a compiler error. By "compatible" we mean that the // values can be compared by the respective operator. // // Note: // // 1. It is possible to make a user-defined type work with // {ASSERT|EXPECT}_??(), but that requires overloading the // comparison operators and is thus discouraged by the Google C++ // Usage Guide. Therefore, you are advised to use the // {ASSERT|EXPECT}_TRUE() macro to assert that two objects are // equal. // // 2. The {ASSERT|EXPECT}_??() macros do pointer comparisons on // pointers (in particular, C strings). Therefore, if you use it // with two C strings, you are testing how their locations in memory // are related, not how their content is related. To compare two C // strings by content, use {ASSERT|EXPECT}_STR*(). // // 3. {ASSERT|EXPECT}_EQ(expected, actual) is preferred to // {ASSERT|EXPECT}_TRUE(expected == actual), as the former tells you // what the actual value is when it fails, and similarly for the // other comparisons. // // 4. Do not depend on the order in which {ASSERT|EXPECT}_??() // evaluate their arguments, which is undefined. // // 5. These macros evaluate their arguments exactly once. // // Examples: // // EXPECT_NE(5, Foo()); // EXPECT_EQ(NULL, a_pointer); // ASSERT_LT(i, array_size); // ASSERT_GT(records.size(), 0) << "There is no record left."; #define EXPECT_EQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define EXPECT_NE(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperNE, expected, actual) #define EXPECT_LE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define EXPECT_LT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define EXPECT_GE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define EXPECT_GT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) #define GTEST_ASSERT_EQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define GTEST_ASSERT_NE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperNE, val1, val2) #define GTEST_ASSERT_LE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define GTEST_ASSERT_LT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define GTEST_ASSERT_GE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define GTEST_ASSERT_GT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) // Define macro GTEST_DONT_DEFINE_ASSERT_XY to 1 to omit the definition of // ASSERT_XY(), which clashes with some users' own code. #if !GTEST_DONT_DEFINE_ASSERT_EQ # define ASSERT_EQ(val1, val2) GTEST_ASSERT_EQ(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_NE # define ASSERT_NE(val1, val2) GTEST_ASSERT_NE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LE # define ASSERT_LE(val1, val2) GTEST_ASSERT_LE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LT # define ASSERT_LT(val1, val2) GTEST_ASSERT_LT(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GE # define ASSERT_GE(val1, val2) GTEST_ASSERT_GE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GT # define ASSERT_GT(val1, val2) GTEST_ASSERT_GT(val1, val2) #endif // C String Comparisons. All tests treat NULL and any non-NULL string // as different. Two NULLs are equal. // // * {ASSERT|EXPECT}_STREQ(s1, s2): Tests that s1 == s2 // * {ASSERT|EXPECT}_STRNE(s1, s2): Tests that s1 != s2 // * {ASSERT|EXPECT}_STRCASEEQ(s1, s2): Tests that s1 == s2, ignoring case // * {ASSERT|EXPECT}_STRCASENE(s1, s2): Tests that s1 != s2, ignoring case // // For wide or narrow string objects, you can use the // {ASSERT|EXPECT}_??() macros. // // Don't depend on the order in which the arguments are evaluated, // which is undefined. // // These macros evaluate their arguments exactly once. #define EXPECT_STREQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define EXPECT_STRNE(s1, s2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define EXPECT_STRCASEEQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define EXPECT_STRCASENE(s1, s2)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) #define ASSERT_STREQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define ASSERT_STRNE(s1, s2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define ASSERT_STRCASEEQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define ASSERT_STRCASENE(s1, s2)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) // Macros for comparing floating-point numbers. // // * {ASSERT|EXPECT}_FLOAT_EQ(expected, actual): // Tests that two float values are almost equal. // * {ASSERT|EXPECT}_DOUBLE_EQ(expected, actual): // Tests that two double values are almost equal. // * {ASSERT|EXPECT}_NEAR(v1, v2, abs_error): // Tests that v1 and v2 are within the given distance to each other. // // Google Test uses ULP-based comparison to automatically pick a default // error bound that is appropriate for the operands. See the // FloatingPoint template class in gtest-internal.h if you are // interested in the implementation details. #define EXPECT_FLOAT_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_DOUBLE_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_FLOAT_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_DOUBLE_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_NEAR(val1, val2, abs_error)\ EXPECT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) #define ASSERT_NEAR(val1, val2, abs_error)\ ASSERT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) // These predicate format functions work on floating-point values, and // can be used in {ASSERT|EXPECT}_PRED_FORMAT2*(), e.g. // // EXPECT_PRED_FORMAT2(testing::DoubleLE, Foo(), 5.0); // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. GTEST_API_ AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2); GTEST_API_ AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2); #if GTEST_OS_WINDOWS // Macros that test for HRESULT failure and success, these are only useful // on Windows, and rely on Windows SDK macros and APIs to compile. // // * {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}(expr) // // When expr unexpectedly fails or succeeds, Google Test prints the // expected result and the actual result with both a human-readable // string representation of the error, if available, as well as the // hex result code. # define EXPECT_HRESULT_SUCCEEDED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define ASSERT_HRESULT_SUCCEEDED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define EXPECT_HRESULT_FAILED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) # define ASSERT_HRESULT_FAILED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) #endif // GTEST_OS_WINDOWS // Macros that execute statement and check that it doesn't generate new fatal // failures in the current thread. // // * {ASSERT|EXPECT}_NO_FATAL_FAILURE(statement); // // Examples: // // EXPECT_NO_FATAL_FAILURE(Process()); // ASSERT_NO_FATAL_FAILURE(Process()) << "Process() failed"; // #define ASSERT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_FATAL_FAILURE_) #define EXPECT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_NONFATAL_FAILURE_) // Causes a trace (including the source file path, the current line // number, and the given message) to be included in every test failure // message generated by code in the current scope. The effect is // undone when the control leaves the current scope. // // The message argument can be anything streamable to std::ostream. // // In the implementation, we include the current line number as part // of the dummy variable name, thus allowing multiple SCOPED_TRACE()s // to appear in the same block - as long as they are on different // lines. #define SCOPED_TRACE(message) \ ::testing::internal::ScopedTrace GTEST_CONCAT_TOKEN_(gtest_trace_, __LINE__)(\ __FILE__, __LINE__, ::testing::Message() << (message)) // Compile-time assertion for type equality. // StaticAssertTypeEq() compiles iff type1 and type2 are // the same type. The value it returns is not interesting. // // Instead of making StaticAssertTypeEq a class template, we make it a // function template that invokes a helper class template. This // prevents a user from misusing StaticAssertTypeEq by // defining objects of that type. // // CAVEAT: // // When used inside a method of a class template, // StaticAssertTypeEq() is effective ONLY IF the method is // instantiated. For example, given: // // template class Foo { // public: // void Bar() { testing::StaticAssertTypeEq(); } // }; // // the code: // // void Test1() { Foo foo; } // // will NOT generate a compiler error, as Foo::Bar() is never // actually instantiated. Instead, you need: // // void Test2() { Foo foo; foo.Bar(); } // // to cause a compiler error. template bool StaticAssertTypeEq() { (void)internal::StaticAssertTypeEqHelper(); return true; } // Defines a test. // // The first parameter is the name of the test case, and the second // parameter is the name of the test within the test case. // // The convention is to end the test case name with "Test". For // example, a test case for the Foo class can be named FooTest. // // The user should put his test code between braces after using this // macro. Example: // // TEST(FooTest, InitializesCorrectly) { // Foo foo; // EXPECT_TRUE(foo.StatusIsOK()); // } // Note that we call GetTestTypeId() instead of GetTypeId< // ::testing::Test>() here to get the type ID of testing::Test. This // is to work around a suspected linker bug when using Google Test as // a framework on Mac OS X. The bug causes GetTypeId< // ::testing::Test>() to return different values depending on whether // the call is from the Google Test framework itself or from user test // code. GetTestTypeId() is guaranteed to always return the same // value, as it always calls GetTypeId<>() from the Google Test // framework. #define GTEST_TEST(test_case_name, test_name)\ GTEST_TEST_(test_case_name, test_name, \ ::testing::Test, ::testing::internal::GetTestTypeId()) // Define this macro to 1 to omit the definition of TEST(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_TEST # define TEST(test_case_name, test_name) GTEST_TEST(test_case_name, test_name) #endif // Defines a test that uses a test fixture. // // The first parameter is the name of the test fixture class, which // also doubles as the test case name. The second parameter is the // name of the test within the test case. // // A test fixture class must be declared earlier. The user should put // his test code between braces after using this macro. Example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { b_.AddElement(3); } // // Foo a_; // Foo b_; // }; // // TEST_F(FooTest, InitializesCorrectly) { // EXPECT_TRUE(a_.StatusIsOK()); // } // // TEST_F(FooTest, ReturnsElementCountCorrectly) { // EXPECT_EQ(0, a_.size()); // EXPECT_EQ(1, b_.size()); // } #define TEST_F(test_fixture, test_name)\ GTEST_TEST_(test_fixture, test_name, test_fixture, \ ::testing::internal::GetTypeId()) // Use this macro in main() to run all tests. It returns 0 if all // tests are successful, or 1 otherwise. // // RUN_ALL_TESTS() should be invoked after the command line has been // parsed by InitGoogleTest(). #define RUN_ALL_TESTS()\ (::testing::UnitTest::GetInstance()->Run()) } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/0000700000175000017500000000000012140644175021034 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/0000700000175000017500000000000012140644175022134 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-actions.h0000600000175000017500000011041211561126632025043 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used actions. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ #include #include #ifndef _WIN32_WCE # include #endif #include "gmock/internal/gmock-internal-utils.h" #include "gmock/internal/gmock-port.h" namespace testing { // To implement an action Foo, define: // 1. a class FooAction that implements the ActionInterface interface, and // 2. a factory function that creates an Action object from a // const FooAction*. // // The two-level delegation design follows that of Matcher, providing // consistency for extension developers. It also eases ownership // management as Action objects can now be copied like plain values. namespace internal { template class ActionAdaptor; // BuiltInDefaultValue::Get() returns the "built-in" default // value for type T, which is NULL when T is a pointer type, 0 when T // is a numeric type, false when T is bool, or "" when T is string or // std::string. For any other type T, this value is undefined and the // function will abort the process. template class BuiltInDefaultValue { public: // This function returns true iff type T has a built-in default value. static bool Exists() { return false; } static T Get() { Assert(false, __FILE__, __LINE__, "Default action undefined for the function return type."); return internal::Invalid(); // The above statement will never be reached, but is required in // order for this function to compile. } }; // This partial specialization says that we use the same built-in // default value for T and const T. template class BuiltInDefaultValue { public: static bool Exists() { return BuiltInDefaultValue::Exists(); } static T Get() { return BuiltInDefaultValue::Get(); } }; // This partial specialization defines the default values for pointer // types. template class BuiltInDefaultValue { public: static bool Exists() { return true; } static T* Get() { return NULL; } }; // The following specializations define the default values for // specific types we care about. #define GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(type, value) \ template <> \ class BuiltInDefaultValue { \ public: \ static bool Exists() { return true; } \ static type Get() { return value; } \ } GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(void, ); // NOLINT #if GTEST_HAS_GLOBAL_STRING GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(::string, ""); #endif // GTEST_HAS_GLOBAL_STRING GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(::std::string, ""); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(bool, false); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned char, '\0'); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed char, '\0'); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(char, '\0'); // There's no need for a default action for signed wchar_t, as that // type is the same as wchar_t for gcc, and invalid for MSVC. // // There's also no need for a default action for unsigned wchar_t, as // that type is the same as unsigned int for gcc, and invalid for // MSVC. #if GMOCK_WCHAR_T_IS_NATIVE_ GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(wchar_t, 0U); // NOLINT #endif GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned short, 0U); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed short, 0); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned int, 0U); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed int, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned long, 0UL); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed long, 0L); // NOLINT GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(UInt64, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(Int64, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(float, 0); GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(double, 0); #undef GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_ } // namespace internal // When an unexpected function call is encountered, Google Mock will // let it return a default value if the user has specified one for its // return type, or if the return type has a built-in default value; // otherwise Google Mock won't know what value to return and will have // to abort the process. // // The DefaultValue class allows a user to specify the // default value for a type T that is both copyable and publicly // destructible (i.e. anything that can be used as a function return // type). The usage is: // // // Sets the default value for type T to be foo. // DefaultValue::Set(foo); template class DefaultValue { public: // Sets the default value for type T; requires T to be // copy-constructable and have a public destructor. static void Set(T x) { delete value_; value_ = new T(x); } // Unsets the default value for type T. static void Clear() { delete value_; value_ = NULL; } // Returns true iff the user has set the default value for type T. static bool IsSet() { return value_ != NULL; } // Returns true if T has a default return value set by the user or there // exists a built-in default value. static bool Exists() { return IsSet() || internal::BuiltInDefaultValue::Exists(); } // Returns the default value for type T if the user has set one; // otherwise returns the built-in default value if there is one; // otherwise aborts the process. static T Get() { return value_ == NULL ? internal::BuiltInDefaultValue::Get() : *value_; } private: static const T* value_; }; // This partial specialization allows a user to set default values for // reference types. template class DefaultValue { public: // Sets the default value for type T&. static void Set(T& x) { // NOLINT address_ = &x; } // Unsets the default value for type T&. static void Clear() { address_ = NULL; } // Returns true iff the user has set the default value for type T&. static bool IsSet() { return address_ != NULL; } // Returns true if T has a default return value set by the user or there // exists a built-in default value. static bool Exists() { return IsSet() || internal::BuiltInDefaultValue::Exists(); } // Returns the default value for type T& if the user has set one; // otherwise returns the built-in default value if there is one; // otherwise aborts the process. static T& Get() { return address_ == NULL ? internal::BuiltInDefaultValue::Get() : *address_; } private: static T* address_; }; // This specialization allows DefaultValue::Get() to // compile. template <> class DefaultValue { public: static bool Exists() { return true; } static void Get() {} }; // Points to the user-set default value for type T. template const T* DefaultValue::value_ = NULL; // Points to the user-set default value for type T&. template T* DefaultValue::address_ = NULL; // Implement this interface to define an action for function type F. template class ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; ActionInterface() {} virtual ~ActionInterface() {} // Performs the action. This method is not const, as in general an // action can have side effects and be stateful. For example, a // get-the-next-element-from-the-collection action will need to // remember the current element. virtual Result Perform(const ArgumentTuple& args) = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ActionInterface); }; // An Action is a copyable and IMMUTABLE (except by assignment) // object that represents an action to be taken when a mock function // of type F is called. The implementation of Action is just a // linked_ptr to const ActionInterface, so copying is fairly cheap. // Don't inherit from Action! // // You can view an object implementing ActionInterface as a // concrete action (including its current state), and an Action // object as a handle to it. template class Action { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; // Constructs a null Action. Needed for storing Action objects in // STL containers. Action() : impl_(NULL) {} // Constructs an Action from its implementation. A NULL impl is // used to represent the "do-default" action. explicit Action(ActionInterface* impl) : impl_(impl) {} // Copy constructor. Action(const Action& action) : impl_(action.impl_) {} // This constructor allows us to turn an Action object into an // Action, as long as F's arguments can be implicitly converted // to Func's and Func's return type can be implicitly converted to // F's. template explicit Action(const Action& action); // Returns true iff this is the DoDefault() action. bool IsDoDefault() const { return impl_.get() == NULL; } // Performs the action. Note that this method is const even though // the corresponding method in ActionInterface is not. The reason // is that a const Action means that it cannot be re-bound to // another concrete action, not that the concrete action it binds to // cannot change state. (Think of the difference between a const // pointer and a pointer to const.) Result Perform(const ArgumentTuple& args) const { internal::Assert( !IsDoDefault(), __FILE__, __LINE__, "You are using DoDefault() inside a composite action like " "DoAll() or WithArgs(). This is not supported for technical " "reasons. Please instead spell out the default action, or " "assign the default action to an Action variable and use " "the variable in various places."); return impl_->Perform(args); } private: template friend class internal::ActionAdaptor; internal::linked_ptr > impl_; }; // The PolymorphicAction class template makes it easy to implement a // polymorphic action (i.e. an action that can be used in mock // functions of than one type, e.g. Return()). // // To define a polymorphic action, a user first provides a COPYABLE // implementation class that has a Perform() method template: // // class FooAction { // public: // template // Result Perform(const ArgumentTuple& args) const { // // Processes the arguments and returns a result, using // // tr1::get(args) to get the N-th (0-based) argument in the tuple. // } // ... // }; // // Then the user creates the polymorphic action using // MakePolymorphicAction(object) where object has type FooAction. See // the definition of Return(void) and SetArgumentPointee(value) for // complete examples. template class PolymorphicAction { public: explicit PolymorphicAction(const Impl& impl) : impl_(impl) {} template operator Action() const { return Action(new MonomorphicImpl(impl_)); } private: template class MonomorphicImpl : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit MonomorphicImpl(const Impl& impl) : impl_(impl) {} virtual Result Perform(const ArgumentTuple& args) { return impl_.template Perform(args); } private: Impl impl_; GTEST_DISALLOW_ASSIGN_(MonomorphicImpl); }; Impl impl_; GTEST_DISALLOW_ASSIGN_(PolymorphicAction); }; // Creates an Action from its implementation and returns it. The // created Action object owns the implementation. template Action MakeAction(ActionInterface* impl) { return Action(impl); } // Creates a polymorphic action from its implementation. This is // easier to use than the PolymorphicAction constructor as it // doesn't require you to explicitly write the template argument, e.g. // // MakePolymorphicAction(foo); // vs // PolymorphicAction(foo); template inline PolymorphicAction MakePolymorphicAction(const Impl& impl) { return PolymorphicAction(impl); } namespace internal { // Allows an Action object to pose as an Action, as long as F2 // and F1 are compatible. template class ActionAdaptor : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit ActionAdaptor(const Action& from) : impl_(from.impl_) {} virtual Result Perform(const ArgumentTuple& args) { return impl_->Perform(args); } private: const internal::linked_ptr > impl_; GTEST_DISALLOW_ASSIGN_(ActionAdaptor); }; // Implements the polymorphic Return(x) action, which can be used in // any function that returns the type of x, regardless of the argument // types. // // Note: The value passed into Return must be converted into // Function::Result when this action is cast to Action rather than // when that action is performed. This is important in scenarios like // // MOCK_METHOD1(Method, T(U)); // ... // { // Foo foo; // X x(&foo); // EXPECT_CALL(mock, Method(_)).WillOnce(Return(x)); // } // // In the example above the variable x holds reference to foo which leaves // scope and gets destroyed. If copying X just copies a reference to foo, // that copy will be left with a hanging reference. If conversion to T // makes a copy of foo, the above code is safe. To support that scenario, we // need to make sure that the type conversion happens inside the EXPECT_CALL // statement, and conversion of the result of Return to Action is a // good place for that. // template class ReturnAction { public: // Constructs a ReturnAction object from the value to be returned. // 'value' is passed by value instead of by const reference in order // to allow Return("string literal") to compile. explicit ReturnAction(R value) : value_(value) {} // This template type conversion operator allows Return(x) to be // used in ANY function that returns x's type. template operator Action() const { // Assert statement belongs here because this is the best place to verify // conditions on F. It produces the clearest error messages // in most compilers. // Impl really belongs in this scope as a local class but can't // because MSVC produces duplicate symbols in different translation units // in this case. Until MS fixes that bug we put Impl into the class scope // and put the typedef both here (for use in assert statement) and // in the Impl class. But both definitions must be the same. typedef typename Function::Result Result; GTEST_COMPILE_ASSERT_( !internal::is_reference::value, use_ReturnRef_instead_of_Return_to_return_a_reference); return Action(new Impl(value_)); } private: // Implements the Return(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; // The implicit cast is necessary when Result has more than one // single-argument constructor (e.g. Result is std::vector) and R // has a type conversion operator template. In that case, value_(value) // won't compile as the compiler doesn't known which constructor of // Result to call. ImplicitCast_ forces the compiler to convert R to // Result without considering explicit constructors, thus resolving the // ambiguity. value_ is then initialized using its copy constructor. explicit Impl(R value) : value_(::testing::internal::ImplicitCast_(value)) {} virtual Result Perform(const ArgumentTuple&) { return value_; } private: GTEST_COMPILE_ASSERT_(!internal::is_reference::value, Result_cannot_be_a_reference_type); Result value_; GTEST_DISALLOW_ASSIGN_(Impl); }; R value_; GTEST_DISALLOW_ASSIGN_(ReturnAction); }; // Implements the ReturnNull() action. class ReturnNullAction { public: // Allows ReturnNull() to be used in any pointer-returning function. template static Result Perform(const ArgumentTuple&) { GTEST_COMPILE_ASSERT_(internal::is_pointer::value, ReturnNull_can_be_used_to_return_a_pointer_only); return NULL; } }; // Implements the Return() action. class ReturnVoidAction { public: // Allows Return() to be used in any void-returning function. template static void Perform(const ArgumentTuple&) { CompileAssertTypesEqual(); } }; // Implements the polymorphic ReturnRef(x) action, which can be used // in any function that returns a reference to the type of x, // regardless of the argument types. template class ReturnRefAction { public: // Constructs a ReturnRefAction object from the reference to be returned. explicit ReturnRefAction(T& ref) : ref_(ref) {} // NOLINT // This template type conversion operator allows ReturnRef(x) to be // used in ANY function that returns a reference to x's type. template operator Action() const { typedef typename Function::Result Result; // Asserts that the function return type is a reference. This // catches the user error of using ReturnRef(x) when Return(x) // should be used, and generates some helpful error message. GTEST_COMPILE_ASSERT_(internal::is_reference::value, use_Return_instead_of_ReturnRef_to_return_a_value); return Action(new Impl(ref_)); } private: // Implements the ReturnRef(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(T& ref) : ref_(ref) {} // NOLINT virtual Result Perform(const ArgumentTuple&) { return ref_; } private: T& ref_; GTEST_DISALLOW_ASSIGN_(Impl); }; T& ref_; GTEST_DISALLOW_ASSIGN_(ReturnRefAction); }; // Implements the polymorphic ReturnRefOfCopy(x) action, which can be // used in any function that returns a reference to the type of x, // regardless of the argument types. template class ReturnRefOfCopyAction { public: // Constructs a ReturnRefOfCopyAction object from the reference to // be returned. explicit ReturnRefOfCopyAction(const T& value) : value_(value) {} // NOLINT // This template type conversion operator allows ReturnRefOfCopy(x) to be // used in ANY function that returns a reference to x's type. template operator Action() const { typedef typename Function::Result Result; // Asserts that the function return type is a reference. This // catches the user error of using ReturnRefOfCopy(x) when Return(x) // should be used, and generates some helpful error message. GTEST_COMPILE_ASSERT_( internal::is_reference::value, use_Return_instead_of_ReturnRefOfCopy_to_return_a_value); return Action(new Impl(value_)); } private: // Implements the ReturnRefOfCopy(x) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(const T& value) : value_(value) {} // NOLINT virtual Result Perform(const ArgumentTuple&) { return value_; } private: T value_; GTEST_DISALLOW_ASSIGN_(Impl); }; const T value_; GTEST_DISALLOW_ASSIGN_(ReturnRefOfCopyAction); }; // Implements the polymorphic DoDefault() action. class DoDefaultAction { public: // This template type conversion operator allows DoDefault() to be // used in any function. template operator Action() const { return Action(NULL); } }; // Implements the Assign action to set a given pointer referent to a // particular value. template class AssignAction { public: AssignAction(T1* ptr, T2 value) : ptr_(ptr), value_(value) {} template void Perform(const ArgumentTuple& /* args */) const { *ptr_ = value_; } private: T1* const ptr_; const T2 value_; GTEST_DISALLOW_ASSIGN_(AssignAction); }; #if !GTEST_OS_WINDOWS_MOBILE // Implements the SetErrnoAndReturn action to simulate return from // various system calls and libc functions. template class SetErrnoAndReturnAction { public: SetErrnoAndReturnAction(int errno_value, T result) : errno_(errno_value), result_(result) {} template Result Perform(const ArgumentTuple& /* args */) const { errno = errno_; return result_; } private: const int errno_; const T result_; GTEST_DISALLOW_ASSIGN_(SetErrnoAndReturnAction); }; #endif // !GTEST_OS_WINDOWS_MOBILE // Implements the SetArgumentPointee(x) action for any function // whose N-th argument (0-based) is a pointer to x's type. The // template parameter kIsProto is true iff type A is ProtocolMessage, // proto2::Message, or a sub-class of those. template class SetArgumentPointeeAction { public: // Constructs an action that sets the variable pointed to by the // N-th function argument to 'value'. explicit SetArgumentPointeeAction(const A& value) : value_(value) {} template void Perform(const ArgumentTuple& args) const { CompileAssertTypesEqual(); *::std::tr1::get(args) = value_; } private: const A value_; GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction); }; template class SetArgumentPointeeAction { public: // Constructs an action that sets the variable pointed to by the // N-th function argument to 'proto'. Both ProtocolMessage and // proto2::Message have the CopyFrom() method, so the same // implementation works for both. explicit SetArgumentPointeeAction(const Proto& proto) : proto_(new Proto) { proto_->CopyFrom(proto); } template void Perform(const ArgumentTuple& args) const { CompileAssertTypesEqual(); ::std::tr1::get(args)->CopyFrom(*proto_); } private: const internal::linked_ptr proto_; GTEST_DISALLOW_ASSIGN_(SetArgumentPointeeAction); }; // Implements the InvokeWithoutArgs(f) action. The template argument // FunctionImpl is the implementation type of f, which can be either a // function pointer or a functor. InvokeWithoutArgs(f) can be used as an // Action as long as f's type is compatible with F (i.e. f can be // assigned to a tr1::function). template class InvokeWithoutArgsAction { public: // The c'tor makes a copy of function_impl (either a function // pointer or a functor). explicit InvokeWithoutArgsAction(FunctionImpl function_impl) : function_impl_(function_impl) {} // Allows InvokeWithoutArgs(f) to be used as any action whose type is // compatible with f. template Result Perform(const ArgumentTuple&) { return function_impl_(); } private: FunctionImpl function_impl_; GTEST_DISALLOW_ASSIGN_(InvokeWithoutArgsAction); }; // Implements the InvokeWithoutArgs(object_ptr, &Class::Method) action. template class InvokeMethodWithoutArgsAction { public: InvokeMethodWithoutArgsAction(Class* obj_ptr, MethodPtr method_ptr) : obj_ptr_(obj_ptr), method_ptr_(method_ptr) {} template Result Perform(const ArgumentTuple&) const { return (obj_ptr_->*method_ptr_)(); } private: Class* const obj_ptr_; const MethodPtr method_ptr_; GTEST_DISALLOW_ASSIGN_(InvokeMethodWithoutArgsAction); }; // Implements the IgnoreResult(action) action. template class IgnoreResultAction { public: explicit IgnoreResultAction(const A& action) : action_(action) {} template operator Action() const { // Assert statement belongs here because this is the best place to verify // conditions on F. It produces the clearest error messages // in most compilers. // Impl really belongs in this scope as a local class but can't // because MSVC produces duplicate symbols in different translation units // in this case. Until MS fixes that bug we put Impl into the class scope // and put the typedef both here (for use in assert statement) and // in the Impl class. But both definitions must be the same. typedef typename internal::Function::Result Result; // Asserts at compile time that F returns void. CompileAssertTypesEqual(); return Action(new Impl(action_)); } private: template class Impl : public ActionInterface { public: typedef typename internal::Function::Result Result; typedef typename internal::Function::ArgumentTuple ArgumentTuple; explicit Impl(const A& action) : action_(action) {} virtual void Perform(const ArgumentTuple& args) { // Performs the action and ignores its result. action_.Perform(args); } private: // Type OriginalFunction is the same as F except that its return // type is IgnoredValue. typedef typename internal::Function::MakeResultIgnoredValue OriginalFunction; const Action action_; GTEST_DISALLOW_ASSIGN_(Impl); }; const A action_; GTEST_DISALLOW_ASSIGN_(IgnoreResultAction); }; // A ReferenceWrapper object represents a reference to type T, // which can be either const or not. It can be explicitly converted // from, and implicitly converted to, a T&. Unlike a reference, // ReferenceWrapper can be copied and can survive template type // inference. This is used to support by-reference arguments in the // InvokeArgument(...) action. The idea was from "reference // wrappers" in tr1, which we don't have in our source tree yet. template class ReferenceWrapper { public: // Constructs a ReferenceWrapper object from a T&. explicit ReferenceWrapper(T& l_value) : pointer_(&l_value) {} // NOLINT // Allows a ReferenceWrapper object to be implicitly converted to // a T&. operator T&() const { return *pointer_; } private: T* pointer_; }; // Allows the expression ByRef(x) to be printed as a reference to x. template void PrintTo(const ReferenceWrapper& ref, ::std::ostream* os) { T& value = ref; UniversalPrinter::Print(value, os); } // Does two actions sequentially. Used for implementing the DoAll(a1, // a2, ...) action. template class DoBothAction { public: DoBothAction(Action1 action1, Action2 action2) : action1_(action1), action2_(action2) {} // This template type conversion operator allows DoAll(a1, ..., a_n) // to be used in ANY function of compatible type. template operator Action() const { return Action(new Impl(action1_, action2_)); } private: // Implements the DoAll(...) action for a particular function type F. template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::MakeResultVoid VoidResult; Impl(const Action& action1, const Action& action2) : action1_(action1), action2_(action2) {} virtual Result Perform(const ArgumentTuple& args) { action1_.Perform(args); return action2_.Perform(args); } private: const Action action1_; const Action action2_; GTEST_DISALLOW_ASSIGN_(Impl); }; Action1 action1_; Action2 action2_; GTEST_DISALLOW_ASSIGN_(DoBothAction); }; } // namespace internal // An Unused object can be implicitly constructed from ANY value. // This is handy when defining actions that ignore some or all of the // mock function arguments. For example, given // // MOCK_METHOD3(Foo, double(const string& label, double x, double y)); // MOCK_METHOD3(Bar, double(int index, double x, double y)); // // instead of // // double DistanceToOriginWithLabel(const string& label, double x, double y) { // return sqrt(x*x + y*y); // } // double DistanceToOriginWithIndex(int index, double x, double y) { // return sqrt(x*x + y*y); // } // ... // EXEPCT_CALL(mock, Foo("abc", _, _)) // .WillOnce(Invoke(DistanceToOriginWithLabel)); // EXEPCT_CALL(mock, Bar(5, _, _)) // .WillOnce(Invoke(DistanceToOriginWithIndex)); // // you could write // // // We can declare any uninteresting argument as Unused. // double DistanceToOrigin(Unused, double x, double y) { // return sqrt(x*x + y*y); // } // ... // EXEPCT_CALL(mock, Foo("abc", _, _)).WillOnce(Invoke(DistanceToOrigin)); // EXEPCT_CALL(mock, Bar(5, _, _)).WillOnce(Invoke(DistanceToOrigin)); typedef internal::IgnoredValue Unused; // This constructor allows us to turn an Action object into an // Action, as long as To's arguments can be implicitly converted // to From's and From's return type cann be implicitly converted to // To's. template template Action::Action(const Action& from) : impl_(new internal::ActionAdaptor(from)) {} // Creates an action that returns 'value'. 'value' is passed by value // instead of const reference - otherwise Return("string literal") // will trigger a compiler error about using array as initializer. template internal::ReturnAction Return(R value) { return internal::ReturnAction(value); } // Creates an action that returns NULL. inline PolymorphicAction ReturnNull() { return MakePolymorphicAction(internal::ReturnNullAction()); } // Creates an action that returns from a void function. inline PolymorphicAction Return() { return MakePolymorphicAction(internal::ReturnVoidAction()); } // Creates an action that returns the reference to a variable. template inline internal::ReturnRefAction ReturnRef(R& x) { // NOLINT return internal::ReturnRefAction(x); } // Creates an action that returns the reference to a copy of the // argument. The copy is created when the action is constructed and // lives as long as the action. template inline internal::ReturnRefOfCopyAction ReturnRefOfCopy(const R& x) { return internal::ReturnRefOfCopyAction(x); } // Creates an action that does the default action for the give mock function. inline internal::DoDefaultAction DoDefault() { return internal::DoDefaultAction(); } // Creates an action that sets the variable pointed by the N-th // (0-based) function argument to 'value'. template PolymorphicAction< internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value> > SetArgPointee(const T& x) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value>(x)); } #if !((GTEST_GCC_VER_ && GTEST_GCC_VER_ < 40000) || GTEST_OS_SYMBIAN) // This overload allows SetArgPointee() to accept a string literal. // GCC prior to the version 4.0 and Symbian C++ compiler cannot distinguish // this overload from the templated version and emit a compile error. template PolymorphicAction< internal::SetArgumentPointeeAction > SetArgPointee(const char* p) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, const char*, false>(p)); } template PolymorphicAction< internal::SetArgumentPointeeAction > SetArgPointee(const wchar_t* p) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, const wchar_t*, false>(p)); } #endif // The following version is DEPRECATED. template PolymorphicAction< internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value> > SetArgumentPointee(const T& x) { return MakePolymorphicAction(internal::SetArgumentPointeeAction< N, T, internal::IsAProtocolMessage::value>(x)); } // Creates an action that sets a pointer referent to a given value. template PolymorphicAction > Assign(T1* ptr, T2 val) { return MakePolymorphicAction(internal::AssignAction(ptr, val)); } #if !GTEST_OS_WINDOWS_MOBILE // Creates an action that sets errno and returns the appropriate error. template PolymorphicAction > SetErrnoAndReturn(int errval, T result) { return MakePolymorphicAction( internal::SetErrnoAndReturnAction(errval, result)); } #endif // !GTEST_OS_WINDOWS_MOBILE // Various overloads for InvokeWithoutArgs(). // Creates an action that invokes 'function_impl' with no argument. template PolymorphicAction > InvokeWithoutArgs(FunctionImpl function_impl) { return MakePolymorphicAction( internal::InvokeWithoutArgsAction(function_impl)); } // Creates an action that invokes the given method on the given object // with no argument. template PolymorphicAction > InvokeWithoutArgs(Class* obj_ptr, MethodPtr method_ptr) { return MakePolymorphicAction( internal::InvokeMethodWithoutArgsAction( obj_ptr, method_ptr)); } // Creates an action that performs an_action and throws away its // result. In other words, it changes the return type of an_action to // void. an_action MUST NOT return void, or the code won't compile. template inline internal::IgnoreResultAction IgnoreResult(const A& an_action) { return internal::IgnoreResultAction(an_action); } // Creates a reference wrapper for the given L-value. If necessary, // you can explicitly specify the type of the reference. For example, // suppose 'derived' is an object of type Derived, ByRef(derived) // would wrap a Derived&. If you want to wrap a const Base& instead, // where Base is a base class of Derived, just write: // // ByRef(derived) template inline internal::ReferenceWrapper ByRef(T& l_value) { // NOLINT return internal::ReferenceWrapper(l_value); } } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-cardinalities.h0000600000175000017500000001317111561126632026222 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used cardinalities. More // cardinalities can be defined by the user implementing the // CardinalityInterface interface if necessary. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ #include #include // NOLINT #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" namespace testing { // To implement a cardinality Foo, define: // 1. a class FooCardinality that implements the // CardinalityInterface interface, and // 2. a factory function that creates a Cardinality object from a // const FooCardinality*. // // The two-level delegation design follows that of Matcher, providing // consistency for extension developers. It also eases ownership // management as Cardinality objects can now be copied like plain values. // The implementation of a cardinality. class CardinalityInterface { public: virtual ~CardinalityInterface() {} // Conservative estimate on the lower/upper bound of the number of // calls allowed. virtual int ConservativeLowerBound() const { return 0; } virtual int ConservativeUpperBound() const { return INT_MAX; } // Returns true iff call_count calls will satisfy this cardinality. virtual bool IsSatisfiedByCallCount(int call_count) const = 0; // Returns true iff call_count calls will saturate this cardinality. virtual bool IsSaturatedByCallCount(int call_count) const = 0; // Describes self to an ostream. virtual void DescribeTo(::std::ostream* os) const = 0; }; // A Cardinality is a copyable and IMMUTABLE (except by assignment) // object that specifies how many times a mock function is expected to // be called. The implementation of Cardinality is just a linked_ptr // to const CardinalityInterface, so copying is fairly cheap. // Don't inherit from Cardinality! class Cardinality { public: // Constructs a null cardinality. Needed for storing Cardinality // objects in STL containers. Cardinality() {} // Constructs a Cardinality from its implementation. explicit Cardinality(const CardinalityInterface* impl) : impl_(impl) {} // Conservative estimate on the lower/upper bound of the number of // calls allowed. int ConservativeLowerBound() const { return impl_->ConservativeLowerBound(); } int ConservativeUpperBound() const { return impl_->ConservativeUpperBound(); } // Returns true iff call_count calls will satisfy this cardinality. bool IsSatisfiedByCallCount(int call_count) const { return impl_->IsSatisfiedByCallCount(call_count); } // Returns true iff call_count calls will saturate this cardinality. bool IsSaturatedByCallCount(int call_count) const { return impl_->IsSaturatedByCallCount(call_count); } // Returns true iff call_count calls will over-saturate this // cardinality, i.e. exceed the maximum number of allowed calls. bool IsOverSaturatedByCallCount(int call_count) const { return impl_->IsSaturatedByCallCount(call_count) && !impl_->IsSatisfiedByCallCount(call_count); } // Describes self to an ostream void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); } // Describes the given actual call count to an ostream. static void DescribeActualCallCountTo(int actual_call_count, ::std::ostream* os); private: internal::linked_ptr impl_; }; // Creates a cardinality that allows at least n calls. Cardinality AtLeast(int n); // Creates a cardinality that allows at most n calls. Cardinality AtMost(int n); // Creates a cardinality that allows any number of calls. Cardinality AnyNumber(); // Creates a cardinality that allows between min and max calls. Cardinality Between(int min, int max); // Creates a cardinality that allows exactly n calls. Cardinality Exactly(int n); // Creates a cardinality from its implementation. inline Cardinality MakeCardinality(const CardinalityInterface* c) { return Cardinality(c); } } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-actions.h0000600000175000017500000031544611561126632027015 0ustar synergysynergy// This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic actions. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ #include "gmock/gmock-actions.h" #include "gmock/internal/gmock-port.h" namespace testing { namespace internal { // InvokeHelper knows how to unpack an N-tuple and invoke an N-ary // function or method with the unpacked values, where F is a function // type that takes N arguments. template class InvokeHelper; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple<>&) { return function(); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple<>&) { return (obj_ptr->*method_ptr)(); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args)); } }; template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple& args) { using ::std::tr1::get; return function(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple& args) { using ::std::tr1::get; return (obj_ptr->*method_ptr)(get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } }; // CallableHelper has static methods for invoking "callables", // i.e. function pointers and functors. It uses overloading to // provide a uniform interface for invoking different kinds of // callables. In particular, you can use: // // CallableHelper::Call(callable, a1, a2, ..., an) // // to invoke an n-ary callable, where R is its return type. If an // argument, say a2, needs to be passed by reference, you should write // ByRef(a2) instead of a2 in the above expression. template class CallableHelper { public: // Calls a nullary callable. template static R Call(Function function) { return function(); } // Calls a unary callable. // We deliberately pass a1 by value instead of const reference here // in case it is a C-string literal. If we had declared the // parameter as 'const A1& a1' and write Call(function, "Hi"), the // compiler would've thought A1 is 'char[3]', which causes trouble // when you need to copy a value of type A1. By declaring the // parameter as 'A1 a1', the compiler will correctly infer that A1 // is 'const char*' when it sees Call(function, "Hi"). // // Since this function is defined inline, the compiler can get rid // of the copying of the arguments. Therefore the performance won't // be hurt. template static R Call(Function function, A1 a1) { return function(a1); } // Calls a binary callable. template static R Call(Function function, A1 a1, A2 a2) { return function(a1, a2); } // Calls a ternary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3) { return function(a1, a2, a3); } // Calls a 4-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4) { return function(a1, a2, a3, a4); } // Calls a 5-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { return function(a1, a2, a3, a4, a5); } // Calls a 6-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { return function(a1, a2, a3, a4, a5, a6); } // Calls a 7-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { return function(a1, a2, a3, a4, a5, a6, a7); } // Calls a 8-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { return function(a1, a2, a3, a4, a5, a6, a7, a8); } // Calls a 9-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { return function(a1, a2, a3, a4, a5, a6, a7, a8, a9); } // Calls a 10-ary callable. template static R Call(Function function, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9, A10 a10) { return function(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10); } }; // class CallableHelper // An INTERNAL macro for extracting the type of a tuple field. It's // subject to change without notice - DO NOT USE IN USER CODE! #define GMOCK_FIELD_(Tuple, N) \ typename ::std::tr1::tuple_element::type // SelectArgs::type is the // type of an n-ary function whose i-th (1-based) argument type is the // k{i}-th (0-based) field of ArgumentTuple, which must be a tuple // type, and whose return type is Result. For example, // SelectArgs, 0, 3>::type // is int(bool, long). // // SelectArgs::Select(args) // returns the selected fields (k1, k2, ..., k_n) of args as a tuple. // For example, // SelectArgs, 2, 0>::Select( // ::std::tr1::make_tuple(true, 'a', 2.5)) // returns ::std::tr1::tuple (2.5, true). // // The numbers in list k1, k2, ..., k_n must be >= 0, where n can be // in the range [0, 10]. Duplicates are allowed and they don't have // to be in an ascending or descending order. template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8), GMOCK_FIELD_(ArgumentTuple, k9), GMOCK_FIELD_(ArgumentTuple, k10)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& /* args */) { using ::std::tr1::get; return SelectedArgs(); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; template class SelectArgs { public: typedef Result type(GMOCK_FIELD_(ArgumentTuple, k1), GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), GMOCK_FIELD_(ArgumentTuple, k4), GMOCK_FIELD_(ArgumentTuple, k5), GMOCK_FIELD_(ArgumentTuple, k6), GMOCK_FIELD_(ArgumentTuple, k7), GMOCK_FIELD_(ArgumentTuple, k8), GMOCK_FIELD_(ArgumentTuple, k9)); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs(get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args), get(args)); } }; #undef GMOCK_FIELD_ // Implements the WithArgs action. template class WithArgsAction { public: explicit WithArgsAction(const InnerAction& action) : action_(action) {} template operator Action() const { return MakeAction(new Impl(action_)); } private: template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(const InnerAction& action) : action_(action) {} virtual Result Perform(const ArgumentTuple& args) { return action_.Perform(SelectArgs::Select(args)); } private: typedef typename SelectArgs::type InnerFunctionType; Action action_; }; const InnerAction action_; GTEST_DISALLOW_ASSIGN_(WithArgsAction); }; // A macro from the ACTION* family (defined later in this file) // defines an action that can be used in a mock function. Typically, // these actions only care about a subset of the arguments of the mock // function. For example, if such an action only uses the second // argument, it can be used in any mock function that takes >= 2 // arguments where the type of the second argument is compatible. // // Therefore, the action implementation must be prepared to take more // arguments than it needs. The ExcessiveArg type is used to // represent those excessive arguments. In order to keep the compiler // error messages tractable, we define it in the testing namespace // instead of testing::internal. However, this is an INTERNAL TYPE // and subject to change without notice, so a user MUST NOT USE THIS // TYPE DIRECTLY. struct ExcessiveArg {}; // A helper class needed for implementing the ACTION* macros. template class ActionHelper { public: static Result Perform(Impl* impl, const ::std::tr1::tuple<>& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl<>(args, ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), ExcessiveArg(), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), ExcessiveArg(), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), ExcessiveArg()); } template static Result Perform(Impl* impl, const ::std::tr1::tuple& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl(args, get<0>(args), get<1>(args), get<2>(args), get<3>(args), get<4>(args), get<5>(args), get<6>(args), get<7>(args), get<8>(args), get<9>(args)); } }; } // namespace internal // Various overloads for Invoke(). // WithArgs(an_action) creates an action that passes // the selected arguments of the mock function to an_action and // performs it. It serves as an adaptor between actions with // different argument lists. C++ doesn't support default arguments for // function templates, so we have to overload it. template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } template inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } // Creates an action that does actions a1, a2, ..., sequentially in // each invocation. template inline internal::DoBothAction DoAll(Action1 a1, Action2 a2) { return internal::DoBothAction(a1, a2); } template inline internal::DoBothAction > DoAll(Action1 a1, Action2 a2, Action3 a3) { return DoAll(a1, DoAll(a2, a3)); } template inline internal::DoBothAction > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4) { return DoAll(a1, DoAll(a2, a3, a4)); } template inline internal::DoBothAction > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5) { return DoAll(a1, DoAll(a2, a3, a4, a5)); } template inline internal::DoBothAction > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6)); } template inline internal::DoBothAction > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7)); } template inline internal::DoBothAction > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8)); } template inline internal::DoBothAction > > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8, Action9 a9) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8, a9)); } template inline internal::DoBothAction > > > > > > > > DoAll(Action1 a1, Action2 a2, Action3 a3, Action4 a4, Action5 a5, Action6 a6, Action7 a7, Action8 a8, Action9 a9, Action10 a10) { return DoAll(a1, DoAll(a2, a3, a4, a5, a6, a7, a8, a9, a10)); } } // namespace testing // The ACTION* family of macros can be used in a namespace scope to // define custom actions easily. The syntax: // // ACTION(name) { statements; } // // will define an action with the given name that executes the // statements. The value returned by the statements will be used as // the return value of the action. Inside the statements, you can // refer to the K-th (0-based) argument of the mock function by // 'argK', and refer to its type by 'argK_type'. For example: // // ACTION(IncrementArg1) { // arg1_type temp = arg1; // return ++(*temp); // } // // allows you to write // // ...WillOnce(IncrementArg1()); // // You can also refer to the entire argument tuple and its type by // 'args' and 'args_type', and refer to the mock function type and its // return type by 'function_type' and 'return_type'. // // Note that you don't need to specify the types of the mock function // arguments. However rest assured that your code is still type-safe: // you'll get a compiler error if *arg1 doesn't support the ++ // operator, or if the type of ++(*arg1) isn't compatible with the // mock function's return type, for example. // // Sometimes you'll want to parameterize the action. For that you can use // another macro: // // ACTION_P(name, param_name) { statements; } // // For example: // // ACTION_P(Add, n) { return arg0 + n; } // // will allow you to write: // // ...WillOnce(Add(5)); // // Note that you don't need to provide the type of the parameter // either. If you need to reference the type of a parameter named // 'foo', you can write 'foo_type'. For example, in the body of // ACTION_P(Add, n) above, you can write 'n_type' to refer to the type // of 'n'. // // We also provide ACTION_P2, ACTION_P3, ..., up to ACTION_P10 to support // multi-parameter actions. // // For the purpose of typing, you can view // // ACTION_Pk(Foo, p1, ..., pk) { ... } // // as shorthand for // // template // FooActionPk Foo(p1_type p1, ..., pk_type pk) { ... } // // In particular, you can provide the template type arguments // explicitly when invoking Foo(), as in Foo(5, false); // although usually you can rely on the compiler to infer the types // for you automatically. You can assign the result of expression // Foo(p1, ..., pk) to a variable of type FooActionPk. This can be useful when composing actions. // // You can also overload actions with different numbers of parameters: // // ACTION_P(Plus, a) { ... } // ACTION_P2(Plus, a, b) { ... } // // While it's tempting to always use the ACTION* macros when defining // a new action, you should also consider implementing ActionInterface // or using MakePolymorphicAction() instead, especially if you need to // use the action a lot. While these approaches require more work, // they give you more control on the types of the mock function // arguments and the action parameters, which in general leads to // better compiler error messages that pay off in the long run. They // also allow overloading actions based on parameter types (as opposed // to just based on the number of parameters). // // CAVEAT: // // ACTION*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using ACTION*() inside // a function. // // MORE INFORMATION: // // To learn more about using these macros, please search for 'ACTION' // on http://code.google.com/p/googlemock/wiki/CookBook. // An internal macro needed for implementing ACTION*(). #define GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_\ const args_type& args GTEST_ATTRIBUTE_UNUSED_,\ arg0_type arg0 GTEST_ATTRIBUTE_UNUSED_,\ arg1_type arg1 GTEST_ATTRIBUTE_UNUSED_,\ arg2_type arg2 GTEST_ATTRIBUTE_UNUSED_,\ arg3_type arg3 GTEST_ATTRIBUTE_UNUSED_,\ arg4_type arg4 GTEST_ATTRIBUTE_UNUSED_,\ arg5_type arg5 GTEST_ATTRIBUTE_UNUSED_,\ arg6_type arg6 GTEST_ATTRIBUTE_UNUSED_,\ arg7_type arg7 GTEST_ATTRIBUTE_UNUSED_,\ arg8_type arg8 GTEST_ATTRIBUTE_UNUSED_,\ arg9_type arg9 GTEST_ATTRIBUTE_UNUSED_ // Sometimes you want to give an action explicit template parameters // that cannot be inferred from its value parameters. ACTION() and // ACTION_P*() don't support that. ACTION_TEMPLATE() remedies that // and can be viewed as an extension to ACTION() and ACTION_P*(). // // The syntax: // // ACTION_TEMPLATE(ActionName, // HAS_m_TEMPLATE_PARAMS(kind1, name1, ..., kind_m, name_m), // AND_n_VALUE_PARAMS(p1, ..., p_n)) { statements; } // // defines an action template that takes m explicit template // parameters and n value parameters. name_i is the name of the i-th // template parameter, and kind_i specifies whether it's a typename, // an integral constant, or a template. p_i is the name of the i-th // value parameter. // // Example: // // // DuplicateArg(output) converts the k-th argument of the mock // // function to type T and copies it to *output. // ACTION_TEMPLATE(DuplicateArg, // HAS_2_TEMPLATE_PARAMS(int, k, typename, T), // AND_1_VALUE_PARAMS(output)) { // *output = T(std::tr1::get(args)); // } // ... // int n; // EXPECT_CALL(mock, Foo(_, _)) // .WillOnce(DuplicateArg<1, unsigned char>(&n)); // // To create an instance of an action template, write: // // ActionName(v1, ..., v_n) // // where the ts are the template arguments and the vs are the value // arguments. The value argument types are inferred by the compiler. // If you want to explicitly specify the value argument types, you can // provide additional template arguments: // // ActionName(v1, ..., v_n) // // where u_i is the desired type of v_i. // // ACTION_TEMPLATE and ACTION/ACTION_P* can be overloaded on the // number of value parameters, but not on the number of template // parameters. Without the restriction, the meaning of the following // is unclear: // // OverloadedAction(x); // // Are we using a single-template-parameter action where 'bool' refers // to the type of x, or are we using a two-template-parameter action // where the compiler is asked to infer the type of x? // // Implementation notes: // // GMOCK_INTERNAL_*_HAS_m_TEMPLATE_PARAMS and // GMOCK_INTERNAL_*_AND_n_VALUE_PARAMS are internal macros for // implementing ACTION_TEMPLATE. The main trick we use is to create // new macro invocations when expanding a macro. For example, we have // // #define ACTION_TEMPLATE(name, template_params, value_params) // ... GMOCK_INTERNAL_DECL_##template_params ... // // which causes ACTION_TEMPLATE(..., HAS_1_TEMPLATE_PARAMS(typename, T), ...) // to expand to // // ... GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(typename, T) ... // // Since GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS is a macro, the // preprocessor will continue to expand it to // // ... typename T ... // // This technique conforms to the C++ standard and is portable. It // allows us to implement action templates using O(N) code, where N is // the maximum number of template/value parameters supported. Without // using it, we'd have to devote O(N^2) amount of code to implement all // combinations of m and n. // Declares the template parameters. #define GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(kind0, name0) kind0 name0 #define GMOCK_INTERNAL_DECL_HAS_2_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1) kind0 name0, kind1 name1 #define GMOCK_INTERNAL_DECL_HAS_3_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2) kind0 name0, kind1 name1, kind2 name2 #define GMOCK_INTERNAL_DECL_HAS_4_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3) kind0 name0, kind1 name1, kind2 name2, \ kind3 name3 #define GMOCK_INTERNAL_DECL_HAS_5_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4) kind0 name0, kind1 name1, \ kind2 name2, kind3 name3, kind4 name4 #define GMOCK_INTERNAL_DECL_HAS_6_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5) kind0 name0, \ kind1 name1, kind2 name2, kind3 name3, kind4 name4, kind5 name5 #define GMOCK_INTERNAL_DECL_HAS_7_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6) kind0 name0, kind1 name1, kind2 name2, kind3 name3, kind4 name4, \ kind5 name5, kind6 name6 #define GMOCK_INTERNAL_DECL_HAS_8_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7) kind0 name0, kind1 name1, kind2 name2, kind3 name3, \ kind4 name4, kind5 name5, kind6 name6, kind7 name7 #define GMOCK_INTERNAL_DECL_HAS_9_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7, kind8, name8) kind0 name0, kind1 name1, kind2 name2, \ kind3 name3, kind4 name4, kind5 name5, kind6 name6, kind7 name7, \ kind8 name8 #define GMOCK_INTERNAL_DECL_HAS_10_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1, kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6, kind7, name7, kind8, name8, kind9, name9) kind0 name0, \ kind1 name1, kind2 name2, kind3 name3, kind4 name4, kind5 name5, \ kind6 name6, kind7 name7, kind8 name8, kind9 name9 // Lists the template parameters. #define GMOCK_INTERNAL_LIST_HAS_1_TEMPLATE_PARAMS(kind0, name0) name0 #define GMOCK_INTERNAL_LIST_HAS_2_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1) name0, name1 #define GMOCK_INTERNAL_LIST_HAS_3_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2) name0, name1, name2 #define GMOCK_INTERNAL_LIST_HAS_4_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3) name0, name1, name2, name3 #define GMOCK_INTERNAL_LIST_HAS_5_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4) name0, name1, name2, name3, \ name4 #define GMOCK_INTERNAL_LIST_HAS_6_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5) name0, name1, \ name2, name3, name4, name5 #define GMOCK_INTERNAL_LIST_HAS_7_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6) name0, name1, name2, name3, name4, name5, name6 #define GMOCK_INTERNAL_LIST_HAS_8_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7) name0, name1, name2, name3, name4, name5, name6, name7 #define GMOCK_INTERNAL_LIST_HAS_9_TEMPLATE_PARAMS(kind0, name0, kind1, name1, \ kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, name6, \ kind7, name7, kind8, name8) name0, name1, name2, name3, name4, name5, \ name6, name7, name8 #define GMOCK_INTERNAL_LIST_HAS_10_TEMPLATE_PARAMS(kind0, name0, kind1, \ name1, kind2, name2, kind3, name3, kind4, name4, kind5, name5, kind6, \ name6, kind7, name7, kind8, name8, kind9, name9) name0, name1, name2, \ name3, name4, name5, name6, name7, name8, name9 // Declares the types of value parameters. #define GMOCK_INTERNAL_DECL_TYPE_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DECL_TYPE_AND_1_VALUE_PARAMS(p0) , typename p0##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_2_VALUE_PARAMS(p0, p1) , \ typename p0##_type, typename p1##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_3_VALUE_PARAMS(p0, p1, p2) , \ typename p0##_type, typename p1##_type, typename p2##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_4_VALUE_PARAMS(p0, p1, p2, p3) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) , \ typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type, typename p7##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8) , typename p0##_type, typename p1##_type, typename p2##_type, \ typename p3##_type, typename p4##_type, typename p5##_type, \ typename p6##_type, typename p7##_type, typename p8##_type #define GMOCK_INTERNAL_DECL_TYPE_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9) , typename p0##_type, typename p1##_type, \ typename p2##_type, typename p3##_type, typename p4##_type, \ typename p5##_type, typename p6##_type, typename p7##_type, \ typename p8##_type, typename p9##_type // Initializes the value parameters. #define GMOCK_INTERNAL_INIT_AND_0_VALUE_PARAMS()\ () #define GMOCK_INTERNAL_INIT_AND_1_VALUE_PARAMS(p0)\ (p0##_type gmock_p0) : p0(gmock_p0) #define GMOCK_INTERNAL_INIT_AND_2_VALUE_PARAMS(p0, p1)\ (p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), p1(gmock_p1) #define GMOCK_INTERNAL_INIT_AND_3_VALUE_PARAMS(p0, p1, p2)\ (p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) #define GMOCK_INTERNAL_INIT_AND_4_VALUE_PARAMS(p0, p1, p2, p3)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3) #define GMOCK_INTERNAL_INIT_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4) #define GMOCK_INTERNAL_INIT_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) #define GMOCK_INTERNAL_INIT_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) #define GMOCK_INTERNAL_INIT_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) #define GMOCK_INTERNAL_INIT_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) #define GMOCK_INTERNAL_INIT_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9)\ (p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8), p9(gmock_p9) // Declares the fields for storing the value parameters. #define GMOCK_INTERNAL_DEFN_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DEFN_AND_1_VALUE_PARAMS(p0) p0##_type p0; #define GMOCK_INTERNAL_DEFN_AND_2_VALUE_PARAMS(p0, p1) p0##_type p0; \ p1##_type p1; #define GMOCK_INTERNAL_DEFN_AND_3_VALUE_PARAMS(p0, p1, p2) p0##_type p0; \ p1##_type p1; p2##_type p2; #define GMOCK_INTERNAL_DEFN_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0##_type p0; \ p1##_type p1; p2##_type p2; p3##_type p3; #define GMOCK_INTERNAL_DEFN_AND_5_VALUE_PARAMS(p0, p1, p2, p3, \ p4) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; #define GMOCK_INTERNAL_DEFN_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, \ p5) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; #define GMOCK_INTERNAL_DEFN_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; p6##_type p6; #define GMOCK_INTERNAL_DEFN_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; p4##_type p4; \ p5##_type p5; p6##_type p6; p7##_type p7; #define GMOCK_INTERNAL_DEFN_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; \ p4##_type p4; p5##_type p5; p6##_type p6; p7##_type p7; p8##_type p8; #define GMOCK_INTERNAL_DEFN_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0##_type p0; p1##_type p1; p2##_type p2; p3##_type p3; \ p4##_type p4; p5##_type p5; p6##_type p6; p7##_type p7; p8##_type p8; \ p9##_type p9; // Lists the value parameters. #define GMOCK_INTERNAL_LIST_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_LIST_AND_1_VALUE_PARAMS(p0) p0 #define GMOCK_INTERNAL_LIST_AND_2_VALUE_PARAMS(p0, p1) p0, p1 #define GMOCK_INTERNAL_LIST_AND_3_VALUE_PARAMS(p0, p1, p2) p0, p1, p2 #define GMOCK_INTERNAL_LIST_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0, p1, p2, p3 #define GMOCK_INTERNAL_LIST_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) p0, p1, \ p2, p3, p4 #define GMOCK_INTERNAL_LIST_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) p0, \ p1, p2, p3, p4, p5 #define GMOCK_INTERNAL_LIST_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0, p1, p2, p3, p4, p5, p6 #define GMOCK_INTERNAL_LIST_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0, p1, p2, p3, p4, p5, p6, p7 #define GMOCK_INTERNAL_LIST_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0, p1, p2, p3, p4, p5, p6, p7, p8 #define GMOCK_INTERNAL_LIST_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0, p1, p2, p3, p4, p5, p6, p7, p8, p9 // Lists the value parameter types. #define GMOCK_INTERNAL_LIST_TYPE_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_LIST_TYPE_AND_1_VALUE_PARAMS(p0) , p0##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_2_VALUE_PARAMS(p0, p1) , p0##_type, \ p1##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_3_VALUE_PARAMS(p0, p1, p2) , p0##_type, \ p1##_type, p2##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_4_VALUE_PARAMS(p0, p1, p2, p3) , \ p0##_type, p1##_type, p2##_type, p3##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) , \ p0##_type, p1##_type, p2##_type, p3##_type, p4##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) , \ p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, p5##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, p5##_type, \ p6##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type, p8##_type #define GMOCK_INTERNAL_LIST_TYPE_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9) , p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \ p5##_type, p6##_type, p7##_type, p8##_type, p9##_type // Declares the value parameters. #define GMOCK_INTERNAL_DECL_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_DECL_AND_1_VALUE_PARAMS(p0) p0##_type p0 #define GMOCK_INTERNAL_DECL_AND_2_VALUE_PARAMS(p0, p1) p0##_type p0, \ p1##_type p1 #define GMOCK_INTERNAL_DECL_AND_3_VALUE_PARAMS(p0, p1, p2) p0##_type p0, \ p1##_type p1, p2##_type p2 #define GMOCK_INTERNAL_DECL_AND_4_VALUE_PARAMS(p0, p1, p2, p3) p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3 #define GMOCK_INTERNAL_DECL_AND_5_VALUE_PARAMS(p0, p1, p2, p3, \ p4) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4 #define GMOCK_INTERNAL_DECL_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, \ p5) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5 #define GMOCK_INTERNAL_DECL_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, \ p6) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5, p6##_type p6 #define GMOCK_INTERNAL_DECL_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, \ p5##_type p5, p6##_type p6, p7##_type p7 #define GMOCK_INTERNAL_DECL_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8 #define GMOCK_INTERNAL_DECL_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9 // The suffix of the class template implementing the action template. #define GMOCK_INTERNAL_COUNT_AND_0_VALUE_PARAMS() #define GMOCK_INTERNAL_COUNT_AND_1_VALUE_PARAMS(p0) P #define GMOCK_INTERNAL_COUNT_AND_2_VALUE_PARAMS(p0, p1) P2 #define GMOCK_INTERNAL_COUNT_AND_3_VALUE_PARAMS(p0, p1, p2) P3 #define GMOCK_INTERNAL_COUNT_AND_4_VALUE_PARAMS(p0, p1, p2, p3) P4 #define GMOCK_INTERNAL_COUNT_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) P5 #define GMOCK_INTERNAL_COUNT_AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5) P6 #define GMOCK_INTERNAL_COUNT_AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6) P7 #define GMOCK_INTERNAL_COUNT_AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7) P8 #define GMOCK_INTERNAL_COUNT_AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8) P9 #define GMOCK_INTERNAL_COUNT_AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, \ p7, p8, p9) P10 // The name of the class template implementing the action template. #define GMOCK_ACTION_CLASS_(name, value_params)\ GTEST_CONCAT_TOKEN_(name##Action, GMOCK_INTERNAL_COUNT_##value_params) #define ACTION_TEMPLATE(name, template_params, value_params)\ template \ class GMOCK_ACTION_CLASS_(name, value_params) {\ public:\ GMOCK_ACTION_CLASS_(name, value_params)\ GMOCK_INTERNAL_INIT_##value_params {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ explicit gmock_Impl GMOCK_INTERNAL_INIT_##value_params {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(\ new gmock_Impl(GMOCK_INTERNAL_LIST_##value_params));\ }\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(GMOCK_ACTION_CLASS_(name, value_params));\ };\ template \ inline GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params> name(\ GMOCK_INTERNAL_DECL_##value_params) {\ return GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>(\ GMOCK_INTERNAL_LIST_##value_params);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>::gmock_Impl::\ gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION(name)\ class name##Action {\ public:\ name##Action() {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl() {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl());\ }\ private:\ GTEST_DISALLOW_ASSIGN_(name##Action);\ };\ inline name##Action name() {\ return name##Action();\ }\ template \ template \ typename ::testing::internal::Function::Result\ name##Action::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P(name, p0)\ template \ class name##ActionP {\ public:\ name##ActionP(p0##_type gmock_p0) : p0(gmock_p0) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ explicit gmock_Impl(p0##_type gmock_p0) : p0(gmock_p0) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0));\ }\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP);\ };\ template \ inline name##ActionP name(p0##_type p0) {\ return name##ActionP(p0);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P2(name, p0, p1)\ template \ class name##ActionP2 {\ public:\ name##ActionP2(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1));\ }\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP2);\ };\ template \ inline name##ActionP2 name(p0##_type p0, \ p1##_type p1) {\ return name##ActionP2(p0, p1);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP2::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P3(name, p0, p1, p2)\ template \ class name##ActionP3 {\ public:\ name##ActionP3(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP3);\ };\ template \ inline name##ActionP3 name(p0##_type p0, \ p1##_type p1, p2##_type p2) {\ return name##ActionP3(p0, p1, p2);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP3::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P4(name, p0, p1, p2, p3)\ template \ class name##ActionP4 {\ public:\ name##ActionP4(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP4);\ };\ template \ inline name##ActionP4 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3) {\ return name##ActionP4(p0, p1, \ p2, p3);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP4::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P5(name, p0, p1, p2, p3, p4)\ template \ class name##ActionP5 {\ public:\ name##ActionP5(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, \ p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4) : p0(gmock_p0), \ p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP5);\ };\ template \ inline name##ActionP5 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4) {\ return name##ActionP5(p0, p1, p2, p3, p4);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP5::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P6(name, p0, p1, p2, p3, p4, p5)\ template \ class name##ActionP6 {\ public:\ name##ActionP6(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP6);\ };\ template \ inline name##ActionP6 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3, p4##_type p4, p5##_type p5) {\ return name##ActionP6(p0, p1, p2, p3, p4, p5);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP6::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P7(name, p0, p1, p2, p3, p4, p5, p6)\ template \ class name##ActionP7 {\ public:\ name##ActionP7(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), \ p6(gmock_p6) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP7);\ };\ template \ inline name##ActionP7 name(p0##_type p0, p1##_type p1, \ p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6) {\ return name##ActionP7(p0, p1, p2, p3, p4, p5, p6);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP7::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P8(name, p0, p1, p2, p3, p4, p5, p6, p7)\ template \ class name##ActionP8 {\ public:\ name##ActionP8(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, \ p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7) : p0(gmock_p0), \ p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), \ p5(gmock_p5), p6(gmock_p6), p7(gmock_p7) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP8);\ };\ template \ inline name##ActionP8 name(p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6, p7##_type p7) {\ return name##ActionP8(p0, p1, p2, p3, p4, p5, \ p6, p7);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP8::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P9(name, p0, p1, p2, p3, p4, p5, p6, p7, p8)\ template \ class name##ActionP9 {\ public:\ name##ActionP9(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7, p8));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP9);\ };\ template \ inline name##ActionP9 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, \ p8##_type p8) {\ return name##ActionP9(p0, p1, p2, \ p3, p4, p5, p6, p7, p8);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP9::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const #define ACTION_P10(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)\ template \ class name##ActionP10 {\ public:\ name##ActionP10(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8, p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template \ return_type gmock_PerformImpl(const args_type& args, arg0_type arg0, \ arg1_type arg1, arg2_type arg2, arg3_type arg3, arg4_type arg4, \ arg5_type arg5, arg6_type arg6, arg7_type arg7, arg8_type arg8, \ arg9_type arg9) const;\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl(p0, p1, p2, p3, p4, p5, \ p6, p7, p8, p9));\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(name##ActionP10);\ };\ template \ inline name##ActionP10 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9) {\ return name##ActionP10(p0, \ p1, p2, p3, p4, p5, p6, p7, p8, p9);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ name##ActionP10::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const // TODO(wan@google.com): move the following to a different .h file // such that we don't have to run 'pump' every time the code is // updated. namespace testing { // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Various overloads for InvokeArgument(). // // The InvokeArgument(a1, a2, ..., a_k) action invokes the N-th // (0-based) argument, which must be a k-ary callable, of the mock // function, with arguments a1, a2, ..., a_k. // // Notes: // // 1. The arguments are passed by value by default. If you need to // pass an argument by reference, wrap it inside ByRef(). For // example, // // InvokeArgument<1>(5, string("Hello"), ByRef(foo)) // // passes 5 and string("Hello") by value, and passes foo by // reference. // // 2. If the callable takes an argument by reference but ByRef() is // not used, it will receive the reference to a copy of the value, // instead of the original value. For example, when the 0-th // argument of the mock function takes a const string&, the action // // InvokeArgument<0>(string("Hello")) // // makes a copy of the temporary string("Hello") object and passes a // reference of the copy, instead of the original temporary object, // to the callable. This makes it easy for a user to define an // InvokeArgument action from temporary values and have it performed // later. ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { return internal::CallableHelper::Call( ::std::tr1::get(args)); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(p0)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_2_VALUE_PARAMS(p0, p1)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_3_VALUE_PARAMS(p0, p1, p2)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_4_VALUE_PARAMS(p0, p1, p2, p3)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7, p8); } ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)) { return internal::CallableHelper::Call( ::std::tr1::get(args), p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); } // Various overloads for ReturnNew(). // // The ReturnNew(a1, a2, ..., a_k) action returns a pointer to a new // instance of type T, constructed on the heap with constructor arguments // a1, a2, ..., and a_k. The caller assumes ownership of the returned value. ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_0_VALUE_PARAMS()) { return new T(); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_1_VALUE_PARAMS(p0)) { return new T(p0); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_2_VALUE_PARAMS(p0, p1)) { return new T(p0, p1); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_3_VALUE_PARAMS(p0, p1, p2)) { return new T(p0, p1, p2); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_4_VALUE_PARAMS(p0, p1, p2, p3)) { return new T(p0, p1, p2, p3); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4)) { return new T(p0, p1, p2, p3, p4); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_6_VALUE_PARAMS(p0, p1, p2, p3, p4, p5)) { return new T(p0, p1, p2, p3, p4, p5); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_7_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6)) { return new T(p0, p1, p2, p3, p4, p5, p6); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_8_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_9_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7, p8); } ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_10_VALUE_PARAMS(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)) { return new T(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9); } #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-actions.h.pump0000600000175000017500000006574011561126632027774 0ustar synergysynergy$$ -*- mode: c++; -*- $$ This is a Pump source file. Please use Pump to convert it to $$ gmock-generated-actions.h. $$ $var n = 10 $$ The maximum arity we support. $$}} This meta comment fixes auto-indentation in editors. // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic actions. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ #include "gmock/gmock-actions.h" #include "gmock/internal/gmock-port.h" namespace testing { namespace internal { // InvokeHelper knows how to unpack an N-tuple and invoke an N-ary // function or method with the unpacked values, where F is a function // type that takes N arguments. template class InvokeHelper; $range i 0..n $for i [[ $range j 1..i $var types = [[$for j [[, typename A$j]]]] $var as = [[$for j, [[A$j]]]] $var args = [[$if i==0 [[]] $else [[ args]]]] $var import = [[$if i==0 [[]] $else [[ using ::std::tr1::get; ]]]] $var gets = [[$for j, [[get<$(j - 1)>(args)]]]] template class InvokeHelper > { public: template static R Invoke(Function function, const ::std::tr1::tuple<$as>&$args) { $import return function($gets); } template static R InvokeMethod(Class* obj_ptr, MethodPtr method_ptr, const ::std::tr1::tuple<$as>&$args) { $import return (obj_ptr->*method_ptr)($gets); } }; ]] // CallableHelper has static methods for invoking "callables", // i.e. function pointers and functors. It uses overloading to // provide a uniform interface for invoking different kinds of // callables. In particular, you can use: // // CallableHelper::Call(callable, a1, a2, ..., an) // // to invoke an n-ary callable, where R is its return type. If an // argument, say a2, needs to be passed by reference, you should write // ByRef(a2) instead of a2 in the above expression. template class CallableHelper { public: // Calls a nullary callable. template static R Call(Function function) { return function(); } // Calls a unary callable. // We deliberately pass a1 by value instead of const reference here // in case it is a C-string literal. If we had declared the // parameter as 'const A1& a1' and write Call(function, "Hi"), the // compiler would've thought A1 is 'char[3]', which causes trouble // when you need to copy a value of type A1. By declaring the // parameter as 'A1 a1', the compiler will correctly infer that A1 // is 'const char*' when it sees Call(function, "Hi"). // // Since this function is defined inline, the compiler can get rid // of the copying of the arguments. Therefore the performance won't // be hurt. template static R Call(Function function, A1 a1) { return function(a1); } $range i 2..n $for i [[ $var arity = [[$if i==2 [[binary]] $elif i==3 [[ternary]] $else [[$i-ary]]]] // Calls a $arity callable. $range j 1..i $var typename_As = [[$for j, [[typename A$j]]]] $var Aas = [[$for j, [[A$j a$j]]]] $var as = [[$for j, [[a$j]]]] $var typename_Ts = [[$for j, [[typename T$j]]]] $var Ts = [[$for j, [[T$j]]]] template static R Call(Function function, $Aas) { return function($as); } ]] }; // class CallableHelper // An INTERNAL macro for extracting the type of a tuple field. It's // subject to change without notice - DO NOT USE IN USER CODE! #define GMOCK_FIELD_(Tuple, N) \ typename ::std::tr1::tuple_element::type $range i 1..n // SelectArgs::type is the // type of an n-ary function whose i-th (1-based) argument type is the // k{i}-th (0-based) field of ArgumentTuple, which must be a tuple // type, and whose return type is Result. For example, // SelectArgs, 0, 3>::type // is int(bool, long). // // SelectArgs::Select(args) // returns the selected fields (k1, k2, ..., k_n) of args as a tuple. // For example, // SelectArgs, 2, 0>::Select( // ::std::tr1::make_tuple(true, 'a', 2.5)) // returns ::std::tr1::tuple (2.5, true). // // The numbers in list k1, k2, ..., k_n must be >= 0, where n can be // in the range [0, $n]. Duplicates are allowed and they don't have // to be in an ascending or descending order. template class SelectArgs { public: typedef Result type($for i, [[GMOCK_FIELD_(ArgumentTuple, k$i)]]); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& args) { using ::std::tr1::get; return SelectedArgs($for i, [[get(args)]]); } }; $for i [[ $range j 1..n $range j1 1..i-1 template class SelectArgs { public: typedef Result type($for j1, [[GMOCK_FIELD_(ArgumentTuple, k$j1)]]); typedef typename Function::ArgumentTuple SelectedArgs; static SelectedArgs Select(const ArgumentTuple& [[]] $if i == 1 [[/* args */]] $else [[args]]) { using ::std::tr1::get; return SelectedArgs($for j1, [[get(args)]]); } }; ]] #undef GMOCK_FIELD_ $var ks = [[$for i, [[k$i]]]] // Implements the WithArgs action. template class WithArgsAction { public: explicit WithArgsAction(const InnerAction& action) : action_(action) {} template operator Action() const { return MakeAction(new Impl(action_)); } private: template class Impl : public ActionInterface { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; explicit Impl(const InnerAction& action) : action_(action) {} virtual Result Perform(const ArgumentTuple& args) { return action_.Perform(SelectArgs::Select(args)); } private: typedef typename SelectArgs::type InnerFunctionType; Action action_; }; const InnerAction action_; GTEST_DISALLOW_ASSIGN_(WithArgsAction); }; // A macro from the ACTION* family (defined later in this file) // defines an action that can be used in a mock function. Typically, // these actions only care about a subset of the arguments of the mock // function. For example, if such an action only uses the second // argument, it can be used in any mock function that takes >= 2 // arguments where the type of the second argument is compatible. // // Therefore, the action implementation must be prepared to take more // arguments than it needs. The ExcessiveArg type is used to // represent those excessive arguments. In order to keep the compiler // error messages tractable, we define it in the testing namespace // instead of testing::internal. However, this is an INTERNAL TYPE // and subject to change without notice, so a user MUST NOT USE THIS // TYPE DIRECTLY. struct ExcessiveArg {}; // A helper class needed for implementing the ACTION* macros. template class ActionHelper { public: $range i 0..n $for i [[ $var template = [[$if i==0 [[]] $else [[ $range j 0..i-1 template <$for j, [[typename A$j]]> ]]]] $range j 0..i-1 $var As = [[$for j, [[A$j]]]] $var as = [[$for j, [[get<$j>(args)]]]] $range k 1..n-i $var eas = [[$for k, [[ExcessiveArg()]]]] $var arg_list = [[$if (i==0) | (i==n) [[$as$eas]] $else [[$as, $eas]]]] $template static Result Perform(Impl* impl, const ::std::tr1::tuple<$As>& args) { using ::std::tr1::get; return impl->template gmock_PerformImpl<$As>(args, $arg_list); } ]] }; } // namespace internal // Various overloads for Invoke(). // WithArgs(an_action) creates an action that passes // the selected arguments of the mock function to an_action and // performs it. It serves as an adaptor between actions with // different argument lists. C++ doesn't support default arguments for // function templates, so we have to overload it. $range i 1..n $for i [[ $range j 1..i template <$for j [[int k$j, ]]typename InnerAction> inline internal::WithArgsAction WithArgs(const InnerAction& action) { return internal::WithArgsAction(action); } ]] // Creates an action that does actions a1, a2, ..., sequentially in // each invocation. $range i 2..n $for i [[ $range j 2..i $var types = [[$for j, [[typename Action$j]]]] $var Aas = [[$for j [[, Action$j a$j]]]] template $range k 1..i-1 inline $for k [[internal::DoBothAction]] DoAll(Action1 a1$Aas) { $if i==2 [[ return internal::DoBothAction(a1, a2); ]] $else [[ $range j2 2..i return DoAll(a1, DoAll($for j2, [[a$j2]])); ]] } ]] } // namespace testing // The ACTION* family of macros can be used in a namespace scope to // define custom actions easily. The syntax: // // ACTION(name) { statements; } // // will define an action with the given name that executes the // statements. The value returned by the statements will be used as // the return value of the action. Inside the statements, you can // refer to the K-th (0-based) argument of the mock function by // 'argK', and refer to its type by 'argK_type'. For example: // // ACTION(IncrementArg1) { // arg1_type temp = arg1; // return ++(*temp); // } // // allows you to write // // ...WillOnce(IncrementArg1()); // // You can also refer to the entire argument tuple and its type by // 'args' and 'args_type', and refer to the mock function type and its // return type by 'function_type' and 'return_type'. // // Note that you don't need to specify the types of the mock function // arguments. However rest assured that your code is still type-safe: // you'll get a compiler error if *arg1 doesn't support the ++ // operator, or if the type of ++(*arg1) isn't compatible with the // mock function's return type, for example. // // Sometimes you'll want to parameterize the action. For that you can use // another macro: // // ACTION_P(name, param_name) { statements; } // // For example: // // ACTION_P(Add, n) { return arg0 + n; } // // will allow you to write: // // ...WillOnce(Add(5)); // // Note that you don't need to provide the type of the parameter // either. If you need to reference the type of a parameter named // 'foo', you can write 'foo_type'. For example, in the body of // ACTION_P(Add, n) above, you can write 'n_type' to refer to the type // of 'n'. // // We also provide ACTION_P2, ACTION_P3, ..., up to ACTION_P$n to support // multi-parameter actions. // // For the purpose of typing, you can view // // ACTION_Pk(Foo, p1, ..., pk) { ... } // // as shorthand for // // template // FooActionPk Foo(p1_type p1, ..., pk_type pk) { ... } // // In particular, you can provide the template type arguments // explicitly when invoking Foo(), as in Foo(5, false); // although usually you can rely on the compiler to infer the types // for you automatically. You can assign the result of expression // Foo(p1, ..., pk) to a variable of type FooActionPk. This can be useful when composing actions. // // You can also overload actions with different numbers of parameters: // // ACTION_P(Plus, a) { ... } // ACTION_P2(Plus, a, b) { ... } // // While it's tempting to always use the ACTION* macros when defining // a new action, you should also consider implementing ActionInterface // or using MakePolymorphicAction() instead, especially if you need to // use the action a lot. While these approaches require more work, // they give you more control on the types of the mock function // arguments and the action parameters, which in general leads to // better compiler error messages that pay off in the long run. They // also allow overloading actions based on parameter types (as opposed // to just based on the number of parameters). // // CAVEAT: // // ACTION*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using ACTION*() inside // a function. // // MORE INFORMATION: // // To learn more about using these macros, please search for 'ACTION' // on http://code.google.com/p/googlemock/wiki/CookBook. $range i 0..n $range k 0..n-1 // An internal macro needed for implementing ACTION*(). #define GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_\ const args_type& args GTEST_ATTRIBUTE_UNUSED_ $for k [[,\ arg$k[[]]_type arg$k GTEST_ATTRIBUTE_UNUSED_]] // Sometimes you want to give an action explicit template parameters // that cannot be inferred from its value parameters. ACTION() and // ACTION_P*() don't support that. ACTION_TEMPLATE() remedies that // and can be viewed as an extension to ACTION() and ACTION_P*(). // // The syntax: // // ACTION_TEMPLATE(ActionName, // HAS_m_TEMPLATE_PARAMS(kind1, name1, ..., kind_m, name_m), // AND_n_VALUE_PARAMS(p1, ..., p_n)) { statements; } // // defines an action template that takes m explicit template // parameters and n value parameters. name_i is the name of the i-th // template parameter, and kind_i specifies whether it's a typename, // an integral constant, or a template. p_i is the name of the i-th // value parameter. // // Example: // // // DuplicateArg(output) converts the k-th argument of the mock // // function to type T and copies it to *output. // ACTION_TEMPLATE(DuplicateArg, // HAS_2_TEMPLATE_PARAMS(int, k, typename, T), // AND_1_VALUE_PARAMS(output)) { // *output = T(std::tr1::get(args)); // } // ... // int n; // EXPECT_CALL(mock, Foo(_, _)) // .WillOnce(DuplicateArg<1, unsigned char>(&n)); // // To create an instance of an action template, write: // // ActionName(v1, ..., v_n) // // where the ts are the template arguments and the vs are the value // arguments. The value argument types are inferred by the compiler. // If you want to explicitly specify the value argument types, you can // provide additional template arguments: // // ActionName(v1, ..., v_n) // // where u_i is the desired type of v_i. // // ACTION_TEMPLATE and ACTION/ACTION_P* can be overloaded on the // number of value parameters, but not on the number of template // parameters. Without the restriction, the meaning of the following // is unclear: // // OverloadedAction(x); // // Are we using a single-template-parameter action where 'bool' refers // to the type of x, or are we using a two-template-parameter action // where the compiler is asked to infer the type of x? // // Implementation notes: // // GMOCK_INTERNAL_*_HAS_m_TEMPLATE_PARAMS and // GMOCK_INTERNAL_*_AND_n_VALUE_PARAMS are internal macros for // implementing ACTION_TEMPLATE. The main trick we use is to create // new macro invocations when expanding a macro. For example, we have // // #define ACTION_TEMPLATE(name, template_params, value_params) // ... GMOCK_INTERNAL_DECL_##template_params ... // // which causes ACTION_TEMPLATE(..., HAS_1_TEMPLATE_PARAMS(typename, T), ...) // to expand to // // ... GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(typename, T) ... // // Since GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS is a macro, the // preprocessor will continue to expand it to // // ... typename T ... // // This technique conforms to the C++ standard and is portable. It // allows us to implement action templates using O(N) code, where N is // the maximum number of template/value parameters supported. Without // using it, we'd have to devote O(N^2) amount of code to implement all // combinations of m and n. // Declares the template parameters. $range j 1..n $for j [[ $range m 0..j-1 #define GMOCK_INTERNAL_DECL_HAS_$j[[]] _TEMPLATE_PARAMS($for m, [[kind$m, name$m]]) $for m, [[kind$m name$m]] ]] // Lists the template parameters. $for j [[ $range m 0..j-1 #define GMOCK_INTERNAL_LIST_HAS_$j[[]] _TEMPLATE_PARAMS($for m, [[kind$m, name$m]]) $for m, [[name$m]] ]] // Declares the types of value parameters. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_DECL_TYPE_AND_$i[[]] _VALUE_PARAMS($for j, [[p$j]]) $for j [[, typename p$j##_type]] ]] // Initializes the value parameters. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_INIT_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]])\ ($for j, [[p$j##_type gmock_p$j]])$if i>0 [[ : ]]$for j, [[p$j(gmock_p$j)]] ]] // Declares the fields for storing the value parameters. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_DEFN_AND_$i[[]] _VALUE_PARAMS($for j, [[p$j]]) $for j [[p$j##_type p$j; ]] ]] // Lists the value parameters. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_LIST_AND_$i[[]] _VALUE_PARAMS($for j, [[p$j]]) $for j, [[p$j]] ]] // Lists the value parameter types. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_LIST_TYPE_AND_$i[[]] _VALUE_PARAMS($for j, [[p$j]]) $for j [[, p$j##_type]] ]] // Declares the value parameters. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_DECL_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]]) [[]] $for j, [[p$j##_type p$j]] ]] // The suffix of the class template implementing the action template. $for i [[ $range j 0..i-1 #define GMOCK_INTERNAL_COUNT_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]]) [[]] $if i==1 [[P]] $elif i>=2 [[P$i]] ]] // The name of the class template implementing the action template. #define GMOCK_ACTION_CLASS_(name, value_params)\ GTEST_CONCAT_TOKEN_(name##Action, GMOCK_INTERNAL_COUNT_##value_params) $range k 0..n-1 #define ACTION_TEMPLATE(name, template_params, value_params)\ template \ class GMOCK_ACTION_CLASS_(name, value_params) {\ public:\ GMOCK_ACTION_CLASS_(name, value_params)\ GMOCK_INTERNAL_INIT_##value_params {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ explicit gmock_Impl GMOCK_INTERNAL_INIT_##value_params {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template <$for k, [[typename arg$k[[]]_type]]>\ return_type gmock_PerformImpl(const args_type& args[[]] $for k [[, arg$k[[]]_type arg$k]]) const;\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(\ new gmock_Impl(GMOCK_INTERNAL_LIST_##value_params));\ }\ GMOCK_INTERNAL_DEFN_##value_params\ private:\ GTEST_DISALLOW_ASSIGN_(GMOCK_ACTION_CLASS_(name, value_params));\ };\ template \ inline GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params> name(\ GMOCK_INTERNAL_DECL_##value_params) {\ return GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>(\ GMOCK_INTERNAL_LIST_##value_params);\ }\ template \ template \ template \ typename ::testing::internal::Function::Result\ GMOCK_ACTION_CLASS_(name, value_params)<\ GMOCK_INTERNAL_LIST_##template_params\ GMOCK_INTERNAL_LIST_TYPE_##value_params>::gmock_Impl::\ gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const $for i [[ $var template = [[$if i==0 [[]] $else [[ $range j 0..i-1 template <$for j, [[typename p$j##_type]]>\ ]]]] $var class_name = [[name##Action[[$if i==0 [[]] $elif i==1 [[P]] $else [[P$i]]]]]] $range j 0..i-1 $var ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]] $var param_types_and_names = [[$for j, [[p$j##_type p$j]]]] $var inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(gmock_p$j)]]]]]] $var param_field_decls = [[$for j [[ p$j##_type p$j;\ ]]]] $var param_field_decls2 = [[$for j [[ p$j##_type p$j;\ ]]]] $var params = [[$for j, [[p$j]]]] $var param_types = [[$if i==0 [[]] $else [[<$for j, [[p$j##_type]]>]]]] $var typename_arg_types = [[$for k, [[typename arg$k[[]]_type]]]] $var arg_types_and_names = [[$for k, [[arg$k[[]]_type arg$k]]]] $var macro_name = [[$if i==0 [[ACTION]] $elif i==1 [[ACTION_P]] $else [[ACTION_P$i]]]] #define $macro_name(name$for j [[, p$j]])\$template class $class_name {\ public:\ $class_name($ctor_param_list)$inits {}\ template \ class gmock_Impl : public ::testing::ActionInterface {\ public:\ typedef F function_type;\ typedef typename ::testing::internal::Function::Result return_type;\ typedef typename ::testing::internal::Function::ArgumentTuple\ args_type;\ [[$if i==1 [[explicit ]]]]gmock_Impl($ctor_param_list)$inits {}\ virtual return_type Perform(const args_type& args) {\ return ::testing::internal::ActionHelper::\ Perform(this, args);\ }\ template <$typename_arg_types>\ return_type gmock_PerformImpl(const args_type& args, [[]] $arg_types_and_names) const;\$param_field_decls private:\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template operator ::testing::Action() const {\ return ::testing::Action(new gmock_Impl($params));\ }\$param_field_decls2 private:\ GTEST_DISALLOW_ASSIGN_($class_name);\ };\$template inline $class_name$param_types name($param_types_and_names) {\ return $class_name$param_types($params);\ }\$template template \ template <$typename_arg_types>\ typename ::testing::internal::Function::Result\ $class_name$param_types::gmock_Impl::gmock_PerformImpl(\ GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const ]] $$ } // This meta comment fixes auto-indentation in Emacs. It won't $$ // show up in the generated code. // TODO(wan@google.com): move the following to a different .h file // such that we don't have to run 'pump' every time the code is // updated. namespace testing { // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Various overloads for InvokeArgument(). // // The InvokeArgument(a1, a2, ..., a_k) action invokes the N-th // (0-based) argument, which must be a k-ary callable, of the mock // function, with arguments a1, a2, ..., a_k. // // Notes: // // 1. The arguments are passed by value by default. If you need to // pass an argument by reference, wrap it inside ByRef(). For // example, // // InvokeArgument<1>(5, string("Hello"), ByRef(foo)) // // passes 5 and string("Hello") by value, and passes foo by // reference. // // 2. If the callable takes an argument by reference but ByRef() is // not used, it will receive the reference to a copy of the value, // instead of the original value. For example, when the 0-th // argument of the mock function takes a const string&, the action // // InvokeArgument<0>(string("Hello")) // // makes a copy of the temporary string("Hello") object and passes a // reference of the copy, instead of the original temporary object, // to the callable. This makes it easy for a user to define an // InvokeArgument action from temporary values and have it performed // later. $range i 0..n $for i [[ $range j 0..i-1 ACTION_TEMPLATE(InvokeArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]])) { return internal::CallableHelper::Call( ::std::tr1::get(args)$for j [[, p$j]]); } ]] // Various overloads for ReturnNew(). // // The ReturnNew(a1, a2, ..., a_k) action returns a pointer to a new // instance of type T, constructed on the heap with constructor arguments // a1, a2, ..., and a_k. The caller assumes ownership of the returned value. $range i 0..n $for i [[ $range j 0..i-1 $var ps = [[$for j, [[p$j]]]] ACTION_TEMPLATE(ReturnNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_$i[[]]_VALUE_PARAMS($ps)) { return new T($ps); } ]] #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-function-mockers.h0000600000175000017500000011772211561126632030640 0ustar synergysynergy// This file was GENERATED by command: // pump.py gmock-generated-function-mockers.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements function mockers of various arities. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ #include "gmock/gmock-spec-builders.h" #include "gmock/internal/gmock-internal-utils.h" namespace testing { namespace internal { template class FunctionMockerBase; // Note: class FunctionMocker really belongs to the ::testing // namespace. However if we define it in ::testing, MSVC will // complain when classes in ::testing::internal declare it as a // friend class template. To workaround this compiler bug, we define // FunctionMocker in ::testing::internal and import it into ::testing. template class FunctionMocker; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With() { return this->current_spec(); } R Invoke() { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple()); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1)); return this->current_spec(); } R Invoke(A1 a1) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2)); return this->current_spec(); } R Invoke(A1 a1, A2 a2) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8, A9); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8, const Matcher& m9) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8, m9)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } }; template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With(const Matcher& m1, const Matcher& m2, const Matcher& m3, const Matcher& m4, const Matcher& m5, const Matcher& m6, const Matcher& m7, const Matcher& m8, const Matcher& m9, const Matcher& m10) { this->current_spec().SetMatchers(::std::tr1::make_tuple(m1, m2, m3, m4, m5, m6, m7, m8, m9, m10)); return this->current_spec(); } R Invoke(A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9, A10 a10) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10)); } }; } // namespace internal // The style guide prohibits "using" statements in a namespace scope // inside a header file. However, the FunctionMocker class template // is meant to be defined in the ::testing namespace. The following // line is just a trick for working around a bug in MSVC 8.0, which // cannot handle it if we define FunctionMocker in ::testing. using internal::FunctionMocker; // The result type of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_RESULT_(tn, F) tn ::testing::internal::Function::Result // The type of argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_ARG_(tn, F, N) tn ::testing::internal::Function::Argument##N // The matcher type for argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MATCHER_(tn, F, N) const ::testing::Matcher& // The variable for mocking the given method. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MOCKER_(arity, constness, Method) \ GTEST_CONCAT_TOKEN_(gmock##constness##arity##_##Method##_, __LINE__) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD0_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method() constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 0, \ this_method_does_not_take_0_arguments); \ GMOCK_MOCKER_(0, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(0, constness, Method).Invoke(); \ } \ ::testing::MockSpec& \ gmock_##Method() constness { \ GMOCK_MOCKER_(0, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(0, constness, Method).With(); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(0, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD1_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 1, \ this_method_does_not_take_1_argument); \ GMOCK_MOCKER_(1, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(1, constness, Method).Invoke(gmock_a1); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1) constness { \ GMOCK_MOCKER_(1, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(1, constness, Method).With(gmock_a1); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(1, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD2_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 2, \ this_method_does_not_take_2_arguments); \ GMOCK_MOCKER_(2, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(2, constness, Method).Invoke(gmock_a1, gmock_a2); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2) constness { \ GMOCK_MOCKER_(2, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(2, constness, Method).With(gmock_a1, gmock_a2); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(2, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD3_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 3, \ this_method_does_not_take_3_arguments); \ GMOCK_MOCKER_(3, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(3, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3) constness { \ GMOCK_MOCKER_(3, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(3, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(3, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD4_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 4, \ this_method_does_not_take_4_arguments); \ GMOCK_MOCKER_(4, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(4, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4) constness { \ GMOCK_MOCKER_(4, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(4, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(4, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD5_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 5, \ this_method_does_not_take_5_arguments); \ GMOCK_MOCKER_(5, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(5, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5) constness { \ GMOCK_MOCKER_(5, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(5, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(5, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD6_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 6, \ this_method_does_not_take_6_arguments); \ GMOCK_MOCKER_(6, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(6, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6) constness { \ GMOCK_MOCKER_(6, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(6, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(6, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD7_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 7, \ this_method_does_not_take_7_arguments); \ GMOCK_MOCKER_(7, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(7, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7) constness { \ GMOCK_MOCKER_(7, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(7, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(7, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD8_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 8, \ this_method_does_not_take_8_arguments); \ GMOCK_MOCKER_(8, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(8, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8) constness { \ GMOCK_MOCKER_(8, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(8, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(8, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD9_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8, \ GMOCK_ARG_(tn, F, 9) gmock_a9) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 9, \ this_method_does_not_take_9_arguments); \ GMOCK_MOCKER_(9, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(9, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, \ gmock_a9); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8, \ GMOCK_MATCHER_(tn, F, 9) gmock_a9) constness { \ GMOCK_MOCKER_(9, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(9, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, \ gmock_a9); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(9, constness, Method) // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD10_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method(GMOCK_ARG_(tn, F, 1) gmock_a1, \ GMOCK_ARG_(tn, F, 2) gmock_a2, \ GMOCK_ARG_(tn, F, 3) gmock_a3, \ GMOCK_ARG_(tn, F, 4) gmock_a4, \ GMOCK_ARG_(tn, F, 5) gmock_a5, \ GMOCK_ARG_(tn, F, 6) gmock_a6, \ GMOCK_ARG_(tn, F, 7) gmock_a7, \ GMOCK_ARG_(tn, F, 8) gmock_a8, \ GMOCK_ARG_(tn, F, 9) gmock_a9, \ GMOCK_ARG_(tn, F, 10) gmock_a10) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == 10, \ this_method_does_not_take_10_arguments); \ GMOCK_MOCKER_(10, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_(10, constness, Method).Invoke(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, gmock_a9, \ gmock_a10); \ } \ ::testing::MockSpec& \ gmock_##Method(GMOCK_MATCHER_(tn, F, 1) gmock_a1, \ GMOCK_MATCHER_(tn, F, 2) gmock_a2, \ GMOCK_MATCHER_(tn, F, 3) gmock_a3, \ GMOCK_MATCHER_(tn, F, 4) gmock_a4, \ GMOCK_MATCHER_(tn, F, 5) gmock_a5, \ GMOCK_MATCHER_(tn, F, 6) gmock_a6, \ GMOCK_MATCHER_(tn, F, 7) gmock_a7, \ GMOCK_MATCHER_(tn, F, 8) gmock_a8, \ GMOCK_MATCHER_(tn, F, 9) gmock_a9, \ GMOCK_MATCHER_(tn, F, 10) gmock_a10) constness { \ GMOCK_MOCKER_(10, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_(10, constness, Method).With(gmock_a1, gmock_a2, \ gmock_a3, gmock_a4, gmock_a5, gmock_a6, gmock_a7, gmock_a8, gmock_a9, \ gmock_a10); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_(10, constness, Method) #define MOCK_METHOD0(m, F) GMOCK_METHOD0_(, , , m, F) #define MOCK_METHOD1(m, F) GMOCK_METHOD1_(, , , m, F) #define MOCK_METHOD2(m, F) GMOCK_METHOD2_(, , , m, F) #define MOCK_METHOD3(m, F) GMOCK_METHOD3_(, , , m, F) #define MOCK_METHOD4(m, F) GMOCK_METHOD4_(, , , m, F) #define MOCK_METHOD5(m, F) GMOCK_METHOD5_(, , , m, F) #define MOCK_METHOD6(m, F) GMOCK_METHOD6_(, , , m, F) #define MOCK_METHOD7(m, F) GMOCK_METHOD7_(, , , m, F) #define MOCK_METHOD8(m, F) GMOCK_METHOD8_(, , , m, F) #define MOCK_METHOD9(m, F) GMOCK_METHOD9_(, , , m, F) #define MOCK_METHOD10(m, F) GMOCK_METHOD10_(, , , m, F) #define MOCK_CONST_METHOD0(m, F) GMOCK_METHOD0_(, const, , m, F) #define MOCK_CONST_METHOD1(m, F) GMOCK_METHOD1_(, const, , m, F) #define MOCK_CONST_METHOD2(m, F) GMOCK_METHOD2_(, const, , m, F) #define MOCK_CONST_METHOD3(m, F) GMOCK_METHOD3_(, const, , m, F) #define MOCK_CONST_METHOD4(m, F) GMOCK_METHOD4_(, const, , m, F) #define MOCK_CONST_METHOD5(m, F) GMOCK_METHOD5_(, const, , m, F) #define MOCK_CONST_METHOD6(m, F) GMOCK_METHOD6_(, const, , m, F) #define MOCK_CONST_METHOD7(m, F) GMOCK_METHOD7_(, const, , m, F) #define MOCK_CONST_METHOD8(m, F) GMOCK_METHOD8_(, const, , m, F) #define MOCK_CONST_METHOD9(m, F) GMOCK_METHOD9_(, const, , m, F) #define MOCK_CONST_METHOD10(m, F) GMOCK_METHOD10_(, const, , m, F) #define MOCK_METHOD0_T(m, F) GMOCK_METHOD0_(typename, , , m, F) #define MOCK_METHOD1_T(m, F) GMOCK_METHOD1_(typename, , , m, F) #define MOCK_METHOD2_T(m, F) GMOCK_METHOD2_(typename, , , m, F) #define MOCK_METHOD3_T(m, F) GMOCK_METHOD3_(typename, , , m, F) #define MOCK_METHOD4_T(m, F) GMOCK_METHOD4_(typename, , , m, F) #define MOCK_METHOD5_T(m, F) GMOCK_METHOD5_(typename, , , m, F) #define MOCK_METHOD6_T(m, F) GMOCK_METHOD6_(typename, , , m, F) #define MOCK_METHOD7_T(m, F) GMOCK_METHOD7_(typename, , , m, F) #define MOCK_METHOD8_T(m, F) GMOCK_METHOD8_(typename, , , m, F) #define MOCK_METHOD9_T(m, F) GMOCK_METHOD9_(typename, , , m, F) #define MOCK_METHOD10_T(m, F) GMOCK_METHOD10_(typename, , , m, F) #define MOCK_CONST_METHOD0_T(m, F) GMOCK_METHOD0_(typename, const, , m, F) #define MOCK_CONST_METHOD1_T(m, F) GMOCK_METHOD1_(typename, const, , m, F) #define MOCK_CONST_METHOD2_T(m, F) GMOCK_METHOD2_(typename, const, , m, F) #define MOCK_CONST_METHOD3_T(m, F) GMOCK_METHOD3_(typename, const, , m, F) #define MOCK_CONST_METHOD4_T(m, F) GMOCK_METHOD4_(typename, const, , m, F) #define MOCK_CONST_METHOD5_T(m, F) GMOCK_METHOD5_(typename, const, , m, F) #define MOCK_CONST_METHOD6_T(m, F) GMOCK_METHOD6_(typename, const, , m, F) #define MOCK_CONST_METHOD7_T(m, F) GMOCK_METHOD7_(typename, const, , m, F) #define MOCK_CONST_METHOD8_T(m, F) GMOCK_METHOD8_(typename, const, , m, F) #define MOCK_CONST_METHOD9_T(m, F) GMOCK_METHOD9_(typename, const, , m, F) #define MOCK_CONST_METHOD10_T(m, F) GMOCK_METHOD10_(typename, const, , m, F) #define MOCK_METHOD0_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD0_(, , ct, m, F) #define MOCK_METHOD1_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD1_(, , ct, m, F) #define MOCK_METHOD2_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD2_(, , ct, m, F) #define MOCK_METHOD3_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD3_(, , ct, m, F) #define MOCK_METHOD4_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD4_(, , ct, m, F) #define MOCK_METHOD5_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD5_(, , ct, m, F) #define MOCK_METHOD6_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD6_(, , ct, m, F) #define MOCK_METHOD7_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD7_(, , ct, m, F) #define MOCK_METHOD8_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD8_(, , ct, m, F) #define MOCK_METHOD9_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD9_(, , ct, m, F) #define MOCK_METHOD10_WITH_CALLTYPE(ct, m, F) GMOCK_METHOD10_(, , ct, m, F) #define MOCK_CONST_METHOD0_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(, const, ct, m, F) #define MOCK_CONST_METHOD1_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(, const, ct, m, F) #define MOCK_CONST_METHOD2_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(, const, ct, m, F) #define MOCK_CONST_METHOD3_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(, const, ct, m, F) #define MOCK_CONST_METHOD4_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(, const, ct, m, F) #define MOCK_CONST_METHOD5_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(, const, ct, m, F) #define MOCK_CONST_METHOD6_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(, const, ct, m, F) #define MOCK_CONST_METHOD7_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(, const, ct, m, F) #define MOCK_CONST_METHOD8_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(, const, ct, m, F) #define MOCK_CONST_METHOD9_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(, const, ct, m, F) #define MOCK_CONST_METHOD10_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(, const, ct, m, F) #define MOCK_METHOD0_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(typename, , ct, m, F) #define MOCK_METHOD1_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(typename, , ct, m, F) #define MOCK_METHOD2_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(typename, , ct, m, F) #define MOCK_METHOD3_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(typename, , ct, m, F) #define MOCK_METHOD4_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(typename, , ct, m, F) #define MOCK_METHOD5_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(typename, , ct, m, F) #define MOCK_METHOD6_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(typename, , ct, m, F) #define MOCK_METHOD7_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(typename, , ct, m, F) #define MOCK_METHOD8_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(typename, , ct, m, F) #define MOCK_METHOD9_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(typename, , ct, m, F) #define MOCK_METHOD10_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(typename, , ct, m, F) #define MOCK_CONST_METHOD0_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD0_(typename, const, ct, m, F) #define MOCK_CONST_METHOD1_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD1_(typename, const, ct, m, F) #define MOCK_CONST_METHOD2_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD2_(typename, const, ct, m, F) #define MOCK_CONST_METHOD3_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD3_(typename, const, ct, m, F) #define MOCK_CONST_METHOD4_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD4_(typename, const, ct, m, F) #define MOCK_CONST_METHOD5_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD5_(typename, const, ct, m, F) #define MOCK_CONST_METHOD6_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD6_(typename, const, ct, m, F) #define MOCK_CONST_METHOD7_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD7_(typename, const, ct, m, F) #define MOCK_CONST_METHOD8_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD8_(typename, const, ct, m, F) #define MOCK_CONST_METHOD9_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD9_(typename, const, ct, m, F) #define MOCK_CONST_METHOD10_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD10_(typename, const, ct, m, F) // A MockFunction class has one mock method whose type is F. It is // useful when you just want your test code to emit some messages and // have Google Mock verify the right messages are sent (and perhaps at // the right times). For example, if you are exercising code: // // Foo(1); // Foo(2); // Foo(3); // // and want to verify that Foo(1) and Foo(3) both invoke // mock.Bar("a"), but Foo(2) doesn't invoke anything, you can write: // // TEST(FooTest, InvokesBarCorrectly) { // MyMock mock; // MockFunction check; // { // InSequence s; // // EXPECT_CALL(mock, Bar("a")); // EXPECT_CALL(check, Call("1")); // EXPECT_CALL(check, Call("2")); // EXPECT_CALL(mock, Bar("a")); // } // Foo(1); // check.Call("1"); // Foo(2); // check.Call("2"); // Foo(3); // } // // The expectation spec says that the first Bar("a") must happen // before check point "1", the second Bar("a") must happen after check // point "2", and nothing should happen between the two check // points. The explicit check points make it easy to tell which // Bar("a") is called by which call to Foo(). template class MockFunction; template class MockFunction { public: MockFunction() {} MOCK_METHOD0_T(Call, R()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD1_T(Call, R(A0)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD2_T(Call, R(A0, A1)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD3_T(Call, R(A0, A1, A2)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD4_T(Call, R(A0, A1, A2, A3)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD5_T(Call, R(A0, A1, A2, A3, A4)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD6_T(Call, R(A0, A1, A2, A3, A4, A5)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD7_T(Call, R(A0, A1, A2, A3, A4, A5, A6)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD8_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD9_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7, A8)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; template class MockFunction { public: MockFunction() {} MOCK_METHOD10_T(Call, R(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-function-mockers.h.pump0000600000175000017500000001771611561126632031622 0ustar synergysynergy$$ -*- mode: c++; -*- $$ This is a Pump source file. Please use Pump to convert it to $$ gmock-generated-function-mockers.h. $$ $var n = 10 $$ The maximum arity we support. // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements function mockers of various arities. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ #include "gmock/gmock-spec-builders.h" #include "gmock/internal/gmock-internal-utils.h" namespace testing { namespace internal { template class FunctionMockerBase; // Note: class FunctionMocker really belongs to the ::testing // namespace. However if we define it in ::testing, MSVC will // complain when classes in ::testing::internal declare it as a // friend class template. To workaround this compiler bug, we define // FunctionMocker in ::testing::internal and import it into ::testing. template class FunctionMocker; $range i 0..n $for i [[ $range j 1..i $var typename_As = [[$for j [[, typename A$j]]]] $var As = [[$for j, [[A$j]]]] $var as = [[$for j, [[a$j]]]] $var Aas = [[$for j, [[A$j a$j]]]] $var ms = [[$for j, [[m$j]]]] $var matchers = [[$for j, [[const Matcher& m$j]]]] template class FunctionMocker : public internal::FunctionMockerBase { public: typedef R F($As); typedef typename internal::Function::ArgumentTuple ArgumentTuple; MockSpec& With($matchers) { $if i >= 1 [[ this->current_spec().SetMatchers(::std::tr1::make_tuple($ms)); ]] return this->current_spec(); } R Invoke($Aas) { // Even though gcc and MSVC don't enforce it, 'this->' is required // by the C++ standard [14.6.4] here, as the base class type is // dependent on the template argument (and thus shouldn't be // looked into when resolving InvokeWith). return this->InvokeWith(ArgumentTuple($as)); } }; ]] } // namespace internal // The style guide prohibits "using" statements in a namespace scope // inside a header file. However, the FunctionMocker class template // is meant to be defined in the ::testing namespace. The following // line is just a trick for working around a bug in MSVC 8.0, which // cannot handle it if we define FunctionMocker in ::testing. using internal::FunctionMocker; // The result type of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_RESULT_(tn, F) tn ::testing::internal::Function::Result // The type of argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_ARG_(tn, F, N) tn ::testing::internal::Function::Argument##N // The matcher type for argument N of function type F. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MATCHER_(tn, F, N) const ::testing::Matcher& // The variable for mocking the given method. // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_MOCKER_(arity, constness, Method) \ GTEST_CONCAT_TOKEN_(gmock##constness##arity##_##Method##_, __LINE__) $for i [[ $range j 1..i $var arg_as = [[$for j, \ [[GMOCK_ARG_(tn, F, $j) gmock_a$j]]]] $var as = [[$for j, [[gmock_a$j]]]] $var matcher_as = [[$for j, \ [[GMOCK_MATCHER_(tn, F, $j) gmock_a$j]]]] // INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!! #define GMOCK_METHOD$i[[]]_(tn, constness, ct, Method, F) \ GMOCK_RESULT_(tn, F) ct Method($arg_as) constness { \ GTEST_COMPILE_ASSERT_(::std::tr1::tuple_size< \ tn ::testing::internal::Function::ArgumentTuple>::value == $i, \ this_method_does_not_take_$i[[]]_argument[[$if i != 1 [[s]]]]); \ GMOCK_MOCKER_($i, constness, Method).SetOwnerAndName(this, #Method); \ return GMOCK_MOCKER_($i, constness, Method).Invoke($as); \ } \ ::testing::MockSpec& \ gmock_##Method($matcher_as) constness { \ GMOCK_MOCKER_($i, constness, Method).RegisterOwner(this); \ return GMOCK_MOCKER_($i, constness, Method).With($as); \ } \ mutable ::testing::FunctionMocker GMOCK_MOCKER_($i, constness, Method) ]] $for i [[ #define MOCK_METHOD$i(m, F) GMOCK_METHOD$i[[]]_(, , , m, F) ]] $for i [[ #define MOCK_CONST_METHOD$i(m, F) GMOCK_METHOD$i[[]]_(, const, , m, F) ]] $for i [[ #define MOCK_METHOD$i[[]]_T(m, F) GMOCK_METHOD$i[[]]_(typename, , , m, F) ]] $for i [[ #define MOCK_CONST_METHOD$i[[]]_T(m, F) [[]] GMOCK_METHOD$i[[]]_(typename, const, , m, F) ]] $for i [[ #define MOCK_METHOD$i[[]]_WITH_CALLTYPE(ct, m, F) [[]] GMOCK_METHOD$i[[]]_(, , ct, m, F) ]] $for i [[ #define MOCK_CONST_METHOD$i[[]]_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD$i[[]]_(, const, ct, m, F) ]] $for i [[ #define MOCK_METHOD$i[[]]_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD$i[[]]_(typename, , ct, m, F) ]] $for i [[ #define MOCK_CONST_METHOD$i[[]]_T_WITH_CALLTYPE(ct, m, F) \ GMOCK_METHOD$i[[]]_(typename, const, ct, m, F) ]] // A MockFunction class has one mock method whose type is F. It is // useful when you just want your test code to emit some messages and // have Google Mock verify the right messages are sent (and perhaps at // the right times). For example, if you are exercising code: // // Foo(1); // Foo(2); // Foo(3); // // and want to verify that Foo(1) and Foo(3) both invoke // mock.Bar("a"), but Foo(2) doesn't invoke anything, you can write: // // TEST(FooTest, InvokesBarCorrectly) { // MyMock mock; // MockFunction check; // { // InSequence s; // // EXPECT_CALL(mock, Bar("a")); // EXPECT_CALL(check, Call("1")); // EXPECT_CALL(check, Call("2")); // EXPECT_CALL(mock, Bar("a")); // } // Foo(1); // check.Call("1"); // Foo(2); // check.Call("2"); // Foo(3); // } // // The expectation spec says that the first Bar("a") must happen // before check point "1", the second Bar("a") must happen after check // point "2", and nothing should happen between the two check // points. The explicit check points make it easy to tell which // Bar("a") is called by which call to Foo(). template class MockFunction; $for i [[ $range j 0..i-1 template class MockFunction { public: MockFunction() {} MOCK_METHOD$i[[]]_T(Call, R($for j, [[A$j]])); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction); }; ]] } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-matchers.h0000600000175000017500000023510511561126632027154 0ustar synergysynergy// This file was GENERATED by command: // pump.py gmock-generated-matchers.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic matchers. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #include #include #include #include "gmock/gmock-matchers.h" namespace testing { namespace internal { // The type of the i-th (0-based) field of Tuple. #define GMOCK_FIELD_TYPE_(Tuple, i) \ typename ::std::tr1::tuple_element::type // TupleFields is for selecting fields from a // tuple of type Tuple. It has two members: // // type: a tuple type whose i-th field is the ki-th field of Tuple. // GetSelectedFields(t): returns fields k0, ..., and kn of t as a tuple. // // For example, in class TupleFields, 2, 0>, we have: // // type is tuple, and // GetSelectedFields(make_tuple(true, 'a', 42)) is (42, true). template class TupleFields; // This generic version is used when there are 10 selectors. template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; // The following specialization is used for 0 ~ 9 selectors. template class TupleFields { public: typedef ::std::tr1::tuple<> type; static type GetSelectedFields(const Tuple& /* t */) { using ::std::tr1::get; return type(); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; template class TupleFields { public: typedef ::std::tr1::tuple type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type(get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t), get(t)); } }; #undef GMOCK_FIELD_TYPE_ // Implements the Args() matcher. template class ArgsMatcherImpl : public MatcherInterface { public: // ArgsTuple may have top-level const or reference modifiers. typedef GTEST_REMOVE_REFERENCE_AND_CONST_(ArgsTuple) RawArgsTuple; typedef typename internal::TupleFields::type SelectedArgs; typedef Matcher MonomorphicInnerMatcher; template explicit ArgsMatcherImpl(const InnerMatcher& inner_matcher) : inner_matcher_(SafeMatcherCast(inner_matcher)) {} virtual bool MatchAndExplain(ArgsTuple args, MatchResultListener* listener) const { const SelectedArgs& selected_args = GetSelectedArgs(args); if (!listener->IsInterested()) return inner_matcher_.Matches(selected_args); PrintIndices(listener->stream()); *listener << "are " << PrintToString(selected_args); StringMatchResultListener inner_listener; const bool match = inner_matcher_.MatchAndExplain(selected_args, &inner_listener); PrintIfNotEmpty(inner_listener.str(), listener->stream()); return match; } virtual void DescribeTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeNegationTo(os); } private: static SelectedArgs GetSelectedArgs(ArgsTuple args) { return TupleFields::GetSelectedFields(args); } // Prints the indices of the selected fields. static void PrintIndices(::std::ostream* os) { *os << "whose fields ("; const int indices[10] = { k0, k1, k2, k3, k4, k5, k6, k7, k8, k9 }; for (int i = 0; i < 10; i++) { if (indices[i] < 0) break; if (i >= 1) *os << ", "; *os << "#" << indices[i]; } *os << ") "; } const MonomorphicInnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcherImpl); }; template class ArgsMatcher { public: explicit ArgsMatcher(const InnerMatcher& inner_matcher) : inner_matcher_(inner_matcher) {} template operator Matcher() const { return MakeMatcher(new ArgsMatcherImpl(inner_matcher_)); } private: const InnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcher); }; // Implements ElementsAre() of 1-10 arguments. template class ElementsAreMatcher1 { public: explicit ElementsAreMatcher1(const T1& e1) : e1_(e1) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; // Nokia's Symbian Compiler has a nasty bug where the object put // in a one-element local array is not destructed when the array // goes out of scope. This leads to obvious badness as we've // added the linked_ptr in it to our other linked_ptrs list. // Hence we implement ElementsAreMatcher1 specially to avoid using // a local array. const Matcher matcher = MatcherCast(e1_); return MakeMatcher(new ElementsAreMatcherImpl(&matcher, 1)); } private: const T1& e1_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher1); }; template class ElementsAreMatcher2 { public: ElementsAreMatcher2(const T1& e1, const T2& e2) : e1_(e1), e2_(e2) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 2)); } private: const T1& e1_; const T2& e2_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher2); }; template class ElementsAreMatcher3 { public: ElementsAreMatcher3(const T1& e1, const T2& e2, const T3& e3) : e1_(e1), e2_(e2), e3_(e3) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 3)); } private: const T1& e1_; const T2& e2_; const T3& e3_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher3); }; template class ElementsAreMatcher4 { public: ElementsAreMatcher4(const T1& e1, const T2& e2, const T3& e3, const T4& e4) : e1_(e1), e2_(e2), e3_(e3), e4_(e4) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 4)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher4); }; template class ElementsAreMatcher5 { public: ElementsAreMatcher5(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 5)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher5); }; template class ElementsAreMatcher6 { public: ElementsAreMatcher6(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 6)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher6); }; template class ElementsAreMatcher7 { public: ElementsAreMatcher7(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 7)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher7); }; template class ElementsAreMatcher8 { public: ElementsAreMatcher8(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 8)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher8); }; template class ElementsAreMatcher9 { public: ElementsAreMatcher9(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8), e9_(e9) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), MatcherCast(e9_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 9)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; const T9& e9_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher9); }; template class ElementsAreMatcher10 { public: ElementsAreMatcher10(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9, const T10& e10) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8), e9_(e9), e10_(e10) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher matchers[] = { MatcherCast(e1_), MatcherCast(e2_), MatcherCast(e3_), MatcherCast(e4_), MatcherCast(e5_), MatcherCast(e6_), MatcherCast(e7_), MatcherCast(e8_), MatcherCast(e9_), MatcherCast(e10_), }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 10)); } private: const T1& e1_; const T2& e2_; const T3& e3_; const T4& e4_; const T5& e5_; const T6& e6_; const T7& e7_; const T8& e8_; const T9& e9_; const T10& e10_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher10); }; } // namespace internal // Args(a_matcher) matches a tuple if the selected // fields of it matches a_matcher. C++ doesn't support default // arguments for function templates, so we have to overload it. template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } template inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } // ElementsAre(e0, e1, ..., e_n) matches an STL-style container with // (n + 1) elements, where the i-th element in the container must // match the i-th argument in the list. Each argument of // ElementsAre() can be either a value or a matcher. We support up to // 10 arguments. // // NOTE: Since ElementsAre() cares about the order of the elements, it // must not be used with containers whose elements's order is // undefined (e.g. hash_map). inline internal::ElementsAreMatcher0 ElementsAre() { return internal::ElementsAreMatcher0(); } template inline internal::ElementsAreMatcher1 ElementsAre(const T1& e1) { return internal::ElementsAreMatcher1(e1); } template inline internal::ElementsAreMatcher2 ElementsAre(const T1& e1, const T2& e2) { return internal::ElementsAreMatcher2(e1, e2); } template inline internal::ElementsAreMatcher3 ElementsAre(const T1& e1, const T2& e2, const T3& e3) { return internal::ElementsAreMatcher3(e1, e2, e3); } template inline internal::ElementsAreMatcher4 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4) { return internal::ElementsAreMatcher4(e1, e2, e3, e4); } template inline internal::ElementsAreMatcher5 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5) { return internal::ElementsAreMatcher5(e1, e2, e3, e4, e5); } template inline internal::ElementsAreMatcher6 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6) { return internal::ElementsAreMatcher6(e1, e2, e3, e4, e5, e6); } template inline internal::ElementsAreMatcher7 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7) { return internal::ElementsAreMatcher7(e1, e2, e3, e4, e5, e6, e7); } template inline internal::ElementsAreMatcher8 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8) { return internal::ElementsAreMatcher8(e1, e2, e3, e4, e5, e6, e7, e8); } template inline internal::ElementsAreMatcher9 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) { return internal::ElementsAreMatcher9(e1, e2, e3, e4, e5, e6, e7, e8, e9); } template inline internal::ElementsAreMatcher10 ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4, const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9, const T10& e10) { return internal::ElementsAreMatcher10(e1, e2, e3, e4, e5, e6, e7, e8, e9, e10); } // ElementsAreArray(array) and ElementAreArray(array, count) are like // ElementsAre(), except that they take an array of values or // matchers. The former form infers the size of 'array', which must // be a static C-style array. In the latter form, 'array' can either // be a static array or a pointer to a dynamically created array. template inline internal::ElementsAreArrayMatcher ElementsAreArray( const T* first, size_t count) { return internal::ElementsAreArrayMatcher(first, count); } template inline internal::ElementsAreArrayMatcher ElementsAreArray(const T (&array)[N]) { return internal::ElementsAreArrayMatcher(array, N); } // AllOf(m1, m2, ..., mk) matches any value that matches all of the given // sub-matchers. AllOf is called fully qualified to prevent ADL from firing. template inline internal::BothOfMatcher AllOf(Matcher1 m1, Matcher2 m2) { return internal::BothOfMatcher(m1, m2); } template inline internal::BothOfMatcher > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3)); } template inline internal::BothOfMatcher > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4)); } template inline internal::BothOfMatcher > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5)); } template inline internal::BothOfMatcher > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6)); } template inline internal::BothOfMatcher > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7)); } template inline internal::BothOfMatcher > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8)); } template inline internal::BothOfMatcher > > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8, m9)); } template inline internal::BothOfMatcher > > > > > > > > AllOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9, Matcher10 m10) { return ::testing::AllOf(m1, ::testing::AllOf(m2, m3, m4, m5, m6, m7, m8, m9, m10)); } // AnyOf(m1, m2, ..., mk) matches any value that matches any of the given // sub-matchers. AnyOf is called fully qualified to prevent ADL from firing. template inline internal::EitherOfMatcher AnyOf(Matcher1 m1, Matcher2 m2) { return internal::EitherOfMatcher(m1, m2); } template inline internal::EitherOfMatcher > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3)); } template inline internal::EitherOfMatcher > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4)); } template inline internal::EitherOfMatcher > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5)); } template inline internal::EitherOfMatcher > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6)); } template inline internal::EitherOfMatcher > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7)); } template inline internal::EitherOfMatcher > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8)); } template inline internal::EitherOfMatcher > > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8, m9)); } template inline internal::EitherOfMatcher > > > > > > > > AnyOf(Matcher1 m1, Matcher2 m2, Matcher3 m3, Matcher4 m4, Matcher5 m5, Matcher6 m6, Matcher7 m7, Matcher8 m8, Matcher9 m9, Matcher10 m10) { return ::testing::AnyOf(m1, ::testing::AnyOf(m2, m3, m4, m5, m6, m7, m8, m9, m10)); } } // namespace testing // The MATCHER* family of macros can be used in a namespace scope to // define custom matchers easily. // // Basic Usage // =========== // // The syntax // // MATCHER(name, description_string) { statements; } // // defines a matcher with the given name that executes the statements, // which must return a bool to indicate if the match succeeds. Inside // the statements, you can refer to the value being matched by 'arg', // and refer to its type by 'arg_type'. // // The description string documents what the matcher does, and is used // to generate the failure message when the match fails. Since a // MATCHER() is usually defined in a header file shared by multiple // C++ source files, we require the description to be a C-string // literal to avoid possible side effects. It can be empty, in which // case we'll use the sequence of words in the matcher name as the // description. // // For example: // // MATCHER(IsEven, "") { return (arg % 2) == 0; } // // allows you to write // // // Expects mock_foo.Bar(n) to be called where n is even. // EXPECT_CALL(mock_foo, Bar(IsEven())); // // or, // // // Verifies that the value of some_expression is even. // EXPECT_THAT(some_expression, IsEven()); // // If the above assertion fails, it will print something like: // // Value of: some_expression // Expected: is even // Actual: 7 // // where the description "is even" is automatically calculated from the // matcher name IsEven. // // Argument Type // ============= // // Note that the type of the value being matched (arg_type) is // determined by the context in which you use the matcher and is // supplied to you by the compiler, so you don't need to worry about // declaring it (nor can you). This allows the matcher to be // polymorphic. For example, IsEven() can be used to match any type // where the value of "(arg % 2) == 0" can be implicitly converted to // a bool. In the "Bar(IsEven())" example above, if method Bar() // takes an int, 'arg_type' will be int; if it takes an unsigned long, // 'arg_type' will be unsigned long; and so on. // // Parameterizing Matchers // ======================= // // Sometimes you'll want to parameterize the matcher. For that you // can use another macro: // // MATCHER_P(name, param_name, description_string) { statements; } // // For example: // // MATCHER_P(HasAbsoluteValue, value, "") { return abs(arg) == value; } // // will allow you to write: // // EXPECT_THAT(Blah("a"), HasAbsoluteValue(n)); // // which may lead to this message (assuming n is 10): // // Value of: Blah("a") // Expected: has absolute value 10 // Actual: -9 // // Note that both the matcher description and its parameter are // printed, making the message human-friendly. // // In the matcher definition body, you can write 'foo_type' to // reference the type of a parameter named 'foo'. For example, in the // body of MATCHER_P(HasAbsoluteValue, value) above, you can write // 'value_type' to refer to the type of 'value'. // // We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P10 to // support multi-parameter matchers. // // Describing Parameterized Matchers // ================================= // // The last argument to MATCHER*() is a string-typed expression. The // expression can reference all of the matcher's parameters and a // special bool-typed variable named 'negation'. When 'negation' is // false, the expression should evaluate to the matcher's description; // otherwise it should evaluate to the description of the negation of // the matcher. For example, // // using testing::PrintToString; // // MATCHER_P2(InClosedRange, low, hi, // string(negation ? "is not" : "is") + " in range [" + // PrintToString(low) + ", " + PrintToString(hi) + "]") { // return low <= arg && arg <= hi; // } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: is in range [4, 6] // ... // Expected: is not in range [2, 4] // // If you specify "" as the description, the failure message will // contain the sequence of words in the matcher name followed by the // parameter values printed as a tuple. For example, // // MATCHER_P2(InClosedRange, low, hi, "") { ... } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: in closed range (4, 6) // ... // Expected: not (in closed range (2, 4)) // // Types of Matcher Parameters // =========================== // // For the purpose of typing, you can view // // MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... } // // as shorthand for // // template // FooMatcherPk // Foo(p1_type p1, ..., pk_type pk) { ... } // // When you write Foo(v1, ..., vk), the compiler infers the types of // the parameters v1, ..., and vk for you. If you are not happy with // the result of the type inference, you can specify the types by // explicitly instantiating the template, as in Foo(5, // false). As said earlier, you don't get to (or need to) specify // 'arg_type' as that's determined by the context in which the matcher // is used. You can assign the result of expression Foo(p1, ..., pk) // to a variable of type FooMatcherPk. This // can be useful when composing matchers. // // While you can instantiate a matcher template with reference types, // passing the parameters by pointer usually makes your code more // readable. If, however, you still want to pass a parameter by // reference, be aware that in the failure message generated by the // matcher you will see the value of the referenced object but not its // address. // // Explaining Match Results // ======================== // // Sometimes the matcher description alone isn't enough to explain why // the match has failed or succeeded. For example, when expecting a // long string, it can be very helpful to also print the diff between // the expected string and the actual one. To achieve that, you can // optionally stream additional information to a special variable // named result_listener, whose type is a pointer to class // MatchResultListener: // // MATCHER_P(EqualsLongString, str, "") { // if (arg == str) return true; // // *result_listener << "the difference: " /// << DiffStrings(str, arg); // return false; // } // // Overloading Matchers // ==================== // // You can overload matchers with different numbers of parameters: // // MATCHER_P(Blah, a, description_string1) { ... } // MATCHER_P2(Blah, a, b, description_string2) { ... } // // Caveats // ======= // // When defining a new matcher, you should also consider implementing // MatcherInterface or using MakePolymorphicMatcher(). These // approaches require more work than the MATCHER* macros, but also // give you more control on the types of the value being matched and // the matcher parameters, which may leads to better compiler error // messages when the matcher is used wrong. They also allow // overloading matchers based on parameter types (as opposed to just // based on the number of parameters). // // MATCHER*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using MATCHER*() inside // a function. // // More Information // ================ // // To learn more about using these macros, please search for 'MATCHER' // on http://code.google.com/p/googlemock/wiki/CookBook. #define MATCHER(name, description)\ class name##Matcher {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl()\ {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple<>()));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl());\ }\ name##Matcher() {\ }\ private:\ GTEST_DISALLOW_ASSIGN_(name##Matcher);\ };\ inline name##Matcher name() {\ return name##Matcher();\ }\ template \ bool name##Matcher::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P(name, p0, description)\ template \ class name##MatcherP {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ explicit gmock_Impl(p0##_type gmock_p0)\ : p0(gmock_p0) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0));\ }\ name##MatcherP(p0##_type gmock_p0) : p0(gmock_p0) {\ }\ p0##_type p0;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP);\ };\ template \ inline name##MatcherP name(p0##_type p0) {\ return name##MatcherP(p0);\ }\ template \ template \ bool name##MatcherP::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P2(name, p0, p1, description)\ template \ class name##MatcherP2 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1)\ : p0(gmock_p0), p1(gmock_p1) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1));\ }\ name##MatcherP2(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \ p1(gmock_p1) {\ }\ p0##_type p0;\ p1##_type p1;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP2);\ };\ template \ inline name##MatcherP2 name(p0##_type p0, \ p1##_type p1) {\ return name##MatcherP2(p0, p1);\ }\ template \ template \ bool name##MatcherP2::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P3(name, p0, p1, p2, description)\ template \ class name##MatcherP3 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, \ p2)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2));\ }\ name##MatcherP3(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP3);\ };\ template \ inline name##MatcherP3 name(p0##_type p0, \ p1##_type p1, p2##_type p2) {\ return name##MatcherP3(p0, p1, p2);\ }\ template \ template \ bool name##MatcherP3::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P4(name, p0, p1, p2, p3, description)\ template \ class name##MatcherP4 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3));\ }\ name##MatcherP4(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP4);\ };\ template \ inline name##MatcherP4 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3) {\ return name##MatcherP4(p0, \ p1, p2, p3);\ }\ template \ template \ bool name##MatcherP4::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P5(name, p0, p1, p2, p3, p4, description)\ template \ class name##MatcherP5 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4));\ }\ name##MatcherP5(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, \ p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP5);\ };\ template \ inline name##MatcherP5 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4) {\ return name##MatcherP5(p0, p1, p2, p3, p4);\ }\ template \ template \ bool name##MatcherP5::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P6(name, p0, p1, p2, p3, p4, p5, description)\ template \ class name##MatcherP6 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5));\ }\ name##MatcherP6(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP6);\ };\ template \ inline name##MatcherP6 name(p0##_type p0, p1##_type p1, p2##_type p2, \ p3##_type p3, p4##_type p4, p5##_type p5) {\ return name##MatcherP6(p0, p1, p2, p3, p4, p5);\ }\ template \ template \ bool name##MatcherP6::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P7(name, p0, p1, p2, p3, p4, p5, p6, description)\ template \ class name##MatcherP7 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, \ p6)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6));\ }\ name##MatcherP7(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), \ p6(gmock_p6) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP7);\ };\ template \ inline name##MatcherP7 name(p0##_type p0, p1##_type p1, \ p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6) {\ return name##MatcherP7(p0, p1, p2, p3, p4, p5, p6);\ }\ template \ template \ bool name##MatcherP7::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P8(name, p0, p1, p2, p3, p4, p5, p6, p7, description)\ template \ class name##MatcherP8 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, \ p3, p4, p5, p6, p7)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7));\ }\ name##MatcherP8(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, \ p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP8);\ };\ template \ inline name##MatcherP8 name(p0##_type p0, \ p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \ p6##_type p6, p7##_type p7) {\ return name##MatcherP8(p0, p1, p2, p3, p4, p5, \ p6, p7);\ }\ template \ template \ bool name##MatcherP8::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P9(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, description)\ template \ class name##MatcherP9 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, p6, p7, p8)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7, p8));\ }\ name##MatcherP9(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \ p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP9);\ };\ template \ inline name##MatcherP9 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, \ p8##_type p8) {\ return name##MatcherP9(p0, p1, p2, \ p3, p4, p5, p6, p7, p8);\ }\ template \ template \ bool name##MatcherP9::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #define MATCHER_P10(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, description)\ template \ class name##MatcherP10 {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \ p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \ p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \ p9##_type gmock_p9)\ : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), \ p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \ p8(gmock_p8), p9(gmock_p9) {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9)));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9));\ }\ name##MatcherP10(p0##_type gmock_p0, p1##_type gmock_p1, \ p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \ p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \ p8##_type gmock_p8, p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), \ p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \ p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {\ }\ p0##_type p0;\ p1##_type p1;\ p2##_type p2;\ p3##_type p3;\ p4##_type p4;\ p5##_type p5;\ p6##_type p6;\ p7##_type p7;\ p8##_type p8;\ p9##_type p9;\ private:\ GTEST_DISALLOW_ASSIGN_(name##MatcherP10);\ };\ template \ inline name##MatcherP10 name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \ p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \ p9##_type p9) {\ return name##MatcherP10(p0, \ p1, p2, p3, p4, p5, p6, p7, p8, p9);\ }\ template \ template \ bool name##MatcherP10::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-matchers.h.pump0000600000175000017500000005211611561126632030133 0ustar synergysynergy$$ -*- mode: c++; -*- $$ This is a Pump source file. Please use Pump to convert it to $$ gmock-generated-actions.h. $$ $var n = 10 $$ The maximum arity we support. $$ }} This line fixes auto-indentation of the following code in Emacs. // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used variadic matchers. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ #include #include #include #include "gmock/gmock-matchers.h" namespace testing { namespace internal { $range i 0..n-1 // The type of the i-th (0-based) field of Tuple. #define GMOCK_FIELD_TYPE_(Tuple, i) \ typename ::std::tr1::tuple_element::type // TupleFields is for selecting fields from a // tuple of type Tuple. It has two members: // // type: a tuple type whose i-th field is the ki-th field of Tuple. // GetSelectedFields(t): returns fields k0, ..., and kn of t as a tuple. // // For example, in class TupleFields, 2, 0>, we have: // // type is tuple, and // GetSelectedFields(make_tuple(true, 'a', 42)) is (42, true). template class TupleFields; // This generic version is used when there are $n selectors. template class TupleFields { public: typedef ::std::tr1::tuple<$for i, [[GMOCK_FIELD_TYPE_(Tuple, k$i)]]> type; static type GetSelectedFields(const Tuple& t) { using ::std::tr1::get; return type($for i, [[get(t)]]); } }; // The following specialization is used for 0 ~ $(n-1) selectors. $for i [[ $$ }}} $range j 0..i-1 $range k 0..n-1 template class TupleFields { public: typedef ::std::tr1::tuple<$for j, [[GMOCK_FIELD_TYPE_(Tuple, k$j)]]> type; static type GetSelectedFields(const Tuple& $if i==0 [[/* t */]] $else [[t]]) { using ::std::tr1::get; return type($for j, [[get(t)]]); } }; ]] #undef GMOCK_FIELD_TYPE_ // Implements the Args() matcher. $var ks = [[$for i, [[k$i]]]] template class ArgsMatcherImpl : public MatcherInterface { public: // ArgsTuple may have top-level const or reference modifiers. typedef GTEST_REMOVE_REFERENCE_AND_CONST_(ArgsTuple) RawArgsTuple; typedef typename internal::TupleFields::type SelectedArgs; typedef Matcher MonomorphicInnerMatcher; template explicit ArgsMatcherImpl(const InnerMatcher& inner_matcher) : inner_matcher_(SafeMatcherCast(inner_matcher)) {} virtual bool MatchAndExplain(ArgsTuple args, MatchResultListener* listener) const { const SelectedArgs& selected_args = GetSelectedArgs(args); if (!listener->IsInterested()) return inner_matcher_.Matches(selected_args); PrintIndices(listener->stream()); *listener << "are " << PrintToString(selected_args); StringMatchResultListener inner_listener; const bool match = inner_matcher_.MatchAndExplain(selected_args, &inner_listener); PrintIfNotEmpty(inner_listener.str(), listener->stream()); return match; } virtual void DescribeTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "are a tuple "; PrintIndices(os); inner_matcher_.DescribeNegationTo(os); } private: static SelectedArgs GetSelectedArgs(ArgsTuple args) { return TupleFields::GetSelectedFields(args); } // Prints the indices of the selected fields. static void PrintIndices(::std::ostream* os) { *os << "whose fields ("; const int indices[$n] = { $ks }; for (int i = 0; i < $n; i++) { if (indices[i] < 0) break; if (i >= 1) *os << ", "; *os << "#" << indices[i]; } *os << ") "; } const MonomorphicInnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcherImpl); }; template class ArgsMatcher { public: explicit ArgsMatcher(const InnerMatcher& inner_matcher) : inner_matcher_(inner_matcher) {} template operator Matcher() const { return MakeMatcher(new ArgsMatcherImpl(inner_matcher_)); } private: const InnerMatcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(ArgsMatcher); }; // Implements ElementsAre() of 1-$n arguments. $range i 1..n $for i [[ $range j 1..i template <$for j, [[typename T$j]]> class ElementsAreMatcher$i { public: $if i==1 [[explicit ]]ElementsAreMatcher$i($for j, [[const T$j& e$j]])$if i > 0 [[ : ]] $for j, [[e$j[[]]_(e$j)]] {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; $if i==1 [[ // Nokia's Symbian Compiler has a nasty bug where the object put // in a one-element local array is not destructed when the array // goes out of scope. This leads to obvious badness as we've // added the linked_ptr in it to our other linked_ptrs list. // Hence we implement ElementsAreMatcher1 specially to avoid using // a local array. const Matcher matcher = MatcherCast(e1_); return MakeMatcher(new ElementsAreMatcherImpl(&matcher, 1)); ]] $else [[ const Matcher matchers[] = { $for j [[ MatcherCast(e$j[[]]_), ]] }; return MakeMatcher(new ElementsAreMatcherImpl(matchers, $i)); ]] } private: $for j [[ const T$j& e$j[[]]_; ]] GTEST_DISALLOW_ASSIGN_(ElementsAreMatcher$i); }; ]] } // namespace internal // Args(a_matcher) matches a tuple if the selected // fields of it matches a_matcher. C++ doesn't support default // arguments for function templates, so we have to overload it. $range i 0..n $for i [[ $range j 1..i template <$for j [[int k$j, ]]typename InnerMatcher> inline internal::ArgsMatcher Args(const InnerMatcher& matcher) { return internal::ArgsMatcher(matcher); } ]] // ElementsAre(e0, e1, ..., e_n) matches an STL-style container with // (n + 1) elements, where the i-th element in the container must // match the i-th argument in the list. Each argument of // ElementsAre() can be either a value or a matcher. We support up to // $n arguments. // // NOTE: Since ElementsAre() cares about the order of the elements, it // must not be used with containers whose elements's order is // undefined (e.g. hash_map). inline internal::ElementsAreMatcher0 ElementsAre() { return internal::ElementsAreMatcher0(); } $range i 1..n $for i [[ $range j 1..i template <$for j, [[typename T$j]]> inline internal::ElementsAreMatcher$i<$for j, [[T$j]]> ElementsAre($for j, [[const T$j& e$j]]) { return internal::ElementsAreMatcher$i<$for j, [[T$j]]>($for j, [[e$j]]); } ]] // ElementsAreArray(array) and ElementAreArray(array, count) are like // ElementsAre(), except that they take an array of values or // matchers. The former form infers the size of 'array', which must // be a static C-style array. In the latter form, 'array' can either // be a static array or a pointer to a dynamically created array. template inline internal::ElementsAreArrayMatcher ElementsAreArray( const T* first, size_t count) { return internal::ElementsAreArrayMatcher(first, count); } template inline internal::ElementsAreArrayMatcher ElementsAreArray(const T (&array)[N]) { return internal::ElementsAreArrayMatcher(array, N); } // AllOf(m1, m2, ..., mk) matches any value that matches all of the given // sub-matchers. AllOf is called fully qualified to prevent ADL from firing. $range i 2..n $for i [[ $range j 1..i $range k 1..i-1 template <$for j, [[typename Matcher$j]]> inline $for k[[internal::BothOfMatcher ]] AllOf($for j, [[Matcher$j m$j]]) { $if i == 2 [[ return internal::BothOfMatcher(m1, m2); ]] $else [[ return ::testing::AllOf(m1, ::testing::AllOf($for k, [[m$(k + 1)]])); ]] } ]] // AnyOf(m1, m2, ..., mk) matches any value that matches any of the given // sub-matchers. AnyOf is called fully qualified to prevent ADL from firing. $range i 2..n $for i [[ $range j 1..i $range k 1..i-1 template <$for j, [[typename Matcher$j]]> inline $for k[[internal::EitherOfMatcher ]] AnyOf($for j, [[Matcher$j m$j]]) { $if i == 2 [[ return internal::EitherOfMatcher(m1, m2); ]] $else [[ return ::testing::AnyOf(m1, ::testing::AnyOf($for k, [[m$(k + 1)]])); ]] } ]] } // namespace testing $$ } // This Pump meta comment fixes auto-indentation in Emacs. It will not $$ // show up in the generated code. // The MATCHER* family of macros can be used in a namespace scope to // define custom matchers easily. // // Basic Usage // =========== // // The syntax // // MATCHER(name, description_string) { statements; } // // defines a matcher with the given name that executes the statements, // which must return a bool to indicate if the match succeeds. Inside // the statements, you can refer to the value being matched by 'arg', // and refer to its type by 'arg_type'. // // The description string documents what the matcher does, and is used // to generate the failure message when the match fails. Since a // MATCHER() is usually defined in a header file shared by multiple // C++ source files, we require the description to be a C-string // literal to avoid possible side effects. It can be empty, in which // case we'll use the sequence of words in the matcher name as the // description. // // For example: // // MATCHER(IsEven, "") { return (arg % 2) == 0; } // // allows you to write // // // Expects mock_foo.Bar(n) to be called where n is even. // EXPECT_CALL(mock_foo, Bar(IsEven())); // // or, // // // Verifies that the value of some_expression is even. // EXPECT_THAT(some_expression, IsEven()); // // If the above assertion fails, it will print something like: // // Value of: some_expression // Expected: is even // Actual: 7 // // where the description "is even" is automatically calculated from the // matcher name IsEven. // // Argument Type // ============= // // Note that the type of the value being matched (arg_type) is // determined by the context in which you use the matcher and is // supplied to you by the compiler, so you don't need to worry about // declaring it (nor can you). This allows the matcher to be // polymorphic. For example, IsEven() can be used to match any type // where the value of "(arg % 2) == 0" can be implicitly converted to // a bool. In the "Bar(IsEven())" example above, if method Bar() // takes an int, 'arg_type' will be int; if it takes an unsigned long, // 'arg_type' will be unsigned long; and so on. // // Parameterizing Matchers // ======================= // // Sometimes you'll want to parameterize the matcher. For that you // can use another macro: // // MATCHER_P(name, param_name, description_string) { statements; } // // For example: // // MATCHER_P(HasAbsoluteValue, value, "") { return abs(arg) == value; } // // will allow you to write: // // EXPECT_THAT(Blah("a"), HasAbsoluteValue(n)); // // which may lead to this message (assuming n is 10): // // Value of: Blah("a") // Expected: has absolute value 10 // Actual: -9 // // Note that both the matcher description and its parameter are // printed, making the message human-friendly. // // In the matcher definition body, you can write 'foo_type' to // reference the type of a parameter named 'foo'. For example, in the // body of MATCHER_P(HasAbsoluteValue, value) above, you can write // 'value_type' to refer to the type of 'value'. // // We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P$n to // support multi-parameter matchers. // // Describing Parameterized Matchers // ================================= // // The last argument to MATCHER*() is a string-typed expression. The // expression can reference all of the matcher's parameters and a // special bool-typed variable named 'negation'. When 'negation' is // false, the expression should evaluate to the matcher's description; // otherwise it should evaluate to the description of the negation of // the matcher. For example, // // using testing::PrintToString; // // MATCHER_P2(InClosedRange, low, hi, // string(negation ? "is not" : "is") + " in range [" + // PrintToString(low) + ", " + PrintToString(hi) + "]") { // return low <= arg && arg <= hi; // } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: is in range [4, 6] // ... // Expected: is not in range [2, 4] // // If you specify "" as the description, the failure message will // contain the sequence of words in the matcher name followed by the // parameter values printed as a tuple. For example, // // MATCHER_P2(InClosedRange, low, hi, "") { ... } // ... // EXPECT_THAT(3, InClosedRange(4, 6)); // EXPECT_THAT(3, Not(InClosedRange(2, 4))); // // would generate two failures that contain the text: // // Expected: in closed range (4, 6) // ... // Expected: not (in closed range (2, 4)) // // Types of Matcher Parameters // =========================== // // For the purpose of typing, you can view // // MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... } // // as shorthand for // // template // FooMatcherPk // Foo(p1_type p1, ..., pk_type pk) { ... } // // When you write Foo(v1, ..., vk), the compiler infers the types of // the parameters v1, ..., and vk for you. If you are not happy with // the result of the type inference, you can specify the types by // explicitly instantiating the template, as in Foo(5, // false). As said earlier, you don't get to (or need to) specify // 'arg_type' as that's determined by the context in which the matcher // is used. You can assign the result of expression Foo(p1, ..., pk) // to a variable of type FooMatcherPk. This // can be useful when composing matchers. // // While you can instantiate a matcher template with reference types, // passing the parameters by pointer usually makes your code more // readable. If, however, you still want to pass a parameter by // reference, be aware that in the failure message generated by the // matcher you will see the value of the referenced object but not its // address. // // Explaining Match Results // ======================== // // Sometimes the matcher description alone isn't enough to explain why // the match has failed or succeeded. For example, when expecting a // long string, it can be very helpful to also print the diff between // the expected string and the actual one. To achieve that, you can // optionally stream additional information to a special variable // named result_listener, whose type is a pointer to class // MatchResultListener: // // MATCHER_P(EqualsLongString, str, "") { // if (arg == str) return true; // // *result_listener << "the difference: " /// << DiffStrings(str, arg); // return false; // } // // Overloading Matchers // ==================== // // You can overload matchers with different numbers of parameters: // // MATCHER_P(Blah, a, description_string1) { ... } // MATCHER_P2(Blah, a, b, description_string2) { ... } // // Caveats // ======= // // When defining a new matcher, you should also consider implementing // MatcherInterface or using MakePolymorphicMatcher(). These // approaches require more work than the MATCHER* macros, but also // give you more control on the types of the value being matched and // the matcher parameters, which may leads to better compiler error // messages when the matcher is used wrong. They also allow // overloading matchers based on parameter types (as opposed to just // based on the number of parameters). // // MATCHER*() can only be used in a namespace scope. The reason is // that C++ doesn't yet allow function-local types to be used to // instantiate templates. The up-coming C++0x standard will fix this. // Once that's done, we'll consider supporting using MATCHER*() inside // a function. // // More Information // ================ // // To learn more about using these macros, please search for 'MATCHER' // on http://code.google.com/p/googlemock/wiki/CookBook. $range i 0..n $for i [[ $var macro_name = [[$if i==0 [[MATCHER]] $elif i==1 [[MATCHER_P]] $else [[MATCHER_P$i]]]] $var class_name = [[name##Matcher[[$if i==0 [[]] $elif i==1 [[P]] $else [[P$i]]]]]] $range j 0..i-1 $var template = [[$if i==0 [[]] $else [[ template <$for j, [[typename p$j##_type]]>\ ]]]] $var ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]] $var impl_ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]] $var impl_inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(gmock_p$j)]]]]]] $var inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(gmock_p$j)]]]]]] $var params = [[$for j, [[p$j]]]] $var param_types = [[$if i==0 [[]] $else [[<$for j, [[p$j##_type]]>]]]] $var param_types_and_names = [[$for j, [[p$j##_type p$j]]]] $var param_field_decls = [[$for j [[ p$j##_type p$j;\ ]]]] $var param_field_decls2 = [[$for j [[ p$j##_type p$j;\ ]]]] #define $macro_name(name$for j [[, p$j]], description)\$template class $class_name {\ public:\ template \ class gmock_Impl : public ::testing::MatcherInterface {\ public:\ [[$if i==1 [[explicit ]]]]gmock_Impl($impl_ctor_param_list)\ $impl_inits {}\ virtual bool MatchAndExplain(\ arg_type arg, ::testing::MatchResultListener* result_listener) const;\ virtual void DescribeTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(false);\ }\ virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\ *gmock_os << FormatDescription(true);\ }\$param_field_decls private:\ ::testing::internal::string FormatDescription(bool negation) const {\ const ::testing::internal::string gmock_description = (description);\ if (!gmock_description.empty())\ return gmock_description;\ return ::testing::internal::FormatMatcherDescription(\ negation, #name,\ ::testing::internal::UniversalTersePrintTupleFieldsToStrings(\ ::std::tr1::tuple<$for j, [[p$j##_type]]>($for j, [[p$j]])));\ }\ GTEST_DISALLOW_ASSIGN_(gmock_Impl);\ };\ template \ operator ::testing::Matcher() const {\ return ::testing::Matcher(\ new gmock_Impl($params));\ }\ $class_name($ctor_param_list)$inits {\ }\$param_field_decls2 private:\ GTEST_DISALLOW_ASSIGN_($class_name);\ };\$template inline $class_name$param_types name($param_types_and_names) {\ return $class_name$param_types($params);\ }\$template template \ bool $class_name$param_types::gmock_Impl::MatchAndExplain(\ arg_type arg,\ ::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\ const ]] #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-nice-strict.h0000600000175000017500000002606611561126632027576 0ustar synergysynergy// This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements class templates NiceMock and StrictMock. // // Given a mock class MockFoo that is created using Google Mock, // NiceMock is a subclass of MockFoo that allows // uninteresting calls (i.e. calls to mock methods that have no // EXPECT_CALL specs), and StrictMock is a subclass of // MockFoo that treats all uninteresting calls as errors. // // NiceMock and StrictMock "inherits" the constructors of their // respective base class, with up-to 10 arguments. Therefore you can // write NiceMock(5, "a") to construct a nice mock where // MockFoo has a constructor that accepts (int, const char*), for // example. // // A known limitation is that NiceMock and // StrictMock only works for mock methods defined using the // MOCK_METHOD* family of macros DIRECTLY in the MockFoo class. If a // mock method is defined in a base class of MockFoo, the "nice" or // "strict" modifier may not affect it, depending on the compiler. In // particular, nesting NiceMock and StrictMock is NOT supported. // // Another known limitation is that the constructors of the base mock // cannot have arguments passed by non-const reference, which are // banned by the Google C++ style guide anyway. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ #include "gmock/gmock-spec-builders.h" #include "gmock/internal/gmock-port.h" namespace testing { template class NiceMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. NiceMock() { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } // C++ doesn't (yet) allow inheritance of constructors, so we have // to define it for each arity. template explicit NiceMock(const A1& a1) : MockClass(a1) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2) : MockClass(a1, a2) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4) : MockClass(a1, a2, a3, a4) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5) : MockClass(a1, a2, a3, a4, a5) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5, a6, a7) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } template NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9, const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } virtual ~NiceMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(NiceMock); }; template class StrictMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. StrictMock() { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template explicit StrictMock(const A1& a1) : MockClass(a1) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2) : MockClass(a1, a2) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4) : MockClass(a1, a2, a3, a4) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5) : MockClass(a1, a2, a3, a4, a5) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5, a6, a7) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9, const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } virtual ~StrictMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(StrictMock); }; // The following specializations catch some (relatively more common) // user errors of nesting nice and strict mocks. They do NOT catch // all possible errors. // These specializations are declared but not defined, as NiceMock and // StrictMock cannot be nested. template class NiceMock >; template class NiceMock >; template class StrictMock >; template class StrictMock >; } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-generated-nice-strict.h.pump0000600000175000017500000001332111561126632030544 0ustar synergysynergy$$ -*- mode: c++; -*- $$ This is a Pump source file. Please use Pump to convert it to $$ gmock-generated-nice-strict.h. $$ $var n = 10 $$ The maximum arity we support. // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements class templates NiceMock and StrictMock. // // Given a mock class MockFoo that is created using Google Mock, // NiceMock is a subclass of MockFoo that allows // uninteresting calls (i.e. calls to mock methods that have no // EXPECT_CALL specs), and StrictMock is a subclass of // MockFoo that treats all uninteresting calls as errors. // // NiceMock and StrictMock "inherits" the constructors of their // respective base class, with up-to $n arguments. Therefore you can // write NiceMock(5, "a") to construct a nice mock where // MockFoo has a constructor that accepts (int, const char*), for // example. // // A known limitation is that NiceMock and // StrictMock only works for mock methods defined using the // MOCK_METHOD* family of macros DIRECTLY in the MockFoo class. If a // mock method is defined in a base class of MockFoo, the "nice" or // "strict" modifier may not affect it, depending on the compiler. In // particular, nesting NiceMock and StrictMock is NOT supported. // // Another known limitation is that the constructors of the base mock // cannot have arguments passed by non-const reference, which are // banned by the Google C++ style guide anyway. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ #include "gmock/gmock-spec-builders.h" #include "gmock/internal/gmock-port.h" namespace testing { template class NiceMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. NiceMock() { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } // C++ doesn't (yet) allow inheritance of constructors, so we have // to define it for each arity. template explicit NiceMock(const A1& a1) : MockClass(a1) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } $range i 2..n $for i [[ $range j 1..i template <$for j, [[typename A$j]]> NiceMock($for j, [[const A$j& a$j]]) : MockClass($for j, [[a$j]]) { ::testing::Mock::AllowUninterestingCalls( internal::ImplicitCast_(this)); } ]] virtual ~NiceMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(NiceMock); }; template class StrictMock : public MockClass { public: // We don't factor out the constructor body to a common method, as // we have to avoid a possible clash with members of MockClass. StrictMock() { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } template explicit StrictMock(const A1& a1) : MockClass(a1) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } $for i [[ $range j 1..i template <$for j, [[typename A$j]]> StrictMock($for j, [[const A$j& a$j]]) : MockClass($for j, [[a$j]]) { ::testing::Mock::FailUninterestingCalls( internal::ImplicitCast_(this)); } ]] virtual ~StrictMock() { ::testing::Mock::UnregisterCallReaction( internal::ImplicitCast_(this)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(StrictMock); }; // The following specializations catch some (relatively more common) // user errors of nesting nice and strict mocks. They do NOT catch // all possible errors. // These specializations are declared but not defined, as NiceMock and // StrictMock cannot be nested. template class NiceMock >; template class NiceMock >; template class StrictMock >; template class StrictMock >; } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-matchers.h0000600000175000017500000032620611561126632025223 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some commonly used argument matchers. More // matchers can be defined by the user implementing the // MatcherInterface interface if necessary. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ #include #include #include // NOLINT #include #include #include #include #include "gmock/internal/gmock-internal-utils.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" namespace testing { // To implement a matcher Foo for type T, define: // 1. a class FooMatcherImpl that implements the // MatcherInterface interface, and // 2. a factory function that creates a Matcher object from a // FooMatcherImpl*. // // The two-level delegation design makes it possible to allow a user // to write "v" instead of "Eq(v)" where a Matcher is expected, which // is impossible if we pass matchers by pointers. It also eases // ownership management as Matcher objects can now be copied like // plain values. // MatchResultListener is an abstract class. Its << operator can be // used by a matcher to explain why a value matches or doesn't match. // // TODO(wan@google.com): add method // bool InterestedInWhy(bool result) const; // to indicate whether the listener is interested in why the match // result is 'result'. class MatchResultListener { public: // Creates a listener object with the given underlying ostream. The // listener does not own the ostream. explicit MatchResultListener(::std::ostream* os) : stream_(os) {} virtual ~MatchResultListener() = 0; // Makes this class abstract. // Streams x to the underlying ostream; does nothing if the ostream // is NULL. template MatchResultListener& operator<<(const T& x) { if (stream_ != NULL) *stream_ << x; return *this; } // Returns the underlying ostream. ::std::ostream* stream() { return stream_; } // Returns true iff the listener is interested in an explanation of // the match result. A matcher's MatchAndExplain() method can use // this information to avoid generating the explanation when no one // intends to hear it. bool IsInterested() const { return stream_ != NULL; } private: ::std::ostream* const stream_; GTEST_DISALLOW_COPY_AND_ASSIGN_(MatchResultListener); }; inline MatchResultListener::~MatchResultListener() { } // The implementation of a matcher. template class MatcherInterface { public: virtual ~MatcherInterface() {} // Returns true iff the matcher matches x; also explains the match // result to 'listener', in the form of a non-restrictive relative // clause ("which ...", "whose ...", etc) that describes x. For // example, the MatchAndExplain() method of the Pointee(...) matcher // should generate an explanation like "which points to ...". // // You should override this method when defining a new matcher. // // It's the responsibility of the caller (Google Mock) to guarantee // that 'listener' is not NULL. This helps to simplify a matcher's // implementation when it doesn't care about the performance, as it // can talk to 'listener' without checking its validity first. // However, in order to implement dummy listeners efficiently, // listener->stream() may be NULL. virtual bool MatchAndExplain(T x, MatchResultListener* listener) const = 0; // Describes this matcher to an ostream. The function should print // a verb phrase that describes the property a value matching this // matcher should have. The subject of the verb phrase is the value // being matched. For example, the DescribeTo() method of the Gt(7) // matcher prints "is greater than 7". virtual void DescribeTo(::std::ostream* os) const = 0; // Describes the negation of this matcher to an ostream. For // example, if the description of this matcher is "is greater than // 7", the negated description could be "is not greater than 7". // You are not required to override this when implementing // MatcherInterface, but it is highly advised so that your matcher // can produce good error messages. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "not ("; DescribeTo(os); *os << ")"; } }; namespace internal { // A match result listener that ignores the explanation. class DummyMatchResultListener : public MatchResultListener { public: DummyMatchResultListener() : MatchResultListener(NULL) {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(DummyMatchResultListener); }; // A match result listener that forwards the explanation to a given // ostream. The difference between this and MatchResultListener is // that the former is concrete. class StreamMatchResultListener : public MatchResultListener { public: explicit StreamMatchResultListener(::std::ostream* os) : MatchResultListener(os) {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamMatchResultListener); }; // A match result listener that stores the explanation in a string. class StringMatchResultListener : public MatchResultListener { public: StringMatchResultListener() : MatchResultListener(&ss_) {} // Returns the explanation heard so far. internal::string str() const { return ss_.str(); } private: ::std::stringstream ss_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StringMatchResultListener); }; // An internal class for implementing Matcher, which will derive // from it. We put functionalities common to all Matcher // specializations here to avoid code duplication. template class MatcherBase { public: // Returns true iff the matcher matches x; also explains the match // result to 'listener'. bool MatchAndExplain(T x, MatchResultListener* listener) const { return impl_->MatchAndExplain(x, listener); } // Returns true iff this matcher matches x. bool Matches(T x) const { DummyMatchResultListener dummy; return MatchAndExplain(x, &dummy); } // Describes this matcher to an ostream. void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); } // Describes the negation of this matcher to an ostream. void DescribeNegationTo(::std::ostream* os) const { impl_->DescribeNegationTo(os); } // Explains why x matches, or doesn't match, the matcher. void ExplainMatchResultTo(T x, ::std::ostream* os) const { StreamMatchResultListener listener(os); MatchAndExplain(x, &listener); } protected: MatcherBase() {} // Constructs a matcher from its implementation. explicit MatcherBase(const MatcherInterface* impl) : impl_(impl) {} virtual ~MatcherBase() {} private: // shared_ptr (util/gtl/shared_ptr.h) and linked_ptr have similar // interfaces. The former dynamically allocates a chunk of memory // to hold the reference count, while the latter tracks all // references using a circular linked list without allocating // memory. It has been observed that linked_ptr performs better in // typical scenarios. However, shared_ptr can out-perform // linked_ptr when there are many more uses of the copy constructor // than the default constructor. // // If performance becomes a problem, we should see if using // shared_ptr helps. ::testing::internal::linked_ptr > impl_; }; } // namespace internal // A Matcher is a copyable and IMMUTABLE (except by assignment) // object that can check whether a value of type T matches. The // implementation of Matcher is just a linked_ptr to const // MatcherInterface, so copying is fairly cheap. Don't inherit // from Matcher! template class Matcher : public internal::MatcherBase { public: // Constructs a null matcher. Needed for storing Matcher objects in STL // containers. A default-constructed matcher is not yet initialized. You // cannot use it until a valid value has been assigned to it. Matcher() {} // Constructs a matcher from its implementation. explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Implicit constructor here allows people to write // EXPECT_CALL(foo, Bar(5)) instead of EXPECT_CALL(foo, Bar(Eq(5))) sometimes Matcher(T value); // NOLINT }; // The following two specializations allow the user to write str // instead of Eq(str) and "foo" instead of Eq("foo") when a string // matcher is expected. template <> class Matcher : public internal::MatcherBase { public: Matcher() {} explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Allows the user to write str instead of Eq(str) sometimes, where // str is a string object. Matcher(const internal::string& s); // NOLINT // Allows the user to write "foo" instead of Eq("foo") sometimes. Matcher(const char* s); // NOLINT }; template <> class Matcher : public internal::MatcherBase { public: Matcher() {} explicit Matcher(const MatcherInterface* impl) : internal::MatcherBase(impl) {} // Allows the user to write str instead of Eq(str) sometimes, where // str is a string object. Matcher(const internal::string& s); // NOLINT // Allows the user to write "foo" instead of Eq("foo") sometimes. Matcher(const char* s); // NOLINT }; // The PolymorphicMatcher class template makes it easy to implement a // polymorphic matcher (i.e. a matcher that can match values of more // than one type, e.g. Eq(n) and NotNull()). // // To define a polymorphic matcher, a user should provide an Impl // class that has a DescribeTo() method and a DescribeNegationTo() // method, and define a member function (or member function template) // // bool MatchAndExplain(const Value& value, // MatchResultListener* listener) const; // // See the definition of NotNull() for a complete example. template class PolymorphicMatcher { public: explicit PolymorphicMatcher(const Impl& an_impl) : impl_(an_impl) {} // Returns a mutable reference to the underlying matcher // implementation object. Impl& mutable_impl() { return impl_; } // Returns an immutable reference to the underlying matcher // implementation object. const Impl& impl() const { return impl_; } template operator Matcher() const { return Matcher(new MonomorphicImpl(impl_)); } private: template class MonomorphicImpl : public MatcherInterface { public: explicit MonomorphicImpl(const Impl& impl) : impl_(impl) {} virtual void DescribeTo(::std::ostream* os) const { impl_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { impl_.DescribeNegationTo(os); } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return impl_.MatchAndExplain(x, listener); } private: const Impl impl_; GTEST_DISALLOW_ASSIGN_(MonomorphicImpl); }; Impl impl_; GTEST_DISALLOW_ASSIGN_(PolymorphicMatcher); }; // Creates a matcher from its implementation. This is easier to use // than the Matcher constructor as it doesn't require you to // explicitly write the template argument, e.g. // // MakeMatcher(foo); // vs // Matcher(foo); template inline Matcher MakeMatcher(const MatcherInterface* impl) { return Matcher(impl); }; // Creates a polymorphic matcher from its implementation. This is // easier to use than the PolymorphicMatcher constructor as it // doesn't require you to explicitly write the template argument, e.g. // // MakePolymorphicMatcher(foo); // vs // PolymorphicMatcher(foo); template inline PolymorphicMatcher MakePolymorphicMatcher(const Impl& impl) { return PolymorphicMatcher(impl); } // In order to be safe and clear, casting between different matcher // types is done explicitly via MatcherCast(m), which takes a // matcher m and returns a Matcher. It compiles only when T can be // statically converted to the argument type of m. template Matcher MatcherCast(M m); // Implements SafeMatcherCast(). // // We use an intermediate class to do the actual safe casting as Nokia's // Symbian compiler cannot decide between // template ... (M) and // template ... (const Matcher&) // for function templates but can for member function templates. template class SafeMatcherCastImpl { public: // This overload handles polymorphic matchers only since monomorphic // matchers are handled by the next one. template static inline Matcher Cast(M polymorphic_matcher) { return Matcher(polymorphic_matcher); } // This overload handles monomorphic matchers. // // In general, if type T can be implicitly converted to type U, we can // safely convert a Matcher to a Matcher (i.e. Matcher is // contravariant): just keep a copy of the original Matcher, convert the // argument from type T to U, and then pass it to the underlying Matcher. // The only exception is when U is a reference and T is not, as the // underlying Matcher may be interested in the argument's address, which // is not preserved in the conversion from T to U. template static inline Matcher Cast(const Matcher& matcher) { // Enforce that T can be implicitly converted to U. GTEST_COMPILE_ASSERT_((internal::ImplicitlyConvertible::value), T_must_be_implicitly_convertible_to_U); // Enforce that we are not converting a non-reference type T to a reference // type U. GTEST_COMPILE_ASSERT_( internal::is_reference::value || !internal::is_reference::value, cannot_convert_non_referentce_arg_to_reference); // In case both T and U are arithmetic types, enforce that the // conversion is not lossy. typedef GTEST_REMOVE_REFERENCE_AND_CONST_(T) RawT; typedef GTEST_REMOVE_REFERENCE_AND_CONST_(U) RawU; const bool kTIsOther = GMOCK_KIND_OF_(RawT) == internal::kOther; const bool kUIsOther = GMOCK_KIND_OF_(RawU) == internal::kOther; GTEST_COMPILE_ASSERT_( kTIsOther || kUIsOther || (internal::LosslessArithmeticConvertible::value), conversion_of_arithmetic_types_must_be_lossless); return MatcherCast(matcher); } }; template inline Matcher SafeMatcherCast(const M& polymorphic_matcher) { return SafeMatcherCastImpl::Cast(polymorphic_matcher); } // A() returns a matcher that matches any value of type T. template Matcher A(); // Anything inside the 'internal' namespace IS INTERNAL IMPLEMENTATION // and MUST NOT BE USED IN USER CODE!!! namespace internal { // If the explanation is not empty, prints it to the ostream. inline void PrintIfNotEmpty(const internal::string& explanation, std::ostream* os) { if (explanation != "" && os != NULL) { *os << ", " << explanation; } } // Returns true if the given type name is easy to read by a human. // This is used to decide whether printing the type of a value might // be helpful. inline bool IsReadableTypeName(const string& type_name) { // We consider a type name readable if it's short or doesn't contain // a template or function type. return (type_name.length() <= 20 || type_name.find_first_of("<(") == string::npos); } // Matches the value against the given matcher, prints the value and explains // the match result to the listener. Returns the match result. // 'listener' must not be NULL. // Value cannot be passed by const reference, because some matchers take a // non-const argument. template bool MatchPrintAndExplain(Value& value, const Matcher& matcher, MatchResultListener* listener) { if (!listener->IsInterested()) { // If the listener is not interested, we do not need to construct the // inner explanation. return matcher.Matches(value); } StringMatchResultListener inner_listener; const bool match = matcher.MatchAndExplain(value, &inner_listener); UniversalPrint(value, listener->stream()); #if GTEST_HAS_RTTI const string& type_name = GetTypeName(); if (IsReadableTypeName(type_name)) *listener->stream() << " (of type " << type_name << ")"; #endif PrintIfNotEmpty(inner_listener.str(), listener->stream()); return match; } // An internal helper class for doing compile-time loop on a tuple's // fields. template class TuplePrefix { public: // TuplePrefix::Matches(matcher_tuple, value_tuple) returns true // iff the first N fields of matcher_tuple matches the first N // fields of value_tuple, respectively. template static bool Matches(const MatcherTuple& matcher_tuple, const ValueTuple& value_tuple) { using ::std::tr1::get; return TuplePrefix::Matches(matcher_tuple, value_tuple) && get(matcher_tuple).Matches(get(value_tuple)); } // TuplePrefix::ExplainMatchFailuresTo(matchers, values, os) // describes failures in matching the first N fields of matchers // against the first N fields of values. If there is no failure, // nothing will be streamed to os. template static void ExplainMatchFailuresTo(const MatcherTuple& matchers, const ValueTuple& values, ::std::ostream* os) { using ::std::tr1::tuple_element; using ::std::tr1::get; // First, describes failures in the first N - 1 fields. TuplePrefix::ExplainMatchFailuresTo(matchers, values, os); // Then describes the failure (if any) in the (N - 1)-th (0-based) // field. typename tuple_element::type matcher = get(matchers); typedef typename tuple_element::type Value; Value value = get(values); StringMatchResultListener listener; if (!matcher.MatchAndExplain(value, &listener)) { // TODO(wan): include in the message the name of the parameter // as used in MOCK_METHOD*() when possible. *os << " Expected arg #" << N - 1 << ": "; get(matchers).DescribeTo(os); *os << "\n Actual: "; // We remove the reference in type Value to prevent the // universal printer from printing the address of value, which // isn't interesting to the user most of the time. The // matcher's MatchAndExplain() method handles the case when // the address is interesting. internal::UniversalPrint(value, os); PrintIfNotEmpty(listener.str(), os); *os << "\n"; } } }; // The base case. template <> class TuplePrefix<0> { public: template static bool Matches(const MatcherTuple& /* matcher_tuple */, const ValueTuple& /* value_tuple */) { return true; } template static void ExplainMatchFailuresTo(const MatcherTuple& /* matchers */, const ValueTuple& /* values */, ::std::ostream* /* os */) {} }; // TupleMatches(matcher_tuple, value_tuple) returns true iff all // matchers in matcher_tuple match the corresponding fields in // value_tuple. It is a compiler error if matcher_tuple and // value_tuple have different number of fields or incompatible field // types. template bool TupleMatches(const MatcherTuple& matcher_tuple, const ValueTuple& value_tuple) { using ::std::tr1::tuple_size; // Makes sure that matcher_tuple and value_tuple have the same // number of fields. GTEST_COMPILE_ASSERT_(tuple_size::value == tuple_size::value, matcher_and_value_have_different_numbers_of_fields); return TuplePrefix::value>:: Matches(matcher_tuple, value_tuple); } // Describes failures in matching matchers against values. If there // is no failure, nothing will be streamed to os. template void ExplainMatchFailureTupleTo(const MatcherTuple& matchers, const ValueTuple& values, ::std::ostream* os) { using ::std::tr1::tuple_size; TuplePrefix::value>::ExplainMatchFailuresTo( matchers, values, os); } // The MatcherCastImpl class template is a helper for implementing // MatcherCast(). We need this helper in order to partially // specialize the implementation of MatcherCast() (C++ allows // class/struct templates to be partially specialized, but not // function templates.). // This general version is used when MatcherCast()'s argument is a // polymorphic matcher (i.e. something that can be converted to a // Matcher but is not one yet; for example, Eq(value)). template class MatcherCastImpl { public: static Matcher Cast(M polymorphic_matcher) { return Matcher(polymorphic_matcher); } }; // This more specialized version is used when MatcherCast()'s argument // is already a Matcher. This only compiles when type T can be // statically converted to type U. template class MatcherCastImpl > { public: static Matcher Cast(const Matcher& source_matcher) { return Matcher(new Impl(source_matcher)); } private: class Impl : public MatcherInterface { public: explicit Impl(const Matcher& source_matcher) : source_matcher_(source_matcher) {} // We delegate the matching logic to the source matcher. virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return source_matcher_.MatchAndExplain(static_cast(x), listener); } virtual void DescribeTo(::std::ostream* os) const { source_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { source_matcher_.DescribeNegationTo(os); } private: const Matcher source_matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; }; // This even more specialized version is used for efficiently casting // a matcher to its own type. template class MatcherCastImpl > { public: static Matcher Cast(const Matcher& matcher) { return matcher; } }; // Implements A(). template class AnyMatcherImpl : public MatcherInterface { public: virtual bool MatchAndExplain( T /* x */, MatchResultListener* /* listener */) const { return true; } virtual void DescribeTo(::std::ostream* os) const { *os << "is anything"; } virtual void DescribeNegationTo(::std::ostream* os) const { // This is mostly for completeness' safe, as it's not very useful // to write Not(A()). However we cannot completely rule out // such a possibility, and it doesn't hurt to be prepared. *os << "never matches"; } }; // Implements _, a matcher that matches any value of any // type. This is a polymorphic matcher, so we need a template type // conversion operator to make it appearing as a Matcher for any // type T. class AnythingMatcher { public: template operator Matcher() const { return A(); } }; // Implements a matcher that compares a given value with a // pre-supplied value using one of the ==, <=, <, etc, operators. The // two values being compared don't have to have the same type. // // The matcher defined here is polymorphic (for example, Eq(5) can be // used to match an int, a short, a double, etc). Therefore we use // a template type conversion operator in the implementation. // // We define this as a macro in order to eliminate duplicated source // code. // // The following template definition assumes that the Rhs parameter is // a "bare" type (i.e. neither 'const T' nor 'T&'). #define GMOCK_IMPLEMENT_COMPARISON_MATCHER_( \ name, op, relation, negated_relation) \ template class name##Matcher { \ public: \ explicit name##Matcher(const Rhs& rhs) : rhs_(rhs) {} \ template \ operator Matcher() const { \ return MakeMatcher(new Impl(rhs_)); \ } \ private: \ template \ class Impl : public MatcherInterface { \ public: \ explicit Impl(const Rhs& rhs) : rhs_(rhs) {} \ virtual bool MatchAndExplain(\ Lhs lhs, MatchResultListener* /* listener */) const { \ return lhs op rhs_; \ } \ virtual void DescribeTo(::std::ostream* os) const { \ *os << relation " "; \ UniversalPrint(rhs_, os); \ } \ virtual void DescribeNegationTo(::std::ostream* os) const { \ *os << negated_relation " "; \ UniversalPrint(rhs_, os); \ } \ private: \ Rhs rhs_; \ GTEST_DISALLOW_ASSIGN_(Impl); \ }; \ Rhs rhs_; \ GTEST_DISALLOW_ASSIGN_(name##Matcher); \ } // Implements Eq(v), Ge(v), Gt(v), Le(v), Lt(v), and Ne(v) // respectively. GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Eq, ==, "is equal to", "isn't equal to"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Ge, >=, "is >=", "isn't >="); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Gt, >, "is >", "isn't >"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Le, <=, "is <=", "isn't <="); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Lt, <, "is <", "isn't <"); GMOCK_IMPLEMENT_COMPARISON_MATCHER_(Ne, !=, "isn't equal to", "is equal to"); #undef GMOCK_IMPLEMENT_COMPARISON_MATCHER_ // Implements the polymorphic IsNull() matcher, which matches any raw or smart // pointer that is NULL. class IsNullMatcher { public: template bool MatchAndExplain(const Pointer& p, MatchResultListener* /* listener */) const { return GetRawPointer(p) == NULL; } void DescribeTo(::std::ostream* os) const { *os << "is NULL"; } void DescribeNegationTo(::std::ostream* os) const { *os << "isn't NULL"; } }; // Implements the polymorphic NotNull() matcher, which matches any raw or smart // pointer that is not NULL. class NotNullMatcher { public: template bool MatchAndExplain(const Pointer& p, MatchResultListener* /* listener */) const { return GetRawPointer(p) != NULL; } void DescribeTo(::std::ostream* os) const { *os << "isn't NULL"; } void DescribeNegationTo(::std::ostream* os) const { *os << "is NULL"; } }; // Ref(variable) matches any argument that is a reference to // 'variable'. This matcher is polymorphic as it can match any // super type of the type of 'variable'. // // The RefMatcher template class implements Ref(variable). It can // only be instantiated with a reference type. This prevents a user // from mistakenly using Ref(x) to match a non-reference function // argument. For example, the following will righteously cause a // compiler error: // // int n; // Matcher m1 = Ref(n); // This won't compile. // Matcher m2 = Ref(n); // This will compile. template class RefMatcher; template class RefMatcher { // Google Mock is a generic framework and thus needs to support // mocking any function types, including those that take non-const // reference arguments. Therefore the template parameter T (and // Super below) can be instantiated to either a const type or a // non-const type. public: // RefMatcher() takes a T& instead of const T&, as we want the // compiler to catch using Ref(const_value) as a matcher for a // non-const reference. explicit RefMatcher(T& x) : object_(x) {} // NOLINT template operator Matcher() const { // By passing object_ (type T&) to Impl(), which expects a Super&, // we make sure that Super is a super type of T. In particular, // this catches using Ref(const_value) as a matcher for a // non-const reference, as you cannot implicitly convert a const // reference to a non-const reference. return MakeMatcher(new Impl(object_)); } private: template class Impl : public MatcherInterface { public: explicit Impl(Super& x) : object_(x) {} // NOLINT // MatchAndExplain() takes a Super& (as opposed to const Super&) // in order to match the interface MatcherInterface. virtual bool MatchAndExplain( Super& x, MatchResultListener* listener) const { *listener << "which is located @" << static_cast(&x); return &x == &object_; } virtual void DescribeTo(::std::ostream* os) const { *os << "references the variable "; UniversalPrinter::Print(object_, os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "does not reference the variable "; UniversalPrinter::Print(object_, os); } private: const Super& object_; GTEST_DISALLOW_ASSIGN_(Impl); }; T& object_; GTEST_DISALLOW_ASSIGN_(RefMatcher); }; // Polymorphic helper functions for narrow and wide string matchers. inline bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs) { return String::CaseInsensitiveCStringEquals(lhs, rhs); } inline bool CaseInsensitiveCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { return String::CaseInsensitiveWideCStringEquals(lhs, rhs); } // String comparison for narrow or wide strings that can have embedded NUL // characters. template bool CaseInsensitiveStringEquals(const StringType& s1, const StringType& s2) { // Are the heads equal? if (!CaseInsensitiveCStringEquals(s1.c_str(), s2.c_str())) { return false; } // Skip the equal heads. const typename StringType::value_type nul = 0; const size_t i1 = s1.find(nul), i2 = s2.find(nul); // Are we at the end of either s1 or s2? if (i1 == StringType::npos || i2 == StringType::npos) { return i1 == i2; } // Are the tails equal? return CaseInsensitiveStringEquals(s1.substr(i1 + 1), s2.substr(i2 + 1)); } // String matchers. // Implements equality-based string matchers like StrEq, StrCaseNe, and etc. template class StrEqualityMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; StrEqualityMatcher(const StringType& str, bool expect_eq, bool case_sensitive) : string_(str), expect_eq_(expect_eq), case_sensitive_(case_sensitive) {} // When expect_eq_ is true, returns true iff s is equal to string_; // otherwise returns true iff s is not equal to string_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { if (s == NULL) { return !expect_eq_; } return MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { const bool eq = case_sensitive_ ? s == string_ : CaseInsensitiveStringEquals(s, string_); return expect_eq_ == eq; } void DescribeTo(::std::ostream* os) const { DescribeToHelper(expect_eq_, os); } void DescribeNegationTo(::std::ostream* os) const { DescribeToHelper(!expect_eq_, os); } private: void DescribeToHelper(bool expect_eq, ::std::ostream* os) const { *os << (expect_eq ? "is " : "isn't "); *os << "equal to "; if (!case_sensitive_) { *os << "(ignoring case) "; } UniversalPrint(string_, os); } const StringType string_; const bool expect_eq_; const bool case_sensitive_; GTEST_DISALLOW_ASSIGN_(StrEqualityMatcher); }; // Implements the polymorphic HasSubstr(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class HasSubstrMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit HasSubstrMatcher(const StringType& substring) : substring_(substring) {} // These overloaded methods allow HasSubstr(substring) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s contains substring_ as a substring. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.find(substring_) != StringType::npos; } // Describes what this matcher matches. void DescribeTo(::std::ostream* os) const { *os << "has substring "; UniversalPrint(substring_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "has no substring "; UniversalPrint(substring_, os); } private: const StringType substring_; GTEST_DISALLOW_ASSIGN_(HasSubstrMatcher); }; // Implements the polymorphic StartsWith(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class StartsWithMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit StartsWithMatcher(const StringType& prefix) : prefix_(prefix) { } // These overloaded methods allow StartsWith(prefix) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s starts with prefix_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.length() >= prefix_.length() && s.substr(0, prefix_.length()) == prefix_; } void DescribeTo(::std::ostream* os) const { *os << "starts with "; UniversalPrint(prefix_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't start with "; UniversalPrint(prefix_, os); } private: const StringType prefix_; GTEST_DISALLOW_ASSIGN_(StartsWithMatcher); }; // Implements the polymorphic EndsWith(substring) matcher, which // can be used as a Matcher as long as T can be converted to a // string. template class EndsWithMatcher { public: typedef typename StringType::const_pointer ConstCharPointer; explicit EndsWithMatcher(const StringType& suffix) : suffix_(suffix) {} // These overloaded methods allow EndsWith(suffix) to be used as a // Matcher as long as T can be converted to string. Returns true // iff s ends with suffix_. bool MatchAndExplain(ConstCharPointer s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(StringType(s), listener); } bool MatchAndExplain(const StringType& s, MatchResultListener* /* listener */) const { return s.length() >= suffix_.length() && s.substr(s.length() - suffix_.length()) == suffix_; } void DescribeTo(::std::ostream* os) const { *os << "ends with "; UniversalPrint(suffix_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't end with "; UniversalPrint(suffix_, os); } private: const StringType suffix_; GTEST_DISALLOW_ASSIGN_(EndsWithMatcher); }; // Implements polymorphic matchers MatchesRegex(regex) and // ContainsRegex(regex), which can be used as a Matcher as long as // T can be converted to a string. class MatchesRegexMatcher { public: MatchesRegexMatcher(const RE* regex, bool full_match) : regex_(regex), full_match_(full_match) {} // These overloaded methods allow MatchesRegex(regex) to be used as // a Matcher as long as T can be converted to string. Returns // true iff s matches regular expression regex. When full_match_ is // true, a full match is done; otherwise a partial match is done. bool MatchAndExplain(const char* s, MatchResultListener* listener) const { return s != NULL && MatchAndExplain(internal::string(s), listener); } bool MatchAndExplain(const internal::string& s, MatchResultListener* /* listener */) const { return full_match_ ? RE::FullMatch(s, *regex_) : RE::PartialMatch(s, *regex_); } void DescribeTo(::std::ostream* os) const { *os << (full_match_ ? "matches" : "contains") << " regular expression "; UniversalPrinter::Print(regex_->pattern(), os); } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't " << (full_match_ ? "match" : "contain") << " regular expression "; UniversalPrinter::Print(regex_->pattern(), os); } private: const internal::linked_ptr regex_; const bool full_match_; GTEST_DISALLOW_ASSIGN_(MatchesRegexMatcher); }; // Implements a matcher that compares the two fields of a 2-tuple // using one of the ==, <=, <, etc, operators. The two fields being // compared don't have to have the same type. // // The matcher defined here is polymorphic (for example, Eq() can be // used to match a tuple, a tuple, // etc). Therefore we use a template type conversion operator in the // implementation. // // We define this as a macro in order to eliminate duplicated source // code. #define GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(name, op, relation) \ class name##2Matcher { \ public: \ template \ operator Matcher< ::std::tr1::tuple >() const { \ return MakeMatcher(new Impl< ::std::tr1::tuple >); \ } \ template \ operator Matcher&>() const { \ return MakeMatcher(new Impl&>); \ } \ private: \ template \ class Impl : public MatcherInterface { \ public: \ virtual bool MatchAndExplain( \ Tuple args, \ MatchResultListener* /* listener */) const { \ return ::std::tr1::get<0>(args) op ::std::tr1::get<1>(args); \ } \ virtual void DescribeTo(::std::ostream* os) const { \ *os << "are " relation; \ } \ virtual void DescribeNegationTo(::std::ostream* os) const { \ *os << "aren't " relation; \ } \ }; \ } // Implements Eq(), Ge(), Gt(), Le(), Lt(), and Ne() respectively. GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(Eq, ==, "an equal pair"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Ge, >=, "a pair where the first >= the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Gt, >, "a pair where the first > the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Le, <=, "a pair where the first <= the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_( Lt, <, "a pair where the first < the second"); GMOCK_IMPLEMENT_COMPARISON2_MATCHER_(Ne, !=, "an unequal pair"); #undef GMOCK_IMPLEMENT_COMPARISON2_MATCHER_ // Implements the Not(...) matcher for a particular argument type T. // We do not nest it inside the NotMatcher class template, as that // will prevent different instantiations of NotMatcher from sharing // the same NotMatcherImpl class. template class NotMatcherImpl : public MatcherInterface { public: explicit NotMatcherImpl(const Matcher& matcher) : matcher_(matcher) {} virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { return !matcher_.MatchAndExplain(x, listener); } virtual void DescribeTo(::std::ostream* os) const { matcher_.DescribeNegationTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { matcher_.DescribeTo(os); } private: const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(NotMatcherImpl); }; // Implements the Not(m) matcher, which matches a value that doesn't // match matcher m. template class NotMatcher { public: explicit NotMatcher(InnerMatcher matcher) : matcher_(matcher) {} // This template type conversion operator allows Not(m) to be used // to match any type m can match. template operator Matcher() const { return Matcher(new NotMatcherImpl(SafeMatcherCast(matcher_))); } private: InnerMatcher matcher_; GTEST_DISALLOW_ASSIGN_(NotMatcher); }; // Implements the AllOf(m1, m2) matcher for a particular argument type // T. We do not nest it inside the BothOfMatcher class template, as // that will prevent different instantiations of BothOfMatcher from // sharing the same BothOfMatcherImpl class. template class BothOfMatcherImpl : public MatcherInterface { public: BothOfMatcherImpl(const Matcher& matcher1, const Matcher& matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} virtual void DescribeTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeTo(os); *os << ") and ("; matcher2_.DescribeTo(os); *os << ")"; } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeNegationTo(os); *os << ") or ("; matcher2_.DescribeNegationTo(os); *os << ")"; } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { // If either matcher1_ or matcher2_ doesn't match x, we only need // to explain why one of them fails. StringMatchResultListener listener1; if (!matcher1_.MatchAndExplain(x, &listener1)) { *listener << listener1.str(); return false; } StringMatchResultListener listener2; if (!matcher2_.MatchAndExplain(x, &listener2)) { *listener << listener2.str(); return false; } // Otherwise we need to explain why *both* of them match. const internal::string s1 = listener1.str(); const internal::string s2 = listener2.str(); if (s1 == "") { *listener << s2; } else { *listener << s1; if (s2 != "") { *listener << ", and " << s2; } } return true; } private: const Matcher matcher1_; const Matcher matcher2_; GTEST_DISALLOW_ASSIGN_(BothOfMatcherImpl); }; // Used for implementing the AllOf(m_1, ..., m_n) matcher, which // matches a value that matches all of the matchers m_1, ..., and m_n. template class BothOfMatcher { public: BothOfMatcher(Matcher1 matcher1, Matcher2 matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} // This template type conversion operator allows a // BothOfMatcher object to match any type that // both Matcher1 and Matcher2 can match. template operator Matcher() const { return Matcher(new BothOfMatcherImpl(SafeMatcherCast(matcher1_), SafeMatcherCast(matcher2_))); } private: Matcher1 matcher1_; Matcher2 matcher2_; GTEST_DISALLOW_ASSIGN_(BothOfMatcher); }; // Implements the AnyOf(m1, m2) matcher for a particular argument type // T. We do not nest it inside the AnyOfMatcher class template, as // that will prevent different instantiations of AnyOfMatcher from // sharing the same EitherOfMatcherImpl class. template class EitherOfMatcherImpl : public MatcherInterface { public: EitherOfMatcherImpl(const Matcher& matcher1, const Matcher& matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} virtual void DescribeTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeTo(os); *os << ") or ("; matcher2_.DescribeTo(os); *os << ")"; } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "("; matcher1_.DescribeNegationTo(os); *os << ") and ("; matcher2_.DescribeNegationTo(os); *os << ")"; } virtual bool MatchAndExplain(T x, MatchResultListener* listener) const { // If either matcher1_ or matcher2_ matches x, we just need to // explain why *one* of them matches. StringMatchResultListener listener1; if (matcher1_.MatchAndExplain(x, &listener1)) { *listener << listener1.str(); return true; } StringMatchResultListener listener2; if (matcher2_.MatchAndExplain(x, &listener2)) { *listener << listener2.str(); return true; } // Otherwise we need to explain why *both* of them fail. const internal::string s1 = listener1.str(); const internal::string s2 = listener2.str(); if (s1 == "") { *listener << s2; } else { *listener << s1; if (s2 != "") { *listener << ", and " << s2; } } return false; } private: const Matcher matcher1_; const Matcher matcher2_; GTEST_DISALLOW_ASSIGN_(EitherOfMatcherImpl); }; // Used for implementing the AnyOf(m_1, ..., m_n) matcher, which // matches a value that matches at least one of the matchers m_1, ..., // and m_n. template class EitherOfMatcher { public: EitherOfMatcher(Matcher1 matcher1, Matcher2 matcher2) : matcher1_(matcher1), matcher2_(matcher2) {} // This template type conversion operator allows a // EitherOfMatcher object to match any type that // both Matcher1 and Matcher2 can match. template operator Matcher() const { return Matcher(new EitherOfMatcherImpl( SafeMatcherCast(matcher1_), SafeMatcherCast(matcher2_))); } private: Matcher1 matcher1_; Matcher2 matcher2_; GTEST_DISALLOW_ASSIGN_(EitherOfMatcher); }; // Used for implementing Truly(pred), which turns a predicate into a // matcher. template class TrulyMatcher { public: explicit TrulyMatcher(Predicate pred) : predicate_(pred) {} // This method template allows Truly(pred) to be used as a matcher // for type T where T is the argument type of predicate 'pred'. The // argument is passed by reference as the predicate may be // interested in the address of the argument. template bool MatchAndExplain(T& x, // NOLINT MatchResultListener* /* listener */) const { // Without the if-statement, MSVC sometimes warns about converting // a value to bool (warning 4800). // // We cannot write 'return !!predicate_(x);' as that doesn't work // when predicate_(x) returns a class convertible to bool but // having no operator!(). if (predicate_(x)) return true; return false; } void DescribeTo(::std::ostream* os) const { *os << "satisfies the given predicate"; } void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't satisfy the given predicate"; } private: Predicate predicate_; GTEST_DISALLOW_ASSIGN_(TrulyMatcher); }; // Used for implementing Matches(matcher), which turns a matcher into // a predicate. template class MatcherAsPredicate { public: explicit MatcherAsPredicate(M matcher) : matcher_(matcher) {} // This template operator() allows Matches(m) to be used as a // predicate on type T where m is a matcher on type T. // // The argument x is passed by reference instead of by value, as // some matcher may be interested in its address (e.g. as in // Matches(Ref(n))(x)). template bool operator()(const T& x) const { // We let matcher_ commit to a particular type here instead of // when the MatcherAsPredicate object was constructed. This // allows us to write Matches(m) where m is a polymorphic matcher // (e.g. Eq(5)). // // If we write Matcher(matcher_).Matches(x) here, it won't // compile when matcher_ has type Matcher; if we write // Matcher(matcher_).Matches(x) here, it won't compile // when matcher_ has type Matcher; if we just write // matcher_.Matches(x), it won't compile when matcher_ is // polymorphic, e.g. Eq(5). // // MatcherCast() is necessary for making the code work // in all of the above situations. return MatcherCast(matcher_).Matches(x); } private: M matcher_; GTEST_DISALLOW_ASSIGN_(MatcherAsPredicate); }; // For implementing ASSERT_THAT() and EXPECT_THAT(). The template // argument M must be a type that can be converted to a matcher. template class PredicateFormatterFromMatcher { public: explicit PredicateFormatterFromMatcher(const M& m) : matcher_(m) {} // This template () operator allows a PredicateFormatterFromMatcher // object to act as a predicate-formatter suitable for using with // Google Test's EXPECT_PRED_FORMAT1() macro. template AssertionResult operator()(const char* value_text, const T& x) const { // We convert matcher_ to a Matcher *now* instead of // when the PredicateFormatterFromMatcher object was constructed, // as matcher_ may be polymorphic (e.g. NotNull()) and we won't // know which type to instantiate it to until we actually see the // type of x here. // // We write MatcherCast(matcher_) instead of // Matcher(matcher_), as the latter won't compile when // matcher_ has type Matcher (e.g. An()). const Matcher matcher = MatcherCast(matcher_); StringMatchResultListener listener; if (MatchPrintAndExplain(x, matcher, &listener)) return AssertionSuccess(); ::std::stringstream ss; ss << "Value of: " << value_text << "\n" << "Expected: "; matcher.DescribeTo(&ss); ss << "\n Actual: " << listener.str(); return AssertionFailure() << ss.str(); } private: const M matcher_; GTEST_DISALLOW_ASSIGN_(PredicateFormatterFromMatcher); }; // A helper function for converting a matcher to a predicate-formatter // without the user needing to explicitly write the type. This is // used for implementing ASSERT_THAT() and EXPECT_THAT(). template inline PredicateFormatterFromMatcher MakePredicateFormatterFromMatcher(const M& matcher) { return PredicateFormatterFromMatcher(matcher); } // Implements the polymorphic floating point equality matcher, which // matches two float values using ULP-based approximation. The // template is meant to be instantiated with FloatType being either // float or double. template class FloatingEqMatcher { public: // Constructor for FloatingEqMatcher. // The matcher's input will be compared with rhs. The matcher treats two // NANs as equal if nan_eq_nan is true. Otherwise, under IEEE standards, // equality comparisons between NANs will always return false. FloatingEqMatcher(FloatType rhs, bool nan_eq_nan) : rhs_(rhs), nan_eq_nan_(nan_eq_nan) {} // Implements floating point equality matcher as a Matcher. template class Impl : public MatcherInterface { public: Impl(FloatType rhs, bool nan_eq_nan) : rhs_(rhs), nan_eq_nan_(nan_eq_nan) {} virtual bool MatchAndExplain(T value, MatchResultListener* /* listener */) const { const FloatingPoint lhs(value), rhs(rhs_); // Compares NaNs first, if nan_eq_nan_ is true. if (nan_eq_nan_ && lhs.is_nan()) { return rhs.is_nan(); } return lhs.AlmostEquals(rhs); } virtual void DescribeTo(::std::ostream* os) const { // os->precision() returns the previously set precision, which we // store to restore the ostream to its original configuration // after outputting. const ::std::streamsize old_precision = os->precision( ::std::numeric_limits::digits10 + 2); if (FloatingPoint(rhs_).is_nan()) { if (nan_eq_nan_) { *os << "is NaN"; } else { *os << "never matches"; } } else { *os << "is approximately " << rhs_; } os->precision(old_precision); } virtual void DescribeNegationTo(::std::ostream* os) const { // As before, get original precision. const ::std::streamsize old_precision = os->precision( ::std::numeric_limits::digits10 + 2); if (FloatingPoint(rhs_).is_nan()) { if (nan_eq_nan_) { *os << "isn't NaN"; } else { *os << "is anything"; } } else { *os << "isn't approximately " << rhs_; } // Restore original precision. os->precision(old_precision); } private: const FloatType rhs_; const bool nan_eq_nan_; GTEST_DISALLOW_ASSIGN_(Impl); }; // The following 3 type conversion operators allow FloatEq(rhs) and // NanSensitiveFloatEq(rhs) to be used as a Matcher, a // Matcher, or a Matcher, but nothing else. // (While Google's C++ coding style doesn't allow arguments passed // by non-const reference, we may see them in code not conforming to // the style. Therefore Google Mock needs to support them.) operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } operator Matcher() const { return MakeMatcher(new Impl(rhs_, nan_eq_nan_)); } private: const FloatType rhs_; const bool nan_eq_nan_; GTEST_DISALLOW_ASSIGN_(FloatingEqMatcher); }; // Implements the Pointee(m) matcher for matching a pointer whose // pointee matches matcher m. The pointer can be either raw or smart. template class PointeeMatcher { public: explicit PointeeMatcher(const InnerMatcher& matcher) : matcher_(matcher) {} // This type conversion operator template allows Pointee(m) to be // used as a matcher for any pointer type whose pointee type is // compatible with the inner matcher, where type Pointer can be // either a raw pointer or a smart pointer. // // The reason we do this instead of relying on // MakePolymorphicMatcher() is that the latter is not flexible // enough for implementing the DescribeTo() method of Pointee(). template operator Matcher() const { return MakeMatcher(new Impl(matcher_)); } private: // The monomorphic implementation that works for a particular pointer type. template class Impl : public MatcherInterface { public: typedef typename PointeeOf::type Pointee; explicit Impl(const InnerMatcher& matcher) : matcher_(MatcherCast(matcher)) {} virtual void DescribeTo(::std::ostream* os) const { *os << "points to a value that "; matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "does not point to a value that "; matcher_.DescribeTo(os); } virtual bool MatchAndExplain(Pointer pointer, MatchResultListener* listener) const { if (GetRawPointer(pointer) == NULL) return false; *listener << "which points to "; return MatchPrintAndExplain(*pointer, matcher_, listener); } private: const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; const InnerMatcher matcher_; GTEST_DISALLOW_ASSIGN_(PointeeMatcher); }; // Implements the Field() matcher for matching a field (i.e. member // variable) of an object. template class FieldMatcher { public: FieldMatcher(FieldType Class::*field, const Matcher& matcher) : field_(field), matcher_(matcher) {} void DescribeTo(::std::ostream* os) const { *os << "is an object whose given field "; matcher_.DescribeTo(os); } void DescribeNegationTo(::std::ostream* os) const { *os << "is an object whose given field "; matcher_.DescribeNegationTo(os); } template bool MatchAndExplain(const T& value, MatchResultListener* listener) const { return MatchAndExplainImpl( typename ::testing::internal:: is_pointer::type(), value, listener); } private: // The first argument of MatchAndExplainImpl() is needed to help // Symbian's C++ compiler choose which overload to use. Its type is // true_type iff the Field() matcher is used to match a pointer. bool MatchAndExplainImpl(false_type /* is_not_pointer */, const Class& obj, MatchResultListener* listener) const { *listener << "whose given field is "; return MatchPrintAndExplain(obj.*field_, matcher_, listener); } bool MatchAndExplainImpl(true_type /* is_pointer */, const Class* p, MatchResultListener* listener) const { if (p == NULL) return false; *listener << "which points to an object "; // Since *p has a field, it must be a class/struct/union type and // thus cannot be a pointer. Therefore we pass false_type() as // the first argument. return MatchAndExplainImpl(false_type(), *p, listener); } const FieldType Class::*field_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(FieldMatcher); }; // Implements the Property() matcher for matching a property // (i.e. return value of a getter method) of an object. template class PropertyMatcher { public: // The property may have a reference type, so 'const PropertyType&' // may cause double references and fail to compile. That's why we // need GTEST_REFERENCE_TO_CONST, which works regardless of // PropertyType being a reference or not. typedef GTEST_REFERENCE_TO_CONST_(PropertyType) RefToConstProperty; PropertyMatcher(PropertyType (Class::*property)() const, const Matcher& matcher) : property_(property), matcher_(matcher) {} void DescribeTo(::std::ostream* os) const { *os << "is an object whose given property "; matcher_.DescribeTo(os); } void DescribeNegationTo(::std::ostream* os) const { *os << "is an object whose given property "; matcher_.DescribeNegationTo(os); } template bool MatchAndExplain(const T&value, MatchResultListener* listener) const { return MatchAndExplainImpl( typename ::testing::internal:: is_pointer::type(), value, listener); } private: // The first argument of MatchAndExplainImpl() is needed to help // Symbian's C++ compiler choose which overload to use. Its type is // true_type iff the Property() matcher is used to match a pointer. bool MatchAndExplainImpl(false_type /* is_not_pointer */, const Class& obj, MatchResultListener* listener) const { *listener << "whose given property is "; // Cannot pass the return value (for example, int) to MatchPrintAndExplain, // which takes a non-const reference as argument. RefToConstProperty result = (obj.*property_)(); return MatchPrintAndExplain(result, matcher_, listener); } bool MatchAndExplainImpl(true_type /* is_pointer */, const Class* p, MatchResultListener* listener) const { if (p == NULL) return false; *listener << "which points to an object "; // Since *p has a property method, it must be a class/struct/union // type and thus cannot be a pointer. Therefore we pass // false_type() as the first argument. return MatchAndExplainImpl(false_type(), *p, listener); } PropertyType (Class::*property_)() const; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(PropertyMatcher); }; // Type traits specifying various features of different functors for ResultOf. // The default template specifies features for functor objects. // Functor classes have to typedef argument_type and result_type // to be compatible with ResultOf. template struct CallableTraits { typedef typename Functor::result_type ResultType; typedef Functor StorageType; static void CheckIsValid(Functor /* functor */) {} template static ResultType Invoke(Functor f, T arg) { return f(arg); } }; // Specialization for function pointers. template struct CallableTraits { typedef ResType ResultType; typedef ResType(*StorageType)(ArgType); static void CheckIsValid(ResType(*f)(ArgType)) { GTEST_CHECK_(f != NULL) << "NULL function pointer is passed into ResultOf()."; } template static ResType Invoke(ResType(*f)(ArgType), T arg) { return (*f)(arg); } }; // Implements the ResultOf() matcher for matching a return value of a // unary function of an object. template class ResultOfMatcher { public: typedef typename CallableTraits::ResultType ResultType; ResultOfMatcher(Callable callable, const Matcher& matcher) : callable_(callable), matcher_(matcher) { CallableTraits::CheckIsValid(callable_); } template operator Matcher() const { return Matcher(new Impl(callable_, matcher_)); } private: typedef typename CallableTraits::StorageType CallableStorageType; template class Impl : public MatcherInterface { public: Impl(CallableStorageType callable, const Matcher& matcher) : callable_(callable), matcher_(matcher) {} virtual void DescribeTo(::std::ostream* os) const { *os << "is mapped by the given callable to a value that "; matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "is mapped by the given callable to a value that "; matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(T obj, MatchResultListener* listener) const { *listener << "which is mapped by the given callable to "; // Cannot pass the return value (for example, int) to // MatchPrintAndExplain, which takes a non-const reference as argument. ResultType result = CallableTraits::template Invoke(callable_, obj); return MatchPrintAndExplain(result, matcher_, listener); } private: // Functors often define operator() as non-const method even though // they are actualy stateless. But we need to use them even when // 'this' is a const pointer. It's the user's responsibility not to // use stateful callables with ResultOf(), which does't guarantee // how many times the callable will be invoked. mutable CallableStorageType callable_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(Impl); }; // class Impl const CallableStorageType callable_; const Matcher matcher_; GTEST_DISALLOW_ASSIGN_(ResultOfMatcher); }; // Implements an equality matcher for any STL-style container whose elements // support ==. This matcher is like Eq(), but its failure explanations provide // more detailed information that is useful when the container is used as a set. // The failure message reports elements that are in one of the operands but not // the other. The failure messages do not report duplicate or out-of-order // elements in the containers (which don't properly matter to sets, but can // occur if the containers are vectors or lists, for example). // // Uses the container's const_iterator, value_type, operator ==, // begin(), and end(). template class ContainerEqMatcher { public: typedef internal::StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; // We make a copy of rhs in case the elements in it are modified // after this matcher is created. explicit ContainerEqMatcher(const Container& rhs) : rhs_(View::Copy(rhs)) { // Makes sure the user doesn't instantiate this class template // with a const or reference type. (void)testing::StaticAssertTypeEq(); } void DescribeTo(::std::ostream* os) const { *os << "equals "; UniversalPrint(rhs_, os); } void DescribeNegationTo(::std::ostream* os) const { *os << "does not equal "; UniversalPrint(rhs_, os); } template bool MatchAndExplain(const LhsContainer& lhs, MatchResultListener* listener) const { // GTEST_REMOVE_CONST_() is needed to work around an MSVC 8.0 bug // that causes LhsContainer to be a const type sometimes. typedef internal::StlContainerView LhsView; typedef typename LhsView::type LhsStlContainer; StlContainerReference lhs_stl_container = LhsView::ConstReference(lhs); if (lhs_stl_container == rhs_) return true; ::std::ostream* const os = listener->stream(); if (os != NULL) { // Something is different. Check for extra values first. bool printed_header = false; for (typename LhsStlContainer::const_iterator it = lhs_stl_container.begin(); it != lhs_stl_container.end(); ++it) { if (internal::ArrayAwareFind(rhs_.begin(), rhs_.end(), *it) == rhs_.end()) { if (printed_header) { *os << ", "; } else { *os << "which has these unexpected elements: "; printed_header = true; } UniversalPrint(*it, os); } } // Now check for missing values. bool printed_header2 = false; for (typename StlContainer::const_iterator it = rhs_.begin(); it != rhs_.end(); ++it) { if (internal::ArrayAwareFind( lhs_stl_container.begin(), lhs_stl_container.end(), *it) == lhs_stl_container.end()) { if (printed_header2) { *os << ", "; } else { *os << (printed_header ? ",\nand" : "which") << " doesn't have these expected elements: "; printed_header2 = true; } UniversalPrint(*it, os); } } } return false; } private: const StlContainer rhs_; GTEST_DISALLOW_ASSIGN_(ContainerEqMatcher); }; // Implements Pointwise(tuple_matcher, rhs_container). tuple_matcher // must be able to be safely cast to Matcher >, where T1 and T2 are the types of elements in the LHS // container and the RHS container respectively. template class PointwiseMatcher { public: typedef internal::StlContainerView RhsView; typedef typename RhsView::type RhsStlContainer; typedef typename RhsStlContainer::value_type RhsValue; // Like ContainerEq, we make a copy of rhs in case the elements in // it are modified after this matcher is created. PointwiseMatcher(const TupleMatcher& tuple_matcher, const RhsContainer& rhs) : tuple_matcher_(tuple_matcher), rhs_(RhsView::Copy(rhs)) { // Makes sure the user doesn't instantiate this class template // with a const or reference type. (void)testing::StaticAssertTypeEq(); } template operator Matcher() const { return MakeMatcher(new Impl(tuple_matcher_, rhs_)); } template class Impl : public MatcherInterface { public: typedef internal::StlContainerView< GTEST_REMOVE_REFERENCE_AND_CONST_(LhsContainer)> LhsView; typedef typename LhsView::type LhsStlContainer; typedef typename LhsView::const_reference LhsStlContainerReference; typedef typename LhsStlContainer::value_type LhsValue; // We pass the LHS value and the RHS value to the inner matcher by // reference, as they may be expensive to copy. We must use tuple // instead of pair here, as a pair cannot hold references (C++ 98, // 20.2.2 [lib.pairs]). typedef std::tr1::tuple InnerMatcherArg; Impl(const TupleMatcher& tuple_matcher, const RhsStlContainer& rhs) // mono_tuple_matcher_ holds a monomorphic version of the tuple matcher. : mono_tuple_matcher_(SafeMatcherCast(tuple_matcher)), rhs_(rhs) {} virtual void DescribeTo(::std::ostream* os) const { *os << "contains " << rhs_.size() << " values, where each value and its corresponding value in "; UniversalPrinter::Print(rhs_, os); *os << " "; mono_tuple_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't contain exactly " << rhs_.size() << " values, or contains a value x at some index i" << " where x and the i-th value of "; UniversalPrint(rhs_, os); *os << " "; mono_tuple_matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(LhsContainer lhs, MatchResultListener* listener) const { LhsStlContainerReference lhs_stl_container = LhsView::ConstReference(lhs); const size_t actual_size = lhs_stl_container.size(); if (actual_size != rhs_.size()) { *listener << "which contains " << actual_size << " values"; return false; } typename LhsStlContainer::const_iterator left = lhs_stl_container.begin(); typename RhsStlContainer::const_iterator right = rhs_.begin(); for (size_t i = 0; i != actual_size; ++i, ++left, ++right) { const InnerMatcherArg value_pair(*left, *right); if (listener->IsInterested()) { StringMatchResultListener inner_listener; if (!mono_tuple_matcher_.MatchAndExplain( value_pair, &inner_listener)) { *listener << "where the value pair ("; UniversalPrint(*left, listener->stream()); *listener << ", "; UniversalPrint(*right, listener->stream()); *listener << ") at index #" << i << " don't match"; PrintIfNotEmpty(inner_listener.str(), listener->stream()); return false; } } else { if (!mono_tuple_matcher_.Matches(value_pair)) return false; } } return true; } private: const Matcher mono_tuple_matcher_; const RhsStlContainer rhs_; GTEST_DISALLOW_ASSIGN_(Impl); }; private: const TupleMatcher tuple_matcher_; const RhsStlContainer rhs_; GTEST_DISALLOW_ASSIGN_(PointwiseMatcher); }; // Holds the logic common to ContainsMatcherImpl and EachMatcherImpl. template class QuantifierMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; typedef typename StlContainer::value_type Element; template explicit QuantifierMatcherImpl(InnerMatcher inner_matcher) : inner_matcher_( testing::SafeMatcherCast(inner_matcher)) {} // Checks whether: // * All elements in the container match, if all_elements_should_match. // * Any element in the container matches, if !all_elements_should_match. bool MatchAndExplainImpl(bool all_elements_should_match, Container container, MatchResultListener* listener) const { StlContainerReference stl_container = View::ConstReference(container); size_t i = 0; for (typename StlContainer::const_iterator it = stl_container.begin(); it != stl_container.end(); ++it, ++i) { StringMatchResultListener inner_listener; const bool matches = inner_matcher_.MatchAndExplain(*it, &inner_listener); if (matches != all_elements_should_match) { *listener << "whose element #" << i << (matches ? " matches" : " doesn't match"); PrintIfNotEmpty(inner_listener.str(), listener->stream()); return !all_elements_should_match; } } return all_elements_should_match; } protected: const Matcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(QuantifierMatcherImpl); }; // Implements Contains(element_matcher) for the given argument type Container. // Symmetric to EachMatcherImpl. template class ContainsMatcherImpl : public QuantifierMatcherImpl { public: template explicit ContainsMatcherImpl(InnerMatcher inner_matcher) : QuantifierMatcherImpl(inner_matcher) {} // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "contains at least one element that "; this->inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't contain any element that "; this->inner_matcher_.DescribeTo(os); } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { return this->MatchAndExplainImpl(false, container, listener); } private: GTEST_DISALLOW_ASSIGN_(ContainsMatcherImpl); }; // Implements Each(element_matcher) for the given argument type Container. // Symmetric to ContainsMatcherImpl. template class EachMatcherImpl : public QuantifierMatcherImpl { public: template explicit EachMatcherImpl(InnerMatcher inner_matcher) : QuantifierMatcherImpl(inner_matcher) {} // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "only contains elements that "; this->inner_matcher_.DescribeTo(os); } virtual void DescribeNegationTo(::std::ostream* os) const { *os << "contains some element that "; this->inner_matcher_.DescribeNegationTo(os); } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { return this->MatchAndExplainImpl(true, container, listener); } private: GTEST_DISALLOW_ASSIGN_(EachMatcherImpl); }; // Implements polymorphic Contains(element_matcher). template class ContainsMatcher { public: explicit ContainsMatcher(M m) : inner_matcher_(m) {} template operator Matcher() const { return MakeMatcher(new ContainsMatcherImpl(inner_matcher_)); } private: const M inner_matcher_; GTEST_DISALLOW_ASSIGN_(ContainsMatcher); }; // Implements polymorphic Each(element_matcher). template class EachMatcher { public: explicit EachMatcher(M m) : inner_matcher_(m) {} template operator Matcher() const { return MakeMatcher(new EachMatcherImpl(inner_matcher_)); } private: const M inner_matcher_; GTEST_DISALLOW_ASSIGN_(EachMatcher); }; // Implements Key(inner_matcher) for the given argument pair type. // Key(inner_matcher) matches an std::pair whose 'first' field matches // inner_matcher. For example, Contains(Key(Ge(5))) can be used to match an // std::map that contains at least one element whose key is >= 5. template class KeyMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(PairType) RawPairType; typedef typename RawPairType::first_type KeyType; template explicit KeyMatcherImpl(InnerMatcher inner_matcher) : inner_matcher_( testing::SafeMatcherCast(inner_matcher)) { } // Returns true iff 'key_value.first' (the key) matches the inner matcher. virtual bool MatchAndExplain(PairType key_value, MatchResultListener* listener) const { StringMatchResultListener inner_listener; const bool match = inner_matcher_.MatchAndExplain(key_value.first, &inner_listener); const internal::string explanation = inner_listener.str(); if (explanation != "") { *listener << "whose first field is a value " << explanation; } return match; } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "has a key that "; inner_matcher_.DescribeTo(os); } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "doesn't have a key that "; inner_matcher_.DescribeTo(os); } private: const Matcher inner_matcher_; GTEST_DISALLOW_ASSIGN_(KeyMatcherImpl); }; // Implements polymorphic Key(matcher_for_key). template class KeyMatcher { public: explicit KeyMatcher(M m) : matcher_for_key_(m) {} template operator Matcher() const { return MakeMatcher(new KeyMatcherImpl(matcher_for_key_)); } private: const M matcher_for_key_; GTEST_DISALLOW_ASSIGN_(KeyMatcher); }; // Implements Pair(first_matcher, second_matcher) for the given argument pair // type with its two matchers. See Pair() function below. template class PairMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(PairType) RawPairType; typedef typename RawPairType::first_type FirstType; typedef typename RawPairType::second_type SecondType; template PairMatcherImpl(FirstMatcher first_matcher, SecondMatcher second_matcher) : first_matcher_( testing::SafeMatcherCast(first_matcher)), second_matcher_( testing::SafeMatcherCast(second_matcher)) { } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { *os << "has a first field that "; first_matcher_.DescribeTo(os); *os << ", and has a second field that "; second_matcher_.DescribeTo(os); } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { *os << "has a first field that "; first_matcher_.DescribeNegationTo(os); *os << ", or has a second field that "; second_matcher_.DescribeNegationTo(os); } // Returns true iff 'a_pair.first' matches first_matcher and 'a_pair.second' // matches second_matcher. virtual bool MatchAndExplain(PairType a_pair, MatchResultListener* listener) const { if (!listener->IsInterested()) { // If the listener is not interested, we don't need to construct the // explanation. return first_matcher_.Matches(a_pair.first) && second_matcher_.Matches(a_pair.second); } StringMatchResultListener first_inner_listener; if (!first_matcher_.MatchAndExplain(a_pair.first, &first_inner_listener)) { *listener << "whose first field does not match"; PrintIfNotEmpty(first_inner_listener.str(), listener->stream()); return false; } StringMatchResultListener second_inner_listener; if (!second_matcher_.MatchAndExplain(a_pair.second, &second_inner_listener)) { *listener << "whose second field does not match"; PrintIfNotEmpty(second_inner_listener.str(), listener->stream()); return false; } ExplainSuccess(first_inner_listener.str(), second_inner_listener.str(), listener); return true; } private: void ExplainSuccess(const internal::string& first_explanation, const internal::string& second_explanation, MatchResultListener* listener) const { *listener << "whose both fields match"; if (first_explanation != "") { *listener << ", where the first field is a value " << first_explanation; } if (second_explanation != "") { *listener << ", "; if (first_explanation != "") { *listener << "and "; } else { *listener << "where "; } *listener << "the second field is a value " << second_explanation; } } const Matcher first_matcher_; const Matcher second_matcher_; GTEST_DISALLOW_ASSIGN_(PairMatcherImpl); }; // Implements polymorphic Pair(first_matcher, second_matcher). template class PairMatcher { public: PairMatcher(FirstMatcher first_matcher, SecondMatcher second_matcher) : first_matcher_(first_matcher), second_matcher_(second_matcher) {} template operator Matcher () const { return MakeMatcher( new PairMatcherImpl( first_matcher_, second_matcher_)); } private: const FirstMatcher first_matcher_; const SecondMatcher second_matcher_; GTEST_DISALLOW_ASSIGN_(PairMatcher); }; // Implements ElementsAre() and ElementsAreArray(). template class ElementsAreMatcherImpl : public MatcherInterface { public: typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef internal::StlContainerView View; typedef typename View::type StlContainer; typedef typename View::const_reference StlContainerReference; typedef typename StlContainer::value_type Element; // Constructs the matcher from a sequence of element values or // element matchers. template ElementsAreMatcherImpl(InputIter first, size_t a_count) { matchers_.reserve(a_count); InputIter it = first; for (size_t i = 0; i != a_count; ++i, ++it) { matchers_.push_back(MatcherCast(*it)); } } // Describes what this matcher does. virtual void DescribeTo(::std::ostream* os) const { if (count() == 0) { *os << "is empty"; } else if (count() == 1) { *os << "has 1 element that "; matchers_[0].DescribeTo(os); } else { *os << "has " << Elements(count()) << " where\n"; for (size_t i = 0; i != count(); ++i) { *os << "element #" << i << " "; matchers_[i].DescribeTo(os); if (i + 1 < count()) { *os << ",\n"; } } } } // Describes what the negation of this matcher does. virtual void DescribeNegationTo(::std::ostream* os) const { if (count() == 0) { *os << "isn't empty"; return; } *os << "doesn't have " << Elements(count()) << ", or\n"; for (size_t i = 0; i != count(); ++i) { *os << "element #" << i << " "; matchers_[i].DescribeNegationTo(os); if (i + 1 < count()) { *os << ", or\n"; } } } virtual bool MatchAndExplain(Container container, MatchResultListener* listener) const { StlContainerReference stl_container = View::ConstReference(container); const size_t actual_count = stl_container.size(); if (actual_count != count()) { // The element count doesn't match. If the container is empty, // there's no need to explain anything as Google Mock already // prints the empty container. Otherwise we just need to show // how many elements there actually are. if (actual_count != 0) { *listener << "which has " << Elements(actual_count); } return false; } typename StlContainer::const_iterator it = stl_container.begin(); // explanations[i] is the explanation of the element at index i. std::vector explanations(count()); for (size_t i = 0; i != count(); ++it, ++i) { StringMatchResultListener s; if (matchers_[i].MatchAndExplain(*it, &s)) { explanations[i] = s.str(); } else { // The container has the right size but the i-th element // doesn't match its expectation. *listener << "whose element #" << i << " doesn't match"; PrintIfNotEmpty(s.str(), listener->stream()); return false; } } // Every element matches its expectation. We need to explain why // (the obvious ones can be skipped). bool reason_printed = false; for (size_t i = 0; i != count(); ++i) { const internal::string& s = explanations[i]; if (!s.empty()) { if (reason_printed) { *listener << ",\nand "; } *listener << "whose element #" << i << " matches, " << s; reason_printed = true; } } return true; } private: static Message Elements(size_t count) { return Message() << count << (count == 1 ? " element" : " elements"); } size_t count() const { return matchers_.size(); } std::vector > matchers_; GTEST_DISALLOW_ASSIGN_(ElementsAreMatcherImpl); }; // Implements ElementsAre() of 0 arguments. class ElementsAreMatcher0 { public: ElementsAreMatcher0() {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; const Matcher* const matchers = NULL; return MakeMatcher(new ElementsAreMatcherImpl(matchers, 0)); } }; // Implements ElementsAreArray(). template class ElementsAreArrayMatcher { public: ElementsAreArrayMatcher(const T* first, size_t count) : first_(first), count_(count) {} template operator Matcher() const { typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer; typedef typename internal::StlContainerView::type::value_type Element; return MakeMatcher(new ElementsAreMatcherImpl(first_, count_)); } private: const T* const first_; const size_t count_; GTEST_DISALLOW_ASSIGN_(ElementsAreArrayMatcher); }; // Returns the description for a matcher defined using the MATCHER*() // macro where the user-supplied description string is "", if // 'negation' is false; otherwise returns the description of the // negation of the matcher. 'param_values' contains a list of strings // that are the print-out of the matcher's parameters. string FormatMatcherDescription(bool negation, const char* matcher_name, const Strings& param_values); } // namespace internal // Implements MatcherCast(). template inline Matcher MatcherCast(M matcher) { return internal::MatcherCastImpl::Cast(matcher); } // _ is a matcher that matches anything of any type. // // This definition is fine as: // // 1. The C++ standard permits using the name _ in a namespace that // is not the global namespace or ::std. // 2. The AnythingMatcher class has no data member or constructor, // so it's OK to create global variables of this type. // 3. c-style has approved of using _ in this case. const internal::AnythingMatcher _ = {}; // Creates a matcher that matches any value of the given type T. template inline Matcher A() { return MakeMatcher(new internal::AnyMatcherImpl()); } // Creates a matcher that matches any value of the given type T. template inline Matcher An() { return A(); } // Creates a polymorphic matcher that matches anything equal to x. // Note: if the parameter of Eq() were declared as const T&, Eq("foo") // wouldn't compile. template inline internal::EqMatcher Eq(T x) { return internal::EqMatcher(x); } // Constructs a Matcher from a 'value' of type T. The constructed // matcher matches any value that's equal to 'value'. template Matcher::Matcher(T value) { *this = Eq(value); } // Creates a monomorphic matcher that matches anything with type Lhs // and equal to rhs. A user may need to use this instead of Eq(...) // in order to resolve an overloading ambiguity. // // TypedEq(x) is just a convenient short-hand for Matcher(Eq(x)) // or Matcher(x), but more readable than the latter. // // We could define similar monomorphic matchers for other comparison // operations (e.g. TypedLt, TypedGe, and etc), but decided not to do // it yet as those are used much less than Eq() in practice. A user // can always write Matcher(Lt(5)) to be explicit about the type, // for example. template inline Matcher TypedEq(const Rhs& rhs) { return Eq(rhs); } // Creates a polymorphic matcher that matches anything >= x. template inline internal::GeMatcher Ge(Rhs x) { return internal::GeMatcher(x); } // Creates a polymorphic matcher that matches anything > x. template inline internal::GtMatcher Gt(Rhs x) { return internal::GtMatcher(x); } // Creates a polymorphic matcher that matches anything <= x. template inline internal::LeMatcher Le(Rhs x) { return internal::LeMatcher(x); } // Creates a polymorphic matcher that matches anything < x. template inline internal::LtMatcher Lt(Rhs x) { return internal::LtMatcher(x); } // Creates a polymorphic matcher that matches anything != x. template inline internal::NeMatcher Ne(Rhs x) { return internal::NeMatcher(x); } // Creates a polymorphic matcher that matches any NULL pointer. inline PolymorphicMatcher IsNull() { return MakePolymorphicMatcher(internal::IsNullMatcher()); } // Creates a polymorphic matcher that matches any non-NULL pointer. // This is convenient as Not(NULL) doesn't compile (the compiler // thinks that that expression is comparing a pointer with an integer). inline PolymorphicMatcher NotNull() { return MakePolymorphicMatcher(internal::NotNullMatcher()); } // Creates a polymorphic matcher that matches any argument that // references variable x. template inline internal::RefMatcher Ref(T& x) { // NOLINT return internal::RefMatcher(x); } // Creates a matcher that matches any double argument approximately // equal to rhs, where two NANs are considered unequal. inline internal::FloatingEqMatcher DoubleEq(double rhs) { return internal::FloatingEqMatcher(rhs, false); } // Creates a matcher that matches any double argument approximately // equal to rhs, including NaN values when rhs is NaN. inline internal::FloatingEqMatcher NanSensitiveDoubleEq(double rhs) { return internal::FloatingEqMatcher(rhs, true); } // Creates a matcher that matches any float argument approximately // equal to rhs, where two NANs are considered unequal. inline internal::FloatingEqMatcher FloatEq(float rhs) { return internal::FloatingEqMatcher(rhs, false); } // Creates a matcher that matches any double argument approximately // equal to rhs, including NaN values when rhs is NaN. inline internal::FloatingEqMatcher NanSensitiveFloatEq(float rhs) { return internal::FloatingEqMatcher(rhs, true); } // Creates a matcher that matches a pointer (raw or smart) that points // to a value that matches inner_matcher. template inline internal::PointeeMatcher Pointee( const InnerMatcher& inner_matcher) { return internal::PointeeMatcher(inner_matcher); } // Creates a matcher that matches an object whose given field matches // 'matcher'. For example, // Field(&Foo::number, Ge(5)) // matches a Foo object x iff x.number >= 5. template inline PolymorphicMatcher< internal::FieldMatcher > Field( FieldType Class::*field, const FieldMatcher& matcher) { return MakePolymorphicMatcher( internal::FieldMatcher( field, MatcherCast(matcher))); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // Field(&Foo::bar, m) // to compile where bar is an int32 and m is a matcher for int64. } // Creates a matcher that matches an object whose given property // matches 'matcher'. For example, // Property(&Foo::str, StartsWith("hi")) // matches a Foo object x iff x.str() starts with "hi". template inline PolymorphicMatcher< internal::PropertyMatcher > Property( PropertyType (Class::*property)() const, const PropertyMatcher& matcher) { return MakePolymorphicMatcher( internal::PropertyMatcher( property, MatcherCast(matcher))); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // Property(&Foo::bar, m) // to compile where bar() returns an int32 and m is a matcher for int64. } // Creates a matcher that matches an object iff the result of applying // a callable to x matches 'matcher'. // For example, // ResultOf(f, StartsWith("hi")) // matches a Foo object x iff f(x) starts with "hi". // callable parameter can be a function, function pointer, or a functor. // Callable has to satisfy the following conditions: // * It is required to keep no state affecting the results of // the calls on it and make no assumptions about how many calls // will be made. Any state it keeps must be protected from the // concurrent access. // * If it is a function object, it has to define type result_type. // We recommend deriving your functor classes from std::unary_function. template internal::ResultOfMatcher ResultOf( Callable callable, const ResultOfMatcher& matcher) { return internal::ResultOfMatcher( callable, MatcherCast::ResultType>( matcher)); // The call to MatcherCast() is required for supporting inner // matchers of compatible types. For example, it allows // ResultOf(Function, m) // to compile where Function() returns an int32 and m is a matcher for int64. } // String matchers. // Matches a string equal to str. inline PolymorphicMatcher > StrEq(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, true)); } // Matches a string not equal to str. inline PolymorphicMatcher > StrNe(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, true)); } // Matches a string equal to str, ignoring case. inline PolymorphicMatcher > StrCaseEq(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, false)); } // Matches a string not equal to str, ignoring case. inline PolymorphicMatcher > StrCaseNe(const internal::string& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, false)); } // Creates a matcher that matches any string, std::string, or C string // that contains the given substring. inline PolymorphicMatcher > HasSubstr(const internal::string& substring) { return MakePolymorphicMatcher(internal::HasSubstrMatcher( substring)); } // Matches a string that starts with 'prefix' (case-sensitive). inline PolymorphicMatcher > StartsWith(const internal::string& prefix) { return MakePolymorphicMatcher(internal::StartsWithMatcher( prefix)); } // Matches a string that ends with 'suffix' (case-sensitive). inline PolymorphicMatcher > EndsWith(const internal::string& suffix) { return MakePolymorphicMatcher(internal::EndsWithMatcher( suffix)); } // Matches a string that fully matches regular expression 'regex'. // The matcher takes ownership of 'regex'. inline PolymorphicMatcher MatchesRegex( const internal::RE* regex) { return MakePolymorphicMatcher(internal::MatchesRegexMatcher(regex, true)); } inline PolymorphicMatcher MatchesRegex( const internal::string& regex) { return MatchesRegex(new internal::RE(regex)); } // Matches a string that contains regular expression 'regex'. // The matcher takes ownership of 'regex'. inline PolymorphicMatcher ContainsRegex( const internal::RE* regex) { return MakePolymorphicMatcher(internal::MatchesRegexMatcher(regex, false)); } inline PolymorphicMatcher ContainsRegex( const internal::string& regex) { return ContainsRegex(new internal::RE(regex)); } #if GTEST_HAS_GLOBAL_WSTRING || GTEST_HAS_STD_WSTRING // Wide string matchers. // Matches a string equal to str. inline PolymorphicMatcher > StrEq(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, true)); } // Matches a string not equal to str. inline PolymorphicMatcher > StrNe(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, true)); } // Matches a string equal to str, ignoring case. inline PolymorphicMatcher > StrCaseEq(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, true, false)); } // Matches a string not equal to str, ignoring case. inline PolymorphicMatcher > StrCaseNe(const internal::wstring& str) { return MakePolymorphicMatcher(internal::StrEqualityMatcher( str, false, false)); } // Creates a matcher that matches any wstring, std::wstring, or C wide string // that contains the given substring. inline PolymorphicMatcher > HasSubstr(const internal::wstring& substring) { return MakePolymorphicMatcher(internal::HasSubstrMatcher( substring)); } // Matches a string that starts with 'prefix' (case-sensitive). inline PolymorphicMatcher > StartsWith(const internal::wstring& prefix) { return MakePolymorphicMatcher(internal::StartsWithMatcher( prefix)); } // Matches a string that ends with 'suffix' (case-sensitive). inline PolymorphicMatcher > EndsWith(const internal::wstring& suffix) { return MakePolymorphicMatcher(internal::EndsWithMatcher( suffix)); } #endif // GTEST_HAS_GLOBAL_WSTRING || GTEST_HAS_STD_WSTRING // Creates a polymorphic matcher that matches a 2-tuple where the // first field == the second field. inline internal::Eq2Matcher Eq() { return internal::Eq2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field >= the second field. inline internal::Ge2Matcher Ge() { return internal::Ge2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field > the second field. inline internal::Gt2Matcher Gt() { return internal::Gt2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field <= the second field. inline internal::Le2Matcher Le() { return internal::Le2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field < the second field. inline internal::Lt2Matcher Lt() { return internal::Lt2Matcher(); } // Creates a polymorphic matcher that matches a 2-tuple where the // first field != the second field. inline internal::Ne2Matcher Ne() { return internal::Ne2Matcher(); } // Creates a matcher that matches any value of type T that m doesn't // match. template inline internal::NotMatcher Not(InnerMatcher m) { return internal::NotMatcher(m); } // Returns a matcher that matches anything that satisfies the given // predicate. The predicate can be any unary function or functor // whose return type can be implicitly converted to bool. template inline PolymorphicMatcher > Truly(Predicate pred) { return MakePolymorphicMatcher(internal::TrulyMatcher(pred)); } // Returns a matcher that matches an equal container. // This matcher behaves like Eq(), but in the event of mismatch lists the // values that are included in one container but not the other. (Duplicate // values and order differences are not explained.) template inline PolymorphicMatcher > ContainerEq(const Container& rhs) { // This following line is for working around a bug in MSVC 8.0, // which causes Container to be a const type sometimes. typedef GTEST_REMOVE_CONST_(Container) RawContainer; return MakePolymorphicMatcher( internal::ContainerEqMatcher(rhs)); } // Matches an STL-style container or a native array that contains the // same number of elements as in rhs, where its i-th element and rhs's // i-th element (as a pair) satisfy the given pair matcher, for all i. // TupleMatcher must be able to be safely cast to Matcher >, where T1 and T2 are the types of elements in the // LHS container and the RHS container respectively. template inline internal::PointwiseMatcher Pointwise(const TupleMatcher& tuple_matcher, const Container& rhs) { // This following line is for working around a bug in MSVC 8.0, // which causes Container to be a const type sometimes. typedef GTEST_REMOVE_CONST_(Container) RawContainer; return internal::PointwiseMatcher( tuple_matcher, rhs); } // Matches an STL-style container or a native array that contains at // least one element matching the given value or matcher. // // Examples: // ::std::set page_ids; // page_ids.insert(3); // page_ids.insert(1); // EXPECT_THAT(page_ids, Contains(1)); // EXPECT_THAT(page_ids, Contains(Gt(2))); // EXPECT_THAT(page_ids, Not(Contains(4))); // // ::std::map page_lengths; // page_lengths[1] = 100; // EXPECT_THAT(page_lengths, // Contains(::std::pair(1, 100))); // // const char* user_ids[] = { "joe", "mike", "tom" }; // EXPECT_THAT(user_ids, Contains(Eq(::std::string("tom")))); template inline internal::ContainsMatcher Contains(M matcher) { return internal::ContainsMatcher(matcher); } // Matches an STL-style container or a native array that contains only // elements matching the given value or matcher. // // Each(m) is semantically equivalent to Not(Contains(Not(m))). Only // the messages are different. // // Examples: // ::std::set page_ids; // // Each(m) matches an empty container, regardless of what m is. // EXPECT_THAT(page_ids, Each(Eq(1))); // EXPECT_THAT(page_ids, Each(Eq(77))); // // page_ids.insert(3); // EXPECT_THAT(page_ids, Each(Gt(0))); // EXPECT_THAT(page_ids, Not(Each(Gt(4)))); // page_ids.insert(1); // EXPECT_THAT(page_ids, Not(Each(Lt(2)))); // // ::std::map page_lengths; // page_lengths[1] = 100; // page_lengths[2] = 200; // page_lengths[3] = 300; // EXPECT_THAT(page_lengths, Not(Each(Pair(1, 100)))); // EXPECT_THAT(page_lengths, Each(Key(Le(3)))); // // const char* user_ids[] = { "joe", "mike", "tom" }; // EXPECT_THAT(user_ids, Not(Each(Eq(::std::string("tom"))))); template inline internal::EachMatcher Each(M matcher) { return internal::EachMatcher(matcher); } // Key(inner_matcher) matches an std::pair whose 'first' field matches // inner_matcher. For example, Contains(Key(Ge(5))) can be used to match an // std::map that contains at least one element whose key is >= 5. template inline internal::KeyMatcher Key(M inner_matcher) { return internal::KeyMatcher(inner_matcher); } // Pair(first_matcher, second_matcher) matches a std::pair whose 'first' field // matches first_matcher and whose 'second' field matches second_matcher. For // example, EXPECT_THAT(map_type, ElementsAre(Pair(Ge(5), "foo"))) can be used // to match a std::map that contains exactly one element whose key // is >= 5 and whose value equals "foo". template inline internal::PairMatcher Pair(FirstMatcher first_matcher, SecondMatcher second_matcher) { return internal::PairMatcher( first_matcher, second_matcher); } // Returns a predicate that is satisfied by anything that matches the // given matcher. template inline internal::MatcherAsPredicate Matches(M matcher) { return internal::MatcherAsPredicate(matcher); } // Returns true iff the value matches the matcher. template inline bool Value(const T& value, M matcher) { return testing::Matches(matcher)(value); } // Matches the value against the given matcher and explains the match // result to listener. template inline bool ExplainMatchResult( M matcher, const T& value, MatchResultListener* listener) { return SafeMatcherCast(matcher).MatchAndExplain(value, listener); } // AllArgs(m) is a synonym of m. This is useful in // // EXPECT_CALL(foo, Bar(_, _)).With(AllArgs(Eq())); // // which is easier to read than // // EXPECT_CALL(foo, Bar(_, _)).With(Eq()); template inline InnerMatcher AllArgs(const InnerMatcher& matcher) { return matcher; } // These macros allow using matchers to check values in Google Test // tests. ASSERT_THAT(value, matcher) and EXPECT_THAT(value, matcher) // succeed iff the value matches the matcher. If the assertion fails, // the value and the description of the matcher will be printed. #define ASSERT_THAT(value, matcher) ASSERT_PRED_FORMAT1(\ ::testing::internal::MakePredicateFormatterFromMatcher(matcher), value) #define EXPECT_THAT(value, matcher) EXPECT_PRED_FORMAT1(\ ::testing::internal::MakePredicateFormatterFromMatcher(matcher), value) } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-more-actions.h0000600000175000017500000002122311561126632026004 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements some actions that depend on gmock-generated-actions.h. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ #include #include "gmock/gmock-generated-actions.h" namespace testing { namespace internal { // Implements the Invoke(f) action. The template argument // FunctionImpl is the implementation type of f, which can be either a // function pointer or a functor. Invoke(f) can be used as an // Action as long as f's type is compatible with F (i.e. f can be // assigned to a tr1::function). template class InvokeAction { public: // The c'tor makes a copy of function_impl (either a function // pointer or a functor). explicit InvokeAction(FunctionImpl function_impl) : function_impl_(function_impl) {} template Result Perform(const ArgumentTuple& args) { return InvokeHelper::Invoke(function_impl_, args); } private: FunctionImpl function_impl_; GTEST_DISALLOW_ASSIGN_(InvokeAction); }; // Implements the Invoke(object_ptr, &Class::Method) action. template class InvokeMethodAction { public: InvokeMethodAction(Class* obj_ptr, MethodPtr method_ptr) : obj_ptr_(obj_ptr), method_ptr_(method_ptr) {} template Result Perform(const ArgumentTuple& args) const { return InvokeHelper::InvokeMethod( obj_ptr_, method_ptr_, args); } private: Class* const obj_ptr_; const MethodPtr method_ptr_; GTEST_DISALLOW_ASSIGN_(InvokeMethodAction); }; } // namespace internal // Various overloads for Invoke(). // Creates an action that invokes 'function_impl' with the mock // function's arguments. template PolymorphicAction > Invoke( FunctionImpl function_impl) { return MakePolymorphicAction( internal::InvokeAction(function_impl)); } // Creates an action that invokes the given method on the given object // with the mock function's arguments. template PolymorphicAction > Invoke( Class* obj_ptr, MethodPtr method_ptr) { return MakePolymorphicAction( internal::InvokeMethodAction(obj_ptr, method_ptr)); } // WithoutArgs(inner_action) can be used in a mock function with a // non-empty argument list to perform inner_action, which takes no // argument. In other words, it adapts an action accepting no // argument to one that accepts (and ignores) arguments. template inline internal::WithArgsAction WithoutArgs(const InnerAction& action) { return internal::WithArgsAction(action); } // WithArg(an_action) creates an action that passes the k-th // (0-based) argument of the mock function to an_action and performs // it. It adapts an action accepting one argument to one that accepts // multiple arguments. For convenience, we also provide // WithArgs(an_action) (defined below) as a synonym. template inline internal::WithArgsAction WithArg(const InnerAction& action) { return internal::WithArgsAction(action); } // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Action ReturnArg() returns the k-th argument of the mock function. ACTION_TEMPLATE(ReturnArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { return std::tr1::get(args); } // Action SaveArg(pointer) saves the k-th (0-based) argument of the // mock function to *pointer. ACTION_TEMPLATE(SaveArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(pointer)) { *pointer = ::std::tr1::get(args); } // Action SaveArgPointee(pointer) saves the value pointed to // by the k-th (0-based) argument of the mock function to *pointer. ACTION_TEMPLATE(SaveArgPointee, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(pointer)) { *pointer = *::std::tr1::get(args); } // Action SetArgReferee(value) assigns 'value' to the variable // referenced by the k-th (0-based) argument of the mock function. ACTION_TEMPLATE(SetArgReferee, HAS_1_TEMPLATE_PARAMS(int, k), AND_1_VALUE_PARAMS(value)) { typedef typename ::std::tr1::tuple_element::type argk_type; // Ensures that argument #k is a reference. If you get a compiler // error on the next line, you are using SetArgReferee(value) in // a mock function whose k-th (0-based) argument is not a reference. GTEST_COMPILE_ASSERT_(internal::is_reference::value, SetArgReferee_must_be_used_with_a_reference_argument); ::std::tr1::get(args) = value; } // Action SetArrayArgument(first, last) copies the elements in // source range [first, last) to the array pointed to by the k-th // (0-based) argument, which can be either a pointer or an // iterator. The action does not take ownership of the elements in the // source range. ACTION_TEMPLATE(SetArrayArgument, HAS_1_TEMPLATE_PARAMS(int, k), AND_2_VALUE_PARAMS(first, last)) { // Microsoft compiler deprecates ::std::copy, so we want to suppress warning // 4996 (Function call with parameters that may be unsafe) there. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. #endif ::std::copy(first, last, ::std::tr1::get(args)); #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif } // Action DeleteArg() deletes the k-th (0-based) argument of the mock // function. ACTION_TEMPLATE(DeleteArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { delete ::std::tr1::get(args); } // This action returns the value pointed to by 'pointer'. ACTION_P(ReturnPointee, pointer) { return *pointer; } // Action Throw(exception) can be used in a mock function of any type // to throw the given exception. Any copyable value can be thrown. #if GTEST_HAS_EXCEPTIONS // Suppresses the 'unreachable code' warning that VC generates in opt modes. # ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4702) // Temporarily disables warning 4702. # endif ACTION_P(Throw, exception) { throw exception; } # ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. # endif #endif // GTEST_HAS_EXCEPTIONS #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock-spec-builders.h0000600000175000017500000017706011561126632026160 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements the ON_CALL() and EXPECT_CALL() macros. // // A user can use the ON_CALL() macro to specify the default action of // a mock method. The syntax is: // // ON_CALL(mock_object, Method(argument-matchers)) // .With(multi-argument-matcher) // .WillByDefault(action); // // where the .With() clause is optional. // // A user can use the EXPECT_CALL() macro to specify an expectation on // a mock method. The syntax is: // // EXPECT_CALL(mock_object, Method(argument-matchers)) // .With(multi-argument-matchers) // .Times(cardinality) // .InSequence(sequences) // .After(expectations) // .WillOnce(action) // .WillRepeatedly(action) // .RetiresOnSaturation(); // // where all clauses are optional, and .InSequence()/.After()/ // .WillOnce() can appear any number of times. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ #include #include #include #include #include #include "gmock/gmock-actions.h" #include "gmock/gmock-cardinalities.h" #include "gmock/gmock-matchers.h" #include "gmock/internal/gmock-internal-utils.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" namespace testing { // An abstract handle of an expectation. class Expectation; // A set of expectation handles. class ExpectationSet; // Anything inside the 'internal' namespace IS INTERNAL IMPLEMENTATION // and MUST NOT BE USED IN USER CODE!!! namespace internal { // Implements a mock function. template class FunctionMocker; // Base class for expectations. class ExpectationBase; // Implements an expectation. template class TypedExpectation; // Helper class for testing the Expectation class template. class ExpectationTester; // Base class for function mockers. template class FunctionMockerBase; // Protects the mock object registry (in class Mock), all function // mockers, and all expectations. // // The reason we don't use more fine-grained protection is: when a // mock function Foo() is called, it needs to consult its expectations // to see which one should be picked. If another thread is allowed to // call a mock function (either Foo() or a different one) at the same // time, it could affect the "retired" attributes of Foo()'s // expectations when InSequence() is used, and thus affect which // expectation gets picked. Therefore, we sequence all mock function // calls to ensure the integrity of the mock objects' states. GTEST_DECLARE_STATIC_MUTEX_(g_gmock_mutex); // Untyped base class for ActionResultHolder. class UntypedActionResultHolderBase; // Abstract base class of FunctionMockerBase. This is the // type-agnostic part of the function mocker interface. Its pure // virtual methods are implemented by FunctionMockerBase. class UntypedFunctionMockerBase { public: UntypedFunctionMockerBase(); virtual ~UntypedFunctionMockerBase(); // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex bool VerifyAndClearExpectationsLocked(); // Clears the ON_CALL()s set on this mock function. // L >= g_gmock_mutex virtual void ClearDefaultActionsLocked() = 0; // In all of the following Untyped* functions, it's the caller's // responsibility to guarantee the correctness of the arguments' // types. // Performs the default action with the given arguments and returns // the action's result. The call description string will be used in // the error message to describe the call in the case the default // action fails. // L = * virtual UntypedActionResultHolderBase* UntypedPerformDefaultAction( const void* untyped_args, const string& call_description) const = 0; // Performs the given action with the given arguments and returns // the action's result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformAction( const void* untyped_action, const void* untyped_args) const = 0; // Writes a message that the call is uninteresting (i.e. neither // explicitly expected nor explicitly unexpected) to the given // ostream. // L < g_gmock_mutex virtual void UntypedDescribeUninterestingCall(const void* untyped_args, ::std::ostream* os) const = 0; // Returns the expectation that matches the given function arguments // (or NULL is there's no match); when a match is found, // untyped_action is set to point to the action that should be // performed (or NULL if the action is "do default"), and // is_excessive is modified to indicate whether the call exceeds the // expected number. // L < g_gmock_mutex virtual const ExpectationBase* UntypedFindMatchingExpectation( const void* untyped_args, const void** untyped_action, bool* is_excessive, ::std::ostream* what, ::std::ostream* why) = 0; // Prints the given function arguments to the ostream. virtual void UntypedPrintArgs(const void* untyped_args, ::std::ostream* os) const = 0; // Sets the mock object this mock method belongs to, and registers // this information in the global mock registry. Will be called // whenever an EXPECT_CALL() or ON_CALL() is executed on this mock // method. // TODO(wan@google.com): rename to SetAndRegisterOwner(). // L < g_gmock_mutex void RegisterOwner(const void* mock_obj); // Sets the mock object this mock method belongs to, and sets the // name of the mock function. Will be called upon each invocation // of this mock function. // L < g_gmock_mutex void SetOwnerAndName(const void* mock_obj, const char* name); // Returns the mock object this mock method belongs to. Must be // called after RegisterOwner() or SetOwnerAndName() has been // called. // L < g_gmock_mutex const void* MockObject() const; // Returns the name of this mock method. Must be called after // SetOwnerAndName() has been called. // L < g_gmock_mutex const char* Name() const; // Returns the result of invoking this mock function with the given // arguments. This function can be safely called from multiple // threads concurrently. The caller is responsible for deleting the // result. // L < g_gmock_mutex const UntypedActionResultHolderBase* UntypedInvokeWith( const void* untyped_args); protected: typedef std::vector UntypedOnCallSpecs; typedef std::vector > UntypedExpectations; // Returns an Expectation object that references and co-owns exp, // which must be an expectation on this mock function. Expectation GetHandleOf(ExpectationBase* exp); // Address of the mock object this mock method belongs to. Only // valid after this mock method has been called or // ON_CALL/EXPECT_CALL has been invoked on it. const void* mock_obj_; // Protected by g_gmock_mutex. // Name of the function being mocked. Only valid after this mock // method has been called. const char* name_; // Protected by g_gmock_mutex. // All default action specs for this function mocker. UntypedOnCallSpecs untyped_on_call_specs_; // All expectations for this function mocker. UntypedExpectations untyped_expectations_; }; // class UntypedFunctionMockerBase // Untyped base class for OnCallSpec. class UntypedOnCallSpecBase { public: // The arguments are the location of the ON_CALL() statement. UntypedOnCallSpecBase(const char* a_file, int a_line) : file_(a_file), line_(a_line), last_clause_(kNone) {} // Where in the source file was the default action spec defined? const char* file() const { return file_; } int line() const { return line_; } protected: // Gives each clause in the ON_CALL() statement a name. enum Clause { // Do not change the order of the enum members! The run-time // syntax checking relies on it. kNone, kWith, kWillByDefault }; // Asserts that the ON_CALL() statement has a certain property. void AssertSpecProperty(bool property, const string& failure_message) const { Assert(property, file_, line_, failure_message); } // Expects that the ON_CALL() statement has a certain property. void ExpectSpecProperty(bool property, const string& failure_message) const { Expect(property, file_, line_, failure_message); } const char* file_; int line_; // The last clause in the ON_CALL() statement as seen so far. // Initially kNone and changes as the statement is parsed. Clause last_clause_; }; // class UntypedOnCallSpecBase // This template class implements an ON_CALL spec. template class OnCallSpec : public UntypedOnCallSpecBase { public: typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; // Constructs an OnCallSpec object from the information inside // the parenthesis of an ON_CALL() statement. OnCallSpec(const char* a_file, int a_line, const ArgumentMatcherTuple& matchers) : UntypedOnCallSpecBase(a_file, a_line), matchers_(matchers), // By default, extra_matcher_ should match anything. However, // we cannot initialize it with _ as that triggers a compiler // bug in Symbian's C++ compiler (cannot decide between two // overloaded constructors of Matcher). extra_matcher_(A()) { } // Implements the .With() clause. OnCallSpec& With(const Matcher& m) { // Makes sure this is called at most once. ExpectSpecProperty(last_clause_ < kWith, ".With() cannot appear " "more than once in an ON_CALL()."); last_clause_ = kWith; extra_matcher_ = m; return *this; } // Implements the .WillByDefault() clause. OnCallSpec& WillByDefault(const Action& action) { ExpectSpecProperty(last_clause_ < kWillByDefault, ".WillByDefault() must appear " "exactly once in an ON_CALL()."); last_clause_ = kWillByDefault; ExpectSpecProperty(!action.IsDoDefault(), "DoDefault() cannot be used in ON_CALL()."); action_ = action; return *this; } // Returns true iff the given arguments match the matchers. bool Matches(const ArgumentTuple& args) const { return TupleMatches(matchers_, args) && extra_matcher_.Matches(args); } // Returns the action specified by the user. const Action& GetAction() const { AssertSpecProperty(last_clause_ == kWillByDefault, ".WillByDefault() must appear exactly " "once in an ON_CALL()."); return action_; } private: // The information in statement // // ON_CALL(mock_object, Method(matchers)) // .With(multi-argument-matcher) // .WillByDefault(action); // // is recorded in the data members like this: // // source file that contains the statement => file_ // line number of the statement => line_ // matchers => matchers_ // multi-argument-matcher => extra_matcher_ // action => action_ ArgumentMatcherTuple matchers_; Matcher extra_matcher_; Action action_; }; // class OnCallSpec // Possible reactions on uninteresting calls. TODO(wan@google.com): // rename the enum values to the kFoo style. enum CallReaction { ALLOW, WARN, FAIL }; } // namespace internal // Utilities for manipulating mock objects. class Mock { public: // The following public methods can be called concurrently. // Tells Google Mock to ignore mock_obj when checking for leaked // mock objects. static void AllowLeak(const void* mock_obj); // Verifies and clears all expectations on the given mock object. // If the expectations aren't satisfied, generates one or more // Google Test non-fatal failures and returns false. static bool VerifyAndClearExpectations(void* mock_obj); // Verifies all expectations on the given mock object and clears its // default actions and expectations. Returns true iff the // verification was successful. static bool VerifyAndClear(void* mock_obj); private: friend class internal::UntypedFunctionMockerBase; // Needed for a function mocker to register itself (so that we know // how to clear a mock object). template friend class internal::FunctionMockerBase; template friend class NiceMock; template friend class StrictMock; // Tells Google Mock to allow uninteresting calls on the given mock // object. // L < g_gmock_mutex static void AllowUninterestingCalls(const void* mock_obj); // Tells Google Mock to warn the user about uninteresting calls on // the given mock object. // L < g_gmock_mutex static void WarnUninterestingCalls(const void* mock_obj); // Tells Google Mock to fail uninteresting calls on the given mock // object. // L < g_gmock_mutex static void FailUninterestingCalls(const void* mock_obj); // Tells Google Mock the given mock object is being destroyed and // its entry in the call-reaction table should be removed. // L < g_gmock_mutex static void UnregisterCallReaction(const void* mock_obj); // Returns the reaction Google Mock will have on uninteresting calls // made on the given mock object. // L < g_gmock_mutex static internal::CallReaction GetReactionOnUninterestingCalls( const void* mock_obj); // Verifies that all expectations on the given mock object have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex static bool VerifyAndClearExpectationsLocked(void* mock_obj); // Clears all ON_CALL()s set on the given mock object. // L >= g_gmock_mutex static void ClearDefaultActionsLocked(void* mock_obj); // Registers a mock object and a mock method it owns. // L < g_gmock_mutex static void Register(const void* mock_obj, internal::UntypedFunctionMockerBase* mocker); // Tells Google Mock where in the source code mock_obj is used in an // ON_CALL or EXPECT_CALL. In case mock_obj is leaked, this // information helps the user identify which object it is. // L < g_gmock_mutex static void RegisterUseByOnCallOrExpectCall( const void* mock_obj, const char* file, int line); // Unregisters a mock method; removes the owning mock object from // the registry when the last mock method associated with it has // been unregistered. This is called only in the destructor of // FunctionMockerBase. // L >= g_gmock_mutex static void UnregisterLocked(internal::UntypedFunctionMockerBase* mocker); }; // class Mock // An abstract handle of an expectation. Useful in the .After() // clause of EXPECT_CALL() for setting the (partial) order of // expectations. The syntax: // // Expectation e1 = EXPECT_CALL(...)...; // EXPECT_CALL(...).After(e1)...; // // sets two expectations where the latter can only be matched after // the former has been satisfied. // // Notes: // - This class is copyable and has value semantics. // - Constness is shallow: a const Expectation object itself cannot // be modified, but the mutable methods of the ExpectationBase // object it references can be called via expectation_base(). // - The constructors and destructor are defined out-of-line because // the Symbian WINSCW compiler wants to otherwise instantiate them // when it sees this class definition, at which point it doesn't have // ExpectationBase available yet, leading to incorrect destruction // in the linked_ptr (or compilation errors if using a checking // linked_ptr). class Expectation { public: // Constructs a null object that doesn't reference any expectation. Expectation(); ~Expectation(); // This single-argument ctor must not be explicit, in order to support the // Expectation e = EXPECT_CALL(...); // syntax. // // A TypedExpectation object stores its pre-requisites as // Expectation objects, and needs to call the non-const Retire() // method on the ExpectationBase objects they reference. Therefore // Expectation must receive a *non-const* reference to the // ExpectationBase object. Expectation(internal::ExpectationBase& exp); // NOLINT // The compiler-generated copy ctor and operator= work exactly as // intended, so we don't need to define our own. // Returns true iff rhs references the same expectation as this object does. bool operator==(const Expectation& rhs) const { return expectation_base_ == rhs.expectation_base_; } bool operator!=(const Expectation& rhs) const { return !(*this == rhs); } private: friend class ExpectationSet; friend class Sequence; friend class ::testing::internal::ExpectationBase; friend class ::testing::internal::UntypedFunctionMockerBase; template friend class ::testing::internal::FunctionMockerBase; template friend class ::testing::internal::TypedExpectation; // This comparator is needed for putting Expectation objects into a set. class Less { public: bool operator()(const Expectation& lhs, const Expectation& rhs) const { return lhs.expectation_base_.get() < rhs.expectation_base_.get(); } }; typedef ::std::set Set; Expectation( const internal::linked_ptr& expectation_base); // Returns the expectation this object references. const internal::linked_ptr& expectation_base() const { return expectation_base_; } // A linked_ptr that co-owns the expectation this handle references. internal::linked_ptr expectation_base_; }; // A set of expectation handles. Useful in the .After() clause of // EXPECT_CALL() for setting the (partial) order of expectations. The // syntax: // // ExpectationSet es; // es += EXPECT_CALL(...)...; // es += EXPECT_CALL(...)...; // EXPECT_CALL(...).After(es)...; // // sets three expectations where the last one can only be matched // after the first two have both been satisfied. // // This class is copyable and has value semantics. class ExpectationSet { public: // A bidirectional iterator that can read a const element in the set. typedef Expectation::Set::const_iterator const_iterator; // An object stored in the set. This is an alias of Expectation. typedef Expectation::Set::value_type value_type; // Constructs an empty set. ExpectationSet() {} // This single-argument ctor must not be explicit, in order to support the // ExpectationSet es = EXPECT_CALL(...); // syntax. ExpectationSet(internal::ExpectationBase& exp) { // NOLINT *this += Expectation(exp); } // This single-argument ctor implements implicit conversion from // Expectation and thus must not be explicit. This allows either an // Expectation or an ExpectationSet to be used in .After(). ExpectationSet(const Expectation& e) { // NOLINT *this += e; } // The compiler-generator ctor and operator= works exactly as // intended, so we don't need to define our own. // Returns true iff rhs contains the same set of Expectation objects // as this does. bool operator==(const ExpectationSet& rhs) const { return expectations_ == rhs.expectations_; } bool operator!=(const ExpectationSet& rhs) const { return !(*this == rhs); } // Implements the syntax // expectation_set += EXPECT_CALL(...); ExpectationSet& operator+=(const Expectation& e) { expectations_.insert(e); return *this; } int size() const { return static_cast(expectations_.size()); } const_iterator begin() const { return expectations_.begin(); } const_iterator end() const { return expectations_.end(); } private: Expectation::Set expectations_; }; // Sequence objects are used by a user to specify the relative order // in which the expectations should match. They are copyable (we rely // on the compiler-defined copy constructor and assignment operator). class Sequence { public: // Constructs an empty sequence. Sequence() : last_expectation_(new Expectation) {} // Adds an expectation to this sequence. The caller must ensure // that no other thread is accessing this Sequence object. void AddExpectation(const Expectation& expectation) const; private: // The last expectation in this sequence. We use a linked_ptr here // because Sequence objects are copyable and we want the copies to // be aliases. The linked_ptr allows the copies to co-own and share // the same Expectation object. internal::linked_ptr last_expectation_; }; // class Sequence // An object of this type causes all EXPECT_CALL() statements // encountered in its scope to be put in an anonymous sequence. The // work is done in the constructor and destructor. You should only // create an InSequence object on the stack. // // The sole purpose for this class is to support easy definition of // sequential expectations, e.g. // // { // InSequence dummy; // The name of the object doesn't matter. // // // The following expectations must match in the order they appear. // EXPECT_CALL(a, Bar())...; // EXPECT_CALL(a, Baz())...; // ... // EXPECT_CALL(b, Xyz())...; // } // // You can create InSequence objects in multiple threads, as long as // they are used to affect different mock objects. The idea is that // each thread can create and set up its own mocks as if it's the only // thread. However, for clarity of your tests we recommend you to set // up mocks in the main thread unless you have a good reason not to do // so. class InSequence { public: InSequence(); ~InSequence(); private: bool sequence_created_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InSequence); // NOLINT } GTEST_ATTRIBUTE_UNUSED_; namespace internal { // Points to the implicit sequence introduced by a living InSequence // object (if any) in the current thread or NULL. extern ThreadLocal g_gmock_implicit_sequence; // Base class for implementing expectations. // // There are two reasons for having a type-agnostic base class for // Expectation: // // 1. We need to store collections of expectations of different // types (e.g. all pre-requisites of a particular expectation, all // expectations in a sequence). Therefore these expectation objects // must share a common base class. // // 2. We can avoid binary code bloat by moving methods not depending // on the template argument of Expectation to the base class. // // This class is internal and mustn't be used by user code directly. class ExpectationBase { public: // source_text is the EXPECT_CALL(...) source that created this Expectation. ExpectationBase(const char* file, int line, const string& source_text); virtual ~ExpectationBase(); // Where in the source file was the expectation spec defined? const char* file() const { return file_; } int line() const { return line_; } const char* source_text() const { return source_text_.c_str(); } // Returns the cardinality specified in the expectation spec. const Cardinality& cardinality() const { return cardinality_; } // Describes the source file location of this expectation. void DescribeLocationTo(::std::ostream* os) const { *os << FormatFileLocation(file(), line()) << " "; } // Describes how many times a function call matching this // expectation has occurred. // L >= g_gmock_mutex void DescribeCallCountTo(::std::ostream* os) const; // If this mock method has an extra matcher (i.e. .With(matcher)), // describes it to the ostream. virtual void MaybeDescribeExtraMatcherTo(::std::ostream* os) = 0; protected: friend class ::testing::Expectation; friend class UntypedFunctionMockerBase; enum Clause { // Don't change the order of the enum members! kNone, kWith, kTimes, kInSequence, kAfter, kWillOnce, kWillRepeatedly, kRetiresOnSaturation }; typedef std::vector UntypedActions; // Returns an Expectation object that references and co-owns this // expectation. virtual Expectation GetHandle() = 0; // Asserts that the EXPECT_CALL() statement has the given property. void AssertSpecProperty(bool property, const string& failure_message) const { Assert(property, file_, line_, failure_message); } // Expects that the EXPECT_CALL() statement has the given property. void ExpectSpecProperty(bool property, const string& failure_message) const { Expect(property, file_, line_, failure_message); } // Explicitly specifies the cardinality of this expectation. Used // by the subclasses to implement the .Times() clause. void SpecifyCardinality(const Cardinality& cardinality); // Returns true iff the user specified the cardinality explicitly // using a .Times(). bool cardinality_specified() const { return cardinality_specified_; } // Sets the cardinality of this expectation spec. void set_cardinality(const Cardinality& a_cardinality) { cardinality_ = a_cardinality; } // The following group of methods should only be called after the // EXPECT_CALL() statement, and only when g_gmock_mutex is held by // the current thread. // Retires all pre-requisites of this expectation. // L >= g_gmock_mutex void RetireAllPreRequisites(); // Returns true iff this expectation is retired. // L >= g_gmock_mutex bool is_retired() const { g_gmock_mutex.AssertHeld(); return retired_; } // Retires this expectation. // L >= g_gmock_mutex void Retire() { g_gmock_mutex.AssertHeld(); retired_ = true; } // Returns true iff this expectation is satisfied. // L >= g_gmock_mutex bool IsSatisfied() const { g_gmock_mutex.AssertHeld(); return cardinality().IsSatisfiedByCallCount(call_count_); } // Returns true iff this expectation is saturated. // L >= g_gmock_mutex bool IsSaturated() const { g_gmock_mutex.AssertHeld(); return cardinality().IsSaturatedByCallCount(call_count_); } // Returns true iff this expectation is over-saturated. // L >= g_gmock_mutex bool IsOverSaturated() const { g_gmock_mutex.AssertHeld(); return cardinality().IsOverSaturatedByCallCount(call_count_); } // Returns true iff all pre-requisites of this expectation are satisfied. // L >= g_gmock_mutex bool AllPrerequisitesAreSatisfied() const; // Adds unsatisfied pre-requisites of this expectation to 'result'. // L >= g_gmock_mutex void FindUnsatisfiedPrerequisites(ExpectationSet* result) const; // Returns the number this expectation has been invoked. // L >= g_gmock_mutex int call_count() const { g_gmock_mutex.AssertHeld(); return call_count_; } // Increments the number this expectation has been invoked. // L >= g_gmock_mutex void IncrementCallCount() { g_gmock_mutex.AssertHeld(); call_count_++; } // Checks the action count (i.e. the number of WillOnce() and // WillRepeatedly() clauses) against the cardinality if this hasn't // been done before. Prints a warning if there are too many or too // few actions. // L < mutex_ void CheckActionCountIfNotDone() const; friend class ::testing::Sequence; friend class ::testing::internal::ExpectationTester; template friend class TypedExpectation; // Implements the .Times() clause. void UntypedTimes(const Cardinality& a_cardinality); // This group of fields are part of the spec and won't change after // an EXPECT_CALL() statement finishes. const char* file_; // The file that contains the expectation. int line_; // The line number of the expectation. const string source_text_; // The EXPECT_CALL(...) source text. // True iff the cardinality is specified explicitly. bool cardinality_specified_; Cardinality cardinality_; // The cardinality of the expectation. // The immediate pre-requisites (i.e. expectations that must be // satisfied before this expectation can be matched) of this // expectation. We use linked_ptr in the set because we want an // Expectation object to be co-owned by its FunctionMocker and its // successors. This allows multiple mock objects to be deleted at // different times. ExpectationSet immediate_prerequisites_; // This group of fields are the current state of the expectation, // and can change as the mock function is called. int call_count_; // How many times this expectation has been invoked. bool retired_; // True iff this expectation has retired. UntypedActions untyped_actions_; bool extra_matcher_specified_; bool repeated_action_specified_; // True if a WillRepeatedly() was specified. bool retires_on_saturation_; Clause last_clause_; mutable bool action_count_checked_; // Under mutex_. mutable Mutex mutex_; // Protects action_count_checked_. GTEST_DISALLOW_ASSIGN_(ExpectationBase); }; // class ExpectationBase // Impements an expectation for the given function type. template class TypedExpectation : public ExpectationBase { public: typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; typedef typename Function::Result Result; TypedExpectation(FunctionMockerBase* owner, const char* a_file, int a_line, const string& a_source_text, const ArgumentMatcherTuple& m) : ExpectationBase(a_file, a_line, a_source_text), owner_(owner), matchers_(m), // By default, extra_matcher_ should match anything. However, // we cannot initialize it with _ as that triggers a compiler // bug in Symbian's C++ compiler (cannot decide between two // overloaded constructors of Matcher). extra_matcher_(A()), repeated_action_(DoDefault()) {} virtual ~TypedExpectation() { // Check the validity of the action count if it hasn't been done // yet (for example, if the expectation was never used). CheckActionCountIfNotDone(); for (UntypedActions::const_iterator it = untyped_actions_.begin(); it != untyped_actions_.end(); ++it) { delete static_cast*>(*it); } } // Implements the .With() clause. TypedExpectation& With(const Matcher& m) { if (last_clause_ == kWith) { ExpectSpecProperty(false, ".With() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kWith, ".With() must be the first " "clause in an EXPECT_CALL()."); } last_clause_ = kWith; extra_matcher_ = m; extra_matcher_specified_ = true; return *this; } // Implements the .Times() clause. TypedExpectation& Times(const Cardinality& a_cardinality) { ExpectationBase::UntypedTimes(a_cardinality); return *this; } // Implements the .Times() clause. TypedExpectation& Times(int n) { return Times(Exactly(n)); } // Implements the .InSequence() clause. TypedExpectation& InSequence(const Sequence& s) { ExpectSpecProperty(last_clause_ <= kInSequence, ".InSequence() cannot appear after .After()," " .WillOnce(), .WillRepeatedly(), or " ".RetiresOnSaturation()."); last_clause_ = kInSequence; s.AddExpectation(GetHandle()); return *this; } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { return InSequence(s1).InSequence(s2); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3) { return InSequence(s1, s2).InSequence(s3); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3, const Sequence& s4) { return InSequence(s1, s2, s3).InSequence(s4); } TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, const Sequence& s3, const Sequence& s4, const Sequence& s5) { return InSequence(s1, s2, s3, s4).InSequence(s5); } // Implements that .After() clause. TypedExpectation& After(const ExpectationSet& s) { ExpectSpecProperty(last_clause_ <= kAfter, ".After() cannot appear after .WillOnce()," " .WillRepeatedly(), or " ".RetiresOnSaturation()."); last_clause_ = kAfter; for (ExpectationSet::const_iterator it = s.begin(); it != s.end(); ++it) { immediate_prerequisites_ += *it; } return *this; } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2) { return After(s1).After(s2); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3) { return After(s1, s2).After(s3); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3, const ExpectationSet& s4) { return After(s1, s2, s3).After(s4); } TypedExpectation& After(const ExpectationSet& s1, const ExpectationSet& s2, const ExpectationSet& s3, const ExpectationSet& s4, const ExpectationSet& s5) { return After(s1, s2, s3, s4).After(s5); } // Implements the .WillOnce() clause. TypedExpectation& WillOnce(const Action& action) { ExpectSpecProperty(last_clause_ <= kWillOnce, ".WillOnce() cannot appear after " ".WillRepeatedly() or .RetiresOnSaturation()."); last_clause_ = kWillOnce; untyped_actions_.push_back(new Action(action)); if (!cardinality_specified()) { set_cardinality(Exactly(static_cast(untyped_actions_.size()))); } return *this; } // Implements the .WillRepeatedly() clause. TypedExpectation& WillRepeatedly(const Action& action) { if (last_clause_ == kWillRepeatedly) { ExpectSpecProperty(false, ".WillRepeatedly() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kWillRepeatedly, ".WillRepeatedly() cannot appear " "after .RetiresOnSaturation()."); } last_clause_ = kWillRepeatedly; repeated_action_specified_ = true; repeated_action_ = action; if (!cardinality_specified()) { set_cardinality(AtLeast(static_cast(untyped_actions_.size()))); } // Now that no more action clauses can be specified, we check // whether their count makes sense. CheckActionCountIfNotDone(); return *this; } // Implements the .RetiresOnSaturation() clause. TypedExpectation& RetiresOnSaturation() { ExpectSpecProperty(last_clause_ < kRetiresOnSaturation, ".RetiresOnSaturation() cannot appear " "more than once."); last_clause_ = kRetiresOnSaturation; retires_on_saturation_ = true; // Now that no more action clauses can be specified, we check // whether their count makes sense. CheckActionCountIfNotDone(); return *this; } // Returns the matchers for the arguments as specified inside the // EXPECT_CALL() macro. const ArgumentMatcherTuple& matchers() const { return matchers_; } // Returns the matcher specified by the .With() clause. const Matcher& extra_matcher() const { return extra_matcher_; } // Returns the action specified by the .WillRepeatedly() clause. const Action& repeated_action() const { return repeated_action_; } // If this mock method has an extra matcher (i.e. .With(matcher)), // describes it to the ostream. virtual void MaybeDescribeExtraMatcherTo(::std::ostream* os) { if (extra_matcher_specified_) { *os << " Expected args: "; extra_matcher_.DescribeTo(os); *os << "\n"; } } private: template friend class FunctionMockerBase; // Returns an Expectation object that references and co-owns this // expectation. virtual Expectation GetHandle() { return owner_->GetHandleOf(this); } // The following methods will be called only after the EXPECT_CALL() // statement finishes and when the current thread holds // g_gmock_mutex. // Returns true iff this expectation matches the given arguments. // L >= g_gmock_mutex bool Matches(const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); return TupleMatches(matchers_, args) && extra_matcher_.Matches(args); } // Returns true iff this expectation should handle the given arguments. // L >= g_gmock_mutex bool ShouldHandleArguments(const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); // In case the action count wasn't checked when the expectation // was defined (e.g. if this expectation has no WillRepeatedly() // or RetiresOnSaturation() clause), we check it when the // expectation is used for the first time. CheckActionCountIfNotDone(); return !is_retired() && AllPrerequisitesAreSatisfied() && Matches(args); } // Describes the result of matching the arguments against this // expectation to the given ostream. // L >= g_gmock_mutex void ExplainMatchResultTo(const ArgumentTuple& args, ::std::ostream* os) const { g_gmock_mutex.AssertHeld(); if (is_retired()) { *os << " Expected: the expectation is active\n" << " Actual: it is retired\n"; } else if (!Matches(args)) { if (!TupleMatches(matchers_, args)) { ExplainMatchFailureTupleTo(matchers_, args, os); } StringMatchResultListener listener; if (!extra_matcher_.MatchAndExplain(args, &listener)) { *os << " Expected args: "; extra_matcher_.DescribeTo(os); *os << "\n Actual: don't match"; internal::PrintIfNotEmpty(listener.str(), os); *os << "\n"; } } else if (!AllPrerequisitesAreSatisfied()) { *os << " Expected: all pre-requisites are satisfied\n" << " Actual: the following immediate pre-requisites " << "are not satisfied:\n"; ExpectationSet unsatisfied_prereqs; FindUnsatisfiedPrerequisites(&unsatisfied_prereqs); int i = 0; for (ExpectationSet::const_iterator it = unsatisfied_prereqs.begin(); it != unsatisfied_prereqs.end(); ++it) { it->expectation_base()->DescribeLocationTo(os); *os << "pre-requisite #" << i++ << "\n"; } *os << " (end of pre-requisites)\n"; } else { // This line is here just for completeness' sake. It will never // be executed as currently the ExplainMatchResultTo() function // is called only when the mock function call does NOT match the // expectation. *os << "The call matches the expectation.\n"; } } // Returns the action that should be taken for the current invocation. // L >= g_gmock_mutex const Action& GetCurrentAction(const FunctionMockerBase* mocker, const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); const int count = call_count(); Assert(count >= 1, __FILE__, __LINE__, "call_count() is <= 0 when GetCurrentAction() is " "called - this should never happen."); const int action_count = static_cast(untyped_actions_.size()); if (action_count > 0 && !repeated_action_specified_ && count > action_count) { // If there is at least one WillOnce() and no WillRepeatedly(), // we warn the user when the WillOnce() clauses ran out. ::std::stringstream ss; DescribeLocationTo(&ss); ss << "Actions ran out in " << source_text() << "...\n" << "Called " << count << " times, but only " << action_count << " WillOnce()" << (action_count == 1 ? " is" : "s are") << " specified - "; mocker->DescribeDefaultActionTo(args, &ss); Log(WARNING, ss.str(), 1); } return count <= action_count ? *static_cast*>(untyped_actions_[count - 1]) : repeated_action(); } // Given the arguments of a mock function call, if the call will // over-saturate this expectation, returns the default action; // otherwise, returns the next action in this expectation. Also // describes *what* happened to 'what', and explains *why* Google // Mock does it to 'why'. This method is not const as it calls // IncrementCallCount(). A return value of NULL means the default // action. // L >= g_gmock_mutex const Action* GetActionForArguments(const FunctionMockerBase* mocker, const ArgumentTuple& args, ::std::ostream* what, ::std::ostream* why) { g_gmock_mutex.AssertHeld(); if (IsSaturated()) { // We have an excessive call. IncrementCallCount(); *what << "Mock function called more times than expected - "; mocker->DescribeDefaultActionTo(args, what); DescribeCallCountTo(why); // TODO(wan@google.com): allow the user to control whether // unexpected calls should fail immediately or continue using a // flag --gmock_unexpected_calls_are_fatal. return NULL; } IncrementCallCount(); RetireAllPreRequisites(); if (retires_on_saturation_ && IsSaturated()) { Retire(); } // Must be done after IncrementCount()! *what << "Mock function call matches " << source_text() <<"...\n"; return &(GetCurrentAction(mocker, args)); } // All the fields below won't change once the EXPECT_CALL() // statement finishes. FunctionMockerBase* const owner_; ArgumentMatcherTuple matchers_; Matcher extra_matcher_; Action repeated_action_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TypedExpectation); }; // class TypedExpectation // A MockSpec object is used by ON_CALL() or EXPECT_CALL() for // specifying the default behavior of, or expectation on, a mock // function. // Note: class MockSpec really belongs to the ::testing namespace. // However if we define it in ::testing, MSVC will complain when // classes in ::testing::internal declare it as a friend class // template. To workaround this compiler bug, we define MockSpec in // ::testing::internal and import it into ::testing. // Logs a message including file and line number information. void LogWithLocation(testing::internal::LogSeverity severity, const char* file, int line, const string& message); template class MockSpec { public: typedef typename internal::Function::ArgumentTuple ArgumentTuple; typedef typename internal::Function::ArgumentMatcherTuple ArgumentMatcherTuple; // Constructs a MockSpec object, given the function mocker object // that the spec is associated with. explicit MockSpec(internal::FunctionMockerBase* function_mocker) : function_mocker_(function_mocker) {} // Adds a new default action spec to the function mocker and returns // the newly created spec. internal::OnCallSpec& InternalDefaultActionSetAt( const char* file, int line, const char* obj, const char* call) { LogWithLocation(internal::INFO, file, line, string("ON_CALL(") + obj + ", " + call + ") invoked"); return function_mocker_->AddNewOnCallSpec(file, line, matchers_); } // Adds a new expectation spec to the function mocker and returns // the newly created spec. internal::TypedExpectation& InternalExpectedAt( const char* file, int line, const char* obj, const char* call) { const string source_text(string("EXPECT_CALL(") + obj + ", " + call + ")"); LogWithLocation(internal::INFO, file, line, source_text + " invoked"); return function_mocker_->AddNewExpectation( file, line, source_text, matchers_); } private: template friend class internal::FunctionMocker; void SetMatchers(const ArgumentMatcherTuple& matchers) { matchers_ = matchers; } // The function mocker that owns this spec. internal::FunctionMockerBase* const function_mocker_; // The argument matchers specified in the spec. ArgumentMatcherTuple matchers_; GTEST_DISALLOW_ASSIGN_(MockSpec); }; // class MockSpec // MSVC warns about using 'this' in base member initializer list, so // we need to temporarily disable the warning. We have to do it for // the entire class to suppress the warning, even though it's about // the constructor only. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355. #endif // _MSV_VER // C++ treats the void type specially. For example, you cannot define // a void-typed variable or pass a void value to a function. // ActionResultHolder holds a value of type T, where T must be a // copyable type or void (T doesn't need to be default-constructable). // It hides the syntactic difference between void and other types, and // is used to unify the code for invoking both void-returning and // non-void-returning mock functions. // Untyped base class for ActionResultHolder. class UntypedActionResultHolderBase { public: virtual ~UntypedActionResultHolderBase() {} // Prints the held value as an action's result to os. virtual void PrintAsActionResult(::std::ostream* os) const = 0; }; // This generic definition is used when T is not void. template class ActionResultHolder : public UntypedActionResultHolderBase { public: explicit ActionResultHolder(T a_value) : value_(a_value) {} // The compiler-generated copy constructor and assignment operator // are exactly what we need, so we don't need to define them. // Returns the held value and deletes this object. T GetValueAndDelete() const { T retval(value_); delete this; return retval; } // Prints the held value as an action's result to os. virtual void PrintAsActionResult(::std::ostream* os) const { *os << "\n Returns: "; // T may be a reference type, so we don't use UniversalPrint(). UniversalPrinter::Print(value_, os); } // Performs the given mock function's default action and returns the // result in a new-ed ActionResultHolder. template static ActionResultHolder* PerformDefaultAction( const FunctionMockerBase* func_mocker, const typename Function::ArgumentTuple& args, const string& call_description) { return new ActionResultHolder( func_mocker->PerformDefaultAction(args, call_description)); } // Performs the given action and returns the result in a new-ed // ActionResultHolder. template static ActionResultHolder* PerformAction(const Action& action, const typename Function::ArgumentTuple& args) { return new ActionResultHolder(action.Perform(args)); } private: T value_; // T could be a reference type, so = isn't supported. GTEST_DISALLOW_ASSIGN_(ActionResultHolder); }; // Specialization for T = void. template <> class ActionResultHolder : public UntypedActionResultHolderBase { public: void GetValueAndDelete() const { delete this; } virtual void PrintAsActionResult(::std::ostream* /* os */) const {} // Performs the given mock function's default action and returns NULL; template static ActionResultHolder* PerformDefaultAction( const FunctionMockerBase* func_mocker, const typename Function::ArgumentTuple& args, const string& call_description) { func_mocker->PerformDefaultAction(args, call_description); return NULL; } // Performs the given action and returns NULL. template static ActionResultHolder* PerformAction( const Action& action, const typename Function::ArgumentTuple& args) { action.Perform(args); return NULL; } }; // The base of the function mocker class for the given function type. // We put the methods in this class instead of its child to avoid code // bloat. template class FunctionMockerBase : public UntypedFunctionMockerBase { public: typedef typename Function::Result Result; typedef typename Function::ArgumentTuple ArgumentTuple; typedef typename Function::ArgumentMatcherTuple ArgumentMatcherTuple; FunctionMockerBase() : current_spec_(this) {} // The destructor verifies that all expectations on this mock // function have been satisfied. If not, it will report Google Test // non-fatal failures for the violations. // L < g_gmock_mutex virtual ~FunctionMockerBase() { MutexLock l(&g_gmock_mutex); VerifyAndClearExpectationsLocked(); Mock::UnregisterLocked(this); ClearDefaultActionsLocked(); } // Returns the ON_CALL spec that matches this mock function with the // given arguments; returns NULL if no matching ON_CALL is found. // L = * const OnCallSpec* FindOnCallSpec( const ArgumentTuple& args) const { for (UntypedOnCallSpecs::const_reverse_iterator it = untyped_on_call_specs_.rbegin(); it != untyped_on_call_specs_.rend(); ++it) { const OnCallSpec* spec = static_cast*>(*it); if (spec->Matches(args)) return spec; } return NULL; } // Performs the default action of this mock function on the given arguments // and returns the result. Asserts with a helpful call descrption if there is // no valid return value. This method doesn't depend on the mutable state of // this object, and thus can be called concurrently without locking. // L = * Result PerformDefaultAction(const ArgumentTuple& args, const string& call_description) const { const OnCallSpec* const spec = this->FindOnCallSpec(args); if (spec != NULL) { return spec->GetAction().Perform(args); } Assert(DefaultValue::Exists(), "", -1, call_description + "\n The mock function has no default action " "set, and its return type has no default value set."); return DefaultValue::Get(); } // Performs the default action with the given arguments and returns // the action's result. The call description string will be used in // the error message to describe the call in the case the default // action fails. The caller is responsible for deleting the result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformDefaultAction( const void* untyped_args, // must point to an ArgumentTuple const string& call_description) const { const ArgumentTuple& args = *static_cast(untyped_args); return ResultHolder::PerformDefaultAction(this, args, call_description); } // Performs the given action with the given arguments and returns // the action's result. The caller is responsible for deleting the // result. // L = * virtual UntypedActionResultHolderBase* UntypedPerformAction( const void* untyped_action, const void* untyped_args) const { // Make a copy of the action before performing it, in case the // action deletes the mock object (and thus deletes itself). const Action action = *static_cast*>(untyped_action); const ArgumentTuple& args = *static_cast(untyped_args); return ResultHolder::PerformAction(action, args); } // Implements UntypedFunctionMockerBase::ClearDefaultActionsLocked(): // clears the ON_CALL()s set on this mock function. // L >= g_gmock_mutex virtual void ClearDefaultActionsLocked() { g_gmock_mutex.AssertHeld(); for (UntypedOnCallSpecs::const_iterator it = untyped_on_call_specs_.begin(); it != untyped_on_call_specs_.end(); ++it) { delete static_cast*>(*it); } untyped_on_call_specs_.clear(); } protected: template friend class MockSpec; typedef ActionResultHolder ResultHolder; // Returns the result of invoking this mock function with the given // arguments. This function can be safely called from multiple // threads concurrently. // L < g_gmock_mutex Result InvokeWith(const ArgumentTuple& args) { return static_cast( this->UntypedInvokeWith(&args))->GetValueAndDelete(); } // Adds and returns a default action spec for this mock function. // L < g_gmock_mutex OnCallSpec& AddNewOnCallSpec( const char* file, int line, const ArgumentMatcherTuple& m) { Mock::RegisterUseByOnCallOrExpectCall(MockObject(), file, line); OnCallSpec* const on_call_spec = new OnCallSpec(file, line, m); untyped_on_call_specs_.push_back(on_call_spec); return *on_call_spec; } // Adds and returns an expectation spec for this mock function. // L < g_gmock_mutex TypedExpectation& AddNewExpectation( const char* file, int line, const string& source_text, const ArgumentMatcherTuple& m) { Mock::RegisterUseByOnCallOrExpectCall(MockObject(), file, line); TypedExpectation* const expectation = new TypedExpectation(this, file, line, source_text, m); const linked_ptr untyped_expectation(expectation); untyped_expectations_.push_back(untyped_expectation); // Adds this expectation into the implicit sequence if there is one. Sequence* const implicit_sequence = g_gmock_implicit_sequence.get(); if (implicit_sequence != NULL) { implicit_sequence->AddExpectation(Expectation(untyped_expectation)); } return *expectation; } // The current spec (either default action spec or expectation spec) // being described on this function mocker. MockSpec& current_spec() { return current_spec_; } private: template friend class TypedExpectation; // Some utilities needed for implementing UntypedInvokeWith(). // Describes what default action will be performed for the given // arguments. // L = * void DescribeDefaultActionTo(const ArgumentTuple& args, ::std::ostream* os) const { const OnCallSpec* const spec = FindOnCallSpec(args); if (spec == NULL) { *os << (internal::type_equals::value ? "returning directly.\n" : "returning default value.\n"); } else { *os << "taking default action specified at:\n" << FormatFileLocation(spec->file(), spec->line()) << "\n"; } } // Writes a message that the call is uninteresting (i.e. neither // explicitly expected nor explicitly unexpected) to the given // ostream. // L < g_gmock_mutex virtual void UntypedDescribeUninterestingCall(const void* untyped_args, ::std::ostream* os) const { const ArgumentTuple& args = *static_cast(untyped_args); *os << "Uninteresting mock function call - "; DescribeDefaultActionTo(args, os); *os << " Function call: " << Name(); UniversalPrint(args, os); } // Returns the expectation that matches the given function arguments // (or NULL is there's no match); when a match is found, // untyped_action is set to point to the action that should be // performed (or NULL if the action is "do default"), and // is_excessive is modified to indicate whether the call exceeds the // expected number. // // Critical section: We must find the matching expectation and the // corresponding action that needs to be taken in an ATOMIC // transaction. Otherwise another thread may call this mock // method in the middle and mess up the state. // // However, performing the action has to be left out of the critical // section. The reason is that we have no control on what the // action does (it can invoke an arbitrary user function or even a // mock function) and excessive locking could cause a dead lock. // L < g_gmock_mutex virtual const ExpectationBase* UntypedFindMatchingExpectation( const void* untyped_args, const void** untyped_action, bool* is_excessive, ::std::ostream* what, ::std::ostream* why) { const ArgumentTuple& args = *static_cast(untyped_args); MutexLock l(&g_gmock_mutex); TypedExpectation* exp = this->FindMatchingExpectationLocked(args); if (exp == NULL) { // A match wasn't found. this->FormatUnexpectedCallMessageLocked(args, what, why); return NULL; } // This line must be done before calling GetActionForArguments(), // which will increment the call count for *exp and thus affect // its saturation status. *is_excessive = exp->IsSaturated(); const Action* action = exp->GetActionForArguments(this, args, what, why); if (action != NULL && action->IsDoDefault()) action = NULL; // Normalize "do default" to NULL. *untyped_action = action; return exp; } // Prints the given function arguments to the ostream. virtual void UntypedPrintArgs(const void* untyped_args, ::std::ostream* os) const { const ArgumentTuple& args = *static_cast(untyped_args); UniversalPrint(args, os); } // Returns the expectation that matches the arguments, or NULL if no // expectation matches them. // L >= g_gmock_mutex TypedExpectation* FindMatchingExpectationLocked( const ArgumentTuple& args) const { g_gmock_mutex.AssertHeld(); for (typename UntypedExpectations::const_reverse_iterator it = untyped_expectations_.rbegin(); it != untyped_expectations_.rend(); ++it) { TypedExpectation* const exp = static_cast*>(it->get()); if (exp->ShouldHandleArguments(args)) { return exp; } } return NULL; } // Returns a message that the arguments don't match any expectation. // L >= g_gmock_mutex void FormatUnexpectedCallMessageLocked(const ArgumentTuple& args, ::std::ostream* os, ::std::ostream* why) const { g_gmock_mutex.AssertHeld(); *os << "\nUnexpected mock function call - "; DescribeDefaultActionTo(args, os); PrintTriedExpectationsLocked(args, why); } // Prints a list of expectations that have been tried against the // current mock function call. // L >= g_gmock_mutex void PrintTriedExpectationsLocked(const ArgumentTuple& args, ::std::ostream* why) const { g_gmock_mutex.AssertHeld(); const int count = static_cast(untyped_expectations_.size()); *why << "Google Mock tried the following " << count << " " << (count == 1 ? "expectation, but it didn't match" : "expectations, but none matched") << ":\n"; for (int i = 0; i < count; i++) { TypedExpectation* const expectation = static_cast*>(untyped_expectations_[i].get()); *why << "\n"; expectation->DescribeLocationTo(why); if (count > 1) { *why << "tried expectation #" << i << ": "; } *why << expectation->source_text() << "...\n"; expectation->ExplainMatchResultTo(args, why); expectation->DescribeCallCountTo(why); } } // The current spec (either default action spec or expectation spec) // being described on this function mocker. MockSpec current_spec_; // There is no generally useful and implementable semantics of // copying a mock object, so copying a mock is usually a user error. // Thus we disallow copying function mockers. If the user really // wants to copy a mock object, he should implement his own copy // operation, for example: // // class MockFoo : public Foo { // public: // // Defines a copy constructor explicitly. // MockFoo(const MockFoo& src) {} // ... // }; GTEST_DISALLOW_COPY_AND_ASSIGN_(FunctionMockerBase); }; // class FunctionMockerBase #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSV_VER // Implements methods of FunctionMockerBase. // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures and // returns false if not. // L >= g_gmock_mutex // Reports an uninteresting call (whose description is in msg) in the // manner specified by 'reaction'. void ReportUninterestingCall(CallReaction reaction, const string& msg); } // namespace internal // The style guide prohibits "using" statements in a namespace scope // inside a header file. However, the MockSpec class template is // meant to be defined in the ::testing namespace. The following line // is just a trick for working around a bug in MSVC 8.0, which cannot // handle it if we define MockSpec in ::testing. using internal::MockSpec; // Const(x) is a convenient function for obtaining a const reference // to x. This is useful for setting expectations on an overloaded // const mock method, e.g. // // class MockFoo : public FooInterface { // public: // MOCK_METHOD0(Bar, int()); // MOCK_CONST_METHOD0(Bar, int&()); // }; // // MockFoo foo; // // Expects a call to non-const MockFoo::Bar(). // EXPECT_CALL(foo, Bar()); // // Expects a call to const MockFoo::Bar(). // EXPECT_CALL(Const(foo), Bar()); template inline const T& Const(const T& x) { return x; } // Constructs an Expectation object that references and co-owns exp. inline Expectation::Expectation(internal::ExpectationBase& exp) // NOLINT : expectation_base_(exp.GetHandle().expectation_base()) {} } // namespace testing // A separate macro is required to avoid compile errors when the name // of the method used in call is a result of macro expansion. // See CompilesWithMethodNameExpandedFromMacro tests in // internal/gmock-spec-builders_test.cc for more details. #define GMOCK_ON_CALL_IMPL_(obj, call) \ ((obj).gmock_##call).InternalDefaultActionSetAt(__FILE__, __LINE__, \ #obj, #call) #define ON_CALL(obj, call) GMOCK_ON_CALL_IMPL_(obj, call) #define GMOCK_EXPECT_CALL_IMPL_(obj, call) \ ((obj).gmock_##call).InternalExpectedAt(__FILE__, __LINE__, #obj, #call) #define EXPECT_CALL(obj, call) GMOCK_EXPECT_CALL_IMPL_(obj, call) #endif // GMOCK_INCLUDE_GMOCK_GMOCK_SPEC_BUILDERS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/gmock.h0000600000175000017500000000677111561126632023421 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This is the main header file a user should include. #ifndef GMOCK_INCLUDE_GMOCK_GMOCK_H_ #define GMOCK_INCLUDE_GMOCK_GMOCK_H_ // This file implements the following syntax: // // ON_CALL(mock_object.Method(...)) // .With(...) ? // .WillByDefault(...); // // where With() is optional and WillByDefault() must appear exactly // once. // // EXPECT_CALL(mock_object.Method(...)) // .With(...) ? // .Times(...) ? // .InSequence(...) * // .WillOnce(...) * // .WillRepeatedly(...) ? // .RetiresOnSaturation() ? ; // // where all clauses are optional and WillOnce() can be repeated. #include "gmock/gmock-actions.h" #include "gmock/gmock-cardinalities.h" #include "gmock/gmock-generated-actions.h" #include "gmock/gmock-generated-function-mockers.h" #include "gmock/gmock-generated-matchers.h" #include "gmock/gmock-more-actions.h" #include "gmock/gmock-generated-nice-strict.h" #include "gmock/gmock-matchers.h" #include "gmock/internal/gmock-internal-utils.h" namespace testing { // Declares Google Mock flags that we want a user to use programmatically. GMOCK_DECLARE_bool_(catch_leaked_mocks); GMOCK_DECLARE_string_(verbose); // Initializes Google Mock. This must be called before running the // tests. In particular, it parses the command line for the flags // that Google Mock recognizes. Whenever a Google Mock flag is seen, // it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Mock flag variables are // updated. // // Since Google Test is needed for Google Mock to work, this function // also initializes Google Test and parses its flags, if that hasn't // been done. void InitGoogleMock(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleMock(int* argc, wchar_t** argv); } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_GMOCK_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/0000700000175000017500000000000012140644175023750 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/gmock-generated-internal-utils.h0000600000175000017500000002613711561126632032137 0ustar synergysynergy// This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file contains template meta-programming utility classes needed // for implementing Google Mock. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ #include "gmock/internal/gmock-port.h" namespace testing { template class Matcher; namespace internal { // An IgnoredValue object can be implicitly constructed from ANY value. // This is used in implementing the IgnoreResult(a) action. class IgnoredValue { public: // This constructor template allows any value to be implicitly // converted to IgnoredValue. The object has no data member and // doesn't try to remember anything about the argument. We // deliberately omit the 'explicit' keyword in order to allow the // conversion to be implicit. template IgnoredValue(const T&) {} }; // MatcherTuple::type is a tuple type where each field is a Matcher // for the corresponding field in tuple type T. template struct MatcherTuple; template <> struct MatcherTuple< ::std::tr1::tuple<> > { typedef ::std::tr1::tuple< > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; template struct MatcherTuple< ::std::tr1::tuple > { typedef ::std::tr1::tuple, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher, Matcher > type; }; // Template struct Function, where F must be a function type, contains // the following typedefs: // // Result: the function's return type. // ArgumentN: the type of the N-th argument, where N starts with 1. // ArgumentTuple: the tuple type consisting of all parameters of F. // ArgumentMatcherTuple: the tuple type consisting of Matchers for all // parameters of F. // MakeResultVoid: the function type obtained by substituting void // for the return type of F. // MakeResultIgnoredValue: // the function type obtained by substituting Something // for the return type of F. template struct Function; template struct Function { typedef R Result; typedef ::std::tr1::tuple<> ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(); typedef IgnoredValue MakeResultIgnoredValue(); }; template struct Function : Function { typedef A1 Argument1; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1); typedef IgnoredValue MakeResultIgnoredValue(A1); }; template struct Function : Function { typedef A2 Argument2; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2); typedef IgnoredValue MakeResultIgnoredValue(A1, A2); }; template struct Function : Function { typedef A3 Argument3; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3); }; template struct Function : Function { typedef A4 Argument4; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4); }; template struct Function : Function { typedef A5 Argument5; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5); }; template struct Function : Function { typedef A6 Argument6; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6); }; template struct Function : Function { typedef A7 Argument7; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7); }; template struct Function : Function { typedef A8 Argument8; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8); }; template struct Function : Function { typedef A9 Argument9; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8, A9); }; template struct Function : Function { typedef A10 Argument10; typedef ::std::tr1::tuple ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10); }; } // namespace internal } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ ././@LongLink0000000000000000000000000000014500000000000011565 Lustar rootrootsynergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/gmock-generated-internal-utils.h.pumpsynergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/gmock-generated-internal-utils.h.pump0000600000175000017500000001142711561126632033113 0ustar synergysynergy$$ -*- mode: c++; -*- $$ This is a Pump source file. Please use Pump to convert it to $$ gmock-generated-function-mockers.h. $$ $var n = 10 $$ The maximum arity we support. // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file contains template meta-programming utility classes needed // for implementing Google Mock. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ #include "gmock/internal/gmock-port.h" namespace testing { template class Matcher; namespace internal { // An IgnoredValue object can be implicitly constructed from ANY value. // This is used in implementing the IgnoreResult(a) action. class IgnoredValue { public: // This constructor template allows any value to be implicitly // converted to IgnoredValue. The object has no data member and // doesn't try to remember anything about the argument. We // deliberately omit the 'explicit' keyword in order to allow the // conversion to be implicit. template IgnoredValue(const T&) {} }; // MatcherTuple::type is a tuple type where each field is a Matcher // for the corresponding field in tuple type T. template struct MatcherTuple; $range i 0..n $for i [[ $range j 1..i $var typename_As = [[$for j, [[typename A$j]]]] $var As = [[$for j, [[A$j]]]] $var matcher_As = [[$for j, [[Matcher]]]] template <$typename_As> struct MatcherTuple< ::std::tr1::tuple<$As> > { typedef ::std::tr1::tuple<$matcher_As > type; }; ]] // Template struct Function, where F must be a function type, contains // the following typedefs: // // Result: the function's return type. // ArgumentN: the type of the N-th argument, where N starts with 1. // ArgumentTuple: the tuple type consisting of all parameters of F. // ArgumentMatcherTuple: the tuple type consisting of Matchers for all // parameters of F. // MakeResultVoid: the function type obtained by substituting void // for the return type of F. // MakeResultIgnoredValue: // the function type obtained by substituting Something // for the return type of F. template struct Function; template struct Function { typedef R Result; typedef ::std::tr1::tuple<> ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid(); typedef IgnoredValue MakeResultIgnoredValue(); }; $range i 1..n $for i [[ $range j 1..i $var typename_As = [[$for j [[, typename A$j]]]] $var As = [[$for j, [[A$j]]]] $var matcher_As = [[$for j, [[Matcher]]]] $range k 1..i-1 $var prev_As = [[$for k, [[A$k]]]] template struct Function : Function { typedef A$i Argument$i; typedef ::std::tr1::tuple<$As> ArgumentTuple; typedef typename MatcherTuple::type ArgumentMatcherTuple; typedef void MakeResultVoid($As); typedef IgnoredValue MakeResultIgnoredValue($As); }; ]] } // namespace internal } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/gmock-internal-utils.h0000600000175000017500000004420511561126632030177 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file defines some utilities useful for implementing Google // Mock. They are subject to change without notice, so please DO NOT // USE THEM IN USER CODE. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ #include #include // NOLINT #include #include "gmock/internal/gmock-generated-internal-utils.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" namespace testing { namespace internal { // Converts an identifier name to a space-separated list of lower-case // words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is // treated as one word. For example, both "FooBar123" and // "foo_bar_123" are converted to "foo bar 123". string ConvertIdentifierNameToWords(const char* id_name); // PointeeOf::type is the type of a value pointed to by a // Pointer, which can be either a smart pointer or a raw pointer. The // following default implementation is for the case where Pointer is a // smart pointer. template struct PointeeOf { // Smart pointer classes define type element_type as the type of // their pointees. typedef typename Pointer::element_type type; }; // This specialization is for the raw pointer case. template struct PointeeOf { typedef T type; }; // NOLINT // GetRawPointer(p) returns the raw pointer underlying p when p is a // smart pointer, or returns p itself when p is already a raw pointer. // The following default implementation is for the smart pointer case. template inline typename Pointer::element_type* GetRawPointer(const Pointer& p) { return p.get(); } // This overloaded version is for the raw pointer case. template inline Element* GetRawPointer(Element* p) { return p; } // This comparator allows linked_ptr to be stored in sets. template struct LinkedPtrLessThan { bool operator()(const ::testing::internal::linked_ptr& lhs, const ::testing::internal::linked_ptr& rhs) const { return lhs.get() < rhs.get(); } }; // Symbian compilation can be done with wchar_t being either a native // type or a typedef. Using Google Mock with OpenC without wchar_t // should require the definition of _STLP_NO_WCHAR_T. // // MSVC treats wchar_t as a native type usually, but treats it as the // same as unsigned short when the compiler option /Zc:wchar_t- is // specified. It defines _NATIVE_WCHAR_T_DEFINED symbol when wchar_t // is a native type. #if (GTEST_OS_SYMBIAN && defined(_STLP_NO_WCHAR_T)) || \ (defined(_MSC_VER) && !defined(_NATIVE_WCHAR_T_DEFINED)) // wchar_t is a typedef. #else # define GMOCK_WCHAR_T_IS_NATIVE_ 1 #endif // signed wchar_t and unsigned wchar_t are NOT in the C++ standard. // Using them is a bad practice and not portable. So DON'T use them. // // Still, Google Mock is designed to work even if the user uses signed // wchar_t or unsigned wchar_t (obviously, assuming the compiler // supports them). // // To gcc, // wchar_t == signed wchar_t != unsigned wchar_t == unsigned int #ifdef __GNUC__ // signed/unsigned wchar_t are valid types. # define GMOCK_HAS_SIGNED_WCHAR_T_ 1 #endif // In what follows, we use the term "kind" to indicate whether a type // is bool, an integer type (excluding bool), a floating-point type, // or none of them. This categorization is useful for determining // when a matcher argument type can be safely converted to another // type in the implementation of SafeMatcherCast. enum TypeKind { kBool, kInteger, kFloatingPoint, kOther }; // KindOf::value is the kind of type T. template struct KindOf { enum { value = kOther }; // The default kind. }; // This macro declares that the kind of 'type' is 'kind'. #define GMOCK_DECLARE_KIND_(type, kind) \ template <> struct KindOf { enum { value = kind }; } GMOCK_DECLARE_KIND_(bool, kBool); // All standard integer types. GMOCK_DECLARE_KIND_(char, kInteger); GMOCK_DECLARE_KIND_(signed char, kInteger); GMOCK_DECLARE_KIND_(unsigned char, kInteger); GMOCK_DECLARE_KIND_(short, kInteger); // NOLINT GMOCK_DECLARE_KIND_(unsigned short, kInteger); // NOLINT GMOCK_DECLARE_KIND_(int, kInteger); GMOCK_DECLARE_KIND_(unsigned int, kInteger); GMOCK_DECLARE_KIND_(long, kInteger); // NOLINT GMOCK_DECLARE_KIND_(unsigned long, kInteger); // NOLINT #if GMOCK_WCHAR_T_IS_NATIVE_ GMOCK_DECLARE_KIND_(wchar_t, kInteger); #endif // Non-standard integer types. GMOCK_DECLARE_KIND_(Int64, kInteger); GMOCK_DECLARE_KIND_(UInt64, kInteger); // All standard floating-point types. GMOCK_DECLARE_KIND_(float, kFloatingPoint); GMOCK_DECLARE_KIND_(double, kFloatingPoint); GMOCK_DECLARE_KIND_(long double, kFloatingPoint); #undef GMOCK_DECLARE_KIND_ // Evaluates to the kind of 'type'. #define GMOCK_KIND_OF_(type) \ static_cast< ::testing::internal::TypeKind>( \ ::testing::internal::KindOf::value) // Evaluates to true iff integer type T is signed. #define GMOCK_IS_SIGNED_(T) (static_cast(-1) < 0) // LosslessArithmeticConvertibleImpl::value // is true iff arithmetic type From can be losslessly converted to // arithmetic type To. // // It's the user's responsibility to ensure that both From and To are // raw (i.e. has no CV modifier, is not a pointer, and is not a // reference) built-in arithmetic types, kFromKind is the kind of // From, and kToKind is the kind of To; the value is // implementation-defined when the above pre-condition is violated. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // Converting bool to bool is lossless. template <> struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting bool to any integer type is lossless. template struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting bool to any floating-point type is lossless. template struct LosslessArithmeticConvertibleImpl : public true_type {}; // NOLINT // Converting an integer to bool is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting an integer to another non-bool integer is lossless iff // the target type's range encloses the source type's range. template struct LosslessArithmeticConvertibleImpl : public bool_constant< // When converting from a smaller size to a larger size, we are // fine as long as we are not converting from signed to unsigned. ((sizeof(From) < sizeof(To)) && (!GMOCK_IS_SIGNED_(From) || GMOCK_IS_SIGNED_(To))) || // When converting between the same size, the signedness must match. ((sizeof(From) == sizeof(To)) && (GMOCK_IS_SIGNED_(From) == GMOCK_IS_SIGNED_(To)))> {}; // NOLINT #undef GMOCK_IS_SIGNED_ // Converting an integer to a floating-point type may be lossy, since // the format of a floating-point number is implementation-defined. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to bool is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to an integer is lossy. template struct LosslessArithmeticConvertibleImpl : public false_type {}; // NOLINT // Converting a floating-point to another floating-point is lossless // iff the target type is at least as big as the source type. template struct LosslessArithmeticConvertibleImpl< kFloatingPoint, From, kFloatingPoint, To> : public bool_constant {}; // NOLINT // LosslessArithmeticConvertible::value is true iff arithmetic // type From can be losslessly converted to arithmetic type To. // // It's the user's responsibility to ensure that both From and To are // raw (i.e. has no CV modifier, is not a pointer, and is not a // reference) built-in arithmetic types; the value is // implementation-defined when the above pre-condition is violated. template struct LosslessArithmeticConvertible : public LosslessArithmeticConvertibleImpl< GMOCK_KIND_OF_(From), From, GMOCK_KIND_OF_(To), To> {}; // NOLINT // This interface knows how to report a Google Mock failure (either // non-fatal or fatal). class FailureReporterInterface { public: // The type of a failure (either non-fatal or fatal). enum FailureType { NONFATAL, FATAL }; virtual ~FailureReporterInterface() {} // Reports a failure that occurred at the given source file location. virtual void ReportFailure(FailureType type, const char* file, int line, const string& message) = 0; }; // Returns the failure reporter used by Google Mock. FailureReporterInterface* GetFailureReporter(); // Asserts that condition is true; aborts the process with the given // message if condition is false. We cannot use LOG(FATAL) or CHECK() // as Google Mock might be used to mock the log sink itself. We // inline this function to prevent it from showing up in the stack // trace. inline void Assert(bool condition, const char* file, int line, const string& msg) { if (!condition) { GetFailureReporter()->ReportFailure(FailureReporterInterface::FATAL, file, line, msg); } } inline void Assert(bool condition, const char* file, int line) { Assert(condition, file, line, "Assertion failed."); } // Verifies that condition is true; generates a non-fatal failure if // condition is false. inline void Expect(bool condition, const char* file, int line, const string& msg) { if (!condition) { GetFailureReporter()->ReportFailure(FailureReporterInterface::NONFATAL, file, line, msg); } } inline void Expect(bool condition, const char* file, int line) { Expect(condition, file, line, "Expectation failed."); } // Severity level of a log. enum LogSeverity { INFO = 0, WARNING = 1 }; // Valid values for the --gmock_verbose flag. // All logs (informational and warnings) are printed. const char kInfoVerbosity[] = "info"; // Only warnings are printed. const char kWarningVerbosity[] = "warning"; // No logs are printed. const char kErrorVerbosity[] = "error"; // Returns true iff a log with the given severity is visible according // to the --gmock_verbose flag. bool LogIsVisible(LogSeverity severity); // Prints the given message to stdout iff 'severity' >= the level // specified by the --gmock_verbose flag. If stack_frames_to_skip >= // 0, also prints the stack trace excluding the top // stack_frames_to_skip frames. In opt mode, any positive // stack_frames_to_skip is treated as 0, since we don't know which // function calls will be inlined by the compiler and need to be // conservative. void Log(LogSeverity severity, const string& message, int stack_frames_to_skip); // TODO(wan@google.com): group all type utilities together. // Type traits. // is_reference::value is non-zero iff T is a reference type. template struct is_reference : public false_type {}; template struct is_reference : public true_type {}; // type_equals::value is non-zero iff T1 and T2 are the same type. template struct type_equals : public false_type {}; template struct type_equals : public true_type {}; // remove_reference::type removes the reference from type T, if any. template struct remove_reference { typedef T type; }; // NOLINT template struct remove_reference { typedef T type; }; // NOLINT // Invalid() returns an invalid value of type T. This is useful // when a value of type T is needed for compilation, but the statement // will not really be executed (or we don't care if the statement // crashes). template inline T Invalid() { return *static_cast::type*>(NULL); } template <> inline void Invalid() {} // Given a raw type (i.e. having no top-level reference or const // modifier) RawContainer that's either an STL-style container or a // native array, class StlContainerView has the // following members: // // - type is a type that provides an STL-style container view to // (i.e. implements the STL container concept for) RawContainer; // - const_reference is a type that provides a reference to a const // RawContainer; // - ConstReference(raw_container) returns a const reference to an STL-style // container view to raw_container, which is a RawContainer. // - Copy(raw_container) returns an STL-style container view of a // copy of raw_container, which is a RawContainer. // // This generic version is used when RawContainer itself is already an // STL-style container. template class StlContainerView { public: typedef RawContainer type; typedef const type& const_reference; static const_reference ConstReference(const RawContainer& container) { // Ensures that RawContainer is not a const type. testing::StaticAssertTypeEq(); return container; } static type Copy(const RawContainer& container) { return container; } }; // This specialization is used when RawContainer is a native array type. template class StlContainerView { public: typedef GTEST_REMOVE_CONST_(Element) RawElement; typedef internal::NativeArray type; // NativeArray can represent a native array either by value or by // reference (selected by a constructor argument), so 'const type' // can be used to reference a const native array. We cannot // 'typedef const type& const_reference' here, as that would mean // ConstReference() has to return a reference to a local variable. typedef const type const_reference; static const_reference ConstReference(const Element (&array)[N]) { // Ensures that Element is not a const type. testing::StaticAssertTypeEq(); #if GTEST_OS_SYMBIAN // The Nokia Symbian compiler confuses itself in template instantiation // for this call without the cast to Element*: // function call '[testing::internal::NativeArray].NativeArray( // {lval} const char *[4], long, testing::internal::RelationToSource)' // does not match // 'testing::internal::NativeArray::NativeArray( // char *const *, unsigned int, testing::internal::RelationToSource)' // (instantiating: 'testing::internal::ContainsMatcherImpl // ::Matches(const char * (&)[4]) const') // (instantiating: 'testing::internal::StlContainerView:: // ConstReference(const char * (&)[4])') // (and though the N parameter type is mismatched in the above explicit // conversion of it doesn't help - only the conversion of the array). return type(const_cast(&array[0]), N, kReference); #else return type(array, N, kReference); #endif // GTEST_OS_SYMBIAN } static type Copy(const Element (&array)[N]) { #if GTEST_OS_SYMBIAN return type(const_cast(&array[0]), N, kCopy); #else return type(array, N, kCopy); #endif // GTEST_OS_SYMBIAN } }; // This specialization is used when RawContainer is a native array // represented as a (pointer, size) tuple. template class StlContainerView< ::std::tr1::tuple > { public: typedef GTEST_REMOVE_CONST_( typename internal::PointeeOf::type) RawElement; typedef internal::NativeArray type; typedef const type const_reference; static const_reference ConstReference( const ::std::tr1::tuple& array) { using ::std::tr1::get; return type(get<0>(array), get<1>(array), kReference); } static type Copy(const ::std::tr1::tuple& array) { using ::std::tr1::get; return type(get<0>(array), get<1>(array), kCopy); } }; // The following specialization prevents the user from instantiating // StlContainer with a reference type. template class StlContainerView; } // namespace internal } // namespace testing #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/include/gmock/internal/gmock-port.h0000600000175000017500000000662111561126632026211 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vadimb@google.com (Vadim Berman) // // Low-level types and utilities for porting Google Mock to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ #define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ #include #include #include // Most of the types needed for porting Google Mock are also required // for Google Test and are defined in gtest-port.h. #include "gtest/internal/gtest-linked_ptr.h" #include "gtest/internal/gtest-port.h" // To avoid conditional compilation everywhere, we make it // gmock-port.h's responsibility to #include the header implementing // tr1/tuple. gmock-port.h does this via gtest-port.h, which is // guaranteed to pull in the tuple header. // For MS Visual C++, check the compiler version. At least VS 2003 is // required to compile Google Mock. #if defined(_MSC_VER) && _MSC_VER < 1310 # error "At least Visual C++ 2003 (7.1) is required to compile Google Mock." #endif // Macro for referencing flags. This is public as we want the user to // use this syntax to reference Google Mock flags. #define GMOCK_FLAG(name) FLAGS_gmock_##name // Macros for declaring flags. #define GMOCK_DECLARE_bool_(name) extern bool GMOCK_FLAG(name) #define GMOCK_DECLARE_int32_(name) \ extern ::testing::internal::Int32 GMOCK_FLAG(name) #define GMOCK_DECLARE_string_(name) \ extern ::testing::internal::String GMOCK_FLAG(name) // Macros for defining flags. #define GMOCK_DEFINE_bool_(name, default_val, doc) \ bool GMOCK_FLAG(name) = (default_val) #define GMOCK_DEFINE_int32_(name, default_val, doc) \ ::testing::internal::Int32 GMOCK_FLAG(name) = (default_val) #define GMOCK_DEFINE_string_(name, default_val, doc) \ ::testing::internal::String GMOCK_FLAG(name) = (default_val) #endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/make/0000700000175000017500000000000012140644175020326 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/Makefile.am0000600000175000017500000001572311561126632021456 0ustar synergysynergy# Automake file # Nonstandard package files for distribution. EXTRA_DIST = # We may need to build our internally packaged gtest. If so, it will be # included in the 'subdirs' variable. SUBDIRS = $(subdirs) # This is generated by the configure script, so clean it for distribution. DISTCLEANFILES = scripts/gmock-config # We define the global AM_CPPFLAGS as everything we compile includes from these # directories. AM_CPPFLAGS = $(GTEST_CPPFLAGS) -I$(srcdir)/include # Modifies compiler and linker flags for pthreads compatibility. if HAVE_PTHREADS AM_CXXFLAGS = @PTHREAD_CFLAGS@ -DGTEST_HAS_PTHREAD=1 AM_LIBS = @PTHREAD_LIBS@ endif # Build rules for libraries. lib_LTLIBRARIES = lib/libgmock.la lib/libgmock_main.la lib_libgmock_la_SOURCES = src/gmock-all.cc pkginclude_HEADERS = \ include/gmock/gmock-actions.h \ include/gmock/gmock-cardinalities.h \ include/gmock/gmock-generated-actions.h \ include/gmock/gmock-generated-function-mockers.h \ include/gmock/gmock-generated-matchers.h \ include/gmock/gmock-generated-nice-strict.h \ include/gmock/gmock-matchers.h \ include/gmock/gmock-more-actions.h \ include/gmock/gmock-spec-builders.h \ include/gmock/gmock.h pkginclude_internaldir = $(pkgincludedir)/internal pkginclude_internal_HEADERS = \ include/gmock/internal/gmock-generated-internal-utils.h \ include/gmock/internal/gmock-internal-utils.h \ include/gmock/internal/gmock-port.h lib_libgmock_main_la_SOURCES = src/gmock_main.cc lib_libgmock_main_la_LIBADD = lib/libgmock.la # Build rules for tests. Automake's naming for some of these variables isn't # terribly obvious, so this is a brief reference: # # TESTS -- Programs run automatically by "make check" # check_PROGRAMS -- Programs built by "make check" but not necessarily run TESTS= check_PROGRAMS= AM_LDFLAGS = $(GTEST_LDFLAGS) # This exercises all major components of Google Mock. It also # verifies that libgmock works. TESTS += test/gmock-spec-builders_test check_PROGRAMS += test/gmock-spec-builders_test test_gmock_spec_builders_test_SOURCES = test/gmock-spec-builders_test.cc test_gmock_spec_builders_test_LDADD = $(GTEST_LIBS) lib/libgmock.la # This tests using Google Mock in multiple translation units. It also # verifies that libgmock_main and libgmock work. TESTS += test/gmock_link_test check_PROGRAMS += test/gmock_link_test test_gmock_link_test_SOURCES = \ test/gmock_link2_test.cc \ test/gmock_link_test.cc \ test/gmock_link_test.h test_gmock_link_test_LDADD = $(GTEST_LIBS) lib/libgmock_main.la lib/libgmock.la # Tests that fused gmock files compile and work. TESTS += test/gmock_fused_test check_PROGRAMS += test/gmock_fused_test test_gmock_fused_test_SOURCES = \ fused-src/gmock-gtest-all.cc \ fused-src/gmock/gmock.h \ fused-src/gmock_main.cc \ fused-src/gtest/gtest.h \ test/gmock_test.cc test_gmock_fused_test_CPPFLAGS = -I"$(srcdir)/fused-src" # Google Mock source files that we don't compile directly. GMOCK_SOURCE_INGLUDES = \ src/gmock-cardinalities.cc \ src/gmock-internal-utils.cc \ src/gmock-matchers.cc \ src/gmock-spec-builders.cc \ src/gmock.cc EXTRA_DIST += $(GMOCK_SOURCE_INGLUDES) # C++ tests that we don't compile using autotools. EXTRA_DIST += \ test/gmock-actions_test.cc \ test/gmock-cardinalities_test.cc \ test/gmock-generated-actions_test.cc \ test/gmock-generated-function-mockers_test.cc \ test/gmock-generated-internal-utils_test.cc \ test/gmock-generated-matchers_test.cc \ test/gmock-internal-utils_test.cc \ test/gmock-matchers_test.cc \ test/gmock-more-actions_test.cc \ test/gmock-nice-strict_test.cc \ test/gmock-port_test.cc \ test/gmock_all_test.cc # Python tests, which we don't run using autotools. EXTRA_DIST += \ test/gmock_leak_test.py \ test/gmock_leak_test_.cc \ test/gmock_output_test.py \ test/gmock_output_test_.cc \ test/gmock_output_test_golden.txt \ test/gmock_test_utils.py # Nonstandard package files for distribution. EXTRA_DIST += \ CHANGES \ CONTRIBUTORS \ make/Makefile # Pump scripts for generating Google Mock headers. # TODO(chandlerc@google.com): automate the generation of *.h from *.h.pump. EXTRA_DIST += \ include/gmock/gmock-generated-actions.h.pump \ include/gmock/gmock-generated-function-mockers.h.pump \ include/gmock/gmock-generated-matchers.h.pump \ include/gmock/gmock-generated-nice-strict.h.pump \ include/gmock/internal/gmock-generated-internal-utils.h.pump # Script for fusing Google Mock and Google Test source files. EXTRA_DIST += scripts/fuse_gmock_files.py # The Google Mock Generator tool from the cppclean project. EXTRA_DIST += \ scripts/generator/COPYING \ scripts/generator/README \ scripts/generator/README.cppclean \ scripts/generator/cpp/__init__.py \ scripts/generator/cpp/ast.py \ scripts/generator/cpp/gmock_class.py \ scripts/generator/cpp/keywords.py \ scripts/generator/cpp/tokenize.py \ scripts/generator/cpp/utils.py \ scripts/generator/gmock_gen.py # CMake scripts. EXTRA_DIST += \ CMakeLists.txt # Microsoft Visual Studio 2005 projects. EXTRA_DIST += \ msvc/2005/gmock.sln \ msvc/2005/gmock.vcproj \ msvc/2005/gmock_config.vsprops \ msvc/2005/gmock_main.vcproj \ msvc/2005/gmock_test.vcproj # Microsoft Visual Studio 2010 projects. EXTRA_DIST += \ msvc/2010/gmock.sln \ msvc/2010/gmock.vcxproj \ msvc/2010/gmock_config.props \ msvc/2010/gmock_main.vcxproj \ msvc/2010/gmock_test.vcxproj # gmock_test.cc does not really depend on files generated by the # fused-gmock-internal rule. However, gmock_test.o does, and it is # important to include test/gmock_test.cc as part of this rule in order to # prevent compiling gmock_test.o until all dependent files have been # generated. $(test_gmock_fused_test_SOURCES): fused-gmock-internal # TODO(vladl@google.com): Find a way to add Google Tests's sources here. fused-gmock-internal: $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) \ $(lib_libgmock_la_SOURCES) $(GMOCK_SOURCE_INGLUDES) \ $(lib_libgmock_main_la_SOURCES) \ scripts/fuse_gmock_files.py mkdir -p "$(srcdir)/fused-src" chmod -R u+w "$(srcdir)/fused-src" rm -f "$(srcdir)/fused-src/gtest/gtest.h" rm -f "$(srcdir)/fused-src/gmock/gmock.h" rm -f "$(srcdir)/fused-src/gmock-gtest-all.cc" "$(srcdir)/scripts/fuse_gmock_files.py" "$(srcdir)/fused-src" cp -f "$(srcdir)/src/gmock_main.cc" "$(srcdir)/fused-src" maintainer-clean-local: rm -rf "$(srcdir)/fused-src" # Death tests may produce core dumps in the build directory. In case # this happens, clean them to keep distcleancheck happy. CLEANFILES = core # Disables 'make install' as installing a compiled version of Google # Mock can lead to undefined behavior due to violation of the # One-Definition Rule. install-exec-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Mock into your build system." false install-data-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Mock into your build system." false synergy-1.4.12-Source/tools/gmock-1.6.0/Makefile.in0000600000175000017500000015021511561126632021463 0ustar synergysynergy# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # Automake file VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ TESTS = test/gmock-spec-builders_test$(EXEEXT) \ test/gmock_link_test$(EXEEXT) test/gmock_fused_test$(EXEEXT) check_PROGRAMS = test/gmock-spec-builders_test$(EXEEXT) \ test/gmock_link_test$(EXEEXT) test/gmock_fused_test$(EXEEXT) subdir = . DIST_COMMON = README $(am__configure_deps) $(pkginclude_HEADERS) \ $(pkginclude_internal_HEADERS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(top_srcdir)/build-aux/config.h.in \ $(top_srcdir)/configure $(top_srcdir)/scripts/gmock-config.in \ COPYING build-aux/config.guess build-aux/config.sub \ build-aux/depcomp build-aux/install-sh build-aux/ltmain.sh \ build-aux/missing ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/gtest/m4/acx_pthread.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/build-aux/config.h CONFIG_CLEAN_FILES = scripts/gmock-config CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgincludedir)" \ "$(DESTDIR)$(pkginclude_internaldir)" LTLIBRARIES = $(lib_LTLIBRARIES) lib_libgmock_la_LIBADD = am__dirstamp = $(am__leading_dot)dirstamp am_lib_libgmock_la_OBJECTS = src/gmock-all.lo lib_libgmock_la_OBJECTS = $(am_lib_libgmock_la_OBJECTS) lib_libgmock_main_la_DEPENDENCIES = lib/libgmock.la am_lib_libgmock_main_la_OBJECTS = src/gmock_main.lo lib_libgmock_main_la_OBJECTS = $(am_lib_libgmock_main_la_OBJECTS) am_test_gmock_spec_builders_test_OBJECTS = \ test/gmock-spec-builders_test.$(OBJEXT) test_gmock_spec_builders_test_OBJECTS = \ $(am_test_gmock_spec_builders_test_OBJECTS) am__DEPENDENCIES_1 = test_gmock_spec_builders_test_DEPENDENCIES = $(am__DEPENDENCIES_1) \ lib/libgmock.la am_test_gmock_fused_test_OBJECTS = \ fused-src/test_gmock_fused_test-gmock-gtest-all.$(OBJEXT) \ fused-src/test_gmock_fused_test-gmock_main.$(OBJEXT) \ test/test_gmock_fused_test-gmock_test.$(OBJEXT) test_gmock_fused_test_OBJECTS = $(am_test_gmock_fused_test_OBJECTS) test_gmock_fused_test_LDADD = $(LDADD) am_test_gmock_link_test_OBJECTS = test/gmock_link2_test.$(OBJEXT) \ test/gmock_link_test.$(OBJEXT) test_gmock_link_test_OBJECTS = $(am_test_gmock_link_test_OBJECTS) test_gmock_link_test_DEPENDENCIES = $(am__DEPENDENCIES_1) \ lib/libgmock_main.la lib/libgmock.la DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/build-aux depcomp = $(SHELL) $(top_srcdir)/build-aux/depcomp am__depfiles_maybe = depfiles am__mv = mv -f CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) CXXLD = $(CXX) CXXLINK = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=link $(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) $(AM_LDFLAGS) \ $(LDFLAGS) -o $@ COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \ $(LDFLAGS) -o $@ SOURCES = $(lib_libgmock_la_SOURCES) $(lib_libgmock_main_la_SOURCES) \ $(test_gmock_spec_builders_test_SOURCES) \ $(test_gmock_fused_test_SOURCES) \ $(test_gmock_link_test_SOURCES) DIST_SOURCES = $(lib_libgmock_la_SOURCES) \ $(lib_libgmock_main_la_SOURCES) \ $(test_gmock_spec_builders_test_SOURCES) \ $(test_gmock_fused_test_SOURCES) \ $(test_gmock_link_test_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive HEADERS = $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir dist dist-all distcheck ETAGS = etags CTAGS = ctags am__tty_colors = \ red=; grn=; lgn=; blu=; std= DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ { test ! -d "$(distdir)" \ || { find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -fr "$(distdir)"; }; } am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz $(distdir).tar.bz2 $(distdir).zip GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ GTEST_CONFIG = @GTEST_CONFIG@ GTEST_CPPFLAGS = @GTEST_CPPFLAGS@ GTEST_CXXFLAGS = @GTEST_CXXFLAGS@ GTEST_LDFLAGS = @GTEST_LDFLAGS@ GTEST_LIBS = @GTEST_LIBS@ GTEST_VERSION = @GTEST_VERSION@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PTHREAD_CC = @PTHREAD_CC@ PTHREAD_CFLAGS = @PTHREAD_CFLAGS@ PTHREAD_LIBS = @PTHREAD_LIBS@ PYTHON = @PYTHON@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ acx_pthread_config = @acx_pthread_config@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ subdirs = @subdirs@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ # Nonstandard package files for distribution. # C++ tests that we don't compile using autotools. # Python tests, which we don't run using autotools. # Nonstandard package files for distribution. # Pump scripts for generating Google Mock headers. # TODO(chandlerc@google.com): automate the generation of *.h from *.h.pump. # Script for fusing Google Mock and Google Test source files. # The Google Mock Generator tool from the cppclean project. # CMake scripts. # Microsoft Visual Studio 2005 projects. # Microsoft Visual Studio 2010 projects. EXTRA_DIST = $(GMOCK_SOURCE_INGLUDES) test/gmock-actions_test.cc \ test/gmock-cardinalities_test.cc \ test/gmock-generated-actions_test.cc \ test/gmock-generated-function-mockers_test.cc \ test/gmock-generated-internal-utils_test.cc \ test/gmock-generated-matchers_test.cc \ test/gmock-internal-utils_test.cc test/gmock-matchers_test.cc \ test/gmock-more-actions_test.cc test/gmock-nice-strict_test.cc \ test/gmock-port_test.cc test/gmock_all_test.cc \ test/gmock_leak_test.py test/gmock_leak_test_.cc \ test/gmock_output_test.py test/gmock_output_test_.cc \ test/gmock_output_test_golden.txt test/gmock_test_utils.py \ CHANGES CONTRIBUTORS make/Makefile \ include/gmock/gmock-generated-actions.h.pump \ include/gmock/gmock-generated-function-mockers.h.pump \ include/gmock/gmock-generated-matchers.h.pump \ include/gmock/gmock-generated-nice-strict.h.pump \ include/gmock/internal/gmock-generated-internal-utils.h.pump \ scripts/fuse_gmock_files.py scripts/generator/COPYING \ scripts/generator/README scripts/generator/README.cppclean \ scripts/generator/cpp/__init__.py scripts/generator/cpp/ast.py \ scripts/generator/cpp/gmock_class.py \ scripts/generator/cpp/keywords.py \ scripts/generator/cpp/tokenize.py \ scripts/generator/cpp/utils.py scripts/generator/gmock_gen.py \ CMakeLists.txt msvc/2005/gmock.sln msvc/2005/gmock.vcproj \ msvc/2005/gmock_config.vsprops msvc/2005/gmock_main.vcproj \ msvc/2005/gmock_test.vcproj msvc/2010/gmock.sln \ msvc/2010/gmock.vcxproj msvc/2010/gmock_config.props \ msvc/2010/gmock_main.vcxproj msvc/2010/gmock_test.vcxproj # We may need to build our internally packaged gtest. If so, it will be # included in the 'subdirs' variable. SUBDIRS = $(subdirs) # This is generated by the configure script, so clean it for distribution. DISTCLEANFILES = scripts/gmock-config # We define the global AM_CPPFLAGS as everything we compile includes from these # directories. AM_CPPFLAGS = $(GTEST_CPPFLAGS) -I$(srcdir)/include # Modifies compiler and linker flags for pthreads compatibility. @HAVE_PTHREADS_TRUE@AM_CXXFLAGS = @PTHREAD_CFLAGS@ -DGTEST_HAS_PTHREAD=1 @HAVE_PTHREADS_TRUE@AM_LIBS = @PTHREAD_LIBS@ # Build rules for libraries. lib_LTLIBRARIES = lib/libgmock.la lib/libgmock_main.la lib_libgmock_la_SOURCES = src/gmock-all.cc pkginclude_HEADERS = \ include/gmock/gmock-actions.h \ include/gmock/gmock-cardinalities.h \ include/gmock/gmock-generated-actions.h \ include/gmock/gmock-generated-function-mockers.h \ include/gmock/gmock-generated-matchers.h \ include/gmock/gmock-generated-nice-strict.h \ include/gmock/gmock-matchers.h \ include/gmock/gmock-more-actions.h \ include/gmock/gmock-spec-builders.h \ include/gmock/gmock.h pkginclude_internaldir = $(pkgincludedir)/internal pkginclude_internal_HEADERS = \ include/gmock/internal/gmock-generated-internal-utils.h \ include/gmock/internal/gmock-internal-utils.h \ include/gmock/internal/gmock-port.h lib_libgmock_main_la_SOURCES = src/gmock_main.cc lib_libgmock_main_la_LIBADD = lib/libgmock.la AM_LDFLAGS = $(GTEST_LDFLAGS) test_gmock_spec_builders_test_SOURCES = test/gmock-spec-builders_test.cc test_gmock_spec_builders_test_LDADD = $(GTEST_LIBS) lib/libgmock.la test_gmock_link_test_SOURCES = \ test/gmock_link2_test.cc \ test/gmock_link_test.cc \ test/gmock_link_test.h test_gmock_link_test_LDADD = $(GTEST_LIBS) lib/libgmock_main.la lib/libgmock.la test_gmock_fused_test_SOURCES = \ fused-src/gmock-gtest-all.cc \ fused-src/gmock/gmock.h \ fused-src/gmock_main.cc \ fused-src/gtest/gtest.h \ test/gmock_test.cc test_gmock_fused_test_CPPFLAGS = -I"$(srcdir)/fused-src" # Google Mock source files that we don't compile directly. GMOCK_SOURCE_INGLUDES = \ src/gmock-cardinalities.cc \ src/gmock-internal-utils.cc \ src/gmock-matchers.cc \ src/gmock-spec-builders.cc \ src/gmock.cc # Death tests may produce core dumps in the build directory. In case # this happens, clean them to keep distcleancheck happy. CLEANFILES = core all: all-recursive .SUFFIXES: .SUFFIXES: .cc .lo .o .obj am--refresh: @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): build-aux/config.h: build-aux/stamp-h1 @if test ! -f $@; then \ rm -f build-aux/stamp-h1; \ $(MAKE) $(AM_MAKEFLAGS) build-aux/stamp-h1; \ else :; fi build-aux/stamp-h1: $(top_srcdir)/build-aux/config.h.in $(top_builddir)/config.status @rm -f build-aux/stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status build-aux/config.h $(top_srcdir)/build-aux/config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f build-aux/stamp-h1 touch $@ distclean-hdr: -rm -f build-aux/config.h build-aux/stamp-h1 scripts/gmock-config: $(top_builddir)/config.status $(top_srcdir)/scripts/gmock-config.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done src/$(am__dirstamp): @$(MKDIR_P) src @: > src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) src/$(DEPDIR) @: > src/$(DEPDIR)/$(am__dirstamp) src/gmock-all.lo: src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp) lib/$(am__dirstamp): @$(MKDIR_P) lib @: > lib/$(am__dirstamp) lib/libgmock.la: $(lib_libgmock_la_OBJECTS) $(lib_libgmock_la_DEPENDENCIES) lib/$(am__dirstamp) $(CXXLINK) -rpath $(libdir) $(lib_libgmock_la_OBJECTS) $(lib_libgmock_la_LIBADD) $(LIBS) src/gmock_main.lo: src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp) lib/libgmock_main.la: $(lib_libgmock_main_la_OBJECTS) $(lib_libgmock_main_la_DEPENDENCIES) lib/$(am__dirstamp) $(CXXLINK) -rpath $(libdir) $(lib_libgmock_main_la_OBJECTS) $(lib_libgmock_main_la_LIBADD) $(LIBS) clean-checkPROGRAMS: @list='$(check_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list test/$(am__dirstamp): @$(MKDIR_P) test @: > test/$(am__dirstamp) test/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) test/$(DEPDIR) @: > test/$(DEPDIR)/$(am__dirstamp) test/gmock-spec-builders_test.$(OBJEXT): test/$(am__dirstamp) \ test/$(DEPDIR)/$(am__dirstamp) test/gmock-spec-builders_test$(EXEEXT): $(test_gmock_spec_builders_test_OBJECTS) $(test_gmock_spec_builders_test_DEPENDENCIES) test/$(am__dirstamp) @rm -f test/gmock-spec-builders_test$(EXEEXT) $(CXXLINK) $(test_gmock_spec_builders_test_OBJECTS) $(test_gmock_spec_builders_test_LDADD) $(LIBS) fused-src/$(am__dirstamp): @$(MKDIR_P) fused-src @: > fused-src/$(am__dirstamp) fused-src/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) fused-src/$(DEPDIR) @: > fused-src/$(DEPDIR)/$(am__dirstamp) fused-src/test_gmock_fused_test-gmock-gtest-all.$(OBJEXT): \ fused-src/$(am__dirstamp) fused-src/$(DEPDIR)/$(am__dirstamp) fused-src/test_gmock_fused_test-gmock_main.$(OBJEXT): \ fused-src/$(am__dirstamp) fused-src/$(DEPDIR)/$(am__dirstamp) test/test_gmock_fused_test-gmock_test.$(OBJEXT): test/$(am__dirstamp) \ test/$(DEPDIR)/$(am__dirstamp) test/gmock_fused_test$(EXEEXT): $(test_gmock_fused_test_OBJECTS) $(test_gmock_fused_test_DEPENDENCIES) test/$(am__dirstamp) @rm -f test/gmock_fused_test$(EXEEXT) $(CXXLINK) $(test_gmock_fused_test_OBJECTS) $(test_gmock_fused_test_LDADD) $(LIBS) test/gmock_link2_test.$(OBJEXT): test/$(am__dirstamp) \ test/$(DEPDIR)/$(am__dirstamp) test/gmock_link_test.$(OBJEXT): test/$(am__dirstamp) \ test/$(DEPDIR)/$(am__dirstamp) test/gmock_link_test$(EXEEXT): $(test_gmock_link_test_OBJECTS) $(test_gmock_link_test_DEPENDENCIES) test/$(am__dirstamp) @rm -f test/gmock_link_test$(EXEEXT) $(CXXLINK) $(test_gmock_link_test_OBJECTS) $(test_gmock_link_test_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) -rm -f fused-src/test_gmock_fused_test-gmock-gtest-all.$(OBJEXT) -rm -f fused-src/test_gmock_fused_test-gmock_main.$(OBJEXT) -rm -f src/gmock-all.$(OBJEXT) -rm -f src/gmock-all.lo -rm -f src/gmock_main.$(OBJEXT) -rm -f src/gmock_main.lo -rm -f test/gmock-spec-builders_test.$(OBJEXT) -rm -f test/gmock_link2_test.$(OBJEXT) -rm -f test/gmock_link_test.$(OBJEXT) -rm -f test/test_gmock_fused_test-gmock_test.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@src/$(DEPDIR)/gmock-all.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@src/$(DEPDIR)/gmock_main.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@test/$(DEPDIR)/gmock-spec-builders_test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@test/$(DEPDIR)/gmock_link2_test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@test/$(DEPDIR)/gmock_link_test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Po@am__quote@ .cc.o: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ $< .cc.obj: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cc.lo: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCXX_TRUE@ $(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(LTCXXCOMPILE) -c -o $@ $< fused-src/test_gmock_fused_test-gmock-gtest-all.o: fused-src/gmock-gtest-all.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/test_gmock_fused_test-gmock-gtest-all.o -MD -MP -MF fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Tpo -c -o fused-src/test_gmock_fused_test-gmock-gtest-all.o `test -f 'fused-src/gmock-gtest-all.cc' || echo '$(srcdir)/'`fused-src/gmock-gtest-all.cc @am__fastdepCXX_TRUE@ $(am__mv) fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Tpo fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gmock-gtest-all.cc' object='fused-src/test_gmock_fused_test-gmock-gtest-all.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/test_gmock_fused_test-gmock-gtest-all.o `test -f 'fused-src/gmock-gtest-all.cc' || echo '$(srcdir)/'`fused-src/gmock-gtest-all.cc fused-src/test_gmock_fused_test-gmock-gtest-all.obj: fused-src/gmock-gtest-all.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/test_gmock_fused_test-gmock-gtest-all.obj -MD -MP -MF fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Tpo -c -o fused-src/test_gmock_fused_test-gmock-gtest-all.obj `if test -f 'fused-src/gmock-gtest-all.cc'; then $(CYGPATH_W) 'fused-src/gmock-gtest-all.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gmock-gtest-all.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Tpo fused-src/$(DEPDIR)/test_gmock_fused_test-gmock-gtest-all.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gmock-gtest-all.cc' object='fused-src/test_gmock_fused_test-gmock-gtest-all.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/test_gmock_fused_test-gmock-gtest-all.obj `if test -f 'fused-src/gmock-gtest-all.cc'; then $(CYGPATH_W) 'fused-src/gmock-gtest-all.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gmock-gtest-all.cc'; fi` fused-src/test_gmock_fused_test-gmock_main.o: fused-src/gmock_main.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/test_gmock_fused_test-gmock_main.o -MD -MP -MF fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Tpo -c -o fused-src/test_gmock_fused_test-gmock_main.o `test -f 'fused-src/gmock_main.cc' || echo '$(srcdir)/'`fused-src/gmock_main.cc @am__fastdepCXX_TRUE@ $(am__mv) fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Tpo fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gmock_main.cc' object='fused-src/test_gmock_fused_test-gmock_main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/test_gmock_fused_test-gmock_main.o `test -f 'fused-src/gmock_main.cc' || echo '$(srcdir)/'`fused-src/gmock_main.cc fused-src/test_gmock_fused_test-gmock_main.obj: fused-src/gmock_main.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/test_gmock_fused_test-gmock_main.obj -MD -MP -MF fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Tpo -c -o fused-src/test_gmock_fused_test-gmock_main.obj `if test -f 'fused-src/gmock_main.cc'; then $(CYGPATH_W) 'fused-src/gmock_main.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gmock_main.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Tpo fused-src/$(DEPDIR)/test_gmock_fused_test-gmock_main.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gmock_main.cc' object='fused-src/test_gmock_fused_test-gmock_main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/test_gmock_fused_test-gmock_main.obj `if test -f 'fused-src/gmock_main.cc'; then $(CYGPATH_W) 'fused-src/gmock_main.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gmock_main.cc'; fi` test/test_gmock_fused_test-gmock_test.o: test/gmock_test.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT test/test_gmock_fused_test-gmock_test.o -MD -MP -MF test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Tpo -c -o test/test_gmock_fused_test-gmock_test.o `test -f 'test/gmock_test.cc' || echo '$(srcdir)/'`test/gmock_test.cc @am__fastdepCXX_TRUE@ $(am__mv) test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Tpo test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='test/gmock_test.cc' object='test/test_gmock_fused_test-gmock_test.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o test/test_gmock_fused_test-gmock_test.o `test -f 'test/gmock_test.cc' || echo '$(srcdir)/'`test/gmock_test.cc test/test_gmock_fused_test-gmock_test.obj: test/gmock_test.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT test/test_gmock_fused_test-gmock_test.obj -MD -MP -MF test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Tpo -c -o test/test_gmock_fused_test-gmock_test.obj `if test -f 'test/gmock_test.cc'; then $(CYGPATH_W) 'test/gmock_test.cc'; else $(CYGPATH_W) '$(srcdir)/test/gmock_test.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Tpo test/$(DEPDIR)/test_gmock_fused_test-gmock_test.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='test/gmock_test.cc' object='test/test_gmock_fused_test-gmock_test.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_gmock_fused_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o test/test_gmock_fused_test-gmock_test.obj `if test -f 'test/gmock_test.cc'; then $(CYGPATH_W) 'test/gmock_test.cc'; else $(CYGPATH_W) '$(srcdir)/test/gmock_test.cc'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs -rm -rf lib/.libs lib/_libs -rm -rf src/.libs src/_libs -rm -rf test/.libs test/_libs distclean-libtool: -rm -f libtool config.lt install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgincludedir)" || exit $$?; \ done uninstall-pkgincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(pkgincludedir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(pkgincludedir)" && rm -f $$files install-pkginclude_internalHEADERS: $(pkginclude_internal_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkginclude_internaldir)" || $(MKDIR_P) "$(DESTDIR)$(pkginclude_internaldir)" @list='$(pkginclude_internal_HEADERS)'; test -n "$(pkginclude_internaldir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkginclude_internaldir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkginclude_internaldir)" || exit $$?; \ done uninstall-pkginclude_internalHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_internal_HEADERS)'; test -n "$(pkginclude_internaldir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(pkginclude_internaldir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(pkginclude_internaldir)" && rm -f $$files # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ echo "$$grn$$dashes"; \ else \ echo "$$red$$dashes"; \ fi; \ echo "$$banner"; \ test -z "$$skipped" || echo "$$skipped"; \ test -z "$$report" || echo "$$report"; \ echo "$$dashes$$std"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | xz -c >$(distdir).tar.xz $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @$(am__cd) '$(distuninstallcheck_dir)' \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am $(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS) $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-recursive all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkginclude_internaldir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) -rm -f fused-src/$(DEPDIR)/$(am__dirstamp) -rm -f fused-src/$(am__dirstamp) -rm -f lib/$(am__dirstamp) -rm -f src/$(DEPDIR)/$(am__dirstamp) -rm -f src/$(am__dirstamp) -rm -f test/$(DEPDIR)/$(am__dirstamp) -rm -f test/$(am__dirstamp) -test -z "$(DISTCLEANFILES)" || rm -f $(DISTCLEANFILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-checkPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf fused-src/$(DEPDIR) src/$(DEPDIR) test/$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-libtool distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-data-local install-pkgincludeHEADERS \ install-pkginclude_internalHEADERS install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-exec-local install-libLTLIBRARIES install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf fused-src/$(DEPDIR) src/$(DEPDIR) test/$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic \ maintainer-clean-local mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-libLTLIBRARIES uninstall-pkgincludeHEADERS \ uninstall-pkginclude_internalHEADERS .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) check-am \ ctags-recursive install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-TESTS check-am clean \ clean-checkPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool ctags ctags-recursive dist dist-all dist-bzip2 \ dist-gzip dist-lzma dist-shar dist-tarZ dist-xz dist-zip \ distcheck distclean distclean-compile distclean-generic \ distclean-hdr distclean-libtool distclean-tags distcleancheck \ distdir distuninstallcheck dvi dvi-am html html-am info \ info-am install install-am install-data install-data-am \ install-data-local install-dvi install-dvi-am install-exec \ install-exec-am install-exec-local install-html \ install-html-am install-info install-info-am \ install-libLTLIBRARIES install-man install-pdf install-pdf-am \ install-pkgincludeHEADERS install-pkginclude_internalHEADERS \ install-ps install-ps-am install-strip installcheck \ installcheck-am installdirs installdirs-am maintainer-clean \ maintainer-clean-generic maintainer-clean-local mostlyclean \ mostlyclean-compile mostlyclean-generic mostlyclean-libtool \ pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \ uninstall-libLTLIBRARIES uninstall-pkgincludeHEADERS \ uninstall-pkginclude_internalHEADERS # gmock_test.cc does not really depend on files generated by the # fused-gmock-internal rule. However, gmock_test.o does, and it is # important to include test/gmock_test.cc as part of this rule in order to # prevent compiling gmock_test.o until all dependent files have been # generated. $(test_gmock_fused_test_SOURCES): fused-gmock-internal # TODO(vladl@google.com): Find a way to add Google Tests's sources here. fused-gmock-internal: $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) \ $(lib_libgmock_la_SOURCES) $(GMOCK_SOURCE_INGLUDES) \ $(lib_libgmock_main_la_SOURCES) \ scripts/fuse_gmock_files.py mkdir -p "$(srcdir)/fused-src" chmod -R u+w "$(srcdir)/fused-src" rm -f "$(srcdir)/fused-src/gtest/gtest.h" rm -f "$(srcdir)/fused-src/gmock/gmock.h" rm -f "$(srcdir)/fused-src/gmock-gtest-all.cc" "$(srcdir)/scripts/fuse_gmock_files.py" "$(srcdir)/fused-src" cp -f "$(srcdir)/src/gmock_main.cc" "$(srcdir)/fused-src" maintainer-clean-local: rm -rf "$(srcdir)/fused-src" # Disables 'make install' as installing a compiled version of Google # Mock can lead to undefined behavior due to violation of the # One-Definition Rule. install-exec-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Mock into your build system." false install-data-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Mock into your build system." false # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: synergy-1.4.12-Source/tools/gmock-1.6.0/make/Makefile0000600000175000017500000000665511561126632022003 0ustar synergysynergy# A sample Makefile for building both Google Mock and Google Test and # using them in user tests. This file is self-contained, so you don't # need to use the Makefile in Google Test's source tree. Please tweak # it to suit your environment and project. You may want to move it to # your project's root directory. # # SYNOPSIS: # # make [all] - makes everything. # make TARGET - makes the given target. # make clean - removes all files generated by make. # Please tweak the following variable definitions as needed by your # project, except GMOCK_HEADERS and GTEST_HEADERS, which you can use # in your own targets but shouldn't modify. # Points to the root of Google Test, relative to where this file is. # Remember to tweak this if you move this file, or if you want to use # a copy of Google Test at a different location. GTEST_DIR = ../gtest # Points to the root of Google Mock, relative to where this file is. # Remember to tweak this if you move this file. GMOCK_DIR = .. # Where to find user code. USER_DIR = ../test # Flags passed to the preprocessor. CPPFLAGS += -I$(GTEST_DIR)/include -I$(GMOCK_DIR)/include # Flags passed to the C++ compiler. CXXFLAGS += -g -Wall -Wextra # All tests produced by this Makefile. Remember to add new tests you # created to the list. TESTS = gmock_test # All Google Test headers. Usually you shouldn't change this # definition. GTEST_HEADERS = $(GTEST_DIR)/include/gtest/*.h \ $(GTEST_DIR)/include/gtest/internal/*.h # All Google Mock headers. Note that all Google Test headers are # included here too, as they are #included by Google Mock headers. # Usually you shouldn't change this definition. GMOCK_HEADERS = $(GMOCK_DIR)/include/gmock/*.h \ $(GMOCK_DIR)/include/gmock/internal/*.h \ $(GTEST_HEADERS) # House-keeping build targets. all : $(TESTS) clean : rm -f $(TESTS) gmock.a gmock_main.a *.o # Builds gmock.a and gmock_main.a. These libraries contain both # Google Mock and Google Test. A test should link with either gmock.a # or gmock_main.a, depending on whether it defines its own main() # function. It's fine if your test only uses features from Google # Test (and not Google Mock). # Usually you shouldn't tweak such internal variables, indicated by a # trailing _. GTEST_SRCS_ = $(GTEST_DIR)/src/*.cc $(GTEST_DIR)/src/*.h $(GTEST_HEADERS) GMOCK_SRCS_ = $(GMOCK_DIR)/src/*.cc $(GMOCK_HEADERS) # For simplicity and to avoid depending on implementation details of # Google Mock and Google Test, the dependencies specified below are # conservative and not optimized. This is fine as Google Mock and # Google Test compile fast and for ordinary users their source rarely # changes. gtest-all.o : $(GTEST_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) -I$(GMOCK_DIR) $(CXXFLAGS) \ -c $(GTEST_DIR)/src/gtest-all.cc gmock-all.o : $(GMOCK_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) -I$(GMOCK_DIR) $(CXXFLAGS) \ -c $(GMOCK_DIR)/src/gmock-all.cc gmock_main.o : $(GMOCK_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) -I$(GMOCK_DIR) $(CXXFLAGS) \ -c $(GMOCK_DIR)/src/gmock_main.cc gmock.a : gmock-all.o gtest-all.o $(AR) $(ARFLAGS) $@ $^ gmock_main.a : gmock-all.o gtest-all.o gmock_main.o $(AR) $(ARFLAGS) $@ $^ # Builds a sample test. gmock_test.o : $(USER_DIR)/gmock_test.cc $(GMOCK_HEADERS) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(USER_DIR)/gmock_test.cc gmock_test : gmock_test.o gmock_main.a $(CXX) $(CPPFLAGS) $(CXXFLAGS) -lpthread $^ -o $@ synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/0000700000175000017500000000000012140644175020361 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/0000700000175000017500000000000012140644175020747 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/gmock.sln0000600000175000017500000000337411561126632022575 0ustar synergysynergy Microsoft Visual Studio Solution File, Format Version 9.00 # Visual Studio 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock", "gmock.vcproj", "{34681F0D-CE45-415D-B5F2-5C662DFE3BD5}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock_test", "gmock_test.vcproj", "{F10D22F8-AC7B-4213-8720-608E7D878CD2}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock_main", "gmock_main.vcproj", "{E4EF614B-30DF-4954-8C53-580A0BF6B589}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Debug|Win32.ActiveCfg = Debug|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Debug|Win32.Build.0 = Debug|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Release|Win32.ActiveCfg = Release|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Release|Win32.Build.0 = Release|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Debug|Win32.ActiveCfg = Debug|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Debug|Win32.Build.0 = Debug|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Release|Win32.ActiveCfg = Release|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Release|Win32.Build.0 = Release|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Debug|Win32.ActiveCfg = Debug|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Debug|Win32.Build.0 = Debug|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Release|Win32.ActiveCfg = Release|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/gmock.vcproj0000600000175000017500000000763111561126632023304 0ustar synergysynergy synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/gmock_config.vsprops0000600000175000017500000000052511561126632025035 0ustar synergysynergy synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/gmock_main.vcproj0000600000175000017500000000763011561126632024307 0ustar synergysynergy synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2005/gmock_test.vcproj0000600000175000017500000001023311561126632024333 0ustar synergysynergy synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/0000700000175000017500000000000012140644175020743 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/gmock.sln0000600000175000017500000000340511561126632022564 0ustar synergysynergy Microsoft Visual Studio Solution File, Format Version 11.00 # Visual C++ Express 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock", "gmock.vcxproj", "{34681F0D-CE45-415D-B5F2-5C662DFE3BD5}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock_test", "gmock_test.vcxproj", "{F10D22F8-AC7B-4213-8720-608E7D878CD2}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gmock_main", "gmock_main.vcxproj", "{E4EF614B-30DF-4954-8C53-580A0BF6B589}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Debug|Win32.ActiveCfg = Debug|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Debug|Win32.Build.0 = Debug|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Release|Win32.ActiveCfg = Release|Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5}.Release|Win32.Build.0 = Release|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Debug|Win32.ActiveCfg = Debug|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Debug|Win32.Build.0 = Debug|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Release|Win32.ActiveCfg = Release|Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2}.Release|Win32.Build.0 = Release|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Debug|Win32.ActiveCfg = Debug|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Debug|Win32.Build.0 = Debug|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Release|Win32.ActiveCfg = Release|Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/gmock.vcxproj0000600000175000017500000001107611561126632023466 0ustar synergysynergy Debug Win32 Release Win32 {34681F0D-CE45-415D-B5F2-5C662DFE3BD5} gmock Win32Proj StaticLibrary Unicode true StaticLibrary Unicode <_ProjectFileVersion>10.0.30319.1 $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ Disabled ..\..\include;..\..;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_LIB;%(PreprocessorDefinitions) true EnableFastChecks MultiThreadedDebug Level3 ProgramDatabase ..\..\include;..\..;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) MultiThreaded Level3 ProgramDatabase $(GTestDir);%(AdditionalIncludeDirectories) $(GTestDir);%(AdditionalIncludeDirectories) synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/gmock_config.props0000600000175000017500000000126011561126632024455 0ustar synergysynergy ../../gtest <_ProjectFileVersion>10.0.30319.1 $(GTestDir)/include;%(AdditionalIncludeDirectories) $(GTestDir) synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/gmock_main.vcxproj0000600000175000017500000001146311561126632024472 0ustar synergysynergy Debug Win32 Release Win32 {E4EF614B-30DF-4954-8C53-580A0BF6B589} gmock_main Win32Proj StaticLibrary Unicode true StaticLibrary Unicode <_ProjectFileVersion>10.0.30319.1 $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ Disabled ../../include;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_LIB;%(PreprocessorDefinitions) true EnableFastChecks MultiThreadedDebug Level3 ProgramDatabase ../../include;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) MultiThreaded Level3 ProgramDatabase {34681f0d-ce45-415d-b5f2-5c662dfe3bd5} true true ../../include;%(AdditionalIncludeDirectories) ../../include;%(AdditionalIncludeDirectories) synergy-1.4.12-Source/tools/gmock-1.6.0/msvc/2010/gmock_test.vcxproj0000600000175000017500000001243011561126632024520 0ustar synergysynergy Debug Win32 Release Win32 {F10D22F8-AC7B-4213-8720-608E7D878CD2} gmock_test Win32Proj Application Unicode true Application Unicode <_ProjectFileVersion>10.0.30319.1 $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ true $(SolutionDir)$(Configuration)\ $(OutDir)$(ProjectName)\ false /bigobj %(AdditionalOptions) Disabled ..\..\include;..\..;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) true EnableFastChecks MultiThreadedDebug Level3 ProgramDatabase true Console MachineX86 /bigobj %(AdditionalOptions) ..\..\include;..\..;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded Level3 ProgramDatabase true Console true true MachineX86 {e4ef614b-30df-4954-8c53-580a0bf6b589} true true synergy-1.4.12-Source/tools/gmock-1.6.0/README0000600000175000017500000003253211561126632020277 0ustar synergysynergyGoogle C++ Mocking Framework ============================ http://code.google.com/p/googlemock/ Overview -------- Google's framework for writing and using C++ mock classes on a variety of platforms (Linux, Mac OS X, Windows, Windows CE, Symbian, etc). Inspired by jMock, EasyMock, and Hamcrest, and designed with C++'s specifics in mind, it can help you derive better designs of your system and write better tests. Google Mock: - provides a declarative syntax for defining mocks, - can easily define partial (hybrid) mocks, which are a cross of real and mock objects, - handles functions of arbitrary types and overloaded functions, - comes with a rich set of matchers for validating function arguments, - uses an intuitive syntax for controlling the behavior of a mock, - does automatic verification of expectations (no record-and-replay needed), - allows arbitrary (partial) ordering constraints on function calls to be expressed, - lets a user extend it by defining new matchers and actions. - does not use exceptions, and - is easy to learn and use. Please see the project page above for more information as well as the mailing list for questions, discussions, and development. There is also an IRC channel on OFTC (irc.oftc.net) #gtest available. Please join us! Please note that code under scripts/generator/ is from the cppclean project (http://code.google.com/p/cppclean/) and under the Apache License, which is different from Google Mock's license. Requirements for End Users -------------------------- Google Mock is implemented on top of the Google Test C++ testing framework (http://code.google.com/p/googletest/), and includes the latter as part of the SVN repositary and distribution package. You must use the bundled version of Google Test when using Google Mock, or you may get compiler/linker errors. You can also easily configure Google Mock to work with another testing framework of your choice; although it will still need Google Test as an internal dependency. Please read http://code.google.com/p/googlemock/wiki/ForDummies#Using_Google_Mock_with_Any_Testing_Framework for how to do it. Google Mock depends on advanced C++ features and thus requires a more modern compiler. The following are needed to use Google Mock: ### Linux Requirements ### These are the base requirements to build and use Google Mock from a source package (as described below): * GNU-compatible Make or "gmake" * POSIX-standard shell * POSIX(-2) Regular Expressions (regex.h) * C++98-standard-compliant compiler (e.g. GCC 3.4 or newer) ### Windows Requirements ### * Microsoft Visual C++ 8.0 SP1 or newer ### Mac OS X Requirements ### * Mac OS X 10.4 Tiger or newer * Developer Tools Installed Requirements for Contributors ----------------------------- We welcome patches. If you plan to contribute a patch, you need to build Google Mock and its own tests from an SVN checkout (described below), which has further requirements: * Automake version 1.9 or newer * Autoconf version 2.59 or newer * Libtool / Libtoolize * Python version 2.3 or newer (for running some of the tests and re-generating certain source files from templates) Getting the Source ------------------ There are two primary ways of getting Google Mock's source code: you can download a stable source release in your preferred archive format, or directly check out the source from our Subversion (SVN) repositary. The SVN checkout requires a few extra steps and some extra software packages on your system, but lets you track development and make patches much more easily, so we highly encourage it. ### Source Package ### Google Mock is released in versioned source packages which can be downloaded from the download page [1]. Several different archive formats are provided, but the only difference is the tools needed to extract their contents, and the size of the resulting file. Download whichever you are most comfortable with. [1] http://code.google.com/p/googlemock/downloads/list Once downloaded expand the archive using whichever tools you prefer for that type. This will always result in a new directory with the name "gmock-X.Y.Z" which contains all of the source code. Here are some examples on Linux: tar -xvzf gmock-X.Y.Z.tar.gz tar -xvjf gmock-X.Y.Z.tar.bz2 unzip gmock-X.Y.Z.zip ### SVN Checkout ### To check out the main branch (also known as the "trunk") of Google Mock, run the following Subversion command: svn checkout http://googlemock.googlecode.com/svn/trunk/ gmock-svn If you are using a *nix system and plan to use the GNU Autotools build system to build Google Mock (described below), you'll need to configure it now. Otherwise you are done with getting the source files. To prepare the Autotools build system, enter the target directory of the checkout command you used ('gmock-svn') and proceed with the following command: autoreconf -fvi Once you have completed this step, you are ready to build the library. Note that you should only need to complete this step once. The subsequent 'make' invocations will automatically re-generate the bits of the build system that need to be changed. If your system uses older versions of the autotools, the above command will fail. You may need to explicitly specify a version to use. For instance, if you have both GNU Automake 1.4 and 1.9 installed and 'automake' would invoke the 1.4, use instead: AUTOMAKE=automake-1.9 ACLOCAL=aclocal-1.9 autoreconf -fvi Make sure you're using the same version of automake and aclocal. Setting up the Build -------------------- To build Google Mock and your tests that use it, you need to tell your build system where to find its headers and source files. The exact way to do it depends on which build system you use, and is usually straightforward. ### Generic Build Instructions ### This section shows how you can integrate Google Mock into your existing build system. Suppose you put Google Mock in directory ${GMOCK_DIR} and Google Test in ${GTEST_DIR} (the latter is ${GMOCK_DIR}/gtest by default). To build Google Mock, create a library build target (or a project as called by Visual Studio and Xcode) to compile ${GTEST_DIR}/src/gtest-all.cc and ${GMOCK_DIR}/src/gmock-all.cc with ${GTEST_DIR}/include, ${GTEST_DIR}, ${GMOCK_DIR}/include, and ${GMOCK_DIR} in the header search path. Assuming a Linux-like system and gcc, something like the following will do: g++ -I${GTEST_DIR}/include -I${GTEST_DIR} -I${GMOCK_DIR}/include \ -I${GMOCK_DIR} -c ${GTEST_DIR}/src/gtest-all.cc g++ -I${GTEST_DIR}/include -I${GTEST_DIR} -I${GMOCK_DIR}/include \ -I${GMOCK_DIR} -c ${GMOCK_DIR}/src/gmock-all.cc ar -rv libgmock.a gtest-all.o gmock-all.o Next, you should compile your test source file with ${GTEST_DIR}/include and ${GMOCK_DIR}/include in the header search path, and link it with gmock and any other necessary libraries: g++ -I${GTEST_DIR}/include -I${GMOCK_DIR}/include \ path/to/your_test.cc libgmock.a -o your_test As an example, the make/ directory contains a Makefile that you can use to build Google Mock on systems where GNU make is available (e.g. Linux, Mac OS X, and Cygwin). It doesn't try to build Google Mock's own tests. Instead, it just builds the Google Mock library and a sample test. You can use it as a starting point for your own build script. If the default settings are correct for your environment, the following commands should succeed: cd ${GMOCK_DIR}/make make ./gmock_test If you see errors, try to tweak the contents of make/Makefile to make them go away. There are instructions in make/Makefile on how to do it. ### Windows ### The msvc/2005 directory contains VC++ 2005 projects and the msvc/2010 directory contains VC++ 2010 projects for building Google Mock and selected tests. Change to the appropriate directory and run "msbuild gmock.sln" to build the library and tests (or open the gmock.sln in the MSVC IDE). If you want to create your own project to use with Google Mock, you'll have to configure it to use the gmock_config propety sheet. For that: * Open the Property Manager window (View | Other Windows | Property Manager) * Right-click on your project and select "Add Existing Property Sheet..." * Navigate to gmock_config.vsprops or gmock_config.props and select it. * In Project Properties | Configuration Properties | General | Additional Include Directories, type /include. Tweaking Google Mock -------------------- Google Mock can be used in diverse environments. The default configuration may not work (or may not work well) out of the box in some environments. However, you can easily tweak Google Mock by defining control macros on the compiler command line. Generally, these macros are named like GTEST_XYZ and you define them to either 1 or 0 to enable or disable a certain feature. We list the most frequently used macros below. For a complete list, see file ${GTEST_DIR}/include/gtest/internal/gtest-port.h. ### Choosing a TR1 Tuple Library ### Google Mock uses the C++ Technical Report 1 (TR1) tuple library heavily. Unfortunately TR1 tuple is not yet widely available with all compilers. The good news is that Google Test 1.4.0+ implements a subset of TR1 tuple that's enough for Google Mock's need. Google Mock will automatically use that implementation when the compiler doesn't provide TR1 tuple. Usually you don't need to care about which tuple library Google Test and Google Mock use. However, if your project already uses TR1 tuple, you need to tell Google Test and Google Mock to use the same TR1 tuple library the rest of your project uses, or the two tuple implementations will clash. To do that, add -DGTEST_USE_OWN_TR1_TUPLE=0 to the compiler flags while compiling Google Test, Google Mock, and your tests. If you want to force Google Test and Google Mock to use their own tuple library, just add -DGTEST_USE_OWN_TR1_TUPLE=1 to the compiler flags instead. If you want to use Boost's TR1 tuple library with Google Mock, please refer to the Boost website (http://www.boost.org/) for how to obtain it and set it up. ### Tweaking Google Test ### Most of Google Test's control macros apply to Google Mock as well. Please see file ${GTEST_DIR}/README for how to tweak them. Upgrading from an Earlier Version --------------------------------- We strive to keep Google Mock releases backward compatible. Sometimes, though, we have to make some breaking changes for the users' long-term benefits. This section describes what you'll need to do if you are upgrading from an earlier version of Google Mock. ### Upgrading from 1.1.0 or Earlier ### You may need to explicitly enable or disable Google Test's own TR1 tuple library. See the instructions in section "Choosing a TR1 Tuple Library". ### Upgrading from 1.4.0 or Earlier ### On platforms where the pthread library is available, Google Test and Google Mock use it in order to be thread-safe. For this to work, you may need to tweak your compiler and/or linker flags. Please see the "Multi-threaded Tests" section in file ${GTEST_DIR}/README for what you may need to do. If you have custom matchers defined using MatcherInterface or MakePolymorphicMatcher(), you'll need to update their definitions to use the new matcher API [2]. Matchers defined using MATCHER() or MATCHER_P*() aren't affected. [2] http://code.google.com/p/googlemock/wiki/CookBook#Writing_New_Monomorphic_Matchers, http://code.google.com/p/googlemock/wiki/CookBook#Writing_New_Polymorphic_Matchers Developing Google Mock ---------------------- This section discusses how to make your own changes to Google Mock. ### Testing Google Mock Itself ### To make sure your changes work as intended and don't break existing functionality, you'll want to compile and run Google Test's own tests. For that you'll need Autotools. First, make sure you have followed the instructions in section "SVN Checkout" to configure Google Mock. Then, create a build output directory and enter it. Next, ${GMOCK_DIR}/configure # Standard GNU configure script, --help for more info Once you have successfully configured Google Mock, the build steps are standard for GNU-style OSS packages. make # Standard makefile following GNU conventions make check # Builds and runs all tests - all should pass. Note that when building your project against Google Mock, you are building against Google Test as well. There is no need to configure Google Test separately. ### Regenerating Source Files ### Some of Google Mock's source files are generated from templates (not in the C++ sense) using a script. A template file is named FOO.pump, where FOO is the name of the file it will generate. For example, the file include/gmock/gmock-generated-actions.h.pump is used to generate gmock-generated-actions.h in the same directory. Normally you don't need to worry about regenerating the source files, unless you need to modify them. In that case, you should modify the corresponding .pump files instead and run the 'pump' script (for Pump is Useful for Meta Programming) to regenerate them. You can find pump.py in the ${GTEST_DIR}/scripts/ directory. Read the Pump manual [3] for how to use it. [3] http://code.google.com/p/googletest/wiki/PumpManual. ### Contributing a Patch ### We welcome patches. Please read the Google Mock developer's guide [4] for how you can contribute. In particular, make sure you have signed the Contributor License Agreement, or we won't be able to accept the patch. [4] http://code.google.com/p/googlemock/wiki/DevGuide Happy testing! synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/0000700000175000017500000000000012140644175021100 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/scripts/fuse_gmock_files.py0000600000175000017500000002063611561126632024766 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """fuse_gmock_files.py v0.1.0 Fuses Google Mock and Google Test source code into two .h files and a .cc file. SYNOPSIS fuse_gmock_files.py [GMOCK_ROOT_DIR] OUTPUT_DIR Scans GMOCK_ROOT_DIR for Google Mock and Google Test source code, assuming Google Test is in the GMOCK_ROOT_DIR/gtest sub-directory, and generates three files: OUTPUT_DIR/gtest/gtest.h, OUTPUT_DIR/gmock/gmock.h, and OUTPUT_DIR/gmock-gtest-all.cc. Then you can build your tests by adding OUTPUT_DIR to the include search path and linking with OUTPUT_DIR/gmock-gtest-all.cc. These three files contain everything you need to use Google Mock. Hence you can "install" Google Mock by copying them to wherever you want. GMOCK_ROOT_DIR can be omitted and defaults to the parent directory of the directory holding this script. EXAMPLES ./fuse_gmock_files.py fused_gmock ./fuse_gmock_files.py path/to/unpacked/gmock fused_gmock This tool is experimental. In particular, it assumes that there is no conditional inclusion of Google Mock or Google Test headers. Please report any problems to googlemock@googlegroups.com. You can read http://code.google.com/p/googlemock/wiki/CookBook for more information. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sets import sys # We assume that this file is in the scripts/ directory in the Google # Mock root directory. DEFAULT_GMOCK_ROOT_DIR = os.path.join(os.path.dirname(__file__), '..') # We need to call into gtest/scripts/fuse_gtest_files.py. sys.path.append(os.path.join(DEFAULT_GMOCK_ROOT_DIR, 'gtest/scripts')) import fuse_gtest_files gtest = fuse_gtest_files # Regex for matching '#include "gmock/..."'. INCLUDE_GMOCK_FILE_REGEX = re.compile(r'^\s*#\s*include\s*"(gmock/.+)"') # Where to find the source seed files. GMOCK_H_SEED = 'include/gmock/gmock.h' GMOCK_ALL_CC_SEED = 'src/gmock-all.cc' # Where to put the generated files. GTEST_H_OUTPUT = 'gtest/gtest.h' GMOCK_H_OUTPUT = 'gmock/gmock.h' GMOCK_GTEST_ALL_CC_OUTPUT = 'gmock-gtest-all.cc' def GetGTestRootDir(gmock_root): """Returns the root directory of Google Test.""" return os.path.join(gmock_root, 'gtest') def ValidateGMockRootDir(gmock_root): """Makes sure gmock_root points to a valid gmock root directory. The function aborts the program on failure. """ gtest.ValidateGTestRootDir(GetGTestRootDir(gmock_root)) gtest.VerifyFileExists(gmock_root, GMOCK_H_SEED) gtest.VerifyFileExists(gmock_root, GMOCK_ALL_CC_SEED) def ValidateOutputDir(output_dir): """Makes sure output_dir points to a valid output directory. The function aborts the program on failure. """ gtest.VerifyOutputFile(output_dir, gtest.GTEST_H_OUTPUT) gtest.VerifyOutputFile(output_dir, GMOCK_H_OUTPUT) gtest.VerifyOutputFile(output_dir, GMOCK_GTEST_ALL_CC_OUTPUT) def FuseGMockH(gmock_root, output_dir): """Scans folder gmock_root to generate gmock/gmock.h in output_dir.""" output_file = file(os.path.join(output_dir, GMOCK_H_OUTPUT), 'w') processed_files = sets.Set() # Holds all gmock headers we've processed. def ProcessFile(gmock_header_path): """Processes the given gmock header file.""" # We don't process the same header twice. if gmock_header_path in processed_files: return processed_files.add(gmock_header_path) # Reads each line in the given gmock header. for line in file(os.path.join(gmock_root, gmock_header_path), 'r'): m = INCLUDE_GMOCK_FILE_REGEX.match(line) if m: # It's '#include "gmock/..."' - let's process it recursively. ProcessFile('include/' + m.group(1)) else: m = gtest.INCLUDE_GTEST_FILE_REGEX.match(line) if m: # It's '#include "gtest/foo.h"'. We translate it to # "gtest/gtest.h", regardless of what foo is, since all # gtest headers are fused into gtest/gtest.h. # There is no need to #include gtest.h twice. if not gtest.GTEST_H_SEED in processed_files: processed_files.add(gtest.GTEST_H_SEED) output_file.write('#include "%s"\n' % (gtest.GTEST_H_OUTPUT,)) else: # Otherwise we copy the line unchanged to the output file. output_file.write(line) ProcessFile(GMOCK_H_SEED) output_file.close() def FuseGMockAllCcToFile(gmock_root, output_file): """Scans folder gmock_root to fuse gmock-all.cc into output_file.""" processed_files = sets.Set() def ProcessFile(gmock_source_file): """Processes the given gmock source file.""" # We don't process the same #included file twice. if gmock_source_file in processed_files: return processed_files.add(gmock_source_file) # Reads each line in the given gmock source file. for line in file(os.path.join(gmock_root, gmock_source_file), 'r'): m = INCLUDE_GMOCK_FILE_REGEX.match(line) if m: # It's '#include "gmock/foo.h"'. We treat it as '#include # "gmock/gmock.h"', as all other gmock headers are being fused # into gmock.h and cannot be #included directly. # There is no need to #include "gmock/gmock.h" more than once. if not GMOCK_H_SEED in processed_files: processed_files.add(GMOCK_H_SEED) output_file.write('#include "%s"\n' % (GMOCK_H_OUTPUT,)) else: m = gtest.INCLUDE_GTEST_FILE_REGEX.match(line) if m: # It's '#include "gtest/..."'. # There is no need to #include gtest.h as it has been # #included by gtest-all.cc. pass else: m = gtest.INCLUDE_SRC_FILE_REGEX.match(line) if m: # It's '#include "src/foo"' - let's process it recursively. ProcessFile(m.group(1)) else: # Otherwise we copy the line unchanged to the output file. output_file.write(line) ProcessFile(GMOCK_ALL_CC_SEED) def FuseGMockGTestAllCc(gmock_root, output_dir): """Scans folder gmock_root to generate gmock-gtest-all.cc in output_dir.""" output_file = file(os.path.join(output_dir, GMOCK_GTEST_ALL_CC_OUTPUT), 'w') # First, fuse gtest-all.cc into gmock-gtest-all.cc. gtest.FuseGTestAllCcToFile(GetGTestRootDir(gmock_root), output_file) # Next, append fused gmock-all.cc to gmock-gtest-all.cc. FuseGMockAllCcToFile(gmock_root, output_file) output_file.close() def FuseGMock(gmock_root, output_dir): """Fuses gtest.h, gmock.h, and gmock-gtest-all.h.""" ValidateGMockRootDir(gmock_root) ValidateOutputDir(output_dir) gtest.FuseGTestH(GetGTestRootDir(gmock_root), output_dir) FuseGMockH(gmock_root, output_dir) FuseGMockGTestAllCc(gmock_root, output_dir) def main(): argc = len(sys.argv) if argc == 2: # fuse_gmock_files.py OUTPUT_DIR FuseGMock(DEFAULT_GMOCK_ROOT_DIR, sys.argv[1]) elif argc == 3: # fuse_gmock_files.py GMOCK_ROOT_DIR OUTPUT_DIR FuseGMock(sys.argv[1], sys.argv[2]) else: print __doc__ sys.exit(1) if __name__ == '__main__': main() synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/0000700000175000017500000000000012140644175023066 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/COPYING0000600000175000017500000002617211561126632024132 0ustar synergysynergy Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [2007] Neal Norwitz Portions Copyright [2007] Google Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/0000700000175000017500000000000012140644175023650 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/ast.py0000600000175000017500000017151511561126632025024 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2007 Neal Norwitz # Portions Copyright 2007 Google Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Generate an Abstract Syntax Tree (AST) for C++.""" __author__ = 'nnorwitz@google.com (Neal Norwitz)' # TODO: # * Tokens should never be exported, need to convert to Nodes # (return types, parameters, etc.) # * Handle static class data for templatized classes # * Handle casts (both C++ and C-style) # * Handle conditions and loops (if/else, switch, for, while/do) # # TODO much, much later: # * Handle #define # * exceptions try: # Python 3.x import builtins except ImportError: # Python 2.x import __builtin__ as builtins import sys import traceback from cpp import keywords from cpp import tokenize from cpp import utils if not hasattr(builtins, 'reversed'): # Support Python 2.3 and earlier. def reversed(seq): for i in range(len(seq)-1, -1, -1): yield seq[i] if not hasattr(builtins, 'next'): # Support Python 2.5 and earlier. def next(obj): return obj.next() VISIBILITY_PUBLIC, VISIBILITY_PROTECTED, VISIBILITY_PRIVATE = range(3) FUNCTION_NONE = 0x00 FUNCTION_CONST = 0x01 FUNCTION_VIRTUAL = 0x02 FUNCTION_PURE_VIRTUAL = 0x04 FUNCTION_CTOR = 0x08 FUNCTION_DTOR = 0x10 FUNCTION_ATTRIBUTE = 0x20 FUNCTION_UNKNOWN_ANNOTATION = 0x40 FUNCTION_THROW = 0x80 """ These are currently unused. Should really handle these properly at some point. TYPE_MODIFIER_INLINE = 0x010000 TYPE_MODIFIER_EXTERN = 0x020000 TYPE_MODIFIER_STATIC = 0x040000 TYPE_MODIFIER_CONST = 0x080000 TYPE_MODIFIER_REGISTER = 0x100000 TYPE_MODIFIER_VOLATILE = 0x200000 TYPE_MODIFIER_MUTABLE = 0x400000 TYPE_MODIFIER_MAP = { 'inline': TYPE_MODIFIER_INLINE, 'extern': TYPE_MODIFIER_EXTERN, 'static': TYPE_MODIFIER_STATIC, 'const': TYPE_MODIFIER_CONST, 'register': TYPE_MODIFIER_REGISTER, 'volatile': TYPE_MODIFIER_VOLATILE, 'mutable': TYPE_MODIFIER_MUTABLE, } """ _INTERNAL_TOKEN = 'internal' _NAMESPACE_POP = 'ns-pop' # TODO(nnorwitz): use this as a singleton for templated_types, etc # where we don't want to create a new empty dict each time. It is also const. class _NullDict(object): __contains__ = lambda self: False keys = values = items = iterkeys = itervalues = iteritems = lambda self: () # TODO(nnorwitz): move AST nodes into a separate module. class Node(object): """Base AST node.""" def __init__(self, start, end): self.start = start self.end = end def IsDeclaration(self): """Returns bool if this node is a declaration.""" return False def IsDefinition(self): """Returns bool if this node is a definition.""" return False def IsExportable(self): """Returns bool if this node exportable from a header file.""" return False def Requires(self, node): """Does this AST node require the definition of the node passed in?""" return False def XXX__str__(self): return self._StringHelper(self.__class__.__name__, '') def _StringHelper(self, name, suffix): if not utils.DEBUG: return '%s(%s)' % (name, suffix) return '%s(%d, %d, %s)' % (name, self.start, self.end, suffix) def __repr__(self): return str(self) class Define(Node): def __init__(self, start, end, name, definition): Node.__init__(self, start, end) self.name = name self.definition = definition def __str__(self): value = '%s %s' % (self.name, self.definition) return self._StringHelper(self.__class__.__name__, value) class Include(Node): def __init__(self, start, end, filename, system): Node.__init__(self, start, end) self.filename = filename self.system = system def __str__(self): fmt = '"%s"' if self.system: fmt = '<%s>' return self._StringHelper(self.__class__.__name__, fmt % self.filename) class Goto(Node): def __init__(self, start, end, label): Node.__init__(self, start, end) self.label = label def __str__(self): return self._StringHelper(self.__class__.__name__, str(self.label)) class Expr(Node): def __init__(self, start, end, expr): Node.__init__(self, start, end) self.expr = expr def Requires(self, node): # TODO(nnorwitz): impl. return False def __str__(self): return self._StringHelper(self.__class__.__name__, str(self.expr)) class Return(Expr): pass class Delete(Expr): pass class Friend(Expr): def __init__(self, start, end, expr, namespace): Expr.__init__(self, start, end, expr) self.namespace = namespace[:] class Using(Node): def __init__(self, start, end, names): Node.__init__(self, start, end) self.names = names def __str__(self): return self._StringHelper(self.__class__.__name__, str(self.names)) class Parameter(Node): def __init__(self, start, end, name, parameter_type, default): Node.__init__(self, start, end) self.name = name self.type = parameter_type self.default = default def Requires(self, node): # TODO(nnorwitz): handle namespaces, etc. return self.type.name == node.name def __str__(self): name = str(self.type) suffix = '%s %s' % (name, self.name) if self.default: suffix += ' = ' + ''.join([d.name for d in self.default]) return self._StringHelper(self.__class__.__name__, suffix) class _GenericDeclaration(Node): def __init__(self, start, end, name, namespace): Node.__init__(self, start, end) self.name = name self.namespace = namespace[:] def FullName(self): prefix = '' if self.namespace and self.namespace[-1]: prefix = '::'.join(self.namespace) + '::' return prefix + self.name def _TypeStringHelper(self, suffix): if self.namespace: names = [n or '' for n in self.namespace] suffix += ' in ' + '::'.join(names) return self._StringHelper(self.__class__.__name__, suffix) # TODO(nnorwitz): merge with Parameter in some way? class VariableDeclaration(_GenericDeclaration): def __init__(self, start, end, name, var_type, initial_value, namespace): _GenericDeclaration.__init__(self, start, end, name, namespace) self.type = var_type self.initial_value = initial_value def Requires(self, node): # TODO(nnorwitz): handle namespaces, etc. return self.type.name == node.name def ToString(self): """Return a string that tries to reconstitute the variable decl.""" suffix = '%s %s' % (self.type, self.name) if self.initial_value: suffix += ' = ' + self.initial_value return suffix def __str__(self): return self._StringHelper(self.__class__.__name__, self.ToString()) class Typedef(_GenericDeclaration): def __init__(self, start, end, name, alias, namespace): _GenericDeclaration.__init__(self, start, end, name, namespace) self.alias = alias def IsDefinition(self): return True def IsExportable(self): return True def Requires(self, node): # TODO(nnorwitz): handle namespaces, etc. name = node.name for token in self.alias: if token is not None and name == token.name: return True return False def __str__(self): suffix = '%s, %s' % (self.name, self.alias) return self._TypeStringHelper(suffix) class _NestedType(_GenericDeclaration): def __init__(self, start, end, name, fields, namespace): _GenericDeclaration.__init__(self, start, end, name, namespace) self.fields = fields def IsDefinition(self): return True def IsExportable(self): return True def __str__(self): suffix = '%s, {%s}' % (self.name, self.fields) return self._TypeStringHelper(suffix) class Union(_NestedType): pass class Enum(_NestedType): pass class Class(_GenericDeclaration): def __init__(self, start, end, name, bases, templated_types, body, namespace): _GenericDeclaration.__init__(self, start, end, name, namespace) self.bases = bases self.body = body self.templated_types = templated_types def IsDeclaration(self): return self.bases is None and self.body is None def IsDefinition(self): return not self.IsDeclaration() def IsExportable(self): return not self.IsDeclaration() def Requires(self, node): # TODO(nnorwitz): handle namespaces, etc. if self.bases: for token_list in self.bases: # TODO(nnorwitz): bases are tokens, do name comparision. for token in token_list: if token.name == node.name: return True # TODO(nnorwitz): search in body too. return False def __str__(self): name = self.name if self.templated_types: name += '<%s>' % self.templated_types suffix = '%s, %s, %s' % (name, self.bases, self.body) return self._TypeStringHelper(suffix) class Struct(Class): pass class Function(_GenericDeclaration): def __init__(self, start, end, name, return_type, parameters, modifiers, templated_types, body, namespace): _GenericDeclaration.__init__(self, start, end, name, namespace) converter = TypeConverter(namespace) self.return_type = converter.CreateReturnType(return_type) self.parameters = converter.ToParameters(parameters) self.modifiers = modifiers self.body = body self.templated_types = templated_types def IsDeclaration(self): return self.body is None def IsDefinition(self): return self.body is not None def IsExportable(self): if self.return_type and 'static' in self.return_type.modifiers: return False return None not in self.namespace def Requires(self, node): if self.parameters: # TODO(nnorwitz): parameters are tokens, do name comparision. for p in self.parameters: if p.name == node.name: return True # TODO(nnorwitz): search in body too. return False def __str__(self): # TODO(nnorwitz): add templated_types. suffix = ('%s %s(%s), 0x%02x, %s' % (self.return_type, self.name, self.parameters, self.modifiers, self.body)) return self._TypeStringHelper(suffix) class Method(Function): def __init__(self, start, end, name, in_class, return_type, parameters, modifiers, templated_types, body, namespace): Function.__init__(self, start, end, name, return_type, parameters, modifiers, templated_types, body, namespace) # TODO(nnorwitz): in_class could also be a namespace which can # mess up finding functions properly. self.in_class = in_class class Type(_GenericDeclaration): """Type used for any variable (eg class, primitive, struct, etc).""" def __init__(self, start, end, name, templated_types, modifiers, reference, pointer, array): """ Args: name: str name of main type templated_types: [Class (Type?)] template type info between <> modifiers: [str] type modifiers (keywords) eg, const, mutable, etc. reference, pointer, array: bools """ _GenericDeclaration.__init__(self, start, end, name, []) self.templated_types = templated_types if not name and modifiers: self.name = modifiers.pop() self.modifiers = modifiers self.reference = reference self.pointer = pointer self.array = array def __str__(self): prefix = '' if self.modifiers: prefix = ' '.join(self.modifiers) + ' ' name = str(self.name) if self.templated_types: name += '<%s>' % self.templated_types suffix = prefix + name if self.reference: suffix += '&' if self.pointer: suffix += '*' if self.array: suffix += '[]' return self._TypeStringHelper(suffix) # By definition, Is* are always False. A Type can only exist in # some sort of variable declaration, parameter, or return value. def IsDeclaration(self): return False def IsDefinition(self): return False def IsExportable(self): return False class TypeConverter(object): def __init__(self, namespace_stack): self.namespace_stack = namespace_stack def _GetTemplateEnd(self, tokens, start): count = 1 end = start while 1: token = tokens[end] end += 1 if token.name == '<': count += 1 elif token.name == '>': count -= 1 if count == 0: break return tokens[start:end-1], end def ToType(self, tokens): """Convert [Token,...] to [Class(...), ] useful for base classes. For example, code like class Foo : public Bar { ... }; the "Bar" portion gets converted to an AST. Returns: [Class(...), ...] """ result = [] name_tokens = [] reference = pointer = array = False def AddType(templated_types): # Partition tokens into name and modifier tokens. names = [] modifiers = [] for t in name_tokens: if keywords.IsKeyword(t.name): modifiers.append(t.name) else: names.append(t.name) name = ''.join(names) result.append(Type(name_tokens[0].start, name_tokens[-1].end, name, templated_types, modifiers, reference, pointer, array)) del name_tokens[:] i = 0 end = len(tokens) while i < end: token = tokens[i] if token.name == '<': new_tokens, new_end = self._GetTemplateEnd(tokens, i+1) AddType(self.ToType(new_tokens)) # If there is a comma after the template, we need to consume # that here otherwise it becomes part of the name. i = new_end reference = pointer = array = False elif token.name == ',': AddType([]) reference = pointer = array = False elif token.name == '*': pointer = True elif token.name == '&': reference = True elif token.name == '[': pointer = True elif token.name == ']': pass else: name_tokens.append(token) i += 1 if name_tokens: # No '<' in the tokens, just a simple name and no template. AddType([]) return result def DeclarationToParts(self, parts, needs_name_removed): name = None default = [] if needs_name_removed: # Handle default (initial) values properly. for i, t in enumerate(parts): if t.name == '=': default = parts[i+1:] name = parts[i-1].name if name == ']' and parts[i-2].name == '[': name = parts[i-3].name i -= 1 parts = parts[:i-1] break else: if parts[-1].token_type == tokenize.NAME: name = parts.pop().name else: # TODO(nnorwitz): this is a hack that happens for code like # Register(Foo); where it thinks this is a function call # but it's actually a declaration. name = '???' modifiers = [] type_name = [] other_tokens = [] templated_types = [] i = 0 end = len(parts) while i < end: p = parts[i] if keywords.IsKeyword(p.name): modifiers.append(p.name) elif p.name == '<': templated_tokens, new_end = self._GetTemplateEnd(parts, i+1) templated_types = self.ToType(templated_tokens) i = new_end - 1 # Don't add a spurious :: to data members being initialized. next_index = i + 1 if next_index < end and parts[next_index].name == '::': i += 1 elif p.name in ('[', ']', '='): # These are handled elsewhere. other_tokens.append(p) elif p.name not in ('*', '&', '>'): # Ensure that names have a space between them. if (type_name and type_name[-1].token_type == tokenize.NAME and p.token_type == tokenize.NAME): type_name.append(tokenize.Token(tokenize.SYNTAX, ' ', 0, 0)) type_name.append(p) else: other_tokens.append(p) i += 1 type_name = ''.join([t.name for t in type_name]) return name, type_name, templated_types, modifiers, default, other_tokens def ToParameters(self, tokens): if not tokens: return [] result = [] name = type_name = '' type_modifiers = [] pointer = reference = array = False first_token = None default = [] def AddParameter(): if default: del default[0] # Remove flag. end = type_modifiers[-1].end parts = self.DeclarationToParts(type_modifiers, True) (name, type_name, templated_types, modifiers, unused_default, unused_other_tokens) = parts parameter_type = Type(first_token.start, first_token.end, type_name, templated_types, modifiers, reference, pointer, array) p = Parameter(first_token.start, end, name, parameter_type, default) result.append(p) template_count = 0 for s in tokens: if not first_token: first_token = s if s.name == '<': template_count += 1 elif s.name == '>': template_count -= 1 if template_count > 0: type_modifiers.append(s) continue if s.name == ',': AddParameter() name = type_name = '' type_modifiers = [] pointer = reference = array = False first_token = None default = [] elif s.name == '*': pointer = True elif s.name == '&': reference = True elif s.name == '[': array = True elif s.name == ']': pass # Just don't add to type_modifiers. elif s.name == '=': # Got a default value. Add any value (None) as a flag. default.append(None) elif default: default.append(s) else: type_modifiers.append(s) AddParameter() return result def CreateReturnType(self, return_type_seq): if not return_type_seq: return None start = return_type_seq[0].start end = return_type_seq[-1].end _, name, templated_types, modifiers, default, other_tokens = \ self.DeclarationToParts(return_type_seq, False) names = [n.name for n in other_tokens] reference = '&' in names pointer = '*' in names array = '[' in names return Type(start, end, name, templated_types, modifiers, reference, pointer, array) def GetTemplateIndices(self, names): # names is a list of strings. start = names.index('<') end = len(names) - 1 while end > 0: if names[end] == '>': break end -= 1 return start, end+1 class AstBuilder(object): def __init__(self, token_stream, filename, in_class='', visibility=None, namespace_stack=[]): self.tokens = token_stream self.filename = filename # TODO(nnorwitz): use a better data structure (deque) for the queue. # Switching directions of the "queue" improved perf by about 25%. # Using a deque should be even better since we access from both sides. self.token_queue = [] self.namespace_stack = namespace_stack[:] self.in_class = in_class if in_class is None: self.in_class_name_only = None else: self.in_class_name_only = in_class.split('::')[-1] self.visibility = visibility self.in_function = False self.current_token = None # Keep the state whether we are currently handling a typedef or not. self._handling_typedef = False self.converter = TypeConverter(self.namespace_stack) def HandleError(self, msg, token): printable_queue = list(reversed(self.token_queue[-20:])) sys.stderr.write('Got %s in %s @ %s %s\n' % (msg, self.filename, token, printable_queue)) def Generate(self): while 1: token = self._GetNextToken() if not token: break # Get the next token. self.current_token = token # Dispatch on the next token type. if token.token_type == _INTERNAL_TOKEN: if token.name == _NAMESPACE_POP: self.namespace_stack.pop() continue try: result = self._GenerateOne(token) if result is not None: yield result except: self.HandleError('exception', token) raise def _CreateVariable(self, pos_token, name, type_name, type_modifiers, ref_pointer_name_seq, templated_types, value=None): reference = '&' in ref_pointer_name_seq pointer = '*' in ref_pointer_name_seq array = '[' in ref_pointer_name_seq var_type = Type(pos_token.start, pos_token.end, type_name, templated_types, type_modifiers, reference, pointer, array) return VariableDeclaration(pos_token.start, pos_token.end, name, var_type, value, self.namespace_stack) def _GenerateOne(self, token): if token.token_type == tokenize.NAME: if (keywords.IsKeyword(token.name) and not keywords.IsBuiltinType(token.name)): method = getattr(self, 'handle_' + token.name) return method() elif token.name == self.in_class_name_only: # The token name is the same as the class, must be a ctor if # there is a paren. Otherwise, it's the return type. # Peek ahead to get the next token to figure out which. next = self._GetNextToken() self._AddBackToken(next) if next.token_type == tokenize.SYNTAX and next.name == '(': return self._GetMethod([token], FUNCTION_CTOR, None, True) # Fall through--handle like any other method. # Handle data or function declaration/definition. syntax = tokenize.SYNTAX temp_tokens, last_token = \ self._GetVarTokensUpTo(syntax, '(', ';', '{', '[') temp_tokens.insert(0, token) if last_token.name == '(': # If there is an assignment before the paren, # this is an expression, not a method. expr = bool([e for e in temp_tokens if e.name == '=']) if expr: new_temp = self._GetTokensUpTo(tokenize.SYNTAX, ';') temp_tokens.append(last_token) temp_tokens.extend(new_temp) last_token = tokenize.Token(tokenize.SYNTAX, ';', 0, 0) if last_token.name == '[': # Handle array, this isn't a method, unless it's an operator. # TODO(nnorwitz): keep the size somewhere. # unused_size = self._GetTokensUpTo(tokenize.SYNTAX, ']') temp_tokens.append(last_token) if temp_tokens[-2].name == 'operator': temp_tokens.append(self._GetNextToken()) else: temp_tokens2, last_token = \ self._GetVarTokensUpTo(tokenize.SYNTAX, ';') temp_tokens.extend(temp_tokens2) if last_token.name == ';': # Handle data, this isn't a method. parts = self.converter.DeclarationToParts(temp_tokens, True) (name, type_name, templated_types, modifiers, default, unused_other_tokens) = parts t0 = temp_tokens[0] names = [t.name for t in temp_tokens] if templated_types: start, end = self.converter.GetTemplateIndices(names) names = names[:start] + names[end:] default = ''.join([t.name for t in default]) return self._CreateVariable(t0, name, type_name, modifiers, names, templated_types, default) if last_token.name == '{': self._AddBackTokens(temp_tokens[1:]) self._AddBackToken(last_token) method_name = temp_tokens[0].name method = getattr(self, 'handle_' + method_name, None) if not method: # Must be declaring a variable. # TODO(nnorwitz): handle the declaration. return None return method() return self._GetMethod(temp_tokens, 0, None, False) elif token.token_type == tokenize.SYNTAX: if token.name == '~' and self.in_class: # Must be a dtor (probably not in method body). token = self._GetNextToken() # self.in_class can contain A::Name, but the dtor will only # be Name. Make sure to compare against the right value. if (token.token_type == tokenize.NAME and token.name == self.in_class_name_only): return self._GetMethod([token], FUNCTION_DTOR, None, True) # TODO(nnorwitz): handle a lot more syntax. elif token.token_type == tokenize.PREPROCESSOR: # TODO(nnorwitz): handle more preprocessor directives. # token starts with a #, so remove it and strip whitespace. name = token.name[1:].lstrip() if name.startswith('include'): # Remove "include". name = name[7:].strip() assert name # Handle #include \ "header-on-second-line.h". if name.startswith('\\'): name = name[1:].strip() assert name[0] in '<"', token assert name[-1] in '>"', token system = name[0] == '<' filename = name[1:-1] return Include(token.start, token.end, filename, system) if name.startswith('define'): # Remove "define". name = name[6:].strip() assert name value = '' for i, c in enumerate(name): if c.isspace(): value = name[i:].lstrip() name = name[:i] break return Define(token.start, token.end, name, value) if name.startswith('if') and name[2:3].isspace(): condition = name[3:].strip() if condition.startswith('0') or condition.startswith('(0)'): self._SkipIf0Blocks() return None def _GetTokensUpTo(self, expected_token_type, expected_token): return self._GetVarTokensUpTo(expected_token_type, expected_token)[0] def _GetVarTokensUpTo(self, expected_token_type, *expected_tokens): last_token = self._GetNextToken() tokens = [] while (last_token.token_type != expected_token_type or last_token.name not in expected_tokens): tokens.append(last_token) last_token = self._GetNextToken() return tokens, last_token # TODO(nnorwitz): remove _IgnoreUpTo() it shouldn't be necesary. def _IgnoreUpTo(self, token_type, token): unused_tokens = self._GetTokensUpTo(token_type, token) def _SkipIf0Blocks(self): count = 1 while 1: token = self._GetNextToken() if token.token_type != tokenize.PREPROCESSOR: continue name = token.name[1:].lstrip() if name.startswith('endif'): count -= 1 if count == 0: break elif name.startswith('if'): count += 1 def _GetMatchingChar(self, open_paren, close_paren, GetNextToken=None): if GetNextToken is None: GetNextToken = self._GetNextToken # Assumes the current token is open_paren and we will consume # and return up to the close_paren. count = 1 token = GetNextToken() while 1: if token.token_type == tokenize.SYNTAX: if token.name == open_paren: count += 1 elif token.name == close_paren: count -= 1 if count == 0: break yield token token = GetNextToken() yield token def _GetParameters(self): return self._GetMatchingChar('(', ')') def GetScope(self): return self._GetMatchingChar('{', '}') def _GetNextToken(self): if self.token_queue: return self.token_queue.pop() return next(self.tokens) def _AddBackToken(self, token): if token.whence == tokenize.WHENCE_STREAM: token.whence = tokenize.WHENCE_QUEUE self.token_queue.insert(0, token) else: assert token.whence == tokenize.WHENCE_QUEUE, token self.token_queue.append(token) def _AddBackTokens(self, tokens): if tokens: if tokens[-1].whence == tokenize.WHENCE_STREAM: for token in tokens: token.whence = tokenize.WHENCE_QUEUE self.token_queue[:0] = reversed(tokens) else: assert tokens[-1].whence == tokenize.WHENCE_QUEUE, tokens self.token_queue.extend(reversed(tokens)) def GetName(self, seq=None): """Returns ([tokens], next_token_info).""" GetNextToken = self._GetNextToken if seq is not None: it = iter(seq) GetNextToken = lambda: next(it) next_token = GetNextToken() tokens = [] last_token_was_name = False while (next_token.token_type == tokenize.NAME or (next_token.token_type == tokenize.SYNTAX and next_token.name in ('::', '<'))): # Two NAMEs in a row means the identifier should terminate. # It's probably some sort of variable declaration. if last_token_was_name and next_token.token_type == tokenize.NAME: break last_token_was_name = next_token.token_type == tokenize.NAME tokens.append(next_token) # Handle templated names. if next_token.name == '<': tokens.extend(self._GetMatchingChar('<', '>', GetNextToken)) last_token_was_name = True next_token = GetNextToken() return tokens, next_token def GetMethod(self, modifiers, templated_types): return_type_and_name = self._GetTokensUpTo(tokenize.SYNTAX, '(') assert len(return_type_and_name) >= 1 return self._GetMethod(return_type_and_name, modifiers, templated_types, False) def _GetMethod(self, return_type_and_name, modifiers, templated_types, get_paren): template_portion = None if get_paren: token = self._GetNextToken() assert token.token_type == tokenize.SYNTAX, token if token.name == '<': # Handle templatized dtors. template_portion = [token] template_portion.extend(self._GetMatchingChar('<', '>')) token = self._GetNextToken() assert token.token_type == tokenize.SYNTAX, token assert token.name == '(', token name = return_type_and_name.pop() # Handle templatized ctors. if name.name == '>': index = 1 while return_type_and_name[index].name != '<': index += 1 template_portion = return_type_and_name[index:] + [name] del return_type_and_name[index:] name = return_type_and_name.pop() elif name.name == ']': rt = return_type_and_name assert rt[-1].name == '[', return_type_and_name assert rt[-2].name == 'operator', return_type_and_name name_seq = return_type_and_name[-2:] del return_type_and_name[-2:] name = tokenize.Token(tokenize.NAME, 'operator[]', name_seq[0].start, name.end) # Get the open paren so _GetParameters() below works. unused_open_paren = self._GetNextToken() # TODO(nnorwitz): store template_portion. return_type = return_type_and_name indices = name if return_type: indices = return_type[0] # Force ctor for templatized ctors. if name.name == self.in_class and not modifiers: modifiers |= FUNCTION_CTOR parameters = list(self._GetParameters()) del parameters[-1] # Remove trailing ')'. # Handling operator() is especially weird. if name.name == 'operator' and not parameters: token = self._GetNextToken() assert token.name == '(', token parameters = list(self._GetParameters()) del parameters[-1] # Remove trailing ')'. token = self._GetNextToken() while token.token_type == tokenize.NAME: modifier_token = token token = self._GetNextToken() if modifier_token.name == 'const': modifiers |= FUNCTION_CONST elif modifier_token.name == '__attribute__': # TODO(nnorwitz): handle more __attribute__ details. modifiers |= FUNCTION_ATTRIBUTE assert token.name == '(', token # Consume everything between the (parens). unused_tokens = list(self._GetMatchingChar('(', ')')) token = self._GetNextToken() elif modifier_token.name == 'throw': modifiers |= FUNCTION_THROW assert token.name == '(', token # Consume everything between the (parens). unused_tokens = list(self._GetMatchingChar('(', ')')) token = self._GetNextToken() elif modifier_token.name == modifier_token.name.upper(): # HACK(nnorwitz): assume that all upper-case names # are some macro we aren't expanding. modifiers |= FUNCTION_UNKNOWN_ANNOTATION else: self.HandleError('unexpected token', modifier_token) assert token.token_type == tokenize.SYNTAX, token # Handle ctor initializers. if token.name == ':': # TODO(nnorwitz): anything else to handle for initializer list? while token.name != ';' and token.name != '{': token = self._GetNextToken() # Handle pointer to functions that are really data but look # like method declarations. if token.name == '(': if parameters[0].name == '*': # name contains the return type. name = parameters.pop() # parameters contains the name of the data. modifiers = [p.name for p in parameters] # Already at the ( to open the parameter list. function_parameters = list(self._GetMatchingChar('(', ')')) del function_parameters[-1] # Remove trailing ')'. # TODO(nnorwitz): store the function_parameters. token = self._GetNextToken() assert token.token_type == tokenize.SYNTAX, token assert token.name == ';', token return self._CreateVariable(indices, name.name, indices.name, modifiers, '', None) # At this point, we got something like: # return_type (type::*name_)(params); # This is a data member called name_ that is a function pointer. # With this code: void (sq_type::*field_)(string&); # We get: name=void return_type=[] parameters=sq_type ... field_ # TODO(nnorwitz): is return_type always empty? # TODO(nnorwitz): this isn't even close to being correct. # Just put in something so we don't crash and can move on. real_name = parameters[-1] modifiers = [p.name for p in self._GetParameters()] del modifiers[-1] # Remove trailing ')'. return self._CreateVariable(indices, real_name.name, indices.name, modifiers, '', None) if token.name == '{': body = list(self.GetScope()) del body[-1] # Remove trailing '}'. else: body = None if token.name == '=': token = self._GetNextToken() assert token.token_type == tokenize.CONSTANT, token assert token.name == '0', token modifiers |= FUNCTION_PURE_VIRTUAL token = self._GetNextToken() if token.name == '[': # TODO(nnorwitz): store tokens and improve parsing. # template char (&ASH(T (&seq)[N]))[N]; tokens = list(self._GetMatchingChar('[', ']')) token = self._GetNextToken() assert token.name == ';', (token, return_type_and_name, parameters) # Looks like we got a method, not a function. if len(return_type) > 2 and return_type[-1].name == '::': return_type, in_class = \ self._GetReturnTypeAndClassName(return_type) return Method(indices.start, indices.end, name.name, in_class, return_type, parameters, modifiers, templated_types, body, self.namespace_stack) return Function(indices.start, indices.end, name.name, return_type, parameters, modifiers, templated_types, body, self.namespace_stack) def _GetReturnTypeAndClassName(self, token_seq): # Splitting the return type from the class name in a method # can be tricky. For example, Return::Type::Is::Hard::To::Find(). # Where is the return type and where is the class name? # The heuristic used is to pull the last name as the class name. # This includes all the templated type info. # TODO(nnorwitz): if there is only One name like in the # example above, punt and assume the last bit is the class name. # Ignore a :: prefix, if exists so we can find the first real name. i = 0 if token_seq[0].name == '::': i = 1 # Ignore a :: suffix, if exists. end = len(token_seq) - 1 if token_seq[end-1].name == '::': end -= 1 # Make a copy of the sequence so we can append a sentinel # value. This is required for GetName will has to have some # terminating condition beyond the last name. seq_copy = token_seq[i:end] seq_copy.append(tokenize.Token(tokenize.SYNTAX, '', 0, 0)) names = [] while i < end: # Iterate through the sequence parsing out each name. new_name, next = self.GetName(seq_copy[i:]) assert new_name, 'Got empty new_name, next=%s' % next # We got a pointer or ref. Add it to the name. if next and next.token_type == tokenize.SYNTAX: new_name.append(next) names.append(new_name) i += len(new_name) # Now that we have the names, it's time to undo what we did. # Remove the sentinel value. names[-1].pop() # Flatten the token sequence for the return type. return_type = [e for seq in names[:-1] for e in seq] # The class name is the last name. class_name = names[-1] return return_type, class_name def handle_bool(self): pass def handle_char(self): pass def handle_int(self): pass def handle_long(self): pass def handle_short(self): pass def handle_double(self): pass def handle_float(self): pass def handle_void(self): pass def handle_wchar_t(self): pass def handle_unsigned(self): pass def handle_signed(self): pass def _GetNestedType(self, ctor): name = None name_tokens, token = self.GetName() if name_tokens: name = ''.join([t.name for t in name_tokens]) # Handle forward declarations. if token.token_type == tokenize.SYNTAX and token.name == ';': return ctor(token.start, token.end, name, None, self.namespace_stack) if token.token_type == tokenize.NAME and self._handling_typedef: self._AddBackToken(token) return ctor(token.start, token.end, name, None, self.namespace_stack) # Must be the type declaration. fields = list(self._GetMatchingChar('{', '}')) del fields[-1] # Remove trailing '}'. if token.token_type == tokenize.SYNTAX and token.name == '{': next = self._GetNextToken() new_type = ctor(token.start, token.end, name, fields, self.namespace_stack) # A name means this is an anonymous type and the name # is the variable declaration. if next.token_type != tokenize.NAME: return new_type name = new_type token = next # Must be variable declaration using the type prefixed with keyword. assert token.token_type == tokenize.NAME, token return self._CreateVariable(token, token.name, name, [], '', None) def handle_struct(self): # Special case the handling typedef/aliasing of structs here. # It would be a pain to handle in the class code. name_tokens, var_token = self.GetName() if name_tokens: next_token = self._GetNextToken() is_syntax = (var_token.token_type == tokenize.SYNTAX and var_token.name[0] in '*&') is_variable = (var_token.token_type == tokenize.NAME and next_token.name == ';') variable = var_token if is_syntax and not is_variable: variable = next_token temp = self._GetNextToken() if temp.token_type == tokenize.SYNTAX and temp.name == '(': # Handle methods declared to return a struct. t0 = name_tokens[0] struct = tokenize.Token(tokenize.NAME, 'struct', t0.start-7, t0.start-2) type_and_name = [struct] type_and_name.extend(name_tokens) type_and_name.extend((var_token, next_token)) return self._GetMethod(type_and_name, 0, None, False) assert temp.name == ';', (temp, name_tokens, var_token) if is_syntax or (is_variable and not self._handling_typedef): modifiers = ['struct'] type_name = ''.join([t.name for t in name_tokens]) position = name_tokens[0] return self._CreateVariable(position, variable.name, type_name, modifiers, var_token.name, None) name_tokens.extend((var_token, next_token)) self._AddBackTokens(name_tokens) else: self._AddBackToken(var_token) return self._GetClass(Struct, VISIBILITY_PUBLIC, None) def handle_union(self): return self._GetNestedType(Union) def handle_enum(self): return self._GetNestedType(Enum) def handle_auto(self): # TODO(nnorwitz): warn about using auto? Probably not since it # will be reclaimed and useful for C++0x. pass def handle_register(self): pass def handle_const(self): pass def handle_inline(self): pass def handle_extern(self): pass def handle_static(self): pass def handle_virtual(self): # What follows must be a method. token = token2 = self._GetNextToken() if token.name == 'inline': # HACK(nnorwitz): handle inline dtors by ignoring 'inline'. token2 = self._GetNextToken() if token2.token_type == tokenize.SYNTAX and token2.name == '~': return self.GetMethod(FUNCTION_VIRTUAL + FUNCTION_DTOR, None) assert token.token_type == tokenize.NAME or token.name == '::', token return_type_and_name = self._GetTokensUpTo(tokenize.SYNTAX, '(') return_type_and_name.insert(0, token) if token2 is not token: return_type_and_name.insert(1, token2) return self._GetMethod(return_type_and_name, FUNCTION_VIRTUAL, None, False) def handle_volatile(self): pass def handle_mutable(self): pass def handle_public(self): assert self.in_class self.visibility = VISIBILITY_PUBLIC def handle_protected(self): assert self.in_class self.visibility = VISIBILITY_PROTECTED def handle_private(self): assert self.in_class self.visibility = VISIBILITY_PRIVATE def handle_friend(self): tokens = self._GetTokensUpTo(tokenize.SYNTAX, ';') assert tokens t0 = tokens[0] return Friend(t0.start, t0.end, tokens, self.namespace_stack) def handle_static_cast(self): pass def handle_const_cast(self): pass def handle_dynamic_cast(self): pass def handle_reinterpret_cast(self): pass def handle_new(self): pass def handle_delete(self): tokens = self._GetTokensUpTo(tokenize.SYNTAX, ';') assert tokens return Delete(tokens[0].start, tokens[0].end, tokens) def handle_typedef(self): token = self._GetNextToken() if (token.token_type == tokenize.NAME and keywords.IsKeyword(token.name)): # Token must be struct/enum/union/class. method = getattr(self, 'handle_' + token.name) self._handling_typedef = True tokens = [method()] self._handling_typedef = False else: tokens = [token] # Get the remainder of the typedef up to the semi-colon. tokens.extend(self._GetTokensUpTo(tokenize.SYNTAX, ';')) # TODO(nnorwitz): clean all this up. assert tokens name = tokens.pop() indices = name if tokens: indices = tokens[0] if not indices: indices = token if name.name == ')': # HACK(nnorwitz): Handle pointers to functions "properly". if (len(tokens) >= 4 and tokens[1].name == '(' and tokens[2].name == '*'): tokens.append(name) name = tokens[3] elif name.name == ']': # HACK(nnorwitz): Handle arrays properly. if len(tokens) >= 2: tokens.append(name) name = tokens[1] new_type = tokens if tokens and isinstance(tokens[0], tokenize.Token): new_type = self.converter.ToType(tokens)[0] return Typedef(indices.start, indices.end, name.name, new_type, self.namespace_stack) def handle_typeid(self): pass # Not needed yet. def handle_typename(self): pass # Not needed yet. def _GetTemplatedTypes(self): result = {} tokens = list(self._GetMatchingChar('<', '>')) len_tokens = len(tokens) - 1 # Ignore trailing '>'. i = 0 while i < len_tokens: key = tokens[i].name i += 1 if keywords.IsKeyword(key) or key == ',': continue type_name = default = None if i < len_tokens: i += 1 if tokens[i-1].name == '=': assert i < len_tokens, '%s %s' % (i, tokens) default, unused_next_token = self.GetName(tokens[i:]) i += len(default) else: if tokens[i-1].name != ',': # We got something like: Type variable. # Re-adjust the key (variable) and type_name (Type). key = tokens[i-1].name type_name = tokens[i-2] result[key] = (type_name, default) return result def handle_template(self): token = self._GetNextToken() assert token.token_type == tokenize.SYNTAX, token assert token.name == '<', token templated_types = self._GetTemplatedTypes() # TODO(nnorwitz): for now, just ignore the template params. token = self._GetNextToken() if token.token_type == tokenize.NAME: if token.name == 'class': return self._GetClass(Class, VISIBILITY_PRIVATE, templated_types) elif token.name == 'struct': return self._GetClass(Struct, VISIBILITY_PUBLIC, templated_types) elif token.name == 'friend': return self.handle_friend() self._AddBackToken(token) tokens, last = self._GetVarTokensUpTo(tokenize.SYNTAX, '(', ';') tokens.append(last) self._AddBackTokens(tokens) if last.name == '(': return self.GetMethod(FUNCTION_NONE, templated_types) # Must be a variable definition. return None def handle_true(self): pass # Nothing to do. def handle_false(self): pass # Nothing to do. def handle_asm(self): pass # Not needed yet. def handle_class(self): return self._GetClass(Class, VISIBILITY_PRIVATE, None) def _GetBases(self): # Get base classes. bases = [] while 1: token = self._GetNextToken() assert token.token_type == tokenize.NAME, token # TODO(nnorwitz): store kind of inheritance...maybe. if token.name not in ('public', 'protected', 'private'): # If inheritance type is not specified, it is private. # Just put the token back so we can form a name. # TODO(nnorwitz): it would be good to warn about this. self._AddBackToken(token) else: # Check for virtual inheritance. token = self._GetNextToken() if token.name != 'virtual': self._AddBackToken(token) else: # TODO(nnorwitz): store that we got virtual for this base. pass base, next_token = self.GetName() bases_ast = self.converter.ToType(base) assert len(bases_ast) == 1, bases_ast bases.append(bases_ast[0]) assert next_token.token_type == tokenize.SYNTAX, next_token if next_token.name == '{': token = next_token break # Support multiple inheritance. assert next_token.name == ',', next_token return bases, token def _GetClass(self, class_type, visibility, templated_types): class_name = None class_token = self._GetNextToken() if class_token.token_type != tokenize.NAME: assert class_token.token_type == tokenize.SYNTAX, class_token token = class_token else: # Skip any macro (e.g. storage class specifiers) after the # 'class' keyword. next_token = self._GetNextToken() if next_token.token_type == tokenize.NAME: self._AddBackToken(next_token) else: self._AddBackTokens([class_token, next_token]) name_tokens, token = self.GetName() class_name = ''.join([t.name for t in name_tokens]) bases = None if token.token_type == tokenize.SYNTAX: if token.name == ';': # Forward declaration. return class_type(class_token.start, class_token.end, class_name, None, templated_types, None, self.namespace_stack) if token.name in '*&': # Inline forward declaration. Could be method or data. name_token = self._GetNextToken() next_token = self._GetNextToken() if next_token.name == ';': # Handle data modifiers = ['class'] return self._CreateVariable(class_token, name_token.name, class_name, modifiers, token.name, None) else: # Assume this is a method. tokens = (class_token, token, name_token, next_token) self._AddBackTokens(tokens) return self.GetMethod(FUNCTION_NONE, None) if token.name == ':': bases, token = self._GetBases() body = None if token.token_type == tokenize.SYNTAX and token.name == '{': assert token.token_type == tokenize.SYNTAX, token assert token.name == '{', token ast = AstBuilder(self.GetScope(), self.filename, class_name, visibility, self.namespace_stack) body = list(ast.Generate()) if not self._handling_typedef: token = self._GetNextToken() if token.token_type != tokenize.NAME: assert token.token_type == tokenize.SYNTAX, token assert token.name == ';', token else: new_class = class_type(class_token.start, class_token.end, class_name, bases, None, body, self.namespace_stack) modifiers = [] return self._CreateVariable(class_token, token.name, new_class, modifiers, token.name, None) else: if not self._handling_typedef: self.HandleError('non-typedef token', token) self._AddBackToken(token) return class_type(class_token.start, class_token.end, class_name, bases, None, body, self.namespace_stack) def handle_namespace(self): token = self._GetNextToken() # Support anonymous namespaces. name = None if token.token_type == tokenize.NAME: name = token.name token = self._GetNextToken() self.namespace_stack.append(name) assert token.token_type == tokenize.SYNTAX, token # Create an internal token that denotes when the namespace is complete. internal_token = tokenize.Token(_INTERNAL_TOKEN, _NAMESPACE_POP, None, None) internal_token.whence = token.whence if token.name == '=': # TODO(nnorwitz): handle aliasing namespaces. name, next_token = self.GetName() assert next_token.name == ';', next_token self._AddBackToken(internal_token) else: assert token.name == '{', token tokens = list(self.GetScope()) # Replace the trailing } with the internal namespace pop token. tokens[-1] = internal_token # Handle namespace with nothing in it. self._AddBackTokens(tokens) return None def handle_using(self): tokens = self._GetTokensUpTo(tokenize.SYNTAX, ';') assert tokens return Using(tokens[0].start, tokens[0].end, tokens) def handle_explicit(self): assert self.in_class # Nothing much to do. # TODO(nnorwitz): maybe verify the method name == class name. # This must be a ctor. return self.GetMethod(FUNCTION_CTOR, None) def handle_this(self): pass # Nothing to do. def handle_operator(self): # Pull off the next token(s?) and make that part of the method name. pass def handle_sizeof(self): pass def handle_case(self): pass def handle_switch(self): pass def handle_default(self): token = self._GetNextToken() assert token.token_type == tokenize.SYNTAX assert token.name == ':' def handle_if(self): pass def handle_else(self): pass def handle_return(self): tokens = self._GetTokensUpTo(tokenize.SYNTAX, ';') if not tokens: return Return(self.current_token.start, self.current_token.end, None) return Return(tokens[0].start, tokens[0].end, tokens) def handle_goto(self): tokens = self._GetTokensUpTo(tokenize.SYNTAX, ';') assert len(tokens) == 1, str(tokens) return Goto(tokens[0].start, tokens[0].end, tokens[0].name) def handle_try(self): pass # Not needed yet. def handle_catch(self): pass # Not needed yet. def handle_throw(self): pass # Not needed yet. def handle_while(self): pass def handle_do(self): pass def handle_for(self): pass def handle_break(self): self._IgnoreUpTo(tokenize.SYNTAX, ';') def handle_continue(self): self._IgnoreUpTo(tokenize.SYNTAX, ';') def BuilderFromSource(source, filename): """Utility method that returns an AstBuilder from source code. Args: source: 'C++ source code' filename: 'file1' Returns: AstBuilder """ return AstBuilder(tokenize.GetTokens(source), filename) def PrintIndentifiers(filename, should_print): """Prints all identifiers for a C++ source file. Args: filename: 'file1' should_print: predicate with signature: bool Function(token) """ source = utils.ReadFile(filename, False) if source is None: sys.stderr.write('Unable to find: %s\n' % filename) return #print('Processing %s' % actual_filename) builder = BuilderFromSource(source, filename) try: for node in builder.Generate(): if should_print(node): print(node.name) except KeyboardInterrupt: return except: pass def PrintAllIndentifiers(filenames, should_print): """Prints all identifiers for each C++ source file in filenames. Args: filenames: ['file1', 'file2', ...] should_print: predicate with signature: bool Function(token) """ for path in filenames: PrintIndentifiers(path, should_print) def main(argv): for filename in argv[1:]: source = utils.ReadFile(filename) if source is None: continue print('Processing %s' % filename) builder = BuilderFromSource(source, filename) try: entire_ast = filter(None, builder.Generate()) except KeyboardInterrupt: return except: # Already printed a warning, print the traceback and continue. traceback.print_exc() else: if utils.DEBUG: for ast in entire_ast: print(ast) if __name__ == '__main__': main(sys.argv) synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/gmock_class.py0000600000175000017500000001464511561126632026522 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008 Google Inc. All Rights Reserved. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Generate Google Mock classes from base classes. This program will read in a C++ source file and output the Google Mock classes for the specified classes. If no class is specified, all classes in the source file are emitted. Usage: gmock_class.py header-file.h [ClassName]... Output is sent to stdout. """ __author__ = 'nnorwitz@google.com (Neal Norwitz)' import os import re import sys from cpp import ast from cpp import utils # Preserve compatibility with Python 2.3. try: _dummy = set except NameError: import sets set = sets.Set _VERSION = (1, 0, 1) # The version of this script. # How many spaces to indent. Can set me with the INDENT environment variable. _INDENT = 2 def _GenerateMethods(output_lines, source, class_node): function_type = ast.FUNCTION_VIRTUAL | ast.FUNCTION_PURE_VIRTUAL ctor_or_dtor = ast.FUNCTION_CTOR | ast.FUNCTION_DTOR indent = ' ' * _INDENT for node in class_node.body: # We only care about virtual functions. if (isinstance(node, ast.Function) and node.modifiers & function_type and not node.modifiers & ctor_or_dtor): # Pick out all the elements we need from the original function. const = '' if node.modifiers & ast.FUNCTION_CONST: const = 'CONST_' return_type = 'void' if node.return_type: # Add modifiers like 'const'. modifiers = '' if node.return_type.modifiers: modifiers = ' '.join(node.return_type.modifiers) + ' ' return_type = modifiers + node.return_type.name template_args = [arg.name for arg in node.return_type.templated_types] if template_args: return_type += '<' + ', '.join(template_args) + '>' if len(template_args) > 1: for line in [ '// The following line won\'t really compile, as the return', '// type has multiple template arguments. To fix it, use a', '// typedef for the return type.']: output_lines.append(indent + line) if node.return_type.pointer: return_type += '*' if node.return_type.reference: return_type += '&' mock_method_macro = 'MOCK_%sMETHOD%d' % (const, len(node.parameters)) args = '' if node.parameters: # Get the full text of the parameters from the start # of the first parameter to the end of the last parameter. start = node.parameters[0].start end = node.parameters[-1].end # Remove // comments. args_strings = re.sub(r'//.*', '', source[start:end]) # Condense multiple spaces and eliminate newlines putting the # parameters together on a single line. Ensure there is a # space in an argument which is split by a newline without # intervening whitespace, e.g.: int\nBar args = re.sub(' +', ' ', args_strings.replace('\n', ' ')) # Create the mock method definition. output_lines.extend(['%s%s(%s,' % (indent, mock_method_macro, node.name), '%s%s(%s));' % (indent*3, return_type, args)]) def _GenerateMocks(filename, source, ast_list, desired_class_names): processed_class_names = set() lines = [] for node in ast_list: if (isinstance(node, ast.Class) and node.body and # desired_class_names being None means that all classes are selected. (not desired_class_names or node.name in desired_class_names)): class_name = node.name processed_class_names.add(class_name) class_node = node # Add namespace before the class. if class_node.namespace: lines.extend(['namespace %s {' % n for n in class_node.namespace]) # } lines.append('') # Add the class prolog. lines.append('class Mock%s : public %s {' % (class_name, class_name)) # } lines.append('%spublic:' % (' ' * (_INDENT // 2))) # Add all the methods. _GenerateMethods(lines, source, class_node) # Close the class. if lines: # If there are no virtual methods, no need for a public label. if len(lines) == 2: del lines[-1] # Only close the class if there really is a class. lines.append('};') lines.append('') # Add an extra newline. # Close the namespace. if class_node.namespace: for i in range(len(class_node.namespace)-1, -1, -1): lines.append('} // namespace %s' % class_node.namespace[i]) lines.append('') # Add an extra newline. if desired_class_names: missing_class_name_list = list(desired_class_names - processed_class_names) if missing_class_name_list: missing_class_name_list.sort() sys.stderr.write('Class(es) not found in %s: %s\n' % (filename, ', '.join(missing_class_name_list))) elif not processed_class_names: sys.stderr.write('No class found in %s\n' % filename) return lines def main(argv=sys.argv): if len(argv) < 2: sys.stderr.write('Google Mock Class Generator v%s\n\n' % '.'.join(map(str, _VERSION))) sys.stderr.write(__doc__) return 1 global _INDENT try: _INDENT = int(os.environ['INDENT']) except KeyError: pass except: sys.stderr.write('Unable to use indent of %s\n' % os.environ.get('INDENT')) filename = argv[1] desired_class_names = None # None means all classes in the source file. if len(argv) >= 3: desired_class_names = set(argv[2:]) source = utils.ReadFile(filename) if source is None: return 1 builder = ast.BuilderFromSource(source, filename) try: entire_ast = filter(None, builder.Generate()) except KeyboardInterrupt: return except: # An error message was already printed since we couldn't parse. pass else: lines = _GenerateMocks(filename, source, entire_ast, desired_class_names) sys.stdout.write('\n'.join(lines)) if __name__ == '__main__': main(sys.argv) synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/keywords.py0000600000175000017500000000372411561126632026100 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2007 Neal Norwitz # Portions Copyright 2007 Google Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """C++ keywords and helper utilities for determining keywords.""" __author__ = 'nnorwitz@google.com (Neal Norwitz)' try: # Python 3.x import builtins except ImportError: # Python 2.x import __builtin__ as builtins if not hasattr(builtins, 'set'): # Nominal support for Python 2.3. from sets import Set as set TYPES = set('bool char int long short double float void wchar_t unsigned signed'.split()) TYPE_MODIFIERS = set('auto register const inline extern static virtual volatile mutable'.split()) ACCESS = set('public protected private friend'.split()) CASTS = set('static_cast const_cast dynamic_cast reinterpret_cast'.split()) OTHERS = set('true false asm class namespace using explicit this operator sizeof'.split()) OTHER_TYPES = set('new delete typedef struct union enum typeid typename template'.split()) CONTROL = set('case switch default if else return goto'.split()) EXCEPTION = set('try catch throw'.split()) LOOP = set('while do for break continue'.split()) ALL = TYPES | TYPE_MODIFIERS | ACCESS | CASTS | OTHERS | OTHER_TYPES | CONTROL | EXCEPTION | LOOP def IsKeyword(token): return token in ALL def IsBuiltinType(token): if token in ('virtual', 'inline'): # These only apply to methods, they can't be types by themselves. return False return token in TYPES or token in TYPE_MODIFIERS synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/tokenize.py0000600000175000017500000002274711561126632026067 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2007 Neal Norwitz # Portions Copyright 2007 Google Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Tokenize C++ source code.""" __author__ = 'nnorwitz@google.com (Neal Norwitz)' try: # Python 3.x import builtins except ImportError: # Python 2.x import __builtin__ as builtins import sys from cpp import utils if not hasattr(builtins, 'set'): # Nominal support for Python 2.3. from sets import Set as set # Add $ as a valid identifier char since so much code uses it. _letters = 'abcdefghijklmnopqrstuvwxyz' VALID_IDENTIFIER_CHARS = set(_letters + _letters.upper() + '_0123456789$') HEX_DIGITS = set('0123456789abcdefABCDEF') INT_OR_FLOAT_DIGITS = set('01234567890eE-+') # C++0x string preffixes. _STR_PREFIXES = set(('R', 'u8', 'u8R', 'u', 'uR', 'U', 'UR', 'L', 'LR')) # Token types. UNKNOWN = 'UNKNOWN' SYNTAX = 'SYNTAX' CONSTANT = 'CONSTANT' NAME = 'NAME' PREPROCESSOR = 'PREPROCESSOR' # Where the token originated from. This can be used for backtracking. # It is always set to WHENCE_STREAM in this code. WHENCE_STREAM, WHENCE_QUEUE = range(2) class Token(object): """Data container to represent a C++ token. Tokens can be identifiers, syntax char(s), constants, or pre-processor directives. start contains the index of the first char of the token in the source end contains the index of the last char of the token in the source """ def __init__(self, token_type, name, start, end): self.token_type = token_type self.name = name self.start = start self.end = end self.whence = WHENCE_STREAM def __str__(self): if not utils.DEBUG: return 'Token(%r)' % self.name return 'Token(%r, %s, %s)' % (self.name, self.start, self.end) __repr__ = __str__ def _GetString(source, start, i): i = source.find('"', i+1) while source[i-1] == '\\': # Count the trailing backslashes. backslash_count = 1 j = i - 2 while source[j] == '\\': backslash_count += 1 j -= 1 # When trailing backslashes are even, they escape each other. if (backslash_count % 2) == 0: break i = source.find('"', i+1) return i + 1 def _GetChar(source, start, i): # NOTE(nnorwitz): may not be quite correct, should be good enough. i = source.find("'", i+1) while source[i-1] == '\\': # Need to special case '\\'. if (i - 2) > start and source[i-2] == '\\': break i = source.find("'", i+1) # Try to handle unterminated single quotes (in a #if 0 block). if i < 0: i = start return i + 1 def GetTokens(source): """Returns a sequence of Tokens. Args: source: string of C++ source code. Yields: Token that represents the next token in the source. """ # Cache various valid character sets for speed. valid_identifier_chars = VALID_IDENTIFIER_CHARS hex_digits = HEX_DIGITS int_or_float_digits = INT_OR_FLOAT_DIGITS int_or_float_digits2 = int_or_float_digits | set('.') # Only ignore errors while in a #if 0 block. ignore_errors = False count_ifs = 0 i = 0 end = len(source) while i < end: # Skip whitespace. while i < end and source[i].isspace(): i += 1 if i >= end: return token_type = UNKNOWN start = i c = source[i] if c.isalpha() or c == '_': # Find a string token. token_type = NAME while source[i] in valid_identifier_chars: i += 1 # String and character constants can look like a name if # they are something like L"". if (source[i] == "'" and (i - start) == 1 and source[start:i] in 'uUL'): # u, U, and L are valid C++0x character preffixes. token_type = CONSTANT i = _GetChar(source, start, i) elif source[i] == "'" and source[start:i] in _STR_PREFIXES: token_type = CONSTANT i = _GetString(source, start, i) elif c == '/' and source[i+1] == '/': # Find // comments. i = source.find('\n', i) if i == -1: # Handle EOF. i = end continue elif c == '/' and source[i+1] == '*': # Find /* comments. */ i = source.find('*/', i) + 2 continue elif c in ':+-<>&|*=': # : or :: (plus other chars). token_type = SYNTAX i += 1 new_ch = source[i] if new_ch == c: i += 1 elif c == '-' and new_ch == '>': i += 1 elif new_ch == '=': i += 1 elif c in '()[]{}~!?^%;/.,': # Handle single char tokens. token_type = SYNTAX i += 1 if c == '.' and source[i].isdigit(): token_type = CONSTANT i += 1 while source[i] in int_or_float_digits: i += 1 # Handle float suffixes. for suffix in ('l', 'f'): if suffix == source[i:i+1].lower(): i += 1 break elif c.isdigit(): # Find integer. token_type = CONSTANT if c == '0' and source[i+1] in 'xX': # Handle hex digits. i += 2 while source[i] in hex_digits: i += 1 else: while source[i] in int_or_float_digits2: i += 1 # Handle integer (and float) suffixes. for suffix in ('ull', 'll', 'ul', 'l', 'f', 'u'): size = len(suffix) if suffix == source[i:i+size].lower(): i += size break elif c == '"': # Find string. token_type = CONSTANT i = _GetString(source, start, i) elif c == "'": # Find char. token_type = CONSTANT i = _GetChar(source, start, i) elif c == '#': # Find pre-processor command. token_type = PREPROCESSOR got_if = source[i:i+3] == '#if' and source[i+3:i+4].isspace() if got_if: count_ifs += 1 elif source[i:i+6] == '#endif': count_ifs -= 1 if count_ifs == 0: ignore_errors = False # TODO(nnorwitz): handle preprocessor statements (\ continuations). while 1: i1 = source.find('\n', i) i2 = source.find('//', i) i3 = source.find('/*', i) i4 = source.find('"', i) # NOTE(nnorwitz): doesn't handle comments in #define macros. # Get the first important symbol (newline, comment, EOF/end). i = min([x for x in (i1, i2, i3, i4, end) if x != -1]) # Handle #include "dir//foo.h" properly. if source[i] == '"': i = source.find('"', i+1) + 1 assert i > 0 continue # Keep going if end of the line and the line ends with \. if not (i == i1 and source[i-1] == '\\'): if got_if: condition = source[start+4:i].lstrip() if (condition.startswith('0') or condition.startswith('(0)')): ignore_errors = True break i += 1 elif c == '\\': # Handle \ in code. # This is different from the pre-processor \ handling. i += 1 continue elif ignore_errors: # The tokenizer seems to be in pretty good shape. This # raise is conditionally disabled so that bogus code # in an #if 0 block can be handled. Since we will ignore # it anyways, this is probably fine. So disable the # exception and return the bogus char. i += 1 else: sys.stderr.write('Got invalid token in %s @ %d token:%s: %r\n' % ('?', i, c, source[i-10:i+10])) raise RuntimeError('unexpected token') if i <= 0: print('Invalid index, exiting now.') return yield Token(token_type, source[start:i], start, i) if __name__ == '__main__': def main(argv): """Driver mostly for testing purposes.""" for filename in argv[1:]: source = utils.ReadFile(filename) if source is None: continue for token in GetTokens(source): print('%-12s: %s' % (token.token_type, token.name)) # print('\r%6.2f%%' % (100.0 * index / token.end),) sys.stdout.write('\n') main(sys.argv) synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/utils.py0000600000175000017500000000220111561126632025356 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2007 Neal Norwitz # Portions Copyright 2007 Google Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Generic utilities for C++ parsing.""" __author__ = 'nnorwitz@google.com (Neal Norwitz)' import sys # Set to True to see the start/end token indices. DEBUG = True def ReadFile(filename, print_error=True): """Returns the contents of a file.""" try: fp = open(filename) try: return fp.read() finally: fp.close() except IOError: if print_error: print('Error reading %s: %s' % (filename, sys.exc_info()[1])) return None synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/cpp/__init__.py0000600000175000017500000000000011561126632025750 0ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/gmock_gen.py0000600000175000017500000000210311561126632025366 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008 Google Inc. All Rights Reserved. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Driver for starting up Google Mock class generator.""" __author__ = 'nnorwitz@google.com (Neal Norwitz)' import os import sys if __name__ == '__main__': # Add the directory of this script to the path so we can import gmock_class. sys.path.append(os.path.dirname(__file__)) from cpp import gmock_class # Fix the docstring in case they require the usage. gmock_class.__doc__ = gmock_class.__doc__.replace('gmock_class.py', __file__) gmock_class.main() synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/README0000600000175000017500000000250511561126632023751 0ustar synergysynergy The Google Mock class generator is an application that is part of cppclean. For more information about cppclean, see the README.cppclean file or visit http://code.google.com/p/cppclean/ cppclean requires Python 2.3.5 or later. If you don't have Python installed on your system, you will also need to install it. You can download Python from: http://www.python.org/download/releases/ To use the Google Mock class generator, you need to call it on the command line passing the header file and class for which you want to generate a Google Mock class. Make sure to install the scripts somewhere in your path. Then you can run the program. gmock_gen.py header-file.h [ClassName]... If no ClassNames are specified, all classes in the file are emitted. To change the indentation from the default of 2, set INDENT in the environment. For example to use an indent of 4 spaces: INDENT=4 gmock_gen.py header-file.h ClassName This version was made from SVN revision 281 in the cppclean repository. Known Limitations ----------------- Not all code will be generated properly. For example, when mocking templated classes, the template information is lost. You will need to add the template information manually. Not all permutations of using multiple pointers/references will be rendered properly. These will also have to be fixed manually. synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/generator/README.cppclean0000600000175000017500000001017011561126632025532 0ustar synergysynergyGoal: ----- CppClean attempts to find problems in C++ source that slow development in large code bases, for example various forms of unused code. Unused code can be unused functions, methods, data members, types, etc to unnecessary #include directives. Unnecessary #includes can cause considerable extra compiles increasing the edit-compile-run cycle. The project home page is: http://code.google.com/p/cppclean/ Features: --------- * Find and print C++ language constructs: classes, methods, functions, etc. * Find classes with virtual methods, no virtual destructor, and no bases * Find global/static data that are potential problems when using threads * Unnecessary forward class declarations * Unnecessary function declarations * Undeclared function definitions * (planned) Find unnecessary header files #included - No direct reference to anything in the header - Header is unnecessary if classes were forward declared instead * (planned) Source files that reference headers not directly #included, ie, files that rely on a transitive #include from another header * (planned) Unused members (private, protected, & public) methods and data * (planned) Store AST in a SQL database so relationships can be queried AST is Abstract Syntax Tree, a representation of parsed source code. http://en.wikipedia.org/wiki/Abstract_syntax_tree System Requirements: -------------------- * Python 2.4 or later (2.3 probably works too) * Works on Windows (untested), Mac OS X, and Unix How to Run: ----------- For all examples, it is assumed that cppclean resides in a directory called /cppclean. To print warnings for classes with virtual methods, no virtual destructor and no base classes: /cppclean/run.sh nonvirtual_dtors.py file1.h file2.h file3.cc ... To print all the functions defined in header file(s): /cppclean/run.sh functions.py file1.h file2.h ... All the commands take multiple files on the command line. Other programs include: find_warnings, headers, methods, and types. Some other programs are available, but used primarily for debugging. run.sh is a simple wrapper that sets PYTHONPATH to /cppclean and then runs the program in /cppclean/cpp/PROGRAM.py. There is currently no equivalent for Windows. Contributions for a run.bat file would be greatly appreciated. How to Configure: ----------------- You can add a siteheaders.py file in /cppclean/cpp to configure where to look for other headers (typically -I options passed to a compiler). Currently two values are supported: _TRANSITIVE and GetIncludeDirs. _TRANSITIVE should be set to a boolean value (True or False) indicating whether to transitively process all header files. The default is False. GetIncludeDirs is a function that takes a single argument and returns a sequence of directories to include. This can be a generator or return a static list. def GetIncludeDirs(filename): return ['/some/path/with/other/headers'] # Here is a more complicated example. def GetIncludeDirs(filename): yield '/path1' yield os.path.join('/path2', os.path.dirname(filename)) yield '/path3' How to Test: ------------ For all examples, it is assumed that cppclean resides in a directory called /cppclean. The tests require cd /cppclean make test # To generate expected results after a change: make expected Current Status: --------------- The parser works pretty well for header files, parsing about 99% of Google's header files. Anything which inspects structure of C++ source files should work reasonably well. Function bodies are not transformed to an AST, but left as tokens. Much work is still needed on finding unused header files and storing an AST in a database. Non-goals: ---------- * Parsing all valid C++ source * Handling invalid C++ source gracefully * Compiling to machine code (or anything beyond an AST) Contact: -------- If you used cppclean, I would love to hear about your experiences cppclean@googlegroups.com. Even if you don't use cppclean, I'd like to hear from you. :-) (You can contact me directly at: nnorwitz@gmail.com) synergy-1.4.12-Source/tools/gmock-1.6.0/scripts/gmock-config.in0000600000175000017500000002563711561126632024011 0ustar synergysynergy#!/bin/sh # These variables are automatically filled in by the configure script. name="@PACKAGE_TARNAME@" version="@PACKAGE_VERSION@" show_usage() { echo "Usage: gmock-config [OPTIONS...]" } show_help() { show_usage cat <<\EOF The `gmock-config' script provides access to the necessary compile and linking flags to connect with Google C++ Mocking Framework, both in a build prior to installation, and on the system proper after installation. The installation overrides may be issued in combination with any other queries, but will only affect installation queries if called on a built but not installed gmock. The installation queries may not be issued with any other types of queries, and only one installation query may be made at a time. The version queries and compiler flag queries may be combined as desired but not mixed. Different version queries are always combined with logical "and" semantics, and only the last of any particular query is used while all previous ones ignored. All versions must be specified as a sequence of numbers separated by periods. Compiler flag queries output the union of the sets of flags when combined. Examples: gmock-config --min-version=1.0 || echo "Insufficient Google Mock version." g++ $(gmock-config --cppflags --cxxflags) -o foo.o -c foo.cpp g++ $(gmock-config --ldflags --libs) -o foo foo.o # When using a built but not installed Google Mock: g++ $(../../my_gmock_build/scripts/gmock-config ...) ... # When using an installed Google Mock, but with installation overrides: export GMOCK_PREFIX="/opt" g++ $(gmock-config --libdir="/opt/lib64" ...) ... Help: --usage brief usage information --help display this help message Installation Overrides: --prefix= overrides the installation prefix --exec-prefix= overrides the executable installation prefix --libdir= overrides the library installation prefix --includedir= overrides the header file installation prefix Installation Queries: --prefix installation prefix --exec-prefix executable installation prefix --libdir library installation directory --includedir header file installation directory --version the version of the Google Mock installation Version Queries: --min-version=VERSION return 0 if the version is at least VERSION --exact-version=VERSION return 0 if the version is exactly VERSION --max-version=VERSION return 0 if the version is at most VERSION Compilation Flag Queries: --cppflags compile flags specific to the C-like preprocessors --cxxflags compile flags appropriate for C++ programs --ldflags linker flags --libs libraries for linking EOF } # This function bounds our version with a min and a max. It uses some clever # POSIX-compliant variable expansion to portably do all the work in the shell # and avoid any dependency on a particular "sed" or "awk" implementation. # Notable is that it will only ever compare the first 3 components of versions. # Further components will be cleanly stripped off. All versions must be # unadorned, so "v1.0" will *not* work. The minimum version must be in $1, and # the max in $2. TODO(chandlerc@google.com): If this ever breaks, we should # investigate expanding this via autom4te from AS_VERSION_COMPARE rather than # continuing to maintain our own shell version. check_versions() { major_version=${version%%.*} minor_version="0" point_version="0" if test "${version#*.}" != "${version}"; then minor_version=${version#*.} minor_version=${minor_version%%.*} fi if test "${version#*.*.}" != "${version}"; then point_version=${version#*.*.} point_version=${point_version%%.*} fi min_version="$1" min_major_version=${min_version%%.*} min_minor_version="0" min_point_version="0" if test "${min_version#*.}" != "${min_version}"; then min_minor_version=${min_version#*.} min_minor_version=${min_minor_version%%.*} fi if test "${min_version#*.*.}" != "${min_version}"; then min_point_version=${min_version#*.*.} min_point_version=${min_point_version%%.*} fi max_version="$2" max_major_version=${max_version%%.*} max_minor_version="0" max_point_version="0" if test "${max_version#*.}" != "${max_version}"; then max_minor_version=${max_version#*.} max_minor_version=${max_minor_version%%.*} fi if test "${max_version#*.*.}" != "${max_version}"; then max_point_version=${max_version#*.*.} max_point_version=${max_point_version%%.*} fi test $(($major_version)) -lt $(($min_major_version)) && exit 1 if test $(($major_version)) -eq $(($min_major_version)); then test $(($minor_version)) -lt $(($min_minor_version)) && exit 1 if test $(($minor_version)) -eq $(($min_minor_version)); then test $(($point_version)) -lt $(($min_point_version)) && exit 1 fi fi test $(($major_version)) -gt $(($max_major_version)) && exit 1 if test $(($major_version)) -eq $(($max_major_version)); then test $(($minor_version)) -gt $(($max_minor_version)) && exit 1 if test $(($minor_version)) -eq $(($max_minor_version)); then test $(($point_version)) -gt $(($max_point_version)) && exit 1 fi fi exit 0 } # Show the usage line when no arguments are specified. if test $# -eq 0; then show_usage exit 1 fi while test $# -gt 0; do case $1 in --usage) show_usage; exit 0;; --help) show_help; exit 0;; # Installation overrides --prefix=*) GMOCK_PREFIX=${1#--prefix=};; --exec-prefix=*) GMOCK_EXEC_PREFIX=${1#--exec-prefix=};; --libdir=*) GMOCK_LIBDIR=${1#--libdir=};; --includedir=*) GMOCK_INCLUDEDIR=${1#--includedir=};; # Installation queries --prefix|--exec-prefix|--libdir|--includedir|--version) if test -n "${do_query}"; then show_usage exit 1 fi do_query=${1#--} ;; # Version checking --min-version=*) do_check_versions=yes min_version=${1#--min-version=} ;; --max-version=*) do_check_versions=yes max_version=${1#--max-version=} ;; --exact-version=*) do_check_versions=yes exact_version=${1#--exact-version=} ;; # Compiler flag output --cppflags) echo_cppflags=yes;; --cxxflags) echo_cxxflags=yes;; --ldflags) echo_ldflags=yes;; --libs) echo_libs=yes;; # Everything else is an error *) show_usage; exit 1;; esac shift done # These have defaults filled in by the configure script but can also be # overridden by environment variables or command line parameters. prefix="${GMOCK_PREFIX:-@prefix@}" exec_prefix="${GMOCK_EXEC_PREFIX:-@exec_prefix@}" libdir="${GMOCK_LIBDIR:-@libdir@}" includedir="${GMOCK_INCLUDEDIR:-@includedir@}" # We try and detect if our binary is not located at its installed location. If # it's not, we provide variables pointing to the source and build tree rather # than to the install tree. We also locate Google Test using the configured # gtest-config script rather than searching the PATH and our bindir for one. # This allows building against a just-built gmock rather than an installed # gmock. bindir="@bindir@" this_relative_bindir=`dirname $0` this_bindir=`cd ${this_relative_bindir}; pwd -P` if test "${this_bindir}" = "${this_bindir%${bindir}}"; then # The path to the script doesn't end in the bindir sequence from Autoconf, # assume that we are in a build tree. build_dir=`dirname ${this_bindir}` src_dir=`cd ${this_bindir}/@top_srcdir@; pwd -P` # TODO(chandlerc@google.com): This is a dangerous dependency on libtool, we # should work to remove it, and/or remove libtool altogether, replacing it # with direct references to the library and a link path. gmock_libs="${build_dir}/lib/libgmock.la" gmock_ldflags="" # We provide hooks to include from either the source or build dir, where the # build dir is always preferred. This will potentially allow us to write # build rules for generated headers and have them automatically be preferred # over provided versions. gmock_cppflags="-I${build_dir}/include -I${src_dir}/include" gmock_cxxflags="" # Directly invoke the gtest-config script used during the build process. gtest_config="@GTEST_CONFIG@" else # We're using an installed gmock, although it may be staged under some # prefix. Assume (as our own libraries do) that we can resolve the prefix, # and are present in the dynamic link paths. gmock_ldflags="-L${libdir}" gmock_libs="-l${name}" gmock_cppflags="-I${includedir}" gmock_cxxflags="" # We also prefer any gtest-config script installed in our prefix. Lacking # one, we look in the PATH for one. gtest_config="${bindir}/gtest-config" if test ! -x "${gtest_config}"; then gtest_config=`which gtest-config` fi fi # Ensure that we have located a Google Test to link against. if ! test -x "${gtest_config}"; then echo "Unable to locate Google Test, check your Google Mock configuration" \ "and installation" >&2 exit 1 elif ! "${gtest_config}" "--exact-version=@GTEST_VERSION@"; then echo "The Google Test found is not the same version as Google Mock was " \ "built against" >&2 exit 1 fi # Add the necessary Google Test bits into the various flag variables gmock_cppflags="${gmock_cppflags} `${gtest_config} --cppflags`" gmock_cxxflags="${gmock_cxxflags} `${gtest_config} --cxxflags`" gmock_ldflags="${gmock_ldflags} `${gtest_config} --ldflags`" gmock_libs="${gmock_libs} `${gtest_config} --libs`" # Do an installation query if requested. if test -n "$do_query"; then case $do_query in prefix) echo $prefix; exit 0;; exec-prefix) echo $exec_prefix; exit 0;; libdir) echo $libdir; exit 0;; includedir) echo $includedir; exit 0;; version) echo $version; exit 0;; *) show_usage; exit 1;; esac fi # Do a version check if requested. if test "$do_check_versions" = "yes"; then # Make sure we didn't receive a bad combination of parameters. test "$echo_cppflags" = "yes" && show_usage && exit 1 test "$echo_cxxflags" = "yes" && show_usage && exit 1 test "$echo_ldflags" = "yes" && show_usage && exit 1 test "$echo_libs" = "yes" && show_usage && exit 1 if test "$exact_version" != ""; then check_versions $exact_version $exact_version # unreachable else check_versions ${min_version:-0.0.0} ${max_version:-9999.9999.9999} # unreachable fi fi # Do the output in the correct order so that these can be used in-line of # a compiler invocation. output="" test "$echo_cppflags" = "yes" && output="$output $gmock_cppflags" test "$echo_cxxflags" = "yes" && output="$output $gmock_cxxflags" test "$echo_ldflags" = "yes" && output="$output $gmock_ldflags" test "$echo_libs" = "yes" && output="$output $gmock_libs" echo $output exit 0 synergy-1.4.12-Source/tools/gmock-1.6.0/src/0000700000175000017500000000000012140644175020200 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock-all.cc0000600000175000017500000000414611561126632022363 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Mocking Framework (Google Mock) // // This file #includes all Google Mock implementation .cc files. The // purpose is to allow a user to build Google Mock by compiling this // file alone. // This line ensures that gmock.h can be compiled on its own, even // when it's fused. #include "gmock/gmock.h" // The following lines pull in the real gmock *.cc files. #include "src/gmock-cardinalities.cc" #include "src/gmock-internal-utils.cc" #include "src/gmock-matchers.cc" #include "src/gmock-spec-builders.cc" #include "src/gmock.cc" synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock-cardinalities.cc0000600000175000017500000001220211561126632024416 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements cardinalities. #include "gmock/gmock-cardinalities.h" #include #include // NOLINT #include #include #include "gmock/internal/gmock-internal-utils.h" #include "gtest/gtest.h" namespace testing { namespace { // Implements the Between(m, n) cardinality. class BetweenCardinalityImpl : public CardinalityInterface { public: BetweenCardinalityImpl(int min, int max) : min_(min >= 0 ? min : 0), max_(max >= min_ ? max : min_) { std::stringstream ss; if (min < 0) { ss << "The invocation lower bound must be >= 0, " << "but is actually " << min << "."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } else if (max < 0) { ss << "The invocation upper bound must be >= 0, " << "but is actually " << max << "."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } else if (min > max) { ss << "The invocation upper bound (" << max << ") must be >= the invocation lower bound (" << min << ")."; internal::Expect(false, __FILE__, __LINE__, ss.str()); } } // Conservative estimate on the lower/upper bound of the number of // calls allowed. virtual int ConservativeLowerBound() const { return min_; } virtual int ConservativeUpperBound() const { return max_; } virtual bool IsSatisfiedByCallCount(int call_count) const { return min_ <= call_count && call_count <= max_ ; } virtual bool IsSaturatedByCallCount(int call_count) const { return call_count >= max_; } virtual void DescribeTo(::std::ostream* os) const; private: const int min_; const int max_; GTEST_DISALLOW_COPY_AND_ASSIGN_(BetweenCardinalityImpl); }; // Formats "n times" in a human-friendly way. inline internal::string FormatTimes(int n) { if (n == 1) { return "once"; } else if (n == 2) { return "twice"; } else { std::stringstream ss; ss << n << " times"; return ss.str(); } } // Describes the Between(m, n) cardinality in human-friendly text. void BetweenCardinalityImpl::DescribeTo(::std::ostream* os) const { if (min_ == 0) { if (max_ == 0) { *os << "never called"; } else if (max_ == INT_MAX) { *os << "called any number of times"; } else { *os << "called at most " << FormatTimes(max_); } } else if (min_ == max_) { *os << "called " << FormatTimes(min_); } else if (max_ == INT_MAX) { *os << "called at least " << FormatTimes(min_); } else { // 0 < min_ < max_ < INT_MAX *os << "called between " << min_ << " and " << max_ << " times"; } } } // Unnamed namespace // Describes the given call count to an ostream. void Cardinality::DescribeActualCallCountTo(int actual_call_count, ::std::ostream* os) { if (actual_call_count > 0) { *os << "called " << FormatTimes(actual_call_count); } else { *os << "never called"; } } // Creates a cardinality that allows at least n calls. Cardinality AtLeast(int n) { return Between(n, INT_MAX); } // Creates a cardinality that allows at most n calls. Cardinality AtMost(int n) { return Between(0, n); } // Creates a cardinality that allows any number of calls. Cardinality AnyNumber() { return AtLeast(0); } // Creates a cardinality that allows between min and max calls. Cardinality Between(int min, int max) { return Cardinality(new BetweenCardinalityImpl(min, max)); } // Creates a cardinality that allows exactly n calls. Cardinality Exactly(int n) { return Between(n, n); } } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock-internal-utils.cc0000600000175000017500000001473711561126632024574 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file defines some utilities useful for implementing Google // Mock. They are subject to change without notice, so please DO NOT // USE THEM IN USER CODE. #include "gmock/internal/gmock-internal-utils.h" #include #include // NOLINT #include #include "gmock/gmock.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" namespace testing { namespace internal { // Converts an identifier name to a space-separated list of lower-case // words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is // treated as one word. For example, both "FooBar123" and // "foo_bar_123" are converted to "foo bar 123". string ConvertIdentifierNameToWords(const char* id_name) { string result; char prev_char = '\0'; for (const char* p = id_name; *p != '\0'; prev_char = *(p++)) { // We don't care about the current locale as the input is // guaranteed to be a valid C++ identifier name. const bool starts_new_word = IsUpper(*p) || (!IsAlpha(prev_char) && IsLower(*p)) || (!IsDigit(prev_char) && IsDigit(*p)); if (IsAlNum(*p)) { if (starts_new_word && result != "") result += ' '; result += ToLower(*p); } } return result; } // This class reports Google Mock failures as Google Test failures. A // user can define another class in a similar fashion if he intends to // use Google Mock with a testing framework other than Google Test. class GoogleTestFailureReporter : public FailureReporterInterface { public: virtual void ReportFailure(FailureType type, const char* file, int line, const string& message) { AssertHelper(type == FATAL ? TestPartResult::kFatalFailure : TestPartResult::kNonFatalFailure, file, line, message.c_str()) = Message(); if (type == FATAL) { posix::Abort(); } } }; // Returns the global failure reporter. Will create a // GoogleTestFailureReporter and return it the first time called. FailureReporterInterface* GetFailureReporter() { // Points to the global failure reporter used by Google Mock. gcc // guarantees that the following use of failure_reporter is // thread-safe. We may need to add additional synchronization to // protect failure_reporter if we port Google Mock to other // compilers. static FailureReporterInterface* const failure_reporter = new GoogleTestFailureReporter(); return failure_reporter; } // Protects global resources (stdout in particular) used by Log(). static GTEST_DEFINE_STATIC_MUTEX_(g_log_mutex); // Returns true iff a log with the given severity is visible according // to the --gmock_verbose flag. bool LogIsVisible(LogSeverity severity) { if (GMOCK_FLAG(verbose) == kInfoVerbosity) { // Always show the log if --gmock_verbose=info. return true; } else if (GMOCK_FLAG(verbose) == kErrorVerbosity) { // Always hide it if --gmock_verbose=error. return false; } else { // If --gmock_verbose is neither "info" nor "error", we treat it // as "warning" (its default value). return severity == WARNING; } } // Prints the given message to stdout iff 'severity' >= the level // specified by the --gmock_verbose flag. If stack_frames_to_skip >= // 0, also prints the stack trace excluding the top // stack_frames_to_skip frames. In opt mode, any positive // stack_frames_to_skip is treated as 0, since we don't know which // function calls will be inlined by the compiler and need to be // conservative. void Log(LogSeverity severity, const string& message, int stack_frames_to_skip) { if (!LogIsVisible(severity)) return; // Ensures that logs from different threads don't interleave. MutexLock l(&g_log_mutex); // "using ::std::cout;" doesn't work with Symbian's STLport, where cout is a // macro. if (severity == WARNING) { // Prints a GMOCK WARNING marker to make the warnings easily searchable. std::cout << "\nGMOCK WARNING:"; } // Pre-pends a new-line to message if it doesn't start with one. if (message.empty() || message[0] != '\n') { std::cout << "\n"; } std::cout << message; if (stack_frames_to_skip >= 0) { #ifdef NDEBUG // In opt mode, we have to be conservative and skip no stack frame. const int actual_to_skip = 0; #else // In dbg mode, we can do what the caller tell us to do (plus one // for skipping this function's stack frame). const int actual_to_skip = stack_frames_to_skip + 1; #endif // NDEBUG // Appends a new-line to message if it doesn't end with one. if (!message.empty() && *message.rbegin() != '\n') { std::cout << "\n"; } std::cout << "Stack trace:\n" << ::testing::internal::GetCurrentOsStackTraceExceptTop( ::testing::UnitTest::GetInstance(), actual_to_skip); } std::cout << ::std::flush; } } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock-matchers.cc0000600000175000017500000000727011561126632023422 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements Matcher, Matcher, and // utilities for defining matchers. #include "gmock/gmock-matchers.h" #include "gmock/gmock-generated-matchers.h" #include #include #include namespace testing { // Constructs a matcher that matches a const string& whose value is // equal to s. Matcher::Matcher(const internal::string& s) { *this = Eq(s); } // Constructs a matcher that matches a const string& whose value is // equal to s. Matcher::Matcher(const char* s) { *this = Eq(internal::string(s)); } // Constructs a matcher that matches a string whose value is equal to s. Matcher::Matcher(const internal::string& s) { *this = Eq(s); } // Constructs a matcher that matches a string whose value is equal to s. Matcher::Matcher(const char* s) { *this = Eq(internal::string(s)); } namespace internal { // Joins a vector of strings as if they are fields of a tuple; returns // the joined string. string JoinAsTuple(const Strings& fields) { switch (fields.size()) { case 0: return ""; case 1: return fields[0]; default: string result = "(" + fields[0]; for (size_t i = 1; i < fields.size(); i++) { result += ", "; result += fields[i]; } result += ")"; return result; } } // Returns the description for a matcher defined using the MATCHER*() // macro where the user-supplied description string is "", if // 'negation' is false; otherwise returns the description of the // negation of the matcher. 'param_values' contains a list of strings // that are the print-out of the matcher's parameters. string FormatMatcherDescription(bool negation, const char* matcher_name, const Strings& param_values) { string result = ConvertIdentifierNameToWords(matcher_name); if (param_values.size() >= 1) result += " " + JoinAsTuple(param_values); return negation ? "not (" + result + ")" : result; } } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock-spec-builders.cc0000600000175000017500000007005511561126632024356 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file implements the spec builder syntax (ON_CALL and // EXPECT_CALL). #include "gmock/gmock-spec-builders.h" #include #include // NOLINT #include #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" #if GTEST_OS_CYGWIN || GTEST_OS_LINUX || GTEST_OS_MAC # include // NOLINT #endif namespace testing { namespace internal { // Protects the mock object registry (in class Mock), all function // mockers, and all expectations. GTEST_DEFINE_STATIC_MUTEX_(g_gmock_mutex); // Logs a message including file and line number information. void LogWithLocation(testing::internal::LogSeverity severity, const char* file, int line, const string& message) { ::std::ostringstream s; s << file << ":" << line << ": " << message << ::std::endl; Log(severity, s.str(), 0); } // Constructs an ExpectationBase object. ExpectationBase::ExpectationBase(const char* a_file, int a_line, const string& a_source_text) : file_(a_file), line_(a_line), source_text_(a_source_text), cardinality_specified_(false), cardinality_(Exactly(1)), call_count_(0), retired_(false), extra_matcher_specified_(false), repeated_action_specified_(false), retires_on_saturation_(false), last_clause_(kNone), action_count_checked_(false) {} // Destructs an ExpectationBase object. ExpectationBase::~ExpectationBase() {} // Explicitly specifies the cardinality of this expectation. Used by // the subclasses to implement the .Times() clause. void ExpectationBase::SpecifyCardinality(const Cardinality& a_cardinality) { cardinality_specified_ = true; cardinality_ = a_cardinality; } // Retires all pre-requisites of this expectation. void ExpectationBase::RetireAllPreRequisites() { if (is_retired()) { // We can take this short-cut as we never retire an expectation // until we have retired all its pre-requisites. return; } for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { ExpectationBase* const prerequisite = it->expectation_base().get(); if (!prerequisite->is_retired()) { prerequisite->RetireAllPreRequisites(); prerequisite->Retire(); } } } // Returns true iff all pre-requisites of this expectation have been // satisfied. // L >= g_gmock_mutex bool ExpectationBase::AllPrerequisitesAreSatisfied() const { g_gmock_mutex.AssertHeld(); for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { if (!(it->expectation_base()->IsSatisfied()) || !(it->expectation_base()->AllPrerequisitesAreSatisfied())) return false; } return true; } // Adds unsatisfied pre-requisites of this expectation to 'result'. // L >= g_gmock_mutex void ExpectationBase::FindUnsatisfiedPrerequisites( ExpectationSet* result) const { g_gmock_mutex.AssertHeld(); for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin(); it != immediate_prerequisites_.end(); ++it) { if (it->expectation_base()->IsSatisfied()) { // If *it is satisfied and has a call count of 0, some of its // pre-requisites may not be satisfied yet. if (it->expectation_base()->call_count_ == 0) { it->expectation_base()->FindUnsatisfiedPrerequisites(result); } } else { // Now that we know *it is unsatisfied, we are not so interested // in whether its pre-requisites are satisfied. Therefore we // don't recursively call FindUnsatisfiedPrerequisites() here. *result += *it; } } } // Describes how many times a function call matching this // expectation has occurred. // L >= g_gmock_mutex void ExpectationBase::DescribeCallCountTo(::std::ostream* os) const { g_gmock_mutex.AssertHeld(); // Describes how many times the function is expected to be called. *os << " Expected: to be "; cardinality().DescribeTo(os); *os << "\n Actual: "; Cardinality::DescribeActualCallCountTo(call_count(), os); // Describes the state of the expectation (e.g. is it satisfied? // is it active?). *os << " - " << (IsOverSaturated() ? "over-saturated" : IsSaturated() ? "saturated" : IsSatisfied() ? "satisfied" : "unsatisfied") << " and " << (is_retired() ? "retired" : "active"); } // Checks the action count (i.e. the number of WillOnce() and // WillRepeatedly() clauses) against the cardinality if this hasn't // been done before. Prints a warning if there are too many or too // few actions. // L < mutex_ void ExpectationBase::CheckActionCountIfNotDone() const { bool should_check = false; { MutexLock l(&mutex_); if (!action_count_checked_) { action_count_checked_ = true; should_check = true; } } if (should_check) { if (!cardinality_specified_) { // The cardinality was inferred - no need to check the action // count against it. return; } // The cardinality was explicitly specified. const int action_count = static_cast(untyped_actions_.size()); const int upper_bound = cardinality().ConservativeUpperBound(); const int lower_bound = cardinality().ConservativeLowerBound(); bool too_many; // True if there are too many actions, or false // if there are too few. if (action_count > upper_bound || (action_count == upper_bound && repeated_action_specified_)) { too_many = true; } else if (0 < action_count && action_count < lower_bound && !repeated_action_specified_) { too_many = false; } else { return; } ::std::stringstream ss; DescribeLocationTo(&ss); ss << "Too " << (too_many ? "many" : "few") << " actions specified in " << source_text() << "...\n" << "Expected to be "; cardinality().DescribeTo(&ss); ss << ", but has " << (too_many ? "" : "only ") << action_count << " WillOnce()" << (action_count == 1 ? "" : "s"); if (repeated_action_specified_) { ss << " and a WillRepeatedly()"; } ss << "."; Log(WARNING, ss.str(), -1); // -1 means "don't print stack trace". } } // Implements the .Times() clause. void ExpectationBase::UntypedTimes(const Cardinality& a_cardinality) { if (last_clause_ == kTimes) { ExpectSpecProperty(false, ".Times() cannot appear " "more than once in an EXPECT_CALL()."); } else { ExpectSpecProperty(last_clause_ < kTimes, ".Times() cannot appear after " ".InSequence(), .WillOnce(), .WillRepeatedly(), " "or .RetiresOnSaturation()."); } last_clause_ = kTimes; SpecifyCardinality(a_cardinality); } // Points to the implicit sequence introduced by a living InSequence // object (if any) in the current thread or NULL. ThreadLocal g_gmock_implicit_sequence; // Reports an uninteresting call (whose description is in msg) in the // manner specified by 'reaction'. void ReportUninterestingCall(CallReaction reaction, const string& msg) { switch (reaction) { case ALLOW: Log(INFO, msg, 3); break; case WARN: Log(WARNING, msg, 3); break; default: // FAIL Expect(false, NULL, -1, msg); } } UntypedFunctionMockerBase::UntypedFunctionMockerBase() : mock_obj_(NULL), name_("") {} UntypedFunctionMockerBase::~UntypedFunctionMockerBase() {} // Sets the mock object this mock method belongs to, and registers // this information in the global mock registry. Will be called // whenever an EXPECT_CALL() or ON_CALL() is executed on this mock // method. // L < g_gmock_mutex void UntypedFunctionMockerBase::RegisterOwner(const void* mock_obj) { { MutexLock l(&g_gmock_mutex); mock_obj_ = mock_obj; } Mock::Register(mock_obj, this); } // Sets the mock object this mock method belongs to, and sets the name // of the mock function. Will be called upon each invocation of this // mock function. // L < g_gmock_mutex void UntypedFunctionMockerBase::SetOwnerAndName( const void* mock_obj, const char* name) { // We protect name_ under g_gmock_mutex in case this mock function // is called from two threads concurrently. MutexLock l(&g_gmock_mutex); mock_obj_ = mock_obj; name_ = name; } // Returns the name of the function being mocked. Must be called // after RegisterOwner() or SetOwnerAndName() has been called. // L < g_gmock_mutex const void* UntypedFunctionMockerBase::MockObject() const { const void* mock_obj; { // We protect mock_obj_ under g_gmock_mutex in case this mock // function is called from two threads concurrently. MutexLock l(&g_gmock_mutex); Assert(mock_obj_ != NULL, __FILE__, __LINE__, "MockObject() must not be called before RegisterOwner() or " "SetOwnerAndName() has been called."); mock_obj = mock_obj_; } return mock_obj; } // Returns the name of this mock method. Must be called after // SetOwnerAndName() has been called. // L < g_gmock_mutex const char* UntypedFunctionMockerBase::Name() const { const char* name; { // We protect name_ under g_gmock_mutex in case this mock // function is called from two threads concurrently. MutexLock l(&g_gmock_mutex); Assert(name_ != NULL, __FILE__, __LINE__, "Name() must not be called before SetOwnerAndName() has " "been called."); name = name_; } return name; } // Calculates the result of invoking this mock function with the given // arguments, prints it, and returns it. The caller is responsible // for deleting the result. // L < g_gmock_mutex const UntypedActionResultHolderBase* UntypedFunctionMockerBase::UntypedInvokeWith(const void* const untyped_args) { if (untyped_expectations_.size() == 0) { // No expectation is set on this mock method - we have an // uninteresting call. // We must get Google Mock's reaction on uninteresting calls // made on this mock object BEFORE performing the action, // because the action may DELETE the mock object and make the // following expression meaningless. const CallReaction reaction = Mock::GetReactionOnUninterestingCalls(MockObject()); // True iff we need to print this call's arguments and return // value. This definition must be kept in sync with // the behavior of ReportUninterestingCall(). const bool need_to_report_uninteresting_call = // If the user allows this uninteresting call, we print it // only when he wants informational messages. reaction == ALLOW ? LogIsVisible(INFO) : // If the user wants this to be a warning, we print it only // when he wants to see warnings. reaction == WARN ? LogIsVisible(WARNING) : // Otherwise, the user wants this to be an error, and we // should always print detailed information in the error. true; if (!need_to_report_uninteresting_call) { // Perform the action without printing the call information. return this->UntypedPerformDefaultAction(untyped_args, ""); } // Warns about the uninteresting call. ::std::stringstream ss; this->UntypedDescribeUninterestingCall(untyped_args, &ss); // Calculates the function result. const UntypedActionResultHolderBase* const result = this->UntypedPerformDefaultAction(untyped_args, ss.str()); // Prints the function result. if (result != NULL) result->PrintAsActionResult(&ss); ReportUninterestingCall(reaction, ss.str()); return result; } bool is_excessive = false; ::std::stringstream ss; ::std::stringstream why; ::std::stringstream loc; const void* untyped_action = NULL; // The UntypedFindMatchingExpectation() function acquires and // releases g_gmock_mutex. const ExpectationBase* const untyped_expectation = this->UntypedFindMatchingExpectation( untyped_args, &untyped_action, &is_excessive, &ss, &why); const bool found = untyped_expectation != NULL; // True iff we need to print the call's arguments and return value. // This definition must be kept in sync with the uses of Expect() // and Log() in this function. const bool need_to_report_call = !found || is_excessive || LogIsVisible(INFO); if (!need_to_report_call) { // Perform the action without printing the call information. return untyped_action == NULL ? this->UntypedPerformDefaultAction(untyped_args, "") : this->UntypedPerformAction(untyped_action, untyped_args); } ss << " Function call: " << Name(); this->UntypedPrintArgs(untyped_args, &ss); // In case the action deletes a piece of the expectation, we // generate the message beforehand. if (found && !is_excessive) { untyped_expectation->DescribeLocationTo(&loc); } const UntypedActionResultHolderBase* const result = untyped_action == NULL ? this->UntypedPerformDefaultAction(untyped_args, ss.str()) : this->UntypedPerformAction(untyped_action, untyped_args); if (result != NULL) result->PrintAsActionResult(&ss); ss << "\n" << why.str(); if (!found) { // No expectation matches this call - reports a failure. Expect(false, NULL, -1, ss.str()); } else if (is_excessive) { // We had an upper-bound violation and the failure message is in ss. Expect(false, untyped_expectation->file(), untyped_expectation->line(), ss.str()); } else { // We had an expected call and the matching expectation is // described in ss. Log(INFO, loc.str() + ss.str(), 2); } return result; } // Returns an Expectation object that references and co-owns exp, // which must be an expectation on this mock function. Expectation UntypedFunctionMockerBase::GetHandleOf(ExpectationBase* exp) { for (UntypedExpectations::const_iterator it = untyped_expectations_.begin(); it != untyped_expectations_.end(); ++it) { if (it->get() == exp) { return Expectation(*it); } } Assert(false, __FILE__, __LINE__, "Cannot find expectation."); return Expectation(); // The above statement is just to make the code compile, and will // never be executed. } // Verifies that all expectations on this mock function have been // satisfied. Reports one or more Google Test non-fatal failures // and returns false if not. // L >= g_gmock_mutex bool UntypedFunctionMockerBase::VerifyAndClearExpectationsLocked() { g_gmock_mutex.AssertHeld(); bool expectations_met = true; for (UntypedExpectations::const_iterator it = untyped_expectations_.begin(); it != untyped_expectations_.end(); ++it) { ExpectationBase* const untyped_expectation = it->get(); if (untyped_expectation->IsOverSaturated()) { // There was an upper-bound violation. Since the error was // already reported when it occurred, there is no need to do // anything here. expectations_met = false; } else if (!untyped_expectation->IsSatisfied()) { expectations_met = false; ::std::stringstream ss; ss << "Actual function call count doesn't match " << untyped_expectation->source_text() << "...\n"; // No need to show the source file location of the expectation // in the description, as the Expect() call that follows already // takes care of it. untyped_expectation->MaybeDescribeExtraMatcherTo(&ss); untyped_expectation->DescribeCallCountTo(&ss); Expect(false, untyped_expectation->file(), untyped_expectation->line(), ss.str()); } } untyped_expectations_.clear(); return expectations_met; } } // namespace internal // Class Mock. namespace { typedef std::set FunctionMockers; // The current state of a mock object. Such information is needed for // detecting leaked mock objects and explicitly verifying a mock's // expectations. struct MockObjectState { MockObjectState() : first_used_file(NULL), first_used_line(-1), leakable(false) {} // Where in the source file an ON_CALL or EXPECT_CALL is first // invoked on this mock object. const char* first_used_file; int first_used_line; ::std::string first_used_test_case; ::std::string first_used_test; bool leakable; // true iff it's OK to leak the object. FunctionMockers function_mockers; // All registered methods of the object. }; // A global registry holding the state of all mock objects that are // alive. A mock object is added to this registry the first time // Mock::AllowLeak(), ON_CALL(), or EXPECT_CALL() is called on it. It // is removed from the registry in the mock object's destructor. class MockObjectRegistry { public: // Maps a mock object (identified by its address) to its state. typedef std::map StateMap; // This destructor will be called when a program exits, after all // tests in it have been run. By then, there should be no mock // object alive. Therefore we report any living object as test // failure, unless the user explicitly asked us to ignore it. ~MockObjectRegistry() { // "using ::std::cout;" doesn't work with Symbian's STLport, where cout is // a macro. if (!GMOCK_FLAG(catch_leaked_mocks)) return; int leaked_count = 0; for (StateMap::const_iterator it = states_.begin(); it != states_.end(); ++it) { if (it->second.leakable) // The user said it's fine to leak this object. continue; // TODO(wan@google.com): Print the type of the leaked object. // This can help the user identify the leaked object. std::cout << "\n"; const MockObjectState& state = it->second; std::cout << internal::FormatFileLocation(state.first_used_file, state.first_used_line); std::cout << " ERROR: this mock object"; if (state.first_used_test != "") { std::cout << " (used in test " << state.first_used_test_case << "." << state.first_used_test << ")"; } std::cout << " should be deleted but never is. Its address is @" << it->first << "."; leaked_count++; } if (leaked_count > 0) { std::cout << "\nERROR: " << leaked_count << " leaked mock " << (leaked_count == 1 ? "object" : "objects") << " found at program exit.\n"; std::cout.flush(); ::std::cerr.flush(); // RUN_ALL_TESTS() has already returned when this destructor is // called. Therefore we cannot use the normal Google Test // failure reporting mechanism. _exit(1); // We cannot call exit() as it is not reentrant and // may already have been called. } } StateMap& states() { return states_; } private: StateMap states_; }; // Protected by g_gmock_mutex. MockObjectRegistry g_mock_object_registry; // Maps a mock object to the reaction Google Mock should have when an // uninteresting method is called. Protected by g_gmock_mutex. std::map g_uninteresting_call_reaction; // Sets the reaction Google Mock should have when an uninteresting // method of the given mock object is called. // L < g_gmock_mutex void SetReactionOnUninterestingCalls(const void* mock_obj, internal::CallReaction reaction) { internal::MutexLock l(&internal::g_gmock_mutex); g_uninteresting_call_reaction[mock_obj] = reaction; } } // namespace // Tells Google Mock to allow uninteresting calls on the given mock // object. // L < g_gmock_mutex void Mock::AllowUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::ALLOW); } // Tells Google Mock to warn the user about uninteresting calls on the // given mock object. // L < g_gmock_mutex void Mock::WarnUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::WARN); } // Tells Google Mock to fail uninteresting calls on the given mock // object. // L < g_gmock_mutex void Mock::FailUninterestingCalls(const void* mock_obj) { SetReactionOnUninterestingCalls(mock_obj, internal::FAIL); } // Tells Google Mock the given mock object is being destroyed and its // entry in the call-reaction table should be removed. // L < g_gmock_mutex void Mock::UnregisterCallReaction(const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); g_uninteresting_call_reaction.erase(mock_obj); } // Returns the reaction Google Mock will have on uninteresting calls // made on the given mock object. // L < g_gmock_mutex internal::CallReaction Mock::GetReactionOnUninterestingCalls( const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); return (g_uninteresting_call_reaction.count(mock_obj) == 0) ? internal::WARN : g_uninteresting_call_reaction[mock_obj]; } // Tells Google Mock to ignore mock_obj when checking for leaked mock // objects. // L < g_gmock_mutex void Mock::AllowLeak(const void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); g_mock_object_registry.states()[mock_obj].leakable = true; } // Verifies and clears all expectations on the given mock object. If // the expectations aren't satisfied, generates one or more Google // Test non-fatal failures and returns false. // L < g_gmock_mutex bool Mock::VerifyAndClearExpectations(void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); return VerifyAndClearExpectationsLocked(mock_obj); } // Verifies all expectations on the given mock object and clears its // default actions and expectations. Returns true iff the // verification was successful. // L < g_gmock_mutex bool Mock::VerifyAndClear(void* mock_obj) { internal::MutexLock l(&internal::g_gmock_mutex); ClearDefaultActionsLocked(mock_obj); return VerifyAndClearExpectationsLocked(mock_obj); } // Verifies and clears all expectations on the given mock object. If // the expectations aren't satisfied, generates one or more Google // Test non-fatal failures and returns false. // L >= g_gmock_mutex bool Mock::VerifyAndClearExpectationsLocked(void* mock_obj) { internal::g_gmock_mutex.AssertHeld(); if (g_mock_object_registry.states().count(mock_obj) == 0) { // No EXPECT_CALL() was set on the given mock object. return true; } // Verifies and clears the expectations on each mock method in the // given mock object. bool expectations_met = true; FunctionMockers& mockers = g_mock_object_registry.states()[mock_obj].function_mockers; for (FunctionMockers::const_iterator it = mockers.begin(); it != mockers.end(); ++it) { if (!(*it)->VerifyAndClearExpectationsLocked()) { expectations_met = false; } } // We don't clear the content of mockers, as they may still be // needed by ClearDefaultActionsLocked(). return expectations_met; } // Registers a mock object and a mock method it owns. // L < g_gmock_mutex void Mock::Register(const void* mock_obj, internal::UntypedFunctionMockerBase* mocker) { internal::MutexLock l(&internal::g_gmock_mutex); g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker); } // Tells Google Mock where in the source code mock_obj is used in an // ON_CALL or EXPECT_CALL. In case mock_obj is leaked, this // information helps the user identify which object it is. // L < g_gmock_mutex void Mock::RegisterUseByOnCallOrExpectCall( const void* mock_obj, const char* file, int line) { internal::MutexLock l(&internal::g_gmock_mutex); MockObjectState& state = g_mock_object_registry.states()[mock_obj]; if (state.first_used_file == NULL) { state.first_used_file = file; state.first_used_line = line; const TestInfo* const test_info = UnitTest::GetInstance()->current_test_info(); if (test_info != NULL) { // TODO(wan@google.com): record the test case name when the // ON_CALL or EXPECT_CALL is invoked from SetUpTestCase() or // TearDownTestCase(). state.first_used_test_case = test_info->test_case_name(); state.first_used_test = test_info->name(); } } } // Unregisters a mock method; removes the owning mock object from the // registry when the last mock method associated with it has been // unregistered. This is called only in the destructor of // FunctionMockerBase. // L >= g_gmock_mutex void Mock::UnregisterLocked(internal::UntypedFunctionMockerBase* mocker) { internal::g_gmock_mutex.AssertHeld(); for (MockObjectRegistry::StateMap::iterator it = g_mock_object_registry.states().begin(); it != g_mock_object_registry.states().end(); ++it) { FunctionMockers& mockers = it->second.function_mockers; if (mockers.erase(mocker) > 0) { // mocker was in mockers and has been just removed. if (mockers.empty()) { g_mock_object_registry.states().erase(it); } return; } } } // Clears all ON_CALL()s set on the given mock object. // L >= g_gmock_mutex void Mock::ClearDefaultActionsLocked(void* mock_obj) { internal::g_gmock_mutex.AssertHeld(); if (g_mock_object_registry.states().count(mock_obj) == 0) { // No ON_CALL() was set on the given mock object. return; } // Clears the default actions for each mock method in the given mock // object. FunctionMockers& mockers = g_mock_object_registry.states()[mock_obj].function_mockers; for (FunctionMockers::const_iterator it = mockers.begin(); it != mockers.end(); ++it) { (*it)->ClearDefaultActionsLocked(); } // We don't clear the content of mockers, as they may still be // needed by VerifyAndClearExpectationsLocked(). } Expectation::Expectation() {} Expectation::Expectation( const internal::linked_ptr& an_expectation_base) : expectation_base_(an_expectation_base) {} Expectation::~Expectation() {} // Adds an expectation to a sequence. void Sequence::AddExpectation(const Expectation& expectation) const { if (*last_expectation_ != expectation) { if (last_expectation_->expectation_base() != NULL) { expectation.expectation_base()->immediate_prerequisites_ += *last_expectation_; } *last_expectation_ = expectation; } } // Creates the implicit sequence if there isn't one. InSequence::InSequence() { if (internal::g_gmock_implicit_sequence.get() == NULL) { internal::g_gmock_implicit_sequence.set(new Sequence); sequence_created_ = true; } else { sequence_created_ = false; } } // Deletes the implicit sequence if it was created by the constructor // of this object. InSequence::~InSequence() { if (sequence_created_) { delete internal::g_gmock_implicit_sequence.get(); internal::g_gmock_implicit_sequence.set(NULL); } } } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock.cc0000600000175000017500000001542111561126632021613 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gmock/gmock.h" #include "gmock/internal/gmock-port.h" namespace testing { // TODO(wan@google.com): support using environment variables to // control the flag values, like what Google Test does. GMOCK_DEFINE_bool_(catch_leaked_mocks, true, "true iff Google Mock should report leaked mock objects " "as failures."); GMOCK_DEFINE_string_(verbose, internal::kWarningVerbosity, "Controls how verbose Google Mock's output is." " Valid values:\n" " info - prints all messages.\n" " warning - prints warnings and errors.\n" " error - prints errors only."); namespace internal { // Parses a string as a command line flag. The string should have the // format "--gmock_flag=value". When def_optional is true, the // "=value" part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. static const char* ParseGoogleMockFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--gmock_". const String flag_str = String::Format("--gmock_%s", flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a Google Mock bool flag, in the form of // "--gmock_flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. static bool ParseGoogleMockBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseGoogleMockFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for a Google Mock string flag, in the form of // "--gmock_flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. static bool ParseGoogleMockStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseGoogleMockFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // The internal implementation of InitGoogleMock(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleMockImpl(int* argc, CharType** argv) { // Makes sure Google Test is initialized. InitGoogleTest() is // idempotent, so it's fine if the user has already called it. InitGoogleTest(argc, argv); if (*argc <= 0) return; for (int i = 1; i != *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); // Do we see a Google Mock flag? if (ParseGoogleMockBoolFlag(arg, "catch_leaked_mocks", &GMOCK_FLAG(catch_leaked_mocks)) || ParseGoogleMockStringFlag(arg, "verbose", &GMOCK_FLAG(verbose))) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } } } } // namespace internal // Initializes Google Mock. This must be called before running the // tests. In particular, it parses a command line for the flags that // Google Mock recognizes. Whenever a Google Mock flag is seen, it is // removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Mock flag variables are // updated. // // Since Google Test is needed for Google Mock to work, this function // also initializes Google Test and parses its flags, if that hasn't // been done. void InitGoogleMock(int* argc, char** argv) { internal::InitGoogleMockImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleMock(int* argc, wchar_t** argv) { internal::InitGoogleMockImpl(argc, argv); } } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/src/gmock_main.cc0000600000175000017500000000501311561126632022613 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include "gmock/gmock.h" #include "gtest/gtest.h" // MS C++ compiler/linker has a bug on Windows (not on Windows CE), which // causes a link error when _tmain is defined in a static library and UNICODE // is enabled. For this reason instead of _tmain, main function is used on // Windows. See the following link to track the current status of this bug: // http://connect.microsoft.com/VisualStudio/feedback/ViewFeedback.aspx?FeedbackID=394464 // NOLINT #if GTEST_OS_WINDOWS_MOBILE # include // NOLINT int _tmain(int argc, TCHAR** argv) { #else int main(int argc, char** argv) { #endif // GTEST_OS_WINDOWS_MOBILE std::cout << "Running main() from gmock_main.cc\n"; // Since Google Mock depends on Google Test, InitGoogleMock() is // also responsible for initializing Google Test. Therefore there's // no need for calling testing::InitGoogleTest() separately. testing::InitGoogleMock(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gmock-1.6.0/test/0000700000175000017500000000000012140644175020370 5ustar synergysynergysynergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-actions_test.cc0000600000175000017500000012024711561126632024503 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the built-in actions. #include "gmock/gmock-actions.h" #include #include #include #include "gmock/gmock.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" namespace { using ::std::tr1::get; using ::std::tr1::make_tuple; using ::std::tr1::tuple; using ::std::tr1::tuple_element; using testing::internal::BuiltInDefaultValue; using testing::internal::Int64; using testing::internal::UInt64; // This list should be kept sorted. using testing::_; using testing::Action; using testing::ActionInterface; using testing::Assign; using testing::ByRef; using testing::DefaultValue; using testing::DoDefault; using testing::IgnoreResult; using testing::Invoke; using testing::InvokeWithoutArgs; using testing::MakePolymorphicAction; using testing::Ne; using testing::PolymorphicAction; using testing::Return; using testing::ReturnNull; using testing::ReturnRef; using testing::ReturnRefOfCopy; using testing::SetArgPointee; using testing::SetArgumentPointee; #if !GTEST_OS_WINDOWS_MOBILE using testing::SetErrnoAndReturn; #endif #if GTEST_HAS_PROTOBUF_ using testing::internal::TestMessage; #endif // GTEST_HAS_PROTOBUF_ // Tests that BuiltInDefaultValue::Get() returns NULL. TEST(BuiltInDefaultValueTest, IsNullForPointerTypes) { EXPECT_TRUE(BuiltInDefaultValue::Get() == NULL); EXPECT_TRUE(BuiltInDefaultValue::Get() == NULL); EXPECT_TRUE(BuiltInDefaultValue::Get() == NULL); } // Tests that BuiltInDefaultValue::Exists() return true. TEST(BuiltInDefaultValueTest, ExistsForPointerTypes) { EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); } // Tests that BuiltInDefaultValue::Get() returns 0 when T is a // built-in numeric type. TEST(BuiltInDefaultValueTest, IsZeroForNumericTypes) { EXPECT_EQ(0U, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); #if GMOCK_HAS_SIGNED_WCHAR_T_ EXPECT_EQ(0U, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); #endif #if GMOCK_WCHAR_T_IS_NATIVE_ EXPECT_EQ(0, BuiltInDefaultValue::Get()); #endif EXPECT_EQ(0U, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0U, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_EQ(0U, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0, BuiltInDefaultValue::Get()); // NOLINT EXPECT_EQ(0U, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); } // Tests that BuiltInDefaultValue::Exists() returns true when T is a // built-in numeric type. TEST(BuiltInDefaultValueTest, ExistsForNumericTypes) { EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); #if GMOCK_HAS_SIGNED_WCHAR_T_ EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); #endif #if GMOCK_WCHAR_T_IS_NATIVE_ EXPECT_TRUE(BuiltInDefaultValue::Exists()); #endif EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); // NOLINT EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); EXPECT_TRUE(BuiltInDefaultValue::Exists()); } // Tests that BuiltInDefaultValue::Get() returns false. TEST(BuiltInDefaultValueTest, IsFalseForBool) { EXPECT_FALSE(BuiltInDefaultValue::Get()); } // Tests that BuiltInDefaultValue::Exists() returns true. TEST(BuiltInDefaultValueTest, BoolExists) { EXPECT_TRUE(BuiltInDefaultValue::Exists()); } // Tests that BuiltInDefaultValue::Get() returns "" when T is a // string type. TEST(BuiltInDefaultValueTest, IsEmptyStringForString) { #if GTEST_HAS_GLOBAL_STRING EXPECT_EQ("", BuiltInDefaultValue< ::string>::Get()); #endif // GTEST_HAS_GLOBAL_STRING EXPECT_EQ("", BuiltInDefaultValue< ::std::string>::Get()); } // Tests that BuiltInDefaultValue::Exists() returns true when T is a // string type. TEST(BuiltInDefaultValueTest, ExistsForString) { #if GTEST_HAS_GLOBAL_STRING EXPECT_TRUE(BuiltInDefaultValue< ::string>::Exists()); #endif // GTEST_HAS_GLOBAL_STRING EXPECT_TRUE(BuiltInDefaultValue< ::std::string>::Exists()); } // Tests that BuiltInDefaultValue::Get() returns the same // value as BuiltInDefaultValue::Get() does. TEST(BuiltInDefaultValueTest, WorksForConstTypes) { EXPECT_EQ("", BuiltInDefaultValue::Get()); EXPECT_EQ(0, BuiltInDefaultValue::Get()); EXPECT_TRUE(BuiltInDefaultValue::Get() == NULL); EXPECT_FALSE(BuiltInDefaultValue::Get()); } // Tests that BuiltInDefaultValue::Get() aborts the program with // the correct error message when T is a user-defined type. struct UserType { UserType() : value(0) {} int value; }; TEST(BuiltInDefaultValueTest, UserTypeHasNoDefault) { EXPECT_FALSE(BuiltInDefaultValue::Exists()); } // Tests that BuiltInDefaultValue::Get() aborts the program. TEST(BuiltInDefaultValueDeathTest, IsUndefinedForReferences) { EXPECT_DEATH_IF_SUPPORTED({ BuiltInDefaultValue::Get(); }, ""); EXPECT_DEATH_IF_SUPPORTED({ BuiltInDefaultValue::Get(); }, ""); } TEST(BuiltInDefaultValueDeathTest, IsUndefinedForUserTypes) { EXPECT_DEATH_IF_SUPPORTED({ BuiltInDefaultValue::Get(); }, ""); } // Tests that DefaultValue::IsSet() is false initially. TEST(DefaultValueTest, IsInitiallyUnset) { EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::IsSet()); } // Tests that DefaultValue can be set and then unset. TEST(DefaultValueTest, CanBeSetAndUnset) { EXPECT_TRUE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::Exists()); DefaultValue::Set(1); DefaultValue::Set(UserType()); EXPECT_EQ(1, DefaultValue::Get()); EXPECT_EQ(0, DefaultValue::Get().value); EXPECT_TRUE(DefaultValue::Exists()); EXPECT_TRUE(DefaultValue::Exists()); DefaultValue::Clear(); DefaultValue::Clear(); EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_TRUE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::Exists()); } // Tests that DefaultValue::Get() returns the // BuiltInDefaultValue::Get() when DefaultValue::IsSet() is // false. TEST(DefaultValueDeathTest, GetReturnsBuiltInDefaultValueWhenUnset) { EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_TRUE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::Exists()); EXPECT_EQ(0, DefaultValue::Get()); EXPECT_DEATH_IF_SUPPORTED({ DefaultValue::Get(); }, ""); } // Tests that DefaultValue::Get() returns void. TEST(DefaultValueTest, GetWorksForVoid) { return DefaultValue::Get(); } // Tests using DefaultValue with a reference type. // Tests that DefaultValue::IsSet() is false initially. TEST(DefaultValueOfReferenceTest, IsInitiallyUnset) { EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::IsSet()); } // Tests that DefaultValue::Exists is false initiallly. TEST(DefaultValueOfReferenceTest, IsInitiallyNotExisting) { EXPECT_FALSE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::Exists()); } // Tests that DefaultValue can be set and then unset. TEST(DefaultValueOfReferenceTest, CanBeSetAndUnset) { int n = 1; DefaultValue::Set(n); UserType u; DefaultValue::Set(u); EXPECT_TRUE(DefaultValue::Exists()); EXPECT_TRUE(DefaultValue::Exists()); EXPECT_EQ(&n, &(DefaultValue::Get())); EXPECT_EQ(&u, &(DefaultValue::Get())); DefaultValue::Clear(); DefaultValue::Clear(); EXPECT_FALSE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::Exists()); EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::IsSet()); } // Tests that DefaultValue::Get() returns the // BuiltInDefaultValue::Get() when DefaultValue::IsSet() is // false. TEST(DefaultValueOfReferenceDeathTest, GetReturnsBuiltInDefaultValueWhenUnset) { EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_FALSE(DefaultValue::IsSet()); EXPECT_DEATH_IF_SUPPORTED({ DefaultValue::Get(); }, ""); EXPECT_DEATH_IF_SUPPORTED({ DefaultValue::Get(); }, ""); } // Tests that ActionInterface can be implemented by defining the // Perform method. typedef int MyFunction(bool, int); class MyActionImpl : public ActionInterface { public: virtual int Perform(const tuple& args) { return get<0>(args) ? get<1>(args) : 0; } }; TEST(ActionInterfaceTest, CanBeImplementedByDefiningPerform) { MyActionImpl my_action_impl; (void)my_action_impl; } TEST(ActionInterfaceTest, MakeAction) { Action action = MakeAction(new MyActionImpl); // When exercising the Perform() method of Action, we must pass // it a tuple whose size and type are compatible with F's argument // types. For example, if F is int(), then Perform() takes a // 0-tuple; if F is void(bool, int), then Perform() takes a // tuple, and so on. EXPECT_EQ(5, action.Perform(make_tuple(true, 5))); } // Tests that Action can be contructed from a pointer to // ActionInterface. TEST(ActionTest, CanBeConstructedFromActionInterface) { Action action(new MyActionImpl); } // Tests that Action delegates actual work to ActionInterface. TEST(ActionTest, DelegatesWorkToActionInterface) { const Action action(new MyActionImpl); EXPECT_EQ(5, action.Perform(make_tuple(true, 5))); EXPECT_EQ(0, action.Perform(make_tuple(false, 1))); } // Tests that Action can be copied. TEST(ActionTest, IsCopyable) { Action a1(new MyActionImpl); Action a2(a1); // Tests the copy constructor. // a1 should continue to work after being copied from. EXPECT_EQ(5, a1.Perform(make_tuple(true, 5))); EXPECT_EQ(0, a1.Perform(make_tuple(false, 1))); // a2 should work like the action it was copied from. EXPECT_EQ(5, a2.Perform(make_tuple(true, 5))); EXPECT_EQ(0, a2.Perform(make_tuple(false, 1))); a2 = a1; // Tests the assignment operator. // a1 should continue to work after being copied from. EXPECT_EQ(5, a1.Perform(make_tuple(true, 5))); EXPECT_EQ(0, a1.Perform(make_tuple(false, 1))); // a2 should work like the action it was copied from. EXPECT_EQ(5, a2.Perform(make_tuple(true, 5))); EXPECT_EQ(0, a2.Perform(make_tuple(false, 1))); } // Tests that an Action object can be converted to a // compatible Action object. class IsNotZero : public ActionInterface { // NOLINT public: virtual bool Perform(const tuple& arg) { return get<0>(arg) != 0; } }; #if !GTEST_OS_SYMBIAN // Compiling this test on Nokia's Symbian compiler fails with: // 'Result' is not a member of class 'testing::internal::Function' // (point of instantiation: '@unnamed@gmock_actions_test_cc@:: // ActionTest_CanBeConvertedToOtherActionType_Test::TestBody()') // with no obvious fix. TEST(ActionTest, CanBeConvertedToOtherActionType) { const Action a1(new IsNotZero); // NOLINT const Action a2 = Action(a1); // NOLINT EXPECT_EQ(1, a2.Perform(make_tuple('a'))); EXPECT_EQ(0, a2.Perform(make_tuple('\0'))); } #endif // !GTEST_OS_SYMBIAN // The following two classes are for testing MakePolymorphicAction(). // Implements a polymorphic action that returns the second of the // arguments it receives. class ReturnSecondArgumentAction { public: // We want to verify that MakePolymorphicAction() can work with a // polymorphic action whose Perform() method template is either // const or not. This lets us verify the non-const case. template Result Perform(const ArgumentTuple& args) { return get<1>(args); } }; // Implements a polymorphic action that can be used in a nullary // function to return 0. class ReturnZeroFromNullaryFunctionAction { public: // For testing that MakePolymorphicAction() works when the // implementation class' Perform() method template takes only one // template parameter. // // We want to verify that MakePolymorphicAction() can work with a // polymorphic action whose Perform() method template is either // const or not. This lets us verify the const case. template Result Perform(const tuple<>&) const { return 0; } }; // These functions verify that MakePolymorphicAction() returns a // PolymorphicAction where T is the argument's type. PolymorphicAction ReturnSecondArgument() { return MakePolymorphicAction(ReturnSecondArgumentAction()); } PolymorphicAction ReturnZeroFromNullaryFunction() { return MakePolymorphicAction(ReturnZeroFromNullaryFunctionAction()); } // Tests that MakePolymorphicAction() turns a polymorphic action // implementation class into a polymorphic action. TEST(MakePolymorphicActionTest, ConstructsActionFromImpl) { Action a1 = ReturnSecondArgument(); // NOLINT EXPECT_EQ(5, a1.Perform(make_tuple(false, 5, 2.0))); } // Tests that MakePolymorphicAction() works when the implementation // class' Perform() method template has only one template parameter. TEST(MakePolymorphicActionTest, WorksWhenPerformHasOneTemplateParameter) { Action a1 = ReturnZeroFromNullaryFunction(); EXPECT_EQ(0, a1.Perform(make_tuple())); Action a2 = ReturnZeroFromNullaryFunction(); EXPECT_TRUE(a2.Perform(make_tuple()) == NULL); } // Tests that Return() works as an action for void-returning // functions. TEST(ReturnTest, WorksForVoid) { const Action ret = Return(); // NOLINT return ret.Perform(make_tuple(1)); } // Tests that Return(v) returns v. TEST(ReturnTest, ReturnsGivenValue) { Action ret = Return(1); // NOLINT EXPECT_EQ(1, ret.Perform(make_tuple())); ret = Return(-5); EXPECT_EQ(-5, ret.Perform(make_tuple())); } // Tests that Return("string literal") works. TEST(ReturnTest, AcceptsStringLiteral) { Action a1 = Return("Hello"); EXPECT_STREQ("Hello", a1.Perform(make_tuple())); Action a2 = Return("world"); EXPECT_EQ("world", a2.Perform(make_tuple())); } // Tests that Return(v) is covaraint. struct Base { bool operator==(const Base&) { return true; } }; struct Derived : public Base { bool operator==(const Derived&) { return true; } }; TEST(ReturnTest, IsCovariant) { Base base; Derived derived; Action ret = Return(&base); EXPECT_EQ(&base, ret.Perform(make_tuple())); ret = Return(&derived); EXPECT_EQ(&derived, ret.Perform(make_tuple())); } // Tests that the type of the value passed into Return is converted into T // when the action is cast to Action rather than when the action is // performed. See comments on testing::internal::ReturnAction in // gmock-actions.h for more information. class FromType { public: FromType(bool* is_converted) : converted_(is_converted) {} bool* converted() const { return converted_; } private: bool* const converted_; GTEST_DISALLOW_ASSIGN_(FromType); }; class ToType { public: ToType(const FromType& x) { *x.converted() = true; } }; TEST(ReturnTest, ConvertsArgumentWhenConverted) { bool converted = false; FromType x(&converted); Action action(Return(x)); EXPECT_TRUE(converted) << "Return must convert its argument in its own " << "conversion operator."; converted = false; action.Perform(tuple<>()); EXPECT_FALSE(converted) << "Action must NOT convert its argument " << "when performed." ; } class DestinationType {}; class SourceType { public: // Note: a non-const typecast operator. operator DestinationType() { return DestinationType(); } }; TEST(ReturnTest, CanConvertArgumentUsingNonConstTypeCastOperator) { SourceType s; Action action(Return(s)); } // Tests that ReturnNull() returns NULL in a pointer-returning function. TEST(ReturnNullTest, WorksInPointerReturningFunction) { const Action a1 = ReturnNull(); EXPECT_TRUE(a1.Perform(make_tuple()) == NULL); const Action a2 = ReturnNull(); // NOLINT EXPECT_TRUE(a2.Perform(make_tuple(true)) == NULL); } // Tests that ReturnRef(v) works for reference types. TEST(ReturnRefTest, WorksForReference) { const int n = 0; const Action ret = ReturnRef(n); // NOLINT EXPECT_EQ(&n, &ret.Perform(make_tuple(true))); } // Tests that ReturnRef(v) is covariant. TEST(ReturnRefTest, IsCovariant) { Base base; Derived derived; Action a = ReturnRef(base); EXPECT_EQ(&base, &a.Perform(make_tuple())); a = ReturnRef(derived); EXPECT_EQ(&derived, &a.Perform(make_tuple())); } // Tests that ReturnRefOfCopy(v) works for reference types. TEST(ReturnRefOfCopyTest, WorksForReference) { int n = 42; const Action ret = ReturnRefOfCopy(n); EXPECT_NE(&n, &ret.Perform(make_tuple())); EXPECT_EQ(42, ret.Perform(make_tuple())); n = 43; EXPECT_NE(&n, &ret.Perform(make_tuple())); EXPECT_EQ(42, ret.Perform(make_tuple())); } // Tests that ReturnRefOfCopy(v) is covariant. TEST(ReturnRefOfCopyTest, IsCovariant) { Base base; Derived derived; Action a = ReturnRefOfCopy(base); EXPECT_NE(&base, &a.Perform(make_tuple())); a = ReturnRefOfCopy(derived); EXPECT_NE(&derived, &a.Perform(make_tuple())); } // Tests that DoDefault() does the default action for the mock method. class MyClass {}; class MockClass { public: MockClass() {} MOCK_METHOD1(IntFunc, int(bool flag)); // NOLINT MOCK_METHOD0(Foo, MyClass()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockClass); }; // Tests that DoDefault() returns the built-in default value for the // return type by default. TEST(DoDefaultTest, ReturnsBuiltInDefaultValueByDefault) { MockClass mock; EXPECT_CALL(mock, IntFunc(_)) .WillOnce(DoDefault()); EXPECT_EQ(0, mock.IntFunc(true)); } // Tests that DoDefault() aborts the process when there is no built-in // default value for the return type. TEST(DoDefaultDeathTest, DiesForUnknowType) { MockClass mock; EXPECT_CALL(mock, Foo()) .WillRepeatedly(DoDefault()); EXPECT_DEATH_IF_SUPPORTED({ mock.Foo(); }, ""); } // Tests that using DoDefault() inside a composite action leads to a // run-time error. void VoidFunc(bool /* flag */) {} TEST(DoDefaultDeathTest, DiesIfUsedInCompositeAction) { MockClass mock; EXPECT_CALL(mock, IntFunc(_)) .WillRepeatedly(DoAll(Invoke(VoidFunc), DoDefault())); // Ideally we should verify the error message as well. Sadly, // EXPECT_DEATH() can only capture stderr, while Google Mock's // errors are printed on stdout. Therefore we have to settle for // not verifying the message. EXPECT_DEATH_IF_SUPPORTED({ mock.IntFunc(true); }, ""); } // Tests that DoDefault() returns the default value set by // DefaultValue::Set() when it's not overriden by an ON_CALL(). TEST(DoDefaultTest, ReturnsUserSpecifiedPerTypeDefaultValueWhenThereIsOne) { DefaultValue::Set(1); MockClass mock; EXPECT_CALL(mock, IntFunc(_)) .WillOnce(DoDefault()); EXPECT_EQ(1, mock.IntFunc(false)); DefaultValue::Clear(); } // Tests that DoDefault() does the action specified by ON_CALL(). TEST(DoDefaultTest, DoesWhatOnCallSpecifies) { MockClass mock; ON_CALL(mock, IntFunc(_)) .WillByDefault(Return(2)); EXPECT_CALL(mock, IntFunc(_)) .WillOnce(DoDefault()); EXPECT_EQ(2, mock.IntFunc(false)); } // Tests that using DoDefault() in ON_CALL() leads to a run-time failure. TEST(DoDefaultTest, CannotBeUsedInOnCall) { MockClass mock; EXPECT_NONFATAL_FAILURE({ // NOLINT ON_CALL(mock, IntFunc(_)) .WillByDefault(DoDefault()); }, "DoDefault() cannot be used in ON_CALL()"); } // Tests that SetArgPointee(v) sets the variable pointed to by // the N-th (0-based) argument to v. TEST(SetArgPointeeTest, SetsTheNthPointee) { typedef void MyFunction(bool, int*, char*); Action a = SetArgPointee<1>(2); int n = 0; char ch = '\0'; a.Perform(make_tuple(true, &n, &ch)); EXPECT_EQ(2, n); EXPECT_EQ('\0', ch); a = SetArgPointee<2>('a'); n = 0; ch = '\0'; a.Perform(make_tuple(true, &n, &ch)); EXPECT_EQ(0, n); EXPECT_EQ('a', ch); } #if !((GTEST_GCC_VER_ && GTEST_GCC_VER_ < 40000) || GTEST_OS_SYMBIAN) // Tests that SetArgPointee() accepts a string literal. // GCC prior to v4.0 and the Symbian compiler do not support this. TEST(SetArgPointeeTest, AcceptsStringLiteral) { typedef void MyFunction(std::string*, const char**); Action a = SetArgPointee<0>("hi"); std::string str; const char* ptr = NULL; a.Perform(make_tuple(&str, &ptr)); EXPECT_EQ("hi", str); EXPECT_TRUE(ptr == NULL); a = SetArgPointee<1>("world"); str = ""; a.Perform(make_tuple(&str, &ptr)); EXPECT_EQ("", str); EXPECT_STREQ("world", ptr); } TEST(SetArgPointeeTest, AcceptsWideStringLiteral) { typedef void MyFunction(const wchar_t**); Action a = SetArgPointee<0>(L"world"); const wchar_t* ptr = NULL; a.Perform(make_tuple(&ptr)); EXPECT_STREQ(L"world", ptr); # if GTEST_HAS_STD_WSTRING typedef void MyStringFunction(std::wstring*); Action a2 = SetArgPointee<0>(L"world"); std::wstring str = L""; a2.Perform(make_tuple(&str)); EXPECT_EQ(L"world", str); # endif } #endif // Tests that SetArgPointee() accepts a char pointer. TEST(SetArgPointeeTest, AcceptsCharPointer) { typedef void MyFunction(bool, std::string*, const char**); const char* const hi = "hi"; Action a = SetArgPointee<1>(hi); std::string str; const char* ptr = NULL; a.Perform(make_tuple(true, &str, &ptr)); EXPECT_EQ("hi", str); EXPECT_TRUE(ptr == NULL); char world_array[] = "world"; char* const world = world_array; a = SetArgPointee<2>(world); str = ""; a.Perform(make_tuple(true, &str, &ptr)); EXPECT_EQ("", str); EXPECT_EQ(world, ptr); } TEST(SetArgPointeeTest, AcceptsWideCharPointer) { typedef void MyFunction(bool, const wchar_t**); const wchar_t* const hi = L"hi"; Action a = SetArgPointee<1>(hi); const wchar_t* ptr = NULL; a.Perform(make_tuple(true, &ptr)); EXPECT_EQ(hi, ptr); # if GTEST_HAS_STD_WSTRING typedef void MyStringFunction(bool, std::wstring*); wchar_t world_array[] = L"world"; wchar_t* const world = world_array; Action a2 = SetArgPointee<1>(world); std::wstring str; a2.Perform(make_tuple(true, &str)); EXPECT_EQ(world_array, str); # endif } #if GTEST_HAS_PROTOBUF_ // Tests that SetArgPointee(proto_buffer) sets the v1 protobuf // variable pointed to by the N-th (0-based) argument to proto_buffer. TEST(SetArgPointeeTest, SetsTheNthPointeeOfProtoBufferType) { TestMessage* const msg = new TestMessage; msg->set_member("yes"); TestMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgPointee<1>(*msg); // SetArgPointee(proto_buffer) makes a copy of proto_buffer // s.t. the action works even when the original proto_buffer has // died. We ensure this behavior by deleting msg before using the // action. delete msg; TestMessage dest; EXPECT_FALSE(orig_msg.Equals(dest)); a.Perform(make_tuple(true, &dest)); EXPECT_TRUE(orig_msg.Equals(dest)); } // Tests that SetArgPointee(proto_buffer) sets the // ::ProtocolMessage variable pointed to by the N-th (0-based) // argument to proto_buffer. TEST(SetArgPointeeTest, SetsTheNthPointeeOfProtoBufferBaseType) { TestMessage* const msg = new TestMessage; msg->set_member("yes"); TestMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgPointee<1>(*msg); // SetArgPointee(proto_buffer) makes a copy of proto_buffer // s.t. the action works even when the original proto_buffer has // died. We ensure this behavior by deleting msg before using the // action. delete msg; TestMessage dest; ::ProtocolMessage* const dest_base = &dest; EXPECT_FALSE(orig_msg.Equals(dest)); a.Perform(make_tuple(true, dest_base)); EXPECT_TRUE(orig_msg.Equals(dest)); } // Tests that SetArgPointee(proto2_buffer) sets the v2 // protobuf variable pointed to by the N-th (0-based) argument to // proto2_buffer. TEST(SetArgPointeeTest, SetsTheNthPointeeOfProto2BufferType) { using testing::internal::FooMessage; FooMessage* const msg = new FooMessage; msg->set_int_field(2); msg->set_string_field("hi"); FooMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgPointee<1>(*msg); // SetArgPointee(proto2_buffer) makes a copy of // proto2_buffer s.t. the action works even when the original // proto2_buffer has died. We ensure this behavior by deleting msg // before using the action. delete msg; FooMessage dest; dest.set_int_field(0); a.Perform(make_tuple(true, &dest)); EXPECT_EQ(2, dest.int_field()); EXPECT_EQ("hi", dest.string_field()); } // Tests that SetArgPointee(proto2_buffer) sets the // proto2::Message variable pointed to by the N-th (0-based) argument // to proto2_buffer. TEST(SetArgPointeeTest, SetsTheNthPointeeOfProto2BufferBaseType) { using testing::internal::FooMessage; FooMessage* const msg = new FooMessage; msg->set_int_field(2); msg->set_string_field("hi"); FooMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgPointee<1>(*msg); // SetArgPointee(proto2_buffer) makes a copy of // proto2_buffer s.t. the action works even when the original // proto2_buffer has died. We ensure this behavior by deleting msg // before using the action. delete msg; FooMessage dest; dest.set_int_field(0); ::proto2::Message* const dest_base = &dest; a.Perform(make_tuple(true, dest_base)); EXPECT_EQ(2, dest.int_field()); EXPECT_EQ("hi", dest.string_field()); } #endif // GTEST_HAS_PROTOBUF_ // Tests that SetArgumentPointee(v) sets the variable pointed to by // the N-th (0-based) argument to v. TEST(SetArgumentPointeeTest, SetsTheNthPointee) { typedef void MyFunction(bool, int*, char*); Action a = SetArgumentPointee<1>(2); int n = 0; char ch = '\0'; a.Perform(make_tuple(true, &n, &ch)); EXPECT_EQ(2, n); EXPECT_EQ('\0', ch); a = SetArgumentPointee<2>('a'); n = 0; ch = '\0'; a.Perform(make_tuple(true, &n, &ch)); EXPECT_EQ(0, n); EXPECT_EQ('a', ch); } #if GTEST_HAS_PROTOBUF_ // Tests that SetArgumentPointee(proto_buffer) sets the v1 protobuf // variable pointed to by the N-th (0-based) argument to proto_buffer. TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProtoBufferType) { TestMessage* const msg = new TestMessage; msg->set_member("yes"); TestMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgumentPointee<1>(*msg); // SetArgumentPointee(proto_buffer) makes a copy of proto_buffer // s.t. the action works even when the original proto_buffer has // died. We ensure this behavior by deleting msg before using the // action. delete msg; TestMessage dest; EXPECT_FALSE(orig_msg.Equals(dest)); a.Perform(make_tuple(true, &dest)); EXPECT_TRUE(orig_msg.Equals(dest)); } // Tests that SetArgumentPointee(proto_buffer) sets the // ::ProtocolMessage variable pointed to by the N-th (0-based) // argument to proto_buffer. TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProtoBufferBaseType) { TestMessage* const msg = new TestMessage; msg->set_member("yes"); TestMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgumentPointee<1>(*msg); // SetArgumentPointee(proto_buffer) makes a copy of proto_buffer // s.t. the action works even when the original proto_buffer has // died. We ensure this behavior by deleting msg before using the // action. delete msg; TestMessage dest; ::ProtocolMessage* const dest_base = &dest; EXPECT_FALSE(orig_msg.Equals(dest)); a.Perform(make_tuple(true, dest_base)); EXPECT_TRUE(orig_msg.Equals(dest)); } // Tests that SetArgumentPointee(proto2_buffer) sets the v2 // protobuf variable pointed to by the N-th (0-based) argument to // proto2_buffer. TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProto2BufferType) { using testing::internal::FooMessage; FooMessage* const msg = new FooMessage; msg->set_int_field(2); msg->set_string_field("hi"); FooMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgumentPointee<1>(*msg); // SetArgumentPointee(proto2_buffer) makes a copy of // proto2_buffer s.t. the action works even when the original // proto2_buffer has died. We ensure this behavior by deleting msg // before using the action. delete msg; FooMessage dest; dest.set_int_field(0); a.Perform(make_tuple(true, &dest)); EXPECT_EQ(2, dest.int_field()); EXPECT_EQ("hi", dest.string_field()); } // Tests that SetArgumentPointee(proto2_buffer) sets the // proto2::Message variable pointed to by the N-th (0-based) argument // to proto2_buffer. TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProto2BufferBaseType) { using testing::internal::FooMessage; FooMessage* const msg = new FooMessage; msg->set_int_field(2); msg->set_string_field("hi"); FooMessage orig_msg; orig_msg.CopyFrom(*msg); Action a = SetArgumentPointee<1>(*msg); // SetArgumentPointee(proto2_buffer) makes a copy of // proto2_buffer s.t. the action works even when the original // proto2_buffer has died. We ensure this behavior by deleting msg // before using the action. delete msg; FooMessage dest; dest.set_int_field(0); ::proto2::Message* const dest_base = &dest; a.Perform(make_tuple(true, dest_base)); EXPECT_EQ(2, dest.int_field()); EXPECT_EQ("hi", dest.string_field()); } #endif // GTEST_HAS_PROTOBUF_ // Sample functions and functors for testing Invoke() and etc. int Nullary() { return 1; } class NullaryFunctor { public: int operator()() { return 2; } }; bool g_done = false; void VoidNullary() { g_done = true; } class VoidNullaryFunctor { public: void operator()() { g_done = true; } }; bool Unary(int x) { return x < 0; } const char* Plus1(const char* s) { return s + 1; } void VoidUnary(int /* n */) { g_done = true; } bool ByConstRef(const std::string& s) { return s == "Hi"; } const double g_double = 0; bool ReferencesGlobalDouble(const double& x) { return &x == &g_double; } std::string ByNonConstRef(std::string& s) { return s += "+"; } // NOLINT struct UnaryFunctor { int operator()(bool x) { return x ? 1 : -1; } }; const char* Binary(const char* input, short n) { return input + n; } // NOLINT void VoidBinary(int, char) { g_done = true; } int Ternary(int x, char y, short z) { return x + y + z; } // NOLINT void VoidTernary(int, char, bool) { g_done = true; } int SumOf4(int a, int b, int c, int d) { return a + b + c + d; } void VoidFunctionWithFourArguments(char, int, float, double) { g_done = true; } int SumOf5(int a, int b, int c, int d, int e) { return a + b + c + d + e; } struct SumOf5Functor { int operator()(int a, int b, int c, int d, int e) { return a + b + c + d + e; } }; int SumOf6(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } struct SumOf6Functor { int operator()(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } }; class Foo { public: Foo() : value_(123) {} int Nullary() const { return value_; } short Unary(long x) { return static_cast(value_ + x); } // NOLINT std::string Binary(const std::string& str, char c) const { return str + c; } int Ternary(int x, bool y, char z) { return value_ + x + y*z; } int SumOf4(int a, int b, int c, int d) const { return a + b + c + d + value_; } int SumOf5(int a, int b, int c, int d, int e) { return a + b + c + d + e; } int SumOf6(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } private: int value_; }; // Tests InvokeWithoutArgs(function). TEST(InvokeWithoutArgsTest, Function) { // As an action that takes one argument. Action a = InvokeWithoutArgs(Nullary); // NOLINT EXPECT_EQ(1, a.Perform(make_tuple(2))); // As an action that takes two arguments. Action a2 = InvokeWithoutArgs(Nullary); // NOLINT EXPECT_EQ(1, a2.Perform(make_tuple(2, 3.5))); // As an action that returns void. Action a3 = InvokeWithoutArgs(VoidNullary); // NOLINT g_done = false; a3.Perform(make_tuple(1)); EXPECT_TRUE(g_done); } // Tests InvokeWithoutArgs(functor). TEST(InvokeWithoutArgsTest, Functor) { // As an action that takes no argument. Action a = InvokeWithoutArgs(NullaryFunctor()); // NOLINT EXPECT_EQ(2, a.Perform(make_tuple())); // As an action that takes three arguments. Action a2 = // NOLINT InvokeWithoutArgs(NullaryFunctor()); EXPECT_EQ(2, a2.Perform(make_tuple(3, 3.5, 'a'))); // As an action that returns void. Action a3 = InvokeWithoutArgs(VoidNullaryFunctor()); g_done = false; a3.Perform(make_tuple()); EXPECT_TRUE(g_done); } // Tests InvokeWithoutArgs(obj_ptr, method). TEST(InvokeWithoutArgsTest, Method) { Foo foo; Action a = // NOLINT InvokeWithoutArgs(&foo, &Foo::Nullary); EXPECT_EQ(123, a.Perform(make_tuple(true, 'a'))); } // Tests using IgnoreResult() on a polymorphic action. TEST(IgnoreResultTest, PolymorphicAction) { Action a = IgnoreResult(Return(5)); // NOLINT a.Perform(make_tuple(1)); } // Tests using IgnoreResult() on a monomorphic action. int ReturnOne() { g_done = true; return 1; } TEST(IgnoreResultTest, MonomorphicAction) { g_done = false; Action a = IgnoreResult(Invoke(ReturnOne)); a.Perform(make_tuple()); EXPECT_TRUE(g_done); } // Tests using IgnoreResult() on an action that returns a class type. MyClass ReturnMyClass(double /* x */) { g_done = true; return MyClass(); } TEST(IgnoreResultTest, ActionReturningClass) { g_done = false; Action a = IgnoreResult(Invoke(ReturnMyClass)); // NOLINT a.Perform(make_tuple(2)); EXPECT_TRUE(g_done); } TEST(AssignTest, Int) { int x = 0; Action a = Assign(&x, 5); a.Perform(make_tuple(0)); EXPECT_EQ(5, x); } TEST(AssignTest, String) { ::std::string x; Action a = Assign(&x, "Hello, world"); a.Perform(make_tuple()); EXPECT_EQ("Hello, world", x); } TEST(AssignTest, CompatibleTypes) { double x = 0; Action a = Assign(&x, 5); a.Perform(make_tuple(0)); EXPECT_DOUBLE_EQ(5, x); } #if !GTEST_OS_WINDOWS_MOBILE class SetErrnoAndReturnTest : public testing::Test { protected: virtual void SetUp() { errno = 0; } virtual void TearDown() { errno = 0; } }; TEST_F(SetErrnoAndReturnTest, Int) { Action a = SetErrnoAndReturn(ENOTTY, -5); EXPECT_EQ(-5, a.Perform(make_tuple())); EXPECT_EQ(ENOTTY, errno); } TEST_F(SetErrnoAndReturnTest, Ptr) { int x; Action a = SetErrnoAndReturn(ENOTTY, &x); EXPECT_EQ(&x, a.Perform(make_tuple())); EXPECT_EQ(ENOTTY, errno); } TEST_F(SetErrnoAndReturnTest, CompatibleTypes) { Action a = SetErrnoAndReturn(EINVAL, 5); EXPECT_DOUBLE_EQ(5.0, a.Perform(make_tuple())); EXPECT_EQ(EINVAL, errno); } #endif // !GTEST_OS_WINDOWS_MOBILE // Tests ByRef(). // Tests that ReferenceWrapper is copyable. TEST(ByRefTest, IsCopyable) { const std::string s1 = "Hi"; const std::string s2 = "Hello"; ::testing::internal::ReferenceWrapper ref_wrapper = ByRef(s1); const std::string& r1 = ref_wrapper; EXPECT_EQ(&s1, &r1); // Assigns a new value to ref_wrapper. ref_wrapper = ByRef(s2); const std::string& r2 = ref_wrapper; EXPECT_EQ(&s2, &r2); ::testing::internal::ReferenceWrapper ref_wrapper1 = ByRef(s1); // Copies ref_wrapper1 to ref_wrapper. ref_wrapper = ref_wrapper1; const std::string& r3 = ref_wrapper; EXPECT_EQ(&s1, &r3); } // Tests using ByRef() on a const value. TEST(ByRefTest, ConstValue) { const int n = 0; // int& ref = ByRef(n); // This shouldn't compile - we have a // negative compilation test to catch it. const int& const_ref = ByRef(n); EXPECT_EQ(&n, &const_ref); } // Tests using ByRef() on a non-const value. TEST(ByRefTest, NonConstValue) { int n = 0; // ByRef(n) can be used as either an int&, int& ref = ByRef(n); EXPECT_EQ(&n, &ref); // or a const int&. const int& const_ref = ByRef(n); EXPECT_EQ(&n, &const_ref); } // Tests explicitly specifying the type when using ByRef(). TEST(ByRefTest, ExplicitType) { int n = 0; const int& r1 = ByRef(n); EXPECT_EQ(&n, &r1); // ByRef(n); // This shouldn't compile - we have a negative // compilation test to catch it. Derived d; Derived& r2 = ByRef(d); EXPECT_EQ(&d, &r2); const Derived& r3 = ByRef(d); EXPECT_EQ(&d, &r3); Base& r4 = ByRef(d); EXPECT_EQ(&d, &r4); const Base& r5 = ByRef(d); EXPECT_EQ(&d, &r5); // The following shouldn't compile - we have a negative compilation // test for it. // // Base b; // ByRef(b); } // Tests that Google Mock prints expression ByRef(x) as a reference to x. TEST(ByRefTest, PrintsCorrectly) { int n = 42; ::std::stringstream expected, actual; testing::internal::UniversalPrinter::Print(n, &expected); testing::internal::UniversalPrint(ByRef(n), &actual); EXPECT_EQ(expected.str(), actual.str()); } } // Unnamed namespace synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-cardinalities_test.cc0000600000175000017500000003004711561126632025654 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the built-in cardinalities. #include "gmock/gmock.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" namespace { using std::stringstream; using testing::AnyNumber; using testing::AtLeast; using testing::AtMost; using testing::Between; using testing::Cardinality; using testing::CardinalityInterface; using testing::Exactly; using testing::IsSubstring; using testing::MakeCardinality; class MockFoo { public: MockFoo() {} MOCK_METHOD0(Bar, int()); // NOLINT private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); }; // Tests that Cardinality objects can be default constructed. TEST(CardinalityTest, IsDefaultConstructable) { Cardinality c; } // Tests that Cardinality objects are copyable. TEST(CardinalityTest, IsCopyable) { // Tests the copy constructor. Cardinality c = Exactly(1); EXPECT_FALSE(c.IsSatisfiedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(1)); EXPECT_TRUE(c.IsSaturatedByCallCount(1)); // Tests the assignment operator. c = Exactly(2); EXPECT_FALSE(c.IsSatisfiedByCallCount(1)); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_TRUE(c.IsSaturatedByCallCount(2)); } TEST(CardinalityTest, IsOverSaturatedByCallCountWorks) { const Cardinality c = AtMost(5); EXPECT_FALSE(c.IsOverSaturatedByCallCount(4)); EXPECT_FALSE(c.IsOverSaturatedByCallCount(5)); EXPECT_TRUE(c.IsOverSaturatedByCallCount(6)); } // Tests that Cardinality::DescribeActualCallCountTo() creates the // correct description. TEST(CardinalityTest, CanDescribeActualCallCount) { stringstream ss0; Cardinality::DescribeActualCallCountTo(0, &ss0); EXPECT_EQ("never called", ss0.str()); stringstream ss1; Cardinality::DescribeActualCallCountTo(1, &ss1); EXPECT_EQ("called once", ss1.str()); stringstream ss2; Cardinality::DescribeActualCallCountTo(2, &ss2); EXPECT_EQ("called twice", ss2.str()); stringstream ss3; Cardinality::DescribeActualCallCountTo(3, &ss3); EXPECT_EQ("called 3 times", ss3.str()); } // Tests AnyNumber() TEST(AnyNumber, Works) { const Cardinality c = AnyNumber(); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(1)); EXPECT_FALSE(c.IsSaturatedByCallCount(1)); EXPECT_TRUE(c.IsSatisfiedByCallCount(9)); EXPECT_FALSE(c.IsSaturatedByCallCount(9)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "called any number of times", ss.str()); } TEST(AnyNumberTest, HasCorrectBounds) { const Cardinality c = AnyNumber(); EXPECT_EQ(0, c.ConservativeLowerBound()); EXPECT_EQ(INT_MAX, c.ConservativeUpperBound()); } // Tests AtLeast(n). TEST(AtLeastTest, OnNegativeNumber) { EXPECT_NONFATAL_FAILURE({ // NOLINT AtLeast(-1); }, "The invocation lower bound must be >= 0"); } TEST(AtLeastTest, OnZero) { const Cardinality c = AtLeast(0); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(1)); EXPECT_FALSE(c.IsSaturatedByCallCount(1)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "any number of times", ss.str()); } TEST(AtLeastTest, OnPositiveNumber) { const Cardinality c = AtLeast(2); EXPECT_FALSE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_FALSE(c.IsSatisfiedByCallCount(1)); EXPECT_FALSE(c.IsSaturatedByCallCount(1)); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_FALSE(c.IsSaturatedByCallCount(2)); stringstream ss1; AtLeast(1).DescribeTo(&ss1); EXPECT_PRED_FORMAT2(IsSubstring, "at least once", ss1.str()); stringstream ss2; c.DescribeTo(&ss2); EXPECT_PRED_FORMAT2(IsSubstring, "at least twice", ss2.str()); stringstream ss3; AtLeast(3).DescribeTo(&ss3); EXPECT_PRED_FORMAT2(IsSubstring, "at least 3 times", ss3.str()); } TEST(AtLeastTest, HasCorrectBounds) { const Cardinality c = AtLeast(2); EXPECT_EQ(2, c.ConservativeLowerBound()); EXPECT_EQ(INT_MAX, c.ConservativeUpperBound()); } // Tests AtMost(n). TEST(AtMostTest, OnNegativeNumber) { EXPECT_NONFATAL_FAILURE({ // NOLINT AtMost(-1); }, "The invocation upper bound must be >= 0"); } TEST(AtMostTest, OnZero) { const Cardinality c = AtMost(0); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_TRUE(c.IsSaturatedByCallCount(0)); EXPECT_FALSE(c.IsSatisfiedByCallCount(1)); EXPECT_TRUE(c.IsSaturatedByCallCount(1)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "never called", ss.str()); } TEST(AtMostTest, OnPositiveNumber) { const Cardinality c = AtMost(2); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(1)); EXPECT_FALSE(c.IsSaturatedByCallCount(1)); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_TRUE(c.IsSaturatedByCallCount(2)); stringstream ss1; AtMost(1).DescribeTo(&ss1); EXPECT_PRED_FORMAT2(IsSubstring, "called at most once", ss1.str()); stringstream ss2; c.DescribeTo(&ss2); EXPECT_PRED_FORMAT2(IsSubstring, "called at most twice", ss2.str()); stringstream ss3; AtMost(3).DescribeTo(&ss3); EXPECT_PRED_FORMAT2(IsSubstring, "called at most 3 times", ss3.str()); } TEST(AtMostTest, HasCorrectBounds) { const Cardinality c = AtMost(2); EXPECT_EQ(0, c.ConservativeLowerBound()); EXPECT_EQ(2, c.ConservativeUpperBound()); } // Tests Between(m, n). TEST(BetweenTest, OnNegativeStart) { EXPECT_NONFATAL_FAILURE({ // NOLINT Between(-1, 2); }, "The invocation lower bound must be >= 0, but is actually -1"); } TEST(BetweenTest, OnNegativeEnd) { EXPECT_NONFATAL_FAILURE({ // NOLINT Between(1, -2); }, "The invocation upper bound must be >= 0, but is actually -2"); } TEST(BetweenTest, OnStartBiggerThanEnd) { EXPECT_NONFATAL_FAILURE({ // NOLINT Between(2, 1); }, "The invocation upper bound (1) must be >= " "the invocation lower bound (2)"); } TEST(BetweenTest, OnZeroStartAndZeroEnd) { const Cardinality c = Between(0, 0); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_TRUE(c.IsSaturatedByCallCount(0)); EXPECT_FALSE(c.IsSatisfiedByCallCount(1)); EXPECT_TRUE(c.IsSaturatedByCallCount(1)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "never called", ss.str()); } TEST(BetweenTest, OnZeroStartAndNonZeroEnd) { const Cardinality c = Between(0, 2); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_TRUE(c.IsSaturatedByCallCount(2)); EXPECT_FALSE(c.IsSatisfiedByCallCount(4)); EXPECT_TRUE(c.IsSaturatedByCallCount(4)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "called at most twice", ss.str()); } TEST(BetweenTest, OnSameStartAndEnd) { const Cardinality c = Between(3, 3); EXPECT_FALSE(c.IsSatisfiedByCallCount(2)); EXPECT_FALSE(c.IsSaturatedByCallCount(2)); EXPECT_TRUE(c.IsSatisfiedByCallCount(3)); EXPECT_TRUE(c.IsSaturatedByCallCount(3)); EXPECT_FALSE(c.IsSatisfiedByCallCount(4)); EXPECT_TRUE(c.IsSaturatedByCallCount(4)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "called 3 times", ss.str()); } TEST(BetweenTest, OnDifferentStartAndEnd) { const Cardinality c = Between(3, 5); EXPECT_FALSE(c.IsSatisfiedByCallCount(2)); EXPECT_FALSE(c.IsSaturatedByCallCount(2)); EXPECT_TRUE(c.IsSatisfiedByCallCount(3)); EXPECT_FALSE(c.IsSaturatedByCallCount(3)); EXPECT_TRUE(c.IsSatisfiedByCallCount(5)); EXPECT_TRUE(c.IsSaturatedByCallCount(5)); EXPECT_FALSE(c.IsSatisfiedByCallCount(6)); EXPECT_TRUE(c.IsSaturatedByCallCount(6)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "called between 3 and 5 times", ss.str()); } TEST(BetweenTest, HasCorrectBounds) { const Cardinality c = Between(3, 5); EXPECT_EQ(3, c.ConservativeLowerBound()); EXPECT_EQ(5, c.ConservativeUpperBound()); } // Tests Exactly(n). TEST(ExactlyTest, OnNegativeNumber) { EXPECT_NONFATAL_FAILURE({ // NOLINT Exactly(-1); }, "The invocation lower bound must be >= 0"); } TEST(ExactlyTest, OnZero) { const Cardinality c = Exactly(0); EXPECT_TRUE(c.IsSatisfiedByCallCount(0)); EXPECT_TRUE(c.IsSaturatedByCallCount(0)); EXPECT_FALSE(c.IsSatisfiedByCallCount(1)); EXPECT_TRUE(c.IsSaturatedByCallCount(1)); stringstream ss; c.DescribeTo(&ss); EXPECT_PRED_FORMAT2(IsSubstring, "never called", ss.str()); } TEST(ExactlyTest, OnPositiveNumber) { const Cardinality c = Exactly(2); EXPECT_FALSE(c.IsSatisfiedByCallCount(0)); EXPECT_FALSE(c.IsSaturatedByCallCount(0)); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_TRUE(c.IsSaturatedByCallCount(2)); stringstream ss1; Exactly(1).DescribeTo(&ss1); EXPECT_PRED_FORMAT2(IsSubstring, "called once", ss1.str()); stringstream ss2; c.DescribeTo(&ss2); EXPECT_PRED_FORMAT2(IsSubstring, "called twice", ss2.str()); stringstream ss3; Exactly(3).DescribeTo(&ss3); EXPECT_PRED_FORMAT2(IsSubstring, "called 3 times", ss3.str()); } TEST(ExactlyTest, HasCorrectBounds) { const Cardinality c = Exactly(3); EXPECT_EQ(3, c.ConservativeLowerBound()); EXPECT_EQ(3, c.ConservativeUpperBound()); } // Tests that a user can make his own cardinality by implementing // CardinalityInterface and calling MakeCardinality(). class EvenCardinality : public CardinalityInterface { public: // Returns true iff call_count calls will satisfy this cardinality. virtual bool IsSatisfiedByCallCount(int call_count) const { return (call_count % 2 == 0); } // Returns true iff call_count calls will saturate this cardinality. virtual bool IsSaturatedByCallCount(int /* call_count */) const { return false; } // Describes self to an ostream. virtual void DescribeTo(::std::ostream* ss) const { *ss << "called even number of times"; } }; TEST(MakeCardinalityTest, ConstructsCardinalityFromInterface) { const Cardinality c = MakeCardinality(new EvenCardinality); EXPECT_TRUE(c.IsSatisfiedByCallCount(2)); EXPECT_FALSE(c.IsSatisfiedByCallCount(3)); EXPECT_FALSE(c.IsSaturatedByCallCount(10000)); stringstream ss; c.DescribeTo(&ss); EXPECT_EQ("called even number of times", ss.str()); } } // Unnamed namespace synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-generated-actions_test.cc0000600000175000017500000011733211561126632026440 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the built-in actions generated by a script. #include "gmock/gmock-generated-actions.h" #include #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" namespace testing { namespace gmock_generated_actions_test { using ::std::plus; using ::std::string; using ::std::tr1::get; using ::std::tr1::make_tuple; using ::std::tr1::tuple; using ::std::tr1::tuple_element; using testing::_; using testing::Action; using testing::ActionInterface; using testing::ByRef; using testing::DoAll; using testing::Invoke; using testing::Return; using testing::ReturnNew; using testing::SetArgPointee; using testing::StaticAssertTypeEq; using testing::Unused; using testing::WithArgs; // For suppressing compiler warnings on conversion possibly losing precision. inline short Short(short n) { return n; } // NOLINT inline char Char(char ch) { return ch; } // Sample functions and functors for testing various actions. int Nullary() { return 1; } class NullaryFunctor { public: int operator()() { return 2; } }; bool g_done = false; bool Unary(int x) { return x < 0; } const char* Plus1(const char* s) { return s + 1; } bool ByConstRef(const string& s) { return s == "Hi"; } const double g_double = 0; bool ReferencesGlobalDouble(const double& x) { return &x == &g_double; } string ByNonConstRef(string& s) { return s += "+"; } // NOLINT struct UnaryFunctor { int operator()(bool x) { return x ? 1 : -1; } }; const char* Binary(const char* input, short n) { return input + n; } // NOLINT void VoidBinary(int, char) { g_done = true; } int Ternary(int x, char y, short z) { return x + y + z; } // NOLINT void VoidTernary(int, char, bool) { g_done = true; } int SumOf4(int a, int b, int c, int d) { return a + b + c + d; } string Concat4(const char* s1, const char* s2, const char* s3, const char* s4) { return string(s1) + s2 + s3 + s4; } int SumOf5(int a, int b, int c, int d, int e) { return a + b + c + d + e; } struct SumOf5Functor { int operator()(int a, int b, int c, int d, int e) { return a + b + c + d + e; } }; string Concat5(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5) { return string(s1) + s2 + s3 + s4 + s5; } int SumOf6(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } struct SumOf6Functor { int operator()(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } }; string Concat6(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6) { return string(s1) + s2 + s3 + s4 + s5 + s6; } string Concat7(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7; } string Concat8(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8; } string Concat9(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9; } string Concat10(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9, const char* s10) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9 + s10; } // A helper that turns the type of a C-string literal from const // char[N] to const char*. inline const char* CharPtr(const char* s) { return s; } // Tests InvokeArgument(...). // Tests using InvokeArgument with a nullary function. TEST(InvokeArgumentTest, Function0) { Action a = InvokeArgument<1>(); // NOLINT EXPECT_EQ(1, a.Perform(make_tuple(2, &Nullary))); } // Tests using InvokeArgument with a unary function. TEST(InvokeArgumentTest, Functor1) { Action a = InvokeArgument<0>(true); // NOLINT EXPECT_EQ(1, a.Perform(make_tuple(UnaryFunctor()))); } // Tests using InvokeArgument with a 5-ary function. TEST(InvokeArgumentTest, Function5) { Action a = // NOLINT InvokeArgument<0>(10000, 2000, 300, 40, 5); EXPECT_EQ(12345, a.Perform(make_tuple(&SumOf5))); } // Tests using InvokeArgument with a 5-ary functor. TEST(InvokeArgumentTest, Functor5) { Action a = // NOLINT InvokeArgument<0>(10000, 2000, 300, 40, 5); EXPECT_EQ(12345, a.Perform(make_tuple(SumOf5Functor()))); } // Tests using InvokeArgument with a 6-ary function. TEST(InvokeArgumentTest, Function6) { Action a = // NOLINT InvokeArgument<0>(100000, 20000, 3000, 400, 50, 6); EXPECT_EQ(123456, a.Perform(make_tuple(&SumOf6))); } // Tests using InvokeArgument with a 6-ary functor. TEST(InvokeArgumentTest, Functor6) { Action a = // NOLINT InvokeArgument<0>(100000, 20000, 3000, 400, 50, 6); EXPECT_EQ(123456, a.Perform(make_tuple(SumOf6Functor()))); } // Tests using InvokeArgument with a 7-ary function. TEST(InvokeArgumentTest, Function7) { Action a = InvokeArgument<0>("1", "2", "3", "4", "5", "6", "7"); EXPECT_EQ("1234567", a.Perform(make_tuple(&Concat7))); } // Tests using InvokeArgument with a 8-ary function. TEST(InvokeArgumentTest, Function8) { Action a = InvokeArgument<0>("1", "2", "3", "4", "5", "6", "7", "8"); EXPECT_EQ("12345678", a.Perform(make_tuple(&Concat8))); } // Tests using InvokeArgument with a 9-ary function. TEST(InvokeArgumentTest, Function9) { Action a = InvokeArgument<0>("1", "2", "3", "4", "5", "6", "7", "8", "9"); EXPECT_EQ("123456789", a.Perform(make_tuple(&Concat9))); } // Tests using InvokeArgument with a 10-ary function. TEST(InvokeArgumentTest, Function10) { Action a = InvokeArgument<0>("1", "2", "3", "4", "5", "6", "7", "8", "9", "0"); EXPECT_EQ("1234567890", a.Perform(make_tuple(&Concat10))); } // Tests using InvokeArgument with a function that takes a pointer argument. TEST(InvokeArgumentTest, ByPointerFunction) { Action a = // NOLINT InvokeArgument<0>(static_cast("Hi"), Short(1)); EXPECT_STREQ("i", a.Perform(make_tuple(&Binary))); } // Tests using InvokeArgument with a function that takes a const char* // by passing it a C-string literal. TEST(InvokeArgumentTest, FunctionWithCStringLiteral) { Action a = // NOLINT InvokeArgument<0>("Hi", Short(1)); EXPECT_STREQ("i", a.Perform(make_tuple(&Binary))); } // Tests using InvokeArgument with a function that takes a const reference. TEST(InvokeArgumentTest, ByConstReferenceFunction) { Action a = // NOLINT InvokeArgument<0>(string("Hi")); // When action 'a' is constructed, it makes a copy of the temporary // string object passed to it, so it's OK to use 'a' later, when the // temporary object has already died. EXPECT_TRUE(a.Perform(make_tuple(&ByConstRef))); } // Tests using InvokeArgument with ByRef() and a function that takes a // const reference. TEST(InvokeArgumentTest, ByExplicitConstReferenceFunction) { Action a = // NOLINT InvokeArgument<0>(ByRef(g_double)); // The above line calls ByRef() on a const value. EXPECT_TRUE(a.Perform(make_tuple(&ReferencesGlobalDouble))); double x = 0; a = InvokeArgument<0>(ByRef(x)); // This calls ByRef() on a non-const. EXPECT_FALSE(a.Perform(make_tuple(&ReferencesGlobalDouble))); } // Tests using WithArgs and with an action that takes 1 argument. TEST(WithArgsTest, OneArg) { Action a = WithArgs<1>(Invoke(Unary)); // NOLINT EXPECT_TRUE(a.Perform(make_tuple(1.5, -1))); EXPECT_FALSE(a.Perform(make_tuple(1.5, 1))); } // Tests using WithArgs with an action that takes 2 arguments. TEST(WithArgsTest, TwoArgs) { Action a = WithArgs<0, 2>(Invoke(Binary)); const char s[] = "Hello"; EXPECT_EQ(s + 2, a.Perform(make_tuple(CharPtr(s), 0.5, Short(2)))); } // Tests using WithArgs with an action that takes 3 arguments. TEST(WithArgsTest, ThreeArgs) { Action a = // NOLINT WithArgs<0, 2, 3>(Invoke(Ternary)); EXPECT_EQ(123, a.Perform(make_tuple(100, 6.5, Char(20), Short(3)))); } // Tests using WithArgs with an action that takes 4 arguments. TEST(WithArgsTest, FourArgs) { Action a = WithArgs<4, 3, 1, 0>(Invoke(Concat4)); EXPECT_EQ("4310", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), 2.5, CharPtr("3"), CharPtr("4")))); } // Tests using WithArgs with an action that takes 5 arguments. TEST(WithArgsTest, FiveArgs) { Action a = WithArgs<4, 3, 2, 1, 0>(Invoke(Concat5)); EXPECT_EQ("43210", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4")))); } // Tests using WithArgs with an action that takes 6 arguments. TEST(WithArgsTest, SixArgs) { Action a = WithArgs<0, 1, 2, 2, 1, 0>(Invoke(Concat6)); EXPECT_EQ("012210", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2")))); } // Tests using WithArgs with an action that takes 7 arguments. TEST(WithArgsTest, SevenArgs) { Action a = WithArgs<0, 1, 2, 3, 2, 1, 0>(Invoke(Concat7)); EXPECT_EQ("0123210", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2"), CharPtr("3")))); } // Tests using WithArgs with an action that takes 8 arguments. TEST(WithArgsTest, EightArgs) { Action a = WithArgs<0, 1, 2, 3, 0, 1, 2, 3>(Invoke(Concat8)); EXPECT_EQ("01230123", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2"), CharPtr("3")))); } // Tests using WithArgs with an action that takes 9 arguments. TEST(WithArgsTest, NineArgs) { Action a = WithArgs<0, 1, 2, 3, 1, 2, 3, 2, 3>(Invoke(Concat9)); EXPECT_EQ("012312323", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2"), CharPtr("3")))); } // Tests using WithArgs with an action that takes 10 arguments. TEST(WithArgsTest, TenArgs) { Action a = WithArgs<0, 1, 2, 3, 2, 1, 0, 1, 2, 3>(Invoke(Concat10)); EXPECT_EQ("0123210123", a.Perform(make_tuple(CharPtr("0"), CharPtr("1"), CharPtr("2"), CharPtr("3")))); } // Tests using WithArgs with an action that is not Invoke(). class SubstractAction : public ActionInterface { // NOLINT public: virtual int Perform(const tuple& args) { return get<0>(args) - get<1>(args); } }; TEST(WithArgsTest, NonInvokeAction) { Action a = // NOLINT WithArgs<2, 1>(MakeAction(new SubstractAction)); EXPECT_EQ(8, a.Perform(make_tuple(CharPtr("hi"), 2, 10))); } // Tests using WithArgs to pass all original arguments in the original order. TEST(WithArgsTest, Identity) { Action a = // NOLINT WithArgs<0, 1, 2>(Invoke(Ternary)); EXPECT_EQ(123, a.Perform(make_tuple(100, Char(20), Short(3)))); } // Tests using WithArgs with repeated arguments. TEST(WithArgsTest, RepeatedArguments) { Action a = // NOLINT WithArgs<1, 1, 1, 1>(Invoke(SumOf4)); EXPECT_EQ(4, a.Perform(make_tuple(false, 1, 10))); } // Tests using WithArgs with reversed argument order. TEST(WithArgsTest, ReversedArgumentOrder) { Action a = // NOLINT WithArgs<1, 0>(Invoke(Binary)); const char s[] = "Hello"; EXPECT_EQ(s + 2, a.Perform(make_tuple(Short(2), CharPtr(s)))); } // Tests using WithArgs with compatible, but not identical, argument types. TEST(WithArgsTest, ArgsOfCompatibleTypes) { Action a = // NOLINT WithArgs<0, 1, 3>(Invoke(Ternary)); EXPECT_EQ(123, a.Perform(make_tuple(Short(100), Char(20), 5.6, Char(3)))); } // Tests using WithArgs with an action that returns void. TEST(WithArgsTest, VoidAction) { Action a = WithArgs<2, 1>(Invoke(VoidBinary)); g_done = false; a.Perform(make_tuple(1.5, 'a', 3)); EXPECT_TRUE(g_done); } // Tests DoAll(a1, a2). TEST(DoAllTest, TwoActions) { int n = 0; Action a = DoAll(SetArgPointee<0>(1), // NOLINT Return(2)); EXPECT_EQ(2, a.Perform(make_tuple(&n))); EXPECT_EQ(1, n); } // Tests DoAll(a1, a2, a3). TEST(DoAllTest, ThreeActions) { int m = 0, n = 0; Action a = DoAll(SetArgPointee<0>(1), // NOLINT SetArgPointee<1>(2), Return(3)); EXPECT_EQ(3, a.Perform(make_tuple(&m, &n))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); } // Tests DoAll(a1, a2, a3, a4). TEST(DoAllTest, FourActions) { int m = 0, n = 0; char ch = '\0'; Action a = // NOLINT DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), Return(3)); EXPECT_EQ(3, a.Perform(make_tuple(&m, &n, &ch))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', ch); } // Tests DoAll(a1, a2, a3, a4, a5). TEST(DoAllTest, FiveActions) { int m = 0, n = 0; char a = '\0', b = '\0'; Action action = // NOLINT DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); } // Tests DoAll(a1, a2, ..., a6). TEST(DoAllTest, SixActions) { int m = 0, n = 0; char a = '\0', b = '\0', c = '\0'; Action action = // NOLINT DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), SetArgPointee<4>('c'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b, &c))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); EXPECT_EQ('c', c); } // Tests DoAll(a1, a2, ..., a7). TEST(DoAllTest, SevenActions) { int m = 0, n = 0; char a = '\0', b = '\0', c = '\0', d = '\0'; Action action = // NOLINT DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), SetArgPointee<4>('c'), SetArgPointee<5>('d'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b, &c, &d))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); EXPECT_EQ('c', c); EXPECT_EQ('d', d); } // Tests DoAll(a1, a2, ..., a8). TEST(DoAllTest, EightActions) { int m = 0, n = 0; char a = '\0', b = '\0', c = '\0', d = '\0', e = '\0'; Action action = DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), SetArgPointee<4>('c'), SetArgPointee<5>('d'), SetArgPointee<6>('e'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b, &c, &d, &e))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); EXPECT_EQ('c', c); EXPECT_EQ('d', d); EXPECT_EQ('e', e); } // Tests DoAll(a1, a2, ..., a9). TEST(DoAllTest, NineActions) { int m = 0, n = 0; char a = '\0', b = '\0', c = '\0', d = '\0', e = '\0', f = '\0'; Action action = DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), SetArgPointee<4>('c'), SetArgPointee<5>('d'), SetArgPointee<6>('e'), SetArgPointee<7>('f'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b, &c, &d, &e, &f))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); EXPECT_EQ('c', c); EXPECT_EQ('d', d); EXPECT_EQ('e', e); EXPECT_EQ('f', f); } // Tests DoAll(a1, a2, ..., a10). TEST(DoAllTest, TenActions) { int m = 0, n = 0; char a = '\0', b = '\0', c = '\0', d = '\0'; char e = '\0', f = '\0', g = '\0'; Action action = DoAll(SetArgPointee<0>(1), SetArgPointee<1>(2), SetArgPointee<2>('a'), SetArgPointee<3>('b'), SetArgPointee<4>('c'), SetArgPointee<5>('d'), SetArgPointee<6>('e'), SetArgPointee<7>('f'), SetArgPointee<8>('g'), Return(3)); EXPECT_EQ(3, action.Perform(make_tuple(&m, &n, &a, &b, &c, &d, &e, &f, &g))); EXPECT_EQ(1, m); EXPECT_EQ(2, n); EXPECT_EQ('a', a); EXPECT_EQ('b', b); EXPECT_EQ('c', c); EXPECT_EQ('d', d); EXPECT_EQ('e', e); EXPECT_EQ('f', f); EXPECT_EQ('g', g); } // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Tests the ACTION*() macro family. // Tests that ACTION() can define an action that doesn't reference the // mock function arguments. ACTION(Return5) { return 5; } TEST(ActionMacroTest, WorksWhenNotReferencingArguments) { Action a1 = Return5(); EXPECT_DOUBLE_EQ(5, a1.Perform(make_tuple())); Action a2 = Return5(); EXPECT_EQ(5, a2.Perform(make_tuple(1, true))); } // Tests that ACTION() can define an action that returns void. ACTION(IncrementArg1) { (*arg1)++; } TEST(ActionMacroTest, WorksWhenReturningVoid) { Action a1 = IncrementArg1(); int n = 0; a1.Perform(make_tuple(5, &n)); EXPECT_EQ(1, n); } // Tests that the body of ACTION() can reference the type of the // argument. ACTION(IncrementArg2) { StaticAssertTypeEq(); arg2_type temp = arg2; (*temp)++; } TEST(ActionMacroTest, CanReferenceArgumentType) { Action a1 = IncrementArg2(); int n = 0; a1.Perform(make_tuple(5, false, &n)); EXPECT_EQ(1, n); } // Tests that the body of ACTION() can reference the argument tuple // via args_type and args. ACTION(Sum2) { StaticAssertTypeEq< ::std::tr1::tuple, args_type>(); args_type args_copy = args; return get<0>(args_copy) + get<1>(args_copy); } TEST(ActionMacroTest, CanReferenceArgumentTuple) { Action a1 = Sum2(); int dummy = 0; EXPECT_EQ(11, a1.Perform(make_tuple(5, Char(6), &dummy))); } // Tests that the body of ACTION() can reference the mock function // type. int Dummy(bool flag) { return flag? 1 : 0; } ACTION(InvokeDummy) { StaticAssertTypeEq(); function_type* fp = &Dummy; return (*fp)(true); } TEST(ActionMacroTest, CanReferenceMockFunctionType) { Action a1 = InvokeDummy(); EXPECT_EQ(1, a1.Perform(make_tuple(true))); EXPECT_EQ(1, a1.Perform(make_tuple(false))); } // Tests that the body of ACTION() can reference the mock function's // return type. ACTION(InvokeDummy2) { StaticAssertTypeEq(); return_type result = Dummy(true); return result; } TEST(ActionMacroTest, CanReferenceMockFunctionReturnType) { Action a1 = InvokeDummy2(); EXPECT_EQ(1, a1.Perform(make_tuple(true))); EXPECT_EQ(1, a1.Perform(make_tuple(false))); } // Tests that ACTION() works for arguments passed by const reference. ACTION(ReturnAddrOfConstBoolReferenceArg) { StaticAssertTypeEq(); return &arg1; } TEST(ActionMacroTest, WorksForConstReferenceArg) { Action a = ReturnAddrOfConstBoolReferenceArg(); const bool b = false; EXPECT_EQ(&b, a.Perform(tuple(0, b))); } // Tests that ACTION() works for arguments passed by non-const reference. ACTION(ReturnAddrOfIntReferenceArg) { StaticAssertTypeEq(); return &arg0; } TEST(ActionMacroTest, WorksForNonConstReferenceArg) { Action a = ReturnAddrOfIntReferenceArg(); int n = 0; EXPECT_EQ(&n, a.Perform(tuple(n, true, 1))); } // Tests that ACTION() can be used in a namespace. namespace action_test { ACTION(Sum) { return arg0 + arg1; } } // namespace action_test TEST(ActionMacroTest, WorksInNamespace) { Action a1 = action_test::Sum(); EXPECT_EQ(3, a1.Perform(make_tuple(1, 2))); } // Tests that the same ACTION definition works for mock functions with // different argument numbers. ACTION(PlusTwo) { return arg0 + 2; } TEST(ActionMacroTest, WorksForDifferentArgumentNumbers) { Action a1 = PlusTwo(); EXPECT_EQ(4, a1.Perform(make_tuple(2))); Action a2 = PlusTwo(); int dummy; EXPECT_DOUBLE_EQ(6, a2.Perform(make_tuple(4.0f, &dummy))); } // Tests that ACTION_P can define a parameterized action. ACTION_P(Plus, n) { return arg0 + n; } TEST(ActionPMacroTest, DefinesParameterizedAction) { Action a1 = Plus(9); EXPECT_EQ(10, a1.Perform(make_tuple(1, true))); } // Tests that the body of ACTION_P can reference the argument types // and the parameter type. ACTION_P(TypedPlus, n) { arg0_type t1 = arg0; n_type t2 = n; return t1 + t2; } TEST(ActionPMacroTest, CanReferenceArgumentAndParameterTypes) { Action a1 = TypedPlus(9); EXPECT_EQ(10, a1.Perform(make_tuple(Char(1), true))); } // Tests that a parameterized action can be used in any mock function // whose type is compatible. TEST(ActionPMacroTest, WorksInCompatibleMockFunction) { Action a1 = Plus("tail"); const std::string re = "re"; EXPECT_EQ("retail", a1.Perform(make_tuple(re))); } // Tests that we can use ACTION*() to define actions overloaded on the // number of parameters. ACTION(OverloadedAction) { return arg0 ? arg1 : "hello"; } ACTION_P(OverloadedAction, default_value) { return arg0 ? arg1 : default_value; } ACTION_P2(OverloadedAction, true_value, false_value) { return arg0 ? true_value : false_value; } TEST(ActionMacroTest, CanDefineOverloadedActions) { typedef Action MyAction; const MyAction a1 = OverloadedAction(); EXPECT_STREQ("hello", a1.Perform(make_tuple(false, CharPtr("world")))); EXPECT_STREQ("world", a1.Perform(make_tuple(true, CharPtr("world")))); const MyAction a2 = OverloadedAction("hi"); EXPECT_STREQ("hi", a2.Perform(make_tuple(false, CharPtr("world")))); EXPECT_STREQ("world", a2.Perform(make_tuple(true, CharPtr("world")))); const MyAction a3 = OverloadedAction("hi", "you"); EXPECT_STREQ("hi", a3.Perform(make_tuple(true, CharPtr("world")))); EXPECT_STREQ("you", a3.Perform(make_tuple(false, CharPtr("world")))); } // Tests ACTION_Pn where n >= 3. ACTION_P3(Plus, m, n, k) { return arg0 + m + n + k; } TEST(ActionPnMacroTest, WorksFor3Parameters) { Action a1 = Plus(100, 20, 3.4); EXPECT_DOUBLE_EQ(3123.4, a1.Perform(make_tuple(3000, true))); Action a2 = Plus("tail", "-", ">"); const std::string re = "re"; EXPECT_EQ("retail->", a2.Perform(make_tuple(re))); } ACTION_P4(Plus, p0, p1, p2, p3) { return arg0 + p0 + p1 + p2 + p3; } TEST(ActionPnMacroTest, WorksFor4Parameters) { Action a1 = Plus(1, 2, 3, 4); EXPECT_EQ(10 + 1 + 2 + 3 + 4, a1.Perform(make_tuple(10))); } ACTION_P5(Plus, p0, p1, p2, p3, p4) { return arg0 + p0 + p1 + p2 + p3 + p4; } TEST(ActionPnMacroTest, WorksFor5Parameters) { Action a1 = Plus(1, 2, 3, 4, 5); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5, a1.Perform(make_tuple(10))); } ACTION_P6(Plus, p0, p1, p2, p3, p4, p5) { return arg0 + p0 + p1 + p2 + p3 + p4 + p5; } TEST(ActionPnMacroTest, WorksFor6Parameters) { Action a1 = Plus(1, 2, 3, 4, 5, 6); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5 + 6, a1.Perform(make_tuple(10))); } ACTION_P7(Plus, p0, p1, p2, p3, p4, p5, p6) { return arg0 + p0 + p1 + p2 + p3 + p4 + p5 + p6; } TEST(ActionPnMacroTest, WorksFor7Parameters) { Action a1 = Plus(1, 2, 3, 4, 5, 6, 7); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5 + 6 + 7, a1.Perform(make_tuple(10))); } ACTION_P8(Plus, p0, p1, p2, p3, p4, p5, p6, p7) { return arg0 + p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7; } TEST(ActionPnMacroTest, WorksFor8Parameters) { Action a1 = Plus(1, 2, 3, 4, 5, 6, 7, 8); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8, a1.Perform(make_tuple(10))); } ACTION_P9(Plus, p0, p1, p2, p3, p4, p5, p6, p7, p8) { return arg0 + p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8; } TEST(ActionPnMacroTest, WorksFor9Parameters) { Action a1 = Plus(1, 2, 3, 4, 5, 6, 7, 8, 9); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9, a1.Perform(make_tuple(10))); } ACTION_P10(Plus, p0, p1, p2, p3, p4, p5, p6, p7, p8, last_param) { arg0_type t0 = arg0; last_param_type t9 = last_param; return t0 + p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + t9; } TEST(ActionPnMacroTest, WorksFor10Parameters) { Action a1 = Plus(1, 2, 3, 4, 5, 6, 7, 8, 9, 10); EXPECT_EQ(10 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10, a1.Perform(make_tuple(10))); } // Tests that the action body can promote the parameter types. ACTION_P2(PadArgument, prefix, suffix) { // The following lines promote the two parameters to desired types. std::string prefix_str(prefix); char suffix_char = static_cast(suffix); return prefix_str + arg0 + suffix_char; } TEST(ActionPnMacroTest, SimpleTypePromotion) { Action no_promo = PadArgument(std::string("foo"), 'r'); Action promo = PadArgument("foo", static_cast('r')); EXPECT_EQ("foobar", no_promo.Perform(make_tuple(CharPtr("ba")))); EXPECT_EQ("foobar", promo.Perform(make_tuple(CharPtr("ba")))); } // Tests that we can partially restrict parameter types using a // straight-forward pattern. // Defines a generic action that doesn't restrict the types of its // parameters. ACTION_P3(ConcatImpl, a, b, c) { std::stringstream ss; ss << a << b << c; return ss.str(); } // Next, we try to restrict that either the first parameter is a // string, or the second parameter is an int. // Defines a partially specialized wrapper that restricts the first // parameter to std::string. template // ConcatImplActionP3 is the class template ACTION_P3 uses to // implement ConcatImpl. We shouldn't change the name as this // pattern requires the user to use it directly. ConcatImplActionP3 Concat(const std::string& a, T1 b, T2 c) { if (true) { // This branch verifies that ConcatImpl() can be invoked without // explicit template arguments. return ConcatImpl(a, b, c); } else { // This branch verifies that ConcatImpl() can also be invoked with // explicit template arguments. It doesn't really need to be // executed as this is a compile-time verification. return ConcatImpl(a, b, c); } } // Defines another partially specialized wrapper that restricts the // second parameter to int. template ConcatImplActionP3 Concat(T1 a, int b, T2 c) { return ConcatImpl(a, b, c); } TEST(ActionPnMacroTest, CanPartiallyRestrictParameterTypes) { Action a1 = Concat("Hello", "1", 2); EXPECT_EQ("Hello12", a1.Perform(make_tuple())); a1 = Concat(1, 2, 3); EXPECT_EQ("123", a1.Perform(make_tuple())); } // Verifies the type of an ACTION*. ACTION(DoFoo) {} ACTION_P(DoFoo, p) {} ACTION_P2(DoFoo, p0, p1) {} TEST(ActionPnMacroTest, TypesAreCorrect) { // DoFoo() must be assignable to a DoFooAction variable. DoFooAction a0 = DoFoo(); // DoFoo(1) must be assignable to a DoFooActionP variable. DoFooActionP a1 = DoFoo(1); // DoFoo(p1, ..., pk) must be assignable to a DoFooActionPk // variable, and so on. DoFooActionP2 a2 = DoFoo(1, '2'); PlusActionP3 a3 = Plus(1, 2, '3'); PlusActionP4 a4 = Plus(1, 2, 3, '4'); PlusActionP5 a5 = Plus(1, 2, 3, 4, '5'); PlusActionP6 a6 = Plus(1, 2, 3, 4, 5, '6'); PlusActionP7 a7 = Plus(1, 2, 3, 4, 5, 6, '7'); PlusActionP8 a8 = Plus(1, 2, 3, 4, 5, 6, 7, '8'); PlusActionP9 a9 = Plus(1, 2, 3, 4, 5, 6, 7, 8, '9'); PlusActionP10 a10 = Plus(1, 2, 3, 4, 5, 6, 7, 8, 9, '0'); } // Tests that an ACTION_P*() action can be explicitly instantiated // with reference-typed parameters. ACTION_P(Plus1, x) { return x; } ACTION_P2(Plus2, x, y) { return x + y; } ACTION_P3(Plus3, x, y, z) { return x + y + z; } ACTION_P10(Plus10, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) { return a0 + a1 + a2 + a3 + a4 + a5 + a6 + a7 + a8 + a9; } TEST(ActionPnMacroTest, CanExplicitlyInstantiateWithReferenceTypes) { int x = 1, y = 2, z = 3; const tuple<> empty = make_tuple(); Action a = Plus1(x); EXPECT_EQ(1, a.Perform(empty)); a = Plus2(x, y); EXPECT_EQ(3, a.Perform(empty)); a = Plus3(x, y, z); EXPECT_EQ(6, a.Perform(empty)); int n[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; a = Plus10(n[0], n[1], n[2], n[3], n[4], n[5], n[6], n[7], n[8], n[9]); EXPECT_EQ(55, a.Perform(empty)); } class NullaryConstructorClass { public: NullaryConstructorClass() : value_(123) {} int value_; }; // Tests using ReturnNew() with a nullary constructor. TEST(ReturnNewTest, NoArgs) { Action a = ReturnNew(); NullaryConstructorClass* c = a.Perform(make_tuple()); EXPECT_EQ(123, c->value_); delete c; } class UnaryConstructorClass { public: explicit UnaryConstructorClass(int value) : value_(value) {} int value_; }; // Tests using ReturnNew() with a unary constructor. TEST(ReturnNewTest, Unary) { Action a = ReturnNew(4000); UnaryConstructorClass* c = a.Perform(make_tuple()); EXPECT_EQ(4000, c->value_); delete c; } TEST(ReturnNewTest, UnaryWorksWhenMockMethodHasArgs) { Action a = ReturnNew(4000); UnaryConstructorClass* c = a.Perform(make_tuple(false, 5)); EXPECT_EQ(4000, c->value_); delete c; } TEST(ReturnNewTest, UnaryWorksWhenMockMethodReturnsPointerToConst) { Action a = ReturnNew(4000); const UnaryConstructorClass* c = a.Perform(make_tuple()); EXPECT_EQ(4000, c->value_); delete c; } class TenArgConstructorClass { public: TenArgConstructorClass(int a1, int a2, int a3, int a4, int a5, int a6, int a7, int a8, int a9, int a10) : value_(a1 + a2 + a3 + a4 + a5 + a6 + a7 + a8 + a9 + a10) { } int value_; }; // Tests using ReturnNew() with a 10-argument constructor. TEST(ReturnNewTest, ConstructorThatTakes10Arguments) { Action a = ReturnNew(1000000000, 200000000, 30000000, 4000000, 500000, 60000, 7000, 800, 90, 0); TenArgConstructorClass* c = a.Perform(make_tuple()); EXPECT_EQ(1234567890, c->value_); delete c; } // Tests that ACTION_TEMPLATE works when there is no value parameter. ACTION_TEMPLATE(CreateNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_0_VALUE_PARAMS()) { return new T; } TEST(ActionTemplateTest, WorksWithoutValueParam) { const Action a = CreateNew(); int* p = a.Perform(make_tuple()); delete p; } // Tests that ACTION_TEMPLATE works when there are value parameters. ACTION_TEMPLATE(CreateNew, HAS_1_TEMPLATE_PARAMS(typename, T), AND_1_VALUE_PARAMS(a0)) { return new T(a0); } TEST(ActionTemplateTest, WorksWithValueParams) { const Action a = CreateNew(42); int* p = a.Perform(make_tuple()); EXPECT_EQ(42, *p); delete p; } // Tests that ACTION_TEMPLATE works for integral template parameters. ACTION_TEMPLATE(MyDeleteArg, HAS_1_TEMPLATE_PARAMS(int, k), AND_0_VALUE_PARAMS()) { delete std::tr1::get(args); } // Resets a bool variable in the destructor. class BoolResetter { public: explicit BoolResetter(bool* value) : value_(value) {} ~BoolResetter() { *value_ = false; } private: bool* value_; }; TEST(ActionTemplateTest, WorksForIntegralTemplateParams) { const Action a = MyDeleteArg<1>(); int n = 0; bool b = true; BoolResetter* resetter = new BoolResetter(&b); a.Perform(make_tuple(&n, resetter)); EXPECT_FALSE(b); // Verifies that resetter is deleted. } // Tests that ACTION_TEMPLATES works for template template parameters. ACTION_TEMPLATE(ReturnSmartPointer, HAS_1_TEMPLATE_PARAMS(template class, Pointer), AND_1_VALUE_PARAMS(pointee)) { return Pointer(new pointee_type(pointee)); } TEST(ActionTemplateTest, WorksForTemplateTemplateParameters) { using ::testing::internal::linked_ptr; const Action()> a = ReturnSmartPointer(42); linked_ptr p = a.Perform(make_tuple()); EXPECT_EQ(42, *p); } // Tests that ACTION_TEMPLATE works for 10 template parameters. template struct GiantTemplate { public: explicit GiantTemplate(int a_value) : value(a_value) {} int value; }; ACTION_TEMPLATE(ReturnGiant, HAS_10_TEMPLATE_PARAMS( typename, T1, typename, T2, typename, T3, int, k4, bool, k5, unsigned int, k6, class, T7, class, T8, class, T9, template class, T10), AND_1_VALUE_PARAMS(value)) { return GiantTemplate, T2, T3, k4, k5, k6, T7, T8, T9>(value); } TEST(ActionTemplateTest, WorksFor10TemplateParameters) { using ::testing::internal::linked_ptr; typedef GiantTemplate, bool, double, 5, true, 6, char, unsigned, int> Giant; const Action a = ReturnGiant< int, bool, double, 5, true, 6, char, unsigned, int, linked_ptr>(42); Giant giant = a.Perform(make_tuple()); EXPECT_EQ(42, giant.value); } // Tests that ACTION_TEMPLATE works for 10 value parameters. ACTION_TEMPLATE(ReturnSum, HAS_1_TEMPLATE_PARAMS(typename, Number), AND_10_VALUE_PARAMS(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10)) { return static_cast(v1) + v2 + v3 + v4 + v5 + v6 + v7 + v8 + v9 + v10; } TEST(ActionTemplateTest, WorksFor10ValueParameters) { const Action a = ReturnSum(1, 2, 3, 4, 5, 6, 7, 8, 9, 10); EXPECT_EQ(55, a.Perform(make_tuple())); } // Tests that ACTION_TEMPLATE and ACTION/ACTION_P* can be overloaded // on the number of value parameters. ACTION(ReturnSum) { return 0; } ACTION_P(ReturnSum, x) { return x; } ACTION_TEMPLATE(ReturnSum, HAS_1_TEMPLATE_PARAMS(typename, Number), AND_2_VALUE_PARAMS(v1, v2)) { return static_cast(v1) + v2; } ACTION_TEMPLATE(ReturnSum, HAS_1_TEMPLATE_PARAMS(typename, Number), AND_3_VALUE_PARAMS(v1, v2, v3)) { return static_cast(v1) + v2 + v3; } ACTION_TEMPLATE(ReturnSum, HAS_2_TEMPLATE_PARAMS(typename, Number, int, k), AND_4_VALUE_PARAMS(v1, v2, v3, v4)) { return static_cast(v1) + v2 + v3 + v4 + k; } TEST(ActionTemplateTest, CanBeOverloadedOnNumberOfValueParameters) { const Action a0 = ReturnSum(); const Action a1 = ReturnSum(1); const Action a2 = ReturnSum(1, 2); const Action a3 = ReturnSum(1, 2, 3); const Action a4 = ReturnSum(2000, 300, 40, 5); EXPECT_EQ(0, a0.Perform(make_tuple())); EXPECT_EQ(1, a1.Perform(make_tuple())); EXPECT_EQ(3, a2.Perform(make_tuple())); EXPECT_EQ(6, a3.Perform(make_tuple())); EXPECT_EQ(12345, a4.Perform(make_tuple())); } #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace gmock_generated_actions_test } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-generated-function-mockers_test.cc0000600000175000017500000004025611561126632030266 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the function mocker classes. #include "gmock/gmock-generated-function-mockers.h" #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" #if GTEST_OS_WINDOWS // MSDN says the header file to be included for STDMETHOD is BaseTyps.h but // we are getting compiler errors if we use basetyps.h, hence including // objbase.h for definition of STDMETHOD. # include #endif // GTEST_OS_WINDOWS // There is a bug in MSVC (fixed in VS 2008) that prevents creating a // mock for a function with const arguments, so we don't test such // cases for MSVC versions older than 2008. #if !GTEST_OS_WINDOWS || (_MSC_VER >= 1500) # define GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS #endif // !GTEST_OS_WINDOWS || (_MSC_VER >= 1500) namespace testing { namespace gmock_generated_function_mockers_test { using testing::internal::string; using testing::_; using testing::A; using testing::An; using testing::AnyNumber; using testing::Const; using testing::DoDefault; using testing::Eq; using testing::Lt; using testing::MockFunction; using testing::Ref; using testing::Return; using testing::ReturnRef; using testing::TypedEq; class FooInterface { public: virtual ~FooInterface() {} virtual void VoidReturning(int x) = 0; virtual int Nullary() = 0; virtual bool Unary(int x) = 0; virtual long Binary(short x, int y) = 0; // NOLINT virtual int Decimal(bool b, char c, short d, int e, long f, // NOLINT float g, double h, unsigned i, char* j, const string& k) = 0; virtual bool TakesNonConstReference(int& n) = 0; // NOLINT virtual string TakesConstReference(const int& n) = 0; #ifdef GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS virtual bool TakesConst(const int x) = 0; #endif // GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS virtual int OverloadedOnArgumentNumber() = 0; virtual int OverloadedOnArgumentNumber(int n) = 0; virtual int OverloadedOnArgumentType(int n) = 0; virtual char OverloadedOnArgumentType(char c) = 0; virtual int OverloadedOnConstness() = 0; virtual char OverloadedOnConstness() const = 0; virtual int TypeWithHole(int (*func)()) = 0; virtual int TypeWithComma(const std::map& a_map) = 0; #if GTEST_OS_WINDOWS STDMETHOD_(int, CTNullary)() = 0; STDMETHOD_(bool, CTUnary)(int x) = 0; STDMETHOD_(int, CTDecimal)(bool b, char c, short d, int e, long f, // NOLINT float g, double h, unsigned i, char* j, const string& k) = 0; STDMETHOD_(char, CTConst)(int x) const = 0; #endif // GTEST_OS_WINDOWS }; class MockFoo : public FooInterface { public: MockFoo() {} // Makes sure that a mock function parameter can be named. MOCK_METHOD1(VoidReturning, void(int n)); // NOLINT MOCK_METHOD0(Nullary, int()); // NOLINT // Makes sure that a mock function parameter can be unnamed. MOCK_METHOD1(Unary, bool(int)); // NOLINT MOCK_METHOD2(Binary, long(short, int)); // NOLINT MOCK_METHOD10(Decimal, int(bool, char, short, int, long, float, // NOLINT double, unsigned, char*, const string& str)); MOCK_METHOD1(TakesNonConstReference, bool(int&)); // NOLINT MOCK_METHOD1(TakesConstReference, string(const int&)); #ifdef GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS MOCK_METHOD1(TakesConst, bool(const int)); // NOLINT #endif // GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS MOCK_METHOD0(OverloadedOnArgumentNumber, int()); // NOLINT MOCK_METHOD1(OverloadedOnArgumentNumber, int(int)); // NOLINT MOCK_METHOD1(OverloadedOnArgumentType, int(int)); // NOLINT MOCK_METHOD1(OverloadedOnArgumentType, char(char)); // NOLINT MOCK_METHOD0(OverloadedOnConstness, int()); // NOLINT MOCK_CONST_METHOD0(OverloadedOnConstness, char()); // NOLINT MOCK_METHOD1(TypeWithHole, int(int (*)())); // NOLINT MOCK_METHOD1(TypeWithComma, int(const std::map&)); // NOLINT #if GTEST_OS_WINDOWS MOCK_METHOD0_WITH_CALLTYPE(STDMETHODCALLTYPE, CTNullary, int()); MOCK_METHOD1_WITH_CALLTYPE(STDMETHODCALLTYPE, CTUnary, bool(int)); MOCK_METHOD10_WITH_CALLTYPE(STDMETHODCALLTYPE, CTDecimal, int(bool b, char c, short d, int e, long f, float g, double h, unsigned i, char* j, const string& k)); MOCK_CONST_METHOD1_WITH_CALLTYPE(STDMETHODCALLTYPE, CTConst, char(int)); #endif // GTEST_OS_WINDOWS private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); }; class FunctionMockerTest : public testing::Test { protected: FunctionMockerTest() : foo_(&mock_foo_) {} FooInterface* const foo_; MockFoo mock_foo_; }; // Tests mocking a void-returning function. TEST_F(FunctionMockerTest, MocksVoidFunction) { EXPECT_CALL(mock_foo_, VoidReturning(Lt(100))); foo_->VoidReturning(0); } // Tests mocking a nullary function. TEST_F(FunctionMockerTest, MocksNullaryFunction) { EXPECT_CALL(mock_foo_, Nullary()) .WillOnce(DoDefault()) .WillOnce(Return(1)); EXPECT_EQ(0, foo_->Nullary()); EXPECT_EQ(1, foo_->Nullary()); } // Tests mocking a unary function. TEST_F(FunctionMockerTest, MocksUnaryFunction) { EXPECT_CALL(mock_foo_, Unary(Eq(2))) .Times(2) .WillOnce(Return(true)); EXPECT_TRUE(foo_->Unary(2)); EXPECT_FALSE(foo_->Unary(2)); } // Tests mocking a binary function. TEST_F(FunctionMockerTest, MocksBinaryFunction) { EXPECT_CALL(mock_foo_, Binary(2, _)) .WillOnce(Return(3)); EXPECT_EQ(3, foo_->Binary(2, 1)); } // Tests mocking a decimal function. TEST_F(FunctionMockerTest, MocksDecimalFunction) { EXPECT_CALL(mock_foo_, Decimal(true, 'a', 0, 0, 1L, A(), Lt(100), 5U, NULL, "hi")) .WillOnce(Return(5)); EXPECT_EQ(5, foo_->Decimal(true, 'a', 0, 0, 1, 0, 0, 5, NULL, "hi")); } // Tests mocking a function that takes a non-const reference. TEST_F(FunctionMockerTest, MocksFunctionWithNonConstReferenceArgument) { int a = 0; EXPECT_CALL(mock_foo_, TakesNonConstReference(Ref(a))) .WillOnce(Return(true)); EXPECT_TRUE(foo_->TakesNonConstReference(a)); } // Tests mocking a function that takes a const reference. TEST_F(FunctionMockerTest, MocksFunctionWithConstReferenceArgument) { int a = 0; EXPECT_CALL(mock_foo_, TakesConstReference(Ref(a))) .WillOnce(Return("Hello")); EXPECT_EQ("Hello", foo_->TakesConstReference(a)); } #ifdef GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS // Tests mocking a function that takes a const variable. TEST_F(FunctionMockerTest, MocksFunctionWithConstArgument) { EXPECT_CALL(mock_foo_, TakesConst(Lt(10))) .WillOnce(DoDefault()); EXPECT_FALSE(foo_->TakesConst(5)); } #endif // GMOCK_ALLOWS_CONST_PARAM_FUNCTIONS // Tests mocking functions overloaded on the number of arguments. TEST_F(FunctionMockerTest, MocksFunctionsOverloadedOnArgumentNumber) { EXPECT_CALL(mock_foo_, OverloadedOnArgumentNumber()) .WillOnce(Return(1)); EXPECT_CALL(mock_foo_, OverloadedOnArgumentNumber(_)) .WillOnce(Return(2)); EXPECT_EQ(2, foo_->OverloadedOnArgumentNumber(1)); EXPECT_EQ(1, foo_->OverloadedOnArgumentNumber()); } // Tests mocking functions overloaded on the types of argument. TEST_F(FunctionMockerTest, MocksFunctionsOverloadedOnArgumentType) { EXPECT_CALL(mock_foo_, OverloadedOnArgumentType(An())) .WillOnce(Return(1)); EXPECT_CALL(mock_foo_, OverloadedOnArgumentType(TypedEq('a'))) .WillOnce(Return('b')); EXPECT_EQ(1, foo_->OverloadedOnArgumentType(0)); EXPECT_EQ('b', foo_->OverloadedOnArgumentType('a')); } // Tests mocking functions overloaded on the const-ness of this object. TEST_F(FunctionMockerTest, MocksFunctionsOverloadedOnConstnessOfThis) { EXPECT_CALL(mock_foo_, OverloadedOnConstness()); EXPECT_CALL(Const(mock_foo_), OverloadedOnConstness()) .WillOnce(Return('a')); EXPECT_EQ(0, foo_->OverloadedOnConstness()); EXPECT_EQ('a', Const(*foo_).OverloadedOnConstness()); } #if GTEST_OS_WINDOWS // Tests mocking a nullary function with calltype. TEST_F(FunctionMockerTest, MocksNullaryFunctionWithCallType) { EXPECT_CALL(mock_foo_, CTNullary()) .WillOnce(Return(-1)) .WillOnce(Return(0)); EXPECT_EQ(-1, foo_->CTNullary()); EXPECT_EQ(0, foo_->CTNullary()); } // Tests mocking a unary function with calltype. TEST_F(FunctionMockerTest, MocksUnaryFunctionWithCallType) { EXPECT_CALL(mock_foo_, CTUnary(Eq(2))) .Times(2) .WillOnce(Return(true)) .WillOnce(Return(false)); EXPECT_TRUE(foo_->CTUnary(2)); EXPECT_FALSE(foo_->CTUnary(2)); } // Tests mocking a decimal function with calltype. TEST_F(FunctionMockerTest, MocksDecimalFunctionWithCallType) { EXPECT_CALL(mock_foo_, CTDecimal(true, 'a', 0, 0, 1L, A(), Lt(100), 5U, NULL, "hi")) .WillOnce(Return(10)); EXPECT_EQ(10, foo_->CTDecimal(true, 'a', 0, 0, 1, 0, 0, 5, NULL, "hi")); } // Tests mocking functions overloaded on the const-ness of this object. TEST_F(FunctionMockerTest, MocksFunctionsConstFunctionWithCallType) { EXPECT_CALL(Const(mock_foo_), CTConst(_)) .WillOnce(Return('a')); EXPECT_EQ('a', Const(*foo_).CTConst(0)); } #endif // GTEST_OS_WINDOWS class MockB { public: MockB() {} MOCK_METHOD0(DoB, void()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockB); }; // Tests that functions with no EXPECT_CALL() ruls can be called any // number of times. TEST(ExpectCallTest, UnmentionedFunctionCanBeCalledAnyNumberOfTimes) { { MockB b; } { MockB b; b.DoB(); } { MockB b; b.DoB(); b.DoB(); } } // Tests mocking template interfaces. template class StackInterface { public: virtual ~StackInterface() {} // Template parameter appears in function parameter. virtual void Push(const T& value) = 0; virtual void Pop() = 0; virtual int GetSize() const = 0; // Template parameter appears in function return type. virtual const T& GetTop() const = 0; }; template class MockStack : public StackInterface { public: MockStack() {} MOCK_METHOD1_T(Push, void(const T& elem)); MOCK_METHOD0_T(Pop, void()); MOCK_CONST_METHOD0_T(GetSize, int()); // NOLINT MOCK_CONST_METHOD0_T(GetTop, const T&()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockStack); }; // Tests that template mock works. TEST(TemplateMockTest, Works) { MockStack mock; EXPECT_CALL(mock, GetSize()) .WillOnce(Return(0)) .WillOnce(Return(1)) .WillOnce(Return(0)); EXPECT_CALL(mock, Push(_)); int n = 5; EXPECT_CALL(mock, GetTop()) .WillOnce(ReturnRef(n)); EXPECT_CALL(mock, Pop()) .Times(AnyNumber()); EXPECT_EQ(0, mock.GetSize()); mock.Push(5); EXPECT_EQ(1, mock.GetSize()); EXPECT_EQ(5, mock.GetTop()); mock.Pop(); EXPECT_EQ(0, mock.GetSize()); } #if GTEST_OS_WINDOWS // Tests mocking template interfaces with calltype. template class StackInterfaceWithCallType { public: virtual ~StackInterfaceWithCallType() {} // Template parameter appears in function parameter. STDMETHOD_(void, Push)(const T& value) = 0; STDMETHOD_(void, Pop)() = 0; STDMETHOD_(int, GetSize)() const = 0; // Template parameter appears in function return type. STDMETHOD_(const T&, GetTop)() const = 0; }; template class MockStackWithCallType : public StackInterfaceWithCallType { public: MockStackWithCallType() {} MOCK_METHOD1_T_WITH_CALLTYPE(STDMETHODCALLTYPE, Push, void(const T& elem)); MOCK_METHOD0_T_WITH_CALLTYPE(STDMETHODCALLTYPE, Pop, void()); MOCK_CONST_METHOD0_T_WITH_CALLTYPE(STDMETHODCALLTYPE, GetSize, int()); MOCK_CONST_METHOD0_T_WITH_CALLTYPE(STDMETHODCALLTYPE, GetTop, const T&()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockStackWithCallType); }; // Tests that template mock with calltype works. TEST(TemplateMockTestWithCallType, Works) { MockStackWithCallType mock; EXPECT_CALL(mock, GetSize()) .WillOnce(Return(0)) .WillOnce(Return(1)) .WillOnce(Return(0)); EXPECT_CALL(mock, Push(_)); int n = 5; EXPECT_CALL(mock, GetTop()) .WillOnce(ReturnRef(n)); EXPECT_CALL(mock, Pop()) .Times(AnyNumber()); EXPECT_EQ(0, mock.GetSize()); mock.Push(5); EXPECT_EQ(1, mock.GetSize()); EXPECT_EQ(5, mock.GetTop()); mock.Pop(); EXPECT_EQ(0, mock.GetSize()); } #endif // GTEST_OS_WINDOWS #define MY_MOCK_METHODS1_ \ MOCK_METHOD0(Overloaded, void()); \ MOCK_CONST_METHOD1(Overloaded, int(int n)); \ MOCK_METHOD2(Overloaded, bool(bool f, int n)) class MockOverloadedOnArgNumber { public: MockOverloadedOnArgNumber() {} MY_MOCK_METHODS1_; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockOverloadedOnArgNumber); }; TEST(OverloadedMockMethodTest, CanOverloadOnArgNumberInMacroBody) { MockOverloadedOnArgNumber mock; EXPECT_CALL(mock, Overloaded()); EXPECT_CALL(mock, Overloaded(1)).WillOnce(Return(2)); EXPECT_CALL(mock, Overloaded(true, 1)).WillOnce(Return(true)); mock.Overloaded(); EXPECT_EQ(2, mock.Overloaded(1)); EXPECT_TRUE(mock.Overloaded(true, 1)); } #define MY_MOCK_METHODS2_ \ MOCK_CONST_METHOD1(Overloaded, int(int n)); \ MOCK_METHOD1(Overloaded, int(int n)); class MockOverloadedOnConstness { public: MockOverloadedOnConstness() {} MY_MOCK_METHODS2_; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockOverloadedOnConstness); }; TEST(OverloadedMockMethodTest, CanOverloadOnConstnessInMacroBody) { MockOverloadedOnConstness mock; const MockOverloadedOnConstness* const_mock = &mock; EXPECT_CALL(mock, Overloaded(1)).WillOnce(Return(2)); EXPECT_CALL(*const_mock, Overloaded(1)).WillOnce(Return(3)); EXPECT_EQ(2, mock.Overloaded(1)); EXPECT_EQ(3, const_mock->Overloaded(1)); } TEST(MockFunctionTest, WorksForVoidNullary) { MockFunction foo; EXPECT_CALL(foo, Call()); foo.Call(); } TEST(MockFunctionTest, WorksForNonVoidNullary) { MockFunction foo; EXPECT_CALL(foo, Call()) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_EQ(1, foo.Call()); EXPECT_EQ(2, foo.Call()); } TEST(MockFunctionTest, WorksForVoidUnary) { MockFunction foo; EXPECT_CALL(foo, Call(1)); foo.Call(1); } TEST(MockFunctionTest, WorksForNonVoidBinary) { MockFunction foo; EXPECT_CALL(foo, Call(false, 42)) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_CALL(foo, Call(true, Ge(100))) .WillOnce(Return(3)); EXPECT_EQ(1, foo.Call(false, 42)); EXPECT_EQ(2, foo.Call(false, 42)); EXPECT_EQ(3, foo.Call(true, 120)); } TEST(MockFunctionTest, WorksFor10Arguments) { MockFunction foo; EXPECT_CALL(foo, Call(_, 'a', _, _, _, _, _, _, _, _)) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_EQ(1, foo.Call(false, 'a', 0, 0, 0, 0, 0, 'b', 0, true)); EXPECT_EQ(2, foo.Call(true, 'a', 0, 0, 0, 0, 0, 'b', 1, false)); } } // namespace gmock_generated_function_mockers_test } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-generated-internal-utils_test.cc0000600000175000017500000001247611561126632027755 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the internal utilities. #include "gmock/internal/gmock-generated-internal-utils.h" #include "gmock/internal/gmock-internal-utils.h" #include "gtest/gtest.h" namespace { using ::std::tr1::tuple; using ::testing::Matcher; using ::testing::internal::CompileAssertTypesEqual; using ::testing::internal::MatcherTuple; using ::testing::internal::Function; using ::testing::internal::IgnoredValue; // Tests the MatcherTuple template struct. TEST(MatcherTupleTest, ForSize0) { CompileAssertTypesEqual, MatcherTuple >::type>(); } TEST(MatcherTupleTest, ForSize1) { CompileAssertTypesEqual >, MatcherTuple >::type>(); } TEST(MatcherTupleTest, ForSize2) { CompileAssertTypesEqual, Matcher >, MatcherTuple >::type>(); } TEST(MatcherTupleTest, ForSize5) { CompileAssertTypesEqual, Matcher, Matcher, Matcher, Matcher >, MatcherTuple >::type>(); } // Tests the Function template struct. TEST(FunctionTest, Nullary) { typedef Function F; // NOLINT CompileAssertTypesEqual(); CompileAssertTypesEqual, F::ArgumentTuple>(); CompileAssertTypesEqual, F::ArgumentMatcherTuple>(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); } TEST(FunctionTest, Unary) { typedef Function F; // NOLINT CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual, F::ArgumentTuple>(); CompileAssertTypesEqual >, F::ArgumentMatcherTuple>(); CompileAssertTypesEqual(); // NOLINT CompileAssertTypesEqual(); } TEST(FunctionTest, Binary) { typedef Function F; // NOLINT CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); // NOLINT CompileAssertTypesEqual, F::ArgumentTuple>(); // NOLINT CompileAssertTypesEqual, Matcher >, // NOLINT F::ArgumentMatcherTuple>(); CompileAssertTypesEqual(); // NOLINT CompileAssertTypesEqual(); } TEST(FunctionTest, LongArgumentList) { typedef Function F; // NOLINT CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); CompileAssertTypesEqual(); // NOLINT CompileAssertTypesEqual, // NOLINT F::ArgumentTuple>(); CompileAssertTypesEqual, Matcher, Matcher, Matcher, Matcher >, // NOLINT F::ArgumentMatcherTuple>(); CompileAssertTypesEqual(); CompileAssertTypesEqual< IgnoredValue(bool, int, char*, int&, const long&), // NOLINT F::MakeResultIgnoredValue>(); } } // Unnamed namespace synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-generated-matchers_test.cc0000600000175000017500000010740011561126632026601 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Google Mock - a framework for writing C++ mock classes. // // This file tests the built-in matchers generated by a script. #include "gmock/gmock-generated-matchers.h" #include #include #include #include #include #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" namespace { using std::list; using std::map; using std::pair; using std::set; using std::stringstream; using std::vector; using std::tr1::get; using std::tr1::make_tuple; using std::tr1::tuple; using testing::_; using testing::Args; using testing::Contains; using testing::ElementsAre; using testing::ElementsAreArray; using testing::Eq; using testing::Ge; using testing::Gt; using testing::Lt; using testing::MakeMatcher; using testing::Matcher; using testing::MatcherInterface; using testing::MatchResultListener; using testing::Ne; using testing::Not; using testing::Pointee; using testing::PrintToString; using testing::Ref; using testing::StaticAssertTypeEq; using testing::StrEq; using testing::Value; using testing::internal::string; // Returns the description of the given matcher. template string Describe(const Matcher& m) { stringstream ss; m.DescribeTo(&ss); return ss.str(); } // Returns the description of the negation of the given matcher. template string DescribeNegation(const Matcher& m) { stringstream ss; m.DescribeNegationTo(&ss); return ss.str(); } // Returns the reason why x matches, or doesn't match, m. template string Explain(const MatcherType& m, const Value& x) { stringstream ss; m.ExplainMatchResultTo(x, &ss); return ss.str(); } // Tests Args(m). TEST(ArgsTest, AcceptsZeroTemplateArg) { const tuple t(5, true); EXPECT_THAT(t, Args<>(Eq(tuple<>()))); EXPECT_THAT(t, Not(Args<>(Ne(tuple<>())))); } TEST(ArgsTest, AcceptsOneTemplateArg) { const tuple t(5, true); EXPECT_THAT(t, Args<0>(Eq(make_tuple(5)))); EXPECT_THAT(t, Args<1>(Eq(make_tuple(true)))); EXPECT_THAT(t, Not(Args<1>(Eq(make_tuple(false))))); } TEST(ArgsTest, AcceptsTwoTemplateArgs) { const tuple t(4, 5, 6L); // NOLINT EXPECT_THAT(t, (Args<0, 1>(Lt()))); EXPECT_THAT(t, (Args<1, 2>(Lt()))); EXPECT_THAT(t, Not(Args<0, 2>(Gt()))); } TEST(ArgsTest, AcceptsRepeatedTemplateArgs) { const tuple t(4, 5, 6L); // NOLINT EXPECT_THAT(t, (Args<0, 0>(Eq()))); EXPECT_THAT(t, Not(Args<1, 1>(Ne()))); } TEST(ArgsTest, AcceptsDecreasingTemplateArgs) { const tuple t(4, 5, 6L); // NOLINT EXPECT_THAT(t, (Args<2, 0>(Gt()))); EXPECT_THAT(t, Not(Args<2, 1>(Lt()))); } // The MATCHER*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif MATCHER(SumIsZero, "") { return get<0>(arg) + get<1>(arg) + get<2>(arg) == 0; } TEST(ArgsTest, AcceptsMoreTemplateArgsThanArityOfOriginalTuple) { EXPECT_THAT(make_tuple(-1, 2), (Args<0, 0, 1>(SumIsZero()))); EXPECT_THAT(make_tuple(1, 2), Not(Args<0, 0, 1>(SumIsZero()))); } TEST(ArgsTest, CanBeNested) { const tuple t(4, 5, 6L, 6); // NOLINT EXPECT_THAT(t, (Args<1, 2, 3>(Args<1, 2>(Eq())))); EXPECT_THAT(t, (Args<0, 1, 3>(Args<0, 2>(Lt())))); } TEST(ArgsTest, CanMatchTupleByValue) { typedef tuple Tuple3; const Matcher m = Args<1, 2>(Lt()); EXPECT_TRUE(m.Matches(Tuple3('a', 1, 2))); EXPECT_FALSE(m.Matches(Tuple3('b', 2, 2))); } TEST(ArgsTest, CanMatchTupleByReference) { typedef tuple Tuple3; const Matcher m = Args<0, 1>(Lt()); EXPECT_TRUE(m.Matches(Tuple3('a', 'b', 2))); EXPECT_FALSE(m.Matches(Tuple3('b', 'b', 2))); } // Validates that arg is printed as str. MATCHER_P(PrintsAs, str, "") { return testing::PrintToString(arg) == str; } TEST(ArgsTest, AcceptsTenTemplateArgs) { EXPECT_THAT(make_tuple(0, 1L, 2, 3L, 4, 5, 6, 7, 8, 9), (Args<9, 8, 7, 6, 5, 4, 3, 2, 1, 0>( PrintsAs("(9, 8, 7, 6, 5, 4, 3, 2, 1, 0)")))); EXPECT_THAT(make_tuple(0, 1L, 2, 3L, 4, 5, 6, 7, 8, 9), Not(Args<9, 8, 7, 6, 5, 4, 3, 2, 1, 0>( PrintsAs("(0, 8, 7, 6, 5, 4, 3, 2, 1, 0)")))); } TEST(ArgsTest, DescirbesSelfCorrectly) { const Matcher > m = Args<2, 0>(Lt()); EXPECT_EQ("are a tuple whose fields (#2, #0) are a pair where " "the first < the second", Describe(m)); } TEST(ArgsTest, DescirbesNestedArgsCorrectly) { const Matcher&> m = Args<0, 2, 3>(Args<2, 0>(Lt())); EXPECT_EQ("are a tuple whose fields (#0, #2, #3) are a tuple " "whose fields (#2, #0) are a pair where the first < the second", Describe(m)); } TEST(ArgsTest, DescribesNegationCorrectly) { const Matcher > m = Args<1, 0>(Gt()); EXPECT_EQ("are a tuple whose fields (#1, #0) aren't a pair " "where the first > the second", DescribeNegation(m)); } TEST(ArgsTest, ExplainsMatchResultWithoutInnerExplanation) { const Matcher > m = Args<1, 2>(Eq()); EXPECT_EQ("whose fields (#1, #2) are (42, 42)", Explain(m, make_tuple(false, 42, 42))); EXPECT_EQ("whose fields (#1, #2) are (42, 43)", Explain(m, make_tuple(false, 42, 43))); } // For testing Args<>'s explanation. class LessThanMatcher : public MatcherInterface > { public: virtual void DescribeTo(::std::ostream* os) const {} virtual bool MatchAndExplain(tuple value, MatchResultListener* listener) const { const int diff = get<0>(value) - get<1>(value); if (diff > 0) { *listener << "where the first value is " << diff << " more than the second"; } return diff < 0; } }; Matcher > LessThan() { return MakeMatcher(new LessThanMatcher); } TEST(ArgsTest, ExplainsMatchResultWithInnerExplanation) { const Matcher > m = Args<0, 2>(LessThan()); EXPECT_EQ("whose fields (#0, #2) are ('a' (97, 0x61), 42), " "where the first value is 55 more than the second", Explain(m, make_tuple('a', 42, 42))); EXPECT_EQ("whose fields (#0, #2) are ('\\0', 43)", Explain(m, make_tuple('\0', 42, 43))); } // For testing ExplainMatchResultTo(). class GreaterThanMatcher : public MatcherInterface { public: explicit GreaterThanMatcher(int rhs) : rhs_(rhs) {} virtual void DescribeTo(::std::ostream* os) const { *os << "is greater than " << rhs_; } virtual bool MatchAndExplain(int lhs, MatchResultListener* listener) const { const int diff = lhs - rhs_; if (diff > 0) { *listener << "which is " << diff << " more than " << rhs_; } else if (diff == 0) { *listener << "which is the same as " << rhs_; } else { *listener << "which is " << -diff << " less than " << rhs_; } return lhs > rhs_; } private: int rhs_; }; Matcher GreaterThan(int n) { return MakeMatcher(new GreaterThanMatcher(n)); } // Tests for ElementsAre(). // Evaluates to the number of elements in 'array'. #define GMOCK_ARRAY_SIZE_(array) (sizeof(array)/sizeof(array[0])) TEST(ElementsAreTest, CanDescribeExpectingNoElement) { Matcher&> m = ElementsAre(); EXPECT_EQ("is empty", Describe(m)); } TEST(ElementsAreTest, CanDescribeExpectingOneElement) { Matcher > m = ElementsAre(Gt(5)); EXPECT_EQ("has 1 element that is > 5", Describe(m)); } TEST(ElementsAreTest, CanDescribeExpectingManyElements) { Matcher > m = ElementsAre(StrEq("one"), "two"); EXPECT_EQ("has 2 elements where\n" "element #0 is equal to \"one\",\n" "element #1 is equal to \"two\"", Describe(m)); } TEST(ElementsAreTest, CanDescribeNegationOfExpectingNoElement) { Matcher > m = ElementsAre(); EXPECT_EQ("isn't empty", DescribeNegation(m)); } TEST(ElementsAreTest, CanDescribeNegationOfExpectingOneElment) { Matcher& > m = ElementsAre(Gt(5)); EXPECT_EQ("doesn't have 1 element, or\n" "element #0 isn't > 5", DescribeNegation(m)); } TEST(ElementsAreTest, CanDescribeNegationOfExpectingManyElements) { Matcher& > m = ElementsAre("one", "two"); EXPECT_EQ("doesn't have 2 elements, or\n" "element #0 isn't equal to \"one\", or\n" "element #1 isn't equal to \"two\"", DescribeNegation(m)); } TEST(ElementsAreTest, DoesNotExplainTrivialMatch) { Matcher& > m = ElementsAre(1, Ne(2)); list test_list; test_list.push_back(1); test_list.push_back(3); EXPECT_EQ("", Explain(m, test_list)); // No need to explain anything. } TEST(ElementsAreTest, ExplainsNonTrivialMatch) { Matcher& > m = ElementsAre(GreaterThan(1), 0, GreaterThan(2)); const int a[] = { 10, 0, 100 }; vector test_vector(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_EQ("whose element #0 matches, which is 9 more than 1,\n" "and whose element #2 matches, which is 98 more than 2", Explain(m, test_vector)); } TEST(ElementsAreTest, CanExplainMismatchWrongSize) { Matcher& > m = ElementsAre(1, 3); list test_list; // No need to explain when the container is empty. EXPECT_EQ("", Explain(m, test_list)); test_list.push_back(1); EXPECT_EQ("which has 1 element", Explain(m, test_list)); } TEST(ElementsAreTest, CanExplainMismatchRightSize) { Matcher& > m = ElementsAre(1, GreaterThan(5)); vector v; v.push_back(2); v.push_back(1); EXPECT_EQ("whose element #0 doesn't match", Explain(m, v)); v[0] = 1; EXPECT_EQ("whose element #1 doesn't match, which is 4 less than 5", Explain(m, v)); } TEST(ElementsAreTest, MatchesOneElementVector) { vector test_vector; test_vector.push_back("test string"); EXPECT_THAT(test_vector, ElementsAre(StrEq("test string"))); } TEST(ElementsAreTest, MatchesOneElementList) { list test_list; test_list.push_back("test string"); EXPECT_THAT(test_list, ElementsAre("test string")); } TEST(ElementsAreTest, MatchesThreeElementVector) { vector test_vector; test_vector.push_back("one"); test_vector.push_back("two"); test_vector.push_back("three"); EXPECT_THAT(test_vector, ElementsAre("one", StrEq("two"), _)); } TEST(ElementsAreTest, MatchesOneElementEqMatcher) { vector test_vector; test_vector.push_back(4); EXPECT_THAT(test_vector, ElementsAre(Eq(4))); } TEST(ElementsAreTest, MatchesOneElementAnyMatcher) { vector test_vector; test_vector.push_back(4); EXPECT_THAT(test_vector, ElementsAre(_)); } TEST(ElementsAreTest, MatchesOneElementValue) { vector test_vector; test_vector.push_back(4); EXPECT_THAT(test_vector, ElementsAre(4)); } TEST(ElementsAreTest, MatchesThreeElementsMixedMatchers) { vector test_vector; test_vector.push_back(1); test_vector.push_back(2); test_vector.push_back(3); EXPECT_THAT(test_vector, ElementsAre(1, Eq(2), _)); } TEST(ElementsAreTest, MatchesTenElementVector) { const int a[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; vector test_vector(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(test_vector, // The element list can contain values and/or matchers // of different types. ElementsAre(0, Ge(0), _, 3, 4, Ne(2), Eq(6), 7, 8, _)); } TEST(ElementsAreTest, DoesNotMatchWrongSize) { vector test_vector; test_vector.push_back("test string"); test_vector.push_back("test string"); Matcher > m = ElementsAre(StrEq("test string")); EXPECT_FALSE(m.Matches(test_vector)); } TEST(ElementsAreTest, DoesNotMatchWrongValue) { vector test_vector; test_vector.push_back("other string"); Matcher > m = ElementsAre(StrEq("test string")); EXPECT_FALSE(m.Matches(test_vector)); } TEST(ElementsAreTest, DoesNotMatchWrongOrder) { vector test_vector; test_vector.push_back("one"); test_vector.push_back("three"); test_vector.push_back("two"); Matcher > m = ElementsAre( StrEq("one"), StrEq("two"), StrEq("three")); EXPECT_FALSE(m.Matches(test_vector)); } TEST(ElementsAreTest, WorksForNestedContainer) { const char* strings[] = { "Hi", "world" }; vector > nested; for (size_t i = 0; i < GMOCK_ARRAY_SIZE_(strings); i++) { nested.push_back(list(strings[i], strings[i] + strlen(strings[i]))); } EXPECT_THAT(nested, ElementsAre(ElementsAre('H', Ne('e')), ElementsAre('w', 'o', _, _, 'd'))); EXPECT_THAT(nested, Not(ElementsAre(ElementsAre('H', 'e'), ElementsAre('w', 'o', _, _, 'd')))); } TEST(ElementsAreTest, WorksWithByRefElementMatchers) { int a[] = { 0, 1, 2 }; vector v(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(v, ElementsAre(Ref(v[0]), Ref(v[1]), Ref(v[2]))); EXPECT_THAT(v, Not(ElementsAre(Ref(v[0]), Ref(v[1]), Ref(a[2])))); } TEST(ElementsAreTest, WorksWithContainerPointerUsingPointee) { int a[] = { 0, 1, 2 }; vector v(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(&v, Pointee(ElementsAre(0, 1, _))); EXPECT_THAT(&v, Not(Pointee(ElementsAre(0, _, 3)))); } TEST(ElementsAreTest, WorksWithNativeArrayPassedByReference) { int array[] = { 0, 1, 2 }; EXPECT_THAT(array, ElementsAre(0, 1, _)); EXPECT_THAT(array, Not(ElementsAre(1, _, _))); EXPECT_THAT(array, Not(ElementsAre(0, _))); } class NativeArrayPassedAsPointerAndSize { public: NativeArrayPassedAsPointerAndSize() {} MOCK_METHOD2(Helper, void(int* array, int size)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(NativeArrayPassedAsPointerAndSize); }; TEST(ElementsAreTest, WorksWithNativeArrayPassedAsPointerAndSize) { int array[] = { 0, 1 }; ::std::tr1::tuple array_as_tuple(array, 2); EXPECT_THAT(array_as_tuple, ElementsAre(0, 1)); EXPECT_THAT(array_as_tuple, Not(ElementsAre(0))); NativeArrayPassedAsPointerAndSize helper; EXPECT_CALL(helper, Helper(_, _)) .With(ElementsAre(0, 1)); helper.Helper(array, 2); } TEST(ElementsAreTest, WorksWithTwoDimensionalNativeArray) { const char a2[][3] = { "hi", "lo" }; EXPECT_THAT(a2, ElementsAre(ElementsAre('h', 'i', '\0'), ElementsAre('l', 'o', '\0'))); EXPECT_THAT(a2, ElementsAre(StrEq("hi"), StrEq("lo"))); EXPECT_THAT(a2, ElementsAre(Not(ElementsAre('h', 'o', '\0')), ElementsAre('l', 'o', '\0'))); } // Tests for ElementsAreArray(). Since ElementsAreArray() shares most // of the implementation with ElementsAre(), we don't test it as // thoroughly here. TEST(ElementsAreArrayTest, CanBeCreatedWithValueArray) { const int a[] = { 1, 2, 3 }; vector test_vector(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(test_vector, ElementsAreArray(a)); test_vector[2] = 0; EXPECT_THAT(test_vector, Not(ElementsAreArray(a))); } TEST(ElementsAreArrayTest, CanBeCreatedWithArraySize) { const char* a[] = { "one", "two", "three" }; vector test_vector(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(test_vector, ElementsAreArray(a, GMOCK_ARRAY_SIZE_(a))); const char** p = a; test_vector[0] = "1"; EXPECT_THAT(test_vector, Not(ElementsAreArray(p, GMOCK_ARRAY_SIZE_(a)))); } TEST(ElementsAreArrayTest, CanBeCreatedWithoutArraySize) { const char* a[] = { "one", "two", "three" }; vector test_vector(a, a + GMOCK_ARRAY_SIZE_(a)); EXPECT_THAT(test_vector, ElementsAreArray(a)); test_vector[0] = "1"; EXPECT_THAT(test_vector, Not(ElementsAreArray(a))); } TEST(ElementsAreArrayTest, CanBeCreatedWithMatcherArray) { const Matcher kMatcherArray[] = { StrEq("one"), StrEq("two"), StrEq("three") }; vector test_vector; test_vector.push_back("one"); test_vector.push_back("two"); test_vector.push_back("three"); EXPECT_THAT(test_vector, ElementsAreArray(kMatcherArray)); test_vector.push_back("three"); EXPECT_THAT(test_vector, Not(ElementsAreArray(kMatcherArray))); } // Since ElementsAre() and ElementsAreArray() share much of the // implementation, we only do a sanity test for native arrays here. TEST(ElementsAreArrayTest, WorksWithNativeArray) { ::std::string a[] = { "hi", "ho" }; ::std::string b[] = { "hi", "ho" }; EXPECT_THAT(a, ElementsAreArray(b)); EXPECT_THAT(a, ElementsAreArray(b, 2)); EXPECT_THAT(a, Not(ElementsAreArray(b, 1))); } // Tests for the MATCHER*() macro family. // Tests that a simple MATCHER() definition works. MATCHER(IsEven, "") { return (arg % 2) == 0; } TEST(MatcherMacroTest, Works) { const Matcher m = IsEven(); EXPECT_TRUE(m.Matches(6)); EXPECT_FALSE(m.Matches(7)); EXPECT_EQ("is even", Describe(m)); EXPECT_EQ("not (is even)", DescribeNegation(m)); EXPECT_EQ("", Explain(m, 6)); EXPECT_EQ("", Explain(m, 7)); } // This also tests that the description string can reference 'negation'. MATCHER(IsEven2, negation ? "is odd" : "is even") { if ((arg % 2) == 0) { // Verifies that we can stream to result_listener, a listener // supplied by the MATCHER macro implicitly. *result_listener << "OK"; return true; } else { *result_listener << "% 2 == " << (arg % 2); return false; } } // This also tests that the description string can reference matcher // parameters. MATCHER_P2(EqSumOf, x, y, string(negation ? "doesn't equal" : "equals") + " the sum of " + PrintToString(x) + " and " + PrintToString(y)) { if (arg == (x + y)) { *result_listener << "OK"; return true; } else { // Verifies that we can stream to the underlying stream of // result_listener. if (result_listener->stream() != NULL) { *result_listener->stream() << "diff == " << (x + y - arg); } return false; } } // Tests that the matcher description can reference 'negation' and the // matcher parameters. TEST(MatcherMacroTest, DescriptionCanReferenceNegationAndParameters) { const Matcher m1 = IsEven2(); EXPECT_EQ("is even", Describe(m1)); EXPECT_EQ("is odd", DescribeNegation(m1)); const Matcher m2 = EqSumOf(5, 9); EXPECT_EQ("equals the sum of 5 and 9", Describe(m2)); EXPECT_EQ("doesn't equal the sum of 5 and 9", DescribeNegation(m2)); } // Tests explaining match result in a MATCHER* macro. TEST(MatcherMacroTest, CanExplainMatchResult) { const Matcher m1 = IsEven2(); EXPECT_EQ("OK", Explain(m1, 4)); EXPECT_EQ("% 2 == 1", Explain(m1, 5)); const Matcher m2 = EqSumOf(1, 2); EXPECT_EQ("OK", Explain(m2, 3)); EXPECT_EQ("diff == -1", Explain(m2, 4)); } // Tests that the body of MATCHER() can reference the type of the // value being matched. MATCHER(IsEmptyString, "") { StaticAssertTypeEq< ::std::string, arg_type>(); return arg == ""; } MATCHER(IsEmptyStringByRef, "") { StaticAssertTypeEq(); return arg == ""; } TEST(MatcherMacroTest, CanReferenceArgType) { const Matcher< ::std::string> m1 = IsEmptyString(); EXPECT_TRUE(m1.Matches("")); const Matcher m2 = IsEmptyStringByRef(); EXPECT_TRUE(m2.Matches("")); } // Tests that MATCHER() can be used in a namespace. namespace matcher_test { MATCHER(IsOdd, "") { return (arg % 2) != 0; } } // namespace matcher_test TEST(MatcherMacroTest, WorksInNamespace) { Matcher m = matcher_test::IsOdd(); EXPECT_FALSE(m.Matches(4)); EXPECT_TRUE(m.Matches(5)); } // Tests that Value() can be used to compose matchers. MATCHER(IsPositiveOdd, "") { return Value(arg, matcher_test::IsOdd()) && arg > 0; } TEST(MatcherMacroTest, CanBeComposedUsingValue) { EXPECT_THAT(3, IsPositiveOdd()); EXPECT_THAT(4, Not(IsPositiveOdd())); EXPECT_THAT(-1, Not(IsPositiveOdd())); } // Tests that a simple MATCHER_P() definition works. MATCHER_P(IsGreaterThan32And, n, "") { return arg > 32 && arg > n; } TEST(MatcherPMacroTest, Works) { const Matcher m = IsGreaterThan32And(5); EXPECT_TRUE(m.Matches(36)); EXPECT_FALSE(m.Matches(5)); EXPECT_EQ("is greater than 32 and 5", Describe(m)); EXPECT_EQ("not (is greater than 32 and 5)", DescribeNegation(m)); EXPECT_EQ("", Explain(m, 36)); EXPECT_EQ("", Explain(m, 5)); } // Tests that the description is calculated correctly from the matcher name. MATCHER_P(_is_Greater_Than32and_, n, "") { return arg > 32 && arg > n; } TEST(MatcherPMacroTest, GeneratesCorrectDescription) { const Matcher m = _is_Greater_Than32and_(5); EXPECT_EQ("is greater than 32 and 5", Describe(m)); EXPECT_EQ("not (is greater than 32 and 5)", DescribeNegation(m)); EXPECT_EQ("", Explain(m, 36)); EXPECT_EQ("", Explain(m, 5)); } // Tests that a MATCHER_P matcher can be explicitly instantiated with // a reference parameter type. class UncopyableFoo { public: explicit UncopyableFoo(char value) : value_(value) {} private: UncopyableFoo(const UncopyableFoo&); void operator=(const UncopyableFoo&); char value_; }; MATCHER_P(ReferencesUncopyable, variable, "") { return &arg == &variable; } TEST(MatcherPMacroTest, WorksWhenExplicitlyInstantiatedWithReference) { UncopyableFoo foo1('1'), foo2('2'); const Matcher m = ReferencesUncopyable(foo1); EXPECT_TRUE(m.Matches(foo1)); EXPECT_FALSE(m.Matches(foo2)); // We don't want the address of the parameter printed, as most // likely it will just annoy the user. If the address is // interesting, the user should consider passing the parameter by // pointer instead. EXPECT_EQ("references uncopyable 1-byte object <31>", Describe(m)); } // Tests that the body of MATCHER_Pn() can reference the parameter // types. MATCHER_P3(ParamTypesAreIntLongAndChar, foo, bar, baz, "") { StaticAssertTypeEq(); StaticAssertTypeEq(); // NOLINT StaticAssertTypeEq(); return arg == 0; } TEST(MatcherPnMacroTest, CanReferenceParamTypes) { EXPECT_THAT(0, ParamTypesAreIntLongAndChar(10, 20L, 'a')); } // Tests that a MATCHER_Pn matcher can be explicitly instantiated with // reference parameter types. MATCHER_P2(ReferencesAnyOf, variable1, variable2, "") { return &arg == &variable1 || &arg == &variable2; } TEST(MatcherPnMacroTest, WorksWhenExplicitlyInstantiatedWithReferences) { UncopyableFoo foo1('1'), foo2('2'), foo3('3'); const Matcher m = ReferencesAnyOf(foo1, foo2); EXPECT_TRUE(m.Matches(foo1)); EXPECT_TRUE(m.Matches(foo2)); EXPECT_FALSE(m.Matches(foo3)); } TEST(MatcherPnMacroTest, GeneratesCorretDescriptionWhenExplicitlyInstantiatedWithReferences) { UncopyableFoo foo1('1'), foo2('2'); const Matcher m = ReferencesAnyOf(foo1, foo2); // We don't want the addresses of the parameters printed, as most // likely they will just annoy the user. If the addresses are // interesting, the user should consider passing the parameters by // pointers instead. EXPECT_EQ("references any of (1-byte object <31>, 1-byte object <32>)", Describe(m)); } // Tests that a simple MATCHER_P2() definition works. MATCHER_P2(IsNotInClosedRange, low, hi, "") { return arg < low || arg > hi; } TEST(MatcherPnMacroTest, Works) { const Matcher m = IsNotInClosedRange(10, 20); // NOLINT EXPECT_TRUE(m.Matches(36L)); EXPECT_FALSE(m.Matches(15L)); EXPECT_EQ("is not in closed range (10, 20)", Describe(m)); EXPECT_EQ("not (is not in closed range (10, 20))", DescribeNegation(m)); EXPECT_EQ("", Explain(m, 36L)); EXPECT_EQ("", Explain(m, 15L)); } // Tests that MATCHER*() definitions can be overloaded on the number // of parameters; also tests MATCHER_Pn() where n >= 3. MATCHER(EqualsSumOf, "") { return arg == 0; } MATCHER_P(EqualsSumOf, a, "") { return arg == a; } MATCHER_P2(EqualsSumOf, a, b, "") { return arg == a + b; } MATCHER_P3(EqualsSumOf, a, b, c, "") { return arg == a + b + c; } MATCHER_P4(EqualsSumOf, a, b, c, d, "") { return arg == a + b + c + d; } MATCHER_P5(EqualsSumOf, a, b, c, d, e, "") { return arg == a + b + c + d + e; } MATCHER_P6(EqualsSumOf, a, b, c, d, e, f, "") { return arg == a + b + c + d + e + f; } MATCHER_P7(EqualsSumOf, a, b, c, d, e, f, g, "") { return arg == a + b + c + d + e + f + g; } MATCHER_P8(EqualsSumOf, a, b, c, d, e, f, g, h, "") { return arg == a + b + c + d + e + f + g + h; } MATCHER_P9(EqualsSumOf, a, b, c, d, e, f, g, h, i, "") { return arg == a + b + c + d + e + f + g + h + i; } MATCHER_P10(EqualsSumOf, a, b, c, d, e, f, g, h, i, j, "") { return arg == a + b + c + d + e + f + g + h + i + j; } TEST(MatcherPnMacroTest, CanBeOverloadedOnNumberOfParameters) { EXPECT_THAT(0, EqualsSumOf()); EXPECT_THAT(1, EqualsSumOf(1)); EXPECT_THAT(12, EqualsSumOf(10, 2)); EXPECT_THAT(123, EqualsSumOf(100, 20, 3)); EXPECT_THAT(1234, EqualsSumOf(1000, 200, 30, 4)); EXPECT_THAT(12345, EqualsSumOf(10000, 2000, 300, 40, 5)); EXPECT_THAT("abcdef", EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f')); EXPECT_THAT("abcdefg", EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g')); EXPECT_THAT("abcdefgh", EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h")); EXPECT_THAT("abcdefghi", EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h", 'i')); EXPECT_THAT("abcdefghij", EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h", 'i', ::std::string("j"))); EXPECT_THAT(1, Not(EqualsSumOf())); EXPECT_THAT(-1, Not(EqualsSumOf(1))); EXPECT_THAT(-12, Not(EqualsSumOf(10, 2))); EXPECT_THAT(-123, Not(EqualsSumOf(100, 20, 3))); EXPECT_THAT(-1234, Not(EqualsSumOf(1000, 200, 30, 4))); EXPECT_THAT(-12345, Not(EqualsSumOf(10000, 2000, 300, 40, 5))); EXPECT_THAT("abcdef ", Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f'))); EXPECT_THAT("abcdefg ", Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g'))); EXPECT_THAT("abcdefgh ", Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h"))); EXPECT_THAT("abcdefghi ", Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h", 'i'))); EXPECT_THAT("abcdefghij ", Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g', "h", 'i', ::std::string("j")))); } // Tests that a MATCHER_Pn() definition can be instantiated with any // compatible parameter types. TEST(MatcherPnMacroTest, WorksForDifferentParameterTypes) { EXPECT_THAT(123, EqualsSumOf(100L, 20, static_cast(3))); EXPECT_THAT("abcd", EqualsSumOf(::std::string("a"), "b", 'c', "d")); EXPECT_THAT(124, Not(EqualsSumOf(100L, 20, static_cast(3)))); EXPECT_THAT("abcde", Not(EqualsSumOf(::std::string("a"), "b", 'c', "d"))); } // Tests that the matcher body can promote the parameter types. MATCHER_P2(EqConcat, prefix, suffix, "") { // The following lines promote the two parameters to desired types. std::string prefix_str(prefix); char suffix_char = static_cast(suffix); return arg == prefix_str + suffix_char; } TEST(MatcherPnMacroTest, SimpleTypePromotion) { Matcher no_promo = EqConcat(std::string("foo"), 't'); Matcher promo = EqConcat("foo", static_cast('t')); EXPECT_FALSE(no_promo.Matches("fool")); EXPECT_FALSE(promo.Matches("fool")); EXPECT_TRUE(no_promo.Matches("foot")); EXPECT_TRUE(promo.Matches("foot")); } // Verifies the type of a MATCHER*. TEST(MatcherPnMacroTest, TypesAreCorrect) { // EqualsSumOf() must be assignable to a EqualsSumOfMatcher variable. EqualsSumOfMatcher a0 = EqualsSumOf(); // EqualsSumOf(1) must be assignable to a EqualsSumOfMatcherP variable. EqualsSumOfMatcherP a1 = EqualsSumOf(1); // EqualsSumOf(p1, ..., pk) must be assignable to a EqualsSumOfMatcherPk // variable, and so on. EqualsSumOfMatcherP2 a2 = EqualsSumOf(1, '2'); EqualsSumOfMatcherP3 a3 = EqualsSumOf(1, 2, '3'); EqualsSumOfMatcherP4 a4 = EqualsSumOf(1, 2, 3, '4'); EqualsSumOfMatcherP5 a5 = EqualsSumOf(1, 2, 3, 4, '5'); EqualsSumOfMatcherP6 a6 = EqualsSumOf(1, 2, 3, 4, 5, '6'); EqualsSumOfMatcherP7 a7 = EqualsSumOf(1, 2, 3, 4, 5, 6, '7'); EqualsSumOfMatcherP8 a8 = EqualsSumOf(1, 2, 3, 4, 5, 6, 7, '8'); EqualsSumOfMatcherP9 a9 = EqualsSumOf(1, 2, 3, 4, 5, 6, 7, 8, '9'); EqualsSumOfMatcherP10 a10 = EqualsSumOf(1, 2, 3, 4, 5, 6, 7, 8, 9, '0'); } // Tests that matcher-typed parameters can be used in Value() inside a // MATCHER_Pn definition. // Succeeds if arg matches exactly 2 of the 3 matchers. MATCHER_P3(TwoOf, m1, m2, m3, "") { const int count = static_cast(Value(arg, m1)) + static_cast(Value(arg, m2)) + static_cast(Value(arg, m3)); return count == 2; } TEST(MatcherPnMacroTest, CanUseMatcherTypedParameterInValue) { EXPECT_THAT(42, TwoOf(Gt(0), Lt(50), Eq(10))); EXPECT_THAT(0, Not(TwoOf(Gt(-1), Lt(1), Eq(0)))); } // Tests Contains(). TEST(ContainsTest, ListMatchesWhenElementIsInContainer) { list some_list; some_list.push_back(3); some_list.push_back(1); some_list.push_back(2); EXPECT_THAT(some_list, Contains(1)); EXPECT_THAT(some_list, Contains(Gt(2.5))); EXPECT_THAT(some_list, Contains(Eq(2.0f))); list another_list; another_list.push_back("fee"); another_list.push_back("fie"); another_list.push_back("foe"); another_list.push_back("fum"); EXPECT_THAT(another_list, Contains(string("fee"))); } TEST(ContainsTest, ListDoesNotMatchWhenElementIsNotInContainer) { list some_list; some_list.push_back(3); some_list.push_back(1); EXPECT_THAT(some_list, Not(Contains(4))); } TEST(ContainsTest, SetMatchesWhenElementIsInContainer) { set some_set; some_set.insert(3); some_set.insert(1); some_set.insert(2); EXPECT_THAT(some_set, Contains(Eq(1.0))); EXPECT_THAT(some_set, Contains(Eq(3.0f))); EXPECT_THAT(some_set, Contains(2)); set another_set; another_set.insert("fee"); another_set.insert("fie"); another_set.insert("foe"); another_set.insert("fum"); EXPECT_THAT(another_set, Contains(Eq(string("fum")))); } TEST(ContainsTest, SetDoesNotMatchWhenElementIsNotInContainer) { set some_set; some_set.insert(3); some_set.insert(1); EXPECT_THAT(some_set, Not(Contains(4))); set c_string_set; c_string_set.insert("hello"); EXPECT_THAT(c_string_set, Not(Contains(string("hello").c_str()))); } TEST(ContainsTest, ExplainsMatchResultCorrectly) { const int a[2] = { 1, 2 }; Matcher m = Contains(2); EXPECT_EQ("whose element #1 matches", Explain(m, a)); m = Contains(3); EXPECT_EQ("", Explain(m, a)); m = Contains(GreaterThan(0)); EXPECT_EQ("whose element #0 matches, which is 1 more than 0", Explain(m, a)); m = Contains(GreaterThan(10)); EXPECT_EQ("", Explain(m, a)); } TEST(ContainsTest, DescribesItselfCorrectly) { Matcher > m = Contains(1); EXPECT_EQ("contains at least one element that is equal to 1", Describe(m)); Matcher > m2 = Not(m); EXPECT_EQ("doesn't contain any element that is equal to 1", Describe(m2)); } TEST(ContainsTest, MapMatchesWhenElementIsInContainer) { map my_map; const char* bar = "a string"; my_map[bar] = 2; EXPECT_THAT(my_map, Contains(pair(bar, 2))); map another_map; another_map["fee"] = 1; another_map["fie"] = 2; another_map["foe"] = 3; another_map["fum"] = 4; EXPECT_THAT(another_map, Contains(pair(string("fee"), 1))); EXPECT_THAT(another_map, Contains(pair("fie", 2))); } TEST(ContainsTest, MapDoesNotMatchWhenElementIsNotInContainer) { map some_map; some_map[1] = 11; some_map[2] = 22; EXPECT_THAT(some_map, Not(Contains(pair(2, 23)))); } TEST(ContainsTest, ArrayMatchesWhenElementIsInContainer) { const char* string_array[] = { "fee", "fie", "foe", "fum" }; EXPECT_THAT(string_array, Contains(Eq(string("fum")))); } TEST(ContainsTest, ArrayDoesNotMatchWhenElementIsNotInContainer) { int int_array[] = { 1, 2, 3, 4 }; EXPECT_THAT(int_array, Not(Contains(5))); } TEST(ContainsTest, AcceptsMatcher) { const int a[] = { 1, 2, 3 }; EXPECT_THAT(a, Contains(Gt(2))); EXPECT_THAT(a, Not(Contains(Gt(4)))); } TEST(ContainsTest, WorksForNativeArrayAsTuple) { const int a[] = { 1, 2 }; const int* const pointer = a; EXPECT_THAT(make_tuple(pointer, 2), Contains(1)); EXPECT_THAT(make_tuple(pointer, 2), Not(Contains(Gt(3)))); } TEST(ContainsTest, WorksForTwoDimensionalNativeArray) { int a[][3] = { { 1, 2, 3 }, { 4, 5, 6 } }; EXPECT_THAT(a, Contains(ElementsAre(4, 5, 6))); EXPECT_THAT(a, Contains(Contains(5))); EXPECT_THAT(a, Not(Contains(ElementsAre(3, 4, 5)))); EXPECT_THAT(a, Contains(Not(Contains(5)))); } namespace adl_test { // Verifies that the implementation of ::testing::AllOf and ::testing::AnyOf // don't issue unqualified recursive calls. If they do, the argument dependent // name lookup will cause AllOf/AnyOf in the 'adl_test' namespace to be found // as a candidate and the compilation will break due to an ambiguous overload. // The matcher must be in the same namespace as AllOf/AnyOf to make argument // dependent lookup find those. MATCHER(M, "") { return true; } template bool AllOf(const T1& t1, const T2& t2) { return true; } TEST(AllOfTest, DoesNotCallAllOfUnqualified) { EXPECT_THAT(42, testing::AllOf( M(), M(), M(), M(), M(), M(), M(), M(), M(), M())); } template bool AnyOf(const T1& t1, const T2& t2) { return true; } TEST(AnyOfTest, DoesNotCallAnyOfUnqualified) { EXPECT_THAT(42, testing::AnyOf( M(), M(), M(), M(), M(), M(), M(), M(), M(), M())); } } // namespace adl_test #ifdef _MSC_VER # pragma warning(pop) #endif } // namespace synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-internal-utils_test.cc0000600000175000017500000005446011561126632026020 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the internal utilities. #include "gmock/internal/gmock-internal-utils.h" #include #include #include #include #include #include "gmock/gmock.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" #if GTEST_OS_CYGWIN # include // For ssize_t. NOLINT #endif class ProtocolMessage; namespace proto2 { class Message; } // namespace proto2 namespace testing { namespace internal { namespace { using ::std::tr1::make_tuple; using ::std::tr1::tuple; TEST(ConvertIdentifierNameToWordsTest, WorksWhenNameContainsNoWord) { EXPECT_EQ("", ConvertIdentifierNameToWords("")); EXPECT_EQ("", ConvertIdentifierNameToWords("_")); EXPECT_EQ("", ConvertIdentifierNameToWords("__")); } TEST(ConvertIdentifierNameToWordsTest, WorksWhenNameContainsDigits) { EXPECT_EQ("1", ConvertIdentifierNameToWords("_1")); EXPECT_EQ("2", ConvertIdentifierNameToWords("2_")); EXPECT_EQ("34", ConvertIdentifierNameToWords("_34_")); EXPECT_EQ("34 56", ConvertIdentifierNameToWords("_34_56")); } TEST(ConvertIdentifierNameToWordsTest, WorksWhenNameContainsCamelCaseWords) { EXPECT_EQ("a big word", ConvertIdentifierNameToWords("ABigWord")); EXPECT_EQ("foo bar", ConvertIdentifierNameToWords("FooBar")); EXPECT_EQ("foo", ConvertIdentifierNameToWords("Foo_")); EXPECT_EQ("foo bar", ConvertIdentifierNameToWords("_Foo_Bar_")); EXPECT_EQ("foo and bar", ConvertIdentifierNameToWords("_Foo__And_Bar")); } TEST(ConvertIdentifierNameToWordsTest, WorksWhenNameContains_SeparatedWords) { EXPECT_EQ("foo bar", ConvertIdentifierNameToWords("foo_bar")); EXPECT_EQ("foo", ConvertIdentifierNameToWords("_foo_")); EXPECT_EQ("foo bar", ConvertIdentifierNameToWords("_foo_bar_")); EXPECT_EQ("foo and bar", ConvertIdentifierNameToWords("_foo__and_bar")); } TEST(ConvertIdentifierNameToWordsTest, WorksWhenNameIsMixture) { EXPECT_EQ("foo bar 123", ConvertIdentifierNameToWords("Foo_bar123")); EXPECT_EQ("chapter 11 section 1", ConvertIdentifierNameToWords("_Chapter11Section_1_")); } TEST(PointeeOfTest, WorksForSmartPointers) { CompileAssertTypesEqual >::type>(); } TEST(PointeeOfTest, WorksForRawPointers) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } TEST(GetRawPointerTest, WorksForSmartPointers) { const char* const raw_p4 = new const char('a'); // NOLINT const internal::linked_ptr p4(raw_p4); EXPECT_EQ(raw_p4, GetRawPointer(p4)); } TEST(GetRawPointerTest, WorksForRawPointers) { int* p = NULL; // Don't use EXPECT_EQ as no NULL-testing magic on Symbian. EXPECT_TRUE(NULL == GetRawPointer(p)); int n = 1; EXPECT_EQ(&n, GetRawPointer(&n)); } // Tests KindOf. class Base {}; class Derived : public Base {}; TEST(KindOfTest, Bool) { EXPECT_EQ(kBool, GMOCK_KIND_OF_(bool)); // NOLINT } TEST(KindOfTest, Integer) { EXPECT_EQ(kInteger, GMOCK_KIND_OF_(char)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(signed char)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(unsigned char)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(short)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(unsigned short)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(int)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(unsigned int)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(long)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(unsigned long)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(wchar_t)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(Int64)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(UInt64)); // NOLINT EXPECT_EQ(kInteger, GMOCK_KIND_OF_(size_t)); // NOLINT #if GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN // ssize_t is not defined on Windows and possibly some other OSes. EXPECT_EQ(kInteger, GMOCK_KIND_OF_(ssize_t)); // NOLINT #endif } TEST(KindOfTest, FloatingPoint) { EXPECT_EQ(kFloatingPoint, GMOCK_KIND_OF_(float)); // NOLINT EXPECT_EQ(kFloatingPoint, GMOCK_KIND_OF_(double)); // NOLINT EXPECT_EQ(kFloatingPoint, GMOCK_KIND_OF_(long double)); // NOLINT } TEST(KindOfTest, Other) { EXPECT_EQ(kOther, GMOCK_KIND_OF_(void*)); // NOLINT EXPECT_EQ(kOther, GMOCK_KIND_OF_(char**)); // NOLINT EXPECT_EQ(kOther, GMOCK_KIND_OF_(Base)); // NOLINT } // Tests LosslessArithmeticConvertible. TEST(LosslessArithmeticConvertibleTest, BoolToBool) { EXPECT_TRUE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, BoolToInteger) { EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE( (LosslessArithmeticConvertible::value)); // NOLINT } TEST(LosslessArithmeticConvertibleTest, BoolToFloatingPoint) { EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, IntegerToBool) { EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, IntegerToInteger) { // Unsigned => larger signed is fine. EXPECT_TRUE((LosslessArithmeticConvertible::value)); // Unsigned => larger unsigned is fine. EXPECT_TRUE( (LosslessArithmeticConvertible::value)); // NOLINT // Signed => unsigned is not fine. EXPECT_FALSE((LosslessArithmeticConvertible::value)); // NOLINT EXPECT_FALSE((LosslessArithmeticConvertible< signed char, unsigned int>::value)); // NOLINT // Same size and same signedness: fine too. EXPECT_TRUE((LosslessArithmeticConvertible< unsigned char, unsigned char>::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible< unsigned long, unsigned long>::value)); // NOLINT // Same size, different signedness: not fine. EXPECT_FALSE((LosslessArithmeticConvertible< unsigned char, signed char>::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); // Larger size => smaller size is not fine. EXPECT_FALSE((LosslessArithmeticConvertible::value)); // NOLINT EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, IntegerToFloatingPoint) { // Integers cannot be losslessly converted to floating-points, as // the format of the latter is implementation-defined. EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible< short, long double>::value)); // NOLINT } TEST(LosslessArithmeticConvertibleTest, FloatingPointToBool) { EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, FloatingPointToInteger) { EXPECT_FALSE((LosslessArithmeticConvertible::value)); // NOLINT EXPECT_FALSE((LosslessArithmeticConvertible::value)); EXPECT_FALSE((LosslessArithmeticConvertible::value)); } TEST(LosslessArithmeticConvertibleTest, FloatingPointToFloatingPoint) { // Smaller size => larger size is fine. EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); // Same size: fine. EXPECT_TRUE((LosslessArithmeticConvertible::value)); EXPECT_TRUE((LosslessArithmeticConvertible::value)); // Larger size => smaller size is not fine. EXPECT_FALSE((LosslessArithmeticConvertible::value)); if (sizeof(double) == sizeof(long double)) { // NOLINT // In some implementations (e.g. MSVC), double and long double // have the same size. EXPECT_TRUE((LosslessArithmeticConvertible::value)); } else { EXPECT_FALSE((LosslessArithmeticConvertible::value)); } } // Tests the TupleMatches() template function. TEST(TupleMatchesTest, WorksForSize0) { tuple<> matchers; tuple<> values; EXPECT_TRUE(TupleMatches(matchers, values)); } TEST(TupleMatchesTest, WorksForSize1) { tuple > matchers(Eq(1)); tuple values1(1), values2(2); EXPECT_TRUE(TupleMatches(matchers, values1)); EXPECT_FALSE(TupleMatches(matchers, values2)); } TEST(TupleMatchesTest, WorksForSize2) { tuple, Matcher > matchers(Eq(1), Eq('a')); tuple values1(1, 'a'), values2(1, 'b'), values3(2, 'a'), values4(2, 'b'); EXPECT_TRUE(TupleMatches(matchers, values1)); EXPECT_FALSE(TupleMatches(matchers, values2)); EXPECT_FALSE(TupleMatches(matchers, values3)); EXPECT_FALSE(TupleMatches(matchers, values4)); } TEST(TupleMatchesTest, WorksForSize5) { tuple, Matcher, Matcher, Matcher, // NOLINT Matcher > matchers(Eq(1), Eq('a'), Eq(true), Eq(2L), Eq("hi")); tuple // NOLINT values1(1, 'a', true, 2L, "hi"), values2(1, 'a', true, 2L, "hello"), values3(2, 'a', true, 2L, "hi"); EXPECT_TRUE(TupleMatches(matchers, values1)); EXPECT_FALSE(TupleMatches(matchers, values2)); EXPECT_FALSE(TupleMatches(matchers, values3)); } // Tests that Assert(true, ...) succeeds. TEST(AssertTest, SucceedsOnTrue) { Assert(true, __FILE__, __LINE__, "This should succeed."); Assert(true, __FILE__, __LINE__); // This should succeed too. } // Tests that Assert(false, ...) generates a fatal failure. TEST(AssertTest, FailsFatallyOnFalse) { EXPECT_DEATH_IF_SUPPORTED({ Assert(false, __FILE__, __LINE__, "This should fail."); }, ""); EXPECT_DEATH_IF_SUPPORTED({ Assert(false, __FILE__, __LINE__); }, ""); } // Tests that Expect(true, ...) succeeds. TEST(ExpectTest, SucceedsOnTrue) { Expect(true, __FILE__, __LINE__, "This should succeed."); Expect(true, __FILE__, __LINE__); // This should succeed too. } // Tests that Expect(false, ...) generates a non-fatal failure. TEST(ExpectTest, FailsNonfatallyOnFalse) { EXPECT_NONFATAL_FAILURE({ // NOLINT Expect(false, __FILE__, __LINE__, "This should fail."); }, "This should fail"); EXPECT_NONFATAL_FAILURE({ // NOLINT Expect(false, __FILE__, __LINE__); }, "Expectation failed"); } // Tests LogIsVisible(). class LogIsVisibleTest : public ::testing::Test { protected: virtual void SetUp() { // The code needs to work when both ::string and ::std::string are // defined and the flag is implemented as a // testing::internal::String. In this case, without the call to // c_str(), the compiler will complain that it cannot figure out // whether the String flag should be converted to a ::string or an // ::std::string before being assigned to original_verbose_. original_verbose_ = GMOCK_FLAG(verbose).c_str(); } virtual void TearDown() { GMOCK_FLAG(verbose) = original_verbose_; } string original_verbose_; }; TEST_F(LogIsVisibleTest, AlwaysReturnsTrueIfVerbosityIsInfo) { GMOCK_FLAG(verbose) = kInfoVerbosity; EXPECT_TRUE(LogIsVisible(INFO)); EXPECT_TRUE(LogIsVisible(WARNING)); } TEST_F(LogIsVisibleTest, AlwaysReturnsFalseIfVerbosityIsError) { GMOCK_FLAG(verbose) = kErrorVerbosity; EXPECT_FALSE(LogIsVisible(INFO)); EXPECT_FALSE(LogIsVisible(WARNING)); } TEST_F(LogIsVisibleTest, WorksWhenVerbosityIsWarning) { GMOCK_FLAG(verbose) = kWarningVerbosity; EXPECT_FALSE(LogIsVisible(INFO)); EXPECT_TRUE(LogIsVisible(WARNING)); } #if GTEST_HAS_STREAM_REDIRECTION // Tests the Log() function. // Verifies that Log() behaves correctly for the given verbosity level // and log severity. void TestLogWithSeverity(const string& verbosity, LogSeverity severity, bool should_print) { const string old_flag = GMOCK_FLAG(verbose); GMOCK_FLAG(verbose) = verbosity; CaptureStdout(); Log(severity, "Test log.\n", 0); if (should_print) { EXPECT_THAT(GetCapturedStdout().c_str(), ContainsRegex( severity == WARNING ? "^\nGMOCK WARNING:\nTest log\\.\nStack trace:\n" : "^\nTest log\\.\nStack trace:\n")); } else { EXPECT_STREQ("", GetCapturedStdout().c_str()); } GMOCK_FLAG(verbose) = old_flag; } // Tests that when the stack_frames_to_skip parameter is negative, // Log() doesn't include the stack trace in the output. TEST(LogTest, NoStackTraceWhenStackFramesToSkipIsNegative) { const string saved_flag = GMOCK_FLAG(verbose); GMOCK_FLAG(verbose) = kInfoVerbosity; CaptureStdout(); Log(INFO, "Test log.\n", -1); EXPECT_STREQ("\nTest log.\n", GetCapturedStdout().c_str()); GMOCK_FLAG(verbose) = saved_flag; } // Tests that in opt mode, a positive stack_frames_to_skip argument is // treated as 0. TEST(LogTest, NoSkippingStackFrameInOptMode) { CaptureStdout(); Log(WARNING, "Test log.\n", 100); const String log = GetCapturedStdout(); # if defined(NDEBUG) && GTEST_GOOGLE3_MODE_ // In opt mode, no stack frame should be skipped. EXPECT_THAT(log, ContainsRegex("\nGMOCK WARNING:\n" "Test log\\.\n" "Stack trace:\n" ".+")); # else // In dbg mode, the stack frames should be skipped. EXPECT_STREQ("\nGMOCK WARNING:\n" "Test log.\n" "Stack trace:\n", log.c_str()); # endif } // Tests that all logs are printed when the value of the // --gmock_verbose flag is "info". TEST(LogTest, AllLogsArePrintedWhenVerbosityIsInfo) { TestLogWithSeverity(kInfoVerbosity, INFO, true); TestLogWithSeverity(kInfoVerbosity, WARNING, true); } // Tests that only warnings are printed when the value of the // --gmock_verbose flag is "warning". TEST(LogTest, OnlyWarningsArePrintedWhenVerbosityIsWarning) { TestLogWithSeverity(kWarningVerbosity, INFO, false); TestLogWithSeverity(kWarningVerbosity, WARNING, true); } // Tests that no logs are printed when the value of the // --gmock_verbose flag is "error". TEST(LogTest, NoLogsArePrintedWhenVerbosityIsError) { TestLogWithSeverity(kErrorVerbosity, INFO, false); TestLogWithSeverity(kErrorVerbosity, WARNING, false); } // Tests that only warnings are printed when the value of the // --gmock_verbose flag is invalid. TEST(LogTest, OnlyWarningsArePrintedWhenVerbosityIsInvalid) { TestLogWithSeverity("invalid", INFO, false); TestLogWithSeverity("invalid", WARNING, true); } #endif // GTEST_HAS_STREAM_REDIRECTION TEST(TypeTraitsTest, true_type) { EXPECT_TRUE(true_type::value); } TEST(TypeTraitsTest, false_type) { EXPECT_FALSE(false_type::value); } TEST(TypeTraitsTest, is_reference) { EXPECT_FALSE(is_reference::value); EXPECT_FALSE(is_reference::value); EXPECT_TRUE(is_reference::value); } TEST(TypeTraitsTest, is_pointer) { EXPECT_FALSE(is_pointer::value); EXPECT_FALSE(is_pointer::value); EXPECT_TRUE(is_pointer::value); } TEST(TypeTraitsTest, type_equals) { EXPECT_FALSE((type_equals::value)); EXPECT_FALSE((type_equals::value)); EXPECT_FALSE((type_equals::value)); EXPECT_TRUE((type_equals::value)); } TEST(TypeTraitsTest, remove_reference) { EXPECT_TRUE((type_equals::type>::value)); EXPECT_TRUE((type_equals::type>::value)); EXPECT_TRUE((type_equals::type>::value)); EXPECT_TRUE((type_equals::type>::value)); } #if GTEST_HAS_STREAM_REDIRECTION // Verifies that Log() behaves correctly for the given verbosity level // and log severity. String GrabOutput(void(*logger)(), const char* verbosity) { const string saved_flag = GMOCK_FLAG(verbose); GMOCK_FLAG(verbose) = verbosity; CaptureStdout(); logger(); GMOCK_FLAG(verbose) = saved_flag; return GetCapturedStdout(); } class DummyMock { public: MOCK_METHOD0(TestMethod, void()); MOCK_METHOD1(TestMethodArg, void(int dummy)); }; void ExpectCallLogger() { DummyMock mock; EXPECT_CALL(mock, TestMethod()); mock.TestMethod(); }; // Verifies that EXPECT_CALL logs if the --gmock_verbose flag is set to "info". TEST(ExpectCallTest, LogsWhenVerbosityIsInfo) { EXPECT_THAT(GrabOutput(ExpectCallLogger, kInfoVerbosity), HasSubstr("EXPECT_CALL(mock, TestMethod())")); } // Verifies that EXPECT_CALL doesn't log // if the --gmock_verbose flag is set to "warning". TEST(ExpectCallTest, DoesNotLogWhenVerbosityIsWarning) { EXPECT_STREQ("", GrabOutput(ExpectCallLogger, kWarningVerbosity).c_str()); } // Verifies that EXPECT_CALL doesn't log // if the --gmock_verbose flag is set to "error". TEST(ExpectCallTest, DoesNotLogWhenVerbosityIsError) { EXPECT_STREQ("", GrabOutput(ExpectCallLogger, kErrorVerbosity).c_str()); } void OnCallLogger() { DummyMock mock; ON_CALL(mock, TestMethod()); }; // Verifies that ON_CALL logs if the --gmock_verbose flag is set to "info". TEST(OnCallTest, LogsWhenVerbosityIsInfo) { EXPECT_THAT(GrabOutput(OnCallLogger, kInfoVerbosity), HasSubstr("ON_CALL(mock, TestMethod())")); } // Verifies that ON_CALL doesn't log // if the --gmock_verbose flag is set to "warning". TEST(OnCallTest, DoesNotLogWhenVerbosityIsWarning) { EXPECT_STREQ("", GrabOutput(OnCallLogger, kWarningVerbosity).c_str()); } // Verifies that ON_CALL doesn't log if // the --gmock_verbose flag is set to "error". TEST(OnCallTest, DoesNotLogWhenVerbosityIsError) { EXPECT_STREQ("", GrabOutput(OnCallLogger, kErrorVerbosity).c_str()); } void OnCallAnyArgumentLogger() { DummyMock mock; ON_CALL(mock, TestMethodArg(_)); } // Verifies that ON_CALL prints provided _ argument. TEST(OnCallTest, LogsAnythingArgument) { EXPECT_THAT(GrabOutput(OnCallAnyArgumentLogger, kInfoVerbosity), HasSubstr("ON_CALL(mock, TestMethodArg(_)")); } #endif // GTEST_HAS_STREAM_REDIRECTION // Tests StlContainerView. TEST(StlContainerViewTest, WorksForStlContainer) { StaticAssertTypeEq, StlContainerView >::type>(); StaticAssertTypeEq&, StlContainerView >::const_reference>(); typedef std::vector Chars; Chars v1; const Chars& v2(StlContainerView::ConstReference(v1)); EXPECT_EQ(&v1, &v2); v1.push_back('a'); Chars v3 = StlContainerView::Copy(v1); EXPECT_THAT(v3, Eq(v3)); } TEST(StlContainerViewTest, WorksForStaticNativeArray) { StaticAssertTypeEq, StlContainerView::type>(); StaticAssertTypeEq, StlContainerView::type>(); StaticAssertTypeEq, StlContainerView::type>(); StaticAssertTypeEq, StlContainerView::const_reference>(); int a1[3] = { 0, 1, 2 }; NativeArray a2 = StlContainerView::ConstReference(a1); EXPECT_EQ(3U, a2.size()); EXPECT_EQ(a1, a2.begin()); const NativeArray a3 = StlContainerView::Copy(a1); ASSERT_EQ(3U, a3.size()); EXPECT_EQ(0, a3.begin()[0]); EXPECT_EQ(1, a3.begin()[1]); EXPECT_EQ(2, a3.begin()[2]); // Makes sure a1 and a3 aren't aliases. a1[0] = 3; EXPECT_EQ(0, a3.begin()[0]); } TEST(StlContainerViewTest, WorksForDynamicNativeArray) { StaticAssertTypeEq, StlContainerView >::type>(); StaticAssertTypeEq, StlContainerView, int> >::type>(); StaticAssertTypeEq, StlContainerView >::const_reference>(); int a1[3] = { 0, 1, 2 }; const int* const p1 = a1; NativeArray a2 = StlContainerView >:: ConstReference(make_tuple(p1, 3)); EXPECT_EQ(3U, a2.size()); EXPECT_EQ(a1, a2.begin()); const NativeArray a3 = StlContainerView >:: Copy(make_tuple(static_cast(a1), 3)); ASSERT_EQ(3U, a3.size()); EXPECT_EQ(0, a3.begin()[0]); EXPECT_EQ(1, a3.begin()[1]); EXPECT_EQ(2, a3.begin()[2]); // Makes sure a1 and a3 aren't aliases. a1[0] = 3; EXPECT_EQ(0, a3.begin()[0]); } } // namespace } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-matchers_test.cc0000600000175000017500000037016711561126632024661 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests some commonly used argument matchers. #include "gmock/gmock-matchers.h" #include #include #include #include #include #include #include #include #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" namespace testing { namespace internal { string JoinAsTuple(const Strings& fields); } // namespace internal namespace gmock_matchers_test { using std::list; using std::make_pair; using std::map; using std::multimap; using std::multiset; using std::ostream; using std::pair; using std::set; using std::stringstream; using std::tr1::get; using std::tr1::make_tuple; using std::tr1::tuple; using std::vector; using testing::A; using testing::AllArgs; using testing::AllOf; using testing::An; using testing::AnyOf; using testing::ByRef; using testing::ContainsRegex; using testing::DoubleEq; using testing::EndsWith; using testing::Eq; using testing::ExplainMatchResult; using testing::Field; using testing::FloatEq; using testing::Ge; using testing::Gt; using testing::HasSubstr; using testing::IsNull; using testing::Key; using testing::Le; using testing::Lt; using testing::MakeMatcher; using testing::MakePolymorphicMatcher; using testing::MatchResultListener; using testing::Matcher; using testing::MatcherCast; using testing::MatcherInterface; using testing::Matches; using testing::MatchesRegex; using testing::NanSensitiveDoubleEq; using testing::NanSensitiveFloatEq; using testing::Ne; using testing::Not; using testing::NotNull; using testing::Pair; using testing::Pointee; using testing::Pointwise; using testing::PolymorphicMatcher; using testing::Property; using testing::Ref; using testing::ResultOf; using testing::StartsWith; using testing::StrCaseEq; using testing::StrCaseNe; using testing::StrEq; using testing::StrNe; using testing::Truly; using testing::TypedEq; using testing::Value; using testing::_; using testing::internal::DummyMatchResultListener; using testing::internal::ExplainMatchFailureTupleTo; using testing::internal::FloatingEqMatcher; using testing::internal::FormatMatcherDescription; using testing::internal::IsReadableTypeName; using testing::internal::JoinAsTuple; using testing::internal::RE; using testing::internal::StreamMatchResultListener; using testing::internal::String; using testing::internal::StringMatchResultListener; using testing::internal::Strings; using testing::internal::linked_ptr; using testing::internal::scoped_ptr; using testing::internal::string; // For testing ExplainMatchResultTo(). class GreaterThanMatcher : public MatcherInterface { public: explicit GreaterThanMatcher(int rhs) : rhs_(rhs) {} virtual void DescribeTo(ostream* os) const { *os << "is > " << rhs_; } virtual bool MatchAndExplain(int lhs, MatchResultListener* listener) const { const int diff = lhs - rhs_; if (diff > 0) { *listener << "which is " << diff << " more than " << rhs_; } else if (diff == 0) { *listener << "which is the same as " << rhs_; } else { *listener << "which is " << -diff << " less than " << rhs_; } return lhs > rhs_; } private: int rhs_; }; Matcher GreaterThan(int n) { return MakeMatcher(new GreaterThanMatcher(n)); } string OfType(const string& type_name) { #if GTEST_HAS_RTTI return " (of type " + type_name + ")"; #else return ""; #endif } // Returns the description of the given matcher. template string Describe(const Matcher& m) { stringstream ss; m.DescribeTo(&ss); return ss.str(); } // Returns the description of the negation of the given matcher. template string DescribeNegation(const Matcher& m) { stringstream ss; m.DescribeNegationTo(&ss); return ss.str(); } // Returns the reason why x matches, or doesn't match, m. template string Explain(const MatcherType& m, const Value& x) { StringMatchResultListener listener; ExplainMatchResult(m, x, &listener); return listener.str(); } TEST(MatchResultListenerTest, StreamingWorks) { StringMatchResultListener listener; listener << "hi" << 5; EXPECT_EQ("hi5", listener.str()); // Streaming shouldn't crash when the underlying ostream is NULL. DummyMatchResultListener dummy; dummy << "hi" << 5; } TEST(MatchResultListenerTest, CanAccessUnderlyingStream) { EXPECT_TRUE(DummyMatchResultListener().stream() == NULL); EXPECT_TRUE(StreamMatchResultListener(NULL).stream() == NULL); EXPECT_EQ(&std::cout, StreamMatchResultListener(&std::cout).stream()); } TEST(MatchResultListenerTest, IsInterestedWorks) { EXPECT_TRUE(StringMatchResultListener().IsInterested()); EXPECT_TRUE(StreamMatchResultListener(&std::cout).IsInterested()); EXPECT_FALSE(DummyMatchResultListener().IsInterested()); EXPECT_FALSE(StreamMatchResultListener(NULL).IsInterested()); } // Makes sure that the MatcherInterface interface doesn't // change. class EvenMatcherImpl : public MatcherInterface { public: virtual bool MatchAndExplain(int x, MatchResultListener* /* listener */) const { return x % 2 == 0; } virtual void DescribeTo(ostream* os) const { *os << "is an even number"; } // We deliberately don't define DescribeNegationTo() and // ExplainMatchResultTo() here, to make sure the definition of these // two methods is optional. }; // Makes sure that the MatcherInterface API doesn't change. TEST(MatcherInterfaceTest, CanBeImplementedUsingPublishedAPI) { EvenMatcherImpl m; } // Tests implementing a monomorphic matcher using MatchAndExplain(). class NewEvenMatcherImpl : public MatcherInterface { public: virtual bool MatchAndExplain(int x, MatchResultListener* listener) const { const bool match = x % 2 == 0; // Verifies that we can stream to a listener directly. *listener << "value % " << 2; if (listener->stream() != NULL) { // Verifies that we can stream to a listener's underlying stream // too. *listener->stream() << " == " << (x % 2); } return match; } virtual void DescribeTo(ostream* os) const { *os << "is an even number"; } }; TEST(MatcherInterfaceTest, CanBeImplementedUsingNewAPI) { Matcher m = MakeMatcher(new NewEvenMatcherImpl); EXPECT_TRUE(m.Matches(2)); EXPECT_FALSE(m.Matches(3)); EXPECT_EQ("value % 2 == 0", Explain(m, 2)); EXPECT_EQ("value % 2 == 1", Explain(m, 3)); } // Tests default-constructing a matcher. TEST(MatcherTest, CanBeDefaultConstructed) { Matcher m; } // Tests that Matcher can be constructed from a MatcherInterface*. TEST(MatcherTest, CanBeConstructedFromMatcherInterface) { const MatcherInterface* impl = new EvenMatcherImpl; Matcher m(impl); EXPECT_TRUE(m.Matches(4)); EXPECT_FALSE(m.Matches(5)); } // Tests that value can be used in place of Eq(value). TEST(MatcherTest, CanBeImplicitlyConstructedFromValue) { Matcher m1 = 5; EXPECT_TRUE(m1.Matches(5)); EXPECT_FALSE(m1.Matches(6)); } // Tests that NULL can be used in place of Eq(NULL). TEST(MatcherTest, CanBeImplicitlyConstructedFromNULL) { Matcher m1 = NULL; EXPECT_TRUE(m1.Matches(NULL)); int n = 0; EXPECT_FALSE(m1.Matches(&n)); } // Tests that matchers are copyable. TEST(MatcherTest, IsCopyable) { // Tests the copy constructor. Matcher m1 = Eq(false); EXPECT_TRUE(m1.Matches(false)); EXPECT_FALSE(m1.Matches(true)); // Tests the assignment operator. m1 = Eq(true); EXPECT_TRUE(m1.Matches(true)); EXPECT_FALSE(m1.Matches(false)); } // Tests that Matcher::DescribeTo() calls // MatcherInterface::DescribeTo(). TEST(MatcherTest, CanDescribeItself) { EXPECT_EQ("is an even number", Describe(Matcher(new EvenMatcherImpl))); } // Tests Matcher::MatchAndExplain(). TEST(MatcherTest, MatchAndExplain) { Matcher m = GreaterThan(0); StringMatchResultListener listener1; EXPECT_TRUE(m.MatchAndExplain(42, &listener1)); EXPECT_EQ("which is 42 more than 0", listener1.str()); StringMatchResultListener listener2; EXPECT_FALSE(m.MatchAndExplain(-9, &listener2)); EXPECT_EQ("which is 9 less than 0", listener2.str()); } // Tests that a C-string literal can be implicitly converted to a // Matcher or Matcher. TEST(StringMatcherTest, CanBeImplicitlyConstructedFromCStringLiteral) { Matcher m1 = "hi"; EXPECT_TRUE(m1.Matches("hi")); EXPECT_FALSE(m1.Matches("hello")); Matcher m2 = "hi"; EXPECT_TRUE(m2.Matches("hi")); EXPECT_FALSE(m2.Matches("hello")); } // Tests that a string object can be implicitly converted to a // Matcher or Matcher. TEST(StringMatcherTest, CanBeImplicitlyConstructedFromString) { Matcher m1 = string("hi"); EXPECT_TRUE(m1.Matches("hi")); EXPECT_FALSE(m1.Matches("hello")); Matcher m2 = string("hi"); EXPECT_TRUE(m2.Matches("hi")); EXPECT_FALSE(m2.Matches("hello")); } // Tests that MakeMatcher() constructs a Matcher from a // MatcherInterface* without requiring the user to explicitly // write the type. TEST(MakeMatcherTest, ConstructsMatcherFromMatcherInterface) { const MatcherInterface* dummy_impl = NULL; Matcher m = MakeMatcher(dummy_impl); } // Tests that MakePolymorphicMatcher() can construct a polymorphic // matcher from its implementation using the old API. const int g_bar = 1; class ReferencesBarOrIsZeroImpl { public: template bool MatchAndExplain(const T& x, MatchResultListener* /* listener */) const { const void* p = &x; return p == &g_bar || x == 0; } void DescribeTo(ostream* os) const { *os << "g_bar or zero"; } void DescribeNegationTo(ostream* os) const { *os << "doesn't reference g_bar and is not zero"; } }; // This function verifies that MakePolymorphicMatcher() returns a // PolymorphicMatcher where T is the argument's type. PolymorphicMatcher ReferencesBarOrIsZero() { return MakePolymorphicMatcher(ReferencesBarOrIsZeroImpl()); } TEST(MakePolymorphicMatcherTest, ConstructsMatcherUsingOldAPI) { // Using a polymorphic matcher to match a reference type. Matcher m1 = ReferencesBarOrIsZero(); EXPECT_TRUE(m1.Matches(0)); // Verifies that the identity of a by-reference argument is preserved. EXPECT_TRUE(m1.Matches(g_bar)); EXPECT_FALSE(m1.Matches(1)); EXPECT_EQ("g_bar or zero", Describe(m1)); // Using a polymorphic matcher to match a value type. Matcher m2 = ReferencesBarOrIsZero(); EXPECT_TRUE(m2.Matches(0.0)); EXPECT_FALSE(m2.Matches(0.1)); EXPECT_EQ("g_bar or zero", Describe(m2)); } // Tests implementing a polymorphic matcher using MatchAndExplain(). class PolymorphicIsEvenImpl { public: void DescribeTo(ostream* os) const { *os << "is even"; } void DescribeNegationTo(ostream* os) const { *os << "is odd"; } template bool MatchAndExplain(const T& x, MatchResultListener* listener) const { // Verifies that we can stream to the listener directly. *listener << "% " << 2; if (listener->stream() != NULL) { // Verifies that we can stream to the listener's underlying stream // too. *listener->stream() << " == " << (x % 2); } return (x % 2) == 0; } }; PolymorphicMatcher PolymorphicIsEven() { return MakePolymorphicMatcher(PolymorphicIsEvenImpl()); } TEST(MakePolymorphicMatcherTest, ConstructsMatcherUsingNewAPI) { // Using PolymorphicIsEven() as a Matcher. const Matcher m1 = PolymorphicIsEven(); EXPECT_TRUE(m1.Matches(42)); EXPECT_FALSE(m1.Matches(43)); EXPECT_EQ("is even", Describe(m1)); const Matcher not_m1 = Not(m1); EXPECT_EQ("is odd", Describe(not_m1)); EXPECT_EQ("% 2 == 0", Explain(m1, 42)); // Using PolymorphicIsEven() as a Matcher. const Matcher m2 = PolymorphicIsEven(); EXPECT_TRUE(m2.Matches('\x42')); EXPECT_FALSE(m2.Matches('\x43')); EXPECT_EQ("is even", Describe(m2)); const Matcher not_m2 = Not(m2); EXPECT_EQ("is odd", Describe(not_m2)); EXPECT_EQ("% 2 == 0", Explain(m2, '\x42')); } // Tests that MatcherCast(m) works when m is a polymorphic matcher. TEST(MatcherCastTest, FromPolymorphicMatcher) { Matcher m = MatcherCast(Eq(5)); EXPECT_TRUE(m.Matches(5)); EXPECT_FALSE(m.Matches(6)); } // For testing casting matchers between compatible types. class IntValue { public: // An int can be statically (although not implicitly) cast to a // IntValue. explicit IntValue(int a_value) : value_(a_value) {} int value() const { return value_; } private: int value_; }; // For testing casting matchers between compatible types. bool IsPositiveIntValue(const IntValue& foo) { return foo.value() > 0; } // Tests that MatcherCast(m) works when m is a Matcher where T // can be statically converted to U. TEST(MatcherCastTest, FromCompatibleType) { Matcher m1 = Eq(2.0); Matcher m2 = MatcherCast(m1); EXPECT_TRUE(m2.Matches(2)); EXPECT_FALSE(m2.Matches(3)); Matcher m3 = Truly(IsPositiveIntValue); Matcher m4 = MatcherCast(m3); // In the following, the arguments 1 and 0 are statically converted // to IntValue objects, and then tested by the IsPositiveIntValue() // predicate. EXPECT_TRUE(m4.Matches(1)); EXPECT_FALSE(m4.Matches(0)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(MatcherCastTest, FromConstReferenceToNonReference) { Matcher m1 = Eq(0); Matcher m2 = MatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(MatcherCastTest, FromReferenceToNonReference) { Matcher m1 = Eq(0); Matcher m2 = MatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(MatcherCastTest, FromNonReferenceToConstReference) { Matcher m1 = Eq(0); Matcher m2 = MatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(MatcherCastTest, FromNonReferenceToReference) { Matcher m1 = Eq(0); Matcher m2 = MatcherCast(m1); int n = 0; EXPECT_TRUE(m2.Matches(n)); n = 1; EXPECT_FALSE(m2.Matches(n)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(MatcherCastTest, FromSameType) { Matcher m1 = Eq(0); Matcher m2 = MatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } class Base {}; class Derived : public Base {}; // Tests that SafeMatcherCast(m) works when m is a polymorphic matcher. TEST(SafeMatcherCastTest, FromPolymorphicMatcher) { Matcher m2 = SafeMatcherCast(Eq(32)); EXPECT_TRUE(m2.Matches(' ')); EXPECT_FALSE(m2.Matches('\n')); } // Tests that SafeMatcherCast(m) works when m is a Matcher where // T and U are arithmetic types and T can be losslessly converted to // U. TEST(SafeMatcherCastTest, FromLosslesslyConvertibleArithmeticType) { Matcher m1 = DoubleEq(1.0); Matcher m2 = SafeMatcherCast(m1); EXPECT_TRUE(m2.Matches(1.0f)); EXPECT_FALSE(m2.Matches(2.0f)); Matcher m3 = SafeMatcherCast(TypedEq('a')); EXPECT_TRUE(m3.Matches('a')); EXPECT_FALSE(m3.Matches('b')); } // Tests that SafeMatcherCast(m) works when m is a Matcher where T and U // are pointers or references to a derived and a base class, correspondingly. TEST(SafeMatcherCastTest, FromBaseClass) { Derived d, d2; Matcher m1 = Eq(&d); Matcher m2 = SafeMatcherCast(m1); EXPECT_TRUE(m2.Matches(&d)); EXPECT_FALSE(m2.Matches(&d2)); Matcher m3 = Ref(d); Matcher m4 = SafeMatcherCast(m3); EXPECT_TRUE(m4.Matches(d)); EXPECT_FALSE(m4.Matches(d2)); } // Tests that SafeMatcherCast(m) works when m is a Matcher. TEST(SafeMatcherCastTest, FromConstReferenceToReference) { int n = 0; Matcher m1 = Ref(n); Matcher m2 = SafeMatcherCast(m1); int n1 = 0; EXPECT_TRUE(m2.Matches(n)); EXPECT_FALSE(m2.Matches(n1)); } // Tests that MatcherCast(m) works when m is a Matcher. TEST(SafeMatcherCastTest, FromNonReferenceToConstReference) { Matcher m1 = Eq(0); Matcher m2 = SafeMatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } // Tests that SafeMatcherCast(m) works when m is a Matcher. TEST(SafeMatcherCastTest, FromNonReferenceToReference) { Matcher m1 = Eq(0); Matcher m2 = SafeMatcherCast(m1); int n = 0; EXPECT_TRUE(m2.Matches(n)); n = 1; EXPECT_FALSE(m2.Matches(n)); } // Tests that SafeMatcherCast(m) works when m is a Matcher. TEST(SafeMatcherCastTest, FromSameType) { Matcher m1 = Eq(0); Matcher m2 = SafeMatcherCast(m1); EXPECT_TRUE(m2.Matches(0)); EXPECT_FALSE(m2.Matches(1)); } // Tests that A() matches any value of type T. TEST(ATest, MatchesAnyValue) { // Tests a matcher for a value type. Matcher m1 = A(); EXPECT_TRUE(m1.Matches(91.43)); EXPECT_TRUE(m1.Matches(-15.32)); // Tests a matcher for a reference type. int a = 2; int b = -6; Matcher m2 = A(); EXPECT_TRUE(m2.Matches(a)); EXPECT_TRUE(m2.Matches(b)); } // Tests that A() describes itself properly. TEST(ATest, CanDescribeSelf) { EXPECT_EQ("is anything", Describe(A())); } // Tests that An() matches any value of type T. TEST(AnTest, MatchesAnyValue) { // Tests a matcher for a value type. Matcher m1 = An(); EXPECT_TRUE(m1.Matches(9143)); EXPECT_TRUE(m1.Matches(-1532)); // Tests a matcher for a reference type. int a = 2; int b = -6; Matcher m2 = An(); EXPECT_TRUE(m2.Matches(a)); EXPECT_TRUE(m2.Matches(b)); } // Tests that An() describes itself properly. TEST(AnTest, CanDescribeSelf) { EXPECT_EQ("is anything", Describe(An())); } // Tests that _ can be used as a matcher for any type and matches any // value of that type. TEST(UnderscoreTest, MatchesAnyValue) { // Uses _ as a matcher for a value type. Matcher m1 = _; EXPECT_TRUE(m1.Matches(123)); EXPECT_TRUE(m1.Matches(-242)); // Uses _ as a matcher for a reference type. bool a = false; const bool b = true; Matcher m2 = _; EXPECT_TRUE(m2.Matches(a)); EXPECT_TRUE(m2.Matches(b)); } // Tests that _ describes itself properly. TEST(UnderscoreTest, CanDescribeSelf) { Matcher m = _; EXPECT_EQ("is anything", Describe(m)); } // Tests that Eq(x) matches any value equal to x. TEST(EqTest, MatchesEqualValue) { // 2 C-strings with same content but different addresses. const char a1[] = "hi"; const char a2[] = "hi"; Matcher m1 = Eq(a1); EXPECT_TRUE(m1.Matches(a1)); EXPECT_FALSE(m1.Matches(a2)); } // Tests that Eq(v) describes itself properly. class Unprintable { public: Unprintable() : c_('a') {} bool operator==(const Unprintable& /* rhs */) { return true; } private: char c_; }; TEST(EqTest, CanDescribeSelf) { Matcher m = Eq(Unprintable()); EXPECT_EQ("is equal to 1-byte object <61>", Describe(m)); } // Tests that Eq(v) can be used to match any type that supports // comparing with type T, where T is v's type. TEST(EqTest, IsPolymorphic) { Matcher m1 = Eq(1); EXPECT_TRUE(m1.Matches(1)); EXPECT_FALSE(m1.Matches(2)); Matcher m2 = Eq(1); EXPECT_TRUE(m2.Matches('\1')); EXPECT_FALSE(m2.Matches('a')); } // Tests that TypedEq(v) matches values of type T that's equal to v. TEST(TypedEqTest, ChecksEqualityForGivenType) { Matcher m1 = TypedEq('a'); EXPECT_TRUE(m1.Matches('a')); EXPECT_FALSE(m1.Matches('b')); Matcher m2 = TypedEq(6); EXPECT_TRUE(m2.Matches(6)); EXPECT_FALSE(m2.Matches(7)); } // Tests that TypedEq(v) describes itself properly. TEST(TypedEqTest, CanDescribeSelf) { EXPECT_EQ("is equal to 2", Describe(TypedEq(2))); } // Tests that TypedEq(v) has type Matcher. // Type::IsTypeOf(v) compiles iff the type of value v is T, where T // is a "bare" type (i.e. not in the form of const U or U&). If v's // type is not T, the compiler will generate a message about // "undefined referece". template struct Type { static bool IsTypeOf(const T& /* v */) { return true; } template static void IsTypeOf(T2 v); }; TEST(TypedEqTest, HasSpecifiedType) { // Verfies that the type of TypedEq(v) is Matcher. Type >::IsTypeOf(TypedEq(5)); Type >::IsTypeOf(TypedEq(5)); } // Tests that Ge(v) matches anything >= v. TEST(GeTest, ImplementsGreaterThanOrEqual) { Matcher m1 = Ge(0); EXPECT_TRUE(m1.Matches(1)); EXPECT_TRUE(m1.Matches(0)); EXPECT_FALSE(m1.Matches(-1)); } // Tests that Ge(v) describes itself properly. TEST(GeTest, CanDescribeSelf) { Matcher m = Ge(5); EXPECT_EQ("is >= 5", Describe(m)); } // Tests that Gt(v) matches anything > v. TEST(GtTest, ImplementsGreaterThan) { Matcher m1 = Gt(0); EXPECT_TRUE(m1.Matches(1.0)); EXPECT_FALSE(m1.Matches(0.0)); EXPECT_FALSE(m1.Matches(-1.0)); } // Tests that Gt(v) describes itself properly. TEST(GtTest, CanDescribeSelf) { Matcher m = Gt(5); EXPECT_EQ("is > 5", Describe(m)); } // Tests that Le(v) matches anything <= v. TEST(LeTest, ImplementsLessThanOrEqual) { Matcher m1 = Le('b'); EXPECT_TRUE(m1.Matches('a')); EXPECT_TRUE(m1.Matches('b')); EXPECT_FALSE(m1.Matches('c')); } // Tests that Le(v) describes itself properly. TEST(LeTest, CanDescribeSelf) { Matcher m = Le(5); EXPECT_EQ("is <= 5", Describe(m)); } // Tests that Lt(v) matches anything < v. TEST(LtTest, ImplementsLessThan) { Matcher m1 = Lt("Hello"); EXPECT_TRUE(m1.Matches("Abc")); EXPECT_FALSE(m1.Matches("Hello")); EXPECT_FALSE(m1.Matches("Hello, world!")); } // Tests that Lt(v) describes itself properly. TEST(LtTest, CanDescribeSelf) { Matcher m = Lt(5); EXPECT_EQ("is < 5", Describe(m)); } // Tests that Ne(v) matches anything != v. TEST(NeTest, ImplementsNotEqual) { Matcher m1 = Ne(0); EXPECT_TRUE(m1.Matches(1)); EXPECT_TRUE(m1.Matches(-1)); EXPECT_FALSE(m1.Matches(0)); } // Tests that Ne(v) describes itself properly. TEST(NeTest, CanDescribeSelf) { Matcher m = Ne(5); EXPECT_EQ("isn't equal to 5", Describe(m)); } // Tests that IsNull() matches any NULL pointer of any type. TEST(IsNullTest, MatchesNullPointer) { Matcher m1 = IsNull(); int* p1 = NULL; int n = 0; EXPECT_TRUE(m1.Matches(p1)); EXPECT_FALSE(m1.Matches(&n)); Matcher m2 = IsNull(); const char* p2 = NULL; EXPECT_TRUE(m2.Matches(p2)); EXPECT_FALSE(m2.Matches("hi")); #if !GTEST_OS_SYMBIAN // Nokia's Symbian compiler generates: // gmock-matchers.h: ambiguous access to overloaded function // gmock-matchers.h: 'testing::Matcher::Matcher(void *)' // gmock-matchers.h: 'testing::Matcher::Matcher(const testing:: // MatcherInterface *)' // gmock-matchers.h: (point of instantiation: 'testing:: // gmock_matchers_test::IsNullTest_MatchesNullPointer_Test::TestBody()') // gmock-matchers.h: (instantiating: 'testing::PolymorphicMatc Matcher m3 = IsNull(); void* p3 = NULL; EXPECT_TRUE(m3.Matches(p3)); EXPECT_FALSE(m3.Matches(reinterpret_cast(0xbeef))); #endif } TEST(IsNullTest, LinkedPtr) { const Matcher > m = IsNull(); const linked_ptr null_p; const linked_ptr non_null_p(new int); EXPECT_TRUE(m.Matches(null_p)); EXPECT_FALSE(m.Matches(non_null_p)); } TEST(IsNullTest, ReferenceToConstLinkedPtr) { const Matcher&> m = IsNull(); const linked_ptr null_p; const linked_ptr non_null_p(new double); EXPECT_TRUE(m.Matches(null_p)); EXPECT_FALSE(m.Matches(non_null_p)); } TEST(IsNullTest, ReferenceToConstScopedPtr) { const Matcher&> m = IsNull(); const scoped_ptr null_p; const scoped_ptr non_null_p(new double); EXPECT_TRUE(m.Matches(null_p)); EXPECT_FALSE(m.Matches(non_null_p)); } // Tests that IsNull() describes itself properly. TEST(IsNullTest, CanDescribeSelf) { Matcher m = IsNull(); EXPECT_EQ("is NULL", Describe(m)); EXPECT_EQ("isn't NULL", DescribeNegation(m)); } // Tests that NotNull() matches any non-NULL pointer of any type. TEST(NotNullTest, MatchesNonNullPointer) { Matcher m1 = NotNull(); int* p1 = NULL; int n = 0; EXPECT_FALSE(m1.Matches(p1)); EXPECT_TRUE(m1.Matches(&n)); Matcher m2 = NotNull(); const char* p2 = NULL; EXPECT_FALSE(m2.Matches(p2)); EXPECT_TRUE(m2.Matches("hi")); } TEST(NotNullTest, LinkedPtr) { const Matcher > m = NotNull(); const linked_ptr null_p; const linked_ptr non_null_p(new int); EXPECT_FALSE(m.Matches(null_p)); EXPECT_TRUE(m.Matches(non_null_p)); } TEST(NotNullTest, ReferenceToConstLinkedPtr) { const Matcher&> m = NotNull(); const linked_ptr null_p; const linked_ptr non_null_p(new double); EXPECT_FALSE(m.Matches(null_p)); EXPECT_TRUE(m.Matches(non_null_p)); } TEST(NotNullTest, ReferenceToConstScopedPtr) { const Matcher&> m = NotNull(); const scoped_ptr null_p; const scoped_ptr non_null_p(new double); EXPECT_FALSE(m.Matches(null_p)); EXPECT_TRUE(m.Matches(non_null_p)); } // Tests that NotNull() describes itself properly. TEST(NotNullTest, CanDescribeSelf) { Matcher m = NotNull(); EXPECT_EQ("isn't NULL", Describe(m)); } // Tests that Ref(variable) matches an argument that references // 'variable'. TEST(RefTest, MatchesSameVariable) { int a = 0; int b = 0; Matcher m = Ref(a); EXPECT_TRUE(m.Matches(a)); EXPECT_FALSE(m.Matches(b)); } // Tests that Ref(variable) describes itself properly. TEST(RefTest, CanDescribeSelf) { int n = 5; Matcher m = Ref(n); stringstream ss; ss << "references the variable @" << &n << " 5"; EXPECT_EQ(string(ss.str()), Describe(m)); } // Test that Ref(non_const_varialbe) can be used as a matcher for a // const reference. TEST(RefTest, CanBeUsedAsMatcherForConstReference) { int a = 0; int b = 0; Matcher m = Ref(a); EXPECT_TRUE(m.Matches(a)); EXPECT_FALSE(m.Matches(b)); } // Tests that Ref(variable) is covariant, i.e. Ref(derived) can be // used wherever Ref(base) can be used (Ref(derived) is a sub-type // of Ref(base), but not vice versa. TEST(RefTest, IsCovariant) { Base base, base2; Derived derived; Matcher m1 = Ref(base); EXPECT_TRUE(m1.Matches(base)); EXPECT_FALSE(m1.Matches(base2)); EXPECT_FALSE(m1.Matches(derived)); m1 = Ref(derived); EXPECT_TRUE(m1.Matches(derived)); EXPECT_FALSE(m1.Matches(base)); EXPECT_FALSE(m1.Matches(base2)); } TEST(RefTest, ExplainsResult) { int n = 0; EXPECT_THAT(Explain(Matcher(Ref(n)), n), StartsWith("which is located @")); int m = 0; EXPECT_THAT(Explain(Matcher(Ref(n)), m), StartsWith("which is located @")); } // Tests string comparison matchers. TEST(StrEqTest, MatchesEqualString) { Matcher m = StrEq(string("Hello")); EXPECT_TRUE(m.Matches("Hello")); EXPECT_FALSE(m.Matches("hello")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrEq("Hello"); EXPECT_TRUE(m2.Matches("Hello")); EXPECT_FALSE(m2.Matches("Hi")); } TEST(StrEqTest, CanDescribeSelf) { Matcher m = StrEq("Hi-\'\"?\\\a\b\f\n\r\t\v\xD3"); EXPECT_EQ("is equal to \"Hi-\'\\\"?\\\\\\a\\b\\f\\n\\r\\t\\v\\xD3\"", Describe(m)); string str("01204500800"); str[3] = '\0'; Matcher m2 = StrEq(str); EXPECT_EQ("is equal to \"012\\04500800\"", Describe(m2)); str[0] = str[6] = str[7] = str[9] = str[10] = '\0'; Matcher m3 = StrEq(str); EXPECT_EQ("is equal to \"\\012\\045\\0\\08\\0\\0\"", Describe(m3)); } TEST(StrNeTest, MatchesUnequalString) { Matcher m = StrNe("Hello"); EXPECT_TRUE(m.Matches("")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches("Hello")); Matcher m2 = StrNe(string("Hello")); EXPECT_TRUE(m2.Matches("hello")); EXPECT_FALSE(m2.Matches("Hello")); } TEST(StrNeTest, CanDescribeSelf) { Matcher m = StrNe("Hi"); EXPECT_EQ("isn't equal to \"Hi\"", Describe(m)); } TEST(StrCaseEqTest, MatchesEqualStringIgnoringCase) { Matcher m = StrCaseEq(string("Hello")); EXPECT_TRUE(m.Matches("Hello")); EXPECT_TRUE(m.Matches("hello")); EXPECT_FALSE(m.Matches("Hi")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrCaseEq("Hello"); EXPECT_TRUE(m2.Matches("hello")); EXPECT_FALSE(m2.Matches("Hi")); } TEST(StrCaseEqTest, MatchesEqualStringWith0IgnoringCase) { string str1("oabocdooeoo"); string str2("OABOCDOOEOO"); Matcher m0 = StrCaseEq(str1); EXPECT_FALSE(m0.Matches(str2 + string(1, '\0'))); str1[3] = str2[3] = '\0'; Matcher m1 = StrCaseEq(str1); EXPECT_TRUE(m1.Matches(str2)); str1[0] = str1[6] = str1[7] = str1[10] = '\0'; str2[0] = str2[6] = str2[7] = str2[10] = '\0'; Matcher m2 = StrCaseEq(str1); str1[9] = str2[9] = '\0'; EXPECT_FALSE(m2.Matches(str2)); Matcher m3 = StrCaseEq(str1); EXPECT_TRUE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(str2 + "x")); str2.append(1, '\0'); EXPECT_FALSE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(string(str2, 0, 9))); } TEST(StrCaseEqTest, CanDescribeSelf) { Matcher m = StrCaseEq("Hi"); EXPECT_EQ("is equal to (ignoring case) \"Hi\"", Describe(m)); } TEST(StrCaseNeTest, MatchesUnequalStringIgnoringCase) { Matcher m = StrCaseNe("Hello"); EXPECT_TRUE(m.Matches("Hi")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches("Hello")); EXPECT_FALSE(m.Matches("hello")); Matcher m2 = StrCaseNe(string("Hello")); EXPECT_TRUE(m2.Matches("")); EXPECT_FALSE(m2.Matches("Hello")); } TEST(StrCaseNeTest, CanDescribeSelf) { Matcher m = StrCaseNe("Hi"); EXPECT_EQ("isn't equal to (ignoring case) \"Hi\"", Describe(m)); } // Tests that HasSubstr() works for matching string-typed values. TEST(HasSubstrTest, WorksForStringClasses) { const Matcher m1 = HasSubstr("foo"); EXPECT_TRUE(m1.Matches(string("I love food."))); EXPECT_FALSE(m1.Matches(string("tofo"))); const Matcher m2 = HasSubstr("foo"); EXPECT_TRUE(m2.Matches(std::string("I love food."))); EXPECT_FALSE(m2.Matches(std::string("tofo"))); } // Tests that HasSubstr() works for matching C-string-typed values. TEST(HasSubstrTest, WorksForCStrings) { const Matcher m1 = HasSubstr("foo"); EXPECT_TRUE(m1.Matches(const_cast("I love food."))); EXPECT_FALSE(m1.Matches(const_cast("tofo"))); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = HasSubstr("foo"); EXPECT_TRUE(m2.Matches("I love food.")); EXPECT_FALSE(m2.Matches("tofo")); EXPECT_FALSE(m2.Matches(NULL)); } // Tests that HasSubstr(s) describes itself properly. TEST(HasSubstrTest, CanDescribeSelf) { Matcher m = HasSubstr("foo\n\""); EXPECT_EQ("has substring \"foo\\n\\\"\"", Describe(m)); } TEST(KeyTest, CanDescribeSelf) { Matcher&> m = Key("foo"); EXPECT_EQ("has a key that is equal to \"foo\"", Describe(m)); EXPECT_EQ("doesn't have a key that is equal to \"foo\"", DescribeNegation(m)); } TEST(KeyTest, ExplainsResult) { Matcher > m = Key(GreaterThan(10)); EXPECT_EQ("whose first field is a value which is 5 less than 10", Explain(m, make_pair(5, true))); EXPECT_EQ("whose first field is a value which is 5 more than 10", Explain(m, make_pair(15, true))); } TEST(KeyTest, MatchesCorrectly) { pair p(25, "foo"); EXPECT_THAT(p, Key(25)); EXPECT_THAT(p, Not(Key(42))); EXPECT_THAT(p, Key(Ge(20))); EXPECT_THAT(p, Not(Key(Lt(25)))); } TEST(KeyTest, SafelyCastsInnerMatcher) { Matcher is_positive = Gt(0); Matcher is_negative = Lt(0); pair p('a', true); EXPECT_THAT(p, Key(is_positive)); EXPECT_THAT(p, Not(Key(is_negative))); } TEST(KeyTest, InsideContainsUsingMap) { map container; container.insert(make_pair(1, 'a')); container.insert(make_pair(2, 'b')); container.insert(make_pair(4, 'c')); EXPECT_THAT(container, Contains(Key(1))); EXPECT_THAT(container, Not(Contains(Key(3)))); } TEST(KeyTest, InsideContainsUsingMultimap) { multimap container; container.insert(make_pair(1, 'a')); container.insert(make_pair(2, 'b')); container.insert(make_pair(4, 'c')); EXPECT_THAT(container, Not(Contains(Key(25)))); container.insert(make_pair(25, 'd')); EXPECT_THAT(container, Contains(Key(25))); container.insert(make_pair(25, 'e')); EXPECT_THAT(container, Contains(Key(25))); EXPECT_THAT(container, Contains(Key(1))); EXPECT_THAT(container, Not(Contains(Key(3)))); } TEST(PairTest, Typing) { // Test verifies the following type conversions can be compiled. Matcher&> m1 = Pair("foo", 42); Matcher > m2 = Pair("foo", 42); Matcher > m3 = Pair("foo", 42); Matcher > m4 = Pair(25, "42"); Matcher > m5 = Pair("25", 42); } TEST(PairTest, CanDescribeSelf) { Matcher&> m1 = Pair("foo", 42); EXPECT_EQ("has a first field that is equal to \"foo\"" ", and has a second field that is equal to 42", Describe(m1)); EXPECT_EQ("has a first field that isn't equal to \"foo\"" ", or has a second field that isn't equal to 42", DescribeNegation(m1)); // Double and triple negation (1 or 2 times not and description of negation). Matcher&> m2 = Not(Pair(Not(13), 42)); EXPECT_EQ("has a first field that isn't equal to 13" ", and has a second field that is equal to 42", DescribeNegation(m2)); } TEST(PairTest, CanExplainMatchResultTo) { // If neither field matches, Pair() should explain about the first // field. const Matcher > m = Pair(GreaterThan(0), GreaterThan(0)); EXPECT_EQ("whose first field does not match, which is 1 less than 0", Explain(m, make_pair(-1, -2))); // If the first field matches but the second doesn't, Pair() should // explain about the second field. EXPECT_EQ("whose second field does not match, which is 2 less than 0", Explain(m, make_pair(1, -2))); // If the first field doesn't match but the second does, Pair() // should explain about the first field. EXPECT_EQ("whose first field does not match, which is 1 less than 0", Explain(m, make_pair(-1, 2))); // If both fields match, Pair() should explain about them both. EXPECT_EQ("whose both fields match, where the first field is a value " "which is 1 more than 0, and the second field is a value " "which is 2 more than 0", Explain(m, make_pair(1, 2))); // If only the first match has an explanation, only this explanation should // be printed. const Matcher > explain_first = Pair(GreaterThan(0), 0); EXPECT_EQ("whose both fields match, where the first field is a value " "which is 1 more than 0", Explain(explain_first, make_pair(1, 0))); // If only the second match has an explanation, only this explanation should // be printed. const Matcher > explain_second = Pair(0, GreaterThan(0)); EXPECT_EQ("whose both fields match, where the second field is a value " "which is 1 more than 0", Explain(explain_second, make_pair(0, 1))); } TEST(PairTest, MatchesCorrectly) { pair p(25, "foo"); // Both fields match. EXPECT_THAT(p, Pair(25, "foo")); EXPECT_THAT(p, Pair(Ge(20), HasSubstr("o"))); // 'first' doesnt' match, but 'second' matches. EXPECT_THAT(p, Not(Pair(42, "foo"))); EXPECT_THAT(p, Not(Pair(Lt(25), "foo"))); // 'first' matches, but 'second' doesn't match. EXPECT_THAT(p, Not(Pair(25, "bar"))); EXPECT_THAT(p, Not(Pair(25, Not("foo")))); // Neither field matches. EXPECT_THAT(p, Not(Pair(13, "bar"))); EXPECT_THAT(p, Not(Pair(Lt(13), HasSubstr("a")))); } TEST(PairTest, SafelyCastsInnerMatchers) { Matcher is_positive = Gt(0); Matcher is_negative = Lt(0); pair p('a', true); EXPECT_THAT(p, Pair(is_positive, _)); EXPECT_THAT(p, Not(Pair(is_negative, _))); EXPECT_THAT(p, Pair(_, is_positive)); EXPECT_THAT(p, Not(Pair(_, is_negative))); } TEST(PairTest, InsideContainsUsingMap) { map container; container.insert(make_pair(1, 'a')); container.insert(make_pair(2, 'b')); container.insert(make_pair(4, 'c')); EXPECT_THAT(container, Contains(Pair(1, 'a'))); EXPECT_THAT(container, Contains(Pair(1, _))); EXPECT_THAT(container, Contains(Pair(_, 'a'))); EXPECT_THAT(container, Not(Contains(Pair(3, _)))); } // Tests StartsWith(s). TEST(StartsWithTest, MatchesStringWithGivenPrefix) { const Matcher m1 = StartsWith(string("")); EXPECT_TRUE(m1.Matches("Hi")); EXPECT_TRUE(m1.Matches("")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = StartsWith("Hi"); EXPECT_TRUE(m2.Matches("Hi")); EXPECT_TRUE(m2.Matches("Hi Hi!")); EXPECT_TRUE(m2.Matches("High")); EXPECT_FALSE(m2.Matches("H")); EXPECT_FALSE(m2.Matches(" Hi")); } TEST(StartsWithTest, CanDescribeSelf) { Matcher m = StartsWith("Hi"); EXPECT_EQ("starts with \"Hi\"", Describe(m)); } // Tests EndsWith(s). TEST(EndsWithTest, MatchesStringWithGivenSuffix) { const Matcher m1 = EndsWith(""); EXPECT_TRUE(m1.Matches("Hi")); EXPECT_TRUE(m1.Matches("")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = EndsWith(string("Hi")); EXPECT_TRUE(m2.Matches("Hi")); EXPECT_TRUE(m2.Matches("Wow Hi Hi")); EXPECT_TRUE(m2.Matches("Super Hi")); EXPECT_FALSE(m2.Matches("i")); EXPECT_FALSE(m2.Matches("Hi ")); } TEST(EndsWithTest, CanDescribeSelf) { Matcher m = EndsWith("Hi"); EXPECT_EQ("ends with \"Hi\"", Describe(m)); } // Tests MatchesRegex(). TEST(MatchesRegexTest, MatchesStringMatchingGivenRegex) { const Matcher m1 = MatchesRegex("a.*z"); EXPECT_TRUE(m1.Matches("az")); EXPECT_TRUE(m1.Matches("abcz")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = MatchesRegex(new RE("a.*z")); EXPECT_TRUE(m2.Matches("azbz")); EXPECT_FALSE(m2.Matches("az1")); EXPECT_FALSE(m2.Matches("1az")); } TEST(MatchesRegexTest, CanDescribeSelf) { Matcher m1 = MatchesRegex(string("Hi.*")); EXPECT_EQ("matches regular expression \"Hi.*\"", Describe(m1)); Matcher m2 = MatchesRegex(new RE("a.*")); EXPECT_EQ("matches regular expression \"a.*\"", Describe(m2)); } // Tests ContainsRegex(). TEST(ContainsRegexTest, MatchesStringContainingGivenRegex) { const Matcher m1 = ContainsRegex(string("a.*z")); EXPECT_TRUE(m1.Matches("az")); EXPECT_TRUE(m1.Matches("0abcz1")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = ContainsRegex(new RE("a.*z")); EXPECT_TRUE(m2.Matches("azbz")); EXPECT_TRUE(m2.Matches("az1")); EXPECT_FALSE(m2.Matches("1a")); } TEST(ContainsRegexTest, CanDescribeSelf) { Matcher m1 = ContainsRegex("Hi.*"); EXPECT_EQ("contains regular expression \"Hi.*\"", Describe(m1)); Matcher m2 = ContainsRegex(new RE("a.*")); EXPECT_EQ("contains regular expression \"a.*\"", Describe(m2)); } // Tests for wide strings. #if GTEST_HAS_STD_WSTRING TEST(StdWideStrEqTest, MatchesEqual) { Matcher m = StrEq(::std::wstring(L"Hello")); EXPECT_TRUE(m.Matches(L"Hello")); EXPECT_FALSE(m.Matches(L"hello")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrEq(L"Hello"); EXPECT_TRUE(m2.Matches(L"Hello")); EXPECT_FALSE(m2.Matches(L"Hi")); Matcher m3 = StrEq(L"\xD3\x576\x8D3\xC74D"); EXPECT_TRUE(m3.Matches(L"\xD3\x576\x8D3\xC74D")); EXPECT_FALSE(m3.Matches(L"\xD3\x576\x8D3\xC74E")); ::std::wstring str(L"01204500800"); str[3] = L'\0'; Matcher m4 = StrEq(str); EXPECT_TRUE(m4.Matches(str)); str[0] = str[6] = str[7] = str[9] = str[10] = L'\0'; Matcher m5 = StrEq(str); EXPECT_TRUE(m5.Matches(str)); } TEST(StdWideStrEqTest, CanDescribeSelf) { Matcher< ::std::wstring> m = StrEq(L"Hi-\'\"?\\\a\b\f\n\r\t\v"); EXPECT_EQ("is equal to L\"Hi-\'\\\"?\\\\\\a\\b\\f\\n\\r\\t\\v\"", Describe(m)); Matcher< ::std::wstring> m2 = StrEq(L"\xD3\x576\x8D3\xC74D"); EXPECT_EQ("is equal to L\"\\xD3\\x576\\x8D3\\xC74D\"", Describe(m2)); ::std::wstring str(L"01204500800"); str[3] = L'\0'; Matcher m4 = StrEq(str); EXPECT_EQ("is equal to L\"012\\04500800\"", Describe(m4)); str[0] = str[6] = str[7] = str[9] = str[10] = L'\0'; Matcher m5 = StrEq(str); EXPECT_EQ("is equal to L\"\\012\\045\\0\\08\\0\\0\"", Describe(m5)); } TEST(StdWideStrNeTest, MatchesUnequalString) { Matcher m = StrNe(L"Hello"); EXPECT_TRUE(m.Matches(L"")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches(L"Hello")); Matcher< ::std::wstring> m2 = StrNe(::std::wstring(L"Hello")); EXPECT_TRUE(m2.Matches(L"hello")); EXPECT_FALSE(m2.Matches(L"Hello")); } TEST(StdWideStrNeTest, CanDescribeSelf) { Matcher m = StrNe(L"Hi"); EXPECT_EQ("isn't equal to L\"Hi\"", Describe(m)); } TEST(StdWideStrCaseEqTest, MatchesEqualStringIgnoringCase) { Matcher m = StrCaseEq(::std::wstring(L"Hello")); EXPECT_TRUE(m.Matches(L"Hello")); EXPECT_TRUE(m.Matches(L"hello")); EXPECT_FALSE(m.Matches(L"Hi")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrCaseEq(L"Hello"); EXPECT_TRUE(m2.Matches(L"hello")); EXPECT_FALSE(m2.Matches(L"Hi")); } TEST(StdWideStrCaseEqTest, MatchesEqualStringWith0IgnoringCase) { ::std::wstring str1(L"oabocdooeoo"); ::std::wstring str2(L"OABOCDOOEOO"); Matcher m0 = StrCaseEq(str1); EXPECT_FALSE(m0.Matches(str2 + ::std::wstring(1, L'\0'))); str1[3] = str2[3] = L'\0'; Matcher m1 = StrCaseEq(str1); EXPECT_TRUE(m1.Matches(str2)); str1[0] = str1[6] = str1[7] = str1[10] = L'\0'; str2[0] = str2[6] = str2[7] = str2[10] = L'\0'; Matcher m2 = StrCaseEq(str1); str1[9] = str2[9] = L'\0'; EXPECT_FALSE(m2.Matches(str2)); Matcher m3 = StrCaseEq(str1); EXPECT_TRUE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(str2 + L"x")); str2.append(1, L'\0'); EXPECT_FALSE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(::std::wstring(str2, 0, 9))); } TEST(StdWideStrCaseEqTest, CanDescribeSelf) { Matcher< ::std::wstring> m = StrCaseEq(L"Hi"); EXPECT_EQ("is equal to (ignoring case) L\"Hi\"", Describe(m)); } TEST(StdWideStrCaseNeTest, MatchesUnequalStringIgnoringCase) { Matcher m = StrCaseNe(L"Hello"); EXPECT_TRUE(m.Matches(L"Hi")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches(L"Hello")); EXPECT_FALSE(m.Matches(L"hello")); Matcher< ::std::wstring> m2 = StrCaseNe(::std::wstring(L"Hello")); EXPECT_TRUE(m2.Matches(L"")); EXPECT_FALSE(m2.Matches(L"Hello")); } TEST(StdWideStrCaseNeTest, CanDescribeSelf) { Matcher m = StrCaseNe(L"Hi"); EXPECT_EQ("isn't equal to (ignoring case) L\"Hi\"", Describe(m)); } // Tests that HasSubstr() works for matching wstring-typed values. TEST(StdWideHasSubstrTest, WorksForStringClasses) { const Matcher< ::std::wstring> m1 = HasSubstr(L"foo"); EXPECT_TRUE(m1.Matches(::std::wstring(L"I love food."))); EXPECT_FALSE(m1.Matches(::std::wstring(L"tofo"))); const Matcher m2 = HasSubstr(L"foo"); EXPECT_TRUE(m2.Matches(::std::wstring(L"I love food."))); EXPECT_FALSE(m2.Matches(::std::wstring(L"tofo"))); } // Tests that HasSubstr() works for matching C-wide-string-typed values. TEST(StdWideHasSubstrTest, WorksForCStrings) { const Matcher m1 = HasSubstr(L"foo"); EXPECT_TRUE(m1.Matches(const_cast(L"I love food."))); EXPECT_FALSE(m1.Matches(const_cast(L"tofo"))); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = HasSubstr(L"foo"); EXPECT_TRUE(m2.Matches(L"I love food.")); EXPECT_FALSE(m2.Matches(L"tofo")); EXPECT_FALSE(m2.Matches(NULL)); } // Tests that HasSubstr(s) describes itself properly. TEST(StdWideHasSubstrTest, CanDescribeSelf) { Matcher< ::std::wstring> m = HasSubstr(L"foo\n\""); EXPECT_EQ("has substring L\"foo\\n\\\"\"", Describe(m)); } // Tests StartsWith(s). TEST(StdWideStartsWithTest, MatchesStringWithGivenPrefix) { const Matcher m1 = StartsWith(::std::wstring(L"")); EXPECT_TRUE(m1.Matches(L"Hi")); EXPECT_TRUE(m1.Matches(L"")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = StartsWith(L"Hi"); EXPECT_TRUE(m2.Matches(L"Hi")); EXPECT_TRUE(m2.Matches(L"Hi Hi!")); EXPECT_TRUE(m2.Matches(L"High")); EXPECT_FALSE(m2.Matches(L"H")); EXPECT_FALSE(m2.Matches(L" Hi")); } TEST(StdWideStartsWithTest, CanDescribeSelf) { Matcher m = StartsWith(L"Hi"); EXPECT_EQ("starts with L\"Hi\"", Describe(m)); } // Tests EndsWith(s). TEST(StdWideEndsWithTest, MatchesStringWithGivenSuffix) { const Matcher m1 = EndsWith(L""); EXPECT_TRUE(m1.Matches(L"Hi")); EXPECT_TRUE(m1.Matches(L"")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = EndsWith(::std::wstring(L"Hi")); EXPECT_TRUE(m2.Matches(L"Hi")); EXPECT_TRUE(m2.Matches(L"Wow Hi Hi")); EXPECT_TRUE(m2.Matches(L"Super Hi")); EXPECT_FALSE(m2.Matches(L"i")); EXPECT_FALSE(m2.Matches(L"Hi ")); } TEST(StdWideEndsWithTest, CanDescribeSelf) { Matcher m = EndsWith(L"Hi"); EXPECT_EQ("ends with L\"Hi\"", Describe(m)); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING TEST(GlobalWideStrEqTest, MatchesEqual) { Matcher m = StrEq(::wstring(L"Hello")); EXPECT_TRUE(m.Matches(L"Hello")); EXPECT_FALSE(m.Matches(L"hello")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrEq(L"Hello"); EXPECT_TRUE(m2.Matches(L"Hello")); EXPECT_FALSE(m2.Matches(L"Hi")); Matcher m3 = StrEq(L"\xD3\x576\x8D3\xC74D"); EXPECT_TRUE(m3.Matches(L"\xD3\x576\x8D3\xC74D")); EXPECT_FALSE(m3.Matches(L"\xD3\x576\x8D3\xC74E")); ::wstring str(L"01204500800"); str[3] = L'\0'; Matcher m4 = StrEq(str); EXPECT_TRUE(m4.Matches(str)); str[0] = str[6] = str[7] = str[9] = str[10] = L'\0'; Matcher m5 = StrEq(str); EXPECT_TRUE(m5.Matches(str)); } TEST(GlobalWideStrEqTest, CanDescribeSelf) { Matcher< ::wstring> m = StrEq(L"Hi-\'\"?\\\a\b\f\n\r\t\v"); EXPECT_EQ("is equal to L\"Hi-\'\\\"?\\\\\\a\\b\\f\\n\\r\\t\\v\"", Describe(m)); Matcher< ::wstring> m2 = StrEq(L"\xD3\x576\x8D3\xC74D"); EXPECT_EQ("is equal to L\"\\xD3\\x576\\x8D3\\xC74D\"", Describe(m2)); ::wstring str(L"01204500800"); str[3] = L'\0'; Matcher m4 = StrEq(str); EXPECT_EQ("is equal to L\"012\\04500800\"", Describe(m4)); str[0] = str[6] = str[7] = str[9] = str[10] = L'\0'; Matcher m5 = StrEq(str); EXPECT_EQ("is equal to L\"\\012\\045\\0\\08\\0\\0\"", Describe(m5)); } TEST(GlobalWideStrNeTest, MatchesUnequalString) { Matcher m = StrNe(L"Hello"); EXPECT_TRUE(m.Matches(L"")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches(L"Hello")); Matcher< ::wstring> m2 = StrNe(::wstring(L"Hello")); EXPECT_TRUE(m2.Matches(L"hello")); EXPECT_FALSE(m2.Matches(L"Hello")); } TEST(GlobalWideStrNeTest, CanDescribeSelf) { Matcher m = StrNe(L"Hi"); EXPECT_EQ("isn't equal to L\"Hi\"", Describe(m)); } TEST(GlobalWideStrCaseEqTest, MatchesEqualStringIgnoringCase) { Matcher m = StrCaseEq(::wstring(L"Hello")); EXPECT_TRUE(m.Matches(L"Hello")); EXPECT_TRUE(m.Matches(L"hello")); EXPECT_FALSE(m.Matches(L"Hi")); EXPECT_FALSE(m.Matches(NULL)); Matcher m2 = StrCaseEq(L"Hello"); EXPECT_TRUE(m2.Matches(L"hello")); EXPECT_FALSE(m2.Matches(L"Hi")); } TEST(GlobalWideStrCaseEqTest, MatchesEqualStringWith0IgnoringCase) { ::wstring str1(L"oabocdooeoo"); ::wstring str2(L"OABOCDOOEOO"); Matcher m0 = StrCaseEq(str1); EXPECT_FALSE(m0.Matches(str2 + ::wstring(1, L'\0'))); str1[3] = str2[3] = L'\0'; Matcher m1 = StrCaseEq(str1); EXPECT_TRUE(m1.Matches(str2)); str1[0] = str1[6] = str1[7] = str1[10] = L'\0'; str2[0] = str2[6] = str2[7] = str2[10] = L'\0'; Matcher m2 = StrCaseEq(str1); str1[9] = str2[9] = L'\0'; EXPECT_FALSE(m2.Matches(str2)); Matcher m3 = StrCaseEq(str1); EXPECT_TRUE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(str2 + L"x")); str2.append(1, L'\0'); EXPECT_FALSE(m3.Matches(str2)); EXPECT_FALSE(m3.Matches(::wstring(str2, 0, 9))); } TEST(GlobalWideStrCaseEqTest, CanDescribeSelf) { Matcher< ::wstring> m = StrCaseEq(L"Hi"); EXPECT_EQ("is equal to (ignoring case) L\"Hi\"", Describe(m)); } TEST(GlobalWideStrCaseNeTest, MatchesUnequalStringIgnoringCase) { Matcher m = StrCaseNe(L"Hello"); EXPECT_TRUE(m.Matches(L"Hi")); EXPECT_TRUE(m.Matches(NULL)); EXPECT_FALSE(m.Matches(L"Hello")); EXPECT_FALSE(m.Matches(L"hello")); Matcher< ::wstring> m2 = StrCaseNe(::wstring(L"Hello")); EXPECT_TRUE(m2.Matches(L"")); EXPECT_FALSE(m2.Matches(L"Hello")); } TEST(GlobalWideStrCaseNeTest, CanDescribeSelf) { Matcher m = StrCaseNe(L"Hi"); EXPECT_EQ("isn't equal to (ignoring case) L\"Hi\"", Describe(m)); } // Tests that HasSubstr() works for matching wstring-typed values. TEST(GlobalWideHasSubstrTest, WorksForStringClasses) { const Matcher< ::wstring> m1 = HasSubstr(L"foo"); EXPECT_TRUE(m1.Matches(::wstring(L"I love food."))); EXPECT_FALSE(m1.Matches(::wstring(L"tofo"))); const Matcher m2 = HasSubstr(L"foo"); EXPECT_TRUE(m2.Matches(::wstring(L"I love food."))); EXPECT_FALSE(m2.Matches(::wstring(L"tofo"))); } // Tests that HasSubstr() works for matching C-wide-string-typed values. TEST(GlobalWideHasSubstrTest, WorksForCStrings) { const Matcher m1 = HasSubstr(L"foo"); EXPECT_TRUE(m1.Matches(const_cast(L"I love food."))); EXPECT_FALSE(m1.Matches(const_cast(L"tofo"))); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = HasSubstr(L"foo"); EXPECT_TRUE(m2.Matches(L"I love food.")); EXPECT_FALSE(m2.Matches(L"tofo")); EXPECT_FALSE(m2.Matches(NULL)); } // Tests that HasSubstr(s) describes itself properly. TEST(GlobalWideHasSubstrTest, CanDescribeSelf) { Matcher< ::wstring> m = HasSubstr(L"foo\n\""); EXPECT_EQ("has substring L\"foo\\n\\\"\"", Describe(m)); } // Tests StartsWith(s). TEST(GlobalWideStartsWithTest, MatchesStringWithGivenPrefix) { const Matcher m1 = StartsWith(::wstring(L"")); EXPECT_TRUE(m1.Matches(L"Hi")); EXPECT_TRUE(m1.Matches(L"")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = StartsWith(L"Hi"); EXPECT_TRUE(m2.Matches(L"Hi")); EXPECT_TRUE(m2.Matches(L"Hi Hi!")); EXPECT_TRUE(m2.Matches(L"High")); EXPECT_FALSE(m2.Matches(L"H")); EXPECT_FALSE(m2.Matches(L" Hi")); } TEST(GlobalWideStartsWithTest, CanDescribeSelf) { Matcher m = StartsWith(L"Hi"); EXPECT_EQ("starts with L\"Hi\"", Describe(m)); } // Tests EndsWith(s). TEST(GlobalWideEndsWithTest, MatchesStringWithGivenSuffix) { const Matcher m1 = EndsWith(L""); EXPECT_TRUE(m1.Matches(L"Hi")); EXPECT_TRUE(m1.Matches(L"")); EXPECT_FALSE(m1.Matches(NULL)); const Matcher m2 = EndsWith(::wstring(L"Hi")); EXPECT_TRUE(m2.Matches(L"Hi")); EXPECT_TRUE(m2.Matches(L"Wow Hi Hi")); EXPECT_TRUE(m2.Matches(L"Super Hi")); EXPECT_FALSE(m2.Matches(L"i")); EXPECT_FALSE(m2.Matches(L"Hi ")); } TEST(GlobalWideEndsWithTest, CanDescribeSelf) { Matcher m = EndsWith(L"Hi"); EXPECT_EQ("ends with L\"Hi\"", Describe(m)); } #endif // GTEST_HAS_GLOBAL_WSTRING typedef ::std::tr1::tuple Tuple2; // NOLINT // Tests that Eq() matches a 2-tuple where the first field == the // second field. TEST(Eq2Test, MatchesEqualArguments) { Matcher m = Eq(); EXPECT_TRUE(m.Matches(Tuple2(5L, 5))); EXPECT_FALSE(m.Matches(Tuple2(5L, 6))); } // Tests that Eq() describes itself properly. TEST(Eq2Test, CanDescribeSelf) { Matcher m = Eq(); EXPECT_EQ("are an equal pair", Describe(m)); } // Tests that Ge() matches a 2-tuple where the first field >= the // second field. TEST(Ge2Test, MatchesGreaterThanOrEqualArguments) { Matcher m = Ge(); EXPECT_TRUE(m.Matches(Tuple2(5L, 4))); EXPECT_TRUE(m.Matches(Tuple2(5L, 5))); EXPECT_FALSE(m.Matches(Tuple2(5L, 6))); } // Tests that Ge() describes itself properly. TEST(Ge2Test, CanDescribeSelf) { Matcher m = Ge(); EXPECT_EQ("are a pair where the first >= the second", Describe(m)); } // Tests that Gt() matches a 2-tuple where the first field > the // second field. TEST(Gt2Test, MatchesGreaterThanArguments) { Matcher m = Gt(); EXPECT_TRUE(m.Matches(Tuple2(5L, 4))); EXPECT_FALSE(m.Matches(Tuple2(5L, 5))); EXPECT_FALSE(m.Matches(Tuple2(5L, 6))); } // Tests that Gt() describes itself properly. TEST(Gt2Test, CanDescribeSelf) { Matcher m = Gt(); EXPECT_EQ("are a pair where the first > the second", Describe(m)); } // Tests that Le() matches a 2-tuple where the first field <= the // second field. TEST(Le2Test, MatchesLessThanOrEqualArguments) { Matcher m = Le(); EXPECT_TRUE(m.Matches(Tuple2(5L, 6))); EXPECT_TRUE(m.Matches(Tuple2(5L, 5))); EXPECT_FALSE(m.Matches(Tuple2(5L, 4))); } // Tests that Le() describes itself properly. TEST(Le2Test, CanDescribeSelf) { Matcher m = Le(); EXPECT_EQ("are a pair where the first <= the second", Describe(m)); } // Tests that Lt() matches a 2-tuple where the first field < the // second field. TEST(Lt2Test, MatchesLessThanArguments) { Matcher m = Lt(); EXPECT_TRUE(m.Matches(Tuple2(5L, 6))); EXPECT_FALSE(m.Matches(Tuple2(5L, 5))); EXPECT_FALSE(m.Matches(Tuple2(5L, 4))); } // Tests that Lt() describes itself properly. TEST(Lt2Test, CanDescribeSelf) { Matcher m = Lt(); EXPECT_EQ("are a pair where the first < the second", Describe(m)); } // Tests that Ne() matches a 2-tuple where the first field != the // second field. TEST(Ne2Test, MatchesUnequalArguments) { Matcher m = Ne(); EXPECT_TRUE(m.Matches(Tuple2(5L, 6))); EXPECT_TRUE(m.Matches(Tuple2(5L, 4))); EXPECT_FALSE(m.Matches(Tuple2(5L, 5))); } // Tests that Ne() describes itself properly. TEST(Ne2Test, CanDescribeSelf) { Matcher m = Ne(); EXPECT_EQ("are an unequal pair", Describe(m)); } // Tests that Not(m) matches any value that doesn't match m. TEST(NotTest, NegatesMatcher) { Matcher m; m = Not(Eq(2)); EXPECT_TRUE(m.Matches(3)); EXPECT_FALSE(m.Matches(2)); } // Tests that Not(m) describes itself properly. TEST(NotTest, CanDescribeSelf) { Matcher m = Not(Eq(5)); EXPECT_EQ("isn't equal to 5", Describe(m)); } // Tests that monomorphic matchers are safely cast by the Not matcher. TEST(NotTest, NotMatcherSafelyCastsMonomorphicMatchers) { // greater_than_5 is a monomorphic matcher. Matcher greater_than_5 = Gt(5); Matcher m = Not(greater_than_5); Matcher m2 = Not(greater_than_5); Matcher m3 = Not(m); } // Helper to allow easy testing of AllOf matchers with num parameters. void AllOfMatches(int num, const Matcher& m) { SCOPED_TRACE(Describe(m)); EXPECT_TRUE(m.Matches(0)); for (int i = 1; i <= num; ++i) { EXPECT_FALSE(m.Matches(i)); } EXPECT_TRUE(m.Matches(num + 1)); } // Tests that AllOf(m1, ..., mn) matches any value that matches all of // the given matchers. TEST(AllOfTest, MatchesWhenAllMatch) { Matcher m; m = AllOf(Le(2), Ge(1)); EXPECT_TRUE(m.Matches(1)); EXPECT_TRUE(m.Matches(2)); EXPECT_FALSE(m.Matches(0)); EXPECT_FALSE(m.Matches(3)); m = AllOf(Gt(0), Ne(1), Ne(2)); EXPECT_TRUE(m.Matches(3)); EXPECT_FALSE(m.Matches(2)); EXPECT_FALSE(m.Matches(1)); EXPECT_FALSE(m.Matches(0)); m = AllOf(Gt(0), Ne(1), Ne(2), Ne(3)); EXPECT_TRUE(m.Matches(4)); EXPECT_FALSE(m.Matches(3)); EXPECT_FALSE(m.Matches(2)); EXPECT_FALSE(m.Matches(1)); EXPECT_FALSE(m.Matches(0)); m = AllOf(Ge(0), Lt(10), Ne(3), Ne(5), Ne(7)); EXPECT_TRUE(m.Matches(0)); EXPECT_TRUE(m.Matches(1)); EXPECT_FALSE(m.Matches(3)); // The following tests for varying number of sub-matchers. Due to the way // the sub-matchers are handled it is enough to test every sub-matcher once // with sub-matchers using the same matcher type. Varying matcher types are // checked for above. AllOfMatches(2, AllOf(Ne(1), Ne(2))); AllOfMatches(3, AllOf(Ne(1), Ne(2), Ne(3))); AllOfMatches(4, AllOf(Ne(1), Ne(2), Ne(3), Ne(4))); AllOfMatches(5, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5))); AllOfMatches(6, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5), Ne(6))); AllOfMatches(7, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5), Ne(6), Ne(7))); AllOfMatches(8, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5), Ne(6), Ne(7), Ne(8))); AllOfMatches(9, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5), Ne(6), Ne(7), Ne(8), Ne(9))); AllOfMatches(10, AllOf(Ne(1), Ne(2), Ne(3), Ne(4), Ne(5), Ne(6), Ne(7), Ne(8), Ne(9), Ne(10))); } // Tests that AllOf(m1, ..., mn) describes itself properly. TEST(AllOfTest, CanDescribeSelf) { Matcher m; m = AllOf(Le(2), Ge(1)); EXPECT_EQ("(is <= 2) and (is >= 1)", Describe(m)); m = AllOf(Gt(0), Ne(1), Ne(2)); EXPECT_EQ("(is > 0) and " "((isn't equal to 1) and " "(isn't equal to 2))", Describe(m)); m = AllOf(Gt(0), Ne(1), Ne(2), Ne(3)); EXPECT_EQ("(is > 0) and " "((isn't equal to 1) and " "((isn't equal to 2) and " "(isn't equal to 3)))", Describe(m)); m = AllOf(Ge(0), Lt(10), Ne(3), Ne(5), Ne(7)); EXPECT_EQ("(is >= 0) and " "((is < 10) and " "((isn't equal to 3) and " "((isn't equal to 5) and " "(isn't equal to 7))))", Describe(m)); } // Tests that AllOf(m1, ..., mn) describes its negation properly. TEST(AllOfTest, CanDescribeNegation) { Matcher m; m = AllOf(Le(2), Ge(1)); EXPECT_EQ("(isn't <= 2) or " "(isn't >= 1)", DescribeNegation(m)); m = AllOf(Gt(0), Ne(1), Ne(2)); EXPECT_EQ("(isn't > 0) or " "((is equal to 1) or " "(is equal to 2))", DescribeNegation(m)); m = AllOf(Gt(0), Ne(1), Ne(2), Ne(3)); EXPECT_EQ("(isn't > 0) or " "((is equal to 1) or " "((is equal to 2) or " "(is equal to 3)))", DescribeNegation(m)); m = AllOf(Ge(0), Lt(10), Ne(3), Ne(5), Ne(7)); EXPECT_EQ("(isn't >= 0) or " "((isn't < 10) or " "((is equal to 3) or " "((is equal to 5) or " "(is equal to 7))))", DescribeNegation(m)); } // Tests that monomorphic matchers are safely cast by the AllOf matcher. TEST(AllOfTest, AllOfMatcherSafelyCastsMonomorphicMatchers) { // greater_than_5 and less_than_10 are monomorphic matchers. Matcher greater_than_5 = Gt(5); Matcher less_than_10 = Lt(10); Matcher m = AllOf(greater_than_5, less_than_10); Matcher m2 = AllOf(greater_than_5, less_than_10); Matcher m3 = AllOf(greater_than_5, m2); // Tests that BothOf works when composing itself. Matcher m4 = AllOf(greater_than_5, less_than_10, less_than_10); Matcher m5 = AllOf(greater_than_5, less_than_10, less_than_10); } TEST(AllOfTest, ExplainsResult) { Matcher m; // Successful match. Both matchers need to explain. The second // matcher doesn't give an explanation, so only the first matcher's // explanation is printed. m = AllOf(GreaterThan(10), Lt(30)); EXPECT_EQ("which is 15 more than 10", Explain(m, 25)); // Successful match. Both matchers need to explain. m = AllOf(GreaterThan(10), GreaterThan(20)); EXPECT_EQ("which is 20 more than 10, and which is 10 more than 20", Explain(m, 30)); // Successful match. All matchers need to explain. The second // matcher doesn't given an explanation. m = AllOf(GreaterThan(10), Lt(30), GreaterThan(20)); EXPECT_EQ("which is 15 more than 10, and which is 5 more than 20", Explain(m, 25)); // Successful match. All matchers need to explain. m = AllOf(GreaterThan(10), GreaterThan(20), GreaterThan(30)); EXPECT_EQ("which is 30 more than 10, and which is 20 more than 20, " "and which is 10 more than 30", Explain(m, 40)); // Failed match. The first matcher, which failed, needs to // explain. m = AllOf(GreaterThan(10), GreaterThan(20)); EXPECT_EQ("which is 5 less than 10", Explain(m, 5)); // Failed match. The second matcher, which failed, needs to // explain. Since it doesn't given an explanation, nothing is // printed. m = AllOf(GreaterThan(10), Lt(30)); EXPECT_EQ("", Explain(m, 40)); // Failed match. The second matcher, which failed, needs to // explain. m = AllOf(GreaterThan(10), GreaterThan(20)); EXPECT_EQ("which is 5 less than 20", Explain(m, 15)); } // Helper to allow easy testing of AnyOf matchers with num parameters. void AnyOfMatches(int num, const Matcher& m) { SCOPED_TRACE(Describe(m)); EXPECT_FALSE(m.Matches(0)); for (int i = 1; i <= num; ++i) { EXPECT_TRUE(m.Matches(i)); } EXPECT_FALSE(m.Matches(num + 1)); } // Tests that AnyOf(m1, ..., mn) matches any value that matches at // least one of the given matchers. TEST(AnyOfTest, MatchesWhenAnyMatches) { Matcher m; m = AnyOf(Le(1), Ge(3)); EXPECT_TRUE(m.Matches(1)); EXPECT_TRUE(m.Matches(4)); EXPECT_FALSE(m.Matches(2)); m = AnyOf(Lt(0), Eq(1), Eq(2)); EXPECT_TRUE(m.Matches(-1)); EXPECT_TRUE(m.Matches(1)); EXPECT_TRUE(m.Matches(2)); EXPECT_FALSE(m.Matches(0)); m = AnyOf(Lt(0), Eq(1), Eq(2), Eq(3)); EXPECT_TRUE(m.Matches(-1)); EXPECT_TRUE(m.Matches(1)); EXPECT_TRUE(m.Matches(2)); EXPECT_TRUE(m.Matches(3)); EXPECT_FALSE(m.Matches(0)); m = AnyOf(Le(0), Gt(10), 3, 5, 7); EXPECT_TRUE(m.Matches(0)); EXPECT_TRUE(m.Matches(11)); EXPECT_TRUE(m.Matches(3)); EXPECT_FALSE(m.Matches(2)); // The following tests for varying number of sub-matchers. Due to the way // the sub-matchers are handled it is enough to test every sub-matcher once // with sub-matchers using the same matcher type. Varying matcher types are // checked for above. AnyOfMatches(2, AnyOf(1, 2)); AnyOfMatches(3, AnyOf(1, 2, 3)); AnyOfMatches(4, AnyOf(1, 2, 3, 4)); AnyOfMatches(5, AnyOf(1, 2, 3, 4, 5)); AnyOfMatches(6, AnyOf(1, 2, 3, 4, 5, 6)); AnyOfMatches(7, AnyOf(1, 2, 3, 4, 5, 6, 7)); AnyOfMatches(8, AnyOf(1, 2, 3, 4, 5, 6, 7, 8)); AnyOfMatches(9, AnyOf(1, 2, 3, 4, 5, 6, 7, 8, 9)); AnyOfMatches(10, AnyOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)); } // Tests that AnyOf(m1, ..., mn) describes itself properly. TEST(AnyOfTest, CanDescribeSelf) { Matcher m; m = AnyOf(Le(1), Ge(3)); EXPECT_EQ("(is <= 1) or (is >= 3)", Describe(m)); m = AnyOf(Lt(0), Eq(1), Eq(2)); EXPECT_EQ("(is < 0) or " "((is equal to 1) or (is equal to 2))", Describe(m)); m = AnyOf(Lt(0), Eq(1), Eq(2), Eq(3)); EXPECT_EQ("(is < 0) or " "((is equal to 1) or " "((is equal to 2) or " "(is equal to 3)))", Describe(m)); m = AnyOf(Le(0), Gt(10), 3, 5, 7); EXPECT_EQ("(is <= 0) or " "((is > 10) or " "((is equal to 3) or " "((is equal to 5) or " "(is equal to 7))))", Describe(m)); } // Tests that AnyOf(m1, ..., mn) describes its negation properly. TEST(AnyOfTest, CanDescribeNegation) { Matcher m; m = AnyOf(Le(1), Ge(3)); EXPECT_EQ("(isn't <= 1) and (isn't >= 3)", DescribeNegation(m)); m = AnyOf(Lt(0), Eq(1), Eq(2)); EXPECT_EQ("(isn't < 0) and " "((isn't equal to 1) and (isn't equal to 2))", DescribeNegation(m)); m = AnyOf(Lt(0), Eq(1), Eq(2), Eq(3)); EXPECT_EQ("(isn't < 0) and " "((isn't equal to 1) and " "((isn't equal to 2) and " "(isn't equal to 3)))", DescribeNegation(m)); m = AnyOf(Le(0), Gt(10), 3, 5, 7); EXPECT_EQ("(isn't <= 0) and " "((isn't > 10) and " "((isn't equal to 3) and " "((isn't equal to 5) and " "(isn't equal to 7))))", DescribeNegation(m)); } // Tests that monomorphic matchers are safely cast by the AnyOf matcher. TEST(AnyOfTest, AnyOfMatcherSafelyCastsMonomorphicMatchers) { // greater_than_5 and less_than_10 are monomorphic matchers. Matcher greater_than_5 = Gt(5); Matcher less_than_10 = Lt(10); Matcher m = AnyOf(greater_than_5, less_than_10); Matcher m2 = AnyOf(greater_than_5, less_than_10); Matcher m3 = AnyOf(greater_than_5, m2); // Tests that EitherOf works when composing itself. Matcher m4 = AnyOf(greater_than_5, less_than_10, less_than_10); Matcher m5 = AnyOf(greater_than_5, less_than_10, less_than_10); } TEST(AnyOfTest, ExplainsResult) { Matcher m; // Failed match. Both matchers need to explain. The second // matcher doesn't give an explanation, so only the first matcher's // explanation is printed. m = AnyOf(GreaterThan(10), Lt(0)); EXPECT_EQ("which is 5 less than 10", Explain(m, 5)); // Failed match. Both matchers need to explain. m = AnyOf(GreaterThan(10), GreaterThan(20)); EXPECT_EQ("which is 5 less than 10, and which is 15 less than 20", Explain(m, 5)); // Failed match. All matchers need to explain. The second // matcher doesn't given an explanation. m = AnyOf(GreaterThan(10), Gt(20), GreaterThan(30)); EXPECT_EQ("which is 5 less than 10, and which is 25 less than 30", Explain(m, 5)); // Failed match. All matchers need to explain. m = AnyOf(GreaterThan(10), GreaterThan(20), GreaterThan(30)); EXPECT_EQ("which is 5 less than 10, and which is 15 less than 20, " "and which is 25 less than 30", Explain(m, 5)); // Successful match. The first matcher, which succeeded, needs to // explain. m = AnyOf(GreaterThan(10), GreaterThan(20)); EXPECT_EQ("which is 5 more than 10", Explain(m, 15)); // Successful match. The second matcher, which succeeded, needs to // explain. Since it doesn't given an explanation, nothing is // printed. m = AnyOf(GreaterThan(10), Lt(30)); EXPECT_EQ("", Explain(m, 0)); // Successful match. The second matcher, which succeeded, needs to // explain. m = AnyOf(GreaterThan(30), GreaterThan(20)); EXPECT_EQ("which is 5 more than 20", Explain(m, 25)); } // The following predicate function and predicate functor are for // testing the Truly(predicate) matcher. // Returns non-zero if the input is positive. Note that the return // type of this function is not bool. It's OK as Truly() accepts any // unary function or functor whose return type can be implicitly // converted to bool. int IsPositive(double x) { return x > 0 ? 1 : 0; } // This functor returns true if the input is greater than the given // number. class IsGreaterThan { public: explicit IsGreaterThan(int threshold) : threshold_(threshold) {} bool operator()(int n) const { return n > threshold_; } private: int threshold_; }; // For testing Truly(). const int foo = 0; // This predicate returns true iff the argument references foo and has // a zero value. bool ReferencesFooAndIsZero(const int& n) { return (&n == &foo) && (n == 0); } // Tests that Truly(predicate) matches what satisfies the given // predicate. TEST(TrulyTest, MatchesWhatSatisfiesThePredicate) { Matcher m = Truly(IsPositive); EXPECT_TRUE(m.Matches(2.0)); EXPECT_FALSE(m.Matches(-1.5)); } // Tests that Truly(predicate_functor) works too. TEST(TrulyTest, CanBeUsedWithFunctor) { Matcher m = Truly(IsGreaterThan(5)); EXPECT_TRUE(m.Matches(6)); EXPECT_FALSE(m.Matches(4)); } // A class that can be implicitly converted to bool. class ConvertibleToBool { public: explicit ConvertibleToBool(int number) : number_(number) {} operator bool() const { return number_ != 0; } private: int number_; }; ConvertibleToBool IsNotZero(int number) { return ConvertibleToBool(number); } // Tests that the predicate used in Truly() may return a class that's // implicitly convertible to bool, even when the class has no // operator!(). TEST(TrulyTest, PredicateCanReturnAClassConvertibleToBool) { Matcher m = Truly(IsNotZero); EXPECT_TRUE(m.Matches(1)); EXPECT_FALSE(m.Matches(0)); } // Tests that Truly(predicate) can describe itself properly. TEST(TrulyTest, CanDescribeSelf) { Matcher m = Truly(IsPositive); EXPECT_EQ("satisfies the given predicate", Describe(m)); } // Tests that Truly(predicate) works when the matcher takes its // argument by reference. TEST(TrulyTest, WorksForByRefArguments) { Matcher m = Truly(ReferencesFooAndIsZero); EXPECT_TRUE(m.Matches(foo)); int n = 0; EXPECT_FALSE(m.Matches(n)); } // Tests that Matches(m) is a predicate satisfied by whatever that // matches matcher m. TEST(MatchesTest, IsSatisfiedByWhatMatchesTheMatcher) { EXPECT_TRUE(Matches(Ge(0))(1)); EXPECT_FALSE(Matches(Eq('a'))('b')); } // Tests that Matches(m) works when the matcher takes its argument by // reference. TEST(MatchesTest, WorksOnByRefArguments) { int m = 0, n = 0; EXPECT_TRUE(Matches(AllOf(Ref(n), Eq(0)))(n)); EXPECT_FALSE(Matches(Ref(m))(n)); } // Tests that a Matcher on non-reference type can be used in // Matches(). TEST(MatchesTest, WorksWithMatcherOnNonRefType) { Matcher eq5 = Eq(5); EXPECT_TRUE(Matches(eq5)(5)); EXPECT_FALSE(Matches(eq5)(2)); } // Tests Value(value, matcher). Since Value() is a simple wrapper for // Matches(), which has been tested already, we don't spend a lot of // effort on testing Value(). TEST(ValueTest, WorksWithPolymorphicMatcher) { EXPECT_TRUE(Value("hi", StartsWith("h"))); EXPECT_FALSE(Value(5, Gt(10))); } TEST(ValueTest, WorksWithMonomorphicMatcher) { const Matcher is_zero = Eq(0); EXPECT_TRUE(Value(0, is_zero)); EXPECT_FALSE(Value('a', is_zero)); int n = 0; const Matcher ref_n = Ref(n); EXPECT_TRUE(Value(n, ref_n)); EXPECT_FALSE(Value(1, ref_n)); } TEST(ExplainMatchResultTest, WorksWithPolymorphicMatcher) { StringMatchResultListener listener1; EXPECT_TRUE(ExplainMatchResult(PolymorphicIsEven(), 42, &listener1)); EXPECT_EQ("% 2 == 0", listener1.str()); StringMatchResultListener listener2; EXPECT_FALSE(ExplainMatchResult(Ge(42), 1.5, &listener2)); EXPECT_EQ("", listener2.str()); } TEST(ExplainMatchResultTest, WorksWithMonomorphicMatcher) { const Matcher is_even = PolymorphicIsEven(); StringMatchResultListener listener1; EXPECT_TRUE(ExplainMatchResult(is_even, 42, &listener1)); EXPECT_EQ("% 2 == 0", listener1.str()); const Matcher is_zero = Eq(0); StringMatchResultListener listener2; EXPECT_FALSE(ExplainMatchResult(is_zero, 1.5, &listener2)); EXPECT_EQ("", listener2.str()); } MATCHER_P(Really, inner_matcher, "") { return ExplainMatchResult(inner_matcher, arg, result_listener); } TEST(ExplainMatchResultTest, WorksInsideMATCHER) { EXPECT_THAT(0, Really(Eq(0))); } TEST(AllArgsTest, WorksForTuple) { EXPECT_THAT(make_tuple(1, 2L), AllArgs(Lt())); EXPECT_THAT(make_tuple(2L, 1), Not(AllArgs(Lt()))); } TEST(AllArgsTest, WorksForNonTuple) { EXPECT_THAT(42, AllArgs(Gt(0))); EXPECT_THAT('a', Not(AllArgs(Eq('b')))); } class AllArgsHelper { public: AllArgsHelper() {} MOCK_METHOD2(Helper, int(char x, int y)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(AllArgsHelper); }; TEST(AllArgsTest, WorksInWithClause) { AllArgsHelper helper; ON_CALL(helper, Helper(_, _)) .With(AllArgs(Lt())) .WillByDefault(Return(1)); EXPECT_CALL(helper, Helper(_, _)); EXPECT_CALL(helper, Helper(_, _)) .With(AllArgs(Gt())) .WillOnce(Return(2)); EXPECT_EQ(1, helper.Helper('\1', 2)); EXPECT_EQ(2, helper.Helper('a', 1)); } // Tests that ASSERT_THAT() and EXPECT_THAT() work when the value // matches the matcher. TEST(MatcherAssertionTest, WorksWhenMatcherIsSatisfied) { ASSERT_THAT(5, Ge(2)) << "This should succeed."; ASSERT_THAT("Foo", EndsWith("oo")); EXPECT_THAT(2, AllOf(Le(7), Ge(0))) << "This should succeed too."; EXPECT_THAT("Hello", StartsWith("Hell")); } // Tests that ASSERT_THAT() and EXPECT_THAT() work when the value // doesn't match the matcher. TEST(MatcherAssertionTest, WorksWhenMatcherIsNotSatisfied) { // 'n' must be static as it is used in an EXPECT_FATAL_FAILURE(), // which cannot reference auto variables. static unsigned short n; // NOLINT n = 5; // VC++ prior to version 8.0 SP1 has a bug where it will not see any // functions declared in the namespace scope from within nested classes. // EXPECT/ASSERT_(NON)FATAL_FAILURE macros use nested classes so that all // namespace-level functions invoked inside them need to be explicitly // resolved. EXPECT_FATAL_FAILURE(ASSERT_THAT(n, ::testing::Gt(10)), "Value of: n\n" "Expected: is > 10\n" " Actual: 5" + OfType("unsigned short")); n = 0; EXPECT_NONFATAL_FAILURE( EXPECT_THAT(n, ::testing::AllOf(::testing::Le(7), ::testing::Ge(5))), "Value of: n\n" "Expected: (is <= 7) and (is >= 5)\n" " Actual: 0" + OfType("unsigned short")); } // Tests that ASSERT_THAT() and EXPECT_THAT() work when the argument // has a reference type. TEST(MatcherAssertionTest, WorksForByRefArguments) { // We use a static variable here as EXPECT_FATAL_FAILURE() cannot // reference auto variables. static int n; n = 0; EXPECT_THAT(n, AllOf(Le(7), Ref(n))); EXPECT_FATAL_FAILURE(ASSERT_THAT(n, ::testing::Not(::testing::Ref(n))), "Value of: n\n" "Expected: does not reference the variable @"); // Tests the "Actual" part. EXPECT_FATAL_FAILURE(ASSERT_THAT(n, ::testing::Not(::testing::Ref(n))), "Actual: 0" + OfType("int") + ", which is located @"); } #if !GTEST_OS_SYMBIAN // Tests that ASSERT_THAT() and EXPECT_THAT() work when the matcher is // monomorphic. // ASSERT_THAT("hello", starts_with_he) fails to compile with Nokia's // Symbian compiler: it tries to compile // template class MatcherCastImpl { ... // virtual bool MatchAndExplain(T x, ...) const { // return source_matcher_.MatchAndExplain(static_cast(x), ...); // with U == string and T == const char* // With ASSERT_THAT("hello"...) changed to ASSERT_THAT(string("hello") ... ) // the compiler silently crashes with no output. // If MatcherCastImpl is changed to use U(x) instead of static_cast(x) // the code compiles but the converted string is bogus. TEST(MatcherAssertionTest, WorksForMonomorphicMatcher) { Matcher starts_with_he = StartsWith("he"); ASSERT_THAT("hello", starts_with_he); Matcher ends_with_ok = EndsWith("ok"); ASSERT_THAT("book", ends_with_ok); const string bad = "bad"; EXPECT_NONFATAL_FAILURE(EXPECT_THAT(bad, ends_with_ok), "Value of: bad\n" "Expected: ends with \"ok\"\n" " Actual: \"bad\""); Matcher is_greater_than_5 = Gt(5); EXPECT_NONFATAL_FAILURE(EXPECT_THAT(5, is_greater_than_5), "Value of: 5\n" "Expected: is > 5\n" " Actual: 5" + OfType("int")); } #endif // !GTEST_OS_SYMBIAN // Tests floating-point matchers. template class FloatingPointTest : public testing::Test { protected: typedef typename testing::internal::FloatingPoint Floating; typedef typename Floating::Bits Bits; virtual void SetUp() { const size_t max_ulps = Floating::kMaxUlps; // The bits that represent 0.0. const Bits zero_bits = Floating(0).bits(); // Makes some numbers close to 0.0. close_to_positive_zero_ = Floating::ReinterpretBits(zero_bits + max_ulps/2); close_to_negative_zero_ = -Floating::ReinterpretBits( zero_bits + max_ulps - max_ulps/2); further_from_negative_zero_ = -Floating::ReinterpretBits( zero_bits + max_ulps + 1 - max_ulps/2); // The bits that represent 1.0. const Bits one_bits = Floating(1).bits(); // Makes some numbers close to 1.0. close_to_one_ = Floating::ReinterpretBits(one_bits + max_ulps); further_from_one_ = Floating::ReinterpretBits(one_bits + max_ulps + 1); // +infinity. infinity_ = Floating::Infinity(); // The bits that represent +infinity. const Bits infinity_bits = Floating(infinity_).bits(); // Makes some numbers close to infinity. close_to_infinity_ = Floating::ReinterpretBits(infinity_bits - max_ulps); further_from_infinity_ = Floating::ReinterpretBits( infinity_bits - max_ulps - 1); // Makes some NAN's. nan1_ = Floating::ReinterpretBits(Floating::kExponentBitMask | 1); nan2_ = Floating::ReinterpretBits(Floating::kExponentBitMask | 200); } void TestSize() { EXPECT_EQ(sizeof(RawType), sizeof(Bits)); } // A battery of tests for FloatingEqMatcher::Matches. // matcher_maker is a pointer to a function which creates a FloatingEqMatcher. void TestMatches( testing::internal::FloatingEqMatcher (*matcher_maker)(RawType)) { Matcher m1 = matcher_maker(0.0); EXPECT_TRUE(m1.Matches(-0.0)); EXPECT_TRUE(m1.Matches(close_to_positive_zero_)); EXPECT_TRUE(m1.Matches(close_to_negative_zero_)); EXPECT_FALSE(m1.Matches(1.0)); Matcher m2 = matcher_maker(close_to_positive_zero_); EXPECT_FALSE(m2.Matches(further_from_negative_zero_)); Matcher m3 = matcher_maker(1.0); EXPECT_TRUE(m3.Matches(close_to_one_)); EXPECT_FALSE(m3.Matches(further_from_one_)); // Test commutativity: matcher_maker(0.0).Matches(1.0) was tested above. EXPECT_FALSE(m3.Matches(0.0)); Matcher m4 = matcher_maker(-infinity_); EXPECT_TRUE(m4.Matches(-close_to_infinity_)); Matcher m5 = matcher_maker(infinity_); EXPECT_TRUE(m5.Matches(close_to_infinity_)); // This is interesting as the representations of infinity_ and nan1_ // are only 1 DLP apart. EXPECT_FALSE(m5.Matches(nan1_)); // matcher_maker can produce a Matcher, which is needed in // some cases. Matcher m6 = matcher_maker(0.0); EXPECT_TRUE(m6.Matches(-0.0)); EXPECT_TRUE(m6.Matches(close_to_positive_zero_)); EXPECT_FALSE(m6.Matches(1.0)); // matcher_maker can produce a Matcher, which is needed in some // cases. Matcher m7 = matcher_maker(0.0); RawType x = 0.0; EXPECT_TRUE(m7.Matches(x)); x = 0.01f; EXPECT_FALSE(m7.Matches(x)); } // Pre-calculated numbers to be used by the tests. static RawType close_to_positive_zero_; static RawType close_to_negative_zero_; static RawType further_from_negative_zero_; static RawType close_to_one_; static RawType further_from_one_; static RawType infinity_; static RawType close_to_infinity_; static RawType further_from_infinity_; static RawType nan1_; static RawType nan2_; }; template RawType FloatingPointTest::close_to_positive_zero_; template RawType FloatingPointTest::close_to_negative_zero_; template RawType FloatingPointTest::further_from_negative_zero_; template RawType FloatingPointTest::close_to_one_; template RawType FloatingPointTest::further_from_one_; template RawType FloatingPointTest::infinity_; template RawType FloatingPointTest::close_to_infinity_; template RawType FloatingPointTest::further_from_infinity_; template RawType FloatingPointTest::nan1_; template RawType FloatingPointTest::nan2_; // Instantiate FloatingPointTest for testing floats. typedef FloatingPointTest FloatTest; TEST_F(FloatTest, FloatEqApproximatelyMatchesFloats) { TestMatches(&FloatEq); } TEST_F(FloatTest, NanSensitiveFloatEqApproximatelyMatchesFloats) { TestMatches(&NanSensitiveFloatEq); } TEST_F(FloatTest, FloatEqCannotMatchNaN) { // FloatEq never matches NaN. Matcher m = FloatEq(nan1_); EXPECT_FALSE(m.Matches(nan1_)); EXPECT_FALSE(m.Matches(nan2_)); EXPECT_FALSE(m.Matches(1.0)); } TEST_F(FloatTest, NanSensitiveFloatEqCanMatchNaN) { // NanSensitiveFloatEq will match NaN. Matcher m = NanSensitiveFloatEq(nan1_); EXPECT_TRUE(m.Matches(nan1_)); EXPECT_TRUE(m.Matches(nan2_)); EXPECT_FALSE(m.Matches(1.0)); } TEST_F(FloatTest, FloatEqCanDescribeSelf) { Matcher m1 = FloatEq(2.0f); EXPECT_EQ("is approximately 2", Describe(m1)); EXPECT_EQ("isn't approximately 2", DescribeNegation(m1)); Matcher m2 = FloatEq(0.5f); EXPECT_EQ("is approximately 0.5", Describe(m2)); EXPECT_EQ("isn't approximately 0.5", DescribeNegation(m2)); Matcher m3 = FloatEq(nan1_); EXPECT_EQ("never matches", Describe(m3)); EXPECT_EQ("is anything", DescribeNegation(m3)); } TEST_F(FloatTest, NanSensitiveFloatEqCanDescribeSelf) { Matcher m1 = NanSensitiveFloatEq(2.0f); EXPECT_EQ("is approximately 2", Describe(m1)); EXPECT_EQ("isn't approximately 2", DescribeNegation(m1)); Matcher m2 = NanSensitiveFloatEq(0.5f); EXPECT_EQ("is approximately 0.5", Describe(m2)); EXPECT_EQ("isn't approximately 0.5", DescribeNegation(m2)); Matcher m3 = NanSensitiveFloatEq(nan1_); EXPECT_EQ("is NaN", Describe(m3)); EXPECT_EQ("isn't NaN", DescribeNegation(m3)); } // Instantiate FloatingPointTest for testing doubles. typedef FloatingPointTest DoubleTest; TEST_F(DoubleTest, DoubleEqApproximatelyMatchesDoubles) { TestMatches(&DoubleEq); } TEST_F(DoubleTest, NanSensitiveDoubleEqApproximatelyMatchesDoubles) { TestMatches(&NanSensitiveDoubleEq); } TEST_F(DoubleTest, DoubleEqCannotMatchNaN) { // DoubleEq never matches NaN. Matcher m = DoubleEq(nan1_); EXPECT_FALSE(m.Matches(nan1_)); EXPECT_FALSE(m.Matches(nan2_)); EXPECT_FALSE(m.Matches(1.0)); } TEST_F(DoubleTest, NanSensitiveDoubleEqCanMatchNaN) { // NanSensitiveDoubleEq will match NaN. Matcher m = NanSensitiveDoubleEq(nan1_); EXPECT_TRUE(m.Matches(nan1_)); EXPECT_TRUE(m.Matches(nan2_)); EXPECT_FALSE(m.Matches(1.0)); } TEST_F(DoubleTest, DoubleEqCanDescribeSelf) { Matcher m1 = DoubleEq(2.0); EXPECT_EQ("is approximately 2", Describe(m1)); EXPECT_EQ("isn't approximately 2", DescribeNegation(m1)); Matcher m2 = DoubleEq(0.5); EXPECT_EQ("is approximately 0.5", Describe(m2)); EXPECT_EQ("isn't approximately 0.5", DescribeNegation(m2)); Matcher m3 = DoubleEq(nan1_); EXPECT_EQ("never matches", Describe(m3)); EXPECT_EQ("is anything", DescribeNegation(m3)); } TEST_F(DoubleTest, NanSensitiveDoubleEqCanDescribeSelf) { Matcher m1 = NanSensitiveDoubleEq(2.0); EXPECT_EQ("is approximately 2", Describe(m1)); EXPECT_EQ("isn't approximately 2", DescribeNegation(m1)); Matcher m2 = NanSensitiveDoubleEq(0.5); EXPECT_EQ("is approximately 0.5", Describe(m2)); EXPECT_EQ("isn't approximately 0.5", DescribeNegation(m2)); Matcher m3 = NanSensitiveDoubleEq(nan1_); EXPECT_EQ("is NaN", Describe(m3)); EXPECT_EQ("isn't NaN", DescribeNegation(m3)); } TEST(PointeeTest, RawPointer) { const Matcher m = Pointee(Ge(0)); int n = 1; EXPECT_TRUE(m.Matches(&n)); n = -1; EXPECT_FALSE(m.Matches(&n)); EXPECT_FALSE(m.Matches(NULL)); } TEST(PointeeTest, RawPointerToConst) { const Matcher m = Pointee(Ge(0)); double x = 1; EXPECT_TRUE(m.Matches(&x)); x = -1; EXPECT_FALSE(m.Matches(&x)); EXPECT_FALSE(m.Matches(NULL)); } TEST(PointeeTest, ReferenceToConstRawPointer) { const Matcher m = Pointee(Ge(0)); int n = 1; EXPECT_TRUE(m.Matches(&n)); n = -1; EXPECT_FALSE(m.Matches(&n)); EXPECT_FALSE(m.Matches(NULL)); } TEST(PointeeTest, ReferenceToNonConstRawPointer) { const Matcher m = Pointee(Ge(0)); double x = 1.0; double* p = &x; EXPECT_TRUE(m.Matches(p)); x = -1; EXPECT_FALSE(m.Matches(p)); p = NULL; EXPECT_FALSE(m.Matches(p)); } TEST(PointeeTest, NeverMatchesNull) { const Matcher m = Pointee(_); EXPECT_FALSE(m.Matches(NULL)); } // Tests that we can write Pointee(value) instead of Pointee(Eq(value)). TEST(PointeeTest, MatchesAgainstAValue) { const Matcher m = Pointee(5); int n = 5; EXPECT_TRUE(m.Matches(&n)); n = -1; EXPECT_FALSE(m.Matches(&n)); EXPECT_FALSE(m.Matches(NULL)); } TEST(PointeeTest, CanDescribeSelf) { const Matcher m = Pointee(Gt(3)); EXPECT_EQ("points to a value that is > 3", Describe(m)); EXPECT_EQ("does not point to a value that is > 3", DescribeNegation(m)); } TEST(PointeeTest, CanExplainMatchResult) { const Matcher m = Pointee(StartsWith("Hi")); EXPECT_EQ("", Explain(m, static_cast(NULL))); const Matcher m2 = Pointee(GreaterThan(1)); // NOLINT long n = 3; // NOLINT EXPECT_EQ("which points to 3" + OfType("long") + ", which is 2 more than 1", Explain(m2, &n)); } TEST(PointeeTest, AlwaysExplainsPointee) { const Matcher m = Pointee(0); int n = 42; EXPECT_EQ("which points to 42" + OfType("int"), Explain(m, &n)); } // An uncopyable class. class Uncopyable { public: explicit Uncopyable(int a_value) : value_(a_value) {} int value() const { return value_; } private: const int value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Uncopyable); }; // Returns true iff x.value() is positive. bool ValueIsPositive(const Uncopyable& x) { return x.value() > 0; } // A user-defined struct for testing Field(). struct AStruct { AStruct() : x(0), y(1.0), z(5), p(NULL) {} AStruct(const AStruct& rhs) : x(rhs.x), y(rhs.y), z(rhs.z.value()), p(rhs.p) {} int x; // A non-const field. const double y; // A const field. Uncopyable z; // An uncopyable field. const char* p; // A pointer field. private: GTEST_DISALLOW_ASSIGN_(AStruct); }; // A derived struct for testing Field(). struct DerivedStruct : public AStruct { char ch; private: GTEST_DISALLOW_ASSIGN_(DerivedStruct); }; // Tests that Field(&Foo::field, ...) works when field is non-const. TEST(FieldTest, WorksForNonConstField) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; EXPECT_TRUE(m.Matches(a)); a.x = -1; EXPECT_FALSE(m.Matches(a)); } // Tests that Field(&Foo::field, ...) works when field is const. TEST(FieldTest, WorksForConstField) { AStruct a; Matcher m = Field(&AStruct::y, Ge(0.0)); EXPECT_TRUE(m.Matches(a)); m = Field(&AStruct::y, Le(0.0)); EXPECT_FALSE(m.Matches(a)); } // Tests that Field(&Foo::field, ...) works when field is not copyable. TEST(FieldTest, WorksForUncopyableField) { AStruct a; Matcher m = Field(&AStruct::z, Truly(ValueIsPositive)); EXPECT_TRUE(m.Matches(a)); m = Field(&AStruct::z, Not(Truly(ValueIsPositive))); EXPECT_FALSE(m.Matches(a)); } // Tests that Field(&Foo::field, ...) works when field is a pointer. TEST(FieldTest, WorksForPointerField) { // Matching against NULL. Matcher m = Field(&AStruct::p, static_cast(NULL)); AStruct a; EXPECT_TRUE(m.Matches(a)); a.p = "hi"; EXPECT_FALSE(m.Matches(a)); // Matching a pointer that is not NULL. m = Field(&AStruct::p, StartsWith("hi")); a.p = "hill"; EXPECT_TRUE(m.Matches(a)); a.p = "hole"; EXPECT_FALSE(m.Matches(a)); } // Tests that Field() works when the object is passed by reference. TEST(FieldTest, WorksForByRefArgument) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; EXPECT_TRUE(m.Matches(a)); a.x = -1; EXPECT_FALSE(m.Matches(a)); } // Tests that Field(&Foo::field, ...) works when the argument's type // is a sub-type of Foo. TEST(FieldTest, WorksForArgumentOfSubType) { // Note that the matcher expects DerivedStruct but we say AStruct // inside Field(). Matcher m = Field(&AStruct::x, Ge(0)); DerivedStruct d; EXPECT_TRUE(m.Matches(d)); d.x = -1; EXPECT_FALSE(m.Matches(d)); } // Tests that Field(&Foo::field, m) works when field's type and m's // argument type are compatible but not the same. TEST(FieldTest, WorksForCompatibleMatcherType) { // The field is an int, but the inner matcher expects a signed char. Matcher m = Field(&AStruct::x, Matcher(Ge(0))); AStruct a; EXPECT_TRUE(m.Matches(a)); a.x = -1; EXPECT_FALSE(m.Matches(a)); } // Tests that Field() can describe itself. TEST(FieldTest, CanDescribeSelf) { Matcher m = Field(&AStruct::x, Ge(0)); EXPECT_EQ("is an object whose given field is >= 0", Describe(m)); EXPECT_EQ("is an object whose given field isn't >= 0", DescribeNegation(m)); } // Tests that Field() can explain the match result. TEST(FieldTest, CanExplainMatchResult) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; a.x = 1; EXPECT_EQ("whose given field is 1" + OfType("int"), Explain(m, a)); m = Field(&AStruct::x, GreaterThan(0)); EXPECT_EQ( "whose given field is 1" + OfType("int") + ", which is 1 more than 0", Explain(m, a)); } // Tests that Field() works when the argument is a pointer to const. TEST(FieldForPointerTest, WorksForPointerToConst) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; EXPECT_TRUE(m.Matches(&a)); a.x = -1; EXPECT_FALSE(m.Matches(&a)); } // Tests that Field() works when the argument is a pointer to non-const. TEST(FieldForPointerTest, WorksForPointerToNonConst) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; EXPECT_TRUE(m.Matches(&a)); a.x = -1; EXPECT_FALSE(m.Matches(&a)); } // Tests that Field() works when the argument is a reference to a const pointer. TEST(FieldForPointerTest, WorksForReferenceToConstPointer) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; EXPECT_TRUE(m.Matches(&a)); a.x = -1; EXPECT_FALSE(m.Matches(&a)); } // Tests that Field() does not match the NULL pointer. TEST(FieldForPointerTest, DoesNotMatchNull) { Matcher m = Field(&AStruct::x, _); EXPECT_FALSE(m.Matches(NULL)); } // Tests that Field(&Foo::field, ...) works when the argument's type // is a sub-type of const Foo*. TEST(FieldForPointerTest, WorksForArgumentOfSubType) { // Note that the matcher expects DerivedStruct but we say AStruct // inside Field(). Matcher m = Field(&AStruct::x, Ge(0)); DerivedStruct d; EXPECT_TRUE(m.Matches(&d)); d.x = -1; EXPECT_FALSE(m.Matches(&d)); } // Tests that Field() can describe itself when used to match a pointer. TEST(FieldForPointerTest, CanDescribeSelf) { Matcher m = Field(&AStruct::x, Ge(0)); EXPECT_EQ("is an object whose given field is >= 0", Describe(m)); EXPECT_EQ("is an object whose given field isn't >= 0", DescribeNegation(m)); } // Tests that Field() can explain the result of matching a pointer. TEST(FieldForPointerTest, CanExplainMatchResult) { Matcher m = Field(&AStruct::x, Ge(0)); AStruct a; a.x = 1; EXPECT_EQ("", Explain(m, static_cast(NULL))); EXPECT_EQ("which points to an object whose given field is 1" + OfType("int"), Explain(m, &a)); m = Field(&AStruct::x, GreaterThan(0)); EXPECT_EQ("which points to an object whose given field is 1" + OfType("int") + ", which is 1 more than 0", Explain(m, &a)); } // A user-defined class for testing Property(). class AClass { public: AClass() : n_(0) {} // A getter that returns a non-reference. int n() const { return n_; } void set_n(int new_n) { n_ = new_n; } // A getter that returns a reference to const. const string& s() const { return s_; } void set_s(const string& new_s) { s_ = new_s; } // A getter that returns a reference to non-const. double& x() const { return x_; } private: int n_; string s_; static double x_; }; double AClass::x_ = 0.0; // A derived class for testing Property(). class DerivedClass : public AClass { private: int k_; }; // Tests that Property(&Foo::property, ...) works when property() // returns a non-reference. TEST(PropertyTest, WorksForNonReferenceProperty) { Matcher m = Property(&AClass::n, Ge(0)); AClass a; a.set_n(1); EXPECT_TRUE(m.Matches(a)); a.set_n(-1); EXPECT_FALSE(m.Matches(a)); } // Tests that Property(&Foo::property, ...) works when property() // returns a reference to const. TEST(PropertyTest, WorksForReferenceToConstProperty) { Matcher m = Property(&AClass::s, StartsWith("hi")); AClass a; a.set_s("hill"); EXPECT_TRUE(m.Matches(a)); a.set_s("hole"); EXPECT_FALSE(m.Matches(a)); } // Tests that Property(&Foo::property, ...) works when property() // returns a reference to non-const. TEST(PropertyTest, WorksForReferenceToNonConstProperty) { double x = 0.0; AClass a; Matcher m = Property(&AClass::x, Ref(x)); EXPECT_FALSE(m.Matches(a)); m = Property(&AClass::x, Not(Ref(x))); EXPECT_TRUE(m.Matches(a)); } // Tests that Property(&Foo::property, ...) works when the argument is // passed by value. TEST(PropertyTest, WorksForByValueArgument) { Matcher m = Property(&AClass::s, StartsWith("hi")); AClass a; a.set_s("hill"); EXPECT_TRUE(m.Matches(a)); a.set_s("hole"); EXPECT_FALSE(m.Matches(a)); } // Tests that Property(&Foo::property, ...) works when the argument's // type is a sub-type of Foo. TEST(PropertyTest, WorksForArgumentOfSubType) { // The matcher expects a DerivedClass, but inside the Property() we // say AClass. Matcher m = Property(&AClass::n, Ge(0)); DerivedClass d; d.set_n(1); EXPECT_TRUE(m.Matches(d)); d.set_n(-1); EXPECT_FALSE(m.Matches(d)); } // Tests that Property(&Foo::property, m) works when property()'s type // and m's argument type are compatible but different. TEST(PropertyTest, WorksForCompatibleMatcherType) { // n() returns an int but the inner matcher expects a signed char. Matcher m = Property(&AClass::n, Matcher(Ge(0))); AClass a; EXPECT_TRUE(m.Matches(a)); a.set_n(-1); EXPECT_FALSE(m.Matches(a)); } // Tests that Property() can describe itself. TEST(PropertyTest, CanDescribeSelf) { Matcher m = Property(&AClass::n, Ge(0)); EXPECT_EQ("is an object whose given property is >= 0", Describe(m)); EXPECT_EQ("is an object whose given property isn't >= 0", DescribeNegation(m)); } // Tests that Property() can explain the match result. TEST(PropertyTest, CanExplainMatchResult) { Matcher m = Property(&AClass::n, Ge(0)); AClass a; a.set_n(1); EXPECT_EQ("whose given property is 1" + OfType("int"), Explain(m, a)); m = Property(&AClass::n, GreaterThan(0)); EXPECT_EQ( "whose given property is 1" + OfType("int") + ", which is 1 more than 0", Explain(m, a)); } // Tests that Property() works when the argument is a pointer to const. TEST(PropertyForPointerTest, WorksForPointerToConst) { Matcher m = Property(&AClass::n, Ge(0)); AClass a; a.set_n(1); EXPECT_TRUE(m.Matches(&a)); a.set_n(-1); EXPECT_FALSE(m.Matches(&a)); } // Tests that Property() works when the argument is a pointer to non-const. TEST(PropertyForPointerTest, WorksForPointerToNonConst) { Matcher m = Property(&AClass::s, StartsWith("hi")); AClass a; a.set_s("hill"); EXPECT_TRUE(m.Matches(&a)); a.set_s("hole"); EXPECT_FALSE(m.Matches(&a)); } // Tests that Property() works when the argument is a reference to a // const pointer. TEST(PropertyForPointerTest, WorksForReferenceToConstPointer) { Matcher m = Property(&AClass::s, StartsWith("hi")); AClass a; a.set_s("hill"); EXPECT_TRUE(m.Matches(&a)); a.set_s("hole"); EXPECT_FALSE(m.Matches(&a)); } // Tests that Property() does not match the NULL pointer. TEST(PropertyForPointerTest, WorksForReferenceToNonConstProperty) { Matcher m = Property(&AClass::x, _); EXPECT_FALSE(m.Matches(NULL)); } // Tests that Property(&Foo::property, ...) works when the argument's // type is a sub-type of const Foo*. TEST(PropertyForPointerTest, WorksForArgumentOfSubType) { // The matcher expects a DerivedClass, but inside the Property() we // say AClass. Matcher m = Property(&AClass::n, Ge(0)); DerivedClass d; d.set_n(1); EXPECT_TRUE(m.Matches(&d)); d.set_n(-1); EXPECT_FALSE(m.Matches(&d)); } // Tests that Property() can describe itself when used to match a pointer. TEST(PropertyForPointerTest, CanDescribeSelf) { Matcher m = Property(&AClass::n, Ge(0)); EXPECT_EQ("is an object whose given property is >= 0", Describe(m)); EXPECT_EQ("is an object whose given property isn't >= 0", DescribeNegation(m)); } // Tests that Property() can explain the result of matching a pointer. TEST(PropertyForPointerTest, CanExplainMatchResult) { Matcher m = Property(&AClass::n, Ge(0)); AClass a; a.set_n(1); EXPECT_EQ("", Explain(m, static_cast(NULL))); EXPECT_EQ( "which points to an object whose given property is 1" + OfType("int"), Explain(m, &a)); m = Property(&AClass::n, GreaterThan(0)); EXPECT_EQ("which points to an object whose given property is 1" + OfType("int") + ", which is 1 more than 0", Explain(m, &a)); } // Tests ResultOf. // Tests that ResultOf(f, ...) compiles and works as expected when f is a // function pointer. string IntToStringFunction(int input) { return input == 1 ? "foo" : "bar"; } TEST(ResultOfTest, WorksForFunctionPointers) { Matcher matcher = ResultOf(&IntToStringFunction, Eq(string("foo"))); EXPECT_TRUE(matcher.Matches(1)); EXPECT_FALSE(matcher.Matches(2)); } // Tests that ResultOf() can describe itself. TEST(ResultOfTest, CanDescribeItself) { Matcher matcher = ResultOf(&IntToStringFunction, StrEq("foo")); EXPECT_EQ("is mapped by the given callable to a value that " "is equal to \"foo\"", Describe(matcher)); EXPECT_EQ("is mapped by the given callable to a value that " "isn't equal to \"foo\"", DescribeNegation(matcher)); } // Tests that ResultOf() can explain the match result. int IntFunction(int input) { return input == 42 ? 80 : 90; } TEST(ResultOfTest, CanExplainMatchResult) { Matcher matcher = ResultOf(&IntFunction, Ge(85)); EXPECT_EQ("which is mapped by the given callable to 90" + OfType("int"), Explain(matcher, 36)); matcher = ResultOf(&IntFunction, GreaterThan(85)); EXPECT_EQ("which is mapped by the given callable to 90" + OfType("int") + ", which is 5 more than 85", Explain(matcher, 36)); } // Tests that ResultOf(f, ...) compiles and works as expected when f(x) // returns a non-reference. TEST(ResultOfTest, WorksForNonReferenceResults) { Matcher matcher = ResultOf(&IntFunction, Eq(80)); EXPECT_TRUE(matcher.Matches(42)); EXPECT_FALSE(matcher.Matches(36)); } // Tests that ResultOf(f, ...) compiles and works as expected when f(x) // returns a reference to non-const. double& DoubleFunction(double& input) { return input; } // NOLINT Uncopyable& RefUncopyableFunction(Uncopyable& obj) { // NOLINT return obj; } TEST(ResultOfTest, WorksForReferenceToNonConstResults) { double x = 3.14; double x2 = x; Matcher matcher = ResultOf(&DoubleFunction, Ref(x)); EXPECT_TRUE(matcher.Matches(x)); EXPECT_FALSE(matcher.Matches(x2)); // Test that ResultOf works with uncopyable objects Uncopyable obj(0); Uncopyable obj2(0); Matcher matcher2 = ResultOf(&RefUncopyableFunction, Ref(obj)); EXPECT_TRUE(matcher2.Matches(obj)); EXPECT_FALSE(matcher2.Matches(obj2)); } // Tests that ResultOf(f, ...) compiles and works as expected when f(x) // returns a reference to const. const string& StringFunction(const string& input) { return input; } TEST(ResultOfTest, WorksForReferenceToConstResults) { string s = "foo"; string s2 = s; Matcher matcher = ResultOf(&StringFunction, Ref(s)); EXPECT_TRUE(matcher.Matches(s)); EXPECT_FALSE(matcher.Matches(s2)); } // Tests that ResultOf(f, m) works when f(x) and m's // argument types are compatible but different. TEST(ResultOfTest, WorksForCompatibleMatcherTypes) { // IntFunction() returns int but the inner matcher expects a signed char. Matcher matcher = ResultOf(IntFunction, Matcher(Ge(85))); EXPECT_TRUE(matcher.Matches(36)); EXPECT_FALSE(matcher.Matches(42)); } // Tests that the program aborts when ResultOf is passed // a NULL function pointer. TEST(ResultOfDeathTest, DiesOnNullFunctionPointers) { EXPECT_DEATH_IF_SUPPORTED( ResultOf(static_cast(NULL), Eq(string("foo"))), "NULL function pointer is passed into ResultOf\\(\\)\\."); } // Tests that ResultOf(f, ...) compiles and works as expected when f is a // function reference. TEST(ResultOfTest, WorksForFunctionReferences) { Matcher matcher = ResultOf(IntToStringFunction, StrEq("foo")); EXPECT_TRUE(matcher.Matches(1)); EXPECT_FALSE(matcher.Matches(2)); } // Tests that ResultOf(f, ...) compiles and works as expected when f is a // function object. struct Functor : public ::std::unary_function { result_type operator()(argument_type input) const { return IntToStringFunction(input); } }; TEST(ResultOfTest, WorksForFunctors) { Matcher matcher = ResultOf(Functor(), Eq(string("foo"))); EXPECT_TRUE(matcher.Matches(1)); EXPECT_FALSE(matcher.Matches(2)); } // Tests that ResultOf(f, ...) compiles and works as expected when f is a // functor with more then one operator() defined. ResultOf() must work // for each defined operator(). struct PolymorphicFunctor { typedef int result_type; int operator()(int n) { return n; } int operator()(const char* s) { return static_cast(strlen(s)); } }; TEST(ResultOfTest, WorksForPolymorphicFunctors) { Matcher matcher_int = ResultOf(PolymorphicFunctor(), Ge(5)); EXPECT_TRUE(matcher_int.Matches(10)); EXPECT_FALSE(matcher_int.Matches(2)); Matcher matcher_string = ResultOf(PolymorphicFunctor(), Ge(5)); EXPECT_TRUE(matcher_string.Matches("long string")); EXPECT_FALSE(matcher_string.Matches("shrt")); } const int* ReferencingFunction(const int& n) { return &n; } struct ReferencingFunctor { typedef const int* result_type; result_type operator()(const int& n) { return &n; } }; TEST(ResultOfTest, WorksForReferencingCallables) { const int n = 1; const int n2 = 1; Matcher matcher2 = ResultOf(ReferencingFunction, Eq(&n)); EXPECT_TRUE(matcher2.Matches(n)); EXPECT_FALSE(matcher2.Matches(n2)); Matcher matcher3 = ResultOf(ReferencingFunctor(), Eq(&n)); EXPECT_TRUE(matcher3.Matches(n)); EXPECT_FALSE(matcher3.Matches(n2)); } class DivisibleByImpl { public: explicit DivisibleByImpl(int a_divider) : divider_(a_divider) {} // For testing using ExplainMatchResultTo() with polymorphic matchers. template bool MatchAndExplain(const T& n, MatchResultListener* listener) const { *listener << "which is " << (n % divider_) << " modulo " << divider_; return (n % divider_) == 0; } void DescribeTo(ostream* os) const { *os << "is divisible by " << divider_; } void DescribeNegationTo(ostream* os) const { *os << "is not divisible by " << divider_; } void set_divider(int a_divider) { divider_ = a_divider; } int divider() const { return divider_; } private: int divider_; }; PolymorphicMatcher DivisibleBy(int n) { return MakePolymorphicMatcher(DivisibleByImpl(n)); } // Tests that when AllOf() fails, only the first failing matcher is // asked to explain why. TEST(ExplainMatchResultTest, AllOf_False_False) { const Matcher m = AllOf(DivisibleBy(4), DivisibleBy(3)); EXPECT_EQ("which is 1 modulo 4", Explain(m, 5)); } // Tests that when AllOf() fails, only the first failing matcher is // asked to explain why. TEST(ExplainMatchResultTest, AllOf_False_True) { const Matcher m = AllOf(DivisibleBy(4), DivisibleBy(3)); EXPECT_EQ("which is 2 modulo 4", Explain(m, 6)); } // Tests that when AllOf() fails, only the first failing matcher is // asked to explain why. TEST(ExplainMatchResultTest, AllOf_True_False) { const Matcher m = AllOf(Ge(1), DivisibleBy(3)); EXPECT_EQ("which is 2 modulo 3", Explain(m, 5)); } // Tests that when AllOf() succeeds, all matchers are asked to explain // why. TEST(ExplainMatchResultTest, AllOf_True_True) { const Matcher m = AllOf(DivisibleBy(2), DivisibleBy(3)); EXPECT_EQ("which is 0 modulo 2, and which is 0 modulo 3", Explain(m, 6)); } TEST(ExplainMatchResultTest, AllOf_True_True_2) { const Matcher m = AllOf(Ge(2), Le(3)); EXPECT_EQ("", Explain(m, 2)); } TEST(ExplainmatcherResultTest, MonomorphicMatcher) { const Matcher m = GreaterThan(5); EXPECT_EQ("which is 1 more than 5", Explain(m, 6)); } // The following two tests verify that values without a public copy // ctor can be used as arguments to matchers like Eq(), Ge(), and etc // with the help of ByRef(). class NotCopyable { public: explicit NotCopyable(int a_value) : value_(a_value) {} int value() const { return value_; } bool operator==(const NotCopyable& rhs) const { return value() == rhs.value(); } bool operator>=(const NotCopyable& rhs) const { return value() >= rhs.value(); } private: int value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(NotCopyable); }; TEST(ByRefTest, AllowsNotCopyableConstValueInMatchers) { const NotCopyable const_value1(1); const Matcher m = Eq(ByRef(const_value1)); const NotCopyable n1(1), n2(2); EXPECT_TRUE(m.Matches(n1)); EXPECT_FALSE(m.Matches(n2)); } TEST(ByRefTest, AllowsNotCopyableValueInMatchers) { NotCopyable value2(2); const Matcher m = Ge(ByRef(value2)); NotCopyable n1(1), n2(2); EXPECT_FALSE(m.Matches(n1)); EXPECT_TRUE(m.Matches(n2)); } #if GTEST_HAS_TYPED_TEST // Tests ContainerEq with different container types, and // different element types. template class ContainerEqTest : public testing::Test {}; typedef testing::Types< set, vector, multiset, list > ContainerEqTestTypes; TYPED_TEST_CASE(ContainerEqTest, ContainerEqTestTypes); // Tests that the filled container is equal to itself. TYPED_TEST(ContainerEqTest, EqualsSelf) { static const int vals[] = {1, 1, 2, 3, 5, 8}; TypeParam my_set(vals, vals + 6); const Matcher m = ContainerEq(my_set); EXPECT_TRUE(m.Matches(my_set)); EXPECT_EQ("", Explain(m, my_set)); } // Tests that missing values are reported. TYPED_TEST(ContainerEqTest, ValueMissing) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {2, 1, 8, 5}; TypeParam my_set(vals, vals + 6); TypeParam test_set(test_vals, test_vals + 4); const Matcher m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which doesn't have these expected elements: 3", Explain(m, test_set)); } // Tests that added values are reported. TYPED_TEST(ContainerEqTest, ValueAdded) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 3, 5, 8, 46}; TypeParam my_set(vals, vals + 6); TypeParam test_set(test_vals, test_vals + 6); const Matcher m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which has these unexpected elements: 46", Explain(m, test_set)); } // Tests that added and missing values are reported together. TYPED_TEST(ContainerEqTest, ValueAddedAndRemoved) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 3, 8, 46}; TypeParam my_set(vals, vals + 6); TypeParam test_set(test_vals, test_vals + 5); const Matcher m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which has these unexpected elements: 46,\n" "and doesn't have these expected elements: 5", Explain(m, test_set)); } // Tests duplicated value -- expect no explanation. TYPED_TEST(ContainerEqTest, DuplicateDifference) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 3, 5, 8}; TypeParam my_set(vals, vals + 6); TypeParam test_set(test_vals, test_vals + 5); const Matcher m = ContainerEq(my_set); // Depending on the container, match may be true or false // But in any case there should be no explanation. EXPECT_EQ("", Explain(m, test_set)); } #endif // GTEST_HAS_TYPED_TEST // Tests that mutliple missing values are reported. // Using just vector here, so order is predicatble. TEST(ContainerEqExtraTest, MultipleValuesMissing) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {2, 1, 5}; vector my_set(vals, vals + 6); vector test_set(test_vals, test_vals + 3); const Matcher > m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which doesn't have these expected elements: 3, 8", Explain(m, test_set)); } // Tests that added values are reported. // Using just vector here, so order is predicatble. TEST(ContainerEqExtraTest, MultipleValuesAdded) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 92, 3, 5, 8, 46}; list my_set(vals, vals + 6); list test_set(test_vals, test_vals + 7); const Matcher&> m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which has these unexpected elements: 92, 46", Explain(m, test_set)); } // Tests that added and missing values are reported together. TEST(ContainerEqExtraTest, MultipleValuesAddedAndRemoved) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 3, 92, 46}; list my_set(vals, vals + 6); list test_set(test_vals, test_vals + 5); const Matcher > m = ContainerEq(my_set); EXPECT_FALSE(m.Matches(test_set)); EXPECT_EQ("which has these unexpected elements: 92, 46,\n" "and doesn't have these expected elements: 5, 8", Explain(m, test_set)); } // Tests to see that duplicate elements are detected, // but (as above) not reported in the explanation. TEST(ContainerEqExtraTest, MultiSetOfIntDuplicateDifference) { static const int vals[] = {1, 1, 2, 3, 5, 8}; static const int test_vals[] = {1, 2, 3, 5, 8}; vector my_set(vals, vals + 6); vector test_set(test_vals, test_vals + 5); const Matcher > m = ContainerEq(my_set); EXPECT_TRUE(m.Matches(my_set)); EXPECT_FALSE(m.Matches(test_set)); // There is nothing to report when both sets contain all the same values. EXPECT_EQ("", Explain(m, test_set)); } // Tests that ContainerEq works for non-trivial associative containers, // like maps. TEST(ContainerEqExtraTest, WorksForMaps) { map my_map; my_map[0] = "a"; my_map[1] = "b"; map test_map; test_map[0] = "aa"; test_map[1] = "b"; const Matcher&> m = ContainerEq(my_map); EXPECT_TRUE(m.Matches(my_map)); EXPECT_FALSE(m.Matches(test_map)); EXPECT_EQ("which has these unexpected elements: (0, \"aa\"),\n" "and doesn't have these expected elements: (0, \"a\")", Explain(m, test_map)); } TEST(ContainerEqExtraTest, WorksForNativeArray) { int a1[] = { 1, 2, 3 }; int a2[] = { 1, 2, 3 }; int b[] = { 1, 2, 4 }; EXPECT_THAT(a1, ContainerEq(a2)); EXPECT_THAT(a1, Not(ContainerEq(b))); } TEST(ContainerEqExtraTest, WorksForTwoDimensionalNativeArray) { const char a1[][3] = { "hi", "lo" }; const char a2[][3] = { "hi", "lo" }; const char b[][3] = { "lo", "hi" }; // Tests using ContainerEq() in the first dimension. EXPECT_THAT(a1, ContainerEq(a2)); EXPECT_THAT(a1, Not(ContainerEq(b))); // Tests using ContainerEq() in the second dimension. EXPECT_THAT(a1, ElementsAre(ContainerEq(a2[0]), ContainerEq(a2[1]))); EXPECT_THAT(a1, ElementsAre(Not(ContainerEq(b[0])), ContainerEq(a2[1]))); } TEST(ContainerEqExtraTest, WorksForNativeArrayAsTuple) { const int a1[] = { 1, 2, 3 }; const int a2[] = { 1, 2, 3 }; const int b[] = { 1, 2, 3, 4 }; const int* const p1 = a1; EXPECT_THAT(make_tuple(p1, 3), ContainerEq(a2)); EXPECT_THAT(make_tuple(p1, 3), Not(ContainerEq(b))); const int c[] = { 1, 3, 2 }; EXPECT_THAT(make_tuple(p1, 3), Not(ContainerEq(c))); } TEST(ContainerEqExtraTest, CopiesNativeArrayParameter) { std::string a1[][3] = { { "hi", "hello", "ciao" }, { "bye", "see you", "ciao" } }; std::string a2[][3] = { { "hi", "hello", "ciao" }, { "bye", "see you", "ciao" } }; const Matcher m = ContainerEq(a2); EXPECT_THAT(a1, m); a2[0][0] = "ha"; EXPECT_THAT(a1, m); } // Tests IsReadableTypeName(). TEST(IsReadableTypeNameTest, ReturnsTrueForShortNames) { EXPECT_TRUE(IsReadableTypeName("int")); EXPECT_TRUE(IsReadableTypeName("const unsigned char*")); EXPECT_TRUE(IsReadableTypeName("MyMap")); EXPECT_TRUE(IsReadableTypeName("void (*)(int, bool)")); } TEST(IsReadableTypeNameTest, ReturnsTrueForLongNonTemplateNonFunctionNames) { EXPECT_TRUE(IsReadableTypeName("my_long_namespace::MyClassName")); EXPECT_TRUE(IsReadableTypeName("int [5][6][7][8][9][10][11]")); EXPECT_TRUE(IsReadableTypeName("my_namespace::MyOuterClass::MyInnerClass")); } TEST(IsReadableTypeNameTest, ReturnsFalseForLongTemplateNames) { EXPECT_FALSE( IsReadableTypeName("basic_string >")); EXPECT_FALSE(IsReadableTypeName("std::vector >")); } TEST(IsReadableTypeNameTest, ReturnsFalseForLongFunctionTypeNames) { EXPECT_FALSE(IsReadableTypeName("void (&)(int, bool, char, float)")); } // Tests JoinAsTuple(). TEST(JoinAsTupleTest, JoinsEmptyTuple) { EXPECT_EQ("", JoinAsTuple(Strings())); } TEST(JoinAsTupleTest, JoinsOneTuple) { const char* fields[] = { "1" }; EXPECT_EQ("1", JoinAsTuple(Strings(fields, fields + 1))); } TEST(JoinAsTupleTest, JoinsTwoTuple) { const char* fields[] = { "1", "a" }; EXPECT_EQ("(1, a)", JoinAsTuple(Strings(fields, fields + 2))); } TEST(JoinAsTupleTest, JoinsTenTuple) { const char* fields[] = { "1", "2", "3", "4", "5", "6", "7", "8", "9", "10" }; EXPECT_EQ("(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)", JoinAsTuple(Strings(fields, fields + 10))); } // Tests FormatMatcherDescription(). TEST(FormatMatcherDescriptionTest, WorksForEmptyDescription) { EXPECT_EQ("is even", FormatMatcherDescription(false, "IsEven", Strings())); EXPECT_EQ("not (is even)", FormatMatcherDescription(true, "IsEven", Strings())); const char* params[] = { "5" }; EXPECT_EQ("equals 5", FormatMatcherDescription(false, "Equals", Strings(params, params + 1))); const char* params2[] = { "5", "8" }; EXPECT_EQ("is in range (5, 8)", FormatMatcherDescription(false, "IsInRange", Strings(params2, params2 + 2))); } // Tests PolymorphicMatcher::mutable_impl(). TEST(PolymorphicMatcherTest, CanAccessMutableImpl) { PolymorphicMatcher m(DivisibleByImpl(42)); DivisibleByImpl& impl = m.mutable_impl(); EXPECT_EQ(42, impl.divider()); impl.set_divider(0); EXPECT_EQ(0, m.mutable_impl().divider()); } // Tests PolymorphicMatcher::impl(). TEST(PolymorphicMatcherTest, CanAccessImpl) { const PolymorphicMatcher m(DivisibleByImpl(42)); const DivisibleByImpl& impl = m.impl(); EXPECT_EQ(42, impl.divider()); } TEST(MatcherTupleTest, ExplainsMatchFailure) { stringstream ss1; ExplainMatchFailureTupleTo(make_tuple(Matcher(Eq('a')), GreaterThan(5)), make_tuple('a', 10), &ss1); EXPECT_EQ("", ss1.str()); // Successful match. stringstream ss2; ExplainMatchFailureTupleTo(make_tuple(GreaterThan(5), Matcher(Eq('a'))), make_tuple(2, 'b'), &ss2); EXPECT_EQ(" Expected arg #0: is > 5\n" " Actual: 2, which is 3 less than 5\n" " Expected arg #1: is equal to 'a' (97, 0x61)\n" " Actual: 'b' (98, 0x62)\n", ss2.str()); // Failed match where both arguments need explanation. stringstream ss3; ExplainMatchFailureTupleTo(make_tuple(GreaterThan(5), Matcher(Eq('a'))), make_tuple(2, 'a'), &ss3); EXPECT_EQ(" Expected arg #0: is > 5\n" " Actual: 2, which is 3 less than 5\n", ss3.str()); // Failed match where only one argument needs // explanation. } // Tests Each(). TEST(EachTest, ExplainsMatchResultCorrectly) { set a; // empty Matcher > m = Each(2); EXPECT_EQ("", Explain(m, a)); Matcher n = Each(1); // NOLINT const int b[1] = { 1 }; EXPECT_EQ("", Explain(n, b)); n = Each(3); EXPECT_EQ("whose element #0 doesn't match", Explain(n, b)); a.insert(1); a.insert(2); a.insert(3); m = Each(GreaterThan(0)); EXPECT_EQ("", Explain(m, a)); m = Each(GreaterThan(10)); EXPECT_EQ("whose element #0 doesn't match, which is 9 less than 10", Explain(m, a)); } TEST(EachTest, DescribesItselfCorrectly) { Matcher > m = Each(1); EXPECT_EQ("only contains elements that is equal to 1", Describe(m)); Matcher > m2 = Not(m); EXPECT_EQ("contains some element that isn't equal to 1", Describe(m2)); } TEST(EachTest, MatchesVectorWhenAllElementsMatch) { vector some_vector; EXPECT_THAT(some_vector, Each(1)); some_vector.push_back(3); EXPECT_THAT(some_vector, Not(Each(1))); EXPECT_THAT(some_vector, Each(3)); some_vector.push_back(1); some_vector.push_back(2); EXPECT_THAT(some_vector, Not(Each(3))); EXPECT_THAT(some_vector, Each(Lt(3.5))); vector another_vector; another_vector.push_back("fee"); EXPECT_THAT(another_vector, Each(string("fee"))); another_vector.push_back("fie"); another_vector.push_back("foe"); another_vector.push_back("fum"); EXPECT_THAT(another_vector, Not(Each(string("fee")))); } TEST(EachTest, MatchesMapWhenAllElementsMatch) { map my_map; const char* bar = "a string"; my_map[bar] = 2; EXPECT_THAT(my_map, Each(make_pair(bar, 2))); map another_map; EXPECT_THAT(another_map, Each(make_pair(string("fee"), 1))); another_map["fee"] = 1; EXPECT_THAT(another_map, Each(make_pair(string("fee"), 1))); another_map["fie"] = 2; another_map["foe"] = 3; another_map["fum"] = 4; EXPECT_THAT(another_map, Not(Each(make_pair(string("fee"), 1)))); EXPECT_THAT(another_map, Not(Each(make_pair(string("fum"), 1)))); EXPECT_THAT(another_map, Each(Pair(_, Gt(0)))); } TEST(EachTest, AcceptsMatcher) { const int a[] = { 1, 2, 3 }; EXPECT_THAT(a, Each(Gt(0))); EXPECT_THAT(a, Not(Each(Gt(1)))); } TEST(EachTest, WorksForNativeArrayAsTuple) { const int a[] = { 1, 2 }; const int* const pointer = a; EXPECT_THAT(make_tuple(pointer, 2), Each(Gt(0))); EXPECT_THAT(make_tuple(pointer, 2), Not(Each(Gt(1)))); } // For testing Pointwise(). class IsHalfOfMatcher { public: template bool MatchAndExplain(const tuple& a_pair, MatchResultListener* listener) const { if (get<0>(a_pair) == get<1>(a_pair)/2) { *listener << "where the second is " << get<1>(a_pair); return true; } else { *listener << "where the second/2 is " << get<1>(a_pair)/2; return false; } } void DescribeTo(ostream* os) const { *os << "are a pair where the first is half of the second"; } void DescribeNegationTo(ostream* os) const { *os << "are a pair where the first isn't half of the second"; } }; PolymorphicMatcher IsHalfOf() { return MakePolymorphicMatcher(IsHalfOfMatcher()); } TEST(PointwiseTest, DescribesSelf) { vector rhs; rhs.push_back(1); rhs.push_back(2); rhs.push_back(3); const Matcher&> m = Pointwise(IsHalfOf(), rhs); EXPECT_EQ("contains 3 values, where each value and its corresponding value " "in { 1, 2, 3 } are a pair where the first is half of the second", Describe(m)); EXPECT_EQ("doesn't contain exactly 3 values, or contains a value x at some " "index i where x and the i-th value of { 1, 2, 3 } are a pair " "where the first isn't half of the second", DescribeNegation(m)); } TEST(PointwiseTest, MakesCopyOfRhs) { list rhs; rhs.push_back(2); rhs.push_back(4); int lhs[] = { 1, 2 }; const Matcher m = Pointwise(IsHalfOf(), rhs); EXPECT_THAT(lhs, m); // Changing rhs now shouldn't affect m, which made a copy of rhs. rhs.push_back(6); EXPECT_THAT(lhs, m); } TEST(PointwiseTest, WorksForLhsNativeArray) { const int lhs[] = { 1, 2, 3 }; vector rhs; rhs.push_back(2); rhs.push_back(4); rhs.push_back(6); EXPECT_THAT(lhs, Pointwise(Lt(), rhs)); EXPECT_THAT(lhs, Not(Pointwise(Gt(), rhs))); } TEST(PointwiseTest, WorksForRhsNativeArray) { const int rhs[] = { 1, 2, 3 }; vector lhs; lhs.push_back(2); lhs.push_back(4); lhs.push_back(6); EXPECT_THAT(lhs, Pointwise(Gt(), rhs)); EXPECT_THAT(lhs, Not(Pointwise(Lt(), rhs))); } TEST(PointwiseTest, RejectsWrongSize) { const double lhs[2] = { 1, 2 }; const int rhs[1] = { 0 }; EXPECT_THAT(lhs, Not(Pointwise(Gt(), rhs))); EXPECT_EQ("which contains 2 values", Explain(Pointwise(Gt(), rhs), lhs)); const int rhs2[3] = { 0, 1, 2 }; EXPECT_THAT(lhs, Not(Pointwise(Gt(), rhs2))); } TEST(PointwiseTest, RejectsWrongContent) { const double lhs[3] = { 1, 2, 3 }; const int rhs[3] = { 2, 6, 4 }; EXPECT_THAT(lhs, Not(Pointwise(IsHalfOf(), rhs))); EXPECT_EQ("where the value pair (2, 6) at index #1 don't match, " "where the second/2 is 3", Explain(Pointwise(IsHalfOf(), rhs), lhs)); } TEST(PointwiseTest, AcceptsCorrectContent) { const double lhs[3] = { 1, 2, 3 }; const int rhs[3] = { 2, 4, 6 }; EXPECT_THAT(lhs, Pointwise(IsHalfOf(), rhs)); EXPECT_EQ("", Explain(Pointwise(IsHalfOf(), rhs), lhs)); } TEST(PointwiseTest, AllowsMonomorphicInnerMatcher) { const double lhs[3] = { 1, 2, 3 }; const int rhs[3] = { 2, 4, 6 }; const Matcher > m1 = IsHalfOf(); EXPECT_THAT(lhs, Pointwise(m1, rhs)); EXPECT_EQ("", Explain(Pointwise(m1, rhs), lhs)); // This type works as a tuple can be // implicitly cast to tuple. const Matcher > m2 = IsHalfOf(); EXPECT_THAT(lhs, Pointwise(m2, rhs)); EXPECT_EQ("", Explain(Pointwise(m2, rhs), lhs)); } } // namespace gmock_matchers_test } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-more-actions_test.cc0000600000175000017500000005647011561126632025451 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the built-in actions in gmock-more-actions.h. #include "gmock/gmock-more-actions.h" #include #include #include #include "gmock/gmock.h" #include "gtest/gtest.h" #include "gtest/internal/gtest-linked_ptr.h" namespace testing { namespace gmock_more_actions_test { using ::std::plus; using ::std::string; using ::std::tr1::get; using ::std::tr1::make_tuple; using ::std::tr1::tuple; using ::std::tr1::tuple_element; using testing::_; using testing::Action; using testing::ActionInterface; using testing::DeleteArg; using testing::Invoke; using testing::Return; using testing::ReturnArg; using testing::ReturnPointee; using testing::SaveArg; using testing::SaveArgPointee; using testing::SetArgReferee; using testing::StaticAssertTypeEq; using testing::Unused; using testing::WithArg; using testing::WithoutArgs; using testing::internal::linked_ptr; // For suppressing compiler warnings on conversion possibly losing precision. inline short Short(short n) { return n; } // NOLINT inline char Char(char ch) { return ch; } // Sample functions and functors for testing Invoke() and etc. int Nullary() { return 1; } class NullaryFunctor { public: int operator()() { return 2; } }; bool g_done = false; void VoidNullary() { g_done = true; } class VoidNullaryFunctor { public: void operator()() { g_done = true; } }; bool Unary(int x) { return x < 0; } const char* Plus1(const char* s) { return s + 1; } void VoidUnary(int /* n */) { g_done = true; } bool ByConstRef(const string& s) { return s == "Hi"; } const double g_double = 0; bool ReferencesGlobalDouble(const double& x) { return &x == &g_double; } string ByNonConstRef(string& s) { return s += "+"; } // NOLINT struct UnaryFunctor { int operator()(bool x) { return x ? 1 : -1; } }; const char* Binary(const char* input, short n) { return input + n; } // NOLINT void VoidBinary(int, char) { g_done = true; } int Ternary(int x, char y, short z) { return x + y + z; } // NOLINT void VoidTernary(int, char, bool) { g_done = true; } int SumOf4(int a, int b, int c, int d) { return a + b + c + d; } int SumOfFirst2(int a, int b, Unused, Unused) { return a + b; } void VoidFunctionWithFourArguments(char, int, float, double) { g_done = true; } string Concat4(const char* s1, const char* s2, const char* s3, const char* s4) { return string(s1) + s2 + s3 + s4; } int SumOf5(int a, int b, int c, int d, int e) { return a + b + c + d + e; } struct SumOf5Functor { int operator()(int a, int b, int c, int d, int e) { return a + b + c + d + e; } }; string Concat5(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5) { return string(s1) + s2 + s3 + s4 + s5; } int SumOf6(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } struct SumOf6Functor { int operator()(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } }; string Concat6(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6) { return string(s1) + s2 + s3 + s4 + s5 + s6; } string Concat7(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7; } string Concat8(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8; } string Concat9(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9; } string Concat10(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9, const char* s10) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9 + s10; } class Foo { public: Foo() : value_(123) {} int Nullary() const { return value_; } short Unary(long x) { return static_cast(value_ + x); } // NOLINT string Binary(const string& str, char c) const { return str + c; } int Ternary(int x, bool y, char z) { return value_ + x + y*z; } int SumOf4(int a, int b, int c, int d) const { return a + b + c + d + value_; } int SumOfLast2(Unused, Unused, int a, int b) const { return a + b; } int SumOf5(int a, int b, int c, int d, int e) { return a + b + c + d + e; } int SumOf6(int a, int b, int c, int d, int e, int f) { return a + b + c + d + e + f; } string Concat7(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7; } string Concat8(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8; } string Concat9(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9; } string Concat10(const char* s1, const char* s2, const char* s3, const char* s4, const char* s5, const char* s6, const char* s7, const char* s8, const char* s9, const char* s10) { return string(s1) + s2 + s3 + s4 + s5 + s6 + s7 + s8 + s9 + s10; } private: int value_; }; // Tests using Invoke() with a nullary function. TEST(InvokeTest, Nullary) { Action a = Invoke(Nullary); // NOLINT EXPECT_EQ(1, a.Perform(make_tuple())); } // Tests using Invoke() with a unary function. TEST(InvokeTest, Unary) { Action a = Invoke(Unary); // NOLINT EXPECT_FALSE(a.Perform(make_tuple(1))); EXPECT_TRUE(a.Perform(make_tuple(-1))); } // Tests using Invoke() with a binary function. TEST(InvokeTest, Binary) { Action a = Invoke(Binary); // NOLINT const char* p = "Hello"; EXPECT_EQ(p + 2, a.Perform(make_tuple(p, Short(2)))); } // Tests using Invoke() with a ternary function. TEST(InvokeTest, Ternary) { Action a = Invoke(Ternary); // NOLINT EXPECT_EQ(6, a.Perform(make_tuple(1, '\2', Short(3)))); } // Tests using Invoke() with a 4-argument function. TEST(InvokeTest, FunctionThatTakes4Arguments) { Action a = Invoke(SumOf4); // NOLINT EXPECT_EQ(1234, a.Perform(make_tuple(1000, 200, 30, 4))); } // Tests using Invoke() with a 5-argument function. TEST(InvokeTest, FunctionThatTakes5Arguments) { Action a = Invoke(SumOf5); // NOLINT EXPECT_EQ(12345, a.Perform(make_tuple(10000, 2000, 300, 40, 5))); } // Tests using Invoke() with a 6-argument function. TEST(InvokeTest, FunctionThatTakes6Arguments) { Action a = Invoke(SumOf6); // NOLINT EXPECT_EQ(123456, a.Perform(make_tuple(100000, 20000, 3000, 400, 50, 6))); } // A helper that turns the type of a C-string literal from const // char[N] to const char*. inline const char* CharPtr(const char* s) { return s; } // Tests using Invoke() with a 7-argument function. TEST(InvokeTest, FunctionThatTakes7Arguments) { Action a = Invoke(Concat7); EXPECT_EQ("1234567", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7")))); } // Tests using Invoke() with a 8-argument function. TEST(InvokeTest, FunctionThatTakes8Arguments) { Action a = Invoke(Concat8); EXPECT_EQ("12345678", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8")))); } // Tests using Invoke() with a 9-argument function. TEST(InvokeTest, FunctionThatTakes9Arguments) { Action a = Invoke(Concat9); EXPECT_EQ("123456789", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8"), CharPtr("9")))); } // Tests using Invoke() with a 10-argument function. TEST(InvokeTest, FunctionThatTakes10Arguments) { Action a = Invoke(Concat10); EXPECT_EQ("1234567890", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8"), CharPtr("9"), CharPtr("0")))); } // Tests using Invoke() with functions with parameters declared as Unused. TEST(InvokeTest, FunctionWithUnusedParameters) { Action a1 = Invoke(SumOfFirst2); EXPECT_EQ(12, a1.Perform(make_tuple(10, 2, 5.6, CharPtr("hi")))); Action a2 = Invoke(SumOfFirst2); EXPECT_EQ(23, a2.Perform(make_tuple(20, 3, true, static_cast(NULL)))); } // Tests using Invoke() with methods with parameters declared as Unused. TEST(InvokeTest, MethodWithUnusedParameters) { Foo foo; Action a1 = Invoke(&foo, &Foo::SumOfLast2); EXPECT_EQ(12, a1.Perform(make_tuple(CharPtr("hi"), true, 10, 2))); Action a2 = Invoke(&foo, &Foo::SumOfLast2); EXPECT_EQ(23, a2.Perform(make_tuple('a', 2.5, 20, 3))); } // Tests using Invoke() with a functor. TEST(InvokeTest, Functor) { Action a = Invoke(plus()); // NOLINT EXPECT_EQ(3L, a.Perform(make_tuple(1, 2))); } // Tests using Invoke(f) as an action of a compatible type. TEST(InvokeTest, FunctionWithCompatibleType) { Action a = Invoke(SumOf4); // NOLINT EXPECT_EQ(4321, a.Perform(make_tuple(4000, Short(300), Char(20), true))); } // Tests using Invoke() with an object pointer and a method pointer. // Tests using Invoke() with a nullary method. TEST(InvokeMethodTest, Nullary) { Foo foo; Action a = Invoke(&foo, &Foo::Nullary); // NOLINT EXPECT_EQ(123, a.Perform(make_tuple())); } // Tests using Invoke() with a unary method. TEST(InvokeMethodTest, Unary) { Foo foo; Action a = Invoke(&foo, &Foo::Unary); // NOLINT EXPECT_EQ(4123, a.Perform(make_tuple(4000))); } // Tests using Invoke() with a binary method. TEST(InvokeMethodTest, Binary) { Foo foo; Action a = Invoke(&foo, &Foo::Binary); string s("Hell"); EXPECT_EQ("Hello", a.Perform(make_tuple(s, 'o'))); } // Tests using Invoke() with a ternary method. TEST(InvokeMethodTest, Ternary) { Foo foo; Action a = Invoke(&foo, &Foo::Ternary); // NOLINT EXPECT_EQ(1124, a.Perform(make_tuple(1000, true, Char(1)))); } // Tests using Invoke() with a 4-argument method. TEST(InvokeMethodTest, MethodThatTakes4Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::SumOf4); // NOLINT EXPECT_EQ(1357, a.Perform(make_tuple(1000, 200, 30, 4))); } // Tests using Invoke() with a 5-argument method. TEST(InvokeMethodTest, MethodThatTakes5Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::SumOf5); // NOLINT EXPECT_EQ(12345, a.Perform(make_tuple(10000, 2000, 300, 40, 5))); } // Tests using Invoke() with a 6-argument method. TEST(InvokeMethodTest, MethodThatTakes6Arguments) { Foo foo; Action a = // NOLINT Invoke(&foo, &Foo::SumOf6); EXPECT_EQ(123456, a.Perform(make_tuple(100000, 20000, 3000, 400, 50, 6))); } // Tests using Invoke() with a 7-argument method. TEST(InvokeMethodTest, MethodThatTakes7Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::Concat7); EXPECT_EQ("1234567", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7")))); } // Tests using Invoke() with a 8-argument method. TEST(InvokeMethodTest, MethodThatTakes8Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::Concat8); EXPECT_EQ("12345678", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8")))); } // Tests using Invoke() with a 9-argument method. TEST(InvokeMethodTest, MethodThatTakes9Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::Concat9); EXPECT_EQ("123456789", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8"), CharPtr("9")))); } // Tests using Invoke() with a 10-argument method. TEST(InvokeMethodTest, MethodThatTakes10Arguments) { Foo foo; Action a = Invoke(&foo, &Foo::Concat10); EXPECT_EQ("1234567890", a.Perform(make_tuple(CharPtr("1"), CharPtr("2"), CharPtr("3"), CharPtr("4"), CharPtr("5"), CharPtr("6"), CharPtr("7"), CharPtr("8"), CharPtr("9"), CharPtr("0")))); } // Tests using Invoke(f) as an action of a compatible type. TEST(InvokeMethodTest, MethodWithCompatibleType) { Foo foo; Action a = // NOLINT Invoke(&foo, &Foo::SumOf4); EXPECT_EQ(4444, a.Perform(make_tuple(4000, Short(300), Char(20), true))); } // Tests using WithoutArgs with an action that takes no argument. TEST(WithoutArgsTest, NoArg) { Action a = WithoutArgs(Invoke(Nullary)); // NOLINT EXPECT_EQ(1, a.Perform(make_tuple(2))); } // Tests using WithArg with an action that takes 1 argument. TEST(WithArgTest, OneArg) { Action b = WithArg<1>(Invoke(Unary)); // NOLINT EXPECT_TRUE(b.Perform(make_tuple(1.5, -1))); EXPECT_FALSE(b.Perform(make_tuple(1.5, 1))); } TEST(ReturnArgActionTest, WorksForOneArgIntArg0) { const Action a = ReturnArg<0>(); EXPECT_EQ(5, a.Perform(make_tuple(5))); } TEST(ReturnArgActionTest, WorksForMultiArgBoolArg0) { const Action a = ReturnArg<0>(); EXPECT_TRUE(a.Perform(make_tuple(true, false, false))); } TEST(ReturnArgActionTest, WorksForMultiArgStringArg2) { const Action a = ReturnArg<2>(); EXPECT_EQ("seven", a.Perform(make_tuple(5, 6, string("seven"), 8))); } TEST(SaveArgActionTest, WorksForSameType) { int result = 0; const Action a1 = SaveArg<0>(&result); a1.Perform(make_tuple(5)); EXPECT_EQ(5, result); } TEST(SaveArgActionTest, WorksForCompatibleType) { int result = 0; const Action a1 = SaveArg<1>(&result); a1.Perform(make_tuple(true, 'a')); EXPECT_EQ('a', result); } TEST(SaveArgPointeeActionTest, WorksForSameType) { int result = 0; const int value = 5; const Action a1 = SaveArgPointee<0>(&result); a1.Perform(make_tuple(&value)); EXPECT_EQ(5, result); } TEST(SaveArgPointeeActionTest, WorksForCompatibleType) { int result = 0; char value = 'a'; const Action a1 = SaveArgPointee<1>(&result); a1.Perform(make_tuple(true, &value)); EXPECT_EQ('a', result); } TEST(SaveArgPointeeActionTest, WorksForLinkedPtr) { int result = 0; linked_ptr value(new int(5)); const Action)> a1 = SaveArgPointee<0>(&result); a1.Perform(make_tuple(value)); EXPECT_EQ(5, result); } TEST(SetArgRefereeActionTest, WorksForSameType) { int value = 0; const Action a1 = SetArgReferee<0>(1); a1.Perform(tuple(value)); EXPECT_EQ(1, value); } TEST(SetArgRefereeActionTest, WorksForCompatibleType) { int value = 0; const Action a1 = SetArgReferee<1>('a'); a1.Perform(tuple(0, value)); EXPECT_EQ('a', value); } TEST(SetArgRefereeActionTest, WorksWithExtraArguments) { int value = 0; const Action a1 = SetArgReferee<2>('a'); a1.Perform(tuple(true, 0, value, "hi")); EXPECT_EQ('a', value); } // A class that can be used to verify that its destructor is called: it will set // the bool provided to the constructor to true when destroyed. class DeletionTester { public: explicit DeletionTester(bool* is_deleted) : is_deleted_(is_deleted) { // Make sure the bit is set to false. *is_deleted_ = false; } ~DeletionTester() { *is_deleted_ = true; } private: bool* is_deleted_; }; TEST(DeleteArgActionTest, OneArg) { bool is_deleted = false; DeletionTester* t = new DeletionTester(&is_deleted); const Action a1 = DeleteArg<0>(); // NOLINT EXPECT_FALSE(is_deleted); a1.Perform(make_tuple(t)); EXPECT_TRUE(is_deleted); } TEST(DeleteArgActionTest, TenArgs) { bool is_deleted = false; DeletionTester* t = new DeletionTester(&is_deleted); const Action a1 = DeleteArg<9>(); EXPECT_FALSE(is_deleted); a1.Perform(make_tuple(true, 5, 6, CharPtr("hi"), false, 7, 8, 9, 10, t)); EXPECT_TRUE(is_deleted); } #if GTEST_HAS_EXCEPTIONS TEST(ThrowActionTest, ThrowsGivenExceptionInVoidFunction) { const Action a = Throw('a'); EXPECT_THROW(a.Perform(make_tuple(0)), char); } class MyException {}; TEST(ThrowActionTest, ThrowsGivenExceptionInNonVoidFunction) { const Action a = Throw(MyException()); EXPECT_THROW(a.Perform(make_tuple('0')), MyException); } TEST(ThrowActionTest, ThrowsGivenExceptionInNullaryFunction) { const Action a = Throw(MyException()); EXPECT_THROW(a.Perform(make_tuple()), MyException); } #endif // GTEST_HAS_EXCEPTIONS // Tests that SetArrayArgument(first, last) sets the elements of the array // pointed to by the N-th (0-based) argument to values in range [first, last). TEST(SetArrayArgumentTest, SetsTheNthArray) { typedef void MyFunction(bool, int*, char*); int numbers[] = { 1, 2, 3 }; Action a = SetArrayArgument<1>(numbers, numbers + 3); int n[4] = {}; int* pn = n; char ch[4] = {}; char* pch = ch; a.Perform(make_tuple(true, pn, pch)); EXPECT_EQ(1, n[0]); EXPECT_EQ(2, n[1]); EXPECT_EQ(3, n[2]); EXPECT_EQ(0, n[3]); EXPECT_EQ('\0', ch[0]); EXPECT_EQ('\0', ch[1]); EXPECT_EQ('\0', ch[2]); EXPECT_EQ('\0', ch[3]); // Tests first and last are iterators. std::string letters = "abc"; a = SetArrayArgument<2>(letters.begin(), letters.end()); std::fill_n(n, 4, 0); std::fill_n(ch, 4, '\0'); a.Perform(make_tuple(true, pn, pch)); EXPECT_EQ(0, n[0]); EXPECT_EQ(0, n[1]); EXPECT_EQ(0, n[2]); EXPECT_EQ(0, n[3]); EXPECT_EQ('a', ch[0]); EXPECT_EQ('b', ch[1]); EXPECT_EQ('c', ch[2]); EXPECT_EQ('\0', ch[3]); } // Tests SetArrayArgument(first, last) where first == last. TEST(SetArrayArgumentTest, SetsTheNthArrayWithEmptyRange) { typedef void MyFunction(bool, int*); int numbers[] = { 1, 2, 3 }; Action a = SetArrayArgument<1>(numbers, numbers); int n[4] = {}; int* pn = n; a.Perform(make_tuple(true, pn)); EXPECT_EQ(0, n[0]); EXPECT_EQ(0, n[1]); EXPECT_EQ(0, n[2]); EXPECT_EQ(0, n[3]); } // Tests SetArrayArgument(first, last) where *first is convertible // (but not equal) to the argument type. TEST(SetArrayArgumentTest, SetsTheNthArrayWithConvertibleType) { typedef void MyFunction(bool, char*); int codes[] = { 97, 98, 99 }; Action a = SetArrayArgument<1>(codes, codes + 3); char ch[4] = {}; char* pch = ch; a.Perform(make_tuple(true, pch)); EXPECT_EQ('a', ch[0]); EXPECT_EQ('b', ch[1]); EXPECT_EQ('c', ch[2]); EXPECT_EQ('\0', ch[3]); } // Test SetArrayArgument(first, last) with iterator as argument. TEST(SetArrayArgumentTest, SetsTheNthArrayWithIteratorArgument) { typedef void MyFunction(bool, std::back_insert_iterator); std::string letters = "abc"; Action a = SetArrayArgument<1>(letters.begin(), letters.end()); std::string s; a.Perform(make_tuple(true, back_inserter(s))); EXPECT_EQ(letters, s); } TEST(ReturnPointeeTest, Works) { int n = 42; const Action a = ReturnPointee(&n); EXPECT_EQ(42, a.Perform(make_tuple())); n = 43; EXPECT_EQ(43, a.Perform(make_tuple())); } } // namespace gmock_generated_actions_test } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-nice-strict_test.cc0000600000175000017500000002136211561126632025265 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gmock/gmock-generated-nice-strict.h" #include #include "gmock/gmock.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" // This must not be defined inside the ::testing namespace, or it will // clash with ::testing::Mock. class Mock { public: Mock() {} MOCK_METHOD0(DoThis, void()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mock); }; namespace testing { namespace gmock_nice_strict_test { using testing::internal::string; using testing::GMOCK_FLAG(verbose); using testing::HasSubstr; using testing::NiceMock; using testing::StrictMock; #if GTEST_HAS_STREAM_REDIRECTION using testing::internal::CaptureStdout; using testing::internal::GetCapturedStdout; #endif // Defines some mock classes needed by the tests. class Foo { public: virtual ~Foo() {} virtual void DoThis() = 0; virtual int DoThat(bool flag) = 0; }; class MockFoo : public Foo { public: MockFoo() {} void Delete() { delete this; } MOCK_METHOD0(DoThis, void()); MOCK_METHOD1(DoThat, int(bool flag)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); }; class MockBar { public: explicit MockBar(const string& s) : str_(s) {} MockBar(char a1, char a2, string a3, string a4, int a5, int a6, const string& a7, const string& a8, bool a9, bool a10) { str_ = string() + a1 + a2 + a3 + a4 + static_cast(a5) + static_cast(a6) + a7 + a8 + (a9 ? 'T' : 'F') + (a10 ? 'T' : 'F'); } virtual ~MockBar() {} const string& str() const { return str_; } MOCK_METHOD0(This, int()); MOCK_METHOD2(That, string(int, bool)); private: string str_; GTEST_DISALLOW_COPY_AND_ASSIGN_(MockBar); }; #if GTEST_HAS_STREAM_REDIRECTION // Tests that a nice mock generates no warning for uninteresting calls. TEST(NiceMockTest, NoWarningForUninterestingCall) { NiceMock nice_foo; CaptureStdout(); nice_foo.DoThis(); nice_foo.DoThat(true); EXPECT_STREQ("", GetCapturedStdout().c_str()); } // Tests that a nice mock generates no warning for uninteresting calls // that delete the mock object. TEST(NiceMockTest, NoWarningForUninterestingCallAfterDeath) { NiceMock* const nice_foo = new NiceMock; ON_CALL(*nice_foo, DoThis()) .WillByDefault(Invoke(nice_foo, &MockFoo::Delete)); CaptureStdout(); nice_foo->DoThis(); EXPECT_STREQ("", GetCapturedStdout().c_str()); } // Tests that a nice mock generates informational logs for // uninteresting calls. TEST(NiceMockTest, InfoForUninterestingCall) { NiceMock nice_foo; const string saved_flag = GMOCK_FLAG(verbose); GMOCK_FLAG(verbose) = "info"; CaptureStdout(); nice_foo.DoThis(); EXPECT_THAT(GetCapturedStdout(), HasSubstr("Uninteresting mock function call")); CaptureStdout(); nice_foo.DoThat(true); EXPECT_THAT(GetCapturedStdout(), HasSubstr("Uninteresting mock function call")); GMOCK_FLAG(verbose) = saved_flag; } #endif // GTEST_HAS_STREAM_REDIRECTION // Tests that a nice mock allows expected calls. TEST(NiceMockTest, AllowsExpectedCall) { NiceMock nice_foo; EXPECT_CALL(nice_foo, DoThis()); nice_foo.DoThis(); } // Tests that an unexpected call on a nice mock fails. TEST(NiceMockTest, UnexpectedCallFails) { NiceMock nice_foo; EXPECT_CALL(nice_foo, DoThis()).Times(0); EXPECT_NONFATAL_FAILURE(nice_foo.DoThis(), "called more times than expected"); } // Tests that NiceMock works with a mock class that has a non-default // constructor. TEST(NiceMockTest, NonDefaultConstructor) { NiceMock nice_bar("hi"); EXPECT_EQ("hi", nice_bar.str()); nice_bar.This(); nice_bar.That(5, true); } // Tests that NiceMock works with a mock class that has a 10-ary // non-default constructor. TEST(NiceMockTest, NonDefaultConstructor10) { NiceMock nice_bar('a', 'b', "c", "d", 'e', 'f', "g", "h", true, false); EXPECT_EQ("abcdefghTF", nice_bar.str()); nice_bar.This(); nice_bar.That(5, true); } #if !GTEST_OS_SYMBIAN && !GTEST_OS_WINDOWS_MOBILE // Tests that NiceMock compiles where Mock is a user-defined // class (as opposed to ::testing::Mock). We had to workaround an // MSVC 8.0 bug that caused the symbol Mock used in the definition of // NiceMock to be looked up in the wrong context, and this test // ensures that our fix works. // // We have to skip this test on Symbian and Windows Mobile, as it // causes the program to crash there, for reasons unclear to us yet. TEST(NiceMockTest, AcceptsClassNamedMock) { NiceMock< ::Mock> nice; EXPECT_CALL(nice, DoThis()); nice.DoThis(); } #endif // !GTEST_OS_SYMBIAN && !GTEST_OS_WINDOWS_MOBILE // Tests that a strict mock allows expected calls. TEST(StrictMockTest, AllowsExpectedCall) { StrictMock strict_foo; EXPECT_CALL(strict_foo, DoThis()); strict_foo.DoThis(); } // Tests that an unexpected call on a strict mock fails. TEST(StrictMockTest, UnexpectedCallFails) { StrictMock strict_foo; EXPECT_CALL(strict_foo, DoThis()).Times(0); EXPECT_NONFATAL_FAILURE(strict_foo.DoThis(), "called more times than expected"); } // Tests that an uninteresting call on a strict mock fails. TEST(StrictMockTest, UninterestingCallFails) { StrictMock strict_foo; EXPECT_NONFATAL_FAILURE(strict_foo.DoThis(), "Uninteresting mock function call"); } // Tests that an uninteresting call on a strict mock fails, even if // the call deletes the mock object. TEST(StrictMockTest, UninterestingCallFailsAfterDeath) { StrictMock* const strict_foo = new StrictMock; ON_CALL(*strict_foo, DoThis()) .WillByDefault(Invoke(strict_foo, &MockFoo::Delete)); EXPECT_NONFATAL_FAILURE(strict_foo->DoThis(), "Uninteresting mock function call"); } // Tests that StrictMock works with a mock class that has a // non-default constructor. TEST(StrictMockTest, NonDefaultConstructor) { StrictMock strict_bar("hi"); EXPECT_EQ("hi", strict_bar.str()); EXPECT_NONFATAL_FAILURE(strict_bar.That(5, true), "Uninteresting mock function call"); } // Tests that StrictMock works with a mock class that has a 10-ary // non-default constructor. TEST(StrictMockTest, NonDefaultConstructor10) { StrictMock strict_bar('a', 'b', "c", "d", 'e', 'f', "g", "h", true, false); EXPECT_EQ("abcdefghTF", strict_bar.str()); EXPECT_NONFATAL_FAILURE(strict_bar.That(5, true), "Uninteresting mock function call"); } #if !GTEST_OS_SYMBIAN && !GTEST_OS_WINDOWS_MOBILE // Tests that StrictMock compiles where Mock is a user-defined // class (as opposed to ::testing::Mock). We had to workaround an // MSVC 8.0 bug that caused the symbol Mock used in the definition of // StrictMock to be looked up in the wrong context, and this test // ensures that our fix works. // // We have to skip this test on Symbian and Windows Mobile, as it // causes the program to crash there, for reasons unclear to us yet. TEST(StrictMockTest, AcceptsClassNamedMock) { StrictMock< ::Mock> strict; EXPECT_CALL(strict, DoThis()); strict.DoThis(); } #endif // !GTEST_OS_SYMBIAN && !GTEST_OS_WINDOWS_MOBILE } // namespace gmock_nice_strict_test } // namespace testing synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-port_test.cc0000600000175000017500000000374411561126632024031 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Google Mock - a framework for writing C++ mock classes. // // This file tests the internal cross-platform support utilities. #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" // NOTE: if this file is left without tests for some reason, put a dummy // test here to make references to symbols in the gtest library and avoid // 'undefined symbol' linker errors in gmock_main: TEST(DummyTest, Dummy) {} synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock-spec-builders_test.cc0000600000175000017500000020067611561126632025611 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests the spec builder syntax. #include "gmock/gmock-spec-builders.h" #include // NOLINT #include #include #include "gmock/gmock.h" #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" #include "gtest/gtest-spi.h" #include "gtest/internal/gtest-port.h" namespace testing { namespace internal { // Helper class for testing the Expectation class template. class ExpectationTester { public: // Sets the call count of the given expectation to the given number. void SetCallCount(int n, ExpectationBase* exp) { exp->call_count_ = n; } }; } // namespace internal } // namespace testing namespace { using testing::_; using testing::AnyNumber; using testing::AtLeast; using testing::AtMost; using testing::Between; using testing::Cardinality; using testing::CardinalityInterface; using testing::ContainsRegex; using testing::Const; using testing::DoAll; using testing::DoDefault; using testing::Eq; using testing::Expectation; using testing::ExpectationSet; using testing::GMOCK_FLAG(verbose); using testing::Gt; using testing::InSequence; using testing::Invoke; using testing::InvokeWithoutArgs; using testing::IsSubstring; using testing::Lt; using testing::Message; using testing::Mock; using testing::Ne; using testing::Return; using testing::Sequence; using testing::internal::ExpectationTester; using testing::internal::FormatFileLocation; using testing::internal::g_gmock_mutex; using testing::internal::kErrorVerbosity; using testing::internal::kInfoVerbosity; using testing::internal::kWarningVerbosity; using testing::internal::String; using testing::internal::string; #if GTEST_HAS_STREAM_REDIRECTION using testing::HasSubstr; using testing::internal::CaptureStdout; using testing::internal::GetCapturedStdout; #endif class Incomplete; class MockIncomplete { public: // This line verifies that a mock method can take a by-reference // argument of an incomplete type. MOCK_METHOD1(ByRefFunc, void(const Incomplete& x)); }; // Tells Google Mock how to print a value of type Incomplete. void PrintTo(const Incomplete& x, ::std::ostream* os); TEST(MockMethodTest, CanInstantiateWithIncompleteArgType) { // Even though this mock class contains a mock method that takes // by-reference an argument whose type is incomplete, we can still // use the mock, as long as Google Mock knows how to print the // argument. MockIncomplete incomplete; EXPECT_CALL(incomplete, ByRefFunc(_)) .Times(AnyNumber()); } // The definition of the printer for the argument type doesn't have to // be visible where the mock is used. void PrintTo(const Incomplete& /* x */, ::std::ostream* os) { *os << "incomplete"; } class Result {}; class MockA { public: MockA() {} MOCK_METHOD1(DoA, void(int n)); // NOLINT MOCK_METHOD1(ReturnResult, Result(int n)); // NOLINT MOCK_METHOD2(Binary, bool(int x, int y)); // NOLINT MOCK_METHOD2(ReturnInt, int(int x, int y)); // NOLINT private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockA); }; class MockB { public: MockB() {} MOCK_CONST_METHOD0(DoB, int()); // NOLINT MOCK_METHOD1(DoB, int(int n)); // NOLINT private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockB); }; // Tests that EXPECT_CALL and ON_CALL compile in a presence of macro // redefining a mock method name. This could happen, for example, when // the tested code #includes Win32 API headers which define many APIs // as macros, e.g. #define TextOut TextOutW. #define Method MethodW class CC { public: virtual ~CC() {} virtual int Method() = 0; }; class MockCC : public CC { public: MockCC() {} MOCK_METHOD0(Method, int()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockCC); }; // Tests that a method with expanded name compiles. TEST(OnCallSyntaxTest, CompilesWithMethodNameExpandedFromMacro) { MockCC cc; ON_CALL(cc, Method()); } // Tests that the method with expanded name not only compiles but runs // and returns a correct value, too. TEST(OnCallSyntaxTest, WorksWithMethodNameExpandedFromMacro) { MockCC cc; ON_CALL(cc, Method()).WillByDefault(Return(42)); EXPECT_EQ(42, cc.Method()); } // Tests that a method with expanded name compiles. TEST(ExpectCallSyntaxTest, CompilesWithMethodNameExpandedFromMacro) { MockCC cc; EXPECT_CALL(cc, Method()); cc.Method(); } // Tests that it works, too. TEST(ExpectCallSyntaxTest, WorksWithMethodNameExpandedFromMacro) { MockCC cc; EXPECT_CALL(cc, Method()).WillOnce(Return(42)); EXPECT_EQ(42, cc.Method()); } #undef Method // Done with macro redefinition tests. // Tests that ON_CALL evaluates its arguments exactly once as promised // by Google Mock. TEST(OnCallSyntaxTest, EvaluatesFirstArgumentOnce) { MockA a; MockA* pa = &a; ON_CALL(*pa++, DoA(_)); EXPECT_EQ(&a + 1, pa); } TEST(OnCallSyntaxTest, EvaluatesSecondArgumentOnce) { MockA a; int n = 0; ON_CALL(a, DoA(n++)); EXPECT_EQ(1, n); } // Tests that the syntax of ON_CALL() is enforced at run time. TEST(OnCallSyntaxTest, WithIsOptional) { MockA a; ON_CALL(a, DoA(5)) .WillByDefault(Return()); ON_CALL(a, DoA(_)) .With(_) .WillByDefault(Return()); } TEST(OnCallSyntaxTest, WithCanAppearAtMostOnce) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT ON_CALL(a, ReturnResult(_)) .With(_) .With(_) .WillByDefault(Return(Result())); }, ".With() cannot appear more than once in an ON_CALL()"); } TEST(OnCallSyntaxTest, WillByDefaultIsMandatory) { MockA a; EXPECT_DEATH_IF_SUPPORTED({ ON_CALL(a, DoA(5)); a.DoA(5); }, ""); } TEST(OnCallSyntaxTest, WillByDefaultCanAppearAtMostOnce) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT ON_CALL(a, DoA(5)) .WillByDefault(Return()) .WillByDefault(Return()); }, ".WillByDefault() must appear exactly once in an ON_CALL()"); } // Tests that EXPECT_CALL evaluates its arguments exactly once as // promised by Google Mock. TEST(ExpectCallSyntaxTest, EvaluatesFirstArgumentOnce) { MockA a; MockA* pa = &a; EXPECT_CALL(*pa++, DoA(_)); a.DoA(0); EXPECT_EQ(&a + 1, pa); } TEST(ExpectCallSyntaxTest, EvaluatesSecondArgumentOnce) { MockA a; int n = 0; EXPECT_CALL(a, DoA(n++)); a.DoA(0); EXPECT_EQ(1, n); } // Tests that the syntax of EXPECT_CALL() is enforced at run time. TEST(ExpectCallSyntaxTest, WithIsOptional) { MockA a; EXPECT_CALL(a, DoA(5)) .Times(0); EXPECT_CALL(a, DoA(6)) .With(_) .Times(0); } TEST(ExpectCallSyntaxTest, WithCanAppearAtMostOnce) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(6)) .With(_) .With(_); }, ".With() cannot appear more than once in an EXPECT_CALL()"); a.DoA(6); } TEST(ExpectCallSyntaxTest, WithMustBeFirstClause) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .Times(1) .With(_); }, ".With() must be the first clause in an EXPECT_CALL()"); a.DoA(1); EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(2)) .WillOnce(Return()) .With(_); }, ".With() must be the first clause in an EXPECT_CALL()"); a.DoA(2); } TEST(ExpectCallSyntaxTest, TimesCanBeInferred) { MockA a; EXPECT_CALL(a, DoA(1)) .WillOnce(Return()); EXPECT_CALL(a, DoA(2)) .WillOnce(Return()) .WillRepeatedly(Return()); a.DoA(1); a.DoA(2); a.DoA(2); } TEST(ExpectCallSyntaxTest, TimesCanAppearAtMostOnce) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .Times(1) .Times(2); }, ".Times() cannot appear more than once in an EXPECT_CALL()"); a.DoA(1); a.DoA(1); } TEST(ExpectCallSyntaxTest, TimesMustBeBeforeInSequence) { MockA a; Sequence s; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .InSequence(s) .Times(1); }, ".Times() cannot appear after "); a.DoA(1); } TEST(ExpectCallSyntaxTest, InSequenceIsOptional) { MockA a; Sequence s; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(2)) .InSequence(s); a.DoA(1); a.DoA(2); } TEST(ExpectCallSyntaxTest, InSequenceCanAppearMultipleTimes) { MockA a; Sequence s1, s2; EXPECT_CALL(a, DoA(1)) .InSequence(s1, s2) .InSequence(s1); a.DoA(1); } TEST(ExpectCallSyntaxTest, InSequenceMustBeBeforeAfter) { MockA a; Sequence s; Expectation e = EXPECT_CALL(a, DoA(1)) .Times(AnyNumber()); EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(2)) .After(e) .InSequence(s); }, ".InSequence() cannot appear after "); a.DoA(2); } TEST(ExpectCallSyntaxTest, InSequenceMustBeBeforeWillOnce) { MockA a; Sequence s; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .WillOnce(Return()) .InSequence(s); }, ".InSequence() cannot appear after "); a.DoA(1); } TEST(ExpectCallSyntaxTest, AfterMustBeBeforeWillOnce) { MockA a; Expectation e = EXPECT_CALL(a, DoA(1)); EXPECT_NONFATAL_FAILURE({ EXPECT_CALL(a, DoA(2)) .WillOnce(Return()) .After(e); }, ".After() cannot appear after "); a.DoA(1); a.DoA(2); } TEST(ExpectCallSyntaxTest, WillIsOptional) { MockA a; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(2)) .WillOnce(Return()); a.DoA(1); a.DoA(2); } TEST(ExpectCallSyntaxTest, WillCanAppearMultipleTimes) { MockA a; EXPECT_CALL(a, DoA(1)) .Times(AnyNumber()) .WillOnce(Return()) .WillOnce(Return()) .WillOnce(Return()); } TEST(ExpectCallSyntaxTest, WillMustBeBeforeWillRepeatedly) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .WillRepeatedly(Return()) .WillOnce(Return()); }, ".WillOnce() cannot appear after "); a.DoA(1); } TEST(ExpectCallSyntaxTest, WillRepeatedlyIsOptional) { MockA a; EXPECT_CALL(a, DoA(1)) .WillOnce(Return()); EXPECT_CALL(a, DoA(2)) .WillOnce(Return()) .WillRepeatedly(Return()); a.DoA(1); a.DoA(2); a.DoA(2); } TEST(ExpectCallSyntaxTest, WillRepeatedlyCannotAppearMultipleTimes) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .WillRepeatedly(Return()) .WillRepeatedly(Return()); }, ".WillRepeatedly() cannot appear more than once in an " "EXPECT_CALL()"); } TEST(ExpectCallSyntaxTest, WillRepeatedlyMustBeBeforeRetiresOnSaturation) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .RetiresOnSaturation() .WillRepeatedly(Return()); }, ".WillRepeatedly() cannot appear after "); } TEST(ExpectCallSyntaxTest, RetiresOnSaturationIsOptional) { MockA a; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(1)) .RetiresOnSaturation(); a.DoA(1); a.DoA(1); } TEST(ExpectCallSyntaxTest, RetiresOnSaturationCannotAppearMultipleTimes) { MockA a; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_CALL(a, DoA(1)) .RetiresOnSaturation() .RetiresOnSaturation(); }, ".RetiresOnSaturation() cannot appear more than once"); a.DoA(1); } TEST(ExpectCallSyntaxTest, DefaultCardinalityIsOnce) { { MockA a; EXPECT_CALL(a, DoA(1)); a.DoA(1); } EXPECT_NONFATAL_FAILURE({ // NOLINT MockA a; EXPECT_CALL(a, DoA(1)); }, "to be called once"); EXPECT_NONFATAL_FAILURE({ // NOLINT MockA a; EXPECT_CALL(a, DoA(1)); a.DoA(1); a.DoA(1); }, "to be called once"); } #if GTEST_HAS_STREAM_REDIRECTION // Tests that Google Mock doesn't print a warning when the number of // WillOnce() is adequate. TEST(ExpectCallSyntaxTest, DoesNotWarnOnAdequateActionCount) { CaptureStdout(); { MockB b; // It's always fine to omit WillOnce() entirely. EXPECT_CALL(b, DoB()) .Times(0); EXPECT_CALL(b, DoB(1)) .Times(AtMost(1)); EXPECT_CALL(b, DoB(2)) .Times(1) .WillRepeatedly(Return(1)); // It's fine for the number of WillOnce()s to equal the upper bound. EXPECT_CALL(b, DoB(3)) .Times(Between(1, 2)) .WillOnce(Return(1)) .WillOnce(Return(2)); // It's fine for the number of WillOnce()s to be smaller than the // upper bound when there is a WillRepeatedly(). EXPECT_CALL(b, DoB(4)) .Times(AtMost(3)) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); // Satisfies the above expectations. b.DoB(2); b.DoB(3); } EXPECT_STREQ("", GetCapturedStdout().c_str()); } // Tests that Google Mock warns on having too many actions in an // expectation compared to its cardinality. TEST(ExpectCallSyntaxTest, WarnsOnTooManyActions) { CaptureStdout(); { MockB b; // Warns when the number of WillOnce()s is larger than the upper bound. EXPECT_CALL(b, DoB()) .Times(0) .WillOnce(Return(1)); // #1 EXPECT_CALL(b, DoB()) .Times(AtMost(1)) .WillOnce(Return(1)) .WillOnce(Return(2)); // #2 EXPECT_CALL(b, DoB(1)) .Times(1) .WillOnce(Return(1)) .WillOnce(Return(2)) .RetiresOnSaturation(); // #3 // Warns when the number of WillOnce()s equals the upper bound and // there is a WillRepeatedly(). EXPECT_CALL(b, DoB()) .Times(0) .WillRepeatedly(Return(1)); // #4 EXPECT_CALL(b, DoB(2)) .Times(1) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); // #5 // Satisfies the above expectations. b.DoB(1); b.DoB(2); } const String output = GetCapturedStdout(); EXPECT_PRED_FORMAT2( IsSubstring, "Too many actions specified in EXPECT_CALL(b, DoB())...\n" "Expected to be never called, but has 1 WillOnce().", output); // #1 EXPECT_PRED_FORMAT2( IsSubstring, "Too many actions specified in EXPECT_CALL(b, DoB())...\n" "Expected to be called at most once, " "but has 2 WillOnce()s.", output); // #2 EXPECT_PRED_FORMAT2( IsSubstring, "Too many actions specified in EXPECT_CALL(b, DoB(1))...\n" "Expected to be called once, but has 2 WillOnce()s.", output); // #3 EXPECT_PRED_FORMAT2( IsSubstring, "Too many actions specified in EXPECT_CALL(b, DoB())...\n" "Expected to be never called, but has 0 WillOnce()s " "and a WillRepeatedly().", output); // #4 EXPECT_PRED_FORMAT2( IsSubstring, "Too many actions specified in EXPECT_CALL(b, DoB(2))...\n" "Expected to be called once, but has 1 WillOnce() " "and a WillRepeatedly().", output); // #5 } // Tests that Google Mock warns on having too few actions in an // expectation compared to its cardinality. TEST(ExpectCallSyntaxTest, WarnsOnTooFewActions) { MockB b; EXPECT_CALL(b, DoB()) .Times(Between(2, 3)) .WillOnce(Return(1)); CaptureStdout(); b.DoB(); const String output = GetCapturedStdout(); EXPECT_PRED_FORMAT2( IsSubstring, "Too few actions specified in EXPECT_CALL(b, DoB())...\n" "Expected to be called between 2 and 3 times, " "but has only 1 WillOnce().", output); b.DoB(); } #endif // GTEST_HAS_STREAM_REDIRECTION // Tests the semantics of ON_CALL(). // Tests that the built-in default action is taken when no ON_CALL() // is specified. TEST(OnCallTest, TakesBuiltInDefaultActionWhenNoOnCall) { MockB b; EXPECT_CALL(b, DoB()); EXPECT_EQ(0, b.DoB()); } // Tests that the built-in default action is taken when no ON_CALL() // matches the invocation. TEST(OnCallTest, TakesBuiltInDefaultActionWhenNoOnCallMatches) { MockB b; ON_CALL(b, DoB(1)) .WillByDefault(Return(1)); EXPECT_CALL(b, DoB(_)); EXPECT_EQ(0, b.DoB(2)); } // Tests that the last matching ON_CALL() action is taken. TEST(OnCallTest, PicksLastMatchingOnCall) { MockB b; ON_CALL(b, DoB(_)) .WillByDefault(Return(3)); ON_CALL(b, DoB(2)) .WillByDefault(Return(2)); ON_CALL(b, DoB(1)) .WillByDefault(Return(1)); EXPECT_CALL(b, DoB(_)); EXPECT_EQ(2, b.DoB(2)); } // Tests the semantics of EXPECT_CALL(). // Tests that any call is allowed when no EXPECT_CALL() is specified. TEST(ExpectCallTest, AllowsAnyCallWhenNoSpec) { MockB b; EXPECT_CALL(b, DoB()); // There is no expectation on DoB(int). b.DoB(); // DoB(int) can be called any number of times. b.DoB(1); b.DoB(2); } // Tests that the last matching EXPECT_CALL() fires. TEST(ExpectCallTest, PicksLastMatchingExpectCall) { MockB b; EXPECT_CALL(b, DoB(_)) .WillRepeatedly(Return(2)); EXPECT_CALL(b, DoB(1)) .WillRepeatedly(Return(1)); EXPECT_EQ(1, b.DoB(1)); } // Tests lower-bound violation. TEST(ExpectCallTest, CatchesTooFewCalls) { EXPECT_NONFATAL_FAILURE({ // NOLINT MockB b; EXPECT_CALL(b, DoB(5)) .Times(AtLeast(2)); b.DoB(5); }, "Actual function call count doesn't match EXPECT_CALL(b, DoB(5))...\n" " Expected: to be called at least twice\n" " Actual: called once - unsatisfied and active"); } // Tests that the cardinality can be inferred when no Times(...) is // specified. TEST(ExpectCallTest, InfersCardinalityWhenThereIsNoWillRepeatedly) { { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); } EXPECT_NONFATAL_FAILURE({ // NOLINT MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_EQ(1, b.DoB()); }, "to be called twice"); { // NOLINT MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillOnce(Return(2)); EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); EXPECT_NONFATAL_FAILURE(b.DoB(), "to be called twice"); } } TEST(ExpectCallTest, InfersCardinality1WhenThereIsWillRepeatedly) { { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); EXPECT_EQ(1, b.DoB()); } { // NOLINT MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); EXPECT_EQ(2, b.DoB()); } EXPECT_NONFATAL_FAILURE({ // NOLINT MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); }, "to be called at least once"); } // Tests that the n-th action is taken for the n-th matching // invocation. TEST(ExpectCallTest, NthMatchTakesNthAction) { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillOnce(Return(2)) .WillOnce(Return(3)); EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); EXPECT_EQ(3, b.DoB()); } // Tests that the WillRepeatedly() action is taken when the WillOnce(...) // list is exhausted. TEST(ExpectCallTest, TakesRepeatedActionWhenWillListIsExhausted) { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)) .WillRepeatedly(Return(2)); EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); EXPECT_EQ(2, b.DoB()); } #if GTEST_HAS_STREAM_REDIRECTION // Tests that the default action is taken when the WillOnce(...) list is // exhausted and there is no WillRepeatedly(). TEST(ExpectCallTest, TakesDefaultActionWhenWillListIsExhausted) { MockB b; EXPECT_CALL(b, DoB(_)) .Times(1); EXPECT_CALL(b, DoB()) .Times(AnyNumber()) .WillOnce(Return(1)) .WillOnce(Return(2)); CaptureStdout(); EXPECT_EQ(0, b.DoB(1)); // Shouldn't generate a warning as the // expectation has no action clause at all. EXPECT_EQ(1, b.DoB()); EXPECT_EQ(2, b.DoB()); const String output1 = GetCapturedStdout(); EXPECT_STREQ("", output1.c_str()); CaptureStdout(); EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB()); const String output2 = GetCapturedStdout(); EXPECT_THAT(output2.c_str(), HasSubstr("Actions ran out in EXPECT_CALL(b, DoB())...\n" "Called 3 times, but only 2 WillOnce()s are specified" " - returning default value.")); EXPECT_THAT(output2.c_str(), HasSubstr("Actions ran out in EXPECT_CALL(b, DoB())...\n" "Called 4 times, but only 2 WillOnce()s are specified" " - returning default value.")); } TEST(FunctionMockerTest, ReportsExpectCallLocationForExhausedActions) { MockB b; std::string expect_call_location = FormatFileLocation(__FILE__, __LINE__ + 1); EXPECT_CALL(b, DoB()).Times(AnyNumber()).WillOnce(Return(1)); EXPECT_EQ(1, b.DoB()); CaptureStdout(); EXPECT_EQ(0, b.DoB()); const String output = GetCapturedStdout(); // The warning message should contain the call location. EXPECT_PRED_FORMAT2(IsSubstring, expect_call_location, output); } TEST(FunctionMockerTest, ReportsDefaultActionLocationOfUninterestingCalls) { std::string on_call_location; CaptureStdout(); { MockB b; on_call_location = FormatFileLocation(__FILE__, __LINE__ + 1); ON_CALL(b, DoB(_)).WillByDefault(Return(0)); b.DoB(0); } EXPECT_PRED_FORMAT2(IsSubstring, on_call_location, GetCapturedStdout()); } #endif // GTEST_HAS_STREAM_REDIRECTION // Tests that an uninteresting call performs the default action. TEST(UninterestingCallTest, DoesDefaultAction) { // When there is an ON_CALL() statement, the action specified by it // should be taken. MockA a; ON_CALL(a, Binary(_, _)) .WillByDefault(Return(true)); EXPECT_TRUE(a.Binary(1, 2)); // When there is no ON_CALL(), the default value for the return type // should be returned. MockB b; EXPECT_EQ(0, b.DoB()); } // Tests that an unexpected call performs the default action. TEST(UnexpectedCallTest, DoesDefaultAction) { // When there is an ON_CALL() statement, the action specified by it // should be taken. MockA a; ON_CALL(a, Binary(_, _)) .WillByDefault(Return(true)); EXPECT_CALL(a, Binary(0, 0)); a.Binary(0, 0); bool result = false; EXPECT_NONFATAL_FAILURE(result = a.Binary(1, 2), "Unexpected mock function call"); EXPECT_TRUE(result); // When there is no ON_CALL(), the default value for the return type // should be returned. MockB b; EXPECT_CALL(b, DoB(0)) .Times(0); int n = -1; EXPECT_NONFATAL_FAILURE(n = b.DoB(1), "Unexpected mock function call"); EXPECT_EQ(0, n); } // Tests that when an unexpected void function generates the right // failure message. TEST(UnexpectedCallTest, GeneratesFailureForVoidFunction) { // First, tests the message when there is only one EXPECT_CALL(). MockA a1; EXPECT_CALL(a1, DoA(1)); a1.DoA(1); // Ideally we should match the failure message against a regex, but // EXPECT_NONFATAL_FAILURE doesn't support that, so we test for // multiple sub-strings instead. EXPECT_NONFATAL_FAILURE( a1.DoA(9), "Unexpected mock function call - returning directly.\n" " Function call: DoA(9)\n" "Google Mock tried the following 1 expectation, but it didn't match:"); EXPECT_NONFATAL_FAILURE( a1.DoA(9), " Expected arg #0: is equal to 1\n" " Actual: 9\n" " Expected: to be called once\n" " Actual: called once - saturated and active"); // Next, tests the message when there are more than one EXPECT_CALL(). MockA a2; EXPECT_CALL(a2, DoA(1)); EXPECT_CALL(a2, DoA(3)); a2.DoA(1); EXPECT_NONFATAL_FAILURE( a2.DoA(2), "Unexpected mock function call - returning directly.\n" " Function call: DoA(2)\n" "Google Mock tried the following 2 expectations, but none matched:"); EXPECT_NONFATAL_FAILURE( a2.DoA(2), "tried expectation #0: EXPECT_CALL(a2, DoA(1))...\n" " Expected arg #0: is equal to 1\n" " Actual: 2\n" " Expected: to be called once\n" " Actual: called once - saturated and active"); EXPECT_NONFATAL_FAILURE( a2.DoA(2), "tried expectation #1: EXPECT_CALL(a2, DoA(3))...\n" " Expected arg #0: is equal to 3\n" " Actual: 2\n" " Expected: to be called once\n" " Actual: never called - unsatisfied and active"); a2.DoA(3); } // Tests that an unexpected non-void function generates the right // failure message. TEST(UnexpectedCallTest, GeneartesFailureForNonVoidFunction) { MockB b1; EXPECT_CALL(b1, DoB(1)); b1.DoB(1); EXPECT_NONFATAL_FAILURE( b1.DoB(2), "Unexpected mock function call - returning default value.\n" " Function call: DoB(2)\n" " Returns: 0\n" "Google Mock tried the following 1 expectation, but it didn't match:"); EXPECT_NONFATAL_FAILURE( b1.DoB(2), " Expected arg #0: is equal to 1\n" " Actual: 2\n" " Expected: to be called once\n" " Actual: called once - saturated and active"); } // Tests that Google Mock explains that an retired expectation doesn't // match the call. TEST(UnexpectedCallTest, RetiredExpectation) { MockB b; EXPECT_CALL(b, DoB(1)) .RetiresOnSaturation(); b.DoB(1); EXPECT_NONFATAL_FAILURE( b.DoB(1), " Expected: the expectation is active\n" " Actual: it is retired"); } // Tests that Google Mock explains that an expectation that doesn't // match the arguments doesn't match the call. TEST(UnexpectedCallTest, UnmatchedArguments) { MockB b; EXPECT_CALL(b, DoB(1)); EXPECT_NONFATAL_FAILURE( b.DoB(2), " Expected arg #0: is equal to 1\n" " Actual: 2\n"); b.DoB(1); } // Tests that Google Mock explains that an expectation with // unsatisfied pre-requisites doesn't match the call. TEST(UnexpectedCallTest, UnsatisifiedPrerequisites) { Sequence s1, s2; MockB b; EXPECT_CALL(b, DoB(1)) .InSequence(s1); EXPECT_CALL(b, DoB(2)) .Times(AnyNumber()) .InSequence(s1); EXPECT_CALL(b, DoB(3)) .InSequence(s2); EXPECT_CALL(b, DoB(4)) .InSequence(s1, s2); ::testing::TestPartResultArray failures; { ::testing::ScopedFakeTestPartResultReporter reporter(&failures); b.DoB(4); // Now 'failures' contains the Google Test failures generated by // the above statement. } // There should be one non-fatal failure. ASSERT_EQ(1, failures.size()); const ::testing::TestPartResult& r = failures.GetTestPartResult(0); EXPECT_EQ(::testing::TestPartResult::kNonFatalFailure, r.type()); // Verifies that the failure message contains the two unsatisfied // pre-requisites but not the satisfied one. #if GTEST_USES_PCRE EXPECT_THAT(r.message(), ContainsRegex( // PCRE has trouble using (.|\n) to match any character, but // supports the (?s) prefix for using . to match any character. "(?s)the following immediate pre-requisites are not satisfied:\n" ".*: pre-requisite #0\n" ".*: pre-requisite #1")); #elif GTEST_USES_POSIX_RE EXPECT_THAT(r.message(), ContainsRegex( // POSIX RE doesn't understand the (?s) prefix, but has no trouble // with (.|\n). "the following immediate pre-requisites are not satisfied:\n" "(.|\n)*: pre-requisite #0\n" "(.|\n)*: pre-requisite #1")); #else // We can only use Google Test's own simple regex. EXPECT_THAT(r.message(), ContainsRegex( "the following immediate pre-requisites are not satisfied:")); EXPECT_THAT(r.message(), ContainsRegex(": pre-requisite #0")); EXPECT_THAT(r.message(), ContainsRegex(": pre-requisite #1")); #endif // GTEST_USES_PCRE b.DoB(1); b.DoB(3); b.DoB(4); } TEST(UndefinedReturnValueTest, ReturnValueIsMandatory) { MockA a; // TODO(wan@google.com): We should really verify the output message, // but we cannot yet due to that EXPECT_DEATH only captures stderr // while Google Mock logs to stdout. EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(1), ""); } // Tests that an excessive call (one whose arguments match the // matchers but is called too many times) performs the default action. TEST(ExcessiveCallTest, DoesDefaultAction) { // When there is an ON_CALL() statement, the action specified by it // should be taken. MockA a; ON_CALL(a, Binary(_, _)) .WillByDefault(Return(true)); EXPECT_CALL(a, Binary(0, 0)); a.Binary(0, 0); bool result = false; EXPECT_NONFATAL_FAILURE(result = a.Binary(0, 0), "Mock function called more times than expected"); EXPECT_TRUE(result); // When there is no ON_CALL(), the default value for the return type // should be returned. MockB b; EXPECT_CALL(b, DoB(0)) .Times(0); int n = -1; EXPECT_NONFATAL_FAILURE(n = b.DoB(0), "Mock function called more times than expected"); EXPECT_EQ(0, n); } // Tests that when a void function is called too many times, // the failure message contains the argument values. TEST(ExcessiveCallTest, GeneratesFailureForVoidFunction) { MockA a; EXPECT_CALL(a, DoA(_)) .Times(0); EXPECT_NONFATAL_FAILURE( a.DoA(9), "Mock function called more times than expected - returning directly.\n" " Function call: DoA(9)\n" " Expected: to be never called\n" " Actual: called once - over-saturated and active"); } // Tests that when a non-void function is called too many times, the // failure message contains the argument values and the return value. TEST(ExcessiveCallTest, GeneratesFailureForNonVoidFunction) { MockB b; EXPECT_CALL(b, DoB(_)); b.DoB(1); EXPECT_NONFATAL_FAILURE( b.DoB(2), "Mock function called more times than expected - " "returning default value.\n" " Function call: DoB(2)\n" " Returns: 0\n" " Expected: to be called once\n" " Actual: called twice - over-saturated and active"); } // Tests using sequences. TEST(InSequenceTest, AllExpectationInScopeAreInSequence) { MockA a; { InSequence dummy; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(2)); } EXPECT_NONFATAL_FAILURE({ // NOLINT a.DoA(2); }, "Unexpected mock function call"); a.DoA(1); a.DoA(2); } TEST(InSequenceTest, NestedInSequence) { MockA a; { InSequence dummy; EXPECT_CALL(a, DoA(1)); { InSequence dummy2; EXPECT_CALL(a, DoA(2)); EXPECT_CALL(a, DoA(3)); } } EXPECT_NONFATAL_FAILURE({ // NOLINT a.DoA(1); a.DoA(3); }, "Unexpected mock function call"); a.DoA(2); a.DoA(3); } TEST(InSequenceTest, ExpectationsOutOfScopeAreNotAffected) { MockA a; { InSequence dummy; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(2)); } EXPECT_CALL(a, DoA(3)); EXPECT_NONFATAL_FAILURE({ // NOLINT a.DoA(2); }, "Unexpected mock function call"); a.DoA(3); a.DoA(1); a.DoA(2); } // Tests that any order is allowed when no sequence is used. TEST(SequenceTest, AnyOrderIsOkByDefault) { { MockA a; MockB b; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(b, DoB()) .Times(AnyNumber()); a.DoA(1); b.DoB(); } { // NOLINT MockA a; MockB b; EXPECT_CALL(a, DoA(1)); EXPECT_CALL(b, DoB()) .Times(AnyNumber()); b.DoB(); a.DoA(1); } } // Tests that the calls must be in strict order when a complete order // is specified. TEST(SequenceTest, CallsMustBeInStrictOrderWhenSaidSo) { MockA a; Sequence s; EXPECT_CALL(a, ReturnResult(1)) .InSequence(s) .WillOnce(Return(Result())); EXPECT_CALL(a, ReturnResult(2)) .InSequence(s) .WillOnce(Return(Result())); EXPECT_CALL(a, ReturnResult(3)) .InSequence(s) .WillOnce(Return(Result())); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(1); a.ReturnResult(3); a.ReturnResult(2); }, ""); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(2); a.ReturnResult(1); a.ReturnResult(3); }, ""); a.ReturnResult(1); a.ReturnResult(2); a.ReturnResult(3); } // Tests specifying a DAG using multiple sequences. TEST(SequenceTest, CallsMustConformToSpecifiedDag) { MockA a; MockB b; Sequence x, y; EXPECT_CALL(a, ReturnResult(1)) .InSequence(x) .WillOnce(Return(Result())); EXPECT_CALL(b, DoB()) .Times(2) .InSequence(y); EXPECT_CALL(a, ReturnResult(2)) .InSequence(x, y) .WillRepeatedly(Return(Result())); EXPECT_CALL(a, ReturnResult(3)) .InSequence(x) .WillOnce(Return(Result())); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(1); b.DoB(); a.ReturnResult(2); }, ""); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(2); }, ""); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(3); }, ""); EXPECT_DEATH_IF_SUPPORTED({ a.ReturnResult(1); b.DoB(); b.DoB(); a.ReturnResult(3); a.ReturnResult(2); }, ""); b.DoB(); a.ReturnResult(1); b.DoB(); a.ReturnResult(3); } TEST(SequenceTest, Retirement) { MockA a; Sequence s; EXPECT_CALL(a, DoA(1)) .InSequence(s); EXPECT_CALL(a, DoA(_)) .InSequence(s) .RetiresOnSaturation(); EXPECT_CALL(a, DoA(1)) .InSequence(s); a.DoA(1); a.DoA(2); a.DoA(1); } // Tests Expectation. TEST(ExpectationTest, ConstrutorsWork) { MockA a; Expectation e1; // Default ctor. // Ctor from various forms of EXPECT_CALL. Expectation e2 = EXPECT_CALL(a, DoA(2)); Expectation e3 = EXPECT_CALL(a, DoA(3)).With(_); { Sequence s; Expectation e4 = EXPECT_CALL(a, DoA(4)).Times(1); Expectation e5 = EXPECT_CALL(a, DoA(5)).InSequence(s); } Expectation e6 = EXPECT_CALL(a, DoA(6)).After(e2); Expectation e7 = EXPECT_CALL(a, DoA(7)).WillOnce(Return()); Expectation e8 = EXPECT_CALL(a, DoA(8)).WillRepeatedly(Return()); Expectation e9 = EXPECT_CALL(a, DoA(9)).RetiresOnSaturation(); Expectation e10 = e2; // Copy ctor. EXPECT_THAT(e1, Ne(e2)); EXPECT_THAT(e2, Eq(e10)); a.DoA(2); a.DoA(3); a.DoA(4); a.DoA(5); a.DoA(6); a.DoA(7); a.DoA(8); a.DoA(9); } TEST(ExpectationTest, AssignmentWorks) { MockA a; Expectation e1; Expectation e2 = EXPECT_CALL(a, DoA(1)); EXPECT_THAT(e1, Ne(e2)); e1 = e2; EXPECT_THAT(e1, Eq(e2)); a.DoA(1); } // Tests ExpectationSet. TEST(ExpectationSetTest, MemberTypesAreCorrect) { ::testing::StaticAssertTypeEq(); } TEST(ExpectationSetTest, ConstructorsWork) { MockA a; Expectation e1; const Expectation e2; ExpectationSet es1; // Default ctor. ExpectationSet es2 = EXPECT_CALL(a, DoA(1)); // Ctor from EXPECT_CALL. ExpectationSet es3 = e1; // Ctor from Expectation. ExpectationSet es4(e1); // Ctor from Expectation; alternative syntax. ExpectationSet es5 = e2; // Ctor from const Expectation. ExpectationSet es6(e2); // Ctor from const Expectation; alternative syntax. ExpectationSet es7 = es2; // Copy ctor. EXPECT_EQ(0, es1.size()); EXPECT_EQ(1, es2.size()); EXPECT_EQ(1, es3.size()); EXPECT_EQ(1, es4.size()); EXPECT_EQ(1, es5.size()); EXPECT_EQ(1, es6.size()); EXPECT_EQ(1, es7.size()); EXPECT_THAT(es3, Ne(es2)); EXPECT_THAT(es4, Eq(es3)); EXPECT_THAT(es5, Eq(es4)); EXPECT_THAT(es6, Eq(es5)); EXPECT_THAT(es7, Eq(es2)); a.DoA(1); } TEST(ExpectationSetTest, AssignmentWorks) { ExpectationSet es1; ExpectationSet es2 = Expectation(); es1 = es2; EXPECT_EQ(1, es1.size()); EXPECT_THAT(*(es1.begin()), Eq(Expectation())); EXPECT_THAT(es1, Eq(es2)); } TEST(ExpectationSetTest, InsertionWorks) { ExpectationSet es1; Expectation e1; es1 += e1; EXPECT_EQ(1, es1.size()); EXPECT_THAT(*(es1.begin()), Eq(e1)); MockA a; Expectation e2 = EXPECT_CALL(a, DoA(1)); es1 += e2; EXPECT_EQ(2, es1.size()); ExpectationSet::const_iterator it1 = es1.begin(); ExpectationSet::const_iterator it2 = it1; ++it2; EXPECT_TRUE(*it1 == e1 || *it2 == e1); // e1 must be in the set. EXPECT_TRUE(*it1 == e2 || *it2 == e2); // e2 must be in the set too. a.DoA(1); } TEST(ExpectationSetTest, SizeWorks) { ExpectationSet es; EXPECT_EQ(0, es.size()); es += Expectation(); EXPECT_EQ(1, es.size()); MockA a; es += EXPECT_CALL(a, DoA(1)); EXPECT_EQ(2, es.size()); a.DoA(1); } TEST(ExpectationSetTest, IsEnumerable) { ExpectationSet es; EXPECT_THAT(es.begin(), Eq(es.end())); es += Expectation(); ExpectationSet::const_iterator it = es.begin(); EXPECT_THAT(it, Ne(es.end())); EXPECT_THAT(*it, Eq(Expectation())); ++it; EXPECT_THAT(it, Eq(es.end())); } // Tests the .After() clause. TEST(AfterTest, SucceedsWhenPartialOrderIsSatisfied) { MockA a; ExpectationSet es; es += EXPECT_CALL(a, DoA(1)); es += EXPECT_CALL(a, DoA(2)); EXPECT_CALL(a, DoA(3)) .After(es); a.DoA(1); a.DoA(2); a.DoA(3); } TEST(AfterTest, SucceedsWhenTotalOrderIsSatisfied) { MockA a; MockB b; // The following also verifies that const Expectation objects work // too. Do not remove the const modifiers. const Expectation e1 = EXPECT_CALL(a, DoA(1)); const Expectation e2 = EXPECT_CALL(b, DoB()) .Times(2) .After(e1); EXPECT_CALL(a, DoA(2)).After(e2); a.DoA(1); b.DoB(); b.DoB(); a.DoA(2); } // Calls must be in strict order when specified so. TEST(AfterDeathTest, CallsMustBeInStrictOrderWhenSpecifiedSo) { MockA a; MockB b; Expectation e1 = EXPECT_CALL(a, DoA(1)); Expectation e2 = EXPECT_CALL(b, DoB()) .Times(2) .After(e1); EXPECT_CALL(a, ReturnResult(2)) .After(e2) .WillOnce(Return(Result())); a.DoA(1); // If a call to ReturnResult() violates the specified order, no // matching expectation will be found, and thus the default action // will be done. Since the return type of ReturnResult() is not a // built-in type, gmock won't know what to return and will thus // abort the program. Therefore a death test can tell us whether // gmock catches the order violation correctly. // // gtest and gmock print messages to stdout, which isn't captured by // death tests. Therefore we have to match with an empty regular // expression in all the EXPECT_DEATH()s. EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(2), ""); b.DoB(); EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(2), ""); b.DoB(); a.ReturnResult(2); } // Calls must satisfy the partial order when specified so. TEST(AfterDeathTest, CallsMustSatisfyPartialOrderWhenSpecifiedSo) { MockA a; Expectation e = EXPECT_CALL(a, DoA(1)); const ExpectationSet es = EXPECT_CALL(a, DoA(2)); EXPECT_CALL(a, ReturnResult(3)) .After(e, es) .WillOnce(Return(Result())); EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(3), ""); a.DoA(2); EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(3), ""); a.DoA(1); a.ReturnResult(3); } // .After() can be combined with .InSequence(). TEST(AfterDeathTest, CanBeUsedWithInSequence) { MockA a; Sequence s; Expectation e = EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(2)).InSequence(s); EXPECT_CALL(a, ReturnResult(3)) .InSequence(s).After(e) .WillOnce(Return(Result())); a.DoA(1); EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(3), ""); a.DoA(2); a.ReturnResult(3); } // .After() can be called multiple times. TEST(AfterTest, CanBeCalledManyTimes) { MockA a; Expectation e1 = EXPECT_CALL(a, DoA(1)); Expectation e2 = EXPECT_CALL(a, DoA(2)); Expectation e3 = EXPECT_CALL(a, DoA(3)); EXPECT_CALL(a, DoA(4)) .After(e1) .After(e2) .After(e3); a.DoA(3); a.DoA(1); a.DoA(2); a.DoA(4); } // .After() accepts up to 5 arguments. TEST(AfterTest, AcceptsUpToFiveArguments) { MockA a; Expectation e1 = EXPECT_CALL(a, DoA(1)); Expectation e2 = EXPECT_CALL(a, DoA(2)); Expectation e3 = EXPECT_CALL(a, DoA(3)); ExpectationSet es1 = EXPECT_CALL(a, DoA(4)); ExpectationSet es2 = EXPECT_CALL(a, DoA(5)); EXPECT_CALL(a, DoA(6)) .After(e1, e2, e3, es1, es2); a.DoA(5); a.DoA(2); a.DoA(4); a.DoA(1); a.DoA(3); a.DoA(6); } // .After() allows input to contain duplicated Expectations. TEST(AfterTest, AcceptsDuplicatedInput) { MockA a; Expectation e1 = EXPECT_CALL(a, DoA(1)); Expectation e2 = EXPECT_CALL(a, DoA(2)); ExpectationSet es; es += e1; es += e2; EXPECT_CALL(a, ReturnResult(3)) .After(e1, e2, es, e1) .WillOnce(Return(Result())); a.DoA(1); EXPECT_DEATH_IF_SUPPORTED(a.ReturnResult(3), ""); a.DoA(2); a.ReturnResult(3); } // An Expectation added to an ExpectationSet after it has been used in // an .After() has no effect. TEST(AfterTest, ChangesToExpectationSetHaveNoEffectAfterwards) { MockA a; ExpectationSet es1 = EXPECT_CALL(a, DoA(1)); Expectation e2 = EXPECT_CALL(a, DoA(2)); EXPECT_CALL(a, DoA(3)) .After(es1); es1 += e2; a.DoA(1); a.DoA(3); a.DoA(2); } // Tests that Google Mock correctly handles calls to mock functions // after a mock object owning one of their pre-requisites has died. // Tests that calls that satisfy the original spec are successful. TEST(DeletingMockEarlyTest, Success1) { MockB* const b1 = new MockB; MockA* const a = new MockA; MockB* const b2 = new MockB; { InSequence dummy; EXPECT_CALL(*b1, DoB(_)) .WillOnce(Return(1)); EXPECT_CALL(*a, Binary(_, _)) .Times(AnyNumber()) .WillRepeatedly(Return(true)); EXPECT_CALL(*b2, DoB(_)) .Times(AnyNumber()) .WillRepeatedly(Return(2)); } EXPECT_EQ(1, b1->DoB(1)); delete b1; // a's pre-requisite has died. EXPECT_TRUE(a->Binary(0, 1)); delete b2; // a's successor has died. EXPECT_TRUE(a->Binary(1, 2)); delete a; } // Tests that calls that satisfy the original spec are successful. TEST(DeletingMockEarlyTest, Success2) { MockB* const b1 = new MockB; MockA* const a = new MockA; MockB* const b2 = new MockB; { InSequence dummy; EXPECT_CALL(*b1, DoB(_)) .WillOnce(Return(1)); EXPECT_CALL(*a, Binary(_, _)) .Times(AnyNumber()); EXPECT_CALL(*b2, DoB(_)) .Times(AnyNumber()) .WillRepeatedly(Return(2)); } delete a; // a is trivially satisfied. EXPECT_EQ(1, b1->DoB(1)); EXPECT_EQ(2, b2->DoB(2)); delete b1; delete b2; } // Tests that it's OK to delete a mock object itself in its action. // Suppresses warning on unreferenced formal parameter in MSVC with // -W4. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif ACTION_P(Delete, ptr) { delete ptr; } #ifdef _MSC_VER # pragma warning(pop) #endif TEST(DeletingMockEarlyTest, CanDeleteSelfInActionReturningVoid) { MockA* const a = new MockA; EXPECT_CALL(*a, DoA(_)).WillOnce(Delete(a)); a->DoA(42); // This will cause a to be deleted. } TEST(DeletingMockEarlyTest, CanDeleteSelfInActionReturningValue) { MockA* const a = new MockA; EXPECT_CALL(*a, ReturnResult(_)) .WillOnce(DoAll(Delete(a), Return(Result()))); a->ReturnResult(42); // This will cause a to be deleted. } // Tests that calls that violate the original spec yield failures. TEST(DeletingMockEarlyTest, Failure1) { MockB* const b1 = new MockB; MockA* const a = new MockA; MockB* const b2 = new MockB; { InSequence dummy; EXPECT_CALL(*b1, DoB(_)) .WillOnce(Return(1)); EXPECT_CALL(*a, Binary(_, _)) .Times(AnyNumber()); EXPECT_CALL(*b2, DoB(_)) .Times(AnyNumber()) .WillRepeatedly(Return(2)); } delete a; // a is trivially satisfied. EXPECT_NONFATAL_FAILURE({ b2->DoB(2); }, "Unexpected mock function call"); EXPECT_EQ(1, b1->DoB(1)); delete b1; delete b2; } // Tests that calls that violate the original spec yield failures. TEST(DeletingMockEarlyTest, Failure2) { MockB* const b1 = new MockB; MockA* const a = new MockA; MockB* const b2 = new MockB; { InSequence dummy; EXPECT_CALL(*b1, DoB(_)); EXPECT_CALL(*a, Binary(_, _)) .Times(AnyNumber()); EXPECT_CALL(*b2, DoB(_)) .Times(AnyNumber()); } EXPECT_NONFATAL_FAILURE(delete b1, "Actual: never called"); EXPECT_NONFATAL_FAILURE(a->Binary(0, 1), "Unexpected mock function call"); EXPECT_NONFATAL_FAILURE(b2->DoB(1), "Unexpected mock function call"); delete a; delete b2; } class EvenNumberCardinality : public CardinalityInterface { public: // Returns true iff call_count calls will satisfy this cardinality. virtual bool IsSatisfiedByCallCount(int call_count) const { return call_count % 2 == 0; } // Returns true iff call_count calls will saturate this cardinality. virtual bool IsSaturatedByCallCount(int /* call_count */) const { return false; } // Describes self to an ostream. virtual void DescribeTo(::std::ostream* os) const { *os << "called even number of times"; } }; Cardinality EvenNumber() { return Cardinality(new EvenNumberCardinality); } TEST(ExpectationBaseTest, AllPrerequisitesAreSatisfiedWorksForNonMonotonicCardinality) { MockA* a = new MockA; Sequence s; EXPECT_CALL(*a, DoA(1)) .Times(EvenNumber()) .InSequence(s); EXPECT_CALL(*a, DoA(2)) .Times(AnyNumber()) .InSequence(s); EXPECT_CALL(*a, DoA(3)) .Times(AnyNumber()); a->DoA(3); a->DoA(1); EXPECT_NONFATAL_FAILURE(a->DoA(2), "Unexpected mock function call"); EXPECT_NONFATAL_FAILURE(delete a, "to be called even number of times"); } // The following tests verify the message generated when a mock // function is called. struct Printable { }; inline void operator<<(::std::ostream& os, const Printable&) { os << "Printable"; } struct Unprintable { Unprintable() : value(0) {} int value; }; class MockC { public: MockC() {} MOCK_METHOD6(VoidMethod, void(bool cond, int n, string s, void* p, const Printable& x, Unprintable y)); MOCK_METHOD0(NonVoidMethod, int()); // NOLINT private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockC); }; class VerboseFlagPreservingFixture : public testing::Test { protected: // The code needs to work when both ::string and ::std::string are defined // and the flag is implemented as a testing::internal::String. In this // case, without the call to c_str(), the compiler will complain that it // cannot figure out what overload of string constructor to use. // TODO(vladl@google.com): Use internal::string instead of String for // string flags in Google Test. VerboseFlagPreservingFixture() : saved_verbose_flag_(GMOCK_FLAG(verbose).c_str()) {} ~VerboseFlagPreservingFixture() { GMOCK_FLAG(verbose) = saved_verbose_flag_; } private: const string saved_verbose_flag_; GTEST_DISALLOW_COPY_AND_ASSIGN_(VerboseFlagPreservingFixture); }; #if GTEST_HAS_STREAM_REDIRECTION // Tests that an uninteresting mock function call generates a warning // containing the stack trace. TEST(FunctionCallMessageTest, UninterestingCallGeneratesFyiWithStackTrace) { MockC c; CaptureStdout(); c.VoidMethod(false, 5, "Hi", NULL, Printable(), Unprintable()); const String output = GetCapturedStdout(); EXPECT_PRED_FORMAT2(IsSubstring, "GMOCK WARNING", output); EXPECT_PRED_FORMAT2(IsSubstring, "Stack trace:", output); # ifndef NDEBUG // We check the stack trace content in dbg-mode only, as opt-mode // may inline the call we are interested in seeing. // Verifies that a void mock function's name appears in the stack // trace. EXPECT_PRED_FORMAT2(IsSubstring, "VoidMethod(", output); // Verifies that a non-void mock function's name appears in the // stack trace. CaptureStdout(); c.NonVoidMethod(); const String output2 = GetCapturedStdout(); EXPECT_PRED_FORMAT2(IsSubstring, "NonVoidMethod(", output2); # endif // NDEBUG } // Tests that an uninteresting mock function call causes the function // arguments and return value to be printed. TEST(FunctionCallMessageTest, UninterestingCallPrintsArgumentsAndReturnValue) { // A non-void mock function. MockB b; CaptureStdout(); b.DoB(); const String output1 = GetCapturedStdout(); EXPECT_PRED_FORMAT2( IsSubstring, "Uninteresting mock function call - returning default value.\n" " Function call: DoB()\n" " Returns: 0\n", output1.c_str()); // Makes sure the return value is printed. // A void mock function. MockC c; CaptureStdout(); c.VoidMethod(false, 5, "Hi", NULL, Printable(), Unprintable()); const String output2 = GetCapturedStdout(); EXPECT_THAT(output2.c_str(), ContainsRegex( "Uninteresting mock function call - returning directly\\.\n" " Function call: VoidMethod" "\\(false, 5, \"Hi\", NULL, @.+ " "Printable, 4-byte object <00-00 00-00>\\)")); // A void function has no return value to print. } // Tests how the --gmock_verbose flag affects Google Mock's output. class GMockVerboseFlagTest : public VerboseFlagPreservingFixture { public: // Verifies that the given Google Mock output is correct. (When // should_print is true, the output should match the given regex and // contain the given function name in the stack trace. When it's // false, the output should be empty.) void VerifyOutput(const String& output, bool should_print, const string& expected_substring, const string& function_name) { if (should_print) { EXPECT_THAT(output.c_str(), HasSubstr(expected_substring)); # ifndef NDEBUG // We check the stack trace content in dbg-mode only, as opt-mode // may inline the call we are interested in seeing. EXPECT_THAT(output.c_str(), HasSubstr(function_name)); # else // Suppresses 'unused function parameter' warnings. static_cast(function_name); # endif // NDEBUG } else { EXPECT_STREQ("", output.c_str()); } } // Tests how the flag affects expected calls. void TestExpectedCall(bool should_print) { MockA a; EXPECT_CALL(a, DoA(5)); EXPECT_CALL(a, Binary(_, 1)) .WillOnce(Return(true)); // A void-returning function. CaptureStdout(); a.DoA(5); VerifyOutput( GetCapturedStdout(), should_print, "Mock function call matches EXPECT_CALL(a, DoA(5))...\n" " Function call: DoA(5)\n" "Stack trace:\n", "DoA"); // A non-void-returning function. CaptureStdout(); a.Binary(2, 1); VerifyOutput( GetCapturedStdout(), should_print, "Mock function call matches EXPECT_CALL(a, Binary(_, 1))...\n" " Function call: Binary(2, 1)\n" " Returns: true\n" "Stack trace:\n", "Binary"); } // Tests how the flag affects uninteresting calls. void TestUninterestingCall(bool should_print) { MockA a; // A void-returning function. CaptureStdout(); a.DoA(5); VerifyOutput( GetCapturedStdout(), should_print, "\nGMOCK WARNING:\n" "Uninteresting mock function call - returning directly.\n" " Function call: DoA(5)\n" "Stack trace:\n", "DoA"); // A non-void-returning function. CaptureStdout(); a.Binary(2, 1); VerifyOutput( GetCapturedStdout(), should_print, "\nGMOCK WARNING:\n" "Uninteresting mock function call - returning default value.\n" " Function call: Binary(2, 1)\n" " Returns: false\n" "Stack trace:\n", "Binary"); } }; // Tests that --gmock_verbose=info causes both expected and // uninteresting calls to be reported. TEST_F(GMockVerboseFlagTest, Info) { GMOCK_FLAG(verbose) = kInfoVerbosity; TestExpectedCall(true); TestUninterestingCall(true); } // Tests that --gmock_verbose=warning causes uninteresting calls to be // reported. TEST_F(GMockVerboseFlagTest, Warning) { GMOCK_FLAG(verbose) = kWarningVerbosity; TestExpectedCall(false); TestUninterestingCall(true); } // Tests that --gmock_verbose=warning causes neither expected nor // uninteresting calls to be reported. TEST_F(GMockVerboseFlagTest, Error) { GMOCK_FLAG(verbose) = kErrorVerbosity; TestExpectedCall(false); TestUninterestingCall(false); } // Tests that --gmock_verbose=SOME_INVALID_VALUE has the same effect // as --gmock_verbose=warning. TEST_F(GMockVerboseFlagTest, InvalidFlagIsTreatedAsWarning) { GMOCK_FLAG(verbose) = "invalid"; // Treated as "warning". TestExpectedCall(false); TestUninterestingCall(true); } #endif // GTEST_HAS_STREAM_REDIRECTION // A helper class that generates a failure when printed. We use it to // ensure that Google Mock doesn't print a value (even to an internal // buffer) when it is not supposed to do so. class PrintMeNot {}; void PrintTo(PrintMeNot /* dummy */, ::std::ostream* /* os */) { ADD_FAILURE() << "Google Mock is printing a value that shouldn't be " << "printed even to an internal buffer."; } class LogTestHelper { public: LogTestHelper() {} MOCK_METHOD1(Foo, PrintMeNot(PrintMeNot)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(LogTestHelper); }; class GMockLogTest : public VerboseFlagPreservingFixture { protected: LogTestHelper helper_; }; TEST_F(GMockLogTest, DoesNotPrintGoodCallInternallyIfVerbosityIsWarning) { GMOCK_FLAG(verbose) = kWarningVerbosity; EXPECT_CALL(helper_, Foo(_)) .WillOnce(Return(PrintMeNot())); helper_.Foo(PrintMeNot()); // This is an expected call. } TEST_F(GMockLogTest, DoesNotPrintGoodCallInternallyIfVerbosityIsError) { GMOCK_FLAG(verbose) = kErrorVerbosity; EXPECT_CALL(helper_, Foo(_)) .WillOnce(Return(PrintMeNot())); helper_.Foo(PrintMeNot()); // This is an expected call. } TEST_F(GMockLogTest, DoesNotPrintWarningInternallyIfVerbosityIsError) { GMOCK_FLAG(verbose) = kErrorVerbosity; ON_CALL(helper_, Foo(_)) .WillByDefault(Return(PrintMeNot())); helper_.Foo(PrintMeNot()); // This should generate a warning. } // Tests Mock::AllowLeak(). TEST(AllowLeakTest, AllowsLeakingUnusedMockObject) { MockA* a = new MockA; Mock::AllowLeak(a); } TEST(AllowLeakTest, CanBeCalledBeforeOnCall) { MockA* a = new MockA; Mock::AllowLeak(a); ON_CALL(*a, DoA(_)).WillByDefault(Return()); a->DoA(0); } TEST(AllowLeakTest, CanBeCalledAfterOnCall) { MockA* a = new MockA; ON_CALL(*a, DoA(_)).WillByDefault(Return()); Mock::AllowLeak(a); } TEST(AllowLeakTest, CanBeCalledBeforeExpectCall) { MockA* a = new MockA; Mock::AllowLeak(a); EXPECT_CALL(*a, DoA(_)); a->DoA(0); } TEST(AllowLeakTest, CanBeCalledAfterExpectCall) { MockA* a = new MockA; EXPECT_CALL(*a, DoA(_)).Times(AnyNumber()); Mock::AllowLeak(a); } TEST(AllowLeakTest, WorksWhenBothOnCallAndExpectCallArePresent) { MockA* a = new MockA; ON_CALL(*a, DoA(_)).WillByDefault(Return()); EXPECT_CALL(*a, DoA(_)).Times(AnyNumber()); Mock::AllowLeak(a); } // Tests that we can verify and clear a mock object's expectations // when none of its methods has expectations. TEST(VerifyAndClearExpectationsTest, NoMethodHasExpectations) { MockB b; ASSERT_TRUE(Mock::VerifyAndClearExpectations(&b)); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can verify and clear a mock object's expectations // when some, but not all, of its methods have expectations *and* the // verification succeeds. TEST(VerifyAndClearExpectationsTest, SomeMethodsHaveExpectationsAndSucceed) { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)); b.DoB(); ASSERT_TRUE(Mock::VerifyAndClearExpectations(&b)); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can verify and clear a mock object's expectations // when some, but not all, of its methods have expectations *and* the // verification fails. TEST(VerifyAndClearExpectationsTest, SomeMethodsHaveExpectationsAndFail) { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)); bool result = true; EXPECT_NONFATAL_FAILURE(result = Mock::VerifyAndClearExpectations(&b), "Actual: never called"); ASSERT_FALSE(result); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can verify and clear a mock object's expectations // when all of its methods have expectations. TEST(VerifyAndClearExpectationsTest, AllMethodsHaveExpectations) { MockB b; EXPECT_CALL(b, DoB()) .WillOnce(Return(1)); EXPECT_CALL(b, DoB(_)) .WillOnce(Return(2)); b.DoB(); b.DoB(1); ASSERT_TRUE(Mock::VerifyAndClearExpectations(&b)); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can verify and clear a mock object's expectations // when a method has more than one expectation. TEST(VerifyAndClearExpectationsTest, AMethodHasManyExpectations) { MockB b; EXPECT_CALL(b, DoB(0)) .WillOnce(Return(1)); EXPECT_CALL(b, DoB(_)) .WillOnce(Return(2)); b.DoB(1); bool result = true; EXPECT_NONFATAL_FAILURE(result = Mock::VerifyAndClearExpectations(&b), "Actual: never called"); ASSERT_FALSE(result); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can call VerifyAndClearExpectations() on the same // mock object multiple times. TEST(VerifyAndClearExpectationsTest, CanCallManyTimes) { MockB b; EXPECT_CALL(b, DoB()); b.DoB(); Mock::VerifyAndClearExpectations(&b); EXPECT_CALL(b, DoB(_)) .WillOnce(Return(1)); b.DoB(1); Mock::VerifyAndClearExpectations(&b); Mock::VerifyAndClearExpectations(&b); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can clear a mock object's default actions when none // of its methods has default actions. TEST(VerifyAndClearTest, NoMethodHasDefaultActions) { MockB b; // If this crashes or generates a failure, the test will catch it. Mock::VerifyAndClear(&b); EXPECT_EQ(0, b.DoB()); } // Tests that we can clear a mock object's default actions when some, // but not all of its methods have default actions. TEST(VerifyAndClearTest, SomeMethodsHaveDefaultActions) { MockB b; ON_CALL(b, DoB()) .WillByDefault(Return(1)); Mock::VerifyAndClear(&b); // Verifies that the default action of int DoB() was removed. EXPECT_EQ(0, b.DoB()); } // Tests that we can clear a mock object's default actions when all of // its methods have default actions. TEST(VerifyAndClearTest, AllMethodsHaveDefaultActions) { MockB b; ON_CALL(b, DoB()) .WillByDefault(Return(1)); ON_CALL(b, DoB(_)) .WillByDefault(Return(2)); Mock::VerifyAndClear(&b); // Verifies that the default action of int DoB() was removed. EXPECT_EQ(0, b.DoB()); // Verifies that the default action of int DoB(int) was removed. EXPECT_EQ(0, b.DoB(0)); } // Tests that we can clear a mock object's default actions when a // method has more than one ON_CALL() set on it. TEST(VerifyAndClearTest, AMethodHasManyDefaultActions) { MockB b; ON_CALL(b, DoB(0)) .WillByDefault(Return(1)); ON_CALL(b, DoB(_)) .WillByDefault(Return(2)); Mock::VerifyAndClear(&b); // Verifies that the default actions (there are two) of int DoB(int) // were removed. EXPECT_EQ(0, b.DoB(0)); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can call VerifyAndClear() on a mock object multiple // times. TEST(VerifyAndClearTest, CanCallManyTimes) { MockB b; ON_CALL(b, DoB()) .WillByDefault(Return(1)); Mock::VerifyAndClear(&b); Mock::VerifyAndClear(&b); ON_CALL(b, DoB(_)) .WillByDefault(Return(1)); Mock::VerifyAndClear(&b); EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that VerifyAndClear() works when the verification succeeds. TEST(VerifyAndClearTest, Success) { MockB b; ON_CALL(b, DoB()) .WillByDefault(Return(1)); EXPECT_CALL(b, DoB(1)) .WillOnce(Return(2)); b.DoB(); b.DoB(1); ASSERT_TRUE(Mock::VerifyAndClear(&b)); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that VerifyAndClear() works when the verification fails. TEST(VerifyAndClearTest, Failure) { MockB b; ON_CALL(b, DoB(_)) .WillByDefault(Return(1)); EXPECT_CALL(b, DoB()) .WillOnce(Return(2)); b.DoB(1); bool result = true; EXPECT_NONFATAL_FAILURE(result = Mock::VerifyAndClear(&b), "Actual: never called"); ASSERT_FALSE(result); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that VerifyAndClear() works when the default actions and // expectations are set on a const mock object. TEST(VerifyAndClearTest, Const) { MockB b; ON_CALL(Const(b), DoB()) .WillByDefault(Return(1)); EXPECT_CALL(Const(b), DoB()) .WillOnce(DoDefault()) .WillOnce(Return(2)); b.DoB(); b.DoB(); ASSERT_TRUE(Mock::VerifyAndClear(&b)); // There should be no expectations on the methods now, so we can // freely call them. EXPECT_EQ(0, b.DoB()); EXPECT_EQ(0, b.DoB(1)); } // Tests that we can set default actions and expectations on a mock // object after VerifyAndClear() has been called on it. TEST(VerifyAndClearTest, CanSetDefaultActionsAndExpectationsAfterwards) { MockB b; ON_CALL(b, DoB()) .WillByDefault(Return(1)); EXPECT_CALL(b, DoB(_)) .WillOnce(Return(2)); b.DoB(1); Mock::VerifyAndClear(&b); EXPECT_CALL(b, DoB()) .WillOnce(Return(3)); ON_CALL(b, DoB(_)) .WillByDefault(Return(4)); EXPECT_EQ(3, b.DoB()); EXPECT_EQ(4, b.DoB(1)); } // Tests that calling VerifyAndClear() on one mock object does not // affect other mock objects (either of the same type or not). TEST(VerifyAndClearTest, DoesNotAffectOtherMockObjects) { MockA a; MockB b1; MockB b2; ON_CALL(a, Binary(_, _)) .WillByDefault(Return(true)); EXPECT_CALL(a, Binary(_, _)) .WillOnce(DoDefault()) .WillOnce(Return(false)); ON_CALL(b1, DoB()) .WillByDefault(Return(1)); EXPECT_CALL(b1, DoB(_)) .WillOnce(Return(2)); ON_CALL(b2, DoB()) .WillByDefault(Return(3)); EXPECT_CALL(b2, DoB(_)); b2.DoB(0); Mock::VerifyAndClear(&b2); // Verifies that the default actions and expectations of a and b1 // are still in effect. EXPECT_TRUE(a.Binary(0, 0)); EXPECT_FALSE(a.Binary(0, 0)); EXPECT_EQ(1, b1.DoB()); EXPECT_EQ(2, b1.DoB(0)); } // Tests that a mock function's action can call a mock function // (either the same function or a different one) either as an explicit // action or as a default action without causing a dead lock. It // verifies that the action is not performed inside the critical // section. TEST(SynchronizationTest, CanCallMockMethodInAction) { MockA a; MockC c; ON_CALL(a, DoA(_)) .WillByDefault(IgnoreResult(InvokeWithoutArgs(&c, &MockC::NonVoidMethod))); EXPECT_CALL(a, DoA(1)); EXPECT_CALL(a, DoA(1)) .WillOnce(Invoke(&a, &MockA::DoA)) .RetiresOnSaturation(); EXPECT_CALL(c, NonVoidMethod()); a.DoA(1); // This will match the second EXPECT_CALL() and trigger another a.DoA(1), // which will in turn match the first EXPECT_CALL() and trigger a call to // c.NonVoidMethod() that was specified by the ON_CALL() since the first // EXPECT_CALL() did not specify an action. } } // namespace // Allows the user to define his own main and then invoke gmock_main // from it. This might be necessary on some platforms which require // specific setup and teardown. #if GMOCK_RENAME_MAIN int gmock_main(int argc, char **argv) { #else int main(int argc, char **argv) { #endif // GMOCK_RENAME_MAIN testing::InitGoogleMock(&argc, argv); // Ensures that the tests pass no matter what value of // --gmock_catch_leaked_mocks and --gmock_verbose the user specifies. testing::GMOCK_FLAG(catch_leaked_mocks) = true; testing::GMOCK_FLAG(verbose) = testing::internal::kWarningVerbosity; return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_all_test.cc0000600000175000017500000000447311561126632023677 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests for Google C++ Mocking Framework (Google Mock) // // Sometimes it's desirable to build most of Google Mock's own tests // by compiling a single file. This file serves this purpose. #include "test/gmock-actions_test.cc" #include "test/gmock-cardinalities_test.cc" #include "test/gmock-generated-actions_test.cc" #include "test/gmock-generated-function-mockers_test.cc" #include "test/gmock-generated-internal-utils_test.cc" #include "test/gmock-generated-matchers_test.cc" #include "test/gmock-internal-utils_test.cc" #include "test/gmock-matchers_test.cc" #include "test/gmock-more-actions_test.cc" #include "test/gmock-nice-strict_test.cc" #include "test/gmock-port_test.cc" #include "test/gmock-spec-builders_test.cc" #include "test/gmock_test.cc" synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_leak_test.py0000600000175000017500000000700011561126632024073 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests that leaked mock objects can be caught be Google Mock.""" __author__ = 'wan@google.com (Zhanyong Wan)' import gmock_test_utils PROGRAM_PATH = gmock_test_utils.GetTestExecutablePath('gmock_leak_test_') TEST_WITH_EXPECT_CALL = [PROGRAM_PATH, '--gtest_filter=*ExpectCall*'] TEST_WITH_ON_CALL = [PROGRAM_PATH, '--gtest_filter=*OnCall*'] TEST_MULTIPLE_LEAKS = [PROGRAM_PATH, '--gtest_filter=*MultipleLeaked*'] class GMockLeakTest(gmock_test_utils.TestCase): def testCatchesLeakedMockByDefault(self): self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_WITH_EXPECT_CALL).exit_code) self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_WITH_ON_CALL).exit_code) def testDoesNotCatchLeakedMockWhenDisabled(self): self.assertEquals( 0, gmock_test_utils.Subprocess(TEST_WITH_EXPECT_CALL + ['--gmock_catch_leaked_mocks=0']).exit_code) self.assertEquals( 0, gmock_test_utils.Subprocess(TEST_WITH_ON_CALL + ['--gmock_catch_leaked_mocks=0']).exit_code) def testCatchesLeakedMockWhenEnabled(self): self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_WITH_EXPECT_CALL + ['--gmock_catch_leaked_mocks']).exit_code) self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_WITH_ON_CALL + ['--gmock_catch_leaked_mocks']).exit_code) def testCatchesLeakedMockWhenEnabledWithExplictFlagValue(self): self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_WITH_EXPECT_CALL + ['--gmock_catch_leaked_mocks=1']).exit_code) def testCatchesMultipleLeakedMocks(self): self.assertNotEqual( 0, gmock_test_utils.Subprocess(TEST_MULTIPLE_LEAKS + ['--gmock_catch_leaked_mocks']).exit_code) if __name__ == '__main__': gmock_test_utils.Main() synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_leak_test_.cc0000600000175000017500000000631111561126632024173 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This program is for verifying that a leaked mock object can be // caught by Google Mock's leak detector. #include "gmock/gmock.h" namespace { using ::testing::Return; class FooInterface { public: virtual ~FooInterface() {} virtual void DoThis() = 0; }; class MockFoo : public FooInterface { public: MockFoo() {} MOCK_METHOD0(DoThis, void()); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); }; TEST(LeakTest, LeakedMockWithExpectCallCausesFailureWhenLeakCheckingIsEnabled) { MockFoo* foo = new MockFoo; EXPECT_CALL(*foo, DoThis()); foo->DoThis(); // In order to test the leak detector, we deliberately leak foo. // Makes sure Google Mock's leak detector can change the exit code // to 1 even when the code is already exiting with 0. exit(0); } TEST(LeakTest, LeakedMockWithOnCallCausesFailureWhenLeakCheckingIsEnabled) { MockFoo* foo = new MockFoo; ON_CALL(*foo, DoThis()).WillByDefault(Return()); // In order to test the leak detector, we deliberately leak foo. // Makes sure Google Mock's leak detector can change the exit code // to 1 even when the code is already exiting with 0. exit(0); } TEST(LeakTest, CatchesMultipleLeakedMockObjects) { MockFoo* foo1 = new MockFoo; MockFoo* foo2 = new MockFoo; ON_CALL(*foo1, DoThis()).WillByDefault(Return()); EXPECT_CALL(*foo2, DoThis()); foo2->DoThis(); // In order to test the leak detector, we deliberately leak foo1 and // foo2. // Makes sure Google Mock's leak detector can change the exit code // to 1 even when the code is already exiting with 0. exit(0); } } // namespace synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_link2_test.cc0000600000175000017500000000363711561126632024147 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // Google Mock - a framework for writing C++ mock classes. // // This file is for verifying that various Google Mock constructs do not // produce linker errors when instantiated in different translation units. // Please see gmock_link_test.h for details. #define LinkTest LinkTest2 #include "test/gmock_link_test.h" synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_link_test.cc0000600000175000017500000000363711561126632024065 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // Google Mock - a framework for writing C++ mock classes. // // This file is for verifying that various Google Mock constructs do not // produce linker errors when instantiated in different translation units. // Please see gmock_link_test.h for details. #define LinkTest LinkTest1 #include "test/gmock_link_test.h" synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_link_test.h0000600000175000017500000004477711561126632023741 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Google Mock - a framework for writing C++ mock classes. // // This file tests that: // a. A header file defining a mock class can be included in multiple // translation units without causing a link error. // b. Actions and matchers can be instantiated with identical template // arguments in different translation units without causing link // errors. // The following constructs are currently tested: // Actions: // Return() // Return(value) // ReturnNull // ReturnRef // Assign // SetArgPointee // SetArrayArgument // SetErrnoAndReturn // Invoke(function) // Invoke(object, method) // InvokeWithoutArgs(function) // InvokeWithoutArgs(object, method) // InvokeArgument // WithArg // WithArgs // WithoutArgs // DoAll // DoDefault // IgnoreResult // Throw // ACTION()-generated // ACTION_P()-generated // ACTION_P2()-generated // Matchers: // _ // A // An // Eq // Gt, Lt, Ge, Le, Ne // NotNull // Ref // TypedEq // DoubleEq // FloatEq // NanSensitiveDoubleEq // NanSensitiveFloatEq // ContainsRegex // MatchesRegex // EndsWith // HasSubstr // StartsWith // StrCaseEq // StrCaseNe // StrEq // StrNe // ElementsAre // ElementsAreArray // ContainerEq // Field // Property // ResultOf(function) // Pointee // Truly(predicate) // AllOf // AnyOf // Not // MatcherCast // // Please note: this test does not verify the functioning of these // constructs, only that the programs using them will link successfully. // // Implementation note: // This test requires identical definitions of Interface and Mock to be // included in different translation units. We achieve this by writing // them in this header and #including it in gmock_link_test.cc and // gmock_link2_test.cc. Because the symbols generated by the compiler for // those constructs must be identical in both translation units, // definitions of Interface and Mock tests MUST be kept in the SAME // NON-ANONYMOUS namespace in this file. The test fixture class LinkTest // is defined as LinkTest1 in gmock_link_test.cc and as LinkTest2 in // gmock_link2_test.cc to avoid producing linker errors. #ifndef GMOCK_TEST_GMOCK_LINK_TEST_H_ #define GMOCK_TEST_GMOCK_LINK_TEST_H_ #include "gmock/gmock.h" #if !GTEST_OS_WINDOWS_MOBILE # include #endif #include "gmock/internal/gmock-port.h" #include "gtest/gtest.h" #include #include using testing::_; using testing::A; using testing::AllOf; using testing::AnyOf; using testing::Assign; using testing::ContainerEq; using testing::DoAll; using testing::DoDefault; using testing::DoubleEq; using testing::ElementsAre; using testing::ElementsAreArray; using testing::EndsWith; using testing::Eq; using testing::Field; using testing::FloatEq; using testing::Ge; using testing::Gt; using testing::HasSubstr; using testing::IgnoreResult; using testing::Invoke; using testing::InvokeArgument; using testing::InvokeWithoutArgs; using testing::IsNull; using testing::Le; using testing::Lt; using testing::Matcher; using testing::MatcherCast; using testing::NanSensitiveDoubleEq; using testing::NanSensitiveFloatEq; using testing::Ne; using testing::Not; using testing::NotNull; using testing::Pointee; using testing::Property; using testing::Ref; using testing::ResultOf; using testing::Return; using testing::ReturnNull; using testing::ReturnRef; using testing::SetArgPointee; using testing::SetArrayArgument; using testing::StartsWith; using testing::StrCaseEq; using testing::StrCaseNe; using testing::StrEq; using testing::StrNe; using testing::Truly; using testing::TypedEq; using testing::WithArg; using testing::WithArgs; using testing::WithoutArgs; #if !GTEST_OS_WINDOWS_MOBILE using testing::SetErrnoAndReturn; #endif #if GTEST_HAS_EXCEPTIONS using testing::Throw; #endif using testing::ContainsRegex; using testing::MatchesRegex; class Interface { public: virtual ~Interface() {} virtual void VoidFromString(char* str) = 0; virtual char* StringFromString(char* str) = 0; virtual int IntFromString(char* str) = 0; virtual int& IntRefFromString(char* str) = 0; virtual void VoidFromFunc(void(*)(char*)) = 0; virtual void VoidFromIntRef(int& n) = 0; virtual void VoidFromFloat(float n) = 0; virtual void VoidFromDouble(double n) = 0; virtual void VoidFromVector(const std::vector& v) = 0; }; class Mock: public Interface { public: Mock() {} MOCK_METHOD1(VoidFromString, void(char* str)); MOCK_METHOD1(StringFromString, char*(char* str)); MOCK_METHOD1(IntFromString, int(char* str)); MOCK_METHOD1(IntRefFromString, int&(char* str)); MOCK_METHOD1(VoidFromFunc, void(void(*func)(char* str))); MOCK_METHOD1(VoidFromIntRef, void(int& n)); MOCK_METHOD1(VoidFromFloat, void(float n)); MOCK_METHOD1(VoidFromDouble, void(double n)); MOCK_METHOD1(VoidFromVector, void(const std::vector& v)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mock); }; class InvokeHelper { public: static void StaticVoidFromVoid() {} void VoidFromVoid() {} static void StaticVoidFromString(char*) {} void VoidFromString(char*) {} static int StaticIntFromString(char*) { return 1; } static bool StaticBoolFromString(const char*) { return true; } }; class FieldHelper { public: FieldHelper(int a_field) : field_(a_field) {} int field() const { return field_; } int field_; // NOLINT -- need external access to field_ to test // the Field matcher. }; // Tests the linkage of the ReturnVoid action. TEST(LinkTest, TestReturnVoid) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(Return()); mock.VoidFromString(NULL); } // Tests the linkage of the Return action. TEST(LinkTest, TestReturn) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, StringFromString(_)).WillOnce(Return(&ch)); mock.StringFromString(NULL); } // Tests the linkage of the ReturnNull action. TEST(LinkTest, TestReturnNull) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(Return()); mock.VoidFromString(NULL); } // Tests the linkage of the ReturnRef action. TEST(LinkTest, TestReturnRef) { Mock mock; int n = 42; EXPECT_CALL(mock, IntRefFromString(_)).WillOnce(ReturnRef(n)); mock.IntRefFromString(NULL); } // Tests the linkage of the Assign action. TEST(LinkTest, TestAssign) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(Assign(&ch, 'y')); mock.VoidFromString(NULL); } // Tests the linkage of the SetArgPointee action. TEST(LinkTest, TestSetArgPointee) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(SetArgPointee<0>('y')); mock.VoidFromString(&ch); } // Tests the linkage of the SetArrayArgument action. TEST(LinkTest, TestSetArrayArgument) { Mock mock; char ch = 'x'; char ch2 = 'y'; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(SetArrayArgument<0>(&ch2, &ch2 + 1)); mock.VoidFromString(&ch); } #if !GTEST_OS_WINDOWS_MOBILE // Tests the linkage of the SetErrnoAndReturn action. TEST(LinkTest, TestSetErrnoAndReturn) { Mock mock; int saved_errno = errno; EXPECT_CALL(mock, IntFromString(_)).WillOnce(SetErrnoAndReturn(1, -1)); mock.IntFromString(NULL); errno = saved_errno; } #endif // !GTEST_OS_WINDOWS_MOBILE // Tests the linkage of the Invoke(function) and Invoke(object, method) actions. TEST(LinkTest, TestInvoke) { Mock mock; InvokeHelper test_invoke_helper; EXPECT_CALL(mock, VoidFromString(_)) .WillOnce(Invoke(&InvokeHelper::StaticVoidFromString)) .WillOnce(Invoke(&test_invoke_helper, &InvokeHelper::VoidFromString)); mock.VoidFromString(NULL); mock.VoidFromString(NULL); } // Tests the linkage of the InvokeWithoutArgs action. TEST(LinkTest, TestInvokeWithoutArgs) { Mock mock; InvokeHelper test_invoke_helper; EXPECT_CALL(mock, VoidFromString(_)) .WillOnce(InvokeWithoutArgs(&InvokeHelper::StaticVoidFromVoid)) .WillOnce(InvokeWithoutArgs(&test_invoke_helper, &InvokeHelper::VoidFromVoid)); mock.VoidFromString(NULL); mock.VoidFromString(NULL); } // Tests the linkage of the InvokeArgument action. TEST(LinkTest, TestInvokeArgument) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, VoidFromFunc(_)).WillOnce(InvokeArgument<0>(&ch)); mock.VoidFromFunc(InvokeHelper::StaticVoidFromString); } // Tests the linkage of the WithArg action. TEST(LinkTest, TestWithArg) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)) .WillOnce(WithArg<0>(Invoke(&InvokeHelper::StaticVoidFromString))); mock.VoidFromString(NULL); } // Tests the linkage of the WithArgs action. TEST(LinkTest, TestWithArgs) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)) .WillOnce(WithArgs<0>(Invoke(&InvokeHelper::StaticVoidFromString))); mock.VoidFromString(NULL); } // Tests the linkage of the WithoutArgs action. TEST(LinkTest, TestWithoutArgs) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(WithoutArgs(Return())); mock.VoidFromString(NULL); } // Tests the linkage of the DoAll action. TEST(LinkTest, TestDoAll) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, VoidFromString(_)) .WillOnce(DoAll(SetArgPointee<0>('y'), Return())); mock.VoidFromString(&ch); } // Tests the linkage of the DoDefault action. TEST(LinkTest, TestDoDefault) { Mock mock; char ch = 'x'; ON_CALL(mock, VoidFromString(_)).WillByDefault(Return()); EXPECT_CALL(mock, VoidFromString(_)).WillOnce(DoDefault()); mock.VoidFromString(&ch); } // Tests the linkage of the IgnoreResult action. TEST(LinkTest, TestIgnoreResult) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(IgnoreResult(Return(42))); mock.VoidFromString(NULL); } #if GTEST_HAS_EXCEPTIONS // Tests the linkage of the Throw action. TEST(LinkTest, TestThrow) { Mock mock; EXPECT_CALL(mock, VoidFromString(_)).WillOnce(Throw(42)); EXPECT_THROW(mock.VoidFromString(NULL), int); } #endif // GTEST_HAS_EXCEPTIONS // The ACTION*() macros trigger warning C4100 (unreferenced formal // parameter) in MSVC with -W4. Unfortunately they cannot be fixed in // the macro definition, as the warnings are generated when the macro // is expanded and macro expansion cannot contain #pragma. Therefore // we suppress them here. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable:4100) #endif // Tests the linkage of actions created using ACTION macro. namespace { ACTION(Return1) { return 1; } } TEST(LinkTest, TestActionMacro) { Mock mock; EXPECT_CALL(mock, IntFromString(_)).WillOnce(Return1()); mock.IntFromString(NULL); } // Tests the linkage of actions created using ACTION_P macro. namespace { ACTION_P(ReturnArgument, ret_value) { return ret_value; } } TEST(LinkTest, TestActionPMacro) { Mock mock; EXPECT_CALL(mock, IntFromString(_)).WillOnce(ReturnArgument(42)); mock.IntFromString(NULL); } // Tests the linkage of actions created using ACTION_P2 macro. namespace { ACTION_P2(ReturnEqualsEitherOf, first, second) { return arg0 == first || arg0 == second; } } #ifdef _MSC_VER # pragma warning(pop) #endif TEST(LinkTest, TestActionP2Macro) { Mock mock; char ch = 'x'; EXPECT_CALL(mock, IntFromString(_)) .WillOnce(ReturnEqualsEitherOf("one", "two")); mock.IntFromString(&ch); } // Tests the linkage of the "_" matcher. TEST(LinkTest, TestMatcherAnything) { Mock mock; ON_CALL(mock, VoidFromString(_)).WillByDefault(Return()); } // Tests the linkage of the A matcher. TEST(LinkTest, TestMatcherA) { Mock mock; ON_CALL(mock, VoidFromString(A())).WillByDefault(Return()); } // Tests the linkage of the Eq and the "bare value" matcher. TEST(LinkTest, TestMatchersEq) { Mock mock; const char* p = "x"; ON_CALL(mock, VoidFromString(Eq(p))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(const_cast("y"))) .WillByDefault(Return()); } // Tests the linkage of the Lt, Gt, Le, Ge, and Ne matchers. TEST(LinkTest, TestMatchersRelations) { Mock mock; ON_CALL(mock, VoidFromFloat(Lt(1.0f))).WillByDefault(Return()); ON_CALL(mock, VoidFromFloat(Gt(1.0f))).WillByDefault(Return()); ON_CALL(mock, VoidFromFloat(Le(1.0f))).WillByDefault(Return()); ON_CALL(mock, VoidFromFloat(Ge(1.0f))).WillByDefault(Return()); ON_CALL(mock, VoidFromFloat(Ne(1.0f))).WillByDefault(Return()); } // Tests the linkage of the NotNull matcher. TEST(LinkTest, TestMatcherNotNull) { Mock mock; ON_CALL(mock, VoidFromString(NotNull())).WillByDefault(Return()); } // Tests the linkage of the IsNull matcher. TEST(LinkTest, TestMatcherIsNull) { Mock mock; ON_CALL(mock, VoidFromString(IsNull())).WillByDefault(Return()); } // Tests the linkage of the Ref matcher. TEST(LinkTest, TestMatcherRef) { Mock mock; int a = 0; ON_CALL(mock, VoidFromIntRef(Ref(a))).WillByDefault(Return()); } // Tests the linkage of the TypedEq matcher. TEST(LinkTest, TestMatcherTypedEq) { Mock mock; long a = 0; ON_CALL(mock, VoidFromIntRef(TypedEq(a))).WillByDefault(Return()); } // Tests the linkage of the FloatEq, DoubleEq, NanSensitiveFloatEq and // NanSensitiveDoubleEq matchers. TEST(LinkTest, TestMatchersFloatingPoint) { Mock mock; float a = 0; ON_CALL(mock, VoidFromFloat(FloatEq(a))).WillByDefault(Return()); ON_CALL(mock, VoidFromDouble(DoubleEq(a))).WillByDefault(Return()); ON_CALL(mock, VoidFromFloat(NanSensitiveFloatEq(a))).WillByDefault(Return()); ON_CALL(mock, VoidFromDouble(NanSensitiveDoubleEq(a))) .WillByDefault(Return()); } // Tests the linkage of the ContainsRegex matcher. TEST(LinkTest, TestMatcherContainsRegex) { Mock mock; ON_CALL(mock, VoidFromString(ContainsRegex(".*"))).WillByDefault(Return()); } // Tests the linkage of the MatchesRegex matcher. TEST(LinkTest, TestMatcherMatchesRegex) { Mock mock; ON_CALL(mock, VoidFromString(MatchesRegex(".*"))).WillByDefault(Return()); } // Tests the linkage of the StartsWith, EndsWith, and HasSubstr matchers. TEST(LinkTest, TestMatchersSubstrings) { Mock mock; ON_CALL(mock, VoidFromString(StartsWith("a"))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(EndsWith("c"))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(HasSubstr("b"))).WillByDefault(Return()); } // Tests the linkage of the StrEq, StrNe, StrCaseEq, and StrCaseNe matchers. TEST(LinkTest, TestMatchersStringEquality) { Mock mock; ON_CALL(mock, VoidFromString(StrEq("a"))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(StrNe("a"))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(StrCaseEq("a"))).WillByDefault(Return()); ON_CALL(mock, VoidFromString(StrCaseNe("a"))).WillByDefault(Return()); } // Tests the linkage of the ElementsAre matcher. TEST(LinkTest, TestMatcherElementsAre) { Mock mock; ON_CALL(mock, VoidFromVector(ElementsAre('a', _))).WillByDefault(Return()); } // Tests the linkage of the ElementsAreArray matcher. TEST(LinkTest, TestMatcherElementsAreArray) { Mock mock; char arr[] = { 'a', 'b' }; ON_CALL(mock, VoidFromVector(ElementsAreArray(arr))).WillByDefault(Return()); } // Tests the linkage of the ContainerEq matcher. TEST(LinkTest, TestMatcherContainerEq) { Mock mock; std::vector v; ON_CALL(mock, VoidFromVector(ContainerEq(v))).WillByDefault(Return()); } // Tests the linkage of the Field matcher. TEST(LinkTest, TestMatcherField) { FieldHelper helper(0); Matcher m = Field(&FieldHelper::field_, Eq(0)); EXPECT_TRUE(m.Matches(helper)); Matcher m2 = Field(&FieldHelper::field_, Eq(0)); EXPECT_TRUE(m2.Matches(&helper)); } // Tests the linkage of the Property matcher. TEST(LinkTest, TestMatcherProperty) { FieldHelper helper(0); Matcher m = Property(&FieldHelper::field, Eq(0)); EXPECT_TRUE(m.Matches(helper)); Matcher m2 = Property(&FieldHelper::field, Eq(0)); EXPECT_TRUE(m2.Matches(&helper)); } // Tests the linkage of the ResultOf matcher. TEST(LinkTest, TestMatcherResultOf) { Matcher m = ResultOf(&InvokeHelper::StaticIntFromString, Eq(1)); EXPECT_TRUE(m.Matches(NULL)); } // Tests the linkage of the ResultOf matcher. TEST(LinkTest, TestMatcherPointee) { int n = 1; Matcher m = Pointee(Eq(1)); EXPECT_TRUE(m.Matches(&n)); } // Tests the linkage of the Truly matcher. TEST(LinkTest, TestMatcherTruly) { Matcher m = Truly(&InvokeHelper::StaticBoolFromString); EXPECT_TRUE(m.Matches(NULL)); } // Tests the linkage of the AllOf matcher. TEST(LinkTest, TestMatcherAllOf) { Matcher m = AllOf(_, Eq(1)); EXPECT_TRUE(m.Matches(1)); } // Tests the linkage of the AnyOf matcher. TEST(LinkTest, TestMatcherAnyOf) { Matcher m = AnyOf(_, Eq(1)); EXPECT_TRUE(m.Matches(1)); } // Tests the linkage of the Not matcher. TEST(LinkTest, TestMatcherNot) { Matcher m = Not(_); EXPECT_FALSE(m.Matches(1)); } // Tests the linkage of the MatcherCast() function. TEST(LinkTest, TestMatcherCast) { Matcher m = MatcherCast(_); EXPECT_TRUE(m.Matches(NULL)); } #endif // GMOCK_TEST_GMOCK_LINK_TEST_H_ synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_output_test.py0000600000175000017500000001355711561126632024535 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests the text output of Google C++ Mocking Framework. SYNOPSIS gmock_output_test.py --build_dir=BUILD/DIR --gengolden # where BUILD/DIR contains the built gmock_output_test_ file. gmock_output_test.py --gengolden gmock_output_test.py """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sys import gmock_test_utils # The flag for generating the golden file GENGOLDEN_FLAG = '--gengolden' PROGRAM_PATH = gmock_test_utils.GetTestExecutablePath('gmock_output_test_') COMMAND = [PROGRAM_PATH, '--gtest_stack_trace_depth=0', '--gtest_print_time=0'] GOLDEN_NAME = 'gmock_output_test_golden.txt' GOLDEN_PATH = os.path.join(gmock_test_utils.GetSourceDir(), GOLDEN_NAME) def ToUnixLineEnding(s): """Changes all Windows/Mac line endings in s to UNIX line endings.""" return s.replace('\r\n', '\n').replace('\r', '\n') def RemoveReportHeaderAndFooter(output): """Removes Google Test result report's header and footer from the output.""" output = re.sub(r'.*gtest_main.*\n', '', output) output = re.sub(r'\[.*\d+ tests.*\n', '', output) output = re.sub(r'\[.* test environment .*\n', '', output) output = re.sub(r'\[=+\] \d+ tests .* ran.*', '', output) output = re.sub(r'.* FAILED TESTS\n', '', output) return output def RemoveLocations(output): """Removes all file location info from a Google Test program's output. Args: output: the output of a Google Test program. Returns: output with all file location info (in the form of 'DIRECTORY/FILE_NAME:LINE_NUMBER: 'or 'DIRECTORY\\FILE_NAME(LINE_NUMBER): ') replaced by 'FILE:#: '. """ return re.sub(r'.*[/\\](.+)(\:\d+|\(\d+\))\:', 'FILE:#:', output) def NormalizeErrorMarker(output): """Normalizes the error marker, which is different on Windows vs on Linux.""" return re.sub(r' error: ', ' Failure\n', output) def RemoveMemoryAddresses(output): """Removes memory addresses from the test output.""" return re.sub(r'@\w+', '@0x#', output) def RemoveTestNamesOfLeakedMocks(output): """Removes the test names of leaked mock objects from the test output.""" return re.sub(r'\(used in test .+\) ', '', output) def GetLeakyTests(output): """Returns a list of test names that leak mock objects.""" # findall() returns a list of all matches of the regex in output. # For example, if '(used in test FooTest.Bar)' is in output, the # list will contain 'FooTest.Bar'. return re.findall(r'\(used in test (.+)\)', output) def GetNormalizedOutputAndLeakyTests(output): """Normalizes the output of gmock_output_test_. Args: output: The test output. Returns: A tuple (the normalized test output, the list of test names that have leaked mocks). """ output = ToUnixLineEnding(output) output = RemoveReportHeaderAndFooter(output) output = NormalizeErrorMarker(output) output = RemoveLocations(output) output = RemoveMemoryAddresses(output) return (RemoveTestNamesOfLeakedMocks(output), GetLeakyTests(output)) def GetShellCommandOutput(cmd): """Runs a command in a sub-process, and returns its STDOUT in a string.""" return gmock_test_utils.Subprocess(cmd, capture_stderr=False).output def GetNormalizedCommandOutputAndLeakyTests(cmd): """Runs a command and returns its normalized output and a list of leaky tests. Args: cmd: the shell command. """ # Disables exception pop-ups on Windows. os.environ['GTEST_CATCH_EXCEPTIONS'] = '1' return GetNormalizedOutputAndLeakyTests(GetShellCommandOutput(cmd)) class GMockOutputTest(gmock_test_utils.TestCase): def testOutput(self): (output, leaky_tests) = GetNormalizedCommandOutputAndLeakyTests(COMMAND) golden_file = open(GOLDEN_PATH, 'rb') golden = golden_file.read() golden_file.close() # The normalized output should match the golden file. self.assertEquals(golden, output) # The raw output should contain 2 leaked mock object errors for # test GMockOutputTest.CatchesLeakedMocks. self.assertEquals(['GMockOutputTest.CatchesLeakedMocks', 'GMockOutputTest.CatchesLeakedMocks'], leaky_tests) if __name__ == '__main__': if sys.argv[1:] == [GENGOLDEN_FLAG]: (output, _) = GetNormalizedCommandOutputAndLeakyTests(COMMAND) golden_file = open(GOLDEN_PATH, 'wb') golden_file.write(output) golden_file.close() else: gmock_test_utils.Main() synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_output_test_.cc0000600000175000017500000001772511561126632024632 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Tests Google Mock's output in various scenarios. This ensures that // Google Mock's messages are readable and useful. #include "gmock/gmock.h" #include #include #include "gtest/gtest.h" using testing::_; using testing::AnyNumber; using testing::Ge; using testing::InSequence; using testing::Ref; using testing::Return; using testing::Sequence; class MockFoo { public: MockFoo() {} MOCK_METHOD3(Bar, char(const std::string& s, int i, double x)); MOCK_METHOD2(Bar2, bool(int x, int y)); MOCK_METHOD2(Bar3, void(int x, int y)); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); }; class GMockOutputTest : public testing::Test { protected: MockFoo foo_; }; TEST_F(GMockOutputTest, ExpectedCall) { testing::GMOCK_FLAG(verbose) = "info"; EXPECT_CALL(foo_, Bar2(0, _)); foo_.Bar2(0, 0); // Expected call testing::GMOCK_FLAG(verbose) = "warning"; } TEST_F(GMockOutputTest, ExpectedCallToVoidFunction) { testing::GMOCK_FLAG(verbose) = "info"; EXPECT_CALL(foo_, Bar3(0, _)); foo_.Bar3(0, 0); // Expected call testing::GMOCK_FLAG(verbose) = "warning"; } TEST_F(GMockOutputTest, ExplicitActionsRunOut) { EXPECT_CALL(foo_, Bar2(_, _)) .Times(2) .WillOnce(Return(false)); foo_.Bar2(2, 2); foo_.Bar2(1, 1); // Explicit actions in EXPECT_CALL run out. } TEST_F(GMockOutputTest, UnexpectedCall) { EXPECT_CALL(foo_, Bar2(0, _)); foo_.Bar2(1, 0); // Unexpected call foo_.Bar2(0, 0); // Expected call } TEST_F(GMockOutputTest, UnexpectedCallToVoidFunction) { EXPECT_CALL(foo_, Bar3(0, _)); foo_.Bar3(1, 0); // Unexpected call foo_.Bar3(0, 0); // Expected call } TEST_F(GMockOutputTest, ExcessiveCall) { EXPECT_CALL(foo_, Bar2(0, _)); foo_.Bar2(0, 0); // Expected call foo_.Bar2(0, 1); // Excessive call } TEST_F(GMockOutputTest, ExcessiveCallToVoidFunction) { EXPECT_CALL(foo_, Bar3(0, _)); foo_.Bar3(0, 0); // Expected call foo_.Bar3(0, 1); // Excessive call } TEST_F(GMockOutputTest, UninterestingCall) { foo_.Bar2(0, 1); // Uninteresting call } TEST_F(GMockOutputTest, UninterestingCallToVoidFunction) { foo_.Bar3(0, 1); // Uninteresting call } TEST_F(GMockOutputTest, RetiredExpectation) { EXPECT_CALL(foo_, Bar2(_, _)) .RetiresOnSaturation(); EXPECT_CALL(foo_, Bar2(0, 0)); foo_.Bar2(1, 1); foo_.Bar2(1, 1); // Matches a retired expectation foo_.Bar2(0, 0); } TEST_F(GMockOutputTest, UnsatisfiedPrerequisite) { { InSequence s; EXPECT_CALL(foo_, Bar(_, 0, _)); EXPECT_CALL(foo_, Bar2(0, 0)); EXPECT_CALL(foo_, Bar2(1, _)); } foo_.Bar2(1, 0); // Has one immediate unsatisfied pre-requisite foo_.Bar("Hi", 0, 0); foo_.Bar2(0, 0); foo_.Bar2(1, 0); } TEST_F(GMockOutputTest, UnsatisfiedPrerequisites) { Sequence s1, s2; EXPECT_CALL(foo_, Bar(_, 0, _)) .InSequence(s1); EXPECT_CALL(foo_, Bar2(0, 0)) .InSequence(s2); EXPECT_CALL(foo_, Bar2(1, _)) .InSequence(s1, s2); foo_.Bar2(1, 0); // Has two immediate unsatisfied pre-requisites foo_.Bar("Hi", 0, 0); foo_.Bar2(0, 0); foo_.Bar2(1, 0); } TEST_F(GMockOutputTest, UnsatisfiedWith) { EXPECT_CALL(foo_, Bar2(_, _)).With(Ge()); } TEST_F(GMockOutputTest, UnsatisfiedExpectation) { EXPECT_CALL(foo_, Bar(_, _, _)); EXPECT_CALL(foo_, Bar2(0, _)) .Times(2); foo_.Bar2(0, 1); } TEST_F(GMockOutputTest, MismatchArguments) { const std::string s = "Hi"; EXPECT_CALL(foo_, Bar(Ref(s), _, Ge(0))); foo_.Bar("Ho", 0, -0.1); // Mismatch arguments foo_.Bar(s, 0, 0); } TEST_F(GMockOutputTest, MismatchWith) { EXPECT_CALL(foo_, Bar2(Ge(2), Ge(1))) .With(Ge()); foo_.Bar2(2, 3); // Mismatch With() foo_.Bar2(2, 1); } TEST_F(GMockOutputTest, MismatchArgumentsAndWith) { EXPECT_CALL(foo_, Bar2(Ge(2), Ge(1))) .With(Ge()); foo_.Bar2(1, 3); // Mismatch arguments and mismatch With() foo_.Bar2(2, 1); } TEST_F(GMockOutputTest, UnexpectedCallWithDefaultAction) { ON_CALL(foo_, Bar2(_, _)) .WillByDefault(Return(true)); // Default action #1 ON_CALL(foo_, Bar2(1, _)) .WillByDefault(Return(false)); // Default action #2 EXPECT_CALL(foo_, Bar2(2, 2)); foo_.Bar2(1, 0); // Unexpected call, takes default action #2. foo_.Bar2(0, 0); // Unexpected call, takes default action #1. foo_.Bar2(2, 2); // Expected call. } TEST_F(GMockOutputTest, ExcessiveCallWithDefaultAction) { ON_CALL(foo_, Bar2(_, _)) .WillByDefault(Return(true)); // Default action #1 ON_CALL(foo_, Bar2(1, _)) .WillByDefault(Return(false)); // Default action #2 EXPECT_CALL(foo_, Bar2(2, 2)); EXPECT_CALL(foo_, Bar2(1, 1)); foo_.Bar2(2, 2); // Expected call. foo_.Bar2(2, 2); // Excessive call, takes default action #1. foo_.Bar2(1, 1); // Expected call. foo_.Bar2(1, 1); // Excessive call, takes default action #2. } TEST_F(GMockOutputTest, UninterestingCallWithDefaultAction) { ON_CALL(foo_, Bar2(_, _)) .WillByDefault(Return(true)); // Default action #1 ON_CALL(foo_, Bar2(1, _)) .WillByDefault(Return(false)); // Default action #2 foo_.Bar2(2, 2); // Uninteresting call, takes default action #1. foo_.Bar2(1, 1); // Uninteresting call, takes default action #2. } TEST_F(GMockOutputTest, ExplicitActionsRunOutWithDefaultAction) { ON_CALL(foo_, Bar2(_, _)) .WillByDefault(Return(true)); // Default action #1 EXPECT_CALL(foo_, Bar2(_, _)) .Times(2) .WillOnce(Return(false)); foo_.Bar2(2, 2); foo_.Bar2(1, 1); // Explicit actions in EXPECT_CALL run out. } TEST_F(GMockOutputTest, CatchesLeakedMocks) { MockFoo* foo1 = new MockFoo; MockFoo* foo2 = new MockFoo; // Invokes ON_CALL on foo1. ON_CALL(*foo1, Bar(_, _, _)).WillByDefault(Return('a')); // Invokes EXPECT_CALL on foo2. EXPECT_CALL(*foo2, Bar2(_, _)); EXPECT_CALL(*foo2, Bar2(1, _)); EXPECT_CALL(*foo2, Bar3(_, _)).Times(AnyNumber()); foo2->Bar2(2, 1); foo2->Bar2(1, 1); // Both foo1 and foo2 are deliberately leaked. } void TestCatchesLeakedMocksInAdHocTests() { MockFoo* foo = new MockFoo; // Invokes EXPECT_CALL on foo. EXPECT_CALL(*foo, Bar2(_, _)); foo->Bar2(2, 1); // foo is deliberately leaked. } int main(int argc, char **argv) { testing::InitGoogleMock(&argc, argv); // Ensures that the tests pass no matter what value of // --gmock_catch_leaked_mocks and --gmock_verbose the user specifies. testing::GMOCK_FLAG(catch_leaked_mocks) = true; testing::GMOCK_FLAG(verbose) = "warning"; TestCatchesLeakedMocksInAdHocTests(); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_output_test_golden.txt0000600000175000017500000002716411561126632026253 0ustar synergysynergy[ RUN ] GMockOutputTest.ExpectedCall FILE:#: EXPECT_CALL(foo_, Bar2(0, _)) invoked Stack trace: FILE:#: Mock function call matches EXPECT_CALL(foo_, Bar2(0, _))... Function call: Bar2(0, 0) Returns: false Stack trace: [ OK ] GMockOutputTest.ExpectedCall [ RUN ] GMockOutputTest.ExpectedCallToVoidFunction FILE:#: EXPECT_CALL(foo_, Bar3(0, _)) invoked Stack trace: FILE:#: Mock function call matches EXPECT_CALL(foo_, Bar3(0, _))... Function call: Bar3(0, 0) Stack trace: [ OK ] GMockOutputTest.ExpectedCallToVoidFunction [ RUN ] GMockOutputTest.ExplicitActionsRunOut GMOCK WARNING: FILE:#: Too few actions specified in EXPECT_CALL(foo_, Bar2(_, _))... Expected to be called twice, but has only 1 WillOnce(). GMOCK WARNING: FILE:#: Actions ran out in EXPECT_CALL(foo_, Bar2(_, _))... Called 2 times, but only 1 WillOnce() is specified - returning default value. Stack trace: [ OK ] GMockOutputTest.ExplicitActionsRunOut [ RUN ] GMockOutputTest.UnexpectedCall unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(1, 0) Returns: false Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar2(0, _))... Expected arg #0: is equal to 0 Actual: 1 Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnexpectedCall [ RUN ] GMockOutputTest.UnexpectedCallToVoidFunction unknown file: Failure Unexpected mock function call - returning directly. Function call: Bar3(1, 0) Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar3(0, _))... Expected arg #0: is equal to 0 Actual: 1 Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnexpectedCallToVoidFunction [ RUN ] GMockOutputTest.ExcessiveCall FILE:#: Failure Mock function called more times than expected - returning default value. Function call: Bar2(0, 1) Returns: false Expected: to be called once Actual: called twice - over-saturated and active [ FAILED ] GMockOutputTest.ExcessiveCall [ RUN ] GMockOutputTest.ExcessiveCallToVoidFunction FILE:#: Failure Mock function called more times than expected - returning directly. Function call: Bar3(0, 1) Expected: to be called once Actual: called twice - over-saturated and active [ FAILED ] GMockOutputTest.ExcessiveCallToVoidFunction [ RUN ] GMockOutputTest.UninterestingCall GMOCK WARNING: Uninteresting mock function call - returning default value. Function call: Bar2(0, 1) Returns: false Stack trace: [ OK ] GMockOutputTest.UninterestingCall [ RUN ] GMockOutputTest.UninterestingCallToVoidFunction GMOCK WARNING: Uninteresting mock function call - returning directly. Function call: Bar3(0, 1) Stack trace: [ OK ] GMockOutputTest.UninterestingCallToVoidFunction [ RUN ] GMockOutputTest.RetiredExpectation unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(1, 1) Returns: false Google Mock tried the following 2 expectations, but none matched: FILE:#: tried expectation #0: EXPECT_CALL(foo_, Bar2(_, _))... Expected: the expectation is active Actual: it is retired Expected: to be called once Actual: called once - saturated and retired FILE:#: tried expectation #1: EXPECT_CALL(foo_, Bar2(0, 0))... Expected arg #0: is equal to 0 Actual: 1 Expected arg #1: is equal to 0 Actual: 1 Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.RetiredExpectation [ RUN ] GMockOutputTest.UnsatisfiedPrerequisite unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(1, 0) Returns: false Google Mock tried the following 2 expectations, but none matched: FILE:#: tried expectation #0: EXPECT_CALL(foo_, Bar2(0, 0))... Expected arg #0: is equal to 0 Actual: 1 Expected: to be called once Actual: never called - unsatisfied and active FILE:#: tried expectation #1: EXPECT_CALL(foo_, Bar2(1, _))... Expected: all pre-requisites are satisfied Actual: the following immediate pre-requisites are not satisfied: FILE:#: pre-requisite #0 (end of pre-requisites) Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnsatisfiedPrerequisite [ RUN ] GMockOutputTest.UnsatisfiedPrerequisites unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(1, 0) Returns: false Google Mock tried the following 2 expectations, but none matched: FILE:#: tried expectation #0: EXPECT_CALL(foo_, Bar2(0, 0))... Expected arg #0: is equal to 0 Actual: 1 Expected: to be called once Actual: never called - unsatisfied and active FILE:#: tried expectation #1: EXPECT_CALL(foo_, Bar2(1, _))... Expected: all pre-requisites are satisfied Actual: the following immediate pre-requisites are not satisfied: FILE:#: pre-requisite #0 FILE:#: pre-requisite #1 (end of pre-requisites) Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnsatisfiedPrerequisites [ RUN ] GMockOutputTest.UnsatisfiedWith FILE:#: Failure Actual function call count doesn't match EXPECT_CALL(foo_, Bar2(_, _))... Expected args: are a pair where the first >= the second Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnsatisfiedWith [ RUN ] GMockOutputTest.UnsatisfiedExpectation FILE:#: Failure Actual function call count doesn't match EXPECT_CALL(foo_, Bar2(0, _))... Expected: to be called twice Actual: called once - unsatisfied and active FILE:#: Failure Actual function call count doesn't match EXPECT_CALL(foo_, Bar(_, _, _))... Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnsatisfiedExpectation [ RUN ] GMockOutputTest.MismatchArguments unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar(@0x# "Ho", 0, -0.1) Returns: '\0' Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar(Ref(s), _, Ge(0)))... Expected arg #0: references the variable @0x# "Hi" Actual: "Ho", which is located @0x# Expected arg #2: is >= 0 Actual: -0.1 Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.MismatchArguments [ RUN ] GMockOutputTest.MismatchWith unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(2, 3) Returns: false Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar2(Ge(2), Ge(1)))... Expected args: are a pair where the first >= the second Actual: don't match Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.MismatchWith [ RUN ] GMockOutputTest.MismatchArgumentsAndWith unknown file: Failure Unexpected mock function call - returning default value. Function call: Bar2(1, 3) Returns: false Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar2(Ge(2), Ge(1)))... Expected arg #0: is >= 2 Actual: 1 Expected args: are a pair where the first >= the second Actual: don't match Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.MismatchArgumentsAndWith [ RUN ] GMockOutputTest.UnexpectedCallWithDefaultAction unknown file: Failure Unexpected mock function call - taking default action specified at: FILE:#: Function call: Bar2(1, 0) Returns: false Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar2(2, 2))... Expected arg #0: is equal to 2 Actual: 1 Expected arg #1: is equal to 2 Actual: 0 Expected: to be called once Actual: never called - unsatisfied and active unknown file: Failure Unexpected mock function call - taking default action specified at: FILE:#: Function call: Bar2(0, 0) Returns: true Google Mock tried the following 1 expectation, but it didn't match: FILE:#: EXPECT_CALL(foo_, Bar2(2, 2))... Expected arg #0: is equal to 2 Actual: 0 Expected arg #1: is equal to 2 Actual: 0 Expected: to be called once Actual: never called - unsatisfied and active [ FAILED ] GMockOutputTest.UnexpectedCallWithDefaultAction [ RUN ] GMockOutputTest.ExcessiveCallWithDefaultAction FILE:#: Failure Mock function called more times than expected - taking default action specified at: FILE:#: Function call: Bar2(2, 2) Returns: true Expected: to be called once Actual: called twice - over-saturated and active FILE:#: Failure Mock function called more times than expected - taking default action specified at: FILE:#: Function call: Bar2(1, 1) Returns: false Expected: to be called once Actual: called twice - over-saturated and active [ FAILED ] GMockOutputTest.ExcessiveCallWithDefaultAction [ RUN ] GMockOutputTest.UninterestingCallWithDefaultAction GMOCK WARNING: Uninteresting mock function call - taking default action specified at: FILE:#: Function call: Bar2(2, 2) Returns: true Stack trace: GMOCK WARNING: Uninteresting mock function call - taking default action specified at: FILE:#: Function call: Bar2(1, 1) Returns: false Stack trace: [ OK ] GMockOutputTest.UninterestingCallWithDefaultAction [ RUN ] GMockOutputTest.ExplicitActionsRunOutWithDefaultAction GMOCK WARNING: FILE:#: Too few actions specified in EXPECT_CALL(foo_, Bar2(_, _))... Expected to be called twice, but has only 1 WillOnce(). GMOCK WARNING: FILE:#: Actions ran out in EXPECT_CALL(foo_, Bar2(_, _))... Called 2 times, but only 1 WillOnce() is specified - taking default action specified at: FILE:#: Stack trace: [ OK ] GMockOutputTest.ExplicitActionsRunOutWithDefaultAction [ RUN ] GMockOutputTest.CatchesLeakedMocks [ OK ] GMockOutputTest.CatchesLeakedMocks [ FAILED ] GMockOutputTest.UnexpectedCall [ FAILED ] GMockOutputTest.UnexpectedCallToVoidFunction [ FAILED ] GMockOutputTest.ExcessiveCall [ FAILED ] GMockOutputTest.ExcessiveCallToVoidFunction [ FAILED ] GMockOutputTest.RetiredExpectation [ FAILED ] GMockOutputTest.UnsatisfiedPrerequisite [ FAILED ] GMockOutputTest.UnsatisfiedPrerequisites [ FAILED ] GMockOutputTest.UnsatisfiedWith [ FAILED ] GMockOutputTest.UnsatisfiedExpectation [ FAILED ] GMockOutputTest.MismatchArguments [ FAILED ] GMockOutputTest.MismatchWith [ FAILED ] GMockOutputTest.MismatchArgumentsAndWith [ FAILED ] GMockOutputTest.UnexpectedCallWithDefaultAction [ FAILED ] GMockOutputTest.ExcessiveCallWithDefaultAction FILE:#: ERROR: this mock object should be deleted but never is. Its address is @0x#. FILE:#: ERROR: this mock object should be deleted but never is. Its address is @0x#. FILE:#: ERROR: this mock object should be deleted but never is. Its address is @0x#. ERROR: 3 leaked mock objects found at program exit. synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_test.cc0000600000175000017500000001426511561126632023047 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Mock - a framework for writing C++ mock classes. // // This file tests code in gmock.cc. #include "gmock/gmock.h" #include #include "gtest/gtest.h" using testing::GMOCK_FLAG(verbose); using testing::InitGoogleMock; using testing::internal::g_init_gtest_count; // Verifies that calling InitGoogleMock() on argv results in new_argv, // and the gmock_verbose flag's value is set to expected_gmock_verbose. template void TestInitGoogleMock(const Char* (&argv)[M], const Char* (&new_argv)[N], const ::std::string& expected_gmock_verbose) { const ::std::string old_verbose = GMOCK_FLAG(verbose); int argc = M; InitGoogleMock(&argc, const_cast(argv)); ASSERT_EQ(N, argc) << "The new argv has wrong number of elements."; for (int i = 0; i < N; i++) { EXPECT_STREQ(new_argv[i], argv[i]); } EXPECT_EQ(expected_gmock_verbose, GMOCK_FLAG(verbose).c_str()); GMOCK_FLAG(verbose) = old_verbose; // Restores the gmock_verbose flag. } TEST(InitGoogleMockTest, ParsesInvalidCommandLine) { const char* argv[] = { NULL }; const char* new_argv[] = { NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(InitGoogleMockTest, ParsesEmptyCommandLine) { const char* argv[] = { "foo.exe", NULL }; const char* new_argv[] = { "foo.exe", NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(InitGoogleMockTest, ParsesSingleFlag) { const char* argv[] = { "foo.exe", "--gmock_verbose=info", NULL }; const char* new_argv[] = { "foo.exe", NULL }; TestInitGoogleMock(argv, new_argv, "info"); } TEST(InitGoogleMockTest, ParsesUnrecognizedFlag) { const char* argv[] = { "foo.exe", "--non_gmock_flag=blah", NULL }; const char* new_argv[] = { "foo.exe", "--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(InitGoogleMockTest, ParsesGoogleMockFlagAndUnrecognizedFlag) { const char* argv[] = { "foo.exe", "--non_gmock_flag=blah", "--gmock_verbose=error", NULL }; const char* new_argv[] = { "foo.exe", "--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, "error"); } TEST(InitGoogleMockTest, CallsInitGoogleTest) { const int old_init_gtest_count = g_init_gtest_count; const char* argv[] = { "foo.exe", "--non_gmock_flag=blah", "--gmock_verbose=error", NULL }; const char* new_argv[] = { "foo.exe", "--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, "error"); EXPECT_EQ(old_init_gtest_count + 1, g_init_gtest_count); } TEST(WideInitGoogleMockTest, ParsesInvalidCommandLine) { const wchar_t* argv[] = { NULL }; const wchar_t* new_argv[] = { NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(WideInitGoogleMockTest, ParsesEmptyCommandLine) { const wchar_t* argv[] = { L"foo.exe", NULL }; const wchar_t* new_argv[] = { L"foo.exe", NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(WideInitGoogleMockTest, ParsesSingleFlag) { const wchar_t* argv[] = { L"foo.exe", L"--gmock_verbose=info", NULL }; const wchar_t* new_argv[] = { L"foo.exe", NULL }; TestInitGoogleMock(argv, new_argv, "info"); } TEST(WideInitGoogleMockTest, ParsesUnrecognizedFlag) { const wchar_t* argv[] = { L"foo.exe", L"--non_gmock_flag=blah", NULL }; const wchar_t* new_argv[] = { L"foo.exe", L"--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, GMOCK_FLAG(verbose)); } TEST(WideInitGoogleMockTest, ParsesGoogleMockFlagAndUnrecognizedFlag) { const wchar_t* argv[] = { L"foo.exe", L"--non_gmock_flag=blah", L"--gmock_verbose=error", NULL }; const wchar_t* new_argv[] = { L"foo.exe", L"--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, "error"); } TEST(WideInitGoogleMockTest, CallsInitGoogleTest) { const int old_init_gtest_count = g_init_gtest_count; const wchar_t* argv[] = { L"foo.exe", L"--non_gmock_flag=blah", L"--gmock_verbose=error", NULL }; const wchar_t* new_argv[] = { L"foo.exe", L"--non_gmock_flag=blah", NULL }; TestInitGoogleMock(argv, new_argv, "error"); EXPECT_EQ(old_init_gtest_count + 1, g_init_gtest_count); } // Makes sure Google Mock flags can be accessed in code. TEST(FlagTest, IsAccessibleInCode) { bool dummy = testing::GMOCK_FLAG(catch_leaked_mocks) && testing::GMOCK_FLAG(verbose) == ""; (void)dummy; // Avoids the "unused local variable" warning. } synergy-1.4.12-Source/tools/gmock-1.6.0/test/gmock_test_utils.py0000600000175000017500000000677311561126632024337 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test utilities for Google C++ Mocking Framework.""" __author__ = 'wan@google.com (Zhanyong Wan)' import os import sys # Determines path to gtest_test_utils and imports it. SCRIPT_DIR = os.path.dirname(__file__) or '.' # isdir resolves symbolic links. gtest_tests_util_dir = os.path.join(SCRIPT_DIR, '../gtest/test') if os.path.isdir(gtest_tests_util_dir): GTEST_TESTS_UTIL_DIR = gtest_tests_util_dir else: GTEST_TESTS_UTIL_DIR = os.path.join(SCRIPT_DIR, '../../gtest/test') sys.path.append(GTEST_TESTS_UTIL_DIR) import gtest_test_utils # pylint: disable-msg=C6204 def GetSourceDir(): """Returns the absolute path of the directory where the .py files are.""" return gtest_test_utils.GetSourceDir() def GetTestExecutablePath(executable_name): """Returns the absolute path of the test binary given its name. The function will print a message and abort the program if the resulting file doesn't exist. Args: executable_name: name of the test binary that the test script runs. Returns: The absolute path of the test binary. """ return gtest_test_utils.GetTestExecutablePath(executable_name) def GetExitStatus(exit_code): """Returns the argument to exit(), or -1 if exit() wasn't called. Args: exit_code: the result value of os.system(command). """ if os.name == 'nt': # On Windows, os.WEXITSTATUS() doesn't work and os.system() returns # the argument to exit() directly. return exit_code else: # On Unix, os.WEXITSTATUS() must be used to extract the exit status # from the result of os.system(). if os.WIFEXITED(exit_code): return os.WEXITSTATUS(exit_code) else: return -1 # Suppresses the "Invalid const name" lint complaint # pylint: disable-msg=C6409 # Exposes Subprocess from gtest_test_utils. Subprocess = gtest_test_utils.Subprocess # Exposes TestCase from gtest_test_utils. TestCase = gtest_test_utils.TestCase # pylint: enable-msg=C6409 def Main(): """Runs the unit test.""" gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/0000700000175000017500000000000012140644175017437 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/aclocal.m40000600000175000017500000012530011561126632021301 0ustar synergysynergy# generated automatically by aclocal 1.11.1 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.65],, [m4_warning([this file was generated for autoconf 2.65. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.11' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.11.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.11.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 10 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 5 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 16 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The `parallel-tests' driver may need to know about EXEEXT, so add the dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # ------------------------------ # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ---------------------------------- # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PATH_PYTHON([MINIMUM-VERSION], [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND]) # --------------------------------------------------------------------------- # Adds support for distributing Python modules and packages. To # install modules, copy them to $(pythondir), using the python_PYTHON # automake variable. To install a package with the same name as the # automake package, install to $(pkgpythondir), or use the # pkgpython_PYTHON automake variable. # # The variables $(pyexecdir) and $(pkgpyexecdir) are provided as # locations to install python extension modules (shared libraries). # Another macro is required to find the appropriate flags to compile # extension modules. # # If your package is configured with a different prefix to python, # users will have to add the install directory to the PYTHONPATH # environment variable, or create a .pth file (see the python # documentation for details). # # If the MINIMUM-VERSION argument is passed, AM_PATH_PYTHON will # cause an error if the version of python installed on the system # doesn't meet the requirement. MINIMUM-VERSION should consist of # numbers and dots only. AC_DEFUN([AM_PATH_PYTHON], [ dnl Find a Python interpreter. Python versions prior to 2.0 are not dnl supported. (2.0 was released on October 16, 2000). m4_define_default([_AM_PYTHON_INTERPRETER_LIST], [python python2 python3 python3.0 python2.5 python2.4 python2.3 python2.2 dnl python2.1 python2.0]) m4_if([$1],[],[ dnl No version check is needed. # Find any Python interpreter. if test -z "$PYTHON"; then AC_PATH_PROGS([PYTHON], _AM_PYTHON_INTERPRETER_LIST, :) fi am_display_PYTHON=python ], [ dnl A version check is needed. if test -n "$PYTHON"; then # If the user set $PYTHON, use it and don't search something else. AC_MSG_CHECKING([whether $PYTHON version >= $1]) AM_PYTHON_CHECK_VERSION([$PYTHON], [$1], [AC_MSG_RESULT(yes)], [AC_MSG_ERROR(too old)]) am_display_PYTHON=$PYTHON else # Otherwise, try each interpreter until we find one that satisfies # VERSION. AC_CACHE_CHECK([for a Python interpreter with version >= $1], [am_cv_pathless_PYTHON],[ for am_cv_pathless_PYTHON in _AM_PYTHON_INTERPRETER_LIST none; do test "$am_cv_pathless_PYTHON" = none && break AM_PYTHON_CHECK_VERSION([$am_cv_pathless_PYTHON], [$1], [break]) done]) # Set $PYTHON to the absolute path of $am_cv_pathless_PYTHON. if test "$am_cv_pathless_PYTHON" = none; then PYTHON=: else AC_PATH_PROG([PYTHON], [$am_cv_pathless_PYTHON]) fi am_display_PYTHON=$am_cv_pathless_PYTHON fi ]) if test "$PYTHON" = :; then dnl Run any user-specified action, or abort. m4_default([$3], [AC_MSG_ERROR([no suitable Python interpreter found])]) else dnl Query Python for its version number. Getting [:3] seems to be dnl the best way to do this; it's what "site.py" does in the standard dnl library. AC_CACHE_CHECK([for $am_display_PYTHON version], [am_cv_python_version], [am_cv_python_version=`$PYTHON -c "import sys; sys.stdout.write(sys.version[[:3]])"`]) AC_SUBST([PYTHON_VERSION], [$am_cv_python_version]) dnl Use the values of $prefix and $exec_prefix for the corresponding dnl values of PYTHON_PREFIX and PYTHON_EXEC_PREFIX. These are made dnl distinct variables so they can be overridden if need be. However, dnl general consensus is that you shouldn't need this ability. AC_SUBST([PYTHON_PREFIX], ['${prefix}']) AC_SUBST([PYTHON_EXEC_PREFIX], ['${exec_prefix}']) dnl At times (like when building shared libraries) you may want dnl to know which OS platform Python thinks this is. AC_CACHE_CHECK([for $am_display_PYTHON platform], [am_cv_python_platform], [am_cv_python_platform=`$PYTHON -c "import sys; sys.stdout.write(sys.platform)"`]) AC_SUBST([PYTHON_PLATFORM], [$am_cv_python_platform]) dnl Set up 4 directories: dnl pythondir -- where to install python scripts. This is the dnl site-packages directory, not the python standard library dnl directory like in previous automake betas. This behavior dnl is more consistent with lispdir.m4 for example. dnl Query distutils for this directory. distutils does not exist in dnl Python 1.5, so we fall back to the hardcoded directory if it dnl doesn't work. AC_CACHE_CHECK([for $am_display_PYTHON script directory], [am_cv_python_pythondir], [if test "x$prefix" = xNONE then am_py_prefix=$ac_default_prefix else am_py_prefix=$prefix fi am_cv_python_pythondir=`$PYTHON -c "import sys; from distutils import sysconfig; sys.stdout.write(sysconfig.get_python_lib(0,0,prefix='$am_py_prefix'))" 2>/dev/null || echo "$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages"` case $am_cv_python_pythondir in $am_py_prefix*) am__strip_prefix=`echo "$am_py_prefix" | sed 's|.|.|g'` am_cv_python_pythondir=`echo "$am_cv_python_pythondir" | sed "s,^$am__strip_prefix,$PYTHON_PREFIX,"` ;; *) case $am_py_prefix in /usr|/System*) ;; *) am_cv_python_pythondir=$PYTHON_PREFIX/lib/python$PYTHON_VERSION/site-packages ;; esac ;; esac ]) AC_SUBST([pythondir], [$am_cv_python_pythondir]) dnl pkgpythondir -- $PACKAGE directory under pythondir. Was dnl PYTHON_SITE_PACKAGE in previous betas, but this naming is dnl more consistent with the rest of automake. AC_SUBST([pkgpythondir], [\${pythondir}/$PACKAGE]) dnl pyexecdir -- directory for installing python extension modules dnl (shared libraries) dnl Query distutils for this directory. distutils does not exist in dnl Python 1.5, so we fall back to the hardcoded directory if it dnl doesn't work. AC_CACHE_CHECK([for $am_display_PYTHON extension module directory], [am_cv_python_pyexecdir], [if test "x$exec_prefix" = xNONE then am_py_exec_prefix=$am_py_prefix else am_py_exec_prefix=$exec_prefix fi am_cv_python_pyexecdir=`$PYTHON -c "import sys; from distutils import sysconfig; sys.stdout.write(sysconfig.get_python_lib(1,0,prefix='$am_py_exec_prefix'))" 2>/dev/null || echo "$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages"` case $am_cv_python_pyexecdir in $am_py_exec_prefix*) am__strip_prefix=`echo "$am_py_exec_prefix" | sed 's|.|.|g'` am_cv_python_pyexecdir=`echo "$am_cv_python_pyexecdir" | sed "s,^$am__strip_prefix,$PYTHON_EXEC_PREFIX,"` ;; *) case $am_py_exec_prefix in /usr|/System*) ;; *) am_cv_python_pyexecdir=$PYTHON_EXEC_PREFIX/lib/python$PYTHON_VERSION/site-packages ;; esac ;; esac ]) AC_SUBST([pyexecdir], [$am_cv_python_pyexecdir]) dnl pkgpyexecdir -- $(pyexecdir)/$(PACKAGE) AC_SUBST([pkgpyexecdir], [\${pyexecdir}/$PACKAGE]) dnl Run any user-specified action. $2 fi ]) # AM_PYTHON_CHECK_VERSION(PROG, VERSION, [ACTION-IF-TRUE], [ACTION-IF-FALSE]) # --------------------------------------------------------------------------- # Run ACTION-IF-TRUE if the Python interpreter PROG has version >= VERSION. # Run ACTION-IF-FALSE otherwise. # This test uses sys.hexversion instead of the string equivalent (first # word of sys.version), in order to cope with versions such as 2.2c1. # This supports Python 2.0 or higher. (2.0 was released on October 16, 2000). AC_DEFUN([AM_PYTHON_CHECK_VERSION], [prog="import sys # split strings by '.' and convert to numeric. Append some zeros # because we need at least 4 digits for the hex conversion. # map returns an iterator in Python 3.0 and a list in 2.x minver = list(map(int, '$2'.split('.'))) + [[0, 0, 0]] minverhex = 0 # xrange is not present in Python 3.0 and range returns an iterator for i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[[i]] sys.exit(sys.hexversion < minverhex)" AS_IF([AM_RUN_LOG([$1 -c "$prog"])], [$3], [$4])]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. AM_MISSING_PROG([AMTAR], [tar]) m4_if([$1], [v7], [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4]) synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/0000700000175000017500000000000012140644175021331 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/config.guess0000600000175000017500000013105411561126632023653 0ustar synergysynergy#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 # Free Software Foundation, Inc. timestamp='2009-06-10' # This file 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. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm:riscos:*:*|arm:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[456]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) case ${UNAME_MACHINE} in pc98) echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:[3456]*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; EM64T | authenticamd | genuineintel) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-gnu else echo ${UNAME_MACHINE}-unknown-linux-gnueabi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit ;; crisv32:Linux:*:*) echo crisv32-axis-linux-gnu exit ;; frv:Linux:*:*) echo frv-unknown-linux-gnu exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; or32:Linux:*:*) echo or32-unknown-linux-gnu exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-gnu exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-gnu exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-gnu exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-gnu exit ;; x86_64:Linux:*:*) echo x86_64-unknown-linux-gnu exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) LIBC=gnu #else LIBC=gnuaout #endif #endif #ifdef __dietlibc__ LIBC=dietlibc #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^LIBC/{ s: ::g p }'`" test x"${LIBC}" != x && { echo "${UNAME_MACHINE}-pc-linux-${LIBC}" exit } test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NSE-?:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/config.h.in0000600000175000017500000000346111561126632023361 0ustar synergysynergy/* build-aux/config.h.in. Generated from configure.ac by autoheader. */ /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define if you have POSIX threads libraries and header files. */ #undef HAVE_PTHREAD /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to the sub-directory in which libtool stores uninstalled libraries. */ #undef LT_OBJDIR /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define to necessary symbol if this constant uses a non-standard name on your system. */ #undef PTHREAD_CREATE_JOINABLE /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Version number of package */ #undef VERSION synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/config.sub0000600000175000017500000010242511561126632023316 0ustar synergysynergy#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 # Free Software Foundation, Inc. timestamp='2009-06-11' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file 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. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nios | nios2 \ | ns16k | ns32k \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* | tile-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; mvs) basic_machine=i370-ibm os=-mvs ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tile*) basic_machine=tile-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -kopensolaris* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -kaos*) os=-kaos ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/depcomp0000600000175000017500000004426711561126632022721 0ustar synergysynergy#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2009-04-28.21; # UTC # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009 Free # Software Foundation, Inc. # 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, 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 . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u="sed s,\\\\\\\\,/,g" depmode=msvisualcpp fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/install-sh0000600000175000017500000003253711561126632023345 0ustar synergysynergy#!/bin/sh # install - install a program, script, or datafile scriptversion=2009-04-28.21; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # 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 # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call `install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then trap '(exit $?); exit' 1 2 13 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names starting with `-'. case $src in -*) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # Protect names starting with `-'. case $dst in -*) dst=./$dst;; esac # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writeable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; -*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test -z "$d" && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/ltmain.sh0000600000175000017500000073341511561126632023167 0ustar synergysynergy# Generated from ltmain.m4sh. # ltmain.sh (GNU libtool) 2.2.6b # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007 2008 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, # or obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --config show all configuration variables # --debug enable verbose shell tracing # -n, --dry-run display commands without modifying any files # --features display basic configuration information and exit # --mode=MODE use operation mode MODE # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print informational messages (default) # --version print version information # -h, --help print short or long help message # # MODE must be one of the following: # # clean remove files from the build directory # compile compile a source file into a libtool object # execute automatically set library path, then run a program # finish complete the installation of libtool libraries # install install libraries or executables # link create a library or an executable # uninstall remove libraries from an installed directory # # MODE-ARGS vary depending on the MODE. # Try `$progname --help --mode=MODE' for a more detailed description of MODE. # # When reporting a bug, please describe a test case to reproduce it and # include the following information: # # host-triplet: $host # shell: $SHELL # compiler: $LTCC # compiler flags: $LTCFLAGS # linker: $LD (gnu? $with_gnu_ld) # $progname: (GNU libtool) 2.2.6b Debian-2.2.6b-2ubuntu1 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . PROGRAM=ltmain.sh PACKAGE=libtool VERSION="2.2.6b Debian-2.2.6b-2ubuntu1" TIMESTAMP="" package_revision=1.3017 # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # NLS nuisances: We save the old values to restore during execute mode. # Only set LANG and LC_ALL to C if already set. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done $lt_unset CDPATH : ${CP="cp -f"} : ${ECHO="echo"} : ${EGREP="/bin/grep -E"} : ${FGREP="/bin/grep -F"} : ${GREP="/bin/grep"} : ${LN_S="ln -s"} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SED="/bin/sed"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # Generated shell functions inserted here. # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" # The name of this program: # In the unlikely event $progname began with a '-', it would play havoc with # func_echo (imagine progname=-n), so we prepend ./ in that case: func_dirname_and_basename "$progpath" progname=$func_basename_result case $progname in -*) progname=./$progname ;; esac # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=: for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to double_quote_subst, that '$' was protected from expansion. # Since each input `\' is now two `\'s, look for any number of runs of # four `\'s followed by two `\'s and then a '$'. `\' that '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname${mode+: }$mode: $*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname${mode+: }$mode: "${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname${mode+: }$mode: warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "X$my_directory_path" | $Xsed -e "$dirname"` done my_dir_list=`$ECHO "X$my_dir_list" | $Xsed -e 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_mkdir_p_IFS" # mkdir can fail with a `File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "X$my_tmpdir" | $Xsed } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "X$1" | $Xsed -e "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # func_quote_for_expand arg # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "X$1" | $Xsed \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_version # Echo version message to standard output and exit. func_version () { $SED -n '/^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $SED -n '/^# Usage:/,/# -h/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" $ECHO $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help # Echo long help message to standard output and exit. func_help () { $SED -n '/^# Usage:/,/# Report bugs to/ { s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(automake --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(autoconf --version) 2>/dev/null |$SED 1q`"'/ p }' < "$progpath" exit $? } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { func_error "missing argument for $1" exit_cmd=exit } exit_cmd=: # Check that we have a working $ECHO. if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t'; then # Yippee, $ECHO works! : else # Restart under the correct shell, and then maybe $ECHO will work. exec $SHELL "$progpath" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat </dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # Parse options once, thoroughly. This comes as soon as possible in # the script to make things like `libtool --version' happen quickly. { # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Parse non-mode specific arguments: while test "$#" -gt 0; do opt="$1" shift case $opt in --config) func_config ;; --debug) preserve_args="$preserve_args $opt" func_echo "enabling shell trace mode" opt_debug='set -x' $opt_debug ;; -dlopen) test "$#" -eq 0 && func_missing_arg "$opt" && break execute_dlfiles="$execute_dlfiles $1" shift ;; --dry-run | -n) opt_dry_run=: ;; --features) func_features ;; --finish) mode="finish" ;; --mode) test "$#" -eq 0 && func_missing_arg "$opt" && break case $1 in # Valid mode arguments: clean) ;; compile) ;; execute) ;; finish) ;; install) ;; link) ;; relink) ;; uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac mode="$1" shift ;; --preserve-dup-deps) opt_duplicate_deps=: ;; --quiet|--silent) preserve_args="$preserve_args $opt" opt_silent=: ;; --verbose| -v) preserve_args="$preserve_args $opt" opt_silent=false ;; --tag) test "$#" -eq 0 && func_missing_arg "$opt" && break preserve_args="$preserve_args $opt $1" func_enable_tag "$1" # tagname is set here shift ;; # Separate optargs to long options: -dlopen=*|--mode=*|--tag=*) func_opt_split "$opt" set dummy "$func_opt_split_opt" "$func_opt_split_arg" ${1+"$@"} shift ;; -\?|-h) func_usage ;; --help) opt_help=: ;; --version) func_version ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) nonopt="$opt" break ;; esac done case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_duplicate_deps ;; esac # Having warned about all mis-specified options, bail out if # anything was wrong. $exit_cmd $EXIT_FAILURE } # func_check_version_match # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } ## ----------- ## ## Main. ## ## ----------- ## $opt_help || { # Sanity checks first: func_check_version_match if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi test -z "$mode" && func_fatal_error "error: you must specify a MODE." # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$execute_dlfiles" && test "$mode" != execute; then func_error "unrecognized option \`-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$progname --help --mode=$mode' for more information." } # func_lalib_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if `file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case "$lalib_p_line" in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test "$lalib_p" = yes } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_ltwrapper_scriptname_result="" if func_ltwrapper_executable_p "$1"; then func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper" fi } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. func_source () { $opt_debug case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $opt_debug if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case "$@ " in " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with \`--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=${1} if test "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; then write_oldobj=\'${3}\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T <?"'"'"' &()|`$[]' \ && func_warning "libobj name \`$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname="$func_basename_result" xdir="$func_dirname_result" lobj=${xdir}$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$ECHO "X$srcfile" | $Xsed -e 's%^.*/%%' -e 's%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi removelist="$removelist $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist removelist="$removelist $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 if test -n "$fix_srcfile_path"; then eval srcfile=\"$fix_srcfile_path\" fi func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir command="$command -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; then command="$command -o $obj" fi # Suppress compiler output if we already did a PIC compilation. command="$command$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$mode" = compile && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to building PIC objects only -prefer-non-pic try to building non-PIC objects only -shared do not build a \`.o' file suitable for static linking -static only build a \`.o' file suitable for static linking COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode \`$mode'" ;; esac $ECHO $ECHO "Try \`$progname --help' for more information about other modes." exit $? } # Now that we've collected a possible --mode arg, show help if necessary $opt_help && func_mode_help # func_mode_execute arg... func_mode_execute () { $opt_debug # The first argument is the command name. cmd="$nonopt" test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $execute_dlfiles; do test -f "$file" \ || func_fatal_help "\`$file' is not a file" dir= case $file in *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "\`$file' was not linked with \`-export-dynamic'" continue fi func_dirname "$file" "" "." dir="$func_dirname_result" if test -f "$dir/$objdir/$dlname"; then dir="$dir/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir="$func_dirname_result" ;; *) func_warning "\`-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -*) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file="$progdir/$program" elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). func_quote_for_eval "$file" args="$args $func_quote_for_eval_result" done if test "X$opt_dry_run" = Xfalse; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" $ECHO "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS fi } test "$mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug libdirs="$nonopt" admincmds= if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for dir do libdirs="$libdirs $dir" done for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || admincmds="$admincmds $cmds" fi done fi # Exit here if they wanted silent mode. $opt_silent && exit $EXIT_SUCCESS $ECHO "X----------------------------------------------------------------------" | $Xsed $ECHO "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done $ECHO $ECHO "If you ever happen to want to link against installed libraries" $ECHO "in a given directory, LIBDIR, you must either use libtool, and" $ECHO "specify the full pathname of the library, or use the \`-LLIBDIR'" $ECHO "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then $ECHO " - add LIBDIR to the \`$shlibpath_var' environment variable" $ECHO " during execution" fi if test -n "$runpath_var"; then $ECHO " - add LIBDIR to the \`$runpath_var' environment variable" $ECHO " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then $ECHO " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi $ECHO $ECHO "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) $ECHO "more information, such as the ld(1), crle(1) and ld.so(8) manual" $ECHO "pages." ;; *) $ECHO "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac $ECHO "X----------------------------------------------------------------------" | $Xsed exit $EXIT_SUCCESS } test "$mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. $ECHO "X$nonopt" | $GREP shtool >/dev/null; then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" install_prog="$install_prog$func_quote_for_eval_result" # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= for arg do if test -n "$dest"; then files="$files $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) case " $install_prog " in *[\\\ /]cp\ *) ;; *) prev=$arg ;; esac ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" install_prog="$install_prog $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the \`$prev' option requires an argument" if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else func_dirname_and_basename "$dest" "" "." destdir="$func_dirname_result" destname="$func_basename_result" # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "\`$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "\`$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. staticlibs="$staticlibs $file" ;; *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) current_libdirs="$current_libdirs $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) future_libdirs="$future_libdirs $libdir" ;; esac fi func_dirname "$file" "/" "" dir="$func_dirname_result" dir="$dir$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "X$destdir" | $Xsed -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%%"` fi func_warning "relinking \`$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname="$1" shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. func_show_eval "$install_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme="$stripme" case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme="" ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib="$destdir/$realname" func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name="$func_basename_result" instname="$dir/$name"i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest="$destfile" destfile= ;; *) func_fatal_help "cannot copy a libtool object to \`$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script \`$wrapper'" finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile="$libdir/"`$ECHO "X$lib" | $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file="$func_basename_result" outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$ECHO "X$relink_command" | $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'` $opt_silent || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink \`$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file="$outputname" else func_warning "cannot relink \`$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "X$file$stripped_ext" | $Xsed -e "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name="$func_basename_result" # Set up the ranlib parameters. oldlib="$destdir/$name" func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run \`$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test "$mode" = install && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms="${my_outputname}S.c" else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${my_outputname}.nm" func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then func_verbose "generating symbol list for \`$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "X$objs$old_deplibs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` for progfile in $progfiles; do func_verbose "extracting global C symbols from \`$progfile'" $opt_dry_run || eval "$NM $progfile | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $opt_dry_run || { $RM $export_symbols eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from \`$dlprefile'" func_basename "$dlprefile" name="$func_basename_result" $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' eval "$NM $dlprefile 2>/dev/null | $global_symbol_pipe >> '$nlist'" } done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else $ECHO '/* NONE */' >> "$output_objdir/$my_dlsyms" fi $ECHO >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; " case $host in *cygwin* | *mingw* | *cegcc* ) $ECHO >> "$output_objdir/$my_dlsyms" "\ /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */" lt_dlsym_const= ;; *osf5*) echo >> "$output_objdir/$my_dlsyms" "\ /* This system does not cope well with relocations in const data */" lt_dlsym_const= ;; *) lt_dlsym_const=const ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ extern $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[]; $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) symtab_cflags="$symtab_cflags $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"' # Transform the symbol file into the correct name. symfileobj="$output_objdir/${my_outputname}S.$objext" case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for \`$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "X$compile_command" | $Xsed -e "s% @SYMFILE@%%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s% @SYMFILE@%%"` fi } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. func_win32_libid () { $opt_debug win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then win32_nmres=`eval $NM -f posix -A $1 | $SED -n -e ' 1,100{ / I /{ s,.*,import, p q } }'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_extract_an_archive dir oldlib func_extract_an_archive () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" 'exit $?' if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $opt_debug my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib="$func_basename_result" my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir="$my_gentop/$my_xlib_u" func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`basename "$darwin_archive"` darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}" $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # func_emit_wrapper_part1 [arg=no] # # Emit the first part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part1 () { func_emit_wrapper_part1_arg1=no if test -n "$1" ; then func_emit_wrapper_part1_arg1=$1 fi $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='${SED} -e 1s/^X//' sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then ECHO=\"$qecho\" file=\"\$0\" # Make sure echo works. if test \"X\$1\" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test \"X\`{ \$ECHO '\t'; } 2>/dev/null\`\" = 'X\t'; then # Yippee, \$ECHO works! : else # Restart under the correct shell, and then maybe \$ECHO will work. exec $SHELL \"\$0\" --no-reexec \${1+\"\$@\"} fi fi\ " $ECHO "\ # Find the directory that this script lives in. thisdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | ${SED} -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"X\$file\" | \$Xsed -e 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | ${SED} -n 's/.*-> //p'\` done " } # end: func_emit_wrapper_part1 # func_emit_wrapper_part2 [arg=no] # # Emit the second part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part2 () { func_emit_wrapper_part2_arg1=no if test -n "$1" ; then func_emit_wrapper_part2_arg1=$1 fi $ECHO "\ # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_part2_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"X\$thisdir\" | \$Xsed -e 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"X\$$shlibpath_var\" | \$Xsed -e 's/::*\$//'\` export $shlibpath_var " fi # fixup the dll searchpath if we need to. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 fi else # The program doesn't exist. \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 $ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # end: func_emit_wrapper_part2 # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory in which it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=no if test -n "$1" ; then func_emit_wrapper_arg1=$1 fi # split this up so that func_emit_cwrapperexe_src # can call each part independently. func_emit_wrapper_part1 "${func_emit_wrapper_arg1}" func_emit_wrapper_part2 "${func_emit_wrapper_arg1}" } # func_to_host_path arg # # Convert paths to host format when used with build tools. # Intended for use with "native" mingw (where libtool itself # is running under the msys shell), or in the following cross- # build environments: # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # where wine is equipped with the `winepath' executable. # In the native mingw case, the (msys) shell automatically # converts paths for any non-msys applications it launches, # but that facility isn't available from inside the cwrapper. # Similar accommodations are necessary for $host mingw and # $build cygwin. Calling this function does no harm for other # $host/$build combinations not listed above. # # ARG is the path (on $build) that should be converted to # the proper representation for $host. The result is stored # in $func_to_host_path_result. func_to_host_path () { func_to_host_path_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' case $build in *mingw* ) # actually, msys # awkward: cmd appends spaces to result lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_path_tmp1=`( cmd //c echo "$1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_path_tmp1=`cygpath -w "$1"` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # Unfortunately, winepath does not exit with a non-zero # error code, so we are forced to check the contents of # stdout. On the other hand, if the command is not # found, the shell will set an exit code of 127 and print # *an error message* to stdout. So we must check for both # error code of zero AND non-empty stdout, which explains # the odd construction: func_to_host_path_tmp1=`winepath -w "$1" 2>/dev/null` if test "$?" -eq 0 && test -n "${func_to_host_path_tmp1}"; then func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` else # Allow warning below. func_to_host_path_result="" fi ;; esac if test -z "$func_to_host_path_result" ; then func_error "Could not determine host path corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_path_result="$1" fi ;; esac fi } # end: func_to_host_path # func_to_host_pathlist arg # # Convert pathlists to host format when used with build tools. # See func_to_host_path(), above. This function supports the # following $build/$host combinations (but does no harm for # combinations not listed here): # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # # Path separators are also converted from $build format to # $host format. If ARG begins or ends with a path separator # character, it is preserved (but converted to $host format) # on output. # # ARG is a pathlist (on $build) that should be converted to # the proper representation on $host. The result is stored # in $func_to_host_pathlist_result. func_to_host_pathlist () { func_to_host_pathlist_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_to_host_pathlist_tmp2="$1" # Once set for this call, this variable should not be # reassigned. It is used in tha fallback case. func_to_host_pathlist_tmp1=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e 's|^:*||' -e 's|:*$||'` case $build in *mingw* ) # Actually, msys. # Awkward: cmd appends spaces to result. lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_pathlist_tmp2=`( cmd //c echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_pathlist_tmp2=`cygpath -w -p "$func_to_host_pathlist_tmp1"` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # unfortunately, winepath doesn't convert pathlists func_to_host_pathlist_result="" func_to_host_pathlist_oldIFS=$IFS IFS=: for func_to_host_pathlist_f in $func_to_host_pathlist_tmp1 ; do IFS=$func_to_host_pathlist_oldIFS if test -n "$func_to_host_pathlist_f" ; then func_to_host_path "$func_to_host_pathlist_f" if test -n "$func_to_host_path_result" ; then if test -z "$func_to_host_pathlist_result" ; then func_to_host_pathlist_result="$func_to_host_path_result" else func_to_host_pathlist_result="$func_to_host_pathlist_result;$func_to_host_path_result" fi fi fi IFS=: done IFS=$func_to_host_pathlist_oldIFS ;; esac if test -z "$func_to_host_pathlist_result" ; then func_error "Could not determine the host path(s) corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This may break if $1 contains DOS-style drive # specifications. The fix is not to complicate the expression # below, but for the user to provide a working wine installation # with winepath so that path translation in the cross-to-mingw # case works properly. lt_replace_pathsep_nix_to_dos="s|:|;|g" func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_replace_pathsep_nix_to_dos"` fi # Now, add the leading and trailing path separators back case "$1" in :* ) func_to_host_pathlist_result=";$func_to_host_pathlist_result" ;; esac case "$1" in *: ) func_to_host_pathlist_result="$func_to_host_pathlist_result;" ;; esac ;; esac fi } # end: func_to_host_pathlist # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include # define setmode _setmode #else # include # include # ifdef __CYGWIN__ # include # define HAVE_SETENV # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif # endif #endif #include #include #include #include #include #include #include #include #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif #ifdef _MSC_VER # define S_IXUSR _S_IEXEC # define stat _stat # ifndef _INTPTR_T_DEFINED # define intptr_t int # endif #endif #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifdef __CYGWIN__ # define FOPEN_WB "wb" #endif #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) #undef LTWRAPPER_DEBUGPRINTF #if defined DEBUGWRAPPER # define LTWRAPPER_DEBUGPRINTF(args) ltwrapper_debugprintf args static void ltwrapper_debugprintf (const char *fmt, ...) { va_list args; va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } #else # define LTWRAPPER_DEBUGPRINTF(args) #endif const char *program_name = NULL; void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_fatal (const char *message, ...); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_opt_process_env_set (const char *arg); void lt_opt_process_env_prepend (const char *arg); void lt_opt_process_env_append (const char *arg); int lt_split_name_value (const char *arg, char** name, char** value); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); static const char *script_text_part1 = EOF func_emit_wrapper_part1 yes | $SED -e 's/\([\\"]\)/\\\1/g' \ -e 's/^/ "/' -e 's/$/\\n"/' echo ";" cat <"))); for (i = 0; i < newargc; i++) { LTWRAPPER_DEBUGPRINTF (("(main) newargz[%d] : %s\n", i, (newargz[i] ? newargz[i] : ""))); } EOF case $host_os in mingw*) cat <<"EOF" /* execv doesn't actually work on mingw as expected on unix */ rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz); if (rval == -1) { /* failed to start process */ LTWRAPPER_DEBUGPRINTF (("(main) failed to launch target \"%s\": errno = %d\n", lt_argv_zero, errno)); return 127; } return rval; EOF ;; *) cat <<"EOF" execv (lt_argv_zero, newargz); return rval; /* =127, but avoids unused variable warning */ EOF ;; esac cat <<"EOF" } void * xmalloc (size_t num) { void *p = (void *) malloc (num); if (!p) lt_fatal ("Memory exhausted"); return p; } char * xstrdup (const char *string) { return string ? strcpy ((char *) xmalloc (strlen (string) + 1), string) : NULL; } const char * base_name (const char *name) { const char *base; #if defined (HAVE_DOS_BASED_FILE_SYSTEM) /* Skip over the disk name in MSDOS pathnames. */ if (isalpha ((unsigned char) name[0]) && name[1] == ':') name += 2; #endif for (base = name; *name; name++) if (IS_DIR_SEPARATOR (*name)) base = name + 1; return base; } int check_executable (const char *path) { struct stat st; LTWRAPPER_DEBUGPRINTF (("(check_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if ((stat (path, &st) >= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; LTWRAPPER_DEBUGPRINTF (("(make_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char *concat_name; LTWRAPPER_DEBUGPRINTF (("(find_executable) : %s\n", wrapper ? (*wrapper ? wrapper : "EMPTY!") : "NULL!")); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { LTWRAPPER_DEBUGPRINTF (("checking path component for symlinks: %s\n", tmp_pathspec)); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { char *errstr = strerror (errno); lt_fatal ("Error accessing file %s (%s)", tmp_pathspec, errstr); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal ("Could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (strcmp (str, pat) == 0) *str = '\0'; } return str; } static void lt_error_core (int exit_status, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s: %s: ", program_name, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, "FATAL", message, ap); va_end (ap); } void lt_setenv (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_setenv) setting '%s' to '%s'\n", (name ? name : ""), (value ? value : ""))); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else int len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { int orig_value_len = strlen (orig_value); int add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } int lt_split_name_value (const char *arg, char** name, char** value) { const char *p; int len; if (!arg || !*arg) return 1; p = strchr (arg, (int)'='); if (!p) return 1; *value = xstrdup (++p); len = strlen (arg) - strlen (*value); *name = XMALLOC (char, len); strncpy (*name, arg, len-1); (*name)[len - 1] = '\0'; return 0; } void lt_opt_process_env_set (const char *arg) { char *name = NULL; char *value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_set_opt, arg); } lt_setenv (name, value); XFREE (name); XFREE (value); } void lt_opt_process_env_prepend (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_prepend_opt, arg); } new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_opt_process_env_append (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_append_opt, arg); } new_value = lt_extend_str (getenv (name), value, 1); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_update_exe_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_exe_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_lib_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF } # end: func_emit_cwrapperexe_src # func_mode_link arg... func_mode_link () { $opt_debug case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # which system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll which has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=no prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module="${wl}-single_module" func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then dlfiles="$dlfiles $arg" else dlprefiles="$dlprefiles $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" test -f "$arg" \ || func_fatal_error "symbol file \`$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) deplibs="$deplibs $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # moreargs="$moreargs $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file \`$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) rpath="$rpath $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) xrpath="$xrpath $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds="$arg" prev= continue ;; weak) weak_libs="$weak_libs $arg" prev= continue ;; xcclinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "\`-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname '-L' '' "$arg" dir=$func_stripname_result if test -z "$dir"; then if test "$#" -gt 0; then func_fatal_error "require no space between \`-L' and \`$1'" else func_fatal_error "need path for \`-L' option" fi fi # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of \`$dir'" dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "*) ;; *) deplibs="$deplibs -L$dir" lib_search_path="$lib_search_path $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "X$dir" | $Xsed -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) dllsearchpath="$dllsearchpath:$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework deplibs="$deplibs System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi deplibs="$deplibs $arg" continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $arg" ;; esac continue ;; -multi_module) single_module="${wl}-multi_module" continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "\`-no-install' is ignored for $host" func_warning "assuming \`-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $wl$func_quote_for_eval_result" linker_flags="$linker_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; # -64, -mips[0-9] enable 64-bit mode on the SGI compiler # -r[0-9][0-9]* specifies the processor on the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode on the Sun compiler # +DA*, +DD* enable 64-bit mode on the HP compiler # -q* pass through compiler args for the IBM compiler # -m*, -t[45]*, -txscale* pass through architecture-specific # compiler args for GCC # -F/path gives path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* pass through profiling flag for GCC # @file GCC response files -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" func_append compile_command " $arg" func_append finalize_command " $arg" compiler_flags="$compiler_flags $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; *.$objext) # A standard object. objs="$objs $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. deplibs="$deplibs $arg" old_deplibs="$old_deplibs $arg" continue ;; *.la) # A libtool-controlled library. if test "$prev" = dlfiles; then # This library was specified with -dlopen. dlfiles="$dlfiles $arg" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. dlprefiles="$dlprefiles $arg" prev= else deplibs="$deplibs $arg" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the \`$prevarg' option requires an argument" if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname="$func_basename_result" libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"X\${$shlibpath_var}\" \| \$Xsed -e \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir="$func_dirname_result$objdir" # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_duplicate_deps ; then case "$libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi libs="$libs $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) specialdeplibs="$specialdeplibs $pre_post_deps" ;; esac pre_post_deps="$pre_post_deps $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test "$linkmode,$pass" = "lib,link"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs="$tmp_deplibs" fi if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= case $lib in *.la) func_source "$lib" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do deplib_base=`$ECHO "X$deplib" | $Xsed -e "$basename"` case " $weak_libs " in *" $deplib_base "*) ;; *) deplibs="$deplibs $deplib" ;; esac done done libs="$dlprefiles" fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else compiler_flags="$compiler_flags $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; *) func_warning "\`-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then func_stripname '-R' '' "$deplib" dir=$func_stripname_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) lib="$deplib" ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"X$deplib\"" 2>/dev/null | $Xsed -e 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then $ECHO $ECHO "*** Warning: Trying to link with static lib archive $deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because the file extensions .$libext of this argument makes me believe" $ECHO "*** that it is just a static archive that I should not use here." else $ECHO $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. newdlprefiles="$newdlprefiles $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else newdlfiles="$newdlfiles $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "\`$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir="$func_dirname_result" dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "X$inherited_linker_flags" | $Xsed -e 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) new_inherited_linker_flags="$new_inherited_linker_flags $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO "X $dependency_libs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && dlfiles="$dlfiles $dlopen" test -n "$dlpreopen" && dlprefiles="$dlprefiles $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # It is a libtool convenience library, so add in its objects. convenience="$convenience $ladir/$objdir/$old_library" old_convenience="$old_convenience $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= for l in $old_library $library_names; do linklib="$l" done if test -z "$linklib"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. dlprefiles="$dlprefiles $lib $dependency_libs" else newdlfiles="$newdlfiles $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of \`$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir="$ladir" fi ;; esac func_basename "$lib" laname="$func_basename_result" # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library \`$lib' was moved." dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$libdir" absdir="$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; then func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'" fi # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then newdlprefiles="$newdlprefiles $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ dlpreconveniencelibs="$dlpreconveniencelibs $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then newdlprefiles="$newdlprefiles $dir/$dlname" else newdlprefiles="$newdlprefiles $dir/$linklib" fi fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then newlib_search_path="$newlib_search_path $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath:" in *"$absdir:"*) ;; *) temp_rpath="$temp_rpath$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded notinst_deplibs="$notinst_deplibs $lib" need_relink=no ;; *) if test "$installed" = no; then notinst_deplibs="$notinst_deplibs $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule="" for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule="$dlpremoduletest" break fi done if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then $ECHO if test "$linkmode" = prog; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname="$1" shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" func_basename "$soroot" soname="$func_basename_result" func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from \`$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for \`$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we can not # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null ; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library" ; then $ECHO $ECHO "*** And there doesn't seem to be a static archive available" $ECHO "*** The link will probably fail, sorry" else add="$dir/$old_library" fi elif test -n "$old_library"; then add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$dir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) compile_shlibpath="$compile_shlibpath$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. $ECHO $ECHO "*** Warning: This system can not link to static lib archive $lib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then $ECHO "*** But as you try to build a module library, libtool will still create " $ECHO "*** a static module, that should work as long as the dlopening application" $ECHO "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) xrpath="$xrpath $temp_xrpath";; esac;; *) temp_deplibs="$temp_deplibs $libdir";; esac done dependency_libs="$temp_deplibs" fi newlib_search_path="$newlib_search_path $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path="$deplib" ;; *.la) func_dirname "$deplib" "" "." dir="$func_dirname_result" # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of \`$dir'" absdir="$dir" fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl" ; then depdepl="$absdir/$objdir/$depdepl" darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`${OTOOL64} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi compiler_flags="$compiler_flags ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}" linker_flags="$linker_flags -dylib_file ${darwin_install_name}:${depdepl}" path= fi fi ;; *) path="-L$absdir/$objdir" ;; esac else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "\`$deplib' seems to be moved" path="-L$absdir" fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test "$pass" = link; then if test "$linkmode" = "prog"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) lib_search_path="$lib_search_path $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) tmp_libs="$tmp_libs $deplib" ;; esac ;; *) tmp_libs="$tmp_libs $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then tmp_libs="$tmp_libs $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "\`-R' is ignored for archives" test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "\`-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "\`-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" objs="$objs$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs" else $ECHO $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" libobjs="$libobjs $objs" fi fi test "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "\`-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 shift IFS="$save_ifs" test -n "$7" && \ func_fatal_help "too many parameters to \`-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$1" number_minor="$2" number_revision="$3" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_minor" lt_irix_increment=no ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; esac ;; no) current="$1" revision="$2" age="$3" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT \`$current' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION \`$revision' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE \`$age' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE \`$age' is greater than the current interface number \`$current'" func_fatal_error "\`$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring:${iface}.0" done # Make executables depend on our current version. verstring="$verstring:${current}.0" ;; qnx) major=".$current" versuffix=".$current" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; *) func_fatal_configuration "unknown library version type \`$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" libobjs="$libobjs $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi removelist="$removelist $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then oldlibs="$oldlibs $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}'$/d' -e "$lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "X$lib_search_path " | $Xsed -e "s% $path % %g"` # deplibs=`$ECHO "X$deplibs " | $Xsed -e "s% -L$path % %g"` # dependency_libs=`$ECHO "X$dependency_libs " | $Xsed -e "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do temp_xrpath="$temp_xrpath -R$libdir" case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) dlfiles="$dlfiles $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) dlprefiles="$dlprefiles $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework deplibs="$deplibs System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then deplibs="$deplibs -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$ECHO "X$potlib" | $Xsed -e 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) newdeplibs="$newdeplibs $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval "\$ECHO \"X$potent_lib\"" 2>/dev/null | $Xsed -e 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$ECHO "X $deplibs" | $Xsed \ -e 's/ -lc$//' -e 's/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO "X $tmp_deplibs" | $Xsed -e "s,$i,,"` done fi if $ECHO "X $tmp_deplibs" | $Xsed -e 's/[ ]//g' | $GREP . >/dev/null; then $ECHO if test "X$deplibs_check_method" = "Xnone"; then $ECHO "*** Warning: inter-library dependencies are not supported in this platform." else $ECHO "*** Warning: inter-library dependencies are not known to be supported." fi $ECHO "*** All declared inter-library dependencies are being dropped." droppeddeps=yes fi ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then $ECHO $ECHO "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" $ECHO "*** a static module, that should work as long as the dlopening" $ECHO "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else $ECHO "*** The inter-library dependencies that have been dropped here will be" $ECHO "*** automatically added whenever a program is linked with this library" $ECHO "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then $ECHO $ECHO "*** Since this library must not contain undefined symbols," $ECHO "*** because either the platform does not support them or" $ECHO "*** it was explicitly requested with -no-undefined," $ECHO "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO "X $deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" dep_rpath="$dep_rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" if test -n "$hardcode_libdir_flag_spec_ld"; then eval dep_rpath=\"$hardcode_libdir_flag_spec_ld\" else eval dep_rpath=\"$hardcode_libdir_flag_spec\" fi fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname="$1" shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do linknames="$linknames $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "X$libobjs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols="$output_objdir/$libname.uexp" delfiles="$delfiles $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols="$export_symbols" export_symbols= always_export_symbols=yes fi fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" func_len " $cmd" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then func_show_eval "$cmd" 'exit $?' skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) tmp_deplibs="$tmp_deplibs $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test "$compiler_needs_object" = yes && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $convenience libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" linker_flags="$linker_flags $flag" fi # Make a backup of the uninstalled library when relinking if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output output_la=`$ECHO "X$output" | $Xsed -e "$basename"` # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then output=${output_objdir}/${output_la}.lnkscript func_verbose "creating GNU ld script: $output" $ECHO 'INPUT (' > $output for obj in $save_libobjs do $ECHO "$obj" >> $output done $ECHO ')' >> $output delfiles="$delfiles $output" elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; then firstobj="$1 " shift fi for obj do $ECHO "$obj" >> $output done delfiles="$delfiles $output" output=$firstobj\"$file_list_spec$output\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-${k}.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test "X$objlist" = X || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. eval concat_cmds=\"$reload_cmds $objlist $last_robj\" else # All subsequent reloadable object files will link in # the last one created. eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-${k}.$objext objlist=$obj func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$reload_cmds $objlist $last_robj\" if test -n "$last_robj"; then eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\" fi delfiles="$delfiles $output" else output= fi if ${skipped_export-false}; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi fi test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi if ${skipped_export-false}; then if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi fi libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "\`-R' is ignored for objects" test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for objects" test -n "$release" && \ func_warning "\`-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object \`$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "X$tmp_whole_archive_flags" | $Xsed -e 's|,| |g'` else gentop="$output_objdir/${obj}x" generated="$generated $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # Create the old-style object. reload_objs="$objs$old_deplibs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}$'/d' -e '/\.lib$/d' -e "$lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for programs" test -n "$release" && \ func_warning "\`-release' is ignored for programs" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test "$tagname" = CXX ; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) compile_command="$compile_command ${wl}-bind_at_load" finalize_command="$finalize_command ${wl}-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done compile_deplibs="$new_libs" compile_command="$compile_command $compile_deplibs" finalize_command="$finalize_command $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) dllsearchpath="$dllsearchpath:$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) finalize_perm_rpath="$finalize_perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$ECHO "X$compile_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` finalize_command=`$ECHO "X$finalize_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *cegcc) # Disable wrappers for cegcc, we are cross compiling anyway. wrappers_required=no ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # Replace the output file specification. compile_command=`$ECHO "X$compile_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' # Delete the generated files. if test -f "$output_objdir/${outputname}S.${objext}"; then func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"' fi exit $exit_status fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do rpath="$rpath$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" func_warning "this platform does not like uninstalled shared libraries" func_warning "\`$output' will be relinked during installation" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "X$compile_var$compile_command$compile_rpath" | $Xsed -e 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` fi # Quote $ECHO for shipping. if test "X$ECHO" = "X$SHELL $progpath --fallback-echo"; then case $progpath in [\\/]* | [A-Za-z]:[\\/]*) qecho="$SHELL $progpath --fallback-echo";; *) qecho="$SHELL `pwd`/$progpath --fallback-echo";; esac qecho=`$ECHO "X$qecho" | $Xsed -e "$sed_quote_subst"` else qecho=`$ECHO "X$ECHO" | $Xsed -e "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host" ; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then oldobjs="$oldobjs $symfileobj" fi fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $addlibs oldobjs="$oldobjs $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles oldobjs="$oldobjs $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else $ECHO "copying selected object files to avoid basename conflicts..." gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase="$func_basename_result" case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" oldobjs="$oldobjs $gentop/$newobj" ;; *) oldobjs="$oldobjs $obj" ;; esac done fi eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" newdependency_libs="$newdependency_libs $libdir/$name" ;; *) newdependency_libs="$newdependency_libs $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlfiles="$newdlfiles $libdir/$name" ;; *) newdlfiles="$newdlfiles $lib" ;; esac done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlprefiles="$newdlprefiles $libdir/$name" ;; esac done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlfiles="$newdlfiles $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlprefiles="$newdlprefiles $abs" done dlprefiles="$newdlprefiles" fi $RM $output # place dlname in correct position for cygwin tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) tdlname=../bin/$dlname ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that can not go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } { test "$mode" = link || test "$mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) RM="$RM $arg"; rmforce=yes ;; -*) RM="$RM $arg" ;; *) files="$files $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= origobjdir="$objdir" for file in $files; do func_dirname "$file" "" "." dir="$func_dirname_result" if test "X$dir" = X.; then objdir="$origobjdir" else objdir="$dir/$origobjdir" fi func_basename "$file" name="$func_basename_result" test "$mode" = uninstall && objdir="$dir" # Remember objdir for removal later, being careful to avoid duplicates if test "$mode" = clean; then case " $rmdirs " in *" $objdir "*) ;; *) rmdirs="$rmdirs $objdir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do rmfiles="$rmfiles $objdir/$n" done test -n "$old_library" && rmfiles="$rmfiles $objdir/$old_library" case "$mode" in clean) case " $library_names " in # " " in the beginning catches empty $dlname *" $dlname "*) ;; *) rmfiles="$rmfiles $objdir/$dlname" ;; esac test -n "$libdir" && rmfiles="$rmfiles $objdir/$name $objdir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test "$pic_object" != none; then rmfiles="$rmfiles $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test "$non_pic_object" != none; then rmfiles="$rmfiles $dir/$non_pic_object" fi fi ;; *) if test "$mode" = clean ; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe rmfiles="$rmfiles $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result rmfiles="$rmfiles $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles rmfiles="$rmfiles $objdir/$name $objdir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then rmfiles="$rmfiles $objdir/lt-$name" fi if test "X$noexename" != "X$name" ; then rmfiles="$rmfiles $objdir/lt-${noexename}.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done objdir="$origobjdir" # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } { test "$mode" = uninstall || test "$mode" = clean; } && func_mode_uninstall ${1+"$@"} test -z "$mode" && { help="$generic_help" func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode \`$mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: # vi:sw=2 synergy-1.4.12-Source/tools/gtest-1.6.0/build-aux/missing0000600000175000017500000002623311561126632022734 0ustar synergysynergy#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2009-04-28.21; # UTC # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006, # 2008, 2009 Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # 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, 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 . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and \`g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # normalize program name to check for. program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). This is about non-GNU programs, so use $1 not # $program. case $1 in lex*|yacc*) # Not GNU programs, they don't have --version. ;; tar*) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $program in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te*) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison*|yacc*) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex*|flex*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit $? fi ;; makeinfo*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar*) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case $firstarg in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case $firstarg in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: synergy-1.4.12-Source/tools/gtest-1.6.0/CHANGES0000600000175000017500000001226011561126632020434 0ustar synergysynergyChanges for 1.6.0: * New feature: ADD_FAILURE_AT() for reporting a test failure at the given source location -- useful for writing testing utilities. * New feature: the universal value printer is moved from Google Mock to Google Test. * New feature: type parameters and value parameters are reported in the XML report now. * A gtest_disable_pthreads CMake option. * Colored output works in GNU Screen sessions now. * Parameters of value-parameterized tests are now printed in the textual output. * Failures from ad hoc test assertions run before RUN_ALL_TESTS() are now correctly reported. * Arguments of ASSERT_XY and EXPECT_XY no longer need to support << to ostream. * More complete handling of exceptions. * GTEST_ASSERT_XY can be used instead of ASSERT_XY in case the latter name is already used by another library. * --gtest_catch_exceptions is now true by default, allowing a test program to continue after an exception is thrown. * Value-parameterized test fixtures can now derive from Test and WithParamInterface separately, easing conversion of legacy tests. * Death test messages are clearly marked to make them more distinguishable from other messages. * Compatibility fixes for Android, Google Native Client, MinGW, HP UX, PowerPC, Lucid autotools, libCStd, Sun C++, Borland C++ Builder (Code Gear), IBM XL C++ (Visual Age C++), and C++0x. * Bug fixes and implementation clean-ups. * Potentially incompatible changes: disables the harmful 'make install' command in autotools. Changes for 1.5.0: * New feature: assertions can be safely called in multiple threads where the pthreads library is available. * New feature: predicates used inside EXPECT_TRUE() and friends can now generate custom failure messages. * New feature: Google Test can now be compiled as a DLL. * New feature: fused source files are included. * New feature: prints help when encountering unrecognized Google Test flags. * Experimental feature: CMake build script (requires CMake 2.6.4+). * Experimental feature: the Pump script for meta programming. * double values streamed to an assertion are printed with enough precision to differentiate any two different values. * Google Test now works on Solaris and AIX. * Build and test script improvements. * Bug fixes and implementation clean-ups. Potentially breaking changes: * Stopped supporting VC++ 7.1 with exceptions disabled. * Dropped support for 'make install'. Changes for 1.4.0: * New feature: the event listener API * New feature: test shuffling * New feature: the XML report format is closer to junitreport and can be parsed by Hudson now. * New feature: when a test runs under Visual Studio, its failures are integrated in the IDE. * New feature: /MD(d) versions of VC++ projects. * New feature: elapsed time for the tests is printed by default. * New feature: comes with a TR1 tuple implementation such that Boost is no longer needed for Combine(). * New feature: EXPECT_DEATH_IF_SUPPORTED macro and friends. * New feature: the Xcode project can now produce static gtest libraries in addition to a framework. * Compatibility fixes for Solaris, Cygwin, minGW, Windows Mobile, Symbian, gcc, and C++Builder. * Bug fixes and implementation clean-ups. Changes for 1.3.0: * New feature: death tests on Windows, Cygwin, and Mac. * New feature: ability to use Google Test assertions in other testing frameworks. * New feature: ability to run disabled test via --gtest_also_run_disabled_tests. * New feature: the --help flag for printing the usage. * New feature: access to Google Test flag values in user code. * New feature: a script that packs Google Test into one .h and one .cc file for easy deployment. * New feature: support for distributing test functions to multiple machines (requires support from the test runner). * Bug fixes and implementation clean-ups. Changes for 1.2.1: * Compatibility fixes for Linux IA-64 and IBM z/OS. * Added support for using Boost and other TR1 implementations. * Changes to the build scripts to support upcoming release of Google C++ Mocking Framework. * Added Makefile to the distribution package. * Improved build instructions in README. Changes for 1.2.0: * New feature: value-parameterized tests. * New feature: the ASSERT/EXPECT_(NON)FATAL_FAILURE(_ON_ALL_THREADS) macros. * Changed the XML report format to match JUnit/Ant's. * Added tests to the Xcode project. * Added scons/SConscript for building with SCons. * Added src/gtest-all.cc for building Google Test from a single file. * Fixed compatibility with Solaris and z/OS. * Enabled running Python tests on systems with python 2.3 installed, e.g. Mac OS X 10.4. * Bug fixes. Changes for 1.1.0: * New feature: type-parameterized tests. * New feature: exception assertions. * New feature: printing elapsed time of tests. * Improved the robustness of death tests. * Added an Xcode project and samples. * Adjusted the output format on Windows to be understandable by Visual Studio. * Minor bug fixes. Changes for 1.0.1: * Added project files for Visual Studio 7.1. * Fixed issues with compiling on Mac OS X. * Fixed issues with compiling on Cygwin. Changes for 1.0.0: * Initial Open Source release of Google Test synergy-1.4.12-Source/tools/gtest-1.6.0/cmake/0000700000175000017500000000000012140644175020517 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/CMakeLists.txt0000600000175000017500000002073011561126632022202 0ustar synergysynergy######################################################################## # CMake build script for Google Test. # # To run the tests for Google Test itself on Linux, use 'make test' or # ctest. You can select which tests to run using 'ctest -R regex'. # For more options, run 'ctest --help'. # BUILD_SHARED_LIBS is a standard CMake variable, but we declare it here to # make it prominent in the GUI. option(BUILD_SHARED_LIBS "Build shared libraries (DLLs)." OFF) # When other libraries are using a shared version of runtime libraries, # Google Test also has to use one. option( gtest_force_shared_crt "Use shared (DLL) run-time lib even when Google Test is built as static lib." OFF) option(gtest_build_tests "Build all of gtest's own tests." OFF) option(gtest_build_samples "Build gtest's sample programs." OFF) option(gtest_disable_pthreads "Disable uses of pthreads in gtest." OFF) # Defines pre_project_set_up_hermetic_build() and set_up_hermetic_build(). include(cmake/hermetic_build.cmake OPTIONAL) if (COMMAND pre_project_set_up_hermetic_build) pre_project_set_up_hermetic_build() endif() ######################################################################## # # Project-wide settings # Name of the project. # # CMake files in this project can refer to the root source directory # as ${gtest_SOURCE_DIR} and to the root binary directory as # ${gtest_BINARY_DIR}. # Language "C" is required for find_package(Threads). project(gtest CXX C) cmake_minimum_required(VERSION 2.6.2) if (COMMAND set_up_hermetic_build) set_up_hermetic_build() endif() # Define helper functions and macros used by Google Test. include(cmake/internal_utils.cmake) config_compiler_and_linker() # Defined in internal_utils.cmake. # Where Google Test's .h files can be found. include_directories( ${gtest_SOURCE_DIR}/include ${gtest_SOURCE_DIR}) # Where Google Test's libraries can be found. link_directories(${gtest_BINARY_DIR}/src) ######################################################################## # # Defines the gtest & gtest_main libraries. User tests should link # with one of them. # Google Test libraries. We build them using more strict warnings than what # are used for other targets, to ensure that gtest can be compiled by a user # aggressive about warnings. cxx_library(gtest "${cxx_strict}" src/gtest-all.cc) cxx_library(gtest_main "${cxx_strict}" src/gtest_main.cc) target_link_libraries(gtest_main gtest) ######################################################################## # # Samples on how to link user tests with gtest or gtest_main. # # They are not built by default. To build them, set the # gtest_build_samples option to ON. You can do it by running ccmake # or specifying the -Dbuild_gtest_samples=ON flag when running cmake. if (gtest_build_samples) cxx_executable(sample1_unittest samples gtest_main samples/sample1.cc) cxx_executable(sample2_unittest samples gtest_main samples/sample2.cc) cxx_executable(sample3_unittest samples gtest_main) cxx_executable(sample4_unittest samples gtest_main samples/sample4.cc) cxx_executable(sample5_unittest samples gtest_main samples/sample1.cc) cxx_executable(sample6_unittest samples gtest_main) cxx_executable(sample7_unittest samples gtest_main) cxx_executable(sample8_unittest samples gtest_main) cxx_executable(sample9_unittest samples gtest) cxx_executable(sample10_unittest samples gtest) endif() ######################################################################## # # Google Test's own tests. # # You can skip this section if you aren't interested in testing # Google Test itself. # # The tests are not built by default. To build them, set the # gtest_build_tests option to ON. You can do it by running ccmake # or specifying the -Dgtest_build_tests=ON flag when running cmake. if (gtest_build_tests) # This must be set in the root directory for the tests to be run by # 'make test' or ctest. enable_testing() ############################################################ # C++ tests built with standard compiler flags. cxx_test(gtest-death-test_test gtest_main) cxx_test(gtest_environment_test gtest) cxx_test(gtest-filepath_test gtest_main) cxx_test(gtest-linked_ptr_test gtest_main) cxx_test(gtest-listener_test gtest_main) cxx_test(gtest_main_unittest gtest_main) cxx_test(gtest-message_test gtest_main) cxx_test(gtest_no_test_unittest gtest) cxx_test(gtest-options_test gtest_main) cxx_test(gtest-param-test_test gtest test/gtest-param-test2_test.cc) cxx_test(gtest-port_test gtest_main) cxx_test(gtest_pred_impl_unittest gtest_main) cxx_test(gtest-printers_test gtest_main) cxx_test(gtest_prod_test gtest_main test/production.cc) cxx_test(gtest_repeat_test gtest) cxx_test(gtest_sole_header_test gtest_main) cxx_test(gtest_stress_test gtest) cxx_test(gtest-test-part_test gtest_main) cxx_test(gtest_throw_on_failure_ex_test gtest) cxx_test(gtest-typed-test_test gtest_main test/gtest-typed-test2_test.cc) cxx_test(gtest_unittest gtest_main) cxx_test(gtest-unittest-api_test gtest) ############################################################ # C++ tests built with non-standard compiler flags. cxx_library(gtest_no_exception "${cxx_no_exception}" src/gtest-all.cc) cxx_library(gtest_main_no_exception "${cxx_no_exception}" src/gtest-all.cc src/gtest_main.cc) cxx_library(gtest_main_no_rtti "${cxx_no_rtti}" src/gtest-all.cc src/gtest_main.cc) cxx_test_with_flags(gtest-death-test_ex_nocatch_test "${cxx_exception} -DGTEST_ENABLE_CATCH_EXCEPTIONS_=0" gtest test/gtest-death-test_ex_test.cc) cxx_test_with_flags(gtest-death-test_ex_catch_test "${cxx_exception} -DGTEST_ENABLE_CATCH_EXCEPTIONS_=1" gtest test/gtest-death-test_ex_test.cc) cxx_test_with_flags(gtest_no_rtti_unittest "${cxx_no_rtti}" gtest_main_no_rtti test/gtest_unittest.cc) cxx_shared_library(gtest_dll "${cxx_default}" src/gtest-all.cc src/gtest_main.cc) cxx_executable_with_flags(gtest_dll_test_ "${cxx_default}" gtest_dll test/gtest_all_test.cc) set_target_properties(gtest_dll_test_ PROPERTIES COMPILE_DEFINITIONS "GTEST_LINKED_AS_SHARED_LIBRARY=1") if (NOT MSVC OR NOT MSVC_VERSION EQUAL 1600) # The C++ Standard specifies tuple_element. # Yet MSVC 10's declares tuple_element. # That declaration conflicts with our own standard-conforming # tuple implementation. Therefore using our own tuple with # MSVC 10 doesn't compile. cxx_library(gtest_main_use_own_tuple "${cxx_use_own_tuple}" src/gtest-all.cc src/gtest_main.cc) cxx_test_with_flags(gtest-tuple_test "${cxx_use_own_tuple}" gtest_main_use_own_tuple test/gtest-tuple_test.cc) cxx_test_with_flags(gtest_use_own_tuple_test "${cxx_use_own_tuple}" gtest_main_use_own_tuple test/gtest-param-test_test.cc test/gtest-param-test2_test.cc) endif() ############################################################ # Python tests. cxx_executable(gtest_break_on_failure_unittest_ test gtest) py_test(gtest_break_on_failure_unittest) cxx_executable_with_flags( gtest_catch_exceptions_no_ex_test_ "${cxx_no_exception}" gtest_main_no_exception test/gtest_catch_exceptions_test_.cc) cxx_executable_with_flags( gtest_catch_exceptions_ex_test_ "${cxx_exception}" gtest_main test/gtest_catch_exceptions_test_.cc) py_test(gtest_catch_exceptions_test) cxx_executable(gtest_color_test_ test gtest) py_test(gtest_color_test) cxx_executable(gtest_env_var_test_ test gtest) py_test(gtest_env_var_test) cxx_executable(gtest_filter_unittest_ test gtest) py_test(gtest_filter_unittest) cxx_executable(gtest_help_test_ test gtest_main) py_test(gtest_help_test) cxx_executable(gtest_list_tests_unittest_ test gtest) py_test(gtest_list_tests_unittest) cxx_executable(gtest_output_test_ test gtest) py_test(gtest_output_test) cxx_executable(gtest_shuffle_test_ test gtest) py_test(gtest_shuffle_test) cxx_executable(gtest_throw_on_failure_test_ test gtest_no_exception) set_target_properties(gtest_throw_on_failure_test_ PROPERTIES COMPILE_FLAGS "${cxx_no_exception}") py_test(gtest_throw_on_failure_test) cxx_executable(gtest_uninitialized_test_ test gtest) py_test(gtest_uninitialized_test) cxx_executable(gtest_xml_outfile1_test_ test gtest_main) cxx_executable(gtest_xml_outfile2_test_ test gtest_main) py_test(gtest_xml_outfiles_test) cxx_executable(gtest_xml_output_unittest_ test gtest) py_test(gtest_xml_output_unittest) endif() synergy-1.4.12-Source/tools/gtest-1.6.0/cmake/internal_utils.cmake0000600000175000017500000002142411561126632024561 0ustar synergysynergy# Defines functions and macros useful for building Google Test and # Google Mock. # # Note: # # - This file will be run twice when building Google Mock (once via # Google Test's CMakeLists.txt, and once via Google Mock's). # Therefore it shouldn't have any side effects other than defining # the functions and macros. # # - The functions/macros defined in this file may depend on Google # Test and Google Mock's option() definitions, and thus must be # called *after* the options have been defined. # Tweaks CMake's default compiler/linker settings to suit Google Test's needs. # # This must be a macro(), as inside a function string() can only # update variables in the function scope. macro(fix_default_compiler_settings_) if (MSVC) # For MSVC, CMake sets certain flags to defaults we want to override. # This replacement code is taken from sample in the CMake Wiki at # http://www.cmake.org/Wiki/CMake_FAQ#Dynamic_Replace. foreach (flag_var CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO) if (NOT BUILD_SHARED_LIBS AND NOT gtest_force_shared_crt) # When Google Test is built as a shared library, it should also use # shared runtime libraries. Otherwise, it may end up with multiple # copies of runtime library data in different modules, resulting in # hard-to-find crashes. When it is built as a static library, it is # preferable to use CRT as static libraries, as we don't have to rely # on CRT DLLs being available. CMake always defaults to using shared # CRT libraries, so we override that default here. string(REPLACE "/MD" "-MT" ${flag_var} "${${flag_var}}") endif() # We prefer more strict warning checking for building Google Test. # Replaces /W3 with /W4 in defaults. string(REPLACE "/W3" "-W4" ${flag_var} "${${flag_var}}") endforeach() endif() endmacro() # Defines the compiler/linker flags used to build Google Test and # Google Mock. You can tweak these definitions to suit your need. A # variable's value is empty before it's explicitly assigned to. macro(config_compiler_and_linker) if (NOT gtest_disable_pthreads) # Defines CMAKE_USE_PTHREADS_INIT and CMAKE_THREAD_LIBS_INIT. find_package(Threads) endif() fix_default_compiler_settings_() if (MSVC) # Newlines inside flags variables break CMake's NMake generator. # TODO(vladl@google.com): Add -RTCs and -RTCu to debug builds. set(cxx_base_flags "-GS -W4 -WX -wd4127 -wd4251 -wd4275 -nologo -J -Zi") set(cxx_base_flags "${cxx_base_flags} -D_UNICODE -DUNICODE -DWIN32 -D_WIN32") set(cxx_base_flags "${cxx_base_flags} -DSTRICT -DWIN32_LEAN_AND_MEAN") set(cxx_exception_flags "-EHsc -D_HAS_EXCEPTIONS=1") set(cxx_no_exception_flags "-D_HAS_EXCEPTIONS=0") set(cxx_no_rtti_flags "-GR-") elseif (CMAKE_COMPILER_IS_GNUCXX) set(cxx_base_flags "-Wall -Wshadow") set(cxx_exception_flags "-fexceptions") set(cxx_no_exception_flags "-fno-exceptions") # Until version 4.3.2, GCC doesn't define a macro to indicate # whether RTTI is enabled. Therefore we define GTEST_HAS_RTTI # explicitly. set(cxx_no_rtti_flags "-fno-rtti -DGTEST_HAS_RTTI=0") set(cxx_strict_flags "-Wextra") elseif (CMAKE_CXX_COMPILER_ID STREQUAL "SunPro") set(cxx_exception_flags "-features=except") # Sun Pro doesn't provide macros to indicate whether exceptions and # RTTI are enabled, so we define GTEST_HAS_* explicitly. set(cxx_no_exception_flags "-features=no%except -DGTEST_HAS_EXCEPTIONS=0") set(cxx_no_rtti_flags "-features=no%rtti -DGTEST_HAS_RTTI=0") elseif (CMAKE_CXX_COMPILER_ID STREQUAL "VisualAge" OR CMAKE_CXX_COMPILER_ID STREQUAL "XL") # CMake 2.8 changes Visual Age's compiler ID to "XL". set(cxx_exception_flags "-qeh") set(cxx_no_exception_flags "-qnoeh") # Until version 9.0, Visual Age doesn't define a macro to indicate # whether RTTI is enabled. Therefore we define GTEST_HAS_RTTI # explicitly. set(cxx_no_rtti_flags "-qnortti -DGTEST_HAS_RTTI=0") elseif (CMAKE_CXX_COMPILER_ID STREQUAL "HP") set(cxx_base_flags "-AA -mt") set(cxx_exception_flags "-DGTEST_HAS_EXCEPTIONS=1") set(cxx_no_exception_flags "+noeh -DGTEST_HAS_EXCEPTIONS=0") # RTTI can not be disabled in HP aCC compiler. set(cxx_no_rtti_flags "") endif() if (CMAKE_USE_PTHREADS_INIT) # The pthreads library is available and allowed. set(cxx_base_flags "${cxx_base_flags} -DGTEST_HAS_PTHREAD=1") else() set(cxx_base_flags "${cxx_base_flags} -DGTEST_HAS_PTHREAD=0") endif() # For building gtest's own tests and samples. set(cxx_exception "${CMAKE_CXX_FLAGS} ${cxx_base_flags} ${cxx_exception_flags}") set(cxx_no_exception "${CMAKE_CXX_FLAGS} ${cxx_base_flags} ${cxx_no_exception_flags}") set(cxx_default "${cxx_exception}") set(cxx_no_rtti "${cxx_default} ${cxx_no_rtti_flags}") set(cxx_use_own_tuple "${cxx_default} -DGTEST_USE_OWN_TR1_TUPLE=1") # For building the gtest libraries. set(cxx_strict "${cxx_default} ${cxx_strict_flags}") endmacro() # Defines the gtest & gtest_main libraries. User tests should link # with one of them. function(cxx_library_with_type name type cxx_flags) # type can be either STATIC or SHARED to denote a static or shared library. # ARGN refers to additional arguments after 'cxx_flags'. add_library(${name} ${type} ${ARGN}) set_target_properties(${name} PROPERTIES COMPILE_FLAGS "${cxx_flags}") if (BUILD_SHARED_LIBS OR type STREQUAL "SHARED") set_target_properties(${name} PROPERTIES COMPILE_DEFINITIONS "GTEST_CREATE_SHARED_LIBRARY=1") endif() if (CMAKE_USE_PTHREADS_INIT) target_link_libraries(${name} ${CMAKE_THREAD_LIBS_INIT}) endif() endfunction() ######################################################################## # # Helper functions for creating build targets. function(cxx_shared_library name cxx_flags) cxx_library_with_type(${name} SHARED "${cxx_flags}" ${ARGN}) endfunction() function(cxx_library name cxx_flags) cxx_library_with_type(${name} "" "${cxx_flags}" ${ARGN}) endfunction() # cxx_executable_with_flags(name cxx_flags libs srcs...) # # creates a named C++ executable that depends on the given libraries and # is built from the given source files with the given compiler flags. function(cxx_executable_with_flags name cxx_flags libs) add_executable(${name} ${ARGN}) if (cxx_flags) set_target_properties(${name} PROPERTIES COMPILE_FLAGS "${cxx_flags}") endif() if (BUILD_SHARED_LIBS) set_target_properties(${name} PROPERTIES COMPILE_DEFINITIONS "GTEST_LINKED_AS_SHARED_LIBRARY=1") endif() # To support mixing linking in static and dynamic libraries, link each # library in with an extra call to target_link_libraries. foreach (lib "${libs}") target_link_libraries(${name} ${lib}) endforeach() endfunction() # cxx_executable(name dir lib srcs...) # # creates a named target that depends on the given libs and is built # from the given source files. dir/name.cc is implicitly included in # the source file list. function(cxx_executable name dir libs) cxx_executable_with_flags( ${name} "${cxx_default}" "${libs}" "${dir}/${name}.cc" ${ARGN}) endfunction() # Sets PYTHONINTERP_FOUND and PYTHON_EXECUTABLE. find_package(PythonInterp) # cxx_test_with_flags(name cxx_flags libs srcs...) # # creates a named C++ test that depends on the given libs and is built # from the given source files with the given compiler flags. function(cxx_test_with_flags name cxx_flags libs) cxx_executable_with_flags(${name} "${cxx_flags}" "${libs}" ${ARGN}) add_test(${name} ${name}) endfunction() # cxx_test(name libs srcs...) # # creates a named test target that depends on the given libs and is # built from the given source files. Unlike cxx_test_with_flags, # test/name.cc is already implicitly included in the source file list. function(cxx_test name libs) cxx_test_with_flags("${name}" "${cxx_default}" "${libs}" "test/${name}.cc" ${ARGN}) endfunction() # py_test(name) # # creates a Python test with the given name whose main module is in # test/name.py. It does nothing if Python is not installed. function(py_test name) # We are not supporting Python tests on Linux yet as they consider # all Linux environments to be google3 and try to use google3 features. if (PYTHONINTERP_FOUND) # ${CMAKE_BINARY_DIR} is known at configuration time, so we can # directly bind it from cmake. ${CTEST_CONFIGURATION_TYPE} is known # only at ctest runtime (by calling ctest -c ), so # we have to escape $ to delay variable substitution here. add_test(${name} ${PYTHON_EXECUTABLE} ${CMAKE_CURRENT_SOURCE_DIR}/test/${name}.py --build_dir=${CMAKE_CURRENT_BINARY_DIR}/\${CTEST_CONFIGURATION_TYPE}) endif() endfunction() synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/0000700000175000017500000000000012140644175021210 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest.cbproj0000600000175000017500000002436611561126632023553 0ustar synergysynergy {bca37a72-5b07-46cf-b44e-89f8e06451a2} Release true true true Base true true Base true lib JPHNE NO_STRICT true true CppStaticLibrary true rtl.bpi;vcl.bpi;bcbie.bpi;vclx.bpi;vclactnband.bpi;xmlrtl.bpi;bcbsmp.bpi;dbrtl.bpi;vcldb.bpi;bdertl.bpi;vcldbx.bpi;dsnap.bpi;dsnapcon.bpi;vclib.bpi;ibxpress.bpi;adortl.bpi;dbxcds.bpi;dbexpress.bpi;DbxCommonDriver.bpi;websnap.bpi;vclie.bpi;webdsnap.bpi;inet.bpi;inetdbbde.bpi;inetdbxpress.bpi;soaprtl.bpi;Rave75VCL.bpi;teeUI.bpi;tee.bpi;teedb.bpi;IndyCore.bpi;IndySystem.bpi;IndyProtocols.bpi;IntrawebDB_90_100.bpi;Intraweb_90_100.bpi;dclZipForged11.bpi;vclZipForged11.bpi;GR32_BDS2006.bpi;GR32_DSGN_BDS2006.bpi;Jcl.bpi;JclVcl.bpi;JvCoreD11R.bpi;JvSystemD11R.bpi;JvStdCtrlsD11R.bpi;JvAppFrmD11R.bpi;JvBandsD11R.bpi;JvDBD11R.bpi;JvDlgsD11R.bpi;JvBDED11R.bpi;JvCmpD11R.bpi;JvCryptD11R.bpi;JvCtrlsD11R.bpi;JvCustomD11R.bpi;JvDockingD11R.bpi;JvDotNetCtrlsD11R.bpi;JvEDID11R.bpi;JvGlobusD11R.bpi;JvHMID11R.bpi;JvInterpreterD11R.bpi;JvJansD11R.bpi;JvManagedThreadsD11R.bpi;JvMMD11R.bpi;JvNetD11R.bpi;JvPageCompsD11R.bpi;JvPluginD11R.bpi;JvPrintPreviewD11R.bpi;JvRuntimeDesignD11R.bpi;JvTimeFrameworkD11R.bpi;JvValidatorsD11R.bpi;JvWizardD11R.bpi;JvXPCtrlsD11R.bpi;VclSmp.bpi;CExceptionExpert11.bpi false $(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;.. rtl.lib;vcl.lib 32 $(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk false false true _DEBUG;$(Defines) true false true None DEBUG true Debug true true true $(BDS)\lib\debug;$(ILINK_LibraryPath) Full true NDEBUG;$(Defines) Release $(BDS)\lib\release;$(ILINK_LibraryPath) None CPlusPlusBuilder.Personality CppStaticLibrary FalseFalse1000FalseFalseFalseFalseFalse103312521.0.0.01.0.0.0FalseFalseFalseTrueFalse CodeGear C++Builder Office 2000 Servers Package CodeGear C++Builder Office XP Servers Package FalseTrueTrue3$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;..$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;..$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\src;..\include1$(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk1NO_STRICT13216 3 4 5 6 7 8 0 1 2 9 10 11 12 14 13 15 16 17 18 Cfg_1 Cfg_2 synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest.groupproj0000600000175000017500000000373011561126632024313 0ustar synergysynergy {c1d923e0-6cba-4332-9b6f-3420acbf5091} Default.Personality synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest_all.cc0000600000175000017500000000351111561126632023476 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: Josh Kelley (joshkel@gmail.com) // // Google C++ Testing Framework (Google Test) // // C++Builder's IDE cannot build a static library from files with hyphens // in their name. See http://qc.codegear.com/wc/qcmain.aspx?d=70977 . // This file serves as a workaround. #include "src/gtest-all.cc" synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest_link.cc0000600000175000017500000000371111561126632023665 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: Josh Kelley (joshkel@gmail.com) // // Google C++ Testing Framework (Google Test) // // Links gtest.lib and gtest_main.lib into the current project in C++Builder. // This means that these libraries can't be renamed, but it's the only way to // ensure that Debug versus Release test builds are linked against the // appropriate Debug or Release build of the libraries. #pragma link "gtest.lib" #pragma link "gtest_main.lib" synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest_main.cbproj0000600000175000017500000002060411561126632024546 0ustar synergysynergy {bca37a72-5b07-46cf-b44e-89f8e06451a2} Release true true true Base true true Base true lib JPHNE NO_STRICT true true CppStaticLibrary true rtl.bpi;vcl.bpi;bcbie.bpi;vclx.bpi;vclactnband.bpi;xmlrtl.bpi;bcbsmp.bpi;dbrtl.bpi;vcldb.bpi;bdertl.bpi;vcldbx.bpi;dsnap.bpi;dsnapcon.bpi;vclib.bpi;ibxpress.bpi;adortl.bpi;dbxcds.bpi;dbexpress.bpi;DbxCommonDriver.bpi;websnap.bpi;vclie.bpi;webdsnap.bpi;inet.bpi;inetdbbde.bpi;inetdbxpress.bpi;soaprtl.bpi;Rave75VCL.bpi;teeUI.bpi;tee.bpi;teedb.bpi;IndyCore.bpi;IndySystem.bpi;IndyProtocols.bpi;IntrawebDB_90_100.bpi;Intraweb_90_100.bpi;dclZipForged11.bpi;vclZipForged11.bpi;GR32_BDS2006.bpi;GR32_DSGN_BDS2006.bpi;Jcl.bpi;JclVcl.bpi;JvCoreD11R.bpi;JvSystemD11R.bpi;JvStdCtrlsD11R.bpi;JvAppFrmD11R.bpi;JvBandsD11R.bpi;JvDBD11R.bpi;JvDlgsD11R.bpi;JvBDED11R.bpi;JvCmpD11R.bpi;JvCryptD11R.bpi;JvCtrlsD11R.bpi;JvCustomD11R.bpi;JvDockingD11R.bpi;JvDotNetCtrlsD11R.bpi;JvEDID11R.bpi;JvGlobusD11R.bpi;JvHMID11R.bpi;JvInterpreterD11R.bpi;JvJansD11R.bpi;JvManagedThreadsD11R.bpi;JvMMD11R.bpi;JvNetD11R.bpi;JvPageCompsD11R.bpi;JvPluginD11R.bpi;JvPrintPreviewD11R.bpi;JvRuntimeDesignD11R.bpi;JvTimeFrameworkD11R.bpi;JvValidatorsD11R.bpi;JvWizardD11R.bpi;JvXPCtrlsD11R.bpi;VclSmp.bpi;CExceptionExpert11.bpi false $(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;.. rtl.lib;vcl.lib 32 $(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk false false true _DEBUG;$(Defines) true false true None DEBUG true Debug true true true $(BDS)\lib\debug;$(ILINK_LibraryPath) Full true NDEBUG;$(Defines) Release $(BDS)\lib\release;$(ILINK_LibraryPath) None CPlusPlusBuilder.Personality CppStaticLibrary FalseFalse1000FalseFalseFalseFalseFalse103312521.0.0.01.0.0.0FalseFalseFalseTrueFalse CodeGear C++Builder Office 2000 Servers Package CodeGear C++Builder Office XP Servers Package FalseTrueTrue3$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;..$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\include;..$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\src;..\src;..\include1$(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk1NO_STRICT13216 0 Cfg_1 Cfg_2 synergy-1.4.12-Source/tools/gtest-1.6.0/codegear/gtest_unittest.cbproj0000600000175000017500000002076311561126632025507 0ustar synergysynergy {eea63393-5ac5-4b9c-8909-d75fef2daa41} Release true true true Base true true Base exe true NO_STRICT JPHNE true ..\test true CppConsoleApplication true true rtl.bpi;vcl.bpi;bcbie.bpi;vclx.bpi;vclactnband.bpi;xmlrtl.bpi;bcbsmp.bpi;dbrtl.bpi;vcldb.bpi;bdertl.bpi;vcldbx.bpi;dsnap.bpi;dsnapcon.bpi;vclib.bpi;ibxpress.bpi;adortl.bpi;dbxcds.bpi;dbexpress.bpi;DbxCommonDriver.bpi;websnap.bpi;vclie.bpi;webdsnap.bpi;inet.bpi;inetdbbde.bpi;inetdbxpress.bpi;soaprtl.bpi;Rave75VCL.bpi;teeUI.bpi;tee.bpi;teedb.bpi;IndyCore.bpi;IndySystem.bpi;IndyProtocols.bpi;IntrawebDB_90_100.bpi;Intraweb_90_100.bpi;Jcl.bpi;JclVcl.bpi;JvCoreD11R.bpi;JvSystemD11R.bpi;JvStdCtrlsD11R.bpi;JvAppFrmD11R.bpi;JvBandsD11R.bpi;JvDBD11R.bpi;JvDlgsD11R.bpi;JvBDED11R.bpi;JvCmpD11R.bpi;JvCryptD11R.bpi;JvCtrlsD11R.bpi;JvCustomD11R.bpi;JvDockingD11R.bpi;JvDotNetCtrlsD11R.bpi;JvEDID11R.bpi;JvGlobusD11R.bpi;JvHMID11R.bpi;JvInterpreterD11R.bpi;JvJansD11R.bpi;JvManagedThreadsD11R.bpi;JvMMD11R.bpi;JvNetD11R.bpi;JvPageCompsD11R.bpi;JvPluginD11R.bpi;JvPrintPreviewD11R.bpi;JvRuntimeDesignD11R.bpi;JvTimeFrameworkD11R.bpi;JvValidatorsD11R.bpi;JvWizardD11R.bpi;JvXPCtrlsD11R.bpi;VclSmp.bpi false $(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\include;..\test;.. $(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk;..\test true false false true _DEBUG;$(Defines) true false true None DEBUG true Debug true true true $(BDS)\lib\debug;$(ILINK_LibraryPath) Full true NDEBUG;$(Defines) Release $(BDS)\lib\release;$(ILINK_LibraryPath) None CPlusPlusBuilder.Personality CppConsoleApplication FalseFalse1000FalseFalseFalseFalseFalse103312521.0.0.01.0.0.0FalseFalseFalseTrueFalse CodeGear C++Builder Office 2000 Servers Package CodeGear C++Builder Office XP Servers Package FalseTrueTrue3$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\include;..\test;..$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\include;..\test$(BDS)\include;$(BDS)\include\dinkumware;$(BDS)\include\vcl;..\include1$(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk;..\test$(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk;..\test$(BDS)\lib;$(BDS)\lib\obj;$(BDS)\lib\psdk;$(OUTPUTDIR);..\test2NO_STRICTSTRICT 0 1 Cfg_1 Cfg_2 synergy-1.4.12-Source/tools/gtest-1.6.0/configure0000600000175000017500000203360311561126632021353 0ustar synergysynergy#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.65 for Google C++ Testing Framework 1.6.0. # # Report bugs to . # # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV export CONFIG_SHELL exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"} fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org and $0: googletestframework@googlegroups.com about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\$\\$0,'$0','` ;; esac ECHO=${lt_ECHO-echo} if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "$0" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF $* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "$0"' 'sed 20q "$0"' 'sed 10q "$0"' 'sed 2q "$0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "$0" --no-reexec ${1+"$@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL $0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL $0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "$0"' 'sed 10q "$0"' 'sed 20q "$0"' 'sed 50q "$0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "$0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "$0" ${1+"$@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL $0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\$0 --fallback-echo" fi test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='Google C++ Testing Framework' PACKAGE_TARNAME='gtest' PACKAGE_VERSION='1.6.0' PACKAGE_STRING='Google C++ Testing Framework 1.6.0' PACKAGE_BUGREPORT='googletestframework@googlegroups.com' PACKAGE_URL='' ac_unique_file="./COPYING" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS LIBOBJS HAVE_PTHREADS_FALSE HAVE_PTHREADS_TRUE PTHREAD_CFLAGS PTHREAD_LIBS PTHREAD_CC acx_pthread_config HAVE_PYTHON_FALSE HAVE_PYTHON_TRUE PYTHON CXXCPP CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL lt_ECHO RANLIB AR OBJDUMP LN_S NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL am__fastdepCXX_FALSE am__fastdepCXX_TRUE CXXDEPMODE ac_ct_CXX CXXFLAGS CXX am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld enable_libtool_lock with_pthreads ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CXX CXXFLAGS CCC CPP CXXCPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error "unrecognized option: \`$ac_option' Try \`$0 --help' for more information." ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe $as_echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures Google C++ Testing Framework 1.6.0 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/gtest] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of Google C++ Testing Framework 1.6.0:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-pthreads use pthreads (default is yes) Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CXX C++ compiler command CXXFLAGS C++ compiler flags CPP C preprocessor CXXCPP C++ preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF Google C++ Testing Framework configure 1.6.0 generated by GNU Autoconf 2.65 Copyright (C) 2009 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_cxx_try_compile LINENO # ---------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_header_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_func # ac_fn_cxx_try_cpp LINENO # ------------------------ # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } >/dev/null && { test -z "$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_cpp # ac_fn_cxx_try_link LINENO # ------------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_cxx_try_link cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by Google C++ Testing Framework $as_me 1.6.0, which was generated by GNU Autoconf 2.65. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------------- ## ## File substitutions. ## ## ------------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then ac_site_file1=$CONFIG_SITE elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Provide various options to initialize the Autoconf and configure processes. ac_aux_dir= for ac_dir in build-aux "$srcdir"/build-aux; do for ac_t in install-sh install.sh shtool; do if test -f "$ac_dir/$ac_t"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/$ac_t -c" break 2 fi done done if test -z "$ac_aux_dir"; then as_fn_error "cannot find install-sh, install.sh, or shtool in build-aux \"$srcdir\"/build-aux" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. ac_config_headers="$ac_config_headers build-aux/config.h" ac_config_files="$ac_config_files Makefile" ac_config_files="$ac_config_files scripts/gtest-config" # Initialize Automake with various options. We require at least v1.9, prevent # pedantic complaints about package files, and enable various distribution # targets. am__api_version='1.11' # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi test "$2" = conftest.file ) then # Ok. : else as_fn_error "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if test "${ac_cv_path_mkdir+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AWK+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='gtest' VERSION='1.6.0' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' # Check for programs used in building Google Test. ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "no acceptable C compiler found in \$PATH See \`config.log' for more details." "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "C compiler cannot create executables See \`config.log' for more details." "$LINENO" 5; }; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if test "${ac_cv_objext+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of object files: cannot compile See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if test "${ac_cv_c_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if test "${ac_cv_prog_cc_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if test "${ac_cv_prog_cc_c89+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if test "${ac_cv_cxx_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if test "${ac_cv_prog_cxx_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.2.6b' macro_revision='1.3017' ltmain="$ac_aux_dir/ltmain.sh" # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if test "${ac_cv_build+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if test "${ac_cv_host+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if test "${ac_cv_path_SED+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if test "${ac_cv_path_GREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if test "${ac_cv_path_EGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if test "${ac_cv_path_FGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if test "${lt_cv_path_LD+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if test "${lt_cv_prog_gnu_ld+set}" = set; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if test "${lt_cv_path_NM+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$ac_tool_prefix"; then for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if test "${lt_cv_nm_interface+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:4924: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:4927: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:4930: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if test "${lt_cv_sys_max_cmd_len+set}" = set; then : $as_echo_n "(cached) " >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL $0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if test "${lt_cv_ld_reload_flag+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if test "${lt_cv_deplibs_check_method+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. if ( file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9].[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ar", so it can be a program name with args. set dummy ${ac_tool_prefix}ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AR="${ac_tool_prefix}ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_AR"; then ac_ct_AR=$AR # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_AR="ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi else AR="$ac_cv_prog_AR" fi test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if test "${lt_cv_sys_global_symbol_pipe+set}" = set; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line 6136 "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if test "${lt_cv_cc_needs_belf+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if test "${lt_cv_apple_cc_single_mod+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if test "${lt_cv_ld_exported_symbols_list+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if test "${ac_cv_header_stdc+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " eval as_val=\$$as_ac_Header if test "x$as_val" = x""yes; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = x""yes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if test "${ac_cv_cxx_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if test "${ac_cv_prog_cxx_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5 $as_echo_n "checking how to run the C++ preprocessor... " >&6; } if test -z "$CXXCPP"; then if test "${ac_cv_prog_CXXCPP+set}" = set; then : $as_echo_n "(cached) " >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5 $as_echo "$CXXCPP" >&6; } ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} _lt_caught_CXX_error=yes; } fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu else _lt_caught_CXX_error=yes fi # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; pic_mode="$withval" else pic_mode=default fi test -z "$pic_mode" && pic_mode=default # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if test "${lt_cv_objdir+set}" = set; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC="$CC" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag=' -fno-builtin' { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8193: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8197: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_prog_compiler_pic" >&5 $as_echo "$lt_prog_compiler_pic" >&6; } # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if test "${lt_cv_prog_compiler_pic_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8532: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8536: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test x"$lt_cv_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if test "${lt_cv_prog_compiler_static_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test x"$lt_cv_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8637: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:8641: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8692: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:8696: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) link_all_deplibs=no ;; esac ld_shlibs=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; xl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld='-rpath $libdir' archive_cmds='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes=yes ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='' link_all_deplibs=yes allow_undefined_flag="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; freebsd1*) ld_shlibs=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld='+b $libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo(void) {} _ACEOF if ac_fn_c_try_link "$LINENO"; then : archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='${wl}-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test "$ld_shlibs" = no && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then archive_cmds_need_lc=no else archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* { $as_echo "$as_me:${as_lineno-$LINENO}: result: $archive_cmds_need_lc" >&5 $as_echo "$archive_cmds_need_lc" >&6; } ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[3-9]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if test "${ac_cv_lib_dld_shl_load+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld" else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if test "${ac_cv_lib_svld_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if test "${ac_cv_lib_dld_dld_link+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = x""yes; then : lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 11076 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self_static+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 11172 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report which library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= compiler_needs_object_CXX=no export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_direct_absolute_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_flag_spec_ld_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no inherit_rpath_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if test "${lt_cv_path_LD+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if test "${lt_cv_prog_gnu_ld+set}" = set; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes file_list_spec_CXX='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec_CXX='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. always_export_symbols_CXX=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty # executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' ${wl}-bernotok' allow_undefined_flag_CXX=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared # libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; darwin* | rhapsody*) archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported whole_archive_flag_spec_CXX='' link_all_deplibs_CXX=yes allow_undefined_flag_CXX="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds_CXX="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" if test "$lt_cv_apple_cc_single_mod" != "yes"; then archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi else ld_shlibs_CXX=no fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd[12]*) # C++ shared libraries reported to be fairly broken before # switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; gnu*) ;; hpux9*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) ;; *) export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix[3-9]*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: inherit_rpath_CXX=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [1-5]* | *pgcpp\ [1-5]*) prelink_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | $NL2SP`"' old_archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | $NL2SP`~ $RANLIB $oldlib' archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 will use weak symbols archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; xl*) # IBM XL 8.0 on PPC, with GNU ld hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' hardcode_libdir_flag_spec_CXX='-R$libdir' whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object_CXX=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) ld_shlibs_CXX=yes ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no hardcode_direct_absolute_CXX=yes archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='${wl}-E' whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=echo else ld_shlibs_CXX=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) case $host in osf3*) allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && $ECHO "X${wl}-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' ;; *) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' ;; esac hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then no_undefined_flag_CXX=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='${wl}-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_CXX='${wl}-z,text' allow_undefined_flag_CXX='${wl}-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-R,$libdir' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX="${prev}${p}" else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX="${prev}${p}" else postdeps_CXX="${postdeps_CXX} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$predep_objects_CXX"; then predep_objects_CXX="$p" else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX="$p" else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $RM -f confest.$objext # PORTME: override above test on systems where it is broken case $host_os in interix[3-9]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac compiler_lib_search_dirs_CXX= if test -n "${compiler_lib_search_path_CXX}"; then compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic_CXX='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix[4-9]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; xlc* | xlC*) # IBM XL 8.0 on PPC lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-qpic' lt_prog_compiler_static_CXX='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_prog_compiler_pic_CXX" >&5 $as_echo "$lt_prog_compiler_pic_CXX" >&6; } # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; } if test "${lt_cv_prog_compiler_pic_works_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13128: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:13132: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works_CXX=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if test "${lt_cv_prog_compiler_static_works_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works_CXX=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works_CXX=yes fi else lt_cv_prog_compiler_static_works_CXX=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_static_works_CXX" = xyes; then : else lt_prog_compiler_static_CXX= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13227: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:13231: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13279: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:13283: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix[4-9]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;/^.*[ ]__nm__/s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' ;; linux* | k*bsd*-gnu) link_all_deplibs_CXX=no ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no with_gnu_ld_CXX=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then archive_cmds_need_lc_CXX=no else archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* { $as_echo "$as_me:${as_lineno-$LINENO}: result: $archive_cmds_need_lc_CXX" >&5 $as_echo "$archive_cmds_need_lc_CXX" >&6; } ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[3-9]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || test -n "$runpath_var_CXX" || test "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct_CXX" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5 $as_echo "$hardcode_action_CXX" >&6; } if test "$hardcode_action_CXX" = relink || test "$inherit_rpath_CXX" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi fi # test -n "$compiler" CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu ac_config_commands="$ac_config_commands libtool" # Only expand once: # TODO(chandlerc@google.com): Currently we aren't running the Python tests # against the interpreter detected by AM_PATH_PYTHON, and so we condition # HAVE_PYTHON by requiring "python" to be in the PATH, and that interpreter's # version to be >= 2.3. This will allow the scripts to use a "/usr/bin/env" # hashbang. PYTHON= # We *do not* allow the user to specify a python interpreter # Extract the first word of "python", so it can be a program name with args. set dummy python; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_path_PYTHON+set}" = set; then : $as_echo_n "(cached) " >&6 else case $PYTHON in [\\/]* | ?:[\\/]*) ac_cv_path_PYTHON="$PYTHON" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_path_PYTHON="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_PYTHON" && ac_cv_path_PYTHON=":" ;; esac fi PYTHON=$ac_cv_path_PYTHON if test -n "$PYTHON"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PYTHON" >&5 $as_echo "$PYTHON" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$PYTHON" != ":"; then : prog="import sys # split strings by '.' and convert to numeric. Append some zeros # because we need at least 4 digits for the hex conversion. # map returns an iterator in Python 3.0 and a list in 2.x minver = list(map(int, '2.3'.split('.'))) + [0, 0, 0] minverhex = 0 # xrange is not present in Python 3.0 and range returns an iterator for i in list(range(0, 4)): minverhex = (minverhex << 8) + minver[i] sys.exit(sys.hexversion < minverhex)" if { echo "$as_me:$LINENO: $PYTHON -c "$prog"" >&5 ($PYTHON -c "$prog") >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then : : else PYTHON=":" fi fi if test "$PYTHON" != ":"; then HAVE_PYTHON_TRUE= HAVE_PYTHON_FALSE='#' else HAVE_PYTHON_TRUE='#' HAVE_PYTHON_FALSE= fi # Configure pthreads. # Check whether --with-pthreads was given. if test "${with_pthreads+set}" = set; then : withval=$with_pthreads; with_pthreads=$withval else with_pthreads=check fi have_pthreads=no if test "x$with_pthreads" != "xno"; then : ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu acx_pthread_ok=no # We used to check for pthread.h first, but this fails if pthread.h # requires special compiler flags (e.g. on True64 or Sequent). # It gets checked for in the link test anyway. # First of all, check if the user has set any of the PTHREAD_LIBS, # etcetera environment variables, and if threads linking works using # them: if test x"$PTHREAD_LIBS$PTHREAD_CFLAGS" != x; then save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for pthread_join in LIBS=$PTHREAD_LIBS with CFLAGS=$PTHREAD_CFLAGS" >&5 $as_echo_n "checking for pthread_join in LIBS=$PTHREAD_LIBS with CFLAGS=$PTHREAD_CFLAGS... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char pthread_join (); int main () { return pthread_join (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : acx_pthread_ok=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_ok" >&5 $as_echo "$acx_pthread_ok" >&6; } if test x"$acx_pthread_ok" = xno; then PTHREAD_LIBS="" PTHREAD_CFLAGS="" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" fi # We must check for the threads library under a number of different # names; the ordering is very important because some systems # (e.g. DEC) have both -lpthread and -lpthreads, where one of the # libraries is broken (non-POSIX). # Create a list of thread flags to try. Items starting with a "-" are # C compiler flags, and other items are library names, except for "none" # which indicates that we try without any flags at all, and "pthread-config" # which is a program returning the flags for the Pth emulation library. acx_pthread_flags="pthreads none -Kthread -kthread lthread -pthread -pthreads -mthreads pthread --thread-safe -mt pthread-config" # The ordering *is* (sometimes) important. Some notes on the # individual items follow: # pthreads: AIX (must check this before -lpthread) # none: in case threads are in libc; should be tried before -Kthread and # other compiler flags to prevent continual compiler warnings # -Kthread: Sequent (threads in libc, but -Kthread needed for pthread.h) # -kthread: FreeBSD kernel threads (preferred to -pthread since SMP-able) # lthread: LinuxThreads port on FreeBSD (also preferred to -pthread) # -pthread: Linux/gcc (kernel threads), BSD/gcc (userland threads) # -pthreads: Solaris/gcc # -mthreads: Mingw32/gcc, Lynx/gcc # -mt: Sun Workshop C (may only link SunOS threads [-lthread], but it # doesn't hurt to check since this sometimes defines pthreads too; # also defines -D_REENTRANT) # ... -mt is also the pthreads flag for HP/aCC # pthread: Linux, etcetera # --thread-safe: KAI C++ # pthread-config: use pthread-config program (for GNU Pth library) case "${host_cpu}-${host_os}" in *solaris*) # On Solaris (at least, for some versions), libc contains stubbed # (non-functional) versions of the pthreads routines, so link-based # tests will erroneously succeed. (We need to link with -pthreads/-mt/ # -lpthread.) (The stubs are missing pthread_cleanup_push, or rather # a function called by this macro, so we could check for that, but # who knows whether they'll stub that too in a future libc.) So, # we'll just look for -pthreads and -lpthread first: acx_pthread_flags="-pthreads pthread -mt -pthread $acx_pthread_flags" ;; esac if test x"$acx_pthread_ok" = xno; then for flag in $acx_pthread_flags; do case $flag in none) { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether pthreads work without any flags" >&5 $as_echo_n "checking whether pthreads work without any flags... " >&6; } ;; -*) { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether pthreads work with $flag" >&5 $as_echo_n "checking whether pthreads work with $flag... " >&6; } PTHREAD_CFLAGS="$flag" ;; pthread-config) # Extract the first word of "pthread-config", so it can be a program name with args. set dummy pthread-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_acx_pthread_config+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$acx_pthread_config"; then ac_cv_prog_acx_pthread_config="$acx_pthread_config" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_acx_pthread_config="yes" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_acx_pthread_config" && ac_cv_prog_acx_pthread_config="no" fi fi acx_pthread_config=$ac_cv_prog_acx_pthread_config if test -n "$acx_pthread_config"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_config" >&5 $as_echo "$acx_pthread_config" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test x"$acx_pthread_config" = xno; then continue; fi PTHREAD_CFLAGS="`pthread-config --cflags`" PTHREAD_LIBS="`pthread-config --ldflags` `pthread-config --libs`" ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the pthreads library -l$flag" >&5 $as_echo_n "checking for the pthreads library -l$flag... " >&6; } PTHREAD_LIBS="-l$flag" ;; esac save_LIBS="$LIBS" save_CFLAGS="$CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Check for various functions. We must include pthread.h, # since some functions may be macros. (On the Sequent, we # need a special flag -Kthread to make this header compile.) # We check for pthread_join because it is in -lpthread on IRIX # while pthread_create is in libc. We check for pthread_attr_init # due to DEC craziness with -lpthreads. We check for # pthread_cleanup_push because it is one of the few pthread # functions on Solaris that doesn't have a non-functional libc stub. # We try pthread_create on general principles. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : acx_pthread_ok=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acx_pthread_ok" >&5 $as_echo "$acx_pthread_ok" >&6; } if test "x$acx_pthread_ok" = xyes; then break; fi PTHREAD_LIBS="" PTHREAD_CFLAGS="" done fi # Various other checks: if test "x$acx_pthread_ok" = xyes; then save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Detect AIX lossage: JOINABLE attribute is called UNDETACHED. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for joinable pthread attribute" >&5 $as_echo_n "checking for joinable pthread attribute... " >&6; } attr_name=unknown for attr in PTHREAD_CREATE_JOINABLE PTHREAD_CREATE_UNDETACHED; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int attr=$attr; return attr; ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : attr_name=$attr; break fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext done { $as_echo "$as_me:${as_lineno-$LINENO}: result: $attr_name" >&5 $as_echo "$attr_name" >&6; } if test "$attr_name" != PTHREAD_CREATE_JOINABLE; then cat >>confdefs.h <<_ACEOF #define PTHREAD_CREATE_JOINABLE $attr_name _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if more special flags are required for pthreads" >&5 $as_echo_n "checking if more special flags are required for pthreads... " >&6; } flag=no case "${host_cpu}-${host_os}" in *-aix* | *-freebsd* | *-darwin*) flag="-D_THREAD_SAFE";; *solaris* | *-osf* | *-hpux*) flag="-D_REENTRANT";; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${flag}" >&5 $as_echo "${flag}" >&6; } if test "x$flag" != xno; then PTHREAD_CFLAGS="$flag $PTHREAD_CFLAGS" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" # More AIX lossage: must compile with xlc_r or cc_r if test x"$GCC" != xyes; then for ac_prog in xlc_r cc_r do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_PTHREAD_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$PTHREAD_CC"; then ac_cv_prog_PTHREAD_CC="$PTHREAD_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_PTHREAD_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi PTHREAD_CC=$ac_cv_prog_PTHREAD_CC if test -n "$PTHREAD_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PTHREAD_CC" >&5 $as_echo "$PTHREAD_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$PTHREAD_CC" && break done test -n "$PTHREAD_CC" || PTHREAD_CC="${CC}" else PTHREAD_CC=$CC fi # The next part tries to detect GCC inconsistency with -shared on some # architectures and systems. The problem is that in certain # configurations, when -shared is specified, GCC "forgets" to # internally use various flags which are still necessary. # # Prepare the flags # save_CFLAGS="$CFLAGS" save_LIBS="$LIBS" save_CC="$CC" # Try with the flags determined by the earlier checks. # # -Wl,-z,defs forces link-time symbol resolution, so that the # linking checks with -shared actually have any value # # FIXME: -fPIC is required for -shared on many architectures, # so we specify it here, but the right way would probably be to # properly detect whether it is actually required. CFLAGS="-shared -fPIC -Wl,-z,defs $CFLAGS $PTHREAD_CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CC="$PTHREAD_CC" # In order not to create several levels of indentation, we test # the value of "$done" until we find the cure or run out of ideas. done="no" # First, make sure the CFLAGS we added are actually accepted by our # compiler. If not (and OS X's ld, for instance, does not accept -z), # then we can't do this test. if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to check for GCC pthread/shared inconsistencies" >&5 $as_echo_n "checking whether to check for GCC pthread/shared inconsistencies... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : else done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi fi if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -pthread is sufficient with -shared" >&5 $as_echo_n "checking whether -pthread is sufficient with -shared... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi # # Linux gcc on some architectures such as mips/mipsel forgets # about -lpthread # if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lpthread fixes that" >&5 $as_echo_n "checking whether -lpthread fixes that... " >&6; } LIBS="-lpthread $PTHREAD_LIBS $save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } PTHREAD_LIBS="-lpthread $PTHREAD_LIBS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi # # FreeBSD 4.10 gcc forgets to use -lc_r instead of -lc # if test x"$done" = xno; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc_r fixes that" >&5 $as_echo_n "checking whether -lc_r fixes that... " >&6; } LIBS="-lc_r $PTHREAD_LIBS $save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : done=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "x$done" = xyes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } PTHREAD_LIBS="-lc_r $PTHREAD_LIBS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test x"$done" = xno; then # OK, we have run out of ideas { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Impossible to determine how to use pthreads with shared libraries" >&5 $as_echo "$as_me: WARNING: Impossible to determine how to use pthreads with shared libraries" >&2;} # so it's not safe to assume that we may use pthreads acx_pthread_ok=no fi CFLAGS="$save_CFLAGS" LIBS="$save_LIBS" CC="$save_CC" else PTHREAD_CC="$CC" fi # Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND: if test x"$acx_pthread_ok" = xyes; then $as_echo "#define HAVE_PTHREAD 1" >>confdefs.h : else acx_pthread_ok=no if test "x$with_pthreads" != "xcheck"; then : { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "--with-pthreads was specified, but unable to be used See \`config.log' for more details." "$LINENO" 5; } fi fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu have_pthreads="$acx_pthread_ok" fi if test "x$have_pthreads" == "xyes"; then HAVE_PTHREADS_TRUE= HAVE_PTHREADS_FALSE='#' else HAVE_PTHREADS_TRUE='#' HAVE_PTHREADS_FALSE= fi # TODO(chandlerc@google.com) Check for the necessary system headers. # TODO(chandlerc@google.com) Check the types, structures, and other compiler # and architecture characteristics. # Output the generated files. No further autoconf macros may be used. cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then test "x$cache_file" != "x/dev/null" && { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} cat confcache >$cache_file else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_PYTHON_TRUE}" && test -z "${HAVE_PYTHON_FALSE}"; then as_fn_error "conditional \"HAVE_PYTHON\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_PTHREADS_TRUE}" && test -z "${HAVE_PTHREADS_FALSE}"; then as_fn_error "conditional \"HAVE_PTHREADS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : ${CONFIG_STATUS=./config.status} ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by Google C++ Testing Framework $as_me 1.6.0, which was generated by GNU Autoconf 2.65. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ Google C++ Testing Framework config.status 1.6.0 configured by $0, generated by GNU Autoconf 2.65, with options \\"\$ac_cs_config\\" Copyright (C) 2009 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "X$macro_version" | $Xsed -e "$delay_single_quote_subst"`' macro_revision='`$ECHO "X$macro_revision" | $Xsed -e "$delay_single_quote_subst"`' enable_shared='`$ECHO "X$enable_shared" | $Xsed -e "$delay_single_quote_subst"`' enable_static='`$ECHO "X$enable_static" | $Xsed -e "$delay_single_quote_subst"`' pic_mode='`$ECHO "X$pic_mode" | $Xsed -e "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "X$enable_fast_install" | $Xsed -e "$delay_single_quote_subst"`' host_alias='`$ECHO "X$host_alias" | $Xsed -e "$delay_single_quote_subst"`' host='`$ECHO "X$host" | $Xsed -e "$delay_single_quote_subst"`' host_os='`$ECHO "X$host_os" | $Xsed -e "$delay_single_quote_subst"`' build_alias='`$ECHO "X$build_alias" | $Xsed -e "$delay_single_quote_subst"`' build='`$ECHO "X$build" | $Xsed -e "$delay_single_quote_subst"`' build_os='`$ECHO "X$build_os" | $Xsed -e "$delay_single_quote_subst"`' SED='`$ECHO "X$SED" | $Xsed -e "$delay_single_quote_subst"`' Xsed='`$ECHO "X$Xsed" | $Xsed -e "$delay_single_quote_subst"`' GREP='`$ECHO "X$GREP" | $Xsed -e "$delay_single_quote_subst"`' EGREP='`$ECHO "X$EGREP" | $Xsed -e "$delay_single_quote_subst"`' FGREP='`$ECHO "X$FGREP" | $Xsed -e "$delay_single_quote_subst"`' LD='`$ECHO "X$LD" | $Xsed -e "$delay_single_quote_subst"`' NM='`$ECHO "X$NM" | $Xsed -e "$delay_single_quote_subst"`' LN_S='`$ECHO "X$LN_S" | $Xsed -e "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "X$max_cmd_len" | $Xsed -e "$delay_single_quote_subst"`' ac_objext='`$ECHO "X$ac_objext" | $Xsed -e "$delay_single_quote_subst"`' exeext='`$ECHO "X$exeext" | $Xsed -e "$delay_single_quote_subst"`' lt_unset='`$ECHO "X$lt_unset" | $Xsed -e "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "X$lt_SP2NL" | $Xsed -e "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "X$lt_NL2SP" | $Xsed -e "$delay_single_quote_subst"`' reload_flag='`$ECHO "X$reload_flag" | $Xsed -e "$delay_single_quote_subst"`' reload_cmds='`$ECHO "X$reload_cmds" | $Xsed -e "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "X$OBJDUMP" | $Xsed -e "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "X$deplibs_check_method" | $Xsed -e "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "X$file_magic_cmd" | $Xsed -e "$delay_single_quote_subst"`' AR='`$ECHO "X$AR" | $Xsed -e "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "X$AR_FLAGS" | $Xsed -e "$delay_single_quote_subst"`' STRIP='`$ECHO "X$STRIP" | $Xsed -e "$delay_single_quote_subst"`' RANLIB='`$ECHO "X$RANLIB" | $Xsed -e "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "X$old_postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "X$old_postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "X$old_archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' CC='`$ECHO "X$CC" | $Xsed -e "$delay_single_quote_subst"`' CFLAGS='`$ECHO "X$CFLAGS" | $Xsed -e "$delay_single_quote_subst"`' compiler='`$ECHO "X$compiler" | $Xsed -e "$delay_single_quote_subst"`' GCC='`$ECHO "X$GCC" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "X$lt_cv_sys_global_symbol_pipe" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "X$lt_cv_sys_global_symbol_to_cdecl" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' objdir='`$ECHO "X$objdir" | $Xsed -e "$delay_single_quote_subst"`' SHELL='`$ECHO "X$SHELL" | $Xsed -e "$delay_single_quote_subst"`' ECHO='`$ECHO "X$ECHO" | $Xsed -e "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "X$MAGIC_CMD" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "X$lt_prog_compiler_no_builtin_flag" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "X$lt_prog_compiler_wl" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "X$lt_prog_compiler_pic" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "X$lt_prog_compiler_static" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "X$lt_cv_prog_compiler_c_o" | $Xsed -e "$delay_single_quote_subst"`' need_locks='`$ECHO "X$need_locks" | $Xsed -e "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "X$DSYMUTIL" | $Xsed -e "$delay_single_quote_subst"`' NMEDIT='`$ECHO "X$NMEDIT" | $Xsed -e "$delay_single_quote_subst"`' LIPO='`$ECHO "X$LIPO" | $Xsed -e "$delay_single_quote_subst"`' OTOOL='`$ECHO "X$OTOOL" | $Xsed -e "$delay_single_quote_subst"`' OTOOL64='`$ECHO "X$OTOOL64" | $Xsed -e "$delay_single_quote_subst"`' libext='`$ECHO "X$libext" | $Xsed -e "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "X$shrext_cmds" | $Xsed -e "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "X$extract_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "X$archive_cmds_need_lc" | $Xsed -e "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "X$enable_shared_with_static_runtimes" | $Xsed -e "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "X$export_dynamic_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "X$whole_archive_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "X$compiler_needs_object" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "X$old_archive_from_new_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "X$old_archive_from_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds='`$ECHO "X$archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "X$archive_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_cmds='`$ECHO "X$module_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "X$module_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "X$with_gnu_ld" | $Xsed -e "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "X$allow_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "X$no_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "X$hardcode_libdir_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_ld='`$ECHO "X$hardcode_libdir_flag_spec_ld" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "X$hardcode_libdir_separator" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "X$hardcode_direct" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "X$hardcode_direct_absolute" | $Xsed -e "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "X$hardcode_minus_L" | $Xsed -e "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "X$hardcode_shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "X$hardcode_automatic" | $Xsed -e "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "X$inherit_rpath" | $Xsed -e "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "X$link_all_deplibs" | $Xsed -e "$delay_single_quote_subst"`' fix_srcfile_path='`$ECHO "X$fix_srcfile_path" | $Xsed -e "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "X$always_export_symbols" | $Xsed -e "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "X$export_symbols_cmds" | $Xsed -e "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "X$exclude_expsyms" | $Xsed -e "$delay_single_quote_subst"`' include_expsyms='`$ECHO "X$include_expsyms" | $Xsed -e "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "X$prelink_cmds" | $Xsed -e "$delay_single_quote_subst"`' file_list_spec='`$ECHO "X$file_list_spec" | $Xsed -e "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "X$variables_saved_for_relink" | $Xsed -e "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "X$need_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' need_version='`$ECHO "X$need_version" | $Xsed -e "$delay_single_quote_subst"`' version_type='`$ECHO "X$version_type" | $Xsed -e "$delay_single_quote_subst"`' runpath_var='`$ECHO "X$runpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "X$shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "X$shlibpath_overrides_runpath" | $Xsed -e "$delay_single_quote_subst"`' libname_spec='`$ECHO "X$libname_spec" | $Xsed -e "$delay_single_quote_subst"`' library_names_spec='`$ECHO "X$library_names_spec" | $Xsed -e "$delay_single_quote_subst"`' soname_spec='`$ECHO "X$soname_spec" | $Xsed -e "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "X$postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "X$postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_cmds='`$ECHO "X$finish_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_eval='`$ECHO "X$finish_eval" | $Xsed -e "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "X$hardcode_into_libs" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "X$sys_lib_search_path_spec" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "X$sys_lib_dlsearch_path_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_action='`$ECHO "X$hardcode_action" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "X$enable_dlopen" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "X$enable_dlopen_self" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "X$enable_dlopen_self_static" | $Xsed -e "$delay_single_quote_subst"`' old_striplib='`$ECHO "X$old_striplib" | $Xsed -e "$delay_single_quote_subst"`' striplib='`$ECHO "X$striplib" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_dirs='`$ECHO "X$compiler_lib_search_dirs" | $Xsed -e "$delay_single_quote_subst"`' predep_objects='`$ECHO "X$predep_objects" | $Xsed -e "$delay_single_quote_subst"`' postdep_objects='`$ECHO "X$postdep_objects" | $Xsed -e "$delay_single_quote_subst"`' predeps='`$ECHO "X$predeps" | $Xsed -e "$delay_single_quote_subst"`' postdeps='`$ECHO "X$postdeps" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_path='`$ECHO "X$compiler_lib_search_path" | $Xsed -e "$delay_single_quote_subst"`' LD_CXX='`$ECHO "X$LD_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_cmds_CXX='`$ECHO "X$old_archive_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_CXX='`$ECHO "X$compiler_CXX" | $Xsed -e "$delay_single_quote_subst"`' GCC_CXX='`$ECHO "X$GCC_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "X$lt_prog_compiler_no_builtin_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_wl_CXX='`$ECHO "X$lt_prog_compiler_wl_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_pic_CXX='`$ECHO "X$lt_prog_compiler_pic_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_static_CXX='`$ECHO "X$lt_prog_compiler_static_CXX" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o_CXX='`$ECHO "X$lt_cv_prog_compiler_c_o_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_need_lc_CXX='`$ECHO "X$archive_cmds_need_lc_CXX" | $Xsed -e "$delay_single_quote_subst"`' enable_shared_with_static_runtimes_CXX='`$ECHO "X$enable_shared_with_static_runtimes_CXX" | $Xsed -e "$delay_single_quote_subst"`' export_dynamic_flag_spec_CXX='`$ECHO "X$export_dynamic_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' whole_archive_flag_spec_CXX='`$ECHO "X$whole_archive_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_needs_object_CXX='`$ECHO "X$compiler_needs_object_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_new_cmds_CXX='`$ECHO "X$old_archive_from_new_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds_CXX='`$ECHO "X$old_archive_from_expsyms_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_CXX='`$ECHO "X$archive_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' archive_expsym_cmds_CXX='`$ECHO "X$archive_expsym_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' module_cmds_CXX='`$ECHO "X$module_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' module_expsym_cmds_CXX='`$ECHO "X$module_expsym_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' with_gnu_ld_CXX='`$ECHO "X$with_gnu_ld_CXX" | $Xsed -e "$delay_single_quote_subst"`' allow_undefined_flag_CXX='`$ECHO "X$allow_undefined_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' no_undefined_flag_CXX='`$ECHO "X$no_undefined_flag_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_CXX='`$ECHO "X$hardcode_libdir_flag_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_ld_CXX='`$ECHO "X$hardcode_libdir_flag_spec_ld_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_separator_CXX='`$ECHO "X$hardcode_libdir_separator_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_CXX='`$ECHO "X$hardcode_direct_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_absolute_CXX='`$ECHO "X$hardcode_direct_absolute_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_minus_L_CXX='`$ECHO "X$hardcode_minus_L_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_shlibpath_var_CXX='`$ECHO "X$hardcode_shlibpath_var_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_automatic_CXX='`$ECHO "X$hardcode_automatic_CXX" | $Xsed -e "$delay_single_quote_subst"`' inherit_rpath_CXX='`$ECHO "X$inherit_rpath_CXX" | $Xsed -e "$delay_single_quote_subst"`' link_all_deplibs_CXX='`$ECHO "X$link_all_deplibs_CXX" | $Xsed -e "$delay_single_quote_subst"`' fix_srcfile_path_CXX='`$ECHO "X$fix_srcfile_path_CXX" | $Xsed -e "$delay_single_quote_subst"`' always_export_symbols_CXX='`$ECHO "X$always_export_symbols_CXX" | $Xsed -e "$delay_single_quote_subst"`' export_symbols_cmds_CXX='`$ECHO "X$export_symbols_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' exclude_expsyms_CXX='`$ECHO "X$exclude_expsyms_CXX" | $Xsed -e "$delay_single_quote_subst"`' include_expsyms_CXX='`$ECHO "X$include_expsyms_CXX" | $Xsed -e "$delay_single_quote_subst"`' prelink_cmds_CXX='`$ECHO "X$prelink_cmds_CXX" | $Xsed -e "$delay_single_quote_subst"`' file_list_spec_CXX='`$ECHO "X$file_list_spec_CXX" | $Xsed -e "$delay_single_quote_subst"`' hardcode_action_CXX='`$ECHO "X$hardcode_action_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_dirs_CXX='`$ECHO "X$compiler_lib_search_dirs_CXX" | $Xsed -e "$delay_single_quote_subst"`' predep_objects_CXX='`$ECHO "X$predep_objects_CXX" | $Xsed -e "$delay_single_quote_subst"`' postdep_objects_CXX='`$ECHO "X$postdep_objects_CXX" | $Xsed -e "$delay_single_quote_subst"`' predeps_CXX='`$ECHO "X$predeps_CXX" | $Xsed -e "$delay_single_quote_subst"`' postdeps_CXX='`$ECHO "X$postdeps_CXX" | $Xsed -e "$delay_single_quote_subst"`' compiler_lib_search_path_CXX='`$ECHO "X$compiler_lib_search_path_CXX" | $Xsed -e "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ AR \ AR_FLAGS \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ SHELL \ ECHO \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_wl \ lt_prog_compiler_pic \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_flag_spec_ld \ hardcode_libdir_separator \ fix_srcfile_path \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ finish_eval \ old_striplib \ striplib \ compiler_lib_search_dirs \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ LD_CXX \ compiler_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_static_CXX \ lt_cv_prog_compiler_c_o_CXX \ export_dynamic_flag_spec_CXX \ whole_archive_flag_spec_CXX \ compiler_needs_object_CXX \ with_gnu_ld_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_flag_spec_ld_CXX \ hardcode_libdir_separator_CXX \ fix_srcfile_path_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX \ file_list_spec_CXX \ compiler_lib_search_dirs_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ export_symbols_cmds_CXX \ prelink_cmds_CXX; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\$0 --fallback-echo"') lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\$0 --fallback-echo"\$/\$0 --fallback-echo"/'\` ;; esac ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "build-aux/config.h") CONFIG_HEADERS="$CONFIG_HEADERS build-aux/config.h" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "scripts/gtest-config") CONFIG_FILES="$CONFIG_FILES scripts/gtest-config" ;; "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; *) as_fn_error "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= trap 'exit_status=$? { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error "cannot create a temporary directory in ." "$LINENO" 5 # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '$'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$tmp/subs1.awk" > "$tmp/subs.awk" \ || as_fn_error "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=/{ s/:*\$(srcdir):*/:/ s/:*\${srcdir}:*/:/ s/:*@srcdir@:*/:/ s/^\([^=]*=[ ]*\):*/\1/ s/:*$// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_t=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_t"; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$tmp/stdin" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$tmp/subs.awk" >$tmp/out \ || as_fn_error "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' "$tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&2;} rm -f "$tmp/stdin" case $ac_file in -) cat "$tmp/out" && rm -f "$tmp/out";; *) rm -f "$ac_file" && mv "$tmp/out" "$ac_file";; esac \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" } >"$tmp/config.h" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$tmp/config.h" "$ac_file" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "scripts/gtest-config":F) chmod +x scripts/gtest-config ;; "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags="CXX " # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == "file_magic". file_magic_cmd=$lt_file_magic_cmd # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # The name of the directory that contains temporary libtool files. objdir=$objdir # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that does not interpret backslashes. ECHO=$lt_ECHO # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # If ld is used when linking, flag to hardcode \$libdir into a binary # during linking. This must work even if \$libdir does not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path=$lt_fix_srcfile_path # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects postdep_objects=$lt_postdep_objects predeps=$lt_predeps postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain="$ac_aux_dir/ltmain.sh" # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $* )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[^=]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[^.]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$@"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$1" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1+=\$2" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1=\$$1\$2" } _LT_EOF ;; esac sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" cat <<_LT_EOF >> "$ofile" # ### BEGIN LIBTOOL TAG CONFIG: CXX # The linker used to build libraries. LD=$lt_LD_CXX # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds_CXX # A language specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU compiler? with_gcc=$GCC_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object_CXX # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld_CXX # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # If ld is used when linking, flag to hardcode \$libdir into a binary # during linking. This must work even if \$libdir does not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_CXX # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute_CXX # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic_CXX # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath_CXX # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path=$lt_fix_srcfile_path_CXX # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds_CXX # Specify filename containing input files. file_list_spec=$lt_file_list_spec_CXX # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects_CXX postdep_objects=$lt_postdep_objects_CXX predeps=$lt_predeps_CXX postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # ### END LIBTOOL TAG CONFIG: CXX _LT_EOF ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit $? fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi synergy-1.4.12-Source/tools/gtest-1.6.0/configure.ac0000600000175000017500000000501711561126632021731 0ustar synergysynergym4_include(m4/acx_pthread.m4) # At this point, the Xcode project assumes the version string will be three # integers separated by periods and surrounded by square brackets (e.g. # "[1.0.1]"). It also asumes that there won't be any closing parenthesis # between "AC_INIT(" and the closing ")" including comments and strings. AC_INIT([Google C++ Testing Framework], [1.6.0], [googletestframework@googlegroups.com], [gtest]) # Provide various options to initialize the Autoconf and configure processes. AC_PREREQ([2.59]) AC_CONFIG_SRCDIR([./COPYING]) AC_CONFIG_MACRO_DIR([m4]) AC_CONFIG_AUX_DIR([build-aux]) AC_CONFIG_HEADERS([build-aux/config.h]) AC_CONFIG_FILES([Makefile]) AC_CONFIG_FILES([scripts/gtest-config], [chmod +x scripts/gtest-config]) # Initialize Automake with various options. We require at least v1.9, prevent # pedantic complaints about package files, and enable various distribution # targets. AM_INIT_AUTOMAKE([1.9 dist-bzip2 dist-zip foreign subdir-objects]) # Check for programs used in building Google Test. AC_PROG_CC AC_PROG_CXX AC_LANG([C++]) AC_PROG_LIBTOOL # TODO(chandlerc@google.com): Currently we aren't running the Python tests # against the interpreter detected by AM_PATH_PYTHON, and so we condition # HAVE_PYTHON by requiring "python" to be in the PATH, and that interpreter's # version to be >= 2.3. This will allow the scripts to use a "/usr/bin/env" # hashbang. PYTHON= # We *do not* allow the user to specify a python interpreter AC_PATH_PROG([PYTHON],[python],[:]) AS_IF([test "$PYTHON" != ":"], [AM_PYTHON_CHECK_VERSION([$PYTHON],[2.3],[:],[PYTHON=":"])]) AM_CONDITIONAL([HAVE_PYTHON],[test "$PYTHON" != ":"]) # Configure pthreads. AC_ARG_WITH([pthreads], [AS_HELP_STRING([--with-pthreads], [use pthreads (default is yes)])], [with_pthreads=$withval], [with_pthreads=check]) have_pthreads=no AS_IF([test "x$with_pthreads" != "xno"], [ACX_PTHREAD( [], [AS_IF([test "x$with_pthreads" != "xcheck"], [AC_MSG_FAILURE( [--with-pthreads was specified, but unable to be used])])]) have_pthreads="$acx_pthread_ok"]) AM_CONDITIONAL([HAVE_PTHREADS],[test "x$have_pthreads" == "xyes"]) AC_SUBST(PTHREAD_CFLAGS) AC_SUBST(PTHREAD_LIBS) # TODO(chandlerc@google.com) Check for the necessary system headers. # TODO(chandlerc@google.com) Check the types, structures, and other compiler # and architecture characteristics. # Output the generated files. No further autoconf macros may be used. AC_OUTPUT synergy-1.4.12-Source/tools/gtest-1.6.0/CONTRIBUTORS0000600000175000017500000000251611561126632021324 0ustar synergysynergy# This file contains a list of people who've made non-trivial # contribution to the Google C++ Testing Framework project. People # who commit code to the project are encouraged to add their names # here. Please keep the list sorted by first names. Ajay Joshi Balázs Dán Bharat Mediratta Chandler Carruth Chris Prince Chris Taylor Dan Egnor Eric Roman Hady Zalek Jeffrey Yasskin Jói Sigurðsson Keir Mierle Keith Ray Kenton Varda Manuel Klimek Markus Heule Mika Raento Miklós Fazekas Pasi Valminen Patrick Hanna Patrick Riley Peter Kaminski Preston Jackson Rainer Klaffenboeck Russ Cox Russ Rufer Sean Mcafee Sigurður Ãsgeirsson Tracy Bialik Vadim Berman Vlad Losev Zhanyong Wan synergy-1.4.12-Source/tools/gtest-1.6.0/COPYING0000600000175000017500000000270311561126632020475 0ustar synergysynergyCopyright 2008, Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * 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. * Neither the name of Google Inc. 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 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. synergy-1.4.12-Source/tools/gtest-1.6.0/fused-src/0000700000175000017500000000000012140644175021332 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/fused-src/gtest/0000700000175000017500000000000012140644175022460 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/fused-src/gtest/gtest-all.cc0000600000175000017500000122217411561126632024675 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // Google C++ Testing Framework (Google Test) // // Sometimes it's desirable to build Google Test by compiling a single file. // This file serves this purpose. // This line ensures that gtest.h can be compiled on its own, even // when it's fused. #include "gtest/gtest.h" // The following lines pull in the real gtest *.cc files. // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Utilities for testing Google Test itself and code that uses Google Test // (e.g. frameworks built on top of Google Test). #ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #define GTEST_INCLUDE_GTEST_GTEST_SPI_H_ namespace testing { // This helper class can be used to mock out Google Test failure reporting // so that we can test Google Test or code that builds on Google Test. // // An object of this class appends a TestPartResult object to the // TestPartResultArray object given in the constructor whenever a Google Test // failure is reported. It can either intercept only failures that are // generated in the same thread that created this object or it can intercept // all generated failures. The scope of this mock object can be controlled with // the second argument to the two arguments constructor. class GTEST_API_ ScopedFakeTestPartResultReporter : public TestPartResultReporterInterface { public: // The two possible mocking modes of this object. enum InterceptMode { INTERCEPT_ONLY_CURRENT_THREAD, // Intercepts only thread local failures. INTERCEPT_ALL_THREADS // Intercepts all failures. }; // The c'tor sets this object as the test part result reporter used // by Google Test. The 'result' parameter specifies where to report the // results. This reporter will only catch failures generated in the current // thread. DEPRECATED explicit ScopedFakeTestPartResultReporter(TestPartResultArray* result); // Same as above, but you can choose the interception scope of this object. ScopedFakeTestPartResultReporter(InterceptMode intercept_mode, TestPartResultArray* result); // The d'tor restores the previous test part result reporter. virtual ~ScopedFakeTestPartResultReporter(); // Appends the TestPartResult object to the TestPartResultArray // received in the constructor. // // This method is from the TestPartResultReporterInterface // interface. virtual void ReportTestPartResult(const TestPartResult& result); private: void Init(); const InterceptMode intercept_mode_; TestPartResultReporterInterface* old_reporter_; TestPartResultArray* const result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedFakeTestPartResultReporter); }; namespace internal { // A helper class for implementing EXPECT_FATAL_FAILURE() and // EXPECT_NONFATAL_FAILURE(). Its destructor verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. class GTEST_API_ SingleFailureChecker { public: // The constructor remembers the arguments. SingleFailureChecker(const TestPartResultArray* results, TestPartResult::Type type, const string& substr); ~SingleFailureChecker(); private: const TestPartResultArray* const results_; const TestPartResult::Type type_; const string substr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker); }; } // namespace internal } // namespace testing // A set of macros for testing Google Test assertions or code that's expected // to generate Google Test fatal failures. It verifies that the given // statement will cause exactly one fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_FATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_FATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - 'statement' cannot reference local non-static variables or // non-static members of the current object. // - 'statement' cannot return a value. // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. The AcceptsMacroThatExpandsToUnprotectedComma test in // gtest_unittest.cc will fail to compile if we do that. #define EXPECT_FATAL_FAILURE(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ALL_THREADS, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) // A macro for testing Google Test assertions or code that's expected to // generate Google Test non-fatal failures. It asserts that the given // statement will cause exactly one non-fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_NONFATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // 'statement' is allowed to reference local variables and members of // the current object. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. If we do that, the code won't compile when the user gives // EXPECT_NONFATAL_FAILURE() a statement that contains a macro that // expands to code containing an unprotected comma. The // AcceptsMacroThatExpandsToUnprotectedComma test in gtest_unittest.cc // catches that. // // For the same reason, we have to write // if (::testing::internal::AlwaysTrue()) { statement; } // instead of // GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) // to avoid an MSVC warning on unreachable code. #define EXPECT_NONFATAL_FAILURE(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS,\ >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #endif // GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #include #include #include #include #include #include #include #include #include // NOLINT #include #include #if GTEST_OS_LINUX // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # include // NOLINT # include // NOLINT // Declares vsnprintf(). This header is not available on Windows. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # include #elif GTEST_OS_SYMBIAN # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT #elif GTEST_OS_ZOS # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT // On z/OS we additionally need strings.h for strcasecmp. # include // NOLINT #elif GTEST_OS_WINDOWS_MOBILE // We are on Windows CE. # include // NOLINT #elif GTEST_OS_WINDOWS // We are on Windows proper. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # if GTEST_OS_WINDOWS_MINGW // MinGW has gettimeofday() but not _ftime64(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). // TODO(kenton@google.com): There are other ways to get the time on // Windows, like GetTickCount() or GetSystemTimeAsFileTime(). MinGW // supports these. consider using them instead. # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # endif // GTEST_OS_WINDOWS_MINGW // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT #else // Assume other platforms have gettimeofday(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT # include // NOLINT #endif // GTEST_OS_LINUX #if GTEST_HAS_EXCEPTIONS # include #endif #if GTEST_CAN_STREAM_RESULTS_ # include // NOLINT # include // NOLINT #endif // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Utility functions and classes used by the Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // // This file contains purely Google Test's internal implementation. Please // DO NOT #INCLUDE IT IN A USER PROGRAM. #ifndef GTEST_SRC_GTEST_INTERNAL_INL_H_ #define GTEST_SRC_GTEST_INTERNAL_INL_H_ // GTEST_IMPLEMENTATION_ is defined to 1 iff the current translation unit is // part of Google Test's implementation; otherwise it's undefined. #if !GTEST_IMPLEMENTATION_ // A user is trying to include this from his code - just say no. # error "gtest-internal-inl.h is part of Google Test's internal implementation." # error "It must not be included except by Google Test itself." #endif // GTEST_IMPLEMENTATION_ #ifndef _WIN32_WCE # include #endif // !_WIN32_WCE #include #include // For strtoll/_strtoul64/malloc/free. #include // For memmove. #include #include #include #if GTEST_OS_WINDOWS # include // NOLINT #endif // GTEST_OS_WINDOWS namespace testing { // Declares the flags. // // We don't want the users to modify this flag in the code, but want // Google Test's own unit tests to be able to access it. Therefore we // declare it here as opposed to in gtest.h. GTEST_DECLARE_bool_(death_test_use_fork); namespace internal { // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). GTEST_API_ extern const TypeId kTestTypeIdInGoogleTest; // Names of the flags (needed for parsing Google Test flags). const char kAlsoRunDisabledTestsFlag[] = "also_run_disabled_tests"; const char kBreakOnFailureFlag[] = "break_on_failure"; const char kCatchExceptionsFlag[] = "catch_exceptions"; const char kColorFlag[] = "color"; const char kFilterFlag[] = "filter"; const char kListTestsFlag[] = "list_tests"; const char kOutputFlag[] = "output"; const char kPrintTimeFlag[] = "print_time"; const char kRandomSeedFlag[] = "random_seed"; const char kRepeatFlag[] = "repeat"; const char kShuffleFlag[] = "shuffle"; const char kStackTraceDepthFlag[] = "stack_trace_depth"; const char kStreamResultToFlag[] = "stream_result_to"; const char kThrowOnFailureFlag[] = "throw_on_failure"; // A valid random seed must be in [1, kMaxRandomSeed]. const int kMaxRandomSeed = 99999; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. GTEST_API_ extern bool g_help_flag; // Returns the current time in milliseconds. GTEST_API_ TimeInMillis GetTimeInMillis(); // Returns true iff Google Test should use colors in the output. GTEST_API_ bool ShouldUseColor(bool stdout_is_tty); // Formats the given time in milliseconds as seconds. GTEST_API_ std::string FormatTimeInMillisAsSeconds(TimeInMillis ms); // Parses a string for an Int32 flag, in the form of "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. GTEST_API_ bool ParseInt32Flag( const char* str, const char* flag, Int32* value); // Returns a random seed in range [1, kMaxRandomSeed] based on the // given --gtest_random_seed flag value. inline int GetRandomSeedFromFlag(Int32 random_seed_flag) { const unsigned int raw_seed = (random_seed_flag == 0) ? static_cast(GetTimeInMillis()) : static_cast(random_seed_flag); // Normalizes the actual seed to range [1, kMaxRandomSeed] such that // it's easy to type. const int normalized_seed = static_cast((raw_seed - 1U) % static_cast(kMaxRandomSeed)) + 1; return normalized_seed; } // Returns the first valid random seed after 'seed'. The behavior is // undefined if 'seed' is invalid. The seed after kMaxRandomSeed is // considered to be 1. inline int GetNextRandomSeed(int seed) { GTEST_CHECK_(1 <= seed && seed <= kMaxRandomSeed) << "Invalid random seed " << seed << " - must be in [1, " << kMaxRandomSeed << "]."; const int next_seed = seed + 1; return (next_seed > kMaxRandomSeed) ? 1 : next_seed; } // This class saves the values of all Google Test flags in its c'tor, and // restores them in its d'tor. class GTestFlagSaver { public: // The c'tor. GTestFlagSaver() { also_run_disabled_tests_ = GTEST_FLAG(also_run_disabled_tests); break_on_failure_ = GTEST_FLAG(break_on_failure); catch_exceptions_ = GTEST_FLAG(catch_exceptions); color_ = GTEST_FLAG(color); death_test_style_ = GTEST_FLAG(death_test_style); death_test_use_fork_ = GTEST_FLAG(death_test_use_fork); filter_ = GTEST_FLAG(filter); internal_run_death_test_ = GTEST_FLAG(internal_run_death_test); list_tests_ = GTEST_FLAG(list_tests); output_ = GTEST_FLAG(output); print_time_ = GTEST_FLAG(print_time); random_seed_ = GTEST_FLAG(random_seed); repeat_ = GTEST_FLAG(repeat); shuffle_ = GTEST_FLAG(shuffle); stack_trace_depth_ = GTEST_FLAG(stack_trace_depth); stream_result_to_ = GTEST_FLAG(stream_result_to); throw_on_failure_ = GTEST_FLAG(throw_on_failure); } // The d'tor is not virtual. DO NOT INHERIT FROM THIS CLASS. ~GTestFlagSaver() { GTEST_FLAG(also_run_disabled_tests) = also_run_disabled_tests_; GTEST_FLAG(break_on_failure) = break_on_failure_; GTEST_FLAG(catch_exceptions) = catch_exceptions_; GTEST_FLAG(color) = color_; GTEST_FLAG(death_test_style) = death_test_style_; GTEST_FLAG(death_test_use_fork) = death_test_use_fork_; GTEST_FLAG(filter) = filter_; GTEST_FLAG(internal_run_death_test) = internal_run_death_test_; GTEST_FLAG(list_tests) = list_tests_; GTEST_FLAG(output) = output_; GTEST_FLAG(print_time) = print_time_; GTEST_FLAG(random_seed) = random_seed_; GTEST_FLAG(repeat) = repeat_; GTEST_FLAG(shuffle) = shuffle_; GTEST_FLAG(stack_trace_depth) = stack_trace_depth_; GTEST_FLAG(stream_result_to) = stream_result_to_; GTEST_FLAG(throw_on_failure) = throw_on_failure_; } private: // Fields for saving the original values of flags. bool also_run_disabled_tests_; bool break_on_failure_; bool catch_exceptions_; String color_; String death_test_style_; bool death_test_use_fork_; String filter_; String internal_run_death_test_; bool list_tests_; String output_; bool print_time_; bool pretty_; internal::Int32 random_seed_; internal::Int32 repeat_; bool shuffle_; internal::Int32 stack_trace_depth_; String stream_result_to_; bool throw_on_failure_; } GTEST_ATTRIBUTE_UNUSED_; // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. GTEST_API_ char* CodePointToUtf8(UInt32 code_point, char* str); // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. GTEST_API_ String WideStringToUtf8(const wchar_t* str, int num_chars); // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded(); // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (e.g., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. GTEST_API_ bool ShouldShard(const char* total_shards_str, const char* shard_index_str, bool in_subprocess_for_death_test); // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error and // and aborts. GTEST_API_ Int32 Int32FromEnvOrDie(const char* env_var, Int32 default_val); // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. GTEST_API_ bool ShouldRunTestOnShard( int total_shards, int shard_index, int test_id); // STL container utilities. // Returns the number of elements in the given container that satisfy // the given predicate. template inline int CountIf(const Container& c, Predicate predicate) { // Implemented as an explicit loop since std::count_if() in libCstd on // Solaris has a non-standard signature. int count = 0; for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) { if (predicate(*it)) ++count; } return count; } // Applies a function/functor to each element in the container. template void ForEach(const Container& c, Functor functor) { std::for_each(c.begin(), c.end(), functor); } // Returns the i-th element of the vector, or default_value if i is not // in range [0, v.size()). template inline E GetElementOr(const std::vector& v, int i, E default_value) { return (i < 0 || i >= static_cast(v.size())) ? default_value : v[i]; } // Performs an in-place shuffle of a range of the vector's elements. // 'begin' and 'end' are element indices as an STL-style range; // i.e. [begin, end) are shuffled, where 'end' == size() means to // shuffle to the end of the vector. template void ShuffleRange(internal::Random* random, int begin, int end, std::vector* v) { const int size = static_cast(v->size()); GTEST_CHECK_(0 <= begin && begin <= size) << "Invalid shuffle range start " << begin << ": must be in range [0, " << size << "]."; GTEST_CHECK_(begin <= end && end <= size) << "Invalid shuffle range finish " << end << ": must be in range [" << begin << ", " << size << "]."; // Fisher-Yates shuffle, from // http://en.wikipedia.org/wiki/Fisher-Yates_shuffle for (int range_width = end - begin; range_width >= 2; range_width--) { const int last_in_range = begin + range_width - 1; const int selected = begin + random->Generate(range_width); std::swap((*v)[selected], (*v)[last_in_range]); } } // Performs an in-place shuffle of the vector's elements. template inline void Shuffle(internal::Random* random, std::vector* v) { ShuffleRange(random, 0, static_cast(v->size()), v); } // A function for deleting an object. Handy for being used as a // functor. template static void Delete(T* x) { delete x; } // A predicate that checks the key of a TestProperty against a known key. // // TestPropertyKeyIs is copyable. class TestPropertyKeyIs { public: // Constructor. // // TestPropertyKeyIs has NO default constructor. explicit TestPropertyKeyIs(const char* key) : key_(key) {} // Returns true iff the test name of test property matches on key_. bool operator()(const TestProperty& test_property) const { return String(test_property.key()).Compare(key_) == 0; } private: String key_; }; // Class UnitTestOptions. // // This class contains functions for processing options the user // specifies when running the tests. It has only static members. // // In most cases, the user can specify an option using either an // environment variable or a command line flag. E.g. you can set the // test filter using either GTEST_FILTER or --gtest_filter. If both // the variable and the flag are present, the latter overrides the // former. class GTEST_API_ UnitTestOptions { public: // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. static String GetOutputFormat(); // Returns the absolute path of the requested output file, or the // default (test_detail.xml in the original working directory) if // none was explicitly specified. static String GetAbsolutePathToOutputFile(); // Functions for processing the gtest_filter flag. // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. static bool PatternMatchesString(const char *pattern, const char *str); // Returns true iff the user-specified filter matches the test case // name and the test name. static bool FilterMatchesTest(const String &test_case_name, const String &test_name); #if GTEST_OS_WINDOWS // Function for supporting the gtest_catch_exception flag. // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. static int GTestShouldProcessSEH(DWORD exception_code); #endif // GTEST_OS_WINDOWS // Returns true if "name" matches the ':' separated list of glob-style // filters in "filter". static bool MatchesFilter(const String& name, const char* filter); }; // Returns the current application's name, removing directory path if that // is present. Used by UnitTestOptions::GetOutputFile. GTEST_API_ FilePath GetCurrentExecutableName(); // The role interface for getting the OS stack trace as a string. class OsStackTraceGetterInterface { public: OsStackTraceGetterInterface() {} virtual ~OsStackTraceGetterInterface() {} // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. virtual String CurrentStackTrace(int max_depth, int skip_count) = 0; // UponLeavingGTest() should be called immediately before Google Test calls // user code. It saves some information about the current stack that // CurrentStackTrace() will use to find and hide Google Test stack frames. virtual void UponLeavingGTest() = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetterInterface); }; // A working implementation of the OsStackTraceGetterInterface interface. class OsStackTraceGetter : public OsStackTraceGetterInterface { public: OsStackTraceGetter() : caller_frame_(NULL) {} virtual String CurrentStackTrace(int max_depth, int skip_count); virtual void UponLeavingGTest(); // This string is inserted in place of stack frames that are part of // Google Test's implementation. static const char* const kElidedFramesMarker; private: Mutex mutex_; // protects all internal state // We save the stack frame below the frame that calls user code. // We do this because the address of the frame immediately below // the user code changes between the call to UponLeavingGTest() // and any calls to CurrentStackTrace() from within the user code. void* caller_frame_; GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter); }; // Information about a Google Test trace point. struct TraceInfo { const char* file; int line; String message; }; // This is the default global test part result reporter used in UnitTestImpl. // This class should only be used by UnitTestImpl. class DefaultGlobalTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultGlobalTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. Reports the test part // result in the current test. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultGlobalTestPartResultReporter); }; // This is the default per thread test part result reporter used in // UnitTestImpl. This class should only be used by UnitTestImpl. class DefaultPerThreadTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultPerThreadTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. The implementation just // delegates to the current global test part result reporter of *unit_test_. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultPerThreadTestPartResultReporter); }; // The private implementation of the UnitTest class. We don't protect // the methods under a mutex, as this class is not accessible by a // user and the UnitTest class that delegates work to this class does // proper locking. class GTEST_API_ UnitTestImpl { public: explicit UnitTestImpl(UnitTest* parent); virtual ~UnitTestImpl(); // There are two different ways to register your own TestPartResultReporter. // You can register your own repoter to listen either only for test results // from the current thread or for results from all threads. // By default, each per-thread test result repoter just passes a new // TestPartResult to the global test result reporter, which registers the // test part result for the currently running test. // Returns the global test part result reporter. TestPartResultReporterInterface* GetGlobalTestPartResultReporter(); // Sets the global test part result reporter. void SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter); // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* GetTestPartResultReporterForCurrentThread(); // Sets the test part result reporter for the current thread. void SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter); // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const { return !Failed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const { return failed_test_case_count() > 0 || ad_hoc_test_result()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[i]; } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i) { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[index]; } // Provides access to the event listener list. TestEventListeners* listeners() { return &listeners_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* current_test_result(); // Returns the TestResult for the ad hoc test. const TestResult* ad_hoc_test_result() const { return &ad_hoc_test_result_; } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter // are the same; otherwise, deletes the old getter and makes the // input the current getter. void set_os_stack_trace_getter(OsStackTraceGetterInterface* getter); // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* os_stack_trace_getter(); // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String CurrentOsStackTraceExceptTop(int skip_count); // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Adds a TestInfo to the unit test. // // Arguments: // // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // test_info: the TestInfo object void AddTestInfo(Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, TestInfo* test_info) { // In order to support thread-safe death tests, we need to // remember the original working directory when the test program // was first invoked. We cannot do this in RUN_ALL_TESTS(), as // the user may have changed the current directory before calling // RUN_ALL_TESTS(). Therefore we capture the current directory in // AddTestInfo(), which is called to register a TEST or TEST_F // before main() is reached. if (original_working_dir_.IsEmpty()) { original_working_dir_.Set(FilePath::GetCurrentDir()); GTEST_CHECK_(!original_working_dir_.IsEmpty()) << "Failed to get the current working directory."; } GetTestCase(test_info->test_case_name(), test_info->type_param(), set_up_tc, tear_down_tc)->AddTestInfo(test_info); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. internal::ParameterizedTestCaseRegistry& parameterized_test_registry() { return parameterized_test_registry_; } #endif // GTEST_HAS_PARAM_TEST // Sets the TestCase object for the test that's currently running. void set_current_test_case(TestCase* a_current_test_case) { current_test_case_ = a_current_test_case; } // Sets the TestInfo object for the test that's currently running. If // current_test_info is NULL, the assertion results will be stored in // ad_hoc_test_result_. void set_current_test_info(TestInfo* a_current_test_info) { current_test_info_ = a_current_test_info; } // Registers all parameterized tests defined using TEST_P and // INSTANTIATE_TEST_CASE_P, creating regular tests for each test/parameter // combination. This method can be called more then once; it has guards // protecting from registering the tests more then once. If // value-parameterized tests are disabled, RegisterParameterizedTests is // present but does nothing. void RegisterParameterizedTests(); // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, this test is considered to be failed, but // the rest of the tests will still be run. bool RunAllTests(); // Clears the results of all tests, except the ad hoc tests. void ClearNonAdHocTestResult() { ForEach(test_cases_, TestCase::ClearTestCaseResult); } // Clears the results of ad-hoc test assertions. void ClearAdHocTestResult() { ad_hoc_test_result_.Clear(); } enum ReactionToSharding { HONOR_SHARDING_PROTOCOL, IGNORE_SHARDING_PROTOCOL }; // Matches the full name of each test against the user-specified // filter to decide whether the test should run, then records the // result in each TestCase and TestInfo object. // If shard_tests == HONOR_SHARDING_PROTOCOL, further filters tests // based on sharding variables in the environment. // Returns the number of tests that should run. int FilterTests(ReactionToSharding shard_tests); // Prints the names of the tests matching the user-specified filter flag. void ListTestsMatchingFilter(); const TestCase* current_test_case() const { return current_test_case_; } TestInfo* current_test_info() { return current_test_info_; } const TestInfo* current_test_info() const { return current_test_info_; } // Returns the vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector& environments() { return environments_; } // Getters for the per-thread Google Test trace stack. std::vector& gtest_trace_stack() { return *(gtest_trace_stack_.pointer()); } const std::vector& gtest_trace_stack() const { return gtest_trace_stack_.get(); } #if GTEST_HAS_DEATH_TEST void InitDeathTestSubprocessControlInfo() { internal_run_death_test_flag_.reset(ParseInternalRunDeathTestFlag()); } // Returns a pointer to the parsed --gtest_internal_run_death_test // flag, or NULL if that flag was not specified. // This information is useful only in a death test child process. // Must not be called before a call to InitGoogleTest. const InternalRunDeathTestFlag* internal_run_death_test_flag() const { return internal_run_death_test_flag_.get(); } // Returns a pointer to the current death test factory. internal::DeathTestFactory* death_test_factory() { return death_test_factory_.get(); } void SuppressTestEventsIfInSubprocess(); friend class ReplaceDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST // Initializes the event listener performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Initializes the event listener for streaming test results to a socket. // Must not be called before InitGoogleTest. void ConfigureStreamingOutput(); #endif // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void PostFlagParsingInit(); // Gets the random seed used at the start of the current test iteration. int random_seed() const { return random_seed_; } // Gets the random number generator. internal::Random* random() { return &random_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void ShuffleTests(); // Restores the test cases and tests to their order before the first shuffle. void UnshuffleTests(); // Returns the value of GTEST_FLAG(catch_exceptions) at the moment // UnitTest::Run() starts. bool catch_exceptions() const { return catch_exceptions_; } private: friend class ::testing::UnitTest; // Used by UnitTest::Run() to capture the state of // GTEST_FLAG(catch_exceptions) at the moment it starts. void set_catch_exceptions(bool value) { catch_exceptions_ = value; } // The UnitTest object that owns this implementation object. UnitTest* const parent_; // The working directory when the first TEST() or TEST_F() was // executed. internal::FilePath original_working_dir_; // The default test part result reporters. DefaultGlobalTestPartResultReporter default_global_test_part_result_reporter_; DefaultPerThreadTestPartResultReporter default_per_thread_test_part_result_reporter_; // Points to (but doesn't own) the global test part result reporter. TestPartResultReporterInterface* global_test_part_result_repoter_; // Protects read and write access to global_test_part_result_reporter_. internal::Mutex global_test_part_result_reporter_mutex_; // Points to (but doesn't own) the per-thread test part result reporter. internal::ThreadLocal per_thread_test_part_result_reporter_; // The vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector environments_; // The vector of TestCases in their original order. It owns the // elements in the vector. std::vector test_cases_; // Provides a level of indirection for the test case list to allow // easy shuffling and restoring the test case order. The i-th // element of this vector is the index of the i-th test case in the // shuffled order. std::vector test_case_indices_; #if GTEST_HAS_PARAM_TEST // ParameterizedTestRegistry object used to register value-parameterized // tests. internal::ParameterizedTestCaseRegistry parameterized_test_registry_; // Indicates whether RegisterParameterizedTests() has been called already. bool parameterized_tests_registered_; #endif // GTEST_HAS_PARAM_TEST // Index of the last death test case registered. Initially -1. int last_death_test_case_; // This points to the TestCase for the currently running test. It // changes as Google Test goes through one test case after another. // When no test is running, this is set to NULL and Google Test // stores assertion results in ad_hoc_test_result_. Initially NULL. TestCase* current_test_case_; // This points to the TestInfo for the currently running test. It // changes as Google Test goes through one test after another. When // no test is running, this is set to NULL and Google Test stores // assertion results in ad_hoc_test_result_. Initially NULL. TestInfo* current_test_info_; // Normally, a user only writes assertions inside a TEST or TEST_F, // or inside a function called by a TEST or TEST_F. Since Google // Test keeps track of which test is current running, it can // associate such an assertion with the test it belongs to. // // If an assertion is encountered when no TEST or TEST_F is running, // Google Test attributes the assertion result to an imaginary "ad hoc" // test, and records the result in ad_hoc_test_result_. TestResult ad_hoc_test_result_; // The list of event listeners that can be used to track events inside // Google Test. TestEventListeners listeners_; // The OS stack trace getter. Will be deleted when the UnitTest // object is destructed. By default, an OsStackTraceGetter is used, // but the user can set this field to use a custom getter if that is // desired. OsStackTraceGetterInterface* os_stack_trace_getter_; // True iff PostFlagParsingInit() has been called. bool post_flag_parse_init_performed_; // The random number seed used at the beginning of the test run. int random_seed_; // Our random number generator. internal::Random random_; // How long the test took to run, in milliseconds. TimeInMillis elapsed_time_; #if GTEST_HAS_DEATH_TEST // The decomposed components of the gtest_internal_run_death_test flag, // parsed when RUN_ALL_TESTS is called. internal::scoped_ptr internal_run_death_test_flag_; internal::scoped_ptr death_test_factory_; #endif // GTEST_HAS_DEATH_TEST // A per-thread stack of traces created by the SCOPED_TRACE() macro. internal::ThreadLocal > gtest_trace_stack_; // The value of GTEST_FLAG(catch_exceptions) at the moment RunAllTests() // starts. bool catch_exceptions_; GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTestImpl); }; // class UnitTestImpl // Convenience function for accessing the global UnitTest // implementation object. inline UnitTestImpl* GetUnitTestImpl() { return UnitTest::GetInstance()->impl(); } #if GTEST_USES_SIMPLE_RE // Internal helper functions for implementing the simple regular // expression matcher. GTEST_API_ bool IsInSet(char ch, const char* str); GTEST_API_ bool IsAsciiDigit(char ch); GTEST_API_ bool IsAsciiPunct(char ch); GTEST_API_ bool IsRepeat(char ch); GTEST_API_ bool IsAsciiWhiteSpace(char ch); GTEST_API_ bool IsAsciiWordChar(char ch); GTEST_API_ bool IsValidEscape(char ch); GTEST_API_ bool AtomMatchesChar(bool escaped, char pattern, char ch); GTEST_API_ bool ValidateRegex(const char* regex); GTEST_API_ bool MatchRegexAtHead(const char* regex, const char* str); GTEST_API_ bool MatchRepetitionAndRegexAtHead( bool escaped, char ch, char repeat, const char* regex, const char* str); GTEST_API_ bool MatchRegexAnywhere(const char* regex, const char* str); #endif // GTEST_USES_SIMPLE_RE // Parses the command line for Google Test flags, without initializing // other parts of Google Test. GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, char** argv); GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv); #if GTEST_HAS_DEATH_TEST // Returns the message describing the last system error, regardless of the // platform. GTEST_API_ String GetLastErrnoDescription(); # if GTEST_OS_WINDOWS // Provides leak-safe Windows kernel handle ownership. class AutoHandle { public: AutoHandle() : handle_(INVALID_HANDLE_VALUE) {} explicit AutoHandle(HANDLE handle) : handle_(handle) {} ~AutoHandle() { Reset(); } HANDLE Get() const { return handle_; } void Reset() { Reset(INVALID_HANDLE_VALUE); } void Reset(HANDLE handle) { if (handle != handle_) { if (handle_ != INVALID_HANDLE_VALUE) ::CloseHandle(handle_); handle_ = handle; } } private: HANDLE handle_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AutoHandle); }; # endif // GTEST_OS_WINDOWS // Attempts to parse a string into a positive integer pointed to by the // number parameter. Returns true if that is possible. // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we can use // it here. template bool ParseNaturalNumber(const ::std::string& str, Integer* number) { // Fail fast if the given string does not begin with a digit; // this bypasses strtoXXX's "optional leading whitespace and plus // or minus sign" semantics, which are undesirable here. if (str.empty() || !IsDigit(str[0])) { return false; } errno = 0; char* end; // BiggestConvertible is the largest integer type that system-provided // string-to-number conversion routines can return. # if GTEST_OS_WINDOWS && !defined(__GNUC__) // MSVC and C++ Builder define __int64 instead of the standard long long. typedef unsigned __int64 BiggestConvertible; const BiggestConvertible parsed = _strtoui64(str.c_str(), &end, 10); # else typedef unsigned long long BiggestConvertible; // NOLINT const BiggestConvertible parsed = strtoull(str.c_str(), &end, 10); # endif // GTEST_OS_WINDOWS && !defined(__GNUC__) const bool parse_success = *end == '\0' && errno == 0; // TODO(vladl@google.com): Convert this to compile time assertion when it is // available. GTEST_CHECK_(sizeof(Integer) <= sizeof(parsed)); const Integer result = static_cast(parsed); if (parse_success && static_cast(result) == parsed) { *number = result; return true; } return false; } #endif // GTEST_HAS_DEATH_TEST // TestResult contains some private methods that should be hidden from // Google Test user but are required for testing. This class allow our tests // to access them. // // This class is supplied only for the purpose of testing Google Test's own // constructs. Do not use it in user tests, either directly or indirectly. class TestResultAccessor { public: static void RecordProperty(TestResult* test_result, const TestProperty& property) { test_result->RecordProperty(property); } static void ClearTestPartResults(TestResult* test_result) { test_result->ClearTestPartResults(); } static const std::vector& test_part_results( const TestResult& test_result) { return test_result.test_part_results(); } }; } // namespace internal } // namespace testing #endif // GTEST_SRC_GTEST_INTERNAL_INL_H_ #undef GTEST_IMPLEMENTATION_ #if GTEST_OS_WINDOWS # define vsnprintf _vsnprintf #endif // GTEST_OS_WINDOWS namespace testing { using internal::CountIf; using internal::ForEach; using internal::GetElementOr; using internal::Shuffle; // Constants. // A test whose test case name or test name matches this filter is // disabled and not run. static const char kDisableTestFilter[] = "DISABLED_*:*/DISABLED_*"; // A test case whose name matches this filter is considered a death // test case and will be run before test cases whose name doesn't // match this filter. static const char kDeathTestCaseFilter[] = "*DeathTest:*DeathTest/*"; // A test filter that matches everything. static const char kUniversalFilter[] = "*"; // The default output file for XML output. static const char kDefaultOutputFile[] = "test_detail.xml"; // The environment variable name for the test shard index. static const char kTestShardIndex[] = "GTEST_SHARD_INDEX"; // The environment variable name for the total number of test shards. static const char kTestTotalShards[] = "GTEST_TOTAL_SHARDS"; // The environment variable name for the test shard status file. static const char kTestShardStatusFile[] = "GTEST_SHARD_STATUS_FILE"; namespace internal { // The text used in failure messages to indicate the start of the // stack trace. const char kStackTraceMarker[] = "\nStack trace:\n"; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. bool g_help_flag = false; } // namespace internal GTEST_DEFINE_bool_( also_run_disabled_tests, internal::BoolFromGTestEnv("also_run_disabled_tests", false), "Run disabled tests too, in addition to the tests normally being run."); GTEST_DEFINE_bool_( break_on_failure, internal::BoolFromGTestEnv("break_on_failure", false), "True iff a failed assertion should be a debugger break-point."); GTEST_DEFINE_bool_( catch_exceptions, internal::BoolFromGTestEnv("catch_exceptions", true), "True iff " GTEST_NAME_ " should catch exceptions and treat them as test failures."); GTEST_DEFINE_string_( color, internal::StringFromGTestEnv("color", "auto"), "Whether to use colors in the output. Valid values: yes, no, " "and auto. 'auto' means to use colors if the output is " "being sent to a terminal and the TERM environment variable " "is set to xterm, xterm-color, xterm-256color, linux or cygwin."); GTEST_DEFINE_string_( filter, internal::StringFromGTestEnv("filter", kUniversalFilter), "A colon-separated list of glob (not regex) patterns " "for filtering the tests to run, optionally followed by a " "'-' and a : separated list of negative patterns (tests to " "exclude). A test is run if it matches one of the positive " "patterns and does not match any of the negative patterns."); GTEST_DEFINE_bool_(list_tests, false, "List all tests without running them."); GTEST_DEFINE_string_( output, internal::StringFromGTestEnv("output", ""), "A format (currently must be \"xml\"), optionally followed " "by a colon and an output file name or directory. A directory " "is indicated by a trailing pathname separator. " "Examples: \"xml:filename.xml\", \"xml::directoryname/\". " "If a directory is specified, output files will be created " "within that directory, with file-names based on the test " "executable's name and, if necessary, made unique by adding " "digits."); GTEST_DEFINE_bool_( print_time, internal::BoolFromGTestEnv("print_time", true), "True iff " GTEST_NAME_ " should display elapsed time in text output."); GTEST_DEFINE_int32_( random_seed, internal::Int32FromGTestEnv("random_seed", 0), "Random number seed to use when shuffling test orders. Must be in range " "[1, 99999], or 0 to use a seed based on the current time."); GTEST_DEFINE_int32_( repeat, internal::Int32FromGTestEnv("repeat", 1), "How many times to repeat each test. Specify a negative number " "for repeating forever. Useful for shaking out flaky tests."); GTEST_DEFINE_bool_( show_internal_stack_frames, false, "True iff " GTEST_NAME_ " should include internal stack frames when " "printing test failure stack traces."); GTEST_DEFINE_bool_( shuffle, internal::BoolFromGTestEnv("shuffle", false), "True iff " GTEST_NAME_ " should randomize tests' order on every run."); GTEST_DEFINE_int32_( stack_trace_depth, internal::Int32FromGTestEnv("stack_trace_depth", kMaxStackTraceDepth), "The maximum number of stack frames to print when an " "assertion fails. The valid range is 0 through 100, inclusive."); GTEST_DEFINE_string_( stream_result_to, internal::StringFromGTestEnv("stream_result_to", ""), "This flag specifies the host name and the port number on which to stream " "test results. Example: \"localhost:555\". The flag is effective only on " "Linux."); GTEST_DEFINE_bool_( throw_on_failure, internal::BoolFromGTestEnv("throw_on_failure", false), "When this flag is specified, a failed assertion will throw an exception " "if exceptions are enabled or exit the program with a non-zero code " "otherwise."); namespace internal { // Generates a random number from [0, range), using a Linear // Congruential Generator (LCG). Crashes if 'range' is 0 or greater // than kMaxRange. UInt32 Random::Generate(UInt32 range) { // These constants are the same as are used in glibc's rand(3). state_ = (1103515245U*state_ + 12345U) % kMaxRange; GTEST_CHECK_(range > 0) << "Cannot generate a number in the range [0, 0)."; GTEST_CHECK_(range <= kMaxRange) << "Generation of a number in [0, " << range << ") was requested, " << "but this can only generate numbers in [0, " << kMaxRange << ")."; // Converting via modulus introduces a bit of downward bias, but // it's simple, and a linear congruential generator isn't too good // to begin with. return state_ % range; } // GTestIsInitialized() returns true iff the user has initialized // Google Test. Useful for catching the user mistake of not initializing // Google Test before calling RUN_ALL_TESTS(). // // A user must call testing::InitGoogleTest() to initialize Google // Test. g_init_gtest_count is set to the number of times // InitGoogleTest() has been called. We don't protect this variable // under a mutex as it is only accessed in the main thread. int g_init_gtest_count = 0; static bool GTestIsInitialized() { return g_init_gtest_count != 0; } // Iterates over a vector of TestCases, keeping a running sum of the // results of calling a given int-returning method on each. // Returns the sum. static int SumOverTestCaseList(const std::vector& case_list, int (TestCase::*method)() const) { int sum = 0; for (size_t i = 0; i < case_list.size(); i++) { sum += (case_list[i]->*method)(); } return sum; } // Returns true iff the test case passed. static bool TestCasePassed(const TestCase* test_case) { return test_case->should_run() && test_case->Passed(); } // Returns true iff the test case failed. static bool TestCaseFailed(const TestCase* test_case) { return test_case->should_run() && test_case->Failed(); } // Returns true iff test_case contains at least one test that should // run. static bool ShouldRunTestCase(const TestCase* test_case) { return test_case->should_run(); } // AssertHelper constructor. AssertHelper::AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message) : data_(new AssertHelperData(type, file, line, message)) { } AssertHelper::~AssertHelper() { delete data_; } // Message assignment, for assertion streaming support. void AssertHelper::operator=(const Message& message) const { UnitTest::GetInstance()-> AddTestPartResult(data_->type, data_->file, data_->line, AppendUserMessage(data_->message, message), UnitTest::GetInstance()->impl() ->CurrentOsStackTraceExceptTop(1) // Skips the stack frame for this function itself. ); // NOLINT } // Mutex for linked pointers. GTEST_DEFINE_STATIC_MUTEX_(g_linked_ptr_mutex); // Application pathname gotten in InitGoogleTest. String g_executable_path; // Returns the current application's name, removing directory path if that // is present. FilePath GetCurrentExecutableName() { FilePath result; #if GTEST_OS_WINDOWS result.Set(FilePath(g_executable_path).RemoveExtension("exe")); #else result.Set(FilePath(g_executable_path)); #endif // GTEST_OS_WINDOWS return result.RemoveDirectoryName(); } // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. String UnitTestOptions::GetOutputFormat() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); return (colon == NULL) ? String(gtest_output_flag) : String(gtest_output_flag, colon - gtest_output_flag); } // Returns the name of the requested output file, or the default if none // was explicitly specified. String UnitTestOptions::GetAbsolutePathToOutputFile() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); if (colon == NULL) return String(internal::FilePath::ConcatPaths( internal::FilePath( UnitTest::GetInstance()->original_working_dir()), internal::FilePath(kDefaultOutputFile)).ToString() ); internal::FilePath output_name(colon + 1); if (!output_name.IsAbsolutePath()) // TODO(wan@google.com): on Windows \some\path is not an absolute // path (as its meaning depends on the current drive), yet the // following logic for turning it into an absolute path is wrong. // Fix it. output_name = internal::FilePath::ConcatPaths( internal::FilePath(UnitTest::GetInstance()->original_working_dir()), internal::FilePath(colon + 1)); if (!output_name.IsDirectory()) return output_name.ToString(); internal::FilePath result(internal::FilePath::GenerateUniqueFileName( output_name, internal::GetCurrentExecutableName(), GetOutputFormat().c_str())); return result.ToString(); } // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. bool UnitTestOptions::PatternMatchesString(const char *pattern, const char *str) { switch (*pattern) { case '\0': case ':': // Either ':' or '\0' marks the end of the pattern. return *str == '\0'; case '?': // Matches any single character. return *str != '\0' && PatternMatchesString(pattern + 1, str + 1); case '*': // Matches any string (possibly empty) of characters. return (*str != '\0' && PatternMatchesString(pattern, str + 1)) || PatternMatchesString(pattern + 1, str); default: // Non-special character. Matches itself. return *pattern == *str && PatternMatchesString(pattern + 1, str + 1); } } bool UnitTestOptions::MatchesFilter(const String& name, const char* filter) { const char *cur_pattern = filter; for (;;) { if (PatternMatchesString(cur_pattern, name.c_str())) { return true; } // Finds the next pattern in the filter. cur_pattern = strchr(cur_pattern, ':'); // Returns if no more pattern can be found. if (cur_pattern == NULL) { return false; } // Skips the pattern separater (the ':' character). cur_pattern++; } } // TODO(keithray): move String function implementations to gtest-string.cc. // Returns true iff the user-specified filter matches the test case // name and the test name. bool UnitTestOptions::FilterMatchesTest(const String &test_case_name, const String &test_name) { const String& full_name = String::Format("%s.%s", test_case_name.c_str(), test_name.c_str()); // Split --gtest_filter at '-', if there is one, to separate into // positive filter and negative filter portions const char* const p = GTEST_FLAG(filter).c_str(); const char* const dash = strchr(p, '-'); String positive; String negative; if (dash == NULL) { positive = GTEST_FLAG(filter).c_str(); // Whole string is a positive filter negative = String(""); } else { positive = String(p, dash - p); // Everything up to the dash negative = String(dash+1); // Everything after the dash if (positive.empty()) { // Treat '-test1' as the same as '*-test1' positive = kUniversalFilter; } } // A filter is a colon-separated list of patterns. It matches a // test if any pattern in it matches the test. return (MatchesFilter(full_name, positive.c_str()) && !MatchesFilter(full_name, negative.c_str())); } #if GTEST_HAS_SEH // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. int UnitTestOptions::GTestShouldProcessSEH(DWORD exception_code) { // Google Test should handle a SEH exception if: // 1. the user wants it to, AND // 2. this is not a breakpoint exception, AND // 3. this is not a C++ exception (VC++ implements them via SEH, // apparently). // // SEH exception code for C++ exceptions. // (see http://support.microsoft.com/kb/185294 for more information). const DWORD kCxxExceptionCode = 0xe06d7363; bool should_handle = true; if (!GTEST_FLAG(catch_exceptions)) should_handle = false; else if (exception_code == EXCEPTION_BREAKPOINT) should_handle = false; else if (exception_code == kCxxExceptionCode) should_handle = false; return should_handle ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH; } #endif // GTEST_HAS_SEH } // namespace internal // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. Intercepts only failures from the current thread. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( TestPartResultArray* result) : intercept_mode_(INTERCEPT_ONLY_CURRENT_THREAD), result_(result) { Init(); } // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( InterceptMode intercept_mode, TestPartResultArray* result) : intercept_mode_(intercept_mode), result_(result) { Init(); } void ScopedFakeTestPartResultReporter::Init() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { old_reporter_ = impl->GetGlobalTestPartResultReporter(); impl->SetGlobalTestPartResultReporter(this); } else { old_reporter_ = impl->GetTestPartResultReporterForCurrentThread(); impl->SetTestPartResultReporterForCurrentThread(this); } } // The d'tor restores the test part result reporter used by Google Test // before. ScopedFakeTestPartResultReporter::~ScopedFakeTestPartResultReporter() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { impl->SetGlobalTestPartResultReporter(old_reporter_); } else { impl->SetTestPartResultReporterForCurrentThread(old_reporter_); } } // Increments the test part result count and remembers the result. // This method is from the TestPartResultReporterInterface interface. void ScopedFakeTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { result_->Append(result); } namespace internal { // Returns the type ID of ::testing::Test. We should always call this // instead of GetTypeId< ::testing::Test>() to get the type ID of // testing::Test. This is to work around a suspected linker bug when // using Google Test as a framework on Mac OS X. The bug causes // GetTypeId< ::testing::Test>() to return different values depending // on whether the call is from the Google Test framework itself or // from user test code. GetTestTypeId() is guaranteed to always // return the same value, as it always calls GetTypeId<>() from the // gtest.cc, which is within the Google Test framework. TypeId GetTestTypeId() { return GetTypeId(); } // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). extern const TypeId kTestTypeIdInGoogleTest = GetTestTypeId(); // This predicate-formatter checks that 'results' contains a test part // failure of the given type and that the failure message contains the // given substring. AssertionResult HasOneFailure(const char* /* results_expr */, const char* /* type_expr */, const char* /* substr_expr */, const TestPartResultArray& results, TestPartResult::Type type, const string& substr) { const String expected(type == TestPartResult::kFatalFailure ? "1 fatal failure" : "1 non-fatal failure"); Message msg; if (results.size() != 1) { msg << "Expected: " << expected << "\n" << " Actual: " << results.size() << " failures"; for (int i = 0; i < results.size(); i++) { msg << "\n" << results.GetTestPartResult(i); } return AssertionFailure() << msg; } const TestPartResult& r = results.GetTestPartResult(0); if (r.type() != type) { return AssertionFailure() << "Expected: " << expected << "\n" << " Actual:\n" << r; } if (strstr(r.message(), substr.c_str()) == NULL) { return AssertionFailure() << "Expected: " << expected << " containing \"" << substr << "\"\n" << " Actual:\n" << r; } return AssertionSuccess(); } // The constructor of SingleFailureChecker remembers where to look up // test part results, what type of failure we expect, and what // substring the failure message should contain. SingleFailureChecker:: SingleFailureChecker( const TestPartResultArray* results, TestPartResult::Type type, const string& substr) : results_(results), type_(type), substr_(substr) {} // The destructor of SingleFailureChecker verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. SingleFailureChecker::~SingleFailureChecker() { EXPECT_PRED_FORMAT3(HasOneFailure, *results_, type_, substr_); } DefaultGlobalTestPartResultReporter::DefaultGlobalTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultGlobalTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->current_test_result()->AddTestPartResult(result); unit_test_->listeners()->repeater()->OnTestPartResult(result); } DefaultPerThreadTestPartResultReporter::DefaultPerThreadTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultPerThreadTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->GetGlobalTestPartResultReporter()->ReportTestPartResult(result); } // Returns the global test part result reporter. TestPartResultReporterInterface* UnitTestImpl::GetGlobalTestPartResultReporter() { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); return global_test_part_result_repoter_; } // Sets the global test part result reporter. void UnitTestImpl::SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter) { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); global_test_part_result_repoter_ = reporter; } // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* UnitTestImpl::GetTestPartResultReporterForCurrentThread() { return per_thread_test_part_result_reporter_.get(); } // Sets the test part result reporter for the current thread. void UnitTestImpl::SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter) { per_thread_test_part_result_reporter_.set(reporter); } // Gets the number of successful test cases. int UnitTestImpl::successful_test_case_count() const { return CountIf(test_cases_, TestCasePassed); } // Gets the number of failed test cases. int UnitTestImpl::failed_test_case_count() const { return CountIf(test_cases_, TestCaseFailed); } // Gets the number of all test cases. int UnitTestImpl::total_test_case_count() const { return static_cast(test_cases_.size()); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTestImpl::test_case_to_run_count() const { return CountIf(test_cases_, ShouldRunTestCase); } // Gets the number of successful tests. int UnitTestImpl::successful_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::successful_test_count); } // Gets the number of failed tests. int UnitTestImpl::failed_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::failed_test_count); } // Gets the number of disabled tests. int UnitTestImpl::disabled_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::disabled_test_count); } // Gets the number of all tests. int UnitTestImpl::total_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::total_test_count); } // Gets the number of tests that should run. int UnitTestImpl::test_to_run_count() const { return SumOverTestCaseList(test_cases_, &TestCase::test_to_run_count); } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String UnitTestImpl::CurrentOsStackTraceExceptTop(int skip_count) { (void)skip_count; return String(""); } // Returns the current time in milliseconds. TimeInMillis GetTimeInMillis() { #if GTEST_OS_WINDOWS_MOBILE || defined(__BORLANDC__) // Difference between 1970-01-01 and 1601-01-01 in milliseconds. // http://analogous.blogspot.com/2005/04/epoch.html const TimeInMillis kJavaEpochToWinFileTimeDelta = static_cast(116444736UL) * 100000UL; const DWORD kTenthMicrosInMilliSecond = 10000; SYSTEMTIME now_systime; FILETIME now_filetime; ULARGE_INTEGER now_int64; // TODO(kenton@google.com): Shouldn't this just use // GetSystemTimeAsFileTime()? GetSystemTime(&now_systime); if (SystemTimeToFileTime(&now_systime, &now_filetime)) { now_int64.LowPart = now_filetime.dwLowDateTime; now_int64.HighPart = now_filetime.dwHighDateTime; now_int64.QuadPart = (now_int64.QuadPart / kTenthMicrosInMilliSecond) - kJavaEpochToWinFileTimeDelta; return now_int64.QuadPart; } return 0; #elif GTEST_OS_WINDOWS && !GTEST_HAS_GETTIMEOFDAY_ __timeb64 now; # ifdef _MSC_VER // MSVC 8 deprecates _ftime64(), so we want to suppress warning 4996 // (deprecated function) there. // TODO(kenton@google.com): Use GetTickCount()? Or use // SystemTimeToFileTime() # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. _ftime64(&now); # pragma warning(pop) // Restores the warning state. # else _ftime64(&now); # endif // _MSC_VER return static_cast(now.time) * 1000 + now.millitm; #elif GTEST_HAS_GETTIMEOFDAY_ struct timeval now; gettimeofday(&now, NULL); return static_cast(now.tv_sec) * 1000 + now.tv_usec / 1000; #else # error "Don't know how to get the current time on your system." #endif } // Utilities // class String // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. String String::ShowCStringQuoted(const char* c_str) { return c_str ? String::Format("\"%s\"", c_str) : String("(null)"); } // Copies at most length characters from str into a newly-allocated // piece of memory of size length+1. The memory is allocated with new[]. // A terminating null byte is written to the memory, and a pointer to it // is returned. If str is NULL, NULL is returned. static char* CloneString(const char* str, size_t length) { if (str == NULL) { return NULL; } else { char* const clone = new char[length + 1]; posix::StrNCpy(clone, str, length); clone[length] = '\0'; return clone; } } // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting[] the return value. Returns the // cloned string, or NULL if the input is NULL. const char * String::CloneCString(const char* c_str) { return (c_str == NULL) ? NULL : CloneString(c_str, strlen(c_str)); } #if GTEST_OS_WINDOWS_MOBILE // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. LPCWSTR String::AnsiToUtf16(const char* ansi) { if (!ansi) return NULL; const int length = strlen(ansi); const int unicode_length = MultiByteToWideChar(CP_ACP, 0, ansi, length, NULL, 0); WCHAR* unicode = new WCHAR[unicode_length + 1]; MultiByteToWideChar(CP_ACP, 0, ansi, length, unicode, unicode_length); unicode[unicode_length] = 0; return unicode; } // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. const char* String::Utf16ToAnsi(LPCWSTR utf16_str) { if (!utf16_str) return NULL; const int ansi_length = WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, NULL, 0, NULL, NULL); char* ansi = new char[ansi_length + 1]; WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, ansi, ansi_length, NULL, NULL); ansi[ansi_length] = 0; return ansi; } #endif // GTEST_OS_WINDOWS_MOBILE // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::CStringEquals(const char * lhs, const char * rhs) { if ( lhs == NULL ) return rhs == NULL; if ( rhs == NULL ) return false; return strcmp(lhs, rhs) == 0; } #if GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING // Converts an array of wide chars to a narrow string using the UTF-8 // encoding, and streams the result to the given Message object. static void StreamWideCharsToMessage(const wchar_t* wstr, size_t length, Message* msg) { // TODO(wan): consider allowing a testing::String object to // contain '\0'. This will make it behave more like std::string, // and will allow ToUtf8String() to return the correct encoding // for '\0' s.t. we can get rid of the conditional here (and in // several other places). for (size_t i = 0; i != length; ) { // NOLINT if (wstr[i] != L'\0') { *msg << WideStringToUtf8(wstr + i, static_cast(length - i)); while (i != length && wstr[i] != L'\0') i++; } else { *msg << '\0'; i++; } } } #endif // GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING } // namespace internal #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::std::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_GLOBAL_WSTRING // AssertionResult constructors. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult::AssertionResult(const AssertionResult& other) : success_(other.success_), message_(other.message_.get() != NULL ? new ::std::string(*other.message_) : static_cast< ::std::string*>(NULL)) { } // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult AssertionResult::operator!() const { AssertionResult negation(!success_); if (message_.get() != NULL) negation << *message_; return negation; } // Makes a successful assertion result. AssertionResult AssertionSuccess() { return AssertionResult(true); } // Makes a failed assertion result. AssertionResult AssertionFailure() { return AssertionResult(false); } // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << message. AssertionResult AssertionFailure(const Message& message) { return AssertionFailure() << message; } namespace internal { // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case) { Message msg; msg << "Value of: " << actual_expression; if (actual_value != actual_expression) { msg << "\n Actual: " << actual_value; } msg << "\nExpected: " << expected_expression; if (ignoring_case) { msg << " (ignoring case)"; } if (expected_value != expected_expression) { msg << "\nWhich is: " << expected_value; } return AssertionFailure() << msg; } // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. String GetBoolAssertionFailureMessage(const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value) { const char* actual_message = assertion_result.message(); Message msg; msg << "Value of: " << expression_text << "\n Actual: " << actual_predicate_value; if (actual_message[0] != '\0') msg << " (" << actual_message << ")"; msg << "\nExpected: " << expected_predicate_value; return msg.GetString(); } // Helper function for implementing ASSERT_NEAR. AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error) { const double diff = fabs(val1 - val2); if (diff <= abs_error) return AssertionSuccess(); // TODO(wan): do not print the value of an expression if it's // already a literal. return AssertionFailure() << "The difference between " << expr1 << " and " << expr2 << " is " << diff << ", which exceeds " << abs_error_expr << ", where\n" << expr1 << " evaluates to " << val1 << ",\n" << expr2 << " evaluates to " << val2 << ", and\n" << abs_error_expr << " evaluates to " << abs_error << "."; } // Helper template for implementing FloatLE() and DoubleLE(). template AssertionResult FloatingPointLE(const char* expr1, const char* expr2, RawType val1, RawType val2) { // Returns success if val1 is less than val2, if (val1 < val2) { return AssertionSuccess(); } // or if val1 is almost equal to val2. const FloatingPoint lhs(val1), rhs(val2); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } // Note that the above two checks will both fail if either val1 or // val2 is NaN, as the IEEE floating-point standard requires that // any predicate involving a NaN must return false. ::std::stringstream val1_ss; val1_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val1; ::std::stringstream val2_ss; val2_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val2; return AssertionFailure() << "Expected: (" << expr1 << ") <= (" << expr2 << ")\n" << " Actual: " << StringStreamToString(&val1_ss) << " vs " << StringStreamToString(&val2_ss); } } // namespace internal // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } namespace internal { // The helper function for {ASSERT|EXPECT}_EQ with int or enum // arguments. AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { if (expected == actual) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_?? with integer or enum arguments. It is here // just to avoid copy-and-paste of similar code. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ BiggestInt val1, BiggestInt val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ } // Implements the helper function for {ASSERT|EXPECT}_NE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(NE, !=) // Implements the helper function for {ASSERT|EXPECT}_LE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LE, <=) // Implements the helper function for {ASSERT|EXPECT}_LT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LT, < ) // Implements the helper function for {ASSERT|EXPECT}_GE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GE, >=) // Implements the helper function for {ASSERT|EXPECT}_GT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GT, > ) #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), false); } // The helper function for {ASSERT|EXPECT}_STRCASEEQ. AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CaseInsensitiveCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), true); } // The helper function for {ASSERT|EXPECT}_STRNE. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } // The helper function for {ASSERT|EXPECT}_STRCASENE. AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CaseInsensitiveCStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << ") (ignoring case), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } } // namespace internal namespace { // Helper functions for implementing IsSubString() and IsNotSubstring(). // This group of overloaded functions return true iff needle is a // substring of haystack. NULL is considered a substring of itself // only. bool IsSubstringPred(const char* needle, const char* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return strstr(haystack, needle) != NULL; } bool IsSubstringPred(const wchar_t* needle, const wchar_t* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return wcsstr(haystack, needle) != NULL; } // StringType here can be either ::std::string or ::std::wstring. template bool IsSubstringPred(const StringType& needle, const StringType& haystack) { return haystack.find(needle) != StringType::npos; } // This function implements either IsSubstring() or IsNotSubstring(), // depending on the value of the expected_to_be_substring parameter. // StringType here can be const char*, const wchar_t*, ::std::string, // or ::std::wstring. template AssertionResult IsSubstringImpl( bool expected_to_be_substring, const char* needle_expr, const char* haystack_expr, const StringType& needle, const StringType& haystack) { if (IsSubstringPred(needle, haystack) == expected_to_be_substring) return AssertionSuccess(); const bool is_wide_string = sizeof(needle[0]) > 1; const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; return AssertionFailure() << "Value of: " << needle_expr << "\n" << " Actual: " << begin_string_quote << needle << "\"\n" << "Expected: " << (expected_to_be_substring ? "" : "not ") << "a substring of " << haystack_expr << "\n" << "Which is: " << begin_string_quote << haystack << "\""; } } // namespace // IsSubstring() and IsNotSubstring() check whether needle is a // substring of haystack (NULL is considered a substring of itself // only), and return an appropriate error message when they fail. AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #if GTEST_HAS_STD_WSTRING AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #endif // GTEST_HAS_STD_WSTRING namespace internal { #if GTEST_OS_WINDOWS namespace { // Helper function for IsHRESULT{SuccessFailure} predicates AssertionResult HRESULTFailureHelper(const char* expr, const char* expected, long hr) { // NOLINT # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't support FormatMessage. const char error_text[] = ""; # else // Looks up the human-readable system message for the HRESULT code // and since we're not passing any params to FormatMessage, we don't // want inserts expanded. const DWORD kFlags = FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS; const DWORD kBufSize = 4096; // String::Format can't exceed this length. // Gets the system's human readable message string for this HRESULT. char error_text[kBufSize] = { '\0' }; DWORD message_length = ::FormatMessageA(kFlags, 0, // no source, we're asking system hr, // the error 0, // no line width restrictions error_text, // output buffer kBufSize, // buf size NULL); // no arguments for inserts // Trims tailing white space (FormatMessage leaves a trailing cr-lf) for (; message_length && IsSpace(error_text[message_length - 1]); --message_length) { error_text[message_length - 1] = '\0'; } # endif // GTEST_OS_WINDOWS_MOBILE const String error_hex(String::Format("0x%08X ", hr)); return ::testing::AssertionFailure() << "Expected: " << expr << " " << expected << ".\n" << " Actual: " << error_hex << error_text << "\n"; } } // namespace AssertionResult IsHRESULTSuccess(const char* expr, long hr) { // NOLINT if (SUCCEEDED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "succeeds", hr); } AssertionResult IsHRESULTFailure(const char* expr, long hr) { // NOLINT if (FAILED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "fails", hr); } #endif // GTEST_OS_WINDOWS // Utility functions for encoding Unicode text (wide strings) in // UTF-8. // A Unicode code-point can have upto 21 bits, and is encoded in UTF-8 // like this: // // Code-point length Encoding // 0 - 7 bits 0xxxxxxx // 8 - 11 bits 110xxxxx 10xxxxxx // 12 - 16 bits 1110xxxx 10xxxxxx 10xxxxxx // 17 - 21 bits 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx // The maximum code-point a one-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint1 = (static_cast(1) << 7) - 1; // The maximum code-point a two-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint2 = (static_cast(1) << (5 + 6)) - 1; // The maximum code-point a three-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint3 = (static_cast(1) << (4 + 2*6)) - 1; // The maximum code-point a four-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint4 = (static_cast(1) << (3 + 3*6)) - 1; // Chops off the n lowest bits from a bit pattern. Returns the n // lowest bits. As a side effect, the original bit pattern will be // shifted to the right by n bits. inline UInt32 ChopLowBits(UInt32* bits, int n) { const UInt32 low_bits = *bits & ((static_cast(1) << n) - 1); *bits >>= n; return low_bits; } // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. char* CodePointToUtf8(UInt32 code_point, char* str) { if (code_point <= kMaxCodePoint1) { str[1] = '\0'; str[0] = static_cast(code_point); // 0xxxxxxx } else if (code_point <= kMaxCodePoint2) { str[2] = '\0'; str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xC0 | code_point); // 110xxxxx } else if (code_point <= kMaxCodePoint3) { str[3] = '\0'; str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xE0 | code_point); // 1110xxxx } else if (code_point <= kMaxCodePoint4) { str[4] = '\0'; str[3] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xF0 | code_point); // 11110xxx } else { // The longest string String::Format can produce when invoked // with these parameters is 28 character long (not including // the terminating nul character). We are asking for 32 character // buffer just in case. This is also enough for strncpy to // null-terminate the destination string. posix::StrNCpy( str, String::Format("(Invalid Unicode 0x%X)", code_point).c_str(), 32); str[31] = '\0'; // Makes sure no change in the format to strncpy leaves // the result unterminated. } return str; } // The following two functions only make sense if the the system // uses UTF-16 for wide string encoding. All supported systems // with 16 bit wchar_t (Windows, Cygwin, Symbian OS) do use UTF-16. // Determines if the arguments constitute UTF-16 surrogate pair // and thus should be combined into a single Unicode code point // using CreateCodePointFromUtf16SurrogatePair. inline bool IsUtf16SurrogatePair(wchar_t first, wchar_t second) { return sizeof(wchar_t) == 2 && (first & 0xFC00) == 0xD800 && (second & 0xFC00) == 0xDC00; } // Creates a Unicode code point from UTF16 surrogate pair. inline UInt32 CreateCodePointFromUtf16SurrogatePair(wchar_t first, wchar_t second) { const UInt32 mask = (1 << 10) - 1; return (sizeof(wchar_t) == 2) ? (((first & mask) << 10) | (second & mask)) + 0x10000 : // This function should not be called when the condition is // false, but we provide a sensible default in case it is. static_cast(first); } // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. String WideStringToUtf8(const wchar_t* str, int num_chars) { if (num_chars == -1) num_chars = static_cast(wcslen(str)); ::std::stringstream stream; for (int i = 0; i < num_chars; ++i) { UInt32 unicode_code_point; if (str[i] == L'\0') { break; } else if (i + 1 < num_chars && IsUtf16SurrogatePair(str[i], str[i + 1])) { unicode_code_point = CreateCodePointFromUtf16SurrogatePair(str[i], str[i + 1]); i++; } else { unicode_code_point = static_cast(str[i]); } char buffer[32]; // CodePointToUtf8 requires a buffer this big. stream << CodePointToUtf8(unicode_code_point, buffer); } return StringStreamToString(&stream); } // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". String String::ShowWideCString(const wchar_t * wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String(internal::WideStringToUtf8(wide_c_str, -1).c_str()); } // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. String String::ShowWideCStringQuoted(const wchar_t* wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String::Format("L\"%s\"", String::ShowWideCString(wide_c_str).c_str()); } // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::WideCStringEquals(const wchar_t * lhs, const wchar_t * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return wcscmp(lhs, rhs) == 0; } // Helper function for *_STREQ on wide strings. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual) { if (String::WideCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowWideCStringQuoted(expected), String::ShowWideCStringQuoted(actual), false); } // Helper function for *_STRNE on wide strings. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2) { if (!String::WideCStringEquals(s1, s2)) { return AssertionSuccess(); } return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: " << String::ShowWideCStringQuoted(s1) << " vs " << String::ShowWideCStringQuoted(s2); } // Compares two C strings, ignoring case. Returns true iff they have // the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. bool String::CaseInsensitiveCStringEquals(const char * lhs, const char * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return posix::StrCaseCmp(lhs, rhs) == 0; } // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. bool String::CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; #if GTEST_OS_WINDOWS return _wcsicmp(lhs, rhs) == 0; #elif GTEST_OS_LINUX && !GTEST_OS_LINUX_ANDROID return wcscasecmp(lhs, rhs) == 0; #else // Android, Mac OS X and Cygwin don't define wcscasecmp. // Other unknown OSes may not define it either. wint_t left, right; do { left = towlower(*lhs++); right = towlower(*rhs++); } while (left && left == right); return left == right; #endif // OS selector } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int String::Compare(const String & rhs) const { const char* const lhs_c_str = c_str(); const char* const rhs_c_str = rhs.c_str(); if (lhs_c_str == NULL) { return rhs_c_str == NULL ? 0 : -1; // NULL < anything except NULL } else if (rhs_c_str == NULL) { return 1; } const size_t shorter_str_len = length() <= rhs.length() ? length() : rhs.length(); for (size_t i = 0; i != shorter_str_len; i++) { if (lhs_c_str[i] < rhs_c_str[i]) { return -1; } else if (lhs_c_str[i] > rhs_c_str[i]) { return 1; } } return (length() < rhs.length()) ? -1 : (length() > rhs.length()) ? 1 : 0; } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool String::EndsWith(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CStringEquals(c_str() + this_len - suffix_len, suffix); } // Returns true iff this String ends with the given suffix, ignoring case. // Any String is considered to end with a NULL or empty suffix. bool String::EndsWithCaseInsensitive(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CaseInsensitiveCStringEquals(c_str() + this_len - suffix_len, suffix); } // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing 0). // If 4096 characters are not enough to format the input, or if // there's an error, "" is // returned. String String::Format(const char * format, ...) { va_list args; va_start(args, format); char buffer[4096]; const int kBufferSize = sizeof(buffer)/sizeof(buffer[0]); // MSVC 8 deprecates vsnprintf(), so we want to suppress warning // 4996 (deprecated function) there. #ifdef _MSC_VER // We are using MSVC. # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. const int size = vsnprintf(buffer, kBufferSize, format, args); # pragma warning(pop) // Restores the warning state. #else // We are not using MSVC. const int size = vsnprintf(buffer, kBufferSize, format, args); #endif // _MSC_VER va_end(args); // vsnprintf()'s behavior is not portable. When the buffer is not // big enough, it returns a negative value in MSVC, and returns the // needed buffer size on Linux. When there is an output error, it // always returns a negative value. For simplicity, we lump the two // error cases together. if (size < 0 || size >= kBufferSize) { return String(""); } else { return String(buffer, size); } } // Converts the buffer in a stringstream to a String, converting NUL // bytes to "\\0" along the way. String StringStreamToString(::std::stringstream* ss) { const ::std::string& str = ss->str(); const char* const start = str.c_str(); const char* const end = start + str.length(); // We need to use a helper stringstream to do this transformation // because String doesn't support push_back(). ::std::stringstream helper; for (const char* ch = start; ch != end; ++ch) { if (*ch == '\0') { helper << "\\0"; // Replaces NUL with "\\0"; } else { helper.put(*ch); } } return String(helper.str().c_str()); } // Appends the user-supplied message to the Google-Test-generated message. String AppendUserMessage(const String& gtest_msg, const Message& user_msg) { // Appends the user message if it's non-empty. const String user_msg_string = user_msg.GetString(); if (user_msg_string.empty()) { return gtest_msg; } Message msg; msg << gtest_msg << "\n" << user_msg_string; return msg.GetString(); } } // namespace internal // class TestResult // Creates an empty TestResult. TestResult::TestResult() : death_test_count_(0), elapsed_time_(0) { } // D'tor. TestResult::~TestResult() { } // Returns the i-th test part result among all the results. i can // range from 0 to total_part_count() - 1. If i is not in that range, // aborts the program. const TestPartResult& TestResult::GetTestPartResult(int i) const { if (i < 0 || i >= total_part_count()) internal::posix::Abort(); return test_part_results_.at(i); } // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& TestResult::GetTestProperty(int i) const { if (i < 0 || i >= test_property_count()) internal::posix::Abort(); return test_properties_.at(i); } // Clears the test part results. void TestResult::ClearTestPartResults() { test_part_results_.clear(); } // Adds a test part result to the list. void TestResult::AddTestPartResult(const TestPartResult& test_part_result) { test_part_results_.push_back(test_part_result); } // Adds a test property to the list. If a property with the same key as the // supplied property is already represented, the value of this test_property // replaces the old value for that key. void TestResult::RecordProperty(const TestProperty& test_property) { if (!ValidateTestProperty(test_property)) { return; } internal::MutexLock lock(&test_properites_mutex_); const std::vector::iterator property_with_matching_key = std::find_if(test_properties_.begin(), test_properties_.end(), internal::TestPropertyKeyIs(test_property.key())); if (property_with_matching_key == test_properties_.end()) { test_properties_.push_back(test_property); return; } property_with_matching_key->SetValue(test_property.value()); } // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. bool TestResult::ValidateTestProperty(const TestProperty& test_property) { internal::String key(test_property.key()); if (key == "name" || key == "status" || key == "time" || key == "classname") { ADD_FAILURE() << "Reserved key used in RecordProperty(): " << key << " ('name', 'status', 'time', and 'classname' are reserved by " << GTEST_NAME_ << ")"; return false; } return true; } // Clears the object. void TestResult::Clear() { test_part_results_.clear(); test_properties_.clear(); death_test_count_ = 0; elapsed_time_ = 0; } // Returns true iff the test failed. bool TestResult::Failed() const { for (int i = 0; i < total_part_count(); ++i) { if (GetTestPartResult(i).failed()) return true; } return false; } // Returns true iff the test part fatally failed. static bool TestPartFatallyFailed(const TestPartResult& result) { return result.fatally_failed(); } // Returns true iff the test fatally failed. bool TestResult::HasFatalFailure() const { return CountIf(test_part_results_, TestPartFatallyFailed) > 0; } // Returns true iff the test part non-fatally failed. static bool TestPartNonfatallyFailed(const TestPartResult& result) { return result.nonfatally_failed(); } // Returns true iff the test has a non-fatal failure. bool TestResult::HasNonfatalFailure() const { return CountIf(test_part_results_, TestPartNonfatallyFailed) > 0; } // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int TestResult::total_part_count() const { return static_cast(test_part_results_.size()); } // Returns the number of the test properties. int TestResult::test_property_count() const { return static_cast(test_properties_.size()); } // class Test // Creates a Test object. // The c'tor saves the values of all Google Test flags. Test::Test() : gtest_flag_saver_(new internal::GTestFlagSaver) { } // The d'tor restores the values of all Google Test flags. Test::~Test() { delete gtest_flag_saver_; } // Sets up the test fixture. // // A sub-class may override this. void Test::SetUp() { } // Tears down the test fixture. // // A sub-class may override this. void Test::TearDown() { } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, const char* value) { UnitTest::GetInstance()->RecordPropertyForCurrentTest(key, value); } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, int value) { Message value_message; value_message << value; RecordProperty(key, value_message.GetString().c_str()); } namespace internal { void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message) { // This function is a friend of UnitTest and as such has access to // AddTestPartResult. UnitTest::GetInstance()->AddTestPartResult( result_type, NULL, // No info about the source file where the exception occurred. -1, // We have no info on which line caused the exception. message, String()); // No stack trace, either. } } // namespace internal // Google Test requires all tests in the same test case to use the same test // fixture class. This function checks if the current test has the // same fixture class as the first test in the current test case. If // yes, it returns true; otherwise it generates a Google Test failure and // returns false. bool Test::HasSameFixtureClass() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); const TestCase* const test_case = impl->current_test_case(); // Info about the first test in the current test case. const TestInfo* const first_test_info = test_case->test_info_list()[0]; const internal::TypeId first_fixture_id = first_test_info->fixture_class_id_; const char* const first_test_name = first_test_info->name(); // Info about the current test. const TestInfo* const this_test_info = impl->current_test_info(); const internal::TypeId this_fixture_id = this_test_info->fixture_class_id_; const char* const this_test_name = this_test_info->name(); if (this_fixture_id != first_fixture_id) { // Is the first test defined using TEST? const bool first_is_TEST = first_fixture_id == internal::GetTestTypeId(); // Is this test defined using TEST? const bool this_is_TEST = this_fixture_id == internal::GetTestTypeId(); if (first_is_TEST || this_is_TEST) { // The user mixed TEST and TEST_F in this test case - we'll tell // him/her how to fix it. // Gets the name of the TEST and the name of the TEST_F. Note // that first_is_TEST and this_is_TEST cannot both be true, as // the fixture IDs are different for the two tests. const char* const TEST_name = first_is_TEST ? first_test_name : this_test_name; const char* const TEST_F_name = first_is_TEST ? this_test_name : first_test_name; ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class, so mixing TEST_F and TEST in the same test case is\n" << "illegal. In test case " << this_test_info->test_case_name() << ",\n" << "test " << TEST_F_name << " is defined using TEST_F but\n" << "test " << TEST_name << " is defined using TEST. You probably\n" << "want to change the TEST to TEST_F or move it to another test\n" << "case."; } else { // The user defined two fixture classes with the same name in // two namespaces - we'll tell him/her how to fix it. ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << this_test_info->test_case_name() << ",\n" << "you defined test " << first_test_name << " and test " << this_test_name << "\n" << "using two different test fixture classes. This can happen if\n" << "the two classes are from different namespaces or translation\n" << "units and have the same name. You should probably rename one\n" << "of the classes to put the tests into different test cases."; } return false; } return true; } #if GTEST_HAS_SEH // Adds an "exception thrown" fatal failure to the current test. This // function returns its result via an output parameter pointer because VC++ // prohibits creation of objects with destructors on stack in functions // using __try (see error C2712). static internal::String* FormatSehExceptionMessage(DWORD exception_code, const char* location) { Message message; message << "SEH exception with code 0x" << std::setbase(16) << exception_code << std::setbase(10) << " thrown in " << location << "."; return new internal::String(message.GetString()); } #endif // GTEST_HAS_SEH #if GTEST_HAS_EXCEPTIONS // Adds an "exception thrown" fatal failure to the current test. static internal::String FormatCxxExceptionMessage(const char* description, const char* location) { Message message; if (description != NULL) { message << "C++ exception with description \"" << description << "\""; } else { message << "Unknown C++ exception"; } message << " thrown in " << location << "."; return message.GetString(); } static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result); // A failed Google Test assertion will throw an exception of this type when // GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We // derive it from std::runtime_error, which is for errors presumably // detectable only at run time. Since std::runtime_error inherits from // std::exception, many testing frameworks know how to extract and print the // message inside it. class GoogleTestFailureException : public ::std::runtime_error { public: explicit GoogleTestFailureException(const TestPartResult& failure) : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {} }; #endif // GTEST_HAS_EXCEPTIONS namespace internal { // We put these helper functions in the internal namespace as IBM's xlC // compiler rejects the code if they were declared static. // Runs the given method and handles SEH exceptions it throws, when // SEH is supported; returns the 0-value for type Result in case of an // SEH exception. (Microsoft compilers cannot handle SEH and C++ // exceptions in the same function. Therefore, we provide a separate // wrapper function for handling SEH exceptions.) template Result HandleSehExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { #if GTEST_HAS_SEH __try { return (object->*method)(); } __except (internal::UnitTestOptions::GTestShouldProcessSEH( // NOLINT GetExceptionCode())) { // We create the exception message on the heap because VC++ prohibits // creation of objects with destructors on stack in functions using __try // (see error C2712). internal::String* exception_message = FormatSehExceptionMessage( GetExceptionCode(), location); internal::ReportFailureInUnknownLocation(TestPartResult::kFatalFailure, *exception_message); delete exception_message; return static_cast(0); } #else (void)location; return (object->*method)(); #endif // GTEST_HAS_SEH } // Runs the given method and catches and reports C++ and/or SEH-style // exceptions, if they are supported; returns the 0-value for type // Result in case of an SEH exception. template Result HandleExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { // NOTE: The user code can affect the way in which Google Test handles // exceptions by setting GTEST_FLAG(catch_exceptions), but only before // RUN_ALL_TESTS() starts. It is technically possible to check the flag // after the exception is caught and either report or re-throw the // exception based on the flag's value: // // try { // // Perform the test method. // } catch (...) { // if (GTEST_FLAG(catch_exceptions)) // // Report the exception as failure. // else // throw; // Re-throws the original exception. // } // // However, the purpose of this flag is to allow the program to drop into // the debugger when the exception is thrown. On most platforms, once the // control enters the catch block, the exception origin information is // lost and the debugger will stop the program at the point of the // re-throw in this function -- instead of at the point of the original // throw statement in the code under test. For this reason, we perform // the check early, sacrificing the ability to affect Google Test's // exception handling in the method where the exception is thrown. if (internal::GetUnitTestImpl()->catch_exceptions()) { #if GTEST_HAS_EXCEPTIONS try { return HandleSehExceptionsInMethodIfSupported(object, method, location); } catch (const GoogleTestFailureException&) { // NOLINT // This exception doesn't originate in code under test. It makes no // sense to report it as a test failure. throw; } catch (const std::exception& e) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(e.what(), location)); } catch (...) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(NULL, location)); } return static_cast(0); #else return HandleSehExceptionsInMethodIfSupported(object, method, location); #endif // GTEST_HAS_EXCEPTIONS } else { return (object->*method)(); } } } // namespace internal // Runs the test and updates the test result. void Test::Run() { if (!HasSameFixtureClass()) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported(this, &Test::SetUp, "SetUp()"); // We will run the test only if SetUp() was successful. if (!HasFatalFailure()) { impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TestBody, "the test body"); } // However, we want to clean up as much as possible. Hence we will // always call TearDown(), even if SetUp() or the test body has // failed. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TearDown, "TearDown()"); } // Returns true iff the current test has a fatal failure. bool Test::HasFatalFailure() { return internal::GetUnitTestImpl()->current_test_result()->HasFatalFailure(); } // Returns true iff the current test has a non-fatal failure. bool Test::HasNonfatalFailure() { return internal::GetUnitTestImpl()->current_test_result()-> HasNonfatalFailure(); } // class TestInfo // Constructs a TestInfo object. It assumes ownership of the test factory // object. // TODO(vladl@google.com): Make a_test_case_name and a_name const string&'s // to signify they cannot be NULLs. TestInfo::TestInfo(const char* a_test_case_name, const char* a_name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory) : test_case_name_(a_test_case_name), name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), value_param_(a_value_param ? new std::string(a_value_param) : NULL), fixture_class_id_(fixture_class_id), should_run_(false), is_disabled_(false), matches_filter_(false), factory_(factory), result_() {} // Destructs a TestInfo object. TestInfo::~TestInfo() { delete factory_; } namespace internal { // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param: text representation of the test's value parameter, // or NULL if this is not a value-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory) { TestInfo* const test_info = new TestInfo(test_case_name, name, type_param, value_param, fixture_class_id, factory); GetUnitTestImpl()->AddTestInfo(set_up_tc, tear_down_tc, test_info); return test_info; } #if GTEST_HAS_PARAM_TEST void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line) { Message errors; errors << "Attempted redefinition of test case " << test_case_name << ".\n" << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << test_case_name << ", you tried\n" << "to define a test using a fixture class different from the one\n" << "used earlier. This can happen if the two fixture classes are\n" << "from different namespaces and have the same name. You should\n" << "probably rename one of the classes to put the tests into different\n" << "test cases."; fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors.GetString().c_str()); } #endif // GTEST_HAS_PARAM_TEST } // namespace internal namespace { // A predicate that checks the test name of a TestInfo against a known // value. // // This is used for implementation of the TestCase class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestNameIs is copyable. class TestNameIs { public: // Constructor. // // TestNameIs has NO default constructor. explicit TestNameIs(const char* name) : name_(name) {} // Returns true iff the test name of test_info matches name_. bool operator()(const TestInfo * test_info) const { return test_info && internal::String(test_info->name()).Compare(name_) == 0; } private: internal::String name_; }; } // namespace namespace internal { // This method expands all parameterized tests registered with macros TEST_P // and INSTANTIATE_TEST_CASE_P into regular tests and registers those. // This will be done just once during the program runtime. void UnitTestImpl::RegisterParameterizedTests() { #if GTEST_HAS_PARAM_TEST if (!parameterized_tests_registered_) { parameterized_test_registry_.RegisterTests(); parameterized_tests_registered_ = true; } #endif } } // namespace internal // Creates the test object, runs it, records its result, and then // deletes it. void TestInfo::Run() { if (!should_run_) return; // Tells UnitTest where to store test result. internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_info(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); // Notifies the unit test event listeners that a test is about to start. repeater->OnTestStart(*this); const TimeInMillis start = internal::GetTimeInMillis(); impl->os_stack_trace_getter()->UponLeavingGTest(); // Creates the test object. Test* const test = internal::HandleExceptionsInMethodIfSupported( factory_, &internal::TestFactoryBase::CreateTest, "the test fixture's constructor"); // Runs the test only if the test object was created and its // constructor didn't generate a fatal failure. if ((test != NULL) && !Test::HasFatalFailure()) { // This doesn't throw as all user code that can throw are wrapped into // exception handling code. test->Run(); } // Deletes the test object. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( test, &Test::DeleteSelf_, "the test fixture's destructor"); result_.set_elapsed_time(internal::GetTimeInMillis() - start); // Notifies the unit test event listener that a test has just finished. repeater->OnTestEnd(*this); // Tells UnitTest to stop associating assertion results to this // test. impl->set_current_test_info(NULL); } // class TestCase // Gets the number of successful tests in this test case. int TestCase::successful_test_count() const { return CountIf(test_info_list_, TestPassed); } // Gets the number of failed tests in this test case. int TestCase::failed_test_count() const { return CountIf(test_info_list_, TestFailed); } int TestCase::disabled_test_count() const { return CountIf(test_info_list_, TestDisabled); } // Get the number of tests in this test case that should run. int TestCase::test_to_run_count() const { return CountIf(test_info_list_, ShouldRunTest); } // Gets the number of all tests. int TestCase::total_test_count() const { return static_cast(test_info_list_.size()); } // Creates a TestCase with the given name. // // Arguments: // // name: name of the test case // a_type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase::TestCase(const char* a_name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) : name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), set_up_tc_(set_up_tc), tear_down_tc_(tear_down_tc), should_run_(false), elapsed_time_(0) { } // Destructor of TestCase. TestCase::~TestCase() { // Deletes every Test in the collection. ForEach(test_info_list_, internal::Delete); } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* TestCase::GetTestInfo(int i) const { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* TestCase::GetMutableTestInfo(int i) { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Adds a test to this test case. Will delete the test upon // destruction of the TestCase object. void TestCase::AddTestInfo(TestInfo * test_info) { test_info_list_.push_back(test_info); test_indices_.push_back(static_cast(test_indices_.size())); } // Runs every test in this TestCase. void TestCase::Run() { if (!should_run_) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_case(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); repeater->OnTestCaseStart(*this); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunSetUpTestCase, "SetUpTestCase()"); const internal::TimeInMillis start = internal::GetTimeInMillis(); for (int i = 0; i < total_test_count(); i++) { GetMutableTestInfo(i)->Run(); } elapsed_time_ = internal::GetTimeInMillis() - start; impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunTearDownTestCase, "TearDownTestCase()"); repeater->OnTestCaseEnd(*this); impl->set_current_test_case(NULL); } // Clears the results of all tests in this test case. void TestCase::ClearResult() { ForEach(test_info_list_, TestInfo::ClearTestResult); } // Shuffles the tests in this test case. void TestCase::ShuffleTests(internal::Random* random) { Shuffle(random, &test_indices_); } // Restores the test order to before the first shuffle. void TestCase::UnshuffleTests() { for (size_t i = 0; i < test_indices_.size(); i++) { test_indices_[i] = static_cast(i); } } // Formats a countable noun. Depending on its quantity, either the // singular form or the plural form is used. e.g. // // FormatCountableNoun(1, "formula", "formuli") returns "1 formula". // FormatCountableNoun(5, "book", "books") returns "5 books". static internal::String FormatCountableNoun(int count, const char * singular_form, const char * plural_form) { return internal::String::Format("%d %s", count, count == 1 ? singular_form : plural_form); } // Formats the count of tests. static internal::String FormatTestCount(int test_count) { return FormatCountableNoun(test_count, "test", "tests"); } // Formats the count of test cases. static internal::String FormatTestCaseCount(int test_case_count) { return FormatCountableNoun(test_case_count, "test case", "test cases"); } // Converts a TestPartResult::Type enum to human-friendly string // representation. Both kNonFatalFailure and kFatalFailure are translated // to "Failure", as the user usually doesn't care about the difference // between the two when viewing the test result. static const char * TestPartResultTypeToString(TestPartResult::Type type) { switch (type) { case TestPartResult::kSuccess: return "Success"; case TestPartResult::kNonFatalFailure: case TestPartResult::kFatalFailure: #ifdef _MSC_VER return "error: "; #else return "Failure\n"; #endif default: return "Unknown result type"; } } // Prints a TestPartResult to a String. static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result) { return (Message() << internal::FormatFileLocation(test_part_result.file_name(), test_part_result.line_number()) << " " << TestPartResultTypeToString(test_part_result.type()) << test_part_result.message()).GetString(); } // Prints a TestPartResult. static void PrintTestPartResult(const TestPartResult& test_part_result) { const internal::String& result = PrintTestPartResultToString(test_part_result); printf("%s\n", result.c_str()); fflush(stdout); // If the test program runs in Visual Studio or a debugger, the // following statements add the test part result message to the Output // window such that the user can double-click on it to jump to the // corresponding source code location; otherwise they do nothing. #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // We don't call OutputDebugString*() on Windows Mobile, as printing // to stdout is done by OutputDebugString() there already - we don't // want the same message printed twice. ::OutputDebugStringA(result.c_str()); ::OutputDebugStringA("\n"); #endif } // class PrettyUnitTestResultPrinter namespace internal { enum GTestColor { COLOR_DEFAULT, COLOR_RED, COLOR_GREEN, COLOR_YELLOW }; #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns the character attribute for the given color. WORD GetColorAttribute(GTestColor color) { switch (color) { case COLOR_RED: return FOREGROUND_RED; case COLOR_GREEN: return FOREGROUND_GREEN; case COLOR_YELLOW: return FOREGROUND_RED | FOREGROUND_GREEN; default: return 0; } } #else // Returns the ANSI color code for the given color. COLOR_DEFAULT is // an invalid input. const char* GetAnsiColorCode(GTestColor color) { switch (color) { case COLOR_RED: return "1"; case COLOR_GREEN: return "2"; case COLOR_YELLOW: return "3"; default: return NULL; }; } #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns true iff Google Test should use colors in the output. bool ShouldUseColor(bool stdout_is_tty) { const char* const gtest_color = GTEST_FLAG(color).c_str(); if (String::CaseInsensitiveCStringEquals(gtest_color, "auto")) { #if GTEST_OS_WINDOWS // On Windows the TERM variable is usually not set, but the // console there does support colors. return stdout_is_tty; #else // On non-Windows platforms, we rely on the TERM variable. const char* const term = posix::GetEnv("TERM"); const bool term_supports_color = String::CStringEquals(term, "xterm") || String::CStringEquals(term, "xterm-color") || String::CStringEquals(term, "xterm-256color") || String::CStringEquals(term, "screen") || String::CStringEquals(term, "linux") || String::CStringEquals(term, "cygwin"); return stdout_is_tty && term_supports_color; #endif // GTEST_OS_WINDOWS } return String::CaseInsensitiveCStringEquals(gtest_color, "yes") || String::CaseInsensitiveCStringEquals(gtest_color, "true") || String::CaseInsensitiveCStringEquals(gtest_color, "t") || String::CStringEquals(gtest_color, "1"); // We take "yes", "true", "t", and "1" as meaning "yes". If the // value is neither one of these nor "auto", we treat it as "no" to // be conservative. } // Helpers for printing colored strings to stdout. Note that on Windows, we // cannot simply emit special characters and have the terminal change colors. // This routine must actually emit the characters rather than return a string // that would be colored when printed, as can be done on Linux. void ColoredPrintf(GTestColor color, const char* fmt, ...) { va_list args; va_start(args, fmt); #if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS const bool use_color = false; #else static const bool in_color_mode = ShouldUseColor(posix::IsATTY(posix::FileNo(stdout)) != 0); const bool use_color = in_color_mode && (color != COLOR_DEFAULT); #endif // GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS // The '!= 0' comparison is necessary to satisfy MSVC 7.1. if (!use_color) { vprintf(fmt, args); va_end(args); return; } #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE); // Gets the current text color. CONSOLE_SCREEN_BUFFER_INFO buffer_info; GetConsoleScreenBufferInfo(stdout_handle, &buffer_info); const WORD old_color_attrs = buffer_info.wAttributes; // We need to flush the stream buffers into the console before each // SetConsoleTextAttribute call lest it affect the text that is already // printed but has not yet reached the console. fflush(stdout); SetConsoleTextAttribute(stdout_handle, GetColorAttribute(color) | FOREGROUND_INTENSITY); vprintf(fmt, args); fflush(stdout); // Restores the text color. SetConsoleTextAttribute(stdout_handle, old_color_attrs); #else printf("\033[0;3%sm", GetAnsiColorCode(color)); vprintf(fmt, args); printf("\033[m"); // Resets the terminal to default. #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE va_end(args); } void PrintFullTestCommentIfPresent(const TestInfo& test_info) { const char* const type_param = test_info.type_param(); const char* const value_param = test_info.value_param(); if (type_param != NULL || value_param != NULL) { printf(", where "); if (type_param != NULL) { printf("TypeParam = %s", type_param); if (value_param != NULL) printf(" and "); } if (value_param != NULL) { printf("GetParam() = %s", value_param); } } } // This class implements the TestEventListener interface. // // Class PrettyUnitTestResultPrinter is copyable. class PrettyUnitTestResultPrinter : public TestEventListener { public: PrettyUnitTestResultPrinter() {} static void PrintTestName(const char * test_case, const char * test) { printf("%s.%s", test_case, test); } // The following methods override what's in the TestEventListener class. virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} private: static void PrintFailedTests(const UnitTest& unit_test); internal::String test_case_name_; }; // Fired before each iteration of tests starts. void PrettyUnitTestResultPrinter::OnTestIterationStart( const UnitTest& unit_test, int iteration) { if (GTEST_FLAG(repeat) != 1) printf("\nRepeating all tests (iteration %d) . . .\n\n", iteration + 1); const char* const filter = GTEST_FLAG(filter).c_str(); // Prints the filter if it's not *. This reminds the user that some // tests may be skipped. if (!internal::String::CStringEquals(filter, kUniversalFilter)) { ColoredPrintf(COLOR_YELLOW, "Note: %s filter = %s\n", GTEST_NAME_, filter); } if (internal::ShouldShard(kTestTotalShards, kTestShardIndex, false)) { const Int32 shard_index = Int32FromEnvOrDie(kTestShardIndex, -1); ColoredPrintf(COLOR_YELLOW, "Note: This is test shard %d of %s.\n", static_cast(shard_index) + 1, internal::posix::GetEnv(kTestTotalShards)); } if (GTEST_FLAG(shuffle)) { ColoredPrintf(COLOR_YELLOW, "Note: Randomizing tests' orders with a seed of %d .\n", unit_test.random_seed()); } ColoredPrintf(COLOR_GREEN, "[==========] "); printf("Running %s from %s.\n", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsSetUpStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment set-up.\n"); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseStart(const TestCase& test_case) { test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s", counts.c_str(), test_case_name_.c_str()); if (test_case.type_param() == NULL) { printf("\n"); } else { printf(", where TypeParam = %s\n", test_case.type_param()); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestStart(const TestInfo& test_info) { ColoredPrintf(COLOR_GREEN, "[ RUN ] "); PrintTestName(test_case_name_.c_str(), test_info.name()); printf("\n"); fflush(stdout); } // Called after an assertion failure. void PrettyUnitTestResultPrinter::OnTestPartResult( const TestPartResult& result) { // If the test part succeeded, we don't need to do anything. if (result.type() == TestPartResult::kSuccess) return; // Print failure message from the assertion (e.g. expected this and got that). PrintTestPartResult(result); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestEnd(const TestInfo& test_info) { if (test_info.result()->Passed()) { ColoredPrintf(COLOR_GREEN, "[ OK ] "); } else { ColoredPrintf(COLOR_RED, "[ FAILED ] "); } PrintTestName(test_case_name_.c_str(), test_info.name()); if (test_info.result()->Failed()) PrintFullTestCommentIfPresent(test_info); if (GTEST_FLAG(print_time)) { printf(" (%s ms)\n", internal::StreamableToString( test_info.result()->elapsed_time()).c_str()); } else { printf("\n"); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseEnd(const TestCase& test_case) { if (!GTEST_FLAG(print_time)) return; test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s (%s ms total)\n\n", counts.c_str(), test_case_name_.c_str(), internal::StreamableToString(test_case.elapsed_time()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsTearDownStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment tear-down\n"); fflush(stdout); } // Internal helper for printing the list of failed tests. void PrettyUnitTestResultPrinter::PrintFailedTests(const UnitTest& unit_test) { const int failed_test_count = unit_test.failed_test_count(); if (failed_test_count == 0) { return; } for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase& test_case = *unit_test.GetTestCase(i); if (!test_case.should_run() || (test_case.failed_test_count() == 0)) { continue; } for (int j = 0; j < test_case.total_test_count(); ++j) { const TestInfo& test_info = *test_case.GetTestInfo(j); if (!test_info.should_run() || test_info.result()->Passed()) { continue; } ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s.%s", test_case.name(), test_info.name()); PrintFullTestCommentIfPresent(test_info); printf("\n"); } } } void PrettyUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { ColoredPrintf(COLOR_GREEN, "[==========] "); printf("%s from %s ran.", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); if (GTEST_FLAG(print_time)) { printf(" (%s ms total)", internal::StreamableToString(unit_test.elapsed_time()).c_str()); } printf("\n"); ColoredPrintf(COLOR_GREEN, "[ PASSED ] "); printf("%s.\n", FormatTestCount(unit_test.successful_test_count()).c_str()); int num_failures = unit_test.failed_test_count(); if (!unit_test.Passed()) { const int failed_test_count = unit_test.failed_test_count(); ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s, listed below:\n", FormatTestCount(failed_test_count).c_str()); PrintFailedTests(unit_test); printf("\n%2d FAILED %s\n", num_failures, num_failures == 1 ? "TEST" : "TESTS"); } int num_disabled = unit_test.disabled_test_count(); if (num_disabled && !GTEST_FLAG(also_run_disabled_tests)) { if (!num_failures) { printf("\n"); // Add a spacer if no FAILURE banner is displayed. } ColoredPrintf(COLOR_YELLOW, " YOU HAVE %d DISABLED %s\n\n", num_disabled, num_disabled == 1 ? "TEST" : "TESTS"); } // Ensure that Google Test output is printed before, e.g., heapchecker output. fflush(stdout); } // End PrettyUnitTestResultPrinter // class TestEventRepeater // // This class forwards events to other event listeners. class TestEventRepeater : public TestEventListener { public: TestEventRepeater() : forwarding_enabled_(true) {} virtual ~TestEventRepeater(); void Append(TestEventListener *listener); TestEventListener* Release(TestEventListener* listener); // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled() const { return forwarding_enabled_; } void set_forwarding_enabled(bool enable) { forwarding_enabled_ = enable; } virtual void OnTestProgramStart(const UnitTest& unit_test); virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test); virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& unit_test); private: // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled_; // The list of listeners that receive events. std::vector listeners_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventRepeater); }; TestEventRepeater::~TestEventRepeater() { ForEach(listeners_, Delete); } void TestEventRepeater::Append(TestEventListener *listener) { listeners_.push_back(listener); } // TODO(vladl@google.com): Factor the search functionality into Vector::Find. TestEventListener* TestEventRepeater::Release(TestEventListener *listener) { for (size_t i = 0; i < listeners_.size(); ++i) { if (listeners_[i] == listener) { listeners_.erase(listeners_.begin() + i); return listener; } } return NULL; } // Since most methods are very similar, use macros to reduce boilerplate. // This defines a member that forwards the call to all listeners. #define GTEST_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (size_t i = 0; i < listeners_.size(); i++) { \ listeners_[i]->Name(parameter); \ } \ } \ } // This defines a member that forwards the call to all listeners in reverse // order. #define GTEST_REVERSE_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { \ listeners_[i]->Name(parameter); \ } \ } \ } GTEST_REPEATER_METHOD_(OnTestProgramStart, UnitTest) GTEST_REPEATER_METHOD_(OnEnvironmentsSetUpStart, UnitTest) GTEST_REPEATER_METHOD_(OnTestCaseStart, TestCase) GTEST_REPEATER_METHOD_(OnTestStart, TestInfo) GTEST_REPEATER_METHOD_(OnTestPartResult, TestPartResult) GTEST_REPEATER_METHOD_(OnEnvironmentsTearDownStart, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsSetUpEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsTearDownEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnTestEnd, TestInfo) GTEST_REVERSE_REPEATER_METHOD_(OnTestCaseEnd, TestCase) GTEST_REVERSE_REPEATER_METHOD_(OnTestProgramEnd, UnitTest) #undef GTEST_REPEATER_METHOD_ #undef GTEST_REVERSE_REPEATER_METHOD_ void TestEventRepeater::OnTestIterationStart(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (size_t i = 0; i < listeners_.size(); i++) { listeners_[i]->OnTestIterationStart(unit_test, iteration); } } } void TestEventRepeater::OnTestIterationEnd(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { listeners_[i]->OnTestIterationEnd(unit_test, iteration); } } } // End TestEventRepeater // This class generates an XML output file. class XmlUnitTestResultPrinter : public EmptyTestEventListener { public: explicit XmlUnitTestResultPrinter(const char* output_file); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); private: // Is c a whitespace character that is normalized to a space character // when it appears in an XML attribute value? static bool IsNormalizableWhitespace(char c) { return c == 0x9 || c == 0xA || c == 0xD; } // May c appear in a well-formed XML document? static bool IsValidXmlCharacter(char c) { return IsNormalizableWhitespace(c) || c >= 0x20; } // Returns an XML-escaped copy of the input string str. If // is_attribute is true, the text is meant to appear as an attribute // value, and normalizable whitespace is preserved by replacing it // with character references. static String EscapeXml(const char* str, bool is_attribute); // Returns the given string with all characters invalid in XML removed. static string RemoveInvalidXmlCharacters(const string& str); // Convenience wrapper around EscapeXml when str is an attribute value. static String EscapeXmlAttribute(const char* str) { return EscapeXml(str, true); } // Convenience wrapper around EscapeXml when str is not an attribute value. static String EscapeXmlText(const char* str) { return EscapeXml(str, false); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. static void OutputXmlCDataSection(::std::ostream* stream, const char* data); // Streams an XML representation of a TestInfo object. static void OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info); // Prints an XML representation of a TestCase object static void PrintXmlTestCase(FILE* out, const TestCase& test_case); // Prints an XML summary of unit_test to output stream out. static void PrintXmlUnitTest(FILE* out, const UnitTest& unit_test); // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. // When the String is not empty, it includes a space at the beginning, // to delimit this attribute from prior attributes. static String TestPropertiesAsXmlAttributes(const TestResult& result); // The output file. const String output_file_; GTEST_DISALLOW_COPY_AND_ASSIGN_(XmlUnitTestResultPrinter); }; // Creates a new XmlUnitTestResultPrinter. XmlUnitTestResultPrinter::XmlUnitTestResultPrinter(const char* output_file) : output_file_(output_file) { if (output_file_.c_str() == NULL || output_file_.empty()) { fprintf(stderr, "XML output file may not be null\n"); fflush(stderr); exit(EXIT_FAILURE); } } // Called after the unit test ends. void XmlUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { FILE* xmlout = NULL; FilePath output_file(output_file_); FilePath output_dir(output_file.RemoveFileName()); if (output_dir.CreateDirectoriesRecursively()) { xmlout = posix::FOpen(output_file_.c_str(), "w"); } if (xmlout == NULL) { // TODO(wan): report the reason of the failure. // // We don't do it for now as: // // 1. There is no urgent need for it. // 2. It's a bit involved to make the errno variable thread-safe on // all three operating systems (Linux, Windows, and Mac OS). // 3. To interpret the meaning of errno in a thread-safe way, // we need the strerror_r() function, which is not available on // Windows. fprintf(stderr, "Unable to open file \"%s\"\n", output_file_.c_str()); fflush(stderr); exit(EXIT_FAILURE); } PrintXmlUnitTest(xmlout, unit_test); fclose(xmlout); } // Returns an XML-escaped copy of the input string str. If is_attribute // is true, the text is meant to appear as an attribute value, and // normalizable whitespace is preserved by replacing it with character // references. // // Invalid XML characters in str, if any, are stripped from the output. // It is expected that most, if not all, of the text processed by this // module will consist of ordinary English text. // If this module is ever modified to produce version 1.1 XML output, // most invalid characters can be retained using character references. // TODO(wan): It might be nice to have a minimally invasive, human-readable // escaping scheme for invalid characters, rather than dropping them. String XmlUnitTestResultPrinter::EscapeXml(const char* str, bool is_attribute) { Message m; if (str != NULL) { for (const char* src = str; *src; ++src) { switch (*src) { case '<': m << "<"; break; case '>': m << ">"; break; case '&': m << "&"; break; case '\'': if (is_attribute) m << "'"; else m << '\''; break; case '"': if (is_attribute) m << """; else m << '"'; break; default: if (IsValidXmlCharacter(*src)) { if (is_attribute && IsNormalizableWhitespace(*src)) m << String::Format("&#x%02X;", unsigned(*src)); else m << *src; } break; } } } return m.GetString(); } // Returns the given string with all characters invalid in XML removed. // Currently invalid characters are dropped from the string. An // alternative is to replace them with certain characters such as . or ?. string XmlUnitTestResultPrinter::RemoveInvalidXmlCharacters(const string& str) { string output; output.reserve(str.size()); for (string::const_iterator it = str.begin(); it != str.end(); ++it) if (IsValidXmlCharacter(*it)) output.push_back(*it); return output; } // The following routines generate an XML representation of a UnitTest // object. // // This is how Google Test concepts map to the DTD: // // <-- corresponds to a UnitTest object // <-- corresponds to a TestCase object // <-- corresponds to a TestInfo object // ... // ... // ... // <-- individual assertion failures // // // // Formats the given time in milliseconds as seconds. std::string FormatTimeInMillisAsSeconds(TimeInMillis ms) { ::std::stringstream ss; ss << ms/1000.0; return ss.str(); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. void XmlUnitTestResultPrinter::OutputXmlCDataSection(::std::ostream* stream, const char* data) { const char* segment = data; *stream << ""); if (next_segment != NULL) { stream->write( segment, static_cast(next_segment - segment)); *stream << "]]>]]>"); } else { *stream << segment; break; } } *stream << "]]>"; } // Prints an XML representation of a TestInfo object. // TODO(wan): There is also value in printing properties with the plain printer. void XmlUnitTestResultPrinter::OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info) { const TestResult& result = *test_info.result(); *stream << " \n"; *stream << " "; const string location = internal::FormatCompilerIndependentFileLocation( part.file_name(), part.line_number()); const string message = location + "\n" + part.message(); OutputXmlCDataSection(stream, RemoveInvalidXmlCharacters(message).c_str()); *stream << "\n"; } } if (failures == 0) *stream << " />\n"; else *stream << " \n"; } // Prints an XML representation of a TestCase object void XmlUnitTestResultPrinter::PrintXmlTestCase(FILE* out, const TestCase& test_case) { fprintf(out, " \n", FormatTimeInMillisAsSeconds(test_case.elapsed_time()).c_str()); for (int i = 0; i < test_case.total_test_count(); ++i) { ::std::stringstream stream; OutputXmlTestInfo(&stream, test_case.name(), *test_case.GetTestInfo(i)); fprintf(out, "%s", StringStreamToString(&stream).c_str()); } fprintf(out, " \n"); } // Prints an XML summary of unit_test to output stream out. void XmlUnitTestResultPrinter::PrintXmlUnitTest(FILE* out, const UnitTest& unit_test) { fprintf(out, "\n"); fprintf(out, "\n"); for (int i = 0; i < unit_test.total_test_case_count(); ++i) PrintXmlTestCase(out, *unit_test.GetTestCase(i)); fprintf(out, "\n"); } // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. String XmlUnitTestResultPrinter::TestPropertiesAsXmlAttributes( const TestResult& result) { Message attributes; for (int i = 0; i < result.test_property_count(); ++i) { const TestProperty& property = result.GetTestProperty(i); attributes << " " << property.key() << "=" << "\"" << EscapeXmlAttribute(property.value()) << "\""; } return attributes.GetString(); } // End XmlUnitTestResultPrinter #if GTEST_CAN_STREAM_RESULTS_ // Streams test results to the given port on the given host machine. class StreamingListener : public EmptyTestEventListener { public: // Escapes '=', '&', '%', and '\n' characters in str as "%xx". static string UrlEncode(const char* str); StreamingListener(const string& host, const string& port) : sockfd_(-1), host_name_(host), port_num_(port) { MakeConnection(); Send("gtest_streaming_protocol_version=1.0\n"); } virtual ~StreamingListener() { if (sockfd_ != -1) CloseConnection(); } void OnTestProgramStart(const UnitTest& /* unit_test */) { Send("event=TestProgramStart\n"); } void OnTestProgramEnd(const UnitTest& unit_test) { // Note that Google Test current only report elapsed time for each // test iteration, not for the entire test program. Send(String::Format("event=TestProgramEnd&passed=%d\n", unit_test.Passed())); // Notify the streaming server to stop. CloseConnection(); } void OnTestIterationStart(const UnitTest& /* unit_test */, int iteration) { Send(String::Format("event=TestIterationStart&iteration=%d\n", iteration)); } void OnTestIterationEnd(const UnitTest& unit_test, int /* iteration */) { Send(String::Format("event=TestIterationEnd&passed=%d&elapsed_time=%sms\n", unit_test.Passed(), StreamableToString(unit_test.elapsed_time()).c_str())); } void OnTestCaseStart(const TestCase& test_case) { Send(String::Format("event=TestCaseStart&name=%s\n", test_case.name())); } void OnTestCaseEnd(const TestCase& test_case) { Send(String::Format("event=TestCaseEnd&passed=%d&elapsed_time=%sms\n", test_case.Passed(), StreamableToString(test_case.elapsed_time()).c_str())); } void OnTestStart(const TestInfo& test_info) { Send(String::Format("event=TestStart&name=%s\n", test_info.name())); } void OnTestEnd(const TestInfo& test_info) { Send(String::Format( "event=TestEnd&passed=%d&elapsed_time=%sms\n", (test_info.result())->Passed(), StreamableToString((test_info.result())->elapsed_time()).c_str())); } void OnTestPartResult(const TestPartResult& test_part_result) { const char* file_name = test_part_result.file_name(); if (file_name == NULL) file_name = ""; Send(String::Format("event=TestPartResult&file=%s&line=%d&message=", UrlEncode(file_name).c_str(), test_part_result.line_number())); Send(UrlEncode(test_part_result.message()) + "\n"); } private: // Creates a client socket and connects to the server. void MakeConnection(); // Closes the socket. void CloseConnection() { GTEST_CHECK_(sockfd_ != -1) << "CloseConnection() can be called only when there is a connection."; close(sockfd_); sockfd_ = -1; } // Sends a string to the socket. void Send(const string& message) { GTEST_CHECK_(sockfd_ != -1) << "Send() can be called only when there is a connection."; const int len = static_cast(message.length()); if (write(sockfd_, message.c_str(), len) != len) { GTEST_LOG_(WARNING) << "stream_result_to: failed to stream to " << host_name_ << ":" << port_num_; } } int sockfd_; // socket file descriptor const string host_name_; const string port_num_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamingListener); }; // class StreamingListener // Checks if str contains '=', '&', '%' or '\n' characters. If yes, // replaces them by "%xx" where xx is their hexadecimal value. For // example, replaces "=" with "%3D". This algorithm is O(strlen(str)) // in both time and space -- important as the input str may contain an // arbitrarily long test failure message and stack trace. string StreamingListener::UrlEncode(const char* str) { string result; result.reserve(strlen(str) + 1); for (char ch = *str; ch != '\0'; ch = *++str) { switch (ch) { case '%': case '=': case '&': case '\n': result.append(String::Format("%%%02x", static_cast(ch))); break; default: result.push_back(ch); break; } } return result; } void StreamingListener::MakeConnection() { GTEST_CHECK_(sockfd_ == -1) << "MakeConnection() can't be called when there is already a connection."; addrinfo hints; memset(&hints, 0, sizeof(hints)); hints.ai_family = AF_UNSPEC; // To allow both IPv4 and IPv6 addresses. hints.ai_socktype = SOCK_STREAM; addrinfo* servinfo = NULL; // Use the getaddrinfo() to get a linked list of IP addresses for // the given host name. const int error_num = getaddrinfo( host_name_.c_str(), port_num_.c_str(), &hints, &servinfo); if (error_num != 0) { GTEST_LOG_(WARNING) << "stream_result_to: getaddrinfo() failed: " << gai_strerror(error_num); } // Loop through all the results and connect to the first we can. for (addrinfo* cur_addr = servinfo; sockfd_ == -1 && cur_addr != NULL; cur_addr = cur_addr->ai_next) { sockfd_ = socket( cur_addr->ai_family, cur_addr->ai_socktype, cur_addr->ai_protocol); if (sockfd_ != -1) { // Connect the client socket to the server socket. if (connect(sockfd_, cur_addr->ai_addr, cur_addr->ai_addrlen) == -1) { close(sockfd_); sockfd_ = -1; } } } freeaddrinfo(servinfo); // all done with this structure if (sockfd_ == -1) { GTEST_LOG_(WARNING) << "stream_result_to: failed to connect to " << host_name_ << ":" << port_num_; } } // End of class Streaming Listener #endif // GTEST_CAN_STREAM_RESULTS__ // Class ScopedTrace // Pushes the given source file location and message onto a per-thread // trace stack maintained by Google Test. // L < UnitTest::mutex_ ScopedTrace::ScopedTrace(const char* file, int line, const Message& message) { TraceInfo trace; trace.file = file; trace.line = line; trace.message = message.GetString(); UnitTest::GetInstance()->PushGTestTrace(trace); } // Pops the info pushed by the c'tor. // L < UnitTest::mutex_ ScopedTrace::~ScopedTrace() { UnitTest::GetInstance()->PopGTestTrace(); } // class OsStackTraceGetter // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. // // L < mutex_ // We use "L < mutex_" to denote that the function may acquire mutex_. String OsStackTraceGetter::CurrentStackTrace(int, int) { return String(""); } // L < mutex_ void OsStackTraceGetter::UponLeavingGTest() { } const char* const OsStackTraceGetter::kElidedFramesMarker = "... " GTEST_NAME_ " internal frames ..."; } // namespace internal // class TestEventListeners TestEventListeners::TestEventListeners() : repeater_(new internal::TestEventRepeater()), default_result_printer_(NULL), default_xml_generator_(NULL) { } TestEventListeners::~TestEventListeners() { delete repeater_; } // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the user. void TestEventListeners::Append(TestEventListener* listener) { repeater_->Append(listener); } // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* TestEventListeners::Release(TestEventListener* listener) { if (listener == default_result_printer_) default_result_printer_ = NULL; else if (listener == default_xml_generator_) default_xml_generator_ = NULL; return repeater_->Release(listener); } // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* TestEventListeners::repeater() { return repeater_; } // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultResultPrinter(TestEventListener* listener) { if (default_result_printer_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_result_printer_); default_result_printer_ = listener; if (listener != NULL) Append(listener); } } // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultXmlGenerator(TestEventListener* listener) { if (default_xml_generator_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_xml_generator_); default_xml_generator_ = listener; if (listener != NULL) Append(listener); } } // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool TestEventListeners::EventForwardingEnabled() const { return repeater_->forwarding_enabled(); } void TestEventListeners::SuppressEventForwarding() { repeater_->set_forwarding_enabled(false); } // class UnitTest // Gets the singleton UnitTest object. The first time this method is // called, a UnitTest object is constructed and returned. Consecutive // calls will return the same object. // // We don't protect this under mutex_ as a user is not supposed to // call this before main() starts, from which point on the return // value will never change. UnitTest * UnitTest::GetInstance() { // When compiled with MSVC 7.1 in optimized mode, destroying the // UnitTest object upon exiting the program messes up the exit code, // causing successful tests to appear failed. We have to use a // different implementation in this case to bypass the compiler bug. // This implementation makes the compiler happy, at the cost of // leaking the UnitTest object. // CodeGear C++Builder insists on a public destructor for the // default implementation. Use this implementation to keep good OO // design with private destructor. #if (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) static UnitTest* const instance = new UnitTest; return instance; #else static UnitTest instance; return &instance; #endif // (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) } // Gets the number of successful test cases. int UnitTest::successful_test_case_count() const { return impl()->successful_test_case_count(); } // Gets the number of failed test cases. int UnitTest::failed_test_case_count() const { return impl()->failed_test_case_count(); } // Gets the number of all test cases. int UnitTest::total_test_case_count() const { return impl()->total_test_case_count(); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTest::test_case_to_run_count() const { return impl()->test_case_to_run_count(); } // Gets the number of successful tests. int UnitTest::successful_test_count() const { return impl()->successful_test_count(); } // Gets the number of failed tests. int UnitTest::failed_test_count() const { return impl()->failed_test_count(); } // Gets the number of disabled tests. int UnitTest::disabled_test_count() const { return impl()->disabled_test_count(); } // Gets the number of all tests. int UnitTest::total_test_count() const { return impl()->total_test_count(); } // Gets the number of tests that should run. int UnitTest::test_to_run_count() const { return impl()->test_to_run_count(); } // Gets the elapsed time, in milliseconds. internal::TimeInMillis UnitTest::elapsed_time() const { return impl()->elapsed_time(); } // Returns true iff the unit test passed (i.e. all test cases passed). bool UnitTest::Passed() const { return impl()->Passed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool UnitTest::Failed() const { return impl()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* UnitTest::GetTestCase(int i) const { return impl()->GetTestCase(i); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* UnitTest::GetMutableTestCase(int i) { return impl()->GetMutableTestCase(i); } // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& UnitTest::listeners() { return *impl()->listeners(); } // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in the // order they were registered. After all tests in the program have // finished, all global test environments will be torn-down in the // *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // We don't protect this under mutex_, as we only support calling it // from the main thread. Environment* UnitTest::AddEnvironment(Environment* env) { if (env == NULL) { return NULL; } impl_->environments().push_back(env); return env; } // Adds a TestPartResult to the current TestResult object. All Google Test // assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) eventually call // this to report their results. The user code should use the // assertion macros instead of calling this directly. // L < mutex_ void UnitTest::AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace) { Message msg; msg << message; internal::MutexLock lock(&mutex_); if (impl_->gtest_trace_stack().size() > 0) { msg << "\n" << GTEST_NAME_ << " trace:"; for (int i = static_cast(impl_->gtest_trace_stack().size()); i > 0; --i) { const internal::TraceInfo& trace = impl_->gtest_trace_stack()[i - 1]; msg << "\n" << internal::FormatFileLocation(trace.file, trace.line) << " " << trace.message; } } if (os_stack_trace.c_str() != NULL && !os_stack_trace.empty()) { msg << internal::kStackTraceMarker << os_stack_trace; } const TestPartResult result = TestPartResult(result_type, file_name, line_number, msg.GetString().c_str()); impl_->GetTestPartResultReporterForCurrentThread()-> ReportTestPartResult(result); if (result_type != TestPartResult::kSuccess) { // gtest_break_on_failure takes precedence over // gtest_throw_on_failure. This allows a user to set the latter // in the code (perhaps in order to use Google Test assertions // with another testing framework) and specify the former on the // command line for debugging. if (GTEST_FLAG(break_on_failure)) { #if GTEST_OS_WINDOWS // Using DebugBreak on Windows allows gtest to still break into a debugger // when a failure happens and both the --gtest_break_on_failure and // the --gtest_catch_exceptions flags are specified. DebugBreak(); #else // Dereference NULL through a volatile pointer to prevent the compiler // from removing. We use this rather than abort() or __builtin_trap() for // portability: Symbian doesn't implement abort() well, and some debuggers // don't correctly trap abort(). *static_cast(NULL) = 1; #endif // GTEST_OS_WINDOWS } else if (GTEST_FLAG(throw_on_failure)) { #if GTEST_HAS_EXCEPTIONS throw GoogleTestFailureException(result); #else // We cannot call abort() as it generates a pop-up in debug mode // that cannot be suppressed in VC 7.1 or below. exit(1); #endif } } } // Creates and adds a property to the current TestResult. If a property matching // the supplied value already exists, updates its value instead. void UnitTest::RecordPropertyForCurrentTest(const char* key, const char* value) { const TestProperty test_property(key, value); impl_->current_test_result()->RecordProperty(test_property); } // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // We don't protect this under mutex_, as we only support calling it // from the main thread. int UnitTest::Run() { // Captures the value of GTEST_FLAG(catch_exceptions). This value will be // used for the duration of the program. impl()->set_catch_exceptions(GTEST_FLAG(catch_exceptions)); #if GTEST_HAS_SEH const bool in_death_test_child_process = internal::GTEST_FLAG(internal_run_death_test).length() > 0; // Either the user wants Google Test to catch exceptions thrown by the // tests or this is executing in the context of death test child // process. In either case the user does not want to see pop-up dialogs // about crashes - they are expected. if (impl()->catch_exceptions() || in_death_test_child_process) { # if !GTEST_OS_WINDOWS_MOBILE // SetErrorMode doesn't exist on CE. SetErrorMode(SEM_FAILCRITICALERRORS | SEM_NOALIGNMENTFAULTEXCEPT | SEM_NOGPFAULTERRORBOX | SEM_NOOPENFILEERRORBOX); # endif // !GTEST_OS_WINDOWS_MOBILE # if (defined(_MSC_VER) || GTEST_OS_WINDOWS_MINGW) && !GTEST_OS_WINDOWS_MOBILE // Death test children can be terminated with _abort(). On Windows, // _abort() can show a dialog with a warning message. This forces the // abort message to go to stderr instead. _set_error_mode(_OUT_TO_STDERR); # endif # if _MSC_VER >= 1400 && !GTEST_OS_WINDOWS_MOBILE // In the debug version, Visual Studio pops up a separate dialog // offering a choice to debug the aborted program. We need to suppress // this dialog or it will pop up for every EXPECT/ASSERT_DEATH statement // executed. Google Test will notify the user of any unexpected // failure via stderr. // // VC++ doesn't define _set_abort_behavior() prior to the version 8.0. // Users of prior VC versions shall suffer the agony and pain of // clicking through the countless debug dialogs. // TODO(vladl@google.com): find a way to suppress the abort dialog() in the // debug mode when compiled with VC 7.1 or lower. if (!GTEST_FLAG(break_on_failure)) _set_abort_behavior( 0x0, // Clear the following flags: _WRITE_ABORT_MSG | _CALL_REPORTFAULT); // pop-up window, core dump. # endif } #endif // GTEST_HAS_SEH return internal::HandleExceptionsInMethodIfSupported( impl(), &internal::UnitTestImpl::RunAllTests, "auxiliary test code (environments or event listeners)") ? 0 : 1; } // Returns the working directory when the first TEST() or TEST_F() was // executed. const char* UnitTest::original_working_dir() const { return impl_->original_working_dir_.c_str(); } // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestCase* UnitTest::current_test_case() const { internal::MutexLock lock(&mutex_); return impl_->current_test_case(); } // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestInfo* UnitTest::current_test_info() const { internal::MutexLock lock(&mutex_); return impl_->current_test_info(); } // Returns the random seed used at the start of the current test run. int UnitTest::random_seed() const { return impl_->random_seed(); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // L < mutex_ internal::ParameterizedTestCaseRegistry& UnitTest::parameterized_test_registry() { return impl_->parameterized_test_registry(); } #endif // GTEST_HAS_PARAM_TEST // Creates an empty UnitTest. UnitTest::UnitTest() { impl_ = new internal::UnitTestImpl(this); } // Destructor of UnitTest. UnitTest::~UnitTest() { delete impl_; } // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. // L < mutex_ void UnitTest::PushGTestTrace(const internal::TraceInfo& trace) { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().push_back(trace); } // Pops a trace from the per-thread Google Test trace stack. // L < mutex_ void UnitTest::PopGTestTrace() { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().pop_back(); } namespace internal { UnitTestImpl::UnitTestImpl(UnitTest* parent) : parent_(parent), #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355 // (using this in initializer). default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), # pragma warning(pop) // Restores the warning state again. #else default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), #endif // _MSC_VER global_test_part_result_repoter_( &default_global_test_part_result_reporter_), per_thread_test_part_result_reporter_( &default_per_thread_test_part_result_reporter_), #if GTEST_HAS_PARAM_TEST parameterized_test_registry_(), parameterized_tests_registered_(false), #endif // GTEST_HAS_PARAM_TEST last_death_test_case_(-1), current_test_case_(NULL), current_test_info_(NULL), ad_hoc_test_result_(), os_stack_trace_getter_(NULL), post_flag_parse_init_performed_(false), random_seed_(0), // Will be overridden by the flag before first use. random_(0), // Will be reseeded before first use. elapsed_time_(0), #if GTEST_HAS_DEATH_TEST internal_run_death_test_flag_(NULL), death_test_factory_(new DefaultDeathTestFactory), #endif // Will be overridden by the flag before first use. catch_exceptions_(false) { listeners()->SetDefaultResultPrinter(new PrettyUnitTestResultPrinter); } UnitTestImpl::~UnitTestImpl() { // Deletes every TestCase. ForEach(test_cases_, internal::Delete); // Deletes every Environment. ForEach(environments_, internal::Delete); delete os_stack_trace_getter_; } #if GTEST_HAS_DEATH_TEST // Disables event forwarding if the control is currently in a death test // subprocess. Must not be called before InitGoogleTest. void UnitTestImpl::SuppressTestEventsIfInSubprocess() { if (internal_run_death_test_flag_.get() != NULL) listeners()->SuppressEventForwarding(); } #endif // GTEST_HAS_DEATH_TEST // Initializes event listeners performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureXmlOutput() { const String& output_format = UnitTestOptions::GetOutputFormat(); if (output_format == "xml") { listeners()->SetDefaultXmlGenerator(new XmlUnitTestResultPrinter( UnitTestOptions::GetAbsolutePathToOutputFile().c_str())); } else if (output_format != "") { printf("WARNING: unrecognized output format \"%s\" ignored.\n", output_format.c_str()); fflush(stdout); } } #if GTEST_CAN_STREAM_RESULTS_ // Initializes event listeners for streaming test results in String form. // Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureStreamingOutput() { const string& target = GTEST_FLAG(stream_result_to); if (!target.empty()) { const size_t pos = target.find(':'); if (pos != string::npos) { listeners()->Append(new StreamingListener(target.substr(0, pos), target.substr(pos+1))); } else { printf("WARNING: unrecognized streaming target \"%s\" ignored.\n", target.c_str()); fflush(stdout); } } } #endif // GTEST_CAN_STREAM_RESULTS_ // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void UnitTestImpl::PostFlagParsingInit() { // Ensures that this function does not execute more than once. if (!post_flag_parse_init_performed_) { post_flag_parse_init_performed_ = true; #if GTEST_HAS_DEATH_TEST InitDeathTestSubprocessControlInfo(); SuppressTestEventsIfInSubprocess(); #endif // GTEST_HAS_DEATH_TEST // Registers parameterized tests. This makes parameterized tests // available to the UnitTest reflection API without running // RUN_ALL_TESTS. RegisterParameterizedTests(); // Configures listeners for XML output. This makes it possible for users // to shut down the default XML output before invoking RUN_ALL_TESTS. ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Configures listeners for streaming test results to the specified server. ConfigureStreamingOutput(); #endif // GTEST_CAN_STREAM_RESULTS_ } } // A predicate that checks the name of a TestCase against a known // value. // // This is used for implementation of the UnitTest class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestCaseNameIs is copyable. class TestCaseNameIs { public: // Constructor. explicit TestCaseNameIs(const String& name) : name_(name) {} // Returns true iff the name of test_case matches name_. bool operator()(const TestCase* test_case) const { return test_case != NULL && strcmp(test_case->name(), name_.c_str()) == 0; } private: String name_; }; // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. It's the CALLER'S // RESPONSIBILITY to ensure that this function is only called WHEN THE // TESTS ARE NOT SHUFFLED. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* UnitTestImpl::GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) { // Can we find a TestCase with the given name? const std::vector::const_iterator test_case = std::find_if(test_cases_.begin(), test_cases_.end(), TestCaseNameIs(test_case_name)); if (test_case != test_cases_.end()) return *test_case; // No. Let's create one. TestCase* const new_test_case = new TestCase(test_case_name, type_param, set_up_tc, tear_down_tc); // Is this a death test case? if (internal::UnitTestOptions::MatchesFilter(String(test_case_name), kDeathTestCaseFilter)) { // Yes. Inserts the test case after the last death test case // defined so far. This only works when the test cases haven't // been shuffled. Otherwise we may end up running a death test // after a non-death test. ++last_death_test_case_; test_cases_.insert(test_cases_.begin() + last_death_test_case_, new_test_case); } else { // No. Appends to the end of the list. test_cases_.push_back(new_test_case); } test_case_indices_.push_back(static_cast(test_case_indices_.size())); return new_test_case; } // Helpers for setting up / tearing down the given environment. They // are for use in the ForEach() function. static void SetUpEnvironment(Environment* env) { env->SetUp(); } static void TearDownEnvironment(Environment* env) { env->TearDown(); } // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, the test is considered to be failed, but the // rest of the tests will still be run. // // When parameterized tests are enabled, it expands and registers // parameterized tests first in RegisterParameterizedTests(). // All other functions called from RunAllTests() may safely assume that // parameterized tests are ready to be counted and run. bool UnitTestImpl::RunAllTests() { // Makes sure InitGoogleTest() was called. if (!GTestIsInitialized()) { printf("%s", "\nThis test program did NOT call ::testing::InitGoogleTest " "before calling RUN_ALL_TESTS(). Please fix it.\n"); return false; } // Do not run any test if the --help flag was specified. if (g_help_flag) return true; // Repeats the call to the post-flag parsing initialization in case the // user didn't call InitGoogleTest. PostFlagParsingInit(); // Even if sharding is not on, test runners may want to use the // GTEST_SHARD_STATUS_FILE to query whether the test supports the sharding // protocol. internal::WriteToShardStatusFileIfNeeded(); // True iff we are in a subprocess for running a thread-safe-style // death test. bool in_subprocess_for_death_test = false; #if GTEST_HAS_DEATH_TEST in_subprocess_for_death_test = (internal_run_death_test_flag_.get() != NULL); #endif // GTEST_HAS_DEATH_TEST const bool should_shard = ShouldShard(kTestTotalShards, kTestShardIndex, in_subprocess_for_death_test); // Compares the full test names with the filter to decide which // tests to run. const bool has_tests_to_run = FilterTests(should_shard ? HONOR_SHARDING_PROTOCOL : IGNORE_SHARDING_PROTOCOL) > 0; // Lists the tests and exits if the --gtest_list_tests flag was specified. if (GTEST_FLAG(list_tests)) { // This must be called *after* FilterTests() has been called. ListTestsMatchingFilter(); return true; } random_seed_ = GTEST_FLAG(shuffle) ? GetRandomSeedFromFlag(GTEST_FLAG(random_seed)) : 0; // True iff at least one test has failed. bool failed = false; TestEventListener* repeater = listeners()->repeater(); repeater->OnTestProgramStart(*parent_); // How many times to repeat the tests? We don't want to repeat them // when we are inside the subprocess of a death test. const int repeat = in_subprocess_for_death_test ? 1 : GTEST_FLAG(repeat); // Repeats forever if the repeat count is negative. const bool forever = repeat < 0; for (int i = 0; forever || i != repeat; i++) { // We want to preserve failures generated by ad-hoc test // assertions executed before RUN_ALL_TESTS(). ClearNonAdHocTestResult(); const TimeInMillis start = GetTimeInMillis(); // Shuffles test cases and tests if requested. if (has_tests_to_run && GTEST_FLAG(shuffle)) { random()->Reseed(random_seed_); // This should be done before calling OnTestIterationStart(), // such that a test event listener can see the actual test order // in the event. ShuffleTests(); } // Tells the unit test event listeners that the tests are about to start. repeater->OnTestIterationStart(*parent_, i); // Runs each test case if there is at least one test to run. if (has_tests_to_run) { // Sets up all environments beforehand. repeater->OnEnvironmentsSetUpStart(*parent_); ForEach(environments_, SetUpEnvironment); repeater->OnEnvironmentsSetUpEnd(*parent_); // Runs the tests only if there was no fatal failure during global // set-up. if (!Test::HasFatalFailure()) { for (int test_index = 0; test_index < total_test_case_count(); test_index++) { GetMutableTestCase(test_index)->Run(); } } // Tears down all environments in reverse order afterwards. repeater->OnEnvironmentsTearDownStart(*parent_); std::for_each(environments_.rbegin(), environments_.rend(), TearDownEnvironment); repeater->OnEnvironmentsTearDownEnd(*parent_); } elapsed_time_ = GetTimeInMillis() - start; // Tells the unit test event listener that the tests have just finished. repeater->OnTestIterationEnd(*parent_, i); // Gets the result and clears it. if (!Passed()) { failed = true; } // Restores the original test order after the iteration. This // allows the user to quickly repro a failure that happens in the // N-th iteration without repeating the first (N - 1) iterations. // This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in // case the user somehow changes the value of the flag somewhere // (it's always safe to unshuffle the tests). UnshuffleTests(); if (GTEST_FLAG(shuffle)) { // Picks a new random seed for each iteration. random_seed_ = GetNextRandomSeed(random_seed_); } } repeater->OnTestProgramEnd(*parent_); return !failed; } // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded() { const char* const test_shard_file = posix::GetEnv(kTestShardStatusFile); if (test_shard_file != NULL) { FILE* const file = posix::FOpen(test_shard_file, "w"); if (file == NULL) { ColoredPrintf(COLOR_RED, "Could not write to the test shard status file \"%s\" " "specified by the %s environment variable.\n", test_shard_file, kTestShardStatusFile); fflush(stdout); exit(EXIT_FAILURE); } fclose(file); } } // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (i.e., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. bool ShouldShard(const char* total_shards_env, const char* shard_index_env, bool in_subprocess_for_death_test) { if (in_subprocess_for_death_test) { return false; } const Int32 total_shards = Int32FromEnvOrDie(total_shards_env, -1); const Int32 shard_index = Int32FromEnvOrDie(shard_index_env, -1); if (total_shards == -1 && shard_index == -1) { return false; } else if (total_shards == -1 && shard_index != -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestShardIndex << " = " << shard_index << ", but have left " << kTestTotalShards << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (total_shards != -1 && shard_index == -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestTotalShards << " = " << total_shards << ", but have left " << kTestShardIndex << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (shard_index < 0 || shard_index >= total_shards) { const Message msg = Message() << "Invalid environment variables: we require 0 <= " << kTestShardIndex << " < " << kTestTotalShards << ", but you have " << kTestShardIndex << "=" << shard_index << ", " << kTestTotalShards << "=" << total_shards << ".\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } return total_shards > 1; } // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error // and aborts. Int32 Int32FromEnvOrDie(const char* var, Int32 default_val) { const char* str_val = posix::GetEnv(var); if (str_val == NULL) { return default_val; } Int32 result; if (!ParseInt32(Message() << "The value of environment variable " << var, str_val, &result)) { exit(EXIT_FAILURE); } return result; } // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. bool ShouldRunTestOnShard(int total_shards, int shard_index, int test_id) { return (test_id % total_shards) == shard_index; } // Compares the name of each test with the user-specified filter to // decide whether the test should be run, then records the result in // each TestCase and TestInfo object. // If shard_tests == true, further filters tests based on sharding // variables in the environment - see // http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide. // Returns the number of tests that should run. int UnitTestImpl::FilterTests(ReactionToSharding shard_tests) { const Int32 total_shards = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestTotalShards, -1) : -1; const Int32 shard_index = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestShardIndex, -1) : -1; // num_runnable_tests are the number of tests that will // run across all shards (i.e., match filter and are not disabled). // num_selected_tests are the number of tests to be run on // this shard. int num_runnable_tests = 0; int num_selected_tests = 0; for (size_t i = 0; i < test_cases_.size(); i++) { TestCase* const test_case = test_cases_[i]; const String &test_case_name = test_case->name(); test_case->set_should_run(false); for (size_t j = 0; j < test_case->test_info_list().size(); j++) { TestInfo* const test_info = test_case->test_info_list()[j]; const String test_name(test_info->name()); // A test is disabled if test case name or test name matches // kDisableTestFilter. const bool is_disabled = internal::UnitTestOptions::MatchesFilter(test_case_name, kDisableTestFilter) || internal::UnitTestOptions::MatchesFilter(test_name, kDisableTestFilter); test_info->is_disabled_ = is_disabled; const bool matches_filter = internal::UnitTestOptions::FilterMatchesTest(test_case_name, test_name); test_info->matches_filter_ = matches_filter; const bool is_runnable = (GTEST_FLAG(also_run_disabled_tests) || !is_disabled) && matches_filter; const bool is_selected = is_runnable && (shard_tests == IGNORE_SHARDING_PROTOCOL || ShouldRunTestOnShard(total_shards, shard_index, num_runnable_tests)); num_runnable_tests += is_runnable; num_selected_tests += is_selected; test_info->should_run_ = is_selected; test_case->set_should_run(test_case->should_run() || is_selected); } } return num_selected_tests; } // Prints the names of the tests matching the user-specified filter flag. void UnitTestImpl::ListTestsMatchingFilter() { for (size_t i = 0; i < test_cases_.size(); i++) { const TestCase* const test_case = test_cases_[i]; bool printed_test_case_name = false; for (size_t j = 0; j < test_case->test_info_list().size(); j++) { const TestInfo* const test_info = test_case->test_info_list()[j]; if (test_info->matches_filter_) { if (!printed_test_case_name) { printed_test_case_name = true; printf("%s.\n", test_case->name()); } printf(" %s\n", test_info->name()); } } } fflush(stdout); } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter are // the same; otherwise, deletes the old getter and makes the input the // current getter. void UnitTestImpl::set_os_stack_trace_getter( OsStackTraceGetterInterface* getter) { if (os_stack_trace_getter_ != getter) { delete os_stack_trace_getter_; os_stack_trace_getter_ = getter; } } // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* UnitTestImpl::os_stack_trace_getter() { if (os_stack_trace_getter_ == NULL) { os_stack_trace_getter_ = new OsStackTraceGetter; } return os_stack_trace_getter_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* UnitTestImpl::current_test_result() { return current_test_info_ ? &(current_test_info_->result_) : &ad_hoc_test_result_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void UnitTestImpl::ShuffleTests() { // Shuffles the death test cases. ShuffleRange(random(), 0, last_death_test_case_ + 1, &test_case_indices_); // Shuffles the non-death test cases. ShuffleRange(random(), last_death_test_case_ + 1, static_cast(test_cases_.size()), &test_case_indices_); // Shuffles the tests inside each test case. for (size_t i = 0; i < test_cases_.size(); i++) { test_cases_[i]->ShuffleTests(random()); } } // Restores the test cases and tests to their order before the first shuffle. void UnitTestImpl::UnshuffleTests() { for (size_t i = 0; i < test_cases_.size(); i++) { // Unshuffles the tests in each test case. test_cases_[i]->UnshuffleTests(); // Resets the index of each test case. test_case_indices_[i] = static_cast(i); } } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. String GetCurrentOsStackTraceExceptTop(UnitTest* /*unit_test*/, int skip_count) { // We pass skip_count + 1 to skip this wrapper function in addition // to what the user really wants to skip. return GetUnitTestImpl()->CurrentOsStackTraceExceptTop(skip_count + 1); } // Used by the GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_ macro to // suppress unreachable code warnings. namespace { class ClassUniqueToAlwaysTrue {}; } bool IsTrue(bool condition) { return condition; } bool AlwaysTrue() { #if GTEST_HAS_EXCEPTIONS // This condition is always false so AlwaysTrue() never actually throws, // but it makes the compiler think that it may throw. if (IsTrue(false)) throw ClassUniqueToAlwaysTrue(); #endif // GTEST_HAS_EXCEPTIONS return true; } // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. bool SkipPrefix(const char* prefix, const char** pstr) { const size_t prefix_len = strlen(prefix); if (strncmp(*pstr, prefix, prefix_len) == 0) { *pstr += prefix_len; return true; } return false; } // Parses a string as a command line flag. The string should have // the format "--flag=value". When def_optional is true, the "=value" // part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. const char* ParseFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--" followed by GTEST_FLAG_PREFIX_. const String flag_str = String::Format("--%s%s", GTEST_FLAG_PREFIX_, flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a bool flag, in the form of either // "--flag=value" or "--flag". // // In the former case, the value is taken as true as long as it does // not start with '0', 'f', or 'F'. // // In the latter case, the value is taken as true. // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for an Int32 flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseInt32Flag(const char* str, const char* flag, Int32* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. return ParseInt32(Message() << "The value of flag --" << flag, value_str, value); } // Parses a string for a string flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // Determines whether a string has a prefix that Google Test uses for its // flags, i.e., starts with GTEST_FLAG_PREFIX_ or GTEST_FLAG_PREFIX_DASH_. // If Google Test detects that a command line flag has its prefix but is not // recognized, it will print its help message. Flags starting with // GTEST_INTERNAL_PREFIX_ followed by "internal_" are considered Google Test // internal flags and do not trigger the help message. static bool HasGoogleTestFlagPrefix(const char* str) { return (SkipPrefix("--", &str) || SkipPrefix("-", &str) || SkipPrefix("/", &str)) && !SkipPrefix(GTEST_FLAG_PREFIX_ "internal_", &str) && (SkipPrefix(GTEST_FLAG_PREFIX_, &str) || SkipPrefix(GTEST_FLAG_PREFIX_DASH_, &str)); } // Prints a string containing code-encoded text. The following escape // sequences can be used in the string to control the text color: // // @@ prints a single '@' character. // @R changes the color to red. // @G changes the color to green. // @Y changes the color to yellow. // @D changes to the default terminal text color. // // TODO(wan@google.com): Write tests for this once we add stdout // capturing to Google Test. static void PrintColorEncoded(const char* str) { GTestColor color = COLOR_DEFAULT; // The current color. // Conceptually, we split the string into segments divided by escape // sequences. Then we print one segment at a time. At the end of // each iteration, the str pointer advances to the beginning of the // next segment. for (;;) { const char* p = strchr(str, '@'); if (p == NULL) { ColoredPrintf(color, "%s", str); return; } ColoredPrintf(color, "%s", String(str, p - str).c_str()); const char ch = p[1]; str = p + 2; if (ch == '@') { ColoredPrintf(color, "@"); } else if (ch == 'D') { color = COLOR_DEFAULT; } else if (ch == 'R') { color = COLOR_RED; } else if (ch == 'G') { color = COLOR_GREEN; } else if (ch == 'Y') { color = COLOR_YELLOW; } else { --str; } } } static const char kColorEncodedHelpMessage[] = "This program contains tests written using " GTEST_NAME_ ". You can use the\n" "following command line flags to control its behavior:\n" "\n" "Test Selection:\n" " @G--" GTEST_FLAG_PREFIX_ "list_tests@D\n" " List the names of all tests instead of running them. The name of\n" " TEST(Foo, Bar) is \"Foo.Bar\".\n" " @G--" GTEST_FLAG_PREFIX_ "filter=@YPOSTIVE_PATTERNS" "[@G-@YNEGATIVE_PATTERNS]@D\n" " Run only the tests whose name matches one of the positive patterns but\n" " none of the negative patterns. '?' matches any single character; '*'\n" " matches any substring; ':' separates two patterns.\n" " @G--" GTEST_FLAG_PREFIX_ "also_run_disabled_tests@D\n" " Run all disabled tests too.\n" "\n" "Test Execution:\n" " @G--" GTEST_FLAG_PREFIX_ "repeat=@Y[COUNT]@D\n" " Run the tests repeatedly; use a negative count to repeat forever.\n" " @G--" GTEST_FLAG_PREFIX_ "shuffle@D\n" " Randomize tests' orders on every iteration.\n" " @G--" GTEST_FLAG_PREFIX_ "random_seed=@Y[NUMBER]@D\n" " Random number seed to use for shuffling test orders (between 1 and\n" " 99999, or 0 to use a seed based on the current time).\n" "\n" "Test Output:\n" " @G--" GTEST_FLAG_PREFIX_ "color=@Y(@Gyes@Y|@Gno@Y|@Gauto@Y)@D\n" " Enable/disable colored output. The default is @Gauto@D.\n" " -@G-" GTEST_FLAG_PREFIX_ "print_time=0@D\n" " Don't print the elapsed time of each test.\n" " @G--" GTEST_FLAG_PREFIX_ "output=xml@Y[@G:@YDIRECTORY_PATH@G" GTEST_PATH_SEP_ "@Y|@G:@YFILE_PATH]@D\n" " Generate an XML report in the given directory or with the given file\n" " name. @YFILE_PATH@D defaults to @Gtest_details.xml@D.\n" #if GTEST_CAN_STREAM_RESULTS_ " @G--" GTEST_FLAG_PREFIX_ "stream_result_to=@YHOST@G:@YPORT@D\n" " Stream test results to the given server.\n" #endif // GTEST_CAN_STREAM_RESULTS_ "\n" "Assertion Behavior:\n" #if GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "death_test_style=@Y(@Gfast@Y|@Gthreadsafe@Y)@D\n" " Set the default death test style.\n" #endif // GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "break_on_failure@D\n" " Turn assertion failures into debugger break-points.\n" " @G--" GTEST_FLAG_PREFIX_ "throw_on_failure@D\n" " Turn assertion failures into C++ exceptions.\n" " @G--" GTEST_FLAG_PREFIX_ "catch_exceptions=0@D\n" " Do not report exceptions as test failures. Instead, allow them\n" " to crash the program or throw a pop-up (on Windows).\n" "\n" "Except for @G--" GTEST_FLAG_PREFIX_ "list_tests@D, you can alternatively set " "the corresponding\n" "environment variable of a flag (all letters in upper-case). For example, to\n" "disable colored text output, you can either specify @G--" GTEST_FLAG_PREFIX_ "color=no@D or set\n" "the @G" GTEST_FLAG_PREFIX_UPPER_ "COLOR@D environment variable to @Gno@D.\n" "\n" "For more information, please read the " GTEST_NAME_ " documentation at\n" "@G" GTEST_PROJECT_URL_ "@D. If you find a bug in " GTEST_NAME_ "\n" "(not one in your own code or tests), please report it to\n" "@G<" GTEST_DEV_EMAIL_ ">@D.\n"; // Parses the command line for Google Test flags, without initializing // other parts of Google Test. The type parameter CharType can be // instantiated to either char or wchar_t. template void ParseGoogleTestFlagsOnlyImpl(int* argc, CharType** argv) { for (int i = 1; i < *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); using internal::ParseBoolFlag; using internal::ParseInt32Flag; using internal::ParseStringFlag; // Do we see a Google Test flag? if (ParseBoolFlag(arg, kAlsoRunDisabledTestsFlag, >EST_FLAG(also_run_disabled_tests)) || ParseBoolFlag(arg, kBreakOnFailureFlag, >EST_FLAG(break_on_failure)) || ParseBoolFlag(arg, kCatchExceptionsFlag, >EST_FLAG(catch_exceptions)) || ParseStringFlag(arg, kColorFlag, >EST_FLAG(color)) || ParseStringFlag(arg, kDeathTestStyleFlag, >EST_FLAG(death_test_style)) || ParseBoolFlag(arg, kDeathTestUseFork, >EST_FLAG(death_test_use_fork)) || ParseStringFlag(arg, kFilterFlag, >EST_FLAG(filter)) || ParseStringFlag(arg, kInternalRunDeathTestFlag, >EST_FLAG(internal_run_death_test)) || ParseBoolFlag(arg, kListTestsFlag, >EST_FLAG(list_tests)) || ParseStringFlag(arg, kOutputFlag, >EST_FLAG(output)) || ParseBoolFlag(arg, kPrintTimeFlag, >EST_FLAG(print_time)) || ParseInt32Flag(arg, kRandomSeedFlag, >EST_FLAG(random_seed)) || ParseInt32Flag(arg, kRepeatFlag, >EST_FLAG(repeat)) || ParseBoolFlag(arg, kShuffleFlag, >EST_FLAG(shuffle)) || ParseInt32Flag(arg, kStackTraceDepthFlag, >EST_FLAG(stack_trace_depth)) || ParseStringFlag(arg, kStreamResultToFlag, >EST_FLAG(stream_result_to)) || ParseBoolFlag(arg, kThrowOnFailureFlag, >EST_FLAG(throw_on_failure)) ) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } else if (arg_string == "--help" || arg_string == "-h" || arg_string == "-?" || arg_string == "/?" || HasGoogleTestFlagPrefix(arg)) { // Both help flag and unrecognized Google Test flags (excluding // internal ones) trigger help display. g_help_flag = true; } } if (g_help_flag) { // We print the help here instead of in RUN_ALL_TESTS(), as the // latter may not be called at all if the user is using Google // Test with another testing framework. PrintColorEncoded(kColorEncodedHelpMessage); } } // Parses the command line for Google Test flags, without initializing // other parts of Google Test. void ParseGoogleTestFlagsOnly(int* argc, char** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } // The internal implementation of InitGoogleTest(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleTestImpl(int* argc, CharType** argv) { g_init_gtest_count++; // We don't want to run the initialization code twice. if (g_init_gtest_count != 1) return; if (*argc <= 0) return; internal::g_executable_path = internal::StreamableToString(argv[0]); #if GTEST_HAS_DEATH_TEST g_argvs.clear(); for (int i = 0; i != *argc; i++) { g_argvs.push_back(StreamableToString(argv[i])); } #endif // GTEST_HAS_DEATH_TEST ParseGoogleTestFlagsOnly(argc, argv); GetUnitTestImpl()->PostFlagParsingInit(); } } // namespace internal // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. void InitGoogleTest(int* argc, char** argv) { internal::InitGoogleTestImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleTest(int* argc, wchar_t** argv) { internal::InitGoogleTestImpl(argc, argv); } } // namespace testing // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // // This file implements death tests. #if GTEST_HAS_DEATH_TEST # if GTEST_OS_MAC # include # endif // GTEST_OS_MAC # include # include # include # include # if GTEST_OS_WINDOWS # include # else # include # include # endif // GTEST_OS_WINDOWS #endif // GTEST_HAS_DEATH_TEST // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { // Constants. // The default death test style. static const char kDefaultDeathTestStyle[] = "fast"; GTEST_DEFINE_string_( death_test_style, internal::StringFromGTestEnv("death_test_style", kDefaultDeathTestStyle), "Indicates how to run a death test in a forked child process: " "\"threadsafe\" (child process re-executes the test binary " "from the beginning, running only the specific death test) or " "\"fast\" (child process runs the death test immediately " "after forking)."); GTEST_DEFINE_bool_( death_test_use_fork, internal::BoolFromGTestEnv("death_test_use_fork", false), "Instructs to use fork()/_exit() instead of clone() in death tests. " "Ignored and always uses fork() on POSIX systems where clone() is not " "implemented. Useful when running under valgrind or similar tools if " "those do not support clone(). Valgrind 3.3.1 will just fail if " "it sees an unsupported combination of clone() flags. " "It is not recommended to use this flag w/o valgrind though it will " "work in 99% of the cases. Once valgrind is fixed, this flag will " "most likely be removed."); namespace internal { GTEST_DEFINE_string_( internal_run_death_test, "", "Indicates the file, line number, temporal index of " "the single death test to run, and a file descriptor to " "which a success code may be sent, all separated by " "colons. This flag is specified if and only if the current " "process is a sub-process launched for running a thread-safe " "death test. FOR INTERNAL USE ONLY."); } // namespace internal #if GTEST_HAS_DEATH_TEST // ExitedWithCode constructor. ExitedWithCode::ExitedWithCode(int exit_code) : exit_code_(exit_code) { } // ExitedWithCode function-call operator. bool ExitedWithCode::operator()(int exit_status) const { # if GTEST_OS_WINDOWS return exit_status == exit_code_; # else return WIFEXITED(exit_status) && WEXITSTATUS(exit_status) == exit_code_; # endif // GTEST_OS_WINDOWS } # if !GTEST_OS_WINDOWS // KilledBySignal constructor. KilledBySignal::KilledBySignal(int signum) : signum_(signum) { } // KilledBySignal function-call operator. bool KilledBySignal::operator()(int exit_status) const { return WIFSIGNALED(exit_status) && WTERMSIG(exit_status) == signum_; } # endif // !GTEST_OS_WINDOWS namespace internal { // Utilities needed for death tests. // Generates a textual description of a given exit code, in the format // specified by wait(2). static String ExitSummary(int exit_code) { Message m; # if GTEST_OS_WINDOWS m << "Exited with exit status " << exit_code; # else if (WIFEXITED(exit_code)) { m << "Exited with exit status " << WEXITSTATUS(exit_code); } else if (WIFSIGNALED(exit_code)) { m << "Terminated by signal " << WTERMSIG(exit_code); } # ifdef WCOREDUMP if (WCOREDUMP(exit_code)) { m << " (core dumped)"; } # endif # endif // GTEST_OS_WINDOWS return m.GetString(); } // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. bool ExitedUnsuccessfully(int exit_status) { return !ExitedWithCode(0)(exit_status); } # if !GTEST_OS_WINDOWS // Generates a textual failure message when a death test finds more than // one thread running, or cannot determine the number of threads, prior // to executing the given statement. It is the responsibility of the // caller not to pass a thread_count of 1. static String DeathTestThreadWarning(size_t thread_count) { Message msg; msg << "Death tests use fork(), which is unsafe particularly" << " in a threaded context. For this test, " << GTEST_NAME_ << " "; if (thread_count == 0) msg << "couldn't detect the number of threads."; else msg << "detected " << thread_count << " threads."; return msg.GetString(); } # endif // !GTEST_OS_WINDOWS // Flag characters for reporting a death test that did not die. static const char kDeathTestLived = 'L'; static const char kDeathTestReturned = 'R'; static const char kDeathTestThrew = 'T'; static const char kDeathTestInternalError = 'I'; // An enumeration describing all of the possible ways that a death test can // conclude. DIED means that the process died while executing the test // code; LIVED means that process lived beyond the end of the test code; // RETURNED means that the test statement attempted to execute a return // statement, which is not allowed; THREW means that the test statement // returned control by throwing an exception. IN_PROGRESS means the test // has not yet concluded. // TODO(vladl@google.com): Unify names and possibly values for // AbortReason, DeathTestOutcome, and flag characters above. enum DeathTestOutcome { IN_PROGRESS, DIED, LIVED, RETURNED, THREW }; // Routine for aborting the program which is safe to call from an // exec-style death test child process, in which case the error // message is propagated back to the parent process. Otherwise, the // message is simply printed to stderr. In either case, the program // then exits with status 1. void DeathTestAbort(const String& message) { // On a POSIX system, this function may be called from a threadsafe-style // death test child process, which operates on a very small stack. Use // the heap for any additional non-minuscule memory requirements. const InternalRunDeathTestFlag* const flag = GetUnitTestImpl()->internal_run_death_test_flag(); if (flag != NULL) { FILE* parent = posix::FDOpen(flag->write_fd(), "w"); fputc(kDeathTestInternalError, parent); fprintf(parent, "%s", message.c_str()); fflush(parent); _exit(1); } else { fprintf(stderr, "%s", message.c_str()); fflush(stderr); posix::Abort(); } } // A replacement for CHECK that calls DeathTestAbort if the assertion // fails. # define GTEST_DEATH_TEST_CHECK_(expression) \ do { \ if (!::testing::internal::IsTrue(expression)) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // This macro is similar to GTEST_DEATH_TEST_CHECK_, but it is meant for // evaluating any system call that fulfills two conditions: it must return // -1 on failure, and set errno to EINTR when it is interrupted and // should be tried again. The macro expands to a loop that repeatedly // evaluates the expression as long as it evaluates to -1 and sets // errno to EINTR. If the expression evaluates to -1 but errno is // something other than EINTR, DeathTestAbort is called. # define GTEST_DEATH_TEST_CHECK_SYSCALL_(expression) \ do { \ int gtest_retval; \ do { \ gtest_retval = (expression); \ } while (gtest_retval == -1 && errno == EINTR); \ if (gtest_retval == -1) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s != -1", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // Returns the message describing the last system error in errno. String GetLastErrnoDescription() { return String(errno == 0 ? "" : posix::StrError(errno)); } // This is called from a death test parent process to read a failure // message from the death test child process and log it with the FATAL // severity. On Windows, the message is read from a pipe handle. On other // platforms, it is read from a file descriptor. static void FailFromInternalError(int fd) { Message error; char buffer[256]; int num_read; do { while ((num_read = posix::Read(fd, buffer, 255)) > 0) { buffer[num_read] = '\0'; error << buffer; } } while (num_read == -1 && errno == EINTR); if (num_read == 0) { GTEST_LOG_(FATAL) << error.GetString(); } else { const int last_error = errno; GTEST_LOG_(FATAL) << "Error while reading death test internal: " << GetLastErrnoDescription() << " [" << last_error << "]"; } } // Death test constructor. Increments the running death test count // for the current test. DeathTest::DeathTest() { TestInfo* const info = GetUnitTestImpl()->current_test_info(); if (info == NULL) { DeathTestAbort("Cannot run a death test outside of a TEST or " "TEST_F construct"); } } // Creates and returns a death test by dispatching to the current // death test factory. bool DeathTest::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { return GetUnitTestImpl()->death_test_factory()->Create( statement, regex, file, line, test); } const char* DeathTest::LastMessage() { return last_death_test_message_.c_str(); } void DeathTest::set_last_death_test_message(const String& message) { last_death_test_message_ = message; } String DeathTest::last_death_test_message_; // Provides cross platform implementation for some death functionality. class DeathTestImpl : public DeathTest { protected: DeathTestImpl(const char* a_statement, const RE* a_regex) : statement_(a_statement), regex_(a_regex), spawned_(false), status_(-1), outcome_(IN_PROGRESS), read_fd_(-1), write_fd_(-1) {} // read_fd_ is expected to be closed and cleared by a derived class. ~DeathTestImpl() { GTEST_DEATH_TEST_CHECK_(read_fd_ == -1); } void Abort(AbortReason reason); virtual bool Passed(bool status_ok); const char* statement() const { return statement_; } const RE* regex() const { return regex_; } bool spawned() const { return spawned_; } void set_spawned(bool is_spawned) { spawned_ = is_spawned; } int status() const { return status_; } void set_status(int a_status) { status_ = a_status; } DeathTestOutcome outcome() const { return outcome_; } void set_outcome(DeathTestOutcome an_outcome) { outcome_ = an_outcome; } int read_fd() const { return read_fd_; } void set_read_fd(int fd) { read_fd_ = fd; } int write_fd() const { return write_fd_; } void set_write_fd(int fd) { write_fd_ = fd; } // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void ReadAndInterpretStatusByte(); private: // The textual content of the code this object is testing. This class // doesn't own this string and should not attempt to delete it. const char* const statement_; // The regular expression which test output must match. DeathTestImpl // doesn't own this object and should not attempt to delete it. const RE* const regex_; // True if the death test child process has been successfully spawned. bool spawned_; // The exit status of the child process. int status_; // How the death test concluded. DeathTestOutcome outcome_; // Descriptor to the read end of the pipe to the child process. It is // always -1 in the child process. The child keeps its write end of the // pipe in write_fd_. int read_fd_; // Descriptor to the child's write end of the pipe to the parent process. // It is always -1 in the parent process. The parent keeps its end of the // pipe in read_fd_. int write_fd_; }; // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void DeathTestImpl::ReadAndInterpretStatusByte() { char flag; int bytes_read; // The read() here blocks until data is available (signifying the // failure of the death test) or until the pipe is closed (signifying // its success), so it's okay to call this in the parent before // the child process has exited. do { bytes_read = posix::Read(read_fd(), &flag, 1); } while (bytes_read == -1 && errno == EINTR); if (bytes_read == 0) { set_outcome(DIED); } else if (bytes_read == 1) { switch (flag) { case kDeathTestReturned: set_outcome(RETURNED); break; case kDeathTestThrew: set_outcome(THREW); break; case kDeathTestLived: set_outcome(LIVED); break; case kDeathTestInternalError: FailFromInternalError(read_fd()); // Does not return. break; default: GTEST_LOG_(FATAL) << "Death test child process reported " << "unexpected status byte (" << static_cast(flag) << ")"; } } else { GTEST_LOG_(FATAL) << "Read from death test child process failed: " << GetLastErrnoDescription(); } GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Close(read_fd())); set_read_fd(-1); } // Signals that the death test code which should have exited, didn't. // Should be called only in a death test child process. // Writes a status byte to the child's status file descriptor, then // calls _exit(1). void DeathTestImpl::Abort(AbortReason reason) { // The parent process considers the death test to be a failure if // it finds any data in our pipe. So, here we write a single flag byte // to the pipe, then exit. const char status_ch = reason == TEST_DID_NOT_DIE ? kDeathTestLived : reason == TEST_THREW_EXCEPTION ? kDeathTestThrew : kDeathTestReturned; GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Write(write_fd(), &status_ch, 1)); // We are leaking the descriptor here because on some platforms (i.e., // when built as Windows DLL), destructors of global objects will still // run after calling _exit(). On such systems, write_fd_ will be // indirectly closed from the destructor of UnitTestImpl, causing double // close if it is also closed here. On debug configurations, double close // may assert. As there are no in-process buffers to flush here, we are // relying on the OS to close the descriptor after the process terminates // when the destructors are not run. _exit(1); // Exits w/o any normal exit hooks (we were supposed to crash) } // Returns an indented copy of stderr output for a death test. // This makes distinguishing death test output lines from regular log lines // much easier. static ::std::string FormatDeathTestOutput(const ::std::string& output) { ::std::string ret; for (size_t at = 0; ; ) { const size_t line_end = output.find('\n', at); ret += "[ DEATH ] "; if (line_end == ::std::string::npos) { ret += output.substr(at); break; } ret += output.substr(at, line_end + 1 - at); at = line_end + 1; } return ret; } // Assesses the success or failure of a death test, using both private // members which have previously been set, and one argument: // // Private data members: // outcome: An enumeration describing how the death test // concluded: DIED, LIVED, THREW, or RETURNED. The death test // fails in the latter three cases. // status: The exit status of the child process. On *nix, it is in the // in the format specified by wait(2). On Windows, this is the // value supplied to the ExitProcess() API or a numeric code // of the exception that terminated the program. // regex: A regular expression object to be applied to // the test's captured standard error output; the death test // fails if it does not match. // // Argument: // status_ok: true if exit_status is acceptable in the context of // this particular death test, which fails if it is false // // Returns true iff all of the above conditions are met. Otherwise, the // first failing condition, in the order given above, is the one that is // reported. Also sets the last death test message string. bool DeathTestImpl::Passed(bool status_ok) { if (!spawned()) return false; const String error_message = GetCapturedStderr(); bool success = false; Message buffer; buffer << "Death test: " << statement() << "\n"; switch (outcome()) { case LIVED: buffer << " Result: failed to die.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case THREW: buffer << " Result: threw an exception.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case RETURNED: buffer << " Result: illegal return in test statement.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case DIED: if (status_ok) { const bool matched = RE::PartialMatch(error_message.c_str(), *regex()); if (matched) { success = true; } else { buffer << " Result: died but not with expected error.\n" << " Expected: " << regex()->pattern() << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } } else { buffer << " Result: died but not with expected exit code:\n" << " " << ExitSummary(status()) << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } break; case IN_PROGRESS: default: GTEST_LOG_(FATAL) << "DeathTest::Passed somehow called before conclusion of test"; } DeathTest::set_last_death_test_message(buffer.GetString()); return success; } # if GTEST_OS_WINDOWS // WindowsDeathTest implements death tests on Windows. Due to the // specifics of starting new processes on Windows, death tests there are // always threadsafe, and Google Test considers the // --gtest_death_test_style=fast setting to be equivalent to // --gtest_death_test_style=threadsafe there. // // A few implementation notes: Like the Linux version, the Windows // implementation uses pipes for child-to-parent communication. But due to // the specifics of pipes on Windows, some extra steps are required: // // 1. The parent creates a communication pipe and stores handles to both // ends of it. // 2. The parent starts the child and provides it with the information // necessary to acquire the handle to the write end of the pipe. // 3. The child acquires the write end of the pipe and signals the parent // using a Windows event. // 4. Now the parent can release the write end of the pipe on its side. If // this is done before step 3, the object's reference count goes down to // 0 and it is destroyed, preventing the child from acquiring it. The // parent now has to release it, or read operations on the read end of // the pipe will not return when the child terminates. // 5. The parent reads child's output through the pipe (outcome code and // any possible error messages) from the pipe, and its stderr and then // determines whether to fail the test. // // Note: to distinguish Win32 API calls from the local method and function // calls, the former are explicitly resolved in the global namespace. // class WindowsDeathTest : public DeathTestImpl { public: WindowsDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : DeathTestImpl(a_statement, a_regex), file_(file), line_(line) {} // All of these virtual functions are inherited from DeathTest. virtual int Wait(); virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; // Handle to the write end of the pipe to the child process. AutoHandle write_handle_; // Child process handle. AutoHandle child_handle_; // Event the child process uses to signal the parent that it has // acquired the handle to the write end of the pipe. After seeing this // event the parent can release its own handles to make sure its // ReadFile() calls return when the child terminates. AutoHandle event_handle_; }; // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int WindowsDeathTest::Wait() { if (!spawned()) return 0; // Wait until the child either signals that it has acquired the write end // of the pipe or it dies. const HANDLE wait_handles[2] = { child_handle_.Get(), event_handle_.Get() }; switch (::WaitForMultipleObjects(2, wait_handles, FALSE, // Waits for any of the handles. INFINITE)) { case WAIT_OBJECT_0: case WAIT_OBJECT_0 + 1: break; default: GTEST_DEATH_TEST_CHECK_(false); // Should not get here. } // The child has acquired the write end of the pipe or exited. // We release the handle on our side and continue. write_handle_.Reset(); event_handle_.Reset(); ReadAndInterpretStatusByte(); // Waits for the child process to exit if it haven't already. This // returns immediately if the child has already exited, regardless of // whether previous calls to WaitForMultipleObjects synchronized on this // handle or not. GTEST_DEATH_TEST_CHECK_( WAIT_OBJECT_0 == ::WaitForSingleObject(child_handle_.Get(), INFINITE)); DWORD status_code; GTEST_DEATH_TEST_CHECK_( ::GetExitCodeProcess(child_handle_.Get(), &status_code) != FALSE); child_handle_.Reset(); set_status(static_cast(status_code)); return status(); } // The AssumeRole process for a Windows death test. It creates a child // process with the same executable as the current process to run the // death test. The child process is given the --gtest_filter and // --gtest_internal_run_death_test flags such that it knows to run the // current death test only. DeathTest::TestRole WindowsDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { // ParseInternalRunDeathTestFlag() has performed all the necessary // processing. set_write_fd(flag->write_fd()); return EXECUTE_TEST; } // WindowsDeathTest uses an anonymous pipe to communicate results of // a death test. SECURITY_ATTRIBUTES handles_are_inheritable = { sizeof(SECURITY_ATTRIBUTES), NULL, TRUE }; HANDLE read_handle, write_handle; GTEST_DEATH_TEST_CHECK_( ::CreatePipe(&read_handle, &write_handle, &handles_are_inheritable, 0) // Default buffer size. != FALSE); set_read_fd(::_open_osfhandle(reinterpret_cast(read_handle), O_RDONLY)); write_handle_.Reset(write_handle); event_handle_.Reset(::CreateEvent( &handles_are_inheritable, TRUE, // The event will automatically reset to non-signaled state. FALSE, // The initial state is non-signalled. NULL)); // The even is unnamed. GTEST_DEATH_TEST_CHECK_(event_handle_.Get() != NULL); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format( "--%s%s=%s|%d|%d|%u|%Iu|%Iu", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, static_cast(::GetCurrentProcessId()), // size_t has the same with as pointers on both 32-bit and 64-bit // Windows platforms. // See http://msdn.microsoft.com/en-us/library/tcxf1dw6.aspx. reinterpret_cast(write_handle), reinterpret_cast(event_handle_.Get())); char executable_path[_MAX_PATH + 1]; // NOLINT GTEST_DEATH_TEST_CHECK_( _MAX_PATH + 1 != ::GetModuleFileNameA(NULL, executable_path, _MAX_PATH)); String command_line = String::Format("%s %s \"%s\"", ::GetCommandLineA(), filter_flag.c_str(), internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // Flush the log buffers since the log streams are shared with the child. FlushInfoLog(); // The child process will share the standard handles with the parent. STARTUPINFOA startup_info; memset(&startup_info, 0, sizeof(STARTUPINFO)); startup_info.dwFlags = STARTF_USESTDHANDLES; startup_info.hStdInput = ::GetStdHandle(STD_INPUT_HANDLE); startup_info.hStdOutput = ::GetStdHandle(STD_OUTPUT_HANDLE); startup_info.hStdError = ::GetStdHandle(STD_ERROR_HANDLE); PROCESS_INFORMATION process_info; GTEST_DEATH_TEST_CHECK_(::CreateProcessA( executable_path, const_cast(command_line.c_str()), NULL, // Retuned process handle is not inheritable. NULL, // Retuned thread handle is not inheritable. TRUE, // Child inherits all inheritable handles (for write_handle_). 0x0, // Default creation flags. NULL, // Inherit the parent's environment. UnitTest::GetInstance()->original_working_dir(), &startup_info, &process_info) != FALSE); child_handle_.Reset(process_info.hProcess); ::CloseHandle(process_info.hThread); set_spawned(true); return OVERSEE_TEST; } # else // We are not on Windows. // ForkingDeathTest provides implementations for most of the abstract // methods of the DeathTest interface. Only the AssumeRole method is // left undefined. class ForkingDeathTest : public DeathTestImpl { public: ForkingDeathTest(const char* statement, const RE* regex); // All of these virtual functions are inherited from DeathTest. virtual int Wait(); protected: void set_child_pid(pid_t child_pid) { child_pid_ = child_pid; } private: // PID of child process during death test; 0 in the child process itself. pid_t child_pid_; }; // Constructs a ForkingDeathTest. ForkingDeathTest::ForkingDeathTest(const char* a_statement, const RE* a_regex) : DeathTestImpl(a_statement, a_regex), child_pid_(-1) {} // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int ForkingDeathTest::Wait() { if (!spawned()) return 0; ReadAndInterpretStatusByte(); int status_value; GTEST_DEATH_TEST_CHECK_SYSCALL_(waitpid(child_pid_, &status_value, 0)); set_status(status_value); return status_value; } // A concrete death test class that forks, then immediately runs the test // in the child process. class NoExecDeathTest : public ForkingDeathTest { public: NoExecDeathTest(const char* a_statement, const RE* a_regex) : ForkingDeathTest(a_statement, a_regex) { } virtual TestRole AssumeRole(); }; // The AssumeRole process for a fork-and-run death test. It implements a // straightforward fork, with a simple pipe to transmit the status byte. DeathTest::TestRole NoExecDeathTest::AssumeRole() { const size_t thread_count = GetThreadCount(); if (thread_count != 1) { GTEST_LOG_(WARNING) << DeathTestThreadWarning(thread_count); } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); DeathTest::set_last_death_test_message(""); CaptureStderr(); // When we fork the process below, the log file buffers are copied, but the // file descriptors are shared. We flush all log files here so that closing // the file descriptors in the child process doesn't throw off the // synchronization between descriptors and buffers in the parent process. // This is as close to the fork as possible to avoid a race condition in case // there are multiple threads running before the death test, and another // thread writes to the log file. FlushInfoLog(); const pid_t child_pid = fork(); GTEST_DEATH_TEST_CHECK_(child_pid != -1); set_child_pid(child_pid); if (child_pid == 0) { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[0])); set_write_fd(pipe_fd[1]); // Redirects all logging to stderr in the child process to prevent // concurrent writes to the log files. We capture stderr in the parent // process and append the child process' output to a log. LogToStderr(); // Event forwarding to the listeners of event listener API mush be shut // down in death test subprocesses. GetUnitTestImpl()->listeners()->SuppressEventForwarding(); return EXECUTE_TEST; } else { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } } // A concrete death test class that forks and re-executes the main // program from the beginning, with command-line flags set that cause // only this specific death test to be run. class ExecDeathTest : public ForkingDeathTest { public: ExecDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : ForkingDeathTest(a_statement, a_regex), file_(file), line_(line) { } virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; }; // Utility class for accumulating command-line arguments. class Arguments { public: Arguments() { args_.push_back(NULL); } ~Arguments() { for (std::vector::iterator i = args_.begin(); i != args_.end(); ++i) { free(*i); } } void AddArgument(const char* argument) { args_.insert(args_.end() - 1, posix::StrDup(argument)); } template void AddArguments(const ::std::vector& arguments) { for (typename ::std::vector::const_iterator i = arguments.begin(); i != arguments.end(); ++i) { args_.insert(args_.end() - 1, posix::StrDup(i->c_str())); } } char* const* Argv() { return &args_[0]; } private: std::vector args_; }; // A struct that encompasses the arguments to the child process of a // threadsafe-style death test process. struct ExecDeathTestArgs { char* const* argv; // Command-line arguments for the child's call to exec int close_fd; // File descriptor to close; the read end of a pipe }; # if GTEST_OS_MAC inline char** GetEnviron() { // When Google Test is built as a framework on MacOS X, the environ variable // is unavailable. Apple's documentation (man environ) recommends using // _NSGetEnviron() instead. return *_NSGetEnviron(); } # else // Some POSIX platforms expect you to declare environ. extern "C" makes // it reside in the global namespace. extern "C" char** environ; inline char** GetEnviron() { return environ; } # endif // GTEST_OS_MAC // The main function for a threadsafe-style death test child process. // This function is called in a clone()-ed process and thus must avoid // any potentially unsafe operations like malloc or libc functions. static int ExecDeathTestChildMain(void* child_arg) { ExecDeathTestArgs* const args = static_cast(child_arg); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(args->close_fd)); // We need to execute the test program in the same environment where // it was originally invoked. Therefore we change to the original // working directory first. const char* const original_dir = UnitTest::GetInstance()->original_working_dir(); // We can safely call chdir() as it's a direct system call. if (chdir(original_dir) != 0) { DeathTestAbort(String::Format("chdir(\"%s\") failed: %s", original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // We can safely call execve() as it's a direct system call. We // cannot use execvp() as it's a libc function and thus potentially // unsafe. Since execve() doesn't search the PATH, the user must // invoke the test program via a valid path that contains at least // one path separator. execve(args->argv[0], args->argv, GetEnviron()); DeathTestAbort(String::Format("execve(%s, ...) in %s failed: %s", args->argv[0], original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // Two utility routines that together determine the direction the stack // grows. // This could be accomplished more elegantly by a single recursive // function, but we want to guard against the unlikely possibility of // a smart compiler optimizing the recursion away. // // GTEST_NO_INLINE_ is required to prevent GCC 4.6 from inlining // StackLowerThanAddress into StackGrowsDown, which then doesn't give // correct answer. bool StackLowerThanAddress(const void* ptr) GTEST_NO_INLINE_; bool StackLowerThanAddress(const void* ptr) { int dummy; return &dummy < ptr; } bool StackGrowsDown() { int dummy; return StackLowerThanAddress(&dummy); } // A threadsafe implementation of fork(2) for threadsafe-style death tests // that uses clone(2). It dies with an error message if anything goes // wrong. static pid_t ExecDeathTestFork(char* const* argv, int close_fd) { ExecDeathTestArgs args = { argv, close_fd }; pid_t child_pid = -1; # if GTEST_HAS_CLONE const bool use_fork = GTEST_FLAG(death_test_use_fork); if (!use_fork) { static const bool stack_grows_down = StackGrowsDown(); const size_t stack_size = getpagesize(); // MMAP_ANONYMOUS is not defined on Mac, so we use MAP_ANON instead. void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0); GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); void* const stack_top = static_cast(stack) + (stack_grows_down ? stack_size : 0); child_pid = clone(&ExecDeathTestChildMain, stack_top, SIGCHLD, &args); GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1); } # else const bool use_fork = true; # endif // GTEST_HAS_CLONE if (use_fork && (child_pid = fork()) == 0) { ExecDeathTestChildMain(&args); _exit(0); } GTEST_DEATH_TEST_CHECK_(child_pid != -1); return child_pid; } // The AssumeRole process for a fork-and-exec death test. It re-executes the // main program from the beginning, setting the --gtest_filter // and --gtest_internal_run_death_test flags to cause only the current // death test to be re-run. DeathTest::TestRole ExecDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { set_write_fd(flag->write_fd()); return EXECUTE_TEST; } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); // Clear the close-on-exec flag on the write end of the pipe, lest // it be closed when the child process does an exec: GTEST_DEATH_TEST_CHECK_(fcntl(pipe_fd[1], F_SETFD, 0) != -1); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format("--%s%s=%s|%d|%d|%d", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, pipe_fd[1]); Arguments args; args.AddArguments(GetArgvs()); args.AddArgument(filter_flag.c_str()); args.AddArgument(internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // See the comment in NoExecDeathTest::AssumeRole for why the next line // is necessary. FlushInfoLog(); const pid_t child_pid = ExecDeathTestFork(args.Argv(), pipe_fd[0]); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_child_pid(child_pid); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } # endif // !GTEST_OS_WINDOWS // Creates a concrete DeathTest-derived class that depends on the // --gtest_death_test_style flag, and sets the pointer pointed to // by the "test" argument to its address. If the test should be // skipped, sets that pointer to NULL. Returns true, unless the // flag is set to an invalid value. bool DefaultDeathTestFactory::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const int death_test_index = impl->current_test_info() ->increment_death_test_count(); if (flag != NULL) { if (death_test_index > flag->index()) { DeathTest::set_last_death_test_message(String::Format( "Death test count (%d) somehow exceeded expected maximum (%d)", death_test_index, flag->index())); return false; } if (!(flag->file() == file && flag->line() == line && flag->index() == death_test_index)) { *test = NULL; return true; } } # if GTEST_OS_WINDOWS if (GTEST_FLAG(death_test_style) == "threadsafe" || GTEST_FLAG(death_test_style) == "fast") { *test = new WindowsDeathTest(statement, regex, file, line); } # else if (GTEST_FLAG(death_test_style) == "threadsafe") { *test = new ExecDeathTest(statement, regex, file, line); } else if (GTEST_FLAG(death_test_style) == "fast") { *test = new NoExecDeathTest(statement, regex); } # endif // GTEST_OS_WINDOWS else { // NOLINT - this is more readable than unbalanced brackets inside #if. DeathTest::set_last_death_test_message(String::Format( "Unknown death test style \"%s\" encountered", GTEST_FLAG(death_test_style).c_str())); return false; } return true; } // Splits a given string on a given delimiter, populating a given // vector with the fields. GTEST_HAS_DEATH_TEST implies that we have // ::std::string, so we can use it here. static void SplitString(const ::std::string& str, char delimiter, ::std::vector< ::std::string>* dest) { ::std::vector< ::std::string> parsed; ::std::string::size_type pos = 0; while (::testing::internal::AlwaysTrue()) { const ::std::string::size_type colon = str.find(delimiter, pos); if (colon == ::std::string::npos) { parsed.push_back(str.substr(pos)); break; } else { parsed.push_back(str.substr(pos, colon - pos)); pos = colon + 1; } } dest->swap(parsed); } # if GTEST_OS_WINDOWS // Recreates the pipe and event handles from the provided parameters, // signals the event, and returns a file descriptor wrapped around the pipe // handle. This function is called in the child process only. int GetStatusFileDescriptor(unsigned int parent_process_id, size_t write_handle_as_size_t, size_t event_handle_as_size_t) { AutoHandle parent_process_handle(::OpenProcess(PROCESS_DUP_HANDLE, FALSE, // Non-inheritable. parent_process_id)); if (parent_process_handle.Get() == INVALID_HANDLE_VALUE) { DeathTestAbort(String::Format("Unable to open parent process %u", parent_process_id)); } // TODO(vladl@google.com): Replace the following check with a // compile-time assertion when available. GTEST_CHECK_(sizeof(HANDLE) <= sizeof(size_t)); const HANDLE write_handle = reinterpret_cast(write_handle_as_size_t); HANDLE dup_write_handle; // The newly initialized handle is accessible only in in the parent // process. To obtain one accessible within the child, we need to use // DuplicateHandle. if (!::DuplicateHandle(parent_process_handle.Get(), write_handle, ::GetCurrentProcess(), &dup_write_handle, 0x0, // Requested privileges ignored since // DUPLICATE_SAME_ACCESS is used. FALSE, // Request non-inheritable handler. DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the pipe handle %Iu from the parent process %u", write_handle_as_size_t, parent_process_id)); } const HANDLE event_handle = reinterpret_cast(event_handle_as_size_t); HANDLE dup_event_handle; if (!::DuplicateHandle(parent_process_handle.Get(), event_handle, ::GetCurrentProcess(), &dup_event_handle, 0x0, FALSE, DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the event handle %Iu from the parent process %u", event_handle_as_size_t, parent_process_id)); } const int write_fd = ::_open_osfhandle(reinterpret_cast(dup_write_handle), O_APPEND); if (write_fd == -1) { DeathTestAbort(String::Format( "Unable to convert pipe handle %Iu to a file descriptor", write_handle_as_size_t)); } // Signals the parent that the write end of the pipe has been acquired // so the parent can release its own write end. ::SetEvent(dup_event_handle); return write_fd; } # endif // GTEST_OS_WINDOWS // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag() { if (GTEST_FLAG(internal_run_death_test) == "") return NULL; // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we // can use it here. int line = -1; int index = -1; ::std::vector< ::std::string> fields; SplitString(GTEST_FLAG(internal_run_death_test).c_str(), '|', &fields); int write_fd = -1; # if GTEST_OS_WINDOWS unsigned int parent_process_id = 0; size_t write_handle_as_size_t = 0; size_t event_handle_as_size_t = 0; if (fields.size() != 6 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &parent_process_id) || !ParseNaturalNumber(fields[4], &write_handle_as_size_t) || !ParseNaturalNumber(fields[5], &event_handle_as_size_t)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } write_fd = GetStatusFileDescriptor(parent_process_id, write_handle_as_size_t, event_handle_as_size_t); # else if (fields.size() != 4 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &write_fd)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } # endif // GTEST_OS_WINDOWS return new InternalRunDeathTestFlag(fields[0], line, index, write_fd); } } // namespace internal #endif // GTEST_HAS_DEATH_TEST } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: keith.ray@gmail.com (Keith Ray) #include #if GTEST_OS_WINDOWS_MOBILE # include #elif GTEST_OS_WINDOWS # include # include #elif GTEST_OS_SYMBIAN || GTEST_OS_NACL // Symbian OpenC and NaCl have PATH_MAX in sys/syslimits.h # include #else # include # include // Some Linux distributions define PATH_MAX here. #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_WINDOWS # define GTEST_PATH_MAX_ _MAX_PATH #elif defined(PATH_MAX) # define GTEST_PATH_MAX_ PATH_MAX #elif defined(_XOPEN_PATH_MAX) # define GTEST_PATH_MAX_ _XOPEN_PATH_MAX #else # define GTEST_PATH_MAX_ _POSIX_PATH_MAX #endif // GTEST_OS_WINDOWS namespace testing { namespace internal { #if GTEST_OS_WINDOWS // On Windows, '\\' is the standard path separator, but many tools and the // Windows API also accept '/' as an alternate path separator. Unless otherwise // noted, a file path can contain either kind of path separators, or a mixture // of them. const char kPathSeparator = '\\'; const char kAlternatePathSeparator = '/'; const char kPathSeparatorString[] = "\\"; const char kAlternatePathSeparatorString[] = "/"; # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory. You should not use // the current directory in tests on Windows CE, but this at least // provides a reasonable fallback. const char kCurrentDirectoryString[] = "\\"; // Windows CE doesn't define INVALID_FILE_ATTRIBUTES const DWORD kInvalidFileAttributes = 0xffffffff; # else const char kCurrentDirectoryString[] = ".\\"; # endif // GTEST_OS_WINDOWS_MOBILE #else const char kPathSeparator = '/'; const char kPathSeparatorString[] = "/"; const char kCurrentDirectoryString[] = "./"; #endif // GTEST_OS_WINDOWS // Returns whether the given character is a valid path separator. static bool IsPathSeparator(char c) { #if GTEST_HAS_ALT_PATH_SEP_ return (c == kPathSeparator) || (c == kAlternatePathSeparator); #else return c == kPathSeparator; #endif } // Returns the current working directory, or "" if unsuccessful. FilePath FilePath::GetCurrentDir() { #if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory, so we just return // something reasonable. return FilePath(kCurrentDirectoryString); #elif GTEST_OS_WINDOWS char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(_getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #else char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #endif // GTEST_OS_WINDOWS_MOBILE } // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath FilePath::RemoveExtension(const char* extension) const { String dot_extension(String::Format(".%s", extension)); if (pathname_.EndsWithCaseInsensitive(dot_extension.c_str())) { return FilePath(String(pathname_.c_str(), pathname_.length() - 4)); } return *this; } // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FilePath::FindLastPathSeparator() const { const char* const last_sep = strrchr(c_str(), kPathSeparator); #if GTEST_HAS_ALT_PATH_SEP_ const char* const last_alt_sep = strrchr(c_str(), kAlternatePathSeparator); // Comparing two pointers of which only one is NULL is undefined. if (last_alt_sep != NULL && (last_sep == NULL || last_alt_sep > last_sep)) { return last_alt_sep; } #endif return last_sep; } // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveDirectoryName() const { const char* const last_sep = FindLastPathSeparator(); return last_sep ? FilePath(String(last_sep + 1)) : *this; } // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveFileName() const { const char* const last_sep = FindLastPathSeparator(); String dir; if (last_sep) { dir = String(c_str(), last_sep + 1 - c_str()); } else { dir = kCurrentDirectoryString; } return FilePath(dir); } // Helper functions for naming files in a directory for xml output. // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. FilePath FilePath::MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension) { String file; if (number == 0) { file = String::Format("%s.%s", base_name.c_str(), extension); } else { file = String::Format("%s_%d.%s", base_name.c_str(), number, extension); } return ConcatPaths(directory, FilePath(file)); } // Given directory = "dir", relative_path = "test.xml", returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. FilePath FilePath::ConcatPaths(const FilePath& directory, const FilePath& relative_path) { if (directory.IsEmpty()) return relative_path; const FilePath dir(directory.RemoveTrailingPathSeparator()); return FilePath(String::Format("%s%c%s", dir.c_str(), kPathSeparator, relative_path.c_str())); } // Returns true if pathname describes something findable in the file-system, // either a file, directory, or whatever. bool FilePath::FileOrDirectoryExists() const { #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(pathname_.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; return attributes != kInvalidFileAttributes; #else posix::StatStruct file_stat; return posix::Stat(pathname_.c_str(), &file_stat) == 0; #endif // GTEST_OS_WINDOWS_MOBILE } // Returns true if pathname describes a directory in the file-system // that exists. bool FilePath::DirectoryExists() const { bool result = false; #if GTEST_OS_WINDOWS // Don't strip off trailing separator if path is a root directory on // Windows (like "C:\\"). const FilePath& path(IsRootDirectory() ? *this : RemoveTrailingPathSeparator()); #else const FilePath& path(*this); #endif #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(path.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; if ((attributes != kInvalidFileAttributes) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) { result = true; } #else posix::StatStruct file_stat; result = posix::Stat(path.c_str(), &file_stat) == 0 && posix::IsDir(file_stat); #endif // GTEST_OS_WINDOWS_MOBILE return result; } // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool FilePath::IsRootDirectory() const { #if GTEST_OS_WINDOWS // TODO(wan@google.com): on Windows a network share like // \\server\share can be a root directory, although it cannot be the // current directory. Handle this properly. return pathname_.length() == 3 && IsAbsolutePath(); #else return pathname_.length() == 1 && IsPathSeparator(pathname_.c_str()[0]); #endif } // Returns true if pathname describes an absolute path. bool FilePath::IsAbsolutePath() const { const char* const name = pathname_.c_str(); #if GTEST_OS_WINDOWS return pathname_.length() >= 3 && ((name[0] >= 'a' && name[0] <= 'z') || (name[0] >= 'A' && name[0] <= 'Z')) && name[1] == ':' && IsPathSeparator(name[2]); #else return IsPathSeparator(name[0]); #endif } // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. FilePath FilePath::GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension) { FilePath full_pathname; int number = 0; do { full_pathname.Set(MakeFileName(directory, base_name, number++, extension)); } while (full_pathname.FileOrDirectoryExists()); return full_pathname; } // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool FilePath::IsDirectory() const { return !pathname_.empty() && IsPathSeparator(pathname_.c_str()[pathname_.length() - 1]); } // Create directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create directories // for any reason. bool FilePath::CreateDirectoriesRecursively() const { if (!this->IsDirectory()) { return false; } if (pathname_.length() == 0 || this->DirectoryExists()) { return true; } const FilePath parent(this->RemoveTrailingPathSeparator().RemoveFileName()); return parent.CreateDirectoriesRecursively() && this->CreateFolder(); } // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool FilePath::CreateFolder() const { #if GTEST_OS_WINDOWS_MOBILE FilePath removed_sep(this->RemoveTrailingPathSeparator()); LPCWSTR unicode = String::AnsiToUtf16(removed_sep.c_str()); int result = CreateDirectory(unicode, NULL) ? 0 : -1; delete [] unicode; #elif GTEST_OS_WINDOWS int result = _mkdir(pathname_.c_str()); #else int result = mkdir(pathname_.c_str(), 0777); #endif // GTEST_OS_WINDOWS_MOBILE if (result == -1) { return this->DirectoryExists(); // An error is OK if the directory exists. } return true; // No error. } // If input name has a trailing separator character, remove it and return the // name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath FilePath::RemoveTrailingPathSeparator() const { return IsDirectory() ? FilePath(String(pathname_.c_str(), pathname_.length() - 1)) : *this; } // Removes any redundant separators that might be in the pathname. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // TODO(wan@google.com): handle Windows network shares (e.g. \\server\share). void FilePath::Normalize() { if (pathname_.c_str() == NULL) { pathname_ = ""; return; } const char* src = pathname_.c_str(); char* const dest = new char[pathname_.length() + 1]; char* dest_ptr = dest; memset(dest_ptr, 0, pathname_.length() + 1); while (*src != '\0') { *dest_ptr = *src; if (!IsPathSeparator(*src)) { src++; } else { #if GTEST_HAS_ALT_PATH_SEP_ if (*dest_ptr == kAlternatePathSeparator) { *dest_ptr = kPathSeparator; } #endif while (IsPathSeparator(*src)) src++; } dest_ptr++; } *dest_ptr = '\0'; pathname_ = dest; delete[] dest; } } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include #include #include #if GTEST_OS_WINDOWS_MOBILE # include // For TerminateProcess() #elif GTEST_OS_WINDOWS # include # include #else # include #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_MAC # include # include # include #endif // GTEST_OS_MAC // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { namespace internal { #if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC and C++Builder do not provide a definition of STDERR_FILENO. const int kStdOutFileno = 1; const int kStdErrFileno = 2; #else const int kStdOutFileno = STDOUT_FILENO; const int kStdErrFileno = STDERR_FILENO; #endif // _MSC_VER #if GTEST_OS_MAC // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. size_t GetThreadCount() { const task_t task = mach_task_self(); mach_msg_type_number_t thread_count; thread_act_array_t thread_list; const kern_return_t status = task_threads(task, &thread_list, &thread_count); if (status == KERN_SUCCESS) { // task_threads allocates resources in thread_list and we need to free them // to avoid leaks. vm_deallocate(task, reinterpret_cast(thread_list), sizeof(thread_t) * thread_count); return static_cast(thread_count); } else { return 0; } } #else size_t GetThreadCount() { // There's no portable way to detect the number of threads, so we just // return 0 to indicate that we cannot detect it. return 0; } #endif // GTEST_OS_MAC #if GTEST_USES_POSIX_RE // Implements RE. Currently only needed for death tests. RE::~RE() { if (is_valid_) { // regfree'ing an invalid regex might crash because the content // of the regex is undefined. Since the regex's are essentially // the same, one cannot be valid (or invalid) without the other // being so too. regfree(&partial_regex_); regfree(&full_regex_); } free(const_cast(pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.full_regex_, str, 1, &match, 0) == 0; } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.partial_regex_, str, 1, &match, 0) == 0; } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = posix::StrDup(regex); // Reserves enough bytes to hold the regular expression used for a // full match. const size_t full_regex_len = strlen(regex) + 10; char* const full_pattern = new char[full_regex_len]; snprintf(full_pattern, full_regex_len, "^(%s)$", regex); is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0; // We want to call regcomp(&partial_regex_, ...) even if the // previous expression returns false. Otherwise partial_regex_ may // not be properly initialized can may cause trouble when it's // freed. // // Some implementation of POSIX regex (e.g. on at least some // versions of Cygwin) doesn't accept the empty string as a valid // regex. We change it to an equivalent form "()" to be safe. if (is_valid_) { const char* const partial_regex = (*regex == '\0') ? "()" : regex; is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0; } EXPECT_TRUE(is_valid_) << "Regular expression \"" << regex << "\" is not a valid POSIX Extended regular expression."; delete[] full_pattern; } #elif GTEST_USES_SIMPLE_RE // Returns true iff ch appears anywhere in str (excluding the // terminating '\0' character). bool IsInSet(char ch, const char* str) { return ch != '\0' && strchr(str, ch) != NULL; } // Returns true iff ch belongs to the given classification. Unlike // similar functions in , these aren't affected by the // current locale. bool IsAsciiDigit(char ch) { return '0' <= ch && ch <= '9'; } bool IsAsciiPunct(char ch) { return IsInSet(ch, "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"); } bool IsRepeat(char ch) { return IsInSet(ch, "?*+"); } bool IsAsciiWhiteSpace(char ch) { return IsInSet(ch, " \f\n\r\t\v"); } bool IsAsciiWordChar(char ch) { return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || ('0' <= ch && ch <= '9') || ch == '_'; } // Returns true iff "\\c" is a supported escape sequence. bool IsValidEscape(char c) { return (IsAsciiPunct(c) || IsInSet(c, "dDfnrsStvwW")); } // Returns true iff the given atom (specified by escaped and pattern) // matches ch. The result is undefined if the atom is invalid. bool AtomMatchesChar(bool escaped, char pattern_char, char ch) { if (escaped) { // "\\p" where p is pattern_char. switch (pattern_char) { case 'd': return IsAsciiDigit(ch); case 'D': return !IsAsciiDigit(ch); case 'f': return ch == '\f'; case 'n': return ch == '\n'; case 'r': return ch == '\r'; case 's': return IsAsciiWhiteSpace(ch); case 'S': return !IsAsciiWhiteSpace(ch); case 't': return ch == '\t'; case 'v': return ch == '\v'; case 'w': return IsAsciiWordChar(ch); case 'W': return !IsAsciiWordChar(ch); } return IsAsciiPunct(pattern_char) && pattern_char == ch; } return (pattern_char == '.' && ch != '\n') || pattern_char == ch; } // Helper function used by ValidateRegex() to format error messages. String FormatRegexSyntaxError(const char* regex, int index) { return (Message() << "Syntax error at index " << index << " in simple regular expression \"" << regex << "\": ").GetString(); } // Generates non-fatal failures and returns false if regex is invalid; // otherwise returns true. bool ValidateRegex(const char* regex) { if (regex == NULL) { // TODO(wan@google.com): fix the source file location in the // assertion failures to match where the regex is used in user // code. ADD_FAILURE() << "NULL is not a valid simple regular expression."; return false; } bool is_valid = true; // True iff ?, *, or + can follow the previous atom. bool prev_repeatable = false; for (int i = 0; regex[i]; i++) { if (regex[i] == '\\') { // An escape sequence i++; if (regex[i] == '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "'\\' cannot appear at the end."; return false; } if (!IsValidEscape(regex[i])) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "invalid escape sequence \"\\" << regex[i] << "\"."; is_valid = false; } prev_repeatable = true; } else { // Not an escape sequence. const char ch = regex[i]; if (ch == '^' && i > 0) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'^' can only appear at the beginning."; is_valid = false; } else if (ch == '$' && regex[i + 1] != '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'$' can only appear at the end."; is_valid = false; } else if (IsInSet(ch, "()[]{}|")) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' is unsupported."; is_valid = false; } else if (IsRepeat(ch) && !prev_repeatable) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' can only follow a repeatable token."; is_valid = false; } prev_repeatable = !IsInSet(ch, "^$?*+"); } } return is_valid; } // Matches a repeated regex atom followed by a valid simple regular // expression. The regex atom is defined as c if escaped is false, // or \c otherwise. repeat is the repetition meta character (?, *, // or +). The behavior is undefined if str contains too many // characters to be indexable by size_t, in which case the test will // probably time out anyway. We are fine with this limitation as // std::string has it too. bool MatchRepetitionAndRegexAtHead( bool escaped, char c, char repeat, const char* regex, const char* str) { const size_t min_count = (repeat == '+') ? 1 : 0; const size_t max_count = (repeat == '?') ? 1 : static_cast(-1) - 1; // We cannot call numeric_limits::max() as it conflicts with the // max() macro on Windows. for (size_t i = 0; i <= max_count; ++i) { // We know that the atom matches each of the first i characters in str. if (i >= min_count && MatchRegexAtHead(regex, str + i)) { // We have enough matches at the head, and the tail matches too. // Since we only care about *whether* the pattern matches str // (as opposed to *how* it matches), there is no need to find a // greedy match. return true; } if (str[i] == '\0' || !AtomMatchesChar(escaped, c, str[i])) return false; } return false; } // Returns true iff regex matches a prefix of str. regex must be a // valid simple regular expression and not start with "^", or the // result is undefined. bool MatchRegexAtHead(const char* regex, const char* str) { if (*regex == '\0') // An empty regex matches a prefix of anything. return true; // "$" only matches the end of a string. Note that regex being // valid guarantees that there's nothing after "$" in it. if (*regex == '$') return *str == '\0'; // Is the first thing in regex an escape sequence? const bool escaped = *regex == '\\'; if (escaped) ++regex; if (IsRepeat(regex[1])) { // MatchRepetitionAndRegexAtHead() calls MatchRegexAtHead(), so // here's an indirect recursion. It terminates as the regex gets // shorter in each recursion. return MatchRepetitionAndRegexAtHead( escaped, regex[0], regex[1], regex + 2, str); } else { // regex isn't empty, isn't "$", and doesn't start with a // repetition. We match the first atom of regex with the first // character of str and recurse. return (*str != '\0') && AtomMatchesChar(escaped, *regex, *str) && MatchRegexAtHead(regex + 1, str + 1); } } // Returns true iff regex matches any substring of str. regex must be // a valid simple regular expression, or the result is undefined. // // The algorithm is recursive, but the recursion depth doesn't exceed // the regex length, so we won't need to worry about running out of // stack space normally. In rare cases the time complexity can be // exponential with respect to the regex length + the string length, // but usually it's must faster (often close to linear). bool MatchRegexAnywhere(const char* regex, const char* str) { if (regex == NULL || str == NULL) return false; if (*regex == '^') return MatchRegexAtHead(regex + 1, str); // A successful match can be anywhere in str. do { if (MatchRegexAtHead(regex, str)) return true; } while (*str++ != '\0'); return false; } // Implements the RE class. RE::~RE() { free(const_cast(pattern_)); free(const_cast(full_pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.full_pattern_, str); } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.pattern_, str); } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = full_pattern_ = NULL; if (regex != NULL) { pattern_ = posix::StrDup(regex); } is_valid_ = ValidateRegex(regex); if (!is_valid_) { // No need to calculate the full pattern when the regex is invalid. return; } const size_t len = strlen(regex); // Reserves enough bytes to hold the regular expression used for a // full match: we need space to prepend a '^', append a '$', and // terminate the string with '\0'. char* buffer = static_cast(malloc(len + 3)); full_pattern_ = buffer; if (*regex != '^') *buffer++ = '^'; // Makes sure full_pattern_ starts with '^'. // We don't use snprintf or strncpy, as they trigger a warning when // compiled with VC++ 8.0. memcpy(buffer, regex, len); buffer += len; if (len == 0 || regex[len - 1] != '$') *buffer++ = '$'; // Makes sure full_pattern_ ends with '$'. *buffer = '\0'; } #endif // GTEST_USES_POSIX_RE const char kUnknownFile[] = "unknown file"; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) { return String::Format("%s:", file_name).c_str(); } #ifdef _MSC_VER return String::Format("%s(%d):", file_name, line).c_str(); #else return String::Format("%s:%d:", file_name, line).c_str(); #endif // _MSC_VER } // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. // Note that FormatCompilerIndependentFileLocation() does NOT append colon // to the file location it produces, unlike FormatFileLocation(). GTEST_API_ ::std::string FormatCompilerIndependentFileLocation( const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) return file_name; else return String::Format("%s:%d", file_name, line).c_str(); } GTestLog::GTestLog(GTestLogSeverity severity, const char* file, int line) : severity_(severity) { const char* const marker = severity == GTEST_INFO ? "[ INFO ]" : severity == GTEST_WARNING ? "[WARNING]" : severity == GTEST_ERROR ? "[ ERROR ]" : "[ FATAL ]"; GetStream() << ::std::endl << marker << " " << FormatFileLocation(file, line).c_str() << ": "; } // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. GTestLog::~GTestLog() { GetStream() << ::std::endl; if (severity_ == GTEST_FATAL) { fflush(stderr); posix::Abort(); } } // Disable Microsoft deprecation warnings for POSIX functions called from // this class (creat, dup, dup2, and close) #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4996) #endif // _MSC_VER #if GTEST_HAS_STREAM_REDIRECTION // Object that captures an output stream (stdout/stderr). class CapturedStream { public: // The ctor redirects the stream to a temporary file. CapturedStream(int fd) : fd_(fd), uncaptured_fd_(dup(fd)) { # if GTEST_OS_WINDOWS char temp_dir_path[MAX_PATH + 1] = { '\0' }; // NOLINT char temp_file_path[MAX_PATH + 1] = { '\0' }; // NOLINT ::GetTempPathA(sizeof(temp_dir_path), temp_dir_path); const UINT success = ::GetTempFileNameA(temp_dir_path, "gtest_redir", 0, // Generate unique file name. temp_file_path); GTEST_CHECK_(success != 0) << "Unable to create a temporary file in " << temp_dir_path; const int captured_fd = creat(temp_file_path, _S_IREAD | _S_IWRITE); GTEST_CHECK_(captured_fd != -1) << "Unable to open temporary file " << temp_file_path; filename_ = temp_file_path; # else // There's no guarantee that a test has write access to the // current directory, so we create the temporary file in the /tmp // directory instead. char name_template[] = "/tmp/captured_stream.XXXXXX"; const int captured_fd = mkstemp(name_template); filename_ = name_template; # endif // GTEST_OS_WINDOWS fflush(NULL); dup2(captured_fd, fd_); close(captured_fd); } ~CapturedStream() { remove(filename_.c_str()); } String GetCapturedString() { if (uncaptured_fd_ != -1) { // Restores the original stream. fflush(NULL); dup2(uncaptured_fd_, fd_); close(uncaptured_fd_); uncaptured_fd_ = -1; } FILE* const file = posix::FOpen(filename_.c_str(), "r"); const String content = ReadEntireFile(file); posix::FClose(file); return content; } private: // Reads the entire content of a file as a String. static String ReadEntireFile(FILE* file); // Returns the size (in bytes) of a file. static size_t GetFileSize(FILE* file); const int fd_; // A stream to capture. int uncaptured_fd_; // Name of the temporary file holding the stderr output. ::std::string filename_; GTEST_DISALLOW_COPY_AND_ASSIGN_(CapturedStream); }; // Returns the size (in bytes) of a file. size_t CapturedStream::GetFileSize(FILE* file) { fseek(file, 0, SEEK_END); return static_cast(ftell(file)); } // Reads the entire content of a file as a string. String CapturedStream::ReadEntireFile(FILE* file) { const size_t file_size = GetFileSize(file); char* const buffer = new char[file_size]; size_t bytes_last_read = 0; // # of bytes read in the last fread() size_t bytes_read = 0; // # of bytes read so far fseek(file, 0, SEEK_SET); // Keeps reading the file until we cannot read further or the // pre-determined file size is reached. do { bytes_last_read = fread(buffer+bytes_read, 1, file_size-bytes_read, file); bytes_read += bytes_last_read; } while (bytes_last_read > 0 && bytes_read < file_size); const String content(buffer, bytes_read); delete[] buffer; return content; } # ifdef _MSC_VER # pragma warning(pop) # endif // _MSC_VER static CapturedStream* g_captured_stderr = NULL; static CapturedStream* g_captured_stdout = NULL; // Starts capturing an output stream (stdout/stderr). void CaptureStream(int fd, const char* stream_name, CapturedStream** stream) { if (*stream != NULL) { GTEST_LOG_(FATAL) << "Only one " << stream_name << " capturer can exist at a time."; } *stream = new CapturedStream(fd); } // Stops capturing the output stream and returns the captured string. String GetCapturedStream(CapturedStream** captured_stream) { const String content = (*captured_stream)->GetCapturedString(); delete *captured_stream; *captured_stream = NULL; return content; } // Starts capturing stdout. void CaptureStdout() { CaptureStream(kStdOutFileno, "stdout", &g_captured_stdout); } // Starts capturing stderr. void CaptureStderr() { CaptureStream(kStdErrFileno, "stderr", &g_captured_stderr); } // Stops capturing stdout and returns the captured string. String GetCapturedStdout() { return GetCapturedStream(&g_captured_stdout); } // Stops capturing stderr and returns the captured string. String GetCapturedStderr() { return GetCapturedStream(&g_captured_stderr); } #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). ::std::vector g_argvs; // Returns the command line as a vector of strings. const ::std::vector& GetArgvs() { return g_argvs; } #endif // GTEST_HAS_DEATH_TEST #if GTEST_OS_WINDOWS_MOBILE namespace posix { void Abort() { DebugBreak(); TerminateProcess(GetCurrentProcess(), 1); } } // namespace posix #endif // GTEST_OS_WINDOWS_MOBILE // Returns the name of the environment variable corresponding to the // given flag. For example, FlagToEnvVar("foo") will return // "GTEST_FOO" in the open-source version. static String FlagToEnvVar(const char* flag) { const String full_flag = (Message() << GTEST_FLAG_PREFIX_ << flag).GetString(); Message env_var; for (size_t i = 0; i != full_flag.length(); i++) { env_var << ToUpper(full_flag.c_str()[i]); } return env_var.GetString(); } // Parses 'str' for a 32-bit signed integer. If successful, writes // the result to *value and returns true; otherwise leaves *value // unchanged and returns false. bool ParseInt32(const Message& src_text, const char* str, Int32* value) { // Parses the environment variable as a decimal integer. char* end = NULL; const long long_value = strtol(str, &end, 10); // NOLINT // Has strtol() consumed all characters in the string? if (*end != '\0') { // No - an invalid character was encountered. Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value \"" << str << "\".\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } // Is the parsed value in the range of an Int32? const Int32 result = static_cast(long_value); if (long_value == LONG_MAX || long_value == LONG_MIN || // The parsed value overflows as a long. (strtol() returns // LONG_MAX or LONG_MIN when the input overflows.) result != long_value // The parsed value overflows as an Int32. ) { Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value " << str << ", which overflows.\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } *value = result; return true; } // Reads and returns the Boolean environment variable corresponding to // the given flag; if it's not set, returns default_value. // // The value is considered true iff it's not "0". bool BoolFromGTestEnv(const char* flag, bool default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); return string_value == NULL ? default_value : strcmp(string_value, "0") != 0; } // Reads and returns a 32-bit integer stored in the environment // variable corresponding to the given flag; if it isn't set or // doesn't represent a valid 32-bit integer, returns default_value. Int32 Int32FromGTestEnv(const char* flag, Int32 default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); if (string_value == NULL) { // The environment variable is not set. return default_value; } Int32 result = default_value; if (!ParseInt32(Message() << "Environment variable " << env_var, string_value, &result)) { printf("The default value %s is used.\n", (Message() << default_value).GetString().c_str()); fflush(stdout); return default_value; } return result; } // Reads and returns the string environment variable corresponding to // the given flag; if it's not set, returns default_value. const char* StringFromGTestEnv(const char* flag, const char* default_value) { const String env_var = FlagToEnvVar(flag); const char* const value = posix::GetEnv(env_var.c_str()); return value == NULL ? default_value : value; } } // namespace internal } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // It uses the << operator when possible, and prints the bytes in the // object otherwise. A user can override its behavior for a class // type Foo by defining either operator<<(::std::ostream&, const Foo&) // or void PrintTo(const Foo&, ::std::ostream*) in the namespace that // defines Foo. #include #include #include // NOLINT #include namespace testing { namespace { using ::std::ostream; #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not define _snprintf_s. # define snprintf _snprintf #elif _MSC_VER >= 1400 // VC 8.0 and later deprecate snprintf and _snprintf. # define snprintf _snprintf_s #elif _MSC_VER # define snprintf _snprintf #endif // GTEST_OS_WINDOWS_MOBILE // Prints a segment of bytes in the given object. void PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, size_t count, ostream* os) { char text[5] = ""; for (size_t i = 0; i != count; i++) { const size_t j = start + i; if (i != 0) { // Organizes the bytes into groups of 2 for easy parsing by // human. if ((j % 2) == 0) *os << ' '; else *os << '-'; } snprintf(text, sizeof(text), "%02X", obj_bytes[j]); *os << text; } } // Prints the bytes in the given value to the given ostream. void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, ostream* os) { // Tells the user how big the object is. *os << count << "-byte object <"; const size_t kThreshold = 132; const size_t kChunkSize = 64; // If the object size is bigger than kThreshold, we'll have to omit // some details by printing only the first and the last kChunkSize // bytes. // TODO(wan): let the user control the threshold using a flag. if (count < kThreshold) { PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); } else { PrintByteSegmentInObjectTo(obj_bytes, 0, kChunkSize, os); *os << " ... "; // Rounds up to 2-byte boundary. const size_t resume_pos = (count - kChunkSize + 1)/2*2; PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); } *os << ">"; } } // namespace namespace internal2 { // Delegates to PrintBytesInObjectToImpl() to print the bytes in the // given object. The delegation simplifies the implementation, which // uses the << operator and thus is easier done outside of the // ::testing::internal namespace, which contains a << operator that // sometimes conflicts with the one in STL. void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ostream* os) { PrintBytesInObjectToImpl(obj_bytes, count, os); } } // namespace internal2 namespace internal { // Depending on the value of a char (or wchar_t), we print it in one // of three formats: // - as is if it's a printable ASCII (e.g. 'a', '2', ' '), // - as a hexidecimal escape sequence (e.g. '\x7F'), or // - as a special escape sequence (e.g. '\r', '\n'). enum CharFormat { kAsIs, kHexEscape, kSpecialEscape }; // Returns true if c is a printable ASCII character. We test the // value of c directly instead of calling isprint(), which is buggy on // Windows Mobile. inline bool IsPrintableAscii(wchar_t c) { return 0x20 <= c && c <= 0x7E; } // Prints a wide or narrow char c as a character literal without the // quotes, escaping it when necessary; returns how c was formatted. // The template argument UnsignedChar is the unsigned version of Char, // which is the type of c. template static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) { switch (static_cast(c)) { case L'\0': *os << "\\0"; break; case L'\'': *os << "\\'"; break; case L'\\': *os << "\\\\"; break; case L'\a': *os << "\\a"; break; case L'\b': *os << "\\b"; break; case L'\f': *os << "\\f"; break; case L'\n': *os << "\\n"; break; case L'\r': *os << "\\r"; break; case L'\t': *os << "\\t"; break; case L'\v': *os << "\\v"; break; default: if (IsPrintableAscii(c)) { *os << static_cast(c); return kAsIs; } else { *os << String::Format("\\x%X", static_cast(c)); return kHexEscape; } } return kSpecialEscape; } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsWideStringLiteralTo(wchar_t c, ostream* os) { switch (c) { case L'\'': *os << "'"; return kAsIs; case L'"': *os << "\\\""; return kSpecialEscape; default: return PrintAsCharLiteralTo(c, os); } } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsNarrowStringLiteralTo(char c, ostream* os) { return PrintAsWideStringLiteralTo(static_cast(c), os); } // Prints a wide or narrow character c and its code. '\0' is printed // as "'\\0'", other unprintable characters are also properly escaped // using the standard C++ escape sequence. The template argument // UnsignedChar is the unsigned version of Char, which is the type of c. template void PrintCharAndCodeTo(Char c, ostream* os) { // First, print c as a literal in the most readable form we can find. *os << ((sizeof(c) > 1) ? "L'" : "'"); const CharFormat format = PrintAsCharLiteralTo(c, os); *os << "'"; // To aid user debugging, we also print c's code in decimal, unless // it's 0 (in which case c was printed as '\\0', making the code // obvious). if (c == 0) return; *os << " (" << String::Format("%d", c).c_str(); // For more convenience, we print c's code again in hexidecimal, // unless c was already printed in the form '\x##' or the code is in // [1, 9]. if (format == kHexEscape || (1 <= c && c <= 9)) { // Do nothing. } else { *os << String::Format(", 0x%X", static_cast(c)).c_str(); } *os << ")"; } void PrintTo(unsigned char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } void PrintTo(signed char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its code. L'\0' is printed as "L'\\0'". void PrintTo(wchar_t wc, ostream* os) { PrintCharAndCodeTo(wc, os); } // Prints the given array of characters to the ostream. // The array starts at *begin, the length is len, it may include '\0' characters // and may not be null-terminated. static void PrintCharsAsStringTo(const char* begin, size_t len, ostream* os) { *os << "\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const char cur = begin[index]; if (is_previous_hex && IsXDigit(cur)) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" \""; } is_previous_hex = PrintAsNarrowStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints a (const) char array of 'len' elements, starting at address 'begin'. void UniversalPrintArray(const char* begin, size_t len, ostream* os) { PrintCharsAsStringTo(begin, len, os); } // Prints the given array of wide characters to the ostream. // The array starts at *begin, the length is len, it may include L'\0' // characters and may not be null-terminated. static void PrintWideCharsAsStringTo(const wchar_t* begin, size_t len, ostream* os) { *os << "L\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const wchar_t cur = begin[index]; if (is_previous_hex && isascii(cur) && IsXDigit(static_cast(cur))) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" L\""; } is_previous_hex = PrintAsWideStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints the given C string to the ostream. void PrintTo(const char* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintCharsAsStringTo(s, strlen(s), os); } } // MSVC compiler can be configured to define whar_t as a typedef // of unsigned short. Defining an overload for const wchar_t* in that case // would cause pointers to unsigned shorts be printed as wide strings, // possibly accessing more memory than intended and causing invalid // memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when // wchar_t is implemented as a native type. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Prints the given wide C string to the ostream. void PrintTo(const wchar_t* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintWideCharsAsStringTo(s, wcslen(s), os); } } #endif // wchar_t is native // Prints a ::string object. #if GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::std::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } // Prints a ::wstring object. #if GTEST_HAS_GLOBAL_WSTRING void PrintWideStringTo(const ::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING void PrintWideStringTo(const ::std::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_STD_WSTRING } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // The Google C++ Testing Framework (Google Test) // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { using internal::GetUnitTestImpl; // Gets the summary of the failure message by omitting the stack trace // in it. internal::String TestPartResult::ExtractSummary(const char* message) { const char* const stack_trace = strstr(message, internal::kStackTraceMarker); return stack_trace == NULL ? internal::String(message) : internal::String(message, stack_trace - message); } // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result) { return os << result.file_name() << ":" << result.line_number() << ": " << (result.type() == TestPartResult::kSuccess ? "Success" : result.type() == TestPartResult::kFatalFailure ? "Fatal failure" : "Non-fatal failure") << ":\n" << result.message() << std::endl; } // Appends a TestPartResult to the array. void TestPartResultArray::Append(const TestPartResult& result) { array_.push_back(result); } // Returns the TestPartResult at the given index (0-based). const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const { if (index < 0 || index >= size()) { printf("\nInvalid index (%d) into TestPartResultArray.\n", index); internal::posix::Abort(); } return array_[index]; } // Returns the number of TestPartResult objects in the array. int TestPartResultArray::size() const { return static_cast(array_.size()); } namespace internal { HasNewFatalFailureHelper::HasNewFatalFailureHelper() : has_new_fatal_failure_(false), original_reporter_(GetUnitTestImpl()-> GetTestPartResultReporterForCurrentThread()) { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread(this); } HasNewFatalFailureHelper::~HasNewFatalFailureHelper() { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread( original_reporter_); } void HasNewFatalFailureHelper::ReportTestPartResult( const TestPartResult& result) { if (result.fatally_failed()) has_new_fatal_failure_ = true; original_reporter_->ReportTestPartResult(result); } } // namespace internal } // namespace testing // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) namespace testing { namespace internal { #if GTEST_HAS_TYPED_TEST_P // Skips to the first non-space char in str. Returns an empty string if str // contains only whitespace characters. static const char* SkipSpaces(const char* str) { while (IsSpace(*str)) str++; return str; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* TypedTestCasePState::VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests) { typedef ::std::set::const_iterator DefinedTestIter; registered_ = true; // Skip initial whitespace in registered_tests since some // preprocessors prefix stringizied literals with whitespace. registered_tests = SkipSpaces(registered_tests); Message errors; ::std::set tests; for (const char* names = registered_tests; names != NULL; names = SkipComma(names)) { const String name = GetPrefixUntilComma(names); if (tests.count(name) != 0) { errors << "Test " << name << " is listed more than once.\n"; continue; } bool found = false; for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (name == *it) { found = true; break; } } if (found) { tests.insert(name); } else { errors << "No test named " << name << " can be found in this test case.\n"; } } for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (tests.count(*it) == 0) { errors << "You forgot to list test " << *it << ".\n"; } } const String& errors_str = errors.GetString(); if (errors_str != "") { fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors_str.c_str()); fflush(stderr); posix::Abort(); } return registered_tests; } #endif // GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/fused-src/gtest/gtest.h0000600000175000017500000303564411561126632023777 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for Google Test. It should be // included by any test program that uses Google Test. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! // // Acknowledgment: Google Test borrowed the idea of automatic test // registration from Barthelemy Dagenais' (barthelemy@prologique.com) // easyUnit framework. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_H_ #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares functions and macros used internally by // Google Test. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan) // // Low-level types and utilities for porting Google Test to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ // The user can define the following macros in the build script to // control Google Test's behavior. If the user doesn't define a macro // in this list, Google Test will define it. // // GTEST_HAS_CLONE - Define it to 1/0 to indicate that clone(2) // is/isn't available. // GTEST_HAS_EXCEPTIONS - Define it to 1/0 to indicate that exceptions // are enabled. // GTEST_HAS_GLOBAL_STRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::string, which is different to std::string). // GTEST_HAS_GLOBAL_WSTRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::wstring, which is different to std::wstring). // GTEST_HAS_POSIX_RE - Define it to 1/0 to indicate that POSIX regular // expressions are/aren't available. // GTEST_HAS_PTHREAD - Define it to 1/0 to indicate that // is/isn't available. // GTEST_HAS_RTTI - Define it to 1/0 to indicate that RTTI is/isn't // enabled. // GTEST_HAS_STD_WSTRING - Define it to 1/0 to indicate that // std::wstring does/doesn't work (Google Test can // be used where std::wstring is unavailable). // GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple // is/isn't available. // GTEST_HAS_SEH - Define it to 1/0 to indicate whether the // compiler supports Microsoft's "Structured // Exception Handling". // GTEST_HAS_STREAM_REDIRECTION // - Define it to 1/0 to indicate whether the // platform supports I/O stream redirection using // dup() and dup2(). // GTEST_USE_OWN_TR1_TUPLE - Define it to 1/0 to indicate whether Google // Test's own tr1 tuple implementation should be // used. Unused when the user sets // GTEST_HAS_TR1_TUPLE to 0. // GTEST_LINKED_AS_SHARED_LIBRARY // - Define to 1 when compiling tests that use // Google Test as a shared library (known as // DLL on Windows). // GTEST_CREATE_SHARED_LIBRARY // - Define to 1 when compiling Google Test itself // as a shared library. // This header defines the following utilities: // // Macros indicating the current platform (defined to 1 if compiled on // the given platform; otherwise undefined): // GTEST_OS_AIX - IBM AIX // GTEST_OS_CYGWIN - Cygwin // GTEST_OS_HPUX - HP-UX // GTEST_OS_LINUX - Linux // GTEST_OS_LINUX_ANDROID - Google Android // GTEST_OS_MAC - Mac OS X // GTEST_OS_NACL - Google Native Client (NaCl) // GTEST_OS_SOLARIS - Sun Solaris // GTEST_OS_SYMBIAN - Symbian // GTEST_OS_WINDOWS - Windows (Desktop, MinGW, or Mobile) // GTEST_OS_WINDOWS_DESKTOP - Windows Desktop // GTEST_OS_WINDOWS_MINGW - MinGW // GTEST_OS_WINDOWS_MOBILE - Windows Mobile // GTEST_OS_ZOS - z/OS // // Among the platforms, Cygwin, Linux, Max OS X, and Windows have the // most stable support. Since core members of the Google Test project // don't have access to other platforms, support for them may be less // stable. If you notice any problems on your platform, please notify // googletestframework@googlegroups.com (patches for fixing them are // even more welcome!). // // Note that it is possible that none of the GTEST_OS_* macros are defined. // // Macros indicating available Google Test features (defined to 1 if // the corresponding feature is supported; otherwise undefined): // GTEST_HAS_COMBINE - the Combine() function (for value-parameterized // tests) // GTEST_HAS_DEATH_TEST - death tests // GTEST_HAS_PARAM_TEST - value-parameterized tests // GTEST_HAS_TYPED_TEST - typed tests // GTEST_HAS_TYPED_TEST_P - type-parameterized tests // GTEST_USES_POSIX_RE - enhanced POSIX regex is used. Do not confuse with // GTEST_HAS_POSIX_RE (see above) which users can // define themselves. // GTEST_USES_SIMPLE_RE - our own simple regex is used; // the above two are mutually exclusive. // GTEST_CAN_COMPARE_NULL - accepts untyped NULL in EXPECT_EQ(). // // Macros for basic C++ coding: // GTEST_AMBIGUOUS_ELSE_BLOCKER_ - for disabling a gcc warning. // GTEST_ATTRIBUTE_UNUSED_ - declares that a class' instances or a // variable don't have to be used. // GTEST_DISALLOW_ASSIGN_ - disables operator=. // GTEST_DISALLOW_COPY_AND_ASSIGN_ - disables copy ctor and operator=. // GTEST_MUST_USE_RESULT_ - declares that a function's result must be used. // // Synchronization: // Mutex, MutexLock, ThreadLocal, GetThreadCount() // - synchronization primitives. // GTEST_IS_THREADSAFE - defined to 1 to indicate that the above // synchronization primitives have real implementations // and Google Test is thread-safe; or 0 otherwise. // // Template meta programming: // is_pointer - as in TR1; needed on Symbian and IBM XL C/C++ only. // IteratorTraits - partial implementation of std::iterator_traits, which // is not available in libCstd when compiled with Sun C++. // // Smart pointers: // scoped_ptr - as in TR2. // // Regular expressions: // RE - a simple regular expression class using the POSIX // Extended Regular Expression syntax on UNIX-like // platforms, or a reduced regular exception syntax on // other platforms, including Windows. // // Logging: // GTEST_LOG_() - logs messages at the specified severity level. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. // // Stdout and stderr capturing: // CaptureStdout() - starts capturing stdout. // GetCapturedStdout() - stops capturing stdout and returns the captured // string. // CaptureStderr() - starts capturing stderr. // GetCapturedStderr() - stops capturing stderr and returns the captured // string. // // Integer types: // TypeWithSize - maps an integer to a int type. // Int32, UInt32, Int64, UInt64, TimeInMillis // - integers of known sizes. // BiggestInt - the biggest signed integer type. // // Command-line utilities: // GTEST_FLAG() - references a flag. // GTEST_DECLARE_*() - declares a flag. // GTEST_DEFINE_*() - defines a flag. // GetArgvs() - returns the command line as a vector of strings. // // Environment variable utilities: // GetEnv() - gets the value of an environment variable. // BoolFromGTestEnv() - parses a bool environment variable. // Int32FromGTestEnv() - parses an Int32 environment variable. // StringFromGTestEnv() - parses a string environment variable. #include // for isspace, etc #include // for ptrdiff_t #include #include #include #ifndef _WIN32_WCE # include # include #endif // !_WIN32_WCE #include // NOLINT #include // NOLINT #include // NOLINT #define GTEST_DEV_EMAIL_ "googletestframework@@googlegroups.com" #define GTEST_FLAG_PREFIX_ "gtest_" #define GTEST_FLAG_PREFIX_DASH_ "gtest-" #define GTEST_FLAG_PREFIX_UPPER_ "GTEST_" #define GTEST_NAME_ "Google Test" #define GTEST_PROJECT_URL_ "http://code.google.com/p/googletest/" // Determines the version of gcc that is used to compile this. #ifdef __GNUC__ // 40302 means version 4.3.2. # define GTEST_GCC_VER_ \ (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__) #endif // __GNUC__ // Determines the platform on which Google Test is compiled. #ifdef __CYGWIN__ # define GTEST_OS_CYGWIN 1 #elif defined __SYMBIAN32__ # define GTEST_OS_SYMBIAN 1 #elif defined _WIN32 # define GTEST_OS_WINDOWS 1 # ifdef _WIN32_WCE # define GTEST_OS_WINDOWS_MOBILE 1 # elif defined(__MINGW__) || defined(__MINGW32__) # define GTEST_OS_WINDOWS_MINGW 1 # else # define GTEST_OS_WINDOWS_DESKTOP 1 # endif // _WIN32_WCE #elif defined __APPLE__ # define GTEST_OS_MAC 1 #elif defined __linux__ # define GTEST_OS_LINUX 1 # ifdef ANDROID # define GTEST_OS_LINUX_ANDROID 1 # endif // ANDROID #elif defined __MVS__ # define GTEST_OS_ZOS 1 #elif defined(__sun) && defined(__SVR4) # define GTEST_OS_SOLARIS 1 #elif defined(_AIX) # define GTEST_OS_AIX 1 #elif defined(__hpux) # define GTEST_OS_HPUX 1 #elif defined __native_client__ # define GTEST_OS_NACL 1 #endif // __CYGWIN__ // Brings in definitions for functions used in the testing::internal::posix // namespace (read, write, close, chdir, isatty, stat). We do not currently // use them on Windows Mobile. #if !GTEST_OS_WINDOWS // This assumes that non-Windows OSes provide unistd.h. For OSes where this // is not the case, we need to include headers that provide the functions // mentioned above. # include # if !GTEST_OS_NACL // TODO(vladl@google.com): Remove this condition when Native Client SDK adds // strings.h (tracked in // http://code.google.com/p/nativeclient/issues/detail?id=1175). # include // Native Client doesn't provide strings.h. # endif #elif !GTEST_OS_WINDOWS_MOBILE # include # include #endif // Defines this to true iff Google Test can use POSIX regular expressions. #ifndef GTEST_HAS_POSIX_RE # define GTEST_HAS_POSIX_RE (!GTEST_OS_WINDOWS) #endif #if GTEST_HAS_POSIX_RE // On some platforms, needs someone to define size_t, and // won't compile otherwise. We can #include it here as we already // included , which is guaranteed to define size_t through // . # include // NOLINT # define GTEST_USES_POSIX_RE 1 #elif GTEST_OS_WINDOWS // is not available on Windows. Use our own simple regex // implementation instead. # define GTEST_USES_SIMPLE_RE 1 #else // may not be available on this platform. Use our own // simple regex implementation instead. # define GTEST_USES_SIMPLE_RE 1 #endif // GTEST_HAS_POSIX_RE #ifndef GTEST_HAS_EXCEPTIONS // The user didn't tell us whether exceptions are enabled, so we need // to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC's and C++Builder's implementations of the STL use the _HAS_EXCEPTIONS // macro to enable exceptions, so we'll do the same. // Assumes that exceptions are enabled by default. # ifndef _HAS_EXCEPTIONS # define _HAS_EXCEPTIONS 1 # endif // _HAS_EXCEPTIONS # define GTEST_HAS_EXCEPTIONS _HAS_EXCEPTIONS # elif defined(__GNUC__) && __EXCEPTIONS // gcc defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__SUNPRO_CC) // Sun Pro CC supports exceptions. However, there is no compile-time way of // detecting whether they are enabled or not. Therefore, we assume that // they are enabled unless the user tells us otherwise. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__IBMCPP__) && __EXCEPTIONS // xlC defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__HP_aCC) // Exception handling is in effect by default in HP aCC compiler. It has to // be turned of by +noeh compiler option if desired. # define GTEST_HAS_EXCEPTIONS 1 # else // For other compilers, we assume exceptions are disabled to be // conservative. # define GTEST_HAS_EXCEPTIONS 0 # endif // defined(_MSC_VER) || defined(__BORLANDC__) #endif // GTEST_HAS_EXCEPTIONS #if !defined(GTEST_HAS_STD_STRING) // Even though we don't use this macro any longer, we keep it in case // some clients still depend on it. # define GTEST_HAS_STD_STRING 1 #elif !GTEST_HAS_STD_STRING // The user told us that ::std::string isn't available. # error "Google Test cannot be used where ::std::string isn't available." #endif // !defined(GTEST_HAS_STD_STRING) #ifndef GTEST_HAS_GLOBAL_STRING // The user didn't tell us whether ::string is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_STRING 0 #endif // GTEST_HAS_GLOBAL_STRING #ifndef GTEST_HAS_STD_WSTRING // The user didn't tell us whether ::std::wstring is available, so we need // to figure it out. // TODO(wan@google.com): uses autoconf to detect whether ::std::wstring // is available. // Cygwin 1.7 and below doesn't support ::std::wstring. // Solaris' libc++ doesn't support it either. Android has // no support for it at least as recent as Froyo (2.2). # define GTEST_HAS_STD_WSTRING \ (!(GTEST_OS_LINUX_ANDROID || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS)) #endif // GTEST_HAS_STD_WSTRING #ifndef GTEST_HAS_GLOBAL_WSTRING // The user didn't tell us whether ::wstring is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_WSTRING \ (GTEST_HAS_STD_WSTRING && GTEST_HAS_GLOBAL_STRING) #endif // GTEST_HAS_GLOBAL_WSTRING // Determines whether RTTI is available. #ifndef GTEST_HAS_RTTI // The user didn't tell us whether RTTI is enabled, so we need to // figure it out. # ifdef _MSC_VER # ifdef _CPPRTTI // MSVC defines this macro iff RTTI is enabled. # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // Starting with version 4.3.2, gcc defines __GXX_RTTI iff RTTI is enabled. # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40302) # ifdef __GXX_RTTI # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // __GXX_RTTI // Starting with version 9.0 IBM Visual Age defines __RTTI_ALL__ to 1 if // both the typeid and dynamic_cast features are present. # elif defined(__IBMCPP__) && (__IBMCPP__ >= 900) # ifdef __RTTI_ALL__ # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif # else // For all other compilers, we assume RTTI is enabled. # define GTEST_HAS_RTTI 1 # endif // _MSC_VER #endif // GTEST_HAS_RTTI // It's this header's responsibility to #include when RTTI // is enabled. #if GTEST_HAS_RTTI # include #endif // Determines whether Google Test can use the pthreads library. #ifndef GTEST_HAS_PTHREAD // The user didn't tell us explicitly, so we assume pthreads support is // available on Linux and Mac. // // To disable threading support in Google Test, add -DGTEST_HAS_PTHREAD=0 // to your compiler flags. # define GTEST_HAS_PTHREAD (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_HPUX) #endif // GTEST_HAS_PTHREAD #if GTEST_HAS_PTHREAD // gtest-port.h guarantees to #include when GTEST_HAS_PTHREAD is // true. # include // NOLINT // For timespec and nanosleep, used below. # include // NOLINT #endif // Determines whether Google Test can use tr1/tuple. You can define // this macro to 0 to prevent Google Test from using tuple (any // feature depending on tuple with be disabled in this mode). #ifndef GTEST_HAS_TR1_TUPLE // The user didn't tell us not to do it, so we assume it's OK. # define GTEST_HAS_TR1_TUPLE 1 #endif // GTEST_HAS_TR1_TUPLE // Determines whether Google Test's own tr1 tuple implementation // should be used. #ifndef GTEST_USE_OWN_TR1_TUPLE // The user didn't tell us, so we need to figure it out. // We use our own TR1 tuple if we aren't sure the user has an // implementation of it already. At this time, GCC 4.0.0+ and MSVC // 2010 are the only mainstream compilers that come with a TR1 tuple // implementation. NVIDIA's CUDA NVCC compiler pretends to be GCC by // defining __GNUC__ and friends, but cannot compile GCC's tuple // implementation. MSVC 2008 (9.0) provides TR1 tuple in a 323 MB // Feature Pack download, which we cannot assume the user has. # if (defined(__GNUC__) && !defined(__CUDACC__) && (GTEST_GCC_VER_ >= 40000)) \ || _MSC_VER >= 1600 # define GTEST_USE_OWN_TR1_TUPLE 0 # else # define GTEST_USE_OWN_TR1_TUPLE 1 # endif #endif // GTEST_USE_OWN_TR1_TUPLE // To avoid conditional compilation everywhere, we make it // gtest-port.h's responsibility to #include the header implementing // tr1/tuple. #if GTEST_HAS_TR1_TUPLE # if GTEST_USE_OWN_TR1_TUPLE // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2009 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements a subset of TR1 tuple needed by Google Test and Google Mock. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #include // For ::std::pair. // The compiler used in Symbian has a bug that prevents us from declaring the // tuple template as a friend (it complains that tuple is redefined). This // hack bypasses the bug by declaring the members that should otherwise be // private as public. // Sun Studio versions < 12 also have the above bug. #if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) # define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: #else # define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ template friend class tuple; \ private: #endif // GTEST_n_TUPLE_(T) is the type of an n-tuple. #define GTEST_0_TUPLE_(T) tuple<> #define GTEST_1_TUPLE_(T) tuple #define GTEST_2_TUPLE_(T) tuple #define GTEST_3_TUPLE_(T) tuple #define GTEST_4_TUPLE_(T) tuple #define GTEST_5_TUPLE_(T) tuple #define GTEST_6_TUPLE_(T) tuple #define GTEST_7_TUPLE_(T) tuple #define GTEST_8_TUPLE_(T) tuple #define GTEST_9_TUPLE_(T) tuple #define GTEST_10_TUPLE_(T) tuple // GTEST_n_TYPENAMES_(T) declares a list of n typenames. #define GTEST_0_TYPENAMES_(T) #define GTEST_1_TYPENAMES_(T) typename T##0 #define GTEST_2_TYPENAMES_(T) typename T##0, typename T##1 #define GTEST_3_TYPENAMES_(T) typename T##0, typename T##1, typename T##2 #define GTEST_4_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3 #define GTEST_5_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4 #define GTEST_6_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5 #define GTEST_7_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6 #define GTEST_8_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, typename T##7 #define GTEST_9_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8 #define GTEST_10_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8, typename T##9 // In theory, defining stuff in the ::std namespace is undefined // behavior. We can do this as we are playing the role of a standard // library vendor. namespace std { namespace tr1 { template class tuple; // Anything in namespace gtest_internal is Google Test's INTERNAL // IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. namespace gtest_internal { // ByRef::type is T if T is a reference; otherwise it's const T&. template struct ByRef { typedef const T& type; }; // NOLINT template struct ByRef { typedef T& type; }; // NOLINT // A handy wrapper for ByRef. #define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type // AddRef::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference::type. template struct AddRef { typedef T& type; }; // NOLINT template struct AddRef { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type // A helper for implementing get(). template class Get; // A helper for implementing tuple_element. kIndexValid is true // iff k < the number of fields in tuple type T. template struct TupleElement; template struct TupleElement { typedef T0 type; }; template struct TupleElement { typedef T1 type; }; template struct TupleElement { typedef T2 type; }; template struct TupleElement { typedef T3 type; }; template struct TupleElement { typedef T4 type; }; template struct TupleElement { typedef T5 type; }; template struct TupleElement { typedef T6 type; }; template struct TupleElement { typedef T7 type; }; template struct TupleElement { typedef T8 type; }; template struct TupleElement { typedef T9 type; }; } // namespace gtest_internal template <> class tuple<> { public: tuple() {} tuple(const tuple& /* t */) {} tuple& operator=(const tuple& /* t */) { return *this; } }; template class GTEST_1_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_() {} explicit tuple(GTEST_BY_REF_(T0) f0) : f0_(f0) {} tuple(const tuple& t) : f0_(t.f0_) {} template tuple(const GTEST_1_TUPLE_(U)& t) : f0_(t.f0_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_1_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_1_TUPLE_(U)& t) { f0_ = t.f0_; return *this; } T0 f0_; }; template class GTEST_2_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1) : f0_(f0), f1_(f1) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const GTEST_2_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_2_TUPLE_(U)& t) { return CopyFrom(t); } template tuple& operator=(const ::std::pair& p) { f0_ = p.first; f1_ = p.second; return *this; } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_2_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; return *this; } T0 f0_; T1 f1_; }; template class GTEST_3_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2) : f0_(f0), f1_(f1), f2_(f2) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} template tuple(const GTEST_3_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_3_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_3_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; return *this; } T0 f0_; T1 f1_; T2 f2_; }; template class GTEST_4_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3) : f0_(f0), f1_(f1), f2_(f2), f3_(f3) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} template tuple(const GTEST_4_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_4_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_4_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; }; template class GTEST_5_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} template tuple(const GTEST_5_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_5_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_5_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; }; template class GTEST_6_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} template tuple(const GTEST_6_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_6_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_6_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; }; template class GTEST_7_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} template tuple(const GTEST_7_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_7_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_7_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; }; template class GTEST_8_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} template tuple(const GTEST_8_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_8_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_8_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; }; template class GTEST_9_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} template tuple(const GTEST_9_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_9_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_9_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; }; template class tuple { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), f9_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8, GTEST_BY_REF_(T9) f9) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8), f9_(f9) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} template tuple(const GTEST_10_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_10_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_10_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; f9_ = t.f9_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; T9 f9_; }; // 6.1.3.2 Tuple creation functions. // Known limitations: we don't support passing an // std::tr1::reference_wrapper to make_tuple(). And we don't // implement tie(). inline tuple<> make_tuple() { return tuple<>(); } template inline GTEST_1_TUPLE_(T) make_tuple(const T0& f0) { return GTEST_1_TUPLE_(T)(f0); } template inline GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) { return GTEST_2_TUPLE_(T)(f0, f1); } template inline GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) { return GTEST_3_TUPLE_(T)(f0, f1, f2); } template inline GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3) { return GTEST_4_TUPLE_(T)(f0, f1, f2, f3); } template inline GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4) { return GTEST_5_TUPLE_(T)(f0, f1, f2, f3, f4); } template inline GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5) { return GTEST_6_TUPLE_(T)(f0, f1, f2, f3, f4, f5); } template inline GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6) { return GTEST_7_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6); } template inline GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7) { return GTEST_8_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7); } template inline GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8) { return GTEST_9_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8); } template inline GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8, const T9& f9) { return GTEST_10_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9); } // 6.1.3.3 Tuple helper classes. template struct tuple_size; template struct tuple_size { static const int value = 0; }; template struct tuple_size { static const int value = 1; }; template struct tuple_size { static const int value = 2; }; template struct tuple_size { static const int value = 3; }; template struct tuple_size { static const int value = 4; }; template struct tuple_size { static const int value = 5; }; template struct tuple_size { static const int value = 6; }; template struct tuple_size { static const int value = 7; }; template struct tuple_size { static const int value = 8; }; template struct tuple_size { static const int value = 9; }; template struct tuple_size { static const int value = 10; }; template struct tuple_element { typedef typename gtest_internal::TupleElement< k < (tuple_size::value), k, Tuple>::type type; }; #define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type // 6.1.3.4 Element access. namespace gtest_internal { template <> class Get<0> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) Field(Tuple& t) { return t.f0_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) ConstField(const Tuple& t) { return t.f0_; } }; template <> class Get<1> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) Field(Tuple& t) { return t.f1_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) ConstField(const Tuple& t) { return t.f1_; } }; template <> class Get<2> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) Field(Tuple& t) { return t.f2_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) ConstField(const Tuple& t) { return t.f2_; } }; template <> class Get<3> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) Field(Tuple& t) { return t.f3_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) ConstField(const Tuple& t) { return t.f3_; } }; template <> class Get<4> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) Field(Tuple& t) { return t.f4_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) ConstField(const Tuple& t) { return t.f4_; } }; template <> class Get<5> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) Field(Tuple& t) { return t.f5_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) ConstField(const Tuple& t) { return t.f5_; } }; template <> class Get<6> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) Field(Tuple& t) { return t.f6_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) ConstField(const Tuple& t) { return t.f6_; } }; template <> class Get<7> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) Field(Tuple& t) { return t.f7_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) ConstField(const Tuple& t) { return t.f7_; } }; template <> class Get<8> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) Field(Tuple& t) { return t.f8_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) ConstField(const Tuple& t) { return t.f8_; } }; template <> class Get<9> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) Field(Tuple& t) { return t.f9_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) ConstField(const Tuple& t) { return t.f9_; } }; } // namespace gtest_internal template GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::Field(t); } template GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(const GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::ConstField(t); } // 6.1.3.5 Relational operators // We only implement == and !=, as we don't have a need for the rest yet. namespace gtest_internal { // SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the // first k fields of t1 equals the first k fields of t2. // SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if // k1 != k2. template struct SameSizeTuplePrefixComparator; template <> struct SameSizeTuplePrefixComparator<0, 0> { template static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { return true; } }; template struct SameSizeTuplePrefixComparator { template static bool Eq(const Tuple1& t1, const Tuple2& t2) { return SameSizeTuplePrefixComparator::Eq(t1, t2) && ::std::tr1::get(t1) == ::std::tr1::get(t2); } }; } // namespace gtest_internal template inline bool operator==(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return gtest_internal::SameSizeTuplePrefixComparator< tuple_size::value, tuple_size::value>::Eq(t, u); } template inline bool operator!=(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return !(t == u); } // 6.1.4 Pairs. // Unimplemented. } // namespace tr1 } // namespace std #undef GTEST_0_TUPLE_ #undef GTEST_1_TUPLE_ #undef GTEST_2_TUPLE_ #undef GTEST_3_TUPLE_ #undef GTEST_4_TUPLE_ #undef GTEST_5_TUPLE_ #undef GTEST_6_TUPLE_ #undef GTEST_7_TUPLE_ #undef GTEST_8_TUPLE_ #undef GTEST_9_TUPLE_ #undef GTEST_10_TUPLE_ #undef GTEST_0_TYPENAMES_ #undef GTEST_1_TYPENAMES_ #undef GTEST_2_TYPENAMES_ #undef GTEST_3_TYPENAMES_ #undef GTEST_4_TYPENAMES_ #undef GTEST_5_TYPENAMES_ #undef GTEST_6_TYPENAMES_ #undef GTEST_7_TYPENAMES_ #undef GTEST_8_TYPENAMES_ #undef GTEST_9_TYPENAMES_ #undef GTEST_10_TYPENAMES_ #undef GTEST_DECLARE_TUPLE_AS_FRIEND_ #undef GTEST_BY_REF_ #undef GTEST_ADD_REF_ #undef GTEST_TUPLE_ELEMENT_ #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ # elif GTEST_OS_SYMBIAN // On Symbian, BOOST_HAS_TR1_TUPLE causes Boost's TR1 tuple library to // use STLport's tuple implementation, which unfortunately doesn't // work as the copy of STLport distributed with Symbian is incomplete. // By making sure BOOST_HAS_TR1_TUPLE is undefined, we force Boost to // use its own tuple implementation. # ifdef BOOST_HAS_TR1_TUPLE # undef BOOST_HAS_TR1_TUPLE # endif // BOOST_HAS_TR1_TUPLE // This prevents , which defines // BOOST_HAS_TR1_TUPLE, from being #included by Boost's . # define BOOST_TR1_DETAIL_CONFIG_HPP_INCLUDED # include # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40000) // GCC 4.0+ implements tr1/tuple in the header. This does // not conform to the TR1 spec, which requires the header to be . # if !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 // Until version 4.3.2, gcc has a bug that causes , // which is #included by , to not compile when RTTI is // disabled. _TR1_FUNCTIONAL is the header guard for // . Hence the following #define is a hack to prevent // from being included. # define _TR1_FUNCTIONAL 1 # include # undef _TR1_FUNCTIONAL // Allows the user to #include // if he chooses to. # else # include // NOLINT # endif // !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 # else // If the compiler is not GCC 4.0+, we assume the user is using a // spec-conforming TR1 implementation. # include // NOLINT # endif // GTEST_USE_OWN_TR1_TUPLE #endif // GTEST_HAS_TR1_TUPLE // Determines whether clone(2) is supported. // Usually it will only be available on Linux, excluding // Linux on the Itanium architecture. // Also see http://linux.die.net/man/2/clone. #ifndef GTEST_HAS_CLONE // The user didn't tell us, so we need to figure it out. # if GTEST_OS_LINUX && !defined(__ia64__) # define GTEST_HAS_CLONE 1 # else # define GTEST_HAS_CLONE 0 # endif // GTEST_OS_LINUX && !defined(__ia64__) #endif // GTEST_HAS_CLONE // Determines whether to support stream redirection. This is used to test // output correctness and to implement death tests. #ifndef GTEST_HAS_STREAM_REDIRECTION // By default, we assume that stream redirection is supported on all // platforms except known mobile ones. # if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN # define GTEST_HAS_STREAM_REDIRECTION 0 # else # define GTEST_HAS_STREAM_REDIRECTION 1 # endif // !GTEST_OS_WINDOWS_MOBILE && !GTEST_OS_SYMBIAN #endif // GTEST_HAS_STREAM_REDIRECTION // Determines whether to support death tests. // Google Test does not support death tests for VC 7.1 and earlier as // abort() in a VC 7.1 application compiled as GUI in debug config // pops up a dialog window that cannot be suppressed programmatically. #if (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS || \ (GTEST_OS_WINDOWS_DESKTOP && _MSC_VER >= 1400) || \ GTEST_OS_WINDOWS_MINGW || GTEST_OS_AIX || GTEST_OS_HPUX) # define GTEST_HAS_DEATH_TEST 1 # include // NOLINT #endif // We don't support MSVC 7.1 with exceptions disabled now. Therefore // all the compilers we care about are adequate for supporting // value-parameterized tests. #define GTEST_HAS_PARAM_TEST 1 // Determines whether to support type-driven tests. // Typed tests need and variadic macros, which GCC, VC++ 8.0, // Sun Pro CC, IBM Visual Age, and HP aCC support. #if defined(__GNUC__) || (_MSC_VER >= 1400) || defined(__SUNPRO_CC) || \ defined(__IBMCPP__) || defined(__HP_aCC) # define GTEST_HAS_TYPED_TEST 1 # define GTEST_HAS_TYPED_TEST_P 1 #endif // Determines whether to support Combine(). This only makes sense when // value-parameterized tests are enabled. The implementation doesn't // work on Sun Studio since it doesn't understand templated conversion // operators. #if GTEST_HAS_PARAM_TEST && GTEST_HAS_TR1_TUPLE && !defined(__SUNPRO_CC) # define GTEST_HAS_COMBINE 1 #endif // Determines whether the system compiler uses UTF-16 for encoding wide strings. #define GTEST_WIDE_STRING_USES_UTF16_ \ (GTEST_OS_WINDOWS || GTEST_OS_CYGWIN || GTEST_OS_SYMBIAN || GTEST_OS_AIX) // Determines whether test results can be streamed to a socket. #if GTEST_OS_LINUX # define GTEST_CAN_STREAM_RESULTS_ 1 #endif // Defines some utility macros. // The GNU compiler emits a warning if nested "if" statements are followed by // an "else" statement and braces are not used to explicitly disambiguate the // "else" binding. This leads to problems with code like: // // if (gate) // ASSERT_*(condition) << "Some message"; // // The "switch (0) case 0:" idiom is used to suppress this. #ifdef __INTEL_COMPILER # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ #else # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ switch (0) case 0: default: // NOLINT #endif // Use this annotation at the end of a struct/class definition to // prevent the compiler from optimizing away instances that are never // used. This is useful when all interesting logic happens inside the // c'tor and / or d'tor. Example: // // struct Foo { // Foo() { ... } // } GTEST_ATTRIBUTE_UNUSED_; // // Also use it after a variable or parameter declaration to tell the // compiler the variable/parameter does not have to be used. #if defined(__GNUC__) && !defined(COMPILER_ICC) # define GTEST_ATTRIBUTE_UNUSED_ __attribute__ ((unused)) #else # define GTEST_ATTRIBUTE_UNUSED_ #endif // A macro to disallow operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_ASSIGN_(type)\ void operator=(type const &) // A macro to disallow copy constructor and operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_COPY_AND_ASSIGN_(type)\ type(type const &);\ GTEST_DISALLOW_ASSIGN_(type) // Tell the compiler to warn about unused return values for functions declared // with this macro. The macro should be used on function declarations // following the argument list: // // Sprocket* AllocateSprocket() GTEST_MUST_USE_RESULT_; #if defined(__GNUC__) && (GTEST_GCC_VER_ >= 30400) && !defined(COMPILER_ICC) # define GTEST_MUST_USE_RESULT_ __attribute__ ((warn_unused_result)) #else # define GTEST_MUST_USE_RESULT_ #endif // __GNUC__ && (GTEST_GCC_VER_ >= 30400) && !COMPILER_ICC // Determine whether the compiler supports Microsoft's Structured Exception // Handling. This is supported by several Windows compilers but generally // does not exist on any other system. #ifndef GTEST_HAS_SEH // The user didn't tell us, so we need to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // These two compilers are known to support SEH. # define GTEST_HAS_SEH 1 # else // Assume no SEH. # define GTEST_HAS_SEH 0 # endif #endif // GTEST_HAS_SEH #ifdef _MSC_VER # if GTEST_LINKED_AS_SHARED_LIBRARY # define GTEST_API_ __declspec(dllimport) # elif GTEST_CREATE_SHARED_LIBRARY # define GTEST_API_ __declspec(dllexport) # endif #endif // _MSC_VER #ifndef GTEST_API_ # define GTEST_API_ #endif #ifdef __GNUC__ // Ask the compiler to never inline a given function. # define GTEST_NO_INLINE_ __attribute__((noinline)) #else # define GTEST_NO_INLINE_ #endif namespace testing { class Message; namespace internal { class String; // The GTEST_COMPILE_ASSERT_ macro can be used to verify that a compile time // expression is true. For example, you could use it to verify the // size of a static array: // // GTEST_COMPILE_ASSERT_(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES, // content_type_names_incorrect_size); // // or to make sure a struct is smaller than a certain size: // // GTEST_COMPILE_ASSERT_(sizeof(foo) < 128, foo_too_large); // // The second argument to the macro is the name of the variable. If // the expression is false, most compilers will issue a warning/error // containing the name of the variable. template struct CompileAssert { }; #define GTEST_COMPILE_ASSERT_(expr, msg) \ typedef ::testing::internal::CompileAssert<(bool(expr))> \ msg[bool(expr) ? 1 : -1] // Implementation details of GTEST_COMPILE_ASSERT_: // // - GTEST_COMPILE_ASSERT_ works by defining an array type that has -1 // elements (and thus is invalid) when the expression is false. // // - The simpler definition // // #define GTEST_COMPILE_ASSERT_(expr, msg) typedef char msg[(expr) ? 1 : -1] // // does not work, as gcc supports variable-length arrays whose sizes // are determined at run-time (this is gcc's extension and not part // of the C++ standard). As a result, gcc fails to reject the // following code with the simple definition: // // int foo; // GTEST_COMPILE_ASSERT_(foo, msg); // not supposed to compile as foo is // // not a compile-time constant. // // - By using the type CompileAssert<(bool(expr))>, we ensures that // expr is a compile-time constant. (Template arguments must be // determined at compile-time.) // // - The outter parentheses in CompileAssert<(bool(expr))> are necessary // to work around a bug in gcc 3.4.4 and 4.0.1. If we had written // // CompileAssert // // instead, these compilers will refuse to compile // // GTEST_COMPILE_ASSERT_(5 > 0, some_message); // // (They seem to think the ">" in "5 > 0" marks the end of the // template argument list.) // // - The array size is (bool(expr) ? 1 : -1), instead of simply // // ((expr) ? 1 : -1). // // This is to avoid running into a bug in MS VC 7.1, which // causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1. // StaticAssertTypeEqHelper is used by StaticAssertTypeEq defined in gtest.h. // // This template is declared, but intentionally undefined. template struct StaticAssertTypeEqHelper; template struct StaticAssertTypeEqHelper {}; #if GTEST_HAS_GLOBAL_STRING typedef ::string string; #else typedef ::std::string string; #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING typedef ::wstring wstring; #elif GTEST_HAS_STD_WSTRING typedef ::std::wstring wstring; #endif // GTEST_HAS_GLOBAL_WSTRING // A helper for suppressing warnings on constant condition. It just // returns 'condition'. GTEST_API_ bool IsTrue(bool condition); // Defines scoped_ptr. // This implementation of scoped_ptr is PARTIAL - it only contains // enough stuff to satisfy Google Test's need. template class scoped_ptr { public: typedef T element_type; explicit scoped_ptr(T* p = NULL) : ptr_(p) {} ~scoped_ptr() { reset(); } T& operator*() const { return *ptr_; } T* operator->() const { return ptr_; } T* get() const { return ptr_; } T* release() { T* const ptr = ptr_; ptr_ = NULL; return ptr; } void reset(T* p = NULL) { if (p != ptr_) { if (IsTrue(sizeof(T) > 0)) { // Makes sure T is a complete type. delete ptr_; } ptr_ = p; } } private: T* ptr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(scoped_ptr); }; // Defines RE. // A simple C++ wrapper for . It uses the POSIX Extended // Regular Expression syntax. class GTEST_API_ RE { public: // A copy constructor is required by the Standard to initialize object // references from r-values. RE(const RE& other) { Init(other.pattern()); } // Constructs an RE from a string. RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT #if GTEST_HAS_GLOBAL_STRING RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT #endif // GTEST_HAS_GLOBAL_STRING RE(const char* regex) { Init(regex); } // NOLINT ~RE(); // Returns the string representation of the regex. const char* pattern() const { return pattern_; } // FullMatch(str, re) returns true iff regular expression re matches // the entire str. // PartialMatch(str, re) returns true iff regular expression re // matches a substring of str (including str itself). // // TODO(wan@google.com): make FullMatch() and PartialMatch() work // when str contains NUL characters. static bool FullMatch(const ::std::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::std::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #if GTEST_HAS_GLOBAL_STRING static bool FullMatch(const ::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #endif // GTEST_HAS_GLOBAL_STRING static bool FullMatch(const char* str, const RE& re); static bool PartialMatch(const char* str, const RE& re); private: void Init(const char* regex); // We use a const char* instead of a string, as Google Test may be used // where string is not available. We also do not use Google Test's own // String type here, in order to simplify dependencies between the // files. const char* pattern_; bool is_valid_; #if GTEST_USES_POSIX_RE regex_t full_regex_; // For FullMatch(). regex_t partial_regex_; // For PartialMatch(). #else // GTEST_USES_SIMPLE_RE const char* full_pattern_; // For FullMatch(); #endif GTEST_DISALLOW_ASSIGN_(RE); }; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line); // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. GTEST_API_ ::std::string FormatCompilerIndependentFileLocation(const char* file, int line); // Defines logging utilities: // GTEST_LOG_(severity) - logs messages at the specified severity level. The // message itself is streamed into the macro. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. enum GTestLogSeverity { GTEST_INFO, GTEST_WARNING, GTEST_ERROR, GTEST_FATAL }; // Formats log entry severity, provides a stream object for streaming the // log message, and terminates the message with a newline when going out of // scope. class GTEST_API_ GTestLog { public: GTestLog(GTestLogSeverity severity, const char* file, int line); // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. ~GTestLog(); ::std::ostream& GetStream() { return ::std::cerr; } private: const GTestLogSeverity severity_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestLog); }; #define GTEST_LOG_(severity) \ ::testing::internal::GTestLog(::testing::internal::GTEST_##severity, \ __FILE__, __LINE__).GetStream() inline void LogToStderr() {} inline void FlushInfoLog() { fflush(NULL); } // INTERNAL IMPLEMENTATION - DO NOT USE. // // GTEST_CHECK_ is an all-mode assert. It aborts the program if the condition // is not satisfied. // Synopsys: // GTEST_CHECK_(boolean_condition); // or // GTEST_CHECK_(boolean_condition) << "Additional message"; // // This checks the condition and if the condition is not satisfied // it prints message about the condition violation, including the // condition itself, plus additional message streamed into it, if any, // and then it aborts the program. It aborts the program irrespective of // whether it is built in the debug mode or not. #define GTEST_CHECK_(condition) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::IsTrue(condition)) \ ; \ else \ GTEST_LOG_(FATAL) << "Condition " #condition " failed. " // An all-mode assert to verify that the given POSIX-style function // call returns 0 (indicating success). Known limitation: this // doesn't expand to a balanced 'if' statement, so enclose the macro // in {} if you need to use it as the only statement in an 'if' // branch. #define GTEST_CHECK_POSIX_SUCCESS_(posix_call) \ if (const int gtest_error = (posix_call)) \ GTEST_LOG_(FATAL) << #posix_call << "failed with error " \ << gtest_error // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Use ImplicitCast_ as a safe version of static_cast for upcasting in // the type hierarchy (e.g. casting a Foo* to a SuperclassOfFoo* or a // const Foo*). When you use ImplicitCast_, the compiler checks that // the cast is safe. Such explicit ImplicitCast_s are necessary in // surprisingly many situations where C++ demands an exact type match // instead of an argument type convertable to a target type. // // The syntax for using ImplicitCast_ is the same as for static_cast: // // ImplicitCast_(expr) // // ImplicitCast_ would have been part of the C++ standard library, // but the proposal was submitted too late. It will probably make // its way into the language in the future. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., implicit_cast). The internal // namespace alone is not enough because the function can be found by ADL. template inline To ImplicitCast_(To x) { return x; } // When you upcast (that is, cast a pointer from type Foo to type // SuperclassOfFoo), it's fine to use ImplicitCast_<>, since upcasts // always succeed. When you downcast (that is, cast a pointer from // type Foo to type SubclassOfFoo), static_cast<> isn't safe, because // how do you know the pointer is really of type SubclassOfFoo? It // could be a bare Foo, or of type DifferentSubclassOfFoo. Thus, // when you downcast, you should use this macro. In debug mode, we // use dynamic_cast<> to double-check the downcast is legal (we die // if it's not). In normal mode, we do the efficient static_cast<> // instead. Thus, it's important to test in debug mode to make sure // the cast is legal! // This is the only place in the code we should use dynamic_cast<>. // In particular, you SHOULDN'T be using dynamic_cast<> in order to // do RTTI (eg code like this: // if (dynamic_cast(foo)) HandleASubclass1Object(foo); // if (dynamic_cast(foo)) HandleASubclass2Object(foo); // You should design the code some other way not to need this. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., down_cast). The internal // namespace alone is not enough because the function can be found by ADL. template // use like this: DownCast_(foo); inline To DownCast_(From* f) { // so we only accept pointers // Ensures that To is a sub-type of From *. This test is here only // for compile-time type checking, and has no overhead in an // optimized build at run-time, as it will be optimized away // completely. if (false) { const To to = NULL; ::testing::internal::ImplicitCast_(to); } #if GTEST_HAS_RTTI // RTTI: debug mode only! GTEST_CHECK_(f == NULL || dynamic_cast(f) != NULL); #endif return static_cast(f); } // Downcasts the pointer of type Base to Derived. // Derived must be a subclass of Base. The parameter MUST // point to a class of type Derived, not any subclass of it. // When RTTI is available, the function performs a runtime // check to enforce this. template Derived* CheckedDowncastToActualType(Base* base) { #if GTEST_HAS_RTTI GTEST_CHECK_(typeid(*base) == typeid(Derived)); return dynamic_cast(base); // NOLINT #else return static_cast(base); // Poor man's downcast. #endif } #if GTEST_HAS_STREAM_REDIRECTION // Defines the stderr capturer: // CaptureStdout - starts capturing stdout. // GetCapturedStdout - stops capturing stdout and returns the captured string. // CaptureStderr - starts capturing stderr. // GetCapturedStderr - stops capturing stderr and returns the captured string. // GTEST_API_ void CaptureStdout(); GTEST_API_ String GetCapturedStdout(); GTEST_API_ void CaptureStderr(); GTEST_API_ String GetCapturedStderr(); #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). extern ::std::vector g_argvs; // GTEST_HAS_DEATH_TEST implies we have ::std::string. const ::std::vector& GetArgvs(); #endif // GTEST_HAS_DEATH_TEST // Defines synchronization primitives. #if GTEST_HAS_PTHREAD // Sleeps for (roughly) n milli-seconds. This function is only for // testing Google Test's own constructs. Don't use it in user tests, // either directly or indirectly. inline void SleepMilliseconds(int n) { const timespec time = { 0, // 0 seconds. n * 1000L * 1000L, // And n ms. }; nanosleep(&time, NULL); } // Allows a controller thread to pause execution of newly created // threads until notified. Instances of this class must be created // and destroyed in the controller thread. // // This class is only for testing Google Test's own constructs. Do not // use it in user tests, either directly or indirectly. class Notification { public: Notification() : notified_(false) {} // Notifies all threads created with this notification to start. Must // be called from the controller thread. void Notify() { notified_ = true; } // Blocks until the controller thread notifies. Must be called from a test // thread. void WaitForNotification() { while(!notified_) { SleepMilliseconds(10); } } private: volatile bool notified_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Notification); }; // As a C-function, ThreadFuncWithCLinkage cannot be templated itself. // Consequently, it cannot select a correct instantiation of ThreadWithParam // in order to call its Run(). Introducing ThreadWithParamBase as a // non-templated base class for ThreadWithParam allows us to bypass this // problem. class ThreadWithParamBase { public: virtual ~ThreadWithParamBase() {} virtual void Run() = 0; }; // pthread_create() accepts a pointer to a function type with the C linkage. // According to the Standard (7.5/1), function types with different linkages // are different even if they are otherwise identical. Some compilers (for // example, SunStudio) treat them as different types. Since class methods // cannot be defined with C-linkage we need to define a free C-function to // pass into pthread_create(). extern "C" inline void* ThreadFuncWithCLinkage(void* thread) { static_cast(thread)->Run(); return NULL; } // Helper class for testing Google Test's multi-threading constructs. // To use it, write: // // void ThreadFunc(int param) { /* Do things with param */ } // Notification thread_can_start; // ... // // The thread_can_start parameter is optional; you can supply NULL. // ThreadWithParam thread(&ThreadFunc, 5, &thread_can_start); // thread_can_start.Notify(); // // These classes are only for testing Google Test's own constructs. Do // not use them in user tests, either directly or indirectly. template class ThreadWithParam : public ThreadWithParamBase { public: typedef void (*UserThreadFunc)(T); ThreadWithParam( UserThreadFunc func, T param, Notification* thread_can_start) : func_(func), param_(param), thread_can_start_(thread_can_start), finished_(false) { ThreadWithParamBase* const base = this; // The thread can be created only after all fields except thread_ // have been initialized. GTEST_CHECK_POSIX_SUCCESS_( pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base)); } ~ThreadWithParam() { Join(); } void Join() { if (!finished_) { GTEST_CHECK_POSIX_SUCCESS_(pthread_join(thread_, 0)); finished_ = true; } } virtual void Run() { if (thread_can_start_ != NULL) thread_can_start_->WaitForNotification(); func_(param_); } private: const UserThreadFunc func_; // User-supplied thread function. const T param_; // User-supplied parameter to the thread function. // When non-NULL, used to block execution until the controller thread // notifies. Notification* const thread_can_start_; bool finished_; // true iff we know that the thread function has finished. pthread_t thread_; // The native thread object. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam); }; // MutexBase and Mutex implement mutex on pthreads-based platforms. They // are used in conjunction with class MutexLock: // // Mutex mutex; // ... // MutexLock lock(&mutex); // Acquires the mutex and releases it at the end // // of the current scope. // // MutexBase implements behavior for both statically and dynamically // allocated mutexes. Do not use MutexBase directly. Instead, write // the following to define a static mutex: // // GTEST_DEFINE_STATIC_MUTEX_(g_some_mutex); // // You can forward declare a static mutex like this: // // GTEST_DECLARE_STATIC_MUTEX_(g_some_mutex); // // To create a dynamic mutex, just define an object of type Mutex. class MutexBase { public: // Acquires this mutex. void Lock() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&mutex_)); owner_ = pthread_self(); } // Releases this mutex. void Unlock() { // We don't protect writing to owner_ here, as it's the caller's // responsibility to ensure that the current thread holds the // mutex when this is called. owner_ = 0; GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&mutex_)); } // Does nothing if the current thread holds the mutex. Otherwise, crashes // with high probability. void AssertHeld() const { GTEST_CHECK_(owner_ == pthread_self()) << "The current thread is not holding the mutex @" << this; } // A static mutex may be used before main() is entered. It may even // be used before the dynamic initialization stage. Therefore we // must be able to initialize a static mutex object at link time. // This means MutexBase has to be a POD and its member variables // have to be public. public: pthread_mutex_t mutex_; // The underlying pthread mutex. pthread_t owner_; // The thread holding the mutex; 0 means no one holds it. }; // Forward-declares a static mutex. # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::MutexBase mutex // Defines and statically (i.e. at link time) initializes a static mutex. # define GTEST_DEFINE_STATIC_MUTEX_(mutex) \ ::testing::internal::MutexBase mutex = { PTHREAD_MUTEX_INITIALIZER, 0 } // The Mutex class can only be used for mutexes created at runtime. It // shares its API with MutexBase otherwise. class Mutex : public MutexBase { public: Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL)); owner_ = 0; } ~Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex); }; // We cannot name this class MutexLock as the ctor declaration would // conflict with a macro named MutexLock, which is defined on some // platforms. Hence the typedef trick below. class GTestMutexLock { public: explicit GTestMutexLock(MutexBase* mutex) : mutex_(mutex) { mutex_->Lock(); } ~GTestMutexLock() { mutex_->Unlock(); } private: MutexBase* const mutex_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestMutexLock); }; typedef GTestMutexLock MutexLock; // Helpers for ThreadLocal. // pthread_key_create() requires DeleteThreadLocalValue() to have // C-linkage. Therefore it cannot be templatized to access // ThreadLocal. Hence the need for class // ThreadLocalValueHolderBase. class ThreadLocalValueHolderBase { public: virtual ~ThreadLocalValueHolderBase() {} }; // Called by pthread to delete thread-local data stored by // pthread_setspecific(). extern "C" inline void DeleteThreadLocalValue(void* value_holder) { delete static_cast(value_holder); } // Implements thread-local storage on pthreads-based systems. // // // Thread 1 // ThreadLocal tl(100); // 100 is the default value for each thread. // // // Thread 2 // tl.set(150); // Changes the value for thread 2 only. // EXPECT_EQ(150, tl.get()); // // // Thread 1 // EXPECT_EQ(100, tl.get()); // In thread 1, tl has the original value. // tl.set(200); // EXPECT_EQ(200, tl.get()); // // The template type argument T must have a public copy constructor. // In addition, the default ThreadLocal constructor requires T to have // a public default constructor. // // An object managed for a thread by a ThreadLocal instance is deleted // when the thread exits. Or, if the ThreadLocal instance dies in // that thread, when the ThreadLocal dies. It's the user's // responsibility to ensure that all other threads using a ThreadLocal // have exited when it dies, or the per-thread objects for those // threads will not be deleted. // // Google Test only uses global ThreadLocal objects. That means they // will die after main() has returned. Therefore, no per-thread // object managed by Google Test will be leaked as long as all threads // using Google Test have exited when main() returns. template class ThreadLocal { public: ThreadLocal() : key_(CreateKey()), default_() {} explicit ThreadLocal(const T& value) : key_(CreateKey()), default_(value) {} ~ThreadLocal() { // Destroys the managed object for the current thread, if any. DeleteThreadLocalValue(pthread_getspecific(key_)); // Releases resources associated with the key. This will *not* // delete managed objects for other threads. GTEST_CHECK_POSIX_SUCCESS_(pthread_key_delete(key_)); } T* pointer() { return GetOrCreateValue(); } const T* pointer() const { return GetOrCreateValue(); } const T& get() const { return *pointer(); } void set(const T& value) { *pointer() = value; } private: // Holds a value of type T. class ValueHolder : public ThreadLocalValueHolderBase { public: explicit ValueHolder(const T& value) : value_(value) {} T* pointer() { return &value_; } private: T value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder); }; static pthread_key_t CreateKey() { pthread_key_t key; // When a thread exits, DeleteThreadLocalValue() will be called on // the object managed for that thread. GTEST_CHECK_POSIX_SUCCESS_( pthread_key_create(&key, &DeleteThreadLocalValue)); return key; } T* GetOrCreateValue() const { ThreadLocalValueHolderBase* const holder = static_cast(pthread_getspecific(key_)); if (holder != NULL) { return CheckedDowncastToActualType(holder)->pointer(); } ValueHolder* const new_holder = new ValueHolder(default_); ThreadLocalValueHolderBase* const holder_base = new_holder; GTEST_CHECK_POSIX_SUCCESS_(pthread_setspecific(key_, holder_base)); return new_holder->pointer(); } // A key pthreads uses for looking up per-thread values. const pthread_key_t key_; const T default_; // The default value for each thread. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadLocal); }; # define GTEST_IS_THREADSAFE 1 #else // GTEST_HAS_PTHREAD // A dummy implementation of synchronization primitives (mutex, lock, // and thread-local variable). Necessary for compiling Google Test where // mutex is not supported - using Google Test in multiple threads is not // supported on such platforms. class Mutex { public: Mutex() {} void AssertHeld() const {} }; # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::Mutex mutex # define GTEST_DEFINE_STATIC_MUTEX_(mutex) ::testing::internal::Mutex mutex class GTestMutexLock { public: explicit GTestMutexLock(Mutex*) {} // NOLINT }; typedef GTestMutexLock MutexLock; template class ThreadLocal { public: ThreadLocal() : value_() {} explicit ThreadLocal(const T& value) : value_(value) {} T* pointer() { return &value_; } const T* pointer() const { return &value_; } const T& get() const { return value_; } void set(const T& value) { value_ = value; } private: T value_; }; // The above synchronization primitives have dummy implementations. // Therefore Google Test is not thread-safe. # define GTEST_IS_THREADSAFE 0 #endif // GTEST_HAS_PTHREAD // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. GTEST_API_ size_t GetThreadCount(); // Passing non-POD classes through ellipsis (...) crashes the ARM // compiler and generates a warning in Sun Studio. The Nokia Symbian // and the IBM XL C/C++ compiler try to instantiate a copy constructor // for objects passed through ellipsis (...), failing for uncopyable // objects. We define this to ensure that only POD is passed through // ellipsis on these systems. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) || defined(__SUNPRO_CC) // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_ELLIPSIS_NEEDS_POD_ 1 #else # define GTEST_CAN_COMPARE_NULL 1 #endif // The Nokia Symbian and IBM XL C/C++ compilers cannot decide between // const T& and const T* in a function template. These compilers // _can_ decide between class template specializations for T and T*, // so a tr1::type_traits-like is_pointer works. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) # define GTEST_NEEDS_IS_POINTER_ 1 #endif template struct bool_constant { typedef bool_constant type; static const bool value = bool_value; }; template const bool bool_constant::value; typedef bool_constant false_type; typedef bool_constant true_type; template struct is_pointer : public false_type {}; template struct is_pointer : public true_type {}; template struct IteratorTraits { typedef typename Iterator::value_type value_type; }; template struct IteratorTraits { typedef T value_type; }; template struct IteratorTraits { typedef T value_type; }; #if GTEST_OS_WINDOWS # define GTEST_PATH_SEP_ "\\" # define GTEST_HAS_ALT_PATH_SEP_ 1 // The biggest signed integer type the compiler supports. typedef __int64 BiggestInt; #else # define GTEST_PATH_SEP_ "/" # define GTEST_HAS_ALT_PATH_SEP_ 0 typedef long long BiggestInt; // NOLINT #endif // GTEST_OS_WINDOWS // Utilities for char. // isspace(int ch) and friends accept an unsigned char or EOF. char // may be signed, depending on the compiler (or compiler flags). // Therefore we need to cast a char to unsigned char before calling // isspace(), etc. inline bool IsAlpha(char ch) { return isalpha(static_cast(ch)) != 0; } inline bool IsAlNum(char ch) { return isalnum(static_cast(ch)) != 0; } inline bool IsDigit(char ch) { return isdigit(static_cast(ch)) != 0; } inline bool IsLower(char ch) { return islower(static_cast(ch)) != 0; } inline bool IsSpace(char ch) { return isspace(static_cast(ch)) != 0; } inline bool IsUpper(char ch) { return isupper(static_cast(ch)) != 0; } inline bool IsXDigit(char ch) { return isxdigit(static_cast(ch)) != 0; } inline char ToLower(char ch) { return static_cast(tolower(static_cast(ch))); } inline char ToUpper(char ch) { return static_cast(toupper(static_cast(ch))); } // The testing::internal::posix namespace holds wrappers for common // POSIX functions. These wrappers hide the differences between // Windows/MSVC and POSIX systems. Since some compilers define these // standard functions as macros, the wrapper cannot have the same name // as the wrapped function. namespace posix { // Functions with a different name on Windows. #if GTEST_OS_WINDOWS typedef struct _stat StatStruct; # ifdef __BORLANDC__ inline int IsATTY(int fd) { return isatty(fd); } inline int StrCaseCmp(const char* s1, const char* s2) { return stricmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } # else // !__BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int IsATTY(int /* fd */) { return 0; } # else inline int IsATTY(int fd) { return _isatty(fd); } # endif // GTEST_OS_WINDOWS_MOBILE inline int StrCaseCmp(const char* s1, const char* s2) { return _stricmp(s1, s2); } inline char* StrDup(const char* src) { return _strdup(src); } # endif // __BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int FileNo(FILE* file) { return reinterpret_cast(_fileno(file)); } // Stat(), RmDir(), and IsDir() are not needed on Windows CE at this // time and thus not defined there. # else inline int FileNo(FILE* file) { return _fileno(file); } inline int Stat(const char* path, StatStruct* buf) { return _stat(path, buf); } inline int RmDir(const char* dir) { return _rmdir(dir); } inline bool IsDir(const StatStruct& st) { return (_S_IFDIR & st.st_mode) != 0; } # endif // GTEST_OS_WINDOWS_MOBILE #else typedef struct stat StatStruct; inline int FileNo(FILE* file) { return fileno(file); } inline int IsATTY(int fd) { return isatty(fd); } inline int Stat(const char* path, StatStruct* buf) { return stat(path, buf); } inline int StrCaseCmp(const char* s1, const char* s2) { return strcasecmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } inline int RmDir(const char* dir) { return rmdir(dir); } inline bool IsDir(const StatStruct& st) { return S_ISDIR(st.st_mode); } #endif // GTEST_OS_WINDOWS // Functions deprecated by MSVC 8.0. #ifdef _MSC_VER // Temporarily disable warning 4996 (deprecated function). # pragma warning(push) # pragma warning(disable:4996) #endif inline const char* StrNCpy(char* dest, const char* src, size_t n) { return strncpy(dest, src, n); } // ChDir(), FReopen(), FDOpen(), Read(), Write(), Close(), and // StrError() aren't needed on Windows CE at this time and thus not // defined there. #if !GTEST_OS_WINDOWS_MOBILE inline int ChDir(const char* dir) { return chdir(dir); } #endif inline FILE* FOpen(const char* path, const char* mode) { return fopen(path, mode); } #if !GTEST_OS_WINDOWS_MOBILE inline FILE *FReopen(const char* path, const char* mode, FILE* stream) { return freopen(path, mode, stream); } inline FILE* FDOpen(int fd, const char* mode) { return fdopen(fd, mode); } #endif inline int FClose(FILE* fp) { return fclose(fp); } #if !GTEST_OS_WINDOWS_MOBILE inline int Read(int fd, void* buf, unsigned int count) { return static_cast(read(fd, buf, count)); } inline int Write(int fd, const void* buf, unsigned int count) { return static_cast(write(fd, buf, count)); } inline int Close(int fd) { return close(fd); } inline const char* StrError(int errnum) { return strerror(errnum); } #endif inline const char* GetEnv(const char* name) { #if GTEST_OS_WINDOWS_MOBILE // We are on Windows CE, which has no environment variables. return NULL; #elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) // Environment variables which we programmatically clear will be set to the // empty string rather than unset (NULL). Handle that case. const char* const env = getenv(name); return (env != NULL && env[0] != '\0') ? env : NULL; #else return getenv(name); #endif } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif #if GTEST_OS_WINDOWS_MOBILE // Windows CE has no C library. The abort() function is used in // several places in Google Test. This implementation provides a reasonable // imitation of standard behaviour. void Abort(); #else inline void Abort() { abort(); } #endif // GTEST_OS_WINDOWS_MOBILE } // namespace posix // The maximum number a BiggestInt can represent. This definition // works no matter BiggestInt is represented in one's complement or // two's complement. // // We cannot rely on numeric_limits in STL, as __int64 and long long // are not part of standard C++ and numeric_limits doesn't need to be // defined for them. const BiggestInt kMaxBiggestInt = ~(static_cast(1) << (8*sizeof(BiggestInt) - 1)); // This template class serves as a compile-time function from size to // type. It maps a size in bytes to a primitive type with that // size. e.g. // // TypeWithSize<4>::UInt // // is typedef-ed to be unsigned int (unsigned integer made up of 4 // bytes). // // Such functionality should belong to STL, but I cannot find it // there. // // Google Test uses this class in the implementation of floating-point // comparison. // // For now it only handles UInt (unsigned int) as that's all Google Test // needs. Other types can be easily added in the future if need // arises. template class TypeWithSize { public: // This prevents the user from using TypeWithSize with incorrect // values of N. typedef void UInt; }; // The specialization for size 4. template <> class TypeWithSize<4> { public: // unsigned int has size 4 in both gcc and MSVC. // // As base/basictypes.h doesn't compile on Windows, we cannot use // uint32, uint64, and etc here. typedef int Int; typedef unsigned int UInt; }; // The specialization for size 8. template <> class TypeWithSize<8> { public: #if GTEST_OS_WINDOWS typedef __int64 Int; typedef unsigned __int64 UInt; #else typedef long long Int; // NOLINT typedef unsigned long long UInt; // NOLINT #endif // GTEST_OS_WINDOWS }; // Integer types of known sizes. typedef TypeWithSize<4>::Int Int32; typedef TypeWithSize<4>::UInt UInt32; typedef TypeWithSize<8>::Int Int64; typedef TypeWithSize<8>::UInt UInt64; typedef TypeWithSize<8>::Int TimeInMillis; // Represents time in milliseconds. // Utilities for command line flags and environment variables. // Macro for referencing flags. #define GTEST_FLAG(name) FLAGS_gtest_##name // Macros for declaring flags. #define GTEST_DECLARE_bool_(name) GTEST_API_ extern bool GTEST_FLAG(name) #define GTEST_DECLARE_int32_(name) \ GTEST_API_ extern ::testing::internal::Int32 GTEST_FLAG(name) #define GTEST_DECLARE_string_(name) \ GTEST_API_ extern ::testing::internal::String GTEST_FLAG(name) // Macros for defining flags. #define GTEST_DEFINE_bool_(name, default_val, doc) \ GTEST_API_ bool GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_int32_(name, default_val, doc) \ GTEST_API_ ::testing::internal::Int32 GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_string_(name, default_val, doc) \ GTEST_API_ ::testing::internal::String GTEST_FLAG(name) = (default_val) // Parses 'str' for a 32-bit signed integer. If successful, writes the result // to *value and returns true; otherwise leaves *value unchanged and returns // false. // TODO(chandlerc): Find a better way to refactor flag and environment parsing // out of both gtest-port.cc and gtest.cc to avoid exporting this utility // function. bool ParseInt32(const Message& src_text, const char* str, Int32* value); // Parses a bool/Int32/string from the environment variable // corresponding to the given Google Test flag. bool BoolFromGTestEnv(const char* flag, bool default_val); GTEST_API_ Int32 Int32FromGTestEnv(const char* flag, Int32 default_val); const char* StringFromGTestEnv(const char* flag, const char* default_val); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #if GTEST_OS_LINUX # include # include # include # include #endif // GTEST_OS_LINUX #include #include #include #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares the String class and functions used internally by // Google Test. They are subject to change without notice. They should not used // by code external to Google Test. // // This header file is #included by . // It should not be #included by other files. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #ifdef __BORLANDC__ // string.h is not guaranteed to provide strcpy on C++ Builder. # include #endif #include #include namespace testing { namespace internal { // String - a UTF-8 string class. // // For historic reasons, we don't use std::string. // // TODO(wan@google.com): replace this class with std::string or // implement it in terms of the latter. // // Note that String can represent both NULL and the empty string, // while std::string cannot represent NULL. // // NULL and the empty string are considered different. NULL is less // than anything (including the empty string) except itself. // // This class only provides minimum functionality necessary for // implementing Google Test. We do not intend to implement a full-fledged // string class here. // // Since the purpose of this class is to provide a substitute for // std::string on platforms where it cannot be used, we define a copy // constructor and assignment operators such that we don't need // conditional compilation in a lot of places. // // In order to make the representation efficient, the d'tor of String // is not virtual. Therefore DO NOT INHERIT FROM String. class GTEST_API_ String { public: // Static utility methods // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. static String ShowCStringQuoted(const char* c_str); // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting the return value using // delete[]. Returns the cloned string, or NULL if the input is // NULL. // // This is different from strdup() in string.h, which allocates // memory using malloc(). static const char* CloneCString(const char* c_str); #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not have the 'ANSI' versions of Win32 APIs. To be // able to pass strings to Win32 APIs on CE we need to convert them // to 'Unicode', UTF-16. // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. // // The wide string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static LPCWSTR AnsiToUtf16(const char* c_str); // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. // // The returned string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static const char* Utf16ToAnsi(LPCWSTR utf16_str); #endif // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CStringEquals(const char* lhs, const char* rhs); // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". If an error occurred during // the conversion, "(failed to convert from wide string)" is // returned. static String ShowWideCString(const wchar_t* wide_c_str); // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. static String ShowWideCStringQuoted(const wchar_t* wide_c_str); // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Compares two C strings, ignoring case. Returns true iff they // have the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs); // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. static bool CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing // 0). If 4096 characters are not enough to format the input, // "" is returned. static String Format(const char* format, ...); // C'tors // The default c'tor constructs a NULL string. String() : c_str_(NULL), length_(0) {} // Constructs a String by cloning a 0-terminated C string. String(const char* a_c_str) { // NOLINT if (a_c_str == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(a_c_str, strlen(a_c_str)); } } // Constructs a String by copying a given number of chars from a // buffer. E.g. String("hello", 3) creates the string "hel", // String("a\0bcd", 4) creates "a\0bc", String(NULL, 0) creates "", // and String(NULL, 1) results in access violation. String(const char* buffer, size_t a_length) { ConstructNonNull(buffer, a_length); } // The copy c'tor creates a new copy of the string. The two // String objects do not share content. String(const String& str) : c_str_(NULL), length_(0) { *this = str; } // D'tor. String is intended to be a final class, so the d'tor // doesn't need to be virtual. ~String() { delete[] c_str_; } // Allows a String to be implicitly converted to an ::std::string or // ::string, and vice versa. Converting a String containing a NULL // pointer to ::std::string or ::string is undefined behavior. // Converting a ::std::string or ::string containing an embedded NUL // character to a String will result in the prefix up to the first // NUL character. String(const ::std::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::std::string() const { return ::std::string(c_str(), length()); } #if GTEST_HAS_GLOBAL_STRING String(const ::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::string() const { return ::string(c_str(), length()); } #endif // GTEST_HAS_GLOBAL_STRING // Returns true iff this is an empty string (i.e. ""). bool empty() const { return (c_str() != NULL) && (length() == 0); } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int Compare(const String& rhs) const; // Returns true iff this String equals the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator==(const char* a_c_str) const { return Compare(a_c_str) == 0; } // Returns true iff this String is less than the given String. A // NULL string is considered less than "". bool operator<(const String& rhs) const { return Compare(rhs) < 0; } // Returns true iff this String doesn't equal the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator!=(const char* a_c_str) const { return !(*this == a_c_str); } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool EndsWith(const char* suffix) const; // Returns true iff this String ends with the given suffix, not considering // case. Any String is considered to end with a NULL or empty suffix. bool EndsWithCaseInsensitive(const char* suffix) const; // Returns the length of the encapsulated string, or 0 if the // string is NULL. size_t length() const { return length_; } // Gets the 0-terminated C string this String object represents. // The String object still owns the string. Therefore the caller // should NOT delete the return value. const char* c_str() const { return c_str_; } // Assigns a C string to this object. Self-assignment works. const String& operator=(const char* a_c_str) { return *this = String(a_c_str); } // Assigns a String object to this object. Self-assignment works. const String& operator=(const String& rhs) { if (this != &rhs) { delete[] c_str_; if (rhs.c_str() == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(rhs.c_str(), rhs.length()); } } return *this; } private: // Constructs a non-NULL String from the given content. This // function can only be called when c_str_ has not been allocated. // ConstructNonNull(NULL, 0) results in an empty string (""). // ConstructNonNull(NULL, non_zero) is undefined behavior. void ConstructNonNull(const char* buffer, size_t a_length) { char* const str = new char[a_length + 1]; memcpy(str, buffer, a_length); str[a_length] = '\0'; c_str_ = str; length_ = a_length; } const char* c_str_; size_t length_; }; // class String // Streams a String to an ostream. Each '\0' character in the String // is replaced with "\\0". inline ::std::ostream& operator<<(::std::ostream& os, const String& str) { if (str.c_str() == NULL) { os << "(null)"; } else { const char* const c_str = str.c_str(); for (size_t i = 0; i != str.length(); i++) { if (c_str[i] == '\0') { os << "\\0"; } else { os << c_str[i]; } } } return os; } // Gets the content of the stringstream's buffer as a String. Each '\0' // character in the buffer is replaced with "\\0". GTEST_API_ String StringStreamToString(::std::stringstream* stream); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: keith.ray@gmail.com (Keith Ray) // // Google Test filepath utilities // // This header file declares classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included in . // Do not include this header file separately! #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ namespace testing { namespace internal { // FilePath - a class for file and directory pathname manipulation which // handles platform-specific conventions (like the pathname separator). // Used for helper functions for naming files in a directory for xml output. // Except for Set methods, all methods are const or static, which provides an // "immutable value object" -- useful for peace of mind. // A FilePath with a value ending in a path separator ("like/this/") represents // a directory, otherwise it is assumed to represent a file. In either case, // it may or may not represent an actual file or directory in the file system. // Names are NOT checked for syntax correctness -- no checking for illegal // characters, malformed paths, etc. class GTEST_API_ FilePath { public: FilePath() : pathname_("") { } FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } explicit FilePath(const char* pathname) : pathname_(pathname) { Normalize(); } explicit FilePath(const String& pathname) : pathname_(pathname) { Normalize(); } FilePath& operator=(const FilePath& rhs) { Set(rhs); return *this; } void Set(const FilePath& rhs) { pathname_ = rhs.pathname_; } String ToString() const { return pathname_; } const char* c_str() const { return pathname_.c_str(); } // Returns the current working directory, or "" if unsuccessful. static FilePath GetCurrentDir(); // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. static FilePath MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension); // Given directory = "dir", relative_path = "test.xml", // returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. static FilePath ConcatPaths(const FilePath& directory, const FilePath& relative_path); // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. static FilePath GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension); // Returns true iff the path is NULL or "". bool IsEmpty() const { return c_str() == NULL || *c_str() == '\0'; } // If input name has a trailing separator character, removes it and returns // the name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath RemoveTrailingPathSeparator() const; // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveDirectoryName() const; // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveFileName() const; // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath RemoveExtension(const char* extension) const; // Creates directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create // directories for any reason. Will also return false if the FilePath does // not represent a directory (that is, it doesn't end with a path separator). bool CreateDirectoriesRecursively() const; // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool CreateFolder() const; // Returns true if FilePath describes something in the file-system, // either a file, directory, or whatever, and that something exists. bool FileOrDirectoryExists() const; // Returns true if pathname describes a directory in the file-system // that exists. bool DirectoryExists() const; // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool IsDirectory() const; // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool IsRootDirectory() const; // Returns true if pathname describes an absolute path. bool IsAbsolutePath() const; private: // Replaces multiple consecutive separators with a single separator. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // // A pathname with multiple consecutive separators may occur either through // user error or as a result of some scripts or APIs that generate a pathname // with a trailing separator. On other platforms the same API or script // may NOT generate a pathname with a trailing "/". Then elsewhere that // pathname may have another "/" and pathname components added to it, // without checking for the separator already being there. // The script language and operating system may allow paths like "foo//bar" // but some of the functions in FilePath will not handle that correctly. In // particular, RemoveTrailingPathSeparator() only removes one separator, and // it is called in CreateDirectoriesRecursively() assuming that it will change // a pathname from directory syntax (trailing separator) to filename syntax. // // On Windows this method also replaces the alternate path separator '/' with // the primary path separator '\\', so that for example "bar\\/\\foo" becomes // "bar\\foo". void Normalize(); // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FindLastPathSeparator() const; String pathname_; }; // class FilePath } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ // This file was GENERATED by command: // pump.py gtest-type-util.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Type utilities needed for implementing typed and type-parameterized // tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently we support at most 50 types in a list, and at most 50 // type-parameterized tests in one type-parameterized test case. // Please contact googletestframework@googlegroups.com if you need // more. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // #ifdef __GNUC__ is too general here. It is possible to use gcc without using // libstdc++ (which is where cxxabi.h comes from). # ifdef __GLIBCXX__ # include # elif defined(__HP_aCC) # include # endif // __GLIBCXX__ namespace testing { namespace internal { // GetTypeName() returns a human-readable name of type T. // NB: This function is also used in Google Mock, so don't move it inside of // the typed-test-only section below. template String GetTypeName() { # if GTEST_HAS_RTTI const char* const name = typeid(T).name(); # if defined(__GLIBCXX__) || defined(__HP_aCC) int status = 0; // gcc's implementation of typeid(T).name() mangles the type name, // so we have to demangle it. # ifdef __GLIBCXX__ using abi::__cxa_demangle; # endif // __GLIBCXX__ char* const readable_name = __cxa_demangle(name, 0, 0, &status); const String name_str(status == 0 ? readable_name : name); free(readable_name); return name_str; # else return name; # endif // __GLIBCXX__ || __HP_aCC # else return ""; # endif // GTEST_HAS_RTTI } #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // AssertyTypeEq::type is defined iff T1 and T2 are the same // type. This can be used as a compile-time assertion to ensure that // two types are equal. template struct AssertTypeEq; template struct AssertTypeEq { typedef bool type; }; // A unique type used as the default value for the arguments of class // template Types. This allows us to simulate variadic templates // (e.g. Types, Type, and etc), which C++ doesn't // support directly. struct None {}; // The following family of struct and struct templates are used to // represent type lists. In particular, TypesN // represents a type list with N types (T1, T2, ..., and TN) in it. // Except for Types0, every struct in the family has two member types: // Head for the first type in the list, and Tail for the rest of the // list. // The empty type list. struct Types0 {}; // Type lists of length 1, 2, 3, and so on. template struct Types1 { typedef T1 Head; typedef Types0 Tail; }; template struct Types2 { typedef T1 Head; typedef Types1 Tail; }; template struct Types3 { typedef T1 Head; typedef Types2 Tail; }; template struct Types4 { typedef T1 Head; typedef Types3 Tail; }; template struct Types5 { typedef T1 Head; typedef Types4 Tail; }; template struct Types6 { typedef T1 Head; typedef Types5 Tail; }; template struct Types7 { typedef T1 Head; typedef Types6 Tail; }; template struct Types8 { typedef T1 Head; typedef Types7 Tail; }; template struct Types9 { typedef T1 Head; typedef Types8 Tail; }; template struct Types10 { typedef T1 Head; typedef Types9 Tail; }; template struct Types11 { typedef T1 Head; typedef Types10 Tail; }; template struct Types12 { typedef T1 Head; typedef Types11 Tail; }; template struct Types13 { typedef T1 Head; typedef Types12 Tail; }; template struct Types14 { typedef T1 Head; typedef Types13 Tail; }; template struct Types15 { typedef T1 Head; typedef Types14 Tail; }; template struct Types16 { typedef T1 Head; typedef Types15 Tail; }; template struct Types17 { typedef T1 Head; typedef Types16 Tail; }; template struct Types18 { typedef T1 Head; typedef Types17 Tail; }; template struct Types19 { typedef T1 Head; typedef Types18 Tail; }; template struct Types20 { typedef T1 Head; typedef Types19 Tail; }; template struct Types21 { typedef T1 Head; typedef Types20 Tail; }; template struct Types22 { typedef T1 Head; typedef Types21 Tail; }; template struct Types23 { typedef T1 Head; typedef Types22 Tail; }; template struct Types24 { typedef T1 Head; typedef Types23 Tail; }; template struct Types25 { typedef T1 Head; typedef Types24 Tail; }; template struct Types26 { typedef T1 Head; typedef Types25 Tail; }; template struct Types27 { typedef T1 Head; typedef Types26 Tail; }; template struct Types28 { typedef T1 Head; typedef Types27 Tail; }; template struct Types29 { typedef T1 Head; typedef Types28 Tail; }; template struct Types30 { typedef T1 Head; typedef Types29 Tail; }; template struct Types31 { typedef T1 Head; typedef Types30 Tail; }; template struct Types32 { typedef T1 Head; typedef Types31 Tail; }; template struct Types33 { typedef T1 Head; typedef Types32 Tail; }; template struct Types34 { typedef T1 Head; typedef Types33 Tail; }; template struct Types35 { typedef T1 Head; typedef Types34 Tail; }; template struct Types36 { typedef T1 Head; typedef Types35 Tail; }; template struct Types37 { typedef T1 Head; typedef Types36 Tail; }; template struct Types38 { typedef T1 Head; typedef Types37 Tail; }; template struct Types39 { typedef T1 Head; typedef Types38 Tail; }; template struct Types40 { typedef T1 Head; typedef Types39 Tail; }; template struct Types41 { typedef T1 Head; typedef Types40 Tail; }; template struct Types42 { typedef T1 Head; typedef Types41 Tail; }; template struct Types43 { typedef T1 Head; typedef Types42 Tail; }; template struct Types44 { typedef T1 Head; typedef Types43 Tail; }; template struct Types45 { typedef T1 Head; typedef Types44 Tail; }; template struct Types46 { typedef T1 Head; typedef Types45 Tail; }; template struct Types47 { typedef T1 Head; typedef Types46 Tail; }; template struct Types48 { typedef T1 Head; typedef Types47 Tail; }; template struct Types49 { typedef T1 Head; typedef Types48 Tail; }; template struct Types50 { typedef T1 Head; typedef Types49 Tail; }; } // namespace internal // We don't want to require the users to write TypesN<...> directly, // as that would require them to count the length. Types<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Types // will appear as Types in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Types, and Google Test will translate // that to TypesN internally to make error messages // readable. The translation is done by the 'type' member of the // Types template. template struct Types { typedef internal::Types50 type; }; template <> struct Types { typedef internal::Types0 type; }; template struct Types { typedef internal::Types1 type; }; template struct Types { typedef internal::Types2 type; }; template struct Types { typedef internal::Types3 type; }; template struct Types { typedef internal::Types4 type; }; template struct Types { typedef internal::Types5 type; }; template struct Types { typedef internal::Types6 type; }; template struct Types { typedef internal::Types7 type; }; template struct Types { typedef internal::Types8 type; }; template struct Types { typedef internal::Types9 type; }; template struct Types { typedef internal::Types10 type; }; template struct Types { typedef internal::Types11 type; }; template struct Types { typedef internal::Types12 type; }; template struct Types { typedef internal::Types13 type; }; template struct Types { typedef internal::Types14 type; }; template struct Types { typedef internal::Types15 type; }; template struct Types { typedef internal::Types16 type; }; template struct Types { typedef internal::Types17 type; }; template struct Types { typedef internal::Types18 type; }; template struct Types { typedef internal::Types19 type; }; template struct Types { typedef internal::Types20 type; }; template struct Types { typedef internal::Types21 type; }; template struct Types { typedef internal::Types22 type; }; template struct Types { typedef internal::Types23 type; }; template struct Types { typedef internal::Types24 type; }; template struct Types { typedef internal::Types25 type; }; template struct Types { typedef internal::Types26 type; }; template struct Types { typedef internal::Types27 type; }; template struct Types { typedef internal::Types28 type; }; template struct Types { typedef internal::Types29 type; }; template struct Types { typedef internal::Types30 type; }; template struct Types { typedef internal::Types31 type; }; template struct Types { typedef internal::Types32 type; }; template struct Types { typedef internal::Types33 type; }; template struct Types { typedef internal::Types34 type; }; template struct Types { typedef internal::Types35 type; }; template struct Types { typedef internal::Types36 type; }; template struct Types { typedef internal::Types37 type; }; template struct Types { typedef internal::Types38 type; }; template struct Types { typedef internal::Types39 type; }; template struct Types { typedef internal::Types40 type; }; template struct Types { typedef internal::Types41 type; }; template struct Types { typedef internal::Types42 type; }; template struct Types { typedef internal::Types43 type; }; template struct Types { typedef internal::Types44 type; }; template struct Types { typedef internal::Types45 type; }; template struct Types { typedef internal::Types46 type; }; template struct Types { typedef internal::Types47 type; }; template struct Types { typedef internal::Types48 type; }; template struct Types { typedef internal::Types49 type; }; namespace internal { # define GTEST_TEMPLATE_ template class // The template "selector" struct TemplateSel is used to // represent Tmpl, which must be a class template with one type // parameter, as a type. TemplateSel::Bind::type is defined // as the type Tmpl. This allows us to actually instantiate the // template "selected" by TemplateSel. // // This trick is necessary for simulating typedef for class templates, // which C++ doesn't support directly. template struct TemplateSel { template struct Bind { typedef Tmpl type; }; }; # define GTEST_BIND_(TmplSel, T) \ TmplSel::template Bind::type // A unique struct template used as the default value for the // arguments of class template Templates. This allows us to simulate // variadic templates (e.g. Templates, Templates, // and etc), which C++ doesn't support directly. template struct NoneT {}; // The following family of struct and struct templates are used to // represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except // for Templates0, every struct in the family has two member types: // Head for the selector of the first template in the list, and Tail // for the rest of the list. // The empty template list. struct Templates0 {}; // Template lists of length 1, 2, 3, and so on. template struct Templates1 { typedef TemplateSel Head; typedef Templates0 Tail; }; template struct Templates2 { typedef TemplateSel Head; typedef Templates1 Tail; }; template struct Templates3 { typedef TemplateSel Head; typedef Templates2 Tail; }; template struct Templates4 { typedef TemplateSel Head; typedef Templates3 Tail; }; template struct Templates5 { typedef TemplateSel Head; typedef Templates4 Tail; }; template struct Templates6 { typedef TemplateSel Head; typedef Templates5 Tail; }; template struct Templates7 { typedef TemplateSel Head; typedef Templates6 Tail; }; template struct Templates8 { typedef TemplateSel Head; typedef Templates7 Tail; }; template struct Templates9 { typedef TemplateSel Head; typedef Templates8 Tail; }; template struct Templates10 { typedef TemplateSel Head; typedef Templates9 Tail; }; template struct Templates11 { typedef TemplateSel Head; typedef Templates10 Tail; }; template struct Templates12 { typedef TemplateSel Head; typedef Templates11 Tail; }; template struct Templates13 { typedef TemplateSel Head; typedef Templates12 Tail; }; template struct Templates14 { typedef TemplateSel Head; typedef Templates13 Tail; }; template struct Templates15 { typedef TemplateSel Head; typedef Templates14 Tail; }; template struct Templates16 { typedef TemplateSel Head; typedef Templates15 Tail; }; template struct Templates17 { typedef TemplateSel Head; typedef Templates16 Tail; }; template struct Templates18 { typedef TemplateSel Head; typedef Templates17 Tail; }; template struct Templates19 { typedef TemplateSel Head; typedef Templates18 Tail; }; template struct Templates20 { typedef TemplateSel Head; typedef Templates19 Tail; }; template struct Templates21 { typedef TemplateSel Head; typedef Templates20 Tail; }; template struct Templates22 { typedef TemplateSel Head; typedef Templates21 Tail; }; template struct Templates23 { typedef TemplateSel Head; typedef Templates22 Tail; }; template struct Templates24 { typedef TemplateSel Head; typedef Templates23 Tail; }; template struct Templates25 { typedef TemplateSel Head; typedef Templates24 Tail; }; template struct Templates26 { typedef TemplateSel Head; typedef Templates25 Tail; }; template struct Templates27 { typedef TemplateSel Head; typedef Templates26 Tail; }; template struct Templates28 { typedef TemplateSel Head; typedef Templates27 Tail; }; template struct Templates29 { typedef TemplateSel Head; typedef Templates28 Tail; }; template struct Templates30 { typedef TemplateSel Head; typedef Templates29 Tail; }; template struct Templates31 { typedef TemplateSel Head; typedef Templates30 Tail; }; template struct Templates32 { typedef TemplateSel Head; typedef Templates31 Tail; }; template struct Templates33 { typedef TemplateSel Head; typedef Templates32 Tail; }; template struct Templates34 { typedef TemplateSel Head; typedef Templates33 Tail; }; template struct Templates35 { typedef TemplateSel Head; typedef Templates34 Tail; }; template struct Templates36 { typedef TemplateSel Head; typedef Templates35 Tail; }; template struct Templates37 { typedef TemplateSel Head; typedef Templates36 Tail; }; template struct Templates38 { typedef TemplateSel Head; typedef Templates37 Tail; }; template struct Templates39 { typedef TemplateSel Head; typedef Templates38 Tail; }; template struct Templates40 { typedef TemplateSel Head; typedef Templates39 Tail; }; template struct Templates41 { typedef TemplateSel Head; typedef Templates40 Tail; }; template struct Templates42 { typedef TemplateSel Head; typedef Templates41 Tail; }; template struct Templates43 { typedef TemplateSel Head; typedef Templates42 Tail; }; template struct Templates44 { typedef TemplateSel Head; typedef Templates43 Tail; }; template struct Templates45 { typedef TemplateSel Head; typedef Templates44 Tail; }; template struct Templates46 { typedef TemplateSel Head; typedef Templates45 Tail; }; template struct Templates47 { typedef TemplateSel Head; typedef Templates46 Tail; }; template struct Templates48 { typedef TemplateSel Head; typedef Templates47 Tail; }; template struct Templates49 { typedef TemplateSel Head; typedef Templates48 Tail; }; template struct Templates50 { typedef TemplateSel Head; typedef Templates49 Tail; }; // We don't want to require the users to write TemplatesN<...> directly, // as that would require them to count the length. Templates<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Templates // will appear as Templates in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Templates, and Google Test will translate // that to TemplatesN internally to make error messages // readable. The translation is done by the 'type' member of the // Templates template. template struct Templates { typedef Templates50 type; }; template <> struct Templates { typedef Templates0 type; }; template struct Templates { typedef Templates1 type; }; template struct Templates { typedef Templates2 type; }; template struct Templates { typedef Templates3 type; }; template struct Templates { typedef Templates4 type; }; template struct Templates { typedef Templates5 type; }; template struct Templates { typedef Templates6 type; }; template struct Templates { typedef Templates7 type; }; template struct Templates { typedef Templates8 type; }; template struct Templates { typedef Templates9 type; }; template struct Templates { typedef Templates10 type; }; template struct Templates { typedef Templates11 type; }; template struct Templates { typedef Templates12 type; }; template struct Templates { typedef Templates13 type; }; template struct Templates { typedef Templates14 type; }; template struct Templates { typedef Templates15 type; }; template struct Templates { typedef Templates16 type; }; template struct Templates { typedef Templates17 type; }; template struct Templates { typedef Templates18 type; }; template struct Templates { typedef Templates19 type; }; template struct Templates { typedef Templates20 type; }; template struct Templates { typedef Templates21 type; }; template struct Templates { typedef Templates22 type; }; template struct Templates { typedef Templates23 type; }; template struct Templates { typedef Templates24 type; }; template struct Templates { typedef Templates25 type; }; template struct Templates { typedef Templates26 type; }; template struct Templates { typedef Templates27 type; }; template struct Templates { typedef Templates28 type; }; template struct Templates { typedef Templates29 type; }; template struct Templates { typedef Templates30 type; }; template struct Templates { typedef Templates31 type; }; template struct Templates { typedef Templates32 type; }; template struct Templates { typedef Templates33 type; }; template struct Templates { typedef Templates34 type; }; template struct Templates { typedef Templates35 type; }; template struct Templates { typedef Templates36 type; }; template struct Templates { typedef Templates37 type; }; template struct Templates { typedef Templates38 type; }; template struct Templates { typedef Templates39 type; }; template struct Templates { typedef Templates40 type; }; template struct Templates { typedef Templates41 type; }; template struct Templates { typedef Templates42 type; }; template struct Templates { typedef Templates43 type; }; template struct Templates { typedef Templates44 type; }; template struct Templates { typedef Templates45 type; }; template struct Templates { typedef Templates46 type; }; template struct Templates { typedef Templates47 type; }; template struct Templates { typedef Templates48 type; }; template struct Templates { typedef Templates49 type; }; // The TypeList template makes it possible to use either a single type // or a Types<...> list in TYPED_TEST_CASE() and // INSTANTIATE_TYPED_TEST_CASE_P(). template struct TypeList { typedef Types1 type; }; template struct TypeList > { typedef typename Types::type type; }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // Due to C++ preprocessor weirdness, we need double indirection to // concatenate two tokens when one of them is __LINE__. Writing // // foo ## __LINE__ // // will result in the token foo__LINE__, instead of foo followed by // the current line number. For more details, see // http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6 #define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar) #define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar // Google Test defines the testing::Message class to allow construction of // test messages via the << operator. The idea is that anything // streamable to std::ostream can be streamed to a testing::Message. // This allows a user to use his own types in Google Test assertions by // overloading the << operator. // // util/gtl/stl_logging-inl.h overloads << for STL containers. These // overloads cannot be defined in the std namespace, as that will be // undefined behavior. Therefore, they are defined in the global // namespace instead. // // C++'s symbol lookup rule (i.e. Koenig lookup) says that these // overloads are visible in either the std namespace or the global // namespace, but not other namespaces, including the testing // namespace which Google Test's Message class is in. // // To allow STL containers (and other types that has a << operator // defined in the global namespace) to be used in Google Test assertions, // testing::Message must access the custom << operator from the global // namespace. Hence this helper function. // // Note: Jeffrey Yasskin suggested an alternative fix by "using // ::operator<<;" in the definition of Message's operator<<. That fix // doesn't require a helper function, but unfortunately doesn't // compile with MSVC. template inline void GTestStreamToHelper(std::ostream* os, const T& val) { *os << val; } class ProtocolMessage; namespace proto2 { class Message; } namespace testing { // Forward declarations. class AssertionResult; // Result of an assertion. class Message; // Represents a failure message. class Test; // Represents a test. class TestInfo; // Information about a test. class TestPartResult; // Result of a test part. class UnitTest; // A collection of test cases. template ::std::string PrintToString(const T& value); namespace internal { struct TraceInfo; // Information about a trace point. class ScopedTrace; // Implements scoped trace. class TestInfoImpl; // Opaque implementation of TestInfo class UnitTestImpl; // Opaque implementation of UnitTest // How many times InitGoogleTest() has been called. extern int g_init_gtest_count; // The text used in failure messages to indicate the start of the // stack trace. GTEST_API_ extern const char kStackTraceMarker[]; // A secret type that Google Test users don't know about. It has no // definition on purpose. Therefore it's impossible to create a // Secret object, which is what we want. class Secret; // Two overloaded helpers for checking at compile time whether an // expression is a null pointer literal (i.e. NULL or any 0-valued // compile-time integral constant). Their return values have // different sizes, so we can use sizeof() to test which version is // picked by the compiler. These helpers have no implementations, as // we only need their signatures. // // Given IsNullLiteralHelper(x), the compiler will pick the first // version if x can be implicitly converted to Secret*, and pick the // second version otherwise. Since Secret is a secret and incomplete // type, the only expression a user can write that has type Secret* is // a null pointer literal. Therefore, we know that x is a null // pointer literal if and only if the first version is picked by the // compiler. char IsNullLiteralHelper(Secret* p); char (&IsNullLiteralHelper(...))[2]; // NOLINT // A compile-time bool constant that is true if and only if x is a // null pointer literal (i.e. NULL or any 0-valued compile-time // integral constant). #ifdef GTEST_ELLIPSIS_NEEDS_POD_ // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_IS_NULL_LITERAL_(x) false #else # define GTEST_IS_NULL_LITERAL_(x) \ (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1) #endif // GTEST_ELLIPSIS_NEEDS_POD_ // Appends the user-supplied message to the Google-Test-generated message. GTEST_API_ String AppendUserMessage(const String& gtest_msg, const Message& user_msg); // A helper class for creating scoped traces in user programs. class GTEST_API_ ScopedTrace { public: // The c'tor pushes the given source file location and message onto // a trace stack maintained by Google Test. ScopedTrace(const char* file, int line, const Message& message); // The d'tor pops the info pushed by the c'tor. // // Note that the d'tor is not virtual in order to be efficient. // Don't inherit from ScopedTrace! ~ScopedTrace(); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedTrace); } GTEST_ATTRIBUTE_UNUSED_; // A ScopedTrace object does its job in its // c'tor and d'tor. Therefore it doesn't // need to be used otherwise. // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); // The Symbian compiler has a bug that prevents it from selecting the // correct overload of FormatForComparisonFailureMessage (see below) // unless we pass the first argument by reference. If we do that, // however, Visual Age C++ 10.1 generates a compiler error. Therefore // we only apply the work-around for Symbian. #if defined(__SYMBIAN32__) # define GTEST_CREF_WORKAROUND_ const& #else # define GTEST_CREF_WORKAROUND_ #endif // When this operand is a const char* or char*, if the other operand // is a ::std::string or ::string, we print this operand as a C string // rather than a pointer (we do the same for wide strings); otherwise // we print it as a pointer to be safe. // This internal macro is used to avoid duplicated code. #define GTEST_FORMAT_IMPL_(operand2_type, operand1_printer)\ inline String FormatForComparisonFailureMessage(\ operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ }\ inline String FormatForComparisonFailureMessage(\ const operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ } GTEST_FORMAT_IMPL_(::std::string, String::ShowCStringQuoted) #if GTEST_HAS_STD_WSTRING GTEST_FORMAT_IMPL_(::std::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_STRING GTEST_FORMAT_IMPL_(::string, String::ShowCStringQuoted) #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING GTEST_FORMAT_IMPL_(::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_GLOBAL_WSTRING #undef GTEST_FORMAT_IMPL_ // The next four overloads handle the case where the operand being // printed is a char/wchar_t pointer and the other operand is not a // string/wstring object. In such cases, we just print the operand as // a pointer to be safe. #define GTEST_FORMAT_CHAR_PTR_IMPL_(CharType) \ template \ String FormatForComparisonFailureMessage(CharType* GTEST_CREF_WORKAROUND_ p, \ const T&) { \ return PrintToString(static_cast(p)); \ } GTEST_FORMAT_CHAR_PTR_IMPL_(char) GTEST_FORMAT_CHAR_PTR_IMPL_(const char) GTEST_FORMAT_CHAR_PTR_IMPL_(wchar_t) GTEST_FORMAT_CHAR_PTR_IMPL_(const wchar_t) #undef GTEST_FORMAT_CHAR_PTR_IMPL_ // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. GTEST_API_ AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case); // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. GTEST_API_ String GetBoolAssertionFailureMessage( const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value); // This template class represents an IEEE floating-point number // (either single-precision or double-precision, depending on the // template parameters). // // The purpose of this class is to do more sophisticated number // comparison. (Due to round-off error, etc, it's very unlikely that // two floating-points will be equal exactly. Hence a naive // comparison by the == operation often doesn't work.) // // Format of IEEE floating-point: // // The most-significant bit being the leftmost, an IEEE // floating-point looks like // // sign_bit exponent_bits fraction_bits // // Here, sign_bit is a single bit that designates the sign of the // number. // // For float, there are 8 exponent bits and 23 fraction bits. // // For double, there are 11 exponent bits and 52 fraction bits. // // More details can be found at // http://en.wikipedia.org/wiki/IEEE_floating-point_standard. // // Template parameter: // // RawType: the raw floating-point type (either float or double) template class FloatingPoint { public: // Defines the unsigned integer type that has the same size as the // floating point number. typedef typename TypeWithSize::UInt Bits; // Constants. // # of bits in a number. static const size_t kBitCount = 8*sizeof(RawType); // # of fraction bits in a number. static const size_t kFractionBitCount = std::numeric_limits::digits - 1; // # of exponent bits in a number. static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount; // The mask for the sign bit. static const Bits kSignBitMask = static_cast(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when // comparing two numbers. The larger the value, the more error we // allow. A 0 value means that two numbers must be exactly the same // to be considered equal. // // The maximum error of a single floating-point operation is 0.5 // units in the last place. On Intel CPU's, all floating-point // calculations are done with 80-bit precision, while double has 64 // bits. Therefore, 4 should be enough for ordinary use. // // See the following article for more details on ULP: // http://www.cygnus-software.com/papers/comparingfloats/comparingfloats.htm. static const size_t kMaxUlps = 4; // Constructs a FloatingPoint from a raw floating-point number. // // On an Intel CPU, passing a non-normalized NAN (Not a Number) // around may change its bits, although the new value is guaranteed // to be also a NAN. Therefore, don't expect this constructor to // preserve the bits in x when x is a NAN. explicit FloatingPoint(const RawType& x) { u_.value_ = x; } // Static methods // Reinterprets a bit pattern as a floating-point number. // // This function is needed to test the AlmostEquals() method. static RawType ReinterpretBits(const Bits bits) { FloatingPoint fp(0); fp.u_.bits_ = bits; return fp.u_.value_; } // Returns the floating-point number that represent positive infinity. static RawType Infinity() { return ReinterpretBits(kExponentBitMask); } // Non-static methods // Returns the bits that represents this number. const Bits &bits() const { return u_.bits_; } // Returns the exponent bits of this number. Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } // Returns the fraction bits of this number. Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } // Returns the sign bit of this number. Bits sign_bit() const { return kSignBitMask & u_.bits_; } // Returns true iff this is NAN (not a number). bool is_nan() const { // It's a NAN if the exponent bits are all ones and the fraction // bits are not entirely zeros. return (exponent_bits() == kExponentBitMask) && (fraction_bits() != 0); } // Returns true iff this number is at most kMaxUlps ULP's away from // rhs. In particular, this function: // // - returns false if either number is (or both are) NAN. // - treats really large numbers as almost equal to infinity. // - thinks +0.0 and -0.0 are 0 DLP's apart. bool AlmostEquals(const FloatingPoint& rhs) const { // The IEEE standard says that any comparison operation involving // a NAN must return false. if (is_nan() || rhs.is_nan()) return false; return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) <= kMaxUlps; } private: // The data type used to store the actual floating-point number. union FloatingPointUnion { RawType value_; // The raw floating-point number. Bits bits_; // The bits that represent the number. }; // Converts an integer from the sign-and-magnitude representation to // the biased representation. More precisely, let N be 2 to the // power of (kBitCount - 1), an integer x is represented by the // unsigned number x + N. // // For instance, // // -N + 1 (the most negative number representable using // sign-and-magnitude) is represented by 1; // 0 is represented by N; and // N - 1 (the biggest number representable using // sign-and-magnitude) is represented by 2N - 1. // // Read http://en.wikipedia.org/wiki/Signed_number_representations // for more details on signed number representations. static Bits SignAndMagnitudeToBiased(const Bits &sam) { if (kSignBitMask & sam) { // sam represents a negative number. return ~sam + 1; } else { // sam represents a positive number. return kSignBitMask | sam; } } // Given two numbers in the sign-and-magnitude representation, // returns the distance between them as an unsigned number. static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &sam1, const Bits &sam2) { const Bits biased1 = SignAndMagnitudeToBiased(sam1); const Bits biased2 = SignAndMagnitudeToBiased(sam2); return (biased1 >= biased2) ? (biased1 - biased2) : (biased2 - biased1); } FloatingPointUnion u_; }; // Typedefs the instances of the FloatingPoint template class that we // care to use. typedef FloatingPoint Float; typedef FloatingPoint Double; // In order to catch the mistake of putting tests that use different // test fixture classes in the same test case, we need to assign // unique IDs to fixture classes and compare them. The TypeId type is // used to hold such IDs. The user should treat TypeId as an opaque // type: the only operation allowed on TypeId values is to compare // them for equality using the == operator. typedef const void* TypeId; template class TypeIdHelper { public: // dummy_ must not have a const type. Otherwise an overly eager // compiler (e.g. MSVC 7.1 & 8.0) may try to merge // TypeIdHelper::dummy_ for different Ts as an "optimization". static bool dummy_; }; template bool TypeIdHelper::dummy_ = false; // GetTypeId() returns the ID of type T. Different values will be // returned for different types. Calling the function twice with the // same type argument is guaranteed to return the same ID. template TypeId GetTypeId() { // The compiler is required to allocate a different // TypeIdHelper::dummy_ variable for each T used to instantiate // the template. Therefore, the address of dummy_ is guaranteed to // be unique. return &(TypeIdHelper::dummy_); } // Returns the type ID of ::testing::Test. Always call this instead // of GetTypeId< ::testing::Test>() to get the type ID of // ::testing::Test, as the latter may give the wrong result due to a // suspected linker bug when compiling Google Test as a Mac OS X // framework. GTEST_API_ TypeId GetTestTypeId(); // Defines the abstract factory interface that creates instances // of a Test object. class TestFactoryBase { public: virtual ~TestFactoryBase() {} // Creates a test instance to run. The instance is both created and destroyed // within TestInfoImpl::Run() virtual Test* CreateTest() = 0; protected: TestFactoryBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase); }; // This class provides implementation of TeastFactoryBase interface. // It is used in TEST and TEST_F macros. template class TestFactoryImpl : public TestFactoryBase { public: virtual Test* CreateTest() { return new TestClass; } }; #if GTEST_OS_WINDOWS // Predicate-formatters for implementing the HRESULT checking macros // {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED} // We pass a long instead of HRESULT to avoid causing an // include dependency for the HRESULT type. GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr, long hr); // NOLINT GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr, long hr); // NOLINT #endif // GTEST_OS_WINDOWS // Types of SetUpTestCase() and TearDownTestCase() functions. typedef void (*SetUpTestCaseFunc)(); typedef void (*TearDownTestCaseFunc)(); // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param text representation of the test's value parameter, // or NULL if this is not a type-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. GTEST_API_ TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory); // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr); #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // State of the definition of a type-parameterized test case. class GTEST_API_ TypedTestCasePState { public: TypedTestCasePState() : registered_(false) {} // Adds the given test name to defined_test_names_ and return true // if the test case hasn't been registered; otherwise aborts the // program. bool AddTestName(const char* file, int line, const char* case_name, const char* test_name) { if (registered_) { fprintf(stderr, "%s Test %s must be defined before " "REGISTER_TYPED_TEST_CASE_P(%s, ...).\n", FormatFileLocation(file, line).c_str(), test_name, case_name); fflush(stderr); posix::Abort(); } defined_test_names_.insert(test_name); return true; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests); private: bool registered_; ::std::set defined_test_names_; }; // Skips to the first non-space char after the first comma in 'str'; // returns NULL if no comma is found in 'str'. inline const char* SkipComma(const char* str) { const char* comma = strchr(str, ','); if (comma == NULL) { return NULL; } while (IsSpace(*(++comma))) {} return comma; } // Returns the prefix of 'str' before the first comma in it; returns // the entire string if it contains no comma. inline String GetPrefixUntilComma(const char* str) { const char* comma = strchr(str, ','); return comma == NULL ? String(str) : String(str, comma - str); } // TypeParameterizedTest::Register() // registers a list of type-parameterized tests with Google Test. The // return value is insignificant - we just need to return something // such that we can call this function in a namespace scope. // // Implementation note: The GTEST_TEMPLATE_ macro declares a template // template parameter. It's defined in gtest-type-util.h. template class TypeParameterizedTest { public: // 'index' is the index of the test in the type list 'Types' // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase, // Types). Valid values for 'index' are [0, N - 1] where N is the // length of Types. static bool Register(const char* prefix, const char* case_name, const char* test_names, int index) { typedef typename Types::Head Type; typedef Fixture FixtureClass; typedef typename GTEST_BIND_(TestSel, Type) TestClass; // First, registers the first type-parameterized test in the type // list. MakeAndRegisterTestInfo( String::Format("%s%s%s/%d", prefix, prefix[0] == '\0' ? "" : "/", case_name, index).c_str(), GetPrefixUntilComma(test_names).c_str(), GetTypeName().c_str(), NULL, // No value parameter. GetTypeId(), TestClass::SetUpTestCase, TestClass::TearDownTestCase, new TestFactoryImpl); // Next, recurses (at compile time) with the tail of the type list. return TypeParameterizedTest ::Register(prefix, case_name, test_names, index + 1); } }; // The base case for the compile time recursion. template class TypeParameterizedTest { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/, int /*index*/) { return true; } }; // TypeParameterizedTestCase::Register() // registers *all combinations* of 'Tests' and 'Types' with Google // Test. The return value is insignificant - we just need to return // something such that we can call this function in a namespace scope. template class TypeParameterizedTestCase { public: static bool Register(const char* prefix, const char* case_name, const char* test_names) { typedef typename Tests::Head Head; // First, register the first test in 'Test' for each type in 'Types'. TypeParameterizedTest::Register( prefix, case_name, test_names, 0); // Next, recurses (at compile time) with the tail of the test list. return TypeParameterizedTestCase ::Register(prefix, case_name, SkipComma(test_names)); } }; // The base case for the compile time recursion. template class TypeParameterizedTestCase { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/) { return true; } }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. GTEST_API_ String GetCurrentOsStackTraceExceptTop(UnitTest* unit_test, int skip_count); // Helpers for suppressing warnings on unreachable code or constant // condition. // Always returns true. GTEST_API_ bool AlwaysTrue(); // Always returns false. inline bool AlwaysFalse() { return !AlwaysTrue(); } // Helper for suppressing false warning from Clang on a const char* // variable declared in a conditional expression always being NULL in // the else branch. struct GTEST_API_ ConstCharPtr { ConstCharPtr(const char* str) : value(str) {} operator bool() const { return true; } const char* value; }; // A simple Linear Congruential Generator for generating random // numbers with a uniform distribution. Unlike rand() and srand(), it // doesn't use global state (and therefore can't interfere with user // code). Unlike rand_r(), it's portable. An LCG isn't very random, // but it's good enough for our purposes. class GTEST_API_ Random { public: static const UInt32 kMaxRange = 1u << 31; explicit Random(UInt32 seed) : state_(seed) {} void Reseed(UInt32 seed) { state_ = seed; } // Generates a random number from [0, range). Crashes if 'range' is // 0 or greater than kMaxRange. UInt32 Generate(UInt32 range); private: UInt32 state_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Random); }; // Defining a variable of type CompileAssertTypesEqual will cause a // compiler error iff T1 and T2 are different types. template struct CompileAssertTypesEqual; template struct CompileAssertTypesEqual { }; // Removes the reference from a type if it is a reference type, // otherwise leaves it unchanged. This is the same as // tr1::remove_reference, which is not widely available yet. template struct RemoveReference { typedef T type; }; // NOLINT template struct RemoveReference { typedef T type; }; // NOLINT // A handy wrapper around RemoveReference that works when the argument // T depends on template parameters. #define GTEST_REMOVE_REFERENCE_(T) \ typename ::testing::internal::RemoveReference::type // Removes const from a type if it is a const type, otherwise leaves // it unchanged. This is the same as tr1::remove_const, which is not // widely available yet. template struct RemoveConst { typedef T type; }; // NOLINT template struct RemoveConst { typedef T type; }; // NOLINT // MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above // definition to fail to remove the const in 'const int[3]' and 'const // char[3][4]'. The following specialization works around the bug. // However, it causes trouble with GCC and thus needs to be // conditionally compiled. #if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__) template struct RemoveConst { typedef typename RemoveConst::type type[N]; }; #endif // A handy wrapper around RemoveConst that works when the argument // T depends on template parameters. #define GTEST_REMOVE_CONST_(T) \ typename ::testing::internal::RemoveConst::type // Turns const U&, U&, const U, and U all into U. #define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \ GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T)) // Adds reference to a type if it is not a reference type, // otherwise leaves it unchanged. This is the same as // tr1::add_reference, which is not widely available yet. template struct AddReference { typedef T& type; }; // NOLINT template struct AddReference { typedef T& type; }; // NOLINT // A handy wrapper around AddReference that works when the argument T // depends on template parameters. #define GTEST_ADD_REFERENCE_(T) \ typename ::testing::internal::AddReference::type // Adds a reference to const on top of T as necessary. For example, // it transforms // // char ==> const char& // const char ==> const char& // char& ==> const char& // const char& ==> const char& // // The argument T must depend on some template parameters. #define GTEST_REFERENCE_TO_CONST_(T) \ GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T)) // ImplicitlyConvertible::value is a compile-time bool // constant that's true iff type From can be implicitly converted to // type To. template class ImplicitlyConvertible { private: // We need the following helper functions only for their types. // They have no implementations. // MakeFrom() is an expression whose type is From. We cannot simply // use From(), as the type From may not have a public default // constructor. static From MakeFrom(); // These two functions are overloaded. Given an expression // Helper(x), the compiler will pick the first version if x can be // implicitly converted to type To; otherwise it will pick the // second version. // // The first version returns a value of size 1, and the second // version returns a value of size 2. Therefore, by checking the // size of Helper(x), which can be done at compile time, we can tell // which version of Helper() is used, and hence whether x can be // implicitly converted to type To. static char Helper(To); static char (&Helper(...))[2]; // NOLINT // We have to put the 'public' section after the 'private' section, // or MSVC refuses to compile the code. public: // MSVC warns about implicitly converting from double to int for // possible loss of data, so we need to temporarily disable the // warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4244) // Temporarily disables warning 4244. static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; # pragma warning(pop) // Restores the warning state. #elif defined(__BORLANDC__) // C++Builder cannot use member overload resolution during template // instantiation. The simplest workaround is to use its C++0x type traits // functions (C++Builder 2009 and above only). static const bool value = __is_convertible(From, To); #else static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; #endif // _MSV_VER }; template const bool ImplicitlyConvertible::value; // IsAProtocolMessage::value is a compile-time bool constant that's // true iff T is type ProtocolMessage, proto2::Message, or a subclass // of those. template struct IsAProtocolMessage : public bool_constant< ImplicitlyConvertible::value || ImplicitlyConvertible::value> { }; // When the compiler sees expression IsContainerTest(0), if C is an // STL-style container class, the first overload of IsContainerTest // will be viable (since both C::iterator* and C::const_iterator* are // valid types and NULL can be implicitly converted to them). It will // be picked over the second overload as 'int' is a perfect match for // the type of argument 0. If C::iterator or C::const_iterator is not // a valid type, the first overload is not viable, and the second // overload will be picked. Therefore, we can determine whether C is // a container class by checking the type of IsContainerTest(0). // The value of the expression is insignificant. // // Note that we look for both C::iterator and C::const_iterator. The // reason is that C++ injects the name of a class as a member of the // class itself (e.g. you can refer to class iterator as either // 'iterator' or 'iterator::iterator'). If we look for C::iterator // only, for example, we would mistakenly think that a class named // iterator is an STL container. // // Also note that the simpler approach of overloading // IsContainerTest(typename C::const_iterator*) and // IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++. typedef int IsContainer; template IsContainer IsContainerTest(int /* dummy */, typename C::iterator* /* it */ = NULL, typename C::const_iterator* /* const_it */ = NULL) { return 0; } typedef char IsNotContainer; template IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; } // EnableIf::type is void when 'Cond' is true, and // undefined when 'Cond' is false. To use SFINAE to make a function // overload only apply when a particular expression is true, add // "typename EnableIf::type* = 0" as the last parameter. template struct EnableIf; template<> struct EnableIf { typedef void type; }; // NOLINT // Utilities for native arrays. // ArrayEq() compares two k-dimensional native arrays using the // elements' operator==, where k can be any integer >= 0. When k is // 0, ArrayEq() degenerates into comparing a single pair of values. template bool ArrayEq(const T* lhs, size_t size, const U* rhs); // This generic version is used when k is 0. template inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } // This overload is used when k >= 1. template inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) { return internal::ArrayEq(lhs, N, rhs); } // This helper reduces code bloat. If we instead put its logic inside // the previous ArrayEq() function, arrays with different sizes would // lead to different copies of the template code. template bool ArrayEq(const T* lhs, size_t size, const U* rhs) { for (size_t i = 0; i != size; i++) { if (!internal::ArrayEq(lhs[i], rhs[i])) return false; } return true; } // Finds the first element in the iterator range [begin, end) that // equals elem. Element may be a native array type itself. template Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { for (Iter it = begin; it != end; ++it) { if (internal::ArrayEq(*it, elem)) return it; } return end; } // CopyArray() copies a k-dimensional native array using the elements' // operator=, where k can be any integer >= 0. When k is 0, // CopyArray() degenerates into copying a single value. template void CopyArray(const T* from, size_t size, U* to); // This generic version is used when k is 0. template inline void CopyArray(const T& from, U* to) { *to = from; } // This overload is used when k >= 1. template inline void CopyArray(const T(&from)[N], U(*to)[N]) { internal::CopyArray(from, N, *to); } // This helper reduces code bloat. If we instead put its logic inside // the previous CopyArray() function, arrays with different sizes // would lead to different copies of the template code. template void CopyArray(const T* from, size_t size, U* to) { for (size_t i = 0; i != size; i++) { internal::CopyArray(from[i], to + i); } } // The relation between an NativeArray object (see below) and the // native array it represents. enum RelationToSource { kReference, // The NativeArray references the native array. kCopy // The NativeArray makes a copy of the native array and // owns the copy. }; // Adapts a native array to a read-only STL-style container. Instead // of the complete STL container concept, this adaptor only implements // members useful for Google Mock's container matchers. New members // should be added as needed. To simplify the implementation, we only // support Element being a raw type (i.e. having no top-level const or // reference modifier). It's the client's responsibility to satisfy // this requirement. Element can be an array type itself (hence // multi-dimensional arrays are supported). template class NativeArray { public: // STL-style container typedefs. typedef Element value_type; typedef Element* iterator; typedef const Element* const_iterator; // Constructs from a native array. NativeArray(const Element* array, size_t count, RelationToSource relation) { Init(array, count, relation); } // Copy constructor. NativeArray(const NativeArray& rhs) { Init(rhs.array_, rhs.size_, rhs.relation_to_source_); } ~NativeArray() { // Ensures that the user doesn't instantiate NativeArray with a // const or reference type. static_cast(StaticAssertTypeEqHelper()); if (relation_to_source_ == kCopy) delete[] array_; } // STL-style container methods. size_t size() const { return size_; } const_iterator begin() const { return array_; } const_iterator end() const { return array_ + size_; } bool operator==(const NativeArray& rhs) const { return size() == rhs.size() && ArrayEq(begin(), size(), rhs.begin()); } private: // Initializes this object; makes a copy of the input array if // 'relation' is kCopy. void Init(const Element* array, size_t a_size, RelationToSource relation) { if (relation == kReference) { array_ = array; } else { Element* const copy = new Element[a_size]; CopyArray(array, a_size, copy); array_ = copy; } size_ = a_size; relation_to_source_ = relation; } const Element* array_; size_t size_; RelationToSource relation_to_source_; GTEST_DISALLOW_ASSIGN_(NativeArray); }; } // namespace internal } // namespace testing #define GTEST_MESSAGE_AT_(file, line, message, result_type) \ ::testing::internal::AssertHelper(result_type, file, line, message) \ = ::testing::Message() #define GTEST_MESSAGE_(message, result_type) \ GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type) #define GTEST_FATAL_FAILURE_(message) \ return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure) #define GTEST_NONFATAL_FAILURE_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure) #define GTEST_SUCCESS_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess) // Suppresses MSVC warnings 4072 (unreachable code) for the code following // statement if it returns or throws (or doesn't return or throw in some // situations). #define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \ if (::testing::internal::AlwaysTrue()) { statement; } #define GTEST_TEST_THROW_(statement, expected_exception, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::ConstCharPtr gtest_msg = "") { \ bool gtest_caught_expected = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (expected_exception const&) { \ gtest_caught_expected = true; \ } \ catch (...) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws a different type."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ if (!gtest_caught_expected) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws nothing."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \ fail(gtest_msg.value) #define GTEST_TEST_NO_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \ fail("Expected: " #statement " doesn't throw an exception.\n" \ " Actual: it throws.") #define GTEST_TEST_ANY_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ bool gtest_caught_any = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ gtest_caught_any = true; \ } \ if (!gtest_caught_any) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \ fail("Expected: " #statement " throws an exception.\n" \ " Actual: it doesn't.") // Implements Boolean test assertions such as EXPECT_TRUE. expression can be // either a boolean expression or an AssertionResult. text is a textual // represenation of expression as it was passed into the EXPECT_TRUE. #define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar_ = \ ::testing::AssertionResult(expression)) \ ; \ else \ fail(::testing::internal::GetBoolAssertionFailureMessage(\ gtest_ar_, text, #actual, #expected).c_str()) #define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \ fail("Expected: " #statement " doesn't generate new fatal " \ "failures in the current thread.\n" \ " Actual: it does.") // Expands to the name of the class that implements the given test. #define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ test_case_name##_##test_name##_Test // Helper macro for defining tests. #define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\ public:\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\ private:\ virtual void TestBody();\ static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\ };\ \ ::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\ ::test_info_ =\ ::testing::internal::MakeAndRegisterTestInfo(\ #test_case_name, #test_name, NULL, NULL, \ (parent_id), \ parent_class::SetUpTestCase, \ parent_class::TearDownTestCase, \ new ::testing::internal::TestFactoryImpl<\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for death tests. It is // #included by gtest.h so a user doesn't need to include this // directly. #ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file defines internal utilities needed for implementing // death tests. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #include namespace testing { namespace internal { GTEST_DECLARE_string_(internal_run_death_test); // Names of the flags (needed for parsing Google Test flags). const char kDeathTestStyleFlag[] = "death_test_style"; const char kDeathTestUseFork[] = "death_test_use_fork"; const char kInternalRunDeathTestFlag[] = "internal_run_death_test"; #if GTEST_HAS_DEATH_TEST // DeathTest is a class that hides much of the complexity of the // GTEST_DEATH_TEST_ macro. It is abstract; its static Create method // returns a concrete class that depends on the prevailing death test // style, as defined by the --gtest_death_test_style and/or // --gtest_internal_run_death_test flags. // In describing the results of death tests, these terms are used with // the corresponding definitions: // // exit status: The integer exit information in the format specified // by wait(2) // exit code: The integer code passed to exit(3), _exit(2), or // returned from main() class GTEST_API_ DeathTest { public: // Create returns false if there was an error determining the // appropriate action to take for the current death test; for example, // if the gtest_death_test_style flag is set to an invalid value. // The LastMessage method will return a more detailed message in that // case. Otherwise, the DeathTest pointer pointed to by the "test" // argument is set. If the death test should be skipped, the pointer // is set to NULL; otherwise, it is set to the address of a new concrete // DeathTest object that controls the execution of the current test. static bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); DeathTest(); virtual ~DeathTest() { } // A helper class that aborts a death test when it's deleted. class ReturnSentinel { public: explicit ReturnSentinel(DeathTest* test) : test_(test) { } ~ReturnSentinel() { test_->Abort(TEST_ENCOUNTERED_RETURN_STATEMENT); } private: DeathTest* const test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ReturnSentinel); } GTEST_ATTRIBUTE_UNUSED_; // An enumeration of possible roles that may be taken when a death // test is encountered. EXECUTE means that the death test logic should // be executed immediately. OVERSEE means that the program should prepare // the appropriate environment for a child process to execute the death // test, then wait for it to complete. enum TestRole { OVERSEE_TEST, EXECUTE_TEST }; // An enumeration of the three reasons that a test might be aborted. enum AbortReason { TEST_ENCOUNTERED_RETURN_STATEMENT, TEST_THREW_EXCEPTION, TEST_DID_NOT_DIE }; // Assumes one of the above roles. virtual TestRole AssumeRole() = 0; // Waits for the death test to finish and returns its status. virtual int Wait() = 0; // Returns true if the death test passed; that is, the test process // exited during the test, its exit status matches a user-supplied // predicate, and its stderr output matches a user-supplied regular // expression. // The user-supplied predicate may be a macro expression rather // than a function pointer or functor, or else Wait and Passed could // be combined. virtual bool Passed(bool exit_status_ok) = 0; // Signals that the death test did not die as expected. virtual void Abort(AbortReason reason) = 0; // Returns a human-readable outcome message regarding the outcome of // the last death test. static const char* LastMessage(); static void set_last_death_test_message(const String& message); private: // A string containing a description of the outcome of the last death test. static String last_death_test_message_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest); }; // Factory interface for death tests. May be mocked out for testing. class DeathTestFactory { public: virtual ~DeathTestFactory() { } virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) = 0; }; // A concrete DeathTestFactory implementation for normal use. class DefaultDeathTestFactory : public DeathTestFactory { public: virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); }; // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. GTEST_API_ bool ExitedUnsuccessfully(int exit_status); // Traps C++ exceptions escaping statement and reports them as test // failures. Note that trapping SEH exceptions is not implemented here. # if GTEST_HAS_EXCEPTIONS # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } catch (const ::std::exception& gtest_exception) { \ fprintf(\ stderr, \ "\n%s: Caught std::exception-derived exception escaping the " \ "death test statement. Exception message: %s\n", \ ::testing::internal::FormatFileLocation(__FILE__, __LINE__).c_str(), \ gtest_exception.what()); \ fflush(stderr); \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } catch (...) { \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } # else # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) # endif // This macro is for implementing ASSERT_DEATH*, EXPECT_DEATH*, // ASSERT_EXIT*, and EXPECT_EXIT*. # define GTEST_DEATH_TEST_(statement, predicate, regex, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ const ::testing::internal::RE& gtest_regex = (regex); \ ::testing::internal::DeathTest* gtest_dt; \ if (!::testing::internal::DeathTest::Create(#statement, >est_regex, \ __FILE__, __LINE__, >est_dt)) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ if (gtest_dt != NULL) { \ ::testing::internal::scoped_ptr< ::testing::internal::DeathTest> \ gtest_dt_ptr(gtest_dt); \ switch (gtest_dt->AssumeRole()) { \ case ::testing::internal::DeathTest::OVERSEE_TEST: \ if (!gtest_dt->Passed(predicate(gtest_dt->Wait()))) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ break; \ case ::testing::internal::DeathTest::EXECUTE_TEST: { \ ::testing::internal::DeathTest::ReturnSentinel \ gtest_sentinel(gtest_dt); \ GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, gtest_dt); \ gtest_dt->Abort(::testing::internal::DeathTest::TEST_DID_NOT_DIE); \ break; \ } \ default: \ break; \ } \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__): \ fail(::testing::internal::DeathTest::LastMessage()) // The symbol "fail" here expands to something into which a message // can be streamed. // A class representing the parsed contents of the // --gtest_internal_run_death_test flag, as it existed when // RUN_ALL_TESTS was called. class InternalRunDeathTestFlag { public: InternalRunDeathTestFlag(const String& a_file, int a_line, int an_index, int a_write_fd) : file_(a_file), line_(a_line), index_(an_index), write_fd_(a_write_fd) {} ~InternalRunDeathTestFlag() { if (write_fd_ >= 0) posix::Close(write_fd_); } String file() const { return file_; } int line() const { return line_; } int index() const { return index_; } int write_fd() const { return write_fd_; } private: String file_; int line_; int index_; int write_fd_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InternalRunDeathTestFlag); }; // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag(); #else // GTEST_HAS_DEATH_TEST // This macro is used for implementing macros such as // EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED on systems where // death tests are not supported. Those macros must compile on such systems // iff EXPECT_DEATH and ASSERT_DEATH compile with the same parameters on // systems that support death tests. This allows one to write such a macro // on a system that does not support death tests and be sure that it will // compile on a death-test supporting system. // // Parameters: // statement - A statement that a macro such as EXPECT_DEATH would test // for program termination. This macro has to make sure this // statement is compiled but not executed, to ensure that // EXPECT_DEATH_IF_SUPPORTED compiles with a certain // parameter iff EXPECT_DEATH compiles with it. // regex - A regex that a macro such as EXPECT_DEATH would use to test // the output of statement. This parameter has to be // compiled but not evaluated by this macro, to ensure that // this macro only accepts expressions that a macro such as // EXPECT_DEATH would accept. // terminator - Must be an empty statement for EXPECT_DEATH_IF_SUPPORTED // and a return statement for ASSERT_DEATH_IF_SUPPORTED. // This ensures that ASSERT_DEATH_IF_SUPPORTED will not // compile inside functions where ASSERT_DEATH doesn't // compile. // // The branch that has an always false condition is used to ensure that // statement and regex are compiled (and thus syntactically correct) but // never executed. The unreachable code macro protects the terminator // statement from generating an 'unreachable code' warning in case // statement unconditionally returns or throws. The Message constructor at // the end allows the syntax of streaming additional messages into the // macro, for compilational compatibility with EXPECT_DEATH/ASSERT_DEATH. # define GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, terminator) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ GTEST_LOG_(WARNING) \ << "Death tests are not supported on this platform.\n" \ << "Statement '" #statement "' cannot be verified."; \ } else if (::testing::internal::AlwaysFalse()) { \ ::testing::internal::RE::PartialMatch(".*", (regex)); \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ terminator; \ } else \ ::testing::Message() #endif // GTEST_HAS_DEATH_TEST } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ namespace testing { // This flag controls the style of death tests. Valid values are "threadsafe", // meaning that the death test child process will re-execute the test binary // from the start, running only a single death test, or "fast", // meaning that the child process will execute the test logic immediately // after forking. GTEST_DECLARE_string_(death_test_style); #if GTEST_HAS_DEATH_TEST // The following macros are useful for writing death tests. // Here's what happens when an ASSERT_DEATH* or EXPECT_DEATH* is // executed: // // 1. It generates a warning if there is more than one active // thread. This is because it's safe to fork() or clone() only // when there is a single thread. // // 2. The parent process clone()s a sub-process and runs the death // test in it; the sub-process exits with code 0 at the end of the // death test, if it hasn't exited already. // // 3. The parent process waits for the sub-process to terminate. // // 4. The parent process checks the exit code and error message of // the sub-process. // // Examples: // // ASSERT_DEATH(server.SendMessage(56, "Hello"), "Invalid port number"); // for (int i = 0; i < 5; i++) { // EXPECT_DEATH(server.ProcessRequest(i), // "Invalid request .* in ProcessRequest()") // << "Failed to die on request " << i); // } // // ASSERT_EXIT(server.ExitNow(), ::testing::ExitedWithCode(0), "Exiting"); // // bool KilledBySIGHUP(int exit_code) { // return WIFSIGNALED(exit_code) && WTERMSIG(exit_code) == SIGHUP; // } // // ASSERT_EXIT(client.HangUpServer(), KilledBySIGHUP, "Hanging up!"); // // On the regular expressions used in death tests: // // On POSIX-compliant systems (*nix), we use the library, // which uses the POSIX extended regex syntax. // // On other platforms (e.g. Windows), we only support a simple regex // syntax implemented as part of Google Test. This limited // implementation should be enough most of the time when writing // death tests; though it lacks many features you can find in PCRE // or POSIX extended regex syntax. For example, we don't support // union ("x|y"), grouping ("(xy)"), brackets ("[xy]"), and // repetition count ("x{5,7}"), among others. // // Below is the syntax that we do support. We chose it to be a // subset of both PCRE and POSIX extended regex, so it's easy to // learn wherever you come from. In the following: 'A' denotes a // literal character, period (.), or a single \\ escape sequence; // 'x' and 'y' denote regular expressions; 'm' and 'n' are for // natural numbers. // // c matches any literal character c // \\d matches any decimal digit // \\D matches any character that's not a decimal digit // \\f matches \f // \\n matches \n // \\r matches \r // \\s matches any ASCII whitespace, including \n // \\S matches any character that's not a whitespace // \\t matches \t // \\v matches \v // \\w matches any letter, _, or decimal digit // \\W matches any character that \\w doesn't match // \\c matches any literal character c, which must be a punctuation // . matches any single character except \n // A? matches 0 or 1 occurrences of A // A* matches 0 or many occurrences of A // A+ matches 1 or many occurrences of A // ^ matches the beginning of a string (not that of each line) // $ matches the end of a string (not that of each line) // xy matches x followed by y // // If you accidentally use PCRE or POSIX extended regex features // not implemented by us, you will get a run-time failure. In that // case, please try to rewrite your regular expression within the // above syntax. // // This implementation is *not* meant to be as highly tuned or robust // as a compiled regex library, but should perform well enough for a // death test, which already incurs significant overhead by launching // a child process. // // Known caveats: // // A "threadsafe" style death test obtains the path to the test // program from argv[0] and re-executes it in the sub-process. For // simplicity, the current implementation doesn't search the PATH // when launching the sub-process. This means that the user must // invoke the test program via a path that contains at least one // path separator (e.g. path/to/foo_test and // /absolute/path/to/bar_test are fine, but foo_test is not). This // is rarely a problem as people usually don't put the test binary // directory in PATH. // // TODO(wan@google.com): make thread-safe death tests search the PATH. // Asserts that a given statement causes the program to exit, with an // integer exit status that satisfies predicate, and emitting error output // that matches regex. # define ASSERT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_FATAL_FAILURE_) // Like ASSERT_EXIT, but continues on to successive tests in the // test case, if any: # define EXPECT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_NONFATAL_FAILURE_) // Asserts that a given statement causes the program to exit, either by // explicitly exiting with a nonzero exit code or being killed by a // signal, and emitting error output that matches regex. # define ASSERT_DEATH(statement, regex) \ ASSERT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Like ASSERT_DEATH, but continues on to successive tests in the // test case, if any: # define EXPECT_DEATH(statement, regex) \ EXPECT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Two predicate classes that can be used in {ASSERT,EXPECT}_EXIT*: // Tests that an exit code describes a normal exit with a given exit code. class GTEST_API_ ExitedWithCode { public: explicit ExitedWithCode(int exit_code); bool operator()(int exit_status) const; private: // No implementation - assignment is unsupported. void operator=(const ExitedWithCode& other); const int exit_code_; }; # if !GTEST_OS_WINDOWS // Tests that an exit code describes an exit due to termination by a // given signal. class GTEST_API_ KilledBySignal { public: explicit KilledBySignal(int signum); bool operator()(int exit_status) const; private: const int signum_; }; # endif // !GTEST_OS_WINDOWS // EXPECT_DEBUG_DEATH asserts that the given statements die in debug mode. // The death testing framework causes this to have interesting semantics, // since the sideeffects of the call are only visible in opt mode, and not // in debug mode. // // In practice, this can be used to test functions that utilize the // LOG(DFATAL) macro using the following style: // // int DieInDebugOr12(int* sideeffect) { // if (sideeffect) { // *sideeffect = 12; // } // LOG(DFATAL) << "death"; // return 12; // } // // TEST(TestCase, TestDieOr12WorksInDgbAndOpt) { // int sideeffect = 0; // // Only asserts in dbg. // EXPECT_DEBUG_DEATH(DieInDebugOr12(&sideeffect), "death"); // // #ifdef NDEBUG // // opt-mode has sideeffect visible. // EXPECT_EQ(12, sideeffect); // #else // // dbg-mode no visible sideeffect. // EXPECT_EQ(0, sideeffect); // #endif // } // // This will assert that DieInDebugReturn12InOpt() crashes in debug // mode, usually due to a DCHECK or LOG(DFATAL), but returns the // appropriate fallback value (12 in this case) in opt mode. If you // need to test that a function has appropriate side-effects in opt // mode, include assertions against the side-effects. A general // pattern for this is: // // EXPECT_DEBUG_DEATH({ // // Side-effects here will have an effect after this statement in // // opt mode, but none in debug mode. // EXPECT_EQ(12, DieInDebugOr12(&sideeffect)); // }, "death"); // # ifdef NDEBUG # define EXPECT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # define ASSERT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # else # define EXPECT_DEBUG_DEATH(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEBUG_DEATH(statement, regex) \ ASSERT_DEATH(statement, regex) # endif // NDEBUG for EXPECT_DEBUG_DEATH #endif // GTEST_HAS_DEATH_TEST // EXPECT_DEATH_IF_SUPPORTED(statement, regex) and // ASSERT_DEATH_IF_SUPPORTED(statement, regex) expand to real death tests if // death tests are supported; otherwise they just issue a warning. This is // useful when you are combining death test assertions with normal test // assertions in one test. #if GTEST_HAS_DEATH_TEST # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ ASSERT_DEATH(statement, regex) #else # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, ) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, return) #endif } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the Message class. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! #ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #include namespace testing { // The Message class works like an ostream repeater. // // Typical usage: // // 1. You stream a bunch of values to a Message object. // It will remember the text in a stringstream. // 2. Then you stream the Message object to an ostream. // This causes the text in the Message to be streamed // to the ostream. // // For example; // // testing::Message foo; // foo << 1 << " != " << 2; // std::cout << foo; // // will print "1 != 2". // // Message is not intended to be inherited from. In particular, its // destructor is not virtual. // // Note that stringstream behaves differently in gcc and in MSVC. You // can stream a NULL char pointer to it in the former, but not in the // latter (it causes an access violation if you do). The Message // class hides this difference by treating a NULL char pointer as // "(null)". class GTEST_API_ Message { private: // The type of basic IO manipulators (endl, ends, and flush) for // narrow streams. typedef std::ostream& (*BasicNarrowIoManip)(std::ostream&); public: // Constructs an empty Message. // We allocate the stringstream separately because otherwise each use of // ASSERT/EXPECT in a procedure adds over 200 bytes to the procedure's // stack frame leading to huge stack frames in some cases; gcc does not reuse // the stack space. Message() : ss_(new ::std::stringstream) { // By default, we want there to be enough precision when printing // a double to a Message. *ss_ << std::setprecision(std::numeric_limits::digits10 + 2); } // Copy constructor. Message(const Message& msg) : ss_(new ::std::stringstream) { // NOLINT *ss_ << msg.GetString(); } // Constructs a Message from a C-string. explicit Message(const char* str) : ss_(new ::std::stringstream) { *ss_ << str; } #if GTEST_OS_SYMBIAN // Streams a value (either a pointer or not) to this object. template inline Message& operator <<(const T& value) { StreamHelper(typename internal::is_pointer::type(), value); return *this; } #else // Streams a non-pointer value to this object. template inline Message& operator <<(const T& val) { ::GTestStreamToHelper(ss_.get(), val); return *this; } // Streams a pointer value to this object. // // This function is an overload of the previous one. When you // stream a pointer to a Message, this definition will be used as it // is more specialized. (The C++ Standard, section // [temp.func.order].) If you stream a non-pointer, then the // previous definition will be used. // // The reason for this overload is that streaming a NULL pointer to // ostream is undefined behavior. Depending on the compiler, you // may get "0", "(nil)", "(null)", or an access violation. To // ensure consistent result across compilers, we always treat NULL // as "(null)". template inline Message& operator <<(T* const& pointer) { // NOLINT if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } return *this; } #endif // GTEST_OS_SYMBIAN // Since the basic IO manipulators are overloaded for both narrow // and wide streams, we have to provide this specialized definition // of operator <<, even though its body is the same as the // templatized version above. Without this definition, streaming // endl or other basic IO manipulators to Message will confuse the // compiler. Message& operator <<(BasicNarrowIoManip val) { *ss_ << val; return *this; } // Instead of 1/0, we want to see true/false for bool values. Message& operator <<(bool b) { return *this << (b ? "true" : "false"); } // These two overloads allow streaming a wide C string to a Message // using the UTF-8 encoding. Message& operator <<(const wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } Message& operator <<(wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::std::wstring& wstr); #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::wstring& wstr); #endif // GTEST_HAS_GLOBAL_WSTRING // Gets the text streamed to this object so far as a String. // Each '\0' character in the buffer is replaced with "\\0". // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::String GetString() const { return internal::StringStreamToString(ss_.get()); } private: #if GTEST_OS_SYMBIAN // These are needed as the Nokia Symbian Compiler cannot decide between // const T& and const T* in a function template. The Nokia compiler _can_ // decide between class template specializations for T and T*, so a // tr1::type_traits-like is_pointer works, and we can overload on that. template inline void StreamHelper(internal::true_type /*dummy*/, T* pointer) { if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } } template inline void StreamHelper(internal::false_type /*dummy*/, const T& value) { ::GTestStreamToHelper(ss_.get(), value); } #endif // GTEST_OS_SYMBIAN // We'll hold the text streamed to this object here. const internal::scoped_ptr< ::std::stringstream> ss_; // We declare (but don't implement) this to prevent the compiler // from implementing the assignment operator. void operator=(const Message&); }; // Streams a Message to an ostream. inline std::ostream& operator <<(std::ostream& os, const Message& sb) { return os << sb.GetString(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ // This file was GENERATED by command: // pump.py gtest-param-test.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev) // // Macros and functions for implementing parameterized tests // in Google C++ Testing Framework (Google Test) // // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // #ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Value-parameterized tests allow you to test your code with different // parameters without writing multiple copies of the same test. // // Here is how you use value-parameterized tests: #if 0 // To write value-parameterized tests, first you should define a fixture // class. It is usually derived from testing::TestWithParam (see below for // another inheritance scheme that's sometimes useful in more complicated // class hierarchies), where the type of your parameter values. // TestWithParam is itself derived from testing::Test. T can be any // copyable type. If it's a raw pointer, you are responsible for managing the // lifespan of the pointed values. class FooTest : public ::testing::TestWithParam { // You can implement all the usual class fixture members here. }; // Then, use the TEST_P macro to define as many parameterized tests // for this fixture as you want. The _P suffix is for "parameterized" // or "pattern", whichever you prefer to think. TEST_P(FooTest, DoesBlah) { // Inside a test, access the test parameter with the GetParam() method // of the TestWithParam class: EXPECT_TRUE(foo.Blah(GetParam())); ... } TEST_P(FooTest, HasBlahBlah) { ... } // Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test // case with any set of parameters you want. Google Test defines a number // of functions for generating test parameters. They return what we call // (surprise!) parameter generators. Here is a summary of them, which // are all in the testing namespace: // // // Range(begin, end [, step]) - Yields values {begin, begin+step, // begin+step+step, ...}. The values do not // include end. step defaults to 1. // Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. // ValuesIn(container) - Yields values from a C-style array, an STL // ValuesIn(begin,end) container, or an iterator range [begin, end). // Bool() - Yields sequence {false, true}. // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product // for the math savvy) of the values generated // by the N generators. // // For more details, see comments at the definitions of these functions below // in this file. // // The following statement will instantiate tests from the FooTest test case // each with parameter values "meeny", "miny", and "moe". INSTANTIATE_TEST_CASE_P(InstantiationName, FooTest, Values("meeny", "miny", "moe")); // To distinguish different instances of the pattern, (yes, you // can instantiate it more then once) the first argument to the // INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the // actual test case name. Remember to pick unique prefixes for different // instantiations. The tests from the instantiation above will have // these names: // // * InstantiationName/FooTest.DoesBlah/0 for "meeny" // * InstantiationName/FooTest.DoesBlah/1 for "miny" // * InstantiationName/FooTest.DoesBlah/2 for "moe" // * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" // * InstantiationName/FooTest.HasBlahBlah/1 for "miny" // * InstantiationName/FooTest.HasBlahBlah/2 for "moe" // // You can use these names in --gtest_filter. // // This statement will instantiate all tests from FooTest again, each // with parameter values "cat" and "dog": const char* pets[] = {"cat", "dog"}; INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); // The tests from the instantiation above will have these names: // // * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" // * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" // * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" // * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" // // Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests // in the given test case, whether their definitions come before or // AFTER the INSTANTIATE_TEST_CASE_P statement. // // Please also note that generator expressions (including parameters to the // generators) are evaluated in InitGoogleTest(), after main() has started. // This allows the user on one hand, to adjust generator parameters in order // to dynamically determine a set of tests to run and on the other hand, // give the user a chance to inspect the generated tests with Google Test // reflection API before RUN_ALL_TESTS() is executed. // // You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc // for more examples. // // In the future, we plan to publish the API for defining new parameter // generators. But for now this interface remains part of the internal // implementation and is subject to change. // // // A parameterized test fixture must be derived from testing::Test and from // testing::WithParamInterface, where T is the type of the parameter // values. Inheriting from TestWithParam satisfies that requirement because // TestWithParam inherits from both Test and WithParamInterface. In more // complicated hierarchies, however, it is occasionally useful to inherit // separately from Test and WithParamInterface. For example: class BaseTest : public ::testing::Test { // You can inherit all the usual members for a non-parameterized test // fixture here. }; class DerivedTest : public BaseTest, public ::testing::WithParamInterface { // The usual test fixture members go here too. }; TEST_F(BaseTest, HasFoo) { // This is an ordinary non-parameterized test. } TEST_P(DerivedTest, DoesBlah) { // GetParam works just the same here as if you inherit from TestWithParam. EXPECT_TRUE(foo.Blah(GetParam())); } #endif // 0 #if !GTEST_OS_SYMBIAN # include #endif // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #include #include #include // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2003 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: Dan Egnor (egnor@google.com) // // A "smart" pointer type with reference tracking. Every pointer to a // particular object is kept on a circular linked list. When the last pointer // to an object is destroyed or reassigned, the object is deleted. // // Used properly, this deletes the object when the last reference goes away. // There are several caveats: // - Like all reference counting schemes, cycles lead to leaks. // - Each smart pointer is actually two pointers (8 bytes instead of 4). // - Every time a pointer is assigned, the entire list of pointers to that // object is traversed. This class is therefore NOT SUITABLE when there // will often be more than two or three pointers to a particular object. // - References are only tracked as long as linked_ptr<> objects are copied. // If a linked_ptr<> is converted to a raw pointer and back, BAD THINGS // will happen (double deletion). // // A good use of this class is storing object references in STL containers. // You can safely put linked_ptr<> in a vector<>. // Other uses may not be as good. // // Note: If you use an incomplete type with linked_ptr<>, the class // *containing* linked_ptr<> must have a constructor and destructor (even // if they do nothing!). // // Bill Gibbons suggested we use something like this. // // Thread Safety: // Unlike other linked_ptr implementations, in this implementation // a linked_ptr object is thread-safe in the sense that: // - it's safe to copy linked_ptr objects concurrently, // - it's safe to copy *from* a linked_ptr and read its underlying // raw pointer (e.g. via get()) concurrently, and // - it's safe to write to two linked_ptrs that point to the same // shared object concurrently. // TODO(wan@google.com): rename this to safe_linked_ptr to avoid // confusion with normal linked_ptr. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #include #include namespace testing { namespace internal { // Protects copying of all linked_ptr objects. GTEST_API_ GTEST_DECLARE_STATIC_MUTEX_(g_linked_ptr_mutex); // This is used internally by all instances of linked_ptr<>. It needs to be // a non-template class because different types of linked_ptr<> can refer to // the same object (linked_ptr(obj) vs linked_ptr(obj)). // So, it needs to be possible for different types of linked_ptr to participate // in the same circular linked list, so we need a single class type here. // // DO NOT USE THIS CLASS DIRECTLY YOURSELF. Use linked_ptr. class linked_ptr_internal { public: // Create a new circle that includes only this instance. void join_new() { next_ = this; } // Many linked_ptr operations may change p.link_ for some linked_ptr // variable p in the same circle as this object. Therefore we need // to prevent two such operations from occurring concurrently. // // Note that different types of linked_ptr objects can coexist in a // circle (e.g. linked_ptr, linked_ptr, and // linked_ptr). Therefore we must use a single mutex to // protect all linked_ptr objects. This can create serious // contention in production code, but is acceptable in a testing // framework. // Join an existing circle. // L < g_linked_ptr_mutex void join(linked_ptr_internal const* ptr) { MutexLock lock(&g_linked_ptr_mutex); linked_ptr_internal const* p = ptr; while (p->next_ != ptr) p = p->next_; p->next_ = this; next_ = ptr; } // Leave whatever circle we're part of. Returns true if we were the // last member of the circle. Once this is done, you can join() another. // L < g_linked_ptr_mutex bool depart() { MutexLock lock(&g_linked_ptr_mutex); if (next_ == this) return true; linked_ptr_internal const* p = next_; while (p->next_ != this) p = p->next_; p->next_ = next_; return false; } private: mutable linked_ptr_internal const* next_; }; template class linked_ptr { public: typedef T element_type; // Take over ownership of a raw pointer. This should happen as soon as // possible after the object is created. explicit linked_ptr(T* ptr = NULL) { capture(ptr); } ~linked_ptr() { depart(); } // Copy an existing linked_ptr<>, adding ourselves to the list of references. template linked_ptr(linked_ptr const& ptr) { copy(&ptr); } linked_ptr(linked_ptr const& ptr) { // NOLINT assert(&ptr != this); copy(&ptr); } // Assignment releases the old value and acquires the new. template linked_ptr& operator=(linked_ptr const& ptr) { depart(); copy(&ptr); return *this; } linked_ptr& operator=(linked_ptr const& ptr) { if (&ptr != this) { depart(); copy(&ptr); } return *this; } // Smart pointer members. void reset(T* ptr = NULL) { depart(); capture(ptr); } T* get() const { return value_; } T* operator->() const { return value_; } T& operator*() const { return *value_; } bool operator==(T* p) const { return value_ == p; } bool operator!=(T* p) const { return value_ != p; } template bool operator==(linked_ptr const& ptr) const { return value_ == ptr.get(); } template bool operator!=(linked_ptr const& ptr) const { return value_ != ptr.get(); } private: template friend class linked_ptr; T* value_; linked_ptr_internal link_; void depart() { if (link_.depart()) delete value_; } void capture(T* ptr) { value_ = ptr; link_.join_new(); } template void copy(linked_ptr const* ptr) { value_ = ptr->get(); if (value_) link_.join(&ptr->link_); else link_.join_new(); } }; template inline bool operator==(T* ptr, const linked_ptr& x) { return ptr == x.get(); } template inline bool operator!=(T* ptr, const linked_ptr& x) { return ptr != x.get(); } // A function to convert T* into linked_ptr // Doing e.g. make_linked_ptr(new FooBarBaz(arg)) is a shorter notation // for linked_ptr >(new FooBarBaz(arg)) template linked_ptr make_linked_ptr(T* ptr) { return linked_ptr(ptr); } } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // A user can teach this function how to print a class type T by // defining either operator<<() or PrintTo() in the namespace that // defines T. More specifically, the FIRST defined function in the // following list will be used (assuming T is defined in namespace // foo): // // 1. foo::PrintTo(const T&, ostream*) // 2. operator<<(ostream&, const T&) defined in either foo or the // global namespace. // // If none of the above is defined, it will print the debug string of // the value if it is a protocol buffer, or print the raw bytes in the // value otherwise. // // To aid debugging: when T is a reference type, the address of the // value is also printed; when T is a (const) char pointer, both the // pointer value and the NUL-terminated string it points to are // printed. // // We also provide some convenient wrappers: // // // Prints a value to a string. For a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // std::string ::testing::PrintToString(const T& value); // // // Prints a value tersely: for a reference type, the referenced // // value (but not the address) is printed; for a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // void ::testing::internal::UniversalTersePrint(const T& value, ostream*); // // // Prints value using the type inferred by the compiler. The difference // // from UniversalTersePrint() is that this function prints both the // // pointer and the NUL-terminated string for a (const or not) char pointer. // void ::testing::internal::UniversalPrint(const T& value, ostream*); // // // Prints the fields of a tuple tersely to a string vector, one // // element for each field. Tuple support must be enabled in // // gtest-port.h. // std::vector UniversalTersePrintTupleFieldsToStrings( // const Tuple& value); // // Known limitation: // // The print primitives print the elements of an STL-style container // using the compiler-inferred type of *iter where iter is a // const_iterator of the container. When const_iterator is an input // iterator but not a forward iterator, this inferred type may not // match value_type, and the print output may be incorrect. In // practice, this is rarely a problem as for most containers // const_iterator is a forward iterator. We'll fix this if there's an // actual need for it. Note that this fix cannot rely on value_type // being defined as many user-defined container types don't have // value_type. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #include // NOLINT #include #include #include #include namespace testing { // Definitions in the 'internal' and 'internal2' name spaces are // subject to change without notice. DO NOT USE THEM IN USER CODE! namespace internal2 { // Prints the given number of bytes in the given object to the given // ostream. GTEST_API_ void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ::std::ostream* os); // For selecting which printer to use when a given type has neither << // nor PrintTo(). enum TypeKind { kProtobuf, // a protobuf type kConvertibleToInteger, // a type implicitly convertible to BiggestInt // (e.g. a named or unnamed enum type) kOtherType // anything else }; // TypeWithoutFormatter::PrintValue(value, os) is called // by the universal printer to print a value of type T when neither // operator<< nor PrintTo() is defined for T, where kTypeKind is the // "kind" of T as defined by enum TypeKind. template class TypeWithoutFormatter { public: // This default version is called when kTypeKind is kOtherType. static void PrintValue(const T& value, ::std::ostream* os) { PrintBytesInObjectTo(reinterpret_cast(&value), sizeof(value), os); } }; // We print a protobuf using its ShortDebugString() when the string // doesn't exceed this many characters; otherwise we print it using // DebugString() for better readability. const size_t kProtobufOneLinerMaxLength = 50; template class TypeWithoutFormatter { public: static void PrintValue(const T& value, ::std::ostream* os) { const ::testing::internal::string short_str = value.ShortDebugString(); const ::testing::internal::string pretty_str = short_str.length() <= kProtobufOneLinerMaxLength ? short_str : ("\n" + value.DebugString()); *os << ("<" + pretty_str + ">"); } }; template class TypeWithoutFormatter { public: // Since T has no << operator or PrintTo() but can be implicitly // converted to BiggestInt, we print it as a BiggestInt. // // Most likely T is an enum type (either named or unnamed), in which // case printing it as an integer is the desired behavior. In case // T is not an enum, printing it as an integer is the best we can do // given that it has no user-defined printer. static void PrintValue(const T& value, ::std::ostream* os) { const internal::BiggestInt kBigInt = value; *os << kBigInt; } }; // Prints the given value to the given ostream. If the value is a // protocol message, its debug string is printed; if it's an enum or // of a type implicitly convertible to BiggestInt, it's printed as an // integer; otherwise the bytes in the value are printed. This is // what UniversalPrinter::Print() does when it knows nothing about // type T and T has neither << operator nor PrintTo(). // // A user can override this behavior for a class type Foo by defining // a << operator in the namespace where Foo is defined. // // We put this operator in namespace 'internal2' instead of 'internal' // to simplify the implementation, as much code in 'internal' needs to // use << in STL, which would conflict with our own << were it defined // in 'internal'. // // Note that this operator<< takes a generic std::basic_ostream type instead of the more restricted std::ostream. If // we define it to take an std::ostream instead, we'll get an // "ambiguous overloads" compiler error when trying to print a type // Foo that supports streaming to std::basic_ostream, as the compiler cannot tell whether // operator<<(std::ostream&, const T&) or // operator<<(std::basic_stream, const Foo&) is more // specific. template ::std::basic_ostream& operator<<( ::std::basic_ostream& os, const T& x) { TypeWithoutFormatter::value ? kProtobuf : internal::ImplicitlyConvertible::value ? kConvertibleToInteger : kOtherType)>::PrintValue(x, &os); return os; } } // namespace internal2 } // namespace testing // This namespace MUST NOT BE NESTED IN ::testing, or the name look-up // magic needed for implementing UniversalPrinter won't work. namespace testing_internal { // Used to print a value that is not an STL-style container when the // user doesn't define PrintTo() for it. template void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) { // With the following statement, during unqualified name lookup, // testing::internal2::operator<< appears as if it was declared in // the nearest enclosing namespace that contains both // ::testing_internal and ::testing::internal2, i.e. the global // namespace. For more details, refer to the C++ Standard section // 7.3.4-1 [namespace.udir]. This allows us to fall back onto // testing::internal2::operator<< in case T doesn't come with a << // operator. // // We cannot write 'using ::testing::internal2::operator<<;', which // gcc 3.3 fails to compile due to a compiler bug. using namespace ::testing::internal2; // NOLINT // Assuming T is defined in namespace foo, in the next statement, // the compiler will consider all of: // // 1. foo::operator<< (thanks to Koenig look-up), // 2. ::operator<< (as the current namespace is enclosed in ::), // 3. testing::internal2::operator<< (thanks to the using statement above). // // The operator<< whose type matches T best will be picked. // // We deliberately allow #2 to be a candidate, as sometimes it's // impossible to define #1 (e.g. when foo is ::std, defining // anything in it is undefined behavior unless you are a compiler // vendor.). *os << value; } } // namespace testing_internal namespace testing { namespace internal { // UniversalPrinter::Print(value, ostream_ptr) prints the given // value to the given ostream. The caller must ensure that // 'ostream_ptr' is not NULL, or the behavior is undefined. // // We define UniversalPrinter as a class template (as opposed to a // function template), as we need to partially specialize it for // reference types, which cannot be done with function templates. template class UniversalPrinter; template void UniversalPrint(const T& value, ::std::ostream* os); // Used to print an STL-style container when the user doesn't define // a PrintTo() for it. template void DefaultPrintTo(IsContainer /* dummy */, false_type /* is not a pointer */, const C& container, ::std::ostream* os) { const size_t kMaxCount = 32; // The maximum number of elements to print. *os << '{'; size_t count = 0; for (typename C::const_iterator it = container.begin(); it != container.end(); ++it, ++count) { if (count > 0) { *os << ','; if (count == kMaxCount) { // Enough has been printed. *os << " ..."; break; } } *os << ' '; // We cannot call PrintTo(*it, os) here as PrintTo() doesn't // handle *it being a native array. internal::UniversalPrint(*it, os); } if (count > 0) { *os << ' '; } *os << '}'; } // Used to print a pointer that is neither a char pointer nor a member // pointer, when the user doesn't define PrintTo() for it. (A member // variable pointer or member function pointer doesn't really point to // a location in the address space. Their representation is // implementation-defined. Therefore they will be printed as raw // bytes.) template void DefaultPrintTo(IsNotContainer /* dummy */, true_type /* is a pointer */, T* p, ::std::ostream* os) { if (p == NULL) { *os << "NULL"; } else { // C++ doesn't allow casting from a function pointer to any object // pointer. // // IsTrue() silences warnings: "Condition is always true", // "unreachable code". if (IsTrue(ImplicitlyConvertible::value)) { // T is not a function type. We just call << to print p, // relying on ADL to pick up user-defined << for their pointer // types, if any. *os << p; } else { // T is a function type, so '*os << p' doesn't do what we want // (it just prints p as bool). We want to print p as a const // void*. However, we cannot cast it to const void* directly, // even using reinterpret_cast, as earlier versions of gcc // (e.g. 3.4.5) cannot compile the cast when p is a function // pointer. Casting to UInt64 first solves the problem. *os << reinterpret_cast( reinterpret_cast(p)); } } } // Used to print a non-container, non-pointer value when the user // doesn't define PrintTo() for it. template void DefaultPrintTo(IsNotContainer /* dummy */, false_type /* is not a pointer */, const T& value, ::std::ostream* os) { ::testing_internal::DefaultPrintNonContainerTo(value, os); } // Prints the given value using the << operator if it has one; // otherwise prints the bytes in it. This is what // UniversalPrinter::Print() does when PrintTo() is not specialized // or overloaded for type T. // // A user can override this behavior for a class type Foo by defining // an overload of PrintTo() in the namespace where Foo is defined. We // give the user this option as sometimes defining a << operator for // Foo is not desirable (e.g. the coding style may prevent doing it, // or there is already a << operator but it doesn't do what the user // wants). template void PrintTo(const T& value, ::std::ostream* os) { // DefaultPrintTo() is overloaded. The type of its first two // arguments determine which version will be picked. If T is an // STL-style container, the version for container will be called; if // T is a pointer, the pointer version will be called; otherwise the // generic version will be called. // // Note that we check for container types here, prior to we check // for protocol message types in our operator<<. The rationale is: // // For protocol messages, we want to give people a chance to // override Google Mock's format by defining a PrintTo() or // operator<<. For STL containers, other formats can be // incompatible with Google Mock's format for the container // elements; therefore we check for container types here to ensure // that our format is used. // // The second argument of DefaultPrintTo() is needed to bypass a bug // in Symbian's C++ compiler that prevents it from picking the right // overload between: // // PrintTo(const T& x, ...); // PrintTo(T* x, ...); DefaultPrintTo(IsContainerTest(0), is_pointer(), value, os); } // The following list of PrintTo() overloads tells // UniversalPrinter::Print() how to print standard types (built-in // types, strings, plain arrays, and pointers). // Overloads for various char types. GTEST_API_ void PrintTo(unsigned char c, ::std::ostream* os); GTEST_API_ void PrintTo(signed char c, ::std::ostream* os); inline void PrintTo(char c, ::std::ostream* os) { // When printing a plain char, we always treat it as unsigned. This // way, the output won't be affected by whether the compiler thinks // char is signed or not. PrintTo(static_cast(c), os); } // Overloads for other simple built-in types. inline void PrintTo(bool x, ::std::ostream* os) { *os << (x ? "true" : "false"); } // Overload for wchar_t type. // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its decimal code (except for L'\0'). // The L'\0' char is printed as "L'\\0'". The decimal code is printed // as signed integer when wchar_t is implemented by the compiler // as a signed type and is printed as an unsigned integer when wchar_t // is implemented as an unsigned type. GTEST_API_ void PrintTo(wchar_t wc, ::std::ostream* os); // Overloads for C strings. GTEST_API_ void PrintTo(const char* s, ::std::ostream* os); inline void PrintTo(char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // signed/unsigned char is often used for representing binary data, so // we print pointers to it as void* to be safe. inline void PrintTo(const signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(const unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // MSVC can be configured to define wchar_t as a typedef of unsigned // short. It defines _NATIVE_WCHAR_T_DEFINED when wchar_t is a native // type. When wchar_t is a typedef, defining an overload for const // wchar_t* would cause unsigned short* be printed as a wide string, // possibly causing invalid memory accesses. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Overloads for wide C strings GTEST_API_ void PrintTo(const wchar_t* s, ::std::ostream* os); inline void PrintTo(wchar_t* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } #endif // Overload for C arrays. Multi-dimensional arrays are printed // properly. // Prints the given number of elements in an array, without printing // the curly braces. template void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { UniversalPrint(a[0], os); for (size_t i = 1; i != count; i++) { *os << ", "; UniversalPrint(a[i], os); } } // Overloads for ::string and ::std::string. #if GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::string&s, ::std::ostream* os); inline void PrintTo(const ::string& s, ::std::ostream* os) { PrintStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::std::string&s, ::std::ostream* os); inline void PrintTo(const ::std::string& s, ::std::ostream* os) { PrintStringTo(s, os); } // Overloads for ::wstring and ::std::wstring. #if GTEST_HAS_GLOBAL_WSTRING GTEST_API_ void PrintWideStringTo(const ::wstring&s, ::std::ostream* os); inline void PrintTo(const ::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING GTEST_API_ void PrintWideStringTo(const ::std::wstring&s, ::std::ostream* os); inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_TR1_TUPLE // Overload for ::std::tr1::tuple. Needed for printing function arguments, // which are packed as tuples. // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os); // Overloaded PrintTo() for tuples of various arities. We support // tuples of up-to 10 fields. The following implementation works // regardless of whether tr1::tuple is implemented using the // non-standard variadic template feature or not. inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo( const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } #endif // GTEST_HAS_TR1_TUPLE // Overload for std::pair. template void PrintTo(const ::std::pair& value, ::std::ostream* os) { *os << '('; // We cannot use UniversalPrint(value.first, os) here, as T1 may be // a reference type. The same for printing value.second. UniversalPrinter::Print(value.first, os); *os << ", "; UniversalPrinter::Print(value.second, os); *os << ')'; } // Implements printing a non-reference type T by letting the compiler // pick the right overload of PrintTo() for T. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER // Note: we deliberately don't call this PrintTo(), as that name // conflicts with ::testing::internal::PrintTo in the body of the // function. static void Print(const T& value, ::std::ostream* os) { // By default, ::testing::internal::PrintTo() is used for printing // the value. // // Thanks to Koenig look-up, if T is a class and has its own // PrintTo() function defined in its namespace, that function will // be visible here. Since it is more specific than the generic ones // in ::testing::internal, it will be picked by the compiler in the // following statement - exactly what we want. PrintTo(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // UniversalPrintArray(begin, len, os) prints an array of 'len' // elements, starting at address 'begin'. template void UniversalPrintArray(const T* begin, size_t len, ::std::ostream* os) { if (len == 0) { *os << "{}"; } else { *os << "{ "; const size_t kThreshold = 18; const size_t kChunkSize = 8; // If the array has more than kThreshold elements, we'll have to // omit some details by printing only the first and the last // kChunkSize elements. // TODO(wan@google.com): let the user control the threshold using a flag. if (len <= kThreshold) { PrintRawArrayTo(begin, len, os); } else { PrintRawArrayTo(begin, kChunkSize, os); *os << ", ..., "; PrintRawArrayTo(begin + len - kChunkSize, kChunkSize, os); } *os << " }"; } } // This overload prints a (const) char array compactly. GTEST_API_ void UniversalPrintArray(const char* begin, size_t len, ::std::ostream* os); // Implements printing an array type T[N]. template class UniversalPrinter { public: // Prints the given array, omitting some elements when there are too // many. static void Print(const T (&a)[N], ::std::ostream* os) { UniversalPrintArray(a, N, os); } }; // Implements printing a reference type T&. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER static void Print(const T& value, ::std::ostream* os) { // Prints the address of the value. We use reinterpret_cast here // as static_cast doesn't compile when T is a function type. *os << "@" << reinterpret_cast(&value) << " "; // Then prints the value itself. UniversalPrint(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // Prints a value tersely: for a reference type, the referenced value // (but not the address) is printed; for a (const) char pointer, the // NUL-terminated string (but not the pointer) is printed. template void UniversalTersePrint(const T& value, ::std::ostream* os) { UniversalPrint(value, os); } inline void UniversalTersePrint(const char* str, ::std::ostream* os) { if (str == NULL) { *os << "NULL"; } else { UniversalPrint(string(str), os); } } inline void UniversalTersePrint(char* str, ::std::ostream* os) { UniversalTersePrint(static_cast(str), os); } // Prints a value using the type inferred by the compiler. The // difference between this and UniversalTersePrint() is that for a // (const) char pointer, this prints both the pointer and the // NUL-terminated string. template void UniversalPrint(const T& value, ::std::ostream* os) { UniversalPrinter::Print(value, os); } #if GTEST_HAS_TR1_TUPLE typedef ::std::vector Strings; // This helper template allows PrintTo() for tuples and // UniversalTersePrintTupleFieldsToStrings() to be defined by // induction on the number of tuple fields. The idea is that // TuplePrefixPrinter::PrintPrefixTo(t, os) prints the first N // fields in tuple t, and can be defined in terms of // TuplePrefixPrinter. // The inductive case. template struct TuplePrefixPrinter { // Prints the first N fields of a tuple. template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { TuplePrefixPrinter::PrintPrefixTo(t, os); *os << ", "; UniversalPrinter::type> ::Print(::std::tr1::get(t), os); } // Tersely prints the first N fields of a tuple to a string vector, // one element for each field. template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { TuplePrefixPrinter::TersePrintPrefixToStrings(t, strings); ::std::stringstream ss; UniversalTersePrint(::std::tr1::get(t), &ss); strings->push_back(ss.str()); } }; // Base cases. template <> struct TuplePrefixPrinter<0> { template static void PrintPrefixTo(const Tuple&, ::std::ostream*) {} template static void TersePrintPrefixToStrings(const Tuple&, Strings*) {} }; // We have to specialize the entire TuplePrefixPrinter<> class // template here, even though the definition of // TersePrintPrefixToStrings() is the same as the generic version, as // Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't // support specializing a method template of a class template. template <> struct TuplePrefixPrinter<1> { template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { UniversalPrinter::type>:: Print(::std::tr1::get<0>(t), os); } template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { ::std::stringstream ss; UniversalTersePrint(::std::tr1::get<0>(t), &ss); strings->push_back(ss.str()); } }; // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os) { *os << "("; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: PrintPrefixTo(t, os); *os << ")"; } // Prints the fields of a tuple tersely to a string vector, one // element for each field. See the comment before // UniversalTersePrint() for how we define "tersely". template Strings UniversalTersePrintTupleFieldsToStrings(const Tuple& value) { Strings result; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: TersePrintPrefixToStrings(value, &result); return result; } #endif // GTEST_HAS_TR1_TUPLE } // namespace internal template ::std::string PrintToString(const T& value) { ::std::stringstream ss; internal::UniversalTersePrint(value, &ss); return ss.str(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #if GTEST_HAS_PARAM_TEST namespace testing { namespace internal { // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Outputs a message explaining invalid registration of different // fixture class for the same test case. This may happen when // TEST_P macro is used to define two tests with the same name // but in different namespaces. GTEST_API_ void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line); template class ParamGeneratorInterface; template class ParamGenerator; // Interface for iterating over elements provided by an implementation // of ParamGeneratorInterface. template class ParamIteratorInterface { public: virtual ~ParamIteratorInterface() {} // A pointer to the base generator instance. // Used only for the purposes of iterator comparison // to make sure that two iterators belong to the same generator. virtual const ParamGeneratorInterface* BaseGenerator() const = 0; // Advances iterator to point to the next element // provided by the generator. The caller is responsible // for not calling Advance() on an iterator equal to // BaseGenerator()->End(). virtual void Advance() = 0; // Clones the iterator object. Used for implementing copy semantics // of ParamIterator. virtual ParamIteratorInterface* Clone() const = 0; // Dereferences the current iterator and provides (read-only) access // to the pointed value. It is the caller's responsibility not to call // Current() on an iterator equal to BaseGenerator()->End(). // Used for implementing ParamGenerator::operator*(). virtual const T* Current() const = 0; // Determines whether the given iterator and other point to the same // element in the sequence generated by the generator. // Used for implementing ParamGenerator::operator==(). virtual bool Equals(const ParamIteratorInterface& other) const = 0; }; // Class iterating over elements provided by an implementation of // ParamGeneratorInterface. It wraps ParamIteratorInterface // and implements the const forward iterator concept. template class ParamIterator { public: typedef T value_type; typedef const T& reference; typedef ptrdiff_t difference_type; // ParamIterator assumes ownership of the impl_ pointer. ParamIterator(const ParamIterator& other) : impl_(other.impl_->Clone()) {} ParamIterator& operator=(const ParamIterator& other) { if (this != &other) impl_.reset(other.impl_->Clone()); return *this; } const T& operator*() const { return *impl_->Current(); } const T* operator->() const { return impl_->Current(); } // Prefix version of operator++. ParamIterator& operator++() { impl_->Advance(); return *this; } // Postfix version of operator++. ParamIterator operator++(int /*unused*/) { ParamIteratorInterface* clone = impl_->Clone(); impl_->Advance(); return ParamIterator(clone); } bool operator==(const ParamIterator& other) const { return impl_.get() == other.impl_.get() || impl_->Equals(*other.impl_); } bool operator!=(const ParamIterator& other) const { return !(*this == other); } private: friend class ParamGenerator; explicit ParamIterator(ParamIteratorInterface* impl) : impl_(impl) {} scoped_ptr > impl_; }; // ParamGeneratorInterface is the binary interface to access generators // defined in other translation units. template class ParamGeneratorInterface { public: typedef T ParamType; virtual ~ParamGeneratorInterface() {} // Generator interface definition virtual ParamIteratorInterface* Begin() const = 0; virtual ParamIteratorInterface* End() const = 0; }; // Wraps ParamGeneratorInterface and provides general generator syntax // compatible with the STL Container concept. // This class implements copy initialization semantics and the contained // ParamGeneratorInterface instance is shared among all copies // of the original object. This is possible because that instance is immutable. template class ParamGenerator { public: typedef ParamIterator iterator; explicit ParamGenerator(ParamGeneratorInterface* impl) : impl_(impl) {} ParamGenerator(const ParamGenerator& other) : impl_(other.impl_) {} ParamGenerator& operator=(const ParamGenerator& other) { impl_ = other.impl_; return *this; } iterator begin() const { return iterator(impl_->Begin()); } iterator end() const { return iterator(impl_->End()); } private: linked_ptr > impl_; }; // Generates values from a range of two comparable values. Can be used to // generate sequences of user-defined types that implement operator+() and // operator<(). // This class is used in the Range() function. template class RangeGenerator : public ParamGeneratorInterface { public: RangeGenerator(T begin, T end, IncrementT step) : begin_(begin), end_(end), step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} virtual ~RangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, begin_, 0, step_); } virtual ParamIteratorInterface* End() const { return new Iterator(this, end_, end_index_, step_); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, T value, int index, IncrementT step) : base_(base), value_(value), index_(index), step_(step) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { value_ = value_ + step_; index_++; } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const T* Current() const { return &value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const int other_index = CheckedDowncastToActualType(&other)->index_; return index_ == other_index; } private: Iterator(const Iterator& other) : ParamIteratorInterface(), base_(other.base_), value_(other.value_), index_(other.index_), step_(other.step_) {} // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; T value_; int index_; const IncrementT step_; }; // class RangeGenerator::Iterator static int CalculateEndIndex(const T& begin, const T& end, const IncrementT& step) { int end_index = 0; for (T i = begin; i < end; i = i + step) end_index++; return end_index; } // No implementation - assignment is unsupported. void operator=(const RangeGenerator& other); const T begin_; const T end_; const IncrementT step_; // The index for the end() iterator. All the elements in the generated // sequence are indexed (0-based) to aid iterator comparison. const int end_index_; }; // class RangeGenerator // Generates values from a pair of STL-style iterators. Used in the // ValuesIn() function. The elements are copied from the source range // since the source can be located on the stack, and the generator // is likely to persist beyond that stack frame. template class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface { public: template ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end) : container_(begin, end) {} virtual ~ValuesInIteratorRangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, container_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, container_.end()); } private: typedef typename ::std::vector ContainerType; class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, typename ContainerType::const_iterator iterator) : base_(base), iterator_(iterator) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { ++iterator_; value_.reset(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } // We need to use cached value referenced by iterator_ because *iterator_ // can return a temporary object (and of type other then T), so just // having "return &*iterator_;" doesn't work. // value_ is updated here and not in Advance() because Advance() // can advance iterator_ beyond the end of the range, and we cannot // detect that fact. The client code, on the other hand, is // responsible for not calling Current() on an out-of-range iterator. virtual const T* Current() const { if (value_.get() == NULL) value_.reset(new T(*iterator_)); return value_.get(); } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; return iterator_ == CheckedDowncastToActualType(&other)->iterator_; } private: Iterator(const Iterator& other) // The explicit constructor call suppresses a false warning // emitted by gcc when supplied with the -Wextra option. : ParamIteratorInterface(), base_(other.base_), iterator_(other.iterator_) {} const ParamGeneratorInterface* const base_; typename ContainerType::const_iterator iterator_; // A cached value of *iterator_. We keep it here to allow access by // pointer in the wrapping iterator's operator->(). // value_ needs to be mutable to be accessed in Current(). // Use of scoped_ptr helps manage cached value's lifetime, // which is bound by the lifespan of the iterator itself. mutable scoped_ptr value_; }; // class ValuesInIteratorRangeGenerator::Iterator // No implementation - assignment is unsupported. void operator=(const ValuesInIteratorRangeGenerator& other); const ContainerType container_; }; // class ValuesInIteratorRangeGenerator // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Stores a parameter value and later creates tests parameterized with that // value. template class ParameterizedTestFactory : public TestFactoryBase { public: typedef typename TestClass::ParamType ParamType; explicit ParameterizedTestFactory(ParamType parameter) : parameter_(parameter) {} virtual Test* CreateTest() { TestClass::SetParam(¶meter_); return new TestClass(); } private: const ParamType parameter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactoryBase is a base class for meta-factories that create // test factories for passing into MakeAndRegisterTestInfo function. template class TestMetaFactoryBase { public: virtual ~TestMetaFactoryBase() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) = 0; }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactory creates test factories for passing into // MakeAndRegisterTestInfo function. Since MakeAndRegisterTestInfo receives // ownership of test factory pointer, same factory object cannot be passed // into that method twice. But ParameterizedTestCaseInfo is going to call // it for each Test/Parameter value combination. Thus it needs meta factory // creator class. template class TestMetaFactory : public TestMetaFactoryBase { public: typedef typename TestCase::ParamType ParamType; TestMetaFactory() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) { return new ParameterizedTestFactory(parameter); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestMetaFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfoBase is a generic interface // to ParameterizedTestCaseInfo classes. ParameterizedTestCaseInfoBase // accumulates test information provided by TEST_P macro invocations // and generators provided by INSTANTIATE_TEST_CASE_P macro invocations // and uses that information to register all resulting test instances // in RegisterTests method. The ParameterizeTestCaseRegistry class holds // a collection of pointers to the ParameterizedTestCaseInfo objects // and calls RegisterTests() on each of them when asked. class ParameterizedTestCaseInfoBase { public: virtual ~ParameterizedTestCaseInfoBase() {} // Base part of test case name for display purposes. virtual const string& GetTestCaseName() const = 0; // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const = 0; // UnitTest class invokes this method to register tests in this // test case right before running them in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. virtual void RegisterTests() = 0; protected: ParameterizedTestCaseInfoBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfoBase); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfo accumulates tests obtained from TEST_P // macro invocations for a particular test case and generators // obtained from INSTANTIATE_TEST_CASE_P macro invocations for that // test case. It registers tests with all values generated by all // generators when asked. template class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase { public: // ParamType and GeneratorCreationFunc are private types but are required // for declarations of public methods AddTestPattern() and // AddTestCaseInstantiation(). typedef typename TestCase::ParamType ParamType; // A function that returns an instance of appropriate generator type. typedef ParamGenerator(GeneratorCreationFunc)(); explicit ParameterizedTestCaseInfo(const char* name) : test_case_name_(name) {} // Test case base name for display purposes. virtual const string& GetTestCaseName() const { return test_case_name_; } // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const { return GetTypeId(); } // TEST_P macro uses AddTestPattern() to record information // about a single test in a LocalTestInfo structure. // test_case_name is the base name of the test case (without invocation // prefix). test_base_name is the name of an individual test without // parameter index. For the test SequenceA/FooTest.DoBar/1 FooTest is // test case base name and DoBar is test base name. void AddTestPattern(const char* test_case_name, const char* test_base_name, TestMetaFactoryBase* meta_factory) { tests_.push_back(linked_ptr(new TestInfo(test_case_name, test_base_name, meta_factory))); } // INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information // about a generator. int AddTestCaseInstantiation(const string& instantiation_name, GeneratorCreationFunc* func, const char* /* file */, int /* line */) { instantiations_.push_back(::std::make_pair(instantiation_name, func)); return 0; // Return value used only to run this method in namespace scope. } // UnitTest class invokes this method to register tests in this test case // test cases right before running tests in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. // UnitTest has a guard to prevent from calling this method more then once. virtual void RegisterTests() { for (typename TestInfoContainer::iterator test_it = tests_.begin(); test_it != tests_.end(); ++test_it) { linked_ptr test_info = *test_it; for (typename InstantiationContainer::iterator gen_it = instantiations_.begin(); gen_it != instantiations_.end(); ++gen_it) { const string& instantiation_name = gen_it->first; ParamGenerator generator((*gen_it->second)()); Message test_case_name_stream; if ( !instantiation_name.empty() ) test_case_name_stream << instantiation_name << "/"; test_case_name_stream << test_info->test_case_base_name; int i = 0; for (typename ParamGenerator::iterator param_it = generator.begin(); param_it != generator.end(); ++param_it, ++i) { Message test_name_stream; test_name_stream << test_info->test_base_name << "/" << i; MakeAndRegisterTestInfo( test_case_name_stream.GetString().c_str(), test_name_stream.GetString().c_str(), NULL, // No type parameter. PrintToString(*param_it).c_str(), GetTestCaseTypeId(), TestCase::SetUpTestCase, TestCase::TearDownTestCase, test_info->test_meta_factory->CreateTestFactory(*param_it)); } // for param_it } // for gen_it } // for test_it } // RegisterTests private: // LocalTestInfo structure keeps information about a single test registered // with TEST_P macro. struct TestInfo { TestInfo(const char* a_test_case_base_name, const char* a_test_base_name, TestMetaFactoryBase* a_test_meta_factory) : test_case_base_name(a_test_case_base_name), test_base_name(a_test_base_name), test_meta_factory(a_test_meta_factory) {} const string test_case_base_name; const string test_base_name; const scoped_ptr > test_meta_factory; }; typedef ::std::vector > TestInfoContainer; // Keeps pairs of // received from INSTANTIATE_TEST_CASE_P macros. typedef ::std::vector > InstantiationContainer; const string test_case_name_; TestInfoContainer tests_; InstantiationContainer instantiations_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfo); }; // class ParameterizedTestCaseInfo // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseRegistry contains a map of ParameterizedTestCaseInfoBase // classes accessed by test case names. TEST_P and INSTANTIATE_TEST_CASE_P // macros use it to locate their corresponding ParameterizedTestCaseInfo // descriptors. class ParameterizedTestCaseRegistry { public: ParameterizedTestCaseRegistry() {} ~ParameterizedTestCaseRegistry() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { delete *it; } } // Looks up or creates and returns a structure containing information about // tests and instantiations of a particular test case. template ParameterizedTestCaseInfo* GetTestCasePatternHolder( const char* test_case_name, const char* file, int line) { ParameterizedTestCaseInfo* typed_test_info = NULL; for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { if ((*it)->GetTestCaseName() == test_case_name) { if ((*it)->GetTestCaseTypeId() != GetTypeId()) { // Complain about incorrect usage of Google Test facilities // and terminate the program since we cannot guaranty correct // test case setup and tear-down in this case. ReportInvalidTestCaseType(test_case_name, file, line); posix::Abort(); } else { // At this point we are sure that the object we found is of the same // type we are looking for, so we downcast it to that type // without further checks. typed_test_info = CheckedDowncastToActualType< ParameterizedTestCaseInfo >(*it); } break; } } if (typed_test_info == NULL) { typed_test_info = new ParameterizedTestCaseInfo(test_case_name); test_case_infos_.push_back(typed_test_info); } return typed_test_info; } void RegisterTests() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { (*it)->RegisterTests(); } } private: typedef ::std::vector TestCaseInfoContainer; TestCaseInfoContainer test_case_infos_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry); }; } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ // This file was GENERATED by command: // pump.py gtest-param-util-generated.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently Google Test supports at most 50 arguments in Values, // and at most 10 arguments in Combine. Please contact // googletestframework@googlegroups.com if you need more. // Please note that the number of arguments to Combine is limited // by the maximum arity of the implementation of tr1::tuple which is // currently set at 10. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #if GTEST_HAS_PARAM_TEST namespace testing { // Forward declarations of ValuesIn(), which is implemented in // include/gtest/gtest-param-test.h. template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end); template internal::ParamGenerator ValuesIn(const T (&array)[N]); template internal::ParamGenerator ValuesIn( const Container& container); namespace internal { // Used in the Values() function to provide polymorphic capabilities. template class ValueArray1 { public: explicit ValueArray1(T1 v1) : v1_(v1) {} template operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray1& other); const T1 v1_; }; template class ValueArray2 { public: ValueArray2(T1 v1, T2 v2) : v1_(v1), v2_(v2) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray2& other); const T1 v1_; const T2 v2_; }; template class ValueArray3 { public: ValueArray3(T1 v1, T2 v2, T3 v3) : v1_(v1), v2_(v2), v3_(v3) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray3& other); const T1 v1_; const T2 v2_; const T3 v3_; }; template class ValueArray4 { public: ValueArray4(T1 v1, T2 v2, T3 v3, T4 v4) : v1_(v1), v2_(v2), v3_(v3), v4_(v4) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray4& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; }; template class ValueArray5 { public: ValueArray5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray5& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; }; template class ValueArray6 { public: ValueArray6(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray6& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; }; template class ValueArray7 { public: ValueArray7(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray7& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; }; template class ValueArray8 { public: ValueArray8(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray8& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; }; template class ValueArray9 { public: ValueArray9(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray9& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; }; template class ValueArray10 { public: ValueArray10(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray10& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; }; template class ValueArray11 { public: ValueArray11(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray11& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; }; template class ValueArray12 { public: ValueArray12(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray12& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; }; template class ValueArray13 { public: ValueArray13(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray13& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; }; template class ValueArray14 { public: ValueArray14(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray14& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; }; template class ValueArray15 { public: ValueArray15(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray15& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; }; template class ValueArray16 { public: ValueArray16(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray16& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; }; template class ValueArray17 { public: ValueArray17(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray17& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; }; template class ValueArray18 { public: ValueArray18(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray18& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; }; template class ValueArray19 { public: ValueArray19(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray19& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; }; template class ValueArray20 { public: ValueArray20(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray20& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; }; template class ValueArray21 { public: ValueArray21(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray21& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; }; template class ValueArray22 { public: ValueArray22(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray22& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; }; template class ValueArray23 { public: ValueArray23(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray23& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; }; template class ValueArray24 { public: ValueArray24(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray24& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; }; template class ValueArray25 { public: ValueArray25(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray25& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; }; template class ValueArray26 { public: ValueArray26(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray26& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; }; template class ValueArray27 { public: ValueArray27(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray27& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; }; template class ValueArray28 { public: ValueArray28(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray28& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; }; template class ValueArray29 { public: ValueArray29(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray29& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; }; template class ValueArray30 { public: ValueArray30(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray30& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; }; template class ValueArray31 { public: ValueArray31(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray31& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; }; template class ValueArray32 { public: ValueArray32(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray32& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; }; template class ValueArray33 { public: ValueArray33(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray33& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; }; template class ValueArray34 { public: ValueArray34(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray34& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; }; template class ValueArray35 { public: ValueArray35(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray35& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; }; template class ValueArray36 { public: ValueArray36(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray36& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; }; template class ValueArray37 { public: ValueArray37(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray37& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; }; template class ValueArray38 { public: ValueArray38(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray38& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; }; template class ValueArray39 { public: ValueArray39(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray39& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; }; template class ValueArray40 { public: ValueArray40(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray40& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; }; template class ValueArray41 { public: ValueArray41(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray41& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; }; template class ValueArray42 { public: ValueArray42(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray42& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; }; template class ValueArray43 { public: ValueArray43(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray43& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; }; template class ValueArray44 { public: ValueArray44(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray44& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; }; template class ValueArray45 { public: ValueArray45(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray45& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; }; template class ValueArray46 { public: ValueArray46(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray46& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; }; template class ValueArray47 { public: ValueArray47(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray47& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; }; template class ValueArray48 { public: ValueArray48(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray48& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; }; template class ValueArray49 { public: ValueArray49(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray49& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; }; template class ValueArray50 { public: ValueArray50(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49), v50_(v50) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_, v50_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray50& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; const T50 v50_; }; # if GTEST_HAS_COMBINE // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Generates values from the Cartesian product of values produced // by the argument generators. // template class CartesianProductGenerator2 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator2(const ParamGenerator& g1, const ParamGenerator& g2) : g1_(g1), g2_(g2) {} virtual ~CartesianProductGenerator2() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current2_; if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; ParamType current_value_; }; // class CartesianProductGenerator2::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator2& other); const ParamGenerator g1_; const ParamGenerator g2_; }; // class CartesianProductGenerator2 template class CartesianProductGenerator3 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator3(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3) : g1_(g1), g2_(g2), g3_(g3) {} virtual ~CartesianProductGenerator3() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current3_; if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; ParamType current_value_; }; // class CartesianProductGenerator3::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator3& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; }; // class CartesianProductGenerator3 template class CartesianProductGenerator4 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator4(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} virtual ~CartesianProductGenerator4() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current4_; if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; ParamType current_value_; }; // class CartesianProductGenerator4::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator4& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; }; // class CartesianProductGenerator4 template class CartesianProductGenerator5 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator5(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} virtual ~CartesianProductGenerator5() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current5_; if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; ParamType current_value_; }; // class CartesianProductGenerator5::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator5& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; }; // class CartesianProductGenerator5 template class CartesianProductGenerator6 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator6(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} virtual ~CartesianProductGenerator6() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current6_; if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; ParamType current_value_; }; // class CartesianProductGenerator6::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator6& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; }; // class CartesianProductGenerator6 template class CartesianProductGenerator7 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator7(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} virtual ~CartesianProductGenerator7() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current7_; if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; ParamType current_value_; }; // class CartesianProductGenerator7::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator7& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; }; // class CartesianProductGenerator7 template class CartesianProductGenerator8 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator8(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} virtual ~CartesianProductGenerator8() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current8_; if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; ParamType current_value_; }; // class CartesianProductGenerator8::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator8& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; }; // class CartesianProductGenerator8 template class CartesianProductGenerator9 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator9(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} virtual ~CartesianProductGenerator9() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current9_; if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; ParamType current_value_; }; // class CartesianProductGenerator9::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator9& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; }; // class CartesianProductGenerator9 template class CartesianProductGenerator10 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator10(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9, const ParamGenerator& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} virtual ~CartesianProductGenerator10() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin(), g10_, g10_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end(), g10_, g10_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9, const ParamGenerator& g10, const typename ParamGenerator::iterator& current10) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9), begin10_(g10.begin()), end10_(g10.end()), current10_(current10) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current10_; if (current10_ == end10_) { current10_ = begin10_; ++current9_; } if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_ && current10_ == typed_other->current10_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_), begin10_(other.begin10_), end10_(other.end10_), current10_(other.current10_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_, *current10_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_ || current10_ == end10_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; const typename ParamGenerator::iterator begin10_; const typename ParamGenerator::iterator end10_; typename ParamGenerator::iterator current10_; ParamType current_value_; }; // class CartesianProductGenerator10::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator10& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; const ParamGenerator g10_; }; // class CartesianProductGenerator10 // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Helper classes providing Combine() with polymorphic features. They allow // casting CartesianProductGeneratorN to ParamGenerator if T is // convertible to U. // template class CartesianProductHolder2 { public: CartesianProductHolder2(const Generator1& g1, const Generator2& g2) : g1_(g1), g2_(g2) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator2( static_cast >(g1_), static_cast >(g2_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder2& other); const Generator1 g1_; const Generator2 g2_; }; // class CartesianProductHolder2 template class CartesianProductHolder3 { public: CartesianProductHolder3(const Generator1& g1, const Generator2& g2, const Generator3& g3) : g1_(g1), g2_(g2), g3_(g3) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator3( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder3& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; }; // class CartesianProductHolder3 template class CartesianProductHolder4 { public: CartesianProductHolder4(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator4( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder4& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; }; // class CartesianProductHolder4 template class CartesianProductHolder5 { public: CartesianProductHolder5(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator5( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder5& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; }; // class CartesianProductHolder5 template class CartesianProductHolder6 { public: CartesianProductHolder6(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator6( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder6& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; }; // class CartesianProductHolder6 template class CartesianProductHolder7 { public: CartesianProductHolder7(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator7( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder7& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; }; // class CartesianProductHolder7 template class CartesianProductHolder8 { public: CartesianProductHolder8(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator8( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder8& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; }; // class CartesianProductHolder8 template class CartesianProductHolder9 { public: CartesianProductHolder9(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator9( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder9& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; }; // class CartesianProductHolder9 template class CartesianProductHolder10 { public: CartesianProductHolder10(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator10( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_), static_cast >(g10_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder10& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; const Generator10 g10_; }; // class CartesianProductHolder10 # endif // GTEST_HAS_COMBINE } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #if GTEST_HAS_PARAM_TEST namespace testing { // Functions producing parameter generators. // // Google Test uses these generators to produce parameters for value- // parameterized tests. When a parameterized test case is instantiated // with a particular generator, Google Test creates and runs tests // for each element in the sequence produced by the generator. // // In the following sample, tests from test case FooTest are instantiated // each three times with parameter values 3, 5, and 8: // // class FooTest : public TestWithParam { ... }; // // TEST_P(FooTest, TestThis) { // } // TEST_P(FooTest, TestThat) { // } // INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); // // Range() returns generators providing sequences of values in a range. // // Synopsis: // Range(start, end) // - returns a generator producing a sequence of values {start, start+1, // start+2, ..., }. // Range(start, end, step) // - returns a generator producing a sequence of values {start, start+step, // start+step+step, ..., }. // Notes: // * The generated sequences never include end. For example, Range(1, 5) // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) // returns a generator producing {1, 3, 5, 7}. // * start and end must have the same type. That type may be any integral or // floating-point type or a user defined type satisfying these conditions: // * It must be assignable (have operator=() defined). // * It must have operator+() (operator+(int-compatible type) for // two-operand version). // * It must have operator<() defined. // Elements in the resulting sequences will also have that type. // * Condition start < end must be satisfied in order for resulting sequences // to contain any elements. // template internal::ParamGenerator Range(T start, T end, IncrementT step) { return internal::ParamGenerator( new internal::RangeGenerator(start, end, step)); } template internal::ParamGenerator Range(T start, T end) { return Range(start, end, 1); } // ValuesIn() function allows generation of tests with parameters coming from // a container. // // Synopsis: // ValuesIn(const T (&array)[N]) // - returns a generator producing sequences with elements from // a C-style array. // ValuesIn(const Container& container) // - returns a generator producing sequences with elements from // an STL-style container. // ValuesIn(Iterator begin, Iterator end) // - returns a generator producing sequences with elements from // a range [begin, end) defined by a pair of STL-style iterators. These // iterators can also be plain C pointers. // // Please note that ValuesIn copies the values from the containers // passed in and keeps them to generate tests in RUN_ALL_TESTS(). // // Examples: // // This instantiates tests from test case StringTest // each with C-string values of "foo", "bar", and "baz": // // const char* strings[] = {"foo", "bar", "baz"}; // INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); // // This instantiates tests from test case StlStringTest // each with STL strings with values "a" and "b": // // ::std::vector< ::std::string> GetParameterStrings() { // ::std::vector< ::std::string> v; // v.push_back("a"); // v.push_back("b"); // return v; // } // // INSTANTIATE_TEST_CASE_P(CharSequence, // StlStringTest, // ValuesIn(GetParameterStrings())); // // // This will also instantiate tests from CharTest // each with parameter values 'a' and 'b': // // ::std::list GetParameterChars() { // ::std::list list; // list.push_back('a'); // list.push_back('b'); // return list; // } // ::std::list l = GetParameterChars(); // INSTANTIATE_TEST_CASE_P(CharSequence2, // CharTest, // ValuesIn(l.begin(), l.end())); // template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end) { typedef typename ::testing::internal::IteratorTraits ::value_type ParamType; return internal::ParamGenerator( new internal::ValuesInIteratorRangeGenerator(begin, end)); } template internal::ParamGenerator ValuesIn(const T (&array)[N]) { return ValuesIn(array, array + N); } template internal::ParamGenerator ValuesIn( const Container& container) { return ValuesIn(container.begin(), container.end()); } // Values() allows generating tests from explicitly specified list of // parameters. // // Synopsis: // Values(T v1, T v2, ..., T vN) // - returns a generator producing sequences with elements v1, v2, ..., vN. // // For example, this instantiates tests from test case BarTest each // with values "one", "two", and "three": // // INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); // // This instantiates tests from test case BazTest each with values 1, 2, 3.5. // The exact type of values will depend on the type of parameter in BazTest. // // INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); // // Currently, Values() supports from 1 to 50 parameters. // template internal::ValueArray1 Values(T1 v1) { return internal::ValueArray1(v1); } template internal::ValueArray2 Values(T1 v1, T2 v2) { return internal::ValueArray2(v1, v2); } template internal::ValueArray3 Values(T1 v1, T2 v2, T3 v3) { return internal::ValueArray3(v1, v2, v3); } template internal::ValueArray4 Values(T1 v1, T2 v2, T3 v3, T4 v4) { return internal::ValueArray4(v1, v2, v3, v4); } template internal::ValueArray5 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) { return internal::ValueArray5(v1, v2, v3, v4, v5); } template internal::ValueArray6 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) { return internal::ValueArray6(v1, v2, v3, v4, v5, v6); } template internal::ValueArray7 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) { return internal::ValueArray7(v1, v2, v3, v4, v5, v6, v7); } template internal::ValueArray8 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) { return internal::ValueArray8(v1, v2, v3, v4, v5, v6, v7, v8); } template internal::ValueArray9 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) { return internal::ValueArray9(v1, v2, v3, v4, v5, v6, v7, v8, v9); } template internal::ValueArray10 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) { return internal::ValueArray10(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10); } template internal::ValueArray11 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) { return internal::ValueArray11(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11); } template internal::ValueArray12 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) { return internal::ValueArray12(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12); } template internal::ValueArray13 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) { return internal::ValueArray13(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13); } template internal::ValueArray14 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) { return internal::ValueArray14(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14); } template internal::ValueArray15 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) { return internal::ValueArray15(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15); } template internal::ValueArray16 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) { return internal::ValueArray16(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16); } template internal::ValueArray17 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) { return internal::ValueArray17(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17); } template internal::ValueArray18 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) { return internal::ValueArray18(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18); } template internal::ValueArray19 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) { return internal::ValueArray19(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19); } template internal::ValueArray20 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) { return internal::ValueArray20(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20); } template internal::ValueArray21 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) { return internal::ValueArray21(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21); } template internal::ValueArray22 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) { return internal::ValueArray22(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22); } template internal::ValueArray23 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) { return internal::ValueArray23(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23); } template internal::ValueArray24 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) { return internal::ValueArray24(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24); } template internal::ValueArray25 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) { return internal::ValueArray25(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25); } template internal::ValueArray26 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) { return internal::ValueArray26(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26); } template internal::ValueArray27 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) { return internal::ValueArray27(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27); } template internal::ValueArray28 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) { return internal::ValueArray28(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28); } template internal::ValueArray29 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) { return internal::ValueArray29(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29); } template internal::ValueArray30 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) { return internal::ValueArray30(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30); } template internal::ValueArray31 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) { return internal::ValueArray31(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31); } template internal::ValueArray32 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) { return internal::ValueArray32(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32); } template internal::ValueArray33 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) { return internal::ValueArray33(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33); } template internal::ValueArray34 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) { return internal::ValueArray34(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34); } template internal::ValueArray35 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) { return internal::ValueArray35(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35); } template internal::ValueArray36 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) { return internal::ValueArray36(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36); } template internal::ValueArray37 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) { return internal::ValueArray37(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37); } template internal::ValueArray38 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) { return internal::ValueArray38(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38); } template internal::ValueArray39 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) { return internal::ValueArray39(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39); } template internal::ValueArray40 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) { return internal::ValueArray40(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40); } template internal::ValueArray41 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) { return internal::ValueArray41(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41); } template internal::ValueArray42 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) { return internal::ValueArray42(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42); } template internal::ValueArray43 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) { return internal::ValueArray43(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43); } template internal::ValueArray44 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) { return internal::ValueArray44(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44); } template internal::ValueArray45 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) { return internal::ValueArray45(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45); } template internal::ValueArray46 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) { return internal::ValueArray46(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46); } template internal::ValueArray47 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) { return internal::ValueArray47(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47); } template internal::ValueArray48 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) { return internal::ValueArray48(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48); } template internal::ValueArray49 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) { return internal::ValueArray49(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49); } template internal::ValueArray50 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) { return internal::ValueArray50(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50); } // Bool() allows generating tests with parameters in a set of (false, true). // // Synopsis: // Bool() // - returns a generator producing sequences with elements {false, true}. // // It is useful when testing code that depends on Boolean flags. Combinations // of multiple flags can be tested when several Bool()'s are combined using // Combine() function. // // In the following example all tests in the test case FlagDependentTest // will be instantiated twice with parameters false and true. // // class FlagDependentTest : public testing::TestWithParam { // virtual void SetUp() { // external_flag = GetParam(); // } // } // INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); // inline internal::ParamGenerator Bool() { return Values(false, true); } # if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of // tuple where T1, T2, ..., TN are the types // of elements from sequences produces by gen1, gen2, ..., genN. // // Combine can have up to 10 arguments. This number is currently limited // by the maximum number of elements in the tuple implementation used by Google // Test. // // Example: // // This will instantiate tests in test case AnimalTest each one with // the parameter values tuple("cat", BLACK), tuple("cat", WHITE), // tuple("dog", BLACK), and tuple("dog", WHITE): // // enum Color { BLACK, GRAY, WHITE }; // class AnimalTest // : public testing::TestWithParam > {...}; // // TEST_P(AnimalTest, AnimalLooksNice) {...} // // INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, // Combine(Values("cat", "dog"), // Values(BLACK, WHITE))); // // This will instantiate tests in FlagDependentTest with all variations of two // Boolean flags: // // class FlagDependentTest // : public testing::TestWithParam > { // virtual void SetUp() { // // Assigns external_flag_1 and external_flag_2 values from the tuple. // tie(external_flag_1, external_flag_2) = GetParam(); // } // }; // // TEST_P(FlagDependentTest, TestFeature1) { // // Test your code using external_flag_1 and external_flag_2 here. // } // INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, // Combine(Bool(), Bool())); // template internal::CartesianProductHolder2 Combine( const Generator1& g1, const Generator2& g2) { return internal::CartesianProductHolder2( g1, g2); } template internal::CartesianProductHolder3 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3) { return internal::CartesianProductHolder3( g1, g2, g3); } template internal::CartesianProductHolder4 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) { return internal::CartesianProductHolder4( g1, g2, g3, g4); } template internal::CartesianProductHolder5 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) { return internal::CartesianProductHolder5( g1, g2, g3, g4, g5); } template internal::CartesianProductHolder6 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) { return internal::CartesianProductHolder6( g1, g2, g3, g4, g5, g6); } template internal::CartesianProductHolder7 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) { return internal::CartesianProductHolder7( g1, g2, g3, g4, g5, g6, g7); } template internal::CartesianProductHolder8 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) { return internal::CartesianProductHolder8( g1, g2, g3, g4, g5, g6, g7, g8); } template internal::CartesianProductHolder9 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) { return internal::CartesianProductHolder9( g1, g2, g3, g4, g5, g6, g7, g8, g9); } template internal::CartesianProductHolder10 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) { return internal::CartesianProductHolder10( g1, g2, g3, g4, g5, g6, g7, g8, g9, g10); } # endif // GTEST_HAS_COMBINE # define TEST_P(test_case_name, test_name) \ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ : public test_case_name { \ public: \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ virtual void TestBody(); \ private: \ static int AddToRegistry() { \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ #test_case_name, \ #test_name, \ new ::testing::internal::TestMetaFactory< \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ return 0; \ } \ static int gtest_registering_dummy_; \ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ }; \ int GTEST_TEST_CLASS_NAME_(test_case_name, \ test_name)::gtest_registering_dummy_ = \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() # define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ ::testing::internal::ParamGenerator \ gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ int gtest_##prefix##test_case_name##_dummy_ = \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ #prefix, \ >est_##prefix##test_case_name##_EvalGenerator_, \ __FILE__, __LINE__) } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Testing Framework definitions useful in production code. #ifndef GTEST_INCLUDE_GTEST_GTEST_PROD_H_ #define GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // When you need to test the private or protected members of a class, // use the FRIEND_TEST macro to declare your tests as friends of the // class. For example: // // class MyClass { // private: // void MyMethod(); // FRIEND_TEST(MyClassTest, MyMethod); // }; // // class MyClassTest : public testing::Test { // // ... // }; // // TEST_F(MyClassTest, MyMethod) { // // Can call MyClass::MyMethod() here. // } #define FRIEND_TEST(test_case_name, test_name)\ friend class test_case_name##_##test_name##_Test #endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // #ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #include #include namespace testing { // A copyable object representing the result of a test part (i.e. an // assertion or an explicit FAIL(), ADD_FAILURE(), or SUCCESS()). // // Don't inherit from TestPartResult as its destructor is not virtual. class GTEST_API_ TestPartResult { public: // The possible outcomes of a test part (i.e. an assertion or an // explicit SUCCEED(), FAIL(), or ADD_FAILURE()). enum Type { kSuccess, // Succeeded. kNonFatalFailure, // Failed but the test can continue. kFatalFailure // Failed and the test should be terminated. }; // C'tor. TestPartResult does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestPartResult object. TestPartResult(Type a_type, const char* a_file_name, int a_line_number, const char* a_message) : type_(a_type), file_name_(a_file_name), line_number_(a_line_number), summary_(ExtractSummary(a_message)), message_(a_message) { } // Gets the outcome of the test part. Type type() const { return type_; } // Gets the name of the source file where the test part took place, or // NULL if it's unknown. const char* file_name() const { return file_name_.c_str(); } // Gets the line in the source file where the test part took place, // or -1 if it's unknown. int line_number() const { return line_number_; } // Gets the summary of the failure message. const char* summary() const { return summary_.c_str(); } // Gets the message associated with the test part. const char* message() const { return message_.c_str(); } // Returns true iff the test part passed. bool passed() const { return type_ == kSuccess; } // Returns true iff the test part failed. bool failed() const { return type_ != kSuccess; } // Returns true iff the test part non-fatally failed. bool nonfatally_failed() const { return type_ == kNonFatalFailure; } // Returns true iff the test part fatally failed. bool fatally_failed() const { return type_ == kFatalFailure; } private: Type type_; // Gets the summary of the failure message by omitting the stack // trace in it. static internal::String ExtractSummary(const char* message); // The name of the source file where the test part took place, or // NULL if the source file is unknown. internal::String file_name_; // The line in the source file where the test part took place, or -1 // if the line number is unknown. int line_number_; internal::String summary_; // The test failure summary. internal::String message_; // The test failure message. }; // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result); // An array of TestPartResult objects. // // Don't inherit from TestPartResultArray as its destructor is not // virtual. class GTEST_API_ TestPartResultArray { public: TestPartResultArray() {} // Appends the given TestPartResult to the array. void Append(const TestPartResult& result); // Returns the TestPartResult at the given index (0-based). const TestPartResult& GetTestPartResult(int index) const; // Returns the number of TestPartResult objects in the array. int size() const; private: std::vector array_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray); }; // This interface knows how to report a test part result. class TestPartResultReporterInterface { public: virtual ~TestPartResultReporterInterface() {} virtual void ReportTestPartResult(const TestPartResult& result) = 0; }; namespace internal { // This helper class is used by {ASSERT|EXPECT}_NO_FATAL_FAILURE to check if a // statement generates new fatal failures. To do so it registers itself as the // current test part result reporter. Besides checking if fatal failures were // reported, it only delegates the reporting to the former result reporter. // The original result reporter is restored in the destructor. // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. class GTEST_API_ HasNewFatalFailureHelper : public TestPartResultReporterInterface { public: HasNewFatalFailureHelper(); virtual ~HasNewFatalFailureHelper(); virtual void ReportTestPartResult(const TestPartResult& result); bool has_new_fatal_failure() const { return has_new_fatal_failure_; } private: bool has_new_fatal_failure_; TestPartResultReporterInterface* original_reporter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(HasNewFatalFailureHelper); }; } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // This header implements typed tests and type-parameterized tests. // Typed (aka type-driven) tests repeat the same test for types in a // list. You must know which types you want to test with when writing // typed tests. Here's how you do it: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { public: ... typedef std::list List; static T shared_; T value_; }; // Next, associate a list of types with the test case, which will be // repeated for each type in the list. The typedef is necessary for // the macro to parse correctly. typedef testing::Types MyTypes; TYPED_TEST_CASE(FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // TYPED_TEST_CASE(FooTest, int); // Then, use TYPED_TEST() instead of TEST_F() to define as many typed // tests for this test case as you want. TYPED_TEST(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. // Since we are inside a derived class template, C++ requires use to // visit the members of FooTest via 'this'. TypeParam n = this->value_; // To visit static members of the fixture, add the TestFixture:: // prefix. n += TestFixture::shared_; // To refer to typedefs in the fixture, add the "typename // TestFixture::" prefix. typename TestFixture::List values; values.push_back(n); ... } TYPED_TEST(FooTest, HasPropertyA) { ... } #endif // 0 // Type-parameterized tests are abstract test patterns parameterized // by a type. Compared with typed tests, type-parameterized tests // allow you to define the test pattern without knowing what the type // parameters are. The defined pattern can be instantiated with // different types any number of times, in any number of translation // units. // // If you are designing an interface or concept, you can define a // suite of type-parameterized tests to verify properties that any // valid implementation of the interface/concept should have. Then, // each implementation can easily instantiate the test suite to verify // that it conforms to the requirements, without having to write // similar tests repeatedly. Here's an example: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { ... }; // Next, declare that you will define a type-parameterized test case // (the _P suffix is for "parameterized" or "pattern", whichever you // prefer): TYPED_TEST_CASE_P(FooTest); // Then, use TYPED_TEST_P() to define as many type-parameterized tests // for this type-parameterized test case as you want. TYPED_TEST_P(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. TypeParam n = 0; ... } TYPED_TEST_P(FooTest, HasPropertyA) { ... } // Now the tricky part: you need to register all test patterns before // you can instantiate them. The first argument of the macro is the // test case name; the rest are the names of the tests in this test // case. REGISTER_TYPED_TEST_CASE_P(FooTest, DoesBlah, HasPropertyA); // Finally, you are free to instantiate the pattern with the types you // want. If you put the above code in a header file, you can #include // it in multiple C++ source files and instantiate it multiple times. // // To distinguish different instances of the pattern, the first // argument to the INSTANTIATE_* macro is a prefix that will be added // to the actual test case name. Remember to pick unique prefixes for // different instances. typedef testing::Types MyTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, int); #endif // 0 // Implements typed tests. #if GTEST_HAS_TYPED_TEST // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the typedef for the type parameters of the // given test case. # define GTEST_TYPE_PARAMS_(TestCaseName) gtest_type_params_##TestCaseName##_ // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define TYPED_TEST_CASE(CaseName, Types) \ typedef ::testing::internal::TypeList< Types >::type \ GTEST_TYPE_PARAMS_(CaseName) # define TYPED_TEST(CaseName, TestName) \ template \ class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \ : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTest< \ CaseName, \ ::testing::internal::TemplateSel< \ GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \ GTEST_TYPE_PARAMS_(CaseName)>::Register(\ "", #CaseName, #TestName, 0); \ template \ void GTEST_TEST_CLASS_NAME_(CaseName, TestName)::TestBody() #endif // GTEST_HAS_TYPED_TEST // Implements type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the namespace name that the type-parameterized tests for // the given type-parameterized test case are defined in. The exact // name of the namespace is subject to change without notice. # define GTEST_CASE_NAMESPACE_(TestCaseName) \ gtest_case_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the variable used to remember the names of // the defined tests in the given test case. # define GTEST_TYPED_TEST_CASE_P_STATE_(TestCaseName) \ gtest_typed_test_case_p_state_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE DIRECTLY. // // Expands to the name of the variable used to remember the names of // the registered tests in the given test case. # define GTEST_REGISTERED_TEST_NAMES_(TestCaseName) \ gtest_registered_test_names_##TestCaseName##_ // The variables defined in the type-parameterized test macros are // static as typically these macros are used in a .h file that can be // #included in multiple translation units linked together. # define TYPED_TEST_CASE_P(CaseName) \ static ::testing::internal::TypedTestCasePState \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName) # define TYPED_TEST_P(CaseName, TestName) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ template \ class TestName : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\ __FILE__, __LINE__, #CaseName, #TestName); \ } \ template \ void GTEST_CASE_NAMESPACE_(CaseName)::TestName::TestBody() # define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \ } \ static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\ __FILE__, __LINE__, #__VA_ARGS__) // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types) \ bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTestCase::type>::Register(\ #Prefix, #CaseName, GTEST_REGISTERED_TEST_NAMES_(CaseName)) #endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // Depending on the platform, different string classes are available. // On Linux, in addition to ::std::string, Google also makes use of // class ::string, which has the same interface as ::std::string, but // has a different implementation. // // The user can define GTEST_HAS_GLOBAL_STRING to 1 to indicate that // ::string is available AND is a distinct type to ::std::string, or // define it to 0 to indicate otherwise. // // If the user's ::std::string and ::string are the same class due to // aliasing, he should define GTEST_HAS_GLOBAL_STRING to 0. // // If the user doesn't define GTEST_HAS_GLOBAL_STRING, it is defined // heuristically. namespace testing { // Declares the flags. // This flag temporary enables the disabled tests. GTEST_DECLARE_bool_(also_run_disabled_tests); // This flag brings the debugger on an assertion failure. GTEST_DECLARE_bool_(break_on_failure); // This flag controls whether Google Test catches all test-thrown exceptions // and logs them as failures. GTEST_DECLARE_bool_(catch_exceptions); // This flag enables using colors in terminal output. Available values are // "yes" to enable colors, "no" (disable colors), or "auto" (the default) // to let Google Test decide. GTEST_DECLARE_string_(color); // This flag sets up the filter to select by name using a glob pattern // the tests to run. If the filter is not given all tests are executed. GTEST_DECLARE_string_(filter); // This flag causes the Google Test to list tests. None of the tests listed // are actually run if the flag is provided. GTEST_DECLARE_bool_(list_tests); // This flag controls whether Google Test emits a detailed XML report to a file // in addition to its normal textual output. GTEST_DECLARE_string_(output); // This flags control whether Google Test prints the elapsed time for each // test. GTEST_DECLARE_bool_(print_time); // This flag specifies the random number seed. GTEST_DECLARE_int32_(random_seed); // This flag sets how many times the tests are repeated. The default value // is 1. If the value is -1 the tests are repeating forever. GTEST_DECLARE_int32_(repeat); // This flag controls whether Google Test includes Google Test internal // stack frames in failure stack traces. GTEST_DECLARE_bool_(show_internal_stack_frames); // When this flag is specified, tests' order is randomized on every iteration. GTEST_DECLARE_bool_(shuffle); // This flag specifies the maximum number of stack frames to be // printed in a failure message. GTEST_DECLARE_int32_(stack_trace_depth); // When this flag is specified, a failed assertion will throw an // exception if exceptions are enabled, or exit the program with a // non-zero code otherwise. GTEST_DECLARE_bool_(throw_on_failure); // When this flag is set with a "host:port" string, on supported // platforms test results are streamed to the specified port on // the specified host machine. GTEST_DECLARE_string_(stream_result_to); // The upper limit for valid stack trace depths. const int kMaxStackTraceDepth = 100; namespace internal { class AssertHelper; class DefaultGlobalTestPartResultReporter; class ExecDeathTest; class NoExecDeathTest; class FinalSuccessChecker; class GTestFlagSaver; class TestResultAccessor; class TestEventListenersAccessor; class TestEventRepeater; class WindowsDeathTest; class UnitTestImpl* GetUnitTestImpl(); void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared in gtest-internal.h but defined here, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable) { return (Message() << streamable).GetString(); } } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest; // A class for indicating whether an assertion was successful. When // the assertion wasn't successful, the AssertionResult object // remembers a non-empty message that describes how it failed. // // To create an instance of this class, use one of the factory functions // (AssertionSuccess() and AssertionFailure()). // // This class is useful for two purposes: // 1. Defining predicate functions to be used with Boolean test assertions // EXPECT_TRUE/EXPECT_FALSE and their ASSERT_ counterparts // 2. Defining predicate-format functions to be // used with predicate assertions (ASSERT_PRED_FORMAT*, etc). // // For example, if you define IsEven predicate: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then the failed expectation EXPECT_TRUE(IsEven(Fib(5))) // will print the message // // Value of: IsEven(Fib(5)) // Actual: false (5 is odd) // Expected: true // // instead of a more opaque // // Value of: IsEven(Fib(5)) // Actual: false // Expected: true // // in case IsEven is a simple Boolean predicate. // // If you expect your predicate to be reused and want to support informative // messages in EXPECT_FALSE and ASSERT_FALSE (negative assertions show up // about half as often as positive ones in our tests), supply messages for // both success and failure cases: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess() << n << " is even"; // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then a statement EXPECT_FALSE(IsEven(Fib(6))) will print // // Value of: IsEven(Fib(6)) // Actual: true (8 is even) // Expected: false // // NB: Predicates that support negative Boolean assertions have reduced // performance in positive ones so be careful not to use them in tests // that have lots (tens of thousands) of positive Boolean assertions. // // To use this class with EXPECT_PRED_FORMAT assertions such as: // // // Verifies that Foo() returns an even number. // EXPECT_PRED_FORMAT1(IsEven, Foo()); // // you need to define: // // testing::AssertionResult IsEven(const char* expr, int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() // << "Expected: " << expr << " is even\n Actual: it's " << n; // } // // If Foo() returns 5, you will see the following message: // // Expected: Foo() is even // Actual: it's 5 // class GTEST_API_ AssertionResult { public: // Copy constructor. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult(const AssertionResult& other); // Used in the EXPECT_TRUE/FALSE(bool_expression). explicit AssertionResult(bool success) : success_(success) {} // Returns true iff the assertion succeeded. operator bool() const { return success_; } // NOLINT // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult operator!() const; // Returns the text streamed into this AssertionResult. Test assertions // use it when they fail (i.e., the predicate's outcome doesn't match the // assertion's expectation). When nothing has been streamed into the // object, returns an empty string. const char* message() const { return message_.get() != NULL ? message_->c_str() : ""; } // TODO(vladl@google.com): Remove this after making sure no clients use it. // Deprecated; please use message() instead. const char* failure_message() const { return message(); } // Streams a custom failure message into this object. template AssertionResult& operator<<(const T& value) { AppendMessage(Message() << value); return *this; } // Allows streaming basic output manipulators such as endl or flush into // this object. AssertionResult& operator<<( ::std::ostream& (*basic_manipulator)(::std::ostream& stream)) { AppendMessage(Message() << basic_manipulator); return *this; } private: // Appends the contents of message to message_. void AppendMessage(const Message& a_message) { if (message_.get() == NULL) message_.reset(new ::std::string); message_->append(a_message.GetString().c_str()); } // Stores result of the assertion predicate. bool success_; // Stores the message describing the condition in case the expectation // construct is not satisfied with the predicate's outcome. // Referenced via a pointer to avoid taking too much stack frame space // with test assertions. internal::scoped_ptr< ::std::string> message_; GTEST_DISALLOW_ASSIGN_(AssertionResult); }; // Makes a successful assertion result. GTEST_API_ AssertionResult AssertionSuccess(); // Makes a failed assertion result. GTEST_API_ AssertionResult AssertionFailure(); // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << msg. GTEST_API_ AssertionResult AssertionFailure(const Message& msg); // The abstract class that all tests inherit from. // // In Google Test, a unit test program contains one or many TestCases, and // each TestCase contains one or many Tests. // // When you define a test using the TEST macro, you don't need to // explicitly derive from Test - the TEST macro automatically does // this for you. // // The only time you derive from Test is when defining a test fixture // to be used a TEST_F. For example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { ... } // virtual void TearDown() { ... } // ... // }; // // TEST_F(FooTest, Bar) { ... } // TEST_F(FooTest, Baz) { ... } // // Test is not copyable. class GTEST_API_ Test { public: friend class TestInfo; // Defines types for pointers to functions that set up and tear down // a test case. typedef internal::SetUpTestCaseFunc SetUpTestCaseFunc; typedef internal::TearDownTestCaseFunc TearDownTestCaseFunc; // The d'tor is virtual as we intend to inherit from Test. virtual ~Test(); // Sets up the stuff shared by all tests in this test case. // // Google Test will call Foo::SetUpTestCase() before running the first // test in test case Foo. Hence a sub-class can define its own // SetUpTestCase() method to shadow the one defined in the super // class. static void SetUpTestCase() {} // Tears down the stuff shared by all tests in this test case. // // Google Test will call Foo::TearDownTestCase() after running the last // test in test case Foo. Hence a sub-class can define its own // TearDownTestCase() method to shadow the one defined in the super // class. static void TearDownTestCase() {} // Returns true iff the current test has a fatal failure. static bool HasFatalFailure(); // Returns true iff the current test has a non-fatal failure. static bool HasNonfatalFailure(); // Returns true iff the current test has a (either fatal or // non-fatal) failure. static bool HasFailure() { return HasFatalFailure() || HasNonfatalFailure(); } // Logs a property for the current test. Only the last value for a given // key is remembered. // These are public static so they can be called from utility functions // that are not members of the test fixture. // The arguments are const char* instead strings, as Google Test is used // on platforms where string doesn't compile. // // Note that a driving consideration for these RecordProperty methods // was to produce xml output suited to the Greenspan charting utility, // which at present will only chart values that fit in a 32-bit int. It // is the user's responsibility to restrict their values to 32-bit ints // if they intend them to be used with Greenspan. static void RecordProperty(const char* key, const char* value); static void RecordProperty(const char* key, int value); protected: // Creates a Test object. Test(); // Sets up the test fixture. virtual void SetUp(); // Tears down the test fixture. virtual void TearDown(); private: // Returns true iff the current test has the same fixture class as // the first test in the current test case. static bool HasSameFixtureClass(); // Runs the test after the test fixture has been set up. // // A sub-class must implement this to define the test logic. // // DO NOT OVERRIDE THIS FUNCTION DIRECTLY IN A USER PROGRAM. // Instead, use the TEST or TEST_F macro. virtual void TestBody() = 0; // Sets up, executes, and tears down the test. void Run(); // Deletes self. We deliberately pick an unusual name for this // internal method to avoid clashing with names used in user TESTs. void DeleteSelf_() { delete this; } // Uses a GTestFlagSaver to save and restore all Google Test flags. const internal::GTestFlagSaver* const gtest_flag_saver_; // Often a user mis-spells SetUp() as Setup() and spends a long time // wondering why it is never called by Google Test. The declaration of // the following method is solely for catching such an error at // compile time: // // - The return type is deliberately chosen to be not void, so it // will be a conflict if a user declares void Setup() in his test // fixture. // // - This method is private, so it will be another compiler error // if a user calls it from his test fixture. // // DO NOT OVERRIDE THIS FUNCTION. // // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } // We disallow copying Tests. GTEST_DISALLOW_COPY_AND_ASSIGN_(Test); }; typedef internal::TimeInMillis TimeInMillis; // A copyable object representing a user specified test property which can be // output as a key/value string pair. // // Don't inherit from TestProperty as its destructor is not virtual. class TestProperty { public: // C'tor. TestProperty does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestProperty object. TestProperty(const char* a_key, const char* a_value) : key_(a_key), value_(a_value) { } // Gets the user supplied key. const char* key() const { return key_.c_str(); } // Gets the user supplied value. const char* value() const { return value_.c_str(); } // Sets a new value, overriding the one supplied in the constructor. void SetValue(const char* new_value) { value_ = new_value; } private: // The key supplied by the user. internal::String key_; // The value supplied by the user. internal::String value_; }; // The result of a single Test. This includes a list of // TestPartResults, a list of TestProperties, a count of how many // death tests there are in the Test, and how much time it took to run // the Test. // // TestResult is not copyable. class GTEST_API_ TestResult { public: // Creates an empty TestResult. TestResult(); // D'tor. Do not inherit from TestResult. ~TestResult(); // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int total_part_count() const; // Returns the number of the test properties. int test_property_count() const; // Returns true iff the test passed (i.e. no test part failed). bool Passed() const { return !Failed(); } // Returns true iff the test failed. bool Failed() const; // Returns true iff the test fatally failed. bool HasFatalFailure() const; // Returns true iff the test has a non-fatal failure. bool HasNonfatalFailure() const; // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test part result among all the results. i can range // from 0 to test_property_count() - 1. If i is not in that range, aborts // the program. const TestPartResult& GetTestPartResult(int i) const; // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& GetTestProperty(int i) const; private: friend class TestInfo; friend class UnitTest; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::ExecDeathTest; friend class internal::TestResultAccessor; friend class internal::UnitTestImpl; friend class internal::WindowsDeathTest; // Gets the vector of TestPartResults. const std::vector& test_part_results() const { return test_part_results_; } // Gets the vector of TestProperties. const std::vector& test_properties() const { return test_properties_; } // Sets the elapsed time. void set_elapsed_time(TimeInMillis elapsed) { elapsed_time_ = elapsed; } // Adds a test property to the list. The property is validated and may add // a non-fatal failure if invalid (e.g., if it conflicts with reserved // key names). If a property is already recorded for the same key, the // value will be updated, rather than storing multiple values for the same // key. void RecordProperty(const TestProperty& test_property); // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. // TODO(russr): Validate attribute names are legal and human readable. static bool ValidateTestProperty(const TestProperty& test_property); // Adds a test part result to the list. void AddTestPartResult(const TestPartResult& test_part_result); // Returns the death test count. int death_test_count() const { return death_test_count_; } // Increments the death test count, returning the new count. int increment_death_test_count() { return ++death_test_count_; } // Clears the test part results. void ClearTestPartResults(); // Clears the object. void Clear(); // Protects mutable state of the property vector and of owned // properties, whose values may be updated. internal::Mutex test_properites_mutex_; // The vector of TestPartResults std::vector test_part_results_; // The vector of TestProperties std::vector test_properties_; // Running count of death tests. int death_test_count_; // The elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestResult. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestResult); }; // class TestResult // A TestInfo object stores the following information about a test: // // Test case name // Test name // Whether the test should be run // A function pointer that creates the test object when invoked // Test result // // The constructor of TestInfo registers itself with the UnitTest // singleton such that the RUN_ALL_TESTS() macro knows which tests to // run. class GTEST_API_ TestInfo { public: // Destructs a TestInfo object. This function is not virtual, so // don't inherit from TestInfo. ~TestInfo(); // Returns the test case name. const char* test_case_name() const { return test_case_name_.c_str(); } // Returns the test name. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a typed // or a type-parameterized test. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns the text representation of the value parameter, or NULL if this // is not a value-parameterized test. const char* value_param() const { if (value_param_.get() != NULL) return value_param_->c_str(); return NULL; } // Returns true if this test should run, that is if the test is not disabled // (or it is disabled but the also_run_disabled_tests flag has been specified) // and its full name matches the user-specified filter. // // Google Test allows the user to filter the tests by their full names. // The full name of a test Bar in test case Foo is defined as // "Foo.Bar". Only the tests that match the filter will run. // // A filter is a colon-separated list of glob (not regex) patterns, // optionally followed by a '-' and a colon-separated list of // negative patterns (tests to exclude). A test is run if it // matches one of the positive patterns and does not match any of // the negative patterns. // // For example, *A*:Foo.* is a filter that matches any string that // contains the character 'A' or starts with "Foo.". bool should_run() const { return should_run_; } // Returns the result of the test. const TestResult* result() const { return &result_; } private: #if GTEST_HAS_DEATH_TEST friend class internal::DefaultDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST friend class Test; friend class TestCase; friend class internal::UnitTestImpl; friend TestInfo* internal::MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, internal::TypeId fixture_class_id, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, internal::TestFactoryBase* factory); // Constructs a TestInfo object. The newly constructed instance assumes // ownership of the factory object. TestInfo(const char* test_case_name, const char* name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory); // Increments the number of death tests encountered in this test so // far. int increment_death_test_count() { return result_.increment_death_test_count(); } // Creates the test object, runs it, records its result, and then // deletes it. void Run(); static void ClearTestResult(TestInfo* test_info) { test_info->result_.Clear(); } // These fields are immutable properties of the test. const std::string test_case_name_; // Test case name const std::string name_; // Test name // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // Text representation of the value parameter, or NULL if this is not a // value-parameterized test. const internal::scoped_ptr value_param_; const internal::TypeId fixture_class_id_; // ID of the test fixture class bool should_run_; // True iff this test should run bool is_disabled_; // True iff this test is disabled bool matches_filter_; // True if this test matches the // user-specified filter. internal::TestFactoryBase* const factory_; // The factory that creates // the test object // This field is mutable and needs to be reset before running the // test for the second time. TestResult result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestInfo); }; // A test case, which consists of a vector of TestInfos. // // TestCase is not copyable. class GTEST_API_ TestCase { public: // Creates a TestCase with the given name. // // TestCase does NOT have a default constructor. Always use this // constructor to create a TestCase object. // // Arguments: // // name: name of the test case // a_type_param: the name of the test's type parameter, or NULL if // this is not a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase(const char* name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Destructor of TestCase. virtual ~TestCase(); // Gets the name of the TestCase. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a // type-parameterized test case. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns true if any test in this test case should run. bool should_run() const { return should_run_; } // Gets the number of successful tests in this test case. int successful_test_count() const; // Gets the number of failed tests in this test case. int failed_test_count() const; // Gets the number of disabled tests in this test case. int disabled_test_count() const; // Get the number of tests in this test case that should run. int test_to_run_count() const; // Gets the number of all tests in this test case. int total_test_count() const; // Returns true iff the test case passed. bool Passed() const { return !Failed(); } // Returns true iff the test case failed. bool Failed() const { return failed_test_count() > 0; } // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* GetTestInfo(int i) const; private: friend class Test; friend class internal::UnitTestImpl; // Gets the (mutable) vector of TestInfos in this TestCase. std::vector& test_info_list() { return test_info_list_; } // Gets the (immutable) vector of TestInfos in this TestCase. const std::vector& test_info_list() const { return test_info_list_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* GetMutableTestInfo(int i); // Sets the should_run member. void set_should_run(bool should) { should_run_ = should; } // Adds a TestInfo to this test case. Will delete the TestInfo upon // destruction of the TestCase object. void AddTestInfo(TestInfo * test_info); // Clears the results of all tests in this test case. void ClearResult(); // Clears the results of all tests in the given test case. static void ClearTestCaseResult(TestCase* test_case) { test_case->ClearResult(); } // Runs every test in this TestCase. void Run(); // Runs SetUpTestCase() for this TestCase. This wrapper is needed // for catching exceptions thrown from SetUpTestCase(). void RunSetUpTestCase() { (*set_up_tc_)(); } // Runs TearDownTestCase() for this TestCase. This wrapper is // needed for catching exceptions thrown from TearDownTestCase(). void RunTearDownTestCase() { (*tear_down_tc_)(); } // Returns true iff test passed. static bool TestPassed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Passed(); } // Returns true iff test failed. static bool TestFailed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Failed(); } // Returns true iff test is disabled. static bool TestDisabled(const TestInfo* test_info) { return test_info->is_disabled_; } // Returns true if the given test should run. static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. internal::String name_; // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // The vector of TestInfos in their original order. It owns the // elements in the vector. std::vector test_info_list_; // Provides a level of indirection for the test list to allow easy // shuffling and restoring the test order. The i-th element in this // vector is the index of the i-th test in the shuffled test list. std::vector test_indices_; // Pointer to the function that sets up the test case. Test::SetUpTestCaseFunc set_up_tc_; // Pointer to the function that tears down the test case. Test::TearDownTestCaseFunc tear_down_tc_; // True iff any test in this test case should run. bool should_run_; // Elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestCases. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestCase); }; // An Environment object is capable of setting up and tearing down an // environment. The user should subclass this to define his own // environment(s). // // An Environment object does the set-up and tear-down in virtual // methods SetUp() and TearDown() instead of the constructor and the // destructor, as: // // 1. You cannot safely throw from a destructor. This is a problem // as in some cases Google Test is used where exceptions are enabled, and // we may want to implement ASSERT_* using exceptions where they are // available. // 2. You cannot use ASSERT_* directly in a constructor or // destructor. class Environment { public: // The d'tor is virtual as we need to subclass Environment. virtual ~Environment() {} // Override this to define how to set up the environment. virtual void SetUp() {} // Override this to define how to tear down the environment. virtual void TearDown() {} private: // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } }; // The interface for tracing execution of tests. The methods are organized in // the order the corresponding events are fired. class TestEventListener { public: virtual ~TestEventListener() {} // Fired before any test activity starts. virtual void OnTestProgramStart(const UnitTest& unit_test) = 0; // Fired before each iteration of tests starts. There may be more than // one iteration if GTEST_FLAG(repeat) is set. iteration is the iteration // index, starting from 0. virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration) = 0; // Fired before environment set-up for each iteration of tests starts. virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test) = 0; // Fired after environment set-up for each iteration of tests ends. virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test) = 0; // Fired before the test case starts. virtual void OnTestCaseStart(const TestCase& test_case) = 0; // Fired before the test starts. virtual void OnTestStart(const TestInfo& test_info) = 0; // Fired after a failed assertion or a SUCCEED() invocation. virtual void OnTestPartResult(const TestPartResult& test_part_result) = 0; // Fired after the test ends. virtual void OnTestEnd(const TestInfo& test_info) = 0; // Fired after the test case ends. virtual void OnTestCaseEnd(const TestCase& test_case) = 0; // Fired before environment tear-down for each iteration of tests starts. virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test) = 0; // Fired after environment tear-down for each iteration of tests ends. virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test) = 0; // Fired after each iteration of tests finishes. virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration) = 0; // Fired after all test activities have ended. virtual void OnTestProgramEnd(const UnitTest& unit_test) = 0; }; // The convenience class for users who need to override just one or two // methods and are not concerned that a possible change to a signature of // the methods they override will not be caught during the build. For // comments about each method please see the definition of TestEventListener // above. class EmptyTestEventListener : public TestEventListener { public: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& /*test_case*/) {} virtual void OnTestStart(const TestInfo& /*test_info*/) {} virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {} virtual void OnTestEnd(const TestInfo& /*test_info*/) {} virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {} virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} }; // TestEventListeners lets users add listeners to track events in Google Test. class GTEST_API_ TestEventListeners { public: TestEventListeners(); ~TestEventListeners(); // Appends an event listener to the end of the list. Google Test assumes // the ownership of the listener (i.e. it will delete the listener when // the test program finishes). void Append(TestEventListener* listener); // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* Release(TestEventListener* listener); // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the caller and makes this // function return NULL the next time. TestEventListener* default_result_printer() const { return default_result_printer_; } // Returns the standard listener responsible for the default XML output // controlled by the --gtest_output=xml flag. Can be removed from the // listeners list by users who want to shut down the default XML output // controlled by this flag and substitute it with custom one. Note that // removing this object from the listener list with Release transfers its // ownership to the caller and makes this function return NULL the next // time. TestEventListener* default_xml_generator() const { return default_xml_generator_; } private: friend class TestCase; friend class TestInfo; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::NoExecDeathTest; friend class internal::TestEventListenersAccessor; friend class internal::UnitTestImpl; // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* repeater(); // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultResultPrinter(TestEventListener* listener); // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultXmlGenerator(TestEventListener* listener); // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool EventForwardingEnabled() const; void SuppressEventForwarding(); // The actual list of listeners. internal::TestEventRepeater* repeater_; // Listener responsible for the standard result output. TestEventListener* default_result_printer_; // Listener responsible for the creation of the XML output file. TestEventListener* default_xml_generator_; // We disallow copying TestEventListeners. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventListeners); }; // A UnitTest consists of a vector of TestCases. // // This is a singleton class. The only instance of UnitTest is // created when UnitTest::GetInstance() is first called. This // instance is never deleted. // // UnitTest is not copyable. // // This class is thread-safe as long as the methods are called // according to their specification. class GTEST_API_ UnitTest { public: // Gets the singleton UnitTest object. The first time this method // is called, a UnitTest object is constructed and returned. // Consecutive calls will return the same object. static UnitTest* GetInstance(); // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // This method can only be called from the main thread. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. int Run() GTEST_MUST_USE_RESULT_; // Returns the working directory when the first TEST() or TEST_F() // was executed. The UnitTest object owns the string. const char* original_working_dir() const; // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. const TestCase* current_test_case() const; // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. const TestInfo* current_test_info() const; // Returns the random seed used at the start of the current test run. int random_seed() const; #if GTEST_HAS_PARAM_TEST // Returns the ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::ParameterizedTestCaseRegistry& parameterized_test_registry(); #endif // GTEST_HAS_PARAM_TEST // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const; // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const; // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const; // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const; // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& listeners(); private: // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in // the order they were registered. After all tests in the program // have finished, all global test environments will be torn-down in // the *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // This method can only be called from the main thread. Environment* AddEnvironment(Environment* env); // Adds a TestPartResult to the current TestResult object. All // Google Test assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) // eventually call this to report their results. The user code // should use the assertion macros instead of calling this directly. void AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace); // Adds a TestProperty to the current TestResult object. If the result already // contains a property with the same key, the value will be updated. void RecordPropertyForCurrentTest(const char* key, const char* value); // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i); // Accessors for the implementation object. internal::UnitTestImpl* impl() { return impl_; } const internal::UnitTestImpl* impl() const { return impl_; } // These classes and funcions are friends as they need to access private // members of UnitTest. friend class Test; friend class internal::AssertHelper; friend class internal::ScopedTrace; friend Environment* AddGlobalTestEnvironment(Environment* env); friend internal::UnitTestImpl* internal::GetUnitTestImpl(); friend void internal::ReportFailureInUnknownLocation( TestPartResult::Type result_type, const internal::String& message); // Creates an empty UnitTest. UnitTest(); // D'tor virtual ~UnitTest(); // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. void PushGTestTrace(const internal::TraceInfo& trace); // Pops a trace from the per-thread Google Test trace stack. void PopGTestTrace(); // Protects mutable state in *impl_. This is mutable as some const // methods need to lock it too. mutable internal::Mutex mutex_; // Opaque implementation object. This field is never changed once // the object is constructed. We don't mark it as const here, as // doing so will cause a warning in the constructor of UnitTest. // Mutable state in *impl_ is protected by mutex_. internal::UnitTestImpl* impl_; // We disallow copying UnitTest. GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTest); }; // A convenient wrapper for adding an environment for the test // program. // // You should call this before RUN_ALL_TESTS() is called, probably in // main(). If you use gtest_main, you need to call this before main() // starts for it to take effect. For example, you can define a global // variable like this: // // testing::Environment* const foo_env = // testing::AddGlobalTestEnvironment(new FooEnvironment); // // However, we strongly recommend you to write your own main() and // call AddGlobalTestEnvironment() there, as relying on initialization // of global variables makes the code harder to read and may cause // problems when you register multiple environments from different // translation units and the environments have dependencies among them // (remember that the compiler doesn't guarantee the order in which // global variables from different translation units are initialized). inline Environment* AddGlobalTestEnvironment(Environment* env) { return UnitTest::GetInstance()->AddEnvironment(env); } // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. GTEST_API_ void InitGoogleTest(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. GTEST_API_ void InitGoogleTest(int* argc, wchar_t** argv); namespace internal { // Formats a comparison assertion (e.g. ASSERT_EQ, EXPECT_LT, and etc) // operand to be used in a failure message. The type (but not value) // of the other operand may affect the format. This allows us to // print a char* as a raw pointer when it is compared against another // char*, and print it as a C string when it is compared against an // std::string object, for example. // // The default implementation ignores the type of the other operand. // Some specialized versions are used to handle formatting wide or // narrow C strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template String FormatForComparisonFailureMessage(const T1& value, const T2& /* other_operand */) { // C++Builder compiles this incorrectly if the namespace isn't explicitly // given. return ::testing::PrintToString(value); } // The helper function for {ASSERT|EXPECT}_EQ. template AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4389) // Temporarily disables warning on // signed/unsigned mismatch. #endif if (expected == actual) { return AssertionSuccess(); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous enums // can be implicitly cast to BiggestInt. GTEST_API_ AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual); // The helper class for {ASSERT|EXPECT}_EQ. The template argument // lhs_is_null_literal is true iff the first argument to ASSERT_EQ() // is a null pointer literal. The following default implementation is // for lhs_is_null_literal being false. template class EqHelper { public: // This templatized version is for the general case. template static AssertionResult Compare(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous // enums can be implicitly cast to BiggestInt. // // Even though its body looks the same as the above version, we // cannot merge the two, as it will make anonymous enums unhappy. static AssertionResult Compare(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } }; // This specialization is used when the first argument to ASSERT_EQ() // is a null pointer literal, like NULL, false, or 0. template <> class EqHelper { public: // We define two overloaded versions of Compare(). The first // version will be picked when the second argument to ASSERT_EQ() is // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or // EXPECT_EQ(false, a_bool). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual, // The following line prevents this overload from being considered if T2 // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr) // expands to Compare("", "", NULL, my_ptr), which requires a conversion // to match the Secret* in the other overload, which would otherwise make // this template match better. typename EnableIf::value>::type* = 0) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // This version will be picked when the second argument to ASSERT_EQ() is a // pointer, e.g. ASSERT_EQ(NULL, a_pointer). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, // We used to have a second template parameter instead of Secret*. That // template parameter would deduce to 'long', making this a better match // than the first overload even without the first overload's EnableIf. // Unfortunately, gcc with -Wconversion-null warns when "passing NULL to // non-pointer argument" (even a deduced integral argument), so the old // implementation caused warnings in user code. Secret* /* expected (NULL) */, T* actual) { // We already know that 'expected' is a null pointer. return CmpHelperEQ(expected_expression, actual_expression, static_cast(NULL), actual); } }; // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_??. It is here just to avoid copy-and-paste // of similar code. // // For each templatized helper function, we also define an overloaded // version for BiggestInt in order to reduce code bloat and allow // anonymous enums to be used with {ASSERT|EXPECT}_?? when compiled // with gcc 4. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ template \ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ const T1& val1, const T2& val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ }\ GTEST_API_ AssertionResult CmpHelper##op_name(\ const char* expr1, const char* expr2, BiggestInt val1, BiggestInt val2) // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // Implements the helper function for {ASSERT|EXPECT}_NE GTEST_IMPL_CMP_HELPER_(NE, !=); // Implements the helper function for {ASSERT|EXPECT}_LE GTEST_IMPL_CMP_HELPER_(LE, <=); // Implements the helper function for {ASSERT|EXPECT}_LT GTEST_IMPL_CMP_HELPER_(LT, < ); // Implements the helper function for {ASSERT|EXPECT}_GE GTEST_IMPL_CMP_HELPER_(GE, >=); // Implements the helper function for {ASSERT|EXPECT}_GT GTEST_IMPL_CMP_HELPER_(GT, > ); #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRCASEEQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRNE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // The helper function for {ASSERT|EXPECT}_STRCASENE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // Helper function for *_STREQ on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual); // Helper function for *_STRNE on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2); } // namespace internal // IsSubstring() and IsNotSubstring() are intended to be used as the // first argument to {EXPECT,ASSERT}_PRED_FORMAT2(), not by // themselves. They check whether needle is a substring of haystack // (NULL is considered a substring of itself only), and return an // appropriate error message when they fail. // // The {needle,haystack}_expr arguments are the stringified // expressions that generated the two real arguments. GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); #if GTEST_HAS_STD_WSTRING GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); #endif // GTEST_HAS_STD_WSTRING namespace internal { // Helper template function for comparing floating-points. // // Template parameter: // // RawType: the raw floating-point type (either float or double) // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template AssertionResult CmpHelperFloatingPointEQ(const char* expected_expression, const char* actual_expression, RawType expected, RawType actual) { const FloatingPoint lhs(expected), rhs(actual); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } ::std::stringstream expected_ss; expected_ss << std::setprecision(std::numeric_limits::digits10 + 2) << expected; ::std::stringstream actual_ss; actual_ss << std::setprecision(std::numeric_limits::digits10 + 2) << actual; return EqFailure(expected_expression, actual_expression, StringStreamToString(&expected_ss), StringStreamToString(&actual_ss), false); } // Helper function for implementing ASSERT_NEAR. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error); // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // A class that enables one to stream messages to assertion macros class GTEST_API_ AssertHelper { public: // Constructor. AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message); ~AssertHelper(); // Message assignment is a semantic trick to enable assertion // streaming; see the GTEST_MESSAGE_ macro below. void operator=(const Message& message) const; private: // We put our data in a struct so that the size of the AssertHelper class can // be as small as possible. This is important because gcc is incapable of // re-using stack space even for temporary variables, so every EXPECT_EQ // reserves stack space for another AssertHelper. struct AssertHelperData { AssertHelperData(TestPartResult::Type t, const char* srcfile, int line_num, const char* msg) : type(t), file(srcfile), line(line_num), message(msg) { } TestPartResult::Type const type; const char* const file; int const line; String const message; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelperData); }; AssertHelperData* const data_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelper); }; } // namespace internal #if GTEST_HAS_PARAM_TEST // The pure interface class that all value-parameterized tests inherit from. // A value-parameterized class must inherit from both ::testing::Test and // ::testing::WithParamInterface. In most cases that just means inheriting // from ::testing::TestWithParam, but more complicated test hierarchies // may need to inherit from Test and WithParamInterface at different levels. // // This interface has support for accessing the test parameter value via // the GetParam() method. // // Use it with one of the parameter generator defining functions, like Range(), // Values(), ValuesIn(), Bool(), and Combine(). // // class FooTest : public ::testing::TestWithParam { // protected: // FooTest() { // // Can use GetParam() here. // } // virtual ~FooTest() { // // Can use GetParam() here. // } // virtual void SetUp() { // // Can use GetParam() here. // } // virtual void TearDown { // // Can use GetParam() here. // } // }; // TEST_P(FooTest, DoesBar) { // // Can use GetParam() method here. // Foo foo; // ASSERT_TRUE(foo.DoesBar(GetParam())); // } // INSTANTIATE_TEST_CASE_P(OneToTenRange, FooTest, ::testing::Range(1, 10)); template class WithParamInterface { public: typedef T ParamType; virtual ~WithParamInterface() {} // The current parameter value. Is also available in the test fixture's // constructor. This member function is non-static, even though it only // references static data, to reduce the opportunity for incorrect uses // like writing 'WithParamInterface::GetParam()' for a test that // uses a fixture whose parameter type is int. const ParamType& GetParam() const { return *parameter_; } private: // Sets parameter value. The caller is responsible for making sure the value // remains alive and unchanged throughout the current test. static void SetParam(const ParamType* parameter) { parameter_ = parameter; } // Static value used for accessing parameter during a test lifetime. static const ParamType* parameter_; // TestClass must be a subclass of WithParamInterface and Test. template friend class internal::ParameterizedTestFactory; }; template const T* WithParamInterface::parameter_ = NULL; // Most value-parameterized classes can ignore the existence of // WithParamInterface, and can just inherit from ::testing::TestWithParam. template class TestWithParam : public Test, public WithParamInterface { }; #endif // GTEST_HAS_PARAM_TEST // Macros for indicating success/failure in test code. // ADD_FAILURE unconditionally adds a failure to the current test. // SUCCEED generates a success - it doesn't automatically make the // current test successful, as a test is only successful when it has // no failure. // // EXPECT_* verifies that a certain condition is satisfied. If not, // it behaves like ADD_FAILURE. In particular: // // EXPECT_TRUE verifies that a Boolean condition is true. // EXPECT_FALSE verifies that a Boolean condition is false. // // FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except // that they will also abort the current function on failure. People // usually want the fail-fast behavior of FAIL and ASSERT_*, but those // writing data-driven tests often find themselves using ADD_FAILURE // and EXPECT_* more. // // Examples: // // EXPECT_TRUE(server.StatusIsOK()); // ASSERT_FALSE(server.HasPendingRequest(port)) // << "There are still pending requests " << "on port " << port; // Generates a nonfatal failure with a generic message. #define ADD_FAILURE() GTEST_NONFATAL_FAILURE_("Failed") // Generates a nonfatal failure at the given source file location with // a generic message. #define ADD_FAILURE_AT(file, line) \ GTEST_MESSAGE_AT_(file, line, "Failed", \ ::testing::TestPartResult::kNonFatalFailure) // Generates a fatal failure with a generic message. #define GTEST_FAIL() GTEST_FATAL_FAILURE_("Failed") // Define this macro to 1 to omit the definition of FAIL(), which is a // generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_FAIL # define FAIL() GTEST_FAIL() #endif // Generates a success with a generic message. #define GTEST_SUCCEED() GTEST_SUCCESS_("Succeeded") // Define this macro to 1 to omit the definition of SUCCEED(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_SUCCEED # define SUCCEED() GTEST_SUCCEED() #endif // Macros for testing exceptions. // // * {ASSERT|EXPECT}_THROW(statement, expected_exception): // Tests that the statement throws the expected exception. // * {ASSERT|EXPECT}_NO_THROW(statement): // Tests that the statement doesn't throw any exception. // * {ASSERT|EXPECT}_ANY_THROW(statement): // Tests that the statement throws an exception. #define EXPECT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_NONFATAL_FAILURE_) #define EXPECT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define EXPECT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define ASSERT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_FATAL_FAILURE_) #define ASSERT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_FATAL_FAILURE_) #define ASSERT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_FATAL_FAILURE_) // Boolean assertions. Condition can be either a Boolean expression or an // AssertionResult. For more information on how to use AssertionResult with // these macros see comments on that class. #define EXPECT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_NONFATAL_FAILURE_) #define EXPECT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_NONFATAL_FAILURE_) #define ASSERT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_FATAL_FAILURE_) #define ASSERT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_FATAL_FAILURE_) // Includes the auto-generated header that implements a family of // generic predicate assertion macros. // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on 09/24/2010 by command // 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! // // Implements a family of generic predicate assertion macros. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Makes sure this header is not included before gtest.h. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ # error Do not include gtest_pred_impl.h directly. Include gtest.h instead. #endif // GTEST_INCLUDE_GTEST_GTEST_H_ // This header implements a family of generic predicate assertion // macros: // // ASSERT_PRED_FORMAT1(pred_format, v1) // ASSERT_PRED_FORMAT2(pred_format, v1, v2) // ... // // where pred_format is a function or functor that takes n (in the // case of ASSERT_PRED_FORMATn) values and their source expression // text, and returns a testing::AssertionResult. See the definition // of ASSERT_EQ in gtest.h for an example. // // If you don't care about formatting, you can use the more // restrictive version: // // ASSERT_PRED1(pred, v1) // ASSERT_PRED2(pred, v1, v2) // ... // // where pred is an n-ary function or functor that returns bool, // and the values v1, v2, ..., must support the << operator for // streaming to std::ostream. // // We also define the EXPECT_* variations. // // For now we only support predicates whose arity is at most 5. // Please email googletestframework@googlegroups.com if you need // support for higher arities. // GTEST_ASSERT_ is the basic statement to which all of the assertions // in this file reduce. Don't use this in your code. #define GTEST_ASSERT_(expression, on_failure) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar = (expression)) \ ; \ else \ on_failure(gtest_ar.failure_message()) // Helper function for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. template AssertionResult AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) { if (pred(v1)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT1. // Don't use this in your code. #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ GTEST_ASSERT_(pred_format(#v1, v1),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. #define GTEST_PRED1_(pred, v1, on_failure)\ GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ #v1, \ pred, \ v1), on_failure) // Unary predicate assertion macros. #define EXPECT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_FATAL_FAILURE_) #define ASSERT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. template AssertionResult AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) { if (pred(v1, v2)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT2. // Don't use this in your code. #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. #define GTEST_PRED2_(pred, v1, v2, on_failure)\ GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, \ #v1, \ #v2, \ pred, \ v1, \ v2), on_failure) // Binary predicate assertion macros. #define EXPECT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_FATAL_FAILURE_) #define ASSERT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. template AssertionResult AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) { if (pred(v1, v2, v3)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT3. // Don't use this in your code. #define GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, v1, v2, v3),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ GTEST_ASSERT_(::testing::AssertPred3Helper(#pred, \ #v1, \ #v2, \ #v3, \ pred, \ v1, \ v2, \ v3), on_failure) // Ternary predicate assertion macros. #define EXPECT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_FATAL_FAILURE_) #define ASSERT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. template AssertionResult AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) { if (pred(v1, v2, v3, v4)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT4. // Don't use this in your code. #define GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, v1, v2, v3, v4),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. #define GTEST_PRED4_(pred, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(::testing::AssertPred4Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ pred, \ v1, \ v2, \ v3, \ v4), on_failure) // 4-ary predicate assertion macros. #define EXPECT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) #define ASSERT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. template AssertionResult AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { if (pred(v1, v2, v3, v4, v5)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ", " << e5 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4 << "\n" << e5 << " evaluates to " << v5; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT5. // Don't use this in your code. #define GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, #v5, v1, v2, v3, v4, v5),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. #define GTEST_PRED5_(pred, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(::testing::AssertPred5Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ #v5, \ pred, \ v1, \ v2, \ v3, \ v4, \ v5), on_failure) // 5-ary predicate assertion macros. #define EXPECT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #define ASSERT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Macros for testing equalities and inequalities. // // * {ASSERT|EXPECT}_EQ(expected, actual): Tests that expected == actual // * {ASSERT|EXPECT}_NE(v1, v2): Tests that v1 != v2 // * {ASSERT|EXPECT}_LT(v1, v2): Tests that v1 < v2 // * {ASSERT|EXPECT}_LE(v1, v2): Tests that v1 <= v2 // * {ASSERT|EXPECT}_GT(v1, v2): Tests that v1 > v2 // * {ASSERT|EXPECT}_GE(v1, v2): Tests that v1 >= v2 // // When they are not, Google Test prints both the tested expressions and // their actual values. The values must be compatible built-in types, // or you will get a compiler error. By "compatible" we mean that the // values can be compared by the respective operator. // // Note: // // 1. It is possible to make a user-defined type work with // {ASSERT|EXPECT}_??(), but that requires overloading the // comparison operators and is thus discouraged by the Google C++ // Usage Guide. Therefore, you are advised to use the // {ASSERT|EXPECT}_TRUE() macro to assert that two objects are // equal. // // 2. The {ASSERT|EXPECT}_??() macros do pointer comparisons on // pointers (in particular, C strings). Therefore, if you use it // with two C strings, you are testing how their locations in memory // are related, not how their content is related. To compare two C // strings by content, use {ASSERT|EXPECT}_STR*(). // // 3. {ASSERT|EXPECT}_EQ(expected, actual) is preferred to // {ASSERT|EXPECT}_TRUE(expected == actual), as the former tells you // what the actual value is when it fails, and similarly for the // other comparisons. // // 4. Do not depend on the order in which {ASSERT|EXPECT}_??() // evaluate their arguments, which is undefined. // // 5. These macros evaluate their arguments exactly once. // // Examples: // // EXPECT_NE(5, Foo()); // EXPECT_EQ(NULL, a_pointer); // ASSERT_LT(i, array_size); // ASSERT_GT(records.size(), 0) << "There is no record left."; #define EXPECT_EQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define EXPECT_NE(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperNE, expected, actual) #define EXPECT_LE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define EXPECT_LT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define EXPECT_GE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define EXPECT_GT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) #define GTEST_ASSERT_EQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define GTEST_ASSERT_NE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperNE, val1, val2) #define GTEST_ASSERT_LE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define GTEST_ASSERT_LT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define GTEST_ASSERT_GE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define GTEST_ASSERT_GT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) // Define macro GTEST_DONT_DEFINE_ASSERT_XY to 1 to omit the definition of // ASSERT_XY(), which clashes with some users' own code. #if !GTEST_DONT_DEFINE_ASSERT_EQ # define ASSERT_EQ(val1, val2) GTEST_ASSERT_EQ(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_NE # define ASSERT_NE(val1, val2) GTEST_ASSERT_NE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LE # define ASSERT_LE(val1, val2) GTEST_ASSERT_LE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LT # define ASSERT_LT(val1, val2) GTEST_ASSERT_LT(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GE # define ASSERT_GE(val1, val2) GTEST_ASSERT_GE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GT # define ASSERT_GT(val1, val2) GTEST_ASSERT_GT(val1, val2) #endif // C String Comparisons. All tests treat NULL and any non-NULL string // as different. Two NULLs are equal. // // * {ASSERT|EXPECT}_STREQ(s1, s2): Tests that s1 == s2 // * {ASSERT|EXPECT}_STRNE(s1, s2): Tests that s1 != s2 // * {ASSERT|EXPECT}_STRCASEEQ(s1, s2): Tests that s1 == s2, ignoring case // * {ASSERT|EXPECT}_STRCASENE(s1, s2): Tests that s1 != s2, ignoring case // // For wide or narrow string objects, you can use the // {ASSERT|EXPECT}_??() macros. // // Don't depend on the order in which the arguments are evaluated, // which is undefined. // // These macros evaluate their arguments exactly once. #define EXPECT_STREQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define EXPECT_STRNE(s1, s2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define EXPECT_STRCASEEQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define EXPECT_STRCASENE(s1, s2)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) #define ASSERT_STREQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define ASSERT_STRNE(s1, s2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define ASSERT_STRCASEEQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define ASSERT_STRCASENE(s1, s2)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) // Macros for comparing floating-point numbers. // // * {ASSERT|EXPECT}_FLOAT_EQ(expected, actual): // Tests that two float values are almost equal. // * {ASSERT|EXPECT}_DOUBLE_EQ(expected, actual): // Tests that two double values are almost equal. // * {ASSERT|EXPECT}_NEAR(v1, v2, abs_error): // Tests that v1 and v2 are within the given distance to each other. // // Google Test uses ULP-based comparison to automatically pick a default // error bound that is appropriate for the operands. See the // FloatingPoint template class in gtest-internal.h if you are // interested in the implementation details. #define EXPECT_FLOAT_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_DOUBLE_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_FLOAT_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_DOUBLE_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_NEAR(val1, val2, abs_error)\ EXPECT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) #define ASSERT_NEAR(val1, val2, abs_error)\ ASSERT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) // These predicate format functions work on floating-point values, and // can be used in {ASSERT|EXPECT}_PRED_FORMAT2*(), e.g. // // EXPECT_PRED_FORMAT2(testing::DoubleLE, Foo(), 5.0); // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. GTEST_API_ AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2); GTEST_API_ AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2); #if GTEST_OS_WINDOWS // Macros that test for HRESULT failure and success, these are only useful // on Windows, and rely on Windows SDK macros and APIs to compile. // // * {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}(expr) // // When expr unexpectedly fails or succeeds, Google Test prints the // expected result and the actual result with both a human-readable // string representation of the error, if available, as well as the // hex result code. # define EXPECT_HRESULT_SUCCEEDED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define ASSERT_HRESULT_SUCCEEDED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define EXPECT_HRESULT_FAILED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) # define ASSERT_HRESULT_FAILED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) #endif // GTEST_OS_WINDOWS // Macros that execute statement and check that it doesn't generate new fatal // failures in the current thread. // // * {ASSERT|EXPECT}_NO_FATAL_FAILURE(statement); // // Examples: // // EXPECT_NO_FATAL_FAILURE(Process()); // ASSERT_NO_FATAL_FAILURE(Process()) << "Process() failed"; // #define ASSERT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_FATAL_FAILURE_) #define EXPECT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_NONFATAL_FAILURE_) // Causes a trace (including the source file path, the current line // number, and the given message) to be included in every test failure // message generated by code in the current scope. The effect is // undone when the control leaves the current scope. // // The message argument can be anything streamable to std::ostream. // // In the implementation, we include the current line number as part // of the dummy variable name, thus allowing multiple SCOPED_TRACE()s // to appear in the same block - as long as they are on different // lines. #define SCOPED_TRACE(message) \ ::testing::internal::ScopedTrace GTEST_CONCAT_TOKEN_(gtest_trace_, __LINE__)(\ __FILE__, __LINE__, ::testing::Message() << (message)) // Compile-time assertion for type equality. // StaticAssertTypeEq() compiles iff type1 and type2 are // the same type. The value it returns is not interesting. // // Instead of making StaticAssertTypeEq a class template, we make it a // function template that invokes a helper class template. This // prevents a user from misusing StaticAssertTypeEq by // defining objects of that type. // // CAVEAT: // // When used inside a method of a class template, // StaticAssertTypeEq() is effective ONLY IF the method is // instantiated. For example, given: // // template class Foo { // public: // void Bar() { testing::StaticAssertTypeEq(); } // }; // // the code: // // void Test1() { Foo foo; } // // will NOT generate a compiler error, as Foo::Bar() is never // actually instantiated. Instead, you need: // // void Test2() { Foo foo; foo.Bar(); } // // to cause a compiler error. template bool StaticAssertTypeEq() { (void)internal::StaticAssertTypeEqHelper(); return true; } // Defines a test. // // The first parameter is the name of the test case, and the second // parameter is the name of the test within the test case. // // The convention is to end the test case name with "Test". For // example, a test case for the Foo class can be named FooTest. // // The user should put his test code between braces after using this // macro. Example: // // TEST(FooTest, InitializesCorrectly) { // Foo foo; // EXPECT_TRUE(foo.StatusIsOK()); // } // Note that we call GetTestTypeId() instead of GetTypeId< // ::testing::Test>() here to get the type ID of testing::Test. This // is to work around a suspected linker bug when using Google Test as // a framework on Mac OS X. The bug causes GetTypeId< // ::testing::Test>() to return different values depending on whether // the call is from the Google Test framework itself or from user test // code. GetTestTypeId() is guaranteed to always return the same // value, as it always calls GetTypeId<>() from the Google Test // framework. #define GTEST_TEST(test_case_name, test_name)\ GTEST_TEST_(test_case_name, test_name, \ ::testing::Test, ::testing::internal::GetTestTypeId()) // Define this macro to 1 to omit the definition of TEST(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_TEST # define TEST(test_case_name, test_name) GTEST_TEST(test_case_name, test_name) #endif // Defines a test that uses a test fixture. // // The first parameter is the name of the test fixture class, which // also doubles as the test case name. The second parameter is the // name of the test within the test case. // // A test fixture class must be declared earlier. The user should put // his test code between braces after using this macro. Example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { b_.AddElement(3); } // // Foo a_; // Foo b_; // }; // // TEST_F(FooTest, InitializesCorrectly) { // EXPECT_TRUE(a_.StatusIsOK()); // } // // TEST_F(FooTest, ReturnsElementCountCorrectly) { // EXPECT_EQ(0, a_.size()); // EXPECT_EQ(1, b_.size()); // } #define TEST_F(test_fixture, test_name)\ GTEST_TEST_(test_fixture, test_name, test_fixture, \ ::testing::internal::GetTypeId()) // Use this macro in main() to run all tests. It returns 0 if all // tests are successful, or 1 otherwise. // // RUN_ALL_TESTS() should be invoked after the command line has been // parsed by InitGoogleTest(). #define RUN_ALL_TESTS()\ (::testing::UnitTest::GetInstance()->Run()) } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/fused-src/gtest/gtest_main.cc0000600000175000017500000000335411561126632025127 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. #include #include "gtest/gtest.h" GTEST_API_ int main(int argc, char **argv) { std::cout << "Running main() from gtest_main.cc\n"; testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/include/0000700000175000017500000000000012140644175021062 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/0000700000175000017500000000000012140644175022210 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-death-test.h0000600000175000017500000002554511561126632025563 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for death tests. It is // #included by gtest.h so a user doesn't need to include this // directly. #ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ #include "gtest/internal/gtest-death-test-internal.h" namespace testing { // This flag controls the style of death tests. Valid values are "threadsafe", // meaning that the death test child process will re-execute the test binary // from the start, running only a single death test, or "fast", // meaning that the child process will execute the test logic immediately // after forking. GTEST_DECLARE_string_(death_test_style); #if GTEST_HAS_DEATH_TEST // The following macros are useful for writing death tests. // Here's what happens when an ASSERT_DEATH* or EXPECT_DEATH* is // executed: // // 1. It generates a warning if there is more than one active // thread. This is because it's safe to fork() or clone() only // when there is a single thread. // // 2. The parent process clone()s a sub-process and runs the death // test in it; the sub-process exits with code 0 at the end of the // death test, if it hasn't exited already. // // 3. The parent process waits for the sub-process to terminate. // // 4. The parent process checks the exit code and error message of // the sub-process. // // Examples: // // ASSERT_DEATH(server.SendMessage(56, "Hello"), "Invalid port number"); // for (int i = 0; i < 5; i++) { // EXPECT_DEATH(server.ProcessRequest(i), // "Invalid request .* in ProcessRequest()") // << "Failed to die on request " << i); // } // // ASSERT_EXIT(server.ExitNow(), ::testing::ExitedWithCode(0), "Exiting"); // // bool KilledBySIGHUP(int exit_code) { // return WIFSIGNALED(exit_code) && WTERMSIG(exit_code) == SIGHUP; // } // // ASSERT_EXIT(client.HangUpServer(), KilledBySIGHUP, "Hanging up!"); // // On the regular expressions used in death tests: // // On POSIX-compliant systems (*nix), we use the library, // which uses the POSIX extended regex syntax. // // On other platforms (e.g. Windows), we only support a simple regex // syntax implemented as part of Google Test. This limited // implementation should be enough most of the time when writing // death tests; though it lacks many features you can find in PCRE // or POSIX extended regex syntax. For example, we don't support // union ("x|y"), grouping ("(xy)"), brackets ("[xy]"), and // repetition count ("x{5,7}"), among others. // // Below is the syntax that we do support. We chose it to be a // subset of both PCRE and POSIX extended regex, so it's easy to // learn wherever you come from. In the following: 'A' denotes a // literal character, period (.), or a single \\ escape sequence; // 'x' and 'y' denote regular expressions; 'm' and 'n' are for // natural numbers. // // c matches any literal character c // \\d matches any decimal digit // \\D matches any character that's not a decimal digit // \\f matches \f // \\n matches \n // \\r matches \r // \\s matches any ASCII whitespace, including \n // \\S matches any character that's not a whitespace // \\t matches \t // \\v matches \v // \\w matches any letter, _, or decimal digit // \\W matches any character that \\w doesn't match // \\c matches any literal character c, which must be a punctuation // . matches any single character except \n // A? matches 0 or 1 occurrences of A // A* matches 0 or many occurrences of A // A+ matches 1 or many occurrences of A // ^ matches the beginning of a string (not that of each line) // $ matches the end of a string (not that of each line) // xy matches x followed by y // // If you accidentally use PCRE or POSIX extended regex features // not implemented by us, you will get a run-time failure. In that // case, please try to rewrite your regular expression within the // above syntax. // // This implementation is *not* meant to be as highly tuned or robust // as a compiled regex library, but should perform well enough for a // death test, which already incurs significant overhead by launching // a child process. // // Known caveats: // // A "threadsafe" style death test obtains the path to the test // program from argv[0] and re-executes it in the sub-process. For // simplicity, the current implementation doesn't search the PATH // when launching the sub-process. This means that the user must // invoke the test program via a path that contains at least one // path separator (e.g. path/to/foo_test and // /absolute/path/to/bar_test are fine, but foo_test is not). This // is rarely a problem as people usually don't put the test binary // directory in PATH. // // TODO(wan@google.com): make thread-safe death tests search the PATH. // Asserts that a given statement causes the program to exit, with an // integer exit status that satisfies predicate, and emitting error output // that matches regex. # define ASSERT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_FATAL_FAILURE_) // Like ASSERT_EXIT, but continues on to successive tests in the // test case, if any: # define EXPECT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_NONFATAL_FAILURE_) // Asserts that a given statement causes the program to exit, either by // explicitly exiting with a nonzero exit code or being killed by a // signal, and emitting error output that matches regex. # define ASSERT_DEATH(statement, regex) \ ASSERT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Like ASSERT_DEATH, but continues on to successive tests in the // test case, if any: # define EXPECT_DEATH(statement, regex) \ EXPECT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Two predicate classes that can be used in {ASSERT,EXPECT}_EXIT*: // Tests that an exit code describes a normal exit with a given exit code. class GTEST_API_ ExitedWithCode { public: explicit ExitedWithCode(int exit_code); bool operator()(int exit_status) const; private: // No implementation - assignment is unsupported. void operator=(const ExitedWithCode& other); const int exit_code_; }; # if !GTEST_OS_WINDOWS // Tests that an exit code describes an exit due to termination by a // given signal. class GTEST_API_ KilledBySignal { public: explicit KilledBySignal(int signum); bool operator()(int exit_status) const; private: const int signum_; }; # endif // !GTEST_OS_WINDOWS // EXPECT_DEBUG_DEATH asserts that the given statements die in debug mode. // The death testing framework causes this to have interesting semantics, // since the sideeffects of the call are only visible in opt mode, and not // in debug mode. // // In practice, this can be used to test functions that utilize the // LOG(DFATAL) macro using the following style: // // int DieInDebugOr12(int* sideeffect) { // if (sideeffect) { // *sideeffect = 12; // } // LOG(DFATAL) << "death"; // return 12; // } // // TEST(TestCase, TestDieOr12WorksInDgbAndOpt) { // int sideeffect = 0; // // Only asserts in dbg. // EXPECT_DEBUG_DEATH(DieInDebugOr12(&sideeffect), "death"); // // #ifdef NDEBUG // // opt-mode has sideeffect visible. // EXPECT_EQ(12, sideeffect); // #else // // dbg-mode no visible sideeffect. // EXPECT_EQ(0, sideeffect); // #endif // } // // This will assert that DieInDebugReturn12InOpt() crashes in debug // mode, usually due to a DCHECK or LOG(DFATAL), but returns the // appropriate fallback value (12 in this case) in opt mode. If you // need to test that a function has appropriate side-effects in opt // mode, include assertions against the side-effects. A general // pattern for this is: // // EXPECT_DEBUG_DEATH({ // // Side-effects here will have an effect after this statement in // // opt mode, but none in debug mode. // EXPECT_EQ(12, DieInDebugOr12(&sideeffect)); // }, "death"); // # ifdef NDEBUG # define EXPECT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # define ASSERT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # else # define EXPECT_DEBUG_DEATH(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEBUG_DEATH(statement, regex) \ ASSERT_DEATH(statement, regex) # endif // NDEBUG for EXPECT_DEBUG_DEATH #endif // GTEST_HAS_DEATH_TEST // EXPECT_DEATH_IF_SUPPORTED(statement, regex) and // ASSERT_DEATH_IF_SUPPORTED(statement, regex) expand to real death tests if // death tests are supported; otherwise they just issue a warning. This is // useful when you are combining death test assertions with normal test // assertions in one test. #if GTEST_HAS_DEATH_TEST # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ ASSERT_DEATH(statement, regex) #else # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, ) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, return) #endif } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-message.h0000600000175000017500000002031311561126632025131 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the Message class. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! #ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #include #include "gtest/internal/gtest-string.h" #include "gtest/internal/gtest-internal.h" namespace testing { // The Message class works like an ostream repeater. // // Typical usage: // // 1. You stream a bunch of values to a Message object. // It will remember the text in a stringstream. // 2. Then you stream the Message object to an ostream. // This causes the text in the Message to be streamed // to the ostream. // // For example; // // testing::Message foo; // foo << 1 << " != " << 2; // std::cout << foo; // // will print "1 != 2". // // Message is not intended to be inherited from. In particular, its // destructor is not virtual. // // Note that stringstream behaves differently in gcc and in MSVC. You // can stream a NULL char pointer to it in the former, but not in the // latter (it causes an access violation if you do). The Message // class hides this difference by treating a NULL char pointer as // "(null)". class GTEST_API_ Message { private: // The type of basic IO manipulators (endl, ends, and flush) for // narrow streams. typedef std::ostream& (*BasicNarrowIoManip)(std::ostream&); public: // Constructs an empty Message. // We allocate the stringstream separately because otherwise each use of // ASSERT/EXPECT in a procedure adds over 200 bytes to the procedure's // stack frame leading to huge stack frames in some cases; gcc does not reuse // the stack space. Message() : ss_(new ::std::stringstream) { // By default, we want there to be enough precision when printing // a double to a Message. *ss_ << std::setprecision(std::numeric_limits::digits10 + 2); } // Copy constructor. Message(const Message& msg) : ss_(new ::std::stringstream) { // NOLINT *ss_ << msg.GetString(); } // Constructs a Message from a C-string. explicit Message(const char* str) : ss_(new ::std::stringstream) { *ss_ << str; } #if GTEST_OS_SYMBIAN // Streams a value (either a pointer or not) to this object. template inline Message& operator <<(const T& value) { StreamHelper(typename internal::is_pointer::type(), value); return *this; } #else // Streams a non-pointer value to this object. template inline Message& operator <<(const T& val) { ::GTestStreamToHelper(ss_.get(), val); return *this; } // Streams a pointer value to this object. // // This function is an overload of the previous one. When you // stream a pointer to a Message, this definition will be used as it // is more specialized. (The C++ Standard, section // [temp.func.order].) If you stream a non-pointer, then the // previous definition will be used. // // The reason for this overload is that streaming a NULL pointer to // ostream is undefined behavior. Depending on the compiler, you // may get "0", "(nil)", "(null)", or an access violation. To // ensure consistent result across compilers, we always treat NULL // as "(null)". template inline Message& operator <<(T* const& pointer) { // NOLINT if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } return *this; } #endif // GTEST_OS_SYMBIAN // Since the basic IO manipulators are overloaded for both narrow // and wide streams, we have to provide this specialized definition // of operator <<, even though its body is the same as the // templatized version above. Without this definition, streaming // endl or other basic IO manipulators to Message will confuse the // compiler. Message& operator <<(BasicNarrowIoManip val) { *ss_ << val; return *this; } // Instead of 1/0, we want to see true/false for bool values. Message& operator <<(bool b) { return *this << (b ? "true" : "false"); } // These two overloads allow streaming a wide C string to a Message // using the UTF-8 encoding. Message& operator <<(const wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } Message& operator <<(wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::std::wstring& wstr); #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::wstring& wstr); #endif // GTEST_HAS_GLOBAL_WSTRING // Gets the text streamed to this object so far as a String. // Each '\0' character in the buffer is replaced with "\\0". // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::String GetString() const { return internal::StringStreamToString(ss_.get()); } private: #if GTEST_OS_SYMBIAN // These are needed as the Nokia Symbian Compiler cannot decide between // const T& and const T* in a function template. The Nokia compiler _can_ // decide between class template specializations for T and T*, so a // tr1::type_traits-like is_pointer works, and we can overload on that. template inline void StreamHelper(internal::true_type /*dummy*/, T* pointer) { if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } } template inline void StreamHelper(internal::false_type /*dummy*/, const T& value) { ::GTestStreamToHelper(ss_.get(), value); } #endif // GTEST_OS_SYMBIAN // We'll hold the text streamed to this object here. const internal::scoped_ptr< ::std::stringstream> ss_; // We declare (but don't implement) this to prevent the compiler // from implementing the assignment operator. void operator=(const Message&); }; // Streams a Message to an ostream. inline std::ostream& operator <<(std::ostream& os, const Message& sb) { return os << sb.GetString(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-param-test.h0000600000175000017500000022413111561126632025566 0ustar synergysynergy// This file was GENERATED by command: // pump.py gtest-param-test.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev) // // Macros and functions for implementing parameterized tests // in Google C++ Testing Framework (Google Test) // // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // #ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Value-parameterized tests allow you to test your code with different // parameters without writing multiple copies of the same test. // // Here is how you use value-parameterized tests: #if 0 // To write value-parameterized tests, first you should define a fixture // class. It is usually derived from testing::TestWithParam (see below for // another inheritance scheme that's sometimes useful in more complicated // class hierarchies), where the type of your parameter values. // TestWithParam is itself derived from testing::Test. T can be any // copyable type. If it's a raw pointer, you are responsible for managing the // lifespan of the pointed values. class FooTest : public ::testing::TestWithParam { // You can implement all the usual class fixture members here. }; // Then, use the TEST_P macro to define as many parameterized tests // for this fixture as you want. The _P suffix is for "parameterized" // or "pattern", whichever you prefer to think. TEST_P(FooTest, DoesBlah) { // Inside a test, access the test parameter with the GetParam() method // of the TestWithParam class: EXPECT_TRUE(foo.Blah(GetParam())); ... } TEST_P(FooTest, HasBlahBlah) { ... } // Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test // case with any set of parameters you want. Google Test defines a number // of functions for generating test parameters. They return what we call // (surprise!) parameter generators. Here is a summary of them, which // are all in the testing namespace: // // // Range(begin, end [, step]) - Yields values {begin, begin+step, // begin+step+step, ...}. The values do not // include end. step defaults to 1. // Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. // ValuesIn(container) - Yields values from a C-style array, an STL // ValuesIn(begin,end) container, or an iterator range [begin, end). // Bool() - Yields sequence {false, true}. // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product // for the math savvy) of the values generated // by the N generators. // // For more details, see comments at the definitions of these functions below // in this file. // // The following statement will instantiate tests from the FooTest test case // each with parameter values "meeny", "miny", and "moe". INSTANTIATE_TEST_CASE_P(InstantiationName, FooTest, Values("meeny", "miny", "moe")); // To distinguish different instances of the pattern, (yes, you // can instantiate it more then once) the first argument to the // INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the // actual test case name. Remember to pick unique prefixes for different // instantiations. The tests from the instantiation above will have // these names: // // * InstantiationName/FooTest.DoesBlah/0 for "meeny" // * InstantiationName/FooTest.DoesBlah/1 for "miny" // * InstantiationName/FooTest.DoesBlah/2 for "moe" // * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" // * InstantiationName/FooTest.HasBlahBlah/1 for "miny" // * InstantiationName/FooTest.HasBlahBlah/2 for "moe" // // You can use these names in --gtest_filter. // // This statement will instantiate all tests from FooTest again, each // with parameter values "cat" and "dog": const char* pets[] = {"cat", "dog"}; INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); // The tests from the instantiation above will have these names: // // * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" // * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" // * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" // * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" // // Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests // in the given test case, whether their definitions come before or // AFTER the INSTANTIATE_TEST_CASE_P statement. // // Please also note that generator expressions (including parameters to the // generators) are evaluated in InitGoogleTest(), after main() has started. // This allows the user on one hand, to adjust generator parameters in order // to dynamically determine a set of tests to run and on the other hand, // give the user a chance to inspect the generated tests with Google Test // reflection API before RUN_ALL_TESTS() is executed. // // You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc // for more examples. // // In the future, we plan to publish the API for defining new parameter // generators. But for now this interface remains part of the internal // implementation and is subject to change. // // // A parameterized test fixture must be derived from testing::Test and from // testing::WithParamInterface, where T is the type of the parameter // values. Inheriting from TestWithParam satisfies that requirement because // TestWithParam inherits from both Test and WithParamInterface. In more // complicated hierarchies, however, it is occasionally useful to inherit // separately from Test and WithParamInterface. For example: class BaseTest : public ::testing::Test { // You can inherit all the usual members for a non-parameterized test // fixture here. }; class DerivedTest : public BaseTest, public ::testing::WithParamInterface { // The usual test fixture members go here too. }; TEST_F(BaseTest, HasFoo) { // This is an ordinary non-parameterized test. } TEST_P(DerivedTest, DoesBlah) { // GetParam works just the same here as if you inherit from TestWithParam. EXPECT_TRUE(foo.Blah(GetParam())); } #endif // 0 #include "gtest/internal/gtest-port.h" #if !GTEST_OS_SYMBIAN # include #endif // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-param-util.h" #include "gtest/internal/gtest-param-util-generated.h" #if GTEST_HAS_PARAM_TEST namespace testing { // Functions producing parameter generators. // // Google Test uses these generators to produce parameters for value- // parameterized tests. When a parameterized test case is instantiated // with a particular generator, Google Test creates and runs tests // for each element in the sequence produced by the generator. // // In the following sample, tests from test case FooTest are instantiated // each three times with parameter values 3, 5, and 8: // // class FooTest : public TestWithParam { ... }; // // TEST_P(FooTest, TestThis) { // } // TEST_P(FooTest, TestThat) { // } // INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); // // Range() returns generators providing sequences of values in a range. // // Synopsis: // Range(start, end) // - returns a generator producing a sequence of values {start, start+1, // start+2, ..., }. // Range(start, end, step) // - returns a generator producing a sequence of values {start, start+step, // start+step+step, ..., }. // Notes: // * The generated sequences never include end. For example, Range(1, 5) // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) // returns a generator producing {1, 3, 5, 7}. // * start and end must have the same type. That type may be any integral or // floating-point type or a user defined type satisfying these conditions: // * It must be assignable (have operator=() defined). // * It must have operator+() (operator+(int-compatible type) for // two-operand version). // * It must have operator<() defined. // Elements in the resulting sequences will also have that type. // * Condition start < end must be satisfied in order for resulting sequences // to contain any elements. // template internal::ParamGenerator Range(T start, T end, IncrementT step) { return internal::ParamGenerator( new internal::RangeGenerator(start, end, step)); } template internal::ParamGenerator Range(T start, T end) { return Range(start, end, 1); } // ValuesIn() function allows generation of tests with parameters coming from // a container. // // Synopsis: // ValuesIn(const T (&array)[N]) // - returns a generator producing sequences with elements from // a C-style array. // ValuesIn(const Container& container) // - returns a generator producing sequences with elements from // an STL-style container. // ValuesIn(Iterator begin, Iterator end) // - returns a generator producing sequences with elements from // a range [begin, end) defined by a pair of STL-style iterators. These // iterators can also be plain C pointers. // // Please note that ValuesIn copies the values from the containers // passed in and keeps them to generate tests in RUN_ALL_TESTS(). // // Examples: // // This instantiates tests from test case StringTest // each with C-string values of "foo", "bar", and "baz": // // const char* strings[] = {"foo", "bar", "baz"}; // INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); // // This instantiates tests from test case StlStringTest // each with STL strings with values "a" and "b": // // ::std::vector< ::std::string> GetParameterStrings() { // ::std::vector< ::std::string> v; // v.push_back("a"); // v.push_back("b"); // return v; // } // // INSTANTIATE_TEST_CASE_P(CharSequence, // StlStringTest, // ValuesIn(GetParameterStrings())); // // // This will also instantiate tests from CharTest // each with parameter values 'a' and 'b': // // ::std::list GetParameterChars() { // ::std::list list; // list.push_back('a'); // list.push_back('b'); // return list; // } // ::std::list l = GetParameterChars(); // INSTANTIATE_TEST_CASE_P(CharSequence2, // CharTest, // ValuesIn(l.begin(), l.end())); // template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end) { typedef typename ::testing::internal::IteratorTraits ::value_type ParamType; return internal::ParamGenerator( new internal::ValuesInIteratorRangeGenerator(begin, end)); } template internal::ParamGenerator ValuesIn(const T (&array)[N]) { return ValuesIn(array, array + N); } template internal::ParamGenerator ValuesIn( const Container& container) { return ValuesIn(container.begin(), container.end()); } // Values() allows generating tests from explicitly specified list of // parameters. // // Synopsis: // Values(T v1, T v2, ..., T vN) // - returns a generator producing sequences with elements v1, v2, ..., vN. // // For example, this instantiates tests from test case BarTest each // with values "one", "two", and "three": // // INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); // // This instantiates tests from test case BazTest each with values 1, 2, 3.5. // The exact type of values will depend on the type of parameter in BazTest. // // INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); // // Currently, Values() supports from 1 to 50 parameters. // template internal::ValueArray1 Values(T1 v1) { return internal::ValueArray1(v1); } template internal::ValueArray2 Values(T1 v1, T2 v2) { return internal::ValueArray2(v1, v2); } template internal::ValueArray3 Values(T1 v1, T2 v2, T3 v3) { return internal::ValueArray3(v1, v2, v3); } template internal::ValueArray4 Values(T1 v1, T2 v2, T3 v3, T4 v4) { return internal::ValueArray4(v1, v2, v3, v4); } template internal::ValueArray5 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) { return internal::ValueArray5(v1, v2, v3, v4, v5); } template internal::ValueArray6 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) { return internal::ValueArray6(v1, v2, v3, v4, v5, v6); } template internal::ValueArray7 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) { return internal::ValueArray7(v1, v2, v3, v4, v5, v6, v7); } template internal::ValueArray8 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) { return internal::ValueArray8(v1, v2, v3, v4, v5, v6, v7, v8); } template internal::ValueArray9 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) { return internal::ValueArray9(v1, v2, v3, v4, v5, v6, v7, v8, v9); } template internal::ValueArray10 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) { return internal::ValueArray10(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10); } template internal::ValueArray11 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) { return internal::ValueArray11(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11); } template internal::ValueArray12 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) { return internal::ValueArray12(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12); } template internal::ValueArray13 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) { return internal::ValueArray13(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13); } template internal::ValueArray14 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) { return internal::ValueArray14(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14); } template internal::ValueArray15 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) { return internal::ValueArray15(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15); } template internal::ValueArray16 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) { return internal::ValueArray16(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16); } template internal::ValueArray17 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) { return internal::ValueArray17(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17); } template internal::ValueArray18 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) { return internal::ValueArray18(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18); } template internal::ValueArray19 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) { return internal::ValueArray19(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19); } template internal::ValueArray20 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) { return internal::ValueArray20(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20); } template internal::ValueArray21 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) { return internal::ValueArray21(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21); } template internal::ValueArray22 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) { return internal::ValueArray22(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22); } template internal::ValueArray23 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) { return internal::ValueArray23(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23); } template internal::ValueArray24 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) { return internal::ValueArray24(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24); } template internal::ValueArray25 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) { return internal::ValueArray25(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25); } template internal::ValueArray26 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) { return internal::ValueArray26(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26); } template internal::ValueArray27 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) { return internal::ValueArray27(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27); } template internal::ValueArray28 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) { return internal::ValueArray28(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28); } template internal::ValueArray29 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) { return internal::ValueArray29(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29); } template internal::ValueArray30 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) { return internal::ValueArray30(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30); } template internal::ValueArray31 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) { return internal::ValueArray31(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31); } template internal::ValueArray32 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) { return internal::ValueArray32(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32); } template internal::ValueArray33 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) { return internal::ValueArray33(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33); } template internal::ValueArray34 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) { return internal::ValueArray34(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34); } template internal::ValueArray35 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) { return internal::ValueArray35(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35); } template internal::ValueArray36 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) { return internal::ValueArray36(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36); } template internal::ValueArray37 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) { return internal::ValueArray37(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37); } template internal::ValueArray38 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) { return internal::ValueArray38(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38); } template internal::ValueArray39 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) { return internal::ValueArray39(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39); } template internal::ValueArray40 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) { return internal::ValueArray40(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40); } template internal::ValueArray41 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) { return internal::ValueArray41(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41); } template internal::ValueArray42 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) { return internal::ValueArray42(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42); } template internal::ValueArray43 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) { return internal::ValueArray43(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43); } template internal::ValueArray44 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) { return internal::ValueArray44(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44); } template internal::ValueArray45 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) { return internal::ValueArray45(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45); } template internal::ValueArray46 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) { return internal::ValueArray46(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46); } template internal::ValueArray47 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) { return internal::ValueArray47(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47); } template internal::ValueArray48 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) { return internal::ValueArray48(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48); } template internal::ValueArray49 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) { return internal::ValueArray49(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49); } template internal::ValueArray50 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) { return internal::ValueArray50(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50); } // Bool() allows generating tests with parameters in a set of (false, true). // // Synopsis: // Bool() // - returns a generator producing sequences with elements {false, true}. // // It is useful when testing code that depends on Boolean flags. Combinations // of multiple flags can be tested when several Bool()'s are combined using // Combine() function. // // In the following example all tests in the test case FlagDependentTest // will be instantiated twice with parameters false and true. // // class FlagDependentTest : public testing::TestWithParam { // virtual void SetUp() { // external_flag = GetParam(); // } // } // INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); // inline internal::ParamGenerator Bool() { return Values(false, true); } # if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of // tuple where T1, T2, ..., TN are the types // of elements from sequences produces by gen1, gen2, ..., genN. // // Combine can have up to 10 arguments. This number is currently limited // by the maximum number of elements in the tuple implementation used by Google // Test. // // Example: // // This will instantiate tests in test case AnimalTest each one with // the parameter values tuple("cat", BLACK), tuple("cat", WHITE), // tuple("dog", BLACK), and tuple("dog", WHITE): // // enum Color { BLACK, GRAY, WHITE }; // class AnimalTest // : public testing::TestWithParam > {...}; // // TEST_P(AnimalTest, AnimalLooksNice) {...} // // INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, // Combine(Values("cat", "dog"), // Values(BLACK, WHITE))); // // This will instantiate tests in FlagDependentTest with all variations of two // Boolean flags: // // class FlagDependentTest // : public testing::TestWithParam > { // virtual void SetUp() { // // Assigns external_flag_1 and external_flag_2 values from the tuple. // tie(external_flag_1, external_flag_2) = GetParam(); // } // }; // // TEST_P(FlagDependentTest, TestFeature1) { // // Test your code using external_flag_1 and external_flag_2 here. // } // INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, // Combine(Bool(), Bool())); // template internal::CartesianProductHolder2 Combine( const Generator1& g1, const Generator2& g2) { return internal::CartesianProductHolder2( g1, g2); } template internal::CartesianProductHolder3 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3) { return internal::CartesianProductHolder3( g1, g2, g3); } template internal::CartesianProductHolder4 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) { return internal::CartesianProductHolder4( g1, g2, g3, g4); } template internal::CartesianProductHolder5 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) { return internal::CartesianProductHolder5( g1, g2, g3, g4, g5); } template internal::CartesianProductHolder6 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) { return internal::CartesianProductHolder6( g1, g2, g3, g4, g5, g6); } template internal::CartesianProductHolder7 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) { return internal::CartesianProductHolder7( g1, g2, g3, g4, g5, g6, g7); } template internal::CartesianProductHolder8 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) { return internal::CartesianProductHolder8( g1, g2, g3, g4, g5, g6, g7, g8); } template internal::CartesianProductHolder9 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) { return internal::CartesianProductHolder9( g1, g2, g3, g4, g5, g6, g7, g8, g9); } template internal::CartesianProductHolder10 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) { return internal::CartesianProductHolder10( g1, g2, g3, g4, g5, g6, g7, g8, g9, g10); } # endif // GTEST_HAS_COMBINE # define TEST_P(test_case_name, test_name) \ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ : public test_case_name { \ public: \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ virtual void TestBody(); \ private: \ static int AddToRegistry() { \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ #test_case_name, \ #test_name, \ new ::testing::internal::TestMetaFactory< \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ return 0; \ } \ static int gtest_registering_dummy_; \ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ }; \ int GTEST_TEST_CLASS_NAME_(test_case_name, \ test_name)::gtest_registering_dummy_ = \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() # define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ ::testing::internal::ParamGenerator \ gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ int gtest_##prefix##test_case_name##_dummy_ = \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ #prefix, \ >est_##prefix##test_case_name##_EvalGenerator_, \ __FILE__, __LINE__) } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-param-test.h.pump0000600000175000017500000004455511561126632026560 0ustar synergysynergy$$ -*- mode: c++; -*- $var n = 50 $$ Maximum length of Values arguments we want to support. $var maxtuple = 10 $$ Maximum number of Combine arguments we want to support. // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev) // // Macros and functions for implementing parameterized tests // in Google C++ Testing Framework (Google Test) // // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // #ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Value-parameterized tests allow you to test your code with different // parameters without writing multiple copies of the same test. // // Here is how you use value-parameterized tests: #if 0 // To write value-parameterized tests, first you should define a fixture // class. It is usually derived from testing::TestWithParam (see below for // another inheritance scheme that's sometimes useful in more complicated // class hierarchies), where the type of your parameter values. // TestWithParam is itself derived from testing::Test. T can be any // copyable type. If it's a raw pointer, you are responsible for managing the // lifespan of the pointed values. class FooTest : public ::testing::TestWithParam { // You can implement all the usual class fixture members here. }; // Then, use the TEST_P macro to define as many parameterized tests // for this fixture as you want. The _P suffix is for "parameterized" // or "pattern", whichever you prefer to think. TEST_P(FooTest, DoesBlah) { // Inside a test, access the test parameter with the GetParam() method // of the TestWithParam class: EXPECT_TRUE(foo.Blah(GetParam())); ... } TEST_P(FooTest, HasBlahBlah) { ... } // Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test // case with any set of parameters you want. Google Test defines a number // of functions for generating test parameters. They return what we call // (surprise!) parameter generators. Here is a summary of them, which // are all in the testing namespace: // // // Range(begin, end [, step]) - Yields values {begin, begin+step, // begin+step+step, ...}. The values do not // include end. step defaults to 1. // Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. // ValuesIn(container) - Yields values from a C-style array, an STL // ValuesIn(begin,end) container, or an iterator range [begin, end). // Bool() - Yields sequence {false, true}. // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product // for the math savvy) of the values generated // by the N generators. // // For more details, see comments at the definitions of these functions below // in this file. // // The following statement will instantiate tests from the FooTest test case // each with parameter values "meeny", "miny", and "moe". INSTANTIATE_TEST_CASE_P(InstantiationName, FooTest, Values("meeny", "miny", "moe")); // To distinguish different instances of the pattern, (yes, you // can instantiate it more then once) the first argument to the // INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the // actual test case name. Remember to pick unique prefixes for different // instantiations. The tests from the instantiation above will have // these names: // // * InstantiationName/FooTest.DoesBlah/0 for "meeny" // * InstantiationName/FooTest.DoesBlah/1 for "miny" // * InstantiationName/FooTest.DoesBlah/2 for "moe" // * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" // * InstantiationName/FooTest.HasBlahBlah/1 for "miny" // * InstantiationName/FooTest.HasBlahBlah/2 for "moe" // // You can use these names in --gtest_filter. // // This statement will instantiate all tests from FooTest again, each // with parameter values "cat" and "dog": const char* pets[] = {"cat", "dog"}; INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); // The tests from the instantiation above will have these names: // // * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" // * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" // * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" // * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" // // Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests // in the given test case, whether their definitions come before or // AFTER the INSTANTIATE_TEST_CASE_P statement. // // Please also note that generator expressions (including parameters to the // generators) are evaluated in InitGoogleTest(), after main() has started. // This allows the user on one hand, to adjust generator parameters in order // to dynamically determine a set of tests to run and on the other hand, // give the user a chance to inspect the generated tests with Google Test // reflection API before RUN_ALL_TESTS() is executed. // // You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc // for more examples. // // In the future, we plan to publish the API for defining new parameter // generators. But for now this interface remains part of the internal // implementation and is subject to change. // // // A parameterized test fixture must be derived from testing::Test and from // testing::WithParamInterface, where T is the type of the parameter // values. Inheriting from TestWithParam satisfies that requirement because // TestWithParam inherits from both Test and WithParamInterface. In more // complicated hierarchies, however, it is occasionally useful to inherit // separately from Test and WithParamInterface. For example: class BaseTest : public ::testing::Test { // You can inherit all the usual members for a non-parameterized test // fixture here. }; class DerivedTest : public BaseTest, public ::testing::WithParamInterface { // The usual test fixture members go here too. }; TEST_F(BaseTest, HasFoo) { // This is an ordinary non-parameterized test. } TEST_P(DerivedTest, DoesBlah) { // GetParam works just the same here as if you inherit from TestWithParam. EXPECT_TRUE(foo.Blah(GetParam())); } #endif // 0 #include "gtest/internal/gtest-port.h" #if !GTEST_OS_SYMBIAN # include #endif // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-param-util.h" #include "gtest/internal/gtest-param-util-generated.h" #if GTEST_HAS_PARAM_TEST namespace testing { // Functions producing parameter generators. // // Google Test uses these generators to produce parameters for value- // parameterized tests. When a parameterized test case is instantiated // with a particular generator, Google Test creates and runs tests // for each element in the sequence produced by the generator. // // In the following sample, tests from test case FooTest are instantiated // each three times with parameter values 3, 5, and 8: // // class FooTest : public TestWithParam { ... }; // // TEST_P(FooTest, TestThis) { // } // TEST_P(FooTest, TestThat) { // } // INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); // // Range() returns generators providing sequences of values in a range. // // Synopsis: // Range(start, end) // - returns a generator producing a sequence of values {start, start+1, // start+2, ..., }. // Range(start, end, step) // - returns a generator producing a sequence of values {start, start+step, // start+step+step, ..., }. // Notes: // * The generated sequences never include end. For example, Range(1, 5) // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) // returns a generator producing {1, 3, 5, 7}. // * start and end must have the same type. That type may be any integral or // floating-point type or a user defined type satisfying these conditions: // * It must be assignable (have operator=() defined). // * It must have operator+() (operator+(int-compatible type) for // two-operand version). // * It must have operator<() defined. // Elements in the resulting sequences will also have that type. // * Condition start < end must be satisfied in order for resulting sequences // to contain any elements. // template internal::ParamGenerator Range(T start, T end, IncrementT step) { return internal::ParamGenerator( new internal::RangeGenerator(start, end, step)); } template internal::ParamGenerator Range(T start, T end) { return Range(start, end, 1); } // ValuesIn() function allows generation of tests with parameters coming from // a container. // // Synopsis: // ValuesIn(const T (&array)[N]) // - returns a generator producing sequences with elements from // a C-style array. // ValuesIn(const Container& container) // - returns a generator producing sequences with elements from // an STL-style container. // ValuesIn(Iterator begin, Iterator end) // - returns a generator producing sequences with elements from // a range [begin, end) defined by a pair of STL-style iterators. These // iterators can also be plain C pointers. // // Please note that ValuesIn copies the values from the containers // passed in and keeps them to generate tests in RUN_ALL_TESTS(). // // Examples: // // This instantiates tests from test case StringTest // each with C-string values of "foo", "bar", and "baz": // // const char* strings[] = {"foo", "bar", "baz"}; // INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); // // This instantiates tests from test case StlStringTest // each with STL strings with values "a" and "b": // // ::std::vector< ::std::string> GetParameterStrings() { // ::std::vector< ::std::string> v; // v.push_back("a"); // v.push_back("b"); // return v; // } // // INSTANTIATE_TEST_CASE_P(CharSequence, // StlStringTest, // ValuesIn(GetParameterStrings())); // // // This will also instantiate tests from CharTest // each with parameter values 'a' and 'b': // // ::std::list GetParameterChars() { // ::std::list list; // list.push_back('a'); // list.push_back('b'); // return list; // } // ::std::list l = GetParameterChars(); // INSTANTIATE_TEST_CASE_P(CharSequence2, // CharTest, // ValuesIn(l.begin(), l.end())); // template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end) { typedef typename ::testing::internal::IteratorTraits ::value_type ParamType; return internal::ParamGenerator( new internal::ValuesInIteratorRangeGenerator(begin, end)); } template internal::ParamGenerator ValuesIn(const T (&array)[N]) { return ValuesIn(array, array + N); } template internal::ParamGenerator ValuesIn( const Container& container) { return ValuesIn(container.begin(), container.end()); } // Values() allows generating tests from explicitly specified list of // parameters. // // Synopsis: // Values(T v1, T v2, ..., T vN) // - returns a generator producing sequences with elements v1, v2, ..., vN. // // For example, this instantiates tests from test case BarTest each // with values "one", "two", and "three": // // INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); // // This instantiates tests from test case BazTest each with values 1, 2, 3.5. // The exact type of values will depend on the type of parameter in BazTest. // // INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); // // Currently, Values() supports from 1 to $n parameters. // $range i 1..n $for i [[ $range j 1..i template <$for j, [[typename T$j]]> internal::ValueArray$i<$for j, [[T$j]]> Values($for j, [[T$j v$j]]) { return internal::ValueArray$i<$for j, [[T$j]]>($for j, [[v$j]]); } ]] // Bool() allows generating tests with parameters in a set of (false, true). // // Synopsis: // Bool() // - returns a generator producing sequences with elements {false, true}. // // It is useful when testing code that depends on Boolean flags. Combinations // of multiple flags can be tested when several Bool()'s are combined using // Combine() function. // // In the following example all tests in the test case FlagDependentTest // will be instantiated twice with parameters false and true. // // class FlagDependentTest : public testing::TestWithParam { // virtual void SetUp() { // external_flag = GetParam(); // } // } // INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); // inline internal::ParamGenerator Bool() { return Values(false, true); } # if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of // tuple where T1, T2, ..., TN are the types // of elements from sequences produces by gen1, gen2, ..., genN. // // Combine can have up to $maxtuple arguments. This number is currently limited // by the maximum number of elements in the tuple implementation used by Google // Test. // // Example: // // This will instantiate tests in test case AnimalTest each one with // the parameter values tuple("cat", BLACK), tuple("cat", WHITE), // tuple("dog", BLACK), and tuple("dog", WHITE): // // enum Color { BLACK, GRAY, WHITE }; // class AnimalTest // : public testing::TestWithParam > {...}; // // TEST_P(AnimalTest, AnimalLooksNice) {...} // // INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, // Combine(Values("cat", "dog"), // Values(BLACK, WHITE))); // // This will instantiate tests in FlagDependentTest with all variations of two // Boolean flags: // // class FlagDependentTest // : public testing::TestWithParam > { // virtual void SetUp() { // // Assigns external_flag_1 and external_flag_2 values from the tuple. // tie(external_flag_1, external_flag_2) = GetParam(); // } // }; // // TEST_P(FlagDependentTest, TestFeature1) { // // Test your code using external_flag_1 and external_flag_2 here. // } // INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, // Combine(Bool(), Bool())); // $range i 2..maxtuple $for i [[ $range j 1..i template <$for j, [[typename Generator$j]]> internal::CartesianProductHolder$i<$for j, [[Generator$j]]> Combine( $for j, [[const Generator$j& g$j]]) { return internal::CartesianProductHolder$i<$for j, [[Generator$j]]>( $for j, [[g$j]]); } ]] # endif // GTEST_HAS_COMBINE # define TEST_P(test_case_name, test_name) \ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ : public test_case_name { \ public: \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ virtual void TestBody(); \ private: \ static int AddToRegistry() { \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ #test_case_name, \ #test_name, \ new ::testing::internal::TestMetaFactory< \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ return 0; \ } \ static int gtest_registering_dummy_; \ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ }; \ int GTEST_TEST_CLASS_NAME_(test_case_name, \ test_name)::gtest_registering_dummy_ = \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() # define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ ::testing::internal::ParamGenerator \ gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ int gtest_##prefix##test_case_name##_dummy_ = \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ #prefix, \ >est_##prefix##test_case_name##_EvalGenerator_, \ __FILE__, __LINE__) } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-printers.h0000600000175000017500000007307111561126632025364 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // A user can teach this function how to print a class type T by // defining either operator<<() or PrintTo() in the namespace that // defines T. More specifically, the FIRST defined function in the // following list will be used (assuming T is defined in namespace // foo): // // 1. foo::PrintTo(const T&, ostream*) // 2. operator<<(ostream&, const T&) defined in either foo or the // global namespace. // // If none of the above is defined, it will print the debug string of // the value if it is a protocol buffer, or print the raw bytes in the // value otherwise. // // To aid debugging: when T is a reference type, the address of the // value is also printed; when T is a (const) char pointer, both the // pointer value and the NUL-terminated string it points to are // printed. // // We also provide some convenient wrappers: // // // Prints a value to a string. For a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // std::string ::testing::PrintToString(const T& value); // // // Prints a value tersely: for a reference type, the referenced // // value (but not the address) is printed; for a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // void ::testing::internal::UniversalTersePrint(const T& value, ostream*); // // // Prints value using the type inferred by the compiler. The difference // // from UniversalTersePrint() is that this function prints both the // // pointer and the NUL-terminated string for a (const or not) char pointer. // void ::testing::internal::UniversalPrint(const T& value, ostream*); // // // Prints the fields of a tuple tersely to a string vector, one // // element for each field. Tuple support must be enabled in // // gtest-port.h. // std::vector UniversalTersePrintTupleFieldsToStrings( // const Tuple& value); // // Known limitation: // // The print primitives print the elements of an STL-style container // using the compiler-inferred type of *iter where iter is a // const_iterator of the container. When const_iterator is an input // iterator but not a forward iterator, this inferred type may not // match value_type, and the print output may be incorrect. In // practice, this is rarely a problem as for most containers // const_iterator is a forward iterator. We'll fix this if there's an // actual need for it. Note that this fix cannot rely on value_type // being defined as many user-defined container types don't have // value_type. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #include // NOLINT #include #include #include #include #include "gtest/internal/gtest-port.h" #include "gtest/internal/gtest-internal.h" namespace testing { // Definitions in the 'internal' and 'internal2' name spaces are // subject to change without notice. DO NOT USE THEM IN USER CODE! namespace internal2 { // Prints the given number of bytes in the given object to the given // ostream. GTEST_API_ void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ::std::ostream* os); // For selecting which printer to use when a given type has neither << // nor PrintTo(). enum TypeKind { kProtobuf, // a protobuf type kConvertibleToInteger, // a type implicitly convertible to BiggestInt // (e.g. a named or unnamed enum type) kOtherType // anything else }; // TypeWithoutFormatter::PrintValue(value, os) is called // by the universal printer to print a value of type T when neither // operator<< nor PrintTo() is defined for T, where kTypeKind is the // "kind" of T as defined by enum TypeKind. template class TypeWithoutFormatter { public: // This default version is called when kTypeKind is kOtherType. static void PrintValue(const T& value, ::std::ostream* os) { PrintBytesInObjectTo(reinterpret_cast(&value), sizeof(value), os); } }; // We print a protobuf using its ShortDebugString() when the string // doesn't exceed this many characters; otherwise we print it using // DebugString() for better readability. const size_t kProtobufOneLinerMaxLength = 50; template class TypeWithoutFormatter { public: static void PrintValue(const T& value, ::std::ostream* os) { const ::testing::internal::string short_str = value.ShortDebugString(); const ::testing::internal::string pretty_str = short_str.length() <= kProtobufOneLinerMaxLength ? short_str : ("\n" + value.DebugString()); *os << ("<" + pretty_str + ">"); } }; template class TypeWithoutFormatter { public: // Since T has no << operator or PrintTo() but can be implicitly // converted to BiggestInt, we print it as a BiggestInt. // // Most likely T is an enum type (either named or unnamed), in which // case printing it as an integer is the desired behavior. In case // T is not an enum, printing it as an integer is the best we can do // given that it has no user-defined printer. static void PrintValue(const T& value, ::std::ostream* os) { const internal::BiggestInt kBigInt = value; *os << kBigInt; } }; // Prints the given value to the given ostream. If the value is a // protocol message, its debug string is printed; if it's an enum or // of a type implicitly convertible to BiggestInt, it's printed as an // integer; otherwise the bytes in the value are printed. This is // what UniversalPrinter::Print() does when it knows nothing about // type T and T has neither << operator nor PrintTo(). // // A user can override this behavior for a class type Foo by defining // a << operator in the namespace where Foo is defined. // // We put this operator in namespace 'internal2' instead of 'internal' // to simplify the implementation, as much code in 'internal' needs to // use << in STL, which would conflict with our own << were it defined // in 'internal'. // // Note that this operator<< takes a generic std::basic_ostream type instead of the more restricted std::ostream. If // we define it to take an std::ostream instead, we'll get an // "ambiguous overloads" compiler error when trying to print a type // Foo that supports streaming to std::basic_ostream, as the compiler cannot tell whether // operator<<(std::ostream&, const T&) or // operator<<(std::basic_stream, const Foo&) is more // specific. template ::std::basic_ostream& operator<<( ::std::basic_ostream& os, const T& x) { TypeWithoutFormatter::value ? kProtobuf : internal::ImplicitlyConvertible::value ? kConvertibleToInteger : kOtherType)>::PrintValue(x, &os); return os; } } // namespace internal2 } // namespace testing // This namespace MUST NOT BE NESTED IN ::testing, or the name look-up // magic needed for implementing UniversalPrinter won't work. namespace testing_internal { // Used to print a value that is not an STL-style container when the // user doesn't define PrintTo() for it. template void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) { // With the following statement, during unqualified name lookup, // testing::internal2::operator<< appears as if it was declared in // the nearest enclosing namespace that contains both // ::testing_internal and ::testing::internal2, i.e. the global // namespace. For more details, refer to the C++ Standard section // 7.3.4-1 [namespace.udir]. This allows us to fall back onto // testing::internal2::operator<< in case T doesn't come with a << // operator. // // We cannot write 'using ::testing::internal2::operator<<;', which // gcc 3.3 fails to compile due to a compiler bug. using namespace ::testing::internal2; // NOLINT // Assuming T is defined in namespace foo, in the next statement, // the compiler will consider all of: // // 1. foo::operator<< (thanks to Koenig look-up), // 2. ::operator<< (as the current namespace is enclosed in ::), // 3. testing::internal2::operator<< (thanks to the using statement above). // // The operator<< whose type matches T best will be picked. // // We deliberately allow #2 to be a candidate, as sometimes it's // impossible to define #1 (e.g. when foo is ::std, defining // anything in it is undefined behavior unless you are a compiler // vendor.). *os << value; } } // namespace testing_internal namespace testing { namespace internal { // UniversalPrinter::Print(value, ostream_ptr) prints the given // value to the given ostream. The caller must ensure that // 'ostream_ptr' is not NULL, or the behavior is undefined. // // We define UniversalPrinter as a class template (as opposed to a // function template), as we need to partially specialize it for // reference types, which cannot be done with function templates. template class UniversalPrinter; template void UniversalPrint(const T& value, ::std::ostream* os); // Used to print an STL-style container when the user doesn't define // a PrintTo() for it. template void DefaultPrintTo(IsContainer /* dummy */, false_type /* is not a pointer */, const C& container, ::std::ostream* os) { const size_t kMaxCount = 32; // The maximum number of elements to print. *os << '{'; size_t count = 0; for (typename C::const_iterator it = container.begin(); it != container.end(); ++it, ++count) { if (count > 0) { *os << ','; if (count == kMaxCount) { // Enough has been printed. *os << " ..."; break; } } *os << ' '; // We cannot call PrintTo(*it, os) here as PrintTo() doesn't // handle *it being a native array. internal::UniversalPrint(*it, os); } if (count > 0) { *os << ' '; } *os << '}'; } // Used to print a pointer that is neither a char pointer nor a member // pointer, when the user doesn't define PrintTo() for it. (A member // variable pointer or member function pointer doesn't really point to // a location in the address space. Their representation is // implementation-defined. Therefore they will be printed as raw // bytes.) template void DefaultPrintTo(IsNotContainer /* dummy */, true_type /* is a pointer */, T* p, ::std::ostream* os) { if (p == NULL) { *os << "NULL"; } else { // C++ doesn't allow casting from a function pointer to any object // pointer. // // IsTrue() silences warnings: "Condition is always true", // "unreachable code". if (IsTrue(ImplicitlyConvertible::value)) { // T is not a function type. We just call << to print p, // relying on ADL to pick up user-defined << for their pointer // types, if any. *os << p; } else { // T is a function type, so '*os << p' doesn't do what we want // (it just prints p as bool). We want to print p as a const // void*. However, we cannot cast it to const void* directly, // even using reinterpret_cast, as earlier versions of gcc // (e.g. 3.4.5) cannot compile the cast when p is a function // pointer. Casting to UInt64 first solves the problem. *os << reinterpret_cast( reinterpret_cast(p)); } } } // Used to print a non-container, non-pointer value when the user // doesn't define PrintTo() for it. template void DefaultPrintTo(IsNotContainer /* dummy */, false_type /* is not a pointer */, const T& value, ::std::ostream* os) { ::testing_internal::DefaultPrintNonContainerTo(value, os); } // Prints the given value using the << operator if it has one; // otherwise prints the bytes in it. This is what // UniversalPrinter::Print() does when PrintTo() is not specialized // or overloaded for type T. // // A user can override this behavior for a class type Foo by defining // an overload of PrintTo() in the namespace where Foo is defined. We // give the user this option as sometimes defining a << operator for // Foo is not desirable (e.g. the coding style may prevent doing it, // or there is already a << operator but it doesn't do what the user // wants). template void PrintTo(const T& value, ::std::ostream* os) { // DefaultPrintTo() is overloaded. The type of its first two // arguments determine which version will be picked. If T is an // STL-style container, the version for container will be called; if // T is a pointer, the pointer version will be called; otherwise the // generic version will be called. // // Note that we check for container types here, prior to we check // for protocol message types in our operator<<. The rationale is: // // For protocol messages, we want to give people a chance to // override Google Mock's format by defining a PrintTo() or // operator<<. For STL containers, other formats can be // incompatible with Google Mock's format for the container // elements; therefore we check for container types here to ensure // that our format is used. // // The second argument of DefaultPrintTo() is needed to bypass a bug // in Symbian's C++ compiler that prevents it from picking the right // overload between: // // PrintTo(const T& x, ...); // PrintTo(T* x, ...); DefaultPrintTo(IsContainerTest(0), is_pointer(), value, os); } // The following list of PrintTo() overloads tells // UniversalPrinter::Print() how to print standard types (built-in // types, strings, plain arrays, and pointers). // Overloads for various char types. GTEST_API_ void PrintTo(unsigned char c, ::std::ostream* os); GTEST_API_ void PrintTo(signed char c, ::std::ostream* os); inline void PrintTo(char c, ::std::ostream* os) { // When printing a plain char, we always treat it as unsigned. This // way, the output won't be affected by whether the compiler thinks // char is signed or not. PrintTo(static_cast(c), os); } // Overloads for other simple built-in types. inline void PrintTo(bool x, ::std::ostream* os) { *os << (x ? "true" : "false"); } // Overload for wchar_t type. // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its decimal code (except for L'\0'). // The L'\0' char is printed as "L'\\0'". The decimal code is printed // as signed integer when wchar_t is implemented by the compiler // as a signed type and is printed as an unsigned integer when wchar_t // is implemented as an unsigned type. GTEST_API_ void PrintTo(wchar_t wc, ::std::ostream* os); // Overloads for C strings. GTEST_API_ void PrintTo(const char* s, ::std::ostream* os); inline void PrintTo(char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // signed/unsigned char is often used for representing binary data, so // we print pointers to it as void* to be safe. inline void PrintTo(const signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(const unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // MSVC can be configured to define wchar_t as a typedef of unsigned // short. It defines _NATIVE_WCHAR_T_DEFINED when wchar_t is a native // type. When wchar_t is a typedef, defining an overload for const // wchar_t* would cause unsigned short* be printed as a wide string, // possibly causing invalid memory accesses. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Overloads for wide C strings GTEST_API_ void PrintTo(const wchar_t* s, ::std::ostream* os); inline void PrintTo(wchar_t* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } #endif // Overload for C arrays. Multi-dimensional arrays are printed // properly. // Prints the given number of elements in an array, without printing // the curly braces. template void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { UniversalPrint(a[0], os); for (size_t i = 1; i != count; i++) { *os << ", "; UniversalPrint(a[i], os); } } // Overloads for ::string and ::std::string. #if GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::string&s, ::std::ostream* os); inline void PrintTo(const ::string& s, ::std::ostream* os) { PrintStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::std::string&s, ::std::ostream* os); inline void PrintTo(const ::std::string& s, ::std::ostream* os) { PrintStringTo(s, os); } // Overloads for ::wstring and ::std::wstring. #if GTEST_HAS_GLOBAL_WSTRING GTEST_API_ void PrintWideStringTo(const ::wstring&s, ::std::ostream* os); inline void PrintTo(const ::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING GTEST_API_ void PrintWideStringTo(const ::std::wstring&s, ::std::ostream* os); inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_TR1_TUPLE // Overload for ::std::tr1::tuple. Needed for printing function arguments, // which are packed as tuples. // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os); // Overloaded PrintTo() for tuples of various arities. We support // tuples of up-to 10 fields. The following implementation works // regardless of whether tr1::tuple is implemented using the // non-standard variadic template feature or not. inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo( const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } #endif // GTEST_HAS_TR1_TUPLE // Overload for std::pair. template void PrintTo(const ::std::pair& value, ::std::ostream* os) { *os << '('; // We cannot use UniversalPrint(value.first, os) here, as T1 may be // a reference type. The same for printing value.second. UniversalPrinter::Print(value.first, os); *os << ", "; UniversalPrinter::Print(value.second, os); *os << ')'; } // Implements printing a non-reference type T by letting the compiler // pick the right overload of PrintTo() for T. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER // Note: we deliberately don't call this PrintTo(), as that name // conflicts with ::testing::internal::PrintTo in the body of the // function. static void Print(const T& value, ::std::ostream* os) { // By default, ::testing::internal::PrintTo() is used for printing // the value. // // Thanks to Koenig look-up, if T is a class and has its own // PrintTo() function defined in its namespace, that function will // be visible here. Since it is more specific than the generic ones // in ::testing::internal, it will be picked by the compiler in the // following statement - exactly what we want. PrintTo(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // UniversalPrintArray(begin, len, os) prints an array of 'len' // elements, starting at address 'begin'. template void UniversalPrintArray(const T* begin, size_t len, ::std::ostream* os) { if (len == 0) { *os << "{}"; } else { *os << "{ "; const size_t kThreshold = 18; const size_t kChunkSize = 8; // If the array has more than kThreshold elements, we'll have to // omit some details by printing only the first and the last // kChunkSize elements. // TODO(wan@google.com): let the user control the threshold using a flag. if (len <= kThreshold) { PrintRawArrayTo(begin, len, os); } else { PrintRawArrayTo(begin, kChunkSize, os); *os << ", ..., "; PrintRawArrayTo(begin + len - kChunkSize, kChunkSize, os); } *os << " }"; } } // This overload prints a (const) char array compactly. GTEST_API_ void UniversalPrintArray(const char* begin, size_t len, ::std::ostream* os); // Implements printing an array type T[N]. template class UniversalPrinter { public: // Prints the given array, omitting some elements when there are too // many. static void Print(const T (&a)[N], ::std::ostream* os) { UniversalPrintArray(a, N, os); } }; // Implements printing a reference type T&. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER static void Print(const T& value, ::std::ostream* os) { // Prints the address of the value. We use reinterpret_cast here // as static_cast doesn't compile when T is a function type. *os << "@" << reinterpret_cast(&value) << " "; // Then prints the value itself. UniversalPrint(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // Prints a value tersely: for a reference type, the referenced value // (but not the address) is printed; for a (const) char pointer, the // NUL-terminated string (but not the pointer) is printed. template void UniversalTersePrint(const T& value, ::std::ostream* os) { UniversalPrint(value, os); } inline void UniversalTersePrint(const char* str, ::std::ostream* os) { if (str == NULL) { *os << "NULL"; } else { UniversalPrint(string(str), os); } } inline void UniversalTersePrint(char* str, ::std::ostream* os) { UniversalTersePrint(static_cast(str), os); } // Prints a value using the type inferred by the compiler. The // difference between this and UniversalTersePrint() is that for a // (const) char pointer, this prints both the pointer and the // NUL-terminated string. template void UniversalPrint(const T& value, ::std::ostream* os) { UniversalPrinter::Print(value, os); } #if GTEST_HAS_TR1_TUPLE typedef ::std::vector Strings; // This helper template allows PrintTo() for tuples and // UniversalTersePrintTupleFieldsToStrings() to be defined by // induction on the number of tuple fields. The idea is that // TuplePrefixPrinter::PrintPrefixTo(t, os) prints the first N // fields in tuple t, and can be defined in terms of // TuplePrefixPrinter. // The inductive case. template struct TuplePrefixPrinter { // Prints the first N fields of a tuple. template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { TuplePrefixPrinter::PrintPrefixTo(t, os); *os << ", "; UniversalPrinter::type> ::Print(::std::tr1::get(t), os); } // Tersely prints the first N fields of a tuple to a string vector, // one element for each field. template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { TuplePrefixPrinter::TersePrintPrefixToStrings(t, strings); ::std::stringstream ss; UniversalTersePrint(::std::tr1::get(t), &ss); strings->push_back(ss.str()); } }; // Base cases. template <> struct TuplePrefixPrinter<0> { template static void PrintPrefixTo(const Tuple&, ::std::ostream*) {} template static void TersePrintPrefixToStrings(const Tuple&, Strings*) {} }; // We have to specialize the entire TuplePrefixPrinter<> class // template here, even though the definition of // TersePrintPrefixToStrings() is the same as the generic version, as // Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't // support specializing a method template of a class template. template <> struct TuplePrefixPrinter<1> { template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { UniversalPrinter::type>:: Print(::std::tr1::get<0>(t), os); } template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { ::std::stringstream ss; UniversalTersePrint(::std::tr1::get<0>(t), &ss); strings->push_back(ss.str()); } }; // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os) { *os << "("; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: PrintPrefixTo(t, os); *os << ")"; } // Prints the fields of a tuple tersely to a string vector, one // element for each field. See the comment before // UniversalTersePrint() for how we define "tersely". template Strings UniversalTersePrintTupleFieldsToStrings(const Tuple& value) { Strings result; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: TersePrintPrefixToStrings(value, &result); return result; } #endif // GTEST_HAS_TR1_TUPLE } // namespace internal template ::std::string PrintToString(const T& value) { ::std::stringstream ss; internal::UniversalTersePrint(value, &ss); return ss.str(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-spi.h0000600000175000017500000002333711561126632024311 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Utilities for testing Google Test itself and code that uses Google Test // (e.g. frameworks built on top of Google Test). #ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #define GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #include "gtest/gtest.h" namespace testing { // This helper class can be used to mock out Google Test failure reporting // so that we can test Google Test or code that builds on Google Test. // // An object of this class appends a TestPartResult object to the // TestPartResultArray object given in the constructor whenever a Google Test // failure is reported. It can either intercept only failures that are // generated in the same thread that created this object or it can intercept // all generated failures. The scope of this mock object can be controlled with // the second argument to the two arguments constructor. class GTEST_API_ ScopedFakeTestPartResultReporter : public TestPartResultReporterInterface { public: // The two possible mocking modes of this object. enum InterceptMode { INTERCEPT_ONLY_CURRENT_THREAD, // Intercepts only thread local failures. INTERCEPT_ALL_THREADS // Intercepts all failures. }; // The c'tor sets this object as the test part result reporter used // by Google Test. The 'result' parameter specifies where to report the // results. This reporter will only catch failures generated in the current // thread. DEPRECATED explicit ScopedFakeTestPartResultReporter(TestPartResultArray* result); // Same as above, but you can choose the interception scope of this object. ScopedFakeTestPartResultReporter(InterceptMode intercept_mode, TestPartResultArray* result); // The d'tor restores the previous test part result reporter. virtual ~ScopedFakeTestPartResultReporter(); // Appends the TestPartResult object to the TestPartResultArray // received in the constructor. // // This method is from the TestPartResultReporterInterface // interface. virtual void ReportTestPartResult(const TestPartResult& result); private: void Init(); const InterceptMode intercept_mode_; TestPartResultReporterInterface* old_reporter_; TestPartResultArray* const result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedFakeTestPartResultReporter); }; namespace internal { // A helper class for implementing EXPECT_FATAL_FAILURE() and // EXPECT_NONFATAL_FAILURE(). Its destructor verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. class GTEST_API_ SingleFailureChecker { public: // The constructor remembers the arguments. SingleFailureChecker(const TestPartResultArray* results, TestPartResult::Type type, const string& substr); ~SingleFailureChecker(); private: const TestPartResultArray* const results_; const TestPartResult::Type type_; const string substr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker); }; } // namespace internal } // namespace testing // A set of macros for testing Google Test assertions or code that's expected // to generate Google Test fatal failures. It verifies that the given // statement will cause exactly one fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_FATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_FATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - 'statement' cannot reference local non-static variables or // non-static members of the current object. // - 'statement' cannot return a value. // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. The AcceptsMacroThatExpandsToUnprotectedComma test in // gtest_unittest.cc will fail to compile if we do that. #define EXPECT_FATAL_FAILURE(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ALL_THREADS, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) // A macro for testing Google Test assertions or code that's expected to // generate Google Test non-fatal failures. It asserts that the given // statement will cause exactly one non-fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_NONFATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // 'statement' is allowed to reference local variables and members of // the current object. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. If we do that, the code won't compile when the user gives // EXPECT_NONFATAL_FAILURE() a statement that contains a macro that // expands to code containing an unprotected comma. The // AcceptsMacroThatExpandsToUnprotectedComma test in gtest_unittest.cc // catches that. // // For the same reason, we have to write // if (::testing::internal::AlwaysTrue()) { statement; } // instead of // GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) // to avoid an MSVC warning on unreachable code. #define EXPECT_NONFATAL_FAILURE(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS,\ >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #endif // GTEST_INCLUDE_GTEST_GTEST_SPI_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-test-part.h0000600000175000017500000001450511561126632025436 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // #ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #include #include #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-string.h" namespace testing { // A copyable object representing the result of a test part (i.e. an // assertion or an explicit FAIL(), ADD_FAILURE(), or SUCCESS()). // // Don't inherit from TestPartResult as its destructor is not virtual. class GTEST_API_ TestPartResult { public: // The possible outcomes of a test part (i.e. an assertion or an // explicit SUCCEED(), FAIL(), or ADD_FAILURE()). enum Type { kSuccess, // Succeeded. kNonFatalFailure, // Failed but the test can continue. kFatalFailure // Failed and the test should be terminated. }; // C'tor. TestPartResult does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestPartResult object. TestPartResult(Type a_type, const char* a_file_name, int a_line_number, const char* a_message) : type_(a_type), file_name_(a_file_name), line_number_(a_line_number), summary_(ExtractSummary(a_message)), message_(a_message) { } // Gets the outcome of the test part. Type type() const { return type_; } // Gets the name of the source file where the test part took place, or // NULL if it's unknown. const char* file_name() const { return file_name_.c_str(); } // Gets the line in the source file where the test part took place, // or -1 if it's unknown. int line_number() const { return line_number_; } // Gets the summary of the failure message. const char* summary() const { return summary_.c_str(); } // Gets the message associated with the test part. const char* message() const { return message_.c_str(); } // Returns true iff the test part passed. bool passed() const { return type_ == kSuccess; } // Returns true iff the test part failed. bool failed() const { return type_ != kSuccess; } // Returns true iff the test part non-fatally failed. bool nonfatally_failed() const { return type_ == kNonFatalFailure; } // Returns true iff the test part fatally failed. bool fatally_failed() const { return type_ == kFatalFailure; } private: Type type_; // Gets the summary of the failure message by omitting the stack // trace in it. static internal::String ExtractSummary(const char* message); // The name of the source file where the test part took place, or // NULL if the source file is unknown. internal::String file_name_; // The line in the source file where the test part took place, or -1 // if the line number is unknown. int line_number_; internal::String summary_; // The test failure summary. internal::String message_; // The test failure message. }; // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result); // An array of TestPartResult objects. // // Don't inherit from TestPartResultArray as its destructor is not // virtual. class GTEST_API_ TestPartResultArray { public: TestPartResultArray() {} // Appends the given TestPartResult to the array. void Append(const TestPartResult& result); // Returns the TestPartResult at the given index (0-based). const TestPartResult& GetTestPartResult(int index) const; // Returns the number of TestPartResult objects in the array. int size() const; private: std::vector array_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray); }; // This interface knows how to report a test part result. class TestPartResultReporterInterface { public: virtual ~TestPartResultReporterInterface() {} virtual void ReportTestPartResult(const TestPartResult& result) = 0; }; namespace internal { // This helper class is used by {ASSERT|EXPECT}_NO_FATAL_FAILURE to check if a // statement generates new fatal failures. To do so it registers itself as the // current test part result reporter. Besides checking if fatal failures were // reported, it only delegates the reporting to the former result reporter. // The original result reporter is restored in the destructor. // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. class GTEST_API_ HasNewFatalFailureHelper : public TestPartResultReporterInterface { public: HasNewFatalFailureHelper(); virtual ~HasNewFatalFailureHelper(); virtual void ReportTestPartResult(const TestPartResult& result); bool has_new_fatal_failure() const { return has_new_fatal_failure_; } private: bool has_new_fatal_failure_; TestPartResultReporterInterface* original_reporter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(HasNewFatalFailureHelper); }; } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest-typed-test.h0000600000175000017500000002400211561126632025606 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // This header implements typed tests and type-parameterized tests. // Typed (aka type-driven) tests repeat the same test for types in a // list. You must know which types you want to test with when writing // typed tests. Here's how you do it: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { public: ... typedef std::list List; static T shared_; T value_; }; // Next, associate a list of types with the test case, which will be // repeated for each type in the list. The typedef is necessary for // the macro to parse correctly. typedef testing::Types MyTypes; TYPED_TEST_CASE(FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // TYPED_TEST_CASE(FooTest, int); // Then, use TYPED_TEST() instead of TEST_F() to define as many typed // tests for this test case as you want. TYPED_TEST(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. // Since we are inside a derived class template, C++ requires use to // visit the members of FooTest via 'this'. TypeParam n = this->value_; // To visit static members of the fixture, add the TestFixture:: // prefix. n += TestFixture::shared_; // To refer to typedefs in the fixture, add the "typename // TestFixture::" prefix. typename TestFixture::List values; values.push_back(n); ... } TYPED_TEST(FooTest, HasPropertyA) { ... } #endif // 0 // Type-parameterized tests are abstract test patterns parameterized // by a type. Compared with typed tests, type-parameterized tests // allow you to define the test pattern without knowing what the type // parameters are. The defined pattern can be instantiated with // different types any number of times, in any number of translation // units. // // If you are designing an interface or concept, you can define a // suite of type-parameterized tests to verify properties that any // valid implementation of the interface/concept should have. Then, // each implementation can easily instantiate the test suite to verify // that it conforms to the requirements, without having to write // similar tests repeatedly. Here's an example: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { ... }; // Next, declare that you will define a type-parameterized test case // (the _P suffix is for "parameterized" or "pattern", whichever you // prefer): TYPED_TEST_CASE_P(FooTest); // Then, use TYPED_TEST_P() to define as many type-parameterized tests // for this type-parameterized test case as you want. TYPED_TEST_P(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. TypeParam n = 0; ... } TYPED_TEST_P(FooTest, HasPropertyA) { ... } // Now the tricky part: you need to register all test patterns before // you can instantiate them. The first argument of the macro is the // test case name; the rest are the names of the tests in this test // case. REGISTER_TYPED_TEST_CASE_P(FooTest, DoesBlah, HasPropertyA); // Finally, you are free to instantiate the pattern with the types you // want. If you put the above code in a header file, you can #include // it in multiple C++ source files and instantiate it multiple times. // // To distinguish different instances of the pattern, the first // argument to the INSTANTIATE_* macro is a prefix that will be added // to the actual test case name. Remember to pick unique prefixes for // different instances. typedef testing::Types MyTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, int); #endif // 0 #include "gtest/internal/gtest-port.h" #include "gtest/internal/gtest-type-util.h" // Implements typed tests. #if GTEST_HAS_TYPED_TEST // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the typedef for the type parameters of the // given test case. # define GTEST_TYPE_PARAMS_(TestCaseName) gtest_type_params_##TestCaseName##_ // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define TYPED_TEST_CASE(CaseName, Types) \ typedef ::testing::internal::TypeList< Types >::type \ GTEST_TYPE_PARAMS_(CaseName) # define TYPED_TEST(CaseName, TestName) \ template \ class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \ : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTest< \ CaseName, \ ::testing::internal::TemplateSel< \ GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \ GTEST_TYPE_PARAMS_(CaseName)>::Register(\ "", #CaseName, #TestName, 0); \ template \ void GTEST_TEST_CLASS_NAME_(CaseName, TestName)::TestBody() #endif // GTEST_HAS_TYPED_TEST // Implements type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the namespace name that the type-parameterized tests for // the given type-parameterized test case are defined in. The exact // name of the namespace is subject to change without notice. # define GTEST_CASE_NAMESPACE_(TestCaseName) \ gtest_case_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the variable used to remember the names of // the defined tests in the given test case. # define GTEST_TYPED_TEST_CASE_P_STATE_(TestCaseName) \ gtest_typed_test_case_p_state_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE DIRECTLY. // // Expands to the name of the variable used to remember the names of // the registered tests in the given test case. # define GTEST_REGISTERED_TEST_NAMES_(TestCaseName) \ gtest_registered_test_names_##TestCaseName##_ // The variables defined in the type-parameterized test macros are // static as typically these macros are used in a .h file that can be // #included in multiple translation units linked together. # define TYPED_TEST_CASE_P(CaseName) \ static ::testing::internal::TypedTestCasePState \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName) # define TYPED_TEST_P(CaseName, TestName) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ template \ class TestName : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\ __FILE__, __LINE__, #CaseName, #TestName); \ } \ template \ void GTEST_CASE_NAMESPACE_(CaseName)::TestName::TestBody() # define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \ } \ static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\ __FILE__, __LINE__, #__VA_ARGS__) // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types) \ bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTestCase::type>::Register(\ #Prefix, #CaseName, GTEST_REGISTERED_TEST_NAMES_(CaseName)) #endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest.h0000600000175000017500000024102211561126632023511 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for Google Test. It should be // included by any test program that uses Google Test. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! // // Acknowledgment: Google Test borrowed the idea of automatic test // registration from Barthelemy Dagenais' (barthelemy@prologique.com) // easyUnit framework. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_H_ #include #include #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-string.h" #include "gtest/gtest-death-test.h" #include "gtest/gtest-message.h" #include "gtest/gtest-param-test.h" #include "gtest/gtest-printers.h" #include "gtest/gtest_prod.h" #include "gtest/gtest-test-part.h" #include "gtest/gtest-typed-test.h" // Depending on the platform, different string classes are available. // On Linux, in addition to ::std::string, Google also makes use of // class ::string, which has the same interface as ::std::string, but // has a different implementation. // // The user can define GTEST_HAS_GLOBAL_STRING to 1 to indicate that // ::string is available AND is a distinct type to ::std::string, or // define it to 0 to indicate otherwise. // // If the user's ::std::string and ::string are the same class due to // aliasing, he should define GTEST_HAS_GLOBAL_STRING to 0. // // If the user doesn't define GTEST_HAS_GLOBAL_STRING, it is defined // heuristically. namespace testing { // Declares the flags. // This flag temporary enables the disabled tests. GTEST_DECLARE_bool_(also_run_disabled_tests); // This flag brings the debugger on an assertion failure. GTEST_DECLARE_bool_(break_on_failure); // This flag controls whether Google Test catches all test-thrown exceptions // and logs them as failures. GTEST_DECLARE_bool_(catch_exceptions); // This flag enables using colors in terminal output. Available values are // "yes" to enable colors, "no" (disable colors), or "auto" (the default) // to let Google Test decide. GTEST_DECLARE_string_(color); // This flag sets up the filter to select by name using a glob pattern // the tests to run. If the filter is not given all tests are executed. GTEST_DECLARE_string_(filter); // This flag causes the Google Test to list tests. None of the tests listed // are actually run if the flag is provided. GTEST_DECLARE_bool_(list_tests); // This flag controls whether Google Test emits a detailed XML report to a file // in addition to its normal textual output. GTEST_DECLARE_string_(output); // This flags control whether Google Test prints the elapsed time for each // test. GTEST_DECLARE_bool_(print_time); // This flag specifies the random number seed. GTEST_DECLARE_int32_(random_seed); // This flag sets how many times the tests are repeated. The default value // is 1. If the value is -1 the tests are repeating forever. GTEST_DECLARE_int32_(repeat); // This flag controls whether Google Test includes Google Test internal // stack frames in failure stack traces. GTEST_DECLARE_bool_(show_internal_stack_frames); // When this flag is specified, tests' order is randomized on every iteration. GTEST_DECLARE_bool_(shuffle); // This flag specifies the maximum number of stack frames to be // printed in a failure message. GTEST_DECLARE_int32_(stack_trace_depth); // When this flag is specified, a failed assertion will throw an // exception if exceptions are enabled, or exit the program with a // non-zero code otherwise. GTEST_DECLARE_bool_(throw_on_failure); // When this flag is set with a "host:port" string, on supported // platforms test results are streamed to the specified port on // the specified host machine. GTEST_DECLARE_string_(stream_result_to); // The upper limit for valid stack trace depths. const int kMaxStackTraceDepth = 100; namespace internal { class AssertHelper; class DefaultGlobalTestPartResultReporter; class ExecDeathTest; class NoExecDeathTest; class FinalSuccessChecker; class GTestFlagSaver; class TestResultAccessor; class TestEventListenersAccessor; class TestEventRepeater; class WindowsDeathTest; class UnitTestImpl* GetUnitTestImpl(); void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared in gtest-internal.h but defined here, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable) { return (Message() << streamable).GetString(); } } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest; // A class for indicating whether an assertion was successful. When // the assertion wasn't successful, the AssertionResult object // remembers a non-empty message that describes how it failed. // // To create an instance of this class, use one of the factory functions // (AssertionSuccess() and AssertionFailure()). // // This class is useful for two purposes: // 1. Defining predicate functions to be used with Boolean test assertions // EXPECT_TRUE/EXPECT_FALSE and their ASSERT_ counterparts // 2. Defining predicate-format functions to be // used with predicate assertions (ASSERT_PRED_FORMAT*, etc). // // For example, if you define IsEven predicate: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then the failed expectation EXPECT_TRUE(IsEven(Fib(5))) // will print the message // // Value of: IsEven(Fib(5)) // Actual: false (5 is odd) // Expected: true // // instead of a more opaque // // Value of: IsEven(Fib(5)) // Actual: false // Expected: true // // in case IsEven is a simple Boolean predicate. // // If you expect your predicate to be reused and want to support informative // messages in EXPECT_FALSE and ASSERT_FALSE (negative assertions show up // about half as often as positive ones in our tests), supply messages for // both success and failure cases: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess() << n << " is even"; // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then a statement EXPECT_FALSE(IsEven(Fib(6))) will print // // Value of: IsEven(Fib(6)) // Actual: true (8 is even) // Expected: false // // NB: Predicates that support negative Boolean assertions have reduced // performance in positive ones so be careful not to use them in tests // that have lots (tens of thousands) of positive Boolean assertions. // // To use this class with EXPECT_PRED_FORMAT assertions such as: // // // Verifies that Foo() returns an even number. // EXPECT_PRED_FORMAT1(IsEven, Foo()); // // you need to define: // // testing::AssertionResult IsEven(const char* expr, int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() // << "Expected: " << expr << " is even\n Actual: it's " << n; // } // // If Foo() returns 5, you will see the following message: // // Expected: Foo() is even // Actual: it's 5 // class GTEST_API_ AssertionResult { public: // Copy constructor. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult(const AssertionResult& other); // Used in the EXPECT_TRUE/FALSE(bool_expression). explicit AssertionResult(bool success) : success_(success) {} // Returns true iff the assertion succeeded. operator bool() const { return success_; } // NOLINT // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult operator!() const; // Returns the text streamed into this AssertionResult. Test assertions // use it when they fail (i.e., the predicate's outcome doesn't match the // assertion's expectation). When nothing has been streamed into the // object, returns an empty string. const char* message() const { return message_.get() != NULL ? message_->c_str() : ""; } // TODO(vladl@google.com): Remove this after making sure no clients use it. // Deprecated; please use message() instead. const char* failure_message() const { return message(); } // Streams a custom failure message into this object. template AssertionResult& operator<<(const T& value) { AppendMessage(Message() << value); return *this; } // Allows streaming basic output manipulators such as endl or flush into // this object. AssertionResult& operator<<( ::std::ostream& (*basic_manipulator)(::std::ostream& stream)) { AppendMessage(Message() << basic_manipulator); return *this; } private: // Appends the contents of message to message_. void AppendMessage(const Message& a_message) { if (message_.get() == NULL) message_.reset(new ::std::string); message_->append(a_message.GetString().c_str()); } // Stores result of the assertion predicate. bool success_; // Stores the message describing the condition in case the expectation // construct is not satisfied with the predicate's outcome. // Referenced via a pointer to avoid taking too much stack frame space // with test assertions. internal::scoped_ptr< ::std::string> message_; GTEST_DISALLOW_ASSIGN_(AssertionResult); }; // Makes a successful assertion result. GTEST_API_ AssertionResult AssertionSuccess(); // Makes a failed assertion result. GTEST_API_ AssertionResult AssertionFailure(); // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << msg. GTEST_API_ AssertionResult AssertionFailure(const Message& msg); // The abstract class that all tests inherit from. // // In Google Test, a unit test program contains one or many TestCases, and // each TestCase contains one or many Tests. // // When you define a test using the TEST macro, you don't need to // explicitly derive from Test - the TEST macro automatically does // this for you. // // The only time you derive from Test is when defining a test fixture // to be used a TEST_F. For example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { ... } // virtual void TearDown() { ... } // ... // }; // // TEST_F(FooTest, Bar) { ... } // TEST_F(FooTest, Baz) { ... } // // Test is not copyable. class GTEST_API_ Test { public: friend class TestInfo; // Defines types for pointers to functions that set up and tear down // a test case. typedef internal::SetUpTestCaseFunc SetUpTestCaseFunc; typedef internal::TearDownTestCaseFunc TearDownTestCaseFunc; // The d'tor is virtual as we intend to inherit from Test. virtual ~Test(); // Sets up the stuff shared by all tests in this test case. // // Google Test will call Foo::SetUpTestCase() before running the first // test in test case Foo. Hence a sub-class can define its own // SetUpTestCase() method to shadow the one defined in the super // class. static void SetUpTestCase() {} // Tears down the stuff shared by all tests in this test case. // // Google Test will call Foo::TearDownTestCase() after running the last // test in test case Foo. Hence a sub-class can define its own // TearDownTestCase() method to shadow the one defined in the super // class. static void TearDownTestCase() {} // Returns true iff the current test has a fatal failure. static bool HasFatalFailure(); // Returns true iff the current test has a non-fatal failure. static bool HasNonfatalFailure(); // Returns true iff the current test has a (either fatal or // non-fatal) failure. static bool HasFailure() { return HasFatalFailure() || HasNonfatalFailure(); } // Logs a property for the current test. Only the last value for a given // key is remembered. // These are public static so they can be called from utility functions // that are not members of the test fixture. // The arguments are const char* instead strings, as Google Test is used // on platforms where string doesn't compile. // // Note that a driving consideration for these RecordProperty methods // was to produce xml output suited to the Greenspan charting utility, // which at present will only chart values that fit in a 32-bit int. It // is the user's responsibility to restrict their values to 32-bit ints // if they intend them to be used with Greenspan. static void RecordProperty(const char* key, const char* value); static void RecordProperty(const char* key, int value); protected: // Creates a Test object. Test(); // Sets up the test fixture. virtual void SetUp(); // Tears down the test fixture. virtual void TearDown(); private: // Returns true iff the current test has the same fixture class as // the first test in the current test case. static bool HasSameFixtureClass(); // Runs the test after the test fixture has been set up. // // A sub-class must implement this to define the test logic. // // DO NOT OVERRIDE THIS FUNCTION DIRECTLY IN A USER PROGRAM. // Instead, use the TEST or TEST_F macro. virtual void TestBody() = 0; // Sets up, executes, and tears down the test. void Run(); // Deletes self. We deliberately pick an unusual name for this // internal method to avoid clashing with names used in user TESTs. void DeleteSelf_() { delete this; } // Uses a GTestFlagSaver to save and restore all Google Test flags. const internal::GTestFlagSaver* const gtest_flag_saver_; // Often a user mis-spells SetUp() as Setup() and spends a long time // wondering why it is never called by Google Test. The declaration of // the following method is solely for catching such an error at // compile time: // // - The return type is deliberately chosen to be not void, so it // will be a conflict if a user declares void Setup() in his test // fixture. // // - This method is private, so it will be another compiler error // if a user calls it from his test fixture. // // DO NOT OVERRIDE THIS FUNCTION. // // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } // We disallow copying Tests. GTEST_DISALLOW_COPY_AND_ASSIGN_(Test); }; typedef internal::TimeInMillis TimeInMillis; // A copyable object representing a user specified test property which can be // output as a key/value string pair. // // Don't inherit from TestProperty as its destructor is not virtual. class TestProperty { public: // C'tor. TestProperty does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestProperty object. TestProperty(const char* a_key, const char* a_value) : key_(a_key), value_(a_value) { } // Gets the user supplied key. const char* key() const { return key_.c_str(); } // Gets the user supplied value. const char* value() const { return value_.c_str(); } // Sets a new value, overriding the one supplied in the constructor. void SetValue(const char* new_value) { value_ = new_value; } private: // The key supplied by the user. internal::String key_; // The value supplied by the user. internal::String value_; }; // The result of a single Test. This includes a list of // TestPartResults, a list of TestProperties, a count of how many // death tests there are in the Test, and how much time it took to run // the Test. // // TestResult is not copyable. class GTEST_API_ TestResult { public: // Creates an empty TestResult. TestResult(); // D'tor. Do not inherit from TestResult. ~TestResult(); // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int total_part_count() const; // Returns the number of the test properties. int test_property_count() const; // Returns true iff the test passed (i.e. no test part failed). bool Passed() const { return !Failed(); } // Returns true iff the test failed. bool Failed() const; // Returns true iff the test fatally failed. bool HasFatalFailure() const; // Returns true iff the test has a non-fatal failure. bool HasNonfatalFailure() const; // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test part result among all the results. i can range // from 0 to test_property_count() - 1. If i is not in that range, aborts // the program. const TestPartResult& GetTestPartResult(int i) const; // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& GetTestProperty(int i) const; private: friend class TestInfo; friend class UnitTest; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::ExecDeathTest; friend class internal::TestResultAccessor; friend class internal::UnitTestImpl; friend class internal::WindowsDeathTest; // Gets the vector of TestPartResults. const std::vector& test_part_results() const { return test_part_results_; } // Gets the vector of TestProperties. const std::vector& test_properties() const { return test_properties_; } // Sets the elapsed time. void set_elapsed_time(TimeInMillis elapsed) { elapsed_time_ = elapsed; } // Adds a test property to the list. The property is validated and may add // a non-fatal failure if invalid (e.g., if it conflicts with reserved // key names). If a property is already recorded for the same key, the // value will be updated, rather than storing multiple values for the same // key. void RecordProperty(const TestProperty& test_property); // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. // TODO(russr): Validate attribute names are legal and human readable. static bool ValidateTestProperty(const TestProperty& test_property); // Adds a test part result to the list. void AddTestPartResult(const TestPartResult& test_part_result); // Returns the death test count. int death_test_count() const { return death_test_count_; } // Increments the death test count, returning the new count. int increment_death_test_count() { return ++death_test_count_; } // Clears the test part results. void ClearTestPartResults(); // Clears the object. void Clear(); // Protects mutable state of the property vector and of owned // properties, whose values may be updated. internal::Mutex test_properites_mutex_; // The vector of TestPartResults std::vector test_part_results_; // The vector of TestProperties std::vector test_properties_; // Running count of death tests. int death_test_count_; // The elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestResult. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestResult); }; // class TestResult // A TestInfo object stores the following information about a test: // // Test case name // Test name // Whether the test should be run // A function pointer that creates the test object when invoked // Test result // // The constructor of TestInfo registers itself with the UnitTest // singleton such that the RUN_ALL_TESTS() macro knows which tests to // run. class GTEST_API_ TestInfo { public: // Destructs a TestInfo object. This function is not virtual, so // don't inherit from TestInfo. ~TestInfo(); // Returns the test case name. const char* test_case_name() const { return test_case_name_.c_str(); } // Returns the test name. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a typed // or a type-parameterized test. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns the text representation of the value parameter, or NULL if this // is not a value-parameterized test. const char* value_param() const { if (value_param_.get() != NULL) return value_param_->c_str(); return NULL; } // Returns true if this test should run, that is if the test is not disabled // (or it is disabled but the also_run_disabled_tests flag has been specified) // and its full name matches the user-specified filter. // // Google Test allows the user to filter the tests by their full names. // The full name of a test Bar in test case Foo is defined as // "Foo.Bar". Only the tests that match the filter will run. // // A filter is a colon-separated list of glob (not regex) patterns, // optionally followed by a '-' and a colon-separated list of // negative patterns (tests to exclude). A test is run if it // matches one of the positive patterns and does not match any of // the negative patterns. // // For example, *A*:Foo.* is a filter that matches any string that // contains the character 'A' or starts with "Foo.". bool should_run() const { return should_run_; } // Returns the result of the test. const TestResult* result() const { return &result_; } private: #if GTEST_HAS_DEATH_TEST friend class internal::DefaultDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST friend class Test; friend class TestCase; friend class internal::UnitTestImpl; friend TestInfo* internal::MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, internal::TypeId fixture_class_id, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, internal::TestFactoryBase* factory); // Constructs a TestInfo object. The newly constructed instance assumes // ownership of the factory object. TestInfo(const char* test_case_name, const char* name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory); // Increments the number of death tests encountered in this test so // far. int increment_death_test_count() { return result_.increment_death_test_count(); } // Creates the test object, runs it, records its result, and then // deletes it. void Run(); static void ClearTestResult(TestInfo* test_info) { test_info->result_.Clear(); } // These fields are immutable properties of the test. const std::string test_case_name_; // Test case name const std::string name_; // Test name // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // Text representation of the value parameter, or NULL if this is not a // value-parameterized test. const internal::scoped_ptr value_param_; const internal::TypeId fixture_class_id_; // ID of the test fixture class bool should_run_; // True iff this test should run bool is_disabled_; // True iff this test is disabled bool matches_filter_; // True if this test matches the // user-specified filter. internal::TestFactoryBase* const factory_; // The factory that creates // the test object // This field is mutable and needs to be reset before running the // test for the second time. TestResult result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestInfo); }; // A test case, which consists of a vector of TestInfos. // // TestCase is not copyable. class GTEST_API_ TestCase { public: // Creates a TestCase with the given name. // // TestCase does NOT have a default constructor. Always use this // constructor to create a TestCase object. // // Arguments: // // name: name of the test case // a_type_param: the name of the test's type parameter, or NULL if // this is not a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase(const char* name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Destructor of TestCase. virtual ~TestCase(); // Gets the name of the TestCase. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a // type-parameterized test case. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns true if any test in this test case should run. bool should_run() const { return should_run_; } // Gets the number of successful tests in this test case. int successful_test_count() const; // Gets the number of failed tests in this test case. int failed_test_count() const; // Gets the number of disabled tests in this test case. int disabled_test_count() const; // Get the number of tests in this test case that should run. int test_to_run_count() const; // Gets the number of all tests in this test case. int total_test_count() const; // Returns true iff the test case passed. bool Passed() const { return !Failed(); } // Returns true iff the test case failed. bool Failed() const { return failed_test_count() > 0; } // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* GetTestInfo(int i) const; private: friend class Test; friend class internal::UnitTestImpl; // Gets the (mutable) vector of TestInfos in this TestCase. std::vector& test_info_list() { return test_info_list_; } // Gets the (immutable) vector of TestInfos in this TestCase. const std::vector& test_info_list() const { return test_info_list_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* GetMutableTestInfo(int i); // Sets the should_run member. void set_should_run(bool should) { should_run_ = should; } // Adds a TestInfo to this test case. Will delete the TestInfo upon // destruction of the TestCase object. void AddTestInfo(TestInfo * test_info); // Clears the results of all tests in this test case. void ClearResult(); // Clears the results of all tests in the given test case. static void ClearTestCaseResult(TestCase* test_case) { test_case->ClearResult(); } // Runs every test in this TestCase. void Run(); // Runs SetUpTestCase() for this TestCase. This wrapper is needed // for catching exceptions thrown from SetUpTestCase(). void RunSetUpTestCase() { (*set_up_tc_)(); } // Runs TearDownTestCase() for this TestCase. This wrapper is // needed for catching exceptions thrown from TearDownTestCase(). void RunTearDownTestCase() { (*tear_down_tc_)(); } // Returns true iff test passed. static bool TestPassed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Passed(); } // Returns true iff test failed. static bool TestFailed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Failed(); } // Returns true iff test is disabled. static bool TestDisabled(const TestInfo* test_info) { return test_info->is_disabled_; } // Returns true if the given test should run. static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. internal::String name_; // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // The vector of TestInfos in their original order. It owns the // elements in the vector. std::vector test_info_list_; // Provides a level of indirection for the test list to allow easy // shuffling and restoring the test order. The i-th element in this // vector is the index of the i-th test in the shuffled test list. std::vector test_indices_; // Pointer to the function that sets up the test case. Test::SetUpTestCaseFunc set_up_tc_; // Pointer to the function that tears down the test case. Test::TearDownTestCaseFunc tear_down_tc_; // True iff any test in this test case should run. bool should_run_; // Elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestCases. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestCase); }; // An Environment object is capable of setting up and tearing down an // environment. The user should subclass this to define his own // environment(s). // // An Environment object does the set-up and tear-down in virtual // methods SetUp() and TearDown() instead of the constructor and the // destructor, as: // // 1. You cannot safely throw from a destructor. This is a problem // as in some cases Google Test is used where exceptions are enabled, and // we may want to implement ASSERT_* using exceptions where they are // available. // 2. You cannot use ASSERT_* directly in a constructor or // destructor. class Environment { public: // The d'tor is virtual as we need to subclass Environment. virtual ~Environment() {} // Override this to define how to set up the environment. virtual void SetUp() {} // Override this to define how to tear down the environment. virtual void TearDown() {} private: // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } }; // The interface for tracing execution of tests. The methods are organized in // the order the corresponding events are fired. class TestEventListener { public: virtual ~TestEventListener() {} // Fired before any test activity starts. virtual void OnTestProgramStart(const UnitTest& unit_test) = 0; // Fired before each iteration of tests starts. There may be more than // one iteration if GTEST_FLAG(repeat) is set. iteration is the iteration // index, starting from 0. virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration) = 0; // Fired before environment set-up for each iteration of tests starts. virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test) = 0; // Fired after environment set-up for each iteration of tests ends. virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test) = 0; // Fired before the test case starts. virtual void OnTestCaseStart(const TestCase& test_case) = 0; // Fired before the test starts. virtual void OnTestStart(const TestInfo& test_info) = 0; // Fired after a failed assertion or a SUCCEED() invocation. virtual void OnTestPartResult(const TestPartResult& test_part_result) = 0; // Fired after the test ends. virtual void OnTestEnd(const TestInfo& test_info) = 0; // Fired after the test case ends. virtual void OnTestCaseEnd(const TestCase& test_case) = 0; // Fired before environment tear-down for each iteration of tests starts. virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test) = 0; // Fired after environment tear-down for each iteration of tests ends. virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test) = 0; // Fired after each iteration of tests finishes. virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration) = 0; // Fired after all test activities have ended. virtual void OnTestProgramEnd(const UnitTest& unit_test) = 0; }; // The convenience class for users who need to override just one or two // methods and are not concerned that a possible change to a signature of // the methods they override will not be caught during the build. For // comments about each method please see the definition of TestEventListener // above. class EmptyTestEventListener : public TestEventListener { public: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& /*test_case*/) {} virtual void OnTestStart(const TestInfo& /*test_info*/) {} virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {} virtual void OnTestEnd(const TestInfo& /*test_info*/) {} virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {} virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} }; // TestEventListeners lets users add listeners to track events in Google Test. class GTEST_API_ TestEventListeners { public: TestEventListeners(); ~TestEventListeners(); // Appends an event listener to the end of the list. Google Test assumes // the ownership of the listener (i.e. it will delete the listener when // the test program finishes). void Append(TestEventListener* listener); // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* Release(TestEventListener* listener); // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the caller and makes this // function return NULL the next time. TestEventListener* default_result_printer() const { return default_result_printer_; } // Returns the standard listener responsible for the default XML output // controlled by the --gtest_output=xml flag. Can be removed from the // listeners list by users who want to shut down the default XML output // controlled by this flag and substitute it with custom one. Note that // removing this object from the listener list with Release transfers its // ownership to the caller and makes this function return NULL the next // time. TestEventListener* default_xml_generator() const { return default_xml_generator_; } private: friend class TestCase; friend class TestInfo; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::NoExecDeathTest; friend class internal::TestEventListenersAccessor; friend class internal::UnitTestImpl; // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* repeater(); // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultResultPrinter(TestEventListener* listener); // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultXmlGenerator(TestEventListener* listener); // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool EventForwardingEnabled() const; void SuppressEventForwarding(); // The actual list of listeners. internal::TestEventRepeater* repeater_; // Listener responsible for the standard result output. TestEventListener* default_result_printer_; // Listener responsible for the creation of the XML output file. TestEventListener* default_xml_generator_; // We disallow copying TestEventListeners. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventListeners); }; // A UnitTest consists of a vector of TestCases. // // This is a singleton class. The only instance of UnitTest is // created when UnitTest::GetInstance() is first called. This // instance is never deleted. // // UnitTest is not copyable. // // This class is thread-safe as long as the methods are called // according to their specification. class GTEST_API_ UnitTest { public: // Gets the singleton UnitTest object. The first time this method // is called, a UnitTest object is constructed and returned. // Consecutive calls will return the same object. static UnitTest* GetInstance(); // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // This method can only be called from the main thread. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. int Run() GTEST_MUST_USE_RESULT_; // Returns the working directory when the first TEST() or TEST_F() // was executed. The UnitTest object owns the string. const char* original_working_dir() const; // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. const TestCase* current_test_case() const; // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. const TestInfo* current_test_info() const; // Returns the random seed used at the start of the current test run. int random_seed() const; #if GTEST_HAS_PARAM_TEST // Returns the ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::ParameterizedTestCaseRegistry& parameterized_test_registry(); #endif // GTEST_HAS_PARAM_TEST // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const; // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const; // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const; // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const; // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& listeners(); private: // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in // the order they were registered. After all tests in the program // have finished, all global test environments will be torn-down in // the *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // This method can only be called from the main thread. Environment* AddEnvironment(Environment* env); // Adds a TestPartResult to the current TestResult object. All // Google Test assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) // eventually call this to report their results. The user code // should use the assertion macros instead of calling this directly. void AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace); // Adds a TestProperty to the current TestResult object. If the result already // contains a property with the same key, the value will be updated. void RecordPropertyForCurrentTest(const char* key, const char* value); // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i); // Accessors for the implementation object. internal::UnitTestImpl* impl() { return impl_; } const internal::UnitTestImpl* impl() const { return impl_; } // These classes and funcions are friends as they need to access private // members of UnitTest. friend class Test; friend class internal::AssertHelper; friend class internal::ScopedTrace; friend Environment* AddGlobalTestEnvironment(Environment* env); friend internal::UnitTestImpl* internal::GetUnitTestImpl(); friend void internal::ReportFailureInUnknownLocation( TestPartResult::Type result_type, const internal::String& message); // Creates an empty UnitTest. UnitTest(); // D'tor virtual ~UnitTest(); // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. void PushGTestTrace(const internal::TraceInfo& trace); // Pops a trace from the per-thread Google Test trace stack. void PopGTestTrace(); // Protects mutable state in *impl_. This is mutable as some const // methods need to lock it too. mutable internal::Mutex mutex_; // Opaque implementation object. This field is never changed once // the object is constructed. We don't mark it as const here, as // doing so will cause a warning in the constructor of UnitTest. // Mutable state in *impl_ is protected by mutex_. internal::UnitTestImpl* impl_; // We disallow copying UnitTest. GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTest); }; // A convenient wrapper for adding an environment for the test // program. // // You should call this before RUN_ALL_TESTS() is called, probably in // main(). If you use gtest_main, you need to call this before main() // starts for it to take effect. For example, you can define a global // variable like this: // // testing::Environment* const foo_env = // testing::AddGlobalTestEnvironment(new FooEnvironment); // // However, we strongly recommend you to write your own main() and // call AddGlobalTestEnvironment() there, as relying on initialization // of global variables makes the code harder to read and may cause // problems when you register multiple environments from different // translation units and the environments have dependencies among them // (remember that the compiler doesn't guarantee the order in which // global variables from different translation units are initialized). inline Environment* AddGlobalTestEnvironment(Environment* env) { return UnitTest::GetInstance()->AddEnvironment(env); } // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. GTEST_API_ void InitGoogleTest(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. GTEST_API_ void InitGoogleTest(int* argc, wchar_t** argv); namespace internal { // Formats a comparison assertion (e.g. ASSERT_EQ, EXPECT_LT, and etc) // operand to be used in a failure message. The type (but not value) // of the other operand may affect the format. This allows us to // print a char* as a raw pointer when it is compared against another // char*, and print it as a C string when it is compared against an // std::string object, for example. // // The default implementation ignores the type of the other operand. // Some specialized versions are used to handle formatting wide or // narrow C strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template String FormatForComparisonFailureMessage(const T1& value, const T2& /* other_operand */) { // C++Builder compiles this incorrectly if the namespace isn't explicitly // given. return ::testing::PrintToString(value); } // The helper function for {ASSERT|EXPECT}_EQ. template AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4389) // Temporarily disables warning on // signed/unsigned mismatch. #endif if (expected == actual) { return AssertionSuccess(); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous enums // can be implicitly cast to BiggestInt. GTEST_API_ AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual); // The helper class for {ASSERT|EXPECT}_EQ. The template argument // lhs_is_null_literal is true iff the first argument to ASSERT_EQ() // is a null pointer literal. The following default implementation is // for lhs_is_null_literal being false. template class EqHelper { public: // This templatized version is for the general case. template static AssertionResult Compare(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous // enums can be implicitly cast to BiggestInt. // // Even though its body looks the same as the above version, we // cannot merge the two, as it will make anonymous enums unhappy. static AssertionResult Compare(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } }; // This specialization is used when the first argument to ASSERT_EQ() // is a null pointer literal, like NULL, false, or 0. template <> class EqHelper { public: // We define two overloaded versions of Compare(). The first // version will be picked when the second argument to ASSERT_EQ() is // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or // EXPECT_EQ(false, a_bool). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual, // The following line prevents this overload from being considered if T2 // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr) // expands to Compare("", "", NULL, my_ptr), which requires a conversion // to match the Secret* in the other overload, which would otherwise make // this template match better. typename EnableIf::value>::type* = 0) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // This version will be picked when the second argument to ASSERT_EQ() is a // pointer, e.g. ASSERT_EQ(NULL, a_pointer). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, // We used to have a second template parameter instead of Secret*. That // template parameter would deduce to 'long', making this a better match // than the first overload even without the first overload's EnableIf. // Unfortunately, gcc with -Wconversion-null warns when "passing NULL to // non-pointer argument" (even a deduced integral argument), so the old // implementation caused warnings in user code. Secret* /* expected (NULL) */, T* actual) { // We already know that 'expected' is a null pointer. return CmpHelperEQ(expected_expression, actual_expression, static_cast(NULL), actual); } }; // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_??. It is here just to avoid copy-and-paste // of similar code. // // For each templatized helper function, we also define an overloaded // version for BiggestInt in order to reduce code bloat and allow // anonymous enums to be used with {ASSERT|EXPECT}_?? when compiled // with gcc 4. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ template \ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ const T1& val1, const T2& val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ }\ GTEST_API_ AssertionResult CmpHelper##op_name(\ const char* expr1, const char* expr2, BiggestInt val1, BiggestInt val2) // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // Implements the helper function for {ASSERT|EXPECT}_NE GTEST_IMPL_CMP_HELPER_(NE, !=); // Implements the helper function for {ASSERT|EXPECT}_LE GTEST_IMPL_CMP_HELPER_(LE, <=); // Implements the helper function for {ASSERT|EXPECT}_LT GTEST_IMPL_CMP_HELPER_(LT, < ); // Implements the helper function for {ASSERT|EXPECT}_GE GTEST_IMPL_CMP_HELPER_(GE, >=); // Implements the helper function for {ASSERT|EXPECT}_GT GTEST_IMPL_CMP_HELPER_(GT, > ); #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRCASEEQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRNE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // The helper function for {ASSERT|EXPECT}_STRCASENE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // Helper function for *_STREQ on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual); // Helper function for *_STRNE on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2); } // namespace internal // IsSubstring() and IsNotSubstring() are intended to be used as the // first argument to {EXPECT,ASSERT}_PRED_FORMAT2(), not by // themselves. They check whether needle is a substring of haystack // (NULL is considered a substring of itself only), and return an // appropriate error message when they fail. // // The {needle,haystack}_expr arguments are the stringified // expressions that generated the two real arguments. GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); #if GTEST_HAS_STD_WSTRING GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); #endif // GTEST_HAS_STD_WSTRING namespace internal { // Helper template function for comparing floating-points. // // Template parameter: // // RawType: the raw floating-point type (either float or double) // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template AssertionResult CmpHelperFloatingPointEQ(const char* expected_expression, const char* actual_expression, RawType expected, RawType actual) { const FloatingPoint lhs(expected), rhs(actual); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } ::std::stringstream expected_ss; expected_ss << std::setprecision(std::numeric_limits::digits10 + 2) << expected; ::std::stringstream actual_ss; actual_ss << std::setprecision(std::numeric_limits::digits10 + 2) << actual; return EqFailure(expected_expression, actual_expression, StringStreamToString(&expected_ss), StringStreamToString(&actual_ss), false); } // Helper function for implementing ASSERT_NEAR. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error); // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // A class that enables one to stream messages to assertion macros class GTEST_API_ AssertHelper { public: // Constructor. AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message); ~AssertHelper(); // Message assignment is a semantic trick to enable assertion // streaming; see the GTEST_MESSAGE_ macro below. void operator=(const Message& message) const; private: // We put our data in a struct so that the size of the AssertHelper class can // be as small as possible. This is important because gcc is incapable of // re-using stack space even for temporary variables, so every EXPECT_EQ // reserves stack space for another AssertHelper. struct AssertHelperData { AssertHelperData(TestPartResult::Type t, const char* srcfile, int line_num, const char* msg) : type(t), file(srcfile), line(line_num), message(msg) { } TestPartResult::Type const type; const char* const file; int const line; String const message; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelperData); }; AssertHelperData* const data_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelper); }; } // namespace internal #if GTEST_HAS_PARAM_TEST // The pure interface class that all value-parameterized tests inherit from. // A value-parameterized class must inherit from both ::testing::Test and // ::testing::WithParamInterface. In most cases that just means inheriting // from ::testing::TestWithParam, but more complicated test hierarchies // may need to inherit from Test and WithParamInterface at different levels. // // This interface has support for accessing the test parameter value via // the GetParam() method. // // Use it with one of the parameter generator defining functions, like Range(), // Values(), ValuesIn(), Bool(), and Combine(). // // class FooTest : public ::testing::TestWithParam { // protected: // FooTest() { // // Can use GetParam() here. // } // virtual ~FooTest() { // // Can use GetParam() here. // } // virtual void SetUp() { // // Can use GetParam() here. // } // virtual void TearDown { // // Can use GetParam() here. // } // }; // TEST_P(FooTest, DoesBar) { // // Can use GetParam() method here. // Foo foo; // ASSERT_TRUE(foo.DoesBar(GetParam())); // } // INSTANTIATE_TEST_CASE_P(OneToTenRange, FooTest, ::testing::Range(1, 10)); template class WithParamInterface { public: typedef T ParamType; virtual ~WithParamInterface() {} // The current parameter value. Is also available in the test fixture's // constructor. This member function is non-static, even though it only // references static data, to reduce the opportunity for incorrect uses // like writing 'WithParamInterface::GetParam()' for a test that // uses a fixture whose parameter type is int. const ParamType& GetParam() const { return *parameter_; } private: // Sets parameter value. The caller is responsible for making sure the value // remains alive and unchanged throughout the current test. static void SetParam(const ParamType* parameter) { parameter_ = parameter; } // Static value used for accessing parameter during a test lifetime. static const ParamType* parameter_; // TestClass must be a subclass of WithParamInterface and Test. template friend class internal::ParameterizedTestFactory; }; template const T* WithParamInterface::parameter_ = NULL; // Most value-parameterized classes can ignore the existence of // WithParamInterface, and can just inherit from ::testing::TestWithParam. template class TestWithParam : public Test, public WithParamInterface { }; #endif // GTEST_HAS_PARAM_TEST // Macros for indicating success/failure in test code. // ADD_FAILURE unconditionally adds a failure to the current test. // SUCCEED generates a success - it doesn't automatically make the // current test successful, as a test is only successful when it has // no failure. // // EXPECT_* verifies that a certain condition is satisfied. If not, // it behaves like ADD_FAILURE. In particular: // // EXPECT_TRUE verifies that a Boolean condition is true. // EXPECT_FALSE verifies that a Boolean condition is false. // // FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except // that they will also abort the current function on failure. People // usually want the fail-fast behavior of FAIL and ASSERT_*, but those // writing data-driven tests often find themselves using ADD_FAILURE // and EXPECT_* more. // // Examples: // // EXPECT_TRUE(server.StatusIsOK()); // ASSERT_FALSE(server.HasPendingRequest(port)) // << "There are still pending requests " << "on port " << port; // Generates a nonfatal failure with a generic message. #define ADD_FAILURE() GTEST_NONFATAL_FAILURE_("Failed") // Generates a nonfatal failure at the given source file location with // a generic message. #define ADD_FAILURE_AT(file, line) \ GTEST_MESSAGE_AT_(file, line, "Failed", \ ::testing::TestPartResult::kNonFatalFailure) // Generates a fatal failure with a generic message. #define GTEST_FAIL() GTEST_FATAL_FAILURE_("Failed") // Define this macro to 1 to omit the definition of FAIL(), which is a // generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_FAIL # define FAIL() GTEST_FAIL() #endif // Generates a success with a generic message. #define GTEST_SUCCEED() GTEST_SUCCESS_("Succeeded") // Define this macro to 1 to omit the definition of SUCCEED(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_SUCCEED # define SUCCEED() GTEST_SUCCEED() #endif // Macros for testing exceptions. // // * {ASSERT|EXPECT}_THROW(statement, expected_exception): // Tests that the statement throws the expected exception. // * {ASSERT|EXPECT}_NO_THROW(statement): // Tests that the statement doesn't throw any exception. // * {ASSERT|EXPECT}_ANY_THROW(statement): // Tests that the statement throws an exception. #define EXPECT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_NONFATAL_FAILURE_) #define EXPECT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define EXPECT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define ASSERT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_FATAL_FAILURE_) #define ASSERT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_FATAL_FAILURE_) #define ASSERT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_FATAL_FAILURE_) // Boolean assertions. Condition can be either a Boolean expression or an // AssertionResult. For more information on how to use AssertionResult with // these macros see comments on that class. #define EXPECT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_NONFATAL_FAILURE_) #define EXPECT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_NONFATAL_FAILURE_) #define ASSERT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_FATAL_FAILURE_) #define ASSERT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_FATAL_FAILURE_) // Includes the auto-generated header that implements a family of // generic predicate assertion macros. #include "gtest/gtest_pred_impl.h" // Macros for testing equalities and inequalities. // // * {ASSERT|EXPECT}_EQ(expected, actual): Tests that expected == actual // * {ASSERT|EXPECT}_NE(v1, v2): Tests that v1 != v2 // * {ASSERT|EXPECT}_LT(v1, v2): Tests that v1 < v2 // * {ASSERT|EXPECT}_LE(v1, v2): Tests that v1 <= v2 // * {ASSERT|EXPECT}_GT(v1, v2): Tests that v1 > v2 // * {ASSERT|EXPECT}_GE(v1, v2): Tests that v1 >= v2 // // When they are not, Google Test prints both the tested expressions and // their actual values. The values must be compatible built-in types, // or you will get a compiler error. By "compatible" we mean that the // values can be compared by the respective operator. // // Note: // // 1. It is possible to make a user-defined type work with // {ASSERT|EXPECT}_??(), but that requires overloading the // comparison operators and is thus discouraged by the Google C++ // Usage Guide. Therefore, you are advised to use the // {ASSERT|EXPECT}_TRUE() macro to assert that two objects are // equal. // // 2. The {ASSERT|EXPECT}_??() macros do pointer comparisons on // pointers (in particular, C strings). Therefore, if you use it // with two C strings, you are testing how their locations in memory // are related, not how their content is related. To compare two C // strings by content, use {ASSERT|EXPECT}_STR*(). // // 3. {ASSERT|EXPECT}_EQ(expected, actual) is preferred to // {ASSERT|EXPECT}_TRUE(expected == actual), as the former tells you // what the actual value is when it fails, and similarly for the // other comparisons. // // 4. Do not depend on the order in which {ASSERT|EXPECT}_??() // evaluate their arguments, which is undefined. // // 5. These macros evaluate their arguments exactly once. // // Examples: // // EXPECT_NE(5, Foo()); // EXPECT_EQ(NULL, a_pointer); // ASSERT_LT(i, array_size); // ASSERT_GT(records.size(), 0) << "There is no record left."; #define EXPECT_EQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define EXPECT_NE(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperNE, expected, actual) #define EXPECT_LE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define EXPECT_LT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define EXPECT_GE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define EXPECT_GT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) #define GTEST_ASSERT_EQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define GTEST_ASSERT_NE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperNE, val1, val2) #define GTEST_ASSERT_LE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define GTEST_ASSERT_LT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define GTEST_ASSERT_GE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define GTEST_ASSERT_GT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) // Define macro GTEST_DONT_DEFINE_ASSERT_XY to 1 to omit the definition of // ASSERT_XY(), which clashes with some users' own code. #if !GTEST_DONT_DEFINE_ASSERT_EQ # define ASSERT_EQ(val1, val2) GTEST_ASSERT_EQ(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_NE # define ASSERT_NE(val1, val2) GTEST_ASSERT_NE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LE # define ASSERT_LE(val1, val2) GTEST_ASSERT_LE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LT # define ASSERT_LT(val1, val2) GTEST_ASSERT_LT(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GE # define ASSERT_GE(val1, val2) GTEST_ASSERT_GE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GT # define ASSERT_GT(val1, val2) GTEST_ASSERT_GT(val1, val2) #endif // C String Comparisons. All tests treat NULL and any non-NULL string // as different. Two NULLs are equal. // // * {ASSERT|EXPECT}_STREQ(s1, s2): Tests that s1 == s2 // * {ASSERT|EXPECT}_STRNE(s1, s2): Tests that s1 != s2 // * {ASSERT|EXPECT}_STRCASEEQ(s1, s2): Tests that s1 == s2, ignoring case // * {ASSERT|EXPECT}_STRCASENE(s1, s2): Tests that s1 != s2, ignoring case // // For wide or narrow string objects, you can use the // {ASSERT|EXPECT}_??() macros. // // Don't depend on the order in which the arguments are evaluated, // which is undefined. // // These macros evaluate their arguments exactly once. #define EXPECT_STREQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define EXPECT_STRNE(s1, s2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define EXPECT_STRCASEEQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define EXPECT_STRCASENE(s1, s2)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) #define ASSERT_STREQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define ASSERT_STRNE(s1, s2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define ASSERT_STRCASEEQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define ASSERT_STRCASENE(s1, s2)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) // Macros for comparing floating-point numbers. // // * {ASSERT|EXPECT}_FLOAT_EQ(expected, actual): // Tests that two float values are almost equal. // * {ASSERT|EXPECT}_DOUBLE_EQ(expected, actual): // Tests that two double values are almost equal. // * {ASSERT|EXPECT}_NEAR(v1, v2, abs_error): // Tests that v1 and v2 are within the given distance to each other. // // Google Test uses ULP-based comparison to automatically pick a default // error bound that is appropriate for the operands. See the // FloatingPoint template class in gtest-internal.h if you are // interested in the implementation details. #define EXPECT_FLOAT_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_DOUBLE_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_FLOAT_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_DOUBLE_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_NEAR(val1, val2, abs_error)\ EXPECT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) #define ASSERT_NEAR(val1, val2, abs_error)\ ASSERT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) // These predicate format functions work on floating-point values, and // can be used in {ASSERT|EXPECT}_PRED_FORMAT2*(), e.g. // // EXPECT_PRED_FORMAT2(testing::DoubleLE, Foo(), 5.0); // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. GTEST_API_ AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2); GTEST_API_ AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2); #if GTEST_OS_WINDOWS // Macros that test for HRESULT failure and success, these are only useful // on Windows, and rely on Windows SDK macros and APIs to compile. // // * {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}(expr) // // When expr unexpectedly fails or succeeds, Google Test prints the // expected result and the actual result with both a human-readable // string representation of the error, if available, as well as the // hex result code. # define EXPECT_HRESULT_SUCCEEDED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define ASSERT_HRESULT_SUCCEEDED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define EXPECT_HRESULT_FAILED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) # define ASSERT_HRESULT_FAILED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) #endif // GTEST_OS_WINDOWS // Macros that execute statement and check that it doesn't generate new fatal // failures in the current thread. // // * {ASSERT|EXPECT}_NO_FATAL_FAILURE(statement); // // Examples: // // EXPECT_NO_FATAL_FAILURE(Process()); // ASSERT_NO_FATAL_FAILURE(Process()) << "Process() failed"; // #define ASSERT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_FATAL_FAILURE_) #define EXPECT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_NONFATAL_FAILURE_) // Causes a trace (including the source file path, the current line // number, and the given message) to be included in every test failure // message generated by code in the current scope. The effect is // undone when the control leaves the current scope. // // The message argument can be anything streamable to std::ostream. // // In the implementation, we include the current line number as part // of the dummy variable name, thus allowing multiple SCOPED_TRACE()s // to appear in the same block - as long as they are on different // lines. #define SCOPED_TRACE(message) \ ::testing::internal::ScopedTrace GTEST_CONCAT_TOKEN_(gtest_trace_, __LINE__)(\ __FILE__, __LINE__, ::testing::Message() << (message)) // Compile-time assertion for type equality. // StaticAssertTypeEq() compiles iff type1 and type2 are // the same type. The value it returns is not interesting. // // Instead of making StaticAssertTypeEq a class template, we make it a // function template that invokes a helper class template. This // prevents a user from misusing StaticAssertTypeEq by // defining objects of that type. // // CAVEAT: // // When used inside a method of a class template, // StaticAssertTypeEq() is effective ONLY IF the method is // instantiated. For example, given: // // template class Foo { // public: // void Bar() { testing::StaticAssertTypeEq(); } // }; // // the code: // // void Test1() { Foo foo; } // // will NOT generate a compiler error, as Foo::Bar() is never // actually instantiated. Instead, you need: // // void Test2() { Foo foo; foo.Bar(); } // // to cause a compiler error. template bool StaticAssertTypeEq() { (void)internal::StaticAssertTypeEqHelper(); return true; } // Defines a test. // // The first parameter is the name of the test case, and the second // parameter is the name of the test within the test case. // // The convention is to end the test case name with "Test". For // example, a test case for the Foo class can be named FooTest. // // The user should put his test code between braces after using this // macro. Example: // // TEST(FooTest, InitializesCorrectly) { // Foo foo; // EXPECT_TRUE(foo.StatusIsOK()); // } // Note that we call GetTestTypeId() instead of GetTypeId< // ::testing::Test>() here to get the type ID of testing::Test. This // is to work around a suspected linker bug when using Google Test as // a framework on Mac OS X. The bug causes GetTypeId< // ::testing::Test>() to return different values depending on whether // the call is from the Google Test framework itself or from user test // code. GetTestTypeId() is guaranteed to always return the same // value, as it always calls GetTypeId<>() from the Google Test // framework. #define GTEST_TEST(test_case_name, test_name)\ GTEST_TEST_(test_case_name, test_name, \ ::testing::Test, ::testing::internal::GetTestTypeId()) // Define this macro to 1 to omit the definition of TEST(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_TEST # define TEST(test_case_name, test_name) GTEST_TEST(test_case_name, test_name) #endif // Defines a test that uses a test fixture. // // The first parameter is the name of the test fixture class, which // also doubles as the test case name. The second parameter is the // name of the test within the test case. // // A test fixture class must be declared earlier. The user should put // his test code between braces after using this macro. Example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { b_.AddElement(3); } // // Foo a_; // Foo b_; // }; // // TEST_F(FooTest, InitializesCorrectly) { // EXPECT_TRUE(a_.StatusIsOK()); // } // // TEST_F(FooTest, ReturnsElementCountCorrectly) { // EXPECT_EQ(0, a_.size()); // EXPECT_EQ(1, b_.size()); // } #define TEST_F(test_fixture, test_name)\ GTEST_TEST_(test_fixture, test_name, test_fixture, \ ::testing::internal::GetTypeId()) // Use this macro in main() to run all tests. It returns 0 if all // tests are successful, or 1 otherwise. // // RUN_ALL_TESTS() should be invoked after the command line has been // parsed by InitGoogleTest(). #define RUN_ALL_TESTS()\ (::testing::UnitTest::GetInstance()->Run()) } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest_pred_impl.h0000600000175000017500000003544411561126632025555 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on 09/24/2010 by command // 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! // // Implements a family of generic predicate assertion macros. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Makes sure this header is not included before gtest.h. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ # error Do not include gtest_pred_impl.h directly. Include gtest.h instead. #endif // GTEST_INCLUDE_GTEST_GTEST_H_ // This header implements a family of generic predicate assertion // macros: // // ASSERT_PRED_FORMAT1(pred_format, v1) // ASSERT_PRED_FORMAT2(pred_format, v1, v2) // ... // // where pred_format is a function or functor that takes n (in the // case of ASSERT_PRED_FORMATn) values and their source expression // text, and returns a testing::AssertionResult. See the definition // of ASSERT_EQ in gtest.h for an example. // // If you don't care about formatting, you can use the more // restrictive version: // // ASSERT_PRED1(pred, v1) // ASSERT_PRED2(pred, v1, v2) // ... // // where pred is an n-ary function or functor that returns bool, // and the values v1, v2, ..., must support the << operator for // streaming to std::ostream. // // We also define the EXPECT_* variations. // // For now we only support predicates whose arity is at most 5. // Please email googletestframework@googlegroups.com if you need // support for higher arities. // GTEST_ASSERT_ is the basic statement to which all of the assertions // in this file reduce. Don't use this in your code. #define GTEST_ASSERT_(expression, on_failure) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar = (expression)) \ ; \ else \ on_failure(gtest_ar.failure_message()) // Helper function for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. template AssertionResult AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) { if (pred(v1)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT1. // Don't use this in your code. #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ GTEST_ASSERT_(pred_format(#v1, v1),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. #define GTEST_PRED1_(pred, v1, on_failure)\ GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ #v1, \ pred, \ v1), on_failure) // Unary predicate assertion macros. #define EXPECT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_FATAL_FAILURE_) #define ASSERT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. template AssertionResult AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) { if (pred(v1, v2)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT2. // Don't use this in your code. #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. #define GTEST_PRED2_(pred, v1, v2, on_failure)\ GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, \ #v1, \ #v2, \ pred, \ v1, \ v2), on_failure) // Binary predicate assertion macros. #define EXPECT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_FATAL_FAILURE_) #define ASSERT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. template AssertionResult AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) { if (pred(v1, v2, v3)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT3. // Don't use this in your code. #define GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, v1, v2, v3),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ GTEST_ASSERT_(::testing::AssertPred3Helper(#pred, \ #v1, \ #v2, \ #v3, \ pred, \ v1, \ v2, \ v3), on_failure) // Ternary predicate assertion macros. #define EXPECT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_FATAL_FAILURE_) #define ASSERT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. template AssertionResult AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) { if (pred(v1, v2, v3, v4)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT4. // Don't use this in your code. #define GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, v1, v2, v3, v4),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. #define GTEST_PRED4_(pred, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(::testing::AssertPred4Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ pred, \ v1, \ v2, \ v3, \ v4), on_failure) // 4-ary predicate assertion macros. #define EXPECT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) #define ASSERT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. template AssertionResult AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { if (pred(v1, v2, v3, v4, v5)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ", " << e5 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4 << "\n" << e5 << " evaluates to " << v5; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT5. // Don't use this in your code. #define GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, #v5, v1, v2, v3, v4, v5),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. #define GTEST_PRED5_(pred, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(::testing::AssertPred5Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ #v5, \ pred, \ v1, \ v2, \ v3, \ v4, \ v5), on_failure) // 5-ary predicate assertion macros. #define EXPECT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #define ASSERT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/gtest_prod.h0000600000175000017500000000442411561126632024540 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Testing Framework definitions useful in production code. #ifndef GTEST_INCLUDE_GTEST_GTEST_PROD_H_ #define GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // When you need to test the private or protected members of a class, // use the FRIEND_TEST macro to declare your tests as friends of the // class. For example: // // class MyClass { // private: // void MyMethod(); // FRIEND_TEST(MyClassTest, MyMethod); // }; // // class MyClassTest : public testing::Test { // // ... // }; // // TEST_F(MyClassTest, MyMethod) { // // Can call MyClass::MyMethod() here. // } #define FRIEND_TEST(test_case_name, test_name)\ friend class test_case_name##_##test_name##_Test #endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/0000700000175000017500000000000012140644175024024 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-death-test-internal.h0000600000175000017500000003114511561126632031202 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file defines internal utilities needed for implementing // death tests. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #include "gtest/internal/gtest-internal.h" #include namespace testing { namespace internal { GTEST_DECLARE_string_(internal_run_death_test); // Names of the flags (needed for parsing Google Test flags). const char kDeathTestStyleFlag[] = "death_test_style"; const char kDeathTestUseFork[] = "death_test_use_fork"; const char kInternalRunDeathTestFlag[] = "internal_run_death_test"; #if GTEST_HAS_DEATH_TEST // DeathTest is a class that hides much of the complexity of the // GTEST_DEATH_TEST_ macro. It is abstract; its static Create method // returns a concrete class that depends on the prevailing death test // style, as defined by the --gtest_death_test_style and/or // --gtest_internal_run_death_test flags. // In describing the results of death tests, these terms are used with // the corresponding definitions: // // exit status: The integer exit information in the format specified // by wait(2) // exit code: The integer code passed to exit(3), _exit(2), or // returned from main() class GTEST_API_ DeathTest { public: // Create returns false if there was an error determining the // appropriate action to take for the current death test; for example, // if the gtest_death_test_style flag is set to an invalid value. // The LastMessage method will return a more detailed message in that // case. Otherwise, the DeathTest pointer pointed to by the "test" // argument is set. If the death test should be skipped, the pointer // is set to NULL; otherwise, it is set to the address of a new concrete // DeathTest object that controls the execution of the current test. static bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); DeathTest(); virtual ~DeathTest() { } // A helper class that aborts a death test when it's deleted. class ReturnSentinel { public: explicit ReturnSentinel(DeathTest* test) : test_(test) { } ~ReturnSentinel() { test_->Abort(TEST_ENCOUNTERED_RETURN_STATEMENT); } private: DeathTest* const test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ReturnSentinel); } GTEST_ATTRIBUTE_UNUSED_; // An enumeration of possible roles that may be taken when a death // test is encountered. EXECUTE means that the death test logic should // be executed immediately. OVERSEE means that the program should prepare // the appropriate environment for a child process to execute the death // test, then wait for it to complete. enum TestRole { OVERSEE_TEST, EXECUTE_TEST }; // An enumeration of the three reasons that a test might be aborted. enum AbortReason { TEST_ENCOUNTERED_RETURN_STATEMENT, TEST_THREW_EXCEPTION, TEST_DID_NOT_DIE }; // Assumes one of the above roles. virtual TestRole AssumeRole() = 0; // Waits for the death test to finish and returns its status. virtual int Wait() = 0; // Returns true if the death test passed; that is, the test process // exited during the test, its exit status matches a user-supplied // predicate, and its stderr output matches a user-supplied regular // expression. // The user-supplied predicate may be a macro expression rather // than a function pointer or functor, or else Wait and Passed could // be combined. virtual bool Passed(bool exit_status_ok) = 0; // Signals that the death test did not die as expected. virtual void Abort(AbortReason reason) = 0; // Returns a human-readable outcome message regarding the outcome of // the last death test. static const char* LastMessage(); static void set_last_death_test_message(const String& message); private: // A string containing a description of the outcome of the last death test. static String last_death_test_message_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest); }; // Factory interface for death tests. May be mocked out for testing. class DeathTestFactory { public: virtual ~DeathTestFactory() { } virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) = 0; }; // A concrete DeathTestFactory implementation for normal use. class DefaultDeathTestFactory : public DeathTestFactory { public: virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); }; // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. GTEST_API_ bool ExitedUnsuccessfully(int exit_status); // Traps C++ exceptions escaping statement and reports them as test // failures. Note that trapping SEH exceptions is not implemented here. # if GTEST_HAS_EXCEPTIONS # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } catch (const ::std::exception& gtest_exception) { \ fprintf(\ stderr, \ "\n%s: Caught std::exception-derived exception escaping the " \ "death test statement. Exception message: %s\n", \ ::testing::internal::FormatFileLocation(__FILE__, __LINE__).c_str(), \ gtest_exception.what()); \ fflush(stderr); \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } catch (...) { \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } # else # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) # endif // This macro is for implementing ASSERT_DEATH*, EXPECT_DEATH*, // ASSERT_EXIT*, and EXPECT_EXIT*. # define GTEST_DEATH_TEST_(statement, predicate, regex, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ const ::testing::internal::RE& gtest_regex = (regex); \ ::testing::internal::DeathTest* gtest_dt; \ if (!::testing::internal::DeathTest::Create(#statement, >est_regex, \ __FILE__, __LINE__, >est_dt)) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ if (gtest_dt != NULL) { \ ::testing::internal::scoped_ptr< ::testing::internal::DeathTest> \ gtest_dt_ptr(gtest_dt); \ switch (gtest_dt->AssumeRole()) { \ case ::testing::internal::DeathTest::OVERSEE_TEST: \ if (!gtest_dt->Passed(predicate(gtest_dt->Wait()))) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ break; \ case ::testing::internal::DeathTest::EXECUTE_TEST: { \ ::testing::internal::DeathTest::ReturnSentinel \ gtest_sentinel(gtest_dt); \ GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, gtest_dt); \ gtest_dt->Abort(::testing::internal::DeathTest::TEST_DID_NOT_DIE); \ break; \ } \ default: \ break; \ } \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__): \ fail(::testing::internal::DeathTest::LastMessage()) // The symbol "fail" here expands to something into which a message // can be streamed. // A class representing the parsed contents of the // --gtest_internal_run_death_test flag, as it existed when // RUN_ALL_TESTS was called. class InternalRunDeathTestFlag { public: InternalRunDeathTestFlag(const String& a_file, int a_line, int an_index, int a_write_fd) : file_(a_file), line_(a_line), index_(an_index), write_fd_(a_write_fd) {} ~InternalRunDeathTestFlag() { if (write_fd_ >= 0) posix::Close(write_fd_); } String file() const { return file_; } int line() const { return line_; } int index() const { return index_; } int write_fd() const { return write_fd_; } private: String file_; int line_; int index_; int write_fd_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InternalRunDeathTestFlag); }; // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag(); #else // GTEST_HAS_DEATH_TEST // This macro is used for implementing macros such as // EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED on systems where // death tests are not supported. Those macros must compile on such systems // iff EXPECT_DEATH and ASSERT_DEATH compile with the same parameters on // systems that support death tests. This allows one to write such a macro // on a system that does not support death tests and be sure that it will // compile on a death-test supporting system. // // Parameters: // statement - A statement that a macro such as EXPECT_DEATH would test // for program termination. This macro has to make sure this // statement is compiled but not executed, to ensure that // EXPECT_DEATH_IF_SUPPORTED compiles with a certain // parameter iff EXPECT_DEATH compiles with it. // regex - A regex that a macro such as EXPECT_DEATH would use to test // the output of statement. This parameter has to be // compiled but not evaluated by this macro, to ensure that // this macro only accepts expressions that a macro such as // EXPECT_DEATH would accept. // terminator - Must be an empty statement for EXPECT_DEATH_IF_SUPPORTED // and a return statement for ASSERT_DEATH_IF_SUPPORTED. // This ensures that ASSERT_DEATH_IF_SUPPORTED will not // compile inside functions where ASSERT_DEATH doesn't // compile. // // The branch that has an always false condition is used to ensure that // statement and regex are compiled (and thus syntactically correct) but // never executed. The unreachable code macro protects the terminator // statement from generating an 'unreachable code' warning in case // statement unconditionally returns or throws. The Message constructor at // the end allows the syntax of streaming additional messages into the // macro, for compilational compatibility with EXPECT_DEATH/ASSERT_DEATH. # define GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, terminator) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ GTEST_LOG_(WARNING) \ << "Death tests are not supported on this platform.\n" \ << "Statement '" #statement "' cannot be verified."; \ } else if (::testing::internal::AlwaysFalse()) { \ ::testing::internal::RE::PartialMatch(".*", (regex)); \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ terminator; \ } else \ ::testing::Message() #endif // GTEST_HAS_DEATH_TEST } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-filepath.h0000600000175000017500000002274111561126632027124 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: keith.ray@gmail.com (Keith Ray) // // Google Test filepath utilities // // This header file declares classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included in . // Do not include this header file separately! #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ #include "gtest/internal/gtest-string.h" namespace testing { namespace internal { // FilePath - a class for file and directory pathname manipulation which // handles platform-specific conventions (like the pathname separator). // Used for helper functions for naming files in a directory for xml output. // Except for Set methods, all methods are const or static, which provides an // "immutable value object" -- useful for peace of mind. // A FilePath with a value ending in a path separator ("like/this/") represents // a directory, otherwise it is assumed to represent a file. In either case, // it may or may not represent an actual file or directory in the file system. // Names are NOT checked for syntax correctness -- no checking for illegal // characters, malformed paths, etc. class GTEST_API_ FilePath { public: FilePath() : pathname_("") { } FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } explicit FilePath(const char* pathname) : pathname_(pathname) { Normalize(); } explicit FilePath(const String& pathname) : pathname_(pathname) { Normalize(); } FilePath& operator=(const FilePath& rhs) { Set(rhs); return *this; } void Set(const FilePath& rhs) { pathname_ = rhs.pathname_; } String ToString() const { return pathname_; } const char* c_str() const { return pathname_.c_str(); } // Returns the current working directory, or "" if unsuccessful. static FilePath GetCurrentDir(); // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. static FilePath MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension); // Given directory = "dir", relative_path = "test.xml", // returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. static FilePath ConcatPaths(const FilePath& directory, const FilePath& relative_path); // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. static FilePath GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension); // Returns true iff the path is NULL or "". bool IsEmpty() const { return c_str() == NULL || *c_str() == '\0'; } // If input name has a trailing separator character, removes it and returns // the name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath RemoveTrailingPathSeparator() const; // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveDirectoryName() const; // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveFileName() const; // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath RemoveExtension(const char* extension) const; // Creates directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create // directories for any reason. Will also return false if the FilePath does // not represent a directory (that is, it doesn't end with a path separator). bool CreateDirectoriesRecursively() const; // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool CreateFolder() const; // Returns true if FilePath describes something in the file-system, // either a file, directory, or whatever, and that something exists. bool FileOrDirectoryExists() const; // Returns true if pathname describes a directory in the file-system // that exists. bool DirectoryExists() const; // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool IsDirectory() const; // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool IsRootDirectory() const; // Returns true if pathname describes an absolute path. bool IsAbsolutePath() const; private: // Replaces multiple consecutive separators with a single separator. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // // A pathname with multiple consecutive separators may occur either through // user error or as a result of some scripts or APIs that generate a pathname // with a trailing separator. On other platforms the same API or script // may NOT generate a pathname with a trailing "/". Then elsewhere that // pathname may have another "/" and pathname components added to it, // without checking for the separator already being there. // The script language and operating system may allow paths like "foo//bar" // but some of the functions in FilePath will not handle that correctly. In // particular, RemoveTrailingPathSeparator() only removes one separator, and // it is called in CreateDirectoriesRecursively() assuming that it will change // a pathname from directory syntax (trailing separator) to filename syntax. // // On Windows this method also replaces the alternate path separator '/' with // the primary path separator '\\', so that for example "bar\\/\\foo" becomes // "bar\\foo". void Normalize(); // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FindLastPathSeparator() const; String pathname_; }; // class FilePath } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-internal.h0000600000175000017500000013433511561126632027147 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares functions and macros used internally by // Google Test. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ #include "gtest/internal/gtest-port.h" #if GTEST_OS_LINUX # include # include # include # include #endif // GTEST_OS_LINUX #include #include #include #include #include #include "gtest/internal/gtest-string.h" #include "gtest/internal/gtest-filepath.h" #include "gtest/internal/gtest-type-util.h" // Due to C++ preprocessor weirdness, we need double indirection to // concatenate two tokens when one of them is __LINE__. Writing // // foo ## __LINE__ // // will result in the token foo__LINE__, instead of foo followed by // the current line number. For more details, see // http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6 #define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar) #define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar // Google Test defines the testing::Message class to allow construction of // test messages via the << operator. The idea is that anything // streamable to std::ostream can be streamed to a testing::Message. // This allows a user to use his own types in Google Test assertions by // overloading the << operator. // // util/gtl/stl_logging-inl.h overloads << for STL containers. These // overloads cannot be defined in the std namespace, as that will be // undefined behavior. Therefore, they are defined in the global // namespace instead. // // C++'s symbol lookup rule (i.e. Koenig lookup) says that these // overloads are visible in either the std namespace or the global // namespace, but not other namespaces, including the testing // namespace which Google Test's Message class is in. // // To allow STL containers (and other types that has a << operator // defined in the global namespace) to be used in Google Test assertions, // testing::Message must access the custom << operator from the global // namespace. Hence this helper function. // // Note: Jeffrey Yasskin suggested an alternative fix by "using // ::operator<<;" in the definition of Message's operator<<. That fix // doesn't require a helper function, but unfortunately doesn't // compile with MSVC. template inline void GTestStreamToHelper(std::ostream* os, const T& val) { *os << val; } class ProtocolMessage; namespace proto2 { class Message; } namespace testing { // Forward declarations. class AssertionResult; // Result of an assertion. class Message; // Represents a failure message. class Test; // Represents a test. class TestInfo; // Information about a test. class TestPartResult; // Result of a test part. class UnitTest; // A collection of test cases. template ::std::string PrintToString(const T& value); namespace internal { struct TraceInfo; // Information about a trace point. class ScopedTrace; // Implements scoped trace. class TestInfoImpl; // Opaque implementation of TestInfo class UnitTestImpl; // Opaque implementation of UnitTest // How many times InitGoogleTest() has been called. extern int g_init_gtest_count; // The text used in failure messages to indicate the start of the // stack trace. GTEST_API_ extern const char kStackTraceMarker[]; // A secret type that Google Test users don't know about. It has no // definition on purpose. Therefore it's impossible to create a // Secret object, which is what we want. class Secret; // Two overloaded helpers for checking at compile time whether an // expression is a null pointer literal (i.e. NULL or any 0-valued // compile-time integral constant). Their return values have // different sizes, so we can use sizeof() to test which version is // picked by the compiler. These helpers have no implementations, as // we only need their signatures. // // Given IsNullLiteralHelper(x), the compiler will pick the first // version if x can be implicitly converted to Secret*, and pick the // second version otherwise. Since Secret is a secret and incomplete // type, the only expression a user can write that has type Secret* is // a null pointer literal. Therefore, we know that x is a null // pointer literal if and only if the first version is picked by the // compiler. char IsNullLiteralHelper(Secret* p); char (&IsNullLiteralHelper(...))[2]; // NOLINT // A compile-time bool constant that is true if and only if x is a // null pointer literal (i.e. NULL or any 0-valued compile-time // integral constant). #ifdef GTEST_ELLIPSIS_NEEDS_POD_ // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_IS_NULL_LITERAL_(x) false #else # define GTEST_IS_NULL_LITERAL_(x) \ (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1) #endif // GTEST_ELLIPSIS_NEEDS_POD_ // Appends the user-supplied message to the Google-Test-generated message. GTEST_API_ String AppendUserMessage(const String& gtest_msg, const Message& user_msg); // A helper class for creating scoped traces in user programs. class GTEST_API_ ScopedTrace { public: // The c'tor pushes the given source file location and message onto // a trace stack maintained by Google Test. ScopedTrace(const char* file, int line, const Message& message); // The d'tor pops the info pushed by the c'tor. // // Note that the d'tor is not virtual in order to be efficient. // Don't inherit from ScopedTrace! ~ScopedTrace(); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedTrace); } GTEST_ATTRIBUTE_UNUSED_; // A ScopedTrace object does its job in its // c'tor and d'tor. Therefore it doesn't // need to be used otherwise. // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); // The Symbian compiler has a bug that prevents it from selecting the // correct overload of FormatForComparisonFailureMessage (see below) // unless we pass the first argument by reference. If we do that, // however, Visual Age C++ 10.1 generates a compiler error. Therefore // we only apply the work-around for Symbian. #if defined(__SYMBIAN32__) # define GTEST_CREF_WORKAROUND_ const& #else # define GTEST_CREF_WORKAROUND_ #endif // When this operand is a const char* or char*, if the other operand // is a ::std::string or ::string, we print this operand as a C string // rather than a pointer (we do the same for wide strings); otherwise // we print it as a pointer to be safe. // This internal macro is used to avoid duplicated code. #define GTEST_FORMAT_IMPL_(operand2_type, operand1_printer)\ inline String FormatForComparisonFailureMessage(\ operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ }\ inline String FormatForComparisonFailureMessage(\ const operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ } GTEST_FORMAT_IMPL_(::std::string, String::ShowCStringQuoted) #if GTEST_HAS_STD_WSTRING GTEST_FORMAT_IMPL_(::std::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_STRING GTEST_FORMAT_IMPL_(::string, String::ShowCStringQuoted) #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING GTEST_FORMAT_IMPL_(::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_GLOBAL_WSTRING #undef GTEST_FORMAT_IMPL_ // The next four overloads handle the case where the operand being // printed is a char/wchar_t pointer and the other operand is not a // string/wstring object. In such cases, we just print the operand as // a pointer to be safe. #define GTEST_FORMAT_CHAR_PTR_IMPL_(CharType) \ template \ String FormatForComparisonFailureMessage(CharType* GTEST_CREF_WORKAROUND_ p, \ const T&) { \ return PrintToString(static_cast(p)); \ } GTEST_FORMAT_CHAR_PTR_IMPL_(char) GTEST_FORMAT_CHAR_PTR_IMPL_(const char) GTEST_FORMAT_CHAR_PTR_IMPL_(wchar_t) GTEST_FORMAT_CHAR_PTR_IMPL_(const wchar_t) #undef GTEST_FORMAT_CHAR_PTR_IMPL_ // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. GTEST_API_ AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case); // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. GTEST_API_ String GetBoolAssertionFailureMessage( const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value); // This template class represents an IEEE floating-point number // (either single-precision or double-precision, depending on the // template parameters). // // The purpose of this class is to do more sophisticated number // comparison. (Due to round-off error, etc, it's very unlikely that // two floating-points will be equal exactly. Hence a naive // comparison by the == operation often doesn't work.) // // Format of IEEE floating-point: // // The most-significant bit being the leftmost, an IEEE // floating-point looks like // // sign_bit exponent_bits fraction_bits // // Here, sign_bit is a single bit that designates the sign of the // number. // // For float, there are 8 exponent bits and 23 fraction bits. // // For double, there are 11 exponent bits and 52 fraction bits. // // More details can be found at // http://en.wikipedia.org/wiki/IEEE_floating-point_standard. // // Template parameter: // // RawType: the raw floating-point type (either float or double) template class FloatingPoint { public: // Defines the unsigned integer type that has the same size as the // floating point number. typedef typename TypeWithSize::UInt Bits; // Constants. // # of bits in a number. static const size_t kBitCount = 8*sizeof(RawType); // # of fraction bits in a number. static const size_t kFractionBitCount = std::numeric_limits::digits - 1; // # of exponent bits in a number. static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount; // The mask for the sign bit. static const Bits kSignBitMask = static_cast(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when // comparing two numbers. The larger the value, the more error we // allow. A 0 value means that two numbers must be exactly the same // to be considered equal. // // The maximum error of a single floating-point operation is 0.5 // units in the last place. On Intel CPU's, all floating-point // calculations are done with 80-bit precision, while double has 64 // bits. Therefore, 4 should be enough for ordinary use. // // See the following article for more details on ULP: // http://www.cygnus-software.com/papers/comparingfloats/comparingfloats.htm. static const size_t kMaxUlps = 4; // Constructs a FloatingPoint from a raw floating-point number. // // On an Intel CPU, passing a non-normalized NAN (Not a Number) // around may change its bits, although the new value is guaranteed // to be also a NAN. Therefore, don't expect this constructor to // preserve the bits in x when x is a NAN. explicit FloatingPoint(const RawType& x) { u_.value_ = x; } // Static methods // Reinterprets a bit pattern as a floating-point number. // // This function is needed to test the AlmostEquals() method. static RawType ReinterpretBits(const Bits bits) { FloatingPoint fp(0); fp.u_.bits_ = bits; return fp.u_.value_; } // Returns the floating-point number that represent positive infinity. static RawType Infinity() { return ReinterpretBits(kExponentBitMask); } // Non-static methods // Returns the bits that represents this number. const Bits &bits() const { return u_.bits_; } // Returns the exponent bits of this number. Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } // Returns the fraction bits of this number. Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } // Returns the sign bit of this number. Bits sign_bit() const { return kSignBitMask & u_.bits_; } // Returns true iff this is NAN (not a number). bool is_nan() const { // It's a NAN if the exponent bits are all ones and the fraction // bits are not entirely zeros. return (exponent_bits() == kExponentBitMask) && (fraction_bits() != 0); } // Returns true iff this number is at most kMaxUlps ULP's away from // rhs. In particular, this function: // // - returns false if either number is (or both are) NAN. // - treats really large numbers as almost equal to infinity. // - thinks +0.0 and -0.0 are 0 DLP's apart. bool AlmostEquals(const FloatingPoint& rhs) const { // The IEEE standard says that any comparison operation involving // a NAN must return false. if (is_nan() || rhs.is_nan()) return false; return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) <= kMaxUlps; } private: // The data type used to store the actual floating-point number. union FloatingPointUnion { RawType value_; // The raw floating-point number. Bits bits_; // The bits that represent the number. }; // Converts an integer from the sign-and-magnitude representation to // the biased representation. More precisely, let N be 2 to the // power of (kBitCount - 1), an integer x is represented by the // unsigned number x + N. // // For instance, // // -N + 1 (the most negative number representable using // sign-and-magnitude) is represented by 1; // 0 is represented by N; and // N - 1 (the biggest number representable using // sign-and-magnitude) is represented by 2N - 1. // // Read http://en.wikipedia.org/wiki/Signed_number_representations // for more details on signed number representations. static Bits SignAndMagnitudeToBiased(const Bits &sam) { if (kSignBitMask & sam) { // sam represents a negative number. return ~sam + 1; } else { // sam represents a positive number. return kSignBitMask | sam; } } // Given two numbers in the sign-and-magnitude representation, // returns the distance between them as an unsigned number. static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &sam1, const Bits &sam2) { const Bits biased1 = SignAndMagnitudeToBiased(sam1); const Bits biased2 = SignAndMagnitudeToBiased(sam2); return (biased1 >= biased2) ? (biased1 - biased2) : (biased2 - biased1); } FloatingPointUnion u_; }; // Typedefs the instances of the FloatingPoint template class that we // care to use. typedef FloatingPoint Float; typedef FloatingPoint Double; // In order to catch the mistake of putting tests that use different // test fixture classes in the same test case, we need to assign // unique IDs to fixture classes and compare them. The TypeId type is // used to hold such IDs. The user should treat TypeId as an opaque // type: the only operation allowed on TypeId values is to compare // them for equality using the == operator. typedef const void* TypeId; template class TypeIdHelper { public: // dummy_ must not have a const type. Otherwise an overly eager // compiler (e.g. MSVC 7.1 & 8.0) may try to merge // TypeIdHelper::dummy_ for different Ts as an "optimization". static bool dummy_; }; template bool TypeIdHelper::dummy_ = false; // GetTypeId() returns the ID of type T. Different values will be // returned for different types. Calling the function twice with the // same type argument is guaranteed to return the same ID. template TypeId GetTypeId() { // The compiler is required to allocate a different // TypeIdHelper::dummy_ variable for each T used to instantiate // the template. Therefore, the address of dummy_ is guaranteed to // be unique. return &(TypeIdHelper::dummy_); } // Returns the type ID of ::testing::Test. Always call this instead // of GetTypeId< ::testing::Test>() to get the type ID of // ::testing::Test, as the latter may give the wrong result due to a // suspected linker bug when compiling Google Test as a Mac OS X // framework. GTEST_API_ TypeId GetTestTypeId(); // Defines the abstract factory interface that creates instances // of a Test object. class TestFactoryBase { public: virtual ~TestFactoryBase() {} // Creates a test instance to run. The instance is both created and destroyed // within TestInfoImpl::Run() virtual Test* CreateTest() = 0; protected: TestFactoryBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase); }; // This class provides implementation of TeastFactoryBase interface. // It is used in TEST and TEST_F macros. template class TestFactoryImpl : public TestFactoryBase { public: virtual Test* CreateTest() { return new TestClass; } }; #if GTEST_OS_WINDOWS // Predicate-formatters for implementing the HRESULT checking macros // {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED} // We pass a long instead of HRESULT to avoid causing an // include dependency for the HRESULT type. GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr, long hr); // NOLINT GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr, long hr); // NOLINT #endif // GTEST_OS_WINDOWS // Types of SetUpTestCase() and TearDownTestCase() functions. typedef void (*SetUpTestCaseFunc)(); typedef void (*TearDownTestCaseFunc)(); // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param text representation of the test's value parameter, // or NULL if this is not a type-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. GTEST_API_ TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory); // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr); #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // State of the definition of a type-parameterized test case. class GTEST_API_ TypedTestCasePState { public: TypedTestCasePState() : registered_(false) {} // Adds the given test name to defined_test_names_ and return true // if the test case hasn't been registered; otherwise aborts the // program. bool AddTestName(const char* file, int line, const char* case_name, const char* test_name) { if (registered_) { fprintf(stderr, "%s Test %s must be defined before " "REGISTER_TYPED_TEST_CASE_P(%s, ...).\n", FormatFileLocation(file, line).c_str(), test_name, case_name); fflush(stderr); posix::Abort(); } defined_test_names_.insert(test_name); return true; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests); private: bool registered_; ::std::set defined_test_names_; }; // Skips to the first non-space char after the first comma in 'str'; // returns NULL if no comma is found in 'str'. inline const char* SkipComma(const char* str) { const char* comma = strchr(str, ','); if (comma == NULL) { return NULL; } while (IsSpace(*(++comma))) {} return comma; } // Returns the prefix of 'str' before the first comma in it; returns // the entire string if it contains no comma. inline String GetPrefixUntilComma(const char* str) { const char* comma = strchr(str, ','); return comma == NULL ? String(str) : String(str, comma - str); } // TypeParameterizedTest::Register() // registers a list of type-parameterized tests with Google Test. The // return value is insignificant - we just need to return something // such that we can call this function in a namespace scope. // // Implementation note: The GTEST_TEMPLATE_ macro declares a template // template parameter. It's defined in gtest-type-util.h. template class TypeParameterizedTest { public: // 'index' is the index of the test in the type list 'Types' // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase, // Types). Valid values for 'index' are [0, N - 1] where N is the // length of Types. static bool Register(const char* prefix, const char* case_name, const char* test_names, int index) { typedef typename Types::Head Type; typedef Fixture FixtureClass; typedef typename GTEST_BIND_(TestSel, Type) TestClass; // First, registers the first type-parameterized test in the type // list. MakeAndRegisterTestInfo( String::Format("%s%s%s/%d", prefix, prefix[0] == '\0' ? "" : "/", case_name, index).c_str(), GetPrefixUntilComma(test_names).c_str(), GetTypeName().c_str(), NULL, // No value parameter. GetTypeId(), TestClass::SetUpTestCase, TestClass::TearDownTestCase, new TestFactoryImpl); // Next, recurses (at compile time) with the tail of the type list. return TypeParameterizedTest ::Register(prefix, case_name, test_names, index + 1); } }; // The base case for the compile time recursion. template class TypeParameterizedTest { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/, int /*index*/) { return true; } }; // TypeParameterizedTestCase::Register() // registers *all combinations* of 'Tests' and 'Types' with Google // Test. The return value is insignificant - we just need to return // something such that we can call this function in a namespace scope. template class TypeParameterizedTestCase { public: static bool Register(const char* prefix, const char* case_name, const char* test_names) { typedef typename Tests::Head Head; // First, register the first test in 'Test' for each type in 'Types'. TypeParameterizedTest::Register( prefix, case_name, test_names, 0); // Next, recurses (at compile time) with the tail of the test list. return TypeParameterizedTestCase ::Register(prefix, case_name, SkipComma(test_names)); } }; // The base case for the compile time recursion. template class TypeParameterizedTestCase { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/) { return true; } }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. GTEST_API_ String GetCurrentOsStackTraceExceptTop(UnitTest* unit_test, int skip_count); // Helpers for suppressing warnings on unreachable code or constant // condition. // Always returns true. GTEST_API_ bool AlwaysTrue(); // Always returns false. inline bool AlwaysFalse() { return !AlwaysTrue(); } // Helper for suppressing false warning from Clang on a const char* // variable declared in a conditional expression always being NULL in // the else branch. struct GTEST_API_ ConstCharPtr { ConstCharPtr(const char* str) : value(str) {} operator bool() const { return true; } const char* value; }; // A simple Linear Congruential Generator for generating random // numbers with a uniform distribution. Unlike rand() and srand(), it // doesn't use global state (and therefore can't interfere with user // code). Unlike rand_r(), it's portable. An LCG isn't very random, // but it's good enough for our purposes. class GTEST_API_ Random { public: static const UInt32 kMaxRange = 1u << 31; explicit Random(UInt32 seed) : state_(seed) {} void Reseed(UInt32 seed) { state_ = seed; } // Generates a random number from [0, range). Crashes if 'range' is // 0 or greater than kMaxRange. UInt32 Generate(UInt32 range); private: UInt32 state_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Random); }; // Defining a variable of type CompileAssertTypesEqual will cause a // compiler error iff T1 and T2 are different types. template struct CompileAssertTypesEqual; template struct CompileAssertTypesEqual { }; // Removes the reference from a type if it is a reference type, // otherwise leaves it unchanged. This is the same as // tr1::remove_reference, which is not widely available yet. template struct RemoveReference { typedef T type; }; // NOLINT template struct RemoveReference { typedef T type; }; // NOLINT // A handy wrapper around RemoveReference that works when the argument // T depends on template parameters. #define GTEST_REMOVE_REFERENCE_(T) \ typename ::testing::internal::RemoveReference::type // Removes const from a type if it is a const type, otherwise leaves // it unchanged. This is the same as tr1::remove_const, which is not // widely available yet. template struct RemoveConst { typedef T type; }; // NOLINT template struct RemoveConst { typedef T type; }; // NOLINT // MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above // definition to fail to remove the const in 'const int[3]' and 'const // char[3][4]'. The following specialization works around the bug. // However, it causes trouble with GCC and thus needs to be // conditionally compiled. #if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__) template struct RemoveConst { typedef typename RemoveConst::type type[N]; }; #endif // A handy wrapper around RemoveConst that works when the argument // T depends on template parameters. #define GTEST_REMOVE_CONST_(T) \ typename ::testing::internal::RemoveConst::type // Turns const U&, U&, const U, and U all into U. #define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \ GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T)) // Adds reference to a type if it is not a reference type, // otherwise leaves it unchanged. This is the same as // tr1::add_reference, which is not widely available yet. template struct AddReference { typedef T& type; }; // NOLINT template struct AddReference { typedef T& type; }; // NOLINT // A handy wrapper around AddReference that works when the argument T // depends on template parameters. #define GTEST_ADD_REFERENCE_(T) \ typename ::testing::internal::AddReference::type // Adds a reference to const on top of T as necessary. For example, // it transforms // // char ==> const char& // const char ==> const char& // char& ==> const char& // const char& ==> const char& // // The argument T must depend on some template parameters. #define GTEST_REFERENCE_TO_CONST_(T) \ GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T)) // ImplicitlyConvertible::value is a compile-time bool // constant that's true iff type From can be implicitly converted to // type To. template class ImplicitlyConvertible { private: // We need the following helper functions only for their types. // They have no implementations. // MakeFrom() is an expression whose type is From. We cannot simply // use From(), as the type From may not have a public default // constructor. static From MakeFrom(); // These two functions are overloaded. Given an expression // Helper(x), the compiler will pick the first version if x can be // implicitly converted to type To; otherwise it will pick the // second version. // // The first version returns a value of size 1, and the second // version returns a value of size 2. Therefore, by checking the // size of Helper(x), which can be done at compile time, we can tell // which version of Helper() is used, and hence whether x can be // implicitly converted to type To. static char Helper(To); static char (&Helper(...))[2]; // NOLINT // We have to put the 'public' section after the 'private' section, // or MSVC refuses to compile the code. public: // MSVC warns about implicitly converting from double to int for // possible loss of data, so we need to temporarily disable the // warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4244) // Temporarily disables warning 4244. static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; # pragma warning(pop) // Restores the warning state. #elif defined(__BORLANDC__) // C++Builder cannot use member overload resolution during template // instantiation. The simplest workaround is to use its C++0x type traits // functions (C++Builder 2009 and above only). static const bool value = __is_convertible(From, To); #else static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; #endif // _MSV_VER }; template const bool ImplicitlyConvertible::value; // IsAProtocolMessage::value is a compile-time bool constant that's // true iff T is type ProtocolMessage, proto2::Message, or a subclass // of those. template struct IsAProtocolMessage : public bool_constant< ImplicitlyConvertible::value || ImplicitlyConvertible::value> { }; // When the compiler sees expression IsContainerTest(0), if C is an // STL-style container class, the first overload of IsContainerTest // will be viable (since both C::iterator* and C::const_iterator* are // valid types and NULL can be implicitly converted to them). It will // be picked over the second overload as 'int' is a perfect match for // the type of argument 0. If C::iterator or C::const_iterator is not // a valid type, the first overload is not viable, and the second // overload will be picked. Therefore, we can determine whether C is // a container class by checking the type of IsContainerTest(0). // The value of the expression is insignificant. // // Note that we look for both C::iterator and C::const_iterator. The // reason is that C++ injects the name of a class as a member of the // class itself (e.g. you can refer to class iterator as either // 'iterator' or 'iterator::iterator'). If we look for C::iterator // only, for example, we would mistakenly think that a class named // iterator is an STL container. // // Also note that the simpler approach of overloading // IsContainerTest(typename C::const_iterator*) and // IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++. typedef int IsContainer; template IsContainer IsContainerTest(int /* dummy */, typename C::iterator* /* it */ = NULL, typename C::const_iterator* /* const_it */ = NULL) { return 0; } typedef char IsNotContainer; template IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; } // EnableIf::type is void when 'Cond' is true, and // undefined when 'Cond' is false. To use SFINAE to make a function // overload only apply when a particular expression is true, add // "typename EnableIf::type* = 0" as the last parameter. template struct EnableIf; template<> struct EnableIf { typedef void type; }; // NOLINT // Utilities for native arrays. // ArrayEq() compares two k-dimensional native arrays using the // elements' operator==, where k can be any integer >= 0. When k is // 0, ArrayEq() degenerates into comparing a single pair of values. template bool ArrayEq(const T* lhs, size_t size, const U* rhs); // This generic version is used when k is 0. template inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } // This overload is used when k >= 1. template inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) { return internal::ArrayEq(lhs, N, rhs); } // This helper reduces code bloat. If we instead put its logic inside // the previous ArrayEq() function, arrays with different sizes would // lead to different copies of the template code. template bool ArrayEq(const T* lhs, size_t size, const U* rhs) { for (size_t i = 0; i != size; i++) { if (!internal::ArrayEq(lhs[i], rhs[i])) return false; } return true; } // Finds the first element in the iterator range [begin, end) that // equals elem. Element may be a native array type itself. template Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { for (Iter it = begin; it != end; ++it) { if (internal::ArrayEq(*it, elem)) return it; } return end; } // CopyArray() copies a k-dimensional native array using the elements' // operator=, where k can be any integer >= 0. When k is 0, // CopyArray() degenerates into copying a single value. template void CopyArray(const T* from, size_t size, U* to); // This generic version is used when k is 0. template inline void CopyArray(const T& from, U* to) { *to = from; } // This overload is used when k >= 1. template inline void CopyArray(const T(&from)[N], U(*to)[N]) { internal::CopyArray(from, N, *to); } // This helper reduces code bloat. If we instead put its logic inside // the previous CopyArray() function, arrays with different sizes // would lead to different copies of the template code. template void CopyArray(const T* from, size_t size, U* to) { for (size_t i = 0; i != size; i++) { internal::CopyArray(from[i], to + i); } } // The relation between an NativeArray object (see below) and the // native array it represents. enum RelationToSource { kReference, // The NativeArray references the native array. kCopy // The NativeArray makes a copy of the native array and // owns the copy. }; // Adapts a native array to a read-only STL-style container. Instead // of the complete STL container concept, this adaptor only implements // members useful for Google Mock's container matchers. New members // should be added as needed. To simplify the implementation, we only // support Element being a raw type (i.e. having no top-level const or // reference modifier). It's the client's responsibility to satisfy // this requirement. Element can be an array type itself (hence // multi-dimensional arrays are supported). template class NativeArray { public: // STL-style container typedefs. typedef Element value_type; typedef Element* iterator; typedef const Element* const_iterator; // Constructs from a native array. NativeArray(const Element* array, size_t count, RelationToSource relation) { Init(array, count, relation); } // Copy constructor. NativeArray(const NativeArray& rhs) { Init(rhs.array_, rhs.size_, rhs.relation_to_source_); } ~NativeArray() { // Ensures that the user doesn't instantiate NativeArray with a // const or reference type. static_cast(StaticAssertTypeEqHelper()); if (relation_to_source_ == kCopy) delete[] array_; } // STL-style container methods. size_t size() const { return size_; } const_iterator begin() const { return array_; } const_iterator end() const { return array_ + size_; } bool operator==(const NativeArray& rhs) const { return size() == rhs.size() && ArrayEq(begin(), size(), rhs.begin()); } private: // Initializes this object; makes a copy of the input array if // 'relation' is kCopy. void Init(const Element* array, size_t a_size, RelationToSource relation) { if (relation == kReference) { array_ = array; } else { Element* const copy = new Element[a_size]; CopyArray(array, a_size, copy); array_ = copy; } size_ = a_size; relation_to_source_ = relation; } const Element* array_; size_t size_; RelationToSource relation_to_source_; GTEST_DISALLOW_ASSIGN_(NativeArray); }; } // namespace internal } // namespace testing #define GTEST_MESSAGE_AT_(file, line, message, result_type) \ ::testing::internal::AssertHelper(result_type, file, line, message) \ = ::testing::Message() #define GTEST_MESSAGE_(message, result_type) \ GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type) #define GTEST_FATAL_FAILURE_(message) \ return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure) #define GTEST_NONFATAL_FAILURE_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure) #define GTEST_SUCCESS_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess) // Suppresses MSVC warnings 4072 (unreachable code) for the code following // statement if it returns or throws (or doesn't return or throw in some // situations). #define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \ if (::testing::internal::AlwaysTrue()) { statement; } #define GTEST_TEST_THROW_(statement, expected_exception, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::ConstCharPtr gtest_msg = "") { \ bool gtest_caught_expected = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (expected_exception const&) { \ gtest_caught_expected = true; \ } \ catch (...) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws a different type."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ if (!gtest_caught_expected) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws nothing."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \ fail(gtest_msg.value) #define GTEST_TEST_NO_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \ fail("Expected: " #statement " doesn't throw an exception.\n" \ " Actual: it throws.") #define GTEST_TEST_ANY_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ bool gtest_caught_any = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ gtest_caught_any = true; \ } \ if (!gtest_caught_any) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \ fail("Expected: " #statement " throws an exception.\n" \ " Actual: it doesn't.") // Implements Boolean test assertions such as EXPECT_TRUE. expression can be // either a boolean expression or an AssertionResult. text is a textual // represenation of expression as it was passed into the EXPECT_TRUE. #define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar_ = \ ::testing::AssertionResult(expression)) \ ; \ else \ fail(::testing::internal::GetBoolAssertionFailureMessage(\ gtest_ar_, text, #actual, #expected).c_str()) #define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \ fail("Expected: " #statement " doesn't generate new fatal " \ "failures in the current thread.\n" \ " Actual: it does.") // Expands to the name of the class that implements the given test. #define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ test_case_name##_##test_name##_Test // Helper macro for defining tests. #define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\ public:\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\ private:\ virtual void TestBody();\ static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\ };\ \ ::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\ ::test_info_ =\ ::testing::internal::MakeAndRegisterTestInfo(\ #test_case_name, #test_name, NULL, NULL, \ (parent_id), \ parent_class::SetUpTestCase, \ parent_class::TearDownTestCase, \ new ::testing::internal::TestFactoryImpl<\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-linked_ptr.h0000600000175000017500000001757711561126632027476 0ustar synergysynergy// Copyright 2003 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: Dan Egnor (egnor@google.com) // // A "smart" pointer type with reference tracking. Every pointer to a // particular object is kept on a circular linked list. When the last pointer // to an object is destroyed or reassigned, the object is deleted. // // Used properly, this deletes the object when the last reference goes away. // There are several caveats: // - Like all reference counting schemes, cycles lead to leaks. // - Each smart pointer is actually two pointers (8 bytes instead of 4). // - Every time a pointer is assigned, the entire list of pointers to that // object is traversed. This class is therefore NOT SUITABLE when there // will often be more than two or three pointers to a particular object. // - References are only tracked as long as linked_ptr<> objects are copied. // If a linked_ptr<> is converted to a raw pointer and back, BAD THINGS // will happen (double deletion). // // A good use of this class is storing object references in STL containers. // You can safely put linked_ptr<> in a vector<>. // Other uses may not be as good. // // Note: If you use an incomplete type with linked_ptr<>, the class // *containing* linked_ptr<> must have a constructor and destructor (even // if they do nothing!). // // Bill Gibbons suggested we use something like this. // // Thread Safety: // Unlike other linked_ptr implementations, in this implementation // a linked_ptr object is thread-safe in the sense that: // - it's safe to copy linked_ptr objects concurrently, // - it's safe to copy *from* a linked_ptr and read its underlying // raw pointer (e.g. via get()) concurrently, and // - it's safe to write to two linked_ptrs that point to the same // shared object concurrently. // TODO(wan@google.com): rename this to safe_linked_ptr to avoid // confusion with normal linked_ptr. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #include #include #include "gtest/internal/gtest-port.h" namespace testing { namespace internal { // Protects copying of all linked_ptr objects. GTEST_API_ GTEST_DECLARE_STATIC_MUTEX_(g_linked_ptr_mutex); // This is used internally by all instances of linked_ptr<>. It needs to be // a non-template class because different types of linked_ptr<> can refer to // the same object (linked_ptr(obj) vs linked_ptr(obj)). // So, it needs to be possible for different types of linked_ptr to participate // in the same circular linked list, so we need a single class type here. // // DO NOT USE THIS CLASS DIRECTLY YOURSELF. Use linked_ptr. class linked_ptr_internal { public: // Create a new circle that includes only this instance. void join_new() { next_ = this; } // Many linked_ptr operations may change p.link_ for some linked_ptr // variable p in the same circle as this object. Therefore we need // to prevent two such operations from occurring concurrently. // // Note that different types of linked_ptr objects can coexist in a // circle (e.g. linked_ptr, linked_ptr, and // linked_ptr). Therefore we must use a single mutex to // protect all linked_ptr objects. This can create serious // contention in production code, but is acceptable in a testing // framework. // Join an existing circle. // L < g_linked_ptr_mutex void join(linked_ptr_internal const* ptr) { MutexLock lock(&g_linked_ptr_mutex); linked_ptr_internal const* p = ptr; while (p->next_ != ptr) p = p->next_; p->next_ = this; next_ = ptr; } // Leave whatever circle we're part of. Returns true if we were the // last member of the circle. Once this is done, you can join() another. // L < g_linked_ptr_mutex bool depart() { MutexLock lock(&g_linked_ptr_mutex); if (next_ == this) return true; linked_ptr_internal const* p = next_; while (p->next_ != this) p = p->next_; p->next_ = next_; return false; } private: mutable linked_ptr_internal const* next_; }; template class linked_ptr { public: typedef T element_type; // Take over ownership of a raw pointer. This should happen as soon as // possible after the object is created. explicit linked_ptr(T* ptr = NULL) { capture(ptr); } ~linked_ptr() { depart(); } // Copy an existing linked_ptr<>, adding ourselves to the list of references. template linked_ptr(linked_ptr const& ptr) { copy(&ptr); } linked_ptr(linked_ptr const& ptr) { // NOLINT assert(&ptr != this); copy(&ptr); } // Assignment releases the old value and acquires the new. template linked_ptr& operator=(linked_ptr const& ptr) { depart(); copy(&ptr); return *this; } linked_ptr& operator=(linked_ptr const& ptr) { if (&ptr != this) { depart(); copy(&ptr); } return *this; } // Smart pointer members. void reset(T* ptr = NULL) { depart(); capture(ptr); } T* get() const { return value_; } T* operator->() const { return value_; } T& operator*() const { return *value_; } bool operator==(T* p) const { return value_ == p; } bool operator!=(T* p) const { return value_ != p; } template bool operator==(linked_ptr const& ptr) const { return value_ == ptr.get(); } template bool operator!=(linked_ptr const& ptr) const { return value_ != ptr.get(); } private: template friend class linked_ptr; T* value_; linked_ptr_internal link_; void depart() { if (link_.depart()) delete value_; } void capture(T* ptr) { value_ = ptr; link_.join_new(); } template void copy(linked_ptr const* ptr) { value_ = ptr->get(); if (value_) link_.join(&ptr->link_); else link_.join_new(); } }; template inline bool operator==(T* ptr, const linked_ptr& x) { return ptr == x.get(); } template inline bool operator!=(T* ptr, const linked_ptr& x) { return ptr != x.get(); } // A function to convert T* into linked_ptr // Doing e.g. make_linked_ptr(new FooBarBaz(arg)) is a shorter notation // for linked_ptr >(new FooBarBaz(arg)) template linked_ptr make_linked_ptr(T* ptr) { return linked_ptr(ptr); } } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-param-util-generated.h0000600000175000017500000051241011561126632031334 0ustar synergysynergy// This file was GENERATED by command: // pump.py gtest-param-util-generated.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently Google Test supports at most 50 arguments in Values, // and at most 10 arguments in Combine. Please contact // googletestframework@googlegroups.com if you need more. // Please note that the number of arguments to Combine is limited // by the maximum arity of the implementation of tr1::tuple which is // currently set at 10. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #include "gtest/internal/gtest-param-util.h" #include "gtest/internal/gtest-port.h" #if GTEST_HAS_PARAM_TEST namespace testing { // Forward declarations of ValuesIn(), which is implemented in // include/gtest/gtest-param-test.h. template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end); template internal::ParamGenerator ValuesIn(const T (&array)[N]); template internal::ParamGenerator ValuesIn( const Container& container); namespace internal { // Used in the Values() function to provide polymorphic capabilities. template class ValueArray1 { public: explicit ValueArray1(T1 v1) : v1_(v1) {} template operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray1& other); const T1 v1_; }; template class ValueArray2 { public: ValueArray2(T1 v1, T2 v2) : v1_(v1), v2_(v2) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray2& other); const T1 v1_; const T2 v2_; }; template class ValueArray3 { public: ValueArray3(T1 v1, T2 v2, T3 v3) : v1_(v1), v2_(v2), v3_(v3) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray3& other); const T1 v1_; const T2 v2_; const T3 v3_; }; template class ValueArray4 { public: ValueArray4(T1 v1, T2 v2, T3 v3, T4 v4) : v1_(v1), v2_(v2), v3_(v3), v4_(v4) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray4& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; }; template class ValueArray5 { public: ValueArray5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray5& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; }; template class ValueArray6 { public: ValueArray6(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray6& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; }; template class ValueArray7 { public: ValueArray7(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray7& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; }; template class ValueArray8 { public: ValueArray8(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray8& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; }; template class ValueArray9 { public: ValueArray9(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray9& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; }; template class ValueArray10 { public: ValueArray10(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray10& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; }; template class ValueArray11 { public: ValueArray11(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray11& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; }; template class ValueArray12 { public: ValueArray12(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray12& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; }; template class ValueArray13 { public: ValueArray13(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray13& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; }; template class ValueArray14 { public: ValueArray14(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray14& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; }; template class ValueArray15 { public: ValueArray15(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray15& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; }; template class ValueArray16 { public: ValueArray16(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray16& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; }; template class ValueArray17 { public: ValueArray17(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray17& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; }; template class ValueArray18 { public: ValueArray18(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray18& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; }; template class ValueArray19 { public: ValueArray19(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray19& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; }; template class ValueArray20 { public: ValueArray20(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray20& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; }; template class ValueArray21 { public: ValueArray21(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray21& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; }; template class ValueArray22 { public: ValueArray22(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray22& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; }; template class ValueArray23 { public: ValueArray23(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray23& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; }; template class ValueArray24 { public: ValueArray24(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray24& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; }; template class ValueArray25 { public: ValueArray25(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray25& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; }; template class ValueArray26 { public: ValueArray26(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray26& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; }; template class ValueArray27 { public: ValueArray27(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray27& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; }; template class ValueArray28 { public: ValueArray28(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray28& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; }; template class ValueArray29 { public: ValueArray29(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray29& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; }; template class ValueArray30 { public: ValueArray30(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray30& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; }; template class ValueArray31 { public: ValueArray31(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray31& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; }; template class ValueArray32 { public: ValueArray32(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray32& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; }; template class ValueArray33 { public: ValueArray33(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray33& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; }; template class ValueArray34 { public: ValueArray34(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray34& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; }; template class ValueArray35 { public: ValueArray35(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray35& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; }; template class ValueArray36 { public: ValueArray36(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray36& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; }; template class ValueArray37 { public: ValueArray37(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray37& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; }; template class ValueArray38 { public: ValueArray38(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray38& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; }; template class ValueArray39 { public: ValueArray39(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray39& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; }; template class ValueArray40 { public: ValueArray40(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray40& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; }; template class ValueArray41 { public: ValueArray41(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray41& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; }; template class ValueArray42 { public: ValueArray42(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray42& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; }; template class ValueArray43 { public: ValueArray43(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray43& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; }; template class ValueArray44 { public: ValueArray44(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray44& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; }; template class ValueArray45 { public: ValueArray45(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray45& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; }; template class ValueArray46 { public: ValueArray46(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray46& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; }; template class ValueArray47 { public: ValueArray47(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray47& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; }; template class ValueArray48 { public: ValueArray48(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray48& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; }; template class ValueArray49 { public: ValueArray49(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray49& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; }; template class ValueArray50 { public: ValueArray50(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49), v50_(v50) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_, v50_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray50& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; const T50 v50_; }; # if GTEST_HAS_COMBINE // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Generates values from the Cartesian product of values produced // by the argument generators. // template class CartesianProductGenerator2 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator2(const ParamGenerator& g1, const ParamGenerator& g2) : g1_(g1), g2_(g2) {} virtual ~CartesianProductGenerator2() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current2_; if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; ParamType current_value_; }; // class CartesianProductGenerator2::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator2& other); const ParamGenerator g1_; const ParamGenerator g2_; }; // class CartesianProductGenerator2 template class CartesianProductGenerator3 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator3(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3) : g1_(g1), g2_(g2), g3_(g3) {} virtual ~CartesianProductGenerator3() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current3_; if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; ParamType current_value_; }; // class CartesianProductGenerator3::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator3& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; }; // class CartesianProductGenerator3 template class CartesianProductGenerator4 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator4(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} virtual ~CartesianProductGenerator4() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current4_; if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; ParamType current_value_; }; // class CartesianProductGenerator4::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator4& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; }; // class CartesianProductGenerator4 template class CartesianProductGenerator5 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator5(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} virtual ~CartesianProductGenerator5() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current5_; if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; ParamType current_value_; }; // class CartesianProductGenerator5::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator5& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; }; // class CartesianProductGenerator5 template class CartesianProductGenerator6 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator6(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} virtual ~CartesianProductGenerator6() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current6_; if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; ParamType current_value_; }; // class CartesianProductGenerator6::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator6& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; }; // class CartesianProductGenerator6 template class CartesianProductGenerator7 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator7(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} virtual ~CartesianProductGenerator7() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current7_; if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; ParamType current_value_; }; // class CartesianProductGenerator7::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator7& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; }; // class CartesianProductGenerator7 template class CartesianProductGenerator8 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator8(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} virtual ~CartesianProductGenerator8() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current8_; if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; ParamType current_value_; }; // class CartesianProductGenerator8::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator8& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; }; // class CartesianProductGenerator8 template class CartesianProductGenerator9 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator9(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} virtual ~CartesianProductGenerator9() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current9_; if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; ParamType current_value_; }; // class CartesianProductGenerator9::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator9& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; }; // class CartesianProductGenerator9 template class CartesianProductGenerator10 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator10(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9, const ParamGenerator& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} virtual ~CartesianProductGenerator10() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin(), g10_, g10_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end(), g10_, g10_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9, const ParamGenerator& g10, const typename ParamGenerator::iterator& current10) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9), begin10_(g10.begin()), end10_(g10.end()), current10_(current10) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current10_; if (current10_ == end10_) { current10_ = begin10_; ++current9_; } if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_ && current10_ == typed_other->current10_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_), begin10_(other.begin10_), end10_(other.end10_), current10_(other.current10_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_, *current10_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_ || current10_ == end10_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; const typename ParamGenerator::iterator begin10_; const typename ParamGenerator::iterator end10_; typename ParamGenerator::iterator current10_; ParamType current_value_; }; // class CartesianProductGenerator10::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator10& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; const ParamGenerator g10_; }; // class CartesianProductGenerator10 // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Helper classes providing Combine() with polymorphic features. They allow // casting CartesianProductGeneratorN to ParamGenerator if T is // convertible to U. // template class CartesianProductHolder2 { public: CartesianProductHolder2(const Generator1& g1, const Generator2& g2) : g1_(g1), g2_(g2) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator2( static_cast >(g1_), static_cast >(g2_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder2& other); const Generator1 g1_; const Generator2 g2_; }; // class CartesianProductHolder2 template class CartesianProductHolder3 { public: CartesianProductHolder3(const Generator1& g1, const Generator2& g2, const Generator3& g3) : g1_(g1), g2_(g2), g3_(g3) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator3( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder3& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; }; // class CartesianProductHolder3 template class CartesianProductHolder4 { public: CartesianProductHolder4(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator4( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder4& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; }; // class CartesianProductHolder4 template class CartesianProductHolder5 { public: CartesianProductHolder5(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator5( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder5& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; }; // class CartesianProductHolder5 template class CartesianProductHolder6 { public: CartesianProductHolder6(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator6( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder6& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; }; // class CartesianProductHolder6 template class CartesianProductHolder7 { public: CartesianProductHolder7(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator7( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder7& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; }; // class CartesianProductHolder7 template class CartesianProductHolder8 { public: CartesianProductHolder8(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator8( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder8& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; }; // class CartesianProductHolder8 template class CartesianProductHolder9 { public: CartesianProductHolder9(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator9( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder9& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; }; // class CartesianProductHolder9 template class CartesianProductHolder10 { public: CartesianProductHolder10(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator10( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_), static_cast >(g10_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder10& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; const Generator10 g10_; }; // class CartesianProductHolder10 # endif // GTEST_HAS_COMBINE } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-param-util-generated.h.pump0000600000175000017500000002227011561126632032314 0ustar synergysynergy$$ -*- mode: c++; -*- $var n = 50 $$ Maximum length of Values arguments we want to support. $var maxtuple = 10 $$ Maximum number of Combine arguments we want to support. // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently Google Test supports at most $n arguments in Values, // and at most $maxtuple arguments in Combine. Please contact // googletestframework@googlegroups.com if you need more. // Please note that the number of arguments to Combine is limited // by the maximum arity of the implementation of tr1::tuple which is // currently set at $maxtuple. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #include "gtest/internal/gtest-param-util.h" #include "gtest/internal/gtest-port.h" #if GTEST_HAS_PARAM_TEST namespace testing { // Forward declarations of ValuesIn(), which is implemented in // include/gtest/gtest-param-test.h. template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end); template internal::ParamGenerator ValuesIn(const T (&array)[N]); template internal::ParamGenerator ValuesIn( const Container& container); namespace internal { // Used in the Values() function to provide polymorphic capabilities. template class ValueArray1 { public: explicit ValueArray1(T1 v1) : v1_(v1) {} template operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray1& other); const T1 v1_; }; $range i 2..n $for i [[ $range j 1..i template <$for j, [[typename T$j]]> class ValueArray$i { public: ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {} template operator ParamGenerator() const { const T array[] = {$for j, [[v$(j)_]]}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray$i& other); $for j [[ const T$j v$(j)_; ]] }; ]] # if GTEST_HAS_COMBINE // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Generates values from the Cartesian product of values produced // by the argument generators. // $range i 2..maxtuple $for i [[ $range j 1..i $range k 2..i template <$for j, [[typename T$j]]> class CartesianProductGenerator$i : public ParamGeneratorInterface< ::std::tr1::tuple<$for j, [[T$j]]> > { public: typedef ::std::tr1::tuple<$for j, [[T$j]]> ParamType; CartesianProductGenerator$i($for j, [[const ParamGenerator& g$j]]) : $for j, [[g$(j)_(g$j)]] {} virtual ~CartesianProductGenerator$i() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, $for j, [[g$(j)_, g$(j)_.begin()]]); } virtual ParamIteratorInterface* End() const { return new Iterator(this, $for j, [[g$(j)_, g$(j)_.end()]]); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, $for j, [[ const ParamGenerator& g$j, const typename ParamGenerator::iterator& current$(j)]]) : base_(base), $for j, [[ begin$(j)_(g$j.begin()), end$(j)_(g$j.end()), current$(j)_(current$j) ]] { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current$(i)_; $for k [[ if (current$(i+2-k)_ == end$(i+2-k)_) { current$(i+2-k)_ = begin$(i+2-k)_; ++current$(i+2-k-1)_; } ]] ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ($for j && [[ current$(j)_ == typed_other->current$(j)_ ]]); } private: Iterator(const Iterator& other) : base_(other.base_), $for j, [[ begin$(j)_(other.begin$(j)_), end$(j)_(other.end$(j)_), current$(j)_(other.current$(j)_) ]] { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType($for j, [[*current$(j)_]]); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return $for j || [[ current$(j)_ == end$(j)_ ]]; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. $for j [[ const typename ParamGenerator::iterator begin$(j)_; const typename ParamGenerator::iterator end$(j)_; typename ParamGenerator::iterator current$(j)_; ]] ParamType current_value_; }; // class CartesianProductGenerator$i::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator$i& other); $for j [[ const ParamGenerator g$(j)_; ]] }; // class CartesianProductGenerator$i ]] // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Helper classes providing Combine() with polymorphic features. They allow // casting CartesianProductGeneratorN to ParamGenerator if T is // convertible to U. // $range i 2..maxtuple $for i [[ $range j 1..i template <$for j, [[class Generator$j]]> class CartesianProductHolder$i { public: CartesianProductHolder$i($for j, [[const Generator$j& g$j]]) : $for j, [[g$(j)_(g$j)]] {} template <$for j, [[typename T$j]]> operator ParamGenerator< ::std::tr1::tuple<$for j, [[T$j]]> >() const { return ParamGenerator< ::std::tr1::tuple<$for j, [[T$j]]> >( new CartesianProductGenerator$i<$for j, [[T$j]]>( $for j,[[ static_cast >(g$(j)_) ]])); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder$i& other); $for j [[ const Generator$j g$(j)_; ]] }; // class CartesianProductHolder$i ]] # endif // GTEST_HAS_COMBINE } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-param-util.h0000600000175000017500000005725211561126632027410 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #include #include #include // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-linked_ptr.h" #include "gtest/internal/gtest-port.h" #include "gtest/gtest-printers.h" #if GTEST_HAS_PARAM_TEST namespace testing { namespace internal { // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Outputs a message explaining invalid registration of different // fixture class for the same test case. This may happen when // TEST_P macro is used to define two tests with the same name // but in different namespaces. GTEST_API_ void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line); template class ParamGeneratorInterface; template class ParamGenerator; // Interface for iterating over elements provided by an implementation // of ParamGeneratorInterface. template class ParamIteratorInterface { public: virtual ~ParamIteratorInterface() {} // A pointer to the base generator instance. // Used only for the purposes of iterator comparison // to make sure that two iterators belong to the same generator. virtual const ParamGeneratorInterface* BaseGenerator() const = 0; // Advances iterator to point to the next element // provided by the generator. The caller is responsible // for not calling Advance() on an iterator equal to // BaseGenerator()->End(). virtual void Advance() = 0; // Clones the iterator object. Used for implementing copy semantics // of ParamIterator. virtual ParamIteratorInterface* Clone() const = 0; // Dereferences the current iterator and provides (read-only) access // to the pointed value. It is the caller's responsibility not to call // Current() on an iterator equal to BaseGenerator()->End(). // Used for implementing ParamGenerator::operator*(). virtual const T* Current() const = 0; // Determines whether the given iterator and other point to the same // element in the sequence generated by the generator. // Used for implementing ParamGenerator::operator==(). virtual bool Equals(const ParamIteratorInterface& other) const = 0; }; // Class iterating over elements provided by an implementation of // ParamGeneratorInterface. It wraps ParamIteratorInterface // and implements the const forward iterator concept. template class ParamIterator { public: typedef T value_type; typedef const T& reference; typedef ptrdiff_t difference_type; // ParamIterator assumes ownership of the impl_ pointer. ParamIterator(const ParamIterator& other) : impl_(other.impl_->Clone()) {} ParamIterator& operator=(const ParamIterator& other) { if (this != &other) impl_.reset(other.impl_->Clone()); return *this; } const T& operator*() const { return *impl_->Current(); } const T* operator->() const { return impl_->Current(); } // Prefix version of operator++. ParamIterator& operator++() { impl_->Advance(); return *this; } // Postfix version of operator++. ParamIterator operator++(int /*unused*/) { ParamIteratorInterface* clone = impl_->Clone(); impl_->Advance(); return ParamIterator(clone); } bool operator==(const ParamIterator& other) const { return impl_.get() == other.impl_.get() || impl_->Equals(*other.impl_); } bool operator!=(const ParamIterator& other) const { return !(*this == other); } private: friend class ParamGenerator; explicit ParamIterator(ParamIteratorInterface* impl) : impl_(impl) {} scoped_ptr > impl_; }; // ParamGeneratorInterface is the binary interface to access generators // defined in other translation units. template class ParamGeneratorInterface { public: typedef T ParamType; virtual ~ParamGeneratorInterface() {} // Generator interface definition virtual ParamIteratorInterface* Begin() const = 0; virtual ParamIteratorInterface* End() const = 0; }; // Wraps ParamGeneratorInterface and provides general generator syntax // compatible with the STL Container concept. // This class implements copy initialization semantics and the contained // ParamGeneratorInterface instance is shared among all copies // of the original object. This is possible because that instance is immutable. template class ParamGenerator { public: typedef ParamIterator iterator; explicit ParamGenerator(ParamGeneratorInterface* impl) : impl_(impl) {} ParamGenerator(const ParamGenerator& other) : impl_(other.impl_) {} ParamGenerator& operator=(const ParamGenerator& other) { impl_ = other.impl_; return *this; } iterator begin() const { return iterator(impl_->Begin()); } iterator end() const { return iterator(impl_->End()); } private: linked_ptr > impl_; }; // Generates values from a range of two comparable values. Can be used to // generate sequences of user-defined types that implement operator+() and // operator<(). // This class is used in the Range() function. template class RangeGenerator : public ParamGeneratorInterface { public: RangeGenerator(T begin, T end, IncrementT step) : begin_(begin), end_(end), step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} virtual ~RangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, begin_, 0, step_); } virtual ParamIteratorInterface* End() const { return new Iterator(this, end_, end_index_, step_); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, T value, int index, IncrementT step) : base_(base), value_(value), index_(index), step_(step) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { value_ = value_ + step_; index_++; } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const T* Current() const { return &value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const int other_index = CheckedDowncastToActualType(&other)->index_; return index_ == other_index; } private: Iterator(const Iterator& other) : ParamIteratorInterface(), base_(other.base_), value_(other.value_), index_(other.index_), step_(other.step_) {} // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; T value_; int index_; const IncrementT step_; }; // class RangeGenerator::Iterator static int CalculateEndIndex(const T& begin, const T& end, const IncrementT& step) { int end_index = 0; for (T i = begin; i < end; i = i + step) end_index++; return end_index; } // No implementation - assignment is unsupported. void operator=(const RangeGenerator& other); const T begin_; const T end_; const IncrementT step_; // The index for the end() iterator. All the elements in the generated // sequence are indexed (0-based) to aid iterator comparison. const int end_index_; }; // class RangeGenerator // Generates values from a pair of STL-style iterators. Used in the // ValuesIn() function. The elements are copied from the source range // since the source can be located on the stack, and the generator // is likely to persist beyond that stack frame. template class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface { public: template ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end) : container_(begin, end) {} virtual ~ValuesInIteratorRangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, container_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, container_.end()); } private: typedef typename ::std::vector ContainerType; class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, typename ContainerType::const_iterator iterator) : base_(base), iterator_(iterator) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { ++iterator_; value_.reset(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } // We need to use cached value referenced by iterator_ because *iterator_ // can return a temporary object (and of type other then T), so just // having "return &*iterator_;" doesn't work. // value_ is updated here and not in Advance() because Advance() // can advance iterator_ beyond the end of the range, and we cannot // detect that fact. The client code, on the other hand, is // responsible for not calling Current() on an out-of-range iterator. virtual const T* Current() const { if (value_.get() == NULL) value_.reset(new T(*iterator_)); return value_.get(); } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; return iterator_ == CheckedDowncastToActualType(&other)->iterator_; } private: Iterator(const Iterator& other) // The explicit constructor call suppresses a false warning // emitted by gcc when supplied with the -Wextra option. : ParamIteratorInterface(), base_(other.base_), iterator_(other.iterator_) {} const ParamGeneratorInterface* const base_; typename ContainerType::const_iterator iterator_; // A cached value of *iterator_. We keep it here to allow access by // pointer in the wrapping iterator's operator->(). // value_ needs to be mutable to be accessed in Current(). // Use of scoped_ptr helps manage cached value's lifetime, // which is bound by the lifespan of the iterator itself. mutable scoped_ptr value_; }; // class ValuesInIteratorRangeGenerator::Iterator // No implementation - assignment is unsupported. void operator=(const ValuesInIteratorRangeGenerator& other); const ContainerType container_; }; // class ValuesInIteratorRangeGenerator // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Stores a parameter value and later creates tests parameterized with that // value. template class ParameterizedTestFactory : public TestFactoryBase { public: typedef typename TestClass::ParamType ParamType; explicit ParameterizedTestFactory(ParamType parameter) : parameter_(parameter) {} virtual Test* CreateTest() { TestClass::SetParam(¶meter_); return new TestClass(); } private: const ParamType parameter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactoryBase is a base class for meta-factories that create // test factories for passing into MakeAndRegisterTestInfo function. template class TestMetaFactoryBase { public: virtual ~TestMetaFactoryBase() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) = 0; }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactory creates test factories for passing into // MakeAndRegisterTestInfo function. Since MakeAndRegisterTestInfo receives // ownership of test factory pointer, same factory object cannot be passed // into that method twice. But ParameterizedTestCaseInfo is going to call // it for each Test/Parameter value combination. Thus it needs meta factory // creator class. template class TestMetaFactory : public TestMetaFactoryBase { public: typedef typename TestCase::ParamType ParamType; TestMetaFactory() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) { return new ParameterizedTestFactory(parameter); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestMetaFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfoBase is a generic interface // to ParameterizedTestCaseInfo classes. ParameterizedTestCaseInfoBase // accumulates test information provided by TEST_P macro invocations // and generators provided by INSTANTIATE_TEST_CASE_P macro invocations // and uses that information to register all resulting test instances // in RegisterTests method. The ParameterizeTestCaseRegistry class holds // a collection of pointers to the ParameterizedTestCaseInfo objects // and calls RegisterTests() on each of them when asked. class ParameterizedTestCaseInfoBase { public: virtual ~ParameterizedTestCaseInfoBase() {} // Base part of test case name for display purposes. virtual const string& GetTestCaseName() const = 0; // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const = 0; // UnitTest class invokes this method to register tests in this // test case right before running them in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. virtual void RegisterTests() = 0; protected: ParameterizedTestCaseInfoBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfoBase); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfo accumulates tests obtained from TEST_P // macro invocations for a particular test case and generators // obtained from INSTANTIATE_TEST_CASE_P macro invocations for that // test case. It registers tests with all values generated by all // generators when asked. template class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase { public: // ParamType and GeneratorCreationFunc are private types but are required // for declarations of public methods AddTestPattern() and // AddTestCaseInstantiation(). typedef typename TestCase::ParamType ParamType; // A function that returns an instance of appropriate generator type. typedef ParamGenerator(GeneratorCreationFunc)(); explicit ParameterizedTestCaseInfo(const char* name) : test_case_name_(name) {} // Test case base name for display purposes. virtual const string& GetTestCaseName() const { return test_case_name_; } // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const { return GetTypeId(); } // TEST_P macro uses AddTestPattern() to record information // about a single test in a LocalTestInfo structure. // test_case_name is the base name of the test case (without invocation // prefix). test_base_name is the name of an individual test without // parameter index. For the test SequenceA/FooTest.DoBar/1 FooTest is // test case base name and DoBar is test base name. void AddTestPattern(const char* test_case_name, const char* test_base_name, TestMetaFactoryBase* meta_factory) { tests_.push_back(linked_ptr(new TestInfo(test_case_name, test_base_name, meta_factory))); } // INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information // about a generator. int AddTestCaseInstantiation(const string& instantiation_name, GeneratorCreationFunc* func, const char* /* file */, int /* line */) { instantiations_.push_back(::std::make_pair(instantiation_name, func)); return 0; // Return value used only to run this method in namespace scope. } // UnitTest class invokes this method to register tests in this test case // test cases right before running tests in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. // UnitTest has a guard to prevent from calling this method more then once. virtual void RegisterTests() { for (typename TestInfoContainer::iterator test_it = tests_.begin(); test_it != tests_.end(); ++test_it) { linked_ptr test_info = *test_it; for (typename InstantiationContainer::iterator gen_it = instantiations_.begin(); gen_it != instantiations_.end(); ++gen_it) { const string& instantiation_name = gen_it->first; ParamGenerator generator((*gen_it->second)()); Message test_case_name_stream; if ( !instantiation_name.empty() ) test_case_name_stream << instantiation_name << "/"; test_case_name_stream << test_info->test_case_base_name; int i = 0; for (typename ParamGenerator::iterator param_it = generator.begin(); param_it != generator.end(); ++param_it, ++i) { Message test_name_stream; test_name_stream << test_info->test_base_name << "/" << i; MakeAndRegisterTestInfo( test_case_name_stream.GetString().c_str(), test_name_stream.GetString().c_str(), NULL, // No type parameter. PrintToString(*param_it).c_str(), GetTestCaseTypeId(), TestCase::SetUpTestCase, TestCase::TearDownTestCase, test_info->test_meta_factory->CreateTestFactory(*param_it)); } // for param_it } // for gen_it } // for test_it } // RegisterTests private: // LocalTestInfo structure keeps information about a single test registered // with TEST_P macro. struct TestInfo { TestInfo(const char* a_test_case_base_name, const char* a_test_base_name, TestMetaFactoryBase* a_test_meta_factory) : test_case_base_name(a_test_case_base_name), test_base_name(a_test_base_name), test_meta_factory(a_test_meta_factory) {} const string test_case_base_name; const string test_base_name; const scoped_ptr > test_meta_factory; }; typedef ::std::vector > TestInfoContainer; // Keeps pairs of // received from INSTANTIATE_TEST_CASE_P macros. typedef ::std::vector > InstantiationContainer; const string test_case_name_; TestInfoContainer tests_; InstantiationContainer instantiations_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfo); }; // class ParameterizedTestCaseInfo // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseRegistry contains a map of ParameterizedTestCaseInfoBase // classes accessed by test case names. TEST_P and INSTANTIATE_TEST_CASE_P // macros use it to locate their corresponding ParameterizedTestCaseInfo // descriptors. class ParameterizedTestCaseRegistry { public: ParameterizedTestCaseRegistry() {} ~ParameterizedTestCaseRegistry() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { delete *it; } } // Looks up or creates and returns a structure containing information about // tests and instantiations of a particular test case. template ParameterizedTestCaseInfo* GetTestCasePatternHolder( const char* test_case_name, const char* file, int line) { ParameterizedTestCaseInfo* typed_test_info = NULL; for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { if ((*it)->GetTestCaseName() == test_case_name) { if ((*it)->GetTestCaseTypeId() != GetTypeId()) { // Complain about incorrect usage of Google Test facilities // and terminate the program since we cannot guaranty correct // test case setup and tear-down in this case. ReportInvalidTestCaseType(test_case_name, file, line); posix::Abort(); } else { // At this point we are sure that the object we found is of the same // type we are looking for, so we downcast it to that type // without further checks. typed_test_info = CheckedDowncastToActualType< ParameterizedTestCaseInfo >(*it); } break; } } if (typed_test_info == NULL) { typed_test_info = new ParameterizedTestCaseInfo(test_case_name); test_case_infos_.push_back(typed_test_info); } return typed_test_info; } void RegisterTests() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { (*it)->RegisterTests(); } } private: typedef ::std::vector TestCaseInfoContainer; TestCaseInfoContainer test_case_infos_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry); }; } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-port.h0000600000175000017500000017144311561126632026320 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan) // // Low-level types and utilities for porting Google Test to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ // The user can define the following macros in the build script to // control Google Test's behavior. If the user doesn't define a macro // in this list, Google Test will define it. // // GTEST_HAS_CLONE - Define it to 1/0 to indicate that clone(2) // is/isn't available. // GTEST_HAS_EXCEPTIONS - Define it to 1/0 to indicate that exceptions // are enabled. // GTEST_HAS_GLOBAL_STRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::string, which is different to std::string). // GTEST_HAS_GLOBAL_WSTRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::wstring, which is different to std::wstring). // GTEST_HAS_POSIX_RE - Define it to 1/0 to indicate that POSIX regular // expressions are/aren't available. // GTEST_HAS_PTHREAD - Define it to 1/0 to indicate that // is/isn't available. // GTEST_HAS_RTTI - Define it to 1/0 to indicate that RTTI is/isn't // enabled. // GTEST_HAS_STD_WSTRING - Define it to 1/0 to indicate that // std::wstring does/doesn't work (Google Test can // be used where std::wstring is unavailable). // GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple // is/isn't available. // GTEST_HAS_SEH - Define it to 1/0 to indicate whether the // compiler supports Microsoft's "Structured // Exception Handling". // GTEST_HAS_STREAM_REDIRECTION // - Define it to 1/0 to indicate whether the // platform supports I/O stream redirection using // dup() and dup2(). // GTEST_USE_OWN_TR1_TUPLE - Define it to 1/0 to indicate whether Google // Test's own tr1 tuple implementation should be // used. Unused when the user sets // GTEST_HAS_TR1_TUPLE to 0. // GTEST_LINKED_AS_SHARED_LIBRARY // - Define to 1 when compiling tests that use // Google Test as a shared library (known as // DLL on Windows). // GTEST_CREATE_SHARED_LIBRARY // - Define to 1 when compiling Google Test itself // as a shared library. // This header defines the following utilities: // // Macros indicating the current platform (defined to 1 if compiled on // the given platform; otherwise undefined): // GTEST_OS_AIX - IBM AIX // GTEST_OS_CYGWIN - Cygwin // GTEST_OS_HPUX - HP-UX // GTEST_OS_LINUX - Linux // GTEST_OS_LINUX_ANDROID - Google Android // GTEST_OS_MAC - Mac OS X // GTEST_OS_NACL - Google Native Client (NaCl) // GTEST_OS_SOLARIS - Sun Solaris // GTEST_OS_SYMBIAN - Symbian // GTEST_OS_WINDOWS - Windows (Desktop, MinGW, or Mobile) // GTEST_OS_WINDOWS_DESKTOP - Windows Desktop // GTEST_OS_WINDOWS_MINGW - MinGW // GTEST_OS_WINDOWS_MOBILE - Windows Mobile // GTEST_OS_ZOS - z/OS // // Among the platforms, Cygwin, Linux, Max OS X, and Windows have the // most stable support. Since core members of the Google Test project // don't have access to other platforms, support for them may be less // stable. If you notice any problems on your platform, please notify // googletestframework@googlegroups.com (patches for fixing them are // even more welcome!). // // Note that it is possible that none of the GTEST_OS_* macros are defined. // // Macros indicating available Google Test features (defined to 1 if // the corresponding feature is supported; otherwise undefined): // GTEST_HAS_COMBINE - the Combine() function (for value-parameterized // tests) // GTEST_HAS_DEATH_TEST - death tests // GTEST_HAS_PARAM_TEST - value-parameterized tests // GTEST_HAS_TYPED_TEST - typed tests // GTEST_HAS_TYPED_TEST_P - type-parameterized tests // GTEST_USES_POSIX_RE - enhanced POSIX regex is used. Do not confuse with // GTEST_HAS_POSIX_RE (see above) which users can // define themselves. // GTEST_USES_SIMPLE_RE - our own simple regex is used; // the above two are mutually exclusive. // GTEST_CAN_COMPARE_NULL - accepts untyped NULL in EXPECT_EQ(). // // Macros for basic C++ coding: // GTEST_AMBIGUOUS_ELSE_BLOCKER_ - for disabling a gcc warning. // GTEST_ATTRIBUTE_UNUSED_ - declares that a class' instances or a // variable don't have to be used. // GTEST_DISALLOW_ASSIGN_ - disables operator=. // GTEST_DISALLOW_COPY_AND_ASSIGN_ - disables copy ctor and operator=. // GTEST_MUST_USE_RESULT_ - declares that a function's result must be used. // // Synchronization: // Mutex, MutexLock, ThreadLocal, GetThreadCount() // - synchronization primitives. // GTEST_IS_THREADSAFE - defined to 1 to indicate that the above // synchronization primitives have real implementations // and Google Test is thread-safe; or 0 otherwise. // // Template meta programming: // is_pointer - as in TR1; needed on Symbian and IBM XL C/C++ only. // IteratorTraits - partial implementation of std::iterator_traits, which // is not available in libCstd when compiled with Sun C++. // // Smart pointers: // scoped_ptr - as in TR2. // // Regular expressions: // RE - a simple regular expression class using the POSIX // Extended Regular Expression syntax on UNIX-like // platforms, or a reduced regular exception syntax on // other platforms, including Windows. // // Logging: // GTEST_LOG_() - logs messages at the specified severity level. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. // // Stdout and stderr capturing: // CaptureStdout() - starts capturing stdout. // GetCapturedStdout() - stops capturing stdout and returns the captured // string. // CaptureStderr() - starts capturing stderr. // GetCapturedStderr() - stops capturing stderr and returns the captured // string. // // Integer types: // TypeWithSize - maps an integer to a int type. // Int32, UInt32, Int64, UInt64, TimeInMillis // - integers of known sizes. // BiggestInt - the biggest signed integer type. // // Command-line utilities: // GTEST_FLAG() - references a flag. // GTEST_DECLARE_*() - declares a flag. // GTEST_DEFINE_*() - defines a flag. // GetArgvs() - returns the command line as a vector of strings. // // Environment variable utilities: // GetEnv() - gets the value of an environment variable. // BoolFromGTestEnv() - parses a bool environment variable. // Int32FromGTestEnv() - parses an Int32 environment variable. // StringFromGTestEnv() - parses a string environment variable. #include // for isspace, etc #include // for ptrdiff_t #include #include #include #ifndef _WIN32_WCE # include # include #endif // !_WIN32_WCE #include // NOLINT #include // NOLINT #include // NOLINT #define GTEST_DEV_EMAIL_ "googletestframework@@googlegroups.com" #define GTEST_FLAG_PREFIX_ "gtest_" #define GTEST_FLAG_PREFIX_DASH_ "gtest-" #define GTEST_FLAG_PREFIX_UPPER_ "GTEST_" #define GTEST_NAME_ "Google Test" #define GTEST_PROJECT_URL_ "http://code.google.com/p/googletest/" // Determines the version of gcc that is used to compile this. #ifdef __GNUC__ // 40302 means version 4.3.2. # define GTEST_GCC_VER_ \ (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__) #endif // __GNUC__ // Determines the platform on which Google Test is compiled. #ifdef __CYGWIN__ # define GTEST_OS_CYGWIN 1 #elif defined __SYMBIAN32__ # define GTEST_OS_SYMBIAN 1 #elif defined _WIN32 # define GTEST_OS_WINDOWS 1 # ifdef _WIN32_WCE # define GTEST_OS_WINDOWS_MOBILE 1 # elif defined(__MINGW__) || defined(__MINGW32__) # define GTEST_OS_WINDOWS_MINGW 1 # else # define GTEST_OS_WINDOWS_DESKTOP 1 # endif // _WIN32_WCE #elif defined __APPLE__ # define GTEST_OS_MAC 1 #elif defined __linux__ # define GTEST_OS_LINUX 1 # ifdef ANDROID # define GTEST_OS_LINUX_ANDROID 1 # endif // ANDROID #elif defined __MVS__ # define GTEST_OS_ZOS 1 #elif defined(__sun) && defined(__SVR4) # define GTEST_OS_SOLARIS 1 #elif defined(_AIX) # define GTEST_OS_AIX 1 #elif defined(__hpux) # define GTEST_OS_HPUX 1 #elif defined __native_client__ # define GTEST_OS_NACL 1 #endif // __CYGWIN__ // Brings in definitions for functions used in the testing::internal::posix // namespace (read, write, close, chdir, isatty, stat). We do not currently // use them on Windows Mobile. #if !GTEST_OS_WINDOWS // This assumes that non-Windows OSes provide unistd.h. For OSes where this // is not the case, we need to include headers that provide the functions // mentioned above. # include # if !GTEST_OS_NACL // TODO(vladl@google.com): Remove this condition when Native Client SDK adds // strings.h (tracked in // http://code.google.com/p/nativeclient/issues/detail?id=1175). # include // Native Client doesn't provide strings.h. # endif #elif !GTEST_OS_WINDOWS_MOBILE # include # include #endif // Defines this to true iff Google Test can use POSIX regular expressions. #ifndef GTEST_HAS_POSIX_RE # define GTEST_HAS_POSIX_RE (!GTEST_OS_WINDOWS) #endif #if GTEST_HAS_POSIX_RE // On some platforms, needs someone to define size_t, and // won't compile otherwise. We can #include it here as we already // included , which is guaranteed to define size_t through // . # include // NOLINT # define GTEST_USES_POSIX_RE 1 #elif GTEST_OS_WINDOWS // is not available on Windows. Use our own simple regex // implementation instead. # define GTEST_USES_SIMPLE_RE 1 #else // may not be available on this platform. Use our own // simple regex implementation instead. # define GTEST_USES_SIMPLE_RE 1 #endif // GTEST_HAS_POSIX_RE #ifndef GTEST_HAS_EXCEPTIONS // The user didn't tell us whether exceptions are enabled, so we need // to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC's and C++Builder's implementations of the STL use the _HAS_EXCEPTIONS // macro to enable exceptions, so we'll do the same. // Assumes that exceptions are enabled by default. # ifndef _HAS_EXCEPTIONS # define _HAS_EXCEPTIONS 1 # endif // _HAS_EXCEPTIONS # define GTEST_HAS_EXCEPTIONS _HAS_EXCEPTIONS # elif defined(__GNUC__) && __EXCEPTIONS // gcc defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__SUNPRO_CC) // Sun Pro CC supports exceptions. However, there is no compile-time way of // detecting whether they are enabled or not. Therefore, we assume that // they are enabled unless the user tells us otherwise. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__IBMCPP__) && __EXCEPTIONS // xlC defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__HP_aCC) // Exception handling is in effect by default in HP aCC compiler. It has to // be turned of by +noeh compiler option if desired. # define GTEST_HAS_EXCEPTIONS 1 # else // For other compilers, we assume exceptions are disabled to be // conservative. # define GTEST_HAS_EXCEPTIONS 0 # endif // defined(_MSC_VER) || defined(__BORLANDC__) #endif // GTEST_HAS_EXCEPTIONS #if !defined(GTEST_HAS_STD_STRING) // Even though we don't use this macro any longer, we keep it in case // some clients still depend on it. # define GTEST_HAS_STD_STRING 1 #elif !GTEST_HAS_STD_STRING // The user told us that ::std::string isn't available. # error "Google Test cannot be used where ::std::string isn't available." #endif // !defined(GTEST_HAS_STD_STRING) #ifndef GTEST_HAS_GLOBAL_STRING // The user didn't tell us whether ::string is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_STRING 0 #endif // GTEST_HAS_GLOBAL_STRING #ifndef GTEST_HAS_STD_WSTRING // The user didn't tell us whether ::std::wstring is available, so we need // to figure it out. // TODO(wan@google.com): uses autoconf to detect whether ::std::wstring // is available. // Cygwin 1.7 and below doesn't support ::std::wstring. // Solaris' libc++ doesn't support it either. Android has // no support for it at least as recent as Froyo (2.2). # define GTEST_HAS_STD_WSTRING \ (!(GTEST_OS_LINUX_ANDROID || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS)) #endif // GTEST_HAS_STD_WSTRING #ifndef GTEST_HAS_GLOBAL_WSTRING // The user didn't tell us whether ::wstring is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_WSTRING \ (GTEST_HAS_STD_WSTRING && GTEST_HAS_GLOBAL_STRING) #endif // GTEST_HAS_GLOBAL_WSTRING // Determines whether RTTI is available. #ifndef GTEST_HAS_RTTI // The user didn't tell us whether RTTI is enabled, so we need to // figure it out. # ifdef _MSC_VER # ifdef _CPPRTTI // MSVC defines this macro iff RTTI is enabled. # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // Starting with version 4.3.2, gcc defines __GXX_RTTI iff RTTI is enabled. # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40302) # ifdef __GXX_RTTI # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // __GXX_RTTI // Starting with version 9.0 IBM Visual Age defines __RTTI_ALL__ to 1 if // both the typeid and dynamic_cast features are present. # elif defined(__IBMCPP__) && (__IBMCPP__ >= 900) # ifdef __RTTI_ALL__ # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif # else // For all other compilers, we assume RTTI is enabled. # define GTEST_HAS_RTTI 1 # endif // _MSC_VER #endif // GTEST_HAS_RTTI // It's this header's responsibility to #include when RTTI // is enabled. #if GTEST_HAS_RTTI # include #endif // Determines whether Google Test can use the pthreads library. #ifndef GTEST_HAS_PTHREAD // The user didn't tell us explicitly, so we assume pthreads support is // available on Linux and Mac. // // To disable threading support in Google Test, add -DGTEST_HAS_PTHREAD=0 // to your compiler flags. # define GTEST_HAS_PTHREAD (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_HPUX) #endif // GTEST_HAS_PTHREAD #if GTEST_HAS_PTHREAD // gtest-port.h guarantees to #include when GTEST_HAS_PTHREAD is // true. # include // NOLINT // For timespec and nanosleep, used below. # include // NOLINT #endif // Determines whether Google Test can use tr1/tuple. You can define // this macro to 0 to prevent Google Test from using tuple (any // feature depending on tuple with be disabled in this mode). #ifndef GTEST_HAS_TR1_TUPLE // The user didn't tell us not to do it, so we assume it's OK. # define GTEST_HAS_TR1_TUPLE 1 #endif // GTEST_HAS_TR1_TUPLE // Determines whether Google Test's own tr1 tuple implementation // should be used. #ifndef GTEST_USE_OWN_TR1_TUPLE // The user didn't tell us, so we need to figure it out. // We use our own TR1 tuple if we aren't sure the user has an // implementation of it already. At this time, GCC 4.0.0+ and MSVC // 2010 are the only mainstream compilers that come with a TR1 tuple // implementation. NVIDIA's CUDA NVCC compiler pretends to be GCC by // defining __GNUC__ and friends, but cannot compile GCC's tuple // implementation. MSVC 2008 (9.0) provides TR1 tuple in a 323 MB // Feature Pack download, which we cannot assume the user has. # if (defined(__GNUC__) && !defined(__CUDACC__) && (GTEST_GCC_VER_ >= 40000)) \ || _MSC_VER >= 1600 # define GTEST_USE_OWN_TR1_TUPLE 0 # else # define GTEST_USE_OWN_TR1_TUPLE 1 # endif #endif // GTEST_USE_OWN_TR1_TUPLE // To avoid conditional compilation everywhere, we make it // gtest-port.h's responsibility to #include the header implementing // tr1/tuple. #if GTEST_HAS_TR1_TUPLE # if GTEST_USE_OWN_TR1_TUPLE # include "gtest/internal/gtest-tuple.h" # elif GTEST_OS_SYMBIAN // On Symbian, BOOST_HAS_TR1_TUPLE causes Boost's TR1 tuple library to // use STLport's tuple implementation, which unfortunately doesn't // work as the copy of STLport distributed with Symbian is incomplete. // By making sure BOOST_HAS_TR1_TUPLE is undefined, we force Boost to // use its own tuple implementation. # ifdef BOOST_HAS_TR1_TUPLE # undef BOOST_HAS_TR1_TUPLE # endif // BOOST_HAS_TR1_TUPLE // This prevents , which defines // BOOST_HAS_TR1_TUPLE, from being #included by Boost's . # define BOOST_TR1_DETAIL_CONFIG_HPP_INCLUDED # include # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40000) // GCC 4.0+ implements tr1/tuple in the header. This does // not conform to the TR1 spec, which requires the header to be . # if !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 // Until version 4.3.2, gcc has a bug that causes , // which is #included by , to not compile when RTTI is // disabled. _TR1_FUNCTIONAL is the header guard for // . Hence the following #define is a hack to prevent // from being included. # define _TR1_FUNCTIONAL 1 # include # undef _TR1_FUNCTIONAL // Allows the user to #include // if he chooses to. # else # include // NOLINT # endif // !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 # else // If the compiler is not GCC 4.0+, we assume the user is using a // spec-conforming TR1 implementation. # include // NOLINT # endif // GTEST_USE_OWN_TR1_TUPLE #endif // GTEST_HAS_TR1_TUPLE // Determines whether clone(2) is supported. // Usually it will only be available on Linux, excluding // Linux on the Itanium architecture. // Also see http://linux.die.net/man/2/clone. #ifndef GTEST_HAS_CLONE // The user didn't tell us, so we need to figure it out. # if GTEST_OS_LINUX && !defined(__ia64__) # define GTEST_HAS_CLONE 1 # else # define GTEST_HAS_CLONE 0 # endif // GTEST_OS_LINUX && !defined(__ia64__) #endif // GTEST_HAS_CLONE // Determines whether to support stream redirection. This is used to test // output correctness and to implement death tests. #ifndef GTEST_HAS_STREAM_REDIRECTION // By default, we assume that stream redirection is supported on all // platforms except known mobile ones. # if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN # define GTEST_HAS_STREAM_REDIRECTION 0 # else # define GTEST_HAS_STREAM_REDIRECTION 1 # endif // !GTEST_OS_WINDOWS_MOBILE && !GTEST_OS_SYMBIAN #endif // GTEST_HAS_STREAM_REDIRECTION // Determines whether to support death tests. // Google Test does not support death tests for VC 7.1 and earlier as // abort() in a VC 7.1 application compiled as GUI in debug config // pops up a dialog window that cannot be suppressed programmatically. #if (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS || \ (GTEST_OS_WINDOWS_DESKTOP && _MSC_VER >= 1400) || \ GTEST_OS_WINDOWS_MINGW || GTEST_OS_AIX || GTEST_OS_HPUX) # define GTEST_HAS_DEATH_TEST 1 # include // NOLINT #endif // We don't support MSVC 7.1 with exceptions disabled now. Therefore // all the compilers we care about are adequate for supporting // value-parameterized tests. #define GTEST_HAS_PARAM_TEST 1 // Determines whether to support type-driven tests. // Typed tests need and variadic macros, which GCC, VC++ 8.0, // Sun Pro CC, IBM Visual Age, and HP aCC support. #if defined(__GNUC__) || (_MSC_VER >= 1400) || defined(__SUNPRO_CC) || \ defined(__IBMCPP__) || defined(__HP_aCC) # define GTEST_HAS_TYPED_TEST 1 # define GTEST_HAS_TYPED_TEST_P 1 #endif // Determines whether to support Combine(). This only makes sense when // value-parameterized tests are enabled. The implementation doesn't // work on Sun Studio since it doesn't understand templated conversion // operators. #if GTEST_HAS_PARAM_TEST && GTEST_HAS_TR1_TUPLE && !defined(__SUNPRO_CC) # define GTEST_HAS_COMBINE 1 #endif // Determines whether the system compiler uses UTF-16 for encoding wide strings. #define GTEST_WIDE_STRING_USES_UTF16_ \ (GTEST_OS_WINDOWS || GTEST_OS_CYGWIN || GTEST_OS_SYMBIAN || GTEST_OS_AIX) // Determines whether test results can be streamed to a socket. #if GTEST_OS_LINUX # define GTEST_CAN_STREAM_RESULTS_ 1 #endif // Defines some utility macros. // The GNU compiler emits a warning if nested "if" statements are followed by // an "else" statement and braces are not used to explicitly disambiguate the // "else" binding. This leads to problems with code like: // // if (gate) // ASSERT_*(condition) << "Some message"; // // The "switch (0) case 0:" idiom is used to suppress this. #ifdef __INTEL_COMPILER # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ #else # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ switch (0) case 0: default: // NOLINT #endif // Use this annotation at the end of a struct/class definition to // prevent the compiler from optimizing away instances that are never // used. This is useful when all interesting logic happens inside the // c'tor and / or d'tor. Example: // // struct Foo { // Foo() { ... } // } GTEST_ATTRIBUTE_UNUSED_; // // Also use it after a variable or parameter declaration to tell the // compiler the variable/parameter does not have to be used. #if defined(__GNUC__) && !defined(COMPILER_ICC) # define GTEST_ATTRIBUTE_UNUSED_ __attribute__ ((unused)) #else # define GTEST_ATTRIBUTE_UNUSED_ #endif // A macro to disallow operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_ASSIGN_(type)\ void operator=(type const &) // A macro to disallow copy constructor and operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_COPY_AND_ASSIGN_(type)\ type(type const &);\ GTEST_DISALLOW_ASSIGN_(type) // Tell the compiler to warn about unused return values for functions declared // with this macro. The macro should be used on function declarations // following the argument list: // // Sprocket* AllocateSprocket() GTEST_MUST_USE_RESULT_; #if defined(__GNUC__) && (GTEST_GCC_VER_ >= 30400) && !defined(COMPILER_ICC) # define GTEST_MUST_USE_RESULT_ __attribute__ ((warn_unused_result)) #else # define GTEST_MUST_USE_RESULT_ #endif // __GNUC__ && (GTEST_GCC_VER_ >= 30400) && !COMPILER_ICC // Determine whether the compiler supports Microsoft's Structured Exception // Handling. This is supported by several Windows compilers but generally // does not exist on any other system. #ifndef GTEST_HAS_SEH // The user didn't tell us, so we need to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // These two compilers are known to support SEH. # define GTEST_HAS_SEH 1 # else // Assume no SEH. # define GTEST_HAS_SEH 0 # endif #endif // GTEST_HAS_SEH #ifdef _MSC_VER # if GTEST_LINKED_AS_SHARED_LIBRARY # define GTEST_API_ __declspec(dllimport) # elif GTEST_CREATE_SHARED_LIBRARY # define GTEST_API_ __declspec(dllexport) # endif #endif // _MSC_VER #ifndef GTEST_API_ # define GTEST_API_ #endif #ifdef __GNUC__ // Ask the compiler to never inline a given function. # define GTEST_NO_INLINE_ __attribute__((noinline)) #else # define GTEST_NO_INLINE_ #endif namespace testing { class Message; namespace internal { class String; // The GTEST_COMPILE_ASSERT_ macro can be used to verify that a compile time // expression is true. For example, you could use it to verify the // size of a static array: // // GTEST_COMPILE_ASSERT_(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES, // content_type_names_incorrect_size); // // or to make sure a struct is smaller than a certain size: // // GTEST_COMPILE_ASSERT_(sizeof(foo) < 128, foo_too_large); // // The second argument to the macro is the name of the variable. If // the expression is false, most compilers will issue a warning/error // containing the name of the variable. template struct CompileAssert { }; #define GTEST_COMPILE_ASSERT_(expr, msg) \ typedef ::testing::internal::CompileAssert<(bool(expr))> \ msg[bool(expr) ? 1 : -1] // Implementation details of GTEST_COMPILE_ASSERT_: // // - GTEST_COMPILE_ASSERT_ works by defining an array type that has -1 // elements (and thus is invalid) when the expression is false. // // - The simpler definition // // #define GTEST_COMPILE_ASSERT_(expr, msg) typedef char msg[(expr) ? 1 : -1] // // does not work, as gcc supports variable-length arrays whose sizes // are determined at run-time (this is gcc's extension and not part // of the C++ standard). As a result, gcc fails to reject the // following code with the simple definition: // // int foo; // GTEST_COMPILE_ASSERT_(foo, msg); // not supposed to compile as foo is // // not a compile-time constant. // // - By using the type CompileAssert<(bool(expr))>, we ensures that // expr is a compile-time constant. (Template arguments must be // determined at compile-time.) // // - The outter parentheses in CompileAssert<(bool(expr))> are necessary // to work around a bug in gcc 3.4.4 and 4.0.1. If we had written // // CompileAssert // // instead, these compilers will refuse to compile // // GTEST_COMPILE_ASSERT_(5 > 0, some_message); // // (They seem to think the ">" in "5 > 0" marks the end of the // template argument list.) // // - The array size is (bool(expr) ? 1 : -1), instead of simply // // ((expr) ? 1 : -1). // // This is to avoid running into a bug in MS VC 7.1, which // causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1. // StaticAssertTypeEqHelper is used by StaticAssertTypeEq defined in gtest.h. // // This template is declared, but intentionally undefined. template struct StaticAssertTypeEqHelper; template struct StaticAssertTypeEqHelper {}; #if GTEST_HAS_GLOBAL_STRING typedef ::string string; #else typedef ::std::string string; #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING typedef ::wstring wstring; #elif GTEST_HAS_STD_WSTRING typedef ::std::wstring wstring; #endif // GTEST_HAS_GLOBAL_WSTRING // A helper for suppressing warnings on constant condition. It just // returns 'condition'. GTEST_API_ bool IsTrue(bool condition); // Defines scoped_ptr. // This implementation of scoped_ptr is PARTIAL - it only contains // enough stuff to satisfy Google Test's need. template class scoped_ptr { public: typedef T element_type; explicit scoped_ptr(T* p = NULL) : ptr_(p) {} ~scoped_ptr() { reset(); } T& operator*() const { return *ptr_; } T* operator->() const { return ptr_; } T* get() const { return ptr_; } T* release() { T* const ptr = ptr_; ptr_ = NULL; return ptr; } void reset(T* p = NULL) { if (p != ptr_) { if (IsTrue(sizeof(T) > 0)) { // Makes sure T is a complete type. delete ptr_; } ptr_ = p; } } private: T* ptr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(scoped_ptr); }; // Defines RE. // A simple C++ wrapper for . It uses the POSIX Extended // Regular Expression syntax. class GTEST_API_ RE { public: // A copy constructor is required by the Standard to initialize object // references from r-values. RE(const RE& other) { Init(other.pattern()); } // Constructs an RE from a string. RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT #if GTEST_HAS_GLOBAL_STRING RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT #endif // GTEST_HAS_GLOBAL_STRING RE(const char* regex) { Init(regex); } // NOLINT ~RE(); // Returns the string representation of the regex. const char* pattern() const { return pattern_; } // FullMatch(str, re) returns true iff regular expression re matches // the entire str. // PartialMatch(str, re) returns true iff regular expression re // matches a substring of str (including str itself). // // TODO(wan@google.com): make FullMatch() and PartialMatch() work // when str contains NUL characters. static bool FullMatch(const ::std::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::std::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #if GTEST_HAS_GLOBAL_STRING static bool FullMatch(const ::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #endif // GTEST_HAS_GLOBAL_STRING static bool FullMatch(const char* str, const RE& re); static bool PartialMatch(const char* str, const RE& re); private: void Init(const char* regex); // We use a const char* instead of a string, as Google Test may be used // where string is not available. We also do not use Google Test's own // String type here, in order to simplify dependencies between the // files. const char* pattern_; bool is_valid_; #if GTEST_USES_POSIX_RE regex_t full_regex_; // For FullMatch(). regex_t partial_regex_; // For PartialMatch(). #else // GTEST_USES_SIMPLE_RE const char* full_pattern_; // For FullMatch(); #endif GTEST_DISALLOW_ASSIGN_(RE); }; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line); // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. GTEST_API_ ::std::string FormatCompilerIndependentFileLocation(const char* file, int line); // Defines logging utilities: // GTEST_LOG_(severity) - logs messages at the specified severity level. The // message itself is streamed into the macro. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. enum GTestLogSeverity { GTEST_INFO, GTEST_WARNING, GTEST_ERROR, GTEST_FATAL }; // Formats log entry severity, provides a stream object for streaming the // log message, and terminates the message with a newline when going out of // scope. class GTEST_API_ GTestLog { public: GTestLog(GTestLogSeverity severity, const char* file, int line); // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. ~GTestLog(); ::std::ostream& GetStream() { return ::std::cerr; } private: const GTestLogSeverity severity_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestLog); }; #define GTEST_LOG_(severity) \ ::testing::internal::GTestLog(::testing::internal::GTEST_##severity, \ __FILE__, __LINE__).GetStream() inline void LogToStderr() {} inline void FlushInfoLog() { fflush(NULL); } // INTERNAL IMPLEMENTATION - DO NOT USE. // // GTEST_CHECK_ is an all-mode assert. It aborts the program if the condition // is not satisfied. // Synopsys: // GTEST_CHECK_(boolean_condition); // or // GTEST_CHECK_(boolean_condition) << "Additional message"; // // This checks the condition and if the condition is not satisfied // it prints message about the condition violation, including the // condition itself, plus additional message streamed into it, if any, // and then it aborts the program. It aborts the program irrespective of // whether it is built in the debug mode or not. #define GTEST_CHECK_(condition) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::IsTrue(condition)) \ ; \ else \ GTEST_LOG_(FATAL) << "Condition " #condition " failed. " // An all-mode assert to verify that the given POSIX-style function // call returns 0 (indicating success). Known limitation: this // doesn't expand to a balanced 'if' statement, so enclose the macro // in {} if you need to use it as the only statement in an 'if' // branch. #define GTEST_CHECK_POSIX_SUCCESS_(posix_call) \ if (const int gtest_error = (posix_call)) \ GTEST_LOG_(FATAL) << #posix_call << "failed with error " \ << gtest_error // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Use ImplicitCast_ as a safe version of static_cast for upcasting in // the type hierarchy (e.g. casting a Foo* to a SuperclassOfFoo* or a // const Foo*). When you use ImplicitCast_, the compiler checks that // the cast is safe. Such explicit ImplicitCast_s are necessary in // surprisingly many situations where C++ demands an exact type match // instead of an argument type convertable to a target type. // // The syntax for using ImplicitCast_ is the same as for static_cast: // // ImplicitCast_(expr) // // ImplicitCast_ would have been part of the C++ standard library, // but the proposal was submitted too late. It will probably make // its way into the language in the future. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., implicit_cast). The internal // namespace alone is not enough because the function can be found by ADL. template inline To ImplicitCast_(To x) { return x; } // When you upcast (that is, cast a pointer from type Foo to type // SuperclassOfFoo), it's fine to use ImplicitCast_<>, since upcasts // always succeed. When you downcast (that is, cast a pointer from // type Foo to type SubclassOfFoo), static_cast<> isn't safe, because // how do you know the pointer is really of type SubclassOfFoo? It // could be a bare Foo, or of type DifferentSubclassOfFoo. Thus, // when you downcast, you should use this macro. In debug mode, we // use dynamic_cast<> to double-check the downcast is legal (we die // if it's not). In normal mode, we do the efficient static_cast<> // instead. Thus, it's important to test in debug mode to make sure // the cast is legal! // This is the only place in the code we should use dynamic_cast<>. // In particular, you SHOULDN'T be using dynamic_cast<> in order to // do RTTI (eg code like this: // if (dynamic_cast(foo)) HandleASubclass1Object(foo); // if (dynamic_cast(foo)) HandleASubclass2Object(foo); // You should design the code some other way not to need this. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., down_cast). The internal // namespace alone is not enough because the function can be found by ADL. template // use like this: DownCast_(foo); inline To DownCast_(From* f) { // so we only accept pointers // Ensures that To is a sub-type of From *. This test is here only // for compile-time type checking, and has no overhead in an // optimized build at run-time, as it will be optimized away // completely. if (false) { const To to = NULL; ::testing::internal::ImplicitCast_(to); } #if GTEST_HAS_RTTI // RTTI: debug mode only! GTEST_CHECK_(f == NULL || dynamic_cast(f) != NULL); #endif return static_cast(f); } // Downcasts the pointer of type Base to Derived. // Derived must be a subclass of Base. The parameter MUST // point to a class of type Derived, not any subclass of it. // When RTTI is available, the function performs a runtime // check to enforce this. template Derived* CheckedDowncastToActualType(Base* base) { #if GTEST_HAS_RTTI GTEST_CHECK_(typeid(*base) == typeid(Derived)); return dynamic_cast(base); // NOLINT #else return static_cast(base); // Poor man's downcast. #endif } #if GTEST_HAS_STREAM_REDIRECTION // Defines the stderr capturer: // CaptureStdout - starts capturing stdout. // GetCapturedStdout - stops capturing stdout and returns the captured string. // CaptureStderr - starts capturing stderr. // GetCapturedStderr - stops capturing stderr and returns the captured string. // GTEST_API_ void CaptureStdout(); GTEST_API_ String GetCapturedStdout(); GTEST_API_ void CaptureStderr(); GTEST_API_ String GetCapturedStderr(); #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). extern ::std::vector g_argvs; // GTEST_HAS_DEATH_TEST implies we have ::std::string. const ::std::vector& GetArgvs(); #endif // GTEST_HAS_DEATH_TEST // Defines synchronization primitives. #if GTEST_HAS_PTHREAD // Sleeps for (roughly) n milli-seconds. This function is only for // testing Google Test's own constructs. Don't use it in user tests, // either directly or indirectly. inline void SleepMilliseconds(int n) { const timespec time = { 0, // 0 seconds. n * 1000L * 1000L, // And n ms. }; nanosleep(&time, NULL); } // Allows a controller thread to pause execution of newly created // threads until notified. Instances of this class must be created // and destroyed in the controller thread. // // This class is only for testing Google Test's own constructs. Do not // use it in user tests, either directly or indirectly. class Notification { public: Notification() : notified_(false) {} // Notifies all threads created with this notification to start. Must // be called from the controller thread. void Notify() { notified_ = true; } // Blocks until the controller thread notifies. Must be called from a test // thread. void WaitForNotification() { while(!notified_) { SleepMilliseconds(10); } } private: volatile bool notified_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Notification); }; // As a C-function, ThreadFuncWithCLinkage cannot be templated itself. // Consequently, it cannot select a correct instantiation of ThreadWithParam // in order to call its Run(). Introducing ThreadWithParamBase as a // non-templated base class for ThreadWithParam allows us to bypass this // problem. class ThreadWithParamBase { public: virtual ~ThreadWithParamBase() {} virtual void Run() = 0; }; // pthread_create() accepts a pointer to a function type with the C linkage. // According to the Standard (7.5/1), function types with different linkages // are different even if they are otherwise identical. Some compilers (for // example, SunStudio) treat them as different types. Since class methods // cannot be defined with C-linkage we need to define a free C-function to // pass into pthread_create(). extern "C" inline void* ThreadFuncWithCLinkage(void* thread) { static_cast(thread)->Run(); return NULL; } // Helper class for testing Google Test's multi-threading constructs. // To use it, write: // // void ThreadFunc(int param) { /* Do things with param */ } // Notification thread_can_start; // ... // // The thread_can_start parameter is optional; you can supply NULL. // ThreadWithParam thread(&ThreadFunc, 5, &thread_can_start); // thread_can_start.Notify(); // // These classes are only for testing Google Test's own constructs. Do // not use them in user tests, either directly or indirectly. template class ThreadWithParam : public ThreadWithParamBase { public: typedef void (*UserThreadFunc)(T); ThreadWithParam( UserThreadFunc func, T param, Notification* thread_can_start) : func_(func), param_(param), thread_can_start_(thread_can_start), finished_(false) { ThreadWithParamBase* const base = this; // The thread can be created only after all fields except thread_ // have been initialized. GTEST_CHECK_POSIX_SUCCESS_( pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base)); } ~ThreadWithParam() { Join(); } void Join() { if (!finished_) { GTEST_CHECK_POSIX_SUCCESS_(pthread_join(thread_, 0)); finished_ = true; } } virtual void Run() { if (thread_can_start_ != NULL) thread_can_start_->WaitForNotification(); func_(param_); } private: const UserThreadFunc func_; // User-supplied thread function. const T param_; // User-supplied parameter to the thread function. // When non-NULL, used to block execution until the controller thread // notifies. Notification* const thread_can_start_; bool finished_; // true iff we know that the thread function has finished. pthread_t thread_; // The native thread object. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam); }; // MutexBase and Mutex implement mutex on pthreads-based platforms. They // are used in conjunction with class MutexLock: // // Mutex mutex; // ... // MutexLock lock(&mutex); // Acquires the mutex and releases it at the end // // of the current scope. // // MutexBase implements behavior for both statically and dynamically // allocated mutexes. Do not use MutexBase directly. Instead, write // the following to define a static mutex: // // GTEST_DEFINE_STATIC_MUTEX_(g_some_mutex); // // You can forward declare a static mutex like this: // // GTEST_DECLARE_STATIC_MUTEX_(g_some_mutex); // // To create a dynamic mutex, just define an object of type Mutex. class MutexBase { public: // Acquires this mutex. void Lock() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&mutex_)); owner_ = pthread_self(); } // Releases this mutex. void Unlock() { // We don't protect writing to owner_ here, as it's the caller's // responsibility to ensure that the current thread holds the // mutex when this is called. owner_ = 0; GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&mutex_)); } // Does nothing if the current thread holds the mutex. Otherwise, crashes // with high probability. void AssertHeld() const { GTEST_CHECK_(owner_ == pthread_self()) << "The current thread is not holding the mutex @" << this; } // A static mutex may be used before main() is entered. It may even // be used before the dynamic initialization stage. Therefore we // must be able to initialize a static mutex object at link time. // This means MutexBase has to be a POD and its member variables // have to be public. public: pthread_mutex_t mutex_; // The underlying pthread mutex. pthread_t owner_; // The thread holding the mutex; 0 means no one holds it. }; // Forward-declares a static mutex. # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::MutexBase mutex // Defines and statically (i.e. at link time) initializes a static mutex. # define GTEST_DEFINE_STATIC_MUTEX_(mutex) \ ::testing::internal::MutexBase mutex = { PTHREAD_MUTEX_INITIALIZER, 0 } // The Mutex class can only be used for mutexes created at runtime. It // shares its API with MutexBase otherwise. class Mutex : public MutexBase { public: Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL)); owner_ = 0; } ~Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex); }; // We cannot name this class MutexLock as the ctor declaration would // conflict with a macro named MutexLock, which is defined on some // platforms. Hence the typedef trick below. class GTestMutexLock { public: explicit GTestMutexLock(MutexBase* mutex) : mutex_(mutex) { mutex_->Lock(); } ~GTestMutexLock() { mutex_->Unlock(); } private: MutexBase* const mutex_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestMutexLock); }; typedef GTestMutexLock MutexLock; // Helpers for ThreadLocal. // pthread_key_create() requires DeleteThreadLocalValue() to have // C-linkage. Therefore it cannot be templatized to access // ThreadLocal. Hence the need for class // ThreadLocalValueHolderBase. class ThreadLocalValueHolderBase { public: virtual ~ThreadLocalValueHolderBase() {} }; // Called by pthread to delete thread-local data stored by // pthread_setspecific(). extern "C" inline void DeleteThreadLocalValue(void* value_holder) { delete static_cast(value_holder); } // Implements thread-local storage on pthreads-based systems. // // // Thread 1 // ThreadLocal tl(100); // 100 is the default value for each thread. // // // Thread 2 // tl.set(150); // Changes the value for thread 2 only. // EXPECT_EQ(150, tl.get()); // // // Thread 1 // EXPECT_EQ(100, tl.get()); // In thread 1, tl has the original value. // tl.set(200); // EXPECT_EQ(200, tl.get()); // // The template type argument T must have a public copy constructor. // In addition, the default ThreadLocal constructor requires T to have // a public default constructor. // // An object managed for a thread by a ThreadLocal instance is deleted // when the thread exits. Or, if the ThreadLocal instance dies in // that thread, when the ThreadLocal dies. It's the user's // responsibility to ensure that all other threads using a ThreadLocal // have exited when it dies, or the per-thread objects for those // threads will not be deleted. // // Google Test only uses global ThreadLocal objects. That means they // will die after main() has returned. Therefore, no per-thread // object managed by Google Test will be leaked as long as all threads // using Google Test have exited when main() returns. template class ThreadLocal { public: ThreadLocal() : key_(CreateKey()), default_() {} explicit ThreadLocal(const T& value) : key_(CreateKey()), default_(value) {} ~ThreadLocal() { // Destroys the managed object for the current thread, if any. DeleteThreadLocalValue(pthread_getspecific(key_)); // Releases resources associated with the key. This will *not* // delete managed objects for other threads. GTEST_CHECK_POSIX_SUCCESS_(pthread_key_delete(key_)); } T* pointer() { return GetOrCreateValue(); } const T* pointer() const { return GetOrCreateValue(); } const T& get() const { return *pointer(); } void set(const T& value) { *pointer() = value; } private: // Holds a value of type T. class ValueHolder : public ThreadLocalValueHolderBase { public: explicit ValueHolder(const T& value) : value_(value) {} T* pointer() { return &value_; } private: T value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder); }; static pthread_key_t CreateKey() { pthread_key_t key; // When a thread exits, DeleteThreadLocalValue() will be called on // the object managed for that thread. GTEST_CHECK_POSIX_SUCCESS_( pthread_key_create(&key, &DeleteThreadLocalValue)); return key; } T* GetOrCreateValue() const { ThreadLocalValueHolderBase* const holder = static_cast(pthread_getspecific(key_)); if (holder != NULL) { return CheckedDowncastToActualType(holder)->pointer(); } ValueHolder* const new_holder = new ValueHolder(default_); ThreadLocalValueHolderBase* const holder_base = new_holder; GTEST_CHECK_POSIX_SUCCESS_(pthread_setspecific(key_, holder_base)); return new_holder->pointer(); } // A key pthreads uses for looking up per-thread values. const pthread_key_t key_; const T default_; // The default value for each thread. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadLocal); }; # define GTEST_IS_THREADSAFE 1 #else // GTEST_HAS_PTHREAD // A dummy implementation of synchronization primitives (mutex, lock, // and thread-local variable). Necessary for compiling Google Test where // mutex is not supported - using Google Test in multiple threads is not // supported on such platforms. class Mutex { public: Mutex() {} void AssertHeld() const {} }; # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::Mutex mutex # define GTEST_DEFINE_STATIC_MUTEX_(mutex) ::testing::internal::Mutex mutex class GTestMutexLock { public: explicit GTestMutexLock(Mutex*) {} // NOLINT }; typedef GTestMutexLock MutexLock; template class ThreadLocal { public: ThreadLocal() : value_() {} explicit ThreadLocal(const T& value) : value_(value) {} T* pointer() { return &value_; } const T* pointer() const { return &value_; } const T& get() const { return value_; } void set(const T& value) { value_ = value; } private: T value_; }; // The above synchronization primitives have dummy implementations. // Therefore Google Test is not thread-safe. # define GTEST_IS_THREADSAFE 0 #endif // GTEST_HAS_PTHREAD // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. GTEST_API_ size_t GetThreadCount(); // Passing non-POD classes through ellipsis (...) crashes the ARM // compiler and generates a warning in Sun Studio. The Nokia Symbian // and the IBM XL C/C++ compiler try to instantiate a copy constructor // for objects passed through ellipsis (...), failing for uncopyable // objects. We define this to ensure that only POD is passed through // ellipsis on these systems. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) || defined(__SUNPRO_CC) // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_ELLIPSIS_NEEDS_POD_ 1 #else # define GTEST_CAN_COMPARE_NULL 1 #endif // The Nokia Symbian and IBM XL C/C++ compilers cannot decide between // const T& and const T* in a function template. These compilers // _can_ decide between class template specializations for T and T*, // so a tr1::type_traits-like is_pointer works. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) # define GTEST_NEEDS_IS_POINTER_ 1 #endif template struct bool_constant { typedef bool_constant type; static const bool value = bool_value; }; template const bool bool_constant::value; typedef bool_constant false_type; typedef bool_constant true_type; template struct is_pointer : public false_type {}; template struct is_pointer : public true_type {}; template struct IteratorTraits { typedef typename Iterator::value_type value_type; }; template struct IteratorTraits { typedef T value_type; }; template struct IteratorTraits { typedef T value_type; }; #if GTEST_OS_WINDOWS # define GTEST_PATH_SEP_ "\\" # define GTEST_HAS_ALT_PATH_SEP_ 1 // The biggest signed integer type the compiler supports. typedef __int64 BiggestInt; #else # define GTEST_PATH_SEP_ "/" # define GTEST_HAS_ALT_PATH_SEP_ 0 typedef long long BiggestInt; // NOLINT #endif // GTEST_OS_WINDOWS // Utilities for char. // isspace(int ch) and friends accept an unsigned char or EOF. char // may be signed, depending on the compiler (or compiler flags). // Therefore we need to cast a char to unsigned char before calling // isspace(), etc. inline bool IsAlpha(char ch) { return isalpha(static_cast(ch)) != 0; } inline bool IsAlNum(char ch) { return isalnum(static_cast(ch)) != 0; } inline bool IsDigit(char ch) { return isdigit(static_cast(ch)) != 0; } inline bool IsLower(char ch) { return islower(static_cast(ch)) != 0; } inline bool IsSpace(char ch) { return isspace(static_cast(ch)) != 0; } inline bool IsUpper(char ch) { return isupper(static_cast(ch)) != 0; } inline bool IsXDigit(char ch) { return isxdigit(static_cast(ch)) != 0; } inline char ToLower(char ch) { return static_cast(tolower(static_cast(ch))); } inline char ToUpper(char ch) { return static_cast(toupper(static_cast(ch))); } // The testing::internal::posix namespace holds wrappers for common // POSIX functions. These wrappers hide the differences between // Windows/MSVC and POSIX systems. Since some compilers define these // standard functions as macros, the wrapper cannot have the same name // as the wrapped function. namespace posix { // Functions with a different name on Windows. #if GTEST_OS_WINDOWS typedef struct _stat StatStruct; # ifdef __BORLANDC__ inline int IsATTY(int fd) { return isatty(fd); } inline int StrCaseCmp(const char* s1, const char* s2) { return stricmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } # else // !__BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int IsATTY(int /* fd */) { return 0; } # else inline int IsATTY(int fd) { return _isatty(fd); } # endif // GTEST_OS_WINDOWS_MOBILE inline int StrCaseCmp(const char* s1, const char* s2) { return _stricmp(s1, s2); } inline char* StrDup(const char* src) { return _strdup(src); } # endif // __BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int FileNo(FILE* file) { return reinterpret_cast(_fileno(file)); } // Stat(), RmDir(), and IsDir() are not needed on Windows CE at this // time and thus not defined there. # else inline int FileNo(FILE* file) { return _fileno(file); } inline int Stat(const char* path, StatStruct* buf) { return _stat(path, buf); } inline int RmDir(const char* dir) { return _rmdir(dir); } inline bool IsDir(const StatStruct& st) { return (_S_IFDIR & st.st_mode) != 0; } # endif // GTEST_OS_WINDOWS_MOBILE #else typedef struct stat StatStruct; inline int FileNo(FILE* file) { return fileno(file); } inline int IsATTY(int fd) { return isatty(fd); } inline int Stat(const char* path, StatStruct* buf) { return stat(path, buf); } inline int StrCaseCmp(const char* s1, const char* s2) { return strcasecmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } inline int RmDir(const char* dir) { return rmdir(dir); } inline bool IsDir(const StatStruct& st) { return S_ISDIR(st.st_mode); } #endif // GTEST_OS_WINDOWS // Functions deprecated by MSVC 8.0. #ifdef _MSC_VER // Temporarily disable warning 4996 (deprecated function). # pragma warning(push) # pragma warning(disable:4996) #endif inline const char* StrNCpy(char* dest, const char* src, size_t n) { return strncpy(dest, src, n); } // ChDir(), FReopen(), FDOpen(), Read(), Write(), Close(), and // StrError() aren't needed on Windows CE at this time and thus not // defined there. #if !GTEST_OS_WINDOWS_MOBILE inline int ChDir(const char* dir) { return chdir(dir); } #endif inline FILE* FOpen(const char* path, const char* mode) { return fopen(path, mode); } #if !GTEST_OS_WINDOWS_MOBILE inline FILE *FReopen(const char* path, const char* mode, FILE* stream) { return freopen(path, mode, stream); } inline FILE* FDOpen(int fd, const char* mode) { return fdopen(fd, mode); } #endif inline int FClose(FILE* fp) { return fclose(fp); } #if !GTEST_OS_WINDOWS_MOBILE inline int Read(int fd, void* buf, unsigned int count) { return static_cast(read(fd, buf, count)); } inline int Write(int fd, const void* buf, unsigned int count) { return static_cast(write(fd, buf, count)); } inline int Close(int fd) { return close(fd); } inline const char* StrError(int errnum) { return strerror(errnum); } #endif inline const char* GetEnv(const char* name) { #if GTEST_OS_WINDOWS_MOBILE // We are on Windows CE, which has no environment variables. return NULL; #elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) // Environment variables which we programmatically clear will be set to the // empty string rather than unset (NULL). Handle that case. const char* const env = getenv(name); return (env != NULL && env[0] != '\0') ? env : NULL; #else return getenv(name); #endif } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif #if GTEST_OS_WINDOWS_MOBILE // Windows CE has no C library. The abort() function is used in // several places in Google Test. This implementation provides a reasonable // imitation of standard behaviour. void Abort(); #else inline void Abort() { abort(); } #endif // GTEST_OS_WINDOWS_MOBILE } // namespace posix // The maximum number a BiggestInt can represent. This definition // works no matter BiggestInt is represented in one's complement or // two's complement. // // We cannot rely on numeric_limits in STL, as __int64 and long long // are not part of standard C++ and numeric_limits doesn't need to be // defined for them. const BiggestInt kMaxBiggestInt = ~(static_cast(1) << (8*sizeof(BiggestInt) - 1)); // This template class serves as a compile-time function from size to // type. It maps a size in bytes to a primitive type with that // size. e.g. // // TypeWithSize<4>::UInt // // is typedef-ed to be unsigned int (unsigned integer made up of 4 // bytes). // // Such functionality should belong to STL, but I cannot find it // there. // // Google Test uses this class in the implementation of floating-point // comparison. // // For now it only handles UInt (unsigned int) as that's all Google Test // needs. Other types can be easily added in the future if need // arises. template class TypeWithSize { public: // This prevents the user from using TypeWithSize with incorrect // values of N. typedef void UInt; }; // The specialization for size 4. template <> class TypeWithSize<4> { public: // unsigned int has size 4 in both gcc and MSVC. // // As base/basictypes.h doesn't compile on Windows, we cannot use // uint32, uint64, and etc here. typedef int Int; typedef unsigned int UInt; }; // The specialization for size 8. template <> class TypeWithSize<8> { public: #if GTEST_OS_WINDOWS typedef __int64 Int; typedef unsigned __int64 UInt; #else typedef long long Int; // NOLINT typedef unsigned long long UInt; // NOLINT #endif // GTEST_OS_WINDOWS }; // Integer types of known sizes. typedef TypeWithSize<4>::Int Int32; typedef TypeWithSize<4>::UInt UInt32; typedef TypeWithSize<8>::Int Int64; typedef TypeWithSize<8>::UInt UInt64; typedef TypeWithSize<8>::Int TimeInMillis; // Represents time in milliseconds. // Utilities for command line flags and environment variables. // Macro for referencing flags. #define GTEST_FLAG(name) FLAGS_gtest_##name // Macros for declaring flags. #define GTEST_DECLARE_bool_(name) GTEST_API_ extern bool GTEST_FLAG(name) #define GTEST_DECLARE_int32_(name) \ GTEST_API_ extern ::testing::internal::Int32 GTEST_FLAG(name) #define GTEST_DECLARE_string_(name) \ GTEST_API_ extern ::testing::internal::String GTEST_FLAG(name) // Macros for defining flags. #define GTEST_DEFINE_bool_(name, default_val, doc) \ GTEST_API_ bool GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_int32_(name, default_val, doc) \ GTEST_API_ ::testing::internal::Int32 GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_string_(name, default_val, doc) \ GTEST_API_ ::testing::internal::String GTEST_FLAG(name) = (default_val) // Parses 'str' for a 32-bit signed integer. If successful, writes the result // to *value and returns true; otherwise leaves *value unchanged and returns // false. // TODO(chandlerc): Find a better way to refactor flag and environment parsing // out of both gtest-port.cc and gtest.cc to avoid exporting this utility // function. bool ParseInt32(const Message& src_text, const char* str, Int32* value); // Parses a bool/Int32/string from the environment variable // corresponding to the given Google Test flag. bool BoolFromGTestEnv(const char* flag, bool default_val); GTEST_API_ Int32 Int32FromGTestEnv(const char* flag, Int32 default_val); const char* StringFromGTestEnv(const char* flag, const char* default_val); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-string.h0000600000175000017500000003243311561126632026635 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares the String class and functions used internally by // Google Test. They are subject to change without notice. They should not used // by code external to Google Test. // // This header file is #included by . // It should not be #included by other files. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #ifdef __BORLANDC__ // string.h is not guaranteed to provide strcpy on C++ Builder. # include #endif #include #include "gtest/internal/gtest-port.h" #include namespace testing { namespace internal { // String - a UTF-8 string class. // // For historic reasons, we don't use std::string. // // TODO(wan@google.com): replace this class with std::string or // implement it in terms of the latter. // // Note that String can represent both NULL and the empty string, // while std::string cannot represent NULL. // // NULL and the empty string are considered different. NULL is less // than anything (including the empty string) except itself. // // This class only provides minimum functionality necessary for // implementing Google Test. We do not intend to implement a full-fledged // string class here. // // Since the purpose of this class is to provide a substitute for // std::string on platforms where it cannot be used, we define a copy // constructor and assignment operators such that we don't need // conditional compilation in a lot of places. // // In order to make the representation efficient, the d'tor of String // is not virtual. Therefore DO NOT INHERIT FROM String. class GTEST_API_ String { public: // Static utility methods // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. static String ShowCStringQuoted(const char* c_str); // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting the return value using // delete[]. Returns the cloned string, or NULL if the input is // NULL. // // This is different from strdup() in string.h, which allocates // memory using malloc(). static const char* CloneCString(const char* c_str); #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not have the 'ANSI' versions of Win32 APIs. To be // able to pass strings to Win32 APIs on CE we need to convert them // to 'Unicode', UTF-16. // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. // // The wide string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static LPCWSTR AnsiToUtf16(const char* c_str); // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. // // The returned string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static const char* Utf16ToAnsi(LPCWSTR utf16_str); #endif // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CStringEquals(const char* lhs, const char* rhs); // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". If an error occurred during // the conversion, "(failed to convert from wide string)" is // returned. static String ShowWideCString(const wchar_t* wide_c_str); // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. static String ShowWideCStringQuoted(const wchar_t* wide_c_str); // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Compares two C strings, ignoring case. Returns true iff they // have the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs); // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. static bool CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing // 0). If 4096 characters are not enough to format the input, // "" is returned. static String Format(const char* format, ...); // C'tors // The default c'tor constructs a NULL string. String() : c_str_(NULL), length_(0) {} // Constructs a String by cloning a 0-terminated C string. String(const char* a_c_str) { // NOLINT if (a_c_str == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(a_c_str, strlen(a_c_str)); } } // Constructs a String by copying a given number of chars from a // buffer. E.g. String("hello", 3) creates the string "hel", // String("a\0bcd", 4) creates "a\0bc", String(NULL, 0) creates "", // and String(NULL, 1) results in access violation. String(const char* buffer, size_t a_length) { ConstructNonNull(buffer, a_length); } // The copy c'tor creates a new copy of the string. The two // String objects do not share content. String(const String& str) : c_str_(NULL), length_(0) { *this = str; } // D'tor. String is intended to be a final class, so the d'tor // doesn't need to be virtual. ~String() { delete[] c_str_; } // Allows a String to be implicitly converted to an ::std::string or // ::string, and vice versa. Converting a String containing a NULL // pointer to ::std::string or ::string is undefined behavior. // Converting a ::std::string or ::string containing an embedded NUL // character to a String will result in the prefix up to the first // NUL character. String(const ::std::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::std::string() const { return ::std::string(c_str(), length()); } #if GTEST_HAS_GLOBAL_STRING String(const ::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::string() const { return ::string(c_str(), length()); } #endif // GTEST_HAS_GLOBAL_STRING // Returns true iff this is an empty string (i.e. ""). bool empty() const { return (c_str() != NULL) && (length() == 0); } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int Compare(const String& rhs) const; // Returns true iff this String equals the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator==(const char* a_c_str) const { return Compare(a_c_str) == 0; } // Returns true iff this String is less than the given String. A // NULL string is considered less than "". bool operator<(const String& rhs) const { return Compare(rhs) < 0; } // Returns true iff this String doesn't equal the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator!=(const char* a_c_str) const { return !(*this == a_c_str); } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool EndsWith(const char* suffix) const; // Returns true iff this String ends with the given suffix, not considering // case. Any String is considered to end with a NULL or empty suffix. bool EndsWithCaseInsensitive(const char* suffix) const; // Returns the length of the encapsulated string, or 0 if the // string is NULL. size_t length() const { return length_; } // Gets the 0-terminated C string this String object represents. // The String object still owns the string. Therefore the caller // should NOT delete the return value. const char* c_str() const { return c_str_; } // Assigns a C string to this object. Self-assignment works. const String& operator=(const char* a_c_str) { return *this = String(a_c_str); } // Assigns a String object to this object. Self-assignment works. const String& operator=(const String& rhs) { if (this != &rhs) { delete[] c_str_; if (rhs.c_str() == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(rhs.c_str(), rhs.length()); } } return *this; } private: // Constructs a non-NULL String from the given content. This // function can only be called when c_str_ has not been allocated. // ConstructNonNull(NULL, 0) results in an empty string (""). // ConstructNonNull(NULL, non_zero) is undefined behavior. void ConstructNonNull(const char* buffer, size_t a_length) { char* const str = new char[a_length + 1]; memcpy(str, buffer, a_length); str[a_length] = '\0'; c_str_ = str; length_ = a_length; } const char* c_str_; size_t length_; }; // class String // Streams a String to an ostream. Each '\0' character in the String // is replaced with "\\0". inline ::std::ostream& operator<<(::std::ostream& os, const String& str) { if (str.c_str() == NULL) { os << "(null)"; } else { const char* const c_str = str.c_str(); for (size_t i = 0; i != str.length(); i++) { if (c_str[i] == '\0') { os << "\\0"; } else { os << c_str[i]; } } } return os; } // Gets the content of the stringstream's buffer as a String. Each '\0' // character in the buffer is replaced with "\\0". GTEST_API_ String StringStreamToString(::std::stringstream* stream); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-tuple.h0000600000175000017500000006673311561126632026472 0ustar synergysynergy// This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2009 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements a subset of TR1 tuple needed by Google Test and Google Mock. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #include // For ::std::pair. // The compiler used in Symbian has a bug that prevents us from declaring the // tuple template as a friend (it complains that tuple is redefined). This // hack bypasses the bug by declaring the members that should otherwise be // private as public. // Sun Studio versions < 12 also have the above bug. #if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) # define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: #else # define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ template friend class tuple; \ private: #endif // GTEST_n_TUPLE_(T) is the type of an n-tuple. #define GTEST_0_TUPLE_(T) tuple<> #define GTEST_1_TUPLE_(T) tuple #define GTEST_2_TUPLE_(T) tuple #define GTEST_3_TUPLE_(T) tuple #define GTEST_4_TUPLE_(T) tuple #define GTEST_5_TUPLE_(T) tuple #define GTEST_6_TUPLE_(T) tuple #define GTEST_7_TUPLE_(T) tuple #define GTEST_8_TUPLE_(T) tuple #define GTEST_9_TUPLE_(T) tuple #define GTEST_10_TUPLE_(T) tuple // GTEST_n_TYPENAMES_(T) declares a list of n typenames. #define GTEST_0_TYPENAMES_(T) #define GTEST_1_TYPENAMES_(T) typename T##0 #define GTEST_2_TYPENAMES_(T) typename T##0, typename T##1 #define GTEST_3_TYPENAMES_(T) typename T##0, typename T##1, typename T##2 #define GTEST_4_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3 #define GTEST_5_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4 #define GTEST_6_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5 #define GTEST_7_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6 #define GTEST_8_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, typename T##7 #define GTEST_9_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8 #define GTEST_10_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8, typename T##9 // In theory, defining stuff in the ::std namespace is undefined // behavior. We can do this as we are playing the role of a standard // library vendor. namespace std { namespace tr1 { template class tuple; // Anything in namespace gtest_internal is Google Test's INTERNAL // IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. namespace gtest_internal { // ByRef::type is T if T is a reference; otherwise it's const T&. template struct ByRef { typedef const T& type; }; // NOLINT template struct ByRef { typedef T& type; }; // NOLINT // A handy wrapper for ByRef. #define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type // AddRef::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference::type. template struct AddRef { typedef T& type; }; // NOLINT template struct AddRef { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type // A helper for implementing get(). template class Get; // A helper for implementing tuple_element. kIndexValid is true // iff k < the number of fields in tuple type T. template struct TupleElement; template struct TupleElement { typedef T0 type; }; template struct TupleElement { typedef T1 type; }; template struct TupleElement { typedef T2 type; }; template struct TupleElement { typedef T3 type; }; template struct TupleElement { typedef T4 type; }; template struct TupleElement { typedef T5 type; }; template struct TupleElement { typedef T6 type; }; template struct TupleElement { typedef T7 type; }; template struct TupleElement { typedef T8 type; }; template struct TupleElement { typedef T9 type; }; } // namespace gtest_internal template <> class tuple<> { public: tuple() {} tuple(const tuple& /* t */) {} tuple& operator=(const tuple& /* t */) { return *this; } }; template class GTEST_1_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_() {} explicit tuple(GTEST_BY_REF_(T0) f0) : f0_(f0) {} tuple(const tuple& t) : f0_(t.f0_) {} template tuple(const GTEST_1_TUPLE_(U)& t) : f0_(t.f0_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_1_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_1_TUPLE_(U)& t) { f0_ = t.f0_; return *this; } T0 f0_; }; template class GTEST_2_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1) : f0_(f0), f1_(f1) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const GTEST_2_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_2_TUPLE_(U)& t) { return CopyFrom(t); } template tuple& operator=(const ::std::pair& p) { f0_ = p.first; f1_ = p.second; return *this; } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_2_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; return *this; } T0 f0_; T1 f1_; }; template class GTEST_3_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2) : f0_(f0), f1_(f1), f2_(f2) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} template tuple(const GTEST_3_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_3_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_3_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; return *this; } T0 f0_; T1 f1_; T2 f2_; }; template class GTEST_4_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3) : f0_(f0), f1_(f1), f2_(f2), f3_(f3) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} template tuple(const GTEST_4_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_4_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_4_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; }; template class GTEST_5_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} template tuple(const GTEST_5_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_5_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_5_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; }; template class GTEST_6_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} template tuple(const GTEST_6_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_6_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_6_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; }; template class GTEST_7_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} template tuple(const GTEST_7_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_7_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_7_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; }; template class GTEST_8_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} template tuple(const GTEST_8_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_8_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_8_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; }; template class GTEST_9_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} template tuple(const GTEST_9_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_9_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_9_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; }; template class tuple { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), f9_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8, GTEST_BY_REF_(T9) f9) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8), f9_(f9) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} template tuple(const GTEST_10_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_10_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_10_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; f9_ = t.f9_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; T9 f9_; }; // 6.1.3.2 Tuple creation functions. // Known limitations: we don't support passing an // std::tr1::reference_wrapper to make_tuple(). And we don't // implement tie(). inline tuple<> make_tuple() { return tuple<>(); } template inline GTEST_1_TUPLE_(T) make_tuple(const T0& f0) { return GTEST_1_TUPLE_(T)(f0); } template inline GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) { return GTEST_2_TUPLE_(T)(f0, f1); } template inline GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) { return GTEST_3_TUPLE_(T)(f0, f1, f2); } template inline GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3) { return GTEST_4_TUPLE_(T)(f0, f1, f2, f3); } template inline GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4) { return GTEST_5_TUPLE_(T)(f0, f1, f2, f3, f4); } template inline GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5) { return GTEST_6_TUPLE_(T)(f0, f1, f2, f3, f4, f5); } template inline GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6) { return GTEST_7_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6); } template inline GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7) { return GTEST_8_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7); } template inline GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8) { return GTEST_9_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8); } template inline GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8, const T9& f9) { return GTEST_10_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9); } // 6.1.3.3 Tuple helper classes. template struct tuple_size; template struct tuple_size { static const int value = 0; }; template struct tuple_size { static const int value = 1; }; template struct tuple_size { static const int value = 2; }; template struct tuple_size { static const int value = 3; }; template struct tuple_size { static const int value = 4; }; template struct tuple_size { static const int value = 5; }; template struct tuple_size { static const int value = 6; }; template struct tuple_size { static const int value = 7; }; template struct tuple_size { static const int value = 8; }; template struct tuple_size { static const int value = 9; }; template struct tuple_size { static const int value = 10; }; template struct tuple_element { typedef typename gtest_internal::TupleElement< k < (tuple_size::value), k, Tuple>::type type; }; #define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type // 6.1.3.4 Element access. namespace gtest_internal { template <> class Get<0> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) Field(Tuple& t) { return t.f0_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) ConstField(const Tuple& t) { return t.f0_; } }; template <> class Get<1> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) Field(Tuple& t) { return t.f1_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) ConstField(const Tuple& t) { return t.f1_; } }; template <> class Get<2> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) Field(Tuple& t) { return t.f2_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) ConstField(const Tuple& t) { return t.f2_; } }; template <> class Get<3> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) Field(Tuple& t) { return t.f3_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) ConstField(const Tuple& t) { return t.f3_; } }; template <> class Get<4> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) Field(Tuple& t) { return t.f4_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) ConstField(const Tuple& t) { return t.f4_; } }; template <> class Get<5> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) Field(Tuple& t) { return t.f5_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) ConstField(const Tuple& t) { return t.f5_; } }; template <> class Get<6> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) Field(Tuple& t) { return t.f6_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) ConstField(const Tuple& t) { return t.f6_; } }; template <> class Get<7> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) Field(Tuple& t) { return t.f7_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) ConstField(const Tuple& t) { return t.f7_; } }; template <> class Get<8> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) Field(Tuple& t) { return t.f8_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) ConstField(const Tuple& t) { return t.f8_; } }; template <> class Get<9> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) Field(Tuple& t) { return t.f9_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) ConstField(const Tuple& t) { return t.f9_; } }; } // namespace gtest_internal template GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::Field(t); } template GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(const GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::ConstField(t); } // 6.1.3.5 Relational operators // We only implement == and !=, as we don't have a need for the rest yet. namespace gtest_internal { // SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the // first k fields of t1 equals the first k fields of t2. // SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if // k1 != k2. template struct SameSizeTuplePrefixComparator; template <> struct SameSizeTuplePrefixComparator<0, 0> { template static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { return true; } }; template struct SameSizeTuplePrefixComparator { template static bool Eq(const Tuple1& t1, const Tuple2& t2) { return SameSizeTuplePrefixComparator::Eq(t1, t2) && ::std::tr1::get(t1) == ::std::tr1::get(t2); } }; } // namespace gtest_internal template inline bool operator==(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return gtest_internal::SameSizeTuplePrefixComparator< tuple_size::value, tuple_size::value>::Eq(t, u); } template inline bool operator!=(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return !(t == u); } // 6.1.4 Pairs. // Unimplemented. } // namespace tr1 } // namespace std #undef GTEST_0_TUPLE_ #undef GTEST_1_TUPLE_ #undef GTEST_2_TUPLE_ #undef GTEST_3_TUPLE_ #undef GTEST_4_TUPLE_ #undef GTEST_5_TUPLE_ #undef GTEST_6_TUPLE_ #undef GTEST_7_TUPLE_ #undef GTEST_8_TUPLE_ #undef GTEST_9_TUPLE_ #undef GTEST_10_TUPLE_ #undef GTEST_0_TYPENAMES_ #undef GTEST_1_TYPENAMES_ #undef GTEST_2_TYPENAMES_ #undef GTEST_3_TYPENAMES_ #undef GTEST_4_TYPENAMES_ #undef GTEST_5_TYPENAMES_ #undef GTEST_6_TYPENAMES_ #undef GTEST_7_TYPENAMES_ #undef GTEST_8_TYPENAMES_ #undef GTEST_9_TYPENAMES_ #undef GTEST_10_TYPENAMES_ #undef GTEST_DECLARE_TUPLE_AS_FRIEND_ #undef GTEST_BY_REF_ #undef GTEST_ADD_REF_ #undef GTEST_TUPLE_ELEMENT_ #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-tuple.h.pump0000600000175000017500000002200711561126632027434 0ustar synergysynergy$$ -*- mode: c++; -*- $var n = 10 $$ Maximum number of tuple fields we want to support. $$ This meta comment fixes auto-indentation in Emacs. }} // Copyright 2009 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Implements a subset of TR1 tuple needed by Google Test and Google Mock. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #include // For ::std::pair. // The compiler used in Symbian has a bug that prevents us from declaring the // tuple template as a friend (it complains that tuple is redefined). This // hack bypasses the bug by declaring the members that should otherwise be // private as public. // Sun Studio versions < 12 also have the above bug. #if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) # define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: #else # define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ template friend class tuple; \ private: #endif $range i 0..n-1 $range j 0..n $range k 1..n // GTEST_n_TUPLE_(T) is the type of an n-tuple. #define GTEST_0_TUPLE_(T) tuple<> $for k [[ $range m 0..k-1 $range m2 k..n-1 #define GTEST_$(k)_TUPLE_(T) tuple<$for m, [[T##$m]]$for m2 [[, void]]> ]] // GTEST_n_TYPENAMES_(T) declares a list of n typenames. $for j [[ $range m 0..j-1 #define GTEST_$(j)_TYPENAMES_(T) $for m, [[typename T##$m]] ]] // In theory, defining stuff in the ::std namespace is undefined // behavior. We can do this as we are playing the role of a standard // library vendor. namespace std { namespace tr1 { template <$for i, [[typename T$i = void]]> class tuple; // Anything in namespace gtest_internal is Google Test's INTERNAL // IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. namespace gtest_internal { // ByRef::type is T if T is a reference; otherwise it's const T&. template struct ByRef { typedef const T& type; }; // NOLINT template struct ByRef { typedef T& type; }; // NOLINT // A handy wrapper for ByRef. #define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type // AddRef::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference::type. template struct AddRef { typedef T& type; }; // NOLINT template struct AddRef { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type // A helper for implementing get(). template class Get; // A helper for implementing tuple_element. kIndexValid is true // iff k < the number of fields in tuple type T. template struct TupleElement; $for i [[ template struct TupleElement [[]] { typedef T$i type; }; ]] } // namespace gtest_internal template <> class tuple<> { public: tuple() {} tuple(const tuple& /* t */) {} tuple& operator=(const tuple& /* t */) { return *this; } }; $for k [[ $range m 0..k-1 template class $if k < n [[GTEST_$(k)_TUPLE_(T)]] $else [[tuple]] { public: template friend class gtest_internal::Get; tuple() : $for m, [[f$(m)_()]] {} explicit tuple($for m, [[GTEST_BY_REF_(T$m) f$m]]) : [[]] $for m, [[f$(m)_(f$m)]] {} tuple(const tuple& t) : $for m, [[f$(m)_(t.f$(m)_)]] {} template tuple(const GTEST_$(k)_TUPLE_(U)& t) : $for m, [[f$(m)_(t.f$(m)_)]] {} $if k == 2 [[ template tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} ]] tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_$(k)_TUPLE_(U)& t) { return CopyFrom(t); } $if k == 2 [[ template tuple& operator=(const ::std::pair& p) { f0_ = p.first; f1_ = p.second; return *this; } ]] GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_$(k)_TUPLE_(U)& t) { $for m [[ f$(m)_ = t.f$(m)_; ]] return *this; } $for m [[ T$m f$(m)_; ]] }; ]] // 6.1.3.2 Tuple creation functions. // Known limitations: we don't support passing an // std::tr1::reference_wrapper to make_tuple(). And we don't // implement tie(). inline tuple<> make_tuple() { return tuple<>(); } $for k [[ $range m 0..k-1 template inline GTEST_$(k)_TUPLE_(T) make_tuple($for m, [[const T$m& f$m]]) { return GTEST_$(k)_TUPLE_(T)($for m, [[f$m]]); } ]] // 6.1.3.3 Tuple helper classes. template struct tuple_size; $for j [[ template struct tuple_size { static const int value = $j; }; ]] template struct tuple_element { typedef typename gtest_internal::TupleElement< k < (tuple_size::value), k, Tuple>::type type; }; #define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type // 6.1.3.4 Element access. namespace gtest_internal { $for i [[ template <> class Get<$i> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_($i, Tuple)) Field(Tuple& t) { return t.f$(i)_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_($i, Tuple)) ConstField(const Tuple& t) { return t.f$(i)_; } }; ]] } // namespace gtest_internal template GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_$(n)_TUPLE_(T))) get(GTEST_$(n)_TUPLE_(T)& t) { return gtest_internal::Get::Field(t); } template GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_$(n)_TUPLE_(T))) get(const GTEST_$(n)_TUPLE_(T)& t) { return gtest_internal::Get::ConstField(t); } // 6.1.3.5 Relational operators // We only implement == and !=, as we don't have a need for the rest yet. namespace gtest_internal { // SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the // first k fields of t1 equals the first k fields of t2. // SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if // k1 != k2. template struct SameSizeTuplePrefixComparator; template <> struct SameSizeTuplePrefixComparator<0, 0> { template static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { return true; } }; template struct SameSizeTuplePrefixComparator { template static bool Eq(const Tuple1& t1, const Tuple2& t2) { return SameSizeTuplePrefixComparator::Eq(t1, t2) && ::std::tr1::get(t1) == ::std::tr1::get(t2); } }; } // namespace gtest_internal template inline bool operator==(const GTEST_$(n)_TUPLE_(T)& t, const GTEST_$(n)_TUPLE_(U)& u) { return gtest_internal::SameSizeTuplePrefixComparator< tuple_size::value, tuple_size::value>::Eq(t, u); } template inline bool operator!=(const GTEST_$(n)_TUPLE_(T)& t, const GTEST_$(n)_TUPLE_(U)& u) { return !(t == u); } // 6.1.4 Pairs. // Unimplemented. } // namespace tr1 } // namespace std $for j [[ #undef GTEST_$(j)_TUPLE_ ]] $for j [[ #undef GTEST_$(j)_TYPENAMES_ ]] #undef GTEST_DECLARE_TUPLE_AS_FRIEND_ #undef GTEST_BY_REF_ #undef GTEST_ADD_REF_ #undef GTEST_TUPLE_ELEMENT_ #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-type-util.h0000600000175000017500000055247411561126632027277 0ustar synergysynergy// This file was GENERATED by command: // pump.py gtest-type-util.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Type utilities needed for implementing typed and type-parameterized // tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently we support at most 50 types in a list, and at most 50 // type-parameterized tests in one type-parameterized test case. // Please contact googletestframework@googlegroups.com if you need // more. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #include "gtest/internal/gtest-port.h" #include "gtest/internal/gtest-string.h" // #ifdef __GNUC__ is too general here. It is possible to use gcc without using // libstdc++ (which is where cxxabi.h comes from). # ifdef __GLIBCXX__ # include # elif defined(__HP_aCC) # include # endif // __GLIBCXX__ namespace testing { namespace internal { // GetTypeName() returns a human-readable name of type T. // NB: This function is also used in Google Mock, so don't move it inside of // the typed-test-only section below. template String GetTypeName() { # if GTEST_HAS_RTTI const char* const name = typeid(T).name(); # if defined(__GLIBCXX__) || defined(__HP_aCC) int status = 0; // gcc's implementation of typeid(T).name() mangles the type name, // so we have to demangle it. # ifdef __GLIBCXX__ using abi::__cxa_demangle; # endif // __GLIBCXX__ char* const readable_name = __cxa_demangle(name, 0, 0, &status); const String name_str(status == 0 ? readable_name : name); free(readable_name); return name_str; # else return name; # endif // __GLIBCXX__ || __HP_aCC # else return ""; # endif // GTEST_HAS_RTTI } #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // AssertyTypeEq::type is defined iff T1 and T2 are the same // type. This can be used as a compile-time assertion to ensure that // two types are equal. template struct AssertTypeEq; template struct AssertTypeEq { typedef bool type; }; // A unique type used as the default value for the arguments of class // template Types. This allows us to simulate variadic templates // (e.g. Types, Type, and etc), which C++ doesn't // support directly. struct None {}; // The following family of struct and struct templates are used to // represent type lists. In particular, TypesN // represents a type list with N types (T1, T2, ..., and TN) in it. // Except for Types0, every struct in the family has two member types: // Head for the first type in the list, and Tail for the rest of the // list. // The empty type list. struct Types0 {}; // Type lists of length 1, 2, 3, and so on. template struct Types1 { typedef T1 Head; typedef Types0 Tail; }; template struct Types2 { typedef T1 Head; typedef Types1 Tail; }; template struct Types3 { typedef T1 Head; typedef Types2 Tail; }; template struct Types4 { typedef T1 Head; typedef Types3 Tail; }; template struct Types5 { typedef T1 Head; typedef Types4 Tail; }; template struct Types6 { typedef T1 Head; typedef Types5 Tail; }; template struct Types7 { typedef T1 Head; typedef Types6 Tail; }; template struct Types8 { typedef T1 Head; typedef Types7 Tail; }; template struct Types9 { typedef T1 Head; typedef Types8 Tail; }; template struct Types10 { typedef T1 Head; typedef Types9 Tail; }; template struct Types11 { typedef T1 Head; typedef Types10 Tail; }; template struct Types12 { typedef T1 Head; typedef Types11 Tail; }; template struct Types13 { typedef T1 Head; typedef Types12 Tail; }; template struct Types14 { typedef T1 Head; typedef Types13 Tail; }; template struct Types15 { typedef T1 Head; typedef Types14 Tail; }; template struct Types16 { typedef T1 Head; typedef Types15 Tail; }; template struct Types17 { typedef T1 Head; typedef Types16 Tail; }; template struct Types18 { typedef T1 Head; typedef Types17 Tail; }; template struct Types19 { typedef T1 Head; typedef Types18 Tail; }; template struct Types20 { typedef T1 Head; typedef Types19 Tail; }; template struct Types21 { typedef T1 Head; typedef Types20 Tail; }; template struct Types22 { typedef T1 Head; typedef Types21 Tail; }; template struct Types23 { typedef T1 Head; typedef Types22 Tail; }; template struct Types24 { typedef T1 Head; typedef Types23 Tail; }; template struct Types25 { typedef T1 Head; typedef Types24 Tail; }; template struct Types26 { typedef T1 Head; typedef Types25 Tail; }; template struct Types27 { typedef T1 Head; typedef Types26 Tail; }; template struct Types28 { typedef T1 Head; typedef Types27 Tail; }; template struct Types29 { typedef T1 Head; typedef Types28 Tail; }; template struct Types30 { typedef T1 Head; typedef Types29 Tail; }; template struct Types31 { typedef T1 Head; typedef Types30 Tail; }; template struct Types32 { typedef T1 Head; typedef Types31 Tail; }; template struct Types33 { typedef T1 Head; typedef Types32 Tail; }; template struct Types34 { typedef T1 Head; typedef Types33 Tail; }; template struct Types35 { typedef T1 Head; typedef Types34 Tail; }; template struct Types36 { typedef T1 Head; typedef Types35 Tail; }; template struct Types37 { typedef T1 Head; typedef Types36 Tail; }; template struct Types38 { typedef T1 Head; typedef Types37 Tail; }; template struct Types39 { typedef T1 Head; typedef Types38 Tail; }; template struct Types40 { typedef T1 Head; typedef Types39 Tail; }; template struct Types41 { typedef T1 Head; typedef Types40 Tail; }; template struct Types42 { typedef T1 Head; typedef Types41 Tail; }; template struct Types43 { typedef T1 Head; typedef Types42 Tail; }; template struct Types44 { typedef T1 Head; typedef Types43 Tail; }; template struct Types45 { typedef T1 Head; typedef Types44 Tail; }; template struct Types46 { typedef T1 Head; typedef Types45 Tail; }; template struct Types47 { typedef T1 Head; typedef Types46 Tail; }; template struct Types48 { typedef T1 Head; typedef Types47 Tail; }; template struct Types49 { typedef T1 Head; typedef Types48 Tail; }; template struct Types50 { typedef T1 Head; typedef Types49 Tail; }; } // namespace internal // We don't want to require the users to write TypesN<...> directly, // as that would require them to count the length. Types<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Types // will appear as Types in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Types, and Google Test will translate // that to TypesN internally to make error messages // readable. The translation is done by the 'type' member of the // Types template. template struct Types { typedef internal::Types50 type; }; template <> struct Types { typedef internal::Types0 type; }; template struct Types { typedef internal::Types1 type; }; template struct Types { typedef internal::Types2 type; }; template struct Types { typedef internal::Types3 type; }; template struct Types { typedef internal::Types4 type; }; template struct Types { typedef internal::Types5 type; }; template struct Types { typedef internal::Types6 type; }; template struct Types { typedef internal::Types7 type; }; template struct Types { typedef internal::Types8 type; }; template struct Types { typedef internal::Types9 type; }; template struct Types { typedef internal::Types10 type; }; template struct Types { typedef internal::Types11 type; }; template struct Types { typedef internal::Types12 type; }; template struct Types { typedef internal::Types13 type; }; template struct Types { typedef internal::Types14 type; }; template struct Types { typedef internal::Types15 type; }; template struct Types { typedef internal::Types16 type; }; template struct Types { typedef internal::Types17 type; }; template struct Types { typedef internal::Types18 type; }; template struct Types { typedef internal::Types19 type; }; template struct Types { typedef internal::Types20 type; }; template struct Types { typedef internal::Types21 type; }; template struct Types { typedef internal::Types22 type; }; template struct Types { typedef internal::Types23 type; }; template struct Types { typedef internal::Types24 type; }; template struct Types { typedef internal::Types25 type; }; template struct Types { typedef internal::Types26 type; }; template struct Types { typedef internal::Types27 type; }; template struct Types { typedef internal::Types28 type; }; template struct Types { typedef internal::Types29 type; }; template struct Types { typedef internal::Types30 type; }; template struct Types { typedef internal::Types31 type; }; template struct Types { typedef internal::Types32 type; }; template struct Types { typedef internal::Types33 type; }; template struct Types { typedef internal::Types34 type; }; template struct Types { typedef internal::Types35 type; }; template struct Types { typedef internal::Types36 type; }; template struct Types { typedef internal::Types37 type; }; template struct Types { typedef internal::Types38 type; }; template struct Types { typedef internal::Types39 type; }; template struct Types { typedef internal::Types40 type; }; template struct Types { typedef internal::Types41 type; }; template struct Types { typedef internal::Types42 type; }; template struct Types { typedef internal::Types43 type; }; template struct Types { typedef internal::Types44 type; }; template struct Types { typedef internal::Types45 type; }; template struct Types { typedef internal::Types46 type; }; template struct Types { typedef internal::Types47 type; }; template struct Types { typedef internal::Types48 type; }; template struct Types { typedef internal::Types49 type; }; namespace internal { # define GTEST_TEMPLATE_ template class // The template "selector" struct TemplateSel is used to // represent Tmpl, which must be a class template with one type // parameter, as a type. TemplateSel::Bind::type is defined // as the type Tmpl. This allows us to actually instantiate the // template "selected" by TemplateSel. // // This trick is necessary for simulating typedef for class templates, // which C++ doesn't support directly. template struct TemplateSel { template struct Bind { typedef Tmpl type; }; }; # define GTEST_BIND_(TmplSel, T) \ TmplSel::template Bind::type // A unique struct template used as the default value for the // arguments of class template Templates. This allows us to simulate // variadic templates (e.g. Templates, Templates, // and etc), which C++ doesn't support directly. template struct NoneT {}; // The following family of struct and struct templates are used to // represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except // for Templates0, every struct in the family has two member types: // Head for the selector of the first template in the list, and Tail // for the rest of the list. // The empty template list. struct Templates0 {}; // Template lists of length 1, 2, 3, and so on. template struct Templates1 { typedef TemplateSel Head; typedef Templates0 Tail; }; template struct Templates2 { typedef TemplateSel Head; typedef Templates1 Tail; }; template struct Templates3 { typedef TemplateSel Head; typedef Templates2 Tail; }; template struct Templates4 { typedef TemplateSel Head; typedef Templates3 Tail; }; template struct Templates5 { typedef TemplateSel Head; typedef Templates4 Tail; }; template struct Templates6 { typedef TemplateSel Head; typedef Templates5 Tail; }; template struct Templates7 { typedef TemplateSel Head; typedef Templates6 Tail; }; template struct Templates8 { typedef TemplateSel Head; typedef Templates7 Tail; }; template struct Templates9 { typedef TemplateSel Head; typedef Templates8 Tail; }; template struct Templates10 { typedef TemplateSel Head; typedef Templates9 Tail; }; template struct Templates11 { typedef TemplateSel Head; typedef Templates10 Tail; }; template struct Templates12 { typedef TemplateSel Head; typedef Templates11 Tail; }; template struct Templates13 { typedef TemplateSel Head; typedef Templates12 Tail; }; template struct Templates14 { typedef TemplateSel Head; typedef Templates13 Tail; }; template struct Templates15 { typedef TemplateSel Head; typedef Templates14 Tail; }; template struct Templates16 { typedef TemplateSel Head; typedef Templates15 Tail; }; template struct Templates17 { typedef TemplateSel Head; typedef Templates16 Tail; }; template struct Templates18 { typedef TemplateSel Head; typedef Templates17 Tail; }; template struct Templates19 { typedef TemplateSel Head; typedef Templates18 Tail; }; template struct Templates20 { typedef TemplateSel Head; typedef Templates19 Tail; }; template struct Templates21 { typedef TemplateSel Head; typedef Templates20 Tail; }; template struct Templates22 { typedef TemplateSel Head; typedef Templates21 Tail; }; template struct Templates23 { typedef TemplateSel Head; typedef Templates22 Tail; }; template struct Templates24 { typedef TemplateSel Head; typedef Templates23 Tail; }; template struct Templates25 { typedef TemplateSel Head; typedef Templates24 Tail; }; template struct Templates26 { typedef TemplateSel Head; typedef Templates25 Tail; }; template struct Templates27 { typedef TemplateSel Head; typedef Templates26 Tail; }; template struct Templates28 { typedef TemplateSel Head; typedef Templates27 Tail; }; template struct Templates29 { typedef TemplateSel Head; typedef Templates28 Tail; }; template struct Templates30 { typedef TemplateSel Head; typedef Templates29 Tail; }; template struct Templates31 { typedef TemplateSel Head; typedef Templates30 Tail; }; template struct Templates32 { typedef TemplateSel Head; typedef Templates31 Tail; }; template struct Templates33 { typedef TemplateSel Head; typedef Templates32 Tail; }; template struct Templates34 { typedef TemplateSel Head; typedef Templates33 Tail; }; template struct Templates35 { typedef TemplateSel Head; typedef Templates34 Tail; }; template struct Templates36 { typedef TemplateSel Head; typedef Templates35 Tail; }; template struct Templates37 { typedef TemplateSel Head; typedef Templates36 Tail; }; template struct Templates38 { typedef TemplateSel Head; typedef Templates37 Tail; }; template struct Templates39 { typedef TemplateSel Head; typedef Templates38 Tail; }; template struct Templates40 { typedef TemplateSel Head; typedef Templates39 Tail; }; template struct Templates41 { typedef TemplateSel Head; typedef Templates40 Tail; }; template struct Templates42 { typedef TemplateSel Head; typedef Templates41 Tail; }; template struct Templates43 { typedef TemplateSel Head; typedef Templates42 Tail; }; template struct Templates44 { typedef TemplateSel Head; typedef Templates43 Tail; }; template struct Templates45 { typedef TemplateSel Head; typedef Templates44 Tail; }; template struct Templates46 { typedef TemplateSel Head; typedef Templates45 Tail; }; template struct Templates47 { typedef TemplateSel Head; typedef Templates46 Tail; }; template struct Templates48 { typedef TemplateSel Head; typedef Templates47 Tail; }; template struct Templates49 { typedef TemplateSel Head; typedef Templates48 Tail; }; template struct Templates50 { typedef TemplateSel Head; typedef Templates49 Tail; }; // We don't want to require the users to write TemplatesN<...> directly, // as that would require them to count the length. Templates<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Templates // will appear as Templates in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Templates, and Google Test will translate // that to TemplatesN internally to make error messages // readable. The translation is done by the 'type' member of the // Templates template. template struct Templates { typedef Templates50 type; }; template <> struct Templates { typedef Templates0 type; }; template struct Templates { typedef Templates1 type; }; template struct Templates { typedef Templates2 type; }; template struct Templates { typedef Templates3 type; }; template struct Templates { typedef Templates4 type; }; template struct Templates { typedef Templates5 type; }; template struct Templates { typedef Templates6 type; }; template struct Templates { typedef Templates7 type; }; template struct Templates { typedef Templates8 type; }; template struct Templates { typedef Templates9 type; }; template struct Templates { typedef Templates10 type; }; template struct Templates { typedef Templates11 type; }; template struct Templates { typedef Templates12 type; }; template struct Templates { typedef Templates13 type; }; template struct Templates { typedef Templates14 type; }; template struct Templates { typedef Templates15 type; }; template struct Templates { typedef Templates16 type; }; template struct Templates { typedef Templates17 type; }; template struct Templates { typedef Templates18 type; }; template struct Templates { typedef Templates19 type; }; template struct Templates { typedef Templates20 type; }; template struct Templates { typedef Templates21 type; }; template struct Templates { typedef Templates22 type; }; template struct Templates { typedef Templates23 type; }; template struct Templates { typedef Templates24 type; }; template struct Templates { typedef Templates25 type; }; template struct Templates { typedef Templates26 type; }; template struct Templates { typedef Templates27 type; }; template struct Templates { typedef Templates28 type; }; template struct Templates { typedef Templates29 type; }; template struct Templates { typedef Templates30 type; }; template struct Templates { typedef Templates31 type; }; template struct Templates { typedef Templates32 type; }; template struct Templates { typedef Templates33 type; }; template struct Templates { typedef Templates34 type; }; template struct Templates { typedef Templates35 type; }; template struct Templates { typedef Templates36 type; }; template struct Templates { typedef Templates37 type; }; template struct Templates { typedef Templates38 type; }; template struct Templates { typedef Templates39 type; }; template struct Templates { typedef Templates40 type; }; template struct Templates { typedef Templates41 type; }; template struct Templates { typedef Templates42 type; }; template struct Templates { typedef Templates43 type; }; template struct Templates { typedef Templates44 type; }; template struct Templates { typedef Templates45 type; }; template struct Templates { typedef Templates46 type; }; template struct Templates { typedef Templates47 type; }; template struct Templates { typedef Templates48 type; }; template struct Templates { typedef Templates49 type; }; // The TypeList template makes it possible to use either a single type // or a Types<...> list in TYPED_TEST_CASE() and // INSTANTIATE_TYPED_TEST_CASE_P(). template struct TypeList { typedef Types1 type; }; template struct TypeList > { typedef typename Types::type type; }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/include/gtest/internal/gtest-type-util.h.pump0000600000175000017500000002213711561126632030243 0ustar synergysynergy$$ -*- mode: c++; -*- $var n = 50 $$ Maximum length of type lists we want to support. // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Type utilities needed for implementing typed and type-parameterized // tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently we support at most $n types in a list, and at most $n // type-parameterized tests in one type-parameterized test case. // Please contact googletestframework@googlegroups.com if you need // more. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #include "gtest/internal/gtest-port.h" #include "gtest/internal/gtest-string.h" // #ifdef __GNUC__ is too general here. It is possible to use gcc without using // libstdc++ (which is where cxxabi.h comes from). # ifdef __GLIBCXX__ # include # elif defined(__HP_aCC) # include # endif // __GLIBCXX__ namespace testing { namespace internal { // GetTypeName() returns a human-readable name of type T. // NB: This function is also used in Google Mock, so don't move it inside of // the typed-test-only section below. template String GetTypeName() { # if GTEST_HAS_RTTI const char* const name = typeid(T).name(); # if defined(__GLIBCXX__) || defined(__HP_aCC) int status = 0; // gcc's implementation of typeid(T).name() mangles the type name, // so we have to demangle it. # ifdef __GLIBCXX__ using abi::__cxa_demangle; # endif // __GLIBCXX__ char* const readable_name = __cxa_demangle(name, 0, 0, &status); const String name_str(status == 0 ? readable_name : name); free(readable_name); return name_str; # else return name; # endif // __GLIBCXX__ || __HP_aCC # else return ""; # endif // GTEST_HAS_RTTI } #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // AssertyTypeEq::type is defined iff T1 and T2 are the same // type. This can be used as a compile-time assertion to ensure that // two types are equal. template struct AssertTypeEq; template struct AssertTypeEq { typedef bool type; }; // A unique type used as the default value for the arguments of class // template Types. This allows us to simulate variadic templates // (e.g. Types, Type, and etc), which C++ doesn't // support directly. struct None {}; // The following family of struct and struct templates are used to // represent type lists. In particular, TypesN // represents a type list with N types (T1, T2, ..., and TN) in it. // Except for Types0, every struct in the family has two member types: // Head for the first type in the list, and Tail for the rest of the // list. // The empty type list. struct Types0 {}; // Type lists of length 1, 2, 3, and so on. template struct Types1 { typedef T1 Head; typedef Types0 Tail; }; $range i 2..n $for i [[ $range j 1..i $range k 2..i template <$for j, [[typename T$j]]> struct Types$i { typedef T1 Head; typedef Types$(i-1)<$for k, [[T$k]]> Tail; }; ]] } // namespace internal // We don't want to require the users to write TypesN<...> directly, // as that would require them to count the length. Types<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Types // will appear as Types in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Types, and Google Test will translate // that to TypesN internally to make error messages // readable. The translation is done by the 'type' member of the // Types template. $range i 1..n template <$for i, [[typename T$i = internal::None]]> struct Types { typedef internal::Types$n<$for i, [[T$i]]> type; }; template <> struct Types<$for i, [[internal::None]]> { typedef internal::Types0 type; }; $range i 1..n-1 $for i [[ $range j 1..i $range k i+1..n template <$for j, [[typename T$j]]> struct Types<$for j, [[T$j]]$for k[[, internal::None]]> { typedef internal::Types$i<$for j, [[T$j]]> type; }; ]] namespace internal { # define GTEST_TEMPLATE_ template class // The template "selector" struct TemplateSel is used to // represent Tmpl, which must be a class template with one type // parameter, as a type. TemplateSel::Bind::type is defined // as the type Tmpl. This allows us to actually instantiate the // template "selected" by TemplateSel. // // This trick is necessary for simulating typedef for class templates, // which C++ doesn't support directly. template struct TemplateSel { template struct Bind { typedef Tmpl type; }; }; # define GTEST_BIND_(TmplSel, T) \ TmplSel::template Bind::type // A unique struct template used as the default value for the // arguments of class template Templates. This allows us to simulate // variadic templates (e.g. Templates, Templates, // and etc), which C++ doesn't support directly. template struct NoneT {}; // The following family of struct and struct templates are used to // represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except // for Templates0, every struct in the family has two member types: // Head for the selector of the first template in the list, and Tail // for the rest of the list. // The empty template list. struct Templates0 {}; // Template lists of length 1, 2, 3, and so on. template struct Templates1 { typedef TemplateSel Head; typedef Templates0 Tail; }; $range i 2..n $for i [[ $range j 1..i $range k 2..i template <$for j, [[GTEST_TEMPLATE_ T$j]]> struct Templates$i { typedef TemplateSel Head; typedef Templates$(i-1)<$for k, [[T$k]]> Tail; }; ]] // We don't want to require the users to write TemplatesN<...> directly, // as that would require them to count the length. Templates<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Templates // will appear as Templates in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Templates, and Google Test will translate // that to TemplatesN internally to make error messages // readable. The translation is done by the 'type' member of the // Templates template. $range i 1..n template <$for i, [[GTEST_TEMPLATE_ T$i = NoneT]]> struct Templates { typedef Templates$n<$for i, [[T$i]]> type; }; template <> struct Templates<$for i, [[NoneT]]> { typedef Templates0 type; }; $range i 1..n-1 $for i [[ $range j 1..i $range k i+1..n template <$for j, [[GTEST_TEMPLATE_ T$j]]> struct Templates<$for j, [[T$j]]$for k[[, NoneT]]> { typedef Templates$i<$for j, [[T$j]]> type; }; ]] // The TypeList template makes it possible to use either a single type // or a Types<...> list in TYPED_TEST_CASE() and // INSTANTIATE_TYPED_TEST_CASE_P(). template struct TypeList { typedef Types1 type; }; $range i 1..n template <$for i, [[typename T$i]]> struct TypeList > { typedef typename Types<$for i, [[T$i]]>::type type; }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/m4/0000700000175000017500000000000012140644175017757 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/m4/acx_pthread.m40000600000175000017500000003176611561126632022521 0ustar synergysynergy# This was retrieved from # http://svn.0pointer.de/viewvc/trunk/common/acx_pthread.m4?revision=1277&root=avahi # See also (perhaps for new versions?) # http://svn.0pointer.de/viewvc/trunk/common/acx_pthread.m4?root=avahi # # We've rewritten the inconsistency check code (from avahi), to work # more broadly. In particular, it no longer assumes ld accepts -zdefs. # This caused a restructing of the code, but the functionality has only # changed a little. dnl @synopsis ACX_PTHREAD([ACTION-IF-FOUND[, ACTION-IF-NOT-FOUND]]) dnl dnl @summary figure out how to build C programs using POSIX threads dnl dnl This macro figures out how to build C programs using POSIX threads. dnl It sets the PTHREAD_LIBS output variable to the threads library and dnl linker flags, and the PTHREAD_CFLAGS output variable to any special dnl C compiler flags that are needed. (The user can also force certain dnl compiler flags/libs to be tested by setting these environment dnl variables.) dnl dnl Also sets PTHREAD_CC to any special C compiler that is needed for dnl multi-threaded programs (defaults to the value of CC otherwise). dnl (This is necessary on AIX to use the special cc_r compiler alias.) dnl dnl NOTE: You are assumed to not only compile your program with these dnl flags, but also link it with them as well. e.g. you should link dnl with $PTHREAD_CC $CFLAGS $PTHREAD_CFLAGS $LDFLAGS ... $PTHREAD_LIBS dnl $LIBS dnl dnl If you are only building threads programs, you may wish to use dnl these variables in your default LIBS, CFLAGS, and CC: dnl dnl LIBS="$PTHREAD_LIBS $LIBS" dnl CFLAGS="$CFLAGS $PTHREAD_CFLAGS" dnl CC="$PTHREAD_CC" dnl dnl In addition, if the PTHREAD_CREATE_JOINABLE thread-attribute dnl constant has a nonstandard name, defines PTHREAD_CREATE_JOINABLE to dnl that name (e.g. PTHREAD_CREATE_UNDETACHED on AIX). dnl dnl ACTION-IF-FOUND is a list of shell commands to run if a threads dnl library is found, and ACTION-IF-NOT-FOUND is a list of commands to dnl run it if it is not found. If ACTION-IF-FOUND is not specified, the dnl default action will define HAVE_PTHREAD. dnl dnl Please let the authors know if this macro fails on any platform, or dnl if you have any other suggestions or comments. This macro was based dnl on work by SGJ on autoconf scripts for FFTW (www.fftw.org) (with dnl help from M. Frigo), as well as ac_pthread and hb_pthread macros dnl posted by Alejandro Forero Cuervo to the autoconf macro repository. dnl We are also grateful for the helpful feedback of numerous users. dnl dnl @category InstalledPackages dnl @author Steven G. Johnson dnl @version 2006-05-29 dnl @license GPLWithACException dnl dnl Checks for GCC shared/pthread inconsistency based on work by dnl Marcin Owsiany AC_DEFUN([ACX_PTHREAD], [ AC_REQUIRE([AC_CANONICAL_HOST]) AC_LANG_SAVE AC_LANG_C acx_pthread_ok=no # We used to check for pthread.h first, but this fails if pthread.h # requires special compiler flags (e.g. on True64 or Sequent). # It gets checked for in the link test anyway. # First of all, check if the user has set any of the PTHREAD_LIBS, # etcetera environment variables, and if threads linking works using # them: if test x"$PTHREAD_LIBS$PTHREAD_CFLAGS" != x; then save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" AC_MSG_CHECKING([for pthread_join in LIBS=$PTHREAD_LIBS with CFLAGS=$PTHREAD_CFLAGS]) AC_TRY_LINK_FUNC(pthread_join, acx_pthread_ok=yes) AC_MSG_RESULT($acx_pthread_ok) if test x"$acx_pthread_ok" = xno; then PTHREAD_LIBS="" PTHREAD_CFLAGS="" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" fi # We must check for the threads library under a number of different # names; the ordering is very important because some systems # (e.g. DEC) have both -lpthread and -lpthreads, where one of the # libraries is broken (non-POSIX). # Create a list of thread flags to try. Items starting with a "-" are # C compiler flags, and other items are library names, except for "none" # which indicates that we try without any flags at all, and "pthread-config" # which is a program returning the flags for the Pth emulation library. acx_pthread_flags="pthreads none -Kthread -kthread lthread -pthread -pthreads -mthreads pthread --thread-safe -mt pthread-config" # The ordering *is* (sometimes) important. Some notes on the # individual items follow: # pthreads: AIX (must check this before -lpthread) # none: in case threads are in libc; should be tried before -Kthread and # other compiler flags to prevent continual compiler warnings # -Kthread: Sequent (threads in libc, but -Kthread needed for pthread.h) # -kthread: FreeBSD kernel threads (preferred to -pthread since SMP-able) # lthread: LinuxThreads port on FreeBSD (also preferred to -pthread) # -pthread: Linux/gcc (kernel threads), BSD/gcc (userland threads) # -pthreads: Solaris/gcc # -mthreads: Mingw32/gcc, Lynx/gcc # -mt: Sun Workshop C (may only link SunOS threads [-lthread], but it # doesn't hurt to check since this sometimes defines pthreads too; # also defines -D_REENTRANT) # ... -mt is also the pthreads flag for HP/aCC # pthread: Linux, etcetera # --thread-safe: KAI C++ # pthread-config: use pthread-config program (for GNU Pth library) case "${host_cpu}-${host_os}" in *solaris*) # On Solaris (at least, for some versions), libc contains stubbed # (non-functional) versions of the pthreads routines, so link-based # tests will erroneously succeed. (We need to link with -pthreads/-mt/ # -lpthread.) (The stubs are missing pthread_cleanup_push, or rather # a function called by this macro, so we could check for that, but # who knows whether they'll stub that too in a future libc.) So, # we'll just look for -pthreads and -lpthread first: acx_pthread_flags="-pthreads pthread -mt -pthread $acx_pthread_flags" ;; esac if test x"$acx_pthread_ok" = xno; then for flag in $acx_pthread_flags; do case $flag in none) AC_MSG_CHECKING([whether pthreads work without any flags]) ;; -*) AC_MSG_CHECKING([whether pthreads work with $flag]) PTHREAD_CFLAGS="$flag" ;; pthread-config) AC_CHECK_PROG(acx_pthread_config, pthread-config, yes, no) if test x"$acx_pthread_config" = xno; then continue; fi PTHREAD_CFLAGS="`pthread-config --cflags`" PTHREAD_LIBS="`pthread-config --ldflags` `pthread-config --libs`" ;; *) AC_MSG_CHECKING([for the pthreads library -l$flag]) PTHREAD_LIBS="-l$flag" ;; esac save_LIBS="$LIBS" save_CFLAGS="$CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Check for various functions. We must include pthread.h, # since some functions may be macros. (On the Sequent, we # need a special flag -Kthread to make this header compile.) # We check for pthread_join because it is in -lpthread on IRIX # while pthread_create is in libc. We check for pthread_attr_init # due to DEC craziness with -lpthreads. We check for # pthread_cleanup_push because it is one of the few pthread # functions on Solaris that doesn't have a non-functional libc stub. # We try pthread_create on general principles. AC_TRY_LINK([#include ], [pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ], [acx_pthread_ok=yes]) LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" AC_MSG_RESULT($acx_pthread_ok) if test "x$acx_pthread_ok" = xyes; then break; fi PTHREAD_LIBS="" PTHREAD_CFLAGS="" done fi # Various other checks: if test "x$acx_pthread_ok" = xyes; then save_LIBS="$LIBS" LIBS="$PTHREAD_LIBS $LIBS" save_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS $PTHREAD_CFLAGS" # Detect AIX lossage: JOINABLE attribute is called UNDETACHED. AC_MSG_CHECKING([for joinable pthread attribute]) attr_name=unknown for attr in PTHREAD_CREATE_JOINABLE PTHREAD_CREATE_UNDETACHED; do AC_TRY_LINK([#include ], [int attr=$attr; return attr;], [attr_name=$attr; break]) done AC_MSG_RESULT($attr_name) if test "$attr_name" != PTHREAD_CREATE_JOINABLE; then AC_DEFINE_UNQUOTED(PTHREAD_CREATE_JOINABLE, $attr_name, [Define to necessary symbol if this constant uses a non-standard name on your system.]) fi AC_MSG_CHECKING([if more special flags are required for pthreads]) flag=no case "${host_cpu}-${host_os}" in *-aix* | *-freebsd* | *-darwin*) flag="-D_THREAD_SAFE";; *solaris* | *-osf* | *-hpux*) flag="-D_REENTRANT";; esac AC_MSG_RESULT(${flag}) if test "x$flag" != xno; then PTHREAD_CFLAGS="$flag $PTHREAD_CFLAGS" fi LIBS="$save_LIBS" CFLAGS="$save_CFLAGS" # More AIX lossage: must compile with xlc_r or cc_r if test x"$GCC" != xyes; then AC_CHECK_PROGS(PTHREAD_CC, xlc_r cc_r, ${CC}) else PTHREAD_CC=$CC fi # The next part tries to detect GCC inconsistency with -shared on some # architectures and systems. The problem is that in certain # configurations, when -shared is specified, GCC "forgets" to # internally use various flags which are still necessary. # # Prepare the flags # save_CFLAGS="$CFLAGS" save_LIBS="$LIBS" save_CC="$CC" # Try with the flags determined by the earlier checks. # # -Wl,-z,defs forces link-time symbol resolution, so that the # linking checks with -shared actually have any value # # FIXME: -fPIC is required for -shared on many architectures, # so we specify it here, but the right way would probably be to # properly detect whether it is actually required. CFLAGS="-shared -fPIC -Wl,-z,defs $CFLAGS $PTHREAD_CFLAGS" LIBS="$PTHREAD_LIBS $LIBS" CC="$PTHREAD_CC" # In order not to create several levels of indentation, we test # the value of "$done" until we find the cure or run out of ideas. done="no" # First, make sure the CFLAGS we added are actually accepted by our # compiler. If not (and OS X's ld, for instance, does not accept -z), # then we can't do this test. if test x"$done" = xno; then AC_MSG_CHECKING([whether to check for GCC pthread/shared inconsistencies]) AC_TRY_LINK(,, , [done=yes]) if test "x$done" = xyes ; then AC_MSG_RESULT([no]) else AC_MSG_RESULT([yes]) fi fi if test x"$done" = xno; then AC_MSG_CHECKING([whether -pthread is sufficient with -shared]) AC_TRY_LINK([#include ], [pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ], [done=yes]) if test "x$done" = xyes; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi fi # # Linux gcc on some architectures such as mips/mipsel forgets # about -lpthread # if test x"$done" = xno; then AC_MSG_CHECKING([whether -lpthread fixes that]) LIBS="-lpthread $PTHREAD_LIBS $save_LIBS" AC_TRY_LINK([#include ], [pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ], [done=yes]) if test "x$done" = xyes; then AC_MSG_RESULT([yes]) PTHREAD_LIBS="-lpthread $PTHREAD_LIBS" else AC_MSG_RESULT([no]) fi fi # # FreeBSD 4.10 gcc forgets to use -lc_r instead of -lc # if test x"$done" = xno; then AC_MSG_CHECKING([whether -lc_r fixes that]) LIBS="-lc_r $PTHREAD_LIBS $save_LIBS" AC_TRY_LINK([#include ], [pthread_t th; pthread_join(th, 0); pthread_attr_init(0); pthread_cleanup_push(0, 0); pthread_create(0,0,0,0); pthread_cleanup_pop(0); ], [done=yes]) if test "x$done" = xyes; then AC_MSG_RESULT([yes]) PTHREAD_LIBS="-lc_r $PTHREAD_LIBS" else AC_MSG_RESULT([no]) fi fi if test x"$done" = xno; then # OK, we have run out of ideas AC_MSG_WARN([Impossible to determine how to use pthreads with shared libraries]) # so it's not safe to assume that we may use pthreads acx_pthread_ok=no fi CFLAGS="$save_CFLAGS" LIBS="$save_LIBS" CC="$save_CC" else PTHREAD_CC="$CC" fi AC_SUBST(PTHREAD_LIBS) AC_SUBST(PTHREAD_CFLAGS) AC_SUBST(PTHREAD_CC) # Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND: if test x"$acx_pthread_ok" = xyes; then ifelse([$1],,AC_DEFINE(HAVE_PTHREAD,1,[Define if you have POSIX threads libraries and header files.]),[$1]) : else acx_pthread_ok=no $2 fi AC_LANG_RESTORE ])dnl ACX_PTHREAD synergy-1.4.12-Source/tools/gtest-1.6.0/m4/gtest.m40000600000175000017500000000622111561126632021351 0ustar synergysynergydnl GTEST_LIB_CHECK([minimum version [, dnl action if found [,action if not found]]]) dnl dnl Check for the presence of the Google Test library, optionally at a minimum dnl version, and indicate a viable version with the HAVE_GTEST flag. It defines dnl standard variables for substitution including GTEST_CPPFLAGS, dnl GTEST_CXXFLAGS, GTEST_LDFLAGS, and GTEST_LIBS. It also defines dnl GTEST_VERSION as the version of Google Test found. Finally, it provides dnl optional custom action slots in the event GTEST is found or not. AC_DEFUN([GTEST_LIB_CHECK], [ dnl Provide a flag to enable or disable Google Test usage. AC_ARG_ENABLE([gtest], [AS_HELP_STRING([--enable-gtest], [Enable tests using the Google C++ Testing Framework. (Default is enabled.)])], [], [enable_gtest=]) AC_ARG_VAR([GTEST_CONFIG], [The exact path of Google Test's 'gtest-config' script.]) AC_ARG_VAR([GTEST_CPPFLAGS], [C-like preprocessor flags for Google Test.]) AC_ARG_VAR([GTEST_CXXFLAGS], [C++ compile flags for Google Test.]) AC_ARG_VAR([GTEST_LDFLAGS], [Linker path and option flags for Google Test.]) AC_ARG_VAR([GTEST_LIBS], [Library linking flags for Google Test.]) AC_ARG_VAR([GTEST_VERSION], [The version of Google Test available.]) HAVE_GTEST="no" AS_IF([test "x${enable_gtest}" != "xno"], [AC_MSG_CHECKING([for 'gtest-config']) AS_IF([test "x${enable_gtest}" != "xyes"], [AS_IF([test -x "${enable_gtest}/scripts/gtest-config"], [GTEST_CONFIG="${enable_gtest}/scripts/gtest-config"], [GTEST_CONFIG="${enable_gtest}/bin/gtest-config"]) AS_IF([test -x "${GTEST_CONFIG}"], [], [AC_MSG_RESULT([no]) AC_MSG_ERROR([dnl Unable to locate either a built or installed Google Test. The specific location '${enable_gtest}' was provided for a built or installed Google Test, but no 'gtest-config' script could be found at this location.]) ])], [AC_PATH_PROG([GTEST_CONFIG], [gtest-config])]) AS_IF([test -x "${GTEST_CONFIG}"], [AC_MSG_RESULT([${GTEST_CONFIG}]) m4_ifval([$1], [_gtest_min_version="--min-version=$1" AC_MSG_CHECKING([for Google Test at least version >= $1])], [_gtest_min_version="--min-version=0" AC_MSG_CHECKING([for Google Test])]) AS_IF([${GTEST_CONFIG} ${_gtest_min_version}], [AC_MSG_RESULT([yes]) HAVE_GTEST='yes'], [AC_MSG_RESULT([no])])], [AC_MSG_RESULT([no])]) AS_IF([test "x${HAVE_GTEST}" = "xyes"], [GTEST_CPPFLAGS=`${GTEST_CONFIG} --cppflags` GTEST_CXXFLAGS=`${GTEST_CONFIG} --cxxflags` GTEST_LDFLAGS=`${GTEST_CONFIG} --ldflags` GTEST_LIBS=`${GTEST_CONFIG} --libs` GTEST_VERSION=`${GTEST_CONFIG} --version` AC_DEFINE([HAVE_GTEST],[1],[Defined when Google Test is available.])], [AS_IF([test "x${enable_gtest}" = "xyes"], [AC_MSG_ERROR([dnl Google Test was enabled, but no viable version could be found.]) ])])]) AC_SUBST([HAVE_GTEST]) AM_CONDITIONAL([HAVE_GTEST],[test "x$HAVE_GTEST" = "xyes"]) AS_IF([test "x$HAVE_GTEST" = "xyes"], [m4_ifval([$2], [$2])], [m4_ifval([$3], [$3])]) ]) synergy-1.4.12-Source/tools/gtest-1.6.0/m4/libtool.m40000600000175000017500000077464711561126632021717 0ustar synergysynergy# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 56 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl _LT_PROG_ECHO_BACKSLASH case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from `configure', and `config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # `config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain="$ac_aux_dir/ltmain.sh" ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the `libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to `config.status' so that its # declaration there will have the same value as in `configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "X$][$1" | $Xsed -e "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "X$" | $Xsed -e "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags="_LT_TAGS"dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the `libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into `config.status', and then the shell code to quote escape them in # for loops in `config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\[$]0 --fallback-echo"')dnl " lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\[$]0 --fallback-echo"\[$]/\[$]0 --fallback-echo"/'\` ;; esac _LT_OUTPUT_LIBTOOL_INIT ]) # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) cat >"$CONFIG_LT" <<_LTEOF #! $SHELL # Generated by $as_me. # Run this file to recreate a libtool stub with the current configuration. lt_cl_silent=false SHELL=\${CONFIG_SHELL-$SHELL} _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ \`$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2008 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test $[#] != 0 do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try \`$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try \`$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. if test "$no_create" != yes; then lt_cl_success=: test "$silent" = yes && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) fi ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) _LT_PROG_XSI_SHELLFNS sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS="$save_LDFLAGS" ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES # -------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(whole_archive_flag_spec, $1)='' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" m4_if([$1], [CXX], [ if test "$lt_cv_apple_cc_single_mod" != "yes"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX # ----------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl AC_LINK_IFELSE(AC_LANG_PROGRAM,[ lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [ifdef([AC_DIVERSION_NOTICE], [AC_DIVERT_PUSH(AC_DIVERSION_NOTICE)], [AC_DIVERT_PUSH(NOTICE)]) $1 AC_DIVERT_POP ])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Add some code to the start of the generated configure script which # will find an echo command which doesn't interpret backslashes. m4_defun([_LT_PROG_ECHO_BACKSLASH], [_LT_SHELL_INIT([ # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\[$]\\[$]0,'[$]0','` ;; esac ECHO=${lt_ECHO-echo} if test "X[$]1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X[$]1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "[$]0" --no-reexec ${1+"[$]@"} fi if test "X[$]1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF [$]* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "[$]0"' 'sed 20q "[$]0"' 'sed 10q "[$]0"' 'sed 2q "[$]0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "[$]0" --no-reexec ${1+"[$]@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL [$]0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL [$]0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "[$]0"' 'sed 10q "[$]0"' 'sed 20q "[$]0"' 'sed 50q "[$]0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "[$]0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "[$]0" ${1+"[$]@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL [$]0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\[$]0 --fallback-echo" fi AC_SUBST(lt_ECHO) ]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that does not interpret backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '[#]line __oline__ "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ])# _LT_ENABLE_LOCK # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [AC_CHECK_TOOL(AR, ar, false) test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1]) AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test x"[$]$2" = xyes; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" ]) if test x"[$]$2" = xyes; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL [$]0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n $lt_cv_sys_max_cmd_len ; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "$cross_compiling" = yes; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line __oline__ "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[ lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen="shl_load"], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen="dlopen"], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"]) ]) ]) ]) ]) ]) ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links="nottested" if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test "$hard_links" = no; then AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/", [Define to the sub-directory in which libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[[4-9]]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[123]]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[[3-9]]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program which can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$1; then lt_cv_path_MAGIC_CMD="$ac_dir/$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac]) MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program which can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]].[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method == "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi]) if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. AC_CHECK_TOOLS(DUMPBIN, ["dumpbin -symbols" "link -dump -symbols"], :) AC_SUBST([DUMPBIN]) if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:__oline__: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cygwin* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw") AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM="-lm") ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= AC_MSG_CHECKING([for $compiler option to produce PIC]) m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC*) # IBM XL 8.0 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_MSG_RESULT([$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;/^.*[[ ]]__nm__/s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; xl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='-rpath $libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(fix_srcfile_path, $1)='`cygpath -w "$srcfile"`' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; freebsd1*) _LT_TAGVAR(ld_shlibs, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" AC_LINK_IFELSE(int foo(void) {}, _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' ) LDFLAGS="$save_LDFLAGS" else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' else case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' ;; esac fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_MSG_CHECKING([whether -lc should be explicitly linked in]) $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then _LT_TAGVAR(archive_cmds_need_lc, $1)=no else _LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* AC_MSG_RESULT([$_LT_TAGVAR(archive_cmds_need_lc, $1)]) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_flag_spec_ld], [1], [[If ld is used when linking, flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting ${shlibpath_var} if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [fix_srcfile_path], [1], [Fix the shell variable $srcfile for the compiler]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC="$CC" AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report which library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC="$lt_save_CC" ])# _LT_LANG_C_CONFIG # _LT_PROG_CXX # ------------ # Since AC_PROG_CXX is broken, in that it returns g++ if there is no c++ # compiler, we have our own version here. m4_defun([_LT_PROG_CXX], [ pushdef([AC_MSG_ERROR], [_lt_caught_CXX_error=yes]) AC_PROG_CXX if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_CXX dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_CXX], []) # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [AC_REQUIRE([_LT_PROG_CXX])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd[[12]]*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; gnu*) ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]]* | *pgcpp\ [[1-5]]*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 will use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; xl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=echo else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && $ECHO "X${wl}-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(GCC, $1)="$GXX" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ]) dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}" else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)="${prev}${p}" else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)="$p" else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)="$p" else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_PROG_F77 # ------------ # Since AC_PROG_F77 is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_F77], [ pushdef([AC_MSG_ERROR], [_lt_disable_F77=yes]) AC_PROG_F77 if test -z "$F77" || test "X$F77" = "Xno"; then _lt_disable_F77=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_F77 dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_F77], []) # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_REQUIRE([_LT_PROG_F77])dnl AC_LANG_PUSH(Fortran 77) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_F77" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${F77-"f77"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$G77" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_F77" != yes AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_PROG_FC # ----------- # Since AC_PROG_FC is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_FC], [ pushdef([AC_MSG_ERROR], [_lt_disable_FC=yes]) AC_PROG_FC if test -z "$FC" || test "X$FC" = "Xno"; then _lt_disable_FC=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_FC dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_FC], []) # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_REQUIRE([_LT_PROG_FC])dnl AC_LANG_PUSH(Fortran) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_FC" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${FC-"f95"} compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_FC" != yes AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC="$lt_save_CC" ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC= CC=${RC-"windres"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC="$lt_save_CC" ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PROG_XSI_SHELLFNS # --------------------- # Bourne and XSI compatible variants of some useful shell functions. m4_defun([_LT_PROG_XSI_SHELLFNS], [case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $[*] )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } dnl func_dirname_and_basename dnl A portable version of this function is already defined in general.m4sh dnl so there is no need for it here. # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[[^=]]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[[^=]]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[[^.]]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$[@]"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$[1]" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]+=\$[2]" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]=\$$[1]\$[2]" } _LT_EOF ;; esac ]) synergy-1.4.12-Source/tools/gtest-1.6.0/m4/ltoptions.m40000600000175000017500000002724211561126632022264 0ustar synergysynergy# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option `$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl `shared' nor `disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [0], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [0], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [0], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the `shared' and # `disable-shared' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the `static' and # `disable-static' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the `fast-install' # and `disable-fast-install' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the `pic-only' and `no-pic' # LT_INIT options. # MODE is either `yes' or `no'. If omitted, it defaults to `both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [pic_mode="$withval"], [pic_mode=default]) test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) synergy-1.4.12-Source/tools/gtest-1.6.0/m4/ltsugar.m40000600000175000017500000001042411561126632021704 0ustar synergysynergy# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59 which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) synergy-1.4.12-Source/tools/gtest-1.6.0/m4/ltversion.m40000600000175000017500000000127711561126632022256 0ustar synergysynergy# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # Generated from ltversion.in. # serial 3017 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.2.6b]) m4_define([LT_PACKAGE_REVISION], [1.3017]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.2.6b' macro_revision='1.3017' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) synergy-1.4.12-Source/tools/gtest-1.6.0/m4/lt~obsolete.m40000600000175000017500000001311311561126632022573 0ustar synergysynergy# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 4 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_RC], [AC_DEFUN([AC_LIBTOOL_RC])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) synergy-1.4.12-Source/tools/gtest-1.6.0/make/0000700000175000017500000000000012140644175020354 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/Makefile.am0000600000175000017500000002270411561126632021501 0ustar synergysynergy# Automake file ACLOCAL_AMFLAGS = -I m4 # Nonstandard package files for distribution EXTRA_DIST = \ CHANGES \ CONTRIBUTORS \ include/gtest/gtest-param-test.h.pump \ include/gtest/internal/gtest-param-util-generated.h.pump \ include/gtest/internal/gtest-tuple.h.pump \ include/gtest/internal/gtest-type-util.h.pump \ make/Makefile \ scripts/fuse_gtest_files.py \ scripts/gen_gtest_pred_impl.py \ scripts/pump.py \ scripts/test/Makefile # gtest source files that we don't compile directly. They are # #included by gtest-all.cc. GTEST_SRC = \ src/gtest-death-test.cc \ src/gtest-filepath.cc \ src/gtest-internal-inl.h \ src/gtest-port.cc \ src/gtest-printers.cc \ src/gtest-test-part.cc \ src/gtest-typed-test.cc \ src/gtest.cc EXTRA_DIST += $(GTEST_SRC) # Sample files that we don't compile. EXTRA_DIST += \ samples/prime_tables.h \ samples/sample2_unittest.cc \ samples/sample3_unittest.cc \ samples/sample4_unittest.cc \ samples/sample5_unittest.cc \ samples/sample6_unittest.cc \ samples/sample7_unittest.cc \ samples/sample8_unittest.cc \ samples/sample9_unittest.cc # C++ test files that we don't compile directly. EXTRA_DIST += \ test/gtest-death-test_ex_test.cc \ test/gtest-death-test_test.cc \ test/gtest-filepath_test.cc \ test/gtest-linked_ptr_test.cc \ test/gtest-listener_test.cc \ test/gtest-message_test.cc \ test/gtest-options_test.cc \ test/gtest-param-test2_test.cc \ test/gtest-param-test2_test.cc \ test/gtest-param-test_test.cc \ test/gtest-param-test_test.cc \ test/gtest-param-test_test.h \ test/gtest-port_test.cc \ test/gtest-printers_test.cc \ test/gtest-test-part_test.cc \ test/gtest-tuple_test.cc \ test/gtest-typed-test2_test.cc \ test/gtest-typed-test_test.cc \ test/gtest-typed-test_test.h \ test/gtest-unittest-api_test.cc \ test/gtest_break_on_failure_unittest_.cc \ test/gtest_catch_exceptions_test_.cc \ test/gtest_color_test_.cc \ test/gtest_env_var_test_.cc \ test/gtest_environment_test.cc \ test/gtest_filter_unittest_.cc \ test/gtest_help_test_.cc \ test/gtest_list_tests_unittest_.cc \ test/gtest_main_unittest.cc \ test/gtest_no_test_unittest.cc \ test/gtest_output_test_.cc \ test/gtest_pred_impl_unittest.cc \ test/gtest_prod_test.cc \ test/gtest_repeat_test.cc \ test/gtest_shuffle_test_.cc \ test/gtest_sole_header_test.cc \ test/gtest_stress_test.cc \ test/gtest_throw_on_failure_ex_test.cc \ test/gtest_throw_on_failure_test_.cc \ test/gtest_uninitialized_test_.cc \ test/gtest_unittest.cc \ test/gtest_unittest.cc \ test/gtest_xml_outfile1_test_.cc \ test/gtest_xml_outfile2_test_.cc \ test/gtest_xml_output_unittest_.cc \ test/production.cc \ test/production.h # Python tests that we don't run. EXTRA_DIST += \ test/gtest_break_on_failure_unittest.py \ test/gtest_catch_exceptions_test.py \ test/gtest_color_test.py \ test/gtest_env_var_test.py \ test/gtest_filter_unittest.py \ test/gtest_help_test.py \ test/gtest_list_tests_unittest.py \ test/gtest_output_test.py \ test/gtest_output_test_golden_lin.txt \ test/gtest_shuffle_test.py \ test/gtest_test_utils.py \ test/gtest_throw_on_failure_test.py \ test/gtest_uninitialized_test.py \ test/gtest_xml_outfiles_test.py \ test/gtest_xml_output_unittest.py \ test/gtest_xml_test_utils.py # CMake script EXTRA_DIST += \ CMakeLists.txt \ cmake/internal_utils.cmake # MSVC project files EXTRA_DIST += \ msvc/gtest-md.sln \ msvc/gtest-md.vcproj \ msvc/gtest.sln \ msvc/gtest.vcproj \ msvc/gtest_main-md.vcproj \ msvc/gtest_main.vcproj \ msvc/gtest_prod_test-md.vcproj \ msvc/gtest_prod_test.vcproj \ msvc/gtest_unittest-md.vcproj \ msvc/gtest_unittest.vcproj # xcode project files EXTRA_DIST += \ xcode/Config/DebugProject.xcconfig \ xcode/Config/FrameworkTarget.xcconfig \ xcode/Config/General.xcconfig \ xcode/Config/ReleaseProject.xcconfig \ xcode/Config/StaticLibraryTarget.xcconfig \ xcode/Config/TestTarget.xcconfig \ xcode/Resources/Info.plist \ xcode/Scripts/runtests.sh \ xcode/Scripts/versiongenerate.py \ xcode/gtest.xcodeproj/project.pbxproj # xcode sample files EXTRA_DIST += \ xcode/Samples/FrameworkSample/Info.plist \ xcode/Samples/FrameworkSample/WidgetFramework.xcodeproj/project.pbxproj \ xcode/Samples/FrameworkSample/runtests.sh \ xcode/Samples/FrameworkSample/widget.cc \ xcode/Samples/FrameworkSample/widget.h \ xcode/Samples/FrameworkSample/widget_test.cc # C++Builder project files EXTRA_DIST += \ codegear/gtest.cbproj \ codegear/gtest.groupproj \ codegear/gtest_all.cc \ codegear/gtest_link.cc \ codegear/gtest_main.cbproj \ codegear/gtest_unittest.cbproj # Distribute and install M4 macro m4datadir = $(datadir)/aclocal m4data_DATA = m4/gtest.m4 EXTRA_DIST += $(m4data_DATA) # We define the global AM_CPPFLAGS as everything we compile includes from these # directories. AM_CPPFLAGS = -I$(srcdir) -I$(srcdir)/include # Modifies compiler and linker flags for pthreads compatibility. if HAVE_PTHREADS AM_CXXFLAGS = @PTHREAD_CFLAGS@ -DGTEST_HAS_PTHREAD=1 AM_LIBS = @PTHREAD_LIBS@ else AM_CXXFLAGS = -DGTEST_HAS_PTHREAD=0 endif # Build rules for libraries. lib_LTLIBRARIES = lib/libgtest.la lib/libgtest_main.la lib_libgtest_la_SOURCES = src/gtest-all.cc pkginclude_HEADERS = \ include/gtest/gtest-death-test.h \ include/gtest/gtest-message.h \ include/gtest/gtest-param-test.h \ include/gtest/gtest-printers.h \ include/gtest/gtest-spi.h \ include/gtest/gtest-test-part.h \ include/gtest/gtest-typed-test.h \ include/gtest/gtest.h \ include/gtest/gtest_pred_impl.h \ include/gtest/gtest_prod.h pkginclude_internaldir = $(pkgincludedir)/internal pkginclude_internal_HEADERS = \ include/gtest/internal/gtest-death-test-internal.h \ include/gtest/internal/gtest-filepath.h \ include/gtest/internal/gtest-internal.h \ include/gtest/internal/gtest-linked_ptr.h \ include/gtest/internal/gtest-param-util-generated.h \ include/gtest/internal/gtest-param-util.h \ include/gtest/internal/gtest-port.h \ include/gtest/internal/gtest-string.h \ include/gtest/internal/gtest-tuple.h \ include/gtest/internal/gtest-type-util.h lib_libgtest_main_la_SOURCES = src/gtest_main.cc lib_libgtest_main_la_LIBADD = lib/libgtest.la # Bulid rules for samples and tests. Automake's naming for some of # these variables isn't terribly obvious, so this is a brief # reference: # # TESTS -- Programs run automatically by "make check" # check_PROGRAMS -- Programs built by "make check" but not necessarily run noinst_LTLIBRARIES = samples/libsamples.la samples_libsamples_la_SOURCES = \ samples/sample1.cc \ samples/sample1.h \ samples/sample2.cc \ samples/sample2.h \ samples/sample3-inl.h \ samples/sample4.cc \ samples/sample4.h TESTS= TESTS_ENVIRONMENT = GTEST_SOURCE_DIR="$(srcdir)/test" \ GTEST_BUILD_DIR="$(top_builddir)/test" check_PROGRAMS= # A simple sample on using gtest. TESTS += samples/sample1_unittest check_PROGRAMS += samples/sample1_unittest samples_sample1_unittest_SOURCES = samples/sample1_unittest.cc samples_sample1_unittest_LDADD = lib/libgtest_main.la \ lib/libgtest.la \ samples/libsamples.la # Another sample. It also verifies that libgtest works. TESTS += samples/sample10_unittest check_PROGRAMS += samples/sample10_unittest samples_sample10_unittest_SOURCES = samples/sample10_unittest.cc samples_sample10_unittest_LDADD = lib/libgtest.la # This tests most constructs of gtest and verifies that libgtest_main # and libgtest work. TESTS += test/gtest_all_test check_PROGRAMS += test/gtest_all_test test_gtest_all_test_SOURCES = test/gtest_all_test.cc test_gtest_all_test_LDADD = lib/libgtest_main.la \ lib/libgtest.la # Tests that fused gtest files compile and work. FUSED_GTEST_SRC = \ fused-src/gtest/gtest-all.cc \ fused-src/gtest/gtest.h \ fused-src/gtest/gtest_main.cc TESTS += test/fused_gtest_test check_PROGRAMS += test/fused_gtest_test test_fused_gtest_test_SOURCES = $(FUSED_GTEST_SRC) \ samples/sample1.cc samples/sample1_unittest.cc test_fused_gtest_test_CPPFLAGS = -I"$(srcdir)/fused-src" # Build rules for putting fused Google Test files into the distribution # package. The user can also create those files by manually running # scripts/fuse_gtest_files.py. $(test_fused_gtest_test_SOURCES): fused-gtest fused-gtest: $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) \ $(GTEST_SRC) src/gtest-all.cc src/gtest_main.cc \ scripts/fuse_gtest_files.py mkdir -p "$(srcdir)/fused-src" chmod -R u+w "$(srcdir)/fused-src" rm -f "$(srcdir)/fused-src/gtest/gtest-all.cc" rm -f "$(srcdir)/fused-src/gtest/gtest.h" "$(srcdir)/scripts/fuse_gtest_files.py" "$(srcdir)/fused-src" cp -f "$(srcdir)/src/gtest_main.cc" "$(srcdir)/fused-src/gtest/" maintainer-clean-local: rm -rf "$(srcdir)/fused-src" # Death tests may produce core dumps in the build directory. In case # this happens, clean them to keep distcleancheck happy. CLEANFILES = core # Disables 'make install' as installing a compiled version of Google # Test can lead to undefined behavior due to violation of the # One-Definition Rule. install-exec-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Test into your build system." false install-data-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Test into your build system." false synergy-1.4.12-Source/tools/gtest-1.6.0/Makefile.in0000600000175000017500000015717711561126632021527 0ustar synergysynergy# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # Automake file VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ TESTS = samples/sample1_unittest$(EXEEXT) \ samples/sample10_unittest$(EXEEXT) \ test/gtest_all_test$(EXEEXT) test/fused_gtest_test$(EXEEXT) check_PROGRAMS = samples/sample1_unittest$(EXEEXT) \ samples/sample10_unittest$(EXEEXT) \ test/gtest_all_test$(EXEEXT) test/fused_gtest_test$(EXEEXT) subdir = . DIST_COMMON = README $(am__configure_deps) $(pkginclude_HEADERS) \ $(pkginclude_internal_HEADERS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(top_srcdir)/build-aux/config.h.in \ $(top_srcdir)/configure $(top_srcdir)/scripts/gtest-config.in \ COPYING build-aux/config.guess build-aux/config.sub \ build-aux/depcomp build-aux/install-sh build-aux/ltmain.sh \ build-aux/missing ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/m4/acx_pthread.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/build-aux/config.h CONFIG_CLEAN_FILES = scripts/gtest-config CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(m4datadir)" \ "$(DESTDIR)$(pkgincludedir)" \ "$(DESTDIR)$(pkginclude_internaldir)" LTLIBRARIES = $(lib_LTLIBRARIES) $(noinst_LTLIBRARIES) lib_libgtest_la_LIBADD = am__dirstamp = $(am__leading_dot)dirstamp am_lib_libgtest_la_OBJECTS = src/gtest-all.lo lib_libgtest_la_OBJECTS = $(am_lib_libgtest_la_OBJECTS) lib_libgtest_main_la_DEPENDENCIES = lib/libgtest.la am_lib_libgtest_main_la_OBJECTS = src/gtest_main.lo lib_libgtest_main_la_OBJECTS = $(am_lib_libgtest_main_la_OBJECTS) samples_libsamples_la_LIBADD = am_samples_libsamples_la_OBJECTS = samples/sample1.lo \ samples/sample2.lo samples/sample4.lo samples_libsamples_la_OBJECTS = $(am_samples_libsamples_la_OBJECTS) am_samples_sample10_unittest_OBJECTS = \ samples/sample10_unittest.$(OBJEXT) samples_sample10_unittest_OBJECTS = \ $(am_samples_sample10_unittest_OBJECTS) samples_sample10_unittest_DEPENDENCIES = lib/libgtest.la am_samples_sample1_unittest_OBJECTS = \ samples/sample1_unittest.$(OBJEXT) samples_sample1_unittest_OBJECTS = \ $(am_samples_sample1_unittest_OBJECTS) samples_sample1_unittest_DEPENDENCIES = lib/libgtest_main.la \ lib/libgtest.la samples/libsamples.la am__objects_1 = \ fused-src/gtest/test_fused_gtest_test-gtest-all.$(OBJEXT) \ fused-src/gtest/test_fused_gtest_test-gtest_main.$(OBJEXT) am_test_fused_gtest_test_OBJECTS = $(am__objects_1) \ samples/test_fused_gtest_test-sample1.$(OBJEXT) \ samples/test_fused_gtest_test-sample1_unittest.$(OBJEXT) test_fused_gtest_test_OBJECTS = $(am_test_fused_gtest_test_OBJECTS) test_fused_gtest_test_LDADD = $(LDADD) am_test_gtest_all_test_OBJECTS = test/gtest_all_test.$(OBJEXT) test_gtest_all_test_OBJECTS = $(am_test_gtest_all_test_OBJECTS) test_gtest_all_test_DEPENDENCIES = lib/libgtest_main.la \ lib/libgtest.la DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/build-aux depcomp = $(SHELL) $(top_srcdir)/build-aux/depcomp am__depfiles_maybe = depfiles am__mv = mv -f CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) CXXLD = $(CXX) CXXLINK = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=link $(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) $(AM_LDFLAGS) \ $(LDFLAGS) -o $@ COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \ $(LDFLAGS) -o $@ SOURCES = $(lib_libgtest_la_SOURCES) $(lib_libgtest_main_la_SOURCES) \ $(samples_libsamples_la_SOURCES) \ $(samples_sample10_unittest_SOURCES) \ $(samples_sample1_unittest_SOURCES) \ $(test_fused_gtest_test_SOURCES) \ $(test_gtest_all_test_SOURCES) DIST_SOURCES = $(lib_libgtest_la_SOURCES) \ $(lib_libgtest_main_la_SOURCES) \ $(samples_libsamples_la_SOURCES) \ $(samples_sample10_unittest_SOURCES) \ $(samples_sample1_unittest_SOURCES) \ $(test_fused_gtest_test_SOURCES) \ $(test_gtest_all_test_SOURCES) DATA = $(m4data_DATA) HEADERS = $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) ETAGS = etags CTAGS = ctags am__tty_colors = \ red=; grn=; lgn=; blu=; std= DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ { test ! -d "$(distdir)" \ || { find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -fr "$(distdir)"; }; } DIST_ARCHIVES = $(distdir).tar.gz $(distdir).tar.bz2 $(distdir).zip GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PTHREAD_CC = @PTHREAD_CC@ PTHREAD_CFLAGS = @PTHREAD_CFLAGS@ PTHREAD_LIBS = @PTHREAD_LIBS@ PYTHON = @PYTHON@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ acx_pthread_config = @acx_pthread_config@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ ACLOCAL_AMFLAGS = -I m4 # Nonstandard package files for distribution # Sample files that we don't compile. # C++ test files that we don't compile directly. # Python tests that we don't run. # CMake script # MSVC project files # xcode project files # xcode sample files # C++Builder project files EXTRA_DIST = CHANGES CONTRIBUTORS \ include/gtest/gtest-param-test.h.pump \ include/gtest/internal/gtest-param-util-generated.h.pump \ include/gtest/internal/gtest-tuple.h.pump \ include/gtest/internal/gtest-type-util.h.pump make/Makefile \ scripts/fuse_gtest_files.py scripts/gen_gtest_pred_impl.py \ scripts/pump.py scripts/test/Makefile $(GTEST_SRC) \ samples/prime_tables.h samples/sample2_unittest.cc \ samples/sample3_unittest.cc samples/sample4_unittest.cc \ samples/sample5_unittest.cc samples/sample6_unittest.cc \ samples/sample7_unittest.cc samples/sample8_unittest.cc \ samples/sample9_unittest.cc test/gtest-death-test_ex_test.cc \ test/gtest-death-test_test.cc test/gtest-filepath_test.cc \ test/gtest-linked_ptr_test.cc test/gtest-listener_test.cc \ test/gtest-message_test.cc test/gtest-options_test.cc \ test/gtest-param-test2_test.cc test/gtest-param-test2_test.cc \ test/gtest-param-test_test.cc test/gtest-param-test_test.cc \ test/gtest-param-test_test.h test/gtest-port_test.cc \ test/gtest-printers_test.cc test/gtest-test-part_test.cc \ test/gtest-tuple_test.cc test/gtest-typed-test2_test.cc \ test/gtest-typed-test_test.cc test/gtest-typed-test_test.h \ test/gtest-unittest-api_test.cc \ test/gtest_break_on_failure_unittest_.cc \ test/gtest_catch_exceptions_test_.cc test/gtest_color_test_.cc \ test/gtest_env_var_test_.cc test/gtest_environment_test.cc \ test/gtest_filter_unittest_.cc test/gtest_help_test_.cc \ test/gtest_list_tests_unittest_.cc test/gtest_main_unittest.cc \ test/gtest_no_test_unittest.cc test/gtest_output_test_.cc \ test/gtest_pred_impl_unittest.cc test/gtest_prod_test.cc \ test/gtest_repeat_test.cc test/gtest_shuffle_test_.cc \ test/gtest_sole_header_test.cc test/gtest_stress_test.cc \ test/gtest_throw_on_failure_ex_test.cc \ test/gtest_throw_on_failure_test_.cc \ test/gtest_uninitialized_test_.cc test/gtest_unittest.cc \ test/gtest_unittest.cc test/gtest_xml_outfile1_test_.cc \ test/gtest_xml_outfile2_test_.cc \ test/gtest_xml_output_unittest_.cc test/production.cc \ test/production.h test/gtest_break_on_failure_unittest.py \ test/gtest_catch_exceptions_test.py test/gtest_color_test.py \ test/gtest_env_var_test.py test/gtest_filter_unittest.py \ test/gtest_help_test.py test/gtest_list_tests_unittest.py \ test/gtest_output_test.py \ test/gtest_output_test_golden_lin.txt \ test/gtest_shuffle_test.py test/gtest_test_utils.py \ test/gtest_throw_on_failure_test.py \ test/gtest_uninitialized_test.py \ test/gtest_xml_outfiles_test.py \ test/gtest_xml_output_unittest.py test/gtest_xml_test_utils.py \ CMakeLists.txt cmake/internal_utils.cmake msvc/gtest-md.sln \ msvc/gtest-md.vcproj msvc/gtest.sln msvc/gtest.vcproj \ msvc/gtest_main-md.vcproj msvc/gtest_main.vcproj \ msvc/gtest_prod_test-md.vcproj msvc/gtest_prod_test.vcproj \ msvc/gtest_unittest-md.vcproj msvc/gtest_unittest.vcproj \ xcode/Config/DebugProject.xcconfig \ xcode/Config/FrameworkTarget.xcconfig \ xcode/Config/General.xcconfig \ xcode/Config/ReleaseProject.xcconfig \ xcode/Config/StaticLibraryTarget.xcconfig \ xcode/Config/TestTarget.xcconfig xcode/Resources/Info.plist \ xcode/Scripts/runtests.sh xcode/Scripts/versiongenerate.py \ xcode/gtest.xcodeproj/project.pbxproj \ xcode/Samples/FrameworkSample/Info.plist \ xcode/Samples/FrameworkSample/WidgetFramework.xcodeproj/project.pbxproj \ xcode/Samples/FrameworkSample/runtests.sh \ xcode/Samples/FrameworkSample/widget.cc \ xcode/Samples/FrameworkSample/widget.h \ xcode/Samples/FrameworkSample/widget_test.cc \ codegear/gtest.cbproj codegear/gtest.groupproj \ codegear/gtest_all.cc codegear/gtest_link.cc \ codegear/gtest_main.cbproj codegear/gtest_unittest.cbproj \ $(m4data_DATA) # gtest source files that we don't compile directly. They are # #included by gtest-all.cc. GTEST_SRC = \ src/gtest-death-test.cc \ src/gtest-filepath.cc \ src/gtest-internal-inl.h \ src/gtest-port.cc \ src/gtest-printers.cc \ src/gtest-test-part.cc \ src/gtest-typed-test.cc \ src/gtest.cc # Distribute and install M4 macro m4datadir = $(datadir)/aclocal m4data_DATA = m4/gtest.m4 # We define the global AM_CPPFLAGS as everything we compile includes from these # directories. AM_CPPFLAGS = -I$(srcdir) -I$(srcdir)/include @HAVE_PTHREADS_FALSE@AM_CXXFLAGS = -DGTEST_HAS_PTHREAD=0 # Modifies compiler and linker flags for pthreads compatibility. @HAVE_PTHREADS_TRUE@AM_CXXFLAGS = @PTHREAD_CFLAGS@ -DGTEST_HAS_PTHREAD=1 @HAVE_PTHREADS_TRUE@AM_LIBS = @PTHREAD_LIBS@ # Build rules for libraries. lib_LTLIBRARIES = lib/libgtest.la lib/libgtest_main.la lib_libgtest_la_SOURCES = src/gtest-all.cc pkginclude_HEADERS = \ include/gtest/gtest-death-test.h \ include/gtest/gtest-message.h \ include/gtest/gtest-param-test.h \ include/gtest/gtest-printers.h \ include/gtest/gtest-spi.h \ include/gtest/gtest-test-part.h \ include/gtest/gtest-typed-test.h \ include/gtest/gtest.h \ include/gtest/gtest_pred_impl.h \ include/gtest/gtest_prod.h pkginclude_internaldir = $(pkgincludedir)/internal pkginclude_internal_HEADERS = \ include/gtest/internal/gtest-death-test-internal.h \ include/gtest/internal/gtest-filepath.h \ include/gtest/internal/gtest-internal.h \ include/gtest/internal/gtest-linked_ptr.h \ include/gtest/internal/gtest-param-util-generated.h \ include/gtest/internal/gtest-param-util.h \ include/gtest/internal/gtest-port.h \ include/gtest/internal/gtest-string.h \ include/gtest/internal/gtest-tuple.h \ include/gtest/internal/gtest-type-util.h lib_libgtest_main_la_SOURCES = src/gtest_main.cc lib_libgtest_main_la_LIBADD = lib/libgtest.la # Bulid rules for samples and tests. Automake's naming for some of # these variables isn't terribly obvious, so this is a brief # reference: # # TESTS -- Programs run automatically by "make check" # check_PROGRAMS -- Programs built by "make check" but not necessarily run noinst_LTLIBRARIES = samples/libsamples.la samples_libsamples_la_SOURCES = \ samples/sample1.cc \ samples/sample1.h \ samples/sample2.cc \ samples/sample2.h \ samples/sample3-inl.h \ samples/sample4.cc \ samples/sample4.h TESTS_ENVIRONMENT = GTEST_SOURCE_DIR="$(srcdir)/test" \ GTEST_BUILD_DIR="$(top_builddir)/test" samples_sample1_unittest_SOURCES = samples/sample1_unittest.cc samples_sample1_unittest_LDADD = lib/libgtest_main.la \ lib/libgtest.la \ samples/libsamples.la samples_sample10_unittest_SOURCES = samples/sample10_unittest.cc samples_sample10_unittest_LDADD = lib/libgtest.la test_gtest_all_test_SOURCES = test/gtest_all_test.cc test_gtest_all_test_LDADD = lib/libgtest_main.la \ lib/libgtest.la # Tests that fused gtest files compile and work. FUSED_GTEST_SRC = \ fused-src/gtest/gtest-all.cc \ fused-src/gtest/gtest.h \ fused-src/gtest/gtest_main.cc test_fused_gtest_test_SOURCES = $(FUSED_GTEST_SRC) \ samples/sample1.cc samples/sample1_unittest.cc test_fused_gtest_test_CPPFLAGS = -I"$(srcdir)/fused-src" # Death tests may produce core dumps in the build directory. In case # this happens, clean them to keep distcleancheck happy. CLEANFILES = core all: all-am .SUFFIXES: .SUFFIXES: .cc .lo .o .obj am--refresh: @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): build-aux/config.h: build-aux/stamp-h1 @if test ! -f $@; then \ rm -f build-aux/stamp-h1; \ $(MAKE) $(AM_MAKEFLAGS) build-aux/stamp-h1; \ else :; fi build-aux/stamp-h1: $(top_srcdir)/build-aux/config.h.in $(top_builddir)/config.status @rm -f build-aux/stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status build-aux/config.h $(top_srcdir)/build-aux/config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f build-aux/stamp-h1 touch $@ distclean-hdr: -rm -f build-aux/config.h build-aux/stamp-h1 scripts/gtest-config: $(top_builddir)/config.status $(top_srcdir)/scripts/gtest-config.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done clean-noinstLTLIBRARIES: -test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES) @list='$(noinst_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done src/$(am__dirstamp): @$(MKDIR_P) src @: > src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) src/$(DEPDIR) @: > src/$(DEPDIR)/$(am__dirstamp) src/gtest-all.lo: src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp) lib/$(am__dirstamp): @$(MKDIR_P) lib @: > lib/$(am__dirstamp) lib/libgtest.la: $(lib_libgtest_la_OBJECTS) $(lib_libgtest_la_DEPENDENCIES) lib/$(am__dirstamp) $(CXXLINK) -rpath $(libdir) $(lib_libgtest_la_OBJECTS) $(lib_libgtest_la_LIBADD) $(LIBS) src/gtest_main.lo: src/$(am__dirstamp) src/$(DEPDIR)/$(am__dirstamp) lib/libgtest_main.la: $(lib_libgtest_main_la_OBJECTS) $(lib_libgtest_main_la_DEPENDENCIES) lib/$(am__dirstamp) $(CXXLINK) -rpath $(libdir) $(lib_libgtest_main_la_OBJECTS) $(lib_libgtest_main_la_LIBADD) $(LIBS) samples/$(am__dirstamp): @$(MKDIR_P) samples @: > samples/$(am__dirstamp) samples/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) samples/$(DEPDIR) @: > samples/$(DEPDIR)/$(am__dirstamp) samples/sample1.lo: samples/$(am__dirstamp) \ samples/$(DEPDIR)/$(am__dirstamp) samples/sample2.lo: samples/$(am__dirstamp) \ samples/$(DEPDIR)/$(am__dirstamp) samples/sample4.lo: samples/$(am__dirstamp) \ samples/$(DEPDIR)/$(am__dirstamp) samples/libsamples.la: $(samples_libsamples_la_OBJECTS) $(samples_libsamples_la_DEPENDENCIES) samples/$(am__dirstamp) $(CXXLINK) $(samples_libsamples_la_OBJECTS) $(samples_libsamples_la_LIBADD) $(LIBS) clean-checkPROGRAMS: @list='$(check_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list samples/sample10_unittest.$(OBJEXT): samples/$(am__dirstamp) \ samples/$(DEPDIR)/$(am__dirstamp) samples/sample10_unittest$(EXEEXT): $(samples_sample10_unittest_OBJECTS) $(samples_sample10_unittest_DEPENDENCIES) samples/$(am__dirstamp) @rm -f samples/sample10_unittest$(EXEEXT) $(CXXLINK) $(samples_sample10_unittest_OBJECTS) $(samples_sample10_unittest_LDADD) $(LIBS) samples/sample1_unittest.$(OBJEXT): samples/$(am__dirstamp) \ samples/$(DEPDIR)/$(am__dirstamp) samples/sample1_unittest$(EXEEXT): $(samples_sample1_unittest_OBJECTS) $(samples_sample1_unittest_DEPENDENCIES) samples/$(am__dirstamp) @rm -f samples/sample1_unittest$(EXEEXT) $(CXXLINK) $(samples_sample1_unittest_OBJECTS) $(samples_sample1_unittest_LDADD) $(LIBS) fused-src/gtest/$(am__dirstamp): @$(MKDIR_P) fused-src/gtest @: > fused-src/gtest/$(am__dirstamp) fused-src/gtest/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) fused-src/gtest/$(DEPDIR) @: > fused-src/gtest/$(DEPDIR)/$(am__dirstamp) fused-src/gtest/test_fused_gtest_test-gtest-all.$(OBJEXT): \ fused-src/gtest/$(am__dirstamp) \ fused-src/gtest/$(DEPDIR)/$(am__dirstamp) fused-src/gtest/test_fused_gtest_test-gtest_main.$(OBJEXT): \ fused-src/gtest/$(am__dirstamp) \ fused-src/gtest/$(DEPDIR)/$(am__dirstamp) samples/test_fused_gtest_test-sample1.$(OBJEXT): \ samples/$(am__dirstamp) samples/$(DEPDIR)/$(am__dirstamp) samples/test_fused_gtest_test-sample1_unittest.$(OBJEXT): \ samples/$(am__dirstamp) samples/$(DEPDIR)/$(am__dirstamp) test/$(am__dirstamp): @$(MKDIR_P) test @: > test/$(am__dirstamp) test/fused_gtest_test$(EXEEXT): $(test_fused_gtest_test_OBJECTS) $(test_fused_gtest_test_DEPENDENCIES) test/$(am__dirstamp) @rm -f test/fused_gtest_test$(EXEEXT) $(CXXLINK) $(test_fused_gtest_test_OBJECTS) $(test_fused_gtest_test_LDADD) $(LIBS) test/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) test/$(DEPDIR) @: > test/$(DEPDIR)/$(am__dirstamp) test/gtest_all_test.$(OBJEXT): test/$(am__dirstamp) \ test/$(DEPDIR)/$(am__dirstamp) test/gtest_all_test$(EXEEXT): $(test_gtest_all_test_OBJECTS) $(test_gtest_all_test_DEPENDENCIES) test/$(am__dirstamp) @rm -f test/gtest_all_test$(EXEEXT) $(CXXLINK) $(test_gtest_all_test_OBJECTS) $(test_gtest_all_test_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) -rm -f fused-src/gtest/test_fused_gtest_test-gtest-all.$(OBJEXT) -rm -f fused-src/gtest/test_fused_gtest_test-gtest_main.$(OBJEXT) -rm -f samples/sample1.$(OBJEXT) -rm -f samples/sample1.lo -rm -f samples/sample10_unittest.$(OBJEXT) -rm -f samples/sample1_unittest.$(OBJEXT) -rm -f samples/sample2.$(OBJEXT) -rm -f samples/sample2.lo -rm -f samples/sample4.$(OBJEXT) -rm -f samples/sample4.lo -rm -f samples/test_fused_gtest_test-sample1.$(OBJEXT) -rm -f samples/test_fused_gtest_test-sample1_unittest.$(OBJEXT) -rm -f src/gtest-all.$(OBJEXT) -rm -f src/gtest-all.lo -rm -f src/gtest_main.$(OBJEXT) -rm -f src/gtest_main.lo -rm -f test/gtest_all_test.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/sample1.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/sample10_unittest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/sample1_unittest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/sample2.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/sample4.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/test_fused_gtest_test-sample1.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@src/$(DEPDIR)/gtest-all.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@src/$(DEPDIR)/gtest_main.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@test/$(DEPDIR)/gtest_all_test.Po@am__quote@ .cc.o: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ $< .cc.obj: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cc.lo: @am__fastdepCXX_TRUE@ depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCXX_TRUE@ $(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(LTCXXCOMPILE) -c -o $@ $< fused-src/gtest/test_fused_gtest_test-gtest-all.o: fused-src/gtest/gtest-all.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/gtest/test_fused_gtest_test-gtest-all.o -MD -MP -MF fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Tpo -c -o fused-src/gtest/test_fused_gtest_test-gtest-all.o `test -f 'fused-src/gtest/gtest-all.cc' || echo '$(srcdir)/'`fused-src/gtest/gtest-all.cc @am__fastdepCXX_TRUE@ $(am__mv) fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Tpo fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gtest/gtest-all.cc' object='fused-src/gtest/test_fused_gtest_test-gtest-all.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/gtest/test_fused_gtest_test-gtest-all.o `test -f 'fused-src/gtest/gtest-all.cc' || echo '$(srcdir)/'`fused-src/gtest/gtest-all.cc fused-src/gtest/test_fused_gtest_test-gtest-all.obj: fused-src/gtest/gtest-all.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/gtest/test_fused_gtest_test-gtest-all.obj -MD -MP -MF fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Tpo -c -o fused-src/gtest/test_fused_gtest_test-gtest-all.obj `if test -f 'fused-src/gtest/gtest-all.cc'; then $(CYGPATH_W) 'fused-src/gtest/gtest-all.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gtest/gtest-all.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Tpo fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest-all.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gtest/gtest-all.cc' object='fused-src/gtest/test_fused_gtest_test-gtest-all.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/gtest/test_fused_gtest_test-gtest-all.obj `if test -f 'fused-src/gtest/gtest-all.cc'; then $(CYGPATH_W) 'fused-src/gtest/gtest-all.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gtest/gtest-all.cc'; fi` fused-src/gtest/test_fused_gtest_test-gtest_main.o: fused-src/gtest/gtest_main.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/gtest/test_fused_gtest_test-gtest_main.o -MD -MP -MF fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Tpo -c -o fused-src/gtest/test_fused_gtest_test-gtest_main.o `test -f 'fused-src/gtest/gtest_main.cc' || echo '$(srcdir)/'`fused-src/gtest/gtest_main.cc @am__fastdepCXX_TRUE@ $(am__mv) fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Tpo fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gtest/gtest_main.cc' object='fused-src/gtest/test_fused_gtest_test-gtest_main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/gtest/test_fused_gtest_test-gtest_main.o `test -f 'fused-src/gtest/gtest_main.cc' || echo '$(srcdir)/'`fused-src/gtest/gtest_main.cc fused-src/gtest/test_fused_gtest_test-gtest_main.obj: fused-src/gtest/gtest_main.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT fused-src/gtest/test_fused_gtest_test-gtest_main.obj -MD -MP -MF fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Tpo -c -o fused-src/gtest/test_fused_gtest_test-gtest_main.obj `if test -f 'fused-src/gtest/gtest_main.cc'; then $(CYGPATH_W) 'fused-src/gtest/gtest_main.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gtest/gtest_main.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Tpo fused-src/gtest/$(DEPDIR)/test_fused_gtest_test-gtest_main.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='fused-src/gtest/gtest_main.cc' object='fused-src/gtest/test_fused_gtest_test-gtest_main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o fused-src/gtest/test_fused_gtest_test-gtest_main.obj `if test -f 'fused-src/gtest/gtest_main.cc'; then $(CYGPATH_W) 'fused-src/gtest/gtest_main.cc'; else $(CYGPATH_W) '$(srcdir)/fused-src/gtest/gtest_main.cc'; fi` samples/test_fused_gtest_test-sample1.o: samples/sample1.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT samples/test_fused_gtest_test-sample1.o -MD -MP -MF samples/$(DEPDIR)/test_fused_gtest_test-sample1.Tpo -c -o samples/test_fused_gtest_test-sample1.o `test -f 'samples/sample1.cc' || echo '$(srcdir)/'`samples/sample1.cc @am__fastdepCXX_TRUE@ $(am__mv) samples/$(DEPDIR)/test_fused_gtest_test-sample1.Tpo samples/$(DEPDIR)/test_fused_gtest_test-sample1.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='samples/sample1.cc' object='samples/test_fused_gtest_test-sample1.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o samples/test_fused_gtest_test-sample1.o `test -f 'samples/sample1.cc' || echo '$(srcdir)/'`samples/sample1.cc samples/test_fused_gtest_test-sample1.obj: samples/sample1.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT samples/test_fused_gtest_test-sample1.obj -MD -MP -MF samples/$(DEPDIR)/test_fused_gtest_test-sample1.Tpo -c -o samples/test_fused_gtest_test-sample1.obj `if test -f 'samples/sample1.cc'; then $(CYGPATH_W) 'samples/sample1.cc'; else $(CYGPATH_W) '$(srcdir)/samples/sample1.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) samples/$(DEPDIR)/test_fused_gtest_test-sample1.Tpo samples/$(DEPDIR)/test_fused_gtest_test-sample1.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='samples/sample1.cc' object='samples/test_fused_gtest_test-sample1.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o samples/test_fused_gtest_test-sample1.obj `if test -f 'samples/sample1.cc'; then $(CYGPATH_W) 'samples/sample1.cc'; else $(CYGPATH_W) '$(srcdir)/samples/sample1.cc'; fi` samples/test_fused_gtest_test-sample1_unittest.o: samples/sample1_unittest.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT samples/test_fused_gtest_test-sample1_unittest.o -MD -MP -MF samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Tpo -c -o samples/test_fused_gtest_test-sample1_unittest.o `test -f 'samples/sample1_unittest.cc' || echo '$(srcdir)/'`samples/sample1_unittest.cc @am__fastdepCXX_TRUE@ $(am__mv) samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Tpo samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='samples/sample1_unittest.cc' object='samples/test_fused_gtest_test-sample1_unittest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o samples/test_fused_gtest_test-sample1_unittest.o `test -f 'samples/sample1_unittest.cc' || echo '$(srcdir)/'`samples/sample1_unittest.cc samples/test_fused_gtest_test-sample1_unittest.obj: samples/sample1_unittest.cc @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT samples/test_fused_gtest_test-sample1_unittest.obj -MD -MP -MF samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Tpo -c -o samples/test_fused_gtest_test-sample1_unittest.obj `if test -f 'samples/sample1_unittest.cc'; then $(CYGPATH_W) 'samples/sample1_unittest.cc'; else $(CYGPATH_W) '$(srcdir)/samples/sample1_unittest.cc'; fi` @am__fastdepCXX_TRUE@ $(am__mv) samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Tpo samples/$(DEPDIR)/test_fused_gtest_test-sample1_unittest.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='samples/sample1_unittest.cc' object='samples/test_fused_gtest_test-sample1_unittest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(test_fused_gtest_test_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o samples/test_fused_gtest_test-sample1_unittest.obj `if test -f 'samples/sample1_unittest.cc'; then $(CYGPATH_W) 'samples/sample1_unittest.cc'; else $(CYGPATH_W) '$(srcdir)/samples/sample1_unittest.cc'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs -rm -rf lib/.libs lib/_libs -rm -rf samples/.libs samples/_libs -rm -rf src/.libs src/_libs -rm -rf test/.libs test/_libs distclean-libtool: -rm -f libtool config.lt install-m4dataDATA: $(m4data_DATA) @$(NORMAL_INSTALL) test -z "$(m4datadir)" || $(MKDIR_P) "$(DESTDIR)$(m4datadir)" @list='$(m4data_DATA)'; test -n "$(m4datadir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(m4datadir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(m4datadir)" || exit $$?; \ done uninstall-m4dataDATA: @$(NORMAL_UNINSTALL) @list='$(m4data_DATA)'; test -n "$(m4datadir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(m4datadir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(m4datadir)" && rm -f $$files install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgincludedir)" || exit $$?; \ done uninstall-pkgincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(pkgincludedir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(pkgincludedir)" && rm -f $$files install-pkginclude_internalHEADERS: $(pkginclude_internal_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkginclude_internaldir)" || $(MKDIR_P) "$(DESTDIR)$(pkginclude_internaldir)" @list='$(pkginclude_internal_HEADERS)'; test -n "$(pkginclude_internaldir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkginclude_internaldir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkginclude_internaldir)" || exit $$?; \ done uninstall-pkginclude_internalHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_internal_HEADERS)'; test -n "$(pkginclude_internaldir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(pkginclude_internaldir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(pkginclude_internaldir)" && rm -f $$files ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ echo "$$grn$$dashes"; \ else \ echo "$$red$$dashes"; \ fi; \ echo "$$banner"; \ test -z "$$skipped" || echo "$$skipped"; \ test -z "$$report" || echo "$$report"; \ echo "$$dashes$$std"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | xz -c >$(distdir).tar.xz $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @$(am__cd) '$(distuninstallcheck_dir)' \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am $(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS) $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-am all-am: Makefile $(LTLIBRARIES) $(DATA) $(HEADERS) installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(m4datadir)" "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkginclude_internaldir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) -rm -f fused-src/gtest/$(DEPDIR)/$(am__dirstamp) -rm -f fused-src/gtest/$(am__dirstamp) -rm -f lib/$(am__dirstamp) -rm -f samples/$(DEPDIR)/$(am__dirstamp) -rm -f samples/$(am__dirstamp) -rm -f src/$(DEPDIR)/$(am__dirstamp) -rm -f src/$(am__dirstamp) -rm -f test/$(DEPDIR)/$(am__dirstamp) -rm -f test/$(am__dirstamp) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-checkPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool clean-noinstLTLIBRARIES mostlyclean-am distclean: distclean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf fused-src/gtest/$(DEPDIR) samples/$(DEPDIR) src/$(DEPDIR) test/$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-libtool distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-data-local install-m4dataDATA \ install-pkgincludeHEADERS install-pkginclude_internalHEADERS install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-exec-local install-libLTLIBRARIES install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf fused-src/gtest/$(DEPDIR) samples/$(DEPDIR) src/$(DEPDIR) test/$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic \ maintainer-clean-local mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-libLTLIBRARIES uninstall-m4dataDATA \ uninstall-pkgincludeHEADERS \ uninstall-pkginclude_internalHEADERS .MAKE: check-am install-am install-strip .PHONY: CTAGS GTAGS all all-am am--refresh check check-TESTS check-am \ clean clean-checkPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool clean-noinstLTLIBRARIES ctags dist dist-all \ dist-bzip2 dist-gzip dist-lzma dist-shar dist-tarZ dist-xz \ dist-zip distcheck distclean distclean-compile \ distclean-generic distclean-hdr distclean-libtool \ distclean-tags distcleancheck distdir distuninstallcheck dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-data-local install-dvi \ install-dvi-am install-exec install-exec-am install-exec-local \ install-html install-html-am install-info install-info-am \ install-libLTLIBRARIES install-m4dataDATA install-man \ install-pdf install-pdf-am install-pkgincludeHEADERS \ install-pkginclude_internalHEADERS install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic \ maintainer-clean-local mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags uninstall uninstall-am uninstall-libLTLIBRARIES \ uninstall-m4dataDATA uninstall-pkgincludeHEADERS \ uninstall-pkginclude_internalHEADERS # Build rules for putting fused Google Test files into the distribution # package. The user can also create those files by manually running # scripts/fuse_gtest_files.py. $(test_fused_gtest_test_SOURCES): fused-gtest fused-gtest: $(pkginclude_HEADERS) $(pkginclude_internal_HEADERS) \ $(GTEST_SRC) src/gtest-all.cc src/gtest_main.cc \ scripts/fuse_gtest_files.py mkdir -p "$(srcdir)/fused-src" chmod -R u+w "$(srcdir)/fused-src" rm -f "$(srcdir)/fused-src/gtest/gtest-all.cc" rm -f "$(srcdir)/fused-src/gtest/gtest.h" "$(srcdir)/scripts/fuse_gtest_files.py" "$(srcdir)/fused-src" cp -f "$(srcdir)/src/gtest_main.cc" "$(srcdir)/fused-src/gtest/" maintainer-clean-local: rm -rf "$(srcdir)/fused-src" # Disables 'make install' as installing a compiled version of Google # Test can lead to undefined behavior due to violation of the # One-Definition Rule. install-exec-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Test into your build system." false install-data-local: echo "'make install' is dangerous and not supported. Instead, see README for how to integrate Google Test into your build system." false # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: synergy-1.4.12-Source/tools/gtest-1.6.0/make/Makefile0000600000175000017500000000505211561126632022017 0ustar synergysynergy# A sample Makefile for building Google Test and using it in user # tests. Please tweak it to suit your environment and project. You # may want to move it to your project's root directory. # # SYNOPSIS: # # make [all] - makes everything. # make TARGET - makes the given target. # make clean - removes all files generated by make. # Please tweak the following variable definitions as needed by your # project, except GTEST_HEADERS, which you can use in your own targets # but shouldn't modify. # Points to the root of Google Test, relative to where this file is. # Remember to tweak this if you move this file. GTEST_DIR = .. # Where to find user code. USER_DIR = ../samples # Flags passed to the preprocessor. CPPFLAGS += -I$(GTEST_DIR)/include # Flags passed to the C++ compiler. CXXFLAGS += -g -Wall -Wextra # All tests produced by this Makefile. Remember to add new tests you # created to the list. TESTS = sample1_unittest # All Google Test headers. Usually you shouldn't change this # definition. GTEST_HEADERS = $(GTEST_DIR)/include/gtest/*.h \ $(GTEST_DIR)/include/gtest/internal/*.h # House-keeping build targets. all : $(TESTS) clean : rm -f $(TESTS) gtest.a gtest_main.a *.o # Builds gtest.a and gtest_main.a. # Usually you shouldn't tweak such internal variables, indicated by a # trailing _. GTEST_SRCS_ = $(GTEST_DIR)/src/*.cc $(GTEST_DIR)/src/*.h $(GTEST_HEADERS) # For simplicity and to avoid depending on Google Test's # implementation details, the dependencies specified below are # conservative and not optimized. This is fine as Google Test # compiles fast and for ordinary users its source rarely changes. gtest-all.o : $(GTEST_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) $(CXXFLAGS) -c \ $(GTEST_DIR)/src/gtest-all.cc gtest_main.o : $(GTEST_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) $(CXXFLAGS) -c \ $(GTEST_DIR)/src/gtest_main.cc gtest.a : gtest-all.o $(AR) $(ARFLAGS) $@ $^ gtest_main.a : gtest-all.o gtest_main.o $(AR) $(ARFLAGS) $@ $^ # Builds a sample test. A test should link with either gtest.a or # gtest_main.a, depending on whether it defines its own main() # function. sample1.o : $(USER_DIR)/sample1.cc $(USER_DIR)/sample1.h $(GTEST_HEADERS) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(USER_DIR)/sample1.cc sample1_unittest.o : $(USER_DIR)/sample1_unittest.cc \ $(USER_DIR)/sample1.h $(GTEST_HEADERS) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(USER_DIR)/sample1_unittest.cc sample1_unittest : sample1.o sample1_unittest.o gtest_main.a $(CXX) $(CPPFLAGS) $(CXXFLAGS) -lpthread $^ -o $@ synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/0000700000175000017500000000000012140644175020407 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest-md.sln0000600000175000017500000000463011561126632022655 0ustar synergysynergyMicrosoft Visual Studio Solution File, Format Version 8.00 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest-md", "gtest-md.vcproj", "{C8F6C172-56F2-4E76-B5FA-C3B423B31BE8}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_main-md", "gtest_main-md.vcproj", "{3AF54C8A-10BF-4332-9147-F68ED9862033}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_prod_test-md", "gtest_prod_test-md.vcproj", "{24848551-EF4F-47E8-9A9D-EA4D49BC3ECB}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_unittest-md", "gtest_unittest-md.vcproj", "{4D9FDFB5-986A-4139-823C-F4EE0ED481A2}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Global GlobalSection(SolutionConfiguration) = preSolution Debug = Debug Release = Release EndGlobalSection GlobalSection(ProjectConfiguration) = postSolution {C8F6C172-56F2-4E76-B5FA-C3B423B31BE8}.Debug.ActiveCfg = Debug|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE8}.Debug.Build.0 = Debug|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE8}.Release.ActiveCfg = Release|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE8}.Release.Build.0 = Release|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862033}.Debug.ActiveCfg = Debug|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862033}.Debug.Build.0 = Debug|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862033}.Release.ActiveCfg = Release|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862033}.Release.Build.0 = Release|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECB}.Debug.ActiveCfg = Debug|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECB}.Debug.Build.0 = Debug|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECB}.Release.ActiveCfg = Release|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECB}.Release.Build.0 = Release|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A2}.Debug.ActiveCfg = Debug|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A2}.Debug.Build.0 = Debug|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A2}.Release.ActiveCfg = Release|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A2}.Release.Build.0 = Release|Win32 EndGlobalSection GlobalSection(ExtensibilityGlobals) = postSolution EndGlobalSection GlobalSection(ExtensibilityAddIns) = postSolution EndGlobalSection EndGlobal synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest-md.vcproj0000600000175000017500000000645611561126632023374 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest.sln0000600000175000017500000000460011561126632022254 0ustar synergysynergyMicrosoft Visual Studio Solution File, Format Version 8.00 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest", "gtest.vcproj", "{C8F6C172-56F2-4E76-B5FA-C3B423B31BE7}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_main", "gtest_main.vcproj", "{3AF54C8A-10BF-4332-9147-F68ED9862032}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_unittest", "gtest_unittest.vcproj", "{4D9FDFB5-986A-4139-823C-F4EE0ED481A1}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "gtest_prod_test", "gtest_prod_test.vcproj", "{24848551-EF4F-47E8-9A9D-EA4D49BC3ECA}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Global GlobalSection(SolutionConfiguration) = preSolution Debug = Debug Release = Release EndGlobalSection GlobalSection(ProjectConfiguration) = postSolution {C8F6C172-56F2-4E76-B5FA-C3B423B31BE7}.Debug.ActiveCfg = Debug|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE7}.Debug.Build.0 = Debug|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE7}.Release.ActiveCfg = Release|Win32 {C8F6C172-56F2-4E76-B5FA-C3B423B31BE7}.Release.Build.0 = Release|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862032}.Debug.ActiveCfg = Debug|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862032}.Debug.Build.0 = Debug|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862032}.Release.ActiveCfg = Release|Win32 {3AF54C8A-10BF-4332-9147-F68ED9862032}.Release.Build.0 = Release|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A1}.Debug.ActiveCfg = Debug|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A1}.Debug.Build.0 = Debug|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A1}.Release.ActiveCfg = Release|Win32 {4D9FDFB5-986A-4139-823C-F4EE0ED481A1}.Release.Build.0 = Release|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECA}.Debug.ActiveCfg = Debug|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECA}.Debug.Build.0 = Debug|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECA}.Release.ActiveCfg = Release|Win32 {24848551-EF4F-47E8-9A9D-EA4D49BC3ECA}.Release.Build.0 = Release|Win32 EndGlobalSection GlobalSection(ExtensibilityGlobals) = postSolution EndGlobalSection GlobalSection(ExtensibilityAddIns) = postSolution EndGlobalSection EndGlobal synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest.vcproj0000600000175000017500000000645311561126632022773 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_main-md.vcproj0000600000175000017500000000667211561126632024400 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_main.vcproj0000600000175000017500000000666411561126632024003 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_prod_test-md.vcproj0000600000175000017500000001064311561126632025450 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_prod_test.vcproj0000600000175000017500000001063511561126632025053 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_unittest-md.vcproj0000600000175000017500000000765111561126632025331 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/msvc/gtest_unittest.vcproj0000600000175000017500000000764311561126632024734 0ustar synergysynergy synergy-1.4.12-Source/tools/gtest-1.6.0/README0000600000175000017500000003613211561126632020325 0ustar synergysynergyGoogle C++ Testing Framework ============================ http://code.google.com/p/googletest/ Overview -------- Google's framework for writing C++ tests on a variety of platforms (Linux, Mac OS X, Windows, Windows CE, Symbian, etc). Based on the xUnit architecture. Supports automatic test discovery, a rich set of assertions, user-defined assertions, death tests, fatal and non-fatal failures, various options for running the tests, and XML test report generation. Please see the project page above for more information as well as the mailing list for questions, discussions, and development. There is also an IRC channel on OFTC (irc.oftc.net) #gtest available. Please join us! Requirements for End Users -------------------------- Google Test is designed to have fairly minimal requirements to build and use with your projects, but there are some. Currently, we support Linux, Windows, Mac OS X, and Cygwin. We will also make our best effort to support other platforms (e.g. Solaris, AIX, and z/OS). However, since core members of the Google Test project have no access to these platforms, Google Test may have outstanding issues there. If you notice any problems on your platform, please notify googletestframework@googlegroups.com. Patches for fixing them are even more welcome! ### Linux Requirements ### These are the base requirements to build and use Google Test from a source package (as described below): * GNU-compatible Make or gmake * POSIX-standard shell * POSIX(-2) Regular Expressions (regex.h) * A C++98-standard-compliant compiler ### Windows Requirements ### * Microsoft Visual C++ 7.1 or newer ### Cygwin Requirements ### * Cygwin 1.5.25-14 or newer ### Mac OS X Requirements ### * Mac OS X 10.4 Tiger or newer * Developer Tools Installed Also, you'll need CMake 2.6.4 or higher if you want to build the samples using the provided CMake script, regardless of the platform. Requirements for Contributors ----------------------------- We welcome patches. If you plan to contribute a patch, you need to build Google Test and its own tests from an SVN checkout (described below), which has further requirements: * Python version 2.3 or newer (for running some of the tests and re-generating certain source files from templates) * CMake 2.6.4 or newer Getting the Source ------------------ There are two primary ways of getting Google Test's source code: you can download a stable source release in your preferred archive format, or directly check out the source from our Subversion (SVN) repositary. The SVN checkout requires a few extra steps and some extra software packages on your system, but lets you track the latest development and make patches much more easily, so we highly encourage it. ### Source Package ### Google Test is released in versioned source packages which can be downloaded from the download page [1]. Several different archive formats are provided, but the only difference is the tools used to manipulate them, and the size of the resulting file. Download whichever you are most comfortable with. [1] http://code.google.com/p/googletest/downloads/list Once the package is downloaded, expand it using whichever tools you prefer for that type. This will result in a new directory with the name "gtest-X.Y.Z" which contains all of the source code. Here are some examples on Linux: tar -xvzf gtest-X.Y.Z.tar.gz tar -xvjf gtest-X.Y.Z.tar.bz2 unzip gtest-X.Y.Z.zip ### SVN Checkout ### To check out the main branch (also known as the "trunk") of Google Test, run the following Subversion command: svn checkout http://googletest.googlecode.com/svn/trunk/ gtest-svn Setting up the Build -------------------- To build Google Test and your tests that use it, you need to tell your build system where to find its headers and source files. The exact way to do it depends on which build system you use, and is usually straightforward. ### Generic Build Instructions ### Suppose you put Google Test in directory ${GTEST_DIR}. To build it, create a library build target (or a project as called by Visual Studio and Xcode) to compile ${GTEST_DIR}/src/gtest-all.cc with ${GTEST_DIR}/include and ${GTEST_DIR} in the header search path. Assuming a Linux-like system and gcc, something like the following will do: g++ -I${GTEST_DIR}/include -I${GTEST_DIR} -c ${GTEST_DIR}/src/gtest-all.cc ar -rv libgtest.a gtest-all.o Next, you should compile your test source file with ${GTEST_DIR}/include in the header search path, and link it with gtest and any other necessary libraries: g++ -I${GTEST_DIR}/include path/to/your_test.cc libgtest.a -o your_test As an example, the make/ directory contains a Makefile that you can use to build Google Test on systems where GNU make is available (e.g. Linux, Mac OS X, and Cygwin). It doesn't try to build Google Test's own tests. Instead, it just builds the Google Test library and a sample test. You can use it as a starting point for your own build script. If the default settings are correct for your environment, the following commands should succeed: cd ${GTEST_DIR}/make make ./sample1_unittest If you see errors, try to tweak the contents of make/Makefile to make them go away. There are instructions in make/Makefile on how to do it. ### Using CMake ### Google Test comes with a CMake build script (CMakeLists.txt) that can be used on a wide range of platforms ("C" stands for cross-platofrm.). If you don't have CMake installed already, you can download it for free from http://www.cmake.org/. CMake works by generating native makefiles or build projects that can be used in the compiler environment of your choice. The typical workflow starts with: mkdir mybuild # Create a directory to hold the build output. cd mybuild cmake ${GTEST_DIR} # Generate native build scripts. If you want to build Google Test's samples, you should replace the last command with cmake -Dgtest_build_samples=ON ${GTEST_DIR} If you are on a *nix system, you should now see a Makefile in the current directory. Just type 'make' to build gtest. If you use Windows and have Vistual Studio installed, a gtest.sln file and several .vcproj files will be created. You can then build them using Visual Studio. On Mac OS X with Xcode installed, a .xcodeproj file will be generated. ### Legacy Build Scripts ### Before settling on CMake, we have been providing hand-maintained build projects/scripts for Visual Studio, Xcode, and Autotools. While we continue to provide them for convenience, they are not actively maintained any more. We highly recommend that you follow the instructions in the previous two sections to integrate Google Test with your existing build system. If you still need to use the legacy build scripts, here's how: The msvc\ folder contains two solutions with Visual C++ projects. Open the gtest.sln or gtest-md.sln file using Visual Studio, and you are ready to build Google Test the same way you build any Visual Studio project. Files that have names ending with -md use DLL versions of Microsoft runtime libraries (the /MD or the /MDd compiler option). Files without that suffix use static versions of the runtime libraries (the /MT or the /MTd option). Please note that one must use the same option to compile both gtest and the test code. If you use Visual Studio 2005 or above, we recommend the -md version as /MD is the default for new projects in these versions of Visual Studio. On Mac OS X, open the gtest.xcodeproj in the xcode/ folder using Xcode. Build the "gtest" target. The universal binary framework will end up in your selected build directory (selected in the Xcode "Preferences..." -> "Building" pane and defaults to xcode/build). Alternatively, at the command line, enter: xcodebuild This will build the "Release" configuration of gtest.framework in your default build location. See the "xcodebuild" man page for more information about building different configurations and building in different locations. Tweaking Google Test -------------------- Google Test can be used in diverse environments. The default configuration may not work (or may not work well) out of the box in some environments. However, you can easily tweak Google Test by defining control macros on the compiler command line. Generally, these macros are named like GTEST_XYZ and you define them to either 1 or 0 to enable or disable a certain feature. We list the most frequently used macros below. For a complete list, see file include/gtest/internal/gtest-port.h. ### Choosing a TR1 Tuple Library ### Some Google Test features require the C++ Technical Report 1 (TR1) tuple library, which is not yet available with all compilers. The good news is that Google Test implements a subset of TR1 tuple that's enough for its own need, and will automatically use this when the compiler doesn't provide TR1 tuple. Usually you don't need to care about which tuple library Google Test uses. However, if your project already uses TR1 tuple, you need to tell Google Test to use the same TR1 tuple library the rest of your project uses, or the two tuple implementations will clash. To do that, add -DGTEST_USE_OWN_TR1_TUPLE=0 to the compiler flags while compiling Google Test and your tests. If you want to force Google Test to use its own tuple library, just add -DGTEST_USE_OWN_TR1_TUPLE=1 to the compiler flags instead. If you don't want Google Test to use tuple at all, add -DGTEST_HAS_TR1_TUPLE=0 and all features using tuple will be disabled. ### Multi-threaded Tests ### Google Test is thread-safe where the pthread library is available. After #include "gtest/gtest.h", you can check the GTEST_IS_THREADSAFE macro to see whether this is the case (yes if the macro is #defined to 1, no if it's undefined.). If Google Test doesn't correctly detect whether pthread is available in your environment, you can force it with -DGTEST_HAS_PTHREAD=1 or -DGTEST_HAS_PTHREAD=0 When Google Test uses pthread, you may need to add flags to your compiler and/or linker to select the pthread library, or you'll get link errors. If you use the CMake script or the deprecated Autotools script, this is taken care of for you. If you use your own build script, you'll need to read your compiler and linker's manual to figure out what flags to add. ### As a Shared Library (DLL) ### Google Test is compact, so most users can build and link it as a static library for the simplicity. You can choose to use Google Test as a shared library (known as a DLL on Windows) if you prefer. To compile *gtest* as a shared library, add -DGTEST_CREATE_SHARED_LIBRARY=1 to the compiler flags. You'll also need to tell the linker to produce a shared library instead - consult your linker's manual for how to do it. To compile your *tests* that use the gtest shared library, add -DGTEST_LINKED_AS_SHARED_LIBRARY=1 to the compiler flags. Note: while the above steps aren't technically necessary today when using some compilers (e.g. GCC), they may become necessary in the future, if we decide to improve the speed of loading the library (see http://gcc.gnu.org/wiki/Visibility for details). Therefore you are recommended to always add the above flags when using Google Test as a shared library. Otherwise a future release of Google Test may break your build script. ### Avoiding Macro Name Clashes ### In C++, macros don't obey namespaces. Therefore two libraries that both define a macro of the same name will clash if you #include both definitions. In case a Google Test macro clashes with another library, you can force Google Test to rename its macro to avoid the conflict. Specifically, if both Google Test and some other code define macro FOO, you can add -DGTEST_DONT_DEFINE_FOO=1 to the compiler flags to tell Google Test to change the macro's name from FOO to GTEST_FOO. Currently FOO can be FAIL, SUCCEED, or TEST. For example, with -DGTEST_DONT_DEFINE_TEST=1, you'll need to write GTEST_TEST(SomeTest, DoesThis) { ... } instead of TEST(SomeTest, DoesThis) { ... } in order to define a test. Upgrating from an Earlier Version --------------------------------- We strive to keep Google Test releases backward compatible. Sometimes, though, we have to make some breaking changes for the users' long-term benefits. This section describes what you'll need to do if you are upgrading from an earlier version of Google Test. ### Upgrading from 1.3.0 or Earlier ### You may need to explicitly enable or disable Google Test's own TR1 tuple library. See the instructions in section "Choosing a TR1 Tuple Library". ### Upgrading from 1.4.0 or Earlier ### The Autotools build script (configure + make) is no longer officially supportted. You are encouraged to migrate to your own build system or use CMake. If you still need to use Autotools, you can find instructions in the README file from Google Test 1.4.0. On platforms where the pthread library is available, Google Test uses it in order to be thread-safe. See the "Multi-threaded Tests" section for what this means to your build script. If you use Microsoft Visual C++ 7.1 with exceptions disabled, Google Test will no longer compile. This should affect very few people, as a large portion of STL (including ) doesn't compile in this mode anyway. We decided to stop supporting it in order to greatly simplify Google Test's implementation. Developing Google Test ---------------------- This section discusses how to make your own changes to Google Test. ### Testing Google Test Itself ### To make sure your changes work as intended and don't break existing functionality, you'll want to compile and run Google Test's own tests. For that you can use CMake: mkdir mybuild cd mybuild cmake -Dgtest_build_tests=ON ${GTEST_DIR} Make sure you have Python installed, as some of Google Test's tests are written in Python. If the cmake command complains about not being able to find Python ("Could NOT find PythonInterp (missing: PYTHON_EXECUTABLE)"), try telling it explicitly where your Python executable can be found: cmake -DPYTHON_EXECUTABLE=path/to/python -Dgtest_build_tests=ON ${GTEST_DIR} Next, you can build Google Test and all of its own tests. On *nix, this is usually done by 'make'. To run the tests, do make test All tests should pass. ### Regenerating Source Files ### Some of Google Test's source files are generated from templates (not in the C++ sense) using a script. A template file is named FOO.pump, where FOO is the name of the file it will generate. For example, the file include/gtest/internal/gtest-type-util.h.pump is used to generate gtest-type-util.h in the same directory. Normally you don't need to worry about regenerating the source files, unless you need to modify them. In that case, you should modify the corresponding .pump files instead and run the pump.py Python script to regenerate them. You can find pump.py in the scripts/ directory. Read the Pump manual [2] for how to use it. [2] http://code.google.com/p/googletest/wiki/PumpManual ### Contributing a Patch ### We welcome patches. Please read the Google Test developer's guide [3] for how you can contribute. In particular, make sure you have signed the Contributor License Agreement, or we won't be able to accept the patch. [3] http://code.google.com/p/googletest/wiki/GoogleTestDevGuide Happy testing! synergy-1.4.12-Source/tools/gtest-1.6.0/samples/0000700000175000017500000000000012140644175021103 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/samples/prime_tables.h0000600000175000017500000000775011561126632023734 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Author: vladl@google.com (Vlad Losev) // This provides interface PrimeTable that determines whether a number is a // prime and determines a next prime number. This interface is used // in Google Test samples demonstrating use of parameterized tests. #ifndef GTEST_SAMPLES_PRIME_TABLES_H_ #define GTEST_SAMPLES_PRIME_TABLES_H_ #include // The prime table interface. class PrimeTable { public: virtual ~PrimeTable() {} // Returns true iff n is a prime number. virtual bool IsPrime(int n) const = 0; // Returns the smallest prime number greater than p; or returns -1 // if the next prime is beyond the capacity of the table. virtual int GetNextPrime(int p) const = 0; }; // Implementation #1 calculates the primes on-the-fly. class OnTheFlyPrimeTable : public PrimeTable { public: virtual bool IsPrime(int n) const { if (n <= 1) return false; for (int i = 2; i*i <= n; i++) { // n is divisible by an integer other than 1 and itself. if ((n % i) == 0) return false; } return true; } virtual int GetNextPrime(int p) const { for (int n = p + 1; n > 0; n++) { if (IsPrime(n)) return n; } return -1; } }; // Implementation #2 pre-calculates the primes and stores the result // in an array. class PreCalculatedPrimeTable : public PrimeTable { public: // 'max' specifies the maximum number the prime table holds. explicit PreCalculatedPrimeTable(int max) : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) { CalculatePrimesUpTo(max); } virtual ~PreCalculatedPrimeTable() { delete[] is_prime_; } virtual bool IsPrime(int n) const { return 0 <= n && n < is_prime_size_ && is_prime_[n]; } virtual int GetNextPrime(int p) const { for (int n = p + 1; n < is_prime_size_; n++) { if (is_prime_[n]) return n; } return -1; } private: void CalculatePrimesUpTo(int max) { ::std::fill(is_prime_, is_prime_ + is_prime_size_, true); is_prime_[0] = is_prime_[1] = false; for (int i = 2; i <= max; i++) { if (!is_prime_[i]) continue; // Marks all multiples of i (except i itself) as non-prime. for (int j = 2*i; j <= max; j += i) { is_prime_[j] = false; } } } const int is_prime_size_; bool* const is_prime_; // Disables compiler warning "assignment operator could not be generated." void operator=(const PreCalculatedPrimeTable& rhs); }; #endif // GTEST_SAMPLES_PRIME_TABLES_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample1.cc0000600000175000017500000000470611561126632022764 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #include "sample1.h" // Returns n! (the factorial of n). For negative n, n! is defined to be 1. int Factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result *= i; } return result; } // Returns true iff n is a prime number. bool IsPrime(int n) { // Trivial case 1: small numbers if (n <= 1) return false; // Trivial case 2: even numbers if (n % 2 == 0) return n == 2; // Now, we have that n is odd and n >= 3. // Try to divide n by every odd number i, starting from 3 for (int i = 3; ; i += 2) { // We only have to try i up to the squre root of n if (i > n/i) break; // Now, we have i <= n/i < n. // If n is divisible by i, n is not prime. if (n % i == 0) return false; } // n has no integer factor in the range (1, n), and thus is prime. return true; } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample1.h0000600000175000017500000000362111561126632022621 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_SAMPLES_SAMPLE1_H_ #define GTEST_SAMPLES_SAMPLE1_H_ // Returns n! (the factorial of n). For negative n, n! is defined to be 1. int Factorial(int n); // Returns true iff n is a prime number. bool IsPrime(int n); #endif // GTEST_SAMPLES_SAMPLE1_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample10_unittest.cc0000600000175000017500000001171111561126632024775 0ustar synergysynergy// Copyright 2009 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // This sample shows how to use Google Test listener API to implement // a primitive leak checker. #include #include #include "gtest/gtest.h" using ::testing::EmptyTestEventListener; using ::testing::InitGoogleTest; using ::testing::Test; using ::testing::TestCase; using ::testing::TestEventListeners; using ::testing::TestInfo; using ::testing::TestPartResult; using ::testing::UnitTest; namespace { // We will track memory used by this class. class Water { public: // Normal Water declarations go here. // operator new and operator delete help us control water allocation. void* operator new(size_t allocation_size) { allocated_++; return malloc(allocation_size); } void operator delete(void* block, size_t /* allocation_size */) { allocated_--; free(block); } static int allocated() { return allocated_; } private: static int allocated_; }; int Water::allocated_ = 0; // This event listener monitors how many Water objects are created and // destroyed by each test, and reports a failure if a test leaks some Water // objects. It does this by comparing the number of live Water objects at // the beginning of a test and at the end of a test. class LeakChecker : public EmptyTestEventListener { private: // Called before a test starts. virtual void OnTestStart(const TestInfo& /* test_info */) { initially_allocated_ = Water::allocated(); } // Called after a test ends. virtual void OnTestEnd(const TestInfo& /* test_info */) { int difference = Water::allocated() - initially_allocated_; // You can generate a failure in any event handler except // OnTestPartResult. Just use an appropriate Google Test assertion to do // it. EXPECT_TRUE(difference <= 0) << "Leaked " << difference << " unit(s) of Water!"; } int initially_allocated_; }; TEST(ListenersTest, DoesNotLeak) { Water* water = new Water; delete water; } // This should fail when the --check_for_leaks command line flag is // specified. TEST(ListenersTest, LeaksWater) { Water* water = new Water; EXPECT_TRUE(water != NULL); } } // namespace int main(int argc, char **argv) { InitGoogleTest(&argc, argv); bool check_for_leaks = false; if (argc > 1 && strcmp(argv[1], "--check_for_leaks") == 0 ) check_for_leaks = true; else printf("%s\n", "Run this program with --check_for_leaks to enable " "custom leak checking in the tests."); // If we are given the --check_for_leaks command line flag, installs the // leak checker. if (check_for_leaks) { TestEventListeners& listeners = UnitTest::GetInstance()->listeners(); // Adds the leak checker to the end of the test event listener list, // after the default text output printer and the default XML report // generator. // // The order is important - it ensures that failures generated in the // leak checker's OnTestEnd() method are processed by the text and XML // printers *before* their OnTestEnd() methods are called, such that // they are attributed to the right test. Remember that a listener // receives an OnXyzStart event *after* listeners preceding it in the // list received that event, and receives an OnXyzEnd event *before* // listeners preceding it. // // We don't need to worry about deleting the new listener later, as // Google Test will do it. listeners.Append(new LeakChecker); } return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample1_unittest.cc0000600000175000017500000001201411561126632024712 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // This sample shows how to write a simple unit test for a function, // using Google C++ testing framework. // // Writing a unit test using Google C++ testing framework is easy as 1-2-3: // Step 1. Include necessary header files such that the stuff your // test logic needs is declared. // // Don't forget gtest.h, which declares the testing framework. #include #include "sample1.h" #include "gtest/gtest.h" // Step 2. Use the TEST macro to define your tests. // // TEST has two parameters: the test case name and the test name. // After using the macro, you should define your test logic between a // pair of braces. You can use a bunch of macros to indicate the // success or failure of a test. EXPECT_TRUE and EXPECT_EQ are // examples of such macros. For a complete list, see gtest.h. // // // // In Google Test, tests are grouped into test cases. This is how we // keep test code organized. You should put logically related tests // into the same test case. // // The test case name and the test name should both be valid C++ // identifiers. And you should not use underscore (_) in the names. // // Google Test guarantees that each test you define is run exactly // once, but it makes no guarantee on the order the tests are // executed. Therefore, you should write your tests in such a way // that their results don't depend on their order. // // // Tests Factorial(). // Tests factorial of negative numbers. TEST(FactorialTest, Negative) { // This test is named "Negative", and belongs to the "FactorialTest" // test case. EXPECT_EQ(1, Factorial(-5)); EXPECT_EQ(1, Factorial(-1)); EXPECT_TRUE(Factorial(-10) > 0); // // // EXPECT_EQ(expected, actual) is the same as // // EXPECT_TRUE((expected) == (actual)) // // except that it will print both the expected value and the actual // value when the assertion fails. This is very helpful for // debugging. Therefore in this case EXPECT_EQ is preferred. // // On the other hand, EXPECT_TRUE accepts any Boolean expression, // and is thus more general. // // } // Tests factorial of 0. TEST(FactorialTest, Zero) { EXPECT_EQ(1, Factorial(0)); } // Tests factorial of positive numbers. TEST(FactorialTest, Positive) { EXPECT_EQ(1, Factorial(1)); EXPECT_EQ(2, Factorial(2)); EXPECT_EQ(6, Factorial(3)); EXPECT_EQ(40320, Factorial(8)); } // Tests IsPrime() // Tests negative input. TEST(IsPrimeTest, Negative) { // This test belongs to the IsPrimeTest test case. EXPECT_FALSE(IsPrime(-1)); EXPECT_FALSE(IsPrime(-2)); EXPECT_FALSE(IsPrime(INT_MIN)); } // Tests some trivial cases. TEST(IsPrimeTest, Trivial) { EXPECT_FALSE(IsPrime(0)); EXPECT_FALSE(IsPrime(1)); EXPECT_TRUE(IsPrime(2)); EXPECT_TRUE(IsPrime(3)); } // Tests positive input. TEST(IsPrimeTest, Positive) { EXPECT_FALSE(IsPrime(4)); EXPECT_TRUE(IsPrime(5)); EXPECT_FALSE(IsPrime(6)); EXPECT_TRUE(IsPrime(23)); } // Step 3. Call RUN_ALL_TESTS() in main(). // // We do this by linking in src/gtest_main.cc file, which consists of // a main() function which calls RUN_ALL_TESTS() for us. // // This runs all the tests you've defined, prints the result, and // returns 0 if successful, or 1 otherwise. // // Did you notice that we didn't register the tests? The // RUN_ALL_TESTS() macro magically knows about all the tests we // defined. Isn't this convenient? synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample2.cc0000600000175000017500000000437211561126632022764 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #include "sample2.h" #include // Clones a 0-terminated C string, allocating memory using new. const char* MyString::CloneCString(const char* a_c_string) { if (a_c_string == NULL) return NULL; const size_t len = strlen(a_c_string); char* const clone = new char[ len + 1 ]; memcpy(clone, a_c_string, len + 1); return clone; } // Sets the 0-terminated C string this MyString object // represents. void MyString::Set(const char* a_c_string) { // Makes sure this works when c_string == c_string_ const char* const temp = MyString::CloneCString(a_c_string); delete[] c_string_; c_string_ = temp; } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample2.h0000600000175000017500000000567711561126632022637 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_SAMPLES_SAMPLE2_H_ #define GTEST_SAMPLES_SAMPLE2_H_ #include // A simple string class. class MyString { private: const char* c_string_; const MyString& operator=(const MyString& rhs); public: // Clones a 0-terminated C string, allocating memory using new. static const char* CloneCString(const char* a_c_string); //////////////////////////////////////////////////////////// // // C'tors // The default c'tor constructs a NULL string. MyString() : c_string_(NULL) {} // Constructs a MyString by cloning a 0-terminated C string. explicit MyString(const char* a_c_string) : c_string_(NULL) { Set(a_c_string); } // Copy c'tor MyString(const MyString& string) : c_string_(NULL) { Set(string.c_string_); } //////////////////////////////////////////////////////////// // // D'tor. MyString is intended to be a final class, so the d'tor // doesn't need to be virtual. ~MyString() { delete[] c_string_; } // Gets the 0-terminated C string this MyString object represents. const char* c_string() const { return c_string_; } size_t Length() const { return c_string_ == NULL ? 0 : strlen(c_string_); } // Sets the 0-terminated C string this MyString object represents. void Set(const char* c_string); }; #endif // GTEST_SAMPLES_SAMPLE2_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample2_unittest.cc0000600000175000017500000000754611561126632024731 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // This sample shows how to write a more complex unit test for a class // that has multiple member functions. // // Usually, it's a good idea to have one test for each method in your // class. You don't have to do that exactly, but it helps to keep // your tests organized. You may also throw in additional tests as // needed. #include "sample2.h" #include "gtest/gtest.h" // In this example, we test the MyString class (a simple string). // Tests the default c'tor. TEST(MyString, DefaultConstructor) { const MyString s; // Asserts that s.c_string() returns NULL. // // // // If we write NULL instead of // // static_cast(NULL) // // in this assertion, it will generate a warning on gcc 3.4. The // reason is that EXPECT_EQ needs to know the types of its // arguments in order to print them when it fails. Since NULL is // #defined as 0, the compiler will use the formatter function for // int to print it. However, gcc thinks that NULL should be used as // a pointer, not an int, and therefore complains. // // The root of the problem is C++'s lack of distinction between the // integer number 0 and the null pointer constant. Unfortunately, // we have to live with this fact. // // EXPECT_STREQ(NULL, s.c_string()); EXPECT_EQ(0u, s.Length()); } const char kHelloString[] = "Hello, world!"; // Tests the c'tor that accepts a C string. TEST(MyString, ConstructorFromCString) { const MyString s(kHelloString); EXPECT_TRUE(strcmp(s.c_string(), kHelloString) == 0); EXPECT_EQ(sizeof(kHelloString)/sizeof(kHelloString[0]) - 1, s.Length()); } // Tests the copy c'tor. TEST(MyString, CopyConstructor) { const MyString s1(kHelloString); const MyString s2 = s1; EXPECT_TRUE(strcmp(s2.c_string(), kHelloString) == 0); } // Tests the Set method. TEST(MyString, Set) { MyString s; s.Set(kHelloString); EXPECT_TRUE(strcmp(s.c_string(), kHelloString) == 0); // Set should work when the input pointer is the same as the one // already in the MyString object. s.Set(s.c_string()); EXPECT_TRUE(strcmp(s.c_string(), kHelloString) == 0); // Can we set the MyString to NULL? s.Set(NULL); EXPECT_STREQ(NULL, s.c_string()); } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample3-inl.h0000600000175000017500000001235511561126632023407 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_SAMPLES_SAMPLE3_INL_H_ #define GTEST_SAMPLES_SAMPLE3_INL_H_ #include // Queue is a simple queue implemented as a singled-linked list. // // The element type must support copy constructor. template // E is the element type class Queue; // QueueNode is a node in a Queue, which consists of an element of // type E and a pointer to the next node. template // E is the element type class QueueNode { friend class Queue; public: // Gets the element in this node. const E& element() const { return element_; } // Gets the next node in the queue. QueueNode* next() { return next_; } const QueueNode* next() const { return next_; } private: // Creates a node with a given element value. The next pointer is // set to NULL. QueueNode(const E& an_element) : element_(an_element), next_(NULL) {} // We disable the default assignment operator and copy c'tor. const QueueNode& operator = (const QueueNode&); QueueNode(const QueueNode&); E element_; QueueNode* next_; }; template // E is the element type. class Queue { public: // Creates an empty queue. Queue() : head_(NULL), last_(NULL), size_(0) {} // D'tor. Clears the queue. ~Queue() { Clear(); } // Clears the queue. void Clear() { if (size_ > 0) { // 1. Deletes every node. QueueNode* node = head_; QueueNode* next = node->next(); for (; ;) { delete node; node = next; if (node == NULL) break; next = node->next(); } // 2. Resets the member variables. head_ = last_ = NULL; size_ = 0; } } // Gets the number of elements. size_t Size() const { return size_; } // Gets the first element of the queue, or NULL if the queue is empty. QueueNode* Head() { return head_; } const QueueNode* Head() const { return head_; } // Gets the last element of the queue, or NULL if the queue is empty. QueueNode* Last() { return last_; } const QueueNode* Last() const { return last_; } // Adds an element to the end of the queue. A copy of the element is // created using the copy constructor, and then stored in the queue. // Changes made to the element in the queue doesn't affect the source // object, and vice versa. void Enqueue(const E& element) { QueueNode* new_node = new QueueNode(element); if (size_ == 0) { head_ = last_ = new_node; size_ = 1; } else { last_->next_ = new_node; last_ = new_node; size_++; } } // Removes the head of the queue and returns it. Returns NULL if // the queue is empty. E* Dequeue() { if (size_ == 0) { return NULL; } const QueueNode* const old_head = head_; head_ = head_->next_; size_--; if (size_ == 0) { last_ = NULL; } E* element = new E(old_head->element()); delete old_head; return element; } // Applies a function/functor on each element of the queue, and // returns the result in a new queue. The original queue is not // affected. template Queue* Map(F function) const { Queue* new_queue = new Queue(); for (const QueueNode* node = head_; node != NULL; node = node->next_) { new_queue->Enqueue(function(node->element())); } return new_queue; } private: QueueNode* head_; // The first node of the queue. QueueNode* last_; // The last node of the queue. size_t size_; // The number of elements in the queue. // We disallow copying a queue. Queue(const Queue&); const Queue& operator = (const Queue&); }; #endif // GTEST_SAMPLES_SAMPLE3_INL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample3_unittest.cc0000600000175000017500000001234711561126632024725 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // In this example, we use a more advanced feature of Google Test called // test fixture. // // A test fixture is a place to hold objects and functions shared by // all tests in a test case. Using a test fixture avoids duplicating // the test code necessary to initialize and cleanup those common // objects for each test. It is also useful for defining sub-routines // that your tests need to invoke a lot. // // // // The tests share the test fixture in the sense of code sharing, not // data sharing. Each test is given its own fresh copy of the // fixture. You cannot expect the data modified by one test to be // passed on to another test, which is a bad idea. // // The reason for this design is that tests should be independent and // repeatable. In particular, a test should not fail as the result of // another test's failure. If one test depends on info produced by // another test, then the two tests should really be one big test. // // The macros for indicating the success/failure of a test // (EXPECT_TRUE, FAIL, etc) need to know what the current test is // (when Google Test prints the test result, it tells you which test // each failure belongs to). Technically, these macros invoke a // member function of the Test class. Therefore, you cannot use them // in a global function. That's why you should put test sub-routines // in a test fixture. // // #include "sample3-inl.h" #include "gtest/gtest.h" // To use a test fixture, derive a class from testing::Test. class QueueTest : public testing::Test { protected: // You should make the members protected s.t. they can be // accessed from sub-classes. // virtual void SetUp() will be called before each test is run. You // should define it if you need to initialize the varaibles. // Otherwise, this can be skipped. virtual void SetUp() { q1_.Enqueue(1); q2_.Enqueue(2); q2_.Enqueue(3); } // virtual void TearDown() will be called after each test is run. // You should define it if there is cleanup work to do. Otherwise, // you don't have to provide it. // // virtual void TearDown() { // } // A helper function that some test uses. static int Double(int n) { return 2*n; } // A helper function for testing Queue::Map(). void MapTester(const Queue * q) { // Creates a new queue, where each element is twice as big as the // corresponding one in q. const Queue * const new_q = q->Map(Double); // Verifies that the new queue has the same size as q. ASSERT_EQ(q->Size(), new_q->Size()); // Verifies the relationship between the elements of the two queues. for ( const QueueNode * n1 = q->Head(), * n2 = new_q->Head(); n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { EXPECT_EQ(2 * n1->element(), n2->element()); } delete new_q; } // Declares the variables your tests want to use. Queue q0_; Queue q1_; Queue q2_; }; // When you have a test fixture, you define a test using TEST_F // instead of TEST. // Tests the default c'tor. TEST_F(QueueTest, DefaultConstructor) { // You can access data in the test fixture here. EXPECT_EQ(0u, q0_.Size()); } // Tests Dequeue(). TEST_F(QueueTest, Dequeue) { int * n = q0_.Dequeue(); EXPECT_TRUE(n == NULL); n = q1_.Dequeue(); ASSERT_TRUE(n != NULL); EXPECT_EQ(1, *n); EXPECT_EQ(0u, q1_.Size()); delete n; n = q2_.Dequeue(); ASSERT_TRUE(n != NULL); EXPECT_EQ(2, *n); EXPECT_EQ(1u, q2_.Size()); delete n; } // Tests the Queue::Map() function. TEST_F(QueueTest, Map) { MapTester(&q0_); MapTester(&q1_); MapTester(&q2_); } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample4.cc0000600000175000017500000000360711561126632022766 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #include #include "sample4.h" // Returns the current counter value, and increments it. int Counter::Increment() { return counter_++; } // Prints the current counter value to STDOUT. void Counter::Print() const { printf("%d", counter_); } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample4.h0000600000175000017500000000404311561126632022623 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // A sample program demonstrating using Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_SAMPLES_SAMPLE4_H_ #define GTEST_SAMPLES_SAMPLE4_H_ // A simple monotonic counter. class Counter { private: int counter_; public: // Creates a counter that starts at 0. Counter() : counter_(0) {} // Returns the current counter value, and increments it. int Increment(); // Prints the current counter value to STDOUT. void Print() const; }; #endif // GTEST_SAMPLES_SAMPLE4_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample4_unittest.cc0000600000175000017500000000356511561126632024730 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest.h" #include "sample4.h" // Tests the Increment() method. TEST(Counter, Increment) { Counter c; // EXPECT_EQ() evaluates its arguments exactly once, so they // can have side effects. EXPECT_EQ(0, c.Increment()); EXPECT_EQ(1, c.Increment()); EXPECT_EQ(2, c.Increment()); } synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample5_unittest.cc0000600000175000017500000001470111561126632024723 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // This sample teaches how to reuse a test fixture in multiple test // cases by deriving sub-fixtures from it. // // When you define a test fixture, you specify the name of the test // case that will use this fixture. Therefore, a test fixture can // be used by only one test case. // // Sometimes, more than one test cases may want to use the same or // slightly different test fixtures. For example, you may want to // make sure that all tests for a GUI library don't leak important // system resources like fonts and brushes. In Google Test, you do // this by putting the shared logic in a super (as in "super class") // test fixture, and then have each test case use a fixture derived // from this super fixture. #include #include #include "sample3-inl.h" #include "gtest/gtest.h" #include "sample1.h" // In this sample, we want to ensure that every test finishes within // ~5 seconds. If a test takes longer to run, we consider it a // failure. // // We put the code for timing a test in a test fixture called // "QuickTest". QuickTest is intended to be the super fixture that // other fixtures derive from, therefore there is no test case with // the name "QuickTest". This is OK. // // Later, we will derive multiple test fixtures from QuickTest. class QuickTest : public testing::Test { protected: // Remember that SetUp() is run immediately before a test starts. // This is a good place to record the start time. virtual void SetUp() { start_time_ = time(NULL); } // TearDown() is invoked immediately after a test finishes. Here we // check if the test was too slow. virtual void TearDown() { // Gets the time when the test finishes const time_t end_time = time(NULL); // Asserts that the test took no more than ~5 seconds. Did you // know that you can use assertions in SetUp() and TearDown() as // well? EXPECT_TRUE(end_time - start_time_ <= 5) << "The test took too long."; } // The UTC time (in seconds) when the test starts time_t start_time_; }; // We derive a fixture named IntegerFunctionTest from the QuickTest // fixture. All tests using this fixture will be automatically // required to be quick. class IntegerFunctionTest : public QuickTest { // We don't need any more logic than already in the QuickTest fixture. // Therefore the body is empty. }; // Now we can write tests in the IntegerFunctionTest test case. // Tests Factorial() TEST_F(IntegerFunctionTest, Factorial) { // Tests factorial of negative numbers. EXPECT_EQ(1, Factorial(-5)); EXPECT_EQ(1, Factorial(-1)); EXPECT_TRUE(Factorial(-10) > 0); // Tests factorial of 0. EXPECT_EQ(1, Factorial(0)); // Tests factorial of positive numbers. EXPECT_EQ(1, Factorial(1)); EXPECT_EQ(2, Factorial(2)); EXPECT_EQ(6, Factorial(3)); EXPECT_EQ(40320, Factorial(8)); } // Tests IsPrime() TEST_F(IntegerFunctionTest, IsPrime) { // Tests negative input. EXPECT_TRUE(!IsPrime(-1)); EXPECT_TRUE(!IsPrime(-2)); EXPECT_TRUE(!IsPrime(INT_MIN)); // Tests some trivial cases. EXPECT_TRUE(!IsPrime(0)); EXPECT_TRUE(!IsPrime(1)); EXPECT_TRUE(IsPrime(2)); EXPECT_TRUE(IsPrime(3)); // Tests positive input. EXPECT_TRUE(!IsPrime(4)); EXPECT_TRUE(IsPrime(5)); EXPECT_TRUE(!IsPrime(6)); EXPECT_TRUE(IsPrime(23)); } // The next test case (named "QueueTest") also needs to be quick, so // we derive another fixture from QuickTest. // // The QueueTest test fixture has some logic and shared objects in // addition to what's in QuickTest already. We define the additional // stuff inside the body of the test fixture, as usual. class QueueTest : public QuickTest { protected: virtual void SetUp() { // First, we need to set up the super fixture (QuickTest). QuickTest::SetUp(); // Second, some additional setup for this fixture. q1_.Enqueue(1); q2_.Enqueue(2); q2_.Enqueue(3); } // By default, TearDown() inherits the behavior of // QuickTest::TearDown(). As we have no additional cleaning work // for QueueTest, we omit it here. // // virtual void TearDown() { // QuickTest::TearDown(); // } Queue q0_; Queue q1_; Queue q2_; }; // Now, let's write tests using the QueueTest fixture. // Tests the default constructor. TEST_F(QueueTest, DefaultConstructor) { EXPECT_EQ(0u, q0_.Size()); } // Tests Dequeue(). TEST_F(QueueTest, Dequeue) { int* n = q0_.Dequeue(); EXPECT_TRUE(n == NULL); n = q1_.Dequeue(); EXPECT_TRUE(n != NULL); EXPECT_EQ(1, *n); EXPECT_EQ(0u, q1_.Size()); delete n; n = q2_.Dequeue(); EXPECT_TRUE(n != NULL); EXPECT_EQ(2, *n); EXPECT_EQ(1u, q2_.Size()); delete n; } // If necessary, you can derive further test fixtures from a derived // fixture itself. For example, you can derive another fixture from // QueueTest. Google Test imposes no limit on how deep the hierarchy // can be. In practice, however, you probably don't want it to be too // deep as to be confusing. synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample6_unittest.cc0000600000175000017500000002143511561126632024726 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // This sample shows how to test common properties of multiple // implementations of the same interface (aka interface tests). // The interface and its implementations are in this header. #include "prime_tables.h" #include "gtest/gtest.h" // First, we define some factory functions for creating instances of // the implementations. You may be able to skip this step if all your // implementations can be constructed the same way. template PrimeTable* CreatePrimeTable(); template <> PrimeTable* CreatePrimeTable() { return new OnTheFlyPrimeTable; } template <> PrimeTable* CreatePrimeTable() { return new PreCalculatedPrimeTable(10000); } // Then we define a test fixture class template. template class PrimeTableTest : public testing::Test { protected: // The ctor calls the factory function to create a prime table // implemented by T. PrimeTableTest() : table_(CreatePrimeTable()) {} virtual ~PrimeTableTest() { delete table_; } // Note that we test an implementation via the base interface // instead of the actual implementation class. This is important // for keeping the tests close to the real world scenario, where the // implementation is invoked via the base interface. It avoids // got-yas where the implementation class has a method that shadows // a method with the same name (but slightly different argument // types) in the base interface, for example. PrimeTable* const table_; }; #if GTEST_HAS_TYPED_TEST using testing::Types; // Google Test offers two ways for reusing tests for different types. // The first is called "typed tests". You should use it if you // already know *all* the types you are gonna exercise when you write // the tests. // To write a typed test case, first use // // TYPED_TEST_CASE(TestCaseName, TypeList); // // to declare it and specify the type parameters. As with TEST_F, // TestCaseName must match the test fixture name. // The list of types we want to test. typedef Types Implementations; TYPED_TEST_CASE(PrimeTableTest, Implementations); // Then use TYPED_TEST(TestCaseName, TestName) to define a typed test, // similar to TEST_F. TYPED_TEST(PrimeTableTest, ReturnsFalseForNonPrimes) { // Inside the test body, you can refer to the type parameter by // TypeParam, and refer to the fixture class by TestFixture. We // don't need them in this example. // Since we are in the template world, C++ requires explicitly // writing 'this->' when referring to members of the fixture class. // This is something you have to learn to live with. EXPECT_FALSE(this->table_->IsPrime(-5)); EXPECT_FALSE(this->table_->IsPrime(0)); EXPECT_FALSE(this->table_->IsPrime(1)); EXPECT_FALSE(this->table_->IsPrime(4)); EXPECT_FALSE(this->table_->IsPrime(6)); EXPECT_FALSE(this->table_->IsPrime(100)); } TYPED_TEST(PrimeTableTest, ReturnsTrueForPrimes) { EXPECT_TRUE(this->table_->IsPrime(2)); EXPECT_TRUE(this->table_->IsPrime(3)); EXPECT_TRUE(this->table_->IsPrime(5)); EXPECT_TRUE(this->table_->IsPrime(7)); EXPECT_TRUE(this->table_->IsPrime(11)); EXPECT_TRUE(this->table_->IsPrime(131)); } TYPED_TEST(PrimeTableTest, CanGetNextPrime) { EXPECT_EQ(2, this->table_->GetNextPrime(0)); EXPECT_EQ(3, this->table_->GetNextPrime(2)); EXPECT_EQ(5, this->table_->GetNextPrime(3)); EXPECT_EQ(7, this->table_->GetNextPrime(5)); EXPECT_EQ(11, this->table_->GetNextPrime(7)); EXPECT_EQ(131, this->table_->GetNextPrime(128)); } // That's it! Google Test will repeat each TYPED_TEST for each type // in the type list specified in TYPED_TEST_CASE. Sit back and be // happy that you don't have to define them multiple times. #endif // GTEST_HAS_TYPED_TEST #if GTEST_HAS_TYPED_TEST_P using testing::Types; // Sometimes, however, you don't yet know all the types that you want // to test when you write the tests. For example, if you are the // author of an interface and expect other people to implement it, you // might want to write a set of tests to make sure each implementation // conforms to some basic requirements, but you don't know what // implementations will be written in the future. // // How can you write the tests without committing to the type // parameters? That's what "type-parameterized tests" can do for you. // It is a bit more involved than typed tests, but in return you get a // test pattern that can be reused in many contexts, which is a big // win. Here's how you do it: // First, define a test fixture class template. Here we just reuse // the PrimeTableTest fixture defined earlier: template class PrimeTableTest2 : public PrimeTableTest { }; // Then, declare the test case. The argument is the name of the test // fixture, and also the name of the test case (as usual). The _P // suffix is for "parameterized" or "pattern". TYPED_TEST_CASE_P(PrimeTableTest2); // Next, use TYPED_TEST_P(TestCaseName, TestName) to define a test, // similar to what you do with TEST_F. TYPED_TEST_P(PrimeTableTest2, ReturnsFalseForNonPrimes) { EXPECT_FALSE(this->table_->IsPrime(-5)); EXPECT_FALSE(this->table_->IsPrime(0)); EXPECT_FALSE(this->table_->IsPrime(1)); EXPECT_FALSE(this->table_->IsPrime(4)); EXPECT_FALSE(this->table_->IsPrime(6)); EXPECT_FALSE(this->table_->IsPrime(100)); } TYPED_TEST_P(PrimeTableTest2, ReturnsTrueForPrimes) { EXPECT_TRUE(this->table_->IsPrime(2)); EXPECT_TRUE(this->table_->IsPrime(3)); EXPECT_TRUE(this->table_->IsPrime(5)); EXPECT_TRUE(this->table_->IsPrime(7)); EXPECT_TRUE(this->table_->IsPrime(11)); EXPECT_TRUE(this->table_->IsPrime(131)); } TYPED_TEST_P(PrimeTableTest2, CanGetNextPrime) { EXPECT_EQ(2, this->table_->GetNextPrime(0)); EXPECT_EQ(3, this->table_->GetNextPrime(2)); EXPECT_EQ(5, this->table_->GetNextPrime(3)); EXPECT_EQ(7, this->table_->GetNextPrime(5)); EXPECT_EQ(11, this->table_->GetNextPrime(7)); EXPECT_EQ(131, this->table_->GetNextPrime(128)); } // Type-parameterized tests involve one extra step: you have to // enumerate the tests you defined: REGISTER_TYPED_TEST_CASE_P( PrimeTableTest2, // The first argument is the test case name. // The rest of the arguments are the test names. ReturnsFalseForNonPrimes, ReturnsTrueForPrimes, CanGetNextPrime); // At this point the test pattern is done. However, you don't have // any real test yet as you haven't said which types you want to run // the tests with. // To turn the abstract test pattern into real tests, you instantiate // it with a list of types. Usually the test pattern will be defined // in a .h file, and anyone can #include and instantiate it. You can // even instantiate it more than once in the same program. To tell // different instances apart, you give each of them a name, which will // become part of the test case name and can be used in test filters. // The list of types we want to test. Note that it doesn't have to be // defined at the time we write the TYPED_TEST_P()s. typedef Types PrimeTableImplementations; INSTANTIATE_TYPED_TEST_CASE_P(OnTheFlyAndPreCalculated, // Instance name PrimeTableTest2, // Test case name PrimeTableImplementations); // Type list #endif // GTEST_HAS_TYPED_TEST_P synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample7_unittest.cc0000600000175000017500000001175311561126632024731 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // This sample shows how to test common properties of multiple // implementations of an interface (aka interface tests) using // value-parameterized tests. Each test in the test case has // a parameter that is an interface pointer to an implementation // tested. // The interface and its implementations are in this header. #include "prime_tables.h" #include "gtest/gtest.h" #if GTEST_HAS_PARAM_TEST using ::testing::TestWithParam; using ::testing::Values; // As a general rule, to prevent a test from affecting the tests that come // after it, you should create and destroy the tested objects for each test // instead of reusing them. In this sample we will define a simple factory // function for PrimeTable objects. We will instantiate objects in test's // SetUp() method and delete them in TearDown() method. typedef PrimeTable* CreatePrimeTableFunc(); PrimeTable* CreateOnTheFlyPrimeTable() { return new OnTheFlyPrimeTable(); } template PrimeTable* CreatePreCalculatedPrimeTable() { return new PreCalculatedPrimeTable(max_precalculated); } // Inside the test body, fixture constructor, SetUp(), and TearDown() you // can refer to the test parameter by GetParam(). In this case, the test // parameter is a factory function which we call in fixture's SetUp() to // create and store an instance of PrimeTable. class PrimeTableTest : public TestWithParam { public: virtual ~PrimeTableTest() { delete table_; } virtual void SetUp() { table_ = (*GetParam())(); } virtual void TearDown() { delete table_; table_ = NULL; } protected: PrimeTable* table_; }; TEST_P(PrimeTableTest, ReturnsFalseForNonPrimes) { EXPECT_FALSE(table_->IsPrime(-5)); EXPECT_FALSE(table_->IsPrime(0)); EXPECT_FALSE(table_->IsPrime(1)); EXPECT_FALSE(table_->IsPrime(4)); EXPECT_FALSE(table_->IsPrime(6)); EXPECT_FALSE(table_->IsPrime(100)); } TEST_P(PrimeTableTest, ReturnsTrueForPrimes) { EXPECT_TRUE(table_->IsPrime(2)); EXPECT_TRUE(table_->IsPrime(3)); EXPECT_TRUE(table_->IsPrime(5)); EXPECT_TRUE(table_->IsPrime(7)); EXPECT_TRUE(table_->IsPrime(11)); EXPECT_TRUE(table_->IsPrime(131)); } TEST_P(PrimeTableTest, CanGetNextPrime) { EXPECT_EQ(2, table_->GetNextPrime(0)); EXPECT_EQ(3, table_->GetNextPrime(2)); EXPECT_EQ(5, table_->GetNextPrime(3)); EXPECT_EQ(7, table_->GetNextPrime(5)); EXPECT_EQ(11, table_->GetNextPrime(7)); EXPECT_EQ(131, table_->GetNextPrime(128)); } // In order to run value-parameterized tests, you need to instantiate them, // or bind them to a list of values which will be used as test parameters. // You can instantiate them in a different translation module, or even // instantiate them several times. // // Here, we instantiate our tests with a list of two PrimeTable object // factory functions: INSTANTIATE_TEST_CASE_P( OnTheFlyAndPreCalculated, PrimeTableTest, Values(&CreateOnTheFlyPrimeTable, &CreatePreCalculatedPrimeTable<1000>)); #else // Google Test may not support value-parameterized tests with some // compilers. If we use conditional compilation to compile out all // code referring to the gtest_main library, MSVC linker will not link // that library at all and consequently complain about missing entry // point defined in that library (fatal error LNK1561: entry point // must be defined). This dummy test keeps gtest_main linked in. TEST(DummyTest, ValueParameterizedTestsAreNotSupportedOnThisPlatform) {} #endif // GTEST_HAS_PARAM_TEST synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample8_unittest.cc0000600000175000017500000001544011561126632024727 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // This sample shows how to test code relying on some global flag variables. // Combine() helps with generating all possible combinations of such flags, // and each test is given one combination as a parameter. // Use class definitions to test from this header. #include "prime_tables.h" #include "gtest/gtest.h" #if GTEST_HAS_COMBINE // Suppose we want to introduce a new, improved implementation of PrimeTable // which combines speed of PrecalcPrimeTable and versatility of // OnTheFlyPrimeTable (see prime_tables.h). Inside it instantiates both // PrecalcPrimeTable and OnTheFlyPrimeTable and uses the one that is more // appropriate under the circumstances. But in low memory conditions, it can be // told to instantiate without PrecalcPrimeTable instance at all and use only // OnTheFlyPrimeTable. class HybridPrimeTable : public PrimeTable { public: HybridPrimeTable(bool force_on_the_fly, int max_precalculated) : on_the_fly_impl_(new OnTheFlyPrimeTable), precalc_impl_(force_on_the_fly ? NULL : new PreCalculatedPrimeTable(max_precalculated)), max_precalculated_(max_precalculated) {} virtual ~HybridPrimeTable() { delete on_the_fly_impl_; delete precalc_impl_; } virtual bool IsPrime(int n) const { if (precalc_impl_ != NULL && n < max_precalculated_) return precalc_impl_->IsPrime(n); else return on_the_fly_impl_->IsPrime(n); } virtual int GetNextPrime(int p) const { int next_prime = -1; if (precalc_impl_ != NULL && p < max_precalculated_) next_prime = precalc_impl_->GetNextPrime(p); return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p); } private: OnTheFlyPrimeTable* on_the_fly_impl_; PreCalculatedPrimeTable* precalc_impl_; int max_precalculated_; }; using ::testing::TestWithParam; using ::testing::Bool; using ::testing::Values; using ::testing::Combine; // To test all code paths for HybridPrimeTable we must test it with numbers // both within and outside PreCalculatedPrimeTable's capacity and also with // PreCalculatedPrimeTable disabled. We do this by defining fixture which will // accept different combinations of parameters for instantiating a // HybridPrimeTable instance. class PrimeTableTest : public TestWithParam< ::std::tr1::tuple > { protected: virtual void SetUp() { // This can be written as // // bool force_on_the_fly; // int max_precalculated; // tie(force_on_the_fly, max_precalculated) = GetParam(); // // once the Google C++ Style Guide allows use of ::std::tr1::tie. // bool force_on_the_fly = ::std::tr1::get<0>(GetParam()); int max_precalculated = ::std::tr1::get<1>(GetParam()); table_ = new HybridPrimeTable(force_on_the_fly, max_precalculated); } virtual void TearDown() { delete table_; table_ = NULL; } HybridPrimeTable* table_; }; TEST_P(PrimeTableTest, ReturnsFalseForNonPrimes) { // Inside the test body, you can refer to the test parameter by GetParam(). // In this case, the test parameter is a PrimeTable interface pointer which // we can use directly. // Please note that you can also save it in the fixture's SetUp() method // or constructor and use saved copy in the tests. EXPECT_FALSE(table_->IsPrime(-5)); EXPECT_FALSE(table_->IsPrime(0)); EXPECT_FALSE(table_->IsPrime(1)); EXPECT_FALSE(table_->IsPrime(4)); EXPECT_FALSE(table_->IsPrime(6)); EXPECT_FALSE(table_->IsPrime(100)); } TEST_P(PrimeTableTest, ReturnsTrueForPrimes) { EXPECT_TRUE(table_->IsPrime(2)); EXPECT_TRUE(table_->IsPrime(3)); EXPECT_TRUE(table_->IsPrime(5)); EXPECT_TRUE(table_->IsPrime(7)); EXPECT_TRUE(table_->IsPrime(11)); EXPECT_TRUE(table_->IsPrime(131)); } TEST_P(PrimeTableTest, CanGetNextPrime) { EXPECT_EQ(2, table_->GetNextPrime(0)); EXPECT_EQ(3, table_->GetNextPrime(2)); EXPECT_EQ(5, table_->GetNextPrime(3)); EXPECT_EQ(7, table_->GetNextPrime(5)); EXPECT_EQ(11, table_->GetNextPrime(7)); EXPECT_EQ(131, table_->GetNextPrime(128)); } // In order to run value-parameterized tests, you need to instantiate them, // or bind them to a list of values which will be used as test parameters. // You can instantiate them in a different translation module, or even // instantiate them several times. // // Here, we instantiate our tests with a list of parameters. We must combine // all variations of the boolean flag suppressing PrecalcPrimeTable and some // meaningful values for tests. We choose a small value (1), and a value that // will put some of the tested numbers beyond the capability of the // PrecalcPrimeTable instance and some inside it (10). Combine will produce all // possible combinations. INSTANTIATE_TEST_CASE_P(MeaningfulTestParameters, PrimeTableTest, Combine(Bool(), Values(1, 10))); #else // Google Test may not support Combine() with some compilers. If we // use conditional compilation to compile out all code referring to // the gtest_main library, MSVC linker will not link that library at // all and consequently complain about missing entry point defined in // that library (fatal error LNK1561: entry point must be // defined). This dummy test keeps gtest_main linked in. TEST(DummyTest, CombineIsNotSupportedOnThisPlatform) {} #endif // GTEST_HAS_COMBINE synergy-1.4.12-Source/tools/gtest-1.6.0/samples/sample9_unittest.cc0000600000175000017500000001347711561126632024740 0ustar synergysynergy// Copyright 2009 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // This sample shows how to use Google Test listener API to implement // an alternative console output and how to use the UnitTest reflection API // to enumerate test cases and tests and to inspect their results. #include #include "gtest/gtest.h" using ::testing::EmptyTestEventListener; using ::testing::InitGoogleTest; using ::testing::Test; using ::testing::TestCase; using ::testing::TestEventListeners; using ::testing::TestInfo; using ::testing::TestPartResult; using ::testing::UnitTest; namespace { // Provides alternative output mode which produces minimal amount of // information about tests. class TersePrinter : public EmptyTestEventListener { private: // Called before any test activity starts. virtual void OnTestProgramStart(const UnitTest& /* unit_test */) {} // Called after all test activities have ended. virtual void OnTestProgramEnd(const UnitTest& unit_test) { fprintf(stdout, "TEST %s\n", unit_test.Passed() ? "PASSED" : "FAILED"); fflush(stdout); } // Called before a test starts. virtual void OnTestStart(const TestInfo& test_info) { fprintf(stdout, "*** Test %s.%s starting.\n", test_info.test_case_name(), test_info.name()); fflush(stdout); } // Called after a failed assertion or a SUCCEED() invocation. virtual void OnTestPartResult(const TestPartResult& test_part_result) { fprintf(stdout, "%s in %s:%d\n%s\n", test_part_result.failed() ? "*** Failure" : "Success", test_part_result.file_name(), test_part_result.line_number(), test_part_result.summary()); fflush(stdout); } // Called after a test ends. virtual void OnTestEnd(const TestInfo& test_info) { fprintf(stdout, "*** Test %s.%s ending.\n", test_info.test_case_name(), test_info.name()); fflush(stdout); } }; // class TersePrinter TEST(CustomOutputTest, PrintsMessage) { printf("Printing something from the test body...\n"); } TEST(CustomOutputTest, Succeeds) { SUCCEED() << "SUCCEED() has been invoked from here"; } TEST(CustomOutputTest, Fails) { EXPECT_EQ(1, 2) << "This test fails in order to demonstrate alternative failure messages"; } } // namespace int main(int argc, char **argv) { InitGoogleTest(&argc, argv); bool terse_output = false; if (argc > 1 && strcmp(argv[1], "--terse_output") == 0 ) terse_output = true; else printf("%s\n", "Run this program with --terse_output to change the way " "it prints its output."); UnitTest& unit_test = *UnitTest::GetInstance(); // If we are given the --terse_output command line flag, suppresses the // standard output and attaches own result printer. if (terse_output) { TestEventListeners& listeners = unit_test.listeners(); // Removes the default console output listener from the list so it will // not receive events from Google Test and won't print any output. Since // this operation transfers ownership of the listener to the caller we // have to delete it as well. delete listeners.Release(listeners.default_result_printer()); // Adds the custom output listener to the list. It will now receive // events from Google Test and print the alternative output. We don't // have to worry about deleting it since Google Test assumes ownership // over it after adding it to the list. listeners.Append(new TersePrinter); } int ret_val = RUN_ALL_TESTS(); // This is an example of using the UnitTest reflection API to inspect test // results. Here we discount failures from the tests we expected to fail. int unexpectedly_failed_tests = 0; for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase& test_case = *unit_test.GetTestCase(i); for (int j = 0; j < test_case.total_test_count(); ++j) { const TestInfo& test_info = *test_case.GetTestInfo(j); // Counts failed tests that were not meant to fail (those without // 'Fails' in the name). if (test_info.result()->Failed() && strcmp(test_info.name(), "Fails") != 0) { unexpectedly_failed_tests++; } } } // Test that were meant to fail should not affect the test program outcome. if (unexpectedly_failed_tests == 0) ret_val = 0; return ret_val; } synergy-1.4.12-Source/tools/gtest-1.6.0/scripts/0000700000175000017500000000000012140644175021126 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/scripts/fuse_gtest_files.py0000600000175000017500000002115511561126632025037 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """fuse_gtest_files.py v0.2.0 Fuses Google Test source code into a .h file and a .cc file. SYNOPSIS fuse_gtest_files.py [GTEST_ROOT_DIR] OUTPUT_DIR Scans GTEST_ROOT_DIR for Google Test source code, and generates two files: OUTPUT_DIR/gtest/gtest.h and OUTPUT_DIR/gtest/gtest-all.cc. Then you can build your tests by adding OUTPUT_DIR to the include search path and linking with OUTPUT_DIR/gtest/gtest-all.cc. These two files contain everything you need to use Google Test. Hence you can "install" Google Test by copying them to wherever you want. GTEST_ROOT_DIR can be omitted and defaults to the parent directory of the directory holding this script. EXAMPLES ./fuse_gtest_files.py fused_gtest ./fuse_gtest_files.py path/to/unpacked/gtest fused_gtest This tool is experimental. In particular, it assumes that there is no conditional inclusion of Google Test headers. Please report any problems to googletestframework@googlegroups.com. You can read http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide for more information. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sets import sys # We assume that this file is in the scripts/ directory in the Google # Test root directory. DEFAULT_GTEST_ROOT_DIR = os.path.join(os.path.dirname(__file__), '..') # Regex for matching '#include "gtest/..."'. INCLUDE_GTEST_FILE_REGEX = re.compile(r'^\s*#\s*include\s*"(gtest/.+)"') # Regex for matching '#include "src/..."'. INCLUDE_SRC_FILE_REGEX = re.compile(r'^\s*#\s*include\s*"(src/.+)"') # Where to find the source seed files. GTEST_H_SEED = 'include/gtest/gtest.h' GTEST_SPI_H_SEED = 'include/gtest/gtest-spi.h' GTEST_ALL_CC_SEED = 'src/gtest-all.cc' # Where to put the generated files. GTEST_H_OUTPUT = 'gtest/gtest.h' GTEST_ALL_CC_OUTPUT = 'gtest/gtest-all.cc' def VerifyFileExists(directory, relative_path): """Verifies that the given file exists; aborts on failure. relative_path is the file path relative to the given directory. """ if not os.path.isfile(os.path.join(directory, relative_path)): print 'ERROR: Cannot find %s in directory %s.' % (relative_path, directory) print ('Please either specify a valid project root directory ' 'or omit it on the command line.') sys.exit(1) def ValidateGTestRootDir(gtest_root): """Makes sure gtest_root points to a valid gtest root directory. The function aborts the program on failure. """ VerifyFileExists(gtest_root, GTEST_H_SEED) VerifyFileExists(gtest_root, GTEST_ALL_CC_SEED) def VerifyOutputFile(output_dir, relative_path): """Verifies that the given output file path is valid. relative_path is relative to the output_dir directory. """ # Makes sure the output file either doesn't exist or can be overwritten. output_file = os.path.join(output_dir, relative_path) if os.path.exists(output_file): # TODO(wan@google.com): The following user-interaction doesn't # work with automated processes. We should provide a way for the # Makefile to force overwriting the files. print ('%s already exists in directory %s - overwrite it? (y/N) ' % (relative_path, output_dir)) answer = sys.stdin.readline().strip() if answer not in ['y', 'Y']: print 'ABORTED.' sys.exit(1) # Makes sure the directory holding the output file exists; creates # it and all its ancestors if necessary. parent_directory = os.path.dirname(output_file) if not os.path.isdir(parent_directory): os.makedirs(parent_directory) def ValidateOutputDir(output_dir): """Makes sure output_dir points to a valid output directory. The function aborts the program on failure. """ VerifyOutputFile(output_dir, GTEST_H_OUTPUT) VerifyOutputFile(output_dir, GTEST_ALL_CC_OUTPUT) def FuseGTestH(gtest_root, output_dir): """Scans folder gtest_root to generate gtest/gtest.h in output_dir.""" output_file = file(os.path.join(output_dir, GTEST_H_OUTPUT), 'w') processed_files = sets.Set() # Holds all gtest headers we've processed. def ProcessFile(gtest_header_path): """Processes the given gtest header file.""" # We don't process the same header twice. if gtest_header_path in processed_files: return processed_files.add(gtest_header_path) # Reads each line in the given gtest header. for line in file(os.path.join(gtest_root, gtest_header_path), 'r'): m = INCLUDE_GTEST_FILE_REGEX.match(line) if m: # It's '#include "gtest/..."' - let's process it recursively. ProcessFile('include/' + m.group(1)) else: # Otherwise we copy the line unchanged to the output file. output_file.write(line) ProcessFile(GTEST_H_SEED) output_file.close() def FuseGTestAllCcToFile(gtest_root, output_file): """Scans folder gtest_root to generate gtest/gtest-all.cc in output_file.""" processed_files = sets.Set() def ProcessFile(gtest_source_file): """Processes the given gtest source file.""" # We don't process the same #included file twice. if gtest_source_file in processed_files: return processed_files.add(gtest_source_file) # Reads each line in the given gtest source file. for line in file(os.path.join(gtest_root, gtest_source_file), 'r'): m = INCLUDE_GTEST_FILE_REGEX.match(line) if m: if 'include/' + m.group(1) == GTEST_SPI_H_SEED: # It's '#include "gtest/gtest-spi.h"'. This file is not # #included by "gtest/gtest.h", so we need to process it. ProcessFile(GTEST_SPI_H_SEED) else: # It's '#include "gtest/foo.h"' where foo is not gtest-spi. # We treat it as '#include "gtest/gtest.h"', as all other # gtest headers are being fused into gtest.h and cannot be # #included directly. # There is no need to #include "gtest/gtest.h" more than once. if not GTEST_H_SEED in processed_files: processed_files.add(GTEST_H_SEED) output_file.write('#include "%s"\n' % (GTEST_H_OUTPUT,)) else: m = INCLUDE_SRC_FILE_REGEX.match(line) if m: # It's '#include "src/foo"' - let's process it recursively. ProcessFile(m.group(1)) else: output_file.write(line) ProcessFile(GTEST_ALL_CC_SEED) def FuseGTestAllCc(gtest_root, output_dir): """Scans folder gtest_root to generate gtest/gtest-all.cc in output_dir.""" output_file = file(os.path.join(output_dir, GTEST_ALL_CC_OUTPUT), 'w') FuseGTestAllCcToFile(gtest_root, output_file) output_file.close() def FuseGTest(gtest_root, output_dir): """Fuses gtest.h and gtest-all.cc.""" ValidateGTestRootDir(gtest_root) ValidateOutputDir(output_dir) FuseGTestH(gtest_root, output_dir) FuseGTestAllCc(gtest_root, output_dir) def main(): argc = len(sys.argv) if argc == 2: # fuse_gtest_files.py OUTPUT_DIR FuseGTest(DEFAULT_GTEST_ROOT_DIR, sys.argv[1]) elif argc == 3: # fuse_gtest_files.py GTEST_ROOT_DIR OUTPUT_DIR FuseGTest(sys.argv[1], sys.argv[2]) else: print __doc__ sys.exit(1) if __name__ == '__main__': main() synergy-1.4.12-Source/tools/gtest-1.6.0/scripts/gen_gtest_pred_impl.py0000600000175000017500000005274011561126632025523 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """gen_gtest_pred_impl.py v0.1 Generates the implementation of Google Test predicate assertions and accompanying tests. Usage: gen_gtest_pred_impl.py MAX_ARITY where MAX_ARITY is a positive integer. The command generates the implementation of up-to MAX_ARITY-ary predicate assertions, and writes it to file gtest_pred_impl.h in the directory where the script is. It also generates the accompanying unit test in file gtest_pred_impl_unittest.cc. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import sys import time # Where this script is. SCRIPT_DIR = os.path.dirname(sys.argv[0]) # Where to store the generated header. HEADER = os.path.join(SCRIPT_DIR, '../include/gtest/gtest_pred_impl.h') # Where to store the generated unit test. UNIT_TEST = os.path.join(SCRIPT_DIR, '../test/gtest_pred_impl_unittest.cc') def HeaderPreamble(n): """Returns the preamble for the header file. Args: n: the maximum arity of the predicate macros to be generated. """ # A map that defines the values used in the preamble template. DEFS = { 'today' : time.strftime('%m/%d/%Y'), 'year' : time.strftime('%Y'), 'command' : '%s %s' % (os.path.basename(sys.argv[0]), n), 'n' : n } return ( """// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on %(today)s by command // '%(command)s'. DO NOT EDIT BY HAND! // // Implements a family of generic predicate assertion macros. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Makes sure this header is not included before gtest.h. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ #error Do not include gtest_pred_impl.h directly. Include gtest.h instead. #endif // GTEST_INCLUDE_GTEST_GTEST_H_ // This header implements a family of generic predicate assertion // macros: // // ASSERT_PRED_FORMAT1(pred_format, v1) // ASSERT_PRED_FORMAT2(pred_format, v1, v2) // ... // // where pred_format is a function or functor that takes n (in the // case of ASSERT_PRED_FORMATn) values and their source expression // text, and returns a testing::AssertionResult. See the definition // of ASSERT_EQ in gtest.h for an example. // // If you don't care about formatting, you can use the more // restrictive version: // // ASSERT_PRED1(pred, v1) // ASSERT_PRED2(pred, v1, v2) // ... // // where pred is an n-ary function or functor that returns bool, // and the values v1, v2, ..., must support the << operator for // streaming to std::ostream. // // We also define the EXPECT_* variations. // // For now we only support predicates whose arity is at most %(n)s. // Please email googletestframework@googlegroups.com if you need // support for higher arities. // GTEST_ASSERT_ is the basic statement to which all of the assertions // in this file reduce. Don't use this in your code. #define GTEST_ASSERT_(expression, on_failure) \\ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \\ if (const ::testing::AssertionResult gtest_ar = (expression)) \\ ; \\ else \\ on_failure(gtest_ar.failure_message()) """ % DEFS) def Arity(n): """Returns the English name of the given arity.""" if n < 0: return None elif n <= 3: return ['nullary', 'unary', 'binary', 'ternary'][n] else: return '%s-ary' % n def Title(word): """Returns the given word in title case. The difference between this and string's title() method is that Title('4-ary') is '4-ary' while '4-ary'.title() is '4-Ary'.""" return word[0].upper() + word[1:] def OneTo(n): """Returns the list [1, 2, 3, ..., n].""" return range(1, n + 1) def Iter(n, format, sep=''): """Given a positive integer n, a format string that contains 0 or more '%s' format specs, and optionally a separator string, returns the join of n strings, each formatted with the format string on an iterator ranged from 1 to n. Example: Iter(3, 'v%s', sep=', ') returns 'v1, v2, v3'. """ # How many '%s' specs are in format? spec_count = len(format.split('%s')) - 1 return sep.join([format % (spec_count * (i,)) for i in OneTo(n)]) def ImplementationForArity(n): """Returns the implementation of n-ary predicate assertions.""" # A map the defines the values used in the implementation template. DEFS = { 'n' : str(n), 'vs' : Iter(n, 'v%s', sep=', '), 'vts' : Iter(n, '#v%s', sep=', '), 'arity' : Arity(n), 'Arity' : Title(Arity(n)) } impl = """ // Helper function for implementing {EXPECT|ASSERT}_PRED%(n)s. Don't use // this in your code. template AssertionResult AssertPred%(n)sHelper(const char* pred_text""" % DEFS impl += Iter(n, """, const char* e%s""") impl += """, Pred pred""" impl += Iter(n, """, const T%s& v%s""") impl += """) { if (pred(%(vs)s)) return AssertionSuccess(); """ % DEFS impl += ' return AssertionFailure() << pred_text << "("' impl += Iter(n, """ << e%s""", sep=' << ", "') impl += ' << ") evaluates to false, where"' impl += Iter(n, """ << "\\n" << e%s << " evaluates to " << v%s""") impl += """; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT%(n)s. // Don't use this in your code. #define GTEST_PRED_FORMAT%(n)s_(pred_format, %(vs)s, on_failure)\\ GTEST_ASSERT_(pred_format(%(vts)s, %(vs)s),\\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED%(n)s. Don't use // this in your code. #define GTEST_PRED%(n)s_(pred, %(vs)s, on_failure)\\ GTEST_ASSERT_(::testing::AssertPred%(n)sHelper(#pred""" % DEFS impl += Iter(n, """, \\ #v%s""") impl += """, \\ pred""" impl += Iter(n, """, \\ v%s""") impl += """), on_failure) // %(Arity)s predicate assertion macros. #define EXPECT_PRED_FORMAT%(n)s(pred_format, %(vs)s) \\ GTEST_PRED_FORMAT%(n)s_(pred_format, %(vs)s, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED%(n)s(pred, %(vs)s) \\ GTEST_PRED%(n)s_(pred, %(vs)s, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT%(n)s(pred_format, %(vs)s) \\ GTEST_PRED_FORMAT%(n)s_(pred_format, %(vs)s, GTEST_FATAL_FAILURE_) #define ASSERT_PRED%(n)s(pred, %(vs)s) \\ GTEST_PRED%(n)s_(pred, %(vs)s, GTEST_FATAL_FAILURE_) """ % DEFS return impl def HeaderPostamble(): """Returns the postamble for the header file.""" return """ #endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ """ def GenerateFile(path, content): """Given a file path and a content string, overwrites it with the given content.""" print 'Updating file %s . . .' % path f = file(path, 'w+') print >>f, content, f.close() print 'File %s has been updated.' % path def GenerateHeader(n): """Given the maximum arity n, updates the header file that implements the predicate assertions.""" GenerateFile(HEADER, HeaderPreamble(n) + ''.join([ImplementationForArity(i) for i in OneTo(n)]) + HeaderPostamble()) def UnitTestPreamble(): """Returns the preamble for the unit test file.""" # A map that defines the values used in the preamble template. DEFS = { 'today' : time.strftime('%m/%d/%Y'), 'year' : time.strftime('%Y'), 'command' : '%s %s' % (os.path.basename(sys.argv[0]), sys.argv[1]), } return ( """// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on %(today)s by command // '%(command)s'. DO NOT EDIT BY HAND! // Regression test for gtest_pred_impl.h // // This file is generated by a script and quite long. If you intend to // learn how Google Test works by reading its unit tests, read // gtest_unittest.cc instead. // // This is intended as a regression test for the Google Test predicate // assertions. We compile it as part of the gtest_unittest target // only to keep the implementation tidy and compact, as it is quite // involved to set up the stage for testing Google Test using Google // Test itself. // // Currently, gtest_unittest takes ~11 seconds to run in the testing // daemon. In the future, if it grows too large and needs much more // time to finish, we should consider separating this file into a // stand-alone regression test. #include #include "gtest/gtest.h" #include "gtest/gtest-spi.h" // A user-defined data type. struct Bool { explicit Bool(int val) : value(val != 0) {} bool operator>(int n) const { return value > Bool(n).value; } Bool operator+(const Bool& rhs) const { return Bool(value + rhs.value); } bool operator==(const Bool& rhs) const { return value == rhs.value; } bool value; }; // Enables Bool to be used in assertions. std::ostream& operator<<(std::ostream& os, const Bool& x) { return os << (x.value ? "true" : "false"); } """ % DEFS) def TestsForArity(n): """Returns the tests for n-ary predicate assertions.""" # A map that defines the values used in the template for the tests. DEFS = { 'n' : n, 'es' : Iter(n, 'e%s', sep=', '), 'vs' : Iter(n, 'v%s', sep=', '), 'vts' : Iter(n, '#v%s', sep=', '), 'tvs' : Iter(n, 'T%s v%s', sep=', '), 'int_vs' : Iter(n, 'int v%s', sep=', '), 'Bool_vs' : Iter(n, 'Bool v%s', sep=', '), 'types' : Iter(n, 'typename T%s', sep=', '), 'v_sum' : Iter(n, 'v%s', sep=' + '), 'arity' : Arity(n), 'Arity' : Title(Arity(n)), } tests = ( """// Sample functions/functors for testing %(arity)s predicate assertions. // A %(arity)s predicate function. template <%(types)s> bool PredFunction%(n)s(%(tvs)s) { return %(v_sum)s > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction%(n)sInt(%(int_vs)s) { return %(v_sum)s > 0; } bool PredFunction%(n)sBool(%(Bool_vs)s) { return %(v_sum)s > 0; } """ % DEFS) tests += """ // A %(arity)s predicate functor. struct PredFunctor%(n)s { template <%(types)s> bool operator()(""" % DEFS tests += Iter(n, 'const T%s& v%s', sep=""", """) tests += """) { return %(v_sum)s > 0; } }; """ % DEFS tests += """ // A %(arity)s predicate-formatter function. template <%(types)s> testing::AssertionResult PredFormatFunction%(n)s(""" % DEFS tests += Iter(n, 'const char* e%s', sep=""", """) tests += Iter(n, """, const T%s& v%s""") tests += """) { if (PredFunction%(n)s(%(vs)s)) return testing::AssertionSuccess(); return testing::AssertionFailure() << """ % DEFS tests += Iter(n, 'e%s', sep=' << " + " << ') tests += """ << " is expected to be positive, but evaluates to " << %(v_sum)s << "."; } """ % DEFS tests += """ // A %(arity)s predicate-formatter functor. struct PredFormatFunctor%(n)s { template <%(types)s> testing::AssertionResult operator()(""" % DEFS tests += Iter(n, 'const char* e%s', sep=""", """) tests += Iter(n, """, const T%s& v%s""") tests += """) const { return PredFormatFunction%(n)s(%(es)s, %(vs)s); } }; """ % DEFS tests += """ // Tests for {EXPECT|ASSERT}_PRED_FORMAT%(n)s. class Predicate%(n)sTest : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false;""" % DEFS tests += """ """ + Iter(n, 'n%s_ = ') + """0; } """ tests += """ virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once.""" tests += ''.join([""" EXPECT_EQ(1, n%s_) << "The predicate assertion didn't evaluate argument %s " "exactly once.";""" % (i, i + 1) for i in OneTo(n)]) tests += """ // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; """ % DEFS tests += Iter(n, """ static int n%s_;""") tests += """ }; bool Predicate%(n)sTest::expected_to_finish_; bool Predicate%(n)sTest::finished_; """ % DEFS tests += Iter(n, """int Predicate%%(n)sTest::n%s_; """) % DEFS tests += """ typedef Predicate%(n)sTest EXPECT_PRED_FORMAT%(n)sTest; typedef Predicate%(n)sTest ASSERT_PRED_FORMAT%(n)sTest; typedef Predicate%(n)sTest EXPECT_PRED%(n)sTest; typedef Predicate%(n)sTest ASSERT_PRED%(n)sTest; """ % DEFS def GenTest(use_format, use_assert, expect_failure, use_functor, use_user_type): """Returns the test for a predicate assertion macro. Args: use_format: true iff the assertion is a *_PRED_FORMAT*. use_assert: true iff the assertion is a ASSERT_*. expect_failure: true iff the assertion is expected to fail. use_functor: true iff the first argument of the assertion is a functor (as opposed to a function) use_user_type: true iff the predicate functor/function takes argument(s) of a user-defined type. Example: GenTest(1, 0, 0, 1, 0) returns a test that tests the behavior of a successful EXPECT_PRED_FORMATn() that takes a functor whose arguments have built-in types.""" if use_assert: assrt = 'ASSERT' # 'assert' is reserved, so we cannot use # that identifier here. else: assrt = 'EXPECT' assertion = assrt + '_PRED' if use_format: pred_format = 'PredFormat' assertion += '_FORMAT' else: pred_format = 'Pred' assertion += '%(n)s' % DEFS if use_functor: pred_format_type = 'functor' pred_format += 'Functor%(n)s()' else: pred_format_type = 'function' pred_format += 'Function%(n)s' if not use_format: if use_user_type: pred_format += 'Bool' else: pred_format += 'Int' test_name = pred_format_type.title() if use_user_type: arg_type = 'user-defined type (Bool)' test_name += 'OnUserType' if expect_failure: arg = 'Bool(n%s_++)' else: arg = 'Bool(++n%s_)' else: arg_type = 'built-in type (int)' test_name += 'OnBuiltInType' if expect_failure: arg = 'n%s_++' else: arg = '++n%s_' if expect_failure: successful_or_failed = 'failed' expected_or_not = 'expected.' test_name += 'Failure' else: successful_or_failed = 'successful' expected_or_not = 'UNEXPECTED!' test_name += 'Success' # A map that defines the values used in the test template. defs = DEFS.copy() defs.update({ 'assert' : assrt, 'assertion' : assertion, 'test_name' : test_name, 'pf_type' : pred_format_type, 'pf' : pred_format, 'arg_type' : arg_type, 'arg' : arg, 'successful' : successful_or_failed, 'expected' : expected_or_not, }) test = """ // Tests a %(successful)s %(assertion)s where the // predicate-formatter is a %(pf_type)s on a %(arg_type)s. TEST_F(%(assertion)sTest, %(test_name)s) {""" % defs indent = (len(assertion) + 3)*' ' extra_indent = '' if expect_failure: extra_indent = ' ' if use_assert: test += """ expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT""" else: test += """ EXPECT_NONFATAL_FAILURE({ // NOLINT""" test += '\n' + extra_indent + """ %(assertion)s(%(pf)s""" % defs test = test % defs test += Iter(n, ',\n' + indent + extra_indent + '%(arg)s' % defs) test += ');\n' + extra_indent + ' finished_ = true;\n' if expect_failure: test += ' }, "");\n' test += '}\n' return test # Generates tests for all 2**6 = 64 combinations. tests += ''.join([GenTest(use_format, use_assert, expect_failure, use_functor, use_user_type) for use_format in [0, 1] for use_assert in [0, 1] for expect_failure in [0, 1] for use_functor in [0, 1] for use_user_type in [0, 1] ]) return tests def UnitTestPostamble(): """Returns the postamble for the tests.""" return '' def GenerateUnitTest(n): """Returns the tests for up-to n-ary predicate assertions.""" GenerateFile(UNIT_TEST, UnitTestPreamble() + ''.join([TestsForArity(i) for i in OneTo(n)]) + UnitTestPostamble()) def _Main(): """The entry point of the script. Generates the header file and its unit test.""" if len(sys.argv) != 2: print __doc__ print 'Author: ' + __author__ sys.exit(1) n = int(sys.argv[1]) GenerateHeader(n) GenerateUnitTest(n) if __name__ == '__main__': _Main() synergy-1.4.12-Source/tools/gtest-1.6.0/scripts/gtest-config.in0000600000175000017500000002354311561126632024057 0ustar synergysynergy#!/bin/sh # These variables are automatically filled in by the configure script. name="@PACKAGE_TARNAME@" version="@PACKAGE_VERSION@" show_usage() { echo "Usage: gtest-config [OPTIONS...]" } show_help() { show_usage cat <<\EOF The `gtest-config' script provides access to the necessary compile and linking flags to connect with Google C++ Testing Framework, both in a build prior to installation, and on the system proper after installation. The installation overrides may be issued in combination with any other queries, but will only affect installation queries if called on a built but not installed gtest. The installation queries may not be issued with any other types of queries, and only one installation query may be made at a time. The version queries and compiler flag queries may be combined as desired but not mixed. Different version queries are always combined with logical "and" semantics, and only the last of any particular query is used while all previous ones ignored. All versions must be specified as a sequence of numbers separated by periods. Compiler flag queries output the union of the sets of flags when combined. Examples: gtest-config --min-version=1.0 || echo "Insufficient Google Test version." g++ $(gtest-config --cppflags --cxxflags) -o foo.o -c foo.cpp g++ $(gtest-config --ldflags --libs) -o foo foo.o # When using a built but not installed Google Test: g++ $(../../my_gtest_build/scripts/gtest-config ...) ... # When using an installed Google Test, but with installation overrides: export GTEST_PREFIX="/opt" g++ $(gtest-config --libdir="/opt/lib64" ...) ... Help: --usage brief usage information --help display this help message Installation Overrides: --prefix= overrides the installation prefix --exec-prefix= overrides the executable installation prefix --libdir= overrides the library installation prefix --includedir= overrides the header file installation prefix Installation Queries: --prefix installation prefix --exec-prefix executable installation prefix --libdir library installation directory --includedir header file installation directory --version the version of the Google Test installation Version Queries: --min-version=VERSION return 0 if the version is at least VERSION --exact-version=VERSION return 0 if the version is exactly VERSION --max-version=VERSION return 0 if the version is at most VERSION Compilation Flag Queries: --cppflags compile flags specific to the C-like preprocessors --cxxflags compile flags appropriate for C++ programs --ldflags linker flags --libs libraries for linking EOF } # This function bounds our version with a min and a max. It uses some clever # POSIX-compliant variable expansion to portably do all the work in the shell # and avoid any dependency on a particular "sed" or "awk" implementation. # Notable is that it will only ever compare the first 3 components of versions. # Further components will be cleanly stripped off. All versions must be # unadorned, so "v1.0" will *not* work. The minimum version must be in $1, and # the max in $2. TODO(chandlerc@google.com): If this ever breaks, we should # investigate expanding this via autom4te from AS_VERSION_COMPARE rather than # continuing to maintain our own shell version. check_versions() { major_version=${version%%.*} minor_version="0" point_version="0" if test "${version#*.}" != "${version}"; then minor_version=${version#*.} minor_version=${minor_version%%.*} fi if test "${version#*.*.}" != "${version}"; then point_version=${version#*.*.} point_version=${point_version%%.*} fi min_version="$1" min_major_version=${min_version%%.*} min_minor_version="0" min_point_version="0" if test "${min_version#*.}" != "${min_version}"; then min_minor_version=${min_version#*.} min_minor_version=${min_minor_version%%.*} fi if test "${min_version#*.*.}" != "${min_version}"; then min_point_version=${min_version#*.*.} min_point_version=${min_point_version%%.*} fi max_version="$2" max_major_version=${max_version%%.*} max_minor_version="0" max_point_version="0" if test "${max_version#*.}" != "${max_version}"; then max_minor_version=${max_version#*.} max_minor_version=${max_minor_version%%.*} fi if test "${max_version#*.*.}" != "${max_version}"; then max_point_version=${max_version#*.*.} max_point_version=${max_point_version%%.*} fi test $(($major_version)) -lt $(($min_major_version)) && exit 1 if test $(($major_version)) -eq $(($min_major_version)); then test $(($minor_version)) -lt $(($min_minor_version)) && exit 1 if test $(($minor_version)) -eq $(($min_minor_version)); then test $(($point_version)) -lt $(($min_point_version)) && exit 1 fi fi test $(($major_version)) -gt $(($max_major_version)) && exit 1 if test $(($major_version)) -eq $(($max_major_version)); then test $(($minor_version)) -gt $(($max_minor_version)) && exit 1 if test $(($minor_version)) -eq $(($max_minor_version)); then test $(($point_version)) -gt $(($max_point_version)) && exit 1 fi fi exit 0 } # Show the usage line when no arguments are specified. if test $# -eq 0; then show_usage exit 1 fi while test $# -gt 0; do case $1 in --usage) show_usage; exit 0;; --help) show_help; exit 0;; # Installation overrides --prefix=*) GTEST_PREFIX=${1#--prefix=};; --exec-prefix=*) GTEST_EXEC_PREFIX=${1#--exec-prefix=};; --libdir=*) GTEST_LIBDIR=${1#--libdir=};; --includedir=*) GTEST_INCLUDEDIR=${1#--includedir=};; # Installation queries --prefix|--exec-prefix|--libdir|--includedir|--version) if test -n "${do_query}"; then show_usage exit 1 fi do_query=${1#--} ;; # Version checking --min-version=*) do_check_versions=yes min_version=${1#--min-version=} ;; --max-version=*) do_check_versions=yes max_version=${1#--max-version=} ;; --exact-version=*) do_check_versions=yes exact_version=${1#--exact-version=} ;; # Compiler flag output --cppflags) echo_cppflags=yes;; --cxxflags) echo_cxxflags=yes;; --ldflags) echo_ldflags=yes;; --libs) echo_libs=yes;; # Everything else is an error *) show_usage; exit 1;; esac shift done # These have defaults filled in by the configure script but can also be # overridden by environment variables or command line parameters. prefix="${GTEST_PREFIX:-@prefix@}" exec_prefix="${GTEST_EXEC_PREFIX:-@exec_prefix@}" libdir="${GTEST_LIBDIR:-@libdir@}" includedir="${GTEST_INCLUDEDIR:-@includedir@}" # We try and detect if our binary is not located at its installed location. If # it's not, we provide variables pointing to the source and build tree rather # than to the install tree. This allows building against a just-built gtest # rather than an installed gtest. bindir="@bindir@" this_relative_bindir=`dirname $0` this_bindir=`cd ${this_relative_bindir}; pwd -P` if test "${this_bindir}" = "${this_bindir%${bindir}}"; then # The path to the script doesn't end in the bindir sequence from Autoconf, # assume that we are in a build tree. build_dir=`dirname ${this_bindir}` src_dir=`cd ${this_bindir}/@top_srcdir@; pwd -P` # TODO(chandlerc@google.com): This is a dangerous dependency on libtool, we # should work to remove it, and/or remove libtool altogether, replacing it # with direct references to the library and a link path. gtest_libs="${build_dir}/lib/libgtest.la @PTHREAD_CFLAGS@ @PTHREAD_LIBS@" gtest_ldflags="" # We provide hooks to include from either the source or build dir, where the # build dir is always preferred. This will potentially allow us to write # build rules for generated headers and have them automatically be preferred # over provided versions. gtest_cppflags="-I${build_dir}/include -I${src_dir}/include" gtest_cxxflags="@PTHREAD_CFLAGS@" else # We're using an installed gtest, although it may be staged under some # prefix. Assume (as our own libraries do) that we can resolve the prefix, # and are present in the dynamic link paths. gtest_ldflags="-L${libdir}" gtest_libs="-l${name} @PTHREAD_CFLAGS@ @PTHREAD_LIBS@" gtest_cppflags="-I${includedir}" gtest_cxxflags="@PTHREAD_CFLAGS@" fi # Do an installation query if requested. if test -n "$do_query"; then case $do_query in prefix) echo $prefix; exit 0;; exec-prefix) echo $exec_prefix; exit 0;; libdir) echo $libdir; exit 0;; includedir) echo $includedir; exit 0;; version) echo $version; exit 0;; *) show_usage; exit 1;; esac fi # Do a version check if requested. if test "$do_check_versions" = "yes"; then # Make sure we didn't receive a bad combination of parameters. test "$echo_cppflags" = "yes" && show_usage && exit 1 test "$echo_cxxflags" = "yes" && show_usage && exit 1 test "$echo_ldflags" = "yes" && show_usage && exit 1 test "$echo_libs" = "yes" && show_usage && exit 1 if test "$exact_version" != ""; then check_versions $exact_version $exact_version # unreachable else check_versions ${min_version:-0.0.0} ${max_version:-9999.9999.9999} # unreachable fi fi # Do the output in the correct order so that these can be used in-line of # a compiler invocation. output="" test "$echo_cppflags" = "yes" && output="$output $gtest_cppflags" test "$echo_cxxflags" = "yes" && output="$output $gtest_cxxflags" test "$echo_ldflags" = "yes" && output="$output $gtest_ldflags" test "$echo_libs" = "yes" && output="$output $gtest_libs" echo $output exit 0 synergy-1.4.12-Source/tools/gtest-1.6.0/scripts/pump.py0000600000175000017500000005542411561126632022474 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """pump v0.2.0 - Pretty Useful for Meta Programming. A tool for preprocessor meta programming. Useful for generating repetitive boilerplate code. Especially useful for writing C++ classes, functions, macros, and templates that need to work with various number of arguments. USAGE: pump.py SOURCE_FILE EXAMPLES: pump.py foo.cc.pump Converts foo.cc.pump to foo.cc. GRAMMAR: CODE ::= ATOMIC_CODE* ATOMIC_CODE ::= $var ID = EXPRESSION | $var ID = [[ CODE ]] | $range ID EXPRESSION..EXPRESSION | $for ID SEPARATOR [[ CODE ]] | $($) | $ID | $(EXPRESSION) | $if EXPRESSION [[ CODE ]] ELSE_BRANCH | [[ CODE ]] | RAW_CODE SEPARATOR ::= RAW_CODE | EMPTY ELSE_BRANCH ::= $else [[ CODE ]] | $elif EXPRESSION [[ CODE ]] ELSE_BRANCH | EMPTY EXPRESSION has Python syntax. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sys TOKEN_TABLE = [ (re.compile(r'\$var\s+'), '$var'), (re.compile(r'\$elif\s+'), '$elif'), (re.compile(r'\$else\s+'), '$else'), (re.compile(r'\$for\s+'), '$for'), (re.compile(r'\$if\s+'), '$if'), (re.compile(r'\$range\s+'), '$range'), (re.compile(r'\$[_A-Za-z]\w*'), '$id'), (re.compile(r'\$\(\$\)'), '$($)'), (re.compile(r'\$'), '$'), (re.compile(r'\[\[\n?'), '[['), (re.compile(r'\]\]\n?'), ']]'), ] class Cursor: """Represents a position (line and column) in a text file.""" def __init__(self, line=-1, column=-1): self.line = line self.column = column def __eq__(self, rhs): return self.line == rhs.line and self.column == rhs.column def __ne__(self, rhs): return not self == rhs def __lt__(self, rhs): return self.line < rhs.line or ( self.line == rhs.line and self.column < rhs.column) def __le__(self, rhs): return self < rhs or self == rhs def __gt__(self, rhs): return rhs < self def __ge__(self, rhs): return rhs <= self def __str__(self): if self == Eof(): return 'EOF' else: return '%s(%s)' % (self.line + 1, self.column) def __add__(self, offset): return Cursor(self.line, self.column + offset) def __sub__(self, offset): return Cursor(self.line, self.column - offset) def Clone(self): """Returns a copy of self.""" return Cursor(self.line, self.column) # Special cursor to indicate the end-of-file. def Eof(): """Returns the special cursor to denote the end-of-file.""" return Cursor(-1, -1) class Token: """Represents a token in a Pump source file.""" def __init__(self, start=None, end=None, value=None, token_type=None): if start is None: self.start = Eof() else: self.start = start if end is None: self.end = Eof() else: self.end = end self.value = value self.token_type = token_type def __str__(self): return 'Token @%s: \'%s\' type=%s' % ( self.start, self.value, self.token_type) def Clone(self): """Returns a copy of self.""" return Token(self.start.Clone(), self.end.Clone(), self.value, self.token_type) def StartsWith(lines, pos, string): """Returns True iff the given position in lines starts with 'string'.""" return lines[pos.line][pos.column:].startswith(string) def FindFirstInLine(line, token_table): best_match_start = -1 for (regex, token_type) in token_table: m = regex.search(line) if m: # We found regex in lines if best_match_start < 0 or m.start() < best_match_start: best_match_start = m.start() best_match_length = m.end() - m.start() best_match_token_type = token_type if best_match_start < 0: return None return (best_match_start, best_match_length, best_match_token_type) def FindFirst(lines, token_table, cursor): """Finds the first occurrence of any string in strings in lines.""" start = cursor.Clone() cur_line_number = cursor.line for line in lines[start.line:]: if cur_line_number == start.line: line = line[start.column:] m = FindFirstInLine(line, token_table) if m: # We found a regex in line. (start_column, length, token_type) = m if cur_line_number == start.line: start_column += start.column found_start = Cursor(cur_line_number, start_column) found_end = found_start + length return MakeToken(lines, found_start, found_end, token_type) cur_line_number += 1 # We failed to find str in lines return None def SubString(lines, start, end): """Returns a substring in lines.""" if end == Eof(): end = Cursor(len(lines) - 1, len(lines[-1])) if start >= end: return '' if start.line == end.line: return lines[start.line][start.column:end.column] result_lines = ([lines[start.line][start.column:]] + lines[start.line + 1:end.line] + [lines[end.line][:end.column]]) return ''.join(result_lines) def StripMetaComments(str): """Strip meta comments from each line in the given string.""" # First, completely remove lines containing nothing but a meta # comment, including the trailing \n. str = re.sub(r'^\s*\$\$.*\n', '', str) # Then, remove meta comments from contentful lines. return re.sub(r'\s*\$\$.*', '', str) def MakeToken(lines, start, end, token_type): """Creates a new instance of Token.""" return Token(start, end, SubString(lines, start, end), token_type) def ParseToken(lines, pos, regex, token_type): line = lines[pos.line][pos.column:] m = regex.search(line) if m and not m.start(): return MakeToken(lines, pos, pos + m.end(), token_type) else: print 'ERROR: %s expected at %s.' % (token_type, pos) sys.exit(1) ID_REGEX = re.compile(r'[_A-Za-z]\w*') EQ_REGEX = re.compile(r'=') REST_OF_LINE_REGEX = re.compile(r'.*?(?=$|\$\$)') OPTIONAL_WHITE_SPACES_REGEX = re.compile(r'\s*') WHITE_SPACE_REGEX = re.compile(r'\s') DOT_DOT_REGEX = re.compile(r'\.\.') def Skip(lines, pos, regex): line = lines[pos.line][pos.column:] m = re.search(regex, line) if m and not m.start(): return pos + m.end() else: return pos def SkipUntil(lines, pos, regex, token_type): line = lines[pos.line][pos.column:] m = re.search(regex, line) if m: return pos + m.start() else: print ('ERROR: %s expected on line %s after column %s.' % (token_type, pos.line + 1, pos.column)) sys.exit(1) def ParseExpTokenInParens(lines, pos): def ParseInParens(pos): pos = Skip(lines, pos, OPTIONAL_WHITE_SPACES_REGEX) pos = Skip(lines, pos, r'\(') pos = Parse(pos) pos = Skip(lines, pos, r'\)') return pos def Parse(pos): pos = SkipUntil(lines, pos, r'\(|\)', ')') if SubString(lines, pos, pos + 1) == '(': pos = Parse(pos + 1) pos = Skip(lines, pos, r'\)') return Parse(pos) else: return pos start = pos.Clone() pos = ParseInParens(pos) return MakeToken(lines, start, pos, 'exp') def RStripNewLineFromToken(token): if token.value.endswith('\n'): return Token(token.start, token.end, token.value[:-1], token.token_type) else: return token def TokenizeLines(lines, pos): while True: found = FindFirst(lines, TOKEN_TABLE, pos) if not found: yield MakeToken(lines, pos, Eof(), 'code') return if found.start == pos: prev_token = None prev_token_rstripped = None else: prev_token = MakeToken(lines, pos, found.start, 'code') prev_token_rstripped = RStripNewLineFromToken(prev_token) if found.token_type == '$var': if prev_token_rstripped: yield prev_token_rstripped yield found id_token = ParseToken(lines, found.end, ID_REGEX, 'id') yield id_token pos = Skip(lines, id_token.end, OPTIONAL_WHITE_SPACES_REGEX) eq_token = ParseToken(lines, pos, EQ_REGEX, '=') yield eq_token pos = Skip(lines, eq_token.end, r'\s*') if SubString(lines, pos, pos + 2) != '[[': exp_token = ParseToken(lines, pos, REST_OF_LINE_REGEX, 'exp') yield exp_token pos = Cursor(exp_token.end.line + 1, 0) elif found.token_type == '$for': if prev_token_rstripped: yield prev_token_rstripped yield found id_token = ParseToken(lines, found.end, ID_REGEX, 'id') yield id_token pos = Skip(lines, id_token.end, WHITE_SPACE_REGEX) elif found.token_type == '$range': if prev_token_rstripped: yield prev_token_rstripped yield found id_token = ParseToken(lines, found.end, ID_REGEX, 'id') yield id_token pos = Skip(lines, id_token.end, OPTIONAL_WHITE_SPACES_REGEX) dots_pos = SkipUntil(lines, pos, DOT_DOT_REGEX, '..') yield MakeToken(lines, pos, dots_pos, 'exp') yield MakeToken(lines, dots_pos, dots_pos + 2, '..') pos = dots_pos + 2 new_pos = Cursor(pos.line + 1, 0) yield MakeToken(lines, pos, new_pos, 'exp') pos = new_pos elif found.token_type == '$': if prev_token: yield prev_token yield found exp_token = ParseExpTokenInParens(lines, found.end) yield exp_token pos = exp_token.end elif (found.token_type == ']]' or found.token_type == '$if' or found.token_type == '$elif' or found.token_type == '$else'): if prev_token_rstripped: yield prev_token_rstripped yield found pos = found.end else: if prev_token: yield prev_token yield found pos = found.end def Tokenize(s): """A generator that yields the tokens in the given string.""" if s != '': lines = s.splitlines(True) for token in TokenizeLines(lines, Cursor(0, 0)): yield token class CodeNode: def __init__(self, atomic_code_list=None): self.atomic_code = atomic_code_list class VarNode: def __init__(self, identifier=None, atomic_code=None): self.identifier = identifier self.atomic_code = atomic_code class RangeNode: def __init__(self, identifier=None, exp1=None, exp2=None): self.identifier = identifier self.exp1 = exp1 self.exp2 = exp2 class ForNode: def __init__(self, identifier=None, sep=None, code=None): self.identifier = identifier self.sep = sep self.code = code class ElseNode: def __init__(self, else_branch=None): self.else_branch = else_branch class IfNode: def __init__(self, exp=None, then_branch=None, else_branch=None): self.exp = exp self.then_branch = then_branch self.else_branch = else_branch class RawCodeNode: def __init__(self, token=None): self.raw_code = token class LiteralDollarNode: def __init__(self, token): self.token = token class ExpNode: def __init__(self, token, python_exp): self.token = token self.python_exp = python_exp def PopFront(a_list): head = a_list[0] a_list[:1] = [] return head def PushFront(a_list, elem): a_list[:0] = [elem] def PopToken(a_list, token_type=None): token = PopFront(a_list) if token_type is not None and token.token_type != token_type: print 'ERROR: %s expected at %s' % (token_type, token.start) print 'ERROR: %s found instead' % (token,) sys.exit(1) return token def PeekToken(a_list): if not a_list: return None return a_list[0] def ParseExpNode(token): python_exp = re.sub(r'([_A-Za-z]\w*)', r'self.GetValue("\1")', token.value) return ExpNode(token, python_exp) def ParseElseNode(tokens): def Pop(token_type=None): return PopToken(tokens, token_type) next = PeekToken(tokens) if not next: return None if next.token_type == '$else': Pop('$else') Pop('[[') code_node = ParseCodeNode(tokens) Pop(']]') return code_node elif next.token_type == '$elif': Pop('$elif') exp = Pop('code') Pop('[[') code_node = ParseCodeNode(tokens) Pop(']]') inner_else_node = ParseElseNode(tokens) return CodeNode([IfNode(ParseExpNode(exp), code_node, inner_else_node)]) elif not next.value.strip(): Pop('code') return ParseElseNode(tokens) else: return None def ParseAtomicCodeNode(tokens): def Pop(token_type=None): return PopToken(tokens, token_type) head = PopFront(tokens) t = head.token_type if t == 'code': return RawCodeNode(head) elif t == '$var': id_token = Pop('id') Pop('=') next = PeekToken(tokens) if next.token_type == 'exp': exp_token = Pop() return VarNode(id_token, ParseExpNode(exp_token)) Pop('[[') code_node = ParseCodeNode(tokens) Pop(']]') return VarNode(id_token, code_node) elif t == '$for': id_token = Pop('id') next_token = PeekToken(tokens) if next_token.token_type == 'code': sep_token = next_token Pop('code') else: sep_token = None Pop('[[') code_node = ParseCodeNode(tokens) Pop(']]') return ForNode(id_token, sep_token, code_node) elif t == '$if': exp_token = Pop('code') Pop('[[') code_node = ParseCodeNode(tokens) Pop(']]') else_node = ParseElseNode(tokens) return IfNode(ParseExpNode(exp_token), code_node, else_node) elif t == '$range': id_token = Pop('id') exp1_token = Pop('exp') Pop('..') exp2_token = Pop('exp') return RangeNode(id_token, ParseExpNode(exp1_token), ParseExpNode(exp2_token)) elif t == '$id': return ParseExpNode(Token(head.start + 1, head.end, head.value[1:], 'id')) elif t == '$($)': return LiteralDollarNode(head) elif t == '$': exp_token = Pop('exp') return ParseExpNode(exp_token) elif t == '[[': code_node = ParseCodeNode(tokens) Pop(']]') return code_node else: PushFront(tokens, head) return None def ParseCodeNode(tokens): atomic_code_list = [] while True: if not tokens: break atomic_code_node = ParseAtomicCodeNode(tokens) if atomic_code_node: atomic_code_list.append(atomic_code_node) else: break return CodeNode(atomic_code_list) def ParseToAST(pump_src_text): """Convert the given Pump source text into an AST.""" tokens = list(Tokenize(pump_src_text)) code_node = ParseCodeNode(tokens) return code_node class Env: def __init__(self): self.variables = [] self.ranges = [] def Clone(self): clone = Env() clone.variables = self.variables[:] clone.ranges = self.ranges[:] return clone def PushVariable(self, var, value): # If value looks like an int, store it as an int. try: int_value = int(value) if ('%s' % int_value) == value: value = int_value except Exception: pass self.variables[:0] = [(var, value)] def PopVariable(self): self.variables[:1] = [] def PushRange(self, var, lower, upper): self.ranges[:0] = [(var, lower, upper)] def PopRange(self): self.ranges[:1] = [] def GetValue(self, identifier): for (var, value) in self.variables: if identifier == var: return value print 'ERROR: meta variable %s is undefined.' % (identifier,) sys.exit(1) def EvalExp(self, exp): try: result = eval(exp.python_exp) except Exception, e: print 'ERROR: caught exception %s: %s' % (e.__class__.__name__, e) print ('ERROR: failed to evaluate meta expression %s at %s' % (exp.python_exp, exp.token.start)) sys.exit(1) return result def GetRange(self, identifier): for (var, lower, upper) in self.ranges: if identifier == var: return (lower, upper) print 'ERROR: range %s is undefined.' % (identifier,) sys.exit(1) class Output: def __init__(self): self.string = '' def GetLastLine(self): index = self.string.rfind('\n') if index < 0: return '' return self.string[index + 1:] def Append(self, s): self.string += s def RunAtomicCode(env, node, output): if isinstance(node, VarNode): identifier = node.identifier.value.strip() result = Output() RunAtomicCode(env.Clone(), node.atomic_code, result) value = result.string env.PushVariable(identifier, value) elif isinstance(node, RangeNode): identifier = node.identifier.value.strip() lower = int(env.EvalExp(node.exp1)) upper = int(env.EvalExp(node.exp2)) env.PushRange(identifier, lower, upper) elif isinstance(node, ForNode): identifier = node.identifier.value.strip() if node.sep is None: sep = '' else: sep = node.sep.value (lower, upper) = env.GetRange(identifier) for i in range(lower, upper + 1): new_env = env.Clone() new_env.PushVariable(identifier, i) RunCode(new_env, node.code, output) if i != upper: output.Append(sep) elif isinstance(node, RawCodeNode): output.Append(node.raw_code.value) elif isinstance(node, IfNode): cond = env.EvalExp(node.exp) if cond: RunCode(env.Clone(), node.then_branch, output) elif node.else_branch is not None: RunCode(env.Clone(), node.else_branch, output) elif isinstance(node, ExpNode): value = env.EvalExp(node) output.Append('%s' % (value,)) elif isinstance(node, LiteralDollarNode): output.Append('$') elif isinstance(node, CodeNode): RunCode(env.Clone(), node, output) else: print 'BAD' print node sys.exit(1) def RunCode(env, code_node, output): for atomic_code in code_node.atomic_code: RunAtomicCode(env, atomic_code, output) def IsComment(cur_line): return '//' in cur_line def IsInPreprocessorDirevative(prev_lines, cur_line): if cur_line.lstrip().startswith('#'): return True return prev_lines != [] and prev_lines[-1].endswith('\\') def WrapComment(line, output): loc = line.find('//') before_comment = line[:loc].rstrip() if before_comment == '': indent = loc else: output.append(before_comment) indent = len(before_comment) - len(before_comment.lstrip()) prefix = indent*' ' + '// ' max_len = 80 - len(prefix) comment = line[loc + 2:].strip() segs = [seg for seg in re.split(r'(\w+\W*)', comment) if seg != ''] cur_line = '' for seg in segs: if len((cur_line + seg).rstrip()) < max_len: cur_line += seg else: if cur_line.strip() != '': output.append(prefix + cur_line.rstrip()) cur_line = seg.lstrip() if cur_line.strip() != '': output.append(prefix + cur_line.strip()) def WrapCode(line, line_concat, output): indent = len(line) - len(line.lstrip()) prefix = indent*' ' # Prefix of the current line max_len = 80 - indent - len(line_concat) # Maximum length of the current line new_prefix = prefix + 4*' ' # Prefix of a continuation line new_max_len = max_len - 4 # Maximum length of a continuation line # Prefers to wrap a line after a ',' or ';'. segs = [seg for seg in re.split(r'([^,;]+[,;]?)', line.strip()) if seg != ''] cur_line = '' # The current line without leading spaces. for seg in segs: # If the line is still too long, wrap at a space. while cur_line == '' and len(seg.strip()) > max_len: seg = seg.lstrip() split_at = seg.rfind(' ', 0, max_len) output.append(prefix + seg[:split_at].strip() + line_concat) seg = seg[split_at + 1:] prefix = new_prefix max_len = new_max_len if len((cur_line + seg).rstrip()) < max_len: cur_line = (cur_line + seg).lstrip() else: output.append(prefix + cur_line.rstrip() + line_concat) prefix = new_prefix max_len = new_max_len cur_line = seg.lstrip() if cur_line.strip() != '': output.append(prefix + cur_line.strip()) def WrapPreprocessorDirevative(line, output): WrapCode(line, ' \\', output) def WrapPlainCode(line, output): WrapCode(line, '', output) def IsHeaderGuardOrInclude(line): return (re.match(r'^#(ifndef|define|endif\s*//)\s*[\w_]+\s*$', line) or re.match(r'^#include\s', line)) def WrapLongLine(line, output): line = line.rstrip() if len(line) <= 80: output.append(line) elif IsComment(line): if IsHeaderGuardOrInclude(line): # The style guide made an exception to allow long header guard lines # and includes. output.append(line) else: WrapComment(line, output) elif IsInPreprocessorDirevative(output, line): if IsHeaderGuardOrInclude(line): # The style guide made an exception to allow long header guard lines # and includes. output.append(line) else: WrapPreprocessorDirevative(line, output) else: WrapPlainCode(line, output) def BeautifyCode(string): lines = string.splitlines() output = [] for line in lines: WrapLongLine(line, output) output2 = [line.rstrip() for line in output] return '\n'.join(output2) + '\n' def ConvertFromPumpSource(src_text): """Return the text generated from the given Pump source text.""" ast = ParseToAST(StripMetaComments(src_text)) output = Output() RunCode(Env(), ast, output) return BeautifyCode(output.string) def main(argv): if len(argv) == 1: print __doc__ sys.exit(1) file_path = argv[-1] output_str = ConvertFromPumpSource(file(file_path, 'r').read()) if file_path.endswith('.pump'): output_file_path = file_path[:-5] else: output_file_path = '-' if output_file_path == '-': print output_str, else: output_file = file(output_file_path, 'w') output_file.write('// This file was GENERATED by command:\n') output_file.write('// %s %s\n' % (os.path.basename(__file__), os.path.basename(file_path))) output_file.write('// DO NOT EDIT BY HAND!!!\n\n') output_file.write(output_str) output_file.close() if __name__ == '__main__': main(sys.argv) synergy-1.4.12-Source/tools/gtest-1.6.0/scripts/test/0000700000175000017500000000000012140644175022105 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/scripts/test/Makefile0000600000175000017500000000341211561126632023546 0ustar synergysynergy# A Makefile for fusing Google Test and building a sample test against it. # # SYNOPSIS: # # make [all] - makes everything. # make TARGET - makes the given target. # make check - makes everything and runs the built sample test. # make clean - removes all files generated by make. # Points to the root of fused Google Test, relative to where this file is. FUSED_GTEST_DIR = output # Paths to the fused gtest files. FUSED_GTEST_H = $(FUSED_GTEST_DIR)/gtest/gtest.h FUSED_GTEST_ALL_CC = $(FUSED_GTEST_DIR)/gtest/gtest-all.cc # Where to find the sample test. SAMPLE_DIR = ../../samples # Where to find gtest_main.cc. GTEST_MAIN_CC = ../../src/gtest_main.cc # Flags passed to the preprocessor. # We have no idea here whether pthreads is available in the system, so # disable its use. CPPFLAGS += -I$(FUSED_GTEST_DIR) -DGTEST_HAS_PTHREAD=0 # Flags passed to the C++ compiler. CXXFLAGS += -g all : sample1_unittest check : all ./sample1_unittest clean : rm -rf $(FUSED_GTEST_DIR) sample1_unittest *.o $(FUSED_GTEST_H) : ../fuse_gtest_files.py $(FUSED_GTEST_DIR) $(FUSED_GTEST_ALL_CC) : ../fuse_gtest_files.py $(FUSED_GTEST_DIR) gtest-all.o : $(FUSED_GTEST_H) $(FUSED_GTEST_ALL_CC) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(FUSED_GTEST_DIR)/gtest/gtest-all.cc gtest_main.o : $(FUSED_GTEST_H) $(GTEST_MAIN_CC) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(GTEST_MAIN_CC) sample1.o : $(SAMPLE_DIR)/sample1.cc $(SAMPLE_DIR)/sample1.h $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(SAMPLE_DIR)/sample1.cc sample1_unittest.o : $(SAMPLE_DIR)/sample1_unittest.cc \ $(SAMPLE_DIR)/sample1.h $(FUSED_GTEST_H) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(SAMPLE_DIR)/sample1_unittest.cc sample1_unittest : sample1.o sample1_unittest.o gtest-all.o gtest_main.o $(CXX) $(CPPFLAGS) $(CXXFLAGS) $^ -o $@ synergy-1.4.12-Source/tools/gtest-1.6.0/src/0000700000175000017500000000000012140644175020226 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-all.cc0000600000175000017500000000416111561126632022434 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // Google C++ Testing Framework (Google Test) // // Sometimes it's desirable to build Google Test by compiling a single file. // This file serves this purpose. // This line ensures that gtest.h can be compiled on its own, even // when it's fused. #include "gtest/gtest.h" // The following lines pull in the real gtest *.cc files. #include "src/gtest.cc" #include "src/gtest-death-test.cc" #include "src/gtest-filepath.cc" #include "src/gtest-port.cc" #include "src/gtest-printers.cc" #include "src/gtest-test-part.cc" #include "src/gtest-typed-test.cc" synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-death-test.cc0000600000175000017500000013251511561126632023733 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // // This file implements death tests. #include "gtest/gtest-death-test.h" #include "gtest/internal/gtest-port.h" #if GTEST_HAS_DEATH_TEST # if GTEST_OS_MAC # include # endif // GTEST_OS_MAC # include # include # include # include # if GTEST_OS_WINDOWS # include # else # include # include # endif // GTEST_OS_WINDOWS #endif // GTEST_HAS_DEATH_TEST #include "gtest/gtest-message.h" #include "gtest/internal/gtest-string.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { // Constants. // The default death test style. static const char kDefaultDeathTestStyle[] = "fast"; GTEST_DEFINE_string_( death_test_style, internal::StringFromGTestEnv("death_test_style", kDefaultDeathTestStyle), "Indicates how to run a death test in a forked child process: " "\"threadsafe\" (child process re-executes the test binary " "from the beginning, running only the specific death test) or " "\"fast\" (child process runs the death test immediately " "after forking)."); GTEST_DEFINE_bool_( death_test_use_fork, internal::BoolFromGTestEnv("death_test_use_fork", false), "Instructs to use fork()/_exit() instead of clone() in death tests. " "Ignored and always uses fork() on POSIX systems where clone() is not " "implemented. Useful when running under valgrind or similar tools if " "those do not support clone(). Valgrind 3.3.1 will just fail if " "it sees an unsupported combination of clone() flags. " "It is not recommended to use this flag w/o valgrind though it will " "work in 99% of the cases. Once valgrind is fixed, this flag will " "most likely be removed."); namespace internal { GTEST_DEFINE_string_( internal_run_death_test, "", "Indicates the file, line number, temporal index of " "the single death test to run, and a file descriptor to " "which a success code may be sent, all separated by " "colons. This flag is specified if and only if the current " "process is a sub-process launched for running a thread-safe " "death test. FOR INTERNAL USE ONLY."); } // namespace internal #if GTEST_HAS_DEATH_TEST // ExitedWithCode constructor. ExitedWithCode::ExitedWithCode(int exit_code) : exit_code_(exit_code) { } // ExitedWithCode function-call operator. bool ExitedWithCode::operator()(int exit_status) const { # if GTEST_OS_WINDOWS return exit_status == exit_code_; # else return WIFEXITED(exit_status) && WEXITSTATUS(exit_status) == exit_code_; # endif // GTEST_OS_WINDOWS } # if !GTEST_OS_WINDOWS // KilledBySignal constructor. KilledBySignal::KilledBySignal(int signum) : signum_(signum) { } // KilledBySignal function-call operator. bool KilledBySignal::operator()(int exit_status) const { return WIFSIGNALED(exit_status) && WTERMSIG(exit_status) == signum_; } # endif // !GTEST_OS_WINDOWS namespace internal { // Utilities needed for death tests. // Generates a textual description of a given exit code, in the format // specified by wait(2). static String ExitSummary(int exit_code) { Message m; # if GTEST_OS_WINDOWS m << "Exited with exit status " << exit_code; # else if (WIFEXITED(exit_code)) { m << "Exited with exit status " << WEXITSTATUS(exit_code); } else if (WIFSIGNALED(exit_code)) { m << "Terminated by signal " << WTERMSIG(exit_code); } # ifdef WCOREDUMP if (WCOREDUMP(exit_code)) { m << " (core dumped)"; } # endif # endif // GTEST_OS_WINDOWS return m.GetString(); } // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. bool ExitedUnsuccessfully(int exit_status) { return !ExitedWithCode(0)(exit_status); } # if !GTEST_OS_WINDOWS // Generates a textual failure message when a death test finds more than // one thread running, or cannot determine the number of threads, prior // to executing the given statement. It is the responsibility of the // caller not to pass a thread_count of 1. static String DeathTestThreadWarning(size_t thread_count) { Message msg; msg << "Death tests use fork(), which is unsafe particularly" << " in a threaded context. For this test, " << GTEST_NAME_ << " "; if (thread_count == 0) msg << "couldn't detect the number of threads."; else msg << "detected " << thread_count << " threads."; return msg.GetString(); } # endif // !GTEST_OS_WINDOWS // Flag characters for reporting a death test that did not die. static const char kDeathTestLived = 'L'; static const char kDeathTestReturned = 'R'; static const char kDeathTestThrew = 'T'; static const char kDeathTestInternalError = 'I'; // An enumeration describing all of the possible ways that a death test can // conclude. DIED means that the process died while executing the test // code; LIVED means that process lived beyond the end of the test code; // RETURNED means that the test statement attempted to execute a return // statement, which is not allowed; THREW means that the test statement // returned control by throwing an exception. IN_PROGRESS means the test // has not yet concluded. // TODO(vladl@google.com): Unify names and possibly values for // AbortReason, DeathTestOutcome, and flag characters above. enum DeathTestOutcome { IN_PROGRESS, DIED, LIVED, RETURNED, THREW }; // Routine for aborting the program which is safe to call from an // exec-style death test child process, in which case the error // message is propagated back to the parent process. Otherwise, the // message is simply printed to stderr. In either case, the program // then exits with status 1. void DeathTestAbort(const String& message) { // On a POSIX system, this function may be called from a threadsafe-style // death test child process, which operates on a very small stack. Use // the heap for any additional non-minuscule memory requirements. const InternalRunDeathTestFlag* const flag = GetUnitTestImpl()->internal_run_death_test_flag(); if (flag != NULL) { FILE* parent = posix::FDOpen(flag->write_fd(), "w"); fputc(kDeathTestInternalError, parent); fprintf(parent, "%s", message.c_str()); fflush(parent); _exit(1); } else { fprintf(stderr, "%s", message.c_str()); fflush(stderr); posix::Abort(); } } // A replacement for CHECK that calls DeathTestAbort if the assertion // fails. # define GTEST_DEATH_TEST_CHECK_(expression) \ do { \ if (!::testing::internal::IsTrue(expression)) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // This macro is similar to GTEST_DEATH_TEST_CHECK_, but it is meant for // evaluating any system call that fulfills two conditions: it must return // -1 on failure, and set errno to EINTR when it is interrupted and // should be tried again. The macro expands to a loop that repeatedly // evaluates the expression as long as it evaluates to -1 and sets // errno to EINTR. If the expression evaluates to -1 but errno is // something other than EINTR, DeathTestAbort is called. # define GTEST_DEATH_TEST_CHECK_SYSCALL_(expression) \ do { \ int gtest_retval; \ do { \ gtest_retval = (expression); \ } while (gtest_retval == -1 && errno == EINTR); \ if (gtest_retval == -1) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s != -1", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // Returns the message describing the last system error in errno. String GetLastErrnoDescription() { return String(errno == 0 ? "" : posix::StrError(errno)); } // This is called from a death test parent process to read a failure // message from the death test child process and log it with the FATAL // severity. On Windows, the message is read from a pipe handle. On other // platforms, it is read from a file descriptor. static void FailFromInternalError(int fd) { Message error; char buffer[256]; int num_read; do { while ((num_read = posix::Read(fd, buffer, 255)) > 0) { buffer[num_read] = '\0'; error << buffer; } } while (num_read == -1 && errno == EINTR); if (num_read == 0) { GTEST_LOG_(FATAL) << error.GetString(); } else { const int last_error = errno; GTEST_LOG_(FATAL) << "Error while reading death test internal: " << GetLastErrnoDescription() << " [" << last_error << "]"; } } // Death test constructor. Increments the running death test count // for the current test. DeathTest::DeathTest() { TestInfo* const info = GetUnitTestImpl()->current_test_info(); if (info == NULL) { DeathTestAbort("Cannot run a death test outside of a TEST or " "TEST_F construct"); } } // Creates and returns a death test by dispatching to the current // death test factory. bool DeathTest::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { return GetUnitTestImpl()->death_test_factory()->Create( statement, regex, file, line, test); } const char* DeathTest::LastMessage() { return last_death_test_message_.c_str(); } void DeathTest::set_last_death_test_message(const String& message) { last_death_test_message_ = message; } String DeathTest::last_death_test_message_; // Provides cross platform implementation for some death functionality. class DeathTestImpl : public DeathTest { protected: DeathTestImpl(const char* a_statement, const RE* a_regex) : statement_(a_statement), regex_(a_regex), spawned_(false), status_(-1), outcome_(IN_PROGRESS), read_fd_(-1), write_fd_(-1) {} // read_fd_ is expected to be closed and cleared by a derived class. ~DeathTestImpl() { GTEST_DEATH_TEST_CHECK_(read_fd_ == -1); } void Abort(AbortReason reason); virtual bool Passed(bool status_ok); const char* statement() const { return statement_; } const RE* regex() const { return regex_; } bool spawned() const { return spawned_; } void set_spawned(bool is_spawned) { spawned_ = is_spawned; } int status() const { return status_; } void set_status(int a_status) { status_ = a_status; } DeathTestOutcome outcome() const { return outcome_; } void set_outcome(DeathTestOutcome an_outcome) { outcome_ = an_outcome; } int read_fd() const { return read_fd_; } void set_read_fd(int fd) { read_fd_ = fd; } int write_fd() const { return write_fd_; } void set_write_fd(int fd) { write_fd_ = fd; } // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void ReadAndInterpretStatusByte(); private: // The textual content of the code this object is testing. This class // doesn't own this string and should not attempt to delete it. const char* const statement_; // The regular expression which test output must match. DeathTestImpl // doesn't own this object and should not attempt to delete it. const RE* const regex_; // True if the death test child process has been successfully spawned. bool spawned_; // The exit status of the child process. int status_; // How the death test concluded. DeathTestOutcome outcome_; // Descriptor to the read end of the pipe to the child process. It is // always -1 in the child process. The child keeps its write end of the // pipe in write_fd_. int read_fd_; // Descriptor to the child's write end of the pipe to the parent process. // It is always -1 in the parent process. The parent keeps its end of the // pipe in read_fd_. int write_fd_; }; // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void DeathTestImpl::ReadAndInterpretStatusByte() { char flag; int bytes_read; // The read() here blocks until data is available (signifying the // failure of the death test) or until the pipe is closed (signifying // its success), so it's okay to call this in the parent before // the child process has exited. do { bytes_read = posix::Read(read_fd(), &flag, 1); } while (bytes_read == -1 && errno == EINTR); if (bytes_read == 0) { set_outcome(DIED); } else if (bytes_read == 1) { switch (flag) { case kDeathTestReturned: set_outcome(RETURNED); break; case kDeathTestThrew: set_outcome(THREW); break; case kDeathTestLived: set_outcome(LIVED); break; case kDeathTestInternalError: FailFromInternalError(read_fd()); // Does not return. break; default: GTEST_LOG_(FATAL) << "Death test child process reported " << "unexpected status byte (" << static_cast(flag) << ")"; } } else { GTEST_LOG_(FATAL) << "Read from death test child process failed: " << GetLastErrnoDescription(); } GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Close(read_fd())); set_read_fd(-1); } // Signals that the death test code which should have exited, didn't. // Should be called only in a death test child process. // Writes a status byte to the child's status file descriptor, then // calls _exit(1). void DeathTestImpl::Abort(AbortReason reason) { // The parent process considers the death test to be a failure if // it finds any data in our pipe. So, here we write a single flag byte // to the pipe, then exit. const char status_ch = reason == TEST_DID_NOT_DIE ? kDeathTestLived : reason == TEST_THREW_EXCEPTION ? kDeathTestThrew : kDeathTestReturned; GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Write(write_fd(), &status_ch, 1)); // We are leaking the descriptor here because on some platforms (i.e., // when built as Windows DLL), destructors of global objects will still // run after calling _exit(). On such systems, write_fd_ will be // indirectly closed from the destructor of UnitTestImpl, causing double // close if it is also closed here. On debug configurations, double close // may assert. As there are no in-process buffers to flush here, we are // relying on the OS to close the descriptor after the process terminates // when the destructors are not run. _exit(1); // Exits w/o any normal exit hooks (we were supposed to crash) } // Returns an indented copy of stderr output for a death test. // This makes distinguishing death test output lines from regular log lines // much easier. static ::std::string FormatDeathTestOutput(const ::std::string& output) { ::std::string ret; for (size_t at = 0; ; ) { const size_t line_end = output.find('\n', at); ret += "[ DEATH ] "; if (line_end == ::std::string::npos) { ret += output.substr(at); break; } ret += output.substr(at, line_end + 1 - at); at = line_end + 1; } return ret; } // Assesses the success or failure of a death test, using both private // members which have previously been set, and one argument: // // Private data members: // outcome: An enumeration describing how the death test // concluded: DIED, LIVED, THREW, or RETURNED. The death test // fails in the latter three cases. // status: The exit status of the child process. On *nix, it is in the // in the format specified by wait(2). On Windows, this is the // value supplied to the ExitProcess() API or a numeric code // of the exception that terminated the program. // regex: A regular expression object to be applied to // the test's captured standard error output; the death test // fails if it does not match. // // Argument: // status_ok: true if exit_status is acceptable in the context of // this particular death test, which fails if it is false // // Returns true iff all of the above conditions are met. Otherwise, the // first failing condition, in the order given above, is the one that is // reported. Also sets the last death test message string. bool DeathTestImpl::Passed(bool status_ok) { if (!spawned()) return false; const String error_message = GetCapturedStderr(); bool success = false; Message buffer; buffer << "Death test: " << statement() << "\n"; switch (outcome()) { case LIVED: buffer << " Result: failed to die.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case THREW: buffer << " Result: threw an exception.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case RETURNED: buffer << " Result: illegal return in test statement.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case DIED: if (status_ok) { const bool matched = RE::PartialMatch(error_message.c_str(), *regex()); if (matched) { success = true; } else { buffer << " Result: died but not with expected error.\n" << " Expected: " << regex()->pattern() << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } } else { buffer << " Result: died but not with expected exit code:\n" << " " << ExitSummary(status()) << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } break; case IN_PROGRESS: default: GTEST_LOG_(FATAL) << "DeathTest::Passed somehow called before conclusion of test"; } DeathTest::set_last_death_test_message(buffer.GetString()); return success; } # if GTEST_OS_WINDOWS // WindowsDeathTest implements death tests on Windows. Due to the // specifics of starting new processes on Windows, death tests there are // always threadsafe, and Google Test considers the // --gtest_death_test_style=fast setting to be equivalent to // --gtest_death_test_style=threadsafe there. // // A few implementation notes: Like the Linux version, the Windows // implementation uses pipes for child-to-parent communication. But due to // the specifics of pipes on Windows, some extra steps are required: // // 1. The parent creates a communication pipe and stores handles to both // ends of it. // 2. The parent starts the child and provides it with the information // necessary to acquire the handle to the write end of the pipe. // 3. The child acquires the write end of the pipe and signals the parent // using a Windows event. // 4. Now the parent can release the write end of the pipe on its side. If // this is done before step 3, the object's reference count goes down to // 0 and it is destroyed, preventing the child from acquiring it. The // parent now has to release it, or read operations on the read end of // the pipe will not return when the child terminates. // 5. The parent reads child's output through the pipe (outcome code and // any possible error messages) from the pipe, and its stderr and then // determines whether to fail the test. // // Note: to distinguish Win32 API calls from the local method and function // calls, the former are explicitly resolved in the global namespace. // class WindowsDeathTest : public DeathTestImpl { public: WindowsDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : DeathTestImpl(a_statement, a_regex), file_(file), line_(line) {} // All of these virtual functions are inherited from DeathTest. virtual int Wait(); virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; // Handle to the write end of the pipe to the child process. AutoHandle write_handle_; // Child process handle. AutoHandle child_handle_; // Event the child process uses to signal the parent that it has // acquired the handle to the write end of the pipe. After seeing this // event the parent can release its own handles to make sure its // ReadFile() calls return when the child terminates. AutoHandle event_handle_; }; // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int WindowsDeathTest::Wait() { if (!spawned()) return 0; // Wait until the child either signals that it has acquired the write end // of the pipe or it dies. const HANDLE wait_handles[2] = { child_handle_.Get(), event_handle_.Get() }; switch (::WaitForMultipleObjects(2, wait_handles, FALSE, // Waits for any of the handles. INFINITE)) { case WAIT_OBJECT_0: case WAIT_OBJECT_0 + 1: break; default: GTEST_DEATH_TEST_CHECK_(false); // Should not get here. } // The child has acquired the write end of the pipe or exited. // We release the handle on our side and continue. write_handle_.Reset(); event_handle_.Reset(); ReadAndInterpretStatusByte(); // Waits for the child process to exit if it haven't already. This // returns immediately if the child has already exited, regardless of // whether previous calls to WaitForMultipleObjects synchronized on this // handle or not. GTEST_DEATH_TEST_CHECK_( WAIT_OBJECT_0 == ::WaitForSingleObject(child_handle_.Get(), INFINITE)); DWORD status_code; GTEST_DEATH_TEST_CHECK_( ::GetExitCodeProcess(child_handle_.Get(), &status_code) != FALSE); child_handle_.Reset(); set_status(static_cast(status_code)); return status(); } // The AssumeRole process for a Windows death test. It creates a child // process with the same executable as the current process to run the // death test. The child process is given the --gtest_filter and // --gtest_internal_run_death_test flags such that it knows to run the // current death test only. DeathTest::TestRole WindowsDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { // ParseInternalRunDeathTestFlag() has performed all the necessary // processing. set_write_fd(flag->write_fd()); return EXECUTE_TEST; } // WindowsDeathTest uses an anonymous pipe to communicate results of // a death test. SECURITY_ATTRIBUTES handles_are_inheritable = { sizeof(SECURITY_ATTRIBUTES), NULL, TRUE }; HANDLE read_handle, write_handle; GTEST_DEATH_TEST_CHECK_( ::CreatePipe(&read_handle, &write_handle, &handles_are_inheritable, 0) // Default buffer size. != FALSE); set_read_fd(::_open_osfhandle(reinterpret_cast(read_handle), O_RDONLY)); write_handle_.Reset(write_handle); event_handle_.Reset(::CreateEvent( &handles_are_inheritable, TRUE, // The event will automatically reset to non-signaled state. FALSE, // The initial state is non-signalled. NULL)); // The even is unnamed. GTEST_DEATH_TEST_CHECK_(event_handle_.Get() != NULL); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format( "--%s%s=%s|%d|%d|%u|%Iu|%Iu", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, static_cast(::GetCurrentProcessId()), // size_t has the same with as pointers on both 32-bit and 64-bit // Windows platforms. // See http://msdn.microsoft.com/en-us/library/tcxf1dw6.aspx. reinterpret_cast(write_handle), reinterpret_cast(event_handle_.Get())); char executable_path[_MAX_PATH + 1]; // NOLINT GTEST_DEATH_TEST_CHECK_( _MAX_PATH + 1 != ::GetModuleFileNameA(NULL, executable_path, _MAX_PATH)); String command_line = String::Format("%s %s \"%s\"", ::GetCommandLineA(), filter_flag.c_str(), internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // Flush the log buffers since the log streams are shared with the child. FlushInfoLog(); // The child process will share the standard handles with the parent. STARTUPINFOA startup_info; memset(&startup_info, 0, sizeof(STARTUPINFO)); startup_info.dwFlags = STARTF_USESTDHANDLES; startup_info.hStdInput = ::GetStdHandle(STD_INPUT_HANDLE); startup_info.hStdOutput = ::GetStdHandle(STD_OUTPUT_HANDLE); startup_info.hStdError = ::GetStdHandle(STD_ERROR_HANDLE); PROCESS_INFORMATION process_info; GTEST_DEATH_TEST_CHECK_(::CreateProcessA( executable_path, const_cast(command_line.c_str()), NULL, // Retuned process handle is not inheritable. NULL, // Retuned thread handle is not inheritable. TRUE, // Child inherits all inheritable handles (for write_handle_). 0x0, // Default creation flags. NULL, // Inherit the parent's environment. UnitTest::GetInstance()->original_working_dir(), &startup_info, &process_info) != FALSE); child_handle_.Reset(process_info.hProcess); ::CloseHandle(process_info.hThread); set_spawned(true); return OVERSEE_TEST; } # else // We are not on Windows. // ForkingDeathTest provides implementations for most of the abstract // methods of the DeathTest interface. Only the AssumeRole method is // left undefined. class ForkingDeathTest : public DeathTestImpl { public: ForkingDeathTest(const char* statement, const RE* regex); // All of these virtual functions are inherited from DeathTest. virtual int Wait(); protected: void set_child_pid(pid_t child_pid) { child_pid_ = child_pid; } private: // PID of child process during death test; 0 in the child process itself. pid_t child_pid_; }; // Constructs a ForkingDeathTest. ForkingDeathTest::ForkingDeathTest(const char* a_statement, const RE* a_regex) : DeathTestImpl(a_statement, a_regex), child_pid_(-1) {} // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int ForkingDeathTest::Wait() { if (!spawned()) return 0; ReadAndInterpretStatusByte(); int status_value; GTEST_DEATH_TEST_CHECK_SYSCALL_(waitpid(child_pid_, &status_value, 0)); set_status(status_value); return status_value; } // A concrete death test class that forks, then immediately runs the test // in the child process. class NoExecDeathTest : public ForkingDeathTest { public: NoExecDeathTest(const char* a_statement, const RE* a_regex) : ForkingDeathTest(a_statement, a_regex) { } virtual TestRole AssumeRole(); }; // The AssumeRole process for a fork-and-run death test. It implements a // straightforward fork, with a simple pipe to transmit the status byte. DeathTest::TestRole NoExecDeathTest::AssumeRole() { const size_t thread_count = GetThreadCount(); if (thread_count != 1) { GTEST_LOG_(WARNING) << DeathTestThreadWarning(thread_count); } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); DeathTest::set_last_death_test_message(""); CaptureStderr(); // When we fork the process below, the log file buffers are copied, but the // file descriptors are shared. We flush all log files here so that closing // the file descriptors in the child process doesn't throw off the // synchronization between descriptors and buffers in the parent process. // This is as close to the fork as possible to avoid a race condition in case // there are multiple threads running before the death test, and another // thread writes to the log file. FlushInfoLog(); const pid_t child_pid = fork(); GTEST_DEATH_TEST_CHECK_(child_pid != -1); set_child_pid(child_pid); if (child_pid == 0) { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[0])); set_write_fd(pipe_fd[1]); // Redirects all logging to stderr in the child process to prevent // concurrent writes to the log files. We capture stderr in the parent // process and append the child process' output to a log. LogToStderr(); // Event forwarding to the listeners of event listener API mush be shut // down in death test subprocesses. GetUnitTestImpl()->listeners()->SuppressEventForwarding(); return EXECUTE_TEST; } else { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } } // A concrete death test class that forks and re-executes the main // program from the beginning, with command-line flags set that cause // only this specific death test to be run. class ExecDeathTest : public ForkingDeathTest { public: ExecDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : ForkingDeathTest(a_statement, a_regex), file_(file), line_(line) { } virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; }; // Utility class for accumulating command-line arguments. class Arguments { public: Arguments() { args_.push_back(NULL); } ~Arguments() { for (std::vector::iterator i = args_.begin(); i != args_.end(); ++i) { free(*i); } } void AddArgument(const char* argument) { args_.insert(args_.end() - 1, posix::StrDup(argument)); } template void AddArguments(const ::std::vector& arguments) { for (typename ::std::vector::const_iterator i = arguments.begin(); i != arguments.end(); ++i) { args_.insert(args_.end() - 1, posix::StrDup(i->c_str())); } } char* const* Argv() { return &args_[0]; } private: std::vector args_; }; // A struct that encompasses the arguments to the child process of a // threadsafe-style death test process. struct ExecDeathTestArgs { char* const* argv; // Command-line arguments for the child's call to exec int close_fd; // File descriptor to close; the read end of a pipe }; # if GTEST_OS_MAC inline char** GetEnviron() { // When Google Test is built as a framework on MacOS X, the environ variable // is unavailable. Apple's documentation (man environ) recommends using // _NSGetEnviron() instead. return *_NSGetEnviron(); } # else // Some POSIX platforms expect you to declare environ. extern "C" makes // it reside in the global namespace. extern "C" char** environ; inline char** GetEnviron() { return environ; } # endif // GTEST_OS_MAC // The main function for a threadsafe-style death test child process. // This function is called in a clone()-ed process and thus must avoid // any potentially unsafe operations like malloc or libc functions. static int ExecDeathTestChildMain(void* child_arg) { ExecDeathTestArgs* const args = static_cast(child_arg); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(args->close_fd)); // We need to execute the test program in the same environment where // it was originally invoked. Therefore we change to the original // working directory first. const char* const original_dir = UnitTest::GetInstance()->original_working_dir(); // We can safely call chdir() as it's a direct system call. if (chdir(original_dir) != 0) { DeathTestAbort(String::Format("chdir(\"%s\") failed: %s", original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // We can safely call execve() as it's a direct system call. We // cannot use execvp() as it's a libc function and thus potentially // unsafe. Since execve() doesn't search the PATH, the user must // invoke the test program via a valid path that contains at least // one path separator. execve(args->argv[0], args->argv, GetEnviron()); DeathTestAbort(String::Format("execve(%s, ...) in %s failed: %s", args->argv[0], original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // Two utility routines that together determine the direction the stack // grows. // This could be accomplished more elegantly by a single recursive // function, but we want to guard against the unlikely possibility of // a smart compiler optimizing the recursion away. // // GTEST_NO_INLINE_ is required to prevent GCC 4.6 from inlining // StackLowerThanAddress into StackGrowsDown, which then doesn't give // correct answer. bool StackLowerThanAddress(const void* ptr) GTEST_NO_INLINE_; bool StackLowerThanAddress(const void* ptr) { int dummy; return &dummy < ptr; } bool StackGrowsDown() { int dummy; return StackLowerThanAddress(&dummy); } // A threadsafe implementation of fork(2) for threadsafe-style death tests // that uses clone(2). It dies with an error message if anything goes // wrong. static pid_t ExecDeathTestFork(char* const* argv, int close_fd) { ExecDeathTestArgs args = { argv, close_fd }; pid_t child_pid = -1; # if GTEST_HAS_CLONE const bool use_fork = GTEST_FLAG(death_test_use_fork); if (!use_fork) { static const bool stack_grows_down = StackGrowsDown(); const size_t stack_size = getpagesize(); // MMAP_ANONYMOUS is not defined on Mac, so we use MAP_ANON instead. void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0); GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); void* const stack_top = static_cast(stack) + (stack_grows_down ? stack_size : 0); child_pid = clone(&ExecDeathTestChildMain, stack_top, SIGCHLD, &args); GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1); } # else const bool use_fork = true; # endif // GTEST_HAS_CLONE if (use_fork && (child_pid = fork()) == 0) { ExecDeathTestChildMain(&args); _exit(0); } GTEST_DEATH_TEST_CHECK_(child_pid != -1); return child_pid; } // The AssumeRole process for a fork-and-exec death test. It re-executes the // main program from the beginning, setting the --gtest_filter // and --gtest_internal_run_death_test flags to cause only the current // death test to be re-run. DeathTest::TestRole ExecDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { set_write_fd(flag->write_fd()); return EXECUTE_TEST; } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); // Clear the close-on-exec flag on the write end of the pipe, lest // it be closed when the child process does an exec: GTEST_DEATH_TEST_CHECK_(fcntl(pipe_fd[1], F_SETFD, 0) != -1); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format("--%s%s=%s|%d|%d|%d", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, pipe_fd[1]); Arguments args; args.AddArguments(GetArgvs()); args.AddArgument(filter_flag.c_str()); args.AddArgument(internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // See the comment in NoExecDeathTest::AssumeRole for why the next line // is necessary. FlushInfoLog(); const pid_t child_pid = ExecDeathTestFork(args.Argv(), pipe_fd[0]); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_child_pid(child_pid); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } # endif // !GTEST_OS_WINDOWS // Creates a concrete DeathTest-derived class that depends on the // --gtest_death_test_style flag, and sets the pointer pointed to // by the "test" argument to its address. If the test should be // skipped, sets that pointer to NULL. Returns true, unless the // flag is set to an invalid value. bool DefaultDeathTestFactory::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const int death_test_index = impl->current_test_info() ->increment_death_test_count(); if (flag != NULL) { if (death_test_index > flag->index()) { DeathTest::set_last_death_test_message(String::Format( "Death test count (%d) somehow exceeded expected maximum (%d)", death_test_index, flag->index())); return false; } if (!(flag->file() == file && flag->line() == line && flag->index() == death_test_index)) { *test = NULL; return true; } } # if GTEST_OS_WINDOWS if (GTEST_FLAG(death_test_style) == "threadsafe" || GTEST_FLAG(death_test_style) == "fast") { *test = new WindowsDeathTest(statement, regex, file, line); } # else if (GTEST_FLAG(death_test_style) == "threadsafe") { *test = new ExecDeathTest(statement, regex, file, line); } else if (GTEST_FLAG(death_test_style) == "fast") { *test = new NoExecDeathTest(statement, regex); } # endif // GTEST_OS_WINDOWS else { // NOLINT - this is more readable than unbalanced brackets inside #if. DeathTest::set_last_death_test_message(String::Format( "Unknown death test style \"%s\" encountered", GTEST_FLAG(death_test_style).c_str())); return false; } return true; } // Splits a given string on a given delimiter, populating a given // vector with the fields. GTEST_HAS_DEATH_TEST implies that we have // ::std::string, so we can use it here. static void SplitString(const ::std::string& str, char delimiter, ::std::vector< ::std::string>* dest) { ::std::vector< ::std::string> parsed; ::std::string::size_type pos = 0; while (::testing::internal::AlwaysTrue()) { const ::std::string::size_type colon = str.find(delimiter, pos); if (colon == ::std::string::npos) { parsed.push_back(str.substr(pos)); break; } else { parsed.push_back(str.substr(pos, colon - pos)); pos = colon + 1; } } dest->swap(parsed); } # if GTEST_OS_WINDOWS // Recreates the pipe and event handles from the provided parameters, // signals the event, and returns a file descriptor wrapped around the pipe // handle. This function is called in the child process only. int GetStatusFileDescriptor(unsigned int parent_process_id, size_t write_handle_as_size_t, size_t event_handle_as_size_t) { AutoHandle parent_process_handle(::OpenProcess(PROCESS_DUP_HANDLE, FALSE, // Non-inheritable. parent_process_id)); if (parent_process_handle.Get() == INVALID_HANDLE_VALUE) { DeathTestAbort(String::Format("Unable to open parent process %u", parent_process_id)); } // TODO(vladl@google.com): Replace the following check with a // compile-time assertion when available. GTEST_CHECK_(sizeof(HANDLE) <= sizeof(size_t)); const HANDLE write_handle = reinterpret_cast(write_handle_as_size_t); HANDLE dup_write_handle; // The newly initialized handle is accessible only in in the parent // process. To obtain one accessible within the child, we need to use // DuplicateHandle. if (!::DuplicateHandle(parent_process_handle.Get(), write_handle, ::GetCurrentProcess(), &dup_write_handle, 0x0, // Requested privileges ignored since // DUPLICATE_SAME_ACCESS is used. FALSE, // Request non-inheritable handler. DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the pipe handle %Iu from the parent process %u", write_handle_as_size_t, parent_process_id)); } const HANDLE event_handle = reinterpret_cast(event_handle_as_size_t); HANDLE dup_event_handle; if (!::DuplicateHandle(parent_process_handle.Get(), event_handle, ::GetCurrentProcess(), &dup_event_handle, 0x0, FALSE, DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the event handle %Iu from the parent process %u", event_handle_as_size_t, parent_process_id)); } const int write_fd = ::_open_osfhandle(reinterpret_cast(dup_write_handle), O_APPEND); if (write_fd == -1) { DeathTestAbort(String::Format( "Unable to convert pipe handle %Iu to a file descriptor", write_handle_as_size_t)); } // Signals the parent that the write end of the pipe has been acquired // so the parent can release its own write end. ::SetEvent(dup_event_handle); return write_fd; } # endif // GTEST_OS_WINDOWS // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag() { if (GTEST_FLAG(internal_run_death_test) == "") return NULL; // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we // can use it here. int line = -1; int index = -1; ::std::vector< ::std::string> fields; SplitString(GTEST_FLAG(internal_run_death_test).c_str(), '|', &fields); int write_fd = -1; # if GTEST_OS_WINDOWS unsigned int parent_process_id = 0; size_t write_handle_as_size_t = 0; size_t event_handle_as_size_t = 0; if (fields.size() != 6 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &parent_process_id) || !ParseNaturalNumber(fields[4], &write_handle_as_size_t) || !ParseNaturalNumber(fields[5], &event_handle_as_size_t)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } write_fd = GetStatusFileDescriptor(parent_process_id, write_handle_as_size_t, event_handle_as_size_t); # else if (fields.size() != 4 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &write_fd)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } # endif // GTEST_OS_WINDOWS return new InternalRunDeathTestFlag(fields[0], line, index, write_fd); } } // namespace internal #endif // GTEST_HAS_DEATH_TEST } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-filepath.cc0000600000175000017500000003365711561126632023474 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: keith.ray@gmail.com (Keith Ray) #include "gtest/internal/gtest-filepath.h" #include "gtest/internal/gtest-port.h" #include #if GTEST_OS_WINDOWS_MOBILE # include #elif GTEST_OS_WINDOWS # include # include #elif GTEST_OS_SYMBIAN || GTEST_OS_NACL // Symbian OpenC and NaCl have PATH_MAX in sys/syslimits.h # include #else # include # include // Some Linux distributions define PATH_MAX here. #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_WINDOWS # define GTEST_PATH_MAX_ _MAX_PATH #elif defined(PATH_MAX) # define GTEST_PATH_MAX_ PATH_MAX #elif defined(_XOPEN_PATH_MAX) # define GTEST_PATH_MAX_ _XOPEN_PATH_MAX #else # define GTEST_PATH_MAX_ _POSIX_PATH_MAX #endif // GTEST_OS_WINDOWS #include "gtest/internal/gtest-string.h" namespace testing { namespace internal { #if GTEST_OS_WINDOWS // On Windows, '\\' is the standard path separator, but many tools and the // Windows API also accept '/' as an alternate path separator. Unless otherwise // noted, a file path can contain either kind of path separators, or a mixture // of them. const char kPathSeparator = '\\'; const char kAlternatePathSeparator = '/'; const char kPathSeparatorString[] = "\\"; const char kAlternatePathSeparatorString[] = "/"; # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory. You should not use // the current directory in tests on Windows CE, but this at least // provides a reasonable fallback. const char kCurrentDirectoryString[] = "\\"; // Windows CE doesn't define INVALID_FILE_ATTRIBUTES const DWORD kInvalidFileAttributes = 0xffffffff; # else const char kCurrentDirectoryString[] = ".\\"; # endif // GTEST_OS_WINDOWS_MOBILE #else const char kPathSeparator = '/'; const char kPathSeparatorString[] = "/"; const char kCurrentDirectoryString[] = "./"; #endif // GTEST_OS_WINDOWS // Returns whether the given character is a valid path separator. static bool IsPathSeparator(char c) { #if GTEST_HAS_ALT_PATH_SEP_ return (c == kPathSeparator) || (c == kAlternatePathSeparator); #else return c == kPathSeparator; #endif } // Returns the current working directory, or "" if unsuccessful. FilePath FilePath::GetCurrentDir() { #if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory, so we just return // something reasonable. return FilePath(kCurrentDirectoryString); #elif GTEST_OS_WINDOWS char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(_getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #else char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #endif // GTEST_OS_WINDOWS_MOBILE } // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath FilePath::RemoveExtension(const char* extension) const { String dot_extension(String::Format(".%s", extension)); if (pathname_.EndsWithCaseInsensitive(dot_extension.c_str())) { return FilePath(String(pathname_.c_str(), pathname_.length() - 4)); } return *this; } // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FilePath::FindLastPathSeparator() const { const char* const last_sep = strrchr(c_str(), kPathSeparator); #if GTEST_HAS_ALT_PATH_SEP_ const char* const last_alt_sep = strrchr(c_str(), kAlternatePathSeparator); // Comparing two pointers of which only one is NULL is undefined. if (last_alt_sep != NULL && (last_sep == NULL || last_alt_sep > last_sep)) { return last_alt_sep; } #endif return last_sep; } // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveDirectoryName() const { const char* const last_sep = FindLastPathSeparator(); return last_sep ? FilePath(String(last_sep + 1)) : *this; } // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveFileName() const { const char* const last_sep = FindLastPathSeparator(); String dir; if (last_sep) { dir = String(c_str(), last_sep + 1 - c_str()); } else { dir = kCurrentDirectoryString; } return FilePath(dir); } // Helper functions for naming files in a directory for xml output. // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. FilePath FilePath::MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension) { String file; if (number == 0) { file = String::Format("%s.%s", base_name.c_str(), extension); } else { file = String::Format("%s_%d.%s", base_name.c_str(), number, extension); } return ConcatPaths(directory, FilePath(file)); } // Given directory = "dir", relative_path = "test.xml", returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. FilePath FilePath::ConcatPaths(const FilePath& directory, const FilePath& relative_path) { if (directory.IsEmpty()) return relative_path; const FilePath dir(directory.RemoveTrailingPathSeparator()); return FilePath(String::Format("%s%c%s", dir.c_str(), kPathSeparator, relative_path.c_str())); } // Returns true if pathname describes something findable in the file-system, // either a file, directory, or whatever. bool FilePath::FileOrDirectoryExists() const { #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(pathname_.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; return attributes != kInvalidFileAttributes; #else posix::StatStruct file_stat; return posix::Stat(pathname_.c_str(), &file_stat) == 0; #endif // GTEST_OS_WINDOWS_MOBILE } // Returns true if pathname describes a directory in the file-system // that exists. bool FilePath::DirectoryExists() const { bool result = false; #if GTEST_OS_WINDOWS // Don't strip off trailing separator if path is a root directory on // Windows (like "C:\\"). const FilePath& path(IsRootDirectory() ? *this : RemoveTrailingPathSeparator()); #else const FilePath& path(*this); #endif #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(path.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; if ((attributes != kInvalidFileAttributes) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) { result = true; } #else posix::StatStruct file_stat; result = posix::Stat(path.c_str(), &file_stat) == 0 && posix::IsDir(file_stat); #endif // GTEST_OS_WINDOWS_MOBILE return result; } // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool FilePath::IsRootDirectory() const { #if GTEST_OS_WINDOWS // TODO(wan@google.com): on Windows a network share like // \\server\share can be a root directory, although it cannot be the // current directory. Handle this properly. return pathname_.length() == 3 && IsAbsolutePath(); #else return pathname_.length() == 1 && IsPathSeparator(pathname_.c_str()[0]); #endif } // Returns true if pathname describes an absolute path. bool FilePath::IsAbsolutePath() const { const char* const name = pathname_.c_str(); #if GTEST_OS_WINDOWS return pathname_.length() >= 3 && ((name[0] >= 'a' && name[0] <= 'z') || (name[0] >= 'A' && name[0] <= 'Z')) && name[1] == ':' && IsPathSeparator(name[2]); #else return IsPathSeparator(name[0]); #endif } // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. FilePath FilePath::GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension) { FilePath full_pathname; int number = 0; do { full_pathname.Set(MakeFileName(directory, base_name, number++, extension)); } while (full_pathname.FileOrDirectoryExists()); return full_pathname; } // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool FilePath::IsDirectory() const { return !pathname_.empty() && IsPathSeparator(pathname_.c_str()[pathname_.length() - 1]); } // Create directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create directories // for any reason. bool FilePath::CreateDirectoriesRecursively() const { if (!this->IsDirectory()) { return false; } if (pathname_.length() == 0 || this->DirectoryExists()) { return true; } const FilePath parent(this->RemoveTrailingPathSeparator().RemoveFileName()); return parent.CreateDirectoriesRecursively() && this->CreateFolder(); } // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool FilePath::CreateFolder() const { #if GTEST_OS_WINDOWS_MOBILE FilePath removed_sep(this->RemoveTrailingPathSeparator()); LPCWSTR unicode = String::AnsiToUtf16(removed_sep.c_str()); int result = CreateDirectory(unicode, NULL) ? 0 : -1; delete [] unicode; #elif GTEST_OS_WINDOWS int result = _mkdir(pathname_.c_str()); #else int result = mkdir(pathname_.c_str(), 0777); #endif // GTEST_OS_WINDOWS_MOBILE if (result == -1) { return this->DirectoryExists(); // An error is OK if the directory exists. } return true; // No error. } // If input name has a trailing separator character, remove it and return the // name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath FilePath::RemoveTrailingPathSeparator() const { return IsDirectory() ? FilePath(String(pathname_.c_str(), pathname_.length() - 1)) : *this; } // Removes any redundant separators that might be in the pathname. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // TODO(wan@google.com): handle Windows network shares (e.g. \\server\share). void FilePath::Normalize() { if (pathname_.c_str() == NULL) { pathname_ = ""; return; } const char* src = pathname_.c_str(); char* const dest = new char[pathname_.length() + 1]; char* dest_ptr = dest; memset(dest_ptr, 0, pathname_.length() + 1); while (*src != '\0') { *dest_ptr = *src; if (!IsPathSeparator(*src)) { src++; } else { #if GTEST_HAS_ALT_PATH_SEP_ if (*dest_ptr == kAlternatePathSeparator) { *dest_ptr = kPathSeparator; } #endif while (IsPathSeparator(*src)) src++; } dest_ptr++; } *dest_ptr = '\0'; pathname_ = dest; delete[] dest; } } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-internal-inl.h0000600000175000017500000011654011561126632024127 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Utility functions and classes used by the Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // // This file contains purely Google Test's internal implementation. Please // DO NOT #INCLUDE IT IN A USER PROGRAM. #ifndef GTEST_SRC_GTEST_INTERNAL_INL_H_ #define GTEST_SRC_GTEST_INTERNAL_INL_H_ // GTEST_IMPLEMENTATION_ is defined to 1 iff the current translation unit is // part of Google Test's implementation; otherwise it's undefined. #if !GTEST_IMPLEMENTATION_ // A user is trying to include this from his code - just say no. # error "gtest-internal-inl.h is part of Google Test's internal implementation." # error "It must not be included except by Google Test itself." #endif // GTEST_IMPLEMENTATION_ #ifndef _WIN32_WCE # include #endif // !_WIN32_WCE #include #include // For strtoll/_strtoul64/malloc/free. #include // For memmove. #include #include #include #include "gtest/internal/gtest-port.h" #if GTEST_OS_WINDOWS # include // NOLINT #endif // GTEST_OS_WINDOWS #include "gtest/gtest.h" // NOLINT #include "gtest/gtest-spi.h" namespace testing { // Declares the flags. // // We don't want the users to modify this flag in the code, but want // Google Test's own unit tests to be able to access it. Therefore we // declare it here as opposed to in gtest.h. GTEST_DECLARE_bool_(death_test_use_fork); namespace internal { // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). GTEST_API_ extern const TypeId kTestTypeIdInGoogleTest; // Names of the flags (needed for parsing Google Test flags). const char kAlsoRunDisabledTestsFlag[] = "also_run_disabled_tests"; const char kBreakOnFailureFlag[] = "break_on_failure"; const char kCatchExceptionsFlag[] = "catch_exceptions"; const char kColorFlag[] = "color"; const char kFilterFlag[] = "filter"; const char kListTestsFlag[] = "list_tests"; const char kOutputFlag[] = "output"; const char kPrintTimeFlag[] = "print_time"; const char kRandomSeedFlag[] = "random_seed"; const char kRepeatFlag[] = "repeat"; const char kShuffleFlag[] = "shuffle"; const char kStackTraceDepthFlag[] = "stack_trace_depth"; const char kStreamResultToFlag[] = "stream_result_to"; const char kThrowOnFailureFlag[] = "throw_on_failure"; // A valid random seed must be in [1, kMaxRandomSeed]. const int kMaxRandomSeed = 99999; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. GTEST_API_ extern bool g_help_flag; // Returns the current time in milliseconds. GTEST_API_ TimeInMillis GetTimeInMillis(); // Returns true iff Google Test should use colors in the output. GTEST_API_ bool ShouldUseColor(bool stdout_is_tty); // Formats the given time in milliseconds as seconds. GTEST_API_ std::string FormatTimeInMillisAsSeconds(TimeInMillis ms); // Parses a string for an Int32 flag, in the form of "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. GTEST_API_ bool ParseInt32Flag( const char* str, const char* flag, Int32* value); // Returns a random seed in range [1, kMaxRandomSeed] based on the // given --gtest_random_seed flag value. inline int GetRandomSeedFromFlag(Int32 random_seed_flag) { const unsigned int raw_seed = (random_seed_flag == 0) ? static_cast(GetTimeInMillis()) : static_cast(random_seed_flag); // Normalizes the actual seed to range [1, kMaxRandomSeed] such that // it's easy to type. const int normalized_seed = static_cast((raw_seed - 1U) % static_cast(kMaxRandomSeed)) + 1; return normalized_seed; } // Returns the first valid random seed after 'seed'. The behavior is // undefined if 'seed' is invalid. The seed after kMaxRandomSeed is // considered to be 1. inline int GetNextRandomSeed(int seed) { GTEST_CHECK_(1 <= seed && seed <= kMaxRandomSeed) << "Invalid random seed " << seed << " - must be in [1, " << kMaxRandomSeed << "]."; const int next_seed = seed + 1; return (next_seed > kMaxRandomSeed) ? 1 : next_seed; } // This class saves the values of all Google Test flags in its c'tor, and // restores them in its d'tor. class GTestFlagSaver { public: // The c'tor. GTestFlagSaver() { also_run_disabled_tests_ = GTEST_FLAG(also_run_disabled_tests); break_on_failure_ = GTEST_FLAG(break_on_failure); catch_exceptions_ = GTEST_FLAG(catch_exceptions); color_ = GTEST_FLAG(color); death_test_style_ = GTEST_FLAG(death_test_style); death_test_use_fork_ = GTEST_FLAG(death_test_use_fork); filter_ = GTEST_FLAG(filter); internal_run_death_test_ = GTEST_FLAG(internal_run_death_test); list_tests_ = GTEST_FLAG(list_tests); output_ = GTEST_FLAG(output); print_time_ = GTEST_FLAG(print_time); random_seed_ = GTEST_FLAG(random_seed); repeat_ = GTEST_FLAG(repeat); shuffle_ = GTEST_FLAG(shuffle); stack_trace_depth_ = GTEST_FLAG(stack_trace_depth); stream_result_to_ = GTEST_FLAG(stream_result_to); throw_on_failure_ = GTEST_FLAG(throw_on_failure); } // The d'tor is not virtual. DO NOT INHERIT FROM THIS CLASS. ~GTestFlagSaver() { GTEST_FLAG(also_run_disabled_tests) = also_run_disabled_tests_; GTEST_FLAG(break_on_failure) = break_on_failure_; GTEST_FLAG(catch_exceptions) = catch_exceptions_; GTEST_FLAG(color) = color_; GTEST_FLAG(death_test_style) = death_test_style_; GTEST_FLAG(death_test_use_fork) = death_test_use_fork_; GTEST_FLAG(filter) = filter_; GTEST_FLAG(internal_run_death_test) = internal_run_death_test_; GTEST_FLAG(list_tests) = list_tests_; GTEST_FLAG(output) = output_; GTEST_FLAG(print_time) = print_time_; GTEST_FLAG(random_seed) = random_seed_; GTEST_FLAG(repeat) = repeat_; GTEST_FLAG(shuffle) = shuffle_; GTEST_FLAG(stack_trace_depth) = stack_trace_depth_; GTEST_FLAG(stream_result_to) = stream_result_to_; GTEST_FLAG(throw_on_failure) = throw_on_failure_; } private: // Fields for saving the original values of flags. bool also_run_disabled_tests_; bool break_on_failure_; bool catch_exceptions_; String color_; String death_test_style_; bool death_test_use_fork_; String filter_; String internal_run_death_test_; bool list_tests_; String output_; bool print_time_; bool pretty_; internal::Int32 random_seed_; internal::Int32 repeat_; bool shuffle_; internal::Int32 stack_trace_depth_; String stream_result_to_; bool throw_on_failure_; } GTEST_ATTRIBUTE_UNUSED_; // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. GTEST_API_ char* CodePointToUtf8(UInt32 code_point, char* str); // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. GTEST_API_ String WideStringToUtf8(const wchar_t* str, int num_chars); // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded(); // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (e.g., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. GTEST_API_ bool ShouldShard(const char* total_shards_str, const char* shard_index_str, bool in_subprocess_for_death_test); // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error and // and aborts. GTEST_API_ Int32 Int32FromEnvOrDie(const char* env_var, Int32 default_val); // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. GTEST_API_ bool ShouldRunTestOnShard( int total_shards, int shard_index, int test_id); // STL container utilities. // Returns the number of elements in the given container that satisfy // the given predicate. template inline int CountIf(const Container& c, Predicate predicate) { // Implemented as an explicit loop since std::count_if() in libCstd on // Solaris has a non-standard signature. int count = 0; for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) { if (predicate(*it)) ++count; } return count; } // Applies a function/functor to each element in the container. template void ForEach(const Container& c, Functor functor) { std::for_each(c.begin(), c.end(), functor); } // Returns the i-th element of the vector, or default_value if i is not // in range [0, v.size()). template inline E GetElementOr(const std::vector& v, int i, E default_value) { return (i < 0 || i >= static_cast(v.size())) ? default_value : v[i]; } // Performs an in-place shuffle of a range of the vector's elements. // 'begin' and 'end' are element indices as an STL-style range; // i.e. [begin, end) are shuffled, where 'end' == size() means to // shuffle to the end of the vector. template void ShuffleRange(internal::Random* random, int begin, int end, std::vector* v) { const int size = static_cast(v->size()); GTEST_CHECK_(0 <= begin && begin <= size) << "Invalid shuffle range start " << begin << ": must be in range [0, " << size << "]."; GTEST_CHECK_(begin <= end && end <= size) << "Invalid shuffle range finish " << end << ": must be in range [" << begin << ", " << size << "]."; // Fisher-Yates shuffle, from // http://en.wikipedia.org/wiki/Fisher-Yates_shuffle for (int range_width = end - begin; range_width >= 2; range_width--) { const int last_in_range = begin + range_width - 1; const int selected = begin + random->Generate(range_width); std::swap((*v)[selected], (*v)[last_in_range]); } } // Performs an in-place shuffle of the vector's elements. template inline void Shuffle(internal::Random* random, std::vector* v) { ShuffleRange(random, 0, static_cast(v->size()), v); } // A function for deleting an object. Handy for being used as a // functor. template static void Delete(T* x) { delete x; } // A predicate that checks the key of a TestProperty against a known key. // // TestPropertyKeyIs is copyable. class TestPropertyKeyIs { public: // Constructor. // // TestPropertyKeyIs has NO default constructor. explicit TestPropertyKeyIs(const char* key) : key_(key) {} // Returns true iff the test name of test property matches on key_. bool operator()(const TestProperty& test_property) const { return String(test_property.key()).Compare(key_) == 0; } private: String key_; }; // Class UnitTestOptions. // // This class contains functions for processing options the user // specifies when running the tests. It has only static members. // // In most cases, the user can specify an option using either an // environment variable or a command line flag. E.g. you can set the // test filter using either GTEST_FILTER or --gtest_filter. If both // the variable and the flag are present, the latter overrides the // former. class GTEST_API_ UnitTestOptions { public: // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. static String GetOutputFormat(); // Returns the absolute path of the requested output file, or the // default (test_detail.xml in the original working directory) if // none was explicitly specified. static String GetAbsolutePathToOutputFile(); // Functions for processing the gtest_filter flag. // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. static bool PatternMatchesString(const char *pattern, const char *str); // Returns true iff the user-specified filter matches the test case // name and the test name. static bool FilterMatchesTest(const String &test_case_name, const String &test_name); #if GTEST_OS_WINDOWS // Function for supporting the gtest_catch_exception flag. // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. static int GTestShouldProcessSEH(DWORD exception_code); #endif // GTEST_OS_WINDOWS // Returns true if "name" matches the ':' separated list of glob-style // filters in "filter". static bool MatchesFilter(const String& name, const char* filter); }; // Returns the current application's name, removing directory path if that // is present. Used by UnitTestOptions::GetOutputFile. GTEST_API_ FilePath GetCurrentExecutableName(); // The role interface for getting the OS stack trace as a string. class OsStackTraceGetterInterface { public: OsStackTraceGetterInterface() {} virtual ~OsStackTraceGetterInterface() {} // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. virtual String CurrentStackTrace(int max_depth, int skip_count) = 0; // UponLeavingGTest() should be called immediately before Google Test calls // user code. It saves some information about the current stack that // CurrentStackTrace() will use to find and hide Google Test stack frames. virtual void UponLeavingGTest() = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetterInterface); }; // A working implementation of the OsStackTraceGetterInterface interface. class OsStackTraceGetter : public OsStackTraceGetterInterface { public: OsStackTraceGetter() : caller_frame_(NULL) {} virtual String CurrentStackTrace(int max_depth, int skip_count); virtual void UponLeavingGTest(); // This string is inserted in place of stack frames that are part of // Google Test's implementation. static const char* const kElidedFramesMarker; private: Mutex mutex_; // protects all internal state // We save the stack frame below the frame that calls user code. // We do this because the address of the frame immediately below // the user code changes between the call to UponLeavingGTest() // and any calls to CurrentStackTrace() from within the user code. void* caller_frame_; GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter); }; // Information about a Google Test trace point. struct TraceInfo { const char* file; int line; String message; }; // This is the default global test part result reporter used in UnitTestImpl. // This class should only be used by UnitTestImpl. class DefaultGlobalTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultGlobalTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. Reports the test part // result in the current test. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultGlobalTestPartResultReporter); }; // This is the default per thread test part result reporter used in // UnitTestImpl. This class should only be used by UnitTestImpl. class DefaultPerThreadTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultPerThreadTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. The implementation just // delegates to the current global test part result reporter of *unit_test_. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultPerThreadTestPartResultReporter); }; // The private implementation of the UnitTest class. We don't protect // the methods under a mutex, as this class is not accessible by a // user and the UnitTest class that delegates work to this class does // proper locking. class GTEST_API_ UnitTestImpl { public: explicit UnitTestImpl(UnitTest* parent); virtual ~UnitTestImpl(); // There are two different ways to register your own TestPartResultReporter. // You can register your own repoter to listen either only for test results // from the current thread or for results from all threads. // By default, each per-thread test result repoter just passes a new // TestPartResult to the global test result reporter, which registers the // test part result for the currently running test. // Returns the global test part result reporter. TestPartResultReporterInterface* GetGlobalTestPartResultReporter(); // Sets the global test part result reporter. void SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter); // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* GetTestPartResultReporterForCurrentThread(); // Sets the test part result reporter for the current thread. void SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter); // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const { return !Failed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const { return failed_test_case_count() > 0 || ad_hoc_test_result()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[i]; } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i) { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[index]; } // Provides access to the event listener list. TestEventListeners* listeners() { return &listeners_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* current_test_result(); // Returns the TestResult for the ad hoc test. const TestResult* ad_hoc_test_result() const { return &ad_hoc_test_result_; } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter // are the same; otherwise, deletes the old getter and makes the // input the current getter. void set_os_stack_trace_getter(OsStackTraceGetterInterface* getter); // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* os_stack_trace_getter(); // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String CurrentOsStackTraceExceptTop(int skip_count); // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Adds a TestInfo to the unit test. // // Arguments: // // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // test_info: the TestInfo object void AddTestInfo(Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, TestInfo* test_info) { // In order to support thread-safe death tests, we need to // remember the original working directory when the test program // was first invoked. We cannot do this in RUN_ALL_TESTS(), as // the user may have changed the current directory before calling // RUN_ALL_TESTS(). Therefore we capture the current directory in // AddTestInfo(), which is called to register a TEST or TEST_F // before main() is reached. if (original_working_dir_.IsEmpty()) { original_working_dir_.Set(FilePath::GetCurrentDir()); GTEST_CHECK_(!original_working_dir_.IsEmpty()) << "Failed to get the current working directory."; } GetTestCase(test_info->test_case_name(), test_info->type_param(), set_up_tc, tear_down_tc)->AddTestInfo(test_info); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. internal::ParameterizedTestCaseRegistry& parameterized_test_registry() { return parameterized_test_registry_; } #endif // GTEST_HAS_PARAM_TEST // Sets the TestCase object for the test that's currently running. void set_current_test_case(TestCase* a_current_test_case) { current_test_case_ = a_current_test_case; } // Sets the TestInfo object for the test that's currently running. If // current_test_info is NULL, the assertion results will be stored in // ad_hoc_test_result_. void set_current_test_info(TestInfo* a_current_test_info) { current_test_info_ = a_current_test_info; } // Registers all parameterized tests defined using TEST_P and // INSTANTIATE_TEST_CASE_P, creating regular tests for each test/parameter // combination. This method can be called more then once; it has guards // protecting from registering the tests more then once. If // value-parameterized tests are disabled, RegisterParameterizedTests is // present but does nothing. void RegisterParameterizedTests(); // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, this test is considered to be failed, but // the rest of the tests will still be run. bool RunAllTests(); // Clears the results of all tests, except the ad hoc tests. void ClearNonAdHocTestResult() { ForEach(test_cases_, TestCase::ClearTestCaseResult); } // Clears the results of ad-hoc test assertions. void ClearAdHocTestResult() { ad_hoc_test_result_.Clear(); } enum ReactionToSharding { HONOR_SHARDING_PROTOCOL, IGNORE_SHARDING_PROTOCOL }; // Matches the full name of each test against the user-specified // filter to decide whether the test should run, then records the // result in each TestCase and TestInfo object. // If shard_tests == HONOR_SHARDING_PROTOCOL, further filters tests // based on sharding variables in the environment. // Returns the number of tests that should run. int FilterTests(ReactionToSharding shard_tests); // Prints the names of the tests matching the user-specified filter flag. void ListTestsMatchingFilter(); const TestCase* current_test_case() const { return current_test_case_; } TestInfo* current_test_info() { return current_test_info_; } const TestInfo* current_test_info() const { return current_test_info_; } // Returns the vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector& environments() { return environments_; } // Getters for the per-thread Google Test trace stack. std::vector& gtest_trace_stack() { return *(gtest_trace_stack_.pointer()); } const std::vector& gtest_trace_stack() const { return gtest_trace_stack_.get(); } #if GTEST_HAS_DEATH_TEST void InitDeathTestSubprocessControlInfo() { internal_run_death_test_flag_.reset(ParseInternalRunDeathTestFlag()); } // Returns a pointer to the parsed --gtest_internal_run_death_test // flag, or NULL if that flag was not specified. // This information is useful only in a death test child process. // Must not be called before a call to InitGoogleTest. const InternalRunDeathTestFlag* internal_run_death_test_flag() const { return internal_run_death_test_flag_.get(); } // Returns a pointer to the current death test factory. internal::DeathTestFactory* death_test_factory() { return death_test_factory_.get(); } void SuppressTestEventsIfInSubprocess(); friend class ReplaceDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST // Initializes the event listener performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Initializes the event listener for streaming test results to a socket. // Must not be called before InitGoogleTest. void ConfigureStreamingOutput(); #endif // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void PostFlagParsingInit(); // Gets the random seed used at the start of the current test iteration. int random_seed() const { return random_seed_; } // Gets the random number generator. internal::Random* random() { return &random_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void ShuffleTests(); // Restores the test cases and tests to their order before the first shuffle. void UnshuffleTests(); // Returns the value of GTEST_FLAG(catch_exceptions) at the moment // UnitTest::Run() starts. bool catch_exceptions() const { return catch_exceptions_; } private: friend class ::testing::UnitTest; // Used by UnitTest::Run() to capture the state of // GTEST_FLAG(catch_exceptions) at the moment it starts. void set_catch_exceptions(bool value) { catch_exceptions_ = value; } // The UnitTest object that owns this implementation object. UnitTest* const parent_; // The working directory when the first TEST() or TEST_F() was // executed. internal::FilePath original_working_dir_; // The default test part result reporters. DefaultGlobalTestPartResultReporter default_global_test_part_result_reporter_; DefaultPerThreadTestPartResultReporter default_per_thread_test_part_result_reporter_; // Points to (but doesn't own) the global test part result reporter. TestPartResultReporterInterface* global_test_part_result_repoter_; // Protects read and write access to global_test_part_result_reporter_. internal::Mutex global_test_part_result_reporter_mutex_; // Points to (but doesn't own) the per-thread test part result reporter. internal::ThreadLocal per_thread_test_part_result_reporter_; // The vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector environments_; // The vector of TestCases in their original order. It owns the // elements in the vector. std::vector test_cases_; // Provides a level of indirection for the test case list to allow // easy shuffling and restoring the test case order. The i-th // element of this vector is the index of the i-th test case in the // shuffled order. std::vector test_case_indices_; #if GTEST_HAS_PARAM_TEST // ParameterizedTestRegistry object used to register value-parameterized // tests. internal::ParameterizedTestCaseRegistry parameterized_test_registry_; // Indicates whether RegisterParameterizedTests() has been called already. bool parameterized_tests_registered_; #endif // GTEST_HAS_PARAM_TEST // Index of the last death test case registered. Initially -1. int last_death_test_case_; // This points to the TestCase for the currently running test. It // changes as Google Test goes through one test case after another. // When no test is running, this is set to NULL and Google Test // stores assertion results in ad_hoc_test_result_. Initially NULL. TestCase* current_test_case_; // This points to the TestInfo for the currently running test. It // changes as Google Test goes through one test after another. When // no test is running, this is set to NULL and Google Test stores // assertion results in ad_hoc_test_result_. Initially NULL. TestInfo* current_test_info_; // Normally, a user only writes assertions inside a TEST or TEST_F, // or inside a function called by a TEST or TEST_F. Since Google // Test keeps track of which test is current running, it can // associate such an assertion with the test it belongs to. // // If an assertion is encountered when no TEST or TEST_F is running, // Google Test attributes the assertion result to an imaginary "ad hoc" // test, and records the result in ad_hoc_test_result_. TestResult ad_hoc_test_result_; // The list of event listeners that can be used to track events inside // Google Test. TestEventListeners listeners_; // The OS stack trace getter. Will be deleted when the UnitTest // object is destructed. By default, an OsStackTraceGetter is used, // but the user can set this field to use a custom getter if that is // desired. OsStackTraceGetterInterface* os_stack_trace_getter_; // True iff PostFlagParsingInit() has been called. bool post_flag_parse_init_performed_; // The random number seed used at the beginning of the test run. int random_seed_; // Our random number generator. internal::Random random_; // How long the test took to run, in milliseconds. TimeInMillis elapsed_time_; #if GTEST_HAS_DEATH_TEST // The decomposed components of the gtest_internal_run_death_test flag, // parsed when RUN_ALL_TESTS is called. internal::scoped_ptr internal_run_death_test_flag_; internal::scoped_ptr death_test_factory_; #endif // GTEST_HAS_DEATH_TEST // A per-thread stack of traces created by the SCOPED_TRACE() macro. internal::ThreadLocal > gtest_trace_stack_; // The value of GTEST_FLAG(catch_exceptions) at the moment RunAllTests() // starts. bool catch_exceptions_; GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTestImpl); }; // class UnitTestImpl // Convenience function for accessing the global UnitTest // implementation object. inline UnitTestImpl* GetUnitTestImpl() { return UnitTest::GetInstance()->impl(); } #if GTEST_USES_SIMPLE_RE // Internal helper functions for implementing the simple regular // expression matcher. GTEST_API_ bool IsInSet(char ch, const char* str); GTEST_API_ bool IsAsciiDigit(char ch); GTEST_API_ bool IsAsciiPunct(char ch); GTEST_API_ bool IsRepeat(char ch); GTEST_API_ bool IsAsciiWhiteSpace(char ch); GTEST_API_ bool IsAsciiWordChar(char ch); GTEST_API_ bool IsValidEscape(char ch); GTEST_API_ bool AtomMatchesChar(bool escaped, char pattern, char ch); GTEST_API_ bool ValidateRegex(const char* regex); GTEST_API_ bool MatchRegexAtHead(const char* regex, const char* str); GTEST_API_ bool MatchRepetitionAndRegexAtHead( bool escaped, char ch, char repeat, const char* regex, const char* str); GTEST_API_ bool MatchRegexAnywhere(const char* regex, const char* str); #endif // GTEST_USES_SIMPLE_RE // Parses the command line for Google Test flags, without initializing // other parts of Google Test. GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, char** argv); GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv); #if GTEST_HAS_DEATH_TEST // Returns the message describing the last system error, regardless of the // platform. GTEST_API_ String GetLastErrnoDescription(); # if GTEST_OS_WINDOWS // Provides leak-safe Windows kernel handle ownership. class AutoHandle { public: AutoHandle() : handle_(INVALID_HANDLE_VALUE) {} explicit AutoHandle(HANDLE handle) : handle_(handle) {} ~AutoHandle() { Reset(); } HANDLE Get() const { return handle_; } void Reset() { Reset(INVALID_HANDLE_VALUE); } void Reset(HANDLE handle) { if (handle != handle_) { if (handle_ != INVALID_HANDLE_VALUE) ::CloseHandle(handle_); handle_ = handle; } } private: HANDLE handle_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AutoHandle); }; # endif // GTEST_OS_WINDOWS // Attempts to parse a string into a positive integer pointed to by the // number parameter. Returns true if that is possible. // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we can use // it here. template bool ParseNaturalNumber(const ::std::string& str, Integer* number) { // Fail fast if the given string does not begin with a digit; // this bypasses strtoXXX's "optional leading whitespace and plus // or minus sign" semantics, which are undesirable here. if (str.empty() || !IsDigit(str[0])) { return false; } errno = 0; char* end; // BiggestConvertible is the largest integer type that system-provided // string-to-number conversion routines can return. # if GTEST_OS_WINDOWS && !defined(__GNUC__) // MSVC and C++ Builder define __int64 instead of the standard long long. typedef unsigned __int64 BiggestConvertible; const BiggestConvertible parsed = _strtoui64(str.c_str(), &end, 10); # else typedef unsigned long long BiggestConvertible; // NOLINT const BiggestConvertible parsed = strtoull(str.c_str(), &end, 10); # endif // GTEST_OS_WINDOWS && !defined(__GNUC__) const bool parse_success = *end == '\0' && errno == 0; // TODO(vladl@google.com): Convert this to compile time assertion when it is // available. GTEST_CHECK_(sizeof(Integer) <= sizeof(parsed)); const Integer result = static_cast(parsed); if (parse_success && static_cast(result) == parsed) { *number = result; return true; } return false; } #endif // GTEST_HAS_DEATH_TEST // TestResult contains some private methods that should be hidden from // Google Test user but are required for testing. This class allow our tests // to access them. // // This class is supplied only for the purpose of testing Google Test's own // constructs. Do not use it in user tests, either directly or indirectly. class TestResultAccessor { public: static void RecordProperty(TestResult* test_result, const TestProperty& property) { test_result->RecordProperty(property); } static void ClearTestPartResults(TestResult* test_result) { test_result->ClearTestPartResults(); } static const std::vector& test_part_results( const TestResult& test_result) { return test_result.test_part_results(); } }; } // namespace internal } // namespace testing #endif // GTEST_SRC_GTEST_INTERNAL_INL_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-port.cc0000600000175000017500000006135011561126632022653 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/internal/gtest-port.h" #include #include #include #include #if GTEST_OS_WINDOWS_MOBILE # include // For TerminateProcess() #elif GTEST_OS_WINDOWS # include # include #else # include #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_MAC # include # include # include #endif // GTEST_OS_MAC #include "gtest/gtest-spi.h" #include "gtest/gtest-message.h" #include "gtest/internal/gtest-internal.h" #include "gtest/internal/gtest-string.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { namespace internal { #if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC and C++Builder do not provide a definition of STDERR_FILENO. const int kStdOutFileno = 1; const int kStdErrFileno = 2; #else const int kStdOutFileno = STDOUT_FILENO; const int kStdErrFileno = STDERR_FILENO; #endif // _MSC_VER #if GTEST_OS_MAC // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. size_t GetThreadCount() { const task_t task = mach_task_self(); mach_msg_type_number_t thread_count; thread_act_array_t thread_list; const kern_return_t status = task_threads(task, &thread_list, &thread_count); if (status == KERN_SUCCESS) { // task_threads allocates resources in thread_list and we need to free them // to avoid leaks. vm_deallocate(task, reinterpret_cast(thread_list), sizeof(thread_t) * thread_count); return static_cast(thread_count); } else { return 0; } } #else size_t GetThreadCount() { // There's no portable way to detect the number of threads, so we just // return 0 to indicate that we cannot detect it. return 0; } #endif // GTEST_OS_MAC #if GTEST_USES_POSIX_RE // Implements RE. Currently only needed for death tests. RE::~RE() { if (is_valid_) { // regfree'ing an invalid regex might crash because the content // of the regex is undefined. Since the regex's are essentially // the same, one cannot be valid (or invalid) without the other // being so too. regfree(&partial_regex_); regfree(&full_regex_); } free(const_cast(pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.full_regex_, str, 1, &match, 0) == 0; } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.partial_regex_, str, 1, &match, 0) == 0; } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = posix::StrDup(regex); // Reserves enough bytes to hold the regular expression used for a // full match. const size_t full_regex_len = strlen(regex) + 10; char* const full_pattern = new char[full_regex_len]; snprintf(full_pattern, full_regex_len, "^(%s)$", regex); is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0; // We want to call regcomp(&partial_regex_, ...) even if the // previous expression returns false. Otherwise partial_regex_ may // not be properly initialized can may cause trouble when it's // freed. // // Some implementation of POSIX regex (e.g. on at least some // versions of Cygwin) doesn't accept the empty string as a valid // regex. We change it to an equivalent form "()" to be safe. if (is_valid_) { const char* const partial_regex = (*regex == '\0') ? "()" : regex; is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0; } EXPECT_TRUE(is_valid_) << "Regular expression \"" << regex << "\" is not a valid POSIX Extended regular expression."; delete[] full_pattern; } #elif GTEST_USES_SIMPLE_RE // Returns true iff ch appears anywhere in str (excluding the // terminating '\0' character). bool IsInSet(char ch, const char* str) { return ch != '\0' && strchr(str, ch) != NULL; } // Returns true iff ch belongs to the given classification. Unlike // similar functions in , these aren't affected by the // current locale. bool IsAsciiDigit(char ch) { return '0' <= ch && ch <= '9'; } bool IsAsciiPunct(char ch) { return IsInSet(ch, "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"); } bool IsRepeat(char ch) { return IsInSet(ch, "?*+"); } bool IsAsciiWhiteSpace(char ch) { return IsInSet(ch, " \f\n\r\t\v"); } bool IsAsciiWordChar(char ch) { return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || ('0' <= ch && ch <= '9') || ch == '_'; } // Returns true iff "\\c" is a supported escape sequence. bool IsValidEscape(char c) { return (IsAsciiPunct(c) || IsInSet(c, "dDfnrsStvwW")); } // Returns true iff the given atom (specified by escaped and pattern) // matches ch. The result is undefined if the atom is invalid. bool AtomMatchesChar(bool escaped, char pattern_char, char ch) { if (escaped) { // "\\p" where p is pattern_char. switch (pattern_char) { case 'd': return IsAsciiDigit(ch); case 'D': return !IsAsciiDigit(ch); case 'f': return ch == '\f'; case 'n': return ch == '\n'; case 'r': return ch == '\r'; case 's': return IsAsciiWhiteSpace(ch); case 'S': return !IsAsciiWhiteSpace(ch); case 't': return ch == '\t'; case 'v': return ch == '\v'; case 'w': return IsAsciiWordChar(ch); case 'W': return !IsAsciiWordChar(ch); } return IsAsciiPunct(pattern_char) && pattern_char == ch; } return (pattern_char == '.' && ch != '\n') || pattern_char == ch; } // Helper function used by ValidateRegex() to format error messages. String FormatRegexSyntaxError(const char* regex, int index) { return (Message() << "Syntax error at index " << index << " in simple regular expression \"" << regex << "\": ").GetString(); } // Generates non-fatal failures and returns false if regex is invalid; // otherwise returns true. bool ValidateRegex(const char* regex) { if (regex == NULL) { // TODO(wan@google.com): fix the source file location in the // assertion failures to match where the regex is used in user // code. ADD_FAILURE() << "NULL is not a valid simple regular expression."; return false; } bool is_valid = true; // True iff ?, *, or + can follow the previous atom. bool prev_repeatable = false; for (int i = 0; regex[i]; i++) { if (regex[i] == '\\') { // An escape sequence i++; if (regex[i] == '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "'\\' cannot appear at the end."; return false; } if (!IsValidEscape(regex[i])) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "invalid escape sequence \"\\" << regex[i] << "\"."; is_valid = false; } prev_repeatable = true; } else { // Not an escape sequence. const char ch = regex[i]; if (ch == '^' && i > 0) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'^' can only appear at the beginning."; is_valid = false; } else if (ch == '$' && regex[i + 1] != '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'$' can only appear at the end."; is_valid = false; } else if (IsInSet(ch, "()[]{}|")) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' is unsupported."; is_valid = false; } else if (IsRepeat(ch) && !prev_repeatable) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' can only follow a repeatable token."; is_valid = false; } prev_repeatable = !IsInSet(ch, "^$?*+"); } } return is_valid; } // Matches a repeated regex atom followed by a valid simple regular // expression. The regex atom is defined as c if escaped is false, // or \c otherwise. repeat is the repetition meta character (?, *, // or +). The behavior is undefined if str contains too many // characters to be indexable by size_t, in which case the test will // probably time out anyway. We are fine with this limitation as // std::string has it too. bool MatchRepetitionAndRegexAtHead( bool escaped, char c, char repeat, const char* regex, const char* str) { const size_t min_count = (repeat == '+') ? 1 : 0; const size_t max_count = (repeat == '?') ? 1 : static_cast(-1) - 1; // We cannot call numeric_limits::max() as it conflicts with the // max() macro on Windows. for (size_t i = 0; i <= max_count; ++i) { // We know that the atom matches each of the first i characters in str. if (i >= min_count && MatchRegexAtHead(regex, str + i)) { // We have enough matches at the head, and the tail matches too. // Since we only care about *whether* the pattern matches str // (as opposed to *how* it matches), there is no need to find a // greedy match. return true; } if (str[i] == '\0' || !AtomMatchesChar(escaped, c, str[i])) return false; } return false; } // Returns true iff regex matches a prefix of str. regex must be a // valid simple regular expression and not start with "^", or the // result is undefined. bool MatchRegexAtHead(const char* regex, const char* str) { if (*regex == '\0') // An empty regex matches a prefix of anything. return true; // "$" only matches the end of a string. Note that regex being // valid guarantees that there's nothing after "$" in it. if (*regex == '$') return *str == '\0'; // Is the first thing in regex an escape sequence? const bool escaped = *regex == '\\'; if (escaped) ++regex; if (IsRepeat(regex[1])) { // MatchRepetitionAndRegexAtHead() calls MatchRegexAtHead(), so // here's an indirect recursion. It terminates as the regex gets // shorter in each recursion. return MatchRepetitionAndRegexAtHead( escaped, regex[0], regex[1], regex + 2, str); } else { // regex isn't empty, isn't "$", and doesn't start with a // repetition. We match the first atom of regex with the first // character of str and recurse. return (*str != '\0') && AtomMatchesChar(escaped, *regex, *str) && MatchRegexAtHead(regex + 1, str + 1); } } // Returns true iff regex matches any substring of str. regex must be // a valid simple regular expression, or the result is undefined. // // The algorithm is recursive, but the recursion depth doesn't exceed // the regex length, so we won't need to worry about running out of // stack space normally. In rare cases the time complexity can be // exponential with respect to the regex length + the string length, // but usually it's must faster (often close to linear). bool MatchRegexAnywhere(const char* regex, const char* str) { if (regex == NULL || str == NULL) return false; if (*regex == '^') return MatchRegexAtHead(regex + 1, str); // A successful match can be anywhere in str. do { if (MatchRegexAtHead(regex, str)) return true; } while (*str++ != '\0'); return false; } // Implements the RE class. RE::~RE() { free(const_cast(pattern_)); free(const_cast(full_pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.full_pattern_, str); } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.pattern_, str); } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = full_pattern_ = NULL; if (regex != NULL) { pattern_ = posix::StrDup(regex); } is_valid_ = ValidateRegex(regex); if (!is_valid_) { // No need to calculate the full pattern when the regex is invalid. return; } const size_t len = strlen(regex); // Reserves enough bytes to hold the regular expression used for a // full match: we need space to prepend a '^', append a '$', and // terminate the string with '\0'. char* buffer = static_cast(malloc(len + 3)); full_pattern_ = buffer; if (*regex != '^') *buffer++ = '^'; // Makes sure full_pattern_ starts with '^'. // We don't use snprintf or strncpy, as they trigger a warning when // compiled with VC++ 8.0. memcpy(buffer, regex, len); buffer += len; if (len == 0 || regex[len - 1] != '$') *buffer++ = '$'; // Makes sure full_pattern_ ends with '$'. *buffer = '\0'; } #endif // GTEST_USES_POSIX_RE const char kUnknownFile[] = "unknown file"; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) { return String::Format("%s:", file_name).c_str(); } #ifdef _MSC_VER return String::Format("%s(%d):", file_name, line).c_str(); #else return String::Format("%s:%d:", file_name, line).c_str(); #endif // _MSC_VER } // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. // Note that FormatCompilerIndependentFileLocation() does NOT append colon // to the file location it produces, unlike FormatFileLocation(). GTEST_API_ ::std::string FormatCompilerIndependentFileLocation( const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) return file_name; else return String::Format("%s:%d", file_name, line).c_str(); } GTestLog::GTestLog(GTestLogSeverity severity, const char* file, int line) : severity_(severity) { const char* const marker = severity == GTEST_INFO ? "[ INFO ]" : severity == GTEST_WARNING ? "[WARNING]" : severity == GTEST_ERROR ? "[ ERROR ]" : "[ FATAL ]"; GetStream() << ::std::endl << marker << " " << FormatFileLocation(file, line).c_str() << ": "; } // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. GTestLog::~GTestLog() { GetStream() << ::std::endl; if (severity_ == GTEST_FATAL) { fflush(stderr); posix::Abort(); } } // Disable Microsoft deprecation warnings for POSIX functions called from // this class (creat, dup, dup2, and close) #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4996) #endif // _MSC_VER #if GTEST_HAS_STREAM_REDIRECTION // Object that captures an output stream (stdout/stderr). class CapturedStream { public: // The ctor redirects the stream to a temporary file. CapturedStream(int fd) : fd_(fd), uncaptured_fd_(dup(fd)) { # if GTEST_OS_WINDOWS char temp_dir_path[MAX_PATH + 1] = { '\0' }; // NOLINT char temp_file_path[MAX_PATH + 1] = { '\0' }; // NOLINT ::GetTempPathA(sizeof(temp_dir_path), temp_dir_path); const UINT success = ::GetTempFileNameA(temp_dir_path, "gtest_redir", 0, // Generate unique file name. temp_file_path); GTEST_CHECK_(success != 0) << "Unable to create a temporary file in " << temp_dir_path; const int captured_fd = creat(temp_file_path, _S_IREAD | _S_IWRITE); GTEST_CHECK_(captured_fd != -1) << "Unable to open temporary file " << temp_file_path; filename_ = temp_file_path; # else // There's no guarantee that a test has write access to the // current directory, so we create the temporary file in the /tmp // directory instead. char name_template[] = "/tmp/captured_stream.XXXXXX"; const int captured_fd = mkstemp(name_template); filename_ = name_template; # endif // GTEST_OS_WINDOWS fflush(NULL); dup2(captured_fd, fd_); close(captured_fd); } ~CapturedStream() { remove(filename_.c_str()); } String GetCapturedString() { if (uncaptured_fd_ != -1) { // Restores the original stream. fflush(NULL); dup2(uncaptured_fd_, fd_); close(uncaptured_fd_); uncaptured_fd_ = -1; } FILE* const file = posix::FOpen(filename_.c_str(), "r"); const String content = ReadEntireFile(file); posix::FClose(file); return content; } private: // Reads the entire content of a file as a String. static String ReadEntireFile(FILE* file); // Returns the size (in bytes) of a file. static size_t GetFileSize(FILE* file); const int fd_; // A stream to capture. int uncaptured_fd_; // Name of the temporary file holding the stderr output. ::std::string filename_; GTEST_DISALLOW_COPY_AND_ASSIGN_(CapturedStream); }; // Returns the size (in bytes) of a file. size_t CapturedStream::GetFileSize(FILE* file) { fseek(file, 0, SEEK_END); return static_cast(ftell(file)); } // Reads the entire content of a file as a string. String CapturedStream::ReadEntireFile(FILE* file) { const size_t file_size = GetFileSize(file); char* const buffer = new char[file_size]; size_t bytes_last_read = 0; // # of bytes read in the last fread() size_t bytes_read = 0; // # of bytes read so far fseek(file, 0, SEEK_SET); // Keeps reading the file until we cannot read further or the // pre-determined file size is reached. do { bytes_last_read = fread(buffer+bytes_read, 1, file_size-bytes_read, file); bytes_read += bytes_last_read; } while (bytes_last_read > 0 && bytes_read < file_size); const String content(buffer, bytes_read); delete[] buffer; return content; } # ifdef _MSC_VER # pragma warning(pop) # endif // _MSC_VER static CapturedStream* g_captured_stderr = NULL; static CapturedStream* g_captured_stdout = NULL; // Starts capturing an output stream (stdout/stderr). void CaptureStream(int fd, const char* stream_name, CapturedStream** stream) { if (*stream != NULL) { GTEST_LOG_(FATAL) << "Only one " << stream_name << " capturer can exist at a time."; } *stream = new CapturedStream(fd); } // Stops capturing the output stream and returns the captured string. String GetCapturedStream(CapturedStream** captured_stream) { const String content = (*captured_stream)->GetCapturedString(); delete *captured_stream; *captured_stream = NULL; return content; } // Starts capturing stdout. void CaptureStdout() { CaptureStream(kStdOutFileno, "stdout", &g_captured_stdout); } // Starts capturing stderr. void CaptureStderr() { CaptureStream(kStdErrFileno, "stderr", &g_captured_stderr); } // Stops capturing stdout and returns the captured string. String GetCapturedStdout() { return GetCapturedStream(&g_captured_stdout); } // Stops capturing stderr and returns the captured string. String GetCapturedStderr() { return GetCapturedStream(&g_captured_stderr); } #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). ::std::vector g_argvs; // Returns the command line as a vector of strings. const ::std::vector& GetArgvs() { return g_argvs; } #endif // GTEST_HAS_DEATH_TEST #if GTEST_OS_WINDOWS_MOBILE namespace posix { void Abort() { DebugBreak(); TerminateProcess(GetCurrentProcess(), 1); } } // namespace posix #endif // GTEST_OS_WINDOWS_MOBILE // Returns the name of the environment variable corresponding to the // given flag. For example, FlagToEnvVar("foo") will return // "GTEST_FOO" in the open-source version. static String FlagToEnvVar(const char* flag) { const String full_flag = (Message() << GTEST_FLAG_PREFIX_ << flag).GetString(); Message env_var; for (size_t i = 0; i != full_flag.length(); i++) { env_var << ToUpper(full_flag.c_str()[i]); } return env_var.GetString(); } // Parses 'str' for a 32-bit signed integer. If successful, writes // the result to *value and returns true; otherwise leaves *value // unchanged and returns false. bool ParseInt32(const Message& src_text, const char* str, Int32* value) { // Parses the environment variable as a decimal integer. char* end = NULL; const long long_value = strtol(str, &end, 10); // NOLINT // Has strtol() consumed all characters in the string? if (*end != '\0') { // No - an invalid character was encountered. Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value \"" << str << "\".\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } // Is the parsed value in the range of an Int32? const Int32 result = static_cast(long_value); if (long_value == LONG_MAX || long_value == LONG_MIN || // The parsed value overflows as a long. (strtol() returns // LONG_MAX or LONG_MIN when the input overflows.) result != long_value // The parsed value overflows as an Int32. ) { Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value " << str << ", which overflows.\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } *value = result; return true; } // Reads and returns the Boolean environment variable corresponding to // the given flag; if it's not set, returns default_value. // // The value is considered true iff it's not "0". bool BoolFromGTestEnv(const char* flag, bool default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); return string_value == NULL ? default_value : strcmp(string_value, "0") != 0; } // Reads and returns a 32-bit integer stored in the environment // variable corresponding to the given flag; if it isn't set or // doesn't represent a valid 32-bit integer, returns default_value. Int32 Int32FromGTestEnv(const char* flag, Int32 default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); if (string_value == NULL) { // The environment variable is not set. return default_value; } Int32 result = default_value; if (!ParseInt32(Message() << "Environment variable " << env_var, string_value, &result)) { printf("The default value %s is used.\n", (Message() << default_value).GetString().c_str()); fflush(stdout); return default_value; } return result; } // Reads and returns the string environment variable corresponding to // the given flag; if it's not set, returns default_value. const char* StringFromGTestEnv(const char* flag, const char* default_value) { const String env_var = FlagToEnvVar(flag); const char* const value = posix::GetEnv(env_var.c_str()); return value == NULL ? default_value : value; } } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-printers.cc0000600000175000017500000002741211561126632023536 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // It uses the << operator when possible, and prints the bytes in the // object otherwise. A user can override its behavior for a class // type Foo by defining either operator<<(::std::ostream&, const Foo&) // or void PrintTo(const Foo&, ::std::ostream*) in the namespace that // defines Foo. #include "gtest/gtest-printers.h" #include #include #include // NOLINT #include #include "gtest/internal/gtest-port.h" namespace testing { namespace { using ::std::ostream; #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not define _snprintf_s. # define snprintf _snprintf #elif _MSC_VER >= 1400 // VC 8.0 and later deprecate snprintf and _snprintf. # define snprintf _snprintf_s #elif _MSC_VER # define snprintf _snprintf #endif // GTEST_OS_WINDOWS_MOBILE // Prints a segment of bytes in the given object. void PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, size_t count, ostream* os) { char text[5] = ""; for (size_t i = 0; i != count; i++) { const size_t j = start + i; if (i != 0) { // Organizes the bytes into groups of 2 for easy parsing by // human. if ((j % 2) == 0) *os << ' '; else *os << '-'; } snprintf(text, sizeof(text), "%02X", obj_bytes[j]); *os << text; } } // Prints the bytes in the given value to the given ostream. void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, ostream* os) { // Tells the user how big the object is. *os << count << "-byte object <"; const size_t kThreshold = 132; const size_t kChunkSize = 64; // If the object size is bigger than kThreshold, we'll have to omit // some details by printing only the first and the last kChunkSize // bytes. // TODO(wan): let the user control the threshold using a flag. if (count < kThreshold) { PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); } else { PrintByteSegmentInObjectTo(obj_bytes, 0, kChunkSize, os); *os << " ... "; // Rounds up to 2-byte boundary. const size_t resume_pos = (count - kChunkSize + 1)/2*2; PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); } *os << ">"; } } // namespace namespace internal2 { // Delegates to PrintBytesInObjectToImpl() to print the bytes in the // given object. The delegation simplifies the implementation, which // uses the << operator and thus is easier done outside of the // ::testing::internal namespace, which contains a << operator that // sometimes conflicts with the one in STL. void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ostream* os) { PrintBytesInObjectToImpl(obj_bytes, count, os); } } // namespace internal2 namespace internal { // Depending on the value of a char (or wchar_t), we print it in one // of three formats: // - as is if it's a printable ASCII (e.g. 'a', '2', ' '), // - as a hexidecimal escape sequence (e.g. '\x7F'), or // - as a special escape sequence (e.g. '\r', '\n'). enum CharFormat { kAsIs, kHexEscape, kSpecialEscape }; // Returns true if c is a printable ASCII character. We test the // value of c directly instead of calling isprint(), which is buggy on // Windows Mobile. inline bool IsPrintableAscii(wchar_t c) { return 0x20 <= c && c <= 0x7E; } // Prints a wide or narrow char c as a character literal without the // quotes, escaping it when necessary; returns how c was formatted. // The template argument UnsignedChar is the unsigned version of Char, // which is the type of c. template static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) { switch (static_cast(c)) { case L'\0': *os << "\\0"; break; case L'\'': *os << "\\'"; break; case L'\\': *os << "\\\\"; break; case L'\a': *os << "\\a"; break; case L'\b': *os << "\\b"; break; case L'\f': *os << "\\f"; break; case L'\n': *os << "\\n"; break; case L'\r': *os << "\\r"; break; case L'\t': *os << "\\t"; break; case L'\v': *os << "\\v"; break; default: if (IsPrintableAscii(c)) { *os << static_cast(c); return kAsIs; } else { *os << String::Format("\\x%X", static_cast(c)); return kHexEscape; } } return kSpecialEscape; } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsWideStringLiteralTo(wchar_t c, ostream* os) { switch (c) { case L'\'': *os << "'"; return kAsIs; case L'"': *os << "\\\""; return kSpecialEscape; default: return PrintAsCharLiteralTo(c, os); } } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsNarrowStringLiteralTo(char c, ostream* os) { return PrintAsWideStringLiteralTo(static_cast(c), os); } // Prints a wide or narrow character c and its code. '\0' is printed // as "'\\0'", other unprintable characters are also properly escaped // using the standard C++ escape sequence. The template argument // UnsignedChar is the unsigned version of Char, which is the type of c. template void PrintCharAndCodeTo(Char c, ostream* os) { // First, print c as a literal in the most readable form we can find. *os << ((sizeof(c) > 1) ? "L'" : "'"); const CharFormat format = PrintAsCharLiteralTo(c, os); *os << "'"; // To aid user debugging, we also print c's code in decimal, unless // it's 0 (in which case c was printed as '\\0', making the code // obvious). if (c == 0) return; *os << " (" << String::Format("%d", c).c_str(); // For more convenience, we print c's code again in hexidecimal, // unless c was already printed in the form '\x##' or the code is in // [1, 9]. if (format == kHexEscape || (1 <= c && c <= 9)) { // Do nothing. } else { *os << String::Format(", 0x%X", static_cast(c)).c_str(); } *os << ")"; } void PrintTo(unsigned char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } void PrintTo(signed char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its code. L'\0' is printed as "L'\\0'". void PrintTo(wchar_t wc, ostream* os) { PrintCharAndCodeTo(wc, os); } // Prints the given array of characters to the ostream. // The array starts at *begin, the length is len, it may include '\0' characters // and may not be null-terminated. static void PrintCharsAsStringTo(const char* begin, size_t len, ostream* os) { *os << "\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const char cur = begin[index]; if (is_previous_hex && IsXDigit(cur)) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" \""; } is_previous_hex = PrintAsNarrowStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints a (const) char array of 'len' elements, starting at address 'begin'. void UniversalPrintArray(const char* begin, size_t len, ostream* os) { PrintCharsAsStringTo(begin, len, os); } // Prints the given array of wide characters to the ostream. // The array starts at *begin, the length is len, it may include L'\0' // characters and may not be null-terminated. static void PrintWideCharsAsStringTo(const wchar_t* begin, size_t len, ostream* os) { *os << "L\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const wchar_t cur = begin[index]; if (is_previous_hex && isascii(cur) && IsXDigit(static_cast(cur))) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" L\""; } is_previous_hex = PrintAsWideStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints the given C string to the ostream. void PrintTo(const char* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintCharsAsStringTo(s, strlen(s), os); } } // MSVC compiler can be configured to define whar_t as a typedef // of unsigned short. Defining an overload for const wchar_t* in that case // would cause pointers to unsigned shorts be printed as wide strings, // possibly accessing more memory than intended and causing invalid // memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when // wchar_t is implemented as a native type. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Prints the given wide C string to the ostream. void PrintTo(const wchar_t* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintWideCharsAsStringTo(s, wcslen(s), os); } } #endif // wchar_t is native // Prints a ::string object. #if GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::std::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } // Prints a ::wstring object. #if GTEST_HAS_GLOBAL_WSTRING void PrintWideStringTo(const ::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING void PrintWideStringTo(const ::std::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_STD_WSTRING } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-test-part.cc0000600000175000017500000001014511561126632023606 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // The Google C++ Testing Framework (Google Test) #include "gtest/gtest-test-part.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { using internal::GetUnitTestImpl; // Gets the summary of the failure message by omitting the stack trace // in it. internal::String TestPartResult::ExtractSummary(const char* message) { const char* const stack_trace = strstr(message, internal::kStackTraceMarker); return stack_trace == NULL ? internal::String(message) : internal::String(message, stack_trace - message); } // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result) { return os << result.file_name() << ":" << result.line_number() << ": " << (result.type() == TestPartResult::kSuccess ? "Success" : result.type() == TestPartResult::kFatalFailure ? "Fatal failure" : "Non-fatal failure") << ":\n" << result.message() << std::endl; } // Appends a TestPartResult to the array. void TestPartResultArray::Append(const TestPartResult& result) { array_.push_back(result); } // Returns the TestPartResult at the given index (0-based). const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const { if (index < 0 || index >= size()) { printf("\nInvalid index (%d) into TestPartResultArray.\n", index); internal::posix::Abort(); } return array_[index]; } // Returns the number of TestPartResult objects in the array. int TestPartResultArray::size() const { return static_cast(array_.size()); } namespace internal { HasNewFatalFailureHelper::HasNewFatalFailureHelper() : has_new_fatal_failure_(false), original_reporter_(GetUnitTestImpl()-> GetTestPartResultReporterForCurrentThread()) { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread(this); } HasNewFatalFailureHelper::~HasNewFatalFailureHelper() { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread( original_reporter_); } void HasNewFatalFailureHelper::ReportTestPartResult( const TestPartResult& result) { if (result.fatally_failed()) has_new_fatal_failure_ = true; original_reporter_->ReportTestPartResult(result); } } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest-typed-test.cc0000600000175000017500000000724311561126632023772 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest-typed-test.h" #include "gtest/gtest.h" namespace testing { namespace internal { #if GTEST_HAS_TYPED_TEST_P // Skips to the first non-space char in str. Returns an empty string if str // contains only whitespace characters. static const char* SkipSpaces(const char* str) { while (IsSpace(*str)) str++; return str; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* TypedTestCasePState::VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests) { typedef ::std::set::const_iterator DefinedTestIter; registered_ = true; // Skip initial whitespace in registered_tests since some // preprocessors prefix stringizied literals with whitespace. registered_tests = SkipSpaces(registered_tests); Message errors; ::std::set tests; for (const char* names = registered_tests; names != NULL; names = SkipComma(names)) { const String name = GetPrefixUntilComma(names); if (tests.count(name) != 0) { errors << "Test " << name << " is listed more than once.\n"; continue; } bool found = false; for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (name == *it) { found = true; break; } } if (found) { tests.insert(name); } else { errors << "No test named " << name << " can be found in this test case.\n"; } } for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (tests.count(*it) == 0) { errors << "You forgot to list test " << *it << ".\n"; } } const String& errors_str = errors.GetString(); if (errors_str != "") { fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors_str.c_str()); fflush(stderr); posix::Abort(); } return registered_tests; } #endif // GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest.cc0000600000175000017500000053715611561126632021705 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) #include "gtest/gtest.h" #include "gtest/gtest-spi.h" #include #include #include #include #include #include #include #include #include // NOLINT #include #include #if GTEST_OS_LINUX // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # include // NOLINT # include // NOLINT // Declares vsnprintf(). This header is not available on Windows. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # include #elif GTEST_OS_SYMBIAN # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT #elif GTEST_OS_ZOS # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT // On z/OS we additionally need strings.h for strcasecmp. # include // NOLINT #elif GTEST_OS_WINDOWS_MOBILE // We are on Windows CE. # include // NOLINT #elif GTEST_OS_WINDOWS // We are on Windows proper. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # if GTEST_OS_WINDOWS_MINGW // MinGW has gettimeofday() but not _ftime64(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). // TODO(kenton@google.com): There are other ways to get the time on // Windows, like GetTickCount() or GetSystemTimeAsFileTime(). MinGW // supports these. consider using them instead. # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # endif // GTEST_OS_WINDOWS_MINGW // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT #else // Assume other platforms have gettimeofday(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT # include // NOLINT #endif // GTEST_OS_LINUX #if GTEST_HAS_EXCEPTIONS # include #endif #if GTEST_CAN_STREAM_RESULTS_ # include // NOLINT # include // NOLINT #endif // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ #if GTEST_OS_WINDOWS # define vsnprintf _vsnprintf #endif // GTEST_OS_WINDOWS namespace testing { using internal::CountIf; using internal::ForEach; using internal::GetElementOr; using internal::Shuffle; // Constants. // A test whose test case name or test name matches this filter is // disabled and not run. static const char kDisableTestFilter[] = "DISABLED_*:*/DISABLED_*"; // A test case whose name matches this filter is considered a death // test case and will be run before test cases whose name doesn't // match this filter. static const char kDeathTestCaseFilter[] = "*DeathTest:*DeathTest/*"; // A test filter that matches everything. static const char kUniversalFilter[] = "*"; // The default output file for XML output. static const char kDefaultOutputFile[] = "test_detail.xml"; // The environment variable name for the test shard index. static const char kTestShardIndex[] = "GTEST_SHARD_INDEX"; // The environment variable name for the total number of test shards. static const char kTestTotalShards[] = "GTEST_TOTAL_SHARDS"; // The environment variable name for the test shard status file. static const char kTestShardStatusFile[] = "GTEST_SHARD_STATUS_FILE"; namespace internal { // The text used in failure messages to indicate the start of the // stack trace. const char kStackTraceMarker[] = "\nStack trace:\n"; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. bool g_help_flag = false; } // namespace internal GTEST_DEFINE_bool_( also_run_disabled_tests, internal::BoolFromGTestEnv("also_run_disabled_tests", false), "Run disabled tests too, in addition to the tests normally being run."); GTEST_DEFINE_bool_( break_on_failure, internal::BoolFromGTestEnv("break_on_failure", false), "True iff a failed assertion should be a debugger break-point."); GTEST_DEFINE_bool_( catch_exceptions, internal::BoolFromGTestEnv("catch_exceptions", true), "True iff " GTEST_NAME_ " should catch exceptions and treat them as test failures."); GTEST_DEFINE_string_( color, internal::StringFromGTestEnv("color", "auto"), "Whether to use colors in the output. Valid values: yes, no, " "and auto. 'auto' means to use colors if the output is " "being sent to a terminal and the TERM environment variable " "is set to xterm, xterm-color, xterm-256color, linux or cygwin."); GTEST_DEFINE_string_( filter, internal::StringFromGTestEnv("filter", kUniversalFilter), "A colon-separated list of glob (not regex) patterns " "for filtering the tests to run, optionally followed by a " "'-' and a : separated list of negative patterns (tests to " "exclude). A test is run if it matches one of the positive " "patterns and does not match any of the negative patterns."); GTEST_DEFINE_bool_(list_tests, false, "List all tests without running them."); GTEST_DEFINE_string_( output, internal::StringFromGTestEnv("output", ""), "A format (currently must be \"xml\"), optionally followed " "by a colon and an output file name or directory. A directory " "is indicated by a trailing pathname separator. " "Examples: \"xml:filename.xml\", \"xml::directoryname/\". " "If a directory is specified, output files will be created " "within that directory, with file-names based on the test " "executable's name and, if necessary, made unique by adding " "digits."); GTEST_DEFINE_bool_( print_time, internal::BoolFromGTestEnv("print_time", true), "True iff " GTEST_NAME_ " should display elapsed time in text output."); GTEST_DEFINE_int32_( random_seed, internal::Int32FromGTestEnv("random_seed", 0), "Random number seed to use when shuffling test orders. Must be in range " "[1, 99999], or 0 to use a seed based on the current time."); GTEST_DEFINE_int32_( repeat, internal::Int32FromGTestEnv("repeat", 1), "How many times to repeat each test. Specify a negative number " "for repeating forever. Useful for shaking out flaky tests."); GTEST_DEFINE_bool_( show_internal_stack_frames, false, "True iff " GTEST_NAME_ " should include internal stack frames when " "printing test failure stack traces."); GTEST_DEFINE_bool_( shuffle, internal::BoolFromGTestEnv("shuffle", false), "True iff " GTEST_NAME_ " should randomize tests' order on every run."); GTEST_DEFINE_int32_( stack_trace_depth, internal::Int32FromGTestEnv("stack_trace_depth", kMaxStackTraceDepth), "The maximum number of stack frames to print when an " "assertion fails. The valid range is 0 through 100, inclusive."); GTEST_DEFINE_string_( stream_result_to, internal::StringFromGTestEnv("stream_result_to", ""), "This flag specifies the host name and the port number on which to stream " "test results. Example: \"localhost:555\". The flag is effective only on " "Linux."); GTEST_DEFINE_bool_( throw_on_failure, internal::BoolFromGTestEnv("throw_on_failure", false), "When this flag is specified, a failed assertion will throw an exception " "if exceptions are enabled or exit the program with a non-zero code " "otherwise."); namespace internal { // Generates a random number from [0, range), using a Linear // Congruential Generator (LCG). Crashes if 'range' is 0 or greater // than kMaxRange. UInt32 Random::Generate(UInt32 range) { // These constants are the same as are used in glibc's rand(3). state_ = (1103515245U*state_ + 12345U) % kMaxRange; GTEST_CHECK_(range > 0) << "Cannot generate a number in the range [0, 0)."; GTEST_CHECK_(range <= kMaxRange) << "Generation of a number in [0, " << range << ") was requested, " << "but this can only generate numbers in [0, " << kMaxRange << ")."; // Converting via modulus introduces a bit of downward bias, but // it's simple, and a linear congruential generator isn't too good // to begin with. return state_ % range; } // GTestIsInitialized() returns true iff the user has initialized // Google Test. Useful for catching the user mistake of not initializing // Google Test before calling RUN_ALL_TESTS(). // // A user must call testing::InitGoogleTest() to initialize Google // Test. g_init_gtest_count is set to the number of times // InitGoogleTest() has been called. We don't protect this variable // under a mutex as it is only accessed in the main thread. int g_init_gtest_count = 0; static bool GTestIsInitialized() { return g_init_gtest_count != 0; } // Iterates over a vector of TestCases, keeping a running sum of the // results of calling a given int-returning method on each. // Returns the sum. static int SumOverTestCaseList(const std::vector& case_list, int (TestCase::*method)() const) { int sum = 0; for (size_t i = 0; i < case_list.size(); i++) { sum += (case_list[i]->*method)(); } return sum; } // Returns true iff the test case passed. static bool TestCasePassed(const TestCase* test_case) { return test_case->should_run() && test_case->Passed(); } // Returns true iff the test case failed. static bool TestCaseFailed(const TestCase* test_case) { return test_case->should_run() && test_case->Failed(); } // Returns true iff test_case contains at least one test that should // run. static bool ShouldRunTestCase(const TestCase* test_case) { return test_case->should_run(); } // AssertHelper constructor. AssertHelper::AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message) : data_(new AssertHelperData(type, file, line, message)) { } AssertHelper::~AssertHelper() { delete data_; } // Message assignment, for assertion streaming support. void AssertHelper::operator=(const Message& message) const { UnitTest::GetInstance()-> AddTestPartResult(data_->type, data_->file, data_->line, AppendUserMessage(data_->message, message), UnitTest::GetInstance()->impl() ->CurrentOsStackTraceExceptTop(1) // Skips the stack frame for this function itself. ); // NOLINT } // Mutex for linked pointers. GTEST_DEFINE_STATIC_MUTEX_(g_linked_ptr_mutex); // Application pathname gotten in InitGoogleTest. String g_executable_path; // Returns the current application's name, removing directory path if that // is present. FilePath GetCurrentExecutableName() { FilePath result; #if GTEST_OS_WINDOWS result.Set(FilePath(g_executable_path).RemoveExtension("exe")); #else result.Set(FilePath(g_executable_path)); #endif // GTEST_OS_WINDOWS return result.RemoveDirectoryName(); } // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. String UnitTestOptions::GetOutputFormat() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); return (colon == NULL) ? String(gtest_output_flag) : String(gtest_output_flag, colon - gtest_output_flag); } // Returns the name of the requested output file, or the default if none // was explicitly specified. String UnitTestOptions::GetAbsolutePathToOutputFile() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); if (colon == NULL) return String(internal::FilePath::ConcatPaths( internal::FilePath( UnitTest::GetInstance()->original_working_dir()), internal::FilePath(kDefaultOutputFile)).ToString() ); internal::FilePath output_name(colon + 1); if (!output_name.IsAbsolutePath()) // TODO(wan@google.com): on Windows \some\path is not an absolute // path (as its meaning depends on the current drive), yet the // following logic for turning it into an absolute path is wrong. // Fix it. output_name = internal::FilePath::ConcatPaths( internal::FilePath(UnitTest::GetInstance()->original_working_dir()), internal::FilePath(colon + 1)); if (!output_name.IsDirectory()) return output_name.ToString(); internal::FilePath result(internal::FilePath::GenerateUniqueFileName( output_name, internal::GetCurrentExecutableName(), GetOutputFormat().c_str())); return result.ToString(); } // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. bool UnitTestOptions::PatternMatchesString(const char *pattern, const char *str) { switch (*pattern) { case '\0': case ':': // Either ':' or '\0' marks the end of the pattern. return *str == '\0'; case '?': // Matches any single character. return *str != '\0' && PatternMatchesString(pattern + 1, str + 1); case '*': // Matches any string (possibly empty) of characters. return (*str != '\0' && PatternMatchesString(pattern, str + 1)) || PatternMatchesString(pattern + 1, str); default: // Non-special character. Matches itself. return *pattern == *str && PatternMatchesString(pattern + 1, str + 1); } } bool UnitTestOptions::MatchesFilter(const String& name, const char* filter) { const char *cur_pattern = filter; for (;;) { if (PatternMatchesString(cur_pattern, name.c_str())) { return true; } // Finds the next pattern in the filter. cur_pattern = strchr(cur_pattern, ':'); // Returns if no more pattern can be found. if (cur_pattern == NULL) { return false; } // Skips the pattern separater (the ':' character). cur_pattern++; } } // TODO(keithray): move String function implementations to gtest-string.cc. // Returns true iff the user-specified filter matches the test case // name and the test name. bool UnitTestOptions::FilterMatchesTest(const String &test_case_name, const String &test_name) { const String& full_name = String::Format("%s.%s", test_case_name.c_str(), test_name.c_str()); // Split --gtest_filter at '-', if there is one, to separate into // positive filter and negative filter portions const char* const p = GTEST_FLAG(filter).c_str(); const char* const dash = strchr(p, '-'); String positive; String negative; if (dash == NULL) { positive = GTEST_FLAG(filter).c_str(); // Whole string is a positive filter negative = String(""); } else { positive = String(p, dash - p); // Everything up to the dash negative = String(dash+1); // Everything after the dash if (positive.empty()) { // Treat '-test1' as the same as '*-test1' positive = kUniversalFilter; } } // A filter is a colon-separated list of patterns. It matches a // test if any pattern in it matches the test. return (MatchesFilter(full_name, positive.c_str()) && !MatchesFilter(full_name, negative.c_str())); } #if GTEST_HAS_SEH // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. int UnitTestOptions::GTestShouldProcessSEH(DWORD exception_code) { // Google Test should handle a SEH exception if: // 1. the user wants it to, AND // 2. this is not a breakpoint exception, AND // 3. this is not a C++ exception (VC++ implements them via SEH, // apparently). // // SEH exception code for C++ exceptions. // (see http://support.microsoft.com/kb/185294 for more information). const DWORD kCxxExceptionCode = 0xe06d7363; bool should_handle = true; if (!GTEST_FLAG(catch_exceptions)) should_handle = false; else if (exception_code == EXCEPTION_BREAKPOINT) should_handle = false; else if (exception_code == kCxxExceptionCode) should_handle = false; return should_handle ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH; } #endif // GTEST_HAS_SEH } // namespace internal // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. Intercepts only failures from the current thread. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( TestPartResultArray* result) : intercept_mode_(INTERCEPT_ONLY_CURRENT_THREAD), result_(result) { Init(); } // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( InterceptMode intercept_mode, TestPartResultArray* result) : intercept_mode_(intercept_mode), result_(result) { Init(); } void ScopedFakeTestPartResultReporter::Init() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { old_reporter_ = impl->GetGlobalTestPartResultReporter(); impl->SetGlobalTestPartResultReporter(this); } else { old_reporter_ = impl->GetTestPartResultReporterForCurrentThread(); impl->SetTestPartResultReporterForCurrentThread(this); } } // The d'tor restores the test part result reporter used by Google Test // before. ScopedFakeTestPartResultReporter::~ScopedFakeTestPartResultReporter() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { impl->SetGlobalTestPartResultReporter(old_reporter_); } else { impl->SetTestPartResultReporterForCurrentThread(old_reporter_); } } // Increments the test part result count and remembers the result. // This method is from the TestPartResultReporterInterface interface. void ScopedFakeTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { result_->Append(result); } namespace internal { // Returns the type ID of ::testing::Test. We should always call this // instead of GetTypeId< ::testing::Test>() to get the type ID of // testing::Test. This is to work around a suspected linker bug when // using Google Test as a framework on Mac OS X. The bug causes // GetTypeId< ::testing::Test>() to return different values depending // on whether the call is from the Google Test framework itself or // from user test code. GetTestTypeId() is guaranteed to always // return the same value, as it always calls GetTypeId<>() from the // gtest.cc, which is within the Google Test framework. TypeId GetTestTypeId() { return GetTypeId(); } // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). extern const TypeId kTestTypeIdInGoogleTest = GetTestTypeId(); // This predicate-formatter checks that 'results' contains a test part // failure of the given type and that the failure message contains the // given substring. AssertionResult HasOneFailure(const char* /* results_expr */, const char* /* type_expr */, const char* /* substr_expr */, const TestPartResultArray& results, TestPartResult::Type type, const string& substr) { const String expected(type == TestPartResult::kFatalFailure ? "1 fatal failure" : "1 non-fatal failure"); Message msg; if (results.size() != 1) { msg << "Expected: " << expected << "\n" << " Actual: " << results.size() << " failures"; for (int i = 0; i < results.size(); i++) { msg << "\n" << results.GetTestPartResult(i); } return AssertionFailure() << msg; } const TestPartResult& r = results.GetTestPartResult(0); if (r.type() != type) { return AssertionFailure() << "Expected: " << expected << "\n" << " Actual:\n" << r; } if (strstr(r.message(), substr.c_str()) == NULL) { return AssertionFailure() << "Expected: " << expected << " containing \"" << substr << "\"\n" << " Actual:\n" << r; } return AssertionSuccess(); } // The constructor of SingleFailureChecker remembers where to look up // test part results, what type of failure we expect, and what // substring the failure message should contain. SingleFailureChecker:: SingleFailureChecker( const TestPartResultArray* results, TestPartResult::Type type, const string& substr) : results_(results), type_(type), substr_(substr) {} // The destructor of SingleFailureChecker verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. SingleFailureChecker::~SingleFailureChecker() { EXPECT_PRED_FORMAT3(HasOneFailure, *results_, type_, substr_); } DefaultGlobalTestPartResultReporter::DefaultGlobalTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultGlobalTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->current_test_result()->AddTestPartResult(result); unit_test_->listeners()->repeater()->OnTestPartResult(result); } DefaultPerThreadTestPartResultReporter::DefaultPerThreadTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultPerThreadTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->GetGlobalTestPartResultReporter()->ReportTestPartResult(result); } // Returns the global test part result reporter. TestPartResultReporterInterface* UnitTestImpl::GetGlobalTestPartResultReporter() { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); return global_test_part_result_repoter_; } // Sets the global test part result reporter. void UnitTestImpl::SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter) { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); global_test_part_result_repoter_ = reporter; } // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* UnitTestImpl::GetTestPartResultReporterForCurrentThread() { return per_thread_test_part_result_reporter_.get(); } // Sets the test part result reporter for the current thread. void UnitTestImpl::SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter) { per_thread_test_part_result_reporter_.set(reporter); } // Gets the number of successful test cases. int UnitTestImpl::successful_test_case_count() const { return CountIf(test_cases_, TestCasePassed); } // Gets the number of failed test cases. int UnitTestImpl::failed_test_case_count() const { return CountIf(test_cases_, TestCaseFailed); } // Gets the number of all test cases. int UnitTestImpl::total_test_case_count() const { return static_cast(test_cases_.size()); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTestImpl::test_case_to_run_count() const { return CountIf(test_cases_, ShouldRunTestCase); } // Gets the number of successful tests. int UnitTestImpl::successful_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::successful_test_count); } // Gets the number of failed tests. int UnitTestImpl::failed_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::failed_test_count); } // Gets the number of disabled tests. int UnitTestImpl::disabled_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::disabled_test_count); } // Gets the number of all tests. int UnitTestImpl::total_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::total_test_count); } // Gets the number of tests that should run. int UnitTestImpl::test_to_run_count() const { return SumOverTestCaseList(test_cases_, &TestCase::test_to_run_count); } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String UnitTestImpl::CurrentOsStackTraceExceptTop(int skip_count) { (void)skip_count; return String(""); } // Returns the current time in milliseconds. TimeInMillis GetTimeInMillis() { #if GTEST_OS_WINDOWS_MOBILE || defined(__BORLANDC__) // Difference between 1970-01-01 and 1601-01-01 in milliseconds. // http://analogous.blogspot.com/2005/04/epoch.html const TimeInMillis kJavaEpochToWinFileTimeDelta = static_cast(116444736UL) * 100000UL; const DWORD kTenthMicrosInMilliSecond = 10000; SYSTEMTIME now_systime; FILETIME now_filetime; ULARGE_INTEGER now_int64; // TODO(kenton@google.com): Shouldn't this just use // GetSystemTimeAsFileTime()? GetSystemTime(&now_systime); if (SystemTimeToFileTime(&now_systime, &now_filetime)) { now_int64.LowPart = now_filetime.dwLowDateTime; now_int64.HighPart = now_filetime.dwHighDateTime; now_int64.QuadPart = (now_int64.QuadPart / kTenthMicrosInMilliSecond) - kJavaEpochToWinFileTimeDelta; return now_int64.QuadPart; } return 0; #elif GTEST_OS_WINDOWS && !GTEST_HAS_GETTIMEOFDAY_ __timeb64 now; # ifdef _MSC_VER // MSVC 8 deprecates _ftime64(), so we want to suppress warning 4996 // (deprecated function) there. // TODO(kenton@google.com): Use GetTickCount()? Or use // SystemTimeToFileTime() # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. _ftime64(&now); # pragma warning(pop) // Restores the warning state. # else _ftime64(&now); # endif // _MSC_VER return static_cast(now.time) * 1000 + now.millitm; #elif GTEST_HAS_GETTIMEOFDAY_ struct timeval now; gettimeofday(&now, NULL); return static_cast(now.tv_sec) * 1000 + now.tv_usec / 1000; #else # error "Don't know how to get the current time on your system." #endif } // Utilities // class String // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. String String::ShowCStringQuoted(const char* c_str) { return c_str ? String::Format("\"%s\"", c_str) : String("(null)"); } // Copies at most length characters from str into a newly-allocated // piece of memory of size length+1. The memory is allocated with new[]. // A terminating null byte is written to the memory, and a pointer to it // is returned. If str is NULL, NULL is returned. static char* CloneString(const char* str, size_t length) { if (str == NULL) { return NULL; } else { char* const clone = new char[length + 1]; posix::StrNCpy(clone, str, length); clone[length] = '\0'; return clone; } } // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting[] the return value. Returns the // cloned string, or NULL if the input is NULL. const char * String::CloneCString(const char* c_str) { return (c_str == NULL) ? NULL : CloneString(c_str, strlen(c_str)); } #if GTEST_OS_WINDOWS_MOBILE // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. LPCWSTR String::AnsiToUtf16(const char* ansi) { if (!ansi) return NULL; const int length = strlen(ansi); const int unicode_length = MultiByteToWideChar(CP_ACP, 0, ansi, length, NULL, 0); WCHAR* unicode = new WCHAR[unicode_length + 1]; MultiByteToWideChar(CP_ACP, 0, ansi, length, unicode, unicode_length); unicode[unicode_length] = 0; return unicode; } // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. const char* String::Utf16ToAnsi(LPCWSTR utf16_str) { if (!utf16_str) return NULL; const int ansi_length = WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, NULL, 0, NULL, NULL); char* ansi = new char[ansi_length + 1]; WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, ansi, ansi_length, NULL, NULL); ansi[ansi_length] = 0; return ansi; } #endif // GTEST_OS_WINDOWS_MOBILE // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::CStringEquals(const char * lhs, const char * rhs) { if ( lhs == NULL ) return rhs == NULL; if ( rhs == NULL ) return false; return strcmp(lhs, rhs) == 0; } #if GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING // Converts an array of wide chars to a narrow string using the UTF-8 // encoding, and streams the result to the given Message object. static void StreamWideCharsToMessage(const wchar_t* wstr, size_t length, Message* msg) { // TODO(wan): consider allowing a testing::String object to // contain '\0'. This will make it behave more like std::string, // and will allow ToUtf8String() to return the correct encoding // for '\0' s.t. we can get rid of the conditional here (and in // several other places). for (size_t i = 0; i != length; ) { // NOLINT if (wstr[i] != L'\0') { *msg << WideStringToUtf8(wstr + i, static_cast(length - i)); while (i != length && wstr[i] != L'\0') i++; } else { *msg << '\0'; i++; } } } #endif // GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING } // namespace internal #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::std::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_GLOBAL_WSTRING // AssertionResult constructors. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult::AssertionResult(const AssertionResult& other) : success_(other.success_), message_(other.message_.get() != NULL ? new ::std::string(*other.message_) : static_cast< ::std::string*>(NULL)) { } // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult AssertionResult::operator!() const { AssertionResult negation(!success_); if (message_.get() != NULL) negation << *message_; return negation; } // Makes a successful assertion result. AssertionResult AssertionSuccess() { return AssertionResult(true); } // Makes a failed assertion result. AssertionResult AssertionFailure() { return AssertionResult(false); } // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << message. AssertionResult AssertionFailure(const Message& message) { return AssertionFailure() << message; } namespace internal { // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case) { Message msg; msg << "Value of: " << actual_expression; if (actual_value != actual_expression) { msg << "\n Actual: " << actual_value; } msg << "\nExpected: " << expected_expression; if (ignoring_case) { msg << " (ignoring case)"; } if (expected_value != expected_expression) { msg << "\nWhich is: " << expected_value; } return AssertionFailure() << msg; } // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. String GetBoolAssertionFailureMessage(const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value) { const char* actual_message = assertion_result.message(); Message msg; msg << "Value of: " << expression_text << "\n Actual: " << actual_predicate_value; if (actual_message[0] != '\0') msg << " (" << actual_message << ")"; msg << "\nExpected: " << expected_predicate_value; return msg.GetString(); } // Helper function for implementing ASSERT_NEAR. AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error) { const double diff = fabs(val1 - val2); if (diff <= abs_error) return AssertionSuccess(); // TODO(wan): do not print the value of an expression if it's // already a literal. return AssertionFailure() << "The difference between " << expr1 << " and " << expr2 << " is " << diff << ", which exceeds " << abs_error_expr << ", where\n" << expr1 << " evaluates to " << val1 << ",\n" << expr2 << " evaluates to " << val2 << ", and\n" << abs_error_expr << " evaluates to " << abs_error << "."; } // Helper template for implementing FloatLE() and DoubleLE(). template AssertionResult FloatingPointLE(const char* expr1, const char* expr2, RawType val1, RawType val2) { // Returns success if val1 is less than val2, if (val1 < val2) { return AssertionSuccess(); } // or if val1 is almost equal to val2. const FloatingPoint lhs(val1), rhs(val2); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } // Note that the above two checks will both fail if either val1 or // val2 is NaN, as the IEEE floating-point standard requires that // any predicate involving a NaN must return false. ::std::stringstream val1_ss; val1_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val1; ::std::stringstream val2_ss; val2_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val2; return AssertionFailure() << "Expected: (" << expr1 << ") <= (" << expr2 << ")\n" << " Actual: " << StringStreamToString(&val1_ss) << " vs " << StringStreamToString(&val2_ss); } } // namespace internal // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } namespace internal { // The helper function for {ASSERT|EXPECT}_EQ with int or enum // arguments. AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { if (expected == actual) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_?? with integer or enum arguments. It is here // just to avoid copy-and-paste of similar code. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ BiggestInt val1, BiggestInt val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ } // Implements the helper function for {ASSERT|EXPECT}_NE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(NE, !=) // Implements the helper function for {ASSERT|EXPECT}_LE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LE, <=) // Implements the helper function for {ASSERT|EXPECT}_LT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LT, < ) // Implements the helper function for {ASSERT|EXPECT}_GE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GE, >=) // Implements the helper function for {ASSERT|EXPECT}_GT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GT, > ) #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), false); } // The helper function for {ASSERT|EXPECT}_STRCASEEQ. AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CaseInsensitiveCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), true); } // The helper function for {ASSERT|EXPECT}_STRNE. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } // The helper function for {ASSERT|EXPECT}_STRCASENE. AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CaseInsensitiveCStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << ") (ignoring case), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } } // namespace internal namespace { // Helper functions for implementing IsSubString() and IsNotSubstring(). // This group of overloaded functions return true iff needle is a // substring of haystack. NULL is considered a substring of itself // only. bool IsSubstringPred(const char* needle, const char* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return strstr(haystack, needle) != NULL; } bool IsSubstringPred(const wchar_t* needle, const wchar_t* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return wcsstr(haystack, needle) != NULL; } // StringType here can be either ::std::string or ::std::wstring. template bool IsSubstringPred(const StringType& needle, const StringType& haystack) { return haystack.find(needle) != StringType::npos; } // This function implements either IsSubstring() or IsNotSubstring(), // depending on the value of the expected_to_be_substring parameter. // StringType here can be const char*, const wchar_t*, ::std::string, // or ::std::wstring. template AssertionResult IsSubstringImpl( bool expected_to_be_substring, const char* needle_expr, const char* haystack_expr, const StringType& needle, const StringType& haystack) { if (IsSubstringPred(needle, haystack) == expected_to_be_substring) return AssertionSuccess(); const bool is_wide_string = sizeof(needle[0]) > 1; const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; return AssertionFailure() << "Value of: " << needle_expr << "\n" << " Actual: " << begin_string_quote << needle << "\"\n" << "Expected: " << (expected_to_be_substring ? "" : "not ") << "a substring of " << haystack_expr << "\n" << "Which is: " << begin_string_quote << haystack << "\""; } } // namespace // IsSubstring() and IsNotSubstring() check whether needle is a // substring of haystack (NULL is considered a substring of itself // only), and return an appropriate error message when they fail. AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #if GTEST_HAS_STD_WSTRING AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #endif // GTEST_HAS_STD_WSTRING namespace internal { #if GTEST_OS_WINDOWS namespace { // Helper function for IsHRESULT{SuccessFailure} predicates AssertionResult HRESULTFailureHelper(const char* expr, const char* expected, long hr) { // NOLINT # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't support FormatMessage. const char error_text[] = ""; # else // Looks up the human-readable system message for the HRESULT code // and since we're not passing any params to FormatMessage, we don't // want inserts expanded. const DWORD kFlags = FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS; const DWORD kBufSize = 4096; // String::Format can't exceed this length. // Gets the system's human readable message string for this HRESULT. char error_text[kBufSize] = { '\0' }; DWORD message_length = ::FormatMessageA(kFlags, 0, // no source, we're asking system hr, // the error 0, // no line width restrictions error_text, // output buffer kBufSize, // buf size NULL); // no arguments for inserts // Trims tailing white space (FormatMessage leaves a trailing cr-lf) for (; message_length && IsSpace(error_text[message_length - 1]); --message_length) { error_text[message_length - 1] = '\0'; } # endif // GTEST_OS_WINDOWS_MOBILE const String error_hex(String::Format("0x%08X ", hr)); return ::testing::AssertionFailure() << "Expected: " << expr << " " << expected << ".\n" << " Actual: " << error_hex << error_text << "\n"; } } // namespace AssertionResult IsHRESULTSuccess(const char* expr, long hr) { // NOLINT if (SUCCEEDED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "succeeds", hr); } AssertionResult IsHRESULTFailure(const char* expr, long hr) { // NOLINT if (FAILED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "fails", hr); } #endif // GTEST_OS_WINDOWS // Utility functions for encoding Unicode text (wide strings) in // UTF-8. // A Unicode code-point can have upto 21 bits, and is encoded in UTF-8 // like this: // // Code-point length Encoding // 0 - 7 bits 0xxxxxxx // 8 - 11 bits 110xxxxx 10xxxxxx // 12 - 16 bits 1110xxxx 10xxxxxx 10xxxxxx // 17 - 21 bits 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx // The maximum code-point a one-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint1 = (static_cast(1) << 7) - 1; // The maximum code-point a two-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint2 = (static_cast(1) << (5 + 6)) - 1; // The maximum code-point a three-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint3 = (static_cast(1) << (4 + 2*6)) - 1; // The maximum code-point a four-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint4 = (static_cast(1) << (3 + 3*6)) - 1; // Chops off the n lowest bits from a bit pattern. Returns the n // lowest bits. As a side effect, the original bit pattern will be // shifted to the right by n bits. inline UInt32 ChopLowBits(UInt32* bits, int n) { const UInt32 low_bits = *bits & ((static_cast(1) << n) - 1); *bits >>= n; return low_bits; } // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. char* CodePointToUtf8(UInt32 code_point, char* str) { if (code_point <= kMaxCodePoint1) { str[1] = '\0'; str[0] = static_cast(code_point); // 0xxxxxxx } else if (code_point <= kMaxCodePoint2) { str[2] = '\0'; str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xC0 | code_point); // 110xxxxx } else if (code_point <= kMaxCodePoint3) { str[3] = '\0'; str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xE0 | code_point); // 1110xxxx } else if (code_point <= kMaxCodePoint4) { str[4] = '\0'; str[3] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xF0 | code_point); // 11110xxx } else { // The longest string String::Format can produce when invoked // with these parameters is 28 character long (not including // the terminating nul character). We are asking for 32 character // buffer just in case. This is also enough for strncpy to // null-terminate the destination string. posix::StrNCpy( str, String::Format("(Invalid Unicode 0x%X)", code_point).c_str(), 32); str[31] = '\0'; // Makes sure no change in the format to strncpy leaves // the result unterminated. } return str; } // The following two functions only make sense if the the system // uses UTF-16 for wide string encoding. All supported systems // with 16 bit wchar_t (Windows, Cygwin, Symbian OS) do use UTF-16. // Determines if the arguments constitute UTF-16 surrogate pair // and thus should be combined into a single Unicode code point // using CreateCodePointFromUtf16SurrogatePair. inline bool IsUtf16SurrogatePair(wchar_t first, wchar_t second) { return sizeof(wchar_t) == 2 && (first & 0xFC00) == 0xD800 && (second & 0xFC00) == 0xDC00; } // Creates a Unicode code point from UTF16 surrogate pair. inline UInt32 CreateCodePointFromUtf16SurrogatePair(wchar_t first, wchar_t second) { const UInt32 mask = (1 << 10) - 1; return (sizeof(wchar_t) == 2) ? (((first & mask) << 10) | (second & mask)) + 0x10000 : // This function should not be called when the condition is // false, but we provide a sensible default in case it is. static_cast(first); } // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. String WideStringToUtf8(const wchar_t* str, int num_chars) { if (num_chars == -1) num_chars = static_cast(wcslen(str)); ::std::stringstream stream; for (int i = 0; i < num_chars; ++i) { UInt32 unicode_code_point; if (str[i] == L'\0') { break; } else if (i + 1 < num_chars && IsUtf16SurrogatePair(str[i], str[i + 1])) { unicode_code_point = CreateCodePointFromUtf16SurrogatePair(str[i], str[i + 1]); i++; } else { unicode_code_point = static_cast(str[i]); } char buffer[32]; // CodePointToUtf8 requires a buffer this big. stream << CodePointToUtf8(unicode_code_point, buffer); } return StringStreamToString(&stream); } // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". String String::ShowWideCString(const wchar_t * wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String(internal::WideStringToUtf8(wide_c_str, -1).c_str()); } // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. String String::ShowWideCStringQuoted(const wchar_t* wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String::Format("L\"%s\"", String::ShowWideCString(wide_c_str).c_str()); } // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::WideCStringEquals(const wchar_t * lhs, const wchar_t * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return wcscmp(lhs, rhs) == 0; } // Helper function for *_STREQ on wide strings. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual) { if (String::WideCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowWideCStringQuoted(expected), String::ShowWideCStringQuoted(actual), false); } // Helper function for *_STRNE on wide strings. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2) { if (!String::WideCStringEquals(s1, s2)) { return AssertionSuccess(); } return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: " << String::ShowWideCStringQuoted(s1) << " vs " << String::ShowWideCStringQuoted(s2); } // Compares two C strings, ignoring case. Returns true iff they have // the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. bool String::CaseInsensitiveCStringEquals(const char * lhs, const char * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return posix::StrCaseCmp(lhs, rhs) == 0; } // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. bool String::CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; #if GTEST_OS_WINDOWS return _wcsicmp(lhs, rhs) == 0; #elif GTEST_OS_LINUX && !GTEST_OS_LINUX_ANDROID return wcscasecmp(lhs, rhs) == 0; #else // Android, Mac OS X and Cygwin don't define wcscasecmp. // Other unknown OSes may not define it either. wint_t left, right; do { left = towlower(*lhs++); right = towlower(*rhs++); } while (left && left == right); return left == right; #endif // OS selector } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int String::Compare(const String & rhs) const { const char* const lhs_c_str = c_str(); const char* const rhs_c_str = rhs.c_str(); if (lhs_c_str == NULL) { return rhs_c_str == NULL ? 0 : -1; // NULL < anything except NULL } else if (rhs_c_str == NULL) { return 1; } const size_t shorter_str_len = length() <= rhs.length() ? length() : rhs.length(); for (size_t i = 0; i != shorter_str_len; i++) { if (lhs_c_str[i] < rhs_c_str[i]) { return -1; } else if (lhs_c_str[i] > rhs_c_str[i]) { return 1; } } return (length() < rhs.length()) ? -1 : (length() > rhs.length()) ? 1 : 0; } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool String::EndsWith(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CStringEquals(c_str() + this_len - suffix_len, suffix); } // Returns true iff this String ends with the given suffix, ignoring case. // Any String is considered to end with a NULL or empty suffix. bool String::EndsWithCaseInsensitive(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CaseInsensitiveCStringEquals(c_str() + this_len - suffix_len, suffix); } // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing 0). // If 4096 characters are not enough to format the input, or if // there's an error, "" is // returned. String String::Format(const char * format, ...) { va_list args; va_start(args, format); char buffer[4096]; const int kBufferSize = sizeof(buffer)/sizeof(buffer[0]); // MSVC 8 deprecates vsnprintf(), so we want to suppress warning // 4996 (deprecated function) there. #ifdef _MSC_VER // We are using MSVC. # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. const int size = vsnprintf(buffer, kBufferSize, format, args); # pragma warning(pop) // Restores the warning state. #else // We are not using MSVC. const int size = vsnprintf(buffer, kBufferSize, format, args); #endif // _MSC_VER va_end(args); // vsnprintf()'s behavior is not portable. When the buffer is not // big enough, it returns a negative value in MSVC, and returns the // needed buffer size on Linux. When there is an output error, it // always returns a negative value. For simplicity, we lump the two // error cases together. if (size < 0 || size >= kBufferSize) { return String(""); } else { return String(buffer, size); } } // Converts the buffer in a stringstream to a String, converting NUL // bytes to "\\0" along the way. String StringStreamToString(::std::stringstream* ss) { const ::std::string& str = ss->str(); const char* const start = str.c_str(); const char* const end = start + str.length(); // We need to use a helper stringstream to do this transformation // because String doesn't support push_back(). ::std::stringstream helper; for (const char* ch = start; ch != end; ++ch) { if (*ch == '\0') { helper << "\\0"; // Replaces NUL with "\\0"; } else { helper.put(*ch); } } return String(helper.str().c_str()); } // Appends the user-supplied message to the Google-Test-generated message. String AppendUserMessage(const String& gtest_msg, const Message& user_msg) { // Appends the user message if it's non-empty. const String user_msg_string = user_msg.GetString(); if (user_msg_string.empty()) { return gtest_msg; } Message msg; msg << gtest_msg << "\n" << user_msg_string; return msg.GetString(); } } // namespace internal // class TestResult // Creates an empty TestResult. TestResult::TestResult() : death_test_count_(0), elapsed_time_(0) { } // D'tor. TestResult::~TestResult() { } // Returns the i-th test part result among all the results. i can // range from 0 to total_part_count() - 1. If i is not in that range, // aborts the program. const TestPartResult& TestResult::GetTestPartResult(int i) const { if (i < 0 || i >= total_part_count()) internal::posix::Abort(); return test_part_results_.at(i); } // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& TestResult::GetTestProperty(int i) const { if (i < 0 || i >= test_property_count()) internal::posix::Abort(); return test_properties_.at(i); } // Clears the test part results. void TestResult::ClearTestPartResults() { test_part_results_.clear(); } // Adds a test part result to the list. void TestResult::AddTestPartResult(const TestPartResult& test_part_result) { test_part_results_.push_back(test_part_result); } // Adds a test property to the list. If a property with the same key as the // supplied property is already represented, the value of this test_property // replaces the old value for that key. void TestResult::RecordProperty(const TestProperty& test_property) { if (!ValidateTestProperty(test_property)) { return; } internal::MutexLock lock(&test_properites_mutex_); const std::vector::iterator property_with_matching_key = std::find_if(test_properties_.begin(), test_properties_.end(), internal::TestPropertyKeyIs(test_property.key())); if (property_with_matching_key == test_properties_.end()) { test_properties_.push_back(test_property); return; } property_with_matching_key->SetValue(test_property.value()); } // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. bool TestResult::ValidateTestProperty(const TestProperty& test_property) { internal::String key(test_property.key()); if (key == "name" || key == "status" || key == "time" || key == "classname") { ADD_FAILURE() << "Reserved key used in RecordProperty(): " << key << " ('name', 'status', 'time', and 'classname' are reserved by " << GTEST_NAME_ << ")"; return false; } return true; } // Clears the object. void TestResult::Clear() { test_part_results_.clear(); test_properties_.clear(); death_test_count_ = 0; elapsed_time_ = 0; } // Returns true iff the test failed. bool TestResult::Failed() const { for (int i = 0; i < total_part_count(); ++i) { if (GetTestPartResult(i).failed()) return true; } return false; } // Returns true iff the test part fatally failed. static bool TestPartFatallyFailed(const TestPartResult& result) { return result.fatally_failed(); } // Returns true iff the test fatally failed. bool TestResult::HasFatalFailure() const { return CountIf(test_part_results_, TestPartFatallyFailed) > 0; } // Returns true iff the test part non-fatally failed. static bool TestPartNonfatallyFailed(const TestPartResult& result) { return result.nonfatally_failed(); } // Returns true iff the test has a non-fatal failure. bool TestResult::HasNonfatalFailure() const { return CountIf(test_part_results_, TestPartNonfatallyFailed) > 0; } // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int TestResult::total_part_count() const { return static_cast(test_part_results_.size()); } // Returns the number of the test properties. int TestResult::test_property_count() const { return static_cast(test_properties_.size()); } // class Test // Creates a Test object. // The c'tor saves the values of all Google Test flags. Test::Test() : gtest_flag_saver_(new internal::GTestFlagSaver) { } // The d'tor restores the values of all Google Test flags. Test::~Test() { delete gtest_flag_saver_; } // Sets up the test fixture. // // A sub-class may override this. void Test::SetUp() { } // Tears down the test fixture. // // A sub-class may override this. void Test::TearDown() { } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, const char* value) { UnitTest::GetInstance()->RecordPropertyForCurrentTest(key, value); } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, int value) { Message value_message; value_message << value; RecordProperty(key, value_message.GetString().c_str()); } namespace internal { void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message) { // This function is a friend of UnitTest and as such has access to // AddTestPartResult. UnitTest::GetInstance()->AddTestPartResult( result_type, NULL, // No info about the source file where the exception occurred. -1, // We have no info on which line caused the exception. message, String()); // No stack trace, either. } } // namespace internal // Google Test requires all tests in the same test case to use the same test // fixture class. This function checks if the current test has the // same fixture class as the first test in the current test case. If // yes, it returns true; otherwise it generates a Google Test failure and // returns false. bool Test::HasSameFixtureClass() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); const TestCase* const test_case = impl->current_test_case(); // Info about the first test in the current test case. const TestInfo* const first_test_info = test_case->test_info_list()[0]; const internal::TypeId first_fixture_id = first_test_info->fixture_class_id_; const char* const first_test_name = first_test_info->name(); // Info about the current test. const TestInfo* const this_test_info = impl->current_test_info(); const internal::TypeId this_fixture_id = this_test_info->fixture_class_id_; const char* const this_test_name = this_test_info->name(); if (this_fixture_id != first_fixture_id) { // Is the first test defined using TEST? const bool first_is_TEST = first_fixture_id == internal::GetTestTypeId(); // Is this test defined using TEST? const bool this_is_TEST = this_fixture_id == internal::GetTestTypeId(); if (first_is_TEST || this_is_TEST) { // The user mixed TEST and TEST_F in this test case - we'll tell // him/her how to fix it. // Gets the name of the TEST and the name of the TEST_F. Note // that first_is_TEST and this_is_TEST cannot both be true, as // the fixture IDs are different for the two tests. const char* const TEST_name = first_is_TEST ? first_test_name : this_test_name; const char* const TEST_F_name = first_is_TEST ? this_test_name : first_test_name; ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class, so mixing TEST_F and TEST in the same test case is\n" << "illegal. In test case " << this_test_info->test_case_name() << ",\n" << "test " << TEST_F_name << " is defined using TEST_F but\n" << "test " << TEST_name << " is defined using TEST. You probably\n" << "want to change the TEST to TEST_F or move it to another test\n" << "case."; } else { // The user defined two fixture classes with the same name in // two namespaces - we'll tell him/her how to fix it. ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << this_test_info->test_case_name() << ",\n" << "you defined test " << first_test_name << " and test " << this_test_name << "\n" << "using two different test fixture classes. This can happen if\n" << "the two classes are from different namespaces or translation\n" << "units and have the same name. You should probably rename one\n" << "of the classes to put the tests into different test cases."; } return false; } return true; } #if GTEST_HAS_SEH // Adds an "exception thrown" fatal failure to the current test. This // function returns its result via an output parameter pointer because VC++ // prohibits creation of objects with destructors on stack in functions // using __try (see error C2712). static internal::String* FormatSehExceptionMessage(DWORD exception_code, const char* location) { Message message; message << "SEH exception with code 0x" << std::setbase(16) << exception_code << std::setbase(10) << " thrown in " << location << "."; return new internal::String(message.GetString()); } #endif // GTEST_HAS_SEH #if GTEST_HAS_EXCEPTIONS // Adds an "exception thrown" fatal failure to the current test. static internal::String FormatCxxExceptionMessage(const char* description, const char* location) { Message message; if (description != NULL) { message << "C++ exception with description \"" << description << "\""; } else { message << "Unknown C++ exception"; } message << " thrown in " << location << "."; return message.GetString(); } static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result); // A failed Google Test assertion will throw an exception of this type when // GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We // derive it from std::runtime_error, which is for errors presumably // detectable only at run time. Since std::runtime_error inherits from // std::exception, many testing frameworks know how to extract and print the // message inside it. class GoogleTestFailureException : public ::std::runtime_error { public: explicit GoogleTestFailureException(const TestPartResult& failure) : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {} }; #endif // GTEST_HAS_EXCEPTIONS namespace internal { // We put these helper functions in the internal namespace as IBM's xlC // compiler rejects the code if they were declared static. // Runs the given method and handles SEH exceptions it throws, when // SEH is supported; returns the 0-value for type Result in case of an // SEH exception. (Microsoft compilers cannot handle SEH and C++ // exceptions in the same function. Therefore, we provide a separate // wrapper function for handling SEH exceptions.) template Result HandleSehExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { #if GTEST_HAS_SEH __try { return (object->*method)(); } __except (internal::UnitTestOptions::GTestShouldProcessSEH( // NOLINT GetExceptionCode())) { // We create the exception message on the heap because VC++ prohibits // creation of objects with destructors on stack in functions using __try // (see error C2712). internal::String* exception_message = FormatSehExceptionMessage( GetExceptionCode(), location); internal::ReportFailureInUnknownLocation(TestPartResult::kFatalFailure, *exception_message); delete exception_message; return static_cast(0); } #else (void)location; return (object->*method)(); #endif // GTEST_HAS_SEH } // Runs the given method and catches and reports C++ and/or SEH-style // exceptions, if they are supported; returns the 0-value for type // Result in case of an SEH exception. template Result HandleExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { // NOTE: The user code can affect the way in which Google Test handles // exceptions by setting GTEST_FLAG(catch_exceptions), but only before // RUN_ALL_TESTS() starts. It is technically possible to check the flag // after the exception is caught and either report or re-throw the // exception based on the flag's value: // // try { // // Perform the test method. // } catch (...) { // if (GTEST_FLAG(catch_exceptions)) // // Report the exception as failure. // else // throw; // Re-throws the original exception. // } // // However, the purpose of this flag is to allow the program to drop into // the debugger when the exception is thrown. On most platforms, once the // control enters the catch block, the exception origin information is // lost and the debugger will stop the program at the point of the // re-throw in this function -- instead of at the point of the original // throw statement in the code under test. For this reason, we perform // the check early, sacrificing the ability to affect Google Test's // exception handling in the method where the exception is thrown. if (internal::GetUnitTestImpl()->catch_exceptions()) { #if GTEST_HAS_EXCEPTIONS try { return HandleSehExceptionsInMethodIfSupported(object, method, location); } catch (const GoogleTestFailureException&) { // NOLINT // This exception doesn't originate in code under test. It makes no // sense to report it as a test failure. throw; } catch (const std::exception& e) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(e.what(), location)); } catch (...) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(NULL, location)); } return static_cast(0); #else return HandleSehExceptionsInMethodIfSupported(object, method, location); #endif // GTEST_HAS_EXCEPTIONS } else { return (object->*method)(); } } } // namespace internal // Runs the test and updates the test result. void Test::Run() { if (!HasSameFixtureClass()) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported(this, &Test::SetUp, "SetUp()"); // We will run the test only if SetUp() was successful. if (!HasFatalFailure()) { impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TestBody, "the test body"); } // However, we want to clean up as much as possible. Hence we will // always call TearDown(), even if SetUp() or the test body has // failed. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TearDown, "TearDown()"); } // Returns true iff the current test has a fatal failure. bool Test::HasFatalFailure() { return internal::GetUnitTestImpl()->current_test_result()->HasFatalFailure(); } // Returns true iff the current test has a non-fatal failure. bool Test::HasNonfatalFailure() { return internal::GetUnitTestImpl()->current_test_result()-> HasNonfatalFailure(); } // class TestInfo // Constructs a TestInfo object. It assumes ownership of the test factory // object. // TODO(vladl@google.com): Make a_test_case_name and a_name const string&'s // to signify they cannot be NULLs. TestInfo::TestInfo(const char* a_test_case_name, const char* a_name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory) : test_case_name_(a_test_case_name), name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), value_param_(a_value_param ? new std::string(a_value_param) : NULL), fixture_class_id_(fixture_class_id), should_run_(false), is_disabled_(false), matches_filter_(false), factory_(factory), result_() {} // Destructs a TestInfo object. TestInfo::~TestInfo() { delete factory_; } namespace internal { // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param: text representation of the test's value parameter, // or NULL if this is not a value-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory) { TestInfo* const test_info = new TestInfo(test_case_name, name, type_param, value_param, fixture_class_id, factory); GetUnitTestImpl()->AddTestInfo(set_up_tc, tear_down_tc, test_info); return test_info; } #if GTEST_HAS_PARAM_TEST void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line) { Message errors; errors << "Attempted redefinition of test case " << test_case_name << ".\n" << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << test_case_name << ", you tried\n" << "to define a test using a fixture class different from the one\n" << "used earlier. This can happen if the two fixture classes are\n" << "from different namespaces and have the same name. You should\n" << "probably rename one of the classes to put the tests into different\n" << "test cases."; fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors.GetString().c_str()); } #endif // GTEST_HAS_PARAM_TEST } // namespace internal namespace { // A predicate that checks the test name of a TestInfo against a known // value. // // This is used for implementation of the TestCase class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestNameIs is copyable. class TestNameIs { public: // Constructor. // // TestNameIs has NO default constructor. explicit TestNameIs(const char* name) : name_(name) {} // Returns true iff the test name of test_info matches name_. bool operator()(const TestInfo * test_info) const { return test_info && internal::String(test_info->name()).Compare(name_) == 0; } private: internal::String name_; }; } // namespace namespace internal { // This method expands all parameterized tests registered with macros TEST_P // and INSTANTIATE_TEST_CASE_P into regular tests and registers those. // This will be done just once during the program runtime. void UnitTestImpl::RegisterParameterizedTests() { #if GTEST_HAS_PARAM_TEST if (!parameterized_tests_registered_) { parameterized_test_registry_.RegisterTests(); parameterized_tests_registered_ = true; } #endif } } // namespace internal // Creates the test object, runs it, records its result, and then // deletes it. void TestInfo::Run() { if (!should_run_) return; // Tells UnitTest where to store test result. internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_info(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); // Notifies the unit test event listeners that a test is about to start. repeater->OnTestStart(*this); const TimeInMillis start = internal::GetTimeInMillis(); impl->os_stack_trace_getter()->UponLeavingGTest(); // Creates the test object. Test* const test = internal::HandleExceptionsInMethodIfSupported( factory_, &internal::TestFactoryBase::CreateTest, "the test fixture's constructor"); // Runs the test only if the test object was created and its // constructor didn't generate a fatal failure. if ((test != NULL) && !Test::HasFatalFailure()) { // This doesn't throw as all user code that can throw are wrapped into // exception handling code. test->Run(); } // Deletes the test object. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( test, &Test::DeleteSelf_, "the test fixture's destructor"); result_.set_elapsed_time(internal::GetTimeInMillis() - start); // Notifies the unit test event listener that a test has just finished. repeater->OnTestEnd(*this); // Tells UnitTest to stop associating assertion results to this // test. impl->set_current_test_info(NULL); } // class TestCase // Gets the number of successful tests in this test case. int TestCase::successful_test_count() const { return CountIf(test_info_list_, TestPassed); } // Gets the number of failed tests in this test case. int TestCase::failed_test_count() const { return CountIf(test_info_list_, TestFailed); } int TestCase::disabled_test_count() const { return CountIf(test_info_list_, TestDisabled); } // Get the number of tests in this test case that should run. int TestCase::test_to_run_count() const { return CountIf(test_info_list_, ShouldRunTest); } // Gets the number of all tests. int TestCase::total_test_count() const { return static_cast(test_info_list_.size()); } // Creates a TestCase with the given name. // // Arguments: // // name: name of the test case // a_type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase::TestCase(const char* a_name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) : name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), set_up_tc_(set_up_tc), tear_down_tc_(tear_down_tc), should_run_(false), elapsed_time_(0) { } // Destructor of TestCase. TestCase::~TestCase() { // Deletes every Test in the collection. ForEach(test_info_list_, internal::Delete); } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* TestCase::GetTestInfo(int i) const { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* TestCase::GetMutableTestInfo(int i) { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Adds a test to this test case. Will delete the test upon // destruction of the TestCase object. void TestCase::AddTestInfo(TestInfo * test_info) { test_info_list_.push_back(test_info); test_indices_.push_back(static_cast(test_indices_.size())); } // Runs every test in this TestCase. void TestCase::Run() { if (!should_run_) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_case(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); repeater->OnTestCaseStart(*this); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunSetUpTestCase, "SetUpTestCase()"); const internal::TimeInMillis start = internal::GetTimeInMillis(); for (int i = 0; i < total_test_count(); i++) { GetMutableTestInfo(i)->Run(); } elapsed_time_ = internal::GetTimeInMillis() - start; impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunTearDownTestCase, "TearDownTestCase()"); repeater->OnTestCaseEnd(*this); impl->set_current_test_case(NULL); } // Clears the results of all tests in this test case. void TestCase::ClearResult() { ForEach(test_info_list_, TestInfo::ClearTestResult); } // Shuffles the tests in this test case. void TestCase::ShuffleTests(internal::Random* random) { Shuffle(random, &test_indices_); } // Restores the test order to before the first shuffle. void TestCase::UnshuffleTests() { for (size_t i = 0; i < test_indices_.size(); i++) { test_indices_[i] = static_cast(i); } } // Formats a countable noun. Depending on its quantity, either the // singular form or the plural form is used. e.g. // // FormatCountableNoun(1, "formula", "formuli") returns "1 formula". // FormatCountableNoun(5, "book", "books") returns "5 books". static internal::String FormatCountableNoun(int count, const char * singular_form, const char * plural_form) { return internal::String::Format("%d %s", count, count == 1 ? singular_form : plural_form); } // Formats the count of tests. static internal::String FormatTestCount(int test_count) { return FormatCountableNoun(test_count, "test", "tests"); } // Formats the count of test cases. static internal::String FormatTestCaseCount(int test_case_count) { return FormatCountableNoun(test_case_count, "test case", "test cases"); } // Converts a TestPartResult::Type enum to human-friendly string // representation. Both kNonFatalFailure and kFatalFailure are translated // to "Failure", as the user usually doesn't care about the difference // between the two when viewing the test result. static const char * TestPartResultTypeToString(TestPartResult::Type type) { switch (type) { case TestPartResult::kSuccess: return "Success"; case TestPartResult::kNonFatalFailure: case TestPartResult::kFatalFailure: #ifdef _MSC_VER return "error: "; #else return "Failure\n"; #endif default: return "Unknown result type"; } } // Prints a TestPartResult to a String. static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result) { return (Message() << internal::FormatFileLocation(test_part_result.file_name(), test_part_result.line_number()) << " " << TestPartResultTypeToString(test_part_result.type()) << test_part_result.message()).GetString(); } // Prints a TestPartResult. static void PrintTestPartResult(const TestPartResult& test_part_result) { const internal::String& result = PrintTestPartResultToString(test_part_result); printf("%s\n", result.c_str()); fflush(stdout); // If the test program runs in Visual Studio or a debugger, the // following statements add the test part result message to the Output // window such that the user can double-click on it to jump to the // corresponding source code location; otherwise they do nothing. #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // We don't call OutputDebugString*() on Windows Mobile, as printing // to stdout is done by OutputDebugString() there already - we don't // want the same message printed twice. ::OutputDebugStringA(result.c_str()); ::OutputDebugStringA("\n"); #endif } // class PrettyUnitTestResultPrinter namespace internal { enum GTestColor { COLOR_DEFAULT, COLOR_RED, COLOR_GREEN, COLOR_YELLOW }; #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns the character attribute for the given color. WORD GetColorAttribute(GTestColor color) { switch (color) { case COLOR_RED: return FOREGROUND_RED; case COLOR_GREEN: return FOREGROUND_GREEN; case COLOR_YELLOW: return FOREGROUND_RED | FOREGROUND_GREEN; default: return 0; } } #else // Returns the ANSI color code for the given color. COLOR_DEFAULT is // an invalid input. const char* GetAnsiColorCode(GTestColor color) { switch (color) { case COLOR_RED: return "1"; case COLOR_GREEN: return "2"; case COLOR_YELLOW: return "3"; default: return NULL; }; } #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns true iff Google Test should use colors in the output. bool ShouldUseColor(bool stdout_is_tty) { const char* const gtest_color = GTEST_FLAG(color).c_str(); if (String::CaseInsensitiveCStringEquals(gtest_color, "auto")) { #if GTEST_OS_WINDOWS // On Windows the TERM variable is usually not set, but the // console there does support colors. return stdout_is_tty; #else // On non-Windows platforms, we rely on the TERM variable. const char* const term = posix::GetEnv("TERM"); const bool term_supports_color = String::CStringEquals(term, "xterm") || String::CStringEquals(term, "xterm-color") || String::CStringEquals(term, "xterm-256color") || String::CStringEquals(term, "screen") || String::CStringEquals(term, "linux") || String::CStringEquals(term, "cygwin"); return stdout_is_tty && term_supports_color; #endif // GTEST_OS_WINDOWS } return String::CaseInsensitiveCStringEquals(gtest_color, "yes") || String::CaseInsensitiveCStringEquals(gtest_color, "true") || String::CaseInsensitiveCStringEquals(gtest_color, "t") || String::CStringEquals(gtest_color, "1"); // We take "yes", "true", "t", and "1" as meaning "yes". If the // value is neither one of these nor "auto", we treat it as "no" to // be conservative. } // Helpers for printing colored strings to stdout. Note that on Windows, we // cannot simply emit special characters and have the terminal change colors. // This routine must actually emit the characters rather than return a string // that would be colored when printed, as can be done on Linux. void ColoredPrintf(GTestColor color, const char* fmt, ...) { va_list args; va_start(args, fmt); #if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS const bool use_color = false; #else static const bool in_color_mode = ShouldUseColor(posix::IsATTY(posix::FileNo(stdout)) != 0); const bool use_color = in_color_mode && (color != COLOR_DEFAULT); #endif // GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS // The '!= 0' comparison is necessary to satisfy MSVC 7.1. if (!use_color) { vprintf(fmt, args); va_end(args); return; } #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE); // Gets the current text color. CONSOLE_SCREEN_BUFFER_INFO buffer_info; GetConsoleScreenBufferInfo(stdout_handle, &buffer_info); const WORD old_color_attrs = buffer_info.wAttributes; // We need to flush the stream buffers into the console before each // SetConsoleTextAttribute call lest it affect the text that is already // printed but has not yet reached the console. fflush(stdout); SetConsoleTextAttribute(stdout_handle, GetColorAttribute(color) | FOREGROUND_INTENSITY); vprintf(fmt, args); fflush(stdout); // Restores the text color. SetConsoleTextAttribute(stdout_handle, old_color_attrs); #else printf("\033[0;3%sm", GetAnsiColorCode(color)); vprintf(fmt, args); printf("\033[m"); // Resets the terminal to default. #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE va_end(args); } void PrintFullTestCommentIfPresent(const TestInfo& test_info) { const char* const type_param = test_info.type_param(); const char* const value_param = test_info.value_param(); if (type_param != NULL || value_param != NULL) { printf(", where "); if (type_param != NULL) { printf("TypeParam = %s", type_param); if (value_param != NULL) printf(" and "); } if (value_param != NULL) { printf("GetParam() = %s", value_param); } } } // This class implements the TestEventListener interface. // // Class PrettyUnitTestResultPrinter is copyable. class PrettyUnitTestResultPrinter : public TestEventListener { public: PrettyUnitTestResultPrinter() {} static void PrintTestName(const char * test_case, const char * test) { printf("%s.%s", test_case, test); } // The following methods override what's in the TestEventListener class. virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} private: static void PrintFailedTests(const UnitTest& unit_test); internal::String test_case_name_; }; // Fired before each iteration of tests starts. void PrettyUnitTestResultPrinter::OnTestIterationStart( const UnitTest& unit_test, int iteration) { if (GTEST_FLAG(repeat) != 1) printf("\nRepeating all tests (iteration %d) . . .\n\n", iteration + 1); const char* const filter = GTEST_FLAG(filter).c_str(); // Prints the filter if it's not *. This reminds the user that some // tests may be skipped. if (!internal::String::CStringEquals(filter, kUniversalFilter)) { ColoredPrintf(COLOR_YELLOW, "Note: %s filter = %s\n", GTEST_NAME_, filter); } if (internal::ShouldShard(kTestTotalShards, kTestShardIndex, false)) { const Int32 shard_index = Int32FromEnvOrDie(kTestShardIndex, -1); ColoredPrintf(COLOR_YELLOW, "Note: This is test shard %d of %s.\n", static_cast(shard_index) + 1, internal::posix::GetEnv(kTestTotalShards)); } if (GTEST_FLAG(shuffle)) { ColoredPrintf(COLOR_YELLOW, "Note: Randomizing tests' orders with a seed of %d .\n", unit_test.random_seed()); } ColoredPrintf(COLOR_GREEN, "[==========] "); printf("Running %s from %s.\n", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsSetUpStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment set-up.\n"); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseStart(const TestCase& test_case) { test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s", counts.c_str(), test_case_name_.c_str()); if (test_case.type_param() == NULL) { printf("\n"); } else { printf(", where TypeParam = %s\n", test_case.type_param()); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestStart(const TestInfo& test_info) { ColoredPrintf(COLOR_GREEN, "[ RUN ] "); PrintTestName(test_case_name_.c_str(), test_info.name()); printf("\n"); fflush(stdout); } // Called after an assertion failure. void PrettyUnitTestResultPrinter::OnTestPartResult( const TestPartResult& result) { // If the test part succeeded, we don't need to do anything. if (result.type() == TestPartResult::kSuccess) return; // Print failure message from the assertion (e.g. expected this and got that). PrintTestPartResult(result); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestEnd(const TestInfo& test_info) { if (test_info.result()->Passed()) { ColoredPrintf(COLOR_GREEN, "[ OK ] "); } else { ColoredPrintf(COLOR_RED, "[ FAILED ] "); } PrintTestName(test_case_name_.c_str(), test_info.name()); if (test_info.result()->Failed()) PrintFullTestCommentIfPresent(test_info); if (GTEST_FLAG(print_time)) { printf(" (%s ms)\n", internal::StreamableToString( test_info.result()->elapsed_time()).c_str()); } else { printf("\n"); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseEnd(const TestCase& test_case) { if (!GTEST_FLAG(print_time)) return; test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s (%s ms total)\n\n", counts.c_str(), test_case_name_.c_str(), internal::StreamableToString(test_case.elapsed_time()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsTearDownStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment tear-down\n"); fflush(stdout); } // Internal helper for printing the list of failed tests. void PrettyUnitTestResultPrinter::PrintFailedTests(const UnitTest& unit_test) { const int failed_test_count = unit_test.failed_test_count(); if (failed_test_count == 0) { return; } for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase& test_case = *unit_test.GetTestCase(i); if (!test_case.should_run() || (test_case.failed_test_count() == 0)) { continue; } for (int j = 0; j < test_case.total_test_count(); ++j) { const TestInfo& test_info = *test_case.GetTestInfo(j); if (!test_info.should_run() || test_info.result()->Passed()) { continue; } ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s.%s", test_case.name(), test_info.name()); PrintFullTestCommentIfPresent(test_info); printf("\n"); } } } void PrettyUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { ColoredPrintf(COLOR_GREEN, "[==========] "); printf("%s from %s ran.", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); if (GTEST_FLAG(print_time)) { printf(" (%s ms total)", internal::StreamableToString(unit_test.elapsed_time()).c_str()); } printf("\n"); ColoredPrintf(COLOR_GREEN, "[ PASSED ] "); printf("%s.\n", FormatTestCount(unit_test.successful_test_count()).c_str()); int num_failures = unit_test.failed_test_count(); if (!unit_test.Passed()) { const int failed_test_count = unit_test.failed_test_count(); ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s, listed below:\n", FormatTestCount(failed_test_count).c_str()); PrintFailedTests(unit_test); printf("\n%2d FAILED %s\n", num_failures, num_failures == 1 ? "TEST" : "TESTS"); } int num_disabled = unit_test.disabled_test_count(); if (num_disabled && !GTEST_FLAG(also_run_disabled_tests)) { if (!num_failures) { printf("\n"); // Add a spacer if no FAILURE banner is displayed. } ColoredPrintf(COLOR_YELLOW, " YOU HAVE %d DISABLED %s\n\n", num_disabled, num_disabled == 1 ? "TEST" : "TESTS"); } // Ensure that Google Test output is printed before, e.g., heapchecker output. fflush(stdout); } // End PrettyUnitTestResultPrinter // class TestEventRepeater // // This class forwards events to other event listeners. class TestEventRepeater : public TestEventListener { public: TestEventRepeater() : forwarding_enabled_(true) {} virtual ~TestEventRepeater(); void Append(TestEventListener *listener); TestEventListener* Release(TestEventListener* listener); // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled() const { return forwarding_enabled_; } void set_forwarding_enabled(bool enable) { forwarding_enabled_ = enable; } virtual void OnTestProgramStart(const UnitTest& unit_test); virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test); virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& unit_test); private: // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled_; // The list of listeners that receive events. std::vector listeners_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventRepeater); }; TestEventRepeater::~TestEventRepeater() { ForEach(listeners_, Delete); } void TestEventRepeater::Append(TestEventListener *listener) { listeners_.push_back(listener); } // TODO(vladl@google.com): Factor the search functionality into Vector::Find. TestEventListener* TestEventRepeater::Release(TestEventListener *listener) { for (size_t i = 0; i < listeners_.size(); ++i) { if (listeners_[i] == listener) { listeners_.erase(listeners_.begin() + i); return listener; } } return NULL; } // Since most methods are very similar, use macros to reduce boilerplate. // This defines a member that forwards the call to all listeners. #define GTEST_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (size_t i = 0; i < listeners_.size(); i++) { \ listeners_[i]->Name(parameter); \ } \ } \ } // This defines a member that forwards the call to all listeners in reverse // order. #define GTEST_REVERSE_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { \ listeners_[i]->Name(parameter); \ } \ } \ } GTEST_REPEATER_METHOD_(OnTestProgramStart, UnitTest) GTEST_REPEATER_METHOD_(OnEnvironmentsSetUpStart, UnitTest) GTEST_REPEATER_METHOD_(OnTestCaseStart, TestCase) GTEST_REPEATER_METHOD_(OnTestStart, TestInfo) GTEST_REPEATER_METHOD_(OnTestPartResult, TestPartResult) GTEST_REPEATER_METHOD_(OnEnvironmentsTearDownStart, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsSetUpEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsTearDownEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnTestEnd, TestInfo) GTEST_REVERSE_REPEATER_METHOD_(OnTestCaseEnd, TestCase) GTEST_REVERSE_REPEATER_METHOD_(OnTestProgramEnd, UnitTest) #undef GTEST_REPEATER_METHOD_ #undef GTEST_REVERSE_REPEATER_METHOD_ void TestEventRepeater::OnTestIterationStart(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (size_t i = 0; i < listeners_.size(); i++) { listeners_[i]->OnTestIterationStart(unit_test, iteration); } } } void TestEventRepeater::OnTestIterationEnd(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { listeners_[i]->OnTestIterationEnd(unit_test, iteration); } } } // End TestEventRepeater // This class generates an XML output file. class XmlUnitTestResultPrinter : public EmptyTestEventListener { public: explicit XmlUnitTestResultPrinter(const char* output_file); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); private: // Is c a whitespace character that is normalized to a space character // when it appears in an XML attribute value? static bool IsNormalizableWhitespace(char c) { return c == 0x9 || c == 0xA || c == 0xD; } // May c appear in a well-formed XML document? static bool IsValidXmlCharacter(char c) { return IsNormalizableWhitespace(c) || c >= 0x20; } // Returns an XML-escaped copy of the input string str. If // is_attribute is true, the text is meant to appear as an attribute // value, and normalizable whitespace is preserved by replacing it // with character references. static String EscapeXml(const char* str, bool is_attribute); // Returns the given string with all characters invalid in XML removed. static string RemoveInvalidXmlCharacters(const string& str); // Convenience wrapper around EscapeXml when str is an attribute value. static String EscapeXmlAttribute(const char* str) { return EscapeXml(str, true); } // Convenience wrapper around EscapeXml when str is not an attribute value. static String EscapeXmlText(const char* str) { return EscapeXml(str, false); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. static void OutputXmlCDataSection(::std::ostream* stream, const char* data); // Streams an XML representation of a TestInfo object. static void OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info); // Prints an XML representation of a TestCase object static void PrintXmlTestCase(FILE* out, const TestCase& test_case); // Prints an XML summary of unit_test to output stream out. static void PrintXmlUnitTest(FILE* out, const UnitTest& unit_test); // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. // When the String is not empty, it includes a space at the beginning, // to delimit this attribute from prior attributes. static String TestPropertiesAsXmlAttributes(const TestResult& result); // The output file. const String output_file_; GTEST_DISALLOW_COPY_AND_ASSIGN_(XmlUnitTestResultPrinter); }; // Creates a new XmlUnitTestResultPrinter. XmlUnitTestResultPrinter::XmlUnitTestResultPrinter(const char* output_file) : output_file_(output_file) { if (output_file_.c_str() == NULL || output_file_.empty()) { fprintf(stderr, "XML output file may not be null\n"); fflush(stderr); exit(EXIT_FAILURE); } } // Called after the unit test ends. void XmlUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { FILE* xmlout = NULL; FilePath output_file(output_file_); FilePath output_dir(output_file.RemoveFileName()); if (output_dir.CreateDirectoriesRecursively()) { xmlout = posix::FOpen(output_file_.c_str(), "w"); } if (xmlout == NULL) { // TODO(wan): report the reason of the failure. // // We don't do it for now as: // // 1. There is no urgent need for it. // 2. It's a bit involved to make the errno variable thread-safe on // all three operating systems (Linux, Windows, and Mac OS). // 3. To interpret the meaning of errno in a thread-safe way, // we need the strerror_r() function, which is not available on // Windows. fprintf(stderr, "Unable to open file \"%s\"\n", output_file_.c_str()); fflush(stderr); exit(EXIT_FAILURE); } PrintXmlUnitTest(xmlout, unit_test); fclose(xmlout); } // Returns an XML-escaped copy of the input string str. If is_attribute // is true, the text is meant to appear as an attribute value, and // normalizable whitespace is preserved by replacing it with character // references. // // Invalid XML characters in str, if any, are stripped from the output. // It is expected that most, if not all, of the text processed by this // module will consist of ordinary English text. // If this module is ever modified to produce version 1.1 XML output, // most invalid characters can be retained using character references. // TODO(wan): It might be nice to have a minimally invasive, human-readable // escaping scheme for invalid characters, rather than dropping them. String XmlUnitTestResultPrinter::EscapeXml(const char* str, bool is_attribute) { Message m; if (str != NULL) { for (const char* src = str; *src; ++src) { switch (*src) { case '<': m << "<"; break; case '>': m << ">"; break; case '&': m << "&"; break; case '\'': if (is_attribute) m << "'"; else m << '\''; break; case '"': if (is_attribute) m << """; else m << '"'; break; default: if (IsValidXmlCharacter(*src)) { if (is_attribute && IsNormalizableWhitespace(*src)) m << String::Format("&#x%02X;", unsigned(*src)); else m << *src; } break; } } } return m.GetString(); } // Returns the given string with all characters invalid in XML removed. // Currently invalid characters are dropped from the string. An // alternative is to replace them with certain characters such as . or ?. string XmlUnitTestResultPrinter::RemoveInvalidXmlCharacters(const string& str) { string output; output.reserve(str.size()); for (string::const_iterator it = str.begin(); it != str.end(); ++it) if (IsValidXmlCharacter(*it)) output.push_back(*it); return output; } // The following routines generate an XML representation of a UnitTest // object. // // This is how Google Test concepts map to the DTD: // // <-- corresponds to a UnitTest object // <-- corresponds to a TestCase object // <-- corresponds to a TestInfo object // ... // ... // ... // <-- individual assertion failures // // // // Formats the given time in milliseconds as seconds. std::string FormatTimeInMillisAsSeconds(TimeInMillis ms) { ::std::stringstream ss; ss << ms/1000.0; return ss.str(); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. void XmlUnitTestResultPrinter::OutputXmlCDataSection(::std::ostream* stream, const char* data) { const char* segment = data; *stream << ""); if (next_segment != NULL) { stream->write( segment, static_cast(next_segment - segment)); *stream << "]]>]]>"); } else { *stream << segment; break; } } *stream << "]]>"; } // Prints an XML representation of a TestInfo object. // TODO(wan): There is also value in printing properties with the plain printer. void XmlUnitTestResultPrinter::OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info) { const TestResult& result = *test_info.result(); *stream << " \n"; *stream << " "; const string location = internal::FormatCompilerIndependentFileLocation( part.file_name(), part.line_number()); const string message = location + "\n" + part.message(); OutputXmlCDataSection(stream, RemoveInvalidXmlCharacters(message).c_str()); *stream << "\n"; } } if (failures == 0) *stream << " />\n"; else *stream << " \n"; } // Prints an XML representation of a TestCase object void XmlUnitTestResultPrinter::PrintXmlTestCase(FILE* out, const TestCase& test_case) { fprintf(out, " \n", FormatTimeInMillisAsSeconds(test_case.elapsed_time()).c_str()); for (int i = 0; i < test_case.total_test_count(); ++i) { ::std::stringstream stream; OutputXmlTestInfo(&stream, test_case.name(), *test_case.GetTestInfo(i)); fprintf(out, "%s", StringStreamToString(&stream).c_str()); } fprintf(out, " \n"); } // Prints an XML summary of unit_test to output stream out. void XmlUnitTestResultPrinter::PrintXmlUnitTest(FILE* out, const UnitTest& unit_test) { fprintf(out, "\n"); fprintf(out, "\n"); for (int i = 0; i < unit_test.total_test_case_count(); ++i) PrintXmlTestCase(out, *unit_test.GetTestCase(i)); fprintf(out, "\n"); } // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. String XmlUnitTestResultPrinter::TestPropertiesAsXmlAttributes( const TestResult& result) { Message attributes; for (int i = 0; i < result.test_property_count(); ++i) { const TestProperty& property = result.GetTestProperty(i); attributes << " " << property.key() << "=" << "\"" << EscapeXmlAttribute(property.value()) << "\""; } return attributes.GetString(); } // End XmlUnitTestResultPrinter #if GTEST_CAN_STREAM_RESULTS_ // Streams test results to the given port on the given host machine. class StreamingListener : public EmptyTestEventListener { public: // Escapes '=', '&', '%', and '\n' characters in str as "%xx". static string UrlEncode(const char* str); StreamingListener(const string& host, const string& port) : sockfd_(-1), host_name_(host), port_num_(port) { MakeConnection(); Send("gtest_streaming_protocol_version=1.0\n"); } virtual ~StreamingListener() { if (sockfd_ != -1) CloseConnection(); } void OnTestProgramStart(const UnitTest& /* unit_test */) { Send("event=TestProgramStart\n"); } void OnTestProgramEnd(const UnitTest& unit_test) { // Note that Google Test current only report elapsed time for each // test iteration, not for the entire test program. Send(String::Format("event=TestProgramEnd&passed=%d\n", unit_test.Passed())); // Notify the streaming server to stop. CloseConnection(); } void OnTestIterationStart(const UnitTest& /* unit_test */, int iteration) { Send(String::Format("event=TestIterationStart&iteration=%d\n", iteration)); } void OnTestIterationEnd(const UnitTest& unit_test, int /* iteration */) { Send(String::Format("event=TestIterationEnd&passed=%d&elapsed_time=%sms\n", unit_test.Passed(), StreamableToString(unit_test.elapsed_time()).c_str())); } void OnTestCaseStart(const TestCase& test_case) { Send(String::Format("event=TestCaseStart&name=%s\n", test_case.name())); } void OnTestCaseEnd(const TestCase& test_case) { Send(String::Format("event=TestCaseEnd&passed=%d&elapsed_time=%sms\n", test_case.Passed(), StreamableToString(test_case.elapsed_time()).c_str())); } void OnTestStart(const TestInfo& test_info) { Send(String::Format("event=TestStart&name=%s\n", test_info.name())); } void OnTestEnd(const TestInfo& test_info) { Send(String::Format( "event=TestEnd&passed=%d&elapsed_time=%sms\n", (test_info.result())->Passed(), StreamableToString((test_info.result())->elapsed_time()).c_str())); } void OnTestPartResult(const TestPartResult& test_part_result) { const char* file_name = test_part_result.file_name(); if (file_name == NULL) file_name = ""; Send(String::Format("event=TestPartResult&file=%s&line=%d&message=", UrlEncode(file_name).c_str(), test_part_result.line_number())); Send(UrlEncode(test_part_result.message()) + "\n"); } private: // Creates a client socket and connects to the server. void MakeConnection(); // Closes the socket. void CloseConnection() { GTEST_CHECK_(sockfd_ != -1) << "CloseConnection() can be called only when there is a connection."; close(sockfd_); sockfd_ = -1; } // Sends a string to the socket. void Send(const string& message) { GTEST_CHECK_(sockfd_ != -1) << "Send() can be called only when there is a connection."; const int len = static_cast(message.length()); if (write(sockfd_, message.c_str(), len) != len) { GTEST_LOG_(WARNING) << "stream_result_to: failed to stream to " << host_name_ << ":" << port_num_; } } int sockfd_; // socket file descriptor const string host_name_; const string port_num_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamingListener); }; // class StreamingListener // Checks if str contains '=', '&', '%' or '\n' characters. If yes, // replaces them by "%xx" where xx is their hexadecimal value. For // example, replaces "=" with "%3D". This algorithm is O(strlen(str)) // in both time and space -- important as the input str may contain an // arbitrarily long test failure message and stack trace. string StreamingListener::UrlEncode(const char* str) { string result; result.reserve(strlen(str) + 1); for (char ch = *str; ch != '\0'; ch = *++str) { switch (ch) { case '%': case '=': case '&': case '\n': result.append(String::Format("%%%02x", static_cast(ch))); break; default: result.push_back(ch); break; } } return result; } void StreamingListener::MakeConnection() { GTEST_CHECK_(sockfd_ == -1) << "MakeConnection() can't be called when there is already a connection."; addrinfo hints; memset(&hints, 0, sizeof(hints)); hints.ai_family = AF_UNSPEC; // To allow both IPv4 and IPv6 addresses. hints.ai_socktype = SOCK_STREAM; addrinfo* servinfo = NULL; // Use the getaddrinfo() to get a linked list of IP addresses for // the given host name. const int error_num = getaddrinfo( host_name_.c_str(), port_num_.c_str(), &hints, &servinfo); if (error_num != 0) { GTEST_LOG_(WARNING) << "stream_result_to: getaddrinfo() failed: " << gai_strerror(error_num); } // Loop through all the results and connect to the first we can. for (addrinfo* cur_addr = servinfo; sockfd_ == -1 && cur_addr != NULL; cur_addr = cur_addr->ai_next) { sockfd_ = socket( cur_addr->ai_family, cur_addr->ai_socktype, cur_addr->ai_protocol); if (sockfd_ != -1) { // Connect the client socket to the server socket. if (connect(sockfd_, cur_addr->ai_addr, cur_addr->ai_addrlen) == -1) { close(sockfd_); sockfd_ = -1; } } } freeaddrinfo(servinfo); // all done with this structure if (sockfd_ == -1) { GTEST_LOG_(WARNING) << "stream_result_to: failed to connect to " << host_name_ << ":" << port_num_; } } // End of class Streaming Listener #endif // GTEST_CAN_STREAM_RESULTS__ // Class ScopedTrace // Pushes the given source file location and message onto a per-thread // trace stack maintained by Google Test. // L < UnitTest::mutex_ ScopedTrace::ScopedTrace(const char* file, int line, const Message& message) { TraceInfo trace; trace.file = file; trace.line = line; trace.message = message.GetString(); UnitTest::GetInstance()->PushGTestTrace(trace); } // Pops the info pushed by the c'tor. // L < UnitTest::mutex_ ScopedTrace::~ScopedTrace() { UnitTest::GetInstance()->PopGTestTrace(); } // class OsStackTraceGetter // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. // // L < mutex_ // We use "L < mutex_" to denote that the function may acquire mutex_. String OsStackTraceGetter::CurrentStackTrace(int, int) { return String(""); } // L < mutex_ void OsStackTraceGetter::UponLeavingGTest() { } const char* const OsStackTraceGetter::kElidedFramesMarker = "... " GTEST_NAME_ " internal frames ..."; } // namespace internal // class TestEventListeners TestEventListeners::TestEventListeners() : repeater_(new internal::TestEventRepeater()), default_result_printer_(NULL), default_xml_generator_(NULL) { } TestEventListeners::~TestEventListeners() { delete repeater_; } // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the user. void TestEventListeners::Append(TestEventListener* listener) { repeater_->Append(listener); } // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* TestEventListeners::Release(TestEventListener* listener) { if (listener == default_result_printer_) default_result_printer_ = NULL; else if (listener == default_xml_generator_) default_xml_generator_ = NULL; return repeater_->Release(listener); } // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* TestEventListeners::repeater() { return repeater_; } // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultResultPrinter(TestEventListener* listener) { if (default_result_printer_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_result_printer_); default_result_printer_ = listener; if (listener != NULL) Append(listener); } } // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultXmlGenerator(TestEventListener* listener) { if (default_xml_generator_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_xml_generator_); default_xml_generator_ = listener; if (listener != NULL) Append(listener); } } // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool TestEventListeners::EventForwardingEnabled() const { return repeater_->forwarding_enabled(); } void TestEventListeners::SuppressEventForwarding() { repeater_->set_forwarding_enabled(false); } // class UnitTest // Gets the singleton UnitTest object. The first time this method is // called, a UnitTest object is constructed and returned. Consecutive // calls will return the same object. // // We don't protect this under mutex_ as a user is not supposed to // call this before main() starts, from which point on the return // value will never change. UnitTest * UnitTest::GetInstance() { // When compiled with MSVC 7.1 in optimized mode, destroying the // UnitTest object upon exiting the program messes up the exit code, // causing successful tests to appear failed. We have to use a // different implementation in this case to bypass the compiler bug. // This implementation makes the compiler happy, at the cost of // leaking the UnitTest object. // CodeGear C++Builder insists on a public destructor for the // default implementation. Use this implementation to keep good OO // design with private destructor. #if (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) static UnitTest* const instance = new UnitTest; return instance; #else static UnitTest instance; return &instance; #endif // (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) } // Gets the number of successful test cases. int UnitTest::successful_test_case_count() const { return impl()->successful_test_case_count(); } // Gets the number of failed test cases. int UnitTest::failed_test_case_count() const { return impl()->failed_test_case_count(); } // Gets the number of all test cases. int UnitTest::total_test_case_count() const { return impl()->total_test_case_count(); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTest::test_case_to_run_count() const { return impl()->test_case_to_run_count(); } // Gets the number of successful tests. int UnitTest::successful_test_count() const { return impl()->successful_test_count(); } // Gets the number of failed tests. int UnitTest::failed_test_count() const { return impl()->failed_test_count(); } // Gets the number of disabled tests. int UnitTest::disabled_test_count() const { return impl()->disabled_test_count(); } // Gets the number of all tests. int UnitTest::total_test_count() const { return impl()->total_test_count(); } // Gets the number of tests that should run. int UnitTest::test_to_run_count() const { return impl()->test_to_run_count(); } // Gets the elapsed time, in milliseconds. internal::TimeInMillis UnitTest::elapsed_time() const { return impl()->elapsed_time(); } // Returns true iff the unit test passed (i.e. all test cases passed). bool UnitTest::Passed() const { return impl()->Passed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool UnitTest::Failed() const { return impl()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* UnitTest::GetTestCase(int i) const { return impl()->GetTestCase(i); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* UnitTest::GetMutableTestCase(int i) { return impl()->GetMutableTestCase(i); } // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& UnitTest::listeners() { return *impl()->listeners(); } // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in the // order they were registered. After all tests in the program have // finished, all global test environments will be torn-down in the // *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // We don't protect this under mutex_, as we only support calling it // from the main thread. Environment* UnitTest::AddEnvironment(Environment* env) { if (env == NULL) { return NULL; } impl_->environments().push_back(env); return env; } // Adds a TestPartResult to the current TestResult object. All Google Test // assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) eventually call // this to report their results. The user code should use the // assertion macros instead of calling this directly. // L < mutex_ void UnitTest::AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace) { Message msg; msg << message; internal::MutexLock lock(&mutex_); if (impl_->gtest_trace_stack().size() > 0) { msg << "\n" << GTEST_NAME_ << " trace:"; for (int i = static_cast(impl_->gtest_trace_stack().size()); i > 0; --i) { const internal::TraceInfo& trace = impl_->gtest_trace_stack()[i - 1]; msg << "\n" << internal::FormatFileLocation(trace.file, trace.line) << " " << trace.message; } } if (os_stack_trace.c_str() != NULL && !os_stack_trace.empty()) { msg << internal::kStackTraceMarker << os_stack_trace; } const TestPartResult result = TestPartResult(result_type, file_name, line_number, msg.GetString().c_str()); impl_->GetTestPartResultReporterForCurrentThread()-> ReportTestPartResult(result); if (result_type != TestPartResult::kSuccess) { // gtest_break_on_failure takes precedence over // gtest_throw_on_failure. This allows a user to set the latter // in the code (perhaps in order to use Google Test assertions // with another testing framework) and specify the former on the // command line for debugging. if (GTEST_FLAG(break_on_failure)) { #if GTEST_OS_WINDOWS // Using DebugBreak on Windows allows gtest to still break into a debugger // when a failure happens and both the --gtest_break_on_failure and // the --gtest_catch_exceptions flags are specified. DebugBreak(); #else // Dereference NULL through a volatile pointer to prevent the compiler // from removing. We use this rather than abort() or __builtin_trap() for // portability: Symbian doesn't implement abort() well, and some debuggers // don't correctly trap abort(). *static_cast(NULL) = 1; #endif // GTEST_OS_WINDOWS } else if (GTEST_FLAG(throw_on_failure)) { #if GTEST_HAS_EXCEPTIONS throw GoogleTestFailureException(result); #else // We cannot call abort() as it generates a pop-up in debug mode // that cannot be suppressed in VC 7.1 or below. exit(1); #endif } } } // Creates and adds a property to the current TestResult. If a property matching // the supplied value already exists, updates its value instead. void UnitTest::RecordPropertyForCurrentTest(const char* key, const char* value) { const TestProperty test_property(key, value); impl_->current_test_result()->RecordProperty(test_property); } // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // We don't protect this under mutex_, as we only support calling it // from the main thread. int UnitTest::Run() { // Captures the value of GTEST_FLAG(catch_exceptions). This value will be // used for the duration of the program. impl()->set_catch_exceptions(GTEST_FLAG(catch_exceptions)); #if GTEST_HAS_SEH const bool in_death_test_child_process = internal::GTEST_FLAG(internal_run_death_test).length() > 0; // Either the user wants Google Test to catch exceptions thrown by the // tests or this is executing in the context of death test child // process. In either case the user does not want to see pop-up dialogs // about crashes - they are expected. if (impl()->catch_exceptions() || in_death_test_child_process) { # if !GTEST_OS_WINDOWS_MOBILE // SetErrorMode doesn't exist on CE. SetErrorMode(SEM_FAILCRITICALERRORS | SEM_NOALIGNMENTFAULTEXCEPT | SEM_NOGPFAULTERRORBOX | SEM_NOOPENFILEERRORBOX); # endif // !GTEST_OS_WINDOWS_MOBILE # if (defined(_MSC_VER) || GTEST_OS_WINDOWS_MINGW) && !GTEST_OS_WINDOWS_MOBILE // Death test children can be terminated with _abort(). On Windows, // _abort() can show a dialog with a warning message. This forces the // abort message to go to stderr instead. _set_error_mode(_OUT_TO_STDERR); # endif # if _MSC_VER >= 1400 && !GTEST_OS_WINDOWS_MOBILE // In the debug version, Visual Studio pops up a separate dialog // offering a choice to debug the aborted program. We need to suppress // this dialog or it will pop up for every EXPECT/ASSERT_DEATH statement // executed. Google Test will notify the user of any unexpected // failure via stderr. // // VC++ doesn't define _set_abort_behavior() prior to the version 8.0. // Users of prior VC versions shall suffer the agony and pain of // clicking through the countless debug dialogs. // TODO(vladl@google.com): find a way to suppress the abort dialog() in the // debug mode when compiled with VC 7.1 or lower. if (!GTEST_FLAG(break_on_failure)) _set_abort_behavior( 0x0, // Clear the following flags: _WRITE_ABORT_MSG | _CALL_REPORTFAULT); // pop-up window, core dump. # endif } #endif // GTEST_HAS_SEH return internal::HandleExceptionsInMethodIfSupported( impl(), &internal::UnitTestImpl::RunAllTests, "auxiliary test code (environments or event listeners)") ? 0 : 1; } // Returns the working directory when the first TEST() or TEST_F() was // executed. const char* UnitTest::original_working_dir() const { return impl_->original_working_dir_.c_str(); } // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestCase* UnitTest::current_test_case() const { internal::MutexLock lock(&mutex_); return impl_->current_test_case(); } // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestInfo* UnitTest::current_test_info() const { internal::MutexLock lock(&mutex_); return impl_->current_test_info(); } // Returns the random seed used at the start of the current test run. int UnitTest::random_seed() const { return impl_->random_seed(); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // L < mutex_ internal::ParameterizedTestCaseRegistry& UnitTest::parameterized_test_registry() { return impl_->parameterized_test_registry(); } #endif // GTEST_HAS_PARAM_TEST // Creates an empty UnitTest. UnitTest::UnitTest() { impl_ = new internal::UnitTestImpl(this); } // Destructor of UnitTest. UnitTest::~UnitTest() { delete impl_; } // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. // L < mutex_ void UnitTest::PushGTestTrace(const internal::TraceInfo& trace) { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().push_back(trace); } // Pops a trace from the per-thread Google Test trace stack. // L < mutex_ void UnitTest::PopGTestTrace() { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().pop_back(); } namespace internal { UnitTestImpl::UnitTestImpl(UnitTest* parent) : parent_(parent), #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355 // (using this in initializer). default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), # pragma warning(pop) // Restores the warning state again. #else default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), #endif // _MSC_VER global_test_part_result_repoter_( &default_global_test_part_result_reporter_), per_thread_test_part_result_reporter_( &default_per_thread_test_part_result_reporter_), #if GTEST_HAS_PARAM_TEST parameterized_test_registry_(), parameterized_tests_registered_(false), #endif // GTEST_HAS_PARAM_TEST last_death_test_case_(-1), current_test_case_(NULL), current_test_info_(NULL), ad_hoc_test_result_(), os_stack_trace_getter_(NULL), post_flag_parse_init_performed_(false), random_seed_(0), // Will be overridden by the flag before first use. random_(0), // Will be reseeded before first use. elapsed_time_(0), #if GTEST_HAS_DEATH_TEST internal_run_death_test_flag_(NULL), death_test_factory_(new DefaultDeathTestFactory), #endif // Will be overridden by the flag before first use. catch_exceptions_(false) { listeners()->SetDefaultResultPrinter(new PrettyUnitTestResultPrinter); } UnitTestImpl::~UnitTestImpl() { // Deletes every TestCase. ForEach(test_cases_, internal::Delete); // Deletes every Environment. ForEach(environments_, internal::Delete); delete os_stack_trace_getter_; } #if GTEST_HAS_DEATH_TEST // Disables event forwarding if the control is currently in a death test // subprocess. Must not be called before InitGoogleTest. void UnitTestImpl::SuppressTestEventsIfInSubprocess() { if (internal_run_death_test_flag_.get() != NULL) listeners()->SuppressEventForwarding(); } #endif // GTEST_HAS_DEATH_TEST // Initializes event listeners performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureXmlOutput() { const String& output_format = UnitTestOptions::GetOutputFormat(); if (output_format == "xml") { listeners()->SetDefaultXmlGenerator(new XmlUnitTestResultPrinter( UnitTestOptions::GetAbsolutePathToOutputFile().c_str())); } else if (output_format != "") { printf("WARNING: unrecognized output format \"%s\" ignored.\n", output_format.c_str()); fflush(stdout); } } #if GTEST_CAN_STREAM_RESULTS_ // Initializes event listeners for streaming test results in String form. // Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureStreamingOutput() { const string& target = GTEST_FLAG(stream_result_to); if (!target.empty()) { const size_t pos = target.find(':'); if (pos != string::npos) { listeners()->Append(new StreamingListener(target.substr(0, pos), target.substr(pos+1))); } else { printf("WARNING: unrecognized streaming target \"%s\" ignored.\n", target.c_str()); fflush(stdout); } } } #endif // GTEST_CAN_STREAM_RESULTS_ // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void UnitTestImpl::PostFlagParsingInit() { // Ensures that this function does not execute more than once. if (!post_flag_parse_init_performed_) { post_flag_parse_init_performed_ = true; #if GTEST_HAS_DEATH_TEST InitDeathTestSubprocessControlInfo(); SuppressTestEventsIfInSubprocess(); #endif // GTEST_HAS_DEATH_TEST // Registers parameterized tests. This makes parameterized tests // available to the UnitTest reflection API without running // RUN_ALL_TESTS. RegisterParameterizedTests(); // Configures listeners for XML output. This makes it possible for users // to shut down the default XML output before invoking RUN_ALL_TESTS. ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Configures listeners for streaming test results to the specified server. ConfigureStreamingOutput(); #endif // GTEST_CAN_STREAM_RESULTS_ } } // A predicate that checks the name of a TestCase against a known // value. // // This is used for implementation of the UnitTest class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestCaseNameIs is copyable. class TestCaseNameIs { public: // Constructor. explicit TestCaseNameIs(const String& name) : name_(name) {} // Returns true iff the name of test_case matches name_. bool operator()(const TestCase* test_case) const { return test_case != NULL && strcmp(test_case->name(), name_.c_str()) == 0; } private: String name_; }; // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. It's the CALLER'S // RESPONSIBILITY to ensure that this function is only called WHEN THE // TESTS ARE NOT SHUFFLED. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* UnitTestImpl::GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) { // Can we find a TestCase with the given name? const std::vector::const_iterator test_case = std::find_if(test_cases_.begin(), test_cases_.end(), TestCaseNameIs(test_case_name)); if (test_case != test_cases_.end()) return *test_case; // No. Let's create one. TestCase* const new_test_case = new TestCase(test_case_name, type_param, set_up_tc, tear_down_tc); // Is this a death test case? if (internal::UnitTestOptions::MatchesFilter(String(test_case_name), kDeathTestCaseFilter)) { // Yes. Inserts the test case after the last death test case // defined so far. This only works when the test cases haven't // been shuffled. Otherwise we may end up running a death test // after a non-death test. ++last_death_test_case_; test_cases_.insert(test_cases_.begin() + last_death_test_case_, new_test_case); } else { // No. Appends to the end of the list. test_cases_.push_back(new_test_case); } test_case_indices_.push_back(static_cast(test_case_indices_.size())); return new_test_case; } // Helpers for setting up / tearing down the given environment. They // are for use in the ForEach() function. static void SetUpEnvironment(Environment* env) { env->SetUp(); } static void TearDownEnvironment(Environment* env) { env->TearDown(); } // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, the test is considered to be failed, but the // rest of the tests will still be run. // // When parameterized tests are enabled, it expands and registers // parameterized tests first in RegisterParameterizedTests(). // All other functions called from RunAllTests() may safely assume that // parameterized tests are ready to be counted and run. bool UnitTestImpl::RunAllTests() { // Makes sure InitGoogleTest() was called. if (!GTestIsInitialized()) { printf("%s", "\nThis test program did NOT call ::testing::InitGoogleTest " "before calling RUN_ALL_TESTS(). Please fix it.\n"); return false; } // Do not run any test if the --help flag was specified. if (g_help_flag) return true; // Repeats the call to the post-flag parsing initialization in case the // user didn't call InitGoogleTest. PostFlagParsingInit(); // Even if sharding is not on, test runners may want to use the // GTEST_SHARD_STATUS_FILE to query whether the test supports the sharding // protocol. internal::WriteToShardStatusFileIfNeeded(); // True iff we are in a subprocess for running a thread-safe-style // death test. bool in_subprocess_for_death_test = false; #if GTEST_HAS_DEATH_TEST in_subprocess_for_death_test = (internal_run_death_test_flag_.get() != NULL); #endif // GTEST_HAS_DEATH_TEST const bool should_shard = ShouldShard(kTestTotalShards, kTestShardIndex, in_subprocess_for_death_test); // Compares the full test names with the filter to decide which // tests to run. const bool has_tests_to_run = FilterTests(should_shard ? HONOR_SHARDING_PROTOCOL : IGNORE_SHARDING_PROTOCOL) > 0; // Lists the tests and exits if the --gtest_list_tests flag was specified. if (GTEST_FLAG(list_tests)) { // This must be called *after* FilterTests() has been called. ListTestsMatchingFilter(); return true; } random_seed_ = GTEST_FLAG(shuffle) ? GetRandomSeedFromFlag(GTEST_FLAG(random_seed)) : 0; // True iff at least one test has failed. bool failed = false; TestEventListener* repeater = listeners()->repeater(); repeater->OnTestProgramStart(*parent_); // How many times to repeat the tests? We don't want to repeat them // when we are inside the subprocess of a death test. const int repeat = in_subprocess_for_death_test ? 1 : GTEST_FLAG(repeat); // Repeats forever if the repeat count is negative. const bool forever = repeat < 0; for (int i = 0; forever || i != repeat; i++) { // We want to preserve failures generated by ad-hoc test // assertions executed before RUN_ALL_TESTS(). ClearNonAdHocTestResult(); const TimeInMillis start = GetTimeInMillis(); // Shuffles test cases and tests if requested. if (has_tests_to_run && GTEST_FLAG(shuffle)) { random()->Reseed(random_seed_); // This should be done before calling OnTestIterationStart(), // such that a test event listener can see the actual test order // in the event. ShuffleTests(); } // Tells the unit test event listeners that the tests are about to start. repeater->OnTestIterationStart(*parent_, i); // Runs each test case if there is at least one test to run. if (has_tests_to_run) { // Sets up all environments beforehand. repeater->OnEnvironmentsSetUpStart(*parent_); ForEach(environments_, SetUpEnvironment); repeater->OnEnvironmentsSetUpEnd(*parent_); // Runs the tests only if there was no fatal failure during global // set-up. if (!Test::HasFatalFailure()) { for (int test_index = 0; test_index < total_test_case_count(); test_index++) { GetMutableTestCase(test_index)->Run(); } } // Tears down all environments in reverse order afterwards. repeater->OnEnvironmentsTearDownStart(*parent_); std::for_each(environments_.rbegin(), environments_.rend(), TearDownEnvironment); repeater->OnEnvironmentsTearDownEnd(*parent_); } elapsed_time_ = GetTimeInMillis() - start; // Tells the unit test event listener that the tests have just finished. repeater->OnTestIterationEnd(*parent_, i); // Gets the result and clears it. if (!Passed()) { failed = true; } // Restores the original test order after the iteration. This // allows the user to quickly repro a failure that happens in the // N-th iteration without repeating the first (N - 1) iterations. // This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in // case the user somehow changes the value of the flag somewhere // (it's always safe to unshuffle the tests). UnshuffleTests(); if (GTEST_FLAG(shuffle)) { // Picks a new random seed for each iteration. random_seed_ = GetNextRandomSeed(random_seed_); } } repeater->OnTestProgramEnd(*parent_); return !failed; } // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded() { const char* const test_shard_file = posix::GetEnv(kTestShardStatusFile); if (test_shard_file != NULL) { FILE* const file = posix::FOpen(test_shard_file, "w"); if (file == NULL) { ColoredPrintf(COLOR_RED, "Could not write to the test shard status file \"%s\" " "specified by the %s environment variable.\n", test_shard_file, kTestShardStatusFile); fflush(stdout); exit(EXIT_FAILURE); } fclose(file); } } // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (i.e., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. bool ShouldShard(const char* total_shards_env, const char* shard_index_env, bool in_subprocess_for_death_test) { if (in_subprocess_for_death_test) { return false; } const Int32 total_shards = Int32FromEnvOrDie(total_shards_env, -1); const Int32 shard_index = Int32FromEnvOrDie(shard_index_env, -1); if (total_shards == -1 && shard_index == -1) { return false; } else if (total_shards == -1 && shard_index != -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestShardIndex << " = " << shard_index << ", but have left " << kTestTotalShards << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (total_shards != -1 && shard_index == -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestTotalShards << " = " << total_shards << ", but have left " << kTestShardIndex << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (shard_index < 0 || shard_index >= total_shards) { const Message msg = Message() << "Invalid environment variables: we require 0 <= " << kTestShardIndex << " < " << kTestTotalShards << ", but you have " << kTestShardIndex << "=" << shard_index << ", " << kTestTotalShards << "=" << total_shards << ".\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } return total_shards > 1; } // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error // and aborts. Int32 Int32FromEnvOrDie(const char* var, Int32 default_val) { const char* str_val = posix::GetEnv(var); if (str_val == NULL) { return default_val; } Int32 result; if (!ParseInt32(Message() << "The value of environment variable " << var, str_val, &result)) { exit(EXIT_FAILURE); } return result; } // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. bool ShouldRunTestOnShard(int total_shards, int shard_index, int test_id) { return (test_id % total_shards) == shard_index; } // Compares the name of each test with the user-specified filter to // decide whether the test should be run, then records the result in // each TestCase and TestInfo object. // If shard_tests == true, further filters tests based on sharding // variables in the environment - see // http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide. // Returns the number of tests that should run. int UnitTestImpl::FilterTests(ReactionToSharding shard_tests) { const Int32 total_shards = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestTotalShards, -1) : -1; const Int32 shard_index = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestShardIndex, -1) : -1; // num_runnable_tests are the number of tests that will // run across all shards (i.e., match filter and are not disabled). // num_selected_tests are the number of tests to be run on // this shard. int num_runnable_tests = 0; int num_selected_tests = 0; for (size_t i = 0; i < test_cases_.size(); i++) { TestCase* const test_case = test_cases_[i]; const String &test_case_name = test_case->name(); test_case->set_should_run(false); for (size_t j = 0; j < test_case->test_info_list().size(); j++) { TestInfo* const test_info = test_case->test_info_list()[j]; const String test_name(test_info->name()); // A test is disabled if test case name or test name matches // kDisableTestFilter. const bool is_disabled = internal::UnitTestOptions::MatchesFilter(test_case_name, kDisableTestFilter) || internal::UnitTestOptions::MatchesFilter(test_name, kDisableTestFilter); test_info->is_disabled_ = is_disabled; const bool matches_filter = internal::UnitTestOptions::FilterMatchesTest(test_case_name, test_name); test_info->matches_filter_ = matches_filter; const bool is_runnable = (GTEST_FLAG(also_run_disabled_tests) || !is_disabled) && matches_filter; const bool is_selected = is_runnable && (shard_tests == IGNORE_SHARDING_PROTOCOL || ShouldRunTestOnShard(total_shards, shard_index, num_runnable_tests)); num_runnable_tests += is_runnable; num_selected_tests += is_selected; test_info->should_run_ = is_selected; test_case->set_should_run(test_case->should_run() || is_selected); } } return num_selected_tests; } // Prints the names of the tests matching the user-specified filter flag. void UnitTestImpl::ListTestsMatchingFilter() { for (size_t i = 0; i < test_cases_.size(); i++) { const TestCase* const test_case = test_cases_[i]; bool printed_test_case_name = false; for (size_t j = 0; j < test_case->test_info_list().size(); j++) { const TestInfo* const test_info = test_case->test_info_list()[j]; if (test_info->matches_filter_) { if (!printed_test_case_name) { printed_test_case_name = true; printf("%s.\n", test_case->name()); } printf(" %s\n", test_info->name()); } } } fflush(stdout); } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter are // the same; otherwise, deletes the old getter and makes the input the // current getter. void UnitTestImpl::set_os_stack_trace_getter( OsStackTraceGetterInterface* getter) { if (os_stack_trace_getter_ != getter) { delete os_stack_trace_getter_; os_stack_trace_getter_ = getter; } } // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* UnitTestImpl::os_stack_trace_getter() { if (os_stack_trace_getter_ == NULL) { os_stack_trace_getter_ = new OsStackTraceGetter; } return os_stack_trace_getter_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* UnitTestImpl::current_test_result() { return current_test_info_ ? &(current_test_info_->result_) : &ad_hoc_test_result_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void UnitTestImpl::ShuffleTests() { // Shuffles the death test cases. ShuffleRange(random(), 0, last_death_test_case_ + 1, &test_case_indices_); // Shuffles the non-death test cases. ShuffleRange(random(), last_death_test_case_ + 1, static_cast(test_cases_.size()), &test_case_indices_); // Shuffles the tests inside each test case. for (size_t i = 0; i < test_cases_.size(); i++) { test_cases_[i]->ShuffleTests(random()); } } // Restores the test cases and tests to their order before the first shuffle. void UnitTestImpl::UnshuffleTests() { for (size_t i = 0; i < test_cases_.size(); i++) { // Unshuffles the tests in each test case. test_cases_[i]->UnshuffleTests(); // Resets the index of each test case. test_case_indices_[i] = static_cast(i); } } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. String GetCurrentOsStackTraceExceptTop(UnitTest* /*unit_test*/, int skip_count) { // We pass skip_count + 1 to skip this wrapper function in addition // to what the user really wants to skip. return GetUnitTestImpl()->CurrentOsStackTraceExceptTop(skip_count + 1); } // Used by the GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_ macro to // suppress unreachable code warnings. namespace { class ClassUniqueToAlwaysTrue {}; } bool IsTrue(bool condition) { return condition; } bool AlwaysTrue() { #if GTEST_HAS_EXCEPTIONS // This condition is always false so AlwaysTrue() never actually throws, // but it makes the compiler think that it may throw. if (IsTrue(false)) throw ClassUniqueToAlwaysTrue(); #endif // GTEST_HAS_EXCEPTIONS return true; } // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. bool SkipPrefix(const char* prefix, const char** pstr) { const size_t prefix_len = strlen(prefix); if (strncmp(*pstr, prefix, prefix_len) == 0) { *pstr += prefix_len; return true; } return false; } // Parses a string as a command line flag. The string should have // the format "--flag=value". When def_optional is true, the "=value" // part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. const char* ParseFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--" followed by GTEST_FLAG_PREFIX_. const String flag_str = String::Format("--%s%s", GTEST_FLAG_PREFIX_, flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a bool flag, in the form of either // "--flag=value" or "--flag". // // In the former case, the value is taken as true as long as it does // not start with '0', 'f', or 'F'. // // In the latter case, the value is taken as true. // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for an Int32 flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseInt32Flag(const char* str, const char* flag, Int32* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. return ParseInt32(Message() << "The value of flag --" << flag, value_str, value); } // Parses a string for a string flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // Determines whether a string has a prefix that Google Test uses for its // flags, i.e., starts with GTEST_FLAG_PREFIX_ or GTEST_FLAG_PREFIX_DASH_. // If Google Test detects that a command line flag has its prefix but is not // recognized, it will print its help message. Flags starting with // GTEST_INTERNAL_PREFIX_ followed by "internal_" are considered Google Test // internal flags and do not trigger the help message. static bool HasGoogleTestFlagPrefix(const char* str) { return (SkipPrefix("--", &str) || SkipPrefix("-", &str) || SkipPrefix("/", &str)) && !SkipPrefix(GTEST_FLAG_PREFIX_ "internal_", &str) && (SkipPrefix(GTEST_FLAG_PREFIX_, &str) || SkipPrefix(GTEST_FLAG_PREFIX_DASH_, &str)); } // Prints a string containing code-encoded text. The following escape // sequences can be used in the string to control the text color: // // @@ prints a single '@' character. // @R changes the color to red. // @G changes the color to green. // @Y changes the color to yellow. // @D changes to the default terminal text color. // // TODO(wan@google.com): Write tests for this once we add stdout // capturing to Google Test. static void PrintColorEncoded(const char* str) { GTestColor color = COLOR_DEFAULT; // The current color. // Conceptually, we split the string into segments divided by escape // sequences. Then we print one segment at a time. At the end of // each iteration, the str pointer advances to the beginning of the // next segment. for (;;) { const char* p = strchr(str, '@'); if (p == NULL) { ColoredPrintf(color, "%s", str); return; } ColoredPrintf(color, "%s", String(str, p - str).c_str()); const char ch = p[1]; str = p + 2; if (ch == '@') { ColoredPrintf(color, "@"); } else if (ch == 'D') { color = COLOR_DEFAULT; } else if (ch == 'R') { color = COLOR_RED; } else if (ch == 'G') { color = COLOR_GREEN; } else if (ch == 'Y') { color = COLOR_YELLOW; } else { --str; } } } static const char kColorEncodedHelpMessage[] = "This program contains tests written using " GTEST_NAME_ ". You can use the\n" "following command line flags to control its behavior:\n" "\n" "Test Selection:\n" " @G--" GTEST_FLAG_PREFIX_ "list_tests@D\n" " List the names of all tests instead of running them. The name of\n" " TEST(Foo, Bar) is \"Foo.Bar\".\n" " @G--" GTEST_FLAG_PREFIX_ "filter=@YPOSTIVE_PATTERNS" "[@G-@YNEGATIVE_PATTERNS]@D\n" " Run only the tests whose name matches one of the positive patterns but\n" " none of the negative patterns. '?' matches any single character; '*'\n" " matches any substring; ':' separates two patterns.\n" " @G--" GTEST_FLAG_PREFIX_ "also_run_disabled_tests@D\n" " Run all disabled tests too.\n" "\n" "Test Execution:\n" " @G--" GTEST_FLAG_PREFIX_ "repeat=@Y[COUNT]@D\n" " Run the tests repeatedly; use a negative count to repeat forever.\n" " @G--" GTEST_FLAG_PREFIX_ "shuffle@D\n" " Randomize tests' orders on every iteration.\n" " @G--" GTEST_FLAG_PREFIX_ "random_seed=@Y[NUMBER]@D\n" " Random number seed to use for shuffling test orders (between 1 and\n" " 99999, or 0 to use a seed based on the current time).\n" "\n" "Test Output:\n" " @G--" GTEST_FLAG_PREFIX_ "color=@Y(@Gyes@Y|@Gno@Y|@Gauto@Y)@D\n" " Enable/disable colored output. The default is @Gauto@D.\n" " -@G-" GTEST_FLAG_PREFIX_ "print_time=0@D\n" " Don't print the elapsed time of each test.\n" " @G--" GTEST_FLAG_PREFIX_ "output=xml@Y[@G:@YDIRECTORY_PATH@G" GTEST_PATH_SEP_ "@Y|@G:@YFILE_PATH]@D\n" " Generate an XML report in the given directory or with the given file\n" " name. @YFILE_PATH@D defaults to @Gtest_details.xml@D.\n" #if GTEST_CAN_STREAM_RESULTS_ " @G--" GTEST_FLAG_PREFIX_ "stream_result_to=@YHOST@G:@YPORT@D\n" " Stream test results to the given server.\n" #endif // GTEST_CAN_STREAM_RESULTS_ "\n" "Assertion Behavior:\n" #if GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "death_test_style=@Y(@Gfast@Y|@Gthreadsafe@Y)@D\n" " Set the default death test style.\n" #endif // GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "break_on_failure@D\n" " Turn assertion failures into debugger break-points.\n" " @G--" GTEST_FLAG_PREFIX_ "throw_on_failure@D\n" " Turn assertion failures into C++ exceptions.\n" " @G--" GTEST_FLAG_PREFIX_ "catch_exceptions=0@D\n" " Do not report exceptions as test failures. Instead, allow them\n" " to crash the program or throw a pop-up (on Windows).\n" "\n" "Except for @G--" GTEST_FLAG_PREFIX_ "list_tests@D, you can alternatively set " "the corresponding\n" "environment variable of a flag (all letters in upper-case). For example, to\n" "disable colored text output, you can either specify @G--" GTEST_FLAG_PREFIX_ "color=no@D or set\n" "the @G" GTEST_FLAG_PREFIX_UPPER_ "COLOR@D environment variable to @Gno@D.\n" "\n" "For more information, please read the " GTEST_NAME_ " documentation at\n" "@G" GTEST_PROJECT_URL_ "@D. If you find a bug in " GTEST_NAME_ "\n" "(not one in your own code or tests), please report it to\n" "@G<" GTEST_DEV_EMAIL_ ">@D.\n"; // Parses the command line for Google Test flags, without initializing // other parts of Google Test. The type parameter CharType can be // instantiated to either char or wchar_t. template void ParseGoogleTestFlagsOnlyImpl(int* argc, CharType** argv) { for (int i = 1; i < *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); using internal::ParseBoolFlag; using internal::ParseInt32Flag; using internal::ParseStringFlag; // Do we see a Google Test flag? if (ParseBoolFlag(arg, kAlsoRunDisabledTestsFlag, >EST_FLAG(also_run_disabled_tests)) || ParseBoolFlag(arg, kBreakOnFailureFlag, >EST_FLAG(break_on_failure)) || ParseBoolFlag(arg, kCatchExceptionsFlag, >EST_FLAG(catch_exceptions)) || ParseStringFlag(arg, kColorFlag, >EST_FLAG(color)) || ParseStringFlag(arg, kDeathTestStyleFlag, >EST_FLAG(death_test_style)) || ParseBoolFlag(arg, kDeathTestUseFork, >EST_FLAG(death_test_use_fork)) || ParseStringFlag(arg, kFilterFlag, >EST_FLAG(filter)) || ParseStringFlag(arg, kInternalRunDeathTestFlag, >EST_FLAG(internal_run_death_test)) || ParseBoolFlag(arg, kListTestsFlag, >EST_FLAG(list_tests)) || ParseStringFlag(arg, kOutputFlag, >EST_FLAG(output)) || ParseBoolFlag(arg, kPrintTimeFlag, >EST_FLAG(print_time)) || ParseInt32Flag(arg, kRandomSeedFlag, >EST_FLAG(random_seed)) || ParseInt32Flag(arg, kRepeatFlag, >EST_FLAG(repeat)) || ParseBoolFlag(arg, kShuffleFlag, >EST_FLAG(shuffle)) || ParseInt32Flag(arg, kStackTraceDepthFlag, >EST_FLAG(stack_trace_depth)) || ParseStringFlag(arg, kStreamResultToFlag, >EST_FLAG(stream_result_to)) || ParseBoolFlag(arg, kThrowOnFailureFlag, >EST_FLAG(throw_on_failure)) ) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } else if (arg_string == "--help" || arg_string == "-h" || arg_string == "-?" || arg_string == "/?" || HasGoogleTestFlagPrefix(arg)) { // Both help flag and unrecognized Google Test flags (excluding // internal ones) trigger help display. g_help_flag = true; } } if (g_help_flag) { // We print the help here instead of in RUN_ALL_TESTS(), as the // latter may not be called at all if the user is using Google // Test with another testing framework. PrintColorEncoded(kColorEncodedHelpMessage); } } // Parses the command line for Google Test flags, without initializing // other parts of Google Test. void ParseGoogleTestFlagsOnly(int* argc, char** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } // The internal implementation of InitGoogleTest(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleTestImpl(int* argc, CharType** argv) { g_init_gtest_count++; // We don't want to run the initialization code twice. if (g_init_gtest_count != 1) return; if (*argc <= 0) return; internal::g_executable_path = internal::StreamableToString(argv[0]); #if GTEST_HAS_DEATH_TEST g_argvs.clear(); for (int i = 0; i != *argc; i++) { g_argvs.push_back(StreamableToString(argv[i])); } #endif // GTEST_HAS_DEATH_TEST ParseGoogleTestFlagsOnly(argc, argv); GetUnitTestImpl()->PostFlagParsingInit(); } } // namespace internal // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. void InitGoogleTest(int* argc, char** argv) { internal::InitGoogleTestImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleTest(int* argc, wchar_t** argv) { internal::InitGoogleTestImpl(argc, argv); } } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/src/gtest_main.cc0000600000175000017500000000335411561126632022675 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. #include #include "gtest/gtest.h" GTEST_API_ int main(int argc, char **argv) { std::cout << "Running main() from gtest_main.cc\n"; testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/0000700000175000017500000000000012140644175020416 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-death-test_ex_test.cc0000600000175000017500000000713711561126632025657 0ustar synergysynergy// Copyright 2010, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // Tests that verify interaction of exceptions and death tests. #include "gtest/gtest-death-test.h" #include "gtest/gtest.h" #if GTEST_HAS_DEATH_TEST # if GTEST_HAS_SEH # include // For RaiseException(). # endif # include "gtest/gtest-spi.h" # if GTEST_HAS_EXCEPTIONS # include // For std::exception. // Tests that death tests report thrown exceptions as failures and that the // exceptions do not escape death test macros. TEST(CxxExceptionDeathTest, ExceptionIsFailure) { try { EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(throw 1, ""), "threw an exception"); } catch (...) { // NOLINT FAIL() << "An exception escaped a death test macro invocation " << "with catch_exceptions " << (testing::GTEST_FLAG(catch_exceptions) ? "enabled" : "disabled"); } } class TestException : public std::exception { public: virtual const char* what() const throw() { return "exceptional message"; } }; TEST(CxxExceptionDeathTest, PrintsMessageForStdExceptions) { // Verifies that the exception message is quoted in the failure text. EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(throw TestException(), ""), "exceptional message"); // Verifies that the location is mentioned in the failure text. EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(throw TestException(), ""), "gtest-death-test_ex_test.cc"); } # endif // GTEST_HAS_EXCEPTIONS # if GTEST_HAS_SEH // Tests that enabling interception of SEH exceptions with the // catch_exceptions flag does not interfere with SEH exceptions being // treated as death by death tests. TEST(SehExceptionDeasTest, CatchExceptionsDoesNotInterfere) { EXPECT_DEATH(RaiseException(42, 0x0, 0, NULL), "") << "with catch_exceptions " << (testing::GTEST_FLAG(catch_exceptions) ? "enabled" : "disabled"); } # endif #endif // GTEST_HAS_DEATH_TEST int main(int argc, char** argv) { testing::InitGoogleTest(&argc, argv); testing::GTEST_FLAG(catch_exceptions) = GTEST_ENABLE_CATCH_EXCEPTIONS_ != 0; return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-death-test_test.cc0000600000175000017500000011774311561126632025170 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests for death tests. #include "gtest/gtest-death-test.h" #include "gtest/gtest.h" #include "gtest/internal/gtest-filepath.h" using testing::internal::AlwaysFalse; using testing::internal::AlwaysTrue; #if GTEST_HAS_DEATH_TEST # if GTEST_OS_WINDOWS # include // For chdir(). # else # include # include // For waitpid. # include // For std::numeric_limits. # endif // GTEST_OS_WINDOWS # include # include # include # include "gtest/gtest-spi.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. # define GTEST_IMPLEMENTATION_ 1 # include "src/gtest-internal-inl.h" # undef GTEST_IMPLEMENTATION_ namespace posix = ::testing::internal::posix; using testing::Message; using testing::internal::DeathTest; using testing::internal::DeathTestFactory; using testing::internal::FilePath; using testing::internal::GetLastErrnoDescription; using testing::internal::GetUnitTestImpl; using testing::internal::ParseNaturalNumber; using testing::internal::String; namespace testing { namespace internal { // A helper class whose objects replace the death test factory for a // single UnitTest object during their lifetimes. class ReplaceDeathTestFactory { public: explicit ReplaceDeathTestFactory(DeathTestFactory* new_factory) : unit_test_impl_(GetUnitTestImpl()) { old_factory_ = unit_test_impl_->death_test_factory_.release(); unit_test_impl_->death_test_factory_.reset(new_factory); } ~ReplaceDeathTestFactory() { unit_test_impl_->death_test_factory_.release(); unit_test_impl_->death_test_factory_.reset(old_factory_); } private: // Prevents copying ReplaceDeathTestFactory objects. ReplaceDeathTestFactory(const ReplaceDeathTestFactory&); void operator=(const ReplaceDeathTestFactory&); UnitTestImpl* unit_test_impl_; DeathTestFactory* old_factory_; }; } // namespace internal } // namespace testing void DieWithMessage(const ::std::string& message) { fprintf(stderr, "%s", message.c_str()); fflush(stderr); // Make sure the text is printed before the process exits. // We call _exit() instead of exit(), as the former is a direct // system call and thus safer in the presence of threads. exit() // will invoke user-defined exit-hooks, which may do dangerous // things that conflict with death tests. // // Some compilers can recognize that _exit() never returns and issue the // 'unreachable code' warning for code following this function, unless // fooled by a fake condition. if (AlwaysTrue()) _exit(1); } void DieInside(const ::std::string& function) { DieWithMessage("death inside " + function + "()."); } // Tests that death tests work. class TestForDeathTest : public testing::Test { protected: TestForDeathTest() : original_dir_(FilePath::GetCurrentDir()) {} virtual ~TestForDeathTest() { posix::ChDir(original_dir_.c_str()); } // A static member function that's expected to die. static void StaticMemberFunction() { DieInside("StaticMemberFunction"); } // A method of the test fixture that may die. void MemberFunction() { if (should_die_) DieInside("MemberFunction"); } // True iff MemberFunction() should die. bool should_die_; const FilePath original_dir_; }; // A class with a member function that may die. class MayDie { public: explicit MayDie(bool should_die) : should_die_(should_die) {} // A member function that may die. void MemberFunction() const { if (should_die_) DieInside("MayDie::MemberFunction"); } private: // True iff MemberFunction() should die. bool should_die_; }; // A global function that's expected to die. void GlobalFunction() { DieInside("GlobalFunction"); } // A non-void function that's expected to die. int NonVoidFunction() { DieInside("NonVoidFunction"); return 1; } // A unary function that may die. void DieIf(bool should_die) { if (should_die) DieInside("DieIf"); } // A binary function that may die. bool DieIfLessThan(int x, int y) { if (x < y) { DieInside("DieIfLessThan"); } return true; } // Tests that ASSERT_DEATH can be used outside a TEST, TEST_F, or test fixture. void DeathTestSubroutine() { EXPECT_DEATH(GlobalFunction(), "death.*GlobalFunction"); ASSERT_DEATH(GlobalFunction(), "death.*GlobalFunction"); } // Death in dbg, not opt. int DieInDebugElse12(int* sideeffect) { if (sideeffect) *sideeffect = 12; # ifndef NDEBUG DieInside("DieInDebugElse12"); # endif // NDEBUG return 12; } # if GTEST_OS_WINDOWS // Tests the ExitedWithCode predicate. TEST(ExitStatusPredicateTest, ExitedWithCode) { // On Windows, the process's exit code is the same as its exit status, // so the predicate just compares the its input with its parameter. EXPECT_TRUE(testing::ExitedWithCode(0)(0)); EXPECT_TRUE(testing::ExitedWithCode(1)(1)); EXPECT_TRUE(testing::ExitedWithCode(42)(42)); EXPECT_FALSE(testing::ExitedWithCode(0)(1)); EXPECT_FALSE(testing::ExitedWithCode(1)(0)); } # else // Returns the exit status of a process that calls _exit(2) with a // given exit code. This is a helper function for the // ExitStatusPredicateTest test suite. static int NormalExitStatus(int exit_code) { pid_t child_pid = fork(); if (child_pid == 0) { _exit(exit_code); } int status; waitpid(child_pid, &status, 0); return status; } // Returns the exit status of a process that raises a given signal. // If the signal does not cause the process to die, then it returns // instead the exit status of a process that exits normally with exit // code 1. This is a helper function for the ExitStatusPredicateTest // test suite. static int KilledExitStatus(int signum) { pid_t child_pid = fork(); if (child_pid == 0) { raise(signum); _exit(1); } int status; waitpid(child_pid, &status, 0); return status; } // Tests the ExitedWithCode predicate. TEST(ExitStatusPredicateTest, ExitedWithCode) { const int status0 = NormalExitStatus(0); const int status1 = NormalExitStatus(1); const int status42 = NormalExitStatus(42); const testing::ExitedWithCode pred0(0); const testing::ExitedWithCode pred1(1); const testing::ExitedWithCode pred42(42); EXPECT_PRED1(pred0, status0); EXPECT_PRED1(pred1, status1); EXPECT_PRED1(pred42, status42); EXPECT_FALSE(pred0(status1)); EXPECT_FALSE(pred42(status0)); EXPECT_FALSE(pred1(status42)); } // Tests the KilledBySignal predicate. TEST(ExitStatusPredicateTest, KilledBySignal) { const int status_segv = KilledExitStatus(SIGSEGV); const int status_kill = KilledExitStatus(SIGKILL); const testing::KilledBySignal pred_segv(SIGSEGV); const testing::KilledBySignal pred_kill(SIGKILL); EXPECT_PRED1(pred_segv, status_segv); EXPECT_PRED1(pred_kill, status_kill); EXPECT_FALSE(pred_segv(status_kill)); EXPECT_FALSE(pred_kill(status_segv)); } # endif // GTEST_OS_WINDOWS // Tests that the death test macros expand to code which may or may not // be followed by operator<<, and that in either case the complete text // comprises only a single C++ statement. TEST_F(TestForDeathTest, SingleStatement) { if (AlwaysFalse()) // This would fail if executed; this is a compilation test only ASSERT_DEATH(return, ""); if (AlwaysTrue()) EXPECT_DEATH(_exit(1), ""); else // This empty "else" branch is meant to ensure that EXPECT_DEATH // doesn't expand into an "if" statement without an "else" ; if (AlwaysFalse()) ASSERT_DEATH(return, "") << "did not die"; if (AlwaysFalse()) ; else EXPECT_DEATH(_exit(1), "") << 1 << 2 << 3; } void DieWithEmbeddedNul() { fprintf(stderr, "Hello%cmy null world.\n", '\0'); fflush(stderr); _exit(1); } # if GTEST_USES_PCRE // Tests that EXPECT_DEATH and ASSERT_DEATH work when the error // message has a NUL character in it. TEST_F(TestForDeathTest, EmbeddedNulInMessage) { // TODO(wan@google.com): doesn't support matching strings // with embedded NUL characters - find a way to workaround it. EXPECT_DEATH(DieWithEmbeddedNul(), "my null world"); ASSERT_DEATH(DieWithEmbeddedNul(), "my null world"); } # endif // GTEST_USES_PCRE // Tests that death test macros expand to code which interacts well with switch // statements. TEST_F(TestForDeathTest, SwitchStatement) { // Microsoft compiler usually complains about switch statements without // case labels. We suppress that warning for this test. # ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4065) # endif // _MSC_VER switch (0) default: ASSERT_DEATH(_exit(1), "") << "exit in default switch handler"; switch (0) case 0: EXPECT_DEATH(_exit(1), "") << "exit in switch case"; # ifdef _MSC_VER # pragma warning(pop) # endif // _MSC_VER } // Tests that a static member function can be used in a "fast" style // death test. TEST_F(TestForDeathTest, StaticMemberFunctionFastStyle) { testing::GTEST_FLAG(death_test_style) = "fast"; ASSERT_DEATH(StaticMemberFunction(), "death.*StaticMember"); } // Tests that a method of the test fixture can be used in a "fast" // style death test. TEST_F(TestForDeathTest, MemberFunctionFastStyle) { testing::GTEST_FLAG(death_test_style) = "fast"; should_die_ = true; EXPECT_DEATH(MemberFunction(), "inside.*MemberFunction"); } void ChangeToRootDir() { posix::ChDir(GTEST_PATH_SEP_); } // Tests that death tests work even if the current directory has been // changed. TEST_F(TestForDeathTest, FastDeathTestInChangedDir) { testing::GTEST_FLAG(death_test_style) = "fast"; ChangeToRootDir(); EXPECT_EXIT(_exit(1), testing::ExitedWithCode(1), ""); ChangeToRootDir(); ASSERT_DEATH(_exit(1), ""); } // Repeats a representative sample of death tests in the "threadsafe" style: TEST_F(TestForDeathTest, StaticMemberFunctionThreadsafeStyle) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; ASSERT_DEATH(StaticMemberFunction(), "death.*StaticMember"); } TEST_F(TestForDeathTest, MemberFunctionThreadsafeStyle) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; should_die_ = true; EXPECT_DEATH(MemberFunction(), "inside.*MemberFunction"); } TEST_F(TestForDeathTest, ThreadsafeDeathTestInLoop) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; for (int i = 0; i < 3; ++i) EXPECT_EXIT(_exit(i), testing::ExitedWithCode(i), "") << ": i = " << i; } TEST_F(TestForDeathTest, ThreadsafeDeathTestInChangedDir) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; ChangeToRootDir(); EXPECT_EXIT(_exit(1), testing::ExitedWithCode(1), ""); ChangeToRootDir(); ASSERT_DEATH(_exit(1), ""); } TEST_F(TestForDeathTest, MixedStyles) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; EXPECT_DEATH(_exit(1), ""); testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_DEATH(_exit(1), ""); } namespace { bool pthread_flag; void SetPthreadFlag() { pthread_flag = true; } } // namespace # if GTEST_HAS_CLONE && GTEST_HAS_PTHREAD TEST_F(TestForDeathTest, DoesNotExecuteAtforkHooks) { if (!testing::GTEST_FLAG(death_test_use_fork)) { testing::GTEST_FLAG(death_test_style) = "threadsafe"; pthread_flag = false; ASSERT_EQ(0, pthread_atfork(&SetPthreadFlag, NULL, NULL)); ASSERT_DEATH(_exit(1), ""); ASSERT_FALSE(pthread_flag); } } # endif // GTEST_HAS_CLONE && GTEST_HAS_PTHREAD // Tests that a method of another class can be used in a death test. TEST_F(TestForDeathTest, MethodOfAnotherClass) { const MayDie x(true); ASSERT_DEATH(x.MemberFunction(), "MayDie\\:\\:MemberFunction"); } // Tests that a global function can be used in a death test. TEST_F(TestForDeathTest, GlobalFunction) { EXPECT_DEATH(GlobalFunction(), "GlobalFunction"); } // Tests that any value convertible to an RE works as a second // argument to EXPECT_DEATH. TEST_F(TestForDeathTest, AcceptsAnythingConvertibleToRE) { static const char regex_c_str[] = "GlobalFunction"; EXPECT_DEATH(GlobalFunction(), regex_c_str); const testing::internal::RE regex(regex_c_str); EXPECT_DEATH(GlobalFunction(), regex); # if GTEST_HAS_GLOBAL_STRING const string regex_str(regex_c_str); EXPECT_DEATH(GlobalFunction(), regex_str); # endif // GTEST_HAS_GLOBAL_STRING const ::std::string regex_std_str(regex_c_str); EXPECT_DEATH(GlobalFunction(), regex_std_str); } // Tests that a non-void function can be used in a death test. TEST_F(TestForDeathTest, NonVoidFunction) { ASSERT_DEATH(NonVoidFunction(), "NonVoidFunction"); } // Tests that functions that take parameter(s) can be used in a death test. TEST_F(TestForDeathTest, FunctionWithParameter) { EXPECT_DEATH(DieIf(true), "DieIf\\(\\)"); EXPECT_DEATH(DieIfLessThan(2, 3), "DieIfLessThan"); } // Tests that ASSERT_DEATH can be used outside a TEST, TEST_F, or test fixture. TEST_F(TestForDeathTest, OutsideFixture) { DeathTestSubroutine(); } // Tests that death tests can be done inside a loop. TEST_F(TestForDeathTest, InsideLoop) { for (int i = 0; i < 5; i++) { EXPECT_DEATH(DieIfLessThan(-1, i), "DieIfLessThan") << "where i == " << i; } } // Tests that a compound statement can be used in a death test. TEST_F(TestForDeathTest, CompoundStatement) { EXPECT_DEATH({ // NOLINT const int x = 2; const int y = x + 1; DieIfLessThan(x, y); }, "DieIfLessThan"); } // Tests that code that doesn't die causes a death test to fail. TEST_F(TestForDeathTest, DoesNotDie) { EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(DieIf(false), "DieIf"), "failed to die"); } // Tests that a death test fails when the error message isn't expected. TEST_F(TestForDeathTest, ErrorMessageMismatch) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_DEATH(DieIf(true), "DieIfLessThan") << "End of death test message."; }, "died but not with expected error"); } // On exit, *aborted will be true iff the EXPECT_DEATH() statement // aborted the function. void ExpectDeathTestHelper(bool* aborted) { *aborted = true; EXPECT_DEATH(DieIf(false), "DieIf"); // This assertion should fail. *aborted = false; } // Tests that EXPECT_DEATH doesn't abort the test on failure. TEST_F(TestForDeathTest, EXPECT_DEATH) { bool aborted = true; EXPECT_NONFATAL_FAILURE(ExpectDeathTestHelper(&aborted), "failed to die"); EXPECT_FALSE(aborted); } // Tests that ASSERT_DEATH does abort the test on failure. TEST_F(TestForDeathTest, ASSERT_DEATH) { static bool aborted; EXPECT_FATAL_FAILURE({ // NOLINT aborted = true; ASSERT_DEATH(DieIf(false), "DieIf"); // This assertion should fail. aborted = false; }, "failed to die"); EXPECT_TRUE(aborted); } // Tests that EXPECT_DEATH evaluates the arguments exactly once. TEST_F(TestForDeathTest, SingleEvaluation) { int x = 3; EXPECT_DEATH(DieIf((++x) == 4), "DieIf"); const char* regex = "DieIf"; const char* regex_save = regex; EXPECT_DEATH(DieIfLessThan(3, 4), regex++); EXPECT_EQ(regex_save + 1, regex); } // Tests that run-away death tests are reported as failures. TEST_F(TestForDeathTest, RunawayIsFailure) { EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(static_cast(0), "Foo"), "failed to die."); } // Tests that death tests report executing 'return' in the statement as // failure. TEST_F(TestForDeathTest, ReturnIsFailure) { EXPECT_FATAL_FAILURE(ASSERT_DEATH(return, "Bar"), "illegal return in test statement."); } // Tests that EXPECT_DEBUG_DEATH works as expected, // that is, in debug mode, it: // 1. Asserts on death. // 2. Has no side effect. // // And in opt mode, it: // 1. Has side effects but does not assert. TEST_F(TestForDeathTest, TestExpectDebugDeath) { int sideeffect = 0; EXPECT_DEBUG_DEATH(DieInDebugElse12(&sideeffect), "death.*DieInDebugElse12"); # ifdef NDEBUG // Checks that the assignment occurs in opt mode (sideeffect). EXPECT_EQ(12, sideeffect); # else // Checks that the assignment does not occur in dbg mode (no sideeffect). EXPECT_EQ(0, sideeffect); # endif } // Tests that ASSERT_DEBUG_DEATH works as expected // In debug mode: // 1. Asserts on debug death. // 2. Has no side effect. // // In opt mode: // 1. Has side effects and returns the expected value (12). TEST_F(TestForDeathTest, TestAssertDebugDeath) { int sideeffect = 0; ASSERT_DEBUG_DEATH({ // NOLINT // Tests that the return value is 12 in opt mode. EXPECT_EQ(12, DieInDebugElse12(&sideeffect)); // Tests that the side effect occurred in opt mode. EXPECT_EQ(12, sideeffect); }, "death.*DieInDebugElse12"); # ifdef NDEBUG // Checks that the assignment occurs in opt mode (sideeffect). EXPECT_EQ(12, sideeffect); # else // Checks that the assignment does not occur in dbg mode (no sideeffect). EXPECT_EQ(0, sideeffect); # endif } # ifndef NDEBUG void ExpectDebugDeathHelper(bool* aborted) { *aborted = true; EXPECT_DEBUG_DEATH(return, "") << "This is expected to fail."; *aborted = false; } # if GTEST_OS_WINDOWS TEST(PopUpDeathTest, DoesNotShowPopUpOnAbort) { printf("This test should be considered failing if it shows " "any pop-up dialogs.\n"); fflush(stdout); EXPECT_DEATH({ testing::GTEST_FLAG(catch_exceptions) = false; abort(); }, ""); } # endif // GTEST_OS_WINDOWS // Tests that EXPECT_DEBUG_DEATH in debug mode does not abort // the function. TEST_F(TestForDeathTest, ExpectDebugDeathDoesNotAbort) { bool aborted = true; EXPECT_NONFATAL_FAILURE(ExpectDebugDeathHelper(&aborted), ""); EXPECT_FALSE(aborted); } void AssertDebugDeathHelper(bool* aborted) { *aborted = true; ASSERT_DEBUG_DEATH(return, "") << "This is expected to fail."; *aborted = false; } // Tests that ASSERT_DEBUG_DEATH in debug mode aborts the function on // failure. TEST_F(TestForDeathTest, AssertDebugDeathAborts) { static bool aborted; aborted = false; EXPECT_FATAL_FAILURE(AssertDebugDeathHelper(&aborted), ""); EXPECT_TRUE(aborted); } # endif // _NDEBUG // Tests the *_EXIT family of macros, using a variety of predicates. static void TestExitMacros() { EXPECT_EXIT(_exit(1), testing::ExitedWithCode(1), ""); ASSERT_EXIT(_exit(42), testing::ExitedWithCode(42), ""); # if GTEST_OS_WINDOWS // Of all signals effects on the process exit code, only those of SIGABRT // are documented on Windows. // See http://msdn.microsoft.com/en-us/library/dwwzkt4c(VS.71).aspx. EXPECT_EXIT(raise(SIGABRT), testing::ExitedWithCode(3), ""); # else EXPECT_EXIT(raise(SIGKILL), testing::KilledBySignal(SIGKILL), "") << "foo"; ASSERT_EXIT(raise(SIGUSR2), testing::KilledBySignal(SIGUSR2), "") << "bar"; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_EXIT(_exit(0), testing::KilledBySignal(SIGSEGV), "") << "This failure is expected, too."; }, "This failure is expected, too."); # endif // GTEST_OS_WINDOWS EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_EXIT(raise(SIGSEGV), testing::ExitedWithCode(0), "") << "This failure is expected."; }, "This failure is expected."); } TEST_F(TestForDeathTest, ExitMacros) { TestExitMacros(); } TEST_F(TestForDeathTest, ExitMacrosUsingFork) { testing::GTEST_FLAG(death_test_use_fork) = true; TestExitMacros(); } TEST_F(TestForDeathTest, InvalidStyle) { testing::GTEST_FLAG(death_test_style) = "rococo"; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_DEATH(_exit(0), "") << "This failure is expected."; }, "This failure is expected."); } TEST_F(TestForDeathTest, DeathTestFailedOutput) { testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_NONFATAL_FAILURE( EXPECT_DEATH(DieWithMessage("death\n"), "expected message"), "Actual msg:\n" "[ DEATH ] death\n"); } TEST_F(TestForDeathTest, DeathTestUnexpectedReturnOutput) { testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_NONFATAL_FAILURE( EXPECT_DEATH({ fprintf(stderr, "returning\n"); fflush(stderr); return; }, ""), " Result: illegal return in test statement.\n" " Error msg:\n" "[ DEATH ] returning\n"); } TEST_F(TestForDeathTest, DeathTestBadExitCodeOutput) { testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_NONFATAL_FAILURE( EXPECT_EXIT(DieWithMessage("exiting with rc 1\n"), testing::ExitedWithCode(3), "expected message"), " Result: died but not with expected exit code:\n" " Exited with exit status 1\n" "Actual msg:\n" "[ DEATH ] exiting with rc 1\n"); } TEST_F(TestForDeathTest, DeathTestMultiLineMatchFail) { testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_NONFATAL_FAILURE( EXPECT_DEATH(DieWithMessage("line 1\nline 2\nline 3\n"), "line 1\nxyz\nline 3\n"), "Actual msg:\n" "[ DEATH ] line 1\n" "[ DEATH ] line 2\n" "[ DEATH ] line 3\n"); } TEST_F(TestForDeathTest, DeathTestMultiLineMatchPass) { testing::GTEST_FLAG(death_test_style) = "fast"; EXPECT_DEATH(DieWithMessage("line 1\nline 2\nline 3\n"), "line 1\nline 2\nline 3\n"); } // A DeathTestFactory that returns MockDeathTests. class MockDeathTestFactory : public DeathTestFactory { public: MockDeathTestFactory(); virtual bool Create(const char* statement, const ::testing::internal::RE* regex, const char* file, int line, DeathTest** test); // Sets the parameters for subsequent calls to Create. void SetParameters(bool create, DeathTest::TestRole role, int status, bool passed); // Accessors. int AssumeRoleCalls() const { return assume_role_calls_; } int WaitCalls() const { return wait_calls_; } int PassedCalls() const { return passed_args_.size(); } bool PassedArgument(int n) const { return passed_args_[n]; } int AbortCalls() const { return abort_args_.size(); } DeathTest::AbortReason AbortArgument(int n) const { return abort_args_[n]; } bool TestDeleted() const { return test_deleted_; } private: friend class MockDeathTest; // If true, Create will return a MockDeathTest; otherwise it returns // NULL. bool create_; // The value a MockDeathTest will return from its AssumeRole method. DeathTest::TestRole role_; // The value a MockDeathTest will return from its Wait method. int status_; // The value a MockDeathTest will return from its Passed method. bool passed_; // Number of times AssumeRole was called. int assume_role_calls_; // Number of times Wait was called. int wait_calls_; // The arguments to the calls to Passed since the last call to // SetParameters. std::vector passed_args_; // The arguments to the calls to Abort since the last call to // SetParameters. std::vector abort_args_; // True if the last MockDeathTest returned by Create has been // deleted. bool test_deleted_; }; // A DeathTest implementation useful in testing. It returns values set // at its creation from its various inherited DeathTest methods, and // reports calls to those methods to its parent MockDeathTestFactory // object. class MockDeathTest : public DeathTest { public: MockDeathTest(MockDeathTestFactory *parent, TestRole role, int status, bool passed) : parent_(parent), role_(role), status_(status), passed_(passed) { } virtual ~MockDeathTest() { parent_->test_deleted_ = true; } virtual TestRole AssumeRole() { ++parent_->assume_role_calls_; return role_; } virtual int Wait() { ++parent_->wait_calls_; return status_; } virtual bool Passed(bool exit_status_ok) { parent_->passed_args_.push_back(exit_status_ok); return passed_; } virtual void Abort(AbortReason reason) { parent_->abort_args_.push_back(reason); } private: MockDeathTestFactory* const parent_; const TestRole role_; const int status_; const bool passed_; }; // MockDeathTestFactory constructor. MockDeathTestFactory::MockDeathTestFactory() : create_(true), role_(DeathTest::OVERSEE_TEST), status_(0), passed_(true), assume_role_calls_(0), wait_calls_(0), passed_args_(), abort_args_() { } // Sets the parameters for subsequent calls to Create. void MockDeathTestFactory::SetParameters(bool create, DeathTest::TestRole role, int status, bool passed) { create_ = create; role_ = role; status_ = status; passed_ = passed; assume_role_calls_ = 0; wait_calls_ = 0; passed_args_.clear(); abort_args_.clear(); } // Sets test to NULL (if create_ is false) or to the address of a new // MockDeathTest object with parameters taken from the last call // to SetParameters (if create_ is true). Always returns true. bool MockDeathTestFactory::Create(const char* /*statement*/, const ::testing::internal::RE* /*regex*/, const char* /*file*/, int /*line*/, DeathTest** test) { test_deleted_ = false; if (create_) { *test = new MockDeathTest(this, role_, status_, passed_); } else { *test = NULL; } return true; } // A test fixture for testing the logic of the GTEST_DEATH_TEST_ macro. // It installs a MockDeathTestFactory that is used for the duration // of the test case. class MacroLogicDeathTest : public testing::Test { protected: static testing::internal::ReplaceDeathTestFactory* replacer_; static MockDeathTestFactory* factory_; static void SetUpTestCase() { factory_ = new MockDeathTestFactory; replacer_ = new testing::internal::ReplaceDeathTestFactory(factory_); } static void TearDownTestCase() { delete replacer_; replacer_ = NULL; delete factory_; factory_ = NULL; } // Runs a death test that breaks the rules by returning. Such a death // test cannot be run directly from a test routine that uses a // MockDeathTest, or the remainder of the routine will not be executed. static void RunReturningDeathTest(bool* flag) { ASSERT_DEATH({ // NOLINT *flag = true; return; }, ""); } }; testing::internal::ReplaceDeathTestFactory* MacroLogicDeathTest::replacer_ = NULL; MockDeathTestFactory* MacroLogicDeathTest::factory_ = NULL; // Test that nothing happens when the factory doesn't return a DeathTest: TEST_F(MacroLogicDeathTest, NothingHappens) { bool flag = false; factory_->SetParameters(false, DeathTest::OVERSEE_TEST, 0, true); EXPECT_DEATH(flag = true, ""); EXPECT_FALSE(flag); EXPECT_EQ(0, factory_->AssumeRoleCalls()); EXPECT_EQ(0, factory_->WaitCalls()); EXPECT_EQ(0, factory_->PassedCalls()); EXPECT_EQ(0, factory_->AbortCalls()); EXPECT_FALSE(factory_->TestDeleted()); } // Test that the parent process doesn't run the death test code, // and that the Passed method returns false when the (simulated) // child process exits with status 0: TEST_F(MacroLogicDeathTest, ChildExitsSuccessfully) { bool flag = false; factory_->SetParameters(true, DeathTest::OVERSEE_TEST, 0, true); EXPECT_DEATH(flag = true, ""); EXPECT_FALSE(flag); EXPECT_EQ(1, factory_->AssumeRoleCalls()); EXPECT_EQ(1, factory_->WaitCalls()); ASSERT_EQ(1, factory_->PassedCalls()); EXPECT_FALSE(factory_->PassedArgument(0)); EXPECT_EQ(0, factory_->AbortCalls()); EXPECT_TRUE(factory_->TestDeleted()); } // Tests that the Passed method was given the argument "true" when // the (simulated) child process exits with status 1: TEST_F(MacroLogicDeathTest, ChildExitsUnsuccessfully) { bool flag = false; factory_->SetParameters(true, DeathTest::OVERSEE_TEST, 1, true); EXPECT_DEATH(flag = true, ""); EXPECT_FALSE(flag); EXPECT_EQ(1, factory_->AssumeRoleCalls()); EXPECT_EQ(1, factory_->WaitCalls()); ASSERT_EQ(1, factory_->PassedCalls()); EXPECT_TRUE(factory_->PassedArgument(0)); EXPECT_EQ(0, factory_->AbortCalls()); EXPECT_TRUE(factory_->TestDeleted()); } // Tests that the (simulated) child process executes the death test // code, and is aborted with the correct AbortReason if it // executes a return statement. TEST_F(MacroLogicDeathTest, ChildPerformsReturn) { bool flag = false; factory_->SetParameters(true, DeathTest::EXECUTE_TEST, 0, true); RunReturningDeathTest(&flag); EXPECT_TRUE(flag); EXPECT_EQ(1, factory_->AssumeRoleCalls()); EXPECT_EQ(0, factory_->WaitCalls()); EXPECT_EQ(0, factory_->PassedCalls()); EXPECT_EQ(1, factory_->AbortCalls()); EXPECT_EQ(DeathTest::TEST_ENCOUNTERED_RETURN_STATEMENT, factory_->AbortArgument(0)); EXPECT_TRUE(factory_->TestDeleted()); } // Tests that the (simulated) child process is aborted with the // correct AbortReason if it does not die. TEST_F(MacroLogicDeathTest, ChildDoesNotDie) { bool flag = false; factory_->SetParameters(true, DeathTest::EXECUTE_TEST, 0, true); EXPECT_DEATH(flag = true, ""); EXPECT_TRUE(flag); EXPECT_EQ(1, factory_->AssumeRoleCalls()); EXPECT_EQ(0, factory_->WaitCalls()); EXPECT_EQ(0, factory_->PassedCalls()); // This time there are two calls to Abort: one since the test didn't // die, and another from the ReturnSentinel when it's destroyed. The // sentinel normally isn't destroyed if a test doesn't die, since // _exit(2) is called in that case by ForkingDeathTest, but not by // our MockDeathTest. ASSERT_EQ(2, factory_->AbortCalls()); EXPECT_EQ(DeathTest::TEST_DID_NOT_DIE, factory_->AbortArgument(0)); EXPECT_EQ(DeathTest::TEST_ENCOUNTERED_RETURN_STATEMENT, factory_->AbortArgument(1)); EXPECT_TRUE(factory_->TestDeleted()); } // Tests that a successful death test does not register a successful // test part. TEST(SuccessRegistrationDeathTest, NoSuccessPart) { EXPECT_DEATH(_exit(1), ""); EXPECT_EQ(0, GetUnitTestImpl()->current_test_result()->total_part_count()); } TEST(StreamingAssertionsDeathTest, DeathTest) { EXPECT_DEATH(_exit(1), "") << "unexpected failure"; ASSERT_DEATH(_exit(1), "") << "unexpected failure"; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_DEATH(_exit(0), "") << "expected failure"; }, "expected failure"); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_DEATH(_exit(0), "") << "expected failure"; }, "expected failure"); } // Tests that GetLastErrnoDescription returns an empty string when the // last error is 0 and non-empty string when it is non-zero. TEST(GetLastErrnoDescription, GetLastErrnoDescriptionWorks) { errno = ENOENT; EXPECT_STRNE("", GetLastErrnoDescription().c_str()); errno = 0; EXPECT_STREQ("", GetLastErrnoDescription().c_str()); } # if GTEST_OS_WINDOWS TEST(AutoHandleTest, AutoHandleWorks) { HANDLE handle = ::CreateEvent(NULL, FALSE, FALSE, NULL); ASSERT_NE(INVALID_HANDLE_VALUE, handle); // Tests that the AutoHandle is correctly initialized with a handle. testing::internal::AutoHandle auto_handle(handle); EXPECT_EQ(handle, auto_handle.Get()); // Tests that Reset assigns INVALID_HANDLE_VALUE. // Note that this cannot verify whether the original handle is closed. auto_handle.Reset(); EXPECT_EQ(INVALID_HANDLE_VALUE, auto_handle.Get()); // Tests that Reset assigns the new handle. // Note that this cannot verify whether the original handle is closed. handle = ::CreateEvent(NULL, FALSE, FALSE, NULL); ASSERT_NE(INVALID_HANDLE_VALUE, handle); auto_handle.Reset(handle); EXPECT_EQ(handle, auto_handle.Get()); // Tests that AutoHandle contains INVALID_HANDLE_VALUE by default. testing::internal::AutoHandle auto_handle2; EXPECT_EQ(INVALID_HANDLE_VALUE, auto_handle2.Get()); } # endif // GTEST_OS_WINDOWS # if GTEST_OS_WINDOWS typedef unsigned __int64 BiggestParsable; typedef signed __int64 BiggestSignedParsable; const BiggestParsable kBiggestParsableMax = ULLONG_MAX; const BiggestSignedParsable kBiggestSignedParsableMax = LLONG_MAX; # else typedef unsigned long long BiggestParsable; typedef signed long long BiggestSignedParsable; const BiggestParsable kBiggestParsableMax = ::std::numeric_limits::max(); const BiggestSignedParsable kBiggestSignedParsableMax = ::std::numeric_limits::max(); # endif // GTEST_OS_WINDOWS TEST(ParseNaturalNumberTest, RejectsInvalidFormat) { BiggestParsable result = 0; // Rejects non-numbers. EXPECT_FALSE(ParseNaturalNumber(String("non-number string"), &result)); // Rejects numbers with whitespace prefix. EXPECT_FALSE(ParseNaturalNumber(String(" 123"), &result)); // Rejects negative numbers. EXPECT_FALSE(ParseNaturalNumber(String("-123"), &result)); // Rejects numbers starting with a plus sign. EXPECT_FALSE(ParseNaturalNumber(String("+123"), &result)); errno = 0; } TEST(ParseNaturalNumberTest, RejectsOverflownNumbers) { BiggestParsable result = 0; EXPECT_FALSE(ParseNaturalNumber(String("99999999999999999999999"), &result)); signed char char_result = 0; EXPECT_FALSE(ParseNaturalNumber(String("200"), &char_result)); errno = 0; } TEST(ParseNaturalNumberTest, AcceptsValidNumbers) { BiggestParsable result = 0; result = 0; ASSERT_TRUE(ParseNaturalNumber(String("123"), &result)); EXPECT_EQ(123U, result); // Check 0 as an edge case. result = 1; ASSERT_TRUE(ParseNaturalNumber(String("0"), &result)); EXPECT_EQ(0U, result); result = 1; ASSERT_TRUE(ParseNaturalNumber(String("00000"), &result)); EXPECT_EQ(0U, result); } TEST(ParseNaturalNumberTest, AcceptsTypeLimits) { Message msg; msg << kBiggestParsableMax; BiggestParsable result = 0; EXPECT_TRUE(ParseNaturalNumber(msg.GetString(), &result)); EXPECT_EQ(kBiggestParsableMax, result); Message msg2; msg2 << kBiggestSignedParsableMax; BiggestSignedParsable signed_result = 0; EXPECT_TRUE(ParseNaturalNumber(msg2.GetString(), &signed_result)); EXPECT_EQ(kBiggestSignedParsableMax, signed_result); Message msg3; msg3 << INT_MAX; int int_result = 0; EXPECT_TRUE(ParseNaturalNumber(msg3.GetString(), &int_result)); EXPECT_EQ(INT_MAX, int_result); Message msg4; msg4 << UINT_MAX; unsigned int uint_result = 0; EXPECT_TRUE(ParseNaturalNumber(msg4.GetString(), &uint_result)); EXPECT_EQ(UINT_MAX, uint_result); } TEST(ParseNaturalNumberTest, WorksForShorterIntegers) { short short_result = 0; ASSERT_TRUE(ParseNaturalNumber(String("123"), &short_result)); EXPECT_EQ(123, short_result); signed char char_result = 0; ASSERT_TRUE(ParseNaturalNumber(String("123"), &char_result)); EXPECT_EQ(123, char_result); } # if GTEST_OS_WINDOWS TEST(EnvironmentTest, HandleFitsIntoSizeT) { // TODO(vladl@google.com): Remove this test after this condition is verified // in a static assertion in gtest-death-test.cc in the function // GetStatusFileDescriptor. ASSERT_TRUE(sizeof(HANDLE) <= sizeof(size_t)); } # endif // GTEST_OS_WINDOWS // Tests that EXPECT_DEATH_IF_SUPPORTED/ASSERT_DEATH_IF_SUPPORTED trigger // failures when death tests are available on the system. TEST(ConditionalDeathMacrosDeathTest, ExpectsDeathWhenDeathTestsAvailable) { EXPECT_DEATH_IF_SUPPORTED(DieInside("CondDeathTestExpectMacro"), "death inside CondDeathTestExpectMacro"); ASSERT_DEATH_IF_SUPPORTED(DieInside("CondDeathTestAssertMacro"), "death inside CondDeathTestAssertMacro"); // Empty statement will not crash, which must trigger a failure. EXPECT_NONFATAL_FAILURE(EXPECT_DEATH_IF_SUPPORTED(;, ""), ""); EXPECT_FATAL_FAILURE(ASSERT_DEATH_IF_SUPPORTED(;, ""), ""); } #else using testing::internal::CaptureStderr; using testing::internal::GetCapturedStderr; using testing::internal::String; // Tests that EXPECT_DEATH_IF_SUPPORTED/ASSERT_DEATH_IF_SUPPORTED are still // defined but do not trigger failures when death tests are not available on // the system. TEST(ConditionalDeathMacrosTest, WarnsWhenDeathTestsNotAvailable) { // Empty statement will not crash, but that should not trigger a failure // when death tests are not supported. CaptureStderr(); EXPECT_DEATH_IF_SUPPORTED(;, ""); String output = GetCapturedStderr(); ASSERT_TRUE(NULL != strstr(output.c_str(), "Death tests are not supported on this platform")); ASSERT_TRUE(NULL != strstr(output.c_str(), ";")); // The streamed message should not be printed as there is no test failure. CaptureStderr(); EXPECT_DEATH_IF_SUPPORTED(;, "") << "streamed message"; output = GetCapturedStderr(); ASSERT_TRUE(NULL == strstr(output.c_str(), "streamed message")); CaptureStderr(); ASSERT_DEATH_IF_SUPPORTED(;, ""); // NOLINT output = GetCapturedStderr(); ASSERT_TRUE(NULL != strstr(output.c_str(), "Death tests are not supported on this platform")); ASSERT_TRUE(NULL != strstr(output.c_str(), ";")); CaptureStderr(); ASSERT_DEATH_IF_SUPPORTED(;, "") << "streamed message"; // NOLINT output = GetCapturedStderr(); ASSERT_TRUE(NULL == strstr(output.c_str(), "streamed message")); } void FuncWithAssert(int* n) { ASSERT_DEATH_IF_SUPPORTED(return;, ""); (*n)++; } // Tests that ASSERT_DEATH_IF_SUPPORTED does not return from the current // function (as ASSERT_DEATH does) if death tests are not supported. TEST(ConditionalDeathMacrosTest, AssertDeatDoesNotReturnhIfUnsupported) { int n = 0; FuncWithAssert(&n); EXPECT_EQ(1, n); } #endif // GTEST_HAS_DEATH_TEST // Tests that the death test macros expand to code which may or may not // be followed by operator<<, and that in either case the complete text // comprises only a single C++ statement. // // The syntax should work whether death tests are available or not. TEST(ConditionalDeathMacrosSyntaxDeathTest, SingleStatement) { if (AlwaysFalse()) // This would fail if executed; this is a compilation test only ASSERT_DEATH_IF_SUPPORTED(return, ""); if (AlwaysTrue()) EXPECT_DEATH_IF_SUPPORTED(_exit(1), ""); else // This empty "else" branch is meant to ensure that EXPECT_DEATH // doesn't expand into an "if" statement without an "else" ; // NOLINT if (AlwaysFalse()) ASSERT_DEATH_IF_SUPPORTED(return, "") << "did not die"; if (AlwaysFalse()) ; // NOLINT else EXPECT_DEATH_IF_SUPPORTED(_exit(1), "") << 1 << 2 << 3; } // Tests that conditional death test macros expand to code which interacts // well with switch statements. TEST(ConditionalDeathMacrosSyntaxDeathTest, SwitchStatement) { // Microsoft compiler usually complains about switch statements without // case labels. We suppress that warning for this test. #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4065) #endif // _MSC_VER switch (0) default: ASSERT_DEATH_IF_SUPPORTED(_exit(1), "") << "exit in default switch handler"; switch (0) case 0: EXPECT_DEATH_IF_SUPPORTED(_exit(1), "") << "exit in switch case"; #ifdef _MSC_VER # pragma warning(pop) #endif // _MSC_VER } // Tests that a test case whose name ends with "DeathTest" works fine // on Windows. TEST(NotADeathTest, Test) { SUCCEED(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-filepath_test.cc0000600000175000017500000005710311561126632024713 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: keith.ray@gmail.com (Keith Ray) // // Google Test filepath utilities // // This file tests classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included from gtest_unittest.cc, to avoid changing // build or make-files for some existing Google Test clients. Do not // #include this file anywhere else! #include "gtest/internal/gtest-filepath.h" #include "gtest/gtest.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ #if GTEST_OS_WINDOWS_MOBILE # include // NOLINT #elif GTEST_OS_WINDOWS # include // NOLINT #endif // GTEST_OS_WINDOWS_MOBILE namespace testing { namespace internal { namespace { #if GTEST_OS_WINDOWS_MOBILE // TODO(wan@google.com): Move these to the POSIX adapter section in // gtest-port.h. // Windows CE doesn't have the remove C function. int remove(const char* path) { LPCWSTR wpath = String::AnsiToUtf16(path); int ret = DeleteFile(wpath) ? 0 : -1; delete [] wpath; return ret; } // Windows CE doesn't have the _rmdir C function. int _rmdir(const char* path) { FilePath filepath(path); LPCWSTR wpath = String::AnsiToUtf16( filepath.RemoveTrailingPathSeparator().c_str()); int ret = RemoveDirectory(wpath) ? 0 : -1; delete [] wpath; return ret; } #else TEST(GetCurrentDirTest, ReturnsCurrentDir) { const FilePath original_dir = FilePath::GetCurrentDir(); EXPECT_FALSE(original_dir.IsEmpty()); posix::ChDir(GTEST_PATH_SEP_); const FilePath cwd = FilePath::GetCurrentDir(); posix::ChDir(original_dir.c_str()); # if GTEST_OS_WINDOWS // Skips the ":". const char* const cwd_without_drive = strchr(cwd.c_str(), ':'); ASSERT_TRUE(cwd_without_drive != NULL); EXPECT_STREQ(GTEST_PATH_SEP_, cwd_without_drive + 1); # else EXPECT_STREQ(GTEST_PATH_SEP_, cwd.c_str()); # endif } #endif // GTEST_OS_WINDOWS_MOBILE TEST(IsEmptyTest, ReturnsTrueForEmptyPath) { EXPECT_TRUE(FilePath("").IsEmpty()); EXPECT_TRUE(FilePath(NULL).IsEmpty()); } TEST(IsEmptyTest, ReturnsFalseForNonEmptyPath) { EXPECT_FALSE(FilePath("a").IsEmpty()); EXPECT_FALSE(FilePath(".").IsEmpty()); EXPECT_FALSE(FilePath("a/b").IsEmpty()); EXPECT_FALSE(FilePath("a\\b\\").IsEmpty()); } // RemoveDirectoryName "" -> "" TEST(RemoveDirectoryNameTest, WhenEmptyName) { EXPECT_STREQ("", FilePath("").RemoveDirectoryName().c_str()); } // RemoveDirectoryName "afile" -> "afile" TEST(RemoveDirectoryNameTest, ButNoDirectory) { EXPECT_STREQ("afile", FilePath("afile").RemoveDirectoryName().c_str()); } // RemoveDirectoryName "/afile" -> "afile" TEST(RemoveDirectoryNameTest, RootFileShouldGiveFileName) { EXPECT_STREQ("afile", FilePath(GTEST_PATH_SEP_ "afile").RemoveDirectoryName().c_str()); } // RemoveDirectoryName "adir/" -> "" TEST(RemoveDirectoryNameTest, WhereThereIsNoFileName) { EXPECT_STREQ("", FilePath("adir" GTEST_PATH_SEP_).RemoveDirectoryName().c_str()); } // RemoveDirectoryName "adir/afile" -> "afile" TEST(RemoveDirectoryNameTest, ShouldGiveFileName) { EXPECT_STREQ("afile", FilePath("adir" GTEST_PATH_SEP_ "afile").RemoveDirectoryName().c_str()); } // RemoveDirectoryName "adir/subdir/afile" -> "afile" TEST(RemoveDirectoryNameTest, ShouldAlsoGiveFileName) { EXPECT_STREQ("afile", FilePath("adir" GTEST_PATH_SEP_ "subdir" GTEST_PATH_SEP_ "afile") .RemoveDirectoryName().c_str()); } #if GTEST_HAS_ALT_PATH_SEP_ // Tests that RemoveDirectoryName() works with the alternate separator // on Windows. // RemoveDirectoryName("/afile") -> "afile" TEST(RemoveDirectoryNameTest, RootFileShouldGiveFileNameForAlternateSeparator) { EXPECT_STREQ("afile", FilePath("/afile").RemoveDirectoryName().c_str()); } // RemoveDirectoryName("adir/") -> "" TEST(RemoveDirectoryNameTest, WhereThereIsNoFileNameForAlternateSeparator) { EXPECT_STREQ("", FilePath("adir/").RemoveDirectoryName().c_str()); } // RemoveDirectoryName("adir/afile") -> "afile" TEST(RemoveDirectoryNameTest, ShouldGiveFileNameForAlternateSeparator) { EXPECT_STREQ("afile", FilePath("adir/afile").RemoveDirectoryName().c_str()); } // RemoveDirectoryName("adir/subdir/afile") -> "afile" TEST(RemoveDirectoryNameTest, ShouldAlsoGiveFileNameForAlternateSeparator) { EXPECT_STREQ("afile", FilePath("adir/subdir/afile").RemoveDirectoryName().c_str()); } #endif // RemoveFileName "" -> "./" TEST(RemoveFileNameTest, EmptyName) { #if GTEST_OS_WINDOWS_MOBILE // On Windows CE, we use the root as the current directory. EXPECT_STREQ(GTEST_PATH_SEP_, FilePath("").RemoveFileName().c_str()); #else EXPECT_STREQ("." GTEST_PATH_SEP_, FilePath("").RemoveFileName().c_str()); #endif } // RemoveFileName "adir/" -> "adir/" TEST(RemoveFileNameTest, ButNoFile) { EXPECT_STREQ("adir" GTEST_PATH_SEP_, FilePath("adir" GTEST_PATH_SEP_).RemoveFileName().c_str()); } // RemoveFileName "adir/afile" -> "adir/" TEST(RemoveFileNameTest, GivesDirName) { EXPECT_STREQ("adir" GTEST_PATH_SEP_, FilePath("adir" GTEST_PATH_SEP_ "afile") .RemoveFileName().c_str()); } // RemoveFileName "adir/subdir/afile" -> "adir/subdir/" TEST(RemoveFileNameTest, GivesDirAndSubDirName) { EXPECT_STREQ("adir" GTEST_PATH_SEP_ "subdir" GTEST_PATH_SEP_, FilePath("adir" GTEST_PATH_SEP_ "subdir" GTEST_PATH_SEP_ "afile") .RemoveFileName().c_str()); } // RemoveFileName "/afile" -> "/" TEST(RemoveFileNameTest, GivesRootDir) { EXPECT_STREQ(GTEST_PATH_SEP_, FilePath(GTEST_PATH_SEP_ "afile").RemoveFileName().c_str()); } #if GTEST_HAS_ALT_PATH_SEP_ // Tests that RemoveFileName() works with the alternate separator on // Windows. // RemoveFileName("adir/") -> "adir/" TEST(RemoveFileNameTest, ButNoFileForAlternateSeparator) { EXPECT_STREQ("adir" GTEST_PATH_SEP_, FilePath("adir/").RemoveFileName().c_str()); } // RemoveFileName("adir/afile") -> "adir/" TEST(RemoveFileNameTest, GivesDirNameForAlternateSeparator) { EXPECT_STREQ("adir" GTEST_PATH_SEP_, FilePath("adir/afile").RemoveFileName().c_str()); } // RemoveFileName("adir/subdir/afile") -> "adir/subdir/" TEST(RemoveFileNameTest, GivesDirAndSubDirNameForAlternateSeparator) { EXPECT_STREQ("adir" GTEST_PATH_SEP_ "subdir" GTEST_PATH_SEP_, FilePath("adir/subdir/afile").RemoveFileName().c_str()); } // RemoveFileName("/afile") -> "\" TEST(RemoveFileNameTest, GivesRootDirForAlternateSeparator) { EXPECT_STREQ(GTEST_PATH_SEP_, FilePath("/afile").RemoveFileName().c_str()); } #endif TEST(MakeFileNameTest, GenerateWhenNumberIsZero) { FilePath actual = FilePath::MakeFileName(FilePath("foo"), FilePath("bar"), 0, "xml"); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar.xml", actual.c_str()); } TEST(MakeFileNameTest, GenerateFileNameNumberGtZero) { FilePath actual = FilePath::MakeFileName(FilePath("foo"), FilePath("bar"), 12, "xml"); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar_12.xml", actual.c_str()); } TEST(MakeFileNameTest, GenerateFileNameWithSlashNumberIsZero) { FilePath actual = FilePath::MakeFileName(FilePath("foo" GTEST_PATH_SEP_), FilePath("bar"), 0, "xml"); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar.xml", actual.c_str()); } TEST(MakeFileNameTest, GenerateFileNameWithSlashNumberGtZero) { FilePath actual = FilePath::MakeFileName(FilePath("foo" GTEST_PATH_SEP_), FilePath("bar"), 12, "xml"); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar_12.xml", actual.c_str()); } TEST(MakeFileNameTest, GenerateWhenNumberIsZeroAndDirIsEmpty) { FilePath actual = FilePath::MakeFileName(FilePath(""), FilePath("bar"), 0, "xml"); EXPECT_STREQ("bar.xml", actual.c_str()); } TEST(MakeFileNameTest, GenerateWhenNumberIsNotZeroAndDirIsEmpty) { FilePath actual = FilePath::MakeFileName(FilePath(""), FilePath("bar"), 14, "xml"); EXPECT_STREQ("bar_14.xml", actual.c_str()); } TEST(ConcatPathsTest, WorksWhenDirDoesNotEndWithPathSep) { FilePath actual = FilePath::ConcatPaths(FilePath("foo"), FilePath("bar.xml")); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar.xml", actual.c_str()); } TEST(ConcatPathsTest, WorksWhenPath1EndsWithPathSep) { FilePath actual = FilePath::ConcatPaths(FilePath("foo" GTEST_PATH_SEP_), FilePath("bar.xml")); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar.xml", actual.c_str()); } TEST(ConcatPathsTest, Path1BeingEmpty) { FilePath actual = FilePath::ConcatPaths(FilePath(""), FilePath("bar.xml")); EXPECT_STREQ("bar.xml", actual.c_str()); } TEST(ConcatPathsTest, Path2BeingEmpty) { FilePath actual = FilePath::ConcatPaths(FilePath("foo"), FilePath("")); EXPECT_STREQ("foo" GTEST_PATH_SEP_, actual.c_str()); } TEST(ConcatPathsTest, BothPathBeingEmpty) { FilePath actual = FilePath::ConcatPaths(FilePath(""), FilePath("")); EXPECT_STREQ("", actual.c_str()); } TEST(ConcatPathsTest, Path1ContainsPathSep) { FilePath actual = FilePath::ConcatPaths(FilePath("foo" GTEST_PATH_SEP_ "bar"), FilePath("foobar.xml")); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar" GTEST_PATH_SEP_ "foobar.xml", actual.c_str()); } TEST(ConcatPathsTest, Path2ContainsPathSep) { FilePath actual = FilePath::ConcatPaths( FilePath("foo" GTEST_PATH_SEP_), FilePath("bar" GTEST_PATH_SEP_ "bar.xml")); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar" GTEST_PATH_SEP_ "bar.xml", actual.c_str()); } TEST(ConcatPathsTest, Path2EndsWithPathSep) { FilePath actual = FilePath::ConcatPaths(FilePath("foo"), FilePath("bar" GTEST_PATH_SEP_)); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar" GTEST_PATH_SEP_, actual.c_str()); } // RemoveTrailingPathSeparator "" -> "" TEST(RemoveTrailingPathSeparatorTest, EmptyString) { EXPECT_STREQ("", FilePath("").RemoveTrailingPathSeparator().c_str()); } // RemoveTrailingPathSeparator "foo" -> "foo" TEST(RemoveTrailingPathSeparatorTest, FileNoSlashString) { EXPECT_STREQ("foo", FilePath("foo").RemoveTrailingPathSeparator().c_str()); } // RemoveTrailingPathSeparator "foo/" -> "foo" TEST(RemoveTrailingPathSeparatorTest, ShouldRemoveTrailingSeparator) { EXPECT_STREQ( "foo", FilePath("foo" GTEST_PATH_SEP_).RemoveTrailingPathSeparator().c_str()); #if GTEST_HAS_ALT_PATH_SEP_ EXPECT_STREQ("foo", FilePath("foo/").RemoveTrailingPathSeparator().c_str()); #endif } // RemoveTrailingPathSeparator "foo/bar/" -> "foo/bar/" TEST(RemoveTrailingPathSeparatorTest, ShouldRemoveLastSeparator) { EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar", FilePath("foo" GTEST_PATH_SEP_ "bar" GTEST_PATH_SEP_) .RemoveTrailingPathSeparator().c_str()); } // RemoveTrailingPathSeparator "foo/bar" -> "foo/bar" TEST(RemoveTrailingPathSeparatorTest, ShouldReturnUnmodified) { EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar", FilePath("foo" GTEST_PATH_SEP_ "bar") .RemoveTrailingPathSeparator().c_str()); } TEST(DirectoryTest, RootDirectoryExists) { #if GTEST_OS_WINDOWS // We are on Windows. char current_drive[_MAX_PATH]; // NOLINT current_drive[0] = static_cast(_getdrive() + 'A' - 1); current_drive[1] = ':'; current_drive[2] = '\\'; current_drive[3] = '\0'; EXPECT_TRUE(FilePath(current_drive).DirectoryExists()); #else EXPECT_TRUE(FilePath("/").DirectoryExists()); #endif // GTEST_OS_WINDOWS } #if GTEST_OS_WINDOWS TEST(DirectoryTest, RootOfWrongDriveDoesNotExists) { const int saved_drive_ = _getdrive(); // Find a drive that doesn't exist. Start with 'Z' to avoid common ones. for (char drive = 'Z'; drive >= 'A'; drive--) if (_chdrive(drive - 'A' + 1) == -1) { char non_drive[_MAX_PATH]; // NOLINT non_drive[0] = drive; non_drive[1] = ':'; non_drive[2] = '\\'; non_drive[3] = '\0'; EXPECT_FALSE(FilePath(non_drive).DirectoryExists()); break; } _chdrive(saved_drive_); } #endif // GTEST_OS_WINDOWS #if !GTEST_OS_WINDOWS_MOBILE // Windows CE _does_ consider an empty directory to exist. TEST(DirectoryTest, EmptyPathDirectoryDoesNotExist) { EXPECT_FALSE(FilePath("").DirectoryExists()); } #endif // !GTEST_OS_WINDOWS_MOBILE TEST(DirectoryTest, CurrentDirectoryExists) { #if GTEST_OS_WINDOWS // We are on Windows. # ifndef _WIN32_CE // Windows CE doesn't have a current directory. EXPECT_TRUE(FilePath(".").DirectoryExists()); EXPECT_TRUE(FilePath(".\\").DirectoryExists()); # endif // _WIN32_CE #else EXPECT_TRUE(FilePath(".").DirectoryExists()); EXPECT_TRUE(FilePath("./").DirectoryExists()); #endif // GTEST_OS_WINDOWS } TEST(NormalizeTest, NullStringsEqualEmptyDirectory) { EXPECT_STREQ("", FilePath(NULL).c_str()); EXPECT_STREQ("", FilePath(String(NULL)).c_str()); } // "foo/bar" == foo//bar" == "foo///bar" TEST(NormalizeTest, MultipleConsecutiveSepaparatorsInMidstring) { EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar", FilePath("foo" GTEST_PATH_SEP_ "bar").c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar", FilePath("foo" GTEST_PATH_SEP_ GTEST_PATH_SEP_ "bar").c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_ "bar", FilePath("foo" GTEST_PATH_SEP_ GTEST_PATH_SEP_ GTEST_PATH_SEP_ "bar").c_str()); } // "/bar" == //bar" == "///bar" TEST(NormalizeTest, MultipleConsecutiveSepaparatorsAtStringStart) { EXPECT_STREQ(GTEST_PATH_SEP_ "bar", FilePath(GTEST_PATH_SEP_ "bar").c_str()); EXPECT_STREQ(GTEST_PATH_SEP_ "bar", FilePath(GTEST_PATH_SEP_ GTEST_PATH_SEP_ "bar").c_str()); EXPECT_STREQ(GTEST_PATH_SEP_ "bar", FilePath(GTEST_PATH_SEP_ GTEST_PATH_SEP_ GTEST_PATH_SEP_ "bar").c_str()); } // "foo/" == foo//" == "foo///" TEST(NormalizeTest, MultipleConsecutiveSepaparatorsAtStringEnd) { EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo" GTEST_PATH_SEP_).c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo" GTEST_PATH_SEP_ GTEST_PATH_SEP_).c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo" GTEST_PATH_SEP_ GTEST_PATH_SEP_ GTEST_PATH_SEP_).c_str()); } #if GTEST_HAS_ALT_PATH_SEP_ // Tests that separators at the end of the string are normalized // regardless of their combination (e.g. "foo\" =="foo/\" == // "foo\\/"). TEST(NormalizeTest, MixAlternateSeparatorAtStringEnd) { EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo/").c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo" GTEST_PATH_SEP_ "/").c_str()); EXPECT_STREQ("foo" GTEST_PATH_SEP_, FilePath("foo//" GTEST_PATH_SEP_).c_str()); } #endif TEST(AssignmentOperatorTest, DefaultAssignedToNonDefault) { FilePath default_path; FilePath non_default_path("path"); non_default_path = default_path; EXPECT_STREQ("", non_default_path.c_str()); EXPECT_STREQ("", default_path.c_str()); // RHS var is unchanged. } TEST(AssignmentOperatorTest, NonDefaultAssignedToDefault) { FilePath non_default_path("path"); FilePath default_path; default_path = non_default_path; EXPECT_STREQ("path", default_path.c_str()); EXPECT_STREQ("path", non_default_path.c_str()); // RHS var is unchanged. } TEST(AssignmentOperatorTest, ConstAssignedToNonConst) { const FilePath const_default_path("const_path"); FilePath non_default_path("path"); non_default_path = const_default_path; EXPECT_STREQ("const_path", non_default_path.c_str()); } class DirectoryCreationTest : public Test { protected: virtual void SetUp() { testdata_path_.Set(FilePath(String::Format("%s%s%s", TempDir().c_str(), GetCurrentExecutableName().c_str(), "_directory_creation" GTEST_PATH_SEP_ "test" GTEST_PATH_SEP_))); testdata_file_.Set(testdata_path_.RemoveTrailingPathSeparator()); unique_file0_.Set(FilePath::MakeFileName(testdata_path_, FilePath("unique"), 0, "txt")); unique_file1_.Set(FilePath::MakeFileName(testdata_path_, FilePath("unique"), 1, "txt")); remove(testdata_file_.c_str()); remove(unique_file0_.c_str()); remove(unique_file1_.c_str()); posix::RmDir(testdata_path_.c_str()); } virtual void TearDown() { remove(testdata_file_.c_str()); remove(unique_file0_.c_str()); remove(unique_file1_.c_str()); posix::RmDir(testdata_path_.c_str()); } String TempDir() const { #if GTEST_OS_WINDOWS_MOBILE return String("\\temp\\"); #elif GTEST_OS_WINDOWS const char* temp_dir = posix::GetEnv("TEMP"); if (temp_dir == NULL || temp_dir[0] == '\0') return String("\\temp\\"); else if (String(temp_dir).EndsWith("\\")) return String(temp_dir); else return String::Format("%s\\", temp_dir); #else return String("/tmp/"); #endif // GTEST_OS_WINDOWS_MOBILE } void CreateTextFile(const char* filename) { FILE* f = posix::FOpen(filename, "w"); fprintf(f, "text\n"); fclose(f); } // Strings representing a directory and a file, with identical paths // except for the trailing separator character that distinquishes // a directory named 'test' from a file named 'test'. Example names: FilePath testdata_path_; // "/tmp/directory_creation/test/" FilePath testdata_file_; // "/tmp/directory_creation/test" FilePath unique_file0_; // "/tmp/directory_creation/test/unique.txt" FilePath unique_file1_; // "/tmp/directory_creation/test/unique_1.txt" }; TEST_F(DirectoryCreationTest, CreateDirectoriesRecursively) { EXPECT_FALSE(testdata_path_.DirectoryExists()) << testdata_path_.c_str(); EXPECT_TRUE(testdata_path_.CreateDirectoriesRecursively()); EXPECT_TRUE(testdata_path_.DirectoryExists()); } TEST_F(DirectoryCreationTest, CreateDirectoriesForAlreadyExistingPath) { EXPECT_FALSE(testdata_path_.DirectoryExists()) << testdata_path_.c_str(); EXPECT_TRUE(testdata_path_.CreateDirectoriesRecursively()); // Call 'create' again... should still succeed. EXPECT_TRUE(testdata_path_.CreateDirectoriesRecursively()); } TEST_F(DirectoryCreationTest, CreateDirectoriesAndUniqueFilename) { FilePath file_path(FilePath::GenerateUniqueFileName(testdata_path_, FilePath("unique"), "txt")); EXPECT_STREQ(unique_file0_.c_str(), file_path.c_str()); EXPECT_FALSE(file_path.FileOrDirectoryExists()); // file not there testdata_path_.CreateDirectoriesRecursively(); EXPECT_FALSE(file_path.FileOrDirectoryExists()); // file still not there CreateTextFile(file_path.c_str()); EXPECT_TRUE(file_path.FileOrDirectoryExists()); FilePath file_path2(FilePath::GenerateUniqueFileName(testdata_path_, FilePath("unique"), "txt")); EXPECT_STREQ(unique_file1_.c_str(), file_path2.c_str()); EXPECT_FALSE(file_path2.FileOrDirectoryExists()); // file not there CreateTextFile(file_path2.c_str()); EXPECT_TRUE(file_path2.FileOrDirectoryExists()); } TEST_F(DirectoryCreationTest, CreateDirectoriesFail) { // force a failure by putting a file where we will try to create a directory. CreateTextFile(testdata_file_.c_str()); EXPECT_TRUE(testdata_file_.FileOrDirectoryExists()); EXPECT_FALSE(testdata_file_.DirectoryExists()); EXPECT_FALSE(testdata_file_.CreateDirectoriesRecursively()); } TEST(NoDirectoryCreationTest, CreateNoDirectoriesForDefaultXmlFile) { const FilePath test_detail_xml("test_detail.xml"); EXPECT_FALSE(test_detail_xml.CreateDirectoriesRecursively()); } TEST(FilePathTest, DefaultConstructor) { FilePath fp; EXPECT_STREQ("", fp.c_str()); } TEST(FilePathTest, CharAndCopyConstructors) { const FilePath fp("spicy"); EXPECT_STREQ("spicy", fp.c_str()); const FilePath fp_copy(fp); EXPECT_STREQ("spicy", fp_copy.c_str()); } TEST(FilePathTest, StringConstructor) { const FilePath fp(String("cider")); EXPECT_STREQ("cider", fp.c_str()); } TEST(FilePathTest, Set) { const FilePath apple("apple"); FilePath mac("mac"); mac.Set(apple); // Implement Set() since overloading operator= is forbidden. EXPECT_STREQ("apple", mac.c_str()); EXPECT_STREQ("apple", apple.c_str()); } TEST(FilePathTest, ToString) { const FilePath file("drink"); String str(file.ToString()); EXPECT_STREQ("drink", str.c_str()); } TEST(FilePathTest, RemoveExtension) { EXPECT_STREQ("app", FilePath("app.exe").RemoveExtension("exe").c_str()); EXPECT_STREQ("APP", FilePath("APP.EXE").RemoveExtension("exe").c_str()); } TEST(FilePathTest, RemoveExtensionWhenThereIsNoExtension) { EXPECT_STREQ("app", FilePath("app").RemoveExtension("exe").c_str()); } TEST(FilePathTest, IsDirectory) { EXPECT_FALSE(FilePath("cola").IsDirectory()); EXPECT_TRUE(FilePath("koala" GTEST_PATH_SEP_).IsDirectory()); #if GTEST_HAS_ALT_PATH_SEP_ EXPECT_TRUE(FilePath("koala/").IsDirectory()); #endif } TEST(FilePathTest, IsAbsolutePath) { EXPECT_FALSE(FilePath("is" GTEST_PATH_SEP_ "relative").IsAbsolutePath()); EXPECT_FALSE(FilePath("").IsAbsolutePath()); #if GTEST_OS_WINDOWS EXPECT_TRUE(FilePath("c:\\" GTEST_PATH_SEP_ "is_not" GTEST_PATH_SEP_ "relative").IsAbsolutePath()); EXPECT_FALSE(FilePath("c:foo" GTEST_PATH_SEP_ "bar").IsAbsolutePath()); EXPECT_TRUE(FilePath("c:/" GTEST_PATH_SEP_ "is_not" GTEST_PATH_SEP_ "relative").IsAbsolutePath()); #else EXPECT_TRUE(FilePath(GTEST_PATH_SEP_ "is_not" GTEST_PATH_SEP_ "relative") .IsAbsolutePath()); #endif // GTEST_OS_WINDOWS } TEST(FilePathTest, IsRootDirectory) { #if GTEST_OS_WINDOWS EXPECT_TRUE(FilePath("a:\\").IsRootDirectory()); EXPECT_TRUE(FilePath("Z:/").IsRootDirectory()); EXPECT_TRUE(FilePath("e://").IsRootDirectory()); EXPECT_FALSE(FilePath("").IsRootDirectory()); EXPECT_FALSE(FilePath("b:").IsRootDirectory()); EXPECT_FALSE(FilePath("b:a").IsRootDirectory()); EXPECT_FALSE(FilePath("8:/").IsRootDirectory()); EXPECT_FALSE(FilePath("c|/").IsRootDirectory()); #else EXPECT_TRUE(FilePath("/").IsRootDirectory()); EXPECT_TRUE(FilePath("//").IsRootDirectory()); EXPECT_FALSE(FilePath("").IsRootDirectory()); EXPECT_FALSE(FilePath("\\").IsRootDirectory()); EXPECT_FALSE(FilePath("/x").IsRootDirectory()); #endif } } // namespace } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-linked_ptr_test.cc0000600000175000017500000001004011561126632025237 0ustar synergysynergy// Copyright 2003, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: Dan Egnor (egnor@google.com) // Ported to Windows: Vadim Berman (vadimb@google.com) #include "gtest/internal/gtest-linked_ptr.h" #include #include "gtest/gtest.h" namespace { using testing::Message; using testing::internal::linked_ptr; int num; Message* history = NULL; // Class which tracks allocation/deallocation class A { public: A(): mynum(num++) { *history << "A" << mynum << " ctor\n"; } virtual ~A() { *history << "A" << mynum << " dtor\n"; } virtual void Use() { *history << "A" << mynum << " use\n"; } protected: int mynum; }; // Subclass class B : public A { public: B() { *history << "B" << mynum << " ctor\n"; } ~B() { *history << "B" << mynum << " dtor\n"; } virtual void Use() { *history << "B" << mynum << " use\n"; } }; class LinkedPtrTest : public testing::Test { public: LinkedPtrTest() { num = 0; history = new Message; } virtual ~LinkedPtrTest() { delete history; history = NULL; } }; TEST_F(LinkedPtrTest, GeneralTest) { { linked_ptr a0, a1, a2; // Use explicit function call notation here to suppress self-assign warning. a0.operator=(a0); a1 = a2; ASSERT_EQ(a0.get(), static_cast(NULL)); ASSERT_EQ(a1.get(), static_cast(NULL)); ASSERT_EQ(a2.get(), static_cast(NULL)); ASSERT_TRUE(a0 == NULL); ASSERT_TRUE(a1 == NULL); ASSERT_TRUE(a2 == NULL); { linked_ptr a3(new A); a0 = a3; ASSERT_TRUE(a0 == a3); ASSERT_TRUE(a0 != NULL); ASSERT_TRUE(a0.get() == a3); ASSERT_TRUE(a0 == a3.get()); linked_ptr a4(a0); a1 = a4; linked_ptr a5(new A); ASSERT_TRUE(a5.get() != a3); ASSERT_TRUE(a5 != a3.get()); a2 = a5; linked_ptr b0(new B); linked_ptr a6(b0); ASSERT_TRUE(b0 == a6); ASSERT_TRUE(a6 == b0); ASSERT_TRUE(b0 != NULL); a5 = b0; a5 = b0; a3->Use(); a4->Use(); a5->Use(); a6->Use(); b0->Use(); (*b0).Use(); b0.get()->Use(); } a0->Use(); a1->Use(); a2->Use(); a1 = a2; a2.reset(new A); a0.reset(); linked_ptr a7; } ASSERT_STREQ( "A0 ctor\n" "A1 ctor\n" "A2 ctor\n" "B2 ctor\n" "A0 use\n" "A0 use\n" "B2 use\n" "B2 use\n" "B2 use\n" "B2 use\n" "B2 use\n" "B2 dtor\n" "A2 dtor\n" "A0 use\n" "A0 use\n" "A1 use\n" "A3 ctor\n" "A0 dtor\n" "A3 dtor\n" "A1 dtor\n", history->GetString().c_str() ); } } // Unnamed namespace synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-listener_test.cc0000600000175000017500000002326311561126632024744 0ustar synergysynergy// Copyright 2009 Google Inc. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // The Google C++ Testing Framework (Google Test) // // This file verifies Google Test event listeners receive events at the // right times. #include "gtest/gtest.h" #include using ::testing::AddGlobalTestEnvironment; using ::testing::Environment; using ::testing::InitGoogleTest; using ::testing::Test; using ::testing::TestCase; using ::testing::TestEventListener; using ::testing::TestInfo; using ::testing::TestPartResult; using ::testing::UnitTest; using ::testing::internal::String; // Used by tests to register their events. std::vector* g_events = NULL; namespace testing { namespace internal { class EventRecordingListener : public TestEventListener { public: EventRecordingListener(const char* name) : name_(name) {} protected: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnTestProgramStart")); } virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int iteration) { Message message; message << GetFullMethodName("OnTestIterationStart") << "(" << iteration << ")"; g_events->push_back(message.GetString()); } virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnEnvironmentsSetUpStart")); } virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnEnvironmentsSetUpEnd")); } virtual void OnTestCaseStart(const TestCase& /*test_case*/) { g_events->push_back(GetFullMethodName("OnTestCaseStart")); } virtual void OnTestStart(const TestInfo& /*test_info*/) { g_events->push_back(GetFullMethodName("OnTestStart")); } virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) { g_events->push_back(GetFullMethodName("OnTestPartResult")); } virtual void OnTestEnd(const TestInfo& /*test_info*/) { g_events->push_back(GetFullMethodName("OnTestEnd")); } virtual void OnTestCaseEnd(const TestCase& /*test_case*/) { g_events->push_back(GetFullMethodName("OnTestCaseEnd")); } virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnEnvironmentsTearDownStart")); } virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnEnvironmentsTearDownEnd")); } virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int iteration) { Message message; message << GetFullMethodName("OnTestIterationEnd") << "(" << iteration << ")"; g_events->push_back(message.GetString()); } virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) { g_events->push_back(GetFullMethodName("OnTestProgramEnd")); } private: String GetFullMethodName(const char* name) { Message message; message << name_ << "." << name; return message.GetString(); } String name_; }; class EnvironmentInvocationCatcher : public Environment { protected: virtual void SetUp() { g_events->push_back(String("Environment::SetUp")); } virtual void TearDown() { g_events->push_back(String("Environment::TearDown")); } }; class ListenerTest : public Test { protected: static void SetUpTestCase() { g_events->push_back(String("ListenerTest::SetUpTestCase")); } static void TearDownTestCase() { g_events->push_back(String("ListenerTest::TearDownTestCase")); } virtual void SetUp() { g_events->push_back(String("ListenerTest::SetUp")); } virtual void TearDown() { g_events->push_back(String("ListenerTest::TearDown")); } }; TEST_F(ListenerTest, DoesFoo) { // Test execution order within a test case is not guaranteed so we are not // recording the test name. g_events->push_back(String("ListenerTest::* Test Body")); SUCCEED(); // Triggers OnTestPartResult. } TEST_F(ListenerTest, DoesBar) { g_events->push_back(String("ListenerTest::* Test Body")); SUCCEED(); // Triggers OnTestPartResult. } } // namespace internal } // namespace testing using ::testing::internal::EnvironmentInvocationCatcher; using ::testing::internal::EventRecordingListener; void VerifyResults(const std::vector& data, const char* const* expected_data, int expected_data_size) { const int actual_size = data.size(); // If the following assertion fails, a new entry will be appended to // data. Hence we save data.size() first. EXPECT_EQ(expected_data_size, actual_size); // Compares the common prefix. const int shorter_size = expected_data_size <= actual_size ? expected_data_size : actual_size; int i = 0; for (; i < shorter_size; ++i) { ASSERT_STREQ(expected_data[i], data[i].c_str()) << "at position " << i; } // Prints extra elements in the actual data. for (; i < actual_size; ++i) { printf(" Actual event #%d: %s\n", i, data[i].c_str()); } } int main(int argc, char **argv) { std::vector events; g_events = &events; InitGoogleTest(&argc, argv); UnitTest::GetInstance()->listeners().Append( new EventRecordingListener("1st")); UnitTest::GetInstance()->listeners().Append( new EventRecordingListener("2nd")); AddGlobalTestEnvironment(new EnvironmentInvocationCatcher); GTEST_CHECK_(events.size() == 0) << "AddGlobalTestEnvironment should not generate any events itself."; ::testing::GTEST_FLAG(repeat) = 2; int ret_val = RUN_ALL_TESTS(); const char* const expected_events[] = { "1st.OnTestProgramStart", "2nd.OnTestProgramStart", "1st.OnTestIterationStart(0)", "2nd.OnTestIterationStart(0)", "1st.OnEnvironmentsSetUpStart", "2nd.OnEnvironmentsSetUpStart", "Environment::SetUp", "2nd.OnEnvironmentsSetUpEnd", "1st.OnEnvironmentsSetUpEnd", "1st.OnTestCaseStart", "2nd.OnTestCaseStart", "ListenerTest::SetUpTestCase", "1st.OnTestStart", "2nd.OnTestStart", "ListenerTest::SetUp", "ListenerTest::* Test Body", "1st.OnTestPartResult", "2nd.OnTestPartResult", "ListenerTest::TearDown", "2nd.OnTestEnd", "1st.OnTestEnd", "1st.OnTestStart", "2nd.OnTestStart", "ListenerTest::SetUp", "ListenerTest::* Test Body", "1st.OnTestPartResult", "2nd.OnTestPartResult", "ListenerTest::TearDown", "2nd.OnTestEnd", "1st.OnTestEnd", "ListenerTest::TearDownTestCase", "2nd.OnTestCaseEnd", "1st.OnTestCaseEnd", "1st.OnEnvironmentsTearDownStart", "2nd.OnEnvironmentsTearDownStart", "Environment::TearDown", "2nd.OnEnvironmentsTearDownEnd", "1st.OnEnvironmentsTearDownEnd", "2nd.OnTestIterationEnd(0)", "1st.OnTestIterationEnd(0)", "1st.OnTestIterationStart(1)", "2nd.OnTestIterationStart(1)", "1st.OnEnvironmentsSetUpStart", "2nd.OnEnvironmentsSetUpStart", "Environment::SetUp", "2nd.OnEnvironmentsSetUpEnd", "1st.OnEnvironmentsSetUpEnd", "1st.OnTestCaseStart", "2nd.OnTestCaseStart", "ListenerTest::SetUpTestCase", "1st.OnTestStart", "2nd.OnTestStart", "ListenerTest::SetUp", "ListenerTest::* Test Body", "1st.OnTestPartResult", "2nd.OnTestPartResult", "ListenerTest::TearDown", "2nd.OnTestEnd", "1st.OnTestEnd", "1st.OnTestStart", "2nd.OnTestStart", "ListenerTest::SetUp", "ListenerTest::* Test Body", "1st.OnTestPartResult", "2nd.OnTestPartResult", "ListenerTest::TearDown", "2nd.OnTestEnd", "1st.OnTestEnd", "ListenerTest::TearDownTestCase", "2nd.OnTestCaseEnd", "1st.OnTestCaseEnd", "1st.OnEnvironmentsTearDownStart", "2nd.OnEnvironmentsTearDownStart", "Environment::TearDown", "2nd.OnEnvironmentsTearDownEnd", "1st.OnEnvironmentsTearDownEnd", "2nd.OnTestIterationEnd(1)", "1st.OnTestIterationEnd(1)", "2nd.OnTestProgramEnd", "1st.OnTestProgramEnd" }; VerifyResults(events, expected_events, sizeof(expected_events)/sizeof(expected_events[0])); // We need to check manually for ad hoc test failures that happen after // RUN_ALL_TESTS finishes. if (UnitTest::GetInstance()->Failed()) ret_val = 1; return ret_val; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-message_test.cc0000600000175000017500000001257111561126632024543 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests for the Message class. #include "gtest/gtest-message.h" #include "gtest/gtest.h" namespace { using ::testing::Message; // A helper function that turns a Message into a C string. const char* ToCString(const Message& msg) { static testing::internal::String result; result = msg.GetString(); return result.c_str(); } // Tests the testing::Message class // Tests the default constructor. TEST(MessageTest, DefaultConstructor) { const Message msg; EXPECT_STREQ("", ToCString(msg)); } // Tests the copy constructor. TEST(MessageTest, CopyConstructor) { const Message msg1("Hello"); const Message msg2(msg1); EXPECT_STREQ("Hello", ToCString(msg2)); } // Tests constructing a Message from a C-string. TEST(MessageTest, ConstructsFromCString) { Message msg("Hello"); EXPECT_STREQ("Hello", ToCString(msg)); } // Tests streaming a float. TEST(MessageTest, StreamsFloat) { const char* const s = ToCString(Message() << 1.23456F << " " << 2.34567F); // Both numbers should be printed with enough precision. EXPECT_PRED_FORMAT2(testing::IsSubstring, "1.234560", s); EXPECT_PRED_FORMAT2(testing::IsSubstring, " 2.345669", s); } // Tests streaming a double. TEST(MessageTest, StreamsDouble) { const char* const s = ToCString(Message() << 1260570880.4555497 << " " << 1260572265.1954534); // Both numbers should be printed with enough precision. EXPECT_PRED_FORMAT2(testing::IsSubstring, "1260570880.45", s); EXPECT_PRED_FORMAT2(testing::IsSubstring, " 1260572265.19", s); } // Tests streaming a non-char pointer. TEST(MessageTest, StreamsPointer) { int n = 0; int* p = &n; EXPECT_STRNE("(null)", ToCString(Message() << p)); } // Tests streaming a NULL non-char pointer. TEST(MessageTest, StreamsNullPointer) { int* p = NULL; EXPECT_STREQ("(null)", ToCString(Message() << p)); } // Tests streaming a C string. TEST(MessageTest, StreamsCString) { EXPECT_STREQ("Foo", ToCString(Message() << "Foo")); } // Tests streaming a NULL C string. TEST(MessageTest, StreamsNullCString) { char* p = NULL; EXPECT_STREQ("(null)", ToCString(Message() << p)); } // Tests streaming std::string. TEST(MessageTest, StreamsString) { const ::std::string str("Hello"); EXPECT_STREQ("Hello", ToCString(Message() << str)); } // Tests that we can output strings containing embedded NULs. TEST(MessageTest, StreamsStringWithEmbeddedNUL) { const char char_array_with_nul[] = "Here's a NUL\0 and some more string"; const ::std::string string_with_nul(char_array_with_nul, sizeof(char_array_with_nul) - 1); EXPECT_STREQ("Here's a NUL\\0 and some more string", ToCString(Message() << string_with_nul)); } // Tests streaming a NUL char. TEST(MessageTest, StreamsNULChar) { EXPECT_STREQ("\\0", ToCString(Message() << '\0')); } // Tests streaming int. TEST(MessageTest, StreamsInt) { EXPECT_STREQ("123", ToCString(Message() << 123)); } // Tests that basic IO manipulators (endl, ends, and flush) can be // streamed to Message. TEST(MessageTest, StreamsBasicIoManip) { EXPECT_STREQ("Line 1.\nA NUL char \\0 in line 2.", ToCString(Message() << "Line 1." << std::endl << "A NUL char " << std::ends << std::flush << " in line 2.")); } // Tests Message::GetString() TEST(MessageTest, GetString) { Message msg; msg << 1 << " lamb"; EXPECT_STREQ("1 lamb", msg.GetString().c_str()); } // Tests streaming a Message object to an ostream. TEST(MessageTest, StreamsToOStream) { Message msg("Hello"); ::std::stringstream ss; ss << msg; EXPECT_STREQ("Hello", testing::internal::StringStreamToString(&ss).c_str()); } // Tests that a Message object doesn't take up too much stack space. TEST(MessageTest, DoesNotTakeUpMuchStackSpace) { EXPECT_LE(sizeof(Message), 16U); } } // namespace synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-options_test.cc0000600000175000017500000001747211561126632024617 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: keith.ray@gmail.com (Keith Ray) // // Google Test UnitTestOptions tests // // This file tests classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included from gtest.cc, to avoid changing build or // make-files on Windows and other platforms. Do not #include this file // anywhere else! #include "gtest/gtest.h" #if GTEST_OS_WINDOWS_MOBILE # include #elif GTEST_OS_WINDOWS # include #endif // GTEST_OS_WINDOWS_MOBILE // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { namespace internal { namespace { // Turns the given relative path into an absolute path. FilePath GetAbsolutePathOf(const FilePath& relative_path) { return FilePath::ConcatPaths(FilePath::GetCurrentDir(), relative_path); } // Testing UnitTestOptions::GetOutputFormat/GetOutputFile. TEST(XmlOutputTest, GetOutputFormatDefault) { GTEST_FLAG(output) = ""; EXPECT_STREQ("", UnitTestOptions::GetOutputFormat().c_str()); } TEST(XmlOutputTest, GetOutputFormat) { GTEST_FLAG(output) = "xml:filename"; EXPECT_STREQ("xml", UnitTestOptions::GetOutputFormat().c_str()); } TEST(XmlOutputTest, GetOutputFileDefault) { GTEST_FLAG(output) = ""; EXPECT_STREQ(GetAbsolutePathOf(FilePath("test_detail.xml")).c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); } TEST(XmlOutputTest, GetOutputFileSingleFile) { GTEST_FLAG(output) = "xml:filename.abc"; EXPECT_STREQ(GetAbsolutePathOf(FilePath("filename.abc")).c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); } TEST(XmlOutputTest, GetOutputFileFromDirectoryPath) { GTEST_FLAG(output) = "xml:path" GTEST_PATH_SEP_; const std::string expected_output_file = GetAbsolutePathOf( FilePath(std::string("path") + GTEST_PATH_SEP_ + GetCurrentExecutableName().c_str() + ".xml")).c_str(); const String& output_file = UnitTestOptions::GetAbsolutePathToOutputFile(); #if GTEST_OS_WINDOWS EXPECT_STRCASEEQ(expected_output_file.c_str(), output_file.c_str()); #else EXPECT_EQ(expected_output_file, output_file.c_str()); #endif } TEST(OutputFileHelpersTest, GetCurrentExecutableName) { const std::string exe_str = GetCurrentExecutableName().c_str(); #if GTEST_OS_WINDOWS const bool success = _strcmpi("gtest-options_test", exe_str.c_str()) == 0 || _strcmpi("gtest-options-ex_test", exe_str.c_str()) == 0 || _strcmpi("gtest_all_test", exe_str.c_str()) == 0 || _strcmpi("gtest_dll_test", exe_str.c_str()) == 0; #else // TODO(wan@google.com): remove the hard-coded "lt-" prefix when // Chandler Carruth's libtool replacement is ready. const bool success = exe_str == "gtest-options_test" || exe_str == "gtest_all_test" || exe_str == "lt-gtest_all_test" || exe_str == "gtest_dll_test"; #endif // GTEST_OS_WINDOWS if (!success) FAIL() << "GetCurrentExecutableName() returns " << exe_str; } class XmlOutputChangeDirTest : public Test { protected: virtual void SetUp() { original_working_dir_ = FilePath::GetCurrentDir(); posix::ChDir(".."); // This will make the test fail if run from the root directory. EXPECT_STRNE(original_working_dir_.c_str(), FilePath::GetCurrentDir().c_str()); } virtual void TearDown() { posix::ChDir(original_working_dir_.c_str()); } FilePath original_working_dir_; }; TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithDefault) { GTEST_FLAG(output) = ""; EXPECT_STREQ(FilePath::ConcatPaths(original_working_dir_, FilePath("test_detail.xml")).c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); } TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithDefaultXML) { GTEST_FLAG(output) = "xml"; EXPECT_STREQ(FilePath::ConcatPaths(original_working_dir_, FilePath("test_detail.xml")).c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); } TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithRelativeFile) { GTEST_FLAG(output) = "xml:filename.abc"; EXPECT_STREQ(FilePath::ConcatPaths(original_working_dir_, FilePath("filename.abc")).c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); } TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithRelativePath) { GTEST_FLAG(output) = "xml:path" GTEST_PATH_SEP_; const std::string expected_output_file = FilePath::ConcatPaths( original_working_dir_, FilePath(std::string("path") + GTEST_PATH_SEP_ + GetCurrentExecutableName().c_str() + ".xml")).c_str(); const String& output_file = UnitTestOptions::GetAbsolutePathToOutputFile(); #if GTEST_OS_WINDOWS EXPECT_STRCASEEQ(expected_output_file.c_str(), output_file.c_str()); #else EXPECT_EQ(expected_output_file, output_file.c_str()); #endif } TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithAbsoluteFile) { #if GTEST_OS_WINDOWS GTEST_FLAG(output) = "xml:c:\\tmp\\filename.abc"; EXPECT_STREQ(FilePath("c:\\tmp\\filename.abc").c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); #else GTEST_FLAG(output) ="xml:/tmp/filename.abc"; EXPECT_STREQ(FilePath("/tmp/filename.abc").c_str(), UnitTestOptions::GetAbsolutePathToOutputFile().c_str()); #endif } TEST_F(XmlOutputChangeDirTest, PreserveOriginalWorkingDirWithAbsolutePath) { #if GTEST_OS_WINDOWS const std::string path = "c:\\tmp\\"; #else const std::string path = "/tmp/"; #endif GTEST_FLAG(output) = "xml:" + path; const std::string expected_output_file = path + GetCurrentExecutableName().c_str() + ".xml"; const String& output_file = UnitTestOptions::GetAbsolutePathToOutputFile(); #if GTEST_OS_WINDOWS EXPECT_STRCASEEQ(expected_output_file.c_str(), output_file.c_str()); #else EXPECT_EQ(expected_output_file, output_file.c_str()); #endif } } // namespace } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-param-test2_test.cc0000600000175000017500000000550411561126632025254 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // Tests for Google Test itself. This verifies that the basic constructs of // Google Test work. #include "gtest/gtest.h" #include "test/gtest-param-test_test.h" #if GTEST_HAS_PARAM_TEST using ::testing::Values; using ::testing::internal::ParamGenerator; // Tests that generators defined in a different translation unit // are functional. The test using extern_gen is defined // in gtest-param-test_test.cc. ParamGenerator extern_gen = Values(33); // Tests that a parameterized test case can be defined in one translation unit // and instantiated in another. The test is defined in gtest-param-test_test.cc // and ExternalInstantiationTest fixture class is defined in // gtest-param-test_test.h. INSTANTIATE_TEST_CASE_P(MultiplesOf33, ExternalInstantiationTest, Values(33, 66)); // Tests that a parameterized test case can be instantiated // in multiple translation units. Another instantiation is defined // in gtest-param-test_test.cc and InstantiationInMultipleTranslaionUnitsTest // fixture is defined in gtest-param-test_test.h INSTANTIATE_TEST_CASE_P(Sequence2, InstantiationInMultipleTranslaionUnitsTest, Values(42*3, 42*4, 42*5)); #endif // GTEST_HAS_PARAM_TEST synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-param-test_test.cc0000600000175000017500000010056411561126632025174 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // Tests for Google Test itself. This file verifies that the parameter // generators objects produce correct parameter sequences and that // Google Test runtime instantiates correct tests from those sequences. #include "gtest/gtest.h" #if GTEST_HAS_PARAM_TEST # include # include # include # include # include # include // To include gtest-internal-inl.h. # define GTEST_IMPLEMENTATION_ 1 # include "src/gtest-internal-inl.h" // for UnitTestOptions # undef GTEST_IMPLEMENTATION_ # include "test/gtest-param-test_test.h" using ::std::vector; using ::std::sort; using ::testing::AddGlobalTestEnvironment; using ::testing::Bool; using ::testing::Message; using ::testing::Range; using ::testing::TestWithParam; using ::testing::Values; using ::testing::ValuesIn; # if GTEST_HAS_COMBINE using ::testing::Combine; using ::std::tr1::get; using ::std::tr1::make_tuple; using ::std::tr1::tuple; # endif // GTEST_HAS_COMBINE using ::testing::internal::ParamGenerator; using ::testing::internal::UnitTestOptions; // Prints a value to a string. // // TODO(wan@google.com): remove PrintValue() when we move matchers and // EXPECT_THAT() from Google Mock to Google Test. At that time, we // can write EXPECT_THAT(x, Eq(y)) to compare two tuples x and y, as // EXPECT_THAT() and the matchers know how to print tuples. template ::std::string PrintValue(const T& value) { ::std::stringstream stream; stream << value; return stream.str(); } # if GTEST_HAS_COMBINE // These overloads allow printing tuples in our tests. We cannot // define an operator<< for tuples, as that definition needs to be in // the std namespace in order to be picked up by Google Test via // Argument-Dependent Lookup, yet defining anything in the std // namespace in non-STL code is undefined behavior. template ::std::string PrintValue(const tuple& value) { ::std::stringstream stream; stream << "(" << get<0>(value) << ", " << get<1>(value) << ")"; return stream.str(); } template ::std::string PrintValue(const tuple& value) { ::std::stringstream stream; stream << "(" << get<0>(value) << ", " << get<1>(value) << ", "<< get<2>(value) << ")"; return stream.str(); } template ::std::string PrintValue( const tuple& value) { ::std::stringstream stream; stream << "(" << get<0>(value) << ", " << get<1>(value) << ", "<< get<2>(value) << ", " << get<3>(value) << ", "<< get<4>(value) << ", " << get<5>(value) << ", "<< get<6>(value) << ", " << get<7>(value) << ", "<< get<8>(value) << ", " << get<9>(value) << ")"; return stream.str(); } # endif // GTEST_HAS_COMBINE // Verifies that a sequence generated by the generator and accessed // via the iterator object matches the expected one using Google Test // assertions. template void VerifyGenerator(const ParamGenerator& generator, const T (&expected_values)[N]) { typename ParamGenerator::iterator it = generator.begin(); for (size_t i = 0; i < N; ++i) { ASSERT_FALSE(it == generator.end()) << "At element " << i << " when accessing via an iterator " << "created with the copy constructor.\n"; // We cannot use EXPECT_EQ() here as the values may be tuples, // which don't support <<. EXPECT_TRUE(expected_values[i] == *it) << "where i is " << i << ", expected_values[i] is " << PrintValue(expected_values[i]) << ", *it is " << PrintValue(*it) << ", and 'it' is an iterator created with the copy constructor.\n"; it++; } EXPECT_TRUE(it == generator.end()) << "At the presumed end of sequence when accessing via an iterator " << "created with the copy constructor.\n"; // Test the iterator assignment. The following lines verify that // the sequence accessed via an iterator initialized via the // assignment operator (as opposed to a copy constructor) matches // just the same. it = generator.begin(); for (size_t i = 0; i < N; ++i) { ASSERT_FALSE(it == generator.end()) << "At element " << i << " when accessing via an iterator " << "created with the assignment operator.\n"; EXPECT_TRUE(expected_values[i] == *it) << "where i is " << i << ", expected_values[i] is " << PrintValue(expected_values[i]) << ", *it is " << PrintValue(*it) << ", and 'it' is an iterator created with the copy constructor.\n"; it++; } EXPECT_TRUE(it == generator.end()) << "At the presumed end of sequence when accessing via an iterator " << "created with the assignment operator.\n"; } template void VerifyGeneratorIsEmpty(const ParamGenerator& generator) { typename ParamGenerator::iterator it = generator.begin(); EXPECT_TRUE(it == generator.end()); it = generator.begin(); EXPECT_TRUE(it == generator.end()); } // Generator tests. They test that each of the provided generator functions // generates an expected sequence of values. The general test pattern // instantiates a generator using one of the generator functions, // checks the sequence produced by the generator using its iterator API, // and then resets the iterator back to the beginning of the sequence // and checks the sequence again. // Tests that iterators produced by generator functions conform to the // ForwardIterator concept. TEST(IteratorTest, ParamIteratorConformsToForwardIteratorConcept) { const ParamGenerator gen = Range(0, 10); ParamGenerator::iterator it = gen.begin(); // Verifies that iterator initialization works as expected. ParamGenerator::iterator it2 = it; EXPECT_TRUE(*it == *it2) << "Initialized iterators must point to the " << "element same as its source points to"; // Verifies that iterator assignment works as expected. it++; EXPECT_FALSE(*it == *it2); it2 = it; EXPECT_TRUE(*it == *it2) << "Assigned iterators must point to the " << "element same as its source points to"; // Verifies that prefix operator++() returns *this. EXPECT_EQ(&it, &(++it)) << "Result of the prefix operator++ must be " << "refer to the original object"; // Verifies that the result of the postfix operator++ points to the value // pointed to by the original iterator. int original_value = *it; // Have to compute it outside of macro call to be // unaffected by the parameter evaluation order. EXPECT_EQ(original_value, *(it++)); // Verifies that prefix and postfix operator++() advance an iterator // all the same. it2 = it; it++; ++it2; EXPECT_TRUE(*it == *it2); } // Tests that Range() generates the expected sequence. TEST(RangeTest, IntRangeWithDefaultStep) { const ParamGenerator gen = Range(0, 3); const int expected_values[] = {0, 1, 2}; VerifyGenerator(gen, expected_values); } // Edge case. Tests that Range() generates the single element sequence // as expected when provided with range limits that are equal. TEST(RangeTest, IntRangeSingleValue) { const ParamGenerator gen = Range(0, 1); const int expected_values[] = {0}; VerifyGenerator(gen, expected_values); } // Edge case. Tests that Range() with generates empty sequence when // supplied with an empty range. TEST(RangeTest, IntRangeEmpty) { const ParamGenerator gen = Range(0, 0); VerifyGeneratorIsEmpty(gen); } // Tests that Range() with custom step (greater then one) generates // the expected sequence. TEST(RangeTest, IntRangeWithCustomStep) { const ParamGenerator gen = Range(0, 9, 3); const int expected_values[] = {0, 3, 6}; VerifyGenerator(gen, expected_values); } // Tests that Range() with custom step (greater then one) generates // the expected sequence when the last element does not fall on the // upper range limit. Sequences generated by Range() must not have // elements beyond the range limits. TEST(RangeTest, IntRangeWithCustomStepOverUpperBound) { const ParamGenerator gen = Range(0, 4, 3); const int expected_values[] = {0, 3}; VerifyGenerator(gen, expected_values); } // Verifies that Range works with user-defined types that define // copy constructor, operator=(), operator+(), and operator<(). class DogAdder { public: explicit DogAdder(const char* a_value) : value_(a_value) {} DogAdder(const DogAdder& other) : value_(other.value_.c_str()) {} DogAdder operator=(const DogAdder& other) { if (this != &other) value_ = other.value_; return *this; } DogAdder operator+(const DogAdder& other) const { Message msg; msg << value_.c_str() << other.value_.c_str(); return DogAdder(msg.GetString().c_str()); } bool operator<(const DogAdder& other) const { return value_ < other.value_; } const ::testing::internal::String& value() const { return value_; } private: ::testing::internal::String value_; }; TEST(RangeTest, WorksWithACustomType) { const ParamGenerator gen = Range(DogAdder("cat"), DogAdder("catdogdog"), DogAdder("dog")); ParamGenerator::iterator it = gen.begin(); ASSERT_FALSE(it == gen.end()); EXPECT_STREQ("cat", it->value().c_str()); ASSERT_FALSE(++it == gen.end()); EXPECT_STREQ("catdog", it->value().c_str()); EXPECT_TRUE(++it == gen.end()); } class IntWrapper { public: explicit IntWrapper(int a_value) : value_(a_value) {} IntWrapper(const IntWrapper& other) : value_(other.value_) {} IntWrapper operator=(const IntWrapper& other) { value_ = other.value_; return *this; } // operator+() adds a different type. IntWrapper operator+(int other) const { return IntWrapper(value_ + other); } bool operator<(const IntWrapper& other) const { return value_ < other.value_; } int value() const { return value_; } private: int value_; }; TEST(RangeTest, WorksWithACustomTypeWithDifferentIncrementType) { const ParamGenerator gen = Range(IntWrapper(0), IntWrapper(2)); ParamGenerator::iterator it = gen.begin(); ASSERT_FALSE(it == gen.end()); EXPECT_EQ(0, it->value()); ASSERT_FALSE(++it == gen.end()); EXPECT_EQ(1, it->value()); EXPECT_TRUE(++it == gen.end()); } // Tests that ValuesIn() with an array parameter generates // the expected sequence. TEST(ValuesInTest, ValuesInArray) { int array[] = {3, 5, 8}; const ParamGenerator gen = ValuesIn(array); VerifyGenerator(gen, array); } // Tests that ValuesIn() with a const array parameter generates // the expected sequence. TEST(ValuesInTest, ValuesInConstArray) { const int array[] = {3, 5, 8}; const ParamGenerator gen = ValuesIn(array); VerifyGenerator(gen, array); } // Edge case. Tests that ValuesIn() with an array parameter containing a // single element generates the single element sequence. TEST(ValuesInTest, ValuesInSingleElementArray) { int array[] = {42}; const ParamGenerator gen = ValuesIn(array); VerifyGenerator(gen, array); } // Tests that ValuesIn() generates the expected sequence for an STL // container (vector). TEST(ValuesInTest, ValuesInVector) { typedef ::std::vector ContainerType; ContainerType values; values.push_back(3); values.push_back(5); values.push_back(8); const ParamGenerator gen = ValuesIn(values); const int expected_values[] = {3, 5, 8}; VerifyGenerator(gen, expected_values); } // Tests that ValuesIn() generates the expected sequence. TEST(ValuesInTest, ValuesInIteratorRange) { typedef ::std::vector ContainerType; ContainerType values; values.push_back(3); values.push_back(5); values.push_back(8); const ParamGenerator gen = ValuesIn(values.begin(), values.end()); const int expected_values[] = {3, 5, 8}; VerifyGenerator(gen, expected_values); } // Edge case. Tests that ValuesIn() provided with an iterator range specifying a // single value generates a single-element sequence. TEST(ValuesInTest, ValuesInSingleElementIteratorRange) { typedef ::std::vector ContainerType; ContainerType values; values.push_back(42); const ParamGenerator gen = ValuesIn(values.begin(), values.end()); const int expected_values[] = {42}; VerifyGenerator(gen, expected_values); } // Edge case. Tests that ValuesIn() provided with an empty iterator range // generates an empty sequence. TEST(ValuesInTest, ValuesInEmptyIteratorRange) { typedef ::std::vector ContainerType; ContainerType values; const ParamGenerator gen = ValuesIn(values.begin(), values.end()); VerifyGeneratorIsEmpty(gen); } // Tests that the Values() generates the expected sequence. TEST(ValuesTest, ValuesWorks) { const ParamGenerator gen = Values(3, 5, 8); const int expected_values[] = {3, 5, 8}; VerifyGenerator(gen, expected_values); } // Tests that Values() generates the expected sequences from elements of // different types convertible to ParamGenerator's parameter type. TEST(ValuesTest, ValuesWorksForValuesOfCompatibleTypes) { const ParamGenerator gen = Values(3, 5.0f, 8.0); const double expected_values[] = {3.0, 5.0, 8.0}; VerifyGenerator(gen, expected_values); } TEST(ValuesTest, ValuesWorksForMaxLengthList) { const ParamGenerator gen = Values( 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290, 300, 310, 320, 330, 340, 350, 360, 370, 380, 390, 400, 410, 420, 430, 440, 450, 460, 470, 480, 490, 500); const int expected_values[] = { 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290, 300, 310, 320, 330, 340, 350, 360, 370, 380, 390, 400, 410, 420, 430, 440, 450, 460, 470, 480, 490, 500}; VerifyGenerator(gen, expected_values); } // Edge case test. Tests that single-parameter Values() generates the sequence // with the single value. TEST(ValuesTest, ValuesWithSingleParameter) { const ParamGenerator gen = Values(42); const int expected_values[] = {42}; VerifyGenerator(gen, expected_values); } // Tests that Bool() generates sequence (false, true). TEST(BoolTest, BoolWorks) { const ParamGenerator gen = Bool(); const bool expected_values[] = {false, true}; VerifyGenerator(gen, expected_values); } # if GTEST_HAS_COMBINE // Tests that Combine() with two parameters generates the expected sequence. TEST(CombineTest, CombineWithTwoParameters) { const char* foo = "foo"; const char* bar = "bar"; const ParamGenerator > gen = Combine(Values(foo, bar), Values(3, 4)); tuple expected_values[] = { make_tuple(foo, 3), make_tuple(foo, 4), make_tuple(bar, 3), make_tuple(bar, 4)}; VerifyGenerator(gen, expected_values); } // Tests that Combine() with three parameters generates the expected sequence. TEST(CombineTest, CombineWithThreeParameters) { const ParamGenerator > gen = Combine(Values(0, 1), Values(3, 4), Values(5, 6)); tuple expected_values[] = { make_tuple(0, 3, 5), make_tuple(0, 3, 6), make_tuple(0, 4, 5), make_tuple(0, 4, 6), make_tuple(1, 3, 5), make_tuple(1, 3, 6), make_tuple(1, 4, 5), make_tuple(1, 4, 6)}; VerifyGenerator(gen, expected_values); } // Tests that the Combine() with the first parameter generating a single value // sequence generates a sequence with the number of elements equal to the // number of elements in the sequence generated by the second parameter. TEST(CombineTest, CombineWithFirstParameterSingleValue) { const ParamGenerator > gen = Combine(Values(42), Values(0, 1)); tuple expected_values[] = {make_tuple(42, 0), make_tuple(42, 1)}; VerifyGenerator(gen, expected_values); } // Tests that the Combine() with the second parameter generating a single value // sequence generates a sequence with the number of elements equal to the // number of elements in the sequence generated by the first parameter. TEST(CombineTest, CombineWithSecondParameterSingleValue) { const ParamGenerator > gen = Combine(Values(0, 1), Values(42)); tuple expected_values[] = {make_tuple(0, 42), make_tuple(1, 42)}; VerifyGenerator(gen, expected_values); } // Tests that when the first parameter produces an empty sequence, // Combine() produces an empty sequence, too. TEST(CombineTest, CombineWithFirstParameterEmptyRange) { const ParamGenerator > gen = Combine(Range(0, 0), Values(0, 1)); VerifyGeneratorIsEmpty(gen); } // Tests that when the second parameter produces an empty sequence, // Combine() produces an empty sequence, too. TEST(CombineTest, CombineWithSecondParameterEmptyRange) { const ParamGenerator > gen = Combine(Values(0, 1), Range(1, 1)); VerifyGeneratorIsEmpty(gen); } // Edge case. Tests that combine works with the maximum number // of parameters supported by Google Test (currently 10). TEST(CombineTest, CombineWithMaxNumberOfParameters) { const char* foo = "foo"; const char* bar = "bar"; const ParamGenerator > gen = Combine(Values(foo, bar), Values(1), Values(2), Values(3), Values(4), Values(5), Values(6), Values(7), Values(8), Values(9)); tuple expected_values[] = {make_tuple(foo, 1, 2, 3, 4, 5, 6, 7, 8, 9), make_tuple(bar, 1, 2, 3, 4, 5, 6, 7, 8, 9)}; VerifyGenerator(gen, expected_values); } # endif // GTEST_HAS_COMBINE // Tests that an generator produces correct sequence after being // assigned from another generator. TEST(ParamGeneratorTest, AssignmentWorks) { ParamGenerator gen = Values(1, 2); const ParamGenerator gen2 = Values(3, 4); gen = gen2; const int expected_values[] = {3, 4}; VerifyGenerator(gen, expected_values); } // This test verifies that the tests are expanded and run as specified: // one test per element from the sequence produced by the generator // specified in INSTANTIATE_TEST_CASE_P. It also verifies that the test's // fixture constructor, SetUp(), and TearDown() have run and have been // supplied with the correct parameters. // The use of environment object allows detection of the case where no test // case functionality is run at all. In this case TestCaseTearDown will not // be able to detect missing tests, naturally. template class TestGenerationEnvironment : public ::testing::Environment { public: static TestGenerationEnvironment* Instance() { static TestGenerationEnvironment* instance = new TestGenerationEnvironment; return instance; } void FixtureConstructorExecuted() { fixture_constructor_count_++; } void SetUpExecuted() { set_up_count_++; } void TearDownExecuted() { tear_down_count_++; } void TestBodyExecuted() { test_body_count_++; } virtual void TearDown() { // If all MultipleTestGenerationTest tests have been de-selected // by the filter flag, the following checks make no sense. bool perform_check = false; for (int i = 0; i < kExpectedCalls; ++i) { Message msg; msg << "TestsExpandedAndRun/" << i; if (UnitTestOptions::FilterMatchesTest( "TestExpansionModule/MultipleTestGenerationTest", msg.GetString().c_str())) { perform_check = true; } } if (perform_check) { EXPECT_EQ(kExpectedCalls, fixture_constructor_count_) << "Fixture constructor of ParamTestGenerationTest test case " << "has not been run as expected."; EXPECT_EQ(kExpectedCalls, set_up_count_) << "Fixture SetUp method of ParamTestGenerationTest test case " << "has not been run as expected."; EXPECT_EQ(kExpectedCalls, tear_down_count_) << "Fixture TearDown method of ParamTestGenerationTest test case " << "has not been run as expected."; EXPECT_EQ(kExpectedCalls, test_body_count_) << "Test in ParamTestGenerationTest test case " << "has not been run as expected."; } } private: TestGenerationEnvironment() : fixture_constructor_count_(0), set_up_count_(0), tear_down_count_(0), test_body_count_(0) {} int fixture_constructor_count_; int set_up_count_; int tear_down_count_; int test_body_count_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestGenerationEnvironment); }; const int test_generation_params[] = {36, 42, 72}; class TestGenerationTest : public TestWithParam { public: enum { PARAMETER_COUNT = sizeof(test_generation_params)/sizeof(test_generation_params[0]) }; typedef TestGenerationEnvironment Environment; TestGenerationTest() { Environment::Instance()->FixtureConstructorExecuted(); current_parameter_ = GetParam(); } virtual void SetUp() { Environment::Instance()->SetUpExecuted(); EXPECT_EQ(current_parameter_, GetParam()); } virtual void TearDown() { Environment::Instance()->TearDownExecuted(); EXPECT_EQ(current_parameter_, GetParam()); } static void SetUpTestCase() { bool all_tests_in_test_case_selected = true; for (int i = 0; i < PARAMETER_COUNT; ++i) { Message test_name; test_name << "TestsExpandedAndRun/" << i; if ( !UnitTestOptions::FilterMatchesTest( "TestExpansionModule/MultipleTestGenerationTest", test_name.GetString())) { all_tests_in_test_case_selected = false; } } EXPECT_TRUE(all_tests_in_test_case_selected) << "When running the TestGenerationTest test case all of its tests\n" << "must be selected by the filter flag for the test case to pass.\n" << "If not all of them are enabled, we can't reliably conclude\n" << "that the correct number of tests have been generated."; collected_parameters_.clear(); } static void TearDownTestCase() { vector expected_values(test_generation_params, test_generation_params + PARAMETER_COUNT); // Test execution order is not guaranteed by Google Test, // so the order of values in collected_parameters_ can be // different and we have to sort to compare. sort(expected_values.begin(), expected_values.end()); sort(collected_parameters_.begin(), collected_parameters_.end()); EXPECT_TRUE(collected_parameters_ == expected_values); } protected: int current_parameter_; static vector collected_parameters_; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestGenerationTest); }; vector TestGenerationTest::collected_parameters_; TEST_P(TestGenerationTest, TestsExpandedAndRun) { Environment::Instance()->TestBodyExecuted(); EXPECT_EQ(current_parameter_, GetParam()); collected_parameters_.push_back(GetParam()); } INSTANTIATE_TEST_CASE_P(TestExpansionModule, TestGenerationTest, ValuesIn(test_generation_params)); // This test verifies that the element sequence (third parameter of // INSTANTIATE_TEST_CASE_P) is evaluated in InitGoogleTest() and neither at // the call site of INSTANTIATE_TEST_CASE_P nor in RUN_ALL_TESTS(). For // that, we declare param_value_ to be a static member of // GeneratorEvaluationTest and initialize it to 0. We set it to 1 in // main(), just before invocation of InitGoogleTest(). After calling // InitGoogleTest(), we set the value to 2. If the sequence is evaluated // before or after InitGoogleTest, INSTANTIATE_TEST_CASE_P will create a // test with parameter other than 1, and the test body will fail the // assertion. class GeneratorEvaluationTest : public TestWithParam { public: static int param_value() { return param_value_; } static void set_param_value(int param_value) { param_value_ = param_value; } private: static int param_value_; }; int GeneratorEvaluationTest::param_value_ = 0; TEST_P(GeneratorEvaluationTest, GeneratorsEvaluatedInMain) { EXPECT_EQ(1, GetParam()); } INSTANTIATE_TEST_CASE_P(GenEvalModule, GeneratorEvaluationTest, Values(GeneratorEvaluationTest::param_value())); // Tests that generators defined in a different translation unit are // functional. Generator extern_gen is defined in gtest-param-test_test2.cc. extern ParamGenerator extern_gen; class ExternalGeneratorTest : public TestWithParam {}; TEST_P(ExternalGeneratorTest, ExternalGenerator) { // Sequence produced by extern_gen contains only a single value // which we verify here. EXPECT_EQ(GetParam(), 33); } INSTANTIATE_TEST_CASE_P(ExternalGeneratorModule, ExternalGeneratorTest, extern_gen); // Tests that a parameterized test case can be defined in one translation // unit and instantiated in another. This test will be instantiated in // gtest-param-test_test2.cc. ExternalInstantiationTest fixture class is // defined in gtest-param-test_test.h. TEST_P(ExternalInstantiationTest, IsMultipleOf33) { EXPECT_EQ(0, GetParam() % 33); } // Tests that a parameterized test case can be instantiated with multiple // generators. class MultipleInstantiationTest : public TestWithParam {}; TEST_P(MultipleInstantiationTest, AllowsMultipleInstances) { } INSTANTIATE_TEST_CASE_P(Sequence1, MultipleInstantiationTest, Values(1, 2)); INSTANTIATE_TEST_CASE_P(Sequence2, MultipleInstantiationTest, Range(3, 5)); // Tests that a parameterized test case can be instantiated // in multiple translation units. This test will be instantiated // here and in gtest-param-test_test2.cc. // InstantiationInMultipleTranslationUnitsTest fixture class // is defined in gtest-param-test_test.h. TEST_P(InstantiationInMultipleTranslaionUnitsTest, IsMultipleOf42) { EXPECT_EQ(0, GetParam() % 42); } INSTANTIATE_TEST_CASE_P(Sequence1, InstantiationInMultipleTranslaionUnitsTest, Values(42, 42*2)); // Tests that each iteration of parameterized test runs in a separate test // object. class SeparateInstanceTest : public TestWithParam { public: SeparateInstanceTest() : count_(0) {} static void TearDownTestCase() { EXPECT_GE(global_count_, 2) << "If some (but not all) SeparateInstanceTest tests have been " << "filtered out this test will fail. Make sure that all " << "GeneratorEvaluationTest are selected or de-selected together " << "by the test filter."; } protected: int count_; static int global_count_; }; int SeparateInstanceTest::global_count_ = 0; TEST_P(SeparateInstanceTest, TestsRunInSeparateInstances) { EXPECT_EQ(0, count_++); global_count_++; } INSTANTIATE_TEST_CASE_P(FourElemSequence, SeparateInstanceTest, Range(1, 4)); // Tests that all instantiations of a test have named appropriately. Test // defined with TEST_P(TestCaseName, TestName) and instantiated with // INSTANTIATE_TEST_CASE_P(SequenceName, TestCaseName, generator) must be named // SequenceName/TestCaseName.TestName/i, where i is the 0-based index of the // sequence element used to instantiate the test. class NamingTest : public TestWithParam {}; TEST_P(NamingTest, TestsReportCorrectNamesAndParameters) { const ::testing::TestInfo* const test_info = ::testing::UnitTest::GetInstance()->current_test_info(); EXPECT_STREQ("ZeroToFiveSequence/NamingTest", test_info->test_case_name()); Message index_stream; index_stream << "TestsReportCorrectNamesAndParameters/" << GetParam(); EXPECT_STREQ(index_stream.GetString().c_str(), test_info->name()); EXPECT_EQ(::testing::PrintToString(GetParam()), test_info->value_param()); } INSTANTIATE_TEST_CASE_P(ZeroToFiveSequence, NamingTest, Range(0, 5)); // Class that cannot be streamed into an ostream. It needs to be copyable // (and, in case of MSVC, also assignable) in order to be a test parameter // type. Its default copy constructor and assignment operator do exactly // what we need. class Unstreamable { public: explicit Unstreamable(int value) : value_(value) {} private: int value_; }; class CommentTest : public TestWithParam {}; TEST_P(CommentTest, TestsCorrectlyReportUnstreamableParams) { const ::testing::TestInfo* const test_info = ::testing::UnitTest::GetInstance()->current_test_info(); EXPECT_EQ(::testing::PrintToString(GetParam()), test_info->value_param()); } INSTANTIATE_TEST_CASE_P(InstantiationWithComments, CommentTest, Values(Unstreamable(1))); // Verify that we can create a hierarchy of test fixtures, where the base // class fixture is not parameterized and the derived class is. In this case // ParameterizedDerivedTest inherits from NonParameterizedBaseTest. We // perform simple tests on both. class NonParameterizedBaseTest : public ::testing::Test { public: NonParameterizedBaseTest() : n_(17) { } protected: int n_; }; class ParameterizedDerivedTest : public NonParameterizedBaseTest, public ::testing::WithParamInterface { protected: ParameterizedDerivedTest() : count_(0) { } int count_; static int global_count_; }; int ParameterizedDerivedTest::global_count_ = 0; TEST_F(NonParameterizedBaseTest, FixtureIsInitialized) { EXPECT_EQ(17, n_); } TEST_P(ParameterizedDerivedTest, SeesSequence) { EXPECT_EQ(17, n_); EXPECT_EQ(0, count_++); EXPECT_EQ(GetParam(), global_count_++); } INSTANTIATE_TEST_CASE_P(RangeZeroToFive, ParameterizedDerivedTest, Range(0, 5)); #endif // GTEST_HAS_PARAM_TEST TEST(CompileTest, CombineIsDefinedOnlyWhenGtestHasParamTestIsDefined) { #if GTEST_HAS_COMBINE && !GTEST_HAS_PARAM_TEST FAIL() << "GTEST_HAS_COMBINE is defined while GTEST_HAS_PARAM_TEST is not\n" #endif } int main(int argc, char **argv) { #if GTEST_HAS_PARAM_TEST // Used in TestGenerationTest test case. AddGlobalTestEnvironment(TestGenerationTest::Environment::Instance()); // Used in GeneratorEvaluationTest test case. Tests that the updated value // will be picked up for instantiating tests in GeneratorEvaluationTest. GeneratorEvaluationTest::set_param_value(1); #endif // GTEST_HAS_PARAM_TEST ::testing::InitGoogleTest(&argc, argv); #if GTEST_HAS_PARAM_TEST // Used in GeneratorEvaluationTest test case. Tests that value updated // here will NOT be used for instantiating tests in // GeneratorEvaluationTest. GeneratorEvaluationTest::set_param_value(2); #endif // GTEST_HAS_PARAM_TEST return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-param-test_test.h0000600000175000017500000000444511561126632025037 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev) // // The Google C++ Testing Framework (Google Test) // // This header file provides classes and functions used internally // for testing Google Test itself. #ifndef GTEST_TEST_GTEST_PARAM_TEST_TEST_H_ #define GTEST_TEST_GTEST_PARAM_TEST_TEST_H_ #include "gtest/gtest.h" #if GTEST_HAS_PARAM_TEST // Test fixture for testing definition and instantiation of a test // in separate translation units. class ExternalInstantiationTest : public ::testing::TestWithParam {}; // Test fixture for testing instantiation of a test in multiple // translation units. class InstantiationInMultipleTranslaionUnitsTest : public ::testing::TestWithParam {}; #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_TEST_GTEST_PARAM_TEST_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-port_test.cc0000600000175000017500000011127311561126632024102 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Authors: vladl@google.com (Vlad Losev), wan@google.com (Zhanyong Wan) // // This file tests the internal cross-platform support utilities. #include "gtest/internal/gtest-port.h" #include #if GTEST_OS_MAC # include #endif // GTEST_OS_MAC #include #include // For std::pair and std::make_pair. #include #include "gtest/gtest.h" #include "gtest/gtest-spi.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ using std::make_pair; using std::pair; namespace testing { namespace internal { class Base { public: // Copy constructor and assignment operator do exactly what we need, so we // use them. Base() : member_(0) {} explicit Base(int n) : member_(n) {} virtual ~Base() {} int member() { return member_; } private: int member_; }; class Derived : public Base { public: explicit Derived(int n) : Base(n) {} }; TEST(ImplicitCastTest, ConvertsPointers) { Derived derived(0); EXPECT_TRUE(&derived == ::testing::internal::ImplicitCast_(&derived)); } TEST(ImplicitCastTest, CanUseInheritance) { Derived derived(1); Base base = ::testing::internal::ImplicitCast_(derived); EXPECT_EQ(derived.member(), base.member()); } class Castable { public: Castable(bool* converted) : converted_(converted) {} operator Base() { *converted_ = true; return Base(); } private: bool* converted_; }; TEST(ImplicitCastTest, CanUseNonConstCastOperator) { bool converted = false; Castable castable(&converted); Base base = ::testing::internal::ImplicitCast_(castable); EXPECT_TRUE(converted); } class ConstCastable { public: ConstCastable(bool* converted) : converted_(converted) {} operator Base() const { *converted_ = true; return Base(); } private: bool* converted_; }; TEST(ImplicitCastTest, CanUseConstCastOperatorOnConstValues) { bool converted = false; const ConstCastable const_castable(&converted); Base base = ::testing::internal::ImplicitCast_(const_castable); EXPECT_TRUE(converted); } class ConstAndNonConstCastable { public: ConstAndNonConstCastable(bool* converted, bool* const_converted) : converted_(converted), const_converted_(const_converted) {} operator Base() { *converted_ = true; return Base(); } operator Base() const { *const_converted_ = true; return Base(); } private: bool* converted_; bool* const_converted_; }; TEST(ImplicitCastTest, CanSelectBetweenConstAndNonConstCasrAppropriately) { bool converted = false; bool const_converted = false; ConstAndNonConstCastable castable(&converted, &const_converted); Base base = ::testing::internal::ImplicitCast_(castable); EXPECT_TRUE(converted); EXPECT_FALSE(const_converted); converted = false; const_converted = false; const ConstAndNonConstCastable const_castable(&converted, &const_converted); base = ::testing::internal::ImplicitCast_(const_castable); EXPECT_FALSE(converted); EXPECT_TRUE(const_converted); } class To { public: To(bool* converted) { *converted = true; } // NOLINT }; TEST(ImplicitCastTest, CanUseImplicitConstructor) { bool converted = false; To to = ::testing::internal::ImplicitCast_(&converted); (void)to; EXPECT_TRUE(converted); } TEST(IteratorTraitsTest, WorksForSTLContainerIterators) { StaticAssertTypeEq::const_iterator>::value_type>(); StaticAssertTypeEq::iterator>::value_type>(); } TEST(IteratorTraitsTest, WorksForPointerToNonConst) { StaticAssertTypeEq::value_type>(); StaticAssertTypeEq::value_type>(); } TEST(IteratorTraitsTest, WorksForPointerToConst) { StaticAssertTypeEq::value_type>(); StaticAssertTypeEq::value_type>(); } // Tests that the element_type typedef is available in scoped_ptr and refers // to the parameter type. TEST(ScopedPtrTest, DefinesElementType) { StaticAssertTypeEq::element_type>(); } // TODO(vladl@google.com): Implement THE REST of scoped_ptr tests. TEST(GtestCheckSyntaxTest, BehavesLikeASingleStatement) { if (AlwaysFalse()) GTEST_CHECK_(false) << "This should never be executed; " "It's a compilation test only."; if (AlwaysTrue()) GTEST_CHECK_(true); else ; // NOLINT if (AlwaysFalse()) ; // NOLINT else GTEST_CHECK_(true) << ""; } TEST(GtestCheckSyntaxTest, WorksWithSwitch) { switch (0) { case 1: break; default: GTEST_CHECK_(true); } switch(0) case 0: GTEST_CHECK_(true) << "Check failed in switch case"; } // Verifies behavior of FormatFileLocation. TEST(FormatFileLocationTest, FormatsFileLocation) { EXPECT_PRED_FORMAT2(IsSubstring, "foo.cc", FormatFileLocation("foo.cc", 42)); EXPECT_PRED_FORMAT2(IsSubstring, "42", FormatFileLocation("foo.cc", 42)); } TEST(FormatFileLocationTest, FormatsUnknownFile) { EXPECT_PRED_FORMAT2( IsSubstring, "unknown file", FormatFileLocation(NULL, 42)); EXPECT_PRED_FORMAT2(IsSubstring, "42", FormatFileLocation(NULL, 42)); } TEST(FormatFileLocationTest, FormatsUknownLine) { EXPECT_EQ("foo.cc:", FormatFileLocation("foo.cc", -1)); } TEST(FormatFileLocationTest, FormatsUknownFileAndLine) { EXPECT_EQ("unknown file:", FormatFileLocation(NULL, -1)); } // Verifies behavior of FormatCompilerIndependentFileLocation. TEST(FormatCompilerIndependentFileLocationTest, FormatsFileLocation) { EXPECT_EQ("foo.cc:42", FormatCompilerIndependentFileLocation("foo.cc", 42)); } TEST(FormatCompilerIndependentFileLocationTest, FormatsUknownFile) { EXPECT_EQ("unknown file:42", FormatCompilerIndependentFileLocation(NULL, 42)); } TEST(FormatCompilerIndependentFileLocationTest, FormatsUknownLine) { EXPECT_EQ("foo.cc", FormatCompilerIndependentFileLocation("foo.cc", -1)); } TEST(FormatCompilerIndependentFileLocationTest, FormatsUknownFileAndLine) { EXPECT_EQ("unknown file", FormatCompilerIndependentFileLocation(NULL, -1)); } #if GTEST_OS_MAC void* ThreadFunc(void* data) { pthread_mutex_t* mutex = static_cast(data); pthread_mutex_lock(mutex); pthread_mutex_unlock(mutex); return NULL; } TEST(GetThreadCountTest, ReturnsCorrectValue) { EXPECT_EQ(1U, GetThreadCount()); pthread_mutex_t mutex; pthread_attr_t attr; pthread_t thread_id; // TODO(vladl@google.com): turn mutex into internal::Mutex for automatic // destruction. pthread_mutex_init(&mutex, NULL); pthread_mutex_lock(&mutex); ASSERT_EQ(0, pthread_attr_init(&attr)); ASSERT_EQ(0, pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE)); const int status = pthread_create(&thread_id, &attr, &ThreadFunc, &mutex); ASSERT_EQ(0, pthread_attr_destroy(&attr)); ASSERT_EQ(0, status); EXPECT_EQ(2U, GetThreadCount()); pthread_mutex_unlock(&mutex); void* dummy; ASSERT_EQ(0, pthread_join(thread_id, &dummy)); // MacOS X may not immediately report the updated thread count after // joining a thread, causing flakiness in this test. To counter that, we // wait for up to .5 seconds for the OS to report the correct value. for (int i = 0; i < 5; ++i) { if (GetThreadCount() == 1) break; SleepMilliseconds(100); } EXPECT_EQ(1U, GetThreadCount()); pthread_mutex_destroy(&mutex); } #else TEST(GetThreadCountTest, ReturnsZeroWhenUnableToCountThreads) { EXPECT_EQ(0U, GetThreadCount()); } #endif // GTEST_OS_MAC TEST(GtestCheckDeathTest, DiesWithCorrectOutputOnFailure) { const bool a_false_condition = false; const char regex[] = #ifdef _MSC_VER "gtest-port_test\\.cc\\(\\d+\\):" #elif GTEST_USES_POSIX_RE "gtest-port_test\\.cc:[0-9]+" #else "gtest-port_test\\.cc:\\d+" #endif // _MSC_VER ".*a_false_condition.*Extra info.*"; EXPECT_DEATH_IF_SUPPORTED(GTEST_CHECK_(a_false_condition) << "Extra info", regex); } #if GTEST_HAS_DEATH_TEST TEST(GtestCheckDeathTest, LivesSilentlyOnSuccess) { EXPECT_EXIT({ GTEST_CHECK_(true) << "Extra info"; ::std::cerr << "Success\n"; exit(0); }, ::testing::ExitedWithCode(0), "Success"); } #endif // GTEST_HAS_DEATH_TEST // Verifies that Google Test choose regular expression engine appropriate to // the platform. The test will produce compiler errors in case of failure. // For simplicity, we only cover the most important platforms here. TEST(RegexEngineSelectionTest, SelectsCorrectRegexEngine) { #if GTEST_HAS_POSIX_RE EXPECT_TRUE(GTEST_USES_POSIX_RE); #else EXPECT_TRUE(GTEST_USES_SIMPLE_RE); #endif } #if GTEST_USES_POSIX_RE # if GTEST_HAS_TYPED_TEST template class RETest : public ::testing::Test {}; // Defines StringTypes as the list of all string types that class RE // supports. typedef testing::Types< ::std::string, # if GTEST_HAS_GLOBAL_STRING ::string, # endif // GTEST_HAS_GLOBAL_STRING const char*> StringTypes; TYPED_TEST_CASE(RETest, StringTypes); // Tests RE's implicit constructors. TYPED_TEST(RETest, ImplicitConstructorWorks) { const RE empty(TypeParam("")); EXPECT_STREQ("", empty.pattern()); const RE simple(TypeParam("hello")); EXPECT_STREQ("hello", simple.pattern()); const RE normal(TypeParam(".*(\\w+)")); EXPECT_STREQ(".*(\\w+)", normal.pattern()); } // Tests that RE's constructors reject invalid regular expressions. TYPED_TEST(RETest, RejectsInvalidRegex) { EXPECT_NONFATAL_FAILURE({ const RE invalid(TypeParam("?")); }, "\"?\" is not a valid POSIX Extended regular expression."); } // Tests RE::FullMatch(). TYPED_TEST(RETest, FullMatchWorks) { const RE empty(TypeParam("")); EXPECT_TRUE(RE::FullMatch(TypeParam(""), empty)); EXPECT_FALSE(RE::FullMatch(TypeParam("a"), empty)); const RE re(TypeParam("a.*z")); EXPECT_TRUE(RE::FullMatch(TypeParam("az"), re)); EXPECT_TRUE(RE::FullMatch(TypeParam("axyz"), re)); EXPECT_FALSE(RE::FullMatch(TypeParam("baz"), re)); EXPECT_FALSE(RE::FullMatch(TypeParam("azy"), re)); } // Tests RE::PartialMatch(). TYPED_TEST(RETest, PartialMatchWorks) { const RE empty(TypeParam("")); EXPECT_TRUE(RE::PartialMatch(TypeParam(""), empty)); EXPECT_TRUE(RE::PartialMatch(TypeParam("a"), empty)); const RE re(TypeParam("a.*z")); EXPECT_TRUE(RE::PartialMatch(TypeParam("az"), re)); EXPECT_TRUE(RE::PartialMatch(TypeParam("axyz"), re)); EXPECT_TRUE(RE::PartialMatch(TypeParam("baz"), re)); EXPECT_TRUE(RE::PartialMatch(TypeParam("azy"), re)); EXPECT_FALSE(RE::PartialMatch(TypeParam("zza"), re)); } # endif // GTEST_HAS_TYPED_TEST #elif GTEST_USES_SIMPLE_RE TEST(IsInSetTest, NulCharIsNotInAnySet) { EXPECT_FALSE(IsInSet('\0', "")); EXPECT_FALSE(IsInSet('\0', "\0")); EXPECT_FALSE(IsInSet('\0', "a")); } TEST(IsInSetTest, WorksForNonNulChars) { EXPECT_FALSE(IsInSet('a', "Ab")); EXPECT_FALSE(IsInSet('c', "")); EXPECT_TRUE(IsInSet('b', "bcd")); EXPECT_TRUE(IsInSet('b', "ab")); } TEST(IsAsciiDigitTest, IsFalseForNonDigit) { EXPECT_FALSE(IsAsciiDigit('\0')); EXPECT_FALSE(IsAsciiDigit(' ')); EXPECT_FALSE(IsAsciiDigit('+')); EXPECT_FALSE(IsAsciiDigit('-')); EXPECT_FALSE(IsAsciiDigit('.')); EXPECT_FALSE(IsAsciiDigit('a')); } TEST(IsAsciiDigitTest, IsTrueForDigit) { EXPECT_TRUE(IsAsciiDigit('0')); EXPECT_TRUE(IsAsciiDigit('1')); EXPECT_TRUE(IsAsciiDigit('5')); EXPECT_TRUE(IsAsciiDigit('9')); } TEST(IsAsciiPunctTest, IsFalseForNonPunct) { EXPECT_FALSE(IsAsciiPunct('\0')); EXPECT_FALSE(IsAsciiPunct(' ')); EXPECT_FALSE(IsAsciiPunct('\n')); EXPECT_FALSE(IsAsciiPunct('a')); EXPECT_FALSE(IsAsciiPunct('0')); } TEST(IsAsciiPunctTest, IsTrueForPunct) { for (const char* p = "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"; *p; p++) { EXPECT_PRED1(IsAsciiPunct, *p); } } TEST(IsRepeatTest, IsFalseForNonRepeatChar) { EXPECT_FALSE(IsRepeat('\0')); EXPECT_FALSE(IsRepeat(' ')); EXPECT_FALSE(IsRepeat('a')); EXPECT_FALSE(IsRepeat('1')); EXPECT_FALSE(IsRepeat('-')); } TEST(IsRepeatTest, IsTrueForRepeatChar) { EXPECT_TRUE(IsRepeat('?')); EXPECT_TRUE(IsRepeat('*')); EXPECT_TRUE(IsRepeat('+')); } TEST(IsAsciiWhiteSpaceTest, IsFalseForNonWhiteSpace) { EXPECT_FALSE(IsAsciiWhiteSpace('\0')); EXPECT_FALSE(IsAsciiWhiteSpace('a')); EXPECT_FALSE(IsAsciiWhiteSpace('1')); EXPECT_FALSE(IsAsciiWhiteSpace('+')); EXPECT_FALSE(IsAsciiWhiteSpace('_')); } TEST(IsAsciiWhiteSpaceTest, IsTrueForWhiteSpace) { EXPECT_TRUE(IsAsciiWhiteSpace(' ')); EXPECT_TRUE(IsAsciiWhiteSpace('\n')); EXPECT_TRUE(IsAsciiWhiteSpace('\r')); EXPECT_TRUE(IsAsciiWhiteSpace('\t')); EXPECT_TRUE(IsAsciiWhiteSpace('\v')); EXPECT_TRUE(IsAsciiWhiteSpace('\f')); } TEST(IsAsciiWordCharTest, IsFalseForNonWordChar) { EXPECT_FALSE(IsAsciiWordChar('\0')); EXPECT_FALSE(IsAsciiWordChar('+')); EXPECT_FALSE(IsAsciiWordChar('.')); EXPECT_FALSE(IsAsciiWordChar(' ')); EXPECT_FALSE(IsAsciiWordChar('\n')); } TEST(IsAsciiWordCharTest, IsTrueForLetter) { EXPECT_TRUE(IsAsciiWordChar('a')); EXPECT_TRUE(IsAsciiWordChar('b')); EXPECT_TRUE(IsAsciiWordChar('A')); EXPECT_TRUE(IsAsciiWordChar('Z')); } TEST(IsAsciiWordCharTest, IsTrueForDigit) { EXPECT_TRUE(IsAsciiWordChar('0')); EXPECT_TRUE(IsAsciiWordChar('1')); EXPECT_TRUE(IsAsciiWordChar('7')); EXPECT_TRUE(IsAsciiWordChar('9')); } TEST(IsAsciiWordCharTest, IsTrueForUnderscore) { EXPECT_TRUE(IsAsciiWordChar('_')); } TEST(IsValidEscapeTest, IsFalseForNonPrintable) { EXPECT_FALSE(IsValidEscape('\0')); EXPECT_FALSE(IsValidEscape('\007')); } TEST(IsValidEscapeTest, IsFalseForDigit) { EXPECT_FALSE(IsValidEscape('0')); EXPECT_FALSE(IsValidEscape('9')); } TEST(IsValidEscapeTest, IsFalseForWhiteSpace) { EXPECT_FALSE(IsValidEscape(' ')); EXPECT_FALSE(IsValidEscape('\n')); } TEST(IsValidEscapeTest, IsFalseForSomeLetter) { EXPECT_FALSE(IsValidEscape('a')); EXPECT_FALSE(IsValidEscape('Z')); } TEST(IsValidEscapeTest, IsTrueForPunct) { EXPECT_TRUE(IsValidEscape('.')); EXPECT_TRUE(IsValidEscape('-')); EXPECT_TRUE(IsValidEscape('^')); EXPECT_TRUE(IsValidEscape('$')); EXPECT_TRUE(IsValidEscape('(')); EXPECT_TRUE(IsValidEscape(']')); EXPECT_TRUE(IsValidEscape('{')); EXPECT_TRUE(IsValidEscape('|')); } TEST(IsValidEscapeTest, IsTrueForSomeLetter) { EXPECT_TRUE(IsValidEscape('d')); EXPECT_TRUE(IsValidEscape('D')); EXPECT_TRUE(IsValidEscape('s')); EXPECT_TRUE(IsValidEscape('S')); EXPECT_TRUE(IsValidEscape('w')); EXPECT_TRUE(IsValidEscape('W')); } TEST(AtomMatchesCharTest, EscapedPunct) { EXPECT_FALSE(AtomMatchesChar(true, '\\', '\0')); EXPECT_FALSE(AtomMatchesChar(true, '\\', ' ')); EXPECT_FALSE(AtomMatchesChar(true, '_', '.')); EXPECT_FALSE(AtomMatchesChar(true, '.', 'a')); EXPECT_TRUE(AtomMatchesChar(true, '\\', '\\')); EXPECT_TRUE(AtomMatchesChar(true, '_', '_')); EXPECT_TRUE(AtomMatchesChar(true, '+', '+')); EXPECT_TRUE(AtomMatchesChar(true, '.', '.')); } TEST(AtomMatchesCharTest, Escaped_d) { EXPECT_FALSE(AtomMatchesChar(true, 'd', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'd', 'a')); EXPECT_FALSE(AtomMatchesChar(true, 'd', '.')); EXPECT_TRUE(AtomMatchesChar(true, 'd', '0')); EXPECT_TRUE(AtomMatchesChar(true, 'd', '9')); } TEST(AtomMatchesCharTest, Escaped_D) { EXPECT_FALSE(AtomMatchesChar(true, 'D', '0')); EXPECT_FALSE(AtomMatchesChar(true, 'D', '9')); EXPECT_TRUE(AtomMatchesChar(true, 'D', '\0')); EXPECT_TRUE(AtomMatchesChar(true, 'D', 'a')); EXPECT_TRUE(AtomMatchesChar(true, 'D', '-')); } TEST(AtomMatchesCharTest, Escaped_s) { EXPECT_FALSE(AtomMatchesChar(true, 's', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 's', 'a')); EXPECT_FALSE(AtomMatchesChar(true, 's', '.')); EXPECT_FALSE(AtomMatchesChar(true, 's', '9')); EXPECT_TRUE(AtomMatchesChar(true, 's', ' ')); EXPECT_TRUE(AtomMatchesChar(true, 's', '\n')); EXPECT_TRUE(AtomMatchesChar(true, 's', '\t')); } TEST(AtomMatchesCharTest, Escaped_S) { EXPECT_FALSE(AtomMatchesChar(true, 'S', ' ')); EXPECT_FALSE(AtomMatchesChar(true, 'S', '\r')); EXPECT_TRUE(AtomMatchesChar(true, 'S', '\0')); EXPECT_TRUE(AtomMatchesChar(true, 'S', 'a')); EXPECT_TRUE(AtomMatchesChar(true, 'S', '9')); } TEST(AtomMatchesCharTest, Escaped_w) { EXPECT_FALSE(AtomMatchesChar(true, 'w', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'w', '+')); EXPECT_FALSE(AtomMatchesChar(true, 'w', ' ')); EXPECT_FALSE(AtomMatchesChar(true, 'w', '\n')); EXPECT_TRUE(AtomMatchesChar(true, 'w', '0')); EXPECT_TRUE(AtomMatchesChar(true, 'w', 'b')); EXPECT_TRUE(AtomMatchesChar(true, 'w', 'C')); EXPECT_TRUE(AtomMatchesChar(true, 'w', '_')); } TEST(AtomMatchesCharTest, Escaped_W) { EXPECT_FALSE(AtomMatchesChar(true, 'W', 'A')); EXPECT_FALSE(AtomMatchesChar(true, 'W', 'b')); EXPECT_FALSE(AtomMatchesChar(true, 'W', '9')); EXPECT_FALSE(AtomMatchesChar(true, 'W', '_')); EXPECT_TRUE(AtomMatchesChar(true, 'W', '\0')); EXPECT_TRUE(AtomMatchesChar(true, 'W', '*')); EXPECT_TRUE(AtomMatchesChar(true, 'W', '\n')); } TEST(AtomMatchesCharTest, EscapedWhiteSpace) { EXPECT_FALSE(AtomMatchesChar(true, 'f', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'f', '\n')); EXPECT_FALSE(AtomMatchesChar(true, 'n', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'n', '\r')); EXPECT_FALSE(AtomMatchesChar(true, 'r', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'r', 'a')); EXPECT_FALSE(AtomMatchesChar(true, 't', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 't', 't')); EXPECT_FALSE(AtomMatchesChar(true, 'v', '\0')); EXPECT_FALSE(AtomMatchesChar(true, 'v', '\f')); EXPECT_TRUE(AtomMatchesChar(true, 'f', '\f')); EXPECT_TRUE(AtomMatchesChar(true, 'n', '\n')); EXPECT_TRUE(AtomMatchesChar(true, 'r', '\r')); EXPECT_TRUE(AtomMatchesChar(true, 't', '\t')); EXPECT_TRUE(AtomMatchesChar(true, 'v', '\v')); } TEST(AtomMatchesCharTest, UnescapedDot) { EXPECT_FALSE(AtomMatchesChar(false, '.', '\n')); EXPECT_TRUE(AtomMatchesChar(false, '.', '\0')); EXPECT_TRUE(AtomMatchesChar(false, '.', '.')); EXPECT_TRUE(AtomMatchesChar(false, '.', 'a')); EXPECT_TRUE(AtomMatchesChar(false, '.', ' ')); } TEST(AtomMatchesCharTest, UnescapedChar) { EXPECT_FALSE(AtomMatchesChar(false, 'a', '\0')); EXPECT_FALSE(AtomMatchesChar(false, 'a', 'b')); EXPECT_FALSE(AtomMatchesChar(false, '$', 'a')); EXPECT_TRUE(AtomMatchesChar(false, '$', '$')); EXPECT_TRUE(AtomMatchesChar(false, '5', '5')); EXPECT_TRUE(AtomMatchesChar(false, 'Z', 'Z')); } TEST(ValidateRegexTest, GeneratesFailureAndReturnsFalseForInvalid) { EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex(NULL)), "NULL is not a valid simple regular expression"); EXPECT_NONFATAL_FAILURE( ASSERT_FALSE(ValidateRegex("a\\")), "Syntax error at index 1 in simple regular expression \"a\\\": "); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("a\\")), "'\\' cannot appear at the end"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("\\n\\")), "'\\' cannot appear at the end"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("\\s\\hb")), "invalid escape sequence \"\\h\""); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("^^")), "'^' can only appear at the beginning"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex(".*^b")), "'^' can only appear at the beginning"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("$$")), "'$' can only appear at the end"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("^$a")), "'$' can only appear at the end"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("a(b")), "'(' is unsupported"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("ab)")), "')' is unsupported"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("[ab")), "'[' is unsupported"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("a{2")), "'{' is unsupported"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("?")), "'?' can only follow a repeatable token"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("^*")), "'*' can only follow a repeatable token"); EXPECT_NONFATAL_FAILURE(ASSERT_FALSE(ValidateRegex("5*+")), "'+' can only follow a repeatable token"); } TEST(ValidateRegexTest, ReturnsTrueForValid) { EXPECT_TRUE(ValidateRegex("")); EXPECT_TRUE(ValidateRegex("a")); EXPECT_TRUE(ValidateRegex(".*")); EXPECT_TRUE(ValidateRegex("^a_+")); EXPECT_TRUE(ValidateRegex("^a\\t\\&?")); EXPECT_TRUE(ValidateRegex("09*$")); EXPECT_TRUE(ValidateRegex("^Z$")); EXPECT_TRUE(ValidateRegex("a\\^Z\\$\\(\\)\\|\\[\\]\\{\\}")); } TEST(MatchRepetitionAndRegexAtHeadTest, WorksForZeroOrOne) { EXPECT_FALSE(MatchRepetitionAndRegexAtHead(false, 'a', '?', "a", "ba")); // Repeating more than once. EXPECT_FALSE(MatchRepetitionAndRegexAtHead(false, 'a', '?', "b", "aab")); // Repeating zero times. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, 'a', '?', "b", "ba")); // Repeating once. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, 'a', '?', "b", "ab")); EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, '#', '?', ".", "##")); } TEST(MatchRepetitionAndRegexAtHeadTest, WorksForZeroOrMany) { EXPECT_FALSE(MatchRepetitionAndRegexAtHead(false, '.', '*', "a$", "baab")); // Repeating zero times. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, '.', '*', "b", "bc")); // Repeating once. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, '.', '*', "b", "abc")); // Repeating more than once. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(true, 'w', '*', "-", "ab_1-g")); } TEST(MatchRepetitionAndRegexAtHeadTest, WorksForOneOrMany) { EXPECT_FALSE(MatchRepetitionAndRegexAtHead(false, '.', '+', "a$", "baab")); // Repeating zero times. EXPECT_FALSE(MatchRepetitionAndRegexAtHead(false, '.', '+', "b", "bc")); // Repeating once. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(false, '.', '+', "b", "abc")); // Repeating more than once. EXPECT_TRUE(MatchRepetitionAndRegexAtHead(true, 'w', '+', "-", "ab_1-g")); } TEST(MatchRegexAtHeadTest, ReturnsTrueForEmptyRegex) { EXPECT_TRUE(MatchRegexAtHead("", "")); EXPECT_TRUE(MatchRegexAtHead("", "ab")); } TEST(MatchRegexAtHeadTest, WorksWhenDollarIsInRegex) { EXPECT_FALSE(MatchRegexAtHead("$", "a")); EXPECT_TRUE(MatchRegexAtHead("$", "")); EXPECT_TRUE(MatchRegexAtHead("a$", "a")); } TEST(MatchRegexAtHeadTest, WorksWhenRegexStartsWithEscapeSequence) { EXPECT_FALSE(MatchRegexAtHead("\\w", "+")); EXPECT_FALSE(MatchRegexAtHead("\\W", "ab")); EXPECT_TRUE(MatchRegexAtHead("\\sa", "\nab")); EXPECT_TRUE(MatchRegexAtHead("\\d", "1a")); } TEST(MatchRegexAtHeadTest, WorksWhenRegexStartsWithRepetition) { EXPECT_FALSE(MatchRegexAtHead(".+a", "abc")); EXPECT_FALSE(MatchRegexAtHead("a?b", "aab")); EXPECT_TRUE(MatchRegexAtHead(".*a", "bc12-ab")); EXPECT_TRUE(MatchRegexAtHead("a?b", "b")); EXPECT_TRUE(MatchRegexAtHead("a?b", "ab")); } TEST(MatchRegexAtHeadTest, WorksWhenRegexStartsWithRepetionOfEscapeSequence) { EXPECT_FALSE(MatchRegexAtHead("\\.+a", "abc")); EXPECT_FALSE(MatchRegexAtHead("\\s?b", " b")); EXPECT_TRUE(MatchRegexAtHead("\\(*a", "((((ab")); EXPECT_TRUE(MatchRegexAtHead("\\^?b", "^b")); EXPECT_TRUE(MatchRegexAtHead("\\\\?b", "b")); EXPECT_TRUE(MatchRegexAtHead("\\\\?b", "\\b")); } TEST(MatchRegexAtHeadTest, MatchesSequentially) { EXPECT_FALSE(MatchRegexAtHead("ab.*c", "acabc")); EXPECT_TRUE(MatchRegexAtHead("ab.*c", "ab-fsc")); } TEST(MatchRegexAnywhereTest, ReturnsFalseWhenStringIsNull) { EXPECT_FALSE(MatchRegexAnywhere("", NULL)); } TEST(MatchRegexAnywhereTest, WorksWhenRegexStartsWithCaret) { EXPECT_FALSE(MatchRegexAnywhere("^a", "ba")); EXPECT_FALSE(MatchRegexAnywhere("^$", "a")); EXPECT_TRUE(MatchRegexAnywhere("^a", "ab")); EXPECT_TRUE(MatchRegexAnywhere("^", "ab")); EXPECT_TRUE(MatchRegexAnywhere("^$", "")); } TEST(MatchRegexAnywhereTest, ReturnsFalseWhenNoMatch) { EXPECT_FALSE(MatchRegexAnywhere("a", "bcde123")); EXPECT_FALSE(MatchRegexAnywhere("a.+a", "--aa88888888")); } TEST(MatchRegexAnywhereTest, ReturnsTrueWhenMatchingPrefix) { EXPECT_TRUE(MatchRegexAnywhere("\\w+", "ab1_ - 5")); EXPECT_TRUE(MatchRegexAnywhere(".*=", "=")); EXPECT_TRUE(MatchRegexAnywhere("x.*ab?.*bc", "xaaabc")); } TEST(MatchRegexAnywhereTest, ReturnsTrueWhenMatchingNonPrefix) { EXPECT_TRUE(MatchRegexAnywhere("\\w+", "$$$ ab1_ - 5")); EXPECT_TRUE(MatchRegexAnywhere("\\.+=", "= ...=")); } // Tests RE's implicit constructors. TEST(RETest, ImplicitConstructorWorks) { const RE empty(""); EXPECT_STREQ("", empty.pattern()); const RE simple("hello"); EXPECT_STREQ("hello", simple.pattern()); } // Tests that RE's constructors reject invalid regular expressions. TEST(RETest, RejectsInvalidRegex) { EXPECT_NONFATAL_FAILURE({ const RE normal(NULL); }, "NULL is not a valid simple regular expression"); EXPECT_NONFATAL_FAILURE({ const RE normal(".*(\\w+"); }, "'(' is unsupported"); EXPECT_NONFATAL_FAILURE({ const RE invalid("^?"); }, "'?' can only follow a repeatable token"); } // Tests RE::FullMatch(). TEST(RETest, FullMatchWorks) { const RE empty(""); EXPECT_TRUE(RE::FullMatch("", empty)); EXPECT_FALSE(RE::FullMatch("a", empty)); const RE re1("a"); EXPECT_TRUE(RE::FullMatch("a", re1)); const RE re("a.*z"); EXPECT_TRUE(RE::FullMatch("az", re)); EXPECT_TRUE(RE::FullMatch("axyz", re)); EXPECT_FALSE(RE::FullMatch("baz", re)); EXPECT_FALSE(RE::FullMatch("azy", re)); } // Tests RE::PartialMatch(). TEST(RETest, PartialMatchWorks) { const RE empty(""); EXPECT_TRUE(RE::PartialMatch("", empty)); EXPECT_TRUE(RE::PartialMatch("a", empty)); const RE re("a.*z"); EXPECT_TRUE(RE::PartialMatch("az", re)); EXPECT_TRUE(RE::PartialMatch("axyz", re)); EXPECT_TRUE(RE::PartialMatch("baz", re)); EXPECT_TRUE(RE::PartialMatch("azy", re)); EXPECT_FALSE(RE::PartialMatch("zza", re)); } #endif // GTEST_USES_POSIX_RE #if !GTEST_OS_WINDOWS_MOBILE TEST(CaptureTest, CapturesStdout) { CaptureStdout(); fprintf(stdout, "abc"); EXPECT_STREQ("abc", GetCapturedStdout().c_str()); CaptureStdout(); fprintf(stdout, "def%cghi", '\0'); EXPECT_EQ(::std::string("def\0ghi", 7), ::std::string(GetCapturedStdout())); } TEST(CaptureTest, CapturesStderr) { CaptureStderr(); fprintf(stderr, "jkl"); EXPECT_STREQ("jkl", GetCapturedStderr().c_str()); CaptureStderr(); fprintf(stderr, "jkl%cmno", '\0'); EXPECT_EQ(::std::string("jkl\0mno", 7), ::std::string(GetCapturedStderr())); } // Tests that stdout and stderr capture don't interfere with each other. TEST(CaptureTest, CapturesStdoutAndStderr) { CaptureStdout(); CaptureStderr(); fprintf(stdout, "pqr"); fprintf(stderr, "stu"); EXPECT_STREQ("pqr", GetCapturedStdout().c_str()); EXPECT_STREQ("stu", GetCapturedStderr().c_str()); } TEST(CaptureDeathTest, CannotReenterStdoutCapture) { CaptureStdout(); EXPECT_DEATH_IF_SUPPORTED(CaptureStdout();, "Only one stdout capturer can exist at a time"); GetCapturedStdout(); // We cannot test stderr capturing using death tests as they use it // themselves. } #endif // !GTEST_OS_WINDOWS_MOBILE TEST(ThreadLocalTest, DefaultConstructorInitializesToDefaultValues) { ThreadLocal t1; EXPECT_EQ(0, t1.get()); ThreadLocal t2; EXPECT_TRUE(t2.get() == NULL); } TEST(ThreadLocalTest, SingleParamConstructorInitializesToParam) { ThreadLocal t1(123); EXPECT_EQ(123, t1.get()); int i = 0; ThreadLocal t2(&i); EXPECT_EQ(&i, t2.get()); } class NoDefaultContructor { public: explicit NoDefaultContructor(const char*) {} NoDefaultContructor(const NoDefaultContructor&) {} }; TEST(ThreadLocalTest, ValueDefaultContructorIsNotRequiredForParamVersion) { ThreadLocal bar(NoDefaultContructor("foo")); bar.pointer(); } TEST(ThreadLocalTest, GetAndPointerReturnSameValue) { ThreadLocal thread_local; EXPECT_EQ(thread_local.pointer(), &(thread_local.get())); // Verifies the condition still holds after calling set. thread_local.set("foo"); EXPECT_EQ(thread_local.pointer(), &(thread_local.get())); } TEST(ThreadLocalTest, PointerAndConstPointerReturnSameValue) { ThreadLocal thread_local; const ThreadLocal& const_thread_local = thread_local; EXPECT_EQ(thread_local.pointer(), const_thread_local.pointer()); thread_local.set("foo"); EXPECT_EQ(thread_local.pointer(), const_thread_local.pointer()); } #if GTEST_IS_THREADSAFE void AddTwo(int* param) { *param += 2; } TEST(ThreadWithParamTest, ConstructorExecutesThreadFunc) { int i = 40; ThreadWithParam thread(&AddTwo, &i, NULL); thread.Join(); EXPECT_EQ(42, i); } TEST(MutexDeathTest, AssertHeldShouldAssertWhenNotLocked) { // AssertHeld() is flaky only in the presence of multiple threads accessing // the lock. In this case, the test is robust. EXPECT_DEATH_IF_SUPPORTED({ Mutex m; { MutexLock lock(&m); } m.AssertHeld(); }, "thread .*hold"); } TEST(MutexTest, AssertHeldShouldNotAssertWhenLocked) { Mutex m; MutexLock lock(&m); m.AssertHeld(); } class AtomicCounterWithMutex { public: explicit AtomicCounterWithMutex(Mutex* mutex) : value_(0), mutex_(mutex), random_(42) {} void Increment() { MutexLock lock(mutex_); int temp = value_; { // Locking a mutex puts up a memory barrier, preventing reads and // writes to value_ rearranged when observed from other threads. // // We cannot use Mutex and MutexLock here or rely on their memory // barrier functionality as we are testing them here. pthread_mutex_t memory_barrier_mutex; GTEST_CHECK_POSIX_SUCCESS_( pthread_mutex_init(&memory_barrier_mutex, NULL)); GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&memory_barrier_mutex)); SleepMilliseconds(random_.Generate(30)); GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&memory_barrier_mutex)); } value_ = temp + 1; } int value() const { return value_; } private: volatile int value_; Mutex* const mutex_; // Protects value_. Random random_; }; void CountingThreadFunc(pair param) { for (int i = 0; i < param.second; ++i) param.first->Increment(); } // Tests that the mutex only lets one thread at a time to lock it. TEST(MutexTest, OnlyOneThreadCanLockAtATime) { Mutex mutex; AtomicCounterWithMutex locked_counter(&mutex); typedef ThreadWithParam > ThreadType; const int kCycleCount = 20; const int kThreadCount = 7; scoped_ptr counting_threads[kThreadCount]; Notification threads_can_start; // Creates and runs kThreadCount threads that increment locked_counter // kCycleCount times each. for (int i = 0; i < kThreadCount; ++i) { counting_threads[i].reset(new ThreadType(&CountingThreadFunc, make_pair(&locked_counter, kCycleCount), &threads_can_start)); } threads_can_start.Notify(); for (int i = 0; i < kThreadCount; ++i) counting_threads[i]->Join(); // If the mutex lets more than one thread to increment the counter at a // time, they are likely to encounter a race condition and have some // increments overwritten, resulting in the lower then expected counter // value. EXPECT_EQ(kCycleCount * kThreadCount, locked_counter.value()); } template void RunFromThread(void (func)(T), T param) { ThreadWithParam thread(func, param, NULL); thread.Join(); } void RetrieveThreadLocalValue(pair*, String*> param) { *param.second = param.first->get(); } TEST(ThreadLocalTest, ParameterizedConstructorSetsDefault) { ThreadLocal thread_local("foo"); EXPECT_STREQ("foo", thread_local.get().c_str()); thread_local.set("bar"); EXPECT_STREQ("bar", thread_local.get().c_str()); String result; RunFromThread(&RetrieveThreadLocalValue, make_pair(&thread_local, &result)); EXPECT_STREQ("foo", result.c_str()); } // DestructorTracker keeps track of whether its instances have been // destroyed. static std::vector g_destroyed; class DestructorTracker { public: DestructorTracker() : index_(GetNewIndex()) {} DestructorTracker(const DestructorTracker& /* rhs */) : index_(GetNewIndex()) {} ~DestructorTracker() { // We never access g_destroyed concurrently, so we don't need to // protect the write operation under a mutex. g_destroyed[index_] = true; } private: static int GetNewIndex() { g_destroyed.push_back(false); return g_destroyed.size() - 1; } const int index_; }; typedef ThreadLocal* ThreadParam; void CallThreadLocalGet(ThreadParam thread_local) { thread_local->get(); } // Tests that when a ThreadLocal object dies in a thread, it destroys // the managed object for that thread. TEST(ThreadLocalTest, DestroysManagedObjectForOwnThreadWhenDying) { g_destroyed.clear(); { // The next line default constructs a DestructorTracker object as // the default value of objects managed by thread_local. ThreadLocal thread_local; ASSERT_EQ(1U, g_destroyed.size()); ASSERT_FALSE(g_destroyed[0]); // This creates another DestructorTracker object for the main thread. thread_local.get(); ASSERT_EQ(2U, g_destroyed.size()); ASSERT_FALSE(g_destroyed[0]); ASSERT_FALSE(g_destroyed[1]); } // Now thread_local has died. It should have destroyed both the // default value shared by all threads and the value for the main // thread. ASSERT_EQ(2U, g_destroyed.size()); EXPECT_TRUE(g_destroyed[0]); EXPECT_TRUE(g_destroyed[1]); g_destroyed.clear(); } // Tests that when a thread exits, the thread-local object for that // thread is destroyed. TEST(ThreadLocalTest, DestroysManagedObjectAtThreadExit) { g_destroyed.clear(); { // The next line default constructs a DestructorTracker object as // the default value of objects managed by thread_local. ThreadLocal thread_local; ASSERT_EQ(1U, g_destroyed.size()); ASSERT_FALSE(g_destroyed[0]); // This creates another DestructorTracker object in the new thread. ThreadWithParam thread( &CallThreadLocalGet, &thread_local, NULL); thread.Join(); // Now the new thread has exited. The per-thread object for it // should have been destroyed. ASSERT_EQ(2U, g_destroyed.size()); ASSERT_FALSE(g_destroyed[0]); ASSERT_TRUE(g_destroyed[1]); } // Now thread_local has died. The default value should have been // destroyed too. ASSERT_EQ(2U, g_destroyed.size()); EXPECT_TRUE(g_destroyed[0]); EXPECT_TRUE(g_destroyed[1]); g_destroyed.clear(); } TEST(ThreadLocalTest, ThreadLocalMutationsAffectOnlyCurrentThread) { ThreadLocal thread_local; thread_local.set("Foo"); EXPECT_STREQ("Foo", thread_local.get().c_str()); String result; RunFromThread(&RetrieveThreadLocalValue, make_pair(&thread_local, &result)); EXPECT_TRUE(result.c_str() == NULL); } #endif // GTEST_IS_THREADSAFE } // namespace internal } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-printers_test.cc0000600000175000017500000011633511561126632024770 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file tests the universal value printer. #include "gtest/gtest-printers.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "gtest/gtest.h" // hash_map and hash_set are available under Visual C++. #if _MSC_VER # define GTEST_HAS_HASH_MAP_ 1 // Indicates that hash_map is available. # include // NOLINT # define GTEST_HAS_HASH_SET_ 1 // Indicates that hash_set is available. # include // NOLINT #endif // GTEST_OS_WINDOWS // Some user-defined types for testing the universal value printer. // An anonymous enum type. enum AnonymousEnum { kAE1 = -1, kAE2 = 1 }; // An enum without a user-defined printer. enum EnumWithoutPrinter { kEWP1 = -2, kEWP2 = 42 }; // An enum with a << operator. enum EnumWithStreaming { kEWS1 = 10 }; std::ostream& operator<<(std::ostream& os, EnumWithStreaming e) { return os << (e == kEWS1 ? "kEWS1" : "invalid"); } // An enum with a PrintTo() function. enum EnumWithPrintTo { kEWPT1 = 1 }; void PrintTo(EnumWithPrintTo e, std::ostream* os) { *os << (e == kEWPT1 ? "kEWPT1" : "invalid"); } // A class implicitly convertible to BiggestInt. class BiggestIntConvertible { public: operator ::testing::internal::BiggestInt() const { return 42; } }; // A user-defined unprintable class template in the global namespace. template class UnprintableTemplateInGlobal { public: UnprintableTemplateInGlobal() : value_() {} private: T value_; }; // A user-defined streamable type in the global namespace. class StreamableInGlobal { public: virtual ~StreamableInGlobal() {} }; inline void operator<<(::std::ostream& os, const StreamableInGlobal& /* x */) { os << "StreamableInGlobal"; } void operator<<(::std::ostream& os, const StreamableInGlobal* /* x */) { os << "StreamableInGlobal*"; } namespace foo { // A user-defined unprintable type in a user namespace. class UnprintableInFoo { public: UnprintableInFoo() : z_(0) { memcpy(xy_, "\xEF\x12\x0\x0\x34\xAB\x0\x0", 8); } private: char xy_[8]; double z_; }; // A user-defined printable type in a user-chosen namespace. struct PrintableViaPrintTo { PrintableViaPrintTo() : value() {} int value; }; void PrintTo(const PrintableViaPrintTo& x, ::std::ostream* os) { *os << "PrintableViaPrintTo: " << x.value; } // A type with a user-defined << for printing its pointer. struct PointerPrintable { }; ::std::ostream& operator<<(::std::ostream& os, const PointerPrintable* /* x */) { return os << "PointerPrintable*"; } // A user-defined printable class template in a user-chosen namespace. template class PrintableViaPrintToTemplate { public: explicit PrintableViaPrintToTemplate(const T& a_value) : value_(a_value) {} const T& value() const { return value_; } private: T value_; }; template void PrintTo(const PrintableViaPrintToTemplate& x, ::std::ostream* os) { *os << "PrintableViaPrintToTemplate: " << x.value(); } // A user-defined streamable class template in a user namespace. template class StreamableTemplateInFoo { public: StreamableTemplateInFoo() : value_() {} const T& value() const { return value_; } private: T value_; }; template inline ::std::ostream& operator<<(::std::ostream& os, const StreamableTemplateInFoo& x) { return os << "StreamableTemplateInFoo: " << x.value(); } } // namespace foo namespace testing { namespace gtest_printers_test { using ::std::deque; using ::std::list; using ::std::make_pair; using ::std::map; using ::std::multimap; using ::std::multiset; using ::std::pair; using ::std::set; using ::std::vector; using ::testing::PrintToString; using ::testing::internal::NativeArray; using ::testing::internal::RE; using ::testing::internal::Strings; using ::testing::internal::UniversalTersePrint; using ::testing::internal::UniversalPrint; using ::testing::internal::UniversalTersePrintTupleFieldsToStrings; using ::testing::internal::UniversalPrinter; using ::testing::internal::kReference; using ::testing::internal::string; #if GTEST_HAS_TR1_TUPLE using ::std::tr1::make_tuple; using ::std::tr1::tuple; #endif #if _MSC_VER // MSVC defines the following classes in the ::stdext namespace while // gcc defines them in the :: namespace. Note that they are not part // of the C++ standard. using ::stdext::hash_map; using ::stdext::hash_set; using ::stdext::hash_multimap; using ::stdext::hash_multiset; #endif // Prints a value to a string using the universal value printer. This // is a helper for testing UniversalPrinter::Print() for various types. template string Print(const T& value) { ::std::stringstream ss; UniversalPrinter::Print(value, &ss); return ss.str(); } // Prints a value passed by reference to a string, using the universal // value printer. This is a helper for testing // UniversalPrinter::Print() for various types. template string PrintByRef(const T& value) { ::std::stringstream ss; UniversalPrinter::Print(value, &ss); return ss.str(); } // Tests printing various enum types. TEST(PrintEnumTest, AnonymousEnum) { EXPECT_EQ("-1", Print(kAE1)); EXPECT_EQ("1", Print(kAE2)); } TEST(PrintEnumTest, EnumWithoutPrinter) { EXPECT_EQ("-2", Print(kEWP1)); EXPECT_EQ("42", Print(kEWP2)); } TEST(PrintEnumTest, EnumWithStreaming) { EXPECT_EQ("kEWS1", Print(kEWS1)); EXPECT_EQ("invalid", Print(static_cast(0))); } TEST(PrintEnumTest, EnumWithPrintTo) { EXPECT_EQ("kEWPT1", Print(kEWPT1)); EXPECT_EQ("invalid", Print(static_cast(0))); } // Tests printing a class implicitly convertible to BiggestInt. TEST(PrintClassTest, BiggestIntConvertible) { EXPECT_EQ("42", Print(BiggestIntConvertible())); } // Tests printing various char types. // char. TEST(PrintCharTest, PlainChar) { EXPECT_EQ("'\\0'", Print('\0')); EXPECT_EQ("'\\'' (39, 0x27)", Print('\'')); EXPECT_EQ("'\"' (34, 0x22)", Print('"')); EXPECT_EQ("'?' (63, 0x3F)", Print('?')); EXPECT_EQ("'\\\\' (92, 0x5C)", Print('\\')); EXPECT_EQ("'\\a' (7)", Print('\a')); EXPECT_EQ("'\\b' (8)", Print('\b')); EXPECT_EQ("'\\f' (12, 0xC)", Print('\f')); EXPECT_EQ("'\\n' (10, 0xA)", Print('\n')); EXPECT_EQ("'\\r' (13, 0xD)", Print('\r')); EXPECT_EQ("'\\t' (9)", Print('\t')); EXPECT_EQ("'\\v' (11, 0xB)", Print('\v')); EXPECT_EQ("'\\x7F' (127)", Print('\x7F')); EXPECT_EQ("'\\xFF' (255)", Print('\xFF')); EXPECT_EQ("' ' (32, 0x20)", Print(' ')); EXPECT_EQ("'a' (97, 0x61)", Print('a')); } // signed char. TEST(PrintCharTest, SignedChar) { EXPECT_EQ("'\\0'", Print(static_cast('\0'))); EXPECT_EQ("'\\xCE' (-50)", Print(static_cast(-50))); } // unsigned char. TEST(PrintCharTest, UnsignedChar) { EXPECT_EQ("'\\0'", Print(static_cast('\0'))); EXPECT_EQ("'b' (98, 0x62)", Print(static_cast('b'))); } // Tests printing other simple, built-in types. // bool. TEST(PrintBuiltInTypeTest, Bool) { EXPECT_EQ("false", Print(false)); EXPECT_EQ("true", Print(true)); } // wchar_t. TEST(PrintBuiltInTypeTest, Wchar_t) { EXPECT_EQ("L'\\0'", Print(L'\0')); EXPECT_EQ("L'\\'' (39, 0x27)", Print(L'\'')); EXPECT_EQ("L'\"' (34, 0x22)", Print(L'"')); EXPECT_EQ("L'?' (63, 0x3F)", Print(L'?')); EXPECT_EQ("L'\\\\' (92, 0x5C)", Print(L'\\')); EXPECT_EQ("L'\\a' (7)", Print(L'\a')); EXPECT_EQ("L'\\b' (8)", Print(L'\b')); EXPECT_EQ("L'\\f' (12, 0xC)", Print(L'\f')); EXPECT_EQ("L'\\n' (10, 0xA)", Print(L'\n')); EXPECT_EQ("L'\\r' (13, 0xD)", Print(L'\r')); EXPECT_EQ("L'\\t' (9)", Print(L'\t')); EXPECT_EQ("L'\\v' (11, 0xB)", Print(L'\v')); EXPECT_EQ("L'\\x7F' (127)", Print(L'\x7F')); EXPECT_EQ("L'\\xFF' (255)", Print(L'\xFF')); EXPECT_EQ("L' ' (32, 0x20)", Print(L' ')); EXPECT_EQ("L'a' (97, 0x61)", Print(L'a')); EXPECT_EQ("L'\\x576' (1398)", Print(static_cast(0x576))); EXPECT_EQ("L'\\xC74D' (51021)", Print(static_cast(0xC74D))); } // Test that Int64 provides more storage than wchar_t. TEST(PrintTypeSizeTest, Wchar_t) { EXPECT_LT(sizeof(wchar_t), sizeof(testing::internal::Int64)); } // Various integer types. TEST(PrintBuiltInTypeTest, Integer) { EXPECT_EQ("'\\xFF' (255)", Print(static_cast(255))); // uint8 EXPECT_EQ("'\\x80' (-128)", Print(static_cast(-128))); // int8 EXPECT_EQ("65535", Print(USHRT_MAX)); // uint16 EXPECT_EQ("-32768", Print(SHRT_MIN)); // int16 EXPECT_EQ("4294967295", Print(UINT_MAX)); // uint32 EXPECT_EQ("-2147483648", Print(INT_MIN)); // int32 EXPECT_EQ("18446744073709551615", Print(static_cast(-1))); // uint64 EXPECT_EQ("-9223372036854775808", Print(static_cast(1) << 63)); // int64 } // Size types. TEST(PrintBuiltInTypeTest, Size_t) { EXPECT_EQ("1", Print(sizeof('a'))); // size_t. #if !GTEST_OS_WINDOWS // Windows has no ssize_t type. EXPECT_EQ("-2", Print(static_cast(-2))); // ssize_t. #endif // !GTEST_OS_WINDOWS } // Floating-points. TEST(PrintBuiltInTypeTest, FloatingPoints) { EXPECT_EQ("1.5", Print(1.5f)); // float EXPECT_EQ("-2.5", Print(-2.5)); // double } // Since ::std::stringstream::operator<<(const void *) formats the pointer // output differently with different compilers, we have to create the expected // output first and use it as our expectation. static string PrintPointer(const void *p) { ::std::stringstream expected_result_stream; expected_result_stream << p; return expected_result_stream.str(); } // Tests printing C strings. // const char*. TEST(PrintCStringTest, Const) { const char* p = "World"; EXPECT_EQ(PrintPointer(p) + " pointing to \"World\"", Print(p)); } // char*. TEST(PrintCStringTest, NonConst) { char p[] = "Hi"; EXPECT_EQ(PrintPointer(p) + " pointing to \"Hi\"", Print(static_cast(p))); } // NULL C string. TEST(PrintCStringTest, Null) { const char* p = NULL; EXPECT_EQ("NULL", Print(p)); } // Tests that C strings are escaped properly. TEST(PrintCStringTest, EscapesProperly) { const char* p = "'\"?\\\a\b\f\n\r\t\v\x7F\xFF a"; EXPECT_EQ(PrintPointer(p) + " pointing to \"'\\\"?\\\\\\a\\b\\f" "\\n\\r\\t\\v\\x7F\\xFF a\"", Print(p)); } // MSVC compiler can be configured to define whar_t as a typedef // of unsigned short. Defining an overload for const wchar_t* in that case // would cause pointers to unsigned shorts be printed as wide strings, // possibly accessing more memory than intended and causing invalid // memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when // wchar_t is implemented as a native type. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // const wchar_t*. TEST(PrintWideCStringTest, Const) { const wchar_t* p = L"World"; EXPECT_EQ(PrintPointer(p) + " pointing to L\"World\"", Print(p)); } // wchar_t*. TEST(PrintWideCStringTest, NonConst) { wchar_t p[] = L"Hi"; EXPECT_EQ(PrintPointer(p) + " pointing to L\"Hi\"", Print(static_cast(p))); } // NULL wide C string. TEST(PrintWideCStringTest, Null) { const wchar_t* p = NULL; EXPECT_EQ("NULL", Print(p)); } // Tests that wide C strings are escaped properly. TEST(PrintWideCStringTest, EscapesProperly) { const wchar_t s[] = {'\'', '"', '?', '\\', '\a', '\b', '\f', '\n', '\r', '\t', '\v', 0xD3, 0x576, 0x8D3, 0xC74D, ' ', 'a', '\0'}; EXPECT_EQ(PrintPointer(s) + " pointing to L\"'\\\"?\\\\\\a\\b\\f" "\\n\\r\\t\\v\\xD3\\x576\\x8D3\\xC74D a\"", Print(static_cast(s))); } #endif // native wchar_t // Tests printing pointers to other char types. // signed char*. TEST(PrintCharPointerTest, SignedChar) { signed char* p = reinterpret_cast(0x1234); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // const signed char*. TEST(PrintCharPointerTest, ConstSignedChar) { signed char* p = reinterpret_cast(0x1234); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // unsigned char*. TEST(PrintCharPointerTest, UnsignedChar) { unsigned char* p = reinterpret_cast(0x1234); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // const unsigned char*. TEST(PrintCharPointerTest, ConstUnsignedChar) { const unsigned char* p = reinterpret_cast(0x1234); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // Tests printing pointers to simple, built-in types. // bool*. TEST(PrintPointerToBuiltInTypeTest, Bool) { bool* p = reinterpret_cast(0xABCD); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // void*. TEST(PrintPointerToBuiltInTypeTest, Void) { void* p = reinterpret_cast(0xABCD); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // const void*. TEST(PrintPointerToBuiltInTypeTest, ConstVoid) { const void* p = reinterpret_cast(0xABCD); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // Tests printing pointers to pointers. TEST(PrintPointerToPointerTest, IntPointerPointer) { int** p = reinterpret_cast(0xABCD); EXPECT_EQ(PrintPointer(p), Print(p)); p = NULL; EXPECT_EQ("NULL", Print(p)); } // Tests printing (non-member) function pointers. void MyFunction(int /* n */) {} TEST(PrintPointerTest, NonMemberFunctionPointer) { // We cannot directly cast &MyFunction to const void* because the // standard disallows casting between pointers to functions and // pointers to objects, and some compilers (e.g. GCC 3.4) enforce // this limitation. EXPECT_EQ( PrintPointer(reinterpret_cast( reinterpret_cast(&MyFunction))), Print(&MyFunction)); int (*p)(bool) = NULL; // NOLINT EXPECT_EQ("NULL", Print(p)); } // An assertion predicate determining whether a one string is a prefix for // another. template AssertionResult HasPrefix(const StringType& str, const StringType& prefix) { if (str.find(prefix, 0) == 0) return AssertionSuccess(); const bool is_wide_string = sizeof(prefix[0]) > 1; const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; return AssertionFailure() << begin_string_quote << prefix << "\" is not a prefix of " << begin_string_quote << str << "\"\n"; } // Tests printing member variable pointers. Although they are called // pointers, they don't point to a location in the address space. // Their representation is implementation-defined. Thus they will be // printed as raw bytes. struct Foo { public: virtual ~Foo() {} int MyMethod(char x) { return x + 1; } virtual char MyVirtualMethod(int /* n */) { return 'a'; } int value; }; TEST(PrintPointerTest, MemberVariablePointer) { EXPECT_TRUE(HasPrefix(Print(&Foo::value), Print(sizeof(&Foo::value)) + "-byte object ")); int (Foo::*p) = NULL; // NOLINT EXPECT_TRUE(HasPrefix(Print(p), Print(sizeof(p)) + "-byte object ")); } // Tests printing member function pointers. Although they are called // pointers, they don't point to a location in the address space. // Their representation is implementation-defined. Thus they will be // printed as raw bytes. TEST(PrintPointerTest, MemberFunctionPointer) { EXPECT_TRUE(HasPrefix(Print(&Foo::MyMethod), Print(sizeof(&Foo::MyMethod)) + "-byte object ")); EXPECT_TRUE( HasPrefix(Print(&Foo::MyVirtualMethod), Print(sizeof((&Foo::MyVirtualMethod))) + "-byte object ")); int (Foo::*p)(char) = NULL; // NOLINT EXPECT_TRUE(HasPrefix(Print(p), Print(sizeof(p)) + "-byte object ")); } // Tests printing C arrays. // The difference between this and Print() is that it ensures that the // argument is a reference to an array. template string PrintArrayHelper(T (&a)[N]) { return Print(a); } // One-dimensional array. TEST(PrintArrayTest, OneDimensionalArray) { int a[5] = { 1, 2, 3, 4, 5 }; EXPECT_EQ("{ 1, 2, 3, 4, 5 }", PrintArrayHelper(a)); } // Two-dimensional array. TEST(PrintArrayTest, TwoDimensionalArray) { int a[2][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 0 } }; EXPECT_EQ("{ { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 0 } }", PrintArrayHelper(a)); } // Array of const elements. TEST(PrintArrayTest, ConstArray) { const bool a[1] = { false }; EXPECT_EQ("{ false }", PrintArrayHelper(a)); } // Char array. TEST(PrintArrayTest, CharArray) { // Array a contains '\0' in the middle and doesn't end with '\0'. char a[3] = { 'H', '\0', 'i' }; EXPECT_EQ("\"H\\0i\"", PrintArrayHelper(a)); } // Const char array. TEST(PrintArrayTest, ConstCharArray) { const char a[4] = "\0Hi"; EXPECT_EQ("\"\\0Hi\\0\"", PrintArrayHelper(a)); } // Array of objects. TEST(PrintArrayTest, ObjectArray) { string a[3] = { "Hi", "Hello", "Ni hao" }; EXPECT_EQ("{ \"Hi\", \"Hello\", \"Ni hao\" }", PrintArrayHelper(a)); } // Array with many elements. TEST(PrintArrayTest, BigArray) { int a[100] = { 1, 2, 3 }; EXPECT_EQ("{ 1, 2, 3, 0, 0, 0, 0, 0, ..., 0, 0, 0, 0, 0, 0, 0, 0 }", PrintArrayHelper(a)); } // Tests printing ::string and ::std::string. #if GTEST_HAS_GLOBAL_STRING // ::string. TEST(PrintStringTest, StringInGlobalNamespace) { const char s[] = "'\"?\\\a\b\f\n\0\r\t\v\x7F\xFF a"; const ::string str(s, sizeof(s)); EXPECT_EQ("\"'\\\"?\\\\\\a\\b\\f\\n\\0\\r\\t\\v\\x7F\\xFF a\\0\"", Print(str)); } #endif // GTEST_HAS_GLOBAL_STRING // ::std::string. TEST(PrintStringTest, StringInStdNamespace) { const char s[] = "'\"?\\\a\b\f\n\0\r\t\v\x7F\xFF a"; const ::std::string str(s, sizeof(s)); EXPECT_EQ("\"'\\\"?\\\\\\a\\b\\f\\n\\0\\r\\t\\v\\x7F\\xFF a\\0\"", Print(str)); } TEST(PrintStringTest, StringAmbiguousHex) { // "\x6BANANA" is ambiguous, it can be interpreted as starting with either of: // '\x6', '\x6B', or '\x6BA'. // a hex escaping sequence following by a decimal digit EXPECT_EQ("\"0\\x12\" \"3\"", Print(::std::string("0\x12" "3"))); // a hex escaping sequence following by a hex digit (lower-case) EXPECT_EQ("\"mm\\x6\" \"bananas\"", Print(::std::string("mm\x6" "bananas"))); // a hex escaping sequence following by a hex digit (upper-case) EXPECT_EQ("\"NOM\\x6\" \"BANANA\"", Print(::std::string("NOM\x6" "BANANA"))); // a hex escaping sequence following by a non-xdigit EXPECT_EQ("\"!\\x5-!\"", Print(::std::string("!\x5-!"))); } // Tests printing ::wstring and ::std::wstring. #if GTEST_HAS_GLOBAL_WSTRING // ::wstring. TEST(PrintWideStringTest, StringInGlobalNamespace) { const wchar_t s[] = L"'\"?\\\a\b\f\n\0\r\t\v\xD3\x576\x8D3\xC74D a"; const ::wstring str(s, sizeof(s)/sizeof(wchar_t)); EXPECT_EQ("L\"'\\\"?\\\\\\a\\b\\f\\n\\0\\r\\t\\v" "\\xD3\\x576\\x8D3\\xC74D a\\0\"", Print(str)); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING // ::std::wstring. TEST(PrintWideStringTest, StringInStdNamespace) { const wchar_t s[] = L"'\"?\\\a\b\f\n\0\r\t\v\xD3\x576\x8D3\xC74D a"; const ::std::wstring str(s, sizeof(s)/sizeof(wchar_t)); EXPECT_EQ("L\"'\\\"?\\\\\\a\\b\\f\\n\\0\\r\\t\\v" "\\xD3\\x576\\x8D3\\xC74D a\\0\"", Print(str)); } TEST(PrintWideStringTest, StringAmbiguousHex) { // same for wide strings. EXPECT_EQ("L\"0\\x12\" L\"3\"", Print(::std::wstring(L"0\x12" L"3"))); EXPECT_EQ("L\"mm\\x6\" L\"bananas\"", Print(::std::wstring(L"mm\x6" L"bananas"))); EXPECT_EQ("L\"NOM\\x6\" L\"BANANA\"", Print(::std::wstring(L"NOM\x6" L"BANANA"))); EXPECT_EQ("L\"!\\x5-!\"", Print(::std::wstring(L"!\x5-!"))); } #endif // GTEST_HAS_STD_WSTRING // Tests printing types that support generic streaming (i.e. streaming // to std::basic_ostream for any valid Char and // CharTraits types). // Tests printing a non-template type that supports generic streaming. class AllowsGenericStreaming {}; template std::basic_ostream& operator<<( std::basic_ostream& os, const AllowsGenericStreaming& /* a */) { return os << "AllowsGenericStreaming"; } TEST(PrintTypeWithGenericStreamingTest, NonTemplateType) { AllowsGenericStreaming a; EXPECT_EQ("AllowsGenericStreaming", Print(a)); } // Tests printing a template type that supports generic streaming. template class AllowsGenericStreamingTemplate {}; template std::basic_ostream& operator<<( std::basic_ostream& os, const AllowsGenericStreamingTemplate& /* a */) { return os << "AllowsGenericStreamingTemplate"; } TEST(PrintTypeWithGenericStreamingTest, TemplateType) { AllowsGenericStreamingTemplate a; EXPECT_EQ("AllowsGenericStreamingTemplate", Print(a)); } // Tests printing a type that supports generic streaming and can be // implicitly converted to another printable type. template class AllowsGenericStreamingAndImplicitConversionTemplate { public: operator bool() const { return false; } }; template std::basic_ostream& operator<<( std::basic_ostream& os, const AllowsGenericStreamingAndImplicitConversionTemplate& /* a */) { return os << "AllowsGenericStreamingAndImplicitConversionTemplate"; } TEST(PrintTypeWithGenericStreamingTest, TypeImplicitlyConvertible) { AllowsGenericStreamingAndImplicitConversionTemplate a; EXPECT_EQ("AllowsGenericStreamingAndImplicitConversionTemplate", Print(a)); } #if GTEST_HAS_STRING_PIECE_ // Tests printing StringPiece. TEST(PrintStringPieceTest, SimpleStringPiece) { const StringPiece sp = "Hello"; EXPECT_EQ("\"Hello\"", Print(sp)); } TEST(PrintStringPieceTest, UnprintableCharacters) { const char str[] = "NUL (\0) and \r\t"; const StringPiece sp(str, sizeof(str) - 1); EXPECT_EQ("\"NUL (\\0) and \\r\\t\"", Print(sp)); } #endif // GTEST_HAS_STRING_PIECE_ // Tests printing STL containers. TEST(PrintStlContainerTest, EmptyDeque) { deque empty; EXPECT_EQ("{}", Print(empty)); } TEST(PrintStlContainerTest, NonEmptyDeque) { deque non_empty; non_empty.push_back(1); non_empty.push_back(3); EXPECT_EQ("{ 1, 3 }", Print(non_empty)); } #if GTEST_HAS_HASH_MAP_ TEST(PrintStlContainerTest, OneElementHashMap) { hash_map map1; map1[1] = 'a'; EXPECT_EQ("{ (1, 'a' (97, 0x61)) }", Print(map1)); } TEST(PrintStlContainerTest, HashMultiMap) { hash_multimap map1; map1.insert(make_pair(5, true)); map1.insert(make_pair(5, false)); // Elements of hash_multimap can be printed in any order. const string result = Print(map1); EXPECT_TRUE(result == "{ (5, true), (5, false) }" || result == "{ (5, false), (5, true) }") << " where Print(map1) returns \"" << result << "\"."; } #endif // GTEST_HAS_HASH_MAP_ #if GTEST_HAS_HASH_SET_ TEST(PrintStlContainerTest, HashSet) { hash_set set1; set1.insert("hello"); EXPECT_EQ("{ \"hello\" }", Print(set1)); } TEST(PrintStlContainerTest, HashMultiSet) { const int kSize = 5; int a[kSize] = { 1, 1, 2, 5, 1 }; hash_multiset set1(a, a + kSize); // Elements of hash_multiset can be printed in any order. const string result = Print(set1); const string expected_pattern = "{ d, d, d, d, d }"; // d means a digit. // Verifies the result matches the expected pattern; also extracts // the numbers in the result. ASSERT_EQ(expected_pattern.length(), result.length()); std::vector numbers; for (size_t i = 0; i != result.length(); i++) { if (expected_pattern[i] == 'd') { ASSERT_TRUE(isdigit(static_cast(result[i])) != 0); numbers.push_back(result[i] - '0'); } else { EXPECT_EQ(expected_pattern[i], result[i]) << " where result is " << result; } } // Makes sure the result contains the right numbers. std::sort(numbers.begin(), numbers.end()); std::sort(a, a + kSize); EXPECT_TRUE(std::equal(a, a + kSize, numbers.begin())); } #endif // GTEST_HAS_HASH_SET_ TEST(PrintStlContainerTest, List) { const string a[] = { "hello", "world" }; const list strings(a, a + 2); EXPECT_EQ("{ \"hello\", \"world\" }", Print(strings)); } TEST(PrintStlContainerTest, Map) { map map1; map1[1] = true; map1[5] = false; map1[3] = true; EXPECT_EQ("{ (1, true), (3, true), (5, false) }", Print(map1)); } TEST(PrintStlContainerTest, MultiMap) { multimap map1; // The make_pair template function would deduce the type as // pair here, and since the key part in a multimap has to // be constant, without a templated ctor in the pair class (as in // libCstd on Solaris), make_pair call would fail to compile as no // implicit conversion is found. Thus explicit typename is used // here instead. map1.insert(pair(true, 0)); map1.insert(pair(true, 1)); map1.insert(pair(false, 2)); EXPECT_EQ("{ (false, 2), (true, 0), (true, 1) }", Print(map1)); } TEST(PrintStlContainerTest, Set) { const unsigned int a[] = { 3, 0, 5 }; set set1(a, a + 3); EXPECT_EQ("{ 0, 3, 5 }", Print(set1)); } TEST(PrintStlContainerTest, MultiSet) { const int a[] = { 1, 1, 2, 5, 1 }; multiset set1(a, a + 5); EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1)); } TEST(PrintStlContainerTest, Pair) { pair p(true, 5); EXPECT_EQ("(true, 5)", Print(p)); } TEST(PrintStlContainerTest, Vector) { vector v; v.push_back(1); v.push_back(2); EXPECT_EQ("{ 1, 2 }", Print(v)); } TEST(PrintStlContainerTest, LongSequence) { const int a[100] = { 1, 2, 3 }; const vector v(a, a + 100); EXPECT_EQ("{ 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, " "0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... }", Print(v)); } TEST(PrintStlContainerTest, NestedContainer) { const int a1[] = { 1, 2 }; const int a2[] = { 3, 4, 5 }; const list l1(a1, a1 + 2); const list l2(a2, a2 + 3); vector > v; v.push_back(l1); v.push_back(l2); EXPECT_EQ("{ { 1, 2 }, { 3, 4, 5 } }", Print(v)); } TEST(PrintStlContainerTest, OneDimensionalNativeArray) { const int a[3] = { 1, 2, 3 }; NativeArray b(a, 3, kReference); EXPECT_EQ("{ 1, 2, 3 }", Print(b)); } TEST(PrintStlContainerTest, TwoDimensionalNativeArray) { const int a[2][3] = { { 1, 2, 3 }, { 4, 5, 6 } }; NativeArray b(a, 2, kReference); EXPECT_EQ("{ { 1, 2, 3 }, { 4, 5, 6 } }", Print(b)); } // Tests that a class named iterator isn't treated as a container. struct iterator { char x; }; TEST(PrintStlContainerTest, Iterator) { iterator it = {}; EXPECT_EQ("1-byte object <00>", Print(it)); } // Tests that a class named const_iterator isn't treated as a container. struct const_iterator { char x; }; TEST(PrintStlContainerTest, ConstIterator) { const_iterator it = {}; EXPECT_EQ("1-byte object <00>", Print(it)); } #if GTEST_HAS_TR1_TUPLE // Tests printing tuples. // Tuples of various arities. TEST(PrintTupleTest, VariousSizes) { tuple<> t0; EXPECT_EQ("()", Print(t0)); tuple t1(5); EXPECT_EQ("(5)", Print(t1)); tuple t2('a', true); EXPECT_EQ("('a' (97, 0x61), true)", Print(t2)); tuple t3(false, 2, 3); EXPECT_EQ("(false, 2, 3)", Print(t3)); tuple t4(false, 2, 3, 4); EXPECT_EQ("(false, 2, 3, 4)", Print(t4)); tuple t5(false, 2, 3, 4, true); EXPECT_EQ("(false, 2, 3, 4, true)", Print(t5)); tuple t6(false, 2, 3, 4, true, 6); EXPECT_EQ("(false, 2, 3, 4, true, 6)", Print(t6)); tuple t7(false, 2, 3, 4, true, 6, 7); EXPECT_EQ("(false, 2, 3, 4, true, 6, 7)", Print(t7)); tuple t8( false, 2, 3, 4, true, 6, 7, true); EXPECT_EQ("(false, 2, 3, 4, true, 6, 7, true)", Print(t8)); tuple t9( false, 2, 3, 4, true, 6, 7, true, 9); EXPECT_EQ("(false, 2, 3, 4, true, 6, 7, true, 9)", Print(t9)); const char* const str = "8"; tuple t10(false, 'a', 3, 4, 5, 1.5F, -2.5, str, NULL, "10"); EXPECT_EQ("(false, 'a' (97, 0x61), 3, 4, 5, 1.5, -2.5, " + PrintPointer(str) + " pointing to \"8\", NULL, \"10\")", Print(t10)); } // Nested tuples. TEST(PrintTupleTest, NestedTuple) { tuple, char> nested(make_tuple(5, true), 'a'); EXPECT_EQ("((5, true), 'a' (97, 0x61))", Print(nested)); } #endif // GTEST_HAS_TR1_TUPLE // Tests printing user-defined unprintable types. // Unprintable types in the global namespace. TEST(PrintUnprintableTypeTest, InGlobalNamespace) { EXPECT_EQ("1-byte object <00>", Print(UnprintableTemplateInGlobal())); } // Unprintable types in a user namespace. TEST(PrintUnprintableTypeTest, InUserNamespace) { EXPECT_EQ("16-byte object ", Print(::foo::UnprintableInFoo())); } // Unprintable types are that too big to be printed completely. struct Big { Big() { memset(array, 0, sizeof(array)); } char array[257]; }; TEST(PrintUnpritableTypeTest, BigObject) { EXPECT_EQ("257-byte object <00-00 00-00 00-00 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 ... 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 " "00-00 00-00 00-00 00-00 00-00 00-00 00-00 00-00 00>", Print(Big())); } // Tests printing user-defined streamable types. // Streamable types in the global namespace. TEST(PrintStreamableTypeTest, InGlobalNamespace) { StreamableInGlobal x; EXPECT_EQ("StreamableInGlobal", Print(x)); EXPECT_EQ("StreamableInGlobal*", Print(&x)); } // Printable template types in a user namespace. TEST(PrintStreamableTypeTest, TemplateTypeInUserNamespace) { EXPECT_EQ("StreamableTemplateInFoo: 0", Print(::foo::StreamableTemplateInFoo())); } // Tests printing user-defined types that have a PrintTo() function. TEST(PrintPrintableTypeTest, InUserNamespace) { EXPECT_EQ("PrintableViaPrintTo: 0", Print(::foo::PrintableViaPrintTo())); } // Tests printing a pointer to a user-defined type that has a << // operator for its pointer. TEST(PrintPrintableTypeTest, PointerInUserNamespace) { ::foo::PointerPrintable x; EXPECT_EQ("PointerPrintable*", Print(&x)); } // Tests printing user-defined class template that have a PrintTo() function. TEST(PrintPrintableTypeTest, TemplateInUserNamespace) { EXPECT_EQ("PrintableViaPrintToTemplate: 5", Print(::foo::PrintableViaPrintToTemplate(5))); } #if GTEST_HAS_PROTOBUF_ // Tests printing a protocol message. TEST(PrintProtocolMessageTest, PrintsShortDebugString) { testing::internal::TestMessage msg; msg.set_member("yes"); EXPECT_EQ("", Print(msg)); } // Tests printing a short proto2 message. TEST(PrintProto2MessageTest, PrintsShortDebugStringWhenItIsShort) { testing::internal::FooMessage msg; msg.set_int_field(2); msg.set_string_field("hello"); EXPECT_PRED2(RE::FullMatch, Print(msg), ""); } // Tests printing a long proto2 message. TEST(PrintProto2MessageTest, PrintsDebugStringWhenItIsLong) { testing::internal::FooMessage msg; msg.set_int_field(2); msg.set_string_field("hello"); msg.add_names("peter"); msg.add_names("paul"); msg.add_names("mary"); EXPECT_PRED2(RE::FullMatch, Print(msg), "<\n" "int_field:\\s*2\n" "string_field:\\s*\"hello\"\n" "names:\\s*\"peter\"\n" "names:\\s*\"paul\"\n" "names:\\s*\"mary\"\n" ">"); } #endif // GTEST_HAS_PROTOBUF_ // Tests that the universal printer prints both the address and the // value of a reference. TEST(PrintReferenceTest, PrintsAddressAndValue) { int n = 5; EXPECT_EQ("@" + PrintPointer(&n) + " 5", PrintByRef(n)); int a[2][3] = { { 0, 1, 2 }, { 3, 4, 5 } }; EXPECT_EQ("@" + PrintPointer(a) + " { { 0, 1, 2 }, { 3, 4, 5 } }", PrintByRef(a)); const ::foo::UnprintableInFoo x; EXPECT_EQ("@" + PrintPointer(&x) + " 16-byte object " "", PrintByRef(x)); } // Tests that the universal printer prints a function pointer passed by // reference. TEST(PrintReferenceTest, HandlesFunctionPointer) { void (*fp)(int n) = &MyFunction; const string fp_pointer_string = PrintPointer(reinterpret_cast(&fp)); // We cannot directly cast &MyFunction to const void* because the // standard disallows casting between pointers to functions and // pointers to objects, and some compilers (e.g. GCC 3.4) enforce // this limitation. const string fp_string = PrintPointer(reinterpret_cast( reinterpret_cast(fp))); EXPECT_EQ("@" + fp_pointer_string + " " + fp_string, PrintByRef(fp)); } // Tests that the universal printer prints a member function pointer // passed by reference. TEST(PrintReferenceTest, HandlesMemberFunctionPointer) { int (Foo::*p)(char ch) = &Foo::MyMethod; EXPECT_TRUE(HasPrefix( PrintByRef(p), "@" + PrintPointer(reinterpret_cast(&p)) + " " + Print(sizeof(p)) + "-byte object ")); char (Foo::*p2)(int n) = &Foo::MyVirtualMethod; EXPECT_TRUE(HasPrefix( PrintByRef(p2), "@" + PrintPointer(reinterpret_cast(&p2)) + " " + Print(sizeof(p2)) + "-byte object ")); } // Tests that the universal printer prints a member variable pointer // passed by reference. TEST(PrintReferenceTest, HandlesMemberVariablePointer) { int (Foo::*p) = &Foo::value; // NOLINT EXPECT_TRUE(HasPrefix( PrintByRef(p), "@" + PrintPointer(&p) + " " + Print(sizeof(p)) + "-byte object ")); } // Useful for testing PrintToString(). We cannot use EXPECT_EQ() // there as its implementation uses PrintToString(). The caller must // ensure that 'value' has no side effect. #define EXPECT_PRINT_TO_STRING_(value, expected_string) \ EXPECT_TRUE(PrintToString(value) == (expected_string)) \ << " where " #value " prints as " << (PrintToString(value)) TEST(PrintToStringTest, WorksForScalar) { EXPECT_PRINT_TO_STRING_(123, "123"); } TEST(PrintToStringTest, WorksForPointerToConstChar) { const char* p = "hello"; EXPECT_PRINT_TO_STRING_(p, "\"hello\""); } TEST(PrintToStringTest, WorksForPointerToNonConstChar) { char s[] = "hello"; char* p = s; EXPECT_PRINT_TO_STRING_(p, "\"hello\""); } TEST(PrintToStringTest, WorksForArray) { int n[3] = { 1, 2, 3 }; EXPECT_PRINT_TO_STRING_(n, "{ 1, 2, 3 }"); } #undef EXPECT_PRINT_TO_STRING_ TEST(UniversalTersePrintTest, WorksForNonReference) { ::std::stringstream ss; UniversalTersePrint(123, &ss); EXPECT_EQ("123", ss.str()); } TEST(UniversalTersePrintTest, WorksForReference) { const int& n = 123; ::std::stringstream ss; UniversalTersePrint(n, &ss); EXPECT_EQ("123", ss.str()); } TEST(UniversalTersePrintTest, WorksForCString) { const char* s1 = "abc"; ::std::stringstream ss1; UniversalTersePrint(s1, &ss1); EXPECT_EQ("\"abc\"", ss1.str()); char* s2 = const_cast(s1); ::std::stringstream ss2; UniversalTersePrint(s2, &ss2); EXPECT_EQ("\"abc\"", ss2.str()); const char* s3 = NULL; ::std::stringstream ss3; UniversalTersePrint(s3, &ss3); EXPECT_EQ("NULL", ss3.str()); } TEST(UniversalPrintTest, WorksForNonReference) { ::std::stringstream ss; UniversalPrint(123, &ss); EXPECT_EQ("123", ss.str()); } TEST(UniversalPrintTest, WorksForReference) { const int& n = 123; ::std::stringstream ss; UniversalPrint(n, &ss); EXPECT_EQ("123", ss.str()); } TEST(UniversalPrintTest, WorksForCString) { const char* s1 = "abc"; ::std::stringstream ss1; UniversalPrint(s1, &ss1); EXPECT_EQ(PrintPointer(s1) + " pointing to \"abc\"", string(ss1.str())); char* s2 = const_cast(s1); ::std::stringstream ss2; UniversalPrint(s2, &ss2); EXPECT_EQ(PrintPointer(s2) + " pointing to \"abc\"", string(ss2.str())); const char* s3 = NULL; ::std::stringstream ss3; UniversalPrint(s3, &ss3); EXPECT_EQ("NULL", ss3.str()); } #if GTEST_HAS_TR1_TUPLE TEST(UniversalTersePrintTupleFieldsToStringsTest, PrintsEmptyTuple) { Strings result = UniversalTersePrintTupleFieldsToStrings(make_tuple()); EXPECT_EQ(0u, result.size()); } TEST(UniversalTersePrintTupleFieldsToStringsTest, PrintsOneTuple) { Strings result = UniversalTersePrintTupleFieldsToStrings(make_tuple(1)); ASSERT_EQ(1u, result.size()); EXPECT_EQ("1", result[0]); } TEST(UniversalTersePrintTupleFieldsToStringsTest, PrintsTwoTuple) { Strings result = UniversalTersePrintTupleFieldsToStrings(make_tuple(1, 'a')); ASSERT_EQ(2u, result.size()); EXPECT_EQ("1", result[0]); EXPECT_EQ("'a' (97, 0x61)", result[1]); } TEST(UniversalTersePrintTupleFieldsToStringsTest, PrintsTersely) { const int n = 1; Strings result = UniversalTersePrintTupleFieldsToStrings( tuple(n, "a")); ASSERT_EQ(2u, result.size()); EXPECT_EQ("1", result[0]); EXPECT_EQ("\"a\"", result[1]); } #endif // GTEST_HAS_TR1_TUPLE } // namespace gtest_printers_test } // namespace testing synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-test-part_test.cc0000600000175000017500000001616211561126632025042 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // #include "gtest/gtest-test-part.h" #include "gtest/gtest.h" using testing::Message; using testing::Test; using testing::TestPartResult; using testing::TestPartResultArray; namespace { // Tests the TestPartResult class. // The test fixture for testing TestPartResult. class TestPartResultTest : public Test { protected: TestPartResultTest() : r1_(TestPartResult::kSuccess, "foo/bar.cc", 10, "Success!"), r2_(TestPartResult::kNonFatalFailure, "foo/bar.cc", -1, "Failure!"), r3_(TestPartResult::kFatalFailure, NULL, -1, "Failure!") {} TestPartResult r1_, r2_, r3_; }; TEST_F(TestPartResultTest, ConstructorWorks) { Message message; message << "something is terribly wrong"; message << static_cast(testing::internal::kStackTraceMarker); message << "some unimportant stack trace"; const TestPartResult result(TestPartResult::kNonFatalFailure, "some_file.cc", 42, message.GetString().c_str()); EXPECT_EQ(TestPartResult::kNonFatalFailure, result.type()); EXPECT_STREQ("some_file.cc", result.file_name()); EXPECT_EQ(42, result.line_number()); EXPECT_STREQ(message.GetString().c_str(), result.message()); EXPECT_STREQ("something is terribly wrong", result.summary()); } TEST_F(TestPartResultTest, ResultAccessorsWork) { const TestPartResult success(TestPartResult::kSuccess, "file.cc", 42, "message"); EXPECT_TRUE(success.passed()); EXPECT_FALSE(success.failed()); EXPECT_FALSE(success.nonfatally_failed()); EXPECT_FALSE(success.fatally_failed()); const TestPartResult nonfatal_failure(TestPartResult::kNonFatalFailure, "file.cc", 42, "message"); EXPECT_FALSE(nonfatal_failure.passed()); EXPECT_TRUE(nonfatal_failure.failed()); EXPECT_TRUE(nonfatal_failure.nonfatally_failed()); EXPECT_FALSE(nonfatal_failure.fatally_failed()); const TestPartResult fatal_failure(TestPartResult::kFatalFailure, "file.cc", 42, "message"); EXPECT_FALSE(fatal_failure.passed()); EXPECT_TRUE(fatal_failure.failed()); EXPECT_FALSE(fatal_failure.nonfatally_failed()); EXPECT_TRUE(fatal_failure.fatally_failed()); } // Tests TestPartResult::type(). TEST_F(TestPartResultTest, type) { EXPECT_EQ(TestPartResult::kSuccess, r1_.type()); EXPECT_EQ(TestPartResult::kNonFatalFailure, r2_.type()); EXPECT_EQ(TestPartResult::kFatalFailure, r3_.type()); } // Tests TestPartResult::file_name(). TEST_F(TestPartResultTest, file_name) { EXPECT_STREQ("foo/bar.cc", r1_.file_name()); EXPECT_STREQ(NULL, r3_.file_name()); } // Tests TestPartResult::line_number(). TEST_F(TestPartResultTest, line_number) { EXPECT_EQ(10, r1_.line_number()); EXPECT_EQ(-1, r2_.line_number()); } // Tests TestPartResult::message(). TEST_F(TestPartResultTest, message) { EXPECT_STREQ("Success!", r1_.message()); } // Tests TestPartResult::passed(). TEST_F(TestPartResultTest, Passed) { EXPECT_TRUE(r1_.passed()); EXPECT_FALSE(r2_.passed()); EXPECT_FALSE(r3_.passed()); } // Tests TestPartResult::failed(). TEST_F(TestPartResultTest, Failed) { EXPECT_FALSE(r1_.failed()); EXPECT_TRUE(r2_.failed()); EXPECT_TRUE(r3_.failed()); } // Tests TestPartResult::fatally_failed(). TEST_F(TestPartResultTest, FatallyFailed) { EXPECT_FALSE(r1_.fatally_failed()); EXPECT_FALSE(r2_.fatally_failed()); EXPECT_TRUE(r3_.fatally_failed()); } // Tests TestPartResult::nonfatally_failed(). TEST_F(TestPartResultTest, NonfatallyFailed) { EXPECT_FALSE(r1_.nonfatally_failed()); EXPECT_TRUE(r2_.nonfatally_failed()); EXPECT_FALSE(r3_.nonfatally_failed()); } // Tests the TestPartResultArray class. class TestPartResultArrayTest : public Test { protected: TestPartResultArrayTest() : r1_(TestPartResult::kNonFatalFailure, "foo/bar.cc", -1, "Failure 1"), r2_(TestPartResult::kFatalFailure, "foo/bar.cc", -1, "Failure 2") {} const TestPartResult r1_, r2_; }; // Tests that TestPartResultArray initially has size 0. TEST_F(TestPartResultArrayTest, InitialSizeIsZero) { TestPartResultArray results; EXPECT_EQ(0, results.size()); } // Tests that TestPartResultArray contains the given TestPartResult // after one Append() operation. TEST_F(TestPartResultArrayTest, ContainsGivenResultAfterAppend) { TestPartResultArray results; results.Append(r1_); EXPECT_EQ(1, results.size()); EXPECT_STREQ("Failure 1", results.GetTestPartResult(0).message()); } // Tests that TestPartResultArray contains the given TestPartResults // after two Append() operations. TEST_F(TestPartResultArrayTest, ContainsGivenResultsAfterTwoAppends) { TestPartResultArray results; results.Append(r1_); results.Append(r2_); EXPECT_EQ(2, results.size()); EXPECT_STREQ("Failure 1", results.GetTestPartResult(0).message()); EXPECT_STREQ("Failure 2", results.GetTestPartResult(1).message()); } typedef TestPartResultArrayTest TestPartResultArrayDeathTest; // Tests that the program dies when GetTestPartResult() is called with // an invalid index. TEST_F(TestPartResultArrayDeathTest, DiesWhenIndexIsOutOfBound) { TestPartResultArray results; results.Append(r1_); EXPECT_DEATH_IF_SUPPORTED(results.GetTestPartResult(-1), ""); EXPECT_DEATH_IF_SUPPORTED(results.GetTestPartResult(1), ""); } // TODO(mheule@google.com): Add a test for the class HasNewFatalFailureHelper. } // namespace synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-tuple_test.cc0000600000175000017500000002204211561126632024242 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/internal/gtest-tuple.h" #include #include "gtest/gtest.h" namespace { using ::std::tr1::get; using ::std::tr1::make_tuple; using ::std::tr1::tuple; using ::std::tr1::tuple_element; using ::std::tr1::tuple_size; using ::testing::StaticAssertTypeEq; // Tests that tuple_element >::type returns TK. TEST(tuple_element_Test, ReturnsElementType) { StaticAssertTypeEq >::type>(); StaticAssertTypeEq >::type>(); StaticAssertTypeEq >::type>(); } // Tests that tuple_size::value gives the number of fields in tuple // type T. TEST(tuple_size_Test, ReturnsNumberOfFields) { EXPECT_EQ(0, +tuple_size >::value); EXPECT_EQ(1, +tuple_size >::value); EXPECT_EQ(1, +tuple_size >::value); EXPECT_EQ(1, +(tuple_size > >::value)); EXPECT_EQ(2, +(tuple_size >::value)); EXPECT_EQ(3, +(tuple_size >::value)); } // Tests comparing a tuple with itself. TEST(ComparisonTest, ComparesWithSelf) { const tuple a(5, 'a', false); EXPECT_TRUE(a == a); EXPECT_FALSE(a != a); } // Tests comparing two tuples with the same value. TEST(ComparisonTest, ComparesEqualTuples) { const tuple a(5, true), b(5, true); EXPECT_TRUE(a == b); EXPECT_FALSE(a != b); } // Tests comparing two different tuples that have no reference fields. TEST(ComparisonTest, ComparesUnequalTuplesWithoutReferenceFields) { typedef tuple FooTuple; const FooTuple a(0, 'x'); const FooTuple b(1, 'a'); EXPECT_TRUE(a != b); EXPECT_FALSE(a == b); const FooTuple c(1, 'b'); EXPECT_TRUE(b != c); EXPECT_FALSE(b == c); } // Tests comparing two different tuples that have reference fields. TEST(ComparisonTest, ComparesUnequalTuplesWithReferenceFields) { typedef tuple FooTuple; int i = 5; const char ch = 'a'; const FooTuple a(i, ch); int j = 6; const FooTuple b(j, ch); EXPECT_TRUE(a != b); EXPECT_FALSE(a == b); j = 5; const char ch2 = 'b'; const FooTuple c(j, ch2); EXPECT_TRUE(b != c); EXPECT_FALSE(b == c); } // Tests that a tuple field with a reference type is an alias of the // variable it's supposed to reference. TEST(ReferenceFieldTest, IsAliasOfReferencedVariable) { int n = 0; tuple t(true, n); n = 1; EXPECT_EQ(n, get<1>(t)) << "Changing a underlying variable should update the reference field."; // Makes sure that the implementation doesn't do anything funny with // the & operator for the return type of get<>(). EXPECT_EQ(&n, &(get<1>(t))) << "The address of a reference field should equal the address of " << "the underlying variable."; get<1>(t) = 2; EXPECT_EQ(2, n) << "Changing a reference field should update the underlying variable."; } // Tests that tuple's default constructor default initializes each field. // This test needs to compile without generating warnings. TEST(TupleConstructorTest, DefaultConstructorDefaultInitializesEachField) { // The TR1 report requires that tuple's default constructor default // initializes each field, even if it's a primitive type. If the // implementation forgets to do this, this test will catch it by // generating warnings about using uninitialized variables (assuming // a decent compiler). tuple<> empty; tuple a1, b1; b1 = a1; EXPECT_EQ(0, get<0>(b1)); tuple a2, b2; b2 = a2; EXPECT_EQ(0, get<0>(b2)); EXPECT_EQ(0.0, get<1>(b2)); tuple a3, b3; b3 = a3; EXPECT_EQ(0.0, get<0>(b3)); EXPECT_EQ('\0', get<1>(b3)); EXPECT_TRUE(get<2>(b3) == NULL); tuple a10, b10; b10 = a10; EXPECT_EQ(0, get<0>(b10)); EXPECT_EQ(0, get<1>(b10)); EXPECT_EQ(0, get<2>(b10)); EXPECT_EQ(0, get<3>(b10)); EXPECT_EQ(0, get<4>(b10)); EXPECT_EQ(0, get<5>(b10)); EXPECT_EQ(0, get<6>(b10)); EXPECT_EQ(0, get<7>(b10)); EXPECT_EQ(0, get<8>(b10)); EXPECT_EQ(0, get<9>(b10)); } // Tests constructing a tuple from its fields. TEST(TupleConstructorTest, ConstructsFromFields) { int n = 1; // Reference field. tuple a(n); EXPECT_EQ(&n, &(get<0>(a))); // Non-reference fields. tuple b(5, 'a'); EXPECT_EQ(5, get<0>(b)); EXPECT_EQ('a', get<1>(b)); // Const reference field. const int m = 2; tuple c(true, m); EXPECT_TRUE(get<0>(c)); EXPECT_EQ(&m, &(get<1>(c))); } // Tests tuple's copy constructor. TEST(TupleConstructorTest, CopyConstructor) { tuple a(0.0, true); tuple b(a); EXPECT_DOUBLE_EQ(0.0, get<0>(b)); EXPECT_TRUE(get<1>(b)); } // Tests constructing a tuple from another tuple that has a compatible // but different type. TEST(TupleConstructorTest, ConstructsFromDifferentTupleType) { tuple a(0, 1, 'a'); tuple b(a); EXPECT_DOUBLE_EQ(0.0, get<0>(b)); EXPECT_EQ(1, get<1>(b)); EXPECT_EQ('a', get<2>(b)); } // Tests constructing a 2-tuple from an std::pair. TEST(TupleConstructorTest, ConstructsFromPair) { ::std::pair a(1, 'a'); tuple b(a); tuple c(a); } // Tests assigning a tuple to another tuple with the same type. TEST(TupleAssignmentTest, AssignsToSameTupleType) { const tuple a(5, 7L); tuple b; b = a; EXPECT_EQ(5, get<0>(b)); EXPECT_EQ(7L, get<1>(b)); } // Tests assigning a tuple to another tuple with a different but // compatible type. TEST(TupleAssignmentTest, AssignsToDifferentTupleType) { const tuple a(1, 7L, true); tuple b; b = a; EXPECT_EQ(1L, get<0>(b)); EXPECT_EQ(7, get<1>(b)); EXPECT_TRUE(get<2>(b)); } // Tests assigning an std::pair to a 2-tuple. TEST(TupleAssignmentTest, AssignsFromPair) { const ::std::pair a(5, true); tuple b; b = a; EXPECT_EQ(5, get<0>(b)); EXPECT_TRUE(get<1>(b)); tuple c; c = a; EXPECT_EQ(5L, get<0>(c)); EXPECT_TRUE(get<1>(c)); } // A fixture for testing big tuples. class BigTupleTest : public testing::Test { protected: typedef tuple BigTuple; BigTupleTest() : a_(1, 0, 0, 0, 0, 0, 0, 0, 0, 2), b_(1, 0, 0, 0, 0, 0, 0, 0, 0, 3) {} BigTuple a_, b_; }; // Tests constructing big tuples. TEST_F(BigTupleTest, Construction) { BigTuple a; BigTuple b(b_); } // Tests that get(t) returns the N-th (0-based) field of tuple t. TEST_F(BigTupleTest, get) { EXPECT_EQ(1, get<0>(a_)); EXPECT_EQ(2, get<9>(a_)); // Tests that get() works on a const tuple too. const BigTuple a(a_); EXPECT_EQ(1, get<0>(a)); EXPECT_EQ(2, get<9>(a)); } // Tests comparing big tuples. TEST_F(BigTupleTest, Comparisons) { EXPECT_TRUE(a_ == a_); EXPECT_FALSE(a_ != a_); EXPECT_TRUE(a_ != b_); EXPECT_FALSE(a_ == b_); } TEST(MakeTupleTest, WorksForScalarTypes) { tuple a; a = make_tuple(true, 5); EXPECT_TRUE(get<0>(a)); EXPECT_EQ(5, get<1>(a)); tuple b; b = make_tuple('a', 'b', 5); EXPECT_EQ('a', get<0>(b)); EXPECT_EQ('b', get<1>(b)); EXPECT_EQ(5, get<2>(b)); } TEST(MakeTupleTest, WorksForPointers) { int a[] = { 1, 2, 3, 4 }; const char* const str = "hi"; int* const p = a; tuple t; t = make_tuple(str, p); EXPECT_EQ(str, get<0>(t)); EXPECT_EQ(p, get<1>(t)); } } // namespace synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-typed-test2_test.cc0000600000175000017500000000401311561126632025273 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include "test/gtest-typed-test_test.h" #include "gtest/gtest.h" #if GTEST_HAS_TYPED_TEST_P // Tests that the same type-parameterized test case can be // instantiated in different translation units linked together. // (ContainerTest is also instantiated in gtest-typed-test_test.cc.) INSTANTIATE_TYPED_TEST_CASE_P(Vector, ContainerTest, testing::Types >); #endif // GTEST_HAS_TYPED_TEST_P synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-typed-test_test.cc0000600000175000017500000002615111561126632025220 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include #include #include "test/gtest-typed-test_test.h" #include "gtest/gtest.h" using testing::Test; // Used for testing that SetUpTestCase()/TearDownTestCase(), fixture // ctor/dtor, and SetUp()/TearDown() work correctly in typed tests and // type-parameterized test. template class CommonTest : public Test { // For some technical reason, SetUpTestCase() and TearDownTestCase() // must be public. public: static void SetUpTestCase() { shared_ = new T(5); } static void TearDownTestCase() { delete shared_; shared_ = NULL; } // This 'protected:' is optional. There's no harm in making all // members of this fixture class template public. protected: // We used to use std::list here, but switched to std::vector since // MSVC's doesn't compile cleanly with /W4. typedef std::vector Vector; typedef std::set IntSet; CommonTest() : value_(1) {} virtual ~CommonTest() { EXPECT_EQ(3, value_); } virtual void SetUp() { EXPECT_EQ(1, value_); value_++; } virtual void TearDown() { EXPECT_EQ(2, value_); value_++; } T value_; static T* shared_; }; template T* CommonTest::shared_ = NULL; // This #ifdef block tests typed tests. #if GTEST_HAS_TYPED_TEST using testing::Types; // Tests that SetUpTestCase()/TearDownTestCase(), fixture ctor/dtor, // and SetUp()/TearDown() work correctly in typed tests typedef Types TwoTypes; TYPED_TEST_CASE(CommonTest, TwoTypes); TYPED_TEST(CommonTest, ValuesAreCorrect) { // Static members of the fixture class template can be visited via // the TestFixture:: prefix. EXPECT_EQ(5, *TestFixture::shared_); // Typedefs in the fixture class template can be visited via the // "typename TestFixture::" prefix. typename TestFixture::Vector empty; EXPECT_EQ(0U, empty.size()); typename TestFixture::IntSet empty2; EXPECT_EQ(0U, empty2.size()); // Non-static members of the fixture class must be visited via // 'this', as required by C++ for class templates. EXPECT_EQ(2, this->value_); } // The second test makes sure shared_ is not deleted after the first // test. TYPED_TEST(CommonTest, ValuesAreStillCorrect) { // Static members of the fixture class template can also be visited // via 'this'. ASSERT_TRUE(this->shared_ != NULL); EXPECT_EQ(5, *this->shared_); // TypeParam can be used to refer to the type parameter. EXPECT_EQ(static_cast(2), this->value_); } // Tests that multiple TYPED_TEST_CASE's can be defined in the same // translation unit. template class TypedTest1 : public Test { }; // Verifies that the second argument of TYPED_TEST_CASE can be a // single type. TYPED_TEST_CASE(TypedTest1, int); TYPED_TEST(TypedTest1, A) {} template class TypedTest2 : public Test { }; // Verifies that the second argument of TYPED_TEST_CASE can be a // Types<...> type list. TYPED_TEST_CASE(TypedTest2, Types); // This also verifies that tests from different typed test cases can // share the same name. TYPED_TEST(TypedTest2, A) {} // Tests that a typed test case can be defined in a namespace. namespace library1 { template class NumericTest : public Test { }; typedef Types NumericTypes; TYPED_TEST_CASE(NumericTest, NumericTypes); TYPED_TEST(NumericTest, DefaultIsZero) { EXPECT_EQ(0, TypeParam()); } } // namespace library1 #endif // GTEST_HAS_TYPED_TEST // This #ifdef block tests type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P using testing::Types; using testing::internal::TypedTestCasePState; // Tests TypedTestCasePState. class TypedTestCasePStateTest : public Test { protected: virtual void SetUp() { state_.AddTestName("foo.cc", 0, "FooTest", "A"); state_.AddTestName("foo.cc", 0, "FooTest", "B"); state_.AddTestName("foo.cc", 0, "FooTest", "C"); } TypedTestCasePState state_; }; TEST_F(TypedTestCasePStateTest, SucceedsForMatchingList) { const char* tests = "A, B, C"; EXPECT_EQ(tests, state_.VerifyRegisteredTestNames("foo.cc", 1, tests)); } // Makes sure that the order of the tests and spaces around the names // don't matter. TEST_F(TypedTestCasePStateTest, IgnoresOrderAndSpaces) { const char* tests = "A,C, B"; EXPECT_EQ(tests, state_.VerifyRegisteredTestNames("foo.cc", 1, tests)); } typedef TypedTestCasePStateTest TypedTestCasePStateDeathTest; TEST_F(TypedTestCasePStateDeathTest, DetectsDuplicates) { EXPECT_DEATH_IF_SUPPORTED( state_.VerifyRegisteredTestNames("foo.cc", 1, "A, B, A, C"), "foo\\.cc.1.?: Test A is listed more than once\\."); } TEST_F(TypedTestCasePStateDeathTest, DetectsExtraTest) { EXPECT_DEATH_IF_SUPPORTED( state_.VerifyRegisteredTestNames("foo.cc", 1, "A, B, C, D"), "foo\\.cc.1.?: No test named D can be found in this test case\\."); } TEST_F(TypedTestCasePStateDeathTest, DetectsMissedTest) { EXPECT_DEATH_IF_SUPPORTED( state_.VerifyRegisteredTestNames("foo.cc", 1, "A, C"), "foo\\.cc.1.?: You forgot to list test B\\."); } // Tests that defining a test for a parameterized test case generates // a run-time error if the test case has been registered. TEST_F(TypedTestCasePStateDeathTest, DetectsTestAfterRegistration) { state_.VerifyRegisteredTestNames("foo.cc", 1, "A, B, C"); EXPECT_DEATH_IF_SUPPORTED( state_.AddTestName("foo.cc", 2, "FooTest", "D"), "foo\\.cc.2.?: Test D must be defined before REGISTER_TYPED_TEST_CASE_P" "\\(FooTest, \\.\\.\\.\\)\\."); } // Tests that SetUpTestCase()/TearDownTestCase(), fixture ctor/dtor, // and SetUp()/TearDown() work correctly in type-parameterized tests. template class DerivedTest : public CommonTest { }; TYPED_TEST_CASE_P(DerivedTest); TYPED_TEST_P(DerivedTest, ValuesAreCorrect) { // Static members of the fixture class template can be visited via // the TestFixture:: prefix. EXPECT_EQ(5, *TestFixture::shared_); // Non-static members of the fixture class must be visited via // 'this', as required by C++ for class templates. EXPECT_EQ(2, this->value_); } // The second test makes sure shared_ is not deleted after the first // test. TYPED_TEST_P(DerivedTest, ValuesAreStillCorrect) { // Static members of the fixture class template can also be visited // via 'this'. ASSERT_TRUE(this->shared_ != NULL); EXPECT_EQ(5, *this->shared_); EXPECT_EQ(2, this->value_); } REGISTER_TYPED_TEST_CASE_P(DerivedTest, ValuesAreCorrect, ValuesAreStillCorrect); typedef Types MyTwoTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, DerivedTest, MyTwoTypes); // Tests that multiple TYPED_TEST_CASE_P's can be defined in the same // translation unit. template class TypedTestP1 : public Test { }; TYPED_TEST_CASE_P(TypedTestP1); // For testing that the code between TYPED_TEST_CASE_P() and // TYPED_TEST_P() is not enclosed in a namespace. typedef int IntAfterTypedTestCaseP; TYPED_TEST_P(TypedTestP1, A) {} TYPED_TEST_P(TypedTestP1, B) {} // For testing that the code between TYPED_TEST_P() and // REGISTER_TYPED_TEST_CASE_P() is not enclosed in a namespace. typedef int IntBeforeRegisterTypedTestCaseP; REGISTER_TYPED_TEST_CASE_P(TypedTestP1, A, B); template class TypedTestP2 : public Test { }; TYPED_TEST_CASE_P(TypedTestP2); // This also verifies that tests from different type-parameterized // test cases can share the same name. TYPED_TEST_P(TypedTestP2, A) {} REGISTER_TYPED_TEST_CASE_P(TypedTestP2, A); // Verifies that the code between TYPED_TEST_CASE_P() and // REGISTER_TYPED_TEST_CASE_P() is not enclosed in a namespace. IntAfterTypedTestCaseP after = 0; IntBeforeRegisterTypedTestCaseP before = 0; // Verifies that the last argument of INSTANTIATE_TYPED_TEST_CASE_P() // can be either a single type or a Types<...> type list. INSTANTIATE_TYPED_TEST_CASE_P(Int, TypedTestP1, int); INSTANTIATE_TYPED_TEST_CASE_P(Int, TypedTestP2, Types); // Tests that the same type-parameterized test case can be // instantiated more than once in the same translation unit. INSTANTIATE_TYPED_TEST_CASE_P(Double, TypedTestP2, Types); // Tests that the same type-parameterized test case can be // instantiated in different translation units linked together. // (ContainerTest is also instantiated in gtest-typed-test_test.cc.) typedef Types, std::set > MyContainers; INSTANTIATE_TYPED_TEST_CASE_P(My, ContainerTest, MyContainers); // Tests that a type-parameterized test case can be defined and // instantiated in a namespace. namespace library2 { template class NumericTest : public Test { }; TYPED_TEST_CASE_P(NumericTest); TYPED_TEST_P(NumericTest, DefaultIsZero) { EXPECT_EQ(0, TypeParam()); } TYPED_TEST_P(NumericTest, ZeroIsLessThanOne) { EXPECT_LT(TypeParam(0), TypeParam(1)); } REGISTER_TYPED_TEST_CASE_P(NumericTest, DefaultIsZero, ZeroIsLessThanOne); typedef Types NumericTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, NumericTest, NumericTypes); } // namespace library2 #endif // GTEST_HAS_TYPED_TEST_P #if !defined(GTEST_HAS_TYPED_TEST) && !defined(GTEST_HAS_TYPED_TEST_P) // Google Test may not support type-parameterized tests with some // compilers. If we use conditional compilation to compile out all // code referring to the gtest_main library, MSVC linker will not link // that library at all and consequently complain about missing entry // point defined in that library (fatal error LNK1561: entry point // must be defined). This dummy test keeps gtest_main linked in. TEST(DummyTest, TypedTestsAreNotSupportedOnThisPlatform) {} #endif // #if !defined(GTEST_HAS_TYPED_TEST) && !defined(GTEST_HAS_TYPED_TEST_P) synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-typed-test_test.h0000600000175000017500000000466511561126632025070 0ustar synergysynergy// Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_TEST_GTEST_TYPED_TEST_TEST_H_ #define GTEST_TEST_GTEST_TYPED_TEST_TEST_H_ #include "gtest/gtest.h" #if GTEST_HAS_TYPED_TEST_P using testing::Test; // For testing that the same type-parameterized test case can be // instantiated in different translation units linked together. // ContainerTest will be instantiated in both gtest-typed-test_test.cc // and gtest-typed-test2_test.cc. template class ContainerTest : public Test { }; TYPED_TEST_CASE_P(ContainerTest); TYPED_TEST_P(ContainerTest, CanBeDefaultConstructed) { TypeParam container; } TYPED_TEST_P(ContainerTest, InitialSizeIsZero) { TypeParam container; EXPECT_EQ(0U, container.size()); } REGISTER_TYPED_TEST_CASE_P(ContainerTest, CanBeDefaultConstructed, InitialSizeIsZero); #endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_TEST_GTEST_TYPED_TEST_TEST_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest-unittest-api_test.cc0000600000175000017500000003162711561126632025550 0ustar synergysynergy// Copyright 2009 Google Inc. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // The Google C++ Testing Framework (Google Test) // // This file contains tests verifying correctness of data provided via // UnitTest's public methods. #include "gtest/gtest.h" #include // For strcmp. #include using ::testing::InitGoogleTest; namespace testing { namespace internal { template struct LessByName { bool operator()(const T* a, const T* b) { return strcmp(a->name(), b->name()) < 0; } }; class UnitTestHelper { public: // Returns the array of pointers to all test cases sorted by the test case // name. The caller is responsible for deleting the array. static TestCase const** const GetSortedTestCases() { UnitTest& unit_test = *UnitTest::GetInstance(); TestCase const** const test_cases = new const TestCase*[unit_test.total_test_case_count()]; for (int i = 0; i < unit_test.total_test_case_count(); ++i) test_cases[i] = unit_test.GetTestCase(i); std::sort(test_cases, test_cases + unit_test.total_test_case_count(), LessByName()); return test_cases; } // Returns the test case by its name. The caller doesn't own the returned // pointer. static const TestCase* FindTestCase(const char* name) { UnitTest& unit_test = *UnitTest::GetInstance(); for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase* test_case = unit_test.GetTestCase(i); if (0 == strcmp(test_case->name(), name)) return test_case; } return NULL; } // Returns the array of pointers to all tests in a particular test case // sorted by the test name. The caller is responsible for deleting the // array. static TestInfo const** const GetSortedTests(const TestCase* test_case) { TestInfo const** const tests = new const TestInfo*[test_case->total_test_count()]; for (int i = 0; i < test_case->total_test_count(); ++i) tests[i] = test_case->GetTestInfo(i); std::sort(tests, tests + test_case->total_test_count(), LessByName()); return tests; } }; #if GTEST_HAS_TYPED_TEST template class TestCaseWithCommentTest : public Test {}; TYPED_TEST_CASE(TestCaseWithCommentTest, Types); TYPED_TEST(TestCaseWithCommentTest, Dummy) {} const int kTypedTestCases = 1; const int kTypedTests = 1; #else const int kTypedTestCases = 0; const int kTypedTests = 0; #endif // GTEST_HAS_TYPED_TEST // We can only test the accessors that do not change value while tests run. // Since tests can be run in any order, the values the accessors that track // test execution (such as failed_test_count) can not be predicted. TEST(ApiTest, UnitTestImmutableAccessorsWork) { UnitTest* unit_test = UnitTest::GetInstance(); ASSERT_EQ(2 + kTypedTestCases, unit_test->total_test_case_count()); EXPECT_EQ(1 + kTypedTestCases, unit_test->test_case_to_run_count()); EXPECT_EQ(2, unit_test->disabled_test_count()); EXPECT_EQ(5 + kTypedTests, unit_test->total_test_count()); EXPECT_EQ(3 + kTypedTests, unit_test->test_to_run_count()); const TestCase** const test_cases = UnitTestHelper::GetSortedTestCases(); EXPECT_STREQ("ApiTest", test_cases[0]->name()); EXPECT_STREQ("DISABLED_Test", test_cases[1]->name()); #if GTEST_HAS_TYPED_TEST EXPECT_STREQ("TestCaseWithCommentTest/0", test_cases[2]->name()); #endif // GTEST_HAS_TYPED_TEST delete[] test_cases; // The following lines initiate actions to verify certain methods in // FinalSuccessChecker::TearDown. // Records a test property to verify TestResult::GetTestProperty(). RecordProperty("key", "value"); } AssertionResult IsNull(const char* str) { if (str != NULL) { return testing::AssertionFailure() << "argument is " << str; } return AssertionSuccess(); } TEST(ApiTest, TestCaseImmutableAccessorsWork) { const TestCase* test_case = UnitTestHelper::FindTestCase("ApiTest"); ASSERT_TRUE(test_case != NULL); EXPECT_STREQ("ApiTest", test_case->name()); EXPECT_TRUE(IsNull(test_case->type_param())); EXPECT_TRUE(test_case->should_run()); EXPECT_EQ(1, test_case->disabled_test_count()); EXPECT_EQ(3, test_case->test_to_run_count()); ASSERT_EQ(4, test_case->total_test_count()); const TestInfo** tests = UnitTestHelper::GetSortedTests(test_case); EXPECT_STREQ("DISABLED_Dummy1", tests[0]->name()); EXPECT_STREQ("ApiTest", tests[0]->test_case_name()); EXPECT_TRUE(IsNull(tests[0]->value_param())); EXPECT_TRUE(IsNull(tests[0]->type_param())); EXPECT_FALSE(tests[0]->should_run()); EXPECT_STREQ("TestCaseDisabledAccessorsWork", tests[1]->name()); EXPECT_STREQ("ApiTest", tests[1]->test_case_name()); EXPECT_TRUE(IsNull(tests[1]->value_param())); EXPECT_TRUE(IsNull(tests[1]->type_param())); EXPECT_TRUE(tests[1]->should_run()); EXPECT_STREQ("TestCaseImmutableAccessorsWork", tests[2]->name()); EXPECT_STREQ("ApiTest", tests[2]->test_case_name()); EXPECT_TRUE(IsNull(tests[2]->value_param())); EXPECT_TRUE(IsNull(tests[2]->type_param())); EXPECT_TRUE(tests[2]->should_run()); EXPECT_STREQ("UnitTestImmutableAccessorsWork", tests[3]->name()); EXPECT_STREQ("ApiTest", tests[3]->test_case_name()); EXPECT_TRUE(IsNull(tests[3]->value_param())); EXPECT_TRUE(IsNull(tests[3]->type_param())); EXPECT_TRUE(tests[3]->should_run()); delete[] tests; tests = NULL; #if GTEST_HAS_TYPED_TEST test_case = UnitTestHelper::FindTestCase("TestCaseWithCommentTest/0"); ASSERT_TRUE(test_case != NULL); EXPECT_STREQ("TestCaseWithCommentTest/0", test_case->name()); EXPECT_STREQ(GetTypeName().c_str(), test_case->type_param()); EXPECT_TRUE(test_case->should_run()); EXPECT_EQ(0, test_case->disabled_test_count()); EXPECT_EQ(1, test_case->test_to_run_count()); ASSERT_EQ(1, test_case->total_test_count()); tests = UnitTestHelper::GetSortedTests(test_case); EXPECT_STREQ("Dummy", tests[0]->name()); EXPECT_STREQ("TestCaseWithCommentTest/0", tests[0]->test_case_name()); EXPECT_TRUE(IsNull(tests[0]->value_param())); EXPECT_STREQ(GetTypeName().c_str(), tests[0]->type_param()); EXPECT_TRUE(tests[0]->should_run()); delete[] tests; #endif // GTEST_HAS_TYPED_TEST } TEST(ApiTest, TestCaseDisabledAccessorsWork) { const TestCase* test_case = UnitTestHelper::FindTestCase("DISABLED_Test"); ASSERT_TRUE(test_case != NULL); EXPECT_STREQ("DISABLED_Test", test_case->name()); EXPECT_TRUE(IsNull(test_case->type_param())); EXPECT_FALSE(test_case->should_run()); EXPECT_EQ(1, test_case->disabled_test_count()); EXPECT_EQ(0, test_case->test_to_run_count()); ASSERT_EQ(1, test_case->total_test_count()); const TestInfo* const test_info = test_case->GetTestInfo(0); EXPECT_STREQ("Dummy2", test_info->name()); EXPECT_STREQ("DISABLED_Test", test_info->test_case_name()); EXPECT_TRUE(IsNull(test_info->value_param())); EXPECT_TRUE(IsNull(test_info->type_param())); EXPECT_FALSE(test_info->should_run()); } // These two tests are here to provide support for testing // test_case_to_run_count, disabled_test_count, and test_to_run_count. TEST(ApiTest, DISABLED_Dummy1) {} TEST(DISABLED_Test, Dummy2) {} class FinalSuccessChecker : public Environment { protected: virtual void TearDown() { UnitTest* unit_test = UnitTest::GetInstance(); EXPECT_EQ(1 + kTypedTestCases, unit_test->successful_test_case_count()); EXPECT_EQ(3 + kTypedTests, unit_test->successful_test_count()); EXPECT_EQ(0, unit_test->failed_test_case_count()); EXPECT_EQ(0, unit_test->failed_test_count()); EXPECT_TRUE(unit_test->Passed()); EXPECT_FALSE(unit_test->Failed()); ASSERT_EQ(2 + kTypedTestCases, unit_test->total_test_case_count()); const TestCase** const test_cases = UnitTestHelper::GetSortedTestCases(); EXPECT_STREQ("ApiTest", test_cases[0]->name()); EXPECT_TRUE(IsNull(test_cases[0]->type_param())); EXPECT_TRUE(test_cases[0]->should_run()); EXPECT_EQ(1, test_cases[0]->disabled_test_count()); ASSERT_EQ(4, test_cases[0]->total_test_count()); EXPECT_EQ(3, test_cases[0]->successful_test_count()); EXPECT_EQ(0, test_cases[0]->failed_test_count()); EXPECT_TRUE(test_cases[0]->Passed()); EXPECT_FALSE(test_cases[0]->Failed()); EXPECT_STREQ("DISABLED_Test", test_cases[1]->name()); EXPECT_TRUE(IsNull(test_cases[1]->type_param())); EXPECT_FALSE(test_cases[1]->should_run()); EXPECT_EQ(1, test_cases[1]->disabled_test_count()); ASSERT_EQ(1, test_cases[1]->total_test_count()); EXPECT_EQ(0, test_cases[1]->successful_test_count()); EXPECT_EQ(0, test_cases[1]->failed_test_count()); #if GTEST_HAS_TYPED_TEST EXPECT_STREQ("TestCaseWithCommentTest/0", test_cases[2]->name()); EXPECT_STREQ(GetTypeName().c_str(), test_cases[2]->type_param()); EXPECT_TRUE(test_cases[2]->should_run()); EXPECT_EQ(0, test_cases[2]->disabled_test_count()); ASSERT_EQ(1, test_cases[2]->total_test_count()); EXPECT_EQ(1, test_cases[2]->successful_test_count()); EXPECT_EQ(0, test_cases[2]->failed_test_count()); EXPECT_TRUE(test_cases[2]->Passed()); EXPECT_FALSE(test_cases[2]->Failed()); #endif // GTEST_HAS_TYPED_TEST const TestCase* test_case = UnitTestHelper::FindTestCase("ApiTest"); const TestInfo** tests = UnitTestHelper::GetSortedTests(test_case); EXPECT_STREQ("DISABLED_Dummy1", tests[0]->name()); EXPECT_STREQ("ApiTest", tests[0]->test_case_name()); EXPECT_FALSE(tests[0]->should_run()); EXPECT_STREQ("TestCaseDisabledAccessorsWork", tests[1]->name()); EXPECT_STREQ("ApiTest", tests[1]->test_case_name()); EXPECT_TRUE(IsNull(tests[1]->value_param())); EXPECT_TRUE(IsNull(tests[1]->type_param())); EXPECT_TRUE(tests[1]->should_run()); EXPECT_TRUE(tests[1]->result()->Passed()); EXPECT_EQ(0, tests[1]->result()->test_property_count()); EXPECT_STREQ("TestCaseImmutableAccessorsWork", tests[2]->name()); EXPECT_STREQ("ApiTest", tests[2]->test_case_name()); EXPECT_TRUE(IsNull(tests[2]->value_param())); EXPECT_TRUE(IsNull(tests[2]->type_param())); EXPECT_TRUE(tests[2]->should_run()); EXPECT_TRUE(tests[2]->result()->Passed()); EXPECT_EQ(0, tests[2]->result()->test_property_count()); EXPECT_STREQ("UnitTestImmutableAccessorsWork", tests[3]->name()); EXPECT_STREQ("ApiTest", tests[3]->test_case_name()); EXPECT_TRUE(IsNull(tests[3]->value_param())); EXPECT_TRUE(IsNull(tests[3]->type_param())); EXPECT_TRUE(tests[3]->should_run()); EXPECT_TRUE(tests[3]->result()->Passed()); EXPECT_EQ(1, tests[3]->result()->test_property_count()); const TestProperty& property = tests[3]->result()->GetTestProperty(0); EXPECT_STREQ("key", property.key()); EXPECT_STREQ("value", property.value()); delete[] tests; #if GTEST_HAS_TYPED_TEST test_case = UnitTestHelper::FindTestCase("TestCaseWithCommentTest/0"); tests = UnitTestHelper::GetSortedTests(test_case); EXPECT_STREQ("Dummy", tests[0]->name()); EXPECT_STREQ("TestCaseWithCommentTest/0", tests[0]->test_case_name()); EXPECT_TRUE(IsNull(tests[0]->value_param())); EXPECT_STREQ(GetTypeName().c_str(), tests[0]->type_param()); EXPECT_TRUE(tests[0]->should_run()); EXPECT_TRUE(tests[0]->result()->Passed()); EXPECT_EQ(0, tests[0]->result()->test_property_count()); delete[] tests; #endif // GTEST_HAS_TYPED_TEST delete[] test_cases; } }; } // namespace internal } // namespace testing int main(int argc, char **argv) { InitGoogleTest(&argc, argv); AddGlobalTestEnvironment(new testing::internal::FinalSuccessChecker()); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_all_test.cc0000600000175000017500000000431311561126632023744 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests for Google C++ Testing Framework (Google Test) // // Sometimes it's desirable to build most of Google Test's own tests // by compiling a single file. This file serves this purpose. #include "test/gtest-filepath_test.cc" #include "test/gtest-linked_ptr_test.cc" #include "test/gtest-message_test.cc" #include "test/gtest-options_test.cc" #include "test/gtest-port_test.cc" #include "test/gtest_pred_impl_unittest.cc" #include "test/gtest_prod_test.cc" #include "test/gtest-test-part_test.cc" #include "test/gtest-typed-test_test.cc" #include "test/gtest-typed-test2_test.cc" #include "test/gtest_unittest.cc" #include "test/production.cc" synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_break_on_failure_unittest.py0000600000175000017500000001605611561126632027435 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test for Google Test's break-on-failure mode. A user can ask Google Test to seg-fault when an assertion fails, using either the GTEST_BREAK_ON_FAILURE environment variable or the --gtest_break_on_failure flag. This script tests such functionality by invoking gtest_break_on_failure_unittest_ (a program written with Google Test) with different environments and command line flags. """ __author__ = 'wan@google.com (Zhanyong Wan)' import gtest_test_utils import os import sys # Constants. IS_WINDOWS = os.name == 'nt' # The environment variable for enabling/disabling the break-on-failure mode. BREAK_ON_FAILURE_ENV_VAR = 'GTEST_BREAK_ON_FAILURE' # The command line flag for enabling/disabling the break-on-failure mode. BREAK_ON_FAILURE_FLAG = 'gtest_break_on_failure' # The environment variable for enabling/disabling the throw-on-failure mode. THROW_ON_FAILURE_ENV_VAR = 'GTEST_THROW_ON_FAILURE' # The environment variable for enabling/disabling the catch-exceptions mode. CATCH_EXCEPTIONS_ENV_VAR = 'GTEST_CATCH_EXCEPTIONS' # Path to the gtest_break_on_failure_unittest_ program. EXE_PATH = gtest_test_utils.GetTestExecutablePath( 'gtest_break_on_failure_unittest_') # Utilities. environ = os.environ.copy() def SetEnvVar(env_var, value): """Sets an environment variable to a given value; unsets it when the given value is None. """ if value is not None: environ[env_var] = value elif env_var in environ: del environ[env_var] def Run(command): """Runs a command; returns 1 if it was killed by a signal, or 0 otherwise.""" p = gtest_test_utils.Subprocess(command, env=environ) if p.terminated_by_signal: return 1 else: return 0 # The tests. class GTestBreakOnFailureUnitTest(gtest_test_utils.TestCase): """Tests using the GTEST_BREAK_ON_FAILURE environment variable or the --gtest_break_on_failure flag to turn assertion failures into segmentation faults. """ def RunAndVerify(self, env_var_value, flag_value, expect_seg_fault): """Runs gtest_break_on_failure_unittest_ and verifies that it does (or does not) have a seg-fault. Args: env_var_value: value of the GTEST_BREAK_ON_FAILURE environment variable; None if the variable should be unset. flag_value: value of the --gtest_break_on_failure flag; None if the flag should not be present. expect_seg_fault: 1 if the program is expected to generate a seg-fault; 0 otherwise. """ SetEnvVar(BREAK_ON_FAILURE_ENV_VAR, env_var_value) if env_var_value is None: env_var_value_msg = ' is not set' else: env_var_value_msg = '=' + env_var_value if flag_value is None: flag = '' elif flag_value == '0': flag = '--%s=0' % BREAK_ON_FAILURE_FLAG else: flag = '--%s' % BREAK_ON_FAILURE_FLAG command = [EXE_PATH] if flag: command.append(flag) if expect_seg_fault: should_or_not = 'should' else: should_or_not = 'should not' has_seg_fault = Run(command) SetEnvVar(BREAK_ON_FAILURE_ENV_VAR, None) msg = ('when %s%s, an assertion failure in "%s" %s cause a seg-fault.' % (BREAK_ON_FAILURE_ENV_VAR, env_var_value_msg, ' '.join(command), should_or_not)) self.assert_(has_seg_fault == expect_seg_fault, msg) def testDefaultBehavior(self): """Tests the behavior of the default mode.""" self.RunAndVerify(env_var_value=None, flag_value=None, expect_seg_fault=0) def testEnvVar(self): """Tests using the GTEST_BREAK_ON_FAILURE environment variable.""" self.RunAndVerify(env_var_value='0', flag_value=None, expect_seg_fault=0) self.RunAndVerify(env_var_value='1', flag_value=None, expect_seg_fault=1) def testFlag(self): """Tests using the --gtest_break_on_failure flag.""" self.RunAndVerify(env_var_value=None, flag_value='0', expect_seg_fault=0) self.RunAndVerify(env_var_value=None, flag_value='1', expect_seg_fault=1) def testFlagOverridesEnvVar(self): """Tests that the flag overrides the environment variable.""" self.RunAndVerify(env_var_value='0', flag_value='0', expect_seg_fault=0) self.RunAndVerify(env_var_value='0', flag_value='1', expect_seg_fault=1) self.RunAndVerify(env_var_value='1', flag_value='0', expect_seg_fault=0) self.RunAndVerify(env_var_value='1', flag_value='1', expect_seg_fault=1) def testBreakOnFailureOverridesThrowOnFailure(self): """Tests that gtest_break_on_failure overrides gtest_throw_on_failure.""" SetEnvVar(THROW_ON_FAILURE_ENV_VAR, '1') try: self.RunAndVerify(env_var_value=None, flag_value='1', expect_seg_fault=1) finally: SetEnvVar(THROW_ON_FAILURE_ENV_VAR, None) if IS_WINDOWS: def testCatchExceptionsDoesNotInterfere(self): """Tests that gtest_catch_exceptions doesn't interfere.""" SetEnvVar(CATCH_EXCEPTIONS_ENV_VAR, '1') try: self.RunAndVerify(env_var_value='1', flag_value='1', expect_seg_fault=1) finally: SetEnvVar(CATCH_EXCEPTIONS_ENV_VAR, None) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_break_on_failure_unittest_.cc0000600000175000017500000000627711561126632027535 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Unit test for Google Test's break-on-failure mode. // // A user can ask Google Test to seg-fault when an assertion fails, using // either the GTEST_BREAK_ON_FAILURE environment variable or the // --gtest_break_on_failure flag. This file is used for testing such // functionality. // // This program will be invoked from a Python unit test. It is // expected to fail. Don't run it directly. #include "gtest/gtest.h" #if GTEST_OS_WINDOWS # include # include #endif namespace { // A test that's expected to fail. TEST(Foo, Bar) { EXPECT_EQ(2, 3); } #if GTEST_HAS_SEH && !GTEST_OS_WINDOWS_MOBILE // On Windows Mobile global exception handlers are not supported. LONG WINAPI ExitWithExceptionCode( struct _EXCEPTION_POINTERS* exception_pointers) { exit(exception_pointers->ExceptionRecord->ExceptionCode); } #endif } // namespace int main(int argc, char **argv) { #if GTEST_OS_WINDOWS // Suppresses display of the Windows error dialog upon encountering // a general protection fault (segment violation). SetErrorMode(SEM_NOGPFAULTERRORBOX | SEM_FAILCRITICALERRORS); # if GTEST_HAS_SEH && !GTEST_OS_WINDOWS_MOBILE // The default unhandled exception filter does not always exit // with the exception code as exit code - for example it exits with // 0 for EXCEPTION_ACCESS_VIOLATION and 1 for EXCEPTION_BREAKPOINT // if the application is compiled in debug mode. Thus we use our own // filter which always exits with the exception code for unhandled // exceptions. SetUnhandledExceptionFilter(ExitWithExceptionCode); # endif #endif testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_catch_exceptions_test.py0000600000175000017500000002214011561126632026560 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2010 Google Inc. All Rights Reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests Google Test's exception catching behavior. This script invokes gtest_catch_exceptions_test_ and gtest_catch_exceptions_ex_test_ (programs written with Google Test) and verifies their output. """ __author__ = 'vladl@google.com (Vlad Losev)' import os import gtest_test_utils # Constants. FLAG_PREFIX = '--gtest_' LIST_TESTS_FLAG = FLAG_PREFIX + 'list_tests' NO_CATCH_EXCEPTIONS_FLAG = FLAG_PREFIX + 'catch_exceptions=0' FILTER_FLAG = FLAG_PREFIX + 'filter' # Path to the gtest_catch_exceptions_ex_test_ binary, compiled with # exceptions enabled. EX_EXE_PATH = gtest_test_utils.GetTestExecutablePath( 'gtest_catch_exceptions_ex_test_') # Path to the gtest_catch_exceptions_test_ binary, compiled with # exceptions disabled. EXE_PATH = gtest_test_utils.GetTestExecutablePath( 'gtest_catch_exceptions_no_ex_test_') TEST_LIST = gtest_test_utils.Subprocess([EXE_PATH, LIST_TESTS_FLAG]).output SUPPORTS_SEH_EXCEPTIONS = 'ThrowsSehException' in TEST_LIST if SUPPORTS_SEH_EXCEPTIONS: BINARY_OUTPUT = gtest_test_utils.Subprocess([EXE_PATH]).output EX_BINARY_OUTPUT = gtest_test_utils.Subprocess([EX_EXE_PATH]).output # The tests. if SUPPORTS_SEH_EXCEPTIONS: # pylint:disable-msg=C6302 class CatchSehExceptionsTest(gtest_test_utils.TestCase): """Tests exception-catching behavior.""" def TestSehExceptions(self, test_output): self.assert_('SEH exception with code 0x2a thrown ' 'in the test fixture\'s constructor' in test_output) self.assert_('SEH exception with code 0x2a thrown ' 'in the test fixture\'s destructor' in test_output) self.assert_('SEH exception with code 0x2a thrown in SetUpTestCase()' in test_output) self.assert_('SEH exception with code 0x2a thrown in TearDownTestCase()' in test_output) self.assert_('SEH exception with code 0x2a thrown in SetUp()' in test_output) self.assert_('SEH exception with code 0x2a thrown in TearDown()' in test_output) self.assert_('SEH exception with code 0x2a thrown in the test body' in test_output) def testCatchesSehExceptionsWithCxxExceptionsEnabled(self): self.TestSehExceptions(EX_BINARY_OUTPUT) def testCatchesSehExceptionsWithCxxExceptionsDisabled(self): self.TestSehExceptions(BINARY_OUTPUT) class CatchCxxExceptionsTest(gtest_test_utils.TestCase): """Tests C++ exception-catching behavior. Tests in this test case verify that: * C++ exceptions are caught and logged as C++ (not SEH) exceptions * Exception thrown affect the remainder of the test work flow in the expected manner. """ def testCatchesCxxExceptionsInFixtureConstructor(self): self.assert_('C++ exception with description ' '"Standard C++ exception" thrown ' 'in the test fixture\'s constructor' in EX_BINARY_OUTPUT) self.assert_('unexpected' not in EX_BINARY_OUTPUT, 'This failure belongs in this test only if ' '"CxxExceptionInConstructorTest" (no quotes) ' 'appears on the same line as words "called unexpectedly"') def testCatchesCxxExceptionsInFixtureDestructor(self): self.assert_('C++ exception with description ' '"Standard C++ exception" thrown ' 'in the test fixture\'s destructor' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInDestructorTest::TearDownTestCase() ' 'called as expected.' in EX_BINARY_OUTPUT) def testCatchesCxxExceptionsInSetUpTestCase(self): self.assert_('C++ exception with description "Standard C++ exception"' ' thrown in SetUpTestCase()' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInConstructorTest::TearDownTestCase() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTestCaseTest constructor ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTestCaseTest destructor ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTestCaseTest::SetUp() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTestCaseTest::TearDown() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTestCaseTest test body ' 'called as expected.' in EX_BINARY_OUTPUT) def testCatchesCxxExceptionsInTearDownTestCase(self): self.assert_('C++ exception with description "Standard C++ exception"' ' thrown in TearDownTestCase()' in EX_BINARY_OUTPUT) def testCatchesCxxExceptionsInSetUp(self): self.assert_('C++ exception with description "Standard C++ exception"' ' thrown in SetUp()' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTest::TearDownTestCase() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTest destructor ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInSetUpTest::TearDown() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('unexpected' not in EX_BINARY_OUTPUT, 'This failure belongs in this test only if ' '"CxxExceptionInSetUpTest" (no quotes) ' 'appears on the same line as words "called unexpectedly"') def testCatchesCxxExceptionsInTearDown(self): self.assert_('C++ exception with description "Standard C++ exception"' ' thrown in TearDown()' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInTearDownTest::TearDownTestCase() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInTearDownTest destructor ' 'called as expected.' in EX_BINARY_OUTPUT) def testCatchesCxxExceptionsInTestBody(self): self.assert_('C++ exception with description "Standard C++ exception"' ' thrown in the test body' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInTestBodyTest::TearDownTestCase() ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInTestBodyTest destructor ' 'called as expected.' in EX_BINARY_OUTPUT) self.assert_('CxxExceptionInTestBodyTest::TearDown() ' 'called as expected.' in EX_BINARY_OUTPUT) def testCatchesNonStdCxxExceptions(self): self.assert_('Unknown C++ exception thrown in the test body' in EX_BINARY_OUTPUT) def testUnhandledCxxExceptionsAbortTheProgram(self): # Filters out SEH exception tests on Windows. Unhandled SEH exceptions # cause tests to show pop-up windows there. FITLER_OUT_SEH_TESTS_FLAG = FILTER_FLAG + '=-*Seh*' # By default, Google Test doesn't catch the exceptions. uncaught_exceptions_ex_binary_output = gtest_test_utils.Subprocess( [EX_EXE_PATH, NO_CATCH_EXCEPTIONS_FLAG, FITLER_OUT_SEH_TESTS_FLAG]).output self.assert_('Unhandled C++ exception terminating the program' in uncaught_exceptions_ex_binary_output) self.assert_('unexpected' not in uncaught_exceptions_ex_binary_output) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_catch_exceptions_test_.cc0000600000175000017500000002110511561126632026654 0ustar synergysynergy// Copyright 2010, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: vladl@google.com (Vlad Losev) // // Tests for Google Test itself. Tests in this file throw C++ or SEH // exceptions, and the output is verified by gtest_catch_exceptions_test.py. #include "gtest/gtest.h" #include // NOLINT #include // For exit(). #if GTEST_HAS_SEH # include #endif #if GTEST_HAS_EXCEPTIONS # include // For set_terminate(). # include #endif using testing::Test; #if GTEST_HAS_SEH class SehExceptionInConstructorTest : public Test { public: SehExceptionInConstructorTest() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInConstructorTest, ThrowsExceptionInConstructor) {} class SehExceptionInDestructorTest : public Test { public: ~SehExceptionInDestructorTest() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInDestructorTest, ThrowsExceptionInDestructor) {} class SehExceptionInSetUpTestCaseTest : public Test { public: static void SetUpTestCase() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInSetUpTestCaseTest, ThrowsExceptionInSetUpTestCase) {} class SehExceptionInTearDownTestCaseTest : public Test { public: static void TearDownTestCase() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInTearDownTestCaseTest, ThrowsExceptionInTearDownTestCase) {} class SehExceptionInSetUpTest : public Test { protected: virtual void SetUp() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInSetUpTest, ThrowsExceptionInSetUp) {} class SehExceptionInTearDownTest : public Test { protected: virtual void TearDown() { RaiseException(42, 0, 0, NULL); } }; TEST_F(SehExceptionInTearDownTest, ThrowsExceptionInTearDown) {} TEST(SehExceptionTest, ThrowsSehException) { RaiseException(42, 0, 0, NULL); } #endif // GTEST_HAS_SEH #if GTEST_HAS_EXCEPTIONS class CxxExceptionInConstructorTest : public Test { public: CxxExceptionInConstructorTest() { // Without this macro VC++ complains about unreachable code at the end of // the constructor. GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_( throw std::runtime_error("Standard C++ exception")); } static void TearDownTestCase() { printf("%s", "CxxExceptionInConstructorTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInConstructorTest() { ADD_FAILURE() << "CxxExceptionInConstructorTest destructor " << "called unexpectedly."; } virtual void SetUp() { ADD_FAILURE() << "CxxExceptionInConstructorTest::SetUp() " << "called unexpectedly."; } virtual void TearDown() { ADD_FAILURE() << "CxxExceptionInConstructorTest::TearDown() " << "called unexpectedly."; } }; TEST_F(CxxExceptionInConstructorTest, ThrowsExceptionInConstructor) { ADD_FAILURE() << "CxxExceptionInConstructorTest test body " << "called unexpectedly."; } class CxxExceptionInDestructorTest : public Test { public: static void TearDownTestCase() { printf("%s", "CxxExceptionInDestructorTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInDestructorTest() { GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_( throw std::runtime_error("Standard C++ exception")); } }; TEST_F(CxxExceptionInDestructorTest, ThrowsExceptionInDestructor) {} class CxxExceptionInSetUpTestCaseTest : public Test { public: CxxExceptionInSetUpTestCaseTest() { printf("%s", "CxxExceptionInSetUpTestCaseTest constructor " "called as expected.\n"); } static void SetUpTestCase() { throw std::runtime_error("Standard C++ exception"); } static void TearDownTestCase() { printf("%s", "CxxExceptionInSetUpTestCaseTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInSetUpTestCaseTest() { printf("%s", "CxxExceptionInSetUpTestCaseTest destructor " "called as expected.\n"); } virtual void SetUp() { printf("%s", "CxxExceptionInSetUpTestCaseTest::SetUp() " "called as expected.\n"); } virtual void TearDown() { printf("%s", "CxxExceptionInSetUpTestCaseTest::TearDown() " "called as expected.\n"); } }; TEST_F(CxxExceptionInSetUpTestCaseTest, ThrowsExceptionInSetUpTestCase) { printf("%s", "CxxExceptionInSetUpTestCaseTest test body " "called as expected.\n"); } class CxxExceptionInTearDownTestCaseTest : public Test { public: static void TearDownTestCase() { throw std::runtime_error("Standard C++ exception"); } }; TEST_F(CxxExceptionInTearDownTestCaseTest, ThrowsExceptionInTearDownTestCase) {} class CxxExceptionInSetUpTest : public Test { public: static void TearDownTestCase() { printf("%s", "CxxExceptionInSetUpTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInSetUpTest() { printf("%s", "CxxExceptionInSetUpTest destructor " "called as expected.\n"); } virtual void SetUp() { throw std::runtime_error("Standard C++ exception"); } virtual void TearDown() { printf("%s", "CxxExceptionInSetUpTest::TearDown() " "called as expected.\n"); } }; TEST_F(CxxExceptionInSetUpTest, ThrowsExceptionInSetUp) { ADD_FAILURE() << "CxxExceptionInSetUpTest test body " << "called unexpectedly."; } class CxxExceptionInTearDownTest : public Test { public: static void TearDownTestCase() { printf("%s", "CxxExceptionInTearDownTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInTearDownTest() { printf("%s", "CxxExceptionInTearDownTest destructor " "called as expected.\n"); } virtual void TearDown() { throw std::runtime_error("Standard C++ exception"); } }; TEST_F(CxxExceptionInTearDownTest, ThrowsExceptionInTearDown) {} class CxxExceptionInTestBodyTest : public Test { public: static void TearDownTestCase() { printf("%s", "CxxExceptionInTestBodyTest::TearDownTestCase() " "called as expected.\n"); } protected: ~CxxExceptionInTestBodyTest() { printf("%s", "CxxExceptionInTestBodyTest destructor " "called as expected.\n"); } virtual void TearDown() { printf("%s", "CxxExceptionInTestBodyTest::TearDown() " "called as expected.\n"); } }; TEST_F(CxxExceptionInTestBodyTest, ThrowsStdCxxException) { throw std::runtime_error("Standard C++ exception"); } TEST(CxxExceptionTest, ThrowsNonStdCxxException) { throw "C-string"; } // This terminate handler aborts the program using exit() rather than abort(). // This avoids showing pop-ups on Windows systems and core dumps on Unix-like // ones. void TerminateHandler() { fprintf(stderr, "%s\n", "Unhandled C++ exception terminating the program."); fflush(NULL); exit(3); } #endif // GTEST_HAS_EXCEPTIONS int main(int argc, char** argv) { #if GTEST_HAS_EXCEPTIONS std::set_terminate(&TerminateHandler); #endif testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_color_test.py0000600000175000017500000001145711561126632024364 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Verifies that Google Test correctly determines whether to use colors.""" __author__ = 'wan@google.com (Zhanyong Wan)' import os import gtest_test_utils IS_WINDOWS = os.name = 'nt' COLOR_ENV_VAR = 'GTEST_COLOR' COLOR_FLAG = 'gtest_color' COMMAND = gtest_test_utils.GetTestExecutablePath('gtest_color_test_') def SetEnvVar(env_var, value): """Sets the env variable to 'value'; unsets it when 'value' is None.""" if value is not None: os.environ[env_var] = value elif env_var in os.environ: del os.environ[env_var] def UsesColor(term, color_env_var, color_flag): """Runs gtest_color_test_ and returns its exit code.""" SetEnvVar('TERM', term) SetEnvVar(COLOR_ENV_VAR, color_env_var) if color_flag is None: args = [] else: args = ['--%s=%s' % (COLOR_FLAG, color_flag)] p = gtest_test_utils.Subprocess([COMMAND] + args) return not p.exited or p.exit_code class GTestColorTest(gtest_test_utils.TestCase): def testNoEnvVarNoFlag(self): """Tests the case when there's neither GTEST_COLOR nor --gtest_color.""" if not IS_WINDOWS: self.assert_(not UsesColor('dumb', None, None)) self.assert_(not UsesColor('emacs', None, None)) self.assert_(not UsesColor('xterm-mono', None, None)) self.assert_(not UsesColor('unknown', None, None)) self.assert_(not UsesColor(None, None, None)) self.assert_(UsesColor('linux', None, None)) self.assert_(UsesColor('cygwin', None, None)) self.assert_(UsesColor('xterm', None, None)) self.assert_(UsesColor('xterm-color', None, None)) self.assert_(UsesColor('xterm-256color', None, None)) def testFlagOnly(self): """Tests the case when there's --gtest_color but not GTEST_COLOR.""" self.assert_(not UsesColor('dumb', None, 'no')) self.assert_(not UsesColor('xterm-color', None, 'no')) if not IS_WINDOWS: self.assert_(not UsesColor('emacs', None, 'auto')) self.assert_(UsesColor('xterm', None, 'auto')) self.assert_(UsesColor('dumb', None, 'yes')) self.assert_(UsesColor('xterm', None, 'yes')) def testEnvVarOnly(self): """Tests the case when there's GTEST_COLOR but not --gtest_color.""" self.assert_(not UsesColor('dumb', 'no', None)) self.assert_(not UsesColor('xterm-color', 'no', None)) if not IS_WINDOWS: self.assert_(not UsesColor('dumb', 'auto', None)) self.assert_(UsesColor('xterm-color', 'auto', None)) self.assert_(UsesColor('dumb', 'yes', None)) self.assert_(UsesColor('xterm-color', 'yes', None)) def testEnvVarAndFlag(self): """Tests the case when there are both GTEST_COLOR and --gtest_color.""" self.assert_(not UsesColor('xterm-color', 'no', 'no')) self.assert_(UsesColor('dumb', 'no', 'yes')) self.assert_(UsesColor('xterm-color', 'no', 'auto')) def testAliasesOfYesAndNo(self): """Tests using aliases in specifying --gtest_color.""" self.assert_(UsesColor('dumb', None, 'true')) self.assert_(UsesColor('dumb', None, 'YES')) self.assert_(UsesColor('dumb', None, 'T')) self.assert_(UsesColor('dumb', None, '1')) self.assert_(not UsesColor('xterm', None, 'f')) self.assert_(not UsesColor('xterm', None, 'false')) self.assert_(not UsesColor('xterm', None, '0')) self.assert_(not UsesColor('xterm', None, 'unknown')) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_color_test_.cc0000600000175000017500000000551011561126632024451 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // A helper program for testing how Google Test determines whether to use // colors in the output. It prints "YES" and returns 1 if Google Test // decides to use colors, and prints "NO" and returns 0 otherwise. #include #include "gtest/gtest.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ using testing::internal::ShouldUseColor; // The purpose of this is to ensure that the UnitTest singleton is // created before main() is entered, and thus that ShouldUseColor() // works the same way as in a real Google-Test-based test. We don't actual // run the TEST itself. TEST(GTestColorTest, Dummy) { } int main(int argc, char** argv) { testing::InitGoogleTest(&argc, argv); if (ShouldUseColor(true)) { // Google Test decides to use colors in the output (assuming it // goes to a TTY). printf("YES\n"); return 1; } else { // Google Test decides not to use colors in the output. printf("NO\n"); return 0; } } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_environment_test.cc0000600000175000017500000001471511561126632025547 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests using global test environments. #include #include #include "gtest/gtest.h" #define GTEST_IMPLEMENTATION_ 1 // Required for the next #include. #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { GTEST_DECLARE_string_(filter); } namespace { enum FailureType { NO_FAILURE, NON_FATAL_FAILURE, FATAL_FAILURE }; // For testing using global test environments. class MyEnvironment : public testing::Environment { public: MyEnvironment() { Reset(); } // Depending on the value of failure_in_set_up_, SetUp() will // generate a non-fatal failure, generate a fatal failure, or // succeed. virtual void SetUp() { set_up_was_run_ = true; switch (failure_in_set_up_) { case NON_FATAL_FAILURE: ADD_FAILURE() << "Expected non-fatal failure in global set-up."; break; case FATAL_FAILURE: FAIL() << "Expected fatal failure in global set-up."; break; default: break; } } // Generates a non-fatal failure. virtual void TearDown() { tear_down_was_run_ = true; ADD_FAILURE() << "Expected non-fatal failure in global tear-down."; } // Resets the state of the environment s.t. it can be reused. void Reset() { failure_in_set_up_ = NO_FAILURE; set_up_was_run_ = false; tear_down_was_run_ = false; } // We call this function to set the type of failure SetUp() should // generate. void set_failure_in_set_up(FailureType type) { failure_in_set_up_ = type; } // Was SetUp() run? bool set_up_was_run() const { return set_up_was_run_; } // Was TearDown() run? bool tear_down_was_run() const { return tear_down_was_run_; } private: FailureType failure_in_set_up_; bool set_up_was_run_; bool tear_down_was_run_; }; // Was the TEST run? bool test_was_run; // The sole purpose of this TEST is to enable us to check whether it // was run. TEST(FooTest, Bar) { test_was_run = true; } // Prints the message and aborts the program if condition is false. void Check(bool condition, const char* msg) { if (!condition) { printf("FAILED: %s\n", msg); testing::internal::posix::Abort(); } } // Runs the tests. Return true iff successful. // // The 'failure' parameter specifies the type of failure that should // be generated by the global set-up. int RunAllTests(MyEnvironment* env, FailureType failure) { env->Reset(); env->set_failure_in_set_up(failure); test_was_run = false; testing::internal::GetUnitTestImpl()->ClearAdHocTestResult(); return RUN_ALL_TESTS(); } } // namespace int main(int argc, char **argv) { testing::InitGoogleTest(&argc, argv); // Registers a global test environment, and verifies that the // registration function returns its argument. MyEnvironment* const env = new MyEnvironment; Check(testing::AddGlobalTestEnvironment(env) == env, "AddGlobalTestEnvironment() should return its argument."); // Verifies that RUN_ALL_TESTS() runs the tests when the global // set-up is successful. Check(RunAllTests(env, NO_FAILURE) != 0, "RUN_ALL_TESTS() should return non-zero, as the global tear-down " "should generate a failure."); Check(test_was_run, "The tests should run, as the global set-up should generate no " "failure"); Check(env->tear_down_was_run(), "The global tear-down should run, as the global set-up was run."); // Verifies that RUN_ALL_TESTS() runs the tests when the global // set-up generates no fatal failure. Check(RunAllTests(env, NON_FATAL_FAILURE) != 0, "RUN_ALL_TESTS() should return non-zero, as both the global set-up " "and the global tear-down should generate a non-fatal failure."); Check(test_was_run, "The tests should run, as the global set-up should generate no " "fatal failure."); Check(env->tear_down_was_run(), "The global tear-down should run, as the global set-up was run."); // Verifies that RUN_ALL_TESTS() runs no test when the global set-up // generates a fatal failure. Check(RunAllTests(env, FATAL_FAILURE) != 0, "RUN_ALL_TESTS() should return non-zero, as the global set-up " "should generate a fatal failure."); Check(!test_was_run, "The tests should not run, as the global set-up should generate " "a fatal failure."); Check(env->tear_down_was_run(), "The global tear-down should run, as the global set-up was run."); // Verifies that RUN_ALL_TESTS() doesn't do global set-up or // tear-down when there is no test to run. testing::GTEST_FLAG(filter) = "-*"; Check(RunAllTests(env, NO_FAILURE) == 0, "RUN_ALL_TESTS() should return zero, as there is no test to run."); Check(!env->set_up_was_run(), "The global set-up should not run, as there is no test to run."); Check(!env->tear_down_was_run(), "The global tear-down should not run, " "as the global set-up was not run."); printf("PASS\n"); return 0; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_env_var_test.py0000600000175000017500000000663711561126632024712 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Verifies that Google Test correctly parses environment variables.""" __author__ = 'wan@google.com (Zhanyong Wan)' import os import gtest_test_utils IS_WINDOWS = os.name == 'nt' IS_LINUX = os.name == 'posix' and os.uname()[0] == 'Linux' COMMAND = gtest_test_utils.GetTestExecutablePath('gtest_env_var_test_') environ = os.environ.copy() def AssertEq(expected, actual): if expected != actual: print 'Expected: %s' % (expected,) print ' Actual: %s' % (actual,) raise AssertionError def SetEnvVar(env_var, value): """Sets the env variable to 'value'; unsets it when 'value' is None.""" if value is not None: environ[env_var] = value elif env_var in environ: del environ[env_var] def GetFlag(flag): """Runs gtest_env_var_test_ and returns its output.""" args = [COMMAND] if flag is not None: args += [flag] return gtest_test_utils.Subprocess(args, env=environ).output def TestFlag(flag, test_val, default_val): """Verifies that the given flag is affected by the corresponding env var.""" env_var = 'GTEST_' + flag.upper() SetEnvVar(env_var, test_val) AssertEq(test_val, GetFlag(flag)) SetEnvVar(env_var, None) AssertEq(default_val, GetFlag(flag)) class GTestEnvVarTest(gtest_test_utils.TestCase): def testEnvVarAffectsFlag(self): """Tests that environment variable should affect the corresponding flag.""" TestFlag('break_on_failure', '1', '0') TestFlag('color', 'yes', 'auto') TestFlag('filter', 'FooTest.Bar', '*') TestFlag('output', 'xml:tmp/foo.xml', '') TestFlag('print_time', '0', '1') TestFlag('repeat', '999', '1') TestFlag('throw_on_failure', '1', '0') TestFlag('death_test_style', 'threadsafe', 'fast') TestFlag('catch_exceptions', '0', '1') if IS_LINUX: TestFlag('death_test_use_fork', '1', '0') TestFlag('stack_trace_depth', '0', '100') if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_env_var_test_.cc0000600000175000017500000000677011561126632025004 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // A helper program for testing that Google Test parses the environment // variables correctly. #include "gtest/gtest.h" #include #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ using ::std::cout; namespace testing { // The purpose of this is to make the test more realistic by ensuring // that the UnitTest singleton is created before main() is entered. // We don't actual run the TEST itself. TEST(GTestEnvVarTest, Dummy) { } void PrintFlag(const char* flag) { if (strcmp(flag, "break_on_failure") == 0) { cout << GTEST_FLAG(break_on_failure); return; } if (strcmp(flag, "catch_exceptions") == 0) { cout << GTEST_FLAG(catch_exceptions); return; } if (strcmp(flag, "color") == 0) { cout << GTEST_FLAG(color); return; } if (strcmp(flag, "death_test_style") == 0) { cout << GTEST_FLAG(death_test_style); return; } if (strcmp(flag, "death_test_use_fork") == 0) { cout << GTEST_FLAG(death_test_use_fork); return; } if (strcmp(flag, "filter") == 0) { cout << GTEST_FLAG(filter); return; } if (strcmp(flag, "output") == 0) { cout << GTEST_FLAG(output); return; } if (strcmp(flag, "print_time") == 0) { cout << GTEST_FLAG(print_time); return; } if (strcmp(flag, "repeat") == 0) { cout << GTEST_FLAG(repeat); return; } if (strcmp(flag, "stack_trace_depth") == 0) { cout << GTEST_FLAG(stack_trace_depth); return; } if (strcmp(flag, "throw_on_failure") == 0) { cout << GTEST_FLAG(throw_on_failure); return; } cout << "Invalid flag name " << flag << ". Valid names are break_on_failure, color, filter, etc.\n"; exit(1); } } // namespace testing int main(int argc, char** argv) { testing::InitGoogleTest(&argc, argv); if (argc != 2) { cout << "Usage: gtest_env_var_test_ NAME_OF_FLAG\n"; return 1; } testing::PrintFlag(argv[1]); return 0; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_filter_unittest.py0000600000175000017500000005141511561126632025431 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2005 Google Inc. All Rights Reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test for Google Test test filters. A user can specify which test(s) in a Google Test program to run via either the GTEST_FILTER environment variable or the --gtest_filter flag. This script tests such functionality by invoking gtest_filter_unittest_ (a program written with Google Test) with different environments and command line flags. Note that test sharding may also influence which tests are filtered. Therefore, we test that here also. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sets import sys import gtest_test_utils # Constants. # Checks if this platform can pass empty environment variables to child # processes. We set an env variable to an empty string and invoke a python # script in a subprocess to print whether the variable is STILL in # os.environ. We then use 'eval' to parse the child's output so that an # exception is thrown if the input is anything other than 'True' nor 'False'. os.environ['EMPTY_VAR'] = '' child = gtest_test_utils.Subprocess( [sys.executable, '-c', 'import os; print \'EMPTY_VAR\' in os.environ']) CAN_PASS_EMPTY_ENV = eval(child.output) # Check if this platform can unset environment variables in child processes. # We set an env variable to a non-empty string, unset it, and invoke # a python script in a subprocess to print whether the variable # is NO LONGER in os.environ. # We use 'eval' to parse the child's output so that an exception # is thrown if the input is neither 'True' nor 'False'. os.environ['UNSET_VAR'] = 'X' del os.environ['UNSET_VAR'] child = gtest_test_utils.Subprocess( [sys.executable, '-c', 'import os; print \'UNSET_VAR\' not in os.environ']) CAN_UNSET_ENV = eval(child.output) # Checks if we should test with an empty filter. This doesn't # make sense on platforms that cannot pass empty env variables (Win32) # and on platforms that cannot unset variables (since we cannot tell # the difference between "" and NULL -- Borland and Solaris < 5.10) CAN_TEST_EMPTY_FILTER = (CAN_PASS_EMPTY_ENV and CAN_UNSET_ENV) # The environment variable for specifying the test filters. FILTER_ENV_VAR = 'GTEST_FILTER' # The environment variables for test sharding. TOTAL_SHARDS_ENV_VAR = 'GTEST_TOTAL_SHARDS' SHARD_INDEX_ENV_VAR = 'GTEST_SHARD_INDEX' SHARD_STATUS_FILE_ENV_VAR = 'GTEST_SHARD_STATUS_FILE' # The command line flag for specifying the test filters. FILTER_FLAG = 'gtest_filter' # The command line flag for including disabled tests. ALSO_RUN_DISABED_TESTS_FLAG = 'gtest_also_run_disabled_tests' # Command to run the gtest_filter_unittest_ program. COMMAND = gtest_test_utils.GetTestExecutablePath('gtest_filter_unittest_') # Regex for determining whether parameterized tests are enabled in the binary. PARAM_TEST_REGEX = re.compile(r'/ParamTest') # Regex for parsing test case names from Google Test's output. TEST_CASE_REGEX = re.compile(r'^\[\-+\] \d+ tests? from (\w+(/\w+)?)') # Regex for parsing test names from Google Test's output. TEST_REGEX = re.compile(r'^\[\s*RUN\s*\].*\.(\w+(/\w+)?)') # The command line flag to tell Google Test to output the list of tests it # will run. LIST_TESTS_FLAG = '--gtest_list_tests' # Indicates whether Google Test supports death tests. SUPPORTS_DEATH_TESTS = 'HasDeathTest' in gtest_test_utils.Subprocess( [COMMAND, LIST_TESTS_FLAG]).output # Full names of all tests in gtest_filter_unittests_. PARAM_TESTS = [ 'SeqP/ParamTest.TestX/0', 'SeqP/ParamTest.TestX/1', 'SeqP/ParamTest.TestY/0', 'SeqP/ParamTest.TestY/1', 'SeqQ/ParamTest.TestX/0', 'SeqQ/ParamTest.TestX/1', 'SeqQ/ParamTest.TestY/0', 'SeqQ/ParamTest.TestY/1', ] DISABLED_TESTS = [ 'BarTest.DISABLED_TestFour', 'BarTest.DISABLED_TestFive', 'BazTest.DISABLED_TestC', 'DISABLED_FoobarTest.Test1', 'DISABLED_FoobarTest.DISABLED_Test2', 'DISABLED_FoobarbazTest.TestA', ] if SUPPORTS_DEATH_TESTS: DEATH_TESTS = [ 'HasDeathTest.Test1', 'HasDeathTest.Test2', ] else: DEATH_TESTS = [] # All the non-disabled tests. ACTIVE_TESTS = [ 'FooTest.Abc', 'FooTest.Xyz', 'BarTest.TestOne', 'BarTest.TestTwo', 'BarTest.TestThree', 'BazTest.TestOne', 'BazTest.TestA', 'BazTest.TestB', ] + DEATH_TESTS + PARAM_TESTS param_tests_present = None # Utilities. environ = os.environ.copy() def SetEnvVar(env_var, value): """Sets the env variable to 'value'; unsets it when 'value' is None.""" if value is not None: environ[env_var] = value elif env_var in environ: del environ[env_var] def RunAndReturnOutput(args = None): """Runs the test program and returns its output.""" return gtest_test_utils.Subprocess([COMMAND] + (args or []), env=environ).output def RunAndExtractTestList(args = None): """Runs the test program and returns its exit code and a list of tests run.""" p = gtest_test_utils.Subprocess([COMMAND] + (args or []), env=environ) tests_run = [] test_case = '' test = '' for line in p.output.split('\n'): match = TEST_CASE_REGEX.match(line) if match is not None: test_case = match.group(1) else: match = TEST_REGEX.match(line) if match is not None: test = match.group(1) tests_run.append(test_case + '.' + test) return (tests_run, p.exit_code) def InvokeWithModifiedEnv(extra_env, function, *args, **kwargs): """Runs the given function and arguments in a modified environment.""" try: original_env = environ.copy() environ.update(extra_env) return function(*args, **kwargs) finally: environ.clear() environ.update(original_env) def RunWithSharding(total_shards, shard_index, command): """Runs a test program shard and returns exit code and a list of tests run.""" extra_env = {SHARD_INDEX_ENV_VAR: str(shard_index), TOTAL_SHARDS_ENV_VAR: str(total_shards)} return InvokeWithModifiedEnv(extra_env, RunAndExtractTestList, command) # The unit test. class GTestFilterUnitTest(gtest_test_utils.TestCase): """Tests the env variable or the command line flag to filter tests.""" # Utilities. def AssertSetEqual(self, lhs, rhs): """Asserts that two sets are equal.""" for elem in lhs: self.assert_(elem in rhs, '%s in %s' % (elem, rhs)) for elem in rhs: self.assert_(elem in lhs, '%s in %s' % (elem, lhs)) def AssertPartitionIsValid(self, set_var, list_of_sets): """Asserts that list_of_sets is a valid partition of set_var.""" full_partition = [] for slice_var in list_of_sets: full_partition.extend(slice_var) self.assertEqual(len(set_var), len(full_partition)) self.assertEqual(sets.Set(set_var), sets.Set(full_partition)) def AdjustForParameterizedTests(self, tests_to_run): """Adjust tests_to_run in case value parameterized tests are disabled.""" global param_tests_present if not param_tests_present: return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS)) else: return tests_to_run def RunAndVerify(self, gtest_filter, tests_to_run): """Checks that the binary runs correct set of tests for a given filter.""" tests_to_run = self.AdjustForParameterizedTests(tests_to_run) # First, tests using the environment variable. # Windows removes empty variables from the environment when passing it # to a new process. This means it is impossible to pass an empty filter # into a process using the environment variable. However, we can still # test the case when the variable is not supplied (i.e., gtest_filter is # None). # pylint: disable-msg=C6403 if CAN_TEST_EMPTY_FILTER or gtest_filter != '': SetEnvVar(FILTER_ENV_VAR, gtest_filter) tests_run = RunAndExtractTestList()[0] SetEnvVar(FILTER_ENV_VAR, None) self.AssertSetEqual(tests_run, tests_to_run) # pylint: enable-msg=C6403 # Next, tests using the command line flag. if gtest_filter is None: args = [] else: args = ['--%s=%s' % (FILTER_FLAG, gtest_filter)] tests_run = RunAndExtractTestList(args)[0] self.AssertSetEqual(tests_run, tests_to_run) def RunAndVerifyWithSharding(self, gtest_filter, total_shards, tests_to_run, args=None, check_exit_0=False): """Checks that binary runs correct tests for the given filter and shard. Runs all shards of gtest_filter_unittest_ with the given filter, and verifies that the right set of tests were run. The union of tests run on each shard should be identical to tests_to_run, without duplicates. Args: gtest_filter: A filter to apply to the tests. total_shards: A total number of shards to split test run into. tests_to_run: A set of tests expected to run. args : Arguments to pass to the to the test binary. check_exit_0: When set to a true value, make sure that all shards return 0. """ tests_to_run = self.AdjustForParameterizedTests(tests_to_run) # Windows removes empty variables from the environment when passing it # to a new process. This means it is impossible to pass an empty filter # into a process using the environment variable. However, we can still # test the case when the variable is not supplied (i.e., gtest_filter is # None). # pylint: disable-msg=C6403 if CAN_TEST_EMPTY_FILTER or gtest_filter != '': SetEnvVar(FILTER_ENV_VAR, gtest_filter) partition = [] for i in range(0, total_shards): (tests_run, exit_code) = RunWithSharding(total_shards, i, args) if check_exit_0: self.assertEqual(0, exit_code) partition.append(tests_run) self.AssertPartitionIsValid(tests_to_run, partition) SetEnvVar(FILTER_ENV_VAR, None) # pylint: enable-msg=C6403 def RunAndVerifyAllowingDisabled(self, gtest_filter, tests_to_run): """Checks that the binary runs correct set of tests for the given filter. Runs gtest_filter_unittest_ with the given filter, and enables disabled tests. Verifies that the right set of tests were run. Args: gtest_filter: A filter to apply to the tests. tests_to_run: A set of tests expected to run. """ tests_to_run = self.AdjustForParameterizedTests(tests_to_run) # Construct the command line. args = ['--%s' % ALSO_RUN_DISABED_TESTS_FLAG] if gtest_filter is not None: args.append('--%s=%s' % (FILTER_FLAG, gtest_filter)) tests_run = RunAndExtractTestList(args)[0] self.AssertSetEqual(tests_run, tests_to_run) def setUp(self): """Sets up test case. Determines whether value-parameterized tests are enabled in the binary and sets the flags accordingly. """ global param_tests_present if param_tests_present is None: param_tests_present = PARAM_TEST_REGEX.search( RunAndReturnOutput()) is not None def testDefaultBehavior(self): """Tests the behavior of not specifying the filter.""" self.RunAndVerify(None, ACTIVE_TESTS) def testDefaultBehaviorWithShards(self): """Tests the behavior without the filter, with sharding enabled.""" self.RunAndVerifyWithSharding(None, 1, ACTIVE_TESTS) self.RunAndVerifyWithSharding(None, 2, ACTIVE_TESTS) self.RunAndVerifyWithSharding(None, len(ACTIVE_TESTS) - 1, ACTIVE_TESTS) self.RunAndVerifyWithSharding(None, len(ACTIVE_TESTS), ACTIVE_TESTS) self.RunAndVerifyWithSharding(None, len(ACTIVE_TESTS) + 1, ACTIVE_TESTS) def testEmptyFilter(self): """Tests an empty filter.""" self.RunAndVerify('', []) self.RunAndVerifyWithSharding('', 1, []) self.RunAndVerifyWithSharding('', 2, []) def testBadFilter(self): """Tests a filter that matches nothing.""" self.RunAndVerify('BadFilter', []) self.RunAndVerifyAllowingDisabled('BadFilter', []) def testFullName(self): """Tests filtering by full name.""" self.RunAndVerify('FooTest.Xyz', ['FooTest.Xyz']) self.RunAndVerifyAllowingDisabled('FooTest.Xyz', ['FooTest.Xyz']) self.RunAndVerifyWithSharding('FooTest.Xyz', 5, ['FooTest.Xyz']) def testUniversalFilters(self): """Tests filters that match everything.""" self.RunAndVerify('*', ACTIVE_TESTS) self.RunAndVerify('*.*', ACTIVE_TESTS) self.RunAndVerifyWithSharding('*.*', len(ACTIVE_TESTS) - 3, ACTIVE_TESTS) self.RunAndVerifyAllowingDisabled('*', ACTIVE_TESTS + DISABLED_TESTS) self.RunAndVerifyAllowingDisabled('*.*', ACTIVE_TESTS + DISABLED_TESTS) def testFilterByTestCase(self): """Tests filtering by test case name.""" self.RunAndVerify('FooTest.*', ['FooTest.Abc', 'FooTest.Xyz']) BAZ_TESTS = ['BazTest.TestOne', 'BazTest.TestA', 'BazTest.TestB'] self.RunAndVerify('BazTest.*', BAZ_TESTS) self.RunAndVerifyAllowingDisabled('BazTest.*', BAZ_TESTS + ['BazTest.DISABLED_TestC']) def testFilterByTest(self): """Tests filtering by test name.""" self.RunAndVerify('*.TestOne', ['BarTest.TestOne', 'BazTest.TestOne']) def testFilterDisabledTests(self): """Select only the disabled tests to run.""" self.RunAndVerify('DISABLED_FoobarTest.Test1', []) self.RunAndVerifyAllowingDisabled('DISABLED_FoobarTest.Test1', ['DISABLED_FoobarTest.Test1']) self.RunAndVerify('*DISABLED_*', []) self.RunAndVerifyAllowingDisabled('*DISABLED_*', DISABLED_TESTS) self.RunAndVerify('*.DISABLED_*', []) self.RunAndVerifyAllowingDisabled('*.DISABLED_*', [ 'BarTest.DISABLED_TestFour', 'BarTest.DISABLED_TestFive', 'BazTest.DISABLED_TestC', 'DISABLED_FoobarTest.DISABLED_Test2', ]) self.RunAndVerify('DISABLED_*', []) self.RunAndVerifyAllowingDisabled('DISABLED_*', [ 'DISABLED_FoobarTest.Test1', 'DISABLED_FoobarTest.DISABLED_Test2', 'DISABLED_FoobarbazTest.TestA', ]) def testWildcardInTestCaseName(self): """Tests using wildcard in the test case name.""" self.RunAndVerify('*a*.*', [ 'BarTest.TestOne', 'BarTest.TestTwo', 'BarTest.TestThree', 'BazTest.TestOne', 'BazTest.TestA', 'BazTest.TestB', ] + DEATH_TESTS + PARAM_TESTS) def testWildcardInTestName(self): """Tests using wildcard in the test name.""" self.RunAndVerify('*.*A*', ['FooTest.Abc', 'BazTest.TestA']) def testFilterWithoutDot(self): """Tests a filter that has no '.' in it.""" self.RunAndVerify('*z*', [ 'FooTest.Xyz', 'BazTest.TestOne', 'BazTest.TestA', 'BazTest.TestB', ]) def testTwoPatterns(self): """Tests filters that consist of two patterns.""" self.RunAndVerify('Foo*.*:*A*', [ 'FooTest.Abc', 'FooTest.Xyz', 'BazTest.TestA', ]) # An empty pattern + a non-empty one self.RunAndVerify(':*A*', ['FooTest.Abc', 'BazTest.TestA']) def testThreePatterns(self): """Tests filters that consist of three patterns.""" self.RunAndVerify('*oo*:*A*:*One', [ 'FooTest.Abc', 'FooTest.Xyz', 'BarTest.TestOne', 'BazTest.TestOne', 'BazTest.TestA', ]) # The 2nd pattern is empty. self.RunAndVerify('*oo*::*One', [ 'FooTest.Abc', 'FooTest.Xyz', 'BarTest.TestOne', 'BazTest.TestOne', ]) # The last 2 patterns are empty. self.RunAndVerify('*oo*::', [ 'FooTest.Abc', 'FooTest.Xyz', ]) def testNegativeFilters(self): self.RunAndVerify('*-BazTest.TestOne', [ 'FooTest.Abc', 'FooTest.Xyz', 'BarTest.TestOne', 'BarTest.TestTwo', 'BarTest.TestThree', 'BazTest.TestA', 'BazTest.TestB', ] + DEATH_TESTS + PARAM_TESTS) self.RunAndVerify('*-FooTest.Abc:BazTest.*', [ 'FooTest.Xyz', 'BarTest.TestOne', 'BarTest.TestTwo', 'BarTest.TestThree', ] + DEATH_TESTS + PARAM_TESTS) self.RunAndVerify('BarTest.*-BarTest.TestOne', [ 'BarTest.TestTwo', 'BarTest.TestThree', ]) # Tests without leading '*'. self.RunAndVerify('-FooTest.Abc:FooTest.Xyz:BazTest.*', [ 'BarTest.TestOne', 'BarTest.TestTwo', 'BarTest.TestThree', ] + DEATH_TESTS + PARAM_TESTS) # Value parameterized tests. self.RunAndVerify('*/*', PARAM_TESTS) # Value parameterized tests filtering by the sequence name. self.RunAndVerify('SeqP/*', [ 'SeqP/ParamTest.TestX/0', 'SeqP/ParamTest.TestX/1', 'SeqP/ParamTest.TestY/0', 'SeqP/ParamTest.TestY/1', ]) # Value parameterized tests filtering by the test name. self.RunAndVerify('*/0', [ 'SeqP/ParamTest.TestX/0', 'SeqP/ParamTest.TestY/0', 'SeqQ/ParamTest.TestX/0', 'SeqQ/ParamTest.TestY/0', ]) def testFlagOverridesEnvVar(self): """Tests that the filter flag overrides the filtering env. variable.""" SetEnvVar(FILTER_ENV_VAR, 'Foo*') args = ['--%s=%s' % (FILTER_FLAG, '*One')] tests_run = RunAndExtractTestList(args)[0] SetEnvVar(FILTER_ENV_VAR, None) self.AssertSetEqual(tests_run, ['BarTest.TestOne', 'BazTest.TestOne']) def testShardStatusFileIsCreated(self): """Tests that the shard file is created if specified in the environment.""" shard_status_file = os.path.join(gtest_test_utils.GetTempDir(), 'shard_status_file') self.assert_(not os.path.exists(shard_status_file)) extra_env = {SHARD_STATUS_FILE_ENV_VAR: shard_status_file} try: InvokeWithModifiedEnv(extra_env, RunAndReturnOutput) finally: self.assert_(os.path.exists(shard_status_file)) os.remove(shard_status_file) def testShardStatusFileIsCreatedWithListTests(self): """Tests that the shard file is created with the "list_tests" flag.""" shard_status_file = os.path.join(gtest_test_utils.GetTempDir(), 'shard_status_file2') self.assert_(not os.path.exists(shard_status_file)) extra_env = {SHARD_STATUS_FILE_ENV_VAR: shard_status_file} try: output = InvokeWithModifiedEnv(extra_env, RunAndReturnOutput, [LIST_TESTS_FLAG]) finally: # This assertion ensures that Google Test enumerated the tests as # opposed to running them. self.assert_('[==========]' not in output, 'Unexpected output during test enumeration.\n' 'Please ensure that LIST_TESTS_FLAG is assigned the\n' 'correct flag value for listing Google Test tests.') self.assert_(os.path.exists(shard_status_file)) os.remove(shard_status_file) if SUPPORTS_DEATH_TESTS: def testShardingWorksWithDeathTests(self): """Tests integration with death tests and sharding.""" gtest_filter = 'HasDeathTest.*:SeqP/*' expected_tests = [ 'HasDeathTest.Test1', 'HasDeathTest.Test2', 'SeqP/ParamTest.TestX/0', 'SeqP/ParamTest.TestX/1', 'SeqP/ParamTest.TestY/0', 'SeqP/ParamTest.TestY/1', ] for flag in ['--gtest_death_test_style=threadsafe', '--gtest_death_test_style=fast']: self.RunAndVerifyWithSharding(gtest_filter, 3, expected_tests, check_exit_0=True, args=[flag]) self.RunAndVerifyWithSharding(gtest_filter, 5, expected_tests, check_exit_0=True, args=[flag]) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_filter_unittest_.cc0000600000175000017500000000675411561126632025533 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Unit test for Google Test test filters. // // A user can specify which test(s) in a Google Test program to run via // either the GTEST_FILTER environment variable or the --gtest_filter // flag. This is used for testing such functionality. // // The program will be invoked from a Python unit test. Don't run it // directly. #include "gtest/gtest.h" namespace { // Test case FooTest. class FooTest : public testing::Test { }; TEST_F(FooTest, Abc) { } TEST_F(FooTest, Xyz) { FAIL() << "Expected failure."; } // Test case BarTest. TEST(BarTest, TestOne) { } TEST(BarTest, TestTwo) { } TEST(BarTest, TestThree) { } TEST(BarTest, DISABLED_TestFour) { FAIL() << "Expected failure."; } TEST(BarTest, DISABLED_TestFive) { FAIL() << "Expected failure."; } // Test case BazTest. TEST(BazTest, TestOne) { FAIL() << "Expected failure."; } TEST(BazTest, TestA) { } TEST(BazTest, TestB) { } TEST(BazTest, DISABLED_TestC) { FAIL() << "Expected failure."; } // Test case HasDeathTest TEST(HasDeathTest, Test1) { EXPECT_DEATH_IF_SUPPORTED(exit(1), ".*"); } // We need at least two death tests to make sure that the all death tests // aren't on the first shard. TEST(HasDeathTest, Test2) { EXPECT_DEATH_IF_SUPPORTED(exit(1), ".*"); } // Test case FoobarTest TEST(DISABLED_FoobarTest, Test1) { FAIL() << "Expected failure."; } TEST(DISABLED_FoobarTest, DISABLED_Test2) { FAIL() << "Expected failure."; } // Test case FoobarbazTest TEST(DISABLED_FoobarbazTest, TestA) { FAIL() << "Expected failure."; } #if GTEST_HAS_PARAM_TEST class ParamTest : public testing::TestWithParam { }; TEST_P(ParamTest, TestX) { } TEST_P(ParamTest, TestY) { } INSTANTIATE_TEST_CASE_P(SeqP, ParamTest, testing::Values(1, 2)); INSTANTIATE_TEST_CASE_P(SeqQ, ParamTest, testing::Values(5, 6)); #endif // GTEST_HAS_PARAM_TEST } // namespace int main(int argc, char **argv) { ::testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_help_test.py0000600000175000017500000001334011561126632024167 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests the --help flag of Google C++ Testing Framework. SYNOPSIS gtest_help_test.py --build_dir=BUILD/DIR # where BUILD/DIR contains the built gtest_help_test_ file. gtest_help_test.py """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import gtest_test_utils IS_LINUX = os.name == 'posix' and os.uname()[0] == 'Linux' IS_WINDOWS = os.name == 'nt' PROGRAM_PATH = gtest_test_utils.GetTestExecutablePath('gtest_help_test_') FLAG_PREFIX = '--gtest_' DEATH_TEST_STYLE_FLAG = FLAG_PREFIX + 'death_test_style' STREAM_RESULT_TO_FLAG = FLAG_PREFIX + 'stream_result_to' UNKNOWN_FLAG = FLAG_PREFIX + 'unknown_flag_for_testing' LIST_TESTS_FLAG = FLAG_PREFIX + 'list_tests' INCORRECT_FLAG_VARIANTS = [re.sub('^--', '-', LIST_TESTS_FLAG), re.sub('^--', '/', LIST_TESTS_FLAG), re.sub('_', '-', LIST_TESTS_FLAG)] INTERNAL_FLAG_FOR_TESTING = FLAG_PREFIX + 'internal_flag_for_testing' SUPPORTS_DEATH_TESTS = "DeathTest" in gtest_test_utils.Subprocess( [PROGRAM_PATH, LIST_TESTS_FLAG]).output # The help message must match this regex. HELP_REGEX = re.compile( FLAG_PREFIX + r'list_tests.*' + FLAG_PREFIX + r'filter=.*' + FLAG_PREFIX + r'also_run_disabled_tests.*' + FLAG_PREFIX + r'repeat=.*' + FLAG_PREFIX + r'shuffle.*' + FLAG_PREFIX + r'random_seed=.*' + FLAG_PREFIX + r'color=.*' + FLAG_PREFIX + r'print_time.*' + FLAG_PREFIX + r'output=.*' + FLAG_PREFIX + r'break_on_failure.*' + FLAG_PREFIX + r'throw_on_failure.*' + FLAG_PREFIX + r'catch_exceptions=0.*', re.DOTALL) def RunWithFlag(flag): """Runs gtest_help_test_ with the given flag. Returns: the exit code and the text output as a tuple. Args: flag: the command-line flag to pass to gtest_help_test_, or None. """ if flag is None: command = [PROGRAM_PATH] else: command = [PROGRAM_PATH, flag] child = gtest_test_utils.Subprocess(command) return child.exit_code, child.output class GTestHelpTest(gtest_test_utils.TestCase): """Tests the --help flag and its equivalent forms.""" def TestHelpFlag(self, flag): """Verifies correct behavior when help flag is specified. The right message must be printed and the tests must skipped when the given flag is specified. Args: flag: A flag to pass to the binary or None. """ exit_code, output = RunWithFlag(flag) self.assertEquals(0, exit_code) self.assert_(HELP_REGEX.search(output), output) if IS_LINUX: self.assert_(STREAM_RESULT_TO_FLAG in output, output) else: self.assert_(STREAM_RESULT_TO_FLAG not in output, output) if SUPPORTS_DEATH_TESTS and not IS_WINDOWS: self.assert_(DEATH_TEST_STYLE_FLAG in output, output) else: self.assert_(DEATH_TEST_STYLE_FLAG not in output, output) def TestNonHelpFlag(self, flag): """Verifies correct behavior when no help flag is specified. Verifies that when no help flag is specified, the tests are run and the help message is not printed. Args: flag: A flag to pass to the binary or None. """ exit_code, output = RunWithFlag(flag) self.assert_(exit_code != 0) self.assert_(not HELP_REGEX.search(output), output) def testPrintsHelpWithFullFlag(self): self.TestHelpFlag('--help') def testPrintsHelpWithShortFlag(self): self.TestHelpFlag('-h') def testPrintsHelpWithQuestionFlag(self): self.TestHelpFlag('-?') def testPrintsHelpWithWindowsStyleQuestionFlag(self): self.TestHelpFlag('/?') def testPrintsHelpWithUnrecognizedGoogleTestFlag(self): self.TestHelpFlag(UNKNOWN_FLAG) def testPrintsHelpWithIncorrectFlagStyle(self): for incorrect_flag in INCORRECT_FLAG_VARIANTS: self.TestHelpFlag(incorrect_flag) def testRunsTestsWithoutHelpFlag(self): """Verifies that when no help flag is specified, the tests are run and the help message is not printed.""" self.TestNonHelpFlag(None) def testRunsTestsWithGtestInternalFlag(self): """Verifies that the tests are run and no help message is printed when a flag starting with Google Test prefix and 'internal_' is supplied.""" self.TestNonHelpFlag(INTERNAL_FLAG_FOR_TESTING) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_help_test_.cc0000600000175000017500000000412311561126632024262 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // This program is meant to be run by gtest_help_test.py. Do not run // it directly. #include "gtest/gtest.h" // When a help flag is specified, this program should skip the tests // and exit with 0; otherwise the following test will be executed, // causing this program to exit with a non-zero code. TEST(HelpFlagTest, ShouldNotBeRun) { ASSERT_TRUE(false) << "Tests shouldn't be run when --help is specified."; } #if GTEST_HAS_DEATH_TEST TEST(DeathTest, UsedByPythonScriptToDetectSupportForDeathTestsInThisBinary) {} #endif synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_list_tests_unittest.py0000600000175000017500000001244711561126632026343 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test for Google Test's --gtest_list_tests flag. A user can ask Google Test to list all tests by specifying the --gtest_list_tests flag. This script tests such functionality by invoking gtest_list_tests_unittest_ (a program written with Google Test) the command line flags. """ __author__ = 'phanna@google.com (Patrick Hanna)' import gtest_test_utils # Constants. # The command line flag for enabling/disabling listing all tests. LIST_TESTS_FLAG = 'gtest_list_tests' # Path to the gtest_list_tests_unittest_ program. EXE_PATH = gtest_test_utils.GetTestExecutablePath('gtest_list_tests_unittest_') # The expected output when running gtest_list_tests_unittest_ with # --gtest_list_tests EXPECTED_OUTPUT_NO_FILTER = """FooDeathTest. Test1 Foo. Bar1 Bar2 DISABLED_Bar3 Abc. Xyz Def FooBar. Baz FooTest. Test1 DISABLED_Test2 Test3 """ # The expected output when running gtest_list_tests_unittest_ with # --gtest_list_tests and --gtest_filter=Foo*. EXPECTED_OUTPUT_FILTER_FOO = """FooDeathTest. Test1 Foo. Bar1 Bar2 DISABLED_Bar3 FooBar. Baz FooTest. Test1 DISABLED_Test2 Test3 """ # Utilities. def Run(args): """Runs gtest_list_tests_unittest_ and returns the list of tests printed.""" return gtest_test_utils.Subprocess([EXE_PATH] + args, capture_stderr=False).output # The unit test. class GTestListTestsUnitTest(gtest_test_utils.TestCase): """Tests using the --gtest_list_tests flag to list all tests.""" def RunAndVerify(self, flag_value, expected_output, other_flag): """Runs gtest_list_tests_unittest_ and verifies that it prints the correct tests. Args: flag_value: value of the --gtest_list_tests flag; None if the flag should not be present. expected_output: the expected output after running command; other_flag: a different flag to be passed to command along with gtest_list_tests; None if the flag should not be present. """ if flag_value is None: flag = '' flag_expression = 'not set' elif flag_value == '0': flag = '--%s=0' % LIST_TESTS_FLAG flag_expression = '0' else: flag = '--%s' % LIST_TESTS_FLAG flag_expression = '1' args = [flag] if other_flag is not None: args += [other_flag] output = Run(args) msg = ('when %s is %s, the output of "%s" is "%s".' % (LIST_TESTS_FLAG, flag_expression, ' '.join(args), output)) if expected_output is not None: self.assert_(output == expected_output, msg) else: self.assert_(output != EXPECTED_OUTPUT_NO_FILTER, msg) def testDefaultBehavior(self): """Tests the behavior of the default mode.""" self.RunAndVerify(flag_value=None, expected_output=None, other_flag=None) def testFlag(self): """Tests using the --gtest_list_tests flag.""" self.RunAndVerify(flag_value='0', expected_output=None, other_flag=None) self.RunAndVerify(flag_value='1', expected_output=EXPECTED_OUTPUT_NO_FILTER, other_flag=None) def testOverrideNonFilterFlags(self): """Tests that --gtest_list_tests overrides the non-filter flags.""" self.RunAndVerify(flag_value='1', expected_output=EXPECTED_OUTPUT_NO_FILTER, other_flag='--gtest_break_on_failure') def testWithFilterFlags(self): """Tests that --gtest_list_tests takes into account the --gtest_filter flag.""" self.RunAndVerify(flag_value='1', expected_output=EXPECTED_OUTPUT_FILTER_FOO, other_flag='--gtest_filter=Foo*') if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_list_tests_unittest_.cc0000600000175000017500000000463011561126632026432 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: phanna@google.com (Patrick Hanna) // Unit test for Google Test's --gtest_list_tests flag. // // A user can ask Google Test to list all tests that will run // so that when using a filter, a user will know what // tests to look for. The tests will not be run after listing. // // This program will be invoked from a Python unit test. // Don't run it directly. #include "gtest/gtest.h" namespace { // Several different test cases and tests that will be listed. TEST(Foo, Bar1) { } TEST(Foo, Bar2) { } TEST(Foo, DISABLED_Bar3) { } TEST(Abc, Xyz) { } TEST(Abc, Def) { } TEST(FooBar, Baz) { } class FooTest : public testing::Test { }; TEST_F(FooTest, Test1) { } TEST_F(FooTest, DISABLED_Test2) { } TEST_F(FooTest, Test3) { } TEST(FooDeathTest, Test1) { } } // namespace int main(int argc, char **argv) { ::testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_main_unittest.cc0000600000175000017500000000354011561126632025021 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest.h" // Tests that we don't have to define main() when we link to // gtest_main instead of gtest. namespace { TEST(GTestMainTest, ShouldSucceed) { } } // namespace // We are using the main() function defined in src/gtest_main.cc, so // we don't define it here. synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_no_test_unittest.cc0000600000175000017500000000462011561126632025550 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Tests that a Google Test program that has no test defined can run // successfully. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest.h" int main(int argc, char **argv) { testing::InitGoogleTest(&argc, argv); // An ad-hoc assertion outside of all tests. // // This serves three purposes: // // 1. It verifies that an ad-hoc assertion can be executed even if // no test is defined. // 2. It verifies that a failed ad-hoc assertion causes the test // program to fail. // 3. We had a bug where the XML output won't be generated if an // assertion is executed before RUN_ALL_TESTS() is called, even // though --gtest_output=xml is specified. This makes sure the // bug is fixed and doesn't regress. EXPECT_EQ(1, 2); // The above EXPECT_EQ() should cause RUN_ALL_TESTS() to return non-zero. return RUN_ALL_TESTS() ? 0 : 1; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_output_test.py0000600000175000017500000002734511561126632024611 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests the text output of Google C++ Testing Framework. SYNOPSIS gtest_output_test.py --build_dir=BUILD/DIR --gengolden # where BUILD/DIR contains the built gtest_output_test_ file. gtest_output_test.py --gengolden gtest_output_test.py """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import re import sys import gtest_test_utils # The flag for generating the golden file GENGOLDEN_FLAG = '--gengolden' CATCH_EXCEPTIONS_ENV_VAR_NAME = 'GTEST_CATCH_EXCEPTIONS' IS_WINDOWS = os.name == 'nt' # TODO(vladl@google.com): remove the _lin suffix. GOLDEN_NAME = 'gtest_output_test_golden_lin.txt' PROGRAM_PATH = gtest_test_utils.GetTestExecutablePath('gtest_output_test_') # At least one command we exercise must not have the # --gtest_internal_skip_environment_and_ad_hoc_tests flag. COMMAND_LIST_TESTS = ({}, [PROGRAM_PATH, '--gtest_list_tests']) COMMAND_WITH_COLOR = ({}, [PROGRAM_PATH, '--gtest_color=yes']) COMMAND_WITH_TIME = ({}, [PROGRAM_PATH, '--gtest_print_time', '--gtest_internal_skip_environment_and_ad_hoc_tests', '--gtest_filter=FatalFailureTest.*:LoggingTest.*']) COMMAND_WITH_DISABLED = ( {}, [PROGRAM_PATH, '--gtest_also_run_disabled_tests', '--gtest_internal_skip_environment_and_ad_hoc_tests', '--gtest_filter=*DISABLED_*']) COMMAND_WITH_SHARDING = ( {'GTEST_SHARD_INDEX': '1', 'GTEST_TOTAL_SHARDS': '2'}, [PROGRAM_PATH, '--gtest_internal_skip_environment_and_ad_hoc_tests', '--gtest_filter=PassingTest.*']) GOLDEN_PATH = os.path.join(gtest_test_utils.GetSourceDir(), GOLDEN_NAME) def ToUnixLineEnding(s): """Changes all Windows/Mac line endings in s to UNIX line endings.""" return s.replace('\r\n', '\n').replace('\r', '\n') def RemoveLocations(test_output): """Removes all file location info from a Google Test program's output. Args: test_output: the output of a Google Test program. Returns: output with all file location info (in the form of 'DIRECTORY/FILE_NAME:LINE_NUMBER: 'or 'DIRECTORY\\FILE_NAME(LINE_NUMBER): ') replaced by 'FILE_NAME:#: '. """ return re.sub(r'.*[/\\](.+)(\:\d+|\(\d+\))\: ', r'\1:#: ', test_output) def RemoveStackTraceDetails(output): """Removes all stack traces from a Google Test program's output.""" # *? means "find the shortest string that matches". return re.sub(r'Stack trace:(.|\n)*?\n\n', 'Stack trace: (omitted)\n\n', output) def RemoveStackTraces(output): """Removes all traces of stack traces from a Google Test program's output.""" # *? means "find the shortest string that matches". return re.sub(r'Stack trace:(.|\n)*?\n\n', '', output) def RemoveTime(output): """Removes all time information from a Google Test program's output.""" return re.sub(r'\(\d+ ms', '(? ms', output) def RemoveTypeInfoDetails(test_output): """Removes compiler-specific type info from Google Test program's output. Args: test_output: the output of a Google Test program. Returns: output with type information normalized to canonical form. """ # some compilers output the name of type 'unsigned int' as 'unsigned' return re.sub(r'unsigned int', 'unsigned', test_output) def NormalizeToCurrentPlatform(test_output): """Normalizes platform specific output details for easier comparison.""" if IS_WINDOWS: # Removes the color information that is not present on Windows. test_output = re.sub('\x1b\\[(0;3\d)?m', '', test_output) # Changes failure message headers into the Windows format. test_output = re.sub(r': Failure\n', r': error: ', test_output) # Changes file(line_number) to file:line_number. test_output = re.sub(r'((\w|\.)+)\((\d+)\):', r'\1:\3:', test_output) return test_output def RemoveTestCounts(output): """Removes test counts from a Google Test program's output.""" output = re.sub(r'\d+ tests?, listed below', '? tests, listed below', output) output = re.sub(r'\d+ FAILED TESTS', '? FAILED TESTS', output) output = re.sub(r'\d+ tests? from \d+ test cases?', '? tests from ? test cases', output) output = re.sub(r'\d+ tests? from ([a-zA-Z_])', r'? tests from \1', output) return re.sub(r'\d+ tests?\.', '? tests.', output) def RemoveMatchingTests(test_output, pattern): """Removes output of specified tests from a Google Test program's output. This function strips not only the beginning and the end of a test but also all output in between. Args: test_output: A string containing the test output. pattern: A regex string that matches names of test cases or tests to remove. Returns: Contents of test_output with tests whose names match pattern removed. """ test_output = re.sub( r'.*\[ RUN \] .*%s(.|\n)*?\[( FAILED | OK )\] .*%s.*\n' % ( pattern, pattern), '', test_output) return re.sub(r'.*%s.*\n' % pattern, '', test_output) def NormalizeOutput(output): """Normalizes output (the output of gtest_output_test_.exe).""" output = ToUnixLineEnding(output) output = RemoveLocations(output) output = RemoveStackTraceDetails(output) output = RemoveTime(output) return output def GetShellCommandOutput(env_cmd): """Runs a command in a sub-process, and returns its output in a string. Args: env_cmd: The shell command. A 2-tuple where element 0 is a dict of extra environment variables to set, and element 1 is a string with the command and any flags. Returns: A string with the command's combined standard and diagnostic output. """ # Spawns cmd in a sub-process, and gets its standard I/O file objects. # Set and save the environment properly. environ = os.environ.copy() environ.update(env_cmd[0]) p = gtest_test_utils.Subprocess(env_cmd[1], env=environ) return p.output def GetCommandOutput(env_cmd): """Runs a command and returns its output with all file location info stripped off. Args: env_cmd: The shell command. A 2-tuple where element 0 is a dict of extra environment variables to set, and element 1 is a string with the command and any flags. """ # Disables exception pop-ups on Windows. environ, cmdline = env_cmd environ = dict(environ) # Ensures we are modifying a copy. environ[CATCH_EXCEPTIONS_ENV_VAR_NAME] = '1' return NormalizeOutput(GetShellCommandOutput((environ, cmdline))) def GetOutputOfAllCommands(): """Returns concatenated output from several representative commands.""" return (GetCommandOutput(COMMAND_WITH_COLOR) + GetCommandOutput(COMMAND_WITH_TIME) + GetCommandOutput(COMMAND_WITH_DISABLED) + GetCommandOutput(COMMAND_WITH_SHARDING)) test_list = GetShellCommandOutput(COMMAND_LIST_TESTS) SUPPORTS_DEATH_TESTS = 'DeathTest' in test_list SUPPORTS_TYPED_TESTS = 'TypedTest' in test_list SUPPORTS_THREADS = 'ExpectFailureWithThreadsTest' in test_list SUPPORTS_STACK_TRACES = False CAN_GENERATE_GOLDEN_FILE = (SUPPORTS_DEATH_TESTS and SUPPORTS_TYPED_TESTS and SUPPORTS_THREADS) class GTestOutputTest(gtest_test_utils.TestCase): def RemoveUnsupportedTests(self, test_output): if not SUPPORTS_DEATH_TESTS: test_output = RemoveMatchingTests(test_output, 'DeathTest') if not SUPPORTS_TYPED_TESTS: test_output = RemoveMatchingTests(test_output, 'TypedTest') test_output = RemoveMatchingTests(test_output, 'TypedDeathTest') test_output = RemoveMatchingTests(test_output, 'TypeParamDeathTest') if not SUPPORTS_THREADS: test_output = RemoveMatchingTests(test_output, 'ExpectFailureWithThreadsTest') test_output = RemoveMatchingTests(test_output, 'ScopedFakeTestPartResultReporterTest') test_output = RemoveMatchingTests(test_output, 'WorksConcurrently') if not SUPPORTS_STACK_TRACES: test_output = RemoveStackTraces(test_output) return test_output def testOutput(self): output = GetOutputOfAllCommands() golden_file = open(GOLDEN_PATH, 'rb') # A mis-configured source control system can cause \r appear in EOL # sequences when we read the golden file irrespective of an operating # system used. Therefore, we need to strip those \r's from newlines # unconditionally. golden = ToUnixLineEnding(golden_file.read()) golden_file.close() # We want the test to pass regardless of certain features being # supported or not. # We still have to remove type name specifics in all cases. normalized_actual = RemoveTypeInfoDetails(output) normalized_golden = RemoveTypeInfoDetails(golden) if CAN_GENERATE_GOLDEN_FILE: self.assertEqual(normalized_golden, normalized_actual) else: normalized_actual = NormalizeToCurrentPlatform( RemoveTestCounts(normalized_actual)) normalized_golden = NormalizeToCurrentPlatform( RemoveTestCounts(self.RemoveUnsupportedTests(normalized_golden))) # This code is very handy when debugging golden file differences: if os.getenv('DEBUG_GTEST_OUTPUT_TEST'): open(os.path.join( gtest_test_utils.GetSourceDir(), '_gtest_output_test_normalized_actual.txt'), 'wb').write( normalized_actual) open(os.path.join( gtest_test_utils.GetSourceDir(), '_gtest_output_test_normalized_golden.txt'), 'wb').write( normalized_golden) self.assertEqual(normalized_golden, normalized_actual) if __name__ == '__main__': if sys.argv[1:] == [GENGOLDEN_FLAG]: if CAN_GENERATE_GOLDEN_FILE: output = GetOutputOfAllCommands() golden_file = open(GOLDEN_PATH, 'wb') golden_file.write(output) golden_file.close() else: message = ( """Unable to write a golden file when compiled in an environment that does not support all the required features (death tests, typed tests, and multiple threads). Please generate the golden file using a binary built with those features enabled.""") sys.stderr.write(message) sys.exit(1) else: gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_output_test_.cc0000600000175000017500000007643111561126632024705 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // A unit test for Google Test itself. This verifies that the basic // constructs of Google Test work. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest-spi.h" #include "gtest/gtest.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ #include #if GTEST_IS_THREADSAFE using testing::ScopedFakeTestPartResultReporter; using testing::TestPartResultArray; using testing::internal::Notification; using testing::internal::ThreadWithParam; #endif namespace posix = ::testing::internal::posix; using testing::internal::String; using testing::internal::scoped_ptr; // Tests catching fatal failures. // A subroutine used by the following test. void TestEq1(int x) { ASSERT_EQ(1, x); } // This function calls a test subroutine, catches the fatal failure it // generates, and then returns early. void TryTestSubroutine() { // Calls a subrountine that yields a fatal failure. TestEq1(2); // Catches the fatal failure and aborts the test. // // The testing::Test:: prefix is necessary when calling // HasFatalFailure() outside of a TEST, TEST_F, or test fixture. if (testing::Test::HasFatalFailure()) return; // If we get here, something is wrong. FAIL() << "This should never be reached."; } TEST(PassingTest, PassingTest1) { } TEST(PassingTest, PassingTest2) { } // Tests that parameters of failing parameterized tests are printed in the // failing test summary. class FailingParamTest : public testing::TestWithParam {}; TEST_P(FailingParamTest, Fails) { EXPECT_EQ(1, GetParam()); } // This generates a test which will fail. Google Test is expected to print // its parameter when it outputs the list of all failed tests. INSTANTIATE_TEST_CASE_P(PrintingFailingParams, FailingParamTest, testing::Values(2)); // Tests catching a fatal failure in a subroutine. TEST(FatalFailureTest, FatalFailureInSubroutine) { printf("(expecting a failure that x should be 1)\n"); TryTestSubroutine(); } // Tests catching a fatal failure in a nested subroutine. TEST(FatalFailureTest, FatalFailureInNestedSubroutine) { printf("(expecting a failure that x should be 1)\n"); // Calls a subrountine that yields a fatal failure. TryTestSubroutine(); // Catches the fatal failure and aborts the test. // // When calling HasFatalFailure() inside a TEST, TEST_F, or test // fixture, the testing::Test:: prefix is not needed. if (HasFatalFailure()) return; // If we get here, something is wrong. FAIL() << "This should never be reached."; } // Tests HasFatalFailure() after a failed EXPECT check. TEST(FatalFailureTest, NonfatalFailureInSubroutine) { printf("(expecting a failure on false)\n"); EXPECT_TRUE(false); // Generates a nonfatal failure ASSERT_FALSE(HasFatalFailure()); // This should succeed. } // Tests interleaving user logging and Google Test assertions. TEST(LoggingTest, InterleavingLoggingAndAssertions) { static const int a[4] = { 3, 9, 2, 6 }; printf("(expecting 2 failures on (3) >= (a[i]))\n"); for (int i = 0; i < static_cast(sizeof(a)/sizeof(*a)); i++) { printf("i == %d\n", i); EXPECT_GE(3, a[i]); } } // Tests the SCOPED_TRACE macro. // A helper function for testing SCOPED_TRACE. void SubWithoutTrace(int n) { EXPECT_EQ(1, n); ASSERT_EQ(2, n); } // Another helper function for testing SCOPED_TRACE. void SubWithTrace(int n) { SCOPED_TRACE(testing::Message() << "n = " << n); SubWithoutTrace(n); } // Tests that SCOPED_TRACE() obeys lexical scopes. TEST(SCOPED_TRACETest, ObeysScopes) { printf("(expected to fail)\n"); // There should be no trace before SCOPED_TRACE() is invoked. ADD_FAILURE() << "This failure is expected, and shouldn't have a trace."; { SCOPED_TRACE("Expected trace"); // After SCOPED_TRACE(), a failure in the current scope should contain // the trace. ADD_FAILURE() << "This failure is expected, and should have a trace."; } // Once the control leaves the scope of the SCOPED_TRACE(), there // should be no trace again. ADD_FAILURE() << "This failure is expected, and shouldn't have a trace."; } // Tests that SCOPED_TRACE works inside a loop. TEST(SCOPED_TRACETest, WorksInLoop) { printf("(expected to fail)\n"); for (int i = 1; i <= 2; i++) { SCOPED_TRACE(testing::Message() << "i = " << i); SubWithoutTrace(i); } } // Tests that SCOPED_TRACE works in a subroutine. TEST(SCOPED_TRACETest, WorksInSubroutine) { printf("(expected to fail)\n"); SubWithTrace(1); SubWithTrace(2); } // Tests that SCOPED_TRACE can be nested. TEST(SCOPED_TRACETest, CanBeNested) { printf("(expected to fail)\n"); SCOPED_TRACE(""); // A trace without a message. SubWithTrace(2); } // Tests that multiple SCOPED_TRACEs can be used in the same scope. TEST(SCOPED_TRACETest, CanBeRepeated) { printf("(expected to fail)\n"); SCOPED_TRACE("A"); ADD_FAILURE() << "This failure is expected, and should contain trace point A."; SCOPED_TRACE("B"); ADD_FAILURE() << "This failure is expected, and should contain trace point A and B."; { SCOPED_TRACE("C"); ADD_FAILURE() << "This failure is expected, and should contain " << "trace point A, B, and C."; } SCOPED_TRACE("D"); ADD_FAILURE() << "This failure is expected, and should contain " << "trace point A, B, and D."; } #if GTEST_IS_THREADSAFE // Tests that SCOPED_TRACE()s can be used concurrently from multiple // threads. Namely, an assertion should be affected by // SCOPED_TRACE()s in its own thread only. // Here's the sequence of actions that happen in the test: // // Thread A (main) | Thread B (spawned) // ===============================|================================ // spawns thread B | // -------------------------------+-------------------------------- // waits for n1 | SCOPED_TRACE("Trace B"); // | generates failure #1 // | notifies n1 // -------------------------------+-------------------------------- // SCOPED_TRACE("Trace A"); | waits for n2 // generates failure #2 | // notifies n2 | // -------------------------------|-------------------------------- // waits for n3 | generates failure #3 // | trace B dies // | generates failure #4 // | notifies n3 // -------------------------------|-------------------------------- // generates failure #5 | finishes // trace A dies | // generates failure #6 | // -------------------------------|-------------------------------- // waits for thread B to finish | struct CheckPoints { Notification n1; Notification n2; Notification n3; }; static void ThreadWithScopedTrace(CheckPoints* check_points) { { SCOPED_TRACE("Trace B"); ADD_FAILURE() << "Expected failure #1 (in thread B, only trace B alive)."; check_points->n1.Notify(); check_points->n2.WaitForNotification(); ADD_FAILURE() << "Expected failure #3 (in thread B, trace A & B both alive)."; } // Trace B dies here. ADD_FAILURE() << "Expected failure #4 (in thread B, only trace A alive)."; check_points->n3.Notify(); } TEST(SCOPED_TRACETest, WorksConcurrently) { printf("(expecting 6 failures)\n"); CheckPoints check_points; ThreadWithParam thread(&ThreadWithScopedTrace, &check_points, NULL); check_points.n1.WaitForNotification(); { SCOPED_TRACE("Trace A"); ADD_FAILURE() << "Expected failure #2 (in thread A, trace A & B both alive)."; check_points.n2.Notify(); check_points.n3.WaitForNotification(); ADD_FAILURE() << "Expected failure #5 (in thread A, only trace A alive)."; } // Trace A dies here. ADD_FAILURE() << "Expected failure #6 (in thread A, no trace alive)."; thread.Join(); } #endif // GTEST_IS_THREADSAFE TEST(DisabledTestsWarningTest, DISABLED_AlsoRunDisabledTestsFlagSuppressesWarning) { // This test body is intentionally empty. Its sole purpose is for // verifying that the --gtest_also_run_disabled_tests flag // suppresses the "YOU HAVE 12 DISABLED TESTS" warning at the end of // the test output. } // Tests using assertions outside of TEST and TEST_F. // // This function creates two failures intentionally. void AdHocTest() { printf("The non-test part of the code is expected to have 2 failures.\n\n"); EXPECT_TRUE(false); EXPECT_EQ(2, 3); } // Runs all TESTs, all TEST_Fs, and the ad hoc test. int RunAllTests() { AdHocTest(); return RUN_ALL_TESTS(); } // Tests non-fatal failures in the fixture constructor. class NonFatalFailureInFixtureConstructorTest : public testing::Test { protected: NonFatalFailureInFixtureConstructorTest() { printf("(expecting 5 failures)\n"); ADD_FAILURE() << "Expected failure #1, in the test fixture c'tor."; } ~NonFatalFailureInFixtureConstructorTest() { ADD_FAILURE() << "Expected failure #5, in the test fixture d'tor."; } virtual void SetUp() { ADD_FAILURE() << "Expected failure #2, in SetUp()."; } virtual void TearDown() { ADD_FAILURE() << "Expected failure #4, in TearDown."; } }; TEST_F(NonFatalFailureInFixtureConstructorTest, FailureInConstructor) { ADD_FAILURE() << "Expected failure #3, in the test body."; } // Tests fatal failures in the fixture constructor. class FatalFailureInFixtureConstructorTest : public testing::Test { protected: FatalFailureInFixtureConstructorTest() { printf("(expecting 2 failures)\n"); Init(); } ~FatalFailureInFixtureConstructorTest() { ADD_FAILURE() << "Expected failure #2, in the test fixture d'tor."; } virtual void SetUp() { ADD_FAILURE() << "UNEXPECTED failure in SetUp(). " << "We should never get here, as the test fixture c'tor " << "had a fatal failure."; } virtual void TearDown() { ADD_FAILURE() << "UNEXPECTED failure in TearDown(). " << "We should never get here, as the test fixture c'tor " << "had a fatal failure."; } private: void Init() { FAIL() << "Expected failure #1, in the test fixture c'tor."; } }; TEST_F(FatalFailureInFixtureConstructorTest, FailureInConstructor) { ADD_FAILURE() << "UNEXPECTED failure in the test body. " << "We should never get here, as the test fixture c'tor " << "had a fatal failure."; } // Tests non-fatal failures in SetUp(). class NonFatalFailureInSetUpTest : public testing::Test { protected: virtual ~NonFatalFailureInSetUpTest() { Deinit(); } virtual void SetUp() { printf("(expecting 4 failures)\n"); ADD_FAILURE() << "Expected failure #1, in SetUp()."; } virtual void TearDown() { FAIL() << "Expected failure #3, in TearDown()."; } private: void Deinit() { FAIL() << "Expected failure #4, in the test fixture d'tor."; } }; TEST_F(NonFatalFailureInSetUpTest, FailureInSetUp) { FAIL() << "Expected failure #2, in the test function."; } // Tests fatal failures in SetUp(). class FatalFailureInSetUpTest : public testing::Test { protected: virtual ~FatalFailureInSetUpTest() { Deinit(); } virtual void SetUp() { printf("(expecting 3 failures)\n"); FAIL() << "Expected failure #1, in SetUp()."; } virtual void TearDown() { FAIL() << "Expected failure #2, in TearDown()."; } private: void Deinit() { FAIL() << "Expected failure #3, in the test fixture d'tor."; } }; TEST_F(FatalFailureInSetUpTest, FailureInSetUp) { FAIL() << "UNEXPECTED failure in the test function. " << "We should never get here, as SetUp() failed."; } TEST(AddFailureAtTest, MessageContainsSpecifiedFileAndLineNumber) { ADD_FAILURE_AT("foo.cc", 42) << "Expected failure in foo.cc"; } #if GTEST_IS_THREADSAFE // A unary function that may die. void DieIf(bool should_die) { GTEST_CHECK_(!should_die) << " - death inside DieIf()."; } // Tests running death tests in a multi-threaded context. // Used for coordination between the main and the spawn thread. struct SpawnThreadNotifications { SpawnThreadNotifications() {} Notification spawn_thread_started; Notification spawn_thread_ok_to_terminate; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(SpawnThreadNotifications); }; // The function to be executed in the thread spawn by the // MultipleThreads test (below). static void ThreadRoutine(SpawnThreadNotifications* notifications) { // Signals the main thread that this thread has started. notifications->spawn_thread_started.Notify(); // Waits for permission to finish from the main thread. notifications->spawn_thread_ok_to_terminate.WaitForNotification(); } // This is a death-test test, but it's not named with a DeathTest // suffix. It starts threads which might interfere with later // death tests, so it must run after all other death tests. class DeathTestAndMultiThreadsTest : public testing::Test { protected: // Starts a thread and waits for it to begin. virtual void SetUp() { thread_.reset(new ThreadWithParam( &ThreadRoutine, ¬ifications_, NULL)); notifications_.spawn_thread_started.WaitForNotification(); } // Tells the thread to finish, and reaps it. // Depending on the version of the thread library in use, // a manager thread might still be left running that will interfere // with later death tests. This is unfortunate, but this class // cleans up after itself as best it can. virtual void TearDown() { notifications_.spawn_thread_ok_to_terminate.Notify(); } private: SpawnThreadNotifications notifications_; scoped_ptr > thread_; }; #endif // GTEST_IS_THREADSAFE // The MixedUpTestCaseTest test case verifies that Google Test will fail a // test if it uses a different fixture class than what other tests in // the same test case use. It deliberately contains two fixture // classes with the same name but defined in different namespaces. // The MixedUpTestCaseWithSameTestNameTest test case verifies that // when the user defines two tests with the same test case name AND // same test name (but in different namespaces), the second test will // fail. namespace foo { class MixedUpTestCaseTest : public testing::Test { }; TEST_F(MixedUpTestCaseTest, FirstTestFromNamespaceFoo) {} TEST_F(MixedUpTestCaseTest, SecondTestFromNamespaceFoo) {} class MixedUpTestCaseWithSameTestNameTest : public testing::Test { }; TEST_F(MixedUpTestCaseWithSameTestNameTest, TheSecondTestWithThisNameShouldFail) {} } // namespace foo namespace bar { class MixedUpTestCaseTest : public testing::Test { }; // The following two tests are expected to fail. We rely on the // golden file to check that Google Test generates the right error message. TEST_F(MixedUpTestCaseTest, ThisShouldFail) {} TEST_F(MixedUpTestCaseTest, ThisShouldFailToo) {} class MixedUpTestCaseWithSameTestNameTest : public testing::Test { }; // Expected to fail. We rely on the golden file to check that Google Test // generates the right error message. TEST_F(MixedUpTestCaseWithSameTestNameTest, TheSecondTestWithThisNameShouldFail) {} } // namespace bar // The following two test cases verify that Google Test catches the user // error of mixing TEST and TEST_F in the same test case. The first // test case checks the scenario where TEST_F appears before TEST, and // the second one checks where TEST appears before TEST_F. class TEST_F_before_TEST_in_same_test_case : public testing::Test { }; TEST_F(TEST_F_before_TEST_in_same_test_case, DefinedUsingTEST_F) {} // Expected to fail. We rely on the golden file to check that Google Test // generates the right error message. TEST(TEST_F_before_TEST_in_same_test_case, DefinedUsingTESTAndShouldFail) {} class TEST_before_TEST_F_in_same_test_case : public testing::Test { }; TEST(TEST_before_TEST_F_in_same_test_case, DefinedUsingTEST) {} // Expected to fail. We rely on the golden file to check that Google Test // generates the right error message. TEST_F(TEST_before_TEST_F_in_same_test_case, DefinedUsingTEST_FAndShouldFail) { } // Used for testing EXPECT_NONFATAL_FAILURE() and EXPECT_FATAL_FAILURE(). int global_integer = 0; // Tests that EXPECT_NONFATAL_FAILURE() can reference global variables. TEST(ExpectNonfatalFailureTest, CanReferenceGlobalVariables) { global_integer = 0; EXPECT_NONFATAL_FAILURE({ EXPECT_EQ(1, global_integer) << "Expected non-fatal failure."; }, "Expected non-fatal failure."); } // Tests that EXPECT_NONFATAL_FAILURE() can reference local variables // (static or not). TEST(ExpectNonfatalFailureTest, CanReferenceLocalVariables) { int m = 0; static int n; n = 1; EXPECT_NONFATAL_FAILURE({ EXPECT_EQ(m, n) << "Expected non-fatal failure."; }, "Expected non-fatal failure."); } // Tests that EXPECT_NONFATAL_FAILURE() succeeds when there is exactly // one non-fatal failure and no fatal failure. TEST(ExpectNonfatalFailureTest, SucceedsWhenThereIsOneNonfatalFailure) { EXPECT_NONFATAL_FAILURE({ ADD_FAILURE() << "Expected non-fatal failure."; }, "Expected non-fatal failure."); } // Tests that EXPECT_NONFATAL_FAILURE() fails when there is no // non-fatal failure. TEST(ExpectNonfatalFailureTest, FailsWhenThereIsNoNonfatalFailure) { printf("(expecting a failure)\n"); EXPECT_NONFATAL_FAILURE({ }, ""); } // Tests that EXPECT_NONFATAL_FAILURE() fails when there are two // non-fatal failures. TEST(ExpectNonfatalFailureTest, FailsWhenThereAreTwoNonfatalFailures) { printf("(expecting a failure)\n"); EXPECT_NONFATAL_FAILURE({ ADD_FAILURE() << "Expected non-fatal failure 1."; ADD_FAILURE() << "Expected non-fatal failure 2."; }, ""); } // Tests that EXPECT_NONFATAL_FAILURE() fails when there is one fatal // failure. TEST(ExpectNonfatalFailureTest, FailsWhenThereIsOneFatalFailure) { printf("(expecting a failure)\n"); EXPECT_NONFATAL_FAILURE({ FAIL() << "Expected fatal failure."; }, ""); } // Tests that EXPECT_NONFATAL_FAILURE() fails when the statement being // tested returns. TEST(ExpectNonfatalFailureTest, FailsWhenStatementReturns) { printf("(expecting a failure)\n"); EXPECT_NONFATAL_FAILURE({ return; }, ""); } #if GTEST_HAS_EXCEPTIONS // Tests that EXPECT_NONFATAL_FAILURE() fails when the statement being // tested throws. TEST(ExpectNonfatalFailureTest, FailsWhenStatementThrows) { printf("(expecting a failure)\n"); try { EXPECT_NONFATAL_FAILURE({ throw 0; }, ""); } catch(int) { // NOLINT } } #endif // GTEST_HAS_EXCEPTIONS // Tests that EXPECT_FATAL_FAILURE() can reference global variables. TEST(ExpectFatalFailureTest, CanReferenceGlobalVariables) { global_integer = 0; EXPECT_FATAL_FAILURE({ ASSERT_EQ(1, global_integer) << "Expected fatal failure."; }, "Expected fatal failure."); } // Tests that EXPECT_FATAL_FAILURE() can reference local static // variables. TEST(ExpectFatalFailureTest, CanReferenceLocalStaticVariables) { static int n; n = 1; EXPECT_FATAL_FAILURE({ ASSERT_EQ(0, n) << "Expected fatal failure."; }, "Expected fatal failure."); } // Tests that EXPECT_FATAL_FAILURE() succeeds when there is exactly // one fatal failure and no non-fatal failure. TEST(ExpectFatalFailureTest, SucceedsWhenThereIsOneFatalFailure) { EXPECT_FATAL_FAILURE({ FAIL() << "Expected fatal failure."; }, "Expected fatal failure."); } // Tests that EXPECT_FATAL_FAILURE() fails when there is no fatal // failure. TEST(ExpectFatalFailureTest, FailsWhenThereIsNoFatalFailure) { printf("(expecting a failure)\n"); EXPECT_FATAL_FAILURE({ }, ""); } // A helper for generating a fatal failure. void FatalFailure() { FAIL() << "Expected fatal failure."; } // Tests that EXPECT_FATAL_FAILURE() fails when there are two // fatal failures. TEST(ExpectFatalFailureTest, FailsWhenThereAreTwoFatalFailures) { printf("(expecting a failure)\n"); EXPECT_FATAL_FAILURE({ FatalFailure(); FatalFailure(); }, ""); } // Tests that EXPECT_FATAL_FAILURE() fails when there is one non-fatal // failure. TEST(ExpectFatalFailureTest, FailsWhenThereIsOneNonfatalFailure) { printf("(expecting a failure)\n"); EXPECT_FATAL_FAILURE({ ADD_FAILURE() << "Expected non-fatal failure."; }, ""); } // Tests that EXPECT_FATAL_FAILURE() fails when the statement being // tested returns. TEST(ExpectFatalFailureTest, FailsWhenStatementReturns) { printf("(expecting a failure)\n"); EXPECT_FATAL_FAILURE({ return; }, ""); } #if GTEST_HAS_EXCEPTIONS // Tests that EXPECT_FATAL_FAILURE() fails when the statement being // tested throws. TEST(ExpectFatalFailureTest, FailsWhenStatementThrows) { printf("(expecting a failure)\n"); try { EXPECT_FATAL_FAILURE({ throw 0; }, ""); } catch(int) { // NOLINT } } #endif // GTEST_HAS_EXCEPTIONS // This #ifdef block tests the output of typed tests. #if GTEST_HAS_TYPED_TEST template class TypedTest : public testing::Test { }; TYPED_TEST_CASE(TypedTest, testing::Types); TYPED_TEST(TypedTest, Success) { EXPECT_EQ(0, TypeParam()); } TYPED_TEST(TypedTest, Failure) { EXPECT_EQ(1, TypeParam()) << "Expected failure"; } #endif // GTEST_HAS_TYPED_TEST // This #ifdef block tests the output of type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P template class TypedTestP : public testing::Test { }; TYPED_TEST_CASE_P(TypedTestP); TYPED_TEST_P(TypedTestP, Success) { EXPECT_EQ(0U, TypeParam()); } TYPED_TEST_P(TypedTestP, Failure) { EXPECT_EQ(1U, TypeParam()) << "Expected failure"; } REGISTER_TYPED_TEST_CASE_P(TypedTestP, Success, Failure); typedef testing::Types UnsignedTypes; INSTANTIATE_TYPED_TEST_CASE_P(Unsigned, TypedTestP, UnsignedTypes); #endif // GTEST_HAS_TYPED_TEST_P #if GTEST_HAS_DEATH_TEST // We rely on the golden file to verify that tests whose test case // name ends with DeathTest are run first. TEST(ADeathTest, ShouldRunFirst) { } # if GTEST_HAS_TYPED_TEST // We rely on the golden file to verify that typed tests whose test // case name ends with DeathTest are run first. template class ATypedDeathTest : public testing::Test { }; typedef testing::Types NumericTypes; TYPED_TEST_CASE(ATypedDeathTest, NumericTypes); TYPED_TEST(ATypedDeathTest, ShouldRunFirst) { } # endif // GTEST_HAS_TYPED_TEST # if GTEST_HAS_TYPED_TEST_P // We rely on the golden file to verify that type-parameterized tests // whose test case name ends with DeathTest are run first. template class ATypeParamDeathTest : public testing::Test { }; TYPED_TEST_CASE_P(ATypeParamDeathTest); TYPED_TEST_P(ATypeParamDeathTest, ShouldRunFirst) { } REGISTER_TYPED_TEST_CASE_P(ATypeParamDeathTest, ShouldRunFirst); INSTANTIATE_TYPED_TEST_CASE_P(My, ATypeParamDeathTest, NumericTypes); # endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_HAS_DEATH_TEST // Tests various failure conditions of // EXPECT_{,NON}FATAL_FAILURE{,_ON_ALL_THREADS}. class ExpectFailureTest : public testing::Test { public: // Must be public and not protected due to a bug in g++ 3.4.2. enum FailureMode { FATAL_FAILURE, NONFATAL_FAILURE }; static void AddFailure(FailureMode failure) { if (failure == FATAL_FAILURE) { FAIL() << "Expected fatal failure."; } else { ADD_FAILURE() << "Expected non-fatal failure."; } } }; TEST_F(ExpectFailureTest, ExpectFatalFailure) { // Expected fatal failure, but succeeds. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE(SUCCEED(), "Expected fatal failure."); // Expected fatal failure, but got a non-fatal failure. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE(AddFailure(NONFATAL_FAILURE), "Expected non-fatal " "failure."); // Wrong message. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE(AddFailure(FATAL_FAILURE), "Some other fatal failure " "expected."); } TEST_F(ExpectFailureTest, ExpectNonFatalFailure) { // Expected non-fatal failure, but succeeds. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE(SUCCEED(), "Expected non-fatal failure."); // Expected non-fatal failure, but got a fatal failure. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE(AddFailure(FATAL_FAILURE), "Expected fatal failure."); // Wrong message. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE(AddFailure(NONFATAL_FAILURE), "Some other non-fatal " "failure."); } #if GTEST_IS_THREADSAFE class ExpectFailureWithThreadsTest : public ExpectFailureTest { protected: static void AddFailureInOtherThread(FailureMode failure) { ThreadWithParam thread(&AddFailure, failure, NULL); thread.Join(); } }; TEST_F(ExpectFailureWithThreadsTest, ExpectFatalFailure) { // We only intercept the current thread. printf("(expecting 2 failures)\n"); EXPECT_FATAL_FAILURE(AddFailureInOtherThread(FATAL_FAILURE), "Expected fatal failure."); } TEST_F(ExpectFailureWithThreadsTest, ExpectNonFatalFailure) { // We only intercept the current thread. printf("(expecting 2 failures)\n"); EXPECT_NONFATAL_FAILURE(AddFailureInOtherThread(NONFATAL_FAILURE), "Expected non-fatal failure."); } typedef ExpectFailureWithThreadsTest ScopedFakeTestPartResultReporterTest; // Tests that the ScopedFakeTestPartResultReporter only catches failures from // the current thread if it is instantiated with INTERCEPT_ONLY_CURRENT_THREAD. TEST_F(ScopedFakeTestPartResultReporterTest, InterceptOnlyCurrentThread) { printf("(expecting 2 failures)\n"); TestPartResultArray results; { ScopedFakeTestPartResultReporter reporter( ScopedFakeTestPartResultReporter::INTERCEPT_ONLY_CURRENT_THREAD, &results); AddFailureInOtherThread(FATAL_FAILURE); AddFailureInOtherThread(NONFATAL_FAILURE); } // The two failures should not have been intercepted. EXPECT_EQ(0, results.size()) << "This shouldn't fail."; } #endif // GTEST_IS_THREADSAFE TEST_F(ExpectFailureTest, ExpectFatalFailureOnAllThreads) { // Expected fatal failure, but succeeds. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE_ON_ALL_THREADS(SUCCEED(), "Expected fatal failure."); // Expected fatal failure, but got a non-fatal failure. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE_ON_ALL_THREADS(AddFailure(NONFATAL_FAILURE), "Expected non-fatal failure."); // Wrong message. printf("(expecting 1 failure)\n"); EXPECT_FATAL_FAILURE_ON_ALL_THREADS(AddFailure(FATAL_FAILURE), "Some other fatal failure expected."); } TEST_F(ExpectFailureTest, ExpectNonFatalFailureOnAllThreads) { // Expected non-fatal failure, but succeeds. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(SUCCEED(), "Expected non-fatal " "failure."); // Expected non-fatal failure, but got a fatal failure. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(AddFailure(FATAL_FAILURE), "Expected fatal failure."); // Wrong message. printf("(expecting 1 failure)\n"); EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(AddFailure(NONFATAL_FAILURE), "Some other non-fatal failure."); } // Two test environments for testing testing::AddGlobalTestEnvironment(). class FooEnvironment : public testing::Environment { public: virtual void SetUp() { printf("%s", "FooEnvironment::SetUp() called.\n"); } virtual void TearDown() { printf("%s", "FooEnvironment::TearDown() called.\n"); FAIL() << "Expected fatal failure."; } }; class BarEnvironment : public testing::Environment { public: virtual void SetUp() { printf("%s", "BarEnvironment::SetUp() called.\n"); } virtual void TearDown() { printf("%s", "BarEnvironment::TearDown() called.\n"); ADD_FAILURE() << "Expected non-fatal failure."; } }; bool GTEST_FLAG(internal_skip_environment_and_ad_hoc_tests) = false; // The main function. // // The idea is to use Google Test to run all the tests we have defined (some // of them are intended to fail), and then compare the test results // with the "golden" file. int main(int argc, char **argv) { testing::GTEST_FLAG(print_time) = false; // We just run the tests, knowing some of them are intended to fail. // We will use a separate Python script to compare the output of // this program with the golden file. // It's hard to test InitGoogleTest() directly, as it has many // global side effects. The following line serves as a sanity test // for it. testing::InitGoogleTest(&argc, argv); if (argc >= 2 && String(argv[1]) == "--gtest_internal_skip_environment_and_ad_hoc_tests") GTEST_FLAG(internal_skip_environment_and_ad_hoc_tests) = true; #if GTEST_HAS_DEATH_TEST if (testing::internal::GTEST_FLAG(internal_run_death_test) != "") { // Skip the usual output capturing if we're running as the child // process of an threadsafe-style death test. # if GTEST_OS_WINDOWS posix::FReopen("nul:", "w", stdout); # else posix::FReopen("/dev/null", "w", stdout); # endif // GTEST_OS_WINDOWS return RUN_ALL_TESTS(); } #endif // GTEST_HAS_DEATH_TEST if (GTEST_FLAG(internal_skip_environment_and_ad_hoc_tests)) return RUN_ALL_TESTS(); // Registers two global test environments. // The golden file verifies that they are set up in the order they // are registered, and torn down in the reverse order. testing::AddGlobalTestEnvironment(new FooEnvironment); testing::AddGlobalTestEnvironment(new BarEnvironment); return RunAllTests(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_output_test_golden_lin.txt0000600000175000017500000006612411561126632027170 0ustar synergysynergyThe non-test part of the code is expected to have 2 failures. gtest_output_test_.cc:#: Failure Value of: false Actual: false Expected: true gtest_output_test_.cc:#: Failure Value of: 3 Expected: 2 [==========] Running 62 tests from 27 test cases. [----------] Global test environment set-up. FooEnvironment::SetUp() called. BarEnvironment::SetUp() called. [----------] 1 test from ADeathTest [ RUN ] ADeathTest.ShouldRunFirst [ OK ] ADeathTest.ShouldRunFirst [----------] 1 test from ATypedDeathTest/0, where TypeParam = int [ RUN ] ATypedDeathTest/0.ShouldRunFirst [ OK ] ATypedDeathTest/0.ShouldRunFirst [----------] 1 test from ATypedDeathTest/1, where TypeParam = double [ RUN ] ATypedDeathTest/1.ShouldRunFirst [ OK ] ATypedDeathTest/1.ShouldRunFirst [----------] 1 test from My/ATypeParamDeathTest/0, where TypeParam = int [ RUN ] My/ATypeParamDeathTest/0.ShouldRunFirst [ OK ] My/ATypeParamDeathTest/0.ShouldRunFirst [----------] 1 test from My/ATypeParamDeathTest/1, where TypeParam = double [ RUN ] My/ATypeParamDeathTest/1.ShouldRunFirst [ OK ] My/ATypeParamDeathTest/1.ShouldRunFirst [----------] 2 tests from PassingTest [ RUN ] PassingTest.PassingTest1 [ OK ] PassingTest.PassingTest1 [ RUN ] PassingTest.PassingTest2 [ OK ] PassingTest.PassingTest2 [----------] 3 tests from FatalFailureTest [ RUN ] FatalFailureTest.FatalFailureInSubroutine (expecting a failure that x should be 1) gtest_output_test_.cc:#: Failure Value of: x Actual: 2 Expected: 1 [ FAILED ] FatalFailureTest.FatalFailureInSubroutine [ RUN ] FatalFailureTest.FatalFailureInNestedSubroutine (expecting a failure that x should be 1) gtest_output_test_.cc:#: Failure Value of: x Actual: 2 Expected: 1 [ FAILED ] FatalFailureTest.FatalFailureInNestedSubroutine [ RUN ] FatalFailureTest.NonfatalFailureInSubroutine (expecting a failure on false) gtest_output_test_.cc:#: Failure Value of: false Actual: false Expected: true [ FAILED ] FatalFailureTest.NonfatalFailureInSubroutine [----------] 1 test from LoggingTest [ RUN ] LoggingTest.InterleavingLoggingAndAssertions (expecting 2 failures on (3) >= (a[i])) i == 0 i == 1 gtest_output_test_.cc:#: Failure Expected: (3) >= (a[i]), actual: 3 vs 9 i == 2 i == 3 gtest_output_test_.cc:#: Failure Expected: (3) >= (a[i]), actual: 3 vs 6 [ FAILED ] LoggingTest.InterleavingLoggingAndAssertions [----------] 6 tests from SCOPED_TRACETest [ RUN ] SCOPED_TRACETest.ObeysScopes (expected to fail) gtest_output_test_.cc:#: Failure Failed This failure is expected, and shouldn't have a trace. gtest_output_test_.cc:#: Failure Failed This failure is expected, and should have a trace. Google Test trace: gtest_output_test_.cc:#: Expected trace gtest_output_test_.cc:#: Failure Failed This failure is expected, and shouldn't have a trace. [ FAILED ] SCOPED_TRACETest.ObeysScopes [ RUN ] SCOPED_TRACETest.WorksInLoop (expected to fail) gtest_output_test_.cc:#: Failure Value of: n Actual: 1 Expected: 2 Google Test trace: gtest_output_test_.cc:#: i = 1 gtest_output_test_.cc:#: Failure Value of: n Actual: 2 Expected: 1 Google Test trace: gtest_output_test_.cc:#: i = 2 [ FAILED ] SCOPED_TRACETest.WorksInLoop [ RUN ] SCOPED_TRACETest.WorksInSubroutine (expected to fail) gtest_output_test_.cc:#: Failure Value of: n Actual: 1 Expected: 2 Google Test trace: gtest_output_test_.cc:#: n = 1 gtest_output_test_.cc:#: Failure Value of: n Actual: 2 Expected: 1 Google Test trace: gtest_output_test_.cc:#: n = 2 [ FAILED ] SCOPED_TRACETest.WorksInSubroutine [ RUN ] SCOPED_TRACETest.CanBeNested (expected to fail) gtest_output_test_.cc:#: Failure Value of: n Actual: 2 Expected: 1 Google Test trace: gtest_output_test_.cc:#: n = 2 gtest_output_test_.cc:#: [ FAILED ] SCOPED_TRACETest.CanBeNested [ RUN ] SCOPED_TRACETest.CanBeRepeated (expected to fail) gtest_output_test_.cc:#: Failure Failed This failure is expected, and should contain trace point A. Google Test trace: gtest_output_test_.cc:#: A gtest_output_test_.cc:#: Failure Failed This failure is expected, and should contain trace point A and B. Google Test trace: gtest_output_test_.cc:#: B gtest_output_test_.cc:#: A gtest_output_test_.cc:#: Failure Failed This failure is expected, and should contain trace point A, B, and C. Google Test trace: gtest_output_test_.cc:#: C gtest_output_test_.cc:#: B gtest_output_test_.cc:#: A gtest_output_test_.cc:#: Failure Failed This failure is expected, and should contain trace point A, B, and D. Google Test trace: gtest_output_test_.cc:#: D gtest_output_test_.cc:#: B gtest_output_test_.cc:#: A [ FAILED ] SCOPED_TRACETest.CanBeRepeated [ RUN ] SCOPED_TRACETest.WorksConcurrently (expecting 6 failures) gtest_output_test_.cc:#: Failure Failed Expected failure #1 (in thread B, only trace B alive). Google Test trace: gtest_output_test_.cc:#: Trace B gtest_output_test_.cc:#: Failure Failed Expected failure #2 (in thread A, trace A & B both alive). Google Test trace: gtest_output_test_.cc:#: Trace A gtest_output_test_.cc:#: Failure Failed Expected failure #3 (in thread B, trace A & B both alive). Google Test trace: gtest_output_test_.cc:#: Trace B gtest_output_test_.cc:#: Failure Failed Expected failure #4 (in thread B, only trace A alive). gtest_output_test_.cc:#: Failure Failed Expected failure #5 (in thread A, only trace A alive). Google Test trace: gtest_output_test_.cc:#: Trace A gtest_output_test_.cc:#: Failure Failed Expected failure #6 (in thread A, no trace alive). [ FAILED ] SCOPED_TRACETest.WorksConcurrently [----------] 1 test from NonFatalFailureInFixtureConstructorTest [ RUN ] NonFatalFailureInFixtureConstructorTest.FailureInConstructor (expecting 5 failures) gtest_output_test_.cc:#: Failure Failed Expected failure #1, in the test fixture c'tor. gtest_output_test_.cc:#: Failure Failed Expected failure #2, in SetUp(). gtest_output_test_.cc:#: Failure Failed Expected failure #3, in the test body. gtest_output_test_.cc:#: Failure Failed Expected failure #4, in TearDown. gtest_output_test_.cc:#: Failure Failed Expected failure #5, in the test fixture d'tor. [ FAILED ] NonFatalFailureInFixtureConstructorTest.FailureInConstructor [----------] 1 test from FatalFailureInFixtureConstructorTest [ RUN ] FatalFailureInFixtureConstructorTest.FailureInConstructor (expecting 2 failures) gtest_output_test_.cc:#: Failure Failed Expected failure #1, in the test fixture c'tor. gtest_output_test_.cc:#: Failure Failed Expected failure #2, in the test fixture d'tor. [ FAILED ] FatalFailureInFixtureConstructorTest.FailureInConstructor [----------] 1 test from NonFatalFailureInSetUpTest [ RUN ] NonFatalFailureInSetUpTest.FailureInSetUp (expecting 4 failures) gtest_output_test_.cc:#: Failure Failed Expected failure #1, in SetUp(). gtest_output_test_.cc:#: Failure Failed Expected failure #2, in the test function. gtest_output_test_.cc:#: Failure Failed Expected failure #3, in TearDown(). gtest_output_test_.cc:#: Failure Failed Expected failure #4, in the test fixture d'tor. [ FAILED ] NonFatalFailureInSetUpTest.FailureInSetUp [----------] 1 test from FatalFailureInSetUpTest [ RUN ] FatalFailureInSetUpTest.FailureInSetUp (expecting 3 failures) gtest_output_test_.cc:#: Failure Failed Expected failure #1, in SetUp(). gtest_output_test_.cc:#: Failure Failed Expected failure #2, in TearDown(). gtest_output_test_.cc:#: Failure Failed Expected failure #3, in the test fixture d'tor. [ FAILED ] FatalFailureInSetUpTest.FailureInSetUp [----------] 1 test from AddFailureAtTest [ RUN ] AddFailureAtTest.MessageContainsSpecifiedFileAndLineNumber foo.cc:42: Failure Failed Expected failure in foo.cc [ FAILED ] AddFailureAtTest.MessageContainsSpecifiedFileAndLineNumber [----------] 4 tests from MixedUpTestCaseTest [ RUN ] MixedUpTestCaseTest.FirstTestFromNamespaceFoo [ OK ] MixedUpTestCaseTest.FirstTestFromNamespaceFoo [ RUN ] MixedUpTestCaseTest.SecondTestFromNamespaceFoo [ OK ] MixedUpTestCaseTest.SecondTestFromNamespaceFoo [ RUN ] MixedUpTestCaseTest.ThisShouldFail gtest.cc:#: Failure Failed All tests in the same test case must use the same test fixture class. However, in test case MixedUpTestCaseTest, you defined test FirstTestFromNamespaceFoo and test ThisShouldFail using two different test fixture classes. This can happen if the two classes are from different namespaces or translation units and have the same name. You should probably rename one of the classes to put the tests into different test cases. [ FAILED ] MixedUpTestCaseTest.ThisShouldFail [ RUN ] MixedUpTestCaseTest.ThisShouldFailToo gtest.cc:#: Failure Failed All tests in the same test case must use the same test fixture class. However, in test case MixedUpTestCaseTest, you defined test FirstTestFromNamespaceFoo and test ThisShouldFailToo using two different test fixture classes. This can happen if the two classes are from different namespaces or translation units and have the same name. You should probably rename one of the classes to put the tests into different test cases. [ FAILED ] MixedUpTestCaseTest.ThisShouldFailToo [----------] 2 tests from MixedUpTestCaseWithSameTestNameTest [ RUN ] MixedUpTestCaseWithSameTestNameTest.TheSecondTestWithThisNameShouldFail [ OK ] MixedUpTestCaseWithSameTestNameTest.TheSecondTestWithThisNameShouldFail [ RUN ] MixedUpTestCaseWithSameTestNameTest.TheSecondTestWithThisNameShouldFail gtest.cc:#: Failure Failed All tests in the same test case must use the same test fixture class. However, in test case MixedUpTestCaseWithSameTestNameTest, you defined test TheSecondTestWithThisNameShouldFail and test TheSecondTestWithThisNameShouldFail using two different test fixture classes. This can happen if the two classes are from different namespaces or translation units and have the same name. You should probably rename one of the classes to put the tests into different test cases. [ FAILED ] MixedUpTestCaseWithSameTestNameTest.TheSecondTestWithThisNameShouldFail [----------] 2 tests from TEST_F_before_TEST_in_same_test_case [ RUN ] TEST_F_before_TEST_in_same_test_case.DefinedUsingTEST_F [ OK ] TEST_F_before_TEST_in_same_test_case.DefinedUsingTEST_F [ RUN ] TEST_F_before_TEST_in_same_test_case.DefinedUsingTESTAndShouldFail gtest.cc:#: Failure Failed All tests in the same test case must use the same test fixture class, so mixing TEST_F and TEST in the same test case is illegal. In test case TEST_F_before_TEST_in_same_test_case, test DefinedUsingTEST_F is defined using TEST_F but test DefinedUsingTESTAndShouldFail is defined using TEST. You probably want to change the TEST to TEST_F or move it to another test case. [ FAILED ] TEST_F_before_TEST_in_same_test_case.DefinedUsingTESTAndShouldFail [----------] 2 tests from TEST_before_TEST_F_in_same_test_case [ RUN ] TEST_before_TEST_F_in_same_test_case.DefinedUsingTEST [ OK ] TEST_before_TEST_F_in_same_test_case.DefinedUsingTEST [ RUN ] TEST_before_TEST_F_in_same_test_case.DefinedUsingTEST_FAndShouldFail gtest.cc:#: Failure Failed All tests in the same test case must use the same test fixture class, so mixing TEST_F and TEST in the same test case is illegal. In test case TEST_before_TEST_F_in_same_test_case, test DefinedUsingTEST_FAndShouldFail is defined using TEST_F but test DefinedUsingTEST is defined using TEST. You probably want to change the TEST to TEST_F or move it to another test case. [ FAILED ] TEST_before_TEST_F_in_same_test_case.DefinedUsingTEST_FAndShouldFail [----------] 8 tests from ExpectNonfatalFailureTest [ RUN ] ExpectNonfatalFailureTest.CanReferenceGlobalVariables [ OK ] ExpectNonfatalFailureTest.CanReferenceGlobalVariables [ RUN ] ExpectNonfatalFailureTest.CanReferenceLocalVariables [ OK ] ExpectNonfatalFailureTest.CanReferenceLocalVariables [ RUN ] ExpectNonfatalFailureTest.SucceedsWhenThereIsOneNonfatalFailure [ OK ] ExpectNonfatalFailureTest.SucceedsWhenThereIsOneNonfatalFailure [ RUN ] ExpectNonfatalFailureTest.FailsWhenThereIsNoNonfatalFailure (expecting a failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: 0 failures [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereIsNoNonfatalFailure [ RUN ] ExpectNonfatalFailureTest.FailsWhenThereAreTwoNonfatalFailures (expecting a failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: 2 failures gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure 1. gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure 2. [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereAreTwoNonfatalFailures [ RUN ] ExpectNonfatalFailureTest.FailsWhenThereIsOneFatalFailure (expecting a failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereIsOneFatalFailure [ RUN ] ExpectNonfatalFailureTest.FailsWhenStatementReturns (expecting a failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: 0 failures [ FAILED ] ExpectNonfatalFailureTest.FailsWhenStatementReturns [ RUN ] ExpectNonfatalFailureTest.FailsWhenStatementThrows (expecting a failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: 0 failures [ FAILED ] ExpectNonfatalFailureTest.FailsWhenStatementThrows [----------] 8 tests from ExpectFatalFailureTest [ RUN ] ExpectFatalFailureTest.CanReferenceGlobalVariables [ OK ] ExpectFatalFailureTest.CanReferenceGlobalVariables [ RUN ] ExpectFatalFailureTest.CanReferenceLocalStaticVariables [ OK ] ExpectFatalFailureTest.CanReferenceLocalStaticVariables [ RUN ] ExpectFatalFailureTest.SucceedsWhenThereIsOneFatalFailure [ OK ] ExpectFatalFailureTest.SucceedsWhenThereIsOneFatalFailure [ RUN ] ExpectFatalFailureTest.FailsWhenThereIsNoFatalFailure (expecting a failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: 0 failures [ FAILED ] ExpectFatalFailureTest.FailsWhenThereIsNoFatalFailure [ RUN ] ExpectFatalFailureTest.FailsWhenThereAreTwoFatalFailures (expecting a failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: 2 failures gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. [ FAILED ] ExpectFatalFailureTest.FailsWhenThereAreTwoFatalFailures [ RUN ] ExpectFatalFailureTest.FailsWhenThereIsOneNonfatalFailure (expecting a failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure. [ FAILED ] ExpectFatalFailureTest.FailsWhenThereIsOneNonfatalFailure [ RUN ] ExpectFatalFailureTest.FailsWhenStatementReturns (expecting a failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: 0 failures [ FAILED ] ExpectFatalFailureTest.FailsWhenStatementReturns [ RUN ] ExpectFatalFailureTest.FailsWhenStatementThrows (expecting a failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: 0 failures [ FAILED ] ExpectFatalFailureTest.FailsWhenStatementThrows [----------] 2 tests from TypedTest/0, where TypeParam = int [ RUN ] TypedTest/0.Success [ OK ] TypedTest/0.Success [ RUN ] TypedTest/0.Failure gtest_output_test_.cc:#: Failure Value of: TypeParam() Actual: 0 Expected: 1 Expected failure [ FAILED ] TypedTest/0.Failure, where TypeParam = int [----------] 2 tests from Unsigned/TypedTestP/0, where TypeParam = unsigned char [ RUN ] Unsigned/TypedTestP/0.Success [ OK ] Unsigned/TypedTestP/0.Success [ RUN ] Unsigned/TypedTestP/0.Failure gtest_output_test_.cc:#: Failure Value of: TypeParam() Actual: '\0' Expected: 1U Which is: 1 Expected failure [ FAILED ] Unsigned/TypedTestP/0.Failure, where TypeParam = unsigned char [----------] 2 tests from Unsigned/TypedTestP/1, where TypeParam = unsigned int [ RUN ] Unsigned/TypedTestP/1.Success [ OK ] Unsigned/TypedTestP/1.Success [ RUN ] Unsigned/TypedTestP/1.Failure gtest_output_test_.cc:#: Failure Value of: TypeParam() Actual: 0 Expected: 1U Which is: 1 Expected failure [ FAILED ] Unsigned/TypedTestP/1.Failure, where TypeParam = unsigned int [----------] 4 tests from ExpectFailureTest [ RUN ] ExpectFailureTest.ExpectFatalFailure (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: gtest_output_test_.cc:#: Success: Succeeded (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure. (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure containing "Some other fatal failure expected." Actual: gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. [ FAILED ] ExpectFailureTest.ExpectFatalFailure [ RUN ] ExpectFailureTest.ExpectNonFatalFailure (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: gtest_output_test_.cc:#: Success: Succeeded (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure containing "Some other non-fatal failure." Actual: gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure. [ FAILED ] ExpectFailureTest.ExpectNonFatalFailure [ RUN ] ExpectFailureTest.ExpectFatalFailureOnAllThreads (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: gtest_output_test_.cc:#: Success: Succeeded (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure Actual: gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure. (expecting 1 failure) gtest.cc:#: Failure Expected: 1 fatal failure containing "Some other fatal failure expected." Actual: gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. [ FAILED ] ExpectFailureTest.ExpectFatalFailureOnAllThreads [ RUN ] ExpectFailureTest.ExpectNonFatalFailureOnAllThreads (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: gtest_output_test_.cc:#: Success: Succeeded (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: gtest_output_test_.cc:#: Fatal failure: Failed Expected fatal failure. (expecting 1 failure) gtest.cc:#: Failure Expected: 1 non-fatal failure containing "Some other non-fatal failure." Actual: gtest_output_test_.cc:#: Non-fatal failure: Failed Expected non-fatal failure. [ FAILED ] ExpectFailureTest.ExpectNonFatalFailureOnAllThreads [----------] 2 tests from ExpectFailureWithThreadsTest [ RUN ] ExpectFailureWithThreadsTest.ExpectFatalFailure (expecting 2 failures) gtest_output_test_.cc:#: Failure Failed Expected fatal failure. gtest.cc:#: Failure Expected: 1 fatal failure Actual: 0 failures [ FAILED ] ExpectFailureWithThreadsTest.ExpectFatalFailure [ RUN ] ExpectFailureWithThreadsTest.ExpectNonFatalFailure (expecting 2 failures) gtest_output_test_.cc:#: Failure Failed Expected non-fatal failure. gtest.cc:#: Failure Expected: 1 non-fatal failure Actual: 0 failures [ FAILED ] ExpectFailureWithThreadsTest.ExpectNonFatalFailure [----------] 1 test from ScopedFakeTestPartResultReporterTest [ RUN ] ScopedFakeTestPartResultReporterTest.InterceptOnlyCurrentThread (expecting 2 failures) gtest_output_test_.cc:#: Failure Failed Expected fatal failure. gtest_output_test_.cc:#: Failure Failed Expected non-fatal failure. [ FAILED ] ScopedFakeTestPartResultReporterTest.InterceptOnlyCurrentThread [----------] 1 test from PrintingFailingParams/FailingParamTest [ RUN ] PrintingFailingParams/FailingParamTest.Fails/0 gtest_output_test_.cc:#: Failure Value of: GetParam() Actual: 2 Expected: 1 [ FAILED ] PrintingFailingParams/FailingParamTest.Fails/0, where GetParam() = 2 [----------] Global test environment tear-down BarEnvironment::TearDown() called. gtest_output_test_.cc:#: Failure Failed Expected non-fatal failure. FooEnvironment::TearDown() called. gtest_output_test_.cc:#: Failure Failed Expected fatal failure. [==========] 62 tests from 27 test cases ran. [ PASSED ] 21 tests. [ FAILED ] 41 tests, listed below: [ FAILED ] FatalFailureTest.FatalFailureInSubroutine [ FAILED ] FatalFailureTest.FatalFailureInNestedSubroutine [ FAILED ] FatalFailureTest.NonfatalFailureInSubroutine [ FAILED ] LoggingTest.InterleavingLoggingAndAssertions [ FAILED ] SCOPED_TRACETest.ObeysScopes [ FAILED ] SCOPED_TRACETest.WorksInLoop [ FAILED ] SCOPED_TRACETest.WorksInSubroutine [ FAILED ] SCOPED_TRACETest.CanBeNested [ FAILED ] SCOPED_TRACETest.CanBeRepeated [ FAILED ] SCOPED_TRACETest.WorksConcurrently [ FAILED ] NonFatalFailureInFixtureConstructorTest.FailureInConstructor [ FAILED ] FatalFailureInFixtureConstructorTest.FailureInConstructor [ FAILED ] NonFatalFailureInSetUpTest.FailureInSetUp [ FAILED ] FatalFailureInSetUpTest.FailureInSetUp [ FAILED ] AddFailureAtTest.MessageContainsSpecifiedFileAndLineNumber [ FAILED ] MixedUpTestCaseTest.ThisShouldFail [ FAILED ] MixedUpTestCaseTest.ThisShouldFailToo [ FAILED ] MixedUpTestCaseWithSameTestNameTest.TheSecondTestWithThisNameShouldFail [ FAILED ] TEST_F_before_TEST_in_same_test_case.DefinedUsingTESTAndShouldFail [ FAILED ] TEST_before_TEST_F_in_same_test_case.DefinedUsingTEST_FAndShouldFail [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereIsNoNonfatalFailure [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereAreTwoNonfatalFailures [ FAILED ] ExpectNonfatalFailureTest.FailsWhenThereIsOneFatalFailure [ FAILED ] ExpectNonfatalFailureTest.FailsWhenStatementReturns [ FAILED ] ExpectNonfatalFailureTest.FailsWhenStatementThrows [ FAILED ] ExpectFatalFailureTest.FailsWhenThereIsNoFatalFailure [ FAILED ] ExpectFatalFailureTest.FailsWhenThereAreTwoFatalFailures [ FAILED ] ExpectFatalFailureTest.FailsWhenThereIsOneNonfatalFailure [ FAILED ] ExpectFatalFailureTest.FailsWhenStatementReturns [ FAILED ] ExpectFatalFailureTest.FailsWhenStatementThrows [ FAILED ] TypedTest/0.Failure, where TypeParam = int [ FAILED ] Unsigned/TypedTestP/0.Failure, where TypeParam = unsigned char [ FAILED ] Unsigned/TypedTestP/1.Failure, where TypeParam = unsigned int [ FAILED ] ExpectFailureTest.ExpectFatalFailure [ FAILED ] ExpectFailureTest.ExpectNonFatalFailure [ FAILED ] ExpectFailureTest.ExpectFatalFailureOnAllThreads [ FAILED ] ExpectFailureTest.ExpectNonFatalFailureOnAllThreads [ FAILED ] ExpectFailureWithThreadsTest.ExpectFatalFailure [ FAILED ] ExpectFailureWithThreadsTest.ExpectNonFatalFailure [ FAILED ] ScopedFakeTestPartResultReporterTest.InterceptOnlyCurrentThread [ FAILED ] PrintingFailingParams/FailingParamTest.Fails/0, where GetParam() = 2 41 FAILED TESTS  YOU HAVE 1 DISABLED TEST Note: Google Test filter = FatalFailureTest.*:LoggingTest.* [==========] Running 4 tests from 2 test cases. [----------] Global test environment set-up. [----------] 3 tests from FatalFailureTest [ RUN ] FatalFailureTest.FatalFailureInSubroutine (expecting a failure that x should be 1) gtest_output_test_.cc:#: Failure Value of: x Actual: 2 Expected: 1 [ FAILED ] FatalFailureTest.FatalFailureInSubroutine (? ms) [ RUN ] FatalFailureTest.FatalFailureInNestedSubroutine (expecting a failure that x should be 1) gtest_output_test_.cc:#: Failure Value of: x Actual: 2 Expected: 1 [ FAILED ] FatalFailureTest.FatalFailureInNestedSubroutine (? ms) [ RUN ] FatalFailureTest.NonfatalFailureInSubroutine (expecting a failure on false) gtest_output_test_.cc:#: Failure Value of: false Actual: false Expected: true [ FAILED ] FatalFailureTest.NonfatalFailureInSubroutine (? ms) [----------] 3 tests from FatalFailureTest (? ms total) [----------] 1 test from LoggingTest [ RUN ] LoggingTest.InterleavingLoggingAndAssertions (expecting 2 failures on (3) >= (a[i])) i == 0 i == 1 gtest_output_test_.cc:#: Failure Expected: (3) >= (a[i]), actual: 3 vs 9 i == 2 i == 3 gtest_output_test_.cc:#: Failure Expected: (3) >= (a[i]), actual: 3 vs 6 [ FAILED ] LoggingTest.InterleavingLoggingAndAssertions (? ms) [----------] 1 test from LoggingTest (? ms total) [----------] Global test environment tear-down [==========] 4 tests from 2 test cases ran. (? ms total) [ PASSED ] 0 tests. [ FAILED ] 4 tests, listed below: [ FAILED ] FatalFailureTest.FatalFailureInSubroutine [ FAILED ] FatalFailureTest.FatalFailureInNestedSubroutine [ FAILED ] FatalFailureTest.NonfatalFailureInSubroutine [ FAILED ] LoggingTest.InterleavingLoggingAndAssertions 4 FAILED TESTS YOU HAVE 1 DISABLED TEST Note: Google Test filter = *DISABLED_* [==========] Running 1 test from 1 test case. [----------] Global test environment set-up. [----------] 1 test from DisabledTestsWarningTest [ RUN ] DisabledTestsWarningTest.DISABLED_AlsoRunDisabledTestsFlagSuppressesWarning [ OK ] DisabledTestsWarningTest.DISABLED_AlsoRunDisabledTestsFlagSuppressesWarning [----------] Global test environment tear-down [==========] 1 test from 1 test case ran. [ PASSED ] 1 test. Note: Google Test filter = PassingTest.* Note: This is test shard 2 of 2. [==========] Running 1 test from 1 test case. [----------] Global test environment set-up. [----------] 1 test from PassingTest [ RUN ] PassingTest.PassingTest2 [ OK ] PassingTest.PassingTest2 [----------] Global test environment tear-down [==========] 1 test from 1 test case ran. [ PASSED ] 1 test. YOU HAVE 1 DISABLED TEST synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_pred_impl_unittest.cc0000600000175000017500000022710211561126632026052 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // This file is AUTOMATICALLY GENERATED on 09/24/2010 by command // 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! // Regression test for gtest_pred_impl.h // // This file is generated by a script and quite long. If you intend to // learn how Google Test works by reading its unit tests, read // gtest_unittest.cc instead. // // This is intended as a regression test for the Google Test predicate // assertions. We compile it as part of the gtest_unittest target // only to keep the implementation tidy and compact, as it is quite // involved to set up the stage for testing Google Test using Google // Test itself. // // Currently, gtest_unittest takes ~11 seconds to run in the testing // daemon. In the future, if it grows too large and needs much more // time to finish, we should consider separating this file into a // stand-alone regression test. #include #include "gtest/gtest.h" #include "gtest/gtest-spi.h" // A user-defined data type. struct Bool { explicit Bool(int val) : value(val != 0) {} bool operator>(int n) const { return value > Bool(n).value; } Bool operator+(const Bool& rhs) const { return Bool(value + rhs.value); } bool operator==(const Bool& rhs) const { return value == rhs.value; } bool value; }; // Enables Bool to be used in assertions. std::ostream& operator<<(std::ostream& os, const Bool& x) { return os << (x.value ? "true" : "false"); } // Sample functions/functors for testing unary predicate assertions. // A unary predicate function. template bool PredFunction1(T1 v1) { return v1 > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction1Int(int v1) { return v1 > 0; } bool PredFunction1Bool(Bool v1) { return v1 > 0; } // A unary predicate functor. struct PredFunctor1 { template bool operator()(const T1& v1) { return v1 > 0; } }; // A unary predicate-formatter function. template testing::AssertionResult PredFormatFunction1(const char* e1, const T1& v1) { if (PredFunction1(v1)) return testing::AssertionSuccess(); return testing::AssertionFailure() << e1 << " is expected to be positive, but evaluates to " << v1 << "."; } // A unary predicate-formatter functor. struct PredFormatFunctor1 { template testing::AssertionResult operator()(const char* e1, const T1& v1) const { return PredFormatFunction1(e1, v1); } }; // Tests for {EXPECT|ASSERT}_PRED_FORMAT1. class Predicate1Test : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false; n1_ = 0; } virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once. EXPECT_EQ(1, n1_) << "The predicate assertion didn't evaluate argument 2 " "exactly once."; // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; static int n1_; }; bool Predicate1Test::expected_to_finish_; bool Predicate1Test::finished_; int Predicate1Test::n1_; typedef Predicate1Test EXPECT_PRED_FORMAT1Test; typedef Predicate1Test ASSERT_PRED_FORMAT1Test; typedef Predicate1Test EXPECT_PRED1Test; typedef Predicate1Test ASSERT_PRED1Test; // Tests a successful EXPECT_PRED1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED1Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED1(PredFunction1Int, ++n1_); finished_ = true; } // Tests a successful EXPECT_PRED1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED1Test, FunctionOnUserTypeSuccess) { EXPECT_PRED1(PredFunction1Bool, Bool(++n1_)); finished_ = true; } // Tests a successful EXPECT_PRED1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED1Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED1(PredFunctor1(), ++n1_); finished_ = true; } // Tests a successful EXPECT_PRED1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED1Test, FunctorOnUserTypeSuccess) { EXPECT_PRED1(PredFunctor1(), Bool(++n1_)); finished_ = true; } // Tests a failed EXPECT_PRED1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED1Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED1(PredFunction1Int, n1_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED1Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED1(PredFunction1Bool, Bool(n1_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED1Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED1(PredFunctor1(), n1_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED1Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED1(PredFunctor1(), Bool(n1_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED1Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED1(PredFunction1Int, ++n1_); finished_ = true; } // Tests a successful ASSERT_PRED1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED1Test, FunctionOnUserTypeSuccess) { ASSERT_PRED1(PredFunction1Bool, Bool(++n1_)); finished_ = true; } // Tests a successful ASSERT_PRED1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED1Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED1(PredFunctor1(), ++n1_); finished_ = true; } // Tests a successful ASSERT_PRED1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED1Test, FunctorOnUserTypeSuccess) { ASSERT_PRED1(PredFunctor1(), Bool(++n1_)); finished_ = true; } // Tests a failed ASSERT_PRED1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED1Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED1(PredFunction1Int, n1_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED1Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED1(PredFunction1Bool, Bool(n1_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED1Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED1(PredFunctor1(), n1_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED1Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED1(PredFunctor1(), Bool(n1_++)); finished_ = true; }, ""); } // Tests a successful EXPECT_PRED_FORMAT1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT1Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT1(PredFormatFunction1, ++n1_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT1Test, FunctionOnUserTypeSuccess) { EXPECT_PRED_FORMAT1(PredFormatFunction1, Bool(++n1_)); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT1Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT1(PredFormatFunctor1(), ++n1_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT1Test, FunctorOnUserTypeSuccess) { EXPECT_PRED_FORMAT1(PredFormatFunctor1(), Bool(++n1_)); finished_ = true; } // Tests a failed EXPECT_PRED_FORMAT1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT1Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT1(PredFormatFunction1, n1_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT1Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT1(PredFormatFunction1, Bool(n1_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT1Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT1(PredFormatFunctor1(), n1_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT1Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT1(PredFormatFunctor1(), Bool(n1_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED_FORMAT1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT1Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT1(PredFormatFunction1, ++n1_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT1Test, FunctionOnUserTypeSuccess) { ASSERT_PRED_FORMAT1(PredFormatFunction1, Bool(++n1_)); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT1Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT1(PredFormatFunctor1(), ++n1_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT1Test, FunctorOnUserTypeSuccess) { ASSERT_PRED_FORMAT1(PredFormatFunctor1(), Bool(++n1_)); finished_ = true; } // Tests a failed ASSERT_PRED_FORMAT1 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT1Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(PredFormatFunction1, n1_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT1 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT1Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(PredFormatFunction1, Bool(n1_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT1 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT1Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(PredFormatFunctor1(), n1_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT1 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT1Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(PredFormatFunctor1(), Bool(n1_++)); finished_ = true; }, ""); } // Sample functions/functors for testing binary predicate assertions. // A binary predicate function. template bool PredFunction2(T1 v1, T2 v2) { return v1 + v2 > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction2Int(int v1, int v2) { return v1 + v2 > 0; } bool PredFunction2Bool(Bool v1, Bool v2) { return v1 + v2 > 0; } // A binary predicate functor. struct PredFunctor2 { template bool operator()(const T1& v1, const T2& v2) { return v1 + v2 > 0; } }; // A binary predicate-formatter function. template testing::AssertionResult PredFormatFunction2(const char* e1, const char* e2, const T1& v1, const T2& v2) { if (PredFunction2(v1, v2)) return testing::AssertionSuccess(); return testing::AssertionFailure() << e1 << " + " << e2 << " is expected to be positive, but evaluates to " << v1 + v2 << "."; } // A binary predicate-formatter functor. struct PredFormatFunctor2 { template testing::AssertionResult operator()(const char* e1, const char* e2, const T1& v1, const T2& v2) const { return PredFormatFunction2(e1, e2, v1, v2); } }; // Tests for {EXPECT|ASSERT}_PRED_FORMAT2. class Predicate2Test : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false; n1_ = n2_ = 0; } virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once. EXPECT_EQ(1, n1_) << "The predicate assertion didn't evaluate argument 2 " "exactly once."; EXPECT_EQ(1, n2_) << "The predicate assertion didn't evaluate argument 3 " "exactly once."; // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; static int n1_; static int n2_; }; bool Predicate2Test::expected_to_finish_; bool Predicate2Test::finished_; int Predicate2Test::n1_; int Predicate2Test::n2_; typedef Predicate2Test EXPECT_PRED_FORMAT2Test; typedef Predicate2Test ASSERT_PRED_FORMAT2Test; typedef Predicate2Test EXPECT_PRED2Test; typedef Predicate2Test ASSERT_PRED2Test; // Tests a successful EXPECT_PRED2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED2Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED2(PredFunction2Int, ++n1_, ++n2_); finished_ = true; } // Tests a successful EXPECT_PRED2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED2Test, FunctionOnUserTypeSuccess) { EXPECT_PRED2(PredFunction2Bool, Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a successful EXPECT_PRED2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED2Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED2(PredFunctor2(), ++n1_, ++n2_); finished_ = true; } // Tests a successful EXPECT_PRED2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED2Test, FunctorOnUserTypeSuccess) { EXPECT_PRED2(PredFunctor2(), Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a failed EXPECT_PRED2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED2Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED2(PredFunction2Int, n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED2Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED2(PredFunction2Bool, Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED2Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED2(PredFunctor2(), n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED2Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED2(PredFunctor2(), Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED2Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED2(PredFunction2Int, ++n1_, ++n2_); finished_ = true; } // Tests a successful ASSERT_PRED2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED2Test, FunctionOnUserTypeSuccess) { ASSERT_PRED2(PredFunction2Bool, Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a successful ASSERT_PRED2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED2Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED2(PredFunctor2(), ++n1_, ++n2_); finished_ = true; } // Tests a successful ASSERT_PRED2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED2Test, FunctorOnUserTypeSuccess) { ASSERT_PRED2(PredFunctor2(), Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a failed ASSERT_PRED2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED2Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED2(PredFunction2Int, n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED2Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED2(PredFunction2Bool, Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED2Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED2(PredFunctor2(), n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED2Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED2(PredFunctor2(), Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a successful EXPECT_PRED_FORMAT2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT2Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT2(PredFormatFunction2, ++n1_, ++n2_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT2Test, FunctionOnUserTypeSuccess) { EXPECT_PRED_FORMAT2(PredFormatFunction2, Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT2Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT2(PredFormatFunctor2(), ++n1_, ++n2_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT2Test, FunctorOnUserTypeSuccess) { EXPECT_PRED_FORMAT2(PredFormatFunctor2(), Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a failed EXPECT_PRED_FORMAT2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT2Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(PredFormatFunction2, n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT2Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(PredFormatFunction2, Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT2Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(PredFormatFunctor2(), n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT2Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(PredFormatFunctor2(), Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED_FORMAT2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT2Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT2(PredFormatFunction2, ++n1_, ++n2_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT2Test, FunctionOnUserTypeSuccess) { ASSERT_PRED_FORMAT2(PredFormatFunction2, Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT2Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT2(PredFormatFunctor2(), ++n1_, ++n2_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT2Test, FunctorOnUserTypeSuccess) { ASSERT_PRED_FORMAT2(PredFormatFunctor2(), Bool(++n1_), Bool(++n2_)); finished_ = true; } // Tests a failed ASSERT_PRED_FORMAT2 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT2Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(PredFormatFunction2, n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT2 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT2Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(PredFormatFunction2, Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT2 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT2Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(PredFormatFunctor2(), n1_++, n2_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT2 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT2Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(PredFormatFunctor2(), Bool(n1_++), Bool(n2_++)); finished_ = true; }, ""); } // Sample functions/functors for testing ternary predicate assertions. // A ternary predicate function. template bool PredFunction3(T1 v1, T2 v2, T3 v3) { return v1 + v2 + v3 > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction3Int(int v1, int v2, int v3) { return v1 + v2 + v3 > 0; } bool PredFunction3Bool(Bool v1, Bool v2, Bool v3) { return v1 + v2 + v3 > 0; } // A ternary predicate functor. struct PredFunctor3 { template bool operator()(const T1& v1, const T2& v2, const T3& v3) { return v1 + v2 + v3 > 0; } }; // A ternary predicate-formatter function. template testing::AssertionResult PredFormatFunction3(const char* e1, const char* e2, const char* e3, const T1& v1, const T2& v2, const T3& v3) { if (PredFunction3(v1, v2, v3)) return testing::AssertionSuccess(); return testing::AssertionFailure() << e1 << " + " << e2 << " + " << e3 << " is expected to be positive, but evaluates to " << v1 + v2 + v3 << "."; } // A ternary predicate-formatter functor. struct PredFormatFunctor3 { template testing::AssertionResult operator()(const char* e1, const char* e2, const char* e3, const T1& v1, const T2& v2, const T3& v3) const { return PredFormatFunction3(e1, e2, e3, v1, v2, v3); } }; // Tests for {EXPECT|ASSERT}_PRED_FORMAT3. class Predicate3Test : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false; n1_ = n2_ = n3_ = 0; } virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once. EXPECT_EQ(1, n1_) << "The predicate assertion didn't evaluate argument 2 " "exactly once."; EXPECT_EQ(1, n2_) << "The predicate assertion didn't evaluate argument 3 " "exactly once."; EXPECT_EQ(1, n3_) << "The predicate assertion didn't evaluate argument 4 " "exactly once."; // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; static int n1_; static int n2_; static int n3_; }; bool Predicate3Test::expected_to_finish_; bool Predicate3Test::finished_; int Predicate3Test::n1_; int Predicate3Test::n2_; int Predicate3Test::n3_; typedef Predicate3Test EXPECT_PRED_FORMAT3Test; typedef Predicate3Test ASSERT_PRED_FORMAT3Test; typedef Predicate3Test EXPECT_PRED3Test; typedef Predicate3Test ASSERT_PRED3Test; // Tests a successful EXPECT_PRED3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED3Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED3(PredFunction3Int, ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful EXPECT_PRED3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED3Test, FunctionOnUserTypeSuccess) { EXPECT_PRED3(PredFunction3Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a successful EXPECT_PRED3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED3Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED3(PredFunctor3(), ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful EXPECT_PRED3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED3Test, FunctorOnUserTypeSuccess) { EXPECT_PRED3(PredFunctor3(), Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a failed EXPECT_PRED3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED3Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED3(PredFunction3Int, n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED3Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED3(PredFunction3Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED3Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED3(PredFunctor3(), n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED3Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED3(PredFunctor3(), Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED3Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED3(PredFunction3Int, ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful ASSERT_PRED3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED3Test, FunctionOnUserTypeSuccess) { ASSERT_PRED3(PredFunction3Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a successful ASSERT_PRED3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED3Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED3(PredFunctor3(), ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful ASSERT_PRED3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED3Test, FunctorOnUserTypeSuccess) { ASSERT_PRED3(PredFunctor3(), Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a failed ASSERT_PRED3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED3Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED3(PredFunction3Int, n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED3Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED3(PredFunction3Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED3Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED3(PredFunctor3(), n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED3Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED3(PredFunctor3(), Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a successful EXPECT_PRED_FORMAT3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT3Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT3(PredFormatFunction3, ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT3Test, FunctionOnUserTypeSuccess) { EXPECT_PRED_FORMAT3(PredFormatFunction3, Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT3Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT3(PredFormatFunctor3(), ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT3Test, FunctorOnUserTypeSuccess) { EXPECT_PRED_FORMAT3(PredFormatFunctor3(), Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a failed EXPECT_PRED_FORMAT3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT3Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT3(PredFormatFunction3, n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT3Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT3(PredFormatFunction3, Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT3Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT3(PredFormatFunctor3(), n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT3Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT3(PredFormatFunctor3(), Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED_FORMAT3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT3Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT3(PredFormatFunction3, ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT3Test, FunctionOnUserTypeSuccess) { ASSERT_PRED_FORMAT3(PredFormatFunction3, Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT3Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT3(PredFormatFunctor3(), ++n1_, ++n2_, ++n3_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT3Test, FunctorOnUserTypeSuccess) { ASSERT_PRED_FORMAT3(PredFormatFunctor3(), Bool(++n1_), Bool(++n2_), Bool(++n3_)); finished_ = true; } // Tests a failed ASSERT_PRED_FORMAT3 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT3Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT3(PredFormatFunction3, n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT3 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT3Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT3(PredFormatFunction3, Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT3 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT3Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT3(PredFormatFunctor3(), n1_++, n2_++, n3_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT3 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT3Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT3(PredFormatFunctor3(), Bool(n1_++), Bool(n2_++), Bool(n3_++)); finished_ = true; }, ""); } // Sample functions/functors for testing 4-ary predicate assertions. // A 4-ary predicate function. template bool PredFunction4(T1 v1, T2 v2, T3 v3, T4 v4) { return v1 + v2 + v3 + v4 > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction4Int(int v1, int v2, int v3, int v4) { return v1 + v2 + v3 + v4 > 0; } bool PredFunction4Bool(Bool v1, Bool v2, Bool v3, Bool v4) { return v1 + v2 + v3 + v4 > 0; } // A 4-ary predicate functor. struct PredFunctor4 { template bool operator()(const T1& v1, const T2& v2, const T3& v3, const T4& v4) { return v1 + v2 + v3 + v4 > 0; } }; // A 4-ary predicate-formatter function. template testing::AssertionResult PredFormatFunction4(const char* e1, const char* e2, const char* e3, const char* e4, const T1& v1, const T2& v2, const T3& v3, const T4& v4) { if (PredFunction4(v1, v2, v3, v4)) return testing::AssertionSuccess(); return testing::AssertionFailure() << e1 << " + " << e2 << " + " << e3 << " + " << e4 << " is expected to be positive, but evaluates to " << v1 + v2 + v3 + v4 << "."; } // A 4-ary predicate-formatter functor. struct PredFormatFunctor4 { template testing::AssertionResult operator()(const char* e1, const char* e2, const char* e3, const char* e4, const T1& v1, const T2& v2, const T3& v3, const T4& v4) const { return PredFormatFunction4(e1, e2, e3, e4, v1, v2, v3, v4); } }; // Tests for {EXPECT|ASSERT}_PRED_FORMAT4. class Predicate4Test : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false; n1_ = n2_ = n3_ = n4_ = 0; } virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once. EXPECT_EQ(1, n1_) << "The predicate assertion didn't evaluate argument 2 " "exactly once."; EXPECT_EQ(1, n2_) << "The predicate assertion didn't evaluate argument 3 " "exactly once."; EXPECT_EQ(1, n3_) << "The predicate assertion didn't evaluate argument 4 " "exactly once."; EXPECT_EQ(1, n4_) << "The predicate assertion didn't evaluate argument 5 " "exactly once."; // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; static int n1_; static int n2_; static int n3_; static int n4_; }; bool Predicate4Test::expected_to_finish_; bool Predicate4Test::finished_; int Predicate4Test::n1_; int Predicate4Test::n2_; int Predicate4Test::n3_; int Predicate4Test::n4_; typedef Predicate4Test EXPECT_PRED_FORMAT4Test; typedef Predicate4Test ASSERT_PRED_FORMAT4Test; typedef Predicate4Test EXPECT_PRED4Test; typedef Predicate4Test ASSERT_PRED4Test; // Tests a successful EXPECT_PRED4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED4Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED4(PredFunction4Int, ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful EXPECT_PRED4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED4Test, FunctionOnUserTypeSuccess) { EXPECT_PRED4(PredFunction4Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a successful EXPECT_PRED4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED4Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED4(PredFunctor4(), ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful EXPECT_PRED4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED4Test, FunctorOnUserTypeSuccess) { EXPECT_PRED4(PredFunctor4(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a failed EXPECT_PRED4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED4Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED4(PredFunction4Int, n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED4Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED4(PredFunction4Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED4Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED4(PredFunctor4(), n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED4Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED4(PredFunctor4(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED4Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED4(PredFunction4Int, ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful ASSERT_PRED4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED4Test, FunctionOnUserTypeSuccess) { ASSERT_PRED4(PredFunction4Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a successful ASSERT_PRED4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED4Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED4(PredFunctor4(), ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful ASSERT_PRED4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED4Test, FunctorOnUserTypeSuccess) { ASSERT_PRED4(PredFunctor4(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a failed ASSERT_PRED4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED4Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED4(PredFunction4Int, n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED4Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED4(PredFunction4Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED4Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED4(PredFunctor4(), n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED4Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED4(PredFunctor4(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a successful EXPECT_PRED_FORMAT4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT4Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT4(PredFormatFunction4, ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT4Test, FunctionOnUserTypeSuccess) { EXPECT_PRED_FORMAT4(PredFormatFunction4, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT4Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT4(PredFormatFunctor4(), ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT4Test, FunctorOnUserTypeSuccess) { EXPECT_PRED_FORMAT4(PredFormatFunctor4(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a failed EXPECT_PRED_FORMAT4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT4Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(PredFormatFunction4, n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT4Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(PredFormatFunction4, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT4Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(PredFormatFunctor4(), n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT4Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(PredFormatFunctor4(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED_FORMAT4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT4Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT4(PredFormatFunction4, ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT4Test, FunctionOnUserTypeSuccess) { ASSERT_PRED_FORMAT4(PredFormatFunction4, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT4Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT4(PredFormatFunctor4(), ++n1_, ++n2_, ++n3_, ++n4_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT4Test, FunctorOnUserTypeSuccess) { ASSERT_PRED_FORMAT4(PredFormatFunctor4(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_)); finished_ = true; } // Tests a failed ASSERT_PRED_FORMAT4 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT4Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT4(PredFormatFunction4, n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT4 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT4Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT4(PredFormatFunction4, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT4 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT4Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT4(PredFormatFunctor4(), n1_++, n2_++, n3_++, n4_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT4 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT4Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT4(PredFormatFunctor4(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++)); finished_ = true; }, ""); } // Sample functions/functors for testing 5-ary predicate assertions. // A 5-ary predicate function. template bool PredFunction5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) { return v1 + v2 + v3 + v4 + v5 > 0; } // The following two functions are needed to circumvent a bug in // gcc 2.95.3, which sometimes has problem with the above template // function. bool PredFunction5Int(int v1, int v2, int v3, int v4, int v5) { return v1 + v2 + v3 + v4 + v5 > 0; } bool PredFunction5Bool(Bool v1, Bool v2, Bool v3, Bool v4, Bool v5) { return v1 + v2 + v3 + v4 + v5 > 0; } // A 5-ary predicate functor. struct PredFunctor5 { template bool operator()(const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { return v1 + v2 + v3 + v4 + v5 > 0; } }; // A 5-ary predicate-formatter function. template testing::AssertionResult PredFormatFunction5(const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { if (PredFunction5(v1, v2, v3, v4, v5)) return testing::AssertionSuccess(); return testing::AssertionFailure() << e1 << " + " << e2 << " + " << e3 << " + " << e4 << " + " << e5 << " is expected to be positive, but evaluates to " << v1 + v2 + v3 + v4 + v5 << "."; } // A 5-ary predicate-formatter functor. struct PredFormatFunctor5 { template testing::AssertionResult operator()(const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) const { return PredFormatFunction5(e1, e2, e3, e4, e5, v1, v2, v3, v4, v5); } }; // Tests for {EXPECT|ASSERT}_PRED_FORMAT5. class Predicate5Test : public testing::Test { protected: virtual void SetUp() { expected_to_finish_ = true; finished_ = false; n1_ = n2_ = n3_ = n4_ = n5_ = 0; } virtual void TearDown() { // Verifies that each of the predicate's arguments was evaluated // exactly once. EXPECT_EQ(1, n1_) << "The predicate assertion didn't evaluate argument 2 " "exactly once."; EXPECT_EQ(1, n2_) << "The predicate assertion didn't evaluate argument 3 " "exactly once."; EXPECT_EQ(1, n3_) << "The predicate assertion didn't evaluate argument 4 " "exactly once."; EXPECT_EQ(1, n4_) << "The predicate assertion didn't evaluate argument 5 " "exactly once."; EXPECT_EQ(1, n5_) << "The predicate assertion didn't evaluate argument 6 " "exactly once."; // Verifies that the control flow in the test function is expected. if (expected_to_finish_ && !finished_) { FAIL() << "The predicate assertion unexpactedly aborted the test."; } else if (!expected_to_finish_ && finished_) { FAIL() << "The failed predicate assertion didn't abort the test " "as expected."; } } // true iff the test function is expected to run to finish. static bool expected_to_finish_; // true iff the test function did run to finish. static bool finished_; static int n1_; static int n2_; static int n3_; static int n4_; static int n5_; }; bool Predicate5Test::expected_to_finish_; bool Predicate5Test::finished_; int Predicate5Test::n1_; int Predicate5Test::n2_; int Predicate5Test::n3_; int Predicate5Test::n4_; int Predicate5Test::n5_; typedef Predicate5Test EXPECT_PRED_FORMAT5Test; typedef Predicate5Test ASSERT_PRED_FORMAT5Test; typedef Predicate5Test EXPECT_PRED5Test; typedef Predicate5Test ASSERT_PRED5Test; // Tests a successful EXPECT_PRED5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED5Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED5(PredFunction5Int, ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful EXPECT_PRED5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED5Test, FunctionOnUserTypeSuccess) { EXPECT_PRED5(PredFunction5Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a successful EXPECT_PRED5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED5Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED5(PredFunctor5(), ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful EXPECT_PRED5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED5Test, FunctorOnUserTypeSuccess) { EXPECT_PRED5(PredFunctor5(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a failed EXPECT_PRED5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED5Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED5(PredFunction5Int, n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED5Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED5(PredFunction5Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED5Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED5(PredFunctor5(), n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED5Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED5(PredFunctor5(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED5Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED5(PredFunction5Int, ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful ASSERT_PRED5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED5Test, FunctionOnUserTypeSuccess) { ASSERT_PRED5(PredFunction5Bool, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a successful ASSERT_PRED5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED5Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED5(PredFunctor5(), ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful ASSERT_PRED5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED5Test, FunctorOnUserTypeSuccess) { ASSERT_PRED5(PredFunctor5(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a failed ASSERT_PRED5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED5Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED5(PredFunction5Int, n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED5Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED5(PredFunction5Bool, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED5Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED5(PredFunctor5(), n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED5Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED5(PredFunctor5(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a successful EXPECT_PRED_FORMAT5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT5Test, FunctionOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT5(PredFormatFunction5, ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT5Test, FunctionOnUserTypeSuccess) { EXPECT_PRED_FORMAT5(PredFormatFunction5, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT5Test, FunctorOnBuiltInTypeSuccess) { EXPECT_PRED_FORMAT5(PredFormatFunctor5(), ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful EXPECT_PRED_FORMAT5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT5Test, FunctorOnUserTypeSuccess) { EXPECT_PRED_FORMAT5(PredFormatFunctor5(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a failed EXPECT_PRED_FORMAT5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT5Test, FunctionOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT5(PredFormatFunction5, n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT5Test, FunctionOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT5(PredFormatFunction5, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(EXPECT_PRED_FORMAT5Test, FunctorOnBuiltInTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT5(PredFormatFunctor5(), n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed EXPECT_PRED_FORMAT5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(EXPECT_PRED_FORMAT5Test, FunctorOnUserTypeFailure) { EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT5(PredFormatFunctor5(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a successful ASSERT_PRED_FORMAT5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT5Test, FunctionOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT5(PredFormatFunction5, ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT5Test, FunctionOnUserTypeSuccess) { ASSERT_PRED_FORMAT5(PredFormatFunction5, Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT5Test, FunctorOnBuiltInTypeSuccess) { ASSERT_PRED_FORMAT5(PredFormatFunctor5(), ++n1_, ++n2_, ++n3_, ++n4_, ++n5_); finished_ = true; } // Tests a successful ASSERT_PRED_FORMAT5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT5Test, FunctorOnUserTypeSuccess) { ASSERT_PRED_FORMAT5(PredFormatFunctor5(), Bool(++n1_), Bool(++n2_), Bool(++n3_), Bool(++n4_), Bool(++n5_)); finished_ = true; } // Tests a failed ASSERT_PRED_FORMAT5 where the // predicate-formatter is a function on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT5Test, FunctionOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT5(PredFormatFunction5, n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT5 where the // predicate-formatter is a function on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT5Test, FunctionOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT5(PredFormatFunction5, Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT5 where the // predicate-formatter is a functor on a built-in type (int). TEST_F(ASSERT_PRED_FORMAT5Test, FunctorOnBuiltInTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT5(PredFormatFunctor5(), n1_++, n2_++, n3_++, n4_++, n5_++); finished_ = true; }, ""); } // Tests a failed ASSERT_PRED_FORMAT5 where the // predicate-formatter is a functor on a user-defined type (Bool). TEST_F(ASSERT_PRED_FORMAT5Test, FunctorOnUserTypeFailure) { expected_to_finish_ = false; EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT5(PredFormatFunctor5(), Bool(n1_++), Bool(n2_++), Bool(n3_++), Bool(n4_++), Bool(n5_++)); finished_ = true; }, ""); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_prod_test.cc0000600000175000017500000000424111561126632024140 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Unit test for include/gtest/gtest_prod.h. #include "gtest/gtest.h" #include "test/production.h" // Tests that private members can be accessed from a TEST declared as // a friend of the class. TEST(PrivateCodeTest, CanAccessPrivateMembers) { PrivateCode a; EXPECT_EQ(0, a.x_); a.set_x(1); EXPECT_EQ(1, a.x_); } typedef testing::Test PrivateCodeFixtureTest; // Tests that private members can be accessed from a TEST_F declared // as a friend of the class. TEST_F(PrivateCodeFixtureTest, CanAccessPrivateMembers) { PrivateCode a; EXPECT_EQ(0, a.x_); a.set_x(2); EXPECT_EQ(2, a.x_); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_repeat_test.cc0000600000175000017500000002000011561126632024443 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Tests the --gtest_repeat=number flag. #include #include #include "gtest/gtest.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ namespace testing { GTEST_DECLARE_string_(death_test_style); GTEST_DECLARE_string_(filter); GTEST_DECLARE_int32_(repeat); } // namespace testing using testing::GTEST_FLAG(death_test_style); using testing::GTEST_FLAG(filter); using testing::GTEST_FLAG(repeat); namespace { // We need this when we are testing Google Test itself and therefore // cannot use Google Test assertions. #define GTEST_CHECK_INT_EQ_(expected, actual) \ do {\ const int expected_val = (expected);\ const int actual_val = (actual);\ if (::testing::internal::IsTrue(expected_val != actual_val)) {\ ::std::cout << "Value of: " #actual "\n"\ << " Actual: " << actual_val << "\n"\ << "Expected: " #expected "\n"\ << "Which is: " << expected_val << "\n";\ ::testing::internal::posix::Abort();\ }\ } while(::testing::internal::AlwaysFalse()) // Used for verifying that global environment set-up and tear-down are // inside the gtest_repeat loop. int g_environment_set_up_count = 0; int g_environment_tear_down_count = 0; class MyEnvironment : public testing::Environment { public: MyEnvironment() {} virtual void SetUp() { g_environment_set_up_count++; } virtual void TearDown() { g_environment_tear_down_count++; } }; // A test that should fail. int g_should_fail_count = 0; TEST(FooTest, ShouldFail) { g_should_fail_count++; EXPECT_EQ(0, 1) << "Expected failure."; } // A test that should pass. int g_should_pass_count = 0; TEST(FooTest, ShouldPass) { g_should_pass_count++; } // A test that contains a thread-safe death test and a fast death // test. It should pass. int g_death_test_count = 0; TEST(BarDeathTest, ThreadSafeAndFast) { g_death_test_count++; GTEST_FLAG(death_test_style) = "threadsafe"; EXPECT_DEATH_IF_SUPPORTED(::testing::internal::posix::Abort(), ""); GTEST_FLAG(death_test_style) = "fast"; EXPECT_DEATH_IF_SUPPORTED(::testing::internal::posix::Abort(), ""); } #if GTEST_HAS_PARAM_TEST int g_param_test_count = 0; const int kNumberOfParamTests = 10; class MyParamTest : public testing::TestWithParam {}; TEST_P(MyParamTest, ShouldPass) { // TODO(vladl@google.com): Make parameter value checking robust // WRT order of tests. GTEST_CHECK_INT_EQ_(g_param_test_count % kNumberOfParamTests, GetParam()); g_param_test_count++; } INSTANTIATE_TEST_CASE_P(MyParamSequence, MyParamTest, testing::Range(0, kNumberOfParamTests)); #endif // GTEST_HAS_PARAM_TEST // Resets the count for each test. void ResetCounts() { g_environment_set_up_count = 0; g_environment_tear_down_count = 0; g_should_fail_count = 0; g_should_pass_count = 0; g_death_test_count = 0; #if GTEST_HAS_PARAM_TEST g_param_test_count = 0; #endif // GTEST_HAS_PARAM_TEST } // Checks that the count for each test is expected. void CheckCounts(int expected) { GTEST_CHECK_INT_EQ_(expected, g_environment_set_up_count); GTEST_CHECK_INT_EQ_(expected, g_environment_tear_down_count); GTEST_CHECK_INT_EQ_(expected, g_should_fail_count); GTEST_CHECK_INT_EQ_(expected, g_should_pass_count); GTEST_CHECK_INT_EQ_(expected, g_death_test_count); #if GTEST_HAS_PARAM_TEST GTEST_CHECK_INT_EQ_(expected * kNumberOfParamTests, g_param_test_count); #endif // GTEST_HAS_PARAM_TEST } // Tests the behavior of Google Test when --gtest_repeat is not specified. void TestRepeatUnspecified() { ResetCounts(); GTEST_CHECK_INT_EQ_(1, RUN_ALL_TESTS()); CheckCounts(1); } // Tests the behavior of Google Test when --gtest_repeat has the given value. void TestRepeat(int repeat) { GTEST_FLAG(repeat) = repeat; ResetCounts(); GTEST_CHECK_INT_EQ_(repeat > 0 ? 1 : 0, RUN_ALL_TESTS()); CheckCounts(repeat); } // Tests using --gtest_repeat when --gtest_filter specifies an empty // set of tests. void TestRepeatWithEmptyFilter(int repeat) { GTEST_FLAG(repeat) = repeat; GTEST_FLAG(filter) = "None"; ResetCounts(); GTEST_CHECK_INT_EQ_(0, RUN_ALL_TESTS()); CheckCounts(0); } // Tests using --gtest_repeat when --gtest_filter specifies a set of // successful tests. void TestRepeatWithFilterForSuccessfulTests(int repeat) { GTEST_FLAG(repeat) = repeat; GTEST_FLAG(filter) = "*-*ShouldFail"; ResetCounts(); GTEST_CHECK_INT_EQ_(0, RUN_ALL_TESTS()); GTEST_CHECK_INT_EQ_(repeat, g_environment_set_up_count); GTEST_CHECK_INT_EQ_(repeat, g_environment_tear_down_count); GTEST_CHECK_INT_EQ_(0, g_should_fail_count); GTEST_CHECK_INT_EQ_(repeat, g_should_pass_count); GTEST_CHECK_INT_EQ_(repeat, g_death_test_count); #if GTEST_HAS_PARAM_TEST GTEST_CHECK_INT_EQ_(repeat * kNumberOfParamTests, g_param_test_count); #endif // GTEST_HAS_PARAM_TEST } // Tests using --gtest_repeat when --gtest_filter specifies a set of // failed tests. void TestRepeatWithFilterForFailedTests(int repeat) { GTEST_FLAG(repeat) = repeat; GTEST_FLAG(filter) = "*ShouldFail"; ResetCounts(); GTEST_CHECK_INT_EQ_(1, RUN_ALL_TESTS()); GTEST_CHECK_INT_EQ_(repeat, g_environment_set_up_count); GTEST_CHECK_INT_EQ_(repeat, g_environment_tear_down_count); GTEST_CHECK_INT_EQ_(repeat, g_should_fail_count); GTEST_CHECK_INT_EQ_(0, g_should_pass_count); GTEST_CHECK_INT_EQ_(0, g_death_test_count); #if GTEST_HAS_PARAM_TEST GTEST_CHECK_INT_EQ_(0, g_param_test_count); #endif // GTEST_HAS_PARAM_TEST } } // namespace int main(int argc, char **argv) { testing::InitGoogleTest(&argc, argv); testing::AddGlobalTestEnvironment(new MyEnvironment); TestRepeatUnspecified(); TestRepeat(0); TestRepeat(1); TestRepeat(5); TestRepeatWithEmptyFilter(2); TestRepeatWithEmptyFilter(3); TestRepeatWithFilterForSuccessfulTests(3); TestRepeatWithFilterForFailedTests(4); // It would be nice to verify that the tests indeed loop forever // when GTEST_FLAG(repeat) is negative, but this test will be quite // complicated to write. Since this flag is for interactive // debugging only and doesn't affect the normal test result, such a // test would be an overkill. printf("PASS\n"); return 0; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_shuffle_test.py0000600000175000017500000003040511561126632024674 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009 Google Inc. All Rights Reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Verifies that test shuffling works.""" __author__ = 'wan@google.com (Zhanyong Wan)' import os import gtest_test_utils # Command to run the gtest_shuffle_test_ program. COMMAND = gtest_test_utils.GetTestExecutablePath('gtest_shuffle_test_') # The environment variables for test sharding. TOTAL_SHARDS_ENV_VAR = 'GTEST_TOTAL_SHARDS' SHARD_INDEX_ENV_VAR = 'GTEST_SHARD_INDEX' TEST_FILTER = 'A*.A:A*.B:C*' ALL_TESTS = [] ACTIVE_TESTS = [] FILTERED_TESTS = [] SHARDED_TESTS = [] SHUFFLED_ALL_TESTS = [] SHUFFLED_ACTIVE_TESTS = [] SHUFFLED_FILTERED_TESTS = [] SHUFFLED_SHARDED_TESTS = [] def AlsoRunDisabledTestsFlag(): return '--gtest_also_run_disabled_tests' def FilterFlag(test_filter): return '--gtest_filter=%s' % (test_filter,) def RepeatFlag(n): return '--gtest_repeat=%s' % (n,) def ShuffleFlag(): return '--gtest_shuffle' def RandomSeedFlag(n): return '--gtest_random_seed=%s' % (n,) def RunAndReturnOutput(extra_env, args): """Runs the test program and returns its output.""" environ_copy = os.environ.copy() environ_copy.update(extra_env) return gtest_test_utils.Subprocess([COMMAND] + args, env=environ_copy).output def GetTestsForAllIterations(extra_env, args): """Runs the test program and returns a list of test lists. Args: extra_env: a map from environment variables to their values args: command line flags to pass to gtest_shuffle_test_ Returns: A list where the i-th element is the list of tests run in the i-th test iteration. """ test_iterations = [] for line in RunAndReturnOutput(extra_env, args).split('\n'): if line.startswith('----'): tests = [] test_iterations.append(tests) elif line.strip(): tests.append(line.strip()) # 'TestCaseName.TestName' return test_iterations def GetTestCases(tests): """Returns a list of test cases in the given full test names. Args: tests: a list of full test names Returns: A list of test cases from 'tests', in their original order. Consecutive duplicates are removed. """ test_cases = [] for test in tests: test_case = test.split('.')[0] if not test_case in test_cases: test_cases.append(test_case) return test_cases def CalculateTestLists(): """Calculates the list of tests run under different flags.""" if not ALL_TESTS: ALL_TESTS.extend( GetTestsForAllIterations({}, [AlsoRunDisabledTestsFlag()])[0]) if not ACTIVE_TESTS: ACTIVE_TESTS.extend(GetTestsForAllIterations({}, [])[0]) if not FILTERED_TESTS: FILTERED_TESTS.extend( GetTestsForAllIterations({}, [FilterFlag(TEST_FILTER)])[0]) if not SHARDED_TESTS: SHARDED_TESTS.extend( GetTestsForAllIterations({TOTAL_SHARDS_ENV_VAR: '3', SHARD_INDEX_ENV_VAR: '1'}, [])[0]) if not SHUFFLED_ALL_TESTS: SHUFFLED_ALL_TESTS.extend(GetTestsForAllIterations( {}, [AlsoRunDisabledTestsFlag(), ShuffleFlag(), RandomSeedFlag(1)])[0]) if not SHUFFLED_ACTIVE_TESTS: SHUFFLED_ACTIVE_TESTS.extend(GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(1)])[0]) if not SHUFFLED_FILTERED_TESTS: SHUFFLED_FILTERED_TESTS.extend(GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(1), FilterFlag(TEST_FILTER)])[0]) if not SHUFFLED_SHARDED_TESTS: SHUFFLED_SHARDED_TESTS.extend( GetTestsForAllIterations({TOTAL_SHARDS_ENV_VAR: '3', SHARD_INDEX_ENV_VAR: '1'}, [ShuffleFlag(), RandomSeedFlag(1)])[0]) class GTestShuffleUnitTest(gtest_test_utils.TestCase): """Tests test shuffling.""" def setUp(self): CalculateTestLists() def testShufflePreservesNumberOfTests(self): self.assertEqual(len(ALL_TESTS), len(SHUFFLED_ALL_TESTS)) self.assertEqual(len(ACTIVE_TESTS), len(SHUFFLED_ACTIVE_TESTS)) self.assertEqual(len(FILTERED_TESTS), len(SHUFFLED_FILTERED_TESTS)) self.assertEqual(len(SHARDED_TESTS), len(SHUFFLED_SHARDED_TESTS)) def testShuffleChangesTestOrder(self): self.assert_(SHUFFLED_ALL_TESTS != ALL_TESTS, SHUFFLED_ALL_TESTS) self.assert_(SHUFFLED_ACTIVE_TESTS != ACTIVE_TESTS, SHUFFLED_ACTIVE_TESTS) self.assert_(SHUFFLED_FILTERED_TESTS != FILTERED_TESTS, SHUFFLED_FILTERED_TESTS) self.assert_(SHUFFLED_SHARDED_TESTS != SHARDED_TESTS, SHUFFLED_SHARDED_TESTS) def testShuffleChangesTestCaseOrder(self): self.assert_(GetTestCases(SHUFFLED_ALL_TESTS) != GetTestCases(ALL_TESTS), GetTestCases(SHUFFLED_ALL_TESTS)) self.assert_( GetTestCases(SHUFFLED_ACTIVE_TESTS) != GetTestCases(ACTIVE_TESTS), GetTestCases(SHUFFLED_ACTIVE_TESTS)) self.assert_( GetTestCases(SHUFFLED_FILTERED_TESTS) != GetTestCases(FILTERED_TESTS), GetTestCases(SHUFFLED_FILTERED_TESTS)) self.assert_( GetTestCases(SHUFFLED_SHARDED_TESTS) != GetTestCases(SHARDED_TESTS), GetTestCases(SHUFFLED_SHARDED_TESTS)) def testShuffleDoesNotRepeatTest(self): for test in SHUFFLED_ALL_TESTS: self.assertEqual(1, SHUFFLED_ALL_TESTS.count(test), '%s appears more than once' % (test,)) for test in SHUFFLED_ACTIVE_TESTS: self.assertEqual(1, SHUFFLED_ACTIVE_TESTS.count(test), '%s appears more than once' % (test,)) for test in SHUFFLED_FILTERED_TESTS: self.assertEqual(1, SHUFFLED_FILTERED_TESTS.count(test), '%s appears more than once' % (test,)) for test in SHUFFLED_SHARDED_TESTS: self.assertEqual(1, SHUFFLED_SHARDED_TESTS.count(test), '%s appears more than once' % (test,)) def testShuffleDoesNotCreateNewTest(self): for test in SHUFFLED_ALL_TESTS: self.assert_(test in ALL_TESTS, '%s is an invalid test' % (test,)) for test in SHUFFLED_ACTIVE_TESTS: self.assert_(test in ACTIVE_TESTS, '%s is an invalid test' % (test,)) for test in SHUFFLED_FILTERED_TESTS: self.assert_(test in FILTERED_TESTS, '%s is an invalid test' % (test,)) for test in SHUFFLED_SHARDED_TESTS: self.assert_(test in SHARDED_TESTS, '%s is an invalid test' % (test,)) def testShuffleIncludesAllTests(self): for test in ALL_TESTS: self.assert_(test in SHUFFLED_ALL_TESTS, '%s is missing' % (test,)) for test in ACTIVE_TESTS: self.assert_(test in SHUFFLED_ACTIVE_TESTS, '%s is missing' % (test,)) for test in FILTERED_TESTS: self.assert_(test in SHUFFLED_FILTERED_TESTS, '%s is missing' % (test,)) for test in SHARDED_TESTS: self.assert_(test in SHUFFLED_SHARDED_TESTS, '%s is missing' % (test,)) def testShuffleLeavesDeathTestsAtFront(self): non_death_test_found = False for test in SHUFFLED_ACTIVE_TESTS: if 'DeathTest.' in test: self.assert_(not non_death_test_found, '%s appears after a non-death test' % (test,)) else: non_death_test_found = True def _VerifyTestCasesDoNotInterleave(self, tests): test_cases = [] for test in tests: [test_case, _] = test.split('.') if test_cases and test_cases[-1] != test_case: test_cases.append(test_case) self.assertEqual(1, test_cases.count(test_case), 'Test case %s is not grouped together in %s' % (test_case, tests)) def testShuffleDoesNotInterleaveTestCases(self): self._VerifyTestCasesDoNotInterleave(SHUFFLED_ALL_TESTS) self._VerifyTestCasesDoNotInterleave(SHUFFLED_ACTIVE_TESTS) self._VerifyTestCasesDoNotInterleave(SHUFFLED_FILTERED_TESTS) self._VerifyTestCasesDoNotInterleave(SHUFFLED_SHARDED_TESTS) def testShuffleRestoresOrderAfterEachIteration(self): # Get the test lists in all 3 iterations, using random seed 1, 2, # and 3 respectively. Google Test picks a different seed in each # iteration, and this test depends on the current implementation # picking successive numbers. This dependency is not ideal, but # makes the test much easier to write. [tests_in_iteration1, tests_in_iteration2, tests_in_iteration3] = ( GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(1), RepeatFlag(3)])) # Make sure running the tests with random seed 1 gets the same # order as in iteration 1 above. [tests_with_seed1] = GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(1)]) self.assertEqual(tests_in_iteration1, tests_with_seed1) # Make sure running the tests with random seed 2 gets the same # order as in iteration 2 above. Success means that Google Test # correctly restores the test order before re-shuffling at the # beginning of iteration 2. [tests_with_seed2] = GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(2)]) self.assertEqual(tests_in_iteration2, tests_with_seed2) # Make sure running the tests with random seed 3 gets the same # order as in iteration 3 above. Success means that Google Test # correctly restores the test order before re-shuffling at the # beginning of iteration 3. [tests_with_seed3] = GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(3)]) self.assertEqual(tests_in_iteration3, tests_with_seed3) def testShuffleGeneratesNewOrderInEachIteration(self): [tests_in_iteration1, tests_in_iteration2, tests_in_iteration3] = ( GetTestsForAllIterations( {}, [ShuffleFlag(), RandomSeedFlag(1), RepeatFlag(3)])) self.assert_(tests_in_iteration1 != tests_in_iteration2, tests_in_iteration1) self.assert_(tests_in_iteration1 != tests_in_iteration3, tests_in_iteration1) self.assert_(tests_in_iteration2 != tests_in_iteration3, tests_in_iteration2) def testShuffleShardedTestsPreservesPartition(self): # If we run M tests on N shards, the same M tests should be run in # total, regardless of the random seeds used by the shards. [tests1] = GetTestsForAllIterations({TOTAL_SHARDS_ENV_VAR: '3', SHARD_INDEX_ENV_VAR: '0'}, [ShuffleFlag(), RandomSeedFlag(1)]) [tests2] = GetTestsForAllIterations({TOTAL_SHARDS_ENV_VAR: '3', SHARD_INDEX_ENV_VAR: '1'}, [ShuffleFlag(), RandomSeedFlag(20)]) [tests3] = GetTestsForAllIterations({TOTAL_SHARDS_ENV_VAR: '3', SHARD_INDEX_ENV_VAR: '2'}, [ShuffleFlag(), RandomSeedFlag(25)]) sorted_sharded_tests = tests1 + tests2 + tests3 sorted_sharded_tests.sort() sorted_active_tests = [] sorted_active_tests.extend(ACTIVE_TESTS) sorted_active_tests.sort() self.assertEqual(sorted_active_tests, sorted_sharded_tests) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_shuffle_test_.cc0000600000175000017500000000641511561126632024774 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Verifies that test shuffling works. #include "gtest/gtest.h" namespace { using ::testing::EmptyTestEventListener; using ::testing::InitGoogleTest; using ::testing::Message; using ::testing::Test; using ::testing::TestEventListeners; using ::testing::TestInfo; using ::testing::UnitTest; using ::testing::internal::String; using ::testing::internal::scoped_ptr; // The test methods are empty, as the sole purpose of this program is // to print the test names before/after shuffling. class A : public Test {}; TEST_F(A, A) {} TEST_F(A, B) {} TEST(ADeathTest, A) {} TEST(ADeathTest, B) {} TEST(ADeathTest, C) {} TEST(B, A) {} TEST(B, B) {} TEST(B, C) {} TEST(B, DISABLED_D) {} TEST(B, DISABLED_E) {} TEST(BDeathTest, A) {} TEST(BDeathTest, B) {} TEST(C, A) {} TEST(C, B) {} TEST(C, C) {} TEST(C, DISABLED_D) {} TEST(CDeathTest, A) {} TEST(DISABLED_D, A) {} TEST(DISABLED_D, DISABLED_B) {} // This printer prints the full test names only, starting each test // iteration with a "----" marker. class TestNamePrinter : public EmptyTestEventListener { public: virtual void OnTestIterationStart(const UnitTest& /* unit_test */, int /* iteration */) { printf("----\n"); } virtual void OnTestStart(const TestInfo& test_info) { printf("%s.%s\n", test_info.test_case_name(), test_info.name()); } }; } // namespace int main(int argc, char **argv) { InitGoogleTest(&argc, argv); // Replaces the default printer with TestNamePrinter, which prints // the test name only. TestEventListeners& listeners = UnitTest::GetInstance()->listeners(); delete listeners.Release(listeners.default_result_printer()); listeners.Append(new TestNamePrinter); return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_sole_header_test.cc0000600000175000017500000000425511561126632025453 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: mheule@google.com (Markus Heule) // // This test verifies that it's possible to use Google Test by including // the gtest.h header file alone. #include "gtest/gtest.h" namespace { void Subroutine() { EXPECT_EQ(42, 42); } TEST(NoFatalFailureTest, ExpectNoFatalFailure) { EXPECT_NO_FATAL_FAILURE(;); EXPECT_NO_FATAL_FAILURE(SUCCEED()); EXPECT_NO_FATAL_FAILURE(Subroutine()); EXPECT_NO_FATAL_FAILURE({ SUCCEED(); }); } TEST(NoFatalFailureTest, AssertNoFatalFailure) { ASSERT_NO_FATAL_FAILURE(;); ASSERT_NO_FATAL_FAILURE(SUCCEED()); ASSERT_NO_FATAL_FAILURE(Subroutine()); ASSERT_NO_FATAL_FAILURE({ SUCCEED(); }); } } // namespace synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_stress_test.cc0000600000175000017500000002266711561126632024533 0ustar synergysynergy// Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Tests that SCOPED_TRACE() and various Google Test assertions can be // used in a large number of threads concurrently. #include "gtest/gtest.h" #include #include // We must define this macro in order to #include // gtest-internal-inl.h. This is how Google Test prevents a user from // accidentally depending on its internal implementation. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ #if GTEST_IS_THREADSAFE namespace testing { namespace { using internal::Notification; using internal::String; using internal::TestPropertyKeyIs; using internal::ThreadWithParam; using internal::scoped_ptr; // In order to run tests in this file, for platforms where Google Test is // thread safe, implement ThreadWithParam. See the description of its API // in gtest-port.h, where it is defined for already supported platforms. // How many threads to create? const int kThreadCount = 50; String IdToKey(int id, const char* suffix) { Message key; key << "key_" << id << "_" << suffix; return key.GetString(); } String IdToString(int id) { Message id_message; id_message << id; return id_message.GetString(); } void ExpectKeyAndValueWereRecordedForId( const std::vector& properties, int id, const char* suffix) { TestPropertyKeyIs matches_key(IdToKey(id, suffix).c_str()); const std::vector::const_iterator property = std::find_if(properties.begin(), properties.end(), matches_key); ASSERT_TRUE(property != properties.end()) << "expecting " << suffix << " value for id " << id; EXPECT_STREQ(IdToString(id).c_str(), property->value()); } // Calls a large number of Google Test assertions, where exactly one of them // will fail. void ManyAsserts(int id) { GTEST_LOG_(INFO) << "Thread #" << id << " running..."; SCOPED_TRACE(Message() << "Thread #" << id); for (int i = 0; i < kThreadCount; i++) { SCOPED_TRACE(Message() << "Iteration #" << i); // A bunch of assertions that should succeed. EXPECT_TRUE(true); ASSERT_FALSE(false) << "This shouldn't fail."; EXPECT_STREQ("a", "a"); ASSERT_LE(5, 6); EXPECT_EQ(i, i) << "This shouldn't fail."; // RecordProperty() should interact safely with other threads as well. // The shared_key forces property updates. Test::RecordProperty(IdToKey(id, "string").c_str(), IdToString(id).c_str()); Test::RecordProperty(IdToKey(id, "int").c_str(), id); Test::RecordProperty("shared_key", IdToString(id).c_str()); // This assertion should fail kThreadCount times per thread. It // is for testing whether Google Test can handle failed assertions in a // multi-threaded context. EXPECT_LT(i, 0) << "This should always fail."; } } void CheckTestFailureCount(int expected_failures) { const TestInfo* const info = UnitTest::GetInstance()->current_test_info(); const TestResult* const result = info->result(); GTEST_CHECK_(expected_failures == result->total_part_count()) << "Logged " << result->total_part_count() << " failures " << " vs. " << expected_failures << " expected"; } // Tests using SCOPED_TRACE() and Google Test assertions in many threads // concurrently. TEST(StressTest, CanUseScopedTraceAndAssertionsInManyThreads) { { scoped_ptr > threads[kThreadCount]; Notification threads_can_start; for (int i = 0; i != kThreadCount; i++) threads[i].reset(new ThreadWithParam(&ManyAsserts, i, &threads_can_start)); threads_can_start.Notify(); // Blocks until all the threads are done. for (int i = 0; i != kThreadCount; i++) threads[i]->Join(); } // Ensures that kThreadCount*kThreadCount failures have been reported. const TestInfo* const info = UnitTest::GetInstance()->current_test_info(); const TestResult* const result = info->result(); std::vector properties; // We have no access to the TestResult's list of properties but we can // copy them one by one. for (int i = 0; i < result->test_property_count(); ++i) properties.push_back(result->GetTestProperty(i)); EXPECT_EQ(kThreadCount * 2 + 1, result->test_property_count()) << "String and int values recorded on each thread, " << "as well as one shared_key"; for (int i = 0; i < kThreadCount; ++i) { ExpectKeyAndValueWereRecordedForId(properties, i, "string"); ExpectKeyAndValueWereRecordedForId(properties, i, "int"); } CheckTestFailureCount(kThreadCount*kThreadCount); } void FailingThread(bool is_fatal) { if (is_fatal) FAIL() << "Fatal failure in some other thread. " << "(This failure is expected.)"; else ADD_FAILURE() << "Non-fatal failure in some other thread. " << "(This failure is expected.)"; } void GenerateFatalFailureInAnotherThread(bool is_fatal) { ThreadWithParam thread(&FailingThread, is_fatal, NULL); thread.Join(); } TEST(NoFatalFailureTest, ExpectNoFatalFailureIgnoresFailuresInOtherThreads) { EXPECT_NO_FATAL_FAILURE(GenerateFatalFailureInAnotherThread(true)); // We should only have one failure (the one from // GenerateFatalFailureInAnotherThread()), since the EXPECT_NO_FATAL_FAILURE // should succeed. CheckTestFailureCount(1); } void AssertNoFatalFailureIgnoresFailuresInOtherThreads() { ASSERT_NO_FATAL_FAILURE(GenerateFatalFailureInAnotherThread(true)); } TEST(NoFatalFailureTest, AssertNoFatalFailureIgnoresFailuresInOtherThreads) { // Using a subroutine, to make sure, that the test continues. AssertNoFatalFailureIgnoresFailuresInOtherThreads(); // We should only have one failure (the one from // GenerateFatalFailureInAnotherThread()), since the EXPECT_NO_FATAL_FAILURE // should succeed. CheckTestFailureCount(1); } TEST(FatalFailureTest, ExpectFatalFailureIgnoresFailuresInOtherThreads) { // This statement should fail, since the current thread doesn't generate a // fatal failure, only another one does. EXPECT_FATAL_FAILURE(GenerateFatalFailureInAnotherThread(true), "expected"); CheckTestFailureCount(2); } TEST(FatalFailureOnAllThreadsTest, ExpectFatalFailureOnAllThreads) { // This statement should succeed, because failures in all threads are // considered. EXPECT_FATAL_FAILURE_ON_ALL_THREADS( GenerateFatalFailureInAnotherThread(true), "expected"); CheckTestFailureCount(0); // We need to add a failure, because main() checks that there are failures. // But when only this test is run, we shouldn't have any failures. ADD_FAILURE() << "This is an expected non-fatal failure."; } TEST(NonFatalFailureTest, ExpectNonFatalFailureIgnoresFailuresInOtherThreads) { // This statement should fail, since the current thread doesn't generate a // fatal failure, only another one does. EXPECT_NONFATAL_FAILURE(GenerateFatalFailureInAnotherThread(false), "expected"); CheckTestFailureCount(2); } TEST(NonFatalFailureOnAllThreadsTest, ExpectNonFatalFailureOnAllThreads) { // This statement should succeed, because failures in all threads are // considered. EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS( GenerateFatalFailureInAnotherThread(false), "expected"); CheckTestFailureCount(0); // We need to add a failure, because main() checks that there are failures, // But when only this test is run, we shouldn't have any failures. ADD_FAILURE() << "This is an expected non-fatal failure."; } } // namespace } // namespace testing int main(int argc, char **argv) { testing::InitGoogleTest(&argc, argv); const int result = RUN_ALL_TESTS(); // Expected to fail. GTEST_CHECK_(result == 1) << "RUN_ALL_TESTS() did not fail as expected"; printf("\nPASS\n"); return 0; } #else TEST(StressTest, DISABLED_ThreadSafetyTestsAreSkippedWhenGoogleTestIsNotThreadSafe) { } int main(int argc, char **argv) { testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } #endif // GTEST_IS_THREADSAFE synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_test_utils.py0000600000175000017500000002430511561126632024402 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test utilities for Google C++ Testing Framework.""" __author__ = 'wan@google.com (Zhanyong Wan)' import atexit import os import shutil import sys import tempfile import unittest _test_module = unittest # Suppresses the 'Import not at the top of the file' lint complaint. # pylint: disable-msg=C6204 try: import subprocess _SUBPROCESS_MODULE_AVAILABLE = True except: import popen2 _SUBPROCESS_MODULE_AVAILABLE = False # pylint: enable-msg=C6204 GTEST_OUTPUT_VAR_NAME = 'GTEST_OUTPUT' IS_WINDOWS = os.name == 'nt' IS_CYGWIN = os.name == 'posix' and 'CYGWIN' in os.uname()[0] # Here we expose a class from a particular module, depending on the # environment. The comment suppresses the 'Invalid variable name' lint # complaint. TestCase = _test_module.TestCase # pylint: disable-msg=C6409 # Initially maps a flag to its default value. After # _ParseAndStripGTestFlags() is called, maps a flag to its actual value. _flag_map = {'source_dir': os.path.dirname(sys.argv[0]), 'build_dir': os.path.dirname(sys.argv[0])} _gtest_flags_are_parsed = False def _ParseAndStripGTestFlags(argv): """Parses and strips Google Test flags from argv. This is idempotent.""" # Suppresses the lint complaint about a global variable since we need it # here to maintain module-wide state. global _gtest_flags_are_parsed # pylint: disable-msg=W0603 if _gtest_flags_are_parsed: return _gtest_flags_are_parsed = True for flag in _flag_map: # The environment variable overrides the default value. if flag.upper() in os.environ: _flag_map[flag] = os.environ[flag.upper()] # The command line flag overrides the environment variable. i = 1 # Skips the program name. while i < len(argv): prefix = '--' + flag + '=' if argv[i].startswith(prefix): _flag_map[flag] = argv[i][len(prefix):] del argv[i] break else: # We don't increment i in case we just found a --gtest_* flag # and removed it from argv. i += 1 def GetFlag(flag): """Returns the value of the given flag.""" # In case GetFlag() is called before Main(), we always call # _ParseAndStripGTestFlags() here to make sure the --gtest_* flags # are parsed. _ParseAndStripGTestFlags(sys.argv) return _flag_map[flag] def GetSourceDir(): """Returns the absolute path of the directory where the .py files are.""" return os.path.abspath(GetFlag('source_dir')) def GetBuildDir(): """Returns the absolute path of the directory where the test binaries are.""" return os.path.abspath(GetFlag('build_dir')) _temp_dir = None def _RemoveTempDir(): if _temp_dir: shutil.rmtree(_temp_dir, ignore_errors=True) atexit.register(_RemoveTempDir) def GetTempDir(): """Returns a directory for temporary files.""" global _temp_dir if not _temp_dir: _temp_dir = tempfile.mkdtemp() return _temp_dir def GetTestExecutablePath(executable_name, build_dir=None): """Returns the absolute path of the test binary given its name. The function will print a message and abort the program if the resulting file doesn't exist. Args: executable_name: name of the test binary that the test script runs. build_dir: directory where to look for executables, by default the result of GetBuildDir(). Returns: The absolute path of the test binary. """ path = os.path.abspath(os.path.join(build_dir or GetBuildDir(), executable_name)) if (IS_WINDOWS or IS_CYGWIN) and not path.endswith('.exe'): path += '.exe' if not os.path.exists(path): message = ( 'Unable to find the test binary. Please make sure to provide path\n' 'to the binary via the --build_dir flag or the BUILD_DIR\n' 'environment variable.') print >> sys.stderr, message sys.exit(1) return path def GetExitStatus(exit_code): """Returns the argument to exit(), or -1 if exit() wasn't called. Args: exit_code: the result value of os.system(command). """ if os.name == 'nt': # On Windows, os.WEXITSTATUS() doesn't work and os.system() returns # the argument to exit() directly. return exit_code else: # On Unix, os.WEXITSTATUS() must be used to extract the exit status # from the result of os.system(). if os.WIFEXITED(exit_code): return os.WEXITSTATUS(exit_code) else: return -1 class Subprocess: def __init__(self, command, working_dir=None, capture_stderr=True, env=None): """Changes into a specified directory, if provided, and executes a command. Restores the old directory afterwards. Args: command: The command to run, in the form of sys.argv. working_dir: The directory to change into. capture_stderr: Determines whether to capture stderr in the output member or to discard it. env: Dictionary with environment to pass to the subprocess. Returns: An object that represents outcome of the executed process. It has the following attributes: terminated_by_signal True iff the child process has been terminated by a signal. signal Sygnal that terminated the child process. exited True iff the child process exited normally. exit_code The code with which the child process exited. output Child process's stdout and stderr output combined in a string. """ # The subprocess module is the preferrable way of running programs # since it is available and behaves consistently on all platforms, # including Windows. But it is only available starting in python 2.4. # In earlier python versions, we revert to the popen2 module, which is # available in python 2.0 and later but doesn't provide required # functionality (Popen4) under Windows. This allows us to support Mac # OS X 10.4 Tiger, which has python 2.3 installed. if _SUBPROCESS_MODULE_AVAILABLE: if capture_stderr: stderr = subprocess.STDOUT else: stderr = subprocess.PIPE p = subprocess.Popen(command, stdout=subprocess.PIPE, stderr=stderr, cwd=working_dir, universal_newlines=True, env=env) # communicate returns a tuple with the file obect for the child's # output. self.output = p.communicate()[0] self._return_code = p.returncode else: old_dir = os.getcwd() def _ReplaceEnvDict(dest, src): # Changes made by os.environ.clear are not inheritable by child # processes until Python 2.6. To produce inheritable changes we have # to delete environment items with the del statement. for key in dest: del dest[key] dest.update(src) # When 'env' is not None, backup the environment variables and replace # them with the passed 'env'. When 'env' is None, we simply use the # current 'os.environ' for compatibility with the subprocess.Popen # semantics used above. if env is not None: old_environ = os.environ.copy() _ReplaceEnvDict(os.environ, env) try: if working_dir is not None: os.chdir(working_dir) if capture_stderr: p = popen2.Popen4(command) else: p = popen2.Popen3(command) p.tochild.close() self.output = p.fromchild.read() ret_code = p.wait() finally: os.chdir(old_dir) # Restore the old environment variables # if they were replaced. if env is not None: _ReplaceEnvDict(os.environ, old_environ) # Converts ret_code to match the semantics of # subprocess.Popen.returncode. if os.WIFSIGNALED(ret_code): self._return_code = -os.WTERMSIG(ret_code) else: # os.WIFEXITED(ret_code) should return True here. self._return_code = os.WEXITSTATUS(ret_code) if self._return_code < 0: self.terminated_by_signal = True self.exited = False self.signal = -self._return_code else: self.terminated_by_signal = False self.exited = True self.exit_code = self._return_code def Main(): """Runs the unit test.""" # We must call _ParseAndStripGTestFlags() before calling # unittest.main(). Otherwise the latter will be confused by the # --gtest_* flags. _ParseAndStripGTestFlags(sys.argv) # The tested binaries should not be writing XML output files unless the # script explicitly instructs them to. # TODO(vladl@google.com): Move this into Subprocess when we implement # passing environment into it as a parameter. if GTEST_OUTPUT_VAR_NAME in os.environ: del os.environ[GTEST_OUTPUT_VAR_NAME] _test_module.main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_throw_on_failure_ex_test.cc0000600000175000017500000000656411561126632027250 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Tests Google Test's throw-on-failure mode with exceptions enabled. #include "gtest/gtest.h" #include #include #include #include // Prints the given failure message and exits the program with // non-zero. We use this instead of a Google Test assertion to // indicate a failure, as the latter is been tested and cannot be // relied on. void Fail(const char* msg) { printf("FAILURE: %s\n", msg); fflush(stdout); exit(1); } // Tests that an assertion failure throws a subclass of // std::runtime_error. void TestFailureThrowsRuntimeError() { testing::GTEST_FLAG(throw_on_failure) = true; // A successful assertion shouldn't throw. try { EXPECT_EQ(3, 3); } catch(...) { Fail("A successful assertion wrongfully threw."); } // A failed assertion should throw a subclass of std::runtime_error. try { EXPECT_EQ(2, 3) << "Expected failure"; } catch(const std::runtime_error& e) { if (strstr(e.what(), "Expected failure") != NULL) return; printf("%s", "A failed assertion did throw an exception of the right type, " "but the message is incorrect. Instead of containing \"Expected " "failure\", it is:\n"); Fail(e.what()); } catch(...) { Fail("A failed assertion threw the wrong type of exception."); } Fail("A failed assertion should've thrown but didn't."); } int main(int argc, char** argv) { testing::InitGoogleTest(&argc, argv); // We want to ensure that people can use Google Test assertions in // other testing frameworks, as long as they initialize Google Test // properly and set the thrown-on-failure mode. Therefore, we don't // use Google Test's constructs for defining and running tests // (e.g. TEST and RUN_ALL_TESTS) here. TestFailureThrowsRuntimeError(); return 0; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_throw_on_failure_test.py0000600000175000017500000001320611561126632026606 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2009, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Tests Google Test's throw-on-failure mode with exceptions disabled. This script invokes gtest_throw_on_failure_test_ (a program written with Google Test) with different environments and command line flags. """ __author__ = 'wan@google.com (Zhanyong Wan)' import os import gtest_test_utils # Constants. # The command line flag for enabling/disabling the throw-on-failure mode. THROW_ON_FAILURE = 'gtest_throw_on_failure' # Path to the gtest_throw_on_failure_test_ program, compiled with # exceptions disabled. EXE_PATH = gtest_test_utils.GetTestExecutablePath( 'gtest_throw_on_failure_test_') # Utilities. def SetEnvVar(env_var, value): """Sets an environment variable to a given value; unsets it when the given value is None. """ env_var = env_var.upper() if value is not None: os.environ[env_var] = value elif env_var in os.environ: del os.environ[env_var] def Run(command): """Runs a command; returns True/False if its exit code is/isn't 0.""" print 'Running "%s". . .' % ' '.join(command) p = gtest_test_utils.Subprocess(command) return p.exited and p.exit_code == 0 # The tests. TODO(wan@google.com): refactor the class to share common # logic with code in gtest_break_on_failure_unittest.py. class ThrowOnFailureTest(gtest_test_utils.TestCase): """Tests the throw-on-failure mode.""" def RunAndVerify(self, env_var_value, flag_value, should_fail): """Runs gtest_throw_on_failure_test_ and verifies that it does (or does not) exit with a non-zero code. Args: env_var_value: value of the GTEST_BREAK_ON_FAILURE environment variable; None if the variable should be unset. flag_value: value of the --gtest_break_on_failure flag; None if the flag should not be present. should_fail: True iff the program is expected to fail. """ SetEnvVar(THROW_ON_FAILURE, env_var_value) if env_var_value is None: env_var_value_msg = ' is not set' else: env_var_value_msg = '=' + env_var_value if flag_value is None: flag = '' elif flag_value == '0': flag = '--%s=0' % THROW_ON_FAILURE else: flag = '--%s' % THROW_ON_FAILURE command = [EXE_PATH] if flag: command.append(flag) if should_fail: should_or_not = 'should' else: should_or_not = 'should not' failed = not Run(command) SetEnvVar(THROW_ON_FAILURE, None) msg = ('when %s%s, an assertion failure in "%s" %s cause a non-zero ' 'exit code.' % (THROW_ON_FAILURE, env_var_value_msg, ' '.join(command), should_or_not)) self.assert_(failed == should_fail, msg) def testDefaultBehavior(self): """Tests the behavior of the default mode.""" self.RunAndVerify(env_var_value=None, flag_value=None, should_fail=False) def testThrowOnFailureEnvVar(self): """Tests using the GTEST_THROW_ON_FAILURE environment variable.""" self.RunAndVerify(env_var_value='0', flag_value=None, should_fail=False) self.RunAndVerify(env_var_value='1', flag_value=None, should_fail=True) def testThrowOnFailureFlag(self): """Tests using the --gtest_throw_on_failure flag.""" self.RunAndVerify(env_var_value=None, flag_value='0', should_fail=False) self.RunAndVerify(env_var_value=None, flag_value='1', should_fail=True) def testThrowOnFailureFlagOverridesEnvVar(self): """Tests that --gtest_throw_on_failure overrides GTEST_THROW_ON_FAILURE.""" self.RunAndVerify(env_var_value='0', flag_value='0', should_fail=False) self.RunAndVerify(env_var_value='0', flag_value='1', should_fail=True) self.RunAndVerify(env_var_value='1', flag_value='0', should_fail=False) self.RunAndVerify(env_var_value='1', flag_value='1', should_fail=True) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_throw_on_failure_test_.cc0000600000175000017500000000475611561126632026714 0ustar synergysynergy// Copyright 2009, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // Tests Google Test's throw-on-failure mode with exceptions disabled. // // This program must be compiled with exceptions disabled. It will be // invoked by gtest_throw_on_failure_test.py, and is expected to exit // with non-zero in the throw-on-failure mode or 0 otherwise. #include "gtest/gtest.h" int main(int argc, char** argv) { testing::InitGoogleTest(&argc, argv); // We want to ensure that people can use Google Test assertions in // other testing frameworks, as long as they initialize Google Test // properly and set the thrown-on-failure mode. Therefore, we don't // use Google Test's constructs for defining and running tests // (e.g. TEST and RUN_ALL_TESTS) here. // In the throw-on-failure mode with exceptions disabled, this // assertion will cause the program to exit with a non-zero code. EXPECT_EQ(2, 3); // When not in the throw-on-failure mode, the control will reach // here. return 0; } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_uninitialized_test.py0000600000175000017500000000466011561126632026114 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Verifies that Google Test warns the user when not initialized properly.""" __author__ = 'wan@google.com (Zhanyong Wan)' import gtest_test_utils COMMAND = gtest_test_utils.GetTestExecutablePath('gtest_uninitialized_test_') def Assert(condition): if not condition: raise AssertionError def AssertEq(expected, actual): if expected != actual: print 'Expected: %s' % (expected,) print ' Actual: %s' % (actual,) raise AssertionError def TestExitCodeAndOutput(command): """Runs the given command and verifies its exit code and output.""" # Verifies that 'command' exits with code 1. p = gtest_test_utils.Subprocess(command) Assert(p.exited) AssertEq(1, p.exit_code) Assert('InitGoogleTest' in p.output) class GTestUninitializedTest(gtest_test_utils.TestCase): def testExitCodeAndOutput(self): TestExitCodeAndOutput(COMMAND) if __name__ == '__main__': gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_uninitialized_test_.cc0000600000175000017500000000360111561126632026202 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) #include "gtest/gtest.h" TEST(DummyTest, Dummy) { // This test doesn't verify anything. We just need it to create a // realistic stage for testing the behavior of Google Test when // RUN_ALL_TESTS() is called without testing::InitGoogleTest() being // called first. } int main() { return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_unittest.cc0000600000175000017500000070705411561126632024030 0ustar synergysynergy// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // Tests for Google Test itself. This verifies that the basic constructs of // Google Test work. #include "gtest/gtest.h" #include #include // Verifies that the command line flag variables can be accessed // in code once has been #included. // Do not move it after other #includes. TEST(CommandLineFlagsTest, CanBeAccessedInCodeOnceGTestHIsIncluded) { bool dummy = testing::GTEST_FLAG(also_run_disabled_tests) || testing::GTEST_FLAG(break_on_failure) || testing::GTEST_FLAG(catch_exceptions) || testing::GTEST_FLAG(color) != "unknown" || testing::GTEST_FLAG(filter) != "unknown" || testing::GTEST_FLAG(list_tests) || testing::GTEST_FLAG(output) != "unknown" || testing::GTEST_FLAG(print_time) || testing::GTEST_FLAG(random_seed) || testing::GTEST_FLAG(repeat) > 0 || testing::GTEST_FLAG(show_internal_stack_frames) || testing::GTEST_FLAG(shuffle) || testing::GTEST_FLAG(stack_trace_depth) > 0 || testing::GTEST_FLAG(stream_result_to) != "unknown" || testing::GTEST_FLAG(throw_on_failure); EXPECT_TRUE(dummy || !dummy); // Suppresses warning that dummy is unused. } #include "gtest/gtest-spi.h" // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #include "src/gtest-internal-inl.h" #undef GTEST_IMPLEMENTATION_ #include // For INT_MAX. #include #include #include namespace testing { namespace internal { // Provides access to otherwise private parts of the TestEventListeners class // that are needed to test it. class TestEventListenersAccessor { public: static TestEventListener* GetRepeater(TestEventListeners* listeners) { return listeners->repeater(); } static void SetDefaultResultPrinter(TestEventListeners* listeners, TestEventListener* listener) { listeners->SetDefaultResultPrinter(listener); } static void SetDefaultXmlGenerator(TestEventListeners* listeners, TestEventListener* listener) { listeners->SetDefaultXmlGenerator(listener); } static bool EventForwardingEnabled(const TestEventListeners& listeners) { return listeners.EventForwardingEnabled(); } static void SuppressEventForwarding(TestEventListeners* listeners) { listeners->SuppressEventForwarding(); } }; } // namespace internal } // namespace testing using testing::AssertionFailure; using testing::AssertionResult; using testing::AssertionSuccess; using testing::DoubleLE; using testing::EmptyTestEventListener; using testing::FloatLE; using testing::GTEST_FLAG(also_run_disabled_tests); using testing::GTEST_FLAG(break_on_failure); using testing::GTEST_FLAG(catch_exceptions); using testing::GTEST_FLAG(color); using testing::GTEST_FLAG(death_test_use_fork); using testing::GTEST_FLAG(filter); using testing::GTEST_FLAG(list_tests); using testing::GTEST_FLAG(output); using testing::GTEST_FLAG(print_time); using testing::GTEST_FLAG(random_seed); using testing::GTEST_FLAG(repeat); using testing::GTEST_FLAG(show_internal_stack_frames); using testing::GTEST_FLAG(shuffle); using testing::GTEST_FLAG(stack_trace_depth); using testing::GTEST_FLAG(stream_result_to); using testing::GTEST_FLAG(throw_on_failure); using testing::IsNotSubstring; using testing::IsSubstring; using testing::Message; using testing::ScopedFakeTestPartResultReporter; using testing::StaticAssertTypeEq; using testing::Test; using testing::TestCase; using testing::TestEventListeners; using testing::TestPartResult; using testing::TestPartResultArray; using testing::TestProperty; using testing::TestResult; using testing::UnitTest; using testing::kMaxStackTraceDepth; using testing::internal::AddReference; using testing::internal::AlwaysFalse; using testing::internal::AlwaysTrue; using testing::internal::AppendUserMessage; using testing::internal::ArrayAwareFind; using testing::internal::ArrayEq; using testing::internal::CodePointToUtf8; using testing::internal::CompileAssertTypesEqual; using testing::internal::CopyArray; using testing::internal::CountIf; using testing::internal::EqFailure; using testing::internal::FloatingPoint; using testing::internal::ForEach; using testing::internal::FormatTimeInMillisAsSeconds; using testing::internal::GTestFlagSaver; using testing::internal::GetCurrentOsStackTraceExceptTop; using testing::internal::GetElementOr; using testing::internal::GetNextRandomSeed; using testing::internal::GetRandomSeedFromFlag; using testing::internal::GetTestTypeId; using testing::internal::GetTypeId; using testing::internal::GetUnitTestImpl; using testing::internal::ImplicitlyConvertible; using testing::internal::Int32; using testing::internal::Int32FromEnvOrDie; using testing::internal::IsAProtocolMessage; using testing::internal::IsContainer; using testing::internal::IsContainerTest; using testing::internal::IsNotContainer; using testing::internal::NativeArray; using testing::internal::ParseInt32Flag; using testing::internal::RemoveConst; using testing::internal::RemoveReference; using testing::internal::ShouldRunTestOnShard; using testing::internal::ShouldShard; using testing::internal::ShouldUseColor; using testing::internal::Shuffle; using testing::internal::ShuffleRange; using testing::internal::SkipPrefix; using testing::internal::StreamableToString; using testing::internal::String; using testing::internal::TestEventListenersAccessor; using testing::internal::TestResultAccessor; using testing::internal::UInt32; using testing::internal::WideStringToUtf8; using testing::internal::kCopy; using testing::internal::kMaxRandomSeed; using testing::internal::kReference; using testing::internal::kTestTypeIdInGoogleTest; using testing::internal::scoped_ptr; #if GTEST_HAS_STREAM_REDIRECTION using testing::internal::CaptureStdout; using testing::internal::GetCapturedStdout; #endif #if GTEST_IS_THREADSAFE using testing::internal::ThreadWithParam; #endif class TestingVector : public std::vector { }; ::std::ostream& operator<<(::std::ostream& os, const TestingVector& vector) { os << "{ "; for (size_t i = 0; i < vector.size(); i++) { os << vector[i] << " "; } os << "}"; return os; } // This line tests that we can define tests in an unnamed namespace. namespace { TEST(GetRandomSeedFromFlagTest, HandlesZero) { const int seed = GetRandomSeedFromFlag(0); EXPECT_LE(1, seed); EXPECT_LE(seed, static_cast(kMaxRandomSeed)); } TEST(GetRandomSeedFromFlagTest, PreservesValidSeed) { EXPECT_EQ(1, GetRandomSeedFromFlag(1)); EXPECT_EQ(2, GetRandomSeedFromFlag(2)); EXPECT_EQ(kMaxRandomSeed - 1, GetRandomSeedFromFlag(kMaxRandomSeed - 1)); EXPECT_EQ(static_cast(kMaxRandomSeed), GetRandomSeedFromFlag(kMaxRandomSeed)); } TEST(GetRandomSeedFromFlagTest, NormalizesInvalidSeed) { const int seed1 = GetRandomSeedFromFlag(-1); EXPECT_LE(1, seed1); EXPECT_LE(seed1, static_cast(kMaxRandomSeed)); const int seed2 = GetRandomSeedFromFlag(kMaxRandomSeed + 1); EXPECT_LE(1, seed2); EXPECT_LE(seed2, static_cast(kMaxRandomSeed)); } TEST(GetNextRandomSeedTest, WorksForValidInput) { EXPECT_EQ(2, GetNextRandomSeed(1)); EXPECT_EQ(3, GetNextRandomSeed(2)); EXPECT_EQ(static_cast(kMaxRandomSeed), GetNextRandomSeed(kMaxRandomSeed - 1)); EXPECT_EQ(1, GetNextRandomSeed(kMaxRandomSeed)); // We deliberately don't test GetNextRandomSeed() with invalid // inputs, as that requires death tests, which are expensive. This // is fine as GetNextRandomSeed() is internal and has a // straightforward definition. } static void ClearCurrentTestPartResults() { TestResultAccessor::ClearTestPartResults( GetUnitTestImpl()->current_test_result()); } // Tests GetTypeId. TEST(GetTypeIdTest, ReturnsSameValueForSameType) { EXPECT_EQ(GetTypeId(), GetTypeId()); EXPECT_EQ(GetTypeId(), GetTypeId()); } class SubClassOfTest : public Test {}; class AnotherSubClassOfTest : public Test {}; TEST(GetTypeIdTest, ReturnsDifferentValuesForDifferentTypes) { EXPECT_NE(GetTypeId(), GetTypeId()); EXPECT_NE(GetTypeId(), GetTypeId()); EXPECT_NE(GetTypeId(), GetTestTypeId()); EXPECT_NE(GetTypeId(), GetTestTypeId()); EXPECT_NE(GetTypeId(), GetTestTypeId()); EXPECT_NE(GetTypeId(), GetTypeId()); } // Verifies that GetTestTypeId() returns the same value, no matter it // is called from inside Google Test or outside of it. TEST(GetTestTypeIdTest, ReturnsTheSameValueInsideOrOutsideOfGoogleTest) { EXPECT_EQ(kTestTypeIdInGoogleTest, GetTestTypeId()); } // Tests FormatTimeInMillisAsSeconds(). TEST(FormatTimeInMillisAsSecondsTest, FormatsZero) { EXPECT_EQ("0", FormatTimeInMillisAsSeconds(0)); } TEST(FormatTimeInMillisAsSecondsTest, FormatsPositiveNumber) { EXPECT_EQ("0.003", FormatTimeInMillisAsSeconds(3)); EXPECT_EQ("0.01", FormatTimeInMillisAsSeconds(10)); EXPECT_EQ("0.2", FormatTimeInMillisAsSeconds(200)); EXPECT_EQ("1.2", FormatTimeInMillisAsSeconds(1200)); EXPECT_EQ("3", FormatTimeInMillisAsSeconds(3000)); } TEST(FormatTimeInMillisAsSecondsTest, FormatsNegativeNumber) { EXPECT_EQ("-0.003", FormatTimeInMillisAsSeconds(-3)); EXPECT_EQ("-0.01", FormatTimeInMillisAsSeconds(-10)); EXPECT_EQ("-0.2", FormatTimeInMillisAsSeconds(-200)); EXPECT_EQ("-1.2", FormatTimeInMillisAsSeconds(-1200)); EXPECT_EQ("-3", FormatTimeInMillisAsSeconds(-3000)); } #if GTEST_CAN_COMPARE_NULL # ifdef __BORLANDC__ // Silences warnings: "Condition is always true", "Unreachable code" # pragma option push -w-ccc -w-rch # endif // Tests that GTEST_IS_NULL_LITERAL_(x) is true when x is a null // pointer literal. TEST(NullLiteralTest, IsTrueForNullLiterals) { EXPECT_TRUE(GTEST_IS_NULL_LITERAL_(NULL)); EXPECT_TRUE(GTEST_IS_NULL_LITERAL_(0)); EXPECT_TRUE(GTEST_IS_NULL_LITERAL_(0U)); EXPECT_TRUE(GTEST_IS_NULL_LITERAL_(0L)); # ifndef __BORLANDC__ // Some compilers may fail to detect some null pointer literals; // as long as users of the framework don't use such literals, this // is harmless. EXPECT_TRUE(GTEST_IS_NULL_LITERAL_(1 - 1)); # endif } // Tests that GTEST_IS_NULL_LITERAL_(x) is false when x is not a null // pointer literal. TEST(NullLiteralTest, IsFalseForNonNullLiterals) { EXPECT_FALSE(GTEST_IS_NULL_LITERAL_(1)); EXPECT_FALSE(GTEST_IS_NULL_LITERAL_(0.0)); EXPECT_FALSE(GTEST_IS_NULL_LITERAL_('a')); EXPECT_FALSE(GTEST_IS_NULL_LITERAL_(static_cast(NULL))); } # ifdef __BORLANDC__ // Restores warnings after previous "#pragma option push" suppressed them. # pragma option pop # endif #endif // GTEST_CAN_COMPARE_NULL // // Tests CodePointToUtf8(). // Tests that the NUL character L'\0' is encoded correctly. TEST(CodePointToUtf8Test, CanEncodeNul) { char buffer[32]; EXPECT_STREQ("", CodePointToUtf8(L'\0', buffer)); } // Tests that ASCII characters are encoded correctly. TEST(CodePointToUtf8Test, CanEncodeAscii) { char buffer[32]; EXPECT_STREQ("a", CodePointToUtf8(L'a', buffer)); EXPECT_STREQ("Z", CodePointToUtf8(L'Z', buffer)); EXPECT_STREQ("&", CodePointToUtf8(L'&', buffer)); EXPECT_STREQ("\x7F", CodePointToUtf8(L'\x7F', buffer)); } // Tests that Unicode code-points that have 8 to 11 bits are encoded // as 110xxxxx 10xxxxxx. TEST(CodePointToUtf8Test, CanEncode8To11Bits) { char buffer[32]; // 000 1101 0011 => 110-00011 10-010011 EXPECT_STREQ("\xC3\x93", CodePointToUtf8(L'\xD3', buffer)); // 101 0111 0110 => 110-10101 10-110110 // Some compilers (e.g., GCC on MinGW) cannot handle non-ASCII codepoints // in wide strings and wide chars. In order to accomodate them, we have to // introduce such character constants as integers. EXPECT_STREQ("\xD5\xB6", CodePointToUtf8(static_cast(0x576), buffer)); } // Tests that Unicode code-points that have 12 to 16 bits are encoded // as 1110xxxx 10xxxxxx 10xxxxxx. TEST(CodePointToUtf8Test, CanEncode12To16Bits) { char buffer[32]; // 0000 1000 1101 0011 => 1110-0000 10-100011 10-010011 EXPECT_STREQ("\xE0\xA3\x93", CodePointToUtf8(static_cast(0x8D3), buffer)); // 1100 0111 0100 1101 => 1110-1100 10-011101 10-001101 EXPECT_STREQ("\xEC\x9D\x8D", CodePointToUtf8(static_cast(0xC74D), buffer)); } #if !GTEST_WIDE_STRING_USES_UTF16_ // Tests in this group require a wchar_t to hold > 16 bits, and thus // are skipped on Windows, Cygwin, and Symbian, where a wchar_t is // 16-bit wide. This code may not compile on those systems. // Tests that Unicode code-points that have 17 to 21 bits are encoded // as 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx. TEST(CodePointToUtf8Test, CanEncode17To21Bits) { char buffer[32]; // 0 0001 0000 1000 1101 0011 => 11110-000 10-010000 10-100011 10-010011 EXPECT_STREQ("\xF0\x90\xA3\x93", CodePointToUtf8(L'\x108D3', buffer)); // 0 0001 0000 0100 0000 0000 => 11110-000 10-010000 10-010000 10-000000 EXPECT_STREQ("\xF0\x90\x90\x80", CodePointToUtf8(L'\x10400', buffer)); // 1 0000 1000 0110 0011 0100 => 11110-100 10-001000 10-011000 10-110100 EXPECT_STREQ("\xF4\x88\x98\xB4", CodePointToUtf8(L'\x108634', buffer)); } // Tests that encoding an invalid code-point generates the expected result. TEST(CodePointToUtf8Test, CanEncodeInvalidCodePoint) { char buffer[32]; EXPECT_STREQ("(Invalid Unicode 0x1234ABCD)", CodePointToUtf8(L'\x1234ABCD', buffer)); } #endif // !GTEST_WIDE_STRING_USES_UTF16_ // Tests WideStringToUtf8(). // Tests that the NUL character L'\0' is encoded correctly. TEST(WideStringToUtf8Test, CanEncodeNul) { EXPECT_STREQ("", WideStringToUtf8(L"", 0).c_str()); EXPECT_STREQ("", WideStringToUtf8(L"", -1).c_str()); } // Tests that ASCII strings are encoded correctly. TEST(WideStringToUtf8Test, CanEncodeAscii) { EXPECT_STREQ("a", WideStringToUtf8(L"a", 1).c_str()); EXPECT_STREQ("ab", WideStringToUtf8(L"ab", 2).c_str()); EXPECT_STREQ("a", WideStringToUtf8(L"a", -1).c_str()); EXPECT_STREQ("ab", WideStringToUtf8(L"ab", -1).c_str()); } // Tests that Unicode code-points that have 8 to 11 bits are encoded // as 110xxxxx 10xxxxxx. TEST(WideStringToUtf8Test, CanEncode8To11Bits) { // 000 1101 0011 => 110-00011 10-010011 EXPECT_STREQ("\xC3\x93", WideStringToUtf8(L"\xD3", 1).c_str()); EXPECT_STREQ("\xC3\x93", WideStringToUtf8(L"\xD3", -1).c_str()); // 101 0111 0110 => 110-10101 10-110110 const wchar_t s[] = { 0x576, '\0' }; EXPECT_STREQ("\xD5\xB6", WideStringToUtf8(s, 1).c_str()); EXPECT_STREQ("\xD5\xB6", WideStringToUtf8(s, -1).c_str()); } // Tests that Unicode code-points that have 12 to 16 bits are encoded // as 1110xxxx 10xxxxxx 10xxxxxx. TEST(WideStringToUtf8Test, CanEncode12To16Bits) { // 0000 1000 1101 0011 => 1110-0000 10-100011 10-010011 const wchar_t s1[] = { 0x8D3, '\0' }; EXPECT_STREQ("\xE0\xA3\x93", WideStringToUtf8(s1, 1).c_str()); EXPECT_STREQ("\xE0\xA3\x93", WideStringToUtf8(s1, -1).c_str()); // 1100 0111 0100 1101 => 1110-1100 10-011101 10-001101 const wchar_t s2[] = { 0xC74D, '\0' }; EXPECT_STREQ("\xEC\x9D\x8D", WideStringToUtf8(s2, 1).c_str()); EXPECT_STREQ("\xEC\x9D\x8D", WideStringToUtf8(s2, -1).c_str()); } // Tests that the conversion stops when the function encounters \0 character. TEST(WideStringToUtf8Test, StopsOnNulCharacter) { EXPECT_STREQ("ABC", WideStringToUtf8(L"ABC\0XYZ", 100).c_str()); } // Tests that the conversion stops when the function reaches the limit // specified by the 'length' parameter. TEST(WideStringToUtf8Test, StopsWhenLengthLimitReached) { EXPECT_STREQ("ABC", WideStringToUtf8(L"ABCDEF", 3).c_str()); } #if !GTEST_WIDE_STRING_USES_UTF16_ // Tests that Unicode code-points that have 17 to 21 bits are encoded // as 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx. This code may not compile // on the systems using UTF-16 encoding. TEST(WideStringToUtf8Test, CanEncode17To21Bits) { // 0 0001 0000 1000 1101 0011 => 11110-000 10-010000 10-100011 10-010011 EXPECT_STREQ("\xF0\x90\xA3\x93", WideStringToUtf8(L"\x108D3", 1).c_str()); EXPECT_STREQ("\xF0\x90\xA3\x93", WideStringToUtf8(L"\x108D3", -1).c_str()); // 1 0000 1000 0110 0011 0100 => 11110-100 10-001000 10-011000 10-110100 EXPECT_STREQ("\xF4\x88\x98\xB4", WideStringToUtf8(L"\x108634", 1).c_str()); EXPECT_STREQ("\xF4\x88\x98\xB4", WideStringToUtf8(L"\x108634", -1).c_str()); } // Tests that encoding an invalid code-point generates the expected result. TEST(WideStringToUtf8Test, CanEncodeInvalidCodePoint) { EXPECT_STREQ("(Invalid Unicode 0xABCDFF)", WideStringToUtf8(L"\xABCDFF", -1).c_str()); } #else // !GTEST_WIDE_STRING_USES_UTF16_ // Tests that surrogate pairs are encoded correctly on the systems using // UTF-16 encoding in the wide strings. TEST(WideStringToUtf8Test, CanEncodeValidUtf16SUrrogatePairs) { const wchar_t s[] = { 0xD801, 0xDC00, '\0' }; EXPECT_STREQ("\xF0\x90\x90\x80", WideStringToUtf8(s, -1).c_str()); } // Tests that encoding an invalid UTF-16 surrogate pair // generates the expected result. TEST(WideStringToUtf8Test, CanEncodeInvalidUtf16SurrogatePair) { // Leading surrogate is at the end of the string. const wchar_t s1[] = { 0xD800, '\0' }; EXPECT_STREQ("\xED\xA0\x80", WideStringToUtf8(s1, -1).c_str()); // Leading surrogate is not followed by the trailing surrogate. const wchar_t s2[] = { 0xD800, 'M', '\0' }; EXPECT_STREQ("\xED\xA0\x80M", WideStringToUtf8(s2, -1).c_str()); // Trailing surrogate appearas without a leading surrogate. const wchar_t s3[] = { 0xDC00, 'P', 'Q', 'R', '\0' }; EXPECT_STREQ("\xED\xB0\x80PQR", WideStringToUtf8(s3, -1).c_str()); } #endif // !GTEST_WIDE_STRING_USES_UTF16_ // Tests that codepoint concatenation works correctly. #if !GTEST_WIDE_STRING_USES_UTF16_ TEST(WideStringToUtf8Test, ConcatenatesCodepointsCorrectly) { const wchar_t s[] = { 0x108634, 0xC74D, '\n', 0x576, 0x8D3, 0x108634, '\0'}; EXPECT_STREQ( "\xF4\x88\x98\xB4" "\xEC\x9D\x8D" "\n" "\xD5\xB6" "\xE0\xA3\x93" "\xF4\x88\x98\xB4", WideStringToUtf8(s, -1).c_str()); } #else TEST(WideStringToUtf8Test, ConcatenatesCodepointsCorrectly) { const wchar_t s[] = { 0xC74D, '\n', 0x576, 0x8D3, '\0'}; EXPECT_STREQ( "\xEC\x9D\x8D" "\n" "\xD5\xB6" "\xE0\xA3\x93", WideStringToUtf8(s, -1).c_str()); } #endif // !GTEST_WIDE_STRING_USES_UTF16_ // Tests the Random class. TEST(RandomDeathTest, GeneratesCrashesOnInvalidRange) { testing::internal::Random random(42); EXPECT_DEATH_IF_SUPPORTED( random.Generate(0), "Cannot generate a number in the range \\[0, 0\\)"); EXPECT_DEATH_IF_SUPPORTED( random.Generate(testing::internal::Random::kMaxRange + 1), "Generation of a number in \\[0, 2147483649\\) was requested, " "but this can only generate numbers in \\[0, 2147483648\\)"); } TEST(RandomTest, GeneratesNumbersWithinRange) { const UInt32 kRange = 10000; testing::internal::Random random(12345); for (int i = 0; i < 10; i++) { EXPECT_LT(random.Generate(kRange), kRange) << " for iteration " << i; } testing::internal::Random random2(testing::internal::Random::kMaxRange); for (int i = 0; i < 10; i++) { EXPECT_LT(random2.Generate(kRange), kRange) << " for iteration " << i; } } TEST(RandomTest, RepeatsWhenReseeded) { const int kSeed = 123; const int kArraySize = 10; const UInt32 kRange = 10000; UInt32 values[kArraySize]; testing::internal::Random random(kSeed); for (int i = 0; i < kArraySize; i++) { values[i] = random.Generate(kRange); } random.Reseed(kSeed); for (int i = 0; i < kArraySize; i++) { EXPECT_EQ(values[i], random.Generate(kRange)) << " for iteration " << i; } } // Tests STL container utilities. // Tests CountIf(). static bool IsPositive(int n) { return n > 0; } TEST(ContainerUtilityTest, CountIf) { std::vector v; EXPECT_EQ(0, CountIf(v, IsPositive)); // Works for an empty container. v.push_back(-1); v.push_back(0); EXPECT_EQ(0, CountIf(v, IsPositive)); // Works when no value satisfies. v.push_back(2); v.push_back(-10); v.push_back(10); EXPECT_EQ(2, CountIf(v, IsPositive)); } // Tests ForEach(). static int g_sum = 0; static void Accumulate(int n) { g_sum += n; } TEST(ContainerUtilityTest, ForEach) { std::vector v; g_sum = 0; ForEach(v, Accumulate); EXPECT_EQ(0, g_sum); // Works for an empty container; g_sum = 0; v.push_back(1); ForEach(v, Accumulate); EXPECT_EQ(1, g_sum); // Works for a container with one element. g_sum = 0; v.push_back(20); v.push_back(300); ForEach(v, Accumulate); EXPECT_EQ(321, g_sum); } // Tests GetElementOr(). TEST(ContainerUtilityTest, GetElementOr) { std::vector a; EXPECT_EQ('x', GetElementOr(a, 0, 'x')); a.push_back('a'); a.push_back('b'); EXPECT_EQ('a', GetElementOr(a, 0, 'x')); EXPECT_EQ('b', GetElementOr(a, 1, 'x')); EXPECT_EQ('x', GetElementOr(a, -2, 'x')); EXPECT_EQ('x', GetElementOr(a, 2, 'x')); } TEST(ContainerUtilityDeathTest, ShuffleRange) { std::vector a; a.push_back(0); a.push_back(1); a.push_back(2); testing::internal::Random random(1); EXPECT_DEATH_IF_SUPPORTED( ShuffleRange(&random, -1, 1, &a), "Invalid shuffle range start -1: must be in range \\[0, 3\\]"); EXPECT_DEATH_IF_SUPPORTED( ShuffleRange(&random, 4, 4, &a), "Invalid shuffle range start 4: must be in range \\[0, 3\\]"); EXPECT_DEATH_IF_SUPPORTED( ShuffleRange(&random, 3, 2, &a), "Invalid shuffle range finish 2: must be in range \\[3, 3\\]"); EXPECT_DEATH_IF_SUPPORTED( ShuffleRange(&random, 3, 4, &a), "Invalid shuffle range finish 4: must be in range \\[3, 3\\]"); } class VectorShuffleTest : public Test { protected: static const int kVectorSize = 20; VectorShuffleTest() : random_(1) { for (int i = 0; i < kVectorSize; i++) { vector_.push_back(i); } } static bool VectorIsCorrupt(const TestingVector& vector) { if (kVectorSize != static_cast(vector.size())) { return true; } bool found_in_vector[kVectorSize] = { false }; for (size_t i = 0; i < vector.size(); i++) { const int e = vector[i]; if (e < 0 || e >= kVectorSize || found_in_vector[e]) { return true; } found_in_vector[e] = true; } // Vector size is correct, elements' range is correct, no // duplicate elements. Therefore no corruption has occurred. return false; } static bool VectorIsNotCorrupt(const TestingVector& vector) { return !VectorIsCorrupt(vector); } static bool RangeIsShuffled(const TestingVector& vector, int begin, int end) { for (int i = begin; i < end; i++) { if (i != vector[i]) { return true; } } return false; } static bool RangeIsUnshuffled( const TestingVector& vector, int begin, int end) { return !RangeIsShuffled(vector, begin, end); } static bool VectorIsShuffled(const TestingVector& vector) { return RangeIsShuffled(vector, 0, static_cast(vector.size())); } static bool VectorIsUnshuffled(const TestingVector& vector) { return !VectorIsShuffled(vector); } testing::internal::Random random_; TestingVector vector_; }; // class VectorShuffleTest const int VectorShuffleTest::kVectorSize; TEST_F(VectorShuffleTest, HandlesEmptyRange) { // Tests an empty range at the beginning... ShuffleRange(&random_, 0, 0, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); // ...in the middle... ShuffleRange(&random_, kVectorSize/2, kVectorSize/2, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); // ...at the end... ShuffleRange(&random_, kVectorSize - 1, kVectorSize - 1, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); // ...and past the end. ShuffleRange(&random_, kVectorSize, kVectorSize, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); } TEST_F(VectorShuffleTest, HandlesRangeOfSizeOne) { // Tests a size one range at the beginning... ShuffleRange(&random_, 0, 1, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); // ...in the middle... ShuffleRange(&random_, kVectorSize/2, kVectorSize/2 + 1, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); // ...and at the end. ShuffleRange(&random_, kVectorSize - 1, kVectorSize, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsUnshuffled, vector_); } // Because we use our own random number generator and a fixed seed, // we can guarantee that the following "random" tests will succeed. TEST_F(VectorShuffleTest, ShufflesEntireVector) { Shuffle(&random_, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); EXPECT_FALSE(VectorIsUnshuffled(vector_)) << vector_; // Tests the first and last elements in particular to ensure that // there are no off-by-one problems in our shuffle algorithm. EXPECT_NE(0, vector_[0]); EXPECT_NE(kVectorSize - 1, vector_[kVectorSize - 1]); } TEST_F(VectorShuffleTest, ShufflesStartOfVector) { const int kRangeSize = kVectorSize/2; ShuffleRange(&random_, 0, kRangeSize, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); EXPECT_PRED3(RangeIsShuffled, vector_, 0, kRangeSize); EXPECT_PRED3(RangeIsUnshuffled, vector_, kRangeSize, kVectorSize); } TEST_F(VectorShuffleTest, ShufflesEndOfVector) { const int kRangeSize = kVectorSize / 2; ShuffleRange(&random_, kRangeSize, kVectorSize, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); EXPECT_PRED3(RangeIsUnshuffled, vector_, 0, kRangeSize); EXPECT_PRED3(RangeIsShuffled, vector_, kRangeSize, kVectorSize); } TEST_F(VectorShuffleTest, ShufflesMiddleOfVector) { int kRangeSize = kVectorSize/3; ShuffleRange(&random_, kRangeSize, 2*kRangeSize, &vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector_); EXPECT_PRED3(RangeIsUnshuffled, vector_, 0, kRangeSize); EXPECT_PRED3(RangeIsShuffled, vector_, kRangeSize, 2*kRangeSize); EXPECT_PRED3(RangeIsUnshuffled, vector_, 2*kRangeSize, kVectorSize); } TEST_F(VectorShuffleTest, ShufflesRepeatably) { TestingVector vector2; for (int i = 0; i < kVectorSize; i++) { vector2.push_back(i); } random_.Reseed(1234); Shuffle(&random_, &vector_); random_.Reseed(1234); Shuffle(&random_, &vector2); ASSERT_PRED1(VectorIsNotCorrupt, vector_); ASSERT_PRED1(VectorIsNotCorrupt, vector2); for (int i = 0; i < kVectorSize; i++) { EXPECT_EQ(vector_[i], vector2[i]) << " where i is " << i; } } // Tests the size of the AssertHelper class. TEST(AssertHelperTest, AssertHelperIsSmall) { // To avoid breaking clients that use lots of assertions in one // function, we cannot grow the size of AssertHelper. EXPECT_LE(sizeof(testing::internal::AssertHelper), sizeof(void*)); } // Tests the String class. // Tests String's constructors. TEST(StringTest, Constructors) { // Default ctor. String s1; // We aren't using EXPECT_EQ(NULL, s1.c_str()) because comparing // pointers with NULL isn't supported on all platforms. EXPECT_EQ(0U, s1.length()); EXPECT_TRUE(NULL == s1.c_str()); // Implicitly constructs from a C-string. String s2 = "Hi"; EXPECT_EQ(2U, s2.length()); EXPECT_STREQ("Hi", s2.c_str()); // Constructs from a C-string and a length. String s3("hello", 3); EXPECT_EQ(3U, s3.length()); EXPECT_STREQ("hel", s3.c_str()); // The empty String should be created when String is constructed with // a NULL pointer and length 0. EXPECT_EQ(0U, String(NULL, 0).length()); EXPECT_FALSE(String(NULL, 0).c_str() == NULL); // Constructs a String that contains '\0'. String s4("a\0bcd", 4); EXPECT_EQ(4U, s4.length()); EXPECT_EQ('a', s4.c_str()[0]); EXPECT_EQ('\0', s4.c_str()[1]); EXPECT_EQ('b', s4.c_str()[2]); EXPECT_EQ('c', s4.c_str()[3]); // Copy ctor where the source is NULL. const String null_str; String s5 = null_str; EXPECT_TRUE(s5.c_str() == NULL); // Copy ctor where the source isn't NULL. String s6 = s3; EXPECT_EQ(3U, s6.length()); EXPECT_STREQ("hel", s6.c_str()); // Copy ctor where the source contains '\0'. String s7 = s4; EXPECT_EQ(4U, s7.length()); EXPECT_EQ('a', s7.c_str()[0]); EXPECT_EQ('\0', s7.c_str()[1]); EXPECT_EQ('b', s7.c_str()[2]); EXPECT_EQ('c', s7.c_str()[3]); } TEST(StringTest, ConvertsFromStdString) { // An empty std::string. const std::string src1(""); const String dest1 = src1; EXPECT_EQ(0U, dest1.length()); EXPECT_STREQ("", dest1.c_str()); // A normal std::string. const std::string src2("Hi"); const String dest2 = src2; EXPECT_EQ(2U, dest2.length()); EXPECT_STREQ("Hi", dest2.c_str()); // An std::string with an embedded NUL character. const char src3[] = "a\0b"; const String dest3 = std::string(src3, sizeof(src3)); EXPECT_EQ(sizeof(src3), dest3.length()); EXPECT_EQ('a', dest3.c_str()[0]); EXPECT_EQ('\0', dest3.c_str()[1]); EXPECT_EQ('b', dest3.c_str()[2]); } TEST(StringTest, ConvertsToStdString) { // An empty String. const String src1(""); const std::string dest1 = src1; EXPECT_EQ("", dest1); // A normal String. const String src2("Hi"); const std::string dest2 = src2; EXPECT_EQ("Hi", dest2); // A String containing a '\0'. const String src3("x\0y", 3); const std::string dest3 = src3; EXPECT_EQ(std::string("x\0y", 3), dest3); } #if GTEST_HAS_GLOBAL_STRING TEST(StringTest, ConvertsFromGlobalString) { // An empty ::string. const ::string src1(""); const String dest1 = src1; EXPECT_EQ(0U, dest1.length()); EXPECT_STREQ("", dest1.c_str()); // A normal ::string. const ::string src2("Hi"); const String dest2 = src2; EXPECT_EQ(2U, dest2.length()); EXPECT_STREQ("Hi", dest2.c_str()); // An ::string with an embedded NUL character. const char src3[] = "x\0y"; const String dest3 = ::string(src3, sizeof(src3)); EXPECT_EQ(sizeof(src3), dest3.length()); EXPECT_EQ('x', dest3.c_str()[0]); EXPECT_EQ('\0', dest3.c_str()[1]); EXPECT_EQ('y', dest3.c_str()[2]); } TEST(StringTest, ConvertsToGlobalString) { // An empty String. const String src1(""); const ::string dest1 = src1; EXPECT_EQ("", dest1); // A normal String. const String src2("Hi"); const ::string dest2 = src2; EXPECT_EQ("Hi", dest2); const String src3("x\0y", 3); const ::string dest3 = src3; EXPECT_EQ(::string("x\0y", 3), dest3); } #endif // GTEST_HAS_GLOBAL_STRING // Tests String::ShowCStringQuoted(). TEST(StringTest, ShowCStringQuoted) { EXPECT_STREQ("(null)", String::ShowCStringQuoted(NULL).c_str()); EXPECT_STREQ("\"\"", String::ShowCStringQuoted("").c_str()); EXPECT_STREQ("\"foo\"", String::ShowCStringQuoted("foo").c_str()); } // Tests String::empty(). TEST(StringTest, Empty) { EXPECT_TRUE(String("").empty()); EXPECT_FALSE(String().empty()); EXPECT_FALSE(String(NULL).empty()); EXPECT_FALSE(String("a").empty()); EXPECT_FALSE(String("\0", 1).empty()); } // Tests String::Compare(). TEST(StringTest, Compare) { // NULL vs NULL. EXPECT_EQ(0, String().Compare(String())); // NULL vs non-NULL. EXPECT_EQ(-1, String().Compare(String(""))); // Non-NULL vs NULL. EXPECT_EQ(1, String("").Compare(String())); // The following covers non-NULL vs non-NULL. // "" vs "". EXPECT_EQ(0, String("").Compare(String(""))); // "" vs non-"". EXPECT_EQ(-1, String("").Compare(String("\0", 1))); EXPECT_EQ(-1, String("").Compare(" ")); // Non-"" vs "". EXPECT_EQ(1, String("a").Compare(String(""))); // The following covers non-"" vs non-"". // Same length and equal. EXPECT_EQ(0, String("a").Compare(String("a"))); // Same length and different. EXPECT_EQ(-1, String("a\0b", 3).Compare(String("a\0c", 3))); EXPECT_EQ(1, String("b").Compare(String("a"))); // Different lengths. EXPECT_EQ(-1, String("a").Compare(String("ab"))); EXPECT_EQ(-1, String("a").Compare(String("a\0", 2))); EXPECT_EQ(1, String("abc").Compare(String("aacd"))); } // Tests String::operator==(). TEST(StringTest, Equals) { const String null(NULL); EXPECT_TRUE(null == NULL); // NOLINT EXPECT_FALSE(null == ""); // NOLINT EXPECT_FALSE(null == "bar"); // NOLINT const String empty(""); EXPECT_FALSE(empty == NULL); // NOLINT EXPECT_TRUE(empty == ""); // NOLINT EXPECT_FALSE(empty == "bar"); // NOLINT const String foo("foo"); EXPECT_FALSE(foo == NULL); // NOLINT EXPECT_FALSE(foo == ""); // NOLINT EXPECT_FALSE(foo == "bar"); // NOLINT EXPECT_TRUE(foo == "foo"); // NOLINT const String bar("x\0y", 3); EXPECT_FALSE(bar == "x"); } // Tests String::operator!=(). TEST(StringTest, NotEquals) { const String null(NULL); EXPECT_FALSE(null != NULL); // NOLINT EXPECT_TRUE(null != ""); // NOLINT EXPECT_TRUE(null != "bar"); // NOLINT const String empty(""); EXPECT_TRUE(empty != NULL); // NOLINT EXPECT_FALSE(empty != ""); // NOLINT EXPECT_TRUE(empty != "bar"); // NOLINT const String foo("foo"); EXPECT_TRUE(foo != NULL); // NOLINT EXPECT_TRUE(foo != ""); // NOLINT EXPECT_TRUE(foo != "bar"); // NOLINT EXPECT_FALSE(foo != "foo"); // NOLINT const String bar("x\0y", 3); EXPECT_TRUE(bar != "x"); } // Tests String::length(). TEST(StringTest, Length) { EXPECT_EQ(0U, String().length()); EXPECT_EQ(0U, String("").length()); EXPECT_EQ(2U, String("ab").length()); EXPECT_EQ(3U, String("a\0b", 3).length()); } // Tests String::EndsWith(). TEST(StringTest, EndsWith) { EXPECT_TRUE(String("foobar").EndsWith("bar")); EXPECT_TRUE(String("foobar").EndsWith("")); EXPECT_TRUE(String("").EndsWith("")); EXPECT_FALSE(String("foobar").EndsWith("foo")); EXPECT_FALSE(String("").EndsWith("foo")); } // Tests String::EndsWithCaseInsensitive(). TEST(StringTest, EndsWithCaseInsensitive) { EXPECT_TRUE(String("foobar").EndsWithCaseInsensitive("BAR")); EXPECT_TRUE(String("foobaR").EndsWithCaseInsensitive("bar")); EXPECT_TRUE(String("foobar").EndsWithCaseInsensitive("")); EXPECT_TRUE(String("").EndsWithCaseInsensitive("")); EXPECT_FALSE(String("Foobar").EndsWithCaseInsensitive("foo")); EXPECT_FALSE(String("foobar").EndsWithCaseInsensitive("Foo")); EXPECT_FALSE(String("").EndsWithCaseInsensitive("foo")); } // C++Builder's preprocessor is buggy; it fails to expand macros that // appear in macro parameters after wide char literals. Provide an alias // for NULL as a workaround. static const wchar_t* const kNull = NULL; // Tests String::CaseInsensitiveWideCStringEquals TEST(StringTest, CaseInsensitiveWideCStringEquals) { EXPECT_TRUE(String::CaseInsensitiveWideCStringEquals(NULL, NULL)); EXPECT_FALSE(String::CaseInsensitiveWideCStringEquals(kNull, L"")); EXPECT_FALSE(String::CaseInsensitiveWideCStringEquals(L"", kNull)); EXPECT_FALSE(String::CaseInsensitiveWideCStringEquals(kNull, L"foobar")); EXPECT_FALSE(String::CaseInsensitiveWideCStringEquals(L"foobar", kNull)); EXPECT_TRUE(String::CaseInsensitiveWideCStringEquals(L"foobar", L"foobar")); EXPECT_TRUE(String::CaseInsensitiveWideCStringEquals(L"foobar", L"FOOBAR")); EXPECT_TRUE(String::CaseInsensitiveWideCStringEquals(L"FOOBAR", L"foobar")); } // Tests that NULL can be assigned to a String. TEST(StringTest, CanBeAssignedNULL) { const String src(NULL); String dest; dest = src; EXPECT_STREQ(NULL, dest.c_str()); } // Tests that the empty string "" can be assigned to a String. TEST(StringTest, CanBeAssignedEmpty) { const String src(""); String dest; dest = src; EXPECT_STREQ("", dest.c_str()); } // Tests that a non-empty string can be assigned to a String. TEST(StringTest, CanBeAssignedNonEmpty) { const String src("hello"); String dest; dest = src; EXPECT_EQ(5U, dest.length()); EXPECT_STREQ("hello", dest.c_str()); const String src2("x\0y", 3); String dest2; dest2 = src2; EXPECT_EQ(3U, dest2.length()); EXPECT_EQ('x', dest2.c_str()[0]); EXPECT_EQ('\0', dest2.c_str()[1]); EXPECT_EQ('y', dest2.c_str()[2]); } // Tests that a String can be assigned to itself. TEST(StringTest, CanBeAssignedSelf) { String dest("hello"); // Use explicit function call notation here to suppress self-assign warning. dest.operator=(dest); EXPECT_STREQ("hello", dest.c_str()); } // Sun Studio < 12 incorrectly rejects this code due to an overloading // ambiguity. #if !(defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) // Tests streaming a String. TEST(StringTest, Streams) { EXPECT_EQ(StreamableToString(String()), "(null)"); EXPECT_EQ(StreamableToString(String("")), ""); EXPECT_EQ(StreamableToString(String("a\0b", 3)), "a\\0b"); } #endif // Tests that String::Format() works. TEST(StringTest, FormatWorks) { // Normal case: the format spec is valid, the arguments match the // spec, and the result is < 4095 characters. EXPECT_STREQ("Hello, 42", String::Format("%s, %d", "Hello", 42).c_str()); // Edge case: the result is 4095 characters. char buffer[4096]; const size_t kSize = sizeof(buffer); memset(buffer, 'a', kSize - 1); buffer[kSize - 1] = '\0'; EXPECT_STREQ(buffer, String::Format("%s", buffer).c_str()); // The result needs to be 4096 characters, exceeding Format()'s limit. EXPECT_STREQ("", String::Format("x%s", buffer).c_str()); #if GTEST_OS_LINUX // On Linux, invalid format spec should lead to an error message. // In other environment (e.g. MSVC on Windows), String::Format() may // simply ignore a bad format spec, so this assertion is run on // Linux only. EXPECT_STREQ("", String::Format("%").c_str()); #endif } #if GTEST_OS_WINDOWS // Tests String::ShowWideCString(). TEST(StringTest, ShowWideCString) { EXPECT_STREQ("(null)", String::ShowWideCString(NULL).c_str()); EXPECT_STREQ("", String::ShowWideCString(L"").c_str()); EXPECT_STREQ("foo", String::ShowWideCString(L"foo").c_str()); } // Tests String::ShowWideCStringQuoted(). TEST(StringTest, ShowWideCStringQuoted) { EXPECT_STREQ("(null)", String::ShowWideCStringQuoted(NULL).c_str()); EXPECT_STREQ("L\"\"", String::ShowWideCStringQuoted(L"").c_str()); EXPECT_STREQ("L\"foo\"", String::ShowWideCStringQuoted(L"foo").c_str()); } # if GTEST_OS_WINDOWS_MOBILE TEST(StringTest, AnsiAndUtf16Null) { EXPECT_EQ(NULL, String::AnsiToUtf16(NULL)); EXPECT_EQ(NULL, String::Utf16ToAnsi(NULL)); } TEST(StringTest, AnsiAndUtf16ConvertBasic) { const char* ansi = String::Utf16ToAnsi(L"str"); EXPECT_STREQ("str", ansi); delete [] ansi; const WCHAR* utf16 = String::AnsiToUtf16("str"); EXPECT_EQ(0, wcsncmp(L"str", utf16, 3)); delete [] utf16; } TEST(StringTest, AnsiAndUtf16ConvertPathChars) { const char* ansi = String::Utf16ToAnsi(L".:\\ \"*?"); EXPECT_STREQ(".:\\ \"*?", ansi); delete [] ansi; const WCHAR* utf16 = String::AnsiToUtf16(".:\\ \"*?"); EXPECT_EQ(0, wcsncmp(L".:\\ \"*?", utf16, 3)); delete [] utf16; } # endif // GTEST_OS_WINDOWS_MOBILE #endif // GTEST_OS_WINDOWS // Tests TestProperty construction. TEST(TestPropertyTest, StringValue) { TestProperty property("key", "1"); EXPECT_STREQ("key", property.key()); EXPECT_STREQ("1", property.value()); } // Tests TestProperty replacing a value. TEST(TestPropertyTest, ReplaceStringValue) { TestProperty property("key", "1"); EXPECT_STREQ("1", property.value()); property.SetValue("2"); EXPECT_STREQ("2", property.value()); } // AddFatalFailure() and AddNonfatalFailure() must be stand-alone // functions (i.e. their definitions cannot be inlined at the call // sites), or C++Builder won't compile the code. static void AddFatalFailure() { FAIL() << "Expected fatal failure."; } static void AddNonfatalFailure() { ADD_FAILURE() << "Expected non-fatal failure."; } class ScopedFakeTestPartResultReporterTest : public Test { public: // Must be public and not protected due to a bug in g++ 3.4.2. enum FailureMode { FATAL_FAILURE, NONFATAL_FAILURE }; static void AddFailure(FailureMode failure) { if (failure == FATAL_FAILURE) { AddFatalFailure(); } else { AddNonfatalFailure(); } } }; // Tests that ScopedFakeTestPartResultReporter intercepts test // failures. TEST_F(ScopedFakeTestPartResultReporterTest, InterceptsTestFailures) { TestPartResultArray results; { ScopedFakeTestPartResultReporter reporter( ScopedFakeTestPartResultReporter::INTERCEPT_ONLY_CURRENT_THREAD, &results); AddFailure(NONFATAL_FAILURE); AddFailure(FATAL_FAILURE); } EXPECT_EQ(2, results.size()); EXPECT_TRUE(results.GetTestPartResult(0).nonfatally_failed()); EXPECT_TRUE(results.GetTestPartResult(1).fatally_failed()); } TEST_F(ScopedFakeTestPartResultReporterTest, DeprecatedConstructor) { TestPartResultArray results; { // Tests, that the deprecated constructor still works. ScopedFakeTestPartResultReporter reporter(&results); AddFailure(NONFATAL_FAILURE); } EXPECT_EQ(1, results.size()); } #if GTEST_IS_THREADSAFE class ScopedFakeTestPartResultReporterWithThreadsTest : public ScopedFakeTestPartResultReporterTest { protected: static void AddFailureInOtherThread(FailureMode failure) { ThreadWithParam thread(&AddFailure, failure, NULL); thread.Join(); } }; TEST_F(ScopedFakeTestPartResultReporterWithThreadsTest, InterceptsTestFailuresInAllThreads) { TestPartResultArray results; { ScopedFakeTestPartResultReporter reporter( ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS, &results); AddFailure(NONFATAL_FAILURE); AddFailure(FATAL_FAILURE); AddFailureInOtherThread(NONFATAL_FAILURE); AddFailureInOtherThread(FATAL_FAILURE); } EXPECT_EQ(4, results.size()); EXPECT_TRUE(results.GetTestPartResult(0).nonfatally_failed()); EXPECT_TRUE(results.GetTestPartResult(1).fatally_failed()); EXPECT_TRUE(results.GetTestPartResult(2).nonfatally_failed()); EXPECT_TRUE(results.GetTestPartResult(3).fatally_failed()); } #endif // GTEST_IS_THREADSAFE // Tests EXPECT_FATAL_FAILURE{,ON_ALL_THREADS}. Makes sure that they // work even if the failure is generated in a called function rather than // the current context. typedef ScopedFakeTestPartResultReporterTest ExpectFatalFailureTest; TEST_F(ExpectFatalFailureTest, CatchesFatalFaliure) { EXPECT_FATAL_FAILURE(AddFatalFailure(), "Expected fatal failure."); } #if GTEST_HAS_GLOBAL_STRING TEST_F(ExpectFatalFailureTest, AcceptsStringObject) { EXPECT_FATAL_FAILURE(AddFatalFailure(), ::string("Expected fatal failure.")); } #endif TEST_F(ExpectFatalFailureTest, AcceptsStdStringObject) { EXPECT_FATAL_FAILURE(AddFatalFailure(), ::std::string("Expected fatal failure.")); } TEST_F(ExpectFatalFailureTest, CatchesFatalFailureOnAllThreads) { // We have another test below to verify that the macro catches fatal // failures generated on another thread. EXPECT_FATAL_FAILURE_ON_ALL_THREADS(AddFatalFailure(), "Expected fatal failure."); } #ifdef __BORLANDC__ // Silences warnings: "Condition is always true" # pragma option push -w-ccc #endif // Tests that EXPECT_FATAL_FAILURE() can be used in a non-void // function even when the statement in it contains ASSERT_*. int NonVoidFunction() { EXPECT_FATAL_FAILURE(ASSERT_TRUE(false), ""); EXPECT_FATAL_FAILURE_ON_ALL_THREADS(FAIL(), ""); return 0; } TEST_F(ExpectFatalFailureTest, CanBeUsedInNonVoidFunction) { NonVoidFunction(); } // Tests that EXPECT_FATAL_FAILURE(statement, ...) doesn't abort the // current function even though 'statement' generates a fatal failure. void DoesNotAbortHelper(bool* aborted) { EXPECT_FATAL_FAILURE(ASSERT_TRUE(false), ""); EXPECT_FATAL_FAILURE_ON_ALL_THREADS(FAIL(), ""); *aborted = false; } #ifdef __BORLANDC__ // Restores warnings after previous "#pragma option push" suppressed them. # pragma option pop #endif TEST_F(ExpectFatalFailureTest, DoesNotAbort) { bool aborted = true; DoesNotAbortHelper(&aborted); EXPECT_FALSE(aborted); } // Tests that the EXPECT_FATAL_FAILURE{,_ON_ALL_THREADS} accepts a // statement that contains a macro which expands to code containing an // unprotected comma. static int global_var = 0; #define GTEST_USE_UNPROTECTED_COMMA_ global_var++, global_var++ TEST_F(ExpectFatalFailureTest, AcceptsMacroThatExpandsToUnprotectedComma) { #ifndef __BORLANDC__ // ICE's in C++Builder. EXPECT_FATAL_FAILURE({ GTEST_USE_UNPROTECTED_COMMA_; AddFatalFailure(); }, ""); #endif EXPECT_FATAL_FAILURE_ON_ALL_THREADS({ GTEST_USE_UNPROTECTED_COMMA_; AddFatalFailure(); }, ""); } // Tests EXPECT_NONFATAL_FAILURE{,ON_ALL_THREADS}. typedef ScopedFakeTestPartResultReporterTest ExpectNonfatalFailureTest; TEST_F(ExpectNonfatalFailureTest, CatchesNonfatalFailure) { EXPECT_NONFATAL_FAILURE(AddNonfatalFailure(), "Expected non-fatal failure."); } #if GTEST_HAS_GLOBAL_STRING TEST_F(ExpectNonfatalFailureTest, AcceptsStringObject) { EXPECT_NONFATAL_FAILURE(AddNonfatalFailure(), ::string("Expected non-fatal failure.")); } #endif TEST_F(ExpectNonfatalFailureTest, AcceptsStdStringObject) { EXPECT_NONFATAL_FAILURE(AddNonfatalFailure(), ::std::string("Expected non-fatal failure.")); } TEST_F(ExpectNonfatalFailureTest, CatchesNonfatalFailureOnAllThreads) { // We have another test below to verify that the macro catches // non-fatal failures generated on another thread. EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(AddNonfatalFailure(), "Expected non-fatal failure."); } // Tests that the EXPECT_NONFATAL_FAILURE{,_ON_ALL_THREADS} accepts a // statement that contains a macro which expands to code containing an // unprotected comma. TEST_F(ExpectNonfatalFailureTest, AcceptsMacroThatExpandsToUnprotectedComma) { EXPECT_NONFATAL_FAILURE({ GTEST_USE_UNPROTECTED_COMMA_; AddNonfatalFailure(); }, ""); EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS({ GTEST_USE_UNPROTECTED_COMMA_; AddNonfatalFailure(); }, ""); } #if GTEST_IS_THREADSAFE typedef ScopedFakeTestPartResultReporterWithThreadsTest ExpectFailureWithThreadsTest; TEST_F(ExpectFailureWithThreadsTest, ExpectFatalFailureOnAllThreads) { EXPECT_FATAL_FAILURE_ON_ALL_THREADS(AddFailureInOtherThread(FATAL_FAILURE), "Expected fatal failure."); } TEST_F(ExpectFailureWithThreadsTest, ExpectNonFatalFailureOnAllThreads) { EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS( AddFailureInOtherThread(NONFATAL_FAILURE), "Expected non-fatal failure."); } #endif // GTEST_IS_THREADSAFE // Tests the TestProperty class. TEST(TestPropertyTest, ConstructorWorks) { const TestProperty property("key", "value"); EXPECT_STREQ("key", property.key()); EXPECT_STREQ("value", property.value()); } TEST(TestPropertyTest, SetValue) { TestProperty property("key", "value_1"); EXPECT_STREQ("key", property.key()); property.SetValue("value_2"); EXPECT_STREQ("key", property.key()); EXPECT_STREQ("value_2", property.value()); } // Tests the TestResult class // The test fixture for testing TestResult. class TestResultTest : public Test { protected: typedef std::vector TPRVector; // We make use of 2 TestPartResult objects, TestPartResult * pr1, * pr2; // ... and 3 TestResult objects. TestResult * r0, * r1, * r2; virtual void SetUp() { // pr1 is for success. pr1 = new TestPartResult(TestPartResult::kSuccess, "foo/bar.cc", 10, "Success!"); // pr2 is for fatal failure. pr2 = new TestPartResult(TestPartResult::kFatalFailure, "foo/bar.cc", -1, // This line number means "unknown" "Failure!"); // Creates the TestResult objects. r0 = new TestResult(); r1 = new TestResult(); r2 = new TestResult(); // In order to test TestResult, we need to modify its internal // state, in particular the TestPartResult vector it holds. // test_part_results() returns a const reference to this vector. // We cast it to a non-const object s.t. it can be modified (yes, // this is a hack). TPRVector* results1 = const_cast( &TestResultAccessor::test_part_results(*r1)); TPRVector* results2 = const_cast( &TestResultAccessor::test_part_results(*r2)); // r0 is an empty TestResult. // r1 contains a single SUCCESS TestPartResult. results1->push_back(*pr1); // r2 contains a SUCCESS, and a FAILURE. results2->push_back(*pr1); results2->push_back(*pr2); } virtual void TearDown() { delete pr1; delete pr2; delete r0; delete r1; delete r2; } // Helper that compares two two TestPartResults. static void CompareTestPartResult(const TestPartResult& expected, const TestPartResult& actual) { EXPECT_EQ(expected.type(), actual.type()); EXPECT_STREQ(expected.file_name(), actual.file_name()); EXPECT_EQ(expected.line_number(), actual.line_number()); EXPECT_STREQ(expected.summary(), actual.summary()); EXPECT_STREQ(expected.message(), actual.message()); EXPECT_EQ(expected.passed(), actual.passed()); EXPECT_EQ(expected.failed(), actual.failed()); EXPECT_EQ(expected.nonfatally_failed(), actual.nonfatally_failed()); EXPECT_EQ(expected.fatally_failed(), actual.fatally_failed()); } }; // Tests TestResult::total_part_count(). TEST_F(TestResultTest, total_part_count) { ASSERT_EQ(0, r0->total_part_count()); ASSERT_EQ(1, r1->total_part_count()); ASSERT_EQ(2, r2->total_part_count()); } // Tests TestResult::Passed(). TEST_F(TestResultTest, Passed) { ASSERT_TRUE(r0->Passed()); ASSERT_TRUE(r1->Passed()); ASSERT_FALSE(r2->Passed()); } // Tests TestResult::Failed(). TEST_F(TestResultTest, Failed) { ASSERT_FALSE(r0->Failed()); ASSERT_FALSE(r1->Failed()); ASSERT_TRUE(r2->Failed()); } // Tests TestResult::GetTestPartResult(). typedef TestResultTest TestResultDeathTest; TEST_F(TestResultDeathTest, GetTestPartResult) { CompareTestPartResult(*pr1, r2->GetTestPartResult(0)); CompareTestPartResult(*pr2, r2->GetTestPartResult(1)); EXPECT_DEATH_IF_SUPPORTED(r2->GetTestPartResult(2), ""); EXPECT_DEATH_IF_SUPPORTED(r2->GetTestPartResult(-1), ""); } // Tests TestResult has no properties when none are added. TEST(TestResultPropertyTest, NoPropertiesFoundWhenNoneAreAdded) { TestResult test_result; ASSERT_EQ(0, test_result.test_property_count()); } // Tests TestResult has the expected property when added. TEST(TestResultPropertyTest, OnePropertyFoundWhenAdded) { TestResult test_result; TestProperty property("key_1", "1"); TestResultAccessor::RecordProperty(&test_result, property); ASSERT_EQ(1, test_result.test_property_count()); const TestProperty& actual_property = test_result.GetTestProperty(0); EXPECT_STREQ("key_1", actual_property.key()); EXPECT_STREQ("1", actual_property.value()); } // Tests TestResult has multiple properties when added. TEST(TestResultPropertyTest, MultiplePropertiesFoundWhenAdded) { TestResult test_result; TestProperty property_1("key_1", "1"); TestProperty property_2("key_2", "2"); TestResultAccessor::RecordProperty(&test_result, property_1); TestResultAccessor::RecordProperty(&test_result, property_2); ASSERT_EQ(2, test_result.test_property_count()); const TestProperty& actual_property_1 = test_result.GetTestProperty(0); EXPECT_STREQ("key_1", actual_property_1.key()); EXPECT_STREQ("1", actual_property_1.value()); const TestProperty& actual_property_2 = test_result.GetTestProperty(1); EXPECT_STREQ("key_2", actual_property_2.key()); EXPECT_STREQ("2", actual_property_2.value()); } // Tests TestResult::RecordProperty() overrides values for duplicate keys. TEST(TestResultPropertyTest, OverridesValuesForDuplicateKeys) { TestResult test_result; TestProperty property_1_1("key_1", "1"); TestProperty property_2_1("key_2", "2"); TestProperty property_1_2("key_1", "12"); TestProperty property_2_2("key_2", "22"); TestResultAccessor::RecordProperty(&test_result, property_1_1); TestResultAccessor::RecordProperty(&test_result, property_2_1); TestResultAccessor::RecordProperty(&test_result, property_1_2); TestResultAccessor::RecordProperty(&test_result, property_2_2); ASSERT_EQ(2, test_result.test_property_count()); const TestProperty& actual_property_1 = test_result.GetTestProperty(0); EXPECT_STREQ("key_1", actual_property_1.key()); EXPECT_STREQ("12", actual_property_1.value()); const TestProperty& actual_property_2 = test_result.GetTestProperty(1); EXPECT_STREQ("key_2", actual_property_2.key()); EXPECT_STREQ("22", actual_property_2.value()); } // Tests TestResult::GetTestProperty(). TEST(TestResultPropertyDeathTest, GetTestProperty) { TestResult test_result; TestProperty property_1("key_1", "1"); TestProperty property_2("key_2", "2"); TestProperty property_3("key_3", "3"); TestResultAccessor::RecordProperty(&test_result, property_1); TestResultAccessor::RecordProperty(&test_result, property_2); TestResultAccessor::RecordProperty(&test_result, property_3); const TestProperty& fetched_property_1 = test_result.GetTestProperty(0); const TestProperty& fetched_property_2 = test_result.GetTestProperty(1); const TestProperty& fetched_property_3 = test_result.GetTestProperty(2); EXPECT_STREQ("key_1", fetched_property_1.key()); EXPECT_STREQ("1", fetched_property_1.value()); EXPECT_STREQ("key_2", fetched_property_2.key()); EXPECT_STREQ("2", fetched_property_2.value()); EXPECT_STREQ("key_3", fetched_property_3.key()); EXPECT_STREQ("3", fetched_property_3.value()); EXPECT_DEATH_IF_SUPPORTED(test_result.GetTestProperty(3), ""); EXPECT_DEATH_IF_SUPPORTED(test_result.GetTestProperty(-1), ""); } // When a property using a reserved key is supplied to this function, it tests // that a non-fatal failure is added, a fatal failure is not added, and that the // property is not recorded. void ExpectNonFatalFailureRecordingPropertyWithReservedKey(const char* key) { TestResult test_result; TestProperty property(key, "1"); EXPECT_NONFATAL_FAILURE( TestResultAccessor::RecordProperty(&test_result, property), "Reserved key"); ASSERT_EQ(0, test_result.test_property_count()) << "Not recorded"; } // Attempting to recording a property with the Reserved literal "name" // should add a non-fatal failure and the property should not be recorded. TEST(TestResultPropertyTest, AddFailureWhenUsingReservedKeyCalledName) { ExpectNonFatalFailureRecordingPropertyWithReservedKey("name"); } // Attempting to recording a property with the Reserved literal "status" // should add a non-fatal failure and the property should not be recorded. TEST(TestResultPropertyTest, AddFailureWhenUsingReservedKeyCalledStatus) { ExpectNonFatalFailureRecordingPropertyWithReservedKey("status"); } // Attempting to recording a property with the Reserved literal "time" // should add a non-fatal failure and the property should not be recorded. TEST(TestResultPropertyTest, AddFailureWhenUsingReservedKeyCalledTime) { ExpectNonFatalFailureRecordingPropertyWithReservedKey("time"); } // Attempting to recording a property with the Reserved literal "classname" // should add a non-fatal failure and the property should not be recorded. TEST(TestResultPropertyTest, AddFailureWhenUsingReservedKeyCalledClassname) { ExpectNonFatalFailureRecordingPropertyWithReservedKey("classname"); } // Tests that GTestFlagSaver works on Windows and Mac. class GTestFlagSaverTest : public Test { protected: // Saves the Google Test flags such that we can restore them later, and // then sets them to their default values. This will be called // before the first test in this test case is run. static void SetUpTestCase() { saver_ = new GTestFlagSaver; GTEST_FLAG(also_run_disabled_tests) = false; GTEST_FLAG(break_on_failure) = false; GTEST_FLAG(catch_exceptions) = false; GTEST_FLAG(death_test_use_fork) = false; GTEST_FLAG(color) = "auto"; GTEST_FLAG(filter) = ""; GTEST_FLAG(list_tests) = false; GTEST_FLAG(output) = ""; GTEST_FLAG(print_time) = true; GTEST_FLAG(random_seed) = 0; GTEST_FLAG(repeat) = 1; GTEST_FLAG(shuffle) = false; GTEST_FLAG(stack_trace_depth) = kMaxStackTraceDepth; GTEST_FLAG(stream_result_to) = ""; GTEST_FLAG(throw_on_failure) = false; } // Restores the Google Test flags that the tests have modified. This will // be called after the last test in this test case is run. static void TearDownTestCase() { delete saver_; saver_ = NULL; } // Verifies that the Google Test flags have their default values, and then // modifies each of them. void VerifyAndModifyFlags() { EXPECT_FALSE(GTEST_FLAG(also_run_disabled_tests)); EXPECT_FALSE(GTEST_FLAG(break_on_failure)); EXPECT_FALSE(GTEST_FLAG(catch_exceptions)); EXPECT_STREQ("auto", GTEST_FLAG(color).c_str()); EXPECT_FALSE(GTEST_FLAG(death_test_use_fork)); EXPECT_STREQ("", GTEST_FLAG(filter).c_str()); EXPECT_FALSE(GTEST_FLAG(list_tests)); EXPECT_STREQ("", GTEST_FLAG(output).c_str()); EXPECT_TRUE(GTEST_FLAG(print_time)); EXPECT_EQ(0, GTEST_FLAG(random_seed)); EXPECT_EQ(1, GTEST_FLAG(repeat)); EXPECT_FALSE(GTEST_FLAG(shuffle)); EXPECT_EQ(kMaxStackTraceDepth, GTEST_FLAG(stack_trace_depth)); EXPECT_STREQ("", GTEST_FLAG(stream_result_to).c_str()); EXPECT_FALSE(GTEST_FLAG(throw_on_failure)); GTEST_FLAG(also_run_disabled_tests) = true; GTEST_FLAG(break_on_failure) = true; GTEST_FLAG(catch_exceptions) = true; GTEST_FLAG(color) = "no"; GTEST_FLAG(death_test_use_fork) = true; GTEST_FLAG(filter) = "abc"; GTEST_FLAG(list_tests) = true; GTEST_FLAG(output) = "xml:foo.xml"; GTEST_FLAG(print_time) = false; GTEST_FLAG(random_seed) = 1; GTEST_FLAG(repeat) = 100; GTEST_FLAG(shuffle) = true; GTEST_FLAG(stack_trace_depth) = 1; GTEST_FLAG(stream_result_to) = "localhost:1234"; GTEST_FLAG(throw_on_failure) = true; } private: // For saving Google Test flags during this test case. static GTestFlagSaver* saver_; }; GTestFlagSaver* GTestFlagSaverTest::saver_ = NULL; // Google Test doesn't guarantee the order of tests. The following two // tests are designed to work regardless of their order. // Modifies the Google Test flags in the test body. TEST_F(GTestFlagSaverTest, ModifyGTestFlags) { VerifyAndModifyFlags(); } // Verifies that the Google Test flags in the body of the previous test were // restored to their original values. TEST_F(GTestFlagSaverTest, VerifyGTestFlags) { VerifyAndModifyFlags(); } // Sets an environment variable with the given name to the given // value. If the value argument is "", unsets the environment // variable. The caller must ensure that both arguments are not NULL. static void SetEnv(const char* name, const char* value) { #if GTEST_OS_WINDOWS_MOBILE // Environment variables are not supported on Windows CE. return; #elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) // C++Builder's putenv only stores a pointer to its parameter; we have to // ensure that the string remains valid as long as it might be needed. // We use an std::map to do so. static std::map added_env; // Because putenv stores a pointer to the string buffer, we can't delete the // previous string (if present) until after it's replaced. String *prev_env = NULL; if (added_env.find(name) != added_env.end()) { prev_env = added_env[name]; } added_env[name] = new String((Message() << name << "=" << value).GetString()); // The standard signature of putenv accepts a 'char*' argument. Other // implementations, like C++Builder's, accept a 'const char*'. // We cast away the 'const' since that would work for both variants. putenv(const_cast(added_env[name]->c_str())); delete prev_env; #elif GTEST_OS_WINDOWS // If we are on Windows proper. _putenv((Message() << name << "=" << value).GetString().c_str()); #else if (*value == '\0') { unsetenv(name); } else { setenv(name, value, 1); } #endif // GTEST_OS_WINDOWS_MOBILE } #if !GTEST_OS_WINDOWS_MOBILE // Environment variables are not supported on Windows CE. using testing::internal::Int32FromGTestEnv; // Tests Int32FromGTestEnv(). // Tests that Int32FromGTestEnv() returns the default value when the // environment variable is not set. TEST(Int32FromGTestEnvTest, ReturnsDefaultWhenVariableIsNotSet) { SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", ""); EXPECT_EQ(10, Int32FromGTestEnv("temp", 10)); } // Tests that Int32FromGTestEnv() returns the default value when the // environment variable overflows as an Int32. TEST(Int32FromGTestEnvTest, ReturnsDefaultWhenValueOverflows) { printf("(expecting 2 warnings)\n"); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "12345678987654321"); EXPECT_EQ(20, Int32FromGTestEnv("temp", 20)); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "-12345678987654321"); EXPECT_EQ(30, Int32FromGTestEnv("temp", 30)); } // Tests that Int32FromGTestEnv() returns the default value when the // environment variable does not represent a valid decimal integer. TEST(Int32FromGTestEnvTest, ReturnsDefaultWhenValueIsInvalid) { printf("(expecting 2 warnings)\n"); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "A1"); EXPECT_EQ(40, Int32FromGTestEnv("temp", 40)); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "12X"); EXPECT_EQ(50, Int32FromGTestEnv("temp", 50)); } // Tests that Int32FromGTestEnv() parses and returns the value of the // environment variable when it represents a valid decimal integer in // the range of an Int32. TEST(Int32FromGTestEnvTest, ParsesAndReturnsValidValue) { SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "123"); EXPECT_EQ(123, Int32FromGTestEnv("temp", 0)); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "TEMP", "-321"); EXPECT_EQ(-321, Int32FromGTestEnv("temp", 0)); } #endif // !GTEST_OS_WINDOWS_MOBILE // Tests ParseInt32Flag(). // Tests that ParseInt32Flag() returns false and doesn't change the // output value when the flag has wrong format TEST(ParseInt32FlagTest, ReturnsFalseForInvalidFlag) { Int32 value = 123; EXPECT_FALSE(ParseInt32Flag("--a=100", "b", &value)); EXPECT_EQ(123, value); EXPECT_FALSE(ParseInt32Flag("a=100", "a", &value)); EXPECT_EQ(123, value); } // Tests that ParseInt32Flag() returns false and doesn't change the // output value when the flag overflows as an Int32. TEST(ParseInt32FlagTest, ReturnsDefaultWhenValueOverflows) { printf("(expecting 2 warnings)\n"); Int32 value = 123; EXPECT_FALSE(ParseInt32Flag("--abc=12345678987654321", "abc", &value)); EXPECT_EQ(123, value); EXPECT_FALSE(ParseInt32Flag("--abc=-12345678987654321", "abc", &value)); EXPECT_EQ(123, value); } // Tests that ParseInt32Flag() returns false and doesn't change the // output value when the flag does not represent a valid decimal // integer. TEST(ParseInt32FlagTest, ReturnsDefaultWhenValueIsInvalid) { printf("(expecting 2 warnings)\n"); Int32 value = 123; EXPECT_FALSE(ParseInt32Flag("--abc=A1", "abc", &value)); EXPECT_EQ(123, value); EXPECT_FALSE(ParseInt32Flag("--abc=12X", "abc", &value)); EXPECT_EQ(123, value); } // Tests that ParseInt32Flag() parses the value of the flag and // returns true when the flag represents a valid decimal integer in // the range of an Int32. TEST(ParseInt32FlagTest, ParsesAndReturnsValidValue) { Int32 value = 123; EXPECT_TRUE(ParseInt32Flag("--" GTEST_FLAG_PREFIX_ "abc=456", "abc", &value)); EXPECT_EQ(456, value); EXPECT_TRUE(ParseInt32Flag("--" GTEST_FLAG_PREFIX_ "abc=-789", "abc", &value)); EXPECT_EQ(-789, value); } // Tests that Int32FromEnvOrDie() parses the value of the var or // returns the correct default. // Environment variables are not supported on Windows CE. #if !GTEST_OS_WINDOWS_MOBILE TEST(Int32FromEnvOrDieTest, ParsesAndReturnsValidValue) { EXPECT_EQ(333, Int32FromEnvOrDie(GTEST_FLAG_PREFIX_UPPER_ "UnsetVar", 333)); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "UnsetVar", "123"); EXPECT_EQ(123, Int32FromEnvOrDie(GTEST_FLAG_PREFIX_UPPER_ "UnsetVar", 333)); SetEnv(GTEST_FLAG_PREFIX_UPPER_ "UnsetVar", "-123"); EXPECT_EQ(-123, Int32FromEnvOrDie(GTEST_FLAG_PREFIX_UPPER_ "UnsetVar", 333)); } #endif // !GTEST_OS_WINDOWS_MOBILE // Tests that Int32FromEnvOrDie() aborts with an error message // if the variable is not an Int32. TEST(Int32FromEnvOrDieDeathTest, AbortsOnFailure) { SetEnv(GTEST_FLAG_PREFIX_UPPER_ "VAR", "xxx"); EXPECT_DEATH_IF_SUPPORTED( Int32FromEnvOrDie(GTEST_FLAG_PREFIX_UPPER_ "VAR", 123), ".*"); } // Tests that Int32FromEnvOrDie() aborts with an error message // if the variable cannot be represnted by an Int32. TEST(Int32FromEnvOrDieDeathTest, AbortsOnInt32Overflow) { SetEnv(GTEST_FLAG_PREFIX_UPPER_ "VAR", "1234567891234567891234"); EXPECT_DEATH_IF_SUPPORTED( Int32FromEnvOrDie(GTEST_FLAG_PREFIX_UPPER_ "VAR", 123), ".*"); } // Tests that ShouldRunTestOnShard() selects all tests // where there is 1 shard. TEST(ShouldRunTestOnShardTest, IsPartitionWhenThereIsOneShard) { EXPECT_TRUE(ShouldRunTestOnShard(1, 0, 0)); EXPECT_TRUE(ShouldRunTestOnShard(1, 0, 1)); EXPECT_TRUE(ShouldRunTestOnShard(1, 0, 2)); EXPECT_TRUE(ShouldRunTestOnShard(1, 0, 3)); EXPECT_TRUE(ShouldRunTestOnShard(1, 0, 4)); } class ShouldShardTest : public testing::Test { protected: virtual void SetUp() { index_var_ = GTEST_FLAG_PREFIX_UPPER_ "INDEX"; total_var_ = GTEST_FLAG_PREFIX_UPPER_ "TOTAL"; } virtual void TearDown() { SetEnv(index_var_, ""); SetEnv(total_var_, ""); } const char* index_var_; const char* total_var_; }; // Tests that sharding is disabled if neither of the environment variables // are set. TEST_F(ShouldShardTest, ReturnsFalseWhenNeitherEnvVarIsSet) { SetEnv(index_var_, ""); SetEnv(total_var_, ""); EXPECT_FALSE(ShouldShard(total_var_, index_var_, false)); EXPECT_FALSE(ShouldShard(total_var_, index_var_, true)); } // Tests that sharding is not enabled if total_shards == 1. TEST_F(ShouldShardTest, ReturnsFalseWhenTotalShardIsOne) { SetEnv(index_var_, "0"); SetEnv(total_var_, "1"); EXPECT_FALSE(ShouldShard(total_var_, index_var_, false)); EXPECT_FALSE(ShouldShard(total_var_, index_var_, true)); } // Tests that sharding is enabled if total_shards > 1 and // we are not in a death test subprocess. // Environment variables are not supported on Windows CE. #if !GTEST_OS_WINDOWS_MOBILE TEST_F(ShouldShardTest, WorksWhenShardEnvVarsAreValid) { SetEnv(index_var_, "4"); SetEnv(total_var_, "22"); EXPECT_TRUE(ShouldShard(total_var_, index_var_, false)); EXPECT_FALSE(ShouldShard(total_var_, index_var_, true)); SetEnv(index_var_, "8"); SetEnv(total_var_, "9"); EXPECT_TRUE(ShouldShard(total_var_, index_var_, false)); EXPECT_FALSE(ShouldShard(total_var_, index_var_, true)); SetEnv(index_var_, "0"); SetEnv(total_var_, "9"); EXPECT_TRUE(ShouldShard(total_var_, index_var_, false)); EXPECT_FALSE(ShouldShard(total_var_, index_var_, true)); } #endif // !GTEST_OS_WINDOWS_MOBILE // Tests that we exit in error if the sharding values are not valid. typedef ShouldShardTest ShouldShardDeathTest; TEST_F(ShouldShardDeathTest, AbortsWhenShardingEnvVarsAreInvalid) { SetEnv(index_var_, "4"); SetEnv(total_var_, "4"); EXPECT_DEATH_IF_SUPPORTED(ShouldShard(total_var_, index_var_, false), ".*"); SetEnv(index_var_, "4"); SetEnv(total_var_, "-2"); EXPECT_DEATH_IF_SUPPORTED(ShouldShard(total_var_, index_var_, false), ".*"); SetEnv(index_var_, "5"); SetEnv(total_var_, ""); EXPECT_DEATH_IF_SUPPORTED(ShouldShard(total_var_, index_var_, false), ".*"); SetEnv(index_var_, ""); SetEnv(total_var_, "5"); EXPECT_DEATH_IF_SUPPORTED(ShouldShard(total_var_, index_var_, false), ".*"); } // Tests that ShouldRunTestOnShard is a partition when 5 // shards are used. TEST(ShouldRunTestOnShardTest, IsPartitionWhenThereAreFiveShards) { // Choose an arbitrary number of tests and shards. const int num_tests = 17; const int num_shards = 5; // Check partitioning: each test should be on exactly 1 shard. for (int test_id = 0; test_id < num_tests; test_id++) { int prev_selected_shard_index = -1; for (int shard_index = 0; shard_index < num_shards; shard_index++) { if (ShouldRunTestOnShard(num_shards, shard_index, test_id)) { if (prev_selected_shard_index < 0) { prev_selected_shard_index = shard_index; } else { ADD_FAILURE() << "Shard " << prev_selected_shard_index << " and " << shard_index << " are both selected to run test " << test_id; } } } } // Check balance: This is not required by the sharding protocol, but is a // desirable property for performance. for (int shard_index = 0; shard_index < num_shards; shard_index++) { int num_tests_on_shard = 0; for (int test_id = 0; test_id < num_tests; test_id++) { num_tests_on_shard += ShouldRunTestOnShard(num_shards, shard_index, test_id); } EXPECT_GE(num_tests_on_shard, num_tests / num_shards); } } // For the same reason we are not explicitly testing everything in the // Test class, there are no separate tests for the following classes // (except for some trivial cases): // // TestCase, UnitTest, UnitTestResultPrinter. // // Similarly, there are no separate tests for the following macros: // // TEST, TEST_F, RUN_ALL_TESTS TEST(UnitTestTest, CanGetOriginalWorkingDir) { ASSERT_TRUE(UnitTest::GetInstance()->original_working_dir() != NULL); EXPECT_STRNE(UnitTest::GetInstance()->original_working_dir(), ""); } // This group of tests is for predicate assertions (ASSERT_PRED*, etc) // of various arities. They do not attempt to be exhaustive. Rather, // view them as smoke tests that can be easily reviewed and verified. // A more complete set of tests for predicate assertions can be found // in gtest_pred_impl_unittest.cc. // First, some predicates and predicate-formatters needed by the tests. // Returns true iff the argument is an even number. bool IsEven(int n) { return (n % 2) == 0; } // A functor that returns true iff the argument is an even number. struct IsEvenFunctor { bool operator()(int n) { return IsEven(n); } }; // A predicate-formatter function that asserts the argument is an even // number. AssertionResult AssertIsEven(const char* expr, int n) { if (IsEven(n)) { return AssertionSuccess(); } Message msg; msg << expr << " evaluates to " << n << ", which is not even."; return AssertionFailure(msg); } // A predicate function that returns AssertionResult for use in // EXPECT/ASSERT_TRUE/FALSE. AssertionResult ResultIsEven(int n) { if (IsEven(n)) return AssertionSuccess() << n << " is even"; else return AssertionFailure() << n << " is odd"; } // A predicate function that returns AssertionResult but gives no // explanation why it succeeds. Needed for testing that // EXPECT/ASSERT_FALSE handles such functions correctly. AssertionResult ResultIsEvenNoExplanation(int n) { if (IsEven(n)) return AssertionSuccess(); else return AssertionFailure() << n << " is odd"; } // A predicate-formatter functor that asserts the argument is an even // number. struct AssertIsEvenFunctor { AssertionResult operator()(const char* expr, int n) { return AssertIsEven(expr, n); } }; // Returns true iff the sum of the arguments is an even number. bool SumIsEven2(int n1, int n2) { return IsEven(n1 + n2); } // A functor that returns true iff the sum of the arguments is an even // number. struct SumIsEven3Functor { bool operator()(int n1, int n2, int n3) { return IsEven(n1 + n2 + n3); } }; // A predicate-formatter function that asserts the sum of the // arguments is an even number. AssertionResult AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) { const int sum = n1 + n2 + n3 + n4; if (IsEven(sum)) { return AssertionSuccess(); } Message msg; msg << e1 << " + " << e2 << " + " << e3 << " + " << e4 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4 << ") evaluates to " << sum << ", which is not even."; return AssertionFailure(msg); } // A predicate-formatter functor that asserts the sum of the arguments // is an even number. struct AssertSumIsEven5Functor { AssertionResult operator()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) { const int sum = n1 + n2 + n3 + n4 + n5; if (IsEven(sum)) { return AssertionSuccess(); } Message msg; msg << e1 << " + " << e2 << " + " << e3 << " + " << e4 << " + " << e5 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 << ") evaluates to " << sum << ", which is not even."; return AssertionFailure(msg); } }; // Tests unary predicate assertions. // Tests unary predicate assertions that don't use a custom formatter. TEST(Pred1Test, WithoutFormat) { // Success cases. EXPECT_PRED1(IsEvenFunctor(), 2) << "This failure is UNEXPECTED!"; ASSERT_PRED1(IsEven, 4); // Failure cases. EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED1(IsEven, 5) << "This failure is expected."; }, "This failure is expected."); EXPECT_FATAL_FAILURE(ASSERT_PRED1(IsEvenFunctor(), 5), "evaluates to false"); } // Tests unary predicate assertions that use a custom formatter. TEST(Pred1Test, WithFormat) { // Success cases. EXPECT_PRED_FORMAT1(AssertIsEven, 2); ASSERT_PRED_FORMAT1(AssertIsEvenFunctor(), 4) << "This failure is UNEXPECTED!"; // Failure cases. const int n = 5; EXPECT_NONFATAL_FAILURE(EXPECT_PRED_FORMAT1(AssertIsEvenFunctor(), n), "n evaluates to 5, which is not even."); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(AssertIsEven, 5) << "This failure is expected."; }, "This failure is expected."); } // Tests that unary predicate assertions evaluates their arguments // exactly once. TEST(Pred1Test, SingleEvaluationOnFailure) { // A success case. static int n = 0; EXPECT_PRED1(IsEven, n++); EXPECT_EQ(1, n) << "The argument is not evaluated exactly once."; // A failure case. EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT1(AssertIsEvenFunctor(), n++) << "This failure is expected."; }, "This failure is expected."); EXPECT_EQ(2, n) << "The argument is not evaluated exactly once."; } // Tests predicate assertions whose arity is >= 2. // Tests predicate assertions that don't use a custom formatter. TEST(PredTest, WithoutFormat) { // Success cases. ASSERT_PRED2(SumIsEven2, 2, 4) << "This failure is UNEXPECTED!"; EXPECT_PRED3(SumIsEven3Functor(), 4, 6, 8); // Failure cases. const int n1 = 1; const int n2 = 2; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED2(SumIsEven2, n1, n2) << "This failure is expected."; }, "This failure is expected."); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED3(SumIsEven3Functor(), 1, 2, 4); }, "evaluates to false"); } // Tests predicate assertions that use a custom formatter. TEST(PredTest, WithFormat) { // Success cases. ASSERT_PRED_FORMAT4(AssertSumIsEven4, 4, 6, 8, 10) << "This failure is UNEXPECTED!"; EXPECT_PRED_FORMAT5(AssertSumIsEven5Functor(), 2, 4, 6, 8, 10); // Failure cases. const int n1 = 1; const int n2 = 2; const int n3 = 4; const int n4 = 6; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(AssertSumIsEven4, n1, n2, n3, n4); }, "evaluates to 13, which is not even."); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT5(AssertSumIsEven5Functor(), 1, 2, 4, 6, 8) << "This failure is expected."; }, "This failure is expected."); } // Tests that predicate assertions evaluates their arguments // exactly once. TEST(PredTest, SingleEvaluationOnFailure) { // A success case. int n1 = 0; int n2 = 0; EXPECT_PRED2(SumIsEven2, n1++, n2++); EXPECT_EQ(1, n1) << "Argument 1 is not evaluated exactly once."; EXPECT_EQ(1, n2) << "Argument 2 is not evaluated exactly once."; // Another success case. n1 = n2 = 0; int n3 = 0; int n4 = 0; int n5 = 0; ASSERT_PRED_FORMAT5(AssertSumIsEven5Functor(), n1++, n2++, n3++, n4++, n5++) << "This failure is UNEXPECTED!"; EXPECT_EQ(1, n1) << "Argument 1 is not evaluated exactly once."; EXPECT_EQ(1, n2) << "Argument 2 is not evaluated exactly once."; EXPECT_EQ(1, n3) << "Argument 3 is not evaluated exactly once."; EXPECT_EQ(1, n4) << "Argument 4 is not evaluated exactly once."; EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; // A failure case. n1 = n2 = n3 = 0; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED3(SumIsEven3Functor(), ++n1, n2++, n3++) << "This failure is expected."; }, "This failure is expected."); EXPECT_EQ(1, n1) << "Argument 1 is not evaluated exactly once."; EXPECT_EQ(1, n2) << "Argument 2 is not evaluated exactly once."; EXPECT_EQ(1, n3) << "Argument 3 is not evaluated exactly once."; // Another failure case. n1 = n2 = n3 = n4 = 0; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT4(AssertSumIsEven4, ++n1, n2++, n3++, n4++); }, "evaluates to 1, which is not even."); EXPECT_EQ(1, n1) << "Argument 1 is not evaluated exactly once."; EXPECT_EQ(1, n2) << "Argument 2 is not evaluated exactly once."; EXPECT_EQ(1, n3) << "Argument 3 is not evaluated exactly once."; EXPECT_EQ(1, n4) << "Argument 4 is not evaluated exactly once."; } // Some helper functions for testing using overloaded/template // functions with ASSERT_PREDn and EXPECT_PREDn. bool IsPositive(double x) { return x > 0; } template bool IsNegative(T x) { return x < 0; } template bool GreaterThan(T1 x1, T2 x2) { return x1 > x2; } // Tests that overloaded functions can be used in *_PRED* as long as // their types are explicitly specified. TEST(PredicateAssertionTest, AcceptsOverloadedFunction) { // C++Builder requires C-style casts rather than static_cast. EXPECT_PRED1((bool (*)(int))(IsPositive), 5); // NOLINT ASSERT_PRED1((bool (*)(double))(IsPositive), 6.0); // NOLINT } // Tests that template functions can be used in *_PRED* as long as // their types are explicitly specified. TEST(PredicateAssertionTest, AcceptsTemplateFunction) { EXPECT_PRED1(IsNegative, -5); // Makes sure that we can handle templates with more than one // parameter. ASSERT_PRED2((GreaterThan), 5, 0); } // Some helper functions for testing using overloaded/template // functions with ASSERT_PRED_FORMATn and EXPECT_PRED_FORMATn. AssertionResult IsPositiveFormat(const char* /* expr */, int n) { return n > 0 ? AssertionSuccess() : AssertionFailure(Message() << "Failure"); } AssertionResult IsPositiveFormat(const char* /* expr */, double x) { return x > 0 ? AssertionSuccess() : AssertionFailure(Message() << "Failure"); } template AssertionResult IsNegativeFormat(const char* /* expr */, T x) { return x < 0 ? AssertionSuccess() : AssertionFailure(Message() << "Failure"); } template AssertionResult EqualsFormat(const char* /* expr1 */, const char* /* expr2 */, const T1& x1, const T2& x2) { return x1 == x2 ? AssertionSuccess() : AssertionFailure(Message() << "Failure"); } // Tests that overloaded functions can be used in *_PRED_FORMAT* // without explicitly specifying their types. TEST(PredicateFormatAssertionTest, AcceptsOverloadedFunction) { EXPECT_PRED_FORMAT1(IsPositiveFormat, 5); ASSERT_PRED_FORMAT1(IsPositiveFormat, 6.0); } // Tests that template functions can be used in *_PRED_FORMAT* without // explicitly specifying their types. TEST(PredicateFormatAssertionTest, AcceptsTemplateFunction) { EXPECT_PRED_FORMAT1(IsNegativeFormat, -5); ASSERT_PRED_FORMAT2(EqualsFormat, 3, 3); } // Tests string assertions. // Tests ASSERT_STREQ with non-NULL arguments. TEST(StringAssertionTest, ASSERT_STREQ) { const char * const p1 = "good"; ASSERT_STREQ(p1, p1); // Let p2 have the same content as p1, but be at a different address. const char p2[] = "good"; ASSERT_STREQ(p1, p2); EXPECT_FATAL_FAILURE(ASSERT_STREQ("bad", "good"), "Expected: \"bad\""); } // Tests ASSERT_STREQ with NULL arguments. TEST(StringAssertionTest, ASSERT_STREQ_Null) { ASSERT_STREQ(static_cast(NULL), NULL); EXPECT_FATAL_FAILURE(ASSERT_STREQ(NULL, "non-null"), "non-null"); } // Tests ASSERT_STREQ with NULL arguments. TEST(StringAssertionTest, ASSERT_STREQ_Null2) { EXPECT_FATAL_FAILURE(ASSERT_STREQ("non-null", NULL), "non-null"); } // Tests ASSERT_STRNE. TEST(StringAssertionTest, ASSERT_STRNE) { ASSERT_STRNE("hi", "Hi"); ASSERT_STRNE("Hi", NULL); ASSERT_STRNE(NULL, "Hi"); ASSERT_STRNE("", NULL); ASSERT_STRNE(NULL, ""); ASSERT_STRNE("", "Hi"); ASSERT_STRNE("Hi", ""); EXPECT_FATAL_FAILURE(ASSERT_STRNE("Hi", "Hi"), "\"Hi\" vs \"Hi\""); } // Tests ASSERT_STRCASEEQ. TEST(StringAssertionTest, ASSERT_STRCASEEQ) { ASSERT_STRCASEEQ("hi", "Hi"); ASSERT_STRCASEEQ(static_cast(NULL), NULL); ASSERT_STRCASEEQ("", ""); EXPECT_FATAL_FAILURE(ASSERT_STRCASEEQ("Hi", "hi2"), "(ignoring case)"); } // Tests ASSERT_STRCASENE. TEST(StringAssertionTest, ASSERT_STRCASENE) { ASSERT_STRCASENE("hi1", "Hi2"); ASSERT_STRCASENE("Hi", NULL); ASSERT_STRCASENE(NULL, "Hi"); ASSERT_STRCASENE("", NULL); ASSERT_STRCASENE(NULL, ""); ASSERT_STRCASENE("", "Hi"); ASSERT_STRCASENE("Hi", ""); EXPECT_FATAL_FAILURE(ASSERT_STRCASENE("Hi", "hi"), "(ignoring case)"); } // Tests *_STREQ on wide strings. TEST(StringAssertionTest, STREQ_Wide) { // NULL strings. ASSERT_STREQ(static_cast(NULL), NULL); // Empty strings. ASSERT_STREQ(L"", L""); // Non-null vs NULL. EXPECT_NONFATAL_FAILURE(EXPECT_STREQ(L"non-null", NULL), "non-null"); // Equal strings. EXPECT_STREQ(L"Hi", L"Hi"); // Unequal strings. EXPECT_NONFATAL_FAILURE(EXPECT_STREQ(L"abc", L"Abc"), "Abc"); // Strings containing wide characters. EXPECT_NONFATAL_FAILURE(EXPECT_STREQ(L"abc\x8119", L"abc\x8120"), "abc"); } // Tests *_STRNE on wide strings. TEST(StringAssertionTest, STRNE_Wide) { // NULL strings. EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_STRNE(static_cast(NULL), NULL); }, ""); // Empty strings. EXPECT_NONFATAL_FAILURE(EXPECT_STRNE(L"", L""), "L\"\""); // Non-null vs NULL. ASSERT_STRNE(L"non-null", NULL); // Equal strings. EXPECT_NONFATAL_FAILURE(EXPECT_STRNE(L"Hi", L"Hi"), "L\"Hi\""); // Unequal strings. EXPECT_STRNE(L"abc", L"Abc"); // Strings containing wide characters. EXPECT_NONFATAL_FAILURE(EXPECT_STRNE(L"abc\x8119", L"abc\x8119"), "abc"); } // Tests for ::testing::IsSubstring(). // Tests that IsSubstring() returns the correct result when the input // argument type is const char*. TEST(IsSubstringTest, ReturnsCorrectResultForCString) { EXPECT_FALSE(IsSubstring("", "", NULL, "a")); EXPECT_FALSE(IsSubstring("", "", "b", NULL)); EXPECT_FALSE(IsSubstring("", "", "needle", "haystack")); EXPECT_TRUE(IsSubstring("", "", static_cast(NULL), NULL)); EXPECT_TRUE(IsSubstring("", "", "needle", "two needles")); } // Tests that IsSubstring() returns the correct result when the input // argument type is const wchar_t*. TEST(IsSubstringTest, ReturnsCorrectResultForWideCString) { EXPECT_FALSE(IsSubstring("", "", kNull, L"a")); EXPECT_FALSE(IsSubstring("", "", L"b", kNull)); EXPECT_FALSE(IsSubstring("", "", L"needle", L"haystack")); EXPECT_TRUE(IsSubstring("", "", static_cast(NULL), NULL)); EXPECT_TRUE(IsSubstring("", "", L"needle", L"two needles")); } // Tests that IsSubstring() generates the correct message when the input // argument type is const char*. TEST(IsSubstringTest, GeneratesCorrectMessageForCString) { EXPECT_STREQ("Value of: needle_expr\n" " Actual: \"needle\"\n" "Expected: a substring of haystack_expr\n" "Which is: \"haystack\"", IsSubstring("needle_expr", "haystack_expr", "needle", "haystack").failure_message()); } // Tests that IsSubstring returns the correct result when the input // argument type is ::std::string. TEST(IsSubstringTest, ReturnsCorrectResultsForStdString) { EXPECT_TRUE(IsSubstring("", "", std::string("hello"), "ahellob")); EXPECT_FALSE(IsSubstring("", "", "hello", std::string("world"))); } #if GTEST_HAS_STD_WSTRING // Tests that IsSubstring returns the correct result when the input // argument type is ::std::wstring. TEST(IsSubstringTest, ReturnsCorrectResultForStdWstring) { EXPECT_TRUE(IsSubstring("", "", ::std::wstring(L"needle"), L"two needles")); EXPECT_FALSE(IsSubstring("", "", L"needle", ::std::wstring(L"haystack"))); } // Tests that IsSubstring() generates the correct message when the input // argument type is ::std::wstring. TEST(IsSubstringTest, GeneratesCorrectMessageForWstring) { EXPECT_STREQ("Value of: needle_expr\n" " Actual: L\"needle\"\n" "Expected: a substring of haystack_expr\n" "Which is: L\"haystack\"", IsSubstring( "needle_expr", "haystack_expr", ::std::wstring(L"needle"), L"haystack").failure_message()); } #endif // GTEST_HAS_STD_WSTRING // Tests for ::testing::IsNotSubstring(). // Tests that IsNotSubstring() returns the correct result when the input // argument type is const char*. TEST(IsNotSubstringTest, ReturnsCorrectResultForCString) { EXPECT_TRUE(IsNotSubstring("", "", "needle", "haystack")); EXPECT_FALSE(IsNotSubstring("", "", "needle", "two needles")); } // Tests that IsNotSubstring() returns the correct result when the input // argument type is const wchar_t*. TEST(IsNotSubstringTest, ReturnsCorrectResultForWideCString) { EXPECT_TRUE(IsNotSubstring("", "", L"needle", L"haystack")); EXPECT_FALSE(IsNotSubstring("", "", L"needle", L"two needles")); } // Tests that IsNotSubstring() generates the correct message when the input // argument type is const wchar_t*. TEST(IsNotSubstringTest, GeneratesCorrectMessageForWideCString) { EXPECT_STREQ("Value of: needle_expr\n" " Actual: L\"needle\"\n" "Expected: not a substring of haystack_expr\n" "Which is: L\"two needles\"", IsNotSubstring( "needle_expr", "haystack_expr", L"needle", L"two needles").failure_message()); } // Tests that IsNotSubstring returns the correct result when the input // argument type is ::std::string. TEST(IsNotSubstringTest, ReturnsCorrectResultsForStdString) { EXPECT_FALSE(IsNotSubstring("", "", std::string("hello"), "ahellob")); EXPECT_TRUE(IsNotSubstring("", "", "hello", std::string("world"))); } // Tests that IsNotSubstring() generates the correct message when the input // argument type is ::std::string. TEST(IsNotSubstringTest, GeneratesCorrectMessageForStdString) { EXPECT_STREQ("Value of: needle_expr\n" " Actual: \"needle\"\n" "Expected: not a substring of haystack_expr\n" "Which is: \"two needles\"", IsNotSubstring( "needle_expr", "haystack_expr", ::std::string("needle"), "two needles").failure_message()); } #if GTEST_HAS_STD_WSTRING // Tests that IsNotSubstring returns the correct result when the input // argument type is ::std::wstring. TEST(IsNotSubstringTest, ReturnsCorrectResultForStdWstring) { EXPECT_FALSE( IsNotSubstring("", "", ::std::wstring(L"needle"), L"two needles")); EXPECT_TRUE(IsNotSubstring("", "", L"needle", ::std::wstring(L"haystack"))); } #endif // GTEST_HAS_STD_WSTRING // Tests floating-point assertions. template class FloatingPointTest : public Test { protected: // Pre-calculated numbers to be used by the tests. struct TestValues { RawType close_to_positive_zero; RawType close_to_negative_zero; RawType further_from_negative_zero; RawType close_to_one; RawType further_from_one; RawType infinity; RawType close_to_infinity; RawType further_from_infinity; RawType nan1; RawType nan2; }; typedef typename testing::internal::FloatingPoint Floating; typedef typename Floating::Bits Bits; virtual void SetUp() { const size_t max_ulps = Floating::kMaxUlps; // The bits that represent 0.0. const Bits zero_bits = Floating(0).bits(); // Makes some numbers close to 0.0. values_.close_to_positive_zero = Floating::ReinterpretBits( zero_bits + max_ulps/2); values_.close_to_negative_zero = -Floating::ReinterpretBits( zero_bits + max_ulps - max_ulps/2); values_.further_from_negative_zero = -Floating::ReinterpretBits( zero_bits + max_ulps + 1 - max_ulps/2); // The bits that represent 1.0. const Bits one_bits = Floating(1).bits(); // Makes some numbers close to 1.0. values_.close_to_one = Floating::ReinterpretBits(one_bits + max_ulps); values_.further_from_one = Floating::ReinterpretBits( one_bits + max_ulps + 1); // +infinity. values_.infinity = Floating::Infinity(); // The bits that represent +infinity. const Bits infinity_bits = Floating(values_.infinity).bits(); // Makes some numbers close to infinity. values_.close_to_infinity = Floating::ReinterpretBits( infinity_bits - max_ulps); values_.further_from_infinity = Floating::ReinterpretBits( infinity_bits - max_ulps - 1); // Makes some NAN's. Sets the most significant bit of the fraction so that // our NaN's are quiet; trying to process a signaling NaN would raise an // exception if our environment enables floating point exceptions. values_.nan1 = Floating::ReinterpretBits(Floating::kExponentBitMask | (static_cast(1) << (Floating::kFractionBitCount - 1)) | 1); values_.nan2 = Floating::ReinterpretBits(Floating::kExponentBitMask | (static_cast(1) << (Floating::kFractionBitCount - 1)) | 200); } void TestSize() { EXPECT_EQ(sizeof(RawType), sizeof(Bits)); } static TestValues values_; }; template typename FloatingPointTest::TestValues FloatingPointTest::values_; // Instantiates FloatingPointTest for testing *_FLOAT_EQ. typedef FloatingPointTest FloatTest; // Tests that the size of Float::Bits matches the size of float. TEST_F(FloatTest, Size) { TestSize(); } // Tests comparing with +0 and -0. TEST_F(FloatTest, Zeros) { EXPECT_FLOAT_EQ(0.0, -0.0); EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(-0.0, 1.0), "1.0"); EXPECT_FATAL_FAILURE(ASSERT_FLOAT_EQ(0.0, 1.5), "1.5"); } // Tests comparing numbers close to 0. // // This ensures that *_FLOAT_EQ handles the sign correctly and no // overflow occurs when comparing numbers whose absolute value is very // small. TEST_F(FloatTest, AlmostZeros) { // In C++Builder, names within local classes (such as used by // EXPECT_FATAL_FAILURE) cannot be resolved against static members of the // scoping class. Use a static local alias as a workaround. // We use the assignment syntax since some compilers, like Sun Studio, // don't allow initializing references using construction syntax // (parentheses). static const FloatTest::TestValues& v = this->values_; EXPECT_FLOAT_EQ(0.0, v.close_to_positive_zero); EXPECT_FLOAT_EQ(-0.0, v.close_to_negative_zero); EXPECT_FLOAT_EQ(v.close_to_positive_zero, v.close_to_negative_zero); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_FLOAT_EQ(v.close_to_positive_zero, v.further_from_negative_zero); }, "v.further_from_negative_zero"); } // Tests comparing numbers close to each other. TEST_F(FloatTest, SmallDiff) { EXPECT_FLOAT_EQ(1.0, values_.close_to_one); EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(1.0, values_.further_from_one), "values_.further_from_one"); } // Tests comparing numbers far apart. TEST_F(FloatTest, LargeDiff) { EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(2.5, 3.0), "3.0"); } // Tests comparing with infinity. // // This ensures that no overflow occurs when comparing numbers whose // absolute value is very large. TEST_F(FloatTest, Infinity) { EXPECT_FLOAT_EQ(values_.infinity, values_.close_to_infinity); EXPECT_FLOAT_EQ(-values_.infinity, -values_.close_to_infinity); #if !GTEST_OS_SYMBIAN // Nokia's STLport crashes if we try to output infinity or NaN. EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(values_.infinity, -values_.infinity), "-values_.infinity"); // This is interesting as the representations of infinity and nan1 // are only 1 DLP apart. EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(values_.infinity, values_.nan1), "values_.nan1"); #endif // !GTEST_OS_SYMBIAN } // Tests that comparing with NAN always returns false. TEST_F(FloatTest, NaN) { #if !GTEST_OS_SYMBIAN // Nokia's STLport crashes if we try to output infinity or NaN. // In C++Builder, names within local classes (such as used by // EXPECT_FATAL_FAILURE) cannot be resolved against static members of the // scoping class. Use a static local alias as a workaround. // We use the assignment syntax since some compilers, like Sun Studio, // don't allow initializing references using construction syntax // (parentheses). static const FloatTest::TestValues& v = this->values_; EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(v.nan1, v.nan1), "v.nan1"); EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(v.nan1, v.nan2), "v.nan2"); EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(1.0, v.nan1), "v.nan1"); EXPECT_FATAL_FAILURE(ASSERT_FLOAT_EQ(v.nan1, v.infinity), "v.infinity"); #endif // !GTEST_OS_SYMBIAN } // Tests that *_FLOAT_EQ are reflexive. TEST_F(FloatTest, Reflexive) { EXPECT_FLOAT_EQ(0.0, 0.0); EXPECT_FLOAT_EQ(1.0, 1.0); ASSERT_FLOAT_EQ(values_.infinity, values_.infinity); } // Tests that *_FLOAT_EQ are commutative. TEST_F(FloatTest, Commutative) { // We already tested EXPECT_FLOAT_EQ(1.0, values_.close_to_one). EXPECT_FLOAT_EQ(values_.close_to_one, 1.0); // We already tested EXPECT_FLOAT_EQ(1.0, values_.further_from_one). EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(values_.further_from_one, 1.0), "1.0"); } // Tests EXPECT_NEAR. TEST_F(FloatTest, EXPECT_NEAR) { EXPECT_NEAR(-1.0f, -1.1f, 0.2f); EXPECT_NEAR(2.0f, 3.0f, 1.0f); EXPECT_NONFATAL_FAILURE(EXPECT_NEAR(1.0f,1.5f, 0.25f), // NOLINT "The difference between 1.0f and 1.5f is 0.5, " "which exceeds 0.25f"); // To work around a bug in gcc 2.95.0, there is intentionally no // space after the first comma in the previous line. } // Tests ASSERT_NEAR. TEST_F(FloatTest, ASSERT_NEAR) { ASSERT_NEAR(-1.0f, -1.1f, 0.2f); ASSERT_NEAR(2.0f, 3.0f, 1.0f); EXPECT_FATAL_FAILURE(ASSERT_NEAR(1.0f,1.5f, 0.25f), // NOLINT "The difference between 1.0f and 1.5f is 0.5, " "which exceeds 0.25f"); // To work around a bug in gcc 2.95.0, there is intentionally no // space after the first comma in the previous line. } // Tests the cases where FloatLE() should succeed. TEST_F(FloatTest, FloatLESucceeds) { EXPECT_PRED_FORMAT2(FloatLE, 1.0f, 2.0f); // When val1 < val2, ASSERT_PRED_FORMAT2(FloatLE, 1.0f, 1.0f); // val1 == val2, // or when val1 is greater than, but almost equals to, val2. EXPECT_PRED_FORMAT2(FloatLE, values_.close_to_positive_zero, 0.0f); } // Tests the cases where FloatLE() should fail. TEST_F(FloatTest, FloatLEFails) { // When val1 is greater than val2 by a large margin, EXPECT_NONFATAL_FAILURE(EXPECT_PRED_FORMAT2(FloatLE, 2.0f, 1.0f), "(2.0f) <= (1.0f)"); // or by a small yet non-negligible margin, EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(FloatLE, values_.further_from_one, 1.0f); }, "(values_.further_from_one) <= (1.0f)"); #if !GTEST_OS_SYMBIAN && !defined(__BORLANDC__) // Nokia's STLport crashes if we try to output infinity or NaN. // C++Builder gives bad results for ordered comparisons involving NaNs // due to compiler bugs. EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(FloatLE, values_.nan1, values_.infinity); }, "(values_.nan1) <= (values_.infinity)"); EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(FloatLE, -values_.infinity, values_.nan1); }, "(-values_.infinity) <= (values_.nan1)"); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(FloatLE, values_.nan1, values_.nan1); }, "(values_.nan1) <= (values_.nan1)"); #endif // !GTEST_OS_SYMBIAN && !defined(__BORLANDC__) } // Instantiates FloatingPointTest for testing *_DOUBLE_EQ. typedef FloatingPointTest DoubleTest; // Tests that the size of Double::Bits matches the size of double. TEST_F(DoubleTest, Size) { TestSize(); } // Tests comparing with +0 and -0. TEST_F(DoubleTest, Zeros) { EXPECT_DOUBLE_EQ(0.0, -0.0); EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(-0.0, 1.0), "1.0"); EXPECT_FATAL_FAILURE(ASSERT_DOUBLE_EQ(0.0, 1.0), "1.0"); } // Tests comparing numbers close to 0. // // This ensures that *_DOUBLE_EQ handles the sign correctly and no // overflow occurs when comparing numbers whose absolute value is very // small. TEST_F(DoubleTest, AlmostZeros) { // In C++Builder, names within local classes (such as used by // EXPECT_FATAL_FAILURE) cannot be resolved against static members of the // scoping class. Use a static local alias as a workaround. // We use the assignment syntax since some compilers, like Sun Studio, // don't allow initializing references using construction syntax // (parentheses). static const DoubleTest::TestValues& v = this->values_; EXPECT_DOUBLE_EQ(0.0, v.close_to_positive_zero); EXPECT_DOUBLE_EQ(-0.0, v.close_to_negative_zero); EXPECT_DOUBLE_EQ(v.close_to_positive_zero, v.close_to_negative_zero); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_DOUBLE_EQ(v.close_to_positive_zero, v.further_from_negative_zero); }, "v.further_from_negative_zero"); } // Tests comparing numbers close to each other. TEST_F(DoubleTest, SmallDiff) { EXPECT_DOUBLE_EQ(1.0, values_.close_to_one); EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(1.0, values_.further_from_one), "values_.further_from_one"); } // Tests comparing numbers far apart. TEST_F(DoubleTest, LargeDiff) { EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(2.0, 3.0), "3.0"); } // Tests comparing with infinity. // // This ensures that no overflow occurs when comparing numbers whose // absolute value is very large. TEST_F(DoubleTest, Infinity) { EXPECT_DOUBLE_EQ(values_.infinity, values_.close_to_infinity); EXPECT_DOUBLE_EQ(-values_.infinity, -values_.close_to_infinity); #if !GTEST_OS_SYMBIAN // Nokia's STLport crashes if we try to output infinity or NaN. EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(values_.infinity, -values_.infinity), "-values_.infinity"); // This is interesting as the representations of infinity_ and nan1_ // are only 1 DLP apart. EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(values_.infinity, values_.nan1), "values_.nan1"); #endif // !GTEST_OS_SYMBIAN } // Tests that comparing with NAN always returns false. TEST_F(DoubleTest, NaN) { #if !GTEST_OS_SYMBIAN // In C++Builder, names within local classes (such as used by // EXPECT_FATAL_FAILURE) cannot be resolved against static members of the // scoping class. Use a static local alias as a workaround. // We use the assignment syntax since some compilers, like Sun Studio, // don't allow initializing references using construction syntax // (parentheses). static const DoubleTest::TestValues& v = this->values_; // Nokia's STLport crashes if we try to output infinity or NaN. EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(v.nan1, v.nan1), "v.nan1"); EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(v.nan1, v.nan2), "v.nan2"); EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(1.0, v.nan1), "v.nan1"); EXPECT_FATAL_FAILURE(ASSERT_DOUBLE_EQ(v.nan1, v.infinity), "v.infinity"); #endif // !GTEST_OS_SYMBIAN } // Tests that *_DOUBLE_EQ are reflexive. TEST_F(DoubleTest, Reflexive) { EXPECT_DOUBLE_EQ(0.0, 0.0); EXPECT_DOUBLE_EQ(1.0, 1.0); #if !GTEST_OS_SYMBIAN // Nokia's STLport crashes if we try to output infinity or NaN. ASSERT_DOUBLE_EQ(values_.infinity, values_.infinity); #endif // !GTEST_OS_SYMBIAN } // Tests that *_DOUBLE_EQ are commutative. TEST_F(DoubleTest, Commutative) { // We already tested EXPECT_DOUBLE_EQ(1.0, values_.close_to_one). EXPECT_DOUBLE_EQ(values_.close_to_one, 1.0); // We already tested EXPECT_DOUBLE_EQ(1.0, values_.further_from_one). EXPECT_NONFATAL_FAILURE(EXPECT_DOUBLE_EQ(values_.further_from_one, 1.0), "1.0"); } // Tests EXPECT_NEAR. TEST_F(DoubleTest, EXPECT_NEAR) { EXPECT_NEAR(-1.0, -1.1, 0.2); EXPECT_NEAR(2.0, 3.0, 1.0); EXPECT_NONFATAL_FAILURE(EXPECT_NEAR(1.0, 1.5, 0.25), // NOLINT "The difference between 1.0 and 1.5 is 0.5, " "which exceeds 0.25"); // To work around a bug in gcc 2.95.0, there is intentionally no // space after the first comma in the previous statement. } // Tests ASSERT_NEAR. TEST_F(DoubleTest, ASSERT_NEAR) { ASSERT_NEAR(-1.0, -1.1, 0.2); ASSERT_NEAR(2.0, 3.0, 1.0); EXPECT_FATAL_FAILURE(ASSERT_NEAR(1.0, 1.5, 0.25), // NOLINT "The difference between 1.0 and 1.5 is 0.5, " "which exceeds 0.25"); // To work around a bug in gcc 2.95.0, there is intentionally no // space after the first comma in the previous statement. } // Tests the cases where DoubleLE() should succeed. TEST_F(DoubleTest, DoubleLESucceeds) { EXPECT_PRED_FORMAT2(DoubleLE, 1.0, 2.0); // When val1 < val2, ASSERT_PRED_FORMAT2(DoubleLE, 1.0, 1.0); // val1 == val2, // or when val1 is greater than, but almost equals to, val2. EXPECT_PRED_FORMAT2(DoubleLE, values_.close_to_positive_zero, 0.0); } // Tests the cases where DoubleLE() should fail. TEST_F(DoubleTest, DoubleLEFails) { // When val1 is greater than val2 by a large margin, EXPECT_NONFATAL_FAILURE(EXPECT_PRED_FORMAT2(DoubleLE, 2.0, 1.0), "(2.0) <= (1.0)"); // or by a small yet non-negligible margin, EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(DoubleLE, values_.further_from_one, 1.0); }, "(values_.further_from_one) <= (1.0)"); #if !GTEST_OS_SYMBIAN && !defined(__BORLANDC__) // Nokia's STLport crashes if we try to output infinity or NaN. // C++Builder gives bad results for ordered comparisons involving NaNs // due to compiler bugs. EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(DoubleLE, values_.nan1, values_.infinity); }, "(values_.nan1) <= (values_.infinity)"); EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_PRED_FORMAT2(DoubleLE, -values_.infinity, values_.nan1); }, " (-values_.infinity) <= (values_.nan1)"); EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_PRED_FORMAT2(DoubleLE, values_.nan1, values_.nan1); }, "(values_.nan1) <= (values_.nan1)"); #endif // !GTEST_OS_SYMBIAN && !defined(__BORLANDC__) } // Verifies that a test or test case whose name starts with DISABLED_ is // not run. // A test whose name starts with DISABLED_. // Should not run. TEST(DisabledTest, DISABLED_TestShouldNotRun) { FAIL() << "Unexpected failure: Disabled test should not be run."; } // A test whose name does not start with DISABLED_. // Should run. TEST(DisabledTest, NotDISABLED_TestShouldRun) { EXPECT_EQ(1, 1); } // A test case whose name starts with DISABLED_. // Should not run. TEST(DISABLED_TestCase, TestShouldNotRun) { FAIL() << "Unexpected failure: Test in disabled test case should not be run."; } // A test case and test whose names start with DISABLED_. // Should not run. TEST(DISABLED_TestCase, DISABLED_TestShouldNotRun) { FAIL() << "Unexpected failure: Test in disabled test case should not be run."; } // Check that when all tests in a test case are disabled, SetupTestCase() and // TearDownTestCase() are not called. class DisabledTestsTest : public Test { protected: static void SetUpTestCase() { FAIL() << "Unexpected failure: All tests disabled in test case. " "SetupTestCase() should not be called."; } static void TearDownTestCase() { FAIL() << "Unexpected failure: All tests disabled in test case. " "TearDownTestCase() should not be called."; } }; TEST_F(DisabledTestsTest, DISABLED_TestShouldNotRun_1) { FAIL() << "Unexpected failure: Disabled test should not be run."; } TEST_F(DisabledTestsTest, DISABLED_TestShouldNotRun_2) { FAIL() << "Unexpected failure: Disabled test should not be run."; } // Tests that disabled typed tests aren't run. #if GTEST_HAS_TYPED_TEST template class TypedTest : public Test { }; typedef testing::Types NumericTypes; TYPED_TEST_CASE(TypedTest, NumericTypes); TYPED_TEST(TypedTest, DISABLED_ShouldNotRun) { FAIL() << "Unexpected failure: Disabled typed test should not run."; } template class DISABLED_TypedTest : public Test { }; TYPED_TEST_CASE(DISABLED_TypedTest, NumericTypes); TYPED_TEST(DISABLED_TypedTest, ShouldNotRun) { FAIL() << "Unexpected failure: Disabled typed test should not run."; } #endif // GTEST_HAS_TYPED_TEST // Tests that disabled type-parameterized tests aren't run. #if GTEST_HAS_TYPED_TEST_P template class TypedTestP : public Test { }; TYPED_TEST_CASE_P(TypedTestP); TYPED_TEST_P(TypedTestP, DISABLED_ShouldNotRun) { FAIL() << "Unexpected failure: " << "Disabled type-parameterized test should not run."; } REGISTER_TYPED_TEST_CASE_P(TypedTestP, DISABLED_ShouldNotRun); INSTANTIATE_TYPED_TEST_CASE_P(My, TypedTestP, NumericTypes); template class DISABLED_TypedTestP : public Test { }; TYPED_TEST_CASE_P(DISABLED_TypedTestP); TYPED_TEST_P(DISABLED_TypedTestP, ShouldNotRun) { FAIL() << "Unexpected failure: " << "Disabled type-parameterized test should not run."; } REGISTER_TYPED_TEST_CASE_P(DISABLED_TypedTestP, ShouldNotRun); INSTANTIATE_TYPED_TEST_CASE_P(My, DISABLED_TypedTestP, NumericTypes); #endif // GTEST_HAS_TYPED_TEST_P // Tests that assertion macros evaluate their arguments exactly once. class SingleEvaluationTest : public Test { public: // Must be public and not protected due to a bug in g++ 3.4.2. // This helper function is needed by the FailedASSERT_STREQ test // below. It's public to work around C++Builder's bug with scoping local // classes. static void CompareAndIncrementCharPtrs() { ASSERT_STREQ(p1_++, p2_++); } // This helper function is needed by the FailedASSERT_NE test below. It's // public to work around C++Builder's bug with scoping local classes. static void CompareAndIncrementInts() { ASSERT_NE(a_++, b_++); } protected: SingleEvaluationTest() { p1_ = s1_; p2_ = s2_; a_ = 0; b_ = 0; } static const char* const s1_; static const char* const s2_; static const char* p1_; static const char* p2_; static int a_; static int b_; }; const char* const SingleEvaluationTest::s1_ = "01234"; const char* const SingleEvaluationTest::s2_ = "abcde"; const char* SingleEvaluationTest::p1_; const char* SingleEvaluationTest::p2_; int SingleEvaluationTest::a_; int SingleEvaluationTest::b_; // Tests that when ASSERT_STREQ fails, it evaluates its arguments // exactly once. TEST_F(SingleEvaluationTest, FailedASSERT_STREQ) { EXPECT_FATAL_FAILURE(SingleEvaluationTest::CompareAndIncrementCharPtrs(), "p2_++"); EXPECT_EQ(s1_ + 1, p1_); EXPECT_EQ(s2_ + 1, p2_); } // Tests that string assertion arguments are evaluated exactly once. TEST_F(SingleEvaluationTest, ASSERT_STR) { // successful EXPECT_STRNE EXPECT_STRNE(p1_++, p2_++); EXPECT_EQ(s1_ + 1, p1_); EXPECT_EQ(s2_ + 1, p2_); // failed EXPECT_STRCASEEQ EXPECT_NONFATAL_FAILURE(EXPECT_STRCASEEQ(p1_++, p2_++), "ignoring case"); EXPECT_EQ(s1_ + 2, p1_); EXPECT_EQ(s2_ + 2, p2_); } // Tests that when ASSERT_NE fails, it evaluates its arguments exactly // once. TEST_F(SingleEvaluationTest, FailedASSERT_NE) { EXPECT_FATAL_FAILURE(SingleEvaluationTest::CompareAndIncrementInts(), "(a_++) != (b_++)"); EXPECT_EQ(1, a_); EXPECT_EQ(1, b_); } // Tests that assertion arguments are evaluated exactly once. TEST_F(SingleEvaluationTest, OtherCases) { // successful EXPECT_TRUE EXPECT_TRUE(0 == a_++); // NOLINT EXPECT_EQ(1, a_); // failed EXPECT_TRUE EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(-1 == a_++), "-1 == a_++"); EXPECT_EQ(2, a_); // successful EXPECT_GT EXPECT_GT(a_++, b_++); EXPECT_EQ(3, a_); EXPECT_EQ(1, b_); // failed EXPECT_LT EXPECT_NONFATAL_FAILURE(EXPECT_LT(a_++, b_++), "(a_++) < (b_++)"); EXPECT_EQ(4, a_); EXPECT_EQ(2, b_); // successful ASSERT_TRUE ASSERT_TRUE(0 < a_++); // NOLINT EXPECT_EQ(5, a_); // successful ASSERT_GT ASSERT_GT(a_++, b_++); EXPECT_EQ(6, a_); EXPECT_EQ(3, b_); } #if GTEST_HAS_EXCEPTIONS void ThrowAnInteger() { throw 1; } // Tests that assertion arguments are evaluated exactly once. TEST_F(SingleEvaluationTest, ExceptionTests) { // successful EXPECT_THROW EXPECT_THROW({ // NOLINT a_++; ThrowAnInteger(); }, int); EXPECT_EQ(1, a_); // failed EXPECT_THROW, throws different EXPECT_NONFATAL_FAILURE(EXPECT_THROW({ // NOLINT a_++; ThrowAnInteger(); }, bool), "throws a different type"); EXPECT_EQ(2, a_); // failed EXPECT_THROW, throws nothing EXPECT_NONFATAL_FAILURE(EXPECT_THROW(a_++, bool), "throws nothing"); EXPECT_EQ(3, a_); // successful EXPECT_NO_THROW EXPECT_NO_THROW(a_++); EXPECT_EQ(4, a_); // failed EXPECT_NO_THROW EXPECT_NONFATAL_FAILURE(EXPECT_NO_THROW({ // NOLINT a_++; ThrowAnInteger(); }), "it throws"); EXPECT_EQ(5, a_); // successful EXPECT_ANY_THROW EXPECT_ANY_THROW({ // NOLINT a_++; ThrowAnInteger(); }); EXPECT_EQ(6, a_); // failed EXPECT_ANY_THROW EXPECT_NONFATAL_FAILURE(EXPECT_ANY_THROW(a_++), "it doesn't"); EXPECT_EQ(7, a_); } #endif // GTEST_HAS_EXCEPTIONS // Tests {ASSERT|EXPECT}_NO_FATAL_FAILURE. class NoFatalFailureTest : public Test { protected: void Succeeds() {} void FailsNonFatal() { ADD_FAILURE() << "some non-fatal failure"; } void Fails() { FAIL() << "some fatal failure"; } void DoAssertNoFatalFailureOnFails() { ASSERT_NO_FATAL_FAILURE(Fails()); ADD_FAILURE() << "shold not reach here."; } void DoExpectNoFatalFailureOnFails() { EXPECT_NO_FATAL_FAILURE(Fails()); ADD_FAILURE() << "other failure"; } }; TEST_F(NoFatalFailureTest, NoFailure) { EXPECT_NO_FATAL_FAILURE(Succeeds()); ASSERT_NO_FATAL_FAILURE(Succeeds()); } TEST_F(NoFatalFailureTest, NonFatalIsNoFailure) { EXPECT_NONFATAL_FAILURE( EXPECT_NO_FATAL_FAILURE(FailsNonFatal()), "some non-fatal failure"); EXPECT_NONFATAL_FAILURE( ASSERT_NO_FATAL_FAILURE(FailsNonFatal()), "some non-fatal failure"); } TEST_F(NoFatalFailureTest, AssertNoFatalFailureOnFatalFailure) { TestPartResultArray gtest_failures; { ScopedFakeTestPartResultReporter gtest_reporter(>est_failures); DoAssertNoFatalFailureOnFails(); } ASSERT_EQ(2, gtest_failures.size()); EXPECT_EQ(TestPartResult::kFatalFailure, gtest_failures.GetTestPartResult(0).type()); EXPECT_EQ(TestPartResult::kFatalFailure, gtest_failures.GetTestPartResult(1).type()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "some fatal failure", gtest_failures.GetTestPartResult(0).message()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "it does", gtest_failures.GetTestPartResult(1).message()); } TEST_F(NoFatalFailureTest, ExpectNoFatalFailureOnFatalFailure) { TestPartResultArray gtest_failures; { ScopedFakeTestPartResultReporter gtest_reporter(>est_failures); DoExpectNoFatalFailureOnFails(); } ASSERT_EQ(3, gtest_failures.size()); EXPECT_EQ(TestPartResult::kFatalFailure, gtest_failures.GetTestPartResult(0).type()); EXPECT_EQ(TestPartResult::kNonFatalFailure, gtest_failures.GetTestPartResult(1).type()); EXPECT_EQ(TestPartResult::kNonFatalFailure, gtest_failures.GetTestPartResult(2).type()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "some fatal failure", gtest_failures.GetTestPartResult(0).message()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "it does", gtest_failures.GetTestPartResult(1).message()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "other failure", gtest_failures.GetTestPartResult(2).message()); } TEST_F(NoFatalFailureTest, MessageIsStreamable) { TestPartResultArray gtest_failures; { ScopedFakeTestPartResultReporter gtest_reporter(>est_failures); EXPECT_NO_FATAL_FAILURE(FAIL() << "foo") << "my message"; } ASSERT_EQ(2, gtest_failures.size()); EXPECT_EQ(TestPartResult::kNonFatalFailure, gtest_failures.GetTestPartResult(0).type()); EXPECT_EQ(TestPartResult::kNonFatalFailure, gtest_failures.GetTestPartResult(1).type()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "foo", gtest_failures.GetTestPartResult(0).message()); EXPECT_PRED_FORMAT2(testing::IsSubstring, "my message", gtest_failures.GetTestPartResult(1).message()); } // Tests non-string assertions. // Tests EqFailure(), used for implementing *EQ* assertions. TEST(AssertionTest, EqFailure) { const String foo_val("5"), bar_val("6"); const String msg1( EqFailure("foo", "bar", foo_val, bar_val, false) .failure_message()); EXPECT_STREQ( "Value of: bar\n" " Actual: 6\n" "Expected: foo\n" "Which is: 5", msg1.c_str()); const String msg2( EqFailure("foo", "6", foo_val, bar_val, false) .failure_message()); EXPECT_STREQ( "Value of: 6\n" "Expected: foo\n" "Which is: 5", msg2.c_str()); const String msg3( EqFailure("5", "bar", foo_val, bar_val, false) .failure_message()); EXPECT_STREQ( "Value of: bar\n" " Actual: 6\n" "Expected: 5", msg3.c_str()); const String msg4( EqFailure("5", "6", foo_val, bar_val, false).failure_message()); EXPECT_STREQ( "Value of: 6\n" "Expected: 5", msg4.c_str()); const String msg5( EqFailure("foo", "bar", String("\"x\""), String("\"y\""), true).failure_message()); EXPECT_STREQ( "Value of: bar\n" " Actual: \"y\"\n" "Expected: foo (ignoring case)\n" "Which is: \"x\"", msg5.c_str()); } // Tests AppendUserMessage(), used for implementing the *EQ* macros. TEST(AssertionTest, AppendUserMessage) { const String foo("foo"); Message msg; EXPECT_STREQ("foo", AppendUserMessage(foo, msg).c_str()); msg << "bar"; EXPECT_STREQ("foo\nbar", AppendUserMessage(foo, msg).c_str()); } #ifdef __BORLANDC__ // Silences warnings: "Condition is always true", "Unreachable code" # pragma option push -w-ccc -w-rch #endif // Tests ASSERT_TRUE. TEST(AssertionTest, ASSERT_TRUE) { ASSERT_TRUE(2 > 1); // NOLINT EXPECT_FATAL_FAILURE(ASSERT_TRUE(2 < 1), "2 < 1"); } // Tests ASSERT_TRUE(predicate) for predicates returning AssertionResult. TEST(AssertionTest, AssertTrueWithAssertionResult) { ASSERT_TRUE(ResultIsEven(2)); #ifndef __BORLANDC__ // ICE's in C++Builder. EXPECT_FATAL_FAILURE(ASSERT_TRUE(ResultIsEven(3)), "Value of: ResultIsEven(3)\n" " Actual: false (3 is odd)\n" "Expected: true"); #endif ASSERT_TRUE(ResultIsEvenNoExplanation(2)); EXPECT_FATAL_FAILURE(ASSERT_TRUE(ResultIsEvenNoExplanation(3)), "Value of: ResultIsEvenNoExplanation(3)\n" " Actual: false (3 is odd)\n" "Expected: true"); } // Tests ASSERT_FALSE. TEST(AssertionTest, ASSERT_FALSE) { ASSERT_FALSE(2 < 1); // NOLINT EXPECT_FATAL_FAILURE(ASSERT_FALSE(2 > 1), "Value of: 2 > 1\n" " Actual: true\n" "Expected: false"); } // Tests ASSERT_FALSE(predicate) for predicates returning AssertionResult. TEST(AssertionTest, AssertFalseWithAssertionResult) { ASSERT_FALSE(ResultIsEven(3)); #ifndef __BORLANDC__ // ICE's in C++Builder. EXPECT_FATAL_FAILURE(ASSERT_FALSE(ResultIsEven(2)), "Value of: ResultIsEven(2)\n" " Actual: true (2 is even)\n" "Expected: false"); #endif ASSERT_FALSE(ResultIsEvenNoExplanation(3)); EXPECT_FATAL_FAILURE(ASSERT_FALSE(ResultIsEvenNoExplanation(2)), "Value of: ResultIsEvenNoExplanation(2)\n" " Actual: true\n" "Expected: false"); } #ifdef __BORLANDC__ // Restores warnings after previous "#pragma option push" supressed them # pragma option pop #endif // Tests using ASSERT_EQ on double values. The purpose is to make // sure that the specialization we did for integer and anonymous enums // isn't used for double arguments. TEST(ExpectTest, ASSERT_EQ_Double) { // A success. ASSERT_EQ(5.6, 5.6); // A failure. EXPECT_FATAL_FAILURE(ASSERT_EQ(5.1, 5.2), "5.1"); } // Tests ASSERT_EQ. TEST(AssertionTest, ASSERT_EQ) { ASSERT_EQ(5, 2 + 3); EXPECT_FATAL_FAILURE(ASSERT_EQ(5, 2*3), "Value of: 2*3\n" " Actual: 6\n" "Expected: 5"); } // Tests ASSERT_EQ(NULL, pointer). #if GTEST_CAN_COMPARE_NULL TEST(AssertionTest, ASSERT_EQ_NULL) { // A success. const char* p = NULL; // Some older GCC versions may issue a spurious waring in this or the next // assertion statement. This warning should not be suppressed with // static_cast since the test verifies the ability to use bare NULL as the // expected parameter to the macro. ASSERT_EQ(NULL, p); // A failure. static int n = 0; EXPECT_FATAL_FAILURE(ASSERT_EQ(NULL, &n), "Value of: &n\n"); } #endif // GTEST_CAN_COMPARE_NULL // Tests ASSERT_EQ(0, non_pointer). Since the literal 0 can be // treated as a null pointer by the compiler, we need to make sure // that ASSERT_EQ(0, non_pointer) isn't interpreted by Google Test as // ASSERT_EQ(static_cast(NULL), non_pointer). TEST(ExpectTest, ASSERT_EQ_0) { int n = 0; // A success. ASSERT_EQ(0, n); // A failure. EXPECT_FATAL_FAILURE(ASSERT_EQ(0, 5.6), "Expected: 0"); } // Tests ASSERT_NE. TEST(AssertionTest, ASSERT_NE) { ASSERT_NE(6, 7); EXPECT_FATAL_FAILURE(ASSERT_NE('a', 'a'), "Expected: ('a') != ('a'), " "actual: 'a' (97, 0x61) vs 'a' (97, 0x61)"); } // Tests ASSERT_LE. TEST(AssertionTest, ASSERT_LE) { ASSERT_LE(2, 3); ASSERT_LE(2, 2); EXPECT_FATAL_FAILURE(ASSERT_LE(2, 0), "Expected: (2) <= (0), actual: 2 vs 0"); } // Tests ASSERT_LT. TEST(AssertionTest, ASSERT_LT) { ASSERT_LT(2, 3); EXPECT_FATAL_FAILURE(ASSERT_LT(2, 2), "Expected: (2) < (2), actual: 2 vs 2"); } // Tests ASSERT_GE. TEST(AssertionTest, ASSERT_GE) { ASSERT_GE(2, 1); ASSERT_GE(2, 2); EXPECT_FATAL_FAILURE(ASSERT_GE(2, 3), "Expected: (2) >= (3), actual: 2 vs 3"); } // Tests ASSERT_GT. TEST(AssertionTest, ASSERT_GT) { ASSERT_GT(2, 1); EXPECT_FATAL_FAILURE(ASSERT_GT(2, 2), "Expected: (2) > (2), actual: 2 vs 2"); } #if GTEST_HAS_EXCEPTIONS void ThrowNothing() {} // Tests ASSERT_THROW. TEST(AssertionTest, ASSERT_THROW) { ASSERT_THROW(ThrowAnInteger(), int); # ifndef __BORLANDC__ // ICE's in C++Builder 2007 and 2009. EXPECT_FATAL_FAILURE( ASSERT_THROW(ThrowAnInteger(), bool), "Expected: ThrowAnInteger() throws an exception of type bool.\n" " Actual: it throws a different type."); # endif EXPECT_FATAL_FAILURE( ASSERT_THROW(ThrowNothing(), bool), "Expected: ThrowNothing() throws an exception of type bool.\n" " Actual: it throws nothing."); } // Tests ASSERT_NO_THROW. TEST(AssertionTest, ASSERT_NO_THROW) { ASSERT_NO_THROW(ThrowNothing()); EXPECT_FATAL_FAILURE(ASSERT_NO_THROW(ThrowAnInteger()), "Expected: ThrowAnInteger() doesn't throw an exception." "\n Actual: it throws."); } // Tests ASSERT_ANY_THROW. TEST(AssertionTest, ASSERT_ANY_THROW) { ASSERT_ANY_THROW(ThrowAnInteger()); EXPECT_FATAL_FAILURE( ASSERT_ANY_THROW(ThrowNothing()), "Expected: ThrowNothing() throws an exception.\n" " Actual: it doesn't."); } #endif // GTEST_HAS_EXCEPTIONS // Makes sure we deal with the precedence of <<. This test should // compile. TEST(AssertionTest, AssertPrecedence) { ASSERT_EQ(1 < 2, true); bool false_value = false; ASSERT_EQ(true && false_value, false); } // A subroutine used by the following test. void TestEq1(int x) { ASSERT_EQ(1, x); } // Tests calling a test subroutine that's not part of a fixture. TEST(AssertionTest, NonFixtureSubroutine) { EXPECT_FATAL_FAILURE(TestEq1(2), "Value of: x"); } // An uncopyable class. class Uncopyable { public: explicit Uncopyable(int a_value) : value_(a_value) {} int value() const { return value_; } bool operator==(const Uncopyable& rhs) const { return value() == rhs.value(); } private: // This constructor deliberately has no implementation, as we don't // want this class to be copyable. Uncopyable(const Uncopyable&); // NOLINT int value_; }; ::std::ostream& operator<<(::std::ostream& os, const Uncopyable& value) { return os << value.value(); } bool IsPositiveUncopyable(const Uncopyable& x) { return x.value() > 0; } // A subroutine used by the following test. void TestAssertNonPositive() { Uncopyable y(-1); ASSERT_PRED1(IsPositiveUncopyable, y); } // A subroutine used by the following test. void TestAssertEqualsUncopyable() { Uncopyable x(5); Uncopyable y(-1); ASSERT_EQ(x, y); } // Tests that uncopyable objects can be used in assertions. TEST(AssertionTest, AssertWorksWithUncopyableObject) { Uncopyable x(5); ASSERT_PRED1(IsPositiveUncopyable, x); ASSERT_EQ(x, x); EXPECT_FATAL_FAILURE(TestAssertNonPositive(), "IsPositiveUncopyable(y) evaluates to false, where\ny evaluates to -1"); EXPECT_FATAL_FAILURE(TestAssertEqualsUncopyable(), "Value of: y\n Actual: -1\nExpected: x\nWhich is: 5"); } // Tests that uncopyable objects can be used in expects. TEST(AssertionTest, ExpectWorksWithUncopyableObject) { Uncopyable x(5); EXPECT_PRED1(IsPositiveUncopyable, x); Uncopyable y(-1); EXPECT_NONFATAL_FAILURE(EXPECT_PRED1(IsPositiveUncopyable, y), "IsPositiveUncopyable(y) evaluates to false, where\ny evaluates to -1"); EXPECT_EQ(x, x); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(x, y), "Value of: y\n Actual: -1\nExpected: x\nWhich is: 5"); } enum NamedEnum { kE1 = 0, kE2 = 1 }; TEST(AssertionTest, NamedEnum) { EXPECT_EQ(kE1, kE1); EXPECT_LT(kE1, kE2); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(kE1, kE2), "Which is: 0"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(kE1, kE2), "Actual: 1"); } // The version of gcc used in XCode 2.2 has a bug and doesn't allow // anonymous enums in assertions. Therefore the following test is not // done on Mac. // Sun Studio and HP aCC also reject this code. #if !GTEST_OS_MAC && !defined(__SUNPRO_CC) && !defined(__HP_aCC) // Tests using assertions with anonymous enums. enum { kCaseA = -1, # if GTEST_OS_LINUX // We want to test the case where the size of the anonymous enum is // larger than sizeof(int), to make sure our implementation of the // assertions doesn't truncate the enums. However, MSVC // (incorrectly) doesn't allow an enum value to exceed the range of // an int, so this has to be conditionally compiled. // // On Linux, kCaseB and kCaseA have the same value when truncated to // int size. We want to test whether this will confuse the // assertions. kCaseB = testing::internal::kMaxBiggestInt, # else kCaseB = INT_MAX, # endif // GTEST_OS_LINUX kCaseC = 42 }; TEST(AssertionTest, AnonymousEnum) { # if GTEST_OS_LINUX EXPECT_EQ(static_cast(kCaseA), static_cast(kCaseB)); # endif // GTEST_OS_LINUX EXPECT_EQ(kCaseA, kCaseA); EXPECT_NE(kCaseA, kCaseB); EXPECT_LT(kCaseA, kCaseB); EXPECT_LE(kCaseA, kCaseB); EXPECT_GT(kCaseB, kCaseA); EXPECT_GE(kCaseA, kCaseA); EXPECT_NONFATAL_FAILURE(EXPECT_GE(kCaseA, kCaseB), "(kCaseA) >= (kCaseB)"); EXPECT_NONFATAL_FAILURE(EXPECT_GE(kCaseA, kCaseC), "-1 vs 42"); ASSERT_EQ(kCaseA, kCaseA); ASSERT_NE(kCaseA, kCaseB); ASSERT_LT(kCaseA, kCaseB); ASSERT_LE(kCaseA, kCaseB); ASSERT_GT(kCaseB, kCaseA); ASSERT_GE(kCaseA, kCaseA); # ifndef __BORLANDC__ // ICE's in C++Builder. EXPECT_FATAL_FAILURE(ASSERT_EQ(kCaseA, kCaseB), "Value of: kCaseB"); EXPECT_FATAL_FAILURE(ASSERT_EQ(kCaseA, kCaseC), "Actual: 42"); # endif EXPECT_FATAL_FAILURE(ASSERT_EQ(kCaseA, kCaseC), "Which is: -1"); } #endif // !GTEST_OS_MAC && !defined(__SUNPRO_CC) #if GTEST_OS_WINDOWS static HRESULT UnexpectedHRESULTFailure() { return E_UNEXPECTED; } static HRESULT OkHRESULTSuccess() { return S_OK; } static HRESULT FalseHRESULTSuccess() { return S_FALSE; } // HRESULT assertion tests test both zero and non-zero // success codes as well as failure message for each. // // Windows CE doesn't support message texts. TEST(HRESULTAssertionTest, EXPECT_HRESULT_SUCCEEDED) { EXPECT_HRESULT_SUCCEEDED(S_OK); EXPECT_HRESULT_SUCCEEDED(S_FALSE); EXPECT_NONFATAL_FAILURE(EXPECT_HRESULT_SUCCEEDED(UnexpectedHRESULTFailure()), "Expected: (UnexpectedHRESULTFailure()) succeeds.\n" " Actual: 0x8000FFFF"); } TEST(HRESULTAssertionTest, ASSERT_HRESULT_SUCCEEDED) { ASSERT_HRESULT_SUCCEEDED(S_OK); ASSERT_HRESULT_SUCCEEDED(S_FALSE); EXPECT_FATAL_FAILURE(ASSERT_HRESULT_SUCCEEDED(UnexpectedHRESULTFailure()), "Expected: (UnexpectedHRESULTFailure()) succeeds.\n" " Actual: 0x8000FFFF"); } TEST(HRESULTAssertionTest, EXPECT_HRESULT_FAILED) { EXPECT_HRESULT_FAILED(E_UNEXPECTED); EXPECT_NONFATAL_FAILURE(EXPECT_HRESULT_FAILED(OkHRESULTSuccess()), "Expected: (OkHRESULTSuccess()) fails.\n" " Actual: 0x00000000"); EXPECT_NONFATAL_FAILURE(EXPECT_HRESULT_FAILED(FalseHRESULTSuccess()), "Expected: (FalseHRESULTSuccess()) fails.\n" " Actual: 0x00000001"); } TEST(HRESULTAssertionTest, ASSERT_HRESULT_FAILED) { ASSERT_HRESULT_FAILED(E_UNEXPECTED); # ifndef __BORLANDC__ // ICE's in C++Builder 2007 and 2009. EXPECT_FATAL_FAILURE(ASSERT_HRESULT_FAILED(OkHRESULTSuccess()), "Expected: (OkHRESULTSuccess()) fails.\n" " Actual: 0x00000000"); # endif EXPECT_FATAL_FAILURE(ASSERT_HRESULT_FAILED(FalseHRESULTSuccess()), "Expected: (FalseHRESULTSuccess()) fails.\n" " Actual: 0x00000001"); } // Tests that streaming to the HRESULT macros works. TEST(HRESULTAssertionTest, Streaming) { EXPECT_HRESULT_SUCCEEDED(S_OK) << "unexpected failure"; ASSERT_HRESULT_SUCCEEDED(S_OK) << "unexpected failure"; EXPECT_HRESULT_FAILED(E_UNEXPECTED) << "unexpected failure"; ASSERT_HRESULT_FAILED(E_UNEXPECTED) << "unexpected failure"; EXPECT_NONFATAL_FAILURE( EXPECT_HRESULT_SUCCEEDED(E_UNEXPECTED) << "expected failure", "expected failure"); # ifndef __BORLANDC__ // ICE's in C++Builder 2007 and 2009. EXPECT_FATAL_FAILURE( ASSERT_HRESULT_SUCCEEDED(E_UNEXPECTED) << "expected failure", "expected failure"); # endif EXPECT_NONFATAL_FAILURE( EXPECT_HRESULT_FAILED(S_OK) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE( ASSERT_HRESULT_FAILED(S_OK) << "expected failure", "expected failure"); } #endif // GTEST_OS_WINDOWS #ifdef __BORLANDC__ // Silences warnings: "Condition is always true", "Unreachable code" # pragma option push -w-ccc -w-rch #endif // Tests that the assertion macros behave like single statements. TEST(AssertionSyntaxTest, BasicAssertionsBehavesLikeSingleStatement) { if (AlwaysFalse()) ASSERT_TRUE(false) << "This should never be executed; " "It's a compilation test only."; if (AlwaysTrue()) EXPECT_FALSE(false); else ; // NOLINT if (AlwaysFalse()) ASSERT_LT(1, 3); if (AlwaysFalse()) ; // NOLINT else EXPECT_GT(3, 2) << ""; } #if GTEST_HAS_EXCEPTIONS // Tests that the compiler will not complain about unreachable code in the // EXPECT_THROW/EXPECT_ANY_THROW/EXPECT_NO_THROW macros. TEST(ExpectThrowTest, DoesNotGenerateUnreachableCodeWarning) { int n = 0; EXPECT_THROW(throw 1, int); EXPECT_NONFATAL_FAILURE(EXPECT_THROW(n++, int), ""); EXPECT_NONFATAL_FAILURE(EXPECT_THROW(throw 1, const char*), ""); EXPECT_NO_THROW(n++); EXPECT_NONFATAL_FAILURE(EXPECT_NO_THROW(throw 1), ""); EXPECT_ANY_THROW(throw 1); EXPECT_NONFATAL_FAILURE(EXPECT_ANY_THROW(n++), ""); } TEST(AssertionSyntaxTest, ExceptionAssertionsBehavesLikeSingleStatement) { if (AlwaysFalse()) EXPECT_THROW(ThrowNothing(), bool); if (AlwaysTrue()) EXPECT_THROW(ThrowAnInteger(), int); else ; // NOLINT if (AlwaysFalse()) EXPECT_NO_THROW(ThrowAnInteger()); if (AlwaysTrue()) EXPECT_NO_THROW(ThrowNothing()); else ; // NOLINT if (AlwaysFalse()) EXPECT_ANY_THROW(ThrowNothing()); if (AlwaysTrue()) EXPECT_ANY_THROW(ThrowAnInteger()); else ; // NOLINT } #endif // GTEST_HAS_EXCEPTIONS TEST(AssertionSyntaxTest, NoFatalFailureAssertionsBehavesLikeSingleStatement) { if (AlwaysFalse()) EXPECT_NO_FATAL_FAILURE(FAIL()) << "This should never be executed. " << "It's a compilation test only."; else ; // NOLINT if (AlwaysFalse()) ASSERT_NO_FATAL_FAILURE(FAIL()) << ""; else ; // NOLINT if (AlwaysTrue()) EXPECT_NO_FATAL_FAILURE(SUCCEED()); else ; // NOLINT if (AlwaysFalse()) ; // NOLINT else ASSERT_NO_FATAL_FAILURE(SUCCEED()); } // Tests that the assertion macros work well with switch statements. TEST(AssertionSyntaxTest, WorksWithSwitch) { switch (0) { case 1: break; default: ASSERT_TRUE(true); } switch (0) case 0: EXPECT_FALSE(false) << "EXPECT_FALSE failed in switch case"; // Binary assertions are implemented using a different code path // than the Boolean assertions. Hence we test them separately. switch (0) { case 1: default: ASSERT_EQ(1, 1) << "ASSERT_EQ failed in default switch handler"; } switch (0) case 0: EXPECT_NE(1, 2); } #if GTEST_HAS_EXCEPTIONS void ThrowAString() { throw "String"; } // Test that the exception assertion macros compile and work with const // type qualifier. TEST(AssertionSyntaxTest, WorksWithConst) { ASSERT_THROW(ThrowAString(), const char*); EXPECT_THROW(ThrowAString(), const char*); } #endif // GTEST_HAS_EXCEPTIONS } // namespace namespace testing { // Tests that Google Test tracks SUCCEED*. TEST(SuccessfulAssertionTest, SUCCEED) { SUCCEED(); SUCCEED() << "OK"; EXPECT_EQ(2, GetUnitTestImpl()->current_test_result()->total_part_count()); } // Tests that Google Test doesn't track successful EXPECT_*. TEST(SuccessfulAssertionTest, EXPECT) { EXPECT_TRUE(true); EXPECT_EQ(0, GetUnitTestImpl()->current_test_result()->total_part_count()); } // Tests that Google Test doesn't track successful EXPECT_STR*. TEST(SuccessfulAssertionTest, EXPECT_STR) { EXPECT_STREQ("", ""); EXPECT_EQ(0, GetUnitTestImpl()->current_test_result()->total_part_count()); } // Tests that Google Test doesn't track successful ASSERT_*. TEST(SuccessfulAssertionTest, ASSERT) { ASSERT_TRUE(true); EXPECT_EQ(0, GetUnitTestImpl()->current_test_result()->total_part_count()); } // Tests that Google Test doesn't track successful ASSERT_STR*. TEST(SuccessfulAssertionTest, ASSERT_STR) { ASSERT_STREQ("", ""); EXPECT_EQ(0, GetUnitTestImpl()->current_test_result()->total_part_count()); } } // namespace testing namespace { // Tests EXPECT_TRUE. TEST(ExpectTest, EXPECT_TRUE) { EXPECT_TRUE(2 > 1); // NOLINT EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(2 < 1), "Value of: 2 < 1\n" " Actual: false\n" "Expected: true"); EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(2 > 3), "2 > 3"); } // Tests EXPECT_TRUE(predicate) for predicates returning AssertionResult. TEST(ExpectTest, ExpectTrueWithAssertionResult) { EXPECT_TRUE(ResultIsEven(2)); EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(ResultIsEven(3)), "Value of: ResultIsEven(3)\n" " Actual: false (3 is odd)\n" "Expected: true"); EXPECT_TRUE(ResultIsEvenNoExplanation(2)); EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(ResultIsEvenNoExplanation(3)), "Value of: ResultIsEvenNoExplanation(3)\n" " Actual: false (3 is odd)\n" "Expected: true"); } // Tests EXPECT_FALSE. TEST(ExpectTest, EXPECT_FALSE) { EXPECT_FALSE(2 < 1); // NOLINT EXPECT_NONFATAL_FAILURE(EXPECT_FALSE(2 > 1), "Value of: 2 > 1\n" " Actual: true\n" "Expected: false"); EXPECT_NONFATAL_FAILURE(EXPECT_FALSE(2 < 3), "2 < 3"); } // Tests EXPECT_FALSE(predicate) for predicates returning AssertionResult. TEST(ExpectTest, ExpectFalseWithAssertionResult) { EXPECT_FALSE(ResultIsEven(3)); EXPECT_NONFATAL_FAILURE(EXPECT_FALSE(ResultIsEven(2)), "Value of: ResultIsEven(2)\n" " Actual: true (2 is even)\n" "Expected: false"); EXPECT_FALSE(ResultIsEvenNoExplanation(3)); EXPECT_NONFATAL_FAILURE(EXPECT_FALSE(ResultIsEvenNoExplanation(2)), "Value of: ResultIsEvenNoExplanation(2)\n" " Actual: true\n" "Expected: false"); } #ifdef __BORLANDC__ // Restores warnings after previous "#pragma option push" supressed them # pragma option pop #endif // Tests EXPECT_EQ. TEST(ExpectTest, EXPECT_EQ) { EXPECT_EQ(5, 2 + 3); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(5, 2*3), "Value of: 2*3\n" " Actual: 6\n" "Expected: 5"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(5, 2 - 3), "2 - 3"); } // Tests using EXPECT_EQ on double values. The purpose is to make // sure that the specialization we did for integer and anonymous enums // isn't used for double arguments. TEST(ExpectTest, EXPECT_EQ_Double) { // A success. EXPECT_EQ(5.6, 5.6); // A failure. EXPECT_NONFATAL_FAILURE(EXPECT_EQ(5.1, 5.2), "5.1"); } #if GTEST_CAN_COMPARE_NULL // Tests EXPECT_EQ(NULL, pointer). TEST(ExpectTest, EXPECT_EQ_NULL) { // A success. const char* p = NULL; // Some older GCC versions may issue a spurious warning in this or the next // assertion statement. This warning should not be suppressed with // static_cast since the test verifies the ability to use bare NULL as the // expected parameter to the macro. EXPECT_EQ(NULL, p); // A failure. int n = 0; EXPECT_NONFATAL_FAILURE(EXPECT_EQ(NULL, &n), "Value of: &n\n"); } #endif // GTEST_CAN_COMPARE_NULL // Tests EXPECT_EQ(0, non_pointer). Since the literal 0 can be // treated as a null pointer by the compiler, we need to make sure // that EXPECT_EQ(0, non_pointer) isn't interpreted by Google Test as // EXPECT_EQ(static_cast(NULL), non_pointer). TEST(ExpectTest, EXPECT_EQ_0) { int n = 0; // A success. EXPECT_EQ(0, n); // A failure. EXPECT_NONFATAL_FAILURE(EXPECT_EQ(0, 5.6), "Expected: 0"); } // Tests EXPECT_NE. TEST(ExpectTest, EXPECT_NE) { EXPECT_NE(6, 7); EXPECT_NONFATAL_FAILURE(EXPECT_NE('a', 'a'), "Expected: ('a') != ('a'), " "actual: 'a' (97, 0x61) vs 'a' (97, 0x61)"); EXPECT_NONFATAL_FAILURE(EXPECT_NE(2, 2), "2"); char* const p0 = NULL; EXPECT_NONFATAL_FAILURE(EXPECT_NE(p0, p0), "p0"); // Only way to get the Nokia compiler to compile the cast // is to have a separate void* variable first. Putting // the two casts on the same line doesn't work, neither does // a direct C-style to char*. void* pv1 = (void*)0x1234; // NOLINT char* const p1 = reinterpret_cast(pv1); EXPECT_NONFATAL_FAILURE(EXPECT_NE(p1, p1), "p1"); } // Tests EXPECT_LE. TEST(ExpectTest, EXPECT_LE) { EXPECT_LE(2, 3); EXPECT_LE(2, 2); EXPECT_NONFATAL_FAILURE(EXPECT_LE(2, 0), "Expected: (2) <= (0), actual: 2 vs 0"); EXPECT_NONFATAL_FAILURE(EXPECT_LE(1.1, 0.9), "(1.1) <= (0.9)"); } // Tests EXPECT_LT. TEST(ExpectTest, EXPECT_LT) { EXPECT_LT(2, 3); EXPECT_NONFATAL_FAILURE(EXPECT_LT(2, 2), "Expected: (2) < (2), actual: 2 vs 2"); EXPECT_NONFATAL_FAILURE(EXPECT_LT(2, 1), "(2) < (1)"); } // Tests EXPECT_GE. TEST(ExpectTest, EXPECT_GE) { EXPECT_GE(2, 1); EXPECT_GE(2, 2); EXPECT_NONFATAL_FAILURE(EXPECT_GE(2, 3), "Expected: (2) >= (3), actual: 2 vs 3"); EXPECT_NONFATAL_FAILURE(EXPECT_GE(0.9, 1.1), "(0.9) >= (1.1)"); } // Tests EXPECT_GT. TEST(ExpectTest, EXPECT_GT) { EXPECT_GT(2, 1); EXPECT_NONFATAL_FAILURE(EXPECT_GT(2, 2), "Expected: (2) > (2), actual: 2 vs 2"); EXPECT_NONFATAL_FAILURE(EXPECT_GT(2, 3), "(2) > (3)"); } #if GTEST_HAS_EXCEPTIONS // Tests EXPECT_THROW. TEST(ExpectTest, EXPECT_THROW) { EXPECT_THROW(ThrowAnInteger(), int); EXPECT_NONFATAL_FAILURE(EXPECT_THROW(ThrowAnInteger(), bool), "Expected: ThrowAnInteger() throws an exception of " "type bool.\n Actual: it throws a different type."); EXPECT_NONFATAL_FAILURE( EXPECT_THROW(ThrowNothing(), bool), "Expected: ThrowNothing() throws an exception of type bool.\n" " Actual: it throws nothing."); } // Tests EXPECT_NO_THROW. TEST(ExpectTest, EXPECT_NO_THROW) { EXPECT_NO_THROW(ThrowNothing()); EXPECT_NONFATAL_FAILURE(EXPECT_NO_THROW(ThrowAnInteger()), "Expected: ThrowAnInteger() doesn't throw an " "exception.\n Actual: it throws."); } // Tests EXPECT_ANY_THROW. TEST(ExpectTest, EXPECT_ANY_THROW) { EXPECT_ANY_THROW(ThrowAnInteger()); EXPECT_NONFATAL_FAILURE( EXPECT_ANY_THROW(ThrowNothing()), "Expected: ThrowNothing() throws an exception.\n" " Actual: it doesn't."); } #endif // GTEST_HAS_EXCEPTIONS // Make sure we deal with the precedence of <<. TEST(ExpectTest, ExpectPrecedence) { EXPECT_EQ(1 < 2, true); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(true, true && false), "Value of: true && false"); } // Tests the StreamableToString() function. // Tests using StreamableToString() on a scalar. TEST(StreamableToStringTest, Scalar) { EXPECT_STREQ("5", StreamableToString(5).c_str()); } // Tests using StreamableToString() on a non-char pointer. TEST(StreamableToStringTest, Pointer) { int n = 0; int* p = &n; EXPECT_STRNE("(null)", StreamableToString(p).c_str()); } // Tests using StreamableToString() on a NULL non-char pointer. TEST(StreamableToStringTest, NullPointer) { int* p = NULL; EXPECT_STREQ("(null)", StreamableToString(p).c_str()); } // Tests using StreamableToString() on a C string. TEST(StreamableToStringTest, CString) { EXPECT_STREQ("Foo", StreamableToString("Foo").c_str()); } // Tests using StreamableToString() on a NULL C string. TEST(StreamableToStringTest, NullCString) { char* p = NULL; EXPECT_STREQ("(null)", StreamableToString(p).c_str()); } // Tests using streamable values as assertion messages. // Tests using std::string as an assertion message. TEST(StreamableTest, string) { static const std::string str( "This failure message is a std::string, and is expected."); EXPECT_FATAL_FAILURE(FAIL() << str, str.c_str()); } // Tests that we can output strings containing embedded NULs. // Limited to Linux because we can only do this with std::string's. TEST(StreamableTest, stringWithEmbeddedNUL) { static const char char_array_with_nul[] = "Here's a NUL\0 and some more string"; static const std::string string_with_nul(char_array_with_nul, sizeof(char_array_with_nul) - 1); // drops the trailing NUL EXPECT_FATAL_FAILURE(FAIL() << string_with_nul, "Here's a NUL\\0 and some more string"); } // Tests that we can output a NUL char. TEST(StreamableTest, NULChar) { EXPECT_FATAL_FAILURE({ // NOLINT FAIL() << "A NUL" << '\0' << " and some more string"; }, "A NUL\\0 and some more string"); } // Tests using int as an assertion message. TEST(StreamableTest, int) { EXPECT_FATAL_FAILURE(FAIL() << 900913, "900913"); } // Tests using NULL char pointer as an assertion message. // // In MSVC, streaming a NULL char * causes access violation. Google Test // implemented a workaround (substituting "(null)" for NULL). This // tests whether the workaround works. TEST(StreamableTest, NullCharPtr) { EXPECT_FATAL_FAILURE(FAIL() << static_cast(NULL), "(null)"); } // Tests that basic IO manipulators (endl, ends, and flush) can be // streamed to testing::Message. TEST(StreamableTest, BasicIoManip) { EXPECT_FATAL_FAILURE({ // NOLINT FAIL() << "Line 1." << std::endl << "A NUL char " << std::ends << std::flush << " in line 2."; }, "Line 1.\nA NUL char \\0 in line 2."); } // Tests the macros that haven't been covered so far. void AddFailureHelper(bool* aborted) { *aborted = true; ADD_FAILURE() << "Failure"; *aborted = false; } // Tests ADD_FAILURE. TEST(MacroTest, ADD_FAILURE) { bool aborted = true; EXPECT_NONFATAL_FAILURE(AddFailureHelper(&aborted), "Failure"); EXPECT_FALSE(aborted); } // Tests ADD_FAILURE_AT. TEST(MacroTest, ADD_FAILURE_AT) { // Verifies that ADD_FAILURE_AT does generate a nonfatal failure and // the failure message contains the user-streamed part. EXPECT_NONFATAL_FAILURE(ADD_FAILURE_AT("foo.cc", 42) << "Wrong!", "Wrong!"); // Verifies that the user-streamed part is optional. EXPECT_NONFATAL_FAILURE(ADD_FAILURE_AT("foo.cc", 42), "Failed"); // Unfortunately, we cannot verify that the failure message contains // the right file path and line number the same way, as // EXPECT_NONFATAL_FAILURE() doesn't get to see the file path and // line number. Instead, we do that in gtest_output_test_.cc. } // Tests FAIL. TEST(MacroTest, FAIL) { EXPECT_FATAL_FAILURE(FAIL(), "Failed"); EXPECT_FATAL_FAILURE(FAIL() << "Intentional failure.", "Intentional failure."); } // Tests SUCCEED TEST(MacroTest, SUCCEED) { SUCCEED(); SUCCEED() << "Explicit success."; } // Tests for EXPECT_EQ() and ASSERT_EQ(). // // These tests fail *intentionally*, s.t. the failure messages can be // generated and tested. // // We have different tests for different argument types. // Tests using bool values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, Bool) { EXPECT_EQ(true, true); EXPECT_FATAL_FAILURE({ bool false_value = false; ASSERT_EQ(false_value, true); }, "Value of: true"); } // Tests using int values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, Int) { ASSERT_EQ(32, 32); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(32, 33), "33"); } // Tests using time_t values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, Time_T) { EXPECT_EQ(static_cast(0), static_cast(0)); EXPECT_FATAL_FAILURE(ASSERT_EQ(static_cast(0), static_cast(1234)), "1234"); } // Tests using char values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, Char) { ASSERT_EQ('z', 'z'); const char ch = 'b'; EXPECT_NONFATAL_FAILURE(EXPECT_EQ('\0', ch), "ch"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ('a', ch), "ch"); } // Tests using wchar_t values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, WideChar) { EXPECT_EQ(L'b', L'b'); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(L'\0', L'x'), "Value of: L'x'\n" " Actual: L'x' (120, 0x78)\n" "Expected: L'\0'\n" "Which is: L'\0' (0, 0x0)"); static wchar_t wchar; wchar = L'b'; EXPECT_NONFATAL_FAILURE(EXPECT_EQ(L'a', wchar), "wchar"); wchar = 0x8119; EXPECT_FATAL_FAILURE(ASSERT_EQ(static_cast(0x8120), wchar), "Value of: wchar"); } // Tests using ::std::string values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, StdString) { // Compares a const char* to an std::string that has identical // content. ASSERT_EQ("Test", ::std::string("Test")); // Compares two identical std::strings. static const ::std::string str1("A * in the middle"); static const ::std::string str2(str1); EXPECT_EQ(str1, str2); // Compares a const char* to an std::string that has different // content EXPECT_NONFATAL_FAILURE(EXPECT_EQ("Test", ::std::string("test")), "::std::string(\"test\")"); // Compares an std::string to a char* that has different content. char* const p1 = const_cast("foo"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(::std::string("bar"), p1), "p1"); // Compares two std::strings that have different contents, one of // which having a NUL character in the middle. This should fail. static ::std::string str3(str1); str3.at(2) = '\0'; EXPECT_FATAL_FAILURE(ASSERT_EQ(str1, str3), "Value of: str3\n" " Actual: \"A \\0 in the middle\""); } #if GTEST_HAS_STD_WSTRING // Tests using ::std::wstring values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, StdWideString) { // Compares two identical std::wstrings. const ::std::wstring wstr1(L"A * in the middle"); const ::std::wstring wstr2(wstr1); ASSERT_EQ(wstr1, wstr2); // Compares an std::wstring to a const wchar_t* that has identical // content. const wchar_t kTestX8119[] = { 'T', 'e', 's', 't', 0x8119, '\0' }; EXPECT_EQ(::std::wstring(kTestX8119), kTestX8119); // Compares an std::wstring to a const wchar_t* that has different // content. const wchar_t kTestX8120[] = { 'T', 'e', 's', 't', 0x8120, '\0' }; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_EQ(::std::wstring(kTestX8119), kTestX8120); }, "kTestX8120"); // Compares two std::wstrings that have different contents, one of // which having a NUL character in the middle. ::std::wstring wstr3(wstr1); wstr3.at(2) = L'\0'; EXPECT_NONFATAL_FAILURE(EXPECT_EQ(wstr1, wstr3), "wstr3"); // Compares a wchar_t* to an std::wstring that has different // content. EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_EQ(const_cast(L"foo"), ::std::wstring(L"bar")); }, ""); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_STRING // Tests using ::string values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, GlobalString) { // Compares a const char* to a ::string that has identical content. EXPECT_EQ("Test", ::string("Test")); // Compares two identical ::strings. const ::string str1("A * in the middle"); const ::string str2(str1); ASSERT_EQ(str1, str2); // Compares a ::string to a const char* that has different content. EXPECT_NONFATAL_FAILURE(EXPECT_EQ(::string("Test"), "test"), "test"); // Compares two ::strings that have different contents, one of which // having a NUL character in the middle. ::string str3(str1); str3.at(2) = '\0'; EXPECT_NONFATAL_FAILURE(EXPECT_EQ(str1, str3), "str3"); // Compares a ::string to a char* that has different content. EXPECT_FATAL_FAILURE({ // NOLINT ASSERT_EQ(::string("bar"), const_cast("foo")); }, ""); } #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING // Tests using ::wstring values in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, GlobalWideString) { // Compares two identical ::wstrings. static const ::wstring wstr1(L"A * in the middle"); static const ::wstring wstr2(wstr1); EXPECT_EQ(wstr1, wstr2); // Compares a const wchar_t* to a ::wstring that has identical content. const wchar_t kTestX8119[] = { 'T', 'e', 's', 't', 0x8119, '\0' }; ASSERT_EQ(kTestX8119, ::wstring(kTestX8119)); // Compares a const wchar_t* to a ::wstring that has different // content. const wchar_t kTestX8120[] = { 'T', 'e', 's', 't', 0x8120, '\0' }; EXPECT_NONFATAL_FAILURE({ // NOLINT EXPECT_EQ(kTestX8120, ::wstring(kTestX8119)); }, "Test\\x8119"); // Compares a wchar_t* to a ::wstring that has different content. wchar_t* const p1 = const_cast(L"foo"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p1, ::wstring(L"bar")), "bar"); // Compares two ::wstrings that have different contents, one of which // having a NUL character in the middle. static ::wstring wstr3; wstr3 = wstr1; wstr3.at(2) = L'\0'; EXPECT_FATAL_FAILURE(ASSERT_EQ(wstr1, wstr3), "wstr3"); } #endif // GTEST_HAS_GLOBAL_WSTRING // Tests using char pointers in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, CharPointer) { char* const p0 = NULL; // Only way to get the Nokia compiler to compile the cast // is to have a separate void* variable first. Putting // the two casts on the same line doesn't work, neither does // a direct C-style to char*. void* pv1 = (void*)0x1234; // NOLINT void* pv2 = (void*)0xABC0; // NOLINT char* const p1 = reinterpret_cast(pv1); char* const p2 = reinterpret_cast(pv2); ASSERT_EQ(p1, p1); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p0, p2), "Value of: p2"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p1, p2), "p2"); EXPECT_FATAL_FAILURE(ASSERT_EQ(reinterpret_cast(0x1234), reinterpret_cast(0xABC0)), "ABC0"); } // Tests using wchar_t pointers in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, WideCharPointer) { wchar_t* const p0 = NULL; // Only way to get the Nokia compiler to compile the cast // is to have a separate void* variable first. Putting // the two casts on the same line doesn't work, neither does // a direct C-style to char*. void* pv1 = (void*)0x1234; // NOLINT void* pv2 = (void*)0xABC0; // NOLINT wchar_t* const p1 = reinterpret_cast(pv1); wchar_t* const p2 = reinterpret_cast(pv2); EXPECT_EQ(p0, p0); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p0, p2), "Value of: p2"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p1, p2), "p2"); void* pv3 = (void*)0x1234; // NOLINT void* pv4 = (void*)0xABC0; // NOLINT const wchar_t* p3 = reinterpret_cast(pv3); const wchar_t* p4 = reinterpret_cast(pv4); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(p3, p4), "p4"); } // Tests using other types of pointers in {EXPECT|ASSERT}_EQ. TEST(EqAssertionTest, OtherPointer) { ASSERT_EQ(static_cast(NULL), static_cast(NULL)); EXPECT_FATAL_FAILURE(ASSERT_EQ(static_cast(NULL), reinterpret_cast(0x1234)), "0x1234"); } // A class that supports binary comparison operators but not streaming. class UnprintableChar { public: explicit UnprintableChar(char ch) : char_(ch) {} bool operator==(const UnprintableChar& rhs) const { return char_ == rhs.char_; } bool operator!=(const UnprintableChar& rhs) const { return char_ != rhs.char_; } bool operator<(const UnprintableChar& rhs) const { return char_ < rhs.char_; } bool operator<=(const UnprintableChar& rhs) const { return char_ <= rhs.char_; } bool operator>(const UnprintableChar& rhs) const { return char_ > rhs.char_; } bool operator>=(const UnprintableChar& rhs) const { return char_ >= rhs.char_; } private: char char_; }; // Tests that ASSERT_EQ() and friends don't require the arguments to // be printable. TEST(ComparisonAssertionTest, AcceptsUnprintableArgs) { const UnprintableChar x('x'), y('y'); ASSERT_EQ(x, x); EXPECT_NE(x, y); ASSERT_LT(x, y); EXPECT_LE(x, y); ASSERT_GT(y, x); EXPECT_GE(x, x); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(x, y), "1-byte object <78>"); EXPECT_NONFATAL_FAILURE(EXPECT_EQ(x, y), "1-byte object <79>"); EXPECT_NONFATAL_FAILURE(EXPECT_LT(y, y), "1-byte object <79>"); EXPECT_NONFATAL_FAILURE(EXPECT_GT(x, y), "1-byte object <78>"); EXPECT_NONFATAL_FAILURE(EXPECT_GT(x, y), "1-byte object <79>"); // Code tested by EXPECT_FATAL_FAILURE cannot reference local // variables, so we have to write UnprintableChar('x') instead of x. #ifndef __BORLANDC__ // ICE's in C++Builder. EXPECT_FATAL_FAILURE(ASSERT_NE(UnprintableChar('x'), UnprintableChar('x')), "1-byte object <78>"); EXPECT_FATAL_FAILURE(ASSERT_LE(UnprintableChar('y'), UnprintableChar('x')), "1-byte object <78>"); #endif EXPECT_FATAL_FAILURE(ASSERT_LE(UnprintableChar('y'), UnprintableChar('x')), "1-byte object <79>"); EXPECT_FATAL_FAILURE(ASSERT_GE(UnprintableChar('x'), UnprintableChar('y')), "1-byte object <78>"); EXPECT_FATAL_FAILURE(ASSERT_GE(UnprintableChar('x'), UnprintableChar('y')), "1-byte object <79>"); } // Tests the FRIEND_TEST macro. // This class has a private member we want to test. We will test it // both in a TEST and in a TEST_F. class Foo { public: Foo() {} private: int Bar() const { return 1; } // Declares the friend tests that can access the private member // Bar(). FRIEND_TEST(FRIEND_TEST_Test, TEST); FRIEND_TEST(FRIEND_TEST_Test2, TEST_F); }; // Tests that the FRIEND_TEST declaration allows a TEST to access a // class's private members. This should compile. TEST(FRIEND_TEST_Test, TEST) { ASSERT_EQ(1, Foo().Bar()); } // The fixture needed to test using FRIEND_TEST with TEST_F. class FRIEND_TEST_Test2 : public Test { protected: Foo foo; }; // Tests that the FRIEND_TEST declaration allows a TEST_F to access a // class's private members. This should compile. TEST_F(FRIEND_TEST_Test2, TEST_F) { ASSERT_EQ(1, foo.Bar()); } // Tests the life cycle of Test objects. // The test fixture for testing the life cycle of Test objects. // // This class counts the number of live test objects that uses this // fixture. class TestLifeCycleTest : public Test { protected: // Constructor. Increments the number of test objects that uses // this fixture. TestLifeCycleTest() { count_++; } // Destructor. Decrements the number of test objects that uses this // fixture. ~TestLifeCycleTest() { count_--; } // Returns the number of live test objects that uses this fixture. int count() const { return count_; } private: static int count_; }; int TestLifeCycleTest::count_ = 0; // Tests the life cycle of test objects. TEST_F(TestLifeCycleTest, Test1) { // There should be only one test object in this test case that's // currently alive. ASSERT_EQ(1, count()); } // Tests the life cycle of test objects. TEST_F(TestLifeCycleTest, Test2) { // After Test1 is done and Test2 is started, there should still be // only one live test object, as the object for Test1 should've been // deleted. ASSERT_EQ(1, count()); } } // namespace // Tests that the copy constructor works when it is NOT optimized away by // the compiler. TEST(AssertionResultTest, CopyConstructorWorksWhenNotOptimied) { // Checks that the copy constructor doesn't try to dereference NULL pointers // in the source object. AssertionResult r1 = AssertionSuccess(); AssertionResult r2 = r1; // The following line is added to prevent the compiler from optimizing // away the constructor call. r1 << "abc"; AssertionResult r3 = r1; EXPECT_EQ(static_cast(r3), static_cast(r1)); EXPECT_STREQ("abc", r1.message()); } // Tests that AssertionSuccess and AssertionFailure construct // AssertionResult objects as expected. TEST(AssertionResultTest, ConstructionWorks) { AssertionResult r1 = AssertionSuccess(); EXPECT_TRUE(r1); EXPECT_STREQ("", r1.message()); AssertionResult r2 = AssertionSuccess() << "abc"; EXPECT_TRUE(r2); EXPECT_STREQ("abc", r2.message()); AssertionResult r3 = AssertionFailure(); EXPECT_FALSE(r3); EXPECT_STREQ("", r3.message()); AssertionResult r4 = AssertionFailure() << "def"; EXPECT_FALSE(r4); EXPECT_STREQ("def", r4.message()); AssertionResult r5 = AssertionFailure(Message() << "ghi"); EXPECT_FALSE(r5); EXPECT_STREQ("ghi", r5.message()); } // Tests that the negation flips the predicate result but keeps the message. TEST(AssertionResultTest, NegationWorks) { AssertionResult r1 = AssertionSuccess() << "abc"; EXPECT_FALSE(!r1); EXPECT_STREQ("abc", (!r1).message()); AssertionResult r2 = AssertionFailure() << "def"; EXPECT_TRUE(!r2); EXPECT_STREQ("def", (!r2).message()); } TEST(AssertionResultTest, StreamingWorks) { AssertionResult r = AssertionSuccess(); r << "abc" << 'd' << 0 << true; EXPECT_STREQ("abcd0true", r.message()); } TEST(AssertionResultTest, CanStreamOstreamManipulators) { AssertionResult r = AssertionSuccess(); r << "Data" << std::endl << std::flush << std::ends << "Will be visible"; EXPECT_STREQ("Data\n\\0Will be visible", r.message()); } // Tests streaming a user type whose definition and operator << are // both in the global namespace. class Base { public: explicit Base(int an_x) : x_(an_x) {} int x() const { return x_; } private: int x_; }; std::ostream& operator<<(std::ostream& os, const Base& val) { return os << val.x(); } std::ostream& operator<<(std::ostream& os, const Base* pointer) { return os << "(" << pointer->x() << ")"; } TEST(MessageTest, CanStreamUserTypeInGlobalNameSpace) { Message msg; Base a(1); msg << a << &a; // Uses ::operator<<. EXPECT_STREQ("1(1)", msg.GetString().c_str()); } // Tests streaming a user type whose definition and operator<< are // both in an unnamed namespace. namespace { class MyTypeInUnnamedNameSpace : public Base { public: explicit MyTypeInUnnamedNameSpace(int an_x): Base(an_x) {} }; std::ostream& operator<<(std::ostream& os, const MyTypeInUnnamedNameSpace& val) { return os << val.x(); } std::ostream& operator<<(std::ostream& os, const MyTypeInUnnamedNameSpace* pointer) { return os << "(" << pointer->x() << ")"; } } // namespace TEST(MessageTest, CanStreamUserTypeInUnnamedNameSpace) { Message msg; MyTypeInUnnamedNameSpace a(1); msg << a << &a; // Uses ::operator<<. EXPECT_STREQ("1(1)", msg.GetString().c_str()); } // Tests streaming a user type whose definition and operator<< are // both in a user namespace. namespace namespace1 { class MyTypeInNameSpace1 : public Base { public: explicit MyTypeInNameSpace1(int an_x): Base(an_x) {} }; std::ostream& operator<<(std::ostream& os, const MyTypeInNameSpace1& val) { return os << val.x(); } std::ostream& operator<<(std::ostream& os, const MyTypeInNameSpace1* pointer) { return os << "(" << pointer->x() << ")"; } } // namespace namespace1 TEST(MessageTest, CanStreamUserTypeInUserNameSpace) { Message msg; namespace1::MyTypeInNameSpace1 a(1); msg << a << &a; // Uses namespace1::operator<<. EXPECT_STREQ("1(1)", msg.GetString().c_str()); } // Tests streaming a user type whose definition is in a user namespace // but whose operator<< is in the global namespace. namespace namespace2 { class MyTypeInNameSpace2 : public ::Base { public: explicit MyTypeInNameSpace2(int an_x): Base(an_x) {} }; } // namespace namespace2 std::ostream& operator<<(std::ostream& os, const namespace2::MyTypeInNameSpace2& val) { return os << val.x(); } std::ostream& operator<<(std::ostream& os, const namespace2::MyTypeInNameSpace2* pointer) { return os << "(" << pointer->x() << ")"; } TEST(MessageTest, CanStreamUserTypeInUserNameSpaceWithStreamOperatorInGlobal) { Message msg; namespace2::MyTypeInNameSpace2 a(1); msg << a << &a; // Uses ::operator<<. EXPECT_STREQ("1(1)", msg.GetString().c_str()); } // Tests streaming NULL pointers to testing::Message. TEST(MessageTest, NullPointers) { Message msg; char* const p1 = NULL; unsigned char* const p2 = NULL; int* p3 = NULL; double* p4 = NULL; bool* p5 = NULL; Message* p6 = NULL; msg << p1 << p2 << p3 << p4 << p5 << p6; ASSERT_STREQ("(null)(null)(null)(null)(null)(null)", msg.GetString().c_str()); } // Tests streaming wide strings to testing::Message. TEST(MessageTest, WideStrings) { // Streams a NULL of type const wchar_t*. const wchar_t* const_wstr = NULL; EXPECT_STREQ("(null)", (Message() << const_wstr).GetString().c_str()); // Streams a NULL of type wchar_t*. wchar_t* wstr = NULL; EXPECT_STREQ("(null)", (Message() << wstr).GetString().c_str()); // Streams a non-NULL of type const wchar_t*. const_wstr = L"abc\x8119"; EXPECT_STREQ("abc\xe8\x84\x99", (Message() << const_wstr).GetString().c_str()); // Streams a non-NULL of type wchar_t*. wstr = const_cast(const_wstr); EXPECT_STREQ("abc\xe8\x84\x99", (Message() << wstr).GetString().c_str()); } // This line tests that we can define tests in the testing namespace. namespace testing { // Tests the TestInfo class. class TestInfoTest : public Test { protected: static const TestInfo* GetTestInfo(const char* test_name) { const TestCase* const test_case = GetUnitTestImpl()-> GetTestCase("TestInfoTest", "", NULL, NULL); for (int i = 0; i < test_case->total_test_count(); ++i) { const TestInfo* const test_info = test_case->GetTestInfo(i); if (strcmp(test_name, test_info->name()) == 0) return test_info; } return NULL; } static const TestResult* GetTestResult( const TestInfo* test_info) { return test_info->result(); } }; // Tests TestInfo::test_case_name() and TestInfo::name(). TEST_F(TestInfoTest, Names) { const TestInfo* const test_info = GetTestInfo("Names"); ASSERT_STREQ("TestInfoTest", test_info->test_case_name()); ASSERT_STREQ("Names", test_info->name()); } // Tests TestInfo::result(). TEST_F(TestInfoTest, result) { const TestInfo* const test_info = GetTestInfo("result"); // Initially, there is no TestPartResult for this test. ASSERT_EQ(0, GetTestResult(test_info)->total_part_count()); // After the previous assertion, there is still none. ASSERT_EQ(0, GetTestResult(test_info)->total_part_count()); } // Tests setting up and tearing down a test case. class SetUpTestCaseTest : public Test { protected: // This will be called once before the first test in this test case // is run. static void SetUpTestCase() { printf("Setting up the test case . . .\n"); // Initializes some shared resource. In this simple example, we // just create a C string. More complex stuff can be done if // desired. shared_resource_ = "123"; // Increments the number of test cases that have been set up. counter_++; // SetUpTestCase() should be called only once. EXPECT_EQ(1, counter_); } // This will be called once after the last test in this test case is // run. static void TearDownTestCase() { printf("Tearing down the test case . . .\n"); // Decrements the number of test cases that have been set up. counter_--; // TearDownTestCase() should be called only once. EXPECT_EQ(0, counter_); // Cleans up the shared resource. shared_resource_ = NULL; } // This will be called before each test in this test case. virtual void SetUp() { // SetUpTestCase() should be called only once, so counter_ should // always be 1. EXPECT_EQ(1, counter_); } // Number of test cases that have been set up. static int counter_; // Some resource to be shared by all tests in this test case. static const char* shared_resource_; }; int SetUpTestCaseTest::counter_ = 0; const char* SetUpTestCaseTest::shared_resource_ = NULL; // A test that uses the shared resource. TEST_F(SetUpTestCaseTest, Test1) { EXPECT_STRNE(NULL, shared_resource_); } // Another test that uses the shared resource. TEST_F(SetUpTestCaseTest, Test2) { EXPECT_STREQ("123", shared_resource_); } // The InitGoogleTestTest test case tests testing::InitGoogleTest(). // The Flags struct stores a copy of all Google Test flags. struct Flags { // Constructs a Flags struct where each flag has its default value. Flags() : also_run_disabled_tests(false), break_on_failure(false), catch_exceptions(false), death_test_use_fork(false), filter(""), list_tests(false), output(""), print_time(true), random_seed(0), repeat(1), shuffle(false), stack_trace_depth(kMaxStackTraceDepth), stream_result_to(""), throw_on_failure(false) {} // Factory methods. // Creates a Flags struct where the gtest_also_run_disabled_tests flag has // the given value. static Flags AlsoRunDisabledTests(bool also_run_disabled_tests) { Flags flags; flags.also_run_disabled_tests = also_run_disabled_tests; return flags; } // Creates a Flags struct where the gtest_break_on_failure flag has // the given value. static Flags BreakOnFailure(bool break_on_failure) { Flags flags; flags.break_on_failure = break_on_failure; return flags; } // Creates a Flags struct where the gtest_catch_exceptions flag has // the given value. static Flags CatchExceptions(bool catch_exceptions) { Flags flags; flags.catch_exceptions = catch_exceptions; return flags; } // Creates a Flags struct where the gtest_death_test_use_fork flag has // the given value. static Flags DeathTestUseFork(bool death_test_use_fork) { Flags flags; flags.death_test_use_fork = death_test_use_fork; return flags; } // Creates a Flags struct where the gtest_filter flag has the given // value. static Flags Filter(const char* filter) { Flags flags; flags.filter = filter; return flags; } // Creates a Flags struct where the gtest_list_tests flag has the // given value. static Flags ListTests(bool list_tests) { Flags flags; flags.list_tests = list_tests; return flags; } // Creates a Flags struct where the gtest_output flag has the given // value. static Flags Output(const char* output) { Flags flags; flags.output = output; return flags; } // Creates a Flags struct where the gtest_print_time flag has the given // value. static Flags PrintTime(bool print_time) { Flags flags; flags.print_time = print_time; return flags; } // Creates a Flags struct where the gtest_random_seed flag has // the given value. static Flags RandomSeed(Int32 random_seed) { Flags flags; flags.random_seed = random_seed; return flags; } // Creates a Flags struct where the gtest_repeat flag has the given // value. static Flags Repeat(Int32 repeat) { Flags flags; flags.repeat = repeat; return flags; } // Creates a Flags struct where the gtest_shuffle flag has // the given value. static Flags Shuffle(bool shuffle) { Flags flags; flags.shuffle = shuffle; return flags; } // Creates a Flags struct where the GTEST_FLAG(stack_trace_depth) flag has // the given value. static Flags StackTraceDepth(Int32 stack_trace_depth) { Flags flags; flags.stack_trace_depth = stack_trace_depth; return flags; } // Creates a Flags struct where the GTEST_FLAG(stream_result_to) flag has // the given value. static Flags StreamResultTo(const char* stream_result_to) { Flags flags; flags.stream_result_to = stream_result_to; return flags; } // Creates a Flags struct where the gtest_throw_on_failure flag has // the given value. static Flags ThrowOnFailure(bool throw_on_failure) { Flags flags; flags.throw_on_failure = throw_on_failure; return flags; } // These fields store the flag values. bool also_run_disabled_tests; bool break_on_failure; bool catch_exceptions; bool death_test_use_fork; const char* filter; bool list_tests; const char* output; bool print_time; Int32 random_seed; Int32 repeat; bool shuffle; Int32 stack_trace_depth; const char* stream_result_to; bool throw_on_failure; }; // Fixture for testing InitGoogleTest(). class InitGoogleTestTest : public Test { protected: // Clears the flags before each test. virtual void SetUp() { GTEST_FLAG(also_run_disabled_tests) = false; GTEST_FLAG(break_on_failure) = false; GTEST_FLAG(catch_exceptions) = false; GTEST_FLAG(death_test_use_fork) = false; GTEST_FLAG(filter) = ""; GTEST_FLAG(list_tests) = false; GTEST_FLAG(output) = ""; GTEST_FLAG(print_time) = true; GTEST_FLAG(random_seed) = 0; GTEST_FLAG(repeat) = 1; GTEST_FLAG(shuffle) = false; GTEST_FLAG(stack_trace_depth) = kMaxStackTraceDepth; GTEST_FLAG(stream_result_to) = ""; GTEST_FLAG(throw_on_failure) = false; } // Asserts that two narrow or wide string arrays are equal. template static void AssertStringArrayEq(size_t size1, CharType** array1, size_t size2, CharType** array2) { ASSERT_EQ(size1, size2) << " Array sizes different."; for (size_t i = 0; i != size1; i++) { ASSERT_STREQ(array1[i], array2[i]) << " where i == " << i; } } // Verifies that the flag values match the expected values. static void CheckFlags(const Flags& expected) { EXPECT_EQ(expected.also_run_disabled_tests, GTEST_FLAG(also_run_disabled_tests)); EXPECT_EQ(expected.break_on_failure, GTEST_FLAG(break_on_failure)); EXPECT_EQ(expected.catch_exceptions, GTEST_FLAG(catch_exceptions)); EXPECT_EQ(expected.death_test_use_fork, GTEST_FLAG(death_test_use_fork)); EXPECT_STREQ(expected.filter, GTEST_FLAG(filter).c_str()); EXPECT_EQ(expected.list_tests, GTEST_FLAG(list_tests)); EXPECT_STREQ(expected.output, GTEST_FLAG(output).c_str()); EXPECT_EQ(expected.print_time, GTEST_FLAG(print_time)); EXPECT_EQ(expected.random_seed, GTEST_FLAG(random_seed)); EXPECT_EQ(expected.repeat, GTEST_FLAG(repeat)); EXPECT_EQ(expected.shuffle, GTEST_FLAG(shuffle)); EXPECT_EQ(expected.stack_trace_depth, GTEST_FLAG(stack_trace_depth)); EXPECT_STREQ(expected.stream_result_to, GTEST_FLAG(stream_result_to).c_str()); EXPECT_EQ(expected.throw_on_failure, GTEST_FLAG(throw_on_failure)); } // Parses a command line (specified by argc1 and argv1), then // verifies that the flag values are expected and that the // recognized flags are removed from the command line. template static void TestParsingFlags(int argc1, const CharType** argv1, int argc2, const CharType** argv2, const Flags& expected, bool should_print_help) { const bool saved_help_flag = ::testing::internal::g_help_flag; ::testing::internal::g_help_flag = false; #if GTEST_HAS_STREAM_REDIRECTION CaptureStdout(); #endif // Parses the command line. internal::ParseGoogleTestFlagsOnly(&argc1, const_cast(argv1)); #if GTEST_HAS_STREAM_REDIRECTION const String captured_stdout = GetCapturedStdout(); #endif // Verifies the flag values. CheckFlags(expected); // Verifies that the recognized flags are removed from the command // line. AssertStringArrayEq(argc1 + 1, argv1, argc2 + 1, argv2); // ParseGoogleTestFlagsOnly should neither set g_help_flag nor print the // help message for the flags it recognizes. EXPECT_EQ(should_print_help, ::testing::internal::g_help_flag); #if GTEST_HAS_STREAM_REDIRECTION const char* const expected_help_fragment = "This program contains tests written using"; if (should_print_help) { EXPECT_PRED_FORMAT2(IsSubstring, expected_help_fragment, captured_stdout); } else { EXPECT_PRED_FORMAT2(IsNotSubstring, expected_help_fragment, captured_stdout); } #endif // GTEST_HAS_STREAM_REDIRECTION ::testing::internal::g_help_flag = saved_help_flag; } // This macro wraps TestParsingFlags s.t. the user doesn't need // to specify the array sizes. #define GTEST_TEST_PARSING_FLAGS_(argv1, argv2, expected, should_print_help) \ TestParsingFlags(sizeof(argv1)/sizeof(*argv1) - 1, argv1, \ sizeof(argv2)/sizeof(*argv2) - 1, argv2, \ expected, should_print_help) }; // Tests parsing an empty command line. TEST_F(InitGoogleTestTest, Empty) { const char* argv[] = { NULL }; const char* argv2[] = { NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags(), false); } // Tests parsing a command line that has no flag. TEST_F(InitGoogleTestTest, NoFlag) { const char* argv[] = { "foo.exe", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags(), false); } // Tests parsing a bad --gtest_filter flag. TEST_F(InitGoogleTestTest, FilterBad) { const char* argv[] = { "foo.exe", "--gtest_filter", NULL }; const char* argv2[] = { "foo.exe", "--gtest_filter", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Filter(""), true); } // Tests parsing an empty --gtest_filter flag. TEST_F(InitGoogleTestTest, FilterEmpty) { const char* argv[] = { "foo.exe", "--gtest_filter=", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Filter(""), false); } // Tests parsing a non-empty --gtest_filter flag. TEST_F(InitGoogleTestTest, FilterNonEmpty) { const char* argv[] = { "foo.exe", "--gtest_filter=abc", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Filter("abc"), false); } // Tests parsing --gtest_break_on_failure. TEST_F(InitGoogleTestTest, BreakOnFailureWithoutValue) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::BreakOnFailure(true), false); } // Tests parsing --gtest_break_on_failure=0. TEST_F(InitGoogleTestTest, BreakOnFailureFalse_0) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::BreakOnFailure(false), false); } // Tests parsing --gtest_break_on_failure=f. TEST_F(InitGoogleTestTest, BreakOnFailureFalse_f) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure=f", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::BreakOnFailure(false), false); } // Tests parsing --gtest_break_on_failure=F. TEST_F(InitGoogleTestTest, BreakOnFailureFalse_F) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure=F", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::BreakOnFailure(false), false); } // Tests parsing a --gtest_break_on_failure flag that has a "true" // definition. TEST_F(InitGoogleTestTest, BreakOnFailureTrue) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::BreakOnFailure(true), false); } // Tests parsing --gtest_catch_exceptions. TEST_F(InitGoogleTestTest, CatchExceptions) { const char* argv[] = { "foo.exe", "--gtest_catch_exceptions", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::CatchExceptions(true), false); } // Tests parsing --gtest_death_test_use_fork. TEST_F(InitGoogleTestTest, DeathTestUseFork) { const char* argv[] = { "foo.exe", "--gtest_death_test_use_fork", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::DeathTestUseFork(true), false); } // Tests having the same flag twice with different values. The // expected behavior is that the one coming last takes precedence. TEST_F(InitGoogleTestTest, DuplicatedFlags) { const char* argv[] = { "foo.exe", "--gtest_filter=a", "--gtest_filter=b", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Filter("b"), false); } // Tests having an unrecognized flag on the command line. TEST_F(InitGoogleTestTest, UnrecognizedFlag) { const char* argv[] = { "foo.exe", "--gtest_break_on_failure", "bar", // Unrecognized by Google Test. "--gtest_filter=b", NULL }; const char* argv2[] = { "foo.exe", "bar", NULL }; Flags flags; flags.break_on_failure = true; flags.filter = "b"; GTEST_TEST_PARSING_FLAGS_(argv, argv2, flags, false); } // Tests having a --gtest_list_tests flag TEST_F(InitGoogleTestTest, ListTestsFlag) { const char* argv[] = { "foo.exe", "--gtest_list_tests", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ListTests(true), false); } // Tests having a --gtest_list_tests flag with a "true" value TEST_F(InitGoogleTestTest, ListTestsTrue) { const char* argv[] = { "foo.exe", "--gtest_list_tests=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ListTests(true), false); } // Tests having a --gtest_list_tests flag with a "false" value TEST_F(InitGoogleTestTest, ListTestsFalse) { const char* argv[] = { "foo.exe", "--gtest_list_tests=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ListTests(false), false); } // Tests parsing --gtest_list_tests=f. TEST_F(InitGoogleTestTest, ListTestsFalse_f) { const char* argv[] = { "foo.exe", "--gtest_list_tests=f", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ListTests(false), false); } // Tests parsing --gtest_list_tests=F. TEST_F(InitGoogleTestTest, ListTestsFalse_F) { const char* argv[] = { "foo.exe", "--gtest_list_tests=F", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ListTests(false), false); } // Tests parsing --gtest_output (invalid). TEST_F(InitGoogleTestTest, OutputEmpty) { const char* argv[] = { "foo.exe", "--gtest_output", NULL }; const char* argv2[] = { "foo.exe", "--gtest_output", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags(), true); } // Tests parsing --gtest_output=xml TEST_F(InitGoogleTestTest, OutputXml) { const char* argv[] = { "foo.exe", "--gtest_output=xml", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Output("xml"), false); } // Tests parsing --gtest_output=xml:file TEST_F(InitGoogleTestTest, OutputXmlFile) { const char* argv[] = { "foo.exe", "--gtest_output=xml:file", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Output("xml:file"), false); } // Tests parsing --gtest_output=xml:directory/path/ TEST_F(InitGoogleTestTest, OutputXmlDirectory) { const char* argv[] = { "foo.exe", "--gtest_output=xml:directory/path/", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Output("xml:directory/path/"), false); } // Tests having a --gtest_print_time flag TEST_F(InitGoogleTestTest, PrintTimeFlag) { const char* argv[] = { "foo.exe", "--gtest_print_time", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::PrintTime(true), false); } // Tests having a --gtest_print_time flag with a "true" value TEST_F(InitGoogleTestTest, PrintTimeTrue) { const char* argv[] = { "foo.exe", "--gtest_print_time=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::PrintTime(true), false); } // Tests having a --gtest_print_time flag with a "false" value TEST_F(InitGoogleTestTest, PrintTimeFalse) { const char* argv[] = { "foo.exe", "--gtest_print_time=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::PrintTime(false), false); } // Tests parsing --gtest_print_time=f. TEST_F(InitGoogleTestTest, PrintTimeFalse_f) { const char* argv[] = { "foo.exe", "--gtest_print_time=f", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::PrintTime(false), false); } // Tests parsing --gtest_print_time=F. TEST_F(InitGoogleTestTest, PrintTimeFalse_F) { const char* argv[] = { "foo.exe", "--gtest_print_time=F", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::PrintTime(false), false); } // Tests parsing --gtest_random_seed=number TEST_F(InitGoogleTestTest, RandomSeed) { const char* argv[] = { "foo.exe", "--gtest_random_seed=1000", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::RandomSeed(1000), false); } // Tests parsing --gtest_repeat=number TEST_F(InitGoogleTestTest, Repeat) { const char* argv[] = { "foo.exe", "--gtest_repeat=1000", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Repeat(1000), false); } // Tests having a --gtest_also_run_disabled_tests flag TEST_F(InitGoogleTestTest, AlsoRunDisabledTestsFlag) { const char* argv[] = { "foo.exe", "--gtest_also_run_disabled_tests", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::AlsoRunDisabledTests(true), false); } // Tests having a --gtest_also_run_disabled_tests flag with a "true" value TEST_F(InitGoogleTestTest, AlsoRunDisabledTestsTrue) { const char* argv[] = { "foo.exe", "--gtest_also_run_disabled_tests=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::AlsoRunDisabledTests(true), false); } // Tests having a --gtest_also_run_disabled_tests flag with a "false" value TEST_F(InitGoogleTestTest, AlsoRunDisabledTestsFalse) { const char* argv[] = { "foo.exe", "--gtest_also_run_disabled_tests=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::AlsoRunDisabledTests(false), false); } // Tests parsing --gtest_shuffle. TEST_F(InitGoogleTestTest, ShuffleWithoutValue) { const char* argv[] = { "foo.exe", "--gtest_shuffle", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Shuffle(true), false); } // Tests parsing --gtest_shuffle=0. TEST_F(InitGoogleTestTest, ShuffleFalse_0) { const char* argv[] = { "foo.exe", "--gtest_shuffle=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Shuffle(false), false); } // Tests parsing a --gtest_shuffle flag that has a "true" // definition. TEST_F(InitGoogleTestTest, ShuffleTrue) { const char* argv[] = { "foo.exe", "--gtest_shuffle=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::Shuffle(true), false); } // Tests parsing --gtest_stack_trace_depth=number. TEST_F(InitGoogleTestTest, StackTraceDepth) { const char* argv[] = { "foo.exe", "--gtest_stack_trace_depth=5", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::StackTraceDepth(5), false); } TEST_F(InitGoogleTestTest, StreamResultTo) { const char* argv[] = { "foo.exe", "--gtest_stream_result_to=localhost:1234", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_( argv, argv2, Flags::StreamResultTo("localhost:1234"), false); } // Tests parsing --gtest_throw_on_failure. TEST_F(InitGoogleTestTest, ThrowOnFailureWithoutValue) { const char* argv[] = { "foo.exe", "--gtest_throw_on_failure", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ThrowOnFailure(true), false); } // Tests parsing --gtest_throw_on_failure=0. TEST_F(InitGoogleTestTest, ThrowOnFailureFalse_0) { const char* argv[] = { "foo.exe", "--gtest_throw_on_failure=0", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ThrowOnFailure(false), false); } // Tests parsing a --gtest_throw_on_failure flag that has a "true" // definition. TEST_F(InitGoogleTestTest, ThrowOnFailureTrue) { const char* argv[] = { "foo.exe", "--gtest_throw_on_failure=1", NULL }; const char* argv2[] = { "foo.exe", NULL }; GTEST_TEST_PARSING_FLAGS_(argv, argv2, Flags::ThrowOnFailure(true), false); } #if GTEST_OS_WINDOWS // Tests parsing wide strings. TEST_F(InitGoogleTestTest, WideStrings) { const wchar_t* argv[] = { L"foo.exe", L"--gtest_filter=Foo*", L"--gtest_list_tests=1", L"--gtest_break_on_failure", L"--non_gtest_flag", NULL }; const wchar_t* argv2[] = { L"foo.exe", L"--non_gtest_flag", NULL }; Flags expected_flags; expected_flags.break_on_failure = true; expected_flags.filter = "Foo*"; expected_flags.list_tests = true; GTEST_TEST_PARSING_FLAGS_(argv, argv2, expected_flags, false); } #endif // GTEST_OS_WINDOWS // Tests current_test_info() in UnitTest. class CurrentTestInfoTest : public Test { protected: // Tests that current_test_info() returns NULL before the first test in // the test case is run. static void SetUpTestCase() { // There should be no tests running at this point. const TestInfo* test_info = UnitTest::GetInstance()->current_test_info(); EXPECT_TRUE(test_info == NULL) << "There should be no tests running at this point."; } // Tests that current_test_info() returns NULL after the last test in // the test case has run. static void TearDownTestCase() { const TestInfo* test_info = UnitTest::GetInstance()->current_test_info(); EXPECT_TRUE(test_info == NULL) << "There should be no tests running at this point."; } }; // Tests that current_test_info() returns TestInfo for currently running // test by checking the expected test name against the actual one. TEST_F(CurrentTestInfoTest, WorksForFirstTestInATestCase) { const TestInfo* test_info = UnitTest::GetInstance()->current_test_info(); ASSERT_TRUE(NULL != test_info) << "There is a test running so we should have a valid TestInfo."; EXPECT_STREQ("CurrentTestInfoTest", test_info->test_case_name()) << "Expected the name of the currently running test case."; EXPECT_STREQ("WorksForFirstTestInATestCase", test_info->name()) << "Expected the name of the currently running test."; } // Tests that current_test_info() returns TestInfo for currently running // test by checking the expected test name against the actual one. We // use this test to see that the TestInfo object actually changed from // the previous invocation. TEST_F(CurrentTestInfoTest, WorksForSecondTestInATestCase) { const TestInfo* test_info = UnitTest::GetInstance()->current_test_info(); ASSERT_TRUE(NULL != test_info) << "There is a test running so we should have a valid TestInfo."; EXPECT_STREQ("CurrentTestInfoTest", test_info->test_case_name()) << "Expected the name of the currently running test case."; EXPECT_STREQ("WorksForSecondTestInATestCase", test_info->name()) << "Expected the name of the currently running test."; } } // namespace testing // These two lines test that we can define tests in a namespace that // has the name "testing" and is nested in another namespace. namespace my_namespace { namespace testing { // Makes sure that TEST knows to use ::testing::Test instead of // ::my_namespace::testing::Test. class Test {}; // Makes sure that an assertion knows to use ::testing::Message instead of // ::my_namespace::testing::Message. class Message {}; // Makes sure that an assertion knows to use // ::testing::AssertionResult instead of // ::my_namespace::testing::AssertionResult. class AssertionResult {}; // Tests that an assertion that should succeed works as expected. TEST(NestedTestingNamespaceTest, Success) { EXPECT_EQ(1, 1) << "This shouldn't fail."; } // Tests that an assertion that should fail works as expected. TEST(NestedTestingNamespaceTest, Failure) { EXPECT_FATAL_FAILURE(FAIL() << "This failure is expected.", "This failure is expected."); } } // namespace testing } // namespace my_namespace // Tests that one can call superclass SetUp and TearDown methods-- // that is, that they are not private. // No tests are based on this fixture; the test "passes" if it compiles // successfully. class ProtectedFixtureMethodsTest : public Test { protected: virtual void SetUp() { Test::SetUp(); } virtual void TearDown() { Test::TearDown(); } }; // StreamingAssertionsTest tests the streaming versions of a representative // sample of assertions. TEST(StreamingAssertionsTest, Unconditional) { SUCCEED() << "expected success"; EXPECT_NONFATAL_FAILURE(ADD_FAILURE() << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(FAIL() << "expected failure", "expected failure"); } #ifdef __BORLANDC__ // Silences warnings: "Condition is always true", "Unreachable code" # pragma option push -w-ccc -w-rch #endif TEST(StreamingAssertionsTest, Truth) { EXPECT_TRUE(true) << "unexpected failure"; ASSERT_TRUE(true) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_TRUE(false) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_TRUE(false) << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, Truth2) { EXPECT_FALSE(false) << "unexpected failure"; ASSERT_FALSE(false) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_FALSE(true) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_FALSE(true) << "expected failure", "expected failure"); } #ifdef __BORLANDC__ // Restores warnings after previous "#pragma option push" supressed them # pragma option pop #endif TEST(StreamingAssertionsTest, IntegerEquals) { EXPECT_EQ(1, 1) << "unexpected failure"; ASSERT_EQ(1, 1) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_EQ(1, 2) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_EQ(1, 2) << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, IntegerLessThan) { EXPECT_LT(1, 2) << "unexpected failure"; ASSERT_LT(1, 2) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_LT(2, 1) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_LT(2, 1) << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, StringsEqual) { EXPECT_STREQ("foo", "foo") << "unexpected failure"; ASSERT_STREQ("foo", "foo") << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_STREQ("foo", "bar") << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_STREQ("foo", "bar") << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, StringsNotEqual) { EXPECT_STRNE("foo", "bar") << "unexpected failure"; ASSERT_STRNE("foo", "bar") << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_STRNE("foo", "foo") << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_STRNE("foo", "foo") << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, StringsEqualIgnoringCase) { EXPECT_STRCASEEQ("foo", "FOO") << "unexpected failure"; ASSERT_STRCASEEQ("foo", "FOO") << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_STRCASEEQ("foo", "bar") << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_STRCASEEQ("foo", "bar") << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, StringNotEqualIgnoringCase) { EXPECT_STRCASENE("foo", "bar") << "unexpected failure"; ASSERT_STRCASENE("foo", "bar") << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_STRCASENE("foo", "FOO") << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_STRCASENE("bar", "BAR") << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, FloatingPointEquals) { EXPECT_FLOAT_EQ(1.0, 1.0) << "unexpected failure"; ASSERT_FLOAT_EQ(1.0, 1.0) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_FLOAT_EQ(0.0, 1.0) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_FLOAT_EQ(0.0, 1.0) << "expected failure", "expected failure"); } #if GTEST_HAS_EXCEPTIONS TEST(StreamingAssertionsTest, Throw) { EXPECT_THROW(ThrowAnInteger(), int) << "unexpected failure"; ASSERT_THROW(ThrowAnInteger(), int) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_THROW(ThrowAnInteger(), bool) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_THROW(ThrowAnInteger(), bool) << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, NoThrow) { EXPECT_NO_THROW(ThrowNothing()) << "unexpected failure"; ASSERT_NO_THROW(ThrowNothing()) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_NO_THROW(ThrowAnInteger()) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_NO_THROW(ThrowAnInteger()) << "expected failure", "expected failure"); } TEST(StreamingAssertionsTest, AnyThrow) { EXPECT_ANY_THROW(ThrowAnInteger()) << "unexpected failure"; ASSERT_ANY_THROW(ThrowAnInteger()) << "unexpected failure"; EXPECT_NONFATAL_FAILURE(EXPECT_ANY_THROW(ThrowNothing()) << "expected failure", "expected failure"); EXPECT_FATAL_FAILURE(ASSERT_ANY_THROW(ThrowNothing()) << "expected failure", "expected failure"); } #endif // GTEST_HAS_EXCEPTIONS // Tests that Google Test correctly decides whether to use colors in the output. TEST(ColoredOutputTest, UsesColorsWhenGTestColorFlagIsYes) { GTEST_FLAG(color) = "yes"; SetEnv("TERM", "xterm"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. EXPECT_TRUE(ShouldUseColor(false)); // Stdout is not a TTY. SetEnv("TERM", "dumb"); // TERM doesn't support colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. EXPECT_TRUE(ShouldUseColor(false)); // Stdout is not a TTY. } TEST(ColoredOutputTest, UsesColorsWhenGTestColorFlagIsAliasOfYes) { SetEnv("TERM", "dumb"); // TERM doesn't support colors. GTEST_FLAG(color) = "True"; EXPECT_TRUE(ShouldUseColor(false)); // Stdout is not a TTY. GTEST_FLAG(color) = "t"; EXPECT_TRUE(ShouldUseColor(false)); // Stdout is not a TTY. GTEST_FLAG(color) = "1"; EXPECT_TRUE(ShouldUseColor(false)); // Stdout is not a TTY. } TEST(ColoredOutputTest, UsesNoColorWhenGTestColorFlagIsNo) { GTEST_FLAG(color) = "no"; SetEnv("TERM", "xterm"); // TERM supports colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. EXPECT_FALSE(ShouldUseColor(false)); // Stdout is not a TTY. SetEnv("TERM", "dumb"); // TERM doesn't support colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. EXPECT_FALSE(ShouldUseColor(false)); // Stdout is not a TTY. } TEST(ColoredOutputTest, UsesNoColorWhenGTestColorFlagIsInvalid) { SetEnv("TERM", "xterm"); // TERM supports colors. GTEST_FLAG(color) = "F"; EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. GTEST_FLAG(color) = "0"; EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. GTEST_FLAG(color) = "unknown"; EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. } TEST(ColoredOutputTest, UsesColorsWhenStdoutIsTty) { GTEST_FLAG(color) = "auto"; SetEnv("TERM", "xterm"); // TERM supports colors. EXPECT_FALSE(ShouldUseColor(false)); // Stdout is not a TTY. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. } TEST(ColoredOutputTest, UsesColorsWhenTermSupportsColors) { GTEST_FLAG(color) = "auto"; #if GTEST_OS_WINDOWS // On Windows, we ignore the TERM variable as it's usually not set. SetEnv("TERM", "dumb"); EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", ""); EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "xterm"); EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. #else // On non-Windows platforms, we rely on TERM to determine if the // terminal supports colors. SetEnv("TERM", "dumb"); // TERM doesn't support colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "emacs"); // TERM doesn't support colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "vt100"); // TERM doesn't support colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "xterm-mono"); // TERM doesn't support colors. EXPECT_FALSE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "xterm"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "xterm-color"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "xterm-256color"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "screen"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "linux"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. SetEnv("TERM", "cygwin"); // TERM supports colors. EXPECT_TRUE(ShouldUseColor(true)); // Stdout is a TTY. #endif // GTEST_OS_WINDOWS } // Verifies that StaticAssertTypeEq works in a namespace scope. static bool dummy1 GTEST_ATTRIBUTE_UNUSED_ = StaticAssertTypeEq(); static bool dummy2 GTEST_ATTRIBUTE_UNUSED_ = StaticAssertTypeEq(); // Verifies that StaticAssertTypeEq works in a class. template class StaticAssertTypeEqTestHelper { public: StaticAssertTypeEqTestHelper() { StaticAssertTypeEq(); } }; TEST(StaticAssertTypeEqTest, WorksInClass) { StaticAssertTypeEqTestHelper(); } // Verifies that StaticAssertTypeEq works inside a function. typedef int IntAlias; TEST(StaticAssertTypeEqTest, CompilesForEqualTypes) { StaticAssertTypeEq(); StaticAssertTypeEq(); } TEST(GetCurrentOsStackTraceExceptTopTest, ReturnsTheStackTrace) { testing::UnitTest* const unit_test = testing::UnitTest::GetInstance(); // We don't have a stack walker in Google Test yet. EXPECT_STREQ("", GetCurrentOsStackTraceExceptTop(unit_test, 0).c_str()); EXPECT_STREQ("", GetCurrentOsStackTraceExceptTop(unit_test, 1).c_str()); } TEST(HasNonfatalFailureTest, ReturnsFalseWhenThereIsNoFailure) { EXPECT_FALSE(HasNonfatalFailure()); } static void FailFatally() { FAIL(); } TEST(HasNonfatalFailureTest, ReturnsFalseWhenThereIsOnlyFatalFailure) { FailFatally(); const bool has_nonfatal_failure = HasNonfatalFailure(); ClearCurrentTestPartResults(); EXPECT_FALSE(has_nonfatal_failure); } TEST(HasNonfatalFailureTest, ReturnsTrueWhenThereIsNonfatalFailure) { ADD_FAILURE(); const bool has_nonfatal_failure = HasNonfatalFailure(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_nonfatal_failure); } TEST(HasNonfatalFailureTest, ReturnsTrueWhenThereAreFatalAndNonfatalFailures) { FailFatally(); ADD_FAILURE(); const bool has_nonfatal_failure = HasNonfatalFailure(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_nonfatal_failure); } // A wrapper for calling HasNonfatalFailure outside of a test body. static bool HasNonfatalFailureHelper() { return testing::Test::HasNonfatalFailure(); } TEST(HasNonfatalFailureTest, WorksOutsideOfTestBody) { EXPECT_FALSE(HasNonfatalFailureHelper()); } TEST(HasNonfatalFailureTest, WorksOutsideOfTestBody2) { ADD_FAILURE(); const bool has_nonfatal_failure = HasNonfatalFailureHelper(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_nonfatal_failure); } TEST(HasFailureTest, ReturnsFalseWhenThereIsNoFailure) { EXPECT_FALSE(HasFailure()); } TEST(HasFailureTest, ReturnsTrueWhenThereIsFatalFailure) { FailFatally(); const bool has_failure = HasFailure(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_failure); } TEST(HasFailureTest, ReturnsTrueWhenThereIsNonfatalFailure) { ADD_FAILURE(); const bool has_failure = HasFailure(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_failure); } TEST(HasFailureTest, ReturnsTrueWhenThereAreFatalAndNonfatalFailures) { FailFatally(); ADD_FAILURE(); const bool has_failure = HasFailure(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_failure); } // A wrapper for calling HasFailure outside of a test body. static bool HasFailureHelper() { return testing::Test::HasFailure(); } TEST(HasFailureTest, WorksOutsideOfTestBody) { EXPECT_FALSE(HasFailureHelper()); } TEST(HasFailureTest, WorksOutsideOfTestBody2) { ADD_FAILURE(); const bool has_failure = HasFailureHelper(); ClearCurrentTestPartResults(); EXPECT_TRUE(has_failure); } class TestListener : public EmptyTestEventListener { public: TestListener() : on_start_counter_(NULL), is_destroyed_(NULL) {} TestListener(int* on_start_counter, bool* is_destroyed) : on_start_counter_(on_start_counter), is_destroyed_(is_destroyed) {} virtual ~TestListener() { if (is_destroyed_) *is_destroyed_ = true; } protected: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) { if (on_start_counter_ != NULL) (*on_start_counter_)++; } private: int* on_start_counter_; bool* is_destroyed_; }; // Tests the constructor. TEST(TestEventListenersTest, ConstructionWorks) { TestEventListeners listeners; EXPECT_TRUE(TestEventListenersAccessor::GetRepeater(&listeners) != NULL); EXPECT_TRUE(listeners.default_result_printer() == NULL); EXPECT_TRUE(listeners.default_xml_generator() == NULL); } // Tests that the TestEventListeners destructor deletes all the listeners it // owns. TEST(TestEventListenersTest, DestructionWorks) { bool default_result_printer_is_destroyed = false; bool default_xml_printer_is_destroyed = false; bool extra_listener_is_destroyed = false; TestListener* default_result_printer = new TestListener( NULL, &default_result_printer_is_destroyed); TestListener* default_xml_printer = new TestListener( NULL, &default_xml_printer_is_destroyed); TestListener* extra_listener = new TestListener( NULL, &extra_listener_is_destroyed); { TestEventListeners listeners; TestEventListenersAccessor::SetDefaultResultPrinter(&listeners, default_result_printer); TestEventListenersAccessor::SetDefaultXmlGenerator(&listeners, default_xml_printer); listeners.Append(extra_listener); } EXPECT_TRUE(default_result_printer_is_destroyed); EXPECT_TRUE(default_xml_printer_is_destroyed); EXPECT_TRUE(extra_listener_is_destroyed); } // Tests that a listener Append'ed to a TestEventListeners list starts // receiving events. TEST(TestEventListenersTest, Append) { int on_start_counter = 0; bool is_destroyed = false; TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); { TestEventListeners listeners; listeners.Append(listener); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(1, on_start_counter); } EXPECT_TRUE(is_destroyed); } // Tests that listeners receive events in the order they were appended to // the list, except for *End requests, which must be received in the reverse // order. class SequenceTestingListener : public EmptyTestEventListener { public: SequenceTestingListener(std::vector* vector, const char* id) : vector_(vector), id_(id) {} protected: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) { vector_->push_back(GetEventDescription("OnTestProgramStart")); } virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) { vector_->push_back(GetEventDescription("OnTestProgramEnd")); } virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int /*iteration*/) { vector_->push_back(GetEventDescription("OnTestIterationStart")); } virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int /*iteration*/) { vector_->push_back(GetEventDescription("OnTestIterationEnd")); } private: String GetEventDescription(const char* method) { Message message; message << id_ << "." << method; return message.GetString(); } std::vector* vector_; const char* const id_; GTEST_DISALLOW_COPY_AND_ASSIGN_(SequenceTestingListener); }; TEST(EventListenerTest, AppendKeepsOrder) { std::vector vec; TestEventListeners listeners; listeners.Append(new SequenceTestingListener(&vec, "1st")); listeners.Append(new SequenceTestingListener(&vec, "2nd")); listeners.Append(new SequenceTestingListener(&vec, "3rd")); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); ASSERT_EQ(3U, vec.size()); EXPECT_STREQ("1st.OnTestProgramStart", vec[0].c_str()); EXPECT_STREQ("2nd.OnTestProgramStart", vec[1].c_str()); EXPECT_STREQ("3rd.OnTestProgramStart", vec[2].c_str()); vec.clear(); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramEnd( *UnitTest::GetInstance()); ASSERT_EQ(3U, vec.size()); EXPECT_STREQ("3rd.OnTestProgramEnd", vec[0].c_str()); EXPECT_STREQ("2nd.OnTestProgramEnd", vec[1].c_str()); EXPECT_STREQ("1st.OnTestProgramEnd", vec[2].c_str()); vec.clear(); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestIterationStart( *UnitTest::GetInstance(), 0); ASSERT_EQ(3U, vec.size()); EXPECT_STREQ("1st.OnTestIterationStart", vec[0].c_str()); EXPECT_STREQ("2nd.OnTestIterationStart", vec[1].c_str()); EXPECT_STREQ("3rd.OnTestIterationStart", vec[2].c_str()); vec.clear(); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestIterationEnd( *UnitTest::GetInstance(), 0); ASSERT_EQ(3U, vec.size()); EXPECT_STREQ("3rd.OnTestIterationEnd", vec[0].c_str()); EXPECT_STREQ("2nd.OnTestIterationEnd", vec[1].c_str()); EXPECT_STREQ("1st.OnTestIterationEnd", vec[2].c_str()); } // Tests that a listener removed from a TestEventListeners list stops receiving // events and is not deleted when the list is destroyed. TEST(TestEventListenersTest, Release) { int on_start_counter = 0; bool is_destroyed = false; // Although Append passes the ownership of this object to the list, // the following calls release it, and we need to delete it before the // test ends. TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); { TestEventListeners listeners; listeners.Append(listener); EXPECT_EQ(listener, listeners.Release(listener)); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_TRUE(listeners.Release(listener) == NULL); } EXPECT_EQ(0, on_start_counter); EXPECT_FALSE(is_destroyed); delete listener; } // Tests that no events are forwarded when event forwarding is disabled. TEST(EventListenerTest, SuppressEventForwarding) { int on_start_counter = 0; TestListener* listener = new TestListener(&on_start_counter, NULL); TestEventListeners listeners; listeners.Append(listener); ASSERT_TRUE(TestEventListenersAccessor::EventForwardingEnabled(listeners)); TestEventListenersAccessor::SuppressEventForwarding(&listeners); ASSERT_FALSE(TestEventListenersAccessor::EventForwardingEnabled(listeners)); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(0, on_start_counter); } // Tests that events generated by Google Test are not forwarded in // death test subprocesses. TEST(EventListenerDeathTest, EventsNotForwardedInDeathTestSubprecesses) { EXPECT_DEATH_IF_SUPPORTED({ GTEST_CHECK_(TestEventListenersAccessor::EventForwardingEnabled( *GetUnitTestImpl()->listeners())) << "expected failure";}, "expected failure"); } // Tests that a listener installed via SetDefaultResultPrinter() starts // receiving events and is returned via default_result_printer() and that // the previous default_result_printer is removed from the list and deleted. TEST(EventListenerTest, default_result_printer) { int on_start_counter = 0; bool is_destroyed = false; TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); TestEventListeners listeners; TestEventListenersAccessor::SetDefaultResultPrinter(&listeners, listener); EXPECT_EQ(listener, listeners.default_result_printer()); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(1, on_start_counter); // Replacing default_result_printer with something else should remove it // from the list and destroy it. TestEventListenersAccessor::SetDefaultResultPrinter(&listeners, NULL); EXPECT_TRUE(listeners.default_result_printer() == NULL); EXPECT_TRUE(is_destroyed); // After broadcasting an event the counter is still the same, indicating // the listener is not in the list anymore. TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(1, on_start_counter); } // Tests that the default_result_printer listener stops receiving events // when removed via Release and that is not owned by the list anymore. TEST(EventListenerTest, RemovingDefaultResultPrinterWorks) { int on_start_counter = 0; bool is_destroyed = false; // Although Append passes the ownership of this object to the list, // the following calls release it, and we need to delete it before the // test ends. TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); { TestEventListeners listeners; TestEventListenersAccessor::SetDefaultResultPrinter(&listeners, listener); EXPECT_EQ(listener, listeners.Release(listener)); EXPECT_TRUE(listeners.default_result_printer() == NULL); EXPECT_FALSE(is_destroyed); // Broadcasting events now should not affect default_result_printer. TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(0, on_start_counter); } // Destroying the list should not affect the listener now, too. EXPECT_FALSE(is_destroyed); delete listener; } // Tests that a listener installed via SetDefaultXmlGenerator() starts // receiving events and is returned via default_xml_generator() and that // the previous default_xml_generator is removed from the list and deleted. TEST(EventListenerTest, default_xml_generator) { int on_start_counter = 0; bool is_destroyed = false; TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); TestEventListeners listeners; TestEventListenersAccessor::SetDefaultXmlGenerator(&listeners, listener); EXPECT_EQ(listener, listeners.default_xml_generator()); TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(1, on_start_counter); // Replacing default_xml_generator with something else should remove it // from the list and destroy it. TestEventListenersAccessor::SetDefaultXmlGenerator(&listeners, NULL); EXPECT_TRUE(listeners.default_xml_generator() == NULL); EXPECT_TRUE(is_destroyed); // After broadcasting an event the counter is still the same, indicating // the listener is not in the list anymore. TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(1, on_start_counter); } // Tests that the default_xml_generator listener stops receiving events // when removed via Release and that is not owned by the list anymore. TEST(EventListenerTest, RemovingDefaultXmlGeneratorWorks) { int on_start_counter = 0; bool is_destroyed = false; // Although Append passes the ownership of this object to the list, // the following calls release it, and we need to delete it before the // test ends. TestListener* listener = new TestListener(&on_start_counter, &is_destroyed); { TestEventListeners listeners; TestEventListenersAccessor::SetDefaultXmlGenerator(&listeners, listener); EXPECT_EQ(listener, listeners.Release(listener)); EXPECT_TRUE(listeners.default_xml_generator() == NULL); EXPECT_FALSE(is_destroyed); // Broadcasting events now should not affect default_xml_generator. TestEventListenersAccessor::GetRepeater(&listeners)->OnTestProgramStart( *UnitTest::GetInstance()); EXPECT_EQ(0, on_start_counter); } // Destroying the list should not affect the listener now, too. EXPECT_FALSE(is_destroyed); delete listener; } // Sanity tests to ensure that the alternative, verbose spellings of // some of the macros work. We don't test them thoroughly as that // would be quite involved. Since their implementations are // straightforward, and they are rarely used, we'll just rely on the // users to tell us when they are broken. GTEST_TEST(AlternativeNameTest, Works) { // GTEST_TEST is the same as TEST. GTEST_SUCCEED() << "OK"; // GTEST_SUCCEED is the same as SUCCEED. // GTEST_FAIL is the same as FAIL. EXPECT_FATAL_FAILURE(GTEST_FAIL() << "An expected failure", "An expected failure"); // GTEST_ASSERT_XY is the same as ASSERT_XY. GTEST_ASSERT_EQ(0, 0); EXPECT_FATAL_FAILURE(GTEST_ASSERT_EQ(0, 1) << "An expected failure", "An expected failure"); EXPECT_FATAL_FAILURE(GTEST_ASSERT_EQ(1, 0) << "An expected failure", "An expected failure"); GTEST_ASSERT_NE(0, 1); GTEST_ASSERT_NE(1, 0); EXPECT_FATAL_FAILURE(GTEST_ASSERT_NE(0, 0) << "An expected failure", "An expected failure"); GTEST_ASSERT_LE(0, 0); GTEST_ASSERT_LE(0, 1); EXPECT_FATAL_FAILURE(GTEST_ASSERT_LE(1, 0) << "An expected failure", "An expected failure"); GTEST_ASSERT_LT(0, 1); EXPECT_FATAL_FAILURE(GTEST_ASSERT_LT(0, 0) << "An expected failure", "An expected failure"); EXPECT_FATAL_FAILURE(GTEST_ASSERT_LT(1, 0) << "An expected failure", "An expected failure"); GTEST_ASSERT_GE(0, 0); GTEST_ASSERT_GE(1, 0); EXPECT_FATAL_FAILURE(GTEST_ASSERT_GE(0, 1) << "An expected failure", "An expected failure"); GTEST_ASSERT_GT(1, 0); EXPECT_FATAL_FAILURE(GTEST_ASSERT_GT(0, 1) << "An expected failure", "An expected failure"); EXPECT_FATAL_FAILURE(GTEST_ASSERT_GT(1, 1) << "An expected failure", "An expected failure"); } // Tests for internal utilities necessary for implementation of the universal // printing. // TODO(vladl@google.com): Find a better home for them. class ConversionHelperBase {}; class ConversionHelperDerived : public ConversionHelperBase {}; // Tests that IsAProtocolMessage::value is a compile-time constant. TEST(IsAProtocolMessageTest, ValueIsCompileTimeConstant) { GTEST_COMPILE_ASSERT_(IsAProtocolMessage::value, const_true); GTEST_COMPILE_ASSERT_(!IsAProtocolMessage::value, const_false); } // Tests that IsAProtocolMessage::value is true when T is // proto2::Message or a sub-class of it. TEST(IsAProtocolMessageTest, ValueIsTrueWhenTypeIsAProtocolMessage) { EXPECT_TRUE(IsAProtocolMessage< ::proto2::Message>::value); EXPECT_TRUE(IsAProtocolMessage::value); } // Tests that IsAProtocolMessage::value is false when T is neither // ProtocolMessage nor a sub-class of it. TEST(IsAProtocolMessageTest, ValueIsFalseWhenTypeIsNotAProtocolMessage) { EXPECT_FALSE(IsAProtocolMessage::value); EXPECT_FALSE(IsAProtocolMessage::value); } // Tests that CompileAssertTypesEqual compiles when the type arguments are // equal. TEST(CompileAssertTypesEqual, CompilesWhenTypesAreEqual) { CompileAssertTypesEqual(); CompileAssertTypesEqual(); } // Tests that RemoveReference does not affect non-reference types. TEST(RemoveReferenceTest, DoesNotAffectNonReferenceType) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests that RemoveReference removes reference from reference types. TEST(RemoveReferenceTest, RemovesReference) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests GTEST_REMOVE_REFERENCE_. template void TestGTestRemoveReference() { CompileAssertTypesEqual(); } TEST(RemoveReferenceTest, MacroVersion) { TestGTestRemoveReference(); TestGTestRemoveReference(); } // Tests that RemoveConst does not affect non-const types. TEST(RemoveConstTest, DoesNotAffectNonConstType) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests that RemoveConst removes const from const types. TEST(RemoveConstTest, RemovesConst) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests GTEST_REMOVE_CONST_. template void TestGTestRemoveConst() { CompileAssertTypesEqual(); } TEST(RemoveConstTest, MacroVersion) { TestGTestRemoveConst(); TestGTestRemoveConst(); TestGTestRemoveConst(); } // Tests GTEST_REMOVE_REFERENCE_AND_CONST_. template void TestGTestRemoveReferenceAndConst() { CompileAssertTypesEqual(); } TEST(RemoveReferenceToConstTest, Works) { TestGTestRemoveReferenceAndConst(); TestGTestRemoveReferenceAndConst(); TestGTestRemoveReferenceAndConst(); TestGTestRemoveReferenceAndConst(); TestGTestRemoveReferenceAndConst(); } // Tests that AddReference does not affect reference types. TEST(AddReferenceTest, DoesNotAffectReferenceType) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests that AddReference adds reference to non-reference types. TEST(AddReferenceTest, AddsReference) { CompileAssertTypesEqual::type>(); CompileAssertTypesEqual::type>(); } // Tests GTEST_ADD_REFERENCE_. template void TestGTestAddReference() { CompileAssertTypesEqual(); } TEST(AddReferenceTest, MacroVersion) { TestGTestAddReference(); TestGTestAddReference(); } // Tests GTEST_REFERENCE_TO_CONST_. template void TestGTestReferenceToConst() { CompileAssertTypesEqual(); } TEST(GTestReferenceToConstTest, Works) { TestGTestReferenceToConst(); TestGTestReferenceToConst(); TestGTestReferenceToConst(); TestGTestReferenceToConst(); } // Tests that ImplicitlyConvertible::value is a compile-time constant. TEST(ImplicitlyConvertibleTest, ValueIsCompileTimeConstant) { GTEST_COMPILE_ASSERT_((ImplicitlyConvertible::value), const_true); GTEST_COMPILE_ASSERT_((!ImplicitlyConvertible::value), const_false); } // Tests that ImplicitlyConvertible::value is true when T1 can // be implicitly converted to T2. TEST(ImplicitlyConvertibleTest, ValueIsTrueWhenConvertible) { EXPECT_TRUE((ImplicitlyConvertible::value)); EXPECT_TRUE((ImplicitlyConvertible::value)); EXPECT_TRUE((ImplicitlyConvertible::value)); EXPECT_TRUE((ImplicitlyConvertible::value)); EXPECT_TRUE((ImplicitlyConvertible::value)); EXPECT_TRUE((ImplicitlyConvertible::value)); } // Tests that ImplicitlyConvertible::value is false when T1 // cannot be implicitly converted to T2. TEST(ImplicitlyConvertibleTest, ValueIsFalseWhenNotConvertible) { EXPECT_FALSE((ImplicitlyConvertible::value)); EXPECT_FALSE((ImplicitlyConvertible::value)); EXPECT_FALSE((ImplicitlyConvertible::value)); EXPECT_FALSE((ImplicitlyConvertible::value)); } // Tests IsContainerTest. class NonContainer {}; TEST(IsContainerTestTest, WorksForNonContainer) { EXPECT_EQ(sizeof(IsNotContainer), sizeof(IsContainerTest(0))); EXPECT_EQ(sizeof(IsNotContainer), sizeof(IsContainerTest(0))); EXPECT_EQ(sizeof(IsNotContainer), sizeof(IsContainerTest(0))); } TEST(IsContainerTestTest, WorksForContainer) { EXPECT_EQ(sizeof(IsContainer), sizeof(IsContainerTest >(0))); EXPECT_EQ(sizeof(IsContainer), sizeof(IsContainerTest >(0))); } // Tests ArrayEq(). TEST(ArrayEqTest, WorksForDegeneratedArrays) { EXPECT_TRUE(ArrayEq(5, 5L)); EXPECT_FALSE(ArrayEq('a', 0)); } TEST(ArrayEqTest, WorksForOneDimensionalArrays) { const int a[] = { 0, 1 }; long b[] = { 0, 1 }; EXPECT_TRUE(ArrayEq(a, b)); EXPECT_TRUE(ArrayEq(a, 2, b)); b[0] = 2; EXPECT_FALSE(ArrayEq(a, b)); EXPECT_FALSE(ArrayEq(a, 1, b)); } TEST(ArrayEqTest, WorksForTwoDimensionalArrays) { const char a[][3] = { "hi", "lo" }; const char b[][3] = { "hi", "lo" }; const char c[][3] = { "hi", "li" }; EXPECT_TRUE(ArrayEq(a, b)); EXPECT_TRUE(ArrayEq(a, 2, b)); EXPECT_FALSE(ArrayEq(a, c)); EXPECT_FALSE(ArrayEq(a, 2, c)); } // Tests ArrayAwareFind(). TEST(ArrayAwareFindTest, WorksForOneDimensionalArray) { const char a[] = "hello"; EXPECT_EQ(a + 4, ArrayAwareFind(a, a + 5, 'o')); EXPECT_EQ(a + 5, ArrayAwareFind(a, a + 5, 'x')); } TEST(ArrayAwareFindTest, WorksForTwoDimensionalArray) { int a[][2] = { { 0, 1 }, { 2, 3 }, { 4, 5 } }; const int b[2] = { 2, 3 }; EXPECT_EQ(a + 1, ArrayAwareFind(a, a + 3, b)); const int c[2] = { 6, 7 }; EXPECT_EQ(a + 3, ArrayAwareFind(a, a + 3, c)); } // Tests CopyArray(). TEST(CopyArrayTest, WorksForDegeneratedArrays) { int n = 0; CopyArray('a', &n); EXPECT_EQ('a', n); } TEST(CopyArrayTest, WorksForOneDimensionalArrays) { const char a[3] = "hi"; int b[3]; #ifndef __BORLANDC__ // C++Builder cannot compile some array size deductions. CopyArray(a, &b); EXPECT_TRUE(ArrayEq(a, b)); #endif int c[3]; CopyArray(a, 3, c); EXPECT_TRUE(ArrayEq(a, c)); } TEST(CopyArrayTest, WorksForTwoDimensionalArrays) { const int a[2][3] = { { 0, 1, 2 }, { 3, 4, 5 } }; int b[2][3]; #ifndef __BORLANDC__ // C++Builder cannot compile some array size deductions. CopyArray(a, &b); EXPECT_TRUE(ArrayEq(a, b)); #endif int c[2][3]; CopyArray(a, 2, c); EXPECT_TRUE(ArrayEq(a, c)); } // Tests NativeArray. TEST(NativeArrayTest, ConstructorFromArrayWorks) { const int a[3] = { 0, 1, 2 }; NativeArray na(a, 3, kReference); EXPECT_EQ(3U, na.size()); EXPECT_EQ(a, na.begin()); } TEST(NativeArrayTest, CreatesAndDeletesCopyOfArrayWhenAskedTo) { typedef int Array[2]; Array* a = new Array[1]; (*a)[0] = 0; (*a)[1] = 1; NativeArray na(*a, 2, kCopy); EXPECT_NE(*a, na.begin()); delete[] a; EXPECT_EQ(0, na.begin()[0]); EXPECT_EQ(1, na.begin()[1]); // We rely on the heap checker to verify that na deletes the copy of // array. } TEST(NativeArrayTest, TypeMembersAreCorrect) { StaticAssertTypeEq::value_type>(); StaticAssertTypeEq::value_type>(); StaticAssertTypeEq::const_iterator>(); StaticAssertTypeEq::const_iterator>(); } TEST(NativeArrayTest, MethodsWork) { const int a[3] = { 0, 1, 2 }; NativeArray na(a, 3, kCopy); ASSERT_EQ(3U, na.size()); EXPECT_EQ(3, na.end() - na.begin()); NativeArray::const_iterator it = na.begin(); EXPECT_EQ(0, *it); ++it; EXPECT_EQ(1, *it); it++; EXPECT_EQ(2, *it); ++it; EXPECT_EQ(na.end(), it); EXPECT_TRUE(na == na); NativeArray na2(a, 3, kReference); EXPECT_TRUE(na == na2); const int b1[3] = { 0, 1, 1 }; const int b2[4] = { 0, 1, 2, 3 }; EXPECT_FALSE(na == NativeArray(b1, 3, kReference)); EXPECT_FALSE(na == NativeArray(b2, 4, kCopy)); } TEST(NativeArrayTest, WorksForTwoDimensionalArray) { const char a[2][3] = { "hi", "lo" }; NativeArray na(a, 2, kReference); ASSERT_EQ(2U, na.size()); EXPECT_EQ(a, na.begin()); } // Tests SkipPrefix(). TEST(SkipPrefixTest, SkipsWhenPrefixMatches) { const char* const str = "hello"; const char* p = str; EXPECT_TRUE(SkipPrefix("", &p)); EXPECT_EQ(str, p); p = str; EXPECT_TRUE(SkipPrefix("hell", &p)); EXPECT_EQ(str + 4, p); } TEST(SkipPrefixTest, DoesNotSkipWhenPrefixDoesNotMatch) { const char* const str = "world"; const char* p = str; EXPECT_FALSE(SkipPrefix("W", &p)); EXPECT_EQ(str, p); p = str; EXPECT_FALSE(SkipPrefix("world!", &p)); EXPECT_EQ(str, p); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_outfile1_test_.cc0000600000175000017500000000373311561126632025750 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: keith.ray@gmail.com (Keith Ray) // // gtest_xml_outfile1_test_ writes some xml via TestProperty used by // gtest_xml_outfiles_test.py #include "gtest/gtest.h" class PropertyOne : public testing::Test { protected: virtual void SetUp() { RecordProperty("SetUpProp", 1); } virtual void TearDown() { RecordProperty("TearDownProp", 1); } }; TEST_F(PropertyOne, TestSomeProperties) { RecordProperty("TestSomeProperty", 1); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_outfile2_test_.cc0000600000175000017500000000373311561126632025751 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: keith.ray@gmail.com (Keith Ray) // // gtest_xml_outfile2_test_ writes some xml via TestProperty used by // gtest_xml_outfiles_test.py #include "gtest/gtest.h" class PropertyTwo : public testing::Test { protected: virtual void SetUp() { RecordProperty("SetUpProp", 2); } virtual void TearDown() { RecordProperty("TearDownProp", 2); } }; TEST_F(PropertyTwo, TestSomeProperties) { RecordProperty("TestSomeProperty", 2); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_outfiles_test.py0000600000175000017500000001230011561126632025744 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test for the gtest_xml_output module.""" __author__ = "keith.ray@gmail.com (Keith Ray)" import os from xml.dom import minidom, Node import gtest_test_utils import gtest_xml_test_utils GTEST_OUTPUT_SUBDIR = "xml_outfiles" GTEST_OUTPUT_1_TEST = "gtest_xml_outfile1_test_" GTEST_OUTPUT_2_TEST = "gtest_xml_outfile2_test_" EXPECTED_XML_1 = """ """ EXPECTED_XML_2 = """ """ class GTestXMLOutFilesTest(gtest_xml_test_utils.GTestXMLTestCase): """Unit test for Google Test's XML output functionality.""" def setUp(self): # We want the trailing '/' that the last "" provides in os.path.join, for # telling Google Test to create an output directory instead of a single file # for xml output. self.output_dir_ = os.path.join(gtest_test_utils.GetTempDir(), GTEST_OUTPUT_SUBDIR, "") self.DeleteFilesAndDir() def tearDown(self): self.DeleteFilesAndDir() def DeleteFilesAndDir(self): try: os.remove(os.path.join(self.output_dir_, GTEST_OUTPUT_1_TEST + ".xml")) except os.error: pass try: os.remove(os.path.join(self.output_dir_, GTEST_OUTPUT_2_TEST + ".xml")) except os.error: pass try: os.rmdir(self.output_dir_) except os.error: pass def testOutfile1(self): self._TestOutFile(GTEST_OUTPUT_1_TEST, EXPECTED_XML_1) def testOutfile2(self): self._TestOutFile(GTEST_OUTPUT_2_TEST, EXPECTED_XML_2) def _TestOutFile(self, test_name, expected_xml): gtest_prog_path = gtest_test_utils.GetTestExecutablePath(test_name) command = [gtest_prog_path, "--gtest_output=xml:%s" % self.output_dir_] p = gtest_test_utils.Subprocess(command, working_dir=gtest_test_utils.GetTempDir()) self.assert_(p.exited) self.assertEquals(0, p.exit_code) # TODO(wan@google.com): libtool causes the built test binary to be # named lt-gtest_xml_outfiles_test_ instead of # gtest_xml_outfiles_test_. To account for this possibillity, we # allow both names in the following code. We should remove this # hack when Chandler Carruth's libtool replacement tool is ready. output_file_name1 = test_name + ".xml" output_file1 = os.path.join(self.output_dir_, output_file_name1) output_file_name2 = 'lt-' + output_file_name1 output_file2 = os.path.join(self.output_dir_, output_file_name2) self.assert_(os.path.isfile(output_file1) or os.path.isfile(output_file2), output_file1) expected = minidom.parseString(expected_xml) if os.path.isfile(output_file1): actual = minidom.parse(output_file1) else: actual = minidom.parse(output_file2) self.NormalizeXml(actual.documentElement) self.AssertEquivalentNodes(expected.documentElement, actual.documentElement) expected.unlink() actual.unlink() if __name__ == "__main__": os.environ["GTEST_STACK_TRACE_DEPTH"] = "0" gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_output_unittest.py0000600000175000017500000002601711561126632026364 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test for the gtest_xml_output module""" __author__ = 'eefacm@gmail.com (Sean Mcafee)' import errno import os import sys from xml.dom import minidom, Node import gtest_test_utils import gtest_xml_test_utils GTEST_OUTPUT_FLAG = "--gtest_output" GTEST_DEFAULT_OUTPUT_FILE = "test_detail.xml" GTEST_PROGRAM_NAME = "gtest_xml_output_unittest_" SUPPORTS_STACK_TRACES = False if SUPPORTS_STACK_TRACES: STACK_TRACE_TEMPLATE = "\nStack trace:\n*" else: STACK_TRACE_TEMPLATE = "" EXPECTED_NON_EMPTY_XML = """ ]]>%(stack)s]]> """ % {'stack': STACK_TRACE_TEMPLATE} EXPECTED_EMPTY_XML = """ """ class GTestXMLOutputUnitTest(gtest_xml_test_utils.GTestXMLTestCase): """ Unit test for Google Test's XML output functionality. """ def testNonEmptyXmlOutput(self): """ Runs a test program that generates a non-empty XML output, and tests that the XML output is expected. """ self._TestXmlOutput(GTEST_PROGRAM_NAME, EXPECTED_NON_EMPTY_XML, 1) def testEmptyXmlOutput(self): """ Runs a test program that generates an empty XML output, and tests that the XML output is expected. """ self._TestXmlOutput("gtest_no_test_unittest", EXPECTED_EMPTY_XML, 0) def testDefaultOutputFile(self): """ Confirms that Google Test produces an XML output file with the expected default name if no name is explicitly specified. """ output_file = os.path.join(gtest_test_utils.GetTempDir(), GTEST_DEFAULT_OUTPUT_FILE) gtest_prog_path = gtest_test_utils.GetTestExecutablePath( "gtest_no_test_unittest") try: os.remove(output_file) except OSError, e: if e.errno != errno.ENOENT: raise p = gtest_test_utils.Subprocess( [gtest_prog_path, "%s=xml" % GTEST_OUTPUT_FLAG], working_dir=gtest_test_utils.GetTempDir()) self.assert_(p.exited) self.assertEquals(0, p.exit_code) self.assert_(os.path.isfile(output_file)) def testSuppressedXmlOutput(self): """ Tests that no XML file is generated if the default XML listener is shut down before RUN_ALL_TESTS is invoked. """ xml_path = os.path.join(gtest_test_utils.GetTempDir(), GTEST_PROGRAM_NAME + "out.xml") if os.path.isfile(xml_path): os.remove(xml_path) gtest_prog_path = gtest_test_utils.GetTestExecutablePath(GTEST_PROGRAM_NAME) command = [gtest_prog_path, "%s=xml:%s" % (GTEST_OUTPUT_FLAG, xml_path), "--shut_down_xml"] p = gtest_test_utils.Subprocess(command) if p.terminated_by_signal: self.assert_(False, "%s was killed by signal %d" % (gtest_prog_name, p.signal)) else: self.assert_(p.exited) self.assertEquals(1, p.exit_code, "'%s' exited with code %s, which doesn't match " "the expected exit code %s." % (command, p.exit_code, 1)) self.assert_(not os.path.isfile(xml_path)) def _TestXmlOutput(self, gtest_prog_name, expected_xml, expected_exit_code): """ Asserts that the XML document generated by running the program gtest_prog_name matches expected_xml, a string containing another XML document. Furthermore, the program's exit code must be expected_exit_code. """ xml_path = os.path.join(gtest_test_utils.GetTempDir(), gtest_prog_name + "out.xml") gtest_prog_path = gtest_test_utils.GetTestExecutablePath(gtest_prog_name) command = [gtest_prog_path, "%s=xml:%s" % (GTEST_OUTPUT_FLAG, xml_path)] p = gtest_test_utils.Subprocess(command) if p.terminated_by_signal: self.assert_(False, "%s was killed by signal %d" % (gtest_prog_name, p.signal)) else: self.assert_(p.exited) self.assertEquals(expected_exit_code, p.exit_code, "'%s' exited with code %s, which doesn't match " "the expected exit code %s." % (command, p.exit_code, expected_exit_code)) expected = minidom.parseString(expected_xml) actual = minidom.parse(xml_path) self.NormalizeXml(actual.documentElement) self.AssertEquivalentNodes(expected.documentElement, actual.documentElement) expected.unlink() actual .unlink() if __name__ == '__main__': os.environ['GTEST_STACK_TRACE_DEPTH'] = '1' gtest_test_utils.Main() synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_output_unittest_.cc0000600000175000017500000001332111561126632026452 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // Author: eefacm@gmail.com (Sean Mcafee) // Unit test for Google Test XML output. // // A user can specify XML output in a Google Test program to run via // either the GTEST_OUTPUT environment variable or the --gtest_output // flag. This is used for testing such functionality. // // This program will be invoked from a Python unit test. Don't run it // directly. #include "gtest/gtest.h" using ::testing::InitGoogleTest; using ::testing::TestEventListeners; using ::testing::TestWithParam; using ::testing::UnitTest; using ::testing::Test; using ::testing::Types; using ::testing::Values; class SuccessfulTest : public Test { }; TEST_F(SuccessfulTest, Succeeds) { SUCCEED() << "This is a success."; ASSERT_EQ(1, 1); } class FailedTest : public Test { }; TEST_F(FailedTest, Fails) { ASSERT_EQ(1, 2); } class DisabledTest : public Test { }; TEST_F(DisabledTest, DISABLED_test_not_run) { FAIL() << "Unexpected failure: Disabled test should not be run"; } TEST(MixedResultTest, Succeeds) { EXPECT_EQ(1, 1); ASSERT_EQ(1, 1); } TEST(MixedResultTest, Fails) { EXPECT_EQ(1, 2); ASSERT_EQ(2, 3); } TEST(MixedResultTest, DISABLED_test) { FAIL() << "Unexpected failure: Disabled test should not be run"; } TEST(XmlQuotingTest, OutputsCData) { FAIL() << "XML output: " ""; } // Helps to test that invalid characters produced by test code do not make // it into the XML file. TEST(InvalidCharactersTest, InvalidCharactersInMessage) { FAIL() << "Invalid characters in brackets [\x1\x2]"; } class PropertyRecordingTest : public Test { }; TEST_F(PropertyRecordingTest, OneProperty) { RecordProperty("key_1", "1"); } TEST_F(PropertyRecordingTest, IntValuedProperty) { RecordProperty("key_int", 1); } TEST_F(PropertyRecordingTest, ThreeProperties) { RecordProperty("key_1", "1"); RecordProperty("key_2", "2"); RecordProperty("key_3", "3"); } TEST_F(PropertyRecordingTest, TwoValuesForOneKeyUsesLastValue) { RecordProperty("key_1", "1"); RecordProperty("key_1", "2"); } TEST(NoFixtureTest, RecordProperty) { RecordProperty("key", "1"); } void ExternalUtilityThatCallsRecordProperty(const char* key, int value) { testing::Test::RecordProperty(key, value); } void ExternalUtilityThatCallsRecordProperty(const char* key, const char* value) { testing::Test::RecordProperty(key, value); } TEST(NoFixtureTest, ExternalUtilityThatCallsRecordIntValuedProperty) { ExternalUtilityThatCallsRecordProperty("key_for_utility_int", 1); } TEST(NoFixtureTest, ExternalUtilityThatCallsRecordStringValuedProperty) { ExternalUtilityThatCallsRecordProperty("key_for_utility_string", "1"); } // Verifies that the test parameter value is output in the 'value_param' // XML attribute for value-parameterized tests. class ValueParamTest : public TestWithParam {}; TEST_P(ValueParamTest, HasValueParamAttribute) {} TEST_P(ValueParamTest, AnotherTestThatHasValueParamAttribute) {} INSTANTIATE_TEST_CASE_P(Single, ValueParamTest, Values(33, 42)); // Verifies that the type parameter name is output in the 'type_param' // XML attribute for typed tests. template class TypedTest : public Test {}; typedef Types TypedTestTypes; TYPED_TEST_CASE(TypedTest, TypedTestTypes); TYPED_TEST(TypedTest, HasTypeParamAttribute) {} // Verifies that the type parameter name is output in the 'type_param' // XML attribute for type-parameterized tests. template class TypeParameterizedTestCase : public Test {}; TYPED_TEST_CASE_P(TypeParameterizedTestCase); TYPED_TEST_P(TypeParameterizedTestCase, HasTypeParamAttribute) {} REGISTER_TYPED_TEST_CASE_P(TypeParameterizedTestCase, HasTypeParamAttribute); typedef Types TypeParameterizedTestCaseTypes; INSTANTIATE_TYPED_TEST_CASE_P(Single, TypeParameterizedTestCase, TypeParameterizedTestCaseTypes); int main(int argc, char** argv) { InitGoogleTest(&argc, argv); if (argc > 1 && strcmp(argv[1], "--shut_down_xml") == 0) { TestEventListeners& listeners = UnitTest::GetInstance()->listeners(); delete listeners.Release(listeners.default_xml_generator()); } return RUN_ALL_TESTS(); } synergy-1.4.12-Source/tools/gtest-1.6.0/test/gtest_xml_test_utils.py0000600000175000017500000001753511561126632025271 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2006, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """Unit test utilities for gtest_xml_output""" __author__ = 'eefacm@gmail.com (Sean Mcafee)' import re from xml.dom import minidom, Node import gtest_test_utils GTEST_OUTPUT_FLAG = "--gtest_output" GTEST_DEFAULT_OUTPUT_FILE = "test_detail.xml" class GTestXMLTestCase(gtest_test_utils.TestCase): """ Base class for tests of Google Test's XML output functionality. """ def AssertEquivalentNodes(self, expected_node, actual_node): """ Asserts that actual_node (a DOM node object) is equivalent to expected_node (another DOM node object), in that either both of them are CDATA nodes and have the same value, or both are DOM elements and actual_node meets all of the following conditions: * It has the same tag name as expected_node. * It has the same set of attributes as expected_node, each with the same value as the corresponding attribute of expected_node. Exceptions are any attribute named "time", which needs only be convertible to a floating-point number and any attribute named "type_param" which only has to be non-empty. * It has an equivalent set of child nodes (including elements and CDATA sections) as expected_node. Note that we ignore the order of the children as they are not guaranteed to be in any particular order. """ if expected_node.nodeType == Node.CDATA_SECTION_NODE: self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType) self.assertEquals(expected_node.nodeValue, actual_node.nodeValue) return self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType) self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType) self.assertEquals(expected_node.tagName, actual_node.tagName) expected_attributes = expected_node.attributes actual_attributes = actual_node .attributes self.assertEquals( expected_attributes.length, actual_attributes.length, "attribute numbers differ in element " + actual_node.tagName) for i in range(expected_attributes.length): expected_attr = expected_attributes.item(i) actual_attr = actual_attributes.get(expected_attr.name) self.assert_( actual_attr is not None, "expected attribute %s not found in element %s" % (expected_attr.name, actual_node.tagName)) self.assertEquals(expected_attr.value, actual_attr.value, " values of attribute %s in element %s differ" % (expected_attr.name, actual_node.tagName)) expected_children = self._GetChildren(expected_node) actual_children = self._GetChildren(actual_node) self.assertEquals( len(expected_children), len(actual_children), "number of child elements differ in element " + actual_node.tagName) for child_id, child in expected_children.iteritems(): self.assert_(child_id in actual_children, '<%s> is not in <%s> (in element %s)' % (child_id, actual_children, actual_node.tagName)) self.AssertEquivalentNodes(child, actual_children[child_id]) identifying_attribute = { "testsuites": "name", "testsuite": "name", "testcase": "name", "failure": "message", } def _GetChildren(self, element): """ Fetches all of the child nodes of element, a DOM Element object. Returns them as the values of a dictionary keyed by the IDs of the children. For , and elements, the ID is the value of their "name" attribute; for elements, it is the value of the "message" attribute; CDATA sections and non-whitespace text nodes are concatenated into a single CDATA section with ID "detail". An exception is raised if any element other than the above four is encountered, if two child elements with the same identifying attributes are encountered, or if any other type of node is encountered. """ children = {} for child in element.childNodes: if child.nodeType == Node.ELEMENT_NODE: self.assert_(child.tagName in self.identifying_attribute, "Encountered unknown element <%s>" % child.tagName) childID = child.getAttribute(self.identifying_attribute[child.tagName]) self.assert_(childID not in children) children[childID] = child elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]: if "detail" not in children: if (child.nodeType == Node.CDATA_SECTION_NODE or not child.nodeValue.isspace()): children["detail"] = child.ownerDocument.createCDATASection( child.nodeValue) else: children["detail"].nodeValue += child.nodeValue else: self.fail("Encountered unexpected node type %d" % child.nodeType) return children def NormalizeXml(self, element): """ Normalizes Google Test's XML output to eliminate references to transient information that may change from run to run. * The "time" attribute of , and elements is replaced with a single asterisk, if it contains only digit characters. * The "type_param" attribute of elements is replaced with a single asterisk (if it sn non-empty) as it is the type name returned by the compiler and is platform dependent. * The line number reported in the first line of the "message" attribute of elements is replaced with a single asterisk. * The directory names in file paths are removed. * The stack traces are removed. """ if element.tagName in ("testsuites", "testsuite", "testcase"): time = element.getAttributeNode("time") time.value = re.sub(r"^\d+(\.\d+)?$", "*", time.value) type_param = element.getAttributeNode("type_param") if type_param and type_param.value: type_param.value = "*" elif element.tagName == "failure": for child in element.childNodes: if child.nodeType == Node.CDATA_SECTION_NODE: # Removes the source line number. cdata = re.sub(r"^.*[/\\](.*:)\d+\n", "\\1*\n", child.nodeValue) # Removes the actual stack trace. child.nodeValue = re.sub(r"\nStack trace:\n(.|\n)*", "", cdata) for child in element.childNodes: if child.nodeType == Node.ELEMENT_NODE: self.NormalizeXml(child) synergy-1.4.12-Source/tools/gtest-1.6.0/test/production.cc0000600000175000017500000000330411561126632023114 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // This is part of the unit test for include/gtest/gtest_prod.h. #include "production.h" PrivateCode::PrivateCode() : x_(0) {} synergy-1.4.12-Source/tools/gtest-1.6.0/test/production.h0000600000175000017500000000417411561126632022764 0ustar synergysynergy// Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: wan@google.com (Zhanyong Wan) // // This is part of the unit test for include/gtest/gtest_prod.h. #ifndef GTEST_TEST_PRODUCTION_H_ #define GTEST_TEST_PRODUCTION_H_ #include "gtest/gtest_prod.h" class PrivateCode { public: // Declares a friend test that does not use a fixture. FRIEND_TEST(PrivateCodeTest, CanAccessPrivateMembers); // Declares a friend test that uses a fixture. FRIEND_TEST(PrivateCodeFixtureTest, CanAccessPrivateMembers); PrivateCode(); int x() const { return x_; } private: void set_x(int an_x) { x_ = an_x; } int x_; }; #endif // GTEST_TEST_PRODUCTION_H_ synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/0000700000175000017500000000000012140644175020541 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/0000700000175000017500000000000012140644175021746 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/DebugProject.xcconfig0000600000175000017500000000172711561126632026055 0ustar synergysynergy// // DebugProject.xcconfig // // These are Debug Configuration project settings for the gtest framework and // examples. It is set in the "Based On:" dropdown in the "Project" info // dialog. // This file is based on the Xcode Configuration files in: // http://code.google.com/p/google-toolbox-for-mac/ // #include "General.xcconfig" // No optimization GCC_OPTIMIZATION_LEVEL = 0 // Deployment postprocessing is what triggers Xcode to strip, turn it off DEPLOYMENT_POSTPROCESSING = NO // Dead code stripping off DEAD_CODE_STRIPPING = NO // Debug symbols should be on obviously GCC_GENERATE_DEBUGGING_SYMBOLS = YES // Define the DEBUG macro in all debug builds OTHER_CFLAGS = $(OTHER_CFLAGS) -DDEBUG=1 // These are turned off to avoid STL incompatibilities with client code // // Turns on special C++ STL checks to "encourage" good STL use // GCC_PREPROCESSOR_DEFINITIONS = $(GCC_PREPROCESSOR_DEFINITIONS) _GLIBCXX_DEBUG_PEDANTIC _GLIBCXX_DEBUG _GLIBCPP_CONCEPT_CHECKS synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/FrameworkTarget.xcconfig0000600000175000017500000000104711561126632026577 0ustar synergysynergy// // FrameworkTarget.xcconfig // // These are Framework target settings for the gtest framework and examples. It // is set in the "Based On:" dropdown in the "Target" info dialog. // This file is based on the Xcode Configuration files in: // http://code.google.com/p/google-toolbox-for-mac/ // // Dynamic libs need to be position independent GCC_DYNAMIC_NO_PIC = NO // Dynamic libs should not have their external symbols stripped. STRIP_STYLE = non-global // Let the user install by specifying the $DSTROOT with xcodebuild SKIP_INSTALL = NO synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/General.xcconfig0000600000175000017500000000225711561126632025054 0ustar synergysynergy// // General.xcconfig // // These are General configuration settings for the gtest framework and // examples. // This file is based on the Xcode Configuration files in: // http://code.google.com/p/google-toolbox-for-mac/ // // Build for PPC and Intel, 32- and 64-bit ARCHS = i386 x86_64 ppc ppc64 // Zerolink prevents link warnings so turn it off ZERO_LINK = NO // Prebinding considered unhelpful in 10.3 and later PREBINDING = NO // Strictest warning policy WARNING_CFLAGS = -Wall -Werror -Wendif-labels -Wnewline-eof -Wno-sign-compare -Wshadow // Work around Xcode bugs by using external strip. See: // http://lists.apple.com/archives/Xcode-users/2006/Feb/msg00050.html SEPARATE_STRIP = YES // Force C99 dialect GCC_C_LANGUAGE_STANDARD = c99 // not sure why apple defaults this on, but it's pretty risky ALWAYS_SEARCH_USER_PATHS = NO // Turn on position dependent code for most cases (overridden where appropriate) GCC_DYNAMIC_NO_PIC = YES // Default SDK and minimum OS version is 10.4 SDKROOT = $(DEVELOPER_SDK_DIR)/MacOSX10.4u.sdk MACOSX_DEPLOYMENT_TARGET = 10.4 GCC_VERSION = 4.0 // VERSIONING BUILD SETTINGS (used in Info.plist) GTEST_VERSIONINFO_ABOUT = © 2008 Google Inc. synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/ReleaseProject.xcconfig0000600000175000017500000000174111561126632026403 0ustar synergysynergy// // ReleaseProject.xcconfig // // These are Release Configuration project settings for the gtest framework // and examples. It is set in the "Based On:" dropdown in the "Project" info // dialog. // This file is based on the Xcode Configuration files in: // http://code.google.com/p/google-toolbox-for-mac/ // #include "General.xcconfig" // subconfig/Release.xcconfig // Optimize for space and size (Apple recommendation) GCC_OPTIMIZATION_LEVEL = s // Deploment postprocessing is what triggers Xcode to strip DEPLOYMENT_POSTPROCESSING = YES // No symbols GCC_GENERATE_DEBUGGING_SYMBOLS = NO // Dead code strip does not affect ObjC code but can help for C DEAD_CODE_STRIPPING = YES // NDEBUG is used by things like assert.h, so define it for general compat. // ASSERT going away in release tends to create unused vars. OTHER_CFLAGS = $(OTHER_CFLAGS) -DNDEBUG=1 -Wno-unused-variable // When we strip we want to strip all symbols in release, but save externals. STRIP_STYLE = all synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/StaticLibraryTarget.xcconfig0000600000175000017500000000111311561126632027410 0ustar synergysynergy// // StaticLibraryTarget.xcconfig // // These are static library target settings for libgtest.a. It // is set in the "Based On:" dropdown in the "Target" info dialog. // This file is based on the Xcode Configuration files in: // http://code.google.com/p/google-toolbox-for-mac/ // // Static libs can be included in bundles so make them position independent GCC_DYNAMIC_NO_PIC = NO // Static libs should not have their internal globals or external symbols // stripped. STRIP_STYLE = debugging // Let the user install by specifying the $DSTROOT with xcodebuild SKIP_INSTALL = NO synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Config/TestTarget.xcconfig0000600000175000017500000000035611561126632025563 0ustar synergysynergy// // TestTarget.xcconfig // // These are Test target settings for the gtest framework and examples. It // is set in the "Based On:" dropdown in the "Target" info dialog. PRODUCT_NAME = $(TARGET_NAME) HEADER_SEARCH_PATHS = ../include synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/gtest.xcodeproj/0000700000175000017500000000000012140644175023663 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/gtest.xcodeproj/project.pbxproj0000600000175000017500000014001311561126632026737 0ustar synergysynergy// !$*UTF8*$! { archiveVersion = 1; classes = { }; objectVersion = 42; objects = { /* Begin PBXAggregateTarget section */ 3B238F5F0E828B5400846E11 /* Check */ = { isa = PBXAggregateTarget; buildConfigurationList = 3B238FA30E828BB600846E11 /* Build configuration list for PBXAggregateTarget "Check" */; buildPhases = ( 3B238F5E0E828B5400846E11 /* ShellScript */, ); dependencies = ( 40899F9D0FFA740F000B29AE /* PBXTargetDependency */, 40C849F7101A43440083642A /* PBXTargetDependency */, 4089A0980FFAD34A000B29AE /* PBXTargetDependency */, 40C849F9101A43490083642A /* PBXTargetDependency */, ); name = Check; productName = Check; }; 40C44ADC0E3798F4008FCC51 /* Version Info */ = { isa = PBXAggregateTarget; buildConfigurationList = 40C44AE40E379905008FCC51 /* Build configuration list for PBXAggregateTarget "Version Info" */; buildPhases = ( 40C44ADB0E3798F4008FCC51 /* Generate Version.h */, ); comments = "The generation of Version.h must be performed in its own target. Since the Info.plist is preprocessed before any of the other build phases in gtest, the Version.h file would not be ready if included as a build phase of that target."; dependencies = ( ); name = "Version Info"; productName = Version.h; }; /* End PBXAggregateTarget section */ /* Begin PBXBuildFile section */ 224A12A30E9EADCC00BD17FD /* gtest-test-part.h in Headers */ = {isa = PBXBuildFile; fileRef = 224A12A20E9EADCC00BD17FD /* gtest-test-part.h */; settings = {ATTRIBUTES = (Public, ); }; }; 3BF6F2A00E79B5AD000F2EEE /* gtest-type-util.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 3BF6F29F0E79B5AD000F2EEE /* gtest-type-util.h */; }; 3BF6F2A50E79B616000F2EEE /* gtest-typed-test.h in Headers */ = {isa = PBXBuildFile; fileRef = 3BF6F2A40E79B616000F2EEE /* gtest-typed-test.h */; settings = {ATTRIBUTES = (Public, ); }; }; 404884380E2F799B00CF7658 /* gtest-death-test.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883DB0E2F799B00CF7658 /* gtest-death-test.h */; settings = {ATTRIBUTES = (Public, ); }; }; 404884390E2F799B00CF7658 /* gtest-message.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883DC0E2F799B00CF7658 /* gtest-message.h */; settings = {ATTRIBUTES = (Public, ); }; }; 4048843A0E2F799B00CF7658 /* gtest-spi.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883DD0E2F799B00CF7658 /* gtest-spi.h */; settings = {ATTRIBUTES = (Public, ); }; }; 4048843B0E2F799B00CF7658 /* gtest.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883DE0E2F799B00CF7658 /* gtest.h */; settings = {ATTRIBUTES = (Public, ); }; }; 4048843C0E2F799B00CF7658 /* gtest_pred_impl.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883DF0E2F799B00CF7658 /* gtest_pred_impl.h */; settings = {ATTRIBUTES = (Public, ); }; }; 4048843D0E2F799B00CF7658 /* gtest_prod.h in Headers */ = {isa = PBXBuildFile; fileRef = 404883E00E2F799B00CF7658 /* gtest_prod.h */; settings = {ATTRIBUTES = (Public, ); }; }; 404884500E2F799B00CF7658 /* README in Resources */ = {isa = PBXBuildFile; fileRef = 404883F60E2F799B00CF7658 /* README */; }; 404884A00E2F7BE600CF7658 /* gtest-death-test-internal.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 404883E20E2F799B00CF7658 /* gtest-death-test-internal.h */; }; 404884A10E2F7BE600CF7658 /* gtest-filepath.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 404883E30E2F799B00CF7658 /* gtest-filepath.h */; }; 404884A20E2F7BE600CF7658 /* gtest-internal.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 404883E40E2F799B00CF7658 /* gtest-internal.h */; }; 404884A30E2F7BE600CF7658 /* gtest-port.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 404883E50E2F799B00CF7658 /* gtest-port.h */; }; 404884A40E2F7BE600CF7658 /* gtest-string.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 404883E60E2F799B00CF7658 /* gtest-string.h */; }; 404884AC0E2F7CD900CF7658 /* CHANGES in Resources */ = {isa = PBXBuildFile; fileRef = 404884A90E2F7CD900CF7658 /* CHANGES */; }; 404884AD0E2F7CD900CF7658 /* CONTRIBUTORS in Resources */ = {isa = PBXBuildFile; fileRef = 404884AA0E2F7CD900CF7658 /* CONTRIBUTORS */; }; 404884AE0E2F7CD900CF7658 /* COPYING in Resources */ = {isa = PBXBuildFile; fileRef = 404884AB0E2F7CD900CF7658 /* COPYING */; }; 40899F3A0FFA70D4000B29AE /* gtest-all.cc in Sources */ = {isa = PBXBuildFile; fileRef = 224A12A10E9EADA700BD17FD /* gtest-all.cc */; }; 40899F500FFA7281000B29AE /* gtest-tuple.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 40899F4D0FFA7271000B29AE /* gtest-tuple.h */; }; 40899F530FFA72A0000B29AE /* gtest_unittest.cc in Sources */ = {isa = PBXBuildFile; fileRef = 3B238C120E7FE13C00846E11 /* gtest_unittest.cc */; }; 4089A0440FFAD1BE000B29AE /* sample1.cc in Sources */ = {isa = PBXBuildFile; fileRef = 4089A02C0FFACF7F000B29AE /* sample1.cc */; }; 4089A0460FFAD1BE000B29AE /* sample1_unittest.cc in Sources */ = {isa = PBXBuildFile; fileRef = 4089A02E0FFACF7F000B29AE /* sample1_unittest.cc */; }; 40C848FF101A21150083642A /* gtest-all.cc in Sources */ = {isa = PBXBuildFile; fileRef = 224A12A10E9EADA700BD17FD /* gtest-all.cc */; }; 40C84915101A21DF0083642A /* gtest_main.cc in Sources */ = {isa = PBXBuildFile; fileRef = 4048840D0E2F799B00CF7658 /* gtest_main.cc */; }; 40C84916101A235B0083642A /* libgtest_main.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C8490B101A217E0083642A /* libgtest_main.a */; }; 40C84921101A23AD0083642A /* libgtest_main.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C8490B101A217E0083642A /* libgtest_main.a */; }; 40C84978101A36540083642A /* libgtest_main.a in Resources */ = {isa = PBXBuildFile; fileRef = 40C8490B101A217E0083642A /* libgtest_main.a */; }; 40C84980101A36850083642A /* gtest_unittest.cc in Sources */ = {isa = PBXBuildFile; fileRef = 3B238C120E7FE13C00846E11 /* gtest_unittest.cc */; }; 40C84982101A36850083642A /* libgtest.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C848FA101A209C0083642A /* libgtest.a */; }; 40C84983101A36850083642A /* libgtest_main.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C8490B101A217E0083642A /* libgtest_main.a */; }; 40C8498F101A36A60083642A /* sample1.cc in Sources */ = {isa = PBXBuildFile; fileRef = 4089A02C0FFACF7F000B29AE /* sample1.cc */; }; 40C84990101A36A60083642A /* sample1_unittest.cc in Sources */ = {isa = PBXBuildFile; fileRef = 4089A02E0FFACF7F000B29AE /* sample1_unittest.cc */; }; 40C84992101A36A60083642A /* libgtest.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C848FA101A209C0083642A /* libgtest.a */; }; 40C84993101A36A60083642A /* libgtest_main.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 40C8490B101A217E0083642A /* libgtest_main.a */; }; 40C849A2101A37050083642A /* gtest.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 4539C8FF0EC27F6400A70F4C /* gtest.framework */; }; 40C849A4101A37150083642A /* gtest.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 4539C8FF0EC27F6400A70F4C /* gtest.framework */; }; 4539C9340EC280AE00A70F4C /* gtest-param-test.h in Headers */ = {isa = PBXBuildFile; fileRef = 4539C9330EC280AE00A70F4C /* gtest-param-test.h */; settings = {ATTRIBUTES = (Public, ); }; }; 4539C9380EC280E200A70F4C /* gtest-linked_ptr.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 4539C9350EC280E200A70F4C /* gtest-linked_ptr.h */; }; 4539C9390EC280E200A70F4C /* gtest-param-util-generated.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 4539C9360EC280E200A70F4C /* gtest-param-util-generated.h */; }; 4539C93A0EC280E200A70F4C /* gtest-param-util.h in Copy Headers Internal */ = {isa = PBXBuildFile; fileRef = 4539C9370EC280E200A70F4C /* gtest-param-util.h */; }; 4567C8181264FF71007740BE /* gtest-printers.h in Headers */ = {isa = PBXBuildFile; fileRef = 4567C8171264FF71007740BE /* gtest-printers.h */; settings = {ATTRIBUTES = (Public, ); }; }; /* End PBXBuildFile section */ /* Begin PBXContainerItemProxy section */ 40899F9C0FFA740F000B29AE /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40899F420FFA7184000B29AE; remoteInfo = gtest_unittest; }; 4089A0970FFAD34A000B29AE /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 4089A0120FFACEFC000B29AE; remoteInfo = sample1_unittest; }; 408BEC0F1046CFE900DEF522 /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C848F9101A209C0083642A; remoteInfo = "gtest-static"; }; 40C44AE50E379922008FCC51 /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C44ADC0E3798F4008FCC51; remoteInfo = Version.h; }; 40C8497C101A36850083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C848F9101A209C0083642A; remoteInfo = "gtest-static"; }; 40C8497E101A36850083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C8490A101A217E0083642A; remoteInfo = "gtest_main-static"; }; 40C8498B101A36A60083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C848F9101A209C0083642A; remoteInfo = "gtest-static"; }; 40C8498D101A36A60083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C8490A101A217E0083642A; remoteInfo = "gtest_main-static"; }; 40C8499B101A36DC0083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C8490A101A217E0083642A; remoteInfo = "gtest_main-static"; }; 40C8499D101A36E50083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 8D07F2BC0486CC7A007CD1D0; remoteInfo = "gtest-framework"; }; 40C8499F101A36F10083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 8D07F2BC0486CC7A007CD1D0; remoteInfo = "gtest-framework"; }; 40C849F6101A43440083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C8497A101A36850083642A; remoteInfo = "gtest_unittest-static"; }; 40C849F8101A43490083642A /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 40C84989101A36A60083642A; remoteInfo = "sample1_unittest-static"; }; /* End PBXContainerItemProxy section */ /* Begin PBXCopyFilesBuildPhase section */ 404884A50E2F7C0400CF7658 /* Copy Headers Internal */ = { isa = PBXCopyFilesBuildPhase; buildActionMask = 2147483647; dstPath = Headers/internal; dstSubfolderSpec = 6; files = ( 404884A00E2F7BE600CF7658 /* gtest-death-test-internal.h in Copy Headers Internal */, 404884A10E2F7BE600CF7658 /* gtest-filepath.h in Copy Headers Internal */, 404884A20E2F7BE600CF7658 /* gtest-internal.h in Copy Headers Internal */, 4539C9380EC280E200A70F4C /* gtest-linked_ptr.h in Copy Headers Internal */, 4539C9390EC280E200A70F4C /* gtest-param-util-generated.h in Copy Headers Internal */, 4539C93A0EC280E200A70F4C /* gtest-param-util.h in Copy Headers Internal */, 404884A30E2F7BE600CF7658 /* gtest-port.h in Copy Headers Internal */, 404884A40E2F7BE600CF7658 /* gtest-string.h in Copy Headers Internal */, 40899F500FFA7281000B29AE /* gtest-tuple.h in Copy Headers Internal */, 3BF6F2A00E79B5AD000F2EEE /* gtest-type-util.h in Copy Headers Internal */, ); name = "Copy Headers Internal"; runOnlyForDeploymentPostprocessing = 0; }; /* End PBXCopyFilesBuildPhase section */ /* Begin PBXFileReference section */ 224A12A10E9EADA700BD17FD /* gtest-all.cc */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.cpp.cpp; path = "gtest-all.cc"; sourceTree = ""; }; 224A12A20E9EADCC00BD17FD /* gtest-test-part.h */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.c.h; path = "gtest-test-part.h"; sourceTree = ""; }; 3B238C120E7FE13C00846E11 /* gtest_unittest.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = gtest_unittest.cc; sourceTree = ""; }; 3B87D2100E96B92E000D1852 /* runtests.sh */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.sh; path = runtests.sh; sourceTree = ""; }; 3BF6F29F0E79B5AD000F2EEE /* gtest-type-util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-type-util.h"; sourceTree = ""; }; 3BF6F2A40E79B616000F2EEE /* gtest-typed-test.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-typed-test.h"; sourceTree = ""; }; 403EE37C0E377822004BD1E2 /* versiongenerate.py */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.python; path = versiongenerate.py; sourceTree = ""; }; 404883DB0E2F799B00CF7658 /* gtest-death-test.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-death-test.h"; sourceTree = ""; }; 404883DC0E2F799B00CF7658 /* gtest-message.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-message.h"; sourceTree = ""; }; 404883DD0E2F799B00CF7658 /* gtest-spi.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-spi.h"; sourceTree = ""; }; 404883DE0E2F799B00CF7658 /* gtest.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = gtest.h; sourceTree = ""; }; 404883DF0E2F799B00CF7658 /* gtest_pred_impl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = gtest_pred_impl.h; sourceTree = ""; }; 404883E00E2F799B00CF7658 /* gtest_prod.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = gtest_prod.h; sourceTree = ""; }; 404883E20E2F799B00CF7658 /* gtest-death-test-internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-death-test-internal.h"; sourceTree = ""; }; 404883E30E2F799B00CF7658 /* gtest-filepath.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-filepath.h"; sourceTree = ""; }; 404883E40E2F799B00CF7658 /* gtest-internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-internal.h"; sourceTree = ""; }; 404883E50E2F799B00CF7658 /* gtest-port.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-port.h"; sourceTree = ""; }; 404883E60E2F799B00CF7658 /* gtest-string.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-string.h"; sourceTree = ""; }; 404883F60E2F799B00CF7658 /* README */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; name = README; path = ../README; sourceTree = SOURCE_ROOT; }; 4048840D0E2F799B00CF7658 /* gtest_main.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = gtest_main.cc; sourceTree = ""; }; 404884A90E2F7CD900CF7658 /* CHANGES */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; name = CHANGES; path = ../CHANGES; sourceTree = SOURCE_ROOT; }; 404884AA0E2F7CD900CF7658 /* CONTRIBUTORS */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; name = CONTRIBUTORS; path = ../CONTRIBUTORS; sourceTree = SOURCE_ROOT; }; 404884AB0E2F7CD900CF7658 /* COPYING */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; name = COPYING; path = ../COPYING; sourceTree = SOURCE_ROOT; }; 40899F430FFA7184000B29AE /* gtest_unittest-framework */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "gtest_unittest-framework"; sourceTree = BUILT_PRODUCTS_DIR; }; 40899F4D0FFA7271000B29AE /* gtest-tuple.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-tuple.h"; sourceTree = ""; }; 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; path = StaticLibraryTarget.xcconfig; sourceTree = ""; }; 4089A0130FFACEFC000B29AE /* sample1_unittest-framework */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "sample1_unittest-framework"; sourceTree = BUILT_PRODUCTS_DIR; }; 4089A02C0FFACF7F000B29AE /* sample1.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = sample1.cc; sourceTree = ""; }; 4089A02D0FFACF7F000B29AE /* sample1.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = sample1.h; sourceTree = ""; }; 4089A02E0FFACF7F000B29AE /* sample1_unittest.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = sample1_unittest.cc; sourceTree = ""; }; 40C848FA101A209C0083642A /* libgtest.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libgtest.a; sourceTree = BUILT_PRODUCTS_DIR; }; 40C8490B101A217E0083642A /* libgtest_main.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libgtest_main.a; sourceTree = BUILT_PRODUCTS_DIR; }; 40C84987101A36850083642A /* gtest_unittest */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = gtest_unittest; sourceTree = BUILT_PRODUCTS_DIR; }; 40C84997101A36A60083642A /* sample1_unittest-static */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "sample1_unittest-static"; sourceTree = BUILT_PRODUCTS_DIR; }; 40D4CDF10E30E07400294801 /* DebugProject.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; path = DebugProject.xcconfig; sourceTree = ""; }; 40D4CDF20E30E07400294801 /* FrameworkTarget.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; path = FrameworkTarget.xcconfig; sourceTree = ""; }; 40D4CDF30E30E07400294801 /* General.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; path = General.xcconfig; sourceTree = ""; }; 40D4CDF40E30E07400294801 /* ReleaseProject.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; path = ReleaseProject.xcconfig; sourceTree = ""; }; 40D4CF510E30F5E200294801 /* Info.plist */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.plist.xml; path = Info.plist; sourceTree = ""; }; 4539C8FF0EC27F6400A70F4C /* gtest.framework */ = {isa = PBXFileReference; explicitFileType = wrapper.framework; includeInIndex = 0; path = gtest.framework; sourceTree = BUILT_PRODUCTS_DIR; }; 4539C9330EC280AE00A70F4C /* gtest-param-test.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-param-test.h"; sourceTree = ""; }; 4539C9350EC280E200A70F4C /* gtest-linked_ptr.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-linked_ptr.h"; sourceTree = ""; }; 4539C9360EC280E200A70F4C /* gtest-param-util-generated.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-param-util-generated.h"; sourceTree = ""; }; 4539C9370EC280E200A70F4C /* gtest-param-util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-param-util.h"; sourceTree = ""; }; 4567C8171264FF71007740BE /* gtest-printers.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "gtest-printers.h"; sourceTree = ""; }; /* End PBXFileReference section */ /* Begin PBXFrameworksBuildPhase section */ 40899F410FFA7184000B29AE /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( 40C849A4101A37150083642A /* gtest.framework in Frameworks */, 40C84916101A235B0083642A /* libgtest_main.a in Frameworks */, ); runOnlyForDeploymentPostprocessing = 0; }; 4089A0110FFACEFC000B29AE /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( 40C849A2101A37050083642A /* gtest.framework in Frameworks */, 40C84921101A23AD0083642A /* libgtest_main.a in Frameworks */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C84981101A36850083642A /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( 40C84982101A36850083642A /* libgtest.a in Frameworks */, 40C84983101A36850083642A /* libgtest_main.a in Frameworks */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C84991101A36A60083642A /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( 40C84992101A36A60083642A /* libgtest.a in Frameworks */, 40C84993101A36A60083642A /* libgtest_main.a in Frameworks */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXFrameworksBuildPhase section */ /* Begin PBXGroup section */ 034768DDFF38A45A11DB9C8B /* Products */ = { isa = PBXGroup; children = ( 4539C8FF0EC27F6400A70F4C /* gtest.framework */, 40C848FA101A209C0083642A /* libgtest.a */, 40C8490B101A217E0083642A /* libgtest_main.a */, 40899F430FFA7184000B29AE /* gtest_unittest-framework */, 40C84987101A36850083642A /* gtest_unittest */, 4089A0130FFACEFC000B29AE /* sample1_unittest-framework */, 40C84997101A36A60083642A /* sample1_unittest-static */, ); name = Products; sourceTree = ""; }; 0867D691FE84028FC02AAC07 /* gtest */ = { isa = PBXGroup; children = ( 40D4CDF00E30E07400294801 /* Config */, 08FB77ACFE841707C02AAC07 /* Source */, 40D4CF4E0E30F5E200294801 /* Resources */, 403EE37B0E377822004BD1E2 /* Scripts */, 034768DDFF38A45A11DB9C8B /* Products */, ); name = gtest; sourceTree = ""; }; 08FB77ACFE841707C02AAC07 /* Source */ = { isa = PBXGroup; children = ( 404884A90E2F7CD900CF7658 /* CHANGES */, 404884AA0E2F7CD900CF7658 /* CONTRIBUTORS */, 404884AB0E2F7CD900CF7658 /* COPYING */, 404883F60E2F799B00CF7658 /* README */, 404883D90E2F799B00CF7658 /* include */, 4089A02F0FFACF84000B29AE /* samples */, 404884070E2F799B00CF7658 /* src */, 3B238BF00E7FE13B00846E11 /* test */, ); name = Source; sourceTree = ""; }; 3B238BF00E7FE13B00846E11 /* test */ = { isa = PBXGroup; children = ( 3B238C120E7FE13C00846E11 /* gtest_unittest.cc */, ); name = test; path = ../test; sourceTree = SOURCE_ROOT; }; 403EE37B0E377822004BD1E2 /* Scripts */ = { isa = PBXGroup; children = ( 403EE37C0E377822004BD1E2 /* versiongenerate.py */, 3B87D2100E96B92E000D1852 /* runtests.sh */, ); path = Scripts; sourceTree = ""; }; 404883D90E2F799B00CF7658 /* include */ = { isa = PBXGroup; children = ( 404883DA0E2F799B00CF7658 /* gtest */, ); name = include; path = ../include; sourceTree = SOURCE_ROOT; }; 404883DA0E2F799B00CF7658 /* gtest */ = { isa = PBXGroup; children = ( 404883E10E2F799B00CF7658 /* internal */, 224A12A20E9EADCC00BD17FD /* gtest-test-part.h */, 404883DB0E2F799B00CF7658 /* gtest-death-test.h */, 404883DC0E2F799B00CF7658 /* gtest-message.h */, 4539C9330EC280AE00A70F4C /* gtest-param-test.h */, 4567C8171264FF71007740BE /* gtest-printers.h */, 404883DD0E2F799B00CF7658 /* gtest-spi.h */, 404883DE0E2F799B00CF7658 /* gtest.h */, 404883DF0E2F799B00CF7658 /* gtest_pred_impl.h */, 404883E00E2F799B00CF7658 /* gtest_prod.h */, 3BF6F2A40E79B616000F2EEE /* gtest-typed-test.h */, ); path = gtest; sourceTree = ""; }; 404883E10E2F799B00CF7658 /* internal */ = { isa = PBXGroup; children = ( 404883E20E2F799B00CF7658 /* gtest-death-test-internal.h */, 404883E30E2F799B00CF7658 /* gtest-filepath.h */, 404883E40E2F799B00CF7658 /* gtest-internal.h */, 4539C9350EC280E200A70F4C /* gtest-linked_ptr.h */, 4539C9360EC280E200A70F4C /* gtest-param-util-generated.h */, 4539C9370EC280E200A70F4C /* gtest-param-util.h */, 404883E50E2F799B00CF7658 /* gtest-port.h */, 404883E60E2F799B00CF7658 /* gtest-string.h */, 40899F4D0FFA7271000B29AE /* gtest-tuple.h */, 3BF6F29F0E79B5AD000F2EEE /* gtest-type-util.h */, ); path = internal; sourceTree = ""; }; 404884070E2F799B00CF7658 /* src */ = { isa = PBXGroup; children = ( 224A12A10E9EADA700BD17FD /* gtest-all.cc */, 4048840D0E2F799B00CF7658 /* gtest_main.cc */, ); name = src; path = ../src; sourceTree = SOURCE_ROOT; }; 4089A02F0FFACF84000B29AE /* samples */ = { isa = PBXGroup; children = ( 4089A02C0FFACF7F000B29AE /* sample1.cc */, 4089A02D0FFACF7F000B29AE /* sample1.h */, 4089A02E0FFACF7F000B29AE /* sample1_unittest.cc */, ); name = samples; path = ../samples; sourceTree = SOURCE_ROOT; }; 40D4CDF00E30E07400294801 /* Config */ = { isa = PBXGroup; children = ( 40D4CDF10E30E07400294801 /* DebugProject.xcconfig */, 40D4CDF20E30E07400294801 /* FrameworkTarget.xcconfig */, 40D4CDF30E30E07400294801 /* General.xcconfig */, 40D4CDF40E30E07400294801 /* ReleaseProject.xcconfig */, 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */, ); path = Config; sourceTree = ""; }; 40D4CF4E0E30F5E200294801 /* Resources */ = { isa = PBXGroup; children = ( 40D4CF510E30F5E200294801 /* Info.plist */, ); path = Resources; sourceTree = ""; }; /* End PBXGroup section */ /* Begin PBXHeadersBuildPhase section */ 8D07F2BD0486CC7A007CD1D0 /* Headers */ = { isa = PBXHeadersBuildPhase; buildActionMask = 2147483647; files = ( 404884380E2F799B00CF7658 /* gtest-death-test.h in Headers */, 404884390E2F799B00CF7658 /* gtest-message.h in Headers */, 4539C9340EC280AE00A70F4C /* gtest-param-test.h in Headers */, 4567C8181264FF71007740BE /* gtest-printers.h in Headers */, 3BF6F2A50E79B616000F2EEE /* gtest-typed-test.h in Headers */, 4048843A0E2F799B00CF7658 /* gtest-spi.h in Headers */, 4048843B0E2F799B00CF7658 /* gtest.h in Headers */, 4048843C0E2F799B00CF7658 /* gtest_pred_impl.h in Headers */, 4048843D0E2F799B00CF7658 /* gtest_prod.h in Headers */, 224A12A30E9EADCC00BD17FD /* gtest-test-part.h in Headers */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXHeadersBuildPhase section */ /* Begin PBXNativeTarget section */ 40899F420FFA7184000B29AE /* gtest_unittest-framework */ = { isa = PBXNativeTarget; buildConfigurationList = 40899F4A0FFA71BC000B29AE /* Build configuration list for PBXNativeTarget "gtest_unittest-framework" */; buildPhases = ( 40899F400FFA7184000B29AE /* Sources */, 40899F410FFA7184000B29AE /* Frameworks */, ); buildRules = ( ); dependencies = ( 40C849A0101A36F10083642A /* PBXTargetDependency */, ); name = "gtest_unittest-framework"; productName = gtest_unittest; productReference = 40899F430FFA7184000B29AE /* gtest_unittest-framework */; productType = "com.apple.product-type.tool"; }; 4089A0120FFACEFC000B29AE /* sample1_unittest-framework */ = { isa = PBXNativeTarget; buildConfigurationList = 4089A0240FFACF01000B29AE /* Build configuration list for PBXNativeTarget "sample1_unittest-framework" */; buildPhases = ( 4089A0100FFACEFC000B29AE /* Sources */, 4089A0110FFACEFC000B29AE /* Frameworks */, ); buildRules = ( ); dependencies = ( 40C8499E101A36E50083642A /* PBXTargetDependency */, ); name = "sample1_unittest-framework"; productName = sample1_unittest; productReference = 4089A0130FFACEFC000B29AE /* sample1_unittest-framework */; productType = "com.apple.product-type.tool"; }; 40C848F9101A209C0083642A /* gtest-static */ = { isa = PBXNativeTarget; buildConfigurationList = 40C84902101A212E0083642A /* Build configuration list for PBXNativeTarget "gtest-static" */; buildPhases = ( 40C848F7101A209C0083642A /* Sources */, ); buildRules = ( ); dependencies = ( ); name = "gtest-static"; productName = "gtest-static"; productReference = 40C848FA101A209C0083642A /* libgtest.a */; productType = "com.apple.product-type.library.static"; }; 40C8490A101A217E0083642A /* gtest_main-static */ = { isa = PBXNativeTarget; buildConfigurationList = 40C84912101A21D20083642A /* Build configuration list for PBXNativeTarget "gtest_main-static" */; buildPhases = ( 40C84908101A217E0083642A /* Sources */, ); buildRules = ( ); dependencies = ( ); name = "gtest_main-static"; productName = "gtest_main-static"; productReference = 40C8490B101A217E0083642A /* libgtest_main.a */; productType = "com.apple.product-type.library.static"; }; 40C8497A101A36850083642A /* gtest_unittest-static */ = { isa = PBXNativeTarget; buildConfigurationList = 40C84984101A36850083642A /* Build configuration list for PBXNativeTarget "gtest_unittest-static" */; buildPhases = ( 40C8497F101A36850083642A /* Sources */, 40C84981101A36850083642A /* Frameworks */, ); buildRules = ( ); dependencies = ( 40C8497B101A36850083642A /* PBXTargetDependency */, 40C8497D101A36850083642A /* PBXTargetDependency */, ); name = "gtest_unittest-static"; productName = gtest_unittest; productReference = 40C84987101A36850083642A /* gtest_unittest */; productType = "com.apple.product-type.tool"; }; 40C84989101A36A60083642A /* sample1_unittest-static */ = { isa = PBXNativeTarget; buildConfigurationList = 40C84994101A36A60083642A /* Build configuration list for PBXNativeTarget "sample1_unittest-static" */; buildPhases = ( 40C8498E101A36A60083642A /* Sources */, 40C84991101A36A60083642A /* Frameworks */, ); buildRules = ( ); dependencies = ( 40C8498A101A36A60083642A /* PBXTargetDependency */, 40C8498C101A36A60083642A /* PBXTargetDependency */, ); name = "sample1_unittest-static"; productName = sample1_unittest; productReference = 40C84997101A36A60083642A /* sample1_unittest-static */; productType = "com.apple.product-type.tool"; }; 8D07F2BC0486CC7A007CD1D0 /* gtest-framework */ = { isa = PBXNativeTarget; buildConfigurationList = 4FADC24208B4156D00ABE55E /* Build configuration list for PBXNativeTarget "gtest-framework" */; buildPhases = ( 8D07F2C10486CC7A007CD1D0 /* Sources */, 8D07F2BD0486CC7A007CD1D0 /* Headers */, 404884A50E2F7C0400CF7658 /* Copy Headers Internal */, 8D07F2BF0486CC7A007CD1D0 /* Resources */, ); buildRules = ( ); dependencies = ( 40C44AE60E379922008FCC51 /* PBXTargetDependency */, 408BEC101046CFE900DEF522 /* PBXTargetDependency */, 40C8499C101A36DC0083642A /* PBXTargetDependency */, ); name = "gtest-framework"; productInstallPath = "$(HOME)/Library/Frameworks"; productName = gtest; productReference = 4539C8FF0EC27F6400A70F4C /* gtest.framework */; productType = "com.apple.product-type.framework"; }; /* End PBXNativeTarget section */ /* Begin PBXProject section */ 0867D690FE84028FC02AAC07 /* Project object */ = { isa = PBXProject; buildConfigurationList = 4FADC24608B4156D00ABE55E /* Build configuration list for PBXProject "gtest" */; compatibilityVersion = "Xcode 2.4"; hasScannedForEncodings = 1; knownRegions = ( English, Japanese, French, German, en, ); mainGroup = 0867D691FE84028FC02AAC07 /* gtest */; productRefGroup = 034768DDFF38A45A11DB9C8B /* Products */; projectDirPath = ""; projectRoot = ""; targets = ( 8D07F2BC0486CC7A007CD1D0 /* gtest-framework */, 40C848F9101A209C0083642A /* gtest-static */, 40C8490A101A217E0083642A /* gtest_main-static */, 40899F420FFA7184000B29AE /* gtest_unittest-framework */, 40C8497A101A36850083642A /* gtest_unittest-static */, 4089A0120FFACEFC000B29AE /* sample1_unittest-framework */, 40C84989101A36A60083642A /* sample1_unittest-static */, 3B238F5F0E828B5400846E11 /* Check */, 40C44ADC0E3798F4008FCC51 /* Version Info */, ); }; /* End PBXProject section */ /* Begin PBXResourcesBuildPhase section */ 8D07F2BF0486CC7A007CD1D0 /* Resources */ = { isa = PBXResourcesBuildPhase; buildActionMask = 2147483647; files = ( 404884500E2F799B00CF7658 /* README in Resources */, 404884AC0E2F7CD900CF7658 /* CHANGES in Resources */, 404884AD0E2F7CD900CF7658 /* CONTRIBUTORS in Resources */, 404884AE0E2F7CD900CF7658 /* COPYING in Resources */, 40C84978101A36540083642A /* libgtest_main.a in Resources */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXResourcesBuildPhase section */ /* Begin PBXShellScriptBuildPhase section */ 3B238F5E0E828B5400846E11 /* ShellScript */ = { isa = PBXShellScriptBuildPhase; buildActionMask = 2147483647; files = ( ); inputPaths = ( ); outputPaths = ( ); runOnlyForDeploymentPostprocessing = 0; shellPath = /bin/sh; shellScript = "# Remember, this \"Run Script\" build phase will be executed from $SRCROOT\n/bin/bash Scripts/runtests.sh"; }; 40C44ADB0E3798F4008FCC51 /* Generate Version.h */ = { isa = PBXShellScriptBuildPhase; buildActionMask = 2147483647; files = ( ); inputPaths = ( "$(SRCROOT)/Scripts/versiongenerate.py", "$(SRCROOT)/../configure.ac", ); name = "Generate Version.h"; outputPaths = ( "$(PROJECT_TEMP_DIR)/Version.h", ); runOnlyForDeploymentPostprocessing = 0; shellPath = /bin/sh; shellScript = "# Remember, this \"Run Script\" build phase will be executed from $SRCROOT\n/usr/bin/python Scripts/versiongenerate.py ../ $PROJECT_TEMP_DIR"; }; /* End PBXShellScriptBuildPhase section */ /* Begin PBXSourcesBuildPhase section */ 40899F400FFA7184000B29AE /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40899F530FFA72A0000B29AE /* gtest_unittest.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 4089A0100FFACEFC000B29AE /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 4089A0440FFAD1BE000B29AE /* sample1.cc in Sources */, 4089A0460FFAD1BE000B29AE /* sample1_unittest.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C848F7101A209C0083642A /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40C848FF101A21150083642A /* gtest-all.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C84908101A217E0083642A /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40C84915101A21DF0083642A /* gtest_main.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C8497F101A36850083642A /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40C84980101A36850083642A /* gtest_unittest.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 40C8498E101A36A60083642A /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40C8498F101A36A60083642A /* sample1.cc in Sources */, 40C84990101A36A60083642A /* sample1_unittest.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 8D07F2C10486CC7A007CD1D0 /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 40899F3A0FFA70D4000B29AE /* gtest-all.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXSourcesBuildPhase section */ /* Begin PBXTargetDependency section */ 40899F9D0FFA740F000B29AE /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40899F420FFA7184000B29AE /* gtest_unittest-framework */; targetProxy = 40899F9C0FFA740F000B29AE /* PBXContainerItemProxy */; }; 4089A0980FFAD34A000B29AE /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 4089A0120FFACEFC000B29AE /* sample1_unittest-framework */; targetProxy = 4089A0970FFAD34A000B29AE /* PBXContainerItemProxy */; }; 408BEC101046CFE900DEF522 /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C848F9101A209C0083642A /* gtest-static */; targetProxy = 408BEC0F1046CFE900DEF522 /* PBXContainerItemProxy */; }; 40C44AE60E379922008FCC51 /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C44ADC0E3798F4008FCC51 /* Version Info */; targetProxy = 40C44AE50E379922008FCC51 /* PBXContainerItemProxy */; }; 40C8497B101A36850083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C848F9101A209C0083642A /* gtest-static */; targetProxy = 40C8497C101A36850083642A /* PBXContainerItemProxy */; }; 40C8497D101A36850083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C8490A101A217E0083642A /* gtest_main-static */; targetProxy = 40C8497E101A36850083642A /* PBXContainerItemProxy */; }; 40C8498A101A36A60083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C848F9101A209C0083642A /* gtest-static */; targetProxy = 40C8498B101A36A60083642A /* PBXContainerItemProxy */; }; 40C8498C101A36A60083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C8490A101A217E0083642A /* gtest_main-static */; targetProxy = 40C8498D101A36A60083642A /* PBXContainerItemProxy */; }; 40C8499C101A36DC0083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C8490A101A217E0083642A /* gtest_main-static */; targetProxy = 40C8499B101A36DC0083642A /* PBXContainerItemProxy */; }; 40C8499E101A36E50083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 8D07F2BC0486CC7A007CD1D0 /* gtest-framework */; targetProxy = 40C8499D101A36E50083642A /* PBXContainerItemProxy */; }; 40C849A0101A36F10083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 8D07F2BC0486CC7A007CD1D0 /* gtest-framework */; targetProxy = 40C8499F101A36F10083642A /* PBXContainerItemProxy */; }; 40C849F7101A43440083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C8497A101A36850083642A /* gtest_unittest-static */; targetProxy = 40C849F6101A43440083642A /* PBXContainerItemProxy */; }; 40C849F9101A43490083642A /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 40C84989101A36A60083642A /* sample1_unittest-static */; targetProxy = 40C849F8101A43490083642A /* PBXContainerItemProxy */; }; /* End PBXTargetDependency section */ /* Begin XCBuildConfiguration section */ 3B238F600E828B5400846E11 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { COPY_PHASE_STRIP = NO; GCC_DYNAMIC_NO_PIC = NO; GCC_OPTIMIZATION_LEVEL = 0; PRODUCT_NAME = Check; }; name = Debug; }; 3B238F610E828B5400846E11 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { COPY_PHASE_STRIP = YES; DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym"; GCC_ENABLE_FIX_AND_CONTINUE = NO; PRODUCT_NAME = Check; ZERO_LINK = NO; }; name = Release; }; 40899F450FFA7185000B29AE /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { HEADER_SEARCH_PATHS = ../; PRODUCT_NAME = "gtest_unittest-framework"; }; name = Debug; }; 40899F460FFA7185000B29AE /* Release */ = { isa = XCBuildConfiguration; buildSettings = { HEADER_SEARCH_PATHS = ../; PRODUCT_NAME = "gtest_unittest-framework"; }; name = Release; }; 4089A0150FFACEFD000B29AE /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = "sample1_unittest-framework"; }; name = Debug; }; 4089A0160FFACEFD000B29AE /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = "sample1_unittest-framework"; }; name = Release; }; 40C44ADF0E3798F4008FCC51 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = gtest; TARGET_NAME = gtest; }; name = Debug; }; 40C44AE00E3798F4008FCC51 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = gtest; TARGET_NAME = gtest; }; name = Release; }; 40C848FB101A209D0083642A /* Debug */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */; buildSettings = { GCC_INLINES_ARE_PRIVATE_EXTERN = YES; GCC_SYMBOLS_PRIVATE_EXTERN = YES; HEADER_SEARCH_PATHS = ( ../, ../include/, ); PRODUCT_NAME = gtest; }; name = Debug; }; 40C848FC101A209D0083642A /* Release */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */; buildSettings = { GCC_INLINES_ARE_PRIVATE_EXTERN = YES; GCC_SYMBOLS_PRIVATE_EXTERN = YES; HEADER_SEARCH_PATHS = ( ../, ../include/, ); PRODUCT_NAME = gtest; }; name = Release; }; 40C8490E101A217F0083642A /* Debug */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */; buildSettings = { HEADER_SEARCH_PATHS = ( ../, ../include/, ); PRODUCT_NAME = gtest_main; }; name = Debug; }; 40C8490F101A217F0083642A /* Release */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40899FB30FFA7567000B29AE /* StaticLibraryTarget.xcconfig */; buildSettings = { HEADER_SEARCH_PATHS = ( ../, ../include/, ); PRODUCT_NAME = gtest_main; }; name = Release; }; 40C84985101A36850083642A /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { HEADER_SEARCH_PATHS = ../; PRODUCT_NAME = gtest_unittest; }; name = Debug; }; 40C84986101A36850083642A /* Release */ = { isa = XCBuildConfiguration; buildSettings = { HEADER_SEARCH_PATHS = ../; PRODUCT_NAME = gtest_unittest; }; name = Release; }; 40C84995101A36A60083642A /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = "sample1_unittest-static"; }; name = Debug; }; 40C84996101A36A60083642A /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = "sample1_unittest-static"; }; name = Release; }; 4FADC24308B4156D00ABE55E /* Debug */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40D4CDF20E30E07400294801 /* FrameworkTarget.xcconfig */; buildSettings = { DYLIB_COMPATIBILITY_VERSION = 1; DYLIB_CURRENT_VERSION = 1; HEADER_SEARCH_PATHS = ( ../, ../include/, ); INFOPLIST_FILE = Resources/Info.plist; INFOPLIST_PREFIX_HEADER = "$(PROJECT_TEMP_DIR)/Version.h"; INFOPLIST_PREPROCESS = YES; PRODUCT_NAME = gtest; VERSIONING_SYSTEM = "apple-generic"; }; name = Debug; }; 4FADC24408B4156D00ABE55E /* Release */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40D4CDF20E30E07400294801 /* FrameworkTarget.xcconfig */; buildSettings = { DYLIB_COMPATIBILITY_VERSION = 1; DYLIB_CURRENT_VERSION = 1; HEADER_SEARCH_PATHS = ( ../, ../include/, ); INFOPLIST_FILE = Resources/Info.plist; INFOPLIST_PREFIX_HEADER = "$(PROJECT_TEMP_DIR)/Version.h"; INFOPLIST_PREPROCESS = YES; PRODUCT_NAME = gtest; VERSIONING_SYSTEM = "apple-generic"; }; name = Release; }; 4FADC24708B4156D00ABE55E /* Debug */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40D4CDF10E30E07400294801 /* DebugProject.xcconfig */; buildSettings = { }; name = Debug; }; 4FADC24808B4156D00ABE55E /* Release */ = { isa = XCBuildConfiguration; baseConfigurationReference = 40D4CDF40E30E07400294801 /* ReleaseProject.xcconfig */; buildSettings = { }; name = Release; }; /* End XCBuildConfiguration section */ /* Begin XCConfigurationList section */ 3B238FA30E828BB600846E11 /* Build configuration list for PBXAggregateTarget "Check" */ = { isa = XCConfigurationList; buildConfigurations = ( 3B238F600E828B5400846E11 /* Debug */, 3B238F610E828B5400846E11 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40899F4A0FFA71BC000B29AE /* Build configuration list for PBXNativeTarget "gtest_unittest-framework" */ = { isa = XCConfigurationList; buildConfigurations = ( 40899F450FFA7185000B29AE /* Debug */, 40899F460FFA7185000B29AE /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4089A0240FFACF01000B29AE /* Build configuration list for PBXNativeTarget "sample1_unittest-framework" */ = { isa = XCConfigurationList; buildConfigurations = ( 4089A0150FFACEFD000B29AE /* Debug */, 4089A0160FFACEFD000B29AE /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40C44AE40E379905008FCC51 /* Build configuration list for PBXAggregateTarget "Version Info" */ = { isa = XCConfigurationList; buildConfigurations = ( 40C44ADF0E3798F4008FCC51 /* Debug */, 40C44AE00E3798F4008FCC51 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40C84902101A212E0083642A /* Build configuration list for PBXNativeTarget "gtest-static" */ = { isa = XCConfigurationList; buildConfigurations = ( 40C848FB101A209D0083642A /* Debug */, 40C848FC101A209D0083642A /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40C84912101A21D20083642A /* Build configuration list for PBXNativeTarget "gtest_main-static" */ = { isa = XCConfigurationList; buildConfigurations = ( 40C8490E101A217F0083642A /* Debug */, 40C8490F101A217F0083642A /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40C84984101A36850083642A /* Build configuration list for PBXNativeTarget "gtest_unittest-static" */ = { isa = XCConfigurationList; buildConfigurations = ( 40C84985101A36850083642A /* Debug */, 40C84986101A36850083642A /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 40C84994101A36A60083642A /* Build configuration list for PBXNativeTarget "sample1_unittest-static" */ = { isa = XCConfigurationList; buildConfigurations = ( 40C84995101A36A60083642A /* Debug */, 40C84996101A36A60083642A /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4FADC24208B4156D00ABE55E /* Build configuration list for PBXNativeTarget "gtest-framework" */ = { isa = XCConfigurationList; buildConfigurations = ( 4FADC24308B4156D00ABE55E /* Debug */, 4FADC24408B4156D00ABE55E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4FADC24608B4156D00ABE55E /* Build configuration list for PBXProject "gtest" */ = { isa = XCConfigurationList; buildConfigurations = ( 4FADC24708B4156D00ABE55E /* Debug */, 4FADC24808B4156D00ABE55E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; /* End XCConfigurationList section */ }; rootObject = 0867D690FE84028FC02AAC07 /* Project object */; } synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Resources/0000700000175000017500000000000012140644175022513 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Resources/Info.plist0000600000175000017500000000176211561126632024472 0ustar synergysynergy CFBundleDevelopmentRegion English CFBundleExecutable ${EXECUTABLE_NAME} CFBundleIconFile CFBundleIdentifier com.google.${PRODUCT_NAME} CFBundleInfoDictionaryVersion 6.0 CFBundlePackageType FMWK CFBundleSignature ???? CFBundleVersion GTEST_VERSIONINFO_LONG CFBundleShortVersionString GTEST_VERSIONINFO_SHORT CFBundleGetInfoString ${PRODUCT_NAME} GTEST_VERSIONINFO_LONG, ${GTEST_VERSIONINFO_ABOUT} NSHumanReadableCopyright ${GTEST_VERSIONINFO_ABOUT} CSResourcesFileMapped synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/0000700000175000017500000000000012140644175022145 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/0000700000175000017500000000000012140644175025244 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/Info.plist0000600000175000017500000000151611561126632027220 0ustar synergysynergy CFBundleDevelopmentRegion English CFBundleExecutable ${EXECUTABLE_NAME} CFBundleIconFile CFBundleIdentifier com.google.gtest.${PRODUCT_NAME:identifier} CFBundleInfoDictionaryVersion 6.0 CFBundleName ${PRODUCT_NAME} CFBundlePackageType FMWK CFBundleShortVersionString 1.0 CFBundleSignature ???? CFBundleVersion 1.0 CSResourcesFileMapped synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/runtests.sh0000600000175000017500000000446211561126632027476 0ustar synergysynergy#!/bin/bash # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. # Executes the samples and tests for the Google Test Framework. # Help the dynamic linker find the path to the libraries. export DYLD_FRAMEWORK_PATH=$BUILT_PRODUCTS_DIR export DYLD_LIBRARY_PATH=$BUILT_PRODUCTS_DIR # Create some executables. test_executables=$@ # Now execute each one in turn keeping track of how many succeeded and failed. succeeded=0 failed=0 failed_list=() for test in ${test_executables[*]}; do "$test" result=$? if [ $result -eq 0 ]; then succeeded=$(( $succeeded + 1 )) else failed=$(( failed + 1 )) failed_list="$failed_list $test" fi done # Report the successes and failures to the console. echo "Tests complete with $succeeded successes and $failed failures." if [ $failed -ne 0 ]; then echo "The following tests failed:" echo $failed_list fi exit $failed synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/widget.cc0000600000175000017500000000440311561126632027040 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: preston.a.jackson@gmail.com (Preston Jackson) // // Google Test - FrameworkSample // widget.cc // // Widget is a very simple class used for demonstrating the use of gtest #include "widget.h" Widget::Widget(int number, const std::string& name) : number_(number), name_(name) {} Widget::~Widget() {} float Widget::GetFloatValue() const { return number_; } int Widget::GetIntValue() const { return static_cast(number_); } std::string Widget::GetStringValue() const { return name_; } void Widget::GetCharPtrValue(char* buffer, size_t max_size) const { // Copy the char* representation of name_ into buffer, up to max_size. strncpy(buffer, name_.c_str(), max_size-1); buffer[max_size-1] = '\0'; return; } synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/widget.h0000600000175000017500000000433611561126632026707 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: preston.a.jackson@gmail.com (Preston Jackson) // // Google Test - FrameworkSample // widget.h // // Widget is a very simple class used for demonstrating the use of gtest. It // simply stores two values a string and an integer, which are returned via // public accessors in multiple forms. #import class Widget { public: Widget(int number, const std::string& name); ~Widget(); // Public accessors to number data float GetFloatValue() const; int GetIntValue() const; // Public accessors to the string data std::string GetStringValue() const; void GetCharPtrValue(char* buffer, size_t max_size) const; private: // Data members float number_; std::string name_; }; synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/WidgetFramework.xcodeproj/0000700000175000017500000000000012140644175032341 5ustar synergysynergy././@LongLink0000000000000000000000000000016000000000000011562 Lustar rootrootsynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/WidgetFramework.xcodeproj/project.pbxprojsynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/WidgetFramework.xcodeproj/proj0000600000175000017500000003727411561126632033254 0ustar synergysynergy// !$*UTF8*$! { archiveVersion = 1; classes = { }; objectVersion = 42; objects = { /* Begin PBXAggregateTarget section */ 4024D162113D7D2400C7059E /* Test */ = { isa = PBXAggregateTarget; buildConfigurationList = 4024D169113D7D4600C7059E /* Build configuration list for PBXAggregateTarget "Test" */; buildPhases = ( 4024D161113D7D2400C7059E /* ShellScript */, ); dependencies = ( 4024D166113D7D3100C7059E /* PBXTargetDependency */, ); name = Test; productName = TestAndBuild; }; 4024D1E9113D83FF00C7059E /* TestAndBuild */ = { isa = PBXAggregateTarget; buildConfigurationList = 4024D1F0113D842B00C7059E /* Build configuration list for PBXAggregateTarget "TestAndBuild" */; buildPhases = ( ); dependencies = ( 4024D1ED113D840900C7059E /* PBXTargetDependency */, 4024D1EF113D840D00C7059E /* PBXTargetDependency */, ); name = TestAndBuild; productName = TestAndBuild; }; /* End PBXAggregateTarget section */ /* Begin PBXBuildFile section */ 3B7EB1250E5AEE3500C7F239 /* widget.cc in Sources */ = {isa = PBXBuildFile; fileRef = 3B7EB1230E5AEE3500C7F239 /* widget.cc */; }; 3B7EB1260E5AEE3500C7F239 /* widget.h in Headers */ = {isa = PBXBuildFile; fileRef = 3B7EB1240E5AEE3500C7F239 /* widget.h */; settings = {ATTRIBUTES = (Public, ); }; }; 3B7EB1280E5AEE4600C7F239 /* widget_test.cc in Sources */ = {isa = PBXBuildFile; fileRef = 3B7EB1270E5AEE4600C7F239 /* widget_test.cc */; }; 3B7EB1480E5AF3B400C7F239 /* Widget.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 8D07F2C80486CC7A007CD1D0 /* Widget.framework */; }; 4024D188113D7D7800C7059E /* libgtest.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 4024D185113D7D5500C7059E /* libgtest.a */; }; 4024D189113D7D7A00C7059E /* libgtest_main.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 4024D183113D7D5500C7059E /* libgtest_main.a */; }; /* End PBXBuildFile section */ /* Begin PBXContainerItemProxy section */ 3B07BDF00E3F3FAE00647869 /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 8D07F2BC0486CC7A007CD1D0; remoteInfo = gTestExample; }; 4024D165113D7D3100C7059E /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 3B07BDE90E3F3F9E00647869; remoteInfo = WidgetFrameworkTest; }; 4024D1EC113D840900C7059E /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 8D07F2BC0486CC7A007CD1D0; remoteInfo = WidgetFramework; }; 4024D1EE113D840D00C7059E /* PBXContainerItemProxy */ = { isa = PBXContainerItemProxy; containerPortal = 0867D690FE84028FC02AAC07 /* Project object */; proxyType = 1; remoteGlobalIDString = 4024D162113D7D2400C7059E; remoteInfo = Test; }; /* End PBXContainerItemProxy section */ /* Begin PBXFileReference section */ 3B07BDEA0E3F3F9E00647869 /* WidgetFrameworkTest */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = WidgetFrameworkTest; sourceTree = BUILT_PRODUCTS_DIR; }; 3B7EB1230E5AEE3500C7F239 /* widget.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = widget.cc; sourceTree = ""; }; 3B7EB1240E5AEE3500C7F239 /* widget.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = widget.h; sourceTree = ""; }; 3B7EB1270E5AEE4600C7F239 /* widget_test.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = widget_test.cc; sourceTree = ""; }; 4024D183113D7D5500C7059E /* libgtest_main.a */ = {isa = PBXFileReference; lastKnownFileType = archive.ar; name = libgtest_main.a; path = /usr/local/lib/libgtest_main.a; sourceTree = ""; }; 4024D185113D7D5500C7059E /* libgtest.a */ = {isa = PBXFileReference; lastKnownFileType = archive.ar; name = libgtest.a; path = /usr/local/lib/libgtest.a; sourceTree = ""; }; 4024D1E2113D838200C7059E /* runtests.sh */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.sh; path = runtests.sh; sourceTree = ""; }; 8D07F2C70486CC7A007CD1D0 /* Info.plist */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.plist; path = Info.plist; sourceTree = ""; }; 8D07F2C80486CC7A007CD1D0 /* Widget.framework */ = {isa = PBXFileReference; explicitFileType = wrapper.framework; includeInIndex = 0; path = Widget.framework; sourceTree = BUILT_PRODUCTS_DIR; }; /* End PBXFileReference section */ /* Begin PBXFrameworksBuildPhase section */ 3B07BDE80E3F3F9E00647869 /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( 4024D189113D7D7A00C7059E /* libgtest_main.a in Frameworks */, 4024D188113D7D7800C7059E /* libgtest.a in Frameworks */, 3B7EB1480E5AF3B400C7F239 /* Widget.framework in Frameworks */, ); runOnlyForDeploymentPostprocessing = 0; }; 8D07F2C30486CC7A007CD1D0 /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXFrameworksBuildPhase section */ /* Begin PBXGroup section */ 034768DDFF38A45A11DB9C8B /* Products */ = { isa = PBXGroup; children = ( 8D07F2C80486CC7A007CD1D0 /* Widget.framework */, 3B07BDEA0E3F3F9E00647869 /* WidgetFrameworkTest */, ); name = Products; sourceTree = ""; }; 0867D691FE84028FC02AAC07 /* gTestExample */ = { isa = PBXGroup; children = ( 4024D1E1113D836C00C7059E /* Scripts */, 08FB77ACFE841707C02AAC07 /* Source */, 089C1665FE841158C02AAC07 /* Resources */, 3B07BE350E4094E400647869 /* Test */, 0867D69AFE84028FC02AAC07 /* External Frameworks and Libraries */, 034768DDFF38A45A11DB9C8B /* Products */, ); name = gTestExample; sourceTree = ""; }; 0867D69AFE84028FC02AAC07 /* External Frameworks and Libraries */ = { isa = PBXGroup; children = ( 4024D183113D7D5500C7059E /* libgtest_main.a */, 4024D185113D7D5500C7059E /* libgtest.a */, ); name = "External Frameworks and Libraries"; sourceTree = ""; }; 089C1665FE841158C02AAC07 /* Resources */ = { isa = PBXGroup; children = ( 8D07F2C70486CC7A007CD1D0 /* Info.plist */, ); name = Resources; sourceTree = ""; }; 08FB77ACFE841707C02AAC07 /* Source */ = { isa = PBXGroup; children = ( 3B7EB1230E5AEE3500C7F239 /* widget.cc */, 3B7EB1240E5AEE3500C7F239 /* widget.h */, ); name = Source; sourceTree = ""; }; 3B07BE350E4094E400647869 /* Test */ = { isa = PBXGroup; children = ( 3B7EB1270E5AEE4600C7F239 /* widget_test.cc */, ); name = Test; sourceTree = ""; }; 4024D1E1113D836C00C7059E /* Scripts */ = { isa = PBXGroup; children = ( 4024D1E2113D838200C7059E /* runtests.sh */, ); name = Scripts; sourceTree = ""; }; /* End PBXGroup section */ /* Begin PBXHeadersBuildPhase section */ 8D07F2BD0486CC7A007CD1D0 /* Headers */ = { isa = PBXHeadersBuildPhase; buildActionMask = 2147483647; files = ( 3B7EB1260E5AEE3500C7F239 /* widget.h in Headers */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXHeadersBuildPhase section */ /* Begin PBXNativeTarget section */ 3B07BDE90E3F3F9E00647869 /* WidgetFrameworkTest */ = { isa = PBXNativeTarget; buildConfigurationList = 3B07BDF40E3F3FB600647869 /* Build configuration list for PBXNativeTarget "WidgetFrameworkTest" */; buildPhases = ( 3B07BDE70E3F3F9E00647869 /* Sources */, 3B07BDE80E3F3F9E00647869 /* Frameworks */, ); buildRules = ( ); dependencies = ( 3B07BDF10E3F3FAE00647869 /* PBXTargetDependency */, ); name = WidgetFrameworkTest; productName = gTestExampleTest; productReference = 3B07BDEA0E3F3F9E00647869 /* WidgetFrameworkTest */; productType = "com.apple.product-type.tool"; }; 8D07F2BC0486CC7A007CD1D0 /* WidgetFramework */ = { isa = PBXNativeTarget; buildConfigurationList = 4FADC24208B4156D00ABE55E /* Build configuration list for PBXNativeTarget "WidgetFramework" */; buildPhases = ( 8D07F2C10486CC7A007CD1D0 /* Sources */, 8D07F2C30486CC7A007CD1D0 /* Frameworks */, 8D07F2BD0486CC7A007CD1D0 /* Headers */, 8D07F2BF0486CC7A007CD1D0 /* Resources */, 8D07F2C50486CC7A007CD1D0 /* Rez */, ); buildRules = ( ); dependencies = ( ); name = WidgetFramework; productInstallPath = "$(HOME)/Library/Frameworks"; productName = gTestExample; productReference = 8D07F2C80486CC7A007CD1D0 /* Widget.framework */; productType = "com.apple.product-type.framework"; }; /* End PBXNativeTarget section */ /* Begin PBXProject section */ 0867D690FE84028FC02AAC07 /* Project object */ = { isa = PBXProject; buildConfigurationList = 4FADC24608B4156D00ABE55E /* Build configuration list for PBXProject "WidgetFramework" */; compatibilityVersion = "Xcode 2.4"; hasScannedForEncodings = 1; mainGroup = 0867D691FE84028FC02AAC07 /* gTestExample */; productRefGroup = 034768DDFF38A45A11DB9C8B /* Products */; projectDirPath = ""; projectRoot = ""; targets = ( 8D07F2BC0486CC7A007CD1D0 /* WidgetFramework */, 3B07BDE90E3F3F9E00647869 /* WidgetFrameworkTest */, 4024D162113D7D2400C7059E /* Test */, 4024D1E9113D83FF00C7059E /* TestAndBuild */, ); }; /* End PBXProject section */ /* Begin PBXResourcesBuildPhase section */ 8D07F2BF0486CC7A007CD1D0 /* Resources */ = { isa = PBXResourcesBuildPhase; buildActionMask = 2147483647; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXResourcesBuildPhase section */ /* Begin PBXRezBuildPhase section */ 8D07F2C50486CC7A007CD1D0 /* Rez */ = { isa = PBXRezBuildPhase; buildActionMask = 2147483647; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXRezBuildPhase section */ /* Begin PBXShellScriptBuildPhase section */ 4024D161113D7D2400C7059E /* ShellScript */ = { isa = PBXShellScriptBuildPhase; buildActionMask = 2147483647; files = ( ); inputPaths = ( ); outputPaths = ( ); runOnlyForDeploymentPostprocessing = 0; shellPath = /bin/sh; shellScript = "/bin/bash $SRCROOT/runtests.sh $BUILT_PRODUCTS_DIR/WidgetFrameworkTest\n"; }; /* End PBXShellScriptBuildPhase section */ /* Begin PBXSourcesBuildPhase section */ 3B07BDE70E3F3F9E00647869 /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 3B7EB1280E5AEE4600C7F239 /* widget_test.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; 8D07F2C10486CC7A007CD1D0 /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 3B7EB1250E5AEE3500C7F239 /* widget.cc in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXSourcesBuildPhase section */ /* Begin PBXTargetDependency section */ 3B07BDF10E3F3FAE00647869 /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 8D07F2BC0486CC7A007CD1D0 /* WidgetFramework */; targetProxy = 3B07BDF00E3F3FAE00647869 /* PBXContainerItemProxy */; }; 4024D166113D7D3100C7059E /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 3B07BDE90E3F3F9E00647869 /* WidgetFrameworkTest */; targetProxy = 4024D165113D7D3100C7059E /* PBXContainerItemProxy */; }; 4024D1ED113D840900C7059E /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 8D07F2BC0486CC7A007CD1D0 /* WidgetFramework */; targetProxy = 4024D1EC113D840900C7059E /* PBXContainerItemProxy */; }; 4024D1EF113D840D00C7059E /* PBXTargetDependency */ = { isa = PBXTargetDependency; target = 4024D162113D7D2400C7059E /* Test */; targetProxy = 4024D1EE113D840D00C7059E /* PBXContainerItemProxy */; }; /* End PBXTargetDependency section */ /* Begin XCBuildConfiguration section */ 3B07BDEC0E3F3F9F00647869 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = WidgetFrameworkTest; }; name = Debug; }; 3B07BDED0E3F3F9F00647869 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = WidgetFrameworkTest; }; name = Release; }; 4024D163113D7D2400C7059E /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = TestAndBuild; }; name = Debug; }; 4024D164113D7D2400C7059E /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = TestAndBuild; }; name = Release; }; 4024D1EA113D83FF00C7059E /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = TestAndBuild; }; name = Debug; }; 4024D1EB113D83FF00C7059E /* Release */ = { isa = XCBuildConfiguration; buildSettings = { PRODUCT_NAME = TestAndBuild; }; name = Release; }; 4FADC24308B4156D00ABE55E /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { DYLIB_COMPATIBILITY_VERSION = 1; DYLIB_CURRENT_VERSION = 1; FRAMEWORK_VERSION = A; INFOPLIST_FILE = Info.plist; INSTALL_PATH = "@loader_path/../Frameworks"; PRODUCT_NAME = Widget; }; name = Debug; }; 4FADC24408B4156D00ABE55E /* Release */ = { isa = XCBuildConfiguration; buildSettings = { DYLIB_COMPATIBILITY_VERSION = 1; DYLIB_CURRENT_VERSION = 1; FRAMEWORK_VERSION = A; INFOPLIST_FILE = Info.plist; INSTALL_PATH = "@loader_path/../Frameworks"; PRODUCT_NAME = Widget; }; name = Release; }; 4FADC24708B4156D00ABE55E /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { GCC_VERSION = 4.0; SDKROOT = /Developer/SDKs/MacOSX10.4u.sdk; }; name = Debug; }; 4FADC24808B4156D00ABE55E /* Release */ = { isa = XCBuildConfiguration; buildSettings = { GCC_VERSION = 4.0; SDKROOT = /Developer/SDKs/MacOSX10.4u.sdk; }; name = Release; }; /* End XCBuildConfiguration section */ /* Begin XCConfigurationList section */ 3B07BDF40E3F3FB600647869 /* Build configuration list for PBXNativeTarget "WidgetFrameworkTest" */ = { isa = XCConfigurationList; buildConfigurations = ( 3B07BDEC0E3F3F9F00647869 /* Debug */, 3B07BDED0E3F3F9F00647869 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4024D169113D7D4600C7059E /* Build configuration list for PBXAggregateTarget "Test" */ = { isa = XCConfigurationList; buildConfigurations = ( 4024D163113D7D2400C7059E /* Debug */, 4024D164113D7D2400C7059E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4024D1F0113D842B00C7059E /* Build configuration list for PBXAggregateTarget "TestAndBuild" */ = { isa = XCConfigurationList; buildConfigurations = ( 4024D1EA113D83FF00C7059E /* Debug */, 4024D1EB113D83FF00C7059E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4FADC24208B4156D00ABE55E /* Build configuration list for PBXNativeTarget "WidgetFramework" */ = { isa = XCConfigurationList; buildConfigurations = ( 4FADC24308B4156D00ABE55E /* Debug */, 4FADC24408B4156D00ABE55E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 4FADC24608B4156D00ABE55E /* Build configuration list for PBXProject "WidgetFramework" */ = { isa = XCConfigurationList; buildConfigurations = ( 4FADC24708B4156D00ABE55E /* Debug */, 4FADC24808B4156D00ABE55E /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; /* End XCConfigurationList section */ }; rootObject = 0867D690FE84028FC02AAC07 /* Project object */; } synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Samples/FrameworkSample/widget_test.cc0000600000175000017500000000515511561126632030104 0ustar synergysynergy// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // 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. // // Author: preston.a.jackson@gmail.com (Preston Jackson) // // Google Test - FrameworkSample // widget_test.cc // // This is a simple test file for the Widget class in the Widget.framework #include #include "gtest/gtest.h" #include // This test verifies that the constructor sets the internal state of the // Widget class correctly. TEST(WidgetInitializerTest, TestConstructor) { Widget widget(1.0f, "name"); EXPECT_FLOAT_EQ(1.0f, widget.GetFloatValue()); EXPECT_EQ(std::string("name"), widget.GetStringValue()); } // This test verifies the conversion of the float and string values to int and // char*, respectively. TEST(WidgetInitializerTest, TestConversion) { Widget widget(1.0f, "name"); EXPECT_EQ(1, widget.GetIntValue()); size_t max_size = 128; char buffer[max_size]; widget.GetCharPtrValue(buffer, max_size); EXPECT_STREQ("name", buffer); } // Use the Google Test main that is linked into the framework. It does something // like this: // int main(int argc, char** argv) { // testing::InitGoogleTest(&argc, argv); // return RUN_ALL_TESTS(); // } synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Scripts/0000700000175000017500000000000012140644175022170 5ustar synergysynergysynergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Scripts/runtests.sh0000600000175000017500000000503311561126632024415 0ustar synergysynergy#!/bin/bash # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. # Executes the samples and tests for the Google Test Framework. # Help the dynamic linker find the path to the libraries. export DYLD_FRAMEWORK_PATH=$BUILT_PRODUCTS_DIR export DYLD_LIBRARY_PATH=$BUILT_PRODUCTS_DIR # Create some executables. test_executables=("$BUILT_PRODUCTS_DIR/gtest_unittest-framework" "$BUILT_PRODUCTS_DIR/gtest_unittest" "$BUILT_PRODUCTS_DIR/sample1_unittest-framework" "$BUILT_PRODUCTS_DIR/sample1_unittest-static") # Now execute each one in turn keeping track of how many succeeded and failed. succeeded=0 failed=0 failed_list=() for test in ${test_executables[*]}; do "$test" result=$? if [ $result -eq 0 ]; then succeeded=$(( $succeeded + 1 )) else failed=$(( failed + 1 )) failed_list="$failed_list $test" fi done # Report the successes and failures to the console. echo "Tests complete with $succeeded successes and $failed failures." if [ $failed -ne 0 ]; then echo "The following tests failed:" echo $failed_list fi exit $failed synergy-1.4.12-Source/tools/gtest-1.6.0/xcode/Scripts/versiongenerate.py0000600000175000017500000001067011561126632025747 0ustar synergysynergy#!/usr/bin/env python # # Copyright 2008, Google Inc. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # * 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. # * Neither the name of Google Inc. 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 # 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. """A script to prepare version informtion for use the gtest Info.plist file. This script extracts the version information from the configure.ac file and uses it to generate a header file containing the same information. The #defines in this header file will be included in during the generation of the Info.plist of the framework, giving the correct value to the version shown in the Finder. This script makes the following assumptions (these are faults of the script, not problems with the Autoconf): 1. The AC_INIT macro will be contained within the first 1024 characters of configure.ac 2. The version string will be 3 integers separated by periods and will be surrounded by squre brackets, "[" and "]" (e.g. [1.0.1]). The first segment represents the major version, the second represents the minor version and the third represents the fix version. 3. No ")" character exists between the opening "(" and closing ")" of AC_INIT, including in comments and character strings. """ import sys import re # Read the command line argument (the output directory for Version.h) if (len(sys.argv) < 3): print "Usage: versiongenerate.py input_dir output_dir" sys.exit(1) else: input_dir = sys.argv[1] output_dir = sys.argv[2] # Read the first 1024 characters of the configure.ac file config_file = open("%s/configure.ac" % input_dir, 'r') buffer_size = 1024 opening_string = config_file.read(buffer_size) config_file.close() # Extract the version string from the AC_INIT macro # The following init_expression means: # Extract three integers separated by periods and surrounded by squre # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy # (*? is the non-greedy flag) since that would pull in everything between # the first "(" and the last ")" in the file. version_expression = re.compile(r"AC_INIT\(.*?\[(\d+)\.(\d+)\.(\d+)\].*?\)", re.DOTALL) version_values = version_expression.search(opening_string) major_version = version_values.group(1) minor_version = version_values.group(2) fix_version = version_values.group(3) # Write the version information to a header file to be included in the # Info.plist file. file_data = """// // DO NOT MODIFY THIS FILE (but you can delete it) // // This file is autogenerated by the versiongenerate.py script. This script // is executed in a "Run Script" build phase when creating gtest.framework. This // header file is not used during compilation of C-source. Rather, it simply // defines some version strings for substitution in the Info.plist. Because of // this, we are not not restricted to C-syntax nor are we using include guards. // #define GTEST_VERSIONINFO_SHORT %s.%s #define GTEST_VERSIONINFO_LONG %s.%s.%s """ % (major_version, minor_version, major_version, minor_version, fix_version) version_file = open("%s/Version.h" % output_dir, 'w') version_file.write(file_data) version_file.close()